OmniSciDB  6686921089
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
Execute.cpp File Reference
#include "QueryEngine/Execute.h"
#include <llvm/Transforms/Utils/BasicBlockUtils.h>
#include <boost/filesystem/operations.hpp>
#include <boost/filesystem/path.hpp>
#include <chrono>
#include <ctime>
#include <future>
#include <iostream>
#include <memory>
#include <mutex>
#include <numeric>
#include <set>
#include <thread>
#include "Catalog/Catalog.h"
#include "CudaMgr/CudaMgr.h"
#include "DataMgr/BufferMgr/BufferMgr.h"
#include "Parser/ParserNode.h"
#include "QueryEngine/AggregateUtils.h"
#include "QueryEngine/AggregatedColRange.h"
#include "QueryEngine/CodeGenerator.h"
#include "QueryEngine/ColumnFetcher.h"
#include "QueryEngine/Descriptors/QueryCompilationDescriptor.h"
#include "QueryEngine/Descriptors/QueryFragmentDescriptor.h"
#include "QueryEngine/DynamicWatchdog.h"
#include "QueryEngine/EquiJoinCondition.h"
#include "QueryEngine/ErrorHandling.h"
#include "QueryEngine/ExpressionRewrite.h"
#include "QueryEngine/ExternalCacheInvalidators.h"
#include "QueryEngine/GpuMemUtils.h"
#include "QueryEngine/InPlaceSort.h"
#include "QueryEngine/JoinHashTable/BaselineJoinHashTable.h"
#include "QueryEngine/JoinHashTable/OverlapsJoinHashTable.h"
#include "QueryEngine/JsonAccessors.h"
#include "QueryEngine/OutputBufferInitialization.h"
#include "QueryEngine/QueryDispatchQueue.h"
#include "QueryEngine/QueryRewrite.h"
#include "QueryEngine/QueryTemplateGenerator.h"
#include "QueryEngine/ResultSetReductionJIT.h"
#include "QueryEngine/RuntimeFunctions.h"
#include "QueryEngine/SpeculativeTopN.h"
#include "QueryEngine/StringDictionaryGenerations.h"
#include "QueryEngine/TableFunctions/TableFunctionCompilationContext.h"
#include "QueryEngine/TableFunctions/TableFunctionExecutionContext.h"
#include "QueryEngine/Visitors/TransientStringLiteralsVisitor.h"
#include "Shared/SystemParameters.h"
#include "Shared/TypedDataAccessors.h"
#include "Shared/checked_alloc.h"
#include "Shared/measure.h"
#include "Shared/misc.h"
#include "Shared/scope.h"
#include "Shared/shard_key.h"
#include "Shared/threading.h"
#include "ArrayOps.cpp"
#include "DateAdd.cpp"
#include "GeoOps.cpp"
#include "StringFunctions.cpp"
#include "TableFunctions/TableFunctionOps.cpp"

Go to the source code of this file.

Classes

class  anonymous_namespace{Execute.cpp}::OutVecOwner
 

Namespaces

 anonymous_namespace{Execute.cpp}
 

Macros

#define EXECUTE_INCLUDE
 

Functions

 cpu_code_cache_ (code_cache_size)
 
 gpu_code_cache_ (code_cache_size)
 
 block_size_x_ (block_size_x)
 
 grid_size_x_ (grid_size_x)
 
 max_gpu_slab_size_ (max_gpu_slab_size)
 
 debug_dir_ (debug_dir)
 
 debug_file_ (debug_file)
 
 executor_id_ (executor_id)
 
 catalog_ (nullptr)
 
 data_mgr_ (data_mgr)
 
 temporary_tables_ (nullptr)
 
 input_table_info_cache_ (this)
 
ResultSetPtr anonymous_namespace{Execute.cpp}::get_merged_result (std::vector< std::pair< ResultSetPtr, std::vector< size_t >>> &results_per_device)
 
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)
 
std::unordered_set< int > get_available_gpus (const Data_Namespace::DataMgr *data_mgr)
 
size_t get_context_count (const ExecutorDeviceType device_type, const size_t cpu_count, const size_t gpu_count)
 
size_t anonymous_namespace{Execute.cpp}::compute_buffer_entry_guess (const std::vector< InputTableInfo > &query_infos)
 
