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

Go to the source code of this file.

Functions

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 883 of file appendinfo.c.

886 {
887  CmdType commandType = root->parse->commandType;
888  char relkind = target_relation->rd_rel->relkind;
889  Var *var;
890 
891  Assert(commandType == CMD_UPDATE || commandType == CMD_DELETE || commandType == CMD_MERGE);
892 
893  if (commandType == CMD_MERGE ||
894  relkind == RELKIND_RELATION ||
895  relkind == RELKIND_MATVIEW ||
896  relkind == RELKIND_PARTITIONED_TABLE)
897  {
898  /*
899  * Emit CTID so that executor can find the row to merge, update or
900  * delete.
901  */
902  var = makeVar(rtindex,
904  TIDOID,
905  -1,
906  InvalidOid,
907  0);
908  add_row_identity_var(root, var, rtindex, "ctid");
909  }
910  else if (relkind == RELKIND_FOREIGN_TABLE)
911  {
912  /*
913  * Let the foreign table's FDW add whatever junk TLEs it wants.
914  */
915  FdwRoutine *fdwroutine;
916 
917  fdwroutine = GetFdwRoutineForRelation(target_relation, false);
918 
919  if (fdwroutine->AddForeignUpdateTargets != NULL)
920  fdwroutine->AddForeignUpdateTargets(root, rtindex,
921  target_rte, target_relation);
922 
923  /*
924  * For UPDATE, we need to make the FDW fetch unchanged columns by
925  * asking it to fetch a whole-row Var. That's because the top-level
926  * targetlist only contains entries for changed columns, but
927  * ExecUpdate will need to build the complete new tuple. (Actually,
928  * we only really need this in UPDATEs that are not pushed to the
929  * remote side, but it's hard to tell if that will be the case at the
930  * point when this function is called.)
931  *
932  * We will also need the whole row if there are any row triggers, so
933  * that the executor will have the "old" row to pass to the trigger.
934  * Alas, this misses system columns.
935  */
936  if (commandType == CMD_UPDATE ||
937  (target_relation->trigdesc &&
938  (target_relation->trigdesc->trig_delete_after_row ||
939  target_relation->trigdesc->trig_delete_before_row)))
940  {
941  var = makeVar(rtindex,
943  RECORDOID,
944  -1,
945  InvalidOid,
946  0);
947  add_row_identity_var(root, var, rtindex, "wholerow");
948  }
949  }
950 }
void add_row_identity_var(PlannerInfo *root, Var *orig_var, Index rtindex, const char *rowid_name)
Definition: appendinfo.c:788
#define InvalidAttrNumber
Definition: attnum.h:23
FdwRoutine * GetFdwRoutineForRelation(Relation relation, bool makecopy)
Definition: foreign.c:429
Assert(fmt[strlen(fmt) - 1] !='\n')
Var * makeVar(int varno, AttrNumber varattno, Oid vartype, int32 vartypmod, Oid varcollid, Index varlevelsup)
Definition: makefuncs.c:66
CmdType
Definition: nodes.h:274
@ CMD_MERGE
Definition: nodes.h:280
@ CMD_DELETE
Definition: nodes.h:279
@ CMD_UPDATE
Definition: nodes.h:277
#define InvalidOid
Definition: postgres_ext.h:36
AddForeignUpdateTargets_function AddForeignUpdateTargets
Definition: fdwapi.h:229
Query * parse
Definition: pathnodes.h:202
CmdType commandType
Definition: parsenodes.h:128
TriggerDesc * trigdesc
Definition: rel.h:116
Form_pg_class rd_rel
Definition: rel.h:110
bool trig_delete_before_row
Definition: reltrigger.h:66
bool trig_delete_after_row
Definition: reltrigger.h:67
Definition: primnodes.h:223
#define SelfItemPointerAttributeNumber
Definition: sysattr.h:21

References add_row_identity_var(), FdwRoutine::AddForeignUpdateTargets, Assert(), CMD_DELETE, CMD_MERGE, CMD_UPDATE, Query::commandType, GetFdwRoutineForRelation(), InvalidAttrNumber, InvalidOid, makeVar(), PlannerInfo::parse, RelationData::rd_rel, 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 788 of file appendinfo.c.

