PostgreSQL Source Code  git master
restrictinfo.h File Reference
#include "nodes/pathnodes.h"
Include dependency graph for restrictinfo.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros

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

Functions

RestrictInfomake_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)
 
RestrictInfocommute_restrictinfo (RestrictInfo *rinfo, Oid comm_op)
 
bool restriction_is_or_clause (RestrictInfo *restrictinfo)
 
bool restriction_is_securely_promotable (RestrictInfo *restrictinfo, RelOptInfo *rel)
 
Listget_actual_clauses (List *restrictinfo_list)
 
Listextract_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.

Function Documentation

◆ commute_restrictinfo()

RestrictInfo* commute_restrictinfo ( RestrictInfo rinfo,
Oid  comm_op 
)

Definition at line 327 of file restrictinfo.c.

328 {
329  RestrictInfo *result;
330  OpExpr *newclause;
331  OpExpr *clause = castNode(OpExpr, rinfo->clause);
332 
333  Assert(list_length(clause->args) == 2);
334 
335  /* flat-copy all the fields of clause ... */
336  newclause = makeNode(OpExpr);
337  memcpy(newclause, clause, sizeof(OpExpr));
338 
339  /* ... and adjust those we need to change to commute it */
340  newclause->opno = comm_op;
341  newclause->opfuncid = InvalidOid;
342  newclause->args = list_make2(lsecond(clause->args),
343  linitial(clause->args));
344 
345  /* likewise, flat-copy all the fields of rinfo ... */
346  result = makeNode(RestrictInfo);
347  memcpy(result, rinfo, sizeof(RestrictInfo));
348 
349  /*
350  * ... and adjust those we need to change. Note in particular that we can
351  * preserve any cached selectivity or cost estimates, since those ought to
352  * be the same for the new clause. Likewise we can keep the source's
353  * parent_ec.
354  */
355  result->clause = (Expr *) newclause;
356  result->left_relids = rinfo->right_relids;
357  result->right_relids = rinfo->left_relids;
358  Assert(result->orclause == NULL);
359  result->left_ec = rinfo->right_ec;
360  result->right_ec = rinfo->left_ec;
361  result->left_em = rinfo->right_em;
362  result->right_em = rinfo->left_em;
363  result->scansel_cache = NIL; /* not worth updating this */
364  if (rinfo->hashjoinoperator == clause->opno)
365  result->hashjoinoperator = comm_op;
366  else
367  result->hashjoinoperator = InvalidOid;
368  result->left_bucketsize = rinfo->right_bucketsize;
369  result->right_bucketsize = rinfo->left_bucketsize;
370  result->left_mcvfreq = rinfo->right_mcvfreq;
371  result->right_mcvfreq = rinfo->left_mcvfreq;
374 
375  return result;
376 }
Assert(fmt[strlen(fmt) - 1] !='\n')
#define makeNode(_type_)
Definition: nodes.h:621
#define castNode(_type_, nodeptr)
Definition: nodes.h:642
static int list_length(const List *l)
Definition: pg_list.h:149
#define NIL
Definition: pg_list.h:65
#define linitial(l)
Definition: pg_list.h:174
#define lsecond(l)
Definition: pg_list.h:179
#define list_make2(x1, x2)
Definition: pg_list.h:208
#define InvalidOid
Definition: postgres_ext.h:36
Oid opno
Definition: primnodes.h:551
List * args
Definition: primnodes.h:557
Oid opfuncid
Definition: primnodes.h:552
Selectivity left_mcvfreq
Definition: pathnodes.h:2141
EquivalenceClass * left_ec
Definition: pathnodes.h:2126
Selectivity right_bucketsize
Definition: pathnodes.h:2140
Oid right_hasheqoperator
Definition: pathnodes.h:2146
Relids right_relids
Definition: pathnodes.h:2106
Oid left_hasheqoperator
Definition: pathnodes.h:2145
Selectivity left_bucketsize
Definition: pathnodes.h:2139
Relids left_relids
Definition: pathnodes.h:2105
List * scansel_cache
Definition: pathnodes.h:2130
EquivalenceMember * left_em
Definition: pathnodes.h:2128
Expr * clause
Definition: pathnodes.h:2075
EquivalenceClass * right_ec
Definition: pathnodes.h:2127
Expr * orclause
Definition: pathnodes.h:2109
EquivalenceMember * right_em
Definition: pathnodes.h:2129
Oid hashjoinoperator
Definition: pathnodes.h:2136
Selectivity right_mcvfreq
Definition: pathnodes.h:2142

References OpExpr::args, Assert(), castNode, RestrictInfo::clause, RestrictInfo::hashjoinoperator, InvalidOid, RestrictInfo::left_bucketsize, RestrictInfo::left_ec, RestrictInfo::left_em, RestrictInfo::left_hasheqoperator, 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_hasheqoperator, RestrictInfo::right_mcvfreq, RestrictInfo::right_relids, and RestrictInfo::scansel_cache.

Referenced by match_opclause_to_indexcol().

◆ extract_actual_clauses()

List* extract_actual_clauses ( List restrictinfo_list,
bool  pseudoconstant 
)

◆ extract_actual_join_clauses()

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

Definition at line 472 of file restrictinfo.c.

