PostgreSQL Source Code  git master
inherit.c File Reference
Include dependency graph for inherit.c:

Go to the source code of this file.

Functions

static void expand_partitioned_rtentry (PlannerInfo *root, RelOptInfo *relinfo, RangeTblEntry *parentrte, Index parentRTindex, Relation parentrel, PlanRowMark *top_parentrc, LOCKMODE lockmode)
 
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)
 
static Bitmapsettranslate_col_privs (const Bitmapset *parent_privs, List *translated_vars)
 
static void expand_appendrel_subquery (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte, Index rti)
 
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 691 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().

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

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

Definition at line 650 of file inherit.c.

References PlannerInfo::append_rel_list, Assert, build_simple_rel(), AppendRelInfo::child_relid, expand_inherited_rtentry(), RangeTblEntry::inh, lfirst, AppendRelInfo::parent_relid, and PlannerInfo::simple_rte_array.

Referenced by expand_inherited_rtentry().

652 {
653  ListCell *l;
654 
655  foreach(l, root->append_rel_list)
656  {
657  AppendRelInfo *appinfo = (AppendRelInfo *) lfirst(l);
658  Index childRTindex = appinfo->child_relid;
659  RangeTblEntry *childrte;
660  RelOptInfo *childrel;
661 
662  /* append_rel_list contains all append rels; ignore others */
663  if (appinfo->parent_relid != rti)
664  continue;
665 
666  /* find the child RTE, which should already exist */
667  Assert(childRTindex < root->simple_rel_array_size);
668  childrte = root->simple_rte_array[childRTindex];
669  Assert(childrte != NULL);
670 
671  /* Build the child RelOptInfo. */
672  childrel = build_simple_rel(root, childRTindex, rel);
673 
674  /* Child may itself be an inherited rel, either table or subquery. */
675  if (childrte->inh)
676  expand_inherited_rtentry(root, childrel, childrte, childRTindex);
677  }
678 }
RelOptInfo * build_simple_rel(PlannerInfo *root, int relid, RelOptInfo *parent)
Definition: relnode.c:185
RangeTblEntry ** simple_rte_array
Definition: pathnodes.h:209
List * append_rel_list
Definition: pathnodes.h:288
unsigned int Index
Definition: c.h:476
void expand_inherited_rtentry(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte, Index rti)
Definition: inherit.c:79
#define Assert(condition)
Definition: c.h:739
#define lfirst(lc)
Definition: pg_list.h:190
Index child_relid
Definition: pathnodes.h:2188
Index parent_relid
Definition: pathnodes.h:2187

◆ 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:290
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:650
Form_pg_class rd_rel
Definition: rel.h:83
unsigned int Oid
Definition: postgres_ext.h:31
Definition: primnodes.h:167
Index rowmarkId
Definition: plannodes.h:1059
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:412
#define planner_rt_fetch(rti, root)
Definition: pathnodes.h:371
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:1061
RelOptInfo * build_simple_rel(PlannerInfo *root, int relid, RelOptInfo *parent)
Definition: relnode.c:185
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition: makefuncs.c:236
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:322
unsigned int Index
Definition: c.h:476
#define InvalidOid
Definition: postgres_ext.h:36
#define Assert(condition)
Definition: c.h:739
#define RELATION_IS_OTHER_TEMP(relation)
Definition: rel.h:552
#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:974
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:143
PlanRowMark * get_plan_rowmark(List *rowmarks, Index rtindex)
Definition: preptlist.c:425
bool isParent
Definition: plannodes.h:1064
List * processed_tlist
Definition: pathnodes.h:323
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
Definition: pg_list.h:50
#define snprintf
Definition: port.h:192
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ expand_partitioned_rtentry()

static void expand_partitioned_rtentry ( PlannerInfo root,
RelOptInfo relinfo,
RangeTblEntry parentrte,
Index  parentRTindex,
Relation  parentrel,
PlanRowMark top_parentrc,
LOCKMODE  lockmode 
)
static

Definition at line 284 of file inherit.c.

