PostgreSQL Source Code git master
Loading...
Searching...
No Matches
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) (const 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

pg_nodiscard 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)
 
QuerygetInsertSelectQuery (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)
 
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)
 
Nodemap_variable_attnos (Node *node, int target_varno, int sublevels_up, const AttrMap *attno_map, Oid to_rowtype, bool *found_whole_row)
 
NodeReplaceVarFromTargetList (const Var *var, RangeTblEntry *target_rte, List *targetlist, int result_relation, ReplaceVarsNoMatchOption nomatch_option, int nomatch_varno)
 
NodeReplaceVarsFromTargetList (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

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

◆ replace_rte_variables_callback

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

Definition at line 25 of file rewriteManip.h.

◆ replace_rte_variables_context

◆ ReplaceVarsNoMatchOption

Enumeration Type Documentation

◆ 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
@ REPLACEVARS_SUBSTITUTE_NULL
@ REPLACEVARS_CHANGE_VARNO
@ REPLACEVARS_REPORT_ERROR

Function Documentation

◆ add_nulling_relids()

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

Definition at line 1239 of file rewriteManip.c.

1242{
1244
1245 context.target_relids = target_relids;
1246 context.added_relids = added_relids;
1247 context.sublevels_up = 0;
1250 &context,
1251 0);
1252}
#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)
const Bitmapset * target_relids
const Bitmapset * added_relids

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

Definition at line 1215 of file rewriteManip.c.

1216{
1218
1219 if (qual == NULL)
1220 return;
1221
1222 /* Need not copy input qual, because AddQual will... */
1224 invqual->arg = (Expr *) qual;
1225 invqual->booltesttype = IS_NOT_TRUE;
1226 invqual->location = -1;
1227
1228 AddQual(parsetree, (Node *) invqual);
1229}
#define makeNode(_type_)
Definition nodes.h:159
static int fb(int x)
@ IS_NOT_TRUE
Definition primnodes.h:1999
void AddQual(Query *parsetree, Node *qual)
Definition nodes.h:133

References AddQual(), fb(), IS_NOT_TRUE, and makeNode.

Referenced by CopyAndAddInvertedQual().

◆ AddQual()

void AddQual ( Query parsetree,
Node qual 
)
extern

Definition at line 1147 of file rewriteManip.c.

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

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

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

◆ adjust_relid_set()

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

Definition at line 760 of file rewriteManip.c.

761{
763 {
764 /* Ensure we have a modifiable copy */
765 relids = bms_copy(relids);
766 /* Remove old, add new */
767 relids = bms_del_member(relids, oldrelid);
769 relids = bms_add_member(relids, newrelid);
770 }
771 return relids;
772}
Bitmapset * bms_del_member(Bitmapset *a, int x)
Definition bitmapset.c:987
bool bms_is_member(int x, const Bitmapset *a)
Definition bitmapset.c:645
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition bitmapset.c:934
Bitmapset * bms_copy(const Bitmapset *a)
Definition bitmapset.c:123
#define IS_SPECIAL_VARNO(varno)
Definition primnodes.h:248

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

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

◆ ChangeVarNodes()

◆ ChangeVarNodesExtended()

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

Definition at line 665 of file rewriteManip.c.

667{
669
670 context.rt_index = rt_index;
671 context.new_index = new_index;
672 context.sublevels_up = sublevels_up;
673 context.callback = callback;
674
675 /*
676 * Must be prepared to start with a Query or a bare expression tree; if
677 * it's a Query, go straight to query_tree_walker to make sure that
678 * sublevels_up doesn't get incremented prematurely.
679 */
680 if (node && IsA(node, Query))
681 {
682 Query *qry = (Query *) node;
683
684 /*
685 * If we are starting at a Query, and sublevels_up is zero, then we
686 * must also fix rangetable indexes in the Query itself --- namely
687 * resultRelation, mergeTargetRelation, exclRelIndex and rowMarks
688 * entries. sublevels_up cannot be zero when recursing into a
689 * subquery, so there's no need to have the same logic inside
690 * ChangeVarNodes_walker.
691 */
692 if (sublevels_up == 0)
693 {
694 ListCell *l;
695
696 if (qry->resultRelation == rt_index)
697 qry->resultRelation = new_index;
698
699 if (qry->mergeTargetRelation == rt_index)
700 qry->mergeTargetRelation = new_index;
701
702 /* this is unlikely to ever be used, but ... */
703 if (qry->onConflict && qry->onConflict->exclRelIndex == rt_index)
704 qry->onConflict->exclRelIndex = new_index;
705
706 foreach(l, qry->rowMarks)
707 {
709
710 if (rc->rti == rt_index)
711 rc->rti = new_index;
712 }
713 }
714 query_tree_walker(qry, ChangeVarNodes_walker, &context, 0);
715 }
716 else
717 ChangeVarNodes_walker(node, &context);
718}
#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)
ChangeVarNodes_callback callback
List * rowMarks
Definition parsenodes.h:238
OnConflictExpr * onConflict
Definition parsenodes.h:208
static void callback(struct sockaddr *addr, struct sockaddr *mask, void *unused)

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_query(), remove_self_join_rel(), split_selfjoin_quals(), and update_eclasses().

