PostgreSQL Source Code  git master
parsenodes.h
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * parsenodes.h
4  * definitions for parse tree nodes
5  *
6  * Many of the node types used in parsetrees include a "location" field.
7  * This is a byte (not character) offset in the original source text, to be
8  * used for positioning an error cursor when there is an error related to
9  * the node. Access to the original source text is needed to make use of
10  * the location. At the topmost (statement) level, we also provide a
11  * statement length, likewise measured in bytes, for convenience in
12  * identifying statement boundaries in multi-statement source strings.
13  *
14  *
15  * Portions Copyright (c) 1996-2021, PostgreSQL Global Development Group
16  * Portions Copyright (c) 1994, Regents of the University of California
17  *
18  * src/include/nodes/parsenodes.h
19  *
20  *-------------------------------------------------------------------------
21  */
22 #ifndef PARSENODES_H
23 #define PARSENODES_H
24 
25 #include "nodes/bitmapset.h"
26 #include "nodes/lockoptions.h"
27 #include "nodes/primnodes.h"
28 #include "nodes/value.h"
29 #include "partitioning/partdefs.h"
30 
31 
32 typedef enum OverridingKind
33 {
38 
39 /* Possible sources of a Query */
40 typedef enum QuerySource
41 {
42  QSRC_ORIGINAL, /* original parsetree (explicit query) */
43  QSRC_PARSER, /* added by parse analysis (now unused) */
44  QSRC_INSTEAD_RULE, /* added by unconditional INSTEAD rule */
45  QSRC_QUAL_INSTEAD_RULE, /* added by conditional INSTEAD rule */
46  QSRC_NON_INSTEAD_RULE /* added by non-INSTEAD rule */
47 } QuerySource;
48 
49 /* Sort ordering options for ORDER BY and CREATE INDEX */
50 typedef enum SortByDir
51 {
55  SORTBY_USING /* not allowed in CREATE INDEX ... */
56 } SortByDir;
57 
58 typedef enum SortByNulls
59 {
63 } SortByNulls;
64 
65 /*
66  * Grantable rights are encoded so that we can OR them together in a bitmask.
67  * The present representation of AclItem limits us to 16 distinct rights,
68  * even though AclMode is defined as uint32. See utils/acl.h.
69  *
70  * Caution: changing these codes breaks stored ACLs, hence forces initdb.
71  */
72 typedef uint32 AclMode; /* a bitmask of privilege bits */
73 
74 #define ACL_INSERT (1<<0) /* for relations */
75 #define ACL_SELECT (1<<1)
76 #define ACL_UPDATE (1<<2)
77 #define ACL_DELETE (1<<3)
78 #define ACL_TRUNCATE (1<<4)
79 #define ACL_REFERENCES (1<<5)
80 #define ACL_TRIGGER (1<<6)
81 #define ACL_EXECUTE (1<<7) /* for functions */
82 #define ACL_USAGE (1<<8) /* for languages, namespaces, FDWs, and
83  * servers */
84 #define ACL_CREATE (1<<9) /* for namespaces and databases */
85 #define ACL_CREATE_TEMP (1<<10) /* for databases */
86 #define ACL_CONNECT (1<<11) /* for databases */
87 #define N_ACL_RIGHTS 12 /* 1 plus the last 1<<x */
88 #define ACL_NO_RIGHTS 0
89 /* Currently, SELECT ... FOR [KEY] UPDATE/SHARE requires UPDATE privileges */
90 #define ACL_SELECT_FOR_UPDATE ACL_UPDATE
91 
92 
93 /*****************************************************************************
94  * Query Tree
95  *****************************************************************************/
96 
97 /*
98  * Query -
99  * Parse analysis turns all statements into a Query tree
100  * for further processing by the rewriter and planner.
101  *
102  * Utility statements (i.e. non-optimizable statements) have the
103  * utilityStmt field set, and the rest of the Query is mostly dummy.
104  *
105  * Planning converts a Query tree into a Plan tree headed by a PlannedStmt
106  * node --- the Query structure is not used by the executor.
107  */
108 typedef struct Query
109 {
111 
112  CmdType commandType; /* select|insert|update|delete|utility */
113 
114  QuerySource querySource; /* where did I come from? */
115 
116  uint64 queryId; /* query identifier (can be set by plugins) */
117 
118  bool canSetTag; /* do I set the command result tag? */
119 
120  Node *utilityStmt; /* non-null if commandType == CMD_UTILITY */
121 
122  int resultRelation; /* rtable index of target relation for
123  * INSERT/UPDATE/DELETE; 0 for SELECT */
124 
125  bool hasAggs; /* has aggregates in tlist or havingQual */
126  bool hasWindowFuncs; /* has window functions in tlist */
127  bool hasTargetSRFs; /* has set-returning functions in tlist */
128  bool hasSubLinks; /* has subquery SubLink */
129  bool hasDistinctOn; /* distinctClause is from DISTINCT ON */
130  bool hasRecursive; /* WITH RECURSIVE was specified */
131  bool hasModifyingCTE; /* has INSERT/UPDATE/DELETE in WITH */
132  bool hasForUpdate; /* FOR [KEY] UPDATE/SHARE was specified */
133  bool hasRowSecurity; /* rewriter has applied some RLS policy */
134 
135  List *cteList; /* WITH list (of CommonTableExpr's) */
136 
137  List *rtable; /* list of range table entries */
138  FromExpr *jointree; /* table join tree (FROM and WHERE clauses) */
139 
140  List *targetList; /* target list (of TargetEntry) */
141 
142  OverridingKind override; /* OVERRIDING clause */
143 
144  OnConflictExpr *onConflict; /* ON CONFLICT DO [NOTHING | UPDATE] */
145 
146  List *returningList; /* return-values list (of TargetEntry) */
147 
148  List *groupClause; /* a list of SortGroupClause's */
149 
150  List *groupingSets; /* a list of GroupingSet's if present */
151 
152  Node *havingQual; /* qualifications applied to groups */
153 
154  List *windowClause; /* a list of WindowClause's */
155 
156  List *distinctClause; /* a list of SortGroupClause's */
157 
158  List *sortClause; /* a list of SortGroupClause's */
159 
160  Node *limitOffset; /* # of result tuples to skip (int8 expr) */
161  Node *limitCount; /* # of result tuples to return (int8 expr) */
162  LimitOption limitOption; /* limit type */
163 
164  List *rowMarks; /* a list of RowMarkClause's */
165 
166  Node *setOperations; /* set-operation tree if this is top level of
167  * a UNION/INTERSECT/EXCEPT query */
168 
169  List *constraintDeps; /* a list of pg_constraint OIDs that the query
170  * depends on to be semantically valid */
171 
172  List *withCheckOptions; /* a list of WithCheckOption's (added
173  * during rewrite) */
174 
175  /*
176  * The following two fields identify the portion of the source text string
177  * containing this query. They are typically only populated in top-level
178  * Queries, not in sub-queries. When not set, they might both be zero, or
179  * both be -1 meaning "unknown".
180  */
181  int stmt_location; /* start location, or -1 if unknown */
182  int stmt_len; /* length in bytes; 0 means "rest of string" */
183 } Query;
184 
185 
186 /****************************************************************************
187  * Supporting data structures for Parse Trees
188  *
189  * Most of these node types appear in raw parsetrees output by the grammar,
190  * and get transformed to something else by the analyzer. A few of them
191  * are used as-is in transformed querytrees.
192  ****************************************************************************/
193 
194 /*
195  * TypeName - specifies a type in definitions
196  *
197  * For TypeName structures generated internally, it is often easier to
198  * specify the type by OID than by name. If "names" is NIL then the
199  * actual type OID is given by typeOid, otherwise typeOid is unused.
200  * Similarly, if "typmods" is NIL then the actual typmod is expected to
201  * be prespecified in typemod, otherwise typemod is unused.
202  *
203  * If pct_type is true, then names is actually a field name and we look up
204  * the type of that field. Otherwise (the normal case), names is a type
205  * name possibly qualified with schema and database name.
206  */
207 typedef struct TypeName
208 {
210  List *names; /* qualified name (list of Value strings) */
211  Oid typeOid; /* type identified by OID */
212  bool setof; /* is a set? */
213  bool pct_type; /* %TYPE specified? */
214  List *typmods; /* type modifier expression(s) */
215  int32 typemod; /* prespecified type modifier */
216  List *arrayBounds; /* array bounds */
217  int location; /* token location, or -1 if unknown */
218 } TypeName;
219 
220 /*
221  * ColumnRef - specifies a reference to a column, or possibly a whole tuple
222  *
223  * The "fields" list must be nonempty. It can contain string Value nodes
224  * (representing names) and A_Star nodes (representing occurrence of a '*').
225  * Currently, A_Star must appear only as the last list element --- the grammar
226  * is responsible for enforcing this!
227  *
228  * Note: any container subscripting or selection of fields from composite columns
229  * is represented by an A_Indirection node above the ColumnRef. However,
230  * for simplicity in the normal case, initial field selection from a table
231  * name is represented within ColumnRef and not by adding A_Indirection.
232  */
233 typedef struct ColumnRef
234 {
236  List *fields; /* field names (Value strings) or A_Star */
237  int location; /* token location, or -1 if unknown */
238 } ColumnRef;
239 
240 /*
241  * ParamRef - specifies a $n parameter reference
242  */
243 typedef struct ParamRef
244 {
246  int number; /* the number of the parameter */
247  int location; /* token location, or -1 if unknown */
248 } ParamRef;
249 
250 /*
251  * A_Expr - infix, prefix, and postfix expressions
252  */
253 typedef enum A_Expr_Kind
254 {
255  AEXPR_OP, /* normal operator */
256  AEXPR_OP_ANY, /* scalar op ANY (array) */
257  AEXPR_OP_ALL, /* scalar op ALL (array) */
258  AEXPR_DISTINCT, /* IS DISTINCT FROM - name must be "=" */
259  AEXPR_NOT_DISTINCT, /* IS NOT DISTINCT FROM - name must be "=" */
260  AEXPR_NULLIF, /* NULLIF - name must be "=" */
261  AEXPR_IN, /* [NOT] IN - name must be "=" or "<>" */
262  AEXPR_LIKE, /* [NOT] LIKE - name must be "~~" or "!~~" */
263  AEXPR_ILIKE, /* [NOT] ILIKE - name must be "~~*" or "!~~*" */
264  AEXPR_SIMILAR, /* [NOT] SIMILAR - name must be "~" or "!~" */
265  AEXPR_BETWEEN, /* name must be "BETWEEN" */
266  AEXPR_NOT_BETWEEN, /* name must be "NOT BETWEEN" */
267  AEXPR_BETWEEN_SYM, /* name must be "BETWEEN SYMMETRIC" */
268  AEXPR_NOT_BETWEEN_SYM /* name must be "NOT BETWEEN SYMMETRIC" */
269 } A_Expr_Kind;
270 
271 typedef struct A_Expr
272 {
274  A_Expr_Kind kind; /* see above */
275  List *name; /* possibly-qualified name of operator */
276  Node *lexpr; /* left argument, or NULL if none */
277  Node *rexpr; /* right argument, or NULL if none */
278  int location; /* token location, or -1 if unknown */
279 } A_Expr;
280 
281 /*
282  * A_Const - a literal constant
283  */
284 typedef struct A_Const
285 {
287  Value val; /* value (includes type info, see value.h) */
288  int location; /* token location, or -1 if unknown */
289 } A_Const;
290 
291 /*
292  * TypeCast - a CAST expression
293  */
294 typedef struct TypeCast
295 {
297  Node *arg; /* the expression being casted */
298  TypeName *typeName; /* the target type */
299  int location; /* token location, or -1 if unknown */
300 } TypeCast;
301 
302 /*
303  * CollateClause - a COLLATE expression
304  */
305 typedef struct CollateClause
306 {
308  Node *arg; /* input expression */
309  List *collname; /* possibly-qualified collation name */
310  int location; /* token location, or -1 if unknown */
311 } CollateClause;
312 
313 /*
314  * RoleSpec - a role name or one of a few special values.
315  */
316 typedef enum RoleSpecType
317 {
318  ROLESPEC_CSTRING, /* role name is stored as a C string */
319  ROLESPEC_CURRENT_ROLE, /* role spec is CURRENT_ROLE */
320  ROLESPEC_CURRENT_USER, /* role spec is CURRENT_USER */
321  ROLESPEC_SESSION_USER, /* role spec is SESSION_USER */
322  ROLESPEC_PUBLIC /* role name is "public" */
323 } RoleSpecType;
324 
325 typedef struct RoleSpec
326 {
328  RoleSpecType roletype; /* Type of this rolespec */
329  char *rolename; /* filled only for ROLESPEC_CSTRING */
330  int location; /* token location, or -1 if unknown */
331 } RoleSpec;
332 
333 /*
334  * FuncCall - a function or aggregate invocation
335  *
336  * agg_order (if not NIL) indicates we saw 'foo(... ORDER BY ...)', or if
337  * agg_within_group is true, it was 'foo(...) WITHIN GROUP (ORDER BY ...)'.
338  * agg_star indicates we saw a 'foo(*)' construct, while agg_distinct
339  * indicates we saw 'foo(DISTINCT ...)'. In any of these cases, the
340  * construct *must* be an aggregate call. Otherwise, it might be either an
341  * aggregate or some other kind of function. However, if FILTER or OVER is
342  * present it had better be an aggregate or window function.
343  *
344  * Normally, you'd initialize this via makeFuncCall() and then only change the
345  * parts of the struct its defaults don't match afterwards, as needed.
346  */
347 typedef struct FuncCall
348 {
350  List *funcname; /* qualified name of function */
351  List *args; /* the arguments (list of exprs) */
352  List *agg_order; /* ORDER BY (list of SortBy) */
353  Node *agg_filter; /* FILTER clause, if any */
354  struct WindowDef *over; /* OVER clause, if any */
355  bool agg_within_group; /* ORDER BY appeared in WITHIN GROUP */
356  bool agg_star; /* argument was really '*' */
357  bool agg_distinct; /* arguments were labeled DISTINCT */
358  bool func_variadic; /* last argument was labeled VARIADIC */
359  CoercionForm funcformat; /* how to display this node */
360  int location; /* token location, or -1 if unknown */
361 } FuncCall;
362 
363 /*
364  * A_Star - '*' representing all columns of a table or compound field
365  *
366  * This can appear within ColumnRef.fields, A_Indirection.indirection, and
367  * ResTarget.indirection lists.
368  */
369 typedef struct A_Star
370 {
372 } A_Star;
373 
374 /*
375  * A_Indices - array subscript or slice bounds ([idx] or [lidx:uidx])
376  *
377  * In slice case, either or both of lidx and uidx can be NULL (omitted).
378  * In non-slice case, uidx holds the single subscript and lidx is always NULL.
379  */
380 typedef struct A_Indices
381 {
383  bool is_slice; /* true if slice (i.e., colon present) */
384  Node *lidx; /* slice lower bound, if any */
385  Node *uidx; /* subscript, or slice upper bound if any */
386 } A_Indices;
387 
388 /*
389  * A_Indirection - select a field and/or array element from an expression
390  *
391  * The indirection list can contain A_Indices nodes (representing
392  * subscripting), string Value nodes (representing field selection --- the
393  * string value is the name of the field to select), and A_Star nodes
394  * (representing selection of all fields of a composite type).
395  * For example, a complex selection operation like
396  * (foo).field1[42][7].field2
397  * would be represented with a single A_Indirection node having a 4-element
398  * indirection list.
399  *
400  * Currently, A_Star must appear only as the last list element --- the grammar
401  * is responsible for enforcing this!
402  */
403 typedef struct A_Indirection
404 {
406  Node *arg; /* the thing being selected from */
407  List *indirection; /* subscripts and/or field names and/or * */
408 } A_Indirection;
409 
410 /*
411  * A_ArrayExpr - an ARRAY[] construct
412  */
413 typedef struct A_ArrayExpr
414 {
416  List *elements; /* array element expressions */
417  int location; /* token location, or -1 if unknown */
418 } A_ArrayExpr;
419 
420 /*
421  * ResTarget -
422  * result target (used in target list of pre-transformed parse trees)
423  *
424  * In a SELECT target list, 'name' is the column label from an
425  * 'AS ColumnLabel' clause, or NULL if there was none, and 'val' is the
426  * value expression itself. The 'indirection' field is not used.
427  *
428  * INSERT uses ResTarget in its target-column-names list. Here, 'name' is
429  * the name of the destination column, 'indirection' stores any subscripts
430  * attached to the destination, and 'val' is not used.
431  *
432  * In an UPDATE target list, 'name' is the name of the destination column,
433  * 'indirection' stores any subscripts attached to the destination, and
434  * 'val' is the expression to assign.
435  *
436  * See A_Indirection for more info about what can appear in 'indirection'.
437  */
438 typedef struct ResTarget
439 {
441  char *name; /* column name or NULL */
442  List *indirection; /* subscripts, field names, and '*', or NIL */
443  Node *val; /* the value expression to compute or assign */
444  int location; /* token location, or -1 if unknown */
445 } ResTarget;
446 
447 /*
448  * MultiAssignRef - element of a row source expression for UPDATE
449  *
450  * In an UPDATE target list, when we have SET (a,b,c) = row-valued-expression,
451  * we generate separate ResTarget items for each of a,b,c. Their "val" trees
452  * are MultiAssignRef nodes numbered 1..n, linking to a common copy of the
453  * row-valued-expression (which parse analysis will process only once, when
454  * handling the MultiAssignRef with colno=1).
455  */
456 typedef struct MultiAssignRef
457 {
459  Node *source; /* the row-valued expression */
460  int colno; /* column number for this target (1..n) */
461  int ncolumns; /* number of targets in the construct */
463 
464 /*
465  * SortBy - for ORDER BY clause
466  */
467 typedef struct SortBy
468 {
470  Node *node; /* expression to sort on */
471  SortByDir sortby_dir; /* ASC/DESC/USING/default */
472  SortByNulls sortby_nulls; /* NULLS FIRST/LAST */
473  List *useOp; /* name of op to use, if SORTBY_USING */
474  int location; /* operator location, or -1 if none/unknown */
475 } SortBy;
476 
477 /*
478  * WindowDef - raw representation of WINDOW and OVER clauses
479  *
480  * For entries in a WINDOW list, "name" is the window name being defined.
481  * For OVER clauses, we use "name" for the "OVER window" syntax, or "refname"
482  * for the "OVER (window)" syntax, which is subtly different --- the latter
483  * implies overriding the window frame clause.
484  */
485 typedef struct WindowDef
486 {
488  char *name; /* window's own name */
489  char *refname; /* referenced window name, if any */
490  List *partitionClause; /* PARTITION BY expression list */
491  List *orderClause; /* ORDER BY (list of SortBy) */
492  int frameOptions; /* frame_clause options, see below */
493  Node *startOffset; /* expression for starting bound, if any */
494  Node *endOffset; /* expression for ending bound, if any */
495  int location; /* parse location, or -1 if none/unknown */
496 } WindowDef;
497 
498 /*
499  * frameOptions is an OR of these bits. The NONDEFAULT and BETWEEN bits are
500  * used so that ruleutils.c can tell which properties were specified and
501  * which were defaulted; the correct behavioral bits must be set either way.
502  * The START_foo and END_foo options must come in pairs of adjacent bits for
503  * the convenience of gram.y, even though some of them are useless/invalid.
504  */
505 #define FRAMEOPTION_NONDEFAULT 0x00001 /* any specified? */
506 #define FRAMEOPTION_RANGE 0x00002 /* RANGE behavior */
507 #define FRAMEOPTION_ROWS 0x00004 /* ROWS behavior */
508 #define FRAMEOPTION_GROUPS 0x00008 /* GROUPS behavior */
509 #define FRAMEOPTION_BETWEEN 0x00010 /* BETWEEN given? */
510 #define FRAMEOPTION_START_UNBOUNDED_PRECEDING 0x00020 /* start is U. P. */
511 #define FRAMEOPTION_END_UNBOUNDED_PRECEDING 0x00040 /* (disallowed) */
512 #define FRAMEOPTION_START_UNBOUNDED_FOLLOWING 0x00080 /* (disallowed) */
513 #define FRAMEOPTION_END_UNBOUNDED_FOLLOWING 0x00100 /* end is U. F. */
514 #define FRAMEOPTION_START_CURRENT_ROW 0x00200 /* start is C. R. */
515 #define FRAMEOPTION_END_CURRENT_ROW 0x00400 /* end is C. R. */
516 #define FRAMEOPTION_START_OFFSET_PRECEDING 0x00800 /* start is O. P. */
517 #define FRAMEOPTION_END_OFFSET_PRECEDING 0x01000 /* end is O. P. */
518 #define FRAMEOPTION_START_OFFSET_FOLLOWING 0x02000 /* start is O. F. */
519 #define FRAMEOPTION_END_OFFSET_FOLLOWING 0x04000 /* end is O. F. */
520 #define FRAMEOPTION_EXCLUDE_CURRENT_ROW 0x08000 /* omit C.R. */
521 #define FRAMEOPTION_EXCLUDE_GROUP 0x10000 /* omit C.R. & peers */
522 #define FRAMEOPTION_EXCLUDE_TIES 0x20000 /* omit C.R.'s peers */
523 
524 #define FRAMEOPTION_START_OFFSET \
525  (FRAMEOPTION_START_OFFSET_PRECEDING | FRAMEOPTION_START_OFFSET_FOLLOWING)
526 #define FRAMEOPTION_END_OFFSET \
527  (FRAMEOPTION_END_OFFSET_PRECEDING | FRAMEOPTION_END_OFFSET_FOLLOWING)
528 #define FRAMEOPTION_EXCLUSION \
529  (FRAMEOPTION_EXCLUDE_CURRENT_ROW | FRAMEOPTION_EXCLUDE_GROUP | \
530  FRAMEOPTION_EXCLUDE_TIES)
531 
532 #define FRAMEOPTION_DEFAULTS \
533  (FRAMEOPTION_RANGE | FRAMEOPTION_START_UNBOUNDED_PRECEDING | \
534  FRAMEOPTION_END_CURRENT_ROW)
535 
536 /*
537  * RangeSubselect - subquery appearing in a FROM clause
538  */
539 typedef struct RangeSubselect
540 {
542  bool lateral; /* does it have LATERAL prefix? */
543  Node *subquery; /* the untransformed sub-select clause */
544  Alias *alias; /* table alias & optional column aliases */
546 
547 /*
548  * RangeFunction - function call appearing in a FROM clause
549  *
550  * functions is a List because we use this to represent the construct
551  * ROWS FROM(func1(...), func2(...), ...). Each element of this list is a
552  * two-element sublist, the first element being the untransformed function
553  * call tree, and the second element being a possibly-empty list of ColumnDef
554  * nodes representing any columndef list attached to that function within the
555  * ROWS FROM() syntax.
556  *
557  * alias and coldeflist represent any alias and/or columndef list attached
558  * at the top level. (We disallow coldeflist appearing both here and
559  * per-function, but that's checked in parse analysis, not by the grammar.)
560  */
561 typedef struct RangeFunction
562 {
564  bool lateral; /* does it have LATERAL prefix? */
565  bool ordinality; /* does it have WITH ORDINALITY suffix? */
566  bool is_rowsfrom; /* is result of ROWS FROM() syntax? */
567  List *functions; /* per-function information, see above */
568  Alias *alias; /* table alias & optional column aliases */
569  List *coldeflist; /* list of ColumnDef nodes to describe result
570  * of function returning RECORD */
571 } RangeFunction;
572 
573 /*
574  * RangeTableFunc - raw form of "table functions" such as XMLTABLE
575  */
576 typedef struct RangeTableFunc
577 {
579  bool lateral; /* does it have LATERAL prefix? */
580  Node *docexpr; /* document expression */
581  Node *rowexpr; /* row generator expression */
582  List *namespaces; /* list of namespaces as ResTarget */
583  List *columns; /* list of RangeTableFuncCol */
584  Alias *alias; /* table alias & optional column aliases */
585  int location; /* token location, or -1 if unknown */
587 
588 /*
589  * RangeTableFuncCol - one column in a RangeTableFunc->columns
590  *
591  * If for_ordinality is true (FOR ORDINALITY), then the column is an int4
592  * column and the rest of the fields are ignored.
593  */
594 typedef struct RangeTableFuncCol
595 {
597  char *colname; /* name of generated column */
598  TypeName *typeName; /* type of generated column */
599  bool for_ordinality; /* does it have FOR ORDINALITY? */
600  bool is_not_null; /* does it have NOT NULL? */
601  Node *colexpr; /* column filter expression */
602  Node *coldefexpr; /* column default value expression */
603  int location; /* token location, or -1 if unknown */
605 
606 /*
607  * RangeTableSample - TABLESAMPLE appearing in a raw FROM clause
608  *
609  * This node, appearing only in raw parse trees, represents
610  * <relation> TABLESAMPLE <method> (<params>) REPEATABLE (<num>)
611  * Currently, the <relation> can only be a RangeVar, but we might in future
612  * allow RangeSubselect and other options. Note that the RangeTableSample
613  * is wrapped around the node representing the <relation>, rather than being
614  * a subfield of it.
615  */
616 typedef struct RangeTableSample
617 {
619  Node *relation; /* relation to be sampled */
620  List *method; /* sampling method name (possibly qualified) */
621  List *args; /* argument(s) for sampling method */
622  Node *repeatable; /* REPEATABLE expression, or NULL if none */
623  int location; /* method name location, or -1 if unknown */
625 
626 /*
627  * ColumnDef - column definition (used in various creates)
628  *
629  * If the column has a default value, we may have the value expression
630  * in either "raw" form (an untransformed parse tree) or "cooked" form
631  * (a post-parse-analysis, executable expression tree), depending on
632  * how this ColumnDef node was created (by parsing, or by inheritance
633  * from an existing relation). We should never have both in the same node!
634  *
635  * Similarly, we may have a COLLATE specification in either raw form
636  * (represented as a CollateClause with arg==NULL) or cooked form
637  * (the collation's OID).
638  *
639  * The constraints list may contain a CONSTR_DEFAULT item in a raw
640  * parsetree produced by gram.y, but transformCreateStmt will remove
641  * the item and set raw_default instead. CONSTR_DEFAULT items
642  * should not appear in any subsequent processing.
643  */
644 typedef struct ColumnDef
645 {
647  char *colname; /* name of column */
648  TypeName *typeName; /* type of column */
649  int inhcount; /* number of times column is inherited */
650  bool is_local; /* column has local (non-inherited) def'n */
651  bool is_not_null; /* NOT NULL constraint specified? */
652  bool is_from_type; /* column definition came from table type */
653  char storage; /* attstorage setting, or 0 for default */
654  Node *raw_default; /* default value (untransformed parse tree) */
655  Node *cooked_default; /* default value (transformed expr tree) */
656  char identity; /* attidentity setting */
657  RangeVar *identitySequence; /* to store identity sequence name for
658  * ALTER TABLE ... ADD COLUMN */
659  char generated; /* attgenerated setting */
660  CollateClause *collClause; /* untransformed COLLATE spec, if any */
661  Oid collOid; /* collation OID (InvalidOid if not set) */
662  List *constraints; /* other constraints on column */
663  List *fdwoptions; /* per-column FDW options */
664  int location; /* parse location, or -1 if none/unknown */
665 } ColumnDef;
666 
667 /*
668  * TableLikeClause - CREATE TABLE ( ... LIKE ... ) clause
669  */
670 typedef struct TableLikeClause
671 {
674  bits32 options; /* OR of TableLikeOption flags */
675  Oid relationOid; /* If table has been looked up, its OID */
677 
678 typedef enum TableLikeOption
679 {
690 
691 /*
692  * IndexElem - index parameters (used in CREATE INDEX, and in ON CONFLICT)
693  *
694  * For a plain index attribute, 'name' is the name of the table column to
695  * index, and 'expr' is NULL. For an index expression, 'name' is NULL and
696  * 'expr' is the expression tree.
697  */
698 typedef struct IndexElem
699 {
701  char *name; /* name of attribute to index, or NULL */
702  Node *expr; /* expression to index, or NULL */
703  char *indexcolname; /* name for index column; NULL = default */
704  List *collation; /* name of collation; NIL = default */
705  List *opclass; /* name of desired opclass; NIL = default */
706  List *opclassopts; /* opclass-specific options, or NIL */
707  SortByDir ordering; /* ASC/DESC/default */
708  SortByNulls nulls_ordering; /* FIRST/LAST/default */
709 } IndexElem;
710 
711 /*
712  * DefElem - a generic "name = value" option definition
713  *
714  * In some contexts the name can be qualified. Also, certain SQL commands
715  * allow a SET/ADD/DROP action to be attached to option settings, so it's
716  * convenient to carry a field for that too. (Note: currently, it is our
717  * practice that the grammar allows namespace and action only in statements
718  * where they are relevant; C code can just ignore those fields in other
719  * statements.)
720  */
721 typedef enum DefElemAction
722 {
723  DEFELEM_UNSPEC, /* no action given */
727 } DefElemAction;
728 
729 typedef struct DefElem
730 {
732  char *defnamespace; /* NULL if unqualified name */
733  char *defname;
734  Node *arg; /* a (Value *) or a (TypeName *) */
735  DefElemAction defaction; /* unspecified action, or SET/ADD/DROP */
736  int location; /* token location, or -1 if unknown */
737 } DefElem;
738 
739 /*
740  * LockingClause - raw representation of FOR [NO KEY] UPDATE/[KEY] SHARE
741  * options
742  *
743  * Note: lockedRels == NIL means "all relations in query". Otherwise it
744  * is a list of RangeVar nodes. (We use RangeVar mainly because it carries
745  * a location field --- currently, parse analysis insists on unqualified
746  * names in LockingClause.)
747  */
748 typedef struct LockingClause
749 {
751  List *lockedRels; /* FOR [KEY] UPDATE/SHARE relations */
753  LockWaitPolicy waitPolicy; /* NOWAIT and SKIP LOCKED */
754 } LockingClause;
755 
756 /*
757  * XMLSERIALIZE (in raw parse tree only)
758  */
759 typedef struct XmlSerialize
760 {
762  XmlOptionType xmloption; /* DOCUMENT or CONTENT */
765  int location; /* token location, or -1 if unknown */
766 } XmlSerialize;
767 
768 /* Partitioning related definitions */
769 
770 /*
771  * PartitionElem - parse-time representation of a single partition key
772  *
773  * expr can be either a raw expression tree or a parse-analyzed expression.
774  * We don't store these on-disk, though.
775  */
776 typedef struct PartitionElem
777 {
779  char *name; /* name of column to partition on, or NULL */
780  Node *expr; /* expression to partition on, or NULL */
781  List *collation; /* name of collation; NIL = default */
782  List *opclass; /* name of desired opclass; NIL = default */
783  int location; /* token location, or -1 if unknown */
784 } PartitionElem;
785 
786 /*
787  * PartitionSpec - parse-time representation of a partition key specification
788  *
789  * This represents the key space we will be partitioning on.
790  */
791 typedef struct PartitionSpec
792 {
794  char *strategy; /* partitioning strategy ('hash', 'list' or
795  * 'range') */
796  List *partParams; /* List of PartitionElems */
797  int location; /* token location, or -1 if unknown */
798 } PartitionSpec;
799 
800 /* Internal codes for partitioning strategies */
801 #define PARTITION_STRATEGY_HASH 'h'
802 #define PARTITION_STRATEGY_LIST 'l'
803 #define PARTITION_STRATEGY_RANGE 'r'
804 
805 /*
806  * PartitionBoundSpec - a partition bound specification
807  *
808  * This represents the portion of the partition key space assigned to a
809  * particular partition. These are stored on disk in pg_class.relpartbound.
810  */
812 {
814 
815  char strategy; /* see PARTITION_STRATEGY codes above */
816  bool is_default; /* is it a default partition bound? */
817 
818  /* Partitioning info for HASH strategy: */
819  int modulus;
821 
822  /* Partitioning info for LIST strategy: */
823  List *listdatums; /* List of Consts (or A_Consts in raw tree) */
824 
825  /* Partitioning info for RANGE strategy: */
826  List *lowerdatums; /* List of PartitionRangeDatums */
827  List *upperdatums; /* List of PartitionRangeDatums */
828 
829  int location; /* token location, or -1 if unknown */
830 };
831 
832 /*
833  * PartitionRangeDatum - one of the values in a range partition bound
834  *
835  * This can be MINVALUE, MAXVALUE or a specific bounded value.
836  */
838 {
839  PARTITION_RANGE_DATUM_MINVALUE = -1, /* less than any other value */
840  PARTITION_RANGE_DATUM_VALUE = 0, /* a specific (bounded) value */
841  PARTITION_RANGE_DATUM_MAXVALUE = 1 /* greater than any other value */
843 
844 typedef struct PartitionRangeDatum
845 {
847 
849  Node *value; /* Const (or A_Const in raw tree), if kind is
850  * PARTITION_RANGE_DATUM_VALUE, else NULL */
851 
852  int location; /* token location, or -1 if unknown */
854 
855 /*
856  * PartitionCmd - info for ALTER TABLE/INDEX ATTACH/DETACH PARTITION commands
857  */
858 typedef struct PartitionCmd
859 {
861  RangeVar *name; /* name of partition to attach/detach */
862  PartitionBoundSpec *bound; /* FOR VALUES, if attaching */
863 } PartitionCmd;
864 
865 /****************************************************************************
866  * Nodes for a Query tree
867  ****************************************************************************/
868 
869 /*--------------------
870  * RangeTblEntry -
871  * A range table is a List of RangeTblEntry nodes.
872  *
873  * A range table entry may represent a plain relation, a sub-select in
874  * FROM, or the result of a JOIN clause. (Only explicit JOIN syntax
875  * produces an RTE, not the implicit join resulting from multiple FROM
876  * items. This is because we only need the RTE to deal with SQL features
877  * like outer joins and join-output-column aliasing.) Other special
878  * RTE types also exist, as indicated by RTEKind.
879  *
880  * Note that we consider RTE_RELATION to cover anything that has a pg_class
881  * entry. relkind distinguishes the sub-cases.
882  *
883  * alias is an Alias node representing the AS alias-clause attached to the
884  * FROM expression, or NULL if no clause.
885  *
886  * eref is the table reference name and column reference names (either
887  * real or aliases). Note that system columns (OID etc) are not included
888  * in the column list.
889  * eref->aliasname is required to be present, and should generally be used
890  * to identify the RTE for error messages etc.
891  *
892  * In RELATION RTEs, the colnames in both alias and eref are indexed by
893  * physical attribute number; this means there must be colname entries for
894  * dropped columns. When building an RTE we insert empty strings ("") for
895  * dropped columns. Note however that a stored rule may have nonempty
896  * colnames for columns dropped since the rule was created (and for that
897  * matter the colnames might be out of date due to column renamings).
898  * The same comments apply to FUNCTION RTEs when a function's return type
899  * is a named composite type.
900  *
901  * In JOIN RTEs, the colnames in both alias and eref are one-to-one with
902  * joinaliasvars entries. A JOIN RTE will omit columns of its inputs when
903  * those columns are known to be dropped at parse time. Again, however,
904  * a stored rule might contain entries for columns dropped since the rule
905  * was created. (This is only possible for columns not actually referenced
906  * in the rule.) When loading a stored rule, we replace the joinaliasvars
907  * items for any such columns with null pointers. (We can't simply delete
908  * them from the joinaliasvars list, because that would affect the attnums
909  * of Vars referencing the rest of the list.)
910  *
911  * inh is true for relation references that should be expanded to include
912  * inheritance children, if the rel has any. This *must* be false for
913  * RTEs other than RTE_RELATION entries.
914  *
915  * inFromCl marks those range variables that are listed in the FROM clause.
916  * It's false for RTEs that are added to a query behind the scenes, such
917  * as the NEW and OLD variables for a rule, or the subqueries of a UNION.
918  * This flag is not used anymore during parsing, since the parser now uses
919  * a separate "namespace" data structure to control visibility, but it is
920  * needed by ruleutils.c to determine whether RTEs should be shown in
921  * decompiled queries.
922  *
923  * requiredPerms and checkAsUser specify run-time access permissions
924  * checks to be performed at query startup. The user must have *all*
925  * of the permissions that are OR'd together in requiredPerms (zero
926  * indicates no permissions checking). If checkAsUser is not zero,
927  * then do the permissions checks using the access rights of that user,
928  * not the current effective user ID. (This allows rules to act as
929  * setuid gateways.) Permissions checks only apply to RELATION RTEs.
930  *
931  * For SELECT/INSERT/UPDATE permissions, if the user doesn't have
932  * table-wide permissions then it is sufficient to have the permissions
933  * on all columns identified in selectedCols (for SELECT) and/or
934  * insertedCols and/or updatedCols (INSERT with ON CONFLICT DO UPDATE may
935  * have all 3). selectedCols, insertedCols and updatedCols are bitmapsets,
936  * which cannot have negative integer members, so we subtract
937  * FirstLowInvalidHeapAttributeNumber from column numbers before storing
938  * them in these fields. A whole-row Var reference is represented by
939  * setting the bit for InvalidAttrNumber.
940  *
941  * updatedCols is also used in some other places, for example, to determine
942  * which triggers to fire and in FDWs to know which changed columns they
943  * need to ship off.
944  *
945  * Generated columns that are caused to be updated by an update to a base
946  * column are listed in extraUpdatedCols. This is not considered for
947  * permission checking, but it is useful in those places that want to know
948  * the full set of columns being updated as opposed to only the ones the
949  * user explicitly mentioned in the query. (There is currently no need for
950  * an extraInsertedCols, but it could exist.) Note that extraUpdatedCols
951  * is populated during query rewrite, NOT in the parser, since generated
952  * columns could be added after a rule has been parsed and stored.
953  *
954  * securityQuals is a list of security barrier quals (boolean expressions),
955  * to be tested in the listed order before returning a row from the
956  * relation. It is always NIL in parser output. Entries are added by the
957  * rewriter to implement security-barrier views and/or row-level security.
958  * Note that the planner turns each boolean expression into an implicitly
959  * AND'ed sublist, as is its usual habit with qualification expressions.
960  *--------------------
961  */
962 typedef enum RTEKind
963 {
964  RTE_RELATION, /* ordinary relation reference */
965  RTE_SUBQUERY, /* subquery in FROM */
966  RTE_JOIN, /* join */
967  RTE_FUNCTION, /* function in FROM */
968  RTE_TABLEFUNC, /* TableFunc(.., column list) */
969  RTE_VALUES, /* VALUES (<exprlist>), (<exprlist>), ... */
970  RTE_CTE, /* common table expr (WITH list element) */
971  RTE_NAMEDTUPLESTORE, /* tuplestore, e.g. for AFTER triggers */
972  RTE_RESULT /* RTE represents an empty FROM clause; such
973  * RTEs are added by the planner, they're not
974  * present during parsing or rewriting */
975 } RTEKind;
976 
977 typedef struct RangeTblEntry
978 {
980 
981  RTEKind rtekind; /* see above */
982 
983  /*
984  * XXX the fields applicable to only some rte kinds should be merged into
985  * a union. I didn't do this yet because the diffs would impact a lot of
986  * code that is being actively worked on. FIXME someday.
987  */
988 
989  /*
990  * Fields valid for a plain relation RTE (else zero):
991  *
992  * As a special case, RTE_NAMEDTUPLESTORE can also set relid to indicate
993  * that the tuple format of the tuplestore is the same as the referenced
994  * relation. This allows plans referencing AFTER trigger transition
995  * tables to be invalidated if the underlying table is altered.
996  *
997  * rellockmode is really LOCKMODE, but it's declared int to avoid having
998  * to include lock-related headers here. It must be RowExclusiveLock if
999  * the RTE is an INSERT/UPDATE/DELETE target, else RowShareLock if the RTE
1000  * is a SELECT FOR UPDATE/FOR SHARE target, else AccessShareLock.
1001  *
1002  * Note: in some cases, rule expansion may result in RTEs that are marked
1003  * with RowExclusiveLock even though they are not the target of the
1004  * current query; this happens if a DO ALSO rule simply scans the original
1005  * target table. We leave such RTEs with their original lockmode so as to
1006  * avoid getting an additional, lesser lock.
1007  */
1008  Oid relid; /* OID of the relation */
1009  char relkind; /* relation kind (see pg_class.relkind) */
1010  int rellockmode; /* lock level that query requires on the rel */
1011  struct TableSampleClause *tablesample; /* sampling info, or NULL */
1012 
1013  /*
1014  * Fields valid for a subquery RTE (else NULL):
1015  */
1016  Query *subquery; /* the sub-query */
1017  bool security_barrier; /* is from security_barrier view? */
1018 
1019  /*
1020  * Fields valid for a join RTE (else NULL/zero):
1021  *
1022  * joinaliasvars is a list of (usually) Vars corresponding to the columns
1023  * of the join result. An alias Var referencing column K of the join
1024  * result can be replaced by the K'th element of joinaliasvars --- but to
1025  * simplify the task of reverse-listing aliases correctly, we do not do
1026  * that until planning time. In detail: an element of joinaliasvars can
1027  * be a Var of one of the join's input relations, or such a Var with an
1028  * implicit coercion to the join's output column type, or a COALESCE
1029  * expression containing the two input column Vars (possibly coerced).
1030  * Elements beyond the first joinmergedcols entries are always just Vars,
1031  * and are never referenced from elsewhere in the query (that is, join
1032  * alias Vars are generated only for merged columns). We keep these
1033  * entries only because they're needed in expandRTE() and similar code.
1034  *
1035  * Within a Query loaded from a stored rule, it is possible for non-merged
1036  * joinaliasvars items to be null pointers, which are placeholders for
1037  * (necessarily unreferenced) columns dropped since the rule was made.
1038  * Also, once planning begins, joinaliasvars items can be almost anything,
1039  * as a result of subquery-flattening substitutions.
1040  *
1041  * joinleftcols is an integer list of physical column numbers of the left
1042  * join input rel that are included in the join; likewise joinrighttcols
1043  * for the right join input rel. (Which rels those are can be determined
1044  * from the associated JoinExpr.) If the join is USING/NATURAL, then the
1045  * first joinmergedcols entries in each list identify the merged columns.
1046  * The merged columns come first in the join output, then remaining
1047  * columns of the left input, then remaining columns of the right.
1048  *
1049  * Note that input columns could have been dropped after creation of a
1050  * stored rule, if they are not referenced in the query (in particular,
1051  * merged columns could not be dropped); this is not accounted for in
1052  * joinleftcols/joinrighttcols.
1053  */
1054  JoinType jointype; /* type of join */
1055  int joinmergedcols; /* number of merged (JOIN USING) columns */
1056  List *joinaliasvars; /* list of alias-var expansions */
1057  List *joinleftcols; /* left-side input column numbers */
1058  List *joinrightcols; /* right-side input column numbers */
1059 
1060  /*
1061  * Fields valid for a function RTE (else NIL/zero):
1062  *
1063  * When funcordinality is true, the eref->colnames list includes an alias
1064  * for the ordinality column. The ordinality column is otherwise
1065  * implicit, and must be accounted for "by hand" in places such as
1066  * expandRTE().
1067  */
1068  List *functions; /* list of RangeTblFunction nodes */
1069  bool funcordinality; /* is this called WITH ORDINALITY? */
1070 
1071  /*
1072  * Fields valid for a TableFunc RTE (else NULL):
1073  */
1075 
1076  /*
1077  * Fields valid for a values RTE (else NIL):
1078  */
1079  List *values_lists; /* list of expression lists */
1080 
1081  /*
1082  * Fields valid for a CTE RTE (else NULL/zero):
1083  */
1084  char *ctename; /* name of the WITH list item */
1085  Index ctelevelsup; /* number of query levels up */
1086  bool self_reference; /* is this a recursive self-reference? */
1087 
1088  /*
1089  * Fields valid for CTE, VALUES, ENR, and TableFunc RTEs (else NIL):
1090  *
1091  * We need these for CTE RTEs so that the types of self-referential
1092  * columns are well-defined. For VALUES RTEs, storing these explicitly
1093  * saves having to re-determine the info by scanning the values_lists. For
1094  * ENRs, we store the types explicitly here (we could get the information
1095  * from the catalogs if 'relid' was supplied, but we'd still need these
1096  * for TupleDesc-based ENRs, so we might as well always store the type
1097  * info here). For TableFuncs, these fields are redundant with data in
1098  * the TableFunc node, but keeping them here allows some code sharing with
1099  * the other cases.
1100  *
1101  * For ENRs only, we have to consider the possibility of dropped columns.
1102  * A dropped column is included in these lists, but it will have zeroes in
1103  * all three lists (as well as an empty-string entry in eref). Testing
1104  * for zero coltype is the standard way to detect a dropped column.
1105  */
1106  List *coltypes; /* OID list of column type OIDs */
1107  List *coltypmods; /* integer list of column typmods */
1108  List *colcollations; /* OID list of column collation OIDs */
1109 
1110  /*
1111  * Fields valid for ENR RTEs (else NULL/zero):
1112  */
1113  char *enrname; /* name of ephemeral named relation */
1114  double enrtuples; /* estimated or actual from caller */
1115 
1116  /*
1117  * Fields valid in all RTEs:
1118  */
1119  Alias *alias; /* user-written alias clause, if any */
1120  Alias *eref; /* expanded reference names */
1121  bool lateral; /* subquery, function, or values is LATERAL? */
1122  bool inh; /* inheritance requested? */
1123  bool inFromCl; /* present in FROM clause? */
1124  AclMode requiredPerms; /* bitmask of required access permissions */
1125  Oid checkAsUser; /* if valid, check access as this role */
1126  Bitmapset *selectedCols; /* columns needing SELECT permission */
1127  Bitmapset *insertedCols; /* columns needing INSERT permission */
1128  Bitmapset *updatedCols; /* columns needing UPDATE permission */
1129  Bitmapset *extraUpdatedCols; /* generated columns being updated */
1130  List *securityQuals; /* security barrier quals to apply, if any */
1131 } RangeTblEntry;
1132 
1133 /*
1134  * RangeTblFunction -
1135  * RangeTblEntry subsidiary data for one function in a FUNCTION RTE.
1136  *
1137  * If the function had a column definition list (required for an
1138  * otherwise-unspecified RECORD result), funccolnames lists the names given
1139  * in the definition list, funccoltypes lists their declared column types,
1140  * funccoltypmods lists their typmods, funccolcollations their collations.
1141  * Otherwise, those fields are NIL.
1142  *
1143  * Notice we don't attempt to store info about the results of functions
1144  * returning named composite types, because those can change from time to
1145  * time. We do however remember how many columns we thought the type had
1146  * (including dropped columns!), so that we can successfully ignore any
1147  * columns added after the query was parsed.
1148  */
1149 typedef struct RangeTblFunction
1150 {
1152 
1153  Node *funcexpr; /* expression tree for func call */
1154  int funccolcount; /* number of columns it contributes to RTE */
1155  /* These fields record the contents of a column definition list, if any: */
1156  List *funccolnames; /* column names (list of String) */
1157  List *funccoltypes; /* OID list of column type OIDs */
1158  List *funccoltypmods; /* integer list of column typmods */
1159  List *funccolcollations; /* OID list of column collation OIDs */
1160  /* This is set during planning for use by the executor: */
1161  Bitmapset *funcparams; /* PARAM_EXEC Param IDs affecting this func */
1163 
1164 /*
1165  * TableSampleClause - TABLESAMPLE appearing in a transformed FROM clause
1166  *
1167  * Unlike RangeTableSample, this is a subnode of the relevant RangeTblEntry.
1168  */
1169 typedef struct TableSampleClause
1170 {
1172  Oid tsmhandler; /* OID of the tablesample handler function */
1173  List *args; /* tablesample argument expression(s) */
1174  Expr *repeatable; /* REPEATABLE expression, or NULL if none */
1176 
1177 /*
1178  * WithCheckOption -
1179  * representation of WITH CHECK OPTION checks to be applied to new tuples
1180  * when inserting/updating an auto-updatable view, or RLS WITH CHECK
1181  * policies to be applied when inserting/updating a relation with RLS.
1182  */
1183 typedef enum WCOKind
1184 {
1185  WCO_VIEW_CHECK, /* WCO on an auto-updatable view */
1186  WCO_RLS_INSERT_CHECK, /* RLS INSERT WITH CHECK policy */
1187  WCO_RLS_UPDATE_CHECK, /* RLS UPDATE WITH CHECK policy */
1188  WCO_RLS_CONFLICT_CHECK /* RLS ON CONFLICT DO UPDATE USING policy */
1189 } WCOKind;
1190 
1191 typedef struct WithCheckOption
1192 {
1194  WCOKind kind; /* kind of WCO */
1195  char *relname; /* name of relation that specified the WCO */
1196  char *polname; /* name of RLS policy being checked */
1197  Node *qual; /* constraint qual to check */
1198  bool cascaded; /* true for a cascaded WCO on a view */
1199 } WithCheckOption;
1200 
1201 /*
1202  * SortGroupClause -
1203  * representation of ORDER BY, GROUP BY, PARTITION BY,
1204  * DISTINCT, DISTINCT ON items
1205  *
1206  * You might think that ORDER BY is only interested in defining ordering,
1207  * and GROUP/DISTINCT are only interested in defining equality. However,
1208  * one way to implement grouping is to sort and then apply a "uniq"-like
1209  * filter. So it's also interesting to keep track of possible sort operators
1210  * for GROUP/DISTINCT, and in particular to try to sort for the grouping
1211  * in a way that will also yield a requested ORDER BY ordering. So we need
1212  * to be able to compare ORDER BY and GROUP/DISTINCT lists, which motivates
1213  * the decision to give them the same representation.
1214  *
1215  * tleSortGroupRef must match ressortgroupref of exactly one entry of the
1216  * query's targetlist; that is the expression to be sorted or grouped by.
1217  * eqop is the OID of the equality operator.
1218  * sortop is the OID of the ordering operator (a "<" or ">" operator),
1219  * or InvalidOid if not available.
1220  * nulls_first means about what you'd expect. If sortop is InvalidOid
1221  * then nulls_first is meaningless and should be set to false.
1222  * hashable is true if eqop is hashable (note this condition also depends
1223  * on the datatype of the input expression).
1224  *
1225  * In an ORDER BY item, all fields must be valid. (The eqop isn't essential
1226  * here, but it's cheap to get it along with the sortop, and requiring it
1227  * to be valid eases comparisons to grouping items.) Note that this isn't
1228  * actually enough information to determine an ordering: if the sortop is
1229  * collation-sensitive, a collation OID is needed too. We don't store the
1230  * collation in SortGroupClause because it's not available at the time the
1231  * parser builds the SortGroupClause; instead, consult the exposed collation
1232  * of the referenced targetlist expression to find out what it is.
1233  *
1234  * In a grouping item, eqop must be valid. If the eqop is a btree equality
1235  * operator, then sortop should be set to a compatible ordering operator.
1236  * We prefer to set eqop/sortop/nulls_first to match any ORDER BY item that
1237  * the query presents for the same tlist item. If there is none, we just
1238  * use the default ordering op for the datatype.
1239  *
1240  * If the tlist item's type has a hash opclass but no btree opclass, then
1241  * we will set eqop to the hash equality operator, sortop to InvalidOid,
1242  * and nulls_first to false. A grouping item of this kind can only be
1243  * implemented by hashing, and of course it'll never match an ORDER BY item.
1244  *
1245  * The hashable flag is provided since we generally have the requisite
1246  * information readily available when the SortGroupClause is constructed,
1247  * and it's relatively expensive to get it again later. Note there is no
1248  * need for a "sortable" flag since OidIsValid(sortop) serves the purpose.
1249  *
1250  * A query might have both ORDER BY and DISTINCT (or DISTINCT ON) clauses.
1251  * In SELECT DISTINCT, the distinctClause list is as long or longer than the
1252  * sortClause list, while in SELECT DISTINCT ON it's typically shorter.
1253  * The two lists must match up to the end of the shorter one --- the parser
1254  * rearranges the distinctClause if necessary to make this true. (This
1255  * restriction ensures that only one sort step is needed to both satisfy the
1256  * ORDER BY and set up for the Unique step. This is semantically necessary
1257  * for DISTINCT ON, and presents no real drawback for DISTINCT.)
1258  */
1259 typedef struct SortGroupClause
1260 {
1262  Index tleSortGroupRef; /* reference into targetlist */
1263  Oid eqop; /* the equality operator ('=' op) */
1264  Oid sortop; /* the ordering operator ('<' op), or 0 */
1265  bool nulls_first; /* do NULLs come before normal values? */
1266  bool hashable; /* can eqop be implemented by hashing? */
1267 } SortGroupClause;
1268 
1269 /*
1270  * GroupingSet -
1271  * representation of CUBE, ROLLUP and GROUPING SETS clauses
1272  *
1273  * In a Query with grouping sets, the groupClause contains a flat list of
1274  * SortGroupClause nodes for each distinct expression used. The actual
1275  * structure of the GROUP BY clause is given by the groupingSets tree.
1276  *
1277  * In the raw parser output, GroupingSet nodes (of all types except SIMPLE
1278  * which is not used) are potentially mixed in with the expressions in the
1279  * groupClause of the SelectStmt. (An expression can't contain a GroupingSet,
1280  * but a list may mix GroupingSet and expression nodes.) At this stage, the
1281  * content of each node is a list of expressions, some of which may be RowExprs
1282  * which represent sublists rather than actual row constructors, and nested
1283  * GroupingSet nodes where legal in the grammar. The structure directly
1284  * reflects the query syntax.
1285  *
1286  * In parse analysis, the transformed expressions are used to build the tlist
1287  * and groupClause list (of SortGroupClause nodes), and the groupingSets tree
1288  * is eventually reduced to a fixed format:
1289  *
1290  * EMPTY nodes represent (), and obviously have no content
1291  *
1292  * SIMPLE nodes represent a list of one or more expressions to be treated as an
1293  * atom by the enclosing structure; the content is an integer list of
1294  * ressortgroupref values (see SortGroupClause)
1295  *
1296  * CUBE and ROLLUP nodes contain a list of one or more SIMPLE nodes.
1297  *
1298  * SETS nodes contain a list of EMPTY, SIMPLE, CUBE or ROLLUP nodes, but after
1299  * parse analysis they cannot contain more SETS nodes; enough of the syntactic
1300  * transforms of the spec have been applied that we no longer have arbitrarily
1301  * deep nesting (though we still preserve the use of cube/rollup).
1302  *
1303  * Note that if the groupingSets tree contains no SIMPLE nodes (only EMPTY
1304  * nodes at the leaves), then the groupClause will be empty, but this is still
1305  * an aggregation query (similar to using aggs or HAVING without GROUP BY).
1306  *
1307  * As an example, the following clause:
1308  *
1309  * GROUP BY GROUPING SETS ((a,b), CUBE(c,(d,e)))
1310  *
1311  * looks like this after raw parsing:
1312  *
1313  * SETS( RowExpr(a,b) , CUBE( c, RowExpr(d,e) ) )
1314  *
1315  * and parse analysis converts it to:
1316  *
1317  * SETS( SIMPLE(1,2), CUBE( SIMPLE(3), SIMPLE(4,5) ) )
1318  */
1319 typedef enum
1320 {
1326 } GroupingSetKind;
1327 
1328 typedef struct GroupingSet
1329 {
1334 } GroupingSet;
1335 
1336 /*
1337  * WindowClause -
1338  * transformed representation of WINDOW and OVER clauses
1339  *
1340  * A parsed Query's windowClause list contains these structs. "name" is set
1341  * if the clause originally came from WINDOW, and is NULL if it originally
1342  * was an OVER clause (but note that we collapse out duplicate OVERs).
1343  * partitionClause and orderClause are lists of SortGroupClause structs.
1344  * If we have RANGE with offset PRECEDING/FOLLOWING, the semantics of that are
1345  * specified by startInRangeFunc/inRangeColl/inRangeAsc/inRangeNullsFirst
1346  * for the start offset, or endInRangeFunc/inRange* for the end offset.
1347  * winref is an ID number referenced by WindowFunc nodes; it must be unique
1348  * among the members of a Query's windowClause list.
1349  * When refname isn't null, the partitionClause is always copied from there;
1350  * the orderClause might or might not be copied (see copiedOrder); the framing
1351  * options are never copied, per spec.
1352  */
1353 typedef struct WindowClause
1354 {
1356  char *name; /* window name (NULL in an OVER clause) */
1357  char *refname; /* referenced window name, if any */
1358  List *partitionClause; /* PARTITION BY list */
1359  List *orderClause; /* ORDER BY list */
1360  int frameOptions; /* frame_clause options, see WindowDef */
1361  Node *startOffset; /* expression for starting bound, if any */
1362  Node *endOffset; /* expression for ending bound, if any */
1363  Oid startInRangeFunc; /* in_range function for startOffset */
1364  Oid endInRangeFunc; /* in_range function for endOffset */
1365  Oid inRangeColl; /* collation for in_range tests */
1366  bool inRangeAsc; /* use ASC sort order for in_range tests? */
1367  bool inRangeNullsFirst; /* nulls sort first for in_range tests? */
1368  Index winref; /* ID referenced by window functions */
1369  bool copiedOrder; /* did we copy orderClause from refname? */
1370 } WindowClause;
1371 
1372 /*
1373  * RowMarkClause -
1374  * parser output representation of FOR [KEY] UPDATE/SHARE clauses
1375  *
1376  * Query.rowMarks contains a separate RowMarkClause node for each relation
1377  * identified as a FOR [KEY] UPDATE/SHARE target. If one of these clauses
1378  * is applied to a subquery, we generate RowMarkClauses for all normal and
1379  * subquery rels in the subquery, but they are marked pushedDown = true to
1380  * distinguish them from clauses that were explicitly written at this query
1381  * level. Also, Query.hasForUpdate tells whether there were explicit FOR
1382  * UPDATE/SHARE/KEY SHARE clauses in the current query level.
1383  */
1384 typedef struct RowMarkClause
1385 {
1387  Index rti; /* range table index of target relation */
1389  LockWaitPolicy waitPolicy; /* NOWAIT and SKIP LOCKED */
1390  bool pushedDown; /* pushed down from higher query level? */
1391 } RowMarkClause;
1392 
1393 /*
1394  * WithClause -
1395  * representation of WITH clause
1396  *
1397  * Note: WithClause does not propagate into the Query representation;
1398  * but CommonTableExpr does.
1399  */
1400 typedef struct WithClause
1401 {
1403  List *ctes; /* list of CommonTableExprs */
1404  bool recursive; /* true = WITH RECURSIVE */
1405  int location; /* token location, or -1 if unknown */
1406 } WithClause;
1407 
1408 /*
1409  * InferClause -
1410  * ON CONFLICT unique index inference clause
1411  *
1412  * Note: InferClause does not propagate into the Query representation.
1413  */
1414 typedef struct InferClause
1415 {
1417  List *indexElems; /* IndexElems to infer unique index */
1418  Node *whereClause; /* qualification (partial-index predicate) */
1419  char *conname; /* Constraint name, or NULL if unnamed */
1420  int location; /* token location, or -1 if unknown */
1421 } InferClause;
1422 
1423 /*
1424  * OnConflictClause -
1425  * representation of ON CONFLICT clause
1426  *
1427  * Note: OnConflictClause does not propagate into the Query representation.
1428  */
1429 typedef struct OnConflictClause
1430 {
1432  OnConflictAction action; /* DO NOTHING or UPDATE? */
1433  InferClause *infer; /* Optional index inference clause */
1434  List *targetList; /* the target list (of ResTarget) */
1435  Node *whereClause; /* qualifications */
1436  int location; /* token location, or -1 if unknown */
1438 
1439 /*
1440  * CommonTableExpr -
1441  * representation of WITH list element
1442  *
1443  * We don't currently support the SEARCH or CYCLE clause.
1444  */
1445 typedef enum CTEMaterialize
1446 {
1447  CTEMaterializeDefault, /* no option specified */
1448  CTEMaterializeAlways, /* MATERIALIZED */
1449  CTEMaterializeNever /* NOT MATERIALIZED */
1450 } CTEMaterialize;
1451 
1452 typedef struct CommonTableExpr
1453 {
1455  char *ctename; /* query name (never qualified) */
1456  List *aliascolnames; /* optional list of column names */
1457  CTEMaterialize ctematerialized; /* is this an optimization fence? */
1458  /* SelectStmt/InsertStmt/etc before parse analysis, Query afterwards: */
1459  Node *ctequery; /* the CTE's subquery */
1460  int location; /* token location, or -1 if unknown */
1461  /* These fields are set during parse analysis: */
1462  bool cterecursive; /* is this CTE actually recursive? */
1463  int cterefcount; /* number of RTEs referencing this CTE
1464  * (excluding internal self-references) */
1465  List *ctecolnames; /* list of output column names */
1466  List *ctecoltypes; /* OID list of output column type OIDs */
1467  List *ctecoltypmods; /* integer list of output column typmods */
1468  List *ctecolcollations; /* OID list of column collation OIDs */
1469 } CommonTableExpr;
1470 
1471 /* Convenience macro to get the output tlist of a CTE's query */
1472 #define GetCTETargetList(cte) \
1473  (AssertMacro(IsA((cte)->ctequery, Query)), \
1474  ((Query *) (cte)->ctequery)->commandType == CMD_SELECT ? \
1475  ((Query *) (cte)->ctequery)->targetList : \
1476  ((Query *) (cte)->ctequery)->returningList)
1477 
1478 /*
1479  * TriggerTransition -
1480  * representation of transition row or table naming clause
1481  *
1482  * Only transition tables are initially supported in the syntax, and only for
1483  * AFTER triggers, but other permutations are accepted by the parser so we can
1484  * give a meaningful message from C code.
1485  */
1486 typedef struct TriggerTransition
1487 {
1489  char *name;
1490  bool isNew;
1491  bool isTable;
1493 
1494 /*****************************************************************************
1495  * Raw Grammar Output Statements
1496  *****************************************************************************/
1497 
1498 /*
1499  * RawStmt --- container for any one statement's raw parse tree
1500  *
1501  * Parse analysis converts a raw parse tree headed by a RawStmt node into
1502  * an analyzed statement headed by a Query node. For optimizable statements,
1503  * the conversion is complex. For utility statements, the parser usually just
1504  * transfers the raw parse tree (sans RawStmt) into the utilityStmt field of
1505  * the Query node, and all the useful work happens at execution time.
1506  *
1507  * stmt_location/stmt_len identify the portion of the source text string
1508  * containing this raw statement (useful for multi-statement strings).
1509  */
1510 typedef struct RawStmt
1511 {
1513  Node *stmt; /* raw parse tree */
1514  int stmt_location; /* start location, or -1 if unknown */
1515  int stmt_len; /* length in bytes; 0 means "rest of string" */
1516 } RawStmt;
1517 
1518 /*****************************************************************************
1519  * Optimizable Statements
1520  *****************************************************************************/
1521 
1522 /* ----------------------
1523  * Insert Statement
1524  *
1525  * The source expression is represented by SelectStmt for both the
1526  * SELECT and VALUES cases. If selectStmt is NULL, then the query
1527  * is INSERT ... DEFAULT VALUES.
1528  * ----------------------
1529  */
1530 typedef struct InsertStmt
1531 {
1533  RangeVar *relation; /* relation to insert into */
1534  List *cols; /* optional: names of the target columns */
1535  Node *selectStmt; /* the source SELECT/VALUES, or NULL */
1536  OnConflictClause *onConflictClause; /* ON CONFLICT clause */
1537  List *returningList; /* list of expressions to return */
1538  WithClause *withClause; /* WITH clause */
1539  OverridingKind override; /* OVERRIDING clause */
1540 } InsertStmt;
1541 
1542 /* ----------------------
1543  * Delete Statement
1544  * ----------------------
1545  */
1546 typedef struct DeleteStmt
1547 {
1549  RangeVar *relation; /* relation to delete from */
1550  List *usingClause; /* optional using clause for more tables */
1551  Node *whereClause; /* qualifications */
1552  List *returningList; /* list of expressions to return */
1553  WithClause *withClause; /* WITH clause */
1554 } DeleteStmt;
1555 
1556 /* ----------------------
1557  * Update Statement
1558  * ----------------------
1559  */
1560 typedef struct UpdateStmt
1561 {
1563  RangeVar *relation; /* relation to update */
1564  List *targetList; /* the target list (of ResTarget) */
1565  Node *whereClause; /* qualifications */
1566  List *fromClause; /* optional from clause for more tables */
1567  List *returningList; /* list of expressions to return */
1568  WithClause *withClause; /* WITH clause */
1569 } UpdateStmt;
1570 
1571 /* ----------------------
1572  * Select Statement
1573  *
1574  * A "simple" SELECT is represented in the output of gram.y by a single
1575  * SelectStmt node; so is a VALUES construct. A query containing set
1576  * operators (UNION, INTERSECT, EXCEPT) is represented by a tree of SelectStmt
1577  * nodes, in which the leaf nodes are component SELECTs and the internal nodes
1578  * represent UNION, INTERSECT, or EXCEPT operators. Using the same node
1579  * type for both leaf and internal nodes allows gram.y to stick ORDER BY,
1580  * LIMIT, etc, clause values into a SELECT statement without worrying
1581  * whether it is a simple or compound SELECT.
1582  * ----------------------
1583  */
1584 typedef enum SetOperation
1585 {
1590 } SetOperation;
1591 
1592 typedef struct SelectStmt
1593 {
1595 
1596  /*
1597  * These fields are used only in "leaf" SelectStmts.
1598  */
1599  List *distinctClause; /* NULL, list of DISTINCT ON exprs, or
1600  * lcons(NIL,NIL) for all (SELECT DISTINCT) */
1601  IntoClause *intoClause; /* target for SELECT INTO */
1602  List *targetList; /* the target list (of ResTarget) */
1603  List *fromClause; /* the FROM clause */
1604  Node *whereClause; /* WHERE qualification */
1605  List *groupClause; /* GROUP BY clauses */
1606  Node *havingClause; /* HAVING conditional-expression */
1607  List *windowClause; /* WINDOW window_name AS (...), ... */
1608 
1609  /*
1610  * In a "leaf" node representing a VALUES list, the above fields are all
1611  * null, and instead this field is set. Note that the elements of the
1612  * sublists are just expressions, without ResTarget decoration. Also note
1613  * that a list element can be DEFAULT (represented as a SetToDefault
1614  * node), regardless of the context of the VALUES list. It's up to parse
1615  * analysis to reject that where not valid.
1616  */
1617  List *valuesLists; /* untransformed list of expression lists */
1618 
1619  /*
1620  * These fields are used in both "leaf" SelectStmts and upper-level
1621  * SelectStmts.
1622  */
1623  List *sortClause; /* sort clause (a list of SortBy's) */
1624  Node *limitOffset; /* # of result tuples to skip */
1625  Node *limitCount; /* # of result tuples to return */
1626  LimitOption limitOption; /* limit type */
1627  List *lockingClause; /* FOR UPDATE (list of LockingClause's) */
1628  WithClause *withClause; /* WITH clause */
1629 
1630  /*
1631  * These fields are used only in upper-level SelectStmts.
1632  */
1633  SetOperation op; /* type of set op */
1634  bool all; /* ALL specified? */
1635  struct SelectStmt *larg; /* left child */
1636  struct SelectStmt *rarg; /* right child */
1637  /* Eventually add fields for CORRESPONDING spec here */
1638 } SelectStmt;
1639 
1640 
1641 /* ----------------------
1642  * Set Operation node for post-analysis query trees
1643  *
1644  * After parse analysis, a SELECT with set operations is represented by a
1645  * top-level Query node containing the leaf SELECTs as subqueries in its
1646  * range table. Its setOperations field shows the tree of set operations,
1647  * with leaf SelectStmt nodes replaced by RangeTblRef nodes, and internal
1648  * nodes replaced by SetOperationStmt nodes. Information about the output
1649  * column types is added, too. (Note that the child nodes do not necessarily
1650  * produce these types directly, but we've checked that their output types
1651  * can be coerced to the output column type.) Also, if it's not UNION ALL,
1652  * information about the types' sort/group semantics is provided in the form
1653  * of a SortGroupClause list (same representation as, eg, DISTINCT).
1654  * The resolved common column collations are provided too; but note that if
1655  * it's not UNION ALL, it's okay for a column to not have a common collation,
1656  * so a member of the colCollations list could be InvalidOid even though the
1657  * column has a collatable type.
1658  * ----------------------
1659  */
1660 typedef struct SetOperationStmt
1661 {
1663  SetOperation op; /* type of set op */
1664  bool all; /* ALL specified? */
1665  Node *larg; /* left child */
1666  Node *rarg; /* right child */
1667  /* Eventually add fields for CORRESPONDING spec here */
1668 
1669  /* Fields derived during parse analysis: */
1670  List *colTypes; /* OID list of output column type OIDs */
1671  List *colTypmods; /* integer list of output column typmods */
1672  List *colCollations; /* OID list of output column collation OIDs */
1673  List *groupClauses; /* a list of SortGroupClause's */
1674  /* groupClauses is NIL if UNION ALL, but must be set otherwise */
1676 
1677 
1678 /* ----------------------
1679  * PL/pgSQL Assignment Statement
1680  *
1681  * Like SelectStmt, this is transformed into a SELECT Query.
1682  * However, the targetlist of the result looks more like an UPDATE.
1683  * ----------------------
1684  */
1685 typedef struct PLAssignStmt
1686 {
1688 
1689  char *name; /* initial column name */
1690  List *indirection; /* subscripts and field names, if any */
1691  int nnames; /* number of names to use in ColumnRef */
1692  SelectStmt *val; /* the PL/pgSQL expression to assign */
1693  int location; /* name's token location, or -1 if unknown */
1694 } PLAssignStmt;
1695 
1696 
1697 /*****************************************************************************
1698  * Other Statements (no optimizations required)
1699  *
1700  * These are not touched by parser/analyze.c except to put them into
1701  * the utilityStmt field of a Query. This is eventually passed to
1702  * ProcessUtility (by-passing rewriting and planning). Some of the
1703  * statements do need attention from parse analysis, and this is
1704  * done by routines in parser/parse_utilcmd.c after ProcessUtility
1705  * receives the command for execution.
1706  * DECLARE CURSOR, EXPLAIN, and CREATE TABLE AS are special cases:
1707  * they contain optimizable statements, which get processed normally
1708  * by parser/analyze.c.
1709  *****************************************************************************/
1710 
1711 /*
1712  * When a command can act on several kinds of objects with only one
1713  * parse structure required, use these constants to designate the
1714  * object type. Note that commands typically don't support all the types.
1715  */
1716 
1717 typedef enum ObjectType
1718 {
1723  OBJECT_ATTRIBUTE, /* type's attribute, when distinct from column */
1769 } ObjectType;
1770 
1771 /* ----------------------
1772  * Create Schema Statement
1773  *
1774  * NOTE: the schemaElts list contains raw parsetrees for component statements
1775  * of the schema, such as CREATE TABLE, GRANT, etc. These are analyzed and
1776  * executed after the schema itself is created.
1777  * ----------------------
1778  */
1779 typedef struct CreateSchemaStmt
1780 {
1782  char *schemaname; /* the name of the schema to create */
1783  RoleSpec *authrole; /* the owner of the created schema */
1784  List *schemaElts; /* schema components (list of parsenodes) */
1785  bool if_not_exists; /* just do nothing if schema already exists? */
1787 
1788 typedef enum DropBehavior
1789 {
1790  DROP_RESTRICT, /* drop fails if any dependent objects */
1791  DROP_CASCADE /* remove dependent objects too */
1792 } DropBehavior;
1793 
1794 /* ----------------------
1795  * Alter Table
1796  * ----------------------
1797  */
1798 typedef struct AlterTableStmt
1799 {
1801  RangeVar *relation; /* table to work on */
1802  List *cmds; /* list of subcommands */
1803  ObjectType objtype; /* type of object */
1804  bool missing_ok; /* skip error if table missing */
1805 } AlterTableStmt;
1806 
1807 typedef enum AlterTableType
1808 {
1809  AT_AddColumn, /* add column */
1810  AT_AddColumnRecurse, /* internal to commands/tablecmds.c */
1811  AT_AddColumnToView, /* implicitly via CREATE OR REPLACE VIEW */
1812  AT_ColumnDefault, /* alter column default */
1813  AT_CookedColumnDefault, /* add a pre-cooked column default */
1814  AT_DropNotNull, /* alter column drop not null */
1815  AT_SetNotNull, /* alter column set not null */
1816  AT_DropExpression, /* alter column drop expression */
1817  AT_CheckNotNull, /* check column is already marked not null */
1818  AT_SetStatistics, /* alter column set statistics */
1819  AT_SetOptions, /* alter column set ( options ) */
1820  AT_ResetOptions, /* alter column reset ( options ) */
1821  AT_SetStorage, /* alter column set storage */
1822  AT_DropColumn, /* drop column */
1823  AT_DropColumnRecurse, /* internal to commands/tablecmds.c */
1824  AT_AddIndex, /* add index */
1825  AT_ReAddIndex, /* internal to commands/tablecmds.c */
1826  AT_AddConstraint, /* add constraint */
1827  AT_AddConstraintRecurse, /* internal to commands/tablecmds.c */
1828  AT_ReAddConstraint, /* internal to commands/tablecmds.c */
1829  AT_ReAddDomainConstraint, /* internal to commands/tablecmds.c */
1830  AT_AlterConstraint, /* alter constraint */
1831  AT_ValidateConstraint, /* validate constraint */
1832  AT_ValidateConstraintRecurse, /* internal to commands/tablecmds.c */
1833  AT_AddIndexConstraint, /* add constraint using existing index */
1834  AT_DropConstraint, /* drop constraint */
1835  AT_DropConstraintRecurse, /* internal to commands/tablecmds.c */
1836  AT_ReAddComment, /* internal to commands/tablecmds.c */
1837  AT_AlterColumnType, /* alter column type */
1838  AT_AlterColumnGenericOptions, /* alter column OPTIONS (...) */
1839  AT_ChangeOwner, /* change owner */
1840  AT_ClusterOn, /* CLUSTER ON */
1841  AT_DropCluster, /* SET WITHOUT CLUSTER */
1842  AT_SetLogged, /* SET LOGGED */
1843  AT_SetUnLogged, /* SET UNLOGGED */
1844  AT_DropOids, /* SET WITHOUT OIDS */
1845  AT_SetTableSpace, /* SET TABLESPACE */
1846  AT_SetRelOptions, /* SET (...) -- AM specific parameters */
1847  AT_ResetRelOptions, /* RESET (...) -- AM specific parameters */
1848  AT_ReplaceRelOptions, /* replace reloption list in its entirety */
1849  AT_EnableTrig, /* ENABLE TRIGGER name */
1850  AT_EnableAlwaysTrig, /* ENABLE ALWAYS TRIGGER name */
1851  AT_EnableReplicaTrig, /* ENABLE REPLICA TRIGGER name */
1852  AT_DisableTrig, /* DISABLE TRIGGER name */
1853  AT_EnableTrigAll, /* ENABLE TRIGGER ALL */
1854  AT_DisableTrigAll, /* DISABLE TRIGGER ALL */
1855  AT_EnableTrigUser, /* ENABLE TRIGGER USER */
1856  AT_DisableTrigUser, /* DISABLE TRIGGER USER */
1857  AT_EnableRule, /* ENABLE RULE name */
1858  AT_EnableAlwaysRule, /* ENABLE ALWAYS RULE name */
1859  AT_EnableReplicaRule, /* ENABLE REPLICA RULE name */
1860  AT_DisableRule, /* DISABLE RULE name */
1861  AT_AddInherit, /* INHERIT parent */
1862  AT_DropInherit, /* NO INHERIT parent */
1863  AT_AddOf, /* OF <type_name> */
1864  AT_DropOf, /* NOT OF */
1865  AT_ReplicaIdentity, /* REPLICA IDENTITY */
1866  AT_EnableRowSecurity, /* ENABLE ROW SECURITY */
1867  AT_DisableRowSecurity, /* DISABLE ROW SECURITY */
1868  AT_ForceRowSecurity, /* FORCE ROW SECURITY */
1869  AT_NoForceRowSecurity, /* NO FORCE ROW SECURITY */
1870  AT_GenericOptions, /* OPTIONS (...) */
1871  AT_AttachPartition, /* ATTACH PARTITION */
1872  AT_DetachPartition, /* DETACH PARTITION */
1873  AT_AddIdentity, /* ADD IDENTITY */
1874  AT_SetIdentity, /* SET identity column options */
1875  AT_DropIdentity, /* DROP IDENTITY */
1876  AT_AlterCollationRefreshVersion /* ALTER COLLATION ... REFRESH VERSION */
1877 } AlterTableType;
1878 
1879 typedef struct ReplicaIdentityStmt
1880 {
1883  char *name;
1885 
1886 typedef struct AlterTableCmd /* one subcommand of an ALTER TABLE */
1887 {
1889  AlterTableType subtype; /* Type of table alteration to apply */
1890  char *name; /* column, constraint, or trigger to act on,
1891  * or tablespace */
1892  List *object; /* collation to act on if it's a collation */
1893  int16 num; /* attribute number for columns referenced by
1894  * number */
1896  Node *def; /* definition of new column, index,
1897  * constraint, or parent table */
1898  DropBehavior behavior; /* RESTRICT or CASCADE for DROP cases */
1899  bool missing_ok; /* skip error if missing? */
1900 } AlterTableCmd;
1901 
1902 
1903 /* ----------------------
1904  * Alter Domain
1905  *
1906  * The fields are used in different ways by the different variants of
1907  * this command.
1908  * ----------------------
1909  */
1910 typedef struct AlterDomainStmt
1911 {
1913  char subtype; /*------------
1914  * T = alter column default
1915  * N = alter column drop not null
1916  * O = alter column set not null
1917  * C = add constraint
1918  * X = drop constraint
1919  *------------
1920  */
1921  List *typeName; /* domain to work on */
1922  char *name; /* column or constraint name to act on */
1923  Node *def; /* definition of default or constraint */
1924  DropBehavior behavior; /* RESTRICT or CASCADE for DROP cases */
1925  bool missing_ok; /* skip error if missing? */
1926 } AlterDomainStmt;
1927 
1928 
1929 /* ----------------------
1930  * Grant|Revoke Statement
1931  * ----------------------
1932  */
1933 typedef enum GrantTargetType
1934 {
1935  ACL_TARGET_OBJECT, /* grant on specific named object(s) */
1936  ACL_TARGET_ALL_IN_SCHEMA, /* grant on all objects in given schema(s) */
1937  ACL_TARGET_DEFAULTS /* ALTER DEFAULT PRIVILEGES */
1938 } GrantTargetType;
1939 
1940 typedef struct GrantStmt
1941 {
1943  bool is_grant; /* true = GRANT, false = REVOKE */
1944  GrantTargetType targtype; /* type of the grant target */
1945  ObjectType objtype; /* kind of object being operated on */
1946  List *objects; /* list of RangeVar nodes, ObjectWithArgs
1947  * nodes, or plain names (as Value strings) */
1948  List *privileges; /* list of AccessPriv nodes */
1949  /* privileges == NIL denotes ALL PRIVILEGES */
1950  List *grantees; /* list of RoleSpec nodes */
1951  bool grant_option; /* grant or revoke grant option */
1952  DropBehavior behavior; /* drop behavior (for REVOKE) */
1953 } GrantStmt;
1954 
1955 /*
1956  * Note: ObjectWithArgs carries only the types of the input parameters of the
1957  * function. So it is sufficient to identify an existing function, but it
1958  * is not enough info to define a function nor to call it.
1959  */
1960 typedef struct ObjectWithArgs
1961 {
1963  List *objname; /* qualified name of function/operator */
1964  List *objargs; /* list of Typename nodes */
1965  bool args_unspecified; /* argument list was omitted, so name must
1966  * be unique (note that objargs == NIL
1967  * means zero args) */
1968 } ObjectWithArgs;
1969 
1970 /*
1971  * An access privilege, with optional list of column names
1972  * priv_name == NULL denotes ALL PRIVILEGES (only used with a column list)
1973  * cols == NIL denotes "all columns"
1974  * Note that simple "ALL PRIVILEGES" is represented as a NIL list, not
1975  * an AccessPriv with both fields null.
1976  */
1977 typedef struct AccessPriv
1978 {
1980  char *priv_name; /* string name of privilege */
1981  List *cols; /* list of Value strings */
1982 } AccessPriv;
1983 
1984 /* ----------------------
1985  * Grant/Revoke Role Statement
1986  *
1987  * Note: because of the parsing ambiguity with the GRANT <privileges>
1988  * statement, granted_roles is a list of AccessPriv; the execution code
1989  * should complain if any column lists appear. grantee_roles is a list
1990  * of role names, as Value strings.
1991  * ----------------------
1992  */
1993 typedef struct GrantRoleStmt
1994 {
1996  List *granted_roles; /* list of roles to be granted/revoked */
1997  List *grantee_roles; /* list of member roles to add/delete */
1998  bool is_grant; /* true = GRANT, false = REVOKE */
1999  bool admin_opt; /* with admin option */
2000  RoleSpec *grantor; /* set grantor to other than current role */
2001  DropBehavior behavior; /* drop behavior (for REVOKE) */
2002 } GrantRoleStmt;
2003 
2004 /* ----------------------
2005  * Alter Default Privileges Statement
2006  * ----------------------
2007  */
2009 {
2011  List *options; /* list of DefElem */
2012  GrantStmt *action; /* GRANT/REVOKE action (with objects=NIL) */
2014 
2015 /* ----------------------
2016  * Copy Statement
2017  *
2018  * We support "COPY relation FROM file", "COPY relation TO file", and
2019  * "COPY (query) TO file". In any given CopyStmt, exactly one of "relation"
2020  * and "query" must be non-NULL.
2021  * ----------------------
2022  */
2023 typedef struct CopyStmt
2024 {
2026  RangeVar *relation; /* the relation to copy */
2027  Node *query; /* the query (SELECT or DML statement with
2028  * RETURNING) to copy, as a raw parse tree */
2029  List *attlist; /* List of column names (as Strings), or NIL
2030  * for all columns */
2031  bool is_from; /* TO or FROM */
2032  bool is_program; /* is 'filename' a program to popen? */
2033  char *filename; /* filename, or NULL for STDIN/STDOUT */
2034  List *options; /* List of DefElem nodes */
2035  Node *whereClause; /* WHERE condition (or NULL) */
2036 } CopyStmt;
2037 
2038 /* ----------------------
2039  * SET Statement (includes RESET)
2040  *
2041  * "SET var TO DEFAULT" and "RESET var" are semantically equivalent, but we
2042  * preserve the distinction in VariableSetKind for CreateCommandTag().
2043  * ----------------------
2044  */
2045 typedef enum
2046 {
2047  VAR_SET_VALUE, /* SET var = value */
2048  VAR_SET_DEFAULT, /* SET var TO DEFAULT */
2049  VAR_SET_CURRENT, /* SET var FROM CURRENT */
2050  VAR_SET_MULTI, /* special case for SET TRANSACTION ... */
2051  VAR_RESET, /* RESET var */
2052  VAR_RESET_ALL /* RESET ALL */
2053 } VariableSetKind;
2054 
2055 typedef struct VariableSetStmt
2056 {
2059  char *name; /* variable to be set */
2060  List *args; /* List of A_Const nodes */
2061  bool is_local; /* SET LOCAL? */
2062 } VariableSetStmt;
2063 
2064 /* ----------------------
2065  * Show Statement
2066  * ----------------------
2067  */
2068 typedef struct VariableShowStmt
2069 {
2071  char *name;
2073 
2074 /* ----------------------
2075  * Create Table Statement
2076  *
2077  * NOTE: in the raw gram.y output, ColumnDef and Constraint nodes are
2078  * intermixed in tableElts, and constraints is NIL. After parse analysis,
2079  * tableElts contains just ColumnDefs, and constraints contains just
2080  * Constraint nodes (in fact, only CONSTR_CHECK nodes, in the present
2081  * implementation).
2082  * ----------------------
2083  */
2084 
2085 typedef struct CreateStmt
2086 {
2088  RangeVar *relation; /* relation to create */
2089  List *tableElts; /* column definitions (list of ColumnDef) */
2090  List *inhRelations; /* relations to inherit from (list of
2091  * inhRelation) */
2092  PartitionBoundSpec *partbound; /* FOR VALUES clause */
2093  PartitionSpec *partspec; /* PARTITION BY clause */
2094  TypeName *ofTypename; /* OF typename */
2095  List *constraints; /* constraints (list of Constraint nodes) */
2096  List *options; /* options from WITH clause */
2097  OnCommitAction oncommit; /* what do we do at COMMIT? */
2098  char *tablespacename; /* table space to use, or NULL */
2099  char *accessMethod; /* table access method */
2100  bool if_not_exists; /* just do nothing if it already exists? */
2101 } CreateStmt;
2102 
2103 /* ----------
2104  * Definitions for constraints in CreateStmt
2105  *
2106  * Note that column defaults are treated as a type of constraint,
2107  * even though that's a bit odd semantically.
2108  *
2109  * For constraints that use expressions (CONSTR_CHECK, CONSTR_DEFAULT)
2110  * we may have the expression in either "raw" form (an untransformed
2111  * parse tree) or "cooked" form (the nodeToString representation of
2112  * an executable expression tree), depending on how this Constraint
2113  * node was created (by parsing, or by inheritance from an existing
2114  * relation). We should never have both in the same node!
2115  *
2116  * FKCONSTR_ACTION_xxx values are stored into pg_constraint.confupdtype
2117  * and pg_constraint.confdeltype columns; FKCONSTR_MATCH_xxx values are
2118  * stored into pg_constraint.confmatchtype. Changing the code values may
2119  * require an initdb!
2120  *
2121  * If skip_validation is true then we skip checking that the existing rows
2122  * in the table satisfy the constraint, and just install the catalog entries
2123  * for the constraint. A new FK constraint is marked as valid iff
2124  * initially_valid is true. (Usually skip_validation and initially_valid
2125  * are inverses, but we can set both true if the table is known empty.)
2126  *
2127  * Constraint attributes (DEFERRABLE etc) are initially represented as
2128  * separate Constraint nodes for simplicity of parsing. parse_utilcmd.c makes
2129  * a pass through the constraints list to insert the info into the appropriate
2130  * Constraint node.
2131  * ----------
2132  */
2133 
2134 typedef enum ConstrType /* types of constraints */
2135 {
2136  CONSTR_NULL, /* not standard SQL, but a lot of people
2137  * expect it */
2147  CONSTR_ATTR_DEFERRABLE, /* attributes for previous constraint node */
2151 } ConstrType;
2152 
2153 /* Foreign key action codes */
2154 #define FKCONSTR_ACTION_NOACTION 'a'
2155 #define FKCONSTR_ACTION_RESTRICT 'r'
2156 #define FKCONSTR_ACTION_CASCADE 'c'
2157 #define FKCONSTR_ACTION_SETNULL 'n'
2158 #define FKCONSTR_ACTION_SETDEFAULT 'd'
2159 
2160 /* Foreign key matchtype codes */
2161 #define FKCONSTR_MATCH_FULL 'f'
2162 #define FKCONSTR_MATCH_PARTIAL 'p'
2163 #define FKCONSTR_MATCH_SIMPLE 's'
2164 
2165 typedef struct Constraint
2166 {
2168  ConstrType contype; /* see above */
2169 
2170  /* Fields used for most/all constraint types: */
2171  char *conname; /* Constraint name, or NULL if unnamed */
2172  bool deferrable; /* DEFERRABLE? */
2173  bool initdeferred; /* INITIALLY DEFERRED? */
2174  int location; /* token location, or -1 if unknown */
2175 
2176  /* Fields used for constraints with expressions (CHECK and DEFAULT): */
2177  bool is_no_inherit; /* is constraint non-inheritable? */
2178  Node *raw_expr; /* expr, as untransformed parse tree */
2179  char *cooked_expr; /* expr, as nodeToString representation */
2180  char generated_when; /* ALWAYS or BY DEFAULT */
2181 
2182  /* Fields used for unique constraints (UNIQUE and PRIMARY KEY): */
2183  List *keys; /* String nodes naming referenced key
2184  * column(s) */
2185  List *including; /* String nodes naming referenced nonkey
2186  * column(s) */
2187 
2188  /* Fields used for EXCLUSION constraints: */
2189  List *exclusions; /* list of (IndexElem, operator name) pairs */
2190 
2191  /* Fields used for index constraints (UNIQUE, PRIMARY KEY, EXCLUSION): */
2192  List *options; /* options from WITH clause */
2193  char *indexname; /* existing index to use; otherwise NULL */
2194  char *indexspace; /* index tablespace; NULL for default */
2195  bool reset_default_tblspc; /* reset default_tablespace prior to
2196  * creating the index */
2197  /* These could be, but currently are not, used for UNIQUE/PKEY: */
2198  char *access_method; /* index access method; NULL for default */
2199  Node *where_clause; /* partial index predicate */
2200 
2201  /* Fields used for FOREIGN KEY constraints: */
2202  RangeVar *pktable; /* Primary key table */
2203  List *fk_attrs; /* Attributes of foreign key */
2204  List *pk_attrs; /* Corresponding attrs in PK table */
2205  char fk_matchtype; /* FULL, PARTIAL, SIMPLE */
2206  char fk_upd_action; /* ON UPDATE action */
2207  char fk_del_action; /* ON DELETE action */
2208  List *old_conpfeqop; /* pg_constraint.conpfeqop of my former self */
2209  Oid old_pktable_oid; /* pg_constraint.confrelid of my former
2210  * self */
2211 
2212  /* Fields used for constraints that allow a NOT VALID specification */
2213  bool skip_validation; /* skip validation of existing rows? */
2214  bool initially_valid; /* mark the new constraint as valid? */
2215 } Constraint;
2216 
2217 /* ----------------------
2218  * Create/Drop Table Space Statements
2219  * ----------------------
2220  */
2221 
2222 typedef struct CreateTableSpaceStmt
2223 {
2227  char *location;
2230 
2231 typedef struct DropTableSpaceStmt
2232 {
2235  bool missing_ok; /* skip error if missing? */
2237 
2239 {
2243  bool isReset;
2245 
2247 {
2250  ObjectType objtype; /* Object type to move */
2251  List *roles; /* List of roles to move objects of */
2253  bool nowait;
2255 
2256 /* ----------------------
2257  * Create/Alter Extension Statements
2258  * ----------------------
2259  */
2260 
2261 typedef struct CreateExtensionStmt
2262 {
2264  char *extname;
2265  bool if_not_exists; /* just do nothing if it already exists? */
2266  List *options; /* List of DefElem nodes */
2268 
2269 /* Only used for ALTER EXTENSION UPDATE; later might need an action field */
2270 typedef struct AlterExtensionStmt
2271 {
2273  char *extname;
2274  List *options; /* List of DefElem nodes */
2276 
2278 {
2280  char *extname; /* Extension's name */
2281  int action; /* +1 = add object, -1 = drop object */
2282  ObjectType objtype; /* Object's type */
2283  Node *object; /* Qualified name of the object */
2285 
2286 /* ----------------------
2287  * Create/Alter FOREIGN DATA WRAPPER Statements
2288  * ----------------------
2289  */
2290 
2291 typedef struct CreateFdwStmt
2292 {
2294  char *fdwname; /* foreign-data wrapper name */
2295  List *func_options; /* HANDLER/VALIDATOR options */
2296  List *options; /* generic options to FDW */
2297 } CreateFdwStmt;
2298 
2299 typedef struct AlterFdwStmt
2300 {
2302  char *fdwname; /* foreign-data wrapper name */
2303  List *func_options; /* HANDLER/VALIDATOR options */
2304  List *options; /* generic options to FDW */
2305 } AlterFdwStmt;
2306 
2307 /* ----------------------
2308  * Create/Alter FOREIGN SERVER Statements
2309  * ----------------------
2310  */
2311 
2313 {
2315  char *servername; /* server name */
2316  char *servertype; /* optional server type */
2317  char *version; /* optional server version */
2318  char *fdwname; /* FDW name */
2319  bool if_not_exists; /* just do nothing if it already exists? */
2320  List *options; /* generic options to server */
2322 
2324 {
2326  char *servername; /* server name */
2327  char *version; /* optional server version */
2328  List *options; /* generic options to server */
2329  bool has_version; /* version specified */
2331 
2332 /* ----------------------
2333  * Create FOREIGN TABLE Statement
2334  * ----------------------
2335  */
2336 
2338 {
2340  char *servername;
2343 
2344 /* ----------------------
2345  * Create/Drop USER MAPPING Statements
2346  * ----------------------
2347  */
2348 
2350 {
2352  RoleSpec *user; /* user role */
2353  char *servername; /* server name */
2354  bool if_not_exists; /* just do nothing if it already exists? */
2355  List *options; /* generic options to server */
2357 
2358 typedef struct AlterUserMappingStmt
2359 {
2361  RoleSpec *user; /* user role */
2362  char *servername; /* server name */
2363  List *options; /* generic options to server */
2365 
2366 typedef struct DropUserMappingStmt
2367 {
2369  RoleSpec *user; /* user role */
2370  char *servername; /* server name */
2371  bool missing_ok; /* ignore missing mappings */
2373 
2374 /* ----------------------
2375  * Import Foreign Schema Statement
2376  * ----------------------
2377  */
2378 
2380 {
2381  FDW_IMPORT_SCHEMA_ALL, /* all relations wanted */
2382  FDW_IMPORT_SCHEMA_LIMIT_TO, /* include only listed tables in import */
2383  FDW_IMPORT_SCHEMA_EXCEPT /* exclude listed tables from import */
2385 
2387 {
2389  char *server_name; /* FDW server name */
2390  char *remote_schema; /* remote schema name to query */
2391  char *local_schema; /* local schema to create objects in */
2392  ImportForeignSchemaType list_type; /* type of table list */
2393  List *table_list; /* List of RangeVar */
2394  List *options; /* list of options to pass to FDW */
2396 
2397 /*----------------------
2398  * Create POLICY Statement
2399  *----------------------
2400  */
2401 typedef struct CreatePolicyStmt
2402 {
2404  char *policy_name; /* Policy's name */
2405  RangeVar *table; /* the table name the policy applies to */
2406  char *cmd_name; /* the command name the policy applies to */
2407  bool permissive; /* restrictive or permissive policy */
2408  List *roles; /* the roles associated with the policy */
2409  Node *qual; /* the policy's condition */
2410  Node *with_check; /* the policy's WITH CHECK condition. */
2412 
2413 /*----------------------
2414  * Alter POLICY Statement
2415  *----------------------
2416  */
2417 typedef struct AlterPolicyStmt
2418 {
2420  char *policy_name; /* Policy's name */
2421  RangeVar *table; /* the table name the policy applies to */
2422  List *roles; /* the roles associated with the policy */
2423  Node *qual; /* the policy's condition */
2424  Node *with_check; /* the policy's WITH CHECK condition. */
2425 } AlterPolicyStmt;
2426 
2427 /*----------------------
2428  * Create ACCESS METHOD Statement
2429  *----------------------
2430  */
2431 typedef struct CreateAmStmt
2432 {
2434  char *amname; /* access method name */
2435  List *handler_name; /* handler function name */
2436  char amtype; /* type of access method */
2437 } CreateAmStmt;
2438 
2439 /* ----------------------
2440  * Create TRIGGER Statement
2441  * ----------------------
2442  */
2443 typedef struct CreateTrigStmt
2444 {
2446  bool replace; /* replace trigger if already exists */
2447  bool isconstraint; /* This is a constraint trigger */
2448  char *trigname; /* TRIGGER's name */
2449  RangeVar *relation; /* relation trigger is on */
2450  List *funcname; /* qual. name of function to call */
2451  List *args; /* list of (T_String) Values or NIL */
2452  bool row; /* ROW/STATEMENT */
2453  /* timing uses the TRIGGER_TYPE bits defined in catalog/pg_trigger.h */
2454  int16 timing; /* BEFORE, AFTER, or INSTEAD */
2455  /* events uses the TRIGGER_TYPE bits defined in catalog/pg_trigger.h */
2456  int16 events; /* "OR" of INSERT/UPDATE/DELETE/TRUNCATE */
2457  List *columns; /* column names, or NIL for all columns */
2458  Node *whenClause; /* qual expression, or NULL if none */
2459  /* explicitly named transition data */
2460  List *transitionRels; /* TriggerTransition nodes, or NIL if none */
2461  /* The remaining fields are only used for constraint triggers */
2462  bool deferrable; /* [NOT] DEFERRABLE */
2463  bool initdeferred; /* INITIALLY {DEFERRED|IMMEDIATE} */
2464  RangeVar *constrrel; /* opposite relation, if RI trigger */
2465 } CreateTrigStmt;
2466 
2467 /* ----------------------
2468  * Create EVENT TRIGGER Statement
2469  * ----------------------
2470  */
2471 typedef struct CreateEventTrigStmt
2472 {
2474  char *trigname; /* TRIGGER's name */
2475  char *eventname; /* event's identifier */
2476  List *whenclause; /* list of DefElems indicating filtering */
2477  List *funcname; /* qual. name of function to call */
2479 
2480 /* ----------------------
2481  * Alter EVENT TRIGGER Statement
2482  * ----------------------
2483  */
2484 typedef struct AlterEventTrigStmt
2485 {
2487  char *trigname; /* TRIGGER's name */
2488  char tgenabled; /* trigger's firing configuration WRT
2489  * session_replication_role */
2491 
2492 /* ----------------------
2493  * Create LANGUAGE Statements
2494  * ----------------------
2495  */
2496 typedef struct CreatePLangStmt
2497 {
2499  bool replace; /* T => replace if already exists */
2500  char *plname; /* PL name */
2501  List *plhandler; /* PL call handler function (qual. name) */
2502  List *plinline; /* optional inline function (qual. name) */
2503  List *plvalidator; /* optional validator function (qual. name) */
2504  bool pltrusted; /* PL is trusted */
2505 } CreatePLangStmt;
2506 
2507 /* ----------------------
2508  * Create/Alter/Drop Role Statements
2509  *
2510  * Note: these node types are also used for the backwards-compatible
2511  * Create/Alter/Drop User/Group statements. In the ALTER and DROP cases
2512  * there's really no need to distinguish what the original spelling was,
2513  * but for CREATE we mark the type because the defaults vary.
2514  * ----------------------
2515  */
2516 typedef enum RoleStmtType
2517 {
2521 } RoleStmtType;
2522 
2523 typedef struct CreateRoleStmt
2524 {
2526  RoleStmtType stmt_type; /* ROLE/USER/GROUP */
2527  char *role; /* role name */
2528  List *options; /* List of DefElem nodes */
2529 } CreateRoleStmt;
2530 
2531 typedef struct AlterRoleStmt
2532 {
2534  RoleSpec *role; /* role */
2535  List *options; /* List of DefElem nodes */
2536  int action; /* +1 = add members, -1 = drop members */
2537 } AlterRoleStmt;
2538 
2539 typedef struct AlterRoleSetStmt
2540 {
2542  RoleSpec *role; /* role */
2543  char *database; /* database name, or NULL */
2544  VariableSetStmt *setstmt; /* SET or RESET subcommand */
2546 
2547 typedef struct DropRoleStmt
2548 {
2550  List *roles; /* List of roles to remove */
2551  bool missing_ok; /* skip error if a role is missing? */
2552 } DropRoleStmt;
2553 
2554 /* ----------------------
2555  * {Create|Alter} SEQUENCE Statement
2556  * ----------------------
2557  */
2558 
2559 typedef struct CreateSeqStmt
2560 {
2562  RangeVar *sequence; /* the sequence to create */
2564  Oid ownerId; /* ID of owner, or InvalidOid for default */
2566  bool if_not_exists; /* just do nothing if it already exists? */
2567 } CreateSeqStmt;
2568 
2569 typedef struct AlterSeqStmt
2570 {
2572  RangeVar *sequence; /* the sequence to alter */
2575  bool missing_ok; /* skip error if a role is missing? */
2576 } AlterSeqStmt;
2577 
2578 /* ----------------------
2579  * Create {Aggregate|Operator|Type} Statement
2580  * ----------------------
2581  */
2582 typedef struct DefineStmt
2583 {
2585  ObjectType kind; /* aggregate, operator, type */
2586  bool oldstyle; /* hack to signal old CREATE AGG syntax */
2587  List *defnames; /* qualified name (list of Value strings) */
2588  List *args; /* a list of TypeName (if needed) */
2589  List *definition; /* a list of DefElem */
2590  bool if_not_exists; /* just do nothing if it already exists? */
2591  bool replace; /* replace if already exists? */
2592 } DefineStmt;
2593 
2594 /* ----------------------
2595  * Create Domain Statement
2596  * ----------------------
2597  */
2598 typedef struct CreateDomainStmt
2599 {
2601  List *domainname; /* qualified name (list of Value strings) */
2602  TypeName *typeName; /* the base type */
2603  CollateClause *collClause; /* untransformed COLLATE spec, if any */
2604  List *constraints; /* constraints (list of Constraint nodes) */
2606 
2607 /* ----------------------
2608  * Create Operator Class Statement
2609  * ----------------------
2610  */
2611 typedef struct CreateOpClassStmt
2612 {
2614  List *opclassname; /* qualified name (list of Value strings) */
2615  List *opfamilyname; /* qualified name (ditto); NIL if omitted */
2616  char *amname; /* name of index AM opclass is for */
2617  TypeName *datatype; /* datatype of indexed column */
2618  List *items; /* List of CreateOpClassItem nodes */
2619  bool isDefault; /* Should be marked as default for type? */
2621 
2622 #define OPCLASS_ITEM_OPERATOR 1
2623 #define OPCLASS_ITEM_FUNCTION 2
2624 #define OPCLASS_ITEM_STORAGETYPE 3
2625 
2626 typedef struct CreateOpClassItem
2627 {
2629  int itemtype; /* see codes above */
2630  ObjectWithArgs *name; /* operator or function name and args */
2631  int number; /* strategy num or support proc num */
2632  List *order_family; /* only used for ordering operators */
2633  List *class_args; /* amproclefttype/amprocrighttype or
2634  * amoplefttype/amoprighttype */
2635  /* fields used for a storagetype item: */
2636  TypeName *storedtype; /* datatype stored in index */
2638 
2639 /* ----------------------
2640  * Create Operator Family Statement
2641  * ----------------------
2642  */
2643 typedef struct CreateOpFamilyStmt
2644 {
2646  List *opfamilyname; /* qualified name (list of Value strings) */
2647  char *amname; /* name of index AM opfamily is for */
2649 
2650 /* ----------------------
2651  * Alter Operator Family Statement
2652  * ----------------------
2653  */
2654 typedef struct AlterOpFamilyStmt
2655 {
2657  List *opfamilyname; /* qualified name (list of Value strings) */
2658  char *amname; /* name of index AM opfamily is for */
2659  bool isDrop; /* ADD or DROP the items? */
2660  List *items; /* List of CreateOpClassItem nodes */
2662 
2663 /* ----------------------
2664  * Drop Table|Sequence|View|Index|Type|Domain|Conversion|Schema Statement
2665  * ----------------------
2666  */
2667 
2668 typedef struct DropStmt
2669 {
2671  List *objects; /* list of names */
2672  ObjectType removeType; /* object type */
2673  DropBehavior behavior; /* RESTRICT or CASCADE behavior */
2674  bool missing_ok; /* skip error if object is missing? */
2675  bool concurrent; /* drop index concurrently? */
2676 } DropStmt;
2677 
2678 /* ----------------------
2679  * Truncate Table Statement
2680  * ----------------------
2681  */
2682 typedef struct TruncateStmt
2683 {
2685  List *relations; /* relations (RangeVars) to be truncated */
2686  bool restart_seqs; /* restart owned sequences? */
2687  DropBehavior behavior; /* RESTRICT or CASCADE behavior */
2688 } TruncateStmt;
2689 
2690 /* ----------------------
2691  * Comment On Statement
2692  * ----------------------
2693  */
2694 typedef struct CommentStmt
2695 {
2697  ObjectType objtype; /* Object's type */
2698  Node *object; /* Qualified name of the object */
2699  char *comment; /* Comment to insert, or NULL to remove */
2700 } CommentStmt;
2701 
2702 /* ----------------------
2703  * SECURITY LABEL Statement
2704  * ----------------------
2705  */
2706 typedef struct SecLabelStmt
2707 {
2709  ObjectType objtype; /* Object's type */
2710  Node *object; /* Qualified name of the object */
2711  char *provider; /* Label provider (or NULL) */
2712  char *label; /* New security label to be assigned */
2713 } SecLabelStmt;
2714 
2715 /* ----------------------
2716  * Declare Cursor Statement
2717  *
2718  * The "query" field is initially a raw parse tree, and is converted to a
2719  * Query node during parse analysis. Note that rewriting and planning
2720  * of the query are always postponed until execution.
2721  * ----------------------
2722  */
2723 #define CURSOR_OPT_BINARY 0x0001 /* BINARY */
2724 #define CURSOR_OPT_SCROLL 0x0002 /* SCROLL explicitly given */
2725 #define CURSOR_OPT_NO_SCROLL 0x0004 /* NO SCROLL explicitly given */
2726 #define CURSOR_OPT_INSENSITIVE 0x0008 /* INSENSITIVE */
2727 #define CURSOR_OPT_HOLD 0x0010 /* WITH HOLD */
2728 /* these planner-control flags do not correspond to any SQL grammar: */
2729 #define CURSOR_OPT_FAST_PLAN 0x0020 /* prefer fast-start plan */
2730 #define CURSOR_OPT_GENERIC_PLAN 0x0040 /* force use of generic plan */
2731 #define CURSOR_OPT_CUSTOM_PLAN 0x0080 /* force use of custom plan */
2732 #define CURSOR_OPT_PARALLEL_OK 0x0100 /* parallel mode OK */
2733 
2734 typedef struct DeclareCursorStmt
2735 {
2737  char *portalname; /* name of the portal (cursor) */
2738  int options; /* bitmask of options (see above) */
2739  Node *query; /* the query (see comments above) */
2741 
2742 /* ----------------------
2743  * Close Portal Statement
2744  * ----------------------
2745  */
2746 typedef struct ClosePortalStmt
2747 {
2749  char *portalname; /* name of the portal (cursor) */
2750  /* NULL means CLOSE ALL */
2751 } ClosePortalStmt;
2752 
2753 /* ----------------------
2754  * Fetch Statement (also Move)
2755  * ----------------------
2756  */
2757 typedef enum FetchDirection
2758 {
2759  /* for these, howMany is how many rows to fetch; FETCH_ALL means ALL */
2762  /* for these, howMany indicates a position; only one row is fetched */
2765 } FetchDirection;
2766 
2767 #define FETCH_ALL LONG_MAX
2768 
2769 typedef struct FetchStmt
2770 {
2772  FetchDirection direction; /* see above */
2773  long howMany; /* number of rows, or position argument */
2774  char *portalname; /* name of portal (cursor) */
2775  bool ismove; /* true if MOVE */
2776 } FetchStmt;
2777 
2778 /* ----------------------
2779  * Create Index Statement
2780  *
2781  * This represents creation of an index and/or an associated constraint.
2782  * If isconstraint is true, we should create a pg_constraint entry along
2783  * with the index. But if indexOid isn't InvalidOid, we are not creating an
2784  * index, just a UNIQUE/PKEY constraint using an existing index. isconstraint
2785  * must always be true in this case, and the fields describing the index
2786  * properties are empty.
2787  * ----------------------
2788  */
2789 typedef struct IndexStmt
2790 {
2792  char *idxname; /* name of new index, or NULL for default */
2793  RangeVar *relation; /* relation to build index on */
2794  char *accessMethod; /* name of access method (eg. btree) */
2795  char *tableSpace; /* tablespace, or NULL for default */
2796  List *indexParams; /* columns to index: a list of IndexElem */
2797  List *indexIncludingParams; /* additional columns to index: a list
2798  * of IndexElem */
2799  List *options; /* WITH clause options: a list of DefElem */
2800  Node *whereClause; /* qualification (partial-index predicate) */
2801  List *excludeOpNames; /* exclusion operator names, or NIL if none */
2802  char *idxcomment; /* comment to apply to index, or NULL */
2803  Oid indexOid; /* OID of an existing index, if any */
2804  Oid oldNode; /* relfilenode of existing storage, if any */
2805  SubTransactionId oldCreateSubid; /* rd_createSubid of oldNode */
2806  SubTransactionId oldFirstRelfilenodeSubid; /* rd_firstRelfilenodeSubid of
2807  * oldNode */
2808  bool unique; /* is index unique? */
2809  bool primary; /* is index a primary key? */
2810  bool isconstraint; /* is it for a pkey/unique constraint? */
2811  bool deferrable; /* is the constraint DEFERRABLE? */
2812  bool initdeferred; /* is the constraint INITIALLY DEFERRED? */
2813  bool transformed; /* true when transformIndexStmt is finished */
2814  bool concurrent; /* should this be a concurrent index build? */
2815  bool if_not_exists; /* just do nothing if index already exists? */
2816  bool reset_default_tblspc; /* reset default_tablespace prior to
2817  * executing */
2818 } IndexStmt;
2819 
2820 /* ----------------------
2821  * Create Statistics Statement
2822  * ----------------------
2823  */
2824 typedef struct CreateStatsStmt
2825 {
2827  List *defnames; /* qualified name (list of Value strings) */
2828  List *stat_types; /* stat types (list of Value strings) */
2829  List *exprs; /* expressions to build statistics on */
2830  List *relations; /* rels to build stats on (list of RangeVar) */
2831  char *stxcomment; /* comment to apply to stats, or NULL */
2832  bool if_not_exists; /* do nothing if stats name already exists */
2833 } CreateStatsStmt;
2834 
2835 /* ----------------------
2836  * Alter Statistics Statement
2837  * ----------------------
2838  */
2839 typedef struct AlterStatsStmt
2840 {
2842  List *defnames; /* qualified name (list of Value strings) */
2843  int stxstattarget; /* statistics target */
2844  bool missing_ok; /* skip error if statistics object is missing */
2845 } AlterStatsStmt;
2846 
2847 /* ----------------------
2848  * Create Function Statement
2849  * ----------------------
2850  */
2851 typedef struct CreateFunctionStmt
2852 {
2854  bool is_procedure; /* it's really CREATE PROCEDURE */
2855  bool replace; /* T => replace if already exists */
2856  List *funcname; /* qualified name of function to create */
2857  List *parameters; /* a list of FunctionParameter */
2858  TypeName *returnType; /* the return type */
2859  List *options; /* a list of DefElem */
2861 
2863 {
2864  /* the assigned enum values appear in pg_proc, don't change 'em! */
2865  FUNC_PARAM_IN = 'i', /* input only */
2866  FUNC_PARAM_OUT = 'o', /* output only */
2867  FUNC_PARAM_INOUT = 'b', /* both */
2868  FUNC_PARAM_VARIADIC = 'v', /* variadic (always input) */
2869  FUNC_PARAM_TABLE = 't' /* table function output column */
2871 
2872 typedef struct FunctionParameter
2873 {
2875  char *name; /* parameter name, or NULL if not given */
2876  TypeName *argType; /* TypeName for parameter type */
2877  FunctionParameterMode mode; /* IN/OUT/etc */
2878  Node *defexpr; /* raw default expr, or NULL if not given */
2880 
2881 typedef struct AlterFunctionStmt
2882 {
2885  ObjectWithArgs *func; /* name and args of function */
2886  List *actions; /* list of DefElem */
2888 
2889 /* ----------------------
2890  * DO Statement
2891  *
2892  * DoStmt is the raw parser output, InlineCodeBlock is the execution-time API
2893  * ----------------------
2894  */
2895 typedef struct DoStmt
2896 {
2898  List *args; /* List of DefElem nodes */
2899 } DoStmt;
2900 
2901 typedef struct InlineCodeBlock
2902 {
2904  char *source_text; /* source text of anonymous code block */
2905  Oid langOid; /* OID of selected language */
2906  bool langIsTrusted; /* trusted property of the language */
2907  bool atomic; /* atomic execution context */
2908 } InlineCodeBlock;
2909 
2910 /* ----------------------
2911  * CALL statement
2912  * ----------------------
2913  */
2914 typedef struct CallStmt
2915 {
2917  FuncCall *funccall; /* from the parser */
2918  FuncExpr *funcexpr; /* transformed */
2919 } CallStmt;
2920 
2921 typedef struct CallContext
2922 {
2924  bool atomic;
2925 } CallContext;
2926 
2927 /* ----------------------
2928  * Alter Object Rename Statement
2929  * ----------------------
2930  */
2931 typedef struct RenameStmt
2932 {
2934  ObjectType renameType; /* OBJECT_TABLE, OBJECT_COLUMN, etc */
2935  ObjectType relationType; /* if column name, associated relation type */
2936  RangeVar *relation; /* in case it's a table */
2937  Node *object; /* in case it's some other object */
2938  char *subname; /* name of contained object (column, rule,
2939  * trigger, etc) */
2940  char *newname; /* the new name */
2941  DropBehavior behavior; /* RESTRICT or CASCADE behavior */
2942  bool missing_ok; /* skip error if missing? */
2943 } RenameStmt;
2944 
2945 /* ----------------------
2946  * ALTER object DEPENDS ON EXTENSION extname
2947  * ----------------------
2948  */
2950 {
2952  ObjectType objectType; /* OBJECT_FUNCTION, OBJECT_TRIGGER, etc */
2953  RangeVar *relation; /* in case a table is involved */
2954  Node *object; /* name of the object */
2955  Value *extname; /* extension name */
2956  bool remove; /* set true to remove dep rather than add */
2958 
2959 /* ----------------------
2960  * ALTER object SET SCHEMA Statement
2961  * ----------------------
2962  */
2964 {
2966  ObjectType objectType; /* OBJECT_TABLE, OBJECT_TYPE, etc */
2967  RangeVar *relation; /* in case it's a table */
2968  Node *object; /* in case it's some other object */
2969  char *newschema; /* the new schema */
2970  bool missing_ok; /* skip error if missing? */
2972 
2973 /* ----------------------
2974  * Alter Object Owner Statement
2975  * ----------------------
2976  */
2977 typedef struct AlterOwnerStmt
2978 {
2980  ObjectType objectType; /* OBJECT_TABLE, OBJECT_TYPE, etc */
2981  RangeVar *relation; /* in case it's a table */
2982  Node *object; /* in case it's some other object */
2983  RoleSpec *newowner; /* the new owner */
2984 } AlterOwnerStmt;
2985 
2986 /* ----------------------
2987  * Alter Operator Set ( this-n-that )
2988  * ----------------------
2989  */
2990 typedef struct AlterOperatorStmt
2991 {
2993  ObjectWithArgs *opername; /* operator name and argument types */
2994  List *options; /* List of DefElem nodes */
2996 
2997 /* ------------------------
2998  * Alter Type Set ( this-n-that )
2999  * ------------------------
3000  */
3001 typedef struct AlterTypeStmt
3002 {
3004  List *typeName; /* type name (possibly qualified) */
3005  List *options; /* List of DefElem nodes */
3006 } AlterTypeStmt;
3007 
3008 /* ----------------------
3009  * Create Rule Statement
3010  * ----------------------
3011  */
3012 typedef struct RuleStmt
3013 {
3015  RangeVar *relation; /* relation the rule is for */
3016  char *rulename; /* name of the rule */
3017  Node *whereClause; /* qualifications */
3018  CmdType event; /* SELECT, INSERT, etc */
3019  bool instead; /* is a 'do instead'? */
3020  List *actions; /* the action statements */
3021  bool replace; /* OR REPLACE */
3022 } RuleStmt;
3023 
3024 /* ----------------------
3025  * Notify Statement
3026  * ----------------------
3027  */
3028 typedef struct NotifyStmt
3029 {
3031  char *conditionname; /* condition name to notify */
3032  char *payload; /* the payload string, or NULL if none */
3033 } NotifyStmt;
3034 
3035 /* ----------------------
3036  * Listen Statement
3037  * ----------------------
3038  */
3039 typedef struct ListenStmt
3040 {
3042  char *conditionname; /* condition name to listen on */
3043 } ListenStmt;
3044 
3045 /* ----------------------
3046  * Unlisten Statement
3047  * ----------------------
3048  */
3049 typedef struct UnlistenStmt
3050 {
3052  char *conditionname; /* name to unlisten on, or NULL for all */
3053 } UnlistenStmt;
3054 
3055 /* ----------------------
3056  * {Begin|Commit|Rollback} Transaction Statement
3057  * ----------------------
3058  */
3060 {
3062  TRANS_STMT_START, /* semantically identical to BEGIN */
3072 
3073 typedef struct TransactionStmt
3074 {
3076  TransactionStmtKind kind; /* see above */
3077  List *options; /* for BEGIN/START commands */
3078  char *savepoint_name; /* for savepoint commands */
3079  char *gid; /* for two-phase-commit related commands */
3080  bool chain; /* AND CHAIN option */
3081 } TransactionStmt;
3082 
3083 /* ----------------------
3084  * Create Type Statement, composite types
3085  * ----------------------
3086  */
3087 typedef struct CompositeTypeStmt
3088 {
3090  RangeVar *typevar; /* the composite type to be created */
3091  List *coldeflist; /* list of ColumnDef nodes */
3093 
3094 /* ----------------------
3095  * Create Type Statement, enum types
3096  * ----------------------
3097  */
3098 typedef struct CreateEnumStmt
3099 {
3101  List *typeName; /* qualified name (list of Value strings) */
3102  List *vals; /* enum values (list of Value strings) */
3103 } CreateEnumStmt;
3104 
3105 /* ----------------------
3106  * Create Type Statement, range types
3107  * ----------------------
3108  */
3109 typedef struct CreateRangeStmt
3110 {
3112  List *typeName; /* qualified name (list of Value strings) */
3113  List *params; /* range parameters (list of DefElem) */
3114 } CreateRangeStmt;
3115 
3116 /* ----------------------
3117  * Alter Type Statement, enum types
3118  * ----------------------
3119  */
3120 typedef struct AlterEnumStmt
3121 {
3123  List *typeName; /* qualified name (list of Value strings) */
3124  char *oldVal; /* old enum value's name, if renaming */
3125  char *newVal; /* new enum value's name */
3126  char *newValNeighbor; /* neighboring enum value, if specified */
3127  bool newValIsAfter; /* place new enum value after neighbor? */
3128  bool skipIfNewValExists; /* no error if new already exists? */
3129 } AlterEnumStmt;
3130 
3131 /* ----------------------
3132  * Create View Statement
3133  * ----------------------
3134  */
3135 typedef enum ViewCheckOption
3136 {
3140 } ViewCheckOption;
3141 
3142 typedef struct ViewStmt
3143 {
3145  RangeVar *view; /* the view to be created */
3146  List *aliases; /* target column names */
3147  Node *query; /* the SELECT query (as a raw parse tree) */
3148  bool replace; /* replace an existing view? */
3149  List *options; /* options from WITH clause */
3150  ViewCheckOption withCheckOption; /* WITH CHECK OPTION */
3151 } ViewStmt;
3152 
3153 /* ----------------------
3154  * Load Statement
3155  * ----------------------
3156  */
3157 typedef struct LoadStmt
3158 {
3160  char *filename; /* file to load */
3161 } LoadStmt;
3162 
3163 /* ----------------------
3164  * Createdb Statement
3165  * ----------------------
3166  */
3167 typedef struct CreatedbStmt
3168 {
3170  char *dbname; /* name of database to create */
3171  List *options; /* List of DefElem nodes */
3172 } CreatedbStmt;
3173 
3174 /* ----------------------
3175  * Alter Database
3176  * ----------------------
3177  */
3178 typedef struct AlterDatabaseStmt
3179 {
3181  char *dbname; /* name of database to alter */
3182  List *options; /* List of DefElem nodes */
3184 
3185 typedef struct AlterDatabaseSetStmt
3186 {
3188  char *dbname; /* database name */
3189  VariableSetStmt *setstmt; /* SET or RESET subcommand */
3191 
3192 /* ----------------------
3193  * Dropdb Statement
3194  * ----------------------
3195  */
3196 typedef struct DropdbStmt
3197 {
3199  char *dbname; /* database to drop */
3200  bool missing_ok; /* skip error if db is missing? */
3201  List *options; /* currently only FORCE is supported */
3202 } DropdbStmt;
3203 
3204 /* ----------------------
3205  * Alter System Statement
3206  * ----------------------
3207  */
3208 typedef struct AlterSystemStmt
3209 {
3211  VariableSetStmt *setstmt; /* SET subcommand */
3212 } AlterSystemStmt;
3213 
3214 /* ----------------------
3215  * Cluster Statement (support pbrown's cluster index implementation)
3216  * ----------------------
3217  */
3218 typedef struct ClusterStmt
3219 {
3221  RangeVar *relation; /* relation being indexed, or NULL if all */
3222  char *indexname; /* original index defined */
3223  List *params; /* list of DefElem nodes */
3224 } ClusterStmt;
3225 
3226 /* ----------------------
3227  * Vacuum and Analyze Statements
3228  *
3229  * Even though these are nominally two statements, it's convenient to use
3230  * just one node type for both.
3231  * ----------------------
3232  */
3233 typedef struct VacuumStmt
3234 {
3236  List *options; /* list of DefElem nodes */
3237  List *rels; /* list of VacuumRelation, or NIL for all */
3238  bool is_vacuumcmd; /* true for VACUUM, false for ANALYZE */
3239 } VacuumStmt;
3240 
3241 /*
3242  * Info about a single target table of VACUUM/ANALYZE.
3243  *
3244  * If the OID field is set, it always identifies the table to process.
3245  * Then the relation field can be NULL; if it isn't, it's used only to report
3246  * failure to open/lock the relation.
3247  */
3248 typedef struct VacuumRelation
3249 {
3251  RangeVar *relation; /* table name to process, or NULL */
3252  Oid oid; /* table's OID; InvalidOid if not looked up */
3253  List *va_cols; /* list of column names, or NIL for all */
3254 } VacuumRelation;
3255 
3256 /* ----------------------
3257  * Explain Statement
3258  *
3259  * The "query" field is initially a raw parse tree, and is converted to a
3260  * Query node during parse analysis. Note that rewriting and planning
3261  * of the query are always postponed until execution.
3262  * ----------------------
3263  */
3264 typedef struct ExplainStmt
3265 {
3267  Node *query; /* the query (see comments above) */
3268  List *options; /* list of DefElem nodes */
3269 } ExplainStmt;
3270 
3271 /* ----------------------
3272  * CREATE TABLE AS Statement (a/k/a SELECT INTO)
3273  *
3274  * A query written as CREATE TABLE AS will produce this node type natively.
3275  * A query written as SELECT ... INTO will be transformed to this form during
3276  * parse analysis.
3277  * A query written as CREATE MATERIALIZED view will produce this node type,
3278  * during parse analysis, since it needs all the same data.
3279  *
3280  * The "query" field is handled similarly to EXPLAIN, though note that it
3281  * can be a SELECT or an EXECUTE, but not other DML statements.
3282  * ----------------------
3283  */
3284 typedef struct CreateTableAsStmt
3285 {
3287  Node *query; /* the query (see comments above) */
3288  IntoClause *into; /* destination table */
3289  ObjectType objtype; /* OBJECT_TABLE or OBJECT_MATVIEW */
3290  bool is_select_into; /* it was written as SELECT INTO */
3291  bool if_not_exists; /* just do nothing if it already exists? */
3293 
3294 /* ----------------------
3295  * REFRESH MATERIALIZED VIEW Statement
3296  * ----------------------
3297  */
3298 typedef struct RefreshMatViewStmt
3299 {
3301  bool concurrent; /* allow concurrent access? */
3302  bool skipData; /* true for WITH NO DATA */
3303  RangeVar *relation; /* relation to insert into */
3305 
3306 /* ----------------------
3307  * Checkpoint Statement
3308  * ----------------------
3309  */
3310 typedef struct CheckPointStmt
3311 {
3313 } CheckPointStmt;
3314 
3315 /* ----------------------
3316  * Discard Statement
3317  * ----------------------
3318  */
3319 
3320 typedef enum DiscardMode
3321 {
3326 } DiscardMode;
3327 
3328 typedef struct DiscardStmt
3329 {
3332 } DiscardStmt;
3333 
3334 /* ----------------------
3335  * LOCK Statement
3336  * ----------------------
3337  */
3338 typedef struct LockStmt
3339 {
3341  List *relations; /* relations to lock */
3342  int mode; /* lock mode */
3343  bool nowait; /* no wait mode */
3344 } LockStmt;
3345 
3346 /* ----------------------
3347  * SET CONSTRAINTS Statement
3348  * ----------------------
3349  */
3350 typedef struct ConstraintsSetStmt
3351 {
3353  List *constraints; /* List of names as RangeVars */
3354  bool deferred;
3356 
3357 /* ----------------------
3358  * REINDEX Statement
3359  * ----------------------
3360  */
3361 typedef enum ReindexObjectType
3362 {
3364  REINDEX_OBJECT_TABLE, /* table or materialized view */
3366  REINDEX_OBJECT_SYSTEM, /* system catalogs */
3369 
3370 typedef struct ReindexStmt
3371 {
3373  ReindexObjectType kind; /* REINDEX_OBJECT_INDEX, REINDEX_OBJECT_TABLE,
3374  * etc. */
3375  RangeVar *relation; /* Table or index to reindex */
3376  const char *name; /* name of database to reindex */
3377  List *params; /* list of DefElem nodes */
3378 } ReindexStmt;
3379 
3380 /* ----------------------
3381  * CREATE CONVERSION Statement
3382  * ----------------------
3383  */
3384 typedef struct CreateConversionStmt
3385 {
3387  List *conversion_name; /* Name of the conversion */
3388  char *for_encoding_name; /* source encoding name */
3389  char *to_encoding_name; /* destination encoding name */
3390  List *func_name; /* qualified conversion function name */
3391  bool def; /* is this a default conversion? */
3393 
3394 /* ----------------------
3395  * CREATE CAST Statement
3396  * ----------------------
3397  */
3398 typedef struct CreateCastStmt
3399 {
3405  bool inout;
3406 } CreateCastStmt;
3407 
3408 /* ----------------------
3409  * CREATE TRANSFORM Statement
3410  * ----------------------
3411  */
3412 typedef struct CreateTransformStmt
3413 {
3415  bool replace;
3417  char *lang;
3421 
3422 /* ----------------------
3423  * PREPARE Statement
3424  * ----------------------
3425  */
3426 typedef struct PrepareStmt
3427 {
3429  char *name; /* Name of plan, arbitrary */
3430  List *argtypes; /* Types of parameters (List of TypeName) */
3431  Node *query; /* The query itself (as a raw parsetree) */
3432 } PrepareStmt;
3433 
3434 
3435 /* ----------------------
3436  * EXECUTE Statement
3437  * ----------------------
3438  */
3439 
3440 typedef struct ExecuteStmt
3441 {
3443  char *name; /* The name of the plan to execute */
3444  List *params; /* Values to assign to parameters */
3445 } ExecuteStmt;
3446 
3447 
3448 /* ----------------------
3449  * DEALLOCATE Statement
3450  * ----------------------
3451  */
3452 typedef struct DeallocateStmt
3453 {
3455  char *name; /* The name of the plan to remove */
3456  /* NULL means DEALLOCATE ALL */
3457 } DeallocateStmt;
3458 
3459 /*
3460  * DROP OWNED statement
3461  */
3462 typedef struct DropOwnedStmt
3463 {
3467 } DropOwnedStmt;
3468 
3469 /*
3470  * REASSIGN OWNED statement
3471  */
3472 typedef struct ReassignOwnedStmt
3473 {
3478 
3479 /*
3480  * TS Dictionary stmts: DefineStmt, RenameStmt and DropStmt are default
3481  */
3483 {
3485  List *dictname; /* qualified name (list of Value strings) */
3486  List *options; /* List of DefElem nodes */
3488 
3489 /*
3490  * TS Configuration stmts: DefineStmt, RenameStmt and DropStmt are default
3491  */
3492 typedef enum AlterTSConfigType
3493 {
3500 
3502 {
3504  AlterTSConfigType kind; /* ALTER_TSCONFIG_ADD_MAPPING, etc */
3505  List *cfgname; /* qualified name (list of Value strings) */
3506 
3507  /*
3508  * dicts will be non-NIL if ADD/ALTER MAPPING was specified. If dicts is
3509  * NIL, but tokentype isn't, DROP MAPPING was specified.
3510  */
3511  List *tokentype; /* list of Value strings */
3512  List *dicts; /* list of list of Value strings */
3513  bool override; /* if true - remove old variant */
3514  bool replace; /* if true - replace dictionary by another */
3515  bool missing_ok; /* for DROP - skip error if missing? */
3517 
3518 
3520 {
3522  char *pubname; /* Name of the publication */
3523  List *options; /* List of DefElem nodes */
3524  List *tables; /* Optional list of tables to add */
3525  bool for_all_tables; /* Special publication for all tables in db */
3527 
3528 typedef struct AlterPublicationStmt
3529 {
3531  char *pubname; /* Name of the publication */
3532 
3533  /* parameters used for ALTER PUBLICATION ... WITH */
3534  List *options; /* List of DefElem nodes */
3535 
3536  /* parameters used for ALTER PUBLICATION ... ADD/DROP TABLE */
3537  List *tables; /* List of tables to add/drop */
3538  bool for_all_tables; /* Special publication for all tables in db */
3539  DefElemAction tableAction; /* What action to perform with the tables */
3541 
3543 {
3545  char *subname; /* Name of the subscription */
3546  char *conninfo; /* Connection string to publisher */
3547  List *publication; /* One or more publication to subscribe to */
3548  List *options; /* List of DefElem nodes */
3550 
3552 {
3559 
3561 {
3563  AlterSubscriptionType kind; /* ALTER_SUBSCRIPTION_OPTIONS, etc */
3564  char *subname; /* Name of the subscription */
3565  char *conninfo; /* Connection string to publisher */
3566  List *publication; /* One or more publication to subscribe to */
3567  List *options; /* List of DefElem nodes */
3569 
3570 typedef struct DropSubscriptionStmt
3571 {
3573  char *subname; /* Name of the subscription */
3574  bool missing_ok; /* Skip error if missing? */
3575  DropBehavior behavior; /* RESTRICT or CASCADE behavior */
3577 
3578 #endif /* PARSENODES_H */
struct CreateFdwStmt CreateFdwStmt
bool deferrable
Definition: parsenodes.h:2811
RangeVar * relation
Definition: parsenodes.h:2088
ObjectType objtype
Definition: parsenodes.h:2697
bool replace
Definition: parsenodes.h:3148
List * lockedRels
Definition: parsenodes.h:751
RoleSpec * newowner
Definition: parsenodes.h:2983
struct FetchStmt FetchStmt
signed short int16
Definition: c.h:416
List * indirection
Definition: parsenodes.h:442
Node * limitOffset
Definition: parsenodes.h:160
struct AlterDatabaseSetStmt AlterDatabaseSetStmt
List * partitionClause
Definition: parsenodes.h:490
SortByDir
Definition: parsenodes.h:50
char * refname
Definition: parsenodes.h:1357
List * params
Definition: parsenodes.h:3223
NodeTag type
Definition: parsenodes.h:3030
Node * whereClause
Definition: parsenodes.h:2035
struct SelectStmt * larg
Definition: parsenodes.h:1635
bool primary
Definition: parsenodes.h:2809
LimitOption limitOption
Definition: parsenodes.h:1626
bool copiedOrder
Definition: parsenodes.h:1369
OnCommitAction oncommit
Definition: parsenodes.h:2097
TypeName * sourcetype
Definition: parsenodes.h:3401
ConstrType
Definition: parsenodes.h:2134
RoleSpec * role
Definition: parsenodes.h:2534
NodeTag type
Definition: parsenodes.h:3464
List * fromClause
Definition: parsenodes.h:1566
struct DropTableSpaceStmt DropTableSpaceStmt
struct ViewStmt ViewStmt
List * inhRelations
Definition: parsenodes.h:2090
NodeTag type
Definition: parsenodes.h:3372
bool nowait
Definition: parsenodes.h:3343
struct CreateSchemaStmt CreateSchemaStmt
Alias * alias
Definition: parsenodes.h:568
Oid typeOid
Definition: parsenodes.h:211
ObjectType objtype
Definition: parsenodes.h:2709
List * keys
Definition: parsenodes.h:2183
struct CreateForeignTableStmt CreateForeignTableStmt
NodeTag type
Definition: parsenodes.h:2684
NodeTag type
Definition: parsenodes.h:3144
List * exclusions
Definition: parsenodes.h:2189
struct TableLikeClause TableLikeClause
ObjectWithArgs * tosql
Definition: parsenodes.h:3419
List * joinaliasvars
Definition: parsenodes.h:1056
Node * val
Definition: parsenodes.h:443
SortByDir ordering
Definition: parsenodes.h:707
Node * subquery
Definition: parsenodes.h:543
NodeTag type
Definition: parsenodes.h:2897
int stmt_location
Definition: parsenodes.h:181
Node * object
Definition: parsenodes.h:2710
char generated_when
Definition: parsenodes.h:2180
NodeTag type
Definition: parsenodes.h:2670
List * sortClause
Definition: parsenodes.h:158
struct CreateExtensionStmt CreateExtensionStmt
List * old_conpfeqop
Definition: parsenodes.h:2208
struct WindowDef WindowDef
struct FuncCall FuncCall
FetchDirection
Definition: parsenodes.h:2757
List * content
Definition: parsenodes.h:1332
bool inRangeNullsFirst
Definition: parsenodes.h:1367
List * names
Definition: parsenodes.h:210
IntoClause * intoClause
Definition: parsenodes.h:1601
A_Expr_Kind kind
Definition: parsenodes.h:274
struct DeclareCursorStmt DeclareCursorStmt
List * options
Definition: parsenodes.h:2799
struct CopyStmt CopyStmt
char storage
Definition: parsenodes.h:653
DropBehavior behavior
Definition: parsenodes.h:1924
VariableSetKind kind
Definition: parsenodes.h:2058
List * attlist
Definition: parsenodes.h:2029
struct VacuumStmt VacuumStmt
List * fromClause
Definition: parsenodes.h:1603
SubTransactionId oldCreateSubid
Definition: parsenodes.h:2805
char * subname
Definition: parsenodes.h:2938
SortByDir sortby_dir
Definition: parsenodes.h:471
RangeVar * relation
Definition: parsenodes.h:3251
NodeTag type
Definition: parsenodes.h:3266
Alias * alias
Definition: parsenodes.h:1119
List * partParams
Definition: parsenodes.h:796
NodeTag type
Definition: parsenodes.h:3122
FuncExpr * funcexpr
Definition: parsenodes.h:2918
NodeTag type
Definition: parsenodes.h:469
bool is_local
Definition: parsenodes.h:650
ObjectType renameType
Definition: parsenodes.h:2934
struct AlterDomainStmt AlterDomainStmt
struct CreateCastStmt CreateCastStmt
RangeVar * relation
Definition: parsenodes.h:1549
FromExpr * jointree
Definition: parsenodes.h:138
TransactionStmtKind
Definition: parsenodes.h:3059
char * name
Definition: parsenodes.h:441
struct LoadStmt LoadStmt
int frameOptions
Definition: parsenodes.h:492
OnConflictExpr * onConflict
Definition: parsenodes.h:144
NodeTag type
Definition: parsenodes.h:349
TypeName * storedtype
Definition: parsenodes.h:2636
struct A_Indices A_Indices
struct AlterExtensionContentsStmt AlterExtensionContentsStmt
struct AlterObjectSchemaStmt AlterObjectSchemaStmt
RoleStmtType
Definition: parsenodes.h:2516
char identity
Definition: parsenodes.h:656
PartitionRangeDatumKind
Definition: parsenodes.h:837
struct ColumnDef ColumnDef
struct VariableShowStmt VariableShowStmt
FuncCall * funccall
Definition: parsenodes.h:2917
char * tableSpace
Definition: parsenodes.h:2795
NodeTag type
Definition: parsenodes.h:860
struct PartitionSpec PartitionSpec
Node * limitOffset
Definition: parsenodes.h:1624
List * constraintDeps
Definition: parsenodes.h:169
struct WithCheckOption WithCheckOption
struct CompositeTypeStmt CompositeTypeStmt
char fk_matchtype
Definition: parsenodes.h:2205
List * constraints
Definition: parsenodes.h:662
Node * whenClause
Definition: parsenodes.h:2458
List * securityQuals
Definition: parsenodes.h:1130
List * withCheckOptions
Definition: parsenodes.h:172
RoleStmtType stmt_type
Definition: parsenodes.h:2526
Node * agg_filter
Definition: parsenodes.h:353
struct DropUserMappingStmt DropUserMappingStmt
Node * raw_expr
Definition: parsenodes.h:2178
struct CreateRoleStmt CreateRoleStmt
struct A_Indirection A_Indirection
struct RoleSpec RoleSpec
List * objects
Definition: parsenodes.h:2671
bool missing_ok
Definition: parsenodes.h:2674
struct DeallocateStmt DeallocateStmt
struct InferClause InferClause
struct GrantRoleStmt GrantRoleStmt
bool if_not_exists
Definition: parsenodes.h:2566
struct TypeName TypeName
List * coltypmods
Definition: parsenodes.h:1107
struct AlterRoleSetStmt AlterRoleSetStmt
List * useOp
Definition: parsenodes.h:473
bool hasAggs
Definition: parsenodes.h:125
char * name
Definition: parsenodes.h:488
struct CommonTableExpr CommonTableExpr
struct WindowClause WindowClause
struct AlterForeignServerStmt AlterForeignServerStmt
struct PartitionElem PartitionElem
ObjectType objectType
Definition: parsenodes.h:2980
List * columns
Definition: parsenodes.h:583
NodeTag type
Definition: parsenodes.h:245
int resultRelation
Definition: parsenodes.h:122
struct AccessPriv AccessPriv
bool is_vacuumcmd
Definition: parsenodes.h:3238
List * indexElems
Definition: parsenodes.h:1417
RangeVar * typevar
Definition: parsenodes.h:3090
char * defnamespace
Definition: parsenodes.h:732
struct CreateStmt CreateStmt
Index tleSortGroupRef
Definition: parsenodes.h:1262
QuerySource
Definition: parsenodes.h:40
PartitionRangeDatumKind kind
Definition: parsenodes.h:848
Node * whereClause
Definition: parsenodes.h:2800
Oid endInRangeFunc
Definition: parsenodes.h:1364
AlterTSConfigType
Definition: parsenodes.h:3492
char * provider
Definition: parsenodes.h:2711
bool grant_option
Definition: parsenodes.h:1951
List * indirection
Definition: parsenodes.h:1690
CoercionForm funcformat
Definition: parsenodes.h:359
List * groupingSets
Definition: parsenodes.h:150
DefElemAction defaction
Definition: parsenodes.h:735
NodeTag type
Definition: parsenodes.h:235
Definition: nodes.h:528
struct RangeTableSample RangeTableSample
NodeTag type
Definition: parsenodes.h:3041
struct RenameStmt RenameStmt
NodeTag type
Definition: parsenodes.h:3235
bool initdeferred
Definition: parsenodes.h:2173
char * filename
Definition: parsenodes.h:3160
AlterTableType subtype
Definition: parsenodes.h:1889
List * actions
Definition: parsenodes.h:3020
List * granted_roles
Definition: parsenodes.h:1996
char * comment
Definition: parsenodes.h:2699
SelectStmt * val
Definition: parsenodes.h:1692
List * targetList
Definition: parsenodes.h:1564
List * options
Definition: parsenodes.h:3268
RoleSpec * role
Definition: parsenodes.h:2542
List * typeName
Definition: parsenodes.h:3004
uint32 SubTransactionId
Definition: c.h:579
AclMode requiredPerms
Definition: parsenodes.h:1124
char generated
Definition: parsenodes.h:659
List * roles
Definition: parsenodes.h:2550
List * pk_attrs
Definition: parsenodes.h:2204
List * cols
Definition: parsenodes.h:1981
TypeName * typeName
Definition: parsenodes.h:764
char * conname
Definition: parsenodes.h:2171
struct AlterOpFamilyStmt AlterOpFamilyStmt
bool is_not_null
Definition: parsenodes.h:651
NodeTag type
Definition: parsenodes.h:1330
struct DropStmt DropStmt
Node * object
Definition: parsenodes.h:2698
NodeTag type
Definition: parsenodes.h:1355
bool funcordinality
Definition: parsenodes.h:1069
NodeTag type
Definition: parsenodes.h:3159
int location
Definition: parsenodes.h:360
char * newname
Definition: parsenodes.h:2940
struct SetOperationStmt SetOperationStmt
unsigned int Oid
Definition: postgres_ext.h:31
NodeTag
Definition: nodes.h:26
List * rowMarks
Definition: parsenodes.h:164
Node * utilityStmt
Definition: parsenodes.h:120
bool is_program
Definition: parsenodes.h:2032
struct CreateDomainStmt CreateDomainStmt
NodeTag type
Definition: parsenodes.h:1687
struct TransactionStmt TransactionStmt
struct PrepareStmt PrepareStmt
ReindexObjectType
Definition: parsenodes.h:3361
ObjectType objtype
Definition: parsenodes.h:3289
struct LockingClause LockingClause
List * colcollations
Definition: parsenodes.h:1108
CoercionContext
Definition: primnodes.h:456
WithClause * withClause
Definition: parsenodes.h:1538
struct RangeFunction RangeFunction
RangeVar * relation
Definition: parsenodes.h:3303
List * agg_order
Definition: parsenodes.h:352
List * values_lists
Definition: parsenodes.h:1079
ObjectType removeType
Definition: parsenodes.h:2672
bool instead
Definition: parsenodes.h:3019
OnCommitAction
Definition: primnodes.h:47
LockClauseStrength strength
Definition: parsenodes.h:1388
bool hasDistinctOn
Definition: parsenodes.h:129
RangeVar * table
Definition: parsenodes.h:2421
Node * whereClause
Definition: parsenodes.h:1565
List * options
Definition: parsenodes.h:2573
struct VacuumRelation VacuumRelation
RangeVar * view
Definition: parsenodes.h:3145
signed int int32
Definition: c.h:417
OnConflictClause * onConflictClause
Definition: parsenodes.h:1536
List * opclassopts
Definition: parsenodes.h:706
struct TruncateStmt TruncateStmt
struct CreatePLangStmt CreatePLangStmt
List * options
Definition: parsenodes.h:2192
List * windowClause
Definition: parsenodes.h:154
DropBehavior behavior
Definition: parsenodes.h:3575
JoinType
Definition: nodes.h:695
List * targetList
Definition: parsenodes.h:140
RoleSpec * newowner
Definition: parsenodes.h:1895
NodeTag type
Definition: parsenodes.h:2167
int location
Definition: parsenodes.h:299
VariableSetStmt * setstmt
Definition: parsenodes.h:3189
bool hasRecursive
Definition: parsenodes.h:130
List * indexIncludingParams
Definition: parsenodes.h:2797
int location
Definition: parsenodes.h:237
NodeTag type
Definition: parsenodes.h:1532
struct ParamRef ParamRef
int location
Definition: parsenodes.h:444
NodeTag type
Definition: parsenodes.h:2301
struct CreateEventTrigStmt CreateEventTrigStmt
GroupingSetKind kind
Definition: parsenodes.h:1331
struct SelectStmt SelectStmt
struct LockStmt LockStmt
List * constraints
Definition: parsenodes.h:2095
AlterSubscriptionType
Definition: parsenodes.h:3551
bool if_not_exists
Definition: parsenodes.h:2100
struct A_Expr A_Expr
struct ListenStmt ListenStmt
RangeVar * identitySequence
Definition: parsenodes.h:657
char * accessMethod
Definition: parsenodes.h:2099
PartitionBoundSpec * partbound
Definition: parsenodes.h:2092
Node * cooked_default
Definition: parsenodes.h:655
struct AlterEventTrigStmt AlterEventTrigStmt
NodeTag type
Definition: parsenodes.h:1995
WithClause * withClause
Definition: parsenodes.h:1553
struct RuleStmt RuleStmt
RangeVar * constrrel
Definition: parsenodes.h:2464
Node * query
Definition: parsenodes.h:3267
NodeTag type
Definition: parsenodes.h:3442
Oid indexOid
Definition: parsenodes.h:2803
struct ClusterStmt ClusterStmt
Node * expr
Definition: parsenodes.h:702
char * newValNeighbor
Definition: parsenodes.h:3126
struct DropOwnedStmt DropOwnedStmt
uint32 AclMode
Definition: parsenodes.h:72
struct CreatedbStmt CreatedbStmt
RangeVar * relation
Definition: parsenodes.h:2793
DropBehavior behavior
Definition: parsenodes.h:2687
struct ColumnRef ColumnRef
Bitmapset * extraUpdatedCols
Definition: parsenodes.h:1129
bool is_slice
Definition: parsenodes.h:383
List * distinctClause
Definition: parsenodes.h:1599
Bitmapset * selectedCols
Definition: parsenodes.h:1126
RoleSpec * authrole
Definition: parsenodes.h:1783
List * returningList
Definition: parsenodes.h:1552
Node * startOffset
Definition: parsenodes.h:493
char * indexname
Definition: parsenodes.h:3222
NodeTag type
Definition: parsenodes.h:2433
NodeTag type
Definition: parsenodes.h:307
struct AlterTSConfigurationStmt AlterTSConfigurationStmt
SetOperation
Definition: parsenodes.h:1584
AlterTableType
Definition: parsenodes.h:1807