PostgreSQL Source Code git master
Data Structures | Typedefs | Enumerations | Functions
rewriteManip.h File Reference
#include "nodes/parsenodes.h"
#include "nodes/pathnodes.h"
Include dependency graph for rewriteManip.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

struct   replace_rte_variables_context
 
struct   ChangeVarNodes_context
 

Typedefs

typedef struct AttrMap  AttrMap
 
typedef struct replace_rte_variables_context  replace_rte_variables_context
 
typedef Node *(*  replace_rte_variables_callback) (Var *var, replace_rte_variables_context *context)
 
typedef enum ReplaceVarsNoMatchOption  ReplaceVarsNoMatchOption
 
typedef struct ChangeVarNodes_context  ChangeVarNodes_context
 
typedef bool(*  ChangeVarNodes_callback) (Node *node, ChangeVarNodes_context *arg)
 

Enumerations

enum   ReplaceVarsNoMatchOption { REPLACEVARS_REPORT_ERROR , REPLACEVARS_CHANGE_VARNO , REPLACEVARS_SUBSTITUTE_NULL }
 

Functions

Relids  adjust_relid_set (Relids relids, int oldrelid, int newrelid)
 
void  CombineRangeTables (List **dst_rtable, List **dst_perminfos, List *src_rtable, List *src_perminfos)
 
void  OffsetVarNodes (Node *node, int offset, int sublevels_up)
 
void  ChangeVarNodes (Node *node, int rt_index, int new_index, int sublevels_up)
 
void  ChangeVarNodesExtended (Node *node, int rt_index, int new_index, int sublevels_up, ChangeVarNodes_callback callback)
 
bool  ChangeVarNodesWalkExpression (Node *node, ChangeVarNodes_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)
 
bool  rangeTableEntry_used (Node *node, int rt_index, int sublevels_up)
 
Query *  getInsertSelectQuery (Query *parsetree, Query ***subquery_ptr)
 
void  AddQual (Query *parsetree, Node *qual)
 
void  AddInvertedQual (Query *parsetree, Node *qual)
 
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)
 
Node *  add_nulling_relids (Node *node, const Bitmapset *target_relids, const Bitmapset *added_relids)
 
Node *  remove_nulling_relids (Node *node, const Bitmapset *removable_relids, const Bitmapset *except_relids)
 
Node *  replace_rte_variables (Node *node, int target_varno, int sublevels_up, replace_rte_variables_callback callback, void *callback_arg, bool *outer_hasSubLinks)
 
Node *  replace_rte_variables_mutator (Node *node, replace_rte_variables_context *context)
 
Node *  map_variable_attnos (Node *node, int target_varno, int sublevels_up, const AttrMap *attno_map, Oid to_rowtype, bool *found_whole_row)
 
Node *  ReplaceVarFromTargetList (Var *var, RangeTblEntry *target_rte, List *targetlist, int result_relation, ReplaceVarsNoMatchOption nomatch_option, int nomatch_varno)
 
Node *  ReplaceVarsFromTargetList (Node *node, int target_varno, int sublevels_up, RangeTblEntry *target_rte, List *targetlist, int result_relation, ReplaceVarsNoMatchOption nomatch_option, int nomatch_varno, bool *outer_hasSubLinks)
 

Typedef Documentation

◆ AttrMap

typedef struct AttrMap AttrMap

Definition at line 20 of file rewriteManip.h.

◆ ChangeVarNodes_callback

typedef bool(* ChangeVarNodes_callback) (Node *node, ChangeVarNodes_context *arg)

Definition at line 46 of file rewriteManip.h.

◆ ChangeVarNodes_context

typedef struct ChangeVarNodes_context ChangeVarNodes_context

Definition at line 44 of file rewriteManip.h.

◆ replace_rte_variables_callback

typedef Node *(* replace_rte_variables_callback) (Var *var, replace_rte_variables_context *context)

Definition at line 25 of file rewriteManip.h.

◆ replace_rte_variables_context

typedef struct replace_rte_variables_context replace_rte_variables_context

Definition at line 23 of file rewriteManip.h.

◆ ReplaceVarsNoMatchOption

typedef enum ReplaceVarsNoMatchOption ReplaceVarsNoMatchOption

Enumeration Type Documentation

◆ ReplaceVarsNoMatchOption

enum ReplaceVarsNoMatchOption
Enumerator
REPLACEVARS_REPORT_ERROR 
REPLACEVARS_CHANGE_VARNO 
REPLACEVARS_SUBSTITUTE_NULL 

Definition at line 37 of file rewriteManip.h.

38{
39 REPLACEVARS_REPORT_ERROR, /* throw error if no match */
40 REPLACEVARS_CHANGE_VARNO, /* change the Var's varno, nothing else */
41 REPLACEVARS_SUBSTITUTE_NULL, /* replace with a NULL Const */
ReplaceVarsNoMatchOption
Definition: rewriteManip.h:38
@ REPLACEVARS_SUBSTITUTE_NULL
Definition: rewriteManip.h:41
@ REPLACEVARS_CHANGE_VARNO
Definition: rewriteManip.h:40
@ REPLACEVARS_REPORT_ERROR
Definition: rewriteManip.h:39

Function Documentation

◆ add_nulling_relids()

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

Definition at line 1243 of file rewriteManip.c.

1246{
1248
1249 context.target_relids = target_relids;
1250 context.added_relids = added_relids;
1251 context.sublevels_up = 0;
1254 &context,
1255 0);
1256}
#define query_or_expression_tree_mutator(n, m, c, f)
Definition: nodeFuncs.h:173
static Node * add_nulling_relids_mutator(Node *node, add_nulling_relids_context *context)
Definition: rewriteManip.c:1259
Definition: rewriteManip.c:45
int sublevels_up
Definition: rewriteManip.c:48
const Bitmapset * target_relids
Definition: rewriteManip.c:46
const Bitmapset * added_relids
Definition: rewriteManip.c:47

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(), mark_nullable_by_grouping(), pullup_replace_vars_callback(), and transform_MERGE_to_join().

◆ AddInvertedQual()

void AddInvertedQual ( Query *  parsetree,
Node *  qual 
)

Definition at line 1219 of file rewriteManip.c.

1220{
1221 BooleanTest *invqual;
1222
1223 if (qual == NULL)
1224 return;
1225
1226 /* Need not copy input qual, because AddQual will... */
1227 invqual = makeNode(BooleanTest);
1228 invqual->arg = (Expr *) qual;
1229 invqual->booltesttype = IS_NOT_TRUE;
1230 invqual->location = -1;
1231
1232 AddQual(parsetree, (Node *) invqual);
1233}
#define makeNode(_type_)
Definition: nodes.h:161
@ IS_NOT_TRUE
Definition: primnodes.h:2001
void AddQual(Query *parsetree, Node *qual)
Definition: rewriteManip.c:1151
ParseLoc location
Definition: primnodes.h:2009
BoolTestType booltesttype
Definition: primnodes.h:2008
Expr * arg
Definition: primnodes.h:2007
Definition: primnodes.h:189
Definition: nodes.h:135

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 1151 of file rewriteManip.c.

1152{
1153 Node *copy;
1154
1155 if (qual == NULL)
1156 return;
1157
1158 if (parsetree->commandType == CMD_UTILITY)
1159 {
1160 /*
1161 * There's noplace to put the qual on a utility statement.
1162 *
1163 * If it's a NOTIFY, silently ignore the qual; this means that the
1164 * NOTIFY will execute, whether or not there are any qualifying rows.
1165 * While clearly wrong, this is much more useful than refusing to
1166 * execute the rule at all, and extra NOTIFY events are harmless for
1167 * typical uses of NOTIFY.
1168 *
1169 * If it isn't a NOTIFY, error out, since unconditional execution of
1170 * other utility stmts is unlikely to be wanted. (This case is not
1171 * currently allowed anyway, but keep the test for safety.)
1172 */
1173 if (parsetree->utilityStmt && IsA(parsetree->utilityStmt, NotifyStmt))
1174 return;
1175 else
1176 ereport(ERROR,
1177 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1178 errmsg("conditional utility statements are not implemented")));
1179 }
1180
1181 if (parsetree->setOperations != NULL)
1182 {
1183 /*
1184 * There's noplace to put the qual on a setop statement, either. (This
1185 * could be fixed, but right now the planner simply ignores any qual
1186 * condition on a setop query.)
1187 */
1188 ereport(ERROR,
1189 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1190 errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
1191 }
1192
1193 /* INTERSECT wants the original, but we need to copy - Jan */
1194 copy = copyObject(qual);
1195
1196 parsetree->jointree->quals = make_and_qual(parsetree->jointree->quals,
1197 copy);
1198
1199 /*
1200 * We had better not have stuck an aggregate into the WHERE clause.
1201 */
1202 Assert(!contain_aggs_of_level(copy, 0));
1203
1204 /*
1205 * Make sure query is marked correctly if added qual has sublinks. Need
1206 * not search qual when query is already marked.
1207 */
1208 if (!parsetree->hasSubLinks)
1209 parsetree->hasSubLinks = checkExprHasSubLink(copy);
1210}
int errcode(int sqlerrcode)
Definition: elog.c:854
int errmsg(const char *fmt,...)
Definition: elog.c:1071
#define ERROR
Definition: elog.h:39
#define ereport(elevel,...)
Definition: elog.h:150
Assert(PointerIsAligned(start, uint64))
Node * make_and_qual(Node *qual1, Node *qual2)
Definition: makefuncs.c:780
#define IsA(nodeptr, _type_)
Definition: nodes.h:164
#define copyObject(obj)
Definition: nodes.h:232
@ CMD_UTILITY
Definition: nodes.h:280
bool checkExprHasSubLink(Node *node)
Definition: rewriteManip.c:292
bool contain_aggs_of_level(Node *node, int levelsup)
Definition: rewriteManip.c:85
Node * quals
Definition: primnodes.h:2358
FromExpr * jointree
Definition: parsenodes.h:182
Node * setOperations
Definition: parsenodes.h:236
CmdType commandType
Definition: parsenodes.h:121
Node * utilityStmt
Definition: parsenodes.h:141

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

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

Definition at line 764 of file rewriteManip.c.

765{
766 if (!IS_SPECIAL_VARNO(oldrelid) && bms_is_member(oldrelid, relids))
767 {
768 /* Ensure we have a modifiable copy */
769 relids = bms_copy(relids);
770 /* Remove old, add new */
771 relids = bms_del_member(relids, oldrelid);
772 if (!IS_SPECIAL_VARNO(newrelid))
773 relids = bms_add_member(relids, newrelid);
774 }
775 return relids;
776}
Bitmapset * bms_del_member(Bitmapset *a, int x)
Definition: bitmapset.c:868
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:510
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:815
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:122
#define IS_SPECIAL_VARNO(varno)
Definition: primnodes.h:247

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

Referenced by ChangeVarNodes_walker(), remove_rel_from_eclass(), remove_rel_from_query(), remove_self_join_rel(), replace_relid_callback(), and update_eclasses().

◆ ChangeVarNodes()

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

Definition at line 736 of file rewriteManip.c.

737{
738 ChangeVarNodesExtended(node, rt_index, new_index, sublevels_up, NULL);
739}
void ChangeVarNodesExtended(Node *node, int rt_index, int new_index, int sublevels_up, ChangeVarNodes_callback callback)
Definition: rewriteManip.c:680

References ChangeVarNodesExtended().

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

◆ ChangeVarNodesExtended()

void ChangeVarNodesExtended ( Node *  node,
int  rt_index,
int  new_index,
int  sublevels_up,
ChangeVarNodes_callback  callback 
)

Definition at line 680 of file rewriteManip.c.

682{
684
685 context.rt_index = rt_index;
686 context.new_index = new_index;
687 context.sublevels_up = sublevels_up;
688 context.callback = callback;
689
690 /*
691 * Must be prepared to start with a Query or a bare expression tree; if
692 * it's a Query, go straight to query_tree_walker to make sure that
693 * sublevels_up doesn't get incremented prematurely.
694 */
695 if (node && IsA(node, Query))
696 {
697 Query *qry = (Query *) node;
698
699 /*
700 * If we are starting at a Query, and sublevels_up is zero, then we
701 * must also fix rangetable indexes in the Query itself --- namely
702 * resultRelation, mergeTargetRelation, exclRelIndex and rowMarks
703 * entries. sublevels_up cannot be zero when recursing into a
704 * subquery, so there's no need to have the same logic inside
705 * ChangeVarNodes_walker.
706 */
707 if (sublevels_up == 0)
708 {
709 ListCell *l;
710
711 if (qry->resultRelation == rt_index)
712 qry->resultRelation = new_index;
713
714 if (qry->mergeTargetRelation == rt_index)
715 qry->mergeTargetRelation = new_index;
716
717 /* this is unlikely to ever be used, but ... */
718 if (qry->onConflict && qry->onConflict->exclRelIndex == rt_index)
719 qry->onConflict->exclRelIndex = new_index;
720
721 foreach(l, qry->rowMarks)
722 {
724
725 if (rc->rti == rt_index)
726 rc->rti = new_index;
727 }
728 }
729 query_tree_walker(qry, ChangeVarNodes_walker, &context, 0);
730 }
731 else
732 ChangeVarNodes_walker(node, &context);
733}
#define query_tree_walker(q, w, c, f)
Definition: nodeFuncs.h:158
#define lfirst(lc)
Definition: pg_list.h:172
static bool ChangeVarNodes_walker(Node *node, ChangeVarNodes_context *context)
Definition: rewriteManip.c:554
Definition: rewriteManip.h:50
int new_index
Definition: rewriteManip.h:52
int rt_index
Definition: rewriteManip.h:51
ChangeVarNodes_callback callback
Definition: rewriteManip.h:54
int sublevels_up
Definition: rewriteManip.h:53
int exclRelIndex
Definition: primnodes.h:2384
Definition: parsenodes.h:118
List * rowMarks
Definition: parsenodes.h:234
OnConflictExpr * onConflict
Definition: parsenodes.h:203
static void callback(struct sockaddr *addr, struct sockaddr *mask, void *unused)
Definition: test_ifaddrs.c:46
Definition: pg_list.h:46

