PostgreSQL Source Code  git master
rewriteManip.c File Reference
#include "postgres.h"
#include "catalog/pg_type.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "nodes/pathnodes.h"
#include "nodes/plannodes.h"
#include "parser/parse_coerce.h"
#include "parser/parse_relation.h"
#include "parser/parsetree.h"
#include "rewrite/rewriteManip.h"
Include dependency graph for rewriteManip.c:

Go to the source code of this file.

Data Structures

struct  contain_aggs_of_level_context
 
struct  locate_agg_of_level_context
 
struct  locate_windowfunc_context
 
struct  add_nulling_relids_context
 
struct  remove_nulling_relids_context
 
struct  OffsetVarNodes_context
 
struct  ChangeVarNodes_context
 
struct  IncrementVarSublevelsUp_context
 
struct  rangeTableEntry_used_context
 
struct  map_variable_attnos_context
 
struct  ReplaceVarsFromTargetList_context
 

Functions

static bool contain_aggs_of_level_walker (Node *node, contain_aggs_of_level_context *context)
 
static bool locate_agg_of_level_walker (Node *node, locate_agg_of_level_context *context)
 
static bool contain_windowfuncs_walker (Node *node, void *context)
 
static bool locate_windowfunc_walker (Node *node, locate_windowfunc_context *context)
 
static bool checkExprHasSubLink_walker (Node *node, void *context)
 
static Relids offset_relid_set (Relids relids, int offset)
 
static Relids adjust_relid_set (Relids relids, int oldrelid, int newrelid)
 
static Nodeadd_nulling_relids_mutator (Node *node, add_nulling_relids_context *context)
 
static Noderemove_nulling_relids_mutator (Node *node, remove_nulling_relids_context *context)
 
bool contain_aggs_of_level (Node *node, int levelsup)
 
int locate_agg_of_level (Node *node, int levelsup)
 
bool contain_windowfuncs (Node *node)
 
int locate_windowfunc (Node *node)
 
bool checkExprHasSubLink (Node *node)
 
static bool contains_multiexpr_param (Node *node, void *context)
 
void CombineRangeTables (List **dst_rtable, List **dst_perminfos, List *src_rtable, List *src_perminfos)
 
static bool OffsetVarNodes_walker (Node *node, OffsetVarNodes_context *context)
 
void OffsetVarNodes (Node *node, int offset, int sublevels_up)
 
static bool ChangeVarNodes_walker (Node *node, ChangeVarNodes_context *context)
 
void ChangeVarNodes (Node *node, int rt_index, int new_index, int sublevels_up)
 
static bool IncrementVarSublevelsUp_walker (Node *node, IncrementVarSublevelsUp_context *context)
 
void IncrementVarSublevelsUp (Node *node, int delta_sublevels_up, int min_sublevels_up)
 
void IncrementVarSublevelsUp_rtable (List *rtable, int delta_sublevels_up, int min_sublevels_up)
 
static bool rangeTableEntry_used_walker (Node *node, rangeTableEntry_used_context *context)
 
bool rangeTableEntry_used (Node *node, int rt_index, int sublevels_up)
 
QuerygetInsertSelectQuery (Query *parsetree, Query ***subquery_ptr)
 
void AddQual (Query *parsetree, Node *qual)
 
void AddInvertedQual (Query *parsetree, Node *qual)
 
Nodeadd_nulling_relids (Node *node, const Bitmapset *target_relids, const Bitmapset *added_relids)
 
Noderemove_nulling_relids (Node *node, const Bitmapset *removable_relids, const Bitmapset *except_relids)
 
Nodereplace_rte_variables (Node *node, int target_varno, int sublevels_up, replace_rte_variables_callback callback, void *callback_arg, bool *outer_hasSubLinks)
 
Nodereplace_rte_variables_mutator (Node *node, replace_rte_variables_context *context)
 
static Nodemap_variable_attnos_mutator (Node *node, map_variable_attnos_context *context)
 
Nodemap_variable_attnos (Node *node, int target_varno, int sublevels_up, const AttrMap *attno_map, Oid to_rowtype, bool *found_whole_row)
 
static NodeReplaceVarsFromTargetList_callback (Var *var, replace_rte_variables_context *context)
 
NodeReplaceVarsFromTargetList (Node *node, int target_varno, int sublevels_up, RangeTblEntry *target_rte, List *targetlist, ReplaceVarsNoMatchOption nomatch_option, int nomatch_varno, bool *outer_hasSubLinks)
 

Function Documentation

◆ add_nulling_relids()

Node* add_nulling_relids ( Node node,
const Bitmapset target_relids,
const Bitmapset added_relids 
)

Definition at line 1139 of file rewriteManip.c.

1142 {
1144 
1145  context.target_relids = target_relids;
1146  context.added_relids = added_relids;
1147  context.sublevels_up = 0;
1150  &context,
1151  0);
1152 }
#define query_or_expression_tree_mutator(n, m, c, f)
Definition: nodeFuncs.h:171
static Node * add_nulling_relids_mutator(Node *node, add_nulling_relids_context *context)
const Bitmapset * target_relids
Definition: rewriteManip.c:45
const Bitmapset * added_relids
Definition: rewriteManip.c:46

References add_nulling_relids_mutator(), add_nulling_relids_context::added_relids, query_or_expression_tree_mutator, add_nulling_relids_context::sublevels_up, and add_nulling_relids_context::target_relids.

Referenced by deconstruct_distribute_oj_quals().

◆ add_nulling_relids_mutator()

static Node * add_nulling_relids_mutator ( Node node,
add_nulling_relids_context context 
)
static

Definition at line 1155 of file rewriteManip.c.

1157 {
1158  if (node == NULL)
1159  return NULL;
1160  if (IsA(node, Var))
1161  {
1162  Var *var = (Var *) node;
1163 
1164  if (var->varlevelsup == context->sublevels_up &&
1165  bms_is_member(var->varno, context->target_relids))
1166  {
1167  Relids newnullingrels = bms_union(var->varnullingrels,
1168  context->added_relids);
1169 
1170  /* Copy the Var ... */
1171  var = copyObject(var);
1172  /* ... and replace the copy's varnullingrels field */
1173  var->varnullingrels = newnullingrels;
1174  return (Node *) var;
1175  }
1176  /* Otherwise fall through to copy the Var normally */
1177  }
1178  else if (IsA(node, PlaceHolderVar))
1179  {
1180  PlaceHolderVar *phv = (PlaceHolderVar *) node;
1181 
1182  if (phv->phlevelsup == context->sublevels_up &&
1183  bms_overlap(phv->phrels, context->target_relids))
1184  {
1185  Relids newnullingrels = bms_union(phv->phnullingrels,
1186  context->added_relids);
1187 
1188  /*
1189  * We don't modify the contents of the PHV's expression, only add
1190  * to phnullingrels. This corresponds to assuming that the PHV
1191  * will be evaluated at the same level as before, then perhaps be
1192  * nulled as it bubbles up. Hence, just flat-copy the node ...
1193  */
1194  phv = makeNode(PlaceHolderVar);
1195  memcpy(phv, node, sizeof(PlaceHolderVar));
1196  /* ... and replace the copy's phnullingrels field */
1197  phv->phnullingrels = newnullingrels;
1198  return (Node *) phv;
1199  }
1200  /* Otherwise fall through to copy the PlaceHolderVar normally */
1201  }
1202  else if (IsA(node, Query))
1203  {
1204  /* Recurse into RTE or sublink subquery */
1205  Query *newnode;
1206 
1207  context->sublevels_up++;
1208  newnode = query_tree_mutator((Query *) node,
1210  (void *) context,
1211  0);
1212  context->sublevels_up--;
1213  return (Node *) newnode;
1214  }
1216  (void *) context);
1217 }
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:460
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:211
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:527
#define expression_tree_mutator(n, m, c)
Definition: nodeFuncs.h:153
#define query_tree_mutator(q, m, c, f)
Definition: nodeFuncs.h:158
#define IsA(nodeptr, _type_)
Definition: nodes.h:179
#define copyObject(obj)
Definition: nodes.h:244
#define makeNode(_type_)
Definition: nodes.h:176
Definition: nodes.h:129
Relids phnullingrels
Definition: pathnodes.h:2753
Index phlevelsup
Definition: pathnodes.h:2759
Definition: primnodes.h:234
int varno
Definition: primnodes.h:241
Index varlevelsup
Definition: primnodes.h:266

References add_nulling_relids_context::added_relids, bms_is_member(), bms_overlap(), bms_union(), copyObject, expression_tree_mutator, IsA, makeNode, PlaceHolderVar::phlevelsup, PlaceHolderVar::phnullingrels, query_tree_mutator, add_nulling_relids_context::sublevels_up, add_nulling_relids_context::target_relids, Var::varlevelsup, and Var::varno.

Referenced by add_nulling_relids().

◆ AddInvertedQual()

void AddInvertedQual ( Query parsetree,
Node qual 
)

Definition at line 1116 of file rewriteManip.c.