476 {
477  ListCell *l;
478 
479  *joinquals = NIL;
480  *otherquals = NIL;
481 
482  foreach(l, restrictinfo_list)
483  {
485 
486  if (RINFO_IS_PUSHED_DOWN(rinfo, joinrelids))
487  {
488  if (!rinfo->pseudoconstant)
489  *otherquals = lappend(*otherquals, rinfo->clause);
490  }
491  else
492  {
493  /* joinquals shouldn't have been marked pseudoconstant */
494  Assert(!rinfo->pseudoconstant);
495  *joinquals = lappend(*joinquals, rinfo->clause);
496  }
497  }
498 }
#define RINFO_IS_PUSHED_DOWN(rinfo, joinrelids)
Definition: pathnodes.h:2159

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().

◆ get_actual_clauses()

List* get_actual_clauses ( List restrictinfo_list)

Definition at line 422 of file restrictinfo.c.

423 {
424  List *result = NIL;
425  ListCell *l;
426 
427  foreach(l, restrictinfo_list)
428  {
430 
431  Assert(!rinfo->pseudoconstant);
432 
433  result = lappend(result, rinfo->clause);
434  }
435  return result;
436 }

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().

◆ join_clause_is_movable_into()

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

Definition at line 600 of file restrictinfo.c.

603 {
604  /* Clause must be evaluable given available context */
605  if (!bms_is_subset(rinfo->clause_relids, current_and_outer))
606  return false;
607 
608  /* Clause must physically reference at least one target rel */
609  if (!bms_overlap(currentrelids, rinfo->clause_relids))
610  return false;
611 
612  /* Cannot move an outer-join clause into the join's outer side */
613  if (bms_overlap(currentrelids, rinfo->outer_relids))
614  return false;
615 
616  /*
617  * Target rel(s) must not be nullable below the clause. This is
618  * approximate, in the safe direction, because the current join might be
619  * above the join where the nulling would happen, in which case the clause
620  * would work correctly here. But we don't have enough info to be sure.
621  */
622  if (bms_overlap(currentrelids, rinfo->nullable_relids))
623  return false;
624 
625  return true;
626 }
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:315
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:494
Relids clause_relids
Definition: pathnodes.h:2093
Relids nullable_relids
Definition: pathnodes.h:2102
Relids outer_relids
Definition: pathnodes.h:2099

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().

◆ join_clause_is_movable_to()

bool join_clause_is_movable_to ( RestrictInfo rinfo,
RelOptInfo baserel 
)

Definition at line 527 of file restrictinfo.c.

528 {
529  /* Clause must physically reference target rel */
530  if (!bms_is_member(baserel->relid, rinfo->clause_relids))
531  return false;
532 
533  /* Cannot move an outer-join clause into the join's outer side */
534  if (bms_is_member(baserel->relid, rinfo->outer_relids))
535  return false;
536 
537  /* Target rel must not be nullable below the clause */
538  if (bms_is_member(baserel->relid, rinfo->nullable_relids))
539  return false;
540 
541  /* Clause must not use any rels with LATERAL references to this rel */
542  if (bms_overlap(baserel->lateral_referencers, rinfo->clause_relids))
543  return false;
544 
545  return true;
546 }
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:427
Index relid
Definition: pathnodes.h:710
Relids lateral_referencers
Definition: pathnodes.h:718

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().

◆ 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.

70 {
71  /*
72  * If it's an OR clause, build a modified copy with RestrictInfos inserted
73  * above each subclause of the top-level AND/OR structure.
74  */
75  if (is_orclause(clause))
76  return (RestrictInfo *) make_sub_restrictinfos(root,
77  clause,
78  is_pushed_down,
79  outerjoin_delayed,
80  pseudoconstant,
81  security_level,
82  required_relids,
83  outer_relids,
84  nullable_relids);
85 
86  /* Shouldn't be an AND clause, else AND/OR flattening messed up */
87  Assert(!is_andclause(clause));
88 
89  return make_restrictinfo_internal(root,
90  clause,
91  NULL,
92  is_pushed_down,
93  outerjoin_delayed,
94  pseudoconstant,
95  security_level,
96  required_relids,
97  outer_relids,
98  nullable_relids);
99 }
static bool is_andclause(const void *clause)
Definition: nodeFuncs.h:95
static bool is_orclause(const void *clause)
Definition: nodeFuncs.h:104
static RestrictInfo * make_restrictinfo_internal(PlannerInfo *root, Expr *clause, Expr *orclause, bool is_pushed_down, bool outerjoin_delayed, bool pseudoconstant, Index security_level, Relids required_relids, Relids outer_relids, Relids nullable_relids)
Definition: restrictinfo.c:107
static Expr * make_sub_restrictinfos(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: restrictinfo.c:244

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().

◆ restriction_is_or_clause()

bool restriction_is_or_clause ( RestrictInfo restrictinfo)

Definition at line 384 of file restrictinfo.c.

385 {
386  if (restrictinfo->orclause != NULL)
387  return true;
388  else
389  return false;
390 }

References RestrictInfo::orclause.

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

◆ restriction_is_securely_promotable()

bool restriction_is_securely_promotable ( RestrictInfo restrictinfo,
RelOptInfo rel 
)

Definition at line 399 of file restrictinfo.c.

401 {
402  /*
403  * It's okay if there are no baserestrictinfo clauses for the rel that
404  * would need to go before this one, *or* if this one is leakproof.
405  */
406  if (restrictinfo->security_level <= rel->baserestrict_min_security ||
407  restrictinfo->leakproof)
408  return true;
409  else
410  return false;
411 }
Index baserestrict_min_security
Definition: pathnodes.h:748
Index security_level
Definition: pathnodes.h:2090
bool leakproof
Definition: pathnodes.h:2085

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

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