anonymous_namespace{ExpressionRewrite.cpp} Namespace Reference

Classes
class	OrToInVisitor
class	RecursiveOrToInVisitor
class	ArrayElementStringLiteralEncodingVisitor
class	ConstantFoldingVisitor

Functions
const Analyzer::Expr *	strip_likelihood (const Analyzer::Expr *expr)
void	update_input_to_nest_lv (std::unordered_map< const RelAlgNode *, int > &input_to_nest_level, shared::ColumnKey const &column_key, int target_nest_lv)
int	update_input_desc (std::vector< InputDescriptor > &input_descs, shared::ColumnKey const &column_key, int target_nest_lv)
auto	update_input_col_desc (std::list< std::shared_ptr< const InputColDescriptor >> &input_col_desc, shared::ColumnKey const &column_key, int target_nest_lv)

Function Documentation

const Analyzer::Expr* anonymous_namespace{ExpressionRewrite.cpp}::strip_likelihood

(

const Analyzer::Expr *

expr

)

Definition at line 765 of file ExpressionRewrite.cpp.

Referenced by fold_expr(), and rewrite_expr().

                                                               {
  const auto with_likelihood = dynamic_cast<const Analyzer::LikelihoodExpr*>(expr);
  if (!with_likelihood) {
    return expr;
  }
  return with_likelihood->get_arg();
}

Here is the caller graph for this function:

auto anonymous_namespace{ExpressionRewrite.cpp}::update_input_col_desc	(	std::list< std::shared_ptr< const InputColDescriptor >> &	input_col_desc,
		shared::ColumnKey const &	column_key,
		int	target_nest_lv
	)

Definition at line 839 of file ExpressionRewrite.cpp.

References shared::ColumnKey::db_id, and shared::ColumnKey::table_id.

Referenced by translate_bounding_box_intersect_with_reordering().

                        {
  for (auto it = input_col_desc.begin(); it != input_col_desc.end(); it++) {
    auto const tbl_key = (*it)->getScanDesc().getTableKey();
    if (tbl_key.db_id == column_key.db_id && tbl_key.table_id == column_key.table_id) {
      (*it) = std::make_shared<InputColDescriptor>(
          (*it)->getColId(), tbl_key.table_id, tbl_key.db_id, target_nest_lv);
      return it;
    }
  }
  return input_col_desc.end();
}

Here is the caller graph for this function:

int anonymous_namespace{ExpressionRewrite.cpp}::update_input_desc	(	std::vector< InputDescriptor > &	input_descs,
		shared::ColumnKey const &	column_key,
		int	target_nest_lv
	)

Definition at line 825 of file ExpressionRewrite.cpp.

References shared::ColumnKey::db_id, and shared::ColumnKey::table_id.

Referenced by translate_bounding_box_intersect_with_reordering().

                                          {
  int num_input_descs = static_cast<int>(input_descs.size());
  for (int i = 0; i < num_input_descs; i++) {
    auto const tbl_key = input_descs[i].getTableKey();
    if (tbl_key.db_id == column_key.db_id && tbl_key.table_id == column_key.table_id) {
      input_descs[i] = InputDescriptor(tbl_key.db_id, tbl_key.table_id, target_nest_lv);
      return i;
    }
  }
  return -1;
}

Here is the caller graph for this function:

void anonymous_namespace{ExpressionRewrite.cpp}::update_input_to_nest_lv	(	std::unordered_map< const RelAlgNode *, int > &	input_to_nest_level,
		shared::ColumnKey const &	column_key,
		int	target_nest_lv
	)

Definition at line 806 of file ExpressionRewrite.cpp.

References anonymous_namespace{QueryMemoryDescriptor.cpp}::any_of(), shared::ColumnKey::db_id, get_physical_table_inputs(), and shared::ColumnKey::table_id.

Referenced by translate_bounding_box_intersect_with_reordering().

                        {
  for (auto& kv : input_to_nest_level) {
    auto ra = kv.first;
    auto table_keys = get_physical_table_inputs(ra);
    if (std::any_of(table_keys.begin(),
                    table_keys.end(),
                    [column_key](shared::TableKey const& key) {
                      return key.table_id == column_key.table_id &&
                             key.db_id == column_key.db_id;
                    })) {
      input_to_nest_level[ra] = target_nest_lv;
      return;
    }
  }
}

Here is the call graph for this function:

Here is the caller graph for this function: