SortInfo Struct Reference

#include <RelAlgExecutionUnit.h>

Public Member Functions
	SortInfo ()
	algorithm (SortAlgorithm::Default)
	limit (std::nullopt)
	offset (0)
	SortInfo (const std::list< Analyzer::OrderEntry > &oe, const SortAlgorithm sa, std::optional< size_t > l, size_t o)
SortInfo &	operator= (const SortInfo &other)
size_t	hashLimit () const

Static Public Member Functions
static SortInfo	createFromSortNode (const RelSort *sort_node)

Public Attributes
std::list< Analyzer::OrderEntry >	order_entries
SortAlgorithm	algorithm
std::optional< size_t >	limit
size_t	offset

Detailed Description

Definition at line 116 of file RelAlgExecutionUnit.h.

Constructor & Destructor Documentation

SortInfo::SortInfo ( )

inline

Definition at line 117 of file RelAlgExecutionUnit.h.

      : order_entries({})

SortInfo::SortInfo ( const std::list< Analyzer::OrderEntry > &  oe, const SortAlgorithm  sa, std::optional< size_t >  l, size_t  o  )

inline

Definition at line 123 of file RelAlgExecutionUnit.h.

      : order_entries(oe), algorithm(sa), limit(l), offset(o) {}

Member Function Documentation

SortInfo::algorithm

(

SortAlgorithm::Default

)

static SortInfo SortInfo::createFromSortNode ( const RelSort *  sort_node )

inlinestatic

Definition at line 137 of file RelAlgExecutionUnit.h.

References RelSort::getLimit(), RelSort::getOffset(), RelSort::getOrderEntries(), and SpeculativeTopN.

Referenced by RelAlgExecutor::executeRelAlgStep(), and RaExecutionSequence::next().

                                                               {
    return {sort_node->getOrderEntries(),
            SortAlgorithm::SpeculativeTopN,
            sort_node->getLimit(),
            sort_node->getOffset()};
  }

Here is the call graph for this function:

Here is the caller graph for this function:

size_t SortInfo::hashLimit ( ) const

inline

Definition at line 144 of file RelAlgExecutionUnit.h.

References limit.

Referenced by QueryPlanDagExtractor::applyLimitClauseToCacheKey().

                           {
    size_t hash{0};
    boost::hash_combine(hash, limit.has_value());
    boost::hash_combine(hash, limit.value_or(0));
    return hash;
  }

Here is the caller graph for this function:

SortInfo::limit

(

std::nullopt

)

SortInfo::offset ( 0  )

inline

Definition at line 121 of file RelAlgExecutionUnit.h.

{}

SortInfo& SortInfo::operator= ( const SortInfo &  other )

inline

Definition at line 129 of file RelAlgExecutionUnit.h.

References algorithm, limit, offset, and order_entries.

                                             {
    order_entries = other.order_entries;
    algorithm = other.algorithm;
    limit = other.limit;
    offset = other.offset;
    return *this;
  }

Member Data Documentation

SortAlgorithm SortInfo::algorithm

Definition at line 152 of file RelAlgExecutionUnit.h.

Referenced by anonymous_namespace{Execute.cpp}::checkWorkUnitWatchdog(), operator=(), use_speculative_top_n(), and anonymous_namespace{QueryMemoryDescriptor.cpp}::use_streaming_top_n().

std::optional<size_t> SortInfo::limit

Definition at line 153 of file RelAlgExecutionUnit.h.

Referenced by QueryMemoryInitializer::applyStreamingTopNOffsetCpu(), GroupByAndAggregate::codegenOutputSlot(), Executor::collectAllDeviceShardedTopResults(), QueryMemoryInitializer::copyGroupByBuffersFromGpu(), QueryMemoryInitializer::createAndInitializeGroupByBufferGpu(), QueryMemoryDescriptor::getBufferSizeBytes(), hashLimit(), QueryMemoryInitializer::initGroupByBuffer(), operator=(), Executor::reduceSpeculativeTopN(), GroupByAndAggregate::shard_count_for_top_groups(), QueryFragmentDescriptor::terminateDispatchMaybe(), use_speculative_top_n(), and anonymous_namespace{QueryMemoryDescriptor.cpp}::use_streaming_top_n().

size_t SortInfo::offset

Definition at line 154 of file RelAlgExecutionUnit.h.

Referenced by QueryMemoryInitializer::applyStreamingTopNOffsetCpu(), GroupByAndAggregate::codegenOutputSlot(), Executor::collectAllDeviceShardedTopResults(), QueryMemoryInitializer::copyGroupByBuffersFromGpu(), QueryMemoryInitializer::createAndInitializeGroupByBufferGpu(), QueryMemoryDescriptor::getBufferSizeBytes(), QueryMemoryInitializer::initGroupByBuffer(), operator=(), Executor::reduceSpeculativeTopN(), QueryFragmentDescriptor::terminateDispatchMaybe(), and anonymous_namespace{QueryMemoryDescriptor.cpp}::use_streaming_top_n().

std::list<Analyzer::OrderEntry> SortInfo::order_entries

Definition at line 151 of file RelAlgExecutionUnit.h.

Referenced by anonymous_namespace{RelAlgExecutor.cpp}::can_output_columnar(), anonymous_namespace{RelAlgExecutor.cpp}::can_use_bump_allocator(), GroupByAndAggregate::codegenOutputSlot(), Executor::collectAllDeviceShardedTopResults(), GroupByAndAggregate::getColRangeInfo(), GroupByAndAggregate::initQueryMemoryDescriptor(), anonymous_namespace{QueryFragmentDescriptor.cpp}::is_sample_query(), QueryExecutionContext::launchGpuCode(), operator=(), Executor::reduceSpeculativeTopN(), GroupByAndAggregate::shard_count_for_top_groups(), anonymous_namespace{QueryMemoryDescriptor.cpp}::target_expr_proj_indices(), and anonymous_namespace{QueryMemoryDescriptor.cpp}::use_streaming_top_n().

---

The documentation for this struct was generated from the following file:

• /home/jenkins-slave/workspace/core-os-doxygen/QueryEngine/RelAlgExecutionUnit.h