#include <RelAlgDag.h>

Inheritance diagram for RelLeftDeepInnerJoin:

Collaboration diagram for RelLeftDeepInnerJoin:

Public Member Functions
	RelLeftDeepInnerJoin (const std::shared_ptr< RelFilter > &filter, RelAlgInputs inputs, std::vector< std::shared_ptr< const RelJoin >> &original_joins)

const RexScalar *	getInnerCondition () const

const RexScalar *	getOuterCondition (const size_t nesting_level) const

const JoinType	getJoinType (const size_t nesting_level) const

std::string	toString (RelRexToStringConfig config=RelRexToStringConfig::defaults()) const override

size_t	toHash () const override

size_t	size () const override

std::shared_ptr< RelAlgNode >	deepCopy () const override

bool	coversOriginalNode (const RelAlgNode *node) const

const RelFilter *	getOriginalFilter () const

std::vector< std::shared_ptr < const RelJoin > >	getOriginalJoins () const

Public Member Functions inherited from RelAlgNode
	RelAlgNode (RelAlgInputs inputs={})

virtual	~RelAlgNode ()

void	resetQueryExecutionState ()

void	setContextData (const RaExecutionDesc *context_data) const

void	setOutputMetainfo (const std::vector< TargetMetaInfo > &targets_metainfo) const

void	setQueryPlanDag (const std::string &extracted_query_plan_dag) const

std::string	getQueryPlanDag () const

size_t	getQueryPlanDagHash () const

const std::vector < TargetMetaInfo > &	getOutputMetainfo () const

unsigned	getId () const

void	setIdInPlanTree (size_t id) const

std::optional< size_t >	getIdInPlanTree () const

bool	hasContextData () const

const RaExecutionDesc *	getContextData () const

const size_t	inputCount () const

const RelAlgNode *	getInput (const size_t idx) const

std::shared_ptr< const RelAlgNode >	getAndOwnInput (const size_t idx) const

void	addManagedInput (std::shared_ptr< const RelAlgNode > input)

bool	hasInput (const RelAlgNode *needle) const

virtual void	replaceInput (std::shared_ptr< const RelAlgNode > old_input, std::shared_ptr< const RelAlgNode > input)

void	setRelNodeDagId (const size_t id) const

size_t	getRelNodeDagId () const

bool	isNop () const

void	markAsNop ()

void	clearContextData () const

Private Attributes
std::unique_ptr< const RexScalar >	condition_

std::vector< std::unique_ptr < const RexScalar > >	outer_conditions_per_level_

const std::shared_ptr< RelFilter >	original_filter_

const std::vector < std::shared_ptr< const RelJoin > >	original_joins_

Additional Inherited Members
Static Public Member Functions inherited from RelAlgNode
static void	resetRelAlgFirstId () noexcept

Protected Attributes inherited from RelAlgNode
RelAlgInputs	inputs_

const unsigned	id_

std::optional< size_t >	id_in_plan_tree_

std::optional< size_t >	hash_

Detailed Description

Definition at line 1592 of file RelAlgDag.h.

Constructor & Destructor Documentation

RelLeftDeepInnerJoin::RelLeftDeepInnerJoin	(	const std::shared_ptr< RelFilter > &	filter,
		RelAlgInputs	inputs,
		std::vector< std::shared_ptr< const RelJoin >> &	original_joins
	)

Definition at line 24 of file RelLeftDeepInnerJoin.cpp.

References RelAlgNode::addManagedInput(), ANTI, CHECK, condition_, INNER, kAND, kBOOLEAN, LEFT, outer_conditions_per_level_, and SEMI.