References ChangeVarNodes_context::callback, callback(), 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 ChangeVarNodes(), match_unique_clauses(), remove_rel_from_eclass(), remove_rel_from_query(), remove_self_join_rel(), split_selfjoin_quals(), and update_eclasses().

◆ ChangeVarNodesWalkExpression()

bool ChangeVarNodesWalkExpression ( Node *  node,
ChangeVarNodes_context *  context 
)

Definition at line 747 of file rewriteManip.c.

748{
749 return expression_tree_walker(node,
751 (void *) context);
752}
#define expression_tree_walker(n, w, c)
Definition: nodeFuncs.h:153

References ChangeVarNodes_walker(), and expression_tree_walker.

Referenced by replace_relid_callback().

◆ checkExprHasSubLink()

bool checkExprHasSubLink ( Node *  node )

Definition at line 292 of file rewriteManip.c.

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

References checkExprHasSubLink_walker(), QTW_IGNORE_RC_SUBQUERIES, and query_or_expression_tree_walker.

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

◆ CombineRangeTables()

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

Definition at line 347 of file rewriteManip.c.

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

References lfirst_node, list_concat(), and list_length().

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 &context,
98 0);
99}
static bool contain_aggs_of_level_walker(Node *node, contain_aggs_of_level_context *context)
Definition: rewriteManip.c:102
Definition: rewriteManip.c:29
int sublevels_up
Definition: rewriteManip.c:30

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

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

◆ contain_windowfuncs()

bool contain_windowfuncs ( Node *  node )

Definition at line 214 of file rewriteManip.c.

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

References contain_windowfuncs_walker(), and query_or_expression_tree_walker.

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

◆ getInsertSelectQuery()

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

Definition at line 1093 of file rewriteManip.c.

1094{
1095 Query *selectquery;
1096 RangeTblEntry *selectrte;
1097 RangeTblRef *rtr;
1098
1099 if (subquery_ptr)
1100 *subquery_ptr = NULL;
1101
1102 if (parsetree == NULL)
1103 return parsetree;
1104 if (parsetree->commandType != CMD_INSERT)
1105 return parsetree;
1106
1107 /*
1108 * Currently, this is ONLY applied to rule-action queries, and so we
1109 * expect to find the OLD and NEW placeholder entries in the given query.
1110 * If they're not there, it must be an INSERT/SELECT in which they've been
1111 * pushed down to the SELECT.
1112 */
1113 if (list_length(parsetree->rtable) >= 2 &&
1114 strcmp(rt_fetch(PRS2_OLD_VARNO, parsetree->rtable)->eref->aliasname,
1115 "old") == 0 &&
1116 strcmp(rt_fetch(PRS2_NEW_VARNO, parsetree->rtable)->eref->aliasname,
1117 "new") == 0)
1118 return parsetree;
1119 Assert(parsetree->jointree && IsA(parsetree->jointree, FromExpr));
1120 if (list_length(parsetree->jointree->fromlist) != 1)
1121 elog(ERROR, "expected to find SELECT subquery");
1122 rtr = (RangeTblRef *) linitial(parsetree->jointree->fromlist);
1123 if (!IsA(rtr, RangeTblRef))
1124 elog(ERROR, "expected to find SELECT subquery");
1125 selectrte = rt_fetch(rtr->rtindex, parsetree->rtable);
1126 if (!(selectrte->rtekind == RTE_SUBQUERY &&
1127 selectrte->subquery &&
1128 IsA(selectrte->subquery, Query) &&
1129 selectrte->subquery->commandType == CMD_SELECT))
1130 elog(ERROR, "expected to find SELECT subquery");
1131 selectquery = selectrte->subquery;
1132 if (list_length(selectquery->rtable) >= 2 &&
1133 strcmp(rt_fetch(PRS2_OLD_VARNO, selectquery->rtable)->eref->aliasname,
1134 "old") == 0 &&
1135 strcmp(rt_fetch(PRS2_NEW_VARNO, selectquery->rtable)->eref->aliasname,
1136 "new") == 0)
1137 {
1138 if (subquery_ptr)
1139 *subquery_ptr = &(selectrte->subquery);
1140 return selectquery;
1141 }
1142 elog(ERROR, "could not find rule placeholders");
1143 return NULL; /* not reached */
1144}
#define elog(elevel,...)
Definition: elog.h:226
@ CMD_INSERT
Definition: nodes.h:277
@ CMD_SELECT
Definition: nodes.h:275
@ RTE_SUBQUERY
Definition: parsenodes.h:1044
#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:250
#define PRS2_NEW_VARNO
Definition: primnodes.h:251
List * fromlist
Definition: primnodes.h:2357
List * rtable
Definition: parsenodes.h:175
Query * subquery
Definition: parsenodes.h:1135
RTEKind rtekind
Definition: parsenodes.h:1078
int rtindex
Definition: primnodes.h:2295

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 884 of file rewriteManip.c.

