PostgreSQL Source Code git master
Loading...
Searching...
No Matches
appendinfo.c File Reference
#include "postgres.h"
#include "access/htup_details.h"
#include "access/table.h"
#include "foreign/fdwapi.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "optimizer/appendinfo.h"
#include "optimizer/pathnode.h"
#include "optimizer/planmain.h"
#include "parser/parsetree.h"
#include "utils/lsyscache.h"
#include "utils/rel.h"
#include "utils/syscache.h"
Include dependency graph for appendinfo.c:

Go to the source code of this file.

Data Structures

struct  adjust_appendrel_attrs_context
 

Functions

static void make_inh_translation_list (Relation oldrelation, Relation newrelation, Index newvarno, AppendRelInfo *appinfo)
 
static Nodeadjust_appendrel_attrs_mutator (Node *node, adjust_appendrel_attrs_context *context)
 
AppendRelInfomake_append_rel_info (Relation parentrel, Relation childrel, Index parentRTindex, Index childRTindex)
 
Nodeadjust_appendrel_attrs (PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
 
Nodeadjust_appendrel_attrs_multilevel (PlannerInfo *root, Node *node, RelOptInfo *childrel, RelOptInfo *parentrel)
 
Relids adjust_child_relids (Relids relids, int nappinfos, AppendRelInfo **appinfos)
 
Relids adjust_child_relids_multilevel (PlannerInfo *root, Relids relids, RelOptInfo *childrel, RelOptInfo *parentrel)
 
Listadjust_inherited_attnums (List *attnums, AppendRelInfo *context)
 
Listadjust_inherited_attnums_multilevel (PlannerInfo *root, List *attnums, Index child_relid, Index top_parent_relid)
 
void get_translated_update_targetlist (PlannerInfo *root, Index relid, List **processed_tlist, List **update_colnos)
 
AppendRelInfo ** find_appinfos_by_relids (PlannerInfo *root, Relids relids, int *nappinfos)
 
void add_row_identity_var (PlannerInfo *root, Var *orig_var, Index rtindex, const char *rowid_name)
 
void add_row_identity_columns (PlannerInfo *root, Index rtindex, RangeTblEntry *target_rte, Relation target_relation)
 
void distribute_row_identity_vars (PlannerInfo *root)
 

Function Documentation

◆ add_row_identity_columns()

void add_row_identity_columns ( PlannerInfo root,
Index  rtindex,
RangeTblEntry target_rte,
Relation  target_relation 
)

Definition at line 958 of file appendinfo.c.

961{
962 CmdType commandType = root->parse->commandType;
963 char relkind = target_relation->rd_rel->relkind;
964 Var *var;
965
966 Assert(commandType == CMD_UPDATE || commandType == CMD_DELETE || commandType == CMD_MERGE);
967
968 if (relkind == RELKIND_RELATION ||
969 relkind == RELKIND_MATVIEW ||
970 relkind == RELKIND_PARTITIONED_TABLE)
971 {
972 /*
973 * Emit CTID so that executor can find the row to merge, update or
974 * delete.
975 */
976 var = makeVar(rtindex,
978 TIDOID,
979 -1,
981 0);
982 add_row_identity_var(root, var, rtindex, "ctid");
983 }
984 else if (relkind == RELKIND_FOREIGN_TABLE)
985 {
986 /*
987 * Let the foreign table's FDW add whatever junk TLEs it wants.
988 */
989 FdwRoutine *fdwroutine;
990
991 fdwroutine = GetFdwRoutineForRelation(target_relation, false);
992
993 if (fdwroutine->AddForeignUpdateTargets != NULL)
994 fdwroutine->AddForeignUpdateTargets(root, rtindex,
995 target_rte, target_relation);
996
997 /*
998 * For UPDATE, we need to make the FDW fetch unchanged columns by
999 * asking it to fetch a whole-row Var. That's because the top-level
1000 * targetlist only contains entries for changed columns, but
1001 * ExecUpdate will need to build the complete new tuple. (Actually,
1002 * we only really need this in UPDATEs that are not pushed to the
1003 * remote side, but it's hard to tell if that will be the case at the
1004 * point when this function is called.)
1005 *
1006 * We will also need the whole row if there are any row triggers, so
1007 * that the executor will have the "old" row to pass to the trigger.
1008 * Alas, this misses system columns.
1009 */
1010 if (commandType == CMD_UPDATE ||
1011 (target_relation->trigdesc &&
1012 (target_relation->trigdesc->trig_delete_after_row ||
1013 target_relation->trigdesc->trig_delete_before_row)))
1014 {
1015 var = makeVar(rtindex,
1017 RECORDOID,
1018 -1,
1019 InvalidOid,
1020 0);
1021 add_row_identity_var(root, var, rtindex, "wholerow");
1022 }
1023 }
1024}
void add_row_identity_var(PlannerInfo *root, Var *orig_var, Index rtindex, const char *rowid_name)
Definition appendinfo.c:863
#define InvalidAttrNumber
Definition attnum.h:23
#define Assert(condition)
Definition c.h:885
FdwRoutine * GetFdwRoutineForRelation(Relation relation, bool makecopy)
Definition foreign.c:443
Var * makeVar(int varno, AttrNumber varattno, Oid vartype, int32 vartypmod, Oid varcollid, Index varlevelsup)
Definition makefuncs.c:66
CmdType
Definition nodes.h:273
@ CMD_MERGE
Definition nodes.h:279
@ CMD_DELETE
Definition nodes.h:278
@ CMD_UPDATE
Definition nodes.h:276
#define InvalidOid
tree ctl root
Definition radixtree.h:1857
AddForeignUpdateTargets_function AddForeignUpdateTargets
Definition fdwapi.h:229
TriggerDesc * trigdesc
Definition rel.h:117
Form_pg_class rd_rel
Definition rel.h:111
bool trig_delete_before_row
Definition reltrigger.h:66
bool trig_delete_after_row
Definition reltrigger.h:67
#define SelfItemPointerAttributeNumber
Definition sysattr.h:21

References add_row_identity_var(), FdwRoutine::AddForeignUpdateTargets, Assert, CMD_DELETE, CMD_MERGE, CMD_UPDATE, GetFdwRoutineForRelation(), InvalidAttrNumber, InvalidOid, makeVar(), RelationData::rd_rel, root, SelfItemPointerAttributeNumber, TriggerDesc::trig_delete_after_row, TriggerDesc::trig_delete_before_row, and RelationData::trigdesc.

Referenced by distribute_row_identity_vars(), expand_single_inheritance_child(), and preprocess_targetlist().

◆ add_row_identity_var()

void add_row_identity_var ( PlannerInfo root,
Var orig_var,
Index  rtindex,
const char *  rowid_name 
)

Definition at line 863 of file appendinfo.c.

865{
866 TargetEntry *tle;
867 Var *rowid_var;
868 RowIdentityVarInfo *ridinfo;
869 ListCell *lc;
870
871 /* For now, the argument must be just a Var of the given rtindex */
872 Assert(IsA(orig_var, Var));
873 Assert(orig_var->varno == rtindex);
874 Assert(orig_var->varlevelsup == 0);
875 Assert(orig_var->varnullingrels == NULL);
876
877 /*
878 * If we're doing non-inherited UPDATE/DELETE/MERGE, there's little need
879 * for ROWID_VAR shenanigans. Just shove the presented Var into the
880 * processed_tlist, and we're done.
881 */
882 if (rtindex == root->parse->resultRelation)
883 {
884 tle = makeTargetEntry((Expr *) orig_var,
885 list_length(root->processed_tlist) + 1,
886 pstrdup(rowid_name),
887 true);
888 root->processed_tlist = lappend(root->processed_tlist, tle);
889 return;
890 }
891
892 /*
893 * Otherwise, rtindex should reference a leaf target relation that's being
894 * added to the query during expand_inherited_rtentry().
895 */
896 Assert(bms_is_member(rtindex, root->leaf_result_relids));
897 Assert(root->append_rel_array[rtindex] != NULL);
898
899 /*
900 * We have to find a matching RowIdentityVarInfo, or make one if there is
901 * none. To allow using equal() to match the vars, change the varno to
902 * ROWID_VAR, leaving all else alone.
903 */
904 rowid_var = copyObject(orig_var);
905 /* This could eventually become ChangeVarNodes() */
906 rowid_var->varno = ROWID_VAR;
907
908 /* Look for an existing row-id column of the same name */
909 foreach(lc, root->row_identity_vars)
910 {
911 ridinfo = (RowIdentityVarInfo *) lfirst(lc);
912 if (strcmp(rowid_name, ridinfo->rowidname) != 0)
913 continue;
914 if (equal(rowid_var, ridinfo->rowidvar))
915 {
916 /* Found a match; we need only record that rtindex needs it too */
917 ridinfo->rowidrels = bms_add_member(ridinfo->rowidrels, rtindex);
918 return;
919 }
920 else
921 {
922 /* Ooops, can't handle this */
923 elog(ERROR, "conflicting uses of row-identity name \"%s\"",
924 rowid_name);
925 }
926 }
927
928 /* No request yet, so add a new RowIdentityVarInfo */
929 ridinfo = makeNode(RowIdentityVarInfo);
930 ridinfo->rowidvar = copyObject(rowid_var);
931 /* for the moment, estimate width using just the datatype info */
932 ridinfo->rowidwidth = get_typavgwidth(exprType((Node *) rowid_var),
933 exprTypmod((Node *) rowid_var));
934 ridinfo->rowidname = pstrdup(rowid_name);
935 ridinfo->rowidrels = bms_make_singleton(rtindex);
936
937 root->row_identity_vars = lappend(root->row_identity_vars, ridinfo);
938
939 /* Change rowid_var into a reference to this row_identity_vars entry */
940 rowid_var->varattno = list_length(root->row_identity_vars);
941
942 /* Push the ROWID_VAR reference variable into processed_tlist */
943 tle = makeTargetEntry((Expr *) rowid_var,
944 list_length(root->processed_tlist) + 1,
945 pstrdup(rowid_name),
946 true);
947 root->processed_tlist = lappend(root->processed_tlist, tle);
948}
Bitmapset * bms_make_singleton(int x)
Definition bitmapset.c:216
bool bms_is_member(int x, const Bitmapset *a)
Definition bitmapset.c:510
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition bitmapset.c:799
#define ERROR
Definition elog.h:39
#define elog(elevel,...)
Definition elog.h:226
bool equal(const void *a, const void *b)
Definition equalfuncs.c:223
List * lappend(List *list, void *datum)
Definition list.c:339
int32 get_typavgwidth(Oid typid, int32 typmod)
Definition lsyscache.c:2730
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition makefuncs.c:289
char * pstrdup(const char *in)
Definition mcxt.c:1781
Oid exprType(const Node *expr)
Definition nodeFuncs.c:42
int32 exprTypmod(const Node *expr)
Definition nodeFuncs.c:301
#define IsA(nodeptr, _type_)
Definition nodes.h:164
#define copyObject(obj)
Definition nodes.h:232
#define makeNode(_type_)
Definition nodes.h:161
#define lfirst(lc)
Definition pg_list.h:172
static int list_length(const List *l)
Definition pg_list.h:152
#define ROWID_VAR
Definition primnodes.h:246
Definition nodes.h:135
int varno
Definition primnodes.h:270
Index varlevelsup
Definition primnodes.h:295

References Assert, bms_add_member(), bms_is_member(), bms_make_singleton(), copyObject, elog, equal(), ERROR, exprType(), exprTypmod(), get_typavgwidth(), IsA, lappend(), lfirst, list_length(), makeNode, makeTargetEntry(), pstrdup(), root, ROWID_VAR, RowIdentityVarInfo::rowidname, RowIdentityVarInfo::rowidrels, RowIdentityVarInfo::rowidvar, RowIdentityVarInfo::rowidwidth, Var::varattno, Var::varlevelsup, and Var::varno.

Referenced by add_row_identity_columns(), expand_single_inheritance_child(), and postgresAddForeignUpdateTargets().

◆ adjust_appendrel_attrs()

Node * adjust_appendrel_attrs ( PlannerInfo root,
Node node,
int  nappinfos,
AppendRelInfo **  appinfos 
)

Definition at line 200 of file appendinfo.c.

202{
204
205 context.root = root;
206 context.nappinfos = nappinfos;
207 context.appinfos = appinfos;
208
209 /* If there's nothing to adjust, don't call this function. */
210 Assert(nappinfos >= 1 && appinfos != NULL);
211
212 /* Should never be translating a Query tree. */
213 Assert(node == NULL || !IsA(node, Query));
214
215 return adjust_appendrel_attrs_mutator(node, &context);
216}
static Node * adjust_appendrel_attrs_mutator(Node *node, adjust_appendrel_attrs_context *context)
Definition appendinfo.c:219

References adjust_appendrel_attrs_mutator(), adjust_appendrel_attrs_context::appinfos, Assert, IsA, adjust_appendrel_attrs_context::nappinfos, adjust_appendrel_attrs_context::root, and root.

Referenced by add_child_join_rel_equivalences(), add_child_rel_equivalences(), adjust_appendrel_attrs_multilevel(), apply_child_basequals(), apply_scanjoin_target_to_paths(), build_child_join_rel(), build_child_join_reltarget(), build_child_join_sjinfo(), create_partitionwise_grouping_paths(), make_partitionedrel_pruneinfo(), set_append_rel_size(), and try_partitionwise_join().

◆ adjust_appendrel_attrs_multilevel()

Node * adjust_appendrel_attrs_multilevel ( PlannerInfo root,
Node node,
RelOptInfo childrel,
RelOptInfo parentrel 
)

Definition at line 596 of file appendinfo.c.

599{
600 AppendRelInfo **appinfos;
601 int nappinfos;
602
603 /* Recurse if immediate parent is not the top parent. */
604 if (childrel->parent != parentrel)
605 {
606 if (childrel->parent)
608 childrel->parent,
609 parentrel);
610 else
611 elog(ERROR, "childrel is not a child of parentrel");
612 }
613
614 /* Now translate for this child. */
615 appinfos = find_appinfos_by_relids(root, childrel->relids, &nappinfos);
616
617 node = adjust_appendrel_attrs(root, node, nappinfos, appinfos);
618
619 pfree(appinfos);
620
621 return node;
622}
AppendRelInfo ** find_appinfos_by_relids(PlannerInfo *root, Relids relids, int *nappinfos)
Definition appendinfo.c:808
Node * adjust_appendrel_attrs(PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
Definition appendinfo.c:200
Node * adjust_appendrel_attrs_multilevel(PlannerInfo *root, Node *node, RelOptInfo *childrel, RelOptInfo *parentrel)
Definition appendinfo.c:596
void pfree(void *pointer)
Definition mcxt.c:1616
Relids relids
Definition pathnodes.h:1009

References adjust_appendrel_attrs(), adjust_appendrel_attrs_multilevel(), elog, ERROR, find_appinfos_by_relids(), pfree(), RelOptInfo::relids, and root.

Referenced by add_child_join_rel_equivalences(), add_child_rel_equivalences(), adjust_appendrel_attrs_multilevel(), create_rel_agg_info(), create_unique_paths(), generate_join_implied_equalities_broken(), get_translated_update_targetlist(), grouping_planner(), and make_partitionedrel_pruneinfo().

◆ adjust_appendrel_attrs_mutator()

static Node * adjust_appendrel_attrs_mutator ( Node node,
adjust_appendrel_attrs_context context 
)
static

Definition at line 219 of file appendinfo.c.

221{
222 AppendRelInfo **appinfos = context->appinfos;
223 int nappinfos = context->nappinfos;
224 int cnt;
225
226 if (node == NULL)
227 return NULL;
228 if (IsA(node, Var))
229 {
230 Var *var = (Var *) copyObject(node);
231 AppendRelInfo *appinfo = NULL;
232
233 if (var->varlevelsup != 0)
234 return (Node *) var; /* no changes needed */
235
236 /*
237 * You might think we need to adjust var->varnullingrels, but that
238 * shouldn't need any changes. It will contain outer-join relids,
239 * while the transformation we are making affects only baserels.
240 * Below, we just merge var->varnullingrels into the translated Var.
241 * (We must merge not just copy: the child Var could have some
242 * nullingrel bits set already, and we mustn't drop those.)
243 *
244 * If var->varnullingrels isn't empty, and the translation wouldn't be
245 * a Var, we have to fail. One could imagine wrapping the translated
246 * expression in a PlaceHolderVar, but that won't work because this is
247 * typically used after freezing placeholders. Fortunately, the case
248 * appears unreachable at the moment. We can see nonempty
249 * var->varnullingrels here, but only in cases involving partitionwise
250 * joining, and in such cases the translations will always be Vars.
251 * (Non-Var translations occur only for appendrels made by flattening
252 * UNION ALL subqueries.) Should we need to make this work in future,
253 * a possible fix is to mandate that prepjointree.c create PHVs for
254 * all non-Var outputs of such subqueries, and then we could look up
255 * the pre-existing PHV here. Or perhaps just wrap the translations
256 * that way to begin with?
257 *
258 * If var->varreturningtype is not VAR_RETURNING_DEFAULT, then that
259 * also needs to be copied to the translated Var. That too would fail
260 * if the translation wasn't a Var, but that should never happen since
261 * a non-default var->varreturningtype is only used for Vars referring
262 * to the result relation, which should never be a flattened UNION ALL
263 * subquery.
264 */
265
266 for (cnt = 0; cnt < nappinfos; cnt++)
267 {
268 if (var->varno == appinfos[cnt]->parent_relid)
269 {
270 appinfo = appinfos[cnt];
271 break;
272 }
273 }
274
275 if (appinfo)
276 {
277 var->varno = appinfo->child_relid;
278 /* it's now a generated Var, so drop any syntactic labeling */
279 var->varnosyn = 0;
280 var->varattnosyn = 0;
281 if (var->varattno > 0)
282 {
283 Node *newnode;
284
285 if (var->varattno > list_length(appinfo->translated_vars))
286 elog(ERROR, "attribute %d of relation \"%s\" does not exist",
287 var->varattno, get_rel_name(appinfo->parent_reloid));
288 newnode = copyObject(list_nth(appinfo->translated_vars,
289 var->varattno - 1));
290 if (newnode == NULL)
291 elog(ERROR, "attribute %d of relation \"%s\" does not exist",
292 var->varattno, get_rel_name(appinfo->parent_reloid));
293 if (IsA(newnode, Var))
294 {
295 Var *newvar = (Var *) newnode;
296
297 newvar->varreturningtype = var->varreturningtype;
298 newvar->varnullingrels = bms_add_members(newvar->varnullingrels,
299 var->varnullingrels);
300 }
301 else
302 {
304 elog(ERROR, "failed to apply returningtype to a non-Var");
305 if (var->varnullingrels != NULL)
306 elog(ERROR, "failed to apply nullingrels to a non-Var");
307 }
308 return newnode;
309 }
310 else if (var->varattno == 0)
311 {
312 /*
313 * Whole-row Var: if we are dealing with named rowtypes, we
314 * can use a whole-row Var for the child table plus a coercion
315 * step to convert the tuple layout to the parent's rowtype.
316 * Otherwise we have to generate a RowExpr.
317 */
318 if (OidIsValid(appinfo->child_reltype))
319 {
320 Assert(var->vartype == appinfo->parent_reltype);
321 if (appinfo->parent_reltype != appinfo->child_reltype)
322 {
324
325 r->arg = (Expr *) var;
326 r->resulttype = appinfo->parent_reltype;
327 r->convertformat = COERCE_IMPLICIT_CAST;
328 r->location = -1;
329 /* Make sure the Var node has the right type ID, too */
330 var->vartype = appinfo->child_reltype;
331 return (Node *) r;
332 }
333 }
334 else
335 {
336 /*
337 * Build a RowExpr containing the translated variables.
338 *
339 * In practice var->vartype will always be RECORDOID here,
340 * so we need to come up with some suitable column names.
341 * We use the parent RTE's column names.
342 *
343 * Note: we can't get here for inheritance cases, so there
344 * is no need to worry that translated_vars might contain
345 * some dummy NULLs.
346 */
347 RowExpr *rowexpr;
348 List *fields;
349 RangeTblEntry *rte;
350
351 rte = rt_fetch(appinfo->parent_relid,
352 context->root->parse->rtable);
353 fields = copyObject(appinfo->translated_vars);
354 rowexpr = makeNode(RowExpr);
355 rowexpr->args = fields;
356 rowexpr->row_typeid = var->vartype;
357 rowexpr->row_format = COERCE_IMPLICIT_CAST;
358 rowexpr->colnames = copyObject(rte->eref->colnames);
359 rowexpr->location = -1;
360
362 elog(ERROR, "failed to apply returningtype to a non-Var");
363 if (var->varnullingrels != NULL)
364 elog(ERROR, "failed to apply nullingrels to a non-Var");
365
366 return (Node *) rowexpr;
367 }
368 }
369 /* system attributes don't need any other translation */
370 }
371 else if (var->varno == ROWID_VAR)
372 {
373 /*
374 * If it's a ROWID_VAR placeholder, see if we've reached a leaf
375 * target rel, for which we can translate the Var to a specific
376 * instantiation. We should never be asked to translate to a set
377 * of relids containing more than one leaf target rel, so the
378 * answer will be unique. If we're still considering non-leaf
379 * inheritance levels, return the ROWID_VAR Var as-is.
380 */
381 Relids leaf_result_relids = context->root->leaf_result_relids;
382 Index leaf_relid = 0;
383
384 for (cnt = 0; cnt < nappinfos; cnt++)
385 {
386 if (bms_is_member(appinfos[cnt]->child_relid,
387 leaf_result_relids))
388 {
389 if (leaf_relid)
390 elog(ERROR, "cannot translate to multiple leaf relids");
391 leaf_relid = appinfos[cnt]->child_relid;
392 }
393 }
394
395 if (leaf_relid)
396 {
398 list_nth(context->root->row_identity_vars, var->varattno - 1);
399
400 if (bms_is_member(leaf_relid, ridinfo->rowidrels))
401 {
402 /* Substitute the Var given in the RowIdentityVarInfo */
403 var = copyObject(ridinfo->rowidvar);
404 /* ... but use the correct relid */
405 var->varno = leaf_relid;
406 /* identity vars shouldn't have nulling rels */
407 Assert(var->varnullingrels == NULL);
408 /* varnosyn in the RowIdentityVarInfo is probably wrong */
409 var->varnosyn = 0;
410 var->varattnosyn = 0;
411 }
412 else
413 {
414 /*
415 * This leaf rel can't return the desired value, so
416 * substitute a NULL of the correct type.
417 */
418 return (Node *) makeNullConst(var->vartype,
419 var->vartypmod,
420 var->varcollid);
421 }
422 }
423 }
424 return (Node *) var;
425 }
426 if (IsA(node, CurrentOfExpr))
427 {
428 CurrentOfExpr *cexpr = (CurrentOfExpr *) copyObject(node);
429
430 for (cnt = 0; cnt < nappinfos; cnt++)
431 {
432 AppendRelInfo *appinfo = appinfos[cnt];
433
434 if (cexpr->cvarno == appinfo->parent_relid)
435 {
436 cexpr->cvarno = appinfo->child_relid;
437 break;
438 }
439 }
440 return (Node *) cexpr;
441 }
442 if (IsA(node, PlaceHolderVar))
443 {
444 /* Copy the PlaceHolderVar node with correct mutation of subnodes */
445 PlaceHolderVar *phv;
446
449 context);
450 /* now fix PlaceHolderVar's relid sets */
451 if (phv->phlevelsup == 0)
452 {
453 phv->phrels = adjust_child_relids(phv->phrels,
454 nappinfos, appinfos);
455 /* as above, we needn't touch phnullingrels */
456 }
457 return (Node *) phv;
458 }
459 /* Shouldn't need to handle planner auxiliary nodes here */
460 Assert(!IsA(node, SpecialJoinInfo));
461 Assert(!IsA(node, AppendRelInfo));
462 Assert(!IsA(node, PlaceHolderInfo));
463 Assert(!IsA(node, MinMaxAggInfo));
464
465 /*
466 * We have to process RestrictInfo nodes specially. (Note: although
467 * set_append_rel_pathlist will hide RestrictInfos in the parent's
468 * baserestrictinfo list from us, it doesn't hide those in joininfo.)
469 */
470 if (IsA(node, RestrictInfo))
471 {
472 RestrictInfo *oldinfo = (RestrictInfo *) node;
474
475 /* Copy all flat-copiable fields, notably including rinfo_serial */
476 memcpy(newinfo, oldinfo, sizeof(RestrictInfo));
477
478 /* Recursively fix the clause itself */
479 newinfo->clause = (Expr *)
480 adjust_appendrel_attrs_mutator((Node *) oldinfo->clause, context);
481
482 /* and the modified version, if an OR clause */
483 newinfo->orclause = (Expr *)
484 adjust_appendrel_attrs_mutator((Node *) oldinfo->orclause, context);
485
486 /* adjust relid sets too */
487 newinfo->clause_relids = adjust_child_relids(oldinfo->clause_relids,
488 context->nappinfos,
489 context->appinfos);
491 context->nappinfos,
492 context->appinfos);
494 context->nappinfos,
495 context->appinfos);
496 newinfo->left_relids = adjust_child_relids(oldinfo->left_relids,
497 context->nappinfos,
498 context->appinfos);
499 newinfo->right_relids = adjust_child_relids(oldinfo->right_relids,
500 context->nappinfos,
501 context->appinfos);
502
503 /*
504 * Reset cached derivative fields, since these might need to have
505 * different values when considering the child relation. Note we
506 * don't reset left_ec/right_ec: each child variable is implicitly
507 * equivalent to its parent, so still a member of the same EC if any.
508 */
509 newinfo->eval_cost.startup = -1;
510 newinfo->norm_selec = -1;
511 newinfo->outer_selec = -1;
512 newinfo->left_em = NULL;
513 newinfo->right_em = NULL;
514 newinfo->scansel_cache = NIL;
515 newinfo->left_bucketsize = -1;
516 newinfo->right_bucketsize = -1;
517 newinfo->left_mcvfreq = -1;
518 newinfo->right_mcvfreq = -1;
519
520 return (Node *) newinfo;
521 }
522
523 /*
524 * We have to process RelAggInfo nodes specially.
525 */
526 if (IsA(node, RelAggInfo))
527 {
528 RelAggInfo *oldinfo = (RelAggInfo *) node;
529 RelAggInfo *newinfo = makeNode(RelAggInfo);
530
531 newinfo->target = (PathTarget *)
533 context);
534
535 newinfo->agg_input = (PathTarget *)
537 context);
538
539 newinfo->group_clauses = oldinfo->group_clauses;
540
541 newinfo->group_exprs = (List *)
543 context);
544
545 return (Node *) newinfo;
546 }
547
548 /*
549 * We have to process PathTarget nodes specially.
550 */
551 if (IsA(node, PathTarget))
552 {
553 PathTarget *oldtarget = (PathTarget *) node;
554 PathTarget *newtarget = makeNode(PathTarget);
555
556 /* Copy all flat-copiable fields */
557 memcpy(newtarget, oldtarget, sizeof(PathTarget));
558
559 newtarget->exprs = (List *)
561 context);
562
563 if (oldtarget->sortgrouprefs)
564 {
565 Size nbytes = list_length(oldtarget->exprs) * sizeof(Index);
566
567 newtarget->sortgrouprefs = (Index *) palloc(nbytes);
568 memcpy(newtarget->sortgrouprefs, oldtarget->sortgrouprefs, nbytes);
569 }
570
571 return (Node *) newtarget;
572 }
573
574 /*
575 * NOTE: we do not need to recurse into sublinks, because they should
576 * already have been converted to subplans before we see them.
577 */
578 Assert(!IsA(node, SubLink));
579 Assert(!IsA(node, Query));
580 /* We should never see these Query substructures, either. */
581 Assert(!IsA(node, RangeTblRef));
582 Assert(!IsA(node, JoinExpr));
583
585}
Relids adjust_child_relids(Relids relids, int nappinfos, AppendRelInfo **appinfos)
Definition appendinfo.c:629
Bitmapset * bms_add_members(Bitmapset *a, const Bitmapset *b)
Definition bitmapset.c:901
unsigned int Index
Definition c.h:640
#define OidIsValid(objectId)
Definition c.h:800
size_t Size
Definition c.h:631
char * get_rel_name(Oid relid)
Definition lsyscache.c:2078
Const * makeNullConst(Oid consttype, int32 consttypmod, Oid constcollid)
Definition makefuncs.c:388
void * palloc(Size size)
Definition mcxt.c:1387
#define expression_tree_mutator(n, m, c)
Definition nodeFuncs.h:155
#define rt_fetch(rangetable_index, rangetable)
Definition parsetree.h:31
#define NIL
Definition pg_list.h:68
static void * list_nth(const List *list, int n)
Definition pg_list.h:299
@ VAR_RETURNING_DEFAULT
Definition primnodes.h:257
@ COERCE_IMPLICIT_CAST
Definition primnodes.h:769
Index child_relid
Definition pathnodes.h:3287
List * translated_vars
Definition pathnodes.h:3314
Index parent_relid
Definition pathnodes.h:3286
Definition pg_list.h:54
List * exprs
Definition pathnodes.h:1864
List * row_identity_vars
Definition pathnodes.h:478
Query * parse
Definition pathnodes.h:309
Relids leaf_result_relids
Definition pathnodes.h:466
List * rtable
Definition parsenodes.h:175
List * group_exprs
Definition pathnodes.h:1287
List * group_clauses
Definition pathnodes.h:1285
struct PathTarget * agg_input
Definition pathnodes.h:1282
struct PathTarget * target
Definition pathnodes.h:1279
Relids required_relids
Definition pathnodes.h:2917
Relids outer_relids
Definition pathnodes.h:2923
Expr * clause
Definition pathnodes.h:2886
List * args
Definition primnodes.h:1449
ParseLoc location
Definition primnodes.h:1473
AttrNumber varattno
Definition primnodes.h:275
VarReturningType varreturningtype
Definition primnodes.h:298