std::string anonymous_namespace{Execute.cpp}::get_table_name (const InputDescriptor &input_desc, const Catalog_Namespace::Catalog &cat)
 
size_t anonymous_namespace{Execute.cpp}::getDeviceBasedScanLimit (const ExecutorDeviceType device_type, const int device_count)
 
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)
 
bool is_trivial_loop_join (const std::vector< InputTableInfo > &query_infos, const RelAlgExecutionUnit &ra_exe_unit)
 
template<typename T >
std::vector< std::string > anonymous_namespace{Execute.cpp}::expr_container_to_string (const T &expr_container)
 
template<>
std::vector< std::string > anonymous_namespace{Execute.cpp}::expr_container_to_string (const std::list< Analyzer::OrderEntry > &expr_container)
 
std::string anonymous_namespace{Execute.cpp}::sort_algorithm_to_string (const SortAlgorithm algorithm)
 
std::string ra_exec_unit_desc_for_caching (const RelAlgExecutionUnit &ra_exe_unit)
 
std::ostream & operator<< (std::ostream &os, const RelAlgExecutionUnit &ra_exe_unit)
 
RelAlgExecutionUnit anonymous_namespace{Execute.cpp}::replace_scan_limit (const RelAlgExecutionUnit &ra_exe_unit_in, const size_t new_scan_limit)
 
int64_t anonymous_namespace{Execute.cpp}::inline_null_val (const SQLTypeInfo &ti, const bool float_argument_input)
 
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)
 
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)
 
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)
 
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)
 
bool anonymous_namespace{Execute.cpp}::has_lazy_fetched_columns (const std::vector< ColumnLazyFetchInfo > &fetched_cols)
 
const ColumnDescriptoranonymous_namespace{Execute.cpp}::try_get_column_descriptor (const InputColDescriptor *col_desc, const Catalog_Namespace::Catalog &cat)
 
std::map< size_t, std::vector
< uint64_t > > 
get_table_id_to_frag_offsets (const std::vector< InputDescriptor > &input_descs, const std::map< int, const TableFragments * > &all_tables_fragments)
 
std::ostream & operator<< (std::ostream &os, FetchResult const &fetch_result)
 
bool anonymous_namespace{Execute.cpp}::check_rows_less_than_needed (const ResultSetPtr &results, const size_t scan_limit)
 
void anonymous_namespace{Execute.cpp}::add_deleted_col_to_map (PlanState::DeletedColumnsMap &deleted_cols_map, const ColumnDescriptor *deleted_cd)
 
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)
 

Variables

bool g_enable_watchdog false
 
bool g_enable_dynamic_watchdog {false}
 
bool g_enable_cpu_sub_tasks {false}
 