◆ ChangeVarNodesWalkExpression()

bool ChangeVarNodesWalkExpression ( Node node,
ChangeVarNodes_context context 
)
extern

Definition at line 745 of file rewriteManip.c.

746{
747 return ChangeVarNodes_walker(node, context);
748}

References ChangeVarNodes_walker().

Referenced by replace_relid_callback().

◆ checkExprHasSubLink()

bool checkExprHasSubLink ( Node node)
extern

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)

References checkExprHasSubLink_walker(), fb(), 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 
)
extern

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
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 fb(), 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 
)
extern

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)

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

bool contain_windowfuncs ( Node node)
extern

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)

References contain_windowfuncs_walker(), fb(), and query_or_expression_tree_walker.

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

◆ getInsertSelectQuery()

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

Definition at line 1089 of file rewriteManip.c.

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

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

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

◆ IncrementVarSublevelsUp()

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

Definition at line 880 of file rewriteManip.c.

882{
884
885 context.delta_sublevels_up = delta_sublevels_up;
886 context.min_sublevels_up = min_sublevels_up;
887
888 /*
889 * Must be prepared to start with a Query or a bare expression tree; if
890 * it's a Query, we don't want to increment sublevels_up.
891 */
894 &context,
896}
#define QTW_EXAMINE_RTES_BEFORE
Definition nodeFuncs.h:27
static bool IncrementVarSublevelsUp_walker(Node *node, IncrementVarSublevelsUp_context *context)

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(), finalize_grouping_exprs_walker(), flatten_group_exprs_mutator(), flatten_join_alias_vars_mutator(), generate_setop_from_pathqueries(), inline_cte_walker(), pull_up_simple_subquery(), pullup_replace_vars_callback(), replace_outer_agg(), replace_outer_grouping(), replace_outer_returning(), ReplaceVarsFromTargetList_callback(), rewriteSearchAndCycle(), substitute_actual_parameters_in_from_mutator(), and substitute_grouped_columns_mutator().

◆ IncrementVarSublevelsUp_rtable()

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

Definition at line 903 of file rewriteManip.c.

905{
907
908 context.delta_sublevels_up = delta_sublevels_up;
909 context.min_sublevels_up = min_sublevels_up;
910
911 range_table_walker(rtable,
913 &context,
915}
#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 
)
extern

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)

References locate_agg_of_level_context::agg_location, fb(), 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)
extern

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)

References fb(), 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 
)
extern

Definition at line 1682 of file rewriteManip.c.

1686{
1688
1689 context.target_varno = target_varno;
1690 context.sublevels_up = sublevels_up;
1691 context.attno_map = attno_map;
1692 context.to_rowtype = to_rowtype;
1693 context.found_whole_row = found_whole_row;
1694
1695 *found_whole_row = false;
1696
1697 /*
1698 * Must be prepared to start with a Query or a bare expression tree; if
1699 * it's a Query, we don't want to increment sublevels_up.
1700 */
1703 &context,
1704 0);
1705}
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(), createTableConstraints(), ExecInitMerge(), ExecInitPartitionInfo(), expandTableLikeClause(), generateClonedExtStatsStmt(), generateClonedIndexStmt(), map_partition_varattnos(), and MergeAttributes().

◆ OffsetVarNodes()

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

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)

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

Definition at line 1057 of file rewriteManip.c.

