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