References Assert, bms_next_member(), bms_num_members(), build_simple_rel(), check_stack_depth(), elog, ERROR, expand_planner_arrays(), expand_single_inheritance_child(), RangeTblEntry::extraUpdatedCols, PlannerInfo::glob, has_partition_attrs(), i, RangeTblEntry::inh, NoLock, PartitionDescData::nparts, RelOptInfo::nparts, PartitionDescData::oids, palloc0(), RelOptInfo::part_rels, PlannerInfo::partColsUpdated, PlannerGlobal::partition_directory, PartitionDirectoryLookup(), prune_append_rel_partitions(), RelationData::rd_rel, RELATION_IS_OTHER_TEMP, table_close(), table_open(), and RangeTblEntry::updatedCols.

Referenced by expand_inherited_rtentry().

288 {
289  PartitionDesc partdesc;
290  Bitmapset *live_parts;
291  int num_live_parts;
292  int i;
293 
295 
296  Assert(parentrte->inh);
297 
299  parentrel);
300 
301  /* A partitioned table should always have a partition descriptor. */
302  Assert(partdesc);
303 
304  /*
305  * Note down whether any partition key cols are being updated. Though it's
306  * the root partitioned table's updatedCols we are interested in, we
307  * instead use parentrte to get the updatedCols. This is convenient
308  * because parentrte already has the root partrel's updatedCols translated
309  * to match the attribute ordering of parentrel.
310  */
311  if (!root->partColsUpdated)
312  root->partColsUpdated =
313  has_partition_attrs(parentrel, parentrte->updatedCols, NULL);
314 
315  /*
316  * There shouldn't be any generated columns in the partition key.
317  */
318  Assert(!has_partition_attrs(parentrel, parentrte->extraUpdatedCols, NULL));
319 
320  /* Nothing further to do here if there are no partitions. */
321  if (partdesc->nparts == 0)
322  return;
323 
324  /*
325  * Perform partition pruning using restriction clauses assigned to parent
326  * relation. live_parts will contain PartitionDesc indexes of partitions
327  * that survive pruning. Below, we will initialize child objects for the
328  * surviving partitions.
329  */
330  live_parts = prune_append_rel_partitions(relinfo);
331 
332  /* Expand simple_rel_array and friends to hold child objects. */
333  num_live_parts = bms_num_members(live_parts);
334  if (num_live_parts > 0)
335  expand_planner_arrays(root, num_live_parts);
336 
337  /*
338  * We also store partition RelOptInfo pointers in the parent relation.
339  * Since we're palloc0'ing, slots corresponding to pruned partitions will
340  * contain NULL.
341  */
342  Assert(relinfo->part_rels == NULL);
343  relinfo->part_rels = (RelOptInfo **)
344  palloc0(relinfo->nparts * sizeof(RelOptInfo *));
345 
346  /*
347  * Create a child RTE for each live partition. Note that unlike
348  * traditional inheritance, we don't need a child RTE for the partitioned
349  * table itself, because it's not going to be scanned.
350  */
351  i = -1;
352  while ((i = bms_next_member(live_parts, i)) >= 0)
353  {
354  Oid childOID = partdesc->oids[i];
355  Relation childrel;
356  RangeTblEntry *childrte;
357  Index childRTindex;
358  RelOptInfo *childrelinfo;
359 
360  /* Open rel, acquiring required locks */
361  childrel = table_open(childOID, lockmode);
362 
363  /*
364  * Temporary partitions belonging to other sessions should have been
365  * disallowed at definition, but for paranoia's sake, let's double
366  * check.
367  */
368  if (RELATION_IS_OTHER_TEMP(childrel))
369  elog(ERROR, "temporary relation from another session found as partition");
370 
371  /* Create RTE and AppendRelInfo, plus PlanRowMark if needed. */
372  expand_single_inheritance_child(root, parentrte, parentRTindex,
373  parentrel, top_parentrc, childrel,
374  &childrte, &childRTindex);
375 
376  /* Create the otherrel RelOptInfo too. */
377  childrelinfo = build_simple_rel(root, childRTindex, relinfo);
378  relinfo->part_rels[i] = childrelinfo;
379 
380  /* If this child is itself partitioned, recurse */
381  if (childrel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
382  expand_partitioned_rtentry(root, childrelinfo,
383  childrte, childRTindex,
384  childrel, top_parentrc, lockmode);
385 
386  /* Close child relation, but keep locks */
387  table_close(childrel, NoLock);
388  }
389 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
int bms_next_member(const Bitmapset *a, int prevbit)
Definition: bitmapset.c:1043
Form_pg_class rd_rel
Definition: rel.h:83
unsigned int Oid
Definition: postgres_ext.h:31
Bitmapset * extraUpdatedCols
Definition: parsenodes.h:1101
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:412
#define ERROR
Definition: elog.h:43
int bms_num_members(const Bitmapset *a)
Definition: bitmapset.c:646
bool has_partition_attrs(Relation rel, Bitmapset *attnums, bool *used_in_expr)
Definition: partition.c:238
#define NoLock
Definition: lockdefs.h:34
void check_stack_depth(void)
Definition: postgres.c:3284
PlannerGlobal * glob
Definition: pathnodes.h:179
bool partColsUpdated
Definition: pathnodes.h:362
int nparts
Definition: pathnodes.h:719
RelOptInfo * build_simple_rel(PlannerInfo *root, int relid, RelOptInfo *parent)
Definition: relnode.c:185
void * palloc0(Size size)
Definition: mcxt.c:980
unsigned int Index
Definition: c.h:476
Bitmapset * updatedCols
Definition: parsenodes.h:1100
#define Assert(condition)
Definition: c.h:739
#define RELATION_IS_OTHER_TEMP(relation)
Definition: rel.h:552
struct RelOptInfo ** part_rels
Definition: pathnodes.h:722
static void expand_partitioned_rtentry(PlannerInfo *root, RelOptInfo *relinfo, RangeTblEntry *parentrte, Index parentRTindex, Relation parentrel, PlanRowMark *top_parentrc, LOCKMODE lockmode)
Definition: inherit.c:284
Bitmapset * prune_append_rel_partitions(RelOptInfo *rel)
Definition: partprune.c:650
void expand_planner_arrays(PlannerInfo *root, int add_size)
Definition: relnode.c:143
#define elog(elevel,...)
Definition: elog.h:228
int i
PartitionDesc PartitionDirectoryLookup(PartitionDirectory pdir, Relation rel)
Definition: partdesc.c:274
PartitionDirectory partition_directory
Definition: pathnodes.h:147
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39

◆ expand_single_inheritance_child()

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 
)
static