References adjust_appendrel_attrs_mutator(), adjust_child_relids(), RelAggInfo::agg_input, adjust_appendrel_attrs_context::appinfos, ConvertRowtypeExpr::arg, RowExpr::args, Assert, bms_add_members(), bms_is_member(), AppendRelInfo::child_relid, AppendRelInfo::child_reltype, RestrictInfo::clause, COERCE_IMPLICIT_CAST, copyObject, CurrentOfExpr::cvarno, elog, ERROR, expression_tree_mutator, PathTarget::exprs, get_rel_name(), RelAggInfo::group_clauses, RelAggInfo::group_exprs, IsA, PlannerInfo::leaf_result_relids, list_length(), list_nth(), ConvertRowtypeExpr::location, RowExpr::location, makeNode, makeNullConst(), adjust_appendrel_attrs_context::nappinfos, NIL, OidIsValid, RestrictInfo::outer_relids, palloc(), AppendRelInfo::parent_relid, AppendRelInfo::parent_reloid, AppendRelInfo::parent_reltype, PlannerInfo::parse, PlaceHolderVar::phlevelsup, RestrictInfo::required_relids, ConvertRowtypeExpr::resulttype, adjust_appendrel_attrs_context::root, PlannerInfo::row_identity_vars, ROWID_VAR, RowIdentityVarInfo::rowidrels, RowIdentityVarInfo::rowidvar, rt_fetch, Query::rtable, RelAggInfo::target, AppendRelInfo::translated_vars, VAR_RETURNING_DEFAULT, Var::varattno, Var::varlevelsup, Var::varno, and Var::varreturningtype.