1117 {
1118  BooleanTest *invqual;
1119 
1120  if (qual == NULL)
1121  return;
1122 
1123  /* Need not copy input qual, because AddQual will... */
1124  invqual = makeNode(BooleanTest);
1125  invqual->arg = (Expr *) qual;
1126  invqual->booltesttype = IS_NOT_TRUE;
1127  invqual->location = -1;
1128 
1129  AddQual(parsetree, (Node *) invqual);
1130 }
@ IS_NOT_TRUE
Definition: primnodes.h:1718
void AddQual(Query *parsetree, Node *qual)
BoolTestType booltesttype
Definition: primnodes.h:1725
Expr * arg
Definition: primnodes.h:1724

References AddQual(), BooleanTest::arg, BooleanTest::booltesttype, IS_NOT_TRUE, BooleanTest::location, and makeNode.

Referenced by CopyAndAddInvertedQual().

◆ AddQual()

void AddQual ( Query parsetree,
Node qual 
)

Definition at line 1048 of file rewriteManip.c.

1049 {
1050  Node *copy;
1051 
1052  if (qual == NULL)
1053  return;
1054 
1055  if (parsetree->commandType == CMD_UTILITY)
1056  {
1057  /*
1058  * There's noplace to put the qual on a utility statement.
1059  *
1060  * If it's a NOTIFY, silently ignore the qual; this means that the
1061  * NOTIFY will execute, whether or not there are any qualifying rows.
1062  * While clearly wrong, this is much more useful than refusing to
1063  * execute the rule at all, and extra NOTIFY events are harmless for
1064  * typical uses of NOTIFY.
1065  *
1066  * If it isn't a NOTIFY, error out, since unconditional execution of
1067  * other utility stmts is unlikely to be wanted. (This case is not
1068  * currently allowed anyway, but keep the test for safety.)
1069  */
1070  if (parsetree->utilityStmt && IsA(parsetree->utilityStmt, NotifyStmt))
1071  return;
1072  else
1073  ereport(ERROR,
1074  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1075  errmsg("conditional utility statements are not implemented")));
1076  }
1077 
1078  if (parsetree->setOperations != NULL)
1079  {
1080  /*
1081  * There's noplace to put the qual on a setop statement, either. (This
1082  * could be fixed, but right now the planner simply ignores any qual
1083  * condition on a setop query.)
1084  */
1085  ereport(ERROR,
1086  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1087  errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
1088  }
1089 
1090  /* INTERSECT wants the original, but we need to copy - Jan */
1091  copy = copyObject(qual);
1092 
1093  parsetree->jointree->quals = make_and_qual(parsetree->jointree->quals,
1094  copy);
1095 
1096  /*
1097  * We had better not have stuck an aggregate into the WHERE clause.
1098  */
1099  Assert(!contain_aggs_of_level(copy, 0));
1100 
1101  /*
1102  * Make sure query is marked correctly if added qual has sublinks. Need
1103  * not search qual when query is already marked.
1104  */
1105  if (!parsetree->hasSubLinks)
1106  parsetree->hasSubLinks = checkExprHasSubLink(copy);
1107 }
int errcode(int sqlerrcode)
Definition: elog.c:858
int errmsg(const char *fmt,...)
Definition: elog.c:1069
#define ERROR
Definition: elog.h:39
#define ereport(elevel,...)
Definition: elog.h:149
Assert(fmt[strlen(fmt) - 1] !='\n')
Node * make_and_qual(Node *qual1, Node *qual2)
Definition: makefuncs.c:692
@ CMD_UTILITY
Definition: nodes.h:281
bool checkExprHasSubLink(Node *node)
Definition: rewriteManip.c:295
bool contain_aggs_of_level(Node *node, int levelsup)
Definition: rewriteManip.c:85
Node * quals
Definition: primnodes.h:2041
FromExpr * jointree
Definition: parsenodes.h:174
Node * setOperations
Definition: parsenodes.h:209
CmdType commandType
Definition: parsenodes.h:120
Node * utilityStmt
Definition: parsenodes.h:135

References Assert(), checkExprHasSubLink(), CMD_UTILITY, Query::commandType, contain_aggs_of_level(), copyObject, ereport, errcode(), errmsg(), ERROR, IsA, Query::jointree, make_and_qual(), FromExpr::quals, Query::setOperations, and Query::utilityStmt.

Referenced by AddInvertedQual(), rewriteRuleAction(), and rewriteTargetView().

◆ adjust_relid_set()

static Relids adjust_relid_set ( Relids  relids,
int  oldrelid,
int  newrelid 
)
static

Definition at line 729 of file rewriteManip.c.

730 {
731  if (!IS_SPECIAL_VARNO(oldrelid) && bms_is_member(oldrelid, relids))
732  {
733  /* Ensure we have a modifiable copy */
734  relids = bms_copy(relids);
735  /* Remove old, add new */
736  relids = bms_del_member(relids, oldrelid);
737  relids = bms_add_member(relids, newrelid);
738  }
739  return relids;
740 }
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:753
Bitmapset * bms_del_member(Bitmapset *a, int x)
Definition: bitmapset.c:793
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:80
#define IS_SPECIAL_VARNO(varno)
Definition: primnodes.h:227

References bms_add_member(), bms_copy(), bms_del_member(), bms_is_member(), and IS_SPECIAL_VARNO.

Referenced by ChangeVarNodes_walker().

◆ ChangeVarNodes()

void ChangeVarNodes ( Node node,
int  rt_index,
int  new_index,
int  sublevels_up 
)

Definition at line 670 of file rewriteManip.c.

671 {
672  ChangeVarNodes_context context;
673 
674  context.rt_index = rt_index;
675  context.new_index = new_index;
676  context.sublevels_up = sublevels_up;
677 
678  /*
679  * Must be prepared to start with a Query or a bare expression tree; if
680  * it's a Query, go straight to query_tree_walker to make sure that
681  * sublevels_up doesn't get incremented prematurely.
682  */
683  if (node && IsA(node, Query))
684  {
685  Query *qry = (Query *) node;
686 
687  /*
688  * If we are starting at a Query, and sublevels_up is zero, then we
689  * must also fix rangetable indexes in the Query itself --- namely
690  * resultRelation and rowMarks entries. sublevels_up cannot be zero
691  * when recursing into a subquery, so there's no need to have the same
692  * logic inside ChangeVarNodes_walker.
693  */
694  if (sublevels_up == 0)
695  {
696  ListCell *l;
697 
698  if (qry->resultRelation == rt_index)
699  qry->resultRelation = new_index;
700 
701  /* this is unlikely to ever be used, but ... */
702  if (qry->onConflict && qry->onConflict->exclRelIndex == rt_index)
703  qry->onConflict->exclRelIndex = new_index;
704 
705  foreach(l, qry->rowMarks)
706  {
707  RowMarkClause *rc = (RowMarkClause *) lfirst(l);
708 
709  if (rc->rti == rt_index)
710  rc->rti = new_index;
711  }
712  }
714  (void *) &context, 0);
715  }
716  else
717  ChangeVarNodes_walker(node, &context);
718 }
#define query_tree_walker(q, w, c, f)
Definition: nodeFuncs.h:156
#define lfirst(lc)
Definition: pg_list.h:172
static bool ChangeVarNodes_walker(Node *node, ChangeVarNodes_context *context)
Definition: rewriteManip.c:560
List * rowMarks
Definition: parsenodes.h:207
OnConflictExpr * onConflict
Definition: parsenodes.h:186

References ChangeVarNodes_walker(), OnConflictExpr::exclRelIndex, IsA, lfirst, ChangeVarNodes_context::new_index, Query::onConflict, query_tree_walker, Query::rowMarks, ChangeVarNodes_context::rt_index, RowMarkClause::rti, and ChangeVarNodes_context::sublevels_up.

Referenced by add_security_quals(), add_with_check_options(), ApplyRetrieveRule(), CopyAndAddInvertedQual(), get_relation_constraints(), get_relation_info(), get_relation_statistics(), rewriteRuleAction(), rewriteTargetView(), set_baserel_partition_constraint(), set_baserel_partition_key_exprs(), and TriggerEnabled().

◆ ChangeVarNodes_walker()

static bool ChangeVarNodes_walker ( Node node,
ChangeVarNodes_context context 
)
static

Definition at line 560 of file rewriteManip.c.