Definition at line 412 of file inherit.c.

References RangeTblEntry::alias, Alias::aliasname, PlanRowMark::allMarkTypes, PlannerInfo::append_rel_array, PlannerInfo::append_rel_list, Assert, attname, bms_copy(), Alias::colnames, copyObject, RangeTblEntry::eref, RangeTblEntry::extraUpdatedCols, RangeTblEntry::inh, RangeTblEntry::insertedCols, PlanRowMark::isParent, lappend(), list_length(), list_nth(), make_append_rel_info(), makeAlias(), makeNode, makeString(), PlanRowMark::markType, NameStr, TupleDescData::natts, NIL, AppendRelInfo::parent_colnos, parse(), PlannerInfo::parse, PlanRowMark::prti, pstrdup(), RelationData::rd_rel, RelationGetDescr, RelationGetRelid, RangeTblEntry::relid, RangeTblEntry::relkind, RangeTblEntry::requiredPerms, PlanRowMark::rowmarkId, PlannerInfo::rowMarks, Query::rtable, RTE_RELATION, RangeTblEntry::rtekind, PlanRowMark::rti, RangeTblEntry::securityQuals, select_rowmark_type(), RangeTblEntry::selectedCols, PlannerInfo::simple_rte_array, PlanRowMark::strength, strVal, RangeTblEntry::tablesample, translate_col_privs(), AppendRelInfo::translated_vars, TupleDescAttr, RangeTblEntry::updatedCols, and PlanRowMark::waitPolicy.

