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

Go to the source code of this file.

Functions

void expand_inherited_rtentry (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte, Index rti)
 
bool apply_child_basequals (PlannerInfo *root, RelOptInfo *parentrel, RelOptInfo *childrel, RangeTblEntry *childRTE, AppendRelInfo *appinfo)
 

Function Documentation

◆ apply_child_basequals()

bool apply_child_basequals ( PlannerInfo root,
RelOptInfo parentrel,
RelOptInfo childrel,
RangeTblEntry childRTE,
AppendRelInfo appinfo 
)

Definition at line 693 of file inherit.c.

References adjust_appendrel_attrs(), Assert, RelOptInfo::baserestrict_min_security, RelOptInfo::baserestrictinfo, RestrictInfo::clause, contain_vars_of_level(), contain_volatile_functions(), DatumGetBool, eval_const_expressions(), PlannerInfo::hasPseudoConstantQuals, RestrictInfo::is_pushed_down, IsA, lappend(), lfirst, make_ands_implicit(), make_restrictinfo(), Min, NIL, RestrictInfo::outerjoin_delayed, RestrictInfo::security_level, and RangeTblEntry::securityQuals.

Referenced by build_simple_rel().

696 {
697  List *childquals;
698  Index cq_min_security;
699  ListCell *lc;
700 
701  /*
702  * The child rel's targetlist might contain non-Var expressions, which
703  * means that substitution into the quals could produce opportunities for
704  * const-simplification, and perhaps even pseudoconstant quals. Therefore,
705  * transform each RestrictInfo separately to see if it reduces to a
706  * constant or pseudoconstant. (We must process them separately to keep
707  * track of the security level of each qual.)
708  */
709  childquals = NIL;
710  cq_min_security = UINT_MAX;
711  foreach(lc, parentrel->baserestrictinfo)
712  {
713  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
714  Node *childqual;
715  ListCell *lc2;
716 
717  Assert(IsA(rinfo, RestrictInfo));
718  childqual = adjust_appendrel_attrs(root,
719  (Node *) rinfo->clause,
720  1, &appinfo);
721  childqual = eval_const_expressions(root, childqual);
722  /* check for flat-out constant */
723  if (childqual && IsA(childqual, Const))
724  {
725  if (((Const *) childqual)->constisnull ||
726  !DatumGetBool(((Const *) childqual)->constvalue))
727  {
728  /* Restriction reduces to constant FALSE or NULL */
729  return false;
730  }
731  /* Restriction reduces to constant TRUE, so drop it */
732  continue;
733  }
734  /* might have gotten an AND clause, if so flatten it */
735  foreach(lc2, make_ands_implicit((Expr *) childqual))
736  {
737  Node *onecq = (Node *) lfirst(lc2);
738  bool pseudoconstant;
739 
740  /* check for pseudoconstant (no Vars or volatile functions) */
741  pseudoconstant =
742  !contain_vars_of_level(onecq, 0) &&
744  if (pseudoconstant)
745  {
746  /* tell createplan.c to check for gating quals */
747  root->hasPseudoConstantQuals = true;
748  }
749  /* reconstitute RestrictInfo with appropriate properties */
750  childquals = lappend(childquals,
751  make_restrictinfo((Expr *) onecq,
752  rinfo->is_pushed_down,
753  rinfo->outerjoin_delayed,
754  pseudoconstant,
755  rinfo->security_level,
756  NULL, NULL, NULL));
757  /* track minimum security level among child quals */
758  cq_min_security = Min(cq_min_security, rinfo->security_level);
759  }
760  }
761 
762  /*
763  * In addition to the quals inherited from the parent, we might have
764  * securityQuals associated with this particular child node. (Currently
765  * this can only happen in appendrels originating from UNION ALL;
766  * inheritance child tables don't have their own securityQuals, see
767  * expand_single_inheritance_child().) Pull any such securityQuals up
768  * into the baserestrictinfo for the child. This is similar to
769  * process_security_barrier_quals() for the parent rel, except that we
770  * can't make any general deductions from such quals, since they don't
771  * hold for the whole appendrel.
772  */
773  if (childRTE->securityQuals)
774  {
775  Index security_level = 0;
776 
777  foreach(lc, childRTE->securityQuals)
778  {
779  List *qualset = (List *) lfirst(lc);
780  ListCell *lc2;
781 
782  foreach(lc2, qualset)
783  {
784  Expr *qual = (Expr *) lfirst(lc2);
785 
786  /* not likely that we'd see constants here, so no check */
787  childquals = lappend(childquals,
788  make_restrictinfo(qual,
789  true, false, false,
790  security_level,
791  NULL, NULL, NULL));
792  cq_min_security = Min(cq_min_security, security_level);
793  }
794  security_level++;
795  }
796  Assert(security_level <= root->qual_security_level);
797  }
798 
799  /*
800  * OK, we've got all the baserestrictinfo quals for this child.
801  */
802  childrel->baserestrictinfo = childquals;
803  childrel->baserestrict_min_security = cq_min_security;
804 
805  return true;
806 }
#define NIL
Definition: pg_list.h:65
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
Index security_level
Definition: pathnodes.h:1997
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: restrictinfo.c:59
List * securityQuals
Definition: parsenodes.h:1125
List * baserestrictinfo
Definition: pathnodes.h:727
#define Min(x, y)
Definition: c.h:920
Definition: nodes.h:529
Node * eval_const_expressions(PlannerInfo *root, Node *node)
Definition: clauses.c:2255
Index baserestrict_min_security
Definition: pathnodes.h:729
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:726
bool outerjoin_delayed
Definition: pathnodes.h:1989
#define DatumGetBool(X)
Definition: postgres.h:393
List * lappend(List *list, void *datum)
Definition: list.c:321
Expr * clause
Definition: pathnodes.h:1985
List * make_ands_implicit(Expr *clause)
Definition: makefuncs.c:718
unsigned int Index
Definition: c.h:475
bool hasPseudoConstantQuals
Definition: pathnodes.h:348
bool is_pushed_down
Definition: pathnodes.h:1987
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
bool contain_vars_of_level(Node *node, int levelsup)
Definition: var.c:369
Definition: pg_list.h:50
Node * adjust_appendrel_attrs(PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
Definition: appendinfo.c:194

◆ expand_inherited_rtentry()

void expand_inherited_rtentry ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte,
Index  rti 
)