561 {
562  if (node == NULL)
563  return false;
564  if (IsA(node, Var))
565  {
566  Var *var = (Var *) node;
567 
568  if (var->varlevelsup == context->sublevels_up)
569  {
570  if (var->varno == context->rt_index)
571  var->varno = context->new_index;
572  var->varnullingrels = adjust_relid_set(var->varnullingrels,
573  context->rt_index,
574  context->new_index);
575  if (var->varnosyn == context->rt_index)
576  var->varnosyn = context->new_index;
577  }
578  return false;
579  }
580  if (IsA(node, CurrentOfExpr))
581  {
582  CurrentOfExpr *cexpr = (CurrentOfExpr *) node;
583 
584  if (context->sublevels_up == 0 &&
585  cexpr->cvarno == context->rt_index)
586  cexpr->cvarno = context->new_index;
587  return false;
588  }
589  if (IsA(node, RangeTblRef))
590  {
591  RangeTblRef *rtr = (RangeTblRef *) node;
592 
593  if (context->sublevels_up == 0 &&
594  rtr->rtindex == context->rt_index)
595  rtr->rtindex = context->new_index;
596  /* the subquery itself is visited separately */
597  return false;
598  }
599  if (IsA(node, JoinExpr))
600  {
601  JoinExpr *j = (JoinExpr *) node;
602 
603  if (context->sublevels_up == 0 &&
604  j->rtindex == context->rt_index)
605  j->rtindex = context->new_index;
606  /* fall through to examine children */
607  }
608  if (IsA(node, PlaceHolderVar))
609  {
610  PlaceHolderVar *phv = (PlaceHolderVar *) node;
611 
612  if (phv->phlevelsup == context->sublevels_up)
613  {
614  phv->phrels = adjust_relid_set(phv->phrels,
615  context->rt_index,
616  context->new_index);
618  context->rt_index,
619  context->new_index);
620  }
621  /* fall through to examine children */
622  }
623  if (IsA(node, PlanRowMark))
624  {
625  PlanRowMark *rowmark = (PlanRowMark *) node;
626 
627  if (context->sublevels_up == 0)
628  {
629  if (rowmark->rti == context->rt_index)
630  rowmark->rti = context->new_index;
631  if (rowmark->prti == context->rt_index)
632  rowmark->prti = context->new_index;
633  }
634  return false;
635  }
636  if (IsA(node, AppendRelInfo))
637  {
638  AppendRelInfo *appinfo = (AppendRelInfo *) node;
639 
640  if (context->sublevels_up == 0)
641  {
642  if (appinfo->parent_relid == context->rt_index)
643  appinfo->parent_relid = context->new_index;
644  if (appinfo->child_relid == context->rt_index)
645  appinfo->child_relid = context->new_index;
646  }
647  /* fall through to examine children */
648  }
649  /* Shouldn't need to handle other planner auxiliary nodes here */
650  Assert(!IsA(node, SpecialJoinInfo));
651  Assert(!IsA(node, PlaceHolderInfo));
652  Assert(!IsA(node, MinMaxAggInfo));
653 
654  if (IsA(node, Query))
655  {
656  /* Recurse into subselects */
657  bool result;
658 
659  context->sublevels_up++;
660  result = query_tree_walker((Query *) node, ChangeVarNodes_walker,
661  (void *) context, 0);
662  context->sublevels_up--;
663  return result;
664  }
666  (void *) context);
667 }
int j
Definition: isn.c:74
#define expression_tree_walker(n, w, c)
Definition: nodeFuncs.h:151
static Relids adjust_relid_set(Relids relids, int oldrelid, int newrelid)
Definition: rewriteManip.c:729
Index child_relid
Definition: pathnodes.h:2929
Index parent_relid
Definition: pathnodes.h:2928
Index prti
Definition: plannodes.h:1381

References adjust_relid_set(), Assert(), AppendRelInfo::child_relid, CurrentOfExpr::cvarno, expression_tree_walker, IsA, j, ChangeVarNodes_context::new_index, AppendRelInfo::parent_relid, PlaceHolderVar::phlevelsup, PlaceHolderVar::phnullingrels, PlanRowMark::prti, query_tree_walker, ChangeVarNodes_context::rt_index, PlanRowMark::rti, RangeTblRef::rtindex, ChangeVarNodes_context::sublevels_up, Var::varlevelsup, and Var::varno.

Referenced by ChangeVarNodes().

◆ checkExprHasSubLink()

bool checkExprHasSubLink ( Node node)

Definition at line 295 of file rewriteManip.c.

296 {
297  /*
298  * If a Query is passed, examine it --- but we should not recurse into
299  * sub-Queries that are in its rangetable or CTE list.
300  */
303  NULL,
305 }
#define query_or_expression_tree_walker(n, w, c, f)
Definition: nodeFuncs.h:169
#define QTW_IGNORE_RC_SUBQUERIES
Definition: nodeFuncs.h:24
static bool checkExprHasSubLink_walker(Node *node, void *context)
Definition: rewriteManip.c:308

References checkExprHasSubLink_walker(), QTW_IGNORE_RC_SUBQUERIES, and query_or_expression_tree_walker.

Referenced by AddQual(), flatten_join_alias_vars_mutator(), RelationBuildRowSecurity(), replace_rte_variables_mutator(), rewriteRuleAction(), and rewriteTargetView().

◆ checkExprHasSubLink_walker()

static bool checkExprHasSubLink_walker ( Node node,
void *  context 
)
static

Definition at line 308 of file rewriteManip.c.

309 {
310  if (node == NULL)
311  return false;
312  if (IsA(node, SubLink))
313  return true; /* abort the tree traversal and return true */
314  return expression_tree_walker(node, checkExprHasSubLink_walker, context);
315 }

References expression_tree_walker, and IsA.

Referenced by checkExprHasSubLink().

◆ CombineRangeTables()

void CombineRangeTables ( List **  dst_rtable,
List **  dst_perminfos,
List src_rtable,
List src_perminfos 
)

Definition at line 350 of file rewriteManip.c.

352 {
353  ListCell *l;
354  int offset = list_length(*dst_perminfos);
355 
356  if (offset > 0)
357  {
358  foreach(l, src_rtable)
359  {
361 
362  if (rte->perminfoindex > 0)
363  rte->perminfoindex += offset;
364  }
365  }
366 
367  *dst_perminfos = list_concat(*dst_perminfos, src_perminfos);
368  *dst_rtable = list_concat(*dst_rtable, src_rtable);
369 }
List * list_concat(List *list1, const List *list2)
Definition: list.c:560
#define lfirst_node(type, lc)
Definition: pg_list.h:176
static int list_length(const List *l)
Definition: pg_list.h:152
Index perminfoindex
Definition: parsenodes.h:1068

References lfirst_node, list_concat(), list_length(), and RangeTblEntry::perminfoindex.

Referenced by convert_EXISTS_sublink_to_join(), pull_up_simple_subquery(), pull_up_simple_union_all(), and rewriteRuleAction().

◆ contain_aggs_of_level()

bool contain_aggs_of_level ( Node node,
int  levelsup 
)

Definition at line 85 of file rewriteManip.c.

86 {
88 
89  context.sublevels_up = levelsup;
90 
91  /*
92  * Must be prepared to start with a Query or a bare expression tree; if
93  * it's a Query, we don't want to increment sublevels_up.
94  */
97  (void *) &context,
98  0);
99 }
static bool contain_aggs_of_level_walker(Node *node, contain_aggs_of_level_context *context)
Definition: rewriteManip.c:102

References contain_aggs_of_level_walker(), query_or_expression_tree_walker, and contain_aggs_of_level_context::sublevels_up.

Referenced by AddQual(), checkTargetlistEntrySQL92(), and convert_EXISTS_to_ANY().

◆ contain_aggs_of_level_walker()

static bool contain_aggs_of_level_walker ( Node node,
contain_aggs_of_level_context context 
)
static

Definition at line 102 of file rewriteManip.c.

104 {
105  if (node == NULL)
106  return false;
107  if (IsA(node, Aggref))
108  {
109  if (((Aggref *) node)->agglevelsup == context->sublevels_up)
110  return true; /* abort the tree traversal and return true */
111  /* else fall through to examine argument */
112  }
113  if (IsA(node, GroupingFunc))
114  {
115  if (((GroupingFunc *) node)->agglevelsup == context->sublevels_up)
116  return true;
117  /* else fall through to examine argument */
118  }
119  if (IsA(node, Query))
120  {
121  /* Recurse into subselects */
122  bool result;
123 
124  context->sublevels_up++;
125  result = query_tree_walker((Query *) node,
127  (void *) context, 0);
128  context->sublevels_up--;
129  return result;
130  }
132  (void *) context);
133 }

References expression_tree_walker, IsA, query_tree_walker, and contain_aggs_of_level_context::sublevels_up.

Referenced by contain_aggs_of_level().

◆ contain_windowfuncs()

bool contain_windowfuncs ( Node node)

Definition at line 215 of file rewriteManip.c.

216 {
217  /*
218  * Must be prepared to start with a Query or a bare expression tree; if
219  * it's a Query, we don't want to increment sublevels_up.
220  */
223  NULL,
224  0);
225 }
static bool contain_windowfuncs_walker(Node *node, void *context)
Definition: rewriteManip.c:228

References contain_windowfuncs_walker(), and query_or_expression_tree_walker.

Referenced by checkTargetlistEntrySQL92(), contain_window_function(), and transformWindowFuncCall().

◆ contain_windowfuncs_walker()

static bool contain_windowfuncs_walker ( Node node,
void *  context 
)
static

Definition at line 228 of file rewriteManip.c.

229 {
230  if (node == NULL)
231  return false;
232  if (IsA(node, WindowFunc))
233  return true; /* abort the tree traversal and return true */
234  /* Mustn't recurse into subselects */
236  (void *) context);
237 }

References expression_tree_walker, and IsA.

Referenced by contain_windowfuncs().

◆ contains_multiexpr_param()

static bool contains_multiexpr_param ( Node node,
void *  context 
)
static

Definition at line 324 of file rewriteManip.c.

325 {
326  if (node == NULL)
327  return false;
328  if (IsA(node, Param))
329  {
330  if (((Param *) node)->paramkind == PARAM_MULTIEXPR)
331  return true; /* abort the tree traversal and return true */
332  return false;
333  }
334  return expression_tree_walker(node, contains_multiexpr_param, context);
335 }
@ PARAM_MULTIEXPR
Definition: primnodes.h:356
static bool contains_multiexpr_param(Node *node, void *context)
Definition: rewriteManip.c:324

References expression_tree_walker, IsA, and PARAM_MULTIEXPR.

