Classes
class	OutVecOwner

Functions
ResultSetPtr	get_merged_result (std::vector< std::pair< ResultSetPtr, std::vector< size_t >>> &results_per_device)

ReductionCode	get_reduction_code (std::vector< std::pair< ResultSetPtr, std::vector< size_t >>> &results_per_device, int64_t *compilation_queue_time)

size_t	compute_buffer_entry_guess (const std::vector< InputTableInfo > &query_infos)

std::string	get_table_name (const InputDescriptor &input_desc, const Catalog_Namespace::Catalog &cat)

size_t	getDeviceBasedScanLimit (const ExecutorDeviceType device_type, const int device_count)

void	checkWorkUnitWatchdog (const RelAlgExecutionUnit &ra_exe_unit, const std::vector< InputTableInfo > &table_infos, const Catalog_Namespace::Catalog &cat, const ExecutorDeviceType device_type, const int device_count)

template<typename T >
std::vector< std::string >	expr_container_to_string (const T &expr_container)

template<>
std::vector< std::string >	expr_container_to_string (const std::list< Analyzer::OrderEntry > &expr_container)

std::string	join_type_to_string (const JoinType type)

std::string	sort_algorithm_to_string (const SortAlgorithm algorithm)

RelAlgExecutionUnit	replace_scan_limit (const RelAlgExecutionUnit &ra_exe_unit_in, const size_t new_scan_limit)

int64_t	inline_null_val (const SQLTypeInfo &ti, const bool float_argument_input)

void	fill_entries_for_empty_input (std::vector< TargetInfo > &target_infos, std::vector< int64_t > &entry, const std::vector< Analyzer::Expr * > &target_exprs, const QueryMemoryDescriptor &query_mem_desc)

ResultSetPtr	build_row_for_empty_input (const std::vector< Analyzer::Expr * > &target_exprs_in, const QueryMemoryDescriptor &query_mem_desc, const ExecutorDeviceType device_type)

size_t	permute_storage_columnar (const ResultSetStorage input_storage, const QueryMemoryDescriptor &input_query_mem_desc, const ResultSetStorage output_storage, size_t output_row_index, const QueryMemoryDescriptor &output_query_mem_desc, const std::vector< uint32_t > &top_permutation)

size_t	permute_storage_row_wise (const ResultSetStorage input_storage, const ResultSetStorage output_storage, size_t output_row_index, const QueryMemoryDescriptor &output_query_mem_desc, const std::vector< uint32_t > &top_permutation)

bool	has_lazy_fetched_columns (const std::vector< ColumnLazyFetchInfo > &fetched_cols)

const ColumnDescriptor *	try_get_column_descriptor (const InputColDescriptor *col_desc, const Catalog_Namespace::Catalog &cat)

bool	check_rows_less_than_needed (const ResultSetPtr &results, const size_t scan_limit)

void	add_deleted_col_to_map (PlanState::DeletedColumnsMap &deleted_cols_map, const ColumnDescriptor *deleted_cd)

std::tuple< bool, int64_t, int64_t >	get_hpt_overflow_underflow_safe_scaled_values (const int64_t chunk_min, const int64_t chunk_max, const SQLTypeInfo &lhs_type, const SQLTypeInfo &rhs_type)

Function Documentation

void anonymous_namespace{Execute.cpp}::add_deleted_col_to_map	(	PlanState::DeletedColumnsMap &	deleted_cols_map,
		const ColumnDescriptor *	deleted_cd
	)

Definition at line 3420 of file Execute.cpp.

References CHECK, CHECK_EQ, and ColumnDescriptor::tableId.

Referenced by Executor::addDeletedColumn().

                                                                 {
   auto deleted_cols_it = deleted_cols_map.find(deleted_cd->tableId);
   if (deleted_cols_it == deleted_cols_map.end()) {
     CHECK(
         deleted_cols_map.insert(std::make_pair(deleted_cd->tableId, deleted_cd)).second);
   } else {
     CHECK_EQ(deleted_cd, deleted_cols_it->second);
   }
 }

Here is the caller graph for this function:

ResultSetPtr anonymous_namespace{Execute.cpp}::build_row_for_empty_input	(	const std::vector< Analyzer::Expr * > &	target_exprs_in,
		const QueryMemoryDescriptor &	query_mem_desc,
		const ExecutorDeviceType	device_type
	)