886{
888
889 context.delta_sublevels_up = delta_sublevels_up;
890 context.min_sublevels_up = min_sublevels_up;
891
892 /*
893 * Must be prepared to start with a Query or a bare expression tree; if
894 * it's a Query, we don't want to increment sublevels_up.
895 */
898 &context,
900}
#define QTW_EXAMINE_RTES_BEFORE
Definition: nodeFuncs.h:27
static bool IncrementVarSublevelsUp_walker(Node *node, IncrementVarSublevelsUp_context *context)
Definition: rewriteManip.c:804
Definition: rewriteManip.c:798
int min_sublevels_up
Definition: rewriteManip.c:800
int delta_sublevels_up
Definition: rewriteManip.c:799

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_group_exprs_mutator(), flatten_join_alias_vars_mutator(), inline_cte_walker(), pull_up_simple_subquery(), pullup_replace_vars_callback(), replace_outer_agg(), replace_outer_grouping(), replace_outer_returning(), 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 907 of file rewriteManip.c.

909{
911
912 context.delta_sublevels_up = delta_sublevels_up;
913 context.min_sublevels_up = min_sublevels_up;
914
915 range_table_walker(rtable,
917 &context,
919}
#define range_table_walker(rt, w, c, f)
Definition: nodeFuncs.h:163

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

◆ 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 &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
Definition: rewriteManip.c:34
int agg_location
Definition: rewriteManip.c:35
int sublevels_up
Definition: rewriteManip.c:36

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

int locate_windowfunc ( Node *  node )

Definition at line 251 of file rewriteManip.c.

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

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

Referenced by checkTargetlistEntrySQL92(), and transformWindowFuncCall().

◆ 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 1705 of file rewriteManip.c.

1709{
1711
1712 context.target_varno = target_varno;
1713 context.sublevels_up = sublevels_up;
1714 context.attno_map = attno_map;
1715 context.to_rowtype = to_rowtype;
1716 context.found_whole_row = found_whole_row;
1717
1718 *found_whole_row = false;
1719
1720 /*
1721 * Must be prepared to start with a Query or a bare expression tree; if
1722 * it's a Query, we don't want to increment sublevels_up.
1723 */
1726 &context,
1727 0);
1728}
static Node * map_variable_attnos_mutator(Node *node, map_variable_attnos_context *context)
Definition: rewriteManip.c:1583
Definition: rewriteManip.c:1574
bool * found_whole_row
Definition: rewriteManip.c:1579
int target_varno
Definition: rewriteManip.c:1575
Oid to_rowtype
Definition: rewriteManip.c:1578
int sublevels_up
Definition: rewriteManip.c:1576
const AttrMap * attno_map
Definition: rewriteManip.c:1577

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(), ExecInitMerge(), ExecInitPartitionInfo(), expandTableLikeClause(), generateClonedExtStatsStmt(), generateClonedIndexStmt(), map_partition_varattnos(), and MergeAttributes().

◆ OffsetVarNodes()

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

Definition at line 476 of file rewriteManip.c.

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

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

◆ rangeTableEntry_used()

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

Definition at line 1061 of file rewriteManip.c.

1062{
1064
1065 context.rt_index = rt_index;
1066 context.sublevels_up = sublevels_up;
1067
1068 /*
1069 * Must be prepared to start with a Query or a bare expression tree; if
1070 * it's a Query, we don't want to increment sublevels_up.
1071 */
1074 &context,
1075 0);
1076}
static bool rangeTableEntry_used_walker(Node *node, rangeTableEntry_used_context *context)
Definition: rewriteManip.c:995
Definition: rewriteManip.c:989
int sublevels_up
Definition: rewriteManip.c:991
int rt_index
Definition: rewriteManip.c:990

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

◆ remove_nulling_relids()

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

Definition at line 1331 of file rewriteManip.c.

1334{
1336
1337 context.removable_relids = removable_relids;
1338 context.except_relids = except_relids;
1339 context.sublevels_up = 0;
1342 &context,
1343 0);
1344}
static Node * remove_nulling_relids_mutator(Node *node, remove_nulling_relids_context *context)
Definition: rewriteManip.c:1347
Definition: rewriteManip.c:52
int sublevels_up
Definition: rewriteManip.c:55
const Bitmapset * removable_relids
Definition: rewriteManip.c:53
const Bitmapset * except_relids
Definition: rewriteManip.c:54

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 add_unique_group_var(), deconstruct_distribute_oj_quals(), estimate_multivariate_bucketsize(), examine_variable(), have_partkey_equi_join(), make_group_input_target(), make_pathkeys_for_sortclauses_extended(), reconsider_full_join_clause(), reduce_outer_joins(), remove_useless_result_rtes(), and set_upper_references().

◆ 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 1438 of file rewriteManip.c.

