anonymous_namespace{IRCodegen.cpp} Namespace Reference

Classes
class	ExprTableIdVisitor

Functions
void	add_qualifier_to_execution_unit (RelAlgExecutionUnit &ra_exe_unit, const std::shared_ptr< Analyzer::Expr > &qual)
void	check_if_loop_join_is_allowed (RelAlgExecutionUnit &ra_exe_unit, const ExecutionOptions &eo, const std::vector< InputTableInfo > &query_infos, const size_t level_idx, const std::string &fail_reason)
void	check_valid_join_qual (std::shared_ptr< Analyzer::BinOper > &bin_oper)

Function Documentation

void anonymous_namespace{IRCodegen.cpp}::add_qualifier_to_execution_unit	(	RelAlgExecutionUnit &	ra_exe_unit,
		const std::shared_ptr< Analyzer::Expr > &	qual
	)

Definition at line 535 of file IRCodegen.cpp.

References qual_to_conjunctive_form(), RelAlgExecutionUnit::quals, and RelAlgExecutionUnit::simple_quals.

Referenced by Executor::buildCurrentLevelHashTable().

                                                                              {
  const auto qual_cf = qual_to_conjunctive_form(qual);
  ra_exe_unit.simple_quals.insert(ra_exe_unit.simple_quals.end(),
                                  qual_cf.simple_quals.begin(),
                                  qual_cf.simple_quals.end());
  ra_exe_unit.quals.insert(
      ra_exe_unit.quals.end(), qual_cf.quals.begin(), qual_cf.quals.end());
}

Here is the call graph for this function:

Here is the caller graph for this function:

void anonymous_namespace{IRCodegen.cpp}::check_if_loop_join_is_allowed	(	RelAlgExecutionUnit &	ra_exe_unit,
		const ExecutionOptions &	eo,
		const std::vector< InputTableInfo > &	query_infos,
		const size_t	level_idx,
		const std::string &	fail_reason
	)

Definition at line 545 of file IRCodegen.cpp.

References ExecutionOptions::allow_loop_joins, g_trivial_loop_join_threshold, get_loop_join_size(), RelAlgExecutionUnit::input_descs, RegisteredQueryHint::isHintRegistered(), RelAlgExecutionUnit::join_quals, kDisableLoopJoin, kLoopJoinInnerTableMaxNumRows, RegisteredQueryHint::loop_join_inner_table_max_num_rows, and RelAlgExecutionUnit::query_hint.

                                                                 {
  if (ra_exe_unit.input_descs.size() < 2) {
    // We only support loop join at the end of folded joins
    // where ra_exe_unit.input_descs.size() > 2 for now.
    throw std::runtime_error("Hash join failed, reason(s): " + fail_reason +
                             " | Incorrect # tables for executing loop join");
  }
  const auto loop_join_size = get_loop_join_size(query_infos, ra_exe_unit);
  const bool has_loop_size_hint =
      ra_exe_unit.query_hint.isHintRegistered(QueryHint::kLoopJoinInnerTableMaxNumRows);
  const size_t loop_join_size_threshold =
      has_loop_size_hint ? ra_exe_unit.query_hint.loop_join_inner_table_max_num_rows
                         : g_trivial_loop_join_threshold;
  if (eo.allow_loop_joins) {
    if (has_loop_size_hint && loop_join_size_threshold < loop_join_size) {
      throw std::runtime_error(
          "Hash join failed, reason(s): " + fail_reason +
          " | Cannot fall back to loop join for non-trivial inner table size");
    }
    return;
  }
  if (level_idx + 1 != ra_exe_unit.join_quals.size()) {
    throw std::runtime_error(
        "Hash join failed, reason(s): " + fail_reason +
        " | Cannot fall back to loop join for intermediate join quals");
  }
  if (loop_join_size_threshold < loop_join_size) {
    throw std::runtime_error(
        "Hash join failed, reason(s): " + fail_reason +
        " | Cannot fall back to loop join for non-trivial inner table size");
  }
  if (ra_exe_unit.query_hint.isHintRegistered(kDisableLoopJoin)) {
    throw std::runtime_error("Hash join failed, reason(s): " + fail_reason +
                             " | Loop join is disabled by user");
  }
}

Here is the call graph for this function:

void anonymous_namespace{IRCodegen.cpp}::check_valid_join_qual

(

std::shared_ptr< Analyzer::BinOper > &

bin_oper

)

Definition at line 586 of file IRCodegen.cpp.

References CHECK_LE, g_maximum_conditions_to_coalesce, SQLTypeInfo::get_type(), Analyzer::Expr::get_type_info(), and kARRAY.

Referenced by Executor::buildCurrentLevelHashTable().

                                                                     {
  // check whether a join qual is valid before entering the hashtable build and codegen

  auto lhs_cv = dynamic_cast<const Analyzer::ColumnVar*>(bin_oper->get_left_operand());
  auto rhs_cv = dynamic_cast<const Analyzer::ColumnVar*>(bin_oper->get_right_operand());
  if (lhs_cv && rhs_cv && !bin_oper->is_bbox_intersect_oper()) {
    auto lhs_type = lhs_cv->get_type_info().get_type();
    auto rhs_type = rhs_cv->get_type_info().get_type();
    // check #1. avoid a join btw full array columns
    if (lhs_type == SQLTypes::kARRAY && rhs_type == SQLTypes::kARRAY) {
      throw std::runtime_error(
          "Join operation between full array columns (i.e., R.arr = S.arr) instead of "
          "indexed array columns (i.e., R.arr[1] = S.arr[2]) is not supported yet.");
    }
  }
  auto const lhs_et =
      dynamic_cast<const Analyzer::ExpressionTuple*>(bin_oper->get_left_operand());
  if (lhs_et) {
    CHECK_LE(lhs_et->getTuple().size(), g_maximum_conditions_to_coalesce);
  }
}

Here is the call graph for this function:

Here is the caller graph for this function: