#include "nodes/pathnodes.h"

Include dependency graph for restrictinfo.h:

This graph shows which files directly or indirectly include this file:

Macros
#define	make_simple_restrictinfo(root, clause) make_restrictinfo(root, clause, true, false, false, 0, NULL, NULL, NULL)

Functions
RestrictInfo *	make_restrictinfo (PlannerInfo root, Expr clause, bool is_pushed_down, bool outerjoin_delayed, bool pseudoconstant, Index security_level, Relids required_relids, Relids outer_relids, Relids nullable_relids)

RestrictInfo *	commute_restrictinfo (RestrictInfo *rinfo, Oid comm_op)

bool	restriction_is_or_clause (RestrictInfo *restrictinfo)

bool	restriction_is_securely_promotable (RestrictInfo restrictinfo, RelOptInfo rel)

List *	get_actual_clauses (List *restrictinfo_list)

List *	extract_actual_clauses (List *restrictinfo_list, bool pseudoconstant)

void	extract_actual_join_clauses (List restrictinfo_list, Relids joinrelids, List joinquals, List *otherquals)

bool	join_clause_is_movable_to (RestrictInfo rinfo, RelOptInfo baserel)

bool	join_clause_is_movable_into (RestrictInfo *rinfo, Relids currentrelids, Relids current_and_outer)

Macro Definition Documentation

◆ make_simple_restrictinfo

#define make_simple_restrictinfo	(	root,
		clause
	)	make_restrictinfo(root, clause, true, false, false, 0, NULL, NULL, NULL)

Definition at line 21 of file restrictinfo.h.

Referenced by expand_indexqual_rowcompare(), get_index_clause_from_support(), and match_boolean_index_clause().

Function Documentation

◆ commute_restrictinfo()

RestrictInfo* commute_restrictinfo	(	RestrictInfo *	rinfo,
		Oid	comm_op
	)

Definition at line 326 of file restrictinfo.c.

References OpExpr::args, Assert, castNode, RestrictInfo::clause, RestrictInfo::hasheqoperator, RestrictInfo::hashjoinoperator, InvalidOid, RestrictInfo::left_bucketsize, RestrictInfo::left_ec, RestrictInfo::left_em, RestrictInfo::left_mcvfreq, RestrictInfo::left_relids, linitial, list_length(), list_make2, lsecond, makeNode, NIL, OpExpr::opfuncid, OpExpr::opno, RestrictInfo::orclause, RestrictInfo::right_bucketsize, RestrictInfo::right_ec, RestrictInfo::right_em, RestrictInfo::right_mcvfreq, RestrictInfo::right_relids, and RestrictInfo::scansel_cache.

Referenced by match_opclause_to_indexcol().

 {
     RestrictInfo *result;
     OpExpr     *newclause;
     OpExpr     *clause = castNode(OpExpr, rinfo->clause);
 
     Assert(list_length(clause->args) == 2);
 
     /* flat-copy all the fields of clause ... */
     newclause = makeNode(OpExpr);
     memcpy(newclause, clause, sizeof(OpExpr));
 
     /* ... and adjust those we need to change to commute it */
     newclause->opno = comm_op;
     newclause->opfuncid = InvalidOid;
     newclause->args = list_make2(lsecond(clause->args),
                                  linitial(clause->args));
 
     /* likewise, flat-copy all the fields of rinfo ... */
     result = makeNode(RestrictInfo);
     memcpy(result, rinfo, sizeof(RestrictInfo));
 
     /*
      * ... and adjust those we need to change.  Note in particular that we can
      * preserve any cached selectivity or cost estimates, since those ought to
      * be the same for the new clause.  Likewise we can keep the source's
      * parent_ec.
      */
     result->clause = (Expr *) newclause;
     result->left_relids = rinfo->right_relids;
     result->right_relids = rinfo->left_relids;
     Assert(result->orclause == NULL);
     result->left_ec = rinfo->right_ec;
     result->right_ec = rinfo->left_ec;
     result->left_em = rinfo->right_em;
     result->right_em = rinfo->left_em;
     result->scansel_cache = NIL;    /* not worth updating this */
     if (rinfo->hashjoinoperator == clause->opno)
         result->hashjoinoperator = comm_op;
     else
         result->hashjoinoperator = InvalidOid;
     result->left_bucketsize = rinfo->right_bucketsize;
     result->right_bucketsize = rinfo->left_bucketsize;
     result->left_mcvfreq = rinfo->right_mcvfreq;
     result->right_mcvfreq = rinfo->left_mcvfreq;
     result->hasheqoperator = InvalidOid;
 
     return result;
 }