size_t g_cpu_sub_task_size {500'000}
 
bool g_enable_filter_function {true}
 
unsigned g_dynamic_watchdog_time_limit {10000}
 
bool g_allow_cpu_retry {true}
 
bool g_allow_query_step_cpu_retry {true}
 
bool g_null_div_by_zero {false}
 
unsigned g_trivial_loop_join_threshold {1000}
 
bool g_from_table_reordering {true}
 
bool g_inner_join_fragment_skipping {true}
 
bool g_enable_smem_group_by
 
std::unique_ptr< llvm::Module > udf_gpu_module
 
std::unique_ptr< llvm::Module > udf_cpu_module
 
bool g_enable_filter_push_down {false}
 
float g_filter_push_down_low_frac {-1.0f}
 
float g_filter_push_down_high_frac {-1.0f}
 
size_t g_filter_push_down_passing_row_ubound {0}
 
bool g_enable_columnar_output {false}
 
bool g_enable_left_join_filter_hoisting {true}
 
bool g_optimize_row_initialization {true}
 
bool g_enable_overlaps_hashjoin {true}
 
bool g_enable_distance_rangejoin {true}
 
bool g_enable_hashjoin_many_to_many {false}
 
size_t g_overlaps_max_table_size_bytes {1024 * 1024 * 1024}
 
double g_overlaps_target_entries_per_bin {1.3}
 
bool g_strip_join_covered_quals {false}
 
size_t g_constrained_by_in_threshold {10}
 
size_t g_default_max_groups_buffer_entry_guess {16384}
 
size_t g_big_group_threshold {g_default_max_groups_buffer_entry_guess}
 
bool g_enable_window_functions {true}
 
bool g_enable_table_functions {false}
 
size_t g_max_memory_allocation_size {2000000000}
 
size_t g_min_memory_allocation_size
 
bool g_enable_bump_allocator {false}
 
double g_bump_allocator_step_reduction {0.75}
 
bool g_enable_direct_columnarization {true}
 
bool g_enable_experimental_string_functions
 
bool g_enable_lazy_fetch {true}
 
bool g_enable_runtime_query_interrupt {true}
 
bool g_enable_non_kernel_time_query_interrupt {true}
 
bool g_use_estimator_result_cache {true}
 
unsigned g_pending_query_interrupt_freq {1000}
 
double g_running_query_interrupt_freq {0.1}
 
size_t g_gpu_smem_threshold
 
bool g_enable_smem_grouped_non_count_agg
 
bool g_enable_smem_non_grouped_agg
 
bool g_is_test_env {false}
 
size_t g_enable_parallel_linearization
 
bool g_enable_data_recycler {true}
 
bool g_use_hashtable_cache {true}
 
size_t g_hashtable_cache_total_bytes {size_t(1) << 32}
 
size_t g_max_cacheable_hashtable_size_bytes {size_t(1) << 31}
 
size_t g_approx_quantile_buffer {1000}
 
size_t g_approx_quantile_centroids {300}
 
bool g_enable_automatic_ir_metadata {true}
 
bool g_cache_string_hash
 

Macro Definition Documentation

#define EXECUTE_INCLUDE

Definition at line 3525 of file Execute.cpp.

Function Documentation

block_size_x_ ( block_size_x  )

Referenced by Executor::blockSize().

+ Here is the caller graph for this function:

cpu_code_cache_ ( code_cache_size  )

Referenced by Executor::optimizeAndCodegenCPU().

+ Here is the caller graph for this function:

data_mgr_ ( data_mgr  )

Referenced by BaselineHashTable::BaselineHashTable(), Executor::blockSize(), Executor::createKernels(), Executor::executeWorkUnitImpl(), Executor::gridSize(), Executor::interrupt(), Executor::isCPUOnly(), ResultSet::syncEstimatorBuffer(), BaselineHashTable::~BaselineHashTable(), and ResultSet::~ResultSet().

+ Here is the caller graph for this function:

debug_dir_ ( debug_dir  )
debug_file_ ( debug_file  )
executor_id_ ( executor_id  )
std::unordered_set<int> get_available_gpus ( const Data_Namespace::DataMgr data_mgr)

Definition at line 1060 of file Execute.cpp.

References CHECK, CHECK_GT, Data_Namespace::DataMgr::getCudaMgr(), CudaMgr_Namespace::CudaMgr::getDeviceCount(), and Data_Namespace::DataMgr::gpusPresent().

Referenced by Executor::executeWorkUnitImpl().

1060  {
1061  CHECK(data_mgr);
1062  std::unordered_set<int> available_gpus;
1063  if (data_mgr->gpusPresent()) {
1064  CHECK(data_mgr->getCudaMgr());
1065  const int gpu_count = data_mgr->getCudaMgr()->getDeviceCount();
1066  CHECK_GT(gpu_count, 0);
1067  for (int gpu_id = 0; gpu_id < gpu_count; ++gpu_id) {
1068  available_gpus.insert(gpu_id);
1069  }
1070  }
1071  return available_gpus;
1072 }
CudaMgr_Namespace::CudaMgr * getCudaMgr() const
Definition: DataMgr.h:218
#define CHECK_GT(x, y)
Definition: Logger.h:221
int getDeviceCount() const
Definition: CudaMgr.h:86
#define CHECK(condition)
Definition: Logger.h:209
bool gpusPresent() const
Definition: DataMgr.h:213

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

size_t get_context_count ( const ExecutorDeviceType  device_type,
const size_t  cpu_count,
const size_t  gpu_count 
)

Definition at line 1074 of file Execute.cpp.

References GPU.

Referenced by Executor::executeWorkUnitImpl().

1076  {
1077  return device_type == ExecutorDeviceType::GPU ? gpu_count
1078  : static_cast<size_t>(cpu_count);
1079 }

+ Here is the caller graph for this function:

std::map<size_t, std::vector<uint64_t> > get_table_id_to_frag_offsets ( const std::vector< InputDescriptor > &  input_descs,
const std::map< int, const TableFragments * > &  all_tables_fragments 
)

Definition at line 2410 of file Execute.cpp.

References CHECK, and i.

Referenced by Executor::getRowCountAndOffsetForAllFrags().

2412  {
2413  std::map<size_t, std::vector<uint64_t>> tab_id_to_frag_offsets;
2414  for (auto& desc : input_descs) {
2415  const auto fragments_it = all_tables_fragments.find(desc.getTableId());
2416  CHECK(fragments_it != all_tables_fragments.end());
2417  const auto& fragments = *fragments_it->second;
2418  std::vector<uint64_t> frag_offsets(fragments.size(), 0);
2419  for (size_t i = 0, off = 0; i < fragments.size(); ++i) {
2420  frag_offsets[i] = off;
2421  off += fragments[i].getNumTuples();
2422  }
2423  tab_id_to_frag_offsets.insert(std::make_pair(desc.getTableId(), frag_offsets));
2424  }
2425  return tab_id_to_frag_offsets;
2426 }
#define CHECK(condition)
Definition: Logger.h:209

+ Here is the caller graph for this function:

gpu_code_cache_ ( code_cache_size  )
grid_size_x_ ( grid_size_x  )

Referenced by Executor::gridSize(), and Executor::numBlocksPerMP().

+ Here is the caller graph for this function:

input_table_info_cache_ ( this  )

Definition at line 174 of file Execute.cpp.

Referenced by Executor::clearMetaInfoCache(), and Executor::getTableInfo().

174 {}

+ Here is the caller graph for this function:

bool is_trivial_loop_join ( const std::vector< InputTableInfo > &  query_infos,
const RelAlgExecutionUnit ra_exe_unit 
)

Definition at line 1182 of file Execute.cpp.

References CHECK, g_trivial_loop_join_threshold, i, and RelAlgExecutionUnit::input_descs.

Referenced by anonymous_namespace{IRCodegen.cpp}::check_if_loop_join_is_allowed().

1183  {
1184  if (ra_exe_unit.input_descs.size() < 2) {
1185  return false;
1186  }
1187 
1188  // We only support loop join at the end of folded joins
1189  // where ra_exe_unit.input_descs.size() > 2 for now.
1190  const auto inner_table_id = ra_exe_unit.input_descs.back().getTableId();
1191 
1192  std::optional<size_t> inner_table_idx;
1193  for (size_t i = 0; i < query_infos.size(); ++i) {
1194  if (query_infos[i].table_id == inner_table_id) {
1195  inner_table_idx = i;
1196  break;
1197  }
1198  }
1199  CHECK(inner_table_idx);
1200  return query_infos[*inner_table_idx].info.getNumTuples() <=
1202 }
std::vector< InputDescriptor > input_descs
unsigned g_trivial_loop_join_threshold
Definition: Execute.cpp:85
#define CHECK(condition)
Definition: Logger.h:209

+ Here is the caller graph for this function:

max_gpu_slab_size_ ( max_gpu_slab_size  )

Referenced by Executor::maxGpuSlabSize().

+ Here is the caller graph for this function:

std::ostream& operator<< ( std::ostream &  os,
const RelAlgExecutionUnit ra_exe_unit 
)

Definition at line 1295 of file Execute.cpp.

References EMPTY_QUERY_PLAN, RelAlgExecutionUnit::estimator, anonymous_namespace{Execute.cpp}::expr_container_to_string(), RelAlgExecutionUnit::groupby_exprs, i, RelAlgExecutionUnit::input_col_descs, join(), RelAlgExecutionUnit::join_quals, RelAlgExecutionUnit::quals, RelAlgExecutionUnit::query_plan_dag, RelAlgExecutionUnit::scan_limit, RelAlgExecutionUnit::simple_quals, anonymous_namespace{Execute.cpp}::sort_algorithm_to_string(), RelAlgExecutionUnit::sort_info, RelAlgExecutionUnit::target_exprs, to_string(), toString(), RelAlgExecutionUnit::union_all, and RelAlgExecutionUnit::use_bump_allocator.

1295  {
1296  auto query_plan_dag =
1297  ra_exe_unit.query_plan_dag == EMPTY_QUERY_PLAN ? "N/A" : ra_exe_unit.query_plan_dag;
1298  os << "\n\tExtracted Query Plan Dag: " << query_plan_dag;
1299  os << "\n\tTable/Col/Levels: ";
1300  for (const auto& input_col_desc : ra_exe_unit.input_col_descs) {
1301  const auto& scan_desc = input_col_desc->getScanDesc();
1302  os << "(" << scan_desc.getTableId() << ", " << input_col_desc->getColId() << ", "
1303  << scan_desc.getNestLevel() << ") ";
1304  }
1305  if (!ra_exe_unit.simple_quals.empty()) {
1306  os << "\n\tSimple Quals: "
1308  ", ");
1309  }
1310  if (!ra_exe_unit.quals.empty()) {
1311  os << "\n\tQuals: "
1312  << boost::algorithm::join(expr_container_to_string(ra_exe_unit.quals), ", ");
1313  }
1314  if (!ra_exe_unit.join_quals.empty()) {
1315  os << "\n\tJoin Quals: ";
1316  for (size_t i = 0; i < ra_exe_unit.join_quals.size(); i++) {
1317  const auto& join_condition = ra_exe_unit.join_quals[i];
1318  os << "\t\t" << std::to_string(i) << " " << ::toString(join_condition.type);
1319  os << boost::algorithm::join(expr_container_to_string(join_condition.quals), ", ");
1320  }
1321  }
1322  if (!ra_exe_unit.groupby_exprs.empty()) {
1323  os << "\n\tGroup By: "
1325  ", ");
1326  }
1327  os << "\n\tProjected targets: "
1329  os << "\n\tHas Estimator: " << ::toString(ra_exe_unit.estimator == nullptr);
1330  os << "\n\tSort Info: ";
1331  const auto& sort_info = ra_exe_unit.sort_info;
1332  os << "\n\t Order Entries: "
1333  << boost::algorithm::join(expr_container_to_string(sort_info.order_entries), ", ");
1334  os << "\n\t Algorithm: " << sort_algorithm_to_string(sort_info.algorithm);
1335  os << "\n\t Limit: " << std::to_string(sort_info.limit);
1336  os << "\n\t Offset: " << std::to_string(sort_info.offset);
1337  os << "\n\tScan Limit: " << std::to_string(ra_exe_unit.scan_limit);
1338  os << "\n\tBump Allocator: " << ::toString(ra_exe_unit.use_bump_allocator);
1339  if (ra_exe_unit.union_all) {
1340  os << "\n\tUnion: " << std::string(*ra_exe_unit.union_all ? "UNION ALL" : "UNION");
1341  }
1342  return os;
1343 }
std::vector< Analyzer::Expr * > target_exprs
std::string toString(const ExtArgumentType &sig_type)
const std::optional< bool > union_all
std::string join(T const &container, std::string const &delim)
const std::list< std::shared_ptr< Analyzer::Expr > > groupby_exprs
std::string to_string(char const *&&v)
const JoinQualsPerNestingLevel join_quals
std::vector< std::string > expr_container_to_string(const T &expr_container)
Definition: Execute.cpp:1207
const std::shared_ptr< Analyzer::Estimator > estimator
std::string sort_algorithm_to_string(const SortAlgorithm algorithm)
Definition: Execute.cpp:1229
std::list< std::shared_ptr< Analyzer::Expr > > quals
constexpr char const * EMPTY_QUERY_PLAN
std::list< std::shared_ptr< const InputColDescriptor > > input_col_descs
std::list< std::shared_ptr< Analyzer::Expr > > simple_quals