Referenced by ReplaceVarsFromTargetList_callback().

◆ getInsertSelectQuery()

Query* getInsertSelectQuery ( Query parsetree,
Query ***  subquery_ptr 
)

Definition at line 990 of file rewriteManip.c.

991 {
992  Query *selectquery;
993  RangeTblEntry *selectrte;
994  RangeTblRef *rtr;
995 
996  if (subquery_ptr)
997  *subquery_ptr = NULL;
998 
999  if (parsetree == NULL)
1000  return parsetree;
1001  if (parsetree->commandType != CMD_INSERT)
1002  return parsetree;
1003 
1004  /*
1005  * Currently, this is ONLY applied to rule-action queries, and so we
1006  * expect to find the OLD and NEW placeholder entries in the given query.
1007  * If they're not there, it must be an INSERT/SELECT in which they've been
1008  * pushed down to the SELECT.
1009  */
1010  if (list_length(parsetree->rtable) >= 2 &&
1011  strcmp(rt_fetch(PRS2_OLD_VARNO, parsetree->rtable)->eref->aliasname,
1012  "old") == 0 &&
1013  strcmp(rt_fetch(PRS2_NEW_VARNO, parsetree->rtable)->eref->aliasname,
1014  "new") == 0)
1015  return parsetree;
1016  Assert(parsetree->jointree && IsA(parsetree->jointree, FromExpr));
1017  if (list_length(parsetree->jointree->fromlist) != 1)
1018  elog(ERROR, "expected to find SELECT subquery");
1019  rtr = (RangeTblRef *) linitial(parsetree->jointree->fromlist);
1020  if (!IsA(rtr, RangeTblRef))
1021  elog(ERROR, "expected to find SELECT subquery");
1022  selectrte = rt_fetch(rtr->rtindex, parsetree->rtable);
1023  if (!(selectrte->rtekind == RTE_SUBQUERY &&
1024  selectrte->subquery &&
1025  IsA(selectrte->subquery, Query) &&
1026  selectrte->subquery->commandType == CMD_SELECT))
1027  elog(ERROR, "expected to find SELECT subquery");
1028  selectquery = selectrte->subquery;
1029  if (list_length(selectquery->rtable) >= 2 &&
1030  strcmp(rt_fetch(PRS2_OLD_VARNO, selectquery->rtable)->eref->aliasname,
1031  "old") == 0 &&
1032  strcmp(rt_fetch(PRS2_NEW_VARNO, selectquery->rtable)->eref->aliasname,
1033  "new") == 0)
1034  {
1035  if (subquery_ptr)
1036  *subquery_ptr = &(selectrte->subquery);
1037  return selectquery;
1038  }
1039  elog(ERROR, "could not find rule placeholders");
1040  return NULL; /* not reached */
1041 }
@ CMD_INSERT
Definition: nodes.h:278
@ CMD_SELECT
Definition: nodes.h:276
@ RTE_SUBQUERY
Definition: parsenodes.h:1007
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
#define linitial(l)
Definition: pg_list.h:178
#define PRS2_OLD_VARNO
Definition: primnodes.h:230
#define PRS2_NEW_VARNO
Definition: primnodes.h:231
List * fromlist
Definition: primnodes.h:2040
List * rtable
Definition: parsenodes.h:167
Query * subquery
Definition: parsenodes.h:1073
RTEKind rtekind
Definition: parsenodes.h:1025

References Assert(), CMD_INSERT, CMD_SELECT, Query::commandType, elog(), ERROR, FromExpr::fromlist, IsA, Query::jointree, linitial, list_length(), PRS2_NEW_VARNO, PRS2_OLD_VARNO, rt_fetch, Query::rtable, RTE_SUBQUERY, RangeTblEntry::rtekind, RangeTblRef::rtindex, and RangeTblEntry::subquery.

Referenced by DefineQueryRewrite(), InsertRule(), make_ruledef(), rewriteRuleAction(), and transformRuleStmt().

◆ IncrementVarSublevelsUp()

void IncrementVarSublevelsUp ( Node node,
int  delta_sublevels_up,
int  min_sublevels_up 
)

Definition at line 841 of file rewriteManip.c.

843 {
845 
846  context.delta_sublevels_up = delta_sublevels_up;
847  context.min_sublevels_up = min_sublevels_up;
848 
849  /*
850  * Must be prepared to start with a Query or a bare expression tree; if
851  * it's a Query, we don't want to increment sublevels_up.
852  */
855  (void *) &context,
857 }
#define QTW_EXAMINE_RTES_BEFORE
Definition: nodeFuncs.h:27
static bool IncrementVarSublevelsUp_walker(Node *node, IncrementVarSublevelsUp_context *context)
Definition: rewriteManip.c:768

References IncrementVarSublevelsUp_context::delta_sublevels_up, IncrementVarSublevelsUp_walker(), IncrementVarSublevelsUp_context::min_sublevels_up, QTW_EXAMINE_RTES_BEFORE, and query_or_expression_tree_walker.

Referenced by assign_param_for_placeholdervar(), build_minmax_path(), convert_EXISTS_sublink_to_join(), convert_EXISTS_to_ANY(), extract_lateral_references(), flatten_join_alias_vars_mutator(), inline_cte_walker(), pull_up_simple_subquery(), pullup_replace_vars_callback(), replace_outer_agg(), replace_outer_grouping(), ReplaceVarsFromTargetList_callback(), rewriteSearchAndCycle(), and substitute_actual_srf_parameters_mutator().

◆ IncrementVarSublevelsUp_rtable()

void IncrementVarSublevelsUp_rtable ( List rtable,
int  delta_sublevels_up,
int  min_sublevels_up 
)

Definition at line 864 of file rewriteManip.c.

866 {
868 
869  context.delta_sublevels_up = delta_sublevels_up;
870  context.min_sublevels_up = min_sublevels_up;
871 
872  range_table_walker(rtable,
874  (void *) &context,
876 }
#define range_table_walker(rt, w, c, f)
Definition: nodeFuncs.h:161

References IncrementVarSublevelsUp_context::delta_sublevels_up, IncrementVarSublevelsUp_walker(), IncrementVarSublevelsUp_context::min_sublevels_up, QTW_EXAMINE_RTES_BEFORE, and range_table_walker.

Referenced by pull_up_simple_union_all().

◆ IncrementVarSublevelsUp_walker()

static bool IncrementVarSublevelsUp_walker ( Node node,
IncrementVarSublevelsUp_context context 
)
static

Definition at line 768 of file rewriteManip.c.

770 {
771  if (node == NULL)
772  return false;
773  if (IsA(node, Var))
774  {
775  Var *var = (Var *) node;
776 
777  if (var->varlevelsup >= context->min_sublevels_up)
778  var->varlevelsup += context->delta_sublevels_up;
779  return false; /* done here */
780  }
781  if (IsA(node, CurrentOfExpr))
782  {
783  /* this should not happen */
784  if (context->min_sublevels_up == 0)
785  elog(ERROR, "cannot push down CurrentOfExpr");
786  return false;
787  }
788  if (IsA(node, Aggref))
789  {
790  Aggref *agg = (Aggref *) node;
791 
792  if (agg->agglevelsup >= context->min_sublevels_up)
793  agg->agglevelsup += context->delta_sublevels_up;
794  /* fall through to recurse into argument */
795  }
796  if (IsA(node, GroupingFunc))
797  {
798  GroupingFunc *grp = (GroupingFunc *) node;
799 
800  if (grp->agglevelsup >= context->min_sublevels_up)
801  grp->agglevelsup += context->delta_sublevels_up;
802  /* fall through to recurse into argument */
803  }
804  if (IsA(node, PlaceHolderVar))
805  {
806  PlaceHolderVar *phv = (PlaceHolderVar *) node;
807 
808  if (phv->phlevelsup >= context->min_sublevels_up)
809  phv->phlevelsup += context->delta_sublevels_up;
810  /* fall through to recurse into argument */
811  }
812  if (IsA(node, RangeTblEntry))
813  {
814  RangeTblEntry *rte = (RangeTblEntry *) node;
815 
816  if (rte->rtekind == RTE_CTE)
817  {
818  if (rte->ctelevelsup >= context->min_sublevels_up)
819  rte->ctelevelsup += context->delta_sublevels_up;
820  }
821  return false; /* allow range_table_walker to continue */
822  }
823  if (IsA(node, Query))
824  {
825  /* Recurse into subselects */
826  bool result;
827 
828  context->min_sublevels_up++;
829  result = query_tree_walker((Query *) node,
831  (void *) context,
833  context->min_sublevels_up--;
834  return result;
835  }
837  (void *) context);
838 }
@ RTE_CTE
Definition: parsenodes.h:1012
Index agglevelsup
Definition: primnodes.h:537
Index ctelevelsup
Definition: parsenodes.h:1157

References GroupingFunc::agglevelsup, RangeTblEntry::ctelevelsup, IncrementVarSublevelsUp_context::delta_sublevels_up, elog(), ERROR, expression_tree_walker, IsA, IncrementVarSublevelsUp_context::min_sublevels_up, PlaceHolderVar::phlevelsup, QTW_EXAMINE_RTES_BEFORE, query_tree_walker, RTE_CTE, RangeTblEntry::rtekind, and Var::varlevelsup.

Referenced by IncrementVarSublevelsUp(), and IncrementVarSublevelsUp_rtable().

◆ locate_agg_of_level()

int locate_agg_of_level ( Node node,
int  levelsup 
)

Definition at line 149 of file rewriteManip.c.

150 {
152 
153  context.agg_location = -1; /* in case we find nothing */
154  context.sublevels_up = levelsup;
155 
156  /*
157  * Must be prepared to start with a Query or a bare expression tree; if
158  * it's a Query, we don't want to increment sublevels_up.
159  */
162  (void *) &context,
163  0);
164 
165  return context.agg_location;
166 }
static bool locate_agg_of_level_walker(Node *node, locate_agg_of_level_context *context)
Definition: rewriteManip.c:169

