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