1442{
1443 Node *result;
1445
1446 context.callback = callback;
1447 context.callback_arg = callback_arg;
1448 context.target_varno = target_varno;
1449 context.sublevels_up = sublevels_up;
1450
1451 /*
1452 * We try to initialize inserted_sublink to true if there is no need to
1453 * detect new sublinks because the query already has some.
1454 */
1455 if (node && IsA(node, Query))
1456 context.inserted_sublink = ((Query *) node)->hasSubLinks;
1457 else if (outer_hasSubLinks)
1458 context.inserted_sublink = *outer_hasSubLinks;
1459 else
1460 context.inserted_sublink = false;
1461
1462 /*
1463 * Must be prepared to start with a Query or a bare expression tree; if
1464 * it's a Query, we don't want to increment sublevels_up.
1465 */
1468 &context,
1469 0);
1470
1471 if (context.inserted_sublink)
1472 {
1473 if (result && IsA(result, Query))
1474 ((Query *) result)->hasSubLinks = true;
1475 else if (outer_hasSubLinks)
1476 *outer_hasSubLinks = true;
1477 else
1478 elog(ERROR, "replace_rte_variables inserted a SubLink, but has noplace to record it");
1479 }
1480
1481 return result;
1482}
Node * replace_rte_variables_mutator(Node *node, replace_rte_variables_context *context)
Definition: rewriteManip.c:1485
Definition: rewriteManip.h:29
replace_rte_variables_callback callback
Definition: rewriteManip.h:30
int target_varno
Definition: rewriteManip.h:32
int sublevels_up
Definition: rewriteManip.h:33
bool inserted_sublink
Definition: rewriteManip.h:34
void * callback_arg
Definition: rewriteManip.h:31

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 1485 of file rewriteManip.c.

1487{
1488 if (node == NULL)
1489 return NULL;
1490 if (IsA(node, Var))
1491 {
1492 Var *var = (Var *) node;
1493
1494 if (var->varno == context->target_varno &&
1495 var->varlevelsup == context->sublevels_up)
1496 {
1497 /* Found a matching variable, make the substitution */
1498 Node *newnode;
1499
1500 newnode = context->callback(var, context);
1501 /* Detect if we are adding a sublink to query */
1502 if (!context->inserted_sublink)
1503 context->inserted_sublink = checkExprHasSubLink(newnode);
1504 return newnode;
1505 }
1506 /* otherwise fall through to copy the var normally */
1507 }
1508 else if (IsA(node, CurrentOfExpr))
1509 {
1510 CurrentOfExpr *cexpr = (CurrentOfExpr *) node;
1511
1512 if (cexpr->cvarno == context->target_varno &&
1513 context->sublevels_up == 0)
1514 {
1515 /*
1516 * We get here if a WHERE CURRENT OF expression turns out to apply
1517 * to a view. Someday we might be able to translate the
1518 * expression to apply to an underlying table of the view, but
1519 * right now it's not implemented.
1520 */
1521 ereport(ERROR,
1522 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1523 errmsg("WHERE CURRENT OF on a view is not implemented")));
1524 }
1525 /* otherwise fall through to copy the expr normally */
1526 }
1527 else if (IsA(node, Query))
1528 {
1529 /* Recurse into RTE subquery or not-yet-planned sublink subquery */
1530 Query *newnode;
1531 bool save_inserted_sublink;
1532
1533 context->sublevels_up++;
1534 save_inserted_sublink = context->inserted_sublink;
1535 context->inserted_sublink = ((Query *) node)->hasSubLinks;
1536 newnode = query_tree_mutator((Query *) node,
1538 context,
1539 0);
1540 newnode->hasSubLinks |= context->inserted_sublink;
1541 context->inserted_sublink = save_inserted_sublink;
1542 context->sublevels_up--;
1543 return (Node *) newnode;
1544 }
1546}
#define expression_tree_mutator(n, m, c)
Definition: nodeFuncs.h:155
#define query_tree_mutator(q, m, c, f)
Definition: nodeFuncs.h:160
Index cvarno
Definition: primnodes.h:2122
Definition: primnodes.h:262
int varno
Definition: primnodes.h:269
Index varlevelsup
Definition: primnodes.h:294

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_mutator(), replace_rte_variables_context::sublevels_up, replace_rte_variables_context::target_varno, Var::varlevelsup, and Var::varno.

Referenced by replace_rte_variables(), and replace_rte_variables_mutator().

◆ ReplaceVarFromTargetList()

Node * ReplaceVarFromTargetList ( Var *  var,
RangeTblEntry *  target_rte,
List *  targetlist,
int  result_relation,
ReplaceVarsNoMatchOption  nomatch_option,
int  nomatch_varno 
)

Definition at line 1795 of file rewriteManip.c.