Referenced by adjust_appendrel_attrs(), and adjust_appendrel_attrs_mutator().

◆ adjust_child_relids()

Relids adjust_child_relids ( Relids  relids,
int  nappinfos,
AppendRelInfo **  appinfos 
)

Definition at line 629 of file appendinfo.c.

630{
631 Bitmapset *result = NULL;
632 int cnt;
633
634 for (cnt = 0; cnt < nappinfos; cnt++)
635 {
636 AppendRelInfo *appinfo = appinfos[cnt];
637
638 /* Remove parent, add child */
639 if (bms_is_member(appinfo->parent_relid, relids))
640 {
641 /* Make a copy if we are changing the set. */
642 if (!result)
643 result = bms_copy(relids);
644
645 result = bms_del_member(result, appinfo->parent_relid);
646 result = bms_add_member(result, appinfo->child_relid);
647 }
648 }
649
650 /* If we made any changes, return the modified copy. */
651 if (result)
652 return result;
653
654 /* Otherwise, return the original set without modification. */
655 return relids;
656}
Bitmapset * bms_del_member(Bitmapset *a, int x)
Definition bitmapset.c:852
Bitmapset * bms_copy(const Bitmapset *a)
Definition bitmapset.c:122

References bms_add_member(), bms_copy(), bms_del_member(), bms_is_member(), AppendRelInfo::child_relid, and AppendRelInfo::parent_relid.