+ Here is the call graph for this function:

std::ostream& operator<< ( std::ostream &  os,
FetchResult const fetch_result 
)

Definition at line 2514 of file Execute.cpp.

References FetchResult::col_buffers, FetchResult::frag_offsets, FetchResult::num_rows, and shared::printContainer().

2514  {
2515  return os << "col_buffers" << shared::printContainer(fetch_result.col_buffers)
2516  << " num_rows" << shared::printContainer(fetch_result.num_rows)
2517  << " frag_offsets" << shared::printContainer(fetch_result.frag_offsets);
2518 }
PrintContainer< CONTAINER > printContainer(CONTAINER &container)
Definition: misc.h:105

+ Here is the call graph for this function:

std::string ra_exec_unit_desc_for_caching ( const RelAlgExecutionUnit ra_exe_unit)

Definition at line 1244 of file Execute.cpp.

References RelAlgExecutionUnit::estimator, RelAlgExecutionUnit::groupby_exprs, i, RelAlgExecutionUnit::input_col_descs, RelAlgExecutionUnit::join_quals, RelAlgExecutionUnit::quals, RelAlgExecutionUnit::scan_limit, RelAlgExecutionUnit::simple_quals, RelAlgExecutionUnit::target_exprs, to_string(), and toString().

Referenced by RelAlgExecutor::executeWorkUnit().