1058{
1060
1061 context.rt_index = rt_index;
1062 context.sublevels_up = sublevels_up;
1063
1064 /*
1065 * Must be prepared to start with a Query or a bare expression tree; if
1066 * it's a Query, we don't want to increment sublevels_up.
1067 */
1070 &context,
1071 0);
1072}
static bool rangeTableEntry_used_walker(Node *node, rangeTableEntry_used_context *context)

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

◆ 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 
)
extern

Definition at line 1434 of file rewriteManip.c.

1438{
1439 Node *result;
1441
1442 context.callback = callback;
1443 context.callback_arg = callback_arg;
1444 context.target_varno = target_varno;
1445 context.sublevels_up = sublevels_up;
1446
1447 /*
1448 * We try to initialize inserted_sublink to true if there is no need to
1449 * detect new sublinks because the query already has some.
1450 */
1451 if (node && IsA(node, Query))
1452 context.inserted_sublink = ((Query *) node)->hasSubLinks;
1453 else if (outer_hasSubLinks)
1454 context.inserted_sublink = *outer_hasSubLinks;
1455 else
1456 context.inserted_sublink = false;
1457
1458 /*
1459 * Must be prepared to start with a Query or a bare expression tree; if
1460 * it's a Query, we don't want to increment sublevels_up.
1461 */
1464 &context,
1465 0);
1466
1467 if (context.inserted_sublink)
1468 {
1469 if (result && IsA(result, Query))
1470 ((Query *) result)->hasSubLinks = true;
1471 else if (outer_hasSubLinks)
1472 *outer_hasSubLinks = true;
1473 else
1474 elog(ERROR, "replace_rte_variables inserted a SubLink, but has noplace to record it");
1475 }
1476
1477 return result;
1478}
uint32 result
Node * replace_rte_variables_mutator(Node *node, replace_rte_variables_context *context)
replace_rte_variables_callback callback

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(), result, 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 
)
extern

Definition at line 1481 of file rewriteManip.c.

1483{
1484 if (node == NULL)
1485 return NULL;
1486 if (IsA(node, Var))
1487 {
1488 Var *var = (Var *) node;
1489
1490 if (var->varno == context->target_varno &&
1491 var->varlevelsup == context->sublevels_up)
1492 {
1493 /* Found a matching variable, make the substitution */
1494 Node *newnode;
1495
1496 newnode = context->callback(var, context);
1497 /* Detect if we are adding a sublink to query */
1498 if (!context->inserted_sublink)
1500 return newnode;
1501 }
1502 /* otherwise fall through to copy the var normally */
1503 }
1504 else if (IsA(node, Query))
1505 {
1506 /* Recurse into RTE subquery or not-yet-planned sublink subquery */
1507 Query *newnode;
1509
1510 context->sublevels_up++;
1512 context->inserted_sublink = ((Query *) node)->hasSubLinks;
1513 newnode = query_tree_mutator((Query *) node,
1515 context,
1516 0);
1517 newnode->hasSubLinks |= context->inserted_sublink;
1519 context->sublevels_up--;
1520 return (Node *) newnode;
1521 }
1523}
#define expression_tree_mutator(n, m, c)
Definition nodeFuncs.h:155
#define query_tree_mutator(q, m, c, f)
Definition nodeFuncs.h:160
int varno
Definition primnodes.h:270
Index varlevelsup
Definition primnodes.h:295

References replace_rte_variables_context::callback, checkExprHasSubLink(), expression_tree_mutator, fb(), 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 ( const Var var,
RangeTblEntry target_rte,
List targetlist,
int  result_relation,
ReplaceVarsNoMatchOption  nomatch_option,
int  nomatch_varno 
)
extern

Definition at line 1772 of file rewriteManip.c.

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

References RowExpr::args, COERCE_IMPLICIT_CAST, coerce_null_to_domain(), contains_multiexpr_param(), copyObject, elog, ereport, errcode(), errmsg, ERROR, expandRTE(), fb(), 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::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 
)
extern

Definition at line 1941 of file rewriteManip.c.

1949{
1951
1952 context.target_rte = target_rte;
1953 context.targetlist = targetlist;
1954 context.result_relation = result_relation;
1955 context.nomatch_option = nomatch_option;
1956 context.nomatch_varno = nomatch_varno;
1957
1958 return replace_rte_variables(node, target_varno, sublevels_up,
1960 &context,
1961 outer_hasSubLinks);
1962}
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(const 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::result_relation, ReplaceVarsFromTargetList_context::target_rte, and ReplaceVarsFromTargetList_context::targetlist.

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