790 {
791  TargetEntry *tle;
792  Var *rowid_var;
793  RowIdentityVarInfo *ridinfo;
794  ListCell *lc;
795 
796  /* For now, the argument must be just a Var of the given rtindex */
797  Assert(IsA(orig_var, Var));
798  Assert(orig_var->varno == rtindex);
799  Assert(orig_var->varlevelsup == 0);
800  Assert(orig_var->varnullingrels == NULL);
801 
802  /*
803  * If we're doing non-inherited UPDATE/DELETE/MERGE, there's little need
804  * for ROWID_VAR shenanigans. Just shove the presented Var into the
805  * processed_tlist, and we're done.
806  */
807  if (rtindex == root->parse->resultRelation)
808  {
809  tle = makeTargetEntry((Expr *) orig_var,
810  list_length(root->processed_tlist) + 1,
811  pstrdup(rowid_name),
812  true);
813  root->processed_tlist = lappend(root->processed_tlist, tle);
814  return;
815  }
816 
817  /*
818  * Otherwise, rtindex should reference a leaf target relation that's being
819  * added to the query during expand_inherited_rtentry().
820  */
821  Assert(bms_is_member(rtindex, root->leaf_result_relids));
822  Assert(root->append_rel_array[rtindex] != NULL);
823 
824  /*
825  * We have to find a matching RowIdentityVarInfo, or make one if there is
826  * none. To allow using equal() to match the vars, change the varno to
827  * ROWID_VAR, leaving all else alone.
828  */
829  rowid_var = copyObject(orig_var);
830  /* This could eventually become ChangeVarNodes() */
831  rowid_var->varno = ROWID_VAR;
832 
833  /* Look for an existing row-id column of the same name */
834  foreach(lc, root->row_identity_vars)
835  {
836  ridinfo = (RowIdentityVarInfo *) lfirst(lc);
837  if (strcmp(rowid_name, ridinfo->rowidname) != 0)
838  continue;
839  if (equal(rowid_var, ridinfo->rowidvar))
840  {
841  /* Found a match; we need only record that rtindex needs it too */
842  ridinfo->rowidrels = bms_add_member(ridinfo->rowidrels, rtindex);
843  return;
844  }
845  else
846  {
847  /* Ooops, can't handle this */
848  elog(ERROR, "conflicting uses of row-identity name \"%s\"",
849  rowid_name);
850  }
851  }
852 
853  /* No request yet, so add a new RowIdentityVarInfo */
854  ridinfo = makeNode(RowIdentityVarInfo);
855  ridinfo->rowidvar = copyObject(rowid_var);
856  /* for the moment, estimate width using just the datatype info */
857  ridinfo->rowidwidth = get_typavgwidth(exprType((Node *) rowid_var),
858  exprTypmod((Node *) rowid_var));
859  ridinfo->rowidname = pstrdup(rowid_name);
860  ridinfo->rowidrels = bms_make_singleton(rtindex);
861 
862  root->row_identity_vars = lappend(root->row_identity_vars, ridinfo);
863 
864  /* Change rowid_var into a reference to this row_identity_vars entry */
865  rowid_var->varattno = list_length(root->row_identity_vars);
866 
867  /* Push the ROWID_VAR reference variable into processed_tlist */
868  tle = makeTargetEntry((Expr *) rowid_var,
869  list_length(root->processed_tlist) + 1,
870  pstrdup(rowid_name),
871  true);
872  root->processed_tlist = lappend(root->processed_tlist, tle);
873 }
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:428
Bitmapset * bms_make_singleton(int x)
Definition: bitmapset.c:186
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:739
#define ERROR
Definition: elog.h:39
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:225
List * lappend(List *list, void *datum)
Definition: list.c:338
int32 get_typavgwidth(Oid typid, int32 typmod)
Definition: lsyscache.c:2536
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition: makefuncs.c:240
char * pstrdup(const char *in)
Definition: mcxt.c:1624
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:43
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:266
#define IsA(nodeptr, _type_)
Definition: nodes.h:179
#define copyObject(obj)
Definition: nodes.h:244
#define makeNode(_type_)
Definition: nodes.h:176
#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:214
Definition: nodes.h:129
List * processed_tlist
Definition: pathnodes.h:456
List * row_identity_vars
Definition: pathnodes.h:368
Relids leaf_result_relids
Definition: pathnodes.h:356
int varno
Definition: primnodes.h:230
Index varlevelsup
Definition: primnodes.h:255

References Assert(), bms_add_member(), bms_is_member(), bms_make_singleton(), copyObject, elog(), equal(), ERROR, exprType(), exprTypmod(), get_typavgwidth(), IsA, lappend(), PlannerInfo::leaf_result_relids, lfirst, list_length(), makeNode, makeTargetEntry(), PlannerInfo::parse, PlannerInfo::processed_tlist, pstrdup(), PlannerInfo::row_identity_vars, 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 195 of file appendinfo.c.

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

