Line data Source code
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 */
112 : typedef 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 : */
162 : typedef 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 : */
234 : typedef 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 : */
318 : typedef 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() */
325 : typedef void (*rsv_callback) (Node *node, deparse_context *context,
326 : void *callback_arg);
327 :
328 :
329 : /* ----------
330 : * Global data
331 : * ----------
332 : */
333 : static SPIPlanPtr plan_getrulebyoid = NULL;
334 : static const char *const query_getrulebyoid = "SELECT * FROM pg_catalog.pg_rewrite WHERE oid = $1";
335 : static SPIPlanPtr plan_getviewrule = NULL;
336 : static const char *const query_getviewrule = "SELECT * FROM pg_catalog.pg_rewrite WHERE ev_class = $1 AND rulename = $2";
337 :
338 : /* GUC parameters */
339 : bool 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 : */
350 : static char *deparse_expression_pretty(Node *expr, List *dpcontext,
351 : bool forceprefix, bool showimplicit,
352 : int prettyFlags, int startIndent);
353 : static char *pg_get_viewdef_worker(Oid viewoid,
354 : int prettyFlags, int wrapColumn);
355 : static char *pg_get_triggerdef_worker(Oid trigid, bool pretty);
356 : static int decompile_column_index_array(Datum column_index_array, Oid relId,
357 : bool withPeriod, StringInfo buf);
358 : static char *pg_get_ruledef_worker(Oid ruleoid, int prettyFlags);
359 : static 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);
364 : static char *pg_get_statisticsobj_worker(Oid statextid, bool columns_only,
365 : bool missing_ok);
366 : static char *pg_get_partkeydef_worker(Oid relid, int prettyFlags,
367 : bool attrsOnly, bool missing_ok);
368 : static char *pg_get_constraintdef_worker(Oid constraintId, bool fullCommand,
369 : int prettyFlags, bool missing_ok);
370 : static text *pg_get_expr_worker(text *expr, Oid relid, int prettyFlags);
371 : static int print_function_arguments(StringInfo buf, HeapTuple proctup,
372 : bool print_table_args, bool print_defaults);
373 : static void print_function_rettype(StringInfo buf, HeapTuple proctup);
374 : static void print_function_trftypes(StringInfo buf, HeapTuple proctup);
375 : static void print_function_sqlbody(StringInfo buf, HeapTuple proctup);
376 : static void set_rtable_names(deparse_namespace *dpns, List *parent_namespaces,
377 : Bitmapset *rels_used);
378 : static void set_deparse_for_query(deparse_namespace *dpns, Query *query,
379 : List *parent_namespaces);
380 : static void set_simple_column_names(deparse_namespace *dpns);
381 : static bool has_dangerous_join_using(deparse_namespace *dpns, Node *jtnode);
382 : static void set_using_names(deparse_namespace *dpns, Node *jtnode,
383 : List *parentUsing);
384 : static void set_relation_column_names(deparse_namespace *dpns,
385 : RangeTblEntry *rte,
386 : deparse_columns *colinfo);
387 : static void set_join_column_names(deparse_namespace *dpns, RangeTblEntry *rte,
388 : deparse_columns *colinfo);
389 : static bool colname_is_unique(const char *colname, deparse_namespace *dpns,
390 : deparse_columns *colinfo);
391 : static char *make_colname_unique(char *colname, deparse_namespace *dpns,
392 : deparse_columns *colinfo);
393 : static void expand_colnames_array_to(deparse_columns *colinfo, int n);
394 : static void build_colinfo_names_hash(deparse_columns *colinfo);
395 : static void add_to_names_hash(deparse_columns *colinfo, const char *name);
396 : static void destroy_colinfo_names_hash(deparse_columns *colinfo);
397 : static void identify_join_columns(JoinExpr *j, RangeTblEntry *jrte,
398 : deparse_columns *colinfo);
399 : static char *get_rtable_name(int rtindex, deparse_context *context);
400 : static void set_deparse_plan(deparse_namespace *dpns, Plan *plan);
401 : static Plan *find_recursive_union(deparse_namespace *dpns,
402 : WorkTableScan *wtscan);
403 : static void push_child_plan(deparse_namespace *dpns, Plan *plan,
404 : deparse_namespace *save_dpns);
405 : static void pop_child_plan(deparse_namespace *dpns,
406 : deparse_namespace *save_dpns);
407 : static void push_ancestor_plan(deparse_namespace *dpns, ListCell *ancestor_cell,
408 : deparse_namespace *save_dpns);
409 : static void pop_ancestor_plan(deparse_namespace *dpns,
410 : deparse_namespace *save_dpns);
411 : static void make_ruledef(StringInfo buf, HeapTuple ruletup, TupleDesc rulettc,
412 : int prettyFlags);
413 : static void make_viewdef(StringInfo buf, HeapTuple ruletup, TupleDesc rulettc,
414 : int prettyFlags, int wrapColumn);
415 : static void get_query_def(Query *query, StringInfo buf, List *parentnamespace,
416 : TupleDesc resultDesc, bool colNamesVisible,
417 : int prettyFlags, int wrapColumn, int startIndent);
418 : static void get_values_def(List *values_lists, deparse_context *context);
419 : static void get_with_clause(Query *query, deparse_context *context);
420 : static void get_select_query_def(Query *query, deparse_context *context);
421 : static void get_insert_query_def(Query *query, deparse_context *context);
422 : static void get_update_query_def(Query *query, deparse_context *context);
423 : static void get_update_query_targetlist_def(Query *query, List *targetList,
424 : deparse_context *context,
425 : RangeTblEntry *rte);
426 : static void get_delete_query_def(Query *query, deparse_context *context);
427 : static void get_merge_query_def(Query *query, deparse_context *context);
428 : static void get_utility_query_def(Query *query, deparse_context *context);
429 : static void get_basic_select_query(Query *query, deparse_context *context);
430 : static void get_target_list(List *targetList, deparse_context *context);
431 : static void get_returning_clause(Query *query, deparse_context *context);
432 : static void get_setop_query(Node *setOp, Query *query,
433 : deparse_context *context);
434 : static Node *get_rule_sortgroupclause(Index ref, List *tlist,
435 : bool force_colno,
436 : deparse_context *context);
437 : static void get_rule_groupingset(GroupingSet *gset, List *targetlist,
438 : bool omit_parens, deparse_context *context);
439 : static void get_rule_orderby(List *orderList, List *targetList,
440 : bool force_colno, deparse_context *context);
441 : static void get_rule_windowclause(Query *query, deparse_context *context);
442 : static void get_rule_windowspec(WindowClause *wc, List *targetList,
443 : deparse_context *context);
444 : static void get_window_frame_options(int frameOptions,
445 : Node *startOffset, Node *endOffset,
446 : deparse_context *context);
447 : static char *get_variable(Var *var, int levelsup, bool istoplevel,
448 : deparse_context *context);
449 : static void get_special_variable(Node *node, deparse_context *context,
450 : void *callback_arg);
451 : static void resolve_special_varno(Node *node, deparse_context *context,
452 : rsv_callback callback, void *callback_arg);
453 : static Node *find_param_referent(Param *param, deparse_context *context,
454 : deparse_namespace **dpns_p, ListCell **ancestor_cell_p);
455 : static SubPlan *find_param_generator(Param *param, deparse_context *context,
456 : int *column_p);
457 : static SubPlan *find_param_generator_initplan(Param *param, Plan *plan,
458 : int *column_p);
459 : static void get_parameter(Param *param, deparse_context *context);
460 : static const char *get_simple_binary_op_name(OpExpr *expr);
461 : static bool isSimpleNode(Node *node, Node *parentNode, int prettyFlags);
462 : static void appendContextKeyword(deparse_context *context, const char *str,
463 : int indentBefore, int indentAfter, int indentPlus);
464 : static void removeStringInfoSpaces(StringInfo str);
465 : static void get_rule_expr(Node *node, deparse_context *context,
466 : bool showimplicit);
467 : static void get_rule_expr_toplevel(Node *node, deparse_context *context,
468 : bool showimplicit);
469 : static void get_rule_list_toplevel(List *lst, deparse_context *context,
470 : bool showimplicit);
471 : static void get_rule_expr_funccall(Node *node, deparse_context *context,
472 : bool showimplicit);
473 : static bool looks_like_function(Node *node);
474 : static void get_oper_expr(OpExpr *expr, deparse_context *context);
475 : static void get_func_expr(FuncExpr *expr, deparse_context *context,
476 : bool showimplicit);
477 : static void get_agg_expr(Aggref *aggref, deparse_context *context,
478 : Aggref *original_aggref);
479 : static 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);
482 : static void get_agg_combine_expr(Node *node, deparse_context *context,
483 : void *callback_arg);
484 : static void get_windowfunc_expr(WindowFunc *wfunc, deparse_context *context);
485 : static void get_windowfunc_expr_helper(WindowFunc *wfunc, deparse_context *context,
486 : const char *funcname, const char *options,
487 : bool is_json_objectagg);
488 : static bool get_func_sql_syntax(FuncExpr *expr, deparse_context *context);
489 : static void get_coercion_expr(Node *arg, deparse_context *context,
490 : Oid resulttype, int32 resulttypmod,
491 : Node *parentNode);
492 : static void get_const_expr(Const *constval, deparse_context *context,
493 : int showtype);
494 : static void get_const_collation(Const *constval, deparse_context *context);
495 : static void get_json_format(JsonFormat *format, StringInfo buf);
496 : static void get_json_returning(JsonReturning *returning, StringInfo buf,
497 : bool json_format_by_default);
498 : static void get_json_constructor(JsonConstructorExpr *ctor,
499 : deparse_context *context, bool showimplicit);
500 : static void get_json_constructor_options(JsonConstructorExpr *ctor,
501 : StringInfo buf);
502 : static void get_json_agg_constructor(JsonConstructorExpr *ctor,
503 : deparse_context *context,
504 : const char *funcname,
505 : bool is_json_objectagg);
506 : static void simple_quote_literal(StringInfo buf, const char *val);
507 : static void get_sublink_expr(SubLink *sublink, deparse_context *context);
508 : static void get_tablefunc(TableFunc *tf, deparse_context *context,
509 : bool showimplicit);
510 : static void get_from_clause(Query *query, const char *prefix,
511 : deparse_context *context);
512 : static void get_from_clause_item(Node *jtnode, Query *query,
513 : deparse_context *context);
514 : static void get_rte_alias(RangeTblEntry *rte, int varno, bool use_as,
515 : deparse_context *context);
516 : static void get_column_alias_list(deparse_columns *colinfo,
517 : deparse_context *context);
518 : static void get_from_clause_coldeflist(RangeTblFunction *rtfunc,
519 : deparse_columns *colinfo,
520 : deparse_context *context);
521 : static void get_tablesample_def(TableSampleClause *tablesample,
522 : deparse_context *context);
523 : static void get_opclass_name(Oid opclass, Oid actual_datatype,
524 : StringInfo buf);
525 : static Node *processIndirection(Node *node, deparse_context *context);
526 : static void printSubscripts(SubscriptingRef *sbsref, deparse_context *context);
527 : static char *get_relation_name(Oid relid);
528 : static char *generate_relation_name(Oid relid, List *namespaces);
529 : static char *generate_qualified_relation_name(Oid relid);
530 : static char *generate_function_name(Oid funcid, int nargs,
531 : List *argnames, Oid *argtypes,
532 : bool has_variadic, bool *use_variadic_p,
533 : bool inGroupBy);
534 : static char *generate_operator_name(Oid operid, Oid arg1, Oid arg2);
535 : static void add_cast_to(StringInfo buf, Oid typid);
536 : static char *generate_qualified_type_name(Oid typid);
537 : static text *string_to_text(char *str);
538 : static char *flatten_reloptions(Oid relid);
539 : static void get_reloptions(StringInfo buf, Datum reloptions);
540 : static void get_json_path_spec(Node *path_spec, deparse_context *context,
541 : bool showimplicit);
542 : static void get_json_table_columns(TableFunc *tf, JsonTablePathScan *scan,
543 : deparse_context *context,
544 : bool showimplicit);
545 : static 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 : */
559 : Datum
560 450 : pg_get_ruledef(PG_FUNCTION_ARGS)
561 : {
562 450 : Oid ruleoid = PG_GETARG_OID(0);
563 : int prettyFlags;
564 : char *res;
565 :
566 450 : prettyFlags = PRETTYFLAG_INDENT;
567 :
568 450 : res = pg_get_ruledef_worker(ruleoid, prettyFlags);
569 :
570 450 : if (res == NULL)
571 6 : PG_RETURN_NULL();
572 :
573 444 : PG_RETURN_TEXT_P(string_to_text(res));
574 : }
575 :
576 :
577 : Datum
578 114 : pg_get_ruledef_ext(PG_FUNCTION_ARGS)
579 : {
580 114 : Oid ruleoid = PG_GETARG_OID(0);
581 114 : bool pretty = PG_GETARG_BOOL(1);
582 : int prettyFlags;
583 : char *res;
584 :
585 114 : prettyFlags = GET_PRETTY_FLAGS(pretty);
586 :
587 114 : res = pg_get_ruledef_worker(ruleoid, prettyFlags);
588 :
589 114 : if (res == NULL)
590 0 : PG_RETURN_NULL();
591 :
592 114 : PG_RETURN_TEXT_P(string_to_text(res));
593 : }
594 :
595 :
596 : static char *
597 564 : pg_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 564 : initStringInfo(&buf);
610 :
611 : /*
612 : * Connect to SPI manager
613 : */
614 564 : 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 564 : if (plan_getrulebyoid == NULL)
622 : {
623 : Oid argtypes[1];
624 : SPIPlanPtr plan;
625 :
626 40 : argtypes[0] = OIDOID;
627 40 : plan = SPI_prepare(query_getrulebyoid, 1, argtypes);
628 40 : if (plan == NULL)
629 0 : elog(ERROR, "SPI_prepare failed for \"%s\"", query_getrulebyoid);
630 40 : SPI_keepplan(plan);
631 40 : plan_getrulebyoid = plan;
632 : }
633 :
634 : /*
635 : * Get the pg_rewrite tuple for this rule
636 : */
637 564 : args[0] = ObjectIdGetDatum(ruleoid);
638 564 : nulls[0] = ' ';
639 564 : spirc = SPI_execute_plan(plan_getrulebyoid, args, nulls, true, 0);
640 564 : if (spirc != SPI_OK_SELECT)
641 0 : elog(ERROR, "failed to get pg_rewrite tuple for rule %u", ruleoid);
642 564 : 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 558 : ruletup = SPI_tuptable->vals[0];
655 558 : rulettc = SPI_tuptable->tupdesc;
656 558 : make_ruledef(&buf, ruletup, rulettc, prettyFlags);
657 : }
658 :
659 : /*
660 : * Disconnect from SPI manager
661 : */
662 564 : if (SPI_finish() != SPI_OK_FINISH)
663 0 : elog(ERROR, "SPI_finish failed");
664 :
665 564 : if (buf.len == 0)
666 6 : return NULL;
667 :
668 558 : 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 : */
677 : Datum
678 2542 : pg_get_viewdef(PG_FUNCTION_ARGS)
679 : {
680 : /* By OID */
681 2542 : Oid viewoid = PG_GETARG_OID(0);
682 : int prettyFlags;
683 : char *res;
684 :
685 2542 : prettyFlags = PRETTYFLAG_INDENT;
686 :
687 2542 : res = pg_get_viewdef_worker(viewoid, prettyFlags, WRAP_COLUMN_DEFAULT);
688 :
689 2542 : if (res == NULL)
690 6 : PG_RETURN_NULL();
691 :
692 2536 : PG_RETURN_TEXT_P(string_to_text(res));
693 : }
694 :
695 :
696 : Datum
697 556 : pg_get_viewdef_ext(PG_FUNCTION_ARGS)
698 : {
699 : /* By OID */
700 556 : Oid viewoid = PG_GETARG_OID(0);
701 556 : bool pretty = PG_GETARG_BOOL(1);
702 : int prettyFlags;
703 : char *res;
704 :
705 556 : prettyFlags = GET_PRETTY_FLAGS(pretty);
706 :
707 556 : res = pg_get_viewdef_worker(viewoid, prettyFlags, WRAP_COLUMN_DEFAULT);
708 :
709 556 : if (res == NULL)
710 0 : PG_RETURN_NULL();
711 :
712 556 : PG_RETURN_TEXT_P(string_to_text(res));
713 : }
714 :
715 : Datum
716 6 : pg_get_viewdef_wrap(PG_FUNCTION_ARGS)
717 : {
718 : /* By OID */
719 6 : Oid viewoid = PG_GETARG_OID(0);
720 6 : int wrap = PG_GETARG_INT32(1);
721 : int prettyFlags;
722 : char *res;
723 :
724 : /* calling this implies we want pretty printing */
725 6 : prettyFlags = GET_PRETTY_FLAGS(true);
726 :
727 6 : res = pg_get_viewdef_worker(viewoid, prettyFlags, wrap);
728 :
729 6 : if (res == NULL)
730 0 : PG_RETURN_NULL();
731 :
732 6 : PG_RETURN_TEXT_P(string_to_text(res));
733 : }
734 :
735 : Datum
736 72 : pg_get_viewdef_name(PG_FUNCTION_ARGS)
737 : {
738 : /* By qualified name */
739 72 : text *viewname = PG_GETARG_TEXT_PP(0);
740 : int prettyFlags;
741 : RangeVar *viewrel;
742 : Oid viewoid;
743 : char *res;
744 :
745 72 : prettyFlags = PRETTYFLAG_INDENT;
746 :
747 : /* Look up view name. Can't lock it - we might not have privileges. */
748 72 : viewrel = makeRangeVarFromNameList(textToQualifiedNameList(viewname));
749 72 : viewoid = RangeVarGetRelid(viewrel, NoLock, false);
750 :
751 72 : res = pg_get_viewdef_worker(viewoid, prettyFlags, WRAP_COLUMN_DEFAULT);
752 :
753 72 : if (res == NULL)
754 0 : PG_RETURN_NULL();
755 :
756 72 : PG_RETURN_TEXT_P(string_to_text(res));
757 : }
758 :
759 :
760 : Datum
761 402 : pg_get_viewdef_name_ext(PG_FUNCTION_ARGS)
762 : {
763 : /* By qualified name */
764 402 : text *viewname = PG_GETARG_TEXT_PP(0);
765 402 : bool pretty = PG_GETARG_BOOL(1);
766 : int prettyFlags;
767 : RangeVar *viewrel;
768 : Oid viewoid;
769 : char *res;
770 :
771 402 : prettyFlags = GET_PRETTY_FLAGS(pretty);
772 :
773 : /* Look up view name. Can't lock it - we might not have privileges. */
774 402 : viewrel = makeRangeVarFromNameList(textToQualifiedNameList(viewname));
775 402 : viewoid = RangeVarGetRelid(viewrel, NoLock, false);
776 :
777 402 : res = pg_get_viewdef_worker(viewoid, prettyFlags, WRAP_COLUMN_DEFAULT);
778 :
779 402 : if (res == NULL)
780 0 : PG_RETURN_NULL();
781 :
782 402 : 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 : */
788 : static char *
789 3578 : pg_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 3578 : initStringInfo(&buf);
802 :
803 : /*
804 : * Connect to SPI manager
805 : */
806 3578 : 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 3578 : if (plan_getviewrule == NULL)
814 : {
815 : Oid argtypes[2];
816 : SPIPlanPtr plan;
817 :
818 240 : argtypes[0] = OIDOID;
819 240 : argtypes[1] = NAMEOID;
820 240 : plan = SPI_prepare(query_getviewrule, 2, argtypes);
821 240 : if (plan == NULL)
822 0 : elog(ERROR, "SPI_prepare failed for \"%s\"", query_getviewrule);
823 240 : SPI_keepplan(plan);
824 240 : plan_getviewrule = plan;
825 : }
826 :
827 : /*
828 : * Get the pg_rewrite tuple for the view's SELECT rule
829 : */
830 3578 : args[0] = ObjectIdGetDatum(viewoid);
831 3578 : args[1] = DirectFunctionCall1(namein, CStringGetDatum(ViewSelectRuleName));
832 3578 : nulls[0] = ' ';
833 3578 : nulls[1] = ' ';
834 3578 : spirc = SPI_execute_plan(plan_getviewrule, args, nulls, true, 0);
835 3578 : if (spirc != SPI_OK_SELECT)
836 0 : elog(ERROR, "failed to get pg_rewrite tuple for view %u", viewoid);
837 3578 : 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 3572 : ruletup = SPI_tuptable->vals[0];
850 3572 : rulettc = SPI_tuptable->tupdesc;
851 3572 : make_viewdef(&buf, ruletup, rulettc, prettyFlags, wrapColumn);
852 : }
853 :
854 : /*
855 : * Disconnect from SPI manager
856 : */
857 3578 : if (SPI_finish() != SPI_OK_FINISH)
858 0 : elog(ERROR, "SPI_finish failed");
859 :
860 3578 : if (buf.len == 0)
861 6 : return NULL;
862 :
863 3572 : return buf.data;
864 : }
865 :
866 : /* ----------
867 : * pg_get_triggerdef - Get the definition of a trigger
868 : * ----------
869 : */
870 : Datum
871 204 : pg_get_triggerdef(PG_FUNCTION_ARGS)
872 : {
873 204 : Oid trigid = PG_GETARG_OID(0);
874 : char *res;
875 :
876 204 : res = pg_get_triggerdef_worker(trigid, false);
877 :
878 204 : if (res == NULL)
879 6 : PG_RETURN_NULL();
880 :
881 198 : PG_RETURN_TEXT_P(string_to_text(res));
882 : }
883 :
884 : Datum
885 1230 : pg_get_triggerdef_ext(PG_FUNCTION_ARGS)
886 : {
887 1230 : Oid trigid = PG_GETARG_OID(0);
888 1230 : bool pretty = PG_GETARG_BOOL(1);
889 : char *res;
890 :
891 1230 : res = pg_get_triggerdef_worker(trigid, pretty);
892 :
893 1230 : if (res == NULL)
894 0 : PG_RETURN_NULL();
895 :
896 1230 : PG_RETURN_TEXT_P(string_to_text(res));
897 : }
898 :
899 : static char *
900 1434 : pg_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 1434 : 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 1434 : tgrel = table_open(TriggerRelationId, AccessShareLock);
919 :
920 1434 : ScanKeyInit(&skey[0],
921 : Anum_pg_trigger_oid,
922 : BTEqualStrategyNumber, F_OIDEQ,
923 : ObjectIdGetDatum(trigid));
924 :
925 1434 : tgscan = systable_beginscan(tgrel, TriggerOidIndexId, true,
926 : NULL, 1, skey);
927 :
928 1434 : ht_trig = systable_getnext(tgscan);
929 :
930 1434 : if (!HeapTupleIsValid(ht_trig))
931 : {
932 6 : systable_endscan(tgscan);
933 6 : table_close(tgrel, AccessShareLock);
934 6 : return NULL;
935 : }
936 :
937 1428 : 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 1428 : initStringInfo(&buf);
944 :
945 1428 : tgname = NameStr(trigrec->tgname);
946 2856 : appendStringInfo(&buf, "CREATE %sTRIGGER %s ",
947 1428 : OidIsValid(trigrec->tgconstraint) ? "CONSTRAINT " : "",
948 : quote_identifier(tgname));
949 :
950 1428 : if (TRIGGER_FOR_BEFORE(trigrec->tgtype))
951 562 : appendStringInfoString(&buf, "BEFORE");
952 866 : else if (TRIGGER_FOR_AFTER(trigrec->tgtype))
953 842 : appendStringInfoString(&buf, "AFTER");
954 24 : else if (TRIGGER_FOR_INSTEAD(trigrec->tgtype))
955 24 : appendStringInfoString(&buf, "INSTEAD OF");
956 : else
957 0 : elog(ERROR, "unexpected tgtype value: %d", trigrec->tgtype);
958 :
959 1428 : if (TRIGGER_FOR_INSERT(trigrec->tgtype))
960 : {
961 994 : appendStringInfoString(&buf, " INSERT");
962 994 : findx++;
963 : }
964 1428 : if (TRIGGER_FOR_DELETE(trigrec->tgtype))
965 : {
966 226 : if (findx > 0)
967 90 : appendStringInfoString(&buf, " OR DELETE");
968 : else
969 136 : appendStringInfoString(&buf, " DELETE");
970 226 : findx++;
971 : }
972 1428 : if (TRIGGER_FOR_UPDATE(trigrec->tgtype))
973 : {
974 688 : if (findx > 0)
975 390 : appendStringInfoString(&buf, " OR UPDATE");
976 : else
977 298 : appendStringInfoString(&buf, " UPDATE");
978 688 : findx++;
979 : /* tgattr is first var-width field, so OK to access directly */
980 688 : if (trigrec->tgattr.dim1 > 0)
981 : {
982 : int i;
983 :
984 76 : appendStringInfoString(&buf, " OF ");
985 168 : for (i = 0; i < trigrec->tgattr.dim1; i++)
986 : {
987 : char *attname;
988 :
989 92 : if (i > 0)
990 16 : appendStringInfoString(&buf, ", ");
991 92 : attname = get_attname(trigrec->tgrelid,
992 92 : trigrec->tgattr.values[i], false);
993 92 : appendStringInfoString(&buf, quote_identifier(attname));
994 : }
995 : }
996 : }
997 1428 : if (TRIGGER_FOR_TRUNCATE(trigrec->tgtype))
998 : {
999 0 : if (findx > 0)
1000 0 : appendStringInfoString(&buf, " OR TRUNCATE");
1001 : else
1002 0 : appendStringInfoString(&buf, " TRUNCATE");
1003 0 : 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 2856 : appendStringInfo(&buf, " ON %s ",
1011 : pretty ?
1012 138 : generate_relation_name(trigrec->tgrelid, NIL) :
1013 1290 : generate_qualified_relation_name(trigrec->tgrelid));
1014 :
1015 1428 : if (OidIsValid(trigrec->tgconstraint))
1016 : {
1017 0 : if (OidIsValid(trigrec->tgconstrrelid))
1018 0 : appendStringInfo(&buf, "FROM %s ",
1019 : generate_relation_name(trigrec->tgconstrrelid, NIL));
1020 0 : if (!trigrec->tgdeferrable)
1021 0 : appendStringInfoString(&buf, "NOT ");
1022 0 : appendStringInfoString(&buf, "DEFERRABLE INITIALLY ");
1023 0 : if (trigrec->tginitdeferred)
1024 0 : appendStringInfoString(&buf, "DEFERRED ");
1025 : else
1026 0 : appendStringInfoString(&buf, "IMMEDIATE ");
1027 : }
1028 :
1029 1428 : value = fastgetattr(ht_trig, Anum_pg_trigger_tgoldtable,
1030 : tgrel->rd_att, &isnull);
1031 1428 : if (!isnull)
1032 98 : tgoldtable = NameStr(*DatumGetName(value));
1033 : else
1034 1330 : tgoldtable = NULL;
1035 1428 : value = fastgetattr(ht_trig, Anum_pg_trigger_tgnewtable,
1036 : tgrel->rd_att, &isnull);
1037 1428 : if (!isnull)
1038 108 : tgnewtable = NameStr(*DatumGetName(value));
1039 : else
1040 1320 : tgnewtable = NULL;
1041 1428 : if (tgoldtable != NULL || tgnewtable != NULL)
1042 : {
1043 152 : appendStringInfoString(&buf, "REFERENCING ");
1044 152 : if (tgoldtable != NULL)
1045 98 : appendStringInfo(&buf, "OLD TABLE AS %s ",
1046 : quote_identifier(tgoldtable));
1047 152 : if (tgnewtable != NULL)
1048 108 : appendStringInfo(&buf, "NEW TABLE AS %s ",
1049 : quote_identifier(tgnewtable));
1050 : }
1051 :
1052 1428 : if (TRIGGER_FOR_ROW(trigrec->tgtype))
1053 1110 : appendStringInfoString(&buf, "FOR EACH ROW ");
1054 : else
1055 318 : appendStringInfoString(&buf, "FOR EACH STATEMENT ");
1056 :
1057 : /* If the trigger has a WHEN qualification, add that */
1058 1428 : value = fastgetattr(ht_trig, Anum_pg_trigger_tgqual,
1059 : tgrel->rd_att, &isnull);
1060 1428 : 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 160 : appendStringInfoString(&buf, "WHEN (");
1070 :
1071 160 : qual = stringToNode(TextDatumGetCString(value));
1072 :
1073 160 : relkind = get_rel_relkind(trigrec->tgrelid);
1074 :
1075 : /* Build minimal OLD and NEW RTEs for the rel */
1076 160 : oldrte = makeNode(RangeTblEntry);
1077 160 : oldrte->rtekind = RTE_RELATION;
1078 160 : oldrte->relid = trigrec->tgrelid;
1079 160 : oldrte->relkind = relkind;
1080 160 : oldrte->rellockmode = AccessShareLock;
1081 160 : oldrte->alias = makeAlias("old", NIL);
1082 160 : oldrte->eref = oldrte->alias;
1083 160 : oldrte->lateral = false;
1084 160 : oldrte->inh = false;
1085 160 : oldrte->inFromCl = true;
1086 :
1087 160 : newrte = makeNode(RangeTblEntry);
1088 160 : newrte->rtekind = RTE_RELATION;
1089 160 : newrte->relid = trigrec->tgrelid;
1090 160 : newrte->relkind = relkind;
1091 160 : newrte->rellockmode = AccessShareLock;
1092 160 : newrte->alias = makeAlias("new", NIL);
1093 160 : newrte->eref = newrte->alias;
1094 160 : newrte->lateral = false;
1095 160 : newrte->inh = false;
1096 160 : newrte->inFromCl = true;
1097 :
1098 : /* Build two-element rtable */
1099 160 : memset(&dpns, 0, sizeof(dpns));
1100 160 : dpns.rtable = list_make2(oldrte, newrte);
1101 160 : dpns.subplans = NIL;
1102 160 : dpns.ctes = NIL;
1103 160 : dpns.appendrels = NULL;
1104 160 : set_rtable_names(&dpns, NIL, NULL);
1105 160 : set_simple_column_names(&dpns);
1106 :
1107 : /* Set up context with one-deep namespace stack */
1108 160 : context.buf = &buf;
1109 160 : context.namespaces = list_make1(&dpns);
1110 160 : context.resultDesc = NULL;
1111 160 : context.targetList = NIL;
1112 160 : context.windowClause = NIL;
1113 160 : context.varprefix = true;
1114 160 : context.prettyFlags = GET_PRETTY_FLAGS(pretty);
1115 160 : context.wrapColumn = WRAP_COLUMN_DEFAULT;
1116 160 : context.indentLevel = PRETTYINDENT_STD;
1117 160 : context.colNamesVisible = true;
1118 160 : context.inGroupBy = false;
1119 160 : context.varInOrderBy = false;
1120 160 : context.appendparents = NULL;
1121 :
1122 160 : get_rule_expr(qual, &context, false);
1123 :
1124 160 : appendStringInfoString(&buf, ") ");
1125 : }
1126 :
1127 1428 : appendStringInfo(&buf, "EXECUTE FUNCTION %s(",
1128 : generate_function_name(trigrec->tgfoid, 0,
1129 : NIL, NULL,
1130 : false, NULL, false));
1131 :
1132 1428 : if (trigrec->tgnargs > 0)
1133 : {
1134 : char *p;
1135 : int i;
1136 :
1137 450 : value = fastgetattr(ht_trig, Anum_pg_trigger_tgargs,
1138 : tgrel->rd_att, &isnull);
1139 450 : if (isnull)
1140 0 : elog(ERROR, "tgargs is null for trigger %u", trigid);
1141 450 : p = (char *) VARDATA_ANY(DatumGetByteaPP(value));
1142 1196 : for (i = 0; i < trigrec->tgnargs; i++)
1143 : {
1144 746 : if (i > 0)
1145 296 : appendStringInfoString(&buf, ", ");
1146 746 : simple_quote_literal(&buf, p);
1147 : /* advance p to next string embedded in tgargs */
1148 6756 : while (*p)
1149 6010 : p++;
1150 746 : p++;
1151 : }
1152 : }
1153 :
1154 : /* We deliberately do not put semi-colon at end */
1155 1428 : appendStringInfoChar(&buf, ')');
1156 :
1157 : /* Clean up */
1158 1428 : systable_endscan(tgscan);
1159 :
1160 1428 : table_close(tgrel, AccessShareLock);
1161 :
1162 1428 : 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 : */
1177 : Datum
1178 5734 : pg_get_indexdef(PG_FUNCTION_ARGS)
1179 : {
1180 5734 : Oid indexrelid = PG_GETARG_OID(0);
1181 : int prettyFlags;
1182 : char *res;
1183 :
1184 5734 : prettyFlags = PRETTYFLAG_INDENT;
1185 :
1186 5734 : res = pg_get_indexdef_worker(indexrelid, 0, NULL,
1187 : false, false,
1188 : false, false,
1189 : prettyFlags, true);
1190 :
1191 5734 : if (res == NULL)
1192 6 : PG_RETURN_NULL();
1193 :
1194 5728 : PG_RETURN_TEXT_P(string_to_text(res));
1195 : }
1196 :
1197 : Datum
1198 1976 : pg_get_indexdef_ext(PG_FUNCTION_ARGS)
1199 : {
1200 1976 : Oid indexrelid = PG_GETARG_OID(0);
1201 1976 : int32 colno = PG_GETARG_INT32(1);
1202 1976 : bool pretty = PG_GETARG_BOOL(2);
1203 : int prettyFlags;
1204 : char *res;
1205 :
1206 1976 : prettyFlags = GET_PRETTY_FLAGS(pretty);
1207 :
1208 1976 : res = pg_get_indexdef_worker(indexrelid, colno, NULL,
1209 : colno != 0, false,
1210 : false, false,
1211 : prettyFlags, true);
1212 :
1213 1976 : if (res == NULL)
1214 0 : PG_RETURN_NULL();
1215 :
1216 1976 : 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 : */
1224 : char *
1225 216 : pg_get_indexdef_string(Oid indexrelid)
1226 : {
1227 216 : 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 */
1234 : char *
1235 962 : pg_get_indexdef_columns(Oid indexrelid, bool pretty)
1236 : {
1237 : int prettyFlags;
1238 :
1239 962 : prettyFlags = GET_PRETTY_FLAGS(pretty);
1240 :
1241 962 : 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 */
1248 : char *
1249 8 : pg_get_indexdef_columns_extended(Oid indexrelid, bits16 flags)
1250 : {
1251 8 : bool pretty = ((flags & RULE_INDEXDEF_PRETTY) != 0);
1252 8 : bool keys_only = ((flags & RULE_INDEXDEF_KEYS_ONLY) != 0);
1253 : int prettyFlags;
1254 :
1255 8 : prettyFlags = GET_PRETTY_FLAGS(pretty);
1256 :
1257 8 : 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 : */
1269 : static char *
1270 9000 : pg_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 9000 : 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 9000 : ht_idx = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexrelid));
1304 9000 : if (!HeapTupleIsValid(ht_idx))
1305 : {
1306 6 : if (missing_ok)
1307 6 : return NULL;
1308 0 : elog(ERROR, "cache lookup failed for index %u", indexrelid);
1309 : }
1310 8994 : idxrec = (Form_pg_index) GETSTRUCT(ht_idx);
1311 :
1312 8994 : indrelid = idxrec->indrelid;
1313 : Assert(indexrelid == idxrec->indexrelid);
1314 :
1315 : /* Must get indcollation, indclass, and indoption the hard way */
1316 8994 : indcollDatum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1317 : Anum_pg_index_indcollation);
1318 8994 : indcollation = (oidvector *) DatumGetPointer(indcollDatum);
1319 :
1320 8994 : indclassDatum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1321 : Anum_pg_index_indclass);
1322 8994 : indclass = (oidvector *) DatumGetPointer(indclassDatum);
1323 :
1324 8994 : indoptionDatum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1325 : Anum_pg_index_indoption);
1326 8994 : indoption = (int2vector *) DatumGetPointer(indoptionDatum);
1327 :
1328 : /*
1329 : * Fetch the pg_class tuple of the index relation
1330 : */
1331 8994 : ht_idxrel = SearchSysCache1(RELOID, ObjectIdGetDatum(indexrelid));
1332 8994 : if (!HeapTupleIsValid(ht_idxrel))
1333 0 : elog(ERROR, "cache lookup failed for relation %u", indexrelid);
1334 8994 : idxrelrec = (Form_pg_class) GETSTRUCT(ht_idxrel);
1335 :
1336 : /*
1337 : * Fetch the pg_am tuple of the index' access method
1338 : */
1339 8994 : ht_am = SearchSysCache1(AMOID, ObjectIdGetDatum(idxrelrec->relam));
1340 8994 : if (!HeapTupleIsValid(ht_am))
1341 0 : elog(ERROR, "cache lookup failed for access method %u",
1342 : idxrelrec->relam);
1343 8994 : amrec = (Form_pg_am) GETSTRUCT(ht_am);
1344 :
1345 : /* Fetch the index AM's API struct */
1346 8994 : 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 8994 : if (!heap_attisnull(ht_idx, Anum_pg_index_indexprs, NULL))
1354 : {
1355 : Datum exprsDatum;
1356 : char *exprsString;
1357 :
1358 656 : exprsDatum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1359 : Anum_pg_index_indexprs);
1360 656 : exprsString = TextDatumGetCString(exprsDatum);
1361 656 : indexprs = (List *) stringToNode(exprsString);
1362 656 : pfree(exprsString);
1363 : }
1364 : else
1365 8338 : indexprs = NIL;
1366 :
1367 8994 : indexpr_item = list_head(indexprs);
1368 :
1369 8994 : 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 8994 : initStringInfo(&buf);
1376 :
1377 8994 : if (!attrsOnly)
1378 : {
1379 7574 : if (!isConstraint)
1380 14940 : appendStringInfo(&buf, "CREATE %sINDEX %s ON %s%s USING %s (",
1381 7470 : idxrec->indisunique ? "UNIQUE " : "",
1382 7470 : quote_identifier(NameStr(idxrelrec->relname)),
1383 7470 : idxrelrec->relkind == RELKIND_PARTITIONED_INDEX
1384 686 : && !inherits ? "ONLY " : "",
1385 7470 : (prettyFlags & PRETTYFLAG_SCHEMA) ?
1386 1526 : generate_relation_name(indrelid, NIL) :
1387 5944 : generate_qualified_relation_name(indrelid),
1388 7470 : quote_identifier(NameStr(amrec->amname)));
1389 : else /* currently, must be EXCLUDE constraint */
1390 104 : appendStringInfo(&buf, "EXCLUDE USING %s (",
1391 104 : quote_identifier(NameStr(amrec->amname)));
1392 : }
1393 :
1394 : /*
1395 : * Report the indexed attributes
1396 : */
1397 8994 : sep = "";
1398 22686 : for (keyno = 0; keyno < idxrec->indnatts; keyno++)
1399 : {
1400 13790 : AttrNumber attnum = idxrec->indkey.values[keyno];
1401 : Oid keycoltype;
1402 : Oid keycolcollation;
1403 :
1404 : /*
1405 : * Ignore non-key attributes if told to.
1406 : */
1407 13790 : if (keysOnly && keyno >= idxrec->indnkeyatts)
1408 98 : break;
1409 :
1410 : /* Otherwise, print INCLUDE to divide key and non-key attrs. */
1411 13692 : if (!colno && keyno == idxrec->indnkeyatts)
1412 : {
1413 250 : appendStringInfoString(&buf, ") INCLUDE (");
1414 250 : sep = "";
1415 : }
1416 :
1417 13692 : if (!colno)
1418 13062 : appendStringInfoString(&buf, sep);
1419 13692 : sep = ", ";
1420 :
1421 13692 : if (attnum != 0)
1422 : {
1423 : /* Simple index column */
1424 : char *attname;
1425 : int32 keycoltypmod;
1426 :
1427 12866 : attname = get_attname(indrelid, attnum, false);
1428 12866 : if (!colno || colno == keyno + 1)
1429 12698 : appendStringInfoString(&buf, quote_identifier(attname));
1430 12866 : get_atttypetypmodcoll(indrelid, attnum,
1431 : &keycoltype, &keycoltypmod,
1432 : &keycolcollation);
1433 : }
1434 : else
1435 : {
1436 : /* expressional index */
1437 : Node *indexkey;
1438 :
1439 826 : if (indexpr_item == NULL)
1440 0 : elog(ERROR, "too few entries in indexprs list");
1441 826 : indexkey = (Node *) lfirst(indexpr_item);
1442 826 : indexpr_item = lnext(indexprs, indexpr_item);
1443 : /* Deparse */
1444 826 : str = deparse_expression_pretty(indexkey, context, false, false,
1445 : prettyFlags, 0);
1446 826 : if (!colno || colno == keyno + 1)
1447 : {
1448 : /* Need parens if it's not a bare function call */
1449 814 : if (looks_like_function(indexkey))
1450 52 : appendStringInfoString(&buf, str);
1451 : else
1452 762 : appendStringInfo(&buf, "(%s)", str);
1453 : }
1454 826 : keycoltype = exprType(indexkey);
1455 826 : keycolcollation = exprCollation(indexkey);
1456 : }
1457 :
1458 : /* Print additional decoration for (selected) key columns */
1459 13692 : if (!attrsOnly && keyno < idxrec->indnkeyatts &&
1460 0 : (!colno || colno == keyno + 1))
1461 : {
1462 11302 : int16 opt = indoption->values[keyno];
1463 11302 : Oid indcoll = indcollation->values[keyno];
1464 11302 : Datum attoptions = get_attoptions(indexrelid, keyno + 1);
1465 11302 : bool has_options = attoptions != (Datum) 0;
1466 :
1467 : /* Add collation, if not default for column */
1468 11302 : if (OidIsValid(indcoll) && indcoll != keycolcollation)
1469 94 : appendStringInfo(&buf, " COLLATE %s",
1470 : generate_collation_name((indcoll)));
1471 :
1472 : /* Add the operator class name, if not default */
1473 11302 : get_opclass_name(indclass->values[keyno],
1474 : has_options ? InvalidOid : keycoltype, &buf);
1475 :
1476 11302 : if (has_options)
1477 : {
1478 34 : appendStringInfoString(&buf, " (");
1479 34 : get_reloptions(&buf, attoptions);
1480 34 : appendStringInfoChar(&buf, ')');
1481 : }
1482 :
1483 : /* Add options if relevant */
1484 11302 : if (amroutine->amcanorder)
1485 : {
1486 : /* if it supports sort ordering, report DESC and NULLS opts */
1487 9174 : if (opt & INDOPTION_DESC)
1488 : {
1489 0 : appendStringInfoString(&buf, " DESC");
1490 : /* NULLS FIRST is the default in this case */
1491 0 : if (!(opt & INDOPTION_NULLS_FIRST))
1492 0 : appendStringInfoString(&buf, " NULLS LAST");
1493 : }
1494 : else
1495 : {
1496 9174 : if (opt & INDOPTION_NULLS_FIRST)
1497 0 : appendStringInfoString(&buf, " NULLS FIRST");
1498 : }
1499 : }
1500 :
1501 : /* Add the exclusion operator if relevant */
1502 11302 : if (excludeOps != NULL)
1503 124 : appendStringInfo(&buf, " WITH %s",
1504 124 : generate_operator_name(excludeOps[keyno],
1505 : keycoltype,
1506 : keycoltype));
1507 : }
1508 : }
1509 :
1510 8994 : if (!attrsOnly)
1511 : {
1512 7574 : appendStringInfoChar(&buf, ')');
1513 :
1514 7574 : if (idxrec->indnullsnotdistinct)
1515 12 : appendStringInfoString(&buf, " NULLS NOT DISTINCT");
1516 :
1517 : /*
1518 : * If it has options, append "WITH (options)"
1519 : */
1520 7574 : str = flatten_reloptions(indexrelid);
1521 7574 : if (str)
1522 : {
1523 210 : appendStringInfo(&buf, " WITH (%s)", str);
1524 210 : pfree(str);
1525 : }
1526 :
1527 : /*
1528 : * Print tablespace, but only if requested
1529 : */
1530 7574 : if (showTblSpc)
1531 : {
1532 : Oid tblspc;
1533 :
1534 216 : tblspc = get_rel_tablespace(indexrelid);
1535 216 : if (OidIsValid(tblspc))
1536 : {
1537 54 : if (isConstraint)
1538 0 : appendStringInfoString(&buf, " USING INDEX");
1539 54 : appendStringInfo(&buf, " TABLESPACE %s",
1540 54 : quote_identifier(get_tablespace_name(tblspc)));
1541 : }
1542 : }
1543 :
1544 : /*
1545 : * If it's a partial index, decompile and append the predicate
1546 : */
1547 7574 : 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 314 : predDatum = SysCacheGetAttrNotNull(INDEXRELID, ht_idx,
1555 : Anum_pg_index_indpred);
1556 314 : predString = TextDatumGetCString(predDatum);
1557 314 : node = (Node *) stringToNode(predString);
1558 314 : pfree(predString);
1559 :
1560 : /* Deparse */
1561 314 : str = deparse_expression_pretty(node, context, false, false,
1562 : prettyFlags, 0);
1563 314 : if (isConstraint)
1564 42 : appendStringInfo(&buf, " WHERE (%s)", str);
1565 : else
1566 272 : appendStringInfo(&buf, " WHERE %s", str);
1567 : }
1568 : }
1569 :
1570 : /* Clean up */
1571 8994 : ReleaseSysCache(ht_idx);
1572 8994 : ReleaseSysCache(ht_idxrel);
1573 8994 : ReleaseSysCache(ht_am);
1574 :
1575 8994 : 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 : */
1587 : char *
1588 0 : pg_get_querydef(Query *query, bool pretty)
1589 : {
1590 : StringInfoData buf;
1591 : int prettyFlags;
1592 :
1593 0 : prettyFlags = GET_PRETTY_FLAGS(pretty);
1594 :
1595 0 : initStringInfo(&buf);
1596 :
1597 0 : get_query_def(query, &buf, NIL, NULL, true,
1598 : prettyFlags, WRAP_COLUMN_DEFAULT, 0);
1599 :
1600 0 : return buf.data;
1601 : }
1602 :
1603 : /*
1604 : * pg_get_statisticsobjdef
1605 : * Get the definition of an extended statistics object
1606 : */
1607 : Datum
1608 266 : pg_get_statisticsobjdef(PG_FUNCTION_ARGS)
1609 : {
1610 266 : Oid statextid = PG_GETARG_OID(0);
1611 : char *res;
1612 :
1613 266 : res = pg_get_statisticsobj_worker(statextid, false, true);
1614 :
1615 266 : if (res == NULL)
1616 6 : PG_RETURN_NULL();
1617 :
1618 260 : 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 : */
1626 : char *
1627 14 : pg_get_statisticsobjdef_string(Oid statextid)
1628 : {
1629 14 : 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 : */
1636 : Datum
1637 414 : pg_get_statisticsobjdef_columns(PG_FUNCTION_ARGS)
1638 : {
1639 414 : Oid statextid = PG_GETARG_OID(0);
1640 : char *res;
1641 :
1642 414 : res = pg_get_statisticsobj_worker(statextid, true, true);
1643 :
1644 414 : if (res == NULL)
1645 0 : PG_RETURN_NULL();
1646 :
1647 414 : PG_RETURN_TEXT_P(string_to_text(res));
1648 : }
1649 :
1650 : /*
1651 : * Internal workhorse to decompile an extended statistics object.
1652 : */
1653 : static char *
1654 694 : pg_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 694 : List *exprs = NIL;
1671 : bool has_exprs;
1672 : int ncolumns;
1673 :
1674 694 : statexttup = SearchSysCache1(STATEXTOID, ObjectIdGetDatum(statextid));
1675 :
1676 694 : if (!HeapTupleIsValid(statexttup))
1677 : {
1678 6 : if (missing_ok)
1679 6 : return NULL;
1680 0 : elog(ERROR, "cache lookup failed for statistics object %u", statextid);
1681 : }
1682 :
1683 : /* has the statistics expressions? */
1684 688 : has_exprs = !heap_attisnull(statexttup, Anum_pg_statistic_ext_stxexprs, NULL);
1685 :
1686 688 : 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 688 : if (has_exprs)
1694 : {
1695 : Datum exprsDatum;
1696 : char *exprsString;
1697 :
1698 148 : exprsDatum = SysCacheGetAttrNotNull(STATEXTOID, statexttup,
1699 : Anum_pg_statistic_ext_stxexprs);
1700 148 : exprsString = TextDatumGetCString(exprsDatum);
1701 148 : exprs = (List *) stringToNode(exprsString);
1702 148 : pfree(exprsString);
1703 : }
1704 : else
1705 540 : exprs = NIL;
1706 :
1707 : /* count the number of columns (attributes and expressions) */
1708 688 : ncolumns = statextrec->stxkeys.dim1 + list_length(exprs);
1709 :
1710 688 : initStringInfo(&buf);
1711 :
1712 688 : if (!columns_only)
1713 : {
1714 274 : nsp = get_namespace_name_or_temp(statextrec->stxnamespace);
1715 274 : appendStringInfo(&buf, "CREATE STATISTICS %s",
1716 : quote_qualified_identifier(nsp,
1717 274 : NameStr(statextrec->stxname)));
1718 :
1719 : /*
1720 : * Decode the stxkind column so that we know which stats types to
1721 : * print.
1722 : */
1723 274 : datum = SysCacheGetAttrNotNull(STATEXTOID, statexttup,
1724 : Anum_pg_statistic_ext_stxkind);
1725 274 : arr = DatumGetArrayTypeP(datum);
1726 274 : if (ARR_NDIM(arr) != 1 ||
1727 274 : ARR_HASNULL(arr) ||
1728 274 : ARR_ELEMTYPE(arr) != CHAROID)
1729 0 : elog(ERROR, "stxkind is not a 1-D char array");
1730 274 : enabled = (char *) ARR_DATA_PTR(arr);
1731 :
1732 274 : ndistinct_enabled = false;
1733 274 : dependencies_enabled = false;
1734 274 : mcv_enabled = false;
1735 :
1736 710 : for (i = 0; i < ARR_DIMS(arr)[0]; i++)
1737 : {
1738 436 : if (enabled[i] == STATS_EXT_NDISTINCT)
1739 148 : ndistinct_enabled = true;
1740 288 : else if (enabled[i] == STATS_EXT_DEPENDENCIES)
1741 94 : dependencies_enabled = true;
1742 194 : else if (enabled[i] == STATS_EXT_MCV)
1743 112 : 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 274 : if ((!ndistinct_enabled || !dependencies_enabled || !mcv_enabled) &&
1760 : (ncolumns > 1))
1761 : {
1762 126 : bool gotone = false;
1763 :
1764 126 : appendStringInfoString(&buf, " (");
1765 :
1766 126 : if (ndistinct_enabled)
1767 : {
1768 72 : appendStringInfoString(&buf, "ndistinct");
1769 72 : gotone = true;
1770 : }
1771 :
1772 126 : if (dependencies_enabled)
1773 : {
1774 18 : appendStringInfo(&buf, "%sdependencies", gotone ? ", " : "");
1775 18 : gotone = true;
1776 : }
1777 :
1778 126 : if (mcv_enabled)
1779 36 : appendStringInfo(&buf, "%smcv", gotone ? ", " : "");
1780 :
1781 126 : appendStringInfoChar(&buf, ')');
1782 : }
1783 :
1784 274 : appendStringInfoString(&buf, " ON ");
1785 : }
1786 :
1787 : /* decode simple column references */
1788 1948 : for (colno = 0; colno < statextrec->stxkeys.dim1; colno++)
1789 : {
1790 1260 : AttrNumber attnum = statextrec->stxkeys.values[colno];
1791 : char *attname;
1792 :
1793 1260 : if (colno > 0)
1794 708 : appendStringInfoString(&buf, ", ");
1795 :
1796 1260 : attname = get_attname(statextrec->stxrelid, attnum, false);
1797 :
1798 1260 : appendStringInfoString(&buf, quote_identifier(attname));
1799 : }
1800 :
1801 688 : context = deparse_context_for(get_relation_name(statextrec->stxrelid),
1802 : statextrec->stxrelid);
1803 :
1804 922 : foreach(lc, exprs)
1805 : {
1806 234 : Node *expr = (Node *) lfirst(lc);
1807 : char *str;
1808 234 : int prettyFlags = PRETTYFLAG_PAREN;
1809 :
1810 234 : str = deparse_expression_pretty(expr, context, false, false,
1811 : prettyFlags, 0);
1812 :
1813 234 : if (colno > 0)
1814 98 : appendStringInfoString(&buf, ", ");
1815 :
1816 : /* Need parens if it's not a bare function call */
1817 234 : if (looks_like_function(expr))
1818 34 : appendStringInfoString(&buf, str);
1819 : else
1820 200 : appendStringInfo(&buf, "(%s)", str);
1821 :
1822 234 : colno++;
1823 : }
1824 :
1825 688 : if (!columns_only)
1826 274 : appendStringInfo(&buf, " FROM %s",
1827 : generate_relation_name(statextrec->stxrelid, NIL));
1828 :
1829 688 : ReleaseSysCache(statexttup);
1830 :
1831 688 : return buf.data;
1832 : }
1833 :
1834 : /*
1835 : * Generate text array of expressions for statistics object.
1836 : */
1837 : Datum
1838 24 : pg_get_statisticsobjdef_expressions(PG_FUNCTION_ARGS)
1839 : {
1840 24 : 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 24 : List *exprs = NIL;
1847 : bool has_exprs;
1848 : char *tmp;
1849 24 : ArrayBuildState *astate = NULL;
1850 :
1851 24 : statexttup = SearchSysCache1(STATEXTOID, ObjectIdGetDatum(statextid));
1852 :
1853 24 : if (!HeapTupleIsValid(statexttup))
1854 0 : PG_RETURN_NULL();
1855 :
1856 : /* Does the stats object have expressions? */
1857 24 : has_exprs = !heap_attisnull(statexttup, Anum_pg_statistic_ext_stxexprs, NULL);
1858 :
1859 : /* no expressions? we're done */
1860 24 : if (!has_exprs)
1861 : {
1862 12 : ReleaseSysCache(statexttup);
1863 12 : PG_RETURN_NULL();
1864 : }
1865 :
1866 12 : statextrec = (Form_pg_statistic_ext) GETSTRUCT(statexttup);
1867 :
1868 : /*
1869 : * Get the statistics expressions, and deparse them into text values.
1870 : */
1871 12 : datum = SysCacheGetAttrNotNull(STATEXTOID, statexttup,
1872 : Anum_pg_statistic_ext_stxexprs);
1873 12 : tmp = TextDatumGetCString(datum);
1874 12 : exprs = (List *) stringToNode(tmp);
1875 12 : pfree(tmp);
1876 :
1877 12 : context = deparse_context_for(get_relation_name(statextrec->stxrelid),
1878 : statextrec->stxrelid);
1879 :
1880 36 : foreach(lc, exprs)
1881 : {
1882 24 : Node *expr = (Node *) lfirst(lc);
1883 : char *str;
1884 24 : int prettyFlags = PRETTYFLAG_INDENT;
1885 :
1886 24 : str = deparse_expression_pretty(expr, context, false, false,
1887 : prettyFlags, 0);
1888 :
1889 24 : astate = accumArrayResult(astate,
1890 24 : PointerGetDatum(cstring_to_text(str)),
1891 : false,
1892 : TEXTOID,
1893 : CurrentMemoryContext);
1894 : }
1895 :
1896 12 : ReleaseSysCache(statexttup);
1897 :
1898 12 : 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 : */
1908 : Datum
1909 1358 : pg_get_partkeydef(PG_FUNCTION_ARGS)
1910 : {
1911 1358 : Oid relid = PG_GETARG_OID(0);
1912 : char *res;
1913 :
1914 1358 : res = pg_get_partkeydef_worker(relid, PRETTYFLAG_INDENT, false, true);
1915 :
1916 1358 : if (res == NULL)
1917 6 : PG_RETURN_NULL();
1918 :
1919 1352 : PG_RETURN_TEXT_P(string_to_text(res));
1920 : }
1921 :
1922 : /* Internal version that just reports the column definitions */
1923 : char *
1924 142 : pg_get_partkeydef_columns(Oid relid, bool pretty)
1925 : {
1926 : int prettyFlags;
1927 :
1928 142 : prettyFlags = GET_PRETTY_FLAGS(pretty);
1929 :
1930 142 : return pg_get_partkeydef_worker(relid, prettyFlags, true, false);
1931 : }
1932 :
1933 : /*
1934 : * Internal workhorse to decompile a partition key definition.
1935 : */
1936 : static char *
1937 1500 : pg_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 1500 : tuple = SearchSysCache1(PARTRELID, ObjectIdGetDatum(relid));
1954 1500 : if (!HeapTupleIsValid(tuple))
1955 : {
1956 6 : if (missing_ok)
1957 6 : return NULL;
1958 0 : elog(ERROR, "cache lookup failed for partition key of %u", relid);
1959 : }
1960 :
1961 1494 : form = (Form_pg_partitioned_table) GETSTRUCT(tuple);
1962 :
1963 : Assert(form->partrelid == relid);
1964 :
1965 : /* Must get partclass and partcollation the hard way */
1966 1494 : datum = SysCacheGetAttrNotNull(PARTRELID, tuple,
1967 : Anum_pg_partitioned_table_partclass);
1968 1494 : partclass = (oidvector *) DatumGetPointer(datum);
1969 :
1970 1494 : datum = SysCacheGetAttrNotNull(PARTRELID, tuple,
1971 : Anum_pg_partitioned_table_partcollation);
1972 1494 : 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 1494 : if (!heap_attisnull(tuple, Anum_pg_partitioned_table_partexprs, NULL))
1981 : {
1982 : Datum exprsDatum;
1983 : char *exprsString;
1984 :
1985 146 : exprsDatum = SysCacheGetAttrNotNull(PARTRELID, tuple,
1986 : Anum_pg_partitioned_table_partexprs);
1987 146 : exprsString = TextDatumGetCString(exprsDatum);
1988 146 : partexprs = (List *) stringToNode(exprsString);
1989 :
1990 146 : if (!IsA(partexprs, List))
1991 0 : elog(ERROR, "unexpected node type found in partexprs: %d",
1992 : (int) nodeTag(partexprs));
1993 :
1994 146 : pfree(exprsString);
1995 : }
1996 : else
1997 1348 : partexprs = NIL;
1998 :
1999 1494 : partexpr_item = list_head(partexprs);
2000 1494 : context = deparse_context_for(get_relation_name(relid), relid);
2001 :
2002 1494 : initStringInfo(&buf);
2003 :
2004 1494 : switch (form->partstrat)
2005 : {
2006 54 : case PARTITION_STRATEGY_HASH:
2007 54 : if (!attrsOnly)
2008 54 : appendStringInfoString(&buf, "HASH");
2009 54 : break;
2010 562 : case PARTITION_STRATEGY_LIST:
2011 562 : if (!attrsOnly)
2012 522 : appendStringInfoString(&buf, "LIST");
2013 562 : break;
2014 878 : case PARTITION_STRATEGY_RANGE:
2015 878 : if (!attrsOnly)
2016 776 : appendStringInfoString(&buf, "RANGE");
2017 878 : break;
2018 0 : default:
2019 0 : elog(ERROR, "unexpected partition strategy: %d",
2020 : (int) form->partstrat);
2021 : }
2022 :
2023 1494 : if (!attrsOnly)
2024 1352 : appendStringInfoString(&buf, " (");
2025 1494 : sep = "";
2026 3140 : for (keyno = 0; keyno < form->partnatts; keyno++)
2027 : {
2028 1646 : AttrNumber attnum = form->partattrs.values[keyno];
2029 : Oid keycoltype;
2030 : Oid keycolcollation;
2031 : Oid partcoll;
2032 :
2033 1646 : appendStringInfoString(&buf, sep);
2034 1646 : sep = ", ";
2035 1646 : if (attnum != 0)
2036 : {
2037 : /* Simple attribute reference */
2038 : char *attname;
2039 : int32 keycoltypmod;
2040 :
2041 1488 : attname = get_attname(relid, attnum, false);
2042 1488 : appendStringInfoString(&buf, quote_identifier(attname));
2043 1488 : get_atttypetypmodcoll(relid, attnum,
2044 : &keycoltype, &keycoltypmod,
2045 : &keycolcollation);
2046 : }
2047 : else
2048 : {
2049 : /* Expression */
2050 : Node *partkey;
2051 :
2052 158 : if (partexpr_item == NULL)
2053 0 : elog(ERROR, "too few entries in partexprs list");
2054 158 : partkey = (Node *) lfirst(partexpr_item);
2055 158 : partexpr_item = lnext(partexprs, partexpr_item);
2056 :
2057 : /* Deparse */
2058 158 : str = deparse_expression_pretty(partkey, context, false, false,
2059 : prettyFlags, 0);
2060 : /* Need parens if it's not a bare function call */
2061 158 : if (looks_like_function(partkey))
2062 56 : appendStringInfoString(&buf, str);
2063 : else
2064 102 : appendStringInfo(&buf, "(%s)", str);
2065 :
2066 158 : keycoltype = exprType(partkey);
2067 158 : keycolcollation = exprCollation(partkey);
2068 : }
2069 :
2070 : /* Add collation, if not default for column */
2071 1646 : partcoll = partcollation->values[keyno];
2072 1646 : if (!attrsOnly && OidIsValid(partcoll) && partcoll != keycolcollation)
2073 6 : appendStringInfo(&buf, " COLLATE %s",
2074 : generate_collation_name((partcoll)));
2075 :
2076 : /* Add the operator class name, if not default */
2077 1646 : if (!attrsOnly)
2078 1450 : get_opclass_name(partclass->values[keyno], keycoltype, &buf);
2079 : }
2080 :
2081 1494 : if (!attrsOnly)
2082 1352 : appendStringInfoChar(&buf, ')');
2083 :
2084 : /* Clean up */
2085 1494 : ReleaseSysCache(tuple);
2086 :
2087 1494 : 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 : */
2095 : Datum
2096 170 : pg_get_partition_constraintdef(PG_FUNCTION_ARGS)
2097 : {
2098 170 : Oid relationId = PG_GETARG_OID(0);
2099 : Expr *constr_expr;
2100 : int prettyFlags;
2101 : List *context;
2102 : char *consrc;
2103 :
2104 170 : constr_expr = get_partition_qual_relid(relationId);
2105 :
2106 : /* Quick exit if no partition constraint */
2107 170 : if (constr_expr == NULL)
2108 18 : PG_RETURN_NULL();
2109 :
2110 : /*
2111 : * Deparse and return the constraint expression.
2112 : */
2113 152 : prettyFlags = PRETTYFLAG_INDENT;
2114 152 : context = deparse_context_for(get_relation_name(relationId), relationId);
2115 152 : consrc = deparse_expression_pretty((Node *) constr_expr, context, false,
2116 : false, prettyFlags, 0);
2117 :
2118 152 : 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 : */
2127 : char *
2128 86 : pg_get_partconstrdef_string(Oid partitionId, char *aliasname)
2129 : {
2130 : Expr *constr_expr;
2131 : List *context;
2132 :
2133 86 : constr_expr = get_partition_qual_relid(partitionId);
2134 86 : context = deparse_context_for(aliasname, partitionId);
2135 :
2136 86 : 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 : */
2145 : Datum
2146 1992 : pg_get_constraintdef(PG_FUNCTION_ARGS)
2147 : {
2148 1992 : Oid constraintId = PG_GETARG_OID(0);
2149 : int prettyFlags;
2150 : char *res;
2151 :
2152 1992 : prettyFlags = PRETTYFLAG_INDENT;
2153 :
2154 1992 : res = pg_get_constraintdef_worker(constraintId, false, prettyFlags, true);
2155 :
2156 1992 : if (res == NULL)
2157 6 : PG_RETURN_NULL();
2158 :
2159 1986 : PG_RETURN_TEXT_P(string_to_text(res));
2160 : }
2161 :
2162 : Datum
2163 4720 : pg_get_constraintdef_ext(PG_FUNCTION_ARGS)
2164 : {
2165 4720 : Oid constraintId = PG_GETARG_OID(0);
2166 4720 : bool pretty = PG_GETARG_BOOL(1);
2167 : int prettyFlags;
2168 : char *res;
2169 :
2170 4720 : prettyFlags = GET_PRETTY_FLAGS(pretty);
2171 :
2172 4720 : res = pg_get_constraintdef_worker(constraintId, false, prettyFlags, true);
2173 :
2174 4720 : if (res == NULL)
2175 0 : PG_RETURN_NULL();
2176 :
2177 4720 : PG_RETURN_TEXT_P(string_to_text(res));
2178 : }
2179 :
2180 : /*
2181 : * Internal version that returns a full ALTER TABLE ... ADD CONSTRAINT command
2182 : */
2183 : char *
2184 596 : pg_get_constraintdef_command(Oid constraintId)
2185 : {
2186 596 : 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 : */
2192 : static char *
2193 7308 : pg_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 7308 : Snapshot snapshot = RegisterSnapshot(GetTransactionSnapshot());
2202 7308 : Relation relation = table_open(ConstraintRelationId, AccessShareLock);
2203 :
2204 7308 : ScanKeyInit(&scankey[0],
2205 : Anum_pg_constraint_oid,
2206 : BTEqualStrategyNumber, F_OIDEQ,
2207 : ObjectIdGetDatum(constraintId));
2208 :
2209 7308 : 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 7308 : tup = systable_getnext(scandesc);
2221 :
2222 7308 : UnregisterSnapshot(snapshot);
2223 :
2224 7308 : if (!HeapTupleIsValid(tup))
2225 : {
2226 6 : if (missing_ok)
2227 : {
2228 6 : systable_endscan(scandesc);
2229 6 : table_close(relation, AccessShareLock);
2230 6 : return NULL;
2231 : }
2232 0 : elog(ERROR, "could not find tuple for constraint %u", constraintId);
2233 : }
2234 :
2235 7302 : conForm = (Form_pg_constraint) GETSTRUCT(tup);
2236 :
2237 7302 : initStringInfo(&buf);
2238 :
2239 7302 : if (fullCommand)
2240 : {
2241 596 : 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 582 : appendStringInfo(&buf, "ALTER TABLE %s ADD CONSTRAINT %s ",
2251 : generate_qualified_relation_name(conForm->conrelid),
2252 582 : quote_identifier(NameStr(conForm->conname)));
2253 : }
2254 : else
2255 : {
2256 : /* Must be a domain constraint */
2257 : Assert(OidIsValid(conForm->contypid));
2258 14 : appendStringInfo(&buf, "ALTER DOMAIN %s ADD CONSTRAINT %s ",
2259 : generate_qualified_type_name(conForm->contypid),
2260 14 : quote_identifier(NameStr(conForm->conname)));
2261 : }
2262 : }
2263 :
2264 7302 : switch (conForm->contype)
2265 : {
2266 740 : case CONSTRAINT_FOREIGN:
2267 : {
2268 : Datum val;
2269 : bool isnull;
2270 : const char *string;
2271 :
2272 : /* Start off the constraint definition */
2273 740 : appendStringInfoString(&buf, "FOREIGN KEY (");
2274 :
2275 : /* Fetch and build referencing-column list */
2276 740 : val = SysCacheGetAttrNotNull(CONSTROID, tup,
2277 : Anum_pg_constraint_conkey);
2278 :
2279 : /* If it is a temporal foreign key then it uses PERIOD. */
2280 740 : decompile_column_index_array(val, conForm->conrelid, conForm->conperiod, &buf);
2281 :
2282 : /* add foreign relation name */
2283 740 : appendStringInfo(&buf, ") REFERENCES %s(",
2284 : generate_relation_name(conForm->confrelid,
2285 : NIL));
2286 :
2287 : /* Fetch and build referenced-column list */
2288 740 : val = SysCacheGetAttrNotNull(CONSTROID, tup,
2289 : Anum_pg_constraint_confkey);
2290 :
2291 740 : decompile_column_index_array(val, conForm->confrelid, conForm->conperiod, &buf);
2292 :
2293 740 : appendStringInfoChar(&buf, ')');
2294 :
2295 : /* Add match type */
2296 740 : switch (conForm->confmatchtype)
2297 : {
2298 34 : case FKCONSTR_MATCH_FULL:
2299 34 : string = " MATCH FULL";
2300 34 : break;
2301 0 : case FKCONSTR_MATCH_PARTIAL:
2302 0 : string = " MATCH PARTIAL";
2303 0 : break;
2304 706 : case FKCONSTR_MATCH_SIMPLE:
2305 706 : string = "";
2306 706 : break;
2307 0 : default:
2308 0 : elog(ERROR, "unrecognized confmatchtype: %d",
2309 : conForm->confmatchtype);
2310 : string = ""; /* keep compiler quiet */
2311 : break;
2312 : }
2313 740 : appendStringInfoString(&buf, string);
2314 :
2315 : /* Add ON UPDATE and ON DELETE clauses, if needed */
2316 740 : switch (conForm->confupdtype)
2317 : {
2318 616 : case FKCONSTR_ACTION_NOACTION:
2319 616 : string = NULL; /* suppress default */
2320 616 : break;
2321 0 : case FKCONSTR_ACTION_RESTRICT:
2322 0 : string = "RESTRICT";
2323 0 : break;
2324 96 : case FKCONSTR_ACTION_CASCADE:
2325 96 : string = "CASCADE";
2326 96 : break;
2327 28 : case FKCONSTR_ACTION_SETNULL:
2328 28 : string = "SET NULL";
2329 28 : break;
2330 0 : case FKCONSTR_ACTION_SETDEFAULT:
2331 0 : string = "SET DEFAULT";
2332 0 : break;
2333 0 : default:
2334 0 : elog(ERROR, "unrecognized confupdtype: %d",
2335 : conForm->confupdtype);
2336 : string = NULL; /* keep compiler quiet */
2337 : break;
2338 : }
2339 740 : if (string)
2340 124 : appendStringInfo(&buf, " ON UPDATE %s", string);
2341 :
2342 740 : switch (conForm->confdeltype)
2343 : {
2344 620 : case FKCONSTR_ACTION_NOACTION:
2345 620 : string = NULL; /* suppress default */
2346 620 : break;
2347 0 : case FKCONSTR_ACTION_RESTRICT:
2348 0 : string = "RESTRICT";
2349 0 : break;
2350 96 : case FKCONSTR_ACTION_CASCADE:
2351 96 : string = "CASCADE";
2352 96 : break;
2353 18 : case FKCONSTR_ACTION_SETNULL:
2354 18 : string = "SET NULL";
2355 18 : break;
2356 6 : case FKCONSTR_ACTION_SETDEFAULT:
2357 6 : string = "SET DEFAULT";
2358 6 : break;
2359 0 : default:
2360 0 : elog(ERROR, "unrecognized confdeltype: %d",
2361 : conForm->confdeltype);
2362 : string = NULL; /* keep compiler quiet */
2363 : break;
2364 : }
2365 740 : if (string)
2366 120 : appendStringInfo(&buf, " ON DELETE %s", string);
2367 :
2368 : /*
2369 : * Add columns specified to SET NULL or SET DEFAULT if
2370 : * provided.
2371 : */
2372 740 : val = SysCacheGetAttr(CONSTROID, tup,
2373 : Anum_pg_constraint_confdelsetcols, &isnull);
2374 740 : if (!isnull)
2375 : {
2376 12 : appendStringInfoString(&buf, " (");
2377 12 : decompile_column_index_array(val, conForm->conrelid, false, &buf);
2378 12 : appendStringInfoChar(&buf, ')');
2379 : }
2380 :
2381 740 : break;
2382 : }
2383 3974 : 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 3974 : if (conForm->contype == CONSTRAINT_PRIMARY)
2393 3232 : appendStringInfoString(&buf, "PRIMARY KEY ");
2394 : else
2395 742 : appendStringInfoString(&buf, "UNIQUE ");
2396 :
2397 3974 : indexId = conForm->conindid;
2398 :
2399 3974 : indtup = SearchSysCache1(INDEXRELID, ObjectIdGetDatum(indexId));
2400 3974 : if (!HeapTupleIsValid(indtup))
2401 0 : elog(ERROR, "cache lookup failed for index %u", indexId);
2402 3974 : if (conForm->contype == CONSTRAINT_UNIQUE &&
2403 742 : ((Form_pg_index) GETSTRUCT(indtup))->indnullsnotdistinct)
2404 0 : appendStringInfoString(&buf, "NULLS NOT DISTINCT ");
2405 :
2406 3974 : appendStringInfoChar(&buf, '(');
2407 :
2408 : /* Fetch and build target column list */
2409 3974 : val = SysCacheGetAttrNotNull(CONSTROID, tup,
2410 : Anum_pg_constraint_conkey);
2411 :
2412 3974 : keyatts = decompile_column_index_array(val, conForm->conrelid, false, &buf);
2413 3974 : if (conForm->conperiod)
2414 398 : appendStringInfoString(&buf, " WITHOUT OVERLAPS");
2415 :
2416 3974 : appendStringInfoChar(&buf, ')');
2417 :
2418 : /* Build including column list (from pg_index.indkeys) */
2419 3974 : val = SysCacheGetAttrNotNull(INDEXRELID, indtup,
2420 : Anum_pg_index_indnatts);
2421 3974 : if (DatumGetInt32(val) > keyatts)
2422 : {
2423 : Datum cols;
2424 : Datum *keys;
2425 : int nKeys;
2426 : int j;
2427 :
2428 82 : appendStringInfoString(&buf, " INCLUDE (");
2429 :
2430 82 : cols = SysCacheGetAttrNotNull(INDEXRELID, indtup,
2431 : Anum_pg_index_indkey);
2432 :
2433 82 : deconstruct_array_builtin(DatumGetArrayTypeP(cols), INT2OID,
2434 : &keys, NULL, &nKeys);
2435 :
2436 246 : for (j = keyatts; j < nKeys; j++)
2437 : {
2438 : char *colName;
2439 :
2440 164 : colName = get_attname(conForm->conrelid,
2441 164 : DatumGetInt16(keys[j]), false);
2442 164 : if (j > keyatts)
2443 82 : appendStringInfoString(&buf, ", ");
2444 164 : appendStringInfoString(&buf, quote_identifier(colName));
2445 : }
2446 :
2447 82 : appendStringInfoChar(&buf, ')');
2448 : }
2449 3974 : ReleaseSysCache(indtup);
2450 :
2451 : /* XXX why do we only print these bits if fullCommand? */
2452 3974 : if (fullCommand && OidIsValid(indexId))
2453 : {
2454 204 : char *options = flatten_reloptions(indexId);
2455 : Oid tblspc;
2456 :
2457 204 : if (options)
2458 : {
2459 0 : appendStringInfo(&buf, " WITH (%s)", options);
2460 0 : 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 204 : tblspc = get_rel_tablespace(indexId);
2470 204 : if (OidIsValid(tblspc))
2471 24 : appendStringInfo(&buf, " USING INDEX TABLESPACE %s",
2472 24 : quote_identifier(get_tablespace_name(tblspc)));
2473 : }
2474 :
2475 3974 : break;
2476 : }
2477 2280 : 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 2280 : val = SysCacheGetAttrNotNull(CONSTROID, tup,
2487 : Anum_pg_constraint_conbin);
2488 :
2489 2280 : conbin = TextDatumGetCString(val);
2490 2280 : expr = stringToNode(conbin);
2491 :
2492 : /* Set up deparsing context for Var nodes in constraint */
2493 2280 : if (conForm->conrelid != InvalidOid)
2494 : {
2495 : /* relation constraint */
2496 2050 : context = deparse_context_for(get_relation_name(conForm->conrelid),
2497 : conForm->conrelid);
2498 : }
2499 : else
2500 : {
2501 : /* domain constraint --- can't have Vars */
2502 230 : context = NIL;
2503 : }
2504 :
2505 2280 : 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 2280 : appendStringInfo(&buf, "CHECK (%s)%s",
2521 : consrc,
2522 2280 : conForm->connoinherit ? " NO INHERIT" : "");
2523 2280 : break;
2524 : }
2525 204 : case CONSTRAINT_NOTNULL:
2526 : {
2527 204 : if (conForm->conrelid)
2528 : {
2529 : AttrNumber attnum;
2530 :
2531 198 : attnum = extractNotNullColumn(tup);
2532 :
2533 198 : appendStringInfo(&buf, "NOT NULL %s",
2534 198 : quote_identifier(get_attname(conForm->conrelid,
2535 : attnum, false)));
2536 198 : if (((Form_pg_constraint) GETSTRUCT(tup))->connoinherit)
2537 0 : appendStringInfoString(&buf, " NO INHERIT");
2538 : }
2539 6 : else if (conForm->contypid)
2540 : {
2541 : /* conkey is null for domain not-null constraints */
2542 6 : appendStringInfoString(&buf, "NOT NULL");
2543 : }
2544 204 : break;
2545 : }
2546 :
2547 0 : 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 0 : appendStringInfoString(&buf, "TRIGGER");
2556 0 : break;
2557 104 : case CONSTRAINT_EXCLUSION:
2558 : {
2559 104 : 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 104 : val = SysCacheGetAttrNotNull(CONSTROID, tup,
2568 : Anum_pg_constraint_conexclop);
2569 :
2570 104 : deconstruct_array_builtin(DatumGetArrayTypeP(val), OIDOID,
2571 : &elems, NULL, &nElems);
2572 :
2573 104 : operators = (Oid *) palloc(nElems * sizeof(Oid));
2574 228 : for (i = 0; i < nElems; i++)
2575 124 : 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 104 : appendStringInfoString(&buf,
2580 104 : pg_get_indexdef_worker(indexOid,
2581 : 0,
2582 : operators,
2583 : false,
2584 : false,
2585 : false,
2586 : false,
2587 : prettyFlags,
2588 : false));
2589 104 : break;
2590 : }
2591 0 : default:
2592 0 : elog(ERROR, "invalid constraint type \"%c\"", conForm->contype);
2593 : break;
2594 : }
2595 :
2596 7302 : if (conForm->condeferrable)
2597 120 : appendStringInfoString(&buf, " DEFERRABLE");
2598 7302 : if (conForm->condeferred)
2599 48 : appendStringInfoString(&buf, " INITIALLY DEFERRED");
2600 :
2601 : /* Validated status is irrelevant when the constraint is NOT ENFORCED. */
2602 7302 : if (!conForm->conenforced)
2603 86 : appendStringInfoString(&buf, " NOT ENFORCED");
2604 7216 : else if (!conForm->convalidated)
2605 104 : appendStringInfoString(&buf, " NOT VALID");
2606 :
2607 : /* Cleanup */
2608 7302 : systable_endscan(scandesc);
2609 7302 : table_close(relation, AccessShareLock);
2610 :
2611 7302 : 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 : */
2620 : static int
2621 5466 : decompile_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 5466 : deconstruct_array_builtin(DatumGetArrayTypeP(column_index_array), INT2OID,
2630 : &keys, NULL, &nKeys);
2631 :
2632 13240 : for (j = 0; j < nKeys; j++)
2633 : {
2634 : char *colName;
2635 :
2636 7774 : colName = get_attname(relId, DatumGetInt16(keys[j]), false);
2637 :
2638 7774 : if (j == 0)
2639 5466 : appendStringInfoString(buf, quote_identifier(colName));
2640 : else
2641 2536 : appendStringInfo(buf, ", %s%s",
2642 228 : (withPeriod && j == nKeys - 1) ? "PERIOD " : "",
2643 : quote_identifier(colName));
2644 : }
2645 :
2646 5466 : 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 : */
2674 : Datum
2675 8440 : pg_get_expr(PG_FUNCTION_ARGS)
2676 : {
2677 8440 : text *expr = PG_GETARG_TEXT_PP(0);
2678 8440 : Oid relid = PG_GETARG_OID(1);
2679 : text *result;
2680 : int prettyFlags;
2681 :
2682 8440 : prettyFlags = PRETTYFLAG_INDENT;
2683 :
2684 8440 : result = pg_get_expr_worker(expr, relid, prettyFlags);
2685 8440 : if (result)
2686 8424 : PG_RETURN_TEXT_P(result);
2687 : else
2688 16 : PG_RETURN_NULL();
2689 : }
2690 :
2691 : Datum
2692 712 : pg_get_expr_ext(PG_FUNCTION_ARGS)
2693 : {
2694 712 : text *expr = PG_GETARG_TEXT_PP(0);
2695 712 : Oid relid = PG_GETARG_OID(1);
2696 712 : bool pretty = PG_GETARG_BOOL(2);
2697 : text *result;
2698 : int prettyFlags;
2699 :
2700 712 : prettyFlags = GET_PRETTY_FLAGS(pretty);
2701 :
2702 712 : result = pg_get_expr_worker(expr, relid, prettyFlags);
2703 712 : if (result)
2704 712 : PG_RETURN_TEXT_P(result);
2705 : else
2706 0 : PG_RETURN_NULL();
2707 : }
2708 :
2709 : static text *
2710 9152 : pg_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 9152 : Relation rel = NULL;
2718 : char *str;
2719 :
2720 : /* Convert input pg_node_tree (really TEXT) object to C string */
2721 9152 : exprstr = text_to_cstring(expr);
2722 :
2723 : /* Convert expression to node tree */
2724 9152 : node = (Node *) stringToNode(exprstr);
2725 :
2726 9152 : 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 9152 : tst = node;
2735 9152 : while (tst && IsA(tst, List))
2736 0 : tst = linitial((List *) tst);
2737 9152 : if (tst && IsA(tst, Query))
2738 0 : 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 9152 : relids = pull_varnos(NULL, node);
2747 9152 : if (OidIsValid(relid))
2748 : {
2749 9084 : if (!bms_is_subset(relids, bms_make_singleton(1)))
2750 0 : ereport(ERROR,
2751 : (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
2752 : errmsg("expression contains variables of more than one relation")));
2753 : }
2754 : else
2755 : {
2756 68 : if (!bms_is_empty(relids))
2757 0 : 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 9152 : if (OidIsValid(relid))
2769 : {
2770 9084 : rel = try_relation_open(relid, AccessShareLock);
2771 9084 : if (rel == NULL)
2772 16 : return NULL;
2773 9068 : context = deparse_context_for(RelationGetRelationName(rel), relid);
2774 : }
2775 : else
2776 68 : context = NIL;
2777 :
2778 : /* Deparse */
2779 9136 : str = deparse_expression_pretty(node, context, false, false,
2780 : prettyFlags, 0);
2781 :
2782 9136 : if (rel != NULL)
2783 9068 : relation_close(rel, AccessShareLock);
2784 :
2785 9136 : 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 : */
2794 : Datum
2795 1688 : pg_get_userbyid(PG_FUNCTION_ARGS)
2796 : {
2797 1688 : 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 1688 : result = (Name) palloc(NAMEDATALEN);
2806 1688 : memset(NameStr(*result), 0, NAMEDATALEN);
2807 :
2808 : /*
2809 : * Get the pg_authid entry and print the result
2810 : */
2811 1688 : roletup = SearchSysCache1(AUTHOID, ObjectIdGetDatum(roleid));
2812 1688 : if (HeapTupleIsValid(roletup))
2813 : {
2814 1688 : role_rec = (Form_pg_authid) GETSTRUCT(roletup);
2815 1688 : *result = role_rec->rolname;
2816 1688 : ReleaseSysCache(roletup);
2817 : }
2818 : else
2819 0 : sprintf(NameStr(*result), "unknown (OID=%u)", roleid);
2820 :
2821 1688 : 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 : */
2832 : Datum
2833 12 : pg_get_serial_sequence(PG_FUNCTION_ARGS)
2834 : {
2835 12 : text *tablename = PG_GETARG_TEXT_PP(0);
2836 12 : text *columnname = PG_GETARG_TEXT_PP(1);
2837 : RangeVar *tablerv;
2838 : Oid tableOid;
2839 : char *column;
2840 : AttrNumber attnum;
2841 12 : 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 12 : tablerv = makeRangeVarFromNameList(textToQualifiedNameList(tablename));
2849 12 : tableOid = RangeVarGetRelid(tablerv, NoLock, false);
2850 :
2851 : /* Get the number of the column */
2852 12 : column = text_to_cstring(columnname);
2853 :
2854 12 : attnum = get_attnum(tableOid, column);
2855 12 : if (attnum == InvalidAttrNumber)
2856 0 : 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 12 : depRel = table_open(DependRelationId, AccessShareLock);
2863 :
2864 12 : ScanKeyInit(&key[0],
2865 : Anum_pg_depend_refclassid,
2866 : BTEqualStrategyNumber, F_OIDEQ,
2867 : ObjectIdGetDatum(RelationRelationId));
2868 12 : ScanKeyInit(&key[1],
2869 : Anum_pg_depend_refobjid,
2870 : BTEqualStrategyNumber, F_OIDEQ,
2871 : ObjectIdGetDatum(tableOid));
2872 12 : ScanKeyInit(&key[2],
2873 : Anum_pg_depend_refobjsubid,
2874 : BTEqualStrategyNumber, F_INT4EQ,
2875 : Int32GetDatum(attnum));
2876 :
2877 12 : scan = systable_beginscan(depRel, DependReferenceIndexId, true,
2878 : NULL, 3, key);
2879 :
2880 30 : while (HeapTupleIsValid(tup = systable_getnext(scan)))
2881 : {
2882 30 : 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 30 : if (deprec->classid == RelationRelationId &&
2890 12 : deprec->objsubid == 0 &&
2891 12 : (deprec->deptype == DEPENDENCY_AUTO ||
2892 18 : deprec->deptype == DEPENDENCY_INTERNAL) &&
2893 12 : get_rel_relkind(deprec->objid) == RELKIND_SEQUENCE)
2894 : {
2895 12 : sequenceId = deprec->objid;
2896 12 : break;
2897 : }
2898 : }
2899 :
2900 12 : systable_endscan(scan);
2901 12 : table_close(depRel, AccessShareLock);
2902 :
2903 12 : if (OidIsValid(sequenceId))
2904 : {
2905 : char *result;
2906 :
2907 12 : result = generate_qualified_relation_name(sequenceId);
2908 :
2909 12 : PG_RETURN_TEXT_P(string_to_text(result));
2910 : }
2911 :
2912 0 : 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 : */
2926 : Datum
2927 172 : pg_get_functiondef(PG_FUNCTION_ARGS)
2928 : {
2929 172 : 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 172 : initStringInfo(&buf);
2944 :
2945 : /* Look up the function */
2946 172 : proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
2947 172 : if (!HeapTupleIsValid(proctup))
2948 6 : PG_RETURN_NULL();
2949 :
2950 166 : proc = (Form_pg_proc) GETSTRUCT(proctup);
2951 166 : name = NameStr(proc->proname);
2952 :
2953 166 : if (proc->prokind == PROKIND_AGGREGATE)
2954 0 : ereport(ERROR,
2955 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
2956 : errmsg("\"%s\" is an aggregate function", name)));
2957 :
2958 166 : isfunction = (proc->prokind != PROKIND_PROCEDURE);
2959 :
2960 : /*
2961 : * We always qualify the function name, to ensure the right function gets
2962 : * replaced.
2963 : */
2964 166 : nsp = get_namespace_name_or_temp(proc->pronamespace);
2965 166 : appendStringInfo(&buf, "CREATE OR REPLACE %s %s(",
2966 : isfunction ? "FUNCTION" : "PROCEDURE",
2967 : quote_qualified_identifier(nsp, name));
2968 166 : (void) print_function_arguments(&buf, proctup, false, true);
2969 166 : appendStringInfoString(&buf, ")\n");
2970 166 : if (isfunction)
2971 : {
2972 146 : appendStringInfoString(&buf, " RETURNS ");
2973 146 : print_function_rettype(&buf, proctup);
2974 146 : appendStringInfoChar(&buf, '\n');
2975 : }
2976 :
2977 166 : print_function_trftypes(&buf, proctup);
2978 :
2979 166 : appendStringInfo(&buf, " LANGUAGE %s\n",
2980 166 : quote_identifier(get_language_name(proc->prolang, false)));
2981 :
2982 : /* Emit some miscellaneous options on one line */
2983 166 : oldlen = buf.len;
2984 :
2985 166 : if (proc->prokind == PROKIND_WINDOW)
2986 0 : appendStringInfoString(&buf, " WINDOW");
2987 166 : switch (proc->provolatile)
2988 : {
2989 12 : case PROVOLATILE_IMMUTABLE:
2990 12 : appendStringInfoString(&buf, " IMMUTABLE");
2991 12 : break;
2992 30 : case PROVOLATILE_STABLE:
2993 30 : appendStringInfoString(&buf, " STABLE");
2994 30 : break;
2995 124 : case PROVOLATILE_VOLATILE:
2996 124 : break;
2997 : }
2998 :
2999 166 : switch (proc->proparallel)
3000 : {
3001 28 : case PROPARALLEL_SAFE:
3002 28 : appendStringInfoString(&buf, " PARALLEL SAFE");
3003 28 : break;
3004 0 : case PROPARALLEL_RESTRICTED:
3005 0 : appendStringInfoString(&buf, " PARALLEL RESTRICTED");
3006 0 : break;
3007 138 : case PROPARALLEL_UNSAFE:
3008 138 : break;
3009 : }
3010 :
3011 166 : if (proc->proisstrict)
3012 50 : appendStringInfoString(&buf, " STRICT");
3013 166 : if (proc->prosecdef)
3014 6 : appendStringInfoString(&buf, " SECURITY DEFINER");
3015 166 : if (proc->proleakproof)
3016 0 : appendStringInfoString(&buf, " LEAKPROOF");
3017 :
3018 : /* This code for the default cost and rows should match functioncmds.c */
3019 166 : if (proc->prolang == INTERNALlanguageId ||
3020 166 : proc->prolang == ClanguageId)
3021 10 : procost = 1;
3022 : else
3023 156 : procost = 100;
3024 166 : if (proc->procost != procost)
3025 6 : appendStringInfo(&buf, " COST %g", proc->procost);
3026 :
3027 166 : if (proc->prorows > 0 && proc->prorows != 1000)
3028 0 : appendStringInfo(&buf, " ROWS %g", proc->prorows);
3029 :
3030 166 : 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 0 : argtypes[0] = INTERNALOID;
3039 0 : appendStringInfo(&buf, " SUPPORT %s",
3040 : generate_function_name(proc->prosupport, 1,
3041 : NIL, argtypes,
3042 : false, NULL, false));
3043 : }
3044 :
3045 166 : if (oldlen != buf.len)
3046 64 : appendStringInfoChar(&buf, '\n');
3047 :
3048 : /* Emit any proconfig options, one per line */
3049 166 : tmp = SysCacheGetAttr(PROCOID, proctup, Anum_pg_proc_proconfig, &isnull);
3050 166 : if (!isnull)
3051 : {
3052 6 : 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 36 : for (i = 1; i <= ARR_DIMS(a)[0]; i++)
3060 : {
3061 : Datum d;
3062 :
3063 30 : 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 30 : if (!isnull)
3070 : {
3071 30 : char *configitem = TextDatumGetCString(d);
3072 : char *pos;
3073 :
3074 30 : pos = strchr(configitem, '=');
3075 30 : if (pos == NULL)
3076 0 : continue;
3077 30 : *pos++ = '\0';
3078 :
3079 30 : 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 30 : if (GetConfigOptionFlags(configitem, true) & GUC_LIST_QUOTE)
3099 : {
3100 : List *namelist;
3101 : ListCell *lc;
3102 :
3103 : /* Parse string into list of identifiers */
3104 12 : if (!SplitGUCList(pos, ',', &namelist))
3105 : {
3106 : /* this shouldn't fail really */
3107 0 : elog(ERROR, "invalid list syntax in proconfig item");
3108 : }
3109 42 : foreach(lc, namelist)
3110 : {
3111 30 : char *curname = (char *) lfirst(lc);
3112 :
3113 30 : simple_quote_literal(&buf, curname);
3114 30 : if (lnext(namelist, lc))
3115 18 : appendStringInfoString(&buf, ", ");
3116 : }
3117 : }
3118 : else
3119 18 : simple_quote_literal(&buf, pos);
3120 30 : appendStringInfoChar(&buf, '\n');
3121 : }
3122 : }
3123 : }
3124 :
3125 : /* And finally the function definition ... */
3126 166 : (void) SysCacheGetAttr(PROCOID, proctup, Anum_pg_proc_prosqlbody, &isnull);
3127 166 : if (proc->prolang == SQLlanguageId && !isnull)
3128 : {
3129 114 : print_function_sqlbody(&buf, proctup);
3130 : }
3131 : else
3132 : {
3133 52 : appendStringInfoString(&buf, "AS ");
3134 :
3135 52 : tmp = SysCacheGetAttr(PROCOID, proctup, Anum_pg_proc_probin, &isnull);
3136 52 : if (!isnull)
3137 : {
3138 10 : simple_quote_literal(&buf, TextDatumGetCString(tmp));
3139 10 : appendStringInfoString(&buf, ", "); /* assume prosrc isn't null */
3140 : }
3141 :
3142 52 : tmp = SysCacheGetAttrNotNull(PROCOID, proctup, Anum_pg_proc_prosrc);
3143 52 : 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 52 : initStringInfo(&dq);
3154 52 : appendStringInfoChar(&dq, '$');
3155 52 : appendStringInfoString(&dq, (isfunction ? "function" : "procedure"));
3156 52 : while (strstr(prosrc, dq.data) != NULL)
3157 0 : appendStringInfoChar(&dq, 'x');
3158 52 : appendStringInfoChar(&dq, '$');
3159 :
3160 52 : appendBinaryStringInfo(&buf, dq.data, dq.len);
3161 52 : appendStringInfoString(&buf, prosrc);
3162 52 : appendBinaryStringInfo(&buf, dq.data, dq.len);
3163 : }
3164 :
3165 166 : appendStringInfoChar(&buf, '\n');
3166 :
3167 166 : ReleaseSysCache(proctup);
3168 :
3169 166 : 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 : */
3178 : Datum
3179 4738 : pg_get_function_arguments(PG_FUNCTION_ARGS)
3180 : {
3181 4738 : Oid funcid = PG_GETARG_OID(0);
3182 : StringInfoData buf;
3183 : HeapTuple proctup;
3184 :
3185 4738 : proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
3186 4738 : if (!HeapTupleIsValid(proctup))
3187 6 : PG_RETURN_NULL();
3188 :
3189 4732 : initStringInfo(&buf);
3190 :
3191 4732 : (void) print_function_arguments(&buf, proctup, false, true);
3192 :
3193 4732 : ReleaseSysCache(proctup);
3194 :
3195 4732 : 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 : */
3204 : Datum
3205 4206 : pg_get_function_identity_arguments(PG_FUNCTION_ARGS)
3206 : {
3207 4206 : Oid funcid = PG_GETARG_OID(0);
3208 : StringInfoData buf;
3209 : HeapTuple proctup;
3210 :
3211 4206 : proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
3212 4206 : if (!HeapTupleIsValid(proctup))
3213 6 : PG_RETURN_NULL();
3214 :
3215 4200 : initStringInfo(&buf);
3216 :
3217 4200 : (void) print_function_arguments(&buf, proctup, false, false);
3218 :
3219 4200 : ReleaseSysCache(proctup);
3220 :
3221 4200 : 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 : */
3229 : Datum
3230 4146 : pg_get_function_result(PG_FUNCTION_ARGS)
3231 : {
3232 4146 : Oid funcid = PG_GETARG_OID(0);
3233 : StringInfoData buf;
3234 : HeapTuple proctup;
3235 :
3236 4146 : proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
3237 4146 : if (!HeapTupleIsValid(proctup))
3238 6 : PG_RETURN_NULL();
3239 :
3240 4140 : if (((Form_pg_proc) GETSTRUCT(proctup))->prokind == PROKIND_PROCEDURE)
3241 : {
3242 246 : ReleaseSysCache(proctup);
3243 246 : PG_RETURN_NULL();
3244 : }
3245 :
3246 3894 : initStringInfo(&buf);
3247 :
3248 3894 : print_function_rettype(&buf, proctup);
3249 :
3250 3894 : ReleaseSysCache(proctup);
3251 :
3252 3894 : 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 : */
3259 : static void
3260 4040 : print_function_rettype(StringInfo buf, HeapTuple proctup)
3261 : {
3262 4040 : Form_pg_proc proc = (Form_pg_proc) GETSTRUCT(proctup);
3263 4040 : int ntabargs = 0;
3264 : StringInfoData rbuf;
3265 :
3266 4040 : initStringInfo(&rbuf);
3267 :
3268 4040 : if (proc->proretset)
3269 : {
3270 : /* It might be a table function; try to print the arguments */
3271 412 : appendStringInfoString(&rbuf, "TABLE(");
3272 412 : ntabargs = print_function_arguments(&rbuf, proctup, true, false);
3273 412 : if (ntabargs > 0)
3274 76 : appendStringInfoChar(&rbuf, ')');
3275 : else
3276 336 : resetStringInfo(&rbuf);
3277 : }
3278 :
3279 4040 : if (ntabargs == 0)
3280 : {
3281 : /* Not a table function, so do the normal thing */
3282 3964 : if (proc->proretset)
3283 336 : appendStringInfoString(&rbuf, "SETOF ");
3284 3964 : appendStringInfoString(&rbuf, format_type_be(proc->prorettype));
3285 : }
3286 :
3287 4040 : appendBinaryStringInfo(buf, rbuf.data, rbuf.len);
3288 4040 : }
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 : */
3297 : static int
3298 9510 : print_function_arguments(StringInfo buf, HeapTuple proctup,
3299 : bool print_table_args, bool print_defaults)
3300 : {
3301 9510 : Form_pg_proc proc = (Form_pg_proc) GETSTRUCT(proctup);
3302 : int numargs;
3303 : Oid *argtypes;
3304 : char **argnames;
3305 : char *argmodes;
3306 9510 : int insertorderbyat = -1;
3307 : int argsprinted;
3308 : int inputargno;
3309 : int nlackdefaults;
3310 9510 : List *argdefaults = NIL;
3311 9510 : ListCell *nextargdefault = NULL;
3312 : int i;
3313 :
3314 9510 : numargs = get_func_arg_info(proctup,
3315 : &argtypes, &argnames, &argmodes);
3316 :
3317 9510 : nlackdefaults = numargs;
3318 9510 : if (print_defaults && proc->pronargdefaults > 0)
3319 : {
3320 : Datum proargdefaults;
3321 : bool isnull;
3322 :
3323 38 : proargdefaults = SysCacheGetAttr(PROCOID, proctup,
3324 : Anum_pg_proc_proargdefaults,
3325 : &isnull);
3326 38 : if (!isnull)
3327 : {
3328 : char *str;
3329 :
3330 38 : str = TextDatumGetCString(proargdefaults);
3331 38 : argdefaults = castNode(List, stringToNode(str));
3332 38 : pfree(str);
3333 38 : nextargdefault = list_head(argdefaults);
3334 : /* nlackdefaults counts only *input* arguments lacking defaults */
3335 38 : nlackdefaults = proc->pronargs - list_length(argdefaults);
3336 : }
3337 : }
3338 :
3339 : /* Check for special treatment of ordered-set aggregates */
3340 9510 : if (proc->prokind == PROKIND_AGGREGATE)
3341 : {
3342 : HeapTuple aggtup;
3343 : Form_pg_aggregate agg;
3344 :
3345 1186 : aggtup = SearchSysCache1(AGGFNOID, ObjectIdGetDatum(proc->oid));
3346 1186 : if (!HeapTupleIsValid(aggtup))
3347 0 : elog(ERROR, "cache lookup failed for aggregate %u",
3348 : proc->oid);
3349 1186 : agg = (Form_pg_aggregate) GETSTRUCT(aggtup);
3350 1186 : if (AGGKIND_IS_ORDERED_SET(agg->aggkind))
3351 52 : insertorderbyat = agg->aggnumdirectargs;
3352 1186 : ReleaseSysCache(aggtup);
3353 : }
3354 :
3355 9510 : argsprinted = 0;
3356 9510 : inputargno = 0;
3357 19000 : for (i = 0; i < numargs; i++)
3358 : {
3359 9490 : Oid argtype = argtypes[i];
3360 9490 : char *argname = argnames ? argnames[i] : NULL;
3361 9490 : char argmode = argmodes ? argmodes[i] : PROARGMODE_IN;
3362 : const char *modename;
3363 : bool isinput;
3364 :
3365 9490 : switch (argmode)
3366 : {
3367 7812 : 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 7812 : if (proc->prokind == PROKIND_PROCEDURE)
3374 548 : modename = "IN ";
3375 : else
3376 7264 : modename = "";
3377 7812 : isinput = true;
3378 7812 : break;
3379 100 : case PROARGMODE_INOUT:
3380 100 : modename = "INOUT ";
3381 100 : isinput = true;
3382 100 : break;
3383 956 : case PROARGMODE_OUT:
3384 956 : modename = "OUT ";
3385 956 : isinput = false;
3386 956 : break;
3387 178 : case PROARGMODE_VARIADIC:
3388 178 : modename = "VARIADIC ";
3389 178 : isinput = true;
3390 178 : break;
3391 444 : case PROARGMODE_TABLE:
3392 444 : modename = "";
3393 444 : isinput = false;
3394 444 : break;
3395 0 : default:
3396 0 : elog(ERROR, "invalid parameter mode '%c'", argmode);
3397 : modename = NULL; /* keep compiler quiet */
3398 : isinput = false;
3399 : break;
3400 : }
3401 9490 : if (isinput)
3402 8090 : inputargno++; /* this is a 1-based counter */
3403 :
3404 9490 : if (print_table_args != (argmode == PROARGMODE_TABLE))
3405 764 : continue;
3406 :
3407 8726 : if (argsprinted == insertorderbyat)
3408 : {
3409 52 : if (argsprinted)
3410 52 : appendStringInfoChar(buf, ' ');
3411 52 : appendStringInfoString(buf, "ORDER BY ");
3412 : }
3413 8674 : else if (argsprinted)
3414 2776 : appendStringInfoString(buf, ", ");
3415 :
3416 8726 : appendStringInfoString(buf, modename);
3417 8726 : if (argname && argname[0])
3418 3122 : appendStringInfo(buf, "%s ", quote_identifier(argname));
3419 8726 : appendStringInfoString(buf, format_type_be(argtype));
3420 8726 : if (print_defaults && isinput && inputargno > nlackdefaults)
3421 : {
3422 : Node *expr;
3423 :
3424 : Assert(nextargdefault != NULL);
3425 58 : expr = (Node *) lfirst(nextargdefault);
3426 58 : nextargdefault = lnext(argdefaults, nextargdefault);
3427 :
3428 58 : appendStringInfo(buf, " DEFAULT %s",
3429 : deparse_expression(expr, NIL, false, false));
3430 : }
3431 8726 : argsprinted++;
3432 :
3433 : /* nasty hack: print the last arg twice for variadic ordered-set agg */
3434 8726 : if (argsprinted == insertorderbyat && i == numargs - 1)
3435 : {
3436 26 : i--;
3437 : /* aggs shouldn't have defaults anyway, but just to be sure ... */
3438 26 : print_defaults = false;
3439 : }
3440 : }
3441 :
3442 9510 : return argsprinted;
3443 : }
3444 :
3445 : static bool
3446 96 : is_input_argument(int nth, const char *argmodes)
3447 : {
3448 : return (!argmodes
3449 42 : || argmodes[nth] == PROARGMODE_IN
3450 18 : || argmodes[nth] == PROARGMODE_INOUT
3451 138 : || argmodes[nth] == PROARGMODE_VARIADIC);
3452 : }
3453 :
3454 : /*
3455 : * Append used transformed types to specified buffer
3456 : */
3457 : static void
3458 166 : print_function_trftypes(StringInfo buf, HeapTuple proctup)
3459 : {
3460 : Oid *trftypes;
3461 : int ntypes;
3462 :
3463 166 : ntypes = get_func_trftypes(proctup, &trftypes);
3464 166 : if (ntypes > 0)
3465 : {
3466 : int i;
3467 :
3468 6 : appendStringInfoString(buf, " TRANSFORM ");
3469 16 : for (i = 0; i < ntypes; i++)
3470 : {
3471 10 : if (i != 0)
3472 4 : appendStringInfoString(buf, ", ");
3473 10 : appendStringInfo(buf, "FOR TYPE %s", format_type_be(trftypes[i]));
3474 : }
3475 6 : appendStringInfoChar(buf, '\n');
3476 : }
3477 166 : }
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 : */
3485 : Datum
3486 54 : pg_get_function_arg_default(PG_FUNCTION_ARGS)
3487 : {
3488 54 : Oid funcid = PG_GETARG_OID(0);
3489 54 : 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 54 : proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
3506 54 : if (!HeapTupleIsValid(proctup))
3507 12 : PG_RETURN_NULL();
3508 :
3509 42 : numargs = get_func_arg_info(proctup, &argtypes, &argnames, &argmodes);
3510 42 : if (nth_arg < 1 || nth_arg > numargs || !is_input_argument(nth_arg - 1, argmodes))
3511 : {
3512 12 : ReleaseSysCache(proctup);
3513 12 : PG_RETURN_NULL();
3514 : }
3515 :
3516 30 : nth_inputarg = 0;
3517 84 : for (i = 0; i < nth_arg; i++)
3518 54 : if (is_input_argument(i, argmodes))
3519 48 : nth_inputarg++;
3520 :
3521 30 : proargdefaults = SysCacheGetAttr(PROCOID, proctup,
3522 : Anum_pg_proc_proargdefaults,
3523 : &isnull);
3524 30 : if (isnull)
3525 : {
3526 0 : ReleaseSysCache(proctup);
3527 0 : PG_RETURN_NULL();
3528 : }
3529 :
3530 30 : str = TextDatumGetCString(proargdefaults);
3531 30 : argdefaults = castNode(List, stringToNode(str));
3532 30 : pfree(str);
3533 :
3534 30 : 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 30 : nth_default = nth_inputarg - 1 - (proc->pronargs - proc->pronargdefaults);
3541 :
3542 30 : if (nth_default < 0 || nth_default >= list_length(argdefaults))
3543 : {
3544 6 : ReleaseSysCache(proctup);
3545 6 : PG_RETURN_NULL();
3546 : }
3547 24 : node = list_nth(argdefaults, nth_default);
3548 24 : str = deparse_expression(node, NIL, false, false);
3549 :
3550 24 : ReleaseSysCache(proctup);
3551 :
3552 24 : PG_RETURN_TEXT_P(string_to_text(str));
3553 : }
3554 :
3555 : static void
3556 218 : print_function_sqlbody(StringInfo buf, HeapTuple proctup)
3557 : {
3558 : int numargs;
3559 : Oid *argtypes;
3560 : char **argnames;
3561 : char *argmodes;
3562 218 : deparse_namespace dpns = {0};
3563 : Datum tmp;
3564 : Node *n;
3565 :
3566 218 : dpns.funcname = pstrdup(NameStr(((Form_pg_proc) GETSTRUCT(proctup))->proname));
3567 218 : numargs = get_func_arg_info(proctup,
3568 : &argtypes, &argnames, &argmodes);
3569 218 : dpns.numargs = numargs;
3570 218 : dpns.argnames = argnames;
3571 :
3572 218 : tmp = SysCacheGetAttrNotNull(PROCOID, proctup, Anum_pg_proc_prosqlbody);
3573 218 : n = stringToNode(TextDatumGetCString(tmp));
3574 :
3575 218 : if (IsA(n, List))
3576 : {
3577 : List *stmts;
3578 : ListCell *lc;
3579 :
3580 172 : stmts = linitial(castNode(List, n));
3581 :
3582 172 : appendStringInfoString(buf, "BEGIN ATOMIC\n");
3583 :
3584 334 : foreach(lc, stmts)
3585 : {
3586 162 : Query *query = lfirst_node(Query, lc);
3587 :
3588 : /* It seems advisable to get at least AccessShareLock on rels */
3589 162 : AcquireRewriteLocks(query, false, false);
3590 162 : get_query_def(query, buf, list_make1(&dpns), NULL, false,
3591 : PRETTYFLAG_INDENT, WRAP_COLUMN_DEFAULT, 1);
3592 162 : appendStringInfoChar(buf, ';');
3593 162 : appendStringInfoChar(buf, '\n');
3594 : }
3595 :
3596 172 : appendStringInfoString(buf, "END");
3597 : }
3598 : else
3599 : {
3600 46 : Query *query = castNode(Query, n);
3601 :
3602 : /* It seems advisable to get at least AccessShareLock on rels */
3603 46 : AcquireRewriteLocks(query, false, false);
3604 46 : get_query_def(query, buf, list_make1(&dpns), NULL, false,
3605 : 0, WRAP_COLUMN_DEFAULT, 0);
3606 : }
3607 218 : }
3608 :
3609 : Datum
3610 3622 : pg_get_function_sqlbody(PG_FUNCTION_ARGS)
3611 : {
3612 3622 : Oid funcid = PG_GETARG_OID(0);
3613 : StringInfoData buf;
3614 : HeapTuple proctup;
3615 : bool isnull;
3616 :
3617 3622 : initStringInfo(&buf);
3618 :
3619 : /* Look up the function */
3620 3622 : proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
3621 3622 : if (!HeapTupleIsValid(proctup))
3622 0 : PG_RETURN_NULL();
3623 :
3624 3622 : (void) SysCacheGetAttr(PROCOID, proctup, Anum_pg_proc_prosqlbody, &isnull);
3625 3622 : if (isnull)
3626 : {
3627 3518 : ReleaseSysCache(proctup);
3628 3518 : PG_RETURN_NULL();
3629 : }
3630 :
3631 104 : print_function_sqlbody(&buf, proctup);
3632 :
3633 104 : ReleaseSysCache(proctup);
3634 :
3635 104 : 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 : */
3644 : char *
3645 70008 : deparse_expression(Node *expr, List *dpcontext,
3646 : bool forceprefix, bool showimplicit)
3647 : {
3648 70008 : 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 : */
3671 : static char *
3672 83132 : deparse_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 83132 : initStringInfo(&buf);
3680 83132 : context.buf = &buf;
3681 83132 : context.namespaces = dpcontext;
3682 83132 : context.resultDesc = NULL;
3683 83132 : context.targetList = NIL;
3684 83132 : context.windowClause = NIL;
3685 83132 : context.varprefix = forceprefix;
3686 83132 : context.prettyFlags = prettyFlags;
3687 83132 : context.wrapColumn = WRAP_COLUMN_DEFAULT;
3688 83132 : context.indentLevel = startIndent;
3689 83132 : context.colNamesVisible = true;
3690 83132 : context.inGroupBy = false;
3691 83132 : context.varInOrderBy = false;
3692 83132 : context.appendparents = NULL;
3693 :
3694 83132 : get_rule_expr(expr, &context, showimplicit);
3695 :
3696 83132 : 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 : */
3707 : List *
3708 23494 : deparse_context_for(const char *aliasname, Oid relid)
3709 : {
3710 : deparse_namespace *dpns;
3711 : RangeTblEntry *rte;
3712 :
3713 23494 : dpns = (deparse_namespace *) palloc0(sizeof(deparse_namespace));
3714 :
3715 : /* Build a minimal RTE for the rel */
3716 23494 : rte = makeNode(RangeTblEntry);
3717 23494 : rte->rtekind = RTE_RELATION;
3718 23494 : rte->relid = relid;
3719 23494 : rte->relkind = RELKIND_RELATION; /* no need for exactness here */
3720 23494 : rte->rellockmode = AccessShareLock;
3721 23494 : rte->alias = makeAlias(aliasname, NIL);
3722 23494 : rte->eref = rte->alias;
3723 23494 : rte->lateral = false;
3724 23494 : rte->inh = false;
3725 23494 : rte->inFromCl = true;
3726 :
3727 : /* Build one-element rtable */
3728 23494 : dpns->rtable = list_make1(rte);
3729 23494 : dpns->subplans = NIL;
3730 23494 : dpns->ctes = NIL;
3731 23494 : dpns->appendrels = NULL;
3732 23494 : set_rtable_names(dpns, NIL, NULL);
3733 23494 : set_simple_column_names(dpns);
3734 :
3735 : /* Return a one-deep namespace stack */
3736 23494 : 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 : */
3752 : List *
3753 23366 : deparse_context_for_plan_tree(PlannedStmt *pstmt, List *rtable_names)
3754 : {
3755 : deparse_namespace *dpns;
3756 :
3757 23366 : dpns = (deparse_namespace *) palloc0(sizeof(deparse_namespace));
3758 :
3759 : /* Initialize fields that stay the same across the whole plan tree */
3760 23366 : dpns->rtable = pstmt->rtable;
3761 23366 : dpns->rtable_names = rtable_names;
3762 23366 : dpns->subplans = pstmt->subplans;
3763 23366 : dpns->ctes = NIL;
3764 23366 : if (pstmt->appendRelations)
3765 : {
3766 : /* Set up the array, indexed by child relid */
3767 3790 : int ntables = list_length(dpns->rtable);
3768 : ListCell *lc;
3769 :
3770 3790 : dpns->appendrels = (AppendRelInfo **)
3771 3790 : palloc0((ntables + 1) * sizeof(AppendRelInfo *));
3772 20634 : foreach(lc, pstmt->appendRelations)
3773 : {
3774 16844 : AppendRelInfo *appinfo = lfirst_node(AppendRelInfo, lc);
3775 16844 : Index crelid = appinfo->child_relid;
3776 :
3777 : Assert(crelid > 0 && crelid <= ntables);
3778 : Assert(dpns->appendrels[crelid] == NULL);
3779 16844 : dpns->appendrels[crelid] = appinfo;
3780 : }
3781 : }
3782 : else
3783 19576 : 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 23366 : set_simple_column_names(dpns);
3790 :
3791 : /* Return a one-deep namespace stack */
3792 23366 : 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 : */
3824 : List *
3825 51946 : set_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 51946 : dpns = (deparse_namespace *) linitial(dpcontext);
3832 :
3833 : /* Set our attention on the specific plan node passed in */
3834 51946 : dpns->ancestors = ancestors;
3835 51946 : set_deparse_plan(dpns, plan);
3836 :
3837 : /* For ModifyTable, set aliases for OLD and NEW in RETURNING */
3838 51946 : if (IsA(plan, ModifyTable))
3839 : {
3840 192 : dpns->ret_old_alias = ((ModifyTable *) plan)->returningOldAlias;
3841 192 : dpns->ret_new_alias = ((ModifyTable *) plan)->returningNewAlias;
3842 : }
3843 :
3844 51946 : 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 : */
3854 : List *
3855 23366 : select_rtable_names_for_explain(List *rtable, Bitmapset *rels_used)
3856 : {
3857 : deparse_namespace dpns;
3858 :
3859 23366 : memset(&dpns, 0, sizeof(dpns));
3860 23366 : dpns.rtable = rtable;
3861 23366 : dpns.subplans = NIL;
3862 23366 : dpns.ctes = NIL;
3863 23366 : dpns.appendrels = NULL;
3864 23366 : set_rtable_names(&dpns, NIL, rels_used);
3865 : /* We needn't bother computing column aliases yet */
3866 :
3867 23366 : 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 : */
3883 : static void
3884 52944 : set_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 52944 : dpns->rtable_names = NIL;
3895 : /* nothing more to do if empty rtable */
3896 52944 : if (dpns->rtable == NIL)
3897 568 : 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 52376 : hash_ctl.keysize = NAMEDATALEN;
3904 52376 : hash_ctl.entrysize = sizeof(NameHashEntry);
3905 52376 : hash_ctl.hcxt = CurrentMemoryContext;
3906 52376 : names_hash = hash_create("set_rtable_names names",
3907 52376 : 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 54120 : foreach(lc, parent_namespaces)
3913 : {
3914 1744 : deparse_namespace *olddpns = (deparse_namespace *) lfirst(lc);
3915 : ListCell *lc2;
3916 :
3917 6306 : foreach(lc2, olddpns->rtable_names)
3918 : {
3919 4562 : char *oldname = (char *) lfirst(lc2);
3920 :
3921 4562 : if (oldname == NULL)
3922 336 : continue;
3923 4226 : 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 4226 : hentry->counter = 0;
3929 : }
3930 : }
3931 :
3932 : /* Now we can scan the rtable */
3933 52376 : rtindex = 1;
3934 150268 : foreach(lc, dpns->rtable)
3935 : {
3936 97892 : RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
3937 : char *refname;
3938 :
3939 : /* Just in case this takes an unreasonable amount of time ... */
3940 97892 : CHECK_FOR_INTERRUPTS();
3941 :
3942 97892 : if (rels_used && !bms_is_member(rtindex, rels_used))
3943 : {
3944 : /* Ignore unreferenced RTE */
3945 17570 : refname = NULL;
3946 : }
3947 80322 : else if (rte->alias)
3948 : {
3949 : /* If RTE has a user-defined alias, prefer that */
3950 54044 : refname = rte->alias->aliasname;
3951 : }
3952 26278 : else if (rte->rtekind == RTE_RELATION)
3953 : {
3954 : /* Use the current actual name of the relation */
3955 21684 : refname = get_rel_name(rte->relid);
3956 : }
3957 4594 : else if (rte->rtekind == RTE_JOIN)
3958 : {
3959 : /* Unnamed join has no refname */
3960 1836 : refname = NULL;
3961 : }
3962 : else
3963 : {
3964 : /* Otherwise use whatever the parser assigned */
3965 2758 : 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 97892 : if (refname)
3975 : {
3976 78486 : hentry = (NameHashEntry *) hash_search(names_hash,
3977 : refname,
3978 : HASH_ENTER,
3979 : &found);
3980 78486 : if (found)
3981 : {
3982 : /* Name already in use, must choose a new one */
3983 13838 : int refnamelen = strlen(refname);
3984 13838 : char *modname = (char *) palloc(refnamelen + 16);
3985 : NameHashEntry *hentry2;
3986 :
3987 : do
3988 : {
3989 13844 : hentry->counter++;
3990 : for (;;)
3991 : {
3992 13856 : memcpy(modname, refname, refnamelen);
3993 13856 : sprintf(modname + refnamelen, "_%d", hentry->counter);
3994 13856 : if (strlen(modname) < NAMEDATALEN)
3995 13844 : break;
3996 : /* drop chars from refname to keep all the digits */
3997 12 : refnamelen = pg_mbcliplen(refname, refnamelen,
3998 : refnamelen - 1);
3999 : }
4000 13844 : hentry2 = (NameHashEntry *) hash_search(names_hash,
4001 : modname,
4002 : HASH_ENTER,
4003 : &found);
4004 13844 : } while (found);
4005 13838 : hentry2->counter = 0; /* init new hash entry */
4006 13838 : refname = modname;
4007 : }
4008 : else
4009 : {
4010 : /* Name not previously used, need only initialize hentry */
4011 64648 : hentry->counter = 0;
4012 : }
4013 : }
4014 :
4015 97892 : dpns->rtable_names = lappend(dpns->rtable_names, refname);
4016 97892 : rtindex++;
4017 : }
4018 :
4019 52376 : 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 : */
4028 : static void
4029 5924 : set_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 5924 : memset(dpns, 0, sizeof(deparse_namespace));
4037 5924 : dpns->rtable = query->rtable;
4038 5924 : dpns->subplans = NIL;
4039 5924 : dpns->ctes = query->cteList;
4040 5924 : dpns->appendrels = NULL;
4041 5924 : dpns->ret_old_alias = query->returningOldAlias;
4042 5924 : dpns->ret_new_alias = query->returningNewAlias;
4043 :
4044 : /* Assign a unique relation alias to each RTE */
4045 5924 : set_rtable_names(dpns, parent_namespaces, NULL);
4046 :
4047 : /* Initialize dpns->rtable_columns to contain zeroed structs */
4048 5924 : dpns->rtable_columns = NIL;
4049 16508 : while (list_length(dpns->rtable_columns) < list_length(dpns->rtable))
4050 10584 : 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 5924 : if (query->jointree)
4055 : {
4056 : /* Detect whether global uniqueness of USING names is needed */
4057 5908 : dpns->unique_using =
4058 5908 : 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 5908 : 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 16508 : forboth(lc, dpns->rtable, lc2, dpns->rtable_columns)
4076 : {
4077 10584 : RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
4078 10584 : deparse_columns *colinfo = (deparse_columns *) lfirst(lc2);
4079 :
4080 10584 : if (rte->rtekind == RTE_JOIN)
4081 1498 : set_join_column_names(dpns, rte, colinfo);
4082 : else
4083 9086 : set_relation_column_names(dpns, rte, colinfo);
4084 : }
4085 5924 : }
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 : */
4097 : static void
4098 47020 : set_simple_column_names(deparse_namespace *dpns)
4099 : {
4100 : ListCell *lc;
4101 : ListCell *lc2;
4102 :
4103 : /* Initialize dpns->rtable_columns to contain zeroed structs */
4104 47020 : dpns->rtable_columns = NIL;
4105 134328 : while (list_length(dpns->rtable_columns) < list_length(dpns->rtable))
4106 87308 : dpns->rtable_columns = lappend(dpns->rtable_columns,
4107 : palloc0(sizeof(deparse_columns)));
4108 :
4109 : /* Assign unique column aliases within each non-join RTE */
4110 134328 : forboth(lc, dpns->rtable, lc2, dpns->rtable_columns)
4111 : {
4112 87308 : RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
4113 87308 : deparse_columns *colinfo = (deparse_columns *) lfirst(lc2);
4114 :
4115 87308 : if (rte->rtekind != RTE_JOIN)
4116 81720 : set_relation_column_names(dpns, rte, colinfo);
4117 : }
4118 47020 : }
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 : */
4139 : static bool
4140 13954 : has_dangerous_join_using(deparse_namespace *dpns, Node *jtnode)
4141 : {
4142 13954 : if (IsA(jtnode, RangeTblRef))
4143 : {
4144 : /* nothing to do here */
4145 : }
4146 7340 : else if (IsA(jtnode, FromExpr))
4147 : {
4148 5908 : FromExpr *f = (FromExpr *) jtnode;
4149 : ListCell *lc;
4150 :
4151 11162 : foreach(lc, f->fromlist)
4152 : {
4153 5326 : if (has_dangerous_join_using(dpns, (Node *) lfirst(lc)))
4154 72 : return true;
4155 : }
4156 : }
4157 1432 : else if (IsA(jtnode, JoinExpr))
4158 : {
4159 1432 : JoinExpr *j = (JoinExpr *) jtnode;
4160 :
4161 : /* Is it an unnamed JOIN with USING? */
4162 1432 : 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 286 : RangeTblEntry *jrte = rt_fetch(j->rtindex, dpns->rtable);
4170 :
4171 : /* We need only examine the merged columns */
4172 596 : for (int i = 0; i < jrte->joinmergedcols; i++)
4173 : {
4174 382 : Node *aliasvar = list_nth(jrte->joinaliasvars, i);
4175 :
4176 382 : if (!IsA(aliasvar, Var))
4177 72 : return true;
4178 : }
4179 : }
4180 :
4181 : /* Nope, but inspect children */
4182 1360 : if (has_dangerous_join_using(dpns, j->larg))
4183 0 : return true;
4184 1360 : if (has_dangerous_join_using(dpns, j->rarg))
4185 0 : return true;
4186 : }
4187 : else
4188 0 : elog(ERROR, "unrecognized node type: %d",
4189 : (int) nodeTag(jtnode));
4190 13810 : 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 : */
4209 : static void
4210 14272 : set_using_names(deparse_namespace *dpns, Node *jtnode, List *parentUsing)
4211 : {
4212 14272 : if (IsA(jtnode, RangeTblRef))
4213 : {
4214 : /* nothing to do now */
4215 : }
4216 7406 : else if (IsA(jtnode, FromExpr))
4217 : {
4218 5908 : FromExpr *f = (FromExpr *) jtnode;
4219 : ListCell *lc;
4220 :
4221 11276 : foreach(lc, f->fromlist)
4222 5368 : set_using_names(dpns, (Node *) lfirst(lc), parentUsing);
4223 : }
4224 1498 : else if (IsA(jtnode, JoinExpr))
4225 : {
4226 1498 : JoinExpr *j = (JoinExpr *) jtnode;
4227 1498 : RangeTblEntry *rte = rt_fetch(j->rtindex, dpns->rtable);
4228 1498 : 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 1498 : identify_join_columns(j, rte, colinfo);
4238 1498 : leftattnos = colinfo->leftattnos;
4239 1498 : rightattnos = colinfo->rightattnos;
4240 :
4241 : /* Look up the not-yet-filled-in child deparse_columns structs */
4242 1498 : leftcolinfo = deparse_columns_fetch(colinfo->leftrti, dpns);
4243 1498 : 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 1498 : if (rte->alias == NULL)
4251 : {
4252 1528 : for (i = 0; i < colinfo->num_cols; i++)
4253 : {
4254 138 : char *colname = colinfo->colnames[i];
4255 :
4256 138 : if (colname == NULL)
4257 24 : continue;
4258 :
4259 : /* Push down to left column, unless it's a system column */
4260 114 : if (leftattnos[i] > 0)
4261 : {
4262 102 : expand_colnames_array_to(leftcolinfo, leftattnos[i]);
4263 102 : leftcolinfo->colnames[leftattnos[i] - 1] = colname;
4264 : }
4265 :
4266 : /* Same on the righthand side */
4267 114 : if (rightattnos[i] > 0)
4268 : {
4269 114 : expand_colnames_array_to(rightcolinfo, rightattnos[i]);
4270 114 : 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 1498 : if (j->usingClause)
4301 : {
4302 : /* Copy the input parentUsing list so we don't modify it */
4303 424 : parentUsing = list_copy(parentUsing);
4304 :
4305 : /* USING names must correspond to the first join output columns */
4306 424 : expand_colnames_array_to(colinfo, list_length(j->usingClause));
4307 424 : i = 0;
4308 1004 : foreach(lc, j->usingClause)
4309 : {
4310 580 : 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 580 : if (colinfo->colnames[i] != NULL)
4317 102 : colname = colinfo->colnames[i];
4318 : else
4319 : {
4320 : /* Prefer user-written output alias if any */
4321 478 : if (rte->alias && i < list_length(rte->alias->colnames))
4322 0 : colname = strVal(list_nth(rte->alias->colnames, i));
4323 : /* Make it appropriately unique */
4324 478 : colname = make_colname_unique(colname, dpns, colinfo);
4325 478 : if (dpns->unique_using)
4326 126 : dpns->using_names = lappend(dpns->using_names,
4327 : colname);
4328 : /* Save it as output column name, too */
4329 478 : colinfo->colnames[i] = colname;
4330 : }
4331 :
4332 : /* Remember selected names for use later */
4333 580 : colinfo->usingNames = lappend(colinfo->usingNames, colname);
4334 580 : parentUsing = lappend(parentUsing, colname);
4335 :
4336 : /* Push down to left column, unless it's a system column */
4337 580 : if (leftattnos[i] > 0)
4338 : {
4339 580 : expand_colnames_array_to(leftcolinfo, leftattnos[i]);
4340 580 : leftcolinfo->colnames[leftattnos[i] - 1] = colname;
4341 : }
4342 :
4343 : /* Same on the righthand side */
4344 580 : if (rightattnos[i] > 0)
4345 : {
4346 580 : expand_colnames_array_to(rightcolinfo, rightattnos[i]);
4347 580 : rightcolinfo->colnames[rightattnos[i] - 1] = colname;
4348 : }
4349 :
4350 580 : i++;
4351 : }
4352 : }
4353 :
4354 : /* Mark child deparse_columns structs with correct parentUsing info */
4355 1498 : leftcolinfo->parentUsing = parentUsing;
4356 1498 : rightcolinfo->parentUsing = parentUsing;
4357 :
4358 : /* Now recursively assign USING column names in children */
4359 1498 : set_using_names(dpns, j->larg, parentUsing);
4360 1498 : set_using_names(dpns, j->rarg, parentUsing);
4361 : }
4362 : else
4363 0 : elog(ERROR, "unrecognized node type: %d",
4364 : (int) nodeTag(jtnode));
4365 14272 : }
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 : */
4374 : static void
4375 90806 : set_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 90806 : 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 77506 : rel = relation_open(rte->relid, AccessShareLock);
4397 77506 : tupdesc = RelationGetDescr(rel);
4398 :
4399 77506 : ncolumns = tupdesc->natts;
4400 77506 : real_colnames = (char **) palloc(ncolumns * sizeof(char *));
4401 :
4402 496170 : for (i = 0; i < ncolumns; i++)
4403 : {
4404 418664 : Form_pg_attribute attr = TupleDescAttr(tupdesc, i);
4405 :
4406 418664 : if (attr->attisdropped)
4407 3190 : real_colnames[i] = NULL;
4408 : else
4409 415474 : real_colnames[i] = pstrdup(NameStr(attr->attname));
4410 : }
4411 77506 : 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 13300 : if (rte->rtekind == RTE_FUNCTION && rte->functions != NIL)
4435 : {
4436 : /* Since we're not creating Vars, rtindex etc. don't matter */
4437 810 : expandRTE(rte, 1, 0, VAR_RETURNING_DEFAULT, -1,
4438 : true /* include dropped */ , &colnames, NULL);
4439 : }
4440 : else
4441 12490 : colnames = rte->eref->colnames;
4442 :
4443 13300 : ncolumns = list_length(colnames);
4444 13300 : real_colnames = (char **) palloc(ncolumns * sizeof(char *));
4445 :
4446 13300 : i = 0;
4447 44406 : 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 31106 : char *cname = strVal(lfirst(lc));
4454 :
4455 31106 : if (cname[0] == '\0')
4456 54 : cname = NULL;
4457 31106 : real_colnames[i] = cname;
4458 31106 : 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 90806 : 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 90806 : colinfo->new_colnames = (char **) palloc(ncolumns * sizeof(char *));
4481 90806 : 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 90806 : 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 90806 : noldcolumns = list_length(rte->eref->colnames);
4494 90806 : changed_any = false;
4495 90806 : j = 0;
4496 540576 : for (i = 0; i < ncolumns; i++)
4497 : {
4498 449770 : char *real_colname = real_colnames[i];
4499 449770 : char *colname = colinfo->colnames[i];
4500 :
4501 : /* Skip dropped columns */
4502 449770 : if (real_colname == NULL)
4503 : {
4504 : Assert(colname == NULL); /* colnames[i] is already NULL */
4505 3244 : continue;
4506 : }
4507 :
4508 : /* If alias already assigned, that's what to use */
4509 446526 : if (colname == NULL)
4510 : {
4511 : /* If user wrote an alias, prefer that over real column name */
4512 445468 : if (rte->alias && i < list_length(rte->alias->colnames))
4513 42772 : colname = strVal(list_nth(rte->alias->colnames, i));
4514 : else
4515 402696 : colname = real_colname;
4516 :
4517 : /* Unique-ify and insert into colinfo */
4518 445468 : colname = make_colname_unique(colname, dpns, colinfo);
4519 :
4520 445468 : colinfo->colnames[i] = colname;
4521 445468 : add_to_names_hash(colinfo, colname);
4522 : }
4523 :
4524 : /* Put names of non-dropped columns in new_colnames[] too */
4525 446526 : colinfo->new_colnames[j] = colname;
4526 : /* And mark them as new or not */
4527 446526 : colinfo->is_new_col[j] = (i >= noldcolumns);
4528 446526 : j++;
4529 :
4530 : /* Remember if any assigned aliases differ from "real" name */
4531 446526 : if (!changed_any && strcmp(colname, real_colname) != 0)
4532 1162 : changed_any = true;
4533 : }
4534 :
4535 : /* We're now done needing the colinfo's names_hash */
4536 90806 : 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 90806 : 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 90806 : if (rte->rtekind == RTE_RELATION)
4557 77506 : colinfo->printaliases = changed_any;
4558 13300 : else if (rte->rtekind == RTE_FUNCTION)
4559 1388 : colinfo->printaliases = true;
4560 11912 : else if (rte->rtekind == RTE_TABLEFUNC)
4561 176 : colinfo->printaliases = false;
4562 11736 : else if (rte->alias && rte->alias->colnames != NIL)
4563 792 : colinfo->printaliases = true;
4564 : else
4565 10944 : colinfo->printaliases = changed_any;
4566 90806 : }
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 : */
4577 : static void
4578 1498 : set_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 1498 : Bitmapset *leftmerged = NULL;
4587 1498 : 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 1498 : leftcolinfo = deparse_columns_fetch(colinfo->leftrti, dpns);
4595 1498 : 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 1498 : noldcolumns = list_length(rte->eref->colnames);
4605 1498 : 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 1498 : 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 1498 : changed_any = false;
4618 49756 : for (i = list_length(colinfo->usingNames); i < noldcolumns; i++)
4619 : {
4620 48258 : 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 48258 : if (colinfo->leftattnos[i] > 0)
4628 33994 : real_colname = leftcolinfo->colnames[colinfo->leftattnos[i] - 1];
4629 14264 : else if (colinfo->rightattnos[i] > 0)
4630 14264 : real_colname = rightcolinfo->colnames[colinfo->rightattnos[i] - 1];
4631 : else
4632 : {
4633 : /* We're joining system columns --- use eref name */
4634 0 : 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 48258 : if (real_colname == NULL)
4639 : {
4640 6 : colinfo->colnames[i] = NULL;
4641 6 : continue;
4642 : }
4643 :
4644 : /* In an unnamed join, just report child column names as-is */
4645 48252 : if (rte->alias == NULL)
4646 : {
4647 47874 : colinfo->colnames[i] = real_colname;
4648 47874 : add_to_names_hash(colinfo, real_colname);
4649 47874 : continue;
4650 : }
4651 :
4652 : /* If alias already assigned, that's what to use */
4653 378 : if (colname == NULL)
4654 : {
4655 : /* If user wrote an alias, prefer that over real column name */
4656 378 : if (rte->alias && i < list_length(rte->alias->colnames))
4657 96 : colname = strVal(list_nth(rte->alias->colnames, i));
4658 : else
4659 282 : colname = real_colname;
4660 :
4661 : /* Unique-ify and insert into colinfo */
4662 378 : colname = make_colname_unique(colname, dpns, colinfo);
4663 :
4664 378 : colinfo->colnames[i] = colname;
4665 378 : add_to_names_hash(colinfo, colname);
4666 : }
4667 :
4668 : /* Remember if any assigned aliases differ from "real" name */
4669 378 : if (!changed_any && strcmp(colname, real_colname) != 0)
4670 24 : 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 2996 : nnewcolumns = leftcolinfo->num_new_cols + rightcolinfo->num_new_cols -
4681 1498 : list_length(colinfo->usingNames);
4682 1498 : colinfo->num_new_cols = nnewcolumns;
4683 1498 : colinfo->new_colnames = (char **) palloc0(nnewcolumns * sizeof(char *));
4684 1498 : 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 1498 : i = j = 0;
4704 2078 : while (i < noldcolumns &&
4705 2078 : colinfo->leftattnos[i] != 0 &&
4706 2078 : colinfo->rightattnos[i] != 0)
4707 : {
4708 : /* column name is already determined and known unique */
4709 580 : colinfo->new_colnames[j] = colinfo->colnames[i];
4710 580 : colinfo->is_new_col[j] = false;
4711 :
4712 : /* build bitmapsets of child attnums of merged columns */
4713 580 : if (colinfo->leftattnos[i] > 0)
4714 580 : leftmerged = bms_add_member(leftmerged, colinfo->leftattnos[i]);
4715 580 : if (colinfo->rightattnos[i] > 0)
4716 580 : rightmerged = bms_add_member(rightmerged, colinfo->rightattnos[i]);
4717 :
4718 580 : i++, j++;
4719 : }
4720 :
4721 : /* Handle non-merged left-child columns */
4722 1498 : ic = 0;
4723 36558 : for (jc = 0; jc < leftcolinfo->num_new_cols; jc++)
4724 : {
4725 35060 : char *child_colname = leftcolinfo->new_colnames[jc];
4726 :
4727 35060 : if (!leftcolinfo->is_new_col[jc])
4728 : {
4729 : /* Advance ic to next non-dropped old column of left child */
4730 34652 : while (ic < leftcolinfo->num_cols &&
4731 34652 : leftcolinfo->colnames[ic] == NULL)
4732 84 : ic++;
4733 : Assert(ic < leftcolinfo->num_cols);
4734 34568 : ic++;
4735 : /* If it is a merged column, we already processed it */
4736 34568 : if (bms_is_member(ic, leftmerged))
4737 580 : continue;
4738 : /* Else, advance i to the corresponding existing join column */
4739 33994 : while (i < colinfo->num_cols &&
4740 33994 : colinfo->colnames[i] == NULL)
4741 6 : i++;
4742 : Assert(i < colinfo->num_cols);
4743 : Assert(ic == colinfo->leftattnos[i]);
4744 : /* Use the already-assigned name of this column */
4745 33988 : colinfo->new_colnames[j] = colinfo->colnames[i];
4746 33988 : 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 492 : if (rte->alias != NULL)
4755 : {
4756 264 : colinfo->new_colnames[j] =
4757 132 : make_colname_unique(child_colname, dpns, colinfo);
4758 132 : if (!changed_any &&
4759 108 : strcmp(colinfo->new_colnames[j], child_colname) != 0)
4760 12 : changed_any = true;
4761 : }
4762 : else
4763 360 : colinfo->new_colnames[j] = child_colname;
4764 492 : add_to_names_hash(colinfo, colinfo->new_colnames[j]);
4765 : }
4766 :
4767 34480 : colinfo->is_new_col[j] = leftcolinfo->is_new_col[jc];
4768 34480 : j++;
4769 : }
4770 :
4771 : /* Handle non-merged right-child columns in exactly the same way */
4772 1498 : ic = 0;
4773 16510 : for (jc = 0; jc < rightcolinfo->num_new_cols; jc++)
4774 : {
4775 15012 : char *child_colname = rightcolinfo->new_colnames[jc];
4776 :
4777 15012 : if (!rightcolinfo->is_new_col[jc])
4778 : {
4779 : /* Advance ic to next non-dropped old column of right child */
4780 14844 : while (ic < rightcolinfo->num_cols &&
4781 14844 : rightcolinfo->colnames[ic] == NULL)
4782 0 : ic++;
4783 : Assert(ic < rightcolinfo->num_cols);
4784 14844 : ic++;
4785 : /* If it is a merged column, we already processed it */
4786 14844 : if (bms_is_member(ic, rightmerged))
4787 580 : continue;
4788 : /* Else, advance i to the corresponding existing join column */
4789 14264 : while (i < colinfo->num_cols &&
4790 14264 : colinfo->colnames[i] == NULL)
4791 0 : i++;
4792 : Assert(i < colinfo->num_cols);
4793 : Assert(ic == colinfo->rightattnos[i]);
4794 : /* Use the already-assigned name of this column */
4795 14264 : colinfo->new_colnames[j] = colinfo->colnames[i];
4796 14264 : 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 168 : if (rte->alias != NULL)
4805 : {
4806 48 : colinfo->new_colnames[j] =
4807 24 : make_colname_unique(child_colname, dpns, colinfo);
4808 24 : if (!changed_any &&
4809 24 : strcmp(colinfo->new_colnames[j], child_colname) != 0)
4810 12 : changed_any = true;
4811 : }
4812 : else
4813 144 : colinfo->new_colnames[j] = child_colname;
4814 168 : add_to_names_hash(colinfo, colinfo->new_colnames[j]);
4815 : }
4816 :
4817 14432 : colinfo->is_new_col[j] = rightcolinfo->is_new_col[jc];
4818 14432 : 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 1498 : 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 1498 : if (rte->alias != NULL)
4837 108 : colinfo->printaliases = changed_any;
4838 : else
4839 1390 : colinfo->printaliases = false;
4840 1498 : }
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 : */
4847 : static bool
4848 448830 : colname_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 448830 : if (colinfo->names_hash)
4859 : {
4860 18122 : if (hash_search(colinfo->names_hash,
4861 : colname,
4862 : HASH_FIND,
4863 : NULL) != NULL)
4864 0 : return false;
4865 : }
4866 : else
4867 : {
4868 : /* Check against already-assigned column aliases within RTE */
4869 5962766 : for (i = 0; i < colinfo->num_cols; i++)
4870 : {
4871 5534336 : char *oldname = colinfo->colnames[i];
4872 :
4873 5534336 : if (oldname && strcmp(oldname, colname) == 0)
4874 2278 : 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 429702 : for (i = 0; i < colinfo->num_new_cols; i++)
4882 : {
4883 1296 : char *oldname = colinfo->new_colnames[i];
4884 :
4885 1296 : if (oldname && strcmp(oldname, colname) == 0)
4886 24 : return false;
4887 : }
4888 :
4889 : /*
4890 : * Also check against names already assigned for parent-join USING
4891 : * cols
4892 : */
4893 430998 : foreach(lc, colinfo->parentUsing)
4894 : {
4895 2598 : char *oldname = (char *) lfirst(lc);
4896 :
4897 2598 : if (strcmp(oldname, colname) == 0)
4898 6 : 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 447362 : foreach(lc, dpns->using_names)
4907 : {
4908 882 : char *oldname = (char *) lfirst(lc);
4909 :
4910 882 : if (strcmp(oldname, colname) == 0)
4911 42 : return false;
4912 : }
4913 :
4914 446480 : 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 : */
4922 : static char *
4923 446480 : make_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 446480 : if (!colname_is_unique(colname, dpns, colinfo))
4932 : {
4933 1626 : int colnamelen = strlen(colname);
4934 1626 : char *modname = (char *) palloc(colnamelen + 16);
4935 1626 : int i = 0;
4936 :
4937 : do
4938 : {
4939 2350 : i++;
4940 : for (;;)
4941 : {
4942 2350 : memcpy(modname, colname, colnamelen);
4943 2350 : sprintf(modname + colnamelen, "_%d", i);
4944 2350 : if (strlen(modname) < NAMEDATALEN)
4945 2350 : break;
4946 : /* drop chars from colname to keep all the digits */
4947 0 : colnamelen = pg_mbcliplen(colname, colnamelen,
4948 : colnamelen - 1);
4949 : }
4950 2350 : } while (!colname_is_unique(modname, dpns, colinfo));
4951 1626 : colname = modname;
4952 : }
4953 446480 : 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 : */
4961 : static void
4962 94104 : expand_colnames_array_to(deparse_columns *colinfo, int n)
4963 : {
4964 94104 : if (n > colinfo->num_cols)
4965 : {
4966 91610 : if (colinfo->colnames == NULL)
4967 90194 : colinfo->colnames = palloc0_array(char *, n);
4968 : else
4969 1416 : colinfo->colnames = repalloc0_array(colinfo->colnames, char *, colinfo->num_cols, n);
4970 91610 : colinfo->num_cols = n;
4971 : }
4972 94104 : }
4973 :
4974 : /*
4975 : * build_colinfo_names_hash: optionally construct a hash table for colinfo
4976 : */
4977 : static void
4978 92304 : build_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 92304 : if (colinfo->num_cols < 32)
4990 90972 : return;
4991 :
4992 : /*
4993 : * Set up the hash table. The entries are just strings with no other
4994 : * payload.
4995 : */
4996 1332 : hash_ctl.keysize = NAMEDATALEN;
4997 1332 : hash_ctl.entrysize = NAMEDATALEN;
4998 1332 : hash_ctl.hcxt = CurrentMemoryContext;
4999 2664 : colinfo->names_hash = hash_create("deparse_columns names",
5000 1332 : 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 62630 : for (i = 0; i < colinfo->num_cols; i++)
5009 : {
5010 61298 : char *oldname = colinfo->colnames[i];
5011 :
5012 61298 : if (oldname)
5013 0 : add_to_names_hash(colinfo, oldname);
5014 : }
5015 :
5016 1332 : for (i = 0; i < colinfo->num_new_cols; i++)
5017 : {
5018 0 : char *oldname = colinfo->new_colnames[i];
5019 :
5020 0 : if (oldname)
5021 0 : add_to_names_hash(colinfo, oldname);
5022 : }
5023 :
5024 1332 : foreach(lc, colinfo->parentUsing)
5025 : {
5026 0 : char *oldname = (char *) lfirst(lc);
5027 :
5028 0 : 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 : */
5035 : static void
5036 494380 : add_to_names_hash(deparse_columns *colinfo, const char *name)
5037 : {
5038 494380 : if (colinfo->names_hash)
5039 61298 : (void) hash_search(colinfo->names_hash,
5040 : name,
5041 : HASH_ENTER,
5042 : NULL);
5043 494380 : }
5044 :
5045 : /*
5046 : * destroy_colinfo_names_hash: destroy hash table when done with it
5047 : */
5048 : static void
5049 92304 : destroy_colinfo_names_hash(deparse_columns *colinfo)
5050 : {
5051 92304 : if (colinfo->names_hash)
5052 : {
5053 1332 : hash_destroy(colinfo->names_hash);
5054 1332 : colinfo->names_hash = NULL;
5055 : }
5056 92304 : }
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 : */
5064 : static void
5065 1498 : identify_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 1498 : if (IsA(j->larg, RangeTblRef))
5075 952 : colinfo->leftrti = ((RangeTblRef *) j->larg)->rtindex;
5076 546 : else if (IsA(j->larg, JoinExpr))
5077 546 : colinfo->leftrti = ((JoinExpr *) j->larg)->rtindex;
5078 : else
5079 0 : elog(ERROR, "unrecognized node type in jointree: %d",
5080 : (int) nodeTag(j->larg));
5081 1498 : if (IsA(j->rarg, RangeTblRef))
5082 1498 : colinfo->rightrti = ((RangeTblRef *) j->rarg)->rtindex;
5083 0 : else if (IsA(j->rarg, JoinExpr))
5084 0 : colinfo->rightrti = ((JoinExpr *) j->rarg)->rtindex;
5085 : else
5086 0 : 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 1498 : numjoincols = list_length(jrte->joinaliasvars);
5095 : Assert(numjoincols == list_length(jrte->eref->colnames));
5096 1498 : colinfo->leftattnos = (int *) palloc0(numjoincols * sizeof(int));
5097 1498 : 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 1498 : jcolno = 0;
5107 36072 : foreach(lc, jrte->joinleftcols)
5108 : {
5109 34574 : int leftattno = lfirst_int(lc);
5110 :
5111 34574 : colinfo->leftattnos[jcolno++] = leftattno;
5112 : }
5113 1498 : rcolno = 0;
5114 16342 : foreach(lc, jrte->joinrightcols)
5115 : {
5116 14844 : int rightattno = lfirst_int(lc);
5117 :
5118 14844 : if (rcolno < jrte->joinmergedcols) /* merged column? */
5119 580 : colinfo->rightattnos[rcolno] = rightattno;
5120 : else
5121 14264 : colinfo->rightattnos[jcolno++] = rightattno;
5122 14844 : rcolno++;
5123 : }
5124 : Assert(jcolno == numjoincols);
5125 1498 : }
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 : */
5132 : static char *
5133 6712 : get_rtable_name(int rtindex, deparse_context *context)
5134 : {
5135 6712 : deparse_namespace *dpns = (deparse_namespace *) linitial(context->namespaces);
5136 :
5137 : Assert(rtindex > 0 && rtindex <= list_length(dpns->rtable_names));
5138 6712 : 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 : */
5151 : static void
5152 123268 : set_deparse_plan(deparse_namespace *dpns, Plan *plan)
5153 : {
5154 123268 : 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 123268 : if (IsA(plan, Append))
5163 4046 : dpns->outer_plan = linitial(((Append *) plan)->appendplans);
5164 119222 : else if (IsA(plan, MergeAppend))
5165 498 : dpns->outer_plan = linitial(((MergeAppend *) plan)->mergeplans);
5166 : else
5167 118724 : dpns->outer_plan = outerPlan(plan);
5168 :
5169 123268 : if (dpns->outer_plan)
5170 56046 : dpns->outer_tlist = dpns->outer_plan->targetlist;
5171 : else
5172 67222 : 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 123268 : if (IsA(plan, SubqueryScan))
5192 644 : dpns->inner_plan = ((SubqueryScan *) plan)->subplan;
5193 122624 : else if (IsA(plan, CteScan))
5194 552 : dpns->inner_plan = list_nth(dpns->subplans,
5195 552 : ((CteScan *) plan)->ctePlanId - 1);
5196 122072 : else if (IsA(plan, WorkTableScan))
5197 174 : dpns->inner_plan = find_recursive_union(dpns,
5198 : (WorkTableScan *) plan);
5199 121898 : else if (IsA(plan, ModifyTable))
5200 : {
5201 384 : if (((ModifyTable *) plan)->operation == CMD_MERGE)
5202 60 : dpns->inner_plan = outerPlan(plan);
5203 : else
5204 324 : dpns->inner_plan = plan;
5205 : }
5206 : else
5207 121514 : dpns->inner_plan = innerPlan(plan);
5208 :
5209 123268 : if (IsA(plan, ModifyTable) && ((ModifyTable *) plan)->operation == CMD_INSERT)
5210 170 : dpns->inner_tlist = ((ModifyTable *) plan)->exclRelTlist;
5211 123098 : else if (dpns->inner_plan)
5212 20560 : dpns->inner_tlist = dpns->inner_plan->targetlist;
5213 : else
5214 102538 : dpns->inner_tlist = NIL;
5215 :
5216 : /* Set up referent for INDEX_VAR Vars, if needed */
5217 123268 : if (IsA(plan, IndexOnlyScan))
5218 3046 : dpns->index_tlist = ((IndexOnlyScan *) plan)->indextlist;
5219 120222 : else if (IsA(plan, ForeignScan))
5220 2840 : dpns->index_tlist = ((ForeignScan *) plan)->fdw_scan_tlist;
5221 117382 : else if (IsA(plan, CustomScan))
5222 0 : dpns->index_tlist = ((CustomScan *) plan)->custom_scan_tlist;
5223 : else
5224 117382 : dpns->index_tlist = NIL;
5225 123268 : }
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 : */
5232 : static Plan *
5233 174 : find_recursive_union(deparse_namespace *dpns, WorkTableScan *wtscan)
5234 : {
5235 : ListCell *lc;
5236 :
5237 438 : foreach(lc, dpns->ancestors)
5238 : {
5239 438 : Plan *ancestor = (Plan *) lfirst(lc);
5240 :
5241 438 : if (IsA(ancestor, RecursiveUnion) &&
5242 174 : ((RecursiveUnion *) ancestor)->wtParam == wtscan->wtParam)
5243 174 : return ancestor;
5244 : }
5245 0 : 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 : */
5262 : static void
5263 67096 : push_child_plan(deparse_namespace *dpns, Plan *plan,
5264 : deparse_namespace *save_dpns)
5265 : {
5266 : /* Save state for restoration later */
5267 67096 : *save_dpns = *dpns;
5268 :
5269 : /* Link current plan node into ancestors list */
5270 67096 : dpns->ancestors = lcons(dpns->plan, dpns->ancestors);
5271 :
5272 : /* Set attention on selected child */
5273 67096 : set_deparse_plan(dpns, plan);
5274 67096 : }
5275 :
5276 : /*
5277 : * pop_child_plan: undo the effects of push_child_plan
5278 : */
5279 : static void
5280 67096 : pop_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 67096 : ancestors = list_delete_first(dpns->ancestors);
5286 :
5287 : /* Restore fields changed by push_child_plan */
5288 67096 : *dpns = *save_dpns;
5289 :
5290 : /* Make sure dpns->ancestors is right (may be unnecessary) */
5291 67096 : dpns->ancestors = ancestors;
5292 67096 : }
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 : */
5309 : static void
5310 4226 : push_ancestor_plan(deparse_namespace *dpns, ListCell *ancestor_cell,
5311 : deparse_namespace *save_dpns)
5312 : {
5313 4226 : Plan *plan = (Plan *) lfirst(ancestor_cell);
5314 :
5315 : /* Save state for restoration later */
5316 4226 : *save_dpns = *dpns;
5317 :
5318 : /* Build a new ancestor list with just this node's ancestors */
5319 4226 : dpns->ancestors =
5320 4226 : list_copy_tail(dpns->ancestors,
5321 4226 : list_cell_number(dpns->ancestors, ancestor_cell) + 1);
5322 :
5323 : /* Set attention on selected ancestor */
5324 4226 : set_deparse_plan(dpns, plan);
5325 4226 : }
5326 :
5327 : /*
5328 : * pop_ancestor_plan: undo the effects of push_ancestor_plan
5329 : */
5330 : static void
5331 4226 : pop_ancestor_plan(deparse_namespace *dpns, deparse_namespace *save_dpns)
5332 : {
5333 : /* Free the ancestor list made in push_ancestor_plan */
5334 4226 : list_free(dpns->ancestors);
5335 :
5336 : /* Restore fields changed by push_ancestor_plan */
5337 4226 : *dpns = *save_dpns;
5338 4226 : }
5339 :
5340 :
5341 : /* ----------
5342 : * make_ruledef - reconstruct the CREATE RULE command
5343 : * for a given pg_rewrite tuple
5344 : * ----------
5345 : */
5346 : static void
5347 558 : make_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 558 : 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 558 : fno = SPI_fnumber(rulettc, "rulename");
5367 558 : dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5368 : Assert(!isnull);
5369 558 : rulename = NameStr(*(DatumGetName(dat)));
5370 :
5371 558 : fno = SPI_fnumber(rulettc, "ev_type");
5372 558 : dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5373 : Assert(!isnull);
5374 558 : ev_type = DatumGetChar(dat);
5375 :
5376 558 : fno = SPI_fnumber(rulettc, "ev_class");
5377 558 : dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5378 : Assert(!isnull);
5379 558 : ev_class = DatumGetObjectId(dat);
5380 :
5381 558 : fno = SPI_fnumber(rulettc, "is_instead");
5382 558 : dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5383 : Assert(!isnull);
5384 558 : is_instead = DatumGetBool(dat);
5385 :
5386 558 : fno = SPI_fnumber(rulettc, "ev_qual");
5387 558 : ev_qual = SPI_getvalue(ruletup, rulettc, fno);
5388 : Assert(ev_qual != NULL);
5389 :
5390 558 : fno = SPI_fnumber(rulettc, "ev_action");
5391 558 : ev_action = SPI_getvalue(ruletup, rulettc, fno);
5392 : Assert(ev_action != NULL);
5393 558 : actions = (List *) stringToNode(ev_action);
5394 558 : if (actions == NIL)
5395 0 : elog(ERROR, "invalid empty ev_action list");
5396 :
5397 558 : ev_relation = table_open(ev_class, AccessShareLock);
5398 :
5399 : /*
5400 : * Build the rules definition text
5401 : */
5402 558 : appendStringInfo(buf, "CREATE RULE %s AS",
5403 : quote_identifier(rulename));
5404 :
5405 558 : if (prettyFlags & PRETTYFLAG_INDENT)
5406 558 : appendStringInfoString(buf, "\n ON ");
5407 : else
5408 0 : appendStringInfoString(buf, " ON ");
5409 :
5410 : /* The event the rule is fired for */
5411 558 : switch (ev_type)
5412 : {
5413 6 : case '1':
5414 6 : appendStringInfoString(buf, "SELECT");
5415 6 : viewResultDesc = RelationGetDescr(ev_relation);
5416 6 : break;
5417 :
5418 154 : case '2':
5419 154 : appendStringInfoString(buf, "UPDATE");
5420 154 : break;
5421 :
5422 294 : case '3':
5423 294 : appendStringInfoString(buf, "INSERT");
5424 294 : break;
5425 :
5426 104 : case '4':
5427 104 : appendStringInfoString(buf, "DELETE");
5428 104 : break;
5429 :
5430 0 : default:
5431 0 : 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 558 : appendStringInfo(buf, " TO %s",
5440 558 : (prettyFlags & PRETTYFLAG_SCHEMA) ?
5441 114 : generate_relation_name(ev_class, NIL) :
5442 444 : generate_qualified_relation_name(ev_class));
5443 :
5444 : /* If the rule has an event qualification, add it */
5445 558 : if (strcmp(ev_qual, "<>") != 0)
5446 : {
5447 : Node *qual;
5448 : Query *query;
5449 : deparse_context context;
5450 : deparse_namespace dpns;
5451 :
5452 122 : if (prettyFlags & PRETTYFLAG_INDENT)
5453 122 : appendStringInfoString(buf, "\n ");
5454 122 : appendStringInfoString(buf, " WHERE ");
5455 :
5456 122 : 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 122 : 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 122 : query = getInsertSelectQuery(query, NULL);
5471 :
5472 : /* Must acquire locks right away; see notes in get_query_def() */
5473 122 : AcquireRewriteLocks(query, false, false);
5474 :
5475 122 : context.buf = buf;
5476 122 : context.namespaces = list_make1(&dpns);
5477 122 : context.resultDesc = NULL;
5478 122 : context.targetList = NIL;
5479 122 : context.windowClause = NIL;
5480 122 : context.varprefix = (list_length(query->rtable) != 1);
5481 122 : context.prettyFlags = prettyFlags;
5482 122 : context.wrapColumn = WRAP_COLUMN_DEFAULT;
5483 122 : context.indentLevel = PRETTYINDENT_STD;
5484 122 : context.colNamesVisible = true;
5485 122 : context.inGroupBy = false;
5486 122 : context.varInOrderBy = false;
5487 122 : context.appendparents = NULL;
5488 :
5489 122 : set_deparse_for_query(&dpns, query, NIL);
5490 :
5491 122 : get_rule_expr(qual, &context, false);
5492 : }
5493 :
5494 558 : appendStringInfoString(buf, " DO ");
5495 :
5496 : /* The INSTEAD keyword (if so) */
5497 558 : if (is_instead)
5498 330 : appendStringInfoString(buf, "INSTEAD ");
5499 :
5500 : /* Finally the rules actions */
5501 558 : if (list_length(actions) > 1)
5502 : {
5503 : ListCell *action;
5504 : Query *query;
5505 :
5506 20 : appendStringInfoChar(buf, '(');
5507 60 : foreach(action, actions)
5508 : {
5509 40 : query = (Query *) lfirst(action);
5510 40 : get_query_def(query, buf, NIL, viewResultDesc, true,
5511 : prettyFlags, WRAP_COLUMN_DEFAULT, 0);
5512 40 : if (prettyFlags)
5513 40 : appendStringInfoString(buf, ";\n");
5514 : else
5515 0 : appendStringInfoString(buf, "; ");
5516 : }
5517 20 : appendStringInfoString(buf, ");");
5518 : }
5519 : else
5520 : {
5521 : Query *query;
5522 :
5523 538 : query = (Query *) linitial(actions);
5524 538 : get_query_def(query, buf, NIL, viewResultDesc, true,
5525 : prettyFlags, WRAP_COLUMN_DEFAULT, 0);
5526 538 : appendStringInfoChar(buf, ';');
5527 : }
5528 :
5529 558 : table_close(ev_relation, AccessShareLock);
5530 558 : }
5531 :
5532 :
5533 : /* ----------
5534 : * make_viewdef - reconstruct the SELECT part of a
5535 : * view rewrite rule
5536 : * ----------
5537 : */
5538 : static void
5539 3572 : make_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 3572 : fno = SPI_fnumber(rulettc, "ev_type");
5558 3572 : dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5559 : Assert(!isnull);
5560 3572 : ev_type = DatumGetChar(dat);
5561 :
5562 3572 : fno = SPI_fnumber(rulettc, "ev_class");
5563 3572 : dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5564 : Assert(!isnull);
5565 3572 : ev_class = DatumGetObjectId(dat);
5566 :
5567 3572 : fno = SPI_fnumber(rulettc, "is_instead");
5568 3572 : dat = SPI_getbinval(ruletup, rulettc, fno, &isnull);
5569 : Assert(!isnull);
5570 3572 : is_instead = DatumGetBool(dat);
5571 :
5572 3572 : fno = SPI_fnumber(rulettc, "ev_qual");
5573 3572 : ev_qual = SPI_getvalue(ruletup, rulettc, fno);
5574 : Assert(ev_qual != NULL);
5575 :
5576 3572 : fno = SPI_fnumber(rulettc, "ev_action");
5577 3572 : ev_action = SPI_getvalue(ruletup, rulettc, fno);
5578 : Assert(ev_action != NULL);
5579 3572 : actions = (List *) stringToNode(ev_action);
5580 :
5581 3572 : if (list_length(actions) != 1)
5582 : {
5583 : /* keep output buffer empty and leave */
5584 0 : return;
5585 : }
5586 :
5587 3572 : query = (Query *) linitial(actions);
5588 :
5589 3572 : if (ev_type != '1' || !is_instead ||
5590 3572 : strcmp(ev_qual, "<>") != 0 || query->commandType != CMD_SELECT)
5591 : {
5592 : /* keep output buffer empty and leave */
5593 0 : return;
5594 : }
5595 :
5596 3572 : ev_relation = table_open(ev_class, AccessShareLock);
5597 :
5598 3572 : get_query_def(query, buf, NIL, RelationGetDescr(ev_relation), true,
5599 : prettyFlags, wrapColumn, 0);
5600 3572 : appendStringInfoChar(buf, ';');
5601 :
5602 3572 : 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 : */
5623 : static void
5624 5766 : get_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 5766 : CHECK_FOR_INTERRUPTS();
5634 5766 : check_stack_depth();
5635 :
5636 11532 : rtable_size = query->hasGroupRTE ?
5637 5766 : list_length(query->rtable) - 1 :
5638 5536 : 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 5766 : if (query->hasGroupRTE)
5645 : {
5646 230 : query->targetList = (List *)
5647 230 : flatten_group_exprs(NULL, query, (Node *) query->targetList);
5648 230 : query->havingQual =
5649 230 : 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 5766 : AcquireRewriteLocks(query, false, false);
5662 :
5663 5766 : context.buf = buf;
5664 5766 : context.namespaces = lcons(&dpns, list_copy(parentnamespace));
5665 5766 : context.resultDesc = NULL;
5666 5766 : context.targetList = NIL;
5667 5766 : context.windowClause = NIL;
5668 5766 : context.varprefix = (parentnamespace != NIL ||
5669 : rtable_size != 1);
5670 5766 : context.prettyFlags = prettyFlags;
5671 5766 : context.wrapColumn = wrapColumn;
5672 5766 : context.indentLevel = startIndent;
5673 5766 : context.colNamesVisible = colNamesVisible;
5674 5766 : context.inGroupBy = false;
5675 5766 : context.varInOrderBy = false;
5676 5766 : context.appendparents = NULL;
5677 :
5678 5766 : set_deparse_for_query(&dpns, query, parentnamespace);
5679 :
5680 5766 : switch (query->commandType)
5681 : {
5682 5126 : case CMD_SELECT:
5683 : /* We set context.resultDesc only if it's a SELECT */
5684 5126 : context.resultDesc = resultDesc;
5685 5126 : get_select_query_def(query, &context);
5686 5126 : break;
5687 :
5688 154 : case CMD_UPDATE:
5689 154 : get_update_query_def(query, &context);
5690 154 : break;
5691 :
5692 340 : case CMD_INSERT:
5693 340 : get_insert_query_def(query, &context);
5694 340 : break;
5695 :
5696 76 : case CMD_DELETE:
5697 76 : get_delete_query_def(query, &context);
5698 76 : break;
5699 :
5700 12 : case CMD_MERGE:
5701 12 : get_merge_query_def(query, &context);
5702 12 : break;
5703 :
5704 42 : case CMD_NOTHING:
5705 42 : appendStringInfoString(buf, "NOTHING");
5706 42 : break;
5707 :
5708 16 : case CMD_UTILITY:
5709 16 : get_utility_query_def(query, &context);
5710 16 : break;
5711 :
5712 0 : default:
5713 0 : elog(ERROR, "unrecognized query command type: %d",
5714 : query->commandType);
5715 : break;
5716 : }
5717 5766 : }
5718 :
5719 : /* ----------
5720 : * get_values_def - Parse back a VALUES list
5721 : * ----------
5722 : */
5723 : static void
5724 272 : get_values_def(List *values_lists, deparse_context *context)
5725 : {
5726 272 : StringInfo buf = context->buf;
5727 272 : bool first_list = true;
5728 : ListCell *vtl;
5729 :
5730 272 : appendStringInfoString(buf, "VALUES ");
5731 :
5732 778 : foreach(vtl, values_lists)
5733 : {
5734 506 : List *sublist = (List *) lfirst(vtl);
5735 506 : bool first_col = true;
5736 : ListCell *lc;
5737 :
5738 506 : if (first_list)
5739 272 : first_list = false;
5740 : else
5741 234 : appendStringInfoString(buf, ", ");
5742 :
5743 506 : appendStringInfoChar(buf, '(');
5744 1958 : foreach(lc, sublist)
5745 : {
5746 1452 : Node *col = (Node *) lfirst(lc);
5747 :
5748 1452 : if (first_col)
5749 506 : first_col = false;
5750 : else
5751 946 : appendStringInfoChar(buf, ',');
5752 :
5753 : /*
5754 : * Print the value. Whole-row Vars need special treatment.
5755 : */
5756 1452 : get_rule_expr_toplevel(col, context, false);
5757 : }
5758 506 : appendStringInfoChar(buf, ')');
5759 : }
5760 272 : }
5761 :
5762 : /* ----------
5763 : * get_with_clause - Parse back a WITH clause
5764 : * ----------
5765 : */
5766 : static void
5767 5708 : get_with_clause(Query *query, deparse_context *context)
5768 : {
5769 5708 : StringInfo buf = context->buf;
5770 : const char *sep;
5771 : ListCell *l;
5772 :
5773 5708 : if (query->cteList == NIL)
5774 5612 : return;
5775 :
5776 96 : if (PRETTY_INDENT(context))
5777 : {
5778 96 : context->indentLevel += PRETTYINDENT_STD;
5779 96 : appendStringInfoChar(buf, ' ');
5780 : }
5781 :
5782 96 : if (query->hasRecursive)
5783 56 : sep = "WITH RECURSIVE ";
5784 : else
5785 40 : sep = "WITH ";
5786 242 : foreach(l, query->cteList)
5787 : {
5788 146 : CommonTableExpr *cte = (CommonTableExpr *) lfirst(l);
5789 :
5790 146 : appendStringInfoString(buf, sep);
5791 146 : appendStringInfoString(buf, quote_identifier(cte->ctename));
5792 146 : if (cte->aliascolnames)
5793 : {
5794 56 : bool first = true;
5795 : ListCell *col;
5796 :
5797 56 : appendStringInfoChar(buf, '(');
5798 148 : foreach(col, cte->aliascolnames)
5799 : {
5800 92 : if (first)
5801 56 : first = false;
5802 : else
5803 36 : appendStringInfoString(buf, ", ");
5804 92 : appendStringInfoString(buf,
5805 92 : quote_identifier(strVal(lfirst(col))));
5806 : }
5807 56 : appendStringInfoChar(buf, ')');
5808 : }
5809 146 : appendStringInfoString(buf, " AS ");
5810 146 : switch (cte->ctematerialized)
5811 : {
5812 128 : case CTEMaterializeDefault:
5813 128 : break;
5814 18 : case CTEMaterializeAlways:
5815 18 : appendStringInfoString(buf, "MATERIALIZED ");
5816 18 : break;
5817 0 : case CTEMaterializeNever:
5818 0 : appendStringInfoString(buf, "NOT MATERIALIZED ");
5819 0 : break;
5820 : }
5821 146 : appendStringInfoChar(buf, '(');
5822 146 : if (PRETTY_INDENT(context))
5823 146 : appendContextKeyword(context, "", 0, 0, 0);
5824 146 : get_query_def((Query *) cte->ctequery, buf, context->namespaces, NULL,
5825 : true,
5826 : context->prettyFlags, context->wrapColumn,
5827 : context->indentLevel);
5828 146 : if (PRETTY_INDENT(context))
5829 146 : appendContextKeyword(context, "", 0, 0, 0);
5830 146 : appendStringInfoChar(buf, ')');
5831 :
5832 146 : if (cte->search_clause)
5833 : {
5834 6 : bool first = true;
5835 : ListCell *lc;
5836 :
5837 6 : appendStringInfo(buf, " SEARCH %s FIRST BY ",
5838 6 : cte->search_clause->search_breadth_first ? "BREADTH" : "DEPTH");
5839 :
5840 18 : foreach(lc, cte->search_clause->search_col_list)
5841 : {
5842 12 : if (first)
5843 6 : first = false;
5844 : else
5845 6 : appendStringInfoString(buf, ", ");
5846 12 : appendStringInfoString(buf,
5847 12 : quote_identifier(strVal(lfirst(lc))));
5848 : }
5849 :
5850 6 : appendStringInfo(buf, " SET %s", quote_identifier(cte->search_clause->search_seq_column));
5851 : }
5852 :
5853 146 : if (cte->cycle_clause)
5854 : {
5855 12 : bool first = true;
5856 : ListCell *lc;
5857 :
5858 12 : appendStringInfoString(buf, " CYCLE ");
5859 :
5860 36 : foreach(lc, cte->cycle_clause->cycle_col_list)
5861 : {
5862 24 : if (first)
5863 12 : first = false;
5864 : else
5865 12 : appendStringInfoString(buf, ", ");
5866 24 : appendStringInfoString(buf,
5867 24 : quote_identifier(strVal(lfirst(lc))));
5868 : }
5869 :
5870 12 : appendStringInfo(buf, " SET %s", quote_identifier(cte->cycle_clause->cycle_mark_column));
5871 :
5872 : {
5873 12 : Const *cmv = castNode(Const, cte->cycle_clause->cycle_mark_value);
5874 12 : Const *cmd = castNode(Const, cte->cycle_clause->cycle_mark_default);
5875 :
5876 18 : if (!(cmv->consttype == BOOLOID && !cmv->constisnull && DatumGetBool(cmv->constvalue) == true &&
5877 6 : cmd->consttype == BOOLOID && !cmd->constisnull && DatumGetBool(cmd->constvalue) == false))
5878 : {
5879 6 : appendStringInfoString(buf, " TO ");
5880 6 : get_rule_expr(cte->cycle_clause->cycle_mark_value, context, false);
5881 6 : appendStringInfoString(buf, " DEFAULT ");
5882 6 : get_rule_expr(cte->cycle_clause->cycle_mark_default, context, false);
5883 : }
5884 : }
5885 :
5886 12 : appendStringInfo(buf, " USING %s", quote_identifier(cte->cycle_clause->cycle_path_column));
5887 : }
5888 :
5889 146 : sep = ", ";
5890 : }
5891 :
5892 96 : if (PRETTY_INDENT(context))
5893 : {
5894 96 : context->indentLevel -= PRETTYINDENT_STD;
5895 96 : appendContextKeyword(context, "", 0, 0, 0);
5896 : }
5897 : else
5898 0 : appendStringInfoChar(buf, ' ');
5899 : }
5900 :
5901 : /* ----------
5902 : * get_select_query_def - Parse back a SELECT parsetree
5903 : * ----------
5904 : */
5905 : static void
5906 5126 : get_select_query_def(Query *query, deparse_context *context)
5907 : {
5908 5126 : StringInfo buf = context->buf;
5909 : bool force_colno;
5910 : ListCell *l;
5911 :
5912 : /* Insert the WITH clause if given */
5913 5126 : get_with_clause(query, context);
5914 :
5915 : /* Subroutines may need to consult the SELECT targetlist and windowClause */
5916 5126 : context->targetList = query->targetList;
5917 5126 : 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 5126 : if (query->setOperations)
5925 : {
5926 164 : get_setop_query(query->setOperations, query, context);
5927 : /* ORDER BY clauses must be simple in this case */
5928 164 : force_colno = true;
5929 : }
5930 : else
5931 : {
5932 4962 : get_basic_select_query(query, context);
5933 4962 : force_colno = false;
5934 : }
5935 :
5936 : /* Add the ORDER BY clause if given */
5937 5126 : if (query->sortClause != NIL)
5938 : {
5939 164 : appendContextKeyword(context, " ORDER BY ",
5940 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
5941 164 : 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 5126 : if (query->limitOffset != NULL)
5950 : {
5951 32 : appendContextKeyword(context, " OFFSET ",
5952 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
5953 32 : get_rule_expr(query->limitOffset, context, false);
5954 : }
5955 5126 : if (query->limitCount != NULL)
5956 : {
5957 70 : if (query->limitOption == LIMIT_OPTION_WITH_TIES)
5958 : {
5959 32 : appendContextKeyword(context, " FETCH FIRST ",
5960 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
5961 32 : get_rule_expr(query->limitCount, context, false);
5962 32 : appendStringInfoString(buf, " ROWS WITH TIES");
5963 : }
5964 : else
5965 : {
5966 38 : appendContextKeyword(context, " LIMIT ",
5967 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
5968 38 : if (IsA(query->limitCount, Const) &&
5969 16 : ((Const *) query->limitCount)->constisnull)
5970 16 : appendStringInfoString(buf, "ALL");
5971 : else
5972 22 : get_rule_expr(query->limitCount, context, false);
5973 : }
5974 : }
5975 :
5976 : /* Add FOR [KEY] UPDATE/SHARE clauses if present */
5977 5126 : if (query->hasForUpdate)
5978 : {
5979 12 : foreach(l, query->rowMarks)
5980 : {
5981 6 : RowMarkClause *rc = (RowMarkClause *) lfirst(l);
5982 :
5983 : /* don't print implicit clauses */
5984 6 : if (rc->pushedDown)
5985 0 : continue;
5986 :
5987 6 : switch (rc->strength)
5988 : {
5989 0 : case LCS_NONE:
5990 : /* we intentionally throw an error for LCS_NONE */
5991 0 : elog(ERROR, "unrecognized LockClauseStrength %d",
5992 : (int) rc->strength);
5993 : break;
5994 0 : case LCS_FORKEYSHARE:
5995 0 : appendContextKeyword(context, " FOR KEY SHARE",
5996 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
5997 0 : break;
5998 0 : case LCS_FORSHARE:
5999 0 : appendContextKeyword(context, " FOR SHARE",
6000 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
6001 0 : break;
6002 0 : case LCS_FORNOKEYUPDATE:
6003 0 : appendContextKeyword(context, " FOR NO KEY UPDATE",
6004 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
6005 0 : break;
6006 6 : case LCS_FORUPDATE:
6007 6 : appendContextKeyword(context, " FOR UPDATE",
6008 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
6009 6 : break;
6010 : }
6011 :
6012 6 : appendStringInfo(buf, " OF %s",
6013 6 : quote_identifier(get_rtable_name(rc->rti,
6014 : context)));
6015 6 : if (rc->waitPolicy == LockWaitError)
6016 0 : appendStringInfoString(buf, " NOWAIT");
6017 6 : else if (rc->waitPolicy == LockWaitSkip)
6018 0 : appendStringInfoString(buf, " SKIP LOCKED");
6019 : }
6020 : }
6021 5126 : }
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 : */
6028 : static RangeTblEntry *
6029 4962 : get_simple_values_rte(Query *query, TupleDesc resultDesc)
6030 : {
6031 4962 : 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 5334 : foreach(lc, query->rtable)
6040 : {
6041 4520 : RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
6042 :
6043 4520 : if (rte->rtekind == RTE_VALUES && rte->inFromCl)
6044 : {
6045 228 : if (result)
6046 4148 : return NULL; /* multiple VALUES (probably not possible) */
6047 228 : result = rte;
6048 : }
6049 4292 : else if (rte->rtekind == RTE_RELATION && !rte->inFromCl)
6050 144 : continue; /* ignore rule entries */
6051 : else
6052 4148 : 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 814 : if (result)
6065 : {
6066 : ListCell *lcn;
6067 : int colno;
6068 :
6069 228 : if (list_length(query->targetList) != list_length(result->eref->colnames))
6070 0 : return NULL; /* this probably cannot happen */
6071 228 : colno = 0;
6072 842 : forboth(lc, query->targetList, lcn, result->eref->colnames)
6073 : {
6074 626 : TargetEntry *tle = (TargetEntry *) lfirst(lc);
6075 626 : char *cname = strVal(lfirst(lcn));
6076 : char *colname;
6077 :
6078 626 : if (tle->resjunk)
6079 12 : return NULL; /* this probably cannot happen */
6080 :
6081 : /* compute name that get_target_list would use for column */
6082 626 : colno++;
6083 626 : if (resultDesc && colno <= resultDesc->natts)
6084 30 : colname = NameStr(TupleDescAttr(resultDesc, colno - 1)->attname);
6085 : else
6086 596 : colname = tle->resname;
6087 :
6088 : /* does it match the VALUES RTE? */
6089 626 : if (colname == NULL || strcmp(colname, cname) != 0)
6090 12 : return NULL; /* column name has been changed */
6091 : }
6092 : }
6093 :
6094 802 : return result;
6095 : }
6096 :
6097 : static void
6098 4962 : get_basic_select_query(Query *query, deparse_context *context)
6099 : {
6100 4962 : StringInfo buf = context->buf;
6101 : RangeTblEntry *values_rte;
6102 : char *sep;
6103 : ListCell *l;
6104 :
6105 4962 : if (PRETTY_INDENT(context))
6106 : {
6107 4916 : context->indentLevel += PRETTYINDENT_STD;
6108 4916 : 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 4962 : values_rte = get_simple_values_rte(query, context->resultDesc);
6117 4962 : if (values_rte)
6118 : {
6119 216 : get_values_def(values_rte->values_lists, context);
6120 216 : return;
6121 : }
6122 :
6123 : /*
6124 : * Build up the query string - first we say SELECT
6125 : */
6126 4746 : if (query->isReturn)
6127 52 : appendStringInfoString(buf, "RETURN");
6128 : else
6129 4694 : appendStringInfoString(buf, "SELECT");
6130 :
6131 : /* Add the DISTINCT clause if given */
6132 4746 : if (query->distinctClause != NIL)
6133 : {
6134 0 : if (query->hasDistinctOn)
6135 : {
6136 0 : appendStringInfoString(buf, " DISTINCT ON (");
6137 0 : sep = "";
6138 0 : foreach(l, query->distinctClause)
6139 : {
6140 0 : SortGroupClause *srt = (SortGroupClause *) lfirst(l);
6141 :
6142 0 : appendStringInfoString(buf, sep);
6143 0 : get_rule_sortgroupclause(srt->tleSortGroupRef, query->targetList,
6144 : false, context);
6145 0 : sep = ", ";
6146 : }
6147 0 : appendStringInfoChar(buf, ')');
6148 : }
6149 : else
6150 0 : appendStringInfoString(buf, " DISTINCT");
6151 : }
6152 :
6153 : /* Then we tell what to select (the targetlist) */
6154 4746 : get_target_list(query->targetList, context);
6155 :
6156 : /* Add the FROM clause if needed */
6157 4746 : get_from_clause(query, " FROM ", context);
6158 :
6159 : /* Add the WHERE clause if given */
6160 4746 : if (query->jointree->quals != NULL)
6161 : {
6162 1454 : appendContextKeyword(context, " WHERE ",
6163 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
6164 1454 : get_rule_expr(query->jointree->quals, context, false);
6165 : }
6166 :
6167 : /* Add the GROUP BY clause if given */
6168 4746 : if (query->groupClause != NULL || query->groupingSets != NULL)
6169 : {
6170 : bool save_ingroupby;
6171 :
6172 230 : appendContextKeyword(context, " GROUP BY ",
6173 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
6174 230 : if (query->groupDistinct)
6175 0 : appendStringInfoString(buf, "DISTINCT ");
6176 :
6177 230 : save_ingroupby = context->inGroupBy;
6178 230 : context->inGroupBy = true;
6179 :
6180 230 : if (query->groupingSets == NIL)
6181 : {
6182 224 : sep = "";
6183 506 : foreach(l, query->groupClause)
6184 : {
6185 282 : SortGroupClause *grp = (SortGroupClause *) lfirst(l);
6186 :
6187 282 : appendStringInfoString(buf, sep);
6188 282 : get_rule_sortgroupclause(grp->tleSortGroupRef, query->targetList,
6189 : false, context);
6190 282 : sep = ", ";
6191 : }
6192 : }
6193 : else
6194 : {
6195 6 : sep = "";
6196 12 : foreach(l, query->groupingSets)
6197 : {
6198 6 : GroupingSet *grp = lfirst(l);
6199 :
6200 6 : appendStringInfoString(buf, sep);
6201 6 : get_rule_groupingset(grp, query->targetList, true, context);
6202 6 : sep = ", ";
6203 : }
6204 : }
6205 :
6206 230 : context->inGroupBy = save_ingroupby;
6207 : }
6208 :
6209 : /* Add the HAVING clause if given */
6210 4746 : if (query->havingQual != NULL)
6211 : {
6212 10 : appendContextKeyword(context, " HAVING ",
6213 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 0);
6214 10 : get_rule_expr(query->havingQual, context, false);
6215 : }
6216 :
6217 : /* Add the WINDOW clause if needed */
6218 4746 : if (query->windowClause != NIL)
6219 42 : 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 : */
6228 : static void
6229 4892 : get_target_list(List *targetList, deparse_context *context)
6230 : {
6231 4892 : StringInfo buf = context->buf;
6232 : StringInfoData targetbuf;
6233 4892 : 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 4892 : initStringInfo(&targetbuf);
6240 :
6241 4892 : sep = " ";
6242 4892 : colno = 0;
6243 24788 : foreach(l, targetList)
6244 : {
6245 19896 : TargetEntry *tle = (TargetEntry *) lfirst(l);
6246 : char *colname;
6247 : char *attname;
6248 :
6249 19896 : if (tle->resjunk)
6250 34 : continue; /* ignore junk entries */
6251 :
6252 19862 : appendStringInfoString(buf, sep);
6253 19862 : sep = ", ";
6254 19862 : 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 19862 : resetStringInfo(&targetbuf);
6261 19862 : 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 19862 : if (tle->expr && (IsA(tle->expr, Var)))
6274 : {
6275 15338 : attname = get_variable((Var *) tle->expr, 0, true, context);
6276 : }
6277 : else
6278 : {
6279 4524 : 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 4524 : 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 19862 : if (context->resultDesc && colno <= context->resultDesc->natts)
6296 18034 : colname = NameStr(TupleDescAttr(context->resultDesc,
6297 : colno - 1)->attname);
6298 : else
6299 1828 : colname = tle->resname;
6300 :
6301 : /* Show AS unless the column's name is correct as-is */
6302 19862 : if (colname) /* resname could be NULL */
6303 : {
6304 19810 : if (attname == NULL || strcmp(attname, colname) != 0)
6305 6446 : appendStringInfo(&targetbuf, " AS %s", quote_identifier(colname));
6306 : }
6307 :
6308 : /* Restore context's output buffer */
6309 19862 : context->buf = buf;
6310 :
6311 : /* Consider line-wrapping if enabled */
6312 19862 : 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 19816 : if (targetbuf.len > 0 && targetbuf.data[0] == '\n')
6318 462 : leading_nl_pos = 0;
6319 : else
6320 19354 : leading_nl_pos = -1;
6321 :
6322 : /* If so, we shouldn't add anything */
6323 19816 : if (leading_nl_pos >= 0)
6324 : {
6325 : /* instead, remove any trailing spaces currently in buf */
6326 462 : removeStringInfoSpaces(buf);
6327 : }
6328 : else
6329 : {
6330 : char *trailing_nl;
6331 :
6332 : /* Locate the start of the current line in the output buffer */
6333 19354 : trailing_nl = strrchr(buf->data, '\n');
6334 19354 : if (trailing_nl == NULL)
6335 5938 : trailing_nl = buf->data;
6336 : else
6337 13416 : 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 19354 : if (colno > 1 &&
6345 14524 : ((strlen(trailing_nl) + targetbuf.len > context->wrapColumn) ||
6346 : last_was_multiline))
6347 14524 : appendContextKeyword(context, "", -PRETTYINDENT_STD,
6348 : PRETTYINDENT_STD, PRETTYINDENT_VAR);
6349 : }
6350 :
6351 : /* Remember this field's multiline status for next iteration */
6352 19816 : last_was_multiline =
6353 19816 : (strchr(targetbuf.data + leading_nl_pos + 1, '\n') != NULL);
6354 : }
6355 :
6356 : /* Add the new field */
6357 19862 : appendBinaryStringInfo(buf, targetbuf.data, targetbuf.len);
6358 : }
6359 :
6360 : /* clean up */
6361 4892 : pfree(targetbuf.data);
6362 4892 : }
6363 :
6364 : static void
6365 146 : get_returning_clause(Query *query, deparse_context *context)
6366 : {
6367 146 : StringInfo buf = context->buf;
6368 :
6369 146 : if (query->returningList)
6370 : {
6371 146 : bool have_with = false;
6372 :
6373 146 : appendContextKeyword(context, " RETURNING",
6374 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
6375 :
6376 : /* Add WITH (OLD/NEW) options, if they're not the defaults */
6377 146 : if (query->returningOldAlias && strcmp(query->returningOldAlias, "old") != 0)
6378 : {
6379 18 : appendStringInfo(buf, " WITH (OLD AS %s",
6380 18 : quote_identifier(query->returningOldAlias));
6381 18 : have_with = true;
6382 : }
6383 146 : if (query->returningNewAlias && strcmp(query->returningNewAlias, "new") != 0)
6384 : {
6385 18 : if (have_with)
6386 12 : appendStringInfo(buf, ", NEW AS %s",
6387 12 : quote_identifier(query->returningNewAlias));
6388 : else
6389 : {
6390 6 : appendStringInfo(buf, " WITH (NEW AS %s",
6391 6 : quote_identifier(query->returningNewAlias));
6392 6 : have_with = true;
6393 : }
6394 : }
6395 146 : if (have_with)
6396 24 : appendStringInfoChar(buf, ')');
6397 :
6398 : /* Add the returning expressions themselves */
6399 146 : get_target_list(query->returningList, context);
6400 : }
6401 146 : }
6402 :
6403 : static void
6404 756 : get_setop_query(Node *setOp, Query *query, deparse_context *context)
6405 : {
6406 756 : StringInfo buf = context->buf;
6407 : bool need_paren;
6408 :
6409 : /* Guard against excessively long or deeply-nested queries */
6410 756 : CHECK_FOR_INTERRUPTS();
6411 756 : check_stack_depth();
6412 :
6413 756 : if (IsA(setOp, RangeTblRef))
6414 : {
6415 460 : RangeTblRef *rtr = (RangeTblRef *) setOp;
6416 460 : RangeTblEntry *rte = rt_fetch(rtr->rtindex, query->rtable);
6417 460 : 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 1380 : need_paren = (subquery->cteList ||
6428 460 : subquery->sortClause ||
6429 460 : subquery->rowMarks ||
6430 460 : subquery->limitOffset ||
6431 1380 : subquery->limitCount ||
6432 460 : subquery->setOperations);
6433 460 : if (need_paren)
6434 0 : appendStringInfoChar(buf, '(');
6435 460 : get_query_def(subquery, buf, context->namespaces,
6436 460 : context->resultDesc, context->colNamesVisible,
6437 : context->prettyFlags, context->wrapColumn,
6438 : context->indentLevel);
6439 460 : if (need_paren)
6440 0 : appendStringInfoChar(buf, ')');
6441 : }
6442 296 : else if (IsA(setOp, SetOperationStmt))
6443 : {
6444 296 : 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 296 : if (IsA(op->larg, SetOperationStmt))
6460 : {
6461 132 : SetOperationStmt *lop = (SetOperationStmt *) op->larg;
6462 :
6463 132 : if (op->op == lop->op && op->all == lop->all)
6464 132 : need_paren = false;
6465 : else
6466 0 : need_paren = true;
6467 : }
6468 : else
6469 164 : need_paren = false;
6470 :
6471 296 : if (need_paren)
6472 : {
6473 0 : appendStringInfoChar(buf, '(');
6474 0 : subindent = PRETTYINDENT_STD;
6475 0 : appendContextKeyword(context, "", subindent, 0, 0);
6476 : }
6477 : else
6478 296 : subindent = 0;
6479 :
6480 296 : get_setop_query(op->larg, query, context);
6481 :
6482 296 : if (need_paren)
6483 0 : appendContextKeyword(context, ") ", -subindent, 0, 0);
6484 296 : else if (PRETTY_INDENT(context))
6485 296 : appendContextKeyword(context, "", -subindent, 0, 0);
6486 : else
6487 0 : appendStringInfoChar(buf, ' ');
6488 :
6489 296 : switch (op->op)
6490 : {
6491 296 : case SETOP_UNION:
6492 296 : appendStringInfoString(buf, "UNION ");
6493 296 : break;
6494 0 : case SETOP_INTERSECT:
6495 0 : appendStringInfoString(buf, "INTERSECT ");
6496 0 : break;
6497 0 : case SETOP_EXCEPT:
6498 0 : appendStringInfoString(buf, "EXCEPT ");
6499 0 : break;
6500 0 : default:
6501 0 : elog(ERROR, "unrecognized set op: %d",
6502 : (int) op->op);
6503 : }
6504 296 : if (op->all)
6505 284 : appendStringInfoString(buf, "ALL ");
6506 :
6507 : /* Always parenthesize if RHS is another setop */
6508 296 : 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 296 : if (need_paren)
6516 : {
6517 0 : appendStringInfoChar(buf, '(');
6518 0 : subindent = PRETTYINDENT_STD;
6519 : }
6520 : else
6521 296 : subindent = 0;
6522 296 : appendContextKeyword(context, "", subindent, 0, 0);
6523 :
6524 : /*
6525 : * The output column names of the RHS sub-select don't matter.
6526 : */
6527 296 : save_colnamesvisible = context->colNamesVisible;
6528 296 : context->colNamesVisible = false;
6529 :
6530 296 : get_setop_query(op->rarg, query, context);
6531 :
6532 296 : context->colNamesVisible = save_colnamesvisible;
6533 :
6534 296 : if (PRETTY_INDENT(context))
6535 296 : context->indentLevel -= subindent;
6536 296 : if (need_paren)
6537 0 : appendContextKeyword(context, ")", 0, 0, 0);
6538 : }
6539 : else
6540 : {
6541 0 : elog(ERROR, "unrecognized node type: %d",
6542 : (int) nodeTag(setOp));
6543 : }
6544 756 : }
6545 :
6546 : /*
6547 : * Display a sort/group clause.
6548 : *
6549 : * Also returns the expression tree, so caller need not find it again.
6550 : */
6551 : static Node *
6552 660 : get_rule_sortgroupclause(Index ref, List *tlist, bool force_colno,
6553 : deparse_context *context)
6554 : {
6555 660 : StringInfo buf = context->buf;
6556 : TargetEntry *tle;
6557 : Node *expr;
6558 :
6559 660 : tle = get_sortgroupref_tle(ref, tlist);
6560 660 : 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 660 : if (force_colno)
6575 : {
6576 : Assert(!tle->resjunk);
6577 12 : appendStringInfo(buf, "%d", tle->resno);
6578 : }
6579 648 : else if (!expr)
6580 : /* do nothing, probably can't happen */ ;
6581 648 : else if (IsA(expr, Const))
6582 0 : get_const_expr((Const *) expr, context, 1);
6583 648 : else if (IsA(expr, Var))
6584 : {
6585 : /* Tell get_variable to check for name conflict */
6586 620 : bool save_varinorderby = context->varInOrderBy;
6587 :
6588 620 : context->varInOrderBy = true;
6589 620 : (void) get_variable((Var *) expr, 0, false, context);
6590 620 : 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 56 : bool need_paren = (PRETTY_PAREN(context)
6602 28 : || IsA(expr, FuncExpr)
6603 24 : || IsA(expr, Aggref)
6604 24 : || IsA(expr, WindowFunc)
6605 56 : || IsA(expr, JsonConstructorExpr));
6606 :
6607 28 : if (need_paren)
6608 4 : appendStringInfoChar(context->buf, '(');
6609 28 : get_rule_expr(expr, context, true);
6610 28 : if (need_paren)
6611 4 : appendStringInfoChar(context->buf, ')');
6612 : }
6613 :
6614 660 : return expr;
6615 : }
6616 :
6617 : /*
6618 : * Display a GroupingSet
6619 : */
6620 : static void
6621 18 : get_rule_groupingset(GroupingSet *gset, List *targetlist,
6622 : bool omit_parens, deparse_context *context)
6623 : {
6624 : ListCell *l;
6625 18 : StringInfo buf = context->buf;
6626 18 : bool omit_child_parens = true;
6627 18 : char *sep = "";
6628 :
6629 18 : switch (gset->kind)
6630 : {
6631 0 : case GROUPING_SET_EMPTY:
6632 0 : appendStringInfoString(buf, "()");
6633 0 : return;
6634 :
6635 12 : case GROUPING_SET_SIMPLE:
6636 : {
6637 12 : if (!omit_parens || list_length(gset->content) != 1)
6638 12 : appendStringInfoChar(buf, '(');
6639 :
6640 42 : foreach(l, gset->content)
6641 : {
6642 30 : Index ref = lfirst_int(l);
6643 :
6644 30 : appendStringInfoString(buf, sep);
6645 30 : get_rule_sortgroupclause(ref, targetlist,
6646 : false, context);
6647 30 : sep = ", ";
6648 : }
6649 :
6650 12 : if (!omit_parens || list_length(gset->content) != 1)
6651 12 : appendStringInfoChar(buf, ')');
6652 : }
6653 12 : return;
6654 :
6655 6 : case GROUPING_SET_ROLLUP:
6656 6 : appendStringInfoString(buf, "ROLLUP(");
6657 6 : break;
6658 0 : case GROUPING_SET_CUBE:
6659 0 : appendStringInfoString(buf, "CUBE(");
6660 0 : break;
6661 0 : case GROUPING_SET_SETS:
6662 0 : appendStringInfoString(buf, "GROUPING SETS (");
6663 0 : omit_child_parens = false;
6664 0 : break;
6665 : }
6666 :
6667 18 : foreach(l, gset->content)
6668 : {
6669 12 : appendStringInfoString(buf, sep);
6670 12 : get_rule_groupingset(lfirst(l), targetlist, omit_child_parens, context);
6671 12 : sep = ", ";
6672 : }
6673 :
6674 6 : appendStringInfoChar(buf, ')');
6675 : }
6676 :
6677 : /*
6678 : * Display an ORDER BY list.
6679 : */
6680 : static void
6681 316 : get_rule_orderby(List *orderList, List *targetList,
6682 : bool force_colno, deparse_context *context)
6683 : {
6684 316 : StringInfo buf = context->buf;
6685 : const char *sep;
6686 : ListCell *l;
6687 :
6688 316 : sep = "";
6689 664 : foreach(l, orderList)
6690 : {
6691 348 : SortGroupClause *srt = (SortGroupClause *) lfirst(l);
6692 : Node *sortexpr;
6693 : Oid sortcoltype;
6694 : TypeCacheEntry *typentry;
6695 :
6696 348 : appendStringInfoString(buf, sep);
6697 348 : sortexpr = get_rule_sortgroupclause(srt->tleSortGroupRef, targetList,
6698 : force_colno, context);
6699 348 : sortcoltype = exprType(sortexpr);
6700 : /* See whether operator is default < or > for datatype */
6701 348 : typentry = lookup_type_cache(sortcoltype,
6702 : TYPECACHE_LT_OPR | TYPECACHE_GT_OPR);
6703 348 : if (srt->sortop == typentry->lt_opr)
6704 : {
6705 : /* ASC is default, so emit nothing for it */
6706 320 : if (srt->nulls_first)
6707 0 : appendStringInfoString(buf, " NULLS FIRST");
6708 : }
6709 28 : else if (srt->sortop == typentry->gt_opr)
6710 : {
6711 10 : appendStringInfoString(buf, " DESC");
6712 : /* DESC defaults to NULLS FIRST */
6713 10 : if (!srt->nulls_first)
6714 2 : appendStringInfoString(buf, " NULLS LAST");
6715 : }
6716 : else
6717 : {
6718 18 : appendStringInfo(buf, " USING %s",
6719 : generate_operator_name(srt->sortop,
6720 : sortcoltype,
6721 : sortcoltype));
6722 : /* be specific to eliminate ambiguity */
6723 18 : if (srt->nulls_first)
6724 0 : appendStringInfoString(buf, " NULLS FIRST");
6725 : else
6726 18 : appendStringInfoString(buf, " NULLS LAST");
6727 : }
6728 348 : sep = ", ";
6729 : }
6730 316 : }
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 : */
6738 : static void
6739 42 : get_rule_windowclause(Query *query, deparse_context *context)
6740 : {
6741 42 : StringInfo buf = context->buf;
6742 : const char *sep;
6743 : ListCell *l;
6744 :
6745 42 : sep = NULL;
6746 84 : foreach(l, query->windowClause)
6747 : {
6748 42 : WindowClause *wc = (WindowClause *) lfirst(l);
6749 :
6750 42 : if (wc->name == NULL)
6751 42 : continue; /* ignore anonymous windows */
6752 :
6753 0 : if (sep == NULL)
6754 0 : appendContextKeyword(context, " WINDOW ",
6755 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
6756 : else
6757 0 : appendStringInfoString(buf, sep);
6758 :
6759 0 : appendStringInfo(buf, "%s AS ", quote_identifier(wc->name));
6760 :
6761 0 : get_rule_windowspec(wc, query->targetList, context);
6762 :
6763 0 : sep = ", ";
6764 : }
6765 42 : }
6766 :
6767 : /*
6768 : * Display a window definition
6769 : */
6770 : static void
6771 42 : get_rule_windowspec(WindowClause *wc, List *targetList,
6772 : deparse_context *context)
6773 : {
6774 42 : StringInfo buf = context->buf;
6775 42 : bool needspace = false;
6776 : const char *sep;
6777 : ListCell *l;
6778 :
6779 42 : appendStringInfoChar(buf, '(');
6780 42 : if (wc->refname)
6781 : {
6782 0 : appendStringInfoString(buf, quote_identifier(wc->refname));
6783 0 : needspace = true;
6784 : }
6785 : /* partition clauses are always inherited, so only print if no refname */
6786 42 : if (wc->partitionClause && !wc->refname)
6787 : {
6788 0 : if (needspace)
6789 0 : appendStringInfoChar(buf, ' ');
6790 0 : appendStringInfoString(buf, "PARTITION BY ");
6791 0 : sep = "";
6792 0 : foreach(l, wc->partitionClause)
6793 : {
6794 0 : SortGroupClause *grp = (SortGroupClause *) lfirst(l);
6795 :
6796 0 : appendStringInfoString(buf, sep);
6797 0 : get_rule_sortgroupclause(grp->tleSortGroupRef, targetList,
6798 : false, context);
6799 0 : sep = ", ";
6800 : }
6801 0 : needspace = true;
6802 : }
6803 : /* print ordering clause only if not inherited */
6804 42 : if (wc->orderClause && !wc->copiedOrder)
6805 : {
6806 42 : if (needspace)
6807 0 : appendStringInfoChar(buf, ' ');
6808 42 : appendStringInfoString(buf, "ORDER BY ");
6809 42 : get_rule_orderby(wc->orderClause, targetList, false, context);
6810 42 : needspace = true;
6811 : }
6812 : /* framing clause is never inherited, so print unless it's default */
6813 42 : if (wc->frameOptions & FRAMEOPTION_NONDEFAULT)
6814 : {
6815 42 : if (needspace)
6816 42 : appendStringInfoChar(buf, ' ');
6817 42 : get_window_frame_options(wc->frameOptions,
6818 : wc->startOffset, wc->endOffset,
6819 : context);
6820 : }
6821 42 : appendStringInfoChar(buf, ')');
6822 42 : }
6823 :
6824 : /*
6825 : * Append the description of a window's framing options to context->buf
6826 : */
6827 : static void
6828 230 : get_window_frame_options(int frameOptions,
6829 : Node *startOffset, Node *endOffset,
6830 : deparse_context *context)
6831 : {
6832 230 : StringInfo buf = context->buf;
6833 :
6834 230 : if (frameOptions & FRAMEOPTION_NONDEFAULT)
6835 : {
6836 230 : if (frameOptions & FRAMEOPTION_RANGE)
6837 20 : appendStringInfoString(buf, "RANGE ");
6838 210 : else if (frameOptions & FRAMEOPTION_ROWS)
6839 198 : appendStringInfoString(buf, "ROWS ");
6840 12 : else if (frameOptions & FRAMEOPTION_GROUPS)
6841 12 : appendStringInfoString(buf, "GROUPS ");
6842 : else
6843 : Assert(false);
6844 230 : if (frameOptions & FRAMEOPTION_BETWEEN)
6845 92 : appendStringInfoString(buf, "BETWEEN ");
6846 230 : if (frameOptions & FRAMEOPTION_START_UNBOUNDED_PRECEDING)
6847 144 : appendStringInfoString(buf, "UNBOUNDED PRECEDING ");
6848 86 : else if (frameOptions & FRAMEOPTION_START_CURRENT_ROW)
6849 26 : appendStringInfoString(buf, "CURRENT ROW ");
6850 60 : else if (frameOptions & FRAMEOPTION_START_OFFSET)
6851 : {
6852 60 : get_rule_expr(startOffset, context, false);
6853 60 : if (frameOptions & FRAMEOPTION_START_OFFSET_PRECEDING)
6854 60 : appendStringInfoString(buf, " PRECEDING ");
6855 0 : else if (frameOptions & FRAMEOPTION_START_OFFSET_FOLLOWING)
6856 0 : appendStringInfoString(buf, " FOLLOWING ");
6857 : else
6858 : Assert(false);
6859 : }
6860 : else
6861 : Assert(false);
6862 230 : if (frameOptions & FRAMEOPTION_BETWEEN)
6863 : {
6864 92 : appendStringInfoString(buf, "AND ");
6865 92 : if (frameOptions & FRAMEOPTION_END_UNBOUNDED_FOLLOWING)
6866 20 : appendStringInfoString(buf, "UNBOUNDED FOLLOWING ");
6867 72 : else if (frameOptions & FRAMEOPTION_END_CURRENT_ROW)
6868 6 : appendStringInfoString(buf, "CURRENT ROW ");
6869 66 : else if (frameOptions & FRAMEOPTION_END_OFFSET)
6870 : {
6871 66 : get_rule_expr(endOffset, context, false);
6872 66 : if (frameOptions & FRAMEOPTION_END_OFFSET_PRECEDING)
6873 0 : appendStringInfoString(buf, " PRECEDING ");
6874 66 : else if (frameOptions & FRAMEOPTION_END_OFFSET_FOLLOWING)
6875 66 : appendStringInfoString(buf, " FOLLOWING ");
6876 : else
6877 : Assert(false);
6878 : }
6879 : else
6880 : Assert(false);
6881 : }
6882 230 : if (frameOptions & FRAMEOPTION_EXCLUDE_CURRENT_ROW)
6883 6 : appendStringInfoString(buf, "EXCLUDE CURRENT ROW ");
6884 224 : else if (frameOptions & FRAMEOPTION_EXCLUDE_GROUP)
6885 6 : appendStringInfoString(buf, "EXCLUDE GROUP ");
6886 218 : else if (frameOptions & FRAMEOPTION_EXCLUDE_TIES)
6887 6 : appendStringInfoString(buf, "EXCLUDE TIES ");
6888 : /* we will now have a trailing space; remove it */
6889 230 : buf->data[--(buf->len)] = '\0';
6890 : }
6891 230 : }
6892 :
6893 : /*
6894 : * Return the description of a window's framing options as a palloc'd string
6895 : */
6896 : char *
6897 188 : get_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 188 : initStringInfo(&buf);
6905 188 : context.buf = &buf;
6906 188 : context.namespaces = dpcontext;
6907 188 : context.resultDesc = NULL;
6908 188 : context.targetList = NIL;
6909 188 : context.windowClause = NIL;
6910 188 : context.varprefix = forceprefix;
6911 188 : context.prettyFlags = 0;
6912 188 : context.wrapColumn = WRAP_COLUMN_DEFAULT;
6913 188 : context.indentLevel = 0;
6914 188 : context.colNamesVisible = true;
6915 188 : context.inGroupBy = false;
6916 188 : context.varInOrderBy = false;
6917 188 : context.appendparents = NULL;
6918 :
6919 188 : get_window_frame_options(frameOptions, startOffset, endOffset, &context);
6920 :
6921 188 : return buf.data;
6922 : }
6923 :
6924 : /* ----------
6925 : * get_insert_query_def - Parse back an INSERT parsetree
6926 : * ----------
6927 : */
6928 : static void
6929 340 : get_insert_query_def(Query *query, deparse_context *context)
6930 : {
6931 340 : StringInfo buf = context->buf;
6932 340 : RangeTblEntry *select_rte = NULL;
6933 340 : 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 340 : 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 1322 : foreach(l, query->rtable)
6947 : {
6948 982 : rte = (RangeTblEntry *) lfirst(l);
6949 :
6950 982 : if (rte->rtekind == RTE_SUBQUERY)
6951 : {
6952 50 : if (select_rte)
6953 0 : elog(ERROR, "too many subquery RTEs in INSERT");
6954 50 : select_rte = rte;
6955 : }
6956 :
6957 982 : if (rte->rtekind == RTE_VALUES)
6958 : {
6959 44 : if (values_rte)
6960 0 : elog(ERROR, "too many values RTEs in INSERT");
6961 44 : values_rte = rte;
6962 : }
6963 : }
6964 340 : if (select_rte && values_rte)
6965 0 : elog(ERROR, "both subquery and values RTEs in INSERT");
6966 :
6967 : /*
6968 : * Start the query with INSERT INTO relname
6969 : */
6970 340 : rte = rt_fetch(query->resultRelation, query->rtable);
6971 : Assert(rte->rtekind == RTE_RELATION);
6972 :
6973 340 : if (PRETTY_INDENT(context))
6974 : {
6975 340 : context->indentLevel += PRETTYINDENT_STD;
6976 340 : appendStringInfoChar(buf, ' ');
6977 : }
6978 340 : 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 340 : get_rte_alias(rte, query->resultRelation, true, context);
6983 :
6984 : /* always want a space here */
6985 340 : 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 340 : strippedexprs = NIL;
6992 340 : sep = "";
6993 340 : if (query->targetList)
6994 340 : appendStringInfoChar(buf, '(');
6995 1242 : foreach(l, query->targetList)
6996 : {
6997 902 : TargetEntry *tle = (TargetEntry *) lfirst(l);
6998 :
6999 902 : if (tle->resjunk)
7000 0 : continue; /* ignore junk entries */
7001 :
7002 902 : appendStringInfoString(buf, sep);
7003 902 : 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 902 : appendStringInfoString(buf,
7010 902 : quote_identifier(get_attname(rte->relid,
7011 902 : 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 902 : strippedexprs = lappend(strippedexprs,
7023 902 : processIndirection((Node *) tle->expr,
7024 : context));
7025 : }
7026 340 : if (query->targetList)
7027 340 : appendStringInfoString(buf, ") ");
7028 :
7029 340 : if (query->override)
7030 : {
7031 0 : if (query->override == OVERRIDING_SYSTEM_VALUE)
7032 0 : appendStringInfoString(buf, "OVERRIDING SYSTEM VALUE ");
7033 0 : else if (query->override == OVERRIDING_USER_VALUE)
7034 0 : appendStringInfoString(buf, "OVERRIDING USER VALUE ");
7035 : }
7036 :
7037 340 : if (select_rte)
7038 : {
7039 : /* Add the SELECT */
7040 50 : get_query_def(select_rte->subquery, buf, context->namespaces, NULL,
7041 : false,
7042 : context->prettyFlags, context->wrapColumn,
7043 : context->indentLevel);
7044 : }
7045 290 : else if (values_rte)
7046 : {
7047 : /* Add the multi-VALUES expression lists */
7048 44 : get_values_def(values_rte->values_lists, context);
7049 : }
7050 246 : else if (strippedexprs)
7051 : {
7052 : /* Add the single-VALUES expression list */
7053 246 : appendContextKeyword(context, "VALUES (",
7054 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 2);
7055 246 : get_rule_list_toplevel(strippedexprs, context, false);
7056 246 : appendStringInfoChar(buf, ')');
7057 : }
7058 : else
7059 : {
7060 : /* No expressions, so it must be DEFAULT VALUES */
7061 0 : appendStringInfoString(buf, "DEFAULT VALUES");
7062 : }
7063 :
7064 : /* Add ON CONFLICT if present */
7065 340 : if (query->onConflict)
7066 : {
7067 30 : OnConflictExpr *confl = query->onConflict;
7068 :
7069 30 : appendStringInfoString(buf, " ON CONFLICT");
7070 :
7071 30 : if (confl->arbiterElems)
7072 : {
7073 : /* Add the single-VALUES expression list */
7074 24 : appendStringInfoChar(buf, '(');
7075 24 : get_rule_expr((Node *) confl->arbiterElems, context, false);
7076 24 : appendStringInfoChar(buf, ')');
7077 :
7078 : /* Add a WHERE clause (for partial indexes) if given */
7079 24 : 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 12 : save_varprefix = context->varprefix;
7089 12 : context->varprefix = false;
7090 :
7091 12 : appendContextKeyword(context, " WHERE ",
7092 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
7093 12 : get_rule_expr(confl->arbiterWhere, context, false);
7094 :
7095 12 : context->varprefix = save_varprefix;
7096 : }
7097 : }
7098 6 : else if (OidIsValid(confl->constraint))
7099 : {
7100 0 : char *constraint = get_constraint_name(confl->constraint);
7101 :
7102 0 : if (!constraint)
7103 0 : elog(ERROR, "cache lookup failed for constraint %u",
7104 : confl->constraint);
7105 0 : appendStringInfo(buf, " ON CONSTRAINT %s",
7106 : quote_identifier(constraint));
7107 : }
7108 :
7109 30 : if (confl->action == ONCONFLICT_NOTHING)
7110 : {
7111 18 : appendStringInfoString(buf, " DO NOTHING");
7112 : }
7113 : else
7114 : {
7115 12 : appendStringInfoString(buf, " DO UPDATE SET ");
7116 : /* Deparse targetlist */
7117 12 : get_update_query_targetlist_def(query, confl->onConflictSet,
7118 : context, rte);
7119 :
7120 : /* Add a WHERE clause if given */
7121 12 : if (confl->onConflictWhere != NULL)
7122 : {
7123 12 : appendContextKeyword(context, " WHERE ",
7124 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
7125 12 : get_rule_expr(confl->onConflictWhere, context, false);
7126 : }
7127 : }
7128 : }
7129 :
7130 : /* Add RETURNING if present */
7131 340 : if (query->returningList)
7132 78 : get_returning_clause(query, context);
7133 340 : }
7134 :
7135 :
7136 : /* ----------
7137 : * get_update_query_def - Parse back an UPDATE parsetree
7138 : * ----------
7139 : */
7140 : static void
7141 154 : get_update_query_def(Query *query, deparse_context *context)
7142 : {
7143 154 : StringInfo buf = context->buf;
7144 : RangeTblEntry *rte;
7145 :
7146 : /* Insert the WITH clause if given */
7147 154 : get_with_clause(query, context);
7148 :
7149 : /*
7150 : * Start the query with UPDATE relname SET
7151 : */
7152 154 : rte = rt_fetch(query->resultRelation, query->rtable);
7153 : Assert(rte->rtekind == RTE_RELATION);
7154 154 : if (PRETTY_INDENT(context))
7155 : {
7156 154 : appendStringInfoChar(buf, ' ');
7157 154 : context->indentLevel += PRETTYINDENT_STD;
7158 : }
7159 308 : appendStringInfo(buf, "UPDATE %s%s",
7160 154 : only_marker(rte),
7161 : generate_relation_name(rte->relid, NIL));
7162 :
7163 : /* Print the relation alias, if needed */
7164 154 : get_rte_alias(rte, query->resultRelation, false, context);
7165 :
7166 154 : appendStringInfoString(buf, " SET ");
7167 :
7168 : /* Deparse targetlist */
7169 154 : get_update_query_targetlist_def(query, query->targetList, context, rte);
7170 :
7171 : /* Add the FROM clause if needed */
7172 154 : get_from_clause(query, " FROM ", context);
7173 :
7174 : /* Add a WHERE clause if given */
7175 154 : if (query->jointree->quals != NULL)
7176 : {
7177 114 : appendContextKeyword(context, " WHERE ",
7178 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
7179 114 : get_rule_expr(query->jointree->quals, context, false);
7180 : }
7181 :
7182 : /* Add RETURNING if present */
7183 154 : if (query->returningList)
7184 46 : get_returning_clause(query, context);
7185 154 : }
7186 :
7187 :
7188 : /* ----------
7189 : * get_update_query_targetlist_def - Parse back an UPDATE targetlist
7190 : * ----------
7191 : */
7192 : static void
7193 190 : get_update_query_targetlist_def(Query *query, List *targetList,
7194 : deparse_context *context, RangeTblEntry *rte)
7195 : {
7196 190 : 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 190 : ma_sublinks = NIL;
7210 190 : if (query->hasSubLinks) /* else there can't be any */
7211 : {
7212 42 : foreach(l, targetList)
7213 : {
7214 30 : TargetEntry *tle = (TargetEntry *) lfirst(l);
7215 :
7216 30 : if (tle->resjunk && IsA(tle->expr, SubLink))
7217 : {
7218 6 : SubLink *sl = (SubLink *) tle->expr;
7219 :
7220 6 : if (sl->subLinkType == MULTIEXPR_SUBLINK)
7221 : {
7222 6 : ma_sublinks = lappend(ma_sublinks, sl);
7223 : Assert(sl->subLinkId == list_length(ma_sublinks));
7224 : }
7225 : }
7226 : }
7227 : }
7228 190 : next_ma_cell = list_head(ma_sublinks);
7229 190 : cur_ma_sublink = NULL;
7230 190 : remaining_ma_columns = 0;
7231 :
7232 : /* Add the comma separated list of 'attname = value' */
7233 190 : sep = "";
7234 488 : foreach(l, targetList)
7235 : {
7236 298 : TargetEntry *tle = (TargetEntry *) lfirst(l);
7237 : Node *expr;
7238 :
7239 298 : if (tle->resjunk)
7240 6 : continue; /* ignore junk entries */
7241 :
7242 : /* Emit separator (OK whether we're in multiassignment or not) */
7243 292 : appendStringInfoString(buf, sep);
7244 292 : sep = ", ";
7245 :
7246 : /*
7247 : * Check to see if we're starting a multiassignment group: if so,
7248 : * output a left paren.
7249 : */
7250 292 : 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 6 : expr = (Node *) tle->expr;
7262 12 : while (expr)
7263 : {
7264 12 : if (IsA(expr, FieldStore))
7265 : {
7266 0 : FieldStore *fstore = (FieldStore *) expr;
7267 :
7268 0 : expr = (Node *) linitial(fstore->newvals);
7269 : }
7270 12 : else if (IsA(expr, SubscriptingRef))
7271 : {
7272 6 : SubscriptingRef *sbsref = (SubscriptingRef *) expr;
7273 :
7274 6 : if (sbsref->refassgnexpr == NULL)
7275 0 : break;
7276 :
7277 6 : expr = (Node *) sbsref->refassgnexpr;
7278 : }
7279 6 : else if (IsA(expr, CoerceToDomain))
7280 : {
7281 0 : CoerceToDomain *cdomain = (CoerceToDomain *) expr;
7282 :
7283 0 : if (cdomain->coercionformat != COERCE_IMPLICIT_CAST)
7284 0 : break;
7285 0 : expr = (Node *) cdomain->arg;
7286 : }
7287 : else
7288 6 : break;
7289 : }
7290 6 : expr = strip_implicit_coercions(expr);
7291 :
7292 6 : if (expr && IsA(expr, Param) &&
7293 6 : ((Param *) expr)->paramkind == PARAM_MULTIEXPR)
7294 : {
7295 6 : cur_ma_sublink = (SubLink *) lfirst(next_ma_cell);
7296 6 : next_ma_cell = lnext(ma_sublinks, next_ma_cell);
7297 6 : 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 6 : 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 292 : appendStringInfoString(buf,
7309 292 : quote_identifier(get_attname(rte->relid,
7310 292 : 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 292 : 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 292 : if (cur_ma_sublink != NULL)
7325 : {
7326 18 : if (--remaining_ma_columns > 0)
7327 12 : continue; /* not the last column of multiassignment */
7328 6 : appendStringInfoChar(buf, ')');
7329 6 : expr = (Node *) cur_ma_sublink;
7330 6 : cur_ma_sublink = NULL;
7331 : }
7332 :
7333 280 : appendStringInfoString(buf, " = ");
7334 :
7335 280 : get_rule_expr(expr, context, false);
7336 : }
7337 190 : }
7338 :
7339 :
7340 : /* ----------
7341 : * get_delete_query_def - Parse back a DELETE parsetree
7342 : * ----------
7343 : */
7344 : static void
7345 76 : get_delete_query_def(Query *query, deparse_context *context)
7346 : {
7347 76 : StringInfo buf = context->buf;
7348 : RangeTblEntry *rte;
7349 :
7350 : /* Insert the WITH clause if given */
7351 76 : get_with_clause(query, context);
7352 :
7353 : /*
7354 : * Start the query with DELETE FROM relname
7355 : */
7356 76 : rte = rt_fetch(query->resultRelation, query->rtable);
7357 : Assert(rte->rtekind == RTE_RELATION);
7358 76 : if (PRETTY_INDENT(context))
7359 : {
7360 76 : appendStringInfoChar(buf, ' ');
7361 76 : context->indentLevel += PRETTYINDENT_STD;
7362 : }
7363 152 : appendStringInfo(buf, "DELETE FROM %s%s",
7364 76 : only_marker(rte),
7365 : generate_relation_name(rte->relid, NIL));
7366 :
7367 : /* Print the relation alias, if needed */
7368 76 : get_rte_alias(rte, query->resultRelation, false, context);
7369 :
7370 : /* Add the USING clause if given */
7371 76 : get_from_clause(query, " USING ", context);
7372 :
7373 : /* Add a WHERE clause if given */
7374 76 : if (query->jointree->quals != NULL)
7375 : {
7376 76 : appendContextKeyword(context, " WHERE ",
7377 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 1);
7378 76 : get_rule_expr(query->jointree->quals, context, false);
7379 : }
7380 :
7381 : /* Add RETURNING if present */
7382 76 : if (query->returningList)
7383 16 : get_returning_clause(query, context);
7384 76 : }
7385 :
7386 :
7387 : /* ----------
7388 : * get_merge_query_def - Parse back a MERGE parsetree
7389 : * ----------
7390 : */
7391 : static void
7392 12 : get_merge_query_def(Query *query, deparse_context *context)
7393 : {
7394 12 : StringInfo buf = context->buf;
7395 : RangeTblEntry *rte;
7396 : ListCell *lc;
7397 : bool haveNotMatchedBySource;
7398 :
7399 : /* Insert the WITH clause if given */
7400 12 : get_with_clause(query, context);
7401 :
7402 : /*
7403 : * Start the query with MERGE INTO relname
7404 : */
7405 12 : rte = rt_fetch(query->resultRelation, query->rtable);
7406 : Assert(rte->rtekind == RTE_RELATION);
7407 12 : if (PRETTY_INDENT(context))
7408 : {
7409 12 : appendStringInfoChar(buf, ' ');
7410 12 : context->indentLevel += PRETTYINDENT_STD;
7411 : }
7412 24 : appendStringInfo(buf, "MERGE INTO %s%s",
7413 12 : only_marker(rte),
7414 : generate_relation_name(rte->relid, NIL));
7415 :
7416 : /* Print the relation alias, if needed */
7417 12 : get_rte_alias(rte, query->resultRelation, false, context);
7418 :
7419 : /* Print the source relation and join clause */
7420 12 : get_from_clause(query, " USING ", context);
7421 12 : appendContextKeyword(context, " ON ",
7422 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 2);
7423 12 : 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 12 : haveNotMatchedBySource = false;
7433 84 : foreach(lc, query->mergeActionList)
7434 : {
7435 78 : MergeAction *action = lfirst_node(MergeAction, lc);
7436 :
7437 78 : if (action->matchKind == MERGE_WHEN_NOT_MATCHED_BY_SOURCE)
7438 : {
7439 6 : haveNotMatchedBySource = true;
7440 6 : break;
7441 : }
7442 : }
7443 :
7444 : /* Print each merge action */
7445 90 : foreach(lc, query->mergeActionList)
7446 : {
7447 78 : MergeAction *action = lfirst_node(MergeAction, lc);
7448 :
7449 78 : appendContextKeyword(context, " WHEN ",
7450 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 2);
7451 78 : switch (action->matchKind)
7452 : {
7453 36 : case MERGE_WHEN_MATCHED:
7454 36 : appendStringInfoString(buf, "MATCHED");
7455 36 : break;
7456 6 : case MERGE_WHEN_NOT_MATCHED_BY_SOURCE:
7457 6 : appendStringInfoString(buf, "NOT MATCHED BY SOURCE");
7458 6 : break;
7459 36 : case MERGE_WHEN_NOT_MATCHED_BY_TARGET:
7460 36 : if (haveNotMatchedBySource)
7461 6 : appendStringInfoString(buf, "NOT MATCHED BY TARGET");
7462 : else
7463 30 : appendStringInfoString(buf, "NOT MATCHED");
7464 36 : break;
7465 0 : default:
7466 0 : elog(ERROR, "unrecognized matchKind: %d",
7467 : (int) action->matchKind);
7468 : }
7469 :
7470 78 : if (action->qual)
7471 : {
7472 48 : appendContextKeyword(context, " AND ",
7473 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 3);
7474 48 : get_rule_expr(action->qual, context, false);
7475 : }
7476 78 : appendContextKeyword(context, " THEN ",
7477 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 3);
7478 :
7479 78 : if (action->commandType == CMD_INSERT)
7480 : {
7481 : /* This generally matches get_insert_query_def() */
7482 36 : List *strippedexprs = NIL;
7483 36 : const char *sep = "";
7484 : ListCell *lc2;
7485 :
7486 36 : appendStringInfoString(buf, "INSERT");
7487 :
7488 36 : if (action->targetList)
7489 30 : appendStringInfoString(buf, " (");
7490 102 : foreach(lc2, action->targetList)
7491 : {
7492 66 : TargetEntry *tle = (TargetEntry *) lfirst(lc2);
7493 :
7494 : Assert(!tle->resjunk);
7495 :
7496 66 : appendStringInfoString(buf, sep);
7497 66 : sep = ", ";
7498 :
7499 66 : appendStringInfoString(buf,
7500 66 : quote_identifier(get_attname(rte->relid,
7501 66 : tle->resno,
7502 : false)));
7503 66 : strippedexprs = lappend(strippedexprs,
7504 66 : processIndirection((Node *) tle->expr,
7505 : context));
7506 : }
7507 36 : if (action->targetList)
7508 30 : appendStringInfoChar(buf, ')');
7509 :
7510 36 : if (action->override)
7511 : {
7512 6 : if (action->override == OVERRIDING_SYSTEM_VALUE)
7513 0 : appendStringInfoString(buf, " OVERRIDING SYSTEM VALUE");
7514 6 : else if (action->override == OVERRIDING_USER_VALUE)
7515 6 : appendStringInfoString(buf, " OVERRIDING USER VALUE");
7516 : }
7517 :
7518 36 : if (strippedexprs)
7519 : {
7520 30 : appendContextKeyword(context, " VALUES (",
7521 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 4);
7522 30 : get_rule_list_toplevel(strippedexprs, context, false);
7523 30 : appendStringInfoChar(buf, ')');
7524 : }
7525 : else
7526 6 : appendStringInfoString(buf, " DEFAULT VALUES");
7527 : }
7528 42 : else if (action->commandType == CMD_UPDATE)
7529 : {
7530 24 : appendStringInfoString(buf, "UPDATE SET ");
7531 24 : get_update_query_targetlist_def(query, action->targetList,
7532 : context, rte);
7533 : }
7534 18 : else if (action->commandType == CMD_DELETE)
7535 12 : appendStringInfoString(buf, "DELETE");
7536 6 : else if (action->commandType == CMD_NOTHING)
7537 6 : appendStringInfoString(buf, "DO NOTHING");
7538 : }
7539 :
7540 : /* Add RETURNING if present */
7541 12 : if (query->returningList)
7542 6 : get_returning_clause(query, context);
7543 12 : }
7544 :
7545 :
7546 : /* ----------
7547 : * get_utility_query_def - Parse back a UTILITY parsetree
7548 : * ----------
7549 : */
7550 : static void
7551 16 : get_utility_query_def(Query *query, deparse_context *context)
7552 : {
7553 16 : StringInfo buf = context->buf;
7554 :
7555 16 : if (query->utilityStmt && IsA(query->utilityStmt, NotifyStmt))
7556 16 : {
7557 16 : NotifyStmt *stmt = (NotifyStmt *) query->utilityStmt;
7558 :
7559 16 : appendContextKeyword(context, "",
7560 : 0, PRETTYINDENT_STD, 1);
7561 16 : appendStringInfo(buf, "NOTIFY %s",
7562 16 : quote_identifier(stmt->conditionname));
7563 16 : if (stmt->payload)
7564 : {
7565 0 : appendStringInfoString(buf, ", ");
7566 0 : simple_quote_literal(buf, stmt->payload);
7567 : }
7568 : }
7569 : else
7570 : {
7571 : /* Currently only NOTIFY utility commands can appear in rules */
7572 0 : elog(ERROR, "unexpected utility statement type");
7573 : }
7574 16 : }
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 : */
7595 : static char *
7596 167184 : get_variable(Var *var, int levelsup, bool istoplevel, deparse_context *context)
7597 : {
7598 167184 : 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 167184 : netlevelsup = var->varlevelsup + levelsup;
7612 167184 : if (netlevelsup >= list_length(context->namespaces))
7613 0 : elog(ERROR, "bogus varlevelsup: %d offset %d",
7614 : var->varlevelsup, levelsup);
7615 167184 : 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 167184 : if (var->varnosyn > 0 && dpns->plan == NULL)
7627 : {
7628 37596 : varno = var->varnosyn;
7629 37596 : varattno = var->varattnosyn;
7630 : }
7631 : else
7632 : {
7633 129588 : varno = var->varno;
7634 129588 : 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 167184 : 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 125662 : if (context->appendparents && dpns->appendrels)
7649 : {
7650 3738 : int pvarno = varno;
7651 3738 : AttrNumber pvarattno = varattno;
7652 3738 : AppendRelInfo *appinfo = dpns->appendrels[pvarno];
7653 3738 : bool found = false;
7654 :
7655 : /* Only map up to inheritance parents, not UNION ALL appendrels */
7656 7610 : while (appinfo &&
7657 4162 : rt_fetch(appinfo->parent_relid,
7658 4162 : dpns->rtable)->rtekind == RTE_RELATION)
7659 : {
7660 3872 : found = false;
7661 3872 : if (pvarattno > 0) /* system columns stay as-is */
7662 : {
7663 3598 : if (pvarattno > appinfo->num_child_cols)
7664 0 : break; /* safety check */
7665 3598 : pvarattno = appinfo->parent_colnos[pvarattno - 1];
7666 3598 : if (pvarattno == 0)
7667 0 : break; /* Var is local to child */
7668 : }
7669 :
7670 3872 : pvarno = appinfo->parent_relid;
7671 3872 : found = true;
7672 :
7673 : /* If the parent is itself a child, continue up. */
7674 : Assert(pvarno > 0 && pvarno <= list_length(dpns->rtable));
7675 3872 : 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 3738 : if (found && bms_is_member(pvarno, context->appendparents))
7683 : {
7684 3082 : varno = pvarno;
7685 3082 : varattno = pvarattno;
7686 : }
7687 : }
7688 :
7689 125662 : rte = rt_fetch(varno, dpns->rtable);
7690 :
7691 : /* might be returning old/new column value */
7692 125662 : if (var->varreturningtype == VAR_RETURNING_OLD)
7693 416 : refname = dpns->ret_old_alias;
7694 125246 : else if (var->varreturningtype == VAR_RETURNING_NEW)
7695 414 : refname = dpns->ret_new_alias;
7696 : else
7697 124832 : refname = (char *) list_nth(dpns->rtable_names, varno - 1);
7698 :
7699 125662 : colinfo = deparse_columns_fetch(varno, dpns);
7700 125662 : attnum = varattno;
7701 : }
7702 : else
7703 : {
7704 41522 : resolve_special_varno((Node *) var, context,
7705 : get_special_variable, NULL);
7706 41522 : 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 129880 : if ((rte->rtekind == RTE_SUBQUERY || rte->rtekind == RTE_CTE) &&
7721 4218 : attnum > list_length(rte->eref->colnames) &&
7722 2 : dpns->inner_plan)
7723 : {
7724 : TargetEntry *tle;
7725 : deparse_namespace save_dpns;
7726 :
7727 2 : tle = get_tle_by_resno(dpns->inner_tlist, attnum);
7728 2 : if (!tle)
7729 0 : elog(ERROR, "invalid attnum %d for relation \"%s\"",
7730 : attnum, rte->eref->aliasname);
7731 :
7732 : Assert(netlevelsup == 0);
7733 2 : 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 2 : if (!IsA(tle->expr, Var))
7740 0 : appendStringInfoChar(buf, '(');
7741 2 : get_rule_expr((Node *) tle->expr, context, true);
7742 2 : if (!IsA(tle->expr, Var))
7743 0 : appendStringInfoChar(buf, ')');
7744 :
7745 2 : pop_child_plan(dpns, &save_dpns);
7746 2 : 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 125660 : if (rte->rtekind == RTE_JOIN && rte->alias == NULL)
7762 : {
7763 96 : if (rte->joinaliasvars == NIL)
7764 0 : elog(ERROR, "cannot decompile join alias var in plan tree");
7765 96 : if (attnum > 0)
7766 : {
7767 : Var *aliasvar;
7768 :
7769 96 : aliasvar = (Var *) list_nth(rte->joinaliasvars, attnum - 1);
7770 : /* we intentionally don't strip implicit coercions here */
7771 96 : if (aliasvar && IsA(aliasvar, Var))
7772 : {
7773 0 : 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 125660 : if (attnum == InvalidAttrNumber)
7787 952 : attname = NULL;
7788 124708 : else if (attnum > 0)
7789 : {
7790 : /* Get column name to use from the colinfo struct */
7791 122892 : if (attnum > colinfo->num_cols)
7792 0 : elog(ERROR, "invalid attnum %d for relation \"%s\"",
7793 : attnum, rte->eref->aliasname);
7794 122892 : 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 122892 : if (attname == NULL)
7804 6 : attname = "?dropped?column?";
7805 : }
7806 : else
7807 : {
7808 : /* System column - name is fixed, get it from the catalog */
7809 1816 : attname = get_rte_attribute_name(rte, attnum);
7810 : }
7811 :
7812 189174 : need_prefix = (context->varprefix || attname == NULL ||
7813 63514 : 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 125660 : if (context->varInOrderBy && !context->inGroupBy && !need_prefix)
7824 : {
7825 224 : int colno = 0;
7826 :
7827 874 : foreach_node(TargetEntry, tle, context->targetList)
7828 : {
7829 : char *colname;
7830 :
7831 438 : if (tle->resjunk)
7832 0 : continue; /* ignore junk entries */
7833 438 : colno++;
7834 :
7835 : /* This must match colname-choosing logic in get_target_list() */
7836 438 : if (context->resultDesc && colno <= context->resultDesc->natts)
7837 438 : colname = NameStr(TupleDescAttr(context->resultDesc,
7838 : colno - 1)->attname);
7839 : else
7840 0 : colname = tle->resname;
7841 :
7842 438 : if (colname && strcmp(colname, attname) == 0 &&
7843 152 : !equal(var, tle->expr))
7844 : {
7845 12 : need_prefix = true;
7846 12 : break;
7847 : }
7848 : }
7849 : }
7850 :
7851 125660 : if (refname && need_prefix)
7852 : {
7853 61964 : appendStringInfoString(buf, quote_identifier(refname));
7854 61964 : appendStringInfoChar(buf, '.');
7855 : }
7856 125660 : if (attname)
7857 124708 : appendStringInfoString(buf, quote_identifier(attname));
7858 : else
7859 : {
7860 952 : appendStringInfoChar(buf, '*');
7861 952 : if (istoplevel)
7862 84 : appendStringInfo(buf, "::%s",
7863 : format_type_with_typemod(var->vartype,
7864 : var->vartypmod));
7865 : }
7866 :
7867 125660 : 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 : */
7877 : static void
7878 41522 : get_special_variable(Node *node, deparse_context *context, void *callback_arg)
7879 : {
7880 41522 : 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 41522 : if (!IsA(node, Var))
7887 3590 : appendStringInfoChar(buf, '(');
7888 41522 : get_rule_expr(node, context, true);
7889 41522 : if (!IsA(node, Var))
7890 3590 : appendStringInfoChar(buf, ')');
7891 41522 : }
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 : */
7898 : static void
7899 113600 : resolve_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 113600 : check_stack_depth();
7907 :
7908 : /* If it's not a Var, invoke the callback. */
7909 113600 : if (!IsA(node, Var))
7910 : {
7911 3850 : (*callback) (node, context, callback_arg);
7912 3850 : return;
7913 : }
7914 :
7915 : /* Find appropriate nesting depth */
7916 109750 : var = (Var *) node;
7917 109750 : dpns = (deparse_namespace *) list_nth(context->namespaces,
7918 109750 : 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 109750 : if (var->varno == OUTER_VAR && dpns->outer_tlist)
7925 : {
7926 : TargetEntry *tle;
7927 : deparse_namespace save_dpns;
7928 : Bitmapset *save_appendparents;
7929 :
7930 53822 : tle = get_tle_by_resno(dpns->outer_tlist, var->varattno);
7931 53822 : if (!tle)
7932 0 : 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 53822 : save_appendparents = context->appendparents;
7940 :
7941 53822 : if (IsA(dpns->plan, Append))
7942 4088 : context->appendparents = bms_union(context->appendparents,
7943 4088 : ((Append *) dpns->plan)->apprelids);
7944 49734 : else if (IsA(dpns->plan, MergeAppend))
7945 572 : context->appendparents = bms_union(context->appendparents,
7946 572 : ((MergeAppend *) dpns->plan)->apprelids);
7947 :
7948 53822 : push_child_plan(dpns, dpns->outer_plan, &save_dpns);
7949 53822 : resolve_special_varno((Node *) tle->expr, context,
7950 : callback, callback_arg);
7951 53822 : pop_child_plan(dpns, &save_dpns);
7952 53822 : context->appendparents = save_appendparents;
7953 53822 : return;
7954 : }
7955 55928 : else if (var->varno == INNER_VAR && dpns->inner_tlist)
7956 : {
7957 : TargetEntry *tle;
7958 : deparse_namespace save_dpns;
7959 :
7960 13140 : tle = get_tle_by_resno(dpns->inner_tlist, var->varattno);
7961 13140 : if (!tle)
7962 0 : elog(ERROR, "bogus varattno for INNER_VAR var: %d", var->varattno);
7963 :
7964 13140 : push_child_plan(dpns, dpns->inner_plan, &save_dpns);
7965 13140 : resolve_special_varno((Node *) tle->expr, context,
7966 : callback, callback_arg);
7967 13140 : pop_child_plan(dpns, &save_dpns);
7968 13140 : return;
7969 : }
7970 42788 : else if (var->varno == INDEX_VAR && dpns->index_tlist)
7971 : {
7972 : TargetEntry *tle;
7973 :
7974 4856 : tle = get_tle_by_resno(dpns->index_tlist, var->varattno);
7975 4856 : if (!tle)
7976 0 : elog(ERROR, "bogus varattno for INDEX_VAR var: %d", var->varattno);
7977 :
7978 4856 : resolve_special_varno((Node *) tle->expr, context,
7979 : callback, callback_arg);
7980 4856 : return;
7981 : }
7982 37932 : else if (var->varno < 1 || var->varno > list_length(dpns->rtable))
7983 0 : elog(ERROR, "bogus varno: %d", var->varno);
7984 :
7985 : /* Not special. Just invoke the callback. */
7986 37932 : (*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 : */
8006 : static const char *
8007 1304 : get_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 1304 : if (IsA(var, RowExpr))
8025 : {
8026 36 : RowExpr *r = (RowExpr *) var;
8027 :
8028 36 : if (fieldno > 0 && fieldno <= list_length(r->colnames))
8029 36 : 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 1268 : if (IsA(var, Param))
8036 : {
8037 18 : Param *param = (Param *) var;
8038 : ListCell *ancestor_cell;
8039 :
8040 18 : expr = find_param_referent(param, context, &dpns, &ancestor_cell);
8041 18 : 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 18 : push_ancestor_plan(dpns, ancestor_cell, &save_dpns);
8048 18 : result = get_name_for_var_field((Var *) expr, fieldno,
8049 : 0, context);
8050 18 : pop_ancestor_plan(dpns, &save_dpns);
8051 18 : 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 1250 : if (!IsA(var, Var) ||
8060 1170 : var->vartype != RECORDOID)
8061 : {
8062 1004 : 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 1004 : return NameStr(TupleDescAttr(tupleDesc, fieldno - 1)->attname);
8066 : }
8067 :
8068 : /* Find appropriate nesting depth */
8069 246 : netlevelsup = var->varlevelsup + levelsup;
8070 246 : if (netlevelsup >= list_length(context->namespaces))
8071 0 : elog(ERROR, "bogus varlevelsup: %d offset %d",
8072 : var->varlevelsup, levelsup);
8073 246 : 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 246 : if (var->varnosyn > 0 && dpns->plan == NULL)
8082 : {
8083 96 : varno = var->varnosyn;
8084 96 : varattno = var->varattnosyn;
8085 : }
8086 : else
8087 : {
8088 150 : varno = var->varno;
8089 150 : 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 246 : if (varno >= 1 && varno <= list_length(dpns->rtable))
8102 : {
8103 168 : rte = rt_fetch(varno, dpns->rtable);
8104 168 : attnum = varattno;
8105 : }
8106 78 : else if (varno == OUTER_VAR && dpns->outer_tlist)
8107 : {
8108 : TargetEntry *tle;
8109 : deparse_namespace save_dpns;
8110 : const char *result;
8111 :
8112 60 : tle = get_tle_by_resno(dpns->outer_tlist, varattno);
8113 60 : if (!tle)
8114 0 : elog(ERROR, "bogus varattno for OUTER_VAR var: %d", varattno);
8115 :
8116 : Assert(netlevelsup == 0);
8117 60 : push_child_plan(dpns, dpns->outer_plan, &save_dpns);
8118 :
8119 60 : result = get_name_for_var_field((Var *) tle->expr, fieldno,
8120 : levelsup, context);
8121 :
8122 60 : pop_child_plan(dpns, &save_dpns);
8123 60 : return result;
8124 : }
8125 18 : else if (varno == INNER_VAR && dpns->inner_tlist)
8126 : {
8127 : TargetEntry *tle;
8128 : deparse_namespace save_dpns;
8129 : const char *result;
8130 :
8131 18 : tle = get_tle_by_resno(dpns->inner_tlist, varattno);
8132 18 : if (!tle)
8133 0 : elog(ERROR, "bogus varattno for INNER_VAR var: %d", varattno);
8134 :
8135 : Assert(netlevelsup == 0);
8136 18 : push_child_plan(dpns, dpns->inner_plan, &save_dpns);
8137 :
8138 18 : result = get_name_for_var_field((Var *) tle->expr, fieldno,
8139 : levelsup, context);
8140 :
8141 18 : pop_child_plan(dpns, &save_dpns);
8142 18 : return result;
8143 : }
8144 0 : else if (varno == INDEX_VAR && dpns->index_tlist)
8145 : {
8146 : TargetEntry *tle;
8147 : const char *result;
8148 :
8149 0 : tle = get_tle_by_resno(dpns->index_tlist, varattno);
8150 0 : if (!tle)
8151 0 : elog(ERROR, "bogus varattno for INDEX_VAR var: %d", varattno);
8152 :
8153 : Assert(netlevelsup == 0);
8154 :
8155 0 : result = get_name_for_var_field((Var *) tle->expr, fieldno,
8156 : levelsup, context);
8157 :
8158 0 : return result;
8159 : }
8160 : else
8161 : {
8162 0 : elog(ERROR, "bogus varno: %d", varno);
8163 : return NULL; /* keep compiler quiet */
8164 : }
8165 :
8166 168 : if (attnum == InvalidAttrNumber)
8167 : {
8168 : /* Var is whole-row reference to RTE, so select the right field */
8169 24 : 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 144 : expr = (Node *) var; /* default if we can't drill down */
8180 :
8181 144 : switch (rte->rtekind)
8182 : {
8183 0 : 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 0 : break;
8194 72 : case RTE_SUBQUERY:
8195 : /* Subselect-in-FROM: examine sub-select's output expr */
8196 : {
8197 72 : if (rte->subquery)
8198 : {
8199 42 : TargetEntry *ste = get_tle_by_resno(rte->subquery->targetList,
8200 : attnum);
8201 :
8202 42 : if (ste == NULL || ste->resjunk)
8203 0 : elog(ERROR, "subquery %s does not have attribute %d",
8204 : rte->eref->aliasname, attnum);
8205 42 : expr = (Node *) ste->expr;
8206 42 : 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 18 : List *save_nslist = context->namespaces;
8218 : List *parent_namespaces;
8219 : deparse_namespace mydpns;
8220 : const char *result;
8221 :
8222 18 : parent_namespaces = list_copy_tail(context->namespaces,
8223 : netlevelsup);
8224 :
8225 18 : set_deparse_for_query(&mydpns, rte->subquery,
8226 : parent_namespaces);
8227 :
8228 18 : context->namespaces = lcons(&mydpns, parent_namespaces);
8229 :
8230 18 : result = get_name_for_var_field((Var *) expr, fieldno,
8231 : 0, context);
8232 :
8233 18 : context->namespaces = save_nslist;
8234 :
8235 18 : 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 30 : if (!dpns->inner_plan)
8260 : {
8261 12 : char *dummy_name = palloc(32);
8262 :
8263 : Assert(dpns->plan && IsA(dpns->plan, Result));
8264 12 : snprintf(dummy_name, 32, "f%d", fieldno);
8265 12 : return dummy_name;
8266 : }
8267 : Assert(dpns->plan && IsA(dpns->plan, SubqueryScan));
8268 :
8269 18 : tle = get_tle_by_resno(dpns->inner_tlist, attnum);
8270 18 : if (!tle)
8271 0 : elog(ERROR, "bogus varattno for subquery var: %d",
8272 : attnum);
8273 : Assert(netlevelsup == 0);
8274 18 : push_child_plan(dpns, dpns->inner_plan, &save_dpns);
8275 :
8276 18 : result = get_name_for_var_field((Var *) tle->expr, fieldno,
8277 : levelsup, context);
8278 :
8279 18 : pop_child_plan(dpns, &save_dpns);
8280 18 : return result;
8281 : }
8282 : }
8283 24 : break;
8284 0 : case RTE_JOIN:
8285 : /* Join RTE --- recursively inspect the alias variable */
8286 0 : if (rte->joinaliasvars == NIL)
8287 0 : elog(ERROR, "cannot decompile join alias var in plan tree");
8288 : Assert(attnum > 0 && attnum <= list_length(rte->joinaliasvars));
8289 0 : expr = (Node *) list_nth(rte->joinaliasvars, attnum - 1);
8290 : Assert(expr != NULL);
8291 : /* we intentionally don't strip implicit coercions here */
8292 0 : if (IsA(expr, Var))
8293 0 : return get_name_for_var_field((Var *) expr, fieldno,
8294 0 : var->varlevelsup + levelsup,
8295 : context);
8296 : /* else fall through to inspect the expression */
8297 0 : break;
8298 0 : 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 0 : break;
8306 72 : case RTE_CTE:
8307 : /* CTE reference: examine subquery's output expr */
8308 : {
8309 72 : CommonTableExpr *cte = NULL;
8310 : Index ctelevelsup;
8311 : ListCell *lc;
8312 :
8313 : /*
8314 : * Try to find the referenced CTE using the namespace stack.
8315 : */
8316 72 : ctelevelsup = rte->ctelevelsup + netlevelsup;
8317 72 : if (ctelevelsup >= list_length(context->namespaces))
8318 12 : lc = NULL;
8319 : else
8320 : {
8321 : deparse_namespace *ctedpns;
8322 :
8323 : ctedpns = (deparse_namespace *)
8324 60 : list_nth(context->namespaces, ctelevelsup);
8325 66 : foreach(lc, ctedpns->ctes)
8326 : {
8327 36 : cte = (CommonTableExpr *) lfirst(lc);
8328 36 : if (strcmp(cte->ctename, rte->ctename) == 0)
8329 30 : break;
8330 : }
8331 : }
8332 72 : if (lc != NULL)
8333 : {
8334 30 : Query *ctequery = (Query *) cte->ctequery;
8335 30 : TargetEntry *ste = get_tle_by_resno(GetCTETargetList(cte),
8336 : attnum);
8337 :
8338 30 : if (ste == NULL || ste->resjunk)
8339 0 : elog(ERROR, "CTE %s does not have attribute %d",
8340 : rte->eref->aliasname, attnum);
8341 30 : expr = (Node *) ste->expr;
8342 30 : 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 18 : List *save_nslist = context->namespaces;
8352 : List *parent_namespaces;
8353 : deparse_namespace mydpns;
8354 : const char *result;
8355 :
8356 18 : parent_namespaces = list_copy_tail(context->namespaces,
8357 : ctelevelsup);
8358 :
8359 18 : set_deparse_for_query(&mydpns, ctequery,
8360 : parent_namespaces);
8361 :
8362 18 : context->namespaces = lcons(&mydpns, parent_namespaces);
8363 :
8364 18 : result = get_name_for_var_field((Var *) expr, fieldno,
8365 : 0, context);
8366 :
8367 18 : context->namespaces = save_nslist;
8368 :
8369 18 : 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 42 : if (!dpns->inner_plan)
8391 : {
8392 6 : char *dummy_name = palloc(32);
8393 :
8394 : Assert(dpns->plan && IsA(dpns->plan, Result));
8395 6 : snprintf(dummy_name, 32, "f%d", fieldno);
8396 6 : return dummy_name;
8397 : }
8398 : Assert(dpns->plan && (IsA(dpns->plan, CteScan) ||
8399 : IsA(dpns->plan, WorkTableScan)));
8400 :
8401 36 : tle = get_tle_by_resno(dpns->inner_tlist, attnum);
8402 36 : if (!tle)
8403 0 : elog(ERROR, "bogus varattno for subquery var: %d",
8404 : attnum);
8405 : Assert(netlevelsup == 0);
8406 36 : push_child_plan(dpns, dpns->inner_plan, &save_dpns);
8407 :
8408 36 : result = get_name_for_var_field((Var *) tle->expr, fieldno,
8409 : levelsup, context);
8410 :
8411 36 : pop_child_plan(dpns, &save_dpns);
8412 36 : return result;
8413 : }
8414 : }
8415 12 : break;
8416 0 : 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 0 : 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 36 : 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 36 : 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 : */
8444 : static Node *
8445 6708 : find_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 6708 : *dpns_p = NULL;
8450 6708 : *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 6708 : if (param->paramkind == PARAM_EXEC)
8458 : {
8459 : deparse_namespace *dpns;
8460 : Plan *child_plan;
8461 : ListCell *lc;
8462 :
8463 5834 : dpns = (deparse_namespace *) linitial(context->namespaces);
8464 5834 : child_plan = dpns->plan;
8465 :
8466 10334 : foreach(lc, dpns->ancestors)
8467 : {
8468 8726 : Node *ancestor = (Node *) lfirst(lc);
8469 : ListCell *lc2;
8470 :
8471 : /*
8472 : * NestLoops transmit params to their inner child only.
8473 : */
8474 8726 : if (IsA(ancestor, NestLoop) &&
8475 3798 : child_plan == innerPlan(ancestor))
8476 : {
8477 3714 : NestLoop *nl = (NestLoop *) ancestor;
8478 :
8479 4670 : foreach(lc2, nl->nestParams)
8480 : {
8481 4538 : NestLoopParam *nlp = (NestLoopParam *) lfirst(lc2);
8482 :
8483 4538 : if (nlp->paramno == param->paramid)
8484 : {
8485 : /* Found a match, so return it */
8486 3582 : *dpns_p = dpns;
8487 3582 : *ancestor_cell_p = lc;
8488 3582 : return (Node *) nlp->paramval;
8489 : }
8490 : }
8491 : }
8492 :
8493 : /*
8494 : * If ancestor is a SubPlan, check the arguments it provides.
8495 : */
8496 5144 : if (IsA(ancestor, SubPlan))
8497 : {
8498 998 : SubPlan *subplan = (SubPlan *) ancestor;
8499 : ListCell *lc3;
8500 : ListCell *lc4;
8501 :
8502 1334 : forboth(lc3, subplan->parParam, lc4, subplan->args)
8503 : {
8504 980 : int paramid = lfirst_int(lc3);
8505 980 : Node *arg = (Node *) lfirst(lc4);
8506 :
8507 980 : 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 644 : for_each_cell(rest, dpns->ancestors,
8518 : lnext(dpns->ancestors, lc))
8519 : {
8520 644 : Node *ancestor2 = (Node *) lfirst(rest);
8521 :
8522 644 : if (!IsA(ancestor2, SubPlan))
8523 : {
8524 644 : *dpns_p = dpns;
8525 644 : *ancestor_cell_p = rest;
8526 644 : return arg;
8527 : }
8528 : }
8529 0 : elog(ERROR, "SubPlan cannot be outermost ancestor");
8530 : }
8531 : }
8532 :
8533 : /* SubPlan isn't a kind of Plan, so skip the rest */
8534 354 : 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 4146 : child_plan = (Plan *) ancestor;
8544 : }
8545 : }
8546 :
8547 : /* No referent found */
8548 2482 : 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 : */
8558 : static SubPlan *
8559 2482 : find_param_generator(Param *param, deparse_context *context, int *column_p)
8560 : {
8561 : /* Initialize output parameter to prevent compiler warnings */
8562 2482 : *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 2482 : if (param->paramkind == PARAM_EXEC)
8571 : {
8572 : SubPlan *result;
8573 : deparse_namespace *dpns;
8574 : ListCell *lc;
8575 :
8576 1608 : dpns = (deparse_namespace *) linitial(context->namespaces);
8577 :
8578 : /* First check the innermost plan node's initplans */
8579 1608 : result = find_param_generator_initplan(param, dpns->plan, column_p);
8580 1608 : if (result)
8581 474 : 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 5828 : foreach_node(TargetEntry, tle, dpns->plan->targetlist)
8590 : {
8591 3664 : if (tle->expr && IsA(tle->expr, SubPlan))
8592 : {
8593 100 : SubPlan *subplan = (SubPlan *) tle->expr;
8594 :
8595 100 : if (subplan->subLinkType == MULTIEXPR_SUBLINK)
8596 : {
8597 78 : foreach_int(paramid, subplan->setParam)
8598 : {
8599 78 : if (paramid == param->paramid)
8600 : {
8601 : /* Found a match, so return it. */
8602 52 : *column_p = foreach_current_index(paramid);
8603 52 : return subplan;
8604 : }
8605 : }
8606 : }
8607 : }
8608 : }
8609 :
8610 : /* No luck, so check the ancestor nodes */
8611 1412 : foreach(lc, dpns->ancestors)
8612 : {
8613 1412 : Node *ancestor = (Node *) lfirst(lc);
8614 :
8615 : /*
8616 : * If ancestor is a SubPlan, check the paramIds it provides.
8617 : */
8618 1412 : if (IsA(ancestor, SubPlan))
8619 : {
8620 210 : SubPlan *subplan = (SubPlan *) ancestor;
8621 :
8622 236 : foreach_int(paramid, subplan->paramIds)
8623 : {
8624 236 : if (paramid == param->paramid)
8625 : {
8626 : /* Found a match, so return it. */
8627 210 : *column_p = foreach_current_index(paramid);
8628 210 : return subplan;
8629 : }
8630 : }
8631 :
8632 : /* SubPlan isn't a kind of Plan, so skip the rest */
8633 0 : continue;
8634 : }
8635 :
8636 : /*
8637 : * Otherwise, it's some kind of Plan node, so check its initplans.
8638 : */
8639 1202 : result = find_param_generator_initplan(param, (Plan *) ancestor,
8640 : column_p);
8641 1202 : if (result)
8642 872 : return result;
8643 :
8644 : /* No luck, crawl up to next ancestor */
8645 : }
8646 : }
8647 :
8648 : /* No generator found */
8649 874 : return NULL;
8650 : }
8651 :
8652 : /*
8653 : * Subroutine for find_param_generator: search one Plan node's initplans
8654 : */
8655 : static SubPlan *
8656 2810 : find_param_generator_initplan(Param *param, Plan *plan, int *column_p)
8657 : {
8658 4414 : foreach_node(SubPlan, subplan, plan->initPlan)
8659 : {
8660 1772 : foreach_int(paramid, subplan->setParam)
8661 : {
8662 1492 : if (paramid == param->paramid)
8663 : {
8664 : /* Found a match, so return it. */
8665 1346 : *column_p = foreach_current_index(paramid);
8666 1346 : return subplan;
8667 : }
8668 : }
8669 : }
8670 1464 : return NULL;
8671 : }
8672 :
8673 : /*
8674 : * Display a Param appropriately.
8675 : */
8676 : static void
8677 6690 : get_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 6690 : expr = find_param_referent(param, context, &dpns, &ancestor_cell);
8691 6690 : 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 4208 : 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 4208 : save_varprefix = context->varprefix;
8706 4208 : 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 4220 : need_paren = !(IsA(expr, Var) ||
8714 12 : IsA(expr, Aggref) ||
8715 12 : IsA(expr, GroupingFunc) ||
8716 6 : IsA(expr, Param));
8717 4208 : if (need_paren)
8718 0 : appendStringInfoChar(context->buf, '(');
8719 :
8720 4208 : get_rule_expr(expr, context, false);
8721 :
8722 4208 : if (need_paren)
8723 0 : appendStringInfoChar(context->buf, ')');
8724 :
8725 4208 : context->varprefix = save_varprefix;
8726 :
8727 4208 : pop_ancestor_plan(dpns, &save_dpns);
8728 :
8729 4208 : 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 2482 : subplan = find_param_generator(param, context, &column);
8741 2482 : if (subplan)
8742 : {
8743 1608 : appendStringInfo(context->buf, "(%s%s).col%d",
8744 1608 : subplan->useHashTable ? "hashed " : "",
8745 : subplan->plan_name, column + 1);
8746 :
8747 1608 : return;
8748 : }
8749 :
8750 : /*
8751 : * If it's an external parameter, see if the outermost namespace provides
8752 : * function argument names.
8753 : */
8754 874 : if (param->paramkind == PARAM_EXTERN && context->namespaces != NIL)
8755 : {
8756 874 : dpns = llast(context->namespaces);
8757 874 : if (dpns->argnames &&
8758 68 : param->paramid > 0 &&
8759 68 : param->paramid <= dpns->numargs)
8760 : {
8761 68 : char *argname = dpns->argnames[param->paramid - 1];
8762 :
8763 68 : if (argname)
8764 : {
8765 68 : 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 156 : foreach(lc, context->namespaces)
8775 : {
8776 118 : deparse_namespace *depns = lfirst(lc);
8777 :
8778 118 : if (depns->rtable_names != NIL)
8779 : {
8780 30 : should_qualify = true;
8781 30 : break;
8782 : }
8783 : }
8784 68 : if (should_qualify)
8785 : {
8786 30 : appendStringInfoString(context->buf, quote_identifier(dpns->funcname));
8787 30 : appendStringInfoChar(context->buf, '.');
8788 : }
8789 :
8790 68 : appendStringInfoString(context->buf, quote_identifier(argname));
8791 68 : 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 806 : 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 : */
8813 : static const char *
8814 150 : get_simple_binary_op_name(OpExpr *expr)
8815 : {
8816 150 : List *args = expr->args;
8817 :
8818 150 : if (list_length(args) == 2)
8819 : {
8820 : /* binary operator */
8821 150 : Node *arg1 = (Node *) linitial(args);
8822 150 : Node *arg2 = (Node *) lsecond(args);
8823 : const char *op;
8824 :
8825 150 : op = generate_operator_name(expr->opno, exprType(arg1), exprType(arg2));
8826 150 : if (strlen(op) == 1)
8827 150 : return op;
8828 : }
8829 0 : 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 : */
8839 : static bool
8840 5476 : isSimpleNode(Node *node, Node *parentNode, int prettyFlags)
8841 : {
8842 5476 : if (!node)
8843 0 : return false;
8844 :
8845 5476 : switch (nodeTag(node))
8846 : {
8847 4620 : 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 4620 : return true;
8855 :
8856 454 : 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 454 : return true;
8874 :
8875 : /* CASE keywords act as parentheses */
8876 0 : case T_CaseExpr:
8877 0 : return true;
8878 :
8879 54 : case T_FieldSelect:
8880 :
8881 : /*
8882 : * appears simple since . has top precedence, unless parent is
8883 : * T_FieldSelect itself!
8884 : */
8885 54 : return !IsA(parentNode, FieldSelect);
8886 :
8887 0 : case T_FieldStore:
8888 :
8889 : /*
8890 : * treat like FieldSelect (probably doesn't matter)
8891 : */
8892 0 : return !IsA(parentNode, FieldStore);
8893 :
8894 0 : case T_CoerceToDomain:
8895 : /* maybe simple, check args */
8896 0 : return isSimpleNode((Node *) ((CoerceToDomain *) node)->arg,
8897 : node, prettyFlags);
8898 18 : case T_RelabelType:
8899 18 : return isSimpleNode((Node *) ((RelabelType *) node)->arg,
8900 : node, prettyFlags);
8901 0 : case T_CoerceViaIO:
8902 0 : return isSimpleNode((Node *) ((CoerceViaIO *) node)->arg,
8903 : node, prettyFlags);
8904 0 : case T_ArrayCoerceExpr:
8905 0 : return isSimpleNode((Node *) ((ArrayCoerceExpr *) node)->arg,
8906 : node, prettyFlags);
8907 0 : case T_ConvertRowtypeExpr:
8908 0 : return isSimpleNode((Node *) ((ConvertRowtypeExpr *) node)->arg,
8909 : node, prettyFlags);
8910 0 : case T_ReturningExpr:
8911 0 : return isSimpleNode((Node *) ((ReturningExpr *) node)->retexpr,
8912 : node, prettyFlags);
8913 :
8914 276 : case T_OpExpr:
8915 : {
8916 : /* depends on parent node type; needs further checking */
8917 276 : 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 78 : op = get_simple_binary_op_name((OpExpr *) node);
8927 78 : if (!op)
8928 0 : return false;
8929 :
8930 : /* We know only the basic operators + - and * / % */
8931 78 : is_lopriop = (strchr("+-", *op) != NULL);
8932 78 : is_hipriop = (strchr("*/%", *op) != NULL);
8933 78 : if (!(is_lopriop || is_hipriop))
8934 6 : return false;
8935 :
8936 72 : parentOp = get_simple_binary_op_name((OpExpr *) parentNode);
8937 72 : if (!parentOp)
8938 0 : return false;
8939 :
8940 72 : is_lopriparent = (strchr("+-", *parentOp) != NULL);
8941 72 : is_hipriparent = (strchr("*/%", *parentOp) != NULL);
8942 72 : if (!(is_lopriparent || is_hipriparent))
8943 0 : return false;
8944 :
8945 72 : if (is_hipriop && is_lopriparent)
8946 12 : return true; /* op binds tighter than parent */
8947 :
8948 60 : if (is_lopriop && is_hipriparent)
8949 48 : 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 12 : if (node == (Node *) linitial(((OpExpr *) parentNode)->args))
8956 6 : return true;
8957 :
8958 6 : 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 228 : switch (nodeTag(parentNode))
8970 : {
8971 36 : case T_FuncExpr:
8972 : {
8973 : /* special handling for casts and COERCE_SQL_SYNTAX */
8974 36 : CoercionForm type = ((FuncExpr *) parentNode)->funcformat;
8975 :
8976 36 : if (type == COERCE_EXPLICIT_CAST ||
8977 6 : type == COERCE_IMPLICIT_CAST ||
8978 : type == COERCE_SQL_SYNTAX)
8979 36 : return false;
8980 0 : return true; /* own parentheses */
8981 : }
8982 162 : 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 162 : return true;
8995 30 : default:
8996 30 : return false;
8997 : }
8998 :
8999 18 : case T_BoolExpr:
9000 18 : switch (nodeTag(parentNode))
9001 : {
9002 18 : case T_BoolExpr:
9003 18 : if (prettyFlags & PRETTYFLAG_PAREN)
9004 : {
9005 : BoolExprType type;
9006 : BoolExprType parentType;
9007 :
9008 18 : type = ((BoolExpr *) node)->boolop;
9009 18 : parentType = ((BoolExpr *) parentNode)->boolop;
9010 : switch (type)
9011 : {
9012 12 : case NOT_EXPR:
9013 : case AND_EXPR:
9014 12 : if (parentType == AND_EXPR || parentType == OR_EXPR)
9015 12 : return true;
9016 0 : break;
9017 6 : case OR_EXPR:
9018 6 : if (parentType == OR_EXPR)
9019 0 : return true;
9020 6 : break;
9021 : }
9022 0 : }
9023 6 : return false;
9024 0 : case T_FuncExpr:
9025 : {
9026 : /* special handling for casts and COERCE_SQL_SYNTAX */
9027 0 : CoercionForm type = ((FuncExpr *) parentNode)->funcformat;
9028 :
9029 0 : if (type == COERCE_EXPLICIT_CAST ||
9030 0 : type == COERCE_IMPLICIT_CAST ||
9031 : type == COERCE_SQL_SYNTAX)
9032 0 : return false;
9033 0 : return true; /* own parentheses */
9034 : }
9035 0 : 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 0 : return true;
9048 0 : default:
9049 0 : return false;
9050 : }
9051 :
9052 0 : case T_JsonValueExpr:
9053 : /* maybe simple, check args */
9054 0 : return isSimpleNode((Node *) ((JsonValueExpr *) node)->raw_expr,
9055 : node, prettyFlags);
9056 :
9057 6 : default:
9058 6 : break;
9059 : }
9060 : /* those we don't know: in dubio complexo */
9061 6 : 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 : */
9071 : static void
9072 29482 : appendContextKeyword(deparse_context *context, const char *str,
9073 : int indentBefore, int indentAfter, int indentPlus)
9074 : {
9075 29482 : StringInfo buf = context->buf;
9076 :
9077 29482 : if (PRETTY_INDENT(context))
9078 : {
9079 : int indentAmount;
9080 :
9081 28566 : context->indentLevel += indentBefore;
9082 :
9083 : /* remove any trailing spaces currently in the buffer ... */
9084 28566 : removeStringInfoSpaces(buf);
9085 : /* ... then add a newline and some spaces */
9086 28566 : appendStringInfoChar(buf, '\n');
9087 :
9088 28566 : if (context->indentLevel < PRETTYINDENT_LIMIT)
9089 28566 : 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 0 : indentAmount = PRETTYINDENT_LIMIT +
9102 0 : (context->indentLevel - PRETTYINDENT_LIMIT) /
9103 : (PRETTYINDENT_STD / 2);
9104 0 : indentAmount %= PRETTYINDENT_LIMIT;
9105 : /* scale/wrap logic affects indentLevel, but not indentPlus */
9106 0 : indentAmount += indentPlus;
9107 : }
9108 28566 : appendStringInfoSpaces(buf, indentAmount);
9109 :
9110 28566 : appendStringInfoString(buf, str);
9111 :
9112 28566 : context->indentLevel += indentAfter;
9113 28566 : if (context->indentLevel < 0)
9114 0 : context->indentLevel = 0;
9115 : }
9116 : else
9117 916 : appendStringInfoString(buf, str);
9118 29482 : }
9119 :
9120 : /*
9121 : * removeStringInfoSpaces - delete trailing spaces from a buffer.
9122 : *
9123 : * Possibly this should move to stringinfo.c at some point.
9124 : */
9125 : static void
9126 29028 : removeStringInfoSpaces(StringInfo str)
9127 : {
9128 45374 : while (str->len > 0 && str->data[str->len - 1] == ' ')
9129 16346 : str->data[--(str->len)] = '\0';
9130 29028 : }
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 : */
9144 : static void
9145 158898 : get_rule_expr_paren(Node *node, deparse_context *context,
9146 : bool showimplicit, Node *parentNode)
9147 : {
9148 : bool need_paren;
9149 :
9150 164356 : need_paren = PRETTY_PAREN(context) &&
9151 5458 : !isSimpleNode(node, parentNode, context->prettyFlags);
9152 :
9153 158898 : if (need_paren)
9154 138 : appendStringInfoChar(context->buf, '(');
9155 :
9156 158898 : get_rule_expr(node, context, showimplicit);
9157 :
9158 158898 : if (need_paren)
9159 138 : appendStringInfoChar(context->buf, ')');
9160 158898 : }
9161 :
9162 : static void
9163 84 : get_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 84 : 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 84 : if ((int) behavior->btype < 0 || behavior->btype >= lengthof(behavior_names))
9184 0 : elog(ERROR, "invalid json behavior type: %d", behavior->btype);
9185 :
9186 84 : appendStringInfoString(context->buf, behavior_names[behavior->btype]);
9187 :
9188 84 : if (behavior->btype == JSON_BEHAVIOR_DEFAULT)
9189 18 : get_rule_expr(behavior->expr, context, false);
9190 :
9191 84 : appendStringInfo(context->buf, " ON %s", on);
9192 84 : }
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 : */
9200 : static void
9201 456 : get_json_expr_options(JsonExpr *jsexpr, deparse_context *context,
9202 : JsonBehaviorType default_behavior)
9203 : {
9204 456 : if (jsexpr->op == JSON_QUERY_OP)
9205 : {
9206 210 : if (jsexpr->wrapper == JSW_CONDITIONAL)
9207 12 : appendStringInfoString(context->buf, " WITH CONDITIONAL WRAPPER");
9208 198 : else if (jsexpr->wrapper == JSW_UNCONDITIONAL)
9209 30 : appendStringInfoString(context->buf, " WITH UNCONDITIONAL WRAPPER");
9210 : /* The default */
9211 168 : else if (jsexpr->wrapper == JSW_NONE || jsexpr->wrapper == JSW_UNSPEC)
9212 168 : appendStringInfoString(context->buf, " WITHOUT WRAPPER");
9213 :
9214 210 : if (jsexpr->omit_quotes)
9215 42 : appendStringInfoString(context->buf, " OMIT QUOTES");
9216 : /* The default */
9217 : else
9218 168 : appendStringInfoString(context->buf, " KEEP QUOTES");
9219 : }
9220 :
9221 456 : if (jsexpr->on_empty && jsexpr->on_empty->btype != default_behavior)
9222 30 : get_json_behavior(jsexpr->on_empty, context, "EMPTY");
9223 :
9224 456 : if (jsexpr->on_error && jsexpr->on_error->btype != default_behavior)
9225 48 : get_json_behavior(jsexpr->on_error, context, "ERROR");
9226 456 : }
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 : */
9241 : static void
9242 325638 : get_rule_expr(Node *node, deparse_context *context,
9243 : bool showimplicit)
9244 : {
9245 325638 : StringInfo buf = context->buf;
9246 :
9247 325638 : if (node == NULL)
9248 90 : return;
9249 :
9250 : /* Guard against excessively long or deeply-nested queries */
9251 325548 : CHECK_FOR_INTERRUPTS();
9252 325548 : 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 325548 : switch (nodeTag(node))
9262 : {
9263 150048 : case T_Var:
9264 150048 : (void) get_variable((Var *) node, 0, false, context);
9265 150048 : break;
9266 :
9267 60680 : case T_Const:
9268 60680 : get_const_expr((Const *) node, context, 0);
9269 60680 : break;
9270 :
9271 6690 : case T_Param:
9272 6690 : get_parameter((Param *) node, context);
9273 6690 : break;
9274 :
9275 1716 : case T_Aggref:
9276 1716 : get_agg_expr((Aggref *) node, context, (Aggref *) node);
9277 1716 : break;
9278 :
9279 112 : case T_GroupingFunc:
9280 : {
9281 112 : GroupingFunc *gexpr = (GroupingFunc *) node;
9282 :
9283 112 : appendStringInfoString(buf, "GROUPING(");
9284 112 : get_rule_expr((Node *) gexpr->args, context, true);
9285 112 : appendStringInfoChar(buf, ')');
9286 : }
9287 112 : break;
9288 :
9289 306 : case T_WindowFunc:
9290 306 : get_windowfunc_expr((WindowFunc *) node, context);
9291 306 : break;
9292 :
9293 6 : case T_MergeSupportFunc:
9294 6 : appendStringInfoString(buf, "MERGE_ACTION()");
9295 6 : break;
9296 :
9297 328 : case T_SubscriptingRef:
9298 : {
9299 328 : 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 328 : if (IsA(sbsref->refexpr, CaseTestExpr))
9311 : {
9312 : Assert(sbsref->refassgnexpr);
9313 0 : get_rule_expr((Node *) sbsref->refassgnexpr,
9314 : context, showimplicit);
9315 0 : 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 482 : need_parens = !IsA(sbsref->refexpr, Var) &&
9325 154 : !IsA(sbsref->refexpr, FieldSelect);
9326 328 : if (need_parens)
9327 94 : appendStringInfoChar(buf, '(');
9328 328 : get_rule_expr((Node *) sbsref->refexpr, context, showimplicit);
9329 328 : if (need_parens)
9330 94 : 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 328 : 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 12 : refassgnexpr = processIndirection(node, context);
9352 12 : appendStringInfoString(buf, " := ");
9353 12 : get_rule_expr(refassgnexpr, context, showimplicit);
9354 : }
9355 : else
9356 : {
9357 : /* Just an ordinary container fetch, so print subscripts */
9358 316 : printSubscripts(sbsref, context);
9359 : }
9360 : }
9361 328 : break;
9362 :
9363 12320 : case T_FuncExpr:
9364 12320 : get_func_expr((FuncExpr *) node, context, showimplicit);
9365 12320 : break;
9366 :
9367 30 : case T_NamedArgExpr:
9368 : {
9369 30 : NamedArgExpr *na = (NamedArgExpr *) node;
9370 :
9371 30 : appendStringInfo(buf, "%s => ", quote_identifier(na->name));
9372 30 : get_rule_expr((Node *) na->arg, context, showimplicit);
9373 : }
9374 30 : break;
9375 :
9376 59368 : case T_OpExpr:
9377 59368 : get_oper_expr((OpExpr *) node, context);
9378 59368 : break;
9379 :
9380 18 : case T_DistinctExpr:
9381 : {
9382 18 : DistinctExpr *expr = (DistinctExpr *) node;
9383 18 : List *args = expr->args;
9384 18 : Node *arg1 = (Node *) linitial(args);
9385 18 : Node *arg2 = (Node *) lsecond(args);
9386 :
9387 18 : if (!PRETTY_PAREN(context))
9388 12 : appendStringInfoChar(buf, '(');
9389 18 : get_rule_expr_paren(arg1, context, true, node);
9390 18 : appendStringInfoString(buf, " IS DISTINCT FROM ");
9391 18 : get_rule_expr_paren(arg2, context, true, node);
9392 18 : if (!PRETTY_PAREN(context))
9393 12 : appendStringInfoChar(buf, ')');
9394 : }
9395 18 : break;
9396 :
9397 160 : case T_NullIfExpr:
9398 : {
9399 160 : NullIfExpr *nullifexpr = (NullIfExpr *) node;
9400 :
9401 160 : appendStringInfoString(buf, "NULLIF(");
9402 160 : get_rule_expr((Node *) nullifexpr->args, context, true);
9403 160 : appendStringInfoChar(buf, ')');
9404 : }
9405 160 : break;
9406 :
9407 2894 : case T_ScalarArrayOpExpr:
9408 : {
9409 2894 : ScalarArrayOpExpr *expr = (ScalarArrayOpExpr *) node;
9410 2894 : List *args = expr->args;
9411 2894 : Node *arg1 = (Node *) linitial(args);
9412 2894 : Node *arg2 = (Node *) lsecond(args);
9413 :
9414 2894 : if (!PRETTY_PAREN(context))
9415 2882 : appendStringInfoChar(buf, '(');
9416 2894 : get_rule_expr_paren(arg1, context, true, node);
9417 2894 : appendStringInfo(buf, " %s %s (",
9418 : generate_operator_name(expr->opno,
9419 : exprType(arg1),
9420 : get_base_element_type(exprType(arg2))),
9421 2894 : expr->useOr ? "ANY" : "ALL");
9422 2894 : 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 2894 : if (IsA(arg2, SubLink) &&
9437 6 : ((SubLink *) arg2)->subLinkType == EXPR_SUBLINK)
9438 6 : appendStringInfo(buf, "::%s",
9439 : format_type_with_typemod(exprType(arg2),
9440 : exprTypmod(arg2)));
9441 2894 : appendStringInfoChar(buf, ')');
9442 2894 : if (!PRETTY_PAREN(context))
9443 2882 : appendStringInfoChar(buf, ')');
9444 : }
9445 2894 : break;
9446 :
9447 11046 : case T_BoolExpr:
9448 : {
9449 11046 : BoolExpr *expr = (BoolExpr *) node;
9450 11046 : Node *first_arg = linitial(expr->args);
9451 : ListCell *arg;
9452 :
9453 11046 : switch (expr->boolop)
9454 : {
9455 8768 : case AND_EXPR:
9456 8768 : if (!PRETTY_PAREN(context))
9457 8702 : appendStringInfoChar(buf, '(');
9458 8768 : get_rule_expr_paren(first_arg, context,
9459 : false, node);
9460 19968 : for_each_from(arg, expr->args, 1)
9461 : {
9462 11200 : appendStringInfoString(buf, " AND ");
9463 11200 : get_rule_expr_paren((Node *) lfirst(arg), context,
9464 : false, node);
9465 : }
9466 8768 : if (!PRETTY_PAREN(context))
9467 8702 : appendStringInfoChar(buf, ')');
9468 8768 : break;
9469 :
9470 1912 : case OR_EXPR:
9471 1912 : if (!PRETTY_PAREN(context))
9472 1900 : appendStringInfoChar(buf, '(');
9473 1912 : get_rule_expr_paren(first_arg, context,
9474 : false, node);
9475 4538 : for_each_from(arg, expr->args, 1)
9476 : {
9477 2626 : appendStringInfoString(buf, " OR ");
9478 2626 : get_rule_expr_paren((Node *) lfirst(arg), context,
9479 : false, node);
9480 : }
9481 1912 : if (!PRETTY_PAREN(context))
9482 1900 : appendStringInfoChar(buf, ')');
9483 1912 : break;
9484 :
9485 366 : case NOT_EXPR:
9486 366 : if (!PRETTY_PAREN(context))
9487 354 : appendStringInfoChar(buf, '(');
9488 366 : appendStringInfoString(buf, "NOT ");
9489 366 : get_rule_expr_paren(first_arg, context,
9490 : false, node);
9491 366 : if (!PRETTY_PAREN(context))
9492 354 : appendStringInfoChar(buf, ')');
9493 366 : break;
9494 :
9495 0 : default:
9496 0 : elog(ERROR, "unrecognized boolop: %d",
9497 : (int) expr->boolop);
9498 : }
9499 : }
9500 11046 : break;
9501 :
9502 460 : case T_SubLink:
9503 460 : get_sublink_expr((SubLink *) node, context);
9504 460 : break;
9505 :
9506 712 : case T_SubPlan:
9507 : {
9508 712 : 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 712 : switch (subplan->subLinkType)
9519 : {
9520 90 : case EXISTS_SUBLINK:
9521 90 : appendStringInfoString(buf, "EXISTS(");
9522 : Assert(subplan->testexpr == NULL);
9523 90 : break;
9524 6 : case ALL_SUBLINK:
9525 6 : appendStringInfoString(buf, "(ALL ");
9526 : Assert(subplan->testexpr != NULL);
9527 6 : break;
9528 166 : case ANY_SUBLINK:
9529 166 : appendStringInfoString(buf, "(ANY ");
9530 : Assert(subplan->testexpr != NULL);
9531 166 : break;
9532 6 : case ROWCOMPARE_SUBLINK:
9533 : /* Parenthesizing the testexpr seems sufficient */
9534 6 : appendStringInfoChar(buf, '(');
9535 : Assert(subplan->testexpr != NULL);
9536 6 : break;
9537 406 : case EXPR_SUBLINK:
9538 : /* No need to decorate these subplan references */
9539 406 : appendStringInfoChar(buf, '(');
9540 : Assert(subplan->testexpr == NULL);
9541 406 : break;
9542 26 : case MULTIEXPR_SUBLINK:
9543 : /* MULTIEXPR isn't executed in the normal way */
9544 26 : appendStringInfoString(buf, "(rescan ");
9545 : Assert(subplan->testexpr == NULL);
9546 26 : break;
9547 12 : case ARRAY_SUBLINK:
9548 12 : appendStringInfoString(buf, "ARRAY(");
9549 : Assert(subplan->testexpr == NULL);
9550 12 : break;
9551 0 : case CTE_SUBLINK:
9552 : /* This case is unreachable within expressions */
9553 0 : appendStringInfoString(buf, "CTE(");
9554 : Assert(subplan->testexpr == NULL);
9555 0 : break;
9556 : }
9557 :
9558 712 : 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 178 : dpns = (deparse_namespace *) linitial(context->namespaces);
9572 178 : dpns->ancestors = lcons(subplan, dpns->ancestors);
9573 :
9574 178 : get_rule_expr(subplan->testexpr, context, showimplicit);
9575 178 : appendStringInfoChar(buf, ')');
9576 :
9577 178 : dpns->ancestors = list_delete_first(dpns->ancestors);
9578 : }
9579 : else
9580 : {
9581 : /* No referencing Params, so show the SubPlan's name */
9582 534 : if (subplan->useHashTable)
9583 0 : appendStringInfo(buf, "hashed %s)", subplan->plan_name);
9584 : else
9585 534 : appendStringInfo(buf, "%s)", subplan->plan_name);
9586 : }
9587 : }
9588 712 : break;
9589 :
9590 0 : case T_AlternativeSubPlan:
9591 : {
9592 0 : 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 0 : appendStringInfoString(buf, "(alternatives: ");
9602 0 : foreach(lc, asplan->subplans)
9603 : {
9604 0 : SubPlan *splan = lfirst_node(SubPlan, lc);
9605 :
9606 0 : if (splan->useHashTable)
9607 0 : appendStringInfo(buf, "hashed %s", splan->plan_name);
9608 : else
9609 0 : appendStringInfoString(buf, splan->plan_name);
9610 0 : if (lnext(asplan->subplans, lc))
9611 0 : appendStringInfoString(buf, " or ");
9612 : }
9613 0 : appendStringInfoChar(buf, ')');
9614 : }
9615 0 : break;
9616 :
9617 1118 : case T_FieldSelect:
9618 : {
9619 1118 : FieldSelect *fselect = (FieldSelect *) node;
9620 1118 : Node *arg = (Node *) fselect->arg;
9621 1118 : 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 2200 : need_parens = !IsA(arg, SubscriptingRef) &&
9632 1082 : !IsA(arg, FieldSelect);
9633 1118 : if (need_parens)
9634 1082 : appendStringInfoChar(buf, '(');
9635 1118 : get_rule_expr(arg, context, true);
9636 1118 : if (need_parens)
9637 1082 : appendStringInfoChar(buf, ')');
9638 :
9639 : /*
9640 : * Get and print the field name.
9641 : */
9642 1118 : fieldname = get_name_for_var_field((Var *) arg, fno,
9643 : 0, context);
9644 1118 : appendStringInfo(buf, ".%s", quote_identifier(fieldname));
9645 : }
9646 1118 : break;
9647 :
9648 6 : case T_FieldStore:
9649 : {
9650 6 : 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 6 : need_parens = (list_length(fstore->newvals) != 1);
9673 6 : if (need_parens)
9674 6 : appendStringInfoString(buf, "ROW(");
9675 6 : get_rule_expr((Node *) fstore->newvals, context, showimplicit);
9676 6 : if (need_parens)
9677 6 : appendStringInfoChar(buf, ')');
9678 : }
9679 6 : break;
9680 :
9681 2582 : case T_RelabelType:
9682 : {
9683 2582 : RelabelType *relabel = (RelabelType *) node;
9684 2582 : Node *arg = (Node *) relabel->arg;
9685 :
9686 2582 : if (relabel->relabelformat == COERCE_IMPLICIT_CAST &&
9687 2382 : !showimplicit)
9688 : {
9689 : /* don't show the implicit cast */
9690 74 : get_rule_expr_paren(arg, context, false, node);
9691 : }
9692 : else
9693 : {
9694 2508 : get_coercion_expr(arg, context,
9695 : relabel->resulttype,
9696 : relabel->resulttypmod,
9697 : node);
9698 : }
9699 : }
9700 2582 : break;
9701 :
9702 662 : case T_CoerceViaIO:
9703 : {
9704 662 : CoerceViaIO *iocoerce = (CoerceViaIO *) node;
9705 662 : Node *arg = (Node *) iocoerce->arg;
9706 :
9707 662 : if (iocoerce->coerceformat == COERCE_IMPLICIT_CAST &&
9708 24 : !showimplicit)
9709 : {
9710 : /* don't show the implicit cast */
9711 24 : get_rule_expr_paren(arg, context, false, node);
9712 : }
9713 : else
9714 : {
9715 638 : get_coercion_expr(arg, context,
9716 : iocoerce->resulttype,
9717 : -1,
9718 : node);
9719 : }
9720 : }
9721 662 : break;
9722 :
9723 48 : case T_ArrayCoerceExpr:
9724 : {
9725 48 : ArrayCoerceExpr *acoerce = (ArrayCoerceExpr *) node;
9726 48 : Node *arg = (Node *) acoerce->arg;
9727 :
9728 48 : if (acoerce->coerceformat == COERCE_IMPLICIT_CAST &&
9729 48 : !showimplicit)
9730 : {
9731 : /* don't show the implicit cast */
9732 0 : get_rule_expr_paren(arg, context, false, node);
9733 : }
9734 : else
9735 : {
9736 48 : get_coercion_expr(arg, context,
9737 : acoerce->resulttype,
9738 : acoerce->resulttypmod,
9739 : node);
9740 : }
9741 : }
9742 48 : break;
9743 :
9744 88 : case T_ConvertRowtypeExpr:
9745 : {
9746 88 : ConvertRowtypeExpr *convert = (ConvertRowtypeExpr *) node;
9747 88 : Node *arg = (Node *) convert->arg;
9748 :
9749 88 : if (convert->convertformat == COERCE_IMPLICIT_CAST &&
9750 82 : !showimplicit)
9751 : {
9752 : /* don't show the implicit cast */
9753 24 : get_rule_expr_paren(arg, context, false, node);
9754 : }
9755 : else
9756 : {
9757 64 : get_coercion_expr(arg, context,
9758 : convert->resulttype, -1,
9759 : node);
9760 : }
9761 : }
9762 88 : break;
9763 :
9764 90 : case T_CollateExpr:
9765 : {
9766 90 : CollateExpr *collate = (CollateExpr *) node;
9767 90 : Node *arg = (Node *) collate->arg;
9768 :
9769 90 : if (!PRETTY_PAREN(context))
9770 84 : appendStringInfoChar(buf, '(');
9771 90 : get_rule_expr_paren(arg, context, showimplicit, node);
9772 90 : appendStringInfo(buf, " COLLATE %s",
9773 : generate_collation_name(collate->collOid));
9774 90 : if (!PRETTY_PAREN(context))
9775 84 : appendStringInfoChar(buf, ')');
9776 : }
9777 90 : break;
9778 :
9779 594 : case T_CaseExpr:
9780 : {
9781 594 : CaseExpr *caseexpr = (CaseExpr *) node;
9782 : ListCell *temp;
9783 :
9784 594 : appendContextKeyword(context, "CASE",
9785 : 0, PRETTYINDENT_VAR, 0);
9786 594 : if (caseexpr->arg)
9787 : {
9788 174 : appendStringInfoChar(buf, ' ');
9789 174 : get_rule_expr((Node *) caseexpr->arg, context, true);
9790 : }
9791 2626 : foreach(temp, caseexpr->args)
9792 : {
9793 2032 : CaseWhen *when = (CaseWhen *) lfirst(temp);
9794 2032 : Node *w = (Node *) when->expr;
9795 :
9796 2032 : 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 748 : if (IsA(w, OpExpr))
9811 : {
9812 748 : List *args = ((OpExpr *) w)->args;
9813 :
9814 748 : if (list_length(args) == 2 &&
9815 748 : IsA(strip_implicit_coercions(linitial(args)),
9816 : CaseTestExpr))
9817 748 : w = (Node *) lsecond(args);
9818 : }
9819 : }
9820 :
9821 2032 : if (!PRETTY_INDENT(context))
9822 118 : appendStringInfoChar(buf, ' ');
9823 2032 : appendContextKeyword(context, "WHEN ",
9824 : 0, 0, 0);
9825 2032 : get_rule_expr(w, context, false);
9826 2032 : appendStringInfoString(buf, " THEN ");
9827 2032 : get_rule_expr((Node *) when->result, context, true);
9828 : }
9829 594 : if (!PRETTY_INDENT(context))
9830 108 : appendStringInfoChar(buf, ' ');
9831 594 : appendContextKeyword(context, "ELSE ",
9832 : 0, 0, 0);
9833 594 : get_rule_expr((Node *) caseexpr->defresult, context, true);
9834 594 : if (!PRETTY_INDENT(context))
9835 108 : appendStringInfoChar(buf, ' ');
9836 594 : appendContextKeyword(context, "END",
9837 : -PRETTYINDENT_VAR, 0, 0);
9838 : }
9839 594 : break;
9840 :
9841 0 : 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 0 : appendStringInfoString(buf, "CASE_TEST_EXPR");
9851 : }
9852 0 : break;
9853 :
9854 560 : case T_ArrayExpr:
9855 : {
9856 560 : ArrayExpr *arrayexpr = (ArrayExpr *) node;
9857 :
9858 560 : appendStringInfoString(buf, "ARRAY[");
9859 560 : get_rule_expr((Node *) arrayexpr->elements, context, true);
9860 560 : 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 560 : if (arrayexpr->elements == NIL)
9868 6 : appendStringInfo(buf, "::%s",
9869 : format_type_with_typemod(arrayexpr->array_typeid, -1));
9870 : }
9871 560 : break;
9872 :
9873 192 : case T_RowExpr:
9874 : {
9875 192 : RowExpr *rowexpr = (RowExpr *) node;
9876 192 : 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 192 : if (rowexpr->row_typeid != RECORDOID)
9887 : {
9888 54 : 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 192 : appendStringInfoString(buf, "ROW(");
9897 192 : sep = "";
9898 192 : i = 0;
9899 570 : foreach(arg, rowexpr->args)
9900 : {
9901 378 : Node *e = (Node *) lfirst(arg);
9902 :
9903 378 : if (tupdesc == NULL ||
9904 120 : !TupleDescAttr(tupdesc, i)->attisdropped)
9905 : {
9906 378 : appendStringInfoString(buf, sep);
9907 : /* Whole-row Vars need special treatment here */
9908 378 : get_rule_expr_toplevel(e, context, true);
9909 378 : sep = ", ";
9910 : }
9911 378 : i++;
9912 : }
9913 192 : if (tupdesc != NULL)
9914 : {
9915 54 : while (i < tupdesc->natts)
9916 : {
9917 0 : if (!TupleDescAttr(tupdesc, i)->attisdropped)
9918 : {
9919 0 : appendStringInfoString(buf, sep);
9920 0 : appendStringInfoString(buf, "NULL");
9921 0 : sep = ", ";
9922 : }
9923 0 : i++;
9924 : }
9925 :
9926 54 : ReleaseTupleDesc(tupdesc);
9927 : }
9928 192 : appendStringInfoChar(buf, ')');
9929 192 : if (rowexpr->row_format == COERCE_EXPLICIT_CAST)
9930 36 : appendStringInfo(buf, "::%s",
9931 : format_type_with_typemod(rowexpr->row_typeid, -1));
9932 : }
9933 192 : break;
9934 :
9935 96 : case T_RowCompareExpr:
9936 : {
9937 96 : 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 96 : appendStringInfoString(buf, "(ROW(");
9946 96 : 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 96 : appendStringInfo(buf, ") %s ROW(",
9956 96 : generate_operator_name(linitial_oid(rcexpr->opnos),
9957 96 : exprType(linitial(rcexpr->largs)),
9958 96 : exprType(linitial(rcexpr->rargs))));
9959 96 : get_rule_list_toplevel(rcexpr->rargs, context, true);
9960 96 : appendStringInfoString(buf, "))");
9961 : }
9962 96 : break;
9963 :
9964 1146 : case T_CoalesceExpr:
9965 : {
9966 1146 : CoalesceExpr *coalesceexpr = (CoalesceExpr *) node;
9967 :
9968 1146 : appendStringInfoString(buf, "COALESCE(");
9969 1146 : get_rule_expr((Node *) coalesceexpr->args, context, true);
9970 1146 : appendStringInfoChar(buf, ')');
9971 : }
9972 1146 : break;
9973 :
9974 36 : case T_MinMaxExpr:
9975 : {
9976 36 : MinMaxExpr *minmaxexpr = (MinMaxExpr *) node;
9977 :
9978 36 : switch (minmaxexpr->op)
9979 : {
9980 6 : case IS_GREATEST:
9981 6 : appendStringInfoString(buf, "GREATEST(");
9982 6 : break;
9983 30 : case IS_LEAST:
9984 30 : appendStringInfoString(buf, "LEAST(");
9985 30 : break;
9986 : }
9987 36 : get_rule_expr((Node *) minmaxexpr->args, context, true);
9988 36 : appendStringInfoChar(buf, ')');
9989 : }
9990 36 : break;
9991 :
9992 706 : case T_SQLValueFunction:
9993 : {
9994 706 : 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 706 : switch (svf->op)
10001 : {
10002 104 : case SVFOP_CURRENT_DATE:
10003 104 : appendStringInfoString(buf, "CURRENT_DATE");
10004 104 : break;
10005 12 : case SVFOP_CURRENT_TIME:
10006 12 : appendStringInfoString(buf, "CURRENT_TIME");
10007 12 : break;
10008 12 : case SVFOP_CURRENT_TIME_N:
10009 12 : appendStringInfo(buf, "CURRENT_TIME(%d)", svf->typmod);
10010 12 : break;
10011 12 : case SVFOP_CURRENT_TIMESTAMP:
10012 12 : appendStringInfoString(buf, "CURRENT_TIMESTAMP");
10013 12 : break;
10014 116 : case SVFOP_CURRENT_TIMESTAMP_N:
10015 116 : appendStringInfo(buf, "CURRENT_TIMESTAMP(%d)",
10016 : svf->typmod);
10017 116 : break;
10018 12 : case SVFOP_LOCALTIME:
10019 12 : appendStringInfoString(buf, "LOCALTIME");
10020 12 : break;
10021 12 : case SVFOP_LOCALTIME_N:
10022 12 : appendStringInfo(buf, "LOCALTIME(%d)", svf->typmod);
10023 12 : break;
10024 30 : case SVFOP_LOCALTIMESTAMP:
10025 30 : appendStringInfoString(buf, "LOCALTIMESTAMP");
10026 30 : break;
10027 18 : case SVFOP_LOCALTIMESTAMP_N:
10028 18 : appendStringInfo(buf, "LOCALTIMESTAMP(%d)",
10029 : svf->typmod);
10030 18 : break;
10031 12 : case SVFOP_CURRENT_ROLE:
10032 12 : appendStringInfoString(buf, "CURRENT_ROLE");
10033 12 : break;
10034 296 : case SVFOP_CURRENT_USER:
10035 296 : appendStringInfoString(buf, "CURRENT_USER");
10036 296 : break;
10037 12 : case SVFOP_USER:
10038 12 : appendStringInfoString(buf, "USER");
10039 12 : break;
10040 34 : case SVFOP_SESSION_USER:
10041 34 : appendStringInfoString(buf, "SESSION_USER");
10042 34 : break;
10043 12 : case SVFOP_CURRENT_CATALOG:
10044 12 : appendStringInfoString(buf, "CURRENT_CATALOG");
10045 12 : break;
10046 12 : case SVFOP_CURRENT_SCHEMA:
10047 12 : appendStringInfoString(buf, "CURRENT_SCHEMA");
10048 12 : break;
10049 : }
10050 706 : }
10051 706 : break;
10052 :
10053 176 : case T_XmlExpr:
10054 : {
10055 176 : XmlExpr *xexpr = (XmlExpr *) node;
10056 176 : bool needcomma = false;
10057 : ListCell *arg;
10058 : ListCell *narg;
10059 : Const *con;
10060 :
10061 176 : switch (xexpr->op)
10062 : {
10063 16 : case IS_XMLCONCAT:
10064 16 : appendStringInfoString(buf, "XMLCONCAT(");
10065 16 : break;
10066 32 : case IS_XMLELEMENT:
10067 32 : appendStringInfoString(buf, "XMLELEMENT(");
10068 32 : break;
10069 16 : case IS_XMLFOREST:
10070 16 : appendStringInfoString(buf, "XMLFOREST(");
10071 16 : break;
10072 16 : case IS_XMLPARSE:
10073 16 : appendStringInfoString(buf, "XMLPARSE(");
10074 16 : break;
10075 16 : case IS_XMLPI:
10076 16 : appendStringInfoString(buf, "XMLPI(");
10077 16 : break;
10078 16 : case IS_XMLROOT:
10079 16 : appendStringInfoString(buf, "XMLROOT(");
10080 16 : break;
10081 64 : case IS_XMLSERIALIZE:
10082 64 : appendStringInfoString(buf, "XMLSERIALIZE(");
10083 64 : break;
10084 0 : case IS_DOCUMENT:
10085 0 : break;
10086 : }
10087 176 : if (xexpr->op == IS_XMLPARSE || xexpr->op == IS_XMLSERIALIZE)
10088 : {
10089 80 : if (xexpr->xmloption == XMLOPTION_DOCUMENT)
10090 32 : appendStringInfoString(buf, "DOCUMENT ");
10091 : else
10092 48 : appendStringInfoString(buf, "CONTENT ");
10093 : }
10094 176 : if (xexpr->name)
10095 : {
10096 48 : appendStringInfo(buf, "NAME %s",
10097 48 : quote_identifier(map_xml_name_to_sql_identifier(xexpr->name)));
10098 48 : needcomma = true;
10099 : }
10100 176 : if (xexpr->named_args)
10101 : {
10102 32 : if (xexpr->op != IS_XMLFOREST)
10103 : {
10104 16 : if (needcomma)
10105 16 : appendStringInfoString(buf, ", ");
10106 16 : appendStringInfoString(buf, "XMLATTRIBUTES(");
10107 16 : needcomma = false;
10108 : }
10109 112 : forboth(arg, xexpr->named_args, narg, xexpr->arg_names)
10110 : {
10111 80 : Node *e = (Node *) lfirst(arg);
10112 80 : char *argname = strVal(lfirst(narg));
10113 :
10114 80 : if (needcomma)
10115 48 : appendStringInfoString(buf, ", ");
10116 80 : get_rule_expr((Node *) e, context, true);
10117 80 : appendStringInfo(buf, " AS %s",
10118 80 : quote_identifier(map_xml_name_to_sql_identifier(argname)));
10119 80 : needcomma = true;
10120 : }
10121 32 : if (xexpr->op != IS_XMLFOREST)
10122 16 : appendStringInfoChar(buf, ')');
10123 : }
10124 176 : if (xexpr->args)
10125 : {
10126 160 : if (needcomma)
10127 48 : appendStringInfoString(buf, ", ");
10128 160 : switch (xexpr->op)
10129 : {
10130 128 : 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 128 : get_rule_expr((Node *) xexpr->args, context, true);
10137 128 : break;
10138 16 : case IS_XMLPARSE:
10139 : Assert(list_length(xexpr->args) == 2);
10140 :
10141 16 : get_rule_expr((Node *) linitial(xexpr->args),
10142 : context, true);
10143 :
10144 16 : con = lsecond_node(Const, xexpr->args);
10145 : Assert(!con->constisnull);
10146 16 : if (DatumGetBool(con->constvalue))
10147 0 : appendStringInfoString(buf,
10148 : " PRESERVE WHITESPACE");
10149 : else
10150 16 : appendStringInfoString(buf,
10151 : " STRIP WHITESPACE");
10152 16 : break;
10153 16 : case IS_XMLROOT:
10154 : Assert(list_length(xexpr->args) == 3);
10155 :
10156 16 : get_rule_expr((Node *) linitial(xexpr->args),
10157 : context, true);
10158 :
10159 16 : appendStringInfoString(buf, ", VERSION ");
10160 16 : con = (Const *) lsecond(xexpr->args);
10161 16 : if (IsA(con, Const) &&
10162 16 : con->constisnull)
10163 16 : appendStringInfoString(buf, "NO VALUE");
10164 : else
10165 0 : get_rule_expr((Node *) con, context, false);
10166 :
10167 16 : con = lthird_node(Const, xexpr->args);
10168 16 : if (con->constisnull)
10169 : /* suppress STANDALONE NO VALUE */ ;
10170 : else
10171 : {
10172 16 : switch (DatumGetInt32(con->constvalue))
10173 : {
10174 16 : case XML_STANDALONE_YES:
10175 16 : appendStringInfoString(buf,
10176 : ", STANDALONE YES");
10177 16 : break;
10178 0 : case XML_STANDALONE_NO:
10179 0 : appendStringInfoString(buf,
10180 : ", STANDALONE NO");
10181 0 : break;
10182 0 : case XML_STANDALONE_NO_VALUE:
10183 0 : appendStringInfoString(buf,
10184 : ", STANDALONE NO VALUE");
10185 0 : break;
10186 0 : default:
10187 0 : break;
10188 : }
10189 : }
10190 16 : break;
10191 0 : case IS_DOCUMENT:
10192 0 : get_rule_expr_paren((Node *) xexpr->args, context, false, node);
10193 0 : break;
10194 : }
10195 16 : }
10196 176 : if (xexpr->op == IS_XMLSERIALIZE)
10197 : {
10198 64 : appendStringInfo(buf, " AS %s",
10199 : format_type_with_typemod(xexpr->type,
10200 : xexpr->typmod));
10201 64 : if (xexpr->indent)
10202 16 : appendStringInfoString(buf, " INDENT");
10203 : else
10204 48 : appendStringInfoString(buf, " NO INDENT");
10205 : }
10206 :
10207 176 : if (xexpr->op == IS_DOCUMENT)
10208 0 : appendStringInfoString(buf, " IS DOCUMENT");
10209 : else
10210 176 : appendStringInfoChar(buf, ')');
10211 : }
10212 176 : break;
10213 :
10214 2548 : case T_NullTest:
10215 : {
10216 2548 : NullTest *ntest = (NullTest *) node;
10217 :
10218 2548 : if (!PRETTY_PAREN(context))
10219 2494 : appendStringInfoChar(buf, '(');
10220 2548 : 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 2548 : if (ntest->argisrow ||
10229 2486 : !type_is_rowtype(exprType((Node *) ntest->arg)))
10230 : {
10231 5060 : switch (ntest->nulltesttype)
10232 : {
10233 822 : case IS_NULL:
10234 822 : appendStringInfoString(buf, " IS NULL");
10235 822 : break;
10236 1708 : case IS_NOT_NULL:
10237 1708 : appendStringInfoString(buf, " IS NOT NULL");
10238 1708 : break;
10239 0 : default:
10240 0 : elog(ERROR, "unrecognized nulltesttype: %d",
10241 : (int) ntest->nulltesttype);
10242 : }
10243 : }
10244 : else
10245 : {
10246 18 : switch (ntest->nulltesttype)
10247 : {
10248 6 : case IS_NULL:
10249 6 : appendStringInfoString(buf, " IS NOT DISTINCT FROM NULL");
10250 6 : break;
10251 12 : case IS_NOT_NULL:
10252 12 : appendStringInfoString(buf, " IS DISTINCT FROM NULL");
10253 12 : break;
10254 0 : default:
10255 0 : elog(ERROR, "unrecognized nulltesttype: %d",
10256 : (int) ntest->nulltesttype);
10257 : }
10258 : }
10259 2548 : if (!PRETTY_PAREN(context))
10260 2494 : appendStringInfoChar(buf, ')');
10261 : }
10262 2548 : break;
10263 :
10264 306 : case T_BooleanTest:
10265 : {
10266 306 : BooleanTest *btest = (BooleanTest *) node;
10267 :
10268 306 : if (!PRETTY_PAREN(context))
10269 306 : appendStringInfoChar(buf, '(');
10270 306 : get_rule_expr_paren((Node *) btest->arg, context, false, node);
10271 306 : switch (btest->booltesttype)
10272 : {
10273 36 : case IS_TRUE:
10274 36 : appendStringInfoString(buf, " IS TRUE");
10275 36 : break;
10276 138 : case IS_NOT_TRUE:
10277 138 : appendStringInfoString(buf, " IS NOT TRUE");
10278 138 : break;
10279 0 : case IS_FALSE:
10280 0 : appendStringInfoString(buf, " IS FALSE");
10281 0 : break;
10282 54 : case IS_NOT_FALSE:
10283 54 : appendStringInfoString(buf, " IS NOT FALSE");
10284 54 : break;
10285 24 : case IS_UNKNOWN:
10286 24 : appendStringInfoString(buf, " IS UNKNOWN");
10287 24 : break;
10288 54 : case IS_NOT_UNKNOWN:
10289 54 : appendStringInfoString(buf, " IS NOT UNKNOWN");
10290 54 : break;
10291 0 : default:
10292 0 : elog(ERROR, "unrecognized booltesttype: %d",
10293 : (int) btest->booltesttype);
10294 : }
10295 306 : if (!PRETTY_PAREN(context))
10296 306 : appendStringInfoChar(buf, ')');
10297 : }
10298 306 : break;
10299 :
10300 52 : case T_CoerceToDomain:
10301 : {
10302 52 : CoerceToDomain *ctest = (CoerceToDomain *) node;
10303 52 : Node *arg = (Node *) ctest->arg;
10304 :
10305 52 : if (ctest->coercionformat == COERCE_IMPLICIT_CAST &&
10306 38 : !showimplicit)
10307 : {
10308 : /* don't show the implicit cast */
10309 22 : get_rule_expr(arg, context, false);
10310 : }
10311 : else
10312 : {
10313 30 : get_coercion_expr(arg, context,
10314 : ctest->resulttype,
10315 : ctest->resulttypmod,
10316 : node);
10317 : }
10318 : }
10319 52 : break;
10320 :
10321 408 : case T_CoerceToDomainValue:
10322 408 : appendStringInfoString(buf, "VALUE");
10323 408 : break;
10324 :
10325 76 : case T_SetToDefault:
10326 76 : appendStringInfoString(buf, "DEFAULT");
10327 76 : break;
10328 :
10329 24 : case T_CurrentOfExpr:
10330 : {
10331 24 : CurrentOfExpr *cexpr = (CurrentOfExpr *) node;
10332 :
10333 24 : if (cexpr->cursor_name)
10334 24 : appendStringInfo(buf, "CURRENT OF %s",
10335 24 : quote_identifier(cexpr->cursor_name));
10336 : else
10337 0 : appendStringInfo(buf, "CURRENT OF $%d",
10338 : cexpr->cursor_param);
10339 : }
10340 24 : break;
10341 :
10342 0 : case T_NextValueExpr:
10343 : {
10344 0 : NextValueExpr *nvexpr = (NextValueExpr *) node;
10345 :
10346 : /*
10347 : * This isn't exactly nextval(), but that seems close enough
10348 : * for EXPLAIN's purposes.
10349 : */
10350 0 : appendStringInfoString(buf, "nextval(");
10351 0 : simple_quote_literal(buf,
10352 0 : generate_relation_name(nvexpr->seqid,
10353 : NIL));
10354 0 : appendStringInfoChar(buf, ')');
10355 : }
10356 0 : break;
10357 :
10358 24 : case T_InferenceElem:
10359 : {
10360 24 : 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 24 : save_varprefix = context->varprefix;
10369 24 : 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 24 : need_parens = !IsA(iexpr->expr, Var);
10376 24 : if (IsA(iexpr->expr, FuncExpr) &&
10377 0 : ((FuncExpr *) iexpr->expr)->funcformat ==
10378 : COERCE_EXPLICIT_CALL)
10379 0 : need_parens = false;
10380 :
10381 24 : if (need_parens)
10382 0 : appendStringInfoChar(buf, '(');
10383 24 : get_rule_expr((Node *) iexpr->expr,
10384 : context, false);
10385 24 : if (need_parens)
10386 0 : appendStringInfoChar(buf, ')');
10387 :
10388 24 : context->varprefix = save_varprefix;
10389 :
10390 24 : if (iexpr->infercollid)
10391 12 : appendStringInfo(buf, " COLLATE %s",
10392 : generate_collation_name(iexpr->infercollid));
10393 :
10394 : /* Add the operator class name, if not default */
10395 24 : if (iexpr->inferopclass)
10396 : {
10397 12 : Oid inferopclass = iexpr->inferopclass;
10398 12 : Oid inferopcinputtype = get_opclass_input_type(iexpr->inferopclass);
10399 :
10400 12 : get_opclass_name(inferopclass, inferopcinputtype, buf);
10401 : }
10402 : }
10403 24 : break;
10404 :
10405 12 : case T_ReturningExpr:
10406 : {
10407 12 : 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 12 : get_rule_expr((Node *) retExpr->retexpr, context, showimplicit);
10416 : }
10417 12 : break;
10418 :
10419 3972 : case T_PartitionBoundSpec:
10420 : {
10421 3972 : PartitionBoundSpec *spec = (PartitionBoundSpec *) node;
10422 : ListCell *cell;
10423 : char *sep;
10424 :
10425 3972 : if (spec->is_default)
10426 : {
10427 156 : appendStringInfoString(buf, "DEFAULT");
10428 156 : break;
10429 : }
10430 :
10431 3816 : switch (spec->strategy)
10432 : {
10433 182 : case PARTITION_STRATEGY_HASH:
10434 : Assert(spec->modulus > 0 && spec->remainder >= 0);
10435 : Assert(spec->modulus > spec->remainder);
10436 :
10437 182 : appendStringInfoString(buf, "FOR VALUES");
10438 182 : appendStringInfo(buf, " WITH (modulus %d, remainder %d)",
10439 : spec->modulus, spec->remainder);
10440 182 : break;
10441 :
10442 1308 : case PARTITION_STRATEGY_LIST:
10443 : Assert(spec->listdatums != NIL);
10444 :
10445 1308 : appendStringInfoString(buf, "FOR VALUES IN (");
10446 1308 : sep = "";
10447 3480 : foreach(cell, spec->listdatums)
10448 : {
10449 2172 : Const *val = lfirst_node(Const, cell);
10450 :
10451 2172 : appendStringInfoString(buf, sep);
10452 2172 : get_const_expr(val, context, -1);
10453 2172 : sep = ", ";
10454 : }
10455 :
10456 1308 : appendStringInfoChar(buf, ')');
10457 1308 : break;
10458 :
10459 2326 : 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 2326 : appendStringInfo(buf, "FOR VALUES FROM %s TO %s",
10466 : get_range_partbound_string(spec->lowerdatums),
10467 : get_range_partbound_string(spec->upperdatums));
10468 2326 : break;
10469 :
10470 0 : default:
10471 0 : elog(ERROR, "unrecognized partition strategy: %d",
10472 : (int) spec->strategy);
10473 : break;
10474 : }
10475 : }
10476 3816 : break;
10477 :
10478 150 : case T_JsonValueExpr:
10479 : {
10480 150 : JsonValueExpr *jve = (JsonValueExpr *) node;
10481 :
10482 150 : get_rule_expr((Node *) jve->raw_expr, context, false);
10483 150 : get_json_format(jve->format, context->buf);
10484 : }
10485 150 : break;
10486 :
10487 174 : case T_JsonConstructorExpr:
10488 174 : get_json_constructor((JsonConstructorExpr *) node, context, false);
10489 174 : break;
10490 :
10491 60 : case T_JsonIsPredicate:
10492 : {
10493 60 : JsonIsPredicate *pred = (JsonIsPredicate *) node;
10494 :
10495 60 : if (!PRETTY_PAREN(context))
10496 30 : appendStringInfoChar(context->buf, '(');
10497 :
10498 60 : get_rule_expr_paren(pred->expr, context, true, node);
10499 :
10500 60 : appendStringInfoString(context->buf, " IS JSON");
10501 :
10502 : /* TODO: handle FORMAT clause */
10503 :
10504 60 : switch (pred->item_type)
10505 : {
10506 12 : case JS_TYPE_SCALAR:
10507 12 : appendStringInfoString(context->buf, " SCALAR");
10508 12 : break;
10509 12 : case JS_TYPE_ARRAY:
10510 12 : appendStringInfoString(context->buf, " ARRAY");
10511 12 : break;
10512 12 : case JS_TYPE_OBJECT:
10513 12 : appendStringInfoString(context->buf, " OBJECT");
10514 12 : break;
10515 24 : default:
10516 24 : break;
10517 : }
10518 :
10519 60 : if (pred->unique_keys)
10520 12 : appendStringInfoString(context->buf, " WITH UNIQUE KEYS");
10521 :
10522 60 : if (!PRETTY_PAREN(context))
10523 30 : appendStringInfoChar(context->buf, ')');
10524 : }
10525 60 : break;
10526 :
10527 60 : case T_JsonExpr:
10528 : {
10529 60 : JsonExpr *jexpr = (JsonExpr *) node;
10530 :
10531 60 : switch (jexpr->op)
10532 : {
10533 12 : case JSON_EXISTS_OP:
10534 12 : appendStringInfoString(buf, "JSON_EXISTS(");
10535 12 : break;
10536 36 : case JSON_QUERY_OP:
10537 36 : appendStringInfoString(buf, "JSON_QUERY(");
10538 36 : break;
10539 12 : case JSON_VALUE_OP:
10540 12 : appendStringInfoString(buf, "JSON_VALUE(");
10541 12 : break;
10542 0 : default:
10543 0 : elog(ERROR, "unrecognized JsonExpr op: %d",
10544 : (int) jexpr->op);
10545 : }
10546 :
10547 60 : get_rule_expr(jexpr->formatted_expr, context, showimplicit);
10548 :
10549 60 : appendStringInfoString(buf, ", ");
10550 :
10551 60 : get_json_path_spec(jexpr->path_spec, context, showimplicit);
10552 :
10553 60 : if (jexpr->passing_values)
10554 : {
10555 : ListCell *lc1,
10556 : *lc2;
10557 12 : bool needcomma = false;
10558 :
10559 12 : appendStringInfoString(buf, " PASSING ");
10560 :
10561 48 : forboth(lc1, jexpr->passing_names,
10562 : lc2, jexpr->passing_values)
10563 : {
10564 36 : if (needcomma)
10565 24 : appendStringInfoString(buf, ", ");
10566 36 : needcomma = true;
10567 :
10568 36 : get_rule_expr((Node *) lfirst(lc2), context, showimplicit);
10569 36 : appendStringInfo(buf, " AS %s",
10570 36 : quote_identifier(lfirst_node(String, lc1)->sval));
10571 : }
10572 : }
10573 :
10574 60 : if (jexpr->op != JSON_EXISTS_OP ||
10575 12 : jexpr->returning->typid != BOOLOID)
10576 48 : get_json_returning(jexpr->returning, context->buf,
10577 48 : jexpr->op == JSON_QUERY_OP);
10578 :
10579 60 : get_json_expr_options(jexpr, context,
10580 60 : jexpr->op != JSON_EXISTS_OP ?
10581 : JSON_BEHAVIOR_NULL :
10582 : JSON_BEHAVIOR_FALSE);
10583 :
10584 60 : appendStringInfoChar(buf, ')');
10585 : }
10586 60 : break;
10587 :
10588 2616 : case T_List:
10589 : {
10590 : char *sep;
10591 : ListCell *l;
10592 :
10593 2616 : sep = "";
10594 7274 : foreach(l, (List *) node)
10595 : {
10596 4658 : appendStringInfoString(buf, sep);
10597 4658 : get_rule_expr((Node *) lfirst(l), context, showimplicit);
10598 4658 : sep = ", ";
10599 : }
10600 : }
10601 2616 : break;
10602 :
10603 72 : case T_TableFunc:
10604 72 : get_tablefunc((TableFunc *) node, context, showimplicit);
10605 72 : break;
10606 :
10607 0 : default:
10608 0 : 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 : */
10624 : static void
10625 2972 : get_rule_expr_toplevel(Node *node, deparse_context *context,
10626 : bool showimplicit)
10627 : {
10628 2972 : if (node && IsA(node, Var))
10629 1178 : (void) get_variable((Var *) node, 0, true, context);
10630 : else
10631 1794 : get_rule_expr(node, context, showimplicit);
10632 2972 : }
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 : */
10642 : static void
10643 468 : get_rule_list_toplevel(List *lst, deparse_context *context,
10644 : bool showimplicit)
10645 : {
10646 : const char *sep;
10647 : ListCell *lc;
10648 :
10649 468 : sep = "";
10650 1610 : foreach(lc, lst)
10651 : {
10652 1142 : Node *e = (Node *) lfirst(lc);
10653 :
10654 1142 : appendStringInfoString(context->buf, sep);
10655 1142 : get_rule_expr_toplevel(e, context, showimplicit);
10656 1142 : sep = ", ";
10657 : }
10658 468 : }
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 : */
10672 : static void
10673 828 : get_rule_expr_funccall(Node *node, deparse_context *context,
10674 : bool showimplicit)
10675 : {
10676 828 : if (looks_like_function(node))
10677 816 : get_rule_expr(node, context, showimplicit);
10678 : else
10679 : {
10680 12 : StringInfo buf = context->buf;
10681 :
10682 12 : appendStringInfoString(buf, "CAST(");
10683 : /* no point in showing any top-level implicit cast */
10684 12 : get_rule_expr(node, context, false);
10685 12 : appendStringInfo(buf, " AS %s)",
10686 : format_type_with_typemod(exprType(node),
10687 : exprTypmod(node)));
10688 : }
10689 828 : }
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 : */
10695 : static bool
10696 2034 : looks_like_function(Node *node)
10697 : {
10698 2034 : if (node == NULL)
10699 0 : return false; /* probably shouldn't happen */
10700 2034 : switch (nodeTag(node))
10701 : {
10702 856 : case T_FuncExpr:
10703 : /* OK, unless it's going to deparse as a cast */
10704 874 : return (((FuncExpr *) node)->funcformat == COERCE_EXPLICIT_CALL ||
10705 18 : ((FuncExpr *) node)->funcformat == COERCE_SQL_SYNTAX);
10706 108 : 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 108 : return true;
10714 1070 : default:
10715 1070 : break;
10716 : }
10717 1070 : return false;
10718 : }
10719 :
10720 :
10721 : /*
10722 : * get_oper_expr - Parse back an OpExpr node
10723 : */
10724 : static void
10725 59368 : get_oper_expr(OpExpr *expr, deparse_context *context)
10726 : {
10727 59368 : StringInfo buf = context->buf;
10728 59368 : Oid opno = expr->opno;
10729 59368 : List *args = expr->args;
10730 :
10731 59368 : if (!PRETTY_PAREN(context))
10732 57116 : appendStringInfoChar(buf, '(');
10733 59368 : if (list_length(args) == 2)
10734 : {
10735 : /* binary operator */
10736 59338 : Node *arg1 = (Node *) linitial(args);
10737 59338 : Node *arg2 = (Node *) lsecond(args);
10738 :
10739 59338 : get_rule_expr_paren(arg1, context, true, (Node *) expr);
10740 59338 : appendStringInfo(buf, " %s ",
10741 : generate_operator_name(opno,
10742 : exprType(arg1),
10743 : exprType(arg2)));
10744 59338 : get_rule_expr_paren(arg2, context, true, (Node *) expr);
10745 : }
10746 : else
10747 : {
10748 : /* prefix operator */
10749 30 : Node *arg = (Node *) linitial(args);
10750 :
10751 30 : appendStringInfo(buf, "%s ",
10752 : generate_operator_name(opno,
10753 : InvalidOid,
10754 : exprType(arg)));
10755 30 : get_rule_expr_paren(arg, context, true, (Node *) expr);
10756 : }
10757 59368 : if (!PRETTY_PAREN(context))
10758 57116 : appendStringInfoChar(buf, ')');
10759 59368 : }
10760 :
10761 : /*
10762 : * get_func_expr - Parse back a FuncExpr node
10763 : */
10764 : static void
10765 12320 : get_func_expr(FuncExpr *expr, deparse_context *context,
10766 : bool showimplicit)
10767 : {
10768 12320 : StringInfo buf = context->buf;
10769 12320 : 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 12320 : if (expr->funcformat == COERCE_IMPLICIT_CAST && !showimplicit)
10781 : {
10782 1350 : get_rule_expr_paren((Node *) linitial(expr->args), context,
10783 : false, (Node *) expr);
10784 3202 : 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 10970 : if (expr->funcformat == COERCE_EXPLICIT_CAST ||
10792 10300 : expr->funcformat == COERCE_IMPLICIT_CAST)
10793 : {
10794 1678 : Node *arg = linitial(expr->args);
10795 1678 : Oid rettype = expr->funcresulttype;
10796 : int32 coercedTypmod;
10797 :
10798 : /* Get the typmod if this is a length-coercion function */
10799 1678 : (void) exprIsLengthCoercion((Node *) expr, &coercedTypmod);
10800 :
10801 1678 : get_coercion_expr(arg, context,
10802 : rettype, coercedTypmod,
10803 : (Node *) expr);
10804 :
10805 1678 : 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 9292 : if (expr->funcformat == COERCE_SQL_SYNTAX)
10814 : {
10815 180 : if (get_func_sql_syntax(expr, context))
10816 174 : return;
10817 : }
10818 :
10819 : /*
10820 : * Normal function: display as proname(args). First we need to extract
10821 : * the argument datatypes.
10822 : */
10823 9118 : if (list_length(expr->args) > FUNC_MAX_ARGS)
10824 0 : ereport(ERROR,
10825 : (errcode(ERRCODE_TOO_MANY_ARGUMENTS),
10826 : errmsg("too many arguments")));
10827 9118 : nargs = 0;
10828 9118 : argnames = NIL;
10829 18890 : foreach(l, expr->args)
10830 : {
10831 9772 : Node *arg = (Node *) lfirst(l);
10832 :
10833 9772 : if (IsA(arg, NamedArgExpr))
10834 30 : argnames = lappend(argnames, ((NamedArgExpr *) arg)->name);
10835 9772 : argtypes[nargs] = exprType(arg);
10836 9772 : nargs++;
10837 : }
10838 :
10839 9118 : appendStringInfo(buf, "%s(",
10840 : generate_function_name(funcoid, nargs,
10841 : argnames, argtypes,
10842 9118 : expr->funcvariadic,
10843 : &use_variadic,
10844 9118 : context->inGroupBy));
10845 9118 : nargs = 0;
10846 18890 : foreach(l, expr->args)
10847 : {
10848 9772 : if (nargs++ > 0)
10849 1798 : appendStringInfoString(buf, ", ");
10850 9772 : if (use_variadic && lnext(expr->args, l) == NULL)
10851 12 : appendStringInfoString(buf, "VARIADIC ");
10852 9772 : get_rule_expr((Node *) lfirst(l), context, true);
10853 : }
10854 9118 : appendStringInfoChar(buf, ')');
10855 : }
10856 :
10857 : /*
10858 : * get_agg_expr - Parse back an Aggref node
10859 : */
10860 : static void
10861 1976 : get_agg_expr(Aggref *aggref, deparse_context *context,
10862 : Aggref *original_aggref)
10863 : {
10864 1976 : get_agg_expr_helper(aggref, context, original_aggref, NULL, NULL,
10865 : false);
10866 1976 : }
10867 :
10868 : /*
10869 : * get_agg_expr_helper - subroutine for get_agg_expr and
10870 : * get_json_agg_constructor
10871 : */
10872 : static void
10873 2030 : get_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 2030 : StringInfo buf = context->buf;
10878 : Oid argtypes[FUNC_MAX_ARGS];
10879 : int nargs;
10880 2030 : 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 2030 : if (DO_AGGSPLIT_COMBINE(aggref->aggsplit))
10890 : {
10891 : TargetEntry *tle;
10892 :
10893 : Assert(list_length(aggref->args) == 1);
10894 260 : tle = linitial_node(TargetEntry, aggref->args);
10895 260 : resolve_special_varno((Node *) tle->expr, context,
10896 : get_agg_combine_expr, original_aggref);
10897 260 : 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 1770 : if (DO_AGGSPLIT_SKIPFINAL(original_aggref->aggsplit))
10905 60 : appendStringInfoString(buf, "PARTIAL ");
10906 :
10907 : /* Extract the argument types as seen by the parser */
10908 1770 : nargs = get_aggregate_argtypes(aggref, argtypes);
10909 :
10910 1770 : if (!funcname)
10911 1716 : funcname = generate_function_name(aggref->aggfnoid, nargs, NIL,
10912 1716 : argtypes, aggref->aggvariadic,
10913 : &use_variadic,
10914 1716 : context->inGroupBy);
10915 :
10916 : /* Print the aggregate name, schema-qualified if needed */
10917 1770 : appendStringInfo(buf, "%s(%s", funcname,
10918 1770 : (aggref->aggdistinct != NIL) ? "DISTINCT " : "");
10919 :
10920 1770 : 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 28 : get_rule_expr((Node *) aggref->aggdirectargs, context, true);
10929 : Assert(aggref->aggorder != NIL);
10930 28 : appendStringInfoString(buf, ") WITHIN GROUP (ORDER BY ");
10931 28 : get_rule_orderby(aggref->aggorder, aggref->args, false, context);
10932 : }
10933 : else
10934 : {
10935 : /* aggstar can be set only in zero-argument aggregates */
10936 1742 : if (aggref->aggstar)
10937 268 : appendStringInfoChar(buf, '*');
10938 : else
10939 : {
10940 : ListCell *l;
10941 : int i;
10942 :
10943 1474 : i = 0;
10944 3136 : foreach(l, aggref->args)
10945 : {
10946 1662 : TargetEntry *tle = (TargetEntry *) lfirst(l);
10947 1662 : Node *arg = (Node *) tle->expr;
10948 :
10949 : Assert(!IsA(arg, NamedArgExpr));
10950 1662 : if (tle->resjunk)
10951 50 : continue;
10952 1612 : if (i++ > 0)
10953 : {
10954 138 : 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 30 : if (i > 2)
10961 0 : break;
10962 :
10963 30 : appendStringInfoString(buf, " : ");
10964 : }
10965 : else
10966 108 : appendStringInfoString(buf, ", ");
10967 : }
10968 1612 : if (use_variadic && i == nargs)
10969 8 : appendStringInfoString(buf, "VARIADIC ");
10970 1612 : get_rule_expr(arg, context, true);
10971 : }
10972 : }
10973 :
10974 1742 : if (aggref->aggorder != NIL)
10975 : {
10976 82 : appendStringInfoString(buf, " ORDER BY ");
10977 82 : get_rule_orderby(aggref->aggorder, aggref->args, false, context);
10978 : }
10979 : }
10980 :
10981 1770 : if (options)
10982 54 : appendStringInfoString(buf, options);
10983 :
10984 1770 : if (aggref->aggfilter != NULL)
10985 : {
10986 46 : appendStringInfoString(buf, ") FILTER (WHERE ");
10987 46 : get_rule_expr((Node *) aggref->aggfilter, context, false);
10988 : }
10989 :
10990 1770 : 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 : */
10998 : static void
10999 260 : get_agg_combine_expr(Node *node, deparse_context *context, void *callback_arg)
11000 : {
11001 : Aggref *aggref;
11002 260 : Aggref *original_aggref = callback_arg;
11003 :
11004 260 : if (!IsA(node, Aggref))
11005 0 : elog(ERROR, "combining Aggref does not point to an Aggref");
11006 :
11007 260 : aggref = (Aggref *) node;
11008 260 : get_agg_expr(aggref, context, original_aggref);
11009 260 : }
11010 :
11011 : /*
11012 : * get_windowfunc_expr - Parse back a WindowFunc node
11013 : */
11014 : static void
11015 306 : get_windowfunc_expr(WindowFunc *wfunc, deparse_context *context)
11016 : {
11017 306 : get_windowfunc_expr_helper(wfunc, context, NULL, NULL, false);
11018 306 : }
11019 :
11020 :
11021 : /*
11022 : * get_windowfunc_expr_helper - subroutine for get_windowfunc_expr and
11023 : * get_json_agg_constructor
11024 : */
11025 : static void
11026 318 : get_windowfunc_expr_helper(WindowFunc *wfunc, deparse_context *context,
11027 : const char *funcname, const char *options,
11028 : bool is_json_objectagg)
11029 : {
11030 318 : StringInfo buf = context->buf;
11031 : Oid argtypes[FUNC_MAX_ARGS];
11032 : int nargs;
11033 : List *argnames;
11034 : ListCell *l;
11035 :
11036 318 : if (list_length(wfunc->args) > FUNC_MAX_ARGS)
11037 0 : ereport(ERROR,
11038 : (errcode(ERRCODE_TOO_MANY_ARGUMENTS),
11039 : errmsg("too many arguments")));
11040 318 : nargs = 0;
11041 318 : argnames = NIL;
11042 534 : foreach(l, wfunc->args)
11043 : {
11044 216 : Node *arg = (Node *) lfirst(l);
11045 :
11046 216 : if (IsA(arg, NamedArgExpr))
11047 0 : argnames = lappend(argnames, ((NamedArgExpr *) arg)->name);
11048 216 : argtypes[nargs] = exprType(arg);
11049 216 : nargs++;
11050 : }
11051 :
11052 318 : if (!funcname)
11053 306 : funcname = generate_function_name(wfunc->winfnoid, nargs, argnames,
11054 : argtypes, false, NULL,
11055 306 : context->inGroupBy);
11056 :
11057 318 : appendStringInfo(buf, "%s(", funcname);
11058 :
11059 : /* winstar can be set only in zero-argument aggregates */
11060 318 : if (wfunc->winstar)
11061 24 : appendStringInfoChar(buf, '*');
11062 : else
11063 : {
11064 294 : if (is_json_objectagg)
11065 : {
11066 6 : get_rule_expr((Node *) linitial(wfunc->args), context, false);
11067 6 : appendStringInfoString(buf, " : ");
11068 6 : get_rule_expr((Node *) lsecond(wfunc->args), context, false);
11069 : }
11070 : else
11071 288 : get_rule_expr((Node *) wfunc->args, context, true);
11072 : }
11073 :
11074 318 : if (options)
11075 12 : appendStringInfoString(buf, options);
11076 :
11077 318 : if (wfunc->aggfilter != NULL)
11078 : {
11079 0 : appendStringInfoString(buf, ") FILTER (WHERE ");
11080 0 : get_rule_expr((Node *) wfunc->aggfilter, context, false);
11081 : }
11082 :
11083 318 : appendStringInfoString(buf, ") OVER ");
11084 :
11085 318 : if (context->windowClause)
11086 : {
11087 : /* Query-decompilation case: search the windowClause list */
11088 42 : foreach(l, context->windowClause)
11089 : {
11090 42 : WindowClause *wc = (WindowClause *) lfirst(l);
11091 :
11092 42 : if (wc->winref == wfunc->winref)
11093 : {
11094 42 : if (wc->name)
11095 0 : appendStringInfoString(buf, quote_identifier(wc->name));
11096 : else
11097 42 : get_rule_windowspec(wc, context->targetList, context);
11098 42 : break;
11099 : }
11100 : }
11101 42 : if (l == NULL)
11102 0 : 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 276 : foreach(l, context->namespaces)
11112 : {
11113 276 : deparse_namespace *dpns = (deparse_namespace *) lfirst(l);
11114 :
11115 276 : if (dpns->plan && IsA(dpns->plan, WindowAgg))
11116 : {
11117 276 : WindowAgg *wagg = (WindowAgg *) dpns->plan;
11118 :
11119 276 : if (wagg->winref == wfunc->winref)
11120 : {
11121 276 : appendStringInfoString(buf, quote_identifier(wagg->winname));
11122 276 : break;
11123 : }
11124 : }
11125 : }
11126 276 : if (l == NULL)
11127 0 : elog(ERROR, "could not find window clause for winref %u",
11128 : wfunc->winref);
11129 : }
11130 318 : }
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 : */
11138 : static bool
11139 180 : get_func_sql_syntax(FuncExpr *expr, deparse_context *context)
11140 : {
11141 180 : StringInfo buf = context->buf;
11142 180 : Oid funcoid = expr->funcid;
11143 :
11144 180 : switch (funcoid)
11145 : {
11146 24 : 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 24 : appendStringInfoChar(buf, '(');
11154 24 : get_rule_expr_paren((Node *) lsecond(expr->args), context, false,
11155 : (Node *) expr);
11156 24 : appendStringInfoString(buf, " AT TIME ZONE ");
11157 24 : get_rule_expr_paren((Node *) linitial(expr->args), context, false,
11158 : (Node *) expr);
11159 24 : appendStringInfoChar(buf, ')');
11160 24 : return true;
11161 :
11162 18 : case F_TIMEZONE_TIMESTAMP:
11163 : case F_TIMEZONE_TIMESTAMPTZ:
11164 : case F_TIMEZONE_TIMETZ:
11165 : /* AT LOCAL */
11166 18 : appendStringInfoChar(buf, '(');
11167 18 : get_rule_expr_paren((Node *) linitial(expr->args), context, false,
11168 : (Node *) expr);
11169 18 : appendStringInfoString(buf, " AT LOCAL)");
11170 18 : return true;
11171 :
11172 6 : 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 6 : appendStringInfoString(buf, "((");
11187 6 : get_rule_expr((Node *) linitial(expr->args), context, false);
11188 6 : appendStringInfoString(buf, ", ");
11189 6 : get_rule_expr((Node *) lsecond(expr->args), context, false);
11190 6 : appendStringInfoString(buf, ") OVERLAPS (");
11191 6 : get_rule_expr((Node *) lthird(expr->args), context, false);
11192 6 : appendStringInfoString(buf, ", ");
11193 6 : get_rule_expr((Node *) lfourth(expr->args), context, false);
11194 6 : appendStringInfoString(buf, "))");
11195 6 : return true;
11196 :
11197 18 : 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 18 : appendStringInfoString(buf, "EXTRACT(");
11205 : {
11206 18 : Const *con = (Const *) linitial(expr->args);
11207 :
11208 : Assert(IsA(con, Const) &&
11209 : con->consttype == TEXTOID &&
11210 : !con->constisnull);
11211 18 : appendStringInfoString(buf, TextDatumGetCString(con->constvalue));
11212 : }
11213 18 : appendStringInfoString(buf, " FROM ");
11214 18 : get_rule_expr((Node *) lsecond(expr->args), context, false);
11215 18 : appendStringInfoChar(buf, ')');
11216 18 : return true;
11217 :
11218 12 : case F_IS_NORMALIZED:
11219 : /* IS xxx NORMALIZED */
11220 12 : appendStringInfoChar(buf, '(');
11221 12 : get_rule_expr_paren((Node *) linitial(expr->args), context, false,
11222 : (Node *) expr);
11223 12 : appendStringInfoString(buf, " IS");
11224 12 : if (list_length(expr->args) == 2)
11225 : {
11226 6 : Const *con = (Const *) lsecond(expr->args);
11227 :
11228 : Assert(IsA(con, Const) &&
11229 : con->consttype == TEXTOID &&
11230 : !con->constisnull);
11231 6 : appendStringInfo(buf, " %s",
11232 6 : TextDatumGetCString(con->constvalue));
11233 : }
11234 12 : appendStringInfoString(buf, " NORMALIZED)");
11235 12 : return true;
11236 :
11237 6 : case F_PG_COLLATION_FOR:
11238 : /* COLLATION FOR */
11239 6 : appendStringInfoString(buf, "COLLATION FOR (");
11240 6 : get_rule_expr((Node *) linitial(expr->args), context, false);
11241 6 : appendStringInfoChar(buf, ')');
11242 6 : return true;
11243 :
11244 12 : case F_NORMALIZE:
11245 : /* NORMALIZE() */
11246 12 : appendStringInfoString(buf, "NORMALIZE(");
11247 12 : get_rule_expr((Node *) linitial(expr->args), context, false);
11248 12 : if (list_length(expr->args) == 2)
11249 : {
11250 6 : Const *con = (Const *) lsecond(expr->args);
11251 :
11252 : Assert(IsA(con, Const) &&
11253 : con->consttype == TEXTOID &&
11254 : !con->constisnull);
11255 6 : appendStringInfo(buf, ", %s",
11256 6 : TextDatumGetCString(con->constvalue));
11257 : }
11258 12 : appendStringInfoChar(buf, ')');
11259 12 : return true;
11260 :
11261 12 : 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 12 : appendStringInfoString(buf, "OVERLAY(");
11269 12 : get_rule_expr((Node *) linitial(expr->args), context, false);
11270 12 : appendStringInfoString(buf, " PLACING ");
11271 12 : get_rule_expr((Node *) lsecond(expr->args), context, false);
11272 12 : appendStringInfoString(buf, " FROM ");
11273 12 : get_rule_expr((Node *) lthird(expr->args), context, false);
11274 12 : if (list_length(expr->args) == 4)
11275 : {
11276 6 : appendStringInfoString(buf, " FOR ");
11277 6 : get_rule_expr((Node *) lfourth(expr->args), context, false);
11278 : }
11279 12 : appendStringInfoChar(buf, ')');
11280 12 : return true;
11281 :
11282 6 : 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 6 : appendStringInfoString(buf, "POSITION((");
11287 6 : get_rule_expr((Node *) lsecond(expr->args), context, false);
11288 6 : appendStringInfoString(buf, ") IN (");
11289 6 : get_rule_expr((Node *) linitial(expr->args), context, false);
11290 6 : appendStringInfoString(buf, "))");
11291 6 : return true;
11292 :
11293 6 : 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 6 : appendStringInfoString(buf, "SUBSTRING(");
11301 6 : get_rule_expr((Node *) linitial(expr->args), context, false);
11302 6 : appendStringInfoString(buf, " FROM ");
11303 6 : get_rule_expr((Node *) lsecond(expr->args), context, false);
11304 6 : if (list_length(expr->args) == 3)
11305 : {
11306 6 : appendStringInfoString(buf, " FOR ");
11307 6 : get_rule_expr((Node *) lthird(expr->args), context, false);
11308 : }
11309 6 : appendStringInfoChar(buf, ')');
11310 6 : return true;
11311 :
11312 6 : case F_SUBSTRING_TEXT_TEXT_TEXT:
11313 : /* SUBSTRING SIMILAR/ESCAPE */
11314 6 : appendStringInfoString(buf, "SUBSTRING(");
11315 6 : get_rule_expr((Node *) linitial(expr->args), context, false);
11316 6 : appendStringInfoString(buf, " SIMILAR ");
11317 6 : get_rule_expr((Node *) lsecond(expr->args), context, false);
11318 6 : appendStringInfoString(buf, " ESCAPE ");
11319 6 : get_rule_expr((Node *) lthird(expr->args), context, false);
11320 6 : appendStringInfoChar(buf, ')');
11321 6 : return true;
11322 :
11323 12 : case F_BTRIM_BYTEA_BYTEA:
11324 : case F_BTRIM_TEXT:
11325 : case F_BTRIM_TEXT_TEXT:
11326 : /* TRIM() */
11327 12 : appendStringInfoString(buf, "TRIM(BOTH");
11328 12 : if (list_length(expr->args) == 2)
11329 : {
11330 12 : appendStringInfoChar(buf, ' ');
11331 12 : get_rule_expr((Node *) lsecond(expr->args), context, false);
11332 : }
11333 12 : appendStringInfoString(buf, " FROM ");
11334 12 : get_rule_expr((Node *) linitial(expr->args), context, false);
11335 12 : appendStringInfoChar(buf, ')');
11336 12 : return true;
11337 :
11338 12 : case F_LTRIM_BYTEA_BYTEA:
11339 : case F_LTRIM_TEXT:
11340 : case F_LTRIM_TEXT_TEXT:
11341 : /* TRIM() */
11342 12 : appendStringInfoString(buf, "TRIM(LEADING");
11343 12 : if (list_length(expr->args) == 2)
11344 : {
11345 12 : appendStringInfoChar(buf, ' ');
11346 12 : get_rule_expr((Node *) lsecond(expr->args), context, false);
11347 : }
11348 12 : appendStringInfoString(buf, " FROM ");
11349 12 : get_rule_expr((Node *) linitial(expr->args), context, false);
11350 12 : appendStringInfoChar(buf, ')');
11351 12 : return true;
11352 :
11353 12 : case F_RTRIM_BYTEA_BYTEA:
11354 : case F_RTRIM_TEXT:
11355 : case F_RTRIM_TEXT_TEXT:
11356 : /* TRIM() */
11357 12 : appendStringInfoString(buf, "TRIM(TRAILING");
11358 12 : if (list_length(expr->args) == 2)
11359 : {
11360 6 : appendStringInfoChar(buf, ' ');
11361 6 : get_rule_expr((Node *) lsecond(expr->args), context, false);
11362 : }
11363 12 : appendStringInfoString(buf, " FROM ");
11364 12 : get_rule_expr((Node *) linitial(expr->args), context, false);
11365 12 : appendStringInfoChar(buf, ')');
11366 12 : return true;
11367 :
11368 12 : case F_SYSTEM_USER:
11369 12 : appendStringInfoString(buf, "SYSTEM_USER");
11370 12 : return true;
11371 :
11372 0 : case F_XMLEXISTS:
11373 : /* XMLEXISTS ... extra parens because args are c_expr */
11374 0 : appendStringInfoString(buf, "XMLEXISTS((");
11375 0 : get_rule_expr((Node *) linitial(expr->args), context, false);
11376 0 : appendStringInfoString(buf, ") PASSING (");
11377 0 : get_rule_expr((Node *) lsecond(expr->args), context, false);
11378 0 : appendStringInfoString(buf, "))");
11379 0 : return true;
11380 : }
11381 6 : 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 : */
11390 : static void
11391 4966 : get_coercion_expr(Node *arg, deparse_context *context,
11392 : Oid resulttype, int32 resulttypmod,
11393 : Node *parentNode)
11394 : {
11395 4966 : 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 4966 : if (arg && IsA(arg, Const) &&
11413 554 : ((Const *) arg)->consttype == resulttype &&
11414 24 : ((Const *) arg)->consttypmod == -1)
11415 : {
11416 : /* Show the constant without normal ::typename decoration */
11417 24 : get_const_expr((Const *) arg, context, -1);
11418 : }
11419 : else
11420 : {
11421 4942 : if (!PRETTY_PAREN(context))
11422 4566 : appendStringInfoChar(buf, '(');
11423 4942 : get_rule_expr_paren(arg, context, false, parentNode);
11424 4942 : if (!PRETTY_PAREN(context))
11425 4566 : 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 4966 : appendStringInfo(buf, "::%s",
11436 : format_type_with_typemod(resulttype, resulttypmod));
11437 4966 : }
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 : */
11454 : static void
11455 68638 : get_const_expr(Const *constval, deparse_context *context, int showtype)
11456 : {
11457 68638 : StringInfo buf = context->buf;
11458 : Oid typoutput;
11459 : bool typIsVarlena;
11460 : char *extval;
11461 68638 : bool needlabel = false;
11462 :
11463 68638 : if (constval->constisnull)
11464 : {
11465 : /*
11466 : * Always label the type of a NULL constant to prevent misdecisions
11467 : * about type when reparsing.
11468 : */
11469 1076 : appendStringInfoString(buf, "NULL");
11470 1076 : if (showtype >= 0)
11471 : {
11472 1032 : appendStringInfo(buf, "::%s",
11473 : format_type_with_typemod(constval->consttype,
11474 : constval->consttypmod));
11475 1032 : get_const_collation(constval, context);
11476 : }
11477 8990 : return;
11478 : }
11479 :
11480 67562 : getTypeOutputInfo(constval->consttype,
11481 : &typoutput, &typIsVarlena);
11482 :
11483 67562 : extval = OidOutputFunctionCall(typoutput, constval->constvalue);
11484 :
11485 67562 : switch (constval->consttype)
11486 : {
11487 38958 : 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 38958 : if (extval[0] != '-')
11499 38426 : appendStringInfoString(buf, extval);
11500 : else
11501 : {
11502 532 : appendStringInfo(buf, "'%s'", extval);
11503 532 : needlabel = true; /* we must attach a cast */
11504 : }
11505 38958 : break;
11506 :
11507 1084 : 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 1084 : if (isdigit((unsigned char) extval[0]) &&
11515 1084 : strcspn(extval, "eE.") != strlen(extval))
11516 : {
11517 380 : appendStringInfoString(buf, extval);
11518 : }
11519 : else
11520 : {
11521 704 : appendStringInfo(buf, "'%s'", extval);
11522 704 : needlabel = true; /* we must attach a cast */
11523 : }
11524 1084 : break;
11525 :
11526 1558 : case BOOLOID:
11527 1558 : if (strcmp(extval, "t") == 0)
11528 766 : appendStringInfoString(buf, "true");
11529 : else
11530 792 : appendStringInfoString(buf, "false");
11531 1558 : break;
11532 :
11533 25962 : default:
11534 25962 : simple_quote_literal(buf, extval);
11535 25962 : break;
11536 : }
11537 :
11538 67562 : pfree(extval);
11539 :
11540 67562 : if (showtype < 0)
11541 7914 : 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 59648 : switch (constval->consttype)
11551 : {
11552 1626 : case BOOLOID:
11553 : case UNKNOWNOID:
11554 : /* These types can be left unlabeled */
11555 1626 : needlabel = false;
11556 1626 : break;
11557 34592 : case INT4OID:
11558 : /* We determined above whether a label is needed */
11559 34592 : break;
11560 1084 : 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 1084 : needlabel |= (constval->consttypmod >= 0);
11568 1084 : break;
11569 22346 : default:
11570 22346 : needlabel = true;
11571 22346 : break;
11572 : }
11573 59648 : if (needlabel || showtype > 0)
11574 23568 : appendStringInfo(buf, "::%s",
11575 : format_type_with_typemod(constval->consttype,
11576 : constval->consttypmod));
11577 :
11578 59648 : get_const_collation(constval, context);
11579 : }
11580 :
11581 : /*
11582 : * helper for get_const_expr: append COLLATE if needed
11583 : */
11584 : static void
11585 60680 : get_const_collation(Const *constval, deparse_context *context)
11586 : {
11587 60680 : StringInfo buf = context->buf;
11588 :
11589 60680 : if (OidIsValid(constval->constcollid))
11590 : {
11591 8696 : Oid typcollation = get_typcollation(constval->consttype);
11592 :
11593 8696 : if (constval->constcollid != typcollation)
11594 : {
11595 70 : appendStringInfo(buf, " COLLATE %s",
11596 : generate_collation_name(constval->constcollid));
11597 : }
11598 : }
11599 60680 : }
11600 :
11601 : /*
11602 : * get_json_path_spec - Parse back a JSON path specification
11603 : */
11604 : static void
11605 456 : get_json_path_spec(Node *path_spec, deparse_context *context, bool showimplicit)
11606 : {
11607 456 : if (IsA(path_spec, Const))
11608 456 : get_const_expr((Const *) path_spec, context, -1);
11609 : else
11610 0 : get_rule_expr(path_spec, context, showimplicit);
11611 456 : }
11612 :
11613 : /*
11614 : * get_json_format - Parse back a JsonFormat node
11615 : */
11616 : static void
11617 186 : get_json_format(JsonFormat *format, StringInfo buf)
11618 : {
11619 186 : if (format->format_type == JS_FORMAT_DEFAULT)
11620 108 : return;
11621 :
11622 78 : appendStringInfoString(buf,
11623 78 : format->format_type == JS_FORMAT_JSONB ?
11624 : " FORMAT JSONB" : " FORMAT JSON");
11625 :
11626 78 : if (format->encoding != JS_ENC_DEFAULT)
11627 : {
11628 : const char *encoding;
11629 :
11630 6 : encoding =
11631 12 : format->encoding == JS_ENC_UTF16 ? "UTF16" :
11632 6 : format->encoding == JS_ENC_UTF32 ? "UTF32" : "UTF8";
11633 :
11634 6 : appendStringInfo(buf, " ENCODING %s", encoding);
11635 : }
11636 : }
11637 :
11638 : /*
11639 : * get_json_returning - Parse back a JsonReturning structure
11640 : */
11641 : static void
11642 168 : get_json_returning(JsonReturning *returning, StringInfo buf,
11643 : bool json_format_by_default)
11644 : {
11645 168 : if (!OidIsValid(returning->typid))
11646 0 : return;
11647 :
11648 168 : appendStringInfo(buf, " RETURNING %s",
11649 : format_type_with_typemod(returning->typid,
11650 : returning->typmod));
11651 :
11652 324 : if (!json_format_by_default ||
11653 156 : returning->format->format_type !=
11654 156 : (returning->typid == JSONBOID ? JS_FORMAT_JSONB : JS_FORMAT_JSON))
11655 36 : get_json_format(returning->format, buf);
11656 : }
11657 :
11658 : /*
11659 : * get_json_constructor - Parse back a JsonConstructorExpr node
11660 : */
11661 : static void
11662 174 : get_json_constructor(JsonConstructorExpr *ctor, deparse_context *context,
11663 : bool showimplicit)
11664 : {
11665 174 : StringInfo buf = context->buf;
11666 : const char *funcname;
11667 : bool is_json_object;
11668 : int curridx;
11669 : ListCell *lc;
11670 :
11671 174 : if (ctor->type == JSCTOR_JSON_OBJECTAGG)
11672 : {
11673 36 : get_json_agg_constructor(ctor, context, "JSON_OBJECTAGG", true);
11674 36 : return;
11675 : }
11676 138 : else if (ctor->type == JSCTOR_JSON_ARRAYAGG)
11677 : {
11678 30 : get_json_agg_constructor(ctor, context, "JSON_ARRAYAGG", false);
11679 30 : return;
11680 : }
11681 :
11682 108 : switch (ctor->type)
11683 : {
11684 30 : case JSCTOR_JSON_OBJECT:
11685 30 : funcname = "JSON_OBJECT";
11686 30 : break;
11687 12 : case JSCTOR_JSON_ARRAY:
11688 12 : funcname = "JSON_ARRAY";
11689 12 : break;
11690 42 : case JSCTOR_JSON_PARSE:
11691 42 : funcname = "JSON";
11692 42 : break;
11693 12 : case JSCTOR_JSON_SCALAR:
11694 12 : funcname = "JSON_SCALAR";
11695 12 : break;
11696 12 : case JSCTOR_JSON_SERIALIZE:
11697 12 : funcname = "JSON_SERIALIZE";
11698 12 : break;
11699 0 : default:
11700 0 : elog(ERROR, "invalid JsonConstructorType %d", ctor->type);
11701 : }
11702 :
11703 108 : appendStringInfo(buf, "%s(", funcname);
11704 :
11705 108 : is_json_object = ctor->type == JSCTOR_JSON_OBJECT;
11706 282 : foreach(lc, ctor->args)
11707 : {
11708 174 : curridx = foreach_current_index(lc);
11709 174 : if (curridx > 0)
11710 : {
11711 : const char *sep;
11712 :
11713 66 : sep = (is_json_object && (curridx % 2) != 0) ? " : " : ", ";
11714 66 : appendStringInfoString(buf, sep);
11715 : }
11716 :
11717 174 : get_rule_expr((Node *) lfirst(lc), context, true);
11718 : }
11719 :
11720 108 : get_json_constructor_options(ctor, buf);
11721 108 : appendStringInfoChar(buf, ')');
11722 : }
11723 :
11724 : /*
11725 : * Append options, if any, to the JSON constructor being deparsed
11726 : */
11727 : static void
11728 174 : get_json_constructor_options(JsonConstructorExpr *ctor, StringInfo buf)
11729 : {
11730 174 : if (ctor->absent_on_null)
11731 : {
11732 24 : if (ctor->type == JSCTOR_JSON_OBJECT ||
11733 24 : ctor->type == JSCTOR_JSON_OBJECTAGG)
11734 0 : appendStringInfoString(buf, " ABSENT ON NULL");
11735 : }
11736 : else
11737 : {
11738 150 : if (ctor->type == JSCTOR_JSON_ARRAY ||
11739 150 : ctor->type == JSCTOR_JSON_ARRAYAGG)
11740 18 : appendStringInfoString(buf, " NULL ON NULL");
11741 : }
11742 :
11743 174 : if (ctor->unique)
11744 24 : appendStringInfoString(buf, " WITH UNIQUE KEYS");
11745 :
11746 : /*
11747 : * Append RETURNING clause if needed; JSON() and JSON_SCALAR() don't
11748 : * support one.
11749 : */
11750 174 : if (ctor->type != JSCTOR_JSON_PARSE && ctor->type != JSCTOR_JSON_SCALAR)
11751 120 : get_json_returning(ctor->returning, buf, true);
11752 174 : }
11753 :
11754 : /*
11755 : * get_json_agg_constructor - Parse back an aggregate JsonConstructorExpr node
11756 : */
11757 : static void
11758 66 : get_json_agg_constructor(JsonConstructorExpr *ctor, deparse_context *context,
11759 : const char *funcname, bool is_json_objectagg)
11760 : {
11761 : StringInfoData options;
11762 :
11763 66 : initStringInfo(&options);
11764 66 : get_json_constructor_options(ctor, &options);
11765 :
11766 66 : if (IsA(ctor->func, Aggref))
11767 54 : get_agg_expr_helper((Aggref *) ctor->func, context,
11768 54 : (Aggref *) ctor->func,
11769 54 : funcname, options.data, is_json_objectagg);
11770 12 : else if (IsA(ctor->func, WindowFunc))
11771 12 : get_windowfunc_expr_helper((WindowFunc *) ctor->func, context,
11772 12 : funcname, options.data,
11773 : is_json_objectagg);
11774 : else
11775 0 : elog(ERROR, "invalid JsonConstructorExpr underlying node type: %d",
11776 : nodeTag(ctor->func));
11777 66 : }
11778 :
11779 : /*
11780 : * simple_quote_literal - Format a string as a SQL literal, append to buf
11781 : */
11782 : static void
11783 27022 : simple_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 27022 : appendStringInfoChar(buf, '\'');
11793 275704 : for (valptr = val; *valptr; valptr++)
11794 : {
11795 248682 : char ch = *valptr;
11796 :
11797 248682 : if (SQL_STR_DOUBLE(ch, !standard_conforming_strings))
11798 306 : appendStringInfoChar(buf, ch);
11799 248682 : appendStringInfoChar(buf, ch);
11800 : }
11801 27022 : appendStringInfoChar(buf, '\'');
11802 27022 : }
11803 :
11804 :
11805 : /* ----------
11806 : * get_sublink_expr - Parse back a sublink
11807 : * ----------
11808 : */
11809 : static void
11810 460 : get_sublink_expr(SubLink *sublink, deparse_context *context)
11811 : {
11812 460 : StringInfo buf = context->buf;
11813 460 : Query *query = (Query *) (sublink->subselect);
11814 460 : char *opname = NULL;
11815 : bool need_paren;
11816 :
11817 460 : if (sublink->subLinkType == ARRAY_SUBLINK)
11818 24 : appendStringInfoString(buf, "ARRAY(");
11819 : else
11820 436 : 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 460 : if (sublink->testexpr)
11830 : {
11831 18 : if (IsA(sublink->testexpr, OpExpr))
11832 : {
11833 : /* single combining operator */
11834 6 : OpExpr *opexpr = (OpExpr *) sublink->testexpr;
11835 :
11836 6 : get_rule_expr(linitial(opexpr->args), context, true);
11837 6 : opname = generate_operator_name(opexpr->opno,
11838 6 : exprType(linitial(opexpr->args)),
11839 6 : exprType(lsecond(opexpr->args)));
11840 : }
11841 12 : else if (IsA(sublink->testexpr, BoolExpr))
11842 : {
11843 : /* multiple combining operators, = or <> cases */
11844 : char *sep;
11845 : ListCell *l;
11846 :
11847 6 : appendStringInfoChar(buf, '(');
11848 6 : sep = "";
11849 18 : foreach(l, ((BoolExpr *) sublink->testexpr)->args)
11850 : {
11851 12 : OpExpr *opexpr = lfirst_node(OpExpr, l);
11852 :
11853 12 : appendStringInfoString(buf, sep);
11854 12 : get_rule_expr(linitial(opexpr->args), context, true);
11855 12 : if (!opname)
11856 6 : opname = generate_operator_name(opexpr->opno,
11857 6 : exprType(linitial(opexpr->args)),
11858 6 : exprType(lsecond(opexpr->args)));
11859 12 : sep = ", ";
11860 : }
11861 6 : appendStringInfoChar(buf, ')');
11862 : }
11863 6 : else if (IsA(sublink->testexpr, RowCompareExpr))
11864 : {
11865 : /* multiple combining operators, < <= > >= cases */
11866 6 : RowCompareExpr *rcexpr = (RowCompareExpr *) sublink->testexpr;
11867 :
11868 6 : appendStringInfoChar(buf, '(');
11869 6 : get_rule_expr((Node *) rcexpr->largs, context, true);
11870 6 : opname = generate_operator_name(linitial_oid(rcexpr->opnos),
11871 6 : exprType(linitial(rcexpr->largs)),
11872 6 : exprType(linitial(rcexpr->rargs)));
11873 6 : appendStringInfoChar(buf, ')');
11874 : }
11875 : else
11876 0 : elog(ERROR, "unrecognized testexpr type: %d",
11877 : (int) nodeTag(sublink->testexpr));
11878 : }
11879 :
11880 460 : need_paren = true;
11881 :
11882 460 : switch (sublink->subLinkType)
11883 : {
11884 176 : case EXISTS_SUBLINK:
11885 176 : appendStringInfoString(buf, "EXISTS ");
11886 176 : break;
11887 :
11888 12 : case ANY_SUBLINK:
11889 12 : if (strcmp(opname, "=") == 0) /* Represent = ANY as IN */
11890 6 : appendStringInfoString(buf, " IN ");
11891 : else
11892 6 : appendStringInfo(buf, " %s ANY ", opname);
11893 12 : break;
11894 :
11895 6 : case ALL_SUBLINK:
11896 6 : appendStringInfo(buf, " %s ALL ", opname);
11897 6 : break;
11898 :
11899 0 : case ROWCOMPARE_SUBLINK:
11900 0 : appendStringInfo(buf, " %s ", opname);
11901 0 : break;
11902 :
11903 266 : case EXPR_SUBLINK:
11904 : case MULTIEXPR_SUBLINK:
11905 : case ARRAY_SUBLINK:
11906 266 : need_paren = false;
11907 266 : break;
11908 :
11909 0 : case CTE_SUBLINK: /* shouldn't occur in a SubLink */
11910 : default:
11911 0 : elog(ERROR, "unrecognized sublink type: %d",
11912 : (int) sublink->subLinkType);
11913 : break;
11914 : }
11915 :
11916 460 : if (need_paren)
11917 194 : appendStringInfoChar(buf, '(');
11918 :
11919 460 : get_query_def(query, buf, context->namespaces, NULL, false,
11920 : context->prettyFlags, context->wrapColumn,
11921 : context->indentLevel);
11922 :
11923 460 : if (need_paren)
11924 194 : appendStringInfoString(buf, "))");
11925 : else
11926 266 : appendStringInfoChar(buf, ')');
11927 460 : }
11928 :
11929 :
11930 : /* ----------
11931 : * get_xmltable - Parse back a XMLTABLE function
11932 : * ----------
11933 : */
11934 : static void
11935 62 : get_xmltable(TableFunc *tf, deparse_context *context, bool showimplicit)
11936 : {
11937 62 : StringInfo buf = context->buf;
11938 :
11939 62 : appendStringInfoString(buf, "XMLTABLE(");
11940 :
11941 62 : if (tf->ns_uris != NIL)
11942 : {
11943 : ListCell *lc1,
11944 : *lc2;
11945 16 : bool first = true;
11946 :
11947 16 : appendStringInfoString(buf, "XMLNAMESPACES (");
11948 32 : forboth(lc1, tf->ns_uris, lc2, tf->ns_names)
11949 : {
11950 16 : Node *expr = (Node *) lfirst(lc1);
11951 16 : String *ns_node = lfirst_node(String, lc2);
11952 :
11953 16 : if (!first)
11954 0 : appendStringInfoString(buf, ", ");
11955 : else
11956 16 : first = false;
11957 :
11958 16 : if (ns_node != NULL)
11959 : {
11960 16 : get_rule_expr(expr, context, showimplicit);
11961 16 : appendStringInfo(buf, " AS %s",
11962 16 : quote_identifier(strVal(ns_node)));
11963 : }
11964 : else
11965 : {
11966 0 : appendStringInfoString(buf, "DEFAULT ");
11967 0 : get_rule_expr(expr, context, showimplicit);
11968 : }
11969 : }
11970 16 : appendStringInfoString(buf, "), ");
11971 : }
11972 :
11973 62 : appendStringInfoChar(buf, '(');
11974 62 : get_rule_expr((Node *) tf->rowexpr, context, showimplicit);
11975 62 : appendStringInfoString(buf, ") PASSING (");
11976 62 : get_rule_expr((Node *) tf->docexpr, context, showimplicit);
11977 62 : appendStringInfoChar(buf, ')');
11978 :
11979 62 : if (tf->colexprs != NIL)
11980 : {
11981 : ListCell *l1;
11982 : ListCell *l2;
11983 : ListCell *l3;
11984 : ListCell *l4;
11985 : ListCell *l5;
11986 62 : int colnum = 0;
11987 :
11988 62 : appendStringInfoString(buf, " COLUMNS ");
11989 374 : forfive(l1, tf->colnames, l2, tf->coltypes, l3, tf->coltypmods,
11990 : l4, tf->colexprs, l5, tf->coldefexprs)
11991 : {
11992 312 : char *colname = strVal(lfirst(l1));
11993 312 : Oid typid = lfirst_oid(l2);
11994 312 : int32 typmod = lfirst_int(l3);
11995 312 : Node *colexpr = (Node *) lfirst(l4);
11996 312 : Node *coldefexpr = (Node *) lfirst(l5);
11997 312 : bool ordinality = (tf->ordinalitycol == colnum);
11998 312 : bool notnull = bms_is_member(colnum, tf->notnulls);
11999 :
12000 312 : if (colnum > 0)
12001 250 : appendStringInfoString(buf, ", ");
12002 312 : colnum++;
12003 :
12004 590 : appendStringInfo(buf, "%s %s", quote_identifier(colname),
12005 : ordinality ? "FOR ORDINALITY" :
12006 278 : format_type_with_typemod(typid, typmod));
12007 312 : if (ordinality)
12008 34 : continue;
12009 :
12010 278 : if (coldefexpr != NULL)
12011 : {
12012 34 : appendStringInfoString(buf, " DEFAULT (");
12013 34 : get_rule_expr((Node *) coldefexpr, context, showimplicit);
12014 34 : appendStringInfoChar(buf, ')');
12015 : }
12016 278 : if (colexpr != NULL)
12017 : {
12018 254 : appendStringInfoString(buf, " PATH (");
12019 254 : get_rule_expr((Node *) colexpr, context, showimplicit);
12020 254 : appendStringInfoChar(buf, ')');
12021 : }
12022 278 : if (notnull)
12023 34 : appendStringInfoString(buf, " NOT NULL");
12024 : }
12025 : }
12026 :
12027 62 : appendStringInfoChar(buf, ')');
12028 62 : }
12029 :
12030 : /*
12031 : * get_json_table_nested_columns - Parse back nested JSON_TABLE columns
12032 : */
12033 : static void
12034 102 : get_json_table_nested_columns(TableFunc *tf, JsonTablePlan *plan,
12035 : deparse_context *context, bool showimplicit,
12036 : bool needcomma)
12037 : {
12038 102 : if (IsA(plan, JsonTablePathScan))
12039 : {
12040 72 : JsonTablePathScan *scan = castNode(JsonTablePathScan, plan);
12041 :
12042 72 : if (needcomma)
12043 48 : appendStringInfoChar(context->buf, ',');
12044 :
12045 72 : appendStringInfoChar(context->buf, ' ');
12046 72 : appendContextKeyword(context, "NESTED PATH ", 0, 0, 0);
12047 72 : get_const_expr(scan->path->value, context, -1);
12048 72 : appendStringInfo(context->buf, " AS %s", quote_identifier(scan->path->name));
12049 72 : get_json_table_columns(tf, scan, context, showimplicit);
12050 : }
12051 30 : else if (IsA(plan, JsonTableSiblingJoin))
12052 : {
12053 30 : JsonTableSiblingJoin *join = (JsonTableSiblingJoin *) plan;
12054 :
12055 30 : get_json_table_nested_columns(tf, join->lplan, context, showimplicit,
12056 : needcomma);
12057 30 : get_json_table_nested_columns(tf, join->rplan, context, showimplicit,
12058 : true);
12059 : }
12060 102 : }
12061 :
12062 : /*
12063 : * get_json_table_columns - Parse back JSON_TABLE columns
12064 : */
12065 : static void
12066 180 : get_json_table_columns(TableFunc *tf, JsonTablePathScan *scan,
12067 : deparse_context *context,
12068 : bool showimplicit)
12069 : {
12070 180 : StringInfo buf = context->buf;
12071 : ListCell *lc_colname;
12072 : ListCell *lc_coltype;
12073 : ListCell *lc_coltypmod;
12074 : ListCell *lc_colvalexpr;
12075 180 : int colnum = 0;
12076 :
12077 180 : appendStringInfoChar(buf, ' ');
12078 180 : appendContextKeyword(context, "COLUMNS (", 0, 0, 0);
12079 :
12080 180 : if (PRETTY_INDENT(context))
12081 138 : context->indentLevel += PRETTYINDENT_VAR;
12082 :
12083 858 : forfour(lc_colname, tf->colnames,
12084 : lc_coltype, tf->coltypes,
12085 : lc_coltypmod, tf->coltypmods,
12086 : lc_colvalexpr, tf->colvalexprs)
12087 : {
12088 726 : char *colname = strVal(lfirst(lc_colname));
12089 : JsonExpr *colexpr;
12090 : Oid typid;
12091 : int32 typmod;
12092 : bool ordinality;
12093 : JsonBehaviorType default_behavior;
12094 :
12095 726 : typid = lfirst_oid(lc_coltype);
12096 726 : typmod = lfirst_int(lc_coltypmod);
12097 726 : colexpr = castNode(JsonExpr, lfirst(lc_colvalexpr));
12098 :
12099 : /* Skip columns that don't belong to this scan. */
12100 726 : if (scan->colMin < 0 || colnum < scan->colMin)
12101 : {
12102 264 : colnum++;
12103 264 : continue;
12104 : }
12105 462 : if (colnum > scan->colMax)
12106 48 : break;
12107 :
12108 414 : if (colnum > scan->colMin)
12109 258 : appendStringInfoString(buf, ", ");
12110 :
12111 414 : colnum++;
12112 :
12113 414 : ordinality = !colexpr;
12114 :
12115 414 : appendContextKeyword(context, "", 0, 0, 0);
12116 :
12117 810 : appendStringInfo(buf, "%s %s", quote_identifier(colname),
12118 : ordinality ? "FOR ORDINALITY" :
12119 396 : format_type_with_typemod(typid, typmod));
12120 414 : if (ordinality)
12121 18 : 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 396 : if (colexpr->op == JSON_EXISTS_OP)
12128 : {
12129 36 : appendStringInfoString(buf, " EXISTS");
12130 36 : default_behavior = JSON_BEHAVIOR_FALSE;
12131 : }
12132 : else
12133 : {
12134 360 : if (colexpr->op == JSON_QUERY_OP)
12135 : {
12136 : char typcategory;
12137 : bool typispreferred;
12138 :
12139 174 : get_type_category_preferred(typid, &typcategory, &typispreferred);
12140 :
12141 174 : if (typcategory == TYPCATEGORY_STRING)
12142 36 : appendStringInfoString(buf,
12143 36 : colexpr->format->format_type == JS_FORMAT_JSONB ?
12144 : " FORMAT JSONB" : " FORMAT JSON");
12145 : }
12146 :
12147 360 : default_behavior = JSON_BEHAVIOR_NULL;
12148 : }
12149 :
12150 396 : appendStringInfoString(buf, " PATH ");
12151 :
12152 396 : get_json_path_spec(colexpr->path_spec, context, showimplicit);
12153 :
12154 396 : get_json_expr_options(colexpr, context, default_behavior);
12155 : }
12156 :
12157 180 : if (scan->child)
12158 42 : get_json_table_nested_columns(tf, scan->child, context, showimplicit,
12159 42 : scan->colMin >= 0);
12160 :
12161 180 : if (PRETTY_INDENT(context))
12162 138 : context->indentLevel -= PRETTYINDENT_VAR;
12163 :
12164 180 : appendContextKeyword(context, ")", 0, 0, 0);
12165 180 : }
12166 :
12167 : /* ----------
12168 : * get_json_table - Parse back a JSON_TABLE function
12169 : * ----------
12170 : */
12171 : static void
12172 108 : get_json_table(TableFunc *tf, deparse_context *context, bool showimplicit)
12173 : {
12174 108 : StringInfo buf = context->buf;
12175 108 : JsonExpr *jexpr = castNode(JsonExpr, tf->docexpr);
12176 108 : JsonTablePathScan *root = castNode(JsonTablePathScan, tf->plan);
12177 :
12178 108 : appendStringInfoString(buf, "JSON_TABLE(");
12179 :
12180 108 : if (PRETTY_INDENT(context))
12181 66 : context->indentLevel += PRETTYINDENT_VAR;
12182 :
12183 108 : appendContextKeyword(context, "", 0, 0, 0);
12184 :
12185 108 : get_rule_expr(jexpr->formatted_expr, context, showimplicit);
12186 :
12187 108 : appendStringInfoString(buf, ", ");
12188 :
12189 108 : get_const_expr(root->path->value, context, -1);
12190 :
12191 108 : appendStringInfo(buf, " AS %s", quote_identifier(root->path->name));
12192 :
12193 108 : if (jexpr->passing_values)
12194 : {
12195 : ListCell *lc1,
12196 : *lc2;
12197 84 : bool needcomma = false;
12198 :
12199 84 : appendStringInfoChar(buf, ' ');
12200 84 : appendContextKeyword(context, "PASSING ", 0, 0, 0);
12201 :
12202 84 : if (PRETTY_INDENT(context))
12203 42 : context->indentLevel += PRETTYINDENT_VAR;
12204 :
12205 252 : forboth(lc1, jexpr->passing_names,
12206 : lc2, jexpr->passing_values)
12207 : {
12208 168 : if (needcomma)
12209 84 : appendStringInfoString(buf, ", ");
12210 168 : needcomma = true;
12211 :
12212 168 : appendContextKeyword(context, "", 0, 0, 0);
12213 :
12214 168 : get_rule_expr((Node *) lfirst(lc2), context, false);
12215 168 : appendStringInfo(buf, " AS %s",
12216 168 : quote_identifier((lfirst_node(String, lc1))->sval)
12217 : );
12218 : }
12219 :
12220 84 : if (PRETTY_INDENT(context))
12221 42 : context->indentLevel -= PRETTYINDENT_VAR;
12222 : }
12223 :
12224 108 : get_json_table_columns(tf, castNode(JsonTablePathScan, tf->plan), context,
12225 : showimplicit);
12226 :
12227 108 : if (jexpr->on_error->btype != JSON_BEHAVIOR_EMPTY_ARRAY)
12228 6 : get_json_behavior(jexpr->on_error, context, "ERROR");
12229 :
12230 108 : if (PRETTY_INDENT(context))
12231 66 : context->indentLevel -= PRETTYINDENT_VAR;
12232 :
12233 108 : appendContextKeyword(context, ")", 0, 0, 0);
12234 108 : }
12235 :
12236 : /* ----------
12237 : * get_tablefunc - Parse back a table function
12238 : * ----------
12239 : */
12240 : static void
12241 170 : get_tablefunc(TableFunc *tf, deparse_context *context, bool showimplicit)
12242 : {
12243 : /* XMLTABLE and JSON_TABLE are the only existing implementations. */
12244 :
12245 170 : if (tf->functype == TFT_XMLTABLE)
12246 62 : get_xmltable(tf, context, showimplicit);
12247 108 : else if (tf->functype == TFT_JSON_TABLE)
12248 108 : get_json_table(tf, context, showimplicit);
12249 170 : }
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 : */
12259 : static void
12260 4988 : get_from_clause(Query *query, const char *prefix, deparse_context *context)
12261 : {
12262 4988 : StringInfo buf = context->buf;
12263 4988 : 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 9906 : foreach(l, query->jointree->fromlist)
12274 : {
12275 4918 : Node *jtnode = (Node *) lfirst(l);
12276 :
12277 4918 : if (IsA(jtnode, RangeTblRef))
12278 : {
12279 3966 : int varno = ((RangeTblRef *) jtnode)->rtindex;
12280 3966 : RangeTblEntry *rte = rt_fetch(varno, query->rtable);
12281 :
12282 3966 : if (!rte->inFromCl)
12283 400 : continue;
12284 : }
12285 :
12286 4518 : if (first)
12287 : {
12288 4172 : appendContextKeyword(context, prefix,
12289 : -PRETTYINDENT_STD, PRETTYINDENT_STD, 2);
12290 4172 : first = false;
12291 :
12292 4172 : get_from_clause_item(jtnode, query, context);
12293 : }
12294 : else
12295 : {
12296 : StringInfoData itembuf;
12297 :
12298 346 : 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 346 : initStringInfo(&itembuf);
12305 346 : context->buf = &itembuf;
12306 :
12307 346 : get_from_clause_item(jtnode, query, context);
12308 :
12309 : /* Restore context's output buffer */
12310 346 : context->buf = buf;
12311 :
12312 : /* Consider line-wrapping if enabled */
12313 346 : if (PRETTY_INDENT(context) && context->wrapColumn >= 0)
12314 : {
12315 : /* Does the new item start with a new line? */
12316 346 : 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 0 : removeStringInfoSpaces(buf);
12321 : }
12322 : else
12323 : {
12324 : char *trailing_nl;
12325 :
12326 : /* Locate the start of the current line in the buffer */
12327 346 : trailing_nl = strrchr(buf->data, '\n');
12328 346 : if (trailing_nl == NULL)
12329 0 : trailing_nl = buf->data;
12330 : else
12331 346 : trailing_nl++;
12332 :
12333 : /*
12334 : * Add a newline, plus some indentation, if the new item
12335 : * would cause an overflow.
12336 : */
12337 346 : if (strlen(trailing_nl) + itembuf.len > context->wrapColumn)
12338 346 : appendContextKeyword(context, "", -PRETTYINDENT_STD,
12339 : PRETTYINDENT_STD,
12340 : PRETTYINDENT_VAR);
12341 : }
12342 : }
12343 :
12344 : /* Add the new item */
12345 346 : appendBinaryStringInfo(buf, itembuf.data, itembuf.len);
12346 :
12347 : /* clean up */
12348 346 : pfree(itembuf.data);
12349 : }
12350 : }
12351 4988 : }
12352 :
12353 : static void
12354 7514 : get_from_clause_item(Node *jtnode, Query *query, deparse_context *context)
12355 : {
12356 7514 : StringInfo buf = context->buf;
12357 7514 : deparse_namespace *dpns = (deparse_namespace *) linitial(context->namespaces);
12358 :
12359 7514 : if (IsA(jtnode, RangeTblRef))
12360 : {
12361 6016 : int varno = ((RangeTblRef *) jtnode)->rtindex;
12362 6016 : RangeTblEntry *rte = rt_fetch(varno, query->rtable);
12363 6016 : deparse_columns *colinfo = deparse_columns_fetch(varno, dpns);
12364 6016 : RangeTblFunction *rtfunc1 = NULL;
12365 :
12366 6016 : if (rte->lateral)
12367 112 : appendStringInfoString(buf, "LATERAL ");
12368 :
12369 : /* Print the FROM item proper */
12370 6016 : switch (rte->rtekind)
12371 : {
12372 4620 : case RTE_RELATION:
12373 : /* Normal relation RTE */
12374 9240 : appendStringInfo(buf, "%s%s",
12375 4620 : only_marker(rte),
12376 : generate_relation_name(rte->relid,
12377 : context->namespaces));
12378 4620 : break;
12379 292 : case RTE_SUBQUERY:
12380 : /* Subquery RTE */
12381 292 : appendStringInfoChar(buf, '(');
12382 292 : get_query_def(rte->subquery, buf, context->namespaces, NULL,
12383 : true,
12384 : context->prettyFlags, context->wrapColumn,
12385 : context->indentLevel);
12386 292 : appendStringInfoChar(buf, ')');
12387 292 : break;
12388 810 : case RTE_FUNCTION:
12389 : /* Function RTE */
12390 810 : 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 810 : if (list_length(rte->functions) == 1 &&
12399 780 : (rtfunc1->funccolnames == NIL || !rte->funcordinality))
12400 : {
12401 780 : 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 30 : all_unnest = true;
12424 78 : foreach(lc, rte->functions)
12425 : {
12426 66 : RangeTblFunction *rtfunc = (RangeTblFunction *) lfirst(lc);
12427 :
12428 66 : if (!IsA(rtfunc->funcexpr, FuncExpr) ||
12429 66 : ((FuncExpr *) rtfunc->funcexpr)->funcid != F_UNNEST_ANYARRAY ||
12430 48 : rtfunc->funccolnames != NIL)
12431 : {
12432 18 : all_unnest = false;
12433 18 : break;
12434 : }
12435 : }
12436 :
12437 30 : if (all_unnest)
12438 : {
12439 12 : List *allargs = NIL;
12440 :
12441 48 : foreach(lc, rte->functions)
12442 : {
12443 36 : RangeTblFunction *rtfunc = (RangeTblFunction *) lfirst(lc);
12444 36 : List *args = ((FuncExpr *) rtfunc->funcexpr)->args;
12445 :
12446 36 : allargs = list_concat(allargs, args);
12447 : }
12448 :
12449 12 : appendStringInfoString(buf, "UNNEST(");
12450 12 : get_rule_expr((Node *) allargs, context, true);
12451 12 : appendStringInfoChar(buf, ')');
12452 : }
12453 : else
12454 : {
12455 18 : int funcno = 0;
12456 :
12457 18 : appendStringInfoString(buf, "ROWS FROM(");
12458 66 : foreach(lc, rte->functions)
12459 : {
12460 48 : RangeTblFunction *rtfunc = (RangeTblFunction *) lfirst(lc);
12461 :
12462 48 : if (funcno > 0)
12463 30 : appendStringInfoString(buf, ", ");
12464 48 : get_rule_expr_funccall(rtfunc->funcexpr, context, true);
12465 48 : if (rtfunc->funccolnames != NIL)
12466 : {
12467 : /* Reconstruct the column definition list */
12468 6 : appendStringInfoString(buf, " AS ");
12469 6 : get_from_clause_coldeflist(rtfunc,
12470 : NULL,
12471 : context);
12472 : }
12473 48 : funcno++;
12474 : }
12475 18 : appendStringInfoChar(buf, ')');
12476 : }
12477 : /* prevent printing duplicate coldeflist below */
12478 30 : rtfunc1 = NULL;
12479 : }
12480 810 : if (rte->funcordinality)
12481 18 : appendStringInfoString(buf, " WITH ORDINALITY");
12482 810 : break;
12483 98 : case RTE_TABLEFUNC:
12484 98 : get_tablefunc(rte->tablefunc, context, true);
12485 98 : break;
12486 12 : case RTE_VALUES:
12487 : /* Values list RTE */
12488 12 : appendStringInfoChar(buf, '(');
12489 12 : get_values_def(rte->values_lists, context);
12490 12 : appendStringInfoChar(buf, ')');
12491 12 : break;
12492 184 : case RTE_CTE:
12493 184 : appendStringInfoString(buf, quote_identifier(rte->ctename));
12494 184 : break;
12495 0 : default:
12496 0 : elog(ERROR, "unrecognized RTE kind: %d", (int) rte->rtekind);
12497 : break;
12498 : }
12499 :
12500 : /* Print the relation alias, if needed */
12501 6016 : get_rte_alias(rte, varno, false, context);
12502 :
12503 : /* Print the column definitions or aliases, if needed */
12504 6016 : if (rtfunc1 && rtfunc1->funccolnames != NIL)
12505 : {
12506 : /* Reconstruct the columndef list, which is also the aliases */
12507 0 : get_from_clause_coldeflist(rtfunc1, colinfo, context);
12508 : }
12509 : else
12510 : {
12511 : /* Else print column aliases as needed */
12512 6016 : get_column_alias_list(colinfo, context);
12513 : }
12514 :
12515 : /* Tablesample clause must go after any alias */
12516 6016 : if (rte->rtekind == RTE_RELATION && rte->tablesample)
12517 32 : get_tablesample_def(rte->tablesample, context);
12518 : }
12519 1498 : else if (IsA(jtnode, JoinExpr))
12520 : {
12521 1498 : JoinExpr *j = (JoinExpr *) jtnode;
12522 1498 : deparse_columns *colinfo = deparse_columns_fetch(j->rtindex, dpns);
12523 : bool need_paren_on_right;
12524 :
12525 3434 : need_paren_on_right = PRETTY_PAREN(context) &&
12526 1498 : !IsA(j->rarg, RangeTblRef) &&
12527 0 : !(IsA(j->rarg, JoinExpr) && ((JoinExpr *) j->rarg)->alias != NULL);
12528 :
12529 1498 : if (!PRETTY_PAREN(context) || j->alias != NULL)
12530 1168 : appendStringInfoChar(buf, '(');
12531 :
12532 1498 : get_from_clause_item(j->larg, query, context);
12533 :
12534 1498 : switch (j->jointype)
12535 : {
12536 820 : case JOIN_INNER:
12537 820 : if (j->quals)
12538 778 : appendContextKeyword(context, " JOIN ",
12539 : -PRETTYINDENT_STD,
12540 : PRETTYINDENT_STD,
12541 : PRETTYINDENT_JOIN);
12542 : else
12543 42 : appendContextKeyword(context, " CROSS JOIN ",
12544 : -PRETTYINDENT_STD,
12545 : PRETTYINDENT_STD,
12546 : PRETTYINDENT_JOIN);
12547 820 : break;
12548 576 : case JOIN_LEFT:
12549 576 : appendContextKeyword(context, " LEFT JOIN ",
12550 : -PRETTYINDENT_STD,
12551 : PRETTYINDENT_STD,
12552 : PRETTYINDENT_JOIN);
12553 576 : break;
12554 102 : case JOIN_FULL:
12555 102 : appendContextKeyword(context, " FULL JOIN ",
12556 : -PRETTYINDENT_STD,
12557 : PRETTYINDENT_STD,
12558 : PRETTYINDENT_JOIN);
12559 102 : break;
12560 0 : case JOIN_RIGHT:
12561 0 : appendContextKeyword(context, " RIGHT JOIN ",
12562 : -PRETTYINDENT_STD,
12563 : PRETTYINDENT_STD,
12564 : PRETTYINDENT_JOIN);
12565 0 : break;
12566 0 : default:
12567 0 : elog(ERROR, "unrecognized join type: %d",
12568 : (int) j->jointype);
12569 : }
12570 :
12571 1498 : if (need_paren_on_right)
12572 0 : appendStringInfoChar(buf, '(');
12573 1498 : get_from_clause_item(j->rarg, query, context);
12574 1498 : if (need_paren_on_right)
12575 0 : appendStringInfoChar(buf, ')');
12576 :
12577 1498 : if (j->usingClause)
12578 : {
12579 : ListCell *lc;
12580 424 : bool first = true;
12581 :
12582 424 : appendStringInfoString(buf, " USING (");
12583 : /* Use the assigned names, not what's in usingClause */
12584 1004 : foreach(lc, colinfo->usingNames)
12585 : {
12586 580 : char *colname = (char *) lfirst(lc);
12587 :
12588 580 : if (first)
12589 424 : first = false;
12590 : else
12591 156 : appendStringInfoString(buf, ", ");
12592 580 : appendStringInfoString(buf, quote_identifier(colname));
12593 : }
12594 424 : appendStringInfoChar(buf, ')');
12595 :
12596 424 : if (j->join_using_alias)
12597 12 : appendStringInfo(buf, " AS %s",
12598 12 : quote_identifier(j->join_using_alias->aliasname));
12599 : }
12600 1074 : else if (j->quals)
12601 : {
12602 1026 : appendStringInfoString(buf, " ON ");
12603 1026 : if (!PRETTY_PAREN(context))
12604 1020 : appendStringInfoChar(buf, '(');
12605 1026 : get_rule_expr(j->quals, context, false);
12606 1026 : if (!PRETTY_PAREN(context))
12607 1020 : appendStringInfoChar(buf, ')');
12608 : }
12609 48 : else if (j->jointype != JOIN_INNER)
12610 : {
12611 : /* If we didn't say CROSS JOIN above, we must provide an ON */
12612 6 : appendStringInfoString(buf, " ON TRUE");
12613 : }
12614 :
12615 1498 : if (!PRETTY_PAREN(context) || j->alias != NULL)
12616 1168 : appendStringInfoChar(buf, ')');
12617 :
12618 : /* Yes, it's correct to put alias after the right paren ... */
12619 1498 : 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 108 : appendStringInfo(buf, " %s",
12629 108 : quote_identifier(get_rtable_name(j->rtindex,
12630 : context)));
12631 108 : get_column_alias_list(colinfo, context);
12632 : }
12633 : }
12634 : else
12635 0 : elog(ERROR, "unrecognized node type: %d",
12636 : (int) nodeTag(jtnode));
12637 7514 : }
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 : */
12644 : static void
12645 6598 : get_rte_alias(RangeTblEntry *rte, int varno, bool use_as,
12646 : deparse_context *context)
12647 : {
12648 6598 : deparse_namespace *dpns = (deparse_namespace *) linitial(context->namespaces);
12649 6598 : char *refname = get_rtable_name(varno, context);
12650 6598 : deparse_columns *colinfo = deparse_columns_fetch(varno, dpns);
12651 6598 : bool printalias = false;
12652 :
12653 6598 : if (rte->alias != NULL)
12654 : {
12655 : /* Always print alias if user provided one */
12656 3034 : printalias = true;
12657 : }
12658 3564 : else if (colinfo->printaliases)
12659 : {
12660 : /* Always print alias if we need to print column aliases */
12661 294 : printalias = true;
12662 : }
12663 3270 : 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 2998 : if (strcmp(refname, get_relation_name(rte->relid)) != 0)
12671 80 : printalias = true;
12672 : }
12673 272 : 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 0 : printalias = true;
12682 : }
12683 272 : else if (rte->rtekind == RTE_SUBQUERY ||
12684 248 : 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 36 : printalias = true;
12692 : }
12693 236 : 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 144 : if (strcmp(refname, rte->ctename) != 0)
12701 22 : printalias = true;
12702 : }
12703 :
12704 6598 : if (printalias)
12705 3466 : appendStringInfo(context->buf, "%s%s",
12706 : use_as ? " AS " : " ",
12707 : quote_identifier(refname));
12708 6598 : }
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 : */
12715 : static void
12716 6124 : get_column_alias_list(deparse_columns *colinfo, deparse_context *context)
12717 : {
12718 6124 : StringInfo buf = context->buf;
12719 : int i;
12720 6124 : bool first = true;
12721 :
12722 : /* Don't print aliases if not needed */
12723 6124 : if (!colinfo->printaliases)
12724 4954 : return;
12725 :
12726 9384 : for (i = 0; i < colinfo->num_new_cols; i++)
12727 : {
12728 8214 : char *colname = colinfo->new_colnames[i];
12729 :
12730 8214 : if (first)
12731 : {
12732 1170 : appendStringInfoChar(buf, '(');
12733 1170 : first = false;
12734 : }
12735 : else
12736 7044 : appendStringInfoString(buf, ", ");
12737 8214 : appendStringInfoString(buf, quote_identifier(colname));
12738 : }
12739 1170 : if (!first)
12740 1170 : 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 : */
12755 : static void
12756 6 : get_from_clause_coldeflist(RangeTblFunction *rtfunc,
12757 : deparse_columns *colinfo,
12758 : deparse_context *context)
12759 : {
12760 6 : StringInfo buf = context->buf;
12761 : ListCell *l1;
12762 : ListCell *l2;
12763 : ListCell *l3;
12764 : ListCell *l4;
12765 : int i;
12766 :
12767 6 : appendStringInfoChar(buf, '(');
12768 :
12769 6 : i = 0;
12770 24 : forfour(l1, rtfunc->funccoltypes,
12771 : l2, rtfunc->funccoltypmods,
12772 : l3, rtfunc->funccolcollations,
12773 : l4, rtfunc->funccolnames)
12774 : {
12775 18 : Oid atttypid = lfirst_oid(l1);
12776 18 : int32 atttypmod = lfirst_int(l2);
12777 18 : Oid attcollation = lfirst_oid(l3);
12778 : char *attname;
12779 :
12780 18 : if (colinfo)
12781 0 : attname = colinfo->colnames[i];
12782 : else
12783 18 : attname = strVal(lfirst(l4));
12784 :
12785 : Assert(attname); /* shouldn't be any dropped columns here */
12786 :
12787 18 : if (i > 0)
12788 12 : appendStringInfoString(buf, ", ");
12789 18 : appendStringInfo(buf, "%s %s",
12790 : quote_identifier(attname),
12791 : format_type_with_typemod(atttypid, atttypmod));
12792 24 : if (OidIsValid(attcollation) &&
12793 6 : attcollation != get_typcollation(atttypid))
12794 0 : appendStringInfo(buf, " COLLATE %s",
12795 : generate_collation_name(attcollation));
12796 :
12797 18 : i++;
12798 : }
12799 :
12800 6 : appendStringInfoChar(buf, ')');
12801 6 : }
12802 :
12803 : /*
12804 : * get_tablesample_def - print a TableSampleClause
12805 : */
12806 : static void
12807 32 : get_tablesample_def(TableSampleClause *tablesample, deparse_context *context)
12808 : {
12809 32 : 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 32 : argtypes[0] = INTERNALOID;
12819 32 : appendStringInfo(buf, " TABLESAMPLE %s (",
12820 : generate_function_name(tablesample->tsmhandler, 1,
12821 : NIL, argtypes,
12822 : false, NULL, false));
12823 :
12824 32 : nargs = 0;
12825 64 : foreach(l, tablesample->args)
12826 : {
12827 32 : if (nargs++ > 0)
12828 0 : appendStringInfoString(buf, ", ");
12829 32 : get_rule_expr((Node *) lfirst(l), context, false);
12830 : }
12831 32 : appendStringInfoChar(buf, ')');
12832 :
12833 32 : if (tablesample->repeatable != NULL)
12834 : {
12835 16 : appendStringInfoString(buf, " REPEATABLE (");
12836 16 : get_rule_expr((Node *) tablesample->repeatable, context, false);
12837 16 : appendStringInfoChar(buf, ')');
12838 : }
12839 32 : }
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 : */
12850 : static void
12851 12770 : get_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 12770 : ht_opc = SearchSysCache1(CLAOID, ObjectIdGetDatum(opclass));
12860 12770 : if (!HeapTupleIsValid(ht_opc))
12861 0 : elog(ERROR, "cache lookup failed for opclass %u", opclass);
12862 12770 : opcrec = (Form_pg_opclass) GETSTRUCT(ht_opc);
12863 :
12864 25500 : if (!OidIsValid(actual_datatype) ||
12865 12730 : GetDefaultOpClass(actual_datatype, opcrec->opcmethod) != opclass)
12866 : {
12867 : /* Okay, we need the opclass name. Do we need to qualify it? */
12868 558 : opcname = NameStr(opcrec->opcname);
12869 558 : if (OpclassIsVisible(opclass))
12870 558 : appendStringInfo(buf, " %s", quote_identifier(opcname));
12871 : else
12872 : {
12873 0 : nspname = get_namespace_name_or_temp(opcrec->opcnamespace);
12874 0 : appendStringInfo(buf, " %s.%s",
12875 : quote_identifier(nspname),
12876 : quote_identifier(opcname));
12877 : }
12878 : }
12879 12770 : ReleaseSysCache(ht_opc);
12880 12770 : }
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 : */
12888 : char *
12889 6 : generate_opclass_name(Oid opclass)
12890 : {
12891 : StringInfoData buf;
12892 :
12893 6 : initStringInfo(&buf);
12894 6 : get_opclass_name(opclass, InvalidOid, &buf);
12895 :
12896 6 : 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 : */
12910 : static Node *
12911 1272 : processIndirection(Node *node, deparse_context *context)
12912 : {
12913 1272 : StringInfo buf = context->buf;
12914 1272 : CoerceToDomain *cdomain = NULL;
12915 :
12916 : for (;;)
12917 : {
12918 1578 : if (node == NULL)
12919 0 : break;
12920 1578 : if (IsA(node, FieldStore))
12921 : {
12922 108 : FieldStore *fstore = (FieldStore *) node;
12923 : Oid typrelid;
12924 : char *fieldname;
12925 :
12926 : /* lookup tuple type */
12927 108 : typrelid = get_typ_typrelid(fstore->resulttype);
12928 108 : if (!OidIsValid(typrelid))
12929 0 : 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 108 : fieldname = get_attname(typrelid,
12939 108 : linitial_int(fstore->fieldnums), false);
12940 108 : 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 108 : node = (Node *) linitial(fstore->newvals);
12947 : }
12948 1470 : else if (IsA(node, SubscriptingRef))
12949 : {
12950 138 : SubscriptingRef *sbsref = (SubscriptingRef *) node;
12951 :
12952 138 : if (sbsref->refassgnexpr == NULL)
12953 0 : break;
12954 :
12955 138 : 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 138 : node = (Node *) sbsref->refassgnexpr;
12962 : }
12963 1332 : else if (IsA(node, CoerceToDomain))
12964 : {
12965 60 : cdomain = (CoerceToDomain *) node;
12966 : /* If it's an explicit domain coercion, we're done */
12967 60 : if (cdomain->coercionformat != COERCE_IMPLICIT_CAST)
12968 0 : break;
12969 : /* Tentatively descend past the CoerceToDomain */
12970 60 : node = (Node *) cdomain->arg;
12971 : }
12972 : else
12973 1272 : 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 1272 : if (cdomain && node == (Node *) cdomain->arg)
12983 0 : node = (Node *) cdomain;
12984 :
12985 1272 : return node;
12986 : }
12987 :
12988 : static void
12989 454 : printSubscripts(SubscriptingRef *sbsref, deparse_context *context)
12990 : {
12991 454 : StringInfo buf = context->buf;
12992 : ListCell *lowlist_item;
12993 : ListCell *uplist_item;
12994 :
12995 454 : lowlist_item = list_head(sbsref->reflowerindexpr); /* could be NULL */
12996 908 : foreach(uplist_item, sbsref->refupperindexpr)
12997 : {
12998 454 : appendStringInfoChar(buf, '[');
12999 454 : if (lowlist_item)
13000 : {
13001 : /* If subexpression is NULL, get_rule_expr prints nothing */
13002 0 : get_rule_expr((Node *) lfirst(lowlist_item), context, false);
13003 0 : appendStringInfoChar(buf, ':');
13004 0 : lowlist_item = lnext(sbsref->reflowerindexpr, lowlist_item);
13005 : }
13006 : /* If subexpression is NULL, get_rule_expr prints nothing */
13007 454 : get_rule_expr((Node *) lfirst(uplist_item), context, false);
13008 454 : appendStringInfoChar(buf, ']');
13009 : }
13010 454 : }
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 : */
13018 : const char *
13019 2522512 : quote_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 2522512 : 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 2522512 : safe = ((ident[0] >= 'a' && ident[0] <= 'z') || ident[0] == '_');
13037 :
13038 21888436 : for (ptr = ident; *ptr; ptr++)
13039 : {
13040 19365924 : char ch = *ptr;
13041 :
13042 19365924 : if ((ch >= 'a' && ch <= 'z') ||
13043 2303984 : (ch >= '0' && ch <= '9') ||
13044 : (ch == '_'))
13045 : {
13046 : /* okay */
13047 : }
13048 : else
13049 : {
13050 62542 : safe = false;
13051 62542 : if (ch == '"')
13052 12 : nquotes++;
13053 : }
13054 : }
13055 :
13056 2522512 : if (quote_all_identifiers)
13057 12318 : safe = false;
13058 :
13059 2522512 : 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 2484144 : int kwnum = ScanKeywordLookup(ident, &ScanKeywords);
13070 :
13071 2484144 : if (kwnum >= 0 && ScanKeywordCategories[kwnum] != UNRESERVED_KEYWORD)
13072 3198 : safe = false;
13073 : }
13074 :
13075 2522512 : if (safe)
13076 2480946 : return ident; /* no change needed */
13077 :
13078 41566 : result = (char *) palloc(strlen(ident) + nquotes + 2 + 1);
13079 :
13080 41566 : optr = result;
13081 41566 : *optr++ = '"';
13082 243238 : for (ptr = ident; *ptr; ptr++)
13083 : {
13084 201672 : char ch = *ptr;
13085 :
13086 201672 : if (ch == '"')
13087 12 : *optr++ = '"';
13088 201672 : *optr++ = ch;
13089 : }
13090 41566 : *optr++ = '"';
13091 41566 : *optr = '\0';
13092 :
13093 41566 : 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 : */
13102 : char *
13103 1254350 : quote_qualified_identifier(const char *qualifier,
13104 : const char *ident)
13105 : {
13106 : StringInfoData buf;
13107 :
13108 1254350 : initStringInfo(&buf);
13109 1254350 : if (qualifier)
13110 454098 : appendStringInfo(&buf, "%s.", quote_identifier(qualifier));
13111 1254350 : appendStringInfoString(&buf, quote_identifier(ident));
13112 1254350 : 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 : */
13122 : static char *
13123 16388 : get_relation_name(Oid relid)
13124 : {
13125 16388 : char *relname = get_rel_name(relid);
13126 :
13127 16388 : if (!relname)
13128 0 : elog(ERROR, "cache lookup failed for relation %u", relid);
13129 16388 : 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 : */
13142 : static char *
13143 7994 : generate_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 7994 : tp = SearchSysCache1(RELOID, ObjectIdGetDatum(relid));
13154 7994 : if (!HeapTupleIsValid(tp))
13155 0 : elog(ERROR, "cache lookup failed for relation %u", relid);
13156 7994 : reltup = (Form_pg_class) GETSTRUCT(tp);
13157 7994 : relname = NameStr(reltup->relname);
13158 :
13159 : /* Check for conflicting CTE name */
13160 7994 : need_qual = false;
13161 13848 : foreach(nslist, namespaces)
13162 : {
13163 5854 : deparse_namespace *dpns = (deparse_namespace *) lfirst(nslist);
13164 : ListCell *ctlist;
13165 :
13166 5986 : foreach(ctlist, dpns->ctes)
13167 : {
13168 132 : CommonTableExpr *cte = (CommonTableExpr *) lfirst(ctlist);
13169 :
13170 132 : if (strcmp(cte->ctename, relname) == 0)
13171 : {
13172 0 : need_qual = true;
13173 0 : break;
13174 : }
13175 : }
13176 5854 : if (need_qual)
13177 0 : break;
13178 : }
13179 :
13180 : /* Otherwise, qualify the name if not visible in search path */
13181 7994 : if (!need_qual)
13182 7994 : need_qual = !RelationIsVisible(relid);
13183 :
13184 7994 : if (need_qual)
13185 2416 : nspname = get_namespace_name_or_temp(reltup->relnamespace);
13186 : else
13187 5578 : nspname = NULL;
13188 :
13189 7994 : result = quote_qualified_identifier(nspname, relname);
13190 :
13191 7994 : ReleaseSysCache(tp);
13192 :
13193 7994 : 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 : */
13202 : static char *
13203 8272 : generate_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 8272 : tp = SearchSysCache1(RELOID, ObjectIdGetDatum(relid));
13212 8272 : if (!HeapTupleIsValid(tp))
13213 0 : elog(ERROR, "cache lookup failed for relation %u", relid);
13214 8272 : reltup = (Form_pg_class) GETSTRUCT(tp);
13215 8272 : relname = NameStr(reltup->relname);
13216 :
13217 8272 : nspname = get_namespace_name_or_temp(reltup->relnamespace);
13218 8272 : if (!nspname)
13219 0 : elog(ERROR, "cache lookup failed for namespace %u",
13220 : reltup->relnamespace);
13221 :
13222 8272 : result = quote_qualified_identifier(nspname, relname);
13223 :
13224 8272 : ReleaseSysCache(tp);
13225 :
13226 8272 : 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 : */
13246 : static char *
13247 12600 : generate_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 12600 : bool force_qualify = false;
13265 :
13266 12600 : proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
13267 12600 : if (!HeapTupleIsValid(proctup))
13268 0 : elog(ERROR, "cache lookup failed for function %u", funcid);
13269 12600 : procform = (Form_pg_proc) GETSTRUCT(proctup);
13270 12600 : 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 12600 : if (inGroupBy)
13277 : {
13278 0 : if (strcmp(proname, "cube") == 0 || strcmp(proname, "rollup") == 0)
13279 0 : 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 12600 : if (use_variadic_p)
13293 : {
13294 : /* Parser should not have set funcvariadic unless fn is variadic */
13295 : Assert(!has_variadic || OidIsValid(procform->provariadic));
13296 10834 : use_variadic = has_variadic;
13297 10834 : *use_variadic_p = use_variadic;
13298 : }
13299 : else
13300 : {
13301 : Assert(!has_variadic);
13302 1766 : 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 12600 : if (!force_qualify)
13313 12600 : p_result = func_get_detail(list_make1(makeString(proname)),
13314 : NIL, argnames, nargs, argtypes,
13315 12600 : !use_variadic, true, false,
13316 : &p_funcid, &p_rettype,
13317 : &p_retset, &p_nvargs, &p_vatype,
13318 12600 : &p_true_typeids, NULL);
13319 : else
13320 : {
13321 0 : p_result = FUNCDETAIL_NOTFOUND;
13322 0 : p_funcid = InvalidOid;
13323 : }
13324 :
13325 12600 : if ((p_result == FUNCDETAIL_NORMAL ||
13326 1290 : p_result == FUNCDETAIL_AGGREGATE ||
13327 11418 : p_result == FUNCDETAIL_WINDOWFUNC) &&
13328 11418 : p_funcid == funcid)
13329 11418 : nspname = NULL;
13330 : else
13331 1182 : nspname = get_namespace_name_or_temp(procform->pronamespace);
13332 :
13333 12600 : result = quote_qualified_identifier(nspname, proname);
13334 :
13335 12600 : ReleaseSysCache(proctup);
13336 :
13337 12600 : 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 : */
13351 : static char *
13352 62668 : generate_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 62668 : initStringInfo(&buf);
13362 :
13363 62668 : opertup = SearchSysCache1(OPEROID, ObjectIdGetDatum(operid));
13364 62668 : if (!HeapTupleIsValid(opertup))
13365 0 : elog(ERROR, "cache lookup failed for operator %u", operid);
13366 62668 : operform = (Form_pg_operator) GETSTRUCT(opertup);
13367 62668 : 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 62668 : switch (operform->oprkind)
13375 : {
13376 62638 : case 'b':
13377 62638 : p_result = oper(NULL, list_make1(makeString(oprname)), arg1, arg2,
13378 : true, -1);
13379 62638 : break;
13380 30 : case 'l':
13381 30 : p_result = left_oper(NULL, list_make1(makeString(oprname)), arg2,
13382 : true, -1);
13383 30 : break;
13384 0 : default:
13385 0 : elog(ERROR, "unrecognized oprkind: %d", operform->oprkind);
13386 : p_result = NULL; /* keep compiler quiet */
13387 : break;
13388 : }
13389 :
13390 62668 : if (p_result != NULL && oprid(p_result) == operid)
13391 62658 : nspname = NULL;
13392 : else
13393 : {
13394 10 : nspname = get_namespace_name_or_temp(operform->oprnamespace);
13395 10 : appendStringInfo(&buf, "OPERATOR(%s.", quote_identifier(nspname));
13396 : }
13397 :
13398 62668 : appendStringInfoString(&buf, oprname);
13399 :
13400 62668 : if (nspname)
13401 10 : appendStringInfoChar(&buf, ')');
13402 :
13403 62668 : if (p_result != NULL)
13404 62658 : ReleaseSysCache(p_result);
13405 :
13406 62668 : ReleaseSysCache(opertup);
13407 :
13408 62668 : 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 : */
13428 : void
13429 6108 : generate_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 6108 : opertup = SearchSysCache1(OPEROID, ObjectIdGetDatum(opoid));
13440 6108 : if (!HeapTupleIsValid(opertup))
13441 0 : elog(ERROR, "cache lookup failed for operator %u", opoid);
13442 6108 : operform = (Form_pg_operator) GETSTRUCT(opertup);
13443 : Assert(operform->oprkind == 'b');
13444 6108 : oprname = NameStr(operform->oprname);
13445 :
13446 6108 : nspname = get_namespace_name(operform->oprnamespace);
13447 :
13448 6108 : appendStringInfoString(buf, leftop);
13449 6108 : if (leftoptype != operform->oprleft)
13450 904 : add_cast_to(buf, operform->oprleft);
13451 6108 : appendStringInfo(buf, " OPERATOR(%s.", quote_identifier(nspname));
13452 6108 : appendStringInfoString(buf, oprname);
13453 6108 : appendStringInfo(buf, ") %s", rightop);
13454 6108 : if (rightoptype != operform->oprright)
13455 742 : add_cast_to(buf, operform->oprright);
13456 :
13457 6108 : ReleaseSysCache(opertup);
13458 6108 : }
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 : */
13468 : static void
13469 1646 : add_cast_to(StringInfo buf, Oid typid)
13470 : {
13471 : HeapTuple typetup;
13472 : Form_pg_type typform;
13473 : char *typname;
13474 : char *nspname;
13475 :
13476 1646 : typetup = SearchSysCache1(TYPEOID, ObjectIdGetDatum(typid));
13477 1646 : if (!HeapTupleIsValid(typetup))
13478 0 : elog(ERROR, "cache lookup failed for type %u", typid);
13479 1646 : typform = (Form_pg_type) GETSTRUCT(typetup);
13480 :
13481 1646 : typname = NameStr(typform->typname);
13482 1646 : nspname = get_namespace_name_or_temp(typform->typnamespace);
13483 :
13484 1646 : appendStringInfo(buf, "::%s.%s",
13485 : quote_identifier(nspname), quote_identifier(typname));
13486 :
13487 1646 : ReleaseSysCache(typetup);
13488 1646 : }
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 : */
13499 : static char *
13500 14 : generate_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 14 : tp = SearchSysCache1(TYPEOID, ObjectIdGetDatum(typid));
13509 14 : if (!HeapTupleIsValid(tp))
13510 0 : elog(ERROR, "cache lookup failed for type %u", typid);
13511 14 : typtup = (Form_pg_type) GETSTRUCT(tp);
13512 14 : typname = NameStr(typtup->typname);
13513 :
13514 14 : nspname = get_namespace_name_or_temp(typtup->typnamespace);
13515 14 : if (!nspname)
13516 0 : elog(ERROR, "cache lookup failed for namespace %u",
13517 : typtup->typnamespace);
13518 :
13519 14 : result = quote_qualified_identifier(nspname, typname);
13520 :
13521 14 : ReleaseSysCache(tp);
13522 :
13523 14 : 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 : */
13532 : char *
13533 290 : generate_collation_name(Oid collid)
13534 : {
13535 : HeapTuple tp;
13536 : Form_pg_collation colltup;
13537 : char *collname;
13538 : char *nspname;
13539 : char *result;
13540 :
13541 290 : tp = SearchSysCache1(COLLOID, ObjectIdGetDatum(collid));
13542 290 : if (!HeapTupleIsValid(tp))
13543 0 : elog(ERROR, "cache lookup failed for collation %u", collid);
13544 290 : colltup = (Form_pg_collation) GETSTRUCT(tp);
13545 290 : collname = NameStr(colltup->collname);
13546 :
13547 290 : if (!CollationIsVisible(collid))
13548 0 : nspname = get_namespace_name_or_temp(colltup->collnamespace);
13549 : else
13550 290 : nspname = NULL;
13551 :
13552 290 : result = quote_qualified_identifier(nspname, collname);
13553 :
13554 290 : ReleaseSysCache(tp);
13555 :
13556 290 : 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 : */
13564 : static text *
13565 44310 : string_to_text(char *str)
13566 : {
13567 : text *result;
13568 :
13569 44310 : result = cstring_to_text(str);
13570 44310 : pfree(str);
13571 44310 : return result;
13572 : }
13573 :
13574 : /*
13575 : * Generate a C string representing a relation options from text[] datum.
13576 : */
13577 : static void
13578 244 : get_reloptions(StringInfo buf, Datum reloptions)
13579 : {
13580 : Datum *options;
13581 : int noptions;
13582 : int i;
13583 :
13584 244 : deconstruct_array_builtin(DatumGetArrayTypeP(reloptions), TEXTOID,
13585 : &options, NULL, &noptions);
13586 :
13587 508 : for (i = 0; i < noptions; i++)
13588 : {
13589 264 : 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 264 : name = option;
13599 264 : separator = strchr(option, '=');
13600 264 : if (separator)
13601 : {
13602 264 : *separator = '\0';
13603 264 : value = separator + 1;
13604 : }
13605 : else
13606 0 : value = "";
13607 :
13608 264 : if (i > 0)
13609 20 : appendStringInfoString(buf, ", ");
13610 264 : 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 264 : if (quote_identifier(value) == value)
13621 8 : appendStringInfoString(buf, value);
13622 : else
13623 256 : simple_quote_literal(buf, value);
13624 :
13625 264 : pfree(option);
13626 : }
13627 244 : }
13628 :
13629 : /*
13630 : * Generate a C string representing a relation's reloptions, or NULL if none.
13631 : */
13632 : static char *
13633 7778 : flatten_reloptions(Oid relid)
13634 : {
13635 7778 : char *result = NULL;
13636 : HeapTuple tuple;
13637 : Datum reloptions;
13638 : bool isnull;
13639 :
13640 7778 : tuple = SearchSysCache1(RELOID, ObjectIdGetDatum(relid));
13641 7778 : if (!HeapTupleIsValid(tuple))
13642 0 : elog(ERROR, "cache lookup failed for relation %u", relid);
13643 :
13644 7778 : reloptions = SysCacheGetAttr(RELOID, tuple,
13645 : Anum_pg_class_reloptions, &isnull);
13646 7778 : if (!isnull)
13647 : {
13648 : StringInfoData buf;
13649 :
13650 210 : initStringInfo(&buf);
13651 210 : get_reloptions(&buf, reloptions);
13652 :
13653 210 : result = buf.data;
13654 : }
13655 :
13656 7778 : ReleaseSysCache(tuple);
13657 :
13658 7778 : return result;
13659 : }
13660 :
13661 : /*
13662 : * get_range_partbound_string
13663 : * A C string representation of one range partition bound
13664 : */
13665 : char *
13666 4676 : get_range_partbound_string(List *bound_datums)
13667 : {
13668 : deparse_context context;
13669 4676 : StringInfo buf = makeStringInfo();
13670 : ListCell *cell;
13671 : char *sep;
13672 :
13673 4676 : memset(&context, 0, sizeof(deparse_context));
13674 4676 : context.buf = buf;
13675 :
13676 4676 : appendStringInfoChar(buf, '(');
13677 4676 : sep = "";
13678 10144 : foreach(cell, bound_datums)
13679 : {
13680 5468 : PartitionRangeDatum *datum =
13681 : lfirst_node(PartitionRangeDatum, cell);
13682 :
13683 5468 : appendStringInfoString(buf, sep);
13684 5468 : if (datum->kind == PARTITION_RANGE_DATUM_MINVALUE)
13685 222 : appendStringInfoString(buf, "MINVALUE");
13686 5246 : else if (datum->kind == PARTITION_RANGE_DATUM_MAXVALUE)
13687 120 : appendStringInfoString(buf, "MAXVALUE");
13688 : else
13689 : {
13690 5126 : Const *val = castNode(Const, datum->value);
13691 :
13692 5126 : get_const_expr(val, &context, -1);
13693 : }
13694 5468 : sep = ", ";
13695 : }
13696 4676 : appendStringInfoChar(buf, ')');
13697 :
13698 4676 : return buf->data;
13699 : }
|