Referenced by adjust_appendrel_attrs_mutator(), adjust_child_relids_multilevel(), build_child_join_rel(), build_child_join_sjinfo(), and try_partitionwise_join().

◆ adjust_child_relids_multilevel()

Relids adjust_child_relids_multilevel ( PlannerInfo root,
Relids  relids,
RelOptInfo childrel,
RelOptInfo parentrel 
)

Definition at line 663 of file appendinfo.c.

666{
667 AppendRelInfo **appinfos;
668 int nappinfos;
669
670 /*
671 * If the given relids set doesn't contain any of the parent relids, it
672 * will remain unchanged.
673 */
674 if (!bms_overlap(relids, parentrel->relids))
675 return relids;
676
677 /* Recurse if immediate parent is not the top parent. */
678 if (childrel->parent != parentrel)
679 {
680 if (childrel->parent)
681 relids = adjust_child_relids_multilevel(root, relids,
682 childrel->parent,
683 parentrel);
684 else
685 elog(ERROR, "childrel is not a child of parentrel");
686 }
687
688 /* Now translate for this child. */
689 appinfos = find_appinfos_by_relids(root, childrel->relids, &nappinfos);
690
691 relids = adjust_child_relids(relids, nappinfos, appinfos);
692
693 pfree(appinfos);
694
695 return relids;
696}
Relids adjust_child_relids_multilevel(PlannerInfo *root, Relids relids, RelOptInfo *childrel, RelOptInfo *parentrel)
Definition appendinfo.c:663
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition bitmapset.c:575