◆ extract_actual_clauses()

List* extract_actual_clauses	(	List *	restrictinfo_list,
		bool	pseudoconstant
	)

Definition at line 443 of file restrictinfo.c.

References RestrictInfo::clause, lappend(), lfirst_node, NIL, and RestrictInfo::pseudoconstant.

 {
     List       *result = NIL;
     ListCell   *l;
 
     foreach(l, restrictinfo_list)
     {
         RestrictInfo *rinfo = lfirst_node(RestrictInfo, l);
 
         if (rinfo->pseudoconstant == pseudoconstant)
             result = lappend(result, rinfo->clause);
     }
     return result;
 }

◆ extract_actual_join_clauses()

void extract_actual_join_clauses	(	List *	restrictinfo_list,
		Relids	joinrelids,
		List **	joinquals,
		List **	otherquals
	)

Definition at line 470 of file restrictinfo.c.

References Assert, RestrictInfo::clause, lappend(), lfirst_node, NIL, RestrictInfo::pseudoconstant, and RINFO_IS_PUSHED_DOWN.

Referenced by create_hashjoin_plan(), create_mergejoin_plan(), and create_nestloop_plan().

 {
     ListCell   *l;
 
     *joinquals = NIL;
     *otherquals = NIL;
 
     foreach(l, restrictinfo_list)
     {
         RestrictInfo *rinfo = lfirst_node(RestrictInfo, l);
 
         if (RINFO_IS_PUSHED_DOWN(rinfo, joinrelids))
         {
             if (!rinfo->pseudoconstant)
                 *otherquals = lappend(*otherquals, rinfo->clause);
         }
         else
         {
             /* joinquals shouldn't have been marked pseudoconstant */
             Assert(!rinfo->pseudoconstant);
             *joinquals = lappend(*joinquals, rinfo->clause);
         }
     }
 }

◆ get_actual_clauses()

List* get_actual_clauses ( List * restrictinfo_list )

Definition at line 420 of file restrictinfo.c.

References Assert, RestrictInfo::clause, lappend(), lfirst_node, NIL, and RestrictInfo::pseudoconstant.

Referenced by create_bitmap_subplan(), create_hashjoin_plan(), create_join_plan(), and create_mergejoin_plan().

 {
     List       *result = NIL;
     ListCell   *l;
 
     foreach(l, restrictinfo_list)
     {
         RestrictInfo *rinfo = lfirst_node(RestrictInfo, l);
 
         Assert(!rinfo->pseudoconstant);
 
         result = lappend(result, rinfo->clause);
     }
     return result;
 }

◆ join_clause_is_movable_into()

bool join_clause_is_movable_into	(	RestrictInfo *	rinfo,
		Relids	currentrelids,
		Relids	current_and_outer
	)

Definition at line 598 of file restrictinfo.c.

References bms_is_subset(), bms_overlap(), RestrictInfo::clause_relids, RestrictInfo::nullable_relids, and RestrictInfo::outer_relids.

Referenced by create_nestloop_path(), get_baserel_parampathinfo(), get_joinrel_parampathinfo(), and has_indexed_join_quals().

 {
     /* Clause must be evaluable given available context */
     if (!bms_is_subset(rinfo->clause_relids, current_and_outer))
         return false;
 
     /* Clause must physically reference at least one target rel */
     if (!bms_overlap(currentrelids, rinfo->clause_relids))
         return false;
 
     /* Cannot move an outer-join clause into the join's outer side */
     if (bms_overlap(currentrelids, rinfo->outer_relids))
         return false;
 
     /*
      * Target rel(s) must not be nullable below the clause.  This is
      * approximate, in the safe direction, because the current join might be
      * above the join where the nulling would happen, in which case the clause
      * would work correctly here.  But we don't have enough info to be sure.
      */
     if (bms_overlap(currentrelids, rinfo->nullable_relids))
         return false;
 
     return true;
 }