References locate_agg_of_level_context::agg_location, locate_agg_of_level_walker(), query_or_expression_tree_walker, and locate_agg_of_level_context::sublevels_up.

Referenced by check_agg_arguments(), checkTargetlistEntrySQL92(), and parseCheckAggregates().

◆ locate_agg_of_level_walker()

static bool locate_agg_of_level_walker ( Node node,
locate_agg_of_level_context context 
)
static

Definition at line 169 of file rewriteManip.c.

171 {
172  if (node == NULL)
173  return false;
174  if (IsA(node, Aggref))
175  {
176  if (((Aggref *) node)->agglevelsup == context->sublevels_up &&
177  ((Aggref *) node)->location >= 0)
178  {
179  context->agg_location = ((Aggref *) node)->location;
180  return true; /* abort the tree traversal and return true */
181  }
182  /* else fall through to examine argument */
183  }
184  if (IsA(node, GroupingFunc))
185  {
186  if (((GroupingFunc *) node)->agglevelsup == context->sublevels_up &&
187  ((GroupingFunc *) node)->location >= 0)
188  {
189  context->agg_location = ((GroupingFunc *) node)->location;
190  return true; /* abort the tree traversal and return true */
191  }
192  }
193  if (IsA(node, Query))
194  {
195  /* Recurse into subselects */
196  bool result;
197 
198  context->sublevels_up++;
199  result = query_tree_walker((Query *) node,
201  (void *) context, 0);
202  context->sublevels_up--;
203  return result;
204  }
206  (void *) context);
207 }

References locate_agg_of_level_context::agg_location, expression_tree_walker, IsA, query_tree_walker, and locate_agg_of_level_context::sublevels_up.

Referenced by locate_agg_of_level().

◆ locate_windowfunc()

int locate_windowfunc ( Node node)

Definition at line 253 of file rewriteManip.c.

254 {
256 
257  context.win_location = -1; /* in case we find nothing */
258 
259  /*
260  * Must be prepared to start with a Query or a bare expression tree; if
261  * it's a Query, we don't want to increment sublevels_up.
262  */
265  (void *) &context,
266  0);
267 
268  return context.win_location;
269 }
static bool locate_windowfunc_walker(Node *node, locate_windowfunc_context *context)
Definition: rewriteManip.c:272

References locate_windowfunc_walker(), query_or_expression_tree_walker, and locate_windowfunc_context::win_location.

Referenced by checkTargetlistEntrySQL92(), and transformWindowFuncCall().

◆ locate_windowfunc_walker()

static bool locate_windowfunc_walker ( Node node,
locate_windowfunc_context context 
)
static

Definition at line 272 of file rewriteManip.c.

273 {
274  if (node == NULL)
275  return false;
276  if (IsA(node, WindowFunc))
277  {
278  if (((WindowFunc *) node)->location >= 0)
279  {
280  context->win_location = ((WindowFunc *) node)->location;
281  return true; /* abort the tree traversal and return true */
282  }
283  /* else fall through to examine argument */
284  }
285  /* Mustn't recurse into subselects */
287  (void *) context);
288 }

References expression_tree_walker, IsA, and locate_windowfunc_context::win_location.

Referenced by locate_windowfunc().

◆ map_variable_attnos()

Node* map_variable_attnos ( Node node,
int  target_varno,
int  sublevels_up,
const AttrMap attno_map,
Oid  to_rowtype,
bool found_whole_row 
)

Definition at line 1603 of file rewriteManip.c.

1607 {
1609 
1610  context.target_varno = target_varno;
1611  context.sublevels_up = sublevels_up;
1612  context.attno_map = attno_map;
1613  context.to_rowtype = to_rowtype;
1614  context.found_whole_row = found_whole_row;
1615 
1616  *found_whole_row = false;
1617 
1618  /*
1619  * Must be prepared to start with a Query or a bare expression tree; if
1620  * it's a Query, we don't want to increment sublevels_up.
1621  */
1624  (void *) &context,
1625  0);
1626 }
static Node * map_variable_attnos_mutator(Node *node, map_variable_attnos_context *context)

References map_variable_attnos_context::attno_map, map_variable_attnos_context::found_whole_row, map_variable_attnos_mutator(), query_or_expression_tree_mutator, map_variable_attnos_context::sublevels_up, map_variable_attnos_context::target_varno, and map_variable_attnos_context::to_rowtype.

Referenced by ATPrepAlterColumnType(), CompareIndexInfo(), DefineIndex(), ExecInitPartitionInfo(), expandTableLikeClause(), generateClonedIndexStmt(), map_partition_varattnos(), and MergeAttributes().

◆ map_variable_attnos_mutator()

static Node* map_variable_attnos_mutator ( Node node,
map_variable_attnos_context context 
)
static

Definition at line 1480 of file rewriteManip.c.

1482 {
1483  if (node == NULL)
1484  return NULL;
1485  if (IsA(node, Var))
1486  {
1487  Var *var = (Var *) node;
1488 
1489  if (var->varno == context->target_varno &&
1490  var->varlevelsup == context->sublevels_up)
1491  {
1492  /* Found a matching variable, make the substitution */
1493  Var *newvar = (Var *) palloc(sizeof(Var));
1494  int attno = var->varattno;
1495 
1496  *newvar = *var; /* initially copy all fields of the Var */
1497 
1498  if (attno > 0)
1499  {
1500  /* user-defined column, replace attno */
1501  if (attno > context->attno_map->maplen ||
1502  context->attno_map->attnums[attno - 1] == 0)
1503  elog(ERROR, "unexpected varattno %d in expression to be mapped",
1504  attno);
1505  newvar->varattno = context->attno_map->attnums[attno - 1];
1506  /* If the syntactic referent is same RTE, fix it too */
1507  if (newvar->varnosyn == context->target_varno)
1508  newvar->varattnosyn = newvar->varattno;
1509  }
1510  else if (attno == 0)
1511  {
1512  /* whole-row variable, warn caller */
1513  *(context->found_whole_row) = true;
1514 
1515  /* If the caller expects us to convert the Var, do so. */
1516  if (OidIsValid(context->to_rowtype) &&
1517  context->to_rowtype != var->vartype)
1518  {
1519  ConvertRowtypeExpr *r;
1520 
1521  /* This certainly won't work for a RECORD variable. */
1522  Assert(var->vartype != RECORDOID);
1523 
1524  /* Var itself is changed to the requested type. */
1525  newvar->vartype = context->to_rowtype;
1526 
1527  /*
1528  * Add a conversion node on top to convert back to the
1529  * original type expected by the expression.
1530  */
1532  r->arg = (Expr *) newvar;
1533  r->resulttype = var->vartype;
1534  r->convertformat = COERCE_IMPLICIT_CAST;
1535  r->location = -1;
1536 
1537  return (Node *) r;
1538  }
1539  }
1540  return (Node *) newvar;
1541  }
1542  /* otherwise fall through to copy the var normally */
1543  }
1544  else if (IsA(node, ConvertRowtypeExpr))
1545  {
1546  ConvertRowtypeExpr *r = (ConvertRowtypeExpr *) node;
1547  Var *var = (Var *) r->arg;
1548 
1549  /*
1550  * If this is coercing a whole-row Var that we need to convert, then
1551  * just convert the Var without adding an extra ConvertRowtypeExpr.
1552  * Effectively we're simplifying var::parenttype::grandparenttype into
1553  * just var::grandparenttype. This avoids building stacks of CREs if
1554  * this function is applied repeatedly.
1555  */
1556  if (IsA(var, Var) &&
1557  var->varno == context->target_varno &&
1558  var->varlevelsup == context->sublevels_up &&
1559  var->varattno == 0 &&
1560  OidIsValid(context->to_rowtype) &&
1561  context->to_rowtype != var->vartype)
1562  {
1563  ConvertRowtypeExpr *newnode;
1564  Var *newvar = (Var *) palloc(sizeof(Var));
1565 
1566  /* whole-row variable, warn caller */
1567  *(context->found_whole_row) = true;
1568 
1569  *newvar = *var; /* initially copy all fields of the Var */
1570 
1571  /* This certainly won't work for a RECORD variable. */
1572  Assert(var->vartype != RECORDOID);
1573 
1574  /* Var itself is changed to the requested type. */
1575  newvar->vartype = context->to_rowtype;
1576 
1577  newnode = (ConvertRowtypeExpr *) palloc(sizeof(ConvertRowtypeExpr));
1578  *newnode = *r; /* initially copy all fields of the CRE */
1579  newnode->arg = (Expr *) newvar;
1580 
1581  return (Node *) newnode;
1582  }
1583  /* otherwise fall through to process the expression normally */
1584  }
1585  else if (IsA(node, Query))
1586  {
1587  /* Recurse into RTE subquery or not-yet-planned sublink subquery */
1588  Query *newnode;
1589 
1590  context->sublevels_up++;
1591  newnode = query_tree_mutator((Query *) node,
1593  (void *) context,
1594  0);
1595  context->sublevels_up--;
1596  return (Node *) newnode;
1597  }
1599  (void *) context);
1600 }
#define OidIsValid(objectId)
Definition: c.h:764
if(TABLE==NULL||TABLE_index==NULL)
Definition: isn.c:77
void * palloc(Size size)
Definition: mcxt.c:1226
@ COERCE_IMPLICIT_CAST
Definition: primnodes.h:671
int maplen
Definition: attmap.h:37
AttrNumber * attnums
Definition: attmap.h:36
AttrNumber varattno
Definition: primnodes.h:246