References adjust_child_relids(), adjust_child_relids_multilevel(), bms_overlap(), elog, ERROR, find_appinfos_by_relids(), pfree(), RelOptInfo::relids, and root.

Referenced by adjust_child_relids_multilevel(), and reparameterize_path_by_child().

◆ adjust_inherited_attnums()

List * adjust_inherited_attnums ( List attnums,
AppendRelInfo context 
)

Definition at line 703 of file appendinfo.c.

704{
705 List *result = NIL;
706 ListCell *lc;
707
708 /* This should only happen for an inheritance case, not UNION ALL */
710
711 /* Look up each attribute in the AppendRelInfo's translated_vars list */
712 foreach(lc, attnums)
713 {
714 AttrNumber parentattno = lfirst_int(lc);
715 Var *childvar;
716
717 /* Look up the translation of this column: it must be a Var */
718 if (parentattno <= 0 ||
719 parentattno > list_length(context->translated_vars))
720 elog(ERROR, "attribute %d of relation \"%s\" does not exist",
721 parentattno, get_rel_name(context->parent_reloid));
722 childvar = (Var *) list_nth(context->translated_vars, parentattno - 1);
723 if (childvar == NULL || !IsA(childvar, Var))
724 elog(ERROR, "attribute %d of relation \"%s\" does not exist",
725 parentattno, get_rel_name(context->parent_reloid));
726
727 result = lappend_int(result, childvar->varattno);
728 }
729 return result;
730}
int16 AttrNumber
Definition attnum.h:21
List * lappend_int(List *list, int datum)
Definition list.c:357
#define lfirst_int(lc)
Definition pg_list.h:173