1801{
1802 TargetEntry *tle;
1803
1804 if (var->varattno == InvalidAttrNumber)
1805 {
1806 /* Must expand whole-tuple reference into RowExpr */
1807 RowExpr *rowexpr;
1808 List *colnames;
1809 List *fields;
1810 ListCell *lc;
1811
1812 /*
1813 * If generating an expansion for a var of a named rowtype (ie, this
1814 * is a plain relation RTE), then we must include dummy items for
1815 * dropped columns. If the var is RECORD (ie, this is a JOIN), then
1816 * omit dropped columns. In the latter case, attach column names to
1817 * the RowExpr for use of the executor and ruleutils.c.
1818 *
1819 * In order to be able to cache the results, we always generate the
1820 * expansion with varlevelsup = 0. The caller is responsible for
1821 * adjusting it if needed.
1822 *
1823 * The varreturningtype is copied onto each individual field Var, so
1824 * that it is handled correctly when we recurse.
1825 */
1826 expandRTE(target_rte,
1827 var->varno, 0 /* not varlevelsup */ ,
1828 var->varreturningtype, var->location,
1829 (var->vartype != RECORDOID),
1830 &colnames, &fields);
1831 rowexpr = makeNode(RowExpr);
1832 /* the fields will be set below */
1833 rowexpr->args = NIL;
1834 rowexpr->row_typeid = var->vartype;
1835 rowexpr->row_format = COERCE_IMPLICIT_CAST;
1836 rowexpr->colnames = (var->vartype == RECORDOID) ? colnames : NIL;
1837 rowexpr->location = var->location;
1838 /* Adjust the generated per-field Vars... */
1839 foreach(lc, fields)
1840 {
1841 Node *field = lfirst(lc);
1842
1843 if (field && IsA(field, Var))
1844 field = ReplaceVarFromTargetList((Var *) field,
1845 target_rte,
1846 targetlist,
1847 result_relation,
1848 nomatch_option,
1849 nomatch_varno);
1850 rowexpr->args = lappend(rowexpr->args, field);
1851 }
1852
1853 /* Wrap it in a ReturningExpr, if needed, per comments above */
1855 {
1857
1858 rexpr->retlevelsup = 0;
1859 rexpr->retold = (var->varreturningtype == VAR_RETURNING_OLD);
1860 rexpr->retexpr = (Expr *) rowexpr;
1861
1862 return (Node *) rexpr;
1863 }
1864
1865 return (Node *) rowexpr;
1866 }
1867
1868 /* Normal case referencing one targetlist element */
1869 tle = get_tle_by_resno(targetlist, var->varattno);
1870
1871 if (tle == NULL || tle->resjunk)
1872 {
1873 /* Failed to find column in targetlist */
1874 switch (nomatch_option)
1875 {
1877 /* fall through, throw error below */
1878 break;
1879
1881 var = copyObject(var);
1882 var->varno = nomatch_varno;
1883 var->varlevelsup = 0;
1884 /* we leave the syntactic referent alone */
1885 return (Node *) var;
1886
1888 {
1889 /*
1890 * If Var is of domain type, we must add a CoerceToDomain
1891 * node, in case there is a NOT NULL domain constraint.
1892 */
1893 int16 vartyplen;
1894 bool vartypbyval;
1895
1896 get_typlenbyval(var->vartype, &vartyplen, &vartypbyval);
1897 return coerce_null_to_domain(var->vartype,
1898 var->vartypmod,
1899 var->varcollid,
1900 vartyplen,
1901 vartypbyval);
1902 }
1903 }
1904 elog(ERROR, "could not find replacement targetlist entry for attno %d",
1905 var->varattno);
1906 return NULL; /* keep compiler quiet */
1907 }
1908 else
1909 {
1910 /* Make a copy of the tlist item to return */
1911 Expr *newnode = copyObject(tle->expr);
1912
1913 /*
1914 * Check to see if the tlist item contains a PARAM_MULTIEXPR Param,
1915 * and throw error if so. This case could only happen when expanding
1916 * an ON UPDATE rule's NEW variable and the referenced tlist item in
1917 * the original UPDATE command is part of a multiple assignment. There
1918 * seems no practical way to handle such cases without multiple
1919 * evaluation of the multiple assignment's sub-select, which would
1920 * create semantic oddities that users of rules would probably prefer
1921 * not to cope with. So treat it as an unimplemented feature.
1922 */
1923 if (contains_multiexpr_param((Node *) newnode, NULL))
1924 ereport(ERROR,
1925 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1926 errmsg("NEW variables in ON UPDATE rules cannot reference columns that are part of a multiple assignment in the subject UPDATE command")));
1927
1928 /* Handle any OLD/NEW RETURNING list Vars */
1930 {
1931 /*
1932 * Copy varreturningtype onto any Vars in the tlist item that
1933 * refer to result_relation (which had better be non-zero).
1934 */
1935 if (result_relation == 0)
1936 elog(ERROR, "variable returning old/new found outside RETURNING list");
1937
1938 SetVarReturningType((Node *) newnode, result_relation,
1939 0, var->varreturningtype);
1940
1941 /* Wrap it in a ReturningExpr, if needed, per comments above */
1942 if (!IsA(newnode, Var) ||
1943 ((Var *) newnode)->varno != result_relation ||
1944 ((Var *) newnode)->varlevelsup != 0)
1945 {
1947
1948 rexpr->retlevelsup = 0;
1949 rexpr->retold = (var->varreturningtype == VAR_RETURNING_OLD);
1950 rexpr->retexpr = newnode;
1951
1952 newnode = (Expr *) rexpr;
1953 }
1954 }
1955
1956 return (Node *) newnode;
1957 }
1958}
#define InvalidAttrNumber
Definition: attnum.h:23
int16_t int16
Definition: c.h:533
List * lappend(List *list, void *datum)
Definition: list.c:339
void get_typlenbyval(Oid typid, int16 *typlen, bool *typbyval)
Definition: lsyscache.c:2418
Node * coerce_null_to_domain(Oid typid, int32 typmod, Oid collation, int typlen, bool typbyval)
Definition: parse_coerce.c:1272
TargetEntry * get_tle_by_resno(List *tlist, AttrNumber resno)
void expandRTE(RangeTblEntry *rte, int rtindex, int sublevels_up, VarReturningType returning_type, int location, bool include_dropped, List **colnames, List **colvars)
#define NIL
Definition: pg_list.h:68
@ VAR_RETURNING_OLD
Definition: primnodes.h:257
@ VAR_RETURNING_DEFAULT
Definition: primnodes.h:256
@ COERCE_IMPLICIT_CAST
Definition: primnodes.h:768
static bool contains_multiexpr_param(Node *node, void *context)
Definition: rewriteManip.c:321
static void SetVarReturningType(Node *node, int result_relation, int sublevels_up, VarReturningType returning_type)
Definition: rewriteManip.c:970
Node * ReplaceVarFromTargetList(Var *var, RangeTblEntry *target_rte, List *targetlist, int result_relation, ReplaceVarsNoMatchOption nomatch_option, int nomatch_varno)
Definition: rewriteManip.c:1795
Definition: pg_list.h:54
int retlevelsup
Definition: primnodes.h:2175
Expr * retexpr
Definition: primnodes.h:2177
bool retold
Definition: primnodes.h:2176
List * args
Definition: primnodes.h:1448
ParseLoc location
Definition: primnodes.h:1472
Expr * expr
Definition: primnodes.h:2239
ParseLoc location
Definition: primnodes.h:310
AttrNumber varattno
Definition: primnodes.h:274
VarReturningType varreturningtype
Definition: primnodes.h:297