References ConvertRowtypeExpr::arg, Assert(), map_variable_attnos_context::attno_map, AttrMap::attnums, COERCE_IMPLICIT_CAST, elog(), ERROR, expression_tree_mutator, map_variable_attnos_context::found_whole_row, if(), IsA, ConvertRowtypeExpr::location, makeNode, AttrMap::maplen, OidIsValid, palloc(), query_tree_mutator, ConvertRowtypeExpr::resulttype, map_variable_attnos_context::sublevels_up, map_variable_attnos_context::target_varno, map_variable_attnos_context::to_rowtype, Var::varattno, Var::varlevelsup, and Var::varno.

Referenced by map_variable_attnos().

◆ offset_relid_set()

static Relids offset_relid_set ( Relids  relids,
int  offset 
)
static

Definition at line 528 of file rewriteManip.c.

529 {
530  Relids result = NULL;
531  int rtindex;
532 
533  rtindex = -1;
534  while ((rtindex = bms_next_member(relids, rtindex)) >= 0)
535  result = bms_add_member(result, rtindex + offset);
536  return result;
537 }
int bms_next_member(const Bitmapset *a, int prevbit)
Definition: bitmapset.c:1106

References bms_add_member(), and bms_next_member().

Referenced by OffsetVarNodes_walker().

◆ OffsetVarNodes()

void OffsetVarNodes ( Node node,
int  offset,
int  sublevels_up 
)

Definition at line 480 of file rewriteManip.c.

481 {
482  OffsetVarNodes_context context;
483 
484  context.offset = offset;
485  context.sublevels_up = sublevels_up;
486 
487  /*
488  * Must be prepared to start with a Query or a bare expression tree; if
489  * it's a Query, go straight to query_tree_walker to make sure that
490  * sublevels_up doesn't get incremented prematurely.
491  */
492  if (node && IsA(node, Query))
493  {
494  Query *qry = (Query *) node;
495 
496  /*
497  * If we are starting at a Query, and sublevels_up is zero, then we
498  * must also fix rangetable indexes in the Query itself --- namely
499  * resultRelation, exclRelIndex and rowMarks entries. sublevels_up
500  * cannot be zero when recursing into a subquery, so there's no need
501  * to have the same logic inside OffsetVarNodes_walker.
502  */
503  if (sublevels_up == 0)
504  {
505  ListCell *l;
506 
507  if (qry->resultRelation)
508  qry->resultRelation += offset;
509 
510  if (qry->onConflict && qry->onConflict->exclRelIndex)
511  qry->onConflict->exclRelIndex += offset;
512 
513  foreach(l, qry->rowMarks)
514  {
515  RowMarkClause *rc = (RowMarkClause *) lfirst(l);
516 
517  rc->rti += offset;
518  }
519  }
521  (void *) &context, 0);
522  }
523  else
524  OffsetVarNodes_walker(node, &context);
525 }
static bool OffsetVarNodes_walker(Node *node, OffsetVarNodes_context *context)
Definition: rewriteManip.c:391

References OnConflictExpr::exclRelIndex, IsA, lfirst, OffsetVarNodes_context::offset, OffsetVarNodes_walker(), Query::onConflict, query_tree_walker, Query::rowMarks, RowMarkClause::rti, and OffsetVarNodes_context::sublevels_up.

Referenced by convert_EXISTS_sublink_to_join(), pull_up_simple_subquery(), and rewriteRuleAction().

◆ OffsetVarNodes_walker()

static bool OffsetVarNodes_walker ( Node node,
OffsetVarNodes_context context 
)
static

Definition at line 391 of file rewriteManip.c.

392 {
393  if (node == NULL)
394  return false;
395  if (IsA(node, Var))
396  {
397  Var *var = (Var *) node;
398 
399  if (var->varlevelsup == context->sublevels_up)
400  {
401  var->varno += context->offset;
402  var->varnullingrels = offset_relid_set(var->varnullingrels,
403  context->offset);
404  if (var->varnosyn > 0)
405  var->varnosyn += context->offset;
406  }
407  return false;
408  }
409  if (IsA(node, CurrentOfExpr))
410  {
411  CurrentOfExpr *cexpr = (CurrentOfExpr *) node;
412 
413  if (context->sublevels_up == 0)
414  cexpr->cvarno += context->offset;
415  return false;
416  }
417  if (IsA(node, RangeTblRef))
418  {
419  RangeTblRef *rtr = (RangeTblRef *) node;
420 
421  if (context->sublevels_up == 0)
422  rtr->rtindex += context->offset;
423  /* the subquery itself is visited separately */
424  return false;
425  }
426  if (IsA(node, JoinExpr))
427  {
428  JoinExpr *j = (JoinExpr *) node;
429 
430  if (j->rtindex && context->sublevels_up == 0)
431  j->rtindex += context->offset;
432  /* fall through to examine children */
433  }
434  if (IsA(node, PlaceHolderVar))
435  {
436  PlaceHolderVar *phv = (PlaceHolderVar *) node;
437 
438  if (phv->phlevelsup == context->sublevels_up)
439  {
440  phv->phrels = offset_relid_set(phv->phrels,
441  context->offset);
443  context->offset);
444  }
445  /* fall through to examine children */
446  }
447  if (IsA(node, AppendRelInfo))
448  {
449  AppendRelInfo *appinfo = (AppendRelInfo *) node;
450 
451  if (context->sublevels_up == 0)
452  {
453  appinfo->parent_relid += context->offset;
454  appinfo->child_relid += context->offset;
455  }
456  /* fall through to examine children */
457  }
458  /* Shouldn't need to handle other planner auxiliary nodes here */
459  Assert(!IsA(node, PlanRowMark));
460  Assert(!IsA(node, SpecialJoinInfo));
461  Assert(!IsA(node, PlaceHolderInfo));
462  Assert(!IsA(node, MinMaxAggInfo));
463 
464  if (IsA(node, Query))
465  {
466  /* Recurse into subselects */
467  bool result;
468 
469  context->sublevels_up++;
470  result = query_tree_walker((Query *) node, OffsetVarNodes_walker,
471  (void *) context, 0);
472  context->sublevels_up--;
473  return result;
474  }
476  (void *) context);
477 }
static Relids offset_relid_set(Relids relids, int offset)
Definition: rewriteManip.c:528

References Assert(), AppendRelInfo::child_relid, CurrentOfExpr::cvarno, expression_tree_walker, IsA, j, OffsetVarNodes_context::offset, offset_relid_set(), AppendRelInfo::parent_relid, PlaceHolderVar::phlevelsup, PlaceHolderVar::phnullingrels, query_tree_walker, RangeTblRef::rtindex, OffsetVarNodes_context::sublevels_up, Var::varlevelsup, and Var::varno.

Referenced by OffsetVarNodes().

◆ rangeTableEntry_used()

bool rangeTableEntry_used ( Node node,
int  rt_index,
int  sublevels_up 
)

Definition at line 958 of file rewriteManip.c.

959 {
961 
962  context.rt_index = rt_index;
963  context.sublevels_up = sublevels_up;
964 
965  /*
966  * Must be prepared to start with a Query or a bare expression tree; if
967  * it's a Query, we don't want to increment sublevels_up.
968  */
971  (void *) &context,
972  0);
973 }
static bool rangeTableEntry_used_walker(Node *node, rangeTableEntry_used_context *context)
Definition: rewriteManip.c:891

References query_or_expression_tree_walker, rangeTableEntry_used_walker(), rangeTableEntry_used_context::rt_index, and rangeTableEntry_used_context::sublevels_up.

Referenced by fireRIRrules(), matchLocks(), rewriteRuleAction(), and transformRuleStmt().

◆ rangeTableEntry_used_walker()

static bool rangeTableEntry_used_walker ( Node node,
rangeTableEntry_used_context context 
)
static

Definition at line 891 of file rewriteManip.c.