References Assert, elog, ERROR, get_rel_name(), IsA, lappend_int(), lfirst_int, list_length(), list_nth(), NIL, OidIsValid, AppendRelInfo::parent_reloid, AppendRelInfo::translated_vars, and Var::varattno.

Referenced by adjust_inherited_attnums_multilevel().

◆ adjust_inherited_attnums_multilevel()

List * adjust_inherited_attnums_multilevel ( PlannerInfo root,
List attnums,
Index  child_relid,
Index  top_parent_relid 
)

Definition at line 737 of file appendinfo.c.

739{
740 AppendRelInfo *appinfo = root->append_rel_array[child_relid];
741
742 if (!appinfo)
743 elog(ERROR, "child rel %d not found in append_rel_array", child_relid);
744
745 /* Recurse if immediate parent is not the top parent. */
746 if (appinfo->parent_relid != top_parent_relid)
747 attnums = adjust_inherited_attnums_multilevel(root, attnums,
748 appinfo->parent_relid,
749 top_parent_relid);
750
751 /* Now translate for this child */
752 return adjust_inherited_attnums(attnums, appinfo);
753}
List * adjust_inherited_attnums_multilevel(PlannerInfo *root, List *attnums, Index child_relid, Index top_parent_relid)
Definition appendinfo.c:737
List * adjust_inherited_attnums(List *attnums, AppendRelInfo *context)
Definition appendinfo.c:703

References adjust_inherited_attnums(), adjust_inherited_attnums_multilevel(), elog, ERROR, AppendRelInfo::parent_relid, and root.

Referenced by adjust_inherited_attnums_multilevel(), get_translated_update_targetlist(), and grouping_planner().

◆ distribute_row_identity_vars()

void distribute_row_identity_vars ( PlannerInfo root)

Definition at line 1039 of file appendinfo.c.