1244  {
1245  // todo(yoonmin): replace a cache key as a DAG representation of a query plan
1246  // instead of ra_exec_unit description if possible
1247  std::ostringstream os;
1248  for (const auto& input_col_desc : ra_exe_unit.input_col_descs) {
1249  const auto& scan_desc = input_col_desc->getScanDesc();
1250  os << scan_desc.getTableId() << "," << input_col_desc->getColId() << ","
1251  << scan_desc.getNestLevel();
1252  }
1253  if (!ra_exe_unit.simple_quals.empty()) {
1254  for (const auto& qual : ra_exe_unit.simple_quals) {
1255  if (qual) {
1256  os << qual->toString() << ",";
1257  }
1258  }
1259  }
1260  if (!ra_exe_unit.quals.empty()) {
1261  for (const auto& qual : ra_exe_unit.quals) {
1262  if (qual) {
1263  os << qual->toString() << ",";
1264  }
1265  }
1266  }
1267  if (!ra_exe_unit.join_quals.empty()) {
1268  for (size_t i = 0; i < ra_exe_unit.join_quals.size(); i++) {
1269  const auto& join_condition = ra_exe_unit.join_quals[i];
1270  os << std::to_string(i) << ::toString(join_condition.type);
1271  for (const auto& qual : join_condition.quals) {
1272  if (qual) {
1273  os << qual->toString() << ",";
1274  }
1275  }
1276  }
1277  }
1278  if (!ra_exe_unit.groupby_exprs.empty()) {
1279  for (const auto& qual : ra_exe_unit.groupby_exprs) {
1280  if (qual) {
1281  os << qual->toString() << ",";
1282  }
1283  }
1284  }
1285  for (const auto& expr : ra_exe_unit.target_exprs) {
1286  if (expr) {
1287  os << expr->toString() << ",";
1288  }
1289  }
1290  os << ::toString(ra_exe_unit.estimator == nullptr);
1291  os << std::to_string(ra_exe_unit.scan_limit);
1292  return os.str();
1293 }
std::vector< Analyzer::Expr * > target_exprs
std::string toString(const ExtArgumentType &sig_type)
const std::list< std::shared_ptr< Analyzer::Expr > > groupby_exprs
std::string to_string(char const *&&v)
const JoinQualsPerNestingLevel join_quals
const std::shared_ptr< Analyzer::Estimator > estimator
std::list< std::shared_ptr< Analyzer::Expr > > quals
std::list< std::shared_ptr< const InputColDescriptor > > input_col_descs
std::list< std::shared_ptr< Analyzer::Expr > > simple_quals