Referenced by toHash().

     : condition_(filter ? filter->getAndReleaseCondition() : nullptr)
     , original_filter_(filter)
     , original_joins_(original_joins) {
   std::vector<std::unique_ptr<const RexScalar>> operands;
   bool is_notnull = true;
   // Accumulate join conditions from the (explicit) joins themselves and
   // from the filter node at the root of the left-deep tree pattern.
   outer_conditions_per_level_.resize(original_joins.size());
   for (size_t nesting_level = 0; nesting_level < original_joins.size(); ++nesting_level) {
     const auto& original_join = original_joins[nesting_level];
     const auto condition_true =
         dynamic_cast<const RexLiteral*>(original_join->getCondition());
     if (!condition_true || !condition_true->getVal<bool>()) {
       if (dynamic_cast<const RexOperator*>(original_join->getCondition())) {
         is_notnull =
             is_notnull && dynamic_cast<const RexOperator*>(original_join->getCondition())
                               ->getType()
                               .get_notnull();
       }
       switch (original_join->getJoinType()) {
         case JoinType::INNER:
         case JoinType::SEMI:
         case JoinType::ANTI: {
           if (original_join->getCondition()) {
             operands.emplace_back(original_join->getAndReleaseCondition());
           }
           break;
         }
         case JoinType::LEFT: {
           if (original_join->getCondition()) {
             outer_conditions_per_level_[nesting_level].reset(
                 original_join->getAndReleaseCondition());
           }
           break;
         }
         default:
           CHECK(false);
       }
     }
   }
   if (!operands.empty()) {
     if (condition_) {
       CHECK(dynamic_cast<const RexOperator*>(condition_.get()));
       is_notnull =
           is_notnull &&
           static_cast<const RexOperator*>(condition_.get())->getType().get_notnull();
       operands.emplace_back(std::move(condition_));
     }
     if (operands.size() > 1) {
       condition_.reset(
           new RexOperator(kAND, operands, SQLTypeInfo(kBOOLEAN, is_notnull)));
     } else {
       condition_ = std::move(operands.front());
     }
   }
   if (!condition_) {
     condition_.reset(new RexLiteral(true, kBOOLEAN, kBOOLEAN, 0, 0, 0, 0));
   }
   for (const auto& input : inputs) {
     addManagedInput(input);
   }
 }

Here is the call graph for this function:

Here is the caller graph for this function:

Member Function Documentation

bool RelLeftDeepInnerJoin::coversOriginalNode ( const RelAlgNode * node ) const

Definition at line 156 of file RelLeftDeepInnerJoin.cpp.

References original_filter_, and original_joins_.

                                                                           {
   if (node == original_filter_.get()) {
     return true;
   }
   for (const auto& original_join : original_joins_) {
     if (original_join.get() == node) {
       return true;
     }
   }
   return false;
 }

std::shared_ptr< RelAlgNode > RelLeftDeepInnerJoin::deepCopy ( ) const

overridevirtual

Implements RelAlgNode.

Definition at line 151 of file RelLeftDeepInnerJoin.cpp.

References CHECK.

                                                                {
   CHECK(false);
   return nullptr;
 }

const RexScalar * RelLeftDeepInnerJoin::getInnerCondition ( ) const

Definition at line 91 of file RelLeftDeepInnerJoin.cpp.

References condition_.

Referenced by RelAlgExecutor::translateLeftDeepJoinFilter(), RelRexDagVisitor::visit(), and anonymous_namespace{QueryPhysicalInputsCollector.cpp}::RelAlgPhysicalInputsVisitor::visitLeftDeepInnerJoin().

                                                                {
   return condition_.get();
 }

Here is the caller graph for this function:

const JoinType RelLeftDeepInnerJoin::getJoinType ( const size_t nesting_level ) const

Definition at line 105 of file RelLeftDeepInnerJoin.cpp.

References CHECK_LE, and original_joins_.

Referenced by anonymous_namespace{RelAlgExecutor.cpp}::left_deep_join_types().

                                                                                  {
   CHECK_LE(nesting_level, original_joins_.size());
   return original_joins_[original_joins_.size() - nesting_level]->getJoinType();
 }

Here is the caller graph for this function:

const RelFilter * RelLeftDeepInnerJoin::getOriginalFilter ( ) const

Definition at line 168 of file RelLeftDeepInnerJoin.cpp.

References original_filter_.

                                                                {
   return original_filter_.get();
 }

std::vector< std::shared_ptr< const RelJoin > > RelLeftDeepInnerJoin::getOriginalJoins ( ) const

Definition at line 172 of file RelLeftDeepInnerJoin.cpp.

References original_joins_.

           {
   std::vector<std::shared_ptr<const RelJoin>> original_joins;
   original_joins.assign(original_joins_.begin(), original_joins_.end());
   return original_joins;
 }

const RexScalar * RelLeftDeepInnerJoin::getOuterCondition ( const size_t nesting_level ) const

Definition at line 95 of file RelLeftDeepInnerJoin.cpp.

References CHECK_GE, CHECK_LE, and outer_conditions_per_level_.