References adjust_appendrel_attrs_mutator(), adjust_appendrel_attrs_context::appinfos, Assert(), IsA, adjust_appendrel_attrs_context::nappinfos, and adjust_appendrel_attrs_context::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 520 of file appendinfo.c.

523 {
524  AppendRelInfo **appinfos;
525  int nappinfos;
526 
527  /* Recurse if immediate parent is not the top parent. */
528  if (childrel->parent != parentrel)
529  {
530  if (childrel->parent)
531  node = adjust_appendrel_attrs_multilevel(root, node,
532  childrel->parent,
533  parentrel);
534  else
535  elog(ERROR, "childrel is not a child of parentrel");
536  }
537 
538  /* Now translate for this child. */
539  appinfos = find_appinfos_by_relids(root, childrel->relids, &nappinfos);
540 
541  node = adjust_appendrel_attrs(root, node, nappinfos, appinfos);
542 
543  pfree(appinfos);
544 
545  return node;
546 }
AppendRelInfo ** find_appinfos_by_relids(PlannerInfo *root, Relids relids, int *nappinfos)
Definition: appendinfo.c:732
Node * adjust_appendrel_attrs(PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
Definition: appendinfo.c:195
Node * adjust_appendrel_attrs_multilevel(PlannerInfo *root, Node *node, RelOptInfo *childrel, RelOptInfo *parentrel)
Definition: appendinfo.c:520
void pfree(void *pointer)
Definition: mcxt.c:1436
Relids relids
Definition: pathnodes.h:866

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

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

◆ adjust_child_relids()

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

Definition at line 553 of file appendinfo.c.

554 {
555  Bitmapset *result = NULL;
556  int cnt;
557 
558  for (cnt = 0; cnt < nappinfos; cnt++)
559  {
560  AppendRelInfo *appinfo = appinfos[cnt];
561 
562  /* Remove parent, add child */
563  if (bms_is_member(appinfo->parent_relid, relids))
564  {
565  /* Make a copy if we are changing the set. */
566  if (!result)
567  result = bms_copy(relids);
568 
569  result = bms_del_member(result, appinfo->parent_relid);
570  result = bms_add_member(result, appinfo->child_relid);
571  }
572  }
573 
574  /* If we made any changes, return the modified copy. */
575  if (result)
576  return result;
577 
578  /* Otherwise, return the original set without modification. */
579  return relids;
580 }
Bitmapset * bms_del_member(Bitmapset *a, int x)
Definition: bitmapset.c:776
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
Index child_relid
Definition: pathnodes.h:2907
Index parent_relid
Definition: pathnodes.h:2906

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(), and build_child_join_sjinfo().

◆ adjust_child_relids_multilevel()

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

Definition at line 587 of file appendinfo.c.

590 {
591  AppendRelInfo **appinfos;
592  int nappinfos;
593 
594  /*
595  * If the given relids set doesn't contain any of the parent relids, it
596  * will remain unchanged.
597  */
598  if (!bms_overlap(relids, parentrel->relids))
599  return relids;
600 
601  /* Recurse if immediate parent is not the top parent. */
602  if (childrel->parent != parentrel)
603  {
604  if (childrel->parent)
605  relids = adjust_child_relids_multilevel(root, relids,
606  childrel->parent,
607  parentrel);
608  else
609  elog(ERROR, "childrel is not a child of parentrel");
610  }
611 
612  /* Now translate for this child. */
613  appinfos = find_appinfos_by_relids(root, childrel->relids, &nappinfos);
614 
615  relids = adjust_child_relids(relids, nappinfos, appinfos);
616 
617  pfree(appinfos);
618 
619  return relids;
620 }
Relids adjust_child_relids_multilevel(PlannerInfo *root, Relids relids, RelOptInfo *childrel, RelOptInfo *parentrel)
Definition: appendinfo.c:587
Relids adjust_child_relids(Relids relids, int nappinfos, AppendRelInfo **appinfos)
Definition: appendinfo.c:553
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:495

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

Referenced by reparameterize_path_by_child().

◆ adjust_inherited_attnums()

List* adjust_inherited_attnums ( List attnums,
AppendRelInfo context 
)

Definition at line 627 of file appendinfo.c.

628 {
629  List *result = NIL;
630  ListCell *lc;
631 
632  /* This should only happen for an inheritance case, not UNION ALL */
633  Assert(OidIsValid(context->parent_reloid));
634 
635  /* Look up each attribute in the AppendRelInfo's translated_vars list */
636  foreach(lc, attnums)
637  {
638  AttrNumber parentattno = lfirst_int(lc);
639  Var *childvar;
640 
641  /* Look up the translation of this column: it must be a Var */
642  if (parentattno <= 0 ||
643  parentattno > list_length(context->translated_vars))
644  elog(ERROR, "attribute %d of relation \"%s\" does not exist",
645  parentattno, get_rel_name(context->parent_reloid));
646  childvar = (Var *) list_nth(context->translated_vars, parentattno - 1);
647  if (childvar == NULL || !IsA(childvar, Var))
648  elog(ERROR, "attribute %d of relation \"%s\" does not exist",
649  parentattno, get_rel_name(context->parent_reloid));
650 
651  result = lappend_int(result, childvar->varattno);
652  }
653  return result;
654 }
int16 AttrNumber
Definition: attnum.h:21
#define OidIsValid(objectId)
Definition: c.h:759
List * lappend_int(List *list, int datum)
Definition: list.c:356
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1910
#define NIL
Definition: pg_list.h:68
#define lfirst_int(lc)
Definition: pg_list.h:173
static void * list_nth(const List *list, int n)
Definition: pg_list.h:299
List * translated_vars
Definition: pathnodes.h:2934
Definition: pg_list.h:54
AttrNumber varattno
Definition: primnodes.h:235

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 661 of file appendinfo.c.

663 {
664  AppendRelInfo *appinfo = root->append_rel_array[child_relid];
665 
666  if (!appinfo)
667  elog(ERROR, "child rel %d not found in append_rel_array", child_relid);
668 
669  /* Recurse if immediate parent is not the top parent. */
670  if (appinfo->parent_relid != top_parent_relid)
671  attnums = adjust_inherited_attnums_multilevel(root, attnums,
672  appinfo->parent_relid,
673  top_parent_relid);
674 
675  /* Now translate for this child */
676  return adjust_inherited_attnums(attnums, appinfo);
677 }
List * adjust_inherited_attnums(List *attnums, AppendRelInfo *context)
Definition: appendinfo.c:627
List * adjust_inherited_attnums_multilevel(PlannerInfo *root, List *attnums, Index child_relid, Index top_parent_relid)
Definition: appendinfo.c:661

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

Referenced by get_translated_update_targetlist(), and grouping_planner().

◆ distribute_row_identity_vars()

void distribute_row_identity_vars ( PlannerInfo root)

Definition at line 965 of file appendinfo.c.

966 {
967  Query *parse = root->parse;
968  int result_relation = parse->resultRelation;
969  RangeTblEntry *target_rte;
970  RelOptInfo *target_rel;
971  ListCell *lc;
972 
973  /*
974  * There's nothing to do if this isn't an inherited UPDATE/DELETE/MERGE.
975  */
976  if (parse->commandType != CMD_UPDATE && parse->commandType != CMD_DELETE &&
977  parse->commandType != CMD_MERGE)
978  {
979  Assert(root->row_identity_vars == NIL);
980  return;
981  }
982  target_rte = rt_fetch(result_relation, parse->rtable);
983  if (!target_rte->inh)
984  {
985  Assert(root->row_identity_vars == NIL);
986  return;
987  }
988 
989  /*
990  * Ordinarily, we expect that leaf result relation(s) will have added some
991  * ROWID_VAR Vars to the query. However, it's possible that constraint
992  * exclusion suppressed every leaf relation. The executor will get upset
993  * if the plan has no row identity columns at all, even though it will
994  * certainly process no rows. Handle this edge case by re-opening the top
995  * result relation and adding the row identity columns it would have used,
996  * as preprocess_targetlist() would have done if it weren't marked "inh".
997  * (This is a bit ugly, but it seems better to confine the ugliness and
998  * extra cycles to this unusual corner case.) We needn't worry about
999  * fixing the rel's reltarget, as that won't affect the finished plan.
1000  */
1001  if (root->row_identity_vars == NIL)
1002  {
1003  Relation target_relation;
1004 
1005  target_relation = table_open(target_rte->relid, NoLock);
1006  add_row_identity_columns(root, result_relation,
1007  target_rte, target_relation);
1008  table_close(target_relation, NoLock);
1009  return;
1010  }
1011 
1012  /*
1013  * Dig through the processed_tlist to find the ROWID_VAR reference Vars,
1014  * and forcibly copy them into the reltarget list of the topmost target
1015  * relation. That's sufficient because they'll be copied to the
1016  * individual leaf target rels (with appropriate translation) later,
1017  * during appendrel expansion --- see set_append_rel_size().
1018  */
1019  target_rel = find_base_rel(root, result_relation);
1020 
1021  foreach(lc, root->processed_tlist)
1022  {
1023  TargetEntry *tle = lfirst(lc);
1024  Var *var = (Var *) tle->expr;
1025 
1026  if (var && IsA(var, Var) && var->varno == ROWID_VAR)
1027  {
1028  target_rel->reltarget->exprs =
1029  lappend(target_rel->reltarget->exprs, copyObject(var));
1030  /* reltarget cost and width will be computed later */
1031  }
1032  }
1033 }
void add_row_identity_columns(PlannerInfo *root, Index rtindex, RangeTblEntry *target_rte, Relation target_relation)
Definition: appendinfo.c:883
if(TABLE==NULL||TABLE_index==NULL)
Definition: isn.c:77
#define NoLock
Definition: lockdefs.h:34
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
static struct subre * parse(struct vars *v, int stopper, int type, struct state *init, struct state *final)
Definition: regcomp.c:717
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:393
List * exprs
Definition: pathnodes.h:1511
struct PathTarget * reltarget
Definition: pathnodes.h:888
Expr * expr
Definition: primnodes.h:1722
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(), CMD_DELETE, CMD_MERGE, CMD_UPDATE, copyObject, TargetEntry::expr, PathTarget::exprs, find_base_rel(), if(), RangeTblEntry::inh, IsA, lappend(), lfirst, NIL, NoLock, parse(), PlannerInfo::parse, PlannerInfo::processed_tlist, RangeTblEntry::relid, RelOptInfo::reltarget, PlannerInfo::row_identity_vars, 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 732 of file appendinfo.c.

733 {
734  AppendRelInfo **appinfos;
735  int cnt = 0;
736  int i;
737 
738  /* Allocate an array that's certainly big enough */
739  appinfos = (AppendRelInfo **)
740  palloc(sizeof(AppendRelInfo *) * bms_num_members(relids));
741 
742  i = -1;
743  while ((i = bms_next_member(relids, i)) >= 0)
744  {
745  AppendRelInfo *appinfo = root->append_rel_array[i];
746 
747  if (!appinfo)
748  {
749  /* Probably i is an OJ index, but let's check */
750  if (find_base_rel_ignore_join(root, i) == NULL)
751  continue;
752  /* It's a base rel, but we lack an append_rel_array entry */
753  elog(ERROR, "child rel %d not found in append_rel_array", i);
754  }
755 
756  appinfos[cnt++] = appinfo;
757  }
758  *nappinfos = cnt;
759  return appinfos;
760 }
int bms_next_member(const Bitmapset *a, int prevbit)
Definition: bitmapset.c:1047
int bms_num_members(const Bitmapset *a)
Definition: bitmapset.c:649
int i
Definition: isn.c:73
void * palloc(Size size)
Definition: mcxt.c:1210
RelOptInfo * find_base_rel_ignore_join(PlannerInfo *root, int relid)
Definition: relnode.c:421

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

Referenced by adjust_appendrel_attrs_multilevel(), adjust_child_relids_multilevel(), apply_scanjoin_target_to_paths(), build_child_join_rel(), 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 689 of file appendinfo.c.

691 {
692  /* This is pretty meaningless for commands other than UPDATE. */
693  Assert(root->parse->commandType == CMD_UPDATE);
694  if (relid == root->parse->resultRelation)
695  {
696  /*
697  * Non-inheritance case, so it's easy. The caller might be expecting
698  * a tree it can scribble on, though, so copy.
699  */
700  *processed_tlist = copyObject(root->processed_tlist);
701  if (update_colnos)
702  *update_colnos = copyObject(root->update_colnos);
703  }
704  else
705  {
706  Assert(bms_is_member(relid, root->all_result_relids));
707  *processed_tlist = (List *)
709  (Node *) root->processed_tlist,
710  find_base_rel(root, relid),
711  find_base_rel(root, root->parse->resultRelation));
712  if (update_colnos)
713  *update_colnos =
715  relid,
716  root->parse->resultRelation);
717  }
718 }
List * update_colnos
Definition: pathnodes.h:464
Relids all_result_relids
Definition: pathnodes.h:354

References adjust_appendrel_attrs_multilevel(), adjust_inherited_attnums_multilevel(), PlannerInfo::all_result_relids, Assert(), bms_is_member(), CMD_UPDATE, Query::commandType, copyObject, find_base_rel(), PlannerInfo::parse, PlannerInfo::processed_tlist, and PlannerInfo::update_colnos.

Referenced by postgresPlanDirectModify().

◆ make_append_rel_info()

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

Definition at line 50 of file appendinfo.c.

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

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