1040{
1041 Query *parse = root->parse;
1042 int result_relation = parse->resultRelation;
1043 RangeTblEntry *target_rte;
1044 RelOptInfo *target_rel;
1045 ListCell *lc;
1046
1047 /*
1048 * There's nothing to do if this isn't an inherited UPDATE/DELETE/MERGE.
1049 */
1050 if (parse->commandType != CMD_UPDATE && parse->commandType != CMD_DELETE &&
1051 parse->commandType != CMD_MERGE)
1052 {
1053 Assert(root->row_identity_vars == NIL);
1054 return;
1055 }
1056 target_rte = rt_fetch(result_relation, parse->rtable);
1057 if (!target_rte->inh)
1058 {
1059 Assert(root->row_identity_vars == NIL);
1060 return;
1061 }
1062
1063 /*
1064 * Ordinarily, we expect that leaf result relation(s) will have added some
1065 * ROWID_VAR Vars to the query. However, it's possible that constraint
1066 * exclusion suppressed every leaf relation. The executor will get upset
1067 * if the plan has no row identity columns at all, even though it will
1068 * certainly process no rows. Handle this edge case by re-opening the top
1069 * result relation and adding the row identity columns it would have used,
1070 * as preprocess_targetlist() would have done if it weren't marked "inh".
1071 * Then re-run build_base_rel_tlists() to ensure that the added columns
1072 * get propagated to the relation's reltarget. (This is a bit ugly, but
1073 * it seems better to confine the ugliness and extra cycles to this
1074 * unusual corner case.)
1075 */
1076 if (root->row_identity_vars == NIL)
1077 {
1078 Relation target_relation;
1079
1080 target_relation = table_open(target_rte->relid, NoLock);
1081 add_row_identity_columns(root, result_relation,
1082 target_rte, target_relation);
1083 table_close(target_relation, NoLock);
1084 build_base_rel_tlists(root, root->processed_tlist);
1085 /* There are no ROWID_VAR Vars in this case, so we're done. */
1086 return;
1087 }
1088
1089 /*
1090 * Dig through the processed_tlist to find the ROWID_VAR reference Vars,
1091 * and forcibly copy them into the reltarget list of the topmost target
1092 * relation. That's sufficient because they'll be copied to the
1093 * individual leaf target rels (with appropriate translation) later,
1094 * during appendrel expansion --- see set_append_rel_size().
1095 */
1096 target_rel = find_base_rel(root, result_relation);
1097
1098 foreach(lc, root->processed_tlist)
1099 {
1100 TargetEntry *tle = lfirst(lc);
1101 Var *var = (Var *) tle->expr;
1102
1103 if (var && IsA(var, Var) && var->varno == ROWID_VAR)
1104 {
1105 target_rel->reltarget->exprs =
1106 lappend(target_rel->reltarget->exprs, copyObject(var));
1107 /* reltarget cost and width will be computed later */
1108 }
1109 }
1110}
void add_row_identity_columns(PlannerInfo *root, Index rtindex, RangeTblEntry *target_rte, Relation target_relation)
Definition appendinfo.c:958
void parse(int)
Definition parse.c:49
void build_base_rel_tlists(PlannerInfo *root, List *final_tlist)
Definition initsplan.c:242
#define NoLock
Definition lockdefs.h:34
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition relnode.c:533
struct PathTarget * reltarget
Definition pathnodes.h:1033
Expr * expr
Definition primnodes.h:2240
void table_close(Relation relation, LOCKMODE lockmode)
Definition table.c:126
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition table.c:40

References add_row_identity_columns(), Assert, build_base_rel_tlists(), CMD_DELETE, CMD_MERGE, CMD_UPDATE, copyObject, TargetEntry::expr, PathTarget::exprs, find_base_rel(), RangeTblEntry::inh, IsA, lappend(), lfirst, NIL, NoLock, parse(), RelOptInfo::reltarget, root, ROWID_VAR, rt_fetch, table_close(), table_open(), and Var::varno.

Referenced by query_planner().

◆ find_appinfos_by_relids()

AppendRelInfo ** find_appinfos_by_relids ( PlannerInfo root,
Relids  relids,
int *  nappinfos 
)

Definition at line 808 of file appendinfo.c.

809{
810 AppendRelInfo **appinfos;
811 int cnt = 0;
812 int i;
813
814 /* Allocate an array that's certainly big enough */
815 appinfos = palloc_array(AppendRelInfo *, bms_num_members(relids));
816
817 i = -1;
818 while ((i = bms_next_member(relids, i)) >= 0)
819 {
820 AppendRelInfo *appinfo = root->append_rel_array[i];
821
822 if (!appinfo)
823 {
824 /* Probably i is an OJ index, but let's check */
825 if (find_base_rel_ignore_join(root, i) == NULL)
826 continue;
827 /* It's a base rel, but we lack an append_rel_array entry */
828 elog(ERROR, "child rel %d not found in append_rel_array", i);
829 }
830
831 appinfos[cnt++] = appinfo;
832 }
833 *nappinfos = cnt;
834 return appinfos;
835}
int bms_next_member(const Bitmapset *a, int prevbit)
Definition bitmapset.c:1290
int bms_num_members(const Bitmapset *a)
Definition bitmapset.c:744
#define palloc_array(type, count)
Definition fe_memutils.h:76
int i
Definition isn.c:77
RelOptInfo * find_base_rel_ignore_join(PlannerInfo *root, int relid)
Definition relnode.c:573

References bms_next_member(), bms_num_members(), elog, ERROR, find_base_rel_ignore_join(), i, palloc_array, and root.

Referenced by adjust_appendrel_attrs_multilevel(), adjust_child_relids_multilevel(), apply_scanjoin_target_to_paths(), build_child_join_sjinfo(), create_partitionwise_grouping_paths(), make_partitionedrel_pruneinfo(), and try_partitionwise_join().

◆ get_translated_update_targetlist()

void get_translated_update_targetlist ( PlannerInfo root,
Index  relid,
List **  processed_tlist,
List **  update_colnos 
)

Definition at line 765 of file appendinfo.c.

767{
768 /* This is pretty meaningless for commands other than UPDATE. */
769 Assert(root->parse->commandType == CMD_UPDATE);
770 if (relid == root->parse->resultRelation)
771 {
772 /*
773 * Non-inheritance case, so it's easy. The caller might be expecting
774 * a tree it can scribble on, though, so copy.
775 */
776 *processed_tlist = copyObject(root->processed_tlist);
777 if (update_colnos)
778 *update_colnos = copyObject(root->update_colnos);
779 }
780 else
781 {
782 Assert(bms_is_member(relid, root->all_result_relids));
783 *processed_tlist = (List *)
785 (Node *) root->processed_tlist,
786 find_base_rel(root, relid),
787 find_base_rel(root, root->parse->resultRelation));
788 if (update_colnos)
789 *update_colnos =
791 relid,
792 root->parse->resultRelation);
793 }
794}

References adjust_appendrel_attrs_multilevel(), adjust_inherited_attnums_multilevel(), Assert, bms_is_member(), CMD_UPDATE, copyObject, find_base_rel(), and root.

Referenced by postgresPlanDirectModify().

◆ make_append_rel_info()

AppendRelInfo * make_append_rel_info ( Relation  parentrel,
Relation  childrel,
Index  parentRTindex,
Index  childRTindex 
)

Definition at line 51 of file appendinfo.c.