Referenced by expand_inherited_rtentry(), and expand_partitioned_rtentry().

417 {
418  Query *parse = root->parse;
419  Oid parentOID = RelationGetRelid(parentrel);
420  Oid childOID = RelationGetRelid(childrel);
421  RangeTblEntry *childrte;
422  Index childRTindex;
423  AppendRelInfo *appinfo;
424  TupleDesc child_tupdesc;
425  List *parent_colnames;
426  List *child_colnames;
427 
428  /*
429  * Build an RTE for the child, and attach to query's rangetable list. We
430  * copy most scalar fields of the parent's RTE, but replace relation OID,
431  * relkind, and inh for the child. Also, set requiredPerms to zero since
432  * all required permissions checks are done on the original RTE. Likewise,
433  * set the child's securityQuals to empty, because we only want to apply
434  * the parent's RLS conditions regardless of what RLS properties
435  * individual children may have. (This is an intentional choice to make
436  * inherited RLS work like regular permissions checks.) The parent
437  * securityQuals will be propagated to children along with other base
438  * restriction clauses, so we don't need to do it here. Other
439  * infrastructure of the parent RTE has to be translated to match the
440  * child table's column ordering, which we do below, so a "flat" copy is
441  * sufficient to start with.
442  */
443  childrte = makeNode(RangeTblEntry);
444  memcpy(childrte, parentrte, sizeof(RangeTblEntry));
445  Assert(parentrte->rtekind == RTE_RELATION); /* else this is dubious */
446  childrte->relid = childOID;
447  childrte->relkind = childrel->rd_rel->relkind;
448  /* A partitioned child will need to be expanded further. */
449  if (childrte->relkind == RELKIND_PARTITIONED_TABLE)
450  {
451  Assert(childOID != parentOID);
452  childrte->inh = true;
453  }
454  else
455  childrte->inh = false;
456  childrte->requiredPerms = 0;
457  childrte->securityQuals = NIL;
458 
459  /* Link not-yet-fully-filled child RTE into data structures */
460  parse->rtable = lappend(parse->rtable, childrte);
461  childRTindex = list_length(parse->rtable);
462  *childrte_p = childrte;
463  *childRTindex_p = childRTindex;
464 
465  /*
466  * Build an AppendRelInfo struct for each parent/child pair.
467  */
468  appinfo = make_append_rel_info(parentrel, childrel,
469  parentRTindex, childRTindex);
470  root->append_rel_list = lappend(root->append_rel_list, appinfo);
471 
472  /* tablesample is probably null, but copy it */
473  childrte->tablesample = copyObject(parentrte->tablesample);
474 
475  /*
476  * Construct an alias clause for the child, which we can also use as eref.
477  * This is important so that EXPLAIN will print the right column aliases
478  * for child-table columns. (Since ruleutils.c doesn't have any easy way
479  * to reassociate parent and child columns, we must get the child column
480  * aliases right to start with. Note that setting childrte->alias forces
481  * ruleutils.c to use these column names, which it otherwise would not.)
482  */
483  child_tupdesc = RelationGetDescr(childrel);
484  parent_colnames = parentrte->eref->colnames;
485  child_colnames = NIL;
486  for (int cattno = 0; cattno < child_tupdesc->natts; cattno++)
487  {
488  Form_pg_attribute att = TupleDescAttr(child_tupdesc, cattno);
489  const char *attname;
490 
491  if (att->attisdropped)
492  {
493  /* Always insert an empty string for a dropped column */
494  attname = "";
495  }
496  else if (appinfo->parent_colnos[cattno] > 0 &&
497  appinfo->parent_colnos[cattno] <= list_length(parent_colnames))
498  {
499  /* Duplicate the query-assigned name for the parent column */
500  attname = strVal(list_nth(parent_colnames,
501  appinfo->parent_colnos[cattno] - 1));
502  }
503  else
504  {
505  /* New column, just use its real name */
506  attname = NameStr(att->attname);
507  }
508  child_colnames = lappend(child_colnames, makeString(pstrdup(attname)));
509  }
510 
511  /*
512  * We just duplicate the parent's table alias name for each child. If the
513  * plan gets printed, ruleutils.c has to sort out unique table aliases to
514  * use, which it can handle.
515  */
516  childrte->alias = childrte->eref = makeAlias(parentrte->eref->aliasname,
517  child_colnames);
518 
519  /*
520  * Translate the column permissions bitmaps to the child's attnums (we
521  * have to build the translated_vars list before we can do this). But if
522  * this is the parent table, we can just duplicate the parent's bitmaps.
523  *
524  * Note: we need to do this even though the executor won't run any
525  * permissions checks on the child RTE. The insertedCols/updatedCols
526  * bitmaps may be examined for trigger-firing purposes.
527  */
528  if (childOID != parentOID)
529  {
530  childrte->selectedCols = translate_col_privs(parentrte->selectedCols,
531  appinfo->translated_vars);
532  childrte->insertedCols = translate_col_privs(parentrte->insertedCols,
533  appinfo->translated_vars);
534  childrte->updatedCols = translate_col_privs(parentrte->updatedCols,
535  appinfo->translated_vars);
537  appinfo->translated_vars);
538  }
539  else
540  {
541  childrte->selectedCols = bms_copy(parentrte->selectedCols);
542  childrte->insertedCols = bms_copy(parentrte->insertedCols);
543  childrte->updatedCols = bms_copy(parentrte->updatedCols);
544  childrte->extraUpdatedCols = bms_copy(parentrte->extraUpdatedCols);
545  }
546 
547  /*
548  * Store the RTE and appinfo in the respective PlannerInfo arrays, which
549  * the caller must already have allocated space for.
550  */
551  Assert(childRTindex < root->simple_rel_array_size);
552  Assert(root->simple_rte_array[childRTindex] == NULL);
553  root->simple_rte_array[childRTindex] = childrte;
554  Assert(root->append_rel_array[childRTindex] == NULL);
555  root->append_rel_array[childRTindex] = appinfo;
556 
557  /*
558  * Build a PlanRowMark if parent is marked FOR UPDATE/SHARE.
559  */
560  if (top_parentrc)
561  {
562  PlanRowMark *childrc = makeNode(PlanRowMark);
563 
564  childrc->rti = childRTindex;
565  childrc->prti = top_parentrc->rti;
566  childrc->rowmarkId = top_parentrc->rowmarkId;
567  /* Reselect rowmark type, because relkind might not match parent */
568  childrc->markType = select_rowmark_type(childrte,
569  top_parentrc->strength);
570  childrc->allMarkTypes = (1 << childrc->markType);
571  childrc->strength = top_parentrc->strength;
572  childrc->waitPolicy = top_parentrc->waitPolicy;
573 
574  /*
575  * We mark RowMarks for partitioned child tables as parent RowMarks so
576  * that the executor ignores them (except their existence means that
577  * the child tables will be locked using the appropriate mode).
578  */
579  childrc->isParent = (childrte->relkind == RELKIND_PARTITIONED_TABLE);
580 
581  /* Include child's rowmark type in top parent's allMarkTypes */
582  top_parentrc->allMarkTypes |= childrc->allMarkTypes;
583 
584  root->rowMarks = lappend(root->rowMarks, childrc);
585  }
586 }
static Bitmapset * translate_col_privs(const Bitmapset *parent_privs, List *translated_vars)
Definition: inherit.c:600
Value * makeString(char *str)
Definition: value.c:53
#define NIL
Definition: pg_list.h:65
List * rowMarks
Definition: pathnodes.h:290
Query * parse
Definition: pathnodes.h:177
RowMarkType markType
Definition: plannodes.h:1060
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
Alias * alias
Definition: parsenodes.h:1091
List * colnames
Definition: primnodes.h:43
#define RelationGetDescr(relation)
Definition: rel.h:448
AttrNumber * parent_colnos
Definition: pathnodes.h:2224
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
RowMarkType select_rowmark_type(RangeTblEntry *rte, LockClauseStrength strength)
Definition: planner.c:2755
List * securityQuals
Definition: parsenodes.h:1102
char * pstrdup(const char *in)
Definition: mcxt.c:1186
#define strVal(v)
Definition: value.h:54
Index prti
Definition: plannodes.h:1058
AclMode requiredPerms
Definition: parsenodes.h:1096
Form_pg_class rd_rel
Definition: rel.h:83
unsigned int Oid
Definition: postgres_ext.h:31
Index rowmarkId
Definition: plannodes.h:1059
LockWaitPolicy waitPolicy
Definition: plannodes.h:1063
List * translated_vars
Definition: pathnodes.h:2215
Alias * makeAlias(const char *aliasname, List *colnames)
Definition: makefuncs.c:385
Bitmapset * extraUpdatedCols
Definition: parsenodes.h:1101
Bitmapset * selectedCols
Definition: parsenodes.h:1098
List * rtable
Definition: parsenodes.h:137
NameData attname
Definition: pg_attribute.h:40
static void * list_nth(const List *list, int n)
Definition: pg_list.h:277
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:200
int allMarkTypes
Definition: plannodes.h:1061
List * lappend(List *list, void *datum)
Definition: list.c:322
RangeTblEntry ** simple_rte_array
Definition: pathnodes.h:209
List * append_rel_list
Definition: pathnodes.h:288
struct AppendRelInfo ** append_rel_array
Definition: pathnodes.h:217
unsigned int Index
Definition: c.h:476
Bitmapset * updatedCols
Definition: parsenodes.h:1100
#define makeNode(_type_)
Definition: nodes.h:573
#define Assert(condition)
Definition: c.h:739
char * aliasname
Definition: primnodes.h:42
LockClauseStrength strength
Definition: plannodes.h:1062
static int list_length(const List *l)
Definition: pg_list.h:169
RTEKind rtekind
Definition: parsenodes.h:974
Bitmapset * insertedCols
Definition: parsenodes.h:1099
#define NameStr(name)
Definition: c.h:616
bool isParent
Definition: plannodes.h:1064
Alias * eref
Definition: parsenodes.h:1092
#define copyObject(obj)
Definition: nodes.h:641
Definition: pg_list.h:50
struct TableSampleClause * tablesample
Definition: parsenodes.h:1004
#define RelationGetRelid(relation)
Definition: rel.h:422
AppendRelInfo * make_append_rel_info(Relation parentrel, Relation childrel, Index parentRTindex, Index childRTindex)
Definition: appendinfo.c:49
static struct subre * parse(struct vars *, int, int, struct state *, struct state *)
Definition: regcomp.c:648