Referenced by QueryPlanDagExtractor::handleLeftDeepJoinTree(), anonymous_namespace{RelAlgExecutor.cpp}::left_deep_join_types(), RelAlgExecutor::translateLeftDeepJoinFilter(), RelRexDagVisitor::visit(), and anonymous_namespace{QueryPhysicalInputsCollector.cpp}::RelAlgPhysicalInputsVisitor::visitLeftDeepInnerJoin().

                                       {
   CHECK_GE(nesting_level, size_t(1));
   CHECK_LE(nesting_level, outer_conditions_per_level_.size());
   // Outer join conditions are collected depth-first while the returned condition
   // must be consistent with the order of the loops (which is reverse depth-first).
   return outer_conditions_per_level_[outer_conditions_per_level_.size() - nesting_level]
       .get();
 }

Here is the caller graph for this function:

size_t RelLeftDeepInnerJoin::size ( ) const

overridevirtual

Implements RelAlgNode.

Definition at line 143 of file RelLeftDeepInnerJoin.cpp.

References RelAlgNode::inputs_.

                                         {
   size_t total_size = 0;
   for (const auto& input : inputs_) {
     total_size += input->size();
   }
   return total_size;
 }

size_t RelLeftDeepInnerJoin::toHash ( ) const

overridevirtual

Implements RelAlgNode.

Definition at line 128 of file RelLeftDeepInnerJoin.cpp.

References condition_, RelAlgNode::hash_, HASH_N, RelAlgNode::inputs_, original_filter_, outer_conditions_per_level_, and RelLeftDeepInnerJoin().

                                           {
   if (!hash_) {
     hash_ = typeid(RelLeftDeepInnerJoin).hash_code();
     boost::hash_combine(*hash_, condition_ ? condition_->toHash() : HASH_N);
     for (auto& expr : outer_conditions_per_level_) {
       boost::hash_combine(*hash_, expr ? expr->toHash() : HASH_N);
     }
     boost::hash_combine(*hash_, original_filter_ ? original_filter_->toHash() : HASH_N);
     for (auto& node : inputs_) {
       boost::hash_combine(*hash_, node->toHash());
     }
   }
   return *hash_;
 }

Here is the call graph for this function:

std::string RelLeftDeepInnerJoin::toString ( RelRexToStringConfig config = RelRexToStringConfig::defaults() ) const

overridevirtual

Implements RelAlgNode.

Definition at line 110 of file RelLeftDeepInnerJoin.cpp.

References condition_, RelAlgNode::inputs_, RelRexToStringConfig::skip_input_nodes, to_string(), and typeName().

                                                                           {
   std::string ret = ::typeName(this) + "(";
   ret += condition_->toString(config);
   if (!config.skip_input_nodes) {
     for (const auto& input : inputs_) {
       ret += " " + input->toString(config);
     }
   } else {
     ret += ", input node id={";
     for (auto& input : inputs_) {
       ret += std::to_string(input->getId()) + " ";
     }
     ret += "}";
   }
   ret += ")";
   return ret;
 }

Here is the call graph for this function:

Member Data Documentation

std::unique_ptr<const RexScalar> RelLeftDeepInnerJoin::condition_

private

Definition at line 1620 of file RelAlgDag.h.

Referenced by getInnerCondition(), RelLeftDeepInnerJoin(), toHash(), and toString().

const std::shared_ptr<RelFilter> RelLeftDeepInnerJoin::original_filter_

private

Definition at line 1622 of file RelAlgDag.h.

Referenced by coversOriginalNode(), getOriginalFilter(), and toHash().

const std::vector<std::shared_ptr<const RelJoin> > RelLeftDeepInnerJoin::original_joins_

private

Definition at line 1623 of file RelAlgDag.h.

Referenced by coversOriginalNode(), getJoinType(), and getOriginalJoins().

std::vector<std::unique_ptr<const RexScalar> > RelLeftDeepInnerJoin::outer_conditions_per_level_

private

Definition at line 1621 of file RelAlgDag.h.

Referenced by getOuterCondition(), RelLeftDeepInnerJoin(), and toHash().

The documentation for this class was generated from the following files:

/home/jenkins-slave/workspace/core-os-doxygen/QueryEngine/RelAlgDag.h
/home/jenkins-slave/workspace/core-os-doxygen/QueryEngine/RelLeftDeepInnerJoin.cpp

Public Member Functions

Private Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

Member Function Documentation

Member Data Documentation