Definition at line 79 of file inherit.c.

References add_vars_to_targetlist(), PlanRowMark::allMarkTypes, Assert, bms_make_singleton(), build_simple_rel(), expand_appendrel_subquery(), expand_partitioned_rtentry(), expand_planner_arrays(), expand_single_inheritance_child(), find_all_inheritors(), get_plan_rowmark(), RangeTblEntry::inh, InvalidOid, PlanRowMark::isParent, lappend(), lfirst_oid, linitial_oid, list_length(), makeTargetEntry(), makeVar(), makeWholeRowVar(), NIL, NoLock, planner_rt_fetch, PlannerInfo::processed_tlist, pstrdup(), RelationData::rd_rel, RELATION_IS_OTHER_TEMP, RangeTblEntry::relid, RangeTblEntry::relkind, RangeTblEntry::rellockmode, ROW_MARK_COPY, PlanRowMark::rowmarkId, PlannerInfo::rowMarks, RTE_RELATION, RTE_SUBQUERY, RangeTblEntry::rtekind, PlanRowMark::rti, snprintf, table_close(), table_open(), and TableOidAttributeNumber.

Referenced by add_other_rels_to_query(), and expand_appendrel_subquery().

81 {
82  Oid parentOID;
83  Relation oldrelation;
84  LOCKMODE lockmode;
85  PlanRowMark *oldrc;
86  bool old_isParent = false;
87  int old_allMarkTypes = 0;
88 
89  Assert(rte->inh); /* else caller error */
90 
91  if (rte->rtekind == RTE_SUBQUERY)
92  {
93  expand_appendrel_subquery(root, rel, rte, rti);
94  return;
95  }
96 
97  Assert(rte->rtekind == RTE_RELATION);
98 
99  parentOID = rte->relid;
100 
101  /*
102  * We used to check has_subclass() here, but there's no longer any need
103  * to, because subquery_planner already did.
104  */
105 
106  /*
107  * The rewriter should already have obtained an appropriate lock on each
108  * relation named in the query, so we can open the parent relation without
109  * locking it. However, for each child relation we add to the query, we
110  * must obtain an appropriate lock, because this will be the first use of
111  * those relations in the parse/rewrite/plan pipeline. Child rels should
112  * use the same lockmode as their parent.
113  */
114  oldrelation = table_open(parentOID, NoLock);
115  lockmode = rte->rellockmode;
116 
117  /*
118  * If parent relation is selected FOR UPDATE/SHARE, we need to mark its
119  * PlanRowMark as isParent = true, and generate a new PlanRowMark for each
120  * child.
121  */
122  oldrc = get_plan_rowmark(root->rowMarks, rti);
123  if (oldrc)
124  {
125  old_isParent = oldrc->isParent;
126  oldrc->isParent = true;
127  /* Save initial value of allMarkTypes before children add to it */
128  old_allMarkTypes = oldrc->allMarkTypes;
129  }
130 
131  /* Scan the inheritance set and expand it */
132  if (oldrelation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
133  {
134  /*
135  * Partitioned table, so set up for partitioning.
136  */
137  Assert(rte->relkind == RELKIND_PARTITIONED_TABLE);
138 
139  /*
140  * Recursively expand and lock the partitions. While at it, also
141  * extract the partition key columns of all the partitioned tables.
142  */
143  expand_partitioned_rtentry(root, rel, rte, rti,
144  oldrelation, oldrc, lockmode);
145  }
146  else
147  {
148  /*
149  * Ordinary table, so process traditional-inheritance children. (Note
150  * that partitioned tables are not allowed to have inheritance
151  * children, so it's not possible for both cases to apply.)
152  */
153  List *inhOIDs;
154  ListCell *l;
155 
156  /* Scan for all members of inheritance set, acquire needed locks */
157  inhOIDs = find_all_inheritors(parentOID, lockmode, NULL);
158 
159  /*
160  * We used to special-case the situation where the table no longer has
161  * any children, by clearing rte->inh and exiting. That no longer
162  * works, because this function doesn't get run until after decisions
163  * have been made that depend on rte->inh. We have to treat such
164  * situations as normal inheritance. The table itself should always
165  * have been found, though.
166  */
167  Assert(inhOIDs != NIL);
168  Assert(linitial_oid(inhOIDs) == parentOID);
169 
170  /* Expand simple_rel_array and friends to hold child objects. */
171  expand_planner_arrays(root, list_length(inhOIDs));
172 
173  /*
174  * Expand inheritance children in the order the OIDs were returned by
175  * find_all_inheritors.
176  */
177  foreach(l, inhOIDs)
178  {
179  Oid childOID = lfirst_oid(l);
180  Relation newrelation;
181  RangeTblEntry *childrte;
182  Index childRTindex;
183 
184  /* Open rel if needed; we already have required locks */
185  if (childOID != parentOID)
186  newrelation = table_open(childOID, NoLock);
187  else
188  newrelation = oldrelation;
189 
190  /*
191  * It is possible that the parent table has children that are temp
192  * tables of other backends. We cannot safely access such tables
193  * (because of buffering issues), and the best thing to do seems
194  * to be to silently ignore them.
195  */
196  if (childOID != parentOID && RELATION_IS_OTHER_TEMP(newrelation))
197  {
198  table_close(newrelation, lockmode);
199  continue;
200  }
201 
202  /* Create RTE and AppendRelInfo, plus PlanRowMark if needed. */
203  expand_single_inheritance_child(root, rte, rti, oldrelation,
204  oldrc, newrelation,
205  &childrte, &childRTindex);
206 
207  /* Create the otherrel RelOptInfo too. */
208  (void) build_simple_rel(root, childRTindex, rel);
209 
210  /* Close child relations, but keep locks */
211  if (childOID != parentOID)
212  table_close(newrelation, NoLock);
213  }
214  }
215 
216  /*
217  * Some children might require different mark types, which would've been
218  * reported into oldrc. If so, add relevant entries to the top-level
219  * targetlist and update parent rel's reltarget. This should match what
220  * preprocess_targetlist() would have added if the mark types had been
221  * requested originally.
222  */
223  if (oldrc)
224  {
225  int new_allMarkTypes = oldrc->allMarkTypes;
226  Var *var;
227  TargetEntry *tle;
228  char resname[32];
229  List *newvars = NIL;
230 
231  /* The old PlanRowMark should already have necessitated adding TID */
232  Assert(old_allMarkTypes & ~(1 << ROW_MARK_COPY));
233 
234  /* Add whole-row junk Var if needed, unless we had it already */
235  if ((new_allMarkTypes & (1 << ROW_MARK_COPY)) &&
236  !(old_allMarkTypes & (1 << ROW_MARK_COPY)))
237  {
238  var = makeWholeRowVar(planner_rt_fetch(oldrc->rti, root),
239  oldrc->rti,
240  0,
241  false);
242  snprintf(resname, sizeof(resname), "wholerow%u", oldrc->rowmarkId);
243  tle = makeTargetEntry((Expr *) var,
244  list_length(root->processed_tlist) + 1,
245  pstrdup(resname),
246  true);
247  root->processed_tlist = lappend(root->processed_tlist, tle);
248  newvars = lappend(newvars, var);
249  }
250 
251  /* Add tableoid junk Var, unless we had it already */
252  if (!old_isParent)
253  {
254  var = makeVar(oldrc->rti,
256  OIDOID,
257  -1,
258  InvalidOid,
259  0);
260  snprintf(resname, sizeof(resname), "tableoid%u", oldrc->rowmarkId);
261  tle = makeTargetEntry((Expr *) var,
262  list_length(root->processed_tlist) + 1,
263  pstrdup(resname),
264  true);
265  root->processed_tlist = lappend(root->processed_tlist, tle);
266  newvars = lappend(newvars, var);
267  }
268 
269  /*
270  * Add the newly added Vars to parent's reltarget. We needn't worry
271  * about the children's reltargets, they'll be made later.
272  */
273  add_vars_to_targetlist(root, newvars, bms_make_singleton(0), false);
274  }
275 
276  table_close(oldrelation, NoLock);
277 }
#define NIL
Definition: pg_list.h:65
List * rowMarks
Definition: pathnodes.h:292
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
int LOCKMODE
Definition: lockdefs.h:26
char * pstrdup(const char *in)
Definition: mcxt.c:1186
Var * makeWholeRowVar(RangeTblEntry *rte, Index varno, Index varlevelsup, bool allowScalar)
Definition: makefuncs.c:133
static void expand_appendrel_subquery(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte, Index rti)
Definition: inherit.c:652
Form_pg_class rd_rel
Definition: rel.h:109
unsigned int Oid
Definition: postgres_ext.h:31
Definition: primnodes.h:181
Index rowmarkId
Definition: plannodes.h:1079
void add_vars_to_targetlist(PlannerInfo *root, List *vars, Relids where_needed, bool create_new_ph)
Definition: initsplan.c:229
static void expand_single_inheritance_child(PlannerInfo *root, RangeTblEntry *parentrte, Index parentRTindex, Relation parentrel, PlanRowMark *top_parentrc, Relation childrel, RangeTblEntry **childrte_p, Index *childRTindex_p)
Definition: inherit.c:414
#define planner_rt_fetch(rti, root)
Definition: pathnodes.h:373
Bitmapset * bms_make_singleton(int x)
Definition: bitmapset.c:186
#define NoLock
Definition: lockdefs.h:34
#define TableOidAttributeNumber
Definition: sysattr.h:26
int allMarkTypes
Definition: plannodes.h:1081
RelOptInfo * build_simple_rel(PlannerInfo *root, int relid, RelOptInfo *parent)
Definition: relnode.c:194
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition: makefuncs.c:238
Var * makeVar(Index varno, AttrNumber varattno, Oid vartype, int32 vartypmod, Oid varcollid, Index varlevelsup)
Definition: makefuncs.c:66
List * lappend(List *list, void *datum)
Definition: list.c:321
unsigned int Index
Definition: c.h:475
#define InvalidOid
Definition: postgres_ext.h:36
#define Assert(condition)
Definition: c.h:738
#define RELATION_IS_OTHER_TEMP(relation)
Definition: rel.h:593
#define linitial_oid(l)
Definition: pg_list.h:197
static int list_length(const List *l)
Definition: pg_list.h:169
static void expand_partitioned_rtentry(PlannerInfo *root, RelOptInfo *relinfo, RangeTblEntry *parentrte, Index parentRTindex, Relation parentrel, PlanRowMark *top_parentrc, LOCKMODE lockmode)
Definition: inherit.c:284
RTEKind rtekind
Definition: parsenodes.h:976
List * find_all_inheritors(Oid parentrelId, LOCKMODE lockmode, List **numparents)
Definition: pg_inherits.c:165
void expand_planner_arrays(PlannerInfo *root, int add_size)
Definition: relnode.c:152
PlanRowMark * get_plan_rowmark(List *rowmarks, Index rtindex)
Definition: preptlist.c:425
bool isParent
Definition: plannodes.h:1084
List * processed_tlist
Definition: pathnodes.h:325
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
Definition: pg_list.h:50
#define snprintf
Definition: port.h:193
#define lfirst_oid(lc)
Definition: pg_list.h:192