PostgreSQL Source Code git master
ruleutils.c
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 *
3 * ruleutils.c
4 * Functions to convert stored expressions/querytrees back to
5 * source text
6 *
7 * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
8 * Portions Copyright (c) 1994, Regents of the University of California
9 *
10 *
11 * IDENTIFICATION
12 * src/backend/utils/adt/ruleutils.c
13 *
14 *-------------------------------------------------------------------------
15 */
16#include "postgres.h"
17
18#include <ctype.h>
19#include <unistd.h>
20#include <fcntl.h>
21
22#include "access/amapi.h"
23#include "access/htup_details.h"
24#include "access/relation.h"
25#include "access/table.h"
26#include "catalog/pg_aggregate.h"
27#include "catalog/pg_am.h"
28#include "catalog/pg_authid.h"
29#include "catalog/pg_collation.h"
30#include "catalog/pg_constraint.h"
31#include "catalog/pg_depend.h"
32#include "catalog/pg_language.h"
33#include "catalog/pg_opclass.h"
34#include "catalog/pg_operator.h"
35#include "catalog/pg_partitioned_table.h"
36#include "catalog/pg_proc.h"
37#include "catalog/pg_statistic_ext.h"
38#include "catalog/pg_trigger.h"
39#include "catalog/pg_type.h"
40#include "commands/defrem.h"
41#include "commands/tablespace.h"
42#include "common/keywords.h"
43#include "executor/spi.h"
44#include "funcapi.h"
45#include "mb/pg_wchar.h"
46#include "miscadmin.h"
47#include "nodes/makefuncs.h"
48#include "nodes/nodeFuncs.h"
49#include "nodes/pathnodes.h"
50#include "optimizer/optimizer.h"
51#include "parser/parse_agg.h"
52#include "parser/parse_func.h"
53#include "parser/parse_oper.h"
54#include "parser/parse_relation.h"
55#include "parser/parser.h"
56#include "parser/parsetree.h"
57#include "rewrite/rewriteHandler.h"
58#include "rewrite/rewriteManip.h"
59#include "rewrite/rewriteSupport.h"
60#include "utils/array.h"
61#include "utils/builtins.h"
62#include "utils/fmgroids.h"
63#include "utils/guc.h"
64#include "utils/hsearch.h"
65#include "utils/lsyscache.h"
66#include "utils/partcache.h"
67#include "utils/rel.h"
68#include "utils/ruleutils.h"
69#include "utils/snapmgr.h"
70#include "utils/syscache.h"
71#include "utils/typcache.h"
72#include "utils/varlena.h"
73#include "utils/xml.h"
74
75/* ----------
76 * Pretty formatting constants
77 * ----------
78 */
79
80/* Indent counts */
81#define PRETTYINDENT_STD 8
82#define PRETTYINDENT_JOIN 4
83#define PRETTYINDENT_VAR 4
84
85#define PRETTYINDENT_LIMIT 40 /* wrap limit */
86
87/* Pretty flags */
88#define PRETTYFLAG_PAREN 0x0001
89#define PRETTYFLAG_INDENT 0x0002
90#define PRETTYFLAG_SCHEMA 0x0004
91
92/* Standard conversion of a "bool pretty" option to detailed flags */
93#define GET_PRETTY_FLAGS(pretty) \
94 ((pretty) ? (PRETTYFLAG_PAREN | PRETTYFLAG_INDENT | PRETTYFLAG_SCHEMA) \
95 : PRETTYFLAG_INDENT)
96
97/* Default line length for pretty-print wrapping: 0 means wrap always */
98#define WRAP_COLUMN_DEFAULT 0
99
100/* macros to test if pretty action needed */
101#define PRETTY_PAREN(context) ((context)->prettyFlags & PRETTYFLAG_PAREN)
102#define PRETTY_INDENT(context) ((context)->prettyFlags & PRETTYFLAG_INDENT)
103#define PRETTY_SCHEMA(context) ((context)->prettyFlags & PRETTYFLAG_SCHEMA)
104
105
106/* ----------
107 * Local data types
108 * ----------
109 */
110
111/* Context info needed for invoking a recursive querytree display routine */
112typedef struct
113{
114 StringInfo buf; /* output buffer to append to */
115 List *namespaces; /* List of deparse_namespace nodes */
116 TupleDesc resultDesc; /* if top level of a view, the view's tupdesc */
117 List *targetList; /* Current query level's SELECT targetlist */
118 List *windowClause; /* Current query level's WINDOW clause */
119 int prettyFlags; /* enabling of pretty-print functions */
120 int wrapColumn; /* max line length, or -1 for no limit */
121 int indentLevel; /* current indent level for pretty-print */
122 bool varprefix; /* true to print prefixes on Vars */
123 bool colNamesVisible; /* do we care about output column names? */
124 bool inGroupBy; /* deparsing GROUP BY clause? */
125 bool varInOrderBy; /* deparsing simple Var in ORDER BY? */
126 Bitmapset *appendparents; /* if not null, map child Vars of these relids
127 * back to the parent rel */
128} deparse_context;
129
130/*
131 * Each level of query context around a subtree needs a level of Var namespace.
132 * A Var having varlevelsup=N refers to the N'th item (counting from 0) in
133 * the current context's namespaces list.
134 *
135 * rtable is the list of actual RTEs from the Query or PlannedStmt.
136 * rtable_names holds the alias name to be used for each RTE (either a C
137 * string, or NULL for nameless RTEs such as unnamed joins).
138 * rtable_columns holds the column alias names to be used for each RTE.
139 *
140 * subplans is a list of Plan trees for SubPlans and CTEs (it's only used
141 * in the PlannedStmt case).
142 * ctes is a list of CommonTableExpr nodes (only used in the Query case).
143 * appendrels, if not null (it's only used in the PlannedStmt case), is an
144 * array of AppendRelInfo nodes, indexed by child relid. We use that to map
145 * child-table Vars to their inheritance parents.
146 *
147 * In some cases we need to make names of merged JOIN USING columns unique
148 * across the whole query, not only per-RTE. If so, unique_using is true
149 * and using_names is a list of C strings representing names already assigned
150 * to USING columns.
151 *
152 * When deparsing plan trees, there is always just a single item in the
153 * deparse_namespace list (since a plan tree never contains Vars with
154 * varlevelsup > 0). We store the Plan node that is the immediate
155 * parent of the expression to be deparsed, as well as a list of that
156 * Plan's ancestors. In addition, we store its outer and inner subplan nodes,
157 * as well as their targetlists, and the index tlist if the current plan node
158 * might contain INDEX_VAR Vars. (These fields could be derived on-the-fly
159 * from the current Plan node, but it seems notationally clearer to set them
160 * up as separate fields.)
161 */
162typedef struct
163{
164 List *rtable; /* List of RangeTblEntry nodes */
165 List *rtable_names; /* Parallel list of names for RTEs */
166 List *rtable_columns; /* Parallel list of deparse_columns structs */
167 List *subplans; /* List of Plan trees for SubPlans */
168 List *ctes; /* List of CommonTableExpr nodes */
169 AppendRelInfo **appendrels; /* Array of AppendRelInfo nodes, or NULL */
170 char *ret_old_alias; /* alias for OLD in RETURNING list */
171 char *ret_new_alias; /* alias for NEW in RETURNING list */
172 /* Workspace for column alias assignment: */
173 bool unique_using; /* Are we making USING names globally unique */
174 List *using_names; /* List of assigned names for USING columns */
175 /* Remaining fields are used only when deparsing a Plan tree: */
176 Plan *plan; /* immediate parent of current expression */
177 List *ancestors; /* ancestors of plan */
178 Plan *outer_plan; /* outer subnode, or NULL if none */
179 Plan *inner_plan; /* inner subnode, or NULL if none */
180 List *outer_tlist; /* referent for OUTER_VAR Vars */
181 List *inner_tlist; /* referent for INNER_VAR Vars */
182 List *index_tlist; /* referent for INDEX_VAR Vars */
183 /* Special namespace representing a function signature: */
184 char *funcname;
185 int numargs;
186 char **argnames;
187} deparse_namespace;
188
189/*
190 * Per-relation data about column alias names.
191 *
192 * Selecting aliases is unreasonably complicated because of the need to dump
193 * rules/views whose underlying tables may have had columns added, deleted, or
194 * renamed since the query was parsed. We must nonetheless print the rule/view
195 * in a form that can be reloaded and will produce the same results as before.
196 *
197 * For each RTE used in the query, we must assign column aliases that are
198 * unique within that RTE. SQL does not require this of the original query,
199 * but due to factors such as *-expansion we need to be able to uniquely
200 * reference every column in a decompiled query. As long as we qualify all
201 * column references, per-RTE uniqueness is sufficient for that.
202 *
203 * However, we can't ensure per-column name uniqueness for unnamed join RTEs,
204 * since they just inherit column names from their input RTEs, and we can't
205 * rename the columns at the join level. Most of the time this isn't an issue
206 * because we don't need to reference the join's output columns as such; we
207 * can reference the input columns instead. That approach can fail for merged
208 * JOIN USING columns, however, so when we have one of those in an unnamed
209 * join, we have to make that column's alias globally unique across the whole
210 * query to ensure it can be referenced unambiguously.
211 *
212 * Another problem is that a JOIN USING clause requires the columns to be
213 * merged to have the same aliases in both input RTEs, and that no other
214 * columns in those RTEs or their children conflict with the USING names.
215 * To handle that, we do USING-column alias assignment in a recursive
216 * traversal of the query's jointree. When descending through a JOIN with
217 * USING, we preassign the USING column names to the child columns, overriding
218 * other rules for column alias assignment. We also mark each RTE with a list
219 * of all USING column names selected for joins containing that RTE, so that
220 * when we assign other columns' aliases later, we can avoid conflicts.
221 *
222 * Another problem is that if a JOIN's input tables have had columns added or
223 * deleted since the query was parsed, we must generate a column alias list
224 * for the join that matches the current set of input columns --- otherwise, a
225 * change in the number of columns in the left input would throw off matching
226 * of aliases to columns of the right input. Thus, positions in the printable
227 * column alias list are not necessarily one-for-one with varattnos of the
228 * JOIN, so we need a separate new_colnames[] array for printing purposes.
229 *
230 * Finally, when dealing with wide tables we risk O(N^2) costs in assigning
231 * non-duplicate column names. We ameliorate that by using a hash table that
232 * holds all the strings appearing in colnames, new_colnames, and parentUsing.
233 */
234typedef struct
235{
236 /*
237 * colnames is an array containing column aliases to use for columns that
238 * existed when the query was parsed. Dropped columns have NULL entries.
239 * This array can be directly indexed by varattno to get a Var's name.
240 *
241 * Non-NULL entries are guaranteed unique within the RTE, *except* when
242 * this is for an unnamed JOIN RTE. In that case we merely copy up names
243 * from the two input RTEs.
244 *
245 * During the recursive descent in set_using_names(), forcible assignment
246 * of a child RTE's column name is represented by pre-setting that element
247 * of the child's colnames array. So at that stage, NULL entries in this
248 * array just mean that no name has been preassigned, not necessarily that
249 * the column is dropped.
250 */
251 int num_cols; /* length of colnames[] array */
252 char **colnames; /* array of C strings and NULLs */
253
254 /*
255 * new_colnames is an array containing column aliases to use for columns
256 * that would exist if the query was re-parsed against the current
257 * definitions of its base tables. This is what to print as the column
258 * alias list for the RTE. This array does not include dropped columns,
259 * but it will include columns added since original parsing. Indexes in
260 * it therefore have little to do with current varattno values. As above,
261 * entries are unique unless this is for an unnamed JOIN RTE. (In such an
262 * RTE, we never actually print this array, but we must compute it anyway
263 * for possible use in computing column names of upper joins.) The
264 * parallel array is_new_col marks which of these columns are new since
265 * original parsing. Entries with is_new_col false must match the
266 * non-NULL colnames entries one-for-one.
267 */
268 int num_new_cols; /* length of new_colnames[] array */
269 char **new_colnames; /* array of C strings */
270 bool *is_new_col; /* array of bool flags */
271
272 /* This flag tells whether we should actually print a column alias list */
273 bool printaliases;
274
275 /* This list has all names used as USING names in joins above this RTE */
276 List *parentUsing; /* names assigned to parent merged columns */
277
278 /*
279 * If this struct is for a JOIN RTE, we fill these fields during the
280 * set_using_names() pass to describe its relationship to its child RTEs.
281 *
282 * leftattnos and rightattnos are arrays with one entry per existing
283 * output column of the join (hence, indexable by join varattno). For a
284 * simple reference to a column of the left child, leftattnos[i] is the
285 * child RTE's attno and rightattnos[i] is zero; and conversely for a
286 * column of the right child. But for merged columns produced by JOIN
287 * USING/NATURAL JOIN, both leftattnos[i] and rightattnos[i] are nonzero.
288 * Note that a simple reference might be to a child RTE column that's been
289 * dropped; but that's OK since the column could not be used in the query.
290 *
291 * If it's a JOIN USING, usingNames holds the alias names selected for the
292 * merged columns (these might be different from the original USING list,
293 * if we had to modify names to achieve uniqueness).
294 */
295 int leftrti; /* rangetable index of left child */
296 int rightrti; /* rangetable index of right child */
297 int *leftattnos; /* left-child varattnos of join cols, or 0 */
298 int *rightattnos; /* right-child varattnos of join cols, or 0 */
299 List *usingNames; /* names assigned to merged columns */
300
301 /*
302 * Hash table holding copies of all the strings appearing in this struct's
303 * colnames, new_colnames, and parentUsing. We use a hash table only for
304 * sufficiently wide relations, and only during the colname-assignment
305 * functions set_relation_column_names and set_join_column_names;
306 * otherwise, names_hash is NULL.
307 */
308 HTAB *names_hash; /* entries are just strings */
309} deparse_columns;
310
311/* This macro is analogous to rt_fetch(), but for deparse_columns structs */
312#define deparse_columns_fetch(rangetable_index, dpns) \
313 ((deparse_columns *) list_nth((dpns)->rtable_columns, (rangetable_index)-1))
314
315/*
316 * Entry in set_rtable_names' hash table
317 */
318typedef struct
319{
320 char name[NAMEDATALEN]; /* Hash key --- must be first */
321 int counter; /* Largest addition used so far for name */
322} NameHashEntry;
323
324/* Callback signature for resolve_special_varno() */
325typedef void (*rsv_callback) (Node *node, deparse_context *context,
326 void *callback_arg);
327
328
329/* ----------
330 * Global data
331 * ----------
332 */
333static SPIPlanPtr plan_getrulebyoid = NULL;
334static const char *const query_getrulebyoid = "SELECT * FROM pg_catalog.pg_rewrite WHERE oid = $1";
335static SPIPlanPtr plan_getviewrule = NULL;
336static const char *const query_getviewrule = "SELECT * FROM pg_catalog.pg_rewrite WHERE ev_class = $1 AND rulename = $2";
337
338/* GUC parameters */
339bool quote_all_identifiers = false;
340
341
342/* ----------
343 * Local functions
344 *
345 * Most of these functions used to use fixed-size buffers to build their
346 * results. Now, they take an (already initialized) StringInfo object
347 * as a parameter, and append their text output to its contents.
348 * ----------
349 */
350static char *deparse_expression_pretty(Node *expr, List *dpcontext,
351 bool forceprefix, bool showimplicit,
352 int prettyFlags, int startIndent);
353static char *pg_get_viewdef_worker(Oid viewoid,
354 int prettyFlags, int wrapColumn);
355static char *pg_get_triggerdef_worker(Oid trigid, bool pretty);
356static int decompile_column_index_array(Datum column_index_array, Oid relId,
357 bool withPeriod, StringInfo buf);
358static char *pg_get_ruledef_worker(Oid ruleoid, int prettyFlags);
359static char *pg_get_indexdef_worker(Oid indexrelid, int colno,
360 const Oid *excludeOps,
361 bool attrsOnly, bool keysOnly,
362 bool showTblSpc, bool inherits,
363 int prettyFlags, bool missing_ok);
364static char *pg_get_statisticsobj_worker(Oid statextid, bool columns_only,
365 bool missing_ok);
366static char *pg_get_partkeydef_worker(Oid relid, int prettyFlags,
367 bool attrsOnly, bool missing_ok);
368static char *pg_get_constraintdef_worker(Oid constraintId, bool fullCommand,
369 int prettyFlags, bool missing_ok);
370static text *pg_get_expr_worker(text *expr, Oid relid, int prettyFlags);
371static int print_function_arguments(StringInfo buf, HeapTuple proctup,
372 bool print_table_args, bool print_defaults);
373static void print_function_rettype(StringInfo buf, HeapTuple proctup);
374static void print_function_trftypes(StringInfo buf, HeapTuple proctup);
375static void print_function_sqlbody(StringInfo buf, HeapTuple proctup);
376static void set_rtable_names(deparse_namespace *dpns, List *parent_namespaces,
377 Bitmapset *rels_used);
378static void set_deparse_for_query(deparse_namespace *dpns, Query *query,
379 List *parent_namespaces);
380static void set_simple_column_names(deparse_namespace *dpns);
381static bool has_dangerous_join_using(deparse_namespace *dpns, Node *jtnode);
382static void set_using_names(deparse_namespace *dpns, Node *jtnode,
383 List *parentUsing);
384static void set_relation_column_names(deparse_namespace *dpns,
385 RangeTblEntry *rte,
386 deparse_columns *colinfo);
387static void set_join_column_names(deparse_namespace *dpns, RangeTblEntry *rte,
388 deparse_columns *colinfo);
389static bool colname_is_unique(const char *colname, deparse_namespace *dpns,
390 deparse_columns *colinfo);
391static char *make_colname_unique(char *colname, deparse_namespace *dpns,
392 deparse_columns *colinfo);
393static void expand_colnames_array_to(deparse_columns *colinfo, int n);
394static void build_colinfo_names_hash(deparse_columns *colinfo);
395static void add_to_names_hash(deparse_columns *colinfo, const char *name);
396static void destroy_colinfo_names_hash(deparse_columns *colinfo);
397static void identify_join_columns(JoinExpr *j, RangeTblEntry *jrte,
398 deparse_columns *colinfo);
399static char *get_rtable_name(int rtindex, deparse_context *context);
400static void set_deparse_plan(deparse_namespace *dpns, Plan *plan);
401static Plan *find_recursive_union(deparse_namespace *dpns,
402 WorkTableScan *wtscan);
403static void push_child_plan(deparse_namespace *dpns, Plan *plan,
404 deparse_namespace *save_dpns);
405static void pop_child_plan(deparse_namespace *dpns,
406 deparse_namespace *save_dpns);
407static void push_ancestor_plan(deparse_namespace *dpns, ListCell *ancestor_cell,
408 deparse_namespace *save_dpns);
409static void pop_ancestor_plan(deparse_namespace *dpns,
410 deparse_namespace *save_dpns);
411static void make_ruledef(StringInfo buf, HeapTuple ruletup, TupleDesc rulettc,
412 int prettyFlags);
413static void make_viewdef(StringInfo buf, HeapTuple ruletup, TupleDesc rulettc,
414 int prettyFlags, int wrapColumn);
415static void get_query_def(Query *query, StringInfo buf, List *parentnamespace,
416 TupleDesc resultDesc, bool colNamesVisible,
417 int prettyFlags, int wrapColumn, int startIndent);
418static void get_values_def(List *values_lists, deparse_context *context);
419static void get_with_clause(Query *query, deparse_context *context);
420static void get_select_query_def(Query *query, deparse_context *context);
421static void get_insert_query_def(Query *query, deparse_context *context);
422static void get_update_query_def(Query *query, deparse_context *context);
423static void get_update_query_targetlist_def(Query *query, List *targetList,
424 deparse_context *context,
425 RangeTblEntry *rte);
426static void get_delete_query_def(Query *query, deparse_context *context);
427static void get_merge_query_def(Query *query, deparse_context *context);
428static void get_utility_query_def(Query *query, deparse_context *context);
429static void get_basic_select_query(Query *query, deparse_context *context);
430static void get_target_list(List *targetList, deparse_context *context);
431static void get_returning_clause(Query *query, deparse_context *context);
432static void get_setop_query(Node *setOp, Query *query,
433 deparse_context *context);
434static Node *get_rule_sortgroupclause(Index ref, List *tlist,
435 bool force_colno,
436 deparse_context *context);
437static void get_rule_groupingset(GroupingSet *gset, List *targetlist,
438 bool omit_parens, deparse_context *context);
439static void get_rule_orderby(List *orderList, List *targetList,
440 bool force_colno, deparse_context *context);
441static void get_rule_windowclause(Query *query, deparse_context *context);
442static void get_rule_windowspec(WindowClause *wc, List *targetList,
443 deparse_context *context);
444static void get_window_frame_options(int frameOptions,
445 Node *startOffset, Node *endOffset,
446 deparse_context *context);
447static char *get_variable(Var *var, int levelsup, bool istoplevel,
448 deparse_context *context);
449static void get_special_variable(Node *node, deparse_context *context,
450 void *callback_arg);
451static void resolve_special_varno(Node *node, deparse_context *context,
452 rsv_callback callback, void *callback_arg);
453static Node *find_param_referent(Param *param, deparse_context *context,
454 deparse_namespace **dpns_p, ListCell **ancestor_cell_p);
455static SubPlan *find_param_generator(Param *param, deparse_context *context,
456 int *column_p);
457static SubPlan *find_param_generator_initplan(Param *param, Plan *plan,
458 int *column_p);
459static void get_parameter(Param *param, deparse_context *context);
460static const char *get_simple_binary_op_name(OpExpr *expr);
461static bool isSimpleNode(Node *node, Node *parentNode, int prettyFlags);
462static void appendContextKeyword(deparse_context *context, const char *str,
463 int indentBefore, int indentAfter, int indentPlus);
464static void removeStringInfoSpaces(StringInfo str);
465static void get_rule_expr(Node *node, deparse_context *context,
466 bool showimplicit);
467static void get_rule_expr_toplevel(Node *node, deparse_context *context,
468 bool showimplicit);
469static void get_rule_list_toplevel(List *lst, deparse_context *context,
470 bool showimplicit);
471static void get_rule_expr_funccall(Node *node, deparse_context *context,
472 bool showimplicit);
473static bool looks_like_function(Node *node);
474static void get_oper_expr(OpExpr *expr, deparse_context *context);
475static void get_func_expr(FuncExpr *expr, deparse_context *context,
476 bool showimplicit);
477static void get_agg_expr(Aggref *aggref, deparse_context *context,
478 Aggref *original_aggref);
479static void get_agg_expr_helper(Aggref *aggref, deparse_context *context,
480 Aggref *original_aggref, const char *funcname,
481 const char *options, bool is_json_objectagg);
482static void get_agg_combine_expr(Node *node, deparse_context *context,
483 void *callback_arg);
484static void get_windowfunc_expr(WindowFunc *wfunc, deparse_context *context);
485static void get_windowfunc_expr_helper(WindowFunc *wfunc, deparse_context *context,
486 const char *funcname, const char *options,
487 bool is_json_objectagg);
488static bool get_func_sql_syntax(FuncExpr *expr, deparse_context *context);
489static void get_coercion_expr(Node *arg, deparse_context *context,
490 Oid resulttype, int32 resulttypmod,
491 Node *parentNode);
492static void get_const_expr(Const *constval, deparse_context *context,
493 int showtype);
494static void get_const_collation(Const *constval, deparse_context *context);
495static void get_json_format(JsonFormat *format, StringInfo buf);
496static void get_json_returning(JsonReturning *returning, StringInfo buf,
497 bool json_format_by_default);
498static void get_json_constructor(JsonConstructorExpr *ctor,
499 deparse_context *context, bool showimplicit);
500static void get_json_constructor_options(JsonConstructorExpr *ctor,
501 StringInfo buf);
502static void get_json_agg_constructor(JsonConstructorExpr *ctor,
503 deparse_context *context,
504 const char *funcname,
505 bool is_json_objectagg);
506static void simple_quote_literal(StringInfo buf, const char *val);
507static void get_sublink_expr(SubLink *sublink, deparse_context *context);
508static void get_tablefunc(TableFunc *tf, deparse_context *context,
509 bool showimplicit);
510static void get_from_clause(Query *query, const char *prefix,
511 deparse_context *context);
512static void get_from_clause_item(Node *jtnode, Query *query,
513 deparse_context *context);
514static void get_rte_alias(RangeTblEntry *rte, int varno, bool use_as,
515 deparse_context *context);
516static void get_column_alias_list(deparse_columns *colinfo,
517 deparse_context *context);
518static void get_from_clause_coldeflist(RangeTblFunction *rtfunc,
519 deparse_columns *colinfo,
520 deparse_context *context);
521static void get_tablesample_def(TableSampleClause *tablesample,
522 deparse_context *context);
523static void get_opclass_name(Oid opclass, Oid actual_datatype,
524 StringInfo buf);
525static Node *processIndirection(Node *node, deparse_context *context);
526static void printSubscripts(SubscriptingRef *sbsref, deparse_context *context);
527static char *get_relation_name(Oid relid);
528static char *generate_relation_name(Oid relid, List *namespaces);
529static char *generate_qualified_relation_name(Oid relid);
530static char *generate_function_name(Oid funcid, int nargs,
531 List *argnames, Oid *argtypes,
532 bool has_variadic, bool *use_variadic_p,
533 bool inGroupBy);
534static char *generate_operator_name(Oid operid, Oid arg1, Oid arg2);
535static void add_cast_to(StringInfo buf, Oid typid);
536static char *generate_qualified_type_name(Oid typid);
537static text *string_to_text(char *str);
538static char *flatten_reloptions(Oid relid);
539static void get_reloptions(StringInfo buf, Datum reloptions);
540static void get_json_path_spec(Node *path_spec, deparse_context *context,
541 bool showimplicit);
542static void get_json_table_columns(TableFunc *tf, JsonTablePathScan *scan,
543 deparse_context *context,
544 bool showimplicit);
545static void get_json_table_nested_columns(TableFunc *tf, JsonTablePlan *plan,
546 deparse_context *context,
547 bool showimplicit,
548 bool needcomma);
549
550#define only_marker(rte) ((rte)->inh ? "" : "ONLY ")
551
552
553/* ----------
554 * pg_get_ruledef - Do it all and return a text
555 * that could be used as a statement
556 * to recreate the rule
557 * ----------
558 */
559Datum
560pg_get_ruledef(PG_FUNCTION_ARGS)
561{
562 Oid ruleoid = PG_GETARG_OID(0);
563 int prettyFlags;
564 char *res;
565
566 prettyFlags = PRETTYFLAG_INDENT;
567
568 res = pg_get_ruledef_worker(ruleoid, prettyFlags);
569
570 if (res == NULL)
571 PG_RETURN_NULL();
572
573 PG_RETURN_TEXT_P(string_to_text(res));
574}
575
576
577Datum
578pg_get_ruledef_ext(PG_FUNCTION_ARGS)
579{
580 Oid ruleoid = PG_GETARG_OID(0);
581 bool pretty = PG_GETARG_BOOL(1);
582 int prettyFlags;
583 char *res;
584
585 prettyFlags = GET_PRETTY_FLAGS(pretty);
586
587 res = pg_get_ruledef_worker(ruleoid, prettyFlags);
588
589 if (res == NULL)
590 PG_RETURN_NULL();
591
592 PG_RETURN_TEXT_P(string_to_text(res));
593}
594
595
596static char *
597pg_get_ruledef_worker(Oid ruleoid, int prettyFlags)
598{
599 Datum args[1];
600 char nulls[1];
601 int spirc;
602 HeapTuple ruletup;
603 TupleDesc rulettc;
604 StringInfoData buf;
605
606 /*
607 * Do this first so that string is alloc'd in outer context not SPI's.
608 */
609 initStringInfo(&buf);
610
611 /*
612 * Connect to SPI manager
613 */
614 SPI_connect();
615
616 /*
617 * On the first call prepare the plan to lookup pg_rewrite. We read
618 * pg_rewrite over the SPI manager instead of using the syscache to be
619 * checked for read access on pg_rewrite.
620 */
621 if (plan_getrulebyoid == NULL)
622 {
623 Oid argtypes[1];
624 SPIPlanPtr plan;
625
626 argtypes[0] = OIDOID;
627 plan = SPI_prepare(query_getrulebyoid, 1, argtypes);
628 if (plan == NULL)
629 elog(ERROR, "SPI_prepare failed for \"%s\"", query_getrulebyoid);
630 SPI_keepplan(plan);
631 plan_getrulebyoid = plan;
632 }
633
634 /*
635 * Get the pg_rewrite tuple for this rule
636 */
637 args[0] = ObjectIdGetDatum(ruleoid);
638 nulls[0] = ' ';
639 spirc = SPI_execute_plan(plan_getrulebyoid, args, nulls, true, 0);
640 if (spirc != SPI_OK_SELECT)
641 elog(ERROR, "failed to get pg_rewrite tuple for rule %u", ruleoid);
642 if (SPI_processed != 1)
643 {
644 /*
645 * There is no tuple data available here, just keep the output buffer
646 * empty.
647 */
648 }
649 else
650 {
651 /*
652 * Get the rule's definition and put it into executor's memory
653 */
654 ruletup = SPI_tuptable->vals[0];
655 rulettc = SPI_tuptable->tupdesc;
656 make_ruledef(&buf, ruletup, rulettc, prettyFlags);
657 }
658
659 /*
660 * Disconnect from SPI manager
661 */
662 if (SPI_finish() != SPI_OK_FINISH)
663 elog(ERROR, "SPI_finish failed");
664
665 if (buf.len == 0)
666 return NULL;
667
668 return buf.data;
669}
670
671
672/* ----------
673 * pg_get_viewdef - Mainly the same thing, but we
674 * only return the SELECT part of a view
675 * ----------
676 */
677Datum
678pg_get_viewdef(PG_FUNCTION_ARGS)
679{
680 /* By OID */
681 Oid viewoid = PG_GETARG_OID(0);
682 int prettyFlags;
683 char *res;
684
685 prettyFlags = PRETTYFLAG_INDENT;
686
687 res = pg_get_viewdef_worker(viewoid, prettyFlags, WRAP_COLUMN_DEFAULT);
688
689 if (res == NULL)
690 PG_RETURN_NULL();
691
692 PG_RETURN_TEXT_P(string_to_text(res));
693}
694
695
696Datum
697pg_get_viewdef_ext(PG_FUNCTION_ARGS)
698{
699 /* By OID */
700 Oid viewoid = PG_GETARG_OID(0);
701 bool pretty = PG_GETARG_BOOL(1);
702 int prettyFlags;
703 char *res;
704
705 prettyFlags = GET_PRETTY_FLAGS(pretty);
706
707 res = pg_get_viewdef_worker(viewoid, prettyFlags, WRAP_COLUMN_DEFAULT);
708
709 if (res == NULL)
710 PG_RETURN_NULL();
711
712 PG_RETURN_TEXT_P(string_to_text(res));
713}
714
715Datum
716pg_get_viewdef_wrap(PG_FUNCTION_ARGS)
717{
718 /* By OID */
719 Oid viewoid = PG_GETARG_OID(0);
720 int wrap = PG_GETARG_INT32(1);
721 int prettyFlags;
722 char *res;
723
724 /* calling this implies we want pretty printing */
725 prettyFlags = GET_PRETTY_FLAGS(true);
726
727 res = pg_get_viewdef_worker(viewoid, prettyFlags, wrap);
728
729 if (res == NULL)
730 PG_RETURN_NULL();
731
732 PG_RETURN_TEXT_P(string_to_text(res));
733}
734
735Datum
736pg_get_viewdef_name(PG_FUNCTION_ARGS)
737{
738 /* By qualified name */
739 text *viewname = PG_GETARG_TEXT_PP(0);
740 int prettyFlags;
741 RangeVar *viewrel;
742 Oid viewoid;
743 char *res;
744
745 prettyFlags = PRETTYFLAG_INDENT;
746
747 /* Look up view name. Can't lock it - we might not have privileges. */
748 viewrel = makeRangeVarFromNameList(textToQualifiedNameList(viewname));
749 viewoid = RangeVarGetRelid(viewrel, NoLock, false);
750
751 res = pg_get_viewdef_worker(viewoid, prettyFlags, WRAP_COLUMN_DEFAULT);
752
753 if (res == NULL)
754 PG_RETURN_NULL();
755
756 PG_RETURN_TEXT_P(string_to_text(res));
757}
758
759
760Datum
761pg_get_viewdef_name_ext(PG_FUNCTION_ARGS)
762{
763 /* By qualified name */
764 text *viewname = PG_GETARG_TEXT_PP(0);
765 bool pretty = PG_GETARG_BOOL(1);
766 int prettyFlags;
767 RangeVar *viewrel;
768 Oid viewoid;
769 char *res;
770
771 prettyFlags = GET_PRETTY_FLAGS(pretty);
772
773 /* Look up view name. Can't lock it - we might not have privileges. */
774 viewrel = makeRangeVarFromNameList(textToQualifiedNameList(viewname));
775 viewoid = RangeVarGetRelid(viewrel, NoLock, false);
776
777 res = pg_get_viewdef_worker(viewoid, prettyFlags, WRAP_COLUMN_DEFAULT);
778
779 if (res == NULL)
780 PG_RETURN_NULL();
781
782 PG_RETURN_TEXT_P(string_to_text(res));
783}
784
785/*
786 * Common code for by-OID and by-name variants of pg_get_viewdef
787 */
788static char *
789pg_get_viewdef_worker(Oid viewoid, int prettyFlags, int wrapColumn)
790{
791 Datum args[2];
792 char nulls[2];
793 int spirc;
794 HeapTuple ruletup;
795 TupleDesc rulettc;
796 StringInfoData buf;
797
798 /*
799 * Do this first so that string is alloc'd in outer context not SPI's.
800 */
801 initStringInfo(&buf);
802
803 /*
804 * Connect to SPI manager
805 */
806 SPI_connect();
807
808 /*
809 * On the first call prepare the plan to lookup pg_rewrite. We read
810 * pg_rewrite over the SPI manager instead of using the syscache to be
811 * checked for read access on pg_rewrite.
812 */
813 if (plan_getviewrule == NULL)
814 {
815 Oid argtypes[2];
816 SPIPlanPtr plan;
817
818 argtypes[0] = OIDOID;
819 argtypes[1] = NAMEOID;
820 plan = SPI_prepare(query_getviewrule, 2, argtypes);
821 if (plan == NULL)
822 elog(ERROR, "SPI_prepare failed for \"%s\"", query_getviewrule);
823 SPI_keepplan(plan);
824 plan_getviewrule = plan;
825 }
826
827 /*
828 * Get the pg_rewrite tuple for the view's SELECT rule
829 */
830 args[0] = ObjectIdGetDatum(viewoid);
831 args[1] = DirectFunctionCall1(namein, CStringGetDatum(ViewSelectRuleName));
832 nulls[0] = ' ';
833 nulls[1] = ' ';
834 spirc = SPI_execute_plan(plan_getviewrule, args, nulls, true, 0);
835 if (spirc != SPI_OK_SELECT)
836 elog(ERROR, "failed to get pg_rewrite tuple for view %u", viewoid);
837 if (SPI_processed != 1)
838 {
839 /*
840 * There is no tuple data available here, just keep the output buffer
841 * empty.
842 */
843 }
844 else
845 {
846 /*
847 * Get the rule's definition and put it into executor's memory
848 */
849 ruletup = SPI_tuptable->vals[0];
850 rulettc = SPI_tuptable->tupdesc;
851 make_viewdef(&buf, ruletup, rulettc, prettyFlags, wrapColumn);
852 }
853
854 /*
855 * Disconnect from SPI manager
856 */
857 if (SPI_finish() != SPI_OK_FINISH)
858 elog(ERROR, "SPI_finish failed");
859
860 if (buf.len == 0)
861 return NULL;
862
863 return buf.data;
864}
865
866/* ----------
867 * pg_get_triggerdef - Get the definition of a trigger
868 * ----------
869 */
870Datum
871pg_get_triggerdef(PG_FUNCTION_ARGS)
872{
873 Oid trigid = PG_GETARG_OID(0);
874 char *res;
875
876 res = pg_get_triggerdef_worker(trigid, false);
877
878 if (res == NULL)
879 PG_RETURN_NULL();
880
881 PG_RETURN_TEXT_P(string_to_text(res));
882}
883
884Datum
885pg_get_triggerdef_ext(PG_FUNCTION_ARGS)
886{
887 Oid trigid = PG_GETARG_OID(0);
888 bool pretty = PG_GETARG_BOOL(1);
889 char *res;
890
891 res = pg_get_triggerdef_worker(trigid, pretty);
892
893 if (res == NULL)
894 PG_RETURN_NULL();
895
896 PG_RETURN_TEXT_P(string_to_text(res));
897}
898
899static char *
900pg_get_triggerdef_worker(Oid trigid, bool pretty)
901{
902 HeapTuple ht_trig;
903 Form_pg_trigger trigrec;
904 StringInfoData buf;
905 Relation tgrel;
906 ScanKeyData skey[1];
907 SysScanDesc tgscan;
908 int findx = 0;
909 char *tgname;
910 char *tgoldtable;
911 char *tgnewtable;
912 Datum value;
913 bool isnull;
914
915 /*
916 * Fetch the pg_trigger tuple by the Oid of the trigger
917 */
918 tgrel = table_open(TriggerRelationId, AccessShareLock);
919
920 ScanKeyInit(&skey[0],
921 Anum_pg_trigger_oid,
922 BTEqualStrategyNumber, F_OIDEQ,
923 ObjectIdGetDatum(trigid));
924
925 tgscan = systable_beginscan(tgrel, TriggerOidIndexId, true,
926 NULL, 1, skey);
927
928 ht_trig = systable_getnext(tgscan);
929
930 if (!HeapTupleIsValid(ht_trig))
931 {
932 systable_endscan(tgscan);
933 table_close(tgrel, AccessShareLock);
934 return NULL;
935 }
936
937 trigrec = (Form_pg_trigger) GETSTRUCT(ht_trig);
938
939 /*
940 * Start the trigger definition. Note that the trigger's name should never
941 * be schema-qualified, but the trigger rel's name may be.
942 */
943 initStringInfo(&buf);
944
945 tgname = NameStr(trigrec->tgname);
946 appendStringInfo(&buf, "CREATE %sTRIGGER %s ",
947 OidIsValid(trigrec->tgconstraint) ? "CONSTRAINT " : "",
948 quote_identifier(tgname));
949
950 if (TRIGGER_FOR_BEFORE(trigrec->tgtype))
951 appendStringInfoString(&buf, "BEFORE");
952 else if (TRIGGER_FOR_AFTER(trigrec->tgtype))
953 appendStringInfoString(&buf, "AFTER");
954 else if (TRIGGER_FOR_INSTEAD(trigrec->tgtype))
955 appendStringInfoString(&buf, "INSTEAD OF");
956 else
957 elog(ERROR, "unexpected tgtype value: %d", trigrec->tgtype);
958
959 if (TRIGGER_FOR_INSERT(trigrec->tgtype))
960 {
961 appendStringInfoString(&buf, " INSERT");
962 findx++;
963 }
964 if (TRIGGER_FOR_DELETE(trigrec->tgtype))
965 {
966 if (findx > 0)
967 appendStringInfoString(&buf, " OR DELETE");
968 else
969 appendStringInfoString(&buf, " DELETE");
970 findx++;
971 }
972 if (TRIGGER_FOR_UPDATE(trigrec->tgtype))
973 {
974 if (findx > 0)
975 appendStringInfoString(&buf, " OR UPDATE");
976 else
977 appendStringInfoString(&buf, " UPDATE");
978 findx++;
979 /* tgattr is first var-width field, so OK to access directly */
980 if (trigrec->tgattr.dim1 > 0)
981 {
982 int i;
983
984 appendStringInfoString(&buf, " OF ");
985 for (i = 0; i < trigrec->tgattr.dim1; i++)
986 {
987 char *attname;
988
989 if (i > 0)
990 appendStringInfoString(&buf, ", ");
991 attname = get_attname(trigrec->tgrelid,
992 trigrec->tgattr.values[i], false);
993 appendStringInfoString(&buf, quote_identifier(attname));
994 }
995 }
996 }
997 if (TRIGGER_FOR_TRUNCATE(trigrec->tgtype))
998 {
999 if (findx > 0)
1000 appendStringInfoString(&buf, " OR TRUNCATE");
1001 else
1002 appendStringInfoString(&buf, " TRUNCATE");
1003 findx++;
1004 }
1005
1006 /*
1007 * In non-pretty mode, always schema-qualify the target table name for
1008 * safety. In pretty mode, schema-qualify only if not visible.
1009 */
1010 appendStringInfo(&buf, " ON %s ",
1011 pretty ?
1012 generate_relation_name(trigrec->tgrelid, NIL) :
1013 generate_qualified_relation_name(trigrec->tgrelid));
1014
1015 if (OidIsValid(trigrec->tgconstraint))
1016 {
1017 if (OidIsValid(trigrec->tgconstrrelid))
1018 appendStringInfo(&buf, "FROM %s ",
1019 generate_relation_name(trigrec->tgconstrrelid, NIL));
1020 if (!trigrec->tgdeferrable)
1021 appendStringInfoString(&buf, "NOT ");
1022 appendStringInfoString(&buf, "DEFERRABLE INITIALLY ");
1023 if (trigrec->tginitdeferred)
1024 appendStringInfoString(&buf, "DEFERRED ");
1025 else
1026 appendStringInfoString(&buf, "IMMEDIATE ");
1027 }
1028
1029 value = fastgetattr(ht_trig, Anum_pg_trigger_tgoldtable,
1030 tgrel->rd_att, &isnull);
1031 if (!isnull)
1032 tgoldtable = NameStr(*DatumGetName(value));
1033 else
1034 tgoldtable = NULL;
1035 value = fastgetattr(ht_trig, Anum_pg_trigger_tgnewtable,
1036 tgrel->rd_att, &isnull);
1037 if (!isnull)
1038 tgnewtable = NameStr(*DatumGetName(value));
1039 else
1040 tgnewtable = NULL;
1041 if (tgoldtable != NULL || tgnewtable != NULL)
1042 {
1043 appendStringInfoString(&buf, "REFERENCING ");
1044 if (tgoldtable != NULL)
1045 appendStringInfo(&buf, "OLD TABLE AS %s ",
1046 quote_identifier(tgoldtable));
1047 if (tgnewtable != NULL)
1048 appendStringInfo(&buf, "NEW TABLE AS %s ",
1049 quote_identifier(tgnewtable));
1050 }
1051
1052 if (TRIGGER_FOR_ROW(trigrec->tgtype))
1053 appendStringInfoString(&buf, "FOR EACH ROW ");
1054 else
1055 appendStringInfoString(&buf, "FOR EACH STATEMENT ");
1056
1057 /* If the trigger has a WHEN qualification, add that */
1058 value = fastgetattr(ht_trig, Anum_pg_trigger_tgqual,
1059 tgrel->rd_att, &isnull);
1060 if (!isnull)
1061 {
1062 Node *qual;
1063 char relkind;
1064 deparse_context context;
1065 deparse_namespace dpns;
1066 RangeTblEntry *oldrte;
1067 RangeTblEntry *newrte;
1068
1069 appendStringInfoString(&buf, "WHEN (");
1070
1071 qual = stringToNode(TextDatumGetCString(value));
1072
1073 relkind = get_rel_relkind(trigrec->tgrelid);
1074
1075 /* Build minimal OLD and NEW RTEs for the rel */
1076 oldrte = makeNode(RangeTblEntry);
1077 oldrte->rtekind = RTE_RELATION;
1078 oldrte->relid = trigrec->tgrelid;
1079 oldrte->relkind = relkind;
1080 oldrte->rellockmode = AccessShareLock;
1081 oldrte->alias = makeAlias("old", NIL);
1082 oldrte->eref = oldrte->alias;
1083 oldrte->lateral = false;
1084 oldrte->inh = false;
1085 oldrte->inFromCl = true;
1086
1087 newrte = makeNode(RangeTblEntry);
1088 newrte->rtekind = RTE_RELATION;
1089 newrte->relid = trigrec->tgrelid;
1090 newrte->relkind = relkind;
1091 newrte->rellockmode = AccessShareLock;
1092 newrte->alias = makeAlias("new", NIL);
1093 newrte->eref = newrte->alias;
1094 newrte->lateral = false;
1095 newrte->inh = false;
1096 newrte->inFromCl = true;
1097
1098 /* Build two-element rtable */
1099 memset(&dpns, 0, sizeof(dpns));
1100 dpns.rtable = list_make2(oldrte, newrte);
1101 dpns.subplans = NIL;
1102 dpns.ctes = NIL;
1103 dpns.appendrels = NULL;
1104 set_rtable_names(&dpns, NIL, NULL);
1105 set_simple_column_names(&dpns);
1106
1107 /* Set up context with one-deep namespace stack */
1108 context.buf = &buf;
1109 context.namespaces = list_make1(&dpns);
1110 context.resultDesc = NULL;
1111 context.targetList = NIL;
1112 context.windowClause = NIL;
1113 context.varprefix = true;
1114 context.prettyFlags = GET_PRETTY_FLAGS(pretty);
1115 context.wrapColumn = WRAP_COLUMN_DEFAULT;
1116 context.indentLevel = PRETTYINDENT_STD;
1117 context.colNamesVisible = true;
1118 context.inGroupBy = false;
1119 context.varInOrderBy = false;
1120 context.appendparents = NULL;
1121
1122 get_rule_expr(qual, &context, false);
1123
1124 appendStringInfoString(&buf, ") ");
1125 }
1126
1127 appendStringInfo(&buf, "EXECUTE FUNCTION %s(",
1128 generate_function_name(trigrec->tgfoid, 0,
1129 NIL, NULL,
1130 false, NULL, false));
1131
1132 if (trigrec->tgnargs > 0)
1133 {
1134 char *p;
1135 int i;
1136
1137 value = fastgetattr(ht_trig, Anum_pg_trigger_tgargs,
1138 tgrel->rd_att, &isnull);
1139 if (isnull)
1140 elog(ERROR, "tgargs is null for trigger %u", trigid);
1141 p = (char *) VARDATA_ANY(DatumGetByteaPP(value));
1142 for (i = 0; i < trigrec->tgnargs; i++)
1143 {
1144 if (i > 0)
1145 appendStringInfoString(&buf, ", ");
1146 simple_quote_literal(&buf, p);
1147 /* advance p to next string embedded in tgargs */
1148 while (*p)
1149 p++;
1150 p++;
1151 }
1152 }
1153
1154 /* We deliberately do not put semi-colon at end */
1155 appendStringInfoChar(&buf, ')');
1156
1157 /* Clean up */
1158 systable_endscan(tgscan);
1159
1160 table_close(tgrel, AccessShareLock);
1161
1162 return buf.data;
1163}
1164
1165/* ----------
1166 * pg_get_indexdef - Get the definition of an index
1167 *
1168 * In the extended version, there is a colno argument as well as pretty bool.
1169 * if colno == 0, we want a complete index definition.
1170 * if colno > 0, we only want the Nth index key's variable or expression.
1171 *
1172 * Note that the SQL-function versions of this omit any info about the
1173 * index tablespace; this is intentional because pg_dump wants it that way.
1174 * However pg_get_indexdef_string() includes the index tablespace.
1175 * ----------
1176 */
1177Datum
1178pg_get_indexdef(PG_FUNCTION_ARGS)
1179{
1180 Oid indexrelid = PG_GETARG_OID(0);
1181 int prettyFlags;
1182 char *res;
1183
1184 prettyFlags = PRETTYFLAG_INDENT;
1185
1186 res = pg_get_indexdef_worker(indexrelid, 0, NULL,
1187 false, false,
1188 false, false,
1189 prettyFlags, true);
1190
1191 if (res == NULL)
1192 PG_RETURN_NULL();
1193
1194 PG_RETURN_TEXT_P(string_to_text(res));
1195}
1196
1197Datum
1198pg_get_indexdef_ext(PG_FUNCTION_ARGS)
1199{
1200 Oid indexrelid = PG_GETARG_OID(0);
1201 int32 colno = PG_GETARG_INT32(1);
1202 bool pretty = PG_GETARG_BOOL(2);
1203 int prettyFlags;
1204 char *res;
1205
1206 prettyFlags = GET_PRETTY_FLAGS(pretty);
1207
1208 res = pg_get_indexdef_worker(indexrelid, colno, NULL,
1209 colno != 0, false,
1210 false, false,
1211 prettyFlags, true);
1212
1213 if (res == NULL)
1214 PG_RETURN_NULL();
1215
1216 PG_RETURN_TEXT_P(string_to_text(res));
1217}
1218
1219/*
1220 * Internal version for use by ALTER TABLE.
1221 * Includes a tablespace clause in the result.
1222 * Returns a palloc'd C string; no pretty-printing.
1223 */
1224char *
1225pg_get_indexdef_string(Oid indexrelid)
1226{
1227 return pg_get_indexdef_worker(indexrelid, 0, NULL,
1228 false, false,
1229 true, true,
1230 0, false);
1231}
1232
1233/* Internal version that just reports the key-column definitions */
1234char *
1235pg_get_indexdef_columns(Oid indexrelid, bool pretty)
1236{
1237 int prettyFlags;
1238
1239 prettyFlags = GET_PRETTY_FLAGS(pretty);
1240
1241 return pg_get_indexdef_worker(indexrelid, 0, NULL,
1242 true, true,
1243 false, false,
1244 prettyFlags, false);
1245}
1246
1247/* Internal version, extensible with flags to control its behavior */
1248char *
1249pg_get_indexdef_columns_extended(Oid indexrelid, bits16 flags)
1250{
1251 bool pretty = ((flags & RULE_INDEXDEF_PRETTY) != 0);
1252 bool keys_only = ((flags & RULE_INDEXDEF_KEYS_ONLY) != 0);
1253 int prettyFlags;
1254
1255 prettyFlags = GET_PRETTY_FLAGS(pretty);
1256
1257 return pg_get_indexdef_worker(indexrelid, 0, NULL,
1258 true, keys_only,
1259 false, false,
1260 prettyFlags, false);
1261}
1262
1263/*
1264 * Internal workhorse to decompile an index definition.
1265 *
1266 * This is now used for exclusion constraints as well: if excludeOps is not
1267 * NULL then it points to an array of exclusion operator OIDs.
1268 */
1269static char *
1270pg_get_indexdef_worker(Oid indexrelid, int colno,
1271 const Oid *excludeOps,
1272 bool attrsOnly, bool keysOnly,
1273 bool showTblSpc, bool inherits,
1274 int prettyFlags, bool missing_ok)
1275{
1276 /* might want a separate isConstraint parameter later */
1277 bool isConstraint = (excludeOps != NULL);
1278 HeapTuple ht_idx;
1279 HeapTuple ht_idxrel;
1280 HeapTuple ht_am;
1281 Form_pg_index idxrec;
1282 Form_pg_class idxrelrec;
1283 Form_pg_am amrec;
1284 IndexAmRoutine *amroutine;
1285 List *indexprs;
1286 ListCell *indexpr_item;
1287 List *context;
1288 Oid indrelid;
1289 int keyno;
1290 Datum indcollDatum;
1291 Datum indclassDatum;
1292 Datum indoptionDatum;
1293 oidvector *indcollation;
1294 oidvector *indclass;
1295 int2vector *indoption;
1296 StringInfoData buf;
1297 char *str;
1298 char *sep;
1299
1300 /*
1301 * Fetch the pg_index tuple by the Oid of the index
1302 */
1303 ht_idx = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexrelid));
1304 if (!HeapTupleIsValid(ht_idx))
1305 {
1306 if (missing_ok)
1307 return NULL;
1308 elog(ERROR, "cache lookup failed for index %u", indexrelid);
1309 }
1310 idxrec = (Form_pg_index) GETSTRUCT(ht_idx);
1311
1312 indrelid = idxrec->indrelid;
1313 Assert(indexrelid == idxrec->indexrelid);
1314
1315 /* Must get indcollation, indclass, and indoption the hard way */
1316 indcollDatum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1317 Anum_pg_index_indcollation);
1318 indcollation = (oidvector *) DatumGetPointer(indcollDatum);
1319
1320 indclassDatum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1321 Anum_pg_index_indclass);
1322 indclass = (oidvector *) DatumGetPointer(indclassDatum);
1323
1324 indoptionDatum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1325 Anum_pg_index_indoption);
1326 indoption = (int2vector *) DatumGetPointer(indoptionDatum);
1327
1328 /*
1329 * Fetch the pg_class tuple of the index relation
1330 */
1331 ht_idxrel = SearchSysCache1(RELOID, ObjectIdGetDatum(indexrelid));
1332 if (!HeapTupleIsValid(ht_idxrel))
1333 elog(ERROR, "cache lookup failed for relation %u", indexrelid);
1334 idxrelrec = (Form_pg_class) GETSTRUCT(ht_idxrel);
1335
1336 /*
1337 * Fetch the pg_am tuple of the index' access method
1338 */
1339 ht_am = SearchSysCache1(AMOID, ObjectIdGetDatum(idxrelrec->relam));
1340 if (!HeapTupleIsValid(ht_am))
1341 elog(ERROR, "cache lookup failed for access method %u",
1342 idxrelrec->relam);
1343 amrec = (Form_pg_am) GETSTRUCT(ht_am);
1344
1345 /* Fetch the index AM's API struct */
1346 amroutine = GetIndexAmRoutine(amrec->amhandler);
1347
1348 /*
1349 * Get the index expressions, if any. (NOTE: we do not use the relcache
1350 * versions of the expressions and predicate, because we want to display
1351 * non-const-folded expressions.)
1352 */
1353 if (!heap_attisnull(ht_idx, Anum_pg_index_indexprs, NULL))
1354 {
1355 Datum exprsDatum;
1356 char *exprsString;
1357
1358 exprsDatum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1359 Anum_pg_index_indexprs);
1360 exprsString = TextDatumGetCString(exprsDatum);
1361 indexprs = (List *) stringToNode(exprsString);
1362 pfree(exprsString);
1363 }
1364 else
1365 indexprs = NIL;
1366
1367 indexpr_item = list_head(indexprs);
1368
1369 context = deparse_context_for(get_relation_name(indrelid), indrelid);
1370
1371 /*
1372 * Start the index definition. Note that the index's name should never be
1373 * schema-qualified, but the indexed rel's name may be.
1374 */
1375 initStringInfo(&buf);
1376
1377 if (!attrsOnly)
1378 {
1379 if (!isConstraint)
1380 appendStringInfo(&buf, "CREATE %sINDEX %s ON %s%s USING %s (",
1381 idxrec->indisunique ? "UNIQUE " : "",
1382 quote_identifier(NameStr(idxrelrec->relname)),
1383 idxrelrec->relkind == RELKIND_PARTITIONED_INDEX
1384 && !inherits ? "ONLY " : "",
1385 (prettyFlags & PRETTYFLAG_SCHEMA) ?
1386 generate_relation_name(indrelid, NIL) :
1387 generate_qualified_relation_name(indrelid),
1388 quote_identifier(NameStr(amrec->amname)));
1389 else /* currently, must be EXCLUDE constraint */
1390 appendStringInfo(&buf, "EXCLUDE USING %s (",
1391 quote_identifier(NameStr(amrec->amname)));
1392 }
1393
1394 /*
1395 * Report the indexed attributes
1396 */
1397 sep = "";
1398 for (keyno = 0; keyno < idxrec->indnatts; keyno++)
1399 {
1400 AttrNumber attnum = idxrec->indkey.values[keyno];
1401 Oid keycoltype;
1402 Oid keycolcollation;
1403
1404 /*
1405 * Ignore non-key attributes if told to.
1406 */
1407 if (keysOnly && keyno >= idxrec->indnkeyatts)
1408 break;
1409
1410 /* Otherwise, print INCLUDE to divide key and non-key attrs. */
1411 if (!colno && keyno == idxrec->indnkeyatts)
1412 {
1413 appendStringInfoString(&buf, ") INCLUDE (");
1414 sep = "";
1415 }
1416
1417 if (!colno)
1418 appendStringInfoString(&buf, sep);
1419 sep = ", ";
1420
1421 if (attnum != 0)
1422 {
1423 /* Simple index column */
1424 char *attname;
1425 int32 keycoltypmod;
1426
1427 attname = get_attname(indrelid, attnum, false);
1428 if (!colno || colno == keyno + 1)
1429 appendStringInfoString(&buf, quote_identifier(attname));
1430 get_atttypetypmodcoll(indrelid, attnum,
1431 &keycoltype, &keycoltypmod,
1432 &keycolcollation);
1433 }
1434 else
1435 {
1436 /* expressional index */
1437 Node *indexkey;
1438
1439 if (indexpr_item == NULL)
1440 elog(ERROR, "too few entries in indexprs list");
1441 indexkey = (Node *) lfirst(indexpr_item);
1442 indexpr_item = lnext(indexprs, indexpr_item);
1443 /* Deparse */
1444 str = deparse_expression_pretty(indexkey, context, false, false,
1445 prettyFlags, 0);
1446 if (!colno || colno == keyno + 1)
1447 {
1448 /* Need parens if it's not a bare function call */
1449 if (looks_like_function(indexkey))
1450 appendStringInfoString(&buf, str);
1451 else
1452 appendStringInfo(&buf, "(%s)", str);
1453 }
1454 keycoltype = exprType(indexkey);
1455 keycolcollation = exprCollation(indexkey);
1456 }
1457
1458 /* Print additional decoration for (selected) key columns */
1459 if (!attrsOnly && keyno < idxrec->indnkeyatts &&
1460 (!colno || colno == keyno + 1))
1461 {
1462 int16 opt = indoption->values[keyno];
1463 Oid indcoll = indcollation->values[keyno];
1464 Datum attoptions = get_attoptions(indexrelid, keyno + 1);
1465 bool has_options = attoptions != (Datum) 0;
1466
1467 /* Add collation, if not default for column */
1468 if (OidIsValid(indcoll) && indcoll != keycolcollation)
1469 appendStringInfo(&buf, " COLLATE %s",
1470 generate_collation_name((indcoll)));
1471
1472 /* Add the operator class name, if not default */
1473 get_opclass_name(indclass->values[keyno],
1474 has_options ? InvalidOid : keycoltype, &buf);
1475
1476 if (has_options)
1477 {
1478 appendStringInfoString(&buf, " (");
1479 get_reloptions(&buf, attoptions);
1480 appendStringInfoChar(&buf, ')');
1481 }
1482
1483 /* Add options if relevant */
1484 if (amroutine->amcanorder)
1485 {
1486 /* if it supports sort ordering, report DESC and NULLS opts */
1487 if (opt & INDOPTION_DESC)
1488 {
1489 appendStringInfoString(&buf, " DESC");
1490 /* NULLS FIRST is the default in this case */
1491 if (!(opt & INDOPTION_NULLS_FIRST))
1492 appendStringInfoString(&buf, " NULLS LAST");
1493 }
1494 else
1495 {
1496 if (opt & INDOPTION_NULLS_FIRST)
1497 appendStringInfoString(&buf, " NULLS FIRST");
1498 }
1499 }
1500
1501 /* Add the exclusion operator if relevant */
1502 if (excludeOps != NULL)
1503 appendStringInfo(&buf, " WITH %s",
1504 generate_operator_name(excludeOps[keyno],
1505 keycoltype,
1506 keycoltype));
1507 }
1508 }
1509
1510 if (!attrsOnly)
1511 {
1512 appendStringInfoChar(&buf, ')');
1513
1514 if (idxrec->indnullsnotdistinct)
1515 appendStringInfoString(&buf, " NULLS NOT DISTINCT");
1516
1517 /*
1518 * If it has options, append "WITH (options)"
1519 */
1520 str = flatten_reloptions(indexrelid);
1521 if (str)
1522 {
1523 appendStringInfo(&buf, " WITH (%s)", str);
1524 pfree(str);
1525 }
1526
1527 /*
1528 * Print tablespace, but only if requested
1529 */
1530 if (showTblSpc)
1531 {
1532 Oid tblspc;
1533
1534 tblspc = get_rel_tablespace(indexrelid);
1535 if (OidIsValid(tblspc))
1536 {
1537 if (isConstraint)
1538 appendStringInfoString(&buf, " USING INDEX");
1539 appendStringInfo(&buf, " TABLESPACE %s",
1540 quote_identifier(get_tablespace_name(tblspc)));
1541 }
1542 }
1543
1544 /*
1545 * If it's a partial index, decompile and append the predicate
1546 */
1547 if (!heap_attisnull(ht_idx, Anum_pg_index_indpred, NULL))
1548 {
1549 Node *node;
1550 Datum predDatum;
1551 char *predString;
1552
1553 /* Convert text string to node tree */
1554 predDatum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1555 Anum_pg_index_indpred);
1556 predString = TextDatumGetCString(predDatum);
1557 node = (Node *) stringToNode(predString);
1558 pfree(predString);
1559
1560 /* Deparse */
1561 str = deparse_expression_pretty(node, context, false, false,
1562 prettyFlags, 0);
1563 if (isConstraint)
1564 appendStringInfo(&buf, " WHERE (%s)", str);
1565 else
1566 appendStringInfo(&buf, " WHERE %s", str);
1567 }
1568 }
1569
1570 /* Clean up */
1571 ReleaseSysCache(ht_idx);
1572 ReleaseSysCache(ht_idxrel);
1573 ReleaseSysCache(ht_am);
1574
1575 return buf.data;
1576}
1577
1578/* ----------
1579 * pg_get_querydef
1580 *
1581 * Public entry point to deparse one query parsetree.
1582 * The pretty flags are determined by GET_PRETTY_FLAGS(pretty).
1583 *
1584 * The result is a palloc'd C string.
1585 * ----------
1586 */
1587char *
1588pg_get_querydef(Query *query, bool pretty)
1589{
1590 StringInfoData buf;
1591 int prettyFlags;
1592
1593 prettyFlags = GET_PRETTY_FLAGS(pretty);
1594
1595 initStringInfo(&buf);
1596
1597 get_query_def(query, &buf, NIL, NULL, true,
1598 prettyFlags, WRAP_COLUMN_DEFAULT, 0);
1599
1600 return buf.data;
1601}
1602
1603/*
1604 * pg_get_statisticsobjdef
1605 * Get the definition of an extended statistics object
1606 */
1607Datum
1608pg_get_statisticsobjdef(PG_FUNCTION_ARGS)
1609{
1610 Oid statextid = PG_GETARG_OID(0);
1611 char *res;
1612
1613 res = pg_get_statisticsobj_worker(statextid, false, true);
1614
1615 if (res == NULL)
1616 PG_RETURN_NULL();
1617
1618 PG_RETURN_TEXT_P(string_to_text(res));
1619}
1620
1621/*
1622 * Internal version for use by ALTER TABLE.
1623 * Includes a tablespace clause in the result.
1624 * Returns a palloc'd C string; no pretty-printing.
1625 */
1626char *
1627pg_get_statisticsobjdef_string(Oid statextid)
1628{
1629 return pg_get_statisticsobj_worker(statextid, false, false);
1630}
1631
1632/*
1633 * pg_get_statisticsobjdef_columns
1634 * Get columns and expressions for an extended statistics object
1635 */
1636Datum
1637pg_get_statisticsobjdef_columns(PG_FUNCTION_ARGS)
1638{
1639 Oid statextid = PG_GETARG_OID(0);
1640 char *res;
1641
1642 res = pg_get_statisticsobj_worker(statextid, true, true);
1643
1644 if (res == NULL)
1645 PG_RETURN_NULL();
1646
1647 PG_RETURN_TEXT_P(string_to_text(res));
1648}
1649
1650/*
1651 * Internal workhorse to decompile an extended statistics object.
1652 */
1653static char *
1654pg_get_statisticsobj_worker(Oid statextid, bool columns_only, bool missing_ok)
1655{
1656 Form_pg_statistic_ext statextrec;
1657 HeapTuple statexttup;
1658 StringInfoData buf;
1659 int colno;
1660 char *nsp;
1661 ArrayType *arr;
1662 char *enabled;
1663 Datum datum;
1664 bool ndistinct_enabled;
1665 bool dependencies_enabled;
1666 bool mcv_enabled;
1667 int i;
1668 List *context;
1669 ListCell *lc;
1670 List *exprs = NIL;
1671 bool has_exprs;
1672 int ncolumns;
1673
1674 statexttup = SearchSysCache1(STATEXTOID, ObjectIdGetDatum(statextid));
1675
1676 if (!HeapTupleIsValid(statexttup))
1677 {
1678 if (missing_ok)
1679 return NULL;
1680 elog(ERROR, "cache lookup failed for statistics object %u", statextid);
1681 }
1682
1683 /* has the statistics expressions? */
1684 has_exprs = !heap_attisnull(statexttup, Anum_pg_statistic_ext_stxexprs, NULL);
1685
1686 statextrec = (Form_pg_statistic_ext) GETSTRUCT(statexttup);
1687
1688 /*
1689 * Get the statistics expressions, if any. (NOTE: we do not use the
1690 * relcache versions of the expressions, because we want to display
1691 * non-const-folded expressions.)
1692 */
1693 if (has_exprs)
1694 {
1695 Datum exprsDatum;
1696 char *exprsString;
1697
1698 exprsDatum = SysCacheGetAttrNotNull(STATEXTOID, statexttup,
1699 Anum_pg_statistic_ext_stxexprs);
1700 exprsString = TextDatumGetCString(exprsDatum);
1701 exprs = (List *) stringToNode(exprsString);
1702 pfree(exprsString);
1703 }
1704 else
1705 exprs = NIL;
1706
1707 /* count the number of columns (attributes and expressions) */
1708 ncolumns = statextrec->stxkeys.dim1 + list_length(exprs);
1709
1710 initStringInfo(&buf);
1711
1712 if (!columns_only)
1713 {
1714 nsp = get_namespace_name_or_temp(statextrec->stxnamespace);
1715 appendStringInfo(&buf, "CREATE STATISTICS %s",
1716 quote_qualified_identifier(nsp,
1717 NameStr(statextrec->stxname)));
1718
1719 /*
1720 * Decode the stxkind column so that we know which stats types to
1721 * print.
1722 */
1723 datum = SysCacheGetAttrNotNull(STATEXTOID, statexttup,
1724 Anum_pg_statistic_ext_stxkind);
1725 arr = DatumGetArrayTypeP(datum);
1726 if (ARR_NDIM(arr) != 1 ||
1727 ARR_HASNULL(arr) ||
1728 ARR_ELEMTYPE(arr) != CHAROID)
1729 elog(ERROR, "stxkind is not a 1-D char array");
1730 enabled = (char *) ARR_DATA_PTR(arr);
1731
1732 ndistinct_enabled = false;
1733 dependencies_enabled = false;
1734 mcv_enabled = false;
1735
1736 for (i = 0; i < ARR_DIMS(arr)[0]; i++)
1737 {
1738 if (enabled[i] == STATS_EXT_NDISTINCT)
1739 ndistinct_enabled = true;
1740 else if (enabled[i] == STATS_EXT_DEPENDENCIES)
1741 dependencies_enabled = true;
1742 else if (enabled[i] == STATS_EXT_MCV)
1743 mcv_enabled = true;
1744
1745 /* ignore STATS_EXT_EXPRESSIONS (it's built automatically) */
1746 }
1747
1748 /*
1749 * If any option is disabled, then we'll need to append the types
1750 * clause to show which options are enabled. We omit the types clause
1751 * on purpose when all options are enabled, so a pg_dump/pg_restore
1752 * will create all statistics types on a newer postgres version, if
1753 * the statistics had all options enabled on the original version.
1754 *
1755 * But if the statistics is defined on just a single column, it has to
1756 * be an expression statistics. In that case we don't need to specify
1757 * kinds.
1758 */
1759 if ((!ndistinct_enabled || !dependencies_enabled || !mcv_enabled) &&
1760 (ncolumns > 1))
1761 {
1762 bool gotone = false;
1763
1764 appendStringInfoString(&buf, " (");
1765
1766 if (ndistinct_enabled)
1767 {
1768 appendStringInfoString(&buf, "ndistinct");
1769 gotone = true;
1770 }
1771
1772 if (dependencies_enabled)
1773 {
1774 appendStringInfo(&buf, "%sdependencies", gotone ? ", " : "");
1775 gotone = true;
1776 }
1777
1778 if (mcv_enabled)
1779 appendStringInfo(&buf, "%smcv", gotone ? ", " : "");
1780
1781 appendStringInfoChar(&buf, ')');
1782 }
1783
1784 appendStringInfoString(&buf, " ON ");
1785 }
1786
1787 /* decode simple column references */
1788 for (colno = 0; colno < statextrec->stxkeys.dim1; colno++)
1789 {
1790 AttrNumber attnum = statextrec->stxkeys.values[colno];
1791 char *attname;
1792
1793 if (colno > 0)
1794 appendStringInfoString(&buf, ", ");
1795
1796 attname = get_attname(statextrec->stxrelid, attnum, false);
1797
1798 appendStringInfoString(&buf, quote_identifier(attname));
1799 }
1800
1801 context = deparse_context_for(get_relation_name(statextrec->stxrelid),
1802 statextrec->stxrelid);
1803
1804 foreach(lc, exprs)
1805 {
1806 Node *expr = (Node *) lfirst(lc);
1807 char *str;
1808 int prettyFlags = PRETTYFLAG_PAREN;
1809
1810 str = deparse_expression_pretty(expr, context, false, false,
1811 prettyFlags, 0);
1812
1813 if (colno > 0)
1814 appendStringInfoString(&buf, ", ");
1815
1816 /* Need parens if it's not a bare function call */
1817 if (looks_like_function(expr))
1818 appendStringInfoString(&buf, str);
1819 else
1820 appendStringInfo(&buf, "(%s)", str);
1821
1822 colno++;
1823 }
1824
1825 if (!columns_only)
1826 appendStringInfo(&buf, " FROM %s",
1827 generate_relation_name(statextrec->stxrelid, NIL));
1828
1829 ReleaseSysCache(statexttup);
1830
1831 return buf.data;
1832}
1833
1834/*
1835 * Generate text array of expressions for statistics object.
1836 */
1837Datum
1838pg_get_statisticsobjdef_expressions(PG_FUNCTION_ARGS)
1839{
1840 Oid statextid = PG_GETARG_OID(0);
1841 Form_pg_statistic_ext statextrec;
1842 HeapTuple statexttup;
1843 Datum datum;
1844 List *context;
1845 ListCell *lc;
1846 List *exprs = NIL;
1847 bool has_exprs;
1848 char *tmp;
1849 ArrayBuildState *astate = NULL;
1850
1851 statexttup = SearchSysCache1(STATEXTOID, ObjectIdGetDatum(statextid));
1852
1853 if (!HeapTupleIsValid(statexttup))
1854 PG_RETURN_NULL();
1855
1856 /* Does the stats object have expressions? */
1857 has_exprs = !heap_attisnull(statexttup, Anum_pg_statistic_ext_stxexprs, NULL);
1858
1859 /* no expressions? we're done */
1860 if (!has_exprs)
1861 {
1862 ReleaseSysCache(statexttup);
1863 PG_RETURN_NULL();
1864 }
1865
1866 statextrec = (Form_pg_statistic_ext) GETSTRUCT(statexttup);
1867
1868 /*
1869 * Get the statistics expressions, and deparse them into text values.
1870 */
1871 datum = SysCacheGetAttrNotNull(STATEXTOID, statexttup,
1872 Anum_pg_statistic_ext_stxexprs);
1873 tmp = TextDatumGetCString(datum);
1874 exprs = (List *) stringToNode(tmp);
1875 pfree(tmp);
1876
1877 context = deparse_context_for(get_relation_name(statextrec->stxrelid),
1878 statextrec->stxrelid);
1879
1880 foreach(lc, exprs)
1881 {
1882 Node *expr = (Node *) lfirst(lc);
1883 char *str;
1884 int prettyFlags = PRETTYFLAG_INDENT;
1885
1886 str = deparse_expression_pretty(expr, context, false, false,
1887 prettyFlags, 0);
1888
1889 astate = accumArrayResult(astate,
1890 PointerGetDatum(cstring_to_text(str)),
1891 false,
1892 TEXTOID,
1893 CurrentMemoryContext);
1894 }
1895
1896 ReleaseSysCache(statexttup);
1897
1898 PG_RETURN_DATUM(makeArrayResult(astate, CurrentMemoryContext));
1899}
1900
1901/*
1902 * pg_get_partkeydef
1903 *
1904 * Returns the partition key specification, ie, the following:
1905 *
1906 * { RANGE | LIST | HASH } (column opt_collation opt_opclass [, ...])
1907 */
1908Datum
1909pg_get_partkeydef(PG_FUNCTION_ARGS)
1910{
1911 Oid relid = PG_GETARG_OID(0);
1912 char *res;
1913
1914 res = pg_get_partkeydef_worker(relid, PRETTYFLAG_INDENT, false, true);
1915
1916 if (res == NULL)
1917 PG_RETURN_NULL();
1918
1919 PG_RETURN_TEXT_P(string_to_text(res));
1920}
1921
1922/* Internal version that just reports the column definitions */
1923char *
1924pg_get_partkeydef_columns(Oid relid, bool pretty)
1925{
1926 int prettyFlags;
1927
1928 prettyFlags = GET_PRETTY_FLAGS(pretty);
1929
1930 return pg_get_partkeydef_worker(relid, prettyFlags, true, false);
1931}
1932
1933/*
1934 * Internal workhorse to decompile a partition key definition.
1935 */
1936static char *
1937pg_get_partkeydef_worker(Oid relid, int prettyFlags,
1938 bool attrsOnly, bool missing_ok)
1939{
1940 Form_pg_partitioned_table form;
1941 HeapTuple tuple;
1942 oidvector *partclass;
1943 oidvector *partcollation;
1944 List *partexprs;
1945 ListCell *partexpr_item;
1946 List *context;
1947 Datum datum;
1948 StringInfoData buf;
1949 int keyno;
1950 char *str;
1951 char *sep;
1952
1953 tuple = SearchSysCache1(PARTRELID, ObjectIdGetDatum(relid));
1954 if (!HeapTupleIsValid(tuple))
1955 {
1956 if (missing_ok)
1957 return NULL;
1958 elog(ERROR, "cache lookup failed for partition key of %u", relid);
1959 }
1960
1961 form = (Form_pg_partitioned_table) GETSTRUCT(tuple);
1962
1963 Assert(form->partrelid == relid);
1964
1965 /* Must get partclass and partcollation the hard way */
1966 datum = SysCacheGetAttrNotNull(PARTRELID, tuple,
1967 Anum_pg_partitioned_table_partclass);
1968 partclass = (oidvector *) DatumGetPointer(datum);
1969
1970 datum = SysCacheGetAttrNotNull(PARTRELID, tuple,
1971 Anum_pg_partitioned_table_partcollation);
1972 partcollation = (oidvector *) DatumGetPointer(datum);
1973
1974
1975 /*
1976 * Get the expressions, if any. (NOTE: we do not use the relcache
1977 * versions of the expressions, because we want to display
1978 * non-const-folded expressions.)
1979 */
1980 if (!heap_attisnull(tuple, Anum_pg_partitioned_table_partexprs, NULL))
1981 {
1982 Datum exprsDatum;
1983 char *exprsString;
1984
1985 exprsDatum = SysCacheGetAttrNotNull(PARTRELID, tuple,
1986 Anum_pg_partitioned_table_partexprs);
1987 exprsString = TextDatumGetCString(exprsDatum);
1988 partexprs = (List *) stringToNode(exprsString);
1989
1990 if (!IsA(partexprs, List))
1991 elog(ERROR, "unexpected node type found in partexprs: %d",
1992 (int) nodeTag(partexprs));
1993
1994 pfree(exprsString);
1995 }
1996 else
1997 partexprs = NIL;
1998
1999 partexpr_item = list_head(partexprs);
2000 context = deparse_context_for(get_relation_name(relid), relid);
2001
2002 initStringInfo(&buf);
2003
2004 switch (form->partstrat)
2005 {
2006 case PARTITION_STRATEGY_HASH:
2007 if (!attrsOnly)
2008 appendStringInfoString(&buf, "HASH");
2009 break;
2010 case PARTITION_STRATEGY_LIST:
2011 if (!attrsOnly)
2012 appendStringInfoString(&buf, "LIST");
2013 break;
2014 case PARTITION_STRATEGY_RANGE:
2015 if (!attrsOnly)
2016 appendStringInfoString(&buf, "RANGE");
2017 break;
2018 default:
2019 elog(ERROR, "unexpected partition strategy: %d",
2020 (int) form->partstrat);
2021 }
2022
2023 if (!attrsOnly)
2024 appendStringInfoString(&buf, " (");
2025 sep = "";
2026 for (keyno = 0; keyno < form->partnatts; keyno++)
2027 {
2028 AttrNumber attnum = form->partattrs.values[keyno];
2029 Oid keycoltype;
2030 Oid keycolcollation;
2031 Oid partcoll;
2032
2033 appendStringInfoString(&buf, sep);
2034 sep = ", ";
2035 if (attnum != 0)
2036 {
2037 /* Simple attribute reference */
2038 char *attname;
2039 int32 keycoltypmod;
2040
2041 attname = get_attname(relid, attnum, false);
2042 appendStringInfoString(&buf, quote_identifier(attname));
2043 get_atttypetypmodcoll(relid, attnum,
2044 &keycoltype, &keycoltypmod,
2045 &keycolcollation);
2046 }
2047 else
2048 {
2049 /* Expression */
2050 Node *partkey;
2051
2052 if (partexpr_item == NULL)
2053 elog(ERROR, "too few entries in partexprs list");
2054 partkey = (Node *) lfirst(partexpr_item);
2055 partexpr_item = lnext(partexprs, partexpr_item);
2056
2057 /* Deparse */
2058 str = deparse_expression_pretty(partkey, context, false, false,
2059 prettyFlags, 0);
2060 /* Need parens if it's not a bare function call */
2061 if (looks_like_function(partkey))
2062 appendStringInfoString(&buf, str);
2063 else
2064 appendStringInfo(&buf, "(%s)", str);
2065
2066 keycoltype = exprType(partkey);
2067 keycolcollation = exprCollation(partkey);
2068 }
2069
2070 /* Add collation, if not default for column */
2071 partcoll = partcollation->values[keyno];
2072 if (!attrsOnly && OidIsValid(partcoll) && partcoll != keycolcollation)
2073 appendStringInfo(&buf, " COLLATE %s",
2074 generate_collation_name((partcoll)));
2075
2076 /* Add the operator class name, if not default */
2077 if (!attrsOnly)
2078 get_opclass_name(partclass->values[keyno], keycoltype, &buf);
2079 }
2080
2081 if (!attrsOnly)
2082 appendStringInfoChar(&buf, ')');
2083
2084 /* Clean up */
2085 ReleaseSysCache(tuple);
2086
2087 return buf.data;
2088}
2089
2090/*
2091 * pg_get_partition_constraintdef
2092 *
2093 * Returns partition constraint expression as a string for the input relation
2094 */
2095Datum
2096pg_get_partition_constraintdef(PG_FUNCTION_ARGS)
2097{
2098 Oid relationId = PG_GETARG_OID(0);
2099 Expr *constr_expr;
2100 int prettyFlags;
2101 List *context;
2102 char *consrc;
2103
2104 constr_expr = get_partition_qual_relid(relationId);
2105
2106 /* Quick exit if no partition constraint */
2107 if (constr_expr == NULL)
2108 PG_RETURN_NULL();
2109
2110 /*
2111 * Deparse and return the constraint expression.
2112 */
2113 prettyFlags = PRETTYFLAG_INDENT;
2114 context = deparse_context_for(get_relation_name(relationId), relationId);
2115 consrc = deparse_expression_pretty((Node *) constr_expr, context, false,
2116 false, prettyFlags, 0);
2117
2118 PG_RETURN_TEXT_P(string_to_text(consrc));
2119}
2120
2121/*
2122 * pg_get_partconstrdef_string
2123 *
2124 * Returns the partition constraint as a C-string for the input relation, with
2125 * the given alias. No pretty-printing.
2126 */
2127char *
2128pg_get_partconstrdef_string(Oid partitionId, char *aliasname)
2129{
2130 Expr *constr_expr;
2131 List *context;
2132
2133 constr_expr = get_partition_qual_relid(partitionId);
2134 context = deparse_context_for(aliasname, partitionId);
2135
2136 return deparse_expression((Node *) constr_expr, context, true, false);
2137}
2138
2139/*
2140 * pg_get_constraintdef
2141 *
2142 * Returns the definition for the constraint, ie, everything that needs to
2143 * appear after "ALTER TABLE ... ADD CONSTRAINT <constraintname>".
2144 */
2145Datum
2146pg_get_constraintdef(PG_FUNCTION_ARGS)
2147{
2148 Oid constraintId = PG_GETARG_OID(0);
2149 int prettyFlags;
2150 char *res;
2151
2152 prettyFlags = PRETTYFLAG_INDENT;
2153
2154 res = pg_get_constraintdef_worker(constraintId, false, prettyFlags, true);
2155
2156 if (res == NULL)
2157 PG_RETURN_NULL();
2158
2159 PG_RETURN_TEXT_P(string_to_text(res));
2160}
2161
2162Datum
2163pg_get_constraintdef_ext(PG_FUNCTION_ARGS)
2164{
2165 Oid constraintId = PG_GETARG_OID(0);
2166 bool pretty = PG_GETARG_BOOL(1);
2167 int prettyFlags;
2168 char *res;
2169
2170 prettyFlags = GET_PRETTY_FLAGS(pretty);
2171
2172 res = pg_get_constraintdef_worker(constraintId, false, prettyFlags, true);
2173
2174 if (res == NULL)
2175 PG_RETURN_NULL();
2176
2177 PG_RETURN_TEXT_P(string_to_text(res));
2178}
2179
2180/*
2181 * Internal version that returns a full ALTER TABLE ... ADD CONSTRAINT command
2182 */
2183char *
2184pg_get_constraintdef_command(Oid constraintId)
2185{
2186 return pg_get_constraintdef_worker(constraintId, true, 0, false);
2187}
2188
2189/*
2190 * As of 9.4, we now use an MVCC snapshot for this.
2191 */
2192static char *
2193pg_get_constraintdef_worker(Oid constraintId, bool fullCommand,
2194 int prettyFlags, bool missing_ok)
2195{
2196 HeapTuple tup;
2197 Form_pg_constraint conForm;
2198 StringInfoData buf;
2199 SysScanDesc scandesc;
2200 ScanKeyData scankey[1];
2201 Snapshot snapshot = RegisterSnapshot(GetTransactionSnapshot());
2202 Relation relation = table_open(ConstraintRelationId, AccessShareLock);
2203
2204 ScanKeyInit(&scankey[0],
2205 Anum_pg_constraint_oid,
2206 BTEqualStrategyNumber, F_OIDEQ,
2207 ObjectIdGetDatum(constraintId));
2208
2209 scandesc = systable_beginscan(relation,
2210 ConstraintOidIndexId,
2211 true,
2212 snapshot,
2213 1,
2214 scankey);
2215
2216 /*
2217 * We later use the tuple with SysCacheGetAttr() as if we had obtained it
2218 * via SearchSysCache, which works fine.
2219 */
2220 tup = systable_getnext(scandesc);
2221
2222 UnregisterSnapshot(snapshot);
2223
2224 if (!HeapTupleIsValid(tup))
2225 {
2226 if (missing_ok)
2227 {
2228 systable_endscan(scandesc);
2229 table_close(relation, AccessShareLock);
2230 return NULL;
2231 }
2232 elog(ERROR, "could not find tuple for constraint %u", constraintId);
2233 }
2234
2235 conForm = (Form_pg_constraint) GETSTRUCT(tup);
2236
2237 initStringInfo(&buf);
2238
2239 if (fullCommand)
2240 {
2241 if (OidIsValid(conForm->conrelid))
2242 {
2243 /*
2244 * Currently, callers want ALTER TABLE (without ONLY) for CHECK
2245 * constraints, and other types of constraints don't inherit
2246 * anyway so it doesn't matter whether we say ONLY or not. Someday
2247 * we might need to let callers specify whether to put ONLY in the
2248 * command.
2249 */
2250 appendStringInfo(&buf, "ALTER TABLE %s ADD CONSTRAINT %s ",
2251 generate_qualified_relation_name(conForm->conrelid),
2252 quote_identifier(NameStr(conForm->conname)));
2253 }
2254 else
2255 {
2256 /* Must be a domain constraint */
2257 Assert(OidIsValid(conForm->contypid));
2258 appendStringInfo(&buf, "ALTER DOMAIN %s ADD CONSTRAINT %s ",
2259 generate_qualified_type_name(conForm->contypid),
2260 quote_identifier(NameStr(conForm->conname)));
2261 }
2262 }
2263
2264 switch (conForm->contype)
2265 {
2266 case CONSTRAINT_FOREIGN:
2267 {
2268 Datum val;
2269 bool isnull;
2270 const char *string;
2271
2272 /* Start off the constraint definition */
2273 appendStringInfoString(&buf, "FOREIGN KEY (");
2274
2275 /* Fetch and build referencing-column list */
2276 val = SysCacheGetAttrNotNull(CONSTROID, tup,
2277 Anum_pg_constraint_conkey);
2278
2279 /* If it is a temporal foreign key then it uses PERIOD. */
2280 decompile_column_index_array(val, conForm->conrelid, conForm->conperiod, &buf);
2281
2282 /* add foreign relation name */
2283 appendStringInfo(&buf, ") REFERENCES %s(",
2284 generate_relation_name(conForm->confrelid,
2285 NIL));
2286
2287 /* Fetch and build referenced-column list */
2288 val = SysCacheGetAttrNotNull(CONSTROID, tup,
2289 Anum_pg_constraint_confkey);
2290
2291 decompile_column_index_array(val, conForm->confrelid, conForm->conperiod, &buf);
2292
2293 appendStringInfoChar(&buf, ')');
2294
2295 /* Add match type */
2296 switch (conForm->confmatchtype)
2297 {
2298 case FKCONSTR_MATCH_FULL:
2299 string = " MATCH FULL";
2300 break;
2301 case FKCONSTR_MATCH_PARTIAL:
2302 string = " MATCH PARTIAL";
2303 break;
2304 case FKCONSTR_MATCH_SIMPLE:
2305 string = "";
2306 break;
2307 default:
2308 elog(ERROR, "unrecognized confmatchtype: %d",
2309 conForm->confmatchtype);
2310 string = ""; /* keep compiler quiet */
2311 break;
2312 }
2313 appendStringInfoString(&buf, string);
2314
2315 /* Add ON UPDATE and ON DELETE clauses, if needed */
2316 switch (conForm->confupdtype)
2317 {
2318 case FKCONSTR_ACTION_NOACTION:
2319 string = NULL; /* suppress default */
2320 break;
2321 case FKCONSTR_ACTION_RESTRICT:
2322 string = "RESTRICT";
2323 break;
2324 case FKCONSTR_ACTION_CASCADE:
2325 string = "CASCADE";
2326 break;
2327 case FKCONSTR_ACTION_SETNULL:
2328 string = "SET NULL";
2329 break;
2330 case FKCONSTR_ACTION_SETDEFAULT:
2331 string = "SET DEFAULT";
2332 break;
2333 default:
2334 elog(ERROR, "unrecognized confupdtype: %d",
2335 conForm->confupdtype);
2336 string = NULL; /* keep compiler quiet */
2337 break;
2338 }
2339 if (string)
2340 appendStringInfo(&buf, " ON UPDATE %s", string);
2341
2342 switch (conForm->confdeltype)
2343 {
2344 case FKCONSTR_ACTION_NOACTION:
2345 string = NULL; /* suppress default */
2346 break;
2347 case FKCONSTR_ACTION_RESTRICT:
2348 string = "RESTRICT";
2349 break;
2350 case FKCONSTR_ACTION_CASCADE:
2351 string = "CASCADE";
2352 break;
2353 case FKCONSTR_ACTION_SETNULL:
2354 string = "SET NULL";
2355 break;
2356 case FKCONSTR_ACTION_SETDEFAULT:
2357 string = "SET DEFAULT";
2358 break;
2359 default:
2360 elog(ERROR, "unrecognized confdeltype: %d",
2361 conForm->confdeltype);
2362 string = NULL; /* keep compiler quiet */
2363 break;
2364 }
2365 if (string)
2366 appendStringInfo(&buf, " ON DELETE %s", string);
2367
2368 /*
2369 * Add columns specified to SET NULL or SET DEFAULT if
2370 * provided.
2371 */
2372 val = SysCacheGetAttr(CONSTROID, tup,
2373 Anum_pg_constraint_confdelsetcols, &isnull);
2374 if (!isnull)
2375 {
2376 appendStringInfoString(&buf, " (");
2377 decompile_column_index_array(val, conForm->conrelid, false, &buf);
2378 appendStringInfoChar(&buf, ')');
2379 }
2380
2381 break;
2382 }
2383 case CONSTRAINT_PRIMARY:
2384 case CONSTRAINT_UNIQUE:
2385 {
2386 Datum val;
2387 Oid indexId;
2388 int keyatts;
2389 HeapTuple indtup;
2390
2391 /* Start off the constraint definition */
2392 if (conForm->contype == CONSTRAINT_PRIMARY)
2393 appendStringInfoString(&buf, "PRIMARY KEY ");
2394 else
2395 appendStringInfoString(&buf, "UNIQUE ");
2396
2397 indexId = conForm->conindid;
2398
2399 indtup = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexId));
2400 if (!HeapTupleIsValid(indtup))
2401 elog(ERROR, "cache lookup failed for index %u", indexId);
2402 if (conForm->contype == CONSTRAINT_UNIQUE &&
2403 ((Form_pg_index) GETSTRUCT(indtup))->indnullsnotdistinct)
2404 appendStringInfoString(&buf, "NULLS NOT DISTINCT ");
2405
2406 appendStringInfoChar(&buf, '(');
2407
2408 /* Fetch and build target column list */
2409 val = SysCacheGetAttrNotNull(CONSTROID, tup,
2410 Anum_pg_constraint_conkey);
2411
2412 keyatts = decompile_column_index_array(val, conForm->conrelid, false, &buf);
2413 if (conForm->conperiod)
2414 appendStringInfoString(&buf, " WITHOUT OVERLAPS");
2415
2416 appendStringInfoChar(&buf, ')');
2417
2418 /* Build including column list (from pg_index.indkeys) */
2419 val = SysCacheGetAttrNotNull(INDEXRELID, indtup,
2420 Anum_pg_index_indnatts);
2421 if (DatumGetInt32(val) > keyatts)
2422 {
2423 Datum cols;
2424 Datum *keys;
2425 int nKeys;
2426 int j;
2427
2428 appendStringInfoString(&buf, " INCLUDE (");
2429
2430 cols = SysCacheGetAttrNotNull(INDEXRELID, indtup,
2431 Anum_pg_index_indkey);
2432
2433 deconstruct_array_builtin(DatumGetArrayTypeP(cols), INT2OID,
2434 &keys, NULL, &nKeys);
2435
2436 for (j = keyatts; j < nKeys; j++)
2437 {
2438 char *colName;
2439
2440 colName = get_attname(conForm->conrelid,
2441 DatumGetInt16(keys[j]), false);
2442 if (j > keyatts)
2443 appendStringInfoString(&buf, ", ");
2444 appendStringInfoString(&buf, quote_identifier(colName));
2445 }
2446
2447 appendStringInfoChar(&buf, ')');
2448 }
2449 ReleaseSysCache(indtup);
2450
2451 /* XXX why do we only print these bits if fullCommand? */
2452 if (fullCommand && OidIsValid(indexId))
2453 {
2454 char *options = flatten_reloptions(indexId);
2455 Oid tblspc;
2456
2457 if (options)
2458 {
2459 appendStringInfo(&buf, " WITH (%s)", options);
2460 pfree(options);
2461 }
2462
2463 /*
2464 * Print the tablespace, unless it's the database default.
2465 * This is to help ALTER TABLE usage of this facility,
2466 * which needs this behavior to recreate exact catalog
2467 * state.
2468 */
2469 tblspc = get_rel_tablespace(indexId);
2470 if (OidIsValid(tblspc))
2471 appendStringInfo(&buf, " USING INDEX TABLESPACE %s",
2472 quote_identifier(get_tablespace_name(tblspc)));
2473 }
2474
2475 break;
2476 }
2477 case CONSTRAINT_CHECK:
2478 {
2479 Datum val;
2480 char *conbin;
2481 char *consrc;
2482 Node *expr;
2483 List *context;
2484
2485 /* Fetch constraint expression in parsetree form */
2486 val = SysCacheGetAttrNotNull(CONSTROID, tup,
2487 Anum_pg_constraint_conbin);
2488
2489 conbin = TextDatumGetCString(val);
2490 expr = stringToNode(conbin);
2491
2492 /* Set up deparsing context for Var nodes in constraint */
2493 if (conForm->conrelid != InvalidOid)
2494 {
2495 /* relation constraint */
2496 context = deparse_context_for(get_relation_name(conForm->conrelid),
2497 conForm->conrelid);
2498 }
2499 else
2500 {
2501 /* domain constraint --- can't have Vars */
2502 context = NIL;
2503 }
2504
2505 consrc = deparse_expression_pretty(expr, context, false, false,
2506 prettyFlags, 0);
2507
2508 /*
2509 * Now emit the constraint definition, adding NO INHERIT if
2510 * necessary.
2511 *
2512 * There are cases where the constraint expression will be
2513 * fully parenthesized and we don't need the outer parens ...
2514 * but there are other cases where we do need 'em. Be
2515 * conservative for now.
2516 *
2517 * Note that simply checking for leading '(' and trailing ')'
2518 * would NOT be good enough, consider "(x > 0) AND (y > 0)".
2519 */
2520 appendStringInfo(&buf, "CHECK (%s)%s",
2521 consrc,
2522 conForm->connoinherit ? " NO INHERIT" : "");
2523 break;
2524 }
2525 case CONSTRAINT_NOTNULL:
2526 {
2527 if (conForm->conrelid)
2528 {
2529 AttrNumber attnum;
2530
2531 attnum = extractNotNullColumn(tup);
2532
2533 appendStringInfo(&buf, "NOT NULL %s",
2534 quote_identifier(get_attname(conForm->conrelid,
2535 attnum, false)));
2536 if (((Form_pg_constraint) GETSTRUCT(tup))->connoinherit)
2537 appendStringInfoString(&buf, " NO INHERIT");
2538 }
2539 else if (conForm->contypid)
2540 {
2541 /* conkey is null for domain not-null constraints */
2542 appendStringInfoString(&buf, "NOT NULL");
2543 }
2544 break;
2545 }
2546
2547 case CONSTRAINT_TRIGGER:
2548
2549 /*
2550 * There isn't an ALTER TABLE syntax for creating a user-defined
2551 * constraint trigger, but it seems better to print something than
2552 * throw an error; if we throw error then this function couldn't
2553 * safely be applied to all rows of pg_constraint.
2554 */
2555 appendStringInfoString(&buf, "TRIGGER");
2556 break;
2557 case CONSTRAINT_EXCLUSION:
2558 {
2559 Oid indexOid = conForm->conindid;
2560 Datum val;
2561 Datum *elems;
2562 int nElems;
2563 int i;
2564 Oid *operators;
2565
2566 /* Extract operator OIDs from the pg_constraint tuple */
2567 val = SysCacheGetAttrNotNull(CONSTROID, tup,
2568 Anum_pg_constraint_conexclop);
2569
2570 deconstruct_array_builtin(DatumGetArrayTypeP(val), OIDOID,
2571 &elems, NULL, &nElems);
2572
2573 operators = (Oid *) palloc(nElems * sizeof(Oid));
2574 for (i = 0; i < nElems; i++)
2575 operators[i] = DatumGetObjectId(elems[i]);
2576
2577 /* pg_get_indexdef_worker does the rest */
2578 /* suppress tablespace because pg_dump wants it that way */
2579 appendStringInfoString(&buf,
2580 pg_get_indexdef_worker(indexOid,
2581 0,
2582 operators,
2583 false,
2584 false,
2585 false,
2586 false,
2587 prettyFlags,
2588 false));
2589 break;
2590 }
2591 default:
2592 elog(ERROR, "invalid constraint type \"%c\"", conForm->contype);
2593 break;
2594 }
2595
2596 if (conForm->condeferrable)
2597 appendStringInfoString(&buf, " DEFERRABLE");
2598 if (conForm->condeferred)
2599 appendStringInfoString(&buf, " INITIALLY DEFERRED");
2600
2601 /* Validated status is irrelevant when the constraint is NOT ENFORCED. */
2602 if (!conForm->conenforced)
2603 appendStringInfoString(&buf, " NOT ENFORCED");
2604 else if (!conForm->convalidated)
2605 appendStringInfoString(&buf, " NOT VALID");
2606
2607 /* Cleanup */
2608 systable_endscan(scandesc);
2609 table_close(relation, AccessShareLock);
2610
2611 return buf.data;
2612}
2613
2614
2615/*
2616 * Convert an int16[] Datum into a comma-separated list of column names
2617 * for the indicated relation; append the list to buf. Returns the number
2618 * of keys.
2619 */
2620static int
2621decompile_column_index_array(Datum column_index_array, Oid relId,
2622 bool withPeriod, StringInfo buf)
2623{
2624 Datum *keys;
2625 int nKeys;
2626 int j;
2627
2628 /* Extract data from array of int16 */
2629 deconstruct_array_builtin(DatumGetArrayTypeP(column_index_array), INT2OID,
2630 &keys, NULL, &nKeys);
2631
2632 for (j = 0; j < nKeys; j++)
2633 {
2634 char *colName;
2635
2636 colName = get_attname(relId, DatumGetInt16(keys[j]), false);
2637
2638 if (j == 0)
2639 appendStringInfoString(buf, quote_identifier(colName));
2640 else
2641 appendStringInfo(buf, ", %s%s",
2642 (withPeriod && j == nKeys - 1) ? "PERIOD " : "",
2643 quote_identifier(colName));
2644 }
2645
2646 return nKeys;
2647}
2648
2649
2650/* ----------
2651 * pg_get_expr - Decompile an expression tree
2652 *
2653 * Input: an expression tree in nodeToString form, and a relation OID
2654 *
2655 * Output: reverse-listed expression
2656 *
2657 * Currently, the expression can only refer to a single relation, namely
2658 * the one specified by the second parameter. This is sufficient for
2659 * partial indexes, column default expressions, etc. We also support
2660 * Var-free expressions, for which the OID can be InvalidOid.
2661 *
2662 * If the OID is nonzero but not actually valid, don't throw an error,
2663 * just return NULL. This is a bit questionable, but it's what we've
2664 * done historically, and it can help avoid unwanted failures when
2665 * examining catalog entries for just-deleted relations.
2666 *
2667 * We expect this function to work, or throw a reasonably clean error,
2668 * for any node tree that can appear in a catalog pg_node_tree column.
2669 * Query trees, such as those appearing in pg_rewrite.ev_action, are
2670 * not supported. Nor are expressions in more than one relation, which
2671 * can appear in places like pg_rewrite.ev_qual.
2672 * ----------
2673 */
2674Datum
2675pg_get_expr(PG_FUNCTION_ARGS)
2676{
2677 text *expr = PG_GETARG_TEXT_PP(0);
2678 Oid relid = PG_GETARG_OID(1);
2679 text *result;
2680 int prettyFlags;
2681
2682 prettyFlags = PRETTYFLAG_INDENT;
2683
2684 result = pg_get_expr_worker(expr, relid, prettyFlags);
2685 if (result)
2686 PG_RETURN_TEXT_P(result);
2687 else
2688 PG_RETURN_NULL();
2689}
2690
2691Datum
2692pg_get_expr_ext(PG_FUNCTION_ARGS)
2693{
2694 text *expr = PG_GETARG_TEXT_PP(0);
2695 Oid relid = PG_GETARG_OID(1);
2696 bool pretty = PG_GETARG_BOOL(2);
2697 text *result;
2698 int prettyFlags;
2699
2700 prettyFlags = GET_PRETTY_FLAGS(pretty);
2701
2702 result = pg_get_expr_worker(expr, relid, prettyFlags);
2703 if (result)
2704 PG_RETURN_TEXT_P(result);
2705 else
2706 PG_RETURN_NULL();
2707}
2708
2709static text *
2710pg_get_expr_worker(text *expr, Oid relid, int prettyFlags)
2711{
2712 Node *node;
2713 Node *tst;
2714 Relids relids;
2715 List *context;
2716 char *exprstr;
2717 Relation rel = NULL;
2718 char *str;
2719
2720 /* Convert input pg_node_tree (really TEXT) object to C string */
2721 exprstr = text_to_cstring(expr);
2722
2723 /* Convert expression to node tree */
2724 node = (Node *) stringToNode(exprstr);
2725
2726 pfree(exprstr);
2727
2728 /*
2729 * Throw error if the input is a querytree rather than an expression tree.
2730 * While we could support queries here, there seems no very good reason
2731 * to. In most such catalog columns, we'll see a List of Query nodes, or
2732 * even nested Lists, so drill down to a non-List node before checking.
2733 */
2734 tst = node;
2735 while (tst && IsA(tst, List))
2736 tst = linitial((List *) tst);
2737 if (tst && IsA(tst, Query))
2738 ereport(ERROR,
2739 (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
2740 errmsg("input is a query, not an expression")));
2741
2742 /*
2743 * Throw error if the expression contains Vars we won't be able to
2744 * deparse.
2745 */
2746 relids = pull_varnos(NULL, node);
2747 if (OidIsValid(relid))
2748 {
2749 if (!bms_is_subset(relids, bms_make_singleton(1)))
2750 ereport(ERROR,
2751 (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
2752 errmsg("expression contains variables of more than one relation")));
2753 }
2754 else
2755 {
2756 if (!bms_is_empty(relids))
2757 ereport(ERROR,
2758 (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
2759 errmsg("expression contains variables")));
2760 }
2761
2762 /*
2763 * Prepare deparse context if needed. If we are deparsing with a relid,
2764 * we need to transiently open and lock the rel, to make sure it won't go
2765 * away underneath us. (set_relation_column_names would lock it anyway,
2766 * so this isn't really introducing any new behavior.)
2767 */
2768 if (OidIsValid(relid))
2769 {
2770 rel = try_relation_open(relid, AccessShareLock);
2771 if (rel == NULL)
2772 return NULL;
2773 context = deparse_context_for(RelationGetRelationName(rel), relid);
2774 }
2775 else
2776 context = NIL;
2777
2778 /* Deparse */
2779 str = deparse_expression_pretty(node, context, false, false,
2780 prettyFlags, 0);
2781
2782 if (rel != NULL)
2783 relation_close(rel, AccessShareLock);
2784
2785 return string_to_text(str);
2786}
2787
2788
2789/* ----------
2790 * pg_get_userbyid - Get a user name by roleid and
2791 * fallback to 'unknown (OID=n)'
2792 * ----------
2793 */
2794Datum
2795pg_get_userbyid(PG_FUNCTION_ARGS)
2796{
2797 Oid roleid = PG_GETARG_OID(0);
2798 Name result;
2799 HeapTuple roletup;
2800 Form_pg_authid role_rec;
2801
2802 /*
2803 * Allocate space for the result
2804 */
2805 result = (Name) palloc(NAMEDATALEN);
2806 memset(NameStr(*result), 0, NAMEDATALEN);
2807
2808 /*
2809 * Get the pg_authid entry and print the result
2810 */
2811 roletup = SearchSysCache1(AUTHOID, ObjectIdGetDatum(roleid));
2812 if (HeapTupleIsValid(roletup))
2813 {
2814 role_rec = (Form_pg_authid) GETSTRUCT(roletup);
2815 *result = role_rec->rolname;
2816 ReleaseSysCache(roletup);
2817 }
2818 else
2819 sprintf(NameStr(*result), "unknown (OID=%u)", roleid);
2820
2821 PG_RETURN_NAME(result);
2822}
2823
2824
2825/*
2826 * pg_get_serial_sequence
2827 * Get the name of the sequence used by an identity or serial column,
2828 * formatted suitably for passing to setval, nextval or currval.
2829 * First parameter is not treated as double-quoted, second parameter
2830 * is --- see documentation for reason.
2831 */
2832Datum
2833pg_get_serial_sequence(PG_FUNCTION_ARGS)
2834{
2835 text *tablename = PG_GETARG_TEXT_PP(0);
2836 text *columnname = PG_GETARG_TEXT_PP(1);
2837 RangeVar *tablerv;
2838 Oid tableOid;
2839 char *column;
2840 AttrNumber attnum;
2841 Oid sequenceId = InvalidOid;
2842 Relation depRel;
2843 ScanKeyData key[3];
2844 SysScanDesc scan;
2845 HeapTuple tup;
2846
2847 /* Look up table name. Can't lock it - we might not have privileges. */
2848 tablerv = makeRangeVarFromNameList(textToQualifiedNameList(tablename));
2849 tableOid = RangeVarGetRelid(tablerv, NoLock, false);
2850
2851 /* Get the number of the column */
2852 column = text_to_cstring(columnname);
2853
2854 attnum = get_attnum(tableOid, column);
2855 if (attnum == InvalidAttrNumber)
2856 ereport(ERROR,
2857 (errcode(ERRCODE_UNDEFINED_COLUMN),
2858 errmsg("column \"%s\" of relation \"%s\" does not exist",
2859 column, tablerv->relname)));
2860
2861 /* Search the dependency table for the dependent sequence */
2862 depRel = table_open(DependRelationId, AccessShareLock);
2863
2864 ScanKeyInit(&key[0],
2865 Anum_pg_depend_refclassid,
2866 BTEqualStrategyNumber, F_OIDEQ,
2867 ObjectIdGetDatum(RelationRelationId));
2868 ScanKeyInit(&key[1],
2869 Anum_pg_depend_refobjid,
2870 BTEqualStrategyNumber, F_OIDEQ,
2871 ObjectIdGetDatum(tableOid));
2872 ScanKeyInit(&key[2],
2873 Anum_pg_depend_refobjsubid,
2874 BTEqualStrategyNumber, F_INT4EQ,
2875 Int32GetDatum(attnum));
2876
2877 scan = systable_beginscan(depRel, DependReferenceIndexId, true,
2878 NULL, 3, key);
2879
2880 while (HeapTupleIsValid(tup = systable_getnext(scan)))
2881 {
2882 Form_pg_depend deprec = (Form_pg_depend) GETSTRUCT(tup);
2883
2884 /*
2885 * Look for an auto dependency (serial column) or internal dependency
2886 * (identity column) of a sequence on a column. (We need the relkind
2887 * test because indexes can also have auto dependencies on columns.)
2888 */
2889 if (deprec->classid == RelationRelationId &&
2890 deprec->objsubid == 0 &&
2891 (deprec->deptype == DEPENDENCY_AUTO ||
2892 deprec->deptype == DEPENDENCY_INTERNAL) &&
2893 get_rel_relkind(deprec->objid) == RELKIND_SEQUENCE)
2894 {
2895 sequenceId = deprec->objid;
2896 break;
2897 }
2898 }
2899
2900 systable_endscan(scan);
2901 table_close(depRel, AccessShareLock);
2902
2903 if (OidIsValid(sequenceId))
2904 {
2905 char *result;
2906
2907 result = generate_qualified_relation_name(sequenceId);
2908
2909 PG_RETURN_TEXT_P(string_to_text(result));
2910 }
2911
2912 PG_RETURN_NULL();
2913}
2914
2915
2916/*
2917 * pg_get_functiondef
2918 * Returns the complete "CREATE OR REPLACE FUNCTION ..." statement for
2919 * the specified function.
2920 *
2921 * Note: if you change the output format of this function, be careful not
2922 * to break psql's rules (in \ef and \sf) for identifying the start of the
2923 * function body. To wit: the function body starts on a line that begins with
2924 * "AS ", "BEGIN ", or "RETURN ", and no preceding line will look like that.
2925 */
2926Datum
2927pg_get_functiondef(PG_FUNCTION_ARGS)
2928{
2929 Oid funcid = PG_GETARG_OID(0);
2930 StringInfoData buf;
2931 StringInfoData dq;
2932 HeapTuple proctup;
2933 Form_pg_proc proc;
2934 bool isfunction;
2935 Datum tmp;
2936 bool isnull;
2937 const char *prosrc;
2938 const char *name;
2939 const char *nsp;
2940 float4 procost;
2941 int oldlen;
2942
2943 initStringInfo(&buf);
2944
2945 /* Look up the function */
2946 proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
2947 if (!HeapTupleIsValid(proctup))
2948 PG_RETURN_NULL();
2949
2950 proc = (Form_pg_proc) GETSTRUCT(proctup);
2951 name = NameStr(proc->proname);
2952
2953 if (proc->prokind == PROKIND_AGGREGATE)
2954 ereport(ERROR,
2955 (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2956 errmsg("\"%s\" is an aggregate function", name)));
2957
2958 isfunction = (proc->prokind != PROKIND_PROCEDURE);
2959
2960 /*
2961 * We always qualify the function name, to ensure the right function gets
2962 * replaced.
2963 */
2964 nsp = get_namespace_name_or_temp(proc->pronamespace);
2965 appendStringInfo(&buf, "CREATE OR REPLACE %s %s(",
2966 isfunction ? "FUNCTION" : "PROCEDURE",
2967 quote_qualified_identifier(nsp, name));
2968 (void) print_function_arguments(&buf, proctup, false, true);
2969 appendStringInfoString(&buf, ")\n");
2970 if (isfunction)
2971 {
2972 appendStringInfoString(&buf, " RETURNS ");
2973 print_function_rettype(&buf, proctup);
2974 appendStringInfoChar(&buf, '\n');
2975 }
2976
2977 print_function_trftypes(&buf, proctup);
2978
2979 appendStringInfo(&buf, " LANGUAGE %s\n",
2980 quote_identifier(get_language_name(proc->prolang, false)));
2981
2982 /* Emit some miscellaneous options on one line */
2983 oldlen = buf.len;
2984
2985 if (proc->prokind == PROKIND_WINDOW)
2986 appendStringInfoString(&buf, " WINDOW");
2987 switch (proc->provolatile)
2988 {
2989 case PROVOLATILE_IMMUTABLE:
2990 appendStringInfoString(&buf, " IMMUTABLE");
2991 break;
2992 case PROVOLATILE_STABLE:
2993 appendStringInfoString(&buf, " STABLE");
2994 break;
2995 case PROVOLATILE_VOLATILE:
2996 break;
2997 }
2998
2999 switch (proc->proparallel)
3000 {
3001 case PROPARALLEL_SAFE:
3002 appendStringInfoString(&buf, " PARALLEL SAFE");
3003 break;
3004 case PROPARALLEL_RESTRICTED:
3005 appendStringInfoString(&buf, " PARALLEL RESTRICTED");
3006 break;
3007 case PROPARALLEL_UNSAFE:
3008 break;
3009 }
3010
3011 if (proc->proisstrict)
3012 appendStringInfoString(&buf, " STRICT");
3013 if (proc->prosecdef)
3014 appendStringInfoString(&buf, " SECURITY DEFINER");
3015 if (proc->proleakproof)
3016 appendStringInfoString(&buf, " LEAKPROOF");
3017
3018 /* This code for the default cost and rows should match functioncmds.c */
3019 if (proc->prolang == INTERNALlanguageId ||
3020 proc->prolang == ClanguageId)
3021 procost = 1;
3022 else
3023 procost = 100;
3024 if (proc->procost != procost)
3025 appendStringInfo(&buf, " COST %g", proc->procost);
3026
3027 if (proc->prorows > 0 && proc->prorows != 1000)
3028 appendStringInfo(&buf, " ROWS %g", proc->prorows);
3029
3030 if (proc->prosupport)
3031 {
3032 Oid argtypes[1];
3033
3034 /*
3035 * We should qualify the support function's name if it wouldn't be
3036 * resolved by lookup in the current search path.
3037 */
3038 argtypes[0] = INTERNALOID;
3039 appendStringInfo(&buf, " SUPPORT %s",
3040 generate_function_name(proc->prosupport, 1,
3041 NIL, argtypes,
3042 false, NULL, false));
3043 }
3044
3045 if (oldlen != buf.len)
3046 appendStringInfoChar(&buf, '\n');
3047
3048 /* Emit any proconfig options, one per line */
3049 tmp = SysCacheGetAttr(PROCOID, proctup, Anum_pg_proc_proconfig, &isnull);
3050 if (!isnull)
3051 {
3052 ArrayType *a = DatumGetArrayTypeP(tmp);
3053 int i;
3054
3055 Assert(ARR_ELEMTYPE(a) == TEXTOID);
3056 Assert(ARR_NDIM(a) == 1);
3057 Assert(ARR_LBOUND(a)[0] == 1);
3058
3059 for (i = 1; i <= ARR_DIMS(a)[0]; i++)
3060 {
3061 Datum d;
3062
3063 d = array_ref(a, 1, &i,
3064 -1 /* varlenarray */ ,
3065 -1 /* TEXT's typlen */ ,
3066 false /* TEXT's typbyval */ ,
3067 TYPALIGN_INT /* TEXT's typalign */ ,
3068 &isnull);
3069 if (!isnull)
3070 {
3071 char *configitem = TextDatumGetCString(d);
3072 char *pos;
3073
3074 pos = strchr(configitem, '=');
3075 if (pos == NULL)
3076 continue;
3077 *pos++ = '\0';
3078
3079 appendStringInfo(&buf, " SET %s TO ",
3080 quote_identifier(configitem));
3081
3082 /*
3083 * Variables that are marked GUC_LIST_QUOTE were already fully
3084 * quoted by flatten_set_variable_args() before they were put
3085 * into the proconfig array. However, because the quoting
3086 * rules used there aren't exactly like SQL's, we have to
3087 * break the list value apart and then quote the elements as
3088 * string literals. (The elements may be double-quoted as-is,
3089 * but we can't just feed them to the SQL parser; it would do
3090 * the wrong thing with elements that are zero-length or
3091 * longer than NAMEDATALEN.)
3092 *
3093 * Variables that are not so marked should just be emitted as
3094 * simple string literals. If the variable is not known to
3095 * guc.c, we'll do that; this makes it unsafe to use
3096 * GUC_LIST_QUOTE for extension variables.
3097 */
3098 if (GetConfigOptionFlags(configitem, true) & GUC_LIST_QUOTE)
3099 {
3100 List *namelist;
3101 ListCell *lc;
3102
3103 /* Parse string into list of identifiers */
3104 if (!SplitGUCList(pos, ',', &namelist))
3105 {
3106 /* this shouldn't fail really */
3107 elog(ERROR, "invalid list syntax in proconfig item");
3108 }
3109 foreach(lc, namelist)
3110 {
3111 char *curname = (char *) lfirst(lc);
3112
3113 simple_quote_literal(&buf, curname);
3114 if (lnext(namelist, lc))
3115 appendStringInfoString(&buf, ", ");
3116 }
3117 }
3118 else
3119 simple_quote_literal(&buf, pos);
3120 appendStringInfoChar(&buf, '\n');
3121 }
3122 }
3123 }
3124
3125 /* And finally the function definition ... */
3126 (void) SysCacheGetAttr(PROCOID, proctup, Anum_pg_proc_prosqlbody, &isnull);
3127 if (proc->prolang == SQLlanguageId && !isnull)
3128 {
3129 print_function_sqlbody(&buf, proctup);
3130 }
3131 else
3132 {
3133 appendStringInfoString(&buf, "AS ");
3134
3135 tmp = SysCacheGetAttr(PROCOID, proctup, Anum_pg_proc_probin, &isnull);
3136 if (!isnull)
3137 {
3138 simple_quote_literal(&buf, TextDatumGetCString(tmp));
3139 appendStringInfoString(&buf, ", "); /* assume prosrc isn't null */
3140 }
3141
3142 tmp = SysCacheGetAttrNotNull(PROCOID, proctup, Anum_pg_proc_prosrc);
3143 prosrc = TextDatumGetCString(tmp);
3144
3145 /*
3146 * We always use dollar quoting. Figure out a suitable delimiter.
3147 *
3148 * Since the user is likely to be editing the function body string, we
3149 * shouldn't use a short delimiter that he might easily create a
3150 * conflict with. Hence prefer "$function$"/"$procedure$", but extend
3151 * if needed.
3152 */
3153 initStringInfo(&dq);
3154 appendStringInfoChar(&dq, '$');
3155 appendStringInfoString(&dq, (isfunction ? "function" : "procedure"));
3156 while (strstr(prosrc, dq.data) != NULL)
3157 appendStringInfoChar(&dq, 'x');
3158 appendStringInfoChar(&dq, '$');
3159
3160 appendBinaryStringInfo(&buf, dq.data, dq.len);
3161 appendStringInfoString(&buf, prosrc);
3162 appendBinaryStringInfo(&buf, dq.data, dq.len);
3163 }
3164
3165 appendStringInfoChar(&buf, '\n');
3166
3167 ReleaseSysCache(proctup);
3168
3169 PG_RETURN_TEXT_P(string_to_text(buf.data));
3170}
3171
3172/*
3173 * pg_get_function_arguments
3174 * Get a nicely-formatted list of arguments for a function.
3175 * This is everything that would go between the parentheses in
3176 * CREATE FUNCTION.
3177 */
3178Datum
3179pg_get_function_arguments(PG_FUNCTION_ARGS)
3180{
3181 Oid funcid = PG_GETARG_OID(0);
3182 StringInfoData buf;
3183 HeapTuple proctup;
3184
3185 proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
3186 if (!HeapTupleIsValid(proctup))
3187 PG_RETURN_NULL();
3188
3189 initStringInfo(&buf);
3190
3191 (void) print_function_arguments(&buf, proctup, false, true);
3192
3193 ReleaseSysCache(proctup);
3194
3195 PG_RETURN_TEXT_P(string_to_text(buf.data));
3196}
3197
3198/*
3199 * pg_get_function_identity_arguments
3200 * Get a formatted list of arguments for a function.
3201 * This is everything that would go between the parentheses in
3202 * ALTER FUNCTION, etc. In particular, don't print defaults.
3203 */
3204Datum
3205pg_get_function_identity_arguments(PG_FUNCTION_ARGS)
3206{
3207 Oid funcid = PG_GETARG_OID(0);
3208 StringInfoData buf;
3209 HeapTuple proctup;
3210
3211 proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
3212 if (!HeapTupleIsValid(proctup))
3213 PG_RETURN_NULL();
3214
3215 initStringInfo(&buf);
3216
3217 (void) print_function_arguments(&buf, proctup, false, false);
3218
3219 ReleaseSysCache(proctup);
3220
3221 PG_RETURN_TEXT_P(string_to_text(buf.data));
3222}
3223
3224/*
3225 * pg_get_function_result
3226 * Get a nicely-formatted version of the result type of a function.
3227 * This is what would appear after RETURNS in CREATE FUNCTION.
3228 */
3229Datum
3230pg_get_function_result(PG_FUNCTION_ARGS)
3231{
3232 Oid funcid = PG_GETARG_OID(0);
3233 StringInfoData buf;
3234 HeapTuple proctup;
3235
3236 proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
3237 if (!HeapTupleIsValid(proctup))
3238 PG_RETURN_NULL();
3239
3240 if (((Form_pg_proc) GETSTRUCT(proctup))->prokind == PROKIND_PROCEDURE)
3241 {
3242 ReleaseSysCache(proctup);
3243 PG_RETURN_NULL();
3244 }
3245
3246 initStringInfo(&buf);
3247
3248 print_function_rettype(&buf, proctup);
3249
3250 ReleaseSysCache(proctup);
3251
3252 PG_RETURN_TEXT_P(string_to_text(buf.data));
3253}
3254
3255/*
3256 * Guts of pg_get_function_result: append the function's return type
3257 * to the specified buffer.
3258 */
3259static void
3260print_function_rettype(StringInfo buf, HeapTuple proctup)
3261{
3262 Form_pg_proc proc = (Form_pg_proc) GETSTRUCT(proctup);
3263 int ntabargs = 0;
3264 StringInfoData rbuf;
3265
3266 initStringInfo(&rbuf);
3267
3268 if (proc->proretset)
3269 {
3270 /* It might be a table function; try to print the arguments */
3271 appendStringInfoString(&rbuf, "TABLE(");
3272 ntabargs = print_function_arguments(&rbuf, proctup, true, false);
3273 if (ntabargs > 0)
3274 appendStringInfoChar(&rbuf, ')');
3275 else
3276 resetStringInfo(&rbuf);
3277 }
3278
3279 if (ntabargs == 0)
3280 {
3281 /* Not a table function, so do the normal thing */
3282 if (proc->proretset)
3283 appendStringInfoString(&rbuf, "SETOF ");
3284 appendStringInfoString(&rbuf, format_type_be(proc->prorettype));
3285 }
3286
3287 appendBinaryStringInfo(buf, rbuf.data, rbuf.len);
3288}
3289
3290/*
3291 * Common code for pg_get_function_arguments and pg_get_function_result:
3292 * append the desired subset of arguments to buf. We print only TABLE
3293 * arguments when print_table_args is true, and all the others when it's false.
3294 * We print argument defaults only if print_defaults is true.
3295 * Function return value is the number of arguments printed.
3296 */
3297static int
3298print_function_arguments(StringInfo buf, HeapTuple proctup,
3299 bool print_table_args, bool print_defaults)
3300{
3301 Form_pg_proc proc = (Form_pg_proc) GETSTRUCT(proctup);
3302 int numargs;
3303 Oid *argtypes;
3304 char **argnames;
3305 char *argmodes;
3306 int insertorderbyat = -1;
3307 int argsprinted;
3308 int inputargno;
3309 int nlackdefaults;
3310 List *argdefaults = NIL;
3311 ListCell *nextargdefault = NULL;
3312 int i;
3313
3314 numargs = get_func_arg_info(proctup,
3315 &argtypes, &argnames, &argmodes);
3316
3317 nlackdefaults = numargs;
3318 if (print_defaults && proc->pronargdefaults > 0)
3319 {
3320 Datum proargdefaults;
3321 bool isnull;
3322
3323 proargdefaults = SysCacheGetAttr(PROCOID, proctup,
3324 Anum_pg_proc_proargdefaults,
3325 &isnull);
3326 if (!isnull)
3327 {
3328 char *str;
3329
3330 str = TextDatumGetCString(proargdefaults);
3331 argdefaults = castNode(List, stringToNode(str));
3332 pfree(str);
3333 nextargdefault = list_head(argdefaults);
3334 /* nlackdefaults counts only *input* arguments lacking defaults */
3335 nlackdefaults = proc->pronargs - list_length(argdefaults);
3336 }
3337 }
3338
3339 /* Check for special treatment of ordered-set aggregates */
3340 if (proc->prokind == PROKIND_AGGREGATE)
3341 {
3342 HeapTuple aggtup;
3343 Form_pg_aggregate agg;
3344
3345 aggtup = SearchSysCache1(AGGFNOID, ObjectIdGetDatum(proc->oid));
3346 if (!HeapTupleIsValid(aggtup))
3347 elog(ERROR, "cache lookup failed for aggregate %u",
3348 proc->oid);
3349 agg = (Form_pg_aggregate) GETSTRUCT(aggtup);
3350 if (AGGKIND_IS_ORDERED_SET(agg->aggkind))
3351 insertorderbyat = agg->aggnumdirectargs;
3352 ReleaseSysCache(aggtup);
3353 }
3354
3355 argsprinted = 0;
3356 inputargno = 0;
3357 for (i = 0; i < numargs; i++)
3358 {
3359 Oid argtype = argtypes[i];
3360 char *argname = argnames ? argnames[i] : NULL;
3361 char argmode = argmodes ? argmodes[i] : PROARGMODE_IN;
3362 const char *modename;
3363 bool isinput;
3364
3365 switch (argmode)
3366 {
3367 case PROARGMODE_IN:
3368
3369 /*
3370 * For procedures, explicitly mark all argument modes, so as
3371 * to avoid ambiguity with the SQL syntax for DROP PROCEDURE.
3372 */
3373 if (proc->prokind == PROKIND_PROCEDURE)
3374 modename = "IN ";
3375 else
3376 modename = "";
3377 isinput = true;
3378 break;
3379 case PROARGMODE_INOUT:
3380 modename = "INOUT ";
3381 isinput = true;
3382 break;
3383 case PROARGMODE_OUT:
3384 modename = "OUT ";
3385 isinput = false;
3386 break;
3387 case PROARGMODE_VARIADIC:
3388 modename = "VARIADIC ";
3389 isinput = true;
3390 break;
3391 case PROARGMODE_TABLE:
3392 modename = "";
3393 isinput = false;
3394 break;
3395 default:
3396 elog(ERROR, "invalid parameter mode '%c'", argmode);
3397 modename = NULL; /* keep compiler quiet */
3398 isinput = false;
3399 break;
3400 }
3401 if (isinput)
3402 inputargno++; /* this is a 1-based counter */
3403
3404 if (print_table_args != (argmode == PROARGMODE_TABLE))
3405 continue;
3406
3407 if (argsprinted == insertorderbyat)
3408 {
3409 if (argsprinted)
3410 appendStringInfoChar(buf, ' ');
3411 appendStringInfoString(buf, "ORDER BY ");
3412 }
3413 else if (argsprinted)
3414 appendStringInfoString(buf, ", ");
3415
3416 appendStringInfoString(buf, modename);
3417 if (argname && argname[0])
3418 appendStringInfo(buf, "%s ", quote_identifier(argname));
3419 appendStringInfoString(buf, format_type_be(argtype));
3420 if (print_defaults && isinput && inputargno > nlackdefaults)
3421 {
3422 Node *expr;
3423
3424 Assert(nextargdefault != NULL);
3425 expr = (Node *) lfirst(nextargdefault);
3426 nextargdefault = lnext(argdefaults, nextargdefault);
3427
3428 appendStringInfo(buf, " DEFAULT %s",
3429 deparse_expression(expr, NIL, false, false));
3430 }
3431 argsprinted++;
3432
3433 /* nasty hack: print the last arg twice for variadic ordered-set agg */
3434 if (argsprinted == insertorderbyat && i == numargs - 1)
3435 {
3436 i--;
3437 /* aggs shouldn't have defaults anyway, but just to be sure ... */
3438 print_defaults = false;
3439 }
3440 }
3441
3442 return argsprinted;
3443}
3444
3445static bool
3446is_input_argument(int nth, const char *argmodes)
3447{
3448 return (!argmodes
3449 || argmodes[nth] == PROARGMODE_IN
3450 || argmodes[nth] == PROARGMODE_INOUT
3451 || argmodes[nth] == PROARGMODE_VARIADIC);
3452}
3453
3454/*
3455 * Append used transformed types to specified buffer
3456 */
3457static void
3458print_function_trftypes(StringInfo buf, HeapTuple proctup)
3459{
3460 Oid *trftypes;
3461 int ntypes;
3462
3463 ntypes = get_func_trftypes(proctup, &trftypes);
3464 if (ntypes > 0)
3465 {
3466 int i;
3467
3468 appendStringInfoString(buf, " TRANSFORM ");
3469 for (i = 0; i < ntypes; i++)
3470 {
3471 if (i != 0)
3472 appendStringInfoString(buf, ", ");
3473 appendStringInfo(buf, "FOR TYPE %s", format_type_be(trftypes[i]));
3474 }
3475 appendStringInfoChar(buf, '\n');
3476 }
3477}
3478
3479/*
3480 * Get textual representation of a function argument's default value. The
3481 * second argument of this function is the argument number among all arguments
3482 * (i.e. proallargtypes, *not* proargtypes), starting with 1, because that's
3483 * how information_schema.sql uses it.
3484 */
3485Datum
3486pg_get_function_arg_default(PG_FUNCTION_ARGS)
3487{
3488 Oid funcid = PG_GETARG_OID(0);
3489 int32 nth_arg = PG_GETARG_INT32(1);
3490 HeapTuple proctup;
3491 Form_pg_proc proc;
3492 int numargs;
3493 Oid *argtypes;
3494 char **argnames;
3495 char *argmodes;
3496 int i;
3497 List *argdefaults;
3498 Node *node;
3499 char *str;
3500 int nth_inputarg;
3501 Datum proargdefaults;
3502 bool isnull;
3503 int nth_default;
3504
3505 proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
3506 if (!HeapTupleIsValid(proctup))
3507 PG_RETURN_NULL();
3508
3509 numargs = get_func_arg_info(proctup, &argtypes, &argnames, &argmodes);
3510 if (nth_arg < 1 || nth_arg > numargs || !is_input_argument(nth_arg - 1, argmodes))
3511 {
3512 ReleaseSysCache(proctup);
3513 PG_RETURN_NULL();
3514 }
3515
3516 nth_inputarg = 0;
3517 for (i = 0; i < nth_arg; i++)
3518 if (is_input_argument(i, argmodes))
3519 nth_inputarg++;
3520
3521 proargdefaults = SysCacheGetAttr(PROCOID, proctup,
3522 Anum_pg_proc_proargdefaults,
3523 &isnull);
3524 if (isnull)
3525 {
3526 ReleaseSysCache(proctup);
3527 PG_RETURN_NULL();
3528 }
3529
3530 str = TextDatumGetCString(proargdefaults);
3531 argdefaults = castNode(List, stringToNode(str));
3532 pfree(str);
3533
3534 proc = (Form_pg_proc) GETSTRUCT(proctup);
3535
3536 /*
3537 * Calculate index into proargdefaults: proargdefaults corresponds to the
3538 * last N input arguments, where N = pronargdefaults.
3539 */
3540 nth_default = nth_inputarg - 1 - (proc->pronargs - proc->pronargdefaults);
3541
3542 if (nth_default < 0 || nth_default >= list_length(argdefaults))
3543 {
3544 ReleaseSysCache(proctup);
3545 PG_RETURN_NULL();
3546 }
3547 node = list_nth(argdefaults, nth_default);
3548 str = deparse_expression(node, NIL, false, false);
3549
3550 ReleaseSysCache(proctup);
3551
3552 PG_RETURN_TEXT_P(string_to_text(str));
3553}
3554
3555static void
3556print_function_sqlbody(StringInfo buf, HeapTuple proctup)
3557{
3558 int numargs;
3559 Oid *argtypes;
3560 char **argnames;
3561 char *argmodes;
3562 deparse_namespace dpns = {0};
3563 Datum tmp;
3564 Node *n;
3565
3566 dpns.funcname = pstrdup(NameStr(((Form_pg_proc) GETSTRUCT(proctup))->proname));
3567 numargs = get_func_arg_info(proctup,
3568 &argtypes, &argnames, &argmodes);
3569 dpns.numargs = numargs;
3570 dpns.argnames = argnames;
3571
3572 tmp = SysCacheGetAttrNotNull(PROCOID, proctup, Anum_pg_proc_prosqlbody);
3573 n = stringToNode(TextDatumGetCString(tmp));
3574
3575 if (IsA(n, List))
3576 {
3577 List *stmts;
3578 ListCell *lc;
3579
3580 stmts = linitial(castNode(List, n));
3581
3582 appendStringInfoString(buf, "BEGIN ATOMIC\n");
3583
3584 foreach(lc, stmts)
3585 {
3586 Query *query = lfirst_node(Query, lc);
3587
3588 /* It seems advisable to get at least AccessShareLock on rels */
3589 AcquireRewriteLocks(query, false, false);
3590 get_query_def(query, buf, list_make1(&dpns), NULL, false,
3591 PRETTYFLAG_INDENT, WRAP_COLUMN_DEFAULT, 1);
3592 appendStringInfoChar(buf, ';');
3593 appendStringInfoChar(buf, '\n');
3594 }
3595
3596 appendStringInfoString(buf, "END");
3597 }
3598 else
3599 {
3600 Query *query = castNode(Query, n);
3601
3602 /* It seems advisable to get at least AccessShareLock on rels */
3603 AcquireRewriteLocks(query, false, false);
3604 get_query_def(query, buf, list_make1(&dpns), NULL, false,
3605 0, WRAP_COLUMN_DEFAULT, 0);
3606 }
3607}
3608
3609Datum
3610pg_get_function_sqlbody(PG_FUNCTION_ARGS)
3611{
3612 Oid funcid = PG_GETARG_OID(0);
3613 StringInfoData buf;
3614 HeapTuple proctup;
3615 bool isnull;
3616
3617 initStringInfo(&buf);
3618
3619 /* Look up the function */
3620 proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
3621 if (!HeapTupleIsValid(proctup))
3622 PG_RETURN_NULL();
3623
3624 (void) SysCacheGetAttr(PROCOID, proctup, Anum_pg_proc_prosqlbody, &isnull);
3625 if (isnull)
3626 {
3627 ReleaseSysCache(proctup);
3628 PG_RETURN_NULL();
3629 }
3630
3631 print_function_sqlbody(&buf, proctup);
3632
3633 ReleaseSysCache(proctup);
3634
3635 PG_RETURN_TEXT_P(cstring_to_text_with_len(buf.data, buf.len));
3636}
3637
3638
3639/*
3640 * deparse_expression - General utility for deparsing expressions
3641 *
3642 * calls deparse_expression_pretty with all prettyPrinting disabled
3643 */
3644char *
3645deparse_expression(Node *expr, List *dpcontext,
3646 bool forceprefix, bool showimplicit)
3647{
3648 return deparse_expression_pretty(expr, dpcontext, forceprefix,
3649 showimplicit, 0, 0);
3650}
3651
3652/* ----------
3653 * deparse_expression_pretty - General utility for deparsing expressions
3654 *
3655 * expr is the node tree to be deparsed. It must be a transformed expression
3656 * tree (ie, not the raw output of gram.y).
3657 *
3658 * dpcontext is a list of deparse_namespace nodes representing the context
3659 * for interpreting Vars in the node tree. It can be NIL if no Vars are
3660 * expected.
3661 *
3662 * forceprefix is true to force all Vars to be prefixed with their table names.
3663 *
3664 * showimplicit is true to force all implicit casts to be shown explicitly.
3665 *
3666 * Tries to pretty up the output according to prettyFlags and startIndent.
3667 *
3668 * The result is a palloc'd string.
3669 * ----------
3670 */
3671static char *
3672deparse_expression_pretty(Node *expr, List *dpcontext,
3673 bool forceprefix, bool showimplicit,
3674 int prettyFlags, int startIndent)
3675{
3676 StringInfoData buf;
3677 deparse_context context;
3678
3679 initStringInfo(&buf);
3680 context.buf = &buf;
3681 context.namespaces = dpcontext;
3682 context.resultDesc = NULL;
3683 context.targetList = NIL;
3684 context.windowClause = NIL;
3685 context.varprefix = forceprefix;
3686 context.prettyFlags = prettyFlags;
3687 context.wrapColumn = WRAP_COLUMN_DEFAULT;
3688 context.indentLevel = startIndent;
3689 context.colNamesVisible = true;
3690 context.inGroupBy = false;
3691 context.varInOrderBy = false;
3692 context.appendparents = NULL;
3693
3694 get_rule_expr(expr, &context, showimplicit);
3695
3696 return buf.data;
3697}
3698
3699/* ----------
3700 * deparse_context_for - Build deparse context for a single relation
3701 *
3702 * Given the reference name (alias) and OID of a relation, build deparsing
3703 * context for an expression referencing only that relation (as varno 1,
3704 * varlevelsup 0). This is sufficient for many uses of deparse_expression.
3705 * ----------
3706 */
3707List *
3708deparse_context_for(const char *aliasname, Oid relid)
3709{
3710 deparse_namespace *dpns;
3711 RangeTblEntry *rte;
3712
3713 dpns = (deparse_namespace *) palloc0(sizeof(deparse_namespace));
3714
3715 /* Build a minimal RTE for the rel */
3716 rte = makeNode(RangeTblEntry);
3717 rte->rtekind = RTE_RELATION;
3718 rte->relid = relid;
3719 rte->relkind = RELKIND_RELATION; /* no need for exactness here */
3720 rte->rellockmode = AccessShareLock;
3721 rte->alias = makeAlias(aliasname, NIL);
3722 rte->eref = rte->alias;
3723 rte->lateral = false;
3724 rte->inh = false;
3725 rte->inFromCl = true;
3726
3727 /* Build one-element rtable */
3728 dpns->rtable = list_make1(rte);
3729 dpns->subplans = NIL;
3730 dpns->ctes = NIL;
3731 dpns->appendrels = NULL;
3732 set_rtable_names(dpns, NIL, NULL);
3733 set_simple_column_names(dpns);
3734
3735 /* Return a one-deep namespace stack */
3736 return list_make1(dpns);
3737}
3738
3739/*
3740 * deparse_context_for_plan_tree - Build deparse context for a Plan tree
3741 *
3742 * When deparsing an expression in a Plan tree, we use the plan's rangetable
3743 * to resolve names of simple Vars. The initialization of column names for
3744 * this is rather expensive if the rangetable is large, and it'll be the same
3745 * for every expression in the Plan tree; so we do it just once and re-use
3746 * the result of this function for each expression. (Note that the result
3747 * is not usable until set_deparse_context_plan() is applied to it.)
3748 *
3749 * In addition to the PlannedStmt, pass the per-RTE alias names
3750 * assigned by a previous call to select_rtable_names_for_explain.
3751 */
3752List *
3753deparse_context_for_plan_tree(PlannedStmt *pstmt, List *rtable_names)
3754{
3755 deparse_namespace *dpns;
3756
3757 dpns = (deparse_namespace *) palloc0(sizeof(deparse_namespace));
3758
3759 /* Initialize fields that stay the same across the whole plan tree */
3760 dpns->rtable = pstmt->rtable;
3761 dpns->rtable_names = rtable_names;
3762 dpns->subplans = pstmt->subplans;
3763 dpns->ctes = NIL;
3764 if (pstmt->appendRelations)
3765 {
3766 /* Set up the array, indexed by child relid */
3767 int ntables = list_length(dpns->rtable);
3768 ListCell *lc;
3769
3770 dpns->appendrels = (AppendRelInfo **)
3771 palloc0((ntables + 1) * sizeof(AppendRelInfo *));
3772 foreach(lc, pstmt->appendRelations)
3773 {
3774 AppendRelInfo *appinfo = lfirst_node(AppendRelInfo, lc);
3775 Index crelid = appinfo->child_relid;
3776
3777 Assert(crelid > 0 && crelid <= ntables);
3778 Assert(dpns->appendrels[crelid] == NULL);
3779 dpns->appendrels[crelid] = appinfo;
3780 }
3781 }
3782 else
3783 dpns->appendrels = NULL; /* don't need it */
3784
3785 /*
3786 * Set up column name aliases, ignoring any join RTEs; they don't matter
3787 * because plan trees don't contain any join alias Vars.
3788 */
3789 set_simple_column_names(dpns);
3790
3791 /* Return a one-deep namespace stack */
3792 return list_make1(dpns);
3793}
3794
3795/*
3796 * set_deparse_context_plan - Specify Plan node containing expression
3797 *
3798 * When deparsing an expression in a Plan tree, we might have to resolve
3799 * OUTER_VAR, INNER_VAR, or INDEX_VAR references. To do this, the caller must
3800 * provide the parent Plan node. Then OUTER_VAR and INNER_VAR references
3801 * can be resolved by drilling down into the left and right child plans.
3802 * Similarly, INDEX_VAR references can be resolved by reference to the
3803 * indextlist given in a parent IndexOnlyScan node, or to the scan tlist in
3804 * ForeignScan and CustomScan nodes. (Note that we don't currently support
3805 * deparsing of indexquals in regular IndexScan or BitmapIndexScan nodes;
3806 * for those, we can only deparse the indexqualorig fields, which won't
3807 * contain INDEX_VAR Vars.)
3808 *
3809 * The ancestors list is a list of the Plan's parent Plan and SubPlan nodes,
3810 * the most-closely-nested first. This is needed to resolve PARAM_EXEC
3811 * Params. Note we assume that all the Plan nodes share the same rtable.
3812 *
3813 * For a ModifyTable plan, we might also need to resolve references to OLD/NEW
3814 * variables in the RETURNING list, so we copy the alias names of the OLD and
3815 * NEW rows from the ModifyTable plan node.
3816 *
3817 * Once this function has been called, deparse_expression() can be called on
3818 * subsidiary expression(s) of the specified Plan node. To deparse
3819 * expressions of a different Plan node in the same Plan tree, re-call this
3820 * function to identify the new parent Plan node.
3821 *
3822 * The result is the same List passed in; this is a notational convenience.
3823 */
3824List *
3825set_deparse_context_plan(List *dpcontext, Plan *plan, List *ancestors)
3826{
3827 deparse_namespace *dpns;
3828
3829 /* Should always have one-entry namespace list for Plan deparsing */
3830 Assert(list_length(dpcontext) == 1);
3831 dpns = (deparse_namespace *) linitial(dpcontext);
3832
3833 /* Set our attention on the specific plan node passed in */
3834 dpns->ancestors = ancestors;
3835 set_deparse_plan(dpns, plan);
3836
3837 /* For ModifyTable, set aliases for OLD and NEW in RETURNING */
3838 if (IsA(plan, ModifyTable))
3839 {
3840 dpns->ret_old_alias = ((ModifyTable *) plan)->returningOldAlias;
3841 dpns->ret_new_alias = ((ModifyTable *) plan)->returningNewAlias;
3842 }
3843
3844 return dpcontext;
3845}
3846
3847/*
3848 * select_rtable_names_for_explain - Select RTE aliases for EXPLAIN
3849 *
3850 * Determine the relation aliases we'll use during an EXPLAIN operation.
3851 * This is just a frontend to set_rtable_names. We have to expose the aliases
3852 * to EXPLAIN because EXPLAIN needs to know the right alias names to print.
3853 */
3854List *
3855select_rtable_names_for_explain(List *rtable, Bitmapset *rels_used)
3856{
3857 deparse_namespace dpns;
3858
3859 memset(&dpns, 0, sizeof(dpns));
3860 dpns.rtable = rtable;
3861 dpns.subplans = NIL;
3862 dpns.ctes = NIL;
3863 dpns.appendrels = NULL;
3864 set_rtable_names(&dpns, NIL, rels_used);
3865 /* We needn't bother computing column aliases yet */
3866
3867 return dpns.rtable_names;
3868}
3869
3870/*
3871 * set_rtable_names: select RTE aliases to be used in printing a query
3872 *
3873 * We fill in dpns->rtable_names with a list of names that is one-for-one with
3874 * the already-filled dpns->rtable list. Each RTE name is unique among those
3875 * in the new namespace plus any ancestor namespaces listed in
3876 * parent_namespaces.
3877 *
3878 * If rels_used isn't NULL, only RTE indexes listed in it are given aliases.
3879 *
3880 * Note that this function is only concerned with relation names, not column
3881 * names.
3882 */
3883static void
3884set_rtable_names(deparse_namespace *dpns, List *parent_namespaces,
3885 Bitmapset *rels_used)
3886{
3887 HASHCTL hash_ctl;
3888 HTAB *names_hash;
3889 NameHashEntry *hentry;
3890 bool found;
3891 int rtindex;
3892 ListCell *lc;
3893
3894 dpns->rtable_names = NIL;
3895 /* nothing more to do if empty rtable */
3896 if (dpns->rtable == NIL)
3897 return;
3898
3899 /*
3900 * We use a hash table to hold known names, so that this process is O(N)
3901 * not O(N^2) for N names.
3902 */
3903 hash_ctl.keysize = NAMEDATALEN;
3904 hash_ctl.entrysize = sizeof(NameHashEntry);
3905 hash_ctl.hcxt = CurrentMemoryContext;
3906 names_hash = hash_create("set_rtable_names names",
3907 list_length(dpns->rtable),
3908 &hash_ctl,
3909 HASH_ELEM | HASH_STRINGS | HASH_CONTEXT);
3910
3911 /* Preload the hash table with names appearing in parent_namespaces */
3912 foreach(lc, parent_namespaces)
3913 {
3914 deparse_namespace *olddpns = (deparse_namespace *) lfirst(lc);
3915 ListCell *lc2;
3916
3917 foreach(lc2, olddpns->rtable_names)
3918 {
3919 char *oldname = (char *) lfirst(lc2);
3920
3921 if (oldname == NULL)
3922 continue;
3923 hentry = (NameHashEntry *) hash_search(names_hash,
3924 oldname,
3925 HASH_ENTER,
3926 &found);
3927 /* we do not complain about duplicate names in parent namespaces */
3928 hentry->counter = 0;
3929 }
3930 }
3931
3932 /* Now we can scan the rtable */
3933 rtindex = 1;
3934 foreach(lc, dpns->rtable)
3935 {
3936 RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
3937 char *refname;
3938
3939 /* Just in case this takes an unreasonable amount of time ... */
3940 CHECK_FOR_INTERRUPTS();
3941
3942 if (rels_used && !bms_is_member(rtindex, rels_used))
3943 {
3944 /* Ignore unreferenced RTE */
3945 refname = NULL;
3946 }
3947 else if (rte->alias)
3948 {
3949 /* If RTE has a user-defined alias, prefer that */
3950 refname = rte->alias->aliasname;
3951 }
3952 else if (rte->rtekind == RTE_RELATION)
3953 {
3954 /* Use the current actual name of the relation */
3955 refname = get_rel_name(rte->relid);
3956 }
3957 else if (rte->rtekind == RTE_JOIN)
3958 {
3959 /* Unnamed join has no refname */
3960 refname = NULL;
3961 }
3962 else
3963 {
3964 /* Otherwise use whatever the parser assigned */
3965 refname = rte->eref->aliasname;
3966 }
3967
3968 /*
3969 * If the selected name isn't unique, append digits to make it so, and
3970 * make a new hash entry for it once we've got a unique name. For a
3971 * very long input name, we might have to truncate to stay within
3972 * NAMEDATALEN.
3973 */
3974 if (refname)
3975 {
3976 hentry = (NameHashEntry *) hash_search(names_hash,
3977 refname,
3978 HASH_ENTER,
3979 &found);
3980 if (found)
3981 {
3982 /* Name already in use, must choose a new one */
3983 int refnamelen = strlen(refname);
3984 char *modname = (char *) palloc(refnamelen + 16);
3985 NameHashEntry *hentry2;
3986
3987 do
3988 {
3989 hentry->counter++;
3990 for (;;)
3991 {
3992 memcpy(modname, refname, refnamelen);
3993 sprintf(modname + refnamelen, "_%d", hentry->counter);
3994 if (strlen(modname) < NAMEDATALEN)
3995 break;
3996 /* drop chars from refname to keep all the digits */
3997 refnamelen = pg_mbcliplen(refname, refnamelen,
3998 refnamelen - 1);
3999 }
4000 hentry2 = (NameHashEntry *) hash_search(names_hash,
4001 modname,
4002 HASH_ENTER,
4003 &found);
4004 } while (found);
4005 hentry2->counter = 0; /* init new hash entry */
4006 refname = modname;
4007 }
4008 else
4009 {
4010 /* Name not previously used, need only initialize hentry */
4011 hentry->counter = 0;
4012 }
4013 }
4014
4015 dpns->rtable_names = lappend(dpns->rtable_names, refname);
4016 rtindex++;
4017 }
4018
4019 hash_destroy(names_hash);
4020}
4021
4022/*
4023 * set_deparse_for_query: set up deparse_namespace for deparsing a Query tree
4024 *
4025 * For convenience, this is defined to initialize the deparse_namespace struct
4026 * from scratch.
4027 */
4028static void
4029set_deparse_for_query(deparse_namespace *dpns, Query *query,
4030 List *parent_namespaces)
4031{
4032 ListCell *lc;
4033 ListCell *lc2;
4034
4035 /* Initialize *dpns and fill rtable/ctes links */
4036 memset(dpns, 0, sizeof(deparse_namespace));
4037 dpns->rtable = query->rtable;
4038 dpns->subplans = NIL;
4039 dpns->ctes = query->cteList;
4040 dpns->appendrels = NULL;
4041 dpns->ret_old_alias = query->returningOldAlias;
4042 dpns->ret_new_alias = query->returningNewAlias;
4043
4044 /* Assign a unique relation alias to each RTE */
4045 set_rtable_names(dpns, parent_namespaces, NULL);
4046
4047 /* Initialize dpns->rtable_columns to contain zeroed structs */
4048 dpns->rtable_columns = NIL;
4049 while (list_length(dpns->rtable_columns) < list_length(dpns->rtable))
4050 dpns->rtable_columns = lappend(dpns->rtable_columns,
4051 palloc0(sizeof(deparse_columns)));
4052
4053 /* If it's a utility query, it won't have a jointree */
4054 if (query->jointree)
4055 {
4056 /* Detect whether global uniqueness of USING names is needed */
4057 dpns->unique_using =
4058 has_dangerous_join_using(dpns, (Node *) query->jointree);
4059
4060 /*
4061 * Select names for columns merged by USING, via a recursive pass over
4062 * the query jointree.
4063 */
4064 set_using_names(dpns, (Node *) query->jointree, NIL);
4065 }
4066
4067 /*
4068 * Now assign remaining column aliases for each RTE. We do this in a
4069 * linear scan of the rtable, so as to process RTEs whether or not they
4070 * are in the jointree (we mustn't miss NEW.*, INSERT target relations,
4071 * etc). JOIN RTEs must be processed after their children, but this is
4072 * okay because they appear later in the rtable list than their children
4073 * (cf Asserts in identify_join_columns()).
4074 */
4075 forboth(lc, dpns->rtable, lc2, dpns->rtable_columns)
4076 {
4077 RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
4078 deparse_columns *colinfo = (deparse_columns *) lfirst(lc2);
4079
4080 if (rte->rtekind == RTE_JOIN)
4081 set_join_column_names(dpns, rte, colinfo);
4082 else
4083 set_relation_column_names(dpns, rte, colinfo);
4084 }
4085}
4086
4087/*
4088 * set_simple_column_names: fill in column aliases for non-query situations
4089 *
4090 * This handles EXPLAIN and cases where we only have relation RTEs. Without
4091 * a join tree, we can't do anything smart about join RTEs, but we don't
4092 * need to, because EXPLAIN should never see join alias Vars anyway.
4093 * If we find a join RTE we'll just skip it, leaving its deparse_columns
4094 * struct all-zero. If somehow we try to deparse a join alias Var, we'll
4095 * error out cleanly because the struct's num_cols will be zero.
4096 */
4097static void
4098set_simple_column_names(deparse_namespace *dpns)
4099{
4100 ListCell *lc;
4101 ListCell *lc2;
4102
4103 /* Initialize dpns->rtable_columns to contain zeroed structs */
4104 dpns->rtable_columns = NIL;
4105 while (list_length(dpns->rtable_columns) < list_length(dpns->rtable))
4106 dpns->rtable_columns = lappend(dpns->rtable_columns,
4107 palloc0(sizeof(deparse_columns)));
4108
4109 /* Assign unique column aliases within each non-join RTE */
4110 forboth(lc, dpns->rtable, lc2, dpns->rtable_columns)
4111 {
4112 RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
4113 deparse_columns *colinfo = (deparse_columns *) lfirst(lc2);
4114
4115 if (rte->rtekind != RTE_JOIN)
4116 set_relation_column_names(dpns, rte, colinfo);
4117 }
4118}
4119
4120/*
4121 * has_dangerous_join_using: search jointree for unnamed JOIN USING
4122 *
4123 * Merged columns of a JOIN USING may act differently from either of the input
4124 * columns, either because they are merged with COALESCE (in a FULL JOIN) or
4125 * because an implicit coercion of the underlying input column is required.
4126 * In such a case the column must be referenced as a column of the JOIN not as
4127 * a column of either input. And this is problematic if the join is unnamed
4128 * (alias-less): we cannot qualify the column's name with an RTE name, since
4129 * there is none. (Forcibly assigning an alias to the join is not a solution,
4130 * since that will prevent legal references to tables below the join.)
4131 * To ensure that every column in the query is unambiguously referenceable,
4132 * we must assign such merged columns names that are globally unique across
4133 * the whole query, aliasing other columns out of the way as necessary.
4134 *
4135 * Because the ensuing re-aliasing is fairly damaging to the readability of
4136 * the query, we don't do this unless we have to. So, we must pre-scan
4137 * the join tree to see if we have to, before starting set_using_names().
4138 */
4139static bool
4140has_dangerous_join_using(deparse_namespace *dpns, Node *jtnode)
4141{
4142 if (IsA(jtnode, RangeTblRef))
4143 {
4144 /* nothing to do here */
4145 }
4146 else if (IsA(jtnode, FromExpr))
4147 {
4148 FromExpr *f = (FromExpr *) jtnode;
4149 ListCell *lc;
4150
4151 foreach(lc, f->fromlist)
4152 {
4153 if (has_dangerous_join_using(dpns, (Node *) lfirst(lc)))
4154 return true;
4155 }
4156 }
4157 else if (IsA(jtnode, JoinExpr))
4158 {
4159 JoinExpr *j = (JoinExpr *) jtnode;
4160
4161 /* Is it an unnamed JOIN with USING? */
4162 if (j->alias == NULL && j->usingClause)
4163 {
4164 /*
4165 * Yes, so check each join alias var to see if any of them are not
4166 * simple references to underlying columns. If so, we have a
4167 * dangerous situation and must pick unique aliases.
4168 */
4169 RangeTblEntry *jrte = rt_fetch(j->rtindex, dpns->rtable);
4170
4171 /* We need only examine the merged columns */
4172 for (int i = 0; i < jrte->joinmergedcols; i++)
4173 {
4174 Node *aliasvar = list_nth(jrte->joinaliasvars, i);
4175
4176 if (!IsA(aliasvar, Var))
4177 return true;
4178 }
4179 }
4180
4181 /* Nope, but inspect children */
4182 if (has_dangerous_join_using(dpns, j->larg))
4183 return true;
4184 if (has_dangerous_join_using(dpns, j->rarg))
4185 return true;
4186 }
4187 else
4188 elog(ERROR, "unrecognized node type: %d",
4189 (int) nodeTag(jtnode));
4190 return false;
4191}
4192
4193/*
4194 * set_using_names: select column aliases to be used for merged USING columns
4195 *
4196 * We do this during a recursive descent of the query jointree.
4197 * dpns->unique_using must already be set to determine the global strategy.
4198 *
4199 * Column alias info is saved in the dpns->rtable_columns list, which is
4200 * assumed to be filled with pre-zeroed deparse_columns structs.
4201 *
4202 * parentUsing is a list of all USING aliases assigned in parent joins of
4203 * the current jointree node. (The passed-in list must not be modified.)
4204 *
4205 * Note that we do not use per-deparse_columns hash tables in this function.
4206 * The number of names that need to be assigned should be small enough that
4207 * we don't need to trouble with that.
4208 */
4209static void
4210set_using_names(deparse_namespace *dpns, Node *jtnode, List *parentUsing)
4211{
4212 if (IsA(jtnode, RangeTblRef))
4213 {
4214 /* nothing to do now */
4215 }
4216 else if (IsA(jtnode, FromExpr))
4217 {
4218 FromExpr *f = (FromExpr *) jtnode;
4219 ListCell *lc;
4220
4221 foreach(lc, f->fromlist)
4222 set_using_names(dpns, (Node *) lfirst(lc), parentUsing);
4223 }
4224 else if (IsA(jtnode, JoinExpr))
4225 {
4226 JoinExpr *j = (JoinExpr *) jtnode;
4227 RangeTblEntry *rte = rt_fetch(j->rtindex, dpns->rtable);
4228 deparse_columns *colinfo = deparse_columns_fetch(j->rtindex, dpns);
4229 int *leftattnos;
4230 int *rightattnos;
4231 deparse_columns *leftcolinfo;
4232 deparse_columns *rightcolinfo;
4233 int i;
4234 ListCell *lc;
4235
4236 /* Get info about the shape of the join */
4237 identify_join_columns(j, rte, colinfo);
4238 leftattnos = colinfo->leftattnos;
4239 rightattnos = colinfo->rightattnos;
4240
4241 /* Look up the not-yet-filled-in child deparse_columns structs */
4242 leftcolinfo = deparse_columns_fetch(colinfo->leftrti, dpns);
4243 rightcolinfo = deparse_columns_fetch(colinfo->rightrti, dpns);
4244
4245 /*
4246 * If this join is unnamed, then we cannot substitute new aliases at
4247 * this level, so any name requirements pushed down to here must be
4248 * pushed down again to the children.
4249 */
4250 if (rte->alias == NULL)
4251 {
4252 for (i = 0; i < colinfo->num_cols; i++)
4253 {
4254 char *colname = colinfo->colnames[i];
4255
4256 if (colname == NULL)
4257 continue;
4258
4259 /* Push down to left column, unless it's a system column */
4260 if (leftattnos[i] > 0)
4261 {
4262 expand_colnames_array_to(leftcolinfo, leftattnos[i]);
4263 leftcolinfo->colnames[leftattnos[i] - 1] = colname;
4264 }
4265
4266 /* Same on the righthand side */
4267 if (rightattnos[i] > 0)
4268 {
4269 expand_colnames_array_to(rightcolinfo, rightattnos[i]);
4270 rightcolinfo->colnames[rightattnos[i] - 1] = colname;
4271 }
4272 }
4273 }
4274
4275 /*
4276 * If there's a USING clause, select the USING column names and push
4277 * those names down to the children. We have two strategies:
4278 *
4279 * If dpns->unique_using is true, we force all USING names to be
4280 * unique across the whole query level. In principle we'd only need
4281 * the names of dangerous USING columns to be globally unique, but to
4282 * safely assign all USING names in a single pass, we have to enforce
4283 * the same uniqueness rule for all of them. However, if a USING
4284 * column's name has been pushed down from the parent, we should use
4285 * it as-is rather than making a uniqueness adjustment. This is
4286 * necessary when we're at an unnamed join, and it creates no risk of
4287 * ambiguity. Also, if there's a user-written output alias for a
4288 * merged column, we prefer to use that rather than the input name;
4289 * this simplifies the logic and seems likely to lead to less aliasing
4290 * overall.
4291 *
4292 * If dpns->unique_using is false, we only need USING names to be
4293 * unique within their own join RTE. We still need to honor
4294 * pushed-down names, though.
4295 *
4296 * Though significantly different in results, these two strategies are
4297 * implemented by the same code, with only the difference of whether
4298 * to put assigned names into dpns->using_names.
4299 */
4300 if (j->usingClause)
4301 {
4302 /* Copy the input parentUsing list so we don't modify it */
4303 parentUsing = list_copy(parentUsing);
4304
4305 /* USING names must correspond to the first join output columns */
4306 expand_colnames_array_to(colinfo, list_length(j->usingClause));
4307 i = 0;
4308 foreach(lc, j->usingClause)
4309 {
4310 char *colname = strVal(lfirst(lc));
4311
4312 /* Assert it's a merged column */
4313 Assert(leftattnos[i] != 0 && rightattnos[i] != 0);
4314
4315 /* Adopt passed-down name if any, else select unique name */
4316 if (colinfo->colnames[i] != NULL)
4317 colname = colinfo->colnames[i];
4318 else
4319 {
4320 /* Prefer user-written output alias if any */
4321 if (rte->alias && i < list_length(rte->alias->colnames))
4322 colname = strVal(list_nth(rte->alias->colnames, i));
4323 /* Make it appropriately unique */
4324 colname = make_colname_unique(colname, dpns, colinfo);
4325 if (dpns->unique_using)
4326 dpns->using_names = lappend(dpns->using_names,
4327 colname);
4328 /* Save it as output column name, too */
4329 colinfo->colnames[i] = colname;
4330 }
4331
4332 /* Remember selected names for use later */
4333 colinfo->usingNames = lappend(colinfo->usingNames, colname);
4334 parentUsing = lappend(parentUsing, colname);
4335
4336 /* Push down to left column, unless it's a system column */
4337 if (leftattnos[i] > 0)
4338 {
4339 expand_colnames_array_to(leftcolinfo, leftattnos[i]);
4340 leftcolinfo->colnames[leftattnos[i] - 1] = colname;
4341 }
4342
4343 /* Same on the righthand side */
4344 if (rightattnos[i] > 0)
4345 {
4346 expand_colnames_array_to(rightcolinfo, rightattnos[i]);
4347 rightcolinfo->colnames[rightattnos[i] - 1] = colname;
4348 }
4349
4350 i++;
4351 }
4352 }
4353
4354 /* Mark child deparse_columns structs with correct parentUsing info */
4355 leftcolinfo->parentUsing = parentUsing;
4356 rightcolinfo->parentUsing = parentUsing;
4357
4358 /* Now recursively assign USING column names in children */
4359 set_using_names(dpns, j->larg, parentUsing);
4360 set_using_names(dpns, j->rarg, parentUsing);
4361 }
4362 else
4363 elog(ERROR, "unrecognized node type: %d",
4364 (int) nodeTag(jtnode));
4365}
4366
4367/*
4368 * set_relation_column_names: select column aliases for a non-join RTE
4369 *
4370 * Column alias info is saved in *colinfo, which is assumed to be pre-zeroed.
4371 * If any colnames entries are already filled in, those override local
4372 * choices.
4373 */
4374static void
4375set_relation_column_names(deparse_namespace *dpns, RangeTblEntry *rte,
4376 deparse_columns *colinfo)
4377{
4378 int ncolumns;
4379 char **real_colnames;
4380 bool changed_any;
4381 int noldcolumns;
4382 int i;
4383 int j;
4384
4385 /*
4386 * Construct an array of the current "real" column names of the RTE.
4387 * real_colnames[] will be indexed by physical column number, with NULL
4388 * entries for dropped columns.
4389 */
4390 if (rte->rtekind == RTE_RELATION)
4391 {
4392 /* Relation --- look to the system catalogs for up-to-date info */
4393 Relation rel;
4394 TupleDesc tupdesc;
4395
4396 rel = relation_open(rte->relid, AccessShareLock);
4397 tupdesc = RelationGetDescr(rel);
4398
4399 ncolumns = tupdesc->natts;
4400 real_colnames = (char **) palloc(ncolumns * sizeof(char *));
4401
4402 for (i = 0; i < ncolumns; i++)
4403 {
4404 Form_pg_attribute attr = TupleDescAttr(tupdesc, i);
4405
4406 if (attr->attisdropped)
4407 real_colnames[i] = NULL;
4408 else
4409 real_colnames[i] = pstrdup(NameStr(attr->attname));
4410 }
4411 relation_close(rel, AccessShareLock);
4412 }
4413 else
4414 {
4415 /* Otherwise get the column names from eref or expandRTE() */
4416 List *colnames;
4417 ListCell *lc;
4418
4419 /*
4420 * Functions returning composites have the annoying property that some
4421 * of the composite type's columns might have been dropped since the
4422 * query was parsed. If possible, use expandRTE() to handle that
4423 * case, since it has the tedious logic needed to find out about
4424 * dropped columns. However, if we're explaining a plan, then we
4425 * don't have rte->functions because the planner thinks that won't be
4426 * needed later, and that breaks expandRTE(). So in that case we have
4427 * to rely on rte->eref, which may lead us to report a dropped
4428 * column's old name; that seems close enough for EXPLAIN's purposes.
4429 *
4430 * For non-RELATION, non-FUNCTION RTEs, we can just look at rte->eref,
4431 * which should be sufficiently up-to-date: no other RTE types can
4432 * have columns get dropped from under them after parsing.
4433 */
4434 if (rte->rtekind == RTE_FUNCTION && rte->functions != NIL)
4435 {
4436 /* Since we're not creating Vars, rtindex etc. don't matter */
4437 expandRTE(rte, 1, 0, VAR_RETURNING_DEFAULT, -1,
4438 true /* include dropped */ , &colnames, NULL);
4439 }
4440 else
4441 colnames = rte->eref->colnames;
4442
4443 ncolumns = list_length(colnames);
4444 real_colnames = (char **) palloc(ncolumns * sizeof(char *));
4445
4446 i = 0;
4447 foreach(lc, colnames)
4448 {
4449 /*
4450 * If the column name we find here is an empty string, then it's a
4451 * dropped column, so change to NULL.
4452 */
4453 char *cname = strVal(lfirst(lc));
4454
4455 if (cname[0] == '\0')
4456 cname = NULL;
4457 real_colnames[i] = cname;
4458 i++;
4459 }
4460 }
4461
4462 /*
4463 * Ensure colinfo->colnames has a slot for each column. (It could be long
4464 * enough already, if we pushed down a name for the last column.) Note:
4465 * it's possible that there are now more columns than there were when the
4466 * query was parsed, ie colnames could be longer than rte->eref->colnames.
4467 * We must assign unique aliases to the new columns too, else there could
4468 * be unresolved conflicts when the view/rule is reloaded.
4469 */
4470 expand_colnames_array_to(colinfo, ncolumns);
4471 Assert(colinfo->num_cols == ncolumns);
4472
4473 /*
4474 * Make sufficiently large new_colnames and is_new_col arrays, too.
4475 *
4476 * Note: because we leave colinfo->num_new_cols zero until after the loop,
4477 * colname_is_unique will not consult that array, which is fine because it
4478 * would only be duplicate effort.
4479 */
4480 colinfo->new_colnames = (char **) palloc(ncolumns * sizeof(char *));
4481 colinfo->is_new_col = (bool *) palloc(ncolumns * sizeof(bool));
4482
4483 /* If the RTE is wide enough, use a hash table to avoid O(N^2) costs */
4484 build_colinfo_names_hash(colinfo);
4485
4486 /*
4487 * Scan the columns, select a unique alias for each one, and store it in
4488 * colinfo->colnames and colinfo->new_colnames. The former array has NULL
4489 * entries for dropped columns, the latter omits them. Also mark
4490 * new_colnames entries as to whether they are new since parse time; this
4491 * is the case for entries beyond the length of rte->eref->colnames.
4492 */
4493 noldcolumns = list_length(rte->eref->colnames);
4494 changed_any = false;
4495 j = 0;
4496 for (i = 0; i < ncolumns; i++)
4497 {
4498 char *real_colname = real_colnames[i];
4499 char *colname = colinfo->colnames[i];
4500
4501 /* Skip dropped columns */
4502 if (real_colname == NULL)
4503 {
4504 Assert(colname == NULL); /* colnames[i] is already NULL */
4505 continue;
4506 }
4507
4508 /* If alias already assigned, that's what to use */
4509 if (colname == NULL)
4510 {
4511 /* If user wrote an alias, prefer that over real column name */
4512 if (rte->alias && i < list_length(rte->alias->colnames))
4513 colname = strVal(list_nth(rte->alias->colnames, i));
4514 else
4515 colname = real_colname;
4516
4517 /* Unique-ify and insert into colinfo */
4518 colname = make_colname_unique(colname, dpns, colinfo);
4519
4520 colinfo->colnames[i] = colname;
4521 add_to_names_hash(colinfo, colname);
4522 }
4523
4524 /* Put names of non-dropped columns in new_colnames[] too */
4525 colinfo->new_colnames[j] = colname;
4526 /* And mark them as new or not */
4527 colinfo->is_new_col[j] = (i >= noldcolumns);
4528 j++;
4529
4530 /* Remember if any assigned aliases differ from "real" name */
4531 if (!changed_any && strcmp(colname, real_colname) != 0)
4532 changed_any = true;
4533 }
4534
4535 /* We're now done needing the colinfo's names_hash */
4536 destroy_colinfo_names_hash(colinfo);
4537
4538 /*
4539 * Set correct length for new_colnames[] array. (Note: if columns have
4540 * been added, colinfo->num_cols includes them, which is not really quite
4541 * right but is harmless, since any new columns must be at the end where
4542 * they won't affect varattnos of pre-existing columns.)
4543 */
4544 colinfo->num_new_cols = j;
4545
4546 /*
4547 * For a relation RTE, we need only print the alias column names if any
4548 * are different from the underlying "real" names. For a function RTE,
4549 * always emit a complete column alias list; this is to protect against
4550 * possible instability of the default column names (eg, from altering
4551 * parameter names). For tablefunc RTEs, we never print aliases, because
4552 * the column names are part of the clause itself. For other RTE types,
4553 * print if we changed anything OR if there were user-written column
4554 * aliases (since the latter would be part of the underlying "reality").
4555 */
4556 if (rte->rtekind == RTE_RELATION)
4557 colinfo->printaliases = changed_any;
4558 else if (rte->rtekind == RTE_FUNCTION)
4559 colinfo->printaliases = true;
4560 else if (rte->rtekind == RTE_TABLEFUNC)
4561 colinfo->printaliases = false;
4562 else if (rte->alias && rte->alias->colnames != NIL)
4563 colinfo->printaliases = true;
4564 else
4565 colinfo->printaliases = changed_any;
4566}
4567
4568/*
4569 * set_join_column_names: select column aliases for a join RTE
4570 *
4571 * Column alias info is saved in *colinfo, which is assumed to be pre-zeroed.
4572 * If any colnames entries are already filled in, those override local
4573 * choices. Also, names for USING columns were already chosen by
4574 * set_using_names(). We further expect that column alias selection has been
4575 * completed for both input RTEs.
4576 */
4577static void
4578set_join_column_names(deparse_namespace *dpns, RangeTblEntry *rte,
4579 deparse_columns *colinfo)
4580{
4581 deparse_columns *leftcolinfo;
4582 deparse_columns *rightcolinfo;
4583 bool changed_any;
4584 int noldcolumns;
4585 int nnewcolumns;
4586 Bitmapset *leftmerged = NULL;
4587 Bitmapset *rightmerged = NULL;
4588 int i;
4589 int j;
4590 int ic;
4591 int jc;
4592
4593 /* Look up the previously-filled-in child deparse_columns structs */
4594 leftcolinfo = deparse_columns_fetch(colinfo->leftrti, dpns);
4595 rightcolinfo = deparse_columns_fetch(colinfo->rightrti, dpns);
4596
4597 /*
4598 * Ensure colinfo->colnames has a slot for each column. (It could be long
4599 * enough already, if we pushed down a name for the last column.) Note:
4600 * it's possible that one or both inputs now have more columns than there
4601 * were when the query was parsed, but we'll deal with that below. We
4602 * only need entries in colnames for pre-existing columns.
4603 */
4604 noldcolumns = list_length(rte->eref->colnames);
4605 expand_colnames_array_to(colinfo, noldcolumns);
4606 Assert(colinfo->num_cols == noldcolumns);
4607
4608 /* If the RTE is wide enough, use a hash table to avoid O(N^2) costs */
4609 build_colinfo_names_hash(colinfo);
4610
4611 /*
4612 * Scan the join output columns, select an alias for each one, and store
4613 * it in colinfo->colnames. If there are USING columns, set_using_names()
4614 * already selected their names, so we can start the loop at the first
4615 * non-merged column.
4616 */
4617 changed_any = false;
4618 for (i = list_length(colinfo->usingNames); i < noldcolumns; i++)
4619 {
4620 char *colname = colinfo->colnames[i];
4621 char *real_colname;
4622
4623 /* Join column must refer to at least one input column */
4624 Assert(colinfo->leftattnos[i] != 0 || colinfo->rightattnos[i] != 0);
4625
4626 /* Get the child column name */
4627 if (colinfo->leftattnos[i] > 0)
4628 real_colname = leftcolinfo->colnames[colinfo->leftattnos[i] - 1];
4629 else if (colinfo->rightattnos[i] > 0)
4630 real_colname = rightcolinfo->colnames[colinfo->rightattnos[i] - 1];
4631 else
4632 {
4633 /* We're joining system columns --- use eref name */
4634 real_colname = strVal(list_nth(rte->eref->colnames, i));
4635 }
4636
4637 /* If child col has been dropped, no need to assign a join colname */
4638 if (real_colname == NULL)
4639 {
4640 colinfo->colnames[i] = NULL;
4641 continue;
4642 }
4643
4644 /* In an unnamed join, just report child column names as-is */
4645 if (rte->alias == NULL)
4646 {
4647 colinfo->colnames[i] = real_colname;
4648 add_to_names_hash(colinfo, real_colname);
4649 continue;
4650 }
4651
4652 /* If alias already assigned, that's what to use */
4653 if (colname == NULL)
4654 {
4655 /* If user wrote an alias, prefer that over real column name */
4656 if (rte->alias && i < list_length(rte->alias->colnames))
4657 colname = strVal(list_nth(rte->alias->colnames, i));
4658 else
4659 colname = real_colname;
4660
4661 /* Unique-ify and insert into colinfo */
4662 colname = make_colname_unique(colname, dpns, colinfo);
4663
4664 colinfo->colnames[i] = colname;
4665 add_to_names_hash(colinfo, colname);
4666 }
4667
4668 /* Remember if any assigned aliases differ from "real" name */
4669 if (!changed_any && strcmp(colname, real_colname) != 0)
4670 changed_any = true;
4671 }
4672
4673 /*
4674 * Calculate number of columns the join would have if it were re-parsed
4675 * now, and create storage for the new_colnames and is_new_col arrays.
4676 *
4677 * Note: colname_is_unique will be consulting new_colnames[] during the
4678 * loops below, so its not-yet-filled entries must be zeroes.
4679 */
4680 nnewcolumns = leftcolinfo->num_new_cols + rightcolinfo->num_new_cols -
4681 list_length(colinfo->usingNames);
4682 colinfo->num_new_cols = nnewcolumns;
4683 colinfo->new_colnames = (char **) palloc0(nnewcolumns * sizeof(char *));
4684 colinfo->is_new_col = (bool *) palloc0(nnewcolumns * sizeof(bool));
4685
4686 /*
4687 * Generating the new_colnames array is a bit tricky since any new columns
4688 * added since parse time must be inserted in the right places. This code
4689 * must match the parser, which will order a join's columns as merged
4690 * columns first (in USING-clause order), then non-merged columns from the
4691 * left input (in attnum order), then non-merged columns from the right
4692 * input (ditto). If one of the inputs is itself a join, its columns will
4693 * be ordered according to the same rule, which means newly-added columns
4694 * might not be at the end. We can figure out what's what by consulting
4695 * the leftattnos and rightattnos arrays plus the input is_new_col arrays.
4696 *
4697 * In these loops, i indexes leftattnos/rightattnos (so it's join varattno
4698 * less one), j indexes new_colnames/is_new_col, and ic/jc have similar
4699 * meanings for the current child RTE.
4700 */
4701
4702 /* Handle merged columns; they are first and can't be new */
4703 i = j = 0;
4704 while (i < noldcolumns &&
4705 colinfo->leftattnos[i] != 0 &&
4706 colinfo->rightattnos[i] != 0)
4707 {
4708 /* column name is already determined and known unique */
4709 colinfo->new_colnames[j] = colinfo->colnames[i];
4710 colinfo->is_new_col[j] = false;
4711
4712 /* build bitmapsets of child attnums of merged columns */
4713 if (colinfo->leftattnos[i] > 0)
4714 leftmerged = bms_add_member(leftmerged, colinfo->leftattnos[i]);
4715 if (colinfo->rightattnos[i] > 0)
4716 rightmerged = bms_add_member(rightmerged, colinfo->rightattnos[i]);
4717
4718 i++, j++;
4719 }
4720
4721 /* Handle non-merged left-child columns */
4722 ic = 0;
4723 for (jc = 0; jc < leftcolinfo->num_new_cols; jc++)
4724 {
4725 char *child_colname = leftcolinfo->new_colnames[jc];
4726
4727 if (!leftcolinfo->is_new_col[jc])
4728 {
4729 /* Advance ic to next non-dropped old column of left child */
4730 while (ic < leftcolinfo->num_cols &&
4731 leftcolinfo->colnames[ic] == NULL)
4732 ic++;
4733 Assert(ic < leftcolinfo->num_cols);
4734 ic++;
4735 /* If it is a merged column, we already processed it */
4736 if (bms_is_member(ic, leftmerged))
4737 continue;
4738 /* Else, advance i to the corresponding existing join column */
4739 while (i < colinfo->num_cols &&
4740 colinfo->colnames[i] == NULL)
4741 i++;
4742 Assert(i < colinfo->num_cols);
4743 Assert(ic == colinfo->leftattnos[i]);
4744 /* Use the already-assigned name of this column */
4745 colinfo->new_colnames[j] = colinfo->colnames[i];
4746 i++;
4747 }
4748 else
4749 {
4750 /*
4751 * Unique-ify the new child column name and assign, unless we're
4752 * in an unnamed join, in which case just copy
4753 */
4754 if (rte->alias != NULL)
4755 {
4756 colinfo->new_colnames[j] =
4757 make_colname_unique(child_colname, dpns, colinfo);
4758 if (!changed_any &&
4759 strcmp(colinfo->new_colnames[j], child_colname) != 0)
4760 changed_any = true;
4761 }
4762 else
4763 colinfo->new_colnames[j] = child_colname;
4764 add_to_names_hash(colinfo, colinfo->new_colnames[j]);
4765 }
4766
4767 colinfo->is_new_col[j] = leftcolinfo->is_new_col[jc];
4768 j++;
4769 }
4770
4771 /* Handle non-merged right-child columns in exactly the same way */
4772 ic = 0;
4773 for (jc = 0; jc < rightcolinfo->num_new_cols; jc++)
4774 {
4775 char *child_colname = rightcolinfo->new_colnames[jc];
4776
4777 if (!rightcolinfo->is_new_col[jc])
4778 {
4779 /* Advance ic to next non-dropped old column of right child */
4780 while (ic < rightcolinfo->num_cols &&
4781 rightcolinfo->colnames[ic] == NULL)
4782 ic++;
4783 Assert(ic < rightcolinfo->num_cols);
4784 ic++;
4785 /* If it is a merged column, we already processed it */
4786 if (bms_is_member(ic, rightmerged))
4787 continue;
4788 /* Else, advance i to the corresponding existing join column */
4789 while (i < colinfo->num_cols &&
4790 colinfo->colnames[i] == NULL)
4791 i++;
4792 Assert(i < colinfo->num_cols);
4793 Assert(ic == colinfo->rightattnos[i]);
4794 /* Use the already-assigned name of this column */
4795 colinfo->new_colnames[j] = colinfo->colnames[i];
4796 i++;
4797 }
4798 else
4799 {
4800 /*
4801 * Unique-ify the new child column name and assign, unless we're
4802 * in an unnamed join, in which case just copy
4803 */
4804 if (rte->alias != NULL)
4805 {
4806 colinfo->new_colnames[j] =
4807 make_colname_unique(child_colname, dpns, colinfo);
4808 if (!changed_any &&
4809 strcmp(colinfo->new_colnames[j], child_colname) != 0)
4810 changed_any = true;
4811 }
4812 else
4813 colinfo->new_colnames[j] = child_colname;
4814 add_to_names_hash(colinfo, colinfo->new_colnames[j]);
4815 }
4816
4817 colinfo->is_new_col[j] = rightcolinfo->is_new_col[jc];
4818 j++;
4819 }
4820
4821 /* Assert we processed the right number of columns */
4822#ifdef USE_ASSERT_CHECKING
4823 while (i < colinfo->num_cols && colinfo->colnames[i] == NULL)
4824 i++;
4825 Assert(i == colinfo->num_cols);
4826 Assert(j == nnewcolumns);
4827#endif
4828
4829 /* We're now done needing the colinfo's names_hash */
4830 destroy_colinfo_names_hash(colinfo);
4831
4832 /*
4833 * For a named join, print column aliases if we changed any from the child
4834 * names. Unnamed joins cannot print aliases.
4835 */
4836 if (rte->alias != NULL)
4837 colinfo->printaliases = changed_any;
4838 else
4839 colinfo->printaliases = false;
4840}
4841
4842/*
4843 * colname_is_unique: is colname distinct from already-chosen column names?
4844 *
4845 * dpns is query-wide info, colinfo is for the column's RTE
4846 */
4847static bool
4848colname_is_unique(const char *colname, deparse_namespace *dpns,
4849 deparse_columns *colinfo)
4850{
4851 int i;
4852 ListCell *lc;
4853
4854 /*
4855 * If we have a hash table, consult that instead of linearly scanning the
4856 * colinfo's strings.
4857 */
4858 if (colinfo->names_hash)
4859 {
4860 if (hash_search(colinfo->names_hash,
4861 colname,
4862 HASH_FIND,
4863 NULL) != NULL)
4864 return false;
4865 }
4866 else
4867 {
4868 /* Check against already-assigned column aliases within RTE */
4869 for (i = 0; i < colinfo->num_cols; i++)
4870 {
4871 char *oldname = colinfo->colnames[i];
4872
4873 if (oldname && strcmp(oldname, colname) == 0)
4874 return false;
4875 }
4876
4877 /*
4878 * If we're building a new_colnames array, check that too (this will
4879 * be partially but not completely redundant with the previous checks)
4880 */
4881 for (i = 0; i < colinfo->num_new_cols; i++)
4882 {
4883 char *oldname = colinfo->new_colnames[i];
4884
4885 if (oldname && strcmp(oldname, colname) == 0)
4886 return false;
4887 }
4888
4889 /*
4890 * Also check against names already assigned for parent-join USING
4891 * cols
4892 */
4893 foreach(lc, colinfo->parentUsing)
4894 {
4895 char *oldname = (char *) lfirst(lc);
4896
4897 if (strcmp(oldname, colname) == 0)
4898 return false;
4899 }
4900 }
4901
4902 /*
4903 * Also check against USING-column names that must be globally unique.
4904 * These are not hashed, but there should be few of them.
4905 */
4906 foreach(lc, dpns->using_names)
4907 {
4908 char *oldname = (char *) lfirst(lc);
4909
4910 if (strcmp(oldname, colname) == 0)
4911 return false;
4912 }
4913
4914 return true;
4915}
4916
4917/*
4918 * make_colname_unique: modify colname if necessary to make it unique
4919 *
4920 * dpns is query-wide info, colinfo is for the column's RTE
4921 */
4922static char *
4923make_colname_unique(char *colname, deparse_namespace *dpns,
4924 deparse_columns *colinfo)
4925{
4926 /*
4927 * If the selected name isn't unique, append digits to make it so. For a
4928 * very long input name, we might have to truncate to stay within
4929 * NAMEDATALEN.
4930 */
4931 if (!colname_is_unique(colname, dpns, colinfo))
4932 {
4933 int colnamelen = strlen(colname);
4934 char *modname = (char *) palloc(colnamelen + 16);
4935 int i = 0;
4936
4937 do
4938 {
4939 i++;
4940 for (;;)
4941 {
4942 memcpy(modname, colname, colnamelen);
4943 sprintf(modname + colnamelen, "_%d", i);
4944 if (strlen(modname) < NAMEDATALEN)
4945 break;
4946 /* drop chars from colname to keep all the digits */
4947 colnamelen = pg_mbcliplen(colname, colnamelen,
4948 colnamelen - 1);
4949 }
4950 } while (!colname_is_unique(modname, dpns, colinfo));
4951 colname = modname;
4952 }
4953 return colname;
4954}
4955
4956/*
4957 * expand_colnames_array_to: make colinfo->colnames at least n items long
4958 *
4959 * Any added array entries are initialized to zero.
4960 */
4961static void
4962expand_colnames_array_to(deparse_columns *colinfo, int n)
4963{
4964 if (n > colinfo->num_cols)
4965 {
4966 if (colinfo->colnames == NULL)
4967 colinfo->colnames = palloc0_array(char *, n);
4968 else
4969 colinfo->colnames = repalloc0_array(colinfo->colnames, char *, colinfo->num_cols, n);
4970 colinfo->num_cols = n;
4971 }
4972}
4973
4974/*
4975 * build_colinfo_names_hash: optionally construct a hash table for colinfo
4976 */
4977static void
4978build_colinfo_names_hash(deparse_columns *colinfo)
4979{
4980 HASHCTL hash_ctl;
4981 int i;
4982 ListCell *lc;
4983
4984 /*
4985 * Use a hash table only for RTEs with at least 32 columns. (The cutoff
4986 * is somewhat arbitrary, but let's choose it so that this code does get
4987 * exercised in the regression tests.)
4988 */
4989 if (colinfo->num_cols < 32)
4990 return;
4991
4992 /*
4993 * Set up the hash table. The entries are just strings with no other
4994 * payload.
4995 */
4996 hash_ctl.keysize = NAMEDATALEN;
4997 hash_ctl.entrysize = NAMEDATALEN;
4998 hash_ctl.hcxt = CurrentMemoryContext;
4999 colinfo->names_hash = hash_create("deparse_columns names",
5000 colinfo->num_cols + colinfo->num_new_cols,
5001 &hash_ctl,
5002 HASH_ELEM | HASH_STRINGS | HASH_CONTEXT);
5003
5004 /*
5005 * Preload the hash table with any names already present (these would have
5006 * come from set_using_names).
5007 */
5008 for (i = 0; i < colinfo->num_cols; i++)
5009 {
5010 char *oldname = colinfo->colnames[i];
5011
5012 if (oldname)
5013 add_to_names_hash(colinfo, oldname);
5014 }
5015
5016 for (i = 0; i < colinfo->num_new_cols; i++)
5017 {
5018 char *oldname = colinfo->new_colnames[i];
5019
5020 if (oldname)
5021 add_to_names_hash(colinfo, oldname);
5022 }
5023
5024 foreach(lc, colinfo->parentUsing)
5025 {
5026 char *oldname = (char *) lfirst(lc);
5027
5028 add_to_names_hash(colinfo, oldname);
5029 }
5030}
5031
5032/*
5033 * add_to_names_hash: add a string to the names_hash, if we're using one
5034 */
5035static void
5036add_to_names_hash(deparse_columns *colinfo, const char *name)
5037{
5038 if (colinfo->names_hash)
5039 (void) hash_search(colinfo->names_hash,
5040 name,
5041 HASH_ENTER,
5042 NULL);
5043}
5044
5045/*
5046 * destroy_colinfo_names_hash: destroy hash table when done with it
5047 */
5048static void
5049destroy_colinfo_names_hash(deparse_columns *colinfo)
5050{
5051 if (colinfo->names_hash)
5052 {
5053 hash_destroy(colinfo->names_hash);
5054 colinfo->names_hash = NULL;
5055 }
5056}
5057
5058/*
5059 * identify_join_columns: figure out where columns of a join come from
5060 *
5061 * Fills the join-specific fields of the colinfo struct, except for
5062 * usingNames which is filled later.
5063 */
5064static void
5065identify_join_columns(JoinExpr *j, RangeTblEntry *jrte,
5066 deparse_columns *colinfo)
5067{
5068 int numjoincols;
5069 int jcolno;
5070 int rcolno;
5071 ListCell *lc;
5072
5073 /* Extract left/right child RT indexes */
5074 if (IsA(j->larg, RangeTblRef))
5075 colinfo->leftrti = ((RangeTblRef *) j->larg)->rtindex;
5076 else if (IsA(j->larg, JoinExpr))
5077 colinfo->leftrti = ((JoinExpr *) j->larg)->rtindex;
5078 else
5079 elog(ERROR, "unrecognized node type in jointree: %d",
5080 (int) nodeTag(j->larg));
5081 if (IsA(j->rarg, RangeTblRef))
5082 colinfo->rightrti = ((RangeTblRef *) j->rarg)->rtindex;
5083 else if (IsA(j->rarg, JoinExpr))
5084 colinfo->rightrti = ((JoinExpr *) j->rarg)->rtindex;
5085 else
5086 elog(ERROR, "unrecognized node type in jointree: %d",
5087 (int) nodeTag(j->rarg));
5088
5089 /* Assert children will be processed earlier than join in second pass */
5090 Assert(colinfo->leftrti < j->rtindex);
5091 Assert(colinfo->rightrti < j->rtindex);
5092
5093 /* Initialize result arrays with zeroes */
5094 numjoincols = list_length(jrte->joinaliasvars);
5095 Assert(numjoincols == list_length(jrte->eref->colnames));
5096 colinfo->leftattnos = (int *) palloc0(numjoincols * sizeof(int));
5097 colinfo->rightattnos = (int *) palloc0(numjoincols * sizeof(int));
5098
5099 /*
5100 * Deconstruct RTE's joinleftcols/joinrightcols into desired format.
5101 * Recall that the column(s) merged due to USING are the first column(s)
5102 * of the join output. We need not do anything special while scanning
5103 * joinleftcols, but while scanning joinrightcols we must distinguish
5104 * merged from unmerged columns.
5105 */
5106 jcolno = 0;
5107 foreach(lc, jrte->joinleftcols)
5108 {
5109 int leftattno = lfirst_int(lc);
5110
5111 colinfo->leftattnos[jcolno++] = leftattno;
5112 }
5113 rcolno = 0;
5114 foreach(lc, jrte->joinrightcols)
5115 {
5116 int rightattno = lfirst_int(lc);
5117
5118 if (rcolno < jrte->joinmergedcols) /* merged column? */
5119 colinfo->rightattnos[rcolno] = rightattno;
5120 else
5121 colinfo->rightattnos[jcolno++] = rightattno;
5122 rcolno++;
5123 }
5124 Assert(jcolno == numjoincols);
5125}
5126
5127/*
5128 * get_rtable_name: convenience function to get a previously assigned RTE alias
5129 *
5130 * The RTE must belong to the topmost namespace level in "context".
5131 */
5132static char *
5133get_rtable_name(int rtindex, deparse_context *context)
5134{
5135 deparse_namespace *dpns = (deparse_namespace *) linitial(context->namespaces);
5136
5137 Assert(rtindex > 0 && rtindex <= list_length(dpns->rtable_names));
5138 return (char *) list_nth(dpns->rtable_names, rtindex - 1);
5139}
5140
5141/*
5142 * set_deparse_plan: set up deparse_namespace to parse subexpressions
5143 * of a given Plan node
5144 *
5145 * This sets the plan, outer_plan, inner_plan, outer_tlist, inner_tlist,
5146 * and index_tlist fields. Caller must already have adjusted the ancestors
5147 * list if necessary. Note that the rtable, subplans, and ctes fields do
5148 * not need to change when shifting attention to different plan nodes in a
5149 * single plan tree.
5150 */
5151static void
5152set_deparse_plan(deparse_namespace *dpns, Plan *plan)
5153{
5154 dpns->plan = plan;
5155
5156 /*
5157 * We special-case Append and MergeAppend to pretend that the first child
5158 * plan is the OUTER referent; we have to interpret OUTER Vars in their
5159 * tlists according to one of the children, and the first one is the most
5160 * natural choice.
5161 */
5162 if (IsA(plan, Append))
5163 dpns->outer_plan = linitial(((Append *) plan)->appendplans);
5164 else if (IsA(plan, MergeAppend))
5165 dpns->outer_plan = linitial(((MergeAppend *) plan)->mergeplans);
5166 else
5167 dpns->outer_plan = outerPlan(plan);
5168
5169 if (dpns->outer_plan)
5170 dpns->outer_tlist = dpns->outer_plan->targetlist;
5171 else
5172 dpns->outer_tlist = NIL;
5173
5174 /*
5175 * For a SubqueryScan, pretend the subplan is INNER referent. (We don't
5176 * use OUTER because that could someday conflict with the normal meaning.)
5177 * Likewise, for a CteScan, pretend the subquery's plan is INNER referent.
5178 * For a WorkTableScan, locate the parent RecursiveUnion plan node and use
5179 * that as INNER referent.
5180 *
5181 * For MERGE, pretend the ModifyTable's source plan (its outer plan) is
5182 * INNER referent. This is the join from the target relation to the data
5183 * source, and all INNER_VAR Vars in other parts of the query refer to its
5184 * targetlist.
5185 *
5186 * For ON CONFLICT .. UPDATE we just need the inner tlist to point to the
5187 * excluded expression's tlist. (Similar to the SubqueryScan we don't want
5188 * to reuse OUTER, it's used for RETURNING in some modify table cases,
5189 * although not INSERT .. CONFLICT).
5190 */
5191 if (IsA(plan, SubqueryScan))
5192 dpns->inner_plan = ((SubqueryScan *) plan)->subplan;
5193 else if (IsA(plan, CteScan))
5194 dpns->inner_plan = list_nth(dpns->subplans,
5195 ((CteScan *) plan)->ctePlanId - 1);
5196 else if (IsA(plan, WorkTableScan))
5197 dpns->inner_plan = find_recursive_union(dpns,
5198 (WorkTableScan *) plan);
5199 else if (IsA(plan, ModifyTable))
5200 {
5201 if (((ModifyTable *) plan)->operation == CMD_MERGE)
5202 dpns->inner_plan = outerPlan(plan);
5203 else
5204 dpns->inner_plan = plan;
5205 }
5206 else
5207 dpns->inner_plan = innerPlan(plan);
5208
5209 if (IsA(plan, ModifyTable) && ((ModifyTable *) plan)->operation == CMD_INSERT)
5210 dpns->inner_tlist = ((ModifyTable *) plan)->exclRelTlist;
5211 else if (dpns->inner_plan)
5212 dpns->inner_tlist = dpns->inner_plan->targetlist;
5213 else
5214 dpns->inner_tlist = NIL;
5215
5216 /* Set up referent for INDEX_VAR Vars, if needed */
5217 if (IsA(plan, IndexOnlyScan))
5218 dpns->index_tlist = ((IndexOnlyScan *) plan)->indextlist;
5219 else if (IsA(plan, ForeignScan))
5220 dpns->index_tlist = ((ForeignScan *) plan)->fdw_scan_tlist;
5221 else if (IsA(plan, CustomScan))
5222 dpns->index_tlist = ((CustomScan *) plan)->custom_scan_tlist;
5223 else
5224 dpns->index_tlist = NIL;
5225}
5226
5227/*
5228 * Locate the ancestor plan node that is the RecursiveUnion generating
5229 * the WorkTableScan's work table. We can match on wtParam, since that
5230 * should be unique within the plan tree.
5231 */
5232static Plan *
5233find_recursive_union(deparse_namespace *dpns, WorkTableScan *wtscan)
5234{
5235 ListCell *lc;
5236
5237 foreach(lc, dpns->ancestors)
5238 {
5239 Plan *ancestor = (Plan *) lfirst(lc);
5240
5241 if (IsA(ancestor, RecursiveUnion) &&
5242 ((RecursiveUnion *) ancestor)->wtParam == wtscan->wtParam)
5243 return ancestor;
5244 }
5245 elog(ERROR, "could not find RecursiveUnion for WorkTableScan with wtParam %d",
5246 wtscan->wtParam);
5247 return NULL;
5248}
5249
5250/*
5251 * push_child_plan: temporarily transfer deparsing attention to a child plan
5252 *
5253 * When expanding an OUTER_VAR or INNER_VAR reference, we must adjust the
5254 * deparse context in case the referenced expression itself uses
5255 * OUTER_VAR/INNER_VAR. We modify the top stack entry in-place to avoid
5256 * affecting levelsup issues (although in a Plan tree there really shouldn't
5257 * be any).
5258 *
5259 * Caller must provide a local deparse_namespace variable to save the
5260 * previous state for pop_child_plan.
5261 */
5262static void
5263push_child_plan(deparse_namespace *dpns, Plan *plan,
5264 deparse_namespace *save_dpns)
5265{
5266 /* Save state for restoration later */
5267 *save_dpns = *dpns;
5268
5269 /* Link current plan node into ancestors list */
5270 dpns->ancestors = lcons(dpns->plan, dpns->ancestors);
5271
5272 /* Set attention on selected child */
5273 set_deparse_plan(dpns, plan);
5274}
5275
5276/*
5277 * pop_child_plan: undo the effects of push_child_plan
5278 */
5279static void
5280pop_child_plan(deparse_namespace *dpns, deparse_namespace *save_dpns)
5281{
5282 List *ancestors;
5283
5284 /* Get rid of ancestors list cell added by push_child_plan */
5285 ancestors = list_delete_first(dpns->ancestors);
5286
5287 /* Restore fields changed by push_child_plan */
5288 *dpns = *save_dpns;
5289
5290 /* Make sure dpns->ancestors is right (may be unnecessary) */
5291 dpns->ancestors = ancestors;
5292}
5293
5294/*
5295 * push_ancestor_plan: temporarily transfer deparsing attention to an
5296 * ancestor plan
5297 *
5298 * When expanding a Param reference, we must adjust the deparse context
5299 * to match the plan node that contains the expression being printed;
5300 * otherwise we'd fail if that expression itself contains a Param or
5301 * OUTER_VAR/INNER_VAR/INDEX_VAR variable.
5302 *
5303 * The target ancestor is conveniently identified by the ListCell holding it
5304 * in dpns->ancestors.
5305 *
5306 * Caller must provide a local deparse_namespace variable to save the
5307 * previous state for pop_ancestor_plan.
5308 */
5309static void
5310push_ancestor_plan(deparse_namespace *dpns, ListCell *ancestor_cell,
5311 deparse_namespace *save_dpns)
5312{
5313 Plan *plan = (Plan *) lfirst(ancestor_cell);
5314
5315 /* Save state for restoration later */
5316 *save_dpns = *dpns;
5317
5318 /* Build a new ancestor list with just this node's ancestors */
5319 dpns->ancestors =
5320 list_copy_tail(dpns->ancestors,
5321 list_cell_number(dpns->ancestors, ancestor_cell) + 1);
5322
5323 /* Set attention on selected ancestor */
5324 set_deparse_plan(dpns, plan);
5325}
5326
5327/*
5328 * pop_ancestor_plan: undo the effects of push_ancestor_plan
5329 */
5330static void
5331pop_ancestor_plan(deparse_namespace *dpns, deparse_namespace *save_dpns)
5332{
5333 /* Free the ancestor list made in push_ancestor_plan */
5334 list_free(dpns->ancestors);
5335
5336 /* Restore fields changed by push_ancestor_plan */
5337 *dpns = *save_dpns;
5338}
5339
5340
5341/* ----------
5342 * make_ruledef - reconstruct the CREATE RULE command
5343 * for a given pg_rewrite tuple
5344 * ----------
5345 */
5346static void
5347make_ruledef(StringInfo buf, HeapTuple ruletup, TupleDesc rulettc,
5348 int prettyFlags)
5349{
5350 char *rulename;
5351 char ev_type;
5352 Oid ev_class;
5353 bool is_instead;
5354 char *ev_qual;
5355 char *ev_action;
5356 List *actions;
5357 Relation ev_relation;
5358 TupleDesc viewResultDesc = NULL;
5359 int fno;
5360 Datum dat;
5361 bool isnull;
5362
5363 /*
5364 * Get the attribute values from the rules tuple
5365 */
5366 fno = SPI_fnumber(rulettc, "rulename");
5367 dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5368 Assert(!isnull);
5369 rulename = NameStr(*(DatumGetName(dat)));
5370
5371 fno = SPI_fnumber(rulettc, "ev_type");
5372 dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5373 Assert(!isnull);
5374 ev_type = DatumGetChar(dat);
5375
5376 fno = SPI_fnumber(rulettc, "ev_class");
5377 dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5378 Assert(!isnull);
5379 ev_class = DatumGetObjectId(dat);
5380
5381 fno = SPI_fnumber(rulettc, "is_instead");
5382 dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5383 Assert(!isnull);
5384 is_instead = DatumGetBool(dat);
5385
5386 fno = SPI_fnumber(rulettc, "ev_qual");
5387 ev_qual = SPI_getvalue(ruletup, rulettc, fno);
5388 Assert(ev_qual != NULL);
5389
5390 fno = SPI_fnumber(rulettc, "ev_action");
5391 ev_action = SPI_getvalue(ruletup, rulettc, fno);
5392 Assert(ev_action != NULL);
5393 actions = (List *) stringToNode(ev_action);
5394 if (actions == NIL)
5395 elog(ERROR, "invalid empty ev_action list");
5396
5397 ev_relation = table_open(ev_class, AccessShareLock);
5398
5399 /*
5400 * Build the rules definition text
5401 */
5402 appendStringInfo(buf, "CREATE RULE %s AS",
5403 quote_identifier(rulename));
5404
5405 if (prettyFlags & PRETTYFLAG_INDENT)
5406 appendStringInfoString(buf, "\n ON ");
5407 else
5408 appendStringInfoString(buf, " ON ");
5409
5410 /* The event the rule is fired for */
5411 switch (ev_type)
5412 {
5413 case '1':
5414 appendStringInfoString(buf, "SELECT");
5415 viewResultDesc = RelationGetDescr(ev_relation);
5416 break;
5417
5418 case '2':
5419 appendStringInfoString(buf, "UPDATE");
5420 break;
5421
5422 case '3':
5423 appendStringInfoString(buf, "INSERT");
5424 break;
5425
5426 case '4':
5427 appendStringInfoString(buf, "DELETE");
5428 break;
5429
5430 default:
5431 ereport(ERROR,
5432 (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
5433 errmsg("rule \"%s\" has unsupported event type %d",
5434 rulename, ev_type)));
5435 break;
5436 }
5437
5438 /* The relation the rule is fired on */
5439 appendStringInfo(buf, " TO %s",
5440 (prettyFlags & PRETTYFLAG_SCHEMA) ?
5441 generate_relation_name(ev_class, NIL) :
5442 generate_qualified_relation_name(ev_class));
5443
5444 /* If the rule has an event qualification, add it */
5445 if (strcmp(ev_qual, "<>") != 0)
5446 {
5447 Node *qual;
5448 Query *query;
5449 deparse_context context;
5450 deparse_namespace dpns;
5451
5452 if (prettyFlags & PRETTYFLAG_INDENT)
5453 appendStringInfoString(buf, "\n ");
5454 appendStringInfoString(buf, " WHERE ");
5455
5456 qual = stringToNode(ev_qual);
5457
5458 /*
5459 * We need to make a context for recognizing any Vars in the qual
5460 * (which can only be references to OLD and NEW). Use the rtable of
5461 * the first query in the action list for this purpose.
5462 */
5463 query = (Query *) linitial(actions);
5464
5465 /*
5466 * If the action is INSERT...SELECT, OLD/NEW have been pushed down
5467 * into the SELECT, and that's what we need to look at. (Ugly kluge
5468 * ... try to fix this when we redesign querytrees.)
5469 */
5470 query = getInsertSelectQuery(query, NULL);
5471
5472 /* Must acquire locks right away; see notes in get_query_def() */
5473 AcquireRewriteLocks(query, false, false);
5474
5475 context.buf = buf;
5476 context.namespaces = list_make1(&dpns);
5477 context.resultDesc = NULL;
5478 context.targetList = NIL;
5479 context.windowClause = NIL;
5480 context.varprefix = (list_length(query->rtable) != 1);
5481 context.prettyFlags = prettyFlags;
5482 context.wrapColumn = WRAP_COLUMN_DEFAULT;
5483 context.indentLevel = PRETTYINDENT_STD;
5484 context.colNamesVisible = true;
5485 context.inGroupBy = false;
5486 context.varInOrderBy = false;
5487 context.appendparents = NULL;
5488
5489 set_deparse_for_query(&dpns, query, NIL);
5490
5491 get_rule_expr(qual, &context, false);
5492 }
5493
5494 appendStringInfoString(buf, " DO ");
5495
5496 /* The INSTEAD keyword (if so) */
5497 if (is_instead)
5498 appendStringInfoString(buf, "INSTEAD ");
5499
5500 /* Finally the rules actions */
5501 if (list_length(actions) > 1)
5502 {
5503 ListCell *action;
5504 Query *query;
5505
5506 appendStringInfoChar(buf, '(');
5507 foreach(action, actions)
5508 {
5509 query = (Query *) lfirst(action);
5510 get_query_def(query, buf, NIL, viewResultDesc, true,
5511 prettyFlags, WRAP_COLUMN_DEFAULT, 0);
5512 if (prettyFlags)
5513 appendStringInfoString(buf, ";\n");
5514 else
5515 appendStringInfoString(buf, "; ");
5516 }
5517 appendStringInfoString(buf, ");");
5518 }
5519 else
5520 {
5521 Query *query;
5522
5523 query = (Query *) linitial(actions);
5524 get_query_def(query, buf, NIL, viewResultDesc, true,
5525 prettyFlags, WRAP_COLUMN_DEFAULT, 0);
5526 appendStringInfoChar(buf, ';');
5527 }
5528
5529 table_close(ev_relation, AccessShareLock);
5530}
5531
5532
5533/* ----------
5534 * make_viewdef - reconstruct the SELECT part of a
5535 * view rewrite rule
5536 * ----------
5537 */
5538static void
5539make_viewdef(StringInfo buf, HeapTuple ruletup, TupleDesc rulettc,
5540 int prettyFlags, int wrapColumn)
5541{
5542 Query *query;
5543 char ev_type;
5544 Oid ev_class;
5545 bool is_instead;
5546 char *ev_qual;
5547 char *ev_action;
5548 List *actions;
5549 Relation ev_relation;
5550 int fno;
5551 Datum dat;
5552 bool isnull;
5553
5554 /*
5555 * Get the attribute values from the rules tuple
5556 */
5557 fno = SPI_fnumber(rulettc, "ev_type");
5558 dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5559 Assert(!isnull);
5560 ev_type = DatumGetChar(dat);
5561
5562 fno = SPI_fnumber(rulettc, "ev_class");
5563 dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5564 Assert(!isnull);
5565 ev_class = DatumGetObjectId(dat);
5566
5567 fno = SPI_fnumber(rulettc, "is_instead");
5568 dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5569 Assert(!isnull);
5570 is_instead = DatumGetBool(dat);
5571
5572 fno = SPI_fnumber(rulettc, "ev_qual");
5573 ev_qual = SPI_getvalue(ruletup, rulettc, fno);
5574 Assert(ev_qual != NULL);
5575
5576 fno = SPI_fnumber(rulettc, "ev_action");
5577 ev_action = SPI_getvalue(ruletup, rulettc, fno);
5578 Assert(ev_action != NULL);
5579 actions = (List *) stringToNode(ev_action);
5580
5581 if (list_length(actions) != 1)
5582 {
5583 /* keep output buffer empty and leave */
5584 return;
5585 }
5586
5587 query = (Query *) linitial(actions);
5588
5589 if (ev_type != '1' || !is_instead ||
5590 strcmp(ev_qual, "<>") != 0 || query->commandType != CMD_SELECT)
5591 {
5592 /* keep output buffer empty and leave */
5593 return;
5594 }
5595
5596 ev_relation = table_open(ev_class, AccessShareLock);
5597
5598 get_query_def(query, buf, NIL, RelationGetDescr(ev_relation), true,
5599 prettyFlags, wrapColumn, 0);
5600 appendStringInfoChar(buf, ';');
5601
5602 table_close(ev_relation, AccessShareLock);
5603}
5604
5605
5606/* ----------
5607 * get_query_def - Parse back one query parsetree
5608 *
5609 * query: parsetree to be displayed
5610 * buf: output text is appended to buf
5611 * parentnamespace: list (initially empty) of outer-level deparse_namespace's
5612 * resultDesc: if not NULL, the output tuple descriptor for the view
5613 * represented by a SELECT query. We use the column names from it
5614 * to label SELECT output columns, in preference to names in the query
5615 * colNamesVisible: true if the surrounding context cares about the output
5616 * column names at all (as, for example, an EXISTS() context does not);
5617 * when false, we can suppress dummy column labels such as "?column?"
5618 * prettyFlags: bitmask of PRETTYFLAG_XXX options
5619 * wrapColumn: maximum line length, or -1 to disable wrapping
5620 * startIndent: initial indentation amount
5621 * ----------
5622 */
5623static void
5624get_query_def(Query *query, StringInfo buf, List *parentnamespace,
5625 TupleDesc resultDesc, bool colNamesVisible,
5626 int prettyFlags, int wrapColumn, int startIndent)
5627{
5628 deparse_context context;
5629 deparse_namespace dpns;
5630 int rtable_size;
5631
5632 /* Guard against excessively long or deeply-nested queries */
5633 CHECK_FOR_INTERRUPTS();
5634 check_stack_depth();
5635
5636 rtable_size = query->hasGroupRTE ?
5637 list_length(query->rtable) - 1 :
5638 list_length(query->rtable);
5639
5640 /*
5641 * Replace any Vars in the query's targetlist and havingQual that
5642 * reference GROUP outputs with the underlying grouping expressions.
5643 */
5644 if (query->hasGroupRTE)
5645 {
5646 query->targetList = (List *)
5647 flatten_group_exprs(NULL, query, (Node *) query->targetList);
5648 query->havingQual =
5649 flatten_group_exprs(NULL, query, query->havingQual);
5650 }
5651
5652 /*
5653 * Before we begin to examine the query, acquire locks on referenced
5654 * relations, and fix up deleted columns in JOIN RTEs. This ensures
5655 * consistent results. Note we assume it's OK to scribble on the passed
5656 * querytree!
5657 *
5658 * We are only deparsing the query (we are not about to execute it), so we
5659 * only need AccessShareLock on the relations it mentions.
5660 */
5661 AcquireRewriteLocks(query, false, false);
5662
5663 context.buf = buf;
5664 context.namespaces = lcons(&dpns, list_copy(parentnamespace));
5665 context.resultDesc = NULL;
5666 context.targetList = NIL;
5667 context.windowClause = NIL;
5668 context.varprefix = (parentnamespace != NIL ||
5669 rtable_size != 1);
5670 context.prettyFlags = prettyFlags;
5671 context.wrapColumn = wrapColumn;
5672 context.indentLevel = startIndent;
5673 context.colNamesVisible = colNamesVisible;
5674 context.inGroupBy = false;
5675 context.varInOrderBy = false;
5676 context.appendparents = NULL;
5677
5678 set_deparse_for_query(&dpns, query, parentnamespace);
5679
5680 switch (query->commandType)
5681 {
5682 case CMD_SELECT:
5683 /* We set context.resultDesc only if it's a SELECT */
5684 context.resultDesc = resultDesc;
5685 get_select_query_def(query, &context);
5686 break;
5687
5688 case CMD_UPDATE:
5689 get_update_query_def(query, &context);
5690 break;
5691
5692 case CMD_INSERT:
5693 get_insert_query_def(query, &context);
5694 break;
5695
5696 case CMD_DELETE:
5697 get_delete_query_def(query, &context);
5698 break;
5699
5700 case CMD_MERGE:
5701 get_merge_query_def(query, &context);
5702 break;
5703
5704 case CMD_NOTHING:
5705 appendStringInfoString(buf, "NOTHING");
5706 break;
5707
5708 case CMD_UTILITY:
5709 get_utility_query_def(query, &context);
5710 break;
5711
5712 default:
5713 elog(ERROR, "unrecognized query command type: %d",
5714 query->commandType);
5715 break;
5716 }
5717}
5718
5719/* ----------
5720 * get_values_def - Parse back a VALUES list
5721 * ----------
5722 */
5723static void
5724get_values_def(List *values_lists, deparse_context *context)
5725{
5726 StringInfo buf = context->buf;
5727 bool first_list = true;
5728 ListCell *vtl;
5729
5730 appendStringInfoString(buf, "VALUES ");
5731
5732 foreach(vtl, values_lists)
5733 {
5734 List *sublist = (List *) lfirst(vtl);
5735 bool first_col = true;
5736 ListCell *lc;
5737
5738 if (first_list)
5739 first_list = false;
5740 else
5741 appendStringInfoString(buf, ", ");
5742
5743 appendStringInfoChar(buf, '(');
5744 foreach(lc, sublist)
5745 {
5746 Node *col = (Node *) lfirst(lc);
5747
5748 if (first_col)
5749 first_col = false;
5750 else
5751 appendStringInfoChar(buf, ',');
5752
5753 /*
5754 * Print the value. Whole-row Vars need special treatment.
5755 */
5756 get_rule_expr_toplevel(col, context, false);
5757 }
5758 appendStringInfoChar(buf, ')');
5759 }
5760}
5761
5762/* ----------
5763 * get_with_clause - Parse back a WITH clause
5764 * ----------
5765 */
5766static void
5767get_with_clause(Query *query, deparse_context *context)
5768{
5769 StringInfo buf = context->buf;
5770 const char *sep;
5771 ListCell *l;
5772
5773 if (query->cteList == NIL)
5774 return;
5775
5776 if (PRETTY_INDENT(context))
5777 {
5778 context->indentLevel += PRETTYINDENT_STD;
5779 appendStringInfoChar(buf, ' ');
5780 }
5781
5782 if (query->hasRecursive)
5783 sep = "WITH RECURSIVE ";
5784 else
5785 sep = "WITH ";
5786 foreach(l, query->cteList)
5787 {
5788 CommonTableExpr *cte = (CommonTableExpr *) lfirst(l);
5789
5790 appendStringInfoString(buf, sep);
5791 appendStringInfoString(buf, quote_identifier(cte->ctename));
5792 if (cte->aliascolnames)
5793 {
5794 bool first = true;
5795 ListCell *col;
5796
5797 appendStringInfoChar(buf, '(');
5798 foreach(col, cte->aliascolnames)
5799 {
5800 if (first)
5801 first = false;
5802 else
5803 appendStringInfoString(buf, ", ");
5804 appendStringInfoString(buf,
5805 quote_identifier(strVal(lfirst(col))));
5806 }
5807 appendStringInfoChar(buf, ')');
5808 }
5809 appendStringInfoString(buf, " AS ");
5810 switch (cte->ctematerialized)
5811 {
5812 case CTEMaterializeDefault:
5813 break;
5814 case CTEMaterializeAlways:
5815 appendStringInfoString(buf, "MATERIALIZED ");
5816 break;
5817 case CTEMaterializeNever:
5818 appendStringInfoString(buf, "NOT MATERIALIZED ");
5819 break;
5820 }
5821 appendStringInfoChar(buf, '(');
5822 if (PRETTY_INDENT(context))
5823 appendContextKeyword(context, "", 0, 0, 0);
5824 get_query_def((Query *) cte->ctequery, buf, context->namespaces, NULL,
5825 true,
5826 context->prettyFlags, context->wrapColumn,
5827 context->indentLevel);
5828 if (PRETTY_INDENT(context))
5829 appendContextKeyword(context, "", 0, 0, 0);
5830 appendStringInfoChar(buf, ')');
5831
5832 if (cte->search_clause)
5833 {
5834 bool first = true;
5835 ListCell *lc;
5836
5837 appendStringInfo(buf, " SEARCH %s FIRST BY ",
5838 cte->search_clause->search_breadth_first ? "BREADTH" : "DEPTH");
5839
5840 foreach(lc, cte->search_clause->search_col_list)
5841 {
5842 if (first)
5843 first = false;
5844 else
5845 appendStringInfoString(buf, ", ");
5846 appendStringInfoString(buf,
5847 quote_identifier(strVal(lfirst(lc))));
5848 }
5849
5850 appendStringInfo(buf, " SET %s", quote_identifier(cte->search_clause->search_seq_column));
5851 }
5852
5853 if (cte->cycle_clause)
5854 {
5855 bool first = true;
5856 ListCell *lc;
5857
5858 appendStringInfoString(buf, " CYCLE ");
5859
5860 foreach(lc, cte->cycle_clause->cycle_col_list)
5861 {
5862 if (first)
5863 first = false;
5864 else
5865 appendStringInfoString(buf, ", ");
5866 appendStringInfoString(buf,
5867 quote_identifier(strVal(lfirst(lc))));
5868 }
5869
5870 appendStringInfo(buf, " SET %s", quote_identifier(cte->cycle_clause->cycle_mark_column));
5871
5872 {
5873 Const *cmv = castNode(Const, cte->cycle_clause->cycle_mark_value);
5874 Const *cmd = castNode(Const, cte->cycle_clause->cycle_mark_default);
5875
5876 if (!(cmv->consttype == BOOLOID && !cmv->constisnull && DatumGetBool(cmv->constvalue) == true &&
5877 cmd->consttype == BOOLOID && !cmd->constisnull && DatumGetBool(cmd->constvalue) == false))
5878 {
5879 appendStringInfoString(buf, " TO ");
5880 get_rule_expr(cte->cycle_clause->cycle_mark_value, context, false);
5881 appendStringInfoString(buf, " DEFAULT ");
5882 get_rule_expr(cte->cycle_clause->cycle_mark_default, context, false);
5883 }
5884 }
5885
5886 appendStringInfo(buf, " USING %s", quote_identifier(cte->cycle_clause->cycle_path_column));
5887 }
5888
5889 sep = ", ";
5890 }
5891
5892 if (PRETTY_INDENT(context))
5893 {
5894 context->indentLevel -= PRETTYINDENT_STD;
5895 appendContextKeyword(context, "", 0, 0, 0);
5896 }
5897 else
5898 appendStringInfoChar(buf, ' ');
5899}
5900
5901/* ----------
5902 * get_select_query_def - Parse back a SELECT parsetree
5903 * ----------
5904 */
5905static void
5906get_select_query_def(Query *query, deparse_context *context)
5907{
5908 StringInfo buf = context->buf;
5909 bool force_colno;
5910 ListCell *l;
5911
5912 /* Insert the WITH clause if given */
5913 get_with_clause(query, context);
5914
5915 /* Subroutines may need to consult the SELECT targetlist and windowClause */
5916 context->targetList = query->targetList;
5917 context->windowClause = query->windowClause;
5918
5919 /*
5920 * If the Query node has a setOperations tree, then it's the top level of
5921 * a UNION/INTERSECT/EXCEPT query; only the WITH, ORDER BY and LIMIT
5922 * fields are interesting in the top query itself.
5923 */
5924 if (query->setOperations)
5925 {
5926 get_setop_query(query->setOperations, query, context);
5927 /* ORDER BY clauses must be simple in this case */
5928 force_colno = true;
5929 }
5930 else
5931 {
5932 get_basic_select_query(query, context);
5933 force_colno = false;
5934 }
5935
5936 /* Add the ORDER BY clause if given */
5937 if (query->sortClause != NIL)
5938 {
5939 appendContextKeyword(context, " ORDER BY ",
5940 -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
5941 get_rule_orderby(query->sortClause, query->targetList,
5942 force_colno, context);
5943 }
5944
5945 /*
5946 * Add the LIMIT/OFFSET clauses if given. If non-default options, use the
5947 * standard spelling of LIMIT.
5948 */
5949 if (query->limitOffset != NULL)
5950 {
5951 appendContextKeyword(context, " OFFSET ",
5952 -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
5953 get_rule_expr(query->limitOffset, context, false);
5954 }
5955 if (query->limitCount != NULL)
5956 {
5957 if (query->limitOption == LIMIT_OPTION_WITH_TIES)
5958 {
5959 appendContextKeyword(context, " FETCH FIRST ",
5960 -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
5961 get_rule_expr(query->limitCount, context, false);
5962 appendStringInfoString(buf, " ROWS WITH TIES");
5963 }
5964 else
5965 {
5966 appendContextKeyword(context, " LIMIT ",
5967 -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
5968 if (IsA(query->limitCount, Const) &&
5969 ((Const *) query->limitCount)->constisnull)
5970 appendStringInfoString(buf, "ALL");
5971 else
5972 get_rule_expr(query->limitCount, context, false);
5973 }
5974 }
5975
5976 /* Add FOR [KEY] UPDATE/SHARE clauses if present */
5977 if (query->hasForUpdate)
5978 {
5979 foreach(l, query->rowMarks)
5980 {
5981 RowMarkClause *rc = (RowMarkClause *) lfirst(l);
5982
5983 /* don't print implicit clauses */
5984 if (rc->pushedDown)
5985 continue;
5986
5987 switch (rc->strength)
5988 {
5989 case LCS_NONE:
5990 /* we intentionally throw an error for LCS_NONE */
5991 elog(ERROR, "unrecognized LockClauseStrength %d",
5992 (int) rc->strength);
5993 break;
5994 case LCS_FORKEYSHARE:
5995 appendContextKeyword(context, " FOR KEY SHARE",
5996 -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
5997 break;
5998 case LCS_FORSHARE:
5999 appendContextKeyword(context, " FOR SHARE",
6000 -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
6001 break;
6002 case LCS_FORNOKEYUPDATE:
6003 appendContextKeyword(context, " FOR NO KEY UPDATE",
6004 -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
6005 break;
6006 case LCS_FORUPDATE:
6007 appendContextKeyword(context, " FOR UPDATE",
6008 -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
6009 break;
6010 }
6011
6012 appendStringInfo(buf, " OF %s",
6013 quote_identifier(get_rtable_name(rc->rti,
6014 context)));
6015 if (rc->waitPolicy == LockWaitError)
6016 appendStringInfoString(buf, " NOWAIT");
6017 else if (rc->waitPolicy == LockWaitSkip)
6018 appendStringInfoString(buf, " SKIP LOCKED");
6019 }
6020 }
6021}
6022
6023/*
6024 * Detect whether query looks like SELECT ... FROM VALUES(),
6025 * with no need to rename the output columns of the VALUES RTE.
6026 * If so, return the VALUES RTE. Otherwise return NULL.
6027 */
6028static RangeTblEntry *
6029get_simple_values_rte(Query *query, TupleDesc resultDesc)
6030{
6031 RangeTblEntry *result = NULL;
6032 ListCell *lc;
6033
6034 /*
6035 * We want to detect a match even if the Query also contains OLD or NEW
6036 * rule RTEs. So the idea is to scan the rtable and see if there is only
6037 * one inFromCl RTE that is a VALUES RTE.
6038 */
6039 foreach(lc, query->rtable)
6040 {
6041 RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
6042
6043 if (rte->rtekind == RTE_VALUES && rte->inFromCl)
6044 {
6045 if (result)
6046 return NULL; /* multiple VALUES (probably not possible) */
6047 result = rte;
6048 }
6049 else if (rte->rtekind == RTE_RELATION && !rte->inFromCl)
6050 continue; /* ignore rule entries */
6051 else
6052 return NULL; /* something else -> not simple VALUES */
6053 }
6054
6055 /*
6056 * We don't need to check the targetlist in any great detail, because
6057 * parser/analyze.c will never generate a "bare" VALUES RTE --- they only
6058 * appear inside auto-generated sub-queries with very restricted
6059 * structure. However, DefineView might have modified the tlist by
6060 * injecting new column aliases, or we might have some other column
6061 * aliases forced by a resultDesc. We can only simplify if the RTE's
6062 * column names match the names that get_target_list() would select.
6063 */
6064 if (result)
6065 {
6066 ListCell *lcn;
6067 int colno;
6068
6069 if (list_length(query->targetList) != list_length(result->eref->colnames))
6070 return NULL; /* this probably cannot happen */
6071 colno = 0;
6072 forboth(lc, query->targetList, lcn, result->eref->colnames)
6073 {
6074 TargetEntry *tle = (TargetEntry *) lfirst(lc);
6075 char *cname = strVal(lfirst(lcn));
6076 char *colname;
6077
6078 if (tle->resjunk)
6079 return NULL; /* this probably cannot happen */
6080
6081 /* compute name that get_target_list would use for column */
6082 colno++;
6083 if (resultDesc && colno <= resultDesc->natts)
6084 colname = NameStr(TupleDescAttr(resultDesc, colno - 1)->attname);
6085 else
6086 colname = tle->resname;
6087
6088 /* does it match the VALUES RTE? */
6089 if (colname == NULL || strcmp(colname, cname) != 0)
6090 return NULL; /* column name has been changed */
6091 }
6092 }
6093
6094 return result;
6095}
6096
6097static void
6098get_basic_select_query(Query *query, deparse_context *context)
6099{
6100 StringInfo buf = context->buf;
6101 RangeTblEntry *values_rte;
6102 char *sep;
6103 ListCell *l;
6104
6105 if (PRETTY_INDENT(context))
6106 {
6107 context->indentLevel += PRETTYINDENT_STD;
6108 appendStringInfoChar(buf, ' ');
6109 }
6110
6111 /*
6112 * If the query looks like SELECT * FROM (VALUES ...), then print just the
6113 * VALUES part. This reverses what transformValuesClause() did at parse
6114 * time.
6115 */
6116 values_rte = get_simple_values_rte(query, context->resultDesc);
6117 if (values_rte)
6118 {
6119 get_values_def(values_rte->values_lists, context);
6120 return;
6121 }
6122
6123 /*
6124 * Build up the query string - first we say SELECT
6125 */
6126 if (query->isReturn)
6127 appendStringInfoString(buf, "RETURN");
6128 else
6129 appendStringInfoString(buf, "SELECT");
6130
6131 /* Add the DISTINCT clause if given */
6132 if (query->distinctClause != NIL)
6133 {
6134 if (query->hasDistinctOn)
6135 {
6136 appendStringInfoString(buf, " DISTINCT ON (");
6137 sep = "";
6138 foreach(l, query->distinctClause)
6139 {
6140 SortGroupClause *srt = (SortGroupClause *) lfirst(l);
6141
6142 appendStringInfoString(buf, sep);
6143 get_rule_sortgroupclause(srt->tleSortGroupRef, query->targetList,
6144 false, context);
6145 sep = ", ";
6146 }
6147 appendStringInfoChar(buf, ')');
6148 }
6149 else
6150 appendStringInfoString(buf, " DISTINCT");
6151 }
6152
6153 /* Then we tell what to select (the targetlist) */
6154 get_target_list(query->targetList, context);
6155
6156 /* Add the FROM clause if needed */
6157 get_from_clause(query, " FROM ", context);
6158
6159 /* Add the WHERE clause if given */
6160 if (query->jointree->quals != NULL)
6161 {
6162 appendContextKeyword(context, " WHERE ",
6163 -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
6164 get_rule_expr(query->jointree->quals, context, false);
6165 }
6166
6167 /* Add the GROUP BY clause if given */
6168 if (query->groupClause != NULL || query->groupingSets != NULL)
6169 {
6170 bool save_ingroupby;
6171
6172 appendContextKeyword(context, " GROUP BY ",
6173 -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
6174 if (query->groupDistinct)
6175 appendStringInfoString(buf, "DISTINCT ");
6176
6177 save_ingroupby = context->inGroupBy;
6178 context->inGroupBy = true;
6179
6180 if (query->groupingSets == NIL)
6181 {
6182 sep = "";
6183 foreach(l, query->groupClause)
6184 {
6185 SortGroupClause *grp = (SortGroupClause *) lfirst(l);
6186
6187 appendStringInfoString(buf, sep);
6188 get_rule_sortgroupclause(grp->tleSortGroupRef, query->targetList,
6189 false, context);
6190 sep = ", ";
6191 }
6192 }
6193 else
6194 {
6195 sep = "";
6196 foreach(l, query->groupingSets)
6197 {
6198 GroupingSet *grp = lfirst(l);
6199
6200 appendStringInfoString(buf, sep);
6201 get_rule_groupingset(grp, query->targetList, true, context);
6202 sep = ", ";
6203 }
6204 }
6205
6206 context->inGroupBy = save_ingroupby;
6207 }
6208
6209 /* Add the HAVING clause if given */
6210 if (query->havingQual != NULL)
6211 {
6212 appendContextKeyword(context, " HAVING ",
6213 -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
6214 get_rule_expr(query->havingQual, context, false);
6215 }
6216
6217 /* Add the WINDOW clause if needed */
6218 if (query->windowClause != NIL)
6219 get_rule_windowclause(query, context);
6220}
6221
6222/* ----------
6223 * get_target_list - Parse back a SELECT target list
6224 *
6225 * This is also used for RETURNING lists in INSERT/UPDATE/DELETE/MERGE.
6226 * ----------
6227 */
6228static void
6229get_target_list(List *targetList, deparse_context *context)
6230{
6231 StringInfo buf = context->buf;
6232 StringInfoData targetbuf;
6233 bool last_was_multiline = false;
6234 char *sep;
6235 int colno;
6236 ListCell *l;
6237
6238 /* we use targetbuf to hold each TLE's text temporarily */
6239 initStringInfo(&targetbuf);
6240
6241 sep = " ";
6242 colno = 0;
6243 foreach(l, targetList)
6244 {
6245 TargetEntry *tle = (TargetEntry *) lfirst(l);
6246 char *colname;
6247 char *attname;
6248
6249 if (tle->resjunk)
6250 continue; /* ignore junk entries */
6251
6252 appendStringInfoString(buf, sep);
6253 sep = ", ";
6254 colno++;
6255
6256 /*
6257 * Put the new field text into targetbuf so we can decide after we've
6258 * got it whether or not it needs to go on a new line.
6259 */
6260 resetStringInfo(&targetbuf);
6261 context->buf = &targetbuf;
6262
6263 /*
6264 * We special-case Var nodes rather than using get_rule_expr. This is
6265 * needed because get_rule_expr will display a whole-row Var as
6266 * "foo.*", which is the preferred notation in most contexts, but at
6267 * the top level of a SELECT list it's not right (the parser will
6268 * expand that notation into multiple columns, yielding behavior
6269 * different from a whole-row Var). We need to call get_variable
6270 * directly so that we can tell it to do the right thing, and so that
6271 * we can get the attribute name which is the default AS label.
6272 */
6273 if (tle->expr && (IsA(tle->expr, Var)))
6274 {
6275 attname = get_variable((Var *) tle->expr, 0, true, context);
6276 }
6277 else
6278 {
6279 get_rule_expr((Node *) tle->expr, context, true);
6280
6281 /*
6282 * When colNamesVisible is true, we should always show the
6283 * assigned column name explicitly. Otherwise, show it only if
6284 * it's not FigureColname's fallback.
6285 */
6286 attname = context->colNamesVisible ? NULL : "?column?";
6287 }
6288
6289 /*
6290 * Figure out what the result column should be called. In the context
6291 * of a view, use the view's tuple descriptor (so as to pick up the
6292 * effects of any column RENAME that's been done on the view).
6293 * Otherwise, just use what we can find in the TLE.
6294 */
6295 if (context->resultDesc && colno <= context->resultDesc->natts)
6296 colname = NameStr(TupleDescAttr(context->resultDesc,
6297 colno - 1)->attname);
6298 else
6299 colname = tle->resname;
6300
6301 /* Show AS unless the column's name is correct as-is */
6302 if (colname) /* resname could be NULL */
6303 {
6304 if (attname == NULL || strcmp(attname, colname) != 0)
6305 appendStringInfo(&targetbuf, " AS %s", quote_identifier(colname));
6306 }
6307
6308 /* Restore context's output buffer */
6309 context->buf = buf;
6310
6311 /* Consider line-wrapping if enabled */
6312 if (PRETTY_INDENT(context) && context->wrapColumn >= 0)
6313 {
6314 int leading_nl_pos;
6315
6316 /* Does the new field start with a new line? */
6317 if (targetbuf.len > 0 && targetbuf.data[0] == '\n')
6318 leading_nl_pos = 0;
6319 else
6320 leading_nl_pos = -1;
6321
6322 /* If so, we shouldn't add anything */
6323 if (leading_nl_pos >= 0)
6324 {
6325 /* instead, remove any trailing spaces currently in buf */
6326 removeStringInfoSpaces(buf);
6327 }
6328 else
6329 {
6330 char *trailing_nl;
6331
6332 /* Locate the start of the current line in the output buffer */
6333 trailing_nl = strrchr(buf->data, '\n');
6334 if (trailing_nl == NULL)
6335 trailing_nl = buf->data;
6336 else
6337 trailing_nl++;
6338
6339 /*
6340 * Add a newline, plus some indentation, if the new field is
6341 * not the first and either the new field would cause an
6342 * overflow or the last field used more than one line.
6343 */
6344 if (colno > 1 &&
6345 ((strlen(trailing_nl) + targetbuf.len > context->wrapColumn) ||
6346 last_was_multiline))
6347 appendContextKeyword(context, "", -PRETTYINDENT_STD,
6348 PRETTYINDENT_STD, PRETTYINDENT_VAR);
6349 }
6350
6351 /* Remember this field's multiline status for next iteration */
6352 last_was_multiline =
6353 (strchr(targetbuf.data + leading_nl_pos + 1, '\n') != NULL);
6354 }
6355
6356 /* Add the new field */
6357 appendBinaryStringInfo(buf, targetbuf.data, targetbuf.len);
6358 }
6359
6360 /* clean up */
6361 pfree(targetbuf.data);
6362}
6363
6364static void
6365get_returning_clause(Query *query, deparse_context *context)
6366{
6367 StringInfo buf = context->buf;
6368
6369 if (query->returningList)
6370 {
6371 bool have_with = false;
6372
6373 appendContextKeyword(context, " RETURNING",
6374 -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
6375
6376 /* Add WITH (OLD/NEW) options, if they're not the defaults */
6377 if (query->returningOldAlias && strcmp(query->returningOldAlias, "old") != 0)
6378 {
6379 appendStringInfo(buf, " WITH (OLD AS %s",
6380 quote_identifier(query->returningOldAlias));
6381 have_with = true;
6382 }
6383 if (query->returningNewAlias && strcmp(query->returningNewAlias, "new") != 0)
6384 {
6385 if (have_with)
6386 appendStringInfo(buf, ", NEW AS %s",
6387 quote_identifier(query->returningNewAlias));
6388 else
6389 {
6390 appendStringInfo(buf, " WITH (NEW AS %s",
6391 quote_identifier(query->returningNewAlias));
6392 have_with = true;
6393 }
6394 }
6395 if (have_with)
6396 appendStringInfoChar(buf, ')');
6397
6398 /* Add the returning expressions themselves */
6399 get_target_list(query->returningList, context);
6400 }
6401}
6402
6403static void
6404get_setop_query(Node *setOp, Query *query, deparse_context *context)
6405{
6406 StringInfo buf = context->buf;
6407 bool need_paren;
6408
6409 /* Guard against excessively long or deeply-nested queries */
6410 CHECK_FOR_INTERRUPTS();
6411 check_stack_depth();
6412
6413 if (IsA(setOp, RangeTblRef))
6414 {
6415 RangeTblRef *rtr = (RangeTblRef *) setOp;
6416 RangeTblEntry *rte = rt_fetch(rtr->rtindex, query->rtable);
6417 Query *subquery = rte->subquery;
6418
6419 Assert(subquery != NULL);
6420
6421 /*
6422 * We need parens if WITH, ORDER BY, FOR UPDATE, or LIMIT; see gram.y.
6423 * Also add parens if the leaf query contains its own set operations.
6424 * (That shouldn't happen unless one of the other clauses is also
6425 * present, see transformSetOperationTree; but let's be safe.)
6426 */
6427 need_paren = (subquery->cteList ||
6428 subquery->sortClause ||
6429 subquery->rowMarks ||
6430 subquery->limitOffset ||
6431 subquery->limitCount ||
6432 subquery->setOperations);
6433 if (need_paren)
6434 appendStringInfoChar(buf, '(');
6435 get_query_def(subquery, buf, context->namespaces,
6436 context->resultDesc, context->colNamesVisible,
6437 context->prettyFlags, context->wrapColumn,
6438 context->indentLevel);
6439 if (need_paren)
6440 appendStringInfoChar(buf, ')');
6441 }
6442 else if (IsA(setOp, SetOperationStmt))
6443 {
6444 SetOperationStmt *op = (SetOperationStmt *) setOp;
6445 int subindent;
6446 bool save_colnamesvisible;
6447
6448 /*
6449 * We force parens when nesting two SetOperationStmts, except when the
6450 * lefthand input is another setop of the same kind. Syntactically,
6451 * we could omit parens in rather more cases, but it seems best to use
6452 * parens to flag cases where the setop operator changes. If we use
6453 * parens, we also increase the indentation level for the child query.
6454 *
6455 * There are some cases in which parens are needed around a leaf query
6456 * too, but those are more easily handled at the next level down (see
6457 * code above).
6458 */
6459 if (IsA(op->larg, SetOperationStmt))
6460 {
6461 SetOperationStmt *lop = (SetOperationStmt *) op->larg;
6462
6463 if (op->op == lop->op && op->all == lop->all)
6464 need_paren = false;
6465 else
6466 need_paren = true;
6467 }
6468 else
6469 need_paren = false;
6470
6471 if (need_paren)
6472 {
6473 appendStringInfoChar(buf, '(');
6474 subindent = PRETTYINDENT_STD;
6475 appendContextKeyword(context, "", subindent, 0, 0);
6476 }
6477 else
6478 subindent = 0;
6479
6480 get_setop_query(op->larg, query, context);
6481
6482 if (need_paren)
6483 appendContextKeyword(context, ") ", -subindent, 0, 0);
6484 else if (PRETTY_INDENT(context))
6485 appendContextKeyword(context, "", -subindent, 0, 0);
6486 else
6487 appendStringInfoChar(buf, ' ');
6488
6489 switch (op->op)
6490 {
6491 case SETOP_UNION:
6492 appendStringInfoString(buf, "UNION ");
6493 break;
6494 case SETOP_INTERSECT:
6495 appendStringInfoString(buf, "INTERSECT ");
6496 break;
6497 case SETOP_EXCEPT:
6498 appendStringInfoString(buf, "EXCEPT ");
6499 break;
6500 default:
6501 elog(ERROR, "unrecognized set op: %d",
6502 (int) op->op);
6503 }
6504 if (op->all)
6505 appendStringInfoString(buf, "ALL ");
6506
6507 /* Always parenthesize if RHS is another setop */
6508 need_paren = IsA(op->rarg, SetOperationStmt);
6509
6510 /*
6511 * The indentation code here is deliberately a bit different from that
6512 * for the lefthand input, because we want the line breaks in
6513 * different places.
6514 */
6515 if (need_paren)
6516 {
6517 appendStringInfoChar(buf, '(');
6518 subindent = PRETTYINDENT_STD;
6519 }
6520 else
6521 subindent = 0;
6522 appendContextKeyword(context, "", subindent, 0, 0);
6523
6524 /*
6525 * The output column names of the RHS sub-select don't matter.
6526 */
6527 save_colnamesvisible = context->colNamesVisible;
6528 context->colNamesVisible = false;
6529
6530 get_setop_query(op->rarg, query, context);
6531
6532 context->colNamesVisible = save_colnamesvisible;
6533
6534 if (PRETTY_INDENT(context))
6535 context->indentLevel -= subindent;
6536 if (need_paren)
6537 appendContextKeyword(context, ")", 0, 0, 0);
6538 }
6539 else
6540 {
6541 elog(ERROR, "unrecognized node type: %d",
6542 (int) nodeTag(setOp));
6543 }
6544}
6545
6546/*
6547 * Display a sort/group clause.
6548 *
6549 * Also returns the expression tree, so caller need not find it again.
6550 */
6551static Node *
6552get_rule_sortgroupclause(Index ref, List *tlist, bool force_colno,
6553 deparse_context *context)
6554{
6555 StringInfo buf = context->buf;
6556 TargetEntry *tle;
6557 Node *expr;
6558
6559 tle = get_sortgroupref_tle(ref, tlist);
6560 expr = (Node *) tle->expr;
6561
6562 /*
6563 * Use column-number form if requested by caller. Otherwise, if
6564 * expression is a constant, force it to be dumped with an explicit cast
6565 * as decoration --- this is because a simple integer constant is
6566 * ambiguous (and will be misinterpreted by findTargetlistEntrySQL92()) if
6567 * we dump it without any decoration. Similarly, if it's just a Var,
6568 * there is risk of misinterpretation if the column name is reassigned in
6569 * the SELECT list, so we may need to force table qualification. And, if
6570 * it's anything more complex than a simple Var, then force extra parens
6571 * around it, to ensure it can't be misinterpreted as a cube() or rollup()
6572 * construct.
6573 */
6574 if (force_colno)
6575 {
6576 Assert(!tle->resjunk);
6577 appendStringInfo(buf, "%d", tle->resno);
6578 }
6579 else if (!expr)
6580 /* do nothing, probably can't happen */ ;
6581 else if (IsA(expr, Const))
6582 get_const_expr((Const *) expr, context, 1);
6583 else if (IsA(expr, Var))
6584 {
6585 /* Tell get_variable to check for name conflict */
6586 bool save_varinorderby = context->varInOrderBy;
6587
6588 context->varInOrderBy = true;
6589 (void) get_variable((Var *) expr, 0, false, context);
6590 context->varInOrderBy = save_varinorderby;
6591 }
6592 else
6593 {
6594 /*
6595 * We must force parens for function-like expressions even if
6596 * PRETTY_PAREN is off, since those are the ones in danger of
6597 * misparsing. For other expressions we need to force them only if
6598 * PRETTY_PAREN is on, since otherwise the expression will output them
6599 * itself. (We can't skip the parens.)
6600 */
6601 bool need_paren = (PRETTY_PAREN(context)
6602 || IsA(expr, FuncExpr)
6603 || IsA(expr, Aggref)
6604 || IsA(expr, WindowFunc)
6605 || IsA(expr, JsonConstructorExpr));
6606
6607 if (need_paren)
6608 appendStringInfoChar(context->buf, '(');
6609 get_rule_expr(expr, context, true);
6610 if (need_paren)
6611 appendStringInfoChar(context->buf, ')');
6612 }
6613
6614 return expr;
6615}
6616
6617/*
6618 * Display a GroupingSet
6619 */
6620static void
6621get_rule_groupingset(GroupingSet *gset, List *targetlist,
6622 bool omit_parens, deparse_context *context)
6623{
6624 ListCell *l;
6625 StringInfo buf = context->buf;
6626 bool omit_child_parens = true;
6627 char *sep = "";
6628
6629 switch (gset->kind)
6630 {
6631 case GROUPING_SET_EMPTY:
6632 appendStringInfoString(buf, "()");
6633 return;
6634
6635 case GROUPING_SET_SIMPLE:
6636 {
6637 if (!omit_parens || list_length(gset->content) != 1)
6638 appendStringInfoChar(buf, '(');
6639
6640 foreach(l, gset->content)
6641 {
6642 Index ref = lfirst_int(l);
6643
6644 appendStringInfoString(buf, sep);
6645 get_rule_sortgroupclause(ref, targetlist,
6646 false, context);
6647 sep = ", ";
6648 }
6649
6650 if (!omit_parens || list_length(gset->content) != 1)
6651 appendStringInfoChar(buf, ')');
6652 }
6653 return;
6654
6655 case GROUPING_SET_ROLLUP:
6656 appendStringInfoString(buf, "ROLLUP(");
6657 break;
6658 case GROUPING_SET_CUBE:
6659 appendStringInfoString(buf, "CUBE(");
6660 break;
6661 case GROUPING_SET_SETS:
6662 appendStringInfoString(buf, "GROUPING SETS (");
6663 omit_child_parens = false;
6664 break;
6665 }
6666
6667 foreach(l, gset->content)
6668 {
6669 appendStringInfoString(buf, sep);
6670 get_rule_groupingset(lfirst(l), targetlist, omit_child_parens, context);
6671 sep = ", ";
6672 }
6673
6674 appendStringInfoChar(buf, ')');
6675}
6676
6677/*
6678 * Display an ORDER BY list.
6679 */
6680static void
6681get_rule_orderby(List *orderList, List *targetList,
6682 bool force_colno, deparse_context *context)
6683{
6684 StringInfo buf = context->buf;
6685 const char *sep;
6686 ListCell *l;
6687
6688 sep = "";
6689 foreach(l, orderList)
6690 {
6691 SortGroupClause *srt = (SortGroupClause *) lfirst(l);
6692 Node *sortexpr;
6693 Oid sortcoltype;
6694 TypeCacheEntry *typentry;
6695
6696 appendStringInfoString(buf, sep);
6697 sortexpr = get_rule_sortgroupclause(srt->tleSortGroupRef, targetList,
6698 force_colno, context);
6699 sortcoltype = exprType(sortexpr);
6700 /* See whether operator is default < or > for datatype */
6701 typentry = lookup_type_cache(sortcoltype,
6702 TYPECACHE_LT_OPR | TYPECACHE_GT_OPR);
6703 if (srt->sortop == typentry->lt_opr)
6704 {
6705 /* ASC is default, so emit nothing for it */
6706 if (srt->nulls_first)
6707 appendStringInfoString(buf, " NULLS FIRST");
6708 }
6709 else if (srt->sortop == typentry->gt_opr)
6710 {
6711 appendStringInfoString(buf, " DESC");
6712 /* DESC defaults to NULLS FIRST */
6713 if (!srt->nulls_first)
6714 appendStringInfoString(buf, " NULLS LAST");
6715 }
6716 else
6717 {
6718 appendStringInfo(buf, " USING %s",
6719 generate_operator_name(srt->sortop,
6720 sortcoltype,
6721 sortcoltype));
6722 /* be specific to eliminate ambiguity */
6723 if (srt->nulls_first)
6724 appendStringInfoString(buf, " NULLS FIRST");
6725 else
6726 appendStringInfoString(buf, " NULLS LAST");
6727 }
6728 sep = ", ";
6729 }
6730}
6731
6732/*
6733 * Display a WINDOW clause.
6734 *
6735 * Note that the windowClause list might contain only anonymous window
6736 * specifications, in which case we should print nothing here.
6737 */
6738static void
6739get_rule_windowclause(Query *query, deparse_context *context)
6740{
6741 StringInfo buf = context->buf;
6742 const char *sep;
6743 ListCell *l;
6744
6745 sep = NULL;
6746 foreach(l, query->windowClause)
6747 {
6748 WindowClause *wc = (WindowClause *) lfirst(l);
6749
6750 if (wc->name == NULL)
6751 continue; /* ignore anonymous windows */
6752
6753 if (sep == NULL)
6754 appendContextKeyword(context, " WINDOW ",
6755 -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
6756 else
6757 appendStringInfoString(buf, sep);
6758
6759 appendStringInfo(buf, "%s AS ", quote_identifier(wc->name));
6760
6761 get_rule_windowspec(wc, query->targetList, context);
6762
6763 sep = ", ";
6764 }
6765}
6766
6767/*
6768 * Display a window definition
6769 */
6770static void
6771get_rule_windowspec(WindowClause *wc, List *targetList,
6772 deparse_context *context)
6773{
6774 StringInfo buf = context->buf;
6775 bool needspace = false;
6776 const char *sep;
6777 ListCell *l;
6778
6779 appendStringInfoChar(buf, '(');
6780 if (wc->refname)
6781 {
6782 appendStringInfoString(buf, quote_identifier(wc->refname));
6783 needspace = true;
6784 }
6785 /* partition clauses are always inherited, so only print if no refname */
6786 if (wc->partitionClause && !wc->refname)
6787 {
6788 if (needspace)
6789 appendStringInfoChar(buf, ' ');
6790 appendStringInfoString(buf, "PARTITION BY ");
6791 sep = "";
6792 foreach(l, wc->partitionClause)
6793 {
6794 SortGroupClause *grp = (SortGroupClause *) lfirst(l);
6795
6796 appendStringInfoString(buf, sep);
6797 get_rule_sortgroupclause(grp->tleSortGroupRef, targetList,
6798 false, context);
6799 sep = ", ";
6800 }
6801 needspace = true;
6802 }
6803 /* print ordering clause only if not inherited */
6804 if (wc->orderClause && !wc->copiedOrder)
6805 {
6806 if (needspace)
6807 appendStringInfoChar(buf, ' ');
6808 appendStringInfoString(buf, "ORDER BY ");
6809 get_rule_orderby(wc->orderClause, targetList, false, context);
6810 needspace = true;
6811 }
6812 /* framing clause is never inherited, so print unless it's default */
6813 if (wc->frameOptions & FRAMEOPTION_NONDEFAULT)
6814 {
6815 if (needspace)
6816 appendStringInfoChar(buf, ' ');
6817 get_window_frame_options(wc->frameOptions,
6818 wc->startOffset, wc->endOffset,
6819 context);
6820 }
6821 appendStringInfoChar(buf, ')');
6822}
6823
6824/*
6825 * Append the description of a window's framing options to context->buf
6826 */
6827static void
6828get_window_frame_options(int frameOptions,
6829 Node *startOffset, Node *endOffset,
6830 deparse_context *context)
6831{
6832 StringInfo buf = context->buf;
6833
6834 if (frameOptions & FRAMEOPTION_NONDEFAULT)
6835 {
6836 if (frameOptions & FRAMEOPTION_RANGE)
6837 appendStringInfoString(buf, "RANGE ");
6838 else if (frameOptions & FRAMEOPTION_ROWS)
6839 appendStringInfoString(buf, "ROWS ");
6840 else if (frameOptions & FRAMEOPTION_GROUPS)
6841 appendStringInfoString(buf, "GROUPS ");
6842 else
6843 Assert(false);
6844 if (frameOptions & FRAMEOPTION_BETWEEN)
6845 appendStringInfoString(buf, "BETWEEN ");
6846 if (frameOptions & FRAMEOPTION_START_UNBOUNDED_PRECEDING)
6847 appendStringInfoString(buf, "UNBOUNDED PRECEDING ");
6848 else if (frameOptions & FRAMEOPTION_START_CURRENT_ROW)
6849 appendStringInfoString(buf, "CURRENT ROW ");
6850 else if (frameOptions & FRAMEOPTION_START_OFFSET)
6851 {
6852 get_rule_expr(startOffset, context, false);
6853 if (frameOptions & FRAMEOPTION_START_OFFSET_PRECEDING)
6854 appendStringInfoString(buf, " PRECEDING ");
6855 else if (frameOptions & FRAMEOPTION_START_OFFSET_FOLLOWING)
6856 appendStringInfoString(buf, " FOLLOWING ");
6857 else
6858 Assert(false);
6859 }
6860 else
6861 Assert(false);
6862 if (frameOptions & FRAMEOPTION_BETWEEN)
6863 {
6864 appendStringInfoString(buf, "AND ");
6865 if (frameOptions & FRAMEOPTION_END_UNBOUNDED_FOLLOWING)
6866 appendStringInfoString(buf, "UNBOUNDED FOLLOWING ");
6867 else if (frameOptions & FRAMEOPTION_END_CURRENT_ROW)
6868 appendStringInfoString(buf, "CURRENT ROW ");
6869 else if (frameOptions & FRAMEOPTION_END_OFFSET)
6870 {
6871 get_rule_expr(endOffset, context, false);
6872 if (frameOptions & FRAMEOPTION_END_OFFSET_PRECEDING)
6873 appendStringInfoString(buf, " PRECEDING ");
6874 else if (frameOptions & FRAMEOPTION_END_OFFSET_FOLLOWING)
6875 appendStringInfoString(buf, " FOLLOWING ");
6876 else
6877 Assert(false);
6878 }
6879 else
6880 Assert(false);
6881 }
6882 if (frameOptions & FRAMEOPTION_EXCLUDE_CURRENT_ROW)
6883 appendStringInfoString(buf, "EXCLUDE CURRENT ROW ");
6884 else if (frameOptions & FRAMEOPTION_EXCLUDE_GROUP)
6885 appendStringInfoString(buf, "EXCLUDE GROUP ");
6886 else if (frameOptions & FRAMEOPTION_EXCLUDE_TIES)
6887 appendStringInfoString(buf, "EXCLUDE TIES ");
6888 /* we will now have a trailing space; remove it */
6889 buf->data[--(buf->len)] = '\0';
6890 }
6891}
6892
6893/*
6894 * Return the description of a window's framing options as a palloc'd string
6895 */
6896char *
6897get_window_frame_options_for_explain(int frameOptions,
6898 Node *startOffset, Node *endOffset,
6899 List *dpcontext, bool forceprefix)
6900{
6901 StringInfoData buf;
6902 deparse_context context;
6903
6904 initStringInfo(&buf);
6905 context.buf = &buf;
6906 context.namespaces = dpcontext;
6907 context.resultDesc = NULL;
6908 context.targetList = NIL;
6909 context.windowClause = NIL;
6910 context.varprefix = forceprefix;
6911 context.prettyFlags = 0;
6912 context.wrapColumn = WRAP_COLUMN_DEFAULT;
6913 context.indentLevel = 0;
6914 context.colNamesVisible = true;
6915 context.inGroupBy = false;
6916 context.varInOrderBy = false;
6917 context.appendparents = NULL;
6918
6919 get_window_frame_options(frameOptions, startOffset, endOffset, &context);
6920
6921 return buf.data;
6922}
6923
6924/* ----------
6925 * get_insert_query_def - Parse back an INSERT parsetree
6926 * ----------
6927 */
6928static void
6929get_insert_query_def(Query *query, deparse_context *context)
6930{
6931 StringInfo buf = context->buf;
6932 RangeTblEntry *select_rte = NULL;
6933 RangeTblEntry *values_rte = NULL;
6934 RangeTblEntry *rte;
6935 char *sep;
6936 ListCell *l;
6937 List *strippedexprs;
6938
6939 /* Insert the WITH clause if given */
6940 get_with_clause(query, context);
6941
6942 /*
6943 * If it's an INSERT ... SELECT or multi-row VALUES, there will be a
6944 * single RTE for the SELECT or VALUES. Plain VALUES has neither.
6945 */
6946 foreach(l, query->rtable)
6947 {
6948 rte = (RangeTblEntry *) lfirst(l);
6949
6950 if (rte->rtekind == RTE_SUBQUERY)
6951 {
6952 if (select_rte)
6953 elog(ERROR, "too many subquery RTEs in INSERT");
6954 select_rte = rte;
6955 }
6956
6957 if (rte->rtekind == RTE_VALUES)
6958 {
6959 if (values_rte)
6960 elog(ERROR, "too many values RTEs in INSERT");
6961 values_rte = rte;
6962 }
6963 }
6964 if (select_rte && values_rte)
6965 elog(ERROR, "both subquery and values RTEs in INSERT");
6966
6967 /*
6968 * Start the query with INSERT INTO relname
6969 */
6970 rte = rt_fetch(query->resultRelation, query->rtable);
6971 Assert(rte->rtekind == RTE_RELATION);
6972
6973 if (PRETTY_INDENT(context))
6974 {
6975 context->indentLevel += PRETTYINDENT_STD;
6976 appendStringInfoChar(buf, ' ');
6977 }
6978 appendStringInfo(buf, "INSERT INTO %s",
6979 generate_relation_name(rte->relid, NIL));
6980
6981 /* Print the relation alias, if needed; INSERT requires explicit AS */
6982 get_rte_alias(rte, query->resultRelation, true, context);
6983
6984 /* always want a space here */
6985 appendStringInfoChar(buf, ' ');
6986
6987 /*
6988 * Add the insert-column-names list. Any indirection decoration needed on
6989 * the column names can be inferred from the top targetlist.
6990 */
6991 strippedexprs = NIL;
6992 sep = "";
6993 if (query->targetList)
6994 appendStringInfoChar(buf, '(');
6995 foreach(l, query->targetList)
6996 {
6997 TargetEntry *tle = (TargetEntry *) lfirst(l);
6998
6999 if (tle->resjunk)
7000 continue; /* ignore junk entries */
7001
7002 appendStringInfoString(buf, sep);
7003 sep = ", ";
7004
7005 /*
7006 * Put out name of target column; look in the catalogs, not at
7007 * tle->resname, since resname will fail to track RENAME.
7008 */
7009 appendStringInfoString(buf,
7010 quote_identifier(get_attname(rte->relid,
7011 tle->resno,
7012 false)));
7013
7014 /*
7015 * Print any indirection needed (subfields or subscripts), and strip
7016 * off the top-level nodes representing the indirection assignments.
7017 * Add the stripped expressions to strippedexprs. (If it's a
7018 * single-VALUES statement, the stripped expressions are the VALUES to
7019 * print below. Otherwise they're just Vars and not really
7020 * interesting.)
7021 */
7022 strippedexprs = lappend(strippedexprs,
7023 processIndirection((Node *) tle->expr,
7024 context));
7025 }
7026 if (query->targetList)
7027 appendStringInfoString(buf, ") ");
7028
7029 if (query->override)
7030 {
7031 if (query->override == OVERRIDING_SYSTEM_VALUE)
7032 appendStringInfoString(buf, "OVERRIDING SYSTEM VALUE ");
7033 else if (query->override == OVERRIDING_USER_VALUE)
7034 appendStringInfoString(buf, "OVERRIDING USER VALUE ");
7035 }
7036
7037 if (select_rte)
7038 {
7039 /* Add the SELECT */
7040 get_query_def(select_rte->subquery, buf, context->namespaces, NULL,
7041 false,
7042 context->prettyFlags, context->wrapColumn,
7043 context->indentLevel);
7044 }
7045 else if (values_rte)
7046 {
7047 /* Add the multi-VALUES expression lists */
7048 get_values_def(values_rte->values_lists, context);
7049 }
7050 else if (strippedexprs)
7051 {
7052 /* Add the single-VALUES expression list */
7053 appendContextKeyword(context, "VALUES (",
7054 -PRETTYINDENT_STD, PRETTYINDENT_STD, 2);
7055 get_rule_list_toplevel(strippedexprs, context, false);
7056 appendStringInfoChar(buf, ')');
7057 }
7058 else
7059 {
7060 /* No expressions, so it must be DEFAULT VALUES */
7061 appendStringInfoString(buf, "DEFAULT VALUES");
7062 }
7063
7064 /* Add ON CONFLICT if present */
7065 if (query->onConflict)
7066 {
7067 OnConflictExpr *confl = query->onConflict;
7068
7069 appendStringInfoString(buf, " ON CONFLICT");
7070
7071 if (confl->arbiterElems)
7072 {
7073 /* Add the single-VALUES expression list */
7074 appendStringInfoChar(buf, '(');
7075 get_rule_expr((Node *) confl->arbiterElems, context, false);
7076 appendStringInfoChar(buf, ')');
7077
7078 /* Add a WHERE clause (for partial indexes) if given */
7079 if (confl->arbiterWhere != NULL)
7080 {
7081 bool save_varprefix;
7082
7083 /*
7084 * Force non-prefixing of Vars, since parser assumes that they
7085 * belong to target relation. WHERE clause does not use
7086 * InferenceElem, so this is separately required.
7087 */
7088 save_varprefix = context->varprefix;
7089 context->varprefix = false;
7090
7091 appendContextKeyword(context, " WHERE ",
7092 -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
7093 get_rule_expr(confl->arbiterWhere, context, false);
7094
7095 context->varprefix = save_varprefix;
7096 }
7097 }
7098 else if (OidIsValid(confl->constraint))
7099 {
7100 char *constraint = get_constraint_name(confl->constraint);
7101
7102 if (!constraint)
7103 elog(ERROR, "cache lookup failed for constraint %u",
7104 confl->constraint);
7105 appendStringInfo(buf, " ON CONSTRAINT %s",
7106 quote_identifier(constraint));
7107 }
7108
7109 if (confl->action == ONCONFLICT_NOTHING)
7110 {
7111 appendStringInfoString(buf, " DO NOTHING");
7112 }
7113 else
7114 {
7115 appendStringInfoString(buf, " DO UPDATE SET ");
7116 /* Deparse targetlist */
7117 get_update_query_targetlist_def(query, confl->onConflictSet,
7118 context, rte);
7119
7120 /* Add a WHERE clause if given */
7121 if (confl->onConflictWhere != NULL)
7122 {
7123 appendContextKeyword(context, " WHERE ",
7124 -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
7125 get_rule_expr(confl->onConflictWhere, context, false);
7126 }
7127 }
7128 }
7129
7130 /* Add RETURNING if present */
7131 if (query->returningList)
7132 get_returning_clause(query, context);
7133}
7134
7135
7136/* ----------
7137 * get_update_query_def - Parse back an UPDATE parsetree
7138 * ----------
7139 */
7140static void
7141get_update_query_def(Query *query, deparse_context *context)
7142{
7143 StringInfo buf = context->buf;
7144 RangeTblEntry *rte;
7145
7146 /* Insert the WITH clause if given */
7147 get_with_clause(query, context);
7148
7149 /*
7150 * Start the query with UPDATE relname SET
7151 */
7152 rte = rt_fetch(query->resultRelation, query->rtable);
7153 Assert(rte->rtekind == RTE_RELATION);
7154 if (PRETTY_INDENT(context))
7155 {
7156 appendStringInfoChar(buf, ' ');
7157 context->indentLevel += PRETTYINDENT_STD;
7158 }
7159 appendStringInfo(buf, "UPDATE %s%s",
7160 only_marker(rte),
7161 generate_relation_name(rte->relid, NIL));
7162
7163 /* Print the relation alias, if needed */
7164 get_rte_alias(rte, query->resultRelation, false, context);
7165
7166 appendStringInfoString(buf, " SET ");
7167
7168 /* Deparse targetlist */
7169 get_update_query_targetlist_def(query, query->targetList, context, rte);
7170
7171 /* Add the FROM clause if needed */
7172 get_from_clause(query, " FROM ", context);
7173
7174 /* Add a WHERE clause if given */
7175 if (query->jointree->quals != NULL)
7176 {
7177 appendContextKeyword(context, " WHERE ",
7178 -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
7179 get_rule_expr(query->jointree->quals, context, false);
7180 }
7181
7182 /* Add RETURNING if present */
7183 if (query->returningList)
7184 get_returning_clause(query, context);
7185}
7186
7187
7188/* ----------
7189 * get_update_query_targetlist_def - Parse back an UPDATE targetlist
7190 * ----------
7191 */
7192static void
7193get_update_query_targetlist_def(Query *query, List *targetList,
7194 deparse_context *context, RangeTblEntry *rte)
7195{
7196 StringInfo buf = context->buf;
7197 ListCell *l;
7198 ListCell *next_ma_cell;
7199 int remaining_ma_columns;
7200 const char *sep;
7201 SubLink *cur_ma_sublink;
7202 List *ma_sublinks;
7203
7204 /*
7205 * Prepare to deal with MULTIEXPR assignments: collect the source SubLinks
7206 * into a list. We expect them to appear, in ID order, in resjunk tlist
7207 * entries.
7208 */
7209 ma_sublinks = NIL;
7210 if (query->hasSubLinks) /* else there can't be any */
7211 {
7212 foreach(l, targetList)
7213 {
7214 TargetEntry *tle = (TargetEntry *) lfirst(l);
7215
7216 if (tle->resjunk && IsA(tle->expr, SubLink))
7217 {
7218 SubLink *sl = (SubLink *) tle->expr;
7219
7220 if (sl->subLinkType == MULTIEXPR_SUBLINK)
7221 {
7222 ma_sublinks = lappend(ma_sublinks, sl);
7223 Assert(sl->subLinkId == list_length(ma_sublinks));
7224 }
7225 }
7226 }
7227 }
7228 next_ma_cell = list_head(ma_sublinks);
7229 cur_ma_sublink = NULL;
7230 remaining_ma_columns = 0;
7231
7232 /* Add the comma separated list of 'attname = value' */
7233 sep = "";
7234 foreach(l, targetList)
7235 {
7236 TargetEntry *tle = (TargetEntry *) lfirst(l);
7237 Node *expr;
7238
7239 if (tle->resjunk)
7240 continue; /* ignore junk entries */
7241
7242 /* Emit separator (OK whether we're in multiassignment or not) */
7243 appendStringInfoString(buf, sep);
7244 sep = ", ";
7245
7246 /*
7247 * Check to see if we're starting a multiassignment group: if so,
7248 * output a left paren.
7249 */
7250 if (next_ma_cell != NULL && cur_ma_sublink == NULL)
7251 {
7252 /*
7253 * We must dig down into the expr to see if it's a PARAM_MULTIEXPR
7254 * Param. That could be buried under FieldStores and
7255 * SubscriptingRefs and CoerceToDomains (cf processIndirection()),
7256 * and underneath those there could be an implicit type coercion.
7257 * Because we would ignore implicit type coercions anyway, we
7258 * don't need to be as careful as processIndirection() is about
7259 * descending past implicit CoerceToDomains.
7260 */
7261 expr = (Node *) tle->expr;
7262 while (expr)
7263 {
7264 if (IsA(expr, FieldStore))
7265 {
7266 FieldStore *fstore = (FieldStore *) expr;
7267
7268 expr = (Node *) linitial(fstore->newvals);
7269 }
7270 else if (IsA(expr, SubscriptingRef))
7271 {
7272 SubscriptingRef *sbsref = (SubscriptingRef *) expr;
7273
7274 if (sbsref->refassgnexpr == NULL)
7275 break;
7276
7277 expr = (Node *) sbsref->refassgnexpr;
7278 }
7279 else if (IsA(expr, CoerceToDomain))
7280 {
7281 CoerceToDomain *cdomain = (CoerceToDomain *) expr;
7282
7283 if (cdomain->coercionformat != COERCE_IMPLICIT_CAST)
7284 break;
7285 expr = (Node *) cdomain->arg;
7286 }
7287 else
7288 break;
7289 }
7290 expr = strip_implicit_coercions(expr);
7291
7292 if (expr && IsA(expr, Param) &&
7293 ((Param *) expr)->paramkind == PARAM_MULTIEXPR)
7294 {
7295 cur_ma_sublink = (SubLink *) lfirst(next_ma_cell);
7296 next_ma_cell = lnext(ma_sublinks, next_ma_cell);
7297 remaining_ma_columns = count_nonjunk_tlist_entries(((Query *) cur_ma_sublink->subselect)->targetList);
7298 Assert(((Param *) expr)->paramid ==
7299 ((cur_ma_sublink->subLinkId << 16) | 1));
7300 appendStringInfoChar(buf, '(');
7301 }
7302 }
7303
7304 /*
7305 * Put out name of target column; look in the catalogs, not at
7306 * tle->resname, since resname will fail to track RENAME.
7307 */
7308 appendStringInfoString(buf,
7309 quote_identifier(get_attname(rte->relid,
7310 tle->resno,
7311 false)));
7312
7313 /*
7314 * Print any indirection needed (subfields or subscripts), and strip
7315 * off the top-level nodes representing the indirection assignments.
7316 */
7317 expr = processIndirection((Node *) tle->expr, context);
7318
7319 /*
7320 * If we're in a multiassignment, skip printing anything more, unless
7321 * this is the last column; in which case, what we print should be the
7322 * sublink, not the Param.
7323 */
7324 if (cur_ma_sublink != NULL)
7325 {
7326 if (--remaining_ma_columns > 0)
7327 continue; /* not the last column of multiassignment */
7328 appendStringInfoChar(buf, ')');
7329 expr = (Node *) cur_ma_sublink;
7330 cur_ma_sublink = NULL;
7331 }
7332
7333 appendStringInfoString(buf, " = ");
7334
7335 get_rule_expr(expr, context, false);
7336 }
7337}
7338
7339
7340/* ----------
7341 * get_delete_query_def - Parse back a DELETE parsetree
7342 * ----------
7343 */
7344static void
7345get_delete_query_def(Query *query, deparse_context *context)
7346{
7347 StringInfo buf = context->buf;
7348 RangeTblEntry *rte;
7349
7350 /* Insert the WITH clause if given */
7351 get_with_clause(query, context);
7352
7353 /*
7354 * Start the query with DELETE FROM relname
7355 */
7356 rte = rt_fetch(query->resultRelation, query->rtable);
7357 Assert(rte->rtekind == RTE_RELATION);
7358 if (PRETTY_INDENT(context))
7359 {
7360 appendStringInfoChar(buf, ' ');
7361 context->indentLevel += PRETTYINDENT_STD;
7362 }
7363 appendStringInfo(buf, "DELETE FROM %s%s",
7364 only_marker(rte),
7365 generate_relation_name(rte->relid, NIL));
7366
7367 /* Print the relation alias, if needed */
7368 get_rte_alias(rte, query->resultRelation, false, context);
7369
7370 /* Add the USING clause if given */
7371 get_from_clause(query, " USING ", context);
7372
7373 /* Add a WHERE clause if given */
7374 if (query->jointree->quals != NULL)
7375 {
7376 appendContextKeyword(context, " WHERE ",
7377 -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
7378 get_rule_expr(query->jointree->quals, context, false);
7379 }
7380
7381 /* Add RETURNING if present */
7382 if (query->returningList)
7383 get_returning_clause(query, context);
7384}
7385
7386
7387/* ----------
7388 * get_merge_query_def - Parse back a MERGE parsetree
7389 * ----------
7390 */
7391static void
7392get_merge_query_def(Query *query, deparse_context *context)
7393{
7394 StringInfo buf = context->buf;
7395 RangeTblEntry *rte;
7396 ListCell *lc;
7397 bool haveNotMatchedBySource;
7398
7399 /* Insert the WITH clause if given */
7400 get_with_clause(query, context);
7401
7402 /*
7403 * Start the query with MERGE INTO relname
7404 */
7405 rte = rt_fetch(query->resultRelation, query->rtable);
7406 Assert(rte->rtekind == RTE_RELATION);
7407 if (PRETTY_INDENT(context))
7408 {
7409 appendStringInfoChar(buf, ' ');
7410 context->indentLevel += PRETTYINDENT_STD;
7411 }
7412 appendStringInfo(buf, "MERGE INTO %s%s",
7413 only_marker(rte),
7414 generate_relation_name(rte->relid, NIL));
7415
7416 /* Print the relation alias, if needed */
7417 get_rte_alias(rte, query->resultRelation, false, context);
7418
7419 /* Print the source relation and join clause */
7420 get_from_clause(query, " USING ", context);
7421 appendContextKeyword(context, " ON ",
7422 -PRETTYINDENT_STD, PRETTYINDENT_STD, 2);
7423 get_rule_expr(query->mergeJoinCondition, context, false);
7424
7425 /*
7426 * Test for any NOT MATCHED BY SOURCE actions. If there are none, then
7427 * any NOT MATCHED BY TARGET actions are output as "WHEN NOT MATCHED", per
7428 * SQL standard. Otherwise, we have a non-SQL-standard query, so output
7429 * "BY SOURCE" / "BY TARGET" qualifiers for all NOT MATCHED actions, to be
7430 * more explicit.
7431 */
7432 haveNotMatchedBySource = false;
7433 foreach(lc, query->mergeActionList)
7434 {
7435 MergeAction *action = lfirst_node(MergeAction, lc);
7436
7437 if (action->matchKind == MERGE_WHEN_NOT_MATCHED_BY_SOURCE)
7438 {
7439 haveNotMatchedBySource = true;
7440 break;
7441 }
7442 }
7443
7444 /* Print each merge action */
7445 foreach(lc, query->mergeActionList)
7446 {
7447 MergeAction *action = lfirst_node(MergeAction, lc);
7448
7449 appendContextKeyword(context, " WHEN ",
7450 -PRETTYINDENT_STD, PRETTYINDENT_STD, 2);
7451 switch (action->matchKind)
7452 {
7453 case MERGE_WHEN_MATCHED:
7454 appendStringInfoString(buf, "MATCHED");
7455 break;
7456 case MERGE_WHEN_NOT_MATCHED_BY_SOURCE:
7457 appendStringInfoString(buf, "NOT MATCHED BY SOURCE");
7458 break;
7459 case MERGE_WHEN_NOT_MATCHED_BY_TARGET:
7460 if (haveNotMatchedBySource)
7461 appendStringInfoString(buf, "NOT MATCHED BY TARGET");
7462 else
7463 appendStringInfoString(buf, "NOT MATCHED");
7464 break;
7465 default:
7466 elog(ERROR, "unrecognized matchKind: %d",
7467 (int) action->matchKind);
7468 }
7469
7470 if (action->qual)
7471 {
7472 appendContextKeyword(context, " AND ",
7473 -PRETTYINDENT_STD, PRETTYINDENT_STD, 3);
7474 get_rule_expr(action->qual, context, false);
7475 }
7476 appendContextKeyword(context, " THEN ",
7477 -PRETTYINDENT_STD, PRETTYINDENT_STD, 3);
7478
7479 if (action->commandType == CMD_INSERT)
7480 {
7481 /* This generally matches get_insert_query_def() */
7482 List *strippedexprs = NIL;
7483 const char *sep = "";
7484 ListCell *lc2;
7485
7486 appendStringInfoString(buf, "INSERT");
7487
7488 if (action->targetList)
7489 appendStringInfoString(buf, " (");
7490 foreach(lc2, action->targetList)
7491 {
7492 TargetEntry *tle = (TargetEntry *) lfirst(lc2);
7493
7494 Assert(!tle->resjunk);
7495
7496 appendStringInfoString(buf, sep);
7497 sep = ", ";
7498
7499 appendStringInfoString(buf,
7500 quote_identifier(get_attname(rte->relid,
7501 tle->resno,
7502 false)));
7503 strippedexprs = lappend(strippedexprs,
7504 processIndirection((Node *) tle->expr,
7505 context));
7506 }
7507 if (action->targetList)
7508 appendStringInfoChar(buf, ')');
7509
7510 if (action->override)
7511 {
7512 if (action->override == OVERRIDING_SYSTEM_VALUE)
7513 appendStringInfoString(buf, " OVERRIDING SYSTEM VALUE");
7514 else if (action->override == OVERRIDING_USER_VALUE)
7515 appendStringInfoString(buf, " OVERRIDING USER VALUE");
7516 }
7517
7518 if (strippedexprs)
7519 {
7520 appendContextKeyword(context, " VALUES (",
7521 -PRETTYINDENT_STD, PRETTYINDENT_STD, 4);
7522 get_rule_list_toplevel(strippedexprs, context, false);
7523 appendStringInfoChar(buf, ')');
7524 }
7525 else
7526 appendStringInfoString(buf, " DEFAULT VALUES");
7527 }
7528 else if (action->commandType == CMD_UPDATE)
7529 {
7530 appendStringInfoString(buf, "UPDATE SET ");
7531 get_update_query_targetlist_def(query, action->targetList,
7532 context, rte);
7533 }
7534 else if (action->commandType == CMD_DELETE)
7535 appendStringInfoString(buf, "DELETE");
7536 else if (action->commandType == CMD_NOTHING)
7537 appendStringInfoString(buf, "DO NOTHING");
7538 }
7539
7540 /* Add RETURNING if present */
7541 if (query->returningList)
7542 get_returning_clause(query, context);
7543}
7544
7545
7546/* ----------
7547 * get_utility_query_def - Parse back a UTILITY parsetree
7548 * ----------
7549 */
7550static void
7551get_utility_query_def(Query *query, deparse_context *context)
7552{
7553 StringInfo buf = context->buf;
7554
7555 if (query->utilityStmt && IsA(query->utilityStmt, NotifyStmt))
7556 {
7557 NotifyStmt *stmt = (NotifyStmt *) query->utilityStmt;
7558
7559 appendContextKeyword(context, "",
7560 0, PRETTYINDENT_STD, 1);
7561 appendStringInfo(buf, "NOTIFY %s",
7562 quote_identifier(stmt->conditionname));
7563 if (stmt->payload)
7564 {
7565 appendStringInfoString(buf, ", ");
7566 simple_quote_literal(buf, stmt->payload);
7567 }
7568 }
7569 else
7570 {
7571 /* Currently only NOTIFY utility commands can appear in rules */
7572 elog(ERROR, "unexpected utility statement type");
7573 }
7574}
7575
7576/*
7577 * Display a Var appropriately.
7578 *
7579 * In some cases (currently only when recursing into an unnamed join)
7580 * the Var's varlevelsup has to be interpreted with respect to a context
7581 * above the current one; levelsup indicates the offset.
7582 *
7583 * If istoplevel is true, the Var is at the top level of a SELECT's
7584 * targetlist, which means we need special treatment of whole-row Vars.
7585 * Instead of the normal "tab.*", we'll print "tab.*::typename", which is a
7586 * dirty hack to prevent "tab.*" from being expanded into multiple columns.
7587 * (The parser will strip the useless coercion, so no inefficiency is added in
7588 * dump and reload.) We used to print just "tab" in such cases, but that is
7589 * ambiguous and will yield the wrong result if "tab" is also a plain column
7590 * name in the query.
7591 *
7592 * Returns the attname of the Var, or NULL if the Var has no attname (because
7593 * it is a whole-row Var or a subplan output reference).
7594 */
7595static char *
7596get_variable(Var *var, int levelsup, bool istoplevel, deparse_context *context)
7597{
7598 StringInfo buf = context->buf;
7599 RangeTblEntry *rte;
7600 AttrNumber attnum;
7601 int netlevelsup;
7602 deparse_namespace *dpns;
7603 int varno;
7604 AttrNumber varattno;
7605 deparse_columns *colinfo;
7606 char *refname;
7607 char *attname;
7608 bool need_prefix;
7609
7610 /* Find appropriate nesting depth */
7611 netlevelsup = var->varlevelsup + levelsup;
7612 if (netlevelsup >= list_length(context->namespaces))
7613 elog(ERROR, "bogus varlevelsup: %d offset %d",
7614 var->varlevelsup, levelsup);
7615 dpns = (deparse_namespace *) list_nth(context->namespaces,
7616 netlevelsup);
7617
7618 /*
7619 * If we have a syntactic referent for the Var, and we're working from a
7620 * parse tree, prefer to use the syntactic referent. Otherwise, fall back
7621 * on the semantic referent. (Forcing use of the semantic referent when
7622 * printing plan trees is a design choice that's perhaps more motivated by
7623 * backwards compatibility than anything else. But it does have the
7624 * advantage of making plans more explicit.)
7625 */
7626 if (var->varnosyn > 0 && dpns->plan == NULL)
7627 {
7628 varno = var->varnosyn;
7629 varattno = var->varattnosyn;
7630 }
7631 else
7632 {
7633 varno = var->varno;
7634 varattno = var->varattno;
7635 }
7636
7637 /*
7638 * Try to find the relevant RTE in this rtable. In a plan tree, it's
7639 * likely that varno is OUTER_VAR or INNER_VAR, in which case we must dig
7640 * down into the subplans, or INDEX_VAR, which is resolved similarly. Also
7641 * find the aliases previously assigned for this RTE.
7642 */
7643 if (varno >= 1 && varno <= list_length(dpns->rtable))
7644 {
7645 /*
7646 * We might have been asked to map child Vars to some parent relation.
7647 */
7648 if (context->appendparents && dpns->appendrels)
7649 {
7650 int pvarno = varno;
7651 AttrNumber pvarattno = varattno;
7652 AppendRelInfo *appinfo = dpns->appendrels[pvarno];
7653 bool found = false;
7654
7655 /* Only map up to inheritance parents, not UNION ALL appendrels */
7656 while (appinfo &&
7657 rt_fetch(appinfo->parent_relid,
7658 dpns->rtable)->rtekind == RTE_RELATION)
7659 {
7660 found = false;
7661 if (pvarattno > 0) /* system columns stay as-is */
7662 {
7663 if (pvarattno > appinfo->num_child_cols)
7664 break; /* safety check */
7665 pvarattno = appinfo->parent_colnos[pvarattno - 1];
7666 if (pvarattno == 0)
7667 break; /* Var is local to child */
7668 }
7669
7670 pvarno = appinfo->parent_relid;
7671 found = true;
7672
7673 /* If the parent is itself a child, continue up. */
7674 Assert(pvarno > 0 && pvarno <= list_length(dpns->rtable));
7675 appinfo = dpns->appendrels[pvarno];
7676 }
7677
7678 /*
7679 * If we found an ancestral rel, and that rel is included in
7680 * appendparents, print that column not the original one.
7681 */
7682 if (found && bms_is_member(pvarno, context->appendparents))
7683 {
7684 varno = pvarno;
7685 varattno = pvarattno;
7686 }
7687 }
7688
7689 rte = rt_fetch(varno, dpns->rtable);
7690
7691 /* might be returning old/new column value */
7692 if (var->varreturningtype == VAR_RETURNING_OLD)
7693 refname = dpns->ret_old_alias;
7694 else if (var->varreturningtype == VAR_RETURNING_NEW)
7695 refname = dpns->ret_new_alias;
7696 else
7697 refname = (char *) list_nth(dpns->rtable_names, varno - 1);
7698
7699 colinfo = deparse_columns_fetch(varno, dpns);
7700 attnum = varattno;
7701 }
7702 else
7703 {
7704 resolve_special_varno((Node *) var, context,
7705 get_special_variable, NULL);
7706 return NULL;
7707 }
7708
7709 /*
7710 * The planner will sometimes emit Vars referencing resjunk elements of a
7711 * subquery's target list (this is currently only possible if it chooses
7712 * to generate a "physical tlist" for a SubqueryScan or CteScan node).
7713 * Although we prefer to print subquery-referencing Vars using the
7714 * subquery's alias, that's not possible for resjunk items since they have
7715 * no alias. So in that case, drill down to the subplan and print the
7716 * contents of the referenced tlist item. This works because in a plan
7717 * tree, such Vars can only occur in a SubqueryScan or CteScan node, and
7718 * we'll have set dpns->inner_plan to reference the child plan node.
7719 */
7720 if ((rte->rtekind == RTE_SUBQUERY || rte->rtekind == RTE_CTE) &&
7721 attnum > list_length(rte->eref->colnames) &&
7722 dpns->inner_plan)
7723 {
7724 TargetEntry *tle;
7725 deparse_namespace save_dpns;
7726
7727 tle = get_tle_by_resno(dpns->inner_tlist, attnum);
7728 if (!tle)
7729 elog(ERROR, "invalid attnum %d for relation \"%s\"",
7730 attnum, rte->eref->aliasname);
7731
7732 Assert(netlevelsup == 0);
7733 push_child_plan(dpns, dpns->inner_plan, &save_dpns);
7734
7735 /*
7736 * Force parentheses because our caller probably assumed a Var is a
7737 * simple expression.
7738 */
7739 if (!IsA(tle->expr, Var))
7740 appendStringInfoChar(buf, '(');
7741 get_rule_expr((Node *) tle->expr, context, true);
7742 if (!IsA(tle->expr, Var))
7743 appendStringInfoChar(buf, ')');
7744
7745 pop_child_plan(dpns, &save_dpns);
7746 return NULL;
7747 }
7748
7749 /*
7750 * If it's an unnamed join, look at the expansion of the alias variable.
7751 * If it's a simple reference to one of the input vars, then recursively
7752 * print the name of that var instead. When it's not a simple reference,
7753 * we have to just print the unqualified join column name. (This can only
7754 * happen with "dangerous" merged columns in a JOIN USING; we took pains
7755 * previously to make the unqualified column name unique in such cases.)
7756 *
7757 * This wouldn't work in decompiling plan trees, because we don't store
7758 * joinaliasvars lists after planning; but a plan tree should never
7759 * contain a join alias variable.
7760 */
7761 if (rte->rtekind == RTE_JOIN && rte->alias == NULL)
7762 {
7763 if (rte->joinaliasvars == NIL)
7764 elog(ERROR, "cannot decompile join alias var in plan tree");
7765 if (attnum > 0)
7766 {
7767 Var *aliasvar;
7768
7769 aliasvar = (Var *) list_nth(rte->joinaliasvars, attnum - 1);
7770 /* we intentionally don't strip implicit coercions here */
7771 if (aliasvar && IsA(aliasvar, Var))
7772 {
7773 return get_variable(aliasvar, var->varlevelsup + levelsup,
7774 istoplevel, context);
7775 }
7776 }
7777
7778 /*
7779 * Unnamed join has no refname. (Note: since it's unnamed, there is
7780 * no way the user could have referenced it to create a whole-row Var
7781 * for it. So we don't have to cover that case below.)
7782 */
7783 Assert(refname == NULL);
7784 }
7785
7786 if (attnum == InvalidAttrNumber)
7787 attname = NULL;
7788 else if (attnum > 0)
7789 {
7790 /* Get column name to use from the colinfo struct */
7791 if (attnum > colinfo->num_cols)
7792 elog(ERROR, "invalid attnum %d for relation \"%s\"",
7793 attnum, rte->eref->aliasname);
7794 attname = colinfo->colnames[attnum - 1];
7795
7796 /*
7797 * If we find a Var referencing a dropped column, it seems better to
7798 * print something (anything) than to fail. In general this should
7799 * not happen, but it used to be possible for some cases involving
7800 * functions returning named composite types, and perhaps there are
7801 * still bugs out there.
7802 */
7803 if (attname == NULL)
7804 attname = "?dropped?column?";
7805 }
7806 else
7807 {
7808 /* System column - name is fixed, get it from the catalog */
7809 attname = get_rte_attribute_name(rte, attnum);
7810 }
7811
7812 need_prefix = (context->varprefix || attname == NULL ||
7813 var->varreturningtype != VAR_RETURNING_DEFAULT);
7814
7815 /*
7816 * If we're considering a plain Var in an ORDER BY (but not GROUP BY)
7817 * clause, we may need to add a table-name prefix to prevent
7818 * findTargetlistEntrySQL92 from misinterpreting the name as an
7819 * output-column name. To avoid cluttering the output with unnecessary
7820 * prefixes, do so only if there is a name match to a SELECT tlist item
7821 * that is different from the Var.
7822 */
7823 if (context->varInOrderBy && !context->inGroupBy && !need_prefix)
7824 {
7825 int colno = 0;
7826
7827 foreach_node(TargetEntry, tle, context->targetList)
7828 {
7829 char *colname;
7830
7831 if (tle->resjunk)
7832 continue; /* ignore junk entries */
7833 colno++;
7834
7835 /* This must match colname-choosing logic in get_target_list() */
7836 if (context->resultDesc && colno <= context->resultDesc->natts)
7837 colname = NameStr(TupleDescAttr(context->resultDesc,
7838 colno - 1)->attname);
7839 else
7840 colname = tle->resname;
7841
7842 if (colname && strcmp(colname, attname) == 0 &&
7843 !equal(var, tle->expr))
7844 {
7845 need_prefix = true;
7846 break;
7847 }
7848 }
7849 }
7850
7851 if (refname && need_prefix)
7852 {
7853 appendStringInfoString(buf, quote_identifier(refname));
7854 appendStringInfoChar(buf, '.');
7855 }
7856 if (attname)
7857 appendStringInfoString(buf, quote_identifier(attname));
7858 else
7859 {
7860 appendStringInfoChar(buf, '*');
7861 if (istoplevel)
7862 appendStringInfo(buf, "::%s",
7863 format_type_with_typemod(var->vartype,
7864 var->vartypmod));
7865 }
7866
7867 return attname;
7868}
7869
7870/*
7871 * Deparse a Var which references OUTER_VAR, INNER_VAR, or INDEX_VAR. This
7872 * routine is actually a callback for resolve_special_varno, which handles
7873 * finding the correct TargetEntry. We get the expression contained in that
7874 * TargetEntry and just need to deparse it, a job we can throw back on
7875 * get_rule_expr.
7876 */
7877static void
7878get_special_variable(Node *node, deparse_context *context, void *callback_arg)
7879{
7880 StringInfo buf = context->buf;
7881
7882 /*
7883 * For a non-Var referent, force parentheses because our caller probably
7884 * assumed a Var is a simple expression.
7885 */
7886 if (!IsA(node, Var))
7887 appendStringInfoChar(buf, '(');
7888 get_rule_expr(node, context, true);
7889 if (!IsA(node, Var))
7890 appendStringInfoChar(buf, ')');
7891}
7892
7893/*
7894 * Chase through plan references to special varnos (OUTER_VAR, INNER_VAR,
7895 * INDEX_VAR) until we find a real Var or some kind of non-Var node; then,
7896 * invoke the callback provided.
7897 */
7898static void
7899resolve_special_varno(Node *node, deparse_context *context,
7900 rsv_callback callback, void *callback_arg)
7901{
7902 Var *var;
7903 deparse_namespace *dpns;
7904
7905 /* This function is recursive, so let's be paranoid. */
7906 check_stack_depth();
7907
7908 /* If it's not a Var, invoke the callback. */
7909 if (!IsA(node, Var))
7910 {
7911 (*callback) (node, context, callback_arg);
7912 return;
7913 }
7914
7915 /* Find appropriate nesting depth */
7916 var = (Var *) node;
7917 dpns = (deparse_namespace *) list_nth(context->namespaces,
7918 var->varlevelsup);
7919
7920 /*
7921 * If varno is special, recurse. (Don't worry about varnosyn; if we're
7922 * here, we already decided not to use that.)
7923 */
7924 if (var->varno == OUTER_VAR && dpns->outer_tlist)
7925 {
7926 TargetEntry *tle;
7927 deparse_namespace save_dpns;
7928 Bitmapset *save_appendparents;
7929
7930 tle = get_tle_by_resno(dpns->outer_tlist, var->varattno);
7931 if (!tle)
7932 elog(ERROR, "bogus varattno for OUTER_VAR var: %d", var->varattno);
7933
7934 /*
7935 * If we're descending to the first child of an Append or MergeAppend,
7936 * update appendparents. This will affect deparsing of all Vars
7937 * appearing within the eventually-resolved subexpression.
7938 */
7939 save_appendparents = context->appendparents;
7940
7941 if (IsA(dpns->plan, Append))
7942 context->appendparents = bms_union(context->appendparents,
7943 ((Append *) dpns->plan)->apprelids);
7944 else if (IsA(dpns->plan, MergeAppend))
7945 context->appendparents = bms_union(context->appendparents,
7946 ((MergeAppend *) dpns->plan)->apprelids);
7947
7948 push_child_plan(dpns, dpns->outer_plan, &save_dpns);
7949 resolve_special_varno((Node *) tle->expr, context,
7950 callback, callback_arg);
7951 pop_child_plan(dpns, &save_dpns);
7952 context->appendparents = save_appendparents;
7953 return;
7954 }
7955 else if (var->varno == INNER_VAR && dpns->inner_tlist)
7956 {
7957 TargetEntry *tle;
7958 deparse_namespace save_dpns;
7959
7960 tle = get_tle_by_resno(dpns->inner_tlist, var->varattno);
7961 if (!tle)
7962 elog(ERROR, "bogus varattno for INNER_VAR var: %d", var->varattno);
7963
7964 push_child_plan(dpns, dpns->inner_plan, &save_dpns);
7965 resolve_special_varno((Node *) tle->expr, context,
7966 callback, callback_arg);
7967 pop_child_plan(dpns, &save_dpns);
7968 return;
7969 }
7970 else if (var->varno == INDEX_VAR && dpns->index_tlist)
7971 {
7972 TargetEntry *tle;
7973
7974 tle = get_tle_by_resno(dpns->index_tlist, var->varattno);
7975 if (!tle)
7976 elog(ERROR, "bogus varattno for INDEX_VAR var: %d", var->varattno);
7977
7978 resolve_special_varno((Node *) tle->expr, context,
7979 callback, callback_arg);
7980 return;
7981 }
7982 else if (var->varno < 1 || var->varno > list_length(dpns->rtable))
7983 elog(ERROR, "bogus varno: %d", var->varno);
7984
7985 /* Not special. Just invoke the callback. */
7986 (*callback) (node, context, callback_arg);
7987}
7988
7989/*
7990 * Get the name of a field of an expression of composite type. The
7991 * expression is usually a Var, but we handle other cases too.
7992 *
7993 * levelsup is an extra offset to interpret the Var's varlevelsup correctly.
7994 *
7995 * This is fairly straightforward when the expression has a named composite
7996 * type; we need only look up the type in the catalogs. However, the type
7997 * could also be RECORD. Since no actual table or view column is allowed to
7998 * have type RECORD, a Var of type RECORD must refer to a JOIN or FUNCTION RTE
7999 * or to a subquery output. We drill down to find the ultimate defining
8000 * expression and attempt to infer the field name from it. We ereport if we
8001 * can't determine the name.
8002 *
8003 * Similarly, a PARAM of type RECORD has to refer to some expression of
8004 * a determinable composite type.
8005 */
8006static const char *
8007get_name_for_var_field(Var *var, int fieldno,
8008 int levelsup, deparse_context *context)
8009{
8010 RangeTblEntry *rte;
8011 AttrNumber attnum;
8012 int netlevelsup;
8013 deparse_namespace *dpns;
8014 int varno;
8015 AttrNumber varattno;
8016 TupleDesc tupleDesc;
8017 Node *expr;
8018
8019 /*
8020 * If it's a RowExpr that was expanded from a whole-row Var, use the
8021 * column names attached to it. (We could let get_expr_result_tupdesc()
8022 * handle this, but it's much cheaper to just pull out the name we need.)
8023 */
8024 if (IsA(var, RowExpr))
8025 {
8026 RowExpr *r = (RowExpr *) var;
8027
8028 if (fieldno > 0 && fieldno <= list_length(r->colnames))
8029 return strVal(list_nth(r->colnames, fieldno - 1));
8030 }
8031
8032 /*
8033 * If it's a Param of type RECORD, try to find what the Param refers to.
8034 */
8035 if (IsA(var, Param))
8036 {
8037 Param *param = (Param *) var;
8038 ListCell *ancestor_cell;
8039
8040 expr = find_param_referent(param, context, &dpns, &ancestor_cell);
8041 if (expr)
8042 {
8043 /* Found a match, so recurse to decipher the field name */
8044 deparse_namespace save_dpns;
8045 const char *result;
8046
8047 push_ancestor_plan(dpns, ancestor_cell, &save_dpns);
8048 result = get_name_for_var_field((Var *) expr, fieldno,
8049 0, context);
8050 pop_ancestor_plan(dpns, &save_dpns);
8051 return result;
8052 }
8053 }
8054
8055 /*
8056 * If it's a Var of type RECORD, we have to find what the Var refers to;
8057 * if not, we can use get_expr_result_tupdesc().
8058 */
8059 if (!IsA(var, Var) ||
8060 var->vartype != RECORDOID)
8061 {
8062 tupleDesc = get_expr_result_tupdesc((Node *) var, false);
8063 /* Got the tupdesc, so we can extract the field name */
8064 Assert(fieldno >= 1 && fieldno <= tupleDesc->natts);
8065 return NameStr(TupleDescAttr(tupleDesc, fieldno - 1)->attname);
8066 }
8067
8068 /* Find appropriate nesting depth */
8069 netlevelsup = var->varlevelsup + levelsup;
8070 if (netlevelsup >= list_length(context->namespaces))
8071 elog(ERROR, "bogus varlevelsup: %d offset %d",
8072 var->varlevelsup, levelsup);
8073 dpns = (deparse_namespace *) list_nth(context->namespaces,
8074 netlevelsup);
8075
8076 /*
8077 * If we have a syntactic referent for the Var, and we're working from a
8078 * parse tree, prefer to use the syntactic referent. Otherwise, fall back
8079 * on the semantic referent. (See comments in get_variable().)
8080 */
8081 if (var->varnosyn > 0 && dpns->plan == NULL)
8082 {
8083 varno = var->varnosyn;
8084 varattno = var->varattnosyn;
8085 }
8086 else
8087 {
8088 varno = var->varno;
8089 varattno = var->varattno;
8090 }
8091
8092 /*
8093 * Try to find the relevant RTE in this rtable. In a plan tree, it's
8094 * likely that varno is OUTER_VAR or INNER_VAR, in which case we must dig
8095 * down into the subplans, or INDEX_VAR, which is resolved similarly.
8096 *
8097 * Note: unlike get_variable and resolve_special_varno, we need not worry
8098 * about inheritance mapping: a child Var should have the same datatype as
8099 * its parent, and here we're really only interested in the Var's type.
8100 */
8101 if (varno >= 1 && varno <= list_length(dpns->rtable))
8102 {
8103 rte = rt_fetch(varno, dpns->rtable);
8104 attnum = varattno;
8105 }
8106 else if (varno == OUTER_VAR && dpns->outer_tlist)
8107 {
8108 TargetEntry *tle;
8109 deparse_namespace save_dpns;
8110 const char *result;
8111
8112 tle = get_tle_by_resno(dpns->outer_tlist, varattno);
8113 if (!tle)
8114 elog(ERROR, "bogus varattno for OUTER_VAR var: %d", varattno);
8115
8116 Assert(netlevelsup == 0);
8117 push_child_plan(dpns, dpns->outer_plan, &save_dpns);
8118
8119 result = get_name_for_var_field((Var *) tle->expr, fieldno,
8120 levelsup, context);
8121
8122 pop_child_plan(dpns, &save_dpns);
8123 return result;
8124 }
8125 else if (varno == INNER_VAR && dpns->inner_tlist)
8126 {
8127 TargetEntry *tle;
8128 deparse_namespace save_dpns;
8129 const char *result;
8130
8131 tle = get_tle_by_resno(dpns->inner_tlist, varattno);
8132 if (!tle)
8133 elog(ERROR, "bogus varattno for INNER_VAR var: %d", varattno);
8134
8135 Assert(netlevelsup == 0);
8136 push_child_plan(dpns, dpns->inner_plan, &save_dpns);
8137
8138 result = get_name_for_var_field((Var *) tle->expr, fieldno,
8139 levelsup, context);
8140
8141 pop_child_plan(dpns, &save_dpns);
8142 return result;
8143 }
8144 else if (varno == INDEX_VAR && dpns->index_tlist)
8145 {
8146 TargetEntry *tle;
8147 const char *result;
8148
8149 tle = get_tle_by_resno(dpns->index_tlist, varattno);
8150 if (!tle)
8151 elog(ERROR, "bogus varattno for INDEX_VAR var: %d", varattno);
8152
8153 Assert(netlevelsup == 0);
8154
8155 result = get_name_for_var_field((Var *) tle->expr, fieldno,
8156 levelsup, context);
8157
8158 return result;
8159 }
8160 else
8161 {
8162 elog(ERROR, "bogus varno: %d", varno);
8163 return NULL; /* keep compiler quiet */
8164 }
8165
8166 if (attnum == InvalidAttrNumber)
8167 {
8168 /* Var is whole-row reference to RTE, so select the right field */
8169 return get_rte_attribute_name(rte, fieldno);
8170 }
8171
8172 /*
8173 * This part has essentially the same logic as the parser's
8174 * expandRecordVariable() function, but we are dealing with a different
8175 * representation of the input context, and we only need one field name
8176 * not a TupleDesc. Also, we need special cases for finding subquery and
8177 * CTE subplans when deparsing Plan trees.
8178 */
8179 expr = (Node *) var; /* default if we can't drill down */
8180
8181 switch (rte->rtekind)
8182 {
8183 case RTE_RELATION:
8184 case RTE_VALUES:
8185 case RTE_NAMEDTUPLESTORE:
8186 case RTE_RESULT:
8187
8188 /*
8189 * This case should not occur: a column of a table, values list,
8190 * or ENR shouldn't have type RECORD. Fall through and fail (most
8191 * likely) at the bottom.
8192 */
8193 break;
8194 case RTE_SUBQUERY:
8195 /* Subselect-in-FROM: examine sub-select's output expr */
8196 {
8197 if (rte->subquery)
8198 {
8199 TargetEntry *ste = get_tle_by_resno(rte->subquery->targetList,
8200 attnum);
8201
8202 if (ste == NULL || ste->resjunk)
8203 elog(ERROR, "subquery %s does not have attribute %d",
8204 rte->eref->aliasname, attnum);
8205 expr = (Node *) ste->expr;
8206 if (IsA(expr, Var))
8207 {
8208 /*
8209 * Recurse into the sub-select to see what its Var
8210 * refers to. We have to build an additional level of
8211 * namespace to keep in step with varlevelsup in the
8212 * subselect; furthermore, the subquery RTE might be
8213 * from an outer query level, in which case the
8214 * namespace for the subselect must have that outer
8215 * level as parent namespace.
8216 */
8217 List *save_nslist = context->namespaces;
8218 List *parent_namespaces;
8219 deparse_namespace mydpns;
8220 const char *result;
8221
8222 parent_namespaces = list_copy_tail(context->namespaces,
8223 netlevelsup);
8224
8225 set_deparse_for_query(&mydpns, rte->subquery,
8226 parent_namespaces);
8227
8228 context->namespaces = lcons(&mydpns, parent_namespaces);
8229
8230 result = get_name_for_var_field((Var *) expr, fieldno,
8231 0, context);
8232
8233 context->namespaces = save_nslist;
8234
8235 return result;
8236 }
8237 /* else fall through to inspect the expression */
8238 }
8239 else
8240 {
8241 /*
8242 * We're deparsing a Plan tree so we don't have complete
8243 * RTE entries (in particular, rte->subquery is NULL). But
8244 * the only place we'd normally see a Var directly
8245 * referencing a SUBQUERY RTE is in a SubqueryScan plan
8246 * node, and we can look into the child plan's tlist
8247 * instead. An exception occurs if the subquery was
8248 * proven empty and optimized away: then we'd find such a
8249 * Var in a childless Result node, and there's nothing in
8250 * the plan tree that would let us figure out what it had
8251 * originally referenced. In that case, fall back on
8252 * printing "fN", analogously to the default column names
8253 * for RowExprs.
8254 */
8255 TargetEntry *tle;
8256 deparse_namespace save_dpns;
8257 const char *result;
8258
8259 if (!dpns->inner_plan)
8260 {
8261 char *dummy_name = palloc(32);
8262
8263 Assert(dpns->plan && IsA(dpns->plan, Result));
8264 snprintf(dummy_name, 32, "f%d", fieldno);
8265 return dummy_name;
8266 }
8267 Assert(dpns->plan && IsA(dpns->plan, SubqueryScan));
8268
8269 tle = get_tle_by_resno(dpns->inner_tlist, attnum);
8270 if (!tle)
8271 elog(ERROR, "bogus varattno for subquery var: %d",
8272 attnum);
8273 Assert(netlevelsup == 0);
8274 push_child_plan(dpns, dpns->inner_plan, &save_dpns);
8275
8276 result = get_name_for_var_field((Var *) tle->expr, fieldno,
8277 levelsup, context);
8278
8279 pop_child_plan(dpns, &save_dpns);
8280 return result;
8281 }
8282 }
8283 break;
8284 case RTE_JOIN:
8285 /* Join RTE --- recursively inspect the alias variable */
8286 if (rte->joinaliasvars == NIL)
8287 elog(ERROR, "cannot decompile join alias var in plan tree");
8288 Assert(attnum > 0 && attnum <= list_length(rte->joinaliasvars));
8289 expr = (Node *) list_nth(rte->joinaliasvars, attnum - 1);
8290 Assert(expr != NULL);
8291 /* we intentionally don't strip implicit coercions here */
8292 if (IsA(expr, Var))
8293 return get_name_for_var_field((Var *) expr, fieldno,
8294 var->varlevelsup + levelsup,
8295 context);
8296 /* else fall through to inspect the expression */
8297 break;
8298 case RTE_FUNCTION:
8299 case RTE_TABLEFUNC:
8300
8301 /*
8302 * We couldn't get here unless a function is declared with one of
8303 * its result columns as RECORD, which is not allowed.
8304 */
8305 break;
8306 case RTE_CTE:
8307 /* CTE reference: examine subquery's output expr */
8308 {
8309 CommonTableExpr *cte = NULL;
8310 Index ctelevelsup;
8311 ListCell *lc;
8312
8313 /*
8314 * Try to find the referenced CTE using the namespace stack.
8315 */
8316 ctelevelsup = rte->ctelevelsup + netlevelsup;
8317 if (ctelevelsup >= list_length(context->namespaces))
8318 lc = NULL;
8319 else
8320 {
8321 deparse_namespace *ctedpns;
8322
8323 ctedpns = (deparse_namespace *)
8324 list_nth(context->namespaces, ctelevelsup);
8325 foreach(lc, ctedpns->ctes)
8326 {
8327 cte = (CommonTableExpr *) lfirst(lc);
8328 if (strcmp(cte->ctename, rte->ctename) == 0)
8329 break;
8330 }
8331 }
8332 if (lc != NULL)
8333 {
8334 Query *ctequery = (Query *) cte->ctequery;
8335 TargetEntry *ste = get_tle_by_resno(GetCTETargetList(cte),
8336 attnum);
8337
8338 if (ste == NULL || ste->resjunk)
8339 elog(ERROR, "CTE %s does not have attribute %d",
8340 rte->eref->aliasname, attnum);
8341 expr = (Node *) ste->expr;
8342 if (IsA(expr, Var))
8343 {
8344 /*
8345 * Recurse into the CTE to see what its Var refers to.
8346 * We have to build an additional level of namespace
8347 * to keep in step with varlevelsup in the CTE;
8348 * furthermore it could be an outer CTE (compare
8349 * SUBQUERY case above).
8350 */
8351 List *save_nslist = context->namespaces;
8352 List *parent_namespaces;
8353 deparse_namespace mydpns;
8354 const char *result;
8355
8356 parent_namespaces = list_copy_tail(context->namespaces,
8357 ctelevelsup);
8358
8359 set_deparse_for_query(&mydpns, ctequery,
8360 parent_namespaces);
8361
8362 context->namespaces = lcons(&mydpns, parent_namespaces);
8363
8364 result = get_name_for_var_field((Var *) expr, fieldno,
8365 0, context);
8366
8367 context->namespaces = save_nslist;
8368
8369 return result;
8370 }
8371 /* else fall through to inspect the expression */
8372 }
8373 else
8374 {
8375 /*
8376 * We're deparsing a Plan tree so we don't have a CTE
8377 * list. But the only places we'd normally see a Var
8378 * directly referencing a CTE RTE are in CteScan or
8379 * WorkTableScan plan nodes. For those cases,
8380 * set_deparse_plan arranged for dpns->inner_plan to be
8381 * the plan node that emits the CTE or RecursiveUnion
8382 * result, and we can look at its tlist instead. As
8383 * above, this can fail if the CTE has been proven empty,
8384 * in which case fall back to "fN".
8385 */
8386 TargetEntry *tle;
8387 deparse_namespace save_dpns;
8388 const char *result;
8389
8390 if (!dpns->inner_plan)
8391 {
8392 char *dummy_name = palloc(32);
8393
8394 Assert(dpns->plan && IsA(dpns->plan, Result));
8395 snprintf(dummy_name, 32, "f%d", fieldno);
8396 return dummy_name;
8397 }
8398 Assert(dpns->plan && (IsA(dpns->plan, CteScan) ||
8399 IsA(dpns->plan, WorkTableScan)));
8400
8401 tle = get_tle_by_resno(dpns->inner_tlist, attnum);
8402 if (!tle)
8403 elog(ERROR, "bogus varattno for subquery var: %d",
8404 attnum);
8405 Assert(netlevelsup == 0);
8406 push_child_plan(dpns, dpns->inner_plan, &save_dpns);
8407
8408 result = get_name_for_var_field((Var *) tle->expr, fieldno,
8409 levelsup, context);
8410
8411 pop_child_plan(dpns, &save_dpns);
8412 return result;
8413 }
8414 }
8415 break;
8416 case RTE_GROUP:
8417
8418 /*
8419 * We couldn't get here: any Vars that reference the RTE_GROUP RTE
8420 * should have been replaced with the underlying grouping
8421 * expressions.
8422 */
8423 break;
8424 }
8425
8426 /*
8427 * We now have an expression we can't expand any more, so see if
8428 * get_expr_result_tupdesc() can do anything with it.
8429 */
8430 tupleDesc = get_expr_result_tupdesc(expr, false);
8431 /* Got the tupdesc, so we can extract the field name */
8432 Assert(fieldno >= 1 && fieldno <= tupleDesc->natts);
8433 return NameStr(TupleDescAttr(tupleDesc, fieldno - 1)->attname);
8434}
8435
8436/*
8437 * Try to find the referenced expression for a PARAM_EXEC Param that might
8438 * reference a parameter supplied by an upper NestLoop or SubPlan plan node.
8439 *
8440 * If successful, return the expression and set *dpns_p and *ancestor_cell_p
8441 * appropriately for calling push_ancestor_plan(). If no referent can be
8442 * found, return NULL.
8443 */
8444static Node *
8445find_param_referent(Param *param, deparse_context *context,
8446 deparse_namespace **dpns_p, ListCell **ancestor_cell_p)
8447{
8448 /* Initialize output parameters to prevent compiler warnings */
8449 *dpns_p = NULL;
8450 *ancestor_cell_p = NULL;
8451
8452 /*
8453 * If it's a PARAM_EXEC parameter, look for a matching NestLoopParam or
8454 * SubPlan argument. This will necessarily be in some ancestor of the
8455 * current expression's Plan node.
8456 */
8457 if (param->paramkind == PARAM_EXEC)
8458 {
8459 deparse_namespace *dpns;
8460 Plan *child_plan;
8461 ListCell *lc;
8462
8463 dpns = (deparse_namespace *) linitial(context->namespaces);
8464 child_plan = dpns->plan;
8465
8466 foreach(lc, dpns->ancestors)
8467 {
8468 Node *ancestor = (Node *) lfirst(lc);
8469 ListCell *lc2;
8470
8471 /*
8472 * NestLoops transmit params to their inner child only.
8473 */
8474 if (IsA(ancestor, NestLoop) &&
8475 child_plan == innerPlan(ancestor))
8476 {
8477 NestLoop *nl = (NestLoop *) ancestor;
8478
8479 foreach(lc2, nl->nestParams)
8480 {
8481 NestLoopParam *nlp = (NestLoopParam *) lfirst(lc2);
8482
8483 if (nlp->paramno == param->paramid)
8484 {
8485 /* Found a match, so return it */
8486 *dpns_p = dpns;
8487 *ancestor_cell_p = lc;
8488 return (Node *) nlp->paramval;
8489 }
8490 }
8491 }
8492
8493 /*
8494 * If ancestor is a SubPlan, check the arguments it provides.
8495 */
8496 if (IsA(ancestor, SubPlan))
8497 {
8498 SubPlan *subplan = (SubPlan *) ancestor;
8499 ListCell *lc3;
8500 ListCell *lc4;
8501
8502 forboth(lc3, subplan->parParam, lc4, subplan->args)
8503 {
8504 int paramid = lfirst_int(lc3);
8505 Node *arg = (Node *) lfirst(lc4);
8506
8507 if (paramid == param->paramid)
8508 {
8509 /*
8510 * Found a match, so return it. But, since Vars in
8511 * the arg are to be evaluated in the surrounding
8512 * context, we have to point to the next ancestor item
8513 * that is *not* a SubPlan.
8514 */
8515 ListCell *rest;
8516
8517 for_each_cell(rest, dpns->ancestors,
8518 lnext(dpns->ancestors, lc))
8519 {
8520 Node *ancestor2 = (Node *) lfirst(rest);
8521
8522 if (!IsA(ancestor2, SubPlan))
8523 {
8524 *dpns_p = dpns;
8525 *ancestor_cell_p = rest;
8526 return arg;
8527 }
8528 }
8529 elog(ERROR, "SubPlan cannot be outermost ancestor");
8530 }
8531 }
8532
8533 /* SubPlan isn't a kind of Plan, so skip the rest */
8534 continue;
8535 }
8536
8537 /*
8538 * We need not consider the ancestor's initPlan list, since
8539 * initplans never have any parParams.
8540 */
8541
8542 /* No luck, crawl up to next ancestor */
8543 child_plan = (Plan *) ancestor;
8544 }
8545 }
8546
8547 /* No referent found */
8548 return NULL;
8549}
8550
8551/*
8552 * Try to find a subplan/initplan that emits the value for a PARAM_EXEC Param.
8553 *
8554 * If successful, return the generating subplan/initplan and set *column_p
8555 * to the subplan's 0-based output column number.
8556 * Otherwise, return NULL.
8557 */
8558static SubPlan *
8559find_param_generator(Param *param, deparse_context *context, int *column_p)
8560{
8561 /* Initialize output parameter to prevent compiler warnings */
8562 *column_p = 0;
8563
8564 /*
8565 * If it's a PARAM_EXEC parameter, search the current plan node as well as
8566 * ancestor nodes looking for a subplan or initplan that emits the value
8567 * for the Param. It could appear in the setParams of an initplan or
8568 * MULTIEXPR_SUBLINK subplan, or in the paramIds of an ancestral SubPlan.
8569 */
8570 if (param->paramkind == PARAM_EXEC)
8571 {
8572 SubPlan *result;
8573 deparse_namespace *dpns;
8574 ListCell *lc;
8575
8576 dpns = (deparse_namespace *) linitial(context->namespaces);
8577
8578 /* First check the innermost plan node's initplans */
8579 result = find_param_generator_initplan(param, dpns->plan, column_p);
8580 if (result)
8581 return result;
8582
8583 /*
8584 * The plan's targetlist might contain MULTIEXPR_SUBLINK SubPlans,
8585 * which can be referenced by Params elsewhere in the targetlist.
8586 * (Such Params should always be in the same targetlist, so there's no
8587 * need to do this work at upper plan nodes.)
8588 */
8589 foreach_node(TargetEntry, tle, dpns->plan->targetlist)
8590 {
8591 if (tle->expr && IsA(tle->expr, SubPlan))
8592 {
8593 SubPlan *subplan = (SubPlan *) tle->expr;
8594
8595 if (subplan->subLinkType == MULTIEXPR_SUBLINK)
8596 {
8597 foreach_int(paramid, subplan->setParam)
8598 {
8599 if (paramid == param->paramid)
8600 {
8601 /* Found a match, so return it. */
8602 *column_p = foreach_current_index(paramid);
8603 return subplan;
8604 }
8605 }
8606 }
8607 }
8608 }
8609
8610 /* No luck, so check the ancestor nodes */
8611 foreach(lc, dpns->ancestors)
8612 {
8613 Node *ancestor = (Node *) lfirst(lc);
8614
8615 /*
8616 * If ancestor is a SubPlan, check the paramIds it provides.
8617 */
8618 if (IsA(ancestor, SubPlan))
8619 {
8620 SubPlan *subplan = (SubPlan *) ancestor;
8621
8622 foreach_int(paramid, subplan->paramIds)
8623 {
8624 if (paramid == param->paramid)
8625 {
8626 /* Found a match, so return it. */
8627 *column_p = foreach_current_index(paramid);
8628 return subplan;
8629 }
8630 }
8631
8632 /* SubPlan isn't a kind of Plan, so skip the rest */
8633 continue;
8634 }
8635
8636 /*
8637 * Otherwise, it's some kind of Plan node, so check its initplans.
8638 */
8639 result = find_param_generator_initplan(param, (Plan *) ancestor,
8640 column_p);
8641 if (result)
8642 return result;
8643
8644 /* No luck, crawl up to next ancestor */
8645 }
8646 }
8647
8648 /* No generator found */
8649 return NULL;
8650}
8651
8652/*
8653 * Subroutine for find_param_generator: search one Plan node's initplans
8654 */
8655static SubPlan *
8656find_param_generator_initplan(Param *param, Plan *plan, int *column_p)
8657{
8658 foreach_node(SubPlan, subplan, plan->initPlan)
8659 {
8660 foreach_int(paramid, subplan->setParam)
8661 {
8662 if (paramid == param->paramid)
8663 {
8664 /* Found a match, so return it. */
8665 *column_p = foreach_current_index(paramid);
8666 return subplan;
8667 }
8668 }
8669 }
8670 return NULL;
8671}
8672
8673/*
8674 * Display a Param appropriately.
8675 */
8676static void
8677get_parameter(Param *param, deparse_context *context)
8678{
8679 Node *expr;
8680 deparse_namespace *dpns;
8681 ListCell *ancestor_cell;
8682 SubPlan *subplan;
8683 int column;
8684
8685 /*
8686 * If it's a PARAM_EXEC parameter, try to locate the expression from which
8687 * the parameter was computed. This stanza handles only cases in which
8688 * the Param represents an input to the subplan we are currently in.
8689 */
8690 expr = find_param_referent(param, context, &dpns, &ancestor_cell);
8691 if (expr)
8692 {
8693 /* Found a match, so print it */
8694 deparse_namespace save_dpns;
8695 bool save_varprefix;
8696 bool need_paren;
8697
8698 /* Switch attention to the ancestor plan node */
8699 push_ancestor_plan(dpns, ancestor_cell, &save_dpns);
8700
8701 /*
8702 * Force prefixing of Vars, since they won't belong to the relation
8703 * being scanned in the original plan node.
8704 */
8705 save_varprefix = context->varprefix;
8706 context->varprefix = true;
8707
8708 /*
8709 * A Param's expansion is typically a Var, Aggref, GroupingFunc, or
8710 * upper-level Param, which wouldn't need extra parentheses.
8711 * Otherwise, insert parens to ensure the expression looks atomic.
8712 */
8713 need_paren = !(IsA(expr, Var) ||
8714 IsA(expr, Aggref) ||
8715 IsA(expr, GroupingFunc) ||
8716 IsA(expr, Param));
8717 if (need_paren)
8718 appendStringInfoChar(context->buf, '(');
8719
8720 get_rule_expr(expr, context, false);
8721
8722 if (need_paren)
8723 appendStringInfoChar(context->buf, ')');
8724
8725 context->varprefix = save_varprefix;
8726
8727 pop_ancestor_plan(dpns, &save_dpns);
8728
8729 return;
8730 }
8731
8732 /*
8733 * Alternatively, maybe it's a subplan output, which we print as a
8734 * reference to the subplan. (We could drill down into the subplan and
8735 * print the relevant targetlist expression, but that has been deemed too
8736 * confusing since it would violate normal SQL scope rules. Also, we're
8737 * relying on this reference to show that the testexpr containing the
8738 * Param has anything to do with that subplan at all.)
8739 */
8740 subplan = find_param_generator(param, context, &column);
8741 if (subplan)
8742 {
8743 appendStringInfo(context->buf, "(%s%s).col%d",
8744 subplan->useHashTable ? "hashed " : "",
8745 subplan->plan_name, column + 1);
8746
8747 return;
8748 }
8749
8750 /*
8751 * If it's an external parameter, see if the outermost namespace provides
8752 * function argument names.
8753 */
8754 if (param->paramkind == PARAM_EXTERN && context->namespaces != NIL)
8755 {
8756 dpns = llast(context->namespaces);
8757 if (dpns->argnames &&
8758 param->paramid > 0 &&
8759 param->paramid <= dpns->numargs)
8760 {
8761 char *argname = dpns->argnames[param->paramid - 1];
8762
8763 if (argname)
8764 {
8765 bool should_qualify = false;
8766 ListCell *lc;
8767
8768 /*
8769 * Qualify the parameter name if there are any other deparse
8770 * namespaces with range tables. This avoids qualifying in
8771 * trivial cases like "RETURN a + b", but makes it safe in all
8772 * other cases.
8773 */
8774 foreach(lc, context->namespaces)
8775 {
8776 deparse_namespace *depns = lfirst(lc);
8777
8778 if (depns->rtable_names != NIL)
8779 {
8780 should_qualify = true;
8781 break;
8782 }
8783 }
8784 if (should_qualify)
8785 {
8786 appendStringInfoString(context->buf, quote_identifier(dpns->funcname));
8787 appendStringInfoChar(context->buf, '.');
8788 }
8789
8790 appendStringInfoString(context->buf, quote_identifier(argname));
8791 return;
8792 }
8793 }
8794 }
8795
8796 /*
8797 * Not PARAM_EXEC, or couldn't find referent: just print $N.
8798 *
8799 * It's a bug if we get here for anything except PARAM_EXTERN Params, but
8800 * in production builds printing $N seems more useful than failing.
8801 */
8802 Assert(param->paramkind == PARAM_EXTERN);
8803
8804 appendStringInfo(context->buf, "$%d", param->paramid);
8805}
8806
8807/*
8808 * get_simple_binary_op_name
8809 *
8810 * helper function for isSimpleNode
8811 * will return single char binary operator name, or NULL if it's not
8812 */
8813static const char *
8814get_simple_binary_op_name(OpExpr *expr)
8815{
8816 List *args = expr->args;
8817
8818 if (list_length(args) == 2)
8819 {
8820 /* binary operator */
8821 Node *arg1 = (Node *) linitial(args);
8822 Node *arg2 = (Node *) lsecond(args);
8823 const char *op;
8824
8825 op = generate_operator_name(expr->opno, exprType(arg1), exprType(arg2));
8826 if (strlen(op) == 1)
8827 return op;
8828 }
8829 return NULL;
8830}
8831
8832
8833/*
8834 * isSimpleNode - check if given node is simple (doesn't need parenthesizing)
8835 *
8836 * true : simple in the context of parent node's type
8837 * false : not simple
8838 */
8839static bool
8840isSimpleNode(Node *node, Node *parentNode, int prettyFlags)
8841{
8842 if (!node)
8843 return false;
8844
8845 switch (nodeTag(node))
8846 {
8847 case T_Var:
8848 case T_Const:
8849 case T_Param:
8850 case T_CoerceToDomainValue:
8851 case T_SetToDefault:
8852 case T_CurrentOfExpr:
8853 /* single words: always simple */
8854 return true;
8855
8856 case T_SubscriptingRef:
8857 case T_ArrayExpr:
8858 case T_RowExpr:
8859 case T_CoalesceExpr:
8860 case T_MinMaxExpr:
8861 case T_SQLValueFunction:
8862 case T_XmlExpr:
8863 case T_NextValueExpr:
8864 case T_NullIfExpr:
8865 case T_Aggref:
8866 case T_GroupingFunc:
8867 case T_WindowFunc:
8868 case T_MergeSupportFunc:
8869 case T_FuncExpr:
8870 case T_JsonConstructorExpr:
8871 case T_JsonExpr:
8872 /* function-like: name(..) or name[..] */
8873 return true;
8874
8875 /* CASE keywords act as parentheses */
8876 case T_CaseExpr:
8877 return true;
8878
8879 case T_FieldSelect:
8880
8881 /*
8882 * appears simple since . has top precedence, unless parent is
8883 * T_FieldSelect itself!
8884 */
8885 return !IsA(parentNode, FieldSelect);
8886
8887 case T_FieldStore:
8888
8889 /*
8890 * treat like FieldSelect (probably doesn't matter)
8891 */
8892 return !IsA(parentNode, FieldStore);
8893
8894 case T_CoerceToDomain:
8895 /* maybe simple, check args */
8896 return isSimpleNode((Node *) ((CoerceToDomain *) node)->arg,
8897 node, prettyFlags);
8898 case T_RelabelType:
8899 return isSimpleNode((Node *) ((RelabelType *) node)->arg,
8900 node, prettyFlags);
8901 case T_CoerceViaIO:
8902 return isSimpleNode((Node *) ((CoerceViaIO *) node)->arg,
8903 node, prettyFlags);
8904 case T_ArrayCoerceExpr:
8905 return isSimpleNode((Node *) ((ArrayCoerceExpr *) node)->arg,
8906 node, prettyFlags);
8907 case T_ConvertRowtypeExpr:
8908 return isSimpleNode((Node *) ((ConvertRowtypeExpr *) node)->arg,
8909 node, prettyFlags);
8910 case T_ReturningExpr:
8911 return isSimpleNode((Node *) ((ReturningExpr *) node)->retexpr,
8912 node, prettyFlags);
8913
8914 case T_OpExpr:
8915 {
8916 /* depends on parent node type; needs further checking */
8917 if (prettyFlags & PRETTYFLAG_PAREN && IsA(parentNode, OpExpr))
8918 {
8919 const char *op;
8920 const char *parentOp;
8921 bool is_lopriop;
8922 bool is_hipriop;
8923 bool is_lopriparent;
8924 bool is_hipriparent;
8925
8926 op = get_simple_binary_op_name((OpExpr *) node);
8927 if (!op)
8928 return false;
8929
8930 /* We know only the basic operators + - and * / % */
8931 is_lopriop = (strchr("+-", *op) != NULL);
8932 is_hipriop = (strchr("*/%", *op) != NULL);
8933 if (!(is_lopriop || is_hipriop))
8934 return false;
8935
8936 parentOp = get_simple_binary_op_name((OpExpr *) parentNode);
8937 if (!parentOp)
8938 return false;
8939
8940 is_lopriparent = (strchr("+-", *parentOp) != NULL);
8941 is_hipriparent = (strchr("*/%", *parentOp) != NULL);
8942 if (!(is_lopriparent || is_hipriparent))
8943 return false;
8944
8945 if (is_hipriop && is_lopriparent)
8946 return true; /* op binds tighter than parent */
8947
8948 if (is_lopriop && is_hipriparent)
8949 return false;
8950
8951 /*
8952 * Operators are same priority --- can skip parens only if
8953 * we have (a - b) - c, not a - (b - c).
8954 */
8955 if (node == (Node *) linitial(((OpExpr *) parentNode)->args))
8956 return true;
8957
8958 return false;
8959 }
8960 /* else do the same stuff as for T_SubLink et al. */
8961 }
8962 /* FALLTHROUGH */
8963
8964 case T_SubLink:
8965 case T_NullTest:
8966 case T_BooleanTest:
8967 case T_DistinctExpr:
8968 case T_JsonIsPredicate:
8969 switch (nodeTag(parentNode))
8970 {
8971 case T_FuncExpr:
8972 {
8973 /* special handling for casts and COERCE_SQL_SYNTAX */
8974 CoercionForm type = ((FuncExpr *) parentNode)->funcformat;
8975
8976 if (type == COERCE_EXPLICIT_CAST ||
8977 type == COERCE_IMPLICIT_CAST ||
8978 type == COERCE_SQL_SYNTAX)
8979 return false;
8980 return true; /* own parentheses */
8981 }
8982 case T_BoolExpr: /* lower precedence */
8983 case T_SubscriptingRef: /* other separators */
8984 case T_ArrayExpr: /* other separators */
8985 case T_RowExpr: /* other separators */
8986 case T_CoalesceExpr: /* own parentheses */
8987 case T_MinMaxExpr: /* own parentheses */
8988 case T_XmlExpr: /* own parentheses */
8989 case T_NullIfExpr: /* other separators */
8990 case T_Aggref: /* own parentheses */
8991 case T_GroupingFunc: /* own parentheses */
8992 case T_WindowFunc: /* own parentheses */
8993 case T_CaseExpr: /* other separators */
8994 return true;
8995 default:
8996 return false;
8997 }
8998
8999 case T_BoolExpr:
9000 switch (nodeTag(parentNode))
9001 {
9002 case T_BoolExpr:
9003 if (prettyFlags & PRETTYFLAG_PAREN)
9004 {
9005 BoolExprType type;
9006 BoolExprType parentType;
9007
9008 type = ((BoolExpr *) node)->boolop;
9009 parentType = ((BoolExpr *) parentNode)->boolop;
9010 switch (type)
9011 {
9012 case NOT_EXPR:
9013 case AND_EXPR:
9014 if (parentType == AND_EXPR || parentType == OR_EXPR)
9015 return true;
9016 break;
9017 case OR_EXPR:
9018 if (parentType == OR_EXPR)
9019 return true;
9020 break;
9021 }
9022 }
9023 return false;
9024 case T_FuncExpr:
9025 {
9026 /* special handling for casts and COERCE_SQL_SYNTAX */
9027 CoercionForm type = ((FuncExpr *) parentNode)->funcformat;
9028
9029 if (type == COERCE_EXPLICIT_CAST ||
9030 type == COERCE_IMPLICIT_CAST ||
9031 type == COERCE_SQL_SYNTAX)
9032 return false;
9033 return true; /* own parentheses */
9034 }
9035 case T_SubscriptingRef: /* other separators */
9036 case T_ArrayExpr: /* other separators */
9037 case T_RowExpr: /* other separators */
9038 case T_CoalesceExpr: /* own parentheses */
9039 case T_MinMaxExpr: /* own parentheses */
9040 case T_XmlExpr: /* own parentheses */
9041 case T_NullIfExpr: /* other separators */
9042 case T_Aggref: /* own parentheses */
9043 case T_GroupingFunc: /* own parentheses */
9044 case T_WindowFunc: /* own parentheses */
9045 case T_CaseExpr: /* other separators */
9046 case T_JsonExpr: /* own parentheses */
9047 return true;
9048 default:
9049 return false;
9050 }
9051
9052 case T_JsonValueExpr:
9053 /* maybe simple, check args */
9054 return isSimpleNode((Node *) ((JsonValueExpr *) node)->raw_expr,
9055 node, prettyFlags);
9056
9057 default:
9058 break;
9059 }
9060 /* those we don't know: in dubio complexo */
9061 return false;
9062}
9063
9064
9065/*
9066 * appendContextKeyword - append a keyword to buffer
9067 *
9068 * If prettyPrint is enabled, perform a line break, and adjust indentation.
9069 * Otherwise, just append the keyword.
9070 */
9071static void
9072appendContextKeyword(deparse_context *context, const char *str,
9073 int indentBefore, int indentAfter, int indentPlus)
9074{
9075 StringInfo buf = context->buf;
9076
9077 if (PRETTY_INDENT(context))
9078 {
9079 int indentAmount;
9080
9081 context->indentLevel += indentBefore;
9082
9083 /* remove any trailing spaces currently in the buffer ... */
9084 removeStringInfoSpaces(buf);
9085 /* ... then add a newline and some spaces */
9086 appendStringInfoChar(buf, '\n');
9087
9088 if (context->indentLevel < PRETTYINDENT_LIMIT)
9089 indentAmount = Max(context->indentLevel, 0) + indentPlus;
9090 else
9091 {
9092 /*
9093 * If we're indented more than PRETTYINDENT_LIMIT characters, try
9094 * to conserve horizontal space by reducing the per-level
9095 * indentation. For best results the scale factor here should
9096 * divide all the indent amounts that get added to indentLevel
9097 * (PRETTYINDENT_STD, etc). It's important that the indentation
9098 * not grow unboundedly, else deeply-nested trees use O(N^2)
9099 * whitespace; so we also wrap modulo PRETTYINDENT_LIMIT.
9100 */
9101 indentAmount = PRETTYINDENT_LIMIT +
9102 (context->indentLevel - PRETTYINDENT_LIMIT) /
9103 (PRETTYINDENT_STD / 2);
9104 indentAmount %= PRETTYINDENT_LIMIT;
9105 /* scale/wrap logic affects indentLevel, but not indentPlus */
9106 indentAmount += indentPlus;
9107 }
9108 appendStringInfoSpaces(buf, indentAmount);
9109
9110 appendStringInfoString(buf, str);
9111
9112 context->indentLevel += indentAfter;
9113 if (context->indentLevel < 0)
9114 context->indentLevel = 0;
9115 }
9116 else
9117 appendStringInfoString(buf, str);
9118}
9119
9120/*
9121 * removeStringInfoSpaces - delete trailing spaces from a buffer.
9122 *
9123 * Possibly this should move to stringinfo.c at some point.
9124 */
9125static void
9126removeStringInfoSpaces(StringInfo str)
9127{
9128 while (str->len > 0 && str->data[str->len - 1] == ' ')
9129 str->data[--(str->len)] = '\0';
9130}
9131
9132
9133/*
9134 * get_rule_expr_paren - deparse expr using get_rule_expr,
9135 * embracing the string with parentheses if necessary for prettyPrint.
9136 *
9137 * Never embrace if prettyFlags=0, because it's done in the calling node.
9138 *
9139 * Any node that does *not* embrace its argument node by sql syntax (with
9140 * parentheses, non-operator keywords like CASE/WHEN/ON, or comma etc) should
9141 * use get_rule_expr_paren instead of get_rule_expr so parentheses can be
9142 * added.
9143 */
9144static void
9145get_rule_expr_paren(Node *node, deparse_context *context,
9146 bool showimplicit, Node *parentNode)
9147{
9148 bool need_paren;
9149
9150 need_paren = PRETTY_PAREN(context) &&
9151 !isSimpleNode(node, parentNode, context->prettyFlags);
9152
9153 if (need_paren)
9154 appendStringInfoChar(context->buf, '(');
9155
9156 get_rule_expr(node, context, showimplicit);
9157
9158 if (need_paren)
9159 appendStringInfoChar(context->buf, ')');
9160}
9161
9162static void
9163get_json_behavior(JsonBehavior *behavior, deparse_context *context,
9164 const char *on)
9165{
9166 /*
9167 * The order of array elements must correspond to the order of
9168 * JsonBehaviorType members.
9169 */
9170 const char *behavior_names[] =
9171 {
9172 " NULL",
9173 " ERROR",
9174 " EMPTY",
9175 " TRUE",
9176 " FALSE",
9177 " UNKNOWN",
9178 " EMPTY ARRAY",
9179 " EMPTY OBJECT",
9180 " DEFAULT "
9181 };
9182
9183 if ((int) behavior->btype < 0 || behavior->btype >= lengthof(behavior_names))
9184 elog(ERROR, "invalid json behavior type: %d", behavior->btype);
9185
9186 appendStringInfoString(context->buf, behavior_names[behavior->btype]);
9187
9188 if (behavior->btype == JSON_BEHAVIOR_DEFAULT)
9189 get_rule_expr(behavior->expr, context, false);
9190
9191 appendStringInfo(context->buf, " ON %s", on);
9192}
9193
9194/*
9195 * get_json_expr_options
9196 *
9197 * Parse back common options for JSON_QUERY, JSON_VALUE, JSON_EXISTS and
9198 * JSON_TABLE columns.
9199 */
9200static void
9201get_json_expr_options(JsonExpr *jsexpr, deparse_context *context,
9202 JsonBehaviorType default_behavior)
9203{
9204 if (jsexpr->op == JSON_QUERY_OP)
9205 {
9206 if (jsexpr->wrapper == JSW_CONDITIONAL)
9207 appendStringInfoString(context->buf, " WITH CONDITIONAL WRAPPER");
9208 else if (jsexpr->wrapper == JSW_UNCONDITIONAL)
9209 appendStringInfoString(context->buf, " WITH UNCONDITIONAL WRAPPER");
9210 /* The default */
9211 else if (jsexpr->wrapper == JSW_NONE || jsexpr->wrapper == JSW_UNSPEC)
9212 appendStringInfoString(context->buf, " WITHOUT WRAPPER");
9213
9214 if (jsexpr->omit_quotes)
9215 appendStringInfoString(context->buf, " OMIT QUOTES");
9216 /* The default */
9217 else
9218 appendStringInfoString(context->buf, " KEEP QUOTES");
9219 }
9220
9221 if (jsexpr->on_empty && jsexpr->on_empty->btype != default_behavior)
9222 get_json_behavior(jsexpr->on_empty, context, "EMPTY");
9223
9224 if (jsexpr->on_error && jsexpr->on_error->btype != default_behavior)
9225 get_json_behavior(jsexpr->on_error, context, "ERROR");
9226}
9227
9228/* ----------
9229 * get_rule_expr - Parse back an expression
9230 *
9231 * Note: showimplicit determines whether we display any implicit cast that
9232 * is present at the top of the expression tree. It is a passed argument,
9233 * not a field of the context struct, because we change the value as we
9234 * recurse down into the expression. In general we suppress implicit casts
9235 * when the result type is known with certainty (eg, the arguments of an
9236 * OR must be boolean). We display implicit casts for arguments of functions
9237 * and operators, since this is needed to be certain that the same function
9238 * or operator will be chosen when the expression is re-parsed.
9239 * ----------
9240 */
9241static void
9242get_rule_expr(Node *node, deparse_context *context,
9243 bool showimplicit)
9244{
9245 StringInfo buf = context->buf;
9246
9247 if (node == NULL)
9248 return;
9249
9250 /* Guard against excessively long or deeply-nested queries */
9251 CHECK_FOR_INTERRUPTS();
9252 check_stack_depth();
9253
9254 /*
9255 * Each level of get_rule_expr must emit an indivisible term
9256 * (parenthesized if necessary) to ensure result is reparsed into the same
9257 * expression tree. The only exception is that when the input is a List,
9258 * we emit the component items comma-separated with no surrounding
9259 * decoration; this is convenient for most callers.
9260 */
9261 switch (nodeTag(node))
9262 {
9263 case T_Var:
9264 (void) get_variable((Var *) node, 0, false, context);
9265 break;
9266
9267 case T_Const:
9268 get_const_expr((Const *) node, context, 0);
9269 break;
9270
9271 case T_Param:
9272 get_parameter((Param *) node, context);
9273 break;
9274
9275 case T_Aggref:
9276 get_agg_expr((Aggref *) node, context, (Aggref *) node);
9277 break;
9278
9279 case T_GroupingFunc:
9280 {
9281 GroupingFunc *gexpr = (GroupingFunc *) node;
9282
9283 appendStringInfoString(buf, "GROUPING(");
9284 get_rule_expr((Node *) gexpr->args, context, true);
9285 appendStringInfoChar(buf, ')');
9286 }
9287 break;
9288
9289 case T_WindowFunc:
9290 get_windowfunc_expr((WindowFunc *) node, context);
9291 break;
9292
9293 case T_MergeSupportFunc:
9294 appendStringInfoString(buf, "MERGE_ACTION()");
9295 break;
9296
9297 case T_SubscriptingRef:
9298 {
9299 SubscriptingRef *sbsref = (SubscriptingRef *) node;
9300 bool need_parens;
9301
9302 /*
9303 * If the argument is a CaseTestExpr, we must be inside a
9304 * FieldStore, ie, we are assigning to an element of an array
9305 * within a composite column. Since we already punted on
9306 * displaying the FieldStore's target information, just punt
9307 * here too, and display only the assignment source
9308 * expression.
9309 */
9310 if (IsA(sbsref->refexpr, CaseTestExpr))
9311 {
9312 Assert(sbsref->refassgnexpr);
9313 get_rule_expr((Node *) sbsref->refassgnexpr,
9314 context, showimplicit);
9315 break;
9316 }
9317
9318 /*
9319 * Parenthesize the argument unless it's a simple Var or a
9320 * FieldSelect. (In particular, if it's another
9321 * SubscriptingRef, we *must* parenthesize to avoid
9322 * confusion.)
9323 */
9324 need_parens = !IsA(sbsref->refexpr, Var) &&
9325 !IsA(sbsref->refexpr, FieldSelect);
9326 if (need_parens)
9327 appendStringInfoChar(buf, '(');
9328 get_rule_expr((Node *) sbsref->refexpr, context, showimplicit);
9329 if (need_parens)
9330 appendStringInfoChar(buf, ')');
9331
9332 /*
9333 * If there's a refassgnexpr, we want to print the node in the
9334 * format "container[subscripts] := refassgnexpr". This is
9335 * not legal SQL, so decompilation of INSERT or UPDATE
9336 * statements should always use processIndirection as part of
9337 * the statement-level syntax. We should only see this when
9338 * EXPLAIN tries to print the targetlist of a plan resulting
9339 * from such a statement.
9340 */
9341 if (sbsref->refassgnexpr)
9342 {
9343 Node *refassgnexpr;
9344
9345 /*
9346 * Use processIndirection to print this node's subscripts
9347 * as well as any additional field selections or
9348 * subscripting in immediate descendants. It returns the
9349 * RHS expr that is actually being "assigned".
9350 */
9351 refassgnexpr = processIndirection(node, context);
9352 appendStringInfoString(buf, " := ");
9353 get_rule_expr(refassgnexpr, context, showimplicit);
9354 }
9355 else
9356 {
9357 /* Just an ordinary container fetch, so print subscripts */
9358 printSubscripts(sbsref, context);
9359 }
9360 }
9361 break;
9362
9363 case T_FuncExpr:
9364 get_func_expr((FuncExpr *) node, context, showimplicit);
9365 break;
9366
9367 case T_NamedArgExpr:
9368 {
9369 NamedArgExpr *na = (NamedArgExpr *) node;
9370
9371 appendStringInfo(buf, "%s => ", quote_identifier(na->name));
9372 get_rule_expr((Node *) na->arg, context, showimplicit);
9373 }
9374 break;
9375
9376 case T_OpExpr:
9377 get_oper_expr((OpExpr *) node, context);
9378 break;
9379
9380 case T_DistinctExpr:
9381 {
9382 DistinctExpr *expr = (DistinctExpr *) node;
9383 List *args = expr->args;
9384 Node *arg1 = (Node *) linitial(args);
9385 Node *arg2 = (Node *) lsecond(args);
9386
9387 if (!PRETTY_PAREN(context))
9388 appendStringInfoChar(buf, '(');
9389 get_rule_expr_paren(arg1, context, true, node);
9390 appendStringInfoString(buf, " IS DISTINCT FROM ");
9391 get_rule_expr_paren(arg2, context, true, node);
9392 if (!PRETTY_PAREN(context))
9393 appendStringInfoChar(buf, ')');
9394 }
9395 break;
9396
9397 case T_NullIfExpr:
9398 {
9399 NullIfExpr *nullifexpr = (NullIfExpr *) node;
9400
9401 appendStringInfoString(buf, "NULLIF(");
9402 get_rule_expr((Node *) nullifexpr->args, context, true);
9403 appendStringInfoChar(buf, ')');
9404 }
9405 break;
9406
9407 case T_ScalarArrayOpExpr:
9408 {
9409 ScalarArrayOpExpr *expr = (ScalarArrayOpExpr *) node;
9410 List *args = expr->args;
9411 Node *arg1 = (Node *) linitial(args);
9412 Node *arg2 = (Node *) lsecond(args);
9413
9414 if (!PRETTY_PAREN(context))
9415 appendStringInfoChar(buf, '(');
9416 get_rule_expr_paren(arg1, context, true, node);
9417 appendStringInfo(buf, " %s %s (",
9418 generate_operator_name(expr->opno,
9419 exprType(arg1),
9420 get_base_element_type(exprType(arg2))),
9421 expr->useOr ? "ANY" : "ALL");
9422 get_rule_expr_paren(arg2, context, true, node);
9423
9424 /*
9425 * There's inherent ambiguity in "x op ANY/ALL (y)" when y is
9426 * a bare sub-SELECT. Since we're here, the sub-SELECT must
9427 * be meant as a scalar sub-SELECT yielding an array value to
9428 * be used in ScalarArrayOpExpr; but the grammar will
9429 * preferentially interpret such a construct as an ANY/ALL
9430 * SubLink. To prevent misparsing the output that way, insert
9431 * a dummy coercion (which will be stripped by parse analysis,
9432 * so no inefficiency is added in dump and reload). This is
9433 * indeed most likely what the user wrote to get the construct
9434 * accepted in the first place.
9435 */
9436 if (IsA(arg2, SubLink) &&
9437 ((SubLink *) arg2)->subLinkType == EXPR_SUBLINK)
9438 appendStringInfo(buf, "::%s",
9439 format_type_with_typemod(exprType(arg2),
9440 exprTypmod(arg2)));
9441 appendStringInfoChar(buf, ')');
9442 if (!PRETTY_PAREN(context))
9443 appendStringInfoChar(buf, ')');
9444 }
9445 break;
9446
9447 case T_BoolExpr:
9448 {
9449 BoolExpr *expr = (BoolExpr *) node;
9450 Node *first_arg = linitial(expr->args);
9451 ListCell *arg;
9452
9453 switch (expr->boolop)
9454 {
9455 case AND_EXPR:
9456 if (!PRETTY_PAREN(context))
9457 appendStringInfoChar(buf, '(');
9458 get_rule_expr_paren(first_arg, context,
9459 false, node);
9460 for_each_from(arg, expr->args, 1)
9461 {
9462 appendStringInfoString(buf, " AND ");
9463 get_rule_expr_paren((Node *) lfirst(arg), context,
9464 false, node);
9465 }
9466 if (!PRETTY_PAREN(context))
9467 appendStringInfoChar(buf, ')');
9468 break;
9469
9470 case OR_EXPR:
9471 if (!PRETTY_PAREN(context))
9472 appendStringInfoChar(buf, '(');
9473 get_rule_expr_paren(first_arg, context,
9474 false, node);
9475 for_each_from(arg, expr->args, 1)
9476 {
9477 appendStringInfoString(buf, " OR ");
9478 get_rule_expr_paren((Node *) lfirst(arg), context,
9479 false, node);
9480 }
9481 if (!PRETTY_PAREN(context))
9482 appendStringInfoChar(buf, ')');
9483 break;
9484
9485 case NOT_EXPR:
9486 if (!PRETTY_PAREN(context))
9487 appendStringInfoChar(buf, '(');
9488 appendStringInfoString(buf, "NOT ");
9489 get_rule_expr_paren(first_arg, context,
9490 false, node);
9491 if (!PRETTY_PAREN(context))
9492 appendStringInfoChar(buf, ')');
9493 break;
9494
9495 default:
9496 elog(ERROR, "unrecognized boolop: %d",
9497 (int) expr->boolop);
9498 }
9499 }
9500 break;
9501
9502 case T_SubLink:
9503 get_sublink_expr((SubLink *) node, context);
9504 break;
9505
9506 case T_SubPlan:
9507 {
9508 SubPlan *subplan = (SubPlan *) node;
9509
9510 /*
9511 * We cannot see an already-planned subplan in rule deparsing,
9512 * only while EXPLAINing a query plan. We don't try to
9513 * reconstruct the original SQL, just reference the subplan
9514 * that appears elsewhere in EXPLAIN's result. It does seem
9515 * useful to show the subLinkType and testexpr (if any), and
9516 * we also note whether the subplan will be hashed.
9517 */
9518 switch (subplan->subLinkType)
9519 {
9520 case EXISTS_SUBLINK:
9521 appendStringInfoString(buf, "EXISTS(");
9522 Assert(subplan->testexpr == NULL);
9523 break;
9524 case ALL_SUBLINK:
9525 appendStringInfoString(buf, "(ALL ");
9526 Assert(subplan->testexpr != NULL);
9527 break;
9528 case ANY_SUBLINK:
9529 appendStringInfoString(buf, "(ANY ");
9530 Assert(subplan->testexpr != NULL);
9531 break;
9532 case ROWCOMPARE_SUBLINK:
9533 /* Parenthesizing the testexpr seems sufficient */
9534 appendStringInfoChar(buf, '(');
9535 Assert(subplan->testexpr != NULL);
9536 break;
9537 case EXPR_SUBLINK:
9538 /* No need to decorate these subplan references */
9539 appendStringInfoChar(buf, '(');
9540 Assert(subplan->testexpr == NULL);
9541 break;
9542 case MULTIEXPR_SUBLINK:
9543 /* MULTIEXPR isn't executed in the normal way */
9544 appendStringInfoString(buf, "(rescan ");
9545 Assert(subplan->testexpr == NULL);
9546 break;
9547 case ARRAY_SUBLINK:
9548 appendStringInfoString(buf, "ARRAY(");
9549 Assert(subplan->testexpr == NULL);
9550 break;
9551 case CTE_SUBLINK:
9552 /* This case is unreachable within expressions */
9553 appendStringInfoString(buf, "CTE(");
9554 Assert(subplan->testexpr == NULL);
9555 break;
9556 }
9557
9558 if (subplan->testexpr != NULL)
9559 {
9560 deparse_namespace *dpns;
9561
9562 /*
9563 * Push SubPlan into ancestors list while deparsing
9564 * testexpr, so that we can handle PARAM_EXEC references
9565 * to the SubPlan's paramIds. (This makes it look like
9566 * the SubPlan is an "ancestor" of the current plan node,
9567 * which is a little weird, but it does no harm.) In this
9568 * path, we don't need to mention the SubPlan explicitly,
9569 * because the referencing Params will show its existence.
9570 */
9571 dpns = (deparse_namespace *) linitial(context->namespaces);
9572 dpns->ancestors = lcons(subplan, dpns->ancestors);
9573
9574 get_rule_expr(subplan->testexpr, context, showimplicit);
9575 appendStringInfoChar(buf, ')');
9576
9577 dpns->ancestors = list_delete_first(dpns->ancestors);
9578 }
9579 else
9580 {
9581 /* No referencing Params, so show the SubPlan's name */
9582 if (subplan->useHashTable)
9583 appendStringInfo(buf, "hashed %s)", subplan->plan_name);
9584 else
9585 appendStringInfo(buf, "%s)", subplan->plan_name);
9586 }
9587 }
9588 break;
9589
9590 case T_AlternativeSubPlan:
9591 {
9592 AlternativeSubPlan *asplan = (AlternativeSubPlan *) node;
9593 ListCell *lc;
9594
9595 /*
9596 * This case cannot be reached in normal usage, since no
9597 * AlternativeSubPlan can appear either in parsetrees or
9598 * finished plan trees. We keep it just in case somebody
9599 * wants to use this code to print planner data structures.
9600 */
9601 appendStringInfoString(buf, "(alternatives: ");
9602 foreach(lc, asplan->subplans)
9603 {
9604 SubPlan *splan = lfirst_node(SubPlan, lc);
9605
9606 if (splan->useHashTable)
9607 appendStringInfo(buf, "hashed %s", splan->plan_name);
9608 else
9609 appendStringInfoString(buf, splan->plan_name);
9610 if (lnext(asplan->subplans, lc))
9611 appendStringInfoString(buf, " or ");
9612 }
9613 appendStringInfoChar(buf, ')');
9614 }
9615 break;
9616
9617 case T_FieldSelect:
9618 {
9619 FieldSelect *fselect = (FieldSelect *) node;
9620 Node *arg = (Node *) fselect->arg;
9621 int fno = fselect->fieldnum;
9622 const char *fieldname;
9623 bool need_parens;
9624
9625 /*
9626 * Parenthesize the argument unless it's an SubscriptingRef or
9627 * another FieldSelect. Note in particular that it would be
9628 * WRONG to not parenthesize a Var argument; simplicity is not
9629 * the issue here, having the right number of names is.
9630 */
9631 need_parens = !IsA(arg, SubscriptingRef) &&
9632 !IsA(arg, FieldSelect);
9633 if (need_parens)
9634 appendStringInfoChar(buf, '(');
9635 get_rule_expr(arg, context, true);
9636 if (need_parens)
9637 appendStringInfoChar(buf, ')');
9638
9639 /*
9640 * Get and print the field name.
9641 */
9642 fieldname = get_name_for_var_field((Var *) arg, fno,
9643 0, context);
9644 appendStringInfo(buf, ".%s", quote_identifier(fieldname));
9645 }
9646 break;
9647
9648 case T_FieldStore:
9649 {
9650 FieldStore *fstore = (FieldStore *) node;
9651 bool need_parens;
9652
9653 /*
9654 * There is no good way to represent a FieldStore as real SQL,
9655 * so decompilation of INSERT or UPDATE statements should
9656 * always use processIndirection as part of the
9657 * statement-level syntax. We should only get here when
9658 * EXPLAIN tries to print the targetlist of a plan resulting
9659 * from such a statement. The plan case is even harder than
9660 * ordinary rules would be, because the planner tries to
9661 * collapse multiple assignments to the same field or subfield
9662 * into one FieldStore; so we can see a list of target fields
9663 * not just one, and the arguments could be FieldStores
9664 * themselves. We don't bother to try to print the target
9665 * field names; we just print the source arguments, with a
9666 * ROW() around them if there's more than one. This isn't
9667 * terribly complete, but it's probably good enough for
9668 * EXPLAIN's purposes; especially since anything more would be
9669 * either hopelessly confusing or an even poorer
9670 * representation of what the plan is actually doing.
9671 */
9672 need_parens = (list_length(fstore->newvals) != 1);
9673 if (need_parens)
9674 appendStringInfoString(buf, "ROW(");
9675 get_rule_expr((Node *) fstore->newvals, context, showimplicit);
9676 if (need_parens)
9677 appendStringInfoChar(buf, ')');
9678 }
9679 break;
9680
9681 case T_RelabelType:
9682 {
9683 RelabelType *relabel = (RelabelType *) node;
9684 Node *arg = (Node *) relabel->arg;
9685
9686 if (relabel->relabelformat == COERCE_IMPLICIT_CAST &&
9687 !showimplicit)
9688 {
9689 /* don't show the implicit cast */
9690 get_rule_expr_paren(arg, context, false, node);
9691 }
9692 else
9693 {
9694 get_coercion_expr(arg, context,
9695 relabel->resulttype,
9696 relabel->resulttypmod,
9697 node);
9698 }
9699 }
9700 break;
9701
9702 case T_CoerceViaIO:
9703 {
9704 CoerceViaIO *iocoerce = (CoerceViaIO *) node;
9705 Node *arg = (Node *) iocoerce->arg;
9706
9707 if (iocoerce->coerceformat == COERCE_IMPLICIT_CAST &&
9708 !showimplicit)
9709 {
9710 /* don't show the implicit cast */
9711 get_rule_expr_paren(arg, context, false, node);
9712 }
9713 else
9714 {
9715 get_coercion_expr(arg, context,
9716 iocoerce->resulttype,
9717 -1,
9718 node);
9719 }
9720 }
9721 break;
9722
9723 case T_ArrayCoerceExpr:
9724 {
9725 ArrayCoerceExpr *acoerce = (ArrayCoerceExpr *) node;
9726 Node *arg = (Node *) acoerce->arg;
9727
9728 if (acoerce->coerceformat == COERCE_IMPLICIT_CAST &&
9729 !showimplicit)
9730 {
9731 /* don't show the implicit cast */
9732 get_rule_expr_paren(arg, context, false, node);
9733 }
9734 else
9735 {
9736 get_coercion_expr(arg, context,
9737 acoerce->resulttype,
9738 acoerce->resulttypmod,
9739 node);
9740 }
9741 }
9742 break;
9743
9744 case T_ConvertRowtypeExpr:
9745 {
9746 ConvertRowtypeExpr *convert = (ConvertRowtypeExpr *) node;
9747 Node *arg = (Node *) convert->arg;
9748
9749 if (convert->convertformat == COERCE_IMPLICIT_CAST &&
9750 !showimplicit)
9751 {
9752 /* don't show the implicit cast */
9753 get_rule_expr_paren(arg, context, false, node);
9754 }
9755 else
9756 {
9757 get_coercion_expr(arg, context,
9758 convert->resulttype, -1,
9759 node);
9760 }
9761 }
9762 break;
9763
9764 case T_CollateExpr:
9765 {
9766 CollateExpr *collate = (CollateExpr *) node;
9767 Node *arg = (Node *) collate->arg;
9768
9769 if (!PRETTY_PAREN(context))
9770 appendStringInfoChar(buf, '(');
9771 get_rule_expr_paren(arg, context, showimplicit, node);
9772 appendStringInfo(buf, " COLLATE %s",
9773 generate_collation_name(collate->collOid));
9774 if (!PRETTY_PAREN(context))
9775 appendStringInfoChar(buf, ')');
9776 }
9777 break;
9778
9779 case T_CaseExpr:
9780 {
9781 CaseExpr *caseexpr = (CaseExpr *) node;
9782 ListCell *temp;
9783
9784 appendContextKeyword(context, "CASE",
9785 0, PRETTYINDENT_VAR, 0);
9786 if (caseexpr->arg)
9787 {
9788 appendStringInfoChar(buf, ' ');
9789 get_rule_expr((Node *) caseexpr->arg, context, true);
9790 }
9791 foreach(temp, caseexpr->args)
9792 {
9793 CaseWhen *when = (CaseWhen *) lfirst(temp);
9794 Node *w = (Node *) when->expr;
9795
9796 if (caseexpr->arg)
9797 {
9798 /*
9799 * The parser should have produced WHEN clauses of the
9800 * form "CaseTestExpr = RHS", possibly with an
9801 * implicit coercion inserted above the CaseTestExpr.
9802 * For accurate decompilation of rules it's essential
9803 * that we show just the RHS. However in an
9804 * expression that's been through the optimizer, the
9805 * WHEN clause could be almost anything (since the
9806 * equality operator could have been expanded into an
9807 * inline function). If we don't recognize the form
9808 * of the WHEN clause, just punt and display it as-is.
9809 */
9810 if (IsA(w, OpExpr))
9811 {
9812 List *args = ((OpExpr *) w)->args;
9813
9814 if (list_length(args) == 2 &&
9815 IsA(strip_implicit_coercions(linitial(args)),
9816 CaseTestExpr))
9817 w = (Node *) lsecond(args);
9818 }
9819 }
9820
9821 if (!PRETTY_INDENT(context))
9822 appendStringInfoChar(buf, ' ');
9823 appendContextKeyword(context, "WHEN ",
9824 0, 0, 0);
9825 get_rule_expr(w, context, false);
9826 appendStringInfoString(buf, " THEN ");
9827 get_rule_expr((Node *) when->result, context, true);
9828 }
9829 if (!PRETTY_INDENT(context))
9830 appendStringInfoChar(buf, ' ');
9831 appendContextKeyword(context, "ELSE ",
9832 0, 0, 0);
9833 get_rule_expr((Node *) caseexpr->defresult, context, true);
9834 if (!PRETTY_INDENT(context))
9835 appendStringInfoChar(buf, ' ');
9836 appendContextKeyword(context, "END",
9837 -PRETTYINDENT_VAR, 0, 0);
9838 }
9839 break;
9840
9841 case T_CaseTestExpr:
9842 {
9843 /*
9844 * Normally we should never get here, since for expressions
9845 * that can contain this node type we attempt to avoid
9846 * recursing to it. But in an optimized expression we might
9847 * be unable to avoid that (see comments for CaseExpr). If we
9848 * do see one, print it as CASE_TEST_EXPR.
9849 */
9850 appendStringInfoString(buf, "CASE_TEST_EXPR");
9851 }
9852 break;
9853
9854 case T_ArrayExpr:
9855 {
9856 ArrayExpr *arrayexpr = (ArrayExpr *) node;
9857
9858 appendStringInfoString(buf, "ARRAY[");
9859 get_rule_expr((Node *) arrayexpr->elements, context, true);
9860 appendStringInfoChar(buf, ']');
9861
9862 /*
9863 * If the array isn't empty, we assume its elements are
9864 * coerced to the desired type. If it's empty, though, we
9865 * need an explicit coercion to the array type.
9866 */
9867 if (arrayexpr->elements == NIL)
9868 appendStringInfo(buf, "::%s",
9869 format_type_with_typemod(arrayexpr->array_typeid, -1));
9870 }
9871 break;
9872
9873 case T_RowExpr:
9874 {
9875 RowExpr *rowexpr = (RowExpr *) node;
9876 TupleDesc tupdesc = NULL;
9877 ListCell *arg;
9878 int i;
9879 char *sep;
9880
9881 /*
9882 * If it's a named type and not RECORD, we may have to skip
9883 * dropped columns and/or claim there are NULLs for added
9884 * columns.
9885 */
9886 if (rowexpr->row_typeid != RECORDOID)
9887 {
9888 tupdesc = lookup_rowtype_tupdesc(rowexpr->row_typeid, -1);
9889 Assert(list_length(rowexpr->args) <= tupdesc->natts);
9890 }
9891
9892 /*
9893 * SQL99 allows "ROW" to be omitted when there is more than
9894 * one column, but for simplicity we always print it.
9895 */
9896 appendStringInfoString(buf, "ROW(");
9897 sep = "";
9898 i = 0;
9899 foreach(arg, rowexpr->args)
9900 {
9901 Node *e = (Node *) lfirst(arg);
9902
9903 if (tupdesc == NULL ||
9904 !TupleDescAttr(tupdesc, i)->attisdropped)
9905 {
9906 appendStringInfoString(buf, sep);
9907 /* Whole-row Vars need special treatment here */
9908 get_rule_expr_toplevel(e, context, true);
9909 sep = ", ";
9910 }
9911 i++;
9912 }
9913 if (tupdesc != NULL)
9914 {
9915 while (i < tupdesc->natts)
9916 {
9917 if (!TupleDescAttr(tupdesc, i)->attisdropped)
9918 {
9919 appendStringInfoString(buf, sep);
9920 appendStringInfoString(buf, "NULL");
9921 sep = ", ";
9922 }
9923 i++;
9924 }
9925
9926 ReleaseTupleDesc(tupdesc);
9927 }
9928 appendStringInfoChar(buf, ')');
9929 if (rowexpr->row_format == COERCE_EXPLICIT_CAST)
9930 appendStringInfo(buf, "::%s",
9931 format_type_with_typemod(rowexpr->row_typeid, -1));
9932 }
9933 break;
9934
9935 case T_RowCompareExpr:
9936 {
9937 RowCompareExpr *rcexpr = (RowCompareExpr *) node;
9938
9939 /*
9940 * SQL99 allows "ROW" to be omitted when there is more than
9941 * one column, but for simplicity we always print it. Within
9942 * a ROW expression, whole-row Vars need special treatment, so
9943 * use get_rule_list_toplevel.
9944 */
9945 appendStringInfoString(buf, "(ROW(");
9946 get_rule_list_toplevel(rcexpr->largs, context, true);
9947
9948 /*
9949 * We assume that the name of the first-column operator will
9950 * do for all the rest too. This is definitely open to
9951 * failure, eg if some but not all operators were renamed
9952 * since the construct was parsed, but there seems no way to
9953 * be perfect.
9954 */
9955 appendStringInfo(buf, ") %s ROW(",
9956 generate_operator_name(linitial_oid(rcexpr->opnos),
9957 exprType(linitial(rcexpr->largs)),
9958 exprType(linitial(rcexpr->rargs))));
9959 get_rule_list_toplevel(rcexpr->rargs, context, true);
9960 appendStringInfoString(buf, "))");
9961 }
9962 break;
9963
9964 case T_CoalesceExpr:
9965 {
9966 CoalesceExpr *coalesceexpr = (CoalesceExpr *) node;
9967
9968 appendStringInfoString(buf, "COALESCE(");
9969 get_rule_expr((Node *) coalesceexpr->args, context, true);
9970 appendStringInfoChar(buf, ')');
9971 }
9972 break;
9973
9974 case T_MinMaxExpr:
9975 {
9976 MinMaxExpr *minmaxexpr = (MinMaxExpr *) node;
9977
9978 switch (minmaxexpr->op)
9979 {
9980 case IS_GREATEST:
9981 appendStringInfoString(buf, "GREATEST(");
9982 break;
9983 case IS_LEAST:
9984 appendStringInfoString(buf, "LEAST(");
9985 break;
9986 }
9987 get_rule_expr((Node *) minmaxexpr->args, context, true);
9988 appendStringInfoChar(buf, ')');
9989 }
9990 break;
9991
9992 case T_SQLValueFunction:
9993 {
9994 SQLValueFunction *svf = (SQLValueFunction *) node;
9995
9996 /*
9997 * Note: this code knows that typmod for time, timestamp, and
9998 * timestamptz just prints as integer.
9999 */
10000 switch (svf->op)
10001 {
10002 case SVFOP_CURRENT_DATE:
10003 appendStringInfoString(buf, "CURRENT_DATE");
10004 break;
10005 case SVFOP_CURRENT_TIME:
10006 appendStringInfoString(buf, "CURRENT_TIME");
10007 break;
10008 case SVFOP_CURRENT_TIME_N:
10009 appendStringInfo(buf, "CURRENT_TIME(%d)", svf->typmod);
10010 break;
10011 case SVFOP_CURRENT_TIMESTAMP:
10012 appendStringInfoString(buf, "CURRENT_TIMESTAMP");
10013 break;
10014 case SVFOP_CURRENT_TIMESTAMP_N:
10015 appendStringInfo(buf, "CURRENT_TIMESTAMP(%d)",
10016 svf->typmod);
10017 break;
10018 case SVFOP_LOCALTIME:
10019 appendStringInfoString(buf, "LOCALTIME");
10020 break;
10021 case SVFOP_LOCALTIME_N:
10022 appendStringInfo(buf, "LOCALTIME(%d)", svf->typmod);
10023 break;
10024 case SVFOP_LOCALTIMESTAMP:
10025 appendStringInfoString(buf, "LOCALTIMESTAMP");
10026 break;
10027 case SVFOP_LOCALTIMESTAMP_N:
10028 appendStringInfo(buf, "LOCALTIMESTAMP(%d)",
10029 svf->typmod);
10030 break;
10031 case SVFOP_CURRENT_ROLE:
10032 appendStringInfoString(buf, "CURRENT_ROLE");
10033 break;
10034 case SVFOP_CURRENT_USER:
10035 appendStringInfoString(buf, "CURRENT_USER");
10036 break;
10037 case SVFOP_USER:
10038 appendStringInfoString(buf, "USER");
10039 break;
10040 case SVFOP_SESSION_USER:
10041 appendStringInfoString(buf, "SESSION_USER");
10042 break;
10043 case SVFOP_CURRENT_CATALOG:
10044 appendStringInfoString(buf, "CURRENT_CATALOG");
10045 break;
10046 case SVFOP_CURRENT_SCHEMA:
10047 appendStringInfoString(buf, "CURRENT_SCHEMA");
10048 break;
10049 }
10050 }
10051 break;
10052
10053 case T_XmlExpr:
10054 {
10055 XmlExpr *xexpr = (XmlExpr *) node;
10056 bool needcomma = false;
10057 ListCell *arg;
10058 ListCell *narg;
10059 Const *con;
10060
10061 switch (xexpr->op)
10062 {
10063 case IS_XMLCONCAT:
10064 appendStringInfoString(buf, "XMLCONCAT(");
10065 break;
10066 case IS_XMLELEMENT:
10067 appendStringInfoString(buf, "XMLELEMENT(");
10068 break;
10069 case IS_XMLFOREST:
10070 appendStringInfoString(buf, "XMLFOREST(");
10071 break;
10072 case IS_XMLPARSE:
10073 appendStringInfoString(buf, "XMLPARSE(");
10074 break;
10075 case IS_XMLPI:
10076 appendStringInfoString(buf, "XMLPI(");
10077 break;
10078 case IS_XMLROOT:
10079 appendStringInfoString(buf, "XMLROOT(");
10080 break;
10081 case IS_XMLSERIALIZE:
10082 appendStringInfoString(buf, "XMLSERIALIZE(");
10083 break;
10084 case IS_DOCUMENT:
10085 break;
10086 }
10087 if (xexpr->op == IS_XMLPARSE || xexpr->op == IS_XMLSERIALIZE)
10088 {
10089 if (xexpr->xmloption == XMLOPTION_DOCUMENT)
10090 appendStringInfoString(buf, "DOCUMENT ");
10091 else
10092 appendStringInfoString(buf, "CONTENT ");
10093 }
10094 if (xexpr->name)
10095 {
10096 appendStringInfo(buf, "NAME %s",
10097 quote_identifier(map_xml_name_to_sql_identifier(xexpr->name)));
10098 needcomma = true;
10099 }
10100 if (xexpr->named_args)
10101 {
10102 if (xexpr->op != IS_XMLFOREST)
10103 {
10104 if (needcomma)
10105 appendStringInfoString(buf, ", ");
10106 appendStringInfoString(buf, "XMLATTRIBUTES(");
10107 needcomma = false;
10108 }
10109 forboth(arg, xexpr->named_args, narg, xexpr->arg_names)
10110 {
10111 Node *e = (Node *) lfirst(arg);
10112 char *argname = strVal(lfirst(narg));
10113
10114 if (needcomma)
10115 appendStringInfoString(buf, ", ");
10116 get_rule_expr((Node *) e, context, true);
10117 appendStringInfo(buf, " AS %s",
10118 quote_identifier(map_xml_name_to_sql_identifier(argname)));
10119 needcomma = true;
10120 }
10121 if (xexpr->op != IS_XMLFOREST)
10122 appendStringInfoChar(buf, ')');
10123 }
10124 if (xexpr->args)
10125 {
10126 if (needcomma)
10127 appendStringInfoString(buf, ", ");
10128 switch (xexpr->op)
10129 {
10130 case IS_XMLCONCAT:
10131 case IS_XMLELEMENT:
10132 case IS_XMLFOREST:
10133 case IS_XMLPI:
10134 case IS_XMLSERIALIZE:
10135 /* no extra decoration needed */
10136 get_rule_expr((Node *) xexpr->args, context, true);
10137 break;
10138 case IS_XMLPARSE:
10139 Assert(list_length(xexpr->args) == 2);
10140
10141 get_rule_expr((Node *) linitial(xexpr->args),
10142 context, true);
10143
10144 con = lsecond_node(Const, xexpr->args);
10145 Assert(!con->constisnull);
10146 if (DatumGetBool(con->constvalue))
10147 appendStringInfoString(buf,
10148 " PRESERVE WHITESPACE");
10149 else
10150 appendStringInfoString(buf,
10151 " STRIP WHITESPACE");
10152 break;
10153 case IS_XMLROOT:
10154 Assert(list_length(xexpr->args) == 3);
10155
10156 get_rule_expr((Node *) linitial(xexpr->args),
10157 context, true);
10158
10159 appendStringInfoString(buf, ", VERSION ");
10160 con = (Const *) lsecond(xexpr->args);
10161 if (IsA(con, Const) &&
10162 con->constisnull)
10163 appendStringInfoString(buf, "NO VALUE");
10164 else
10165 get_rule_expr((Node *) con, context, false);
10166
10167 con = lthird_node(Const, xexpr->args);
10168 if (con->constisnull)
10169 /* suppress STANDALONE NO VALUE */ ;
10170 else
10171 {
10172 switch (DatumGetInt32(con->constvalue))
10173 {
10174 case XML_STANDALONE_YES:
10175 appendStringInfoString(buf,
10176 ", STANDALONE YES");
10177 break;
10178 case XML_STANDALONE_NO:
10179 appendStringInfoString(buf,
10180 ", STANDALONE NO");
10181 break;
10182 case XML_STANDALONE_NO_VALUE:
10183 appendStringInfoString(buf,
10184 ", STANDALONE NO VALUE");
10185 break;
10186 default:
10187 break;
10188 }
10189 }
10190 break;
10191 case IS_DOCUMENT:
10192 get_rule_expr_paren((Node *) xexpr->args, context, false, node);
10193 break;
10194 }
10195 }
10196 if (xexpr->op == IS_XMLSERIALIZE)
10197 {
10198 appendStringInfo(buf, " AS %s",
10199 format_type_with_typemod(xexpr->type,
10200 xexpr->typmod));
10201 if (xexpr->indent)
10202 appendStringInfoString(buf, " INDENT");
10203 else
10204 appendStringInfoString(buf, " NO INDENT");
10205 }
10206
10207 if (xexpr->op == IS_DOCUMENT)
10208 appendStringInfoString(buf, " IS DOCUMENT");
10209 else
10210 appendStringInfoChar(buf, ')');
10211 }
10212 break;
10213
10214 case T_NullTest:
10215 {
10216 NullTest *ntest = (NullTest *) node;
10217
10218 if (!PRETTY_PAREN(context))
10219 appendStringInfoChar(buf, '(');
10220 get_rule_expr_paren((Node *) ntest->arg, context, true, node);
10221
10222 /*
10223 * For scalar inputs, we prefer to print as IS [NOT] NULL,
10224 * which is shorter and traditional. If it's a rowtype input
10225 * but we're applying a scalar test, must print IS [NOT]
10226 * DISTINCT FROM NULL to be semantically correct.
10227 */
10228 if (ntest->argisrow ||
10229 !type_is_rowtype(exprType((Node *) ntest->arg)))
10230 {
10231 switch (ntest->nulltesttype)
10232 {
10233 case IS_NULL:
10234 appendStringInfoString(buf, " IS NULL");
10235 break;
10236 case IS_NOT_NULL:
10237 appendStringInfoString(buf, " IS NOT NULL");
10238 break;
10239 default:
10240 elog(ERROR, "unrecognized nulltesttype: %d",
10241 (int) ntest->nulltesttype);
10242 }
10243 }
10244 else
10245 {
10246 switch (ntest->nulltesttype)
10247 {
10248 case IS_NULL:
10249 appendStringInfoString(buf, " IS NOT DISTINCT FROM NULL");
10250 break;
10251 case IS_NOT_NULL:
10252 appendStringInfoString(buf, " IS DISTINCT FROM NULL");
10253 break;
10254 default:
10255 elog(ERROR, "unrecognized nulltesttype: %d",
10256 (int) ntest->nulltesttype);
10257 }
10258 }
10259 if (!PRETTY_PAREN(context))
10260 appendStringInfoChar(buf, ')');
10261 }
10262 break;
10263
10264 case T_BooleanTest:
10265 {
10266 BooleanTest *btest = (BooleanTest *) node;
10267
10268 if (!PRETTY_PAREN(context))
10269 appendStringInfoChar(buf, '(');
10270 get_rule_expr_paren((Node *) btest->arg, context, false, node);
10271 switch (btest->booltesttype)
10272 {
10273 case IS_TRUE:
10274 appendStringInfoString(buf, " IS TRUE");
10275 break;
10276 case IS_NOT_TRUE:
10277 appendStringInfoString(buf, " IS NOT TRUE");
10278 break;
10279 case IS_FALSE:
10280 appendStringInfoString(buf, " IS FALSE");
10281 break;
10282 case IS_NOT_FALSE:
10283 appendStringInfoString(buf, " IS NOT FALSE");
10284 break;
10285 case IS_UNKNOWN:
10286 appendStringInfoString(buf, " IS UNKNOWN");
10287 break;
10288 case IS_NOT_UNKNOWN:
10289 appendStringInfoString(buf, " IS NOT UNKNOWN");
10290 break;
10291 default:
10292 elog(ERROR, "unrecognized booltesttype: %d",
10293 (int) btest->booltesttype);
10294 }
10295 if (!PRETTY_PAREN(context))
10296 appendStringInfoChar(buf, ')');
10297 }
10298 break;
10299
10300 case T_CoerceToDomain:
10301 {
10302 CoerceToDomain *ctest = (CoerceToDomain *) node;
10303 Node *arg = (Node *) ctest->arg;
10304
10305 if (ctest->coercionformat == COERCE_IMPLICIT_CAST &&
10306 !showimplicit)
10307 {
10308 /* don't show the implicit cast */
10309 get_rule_expr(arg, context, false);
10310 }
10311 else
10312 {
10313 get_coercion_expr(arg, context,
10314 ctest->resulttype,
10315 ctest->resulttypmod,
10316 node);
10317 }
10318 }
10319 break;
10320
10321 case T_CoerceToDomainValue:
10322 appendStringInfoString(buf, "VALUE");
10323 break;
10324
10325 case T_SetToDefault:
10326 appendStringInfoString(buf, "DEFAULT");
10327 break;
10328
10329 case T_CurrentOfExpr:
10330 {
10331 CurrentOfExpr *cexpr = (CurrentOfExpr *) node;
10332
10333 if (cexpr->cursor_name)
10334 appendStringInfo(buf, "CURRENT OF %s",
10335 quote_identifier(cexpr->cursor_name));
10336 else
10337 appendStringInfo(buf, "CURRENT OF $%d",
10338 cexpr->cursor_param);
10339 }
10340 break;
10341
10342 case T_NextValueExpr:
10343 {
10344 NextValueExpr *nvexpr = (NextValueExpr *) node;
10345
10346 /*
10347 * This isn't exactly nextval(), but that seems close enough
10348 * for EXPLAIN's purposes.
10349 */
10350 appendStringInfoString(buf, "nextval(");
10351 simple_quote_literal(buf,
10352 generate_relation_name(nvexpr->seqid,
10353 NIL));
10354 appendStringInfoChar(buf, ')');
10355 }
10356 break;
10357
10358 case T_InferenceElem:
10359 {
10360 InferenceElem *iexpr = (InferenceElem *) node;
10361 bool save_varprefix;
10362 bool need_parens;
10363
10364 /*
10365 * InferenceElem can only refer to target relation, so a
10366 * prefix is not useful, and indeed would cause parse errors.
10367 */
10368 save_varprefix = context->varprefix;
10369 context->varprefix = false;
10370
10371 /*
10372 * Parenthesize the element unless it's a simple Var or a bare
10373 * function call. Follows pg_get_indexdef_worker().
10374 */
10375 need_parens = !IsA(iexpr->expr, Var);
10376 if (IsA(iexpr->expr, FuncExpr) &&
10377 ((FuncExpr *) iexpr->expr)->funcformat ==
10378 COERCE_EXPLICIT_CALL)
10379 need_parens = false;
10380
10381 if (need_parens)
10382 appendStringInfoChar(buf, '(');
10383 get_rule_expr((Node *) iexpr->expr,
10384 context, false);
10385 if (need_parens)
10386 appendStringInfoChar(buf, ')');
10387
10388 context->varprefix = save_varprefix;
10389
10390 if (iexpr->infercollid)
10391 appendStringInfo(buf, " COLLATE %s",
10392 generate_collation_name(iexpr->infercollid));
10393
10394 /* Add the operator class name, if not default */
10395 if (iexpr->inferopclass)
10396 {
10397 Oid inferopclass = iexpr->inferopclass;
10398 Oid inferopcinputtype = get_opclass_input_type(iexpr->inferopclass);
10399
10400 get_opclass_name(inferopclass, inferopcinputtype, buf);
10401 }
10402 }
10403 break;
10404
10405 case T_ReturningExpr:
10406 {
10407 ReturningExpr *retExpr = (ReturningExpr *) node;
10408
10409 /*
10410 * We cannot see a ReturningExpr in rule deparsing, only while
10411 * EXPLAINing a query plan (ReturningExpr nodes are only ever
10412 * adding during query rewriting). Just display the expression
10413 * returned (an expanded view column).
10414 */
10415 get_rule_expr((Node *) retExpr->retexpr, context, showimplicit);
10416 }
10417 break;
10418
10419 case T_PartitionBoundSpec:
10420 {
10421 PartitionBoundSpec *spec = (PartitionBoundSpec *) node;
10422 ListCell *cell;
10423 char *sep;
10424
10425 if (spec->is_default)
10426 {
10427 appendStringInfoString(buf, "DEFAULT");
10428 break;
10429 }
10430
10431 switch (spec->strategy)
10432 {
10433 case PARTITION_STRATEGY_HASH:
10434 Assert(spec->modulus > 0 && spec->remainder >= 0);
10435 Assert(spec->modulus > spec->remainder);
10436
10437 appendStringInfoString(buf, "FOR VALUES");
10438 appendStringInfo(buf, " WITH (modulus %d, remainder %d)",
10439 spec->modulus, spec->remainder);
10440 break;
10441
10442 case PARTITION_STRATEGY_LIST:
10443 Assert(spec->listdatums != NIL);
10444
10445 appendStringInfoString(buf, "FOR VALUES IN (");
10446 sep = "";
10447 foreach(cell, spec->listdatums)
10448 {
10449 Const *val = lfirst_node(Const, cell);
10450
10451 appendStringInfoString(buf, sep);
10452 get_const_expr(val, context, -1);
10453 sep = ", ";
10454 }
10455
10456 appendStringInfoChar(buf, ')');
10457 break;
10458
10459 case PARTITION_STRATEGY_RANGE:
10460 Assert(spec->lowerdatums != NIL &&
10461 spec->upperdatums != NIL &&
10462 list_length(spec->lowerdatums) ==
10463 list_length(spec->upperdatums));
10464
10465 appendStringInfo(buf, "FOR VALUES FROM %s TO %s",
10466 get_range_partbound_string(spec->lowerdatums),
10467 get_range_partbound_string(spec->upperdatums));
10468 break;
10469
10470 default:
10471 elog(ERROR, "unrecognized partition strategy: %d",
10472 (int) spec->strategy);
10473 break;
10474 }
10475 }
10476 break;
10477
10478 case T_JsonValueExpr:
10479 {
10480 JsonValueExpr *jve = (JsonValueExpr *) node;
10481
10482 get_rule_expr((Node *) jve->raw_expr, context, false);
10483 get_json_format(jve->format, context->buf);
10484 }
10485 break;
10486
10487 case T_JsonConstructorExpr:
10488 get_json_constructor((JsonConstructorExpr *) node, context, false);
10489 break;
10490
10491 case T_JsonIsPredicate:
10492 {
10493 JsonIsPredicate *pred = (JsonIsPredicate *) node;
10494
10495 if (!PRETTY_PAREN(context))
10496 appendStringInfoChar(context->buf, '(');
10497
10498 get_rule_expr_paren(pred->expr, context, true, node);
10499
10500 appendStringInfoString(context->buf, " IS JSON");
10501
10502 /* TODO: handle FORMAT clause */
10503
10504 switch (pred->item_type)
10505 {
10506 case JS_TYPE_SCALAR:
10507 appendStringInfoString(context->buf, " SCALAR");
10508 break;
10509 case JS_TYPE_ARRAY:
10510 appendStringInfoString(context->buf, " ARRAY");
10511 break;
10512 case JS_TYPE_OBJECT:
10513 appendStringInfoString(context->buf, " OBJECT");
10514 break;
10515 default:
10516 break;
10517 }
10518
10519 if (pred->unique_keys)
10520 appendStringInfoString(context->buf, " WITH UNIQUE KEYS");
10521
10522 if (!PRETTY_PAREN(context))
10523 appendStringInfoChar(context->buf, ')');
10524 }
10525 break;
10526
10527 case T_JsonExpr:
10528 {
10529 JsonExpr *jexpr = (JsonExpr *) node;
10530
10531 switch (jexpr->op)
10532 {
10533 case JSON_EXISTS_OP:
10534 appendStringInfoString(buf, "JSON_EXISTS(");
10535 break;
10536 case JSON_QUERY_OP:
10537 appendStringInfoString(buf, "JSON_QUERY(");
10538 break;
10539 case JSON_VALUE_OP:
10540 appendStringInfoString(buf, "JSON_VALUE(");
10541 break;
10542 default:
10543 elog(ERROR, "unrecognized JsonExpr op: %d",
10544 (int) jexpr->op);
10545 }
10546
10547 get_rule_expr(jexpr->formatted_expr, context, showimplicit);
10548
10549 appendStringInfoString(buf, ", ");
10550
10551 get_json_path_spec(jexpr->path_spec, context, showimplicit);
10552
10553 if (jexpr->passing_values)
10554 {
10555 ListCell *lc1,
10556 *lc2;
10557 bool needcomma = false;
10558
10559 appendStringInfoString(buf, " PASSING ");
10560
10561 forboth(lc1, jexpr->passing_names,
10562 lc2, jexpr->passing_values)
10563 {
10564 if (needcomma)
10565 appendStringInfoString(buf, ", ");
10566 needcomma = true;
10567
10568 get_rule_expr((Node *) lfirst(lc2), context, showimplicit);
10569 appendStringInfo(buf, " AS %s",
10570 quote_identifier(lfirst_node(String, lc1)->sval));
10571 }
10572 }
10573
10574 if (jexpr->op != JSON_EXISTS_OP ||
10575 jexpr->returning->typid != BOOLOID)
10576 get_json_returning(jexpr->returning, context->buf,
10577 jexpr->op == JSON_QUERY_OP);
10578
10579 get_json_expr_options(jexpr, context,
10580 jexpr->op != JSON_EXISTS_OP ?
10581 JSON_BEHAVIOR_NULL :
10582 JSON_BEHAVIOR_FALSE);
10583
10584 appendStringInfoChar(buf, ')');
10585 }
10586 break;
10587
10588 case T_List:
10589 {
10590 char *sep;
10591 ListCell *l;
10592
10593 sep = "";
10594 foreach(l, (List *) node)
10595 {
10596 appendStringInfoString(buf, sep);
10597 get_rule_expr((Node *) lfirst(l), context, showimplicit);
10598 sep = ", ";
10599 }
10600 }
10601 break;
10602
10603 case T_TableFunc:
10604 get_tablefunc((TableFunc *) node, context, showimplicit);
10605 break;
10606
10607 default:
10608 elog(ERROR, "unrecognized node type: %d", (int) nodeTag(node));
10609 break;
10610 }
10611}
10612
10613/*
10614 * get_rule_expr_toplevel - Parse back a toplevel expression
10615 *
10616 * Same as get_rule_expr(), except that if the expr is just a Var, we pass
10617 * istoplevel = true not false to get_variable(). This causes whole-row Vars
10618 * to get printed with decoration that will prevent expansion of "*".
10619 * We need to use this in contexts such as ROW() and VALUES(), where the
10620 * parser would expand "foo.*" appearing at top level. (In principle we'd
10621 * use this in get_target_list() too, but that has additional worries about
10622 * whether to print AS, so it needs to invoke get_variable() directly anyway.)
10623 */
10624static void
10625get_rule_expr_toplevel(Node *node, deparse_context *context,
10626 bool showimplicit)
10627{
10628 if (node && IsA(node, Var))
10629 (void) get_variable((Var *) node, 0, true, context);
10630 else
10631 get_rule_expr(node, context, showimplicit);
10632}
10633
10634/*
10635 * get_rule_list_toplevel - Parse back a list of toplevel expressions
10636 *
10637 * Apply get_rule_expr_toplevel() to each element of a List.
10638 *
10639 * This adds commas between the expressions, but caller is responsible
10640 * for printing surrounding decoration.
10641 */
10642static void
10643get_rule_list_toplevel(List *lst, deparse_context *context,
10644 bool showimplicit)
10645{
10646 const char *sep;
10647 ListCell *lc;
10648
10649 sep = "";
10650 foreach(lc, lst)
10651 {
10652 Node *e = (Node *) lfirst(lc);
10653
10654 appendStringInfoString(context->buf, sep);
10655 get_rule_expr_toplevel(e, context, showimplicit);
10656 sep = ", ";
10657 }
10658}
10659
10660/*
10661 * get_rule_expr_funccall - Parse back a function-call expression
10662 *
10663 * Same as get_rule_expr(), except that we guarantee that the output will
10664 * look like a function call, or like one of the things the grammar treats as
10665 * equivalent to a function call (see the func_expr_windowless production).
10666 * This is needed in places where the grammar uses func_expr_windowless and
10667 * you can't substitute a parenthesized a_expr. If what we have isn't going
10668 * to look like a function call, wrap it in a dummy CAST() expression, which
10669 * will satisfy the grammar --- and, indeed, is likely what the user wrote to
10670 * produce such a thing.
10671 */
10672static void
10673get_rule_expr_funccall(Node *node, deparse_context *context,
10674 bool showimplicit)
10675{
10676 if (looks_like_function(node))
10677 get_rule_expr(node, context, showimplicit);
10678 else
10679 {
10680 StringInfo buf = context->buf;
10681
10682 appendStringInfoString(buf, "CAST(");
10683 /* no point in showing any top-level implicit cast */
10684 get_rule_expr(node, context, false);
10685 appendStringInfo(buf, " AS %s)",
10686 format_type_with_typemod(exprType(node),
10687 exprTypmod(node)));
10688 }
10689}
10690
10691/*
10692 * Helper function to identify node types that satisfy func_expr_windowless.
10693 * If in doubt, "false" is always a safe answer.
10694 */
10695static bool
10696looks_like_function(Node *node)
10697{
10698 if (node == NULL)
10699 return false; /* probably shouldn't happen */
10700 switch (nodeTag(node))
10701 {
10702 case T_FuncExpr:
10703 /* OK, unless it's going to deparse as a cast */
10704 return (((FuncExpr *) node)->funcformat == COERCE_EXPLICIT_CALL ||
10705 ((FuncExpr *) node)->funcformat == COERCE_SQL_SYNTAX);
10706 case T_NullIfExpr:
10707 case T_CoalesceExpr:
10708 case T_MinMaxExpr:
10709 case T_SQLValueFunction:
10710 case T_XmlExpr:
10711 case T_JsonExpr:
10712 /* these are all accepted by func_expr_common_subexpr */
10713 return true;
10714 default:
10715 break;
10716 }
10717 return false;
10718}
10719
10720
10721/*
10722 * get_oper_expr - Parse back an OpExpr node
10723 */
10724static void
10725get_oper_expr(OpExpr *expr, deparse_context *context)
10726{
10727 StringInfo buf = context->buf;
10728 Oid opno = expr->opno;
10729 List *args = expr->args;
10730
10731 if (!PRETTY_PAREN(context))
10732 appendStringInfoChar(buf, '(');
10733 if (list_length(args) == 2)
10734 {
10735 /* binary operator */
10736 Node *arg1 = (Node *) linitial(args);
10737 Node *arg2 = (Node *) lsecond(args);
10738
10739 get_rule_expr_paren(arg1, context, true, (Node *) expr);
10740 appendStringInfo(buf, " %s ",
10741 generate_operator_name(opno,
10742 exprType(arg1),
10743 exprType(arg2)));
10744 get_rule_expr_paren(arg2, context, true, (Node *) expr);
10745 }
10746 else
10747 {
10748 /* prefix operator */
10749 Node *arg = (Node *) linitial(args);
10750
10751 appendStringInfo(buf, "%s ",
10752 generate_operator_name(opno,
10753 InvalidOid,
10754 exprType(arg)));
10755 get_rule_expr_paren(arg, context, true, (Node *) expr);
10756 }
10757 if (!PRETTY_PAREN(context))
10758 appendStringInfoChar(buf, ')');
10759}
10760
10761/*
10762 * get_func_expr - Parse back a FuncExpr node
10763 */
10764static void
10765get_func_expr(FuncExpr *expr, deparse_context *context,
10766 bool showimplicit)
10767{
10768 StringInfo buf = context->buf;
10769 Oid funcoid = expr->funcid;
10770 Oid argtypes[FUNC_MAX_ARGS];
10771 int nargs;
10772 List *argnames;
10773 bool use_variadic;
10774 ListCell *l;
10775
10776 /*
10777 * If the function call came from an implicit coercion, then just show the
10778 * first argument --- unless caller wants to see implicit coercions.
10779 */
10780 if (expr->funcformat == COERCE_IMPLICIT_CAST && !showimplicit)
10781 {
10782 get_rule_expr_paren((Node *) linitial(expr->args), context,
10783 false, (Node *) expr);
10784 return;
10785 }
10786
10787 /*
10788 * If the function call came from a cast, then show the first argument
10789 * plus an explicit cast operation.
10790 */
10791 if (expr->funcformat == COERCE_EXPLICIT_CAST ||
10792 expr->funcformat == COERCE_IMPLICIT_CAST)
10793 {
10794 Node *arg = linitial(expr->args);
10795 Oid rettype = expr->funcresulttype;
10796 int32 coercedTypmod;
10797
10798 /* Get the typmod if this is a length-coercion function */
10799 (void) exprIsLengthCoercion((Node *) expr, &coercedTypmod);
10800
10801 get_coercion_expr(arg, context,
10802 rettype, coercedTypmod,
10803 (Node *) expr);
10804
10805 return;
10806 }
10807
10808 /*
10809 * If the function was called using one of the SQL spec's random special
10810 * syntaxes, try to reproduce that. If we don't recognize the function,
10811 * fall through.
10812 */
10813 if (expr->funcformat == COERCE_SQL_SYNTAX)
10814 {
10815 if (get_func_sql_syntax(expr, context))
10816 return;
10817 }
10818
10819 /*
10820 * Normal function: display as proname(args). First we need to extract
10821 * the argument datatypes.
10822 */
10823 if (list_length(expr->args) > FUNC_MAX_ARGS)
10824 ereport(ERROR,
10825 (errcode(ERRCODE_TOO_MANY_ARGUMENTS),
10826 errmsg("too many arguments")));
10827 nargs = 0;
10828 argnames = NIL;
10829 foreach(l, expr->args)
10830 {
10831 Node *arg = (Node *) lfirst(l);
10832
10833 if (IsA(arg, NamedArgExpr))
10834 argnames = lappend(argnames, ((NamedArgExpr *) arg)->name);
10835 argtypes[nargs] = exprType(arg);
10836 nargs++;
10837 }
10838
10839 appendStringInfo(buf, "%s(",
10840 generate_function_name(funcoid, nargs,
10841 argnames, argtypes,
10842 expr->funcvariadic,
10843 &use_variadic,
10844 context->inGroupBy));
10845 nargs = 0;
10846 foreach(l, expr->args)
10847 {
10848 if (nargs++ > 0)
10849 appendStringInfoString(buf, ", ");
10850 if (use_variadic && lnext(expr->args, l) == NULL)
10851 appendStringInfoString(buf, "VARIADIC ");
10852 get_rule_expr((Node *) lfirst(l), context, true);
10853 }
10854 appendStringInfoChar(buf, ')');
10855}
10856
10857/*
10858 * get_agg_expr - Parse back an Aggref node
10859 */
10860static void
10861get_agg_expr(Aggref *aggref, deparse_context *context,
10862 Aggref *original_aggref)
10863{
10864 get_agg_expr_helper(aggref, context, original_aggref, NULL, NULL,
10865 false);
10866}
10867
10868/*
10869 * get_agg_expr_helper - subroutine for get_agg_expr and
10870 * get_json_agg_constructor
10871 */
10872static void
10873get_agg_expr_helper(Aggref *aggref, deparse_context *context,
10874 Aggref *original_aggref, const char *funcname,
10875 const char *options, bool is_json_objectagg)
10876{
10877 StringInfo buf = context->buf;
10878 Oid argtypes[FUNC_MAX_ARGS];
10879 int nargs;
10880 bool use_variadic = false;
10881
10882 /*
10883 * For a combining aggregate, we look up and deparse the corresponding
10884 * partial aggregate instead. This is necessary because our input
10885 * argument list has been replaced; the new argument list always has just
10886 * one element, which will point to a partial Aggref that supplies us with
10887 * transition states to combine.
10888 */
10889 if (DO_AGGSPLIT_COMBINE(aggref->aggsplit))
10890 {
10891 TargetEntry *tle;
10892
10893 Assert(list_length(aggref->args) == 1);
10894 tle = linitial_node(TargetEntry, aggref->args);
10895 resolve_special_varno((Node *) tle->expr, context,
10896 get_agg_combine_expr, original_aggref);
10897 return;
10898 }
10899
10900 /*
10901 * Mark as PARTIAL, if appropriate. We look to the original aggref so as
10902 * to avoid printing this when recursing from the code just above.
10903 */
10904 if (DO_AGGSPLIT_SKIPFINAL(original_aggref->aggsplit))
10905 appendStringInfoString(buf, "PARTIAL ");
10906
10907 /* Extract the argument types as seen by the parser */
10908 nargs = get_aggregate_argtypes(aggref, argtypes);
10909
10910 if (!funcname)
10911 funcname = generate_function_name(aggref->aggfnoid, nargs, NIL,
10912 argtypes, aggref->aggvariadic,
10913 &use_variadic,
10914 context->inGroupBy);
10915
10916 /* Print the aggregate name, schema-qualified if needed */
10917 appendStringInfo(buf, "%s(%s", funcname,
10918 (aggref->aggdistinct != NIL) ? "DISTINCT " : "");
10919
10920 if (AGGKIND_IS_ORDERED_SET(aggref->aggkind))
10921 {
10922 /*
10923 * Ordered-set aggregates do not use "*" syntax. Also, we needn't
10924 * worry about inserting VARIADIC. So we can just dump the direct
10925 * args as-is.
10926 */
10927 Assert(!aggref->aggvariadic);
10928 get_rule_expr((Node *) aggref->aggdirectargs, context, true);
10929 Assert(aggref->aggorder != NIL);
10930 appendStringInfoString(buf, ") WITHIN GROUP (ORDER BY ");
10931 get_rule_orderby(aggref->aggorder, aggref->args, false, context);
10932 }
10933 else
10934 {
10935 /* aggstar can be set only in zero-argument aggregates */
10936 if (aggref->aggstar)
10937 appendStringInfoChar(buf, '*');
10938 else
10939 {
10940 ListCell *l;
10941 int i;
10942
10943 i = 0;
10944 foreach(l, aggref->args)
10945 {
10946 TargetEntry *tle = (TargetEntry *) lfirst(l);
10947 Node *arg = (Node *) tle->expr;
10948
10949 Assert(!IsA(arg, NamedArgExpr));
10950 if (tle->resjunk)
10951 continue;
10952 if (i++ > 0)
10953 {
10954 if (is_json_objectagg)
10955 {
10956 /*
10957 * the ABSENT ON NULL and WITH UNIQUE args are printed
10958 * separately, so ignore them here
10959 */
10960 if (i > 2)
10961 break;
10962
10963 appendStringInfoString(buf, " : ");
10964 }
10965 else
10966 appendStringInfoString(buf, ", ");
10967 }
10968 if (use_variadic && i == nargs)
10969 appendStringInfoString(buf, "VARIADIC ");
10970 get_rule_expr(arg, context, true);
10971 }
10972 }
10973
10974 if (aggref->aggorder != NIL)
10975 {
10976 appendStringInfoString(buf, " ORDER BY ");
10977 get_rule_orderby(aggref->aggorder, aggref->args, false, context);
10978 }
10979 }
10980
10981 if (options)
10982 appendStringInfoString(buf, options);
10983
10984 if (aggref->aggfilter != NULL)
10985 {
10986 appendStringInfoString(buf, ") FILTER (WHERE ");
10987 get_rule_expr((Node *) aggref->aggfilter, context, false);
10988 }
10989
10990 appendStringInfoChar(buf, ')');
10991}
10992
10993/*
10994 * This is a helper function for get_agg_expr(). It's used when we deparse
10995 * a combining Aggref; resolve_special_varno locates the corresponding partial
10996 * Aggref and then calls this.
10997 */
10998static void
10999get_agg_combine_expr(Node *node, deparse_context *context, void *callback_arg)
11000{
11001 Aggref *aggref;
11002 Aggref *original_aggref = callback_arg;
11003
11004 if (!IsA(node, Aggref))
11005 elog(ERROR, "combining Aggref does not point to an Aggref");
11006
11007 aggref = (Aggref *) node;
11008 get_agg_expr(aggref, context, original_aggref);
11009}
11010
11011/*
11012 * get_windowfunc_expr - Parse back a WindowFunc node
11013 */
11014static void
11015get_windowfunc_expr(WindowFunc *wfunc, deparse_context *context)
11016{
11017 get_windowfunc_expr_helper(wfunc, context, NULL, NULL, false);
11018}
11019
11020
11021/*
11022 * get_windowfunc_expr_helper - subroutine for get_windowfunc_expr and
11023 * get_json_agg_constructor
11024 */
11025static void
11026get_windowfunc_expr_helper(WindowFunc *wfunc, deparse_context *context,
11027 const char *funcname, const char *options,
11028 bool is_json_objectagg)
11029{
11030 StringInfo buf = context->buf;
11031 Oid argtypes[FUNC_MAX_ARGS];
11032 int nargs;
11033 List *argnames;
11034 ListCell *l;
11035
11036 if (list_length(wfunc->args) > FUNC_MAX_ARGS)
11037 ereport(ERROR,
11038 (errcode(ERRCODE_TOO_MANY_ARGUMENTS),
11039 errmsg("too many arguments")));
11040 nargs = 0;
11041 argnames = NIL;
11042 foreach(l, wfunc->args)
11043 {
11044 Node *arg = (Node *) lfirst(l);
11045
11046 if (IsA(arg, NamedArgExpr))
11047 argnames = lappend(argnames, ((NamedArgExpr *) arg)->name);
11048 argtypes[nargs] = exprType(arg);
11049 nargs++;
11050 }
11051
11052 if (!funcname)
11053 funcname = generate_function_name(wfunc->winfnoid, nargs, argnames,
11054 argtypes, false, NULL,
11055 context->inGroupBy);
11056
11057 appendStringInfo(buf, "%s(", funcname);
11058
11059 /* winstar can be set only in zero-argument aggregates */
11060 if (wfunc->winstar)
11061 appendStringInfoChar(buf, '*');
11062 else
11063 {
11064 if (is_json_objectagg)
11065 {
11066 get_rule_expr((Node *) linitial(wfunc->args), context, false);
11067 appendStringInfoString(buf, " : ");
11068 get_rule_expr((Node *) lsecond(wfunc->args), context, false);
11069 }
11070 else
11071 get_rule_expr((Node *) wfunc->args, context, true);
11072 }
11073
11074 if (options)
11075 appendStringInfoString(buf, options);
11076
11077 if (wfunc->aggfilter != NULL)
11078 {
11079 appendStringInfoString(buf, ") FILTER (WHERE ");
11080 get_rule_expr((Node *) wfunc->aggfilter, context, false);
11081 }
11082
11083 appendStringInfoString(buf, ") OVER ");
11084
11085 if (context->windowClause)
11086 {
11087 /* Query-decompilation case: search the windowClause list */
11088 foreach(l, context->windowClause)
11089 {
11090 WindowClause *wc = (WindowClause *) lfirst(l);
11091
11092 if (wc->winref == wfunc->winref)
11093 {
11094 if (wc->name)
11095 appendStringInfoString(buf, quote_identifier(wc->name));
11096 else
11097 get_rule_windowspec(wc, context->targetList, context);
11098 break;
11099 }
11100 }
11101 if (l == NULL)
11102 elog(ERROR, "could not find window clause for winref %u",
11103 wfunc->winref);
11104 }
11105 else
11106 {
11107 /*
11108 * In EXPLAIN, search the namespace stack for a matching WindowAgg
11109 * node (probably it's always the first entry), and print winname.
11110 */
11111 foreach(l, context->namespaces)
11112 {
11113 deparse_namespace *dpns = (deparse_namespace *) lfirst(l);
11114
11115 if (dpns->plan && IsA(dpns->plan, WindowAgg))
11116 {
11117 WindowAgg *wagg = (WindowAgg *) dpns->plan;
11118
11119 if (wagg->winref == wfunc->winref)
11120 {
11121 appendStringInfoString(buf, quote_identifier(wagg->winname));
11122 break;
11123 }
11124 }
11125 }
11126 if (l == NULL)
11127 elog(ERROR, "could not find window clause for winref %u",
11128 wfunc->winref);
11129 }
11130}
11131
11132/*
11133 * get_func_sql_syntax - Parse back a SQL-syntax function call
11134 *
11135 * Returns true if we successfully deparsed, false if we did not
11136 * recognize the function.
11137 */
11138static bool
11139get_func_sql_syntax(FuncExpr *expr, deparse_context *context)
11140{
11141 StringInfo buf = context->buf;
11142 Oid funcoid = expr->funcid;
11143
11144 switch (funcoid)
11145 {
11146 case F_TIMEZONE_INTERVAL_TIMESTAMP:
11147 case F_TIMEZONE_INTERVAL_TIMESTAMPTZ:
11148 case F_TIMEZONE_INTERVAL_TIMETZ:
11149 case F_TIMEZONE_TEXT_TIMESTAMP:
11150 case F_TIMEZONE_TEXT_TIMESTAMPTZ:
11151 case F_TIMEZONE_TEXT_TIMETZ:
11152 /* AT TIME ZONE ... note reversed argument order */
11153 appendStringInfoChar(buf, '(');
11154 get_rule_expr_paren((Node *) lsecond(expr->args), context, false,
11155 (Node *) expr);
11156 appendStringInfoString(buf, " AT TIME ZONE ");
11157 get_rule_expr_paren((Node *) linitial(expr->args), context, false,
11158 (Node *) expr);
11159 appendStringInfoChar(buf, ')');
11160 return true;
11161
11162 case F_TIMEZONE_TIMESTAMP:
11163 case F_TIMEZONE_TIMESTAMPTZ:
11164 case F_TIMEZONE_TIMETZ:
11165 /* AT LOCAL */
11166 appendStringInfoChar(buf, '(');
11167 get_rule_expr_paren((Node *) linitial(expr->args), context, false,
11168 (Node *) expr);
11169 appendStringInfoString(buf, " AT LOCAL)");
11170 return true;
11171
11172 case F_OVERLAPS_TIMESTAMPTZ_INTERVAL_TIMESTAMPTZ_INTERVAL:
11173 case F_OVERLAPS_TIMESTAMPTZ_INTERVAL_TIMESTAMPTZ_TIMESTAMPTZ:
11174 case F_OVERLAPS_TIMESTAMPTZ_TIMESTAMPTZ_TIMESTAMPTZ_INTERVAL:
11175 case F_OVERLAPS_TIMESTAMPTZ_TIMESTAMPTZ_TIMESTAMPTZ_TIMESTAMPTZ:
11176 case F_OVERLAPS_TIMESTAMP_INTERVAL_TIMESTAMP_INTERVAL:
11177 case F_OVERLAPS_TIMESTAMP_INTERVAL_TIMESTAMP_TIMESTAMP:
11178 case F_OVERLAPS_TIMESTAMP_TIMESTAMP_TIMESTAMP_INTERVAL:
11179 case F_OVERLAPS_TIMESTAMP_TIMESTAMP_TIMESTAMP_TIMESTAMP:
11180 case F_OVERLAPS_TIMETZ_TIMETZ_TIMETZ_TIMETZ:
11181 case F_OVERLAPS_TIME_INTERVAL_TIME_INTERVAL:
11182 case F_OVERLAPS_TIME_INTERVAL_TIME_TIME:
11183 case F_OVERLAPS_TIME_TIME_TIME_INTERVAL:
11184 case F_OVERLAPS_TIME_TIME_TIME_TIME:
11185 /* (x1, x2) OVERLAPS (y1, y2) */
11186 appendStringInfoString(buf, "((");
11187 get_rule_expr((Node *) linitial(expr->args), context, false);
11188 appendStringInfoString(buf, ", ");
11189 get_rule_expr((Node *) lsecond(expr->args), context, false);
11190 appendStringInfoString(buf, ") OVERLAPS (");
11191 get_rule_expr((Node *) lthird(expr->args), context, false);
11192 appendStringInfoString(buf, ", ");
11193 get_rule_expr((Node *) lfourth(expr->args), context, false);
11194 appendStringInfoString(buf, "))");
11195 return true;
11196
11197 case F_EXTRACT_TEXT_DATE:
11198 case F_EXTRACT_TEXT_TIME:
11199 case F_EXTRACT_TEXT_TIMETZ:
11200 case F_EXTRACT_TEXT_TIMESTAMP:
11201 case F_EXTRACT_TEXT_TIMESTAMPTZ:
11202 case F_EXTRACT_TEXT_INTERVAL:
11203 /* EXTRACT (x FROM y) */
11204 appendStringInfoString(buf, "EXTRACT(");
11205 {
11206 Const *con = (Const *) linitial(expr->args);
11207
11208 Assert(IsA(con, Const) &&
11209 con->consttype == TEXTOID &&
11210 !con->constisnull);
11211 appendStringInfoString(buf, TextDatumGetCString(con->constvalue));
11212 }
11213 appendStringInfoString(buf, " FROM ");
11214 get_rule_expr((Node *) lsecond(expr->args), context, false);
11215 appendStringInfoChar(buf, ')');
11216 return true;
11217
11218 case F_IS_NORMALIZED:
11219 /* IS xxx NORMALIZED */
11220 appendStringInfoChar(buf, '(');
11221 get_rule_expr_paren((Node *) linitial(expr->args), context, false,
11222 (Node *) expr);
11223 appendStringInfoString(buf, " IS");
11224 if (list_length(expr->args) == 2)
11225 {
11226 Const *con = (Const *) lsecond(expr->args);
11227
11228 Assert(IsA(con, Const) &&
11229 con->consttype == TEXTOID &&
11230 !con->constisnull);
11231 appendStringInfo(buf, " %s",
11232 TextDatumGetCString(con->constvalue));
11233 }
11234 appendStringInfoString(buf, " NORMALIZED)");
11235 return true;
11236
11237 case F_PG_COLLATION_FOR:
11238 /* COLLATION FOR */
11239 appendStringInfoString(buf, "COLLATION FOR (");
11240 get_rule_expr((Node *) linitial(expr->args), context, false);
11241 appendStringInfoChar(buf, ')');
11242 return true;
11243
11244 case F_NORMALIZE:
11245 /* NORMALIZE() */
11246 appendStringInfoString(buf, "NORMALIZE(");
11247 get_rule_expr((Node *) linitial(expr->args), context, false);
11248 if (list_length(expr->args) == 2)
11249 {
11250 Const *con = (Const *) lsecond(expr->args);
11251
11252 Assert(IsA(con, Const) &&
11253 con->consttype == TEXTOID &&
11254 !con->constisnull);
11255 appendStringInfo(buf, ", %s",
11256 TextDatumGetCString(con->constvalue));
11257 }
11258 appendStringInfoChar(buf, ')');
11259 return true;
11260
11261 case F_OVERLAY_BIT_BIT_INT4:
11262 case F_OVERLAY_BIT_BIT_INT4_INT4:
11263 case F_OVERLAY_BYTEA_BYTEA_INT4:
11264 case F_OVERLAY_BYTEA_BYTEA_INT4_INT4:
11265 case F_OVERLAY_TEXT_TEXT_INT4:
11266 case F_OVERLAY_TEXT_TEXT_INT4_INT4:
11267 /* OVERLAY() */
11268 appendStringInfoString(buf, "OVERLAY(");
11269 get_rule_expr((Node *) linitial(expr->args), context, false);
11270 appendStringInfoString(buf, " PLACING ");
11271 get_rule_expr((Node *) lsecond(expr->args), context, false);
11272 appendStringInfoString(buf, " FROM ");
11273 get_rule_expr((Node *) lthird(expr->args), context, false);
11274 if (list_length(expr->args) == 4)
11275 {
11276 appendStringInfoString(buf, " FOR ");
11277 get_rule_expr((Node *) lfourth(expr->args), context, false);
11278 }
11279 appendStringInfoChar(buf, ')');
11280 return true;
11281
11282 case F_POSITION_BIT_BIT:
11283 case F_POSITION_BYTEA_BYTEA:
11284 case F_POSITION_TEXT_TEXT:
11285 /* POSITION() ... extra parens since args are b_expr not a_expr */
11286 appendStringInfoString(buf, "POSITION((");
11287 get_rule_expr((Node *) lsecond(expr->args), context, false);
11288 appendStringInfoString(buf, ") IN (");
11289 get_rule_expr((Node *) linitial(expr->args), context, false);
11290 appendStringInfoString(buf, "))");
11291 return true;
11292
11293 case F_SUBSTRING_BIT_INT4:
11294 case F_SUBSTRING_BIT_INT4_INT4:
11295 case F_SUBSTRING_BYTEA_INT4:
11296 case F_SUBSTRING_BYTEA_INT4_INT4:
11297 case F_SUBSTRING_TEXT_INT4:
11298 case F_SUBSTRING_TEXT_INT4_INT4:
11299 /* SUBSTRING FROM/FOR (i.e., integer-position variants) */
11300 appendStringInfoString(buf, "SUBSTRING(");
11301 get_rule_expr((Node *) linitial(expr->args), context, false);
11302 appendStringInfoString(buf, " FROM ");
11303 get_rule_expr((Node *) lsecond(expr->args), context, false);
11304 if (list_length(expr->args) == 3)
11305 {
11306 appendStringInfoString(buf, " FOR ");
11307 get_rule_expr((Node *) lthird(expr->args), context, false);
11308 }
11309 appendStringInfoChar(buf, ')');
11310 return true;
11311
11312 case F_SUBSTRING_TEXT_TEXT_TEXT:
11313 /* SUBSTRING SIMILAR/ESCAPE */
11314 appendStringInfoString(buf, "SUBSTRING(");
11315 get_rule_expr((Node *) linitial(expr->args), context, false);
11316 appendStringInfoString(buf, " SIMILAR ");
11317 get_rule_expr((Node *) lsecond(expr->args), context, false);
11318 appendStringInfoString(buf, " ESCAPE ");
11319 get_rule_expr((Node *) lthird(expr->args), context, false);
11320 appendStringInfoChar(buf, ')');
11321 return true;
11322
11323 case F_BTRIM_BYTEA_BYTEA:
11324 case F_BTRIM_TEXT:
11325 case F_BTRIM_TEXT_TEXT:
11326 /* TRIM() */
11327 appendStringInfoString(buf, "TRIM(BOTH");
11328 if (list_length(expr->args) == 2)
11329 {
11330 appendStringInfoChar(buf, ' ');
11331 get_rule_expr((Node *) lsecond(expr->args), context, false);
11332 }
11333 appendStringInfoString(buf, " FROM ");
11334 get_rule_expr((Node *) linitial(expr->args), context, false);
11335 appendStringInfoChar(buf, ')');
11336 return true;
11337
11338 case F_LTRIM_BYTEA_BYTEA:
11339 case F_LTRIM_TEXT:
11340 case F_LTRIM_TEXT_TEXT:
11341 /* TRIM() */
11342 appendStringInfoString(buf, "TRIM(LEADING");
11343 if (list_length(expr->args) == 2)
11344 {
11345 appendStringInfoChar(buf, ' ');
11346 get_rule_expr((Node *) lsecond(expr->args), context, false);
11347 }
11348 appendStringInfoString(buf, " FROM ");
11349 get_rule_expr((Node *) linitial(expr->args), context, false);
11350 appendStringInfoChar(buf, ')');
11351 return true;
11352
11353 case F_RTRIM_BYTEA_BYTEA:
11354 case F_RTRIM_TEXT:
11355 case F_RTRIM_TEXT_TEXT:
11356 /* TRIM() */
11357 appendStringInfoString(buf, "TRIM(TRAILING");
11358 if (list_length(expr->args) == 2)
11359 {
11360 appendStringInfoChar(buf, ' ');
11361 get_rule_expr((Node *) lsecond(expr->args), context, false);
11362 }
11363 appendStringInfoString(buf, " FROM ");
11364 get_rule_expr((Node *) linitial(expr->args), context, false);
11365 appendStringInfoChar(buf, ')');
11366 return true;
11367
11368 case F_SYSTEM_USER:
11369 appendStringInfoString(buf, "SYSTEM_USER");
11370 return true;
11371
11372 case F_XMLEXISTS:
11373 /* XMLEXISTS ... extra parens because args are c_expr */
11374 appendStringInfoString(buf, "XMLEXISTS((");
11375 get_rule_expr((Node *) linitial(expr->args), context, false);
11376 appendStringInfoString(buf, ") PASSING (");
11377 get_rule_expr((Node *) lsecond(expr->args), context, false);
11378 appendStringInfoString(buf, "))");
11379 return true;
11380 }
11381 return false;
11382}
11383
11384/* ----------
11385 * get_coercion_expr
11386 *
11387 * Make a string representation of a value coerced to a specific type
11388 * ----------
11389 */
11390static void
11391get_coercion_expr(Node *arg, deparse_context *context,
11392 Oid resulttype, int32 resulttypmod,
11393 Node *parentNode)
11394{
11395 StringInfo buf = context->buf;
11396
11397 /*
11398 * Since parse_coerce.c doesn't immediately collapse application of
11399 * length-coercion functions to constants, what we'll typically see in
11400 * such cases is a Const with typmod -1 and a length-coercion function
11401 * right above it. Avoid generating redundant output. However, beware of
11402 * suppressing casts when the user actually wrote something like
11403 * 'foo'::text::char(3).
11404 *
11405 * Note: it might seem that we are missing the possibility of needing to
11406 * print a COLLATE clause for such a Const. However, a Const could only
11407 * have nondefault collation in a post-constant-folding tree, in which the
11408 * length coercion would have been folded too. See also the special
11409 * handling of CollateExpr in coerce_to_target_type(): any collation
11410 * marking will be above the coercion node, not below it.
11411 */
11412 if (arg && IsA(arg, Const) &&
11413 ((Const *) arg)->consttype == resulttype &&
11414 ((Const *) arg)->consttypmod == -1)
11415 {
11416 /* Show the constant without normal ::typename decoration */
11417 get_const_expr((Const *) arg, context, -1);
11418 }
11419 else
11420 {
11421 if (!PRETTY_PAREN(context))
11422 appendStringInfoChar(buf, '(');
11423 get_rule_expr_paren(arg, context, false, parentNode);
11424 if (!PRETTY_PAREN(context))
11425 appendStringInfoChar(buf, ')');
11426 }
11427
11428 /*
11429 * Never emit resulttype(arg) functional notation. A pg_proc entry could
11430 * take precedence, and a resulttype in pg_temp would require schema
11431 * qualification that format_type_with_typemod() would usually omit. We've
11432 * standardized on arg::resulttype, but CAST(arg AS resulttype) notation
11433 * would work fine.
11434 */
11435 appendStringInfo(buf, "::%s",
11436 format_type_with_typemod(resulttype, resulttypmod));
11437}
11438
11439/* ----------
11440 * get_const_expr
11441 *
11442 * Make a string representation of a Const
11443 *
11444 * showtype can be -1 to never show "::typename" decoration, or +1 to always
11445 * show it, or 0 to show it only if the constant wouldn't be assumed to be
11446 * the right type by default.
11447 *
11448 * If the Const's collation isn't default for its type, show that too.
11449 * We mustn't do this when showtype is -1 (since that means the caller will
11450 * print "::typename", and we can't put a COLLATE clause in between). It's
11451 * caller's responsibility that collation isn't missed in such cases.
11452 * ----------
11453 */
11454static void
11455get_const_expr(Const *constval, deparse_context *context, int showtype)
11456{
11457 StringInfo buf = context->buf;
11458 Oid typoutput;
11459 bool typIsVarlena;
11460 char *extval;
11461 bool needlabel = false;
11462
11463 if (constval->constisnull)
11464 {
11465 /*
11466 * Always label the type of a NULL constant to prevent misdecisions
11467 * about type when reparsing.
11468 */
11469 appendStringInfoString(buf, "NULL");
11470 if (showtype >= 0)
11471 {
11472 appendStringInfo(buf, "::%s",
11473 format_type_with_typemod(constval->consttype,
11474 constval->consttypmod));
11475 get_const_collation(constval, context);
11476 }
11477 return;
11478 }
11479
11480 getTypeOutputInfo(constval->consttype,
11481 &typoutput, &typIsVarlena);
11482
11483 extval = OidOutputFunctionCall(typoutput, constval->constvalue);
11484
11485 switch (constval->consttype)
11486 {
11487 case INT4OID:
11488
11489 /*
11490 * INT4 can be printed without any decoration, unless it is
11491 * negative; in that case print it as '-nnn'::integer to ensure
11492 * that the output will re-parse as a constant, not as a constant
11493 * plus operator. In most cases we could get away with printing
11494 * (-nnn) instead, because of the way that gram.y handles negative
11495 * literals; but that doesn't work for INT_MIN, and it doesn't
11496 * seem that much prettier anyway.
11497 */
11498 if (extval[0] != '-')
11499 appendStringInfoString(buf, extval);
11500 else
11501 {
11502 appendStringInfo(buf, "'%s'", extval);
11503 needlabel = true; /* we must attach a cast */
11504 }
11505 break;
11506
11507 case NUMERICOID:
11508
11509 /*
11510 * NUMERIC can be printed without quotes if it looks like a float
11511 * constant (not an integer, and not Infinity or NaN) and doesn't
11512 * have a leading sign (for the same reason as for INT4).
11513 */
11514 if (isdigit((unsigned char) extval[0]) &&
11515 strcspn(extval, "eE.") != strlen(extval))
11516 {
11517 appendStringInfoString(buf, extval);
11518 }
11519 else
11520 {
11521 appendStringInfo(buf, "'%s'", extval);
11522 needlabel = true; /* we must attach a cast */
11523 }
11524 break;
11525
11526 case BOOLOID:
11527 if (strcmp(extval, "t") == 0)
11528 appendStringInfoString(buf, "true");
11529 else
11530 appendStringInfoString(buf, "false");
11531 break;
11532
11533 default:
11534 simple_quote_literal(buf, extval);
11535 break;
11536 }
11537
11538 pfree(extval);
11539
11540 if (showtype < 0)
11541 return;
11542
11543 /*
11544 * For showtype == 0, append ::typename unless the constant will be
11545 * implicitly typed as the right type when it is read in.
11546 *
11547 * XXX this code has to be kept in sync with the behavior of the parser,
11548 * especially make_const.
11549 */
11550 switch (constval->consttype)
11551 {
11552 case BOOLOID:
11553 case UNKNOWNOID:
11554 /* These types can be left unlabeled */
11555 needlabel = false;
11556 break;
11557 case INT4OID:
11558 /* We determined above whether a label is needed */
11559 break;
11560 case NUMERICOID:
11561
11562 /*
11563 * Float-looking constants will be typed as numeric, which we
11564 * checked above; but if there's a nondefault typmod we need to
11565 * show it.
11566 */
11567 needlabel |= (constval->consttypmod >= 0);
11568 break;
11569 default:
11570 needlabel = true;
11571 break;
11572 }
11573 if (needlabel || showtype > 0)
11574 appendStringInfo(buf, "::%s",
11575 format_type_with_typemod(constval->consttype,
11576 constval->consttypmod));
11577
11578 get_const_collation(constval, context);
11579}
11580
11581/*
11582 * helper for get_const_expr: append COLLATE if needed
11583 */
11584static void
11585get_const_collation(Const *constval, deparse_context *context)
11586{
11587 StringInfo buf = context->buf;
11588
11589 if (OidIsValid(constval->constcollid))
11590 {
11591 Oid typcollation = get_typcollation(constval->consttype);
11592
11593 if (constval->constcollid != typcollation)
11594 {
11595 appendStringInfo(buf, " COLLATE %s",
11596 generate_collation_name(constval->constcollid));
11597 }
11598 }
11599}
11600
11601/*
11602 * get_json_path_spec - Parse back a JSON path specification
11603 */
11604static void
11605get_json_path_spec(Node *path_spec, deparse_context *context, bool showimplicit)
11606{
11607 if (IsA(path_spec, Const))
11608 get_const_expr((Const *) path_spec, context, -1);
11609 else
11610 get_rule_expr(path_spec, context, showimplicit);
11611}
11612
11613/*
11614 * get_json_format - Parse back a JsonFormat node
11615 */
11616static void
11617get_json_format(JsonFormat *format, StringInfo buf)
11618{
11619 if (format->format_type == JS_FORMAT_DEFAULT)
11620 return;
11621
11622 appendStringInfoString(buf,
11623 format->format_type == JS_FORMAT_JSONB ?
11624 " FORMAT JSONB" : " FORMAT JSON");
11625
11626 if (format->encoding != JS_ENC_DEFAULT)
11627 {
11628 const char *encoding;
11629
11630 encoding =
11631 format->encoding == JS_ENC_UTF16 ? "UTF16" :
11632 format->encoding == JS_ENC_UTF32 ? "UTF32" : "UTF8";
11633
11634 appendStringInfo(buf, " ENCODING %s", encoding);
11635 }
11636}
11637
11638/*
11639 * get_json_returning - Parse back a JsonReturning structure
11640 */
11641static void
11642get_json_returning(JsonReturning *returning, StringInfo buf,
11643 bool json_format_by_default)
11644{
11645 if (!OidIsValid(returning->typid))
11646 return;
11647
11648 appendStringInfo(buf, " RETURNING %s",
11649 format_type_with_typemod(returning->typid,
11650 returning->typmod));
11651
11652 if (!json_format_by_default ||
11653 returning->format->format_type !=
11654 (returning->typid == JSONBOID ? JS_FORMAT_JSONB : JS_FORMAT_JSON))
11655 get_json_format(returning->format, buf);
11656}
11657
11658/*
11659 * get_json_constructor - Parse back a JsonConstructorExpr node
11660 */
11661static void
11662get_json_constructor(JsonConstructorExpr *ctor, deparse_context *context,
11663 bool showimplicit)
11664{
11665 StringInfo buf = context->buf;
11666 const char *funcname;
11667 bool is_json_object;
11668 int curridx;
11669 ListCell *lc;
11670
11671 if (ctor->type == JSCTOR_JSON_OBJECTAGG)
11672 {
11673 get_json_agg_constructor(ctor, context, "JSON_OBJECTAGG", true);
11674 return;
11675 }
11676 else if (ctor->type == JSCTOR_JSON_ARRAYAGG)
11677 {
11678 get_json_agg_constructor(ctor, context, "JSON_ARRAYAGG", false);
11679 return;
11680 }
11681
11682 switch (ctor->type)
11683 {
11684 case JSCTOR_JSON_OBJECT:
11685 funcname = "JSON_OBJECT";
11686 break;
11687 case JSCTOR_JSON_ARRAY:
11688 funcname = "JSON_ARRAY";
11689 break;
11690 case JSCTOR_JSON_PARSE:
11691 funcname = "JSON";
11692 break;
11693 case JSCTOR_JSON_SCALAR:
11694 funcname = "JSON_SCALAR";
11695 break;
11696 case JSCTOR_JSON_SERIALIZE:
11697 funcname = "JSON_SERIALIZE";
11698 break;
11699 default:
11700 elog(ERROR, "invalid JsonConstructorType %d", ctor->type);
11701 }
11702
11703 appendStringInfo(buf, "%s(", funcname);
11704
11705 is_json_object = ctor->type == JSCTOR_JSON_OBJECT;
11706 foreach(lc, ctor->args)
11707 {
11708 curridx = foreach_current_index(lc);
11709 if (curridx > 0)
11710 {
11711 const char *sep;
11712
11713 sep = (is_json_object && (curridx % 2) != 0) ? " : " : ", ";
11714 appendStringInfoString(buf, sep);
11715 }
11716
11717 get_rule_expr((Node *) lfirst(lc), context, true);
11718 }
11719
11720 get_json_constructor_options(ctor, buf);
11721 appendStringInfoChar(buf, ')');
11722}
11723
11724/*
11725 * Append options, if any, to the JSON constructor being deparsed
11726 */
11727static void
11728get_json_constructor_options(JsonConstructorExpr *ctor, StringInfo buf)
11729{
11730 if (ctor->absent_on_null)
11731 {
11732 if (ctor->type == JSCTOR_JSON_OBJECT ||
11733 ctor->type == JSCTOR_JSON_OBJECTAGG)
11734 appendStringInfoString(buf, " ABSENT ON NULL");
11735 }
11736 else
11737 {
11738 if (ctor->type == JSCTOR_JSON_ARRAY ||
11739 ctor->type == JSCTOR_JSON_ARRAYAGG)
11740 appendStringInfoString(buf, " NULL ON NULL");
11741 }
11742
11743 if (ctor->unique)
11744 appendStringInfoString(buf, " WITH UNIQUE KEYS");
11745
11746 /*
11747 * Append RETURNING clause if needed; JSON() and JSON_SCALAR() don't
11748 * support one.
11749 */
11750 if (ctor->type != JSCTOR_JSON_PARSE && ctor->type != JSCTOR_JSON_SCALAR)
11751 get_json_returning(ctor->returning, buf, true);
11752}
11753
11754/*
11755 * get_json_agg_constructor - Parse back an aggregate JsonConstructorExpr node
11756 */
11757static void
11758get_json_agg_constructor(JsonConstructorExpr *ctor, deparse_context *context,
11759 const char *funcname, bool is_json_objectagg)
11760{
11761 StringInfoData options;
11762
11763 initStringInfo(&options);
11764 get_json_constructor_options(ctor, &options);
11765
11766 if (IsA(ctor->func, Aggref))
11767 get_agg_expr_helper((Aggref *) ctor->func, context,
11768 (Aggref *) ctor->func,
11769 funcname, options.data, is_json_objectagg);
11770 else if (IsA(ctor->func, WindowFunc))
11771 get_windowfunc_expr_helper((WindowFunc *) ctor->func, context,
11772 funcname, options.data,
11773 is_json_objectagg);
11774 else
11775 elog(ERROR, "invalid JsonConstructorExpr underlying node type: %d",
11776 nodeTag(ctor->func));
11777}
11778
11779/*
11780 * simple_quote_literal - Format a string as a SQL literal, append to buf
11781 */
11782static void
11783simple_quote_literal(StringInfo buf, const char *val)
11784{
11785 const char *valptr;
11786
11787 /*
11788 * We form the string literal according to the prevailing setting of
11789 * standard_conforming_strings; we never use E''. User is responsible for
11790 * making sure result is used correctly.
11791 */
11792 appendStringInfoChar(buf, '\'');
11793 for (valptr = val; *valptr; valptr++)
11794 {
11795 char ch = *valptr;
11796
11797 if (SQL_STR_DOUBLE(ch, !standard_conforming_strings))
11798 appendStringInfoChar(buf, ch);
11799 appendStringInfoChar(buf, ch);
11800 }
11801 appendStringInfoChar(buf, '\'');
11802}
11803
11804
11805/* ----------
11806 * get_sublink_expr - Parse back a sublink
11807 * ----------
11808 */
11809static void
11810get_sublink_expr(SubLink *sublink, deparse_context *context)
11811{
11812 StringInfo buf = context->buf;
11813 Query *query = (Query *) (sublink->subselect);
11814 char *opname = NULL;
11815 bool need_paren;
11816
11817 if (sublink->subLinkType == ARRAY_SUBLINK)
11818 appendStringInfoString(buf, "ARRAY(");
11819 else
11820 appendStringInfoChar(buf, '(');
11821
11822 /*
11823 * Note that we print the name of only the first operator, when there are
11824 * multiple combining operators. This is an approximation that could go
11825 * wrong in various scenarios (operators in different schemas, renamed
11826 * operators, etc) but there is not a whole lot we can do about it, since
11827 * the syntax allows only one operator to be shown.
11828 */
11829 if (sublink->testexpr)
11830 {
11831 if (IsA(sublink->testexpr, OpExpr))
11832 {
11833 /* single combining operator */
11834 OpExpr *opexpr = (OpExpr *) sublink->testexpr;
11835
11836 get_rule_expr(linitial(opexpr->args), context, true);
11837 opname = generate_operator_name(opexpr->opno,
11838 exprType(linitial(opexpr->args)),
11839 exprType(lsecond(opexpr->args)));
11840 }
11841 else if (IsA(sublink->testexpr, BoolExpr))
11842 {
11843 /* multiple combining operators, = or <> cases */
11844 char *sep;
11845 ListCell *l;
11846
11847 appendStringInfoChar(buf, '(');
11848 sep = "";
11849 foreach(l, ((BoolExpr *) sublink->testexpr)->args)
11850 {
11851 OpExpr *opexpr = lfirst_node(OpExpr, l);
11852
11853 appendStringInfoString(buf, sep);
11854 get_rule_expr(linitial(opexpr->args), context, true);
11855 if (!opname)
11856 opname = generate_operator_name(opexpr->opno,
11857 exprType(linitial(opexpr->args)),
11858 exprType(lsecond(opexpr->args)));
11859 sep = ", ";
11860 }
11861 appendStringInfoChar(buf, ')');
11862 }
11863 else if (IsA(sublink->testexpr, RowCompareExpr))
11864 {
11865 /* multiple combining operators, < <= > >= cases */
11866 RowCompareExpr *rcexpr = (RowCompareExpr *) sublink->testexpr;
11867
11868 appendStringInfoChar(buf, '(');
11869 get_rule_expr((Node *) rcexpr->largs, context, true);
11870 opname = generate_operator_name(linitial_oid(rcexpr->opnos),
11871 exprType(linitial(rcexpr->largs)),
11872 exprType(linitial(rcexpr->rargs)));
11873 appendStringInfoChar(buf, ')');
11874 }
11875 else
11876 elog(ERROR, "unrecognized testexpr type: %d",
11877 (int) nodeTag(sublink->testexpr));
11878 }
11879
11880 need_paren = true;
11881
11882 switch (sublink->subLinkType)
11883 {
11884 case EXISTS_SUBLINK:
11885 appendStringInfoString(buf, "EXISTS ");
11886 break;
11887
11888 case ANY_SUBLINK:
11889 if (strcmp(opname, "=") == 0) /* Represent = ANY as IN */
11890 appendStringInfoString(buf, " IN ");
11891 else
11892 appendStringInfo(buf, " %s ANY ", opname);
11893 break;
11894
11895 case ALL_SUBLINK:
11896 appendStringInfo(buf, " %s ALL ", opname);
11897 break;
11898
11899 case ROWCOMPARE_SUBLINK:
11900 appendStringInfo(buf, " %s ", opname);
11901 break;
11902
11903 case EXPR_SUBLINK:
11904 case MULTIEXPR_SUBLINK:
11905 case ARRAY_SUBLINK:
11906 need_paren = false;
11907 break;
11908
11909 case CTE_SUBLINK: /* shouldn't occur in a SubLink */
11910 default:
11911 elog(ERROR, "unrecognized sublink type: %d",
11912 (int) sublink->subLinkType);
11913 break;
11914 }
11915
11916 if (need_paren)
11917 appendStringInfoChar(buf, '(');
11918
11919 get_query_def(query, buf, context->namespaces, NULL, false,
11920 context->prettyFlags, context->wrapColumn,
11921 context->indentLevel);
11922
11923 if (need_paren)
11924 appendStringInfoString(buf, "))");
11925 else
11926 appendStringInfoChar(buf, ')');
11927}
11928
11929
11930/* ----------
11931 * get_xmltable - Parse back a XMLTABLE function
11932 * ----------
11933 */
11934static void
11935get_xmltable(TableFunc *tf, deparse_context *context, bool showimplicit)
11936{
11937 StringInfo buf = context->buf;
11938
11939 appendStringInfoString(buf, "XMLTABLE(");
11940
11941 if (tf->ns_uris != NIL)
11942 {
11943 ListCell *lc1,
11944 *lc2;
11945 bool first = true;
11946
11947 appendStringInfoString(buf, "XMLNAMESPACES (");
11948 forboth(lc1, tf->ns_uris, lc2, tf->ns_names)
11949 {
11950 Node *expr = (Node *) lfirst(lc1);
11951 String *ns_node = lfirst_node(String, lc2);
11952
11953 if (!first)
11954 appendStringInfoString(buf, ", ");
11955 else
11956 first = false;
11957
11958 if (ns_node != NULL)
11959 {
11960 get_rule_expr(expr, context, showimplicit);
11961 appendStringInfo(buf, " AS %s",
11962 quote_identifier(strVal(ns_node)));
11963 }
11964 else
11965 {
11966 appendStringInfoString(buf, "DEFAULT ");
11967 get_rule_expr(expr, context, showimplicit);
11968 }
11969 }
11970 appendStringInfoString(buf, "), ");
11971 }
11972
11973 appendStringInfoChar(buf, '(');
11974 get_rule_expr((Node *) tf->rowexpr, context, showimplicit);
11975 appendStringInfoString(buf, ") PASSING (");
11976 get_rule_expr((Node *) tf->docexpr, context, showimplicit);
11977 appendStringInfoChar(buf, ')');
11978
11979 if (tf->colexprs != NIL)
11980 {
11981 ListCell *l1;
11982 ListCell *l2;
11983 ListCell *l3;
11984 ListCell *l4;
11985 ListCell *l5;
11986 int colnum = 0;
11987
11988 appendStringInfoString(buf, " COLUMNS ");
11989 forfive(l1, tf->colnames, l2, tf->coltypes, l3, tf->coltypmods,
11990 l4, tf->colexprs, l5, tf->coldefexprs)
11991 {
11992 char *colname = strVal(lfirst(l1));
11993 Oid typid = lfirst_oid(l2);
11994 int32 typmod = lfirst_int(l3);
11995 Node *colexpr = (Node *) lfirst(l4);
11996 Node *coldefexpr = (Node *) lfirst(l5);
11997 bool ordinality = (tf->ordinalitycol == colnum);
11998 bool notnull = bms_is_member(colnum, tf->notnulls);
11999
12000 if (colnum > 0)
12001 appendStringInfoString(buf, ", ");
12002 colnum++;
12003
12004 appendStringInfo(buf, "%s %s", quote_identifier(colname),
12005 ordinality ? "FOR ORDINALITY" :
12006 format_type_with_typemod(typid, typmod));
12007 if (ordinality)
12008 continue;
12009
12010 if (coldefexpr != NULL)
12011 {
12012 appendStringInfoString(buf, " DEFAULT (");
12013 get_rule_expr((Node *) coldefexpr, context, showimplicit);
12014 appendStringInfoChar(buf, ')');
12015 }
12016 if (colexpr != NULL)
12017 {
12018 appendStringInfoString(buf, " PATH (");
12019 get_rule_expr((Node *) colexpr, context, showimplicit);
12020 appendStringInfoChar(buf, ')');
12021 }
12022 if (notnull)
12023 appendStringInfoString(buf, " NOT NULL");
12024 }
12025 }
12026
12027 appendStringInfoChar(buf, ')');
12028}
12029
12030/*
12031 * get_json_table_nested_columns - Parse back nested JSON_TABLE columns
12032 */
12033static void
12034get_json_table_nested_columns(TableFunc *tf, JsonTablePlan *plan,
12035 deparse_context *context, bool showimplicit,
12036 bool needcomma)
12037{
12038 if (IsA(plan, JsonTablePathScan))
12039 {
12040 JsonTablePathScan *scan = castNode(JsonTablePathScan, plan);
12041
12042 if (needcomma)
12043 appendStringInfoChar(context->buf, ',');
12044
12045 appendStringInfoChar(context->buf, ' ');
12046 appendContextKeyword(context, "NESTED PATH ", 0, 0, 0);
12047 get_const_expr(scan->path->value, context, -1);
12048 appendStringInfo(context->buf, " AS %s", quote_identifier(scan->path->name));
12049 get_json_table_columns(tf, scan, context, showimplicit);
12050 }
12051 else if (IsA(plan, JsonTableSiblingJoin))
12052 {
12053 JsonTableSiblingJoin *join = (JsonTableSiblingJoin *) plan;
12054
12055 get_json_table_nested_columns(tf, join->lplan, context, showimplicit,
12056 needcomma);
12057 get_json_table_nested_columns(tf, join->rplan, context, showimplicit,
12058 true);
12059 }
12060}
12061
12062/*
12063 * get_json_table_columns - Parse back JSON_TABLE columns
12064 */
12065static void
12066get_json_table_columns(TableFunc *tf, JsonTablePathScan *scan,
12067 deparse_context *context,
12068 bool showimplicit)
12069{
12070 StringInfo buf = context->buf;
12071 ListCell *lc_colname;
12072 ListCell *lc_coltype;
12073 ListCell *lc_coltypmod;
12074 ListCell *lc_colvalexpr;
12075 int colnum = 0;
12076
12077 appendStringInfoChar(buf, ' ');
12078 appendContextKeyword(context, "COLUMNS (", 0, 0, 0);
12079
12080 if (PRETTY_INDENT(context))
12081 context->indentLevel += PRETTYINDENT_VAR;
12082
12083 forfour(lc_colname, tf->colnames,
12084 lc_coltype, tf->coltypes,
12085 lc_coltypmod, tf->coltypmods,
12086 lc_colvalexpr, tf->colvalexprs)
12087 {
12088 char *colname = strVal(lfirst(lc_colname));
12089 JsonExpr *colexpr;
12090 Oid typid;
12091 int32 typmod;
12092 bool ordinality;
12093 JsonBehaviorType default_behavior;
12094
12095 typid = lfirst_oid(lc_coltype);
12096 typmod = lfirst_int(lc_coltypmod);
12097 colexpr = castNode(JsonExpr, lfirst(lc_colvalexpr));
12098
12099 /* Skip columns that don't belong to this scan. */
12100 if (scan->colMin < 0 || colnum < scan->colMin)
12101 {
12102 colnum++;
12103 continue;
12104 }
12105 if (colnum > scan->colMax)
12106 break;
12107
12108 if (colnum > scan->colMin)
12109 appendStringInfoString(buf, ", ");
12110
12111 colnum++;
12112
12113 ordinality = !colexpr;
12114
12115 appendContextKeyword(context, "", 0, 0, 0);
12116
12117 appendStringInfo(buf, "%s %s", quote_identifier(colname),
12118 ordinality ? "FOR ORDINALITY" :
12119 format_type_with_typemod(typid, typmod));
12120 if (ordinality)
12121 continue;
12122
12123 /*
12124 * Set default_behavior to guide get_json_expr_options() on whether to
12125 * to emit the ON ERROR / EMPTY clauses.
12126 */
12127 if (colexpr->op == JSON_EXISTS_OP)
12128 {
12129 appendStringInfoString(buf, " EXISTS");
12130 default_behavior = JSON_BEHAVIOR_FALSE;
12131 }
12132 else
12133 {
12134 if (colexpr->op == JSON_QUERY_OP)
12135 {
12136 char typcategory;
12137 bool typispreferred;
12138
12139 get_type_category_preferred(typid, &typcategory, &typispreferred);
12140
12141 if (typcategory == TYPCATEGORY_STRING)
12142 appendStringInfoString(buf,
12143 colexpr->format->format_type == JS_FORMAT_JSONB ?
12144 " FORMAT JSONB" : " FORMAT JSON");
12145 }
12146
12147 default_behavior = JSON_BEHAVIOR_NULL;
12148 }
12149
12150 appendStringInfoString(buf, " PATH ");
12151
12152 get_json_path_spec(colexpr->path_spec, context, showimplicit);
12153
12154 get_json_expr_options(colexpr, context, default_behavior);
12155 }
12156
12157 if (scan->child)
12158 get_json_table_nested_columns(tf, scan->child, context, showimplicit,
12159 scan->colMin >= 0);
12160
12161 if (PRETTY_INDENT(context))
12162 context->indentLevel -= PRETTYINDENT_VAR;
12163
12164 appendContextKeyword(context, ")", 0, 0, 0);
12165}
12166
12167/* ----------
12168 * get_json_table - Parse back a JSON_TABLE function
12169 * ----------
12170 */
12171static void
12172get_json_table(TableFunc *tf, deparse_context *context, bool showimplicit)
12173{
12174 StringInfo buf = context->buf;
12175 JsonExpr *jexpr = castNode(JsonExpr, tf->docexpr);
12176 JsonTablePathScan *root = castNode(JsonTablePathScan, tf->plan);
12177
12178 appendStringInfoString(buf, "JSON_TABLE(");
12179
12180 if (PRETTY_INDENT(context))
12181 context->indentLevel += PRETTYINDENT_VAR;
12182
12183 appendContextKeyword(context, "", 0, 0, 0);
12184
12185 get_rule_expr(jexpr->formatted_expr, context, showimplicit);
12186
12187 appendStringInfoString(buf, ", ");
12188
12189 get_const_expr(root->path->value, context, -1);
12190
12191 appendStringInfo(buf, " AS %s", quote_identifier(root->path->name));
12192
12193 if (jexpr->passing_values)
12194 {
12195 ListCell *lc1,
12196 *lc2;
12197 bool needcomma = false;
12198
12199 appendStringInfoChar(buf, ' ');
12200 appendContextKeyword(context, "PASSING ", 0, 0, 0);
12201
12202 if (PRETTY_INDENT(context))
12203 context->indentLevel += PRETTYINDENT_VAR;
12204
12205 forboth(lc1, jexpr->passing_names,
12206 lc2, jexpr->passing_values)
12207 {
12208 if (needcomma)
12209 appendStringInfoString(buf, ", ");
12210 needcomma = true;
12211
12212 appendContextKeyword(context, "", 0, 0, 0);
12213
12214 get_rule_expr((Node *) lfirst(lc2), context, false);
12215 appendStringInfo(buf, " AS %s",
12216 quote_identifier((lfirst_node(String, lc1))->sval)
12217 );
12218 }
12219
12220 if (PRETTY_INDENT(context))
12221 context->indentLevel -= PRETTYINDENT_VAR;
12222 }
12223
12224 get_json_table_columns(tf, castNode(JsonTablePathScan, tf->plan), context,
12225 showimplicit);
12226
12227 if (jexpr->on_error->btype != JSON_BEHAVIOR_EMPTY_ARRAY)
12228 get_json_behavior(jexpr->on_error, context, "ERROR");
12229
12230 if (PRETTY_INDENT(context))
12231 context->indentLevel -= PRETTYINDENT_VAR;
12232
12233 appendContextKeyword(context, ")", 0, 0, 0);
12234}
12235
12236/* ----------
12237 * get_tablefunc - Parse back a table function
12238 * ----------
12239 */
12240static void
12241get_tablefunc(TableFunc *tf, deparse_context *context, bool showimplicit)
12242{
12243 /* XMLTABLE and JSON_TABLE are the only existing implementations. */
12244
12245 if (tf->functype == TFT_XMLTABLE)
12246 get_xmltable(tf, context, showimplicit);
12247 else if (tf->functype == TFT_JSON_TABLE)
12248 get_json_table(tf, context, showimplicit);
12249}
12250
12251/* ----------
12252 * get_from_clause - Parse back a FROM clause
12253 *
12254 * "prefix" is the keyword that denotes the start of the list of FROM
12255 * elements. It is FROM when used to parse back SELECT and UPDATE, but
12256 * is USING when parsing back DELETE.
12257 * ----------
12258 */
12259static void
12260get_from_clause(Query *query, const char *prefix, deparse_context *context)
12261{
12262 StringInfo buf = context->buf;
12263 bool first = true;
12264 ListCell *l;
12265
12266 /*
12267 * We use the query's jointree as a guide to what to print. However, we
12268 * must ignore auto-added RTEs that are marked not inFromCl. (These can
12269 * only appear at the top level of the jointree, so it's sufficient to
12270 * check here.) This check also ensures we ignore the rule pseudo-RTEs
12271 * for NEW and OLD.
12272 */
12273 foreach(l, query->jointree->fromlist)
12274 {
12275 Node *jtnode = (Node *) lfirst(l);
12276
12277 if (IsA(jtnode, RangeTblRef))
12278 {
12279 int varno = ((RangeTblRef *) jtnode)->rtindex;
12280 RangeTblEntry *rte = rt_fetch(varno, query->rtable);
12281
12282 if (!rte->inFromCl)
12283 continue;
12284 }
12285
12286 if (first)
12287 {
12288 appendContextKeyword(context, prefix,
12289 -PRETTYINDENT_STD, PRETTYINDENT_STD, 2);
12290 first = false;
12291
12292 get_from_clause_item(jtnode, query, context);
12293 }
12294 else
12295 {
12296 StringInfoData itembuf;
12297
12298 appendStringInfoString(buf, ", ");
12299
12300 /*
12301 * Put the new FROM item's text into itembuf so we can decide
12302 * after we've got it whether or not it needs to go on a new line.
12303 */
12304 initStringInfo(&itembuf);
12305 context->buf = &itembuf;
12306
12307 get_from_clause_item(jtnode, query, context);
12308
12309 /* Restore context's output buffer */
12310 context->buf = buf;
12311
12312 /* Consider line-wrapping if enabled */
12313 if (PRETTY_INDENT(context) && context->wrapColumn >= 0)
12314 {
12315 /* Does the new item start with a new line? */
12316 if (itembuf.len > 0 && itembuf.data[0] == '\n')
12317 {
12318 /* If so, we shouldn't add anything */
12319 /* instead, remove any trailing spaces currently in buf */
12320 removeStringInfoSpaces(buf);
12321 }
12322 else
12323 {
12324 char *trailing_nl;
12325
12326 /* Locate the start of the current line in the buffer */
12327 trailing_nl = strrchr(buf->data, '\n');
12328 if (trailing_nl == NULL)
12329 trailing_nl = buf->data;
12330 else
12331 trailing_nl++;
12332
12333 /*
12334 * Add a newline, plus some indentation, if the new item
12335 * would cause an overflow.
12336 */
12337 if (strlen(trailing_nl) + itembuf.len > context->wrapColumn)
12338 appendContextKeyword(context, "", -PRETTYINDENT_STD,
12339 PRETTYINDENT_STD,
12340 PRETTYINDENT_VAR);
12341 }
12342 }
12343
12344 /* Add the new item */
12345 appendBinaryStringInfo(buf, itembuf.data, itembuf.len);
12346
12347 /* clean up */
12348 pfree(itembuf.data);
12349 }
12350 }
12351}
12352
12353static void
12354get_from_clause_item(Node *jtnode, Query *query, deparse_context *context)
12355{
12356 StringInfo buf = context->buf;
12357 deparse_namespace *dpns = (deparse_namespace *) linitial(context->namespaces);
12358
12359 if (IsA(jtnode, RangeTblRef))
12360 {
12361 int varno = ((RangeTblRef *) jtnode)->rtindex;
12362 RangeTblEntry *rte = rt_fetch(varno, query->rtable);
12363 deparse_columns *colinfo = deparse_columns_fetch(varno, dpns);
12364 RangeTblFunction *rtfunc1 = NULL;
12365
12366 if (rte->lateral)
12367 appendStringInfoString(buf, "LATERAL ");
12368
12369 /* Print the FROM item proper */
12370 switch (rte->rtekind)
12371 {
12372 case RTE_RELATION:
12373 /* Normal relation RTE */
12374 appendStringInfo(buf, "%s%s",
12375 only_marker(rte),
12376 generate_relation_name(rte->relid,
12377 context->namespaces));
12378 break;
12379 case RTE_SUBQUERY:
12380 /* Subquery RTE */
12381 appendStringInfoChar(buf, '(');
12382 get_query_def(rte->subquery, buf, context->namespaces, NULL,
12383 true,
12384 context->prettyFlags, context->wrapColumn,
12385 context->indentLevel);
12386 appendStringInfoChar(buf, ')');
12387 break;
12388 case RTE_FUNCTION:
12389 /* Function RTE */
12390 rtfunc1 = (RangeTblFunction *) linitial(rte->functions);
12391
12392 /*
12393 * Omit ROWS FROM() syntax for just one function, unless it
12394 * has both a coldeflist and WITH ORDINALITY. If it has both,
12395 * we must use ROWS FROM() syntax to avoid ambiguity about
12396 * whether the coldeflist includes the ordinality column.
12397 */
12398 if (list_length(rte->functions) == 1 &&
12399 (rtfunc1->funccolnames == NIL || !rte->funcordinality))
12400 {
12401 get_rule_expr_funccall(rtfunc1->funcexpr, context, true);
12402 /* we'll print the coldeflist below, if it has one */
12403 }
12404 else
12405 {
12406 bool all_unnest;
12407 ListCell *lc;
12408
12409 /*
12410 * If all the function calls in the list are to unnest,
12411 * and none need a coldeflist, then collapse the list back
12412 * down to UNNEST(args). (If we had more than one
12413 * built-in unnest function, this would get more
12414 * difficult.)
12415 *
12416 * XXX This is pretty ugly, since it makes not-terribly-
12417 * future-proof assumptions about what the parser would do
12418 * with the output; but the alternative is to emit our
12419 * nonstandard ROWS FROM() notation for what might have
12420 * been a perfectly spec-compliant multi-argument
12421 * UNNEST().
12422 */
12423 all_unnest = true;
12424 foreach(lc, rte->functions)
12425 {
12426 RangeTblFunction *rtfunc = (RangeTblFunction *) lfirst(lc);
12427
12428 if (!IsA(rtfunc->funcexpr, FuncExpr) ||
12429 ((FuncExpr *) rtfunc->funcexpr)->funcid != F_UNNEST_ANYARRAY ||
12430 rtfunc->funccolnames != NIL)
12431 {
12432 all_unnest = false;
12433 break;
12434 }
12435 }
12436
12437 if (all_unnest)
12438 {
12439 List *allargs = NIL;
12440
12441 foreach(lc, rte->functions)
12442 {
12443 RangeTblFunction *rtfunc = (RangeTblFunction *) lfirst(lc);
12444 List *args = ((FuncExpr *) rtfunc->funcexpr)->args;
12445
12446 allargs = list_concat(allargs, args);
12447 }
12448
12449 appendStringInfoString(buf, "UNNEST(");
12450 get_rule_expr((Node *) allargs, context, true);
12451 appendStringInfoChar(buf, ')');
12452 }
12453 else
12454 {
12455 int funcno = 0;
12456
12457 appendStringInfoString(buf, "ROWS FROM(");
12458 foreach(lc, rte->functions)
12459 {
12460 RangeTblFunction *rtfunc = (RangeTblFunction *) lfirst(lc);
12461
12462 if (funcno > 0)
12463 appendStringInfoString(buf, ", ");
12464 get_rule_expr_funccall(rtfunc->funcexpr, context, true);
12465 if (rtfunc->funccolnames != NIL)
12466 {
12467 /* Reconstruct the column definition list */
12468 appendStringInfoString(buf, " AS ");
12469 get_from_clause_coldeflist(rtfunc,
12470 NULL,
12471 context);
12472 }
12473 funcno++;
12474 }
12475 appendStringInfoChar(buf, ')');
12476 }
12477 /* prevent printing duplicate coldeflist below */
12478 rtfunc1 = NULL;
12479 }
12480 if (rte->funcordinality)
12481 appendStringInfoString(buf, " WITH ORDINALITY");
12482 break;
12483 case RTE_TABLEFUNC:
12484 get_tablefunc(rte->tablefunc, context, true);
12485 break;
12486 case RTE_VALUES:
12487 /* Values list RTE */
12488 appendStringInfoChar(buf, '(');
12489 get_values_def(rte->values_lists, context);
12490 appendStringInfoChar(buf, ')');
12491 break;
12492 case RTE_CTE:
12493 appendStringInfoString(buf, quote_identifier(rte->ctename));
12494 break;
12495 default:
12496 elog(ERROR, "unrecognized RTE kind: %d", (int) rte->rtekind);
12497 break;
12498 }
12499
12500 /* Print the relation alias, if needed */
12501 get_rte_alias(rte, varno, false, context);
12502
12503 /* Print the column definitions or aliases, if needed */
12504 if (rtfunc1 && rtfunc1->funccolnames != NIL)
12505 {
12506 /* Reconstruct the columndef list, which is also the aliases */
12507 get_from_clause_coldeflist(rtfunc1, colinfo, context);
12508 }
12509 else
12510 {
12511 /* Else print column aliases as needed */
12512 get_column_alias_list(colinfo, context);
12513 }
12514
12515 /* Tablesample clause must go after any alias */
12516 if (rte->rtekind == RTE_RELATION && rte->tablesample)
12517 get_tablesample_def(rte->tablesample, context);
12518 }
12519 else if (IsA(jtnode, JoinExpr))
12520 {
12521 JoinExpr *j = (JoinExpr *) jtnode;
12522 deparse_columns *colinfo = deparse_columns_fetch(j->rtindex, dpns);
12523 bool need_paren_on_right;
12524
12525 need_paren_on_right = PRETTY_PAREN(context) &&
12526 !IsA(j->rarg, RangeTblRef) &&
12527 !(IsA(j->rarg, JoinExpr) && ((JoinExpr *) j->rarg)->alias != NULL);
12528
12529 if (!PRETTY_PAREN(context) || j->alias != NULL)
12530 appendStringInfoChar(buf, '(');
12531
12532 get_from_clause_item(j->larg, query, context);
12533
12534 switch (j->jointype)
12535 {
12536 case JOIN_INNER:
12537 if (j->quals)
12538 appendContextKeyword(context, " JOIN ",
12539 -PRETTYINDENT_STD,
12540 PRETTYINDENT_STD,
12541 PRETTYINDENT_JOIN);
12542 else
12543 appendContextKeyword(context, " CROSS JOIN ",
12544 -PRETTYINDENT_STD,
12545 PRETTYINDENT_STD,
12546 PRETTYINDENT_JOIN);
12547 break;
12548 case JOIN_LEFT:
12549 appendContextKeyword(context, " LEFT JOIN ",
12550 -PRETTYINDENT_STD,
12551 PRETTYINDENT_STD,
12552 PRETTYINDENT_JOIN);
12553 break;
12554 case JOIN_FULL:
12555 appendContextKeyword(context, " FULL JOIN ",
12556 -PRETTYINDENT_STD,
12557 PRETTYINDENT_STD,
12558 PRETTYINDENT_JOIN);
12559 break;
12560 case JOIN_RIGHT:
12561 appendContextKeyword(context, " RIGHT JOIN ",
12562 -PRETTYINDENT_STD,
12563 PRETTYINDENT_STD,
12564 PRETTYINDENT_JOIN);
12565 break;
12566 default:
12567 elog(ERROR, "unrecognized join type: %d",
12568 (int) j->jointype);
12569 }
12570
12571 if (need_paren_on_right)
12572 appendStringInfoChar(buf, '(');
12573 get_from_clause_item(j->rarg, query, context);
12574 if (need_paren_on_right)
12575 appendStringInfoChar(buf, ')');
12576
12577 if (j->usingClause)
12578 {
12579 ListCell *lc;
12580 bool first = true;
12581
12582 appendStringInfoString(buf, " USING (");
12583 /* Use the assigned names, not what's in usingClause */
12584 foreach(lc, colinfo->usingNames)
12585 {
12586 char *colname = (char *) lfirst(lc);
12587
12588 if (first)
12589 first = false;
12590 else
12591 appendStringInfoString(buf, ", ");
12592 appendStringInfoString(buf, quote_identifier(colname));
12593 }
12594 appendStringInfoChar(buf, ')');
12595
12596 if (j->join_using_alias)
12597 appendStringInfo(buf, " AS %s",
12598 quote_identifier(j->join_using_alias->aliasname));
12599 }
12600 else if (j->quals)
12601 {
12602 appendStringInfoString(buf, " ON ");
12603 if (!PRETTY_PAREN(context))
12604 appendStringInfoChar(buf, '(');
12605 get_rule_expr(j->quals, context, false);
12606 if (!PRETTY_PAREN(context))
12607 appendStringInfoChar(buf, ')');
12608 }
12609 else if (j->jointype != JOIN_INNER)
12610 {
12611 /* If we didn't say CROSS JOIN above, we must provide an ON */
12612 appendStringInfoString(buf, " ON TRUE");
12613 }
12614
12615 if (!PRETTY_PAREN(context) || j->alias != NULL)
12616 appendStringInfoChar(buf, ')');
12617
12618 /* Yes, it's correct to put alias after the right paren ... */
12619 if (j->alias != NULL)
12620 {
12621 /*
12622 * Note that it's correct to emit an alias clause if and only if
12623 * there was one originally. Otherwise we'd be converting a named
12624 * join to unnamed or vice versa, which creates semantic
12625 * subtleties we don't want. However, we might print a different
12626 * alias name than was there originally.
12627 */
12628 appendStringInfo(buf, " %s",
12629 quote_identifier(get_rtable_name(j->rtindex,
12630 context)));
12631 get_column_alias_list(colinfo, context);
12632 }
12633 }
12634 else
12635 elog(ERROR, "unrecognized node type: %d",
12636 (int) nodeTag(jtnode));
12637}
12638
12639/*
12640 * get_rte_alias - print the relation's alias, if needed
12641 *
12642 * If printed, the alias is preceded by a space, or by " AS " if use_as is true.
12643 */
12644static void
12645get_rte_alias(RangeTblEntry *rte, int varno, bool use_as,
12646 deparse_context *context)
12647{
12648 deparse_namespace *dpns = (deparse_namespace *) linitial(context->namespaces);
12649 char *refname = get_rtable_name(varno, context);
12650 deparse_columns *colinfo = deparse_columns_fetch(varno, dpns);
12651 bool printalias = false;
12652
12653 if (rte->alias != NULL)
12654 {
12655 /* Always print alias if user provided one */
12656 printalias = true;
12657 }
12658 else if (colinfo->printaliases)
12659 {
12660 /* Always print alias if we need to print column aliases */
12661 printalias = true;
12662 }
12663 else if (rte->rtekind == RTE_RELATION)
12664 {
12665 /*
12666 * No need to print alias if it's same as relation name (this would
12667 * normally be the case, but not if set_rtable_names had to resolve a
12668 * conflict).
12669 */
12670 if (strcmp(refname, get_relation_name(rte->relid)) != 0)
12671 printalias = true;
12672 }
12673 else if (rte->rtekind == RTE_FUNCTION)
12674 {
12675 /*
12676 * For a function RTE, always print alias. This covers possible
12677 * renaming of the function and/or instability of the FigureColname
12678 * rules for things that aren't simple functions. Note we'd need to
12679 * force it anyway for the columndef list case.
12680 */
12681 printalias = true;
12682 }
12683 else if (rte->rtekind == RTE_SUBQUERY ||
12684 rte->rtekind == RTE_VALUES)
12685 {
12686 /*
12687 * For a subquery, always print alias. This makes the output
12688 * SQL-spec-compliant, even though we allow such aliases to be omitted
12689 * on input.
12690 */
12691 printalias = true;
12692 }
12693 else if (rte->rtekind == RTE_CTE)
12694 {
12695 /*
12696 * No need to print alias if it's same as CTE name (this would
12697 * normally be the case, but not if set_rtable_names had to resolve a
12698 * conflict).
12699 */
12700 if (strcmp(refname, rte->ctename) != 0)
12701 printalias = true;
12702 }
12703
12704 if (printalias)
12705 appendStringInfo(context->buf, "%s%s",
12706 use_as ? " AS " : " ",
12707 quote_identifier(refname));
12708}
12709
12710/*
12711 * get_column_alias_list - print column alias list for an RTE
12712 *
12713 * Caller must already have printed the relation's alias name.
12714 */
12715static void
12716get_column_alias_list(deparse_columns *colinfo, deparse_context *context)
12717{
12718 StringInfo buf = context->buf;
12719 int i;
12720 bool first = true;
12721
12722 /* Don't print aliases if not needed */
12723 if (!colinfo->printaliases)
12724 return;
12725
12726 for (i = 0; i < colinfo->num_new_cols; i++)
12727 {
12728 char *colname = colinfo->new_colnames[i];
12729
12730 if (first)
12731 {
12732 appendStringInfoChar(buf, '(');
12733 first = false;
12734 }
12735 else
12736 appendStringInfoString(buf, ", ");
12737 appendStringInfoString(buf, quote_identifier(colname));
12738 }
12739 if (!first)
12740 appendStringInfoChar(buf, ')');
12741}
12742
12743/*
12744 * get_from_clause_coldeflist - reproduce FROM clause coldeflist
12745 *
12746 * When printing a top-level coldeflist (which is syntactically also the
12747 * relation's column alias list), use column names from colinfo. But when
12748 * printing a coldeflist embedded inside ROWS FROM(), we prefer to use the
12749 * original coldeflist's names, which are available in rtfunc->funccolnames.
12750 * Pass NULL for colinfo to select the latter behavior.
12751 *
12752 * The coldeflist is appended immediately (no space) to buf. Caller is
12753 * responsible for ensuring that an alias or AS is present before it.
12754 */
12755static void
12756get_from_clause_coldeflist(RangeTblFunction *rtfunc,
12757 deparse_columns *colinfo,
12758 deparse_context *context)
12759{
12760 StringInfo buf = context->buf;
12761 ListCell *l1;
12762 ListCell *l2;
12763 ListCell *l3;
12764 ListCell *l4;
12765 int i;
12766
12767 appendStringInfoChar(buf, '(');
12768
12769 i = 0;
12770 forfour(l1, rtfunc->funccoltypes,
12771 l2, rtfunc->funccoltypmods,
12772 l3, rtfunc->funccolcollations,
12773 l4, rtfunc->funccolnames)
12774 {
12775 Oid atttypid = lfirst_oid(l1);
12776 int32 atttypmod = lfirst_int(l2);
12777 Oid attcollation = lfirst_oid(l3);
12778 char *attname;
12779
12780 if (colinfo)
12781 attname = colinfo->colnames[i];
12782 else
12783 attname = strVal(lfirst(l4));
12784
12785 Assert(attname); /* shouldn't be any dropped columns here */
12786
12787 if (i > 0)
12788 appendStringInfoString(buf, ", ");
12789 appendStringInfo(buf, "%s %s",
12790 quote_identifier(attname),
12791 format_type_with_typemod(atttypid, atttypmod));
12792 if (OidIsValid(attcollation) &&
12793 attcollation != get_typcollation(atttypid))
12794 appendStringInfo(buf, " COLLATE %s",
12795 generate_collation_name(attcollation));
12796
12797 i++;
12798 }
12799
12800 appendStringInfoChar(buf, ')');
12801}
12802
12803/*
12804 * get_tablesample_def - print a TableSampleClause
12805 */
12806static void
12807get_tablesample_def(TableSampleClause *tablesample, deparse_context *context)
12808{
12809 StringInfo buf = context->buf;
12810 Oid argtypes[1];
12811 int nargs;
12812 ListCell *l;
12813
12814 /*
12815 * We should qualify the handler's function name if it wouldn't be
12816 * resolved by lookup in the current search path.
12817 */
12818 argtypes[0] = INTERNALOID;
12819 appendStringInfo(buf, " TABLESAMPLE %s (",
12820 generate_function_name(tablesample->tsmhandler, 1,
12821 NIL, argtypes,
12822 false, NULL, false));
12823
12824 nargs = 0;
12825 foreach(l, tablesample->args)
12826 {
12827 if (nargs++ > 0)
12828 appendStringInfoString(buf, ", ");
12829 get_rule_expr((Node *) lfirst(l), context, false);
12830 }
12831 appendStringInfoChar(buf, ')');
12832
12833 if (tablesample->repeatable != NULL)
12834 {
12835 appendStringInfoString(buf, " REPEATABLE (");
12836 get_rule_expr((Node *) tablesample->repeatable, context, false);
12837 appendStringInfoChar(buf, ')');
12838 }
12839}
12840
12841/*
12842 * get_opclass_name - fetch name of an index operator class
12843 *
12844 * The opclass name is appended (after a space) to buf.
12845 *
12846 * Output is suppressed if the opclass is the default for the given
12847 * actual_datatype. (If you don't want this behavior, just pass
12848 * InvalidOid for actual_datatype.)
12849 */
12850static void
12851get_opclass_name(Oid opclass, Oid actual_datatype,
12852 StringInfo buf)
12853{
12854 HeapTuple ht_opc;
12855 Form_pg_opclass opcrec;
12856 char *opcname;
12857 char *nspname;
12858
12859 ht_opc = SearchSysCache1(CLAOID, ObjectIdGetDatum(opclass));
12860 if (!HeapTupleIsValid(ht_opc))
12861 elog(ERROR, "cache lookup failed for opclass %u", opclass);
12862 opcrec = (Form_pg_opclass) GETSTRUCT(ht_opc);
12863
12864 if (!OidIsValid(actual_datatype) ||
12865 GetDefaultOpClass(actual_datatype, opcrec->opcmethod) != opclass)
12866 {
12867 /* Okay, we need the opclass name. Do we need to qualify it? */
12868 opcname = NameStr(opcrec->opcname);
12869 if (OpclassIsVisible(opclass))
12870 appendStringInfo(buf, " %s", quote_identifier(opcname));
12871 else
12872 {
12873 nspname = get_namespace_name_or_temp(opcrec->opcnamespace);
12874 appendStringInfo(buf, " %s.%s",
12875 quote_identifier(nspname),
12876 quote_identifier(opcname));
12877 }
12878 }
12879 ReleaseSysCache(ht_opc);
12880}
12881
12882/*
12883 * generate_opclass_name
12884 * Compute the name to display for an opclass specified by OID
12885 *
12886 * The result includes all necessary quoting and schema-prefixing.
12887 */
12888char *
12889generate_opclass_name(Oid opclass)
12890{
12891 StringInfoData buf;
12892
12893 initStringInfo(&buf);
12894 get_opclass_name(opclass, InvalidOid, &buf);
12895
12896 return &buf.data[1]; /* get_opclass_name() prepends space */
12897}
12898
12899/*
12900 * processIndirection - take care of array and subfield assignment
12901 *
12902 * We strip any top-level FieldStore or assignment SubscriptingRef nodes that
12903 * appear in the input, printing them as decoration for the base column
12904 * name (which we assume the caller just printed). We might also need to
12905 * strip CoerceToDomain nodes, but only ones that appear above assignment
12906 * nodes.
12907 *
12908 * Returns the subexpression that's to be assigned.
12909 */
12910static Node *
12911processIndirection(Node *node, deparse_context *context)
12912{
12913 StringInfo buf = context->buf;
12914 CoerceToDomain *cdomain = NULL;
12915
12916 for (;;)
12917 {
12918 if (node == NULL)
12919 break;
12920 if (IsA(node, FieldStore))
12921 {
12922 FieldStore *fstore = (FieldStore *) node;
12923 Oid typrelid;
12924 char *fieldname;
12925
12926 /* lookup tuple type */
12927 typrelid = get_typ_typrelid(fstore->resulttype);
12928 if (!OidIsValid(typrelid))
12929 elog(ERROR, "argument type %s of FieldStore is not a tuple type",
12930 format_type_be(fstore->resulttype));
12931
12932 /*
12933 * Print the field name. There should only be one target field in
12934 * stored rules. There could be more than that in executable
12935 * target lists, but this function cannot be used for that case.
12936 */
12937 Assert(list_length(fstore->fieldnums) == 1);
12938 fieldname = get_attname(typrelid,
12939 linitial_int(fstore->fieldnums), false);
12940 appendStringInfo(buf, ".%s", quote_identifier(fieldname));
12941
12942 /*
12943 * We ignore arg since it should be an uninteresting reference to
12944 * the target column or subcolumn.
12945 */
12946 node = (Node *) linitial(fstore->newvals);
12947 }
12948 else if (IsA(node, SubscriptingRef))
12949 {
12950 SubscriptingRef *sbsref = (SubscriptingRef *) node;
12951
12952 if (sbsref->refassgnexpr == NULL)
12953 break;
12954
12955 printSubscripts(sbsref, context);
12956
12957 /*
12958 * We ignore refexpr since it should be an uninteresting reference
12959 * to the target column or subcolumn.
12960 */
12961 node = (Node *) sbsref->refassgnexpr;
12962 }
12963 else if (IsA(node, CoerceToDomain))
12964 {
12965 cdomain = (CoerceToDomain *) node;
12966 /* If it's an explicit domain coercion, we're done */
12967 if (cdomain->coercionformat != COERCE_IMPLICIT_CAST)
12968 break;
12969 /* Tentatively descend past the CoerceToDomain */
12970 node = (Node *) cdomain->arg;
12971 }
12972 else
12973 break;
12974 }
12975
12976 /*
12977 * If we descended past a CoerceToDomain whose argument turned out not to
12978 * be a FieldStore or array assignment, back up to the CoerceToDomain.
12979 * (This is not enough to be fully correct if there are nested implicit
12980 * CoerceToDomains, but such cases shouldn't ever occur.)
12981 */
12982 if (cdomain && node == (Node *) cdomain->arg)
12983 node = (Node *) cdomain;
12984
12985 return node;
12986}
12987
12988static void
12989printSubscripts(SubscriptingRef *sbsref, deparse_context *context)
12990{
12991 StringInfo buf = context->buf;
12992 ListCell *lowlist_item;
12993 ListCell *uplist_item;
12994
12995 lowlist_item = list_head(sbsref->reflowerindexpr); /* could be NULL */
12996 foreach(uplist_item, sbsref->refupperindexpr)
12997 {
12998 appendStringInfoChar(buf, '[');
12999 if (lowlist_item)
13000 {
13001 /* If subexpression is NULL, get_rule_expr prints nothing */
13002 get_rule_expr((Node *) lfirst(lowlist_item), context, false);
13003 appendStringInfoChar(buf, ':');
13004 lowlist_item = lnext(sbsref->reflowerindexpr, lowlist_item);
13005 }
13006 /* If subexpression is NULL, get_rule_expr prints nothing */
13007 get_rule_expr((Node *) lfirst(uplist_item), context, false);
13008 appendStringInfoChar(buf, ']');
13009 }
13010}
13011
13012/*
13013 * quote_identifier - Quote an identifier only if needed
13014 *
13015 * When quotes are needed, we palloc the required space; slightly
13016 * space-wasteful but well worth it for notational simplicity.
13017 */
13018const char *
13019quote_identifier(const char *ident)
13020{
13021 /*
13022 * Can avoid quoting if ident starts with a lowercase letter or underscore
13023 * and contains only lowercase letters, digits, and underscores, *and* is
13024 * not any SQL keyword. Otherwise, supply quotes.
13025 */
13026 int nquotes = 0;
13027 bool safe;
13028 const char *ptr;
13029 char *result;
13030 char *optr;
13031
13032 /*
13033 * would like to use <ctype.h> macros here, but they might yield unwanted
13034 * locale-specific results...
13035 */
13036 safe = ((ident[0] >= 'a' && ident[0] <= 'z') || ident[0] == '_');
13037
13038 for (ptr = ident; *ptr; ptr++)
13039 {
13040 char ch = *ptr;
13041
13042 if ((ch >= 'a' && ch <= 'z') ||
13043 (ch >= '0' && ch <= '9') ||
13044 (ch == '_'))
13045 {
13046 /* okay */
13047 }
13048 else
13049 {
13050 safe = false;
13051 if (ch == '"')
13052 nquotes++;
13053 }
13054 }
13055
13056 if (quote_all_identifiers)
13057 safe = false;
13058
13059 if (safe)
13060 {
13061 /*
13062 * Check for keyword. We quote keywords except for unreserved ones.
13063 * (In some cases we could avoid quoting a col_name or type_func_name
13064 * keyword, but it seems much harder than it's worth to tell that.)
13065 *
13066 * Note: ScanKeywordLookup() does case-insensitive comparison, but
13067 * that's fine, since we already know we have all-lower-case.
13068 */
13069 int kwnum = ScanKeywordLookup(ident, &ScanKeywords);
13070
13071 if (kwnum >= 0 && ScanKeywordCategories[kwnum] != UNRESERVED_KEYWORD)
13072 safe = false;
13073 }
13074
13075 if (safe)
13076 return ident; /* no change needed */
13077
13078 result = (char *) palloc(strlen(ident) + nquotes + 2 + 1);
13079
13080 optr = result;
13081 *optr++ = '"';
13082 for (ptr = ident; *ptr; ptr++)
13083 {
13084 char ch = *ptr;
13085
13086 if (ch == '"')
13087 *optr++ = '"';
13088 *optr++ = ch;
13089 }
13090 *optr++ = '"';
13091 *optr = '\0';
13092
13093 return result;
13094}
13095
13096/*
13097 * quote_qualified_identifier - Quote a possibly-qualified identifier
13098 *
13099 * Return a name of the form qualifier.ident, or just ident if qualifier
13100 * is NULL, quoting each component if necessary. The result is palloc'd.
13101 */
13102char *
13103quote_qualified_identifier(const char *qualifier,
13104 const char *ident)
13105{
13106 StringInfoData buf;
13107
13108 initStringInfo(&buf);
13109 if (qualifier)
13110 appendStringInfo(&buf, "%s.", quote_identifier(qualifier));
13111 appendStringInfoString(&buf, quote_identifier(ident));
13112 return buf.data;
13113}
13114
13115/*
13116 * get_relation_name
13117 * Get the unqualified name of a relation specified by OID
13118 *
13119 * This differs from the underlying get_rel_name() function in that it will
13120 * throw error instead of silently returning NULL if the OID is bad.
13121 */
13122static char *
13123get_relation_name(Oid relid)
13124{
13125 char *relname = get_rel_name(relid);
13126
13127 if (!relname)
13128 elog(ERROR, "cache lookup failed for relation %u", relid);
13129 return relname;
13130}
13131
13132/*
13133 * generate_relation_name
13134 * Compute the name to display for a relation specified by OID
13135 *
13136 * The result includes all necessary quoting and schema-prefixing.
13137 *
13138 * If namespaces isn't NIL, it must be a list of deparse_namespace nodes.
13139 * We will forcibly qualify the relation name if it equals any CTE name
13140 * visible in the namespace list.
13141 */
13142static char *
13143generate_relation_name(Oid relid, List *namespaces)
13144{
13145 HeapTuple tp;
13146 Form_pg_class reltup;
13147 bool need_qual;
13148 ListCell *nslist;
13149 char *relname;
13150 char *nspname;
13151 char *result;
13152
13153 tp = SearchSysCache1(RELOID, ObjectIdGetDatum(relid));
13154 if (!HeapTupleIsValid(tp))
13155 elog(ERROR, "cache lookup failed for relation %u", relid);
13156 reltup = (Form_pg_class) GETSTRUCT(tp);
13157 relname = NameStr(reltup->relname);
13158
13159 /* Check for conflicting CTE name */
13160 need_qual = false;
13161 foreach(nslist, namespaces)
13162 {
13163 deparse_namespace *dpns = (deparse_namespace *) lfirst(nslist);
13164 ListCell *ctlist;
13165
13166 foreach(ctlist, dpns->ctes)
13167 {
13168 CommonTableExpr *cte = (CommonTableExpr *) lfirst(ctlist);
13169
13170 if (strcmp(cte->ctename, relname) == 0)
13171 {
13172 need_qual = true;
13173 break;
13174 }
13175 }
13176 if (need_qual)
13177 break;
13178 }
13179
13180 /* Otherwise, qualify the name if not visible in search path */
13181 if (!need_qual)
13182 need_qual = !RelationIsVisible(relid);
13183
13184 if (need_qual)
13185 nspname = get_namespace_name_or_temp(reltup->relnamespace);
13186 else
13187 nspname = NULL;
13188
13189 result = quote_qualified_identifier(nspname, relname);
13190
13191 ReleaseSysCache(tp);
13192
13193 return result;
13194}
13195
13196/*
13197 * generate_qualified_relation_name
13198 * Compute the name to display for a relation specified by OID
13199 *
13200 * As above, but unconditionally schema-qualify the name.
13201 */
13202static char *
13203generate_qualified_relation_name(Oid relid)
13204{
13205 HeapTuple tp;
13206 Form_pg_class reltup;
13207 char *relname;
13208 char *nspname;
13209 char *result;
13210
13211 tp = SearchSysCache1(RELOID, ObjectIdGetDatum(relid));
13212 if (!HeapTupleIsValid(tp))
13213 elog(ERROR, "cache lookup failed for relation %u", relid);
13214 reltup = (Form_pg_class) GETSTRUCT(tp);
13215 relname = NameStr(reltup->relname);
13216
13217 nspname = get_namespace_name_or_temp(reltup->relnamespace);
13218 if (!nspname)
13219 elog(ERROR, "cache lookup failed for namespace %u",
13220 reltup->relnamespace);
13221
13222 result = quote_qualified_identifier(nspname, relname);
13223
13224 ReleaseSysCache(tp);
13225
13226 return result;
13227}
13228
13229/*
13230 * generate_function_name
13231 * Compute the name to display for a function specified by OID,
13232 * given that it is being called with the specified actual arg names and
13233 * types. (Those matter because of ambiguous-function resolution rules.)
13234 *
13235 * If we're dealing with a potentially variadic function (in practice, this
13236 * means a FuncExpr or Aggref, not some other way of calling a function), then
13237 * has_variadic must specify whether variadic arguments have been merged,
13238 * and *use_variadic_p will be set to indicate whether to print VARIADIC in
13239 * the output. For non-FuncExpr cases, has_variadic should be false and
13240 * use_variadic_p can be NULL.
13241 *
13242 * inGroupBy must be true if we're deparsing a GROUP BY clause.
13243 *
13244 * The result includes all necessary quoting and schema-prefixing.
13245 */
13246static char *
13247generate_function_name(Oid funcid, int nargs, List *argnames, Oid *argtypes,
13248 bool has_variadic, bool *use_variadic_p,
13249 bool inGroupBy)
13250{
13251 char *result;
13252 HeapTuple proctup;
13253 Form_pg_proc procform;
13254 char *proname;
13255 bool use_variadic;
13256 char *nspname;
13257 FuncDetailCode p_result;
13258 Oid p_funcid;
13259 Oid p_rettype;
13260 bool p_retset;
13261 int p_nvargs;
13262 Oid p_vatype;
13263 Oid *p_true_typeids;
13264 bool force_qualify = false;
13265
13266 proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
13267 if (!HeapTupleIsValid(proctup))
13268 elog(ERROR, "cache lookup failed for function %u", funcid);
13269 procform = (Form_pg_proc) GETSTRUCT(proctup);
13270 proname = NameStr(procform->proname);
13271
13272 /*
13273 * Due to parser hacks to avoid needing to reserve CUBE, we need to force
13274 * qualification of some function names within GROUP BY.
13275 */
13276 if (inGroupBy)
13277 {
13278 if (strcmp(proname, "cube") == 0 || strcmp(proname, "rollup") == 0)
13279 force_qualify = true;
13280 }
13281
13282 /*
13283 * Determine whether VARIADIC should be printed. We must do this first
13284 * since it affects the lookup rules in func_get_detail().
13285 *
13286 * We always print VARIADIC if the function has a merged variadic-array
13287 * argument. Note that this is always the case for functions taking a
13288 * VARIADIC argument type other than VARIADIC ANY. If we omitted VARIADIC
13289 * and printed the array elements as separate arguments, the call could
13290 * match a newer non-VARIADIC function.
13291 */
13292 if (use_variadic_p)
13293 {
13294 /* Parser should not have set funcvariadic unless fn is variadic */
13295 Assert(!has_variadic || OidIsValid(procform->provariadic));
13296 use_variadic = has_variadic;
13297 *use_variadic_p = use_variadic;
13298 }
13299 else
13300 {
13301 Assert(!has_variadic);
13302 use_variadic = false;
13303 }
13304
13305 /*
13306 * The idea here is to schema-qualify only if the parser would fail to
13307 * resolve the correct function given the unqualified func name with the
13308 * specified argtypes and VARIADIC flag. But if we already decided to
13309 * force qualification, then we can skip the lookup and pretend we didn't
13310 * find it.
13311 */
13312 if (!force_qualify)
13313 p_result = func_get_detail(list_make1(makeString(proname)),
13314 NIL, argnames, nargs, argtypes,
13315 !use_variadic, true, false,
13316 &p_funcid, &p_rettype,
13317 &p_retset, &p_nvargs, &p_vatype,
13318 &p_true_typeids, NULL);
13319 else
13320 {
13321 p_result = FUNCDETAIL_NOTFOUND;
13322 p_funcid = InvalidOid;
13323 }
13324
13325 if ((p_result == FUNCDETAIL_NORMAL ||
13326 p_result == FUNCDETAIL_AGGREGATE ||
13327 p_result == FUNCDETAIL_WINDOWFUNC) &&
13328 p_funcid == funcid)
13329 nspname = NULL;
13330 else
13331 nspname = get_namespace_name_or_temp(procform->pronamespace);
13332
13333 result = quote_qualified_identifier(nspname, proname);
13334
13335 ReleaseSysCache(proctup);
13336
13337 return result;
13338}
13339
13340/*
13341 * generate_operator_name
13342 * Compute the name to display for an operator specified by OID,
13343 * given that it is being called with the specified actual arg types.
13344 * (Arg types matter because of ambiguous-operator resolution rules.
13345 * Pass InvalidOid for unused arg of a unary operator.)
13346 *
13347 * The result includes all necessary quoting and schema-prefixing,
13348 * plus the OPERATOR() decoration needed to use a qualified operator name
13349 * in an expression.
13350 */
13351static char *
13352generate_operator_name(Oid operid, Oid arg1, Oid arg2)
13353{
13354 StringInfoData buf;
13355 HeapTuple opertup;
13356 Form_pg_operator operform;
13357 char *oprname;
13358 char *nspname;
13359 Operator p_result;
13360
13361 initStringInfo(&buf);
13362
13363 opertup = SearchSysCache1(OPEROID, ObjectIdGetDatum(operid));
13364 if (!HeapTupleIsValid(opertup))
13365 elog(ERROR, "cache lookup failed for operator %u", operid);
13366 operform = (Form_pg_operator) GETSTRUCT(opertup);
13367 oprname = NameStr(operform->oprname);
13368
13369 /*
13370 * The idea here is to schema-qualify only if the parser would fail to
13371 * resolve the correct operator given the unqualified op name with the
13372 * specified argtypes.
13373 */
13374 switch (operform->oprkind)
13375 {
13376 case 'b':
13377 p_result = oper(NULL, list_make1(makeString(oprname)), arg1, arg2,
13378 true, -1);
13379 break;
13380 case 'l':
13381 p_result = left_oper(NULL, list_make1(makeString(oprname)), arg2,
13382 true, -1);
13383 break;
13384 default:
13385 elog(ERROR, "unrecognized oprkind: %d", operform->oprkind);
13386 p_result = NULL; /* keep compiler quiet */
13387 break;
13388 }
13389
13390 if (p_result != NULL && oprid(p_result) == operid)
13391 nspname = NULL;
13392 else
13393 {
13394 nspname = get_namespace_name_or_temp(operform->oprnamespace);
13395 appendStringInfo(&buf, "OPERATOR(%s.", quote_identifier(nspname));
13396 }
13397
13398 appendStringInfoString(&buf, oprname);
13399
13400 if (nspname)
13401 appendStringInfoChar(&buf, ')');
13402
13403 if (p_result != NULL)
13404 ReleaseSysCache(p_result);
13405
13406 ReleaseSysCache(opertup);
13407
13408 return buf.data;
13409}
13410
13411/*
13412 * generate_operator_clause --- generate a binary-operator WHERE clause
13413 *
13414 * This is used for internally-generated-and-executed SQL queries, where
13415 * precision is essential and readability is secondary. The basic
13416 * requirement is to append "leftop op rightop" to buf, where leftop and
13417 * rightop are given as strings and are assumed to yield types leftoptype
13418 * and rightoptype; the operator is identified by OID. The complexity
13419 * comes from needing to be sure that the parser will select the desired
13420 * operator when the query is parsed. We always name the operator using
13421 * OPERATOR(schema.op) syntax, so as to avoid search-path uncertainties.
13422 * We have to emit casts too, if either input isn't already the input type
13423 * of the operator; else we are at the mercy of the parser's heuristics for
13424 * ambiguous-operator resolution. The caller must ensure that leftop and
13425 * rightop are suitable arguments for a cast operation; it's best to insert
13426 * parentheses if they aren't just variables or parameters.
13427 */
13428void
13429generate_operator_clause(StringInfo buf,
13430 const char *leftop, Oid leftoptype,
13431 Oid opoid,
13432 const char *rightop, Oid rightoptype)
13433{
13434 HeapTuple opertup;
13435 Form_pg_operator operform;
13436 char *oprname;
13437 char *nspname;
13438
13439 opertup = SearchSysCache1(OPEROID, ObjectIdGetDatum(opoid));
13440 if (!HeapTupleIsValid(opertup))
13441 elog(ERROR, "cache lookup failed for operator %u", opoid);
13442 operform = (Form_pg_operator) GETSTRUCT(opertup);
13443 Assert(operform->oprkind == 'b');
13444 oprname = NameStr(operform->oprname);
13445
13446 nspname = get_namespace_name(operform->oprnamespace);
13447
13448 appendStringInfoString(buf, leftop);
13449 if (leftoptype != operform->oprleft)
13450 add_cast_to(buf, operform->oprleft);
13451 appendStringInfo(buf, " OPERATOR(%s.", quote_identifier(nspname));
13452 appendStringInfoString(buf, oprname);
13453 appendStringInfo(buf, ") %s", rightop);
13454 if (rightoptype != operform->oprright)
13455 add_cast_to(buf, operform->oprright);
13456
13457 ReleaseSysCache(opertup);
13458}
13459
13460/*
13461 * Add a cast specification to buf. We spell out the type name the hard way,
13462 * intentionally not using format_type_be(). This is to avoid corner cases
13463 * for CHARACTER, BIT, and perhaps other types, where specifying the type
13464 * using SQL-standard syntax results in undesirable data truncation. By
13465 * doing it this way we can be certain that the cast will have default (-1)
13466 * target typmod.
13467 */
13468static void
13469add_cast_to(StringInfo buf, Oid typid)
13470{
13471 HeapTuple typetup;
13472 Form_pg_type typform;
13473 char *typname;
13474 char *nspname;
13475
13476 typetup = SearchSysCache1(TYPEOID, ObjectIdGetDatum(typid));
13477 if (!HeapTupleIsValid(typetup))
13478 elog(ERROR, "cache lookup failed for type %u", typid);
13479 typform = (Form_pg_type) GETSTRUCT(typetup);
13480
13481 typname = NameStr(typform->typname);
13482 nspname = get_namespace_name_or_temp(typform->typnamespace);
13483
13484 appendStringInfo(buf, "::%s.%s",
13485 quote_identifier(nspname), quote_identifier(typname));
13486
13487 ReleaseSysCache(typetup);
13488}
13489
13490/*
13491 * generate_qualified_type_name
13492 * Compute the name to display for a type specified by OID
13493 *
13494 * This is different from format_type_be() in that we unconditionally
13495 * schema-qualify the name. That also means no special syntax for
13496 * SQL-standard type names ... although in current usage, this should
13497 * only get used for domains, so such cases wouldn't occur anyway.
13498 */
13499static char *
13500generate_qualified_type_name(Oid typid)
13501{
13502 HeapTuple tp;
13503 Form_pg_type typtup;
13504 char *typname;
13505 char *nspname;
13506 char *result;
13507
13508 tp = SearchSysCache1(TYPEOID, ObjectIdGetDatum(typid));
13509 if (!HeapTupleIsValid(tp))
13510 elog(ERROR, "cache lookup failed for type %u", typid);
13511 typtup = (Form_pg_type) GETSTRUCT(tp);
13512 typname = NameStr(typtup->typname);
13513
13514 nspname = get_namespace_name_or_temp(typtup->typnamespace);
13515 if (!nspname)
13516 elog(ERROR, "cache lookup failed for namespace %u",
13517 typtup->typnamespace);
13518
13519 result = quote_qualified_identifier(nspname, typname);
13520
13521 ReleaseSysCache(tp);
13522
13523 return result;
13524}
13525
13526/*
13527 * generate_collation_name
13528 * Compute the name to display for a collation specified by OID
13529 *
13530 * The result includes all necessary quoting and schema-prefixing.
13531 */
13532char *
13533generate_collation_name(Oid collid)
13534{
13535 HeapTuple tp;
13536 Form_pg_collation colltup;
13537 char *collname;
13538 char *nspname;
13539 char *result;
13540
13541 tp = SearchSysCache1(COLLOID, ObjectIdGetDatum(collid));
13542 if (!HeapTupleIsValid(tp))
13543 elog(ERROR, "cache lookup failed for collation %u", collid);
13544 colltup = (Form_pg_collation) GETSTRUCT(tp);
13545 collname = NameStr(colltup->collname);
13546
13547 if (!CollationIsVisible(collid))
13548 nspname = get_namespace_name_or_temp(colltup->collnamespace);
13549 else
13550 nspname = NULL;
13551
13552 result = quote_qualified_identifier(nspname, collname);
13553
13554 ReleaseSysCache(tp);
13555
13556 return result;
13557}
13558
13559/*
13560 * Given a C string, produce a TEXT datum.
13561 *
13562 * We assume that the input was palloc'd and may be freed.
13563 */
13564static text *
13565string_to_text(char *str)
13566{
13567 text *result;
13568
13569 result = cstring_to_text(str);
13570 pfree(str);
13571 return result;
13572}
13573
13574/*
13575 * Generate a C string representing a relation options from text[] datum.
13576 */
13577static void
13578get_reloptions(StringInfo buf, Datum reloptions)
13579{
13580 Datum *options;
13581 int noptions;
13582 int i;
13583
13584 deconstruct_array_builtin(DatumGetArrayTypeP(reloptions), TEXTOID,
13585 &options, NULL, &noptions);
13586
13587 for (i = 0; i < noptions; i++)
13588 {
13589 char *option = TextDatumGetCString(options[i]);
13590 char *name;
13591 char *separator;
13592 char *value;
13593
13594 /*
13595 * Each array element should have the form name=value. If the "=" is
13596 * missing for some reason, treat it like an empty value.
13597 */
13598 name = option;
13599 separator = strchr(option, '=');
13600 if (separator)
13601 {
13602 *separator = '\0';
13603 value = separator + 1;
13604 }
13605 else
13606 value = "";
13607
13608 if (i > 0)
13609 appendStringInfoString(buf, ", ");
13610 appendStringInfo(buf, "%s=", quote_identifier(name));
13611
13612 /*
13613 * In general we need to quote the value; but to avoid unnecessary
13614 * clutter, do not quote if it is an identifier that would not need
13615 * quoting. (We could also allow numbers, but that is a bit trickier
13616 * than it looks --- for example, are leading zeroes significant? We
13617 * don't want to assume very much here about what custom reloptions
13618 * might mean.)
13619 */
13620 if (quote_identifier(value) == value)
13621 appendStringInfoString(buf, value);
13622 else
13623 simple_quote_literal(buf, value);
13624
13625 pfree(option);
13626 }
13627}
13628
13629/*
13630 * Generate a C string representing a relation's reloptions, or NULL if none.
13631 */
13632static char *
13633flatten_reloptions(Oid relid)
13634{
13635 char *result = NULL;
13636 HeapTuple tuple;
13637 Datum reloptions;
13638 bool isnull;
13639
13640 tuple = SearchSysCache1(RELOID, ObjectIdGetDatum(relid));
13641 if (!HeapTupleIsValid(tuple))
13642 elog(ERROR, "cache lookup failed for relation %u", relid);
13643
13644 reloptions = SysCacheGetAttr(RELOID, tuple,
13645 Anum_pg_class_reloptions, &isnull);
13646 if (!isnull)
13647 {
13648 StringInfoData buf;
13649
13650 initStringInfo(&buf);
13651 get_reloptions(&buf, reloptions);
13652
13653 result = buf.data;
13654 }
13655
13656 ReleaseSysCache(tuple);
13657
13658 return result;
13659}
13660
13661/*
13662 * get_range_partbound_string
13663 * A C string representation of one range partition bound
13664 */
13665char *
13666get_range_partbound_string(List *bound_datums)
13667{
13668 deparse_context context;
13669 StringInfo buf = makeStringInfo();
13670 ListCell *cell;
13671 char *sep;
13672
13673 memset(&context, 0, sizeof(deparse_context));
13674 context.buf = buf;
13675
13676 appendStringInfoChar(buf, '(');
13677 sep = "";
13678 foreach(cell, bound_datums)
13679 {
13680 PartitionRangeDatum *datum =
13681 lfirst_node(PartitionRangeDatum, cell);
13682
13683 appendStringInfoString(buf, sep);
13684 if (datum->kind == PARTITION_RANGE_DATUM_MINVALUE)
13685 appendStringInfoString(buf, "MINVALUE");
13686 else if (datum->kind == PARTITION_RANGE_DATUM_MAXVALUE)
13687 appendStringInfoString(buf, "MAXVALUE");
13688 else
13689 {
13690 Const *val = castNode(Const, datum->value);
13691
13692 get_const_expr(val, &context, -1);
13693 }
13694 sep = ", ";
13695 }
13696 appendStringInfoChar(buf, ')');
13697
13698 return buf->data;
13699}
GetIndexAmRoutine
IndexAmRoutine * GetIndexAmRoutine(Oid amhandler)
Definition: amapi.c:33
ARR_NDIM
#define ARR_NDIM(a)
Definition: array.h:290
ARR_DATA_PTR
#define ARR_DATA_PTR(a)
Definition: array.h:322
DatumGetArrayTypeP
#define DatumGetArrayTypeP(X)
Definition: array.h:261
ARR_ELEMTYPE
#define ARR_ELEMTYPE(a)
Definition: array.h:292
ARR_DIMS
#define ARR_DIMS(a)
Definition: array.h:294
ARR_HASNULL
#define ARR_HASNULL(a)
Definition: array.h:291
ARR_LBOUND
#define ARR_LBOUND(a)
Definition: array.h:296
accumArrayResult
ArrayBuildState * accumArrayResult(ArrayBuildState *astate, Datum dvalue, bool disnull, Oid element_type, MemoryContext rcontext)
Definition: arrayfuncs.c:5350
array_ref
Datum array_ref(ArrayType *array, int nSubscripts, int *indx, int arraytyplen, int elmlen, bool elmbyval, char elmalign, bool *isNull)
Definition: arrayfuncs.c:3146
deconstruct_array_builtin
void deconstruct_array_builtin(ArrayType *array, Oid elmtype, Datum **elemsp, bool **nullsp, int *nelemsp)
Definition: arrayfuncs.c:3697
makeArrayResult
Datum makeArrayResult(ArrayBuildState *astate, MemoryContext rcontext)
Definition: arrayfuncs.c:5420
AttrNumber
int16 AttrNumber
Definition: attnum.h:21
InvalidAttrNumber
#define InvalidAttrNumber
Definition: attnum.h:23
get_tablespace_name
char * get_tablespace_name(Oid spc_oid)
Definition: tablespace.c:1472
bms_make_singleton
Bitmapset * bms_make_singleton(int x)
Definition: bitmapset.c:216
bms_is_subset
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:412
bms_is_member
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:510
bms_add_member
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:815
bms_union
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:251
bms_is_empty
#define bms_is_empty(a)
Definition: bitmapset.h:118
TextDatumGetCString
#define TextDatumGetCString(d)
Definition: builtins.h:98
NameStr
#define NameStr(name)
Definition: c.h:717
bits16
uint16 bits16
Definition: c.h:510
Name
NameData * Name
Definition: c.h:715
Max
#define Max(x, y)
Definition: c.h:969
int16
int16_t int16
Definition: c.h:497
SQL_STR_DOUBLE
#define SQL_STR_DOUBLE(ch, escape_backslash)
Definition: c.h:1134
int32
int32_t int32
Definition: c.h:498
lengthof
#define lengthof(array)
Definition: c.h:759
Index
unsigned int Index
Definition: c.h:585
float4
float float4
Definition: c.h:600
OidIsValid
#define OidIsValid(objectId)
Definition: c.h:746
collid
Oid collid
Definition: collationcmds.c:700
ScanKeywordCategories
const uint8 ScanKeywordCategories[SCANKEYWORDS_NUM_KEYWORDS]
Definition: keywords.c:29
DEPENDENCY_AUTO
@ DEPENDENCY_AUTO
Definition: dependency.h:34
DEPENDENCY_INTERNAL
@ DEPENDENCY_INTERNAL
Definition: dependency.h:35
hash_search
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:955
hash_destroy
void hash_destroy(HTAB *hashp)
Definition: dynahash.c:865
hash_create
HTAB * hash_create(const char *tabname, long nelem, const HASHCTL *info, int flags)
Definition: dynahash.c:352
errcode
int errcode(int sqlerrcode)
Definition: elog.c:853
errmsg
int errmsg(const char *fmt,...)
Definition: elog.c:1070
ERROR
#define ERROR
Definition: elog.h:39
elog
#define elog(elevel,...)
Definition: elog.h:225
ereport
#define ereport(elevel,...)
Definition: elog.h:149
equal
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:223
palloc0_array
#define palloc0_array(type, count)
Definition: fe_memutils.h:77
OidOutputFunctionCall
char * OidOutputFunctionCall(Oid functionId, Datum val)
Definition: fmgr.c:1763
PG_GETARG_OID
#define PG_GETARG_OID(n)
Definition: fmgr.h:275
PG_GETARG_TEXT_PP
#define PG_GETARG_TEXT_PP(n)
Definition: fmgr.h:309
DatumGetByteaPP
#define DatumGetByteaPP(X)
Definition: fmgr.h:291
DirectFunctionCall1
#define DirectFunctionCall1(func, arg1)
Definition: fmgr.h:641
PG_RETURN_NULL
#define PG_RETURN_NULL()
Definition: fmgr.h:345
PG_RETURN_TEXT_P
#define PG_RETURN_TEXT_P(x)
Definition: fmgr.h:372
PG_RETURN_NAME
#define PG_RETURN_NAME(x)
Definition: fmgr.h:363
PG_GETARG_INT32
#define PG_GETARG_INT32(n)
Definition: fmgr.h:269
PG_GETARG_BOOL
#define PG_GETARG_BOOL(n)
Definition: fmgr.h:274
PG_RETURN_DATUM
#define PG_RETURN_DATUM(x)
Definition: fmgr.h:353
PG_FUNCTION_ARGS
#define PG_FUNCTION_ARGS
Definition: fmgr.h:193
format_type_with_typemod
char * format_type_with_typemod(Oid type_oid, int32 typemod)
Definition: format_type.c:362
format_type_be
char * format_type_be(Oid type_oid)
Definition: format_type.c:343
get_func_trftypes
int get_func_trftypes(HeapTuple procTup, Oid **p_trftypes)
Definition: funcapi.c:1475
get_func_arg_info
int get_func_arg_info(HeapTuple procTup, Oid **p_argtypes, char ***p_argnames, char **p_argmodes)
Definition: funcapi.c:1379
get_expr_result_tupdesc
TupleDesc get_expr_result_tupdesc(Node *expr, bool noError)
Definition: funcapi.c:551
systable_endscan
void systable_endscan(SysScanDesc sysscan)
Definition: genam.c:603
systable_getnext
HeapTuple systable_getnext(SysScanDesc sysscan)
Definition: genam.c:514
systable_beginscan
SysScanDesc systable_beginscan(Relation heapRelation, Oid indexId, bool indexOK, Snapshot snapshot, int nkeys, ScanKey key)
Definition: genam.c:388
GetConfigOptionFlags
int GetConfigOptionFlags(const char *name, bool missing_ok)
Definition: guc.c:4452
GUC_LIST_QUOTE
#define GUC_LIST_QUOTE
Definition: guc.h:215
Assert
Assert(PointerIsAligned(start, uint64))
str
const char * str
Definition: hashfn_unstable.h:254
heap_attisnull
bool heap_attisnull(HeapTuple tup, int attnum, TupleDesc tupleDesc)
Definition: heaptuple.c:456
HASH_STRINGS
#define HASH_STRINGS
Definition: hsearch.h:96
HASH_FIND
@ HASH_FIND
Definition: hsearch.h:113
HASH_ENTER
@ HASH_ENTER
Definition: hsearch.h:114
HASH_CONTEXT
#define HASH_CONTEXT
Definition: hsearch.h:102
HASH_ELEM
#define HASH_ELEM
Definition: hsearch.h:95
HeapTupleIsValid
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
htup_details.h
GETSTRUCT
static void * GETSTRUCT(const HeapTupleData *tuple)
Definition: htup_details.h:728
fastgetattr
static Datum fastgetattr(HeapTuple tup, int attnum, TupleDesc tupleDesc, bool *isnull)
Definition: htup_details.h:860
stmt
#define stmt
Definition: indent_codes.h:59
ident
#define ident
Definition: indent_codes.h:47
funcname
#define funcname
Definition: indent_codes.h:69
GetDefaultOpClass
Oid GetDefaultOpClass(Oid type_id, Oid am_id)
Definition: indexcmds.c:2343
val
long val
Definition: informix.c:689
value
static struct @165 value
a
int a
Definition: isn.c:70
j
int j
Definition: isn.c:75
i
int i
Definition: isn.c:74
if
if(TABLE==NULL||TABLE_index==NULL)
Definition: isn.c:78
ScanKeywords
PGDLLIMPORT const ScanKeywordList ScanKeywords
UNRESERVED_KEYWORD
#define UNRESERVED_KEYWORD
Definition: keywords.h:20
ScanKeywordLookup
int ScanKeywordLookup(const char *str, const ScanKeywordList *keywords)
Definition: kwlookup.c:38
lappend
List * lappend(List *list, void *datum)
Definition: list.c:339
list_copy_tail
List * list_copy_tail(const List *oldlist, int nskip)
Definition: list.c:1613
list_delete_first
List * list_delete_first(List *list)
Definition: list.c:943
list_concat
List * list_concat(List *list1, const List *list2)
Definition: list.c:561
list_copy
List * list_copy(const List *oldlist)
Definition: list.c:1573
lcons
List * lcons(void *datum, List *list)
Definition: list.c:495
list_free
void list_free(List *list)
Definition: list.c:1546
NoLock
#define NoLock
Definition: lockdefs.h:34
AccessShareLock
#define AccessShareLock
Definition: lockdefs.h:36
LockWaitSkip
@ LockWaitSkip
Definition: lockoptions.h:41
LockWaitError
@ LockWaitError
Definition: lockoptions.h:43
LCS_FORUPDATE
@ LCS_FORUPDATE
Definition: lockoptions.h:27
LCS_NONE
@ LCS_NONE
Definition: lockoptions.h:23
LCS_FORSHARE
@ LCS_FORSHARE
Definition: lockoptions.h:25
LCS_FORKEYSHARE
@ LCS_FORKEYSHARE
Definition: lockoptions.h:24
LCS_FORNOKEYUPDATE
@ LCS_FORNOKEYUPDATE
Definition: lockoptions.h:26
get_rel_name
char * get_rel_name(Oid relid)
Definition: lsyscache.c:2011
get_attnum
AttrNumber get_attnum(Oid relid, const char *attname)
Definition: lsyscache.c:893
get_opclass_input_type
Oid get_opclass_input_type(Oid opclass)
Definition: lsyscache.c:1247
type_is_rowtype
bool type_is_rowtype(Oid typid)
Definition: lsyscache.c:2738
getTypeOutputInfo
void getTypeOutputInfo(Oid type, Oid *typOutput, bool *typIsVarlena)
Definition: lsyscache.c:2990
get_attoptions
Datum get_attoptions(Oid relid, int16 attnum)
Definition: lsyscache.c:1005
get_rel_relkind
char get_rel_relkind(Oid relid)
Definition: lsyscache.c:2086
get_typcollation
Oid get_typcollation(Oid typid)
Definition: lsyscache.c:3139
get_language_name
char * get_language_name(Oid langoid, bool missing_ok)
Definition: lsyscache.c:1196
get_namespace_name_or_temp
char * get_namespace_name_or_temp(Oid nspid)
Definition: lsyscache.c:3473
get_constraint_name
char * get_constraint_name(Oid conoid)
Definition: lsyscache.c:1116
get_attname
char * get_attname(Oid relid, AttrNumber attnum, bool missing_ok)
Definition: lsyscache.c:862
get_rel_tablespace
Oid get_rel_tablespace(Oid relid)
Definition: lsyscache.c:2137
get_typ_typrelid
Oid get_typ_typrelid(Oid typid)
Definition: lsyscache.c:2814
get_base_element_type
Oid get_base_element_type(Oid typid)
Definition: lsyscache.c:2915
get_namespace_name
char * get_namespace_name(Oid nspid)
Definition: lsyscache.c:3449
get_type_category_preferred
void get_type_category_preferred(Oid typid, char *typcategory, bool *typispreferred)
Definition: lsyscache.c:2793
get_atttypetypmodcoll
void get_atttypetypmodcoll(Oid relid, AttrNumber attnum, Oid *typid, int32 *typmod, Oid *collid)
Definition: lsyscache.c:978
makeAlias
Alias * makeAlias(const char *aliasname, List *colnames)
Definition: makefuncs.c:438
pg_mbcliplen
int pg_mbcliplen(const char *mbstr, int len, int limit)
Definition: mbutils.c:1083
pstrdup
char * pstrdup(const char *in)
Definition: mcxt.c:1699
pfree
void pfree(void *pointer)
Definition: mcxt.c:1524
palloc0
void * palloc0(Size size)
Definition: mcxt.c:1347
palloc
void * palloc(Size size)
Definition: mcxt.c:1317
CurrentMemoryContext
MemoryContext CurrentMemoryContext
Definition: mcxt.c:143
CHECK_FOR_INTERRUPTS
#define CHECK_FOR_INTERRUPTS()
Definition: miscadmin.h:122
namein
Datum namein(PG_FUNCTION_ARGS)
Definition: name.c:48
CollationIsVisible
bool CollationIsVisible(Oid collid)
Definition: namespace.c:2407
RelationIsVisible
bool RelationIsVisible(Oid relid)
Definition: namespace.c:913
OpclassIsVisible
bool OpclassIsVisible(Oid opcid)
Definition: namespace.c:2154
makeRangeVarFromNameList
RangeVar * makeRangeVarFromNameList(const List *names)
Definition: namespace.c:3554
RangeVarGetRelid
#define RangeVarGetRelid(relation, lockmode, missing_ok)
Definition: namespace.h:80
generate_unaccent_rules.args
args
Definition: generate_unaccent_rules.py:288
generate_unaccent_rules.action
action
Definition: generate_unaccent_rules.py:287
exprType
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:42
exprIsLengthCoercion
bool exprIsLengthCoercion(const Node *expr, int32 *coercedTypmod)
Definition: nodeFuncs.c:557
exprTypmod
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:301
exprCollation
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:821
strip_implicit_coercions
Node * strip_implicit_coercions(Node *node)
Definition: nodeFuncs.c:705
DO_AGGSPLIT_SKIPFINAL
#define DO_AGGSPLIT_SKIPFINAL(as)
Definition: nodes.h:388
IsA
#define IsA(nodeptr, _type_)
Definition: nodes.h:160
nodeTag
#define nodeTag(nodeptr)
Definition: nodes.h:135
DO_AGGSPLIT_COMBINE
#define DO_AGGSPLIT_COMBINE(as)
Definition: nodes.h:387
ONCONFLICT_NOTHING
@ ONCONFLICT_NOTHING
Definition: nodes.h:421
CMD_MERGE
@ CMD_MERGE
Definition: nodes.h:271
CMD_UTILITY
@ CMD_UTILITY
Definition: nodes.h:272
CMD_INSERT
@ CMD_INSERT
Definition: nodes.h:269
CMD_DELETE
@ CMD_DELETE
Definition: nodes.h:270
CMD_UPDATE
@ CMD_UPDATE
Definition: nodes.h:268
CMD_SELECT
@ CMD_SELECT
Definition: nodes.h:267
CMD_NOTHING
@ CMD_NOTHING
Definition: nodes.h:274
LIMIT_OPTION_WITH_TIES
@ LIMIT_OPTION_WITH_TIES
Definition: nodes.h:434
makeNode
#define makeNode(_type_)
Definition: nodes.h:157
castNode
#define castNode(_type_, nodeptr)
Definition: nodes.h:178
JOIN_FULL
@ JOIN_FULL
Definition: nodes.h:297
JOIN_INNER
@ JOIN_INNER
Definition: nodes.h:295
JOIN_RIGHT
@ JOIN_RIGHT
Definition: nodes.h:298
JOIN_LEFT
@ JOIN_LEFT
Definition: nodes.h:296
repalloc0_array
#define repalloc0_array(pointer, type, oldcount, count)
Definition: palloc.h:109
get_aggregate_argtypes
int get_aggregate_argtypes(Aggref *aggref, Oid *inputTypes)
Definition: parse_agg.c:1997
parse_agg.h
func_get_detail
FuncDetailCode func_get_detail(List *funcname, List *fargs, List *fargnames, int nargs, Oid *argtypes, bool expand_variadic, bool expand_defaults, bool include_out_arguments, Oid *funcid, Oid *rettype, bool *retset, int *nvargs, Oid *vatype, Oid **true_typeids, List **argdefaults)
Definition: parse_func.c:1395
parse_func.h
FuncDetailCode
FuncDetailCode
Definition: parse_func.h:23
FUNCDETAIL_NORMAL
@ FUNCDETAIL_NORMAL
Definition: parse_func.h:26
FUNCDETAIL_WINDOWFUNC
@ FUNCDETAIL_WINDOWFUNC
Definition: parse_func.h:29
FUNCDETAIL_NOTFOUND
@ FUNCDETAIL_NOTFOUND
Definition: parse_func.h:24
FUNCDETAIL_AGGREGATE
@ FUNCDETAIL_AGGREGATE
Definition: parse_func.h:28
left_oper
Operator left_oper(ParseState *pstate, List *op, Oid arg, bool noError, int location)
Definition: parse_oper.c:518
oprid
Oid oprid(Operator op)
Definition: parse_oper.c:238
oper
Operator oper(ParseState *pstate, List *opname, Oid ltypeId, Oid rtypeId, bool noError, int location)
Definition: parse_oper.c:370
parse_oper.h
get_rte_attribute_name
char * get_rte_attribute_name(RangeTblEntry *rte, AttrNumber attnum)
Definition: parse_relation.c:3358
get_tle_by_resno
TargetEntry * get_tle_by_resno(List *tlist, AttrNumber resno)
Definition: parse_relation.c:3545
expandRTE
void expandRTE(RangeTblEntry *rte, int rtindex, int sublevels_up, VarReturningType returning_type, int location, bool include_dropped, List **colnames, List **colvars)
Definition: parse_relation.c:2751
parse_relation.h
FRAMEOPTION_END_CURRENT_ROW
#define FRAMEOPTION_END_CURRENT_ROW
Definition: parsenodes.h:602
FRAMEOPTION_END_OFFSET
#define FRAMEOPTION_END_OFFSET
Definition: parsenodes.h:613
FRAMEOPTION_EXCLUDE_CURRENT_ROW
#define FRAMEOPTION_EXCLUDE_CURRENT_ROW
Definition: parsenodes.h:607
GROUPING_SET_CUBE
@ GROUPING_SET_CUBE
Definition: parsenodes.h:1511
GROUPING_SET_SIMPLE
@ GROUPING_SET_SIMPLE
Definition: parsenodes.h:1509
GROUPING_SET_ROLLUP
@ GROUPING_SET_ROLLUP
Definition: parsenodes.h:1510
GROUPING_SET_SETS
@ GROUPING_SET_SETS
Definition: parsenodes.h:1512
GROUPING_SET_EMPTY
@ GROUPING_SET_EMPTY
Definition: parsenodes.h:1508
FKCONSTR_ACTION_RESTRICT
#define FKCONSTR_ACTION_RESTRICT
Definition: parsenodes.h:2802
SETOP_INTERSECT
@ SETOP_INTERSECT
Definition: parsenodes.h:2164
SETOP_UNION
@ SETOP_UNION
Definition: parsenodes.h:2163
SETOP_EXCEPT
@ SETOP_EXCEPT
Definition: parsenodes.h:2165
FRAMEOPTION_END_OFFSET_PRECEDING
#define FRAMEOPTION_END_OFFSET_PRECEDING
Definition: parsenodes.h:604
FRAMEOPTION_START_UNBOUNDED_PRECEDING
#define FRAMEOPTION_START_UNBOUNDED_PRECEDING
Definition: parsenodes.h:597
GetCTETargetList
#define GetCTETargetList(cte)
Definition: parsenodes.h:1714
FKCONSTR_ACTION_SETDEFAULT
#define FKCONSTR_ACTION_SETDEFAULT
Definition: parsenodes.h:2805
PARTITION_STRATEGY_HASH
@ PARTITION_STRATEGY_HASH
Definition: parsenodes.h:885
PARTITION_STRATEGY_LIST
@ PARTITION_STRATEGY_LIST
Definition: parsenodes.h:883
PARTITION_STRATEGY_RANGE
@ PARTITION_STRATEGY_RANGE
Definition: parsenodes.h:884
FRAMEOPTION_START_CURRENT_ROW
#define FRAMEOPTION_START_CURRENT_ROW
Definition: parsenodes.h:601
FKCONSTR_MATCH_SIMPLE
#define FKCONSTR_MATCH_SIMPLE
Definition: parsenodes.h:2810
RTE_JOIN
@ RTE_JOIN
Definition: parsenodes.h:1028
RTE_CTE
@ RTE_CTE
Definition: parsenodes.h:1032
RTE_NAMEDTUPLESTORE
@ RTE_NAMEDTUPLESTORE
Definition: parsenodes.h:1033
RTE_VALUES
@ RTE_VALUES
Definition: parsenodes.h:1031
RTE_SUBQUERY
@ RTE_SUBQUERY
Definition: parsenodes.h:1027
RTE_RESULT
@ RTE_RESULT
Definition: parsenodes.h:1034
RTE_FUNCTION
@ RTE_FUNCTION
Definition: parsenodes.h:1029
RTE_TABLEFUNC
@ RTE_TABLEFUNC
Definition: parsenodes.h:1030
RTE_GROUP
@ RTE_GROUP
Definition: parsenodes.h:1037
RTE_RELATION
@ RTE_RELATION
Definition: parsenodes.h:1026
FRAMEOPTION_START_OFFSET
#define FRAMEOPTION_START_OFFSET
Definition: parsenodes.h:611
PARTITION_RANGE_DATUM_MAXVALUE
@ PARTITION_RANGE_DATUM_MAXVALUE
Definition: parsenodes.h:937
PARTITION_RANGE_DATUM_MINVALUE
@ PARTITION_RANGE_DATUM_MINVALUE
Definition: parsenodes.h:935
FKCONSTR_MATCH_PARTIAL
#define FKCONSTR_MATCH_PARTIAL
Definition: parsenodes.h:2809
FRAMEOPTION_END_OFFSET_FOLLOWING
#define FRAMEOPTION_END_OFFSET_FOLLOWING
Definition: parsenodes.h:606
FRAMEOPTION_EXCLUDE_TIES
#define FRAMEOPTION_EXCLUDE_TIES
Definition: parsenodes.h:609
FRAMEOPTION_RANGE
#define FRAMEOPTION_RANGE
Definition: parsenodes.h:593
FRAMEOPTION_EXCLUDE_GROUP
#define FRAMEOPTION_EXCLUDE_GROUP
Definition: parsenodes.h:608
FKCONSTR_ACTION_CASCADE
#define FKCONSTR_ACTION_CASCADE
Definition: parsenodes.h:2803
FRAMEOPTION_GROUPS
#define FRAMEOPTION_GROUPS
Definition: parsenodes.h:595
FRAMEOPTION_BETWEEN
#define FRAMEOPTION_BETWEEN
Definition: parsenodes.h:596
FKCONSTR_ACTION_SETNULL
#define FKCONSTR_ACTION_SETNULL
Definition: parsenodes.h:2804
FRAMEOPTION_END_UNBOUNDED_FOLLOWING
#define FRAMEOPTION_END_UNBOUNDED_FOLLOWING
Definition: parsenodes.h:600
FRAMEOPTION_START_OFFSET_PRECEDING
#define FRAMEOPTION_START_OFFSET_PRECEDING
Definition: parsenodes.h:603
FRAMEOPTION_START_OFFSET_FOLLOWING
#define FRAMEOPTION_START_OFFSET_FOLLOWING
Definition: parsenodes.h:605
FRAMEOPTION_NONDEFAULT
#define FRAMEOPTION_NONDEFAULT
Definition: parsenodes.h:592
FKCONSTR_MATCH_FULL
#define FKCONSTR_MATCH_FULL
Definition: parsenodes.h:2808
FKCONSTR_ACTION_NOACTION
#define FKCONSTR_ACTION_NOACTION
Definition: parsenodes.h:2801
FRAMEOPTION_ROWS
#define FRAMEOPTION_ROWS
Definition: parsenodes.h:594
CTEMaterializeNever
@ CTEMaterializeNever
Definition: parsenodes.h:1649
CTEMaterializeAlways
@ CTEMaterializeAlways
Definition: parsenodes.h:1648
CTEMaterializeDefault
@ CTEMaterializeDefault
Definition: parsenodes.h:1647
rt_fetch
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
get_partition_qual_relid
Expr * get_partition_qual_relid(Oid relid)
Definition: partcache.c:299
pg_aggregate.h
Form_pg_aggregate
FormData_pg_aggregate * Form_pg_aggregate
Definition: pg_aggregate.h:109
pg_am.h
Form_pg_am
FormData_pg_am * Form_pg_am
Definition: pg_am.h:48
attname
NameData attname
Definition: pg_attribute.h:41
attnum
int16 attnum
Definition: pg_attribute.h:74
Form_pg_attribute
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:200
pg_authid.h
Form_pg_authid
FormData_pg_authid * Form_pg_authid
Definition: pg_authid.h:56
arg
void * arg
Definition: pg_backup_utils.c:29
format
static char format
Definition: pg_basebackup.c:133
relname
NameData relname
Definition: pg_class.h:38
Form_pg_class
FormData_pg_class * Form_pg_class
Definition: pg_class.h:156
pg_collation.h
Form_pg_collation
FormData_pg_collation * Form_pg_collation
Definition: pg_collation.h:58
NAMEDATALEN
#define NAMEDATALEN
Definition: pg_config_manual.h:29
FUNC_MAX_ARGS
#define FUNC_MAX_ARGS
Definition: pg_config_manual.h:43
extractNotNullColumn
AttrNumber extractNotNullColumn(HeapTuple constrTup)
Definition: pg_constraint.c:696
pg_constraint.h
Form_pg_constraint
FormData_pg_constraint * Form_pg_constraint
Definition: pg_constraint.h:175
while
while(p+4<=pend)
Definition: pg_crc32c_sse42.c:55
encoding
int32 encoding
Definition: pg_database.h:41
pg_depend.h
Form_pg_depend
FormData_pg_depend * Form_pg_depend
Definition: pg_depend.h:72
Form_pg_index
FormData_pg_index * Form_pg_index
Definition: pg_index.h:70
pg_language.h
lfirst
#define lfirst(lc)
Definition: pg_list.h:172
llast
#define llast(l)
Definition: pg_list.h:198
lfirst_node
#define lfirst_node(type, lc)
Definition: pg_list.h:176
list_length
static int list_length(const List *l)
Definition: pg_list.h:152
linitial_node
#define linitial_node(type, l)
Definition: pg_list.h:181
NIL
#define NIL
Definition: pg_list.h:68
lsecond_node
#define lsecond_node(type, l)
Definition: pg_list.h:186
forboth
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:518
foreach_current_index
#define foreach_current_index(var_or_cell)
Definition: pg_list.h:403
lfirst_int
#define lfirst_int(lc)
Definition: pg_list.h:173
lthird
#define lthird(l)
Definition: pg_list.h:188
list_make1
#define list_make1(x1)
Definition: pg_list.h:212
linitial_int
#define linitial_int(l)
Definition: pg_list.h:179
for_each_cell
#define for_each_cell(cell, lst, initcell)
Definition: pg_list.h:438
for_each_from
#define for_each_from(cell, lst, N)
Definition: pg_list.h:414
list_nth
static void * list_nth(const List *list, int n)
Definition: pg_list.h:299
linitial
#define linitial(l)
Definition: pg_list.h:178
lsecond
#define lsecond(l)
Definition: pg_list.h:183
foreach_node
#define foreach_node(type, var, lst)
Definition: pg_list.h:496
forfour
#define forfour(cell1, list1, cell2, list2, cell3, list3, cell4, list4)
Definition: pg_list.h:575
list_head
static ListCell * list_head(const List *l)
Definition: pg_list.h:128
lnext
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:343
lfourth
#define lfourth(l)
Definition: pg_list.h:193
linitial_oid
#define linitial_oid(l)
Definition: pg_list.h:180
forfive
#define forfive(cell1, list1, cell2, list2, cell3, list3, cell4, list4, cell5, list5)
Definition: pg_list.h:588
lfirst_oid
#define lfirst_oid(lc)
Definition: pg_list.h:174
list_make2
#define list_make2(x1, x2)
Definition: pg_list.h:214
foreach_int
#define foreach_int(var, lst)
Definition: pg_list.h:470
list_cell_number
static int list_cell_number(const List *l, const ListCell *c)
Definition: pg_list.h:333
lthird_node
#define lthird_node(type, l)
Definition: pg_list.h:191
pg_opclass.h
Form_pg_opclass
FormData_pg_opclass * Form_pg_opclass
Definition: pg_opclass.h:83
pg_operator.h
Form_pg_operator
FormData_pg_operator * Form_pg_operator
Definition: pg_operator.h:83
pg_partitioned_table.h
Form_pg_partitioned_table
FormData_pg_partitioned_table * Form_pg_partitioned_table
Definition: pg_partitioned_table.h:65
pg_proc.h
Form_pg_proc
FormData_pg_proc * Form_pg_proc
Definition: pg_proc.h:136
proname
NameData proname
Definition: pg_proc.h:35
noptions
static size_t noptions
Definition: pg_recvlogical.c:58
options
static char ** options
Definition: pg_recvlogical.c:57
plan
#define plan(x)
Definition: pg_regress.c:161
pg_statistic_ext.h
Form_pg_statistic_ext
FormData_pg_statistic_ext * Form_pg_statistic_ext
Definition: pg_statistic_ext.h:69
buf
static char * buf
Definition: pg_test_fsync.c:72
pg_trigger.h
Form_pg_trigger
FormData_pg_trigger * Form_pg_trigger
Definition: pg_trigger.h:80
pg_type.h
Form_pg_type
FormData_pg_type * Form_pg_type
Definition: pg_type.h:261
typname
NameData typname
Definition: pg_type.h:41
pg_wchar.h
innerPlan
#define innerPlan(node)
Definition: plannodes.h:237
outerPlan
#define outerPlan(node)
Definition: plannodes.h:238
sprintf
#define sprintf
Definition: port.h:241
snprintf
#define snprintf
Definition: port.h:239
DatumGetBool
static bool DatumGetBool(Datum X)
Definition: postgres.h:95
PointerGetDatum
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:327
DatumGetName
static Name DatumGetName(Datum X)
Definition: postgres.h:365
Datum
uintptr_t Datum
Definition: postgres.h:69
DatumGetObjectId
static Oid DatumGetObjectId(Datum X)
Definition: postgres.h:247
ObjectIdGetDatum
static Datum ObjectIdGetDatum(Oid X)
Definition: postgres.h:257
DatumGetPointer
static Pointer DatumGetPointer(Datum X)
Definition: postgres.h:317
DatumGetChar
static char DatumGetChar(Datum X)
Definition: postgres.h:117
CStringGetDatum
static Datum CStringGetDatum(const char *X)
Definition: postgres.h:355
Int32GetDatum
static Datum Int32GetDatum(int32 X)
Definition: postgres.h:217
DatumGetInt16
static int16 DatumGetInt16(Datum X)
Definition: postgres.h:167
DatumGetInt32
static int32 DatumGetInt32(Datum X)
Definition: postgres.h:207
InvalidOid
#define InvalidOid
Definition: postgres_ext.h:37
Oid
unsigned int Oid
Definition: postgres_ext.h:32
e
e
Definition: preproc-init.c:82
string
char string[11]
Definition: preproc-type.c:52
IS_NOT_TRUE
@ IS_NOT_TRUE
Definition: primnodes.h:1981
IS_NOT_FALSE
@ IS_NOT_FALSE
Definition: primnodes.h:1981
IS_NOT_UNKNOWN
@ IS_NOT_UNKNOWN
Definition: primnodes.h:1981
IS_TRUE
@ IS_TRUE
Definition: primnodes.h:1981
IS_UNKNOWN
@ IS_UNKNOWN
Definition: primnodes.h:1981
IS_FALSE
@ IS_FALSE
Definition: primnodes.h:1981
ARRAY_SUBLINK
@ ARRAY_SUBLINK
Definition: primnodes.h:1020
ANY_SUBLINK
@ ANY_SUBLINK
Definition: primnodes.h:1016
MULTIEXPR_SUBLINK
@ MULTIEXPR_SUBLINK
Definition: primnodes.h:1019
CTE_SUBLINK
@ CTE_SUBLINK
Definition: primnodes.h:1021
EXPR_SUBLINK
@ EXPR_SUBLINK
Definition: primnodes.h:1018
ROWCOMPARE_SUBLINK
@ ROWCOMPARE_SUBLINK
Definition: primnodes.h:1017
ALL_SUBLINK
@ ALL_SUBLINK
Definition: primnodes.h:1015
EXISTS_SUBLINK
@ EXISTS_SUBLINK
Definition: primnodes.h:1014
JS_FORMAT_JSONB
@ JS_FORMAT_JSONB
Definition: primnodes.h:1645
JS_FORMAT_DEFAULT
@ JS_FORMAT_DEFAULT
Definition: primnodes.h:1643
JS_FORMAT_JSON
@ JS_FORMAT_JSON
Definition: primnodes.h:1644
IS_LEAST
@ IS_LEAST
Definition: primnodes.h:1508
IS_GREATEST
@ IS_GREATEST
Definition: primnodes.h:1507
TFT_XMLTABLE
@ TFT_XMLTABLE
Definition: primnodes.h:100
TFT_JSON_TABLE
@ TFT_JSON_TABLE
Definition: primnodes.h:101
BoolExprType
BoolExprType
Definition: primnodes.h:947
AND_EXPR
@ AND_EXPR
Definition: primnodes.h:948
OR_EXPR
@ OR_EXPR
Definition: primnodes.h:948
NOT_EXPR
@ NOT_EXPR
Definition: primnodes.h:948
JS_ENC_DEFAULT
@ JS_ENC_DEFAULT
Definition: primnodes.h:1631
JS_ENC_UTF32
@ JS_ENC_UTF32
Definition: primnodes.h:1634
JS_ENC_UTF16
@ JS_ENC_UTF16
Definition: primnodes.h:1633
XMLOPTION_DOCUMENT
@ XMLOPTION_DOCUMENT
Definition: primnodes.h:1597
SVFOP_CURRENT_CATALOG
@ SVFOP_CURRENT_CATALOG
Definition: primnodes.h:1554
SVFOP_LOCALTIME_N
@ SVFOP_LOCALTIME_N
Definition: primnodes.h:1547
SVFOP_CURRENT_TIMESTAMP
@ SVFOP_CURRENT_TIMESTAMP
Definition: primnodes.h:1544
SVFOP_LOCALTIME
@ SVFOP_LOCALTIME
Definition: primnodes.h:1546
SVFOP_CURRENT_TIMESTAMP_N
@ SVFOP_CURRENT_TIMESTAMP_N
Definition: primnodes.h:1545
SVFOP_CURRENT_ROLE
@ SVFOP_CURRENT_ROLE
Definition: primnodes.h:1550
SVFOP_USER
@ SVFOP_USER
Definition: primnodes.h:1552
SVFOP_CURRENT_SCHEMA
@ SVFOP_CURRENT_SCHEMA
Definition: primnodes.h:1555
SVFOP_LOCALTIMESTAMP_N
@ SVFOP_LOCALTIMESTAMP_N
Definition: primnodes.h:1549
SVFOP_CURRENT_DATE
@ SVFOP_CURRENT_DATE
Definition: primnodes.h:1541
SVFOP_CURRENT_TIME_N
@ SVFOP_CURRENT_TIME_N
Definition: primnodes.h:1543
SVFOP_CURRENT_TIME
@ SVFOP_CURRENT_TIME
Definition: primnodes.h:1542
SVFOP_LOCALTIMESTAMP
@ SVFOP_LOCALTIMESTAMP
Definition: primnodes.h:1548
SVFOP_CURRENT_USER
@ SVFOP_CURRENT_USER
Definition: primnodes.h:1551
SVFOP_SESSION_USER
@ SVFOP_SESSION_USER
Definition: primnodes.h:1553
PARAM_MULTIEXPR
@ PARAM_MULTIEXPR
Definition: primnodes.h:387
PARAM_EXTERN
@ PARAM_EXTERN
Definition: primnodes.h:384
PARAM_EXEC
@ PARAM_EXEC
Definition: primnodes.h:385
JSW_UNCONDITIONAL
@ JSW_UNCONDITIONAL
Definition: primnodes.h:1758
JSW_CONDITIONAL
@ JSW_CONDITIONAL
Definition: primnodes.h:1757
JSW_UNSPEC
@ JSW_UNSPEC
Definition: primnodes.h:1755
JSW_NONE
@ JSW_NONE
Definition: primnodes.h:1756
IS_DOCUMENT
@ IS_DOCUMENT
Definition: primnodes.h:1592
IS_XMLFOREST
@ IS_XMLFOREST
Definition: primnodes.h:1587
IS_XMLCONCAT
@ IS_XMLCONCAT
Definition: primnodes.h:1585
IS_XMLPI
@ IS_XMLPI
Definition: primnodes.h:1589
IS_XMLPARSE
@ IS_XMLPARSE
Definition: primnodes.h:1588
IS_XMLSERIALIZE
@ IS_XMLSERIALIZE
Definition: primnodes.h:1591
IS_XMLROOT
@ IS_XMLROOT
Definition: primnodes.h:1590
IS_XMLELEMENT
@ IS_XMLELEMENT
Definition: primnodes.h:1586
VAR_RETURNING_OLD
@ VAR_RETURNING_OLD
Definition: primnodes.h:257
VAR_RETURNING_NEW
@ VAR_RETURNING_NEW
Definition: primnodes.h:258
VAR_RETURNING_DEFAULT
@ VAR_RETURNING_DEFAULT
Definition: primnodes.h:256
JsonBehaviorType
JsonBehaviorType
Definition: primnodes.h:1769
JSON_BEHAVIOR_DEFAULT
@ JSON_BEHAVIOR_DEFAULT
Definition: primnodes.h:1778
JSON_BEHAVIOR_FALSE
@ JSON_BEHAVIOR_FALSE
Definition: primnodes.h:1774
JSON_BEHAVIOR_NULL
@ JSON_BEHAVIOR_NULL
Definition: primnodes.h:1770
JSON_BEHAVIOR_EMPTY_ARRAY
@ JSON_BEHAVIOR_EMPTY_ARRAY
Definition: primnodes.h:1776
JSON_QUERY_OP
@ JSON_QUERY_OP
Definition: primnodes.h:1808
JSON_EXISTS_OP
@ JSON_EXISTS_OP
Definition: primnodes.h:1807
JSON_VALUE_OP
@ JSON_VALUE_OP
Definition: primnodes.h:1809
CoercionForm
CoercionForm
Definition: primnodes.h:750
COERCE_SQL_SYNTAX
@ COERCE_SQL_SYNTAX
Definition: primnodes.h:754
COERCE_IMPLICIT_CAST
@ COERCE_IMPLICIT_CAST
Definition: primnodes.h:753
COERCE_EXPLICIT_CAST
@ COERCE_EXPLICIT_CAST
Definition: primnodes.h:752
COERCE_EXPLICIT_CALL
@ COERCE_EXPLICIT_CALL
Definition: primnodes.h:751
OVERRIDING_SYSTEM_VALUE
@ OVERRIDING_SYSTEM_VALUE
Definition: primnodes.h:30
OVERRIDING_USER_VALUE
@ OVERRIDING_USER_VALUE
Definition: primnodes.h:29
IS_NULL
@ IS_NULL
Definition: primnodes.h:1957
IS_NOT_NULL
@ IS_NOT_NULL
Definition: primnodes.h:1957
JS_TYPE_ARRAY
@ JS_TYPE_ARRAY
Definition: primnodes.h:1729
JS_TYPE_OBJECT
@ JS_TYPE_OBJECT
Definition: primnodes.h:1728
JS_TYPE_SCALAR
@ JS_TYPE_SCALAR
Definition: primnodes.h:1730
MERGE_WHEN_NOT_MATCHED_BY_TARGET
@ MERGE_WHEN_NOT_MATCHED_BY_TARGET
Definition: primnodes.h:2003
MERGE_WHEN_NOT_MATCHED_BY_SOURCE
@ MERGE_WHEN_NOT_MATCHED_BY_SOURCE
Definition: primnodes.h:2002
MERGE_WHEN_MATCHED
@ MERGE_WHEN_MATCHED
Definition: primnodes.h:2001
OUTER_VAR
#define OUTER_VAR
Definition: primnodes.h:243
JSCTOR_JSON_SERIALIZE
@ JSCTOR_JSON_SERIALIZE
Definition: primnodes.h:1701
JSCTOR_JSON_ARRAYAGG
@ JSCTOR_JSON_ARRAYAGG
Definition: primnodes.h:1698
JSCTOR_JSON_PARSE
@ JSCTOR_JSON_PARSE
Definition: primnodes.h:1699
JSCTOR_JSON_OBJECT
@ JSCTOR_JSON_OBJECT
Definition: primnodes.h:1695
JSCTOR_JSON_SCALAR
@ JSCTOR_JSON_SCALAR
Definition: primnodes.h:1700
JSCTOR_JSON_ARRAY
@ JSCTOR_JSON_ARRAY
Definition: primnodes.h:1696
JSCTOR_JSON_OBJECTAGG
@ JSCTOR_JSON_OBJECTAGG
Definition: primnodes.h:1697
INNER_VAR
#define INNER_VAR
Definition: primnodes.h:242
INDEX_VAR
#define INDEX_VAR
Definition: primnodes.h:244
root
tree ctl root
Definition: radixtree.h:1857
stringToNode
void * stringToNode(const char *str)
Definition: read.c:90
splan
static SPIPlanPtr splan
Definition: regress.c:268
RelationGetDescr
#define RelationGetDescr(relation)
Definition: rel.h:539
RelationGetRelationName
#define RelationGetRelationName(relation)
Definition: rel.h:547
AcquireRewriteLocks
void AcquireRewriteLocks(Query *parsetree, bool forExecute, bool forUpdatePushedDown)
Definition: rewriteHandler.c:148
getInsertSelectQuery
Query * getInsertSelectQuery(Query *parsetree, Query ***subquery_ptr)
Definition: rewriteManip.c:1137
ViewSelectRuleName
#define ViewSelectRuleName
Definition: rewriteSupport.h:18
pg_get_triggerdef_ext
Datum pg_get_triggerdef_ext(PG_FUNCTION_ARGS)
Definition: ruleutils.c:885
make_viewdef
static void make_viewdef(StringInfo buf, HeapTuple ruletup, TupleDesc rulettc, int prettyFlags, int wrapColumn)
Definition: ruleutils.c:5539
removeStringInfoSpaces
static void removeStringInfoSpaces(StringInfo str)
Definition: ruleutils.c:9126
looks_like_function
static bool looks_like_function(Node *node)
Definition: ruleutils.c:10696
pg_get_partition_constraintdef
Datum pg_get_partition_constraintdef(PG_FUNCTION_ARGS)
Definition: ruleutils.c:2096
get_rtable_name
static char * get_rtable_name(int rtindex, deparse_context *context)
Definition: ruleutils.c:5133
pg_get_viewdef_wrap
Datum pg_get_viewdef_wrap(PG_FUNCTION_ARGS)
Definition: ruleutils.c:716
decompile_column_index_array
static int decompile_column_index_array(Datum column_index_array, Oid relId, bool withPeriod, StringInfo buf)
Definition: ruleutils.c:2621
set_relation_column_names
static void set_relation_column_names(deparse_namespace *dpns, RangeTblEntry *rte, deparse_columns *colinfo)
Definition: ruleutils.c:4375
appendContextKeyword
static void appendContextKeyword(deparse_context *context, const char *str, int indentBefore, int indentAfter, int indentPlus)
Definition: ruleutils.c:9072
deparse_context_for_plan_tree
List * deparse_context_for_plan_tree(PlannedStmt *pstmt, List *rtable_names)
Definition: ruleutils.c:3753
pg_get_statisticsobjdef_string
char * pg_get_statisticsobjdef_string(Oid statextid)
Definition: ruleutils.c:1627
pg_get_indexdef_ext
Datum pg_get_indexdef_ext(PG_FUNCTION_ARGS)
Definition: ruleutils.c:1198
set_using_names
static void set_using_names(deparse_namespace *dpns, Node *jtnode, List *parentUsing)
Definition: ruleutils.c:4210
find_recursive_union
static Plan * find_recursive_union(deparse_namespace *dpns, WorkTableScan *wtscan)
Definition: ruleutils.c:5233
string_to_text
static text * string_to_text(char *str)
Definition: ruleutils.c:13565
get_values_def
static void get_values_def(List *values_lists, deparse_context *context)
Definition: ruleutils.c:5724
PRETTYINDENT_LIMIT
#define PRETTYINDENT_LIMIT
Definition: ruleutils.c:85
pg_get_viewdef
Datum pg_get_viewdef(PG_FUNCTION_ARGS)
Definition: ruleutils.c:678
make_colname_unique
static char * make_colname_unique(char *colname, deparse_namespace *dpns, deparse_columns *colinfo)
Definition: ruleutils.c:4923
get_json_behavior
static void get_json_behavior(JsonBehavior *behavior, deparse_context *context, const char *on)
Definition: ruleutils.c:9163
get_simple_binary_op_name
static const char * get_simple_binary_op_name(OpExpr *expr)
Definition: ruleutils.c:8814
get_json_agg_constructor
static void get_json_agg_constructor(JsonConstructorExpr *ctor, deparse_context *context, const char *funcname, bool is_json_objectagg)
Definition: ruleutils.c:11758
pg_get_constraintdef
Datum pg_get_constraintdef(PG_FUNCTION_ARGS)
Definition: ruleutils.c:2146
set_deparse_for_query
static void set_deparse_for_query(deparse_namespace *dpns, Query *query, List *parent_namespaces)
Definition: ruleutils.c:4029
print_function_trftypes
static void print_function_trftypes(StringInfo buf, HeapTuple proctup)
Definition: ruleutils.c:3458
rsv_callback
void(* rsv_callback)(Node *node, deparse_context *context, void *callback_arg)
Definition: ruleutils.c:325
PRETTYINDENT_STD
#define PRETTYINDENT_STD
Definition: ruleutils.c:81
quote_qualified_identifier
char * quote_qualified_identifier(const char *qualifier, const char *ident)
Definition: ruleutils.c:13103
get_setop_query
static void get_setop_query(Node *setOp, Query *query, deparse_context *context)
Definition: ruleutils.c:6404
PRETTYINDENT_JOIN
#define PRETTYINDENT_JOIN
Definition: ruleutils.c:82
is_input_argument
static bool is_input_argument(int nth, const char *argmodes)
Definition: ruleutils.c:3446
get_query_def
static void get_query_def(Query *query, StringInfo buf, List *parentnamespace, TupleDesc resultDesc, bool colNamesVisible, int prettyFlags, int wrapColumn, int startIndent)
Definition: ruleutils.c:5624
get_tablesample_def
static void get_tablesample_def(TableSampleClause *tablesample, deparse_context *context)
Definition: ruleutils.c:12807
pg_get_functiondef
Datum pg_get_functiondef(PG_FUNCTION_ARGS)
Definition: ruleutils.c:2927
pg_get_function_result
Datum pg_get_function_result(PG_FUNCTION_ARGS)
Definition: ruleutils.c:3230
pg_get_indexdef
Datum pg_get_indexdef(PG_FUNCTION_ARGS)
Definition: ruleutils.c:1178
get_sublink_expr
static void get_sublink_expr(SubLink *sublink, deparse_context *context)
Definition: ruleutils.c:11810
get_name_for_var_field
static const char * get_name_for_var_field(Var *var, int fieldno, int levelsup, deparse_context *context)
Definition: ruleutils.c:8007
get_rte_alias
static void get_rte_alias(RangeTblEntry *rte, int varno, bool use_as, deparse_context *context)
Definition: ruleutils.c:12645
only_marker
#define only_marker(rte)
Definition: ruleutils.c:550
pg_get_function_arg_default
Datum pg_get_function_arg_default(PG_FUNCTION_ARGS)
Definition: ruleutils.c:3486
get_parameter
static void get_parameter(Param *param, deparse_context *context)
Definition: ruleutils.c:8677
build_colinfo_names_hash
static void build_colinfo_names_hash(deparse_columns *colinfo)
Definition: ruleutils.c:4978
pg_get_statisticsobjdef_expressions
Datum pg_get_statisticsobjdef_expressions(PG_FUNCTION_ARGS)
Definition: ruleutils.c:1838
get_delete_query_def
static void get_delete_query_def(Query *query, deparse_context *context)
Definition: ruleutils.c:7345
pg_get_ruledef
Datum pg_get_ruledef(PG_FUNCTION_ARGS)
Definition: ruleutils.c:560
get_json_table_columns
static void get_json_table_columns(TableFunc *tf, JsonTablePathScan *scan, deparse_context *context, bool showimplicit)
Definition: ruleutils.c:12066
PRETTYFLAG_INDENT
#define PRETTYFLAG_INDENT
Definition: ruleutils.c:89
get_column_alias_list
static void get_column_alias_list(deparse_columns *colinfo, deparse_context *context)
Definition: ruleutils.c:12716
pg_get_statisticsobjdef_columns
Datum pg_get_statisticsobjdef_columns(PG_FUNCTION_ARGS)
Definition: ruleutils.c:1637
pg_get_statisticsobjdef
Datum pg_get_statisticsobjdef(PG_FUNCTION_ARGS)
Definition: ruleutils.c:1608
add_to_names_hash
static void add_to_names_hash(deparse_columns *colinfo, const char *name)
Definition: ruleutils.c:5036
simple_quote_literal
static void simple_quote_literal(StringInfo buf, const char *val)
Definition: ruleutils.c:11783
colname_is_unique
static bool colname_is_unique(const char *colname, deparse_namespace *dpns, deparse_columns *colinfo)
Definition: ruleutils.c:4848
get_from_clause_coldeflist
static void get_from_clause_coldeflist(RangeTblFunction *rtfunc, deparse_columns *colinfo, deparse_context *context)
Definition: ruleutils.c:12756
pg_get_partkeydef_columns
char * pg_get_partkeydef_columns(Oid relid, bool pretty)
Definition: ruleutils.c:1924
get_from_clause
static void get_from_clause(Query *query, const char *prefix, deparse_context *context)
Definition: ruleutils.c:12260
deparse_context_for
List * deparse_context_for(const char *aliasname, Oid relid)
Definition: ruleutils.c:3708
get_func_sql_syntax
static bool get_func_sql_syntax(FuncExpr *expr, deparse_context *context)
Definition: ruleutils.c:11139
pg_get_partkeydef
Datum pg_get_partkeydef(PG_FUNCTION_ARGS)
Definition: ruleutils.c:1909
generate_qualified_relation_name
static char * generate_qualified_relation_name(Oid relid)
Definition: ruleutils.c:13203
set_simple_column_names
static void set_simple_column_names(deparse_namespace *dpns)
Definition: ruleutils.c:4098
get_json_expr_options
static void get_json_expr_options(JsonExpr *jsexpr, deparse_context *context, JsonBehaviorType default_behavior)
Definition: ruleutils.c:9201
pg_get_indexdef_columns
char * pg_get_indexdef_columns(Oid indexrelid, bool pretty)
Definition: ruleutils.c:1235
PRETTY_INDENT
#define PRETTY_INDENT(context)
Definition: ruleutils.c:102
PRETTYFLAG_PAREN
#define PRETTYFLAG_PAREN
Definition: ruleutils.c:88
get_rule_groupingset
static void get_rule_groupingset(GroupingSet *gset, List *targetlist, bool omit_parens, deparse_context *context)
Definition: ruleutils.c:6621
pg_get_indexdef_columns_extended
char * pg_get_indexdef_columns_extended(Oid indexrelid, bits16 flags)
Definition: ruleutils.c:1249
pg_get_indexdef_worker
static char * pg_get_indexdef_worker(Oid indexrelid, int colno, const Oid *excludeOps, bool attrsOnly, bool keysOnly, bool showTblSpc, bool inherits, int prettyFlags, bool missing_ok)
Definition: ruleutils.c:1270
pg_get_constraintdef_worker
static char * pg_get_constraintdef_worker(Oid constraintId, bool fullCommand, int prettyFlags, bool missing_ok)
Definition: ruleutils.c:2193
get_rule_expr_funccall
static void get_rule_expr_funccall(Node *node, deparse_context *context, bool showimplicit)
Definition: ruleutils.c:10673
generate_function_name
static char * generate_function_name(Oid funcid, int nargs, List *argnames, Oid *argtypes, bool has_variadic, bool *use_variadic_p, bool inGroupBy)
Definition: ruleutils.c:13247
expand_colnames_array_to
static void expand_colnames_array_to(deparse_columns *colinfo, int n)
Definition: ruleutils.c:4962
get_returning_clause
static void get_returning_clause(Query *query, deparse_context *context)
Definition: ruleutils.c:6365
set_deparse_context_plan
List * set_deparse_context_plan(List *dpcontext, Plan *plan, List *ancestors)
Definition: ruleutils.c:3825
find_param_generator
static SubPlan * find_param_generator(Param *param, deparse_context *context, int *column_p)
Definition: ruleutils.c:8559
add_cast_to
static void add_cast_to(StringInfo buf, Oid typid)
Definition: ruleutils.c:13469
get_special_variable
static void get_special_variable(Node *node, deparse_context *context, void *callback_arg)
Definition: ruleutils.c:7878
get_windowfunc_expr_helper
static void get_windowfunc_expr_helper(WindowFunc *wfunc, deparse_context *context, const char *funcname, const char *options, bool is_json_objectagg)
Definition: ruleutils.c:11026
get_rule_list_toplevel
static void get_rule_list_toplevel(List *lst, deparse_context *context, bool showimplicit)
Definition: ruleutils.c:10643
pg_get_statisticsobj_worker
static char * pg_get_statisticsobj_worker(Oid statextid, bool columns_only, bool missing_ok)
Definition: ruleutils.c:1654
deparse_columns_fetch
#define deparse_columns_fetch(rangetable_index, dpns)
Definition: ruleutils.c:312
get_json_constructor
static void get_json_constructor(JsonConstructorExpr *ctor, deparse_context *context, bool showimplicit)
Definition: ruleutils.c:11662
query_getrulebyoid
static const char *const query_getrulebyoid
Definition: ruleutils.c:334
get_json_path_spec
static void get_json_path_spec(Node *path_spec, deparse_context *context, bool showimplicit)
Definition: ruleutils.c:11605
printSubscripts
static void printSubscripts(SubscriptingRef *sbsref, deparse_context *context)
Definition: ruleutils.c:12989
find_param_generator_initplan
static SubPlan * find_param_generator_initplan(Param *param, Plan *plan, int *column_p)
Definition: ruleutils.c:8656
pop_ancestor_plan
static void pop_ancestor_plan(deparse_namespace *dpns, deparse_namespace *save_dpns)
Definition: ruleutils.c:5331
get_window_frame_options
static void get_window_frame_options(int frameOptions, Node *startOffset, Node *endOffset, deparse_context *context)
Definition: ruleutils.c:6828
get_rule_expr_paren
static void get_rule_expr_paren(Node *node, deparse_context *context, bool showimplicit, Node *parentNode)
Definition: ruleutils.c:9145
quote_all_identifiers
bool quote_all_identifiers
Definition: ruleutils.c:339
get_agg_expr
static void get_agg_expr(Aggref *aggref, deparse_context *context, Aggref *original_aggref)
Definition: ruleutils.c:10861
get_const_collation
static void get_const_collation(Const *constval, deparse_context *context)
Definition: ruleutils.c:11585
get_target_list
static void get_target_list(List *targetList, deparse_context *context)
Definition: ruleutils.c:6229
plan_getrulebyoid
static SPIPlanPtr plan_getrulebyoid
Definition: ruleutils.c:333
get_json_table_nested_columns
static void get_json_table_nested_columns(TableFunc *tf, JsonTablePlan *plan, deparse_context *context, bool showimplicit, bool needcomma)
Definition: ruleutils.c:12034
deparse_expression_pretty
static char * deparse_expression_pretty(Node *expr, List *dpcontext, bool forceprefix, bool showimplicit, int prettyFlags, int startIndent)
Definition: ruleutils.c:3672
pg_get_ruledef_ext
Datum pg_get_ruledef_ext(PG_FUNCTION_ARGS)
Definition: ruleutils.c:578
pg_get_indexdef_string
char * pg_get_indexdef_string(Oid indexrelid)
Definition: ruleutils.c:1225
get_insert_query_def
static void get_insert_query_def(Query *query, deparse_context *context)
Definition: ruleutils.c:6929
pg_get_querydef
char * pg_get_querydef(Query *query, bool pretty)
Definition: ruleutils.c:1588
print_function_sqlbody
static void print_function_sqlbody(StringInfo buf, HeapTuple proctup)
Definition: ruleutils.c:3556
has_dangerous_join_using
static bool has_dangerous_join_using(deparse_namespace *dpns, Node *jtnode)
Definition: ruleutils.c:4140
quote_identifier
const char * quote_identifier(const char *ident)
Definition: ruleutils.c:13019
get_rule_sortgroupclause
static Node * get_rule_sortgroupclause(Index ref, List *tlist, bool force_colno, deparse_context *context)
Definition: ruleutils.c:6552
pg_get_viewdef_worker
static char * pg_get_viewdef_worker(Oid viewoid, int prettyFlags, int wrapColumn)
Definition: ruleutils.c:789
push_ancestor_plan
static void push_ancestor_plan(deparse_namespace *dpns, ListCell *ancestor_cell, deparse_namespace *save_dpns)
Definition: ruleutils.c:5310
plan_getviewrule
static SPIPlanPtr plan_getviewrule
Definition: ruleutils.c:335
WRAP_COLUMN_DEFAULT
#define WRAP_COLUMN_DEFAULT
Definition: ruleutils.c:98
flatten_reloptions
static char * flatten_reloptions(Oid relid)
Definition: ruleutils.c:13633
pg_get_expr_worker
static text * pg_get_expr_worker(text *expr, Oid relid, int prettyFlags)
Definition: ruleutils.c:2710
processIndirection
static Node * processIndirection(Node *node, deparse_context *context)
Definition: ruleutils.c:12911
get_agg_combine_expr
static void get_agg_combine_expr(Node *node, deparse_context *context, void *callback_arg)
Definition: ruleutils.c:10999
PRETTY_PAREN
#define PRETTY_PAREN(context)
Definition: ruleutils.c:101
pg_get_triggerdef
Datum pg_get_triggerdef(PG_FUNCTION_ARGS)
Definition: ruleutils.c:871
select_rtable_names_for_explain
List * select_rtable_names_for_explain(List *rtable, Bitmapset *rels_used)
Definition: ruleutils.c:3855
pg_get_function_sqlbody
Datum pg_get_function_sqlbody(PG_FUNCTION_ARGS)
Definition: ruleutils.c:3610
pg_get_expr
Datum pg_get_expr(PG_FUNCTION_ARGS)
Definition: ruleutils.c:2675
generate_qualified_type_name
static char * generate_qualified_type_name(Oid typid)
Definition: ruleutils.c:13500
get_xmltable
static void get_xmltable(TableFunc *tf, deparse_context *context, bool showimplicit)
Definition: ruleutils.c:11935
get_utility_query_def
static void get_utility_query_def(Query *query, deparse_context *context)
Definition: ruleutils.c:7551
get_relation_name
static char * get_relation_name(Oid relid)
Definition: ruleutils.c:13123
pg_get_expr_ext
Datum pg_get_expr_ext(PG_FUNCTION_ARGS)
Definition: ruleutils.c:2692
get_rule_windowclause
static void get_rule_windowclause(Query *query, deparse_context *context)
Definition: ruleutils.c:6739
get_rule_windowspec
static void get_rule_windowspec(WindowClause *wc, List *targetList, deparse_context *context)
Definition: ruleutils.c:6771
get_json_returning
static void get_json_returning(JsonReturning *returning, StringInfo buf, bool json_format_by_default)
Definition: ruleutils.c:11642
pg_get_viewdef_name_ext
Datum pg_get_viewdef_name_ext(PG_FUNCTION_ARGS)
Definition: ruleutils.c:761
find_param_referent
static Node * find_param_referent(Param *param, deparse_context *context, deparse_namespace **dpns_p, ListCell **ancestor_cell_p)
Definition: ruleutils.c:8445
get_rule_orderby
static void get_rule_orderby(List *orderList, List *targetList, bool force_colno, deparse_context *context)
Definition: ruleutils.c:6681
pop_child_plan
static void pop_child_plan(deparse_namespace *dpns, deparse_namespace *save_dpns)
Definition: ruleutils.c:5280
generate_collation_name
char * generate_collation_name(Oid collid)
Definition: ruleutils.c:13533
pg_get_constraintdef_command
char * pg_get_constraintdef_command(Oid constraintId)
Definition: ruleutils.c:2184
pg_get_partconstrdef_string
char * pg_get_partconstrdef_string(Oid partitionId, char *aliasname)
Definition: ruleutils.c:2128
set_join_column_names
static void set_join_column_names(deparse_namespace *dpns, RangeTblEntry *rte, deparse_columns *colinfo)
Definition: ruleutils.c:4578
pg_get_constraintdef_ext
Datum pg_get_constraintdef_ext(PG_FUNCTION_ARGS)
Definition: ruleutils.c:2163
set_rtable_names
static void set_rtable_names(deparse_namespace *dpns, List *parent_namespaces, Bitmapset *rels_used)
Definition: ruleutils.c:3884
get_window_frame_options_for_explain
char * get_window_frame_options_for_explain(int frameOptions, Node *startOffset, Node *endOffset, List *dpcontext, bool forceprefix)
Definition: ruleutils.c:6897
get_update_query_targetlist_def
static void get_update_query_targetlist_def(Query *query, List *targetList, deparse_context *context, RangeTblEntry *rte)
Definition: ruleutils.c:7193
get_rule_expr
static void get_rule_expr(Node *node, deparse_context *context, bool showimplicit)
Definition: ruleutils.c:9242
pg_get_viewdef_ext
Datum pg_get_viewdef_ext(PG_FUNCTION_ARGS)
Definition: ruleutils.c:697
pg_get_partkeydef_worker
static char * pg_get_partkeydef_worker(Oid relid, int prettyFlags, bool attrsOnly, bool missing_ok)
Definition: ruleutils.c:1937
get_oper_expr
static void get_oper_expr(OpExpr *expr, deparse_context *context)
Definition: ruleutils.c:10725
pg_get_function_identity_arguments
Datum pg_get_function_identity_arguments(PG_FUNCTION_ARGS)
Definition: ruleutils.c:3205
pg_get_triggerdef_worker
static char * pg_get_triggerdef_worker(Oid trigid, bool pretty)
Definition: ruleutils.c:900
GET_PRETTY_FLAGS
#define GET_PRETTY_FLAGS(pretty)
Definition: ruleutils.c:93
get_reloptions
static void get_reloptions(StringInfo buf, Datum reloptions)
Definition: ruleutils.c:13578
get_func_expr
static void get_func_expr(FuncExpr *expr, deparse_context *context, bool showimplicit)
Definition: ruleutils.c:10765
get_const_expr
static void get_const_expr(Const *constval, deparse_context *context, int showtype)
Definition: ruleutils.c:11455
deparse_expression
char * deparse_expression(Node *expr, List *dpcontext, bool forceprefix, bool showimplicit)
Definition: ruleutils.c:3645
generate_operator_clause
void generate_operator_clause(StringInfo buf, const char *leftop, Oid leftoptype, Oid opoid, const char *rightop, Oid rightoptype)
Definition: ruleutils.c:13429
make_ruledef
static void make_ruledef(StringInfo buf, HeapTuple ruletup, TupleDesc rulettc, int prettyFlags)
Definition: ruleutils.c:5347
query_getviewrule
static const char *const query_getviewrule
Definition: ruleutils.c:336
pg_get_ruledef_worker
static char * pg_get_ruledef_worker(Oid ruleoid, int prettyFlags)
Definition: ruleutils.c:597
print_function_arguments
static int print_function_arguments(StringInfo buf, HeapTuple proctup, bool print_table_args, bool print_defaults)
Definition: ruleutils.c:3298
identify_join_columns
static void identify_join_columns(JoinExpr *j, RangeTblEntry *jrte, deparse_columns *colinfo)
Definition: ruleutils.c:5065
print_function_rettype
static void print_function_rettype(StringInfo buf, HeapTuple proctup)
Definition: ruleutils.c:3260
generate_opclass_name
char * generate_opclass_name(Oid opclass)
Definition: ruleutils.c:12889
set_deparse_plan
static void set_deparse_plan(deparse_namespace *dpns, Plan *plan)
Definition: ruleutils.c:5152
get_merge_query_def
static void get_merge_query_def(Query *query, deparse_context *context)
Definition: ruleutils.c:7392
resolve_special_varno
static void resolve_special_varno(Node *node, deparse_context *context, rsv_callback callback, void *callback_arg)
Definition: ruleutils.c:7899
get_json_format
static void get_json_format(JsonFormat *format, StringInfo buf)
Definition: ruleutils.c:11617
get_range_partbound_string
char * get_range_partbound_string(List *bound_datums)
Definition: ruleutils.c:13666
get_tablefunc
static void get_tablefunc(TableFunc *tf, deparse_context *context, bool showimplicit)
Definition: ruleutils.c:12241
get_rule_expr_toplevel
static void get_rule_expr_toplevel(Node *node, deparse_context *context, bool showimplicit)
Definition: ruleutils.c:10625
get_simple_values_rte
static RangeTblEntry * get_simple_values_rte(Query *query, TupleDesc resultDesc)
Definition: ruleutils.c:6029
get_coercion_expr
static void get_coercion_expr(Node *arg, deparse_context *context, Oid resulttype, int32 resulttypmod, Node *parentNode)
Definition: ruleutils.c:11391
push_child_plan
static void push_child_plan(deparse_namespace *dpns, Plan *plan, deparse_namespace *save_dpns)
Definition: ruleutils.c:5263
get_update_query_def
static void get_update_query_def(Query *query, deparse_context *context)
Definition: ruleutils.c:7141
get_json_constructor_options
static void get_json_constructor_options(JsonConstructorExpr *ctor, StringInfo buf)
Definition: ruleutils.c:11728
get_basic_select_query
static void get_basic_select_query(Query *query, deparse_context *context)
Definition: ruleutils.c:6098
isSimpleNode
static bool isSimpleNode(Node *node, Node *parentNode, int prettyFlags)
Definition: ruleutils.c:8840
get_with_clause
static void get_with_clause(Query *query, deparse_context *context)
Definition: ruleutils.c:5767
PRETTYINDENT_VAR
#define PRETTYINDENT_VAR
Definition: ruleutils.c:83
destroy_colinfo_names_hash
static void destroy_colinfo_names_hash(deparse_columns *colinfo)
Definition: ruleutils.c:5049
generate_relation_name
static char * generate_relation_name(Oid relid, List *namespaces)
Definition: ruleutils.c:13143
get_windowfunc_expr
static void get_windowfunc_expr(WindowFunc *wfunc, deparse_context *context)
Definition: ruleutils.c:11015
get_variable
static char * get_variable(Var *var, int levelsup, bool istoplevel, deparse_context *context)
Definition: ruleutils.c:7596
pg_get_serial_sequence
Datum pg_get_serial_sequence(PG_FUNCTION_ARGS)
Definition: ruleutils.c:2833
generate_operator_name
static char * generate_operator_name(Oid operid, Oid arg1, Oid arg2)
Definition: ruleutils.c:13352
get_from_clause_item
static void get_from_clause_item(Node *jtnode, Query *query, deparse_context *context)
Definition: ruleutils.c:12354
pg_get_function_arguments
Datum pg_get_function_arguments(PG_FUNCTION_ARGS)
Definition: ruleutils.c:3179
get_json_table
static void get_json_table(TableFunc *tf, deparse_context *context, bool showimplicit)
Definition: ruleutils.c:12172
PRETTYFLAG_SCHEMA
#define PRETTYFLAG_SCHEMA
Definition: ruleutils.c:90
get_select_query_def
static void get_select_query_def(Query *query, deparse_context *context)
Definition: ruleutils.c:5906
get_opclass_name
static void get_opclass_name(Oid opclass, Oid actual_datatype, StringInfo buf)
Definition: ruleutils.c:12851
pg_get_viewdef_name
Datum pg_get_viewdef_name(PG_FUNCTION_ARGS)
Definition: ruleutils.c:736
pg_get_userbyid
Datum pg_get_userbyid(PG_FUNCTION_ARGS)
Definition: ruleutils.c:2795
get_agg_expr_helper
static void get_agg_expr_helper(Aggref *aggref, deparse_context *context, Aggref *original_aggref, const char *funcname, const char *options, bool is_json_objectagg)
Definition: ruleutils.c:10873
RULE_INDEXDEF_PRETTY
#define RULE_INDEXDEF_PRETTY
Definition: ruleutils.h:24
RULE_INDEXDEF_KEYS_ONLY
#define RULE_INDEXDEF_KEYS_ONLY
Definition: ruleutils.h:25
standard_conforming_strings
bool standard_conforming_strings
Definition: scan.l:70
ScanKeyInit
void ScanKeyInit(ScanKey entry, AttrNumber attributeNumber, StrategyNumber strategy, RegProcedure procedure, Datum argument)
Definition: scankey.c:76
GetTransactionSnapshot
Snapshot GetTransactionSnapshot(void)
Definition: snapmgr.c:271
UnregisterSnapshot
void UnregisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:853
RegisterSnapshot
Snapshot RegisterSnapshot(Snapshot snapshot)
Definition: snapmgr.c:811
SPI_fnumber
int SPI_fnumber(TupleDesc tupdesc, const char *fname)
Definition: spi.c:1176
SPI_processed
uint64 SPI_processed
Definition: spi.c:44
SPI_tuptable
SPITupleTable * SPI_tuptable
Definition: spi.c:45
SPI_connect
int SPI_connect(void)
Definition: spi.c:95
SPI_finish
int SPI_finish(void)
Definition: spi.c:183
SPI_execute_plan
int SPI_execute_plan(SPIPlanPtr plan, Datum *Values, const char *Nulls, bool read_only, long tcount)
Definition: spi.c:673
SPI_prepare
SPIPlanPtr SPI_prepare(const char *src, int nargs, Oid *argtypes)
Definition: spi.c:861
SPI_keepplan
int SPI_keepplan(SPIPlanPtr plan)
Definition: spi.c:977
SPI_getvalue
char * SPI_getvalue(HeapTuple tuple, TupleDesc tupdesc, int fnumber)
Definition: spi.c:1221
SPI_getbinval
Datum SPI_getbinval(HeapTuple tuple, TupleDesc tupdesc, int fnumber, bool *isnull)
Definition: spi.c:1253
SPI_OK_FINISH
#define SPI_OK_FINISH
Definition: spi.h:83
SPI_OK_SELECT
#define SPI_OK_SELECT
Definition: spi.h:86
relation_close
void relation_close(Relation relation, LOCKMODE lockmode)
Definition: relation.c:205
try_relation_open
Relation try_relation_open(Oid relationId, LOCKMODE lockmode)
Definition: relation.c:88
relation_open
Relation relation_open(Oid relationId, LOCKMODE lockmode)
Definition: relation.c:47
check_stack_depth
void check_stack_depth(void)
Definition: stack_depth.c:95
BTEqualStrategyNumber
#define BTEqualStrategyNumber
Definition: stratnum.h:31
makeStringInfo
StringInfo makeStringInfo(void)
Definition: stringinfo.c:72
resetStringInfo
void resetStringInfo(StringInfo str)
Definition: stringinfo.c:126
appendStringInfo
void appendStringInfo(StringInfo str, const char *fmt,...)
Definition: stringinfo.c:145
appendBinaryStringInfo
void appendBinaryStringInfo(StringInfo str, const void *data, int datalen)
Definition: stringinfo.c:281
appendStringInfoSpaces
void appendStringInfoSpaces(StringInfo str, int count)
Definition: stringinfo.c:260
appendStringInfoString
void appendStringInfoString(StringInfo str, const char *s)
Definition: stringinfo.c:230
appendStringInfoChar
void appendStringInfoChar(StringInfo str, char ch)
Definition: stringinfo.c:242
initStringInfo
void initStringInfo(StringInfo str)
Definition: stringinfo.c:97
Aggref::aggfnoid
Oid aggfnoid
Definition: primnodes.h:461
Aggref::aggdistinct
List * aggdistinct
Definition: primnodes.h:491
Aggref::aggdirectargs
List * aggdirectargs
Definition: primnodes.h:482
Aggref::args
List * args
Definition: primnodes.h:485
Aggref::aggfilter
Expr * aggfilter
Definition: primnodes.h:494
Aggref::aggorder
List * aggorder
Definition: primnodes.h:488
AppendRelInfo::child_relid
Index child_relid
Definition: pathnodes.h:3008
AppendRelInfo::parent_relid
Index parent_relid
Definition: pathnodes.h:3007
AppendRelInfo::num_child_cols
int num_child_cols
Definition: pathnodes.h:3043
BoolExpr::boolop
BoolExprType boolop
Definition: primnodes.h:956
BoolExpr::args
List * args
Definition: primnodes.h:957
BooleanTest::booltesttype
BoolTestType booltesttype
Definition: primnodes.h:1988
BooleanTest::arg
Expr * arg
Definition: primnodes.h:1987
CaseExpr::arg
Expr * arg
Definition: primnodes.h:1330
CaseExpr::defresult
Expr * defresult
Definition: primnodes.h:1332
CaseExpr::args
List * args
Definition: primnodes.h:1331
CoalesceExpr::args
List * args
Definition: primnodes.h:1497
CoerceViaIO::arg
Expr * arg
Definition: primnodes.h:1224
CoerceViaIO::resulttype
Oid resulttype
Definition: primnodes.h:1225
CollateExpr::arg
Expr * arg
Definition: primnodes.h:1296
CommonTableExpr::ctematerialized
CTEMaterialize ctematerialized
Definition: parsenodes.h:1688
Const::consttype
Oid consttype
Definition: primnodes.h:329
CurrentOfExpr::cursor_name
char * cursor_name
Definition: primnodes.h:2103
FieldSelect::fieldnum
AttrNumber fieldnum
Definition: primnodes.h:1146
FieldSelect::arg
Expr * arg
Definition: primnodes.h:1145
FieldStore::newvals
List * newvals
Definition: primnodes.h:1177
FromExpr::quals
Node * quals
Definition: primnodes.h:2338
FromExpr::fromlist
List * fromlist
Definition: primnodes.h:2337
FuncExpr::funcid
Oid funcid
Definition: primnodes.h:767
FuncExpr::args
List * args
Definition: primnodes.h:785
GroupingSet::content
List * content
Definition: parsenodes.h:1519
HASHCTL::keysize
Size keysize
Definition: hsearch.h:75
HASHCTL::entrysize
Size entrysize
Definition: hsearch.h:76
HASHCTL::hcxt
MemoryContext hcxt
Definition: hsearch.h:86
HTAB
Definition: dynahash.c:220
IndexAmRoutine::amcanorder
bool amcanorder
Definition: amapi.h:243
JsonBehavior::expr
Node * expr
Definition: primnodes.h:1796
JsonBehavior::btype
JsonBehaviorType btype
Definition: primnodes.h:1795
JsonConstructorExpr::returning
JsonReturning * returning
Definition: primnodes.h:1715
JsonConstructorExpr::type
JsonConstructorType type
Definition: primnodes.h:1711
JsonExpr::formatted_expr
Node * formatted_expr
Definition: primnodes.h:1828
JsonExpr::passing_values
List * passing_values
Definition: primnodes.h:1841
JsonExpr::on_empty
JsonBehavior * on_empty
Definition: primnodes.h:1844
JsonExpr::format
JsonFormat * format
Definition: primnodes.h:1831
JsonExpr::passing_names
List * passing_names
Definition: primnodes.h:1840
JsonExpr::path_spec
Node * path_spec
Definition: primnodes.h:1834
JsonExpr::returning
JsonReturning * returning
Definition: primnodes.h:1837
JsonExpr::wrapper
JsonWrapper wrapper
Definition: primnodes.h:1855
JsonExpr::op
JsonExprOp op
Definition: primnodes.h:1822
JsonExpr::on_error
JsonBehavior * on_error
Definition: primnodes.h:1845
JsonExpr::omit_quotes
bool omit_quotes
Definition: primnodes.h:1858
JsonFormat::format_type
JsonFormatType format_type
Definition: primnodes.h:1656
JsonIsPredicate::item_type
JsonValueType item_type
Definition: primnodes.h:1742
JsonReturning::format
JsonFormat * format
Definition: primnodes.h:1668
JsonTablePathScan::path
JsonTablePath * path
Definition: primnodes.h:1903
JsonTablePathScan::child
JsonTablePlan * child
Definition: primnodes.h:1912
JsonTablePath::value
Const * value
Definition: primnodes.h:1876
JsonTableSiblingJoin::rplan
JsonTablePlan * rplan
Definition: primnodes.h:1933
JsonTableSiblingJoin::lplan
JsonTablePlan * lplan
Definition: primnodes.h:1932
JsonValueExpr::format
JsonFormat * format
Definition: primnodes.h:1690
JsonValueExpr::raw_expr
Expr * raw_expr
Definition: primnodes.h:1688
List
Definition: pg_list.h:54
MinMaxExpr::args
List * args
Definition: primnodes.h:1523
MinMaxExpr::op
MinMaxOp op
Definition: primnodes.h:1521
NamedArgExpr::arg
Expr * arg
Definition: primnodes.h:808
NestLoopParam::paramval
Var * paramval
Definition: plannodes.h:957
NestLoop::nestParams
List * nestParams
Definition: plannodes.h:946
Node
Definition: nodes.h:131
NullTest::nulltesttype
NullTestType nulltesttype
Definition: primnodes.h:1964
NullTest::arg
Expr * arg
Definition: primnodes.h:1963
OnConflictExpr::arbiterElems
List * arbiterElems
Definition: primnodes.h:2356
OnConflictExpr::action
OnConflictAction action
Definition: primnodes.h:2353
OnConflictExpr::onConflictSet
List * onConflictSet
Definition: primnodes.h:2362
OnConflictExpr::onConflictWhere
Node * onConflictWhere
Definition: primnodes.h:2363
OnConflictExpr::arbiterWhere
Node * arbiterWhere
Definition: primnodes.h:2358
OpExpr::opno
Oid opno
Definition: primnodes.h:835
OpExpr::args
List * args
Definition: primnodes.h:853
Param::paramid
int paramid
Definition: primnodes.h:394
Param::paramkind
ParamKind paramkind
Definition: primnodes.h:393
PartitionRangeDatum::kind
PartitionRangeDatumKind kind
Definition: parsenodes.h:944
Plan::targetlist
List * targetlist
Definition: plannodes.h:206
PlannedStmt::appendRelations
List * appendRelations
Definition: plannodes.h:113
PlannedStmt::subplans
List * subplans
Definition: plannodes.h:118
PlannedStmt::rtable
List * rtable
Definition: plannodes.h:88
Query::rowMarks
List * rowMarks
Definition: parsenodes.h:228
Query::groupDistinct
bool groupDistinct
Definition: parsenodes.h:212
Query::mergeJoinCondition
Node * mergeJoinCondition
Definition: parsenodes.h:191
Query::limitCount
Node * limitCount
Definition: parsenodes.h:225
Query::jointree
FromExpr * jointree
Definition: parsenodes.h:177
Query::returningList
List * returningList
Definition: parsenodes.h:209
Query::setOperations
Node * setOperations
Definition: parsenodes.h:230
Query::cteList
List * cteList
Definition: parsenodes.h:168
Query::onConflict
OnConflictExpr * onConflict
Definition: parsenodes.h:198
Query::groupClause
List * groupClause
Definition: parsenodes.h:211
Query::havingQual
Node * havingQual
Definition: parsenodes.h:216
Query::rtable
List * rtable
Definition: parsenodes.h:170
Query::limitOffset
Node * limitOffset
Definition: parsenodes.h:224
Query::commandType
CmdType commandType
Definition: parsenodes.h:121
Query::limitOption
LimitOption limitOption
Definition: parsenodes.h:226
Query::utilityStmt
Node * utilityStmt
Definition: parsenodes.h:136
Query::mergeActionList
List * mergeActionList
Definition: parsenodes.h:180
Query::windowClause
List * windowClause
Definition: parsenodes.h:218
Query::targetList
List * targetList
Definition: parsenodes.h:193
Query::groupingSets
List * groupingSets
Definition: parsenodes.h:214
Query::distinctClause
List * distinctClause
Definition: parsenodes.h:220
Query::sortClause
List * sortClause
Definition: parsenodes.h:222
RangeTblEntry::ctename
char * ctename
Definition: parsenodes.h:1205
RangeTblEntry::tablefunc
TableFunc * tablefunc
Definition: parsenodes.h:1193
RangeTblEntry::ctelevelsup
Index ctelevelsup
Definition: parsenodes.h:1207
RangeTblEntry::funcordinality
bool funcordinality
Definition: parsenodes.h:1188
RangeTblEntry::tablesample
struct TableSampleClause * tablesample
Definition: parsenodes.h:1107
RangeTblEntry::subquery
Query * subquery
Definition: parsenodes.h:1113
RangeTblEntry::values_lists
List * values_lists
Definition: parsenodes.h:1199
RangeTblEntry::functions
List * functions
Definition: parsenodes.h:1186
RangeTblEntry::rtekind
RTEKind rtekind
Definition: parsenodes.h:1056
RangeVar::relname
char * relname
Definition: primnodes.h:83
RelabelType::resulttype
Oid resulttype
Definition: primnodes.h:1202
RelabelType::arg
Expr * arg
Definition: primnodes.h:1201
RelationData::rd_att
TupleDesc rd_att
Definition: rel.h:112
ReturningExpr::retexpr
Expr * retexpr
Definition: primnodes.h:2157
RowExpr::args
List * args
Definition: primnodes.h:1428
RowMarkClause::strength
LockClauseStrength strength
Definition: parsenodes.h:1589
RowMarkClause::waitPolicy
LockWaitPolicy waitPolicy
Definition: parsenodes.h:1590
SPITupleTable::tupdesc
TupleDesc tupdesc
Definition: spi.h:25
SPITupleTable::vals
HeapTuple * vals
Definition: spi.h:26
SQLValueFunction::op
SQLValueFunctionOp op
Definition: primnodes.h:1561
SetOperationStmt::op
SetOperation op
Definition: parsenodes.h:2242
SortGroupClause::tleSortGroupRef
Index tleSortGroupRef
Definition: parsenodes.h:1447
String
Definition: value.h:64
SubPlan::plan_name
char * plan_name
Definition: primnodes.h:1089
SubPlan::args
List * args
Definition: primnodes.h:1108
SubPlan::paramIds
List * paramIds
Definition: primnodes.h:1085
SubPlan::useHashTable
bool useHashTable
Definition: primnodes.h:1096
SubPlan::testexpr
Node * testexpr
Definition: primnodes.h:1084
SubPlan::parParam
List * parParam
Definition: primnodes.h:1107
SubPlan::setParam
List * setParam
Definition: primnodes.h:1105
SubPlan::subLinkType
SubLinkType subLinkType
Definition: primnodes.h:1082
SubscriptingRef::refassgnexpr
Expr * refassgnexpr
Definition: primnodes.h:720
SubscriptingRef::refupperindexpr
List * refupperindexpr
Definition: primnodes.h:710
SubscriptingRef::refexpr
Expr * refexpr
Definition: primnodes.h:718
SubscriptingRef::reflowerindexpr
List * reflowerindexpr
Definition: primnodes.h:716
TableFunc::docexpr
Node * docexpr
Definition: primnodes.h:120
TableFunc::rowexpr
Node * rowexpr
Definition: primnodes.h:122
TableFunc::colexprs
List * colexprs
Definition: primnodes.h:132
TableFunc::functype
TableFuncType functype
Definition: primnodes.h:114
TargetEntry::expr
Expr * expr
Definition: primnodes.h:2219
TargetEntry::resno
AttrNumber resno
Definition: primnodes.h:2221
Var
Definition: primnodes.h:262
Var::varattno
AttrNumber varattno
Definition: primnodes.h:274
Var::varno
int varno
Definition: primnodes.h:269
Var::varreturningtype
VarReturningType varreturningtype
Definition: primnodes.h:297
Var::varlevelsup
Index varlevelsup
Definition: primnodes.h:294
WindowAgg::winname
char * winname
Definition: plannodes.h:1182
WindowAgg::winref
Index winref
Definition: plannodes.h:1185
WindowClause::startOffset
Node * startOffset
Definition: parsenodes.h:1556
WindowClause::partitionClause
List * partitionClause
Definition: parsenodes.h:1552
WindowClause::endOffset
Node * endOffset
Definition: parsenodes.h:1557
WindowClause::orderClause
List * orderClause
Definition: parsenodes.h:1554
WindowFunc::args
List * args
Definition: primnodes.h:592
WindowFunc::winref
Index winref
Definition: primnodes.h:598
WindowFunc::aggfilter
Expr * aggfilter
Definition: primnodes.h:594
WindowFunc::winfnoid
Oid winfnoid
Definition: primnodes.h:584
XmlExpr::args
List * args
Definition: primnodes.h:1613
XmlExpr::indent
bool indent
Definition: primnodes.h:1617
XmlExpr::named_args
List * named_args
Definition: primnodes.h:1609
XmlExpr::op
XmlExprOp op
Definition: primnodes.h:1605
_SPI_plan
Definition: spi_priv.h:91
deparse_columns
Definition: ruleutils.c:235
deparse_columns::leftrti
int leftrti
Definition: ruleutils.c:295
deparse_columns::parentUsing
List * parentUsing
Definition: ruleutils.c:276
deparse_columns::printaliases
bool printaliases
Definition: ruleutils.c:273
deparse_columns::rightrti
int rightrti
Definition: ruleutils.c:296
deparse_columns::names_hash
HTAB * names_hash
Definition: ruleutils.c:308
deparse_columns::new_colnames
char ** new_colnames
Definition: ruleutils.c:269
deparse_columns::num_new_cols
int num_new_cols
Definition: ruleutils.c:268
deparse_columns::colnames
char ** colnames
Definition: ruleutils.c:252
deparse_columns::num_cols
int num_cols
Definition: ruleutils.c:251
deparse_columns::rightattnos
int * rightattnos
Definition: ruleutils.c:298
deparse_columns::usingNames
List * usingNames
Definition: ruleutils.c:299
deparse_columns::is_new_col
bool * is_new_col
Definition: ruleutils.c:270
deparse_columns::leftattnos
int * leftattnos
Definition: ruleutils.c:297
deparse_context
Definition: ruleutils.c:113
deparse_context::indentLevel
int indentLevel
Definition: ruleutils.c:121
deparse_context::resultDesc
TupleDesc resultDesc
Definition: ruleutils.c:116
deparse_context::buf
StringInfo buf
Definition: ruleutils.c:114
deparse_context::wrapColumn
int wrapColumn
Definition: ruleutils.c:120
deparse_context::targetList
List * targetList
Definition: ruleutils.c:117
deparse_context::inGroupBy
bool inGroupBy
Definition: ruleutils.c:124
deparse_context::colNamesVisible
bool colNamesVisible
Definition: ruleutils.c:123
deparse_context::namespaces
List * namespaces
Definition: ruleutils.c:115
deparse_context::varprefix
bool varprefix
Definition: ruleutils.c:122
deparse_context::varInOrderBy
bool varInOrderBy
Definition: ruleutils.c:125
deparse_context::windowClause
List * windowClause
Definition: ruleutils.c:118
deparse_context::appendparents
Bitmapset * appendparents
Definition: ruleutils.c:126
deparse_context::prettyFlags
int prettyFlags
Definition: ruleutils.c:119
deparse_namespace
Definition: ruleutils.c:163
deparse_namespace::rtable_names
List * rtable_names
Definition: ruleutils.c:165
deparse_namespace::inner_tlist
List * inner_tlist
Definition: ruleutils.c:181
deparse_namespace::unique_using
bool unique_using
Definition: ruleutils.c:173
deparse_namespace::rtable
List * rtable
Definition: ruleutils.c:164
deparse_namespace::outer_tlist
List * outer_tlist
Definition: ruleutils.c:180
deparse_namespace::inner_plan
Plan * inner_plan
Definition: ruleutils.c:179
deparse_namespace::funcname
char * funcname
Definition: ruleutils.c:184
deparse_namespace::ctes
List * ctes
Definition: ruleutils.c:168
deparse_namespace::argnames
char ** argnames
Definition: ruleutils.c:186
deparse_namespace::plan
Plan * plan
Definition: ruleutils.c:176
deparse_namespace::subplans
List * subplans
Definition: ruleutils.c:167
deparse_namespace::appendrels
AppendRelInfo ** appendrels
Definition: ruleutils.c:169
deparse_namespace::ret_old_alias
char * ret_old_alias
Definition: ruleutils.c:170
deparse_namespace::rtable_columns
List * rtable_columns
Definition: ruleutils.c:166
deparse_namespace::ret_new_alias
char * ret_new_alias
Definition: ruleutils.c:171
deparse_namespace::index_tlist
List * index_tlist
Definition: ruleutils.c:182
deparse_namespace::ancestors
List * ancestors
Definition: ruleutils.c:177
deparse_namespace::numargs
int numargs
Definition: ruleutils.c:185
deparse_namespace::outer_plan
Plan * outer_plan
Definition: ruleutils.c:178
deparse_namespace::using_names
List * using_names
Definition: ruleutils.c:174
int2vector
Definition: c.h:686
int2vector::values
int16 values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:693
nameData
Definition: c.h:712
oidvector
Definition: c.h:697
oidvector::values
Oid values[FLEXIBLE_ARRAY_MEMBER]
Definition: c.h:704
varlena
Definition: c.h:658
when
Definition: type.h:89
ReleaseSysCache
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:269
SearchSysCache1
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:221
SysCacheGetAttr
Datum SysCacheGetAttr(int cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
Definition: syscache.c:600
SysCacheGetAttrNotNull
Datum SysCacheGetAttrNotNull(int cacheId, HeapTuple tup, AttrNumber attributeNumber)
Definition: syscache.c:631
table_close
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:126
table_open
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:40
callback
static void callback(struct sockaddr *addr, struct sockaddr *mask, void *unused)
Definition: test_ifaddrs.c:46
get_sortgroupref_tle
TargetEntry * get_sortgroupref_tle(Index sortref, List *targetList)
Definition: tlist.c:345
count_nonjunk_tlist_entries
int count_nonjunk_tlist_entries(List *tlist)
Definition: tlist.c:186
ReleaseTupleDesc
#define ReleaseTupleDesc(tupdesc)
Definition: tupdesc.h:213
TupleDescAttr
static FormData_pg_attribute * TupleDescAttr(TupleDesc tupdesc, int i)
Definition: tupdesc.h:154
lookup_rowtype_tupdesc
TupleDesc lookup_rowtype_tupdesc(Oid type_id, int32 typmod)
Definition: typcache.c:1920
lookup_type_cache
TypeCacheEntry * lookup_type_cache(Oid type_id, int flags)
Definition: typcache.c:386
TYPECACHE_GT_OPR
#define TYPECACHE_GT_OPR
Definition: typcache.h:139
TYPECACHE_LT_OPR
#define TYPECACHE_LT_OPR
Definition: typcache.h:138
makeString
String * makeString(char *str)
Definition: value.c:63
strVal
#define strVal(v)
Definition: value.h:82
flatten_group_exprs
Node * flatten_group_exprs(PlannerInfo *root, Query *query, Node *node)
Definition: var.c:968
pull_varnos
Relids pull_varnos(PlannerInfo *root, Node *node)
Definition: var.c:114
VARDATA_ANY
#define VARDATA_ANY(PTR)
Definition: varatt.h:324
cstring_to_text_with_len
text * cstring_to_text_with_len(const char *s, int len)
Definition: varlena.c:204
SplitGUCList
bool SplitGUCList(char *rawstring, char separator, List **namelist)
Definition: varlena.c:3773
cstring_to_text
text * cstring_to_text(const char *s)
Definition: varlena.c:192
text_to_cstring
char * text_to_cstring(const text *t)
Definition: varlena.c:225
textToQualifiedNameList
List * textToQualifiedNameList(text *textval)
Definition: varlena.c:3467
type
const char * type
Definition: wait_event_funcs.c:27
name
const char * name
Definition: wait_event_funcs.c:28
map_xml_name_to_sql_identifier
char * map_xml_name_to_sql_identifier(const char *name)
Definition: xml.c:2434
XML_STANDALONE_NO_VALUE
@ XML_STANDALONE_NO_VALUE
Definition: xml.h:29
XML_STANDALONE_YES
@ XML_STANDALONE_YES
Definition: xml.h:27
XML_STANDALONE_NO
@ XML_STANDALONE_NO
Definition: xml.h:28
convert
static void convert(const int32 val, char *const buf)
Definition: zic.c:1992