PostgreSQL Source Code  git master
parse_expr.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * parse_expr.c
4  * handle expressions in parser
5  *
6  * Portions Copyright (c) 1996-2021, PostgreSQL Global Development Group
7  * Portions Copyright (c) 1994, Regents of the University of California
8  *
9  *
10  * IDENTIFICATION
11  * src/backend/parser/parse_expr.c
12  *
13  *-------------------------------------------------------------------------
14  */
15 
16 #include "postgres.h"
17 
18 #include "catalog/pg_type.h"
19 #include "commands/dbcommands.h"
20 #include "miscadmin.h"
21 #include "nodes/makefuncs.h"
22 #include "nodes/nodeFuncs.h"
23 #include "optimizer/optimizer.h"
24 #include "parser/analyze.h"
25 #include "parser/parse_agg.h"
26 #include "parser/parse_clause.h"
27 #include "parser/parse_coerce.h"
28 #include "parser/parse_collate.h"
29 #include "parser/parse_expr.h"
30 #include "parser/parse_func.h"
31 #include "parser/parse_oper.h"
32 #include "parser/parse_relation.h"
33 #include "parser/parse_target.h"
34 #include "parser/parse_type.h"
35 #include "utils/builtins.h"
36 #include "utils/date.h"
37 #include "utils/lsyscache.h"
38 #include "utils/timestamp.h"
39 #include "utils/xml.h"
40 
41 /* GUC parameters */
42 bool Transform_null_equals = false;
43 
44 
45 static Node *transformExprRecurse(ParseState *pstate, Node *expr);
46 static Node *transformParamRef(ParseState *pstate, ParamRef *pref);
47 static Node *transformAExprOp(ParseState *pstate, A_Expr *a);
48 static Node *transformAExprOpAny(ParseState *pstate, A_Expr *a);
49 static Node *transformAExprOpAll(ParseState *pstate, A_Expr *a);
50 static Node *transformAExprDistinct(ParseState *pstate, A_Expr *a);
51 static Node *transformAExprNullIf(ParseState *pstate, A_Expr *a);
52 static Node *transformAExprIn(ParseState *pstate, A_Expr *a);
53 static Node *transformAExprBetween(ParseState *pstate, A_Expr *a);
54 static Node *transformBoolExpr(ParseState *pstate, BoolExpr *a);
55 static Node *transformFuncCall(ParseState *pstate, FuncCall *fn);
56 static Node *transformMultiAssignRef(ParseState *pstate, MultiAssignRef *maref);
57 static Node *transformCaseExpr(ParseState *pstate, CaseExpr *c);
58 static Node *transformSubLink(ParseState *pstate, SubLink *sublink);
59 static Node *transformArrayExpr(ParseState *pstate, A_ArrayExpr *a,
60  Oid array_type, Oid element_type, int32 typmod);
61 static Node *transformRowExpr(ParseState *pstate, RowExpr *r, bool allowDefault);
62 static Node *transformCoalesceExpr(ParseState *pstate, CoalesceExpr *c);
63 static Node *transformMinMaxExpr(ParseState *pstate, MinMaxExpr *m);
64 static Node *transformSQLValueFunction(ParseState *pstate,
65  SQLValueFunction *svf);
66 static Node *transformXmlExpr(ParseState *pstate, XmlExpr *x);
67 static Node *transformXmlSerialize(ParseState *pstate, XmlSerialize *xs);
68 static Node *transformBooleanTest(ParseState *pstate, BooleanTest *b);
69 static Node *transformCurrentOfExpr(ParseState *pstate, CurrentOfExpr *cexpr);
70 static Node *transformColumnRef(ParseState *pstate, ColumnRef *cref);
71 static Node *transformWholeRowRef(ParseState *pstate,
72  ParseNamespaceItem *nsitem,
73  int sublevels_up, int location);
74 static Node *transformIndirection(ParseState *pstate, A_Indirection *ind);
75 static Node *transformTypeCast(ParseState *pstate, TypeCast *tc);
76 static Node *transformCollateClause(ParseState *pstate, CollateClause *c);
77 static Node *make_row_comparison_op(ParseState *pstate, List *opname,
78  List *largs, List *rargs, int location);
79 static Node *make_row_distinct_op(ParseState *pstate, List *opname,
80  RowExpr *lrow, RowExpr *rrow, int location);
81 static Expr *make_distinct_op(ParseState *pstate, List *opname,
82  Node *ltree, Node *rtree, int location);
83 static Node *make_nulltest_from_distinct(ParseState *pstate,
84  A_Expr *distincta, Node *arg);
85 
86 
87 /*
88  * transformExpr -
89  * Analyze and transform expressions. Type checking and type casting is
90  * done here. This processing converts the raw grammar output into
91  * expression trees with fully determined semantics.
92  */
93 Node *
94 transformExpr(ParseState *pstate, Node *expr, ParseExprKind exprKind)
95 {
96  Node *result;
97  ParseExprKind sv_expr_kind;
98 
99  /* Save and restore identity of expression type we're parsing */
100  Assert(exprKind != EXPR_KIND_NONE);
101  sv_expr_kind = pstate->p_expr_kind;
102  pstate->p_expr_kind = exprKind;
103 
104  result = transformExprRecurse(pstate, expr);
105 
106  pstate->p_expr_kind = sv_expr_kind;
107 
108  return result;
109 }
110 
111 static Node *
112 transformExprRecurse(ParseState *pstate, Node *expr)
113 {
114  Node *result;
115 
116  if (expr == NULL)
117  return NULL;
118 
119  /* Guard against stack overflow due to overly complex expressions */
120  check_stack_depth();
121 
122  switch (nodeTag(expr))
123  {
124  case T_ColumnRef:
125  result = transformColumnRef(pstate, (ColumnRef *) expr);
126  break;
127 
128  case T_ParamRef:
129  result = transformParamRef(pstate, (ParamRef *) expr);
130  break;
131 
132  case T_A_Const:
133  {
134  A_Const *con = (A_Const *) expr;
135  Value *val = &con->val;
136 
137  result = (Node *) make_const(pstate, val, con->location);
138  break;
139  }
140 
141  case T_A_Indirection:
142  result = transformIndirection(pstate, (A_Indirection *) expr);
143  break;
144 
145  case T_A_ArrayExpr:
146  result = transformArrayExpr(pstate, (A_ArrayExpr *) expr,
147  InvalidOid, InvalidOid, -1);
148  break;
149 
150  case T_TypeCast:
151  result = transformTypeCast(pstate, (TypeCast *) expr);
152  break;
153 
154  case T_CollateClause:
155  result = transformCollateClause(pstate, (CollateClause *) expr);
156  break;
157 
158  case T_A_Expr:
159  {
160  A_Expr *a = (A_Expr *) expr;
161 
162  switch (a->kind)
163  {
164  case AEXPR_OP:
165  result = transformAExprOp(pstate, a);
166  break;
167  case AEXPR_OP_ANY:
168  result = transformAExprOpAny(pstate, a);
169  break;
170  case AEXPR_OP_ALL:
171  result = transformAExprOpAll(pstate, a);
172  break;
173  case AEXPR_DISTINCT:
174  case AEXPR_NOT_DISTINCT:
175  result = transformAExprDistinct(pstate, a);
176  break;
177  case AEXPR_NULLIF:
178  result = transformAExprNullIf(pstate, a);
179  break;
180  case AEXPR_IN:
181  result = transformAExprIn(pstate, a);
182  break;
183  case AEXPR_LIKE:
184  case AEXPR_ILIKE:
185  case AEXPR_SIMILAR:
186  /* we can transform these just like AEXPR_OP */
187  result = transformAExprOp(pstate, a);
188  break;
189  case AEXPR_BETWEEN:
190  case AEXPR_NOT_BETWEEN:
191  case AEXPR_BETWEEN_SYM:
192  case AEXPR_NOT_BETWEEN_SYM:
193  result = transformAExprBetween(pstate, a);
194  break;
195  default:
196  elog(ERROR, "unrecognized A_Expr kind: %d", a->kind);
197  result = NULL; /* keep compiler quiet */
198  break;
199  }
200  break;
201  }
202 
203  case T_BoolExpr:
204  result = transformBoolExpr(pstate, (BoolExpr *) expr);
205  break;
206 
207  case T_FuncCall:
208  result = transformFuncCall(pstate, (FuncCall *) expr);
209  break;
210 
211  case T_MultiAssignRef:
212  result = transformMultiAssignRef(pstate, (MultiAssignRef *) expr);
213  break;
214 
215  case T_GroupingFunc:
216  result = transformGroupingFunc(pstate, (GroupingFunc *) expr);
217  break;
218 
219  case T_NamedArgExpr:
220  {
221  NamedArgExpr *na = (NamedArgExpr *) expr;
222 
223  na->arg = (Expr *) transformExprRecurse(pstate, (Node *) na->arg);
224  result = expr;
225  break;
226  }
227 
228  case T_SubLink:
229  result = transformSubLink(pstate, (SubLink *) expr);
230  break;
231 
232  case T_CaseExpr:
233  result = transformCaseExpr(pstate, (CaseExpr *) expr);
234  break;
235 
236  case T_RowExpr:
237  result = transformRowExpr(pstate, (RowExpr *) expr, false);
238  break;
239 
240  case T_CoalesceExpr:
241  result = transformCoalesceExpr(pstate, (CoalesceExpr *) expr);
242  break;
243 
244  case T_MinMaxExpr:
245  result = transformMinMaxExpr(pstate, (MinMaxExpr *) expr);
246  break;
247 
248  case T_SQLValueFunction:
249  result = transformSQLValueFunction(pstate,
250  (SQLValueFunction *) expr);
251  break;
252 
253  case T_XmlExpr:
254  result = transformXmlExpr(pstate, (XmlExpr *) expr);
255  break;
256 
257  case T_XmlSerialize:
258  result = transformXmlSerialize(pstate, (XmlSerialize *) expr);
259  break;
260 
261  case T_NullTest:
262  {
263  NullTest *n = (NullTest *) expr;
264 
265  n->arg = (Expr *) transformExprRecurse(pstate, (Node *) n->arg);
266  /* the argument can be any type, so don't coerce it */
267  n->argisrow = type_is_rowtype(exprType((Node *) n->arg));
268  result = expr;
269  break;
270  }
271 
272  case T_BooleanTest:
273  result = transformBooleanTest(pstate, (BooleanTest *) expr);
274  break;
275 
276  case T_CurrentOfExpr:
277  result = transformCurrentOfExpr(pstate, (CurrentOfExpr *) expr);
278  break;
279 
280  /*
281  * In all places where DEFAULT is legal, the caller should have
282  * processed it rather than passing it to transformExpr().
283  */
284  case T_SetToDefault:
285  ereport(ERROR,
286  (errcode(ERRCODE_SYNTAX_ERROR),
287  errmsg("DEFAULT is not allowed in this context"),
288  parser_errposition(pstate,
289  ((SetToDefault *) expr)->location)));
290  break;
291 
292  /*
293  * CaseTestExpr doesn't require any processing; it is only
294  * injected into parse trees in a fully-formed state.
295  *
296  * Ordinarily we should not see a Var here, but it is convenient
297  * for transformJoinUsingClause() to create untransformed operator
298  * trees containing already-transformed Vars. The best
299  * alternative would be to deconstruct and reconstruct column
300  * references, which seems expensively pointless. So allow it.
301  */
302  case T_CaseTestExpr:
303  case T_Var:
304  {
305  result = (Node *) expr;
306  break;
307  }
308 
309  default:
310  /* should not reach here */
311  elog(ERROR, "unrecognized node type: %d", (int) nodeTag(expr));
312  result = NULL; /* keep compiler quiet */
313  break;
314  }
315 
316  return result;
317 }
318 
319 /*
320  * helper routine for delivering "column does not exist" error message
321  *
322  * (Usually we don't have to work this hard, but the general case of field
323  * selection from an arbitrary node needs it.)
324  */
325 static void
326 unknown_attribute(ParseState *pstate, Node *relref, const char *attname,
327  int location)
328 {
329  RangeTblEntry *rte;
330 
331  if (IsA(relref, Var) &&
332  ((Var *) relref)->varattno == InvalidAttrNumber)
333  {
334  /* Reference the RTE by alias not by actual table name */
335  rte = GetRTEByRangeTablePosn(pstate,
336  ((Var *) relref)->varno,
337  ((Var *) relref)->varlevelsup);
338  ereport(ERROR,
339  (errcode(ERRCODE_UNDEFINED_COLUMN),
340  errmsg("column %s.%s does not exist",
341  rte->eref->aliasname, attname),
342  parser_errposition(pstate, location)));
343  }
344  else
345  {
346  /* Have to do it by reference to the type of the expression */
347  Oid relTypeId = exprType(relref);
348 
349  if (ISCOMPLEX(relTypeId))
350  ereport(ERROR,
351  (errcode(ERRCODE_UNDEFINED_COLUMN),
352  errmsg("column \"%s\" not found in data type %s",
353  attname, format_type_be(relTypeId)),
354  parser_errposition(pstate, location)));
355  else if (relTypeId == RECORDOID)
356  ereport(ERROR,
357  (errcode(ERRCODE_UNDEFINED_COLUMN),
358  errmsg("could not identify column \"%s\" in record data type",
359  attname),
360  parser_errposition(pstate, location)));
361  else
362  ereport(ERROR,
363  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
364  errmsg("column notation .%s applied to type %s, "
365  "which is not a composite type",
366  attname, format_type_be(relTypeId)),
367  parser_errposition(pstate, location)));
368  }
369 }
370 
371 static Node *
372 transformIndirection(ParseState *pstate, A_Indirection *ind)
373 {
374  Node *last_srf = pstate->p_last_srf;
375  Node *result = transformExprRecurse(pstate, ind->arg);
376  List *subscripts = NIL;
377  int location = exprLocation(result);
378  ListCell *i;
379 
380  /*
381  * We have to split any field-selection operations apart from
382  * subscripting. Adjacent A_Indices nodes have to be treated as a single
383  * multidimensional subscript operation.
384  */
385  foreach(i, ind->indirection)
386  {
387  Node *n = lfirst(i);
388 
389  if (IsA(n, A_Indices))
390  subscripts = lappend(subscripts, n);
391  else if (IsA(n, A_Star))
392  {
393  ereport(ERROR,
394  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
395  errmsg("row expansion via \"*\" is not supported here"),
396  parser_errposition(pstate, location)));
397  }
398  else
399  {
400  Node *newresult;
401 
402  Assert(IsA(n, String));
403 
404  /* process subscripts before this field selection */
405  if (subscripts)
406  result = (Node *) transformContainerSubscripts(pstate,
407  result,
408  exprType(result),
409  exprTypmod(result),
410  subscripts,
411  false);
412  subscripts = NIL;
413 
414  newresult = ParseFuncOrColumn(pstate,
415  list_make1(n),
416  list_make1(result),
417  last_srf,
418  NULL,
419  false,
420  location);
421  if (newresult == NULL)
422  unknown_attribute(pstate, result, strVal(n), location);
423  result = newresult;
424  }
425  }
426  /* process trailing subscripts, if any */
427  if (subscripts)
428  result = (Node *) transformContainerSubscripts(pstate,
429  result,
430  exprType(result),
431  exprTypmod(result),
432  subscripts,
433  false);
434 
435  return result;
436 }
437 
438 /*
439  * Transform a ColumnRef.
440  *
441  * If you find yourself changing this code, see also ExpandColumnRefStar.
442  */
443 static Node *
444 transformColumnRef(ParseState *pstate, ColumnRef *cref)
445 {
446  Node *node = NULL;
447  char *nspname = NULL;
448  char *relname = NULL;
449  char *colname = NULL;
450  ParseNamespaceItem *nsitem;
451  int levels_up;
452  enum
453  {
454  CRERR_NO_COLUMN,
455  CRERR_NO_RTE,
456  CRERR_WRONG_DB,
457  CRERR_TOO_MANY
458  } crerr = CRERR_NO_COLUMN;
459  const char *err;
460 
461  /*
462  * Check to see if the column reference is in an invalid place within the
463  * query. We allow column references in most places, except in default
464  * expressions and partition bound expressions.
465  */
466  err = NULL;
467  switch (pstate->p_expr_kind)
468  {
469  case EXPR_KIND_NONE:
470  Assert(false); /* can't happen */
471  break;
472  case EXPR_KIND_OTHER:
473  case EXPR_KIND_JOIN_ON:
474  case EXPR_KIND_JOIN_USING:
475  case EXPR_KIND_FROM_SUBSELECT:
476  case EXPR_KIND_FROM_FUNCTION:
477  case EXPR_KIND_WHERE:
478  case EXPR_KIND_POLICY:
479  case EXPR_KIND_HAVING:
480  case EXPR_KIND_FILTER:
481  case EXPR_KIND_WINDOW_PARTITION:
482  case EXPR_KIND_WINDOW_ORDER:
483  case EXPR_KIND_WINDOW_FRAME_RANGE:
484  case EXPR_KIND_WINDOW_FRAME_ROWS:
485  case EXPR_KIND_WINDOW_FRAME_GROUPS:
486  case EXPR_KIND_SELECT_TARGET:
487  case EXPR_KIND_INSERT_TARGET:
488  case EXPR_KIND_UPDATE_SOURCE:
489  case EXPR_KIND_UPDATE_TARGET:
490  case EXPR_KIND_GROUP_BY:
491  case EXPR_KIND_ORDER_BY:
492  case EXPR_KIND_DISTINCT_ON:
493  case EXPR_KIND_LIMIT:
494  case EXPR_KIND_OFFSET:
495  case EXPR_KIND_RETURNING:
496  case EXPR_KIND_VALUES:
497  case EXPR_KIND_VALUES_SINGLE:
498  case EXPR_KIND_CHECK_CONSTRAINT:
499  case EXPR_KIND_DOMAIN_CHECK:
500  case EXPR_KIND_FUNCTION_DEFAULT:
501  case EXPR_KIND_INDEX_EXPRESSION:
502  case EXPR_KIND_INDEX_PREDICATE:
503  case EXPR_KIND_ALTER_COL_TRANSFORM:
504  case EXPR_KIND_EXECUTE_PARAMETER:
505  case EXPR_KIND_TRIGGER_WHEN:
506  case EXPR_KIND_PARTITION_EXPRESSION:
507  case EXPR_KIND_CALL_ARGUMENT:
508  case EXPR_KIND_COPY_WHERE:
509  case EXPR_KIND_GENERATED_COLUMN:
510  case EXPR_KIND_CYCLE_MARK:
511  /* okay */
512  break;
513 
514  case EXPR_KIND_COLUMN_DEFAULT:
515  err = _("cannot use column reference in DEFAULT expression");
516  break;
517  case EXPR_KIND_PARTITION_BOUND:
518  err = _("cannot use column reference in partition bound expression");
519  break;
520 
521  /*
522  * There is intentionally no default: case here, so that the
523  * compiler will warn if we add a new ParseExprKind without
524  * extending this switch. If we do see an unrecognized value at
525  * runtime, the behavior will be the same as for EXPR_KIND_OTHER,
526  * which is sane anyway.
527  */
528  }
529  if (err)
530  ereport(ERROR,
531  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
532  errmsg_internal("%s", err),
533  parser_errposition(pstate, cref->location)));
534 
535  /*
536  * Give the PreParseColumnRefHook, if any, first shot. If it returns
537  * non-null then that's all, folks.
538  */
539  if (pstate->p_pre_columnref_hook != NULL)
540  {
541  node = pstate->p_pre_columnref_hook(pstate, cref);
542  if (node != NULL)
543  return node;
544  }
545 
546  /*----------
547  * The allowed syntaxes are:
548  *
549  * A First try to resolve as unqualified column name;
550  * if no luck, try to resolve as unqualified table name (A.*).
551  * A.B A is an unqualified table name; B is either a
552  * column or function name (trying column name first).
553  * A.B.C schema A, table B, col or func name C.
554  * A.B.C.D catalog A, schema B, table C, col or func D.
555  * A.* A is an unqualified table name; means whole-row value.
556  * A.B.* whole-row value of table B in schema A.
557  * A.B.C.* whole-row value of table C in schema B in catalog A.
558  *
559  * We do not need to cope with bare "*"; that will only be accepted by
560  * the grammar at the top level of a SELECT list, and transformTargetList
561  * will take care of it before it ever gets here. Also, "A.*" etc will
562  * be expanded by transformTargetList if they appear at SELECT top level,
563  * so here we are only going to see them as function or operator inputs.
564  *
565  * Currently, if a catalog name is given then it must equal the current
566  * database name; we check it here and then discard it.
567  *----------
568  */
569  switch (list_length(cref->fields))
570  {
571  case 1:
572  {
573  Node *field1 = (Node *) linitial(cref->fields);
574 
575  Assert(IsA(field1, String));
576  colname = strVal(field1);
577 
578  /* Try to identify as an unqualified column */
579  node = colNameToVar(pstate, colname, false, cref->location);
580 
581  if (node == NULL)
582  {
583  /*
584  * Not known as a column of any range-table entry.
585  *
586  * Try to find the name as a relation. Note that only
587  * relations already entered into the rangetable will be
588  * recognized.
589  *
590  * This is a hack for backwards compatibility with
591  * PostQUEL-inspired syntax. The preferred form now is
592  * "rel.*".
593  */
594  nsitem = refnameNamespaceItem(pstate, NULL, colname,
595  cref->location,
596  &levels_up);
597  if (nsitem)
598  node = transformWholeRowRef(pstate, nsitem, levels_up,
599  cref->location);
600  }
601  break;
602  }
603  case 2:
604  {
605  Node *field1 = (Node *) linitial(cref->fields);
606  Node *field2 = (Node *) lsecond(cref->fields);
607 
608  Assert(IsA(field1, String));
609  relname = strVal(field1);
610 
611  /* Locate the referenced nsitem */
612  nsitem = refnameNamespaceItem(pstate, nspname, relname,
613  cref->location,
614  &levels_up);
615  if (nsitem == NULL)
616  {
617  crerr = CRERR_NO_RTE;
618  break;
619  }
620 
621  /* Whole-row reference? */
622  if (IsA(field2, A_Star))
623  {
624  node = transformWholeRowRef(pstate, nsitem, levels_up,
625  cref->location);
626  break;
627  }
628 
629  Assert(IsA(field2, String));
630  colname = strVal(field2);
631 
632  /* Try to identify as a column of the nsitem */
633  node = scanNSItemForColumn(pstate, nsitem, levels_up, colname,
634  cref->location);
635  if (node == NULL)
636  {
637  /* Try it as a function call on the whole row */
638  node = transformWholeRowRef(pstate, nsitem, levels_up,
639  cref->location);
640  node = ParseFuncOrColumn(pstate,
641  list_make1(makeString(colname)),
642  list_make1(node),
643  pstate->p_last_srf,
644  NULL,
645  false,
646  cref->location);
647  }
648  break;
649  }
650  case 3:
651  {
652  Node *field1 = (Node *) linitial(cref->fields);
653  Node *field2 = (Node *) lsecond(cref->fields);
654  Node *field3 = (Node *) lthird(cref->fields);
655 
656  Assert(IsA(field1, String));
657  nspname = strVal(field1);
658  Assert(IsA(field2, String));
659  relname = strVal(field2);
660 
661  /* Locate the referenced nsitem */
662  nsitem = refnameNamespaceItem(pstate, nspname, relname,
663  cref->location,
664  &levels_up);
665  if (nsitem == NULL)
666  {
667  crerr = CRERR_NO_RTE;
668  break;
669  }
670 
671  /* Whole-row reference? */
672  if (IsA(field3, A_Star))
673  {
674  node = transformWholeRowRef(pstate, nsitem, levels_up,
675  cref->location);
676  break;
677  }
678 
679  Assert(IsA(field3, String));
680  colname = strVal(field3);
681 
682  /* Try to identify as a column of the nsitem */
683  node = scanNSItemForColumn(pstate, nsitem, levels_up, colname,
684  cref->location);
685  if (node == NULL)
686  {
687  /* Try it as a function call on the whole row */
688  node = transformWholeRowRef(pstate, nsitem, levels_up,
689  cref->location);
690  node = ParseFuncOrColumn(pstate,
691  list_make1(makeString(colname)),
692  list_make1(node),
693  pstate->p_last_srf,
694  NULL,
695  false,
696  cref->location);
697  }
698  break;
699  }
700  case 4:
701  {
702  Node *field1 = (Node *) linitial(cref->fields);
703  Node *field2 = (Node *) lsecond(cref->fields);
704  Node *field3 = (Node *) lthird(cref->fields);
705  Node *field4 = (Node *) lfourth(cref->fields);
706  char *catname;
707 
708  Assert(IsA(field1, String));
709  catname = strVal(field1);
710  Assert(IsA(field2, String));
711  nspname = strVal(field2);
712  Assert(IsA(field3, String));
713  relname = strVal(field3);
714 
715  /*
716  * We check the catalog name and then ignore it.
717  */
718  if (strcmp(catname, get_database_name(MyDatabaseId)) != 0)
719  {
720  crerr = CRERR_WRONG_DB;
721  break;
722  }
723 
724  /* Locate the referenced nsitem */
725  nsitem = refnameNamespaceItem(pstate, nspname, relname,
726  cref->location,
727  &levels_up);
728  if (nsitem == NULL)
729  {
730  crerr = CRERR_NO_RTE;
731  break;
732  }
733 
734  /* Whole-row reference? */
735  if (IsA(field4, A_Star))
736  {
737  node = transformWholeRowRef(pstate, nsitem, levels_up,
738  cref->location);
739  break;
740  }
741 
742  Assert(IsA(field4, String));
743  colname = strVal(field4);
744 
745  /* Try to identify as a column of the nsitem */
746  node = scanNSItemForColumn(pstate, nsitem, levels_up, colname,
747  cref->location);
748  if (node == NULL)
749  {
750  /* Try it as a function call on the whole row */
751  node = transformWholeRowRef(pstate, nsitem, levels_up,
752  cref->location);
753  node = ParseFuncOrColumn(pstate,
754  list_make1(makeString(colname)),
755  list_make1(node),
756  pstate->p_last_srf,
757  NULL,
758  false,
759  cref->location);
760  }
761  break;
762  }
763  default:
764  crerr = CRERR_TOO_MANY; /* too many dotted names */
765  break;
766  }
767 
768  /*
769  * Now give the PostParseColumnRefHook, if any, a chance. We pass the
770  * translation-so-far so that it can throw an error if it wishes in the
771  * case that it has a conflicting interpretation of the ColumnRef. (If it
772  * just translates anyway, we'll throw an error, because we can't undo
773  * whatever effects the preceding steps may have had on the pstate.) If it
774  * returns NULL, use the standard translation, or throw a suitable error
775  * if there is none.
776  */
777  if (pstate->p_post_columnref_hook != NULL)
778  {
779  Node *hookresult;
780 
781  hookresult = pstate->p_post_columnref_hook(pstate, cref, node);
782  if (node == NULL)
783  node = hookresult;
784  else if (hookresult != NULL)
785  ereport(ERROR,
786  (errcode(ERRCODE_AMBIGUOUS_COLUMN),
787  errmsg("column reference \"%s\" is ambiguous",
788  NameListToString(cref->fields)),
789  parser_errposition(pstate, cref->location)));
790  }
791 
792  /*
793  * Throw error if no translation found.
794  */
795  if (node == NULL)
796  {
797  switch (crerr)
798  {
799  case CRERR_NO_COLUMN:
800  errorMissingColumn(pstate, relname, colname, cref->location);
801  break;
802  case CRERR_NO_RTE:
803  errorMissingRTE(pstate, makeRangeVar(nspname, relname,
804  cref->location));
805  break;
806  case CRERR_WRONG_DB:
807  ereport(ERROR,
808  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
809  errmsg("cross-database references are not implemented: %s",
810  NameListToString(cref->fields)),
811  parser_errposition(pstate, cref->location)));
812  break;
813  case CRERR_TOO_MANY:
814  ereport(ERROR,
815  (errcode(ERRCODE_SYNTAX_ERROR),
816  errmsg("improper qualified name (too many dotted names): %s",
817  NameListToString(cref->fields)),
818  parser_errposition(pstate, cref->location)));
819  break;
820  }
821  }
822 
823  return node;
824 }
825 
826 static Node *
827 transformParamRef(ParseState *pstate, ParamRef *pref)
828 {
829  Node *result;
830 
831  /*
832  * The core parser knows nothing about Params. If a hook is supplied,
833  * call it. If not, or if the hook returns NULL, throw a generic error.
834  */
835  if (pstate->p_paramref_hook != NULL)
836  result = pstate->p_paramref_hook(pstate, pref);
837  else
838  result = NULL;
839 
840  if (result == NULL)
841  ereport(ERROR,
842  (errcode(ERRCODE_UNDEFINED_PARAMETER),
843  errmsg("there is no parameter $%d", pref->number),
844  parser_errposition(pstate, pref->location)));
845 
846  return result;
847 }
848 
849 /* Test whether an a_expr is a plain NULL constant or not */
850 static bool
851 exprIsNullConstant(Node *arg)
852 {
853  if (arg && IsA(arg, A_Const))
854  {
855  A_Const *con = (A_Const *) arg;
856 
857  if (con->val.type == T_Null)
858  return true;
859  }
860  return false;
861 }
862 
863 static Node *
864 transformAExprOp(ParseState *pstate, A_Expr *a)
865 {
866  Node *lexpr = a->lexpr;
867  Node *rexpr = a->rexpr;
868  Node *result;
869 
870  /*
871  * Special-case "foo = NULL" and "NULL = foo" for compatibility with
872  * standards-broken products (like Microsoft's). Turn these into IS NULL
873  * exprs. (If either side is a CaseTestExpr, then the expression was
874  * generated internally from a CASE-WHEN expression, and
875  * transform_null_equals does not apply.)
876  */
877  if (Transform_null_equals &&
878  list_length(a->name) == 1 &&
879  strcmp(strVal(linitial(a->name)), "=") == 0 &&
880  (exprIsNullConstant(lexpr) || exprIsNullConstant(rexpr)) &&
881  (!IsA(lexpr, CaseTestExpr) && !IsA(rexpr, CaseTestExpr)))
882  {
883  NullTest *n = makeNode(NullTest);
884 
885  n->nulltesttype = IS_NULL;
886  n->location = a->location;
887 
888  if (exprIsNullConstant(lexpr))
889  n->arg = (Expr *) rexpr;
890  else
891  n->arg = (Expr *) lexpr;
892 
893  result = transformExprRecurse(pstate, (Node *) n);
894  }
895  else if (lexpr && IsA(lexpr, RowExpr) &&
896  rexpr && IsA(rexpr, SubLink) &&
897  ((SubLink *) rexpr)->subLinkType == EXPR_SUBLINK)
898  {
899  /*
900  * Convert "row op subselect" into a ROWCOMPARE sublink. Formerly the
901  * grammar did this, but now that a row construct is allowed anywhere
902  * in expressions, it's easier to do it here.
903  */
904  SubLink *s = (SubLink *) rexpr;
905 
906  s->subLinkType = ROWCOMPARE_SUBLINK;
907  s->testexpr = lexpr;
908  s->operName = a->name;
909  s->location = a->location;
910  result = transformExprRecurse(pstate, (Node *) s);
911  }
912  else if (lexpr && IsA(lexpr, RowExpr) &&
913  rexpr && IsA(rexpr, RowExpr))
914  {
915  /* ROW() op ROW() is handled specially */
916  lexpr = transformExprRecurse(pstate, lexpr);
917  rexpr = transformExprRecurse(pstate, rexpr);
918 
919  result = make_row_comparison_op(pstate,
920  a->name,
921  castNode(RowExpr, lexpr)->args,
922  castNode(RowExpr, rexpr)->args,
923  a->location);
924  }
925  else
926  {
927  /* Ordinary scalar operator */
928  Node *last_srf = pstate->p_last_srf;
929 
930  lexpr = transformExprRecurse(pstate, lexpr);
931  rexpr = transformExprRecurse(pstate, rexpr);
932 
933  result = (Node *) make_op(pstate,
934  a->name,
935  lexpr,
936  rexpr,
937  last_srf,
938  a->location);
939  }
940 
941  return result;
942 }
943 
944 static Node *
945 transformAExprOpAny(ParseState *pstate, A_Expr *a)
946 {
947  Node *lexpr = transformExprRecurse(pstate, a->lexpr);
948  Node *rexpr = transformExprRecurse(pstate, a->rexpr);
949 
950  return (Node *) make_scalar_array_op(pstate,
951  a->name,
952  true,
953  lexpr,
954  rexpr,
955  a->location);
956 }
957 
958 static Node *
959 transformAExprOpAll(ParseState *pstate, A_Expr *a)
960 {
961  Node *lexpr = transformExprRecurse(pstate, a->lexpr);
962  Node *rexpr = transformExprRecurse(pstate, a->rexpr);
963 
964  return (Node *) make_scalar_array_op(pstate,
965  a->name,
966  false,
967  lexpr,
968  rexpr,
969  a->location);
970 }
971 
972 static Node *
973 transformAExprDistinct(ParseState *pstate, A_Expr *a)
974 {
975  Node *lexpr = a->lexpr;
976  Node *rexpr = a->rexpr;
977  Node *result;
978 
979  /*
980  * If either input is an undecorated NULL literal, transform to a NullTest
981  * on the other input. That's simpler to process than a full DistinctExpr,
982  * and it avoids needing to require that the datatype have an = operator.
983  */
984  if (exprIsNullConstant(rexpr))
985  return make_nulltest_from_distinct(pstate, a, lexpr);
986  if (exprIsNullConstant(lexpr))
987  return make_nulltest_from_distinct(pstate, a, rexpr);
988 
989  lexpr = transformExprRecurse(pstate, lexpr);
990  rexpr = transformExprRecurse(pstate, rexpr);
991 
992  if (lexpr && IsA(lexpr, RowExpr) &&
993  rexpr && IsA(rexpr, RowExpr))
994  {
995  /* ROW() op ROW() is handled specially */
996  result = make_row_distinct_op(pstate, a->name,
997  (RowExpr *) lexpr,
998  (RowExpr *) rexpr,
999  a->location);
1000  }
1001  else
1002  {
1003  /* Ordinary scalar operator */
1004  result = (Node *) make_distinct_op(pstate,
1005  a->name,
1006  lexpr,
1007  rexpr,
1008  a->location);
1009  }
1010 
1011  /*
1012  * If it's NOT DISTINCT, we first build a DistinctExpr and then stick a
1013  * NOT on top.
1014  */
1015  if (a->kind == AEXPR_NOT_DISTINCT)
1016  result = (Node *) makeBoolExpr(NOT_EXPR,
1017  list_make1(result),
1018  a->location);
1019 
1020  return result;
1021 }
1022 
1023 static Node *
1024 transformAExprNullIf(ParseState *pstate, A_Expr *a)
1025 {
1026  Node *lexpr = transformExprRecurse(pstate, a->lexpr);
1027  Node *rexpr = transformExprRecurse(pstate, a->rexpr);
1028  OpExpr *result;
1029 
1030  result = (OpExpr *) make_op(pstate,
1031  a->name,
1032  lexpr,
1033  rexpr,
1034  pstate->p_last_srf,
1035  a->location);
1036 
1037  /*
1038  * The comparison operator itself should yield boolean ...
1039  */
1040  if (result->opresulttype != BOOLOID)
1041  ereport(ERROR,
1042  (errcode(ERRCODE_DATATYPE_MISMATCH),
1043  errmsg("NULLIF requires = operator to yield boolean"),
1044  parser_errposition(pstate, a->location)));
1045  if (result->opretset)
1046  ereport(ERROR,
1047  (errcode(ERRCODE_DATATYPE_MISMATCH),
1048  /* translator: %s is name of a SQL construct, eg NULLIF */
1049  errmsg("%s must not return a set", "NULLIF"),
1050  parser_errposition(pstate, a->location)));
1051 
1052  /*
1053  * ... but the NullIfExpr will yield the first operand's type.
1054  */
1055  result->opresulttype = exprType((Node *) linitial(result->args));
1056 
1057  /*
1058  * We rely on NullIfExpr and OpExpr being the same struct
1059  */
1060  NodeSetTag(result, T_NullIfExpr);
1061 
1062  return (Node *) result;
1063 }
1064 
1065 static Node *
1066 transformAExprIn(ParseState *pstate, A_Expr *a)
1067 {
1068  Node *result = NULL;
1069  Node *lexpr;
1070  List *rexprs;
1071  List *rvars;
1072  List *rnonvars;
1073  bool useOr;
1074  ListCell *l;
1075 
1076  /*
1077  * If the operator is <>, combine with AND not OR.
1078  */
1079  if (strcmp(strVal(linitial(a->name)), "<>") == 0)
1080  useOr = false;
1081  else
1082  useOr = true;
1083 
1084  /*
1085  * We try to generate a ScalarArrayOpExpr from IN/NOT IN, but this is only
1086  * possible if there is a suitable array type available. If not, we fall
1087  * back to a boolean condition tree with multiple copies of the lefthand
1088  * expression. Also, any IN-list items that contain Vars are handled as
1089  * separate boolean conditions, because that gives the planner more scope
1090  * for optimization on such clauses.
1091  *
1092  * First step: transform all the inputs, and detect whether any contain
1093  * Vars.
1094  */
1095  lexpr = transformExprRecurse(pstate, a->lexpr);
1096  rexprs = rvars = rnonvars = NIL;
1097  foreach(l, (List *) a->rexpr)
1098  {
1099  Node *rexpr = transformExprRecurse(pstate, lfirst(l));
1100 
1101  rexprs = lappend(rexprs, rexpr);
1102  if (contain_vars_of_level(rexpr, 0))
1103  rvars = lappend(rvars, rexpr);
1104  else
1105  rnonvars = lappend(rnonvars, rexpr);
1106  }
1107 
1108  /*
1109  * ScalarArrayOpExpr is only going to be useful if there's more than one
1110  * non-Var righthand item.
1111  */
1112  if (list_length(rnonvars) > 1)
1113  {
1114  List *allexprs;
1115  Oid scalar_type;
1116  Oid array_type;
1117 
1118  /*
1119  * Try to select a common type for the array elements. Note that
1120  * since the LHS' type is first in the list, it will be preferred when
1121  * there is doubt (eg, when all the RHS items are unknown literals).
1122  *
1123  * Note: use list_concat here not lcons, to avoid damaging rnonvars.
1124  */
1125  allexprs = list_concat(list_make1(lexpr), rnonvars);
1126  scalar_type = select_common_type(pstate, allexprs, NULL, NULL);
1127 
1128  /*
1129  * Do we have an array type to use? Aside from the case where there
1130  * isn't one, we don't risk using ScalarArrayOpExpr when the common
1131  * type is RECORD, because the RowExpr comparison logic below can cope
1132  * with some cases of non-identical row types.
1133  */
1134  if (OidIsValid(scalar_type) && scalar_type != RECORDOID)
1135  array_type = get_array_type(scalar_type);
1136  else
1137  array_type = InvalidOid;
1138  if (array_type != InvalidOid)
1139  {
1140  /*
1141  * OK: coerce all the right-hand non-Var inputs to the common type
1142  * and build an ArrayExpr for them.
1143  */
1144  List *aexprs;
1145  ArrayExpr *newa;
1146 
1147  aexprs = NIL;
1148  foreach(l, rnonvars)
1149  {
1150  Node *rexpr = (Node *) lfirst(l);
1151 
1152  rexpr = coerce_to_common_type(pstate, rexpr,
1153  scalar_type,
1154  "IN");
1155  aexprs = lappend(aexprs, rexpr);
1156  }
1157  newa = makeNode(ArrayExpr);
1158  newa->array_typeid = array_type;
1159  /* array_collid will be set by parse_collate.c */
1160  newa->element_typeid = scalar_type;
1161  newa->elements = aexprs;
1162  newa->multidims = false;
1163  newa->location = -1;
1164 
1165  result = (Node *) make_scalar_array_op(pstate,
1166  a->name,
1167  useOr,
1168  lexpr,
1169  (Node *) newa,
1170  a->location);
1171 
1172  /* Consider only the Vars (if any) in the loop below */
1173  rexprs = rvars;
1174  }
1175  }
1176 
1177  /*
1178  * Must do it the hard way, ie, with a boolean expression tree.
1179  */
1180  foreach(l, rexprs)
1181  {
1182  Node *rexpr = (Node *) lfirst(l);
1183  Node *cmp;
1184 
1185  if (IsA(lexpr, RowExpr) &&
1186  IsA(rexpr, RowExpr))
1187  {
1188  /* ROW() op ROW() is handled specially */
1189  cmp = make_row_comparison_op(pstate,
1190  a->name,
1191  copyObject(((RowExpr *) lexpr)->args),
1192  ((RowExpr *) rexpr)->args,
1193  a->location);
1194  }
1195  else
1196  {
1197  /* Ordinary scalar operator */
1198  cmp = (Node *) make_op(pstate,
1199  a->name,
1200  copyObject(lexpr),
1201  rexpr,
1202  pstate->p_last_srf,
1203  a->location);
1204  }
1205 
1206  cmp = coerce_to_boolean(pstate, cmp, "IN");
1207  if (result == NULL)
1208  result = cmp;
1209  else
1210  result = (Node *) makeBoolExpr(useOr ? OR_EXPR : AND_EXPR,
1211  list_make2(result, cmp),
1212  a->location);
1213  }
1214 
1215  return result;
1216 }
1217 
1218 static Node *
1219 transformAExprBetween(ParseState *pstate, A_Expr *a)
1220 {
1221  Node *aexpr;
1222  Node *bexpr;
1223  Node *cexpr;
1224  Node *result;
1225  Node *sub1;
1226  Node *sub2;
1227  List *args;
1228 
1229  /* Deconstruct A_Expr into three subexprs */
1230  aexpr = a->lexpr;
1231  args = castNode(List, a->rexpr);
1232  Assert(list_length(args) == 2);
1233  bexpr = (Node *) linitial(args);
1234  cexpr = (Node *) lsecond(args);
1235 
1236  /*
1237  * Build the equivalent comparison expression. Make copies of
1238  * multiply-referenced subexpressions for safety. (XXX this is really
1239  * wrong since it results in multiple runtime evaluations of what may be
1240  * volatile expressions ...)
1241  *
1242  * Ideally we would not use hard-wired operators here but instead use
1243  * opclasses. However, mixed data types and other issues make this
1244  * difficult:
1245  * http://archives.postgresql.org/pgsql-hackers/2008-08/msg01142.php
1246  */
1247  switch (a->kind)
1248  {
1249  case AEXPR_BETWEEN:
1250  args = list_make2(makeSimpleA_Expr(AEXPR_OP, ">=",
1251  aexpr, bexpr,
1252  a->location),
1253  makeSimpleA_Expr(AEXPR_OP, "<=",
1254  copyObject(aexpr), cexpr,
1255  a->location));
1256  result = (Node *) makeBoolExpr(AND_EXPR, args, a->location);
1257  break;
1258  case AEXPR_NOT_BETWEEN:
1259  args = list_make2(makeSimpleA_Expr(AEXPR_OP, "<",
1260  aexpr, bexpr,
1261  a->location),
1262  makeSimpleA_Expr(AEXPR_OP, ">",
1263  copyObject(aexpr), cexpr,
1264  a->location));
1265  result = (Node *) makeBoolExpr(OR_EXPR, args, a->location);
1266  break;
1267  case AEXPR_BETWEEN_SYM:
1268  args = list_make2(makeSimpleA_Expr(AEXPR_OP, ">=",
1269  aexpr, bexpr,
1270  a->location),
1271  makeSimpleA_Expr(AEXPR_OP, "<=",
1272  copyObject(aexpr), cexpr,
1273  a->location));
1274  sub1 = (Node *) makeBoolExpr(AND_EXPR, args, a->location);
1275  args = list_make2(makeSimpleA_Expr(AEXPR_OP, ">=",
1276  copyObject(aexpr), copyObject(cexpr),
1277  a->location),
1278  makeSimpleA_Expr(AEXPR_OP, "<=",
1279  copyObject(aexpr), copyObject(bexpr),
1280  a->location));
1281  sub2 = (Node *) makeBoolExpr(AND_EXPR, args, a->location);
1282  args = list_make2(sub1, sub2);
1283  result = (Node *) makeBoolExpr(OR_EXPR, args, a->location);
1284  break;
1285  case AEXPR_NOT_BETWEEN_SYM:
1286  args = list_make2(makeSimpleA_Expr(AEXPR_OP, "<",
1287  aexpr, bexpr,
1288  a->location),
1289  makeSimpleA_Expr(AEXPR_OP, ">",
1290  copyObject(aexpr), cexpr,
1291  a->location));
1292  sub1 = (Node *) makeBoolExpr(OR_EXPR, args, a->location);
1293  args = list_make2(makeSimpleA_Expr(AEXPR_OP, "<",
1294  copyObject(aexpr), copyObject(cexpr),
1295  a->location),
1296  makeSimpleA_Expr(AEXPR_OP, ">",
1297  copyObject(aexpr), copyObject(bexpr),
1298  a->location));
1299  sub2 = (Node *) makeBoolExpr(OR_EXPR, args, a->location);
1300  args = list_make2(sub1, sub2);
1301  result = (Node *) makeBoolExpr(AND_EXPR, args, a->location);
1302  break;
1303  default:
1304  elog(ERROR, "unrecognized A_Expr kind: %d", a->kind);
1305  result = NULL; /* keep compiler quiet */
1306  break;
1307  }
1308 
1309  return transformExprRecurse(pstate, result);
1310 }
1311 
1312 static Node *
1313 transformBoolExpr(ParseState *pstate, BoolExpr *a)
1314 {
1315  List *args = NIL;
1316  const char *opname;
1317  ListCell *lc;
1318 
1319  switch (a->boolop)
1320  {
1321  case AND_EXPR:
1322  opname = "AND";
1323  break;
1324  case OR_EXPR:
1325  opname = "OR";
1326  break;
1327  case NOT_EXPR:
1328  opname = "NOT";
1329  break;
1330  default:
1331  elog(ERROR, "unrecognized boolop: %d", (int) a->boolop);
1332  opname = NULL; /* keep compiler quiet */
1333  break;
1334  }
1335 
1336  foreach(lc, a->args)
1337  {
1338  Node *arg = (Node *) lfirst(lc);
1339 
1340  arg = transformExprRecurse(pstate, arg);
1341  arg = coerce_to_boolean(pstate, arg, opname);
1342  args = lappend(args, arg);
1343  }
1344 
1345  return (Node *) makeBoolExpr(a->boolop, args, a->location);
1346 }
1347 
1348 static Node *
1349 transformFuncCall(ParseState *pstate, FuncCall *fn)
1350 {
1351  Node *last_srf = pstate->p_last_srf;
1352  List *targs;
1353  ListCell *args;
1354 
1355  /* Transform the list of arguments ... */
1356  targs = NIL;
1357  foreach(args, fn->args)
1358  {
1359  targs = lappend(targs, transformExprRecurse(pstate,
1360  (Node *) lfirst(args)));
1361  }
1362 
1363  /*
1364  * When WITHIN GROUP is used, we treat its ORDER BY expressions as
1365  * additional arguments to the function, for purposes of function lookup
1366  * and argument type coercion. So, transform each such expression and add
1367  * them to the targs list. We don't explicitly mark where each argument
1368  * came from, but ParseFuncOrColumn can tell what's what by reference to
1369  * list_length(fn->agg_order).
1370  */
1371  if (fn->agg_within_group)
1372  {
1373  Assert(fn->agg_order != NIL);
1374  foreach(args, fn->agg_order)
1375  {
1376  SortBy *arg = (SortBy *) lfirst(args);
1377 
1378  targs = lappend(targs, transformExpr(pstate, arg->node,
1379  EXPR_KIND_ORDER_BY));
1380  }
1381  }
1382 
1383  /* ... and hand off to ParseFuncOrColumn */
1384  return ParseFuncOrColumn(pstate,
1385  fn->funcname,
1386  targs,
1387  last_srf,
1388  fn,
1389  false,
1390  fn->location);
1391 }
1392 
1393 static Node *
1394 transformMultiAssignRef(ParseState *pstate, MultiAssignRef *maref)
1395 {
1396  SubLink *sublink;
1397  RowExpr *rexpr;
1398  Query *qtree;
1399  TargetEntry *tle;
1400 
1401  /* We should only see this in first-stage processing of UPDATE tlists */
1402  Assert(pstate->p_expr_kind == EXPR_KIND_UPDATE_SOURCE);
1403 
1404  /* We only need to transform the source if this is the first column */
1405  if (maref->colno == 1)
1406  {
1407  /*
1408  * For now, we only allow EXPR SubLinks and RowExprs as the source of
1409  * an UPDATE multiassignment. This is sufficient to cover interesting
1410  * cases; at worst, someone would have to write (SELECT * FROM expr)
1411  * to expand a composite-returning expression of another form.
1412  */
1413  if (IsA(maref->source, SubLink) &&
1414  ((SubLink *) maref->source)->subLinkType == EXPR_SUBLINK)
1415  {
1416  /* Relabel it as a MULTIEXPR_SUBLINK */
1417  sublink = (SubLink *) maref->source;
1418  sublink->subLinkType = MULTIEXPR_SUBLINK;
1419  /* And transform it */
1420  sublink = (SubLink *) transformExprRecurse(pstate,
1421  (Node *) sublink);
1422 
1423  qtree = castNode(Query, sublink->subselect);
1424 
1425  /* Check subquery returns required number of columns */
1426  if (count_nonjunk_tlist_entries(qtree->targetList) != maref->ncolumns)
1427  ereport(ERROR,
1428  (errcode(ERRCODE_SYNTAX_ERROR),
1429  errmsg("number of columns does not match number of values"),
1430  parser_errposition(pstate, sublink->location)));
1431 
1432  /*
1433  * Build a resjunk tlist item containing the MULTIEXPR SubLink,
1434  * and add it to pstate->p_multiassign_exprs, whence it will later
1435  * get appended to the completed targetlist. We needn't worry
1436  * about selecting a resno for it; transformUpdateStmt will do
1437  * that.
1438  */
1439  tle = makeTargetEntry((Expr *) sublink, 0, NULL, true);
1440  pstate->p_multiassign_exprs = lappend(pstate->p_multiassign_exprs,
1441  tle);
1442 
1443  /*
1444  * Assign a unique-within-this-targetlist ID to the MULTIEXPR
1445  * SubLink. We can just use its position in the
1446  * p_multiassign_exprs list.
1447  */
1448  sublink->subLinkId = list_length(pstate->p_multiassign_exprs);
1449  }
1450  else if (IsA(maref->source, RowExpr))
1451  {
1452  /* Transform the RowExpr, allowing SetToDefault items */
1453  rexpr = (RowExpr *) transformRowExpr(pstate,
1454  (RowExpr *) maref->source,
1455  true);
1456 
1457  /* Check it returns required number of columns */
1458  if (list_length(rexpr->args) != maref->ncolumns)
1459  ereport(ERROR,
1460  (errcode(ERRCODE_SYNTAX_ERROR),
1461  errmsg("number of columns does not match number of values"),
1462  parser_errposition(pstate, rexpr->location)));
1463 
1464  /*
1465  * Temporarily append it to p_multiassign_exprs, so we can get it
1466  * back when we come back here for additional columns.
1467  */
1468  tle = makeTargetEntry((Expr *) rexpr, 0, NULL, true);
1469  pstate->p_multiassign_exprs = lappend(pstate->p_multiassign_exprs,
1470  tle);
1471  }
1472  else
1473  ereport(ERROR,
1474  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1475  errmsg("source for a multiple-column UPDATE item must be a sub-SELECT or ROW() expression"),
1476  parser_errposition(pstate, exprLocation(maref->source))));
1477  }
1478  else
1479  {
1480  /*
1481  * Second or later column in a multiassignment. Re-fetch the
1482  * transformed SubLink or RowExpr, which we assume is still the last
1483  * entry in p_multiassign_exprs.
1484  */
1485  Assert(pstate->p_multiassign_exprs != NIL);
1486  tle = (TargetEntry *) llast(pstate->p_multiassign_exprs);
1487  }
1488 
1489  /*
1490  * Emit the appropriate output expression for the current column
1491  */
1492  if (IsA(tle->expr, SubLink))
1493  {
1494  Param *param;
1495 
1496  sublink = (SubLink *) tle->expr;
1497  Assert(sublink->subLinkType == MULTIEXPR_SUBLINK);
1498  qtree = castNode(Query, sublink->subselect);
1499 
1500  /* Build a Param representing the current subquery output column */
1501  tle = (TargetEntry *) list_nth(qtree->targetList, maref->colno - 1);
1502  Assert(!tle->resjunk);
1503 
1504  param = makeNode(Param);
1505  param->paramkind = PARAM_MULTIEXPR;
1506  param->paramid = (sublink->subLinkId << 16) | maref->colno;
1507  param->paramtype = exprType((Node *) tle->expr);
1508  param->paramtypmod = exprTypmod((Node *) tle->expr);
1509  param->paramcollid = exprCollation((Node *) tle->expr);
1510  param->location = exprLocation((Node *) tle->expr);
1511 
1512  return (Node *) param;
1513  }
1514 
1515  if (IsA(tle->expr, RowExpr))
1516  {
1517  Node *result;
1518 
1519  rexpr = (RowExpr *) tle->expr;
1520 
1521  /* Just extract and return the next element of the RowExpr */
1522  result = (Node *) list_nth(rexpr->args, maref->colno - 1);
1523 
1524  /*
1525  * If we're at the last column, delete the RowExpr from
1526  * p_multiassign_exprs; we don't need it anymore, and don't want it in
1527  * the finished UPDATE tlist. We assume this is still the last entry
1528  * in p_multiassign_exprs.
1529  */
1530  if (maref->colno == maref->ncolumns)
1531  pstate->p_multiassign_exprs =
1532  list_delete_last(pstate->p_multiassign_exprs);
1533 
1534  return result;
1535  }
1536 
1537  elog(ERROR, "unexpected expr type in multiassign list");
1538  return NULL; /* keep compiler quiet */
1539 }
1540 
1541 static Node *
1542 transformCaseExpr(ParseState *pstate, CaseExpr *c)
1543 {
1544  CaseExpr *newc = makeNode(CaseExpr);
1545  Node *last_srf = pstate->p_last_srf;
1546  Node *arg;
1547  CaseTestExpr *placeholder;
1548  List *newargs;
1549  List *resultexprs;
1550  ListCell *l;
1551  Node *defresult;
1552  Oid ptype;
1553 
1554  /* transform the test expression, if any */
1555  arg = transformExprRecurse(pstate, (Node *) c->arg);
1556 
1557  /* generate placeholder for test expression */
1558  if (arg)
1559  {
1560  /*
1561  * If test expression is an untyped literal, force it to text. We have
1562  * to do something now because we won't be able to do this coercion on
1563  * the placeholder. This is not as flexible as what was done in 7.4
1564  * and before, but it's good enough to handle the sort of silly coding
1565  * commonly seen.
1566  */
1567  if (exprType(arg) == UNKNOWNOID)
1568  arg = coerce_to_common_type(pstate, arg, TEXTOID, "CASE");
1569 
1570  /*
1571  * Run collation assignment on the test expression so that we know
1572  * what collation to mark the placeholder with. In principle we could
1573  * leave it to parse_collate.c to do that later, but propagating the
1574  * result to the CaseTestExpr would be unnecessarily complicated.
1575  */
1576  assign_expr_collations(pstate, arg);
1577 
1578  placeholder = makeNode(CaseTestExpr);
1579  placeholder->typeId = exprType(arg);
1580  placeholder->typeMod = exprTypmod(arg);
1581  placeholder->collation = exprCollation(arg);
1582  }
1583  else
1584  placeholder = NULL;
1585 
1586  newc->arg = (Expr *) arg;
1587 
1588  /* transform the list of arguments */
1589  newargs = NIL;
1590  resultexprs = NIL;
1591  foreach(l, c->args)
1592  {
1593  CaseWhen *w = lfirst_node(CaseWhen, l);
1594  CaseWhen *neww = makeNode(CaseWhen);
1595  Node *warg;
1596 
1597  warg = (Node *) w->expr;
1598  if (placeholder)
1599  {
1600  /* shorthand form was specified, so expand... */
1601  warg = (Node *) makeSimpleA_Expr(AEXPR_OP, "=",
1602  (Node *) placeholder,
1603  warg,
1604  w->location);
1605  }
1606  neww->expr = (Expr *) transformExprRecurse(pstate, warg);
1607 
1608  neww->expr = (Expr *) coerce_to_boolean(pstate,
1609  (Node *) neww->expr,
1610  "CASE/WHEN");
1611 
1612  warg = (Node *) w->result;
1613  neww->result = (Expr *) transformExprRecurse(pstate, warg);
1614  neww->location = w->location;
1615 
1616  newargs = lappend(newargs, neww);
1617  resultexprs = lappend(resultexprs, neww->result);
1618  }
1619 
1620  newc->args = newargs;
1621 
1622  /* transform the default clause */
1623  defresult = (Node *) c->defresult;
1624  if (defresult == NULL)
1625  {
1626  A_Const *n = makeNode(A_Const);
1627 
1628  n->val.type = T_Null;
1629  n->location = -1;
1630  defresult = (Node *) n;
1631  }
1632  newc->defresult = (Expr *) transformExprRecurse(pstate, defresult);
1633 
1634  /*
1635  * Note: default result is considered the most significant type in
1636  * determining preferred type. This is how the code worked before, but it
1637  * seems a little bogus to me --- tgl
1638  */
1639  resultexprs = lcons(newc->defresult, resultexprs);
1640 
1641  ptype = select_common_type(pstate, resultexprs, "CASE", NULL);
1642  Assert(OidIsValid(ptype));
1643  newc->casetype = ptype;
1644  /* casecollid will be set by parse_collate.c */
1645 
1646  /* Convert default result clause, if necessary */
1647  newc->defresult = (Expr *)
1648  coerce_to_common_type(pstate,
1649  (Node *) newc->defresult,
1650  ptype,
1651  "CASE/ELSE");
1652 
1653  /* Convert when-clause results, if necessary */
1654  foreach(l, newc->args)
1655  {
1656  CaseWhen *w = (CaseWhen *) lfirst(l);
1657 
1658  w->result = (Expr *)
1659  coerce_to_common_type(pstate,
1660  (Node *) w->result,
1661  ptype,
1662  "CASE/WHEN");
1663  }
1664 
1665  /* if any subexpression contained a SRF, complain */
1666  if (pstate->p_last_srf != last_srf)
1667  ereport(ERROR,
1668  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1669  /* translator: %s is name of a SQL construct, eg GROUP BY */
1670  errmsg("set-returning functions are not allowed in %s",
1671  "CASE"),
1672  errhint("You might be able to move the set-returning function into a LATERAL FROM item."),
1673  parser_errposition(pstate,
1674  exprLocation(pstate->p_last_srf))));
1675 
1676  newc->location = c->location;
1677 
1678  return (Node *) newc;
1679 }
1680 
1681 static Node *
1682 transformSubLink(ParseState *pstate, SubLink *sublink)
1683 {
1684  Node *result = (Node *) sublink;
1685  Query *qtree;
1686  const char *err;
1687 
1688  /*
1689  * Check to see if the sublink is in an invalid place within the query. We
1690  * allow sublinks everywhere in SELECT/INSERT/UPDATE/DELETE, but generally
1691  * not in utility statements.
1692  */
1693  err = NULL;
1694  switch (pstate->p_expr_kind)
1695  {
1696  case EXPR_KIND_NONE:
1697  Assert(false); /* can't happen */
1698  break;
1699  case EXPR_KIND_OTHER:
1700  /* Accept sublink here; caller must throw error if wanted */
1701  break;
1702  case EXPR_KIND_JOIN_ON:
1703  case EXPR_KIND_JOIN_USING:
1704  case EXPR_KIND_FROM_SUBSELECT:
1705  case EXPR_KIND_FROM_FUNCTION:
1706  case EXPR_KIND_WHERE:
1707  case EXPR_KIND_POLICY:
1708  case EXPR_KIND_HAVING:
1709  case EXPR_KIND_FILTER:
1710  case EXPR_KIND_WINDOW_PARTITION:
1711  case EXPR_KIND_WINDOW_ORDER:
1712  case EXPR_KIND_WINDOW_FRAME_RANGE:
1713  case EXPR_KIND_WINDOW_FRAME_ROWS:
1714  case EXPR_KIND_WINDOW_FRAME_GROUPS:
1715  case EXPR_KIND_SELECT_TARGET:
1716  case EXPR_KIND_INSERT_TARGET:
1717  case EXPR_KIND_UPDATE_SOURCE:
1718  case EXPR_KIND_UPDATE_TARGET:
1719  case EXPR_KIND_GROUP_BY:
1720  case EXPR_KIND_ORDER_BY:
1721  case EXPR_KIND_DISTINCT_ON:
1722  case EXPR_KIND_LIMIT:
1723  case EXPR_KIND_OFFSET:
1724  case EXPR_KIND_RETURNING:
1725  case EXPR_KIND_VALUES:
1726  case EXPR_KIND_VALUES_SINGLE:
1727  case EXPR_KIND_CYCLE_MARK:
1728  /* okay */
1729  break;
1730  case EXPR_KIND_CHECK_CONSTRAINT:
1731  case EXPR_KIND_DOMAIN_CHECK:
1732  err = _("cannot use subquery in check constraint");
1733  break;
1734  case EXPR_KIND_COLUMN_DEFAULT:
1735  case EXPR_KIND_FUNCTION_DEFAULT:
1736  err = _("cannot use subquery in DEFAULT expression");
1737  break;
1738  case EXPR_KIND_INDEX_EXPRESSION:
1739  err = _("cannot use subquery in index expression");
1740  break;
1741  case EXPR_KIND_INDEX_PREDICATE:
1742  err = _("cannot use subquery in index predicate");
1743  break;
1744  case EXPR_KIND_ALTER_COL_TRANSFORM:
1745  err = _("cannot use subquery in transform expression");
1746  break;
1747  case EXPR_KIND_EXECUTE_PARAMETER:
1748  err = _("cannot use subquery in EXECUTE parameter");
1749  break;
1750  case EXPR_KIND_TRIGGER_WHEN:
1751  err = _("cannot use subquery in trigger WHEN condition");
1752  break;
1753  case EXPR_KIND_PARTITION_BOUND:
1754  err = _("cannot use subquery in partition bound");
1755  break;
1756  case EXPR_KIND_PARTITION_EXPRESSION:
1757  err = _("cannot use subquery in partition key expression");
1758  break;
1759  case EXPR_KIND_CALL_ARGUMENT:
1760  err = _("cannot use subquery in CALL argument");
1761  break;
1762  case EXPR_KIND_COPY_WHERE:
1763  err = _("cannot use subquery in COPY FROM WHERE condition");
1764  break;
1765  case EXPR_KIND_GENERATED_COLUMN:
1766  err = _("cannot use subquery in column generation expression");
1767  break;
1768 
1769  /*
1770  * There is intentionally no default: case here, so that the
1771  * compiler will warn if we add a new ParseExprKind without
1772  * extending this switch. If we do see an unrecognized value at
1773  * runtime, the behavior will be the same as for EXPR_KIND_OTHER,
1774  * which is sane anyway.
1775  */
1776  }
1777  if (err)
1778  ereport(ERROR,
1779  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1780  errmsg_internal("%s", err),
1781  parser_errposition(pstate, sublink->location)));
1782 
1783  pstate->p_hasSubLinks = true;
1784 
1785  /*
1786  * OK, let's transform the sub-SELECT.
1787  */
1788  qtree = parse_sub_analyze(sublink->subselect, pstate, NULL, false, true);
1789 
1790  /*
1791  * Check that we got a SELECT. Anything else should be impossible given
1792  * restrictions of the grammar, but check anyway.
1793  */
1794  if (!IsA(qtree, Query) ||
1795  qtree->commandType != CMD_SELECT)
1796  elog(ERROR, "unexpected non-SELECT command in SubLink");
1797 
1798  sublink->subselect = (Node *) qtree;
1799 
1800  if (sublink->subLinkType == EXISTS_SUBLINK)
1801  {
1802  /*
1803  * EXISTS needs no test expression or combining operator. These fields
1804  * should be null already, but make sure.
1805  */
1806  sublink->testexpr = NULL;
1807  sublink->operName = NIL;
1808  }
1809  else if (sublink->subLinkType == EXPR_SUBLINK ||
1810  sublink->subLinkType == ARRAY_SUBLINK)
1811  {
1812  /*
1813  * Make sure the subselect delivers a single column (ignoring resjunk
1814  * targets).
1815  */
1816  if (count_nonjunk_tlist_entries(qtree->targetList) != 1)
1817  ereport(ERROR,
1818  (errcode(ERRCODE_SYNTAX_ERROR),
1819  errmsg("subquery must return only one column"),
1820  parser_errposition(pstate, sublink->location)));
1821 
1822  /*
1823  * EXPR and ARRAY need no test expression or combining operator. These
1824  * fields should be null already, but make sure.
1825  */
1826  sublink->testexpr = NULL;
1827  sublink->operName = NIL;
1828  }
1829  else if (sublink->subLinkType == MULTIEXPR_SUBLINK)
1830  {
1831  /* Same as EXPR case, except no restriction on number of columns */
1832  sublink->testexpr = NULL;
1833  sublink->operName = NIL;
1834  }
1835  else
1836  {
1837  /* ALL, ANY, or ROWCOMPARE: generate row-comparing expression */
1838  Node *lefthand;
1839  List *left_list;
1840  List *right_list;
1841  ListCell *l;
1842 
1843  /*
1844  * If the source was "x IN (select)", convert to "x = ANY (select)".
1845  */
1846  if (sublink->operName == NIL)
1847  sublink->operName = list_make1(makeString("="));
1848 
1849  /*
1850  * Transform lefthand expression, and convert to a list
1851  */
1852  lefthand = transformExprRecurse(pstate, sublink->testexpr);
1853  if (lefthand && IsA(lefthand, RowExpr))
1854  left_list = ((RowExpr *) lefthand)->args;
1855  else
1856  left_list = list_make1(lefthand);
1857 
1858  /*
1859  * Build a list of PARAM_SUBLINK nodes representing the output columns
1860  * of the subquery.
1861  */
1862  right_list = NIL;
1863  foreach(l, qtree->targetList)
1864  {
1865  TargetEntry *tent = (TargetEntry *) lfirst(l);
1866  Param *param;
1867 
1868  if (tent->resjunk)
1869  continue;
1870 
1871  param = makeNode(Param);
1872  param->paramkind = PARAM_SUBLINK;
1873  param->paramid = tent->resno;
1874  param->paramtype = exprType((Node *) tent->expr);
1875  param->paramtypmod = exprTypmod((Node *) tent->expr);
1876  param->paramcollid = exprCollation((Node *) tent->expr);
1877  param->location = -1;
1878 
1879  right_list = lappend(right_list, param);
1880  }
1881 
1882  /*
1883  * We could rely on make_row_comparison_op to complain if the list
1884  * lengths differ, but we prefer to generate a more specific error
1885  * message.
1886  */
1887  if (list_length(left_list) < list_length(right_list))
1888  ereport(ERROR,
1889  (errcode(ERRCODE_SYNTAX_ERROR),
1890  errmsg("subquery has too many columns"),
1891  parser_errposition(pstate, sublink->location)));
1892  if (list_length(left_list) > list_length(right_list))
1893  ereport(ERROR,
1894  (errcode(ERRCODE_SYNTAX_ERROR),
1895  errmsg("subquery has too few columns"),
1896  parser_errposition(pstate, sublink->location)));
1897 
1898  /*
1899  * Identify the combining operator(s) and generate a suitable
1900  * row-comparison expression.
1901  */
1902  sublink->testexpr = make_row_comparison_op(pstate,
1903  sublink->operName,
1904  left_list,
1905  right_list,
1906  sublink->location);
1907  }
1908 
1909  return result;
1910 }
1911 
1912 /*
1913  * transformArrayExpr
1914  *
1915  * If the caller specifies the target type, the resulting array will
1916  * be of exactly that type. Otherwise we try to infer a common type
1917  * for the elements using select_common_type().
1918  */
1919 static Node *
1920 transformArrayExpr(ParseState *pstate, A_ArrayExpr *a,
1921  Oid array_type, Oid element_type, int32 typmod)
1922 {
1923  ArrayExpr *newa = makeNode(ArrayExpr);
1924  List *newelems = NIL;
1925  List *newcoercedelems = NIL;
1926  ListCell *element;
1927  Oid coerce_type;
1928  bool coerce_hard;
1929 
1930  /*
1931  * Transform the element expressions
1932  *
1933  * Assume that the array is one-dimensional unless we find an array-type
1934  * element expression.
1935  */
1936  newa->multidims = false;
1937  foreach(element, a->elements)
1938  {
1939  Node *e = (Node *) lfirst(element);
1940  Node *newe;
1941 
1942  /*
1943  * If an element is itself an A_ArrayExpr, recurse directly so that we
1944  * can pass down any target type we were given.
1945  */
1946  if (IsA(e, A_ArrayExpr))
1947  {
1948  newe = transformArrayExpr(pstate,
1949  (A_ArrayExpr *) e,
1950  array_type,
1951  element_type,
1952  typmod);
1953  /* we certainly have an array here */
1954  Assert(array_type == InvalidOid || array_type == exprType(newe));
1955  newa->multidims = true;
1956  }
1957  else
1958  {
1959  newe = transformExprRecurse(pstate, e);
1960 
1961  /*
1962  * Check for sub-array expressions, if we haven't already found
1963  * one.
1964  */
1965  if (!newa->multidims && type_is_array(exprType(newe)))
1966  newa->multidims = true;
1967  }
1968 
1969  newelems = lappend(newelems, newe);
1970  }
1971 
1972  /*
1973  * Select a target type for the elements.
1974  *
1975  * If we haven't been given a target array type, we must try to deduce a
1976  * common type based on the types of the individual elements present.
1977  */
1978  if (OidIsValid(array_type))
1979  {
1980  /* Caller must ensure array_type matches element_type */
1981  Assert(OidIsValid(element_type));
1982  coerce_type = (newa->multidims ? array_type : element_type);
1983  coerce_hard = true;
1984  }
1985  else
1986  {
1987  /* Can't handle an empty array without a target type */
1988  if (newelems == NIL)
1989  ereport(ERROR,
1990  (errcode(ERRCODE_INDETERMINATE_DATATYPE),
1991  errmsg("cannot determine type of empty array"),
1992  errhint("Explicitly cast to the desired type, "
1993  "for example ARRAY[]::integer[]."),
1994  parser_errposition(pstate, a->location)));
1995 
1996  /* Select a common type for the elements */
1997  coerce_type = select_common_type(pstate, newelems, "ARRAY", NULL);
1998 
1999  if (newa->multidims)
2000  {
2001  array_type = coerce_type;
2002  element_type = get_element_type(array_type);
2003  if (!OidIsValid(element_type))
2004  ereport(ERROR,
2005  (errcode(ERRCODE_UNDEFINED_OBJECT),
2006  errmsg("could not find element type for data type %s",
2007  format_type_be(array_type)),
2008  parser_errposition(pstate, a->location)));
2009  }
2010  else
2011  {
2012  element_type = coerce_type;
2013  array_type = get_array_type(element_type);
2014  if (!OidIsValid(array_type))
2015  ereport(ERROR,
2016  (errcode(ERRCODE_UNDEFINED_OBJECT),
2017  errmsg("could not find array type for data type %s",
2018  format_type_be(element_type)),
2019  parser_errposition(pstate, a->location)));
2020  }
2021  coerce_hard = false;
2022  }
2023 
2024  /*
2025  * Coerce elements to target type
2026  *
2027  * If the array has been explicitly cast, then the elements are in turn
2028  * explicitly coerced.
2029  *
2030  * If the array's type was merely derived from the common type of its
2031  * elements, then the elements are implicitly coerced to the common type.
2032  * This is consistent with other uses of select_common_type().
2033  */
2034  foreach(element, newelems)
2035  {
2036  Node *e = (Node *) lfirst(element);
2037  Node *newe;
2038 
2039  if (coerce_hard)
2040  {
2041  newe = coerce_to_target_type(pstate, e,
2042  exprType(e),
2043  coerce_type,
2044  typmod,
2045  COERCION_EXPLICIT,
2046  COERCE_EXPLICIT_CAST,
2047  -1);
2048  if (newe == NULL)
2049  ereport(ERROR,
2050  (errcode(ERRCODE_CANNOT_COERCE),
2051  errmsg("cannot cast type %s to %s",
2052  format_type_be(exprType(e)),
2053  format_type_be(coerce_type)),
2054  parser_errposition(pstate, exprLocation(e))));
2055  }
2056  else
2057  newe = coerce_to_common_type(pstate, e,
2058  coerce_type,
2059  "ARRAY");
2060  newcoercedelems = lappend(newcoercedelems, newe);
2061  }
2062 
2063  newa->array_typeid = array_type;
2064  /* array_collid will be set by parse_collate.c */
2065  newa->element_typeid = element_type;
2066  newa->elements = newcoercedelems;
2067  newa->location = a->location;
2068 
2069  return (Node *) newa;
2070 }
2071 
2072 static Node *
2073 transformRowExpr(ParseState *pstate, RowExpr *r, bool allowDefault)
2074 {
2075  RowExpr *newr;
2076  char fname[16];
2077  int fnum;
2078 
2079  newr = makeNode(RowExpr);
2080 
2081  /* Transform the field expressions */
2082  newr->args = transformExpressionList(pstate, r->args,
2083  pstate->p_expr_kind, allowDefault);
2084 
2085  /* Barring later casting, we consider the type RECORD */
2086  newr->row_typeid = RECORDOID;
2087  newr->row_format = COERCE_IMPLICIT_CAST;
2088 
2089  /* ROW() has anonymous columns, so invent some field names */
2090  newr->colnames = NIL;
2091  for (fnum = 1; fnum <= list_length(newr->args); fnum++)
2092  {
2093  snprintf(fname, sizeof(fname), "f%d", fnum);
2094  newr->colnames = lappend(newr->colnames, makeString(pstrdup(fname)));
2095  }
2096 
2097  newr->location = r->location;
2098 
2099  return (Node *) newr;
2100 }
2101 
2102 static Node *
2103 transformCoalesceExpr(ParseState *pstate, CoalesceExpr *c)
2104 {
2105  CoalesceExpr *newc = makeNode(CoalesceExpr);
2106  Node *last_srf = pstate->p_last_srf;
2107  List *newargs = NIL;
2108  List *newcoercedargs = NIL;
2109  ListCell *args;
2110 
2111  foreach(args, c->args)
2112  {
2113  Node *e = (Node *) lfirst(args);
2114  Node *newe;
2115 
2116  newe = transformExprRecurse(pstate, e);
2117  newargs = lappend(newargs, newe);
2118  }
2119 
2120  newc->coalescetype = select_common_type(pstate, newargs, "COALESCE", NULL);
2121  /* coalescecollid will be set by parse_collate.c */
2122 
2123  /* Convert arguments if necessary */
2124  foreach(args, newargs)
2125  {
2126  Node *e = (Node *) lfirst(args);
2127  Node *newe;
2128 
2129  newe = coerce_to_common_type(pstate, e,
2130  newc->coalescetype,
2131  "COALESCE");
2132  newcoercedargs = lappend(newcoercedargs, newe);
2133  }
2134 
2135  /* if any subexpression contained a SRF, complain */
2136  if (pstate->p_last_srf != last_srf)
2137  ereport(ERROR,
2138  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2139  /* translator: %s is name of a SQL construct, eg GROUP BY */
2140  errmsg("set-returning functions are not allowed in %s",
2141  "COALESCE"),
2142  errhint("You might be able to move the set-returning function into a LATERAL FROM item."),
2143  parser_errposition(pstate,
2144  exprLocation(pstate->p_last_srf))));
2145 
2146  newc->args = newcoercedargs;
2147  newc->location = c->location;
2148  return (Node *) newc;
2149 }
2150 
2151 static Node *
2152 transformMinMaxExpr(ParseState *pstate, MinMaxExpr *m)
2153 {
2154  MinMaxExpr *newm = makeNode(MinMaxExpr);
2155  List *newargs = NIL;
2156  List *newcoercedargs = NIL;
2157  const char *funcname = (m->op == IS_GREATEST) ? "GREATEST" : "LEAST";
2158  ListCell *args;
2159 
2160  newm->op = m->op;
2161  foreach(args, m->args)
2162  {
2163  Node *e = (Node *) lfirst(args);
2164  Node *newe;
2165 
2166  newe = transformExprRecurse(pstate, e);
2167  newargs = lappend(newargs, newe);
2168  }
2169 
2170  newm->minmaxtype = select_common_type(pstate, newargs, funcname, NULL);
2171  /* minmaxcollid and inputcollid will be set by parse_collate.c */
2172 
2173  /* Convert arguments if necessary */
2174  foreach(args, newargs)
2175  {
2176  Node *e = (Node *) lfirst(args);
2177  Node *newe;
2178 
2179  newe = coerce_to_common_type(pstate, e,
2180  newm->minmaxtype,
2181  funcname);
2182  newcoercedargs = lappend(newcoercedargs, newe);
2183  }
2184 
2185  newm->args = newcoercedargs;
2186  newm->location = m->location;
2187  return (Node *) newm;
2188 }
2189 
2190 static Node *
2191 transformSQLValueFunction(ParseState *pstate, SQLValueFunction *svf)
2192 {
2193  /*
2194  * All we need to do is insert the correct result type and (where needed)
2195  * validate the typmod, so we just modify the node in-place.
2196  */
2197  switch (svf->op)
2198  {
2199  case SVFOP_CURRENT_DATE:
2200  svf->type = DATEOID;
2201  break;
2202  case SVFOP_CURRENT_TIME:
2203  svf->type = TIMETZOID;
2204  break;
2205  case SVFOP_CURRENT_TIME_N:
2206  svf->type = TIMETZOID;
2207  svf->typmod = anytime_typmod_check(true, svf->typmod);
2208  break;
2209  case SVFOP_CURRENT_TIMESTAMP:
2210  svf->type = TIMESTAMPTZOID;
2211  break;
2212  case SVFOP_CURRENT_TIMESTAMP_N:
2213  svf->type = TIMESTAMPTZOID;
2214  svf->typmod = anytimestamp_typmod_check(true, svf->typmod);
2215  break;
2216  case SVFOP_LOCALTIME:
2217  svf->type = TIMEOID;
2218  break;
2219  case SVFOP_LOCALTIME_N:
2220  svf->type = TIMEOID;
2221  svf->typmod = anytime_typmod_check(false, svf->typmod);
2222  break;
2223  case SVFOP_LOCALTIMESTAMP:
2224  svf->type = TIMESTAMPOID;
2225  break;
2226  case SVFOP_LOCALTIMESTAMP_N:
2227  svf->type = TIMESTAMPOID;
2228  svf->typmod = anytimestamp_typmod_check(false, svf->typmod);
2229  break;
2230  case SVFOP_CURRENT_ROLE:
2231  case SVFOP_CURRENT_USER:
2232  case SVFOP_USER:
2233  case SVFOP_SESSION_USER:
2234  case SVFOP_CURRENT_CATALOG:
2235  case SVFOP_CURRENT_SCHEMA:
2236  svf->type = NAMEOID;
2237  break;
2238  }
2239 
2240  return (Node *) svf;
2241 }
2242 
2243 static Node *
2244 transformXmlExpr(ParseState *pstate, XmlExpr *x)
2245 {
2246  XmlExpr *newx;
2247  ListCell *lc;
2248  int i;
2249 
2250  newx = makeNode(XmlExpr);
2251  newx->op = x->op;
2252  if (x->name)
2253  newx->name = map_sql_identifier_to_xml_name(x->name, false, false);
2254  else
2255  newx->name = NULL;
2256  newx->xmloption = x->xmloption;
2257  newx->type = XMLOID; /* this just marks the node as transformed */
2258  newx->typmod = -1;
2259  newx->location = x->location;
2260 
2261  /*
2262  * gram.y built the named args as a list of ResTarget. Transform each,
2263  * and break the names out as a separate list.
2264  */
2265  newx->named_args = NIL;
2266  newx->arg_names = NIL;
2267 
2268  foreach(lc, x->named_args)
2269  {
2270  ResTarget *r = lfirst_node(ResTarget, lc);
2271  Node *expr;
2272  char *argname;
2273 
2274  expr = transformExprRecurse(pstate, r->val);
2275 
2276  if (r->name)
2277  argname = map_sql_identifier_to_xml_name(r->name, false, false);
2278  else if (IsA(r->val, ColumnRef))
2279  argname = map_sql_identifier_to_xml_name(FigureColname(r->val),
2280  true, false);
2281  else
2282  {
2283  ereport(ERROR,
2284  (errcode(ERRCODE_SYNTAX_ERROR),
2285  x->op == IS_XMLELEMENT
2286  ? errmsg("unnamed XML attribute value must be a column reference")
2287  : errmsg("unnamed XML element value must be a column reference"),
2288  parser_errposition(pstate, r->location)));
2289  argname = NULL; /* keep compiler quiet */
2290  }
2291 
2292  /* reject duplicate argnames in XMLELEMENT only */
2293  if (x->op == IS_XMLELEMENT)
2294  {
2295  ListCell *lc2;
2296 
2297  foreach(lc2, newx->arg_names)
2298  {
2299  if (strcmp(argname, strVal(lfirst(lc2))) == 0)
2300  ereport(ERROR,
2301  (errcode(ERRCODE_SYNTAX_ERROR),
2302  errmsg("XML attribute name \"%s\" appears more than once",
2303  argname),
2304  parser_errposition(pstate, r->location)));
2305  }
2306  }
2307 
2308  newx->named_args = lappend(newx->named_args, expr);
2309  newx->arg_names = lappend(newx->arg_names, makeString(argname));
2310  }
2311 
2312  /* The other arguments are of varying types depending on the function */
2313  newx->args = NIL;
2314  i = 0;
2315  foreach(lc, x->args)
2316  {
2317  Node *e = (Node *) lfirst(lc);
2318  Node *newe;
2319 
2320  newe = transformExprRecurse(pstate, e);
2321  switch (x->op)
2322  {
2323  case IS_XMLCONCAT:
2324  newe = coerce_to_specific_type(pstate, newe, XMLOID,
2325  "XMLCONCAT");
2326  break;
2327  case IS_XMLELEMENT:
2328  /* no coercion necessary */
2329  break;
2330  case IS_XMLFOREST:
2331  newe = coerce_to_specific_type(pstate, newe, XMLOID,
2332  "XMLFOREST");
2333  break;
2334  case IS_XMLPARSE:
2335  if (i == 0)
2336  newe = coerce_to_specific_type(pstate, newe, TEXTOID,
2337  "XMLPARSE");
2338  else
2339  newe = coerce_to_boolean(pstate, newe, "XMLPARSE");
2340  break;
2341  case IS_XMLPI:
2342  newe = coerce_to_specific_type(pstate, newe, TEXTOID,
2343  "XMLPI");
2344  break;
2345  case IS_XMLROOT:
2346  if (i == 0)
2347  newe = coerce_to_specific_type(pstate, newe, XMLOID,
2348  "XMLROOT");
2349  else if (i == 1)
2350  newe = coerce_to_specific_type(pstate, newe, TEXTOID,
2351  "XMLROOT");
2352  else
2353  newe = coerce_to_specific_type(pstate, newe, INT4OID,
2354  "XMLROOT");
2355  break;
2356  case IS_XMLSERIALIZE:
2357  /* not handled here */
2358  Assert(false);
2359  break;
2360  case IS_DOCUMENT:
2361  newe = coerce_to_specific_type(pstate, newe, XMLOID,
2362  "IS DOCUMENT");
2363  break;
2364  }
2365  newx->args = lappend(newx->args, newe);
2366  i++;
2367  }
2368 
2369  return (Node *) newx;
2370 }
2371 
2372 static Node *
2373 transformXmlSerialize(ParseState *pstate, XmlSerialize *xs)
2374 {
2375  Node *result;
2376  XmlExpr *xexpr;
2377  Oid targetType;
2378  int32 targetTypmod;
2379 
2380  xexpr = makeNode(XmlExpr);
2381  xexpr->op = IS_XMLSERIALIZE;
2382  xexpr->args = list_make1(coerce_to_specific_type(pstate,
2383  transformExprRecurse(pstate, xs->expr),
2384  XMLOID,
2385  "XMLSERIALIZE"));
2386 
2387  typenameTypeIdAndMod(pstate, xs->typeName, &targetType, &targetTypmod);
2388 
2389  xexpr->xmloption = xs->xmloption;
2390  xexpr->location = xs->location;
2391  /* We actually only need these to be able to parse back the expression. */
2392  xexpr->type = targetType;
2393  xexpr->typmod = targetTypmod;
2394 
2395  /*
2396  * The actual target type is determined this way. SQL allows char and
2397  * varchar as target types. We allow anything that can be cast implicitly
2398  * from text. This way, user-defined text-like data types automatically
2399  * fit in.
2400  */
2401  result = coerce_to_target_type(pstate, (Node *) xexpr,
2402  TEXTOID, targetType, targetTypmod,
2403  COERCION_IMPLICIT,
2404  COERCE_IMPLICIT_CAST,
2405  -1);
2406  if (result == NULL)
2407  ereport(ERROR,
2408  (errcode(ERRCODE_CANNOT_COERCE),
2409  errmsg("cannot cast XMLSERIALIZE result to %s",
2410  format_type_be(targetType)),
2411  parser_errposition(pstate, xexpr->location)));
2412  return result;
2413 }
2414 
2415 static Node *
2416 transformBooleanTest(ParseState *pstate, BooleanTest *b)
2417 {
2418  const char *clausename;
2419 
2420  switch (b->booltesttype)
2421  {
2422  case IS_TRUE:
2423  clausename = "IS TRUE";
2424  break;
2425  case IS_NOT_TRUE:
2426  clausename = "IS NOT TRUE";
2427  break;
2428  case IS_FALSE:
2429  clausename = "IS FALSE";
2430  break;
2431  case IS_NOT_FALSE:
2432  clausename = "IS NOT FALSE";
2433  break;
2434  case IS_UNKNOWN:
2435  clausename = "IS UNKNOWN";
2436  break;
2437  case IS_NOT_UNKNOWN:
2438  clausename = "IS NOT UNKNOWN";
2439  break;
2440  default:
2441  elog(ERROR, "unrecognized booltesttype: %d",
2442  (int) b->booltesttype);
2443  clausename = NULL; /* keep compiler quiet */
2444  }
2445 
2446  b->arg = (Expr *) transformExprRecurse(pstate, (Node *) b->arg);
2447 
2448  b->arg = (Expr *) coerce_to_boolean(pstate,
2449  (Node *) b->arg,
2450  clausename);
2451 
2452  return (Node *) b;
2453 }
2454 
2455 static Node *
2456 transformCurrentOfExpr(ParseState *pstate, CurrentOfExpr *cexpr)
2457 {
2458  /* CURRENT OF can only appear at top level of UPDATE/DELETE */
2459  Assert(pstate->p_target_nsitem != NULL);
2460  cexpr->cvarno = pstate->p_target_nsitem->p_rtindex;
2461 
2462  /*
2463  * Check to see if the cursor name matches a parameter of type REFCURSOR.
2464  * If so, replace the raw name reference with a parameter reference. (This
2465  * is a hack for the convenience of plpgsql.)
2466  */
2467  if (cexpr->cursor_name != NULL) /* in case already transformed */
2468  {
2469  ColumnRef *cref = makeNode(ColumnRef);
2470  Node *node = NULL;
2471 
2472  /* Build an unqualified ColumnRef with the given name */
2473  cref->fields = list_make1(makeString(cexpr->cursor_name));
2474  cref->location = -1;
2475 
2476  /* See if there is a translation available from a parser hook */
2477  if (pstate->p_pre_columnref_hook != NULL)
2478  node = pstate->p_pre_columnref_hook(pstate, cref);
2479  if (node == NULL && pstate->p_post_columnref_hook != NULL)
2480  node = pstate->p_post_columnref_hook(pstate, cref, NULL);
2481 
2482  /*
2483  * XXX Should we throw an error if we get a translation that isn't a
2484  * refcursor Param? For now it seems best to silently ignore false
2485  * matches.
2486  */
2487  if (node != NULL && IsA(node, Param))
2488  {
2489  Param *p = (Param *) node;
2490 
2491  if (p->paramkind == PARAM_EXTERN &&
2492  p->paramtype == REFCURSOROID)
2493  {
2494  /* Matches, so convert CURRENT OF to a param reference */
2495  cexpr->cursor_name = NULL;
2496  cexpr->cursor_param = p->paramid;
2497  }
2498  }
2499  }
2500 
2501  return (Node *) cexpr;
2502 }
2503 
2504 /*
2505  * Construct a whole-row reference to represent the notation "relation.*".
2506  */
2507 static Node *
2508 transformWholeRowRef(ParseState *pstate, ParseNamespaceItem *nsitem,
2509  int sublevels_up, int location)
2510 {
2511  Var *result;
2512 
2513  /*
2514  * Build the appropriate referencing node. Note that if the RTE is a
2515  * function returning scalar, we create just a plain reference to the
2516  * function value, not a composite containing a single column. This is
2517  * pretty inconsistent at first sight, but it's what we've done
2518  * historically. One argument for it is that "rel" and "rel.*" mean the
2519  * same thing for composite relations, so why not for scalar functions...
2520  */
2521  result = makeWholeRowVar(nsitem->p_rte, nsitem->p_rtindex,
2522  sublevels_up, true);
2523 
2524  /* location is not filled in by makeWholeRowVar */
2525  result->location = location;
2526 
2527  /* mark relation as requiring whole-row SELECT access */
2528  markVarForSelectPriv(pstate, result);
2529 
2530  return (Node *) result;
2531 }
2532 
2533 /*
2534  * Handle an explicit CAST construct.
2535  *
2536  * Transform the argument, look up the type name, and apply any necessary
2537  * coercion function(s).
2538  */
2539 static Node *
2540 transformTypeCast(ParseState *pstate, TypeCast *tc)
2541 {
2542  Node *result;
2543  Node *arg = tc->arg;
2544  Node *expr;
2545  Oid inputType;
2546  Oid targetType;
2547  int32 targetTypmod;
2548  int location;
2549 
2550  /* Look up the type name first */
2551  typenameTypeIdAndMod(pstate, tc->typeName, &targetType, &targetTypmod);
2552 
2553  /*
2554  * If the subject of the typecast is an ARRAY[] construct and the target
2555  * type is an array type, we invoke transformArrayExpr() directly so that
2556  * we can pass down the type information. This avoids some cases where
2557  * transformArrayExpr() might not infer the correct type. Otherwise, just
2558  * transform the argument normally.
2559  */
2560  if (IsA(arg, A_ArrayExpr))
2561  {
2562  Oid targetBaseType;
2563  int32 targetBaseTypmod;
2564  Oid elementType;
2565 
2566  /*
2567  * If target is a domain over array, work with the base array type
2568  * here. Below, we'll cast the array type to the domain. In the
2569  * usual case that the target is not a domain, the remaining steps
2570  * will be a no-op.
2571  */
2572  targetBaseTypmod = targetTypmod;
2573  targetBaseType = getBaseTypeAndTypmod(targetType, &targetBaseTypmod);
2574  elementType = get_element_type(targetBaseType);
2575  if (OidIsValid(elementType))
2576  {
2577  expr = transformArrayExpr(pstate,
2578  (A_ArrayExpr *) arg,
2579  targetBaseType,
2580  elementType,
2581  targetBaseTypmod);
2582  }
2583  else
2584  expr = transformExprRecurse(pstate, arg);
2585  }
2586  else
2587  expr = transformExprRecurse(pstate, arg);
2588 
2589  inputType = exprType(expr);
2590  if (inputType == InvalidOid)
2591  return expr; /* do nothing if NULL input */
2592 
2593  /*
2594  * Location of the coercion is preferentially the location of the :: or
2595  * CAST symbol, but if there is none then use the location of the type
2596  * name (this can happen in TypeName 'string' syntax, for instance).
2597  */
2598  location = tc->location;
2599  if (location < 0)
2600  location = tc->typeName->location;
2601 
2602  result = coerce_to_target_type(pstate, expr, inputType,
2603  targetType, targetTypmod,
2604  COERCION_EXPLICIT,
2605  COERCE_EXPLICIT_CAST,
2606  location);
2607  if (result == NULL)
2608  ereport(ERROR,
2609  (errcode(ERRCODE_CANNOT_COERCE),
2610  errmsg("cannot cast type %s to %s",
2611  format_type_be(inputType),
2612  format_type_be(targetType)),
2613  parser_coercion_errposition(pstate, location, expr)));
2614 
2615  return result;
2616 }
2617 
2618 /*
2619  * Handle an explicit COLLATE clause.
2620  *
2621  * Transform the argument, and look up the collation name.
2622  */
2623 static Node *
2624 transformCollateClause(ParseState *pstate, CollateClause *c)
2625 {
2626  CollateExpr *newc;
2627  Oid argtype;
2628 
2629  newc = makeNode(CollateExpr);
2630  newc->arg = (Expr *) transformExprRecurse(pstate, c->arg);
2631 
2632  argtype = exprType((Node *) newc->arg);
2633 
2634  /*
2635  * The unknown type is not collatable, but coerce_type() takes care of it
2636  * separately, so we'll let it go here.
2637  */
2638  if (!type_is_collatable(argtype) && argtype != UNKNOWNOID)
2639  ereport(ERROR,
2640  (errcode(ERRCODE_DATATYPE_MISMATCH),
2641  errmsg("collations are not supported by type %s",
2642  format_type_be(argtype)),
2643  parser_errposition(pstate, c->location)));
2644 
2645  newc->collOid = LookupCollation(pstate, c->collname, c->location);
2646  newc->location = c->location;
2647 
2648  return (Node *) newc;
2649 }
2650 
2651 /*
2652  * Transform a "row compare-op row" construct
2653  *
2654  * The inputs are lists of already-transformed expressions.
2655  * As with coerce_type, pstate may be NULL if no special unknown-Param
2656  * processing is wanted.
2657  *
2658  * The output may be a single OpExpr, an AND or OR combination of OpExprs,
2659  * or a RowCompareExpr. In all cases it is guaranteed to return boolean.
2660  * The AND, OR, and RowCompareExpr cases further imply things about the
2661  * behavior of the operators (ie, they behave as =, <>, or < <= > >=).
2662  */
2663 static Node *
2664 make_row_comparison_op(ParseState *pstate, List *opname,
2665  List *largs, List *rargs, int location)
2666 {
2667  RowCompareExpr *rcexpr;
2668  RowCompareType rctype;
2669  List *opexprs;
2670  List *opnos;
2671  List *opfamilies;
2672  ListCell *l,
2673  *r;
2674  List **opinfo_lists;
2675  Bitmapset *strats;
2676  int nopers;
2677  int i;
2678 
2679  nopers = list_length(largs);
2680  if (nopers != list_length(rargs))
2681  ereport(ERROR,
2682  (errcode(ERRCODE_SYNTAX_ERROR),
2683  errmsg("unequal number of entries in row expressions"),
2684  parser_errposition(pstate, location)));
2685 
2686  /*
2687  * We can't compare zero-length rows because there is no principled basis
2688  * for figuring out what the operator is.
2689  */
2690  if (nopers == 0)
2691  ereport(ERROR,
2692  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2693  errmsg("cannot compare rows of zero length"),
2694  parser_errposition(pstate, location)));
2695 
2696  /*
2697  * Identify all the pairwise operators, using make_op so that behavior is
2698  * the same as in the simple scalar case.
2699  */
2700  opexprs = NIL;
2701  forboth(l, largs, r, rargs)
2702  {
2703  Node *larg = (Node *) lfirst(l);
2704  Node *rarg = (Node *) lfirst(r);
2705  OpExpr *cmp;
2706 
2707  cmp = castNode(OpExpr, make_op(pstate, opname, larg, rarg,
2708  pstate->p_last_srf, location));
2709 
2710  /*
2711  * We don't use coerce_to_boolean here because we insist on the
2712  * operator yielding boolean directly, not via coercion. If it
2713  * doesn't yield bool it won't be in any index opfamilies...
2714  */
2715  if (cmp->opresulttype != BOOLOID)
2716  ereport(ERROR,
2717  (errcode(ERRCODE_DATATYPE_MISMATCH),
2718  errmsg("row comparison operator must yield type boolean, "
2719  "not type %s",
2720  format_type_be(cmp->opresulttype)),
2721  parser_errposition(pstate, location)));
2722  if (expression_returns_set((Node *) cmp))
2723  ereport(ERROR,
2724  (errcode(ERRCODE_DATATYPE_MISMATCH),
2725  errmsg("row comparison operator must not return a set"),
2726  parser_errposition(pstate, location)));
2727  opexprs = lappend(opexprs, cmp);
2728  }
2729 
2730  /*
2731  * If rows are length 1, just return the single operator. In this case we
2732  * don't insist on identifying btree semantics for the operator (but we
2733  * still require it to return boolean).
2734  */
2735  if (nopers == 1)
2736  return (Node *) linitial(opexprs);
2737 
2738  /*
2739  * Now we must determine which row comparison semantics (= <> < <= > >=)
2740  * apply to this set of operators. We look for btree opfamilies
2741  * containing the operators, and see which interpretations (strategy
2742  * numbers) exist for each operator.
2743  */
2744  opinfo_lists = (List **) palloc(nopers * sizeof(List *));
2745  strats = NULL;
2746  i = 0;
2747  foreach(l, opexprs)
2748  {
2749  Oid opno = ((OpExpr *) lfirst(l))->opno;
2750  Bitmapset *this_strats;
2751  ListCell *j;
2752 
2753  opinfo_lists[i] = get_op_btree_interpretation(opno);
2754 
2755  /*
2756  * convert strategy numbers into a Bitmapset to make the intersection
2757  * calculation easy.
2758  */
2759  this_strats = NULL;
2760  foreach(j, opinfo_lists[i])
2761  {
2762  OpBtreeInterpretation *opinfo = lfirst(j);
2763 
2764  this_strats = bms_add_member(this_strats, opinfo->strategy);
2765  }
2766  if (i == 0)
2767  strats = this_strats;
2768  else
2769  strats = bms_int_members(strats, this_strats);
2770  i++;
2771  }
2772 
2773  /*
2774  * If there are multiple common interpretations, we may use any one of
2775  * them ... this coding arbitrarily picks the lowest btree strategy
2776  * number.
2777  */
2778  i = bms_first_member(strats);
2779  if (i < 0)
2780  {
2781  /* No common interpretation, so fail */
2782  ereport(ERROR,
2783  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2784  errmsg("could not determine interpretation of row comparison operator %s",
2785  strVal(llast(opname))),
2786  errhint("Row comparison operators must be associated with btree operator families."),
2787  parser_errposition(pstate, location)));
2788  }
2789  rctype = (RowCompareType) i;
2790 
2791  /*
2792  * For = and <> cases, we just combine the pairwise operators with AND or
2793  * OR respectively.
2794  */
2795  if (rctype == ROWCOMPARE_EQ)
2796  return (Node *) makeBoolExpr(AND_EXPR, opexprs, location);
2797  if (rctype == ROWCOMPARE_NE)
2798  return (Node *) makeBoolExpr(OR_EXPR, opexprs, location);
2799 
2800  /*
2801  * Otherwise we need to choose exactly which opfamily to associate with
2802  * each operator.
2803  */
2804  opfamilies = NIL;
2805  for (i = 0; i < nopers; i++)
2806  {
2807  Oid opfamily = InvalidOid;
2808  ListCell *j;
2809 
2810  foreach(j, opinfo_lists[i])
2811  {
2812  OpBtreeInterpretation *opinfo = lfirst(j);
2813 
2814  if (opinfo->strategy == rctype)
2815  {
2816  opfamily = opinfo->opfamily_id;
2817  break;
2818  }
2819  }
2820  if (OidIsValid(opfamily))
2821  opfamilies = lappend_oid(opfamilies, opfamily);
2822  else /* should not happen */
2823  ereport(ERROR,
2824  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2825  errmsg("could not determine interpretation of row comparison operator %s",
2826  strVal(llast(opname))),
2827  errdetail("There are multiple equally-plausible candidates."),
2828  parser_errposition(pstate, location)));
2829  }
2830 
2831  /*
2832  * Now deconstruct the OpExprs and create a RowCompareExpr.
2833  *
2834  * Note: can't just reuse the passed largs/rargs lists, because of
2835  * possibility that make_op inserted coercion operations.
2836  */
2837  opnos = NIL;
2838  largs = NIL;
2839  rargs = NIL;
2840  foreach(l, opexprs)
2841  {
2842  OpExpr *cmp = (OpExpr *) lfirst(l);
2843 
2844  opnos = lappend_oid(opnos, cmp->opno);
2845  largs = lappend(largs, linitial(cmp->args));
2846  rargs = lappend(rargs, lsecond(cmp->args));
2847  }
2848 
2849  rcexpr = makeNode(RowCompareExpr);
2850  rcexpr->rctype = rctype;
2851  rcexpr->opnos = opnos;
2852  rcexpr->opfamilies = opfamilies;
2853  rcexpr->inputcollids = NIL; /* assign_expr_collations will fix this */
2854  rcexpr->largs = largs;
2855  rcexpr->rargs = rargs;
2856 
2857  return (Node *) rcexpr;
2858 }
2859 
2860 /*
2861  * Transform a "row IS DISTINCT FROM row" construct
2862  *
2863  * The input RowExprs are already transformed
2864  */
2865 static Node *
2866 make_row_distinct_op(ParseState *pstate, List *opname,
2867  RowExpr *lrow, RowExpr *rrow,
2868  int location)
2869 {
2870  Node *result = NULL;
2871  List *largs = lrow->args;
2872  List *rargs = rrow->args;
2873  ListCell *l,
2874  *r;
2875 
2876  if (list_length(largs) != list_length(rargs))
2877  ereport(ERROR,
2878  (errcode(ERRCODE_SYNTAX_ERROR),
2879  errmsg("unequal number of entries in row expressions"),
2880  parser_errposition(pstate, location)));
2881 
2882  forboth(l, largs, r, rargs)
2883  {
2884  Node *larg = (Node *) lfirst(l);
2885  Node *rarg = (Node *) lfirst(r);
2886  Node *cmp;
2887 
2888  cmp = (Node *) make_distinct_op(pstate, opname, larg, rarg, location);
2889  if (result == NULL)
2890  result = cmp;
2891  else
2892  result = (Node *) makeBoolExpr(OR_EXPR,
2893  list_make2(result, cmp),
2894  location);
2895  }
2896 
2897  if (result == NULL)
2898  {
2899  /* zero-length rows? Generate constant FALSE */
2900  result = makeBoolConst(false, false);
2901  }
2902 
2903  return result;
2904 }
2905 
2906 /*
2907  * make the node for an IS DISTINCT FROM operator
2908  */
2909 static Expr *
2910 make_distinct_op(ParseState *pstate, List *opname, Node *ltree, Node *rtree,
2911  int location)
2912 {
2913  Expr *result;
2914 
2915  result = make_op(pstate, opname, ltree, rtree,
2916  pstate->p_last_srf, location);
2917  if (((OpExpr *) result)->opresulttype != BOOLOID)
2918  ereport(ERROR,
2919  (errcode(ERRCODE_DATATYPE_MISMATCH),
2920  errmsg("IS DISTINCT FROM requires = operator to yield boolean"),
2921  parser_errposition(pstate, location)));
2922  if (((OpExpr *) result)->opretset)
2923  ereport(ERROR,
2924  (errcode(ERRCODE_DATATYPE_MISMATCH),
2925  /* translator: %s is name of a SQL construct, eg NULLIF */
2926  errmsg("%s must not return a set", "IS DISTINCT FROM"),
2927  parser_errposition(pstate, location)));
2928 
2929  /*
2930  * We rely on DistinctExpr and OpExpr being same struct
2931  */
2932  NodeSetTag(result, T_DistinctExpr);
2933 
2934  return result;
2935 }
2936 
2937 /*
2938  * Produce a NullTest node from an IS [NOT] DISTINCT FROM NULL construct
2939  *
2940  * "arg" is the untransformed other argument
2941  */
2942 static Node *
2943 make_nulltest_from_distinct(ParseState *pstate, A_Expr *distincta, Node *arg)
2944 {
2945  NullTest *nt = makeNode(NullTest);
2946 
2947  nt->arg = (Expr *) transformExprRecurse(pstate, arg);
2948  /* the argument can be any type, so don't coerce it */
2949  if (distincta->kind == AEXPR_NOT_DISTINCT)
2950  nt->nulltesttype = IS_NULL;
2951  else
2952  nt->nulltesttype = IS_NOT_NULL;
2953  /* argisrow = false is correct whether or not arg is composite */
2954  nt->argisrow = false;
2955  nt->location = distincta->location;
2956  return (Node *) nt;
2957 }
2958 
2959 /*
2960  * Produce a string identifying an expression by kind.
2961  *
2962  * Note: when practical, use a simple SQL keyword for the result. If that
2963  * doesn't work well, check call sites to see whether custom error message
2964  * strings are required.
2965  */
2966 const char *
2967 ParseExprKindName(ParseExprKind exprKind)
2968 {
2969  switch (exprKind)
2970  {
2971  case EXPR_KIND_NONE:
2972  return "invalid expression context";
2973  case EXPR_KIND_OTHER:
2974  return "extension expression";
2975  case EXPR_KIND_JOIN_ON:
2976  return "JOIN/ON";
2977  case EXPR_KIND_JOIN_USING:
2978  return "JOIN/USING";
2979  case EXPR_KIND_FROM_SUBSELECT:
2980  return "sub-SELECT in FROM";
2981  case EXPR_KIND_FROM_FUNCTION:
2982  return "function in FROM";
2983  case EXPR_KIND_WHERE:
2984  return "WHERE";
2985  case EXPR_KIND_POLICY:
2986  return "POLICY";
2987  case EXPR_KIND_HAVING:
2988  return "HAVING";
2989  case EXPR_KIND_FILTER:
2990  return "FILTER";
2991  case EXPR_KIND_WINDOW_PARTITION:
2992  return "window PARTITION BY";
2993  case EXPR_KIND_WINDOW_ORDER:
2994  return "window ORDER BY";
2995  case EXPR_KIND_WINDOW_FRAME_RANGE:
2996  return "window RANGE";
2997  case EXPR_KIND_WINDOW_FRAME_ROWS:
2998  return "window ROWS";
2999  case EXPR_KIND_WINDOW_FRAME_GROUPS:
3000  return "window GROUPS";
3001  case EXPR_KIND_SELECT_TARGET:
3002  return "SELECT";
3003  case EXPR_KIND_INSERT_TARGET:
3004  return "INSERT";
3005  case EXPR_KIND_UPDATE_SOURCE:
3006  case EXPR_KIND_UPDATE_TARGET:
3007  return "UPDATE";
3008  case EXPR_KIND_GROUP_BY:
3009  return "GROUP BY";
3010  case EXPR_KIND_ORDER_BY:
3011  return "ORDER BY";
3012  case EXPR_KIND_DISTINCT_ON:
3013  return "DISTINCT ON";
3014  case EXPR_KIND_LIMIT:
3015  return "LIMIT";
3016  case EXPR_KIND_OFFSET:
3017  return "OFFSET";
3018  case EXPR_KIND_RETURNING:
3019  return "RETURNING";
3020  case EXPR_KIND_VALUES:
3021  case EXPR_KIND_VALUES_SINGLE:
3022  return "VALUES";
3023  case EXPR_KIND_CHECK_CONSTRAINT:
3024  case EXPR_KIND_DOMAIN_CHECK:
3025  return "CHECK";
3026  case EXPR_KIND_COLUMN_DEFAULT:
3027  case EXPR_KIND_FUNCTION_DEFAULT:
3028  return "DEFAULT";
3029  case EXPR_KIND_INDEX_EXPRESSION:
3030  return "index expression";
3031  case EXPR_KIND_INDEX_PREDICATE:
3032  return "index predicate";
3033  case EXPR_KIND_ALTER_COL_TRANSFORM:
3034  return "USING";
3035  case EXPR_KIND_EXECUTE_PARAMETER:
3036  return "EXECUTE";
3037  case EXPR_KIND_TRIGGER_WHEN:
3038  return "WHEN";
3039  case EXPR_KIND_PARTITION_BOUND:
3040  return "partition bound";
3041  case EXPR_KIND_PARTITION_EXPRESSION:
3042  return "PARTITION BY";
3043  case EXPR_KIND_CALL_ARGUMENT:
3044  return "CALL";
3045  case EXPR_KIND_COPY_WHERE:
3046  return "WHERE";
3047  case EXPR_KIND_GENERATED_COLUMN:
3048  return "GENERATED AS";
3049  case EXPR_KIND_CYCLE_MARK:
3050  return "CYCLE";
3051 
3052  /*
3053  * There is intentionally no default: case here, so that the
3054  * compiler will warn if we add a new ParseExprKind without
3055  * extending this switch. If we do see an unrecognized value at
3056  * runtime, we'll fall through to the "unrecognized" return.
3057  */
3058  }
3059  return "unrecognized expression kind";
3060 }
list_make2
#define list_make2(x1, x2)
Definition: pg_list.h:208
makeString
Value * makeString(char *str)
Definition: value.c:53
make_op
Expr * make_op(ParseState *pstate, List *opname, Node *ltree, Node *rtree, Node *last_srf, int location)
Definition: parse_oper.c:672
transformAExprDistinct
static Node * transformAExprDistinct(ParseState *pstate, A_Expr *a)
Definition: parse_expr.c:973
MinMaxExpr::minmaxtype
Oid minmaxtype
Definition: primnodes.h:1126
EXPR_KIND_ALTER_COL_TRANSFORM
Definition: parse_node.h:72
ArrayExpr::multidims
bool multidims
Definition: primnodes.h:1016
NIL
#define NIL
Definition: pg_list.h:65
transformRowExpr
static Node * transformRowExpr(ParseState *pstate, RowExpr *r, bool allowDefault)
Definition: parse_expr.c:2073
exprIsNullConstant
static bool exprIsNullConstant(Node *arg)
Definition: parse_expr.c:851
transformExprRecurse
static Node * transformExprRecurse(ParseState *pstate, Node *expr)
Definition: parse_expr.c:112
MinMaxExpr::args
List * args
Definition: primnodes.h:1130
EXPR_KIND_OTHER
Definition: parse_node.h:41
getBaseTypeAndTypmod
Oid getBaseTypeAndTypmod(Oid typid, int32 *typmod)
Definition: lsyscache.c:2485
ParseState::p_hasSubLinks
bool p_hasSubLinks
Definition: parse_node.h:210
RowExpr::args
List * args
Definition: primnodes.h:1046
unknown_attribute
static void unknown_attribute(ParseState *pstate, Node *relref, const char *attname, int location)
Definition: parse_expr.c:326
bms_first_member
int bms_first_member(Bitmapset *a)
Definition: bitmapset.c:996
IsA
#define IsA(nodeptr, _type_)
Definition: nodes.h:584
transformIndirection
static Node * transformIndirection(ParseState *pstate, A_Indirection *ind)
Definition: parse_expr.c:372
EXPR_KIND_FUNCTION_DEFAULT
Definition: parse_node.h:69
ResTarget::val
Node * val
Definition: parsenodes.h:443
errhint
int errhint(const char *fmt,...)
Definition: elog.c:1152
transformCurrentOfExpr
static Node * transformCurrentOfExpr(ParseState *pstate, CurrentOfExpr *cexpr)
Definition: parse_expr.c:2456
A_Const
Definition: parsenodes.h:284
make_scalar_array_op
Expr * make_scalar_array_op(ParseState *pstate, List *opname, bool useOr, Node *ltree, Node *rtree, int location)
Definition: parse_oper.c:783
forboth
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:446
transformAExprOpAny
static Node * transformAExprOpAny(ParseState *pstate, A_Expr *a)
Definition: parse_expr.c:945
XmlExpr::name
char * name
Definition: primnodes.h:1206
A_Expr::kind
A_Expr_Kind kind
Definition: parsenodes.h:274
exprLocation
int exprLocation(const Node *expr)
Definition: nodeFuncs.c:1231
EXPR_KIND_GROUP_BY
Definition: parse_node.h:58
markVarForSelectPriv
void markVarForSelectPriv(ParseState *pstate, Var *var)
Definition: parse_relation.c:1079
EXPR_KIND_JOIN_ON
Definition: parse_node.h:42
transformMinMaxExpr
static Node * transformMinMaxExpr(ParseState *pstate, MinMaxExpr *m)
Definition: parse_expr.c:2152
ResTarget::name
char * name
Definition: parsenodes.h:441
anytime_typmod_check
int32 anytime_typmod_check(bool istz, int32 typmod)
Definition: date.c:68
castNode
#define castNode(_type_, nodeptr)
Definition: nodes.h:602
exprTypmod
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:267
get_element_type
Oid get_element_type(Oid typid)
Definition: lsyscache.c:2706
NodeSetTag
#define NodeSetTag(nodeptr, t)
Definition: nodes.h:582
EXPR_KIND_LIMIT
Definition: parse_node.h:61
get_array_type
Oid get_array_type(Oid typid)
Definition: lsyscache.c:2734
XmlExpr::location
int location
Definition: primnodes.h:1213
pstrdup
char * pstrdup(const char *in)
Definition: mcxt.c:1187
EXPR_KIND_DOMAIN_CHECK
Definition: parse_node.h:67
transformAExprNullIf
static Node * transformAExprNullIf(ParseState *pstate, A_Expr *a)
Definition: parse_expr.c:1024
RowCompareExpr::rctype
RowCompareType rctype
Definition: primnodes.h:1094
RowCompareExpr::opfamilies
List * opfamilies
Definition: primnodes.h:1096
EXPR_KIND_TRIGGER_WHEN
Definition: parse_node.h:74
EXPR_KIND_COPY_WHERE
Definition: parse_node.h:79
expression_returns_set
bool expression_returns_set(Node *clause)
Definition: nodeFuncs.c:709
transformExpr
Node * transformExpr(ParseState *pstate, Node *expr, ParseExprKind exprKind)
Definition: parse_expr.c:94
llast
#define llast(l)
Definition: pg_list.h:194
XmlExpr::type
Oid type
Definition: primnodes.h:1211
transformSubLink
static Node * transformSubLink(ParseState *pstate, SubLink *sublink)
Definition: parse_expr.c:1682
EXPR_KIND_WHERE
Definition: parse_node.h:46
coerce_type
Node * coerce_type(ParseState *pstate, Node *node, Oid inputTypeId, Oid targetTypeId, int32 targetTypeMod, CoercionContext ccontext, CoercionForm cformat, int location)
Definition: parse_coerce.c:156
Param::paramkind
ParamKind paramkind
Definition: primnodes.h:262
Node
Definition: nodes.h:533
EXPR_KIND_EXECUTE_PARAMETER
Definition: parse_node.h:73
scanNSItemForColumn
Node * scanNSItemForColumn(ParseState *pstate, ParseNamespaceItem *nsitem, int sublevels_up, const char *colname, int location)
Definition: parse_relation.c:667
strVal
#define strVal(v)
Definition: value.h:54
makeWholeRowVar
Var * makeWholeRowVar(RangeTblEntry *rte, Index varno, Index varlevelsup, bool allowScalar)
Definition: makefuncs.c:133
list_concat
List * list_concat(List *list1, const List *list2)
Definition: list.c:530
errcode
int errcode(int sqlerrcode)
Definition: elog.c:694
errorMissingColumn
void errorMissingColumn(ParseState *pstate, const char *relname, const char *colname, int location)
Definition: parse_relation.c:3542
ParseState::p_multiassign_exprs
List * p_multiassign_exprs
Definition: parse_node.h:197
parse_relation.h
ArrayExpr::array_typeid
Oid array_typeid
Definition: primnodes.h:1012
format_type_be
char * format_type_be(Oid type_oid)
Definition: format_type.c:339
make_distinct_op
static Expr * make_distinct_op(ParseState *pstate, List *opname, Node *ltree, Node *rtree, int location)
Definition: parse_expr.c:2910
parse_expr.h
EXPR_KIND_HAVING
Definition: parse_node.h:47
ParseState::p_target_nsitem
ParseNamespaceItem * p_target_nsitem
Definition: parse_node.h:192
EXPR_KIND_JOIN_USING
Definition: parse_node.h:43
XmlSerialize::typeName
TypeName * typeName
Definition: parsenodes.h:764
FuncCall::location
int location
Definition: parsenodes.h:360
CaseExpr::casetype
Oid casetype
Definition: primnodes.h:954
relname
NameData relname
Definition: pg_class.h:38
Oid
unsigned int Oid
Definition: postgres_ext.h:31
pg_type.h
makeSimpleA_Expr
A_Expr * makeSimpleA_Expr(A_Expr_Kind kind, char *name, Node *lexpr, Node *rexpr, int location)
Definition: makefuncs.c:48
EXPR_KIND_ORDER_BY
Definition: parse_node.h:59
XmlExpr::arg_names
List * arg_names
Definition: primnodes.h:1208
EXPR_KIND_WINDOW_FRAME_RANGE
Definition: parse_node.h:51
Var
Definition: primnodes.h:181
make_const
Const * make_const(ParseState *pstate, Value *value, int location)
Definition: parse_node.c:352
transformBooleanTest
static Node * transformBooleanTest(ParseState *pstate, BooleanTest *b)
Definition: parse_expr.c:2416
transformXmlExpr
static Node * transformXmlExpr(ParseState *pstate, XmlExpr *x)
Definition: parse_expr.c:2244
lappend_oid
List * lappend_oid(List *list, Oid datum)
Definition: list.c:372
OidIsValid
#define OidIsValid(objectId)
Definition: c.h:710
ParseExprKind
ParseExprKind
Definition: parse_node.h:38
parse_coerce.h
FuncCall::agg_order
List * agg_order
Definition: parsenodes.h:352
lsecond
#define lsecond(l)
Definition: pg_list.h:179
transformCoalesceExpr
static Node * transformCoalesceExpr(ParseState *pstate, CoalesceExpr *c)
Definition: parse_expr.c:2103
CaseTestExpr::typeMod
int32 typeMod
Definition: primnodes.h:997
BoolExpr::location
int location
Definition: primnodes.h:605
CaseWhen::location
int location
Definition: primnodes.h:970
SQLValueFunction::op
SQLValueFunctionOp op
Definition: primnodes.h:1167
make_row_comparison_op
static Node * make_row_comparison_op(ParseState *pstate, List *opname, List *largs, List *rargs, int location)
Definition: parse_expr.c:2664
ParseExprKindName
const char * ParseExprKindName(ParseExprKind exprKind)
Definition: parse_expr.c:2967
ParseState::p_post_columnref_hook
PostParseColumnRefHook p_post_columnref_hook
Definition: parse_node.h:220
int32
signed int int32
Definition: c.h:429
makeBoolExpr
Expr * makeBoolExpr(BoolExprType boolop, List *args, int location)
Definition: makefuncs.c:369
Query::targetList
List * targetList
Definition: parsenodes.h:140
TypeCast::location
int location
Definition: parsenodes.h:299
EXPR_KIND_RETURNING
Definition: parse_node.h:63
ColumnRef::location
int location
Definition: parsenodes.h:237
ResTarget::location
int location
Definition: parsenodes.h:444
parse_type.h
list_make1
#define list_make1(x1)
Definition: pg_list.h:206
assign_expr_collations
void assign_expr_collations(ParseState *pstate, Node *expr)
Definition: parse_collate.c:177
EXPR_KIND_INDEX_PREDICATE
Definition: parse_node.h:71
EXPR_KIND_CHECK_CONSTRAINT
Definition: parse_node.h:66
ParseNamespaceItem::p_rte
RangeTblEntry * p_rte
Definition: parse_node.h:258
OpExpr::opresulttype
Oid opresulttype
Definition: primnodes.h:539
EXPR_KIND_CALL_ARGUMENT
Definition: parse_node.h:78
A_Expr
Definition: parsenodes.h:271
TargetEntry::resjunk
bool resjunk
Definition: primnodes.h:1438
linitial
#define linitial(l)
Definition: pg_list.h:174
EXPR_KIND_WINDOW_FRAME_ROWS
Definition: parse_node.h:52
ERROR
#define ERROR
Definition: elog.h:45
attname
NameData attname
Definition: pg_attribute.h:41
RowExpr::colnames
List * colnames
Definition: primnodes.h:1062
EXPR_KIND_INDEX_EXPRESSION
Definition: parse_node.h:70
Param::paramcollid
Oid paramcollid
Definition: primnodes.h:266
EXPR_KIND_VALUES_SINGLE
Definition: parse_node.h:65
ParseFuncOrColumn
Node * ParseFuncOrColumn(ParseState *pstate, List *funcname, List *fargs, Node *last_srf, FuncCall *fn, bool proc_call, int location)
Definition: parse_func.c:88
parse_oper.h
list_nth
static void * list_nth(const List *list, int n)
Definition: pg_list.h:278
transformBoolExpr
static Node * transformBoolExpr(ParseState *pstate, BoolExpr *a)
Definition: parse_expr.c:1313
Param::location
int location
Definition: primnodes.h:267
FigureColname
char * FigureColname(Node *node)
Definition: parse_target.c:1690
CoalesceExpr::args
List * args
Definition: primnodes.h:1110
coerce_to_target_type
Node * coerce_to_target_type(ParseState *pstate, Node *expr, Oid exprtype, Oid targettype, int32 targettypmod, CoercionContext ccontext, CoercionForm cformat, int location)
Definition: parse_coerce.c:78
BoolExpr::boolop
BoolExprType boolop
Definition: primnodes.h:603
makeBoolConst
Node * makeBoolConst(bool value, bool isnull)
Definition: makefuncs.c:357
A_Indirection::arg
Node * arg
Definition: parsenodes.h:406
NullTest::arg
Expr * arg
Definition: primnodes.h:1243
transformArrayExpr
static Node * transformArrayExpr(ParseState *pstate, A_ArrayExpr *a, Oid array_type, Oid element_type, int32 typmod)
Definition: parse_expr.c:1920
lfirst_node
#define lfirst_node(type, lc)
Definition: pg_list.h:172
transformAExprOpAll
static Node * transformAExprOpAll(ParseState *pstate, A_Expr *a)
Definition: parse_expr.c:959
get_database_name
char * get_database_name(Oid dbid)
Definition: dbcommands.c:2155
Var::location
int location
Definition: primnodes.h:196
transformFuncCall
static Node * transformFuncCall(ParseState *pstate, FuncCall *fn)
Definition: parse_expr.c:1349
RowExpr::location
int location
Definition: primnodes.h:1063
c
char * c
Definition: preproc-cursor.c:31
EXPR_KIND_INSERT_TARGET
Definition: parse_node.h:55
A_ArrayExpr::elements
List * elements
Definition: parsenodes.h:416
ParseState::p_paramref_hook
ParseParamRefHook p_paramref_hook
Definition: parse_node.h:221
map_sql_identifier_to_xml_name
char * map_sql_identifier_to_xml_name(const char *ident, bool fully_escaped, bool escape_period)
Definition: xml.c:2036
MinMaxExpr::location
int location
Definition: primnodes.h:1131
EXPR_KIND_WINDOW_FRAME_GROUPS
Definition: parse_node.h:53
check_stack_depth
void check_stack_depth(void)
Definition: postgres.c:3310
EXPR_KIND_POLICY
Definition: parse_node.h:75
transformContainerSubscripts
SubscriptingRef * transformContainerSubscripts(ParseState *pstate, Node *containerBase, Oid containerType, int32 containerTypMod, List *indirection, bool isAssignment)
Definition: parse_node.c:248
A_Expr::rexpr
Node * rexpr
Definition: parsenodes.h:277
errdetail
int errdetail(const char *fmt,...)
Definition: elog.c:1038
BooleanTest::arg
Expr * arg
Definition: primnodes.h:1266
transformWholeRowRef
static Node * transformWholeRowRef(ParseState *pstate, ParseNamespaceItem *nsitem, int sublevels_up, int location)
Definition: parse_expr.c:2508
TargetEntry::resno
AttrNumber resno
Definition: primnodes.h:1432
generate_unaccent_rules.args
args
Definition: generate_unaccent_rules.py:285
transformParamRef
static Node * transformParamRef(ParseState *pstate, ParamRef *pref)
Definition: parse_expr.c:827
A_Expr::location
int location
Definition: parsenodes.h:278
errorMissingRTE
void errorMissingRTE(ParseState *pstate, RangeVar *relation)
Definition: parse_relation.c:3481
list_delete_last
List * list_delete_last(List *list)
Definition: list.c:892
CurrentOfExpr::cursor_name
char * cursor_name
Definition: primnodes.h:1341
ArrayExpr::elements
List * elements
Definition: primnodes.h:1015
EXPR_KIND_OFFSET
Definition: parse_node.h:62
type_is_rowtype
bool type_is_rowtype(Oid typid)
Definition: lsyscache.c:2602
parse_collate.h
A_Expr::lexpr
Node * lexpr
Definition: parsenodes.h:276
makeTargetEntry
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition: makefuncs.c:238
transformAExprOp
static Node * transformAExprOp(ParseState *pstate, A_Expr *a)
Definition: parse_expr.c:864
A_Star
Definition: parsenodes.h:369
EXPR_KIND_UPDATE_TARGET
Definition: parse_node.h:57
ltree
Definition: ltree.h:29
XmlSerialize::xmloption
XmlOptionType xmloption
Definition: parsenodes.h:762
coerce_to_common_type
Node * coerce_to_common_type(ParseState *pstate, Node *node, Oid targetTypeId, const char *context)
Definition: parse_coerce.c:1506
EXPR_KIND_FROM_SUBSELECT
Definition: parse_node.h:44
lappend
List * lappend(List *list, void *datum)
Definition: list.c:336
element
static chr element(struct vars *v, const chr *startp, const chr *endp)
Definition: regc_locale.c:376
A_Indirection
Definition: parsenodes.h:403
parse_agg.h
T_Var
Definition: nodes.h:155
XmlExpr::op
XmlExprOp op
Definition: primnodes.h:1205
NameListToString
char * NameListToString(List *names)
Definition: namespace.c:3101
transformMultiAssignRef
static Node * transformMultiAssignRef(ParseState *pstate, MultiAssignRef *maref)
Definition: parse_expr.c:1394
transformCollateClause
static Node * transformCollateClause(ParseState *pstate, CollateClause *c)
Definition: parse_expr.c:2624
CaseExpr::args
List * args
Definition: primnodes.h:957
Transform_null_equals
bool Transform_null_equals
Definition: parse_expr.c:42
EXPR_KIND_CYCLE_MARK
Definition: parse_node.h:81
get_op_btree_interpretation
List * get_op_btree_interpretation(Oid opno)
Definition: lsyscache.c:599
ArrayExpr::location
int location
Definition: primnodes.h:1017
BooleanTest::booltesttype
BoolTestType booltesttype
Definition: primnodes.h:1267
transformExpressionList
List * transformExpressionList(ParseState *pstate, List *exprlist, ParseExprKind exprKind, bool allowDefault)
Definition: parse_target.c:220
ParseState::p_last_srf
Node * p_last_srf
Definition: parse_node.h:213
MyDatabaseId
Oid MyDatabaseId
Definition: globals.c:86
transformGroupingFunc
Node * transformGroupingFunc(ParseState *pstate, GroupingFunc *p)
Definition: parse_agg.c:247
GetRTEByRangeTablePosn
RangeTblEntry * GetRTEByRangeTablePosn(ParseState *pstate, int varno, int sublevels_up)
Definition: parse_relation.c:516
TypeCast::typeName
TypeName * typeName
Definition: parsenodes.h:298
make_row_distinct_op
static Node * make_row_distinct_op(ParseState *pstate, List *opname, RowExpr *lrow, RowExpr *rrow, int location)
Definition: parse_expr.c:2866
ParamRef::number
int number
Definition: parsenodes.h:246
ParseState::p_expr_kind
ParseExprKind p_expr_kind
Definition: parse_node.h:195
NullTest::nulltesttype
NullTestType nulltesttype
Definition: primnodes.h:1244
XmlExpr::typmod
int32 typmod
Definition: primnodes.h:1212
typenameTypeIdAndMod
void typenameTypeIdAndMod(ParseState *pstate, const TypeName *typeName, Oid *typeid_p, int32 *typmod_p)
Definition: parse_type.c:310
EXPR_KIND_PARTITION_BOUND
Definition: parse_node.h:76
LookupCollation
Oid LookupCollation(ParseState *pstate, List *collnames, int location)
Definition: parse_type.c:513
EXPR_KIND_FILTER
Definition: parse_node.h:48
InvalidOid
#define InvalidOid
Definition: postgres_ext.h:36
EXPR_KIND_UPDATE_SOURCE
Definition: parse_node.h:56
parse_sub_analyze
Query * parse_sub_analyze(Node *parseTree, ParseState *parentParseState, CommonTableExpr *parentCTE, bool locked_from_parent, bool resolve_unknowns)
Definition: analyze.c:168
XmlExpr::named_args
List * named_args
Definition: primnodes.h:1207
ereport
#define ereport(elevel,...)
Definition: elog.h:155
refnameNamespaceItem
ParseNamespaceItem * refnameNamespaceItem(ParseState *pstate, const char *schemaname, const char *refname, int location, int *sublevels_up)
Definition: parse_relation.c:108
RowCompareType
RowCompareType
Definition: primnodes.h:1080
fn
static void * fn(void *arg)
Definition: thread-descriptor.c:106
parse_func.h
Query::commandType
CmdType commandType
Definition: parsenodes.h:112
XmlExpr::args
List * args
Definition: primnodes.h:1209
Param::paramtypmod
int32 paramtypmod
Definition: primnodes.h:265
ParamRef::location
int location
Definition: parsenodes.h:247
lcons
List * lcons(void *datum, List *list)
Definition: list.c:468
errmsg_internal
int errmsg_internal(const char *fmt,...)
Definition: elog.c:992
makeNode
#define makeNode(_type_)
Definition: nodes.h:581
NamedArgExpr::arg
Expr * arg
Definition: primnodes.h:519
Assert
#define Assert(condition)
Definition: c.h:804
lfirst
#define lfirst(lc)
Definition: pg_list.h:169
Alias::aliasname
char * aliasname
Definition: primnodes.h:42
A_Const::location
int location
Definition: parsenodes.h:288
A_Indices
Definition: parsenodes.h:380
Value
Definition: value.h:42
EXPR_KIND_VALUES
Definition: parse_node.h:64
A_Indirection::indirection
List * indirection
Definition: parsenodes.h:407
anytimestamp_typmod_check
int32 anytimestamp_typmod_check(bool istz, int32 typmod)
Definition: timestamp.c:102
contain_vars_of_level
bool contain_vars_of_level(Node *node, int levelsup)
Definition: var.c:396
TargetEntry::expr
Expr * expr
Definition: primnodes.h:1431
XmlExpr::xmloption
XmlOptionType xmloption
Definition: primnodes.h:1210
Param::paramid
int paramid
Definition: primnodes.h:263
ISCOMPLEX
#define ISCOMPLEX(typeid)
Definition: parse_type.h:58
lfourth
#define lfourth(l)
Definition: pg_list.h:189
TypeName::location
int location
Definition: parsenodes.h:217
NullTest::location
int location
Definition: primnodes.h:1246
exprType
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
EXPR_KIND_COLUMN_DEFAULT
Definition: parse_node.h:68
FuncCall::args
List * args
Definition: parsenodes.h:351
RowExpr::row_typeid
Oid row_typeid
Definition: primnodes.h:1047
list_length
static int list_length(const List *l)
Definition: pg_list.h:149
parser_errposition
int parser_errposition(ParseState *pstate, int location)
Definition: parse_node.c:111
exprCollation
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:759
CollateExpr::arg
Expr * arg
Definition: primnodes.h:924
CaseExpr::location
int location
Definition: primnodes.h:959
type_is_array
#define type_is_array(typid)
Definition: lsyscache.h:202
make_nulltest_from_distinct
static Node * make_nulltest_from_distinct(ParseState *pstate, A_Expr *distincta, Node *arg)
Definition: parse_expr.c:2943
bms_add_member
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:736
BoolExpr::args
List * args
Definition: primnodes.h:604
A_Expr::name
List * name
Definition: parsenodes.h:275
transformCaseExpr
static Node * transformCaseExpr(ParseState *pstate, CaseExpr *c)
Definition: parse_expr.c:1542
InvalidAttrNumber
#define InvalidAttrNumber
Definition: attnum.h:23
nodeTag
#define nodeTag(nodeptr)
Definition: nodes.h:538
A_ArrayExpr
Definition: parsenodes.h:413
ArrayExpr::element_typeid
Oid element_typeid
Definition: primnodes.h:1014
EXPR_KIND_SELECT_TARGET
Definition: parse_node.h:54
EXPR_KIND_GENERATED_COLUMN
Definition: parse_node.h:80
T_Null
Definition: nodes.h:296
EXPR_KIND_DISTINCT_ON
Definition: parse_node.h:60
transformTypeCast
static Node * transformTypeCast(ParseState *pstate, TypeCast *tc)
Definition: parse_expr.c:2540
CollateClause::collname
List * collname
Definition: parsenodes.h:309
e
e
Definition: preproc-init.c:82
A_ArrayExpr::location
int location
Definition: parsenodes.h:417
transformColumnRef
static Node * transformColumnRef(ParseState *pstate, ColumnRef *cref)
Definition: parse_expr.c:444
palloc
void * palloc(Size size)
Definition: mcxt.c:950
errmsg
int errmsg(const char *fmt,...)
Definition: elog.c:905
transformXmlSerialize
static Node * transformXmlSerialize(ParseState *pstate, XmlSerialize *xs)
Definition: parse_expr.c:2373
EXPR_KIND_NONE
Definition: parse_node.h:40
parser_coercion_errposition
int parser_coercion_errposition(ParseState *pstate, int coerce_location, Node *input_expr)
Definition: parse_coerce.c:1254
elog
#define elog(elevel,...)
Definition: elog.h:227
i
int i
Definition: preproc-comment.c:23
CoalesceExpr::coalescetype
Oid coalescetype
Definition: primnodes.h:1108
count_nonjunk_tlist_entries
int count_nonjunk_tlist_entries(List *tlist)
Definition: tlist.c:203
transformSQLValueFunction
static Node * transformSQLValueFunction(ParseState *pstate, SQLValueFunction *svf)
Definition: parse_expr.c:2191
coerce_to_specific_type
Node * coerce_to_specific_type(ParseState *pstate, Node *node, Oid targetTypeId, const char *constructName)
Definition: parse_coerce.c:1234
XmlSerialize::expr
Node * expr
Definition: parsenodes.h:763
arg
void * arg
Definition: pg_backup_utils.c:27
select_common_type
Oid select_common_type(ParseState *pstate, List *exprs, const char *context, Node **which_expr)
Definition: parse_coerce.c:1280
lthird
#define lthird(l)
Definition: pg_list.h:184
parse_clause.h
EXPR_KIND_PARTITION_EXPRESSION
Definition: parse_node.h:77
NullTest::argisrow
bool argisrow
Definition: primnodes.h:1245
MinMaxExpr::op
MinMaxOp op
Definition: primnodes.h:1129
EXPR_KIND_WINDOW_PARTITION
Definition: parse_node.h:49
CaseExpr::arg
Expr * arg
Definition: primnodes.h:956
OpExpr::opno
Oid opno
Definition: primnodes.h:537
ParseState::p_pre_columnref_hook
PreParseColumnRefHook p_pre_columnref_hook
Definition: parse_node.h:219
FuncCall::funcname
List * funcname
Definition: parsenodes.h:350
RangeTblEntry::eref
Alias * eref
Definition: parsenodes.h:1120
CaseWhen::result
Expr * result
Definition: primnodes.h:969
SortBy::node
Node * node
Definition: parsenodes.h:470
FuncCall::agg_within_group
bool agg_within_group
Definition: parsenodes.h:355
EXPR_KIND_WINDOW_ORDER
Definition: parse_node.h:50
copyObject
#define copyObject(obj)
Definition: nodes.h:649
OpExpr::args
List * args
Definition: primnodes.h:543
bms_int_members
Bitmapset * bms_int_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:902
RowCompareExpr::inputcollids
List * inputcollids
Definition: primnodes.h:1097
CaseExpr::defresult
Expr * defresult
Definition: primnodes.h:958
CaseWhen::expr
Expr * expr
Definition: primnodes.h:968
CollateExpr::location
int location
Definition: primnodes.h:926
RowExpr::row_format
CoercionForm row_format
Definition: primnodes.h:1061
type_is_collatable
bool type_is_collatable(Oid typid)
Definition: lsyscache.c:3028
A_Const::val
Value val
Definition: parsenodes.h:287
List
Definition: pg_list.h:50
snprintf
#define snprintf
Definition: port.h:216
_
#define _(x)
Definition: elog.c:89
val
long val
Definition: informix.c:664
Param::paramtype
Oid paramtype
Definition: primnodes.h:264
makeRangeVar
RangeVar * makeRangeVar(char *schemaname, char *relname, int location)
Definition: makefuncs.c:422
parse_target.h
EXPR_KIND_FROM_FUNCTION
Definition: parse_node.h:45
transformAExprBetween
static Node * transformAExprBetween(ParseState *pstate, A_Expr *a)
Definition: parse_expr.c:1219
ColumnRef::fields
List * fields
Definition: parsenodes.h:236
Value::type
NodeTag type
Definition: value.h:44
colNameToVar
Node * colNameToVar(ParseState *pstate, const char *colname, bool localonly, int location)
Definition: parse_relation.c:849
OpExpr::opretset
bool opretset
Definition: primnodes.h:540
cmp
static int cmp(const chr *x, const chr *y, size_t len)
Definition: regc_locale.c:747
TypeCast::arg
Node * arg
Definition: parsenodes.h:297
transformAExprIn
static Node * transformAExprIn(ParseState *pstate, A_Expr *a)
Definition: parse_expr.c:1066
coerce_to_boolean
Node * coerce_to_boolean(ParseState *pstate, Node *node, const char *constructName)
Definition: parse_coerce.c:1138