◆ translate_col_privs()

static Bitmapset * translate_col_privs ( const Bitmapset parent_privs,
List translated_vars 
)
static

Definition at line 600 of file inherit.c.

References bms_add_member(), bms_is_member(), FirstLowInvalidHeapAttributeNumber, InvalidAttrNumber, lfirst_node, and Var::varattno.

Referenced by expand_single_inheritance_child().

602 {
603  Bitmapset *child_privs = NULL;
604  bool whole_row;
605  int attno;
606  ListCell *lc;
607 
608  /* System attributes have the same numbers in all tables */
609  for (attno = FirstLowInvalidHeapAttributeNumber + 1; attno < 0; attno++)
610  {
612  parent_privs))
613  child_privs = bms_add_member(child_privs,
615  }
616 
617  /* Check if parent has whole-row reference */
619  parent_privs);
620 
621  /* And now translate the regular user attributes, using the vars list */
622  attno = InvalidAttrNumber;
623  foreach(lc, translated_vars)
624  {
625  Var *var = lfirst_node(Var, lc);
626 
627  attno++;
628  if (var == NULL) /* ignore dropped columns */
629  continue;
630  if (whole_row ||
632  parent_privs))
633  child_privs = bms_add_member(child_privs,
635  }
636 
637  return child_privs;
638 }
AttrNumber varattno
Definition: primnodes.h:172
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:27
Definition: primnodes.h:167
#define lfirst_node(type, lc)
Definition: pg_list.h:193
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:736
#define InvalidAttrNumber
Definition: attnum.h:23
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:427