Definition at line 1811 of file Execute.cpp.

References CHECK, fill_entries_for_empty_input(), QueryMemoryDescriptor::getExecutor(), query_mem_desc, and SQLTypeInfo::set_notnull().

Referenced by Executor::collectAllDeviceResults().

                                           {
   std::vector<std::shared_ptr<Analyzer::Expr>> target_exprs_owned_copies;
   std::vector<Analyzer::Expr*> target_exprs;
   for (const auto target_expr : target_exprs_in) {
     const auto target_expr_copy =
         std::dynamic_pointer_cast<Analyzer::AggExpr>(target_expr->deep_copy());
     CHECK(target_expr_copy);
     auto ti = target_expr->get_type_info();
     ti.set_notnull(false);
     target_expr_copy->set_type_info(ti);
     if (target_expr_copy->get_arg()) {
       auto arg_ti = target_expr_copy->get_arg()->get_type_info();
       arg_ti.set_notnull(false);
       target_expr_copy->get_arg()->set_type_info(arg_ti);
     }
     target_exprs_owned_copies.push_back(target_expr_copy);
     target_exprs.push_back(target_expr_copy.get());
   }
   std::vector<TargetInfo> target_infos;
   std::vector<int64_t> entry;
   fill_entries_for_empty_input(target_infos, entry, target_exprs, query_mem_desc);
   const auto executor = query_mem_desc.getExecutor();
   CHECK(executor);
   auto row_set_mem_owner = executor->getRowSetMemoryOwner();
   CHECK(row_set_mem_owner);
   auto rs = std::make_shared<ResultSet>(target_infos,
                                         device_type,
                                         query_mem_desc,
                                         row_set_mem_owner,
                                         executor->getCatalog(),
                                         executor->blockSize(),
                                         executor->gridSize());
   rs->allocateStorage();
   rs->fillOneEntry(entry);
   return rs;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

bool anonymous_namespace{Execute.cpp}::check_rows_less_than_needed	(	const ResultSetPtr &	results,
		const size_t	scan_limit
	)

Definition at line 3045 of file Execute.cpp.

References CHECK.

Referenced by Executor::executePlanWithGroupBy().

                                                                                        {
   CHECK(scan_limit);
   return results && results->rowCount() < scan_limit;
 }

Here is the caller graph for this function:

void anonymous_namespace{Execute.cpp}::checkWorkUnitWatchdog	(	const RelAlgExecutionUnit &	ra_exe_unit,
		const std::vector< InputTableInfo > &	table_infos,
		const Catalog_Namespace::Catalog &	cat,
		const ExecutorDeviceType	device_type,
		const int	device_count
	)

Definition at line 1106 of file Execute.cpp.

References SortInfo::algorithm, get_table_name(), getDeviceBasedScanLimit(), RelAlgExecutionUnit::groupby_exprs, Executor::high_scan_limit, RelAlgExecutionUnit::input_descs, join(), RelAlgExecutionUnit::scan_limit, RelAlgExecutionUnit::sort_info, StreamingTopN, RelAlgExecutionUnit::target_exprs, to_string(), and RelAlgExecutionUnit::use_bump_allocator.

Referenced by Executor::createKernels().

                                                    {
   for (const auto target_expr : ra_exe_unit.target_exprs) {
     if (dynamic_cast<const Analyzer::AggExpr*>(target_expr)) {
       return;
     }
   }
   if (!ra_exe_unit.scan_limit && table_infos.size() == 1 &&
       table_infos.front().info.getPhysicalNumTuples() < Executor::high_scan_limit) {
     // Allow a query with no scan limit to run on small tables
     return;
   }
   if (ra_exe_unit.use_bump_allocator) {
     // Bump allocator removes the scan limit (and any knowledge of the size of the output
     // relative to the size of the input), so we bypass this check for now
     return;
   }
   if (ra_exe_unit.sort_info.algorithm != SortAlgorithm::StreamingTopN &&
       ra_exe_unit.groupby_exprs.size() == 1 && !ra_exe_unit.groupby_exprs.front() &&
       (!ra_exe_unit.scan_limit ||
        ra_exe_unit.scan_limit > getDeviceBasedScanLimit(device_type, device_count))) {
     std::vector<std::string> table_names;
     const auto& input_descs = ra_exe_unit.input_descs;
     for (const auto& input_desc : input_descs) {
       table_names.push_back(get_table_name(input_desc, cat));
     }
     if (!ra_exe_unit.scan_limit) {
       throw WatchdogException(
           "Projection query would require a scan without a limit on table(s): " +
           boost::algorithm::join(table_names, ", "));
     } else {
       throw WatchdogException(
           "Projection query output result set on table(s): " +
           boost::algorithm::join(table_names, ", ") + "  would contain " +
           std::to_string(ra_exe_unit.scan_limit) +
           " rows, which is more than the current system limit of " +
           std::to_string(getDeviceBasedScanLimit(device_type, device_count)));
     }
   }
 }

Here is the call graph for this function:

Here is the caller graph for this function:

size_t anonymous_namespace{Execute.cpp}::compute_buffer_entry_guess ( const std::vector< InputTableInfo > & query_infos )

Definition at line 1056 of file Execute.cpp.

References CHECK.

Referenced by Executor::executeWorkUnitImpl().

                                                                                 {
   using Fragmenter_Namespace::FragmentInfo;
   // Check for overflows since we're multiplying potentially big table sizes.
   using checked_size_t = boost::multiprecision::number<
       boost::multiprecision::cpp_int_backend<64,
                                              64,
                                              boost::multiprecision::unsigned_magnitude,
                                              boost::multiprecision::checked,
                                              void>>;
   checked_size_t max_groups_buffer_entry_guess = 1;
   for (const auto& query_info : query_infos) {
     CHECK(!query_info.info.fragments.empty());
     auto it = std::max_element(query_info.info.fragments.begin(),
                                query_info.info.fragments.end(),
                                [](const FragmentInfo& f1, const FragmentInfo& f2) {
                                  return f1.getNumTuples() < f2.getNumTuples();
                                });
     max_groups_buffer_entry_guess *= it->getNumTuples();
   }
   // Cap the rough approximation to 100M entries, it's unlikely we can do a great job for
   // baseline group layout with that many entries anyway.
   constexpr size_t max_groups_buffer_entry_guess_cap = 100000000;
   try {
     return std::min(static_cast<size_t>(max_groups_buffer_entry_guess),
                     max_groups_buffer_entry_guess_cap);
   } catch (...) {
     return max_groups_buffer_entry_guess_cap;
   }
 }

Here is the caller graph for this function:

template<typename T >

std::vector<std::string> anonymous_namespace{Execute.cpp}::expr_container_to_string ( const T & expr_container )

Definition at line 1177 of file Execute.cpp.

Referenced by operator<<().

                                                                        {
   std::vector<std::string> expr_strs;
   for (const auto& expr : expr_container) {
     if (!expr) {
       expr_strs.emplace_back("NULL");
     } else {
       expr_strs.emplace_back(expr->toString());
     }
   }
   return expr_strs;
 }

Here is the caller graph for this function:

template<>

std::vector<std::string> anonymous_namespace{Execute.cpp}::expr_container_to_string ( const std::list< Analyzer::OrderEntry > & expr_container )

Definition at line 1190 of file Execute.cpp.

                                                        {
   std::vector<std::string> expr_strs;
   for (const auto& expr : expr_container) {
     expr_strs.emplace_back(expr.toString());
   }
   return expr_strs;
 }

void anonymous_namespace{Execute.cpp}::fill_entries_for_empty_input	(	std::vector< TargetInfo > &	target_infos,
		std::vector< int64_t > &	entry,
		const std::vector< Analyzer::Expr * > &	target_exprs,
		const QueryMemoryDescriptor &	query_mem_desc
	)

Definition at line 1756 of file Execute.cpp.

References Bitmap, CHECK, g_bigint_count, g_cluster, get_target_info(), QueryMemoryDescriptor::getCountDistinctDescriptor(), QueryMemoryDescriptor::getExecutor(), i, inline_null_val(), kAPPROX_COUNT_DISTINCT, kAVG, kCOUNT, kSAMPLE, kSINGLE_VALUE, StdSet, and takes_float_argument().

Referenced by build_row_for_empty_input().

                                                                                {
   for (size_t target_idx = 0; target_idx < target_exprs.size(); ++target_idx) {
     const auto target_expr = target_exprs[target_idx];
     const auto agg_info = get_target_info(target_expr, g_bigint_count);
     CHECK(agg_info.is_agg);
     target_infos.push_back(agg_info);
     if (g_cluster) {
       const auto executor = query_mem_desc.getExecutor();
       CHECK(executor);
       auto row_set_mem_owner = executor->getRowSetMemoryOwner();
       CHECK(row_set_mem_owner);
       const auto& count_distinct_desc =
           query_mem_desc.getCountDistinctDescriptor(target_idx);
       if (count_distinct_desc.impl_type_ == CountDistinctImplType::Bitmap) {
         CHECK(row_set_mem_owner);
         auto count_distinct_buffer = row_set_mem_owner->allocateCountDistinctBuffer(
             count_distinct_desc.bitmapPaddedSizeBytes(),
             /*thread_idx=*/0);  // TODO: can we detect thread idx here?
         entry.push_back(reinterpret_cast<int64_t>(count_distinct_buffer));
         continue;
       }
       if (count_distinct_desc.impl_type_ == CountDistinctImplType::StdSet) {
         auto count_distinct_set = new std::set<int64_t>();
         CHECK(row_set_mem_owner);
         row_set_mem_owner->addCountDistinctSet(count_distinct_set);
         entry.push_back(reinterpret_cast<int64_t>(count_distinct_set));
         continue;
       }
     }
     const bool float_argument_input = takes_float_argument(agg_info);
     if (agg_info.agg_kind == kCOUNT || agg_info.agg_kind == kAPPROX_COUNT_DISTINCT) {
       entry.push_back(0);
     } else if (agg_info.agg_kind == kAVG) {
       entry.push_back(inline_null_val(agg_info.sql_type, float_argument_input));
       entry.push_back(0);
     } else if (agg_info.agg_kind == kSINGLE_VALUE || agg_info.agg_kind == kSAMPLE) {
       if (agg_info.sql_type.is_geometry()) {
         for (int i = 0; i < agg_info.sql_type.get_physical_coord_cols() * 2; i++) {
           entry.push_back(0);
         }
       } else if (agg_info.sql_type.is_varlen()) {
         entry.push_back(0);
         entry.push_back(0);
       } else {
         entry.push_back(inline_null_val(agg_info.sql_type, float_argument_input));
       }
     } else {
       entry.push_back(inline_null_val(agg_info.sql_type, float_argument_input));
     }
   }
 }

Here is the call graph for this function:

Here is the caller graph for this function:

std::tuple<bool, int64_t, int64_t> anonymous_namespace{Execute.cpp}::get_hpt_overflow_underflow_safe_scaled_values	(	const int64_t	chunk_min,
		const int64_t	chunk_max,
		const SQLTypeInfo &	lhs_type,
		const SQLTypeInfo &	rhs_type
	)

Definition at line 3476 of file Execute.cpp.

References CHECK, SQLTypeInfo::get_dimension(), and DateTimeUtils::get_timestamp_precision_scale().

Referenced by Executor::skipFragment().

                                  {
   const int32_t ldim = lhs_type.get_dimension();
   const int32_t rdim = rhs_type.get_dimension();
   CHECK(ldim != rdim);
   const auto scale = DateTimeUtils::get_timestamp_precision_scale(abs(rdim - ldim));
   if (ldim > rdim) {
     // LHS type precision is more than RHS col type. No chance of overflow/underflow.
     return {true, chunk_min / scale, chunk_max / scale};
   }
 
   using checked_int64_t = boost::multiprecision::number<
       boost::multiprecision::cpp_int_backend<64,
                                              64,
                                              boost::multiprecision::signed_magnitude,
                                              boost::multiprecision::checked,
                                              void>>;
 
   try {
     auto ret =
         std::make_tuple(true,
                         int64_t(checked_int64_t(chunk_min) * checked_int64_t(scale)),
                         int64_t(checked_int64_t(chunk_max) * checked_int64_t(scale)));
     return ret;
   } catch (const std::overflow_error& e) {
     // noop
   }
   return std::make_tuple(false, chunk_min, chunk_max);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

ResultSetPtr anonymous_namespace{Execute.cpp}::get_merged_result ( std::vector< std::pair< ResultSetPtr, std::vector< size_t >>> & results_per_device )

Definition at line 856 of file Execute.cpp.

References CHECK.

Referenced by Executor::resultsUnion().

                                                                              {
   auto& first = results_per_device.front().first;
   CHECK(first);
   for (size_t dev_idx = 1; dev_idx < results_per_device.size(); ++dev_idx) {
     const auto& next = results_per_device[dev_idx].first;
     CHECK(next);
     first->append(*next);
   }
   return std::move(first);
 }

Here is the caller graph for this function:

ReductionCode anonymous_namespace{Execute.cpp}::get_reduction_code	(	std::vector< std::pair< ResultSetPtr, std::vector< size_t >>> &	results_per_device,
		int64_t *	compilation_queue_time
	)

Definition at line 930 of file Execute.cpp.

References ResultSetReductionJIT::codegen(), Executor::compilation_mutex_, timer_start(), and timer_stop().

Referenced by Executor::reduceMultiDeviceResultSets().

                                      {
   auto clock_begin = timer_start();
   std::lock_guard<std::mutex> compilation_lock(Executor::compilation_mutex_);
   *compilation_queue_time = timer_stop(clock_begin);
   const auto& this_result_set = results_per_device[0].first;
   ResultSetReductionJIT reduction_jit(this_result_set->getQueryMemDesc(),
                                       this_result_set->getTargetInfos(),
                                       this_result_set->getTargetInitVals());
   return reduction_jit.codegen();
 };

Here is the call graph for this function:

Here is the caller graph for this function:

std::string anonymous_namespace{Execute.cpp}::get_table_name	(	const InputDescriptor &	input_desc,
		const Catalog_Namespace::Catalog &	cat
	)

Definition at line 1086 of file Execute.cpp.

References CHECK, Catalog_Namespace::Catalog::getMetadataForTable(), InputDescriptor::getSourceType(), InputDescriptor::getTableId(), TABLE, and to_string().

Referenced by checkWorkUnitWatchdog().

                                                                 {
   const auto source_type = input_desc.getSourceType();
   if (source_type == InputSourceType::TABLE) {
     const auto td = cat.getMetadataForTable(input_desc.getTableId());
     CHECK(td);
     return td->tableName;
   } else {
     return "$TEMPORARY_TABLE" + std::to_string(-input_desc.getTableId());
   }
 }

Here is the call graph for this function:

Here is the caller graph for this function:

size_t anonymous_namespace{Execute.cpp}::getDeviceBasedScanLimit	(	const ExecutorDeviceType	device_type,
		const int	device_count
	)

inline

Definition at line 1098 of file Execute.cpp.

References GPU, and Executor::high_scan_limit.

Referenced by checkWorkUnitWatchdog().

                                                               {
   if (device_type == ExecutorDeviceType::GPU) {
     return device_count * Executor::high_scan_limit;
   }
   return Executor::high_scan_limit;
 }

Here is the caller graph for this function:

bool anonymous_namespace{Execute.cpp}::has_lazy_fetched_columns ( const std::vector< ColumnLazyFetchInfo > & fetched_cols )

Definition at line 2033 of file Execute.cpp.

Referenced by Executor::createKernels().

                                                                                   {
   for (const auto& col : fetched_cols) {
     if (col.is_lazily_fetched) {
       return true;
     }
   }
   return false;
 }

Here is the caller graph for this function:

int64_t anonymous_namespace{Execute.cpp}::inline_null_val	(	const SQLTypeInfo &	ti,
		const bool	float_argument_input
	)

Definition at line 1741 of file Execute.cpp.

References CHECK, SQLTypeInfo::get_type(), inline_fp_null_val(), inline_int_null_val(), SQLTypeInfo::is_boolean(), SQLTypeInfo::is_fp(), SQLTypeInfo::is_number(), SQLTypeInfo::is_string(), SQLTypeInfo::is_time(), and kFLOAT.

Referenced by fill_entries_for_empty_input().

                                                                                 {
   CHECK(ti.is_number() || ti.is_time() || ti.is_boolean() || ti.is_string());
   if (ti.is_fp()) {
     if (float_argument_input && ti.get_type() == kFLOAT) {
       int64_t float_null_val = 0;
       *reinterpret_cast<float*>(may_alias_ptr(&float_null_val)) =
           static_cast<float>(inline_fp_null_val(ti));
       return float_null_val;
     }
     const auto double_null_val = inline_fp_null_val(ti);
     return *reinterpret_cast<const int64_t*>(may_alias_ptr(&double_null_val));
   }
   return inline_int_null_val(ti);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

std::string anonymous_namespace{Execute.cpp}::join_type_to_string ( const JoinType type )

Definition at line 1199 of file Execute.cpp.

References INNER, INVALID, LEFT, and UNREACHABLE.

Referenced by operator<<(), and ra_exec_unit_desc_for_caching().

                                                    {
   switch (type) {
     case JoinType::INNER:
       return "INNER";
     case JoinType::LEFT:
       return "LEFT";
     case JoinType::INVALID:
       return "INVALID";
   }
   UNREACHABLE();
   return "";
 }

Here is the caller graph for this function:

size_t anonymous_namespace{Execute.cpp}::permute_storage_columnar	(	const ResultSetStorage *	input_storage,
		const QueryMemoryDescriptor &	input_query_mem_desc,
		const ResultSetStorage *	output_storage,
		size_t	output_row_index,
		const QueryMemoryDescriptor &	output_query_mem_desc,
		const std::vector< uint32_t > &	top_permutation
	)

This functions uses the permutation indices in "top_permutation", and permutes all group columns (if any) and aggregate columns into the output storage. In columnar layout, since different columns are not consecutive in the memory, different columns are copied back into the output storage separetely and through different memcpy operations.

output_row_index contains the current index of the output storage (input storage will be appended to it), and the final output row index is returned.

Definition at line 1897 of file Execute.cpp.

References QueryMemoryDescriptor::getColOffInBytes(), QueryMemoryDescriptor::getKeyCount(), QueryMemoryDescriptor::getPaddedSlotWidthBytes(), QueryMemoryDescriptor::getPrependedGroupColOffInBytes(), QueryMemoryDescriptor::getSlotCount(), ResultSetStorage::getUnderlyingBuffer(), and QueryMemoryDescriptor::groupColWidth().

Referenced by Executor::collectAllDeviceShardedTopResults().

                                                                             {
   const auto output_buffer = output_storage->getUnderlyingBuffer();
   const auto input_buffer = input_storage->getUnderlyingBuffer();
   for (const auto sorted_idx : top_permutation) {
     // permuting all group-columns in this result set into the final buffer:
     for (size_t group_idx = 0; group_idx < input_query_mem_desc.getKeyCount();
          group_idx++) {
       const auto input_column_ptr =
           input_buffer + input_query_mem_desc.getPrependedGroupColOffInBytes(group_idx) +
           sorted_idx * input_query_mem_desc.groupColWidth(group_idx);
       const auto output_column_ptr =
           output_buffer +
           output_query_mem_desc.getPrependedGroupColOffInBytes(group_idx) +
           output_row_index * output_query_mem_desc.groupColWidth(group_idx);
       memcpy(output_column_ptr,
              input_column_ptr,
              output_query_mem_desc.groupColWidth(group_idx));
     }
     // permuting all agg-columns in this result set into the final buffer:
     for (size_t slot_idx = 0; slot_idx < input_query_mem_desc.getSlotCount();
          slot_idx++) {
       const auto input_column_ptr =
           input_buffer + input_query_mem_desc.getColOffInBytes(slot_idx) +
           sorted_idx * input_query_mem_desc.getPaddedSlotWidthBytes(slot_idx);
       const auto output_column_ptr =
           output_buffer + output_query_mem_desc.getColOffInBytes(slot_idx) +
           output_row_index * output_query_mem_desc.getPaddedSlotWidthBytes(slot_idx);
       memcpy(output_column_ptr,
              input_column_ptr,
              output_query_mem_desc.getPaddedSlotWidthBytes(slot_idx));
     }
     ++output_row_index;
   }
   return output_row_index;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

size_t anonymous_namespace{Execute.cpp}::permute_storage_row_wise	(	const ResultSetStorage *	input_storage,
		const ResultSetStorage *	output_storage,
		size_t	output_row_index,
		const QueryMemoryDescriptor &	output_query_mem_desc,
		const std::vector< uint32_t > &	top_permutation
	)

This functions uses the permutation indices in "top_permutation", and permutes all group columns (if any) and aggregate columns into the output storage. In row-wise, since different columns are consecutive within the memory, it suffices to perform a single memcpy operation and copy the whole row.

output_row_index contains the current index of the output storage (input storage will be appended to it), and the final output row index is returned.

Definition at line 1947 of file Execute.cpp.

References QueryMemoryDescriptor::getRowSize(), and ResultSetStorage::getUnderlyingBuffer().

Referenced by Executor::collectAllDeviceShardedTopResults().

                                                                             {
   const auto output_buffer = output_storage->getUnderlyingBuffer();
   const auto input_buffer = input_storage->getUnderlyingBuffer();
   for (const auto sorted_idx : top_permutation) {
     const auto row_ptr = input_buffer + sorted_idx * output_query_mem_desc.getRowSize();
     memcpy(output_buffer + output_row_index * output_query_mem_desc.getRowSize(),
            row_ptr,
            output_query_mem_desc.getRowSize());
     ++output_row_index;
   }
   return output_row_index;
 }

Here is the call graph for this function:

Here is the caller graph for this function:

RelAlgExecutionUnit anonymous_namespace{Execute.cpp}::replace_scan_limit	(	const RelAlgExecutionUnit &	ra_exe_unit_in,
		const size_t	new_scan_limit
	)

Definition at line 1328 of file Execute.cpp.

References RelAlgExecutionUnit::estimator, RelAlgExecutionUnit::groupby_exprs, RelAlgExecutionUnit::input_col_descs, RelAlgExecutionUnit::input_descs, RelAlgExecutionUnit::join_quals, RelAlgExecutionUnit::quals, RelAlgExecutionUnit::query_hint, RelAlgExecutionUnit::query_state, RelAlgExecutionUnit::simple_quals, RelAlgExecutionUnit::sort_info, RelAlgExecutionUnit::target_exprs, RelAlgExecutionUnit::union_all, and RelAlgExecutionUnit::use_bump_allocator.

Referenced by Executor::executeWorkUnit().

                                                                     {
   return {ra_exe_unit_in.input_descs,
           ra_exe_unit_in.input_col_descs,
           ra_exe_unit_in.simple_quals,
           ra_exe_unit_in.quals,
           ra_exe_unit_in.join_quals,
           ra_exe_unit_in.groupby_exprs,
           ra_exe_unit_in.target_exprs,
           ra_exe_unit_in.estimator,
           ra_exe_unit_in.sort_info,
           new_scan_limit,
           ra_exe_unit_in.query_hint,
           ra_exe_unit_in.use_bump_allocator,
           ra_exe_unit_in.union_all,
           ra_exe_unit_in.query_state};
 }

Here is the caller graph for this function:

std::string anonymous_namespace{Execute.cpp}::sort_algorithm_to_string ( const SortAlgorithm algorithm )

Definition at line 1212 of file Execute.cpp.

References Default, SpeculativeTopN, StreamingTopN, and UNREACHABLE.

Referenced by operator<<().

                                                                   {
   switch (algorithm) {
     case SortAlgorithm::Default:
       return "ResultSet";
     case SortAlgorithm::SpeculativeTopN:
       return "Speculative Top N";
     case SortAlgorithm::StreamingTopN:
       return "Streaming Top N";
   }
   UNREACHABLE();
   return "";
 }

Here is the caller graph for this function:

const ColumnDescriptor* anonymous_namespace{Execute.cpp}::try_get_column_descriptor	(	const InputColDescriptor *	col_desc,
		const Catalog_Namespace::Catalog &	cat
	)

Definition at line 2307 of file Execute.cpp.

References get_column_descriptor_maybe(), InputColDescriptor::getColId(), InputColDescriptor::getScanDesc(), and InputDescriptor::getTableId().

Referenced by Executor::fetchChunks(), and Executor::fetchUnionChunks().

                                                                                        {
   const int table_id = col_desc->getScanDesc().getTableId();
   const int col_id = col_desc->getColId();
   return get_column_descriptor_maybe(col_id, table_id, cat);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

Classes

Functions

Function Documentation