893 {
894  if (node == NULL)
895  return false;
896  if (IsA(node, Var))
897  {
898  Var *var = (Var *) node;
899 
900  if (var->varlevelsup == context->sublevels_up &&
901  (var->varno == context->rt_index ||
902  bms_is_member(context->rt_index, var->varnullingrels)))
903  return true;
904  return false;
905  }
906  if (IsA(node, CurrentOfExpr))
907  {
908  CurrentOfExpr *cexpr = (CurrentOfExpr *) node;
909 
910  if (context->sublevels_up == 0 &&
911  cexpr->cvarno == context->rt_index)
912  return true;
913  return false;
914  }
915  if (IsA(node, RangeTblRef))
916  {
917  RangeTblRef *rtr = (RangeTblRef *) node;
918 
919  if (rtr->rtindex == context->rt_index &&
920  context->sublevels_up == 0)
921  return true;
922  /* the subquery itself is visited separately */
923  return false;
924  }
925  if (IsA(node, JoinExpr))
926  {
927  JoinExpr *j = (JoinExpr *) node;
928 
929  if (j->rtindex == context->rt_index &&
930  context->sublevels_up == 0)
931  return true;
932  /* fall through to examine children */
933  }
934  /* Shouldn't need to handle planner auxiliary nodes here */
935  Assert(!IsA(node, PlaceHolderVar));
936  Assert(!IsA(node, PlanRowMark));
937  Assert(!IsA(node, SpecialJoinInfo));
938  Assert(!IsA(node, AppendRelInfo));
939  Assert(!IsA(node, PlaceHolderInfo));
940  Assert(!IsA(node, MinMaxAggInfo));
941 
942  if (IsA(node, Query))
943  {
944  /* Recurse into subselects */
945  bool result;
946 
947  context->sublevels_up++;
949  (void *) context, 0);
950  context->sublevels_up--;
951  return result;
952  }
954  (void *) context);
955 }

References Assert(), bms_is_member(), CurrentOfExpr::cvarno, expression_tree_walker, IsA, j, query_tree_walker, rangeTableEntry_used_context::rt_index, RangeTblRef::rtindex, rangeTableEntry_used_context::sublevels_up, Var::varlevelsup, and Var::varno.

Referenced by rangeTableEntry_used().

◆ remove_nulling_relids()

Node* remove_nulling_relids ( Node node,
const Bitmapset removable_relids,
const Bitmapset except_relids 
)

Definition at line 1226 of file rewriteManip.c.

1229 {
1231 
1232  context.removable_relids = removable_relids;
1233  context.except_relids = except_relids;
1234  context.sublevels_up = 0;
1237  &context,
1238  0);
1239 }
static Node * remove_nulling_relids_mutator(Node *node, remove_nulling_relids_context *context)
const Bitmapset * removable_relids
Definition: rewriteManip.c:52
const Bitmapset * except_relids
Definition: rewriteManip.c:53

References remove_nulling_relids_context::except_relids, query_or_expression_tree_mutator, remove_nulling_relids_context::removable_relids, remove_nulling_relids_mutator(), and remove_nulling_relids_context::sublevels_up.

Referenced by deconstruct_distribute_oj_quals(), have_partkey_equi_join(), reconsider_full_join_clause(), reduce_outer_joins(), and remove_useless_result_rtes().

◆ remove_nulling_relids_mutator()

static Node * remove_nulling_relids_mutator ( Node node,
remove_nulling_relids_context context 
)
static

Definition at line 1242 of file rewriteManip.c.

1244 {
1245  if (node == NULL)
1246  return NULL;
1247  if (IsA(node, Var))
1248  {
1249  Var *var = (Var *) node;
1250 
1251  if (var->varlevelsup == context->sublevels_up &&
1252  !bms_is_member(var->varno, context->except_relids) &&
1253  bms_overlap(var->varnullingrels, context->removable_relids))
1254  {
1255  /* Copy the Var ... */
1256  var = copyObject(var);
1257  /* ... and replace the copy's varnullingrels field */
1258  var->varnullingrels = bms_difference(var->varnullingrels,
1259  context->removable_relids);
1260  return (Node *) var;
1261  }
1262  /* Otherwise fall through to copy the Var normally */
1263  }
1264  else if (IsA(node, PlaceHolderVar))
1265  {
1266  PlaceHolderVar *phv = (PlaceHolderVar *) node;
1267 
1268  if (phv->phlevelsup == context->sublevels_up &&
1269  !bms_overlap(phv->phrels, context->except_relids))
1270  {
1271  /*
1272  * Note: it might seem desirable to remove the PHV altogether if
1273  * phnullingrels goes to empty. Currently we dare not do that
1274  * because we use PHVs in some cases to enforce separate identity
1275  * of subexpressions; see wrap_non_vars usages in prepjointree.c.
1276  */
1277  /* Copy the PlaceHolderVar and mutate what's below ... */
1278  phv = (PlaceHolderVar *)
1281  (void *) context);
1282  /* ... and replace the copy's phnullingrels field */
1284  context->removable_relids);
1285  /* We must also update phrels, if it contains a removable RTI */
1286  phv->phrels = bms_difference(phv->phrels,
1287  context->removable_relids);
1288  Assert(!bms_is_empty(phv->phrels));
1289  return (Node *) phv;
1290  }
1291  /* Otherwise fall through to copy the PlaceHolderVar normally */
1292  }
1293  else if (IsA(node, Query))
1294  {
1295  /* Recurse into RTE or sublink subquery */
1296  Query *newnode;
1297 
1298  context->sublevels_up++;
1299  newnode = query_tree_mutator((Query *) node,
1301  (void *) context,
1302  0);
1303  context->sublevels_up--;
1304  return (Node *) newnode;
1305  }
1307  (void *) context);
1308 }
Bitmapset * bms_difference(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:297
#define bms_is_empty(a)
Definition: bitmapset.h:105

References Assert(), bms_difference(), bms_is_empty, bms_is_member(), bms_overlap(), copyObject, remove_nulling_relids_context::except_relids, expression_tree_mutator, IsA, PlaceHolderVar::phlevelsup, PlaceHolderVar::phnullingrels, query_tree_mutator, remove_nulling_relids_context::removable_relids, remove_nulling_relids_context::sublevels_up, Var::varlevelsup, and Var::varno.

Referenced by remove_nulling_relids().

◆ replace_rte_variables()

Node* replace_rte_variables ( Node node,
int  target_varno,
int  sublevels_up,
replace_rte_variables_callback  callback,
void *  callback_arg,
bool outer_hasSubLinks 
)

Definition at line 1334 of file rewriteManip.c.

1338 {
1339  Node *result;
1341 
1342  context.callback = callback;
1343  context.callback_arg = callback_arg;
1344  context.target_varno = target_varno;
1345  context.sublevels_up = sublevels_up;
1346 
1347  /*
1348  * We try to initialize inserted_sublink to true if there is no need to
1349  * detect new sublinks because the query already has some.
1350  */
1351  if (node && IsA(node, Query))
1352  context.inserted_sublink = ((Query *) node)->hasSubLinks;
1353  else if (outer_hasSubLinks)
1354  context.inserted_sublink = *outer_hasSubLinks;
1355  else
1356  context.inserted_sublink = false;
1357 
1358  /*
1359  * Must be prepared to start with a Query or a bare expression tree; if
1360  * it's a Query, we don't want to increment sublevels_up.
1361  */
1362  result = query_or_expression_tree_mutator(node,
1364  (void *) &context,
1365  0);
1366 
1367  if (context.inserted_sublink)
1368  {
1369  if (result && IsA(result, Query))
1370  ((Query *) result)->hasSubLinks = true;
1371  else if (outer_hasSubLinks)
1372  *outer_hasSubLinks = true;
1373  else
1374  elog(ERROR, "replace_rte_variables inserted a SubLink, but has noplace to record it");
1375  }
1376 
1377  return result;
1378 }
Node * replace_rte_variables_mutator(Node *node, replace_rte_variables_context *context)
replace_rte_variables_callback callback
Definition: rewriteManip.h:29
static void callback(struct sockaddr *addr, struct sockaddr *mask, void *unused)
Definition: test_ifaddrs.c:46

References replace_rte_variables_context::callback, callback(), replace_rte_variables_context::callback_arg, elog(), ERROR, replace_rte_variables_context::inserted_sublink, IsA, query_or_expression_tree_mutator, replace_rte_variables_mutator(), replace_rte_variables_context::sublevels_up, and replace_rte_variables_context::target_varno.

Referenced by pullup_replace_vars(), pullup_replace_vars_subquery(), and ReplaceVarsFromTargetList().

◆ replace_rte_variables_mutator()

Node* replace_rte_variables_mutator ( Node node,
replace_rte_variables_context context 
)

Definition at line 1381 of file rewriteManip.c.

1383 {
1384  if (node == NULL)
1385  return NULL;
1386  if (IsA(node, Var))
1387  {
1388  Var *var = (Var *) node;
1389 
1390  if (var->varno == context->target_varno &&
1391  var->varlevelsup == context->sublevels_up)
1392  {
1393  /* Found a matching variable, make the substitution */
1394  Node *newnode;
1395 
1396  newnode = context->callback(var, context);
1397  /* Detect if we are adding a sublink to query */
1398  if (!context->inserted_sublink)
1399  context->inserted_sublink = checkExprHasSubLink(newnode);
1400  return newnode;
1401  }
1402  /* otherwise fall through to copy the var normally */
1403  }
1404  else if (IsA(node, CurrentOfExpr))
1405  {
1406  CurrentOfExpr *cexpr = (CurrentOfExpr *) node;
1407 
1408  if (cexpr->cvarno == context->target_varno &&
1409  context->sublevels_up == 0)
1410  {
1411  /*
1412  * We get here if a WHERE CURRENT OF expression turns out to apply
1413  * to a view. Someday we might be able to translate the
1414  * expression to apply to an underlying table of the view, but
1415  * right now it's not implemented.
1416  */
1417  ereport(ERROR,
1418  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1419  errmsg("WHERE CURRENT OF on a view is not implemented")));
1420  }
1421  /* otherwise fall through to copy the expr normally */
1422  }
1423  else if (IsA(node, Query))
1424  {
1425  /* Recurse into RTE subquery or not-yet-planned sublink subquery */
1426  Query *newnode;
1427  bool save_inserted_sublink;
1428 
1429  context->sublevels_up++;
1430  save_inserted_sublink = context->inserted_sublink;
1431  context->inserted_sublink = ((Query *) node)->hasSubLinks;
1432  newnode = query_tree_mutator((Query *) node,
1434  (void *) context,
1435  0);
1436  newnode->hasSubLinks |= context->inserted_sublink;
1437  context->inserted_sublink = save_inserted_sublink;
1438  context->sublevels_up--;
1439  return (Node *) newnode;
1440  }
1442  (void *) context);
1443 }