+ Here is the call graph for this function:

+ Here is the caller graph for this function:

temporary_tables_ ( nullptr  )

Variable Documentation

false

Definition at line 76 of file Execute.cpp.

bool g_allow_query_step_cpu_retry {true}
size_t g_approx_quantile_buffer {1000}
size_t g_approx_quantile_centroids {300}
size_t g_big_group_threshold {g_default_max_groups_buffer_entry_guess}

Definition at line 106 of file Execute.cpp.

Referenced by RelAlgExecutor::executeWorkUnit().

double g_bump_allocator_step_reduction {0.75}

Definition at line 114 of file Execute.cpp.

Referenced by create_dev_group_by_buffers().

bool g_cache_string_hash

Definition at line 46 of file StringDictionary.cpp.

size_t g_constrained_by_in_threshold {10}

Definition at line 104 of file Execute.cpp.

Referenced by QueryRewriter::rewriteConstrainedByInImpl().

size_t g_cpu_sub_task_size {500'000}
unsigned g_dynamic_watchdog_time_limit {10000}
bool g_enable_automatic_ir_metadata {true}

Definition at line 147 of file Execute.cpp.

Referenced by CommandLineOptions::fillAdvancedOptions().

bool g_enable_bump_allocator {false}
bool g_enable_cpu_sub_tasks {false}

Definition at line 78 of file Execute.cpp.

Referenced by CommandLineOptions::fillAdvancedOptions(), and Executor::launchKernels().

bool g_enable_direct_columnarization {true}
bool g_enable_distance_rangejoin {true}

Definition at line 99 of file Execute.cpp.

Referenced by CommandLineOptions::fillOptions(), and rewrite_overlaps_conjunction().

bool g_enable_experimental_string_functions

Definition at line 39 of file RelAlgTranslator.cpp.

bool g_enable_filter_function {true}

Definition at line 80 of file Execute.cpp.

Referenced by CommandLineOptions::fillAdvancedOptions().

bool g_enable_hashjoin_many_to_many {false}

Definition at line 100 of file Execute.cpp.

Referenced by CommandLineOptions::fillOptions(), and rewrite_overlaps_conjunction().

bool g_enable_lazy_fetch {true}
bool g_enable_left_join_filter_hoisting {true}
size_t g_enable_parallel_linearization
Initial value:
{
10000}

Definition at line 137 of file Execute.cpp.

Referenced by ColumnFetcher::linearizeVarLenArrayColFrags().

bool g_enable_smem_group_by
bool g_enable_smem_grouped_non_count_agg
Initial value:
{
true}

Definition at line 128 of file Execute.cpp.

Referenced by CommandLineOptions::fillAdvancedOptions().

bool g_enable_smem_non_grouped_agg
Initial value:
{
true}

Definition at line 131 of file Execute.cpp.

Referenced by CommandLineOptions::fillAdvancedOptions().

bool g_enable_window_functions {true}
float g_filter_push_down_high_frac {-1.0f}
float g_filter_push_down_low_frac {-1.0f}
size_t g_filter_push_down_passing_row_ubound {0}
size_t g_gpu_smem_threshold
Initial value:
{
4096}

Definition at line 123 of file Execute.cpp.

Referenced by CommandLineOptions::fillAdvancedOptions().

size_t g_hashtable_cache_total_bytes {size_t(1) << 32}

Definition at line 141 of file Execute.cpp.

Referenced by CommandLineOptions::parse_command_line().

bool g_inner_join_fragment_skipping {true}

Definition at line 87 of file Execute.cpp.

Referenced by Executor::createKernels(), and CommandLineOptions::fillOptions().

bool g_is_test_env {false}
size_t g_max_cacheable_hashtable_size_bytes {size_t(1) << 31}

Definition at line 142 of file Execute.cpp.

Referenced by CommandLineOptions::parse_command_line().

size_t g_max_memory_allocation_size {2000000000}
size_t g_min_memory_allocation_size
Initial value:
{
256}

Definition at line 110 of file Execute.cpp.

Referenced by create_dev_group_by_buffers(), and CommandLineOptions::fillAdvancedOptions().

bool g_null_div_by_zero {false}
bool g_optimize_row_initialization {true}
size_t g_overlaps_max_table_size_bytes {1024 * 1024 * 1024}
double g_overlaps_target_entries_per_bin {1.3}
unsigned g_pending_query_interrupt_freq {1000}
bool g_strip_join_covered_quals {false}
unsigned g_trivial_loop_join_threshold {1000}

Definition at line 85 of file Execute.cpp.

Referenced by CommandLineOptions::fillOptions(), and is_trivial_loop_join().

bool g_use_estimator_result_cache {true}
std::unique_ptr<llvm::Module> udf_cpu_module

Definition at line 79 of file NativeCodegen.cpp.

std::unique_ptr<llvm::Module> udf_gpu_module