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(clause)   make_restrictinfo(clause, true, false, false, 0, NULL, NULL, NULL)
 

Functions

RestrictInfomake_restrictinfo (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 (   clause)    make_restrictinfo(clause, true, false, false, 0, NULL, NULL, NULL)

Function Documentation

◆ commute_restrictinfo()

RestrictInfo* commute_restrictinfo ( RestrictInfo rinfo,
Oid  comm_op 
)

Definition at line 306 of file restrictinfo.c.

References OpExpr::args, Assert, castNode, RestrictInfo::clause, 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().

307 {
308  RestrictInfo *result;
309  OpExpr *newclause;
310  OpExpr *clause = castNode(OpExpr, rinfo->clause);
311 
312  Assert(list_length(clause->args) == 2);
313 
314  /* flat-copy all the fields of clause ... */
315  newclause = makeNode(OpExpr);
316  memcpy(newclause, clause, sizeof(OpExpr));
317 
318  /* ... and adjust those we need to change to commute it */
319  newclause->opno = comm_op;
320  newclause->opfuncid = InvalidOid;
321  newclause->args = list_make2(lsecond(clause->args),
322  linitial(clause->args));
323 
324  /* likewise, flat-copy all the fields of rinfo ... */
325  result = makeNode(RestrictInfo);
326  memcpy(result, rinfo, sizeof(RestrictInfo));
327 
328  /*
329  * ... and adjust those we need to change. Note in particular that we can
330  * preserve any cached selectivity or cost estimates, since those ought to
331  * be the same for the new clause. Likewise we can keep the source's
332  * parent_ec.
333  */
334  result->clause = (Expr *) newclause;
335  result->left_relids = rinfo->right_relids;
336  result->right_relids = rinfo->left_relids;
337  Assert(result->orclause == NULL);
338  result->left_ec = rinfo->right_ec;
339  result->right_ec = rinfo->left_ec;
340  result->left_em = rinfo->right_em;
341  result->right_em = rinfo->left_em;
342  result->scansel_cache = NIL; /* not worth updating this */
343  if (rinfo->hashjoinoperator == clause->opno)
344  result->hashjoinoperator = comm_op;
345  else
346  result->hashjoinoperator = InvalidOid;
347  result->left_bucketsize = rinfo->right_bucketsize;
348  result->right_bucketsize = rinfo->left_bucketsize;
349  result->left_mcvfreq = rinfo->right_mcvfreq;
350  result->right_mcvfreq = rinfo->left_mcvfreq;
351 
352  return result;
353 }
#define list_make2(x1, x2)
Definition: pg_list.h:229
#define NIL
Definition: pg_list.h:65
Selectivity right_mcvfreq
Definition: pathnodes.h:2007
#define castNode(_type_, nodeptr)
Definition: nodes.h:594
Expr * orclause
Definition: pathnodes.h:1974
Relids left_relids
Definition: pathnodes.h:1970
EquivalenceClass * right_ec
Definition: pathnodes.h:1992
#define lsecond(l)
Definition: pg_list.h:200
#define linitial(l)
Definition: pg_list.h:195
EquivalenceMember * left_em
Definition: pathnodes.h:1993
EquivalenceMember * right_em
Definition: pathnodes.h:1994
Expr * clause
Definition: pathnodes.h:1943
Oid opfuncid
Definition: primnodes.h:503
#define InvalidOid
Definition: postgres_ext.h:36
Selectivity left_bucketsize
Definition: pathnodes.h:2004
#define makeNode(_type_)
Definition: nodes.h:573
Relids right_relids
Definition: pathnodes.h:1971
#define Assert(condition)
Definition: c.h:739
Selectivity left_mcvfreq
Definition: pathnodes.h:2006
Oid hashjoinoperator
Definition: pathnodes.h:2001
static int list_length(const List *l)
Definition: pg_list.h:169
Selectivity right_bucketsize
Definition: pathnodes.h:2005
EquivalenceClass * left_ec
Definition: pathnodes.h:1991
Oid opno
Definition: primnodes.h:502
List * args
Definition: primnodes.h:508
List * scansel_cache
Definition: pathnodes.h:1995

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

453 {
454  ListCell *l;
455 
456  *joinquals = NIL;
457  *otherquals = NIL;
458 
459  foreach(l, restrictinfo_list)
460  {
462 
463  if (RINFO_IS_PUSHED_DOWN(rinfo, joinrelids))
464  {
465  if (!rinfo->pseudoconstant)
466  *otherquals = lappend(*otherquals, rinfo->clause);
467  }
468  else
469  {
470  /* joinquals shouldn't have been marked pseudoconstant */
471  Assert(!rinfo->pseudoconstant);
472  *joinquals = lappend(*joinquals, rinfo->clause);
473  }
474  }
475 }
#define NIL
Definition: pg_list.h:65
bool pseudoconstant
Definition: pathnodes.h:1951
#define lfirst_node(type, lc)
Definition: pg_list.h:193
List * lappend(List *list, void *datum)
Definition: list.c:322
Expr * clause
Definition: pathnodes.h:1943
#define RINFO_IS_PUSHED_DOWN(rinfo, joinrelids)
Definition: pathnodes.h:2020
#define Assert(condition)
Definition: c.h:739

◆ get_actual_clauses()

List* get_actual_clauses ( List restrictinfo_list)

Definition at line 399 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().

400 {
401  List *result = NIL;
402  ListCell *l;
403 
404  foreach(l, restrictinfo_list)
405  {
407 
408  Assert(!rinfo->pseudoconstant);
409 
410  result = lappend(result, rinfo->clause);
411  }
412  return result;
413 }
#define NIL
Definition: pg_list.h:65
bool pseudoconstant
Definition: pathnodes.h:1951
#define lfirst_node(type, lc)
Definition: pg_list.h:193
List * lappend(List *list, void *datum)
Definition: list.c:322
Expr * clause
Definition: pathnodes.h:1943
#define Assert(condition)
Definition: c.h:739
Definition: pg_list.h:50

◆ join_clause_is_movable_into()

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

Definition at line 577 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().

580 {
581  /* Clause must be evaluable given available context */
582  if (!bms_is_subset(rinfo->clause_relids, current_and_outer))
583  return false;
584 
585  /* Clause must physically reference at least one target rel */
586  if (!bms_overlap(currentrelids, rinfo->clause_relids))
587  return false;
588 
589  /* Cannot move an outer-join clause into the join's outer side */
590  if (bms_overlap(currentrelids, rinfo->outer_relids))
591  return false;
592 
593  /*
594  * Target rel(s) must not be nullable below the clause. This is
595  * approximate, in the safe direction, because the current join might be
596  * above the join where the nulling would happen, in which case the clause
597  * would work correctly here. But we don't have enough info to be sure.
598  */
599  if (bms_overlap(currentrelids, rinfo->nullable_relids))
600  return false;
601 
602  return true;
603 }
Relids clause_relids
Definition: pathnodes.h:1958
Relids outer_relids
Definition: pathnodes.h:1964
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:315
Relids nullable_relids
Definition: pathnodes.h:1967
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:494

◆ join_clause_is_movable_to()

bool join_clause_is_movable_to ( RestrictInfo rinfo,
RelOptInfo baserel 
)

Definition at line 504 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().

505 {
506  /* Clause must physically reference target rel */
507  if (!bms_is_member(baserel->relid, rinfo->clause_relids))
508  return false;
509 
510  /* Cannot move an outer-join clause into the join's outer side */
511  if (bms_is_member(baserel->relid, rinfo->outer_relids))
512  return false;
513 
514  /* Target rel must not be nullable below the clause */
515  if (bms_is_member(baserel->relid, rinfo->nullable_relids))
516  return false;
517 
518  /* Clause must not use any rels with LATERAL references to this rel */
519  if (bms_overlap(baserel->lateral_referencers, rinfo->clause_relids))
520  return false;
521 
522  return true;
523 }
Relids clause_relids
Definition: pathnodes.h:1958
Relids outer_relids
Definition: pathnodes.h:1964
Index relid
Definition: pathnodes.h:669
Relids lateral_referencers
Definition: pathnodes.h:677
Relids nullable_relids
Definition: pathnodes.h:1967
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:494
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:427

◆ make_restrictinfo()

RestrictInfo* make_restrictinfo ( 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 59 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(), and process_equivalence().

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

◆ restriction_is_or_clause()

bool restriction_is_or_clause ( RestrictInfo restrictinfo)

Definition at line 361 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().

362 {
363  if (restrictinfo->orclause != NULL)
364  return true;
365  else
366  return false;
367 }
Expr * orclause
Definition: pathnodes.h:1974

◆ restriction_is_securely_promotable()

bool restriction_is_securely_promotable ( RestrictInfo restrictinfo,
RelOptInfo rel 
)

Definition at line 376 of file restrictinfo.c.

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

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

378 {
379  /*
380  * It's okay if there are no baserestrictinfo clauses for the rel that
381  * would need to go before this one, *or* if this one is leakproof.
382  */
383  if (restrictinfo->security_level <= rel->baserestrict_min_security ||
384  restrictinfo->leakproof)
385  return true;
386  else
387  return false;
388 }
Index security_level
Definition: pathnodes.h:1955
bool leakproof
Definition: pathnodes.h:1953
Index baserestrict_min_security
Definition: pathnodes.h:705