◆ join_clause_is_movable_to()

bool join_clause_is_movable_to	(	RestrictInfo *	rinfo,
		RelOptInfo *	baserel
	)

Definition at line 525 of file restrictinfo.c.

References bms_is_member(), bms_overlap(), RestrictInfo::clause_relids, RelOptInfo::lateral_referencers, RestrictInfo::nullable_relids, RestrictInfo::outer_relids, and RelOptInfo::relid.

Referenced by BuildParameterizedTidPaths(), check_index_predicates(), extract_restriction_or_clauses(), match_join_clauses_to_index(), and postgresGetForeignPaths().

 {
     /* Clause must physically reference target rel */
     if (!bms_is_member(baserel->relid, rinfo->clause_relids))
         return false;
 
     /* Cannot move an outer-join clause into the join's outer side */
     if (bms_is_member(baserel->relid, rinfo->outer_relids))
         return false;
 
     /* Target rel must not be nullable below the clause */
     if (bms_is_member(baserel->relid, rinfo->nullable_relids))
         return false;
 
     /* Clause must not use any rels with LATERAL references to this rel */
     if (bms_overlap(baserel->lateral_referencers, rinfo->clause_relids))
         return false;
 
     return true;
 }

◆ make_restrictinfo()

RestrictInfo* make_restrictinfo	(	PlannerInfo *	root,
		Expr *	clause,
		bool	is_pushed_down,
		bool	outerjoin_delayed,
		bool	pseudoconstant,
		Index	security_level,
		Relids	required_relids,
		Relids	outer_relids,
		Relids	nullable_relids
	)

Definition at line 61 of file restrictinfo.c.

References Assert, is_andclause(), is_orclause(), make_restrictinfo_internal(), and make_sub_restrictinfos().

Referenced by apply_child_basequals(), build_implied_join_equality(), consider_new_or_clause(), distribute_qual_to_rels(), foreign_grouping_ok(), process_equivalence(), and process_implied_equality().

 {
     /*
      * If it's an OR clause, build a modified copy with RestrictInfos inserted
      * above each subclause of the top-level AND/OR structure.
      */
     if (is_orclause(clause))
         return (RestrictInfo *) make_sub_restrictinfos(root,
                                                        clause,
                                                        is_pushed_down,
                                                        outerjoin_delayed,
                                                        pseudoconstant,
                                                        security_level,
                                                        required_relids,
                                                        outer_relids,
                                                        nullable_relids);
 
     /* Shouldn't be an AND clause, else AND/OR flattening messed up */
     Assert(!is_andclause(clause));
 
     return make_restrictinfo_internal(root,
                                       clause,
                                       NULL,
                                       is_pushed_down,
                                       outerjoin_delayed,
                                       pseudoconstant,
                                       security_level,
                                       required_relids,
                                       outer_relids,
                                       nullable_relids);
 }

◆ restriction_is_or_clause()

bool restriction_is_or_clause ( RestrictInfo * restrictinfo )

Definition at line 382 of file restrictinfo.c.

References RestrictInfo::orclause.

Referenced by extract_or_clause(), extract_restriction_or_clauses(), generate_bitmap_or_paths(), match_join_clauses_to_index(), and TidQualFromRestrictInfoList().

 {
     if (restrictinfo->orclause != NULL)
         return true;
     else
         return false;
 }

◆ restriction_is_securely_promotable()

bool restriction_is_securely_promotable	(	RestrictInfo *	restrictinfo,
		RelOptInfo *	rel
	)

Definition at line 397 of file restrictinfo.c.

References RelOptInfo::baserestrict_min_security, RestrictInfo::leakproof, and RestrictInfo::security_level.

Referenced by BuildParameterizedTidPaths(), match_clause_to_index(), and TidQualFromRestrictInfo().

 {
     /*
      * It's okay if there are no baserestrictinfo clauses for the rel that
      * would need to go before this one, *or* if this one is leakproof.
      */
     if (restrictinfo->security_level <= rel->baserestrict_min_security ||
         restrictinfo->leakproof)
         return true;
     else
         return false;
 }

Macros

Functions