References RowExpr::args, COERCE_IMPLICIT_CAST, coerce_null_to_domain(), contains_multiexpr_param(), copyObject, elog, ereport, errcode(), errmsg(), ERROR, expandRTE(), TargetEntry::expr, get_tle_by_resno(), get_typlenbyval(), InvalidAttrNumber, IsA, lappend(), lfirst, Var::location, RowExpr::location, makeNode, NIL, ReplaceVarFromTargetList(), REPLACEVARS_CHANGE_VARNO, REPLACEVARS_REPORT_ERROR, REPLACEVARS_SUBSTITUTE_NULL, ReturningExpr::retexpr, ReturningExpr::retlevelsup, ReturningExpr::retold, SetVarReturningType(), VAR_RETURNING_DEFAULT, VAR_RETURNING_OLD, Var::varattno, Var::varlevelsup, Var::varno, and Var::varreturningtype.

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

◆ ReplaceVarsFromTargetList()

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

Definition at line 1961 of file rewriteManip.c.

1969{
1971
1972 context.target_rte = target_rte;
1973 context.targetlist = targetlist;
1974 context.result_relation = result_relation;
1975 context.nomatch_option = nomatch_option;
1976 context.nomatch_varno = nomatch_varno;
1977
1978 return replace_rte_variables(node, target_varno, sublevels_up,
1980 &context,
1981 outer_hasSubLinks);
1982}
static Node * ReplaceVarsFromTargetList_callback(Var *var, replace_rte_variables_context *context)
Definition: rewriteManip.c:1774
Node * replace_rte_variables(Node *node, int target_varno, int sublevels_up, replace_rte_variables_callback callback, void *callback_arg, bool *outer_hasSubLinks)
Definition: rewriteManip.c:1438
Definition: rewriteManip.c:1765
int result_relation
Definition: rewriteManip.c:1768
ReplaceVarsNoMatchOption nomatch_option
Definition: rewriteManip.c:1769
RangeTblEntry * target_rte
Definition: rewriteManip.c:1766
List * targetlist
Definition: rewriteManip.c:1767
int nomatch_varno
Definition: rewriteManip.c:1770

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

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

AltStyle によって変換されたページ (->オリジナル) /