53{
55
56 appinfo->parent_relid = parentRTindex;
57 appinfo->child_relid = childRTindex;
58 appinfo->parent_reltype = parentrel->rd_rel->reltype;
59 appinfo->child_reltype = childrel->rd_rel->reltype;
60 make_inh_translation_list(parentrel, childrel, childRTindex, appinfo);
61 appinfo->parent_reloid = RelationGetRelid(parentrel);
62
63 return appinfo;
64}
static void make_inh_translation_list(Relation oldrelation, Relation newrelation, Index newvarno, AppendRelInfo *appinfo)
Definition appendinfo.c:80
#define RelationGetRelid(relation)
Definition rel.h:514

References AppendRelInfo::child_relid, AppendRelInfo::child_reltype, make_inh_translation_list(), makeNode, AppendRelInfo::parent_relid, AppendRelInfo::parent_reloid, AppendRelInfo::parent_reltype, RelationData::rd_rel, and RelationGetRelid.

Referenced by expand_single_inheritance_child().

◆ make_inh_translation_list()

static void make_inh_translation_list ( Relation  oldrelation,
Relation  newrelation,
Index  newvarno,
AppendRelInfo appinfo 
)
static

Definition at line 80 of file appendinfo.c.

83{
84 List *vars = NIL;
85 AttrNumber *pcolnos;
86 TupleDesc old_tupdesc = RelationGetDescr(oldrelation);
87 TupleDesc new_tupdesc = RelationGetDescr(newrelation);
88 Oid new_relid = RelationGetRelid(newrelation);
89 int oldnatts = old_tupdesc->natts;
90 int newnatts = new_tupdesc->natts;
91 int old_attno;
92 int new_attno = 0;
93
94 /* Initialize reverse-translation array with all entries zero */
95 appinfo->num_child_cols = newnatts;
96 appinfo->parent_colnos = pcolnos =
97 (AttrNumber *) palloc0(newnatts * sizeof(AttrNumber));
98
99 for (old_attno = 0; old_attno < oldnatts; old_attno++)
100 {
102 char *attname;
103 Oid atttypid;
104 int32 atttypmod;
105 Oid attcollation;
106
107 att = TupleDescAttr(old_tupdesc, old_attno);
108 if (att->attisdropped)
109 {
110 /* Just put NULL into this list entry */
111 vars = lappend(vars, NULL);
112 continue;
113 }
114 attname = NameStr(att->attname);
115 atttypid = att->atttypid;
116 atttypmod = att->atttypmod;
117 attcollation = att->attcollation;
118
119 /*
120 * When we are generating the "translation list" for the parent table
121 * of an inheritance set, no need to search for matches.
122 */
123 if (oldrelation == newrelation)
124 {
125 vars = lappend(vars, makeVar(newvarno,
126 (AttrNumber) (old_attno + 1),
127 atttypid,
128 atttypmod,
129 attcollation,
130 0));
131 pcolnos[old_attno] = old_attno + 1;
132 continue;
133 }
134
135 /*
136 * Otherwise we have to search for the matching column by name.
137 * There's no guarantee it'll have the same column position, because
138 * of cases like ALTER TABLE ADD COLUMN and multiple inheritance.
139 * However, in simple cases, the relative order of columns is mostly
140 * the same in both relations, so try the column of newrelation that
141 * follows immediately after the one that we just found, and if that
142 * fails, let syscache handle it.
143 */
144 if (new_attno >= newnatts ||
145 (att = TupleDescAttr(new_tupdesc, new_attno))->attisdropped ||
146 strcmp(attname, NameStr(att->attname)) != 0)
147 {
148 HeapTuple newtup;
149
150 newtup = SearchSysCacheAttName(new_relid, attname);
151 if (!HeapTupleIsValid(newtup))
152 elog(ERROR, "could not find inherited attribute \"%s\" of relation \"%s\"",
153 attname, RelationGetRelationName(newrelation));
154 new_attno = ((Form_pg_attribute) GETSTRUCT(newtup))->attnum - 1;
155 Assert(new_attno >= 0 && new_attno < newnatts);
156 ReleaseSysCache(newtup);
157
158 att = TupleDescAttr(new_tupdesc, new_attno);
159 }
160
161 /* Found it, check type and collation match */
162 if (atttypid != att->atttypid || atttypmod != att->atttypmod)
164 (errcode(ERRCODE_INVALID_COLUMN_DEFINITION),
165 errmsg("attribute \"%s\" of relation \"%s\" does not match parent's type",
166 attname, RelationGetRelationName(newrelation))));
167 if (attcollation != att->attcollation)
169 (errcode(ERRCODE_INVALID_COLUMN_DEFINITION),
170 errmsg("attribute \"%s\" of relation \"%s\" does not match parent's collation",
171 attname, RelationGetRelationName(newrelation))));
172
173 vars = lappend(vars, makeVar(newvarno,
174 (AttrNumber) (new_attno + 1),
175 atttypid,
176 atttypmod,
177 attcollation,
178 0));
179 pcolnos[new_attno] = old_attno + 1;
180 new_attno++;
181 }
182
183 appinfo->translated_vars = vars;
184}
#define NameStr(name)
Definition c.h:777
int32_t int32
Definition c.h:554
int errcode(int sqlerrcode)
Definition elog.c:874
int errmsg(const char *fmt,...)
Definition elog.c:1093
#define ereport(elevel,...)
Definition elog.h:150
#define HeapTupleIsValid(tuple)
Definition htup.h:78
static void * GETSTRUCT(const HeapTupleData *tuple)
void * palloc0(Size size)
Definition mcxt.c:1417
NameData attname
int16 attnum
FormData_pg_attribute * Form_pg_attribute
unsigned int Oid
#define RelationGetDescr(relation)
Definition rel.h:540
#define RelationGetRelationName(relation)
Definition rel.h:548
void ReleaseSysCache(HeapTuple tuple)
Definition syscache.c:264
HeapTuple SearchSysCacheAttName(Oid relid, const char *attname)
Definition syscache.c:475
static FormData_pg_attribute * TupleDescAttr(TupleDesc tupdesc, int i)
Definition tupdesc.h:160

References Assert, attname, attnum, elog, ereport, errcode(), errmsg(), ERROR, GETSTRUCT(), HeapTupleIsValid, lappend(), makeVar(), NameStr, TupleDescData::natts, NIL, AppendRelInfo::num_child_cols, palloc0(), RelationGetDescr, RelationGetRelationName, RelationGetRelid, ReleaseSysCache(), SearchSysCacheAttName(), AppendRelInfo::translated_vars, and TupleDescAttr().

Referenced by make_append_rel_info().