References replace_rte_variables_context::callback, checkExprHasSubLink(), CurrentOfExpr::cvarno, ereport, errcode(), errmsg(), ERROR, expression_tree_mutator, replace_rte_variables_context::inserted_sublink, IsA, query_tree_mutator, replace_rte_variables_context::sublevels_up, replace_rte_variables_context::target_varno, Var::varlevelsup, and Var::varno.

Referenced by pullup_replace_vars_callback(), replace_rte_variables(), and ReplaceVarsFromTargetList_callback().

◆ ReplaceVarsFromTargetList()

Node* ReplaceVarsFromTargetList ( Node node,
int  target_varno,
int  sublevels_up,
RangeTblEntry target_rte,
List targetlist,
ReplaceVarsNoMatchOption  nomatch_option,
int  nomatch_varno,
bool outer_hasSubLinks 
)

Definition at line 1761 of file rewriteManip.c.

1768 {
1770 
1771  context.target_rte = target_rte;
1772  context.targetlist = targetlist;
1773  context.nomatch_option = nomatch_option;
1774  context.nomatch_varno = nomatch_varno;
1775 
1776  return replace_rte_variables(node, target_varno, sublevels_up,
1778  (void *) &context,
1779  outer_hasSubLinks);
1780 }
Node * replace_rte_variables(Node *node, int target_varno, int sublevels_up, replace_rte_variables_callback callback, void *callback_arg, bool *outer_hasSubLinks)
static Node * ReplaceVarsFromTargetList_callback(Var *var, replace_rte_variables_context *context)
ReplaceVarsNoMatchOption nomatch_option

References ReplaceVarsFromTargetList_context::nomatch_option, ReplaceVarsFromTargetList_context::nomatch_varno, replace_rte_variables(), ReplaceVarsFromTargetList_callback(), ReplaceVarsFromTargetList_context::target_rte, and ReplaceVarsFromTargetList_context::targetlist.

Referenced by CopyAndAddInvertedQual(), rewriteRuleAction(), rewriteTargetView(), and subquery_push_qual().

◆ ReplaceVarsFromTargetList_callback()

static Node* ReplaceVarsFromTargetList_callback ( Var var,
replace_rte_variables_context context 
)
static

Definition at line 1657 of file rewriteManip.c.

1659 {
1661  TargetEntry *tle;
1662 
1663  if (var->varattno == InvalidAttrNumber)
1664  {
1665  /* Must expand whole-tuple reference into RowExpr */
1666  RowExpr *rowexpr;
1667  List *colnames;
1668  List *fields;
1669 
1670  /*
1671  * If generating an expansion for a var of a named rowtype (ie, this
1672  * is a plain relation RTE), then we must include dummy items for
1673  * dropped columns. If the var is RECORD (ie, this is a JOIN), then
1674  * omit dropped columns. In the latter case, attach column names to
1675  * the RowExpr for use of the executor and ruleutils.c.
1676  */
1677  expandRTE(rcon->target_rte,
1678  var->varno, var->varlevelsup, var->location,
1679  (var->vartype != RECORDOID),
1680  &colnames, &fields);
1681  /* Adjust the generated per-field Vars... */
1682  fields = (List *) replace_rte_variables_mutator((Node *) fields,
1683  context);
1684  rowexpr = makeNode(RowExpr);
1685  rowexpr->args = fields;
1686  rowexpr->row_typeid = var->vartype;
1687  rowexpr->row_format = COERCE_IMPLICIT_CAST;
1688  rowexpr->colnames = (var->vartype == RECORDOID) ? colnames : NIL;
1689  rowexpr->location = var->location;
1690 
1691  return (Node *) rowexpr;
1692  }
1693 
1694  /* Normal case referencing one targetlist element */
1695  tle = get_tle_by_resno(rcon->targetlist, var->varattno);
1696 
1697  if (tle == NULL || tle->resjunk)
1698  {
1699  /* Failed to find column in targetlist */
1700  switch (rcon->nomatch_option)
1701  {
1703  /* fall through, throw error below */
1704  break;
1705 
1707  var = (Var *) copyObject(var);
1708  var->varno = rcon->nomatch_varno;
1709  /* we leave the syntactic referent alone */
1710  return (Node *) var;
1711 
1713 
1714  /*
1715  * If Var is of domain type, we should add a CoerceToDomain
1716  * node, in case there is a NOT NULL domain constraint.
1717  */
1718  return coerce_to_domain((Node *) makeNullConst(var->vartype,
1719  var->vartypmod,
1720  var->varcollid),
1721  InvalidOid, -1,
1722  var->vartype,
1725  -1,
1726  false);
1727  }
1728  elog(ERROR, "could not find replacement targetlist entry for attno %d",
1729  var->varattno);
1730  return NULL; /* keep compiler quiet */
1731  }
1732  else
1733  {
1734  /* Make a copy of the tlist item to return */
1735  Expr *newnode = copyObject(tle->expr);
1736 
1737  /* Must adjust varlevelsup if tlist item is from higher query */
1738  if (var->varlevelsup > 0)
1739  IncrementVarSublevelsUp((Node *) newnode, var->varlevelsup, 0);
1740 
1741  /*
1742  * Check to see if the tlist item contains a PARAM_MULTIEXPR Param,
1743  * and throw error if so. This case could only happen when expanding
1744  * an ON UPDATE rule's NEW variable and the referenced tlist item in
1745  * the original UPDATE command is part of a multiple assignment. There
1746  * seems no practical way to handle such cases without multiple
1747  * evaluation of the multiple assignment's sub-select, which would
1748  * create semantic oddities that users of rules would probably prefer
1749  * not to cope with. So treat it as an unimplemented feature.
1750  */
1751  if (contains_multiexpr_param((Node *) newnode, NULL))
1752  ereport(ERROR,
1753  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1754  errmsg("NEW variables in ON UPDATE rules cannot reference columns that are part of a multiple assignment in the subject UPDATE command")));
1755 
1756  return (Node *) newnode;
1757  }
1758 }
#define InvalidAttrNumber
Definition: attnum.h:23
Const * makeNullConst(Oid consttype, int32 consttypmod, Oid constcollid)
Definition: makefuncs.c:340
Node * coerce_to_domain(Node *arg, Oid baseTypeId, int32 baseTypeMod, Oid typeId, CoercionContext ccontext, CoercionForm cformat, int location, bool hideInputCoercion)
Definition: parse_coerce.c:676
TargetEntry * get_tle_by_resno(List *tlist, AttrNumber resno)
void expandRTE(RangeTblEntry *rte, int rtindex, int sublevels_up, int location, bool include_dropped, List **colnames, List **colvars)
#define NIL
Definition: pg_list.h:68
#define InvalidOid
Definition: postgres_ext.h:36
@ COERCION_IMPLICIT
Definition: primnodes.h:649
void IncrementVarSublevelsUp(Node *node, int delta_sublevels_up, int min_sublevels_up)
Definition: rewriteManip.c:841
@ REPLACEVARS_SUBSTITUTE_NULL
Definition: rewriteManip.h:40
@ REPLACEVARS_CHANGE_VARNO
Definition: rewriteManip.h:39
@ REPLACEVARS_REPORT_ERROR
Definition: rewriteManip.h:38
Definition: pg_list.h:54
int location
Definition: primnodes.h:1370
List * args
Definition: primnodes.h:1346
int location
Definition: primnodes.h:279

References RowExpr::args, replace_rte_variables_context::callback_arg, COERCE_IMPLICIT_CAST, coerce_to_domain(), COERCION_IMPLICIT, contains_multiexpr_param(), copyObject, elog(), ereport, errcode(), errmsg(), ERROR, expandRTE(), get_tle_by_resno(), if(), IncrementVarSublevelsUp(), InvalidAttrNumber, InvalidOid, Var::location, RowExpr::location, makeNode, makeNullConst(), NIL, ReplaceVarsFromTargetList_context::nomatch_option, ReplaceVarsFromTargetList_context::nomatch_varno, replace_rte_variables_mutator(), REPLACEVARS_CHANGE_VARNO, REPLACEVARS_REPORT_ERROR, REPLACEVARS_SUBSTITUTE_NULL, ReplaceVarsFromTargetList_context::target_rte, ReplaceVarsFromTargetList_context::targetlist, Var::varattno, Var::varlevelsup, and Var::varno.

Referenced by ReplaceVarsFromTargetList().