Line data Source code
1 : /*-------------------------------------------------------------------------
2 : *
3 : * parse_expr.c
4 : * handle expressions in parser
5 : *
6 : * Portions Copyright (c) 1996-2025, 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_aggregate.h"
19 : #include "catalog/pg_type.h"
20 : #include "commands/dbcommands.h"
21 : #include "miscadmin.h"
22 : #include "nodes/makefuncs.h"
23 : #include "nodes/nodeFuncs.h"
24 : #include "optimizer/optimizer.h"
25 : #include "parser/analyze.h"
26 : #include "parser/parse_agg.h"
27 : #include "parser/parse_clause.h"
28 : #include "parser/parse_coerce.h"
29 : #include "parser/parse_collate.h"
30 : #include "parser/parse_expr.h"
31 : #include "parser/parse_func.h"
32 : #include "parser/parse_oper.h"
33 : #include "parser/parse_relation.h"
34 : #include "parser/parse_target.h"
35 : #include "parser/parse_type.h"
36 : #include "utils/builtins.h"
37 : #include "utils/date.h"
38 : #include "utils/fmgroids.h"
39 : #include "utils/lsyscache.h"
40 : #include "utils/timestamp.h"
41 : #include "utils/xml.h"
42 :
43 : /* GUC parameters */
44 : bool Transform_null_equals = false;
45 :
46 :
47 : static Node *transformExprRecurse(ParseState *pstate, Node *expr);
48 : static Node *transformParamRef(ParseState *pstate, ParamRef *pref);
49 : static Node *transformAExprOp(ParseState *pstate, A_Expr *a);
50 : static Node *transformAExprOpAny(ParseState *pstate, A_Expr *a);
51 : static Node *transformAExprOpAll(ParseState *pstate, A_Expr *a);
52 : static Node *transformAExprDistinct(ParseState *pstate, A_Expr *a);
53 : static Node *transformAExprNullIf(ParseState *pstate, A_Expr *a);
54 : static Node *transformAExprIn(ParseState *pstate, A_Expr *a);
55 : static Node *transformAExprBetween(ParseState *pstate, A_Expr *a);
56 : static Node *transformMergeSupportFunc(ParseState *pstate, MergeSupportFunc *f);
57 : static Node *transformBoolExpr(ParseState *pstate, BoolExpr *a);
58 : static Node *transformFuncCall(ParseState *pstate, FuncCall *fn);
59 : static Node *transformMultiAssignRef(ParseState *pstate, MultiAssignRef *maref);
60 : static Node *transformCaseExpr(ParseState *pstate, CaseExpr *c);
61 : static Node *transformSubLink(ParseState *pstate, SubLink *sublink);
62 : static Node *transformArrayExpr(ParseState *pstate, A_ArrayExpr *a,
63 : Oid array_type, Oid element_type, int32 typmod);
64 : static Node *transformRowExpr(ParseState *pstate, RowExpr *r, bool allowDefault);
65 : static Node *transformCoalesceExpr(ParseState *pstate, CoalesceExpr *c);
66 : static Node *transformMinMaxExpr(ParseState *pstate, MinMaxExpr *m);
67 : static Node *transformSQLValueFunction(ParseState *pstate,
68 : SQLValueFunction *svf);
69 : static Node *transformXmlExpr(ParseState *pstate, XmlExpr *x);
70 : static Node *transformXmlSerialize(ParseState *pstate, XmlSerialize *xs);
71 : static Node *transformBooleanTest(ParseState *pstate, BooleanTest *b);
72 : static Node *transformCurrentOfExpr(ParseState *pstate, CurrentOfExpr *cexpr);
73 : static Node *transformColumnRef(ParseState *pstate, ColumnRef *cref);
74 : static Node *transformWholeRowRef(ParseState *pstate,
75 : ParseNamespaceItem *nsitem,
76 : int sublevels_up, int location);
77 : static Node *transformIndirection(ParseState *pstate, A_Indirection *ind);
78 : static Node *transformTypeCast(ParseState *pstate, TypeCast *tc);
79 : static Node *transformCollateClause(ParseState *pstate, CollateClause *c);
80 : static Node *transformJsonObjectConstructor(ParseState *pstate,
81 : JsonObjectConstructor *ctor);
82 : static Node *transformJsonArrayConstructor(ParseState *pstate,
83 : JsonArrayConstructor *ctor);
84 : static Node *transformJsonArrayQueryConstructor(ParseState *pstate,
85 : JsonArrayQueryConstructor *ctor);
86 : static Node *transformJsonObjectAgg(ParseState *pstate, JsonObjectAgg *agg);
87 : static Node *transformJsonArrayAgg(ParseState *pstate, JsonArrayAgg *agg);
88 : static Node *transformJsonIsPredicate(ParseState *pstate, JsonIsPredicate *pred);
89 : static Node *transformJsonParseExpr(ParseState *pstate, JsonParseExpr *jsexpr);
90 : static Node *transformJsonScalarExpr(ParseState *pstate, JsonScalarExpr *jsexpr);
91 : static Node *transformJsonSerializeExpr(ParseState *pstate,
92 : JsonSerializeExpr *expr);
93 : static Node *transformJsonFuncExpr(ParseState *pstate, JsonFuncExpr *func);
94 : static void transformJsonPassingArgs(ParseState *pstate, const char *constructName,
95 : JsonFormatType format, List *args,
96 : List **passing_values, List **passing_names);
97 : static JsonBehavior *transformJsonBehavior(ParseState *pstate, JsonBehavior *behavior,
98 : JsonBehaviorType default_behavior,
99 : JsonReturning *returning);
100 : static Node *GetJsonBehaviorConst(JsonBehaviorType btype, int location);
101 : static Node *make_row_comparison_op(ParseState *pstate, List *opname,
102 : List *largs, List *rargs, int location);
103 : static Node *make_row_distinct_op(ParseState *pstate, List *opname,
104 : RowExpr *lrow, RowExpr *rrow, int location);
105 : static Expr *make_distinct_op(ParseState *pstate, List *opname,
106 : Node *ltree, Node *rtree, int location);
107 : static Node *make_nulltest_from_distinct(ParseState *pstate,
108 : A_Expr *distincta, Node *arg);
109 :
110 :
111 : /*
112 : * transformExpr -
113 : * Analyze and transform expressions. Type checking and type casting is
114 : * done here. This processing converts the raw grammar output into
115 : * expression trees with fully determined semantics.
116 : */
117 : Node *
118 1658852 : transformExpr(ParseState *pstate, Node *expr, ParseExprKind exprKind)
119 : {
120 : Node *result;
121 : ParseExprKind sv_expr_kind;
122 :
123 : /* Save and restore identity of expression type we're parsing */
124 : Assert(exprKind != EXPR_KIND_NONE);
125 1658852 : sv_expr_kind = pstate->p_expr_kind;
126 1658852 : pstate->p_expr_kind = exprKind;
127 :
128 1658852 : result = transformExprRecurse(pstate, expr);
129 :
130 1653184 : pstate->p_expr_kind = sv_expr_kind;
131 :
132 1653184 : return result;
133 : }
134 :
135 : static Node *
136 4529540 : transformExprRecurse(ParseState *pstate, Node *expr)
137 : {
138 : Node *result;
139 :
140 4529540 : if (expr == NULL)
141 50384 : return NULL;
142 :
143 : /* Guard against stack overflow due to overly complex expressions */
144 4479156 : check_stack_depth();
145 :
146 4479156 : switch (nodeTag(expr))
147 : {
148 1585232 : case T_ColumnRef:
149 1585232 : result = transformColumnRef(pstate, (ColumnRef *) expr);
150 1584564 : break;
151 :
152 143702 : case T_ParamRef:
153 143702 : result = transformParamRef(pstate, (ParamRef *) expr);
154 143690 : break;
155 :
156 1122696 : case T_A_Const:
157 1122696 : result = (Node *) make_const(pstate, (A_Const *) expr);
158 1122672 : break;
159 :
160 21454 : case T_A_Indirection:
161 21454 : result = transformIndirection(pstate, (A_Indirection *) expr);
162 21364 : break;
163 :
164 6094 : case T_A_ArrayExpr:
165 6094 : result = transformArrayExpr(pstate, (A_ArrayExpr *) expr,
166 : InvalidOid, InvalidOid, -1);
167 6088 : break;
168 :
169 266784 : case T_TypeCast:
170 266784 : result = transformTypeCast(pstate, (TypeCast *) expr);
171 263426 : break;
172 :
173 8516 : case T_CollateClause:
174 8516 : result = transformCollateClause(pstate, (CollateClause *) expr);
175 8498 : break;
176 :
177 615760 : case T_A_Expr:
178 : {
179 615760 : A_Expr *a = (A_Expr *) expr;
180 :
181 615760 : switch (a->kind)
182 : {
183 577462 : case AEXPR_OP:
184 577462 : result = transformAExprOp(pstate, a);
185 577040 : break;
186 15072 : case AEXPR_OP_ANY:
187 15072 : result = transformAExprOpAny(pstate, a);
188 15060 : break;
189 300 : case AEXPR_OP_ALL:
190 300 : result = transformAExprOpAll(pstate, a);
191 300 : break;
192 926 : case AEXPR_DISTINCT:
193 : case AEXPR_NOT_DISTINCT:
194 926 : result = transformAExprDistinct(pstate, a);
195 926 : break;
196 258 : case AEXPR_NULLIF:
197 258 : result = transformAExprNullIf(pstate, a);
198 258 : break;
199 18484 : case AEXPR_IN:
200 18484 : result = transformAExprIn(pstate, a);
201 18472 : break;
202 2744 : case AEXPR_LIKE:
203 : case AEXPR_ILIKE:
204 : case AEXPR_SIMILAR:
205 : /* we can transform these just like AEXPR_OP */
206 2744 : result = transformAExprOp(pstate, a);
207 2738 : break;
208 514 : case AEXPR_BETWEEN:
209 : case AEXPR_NOT_BETWEEN:
210 : case AEXPR_BETWEEN_SYM:
211 : case AEXPR_NOT_BETWEEN_SYM:
212 514 : result = transformAExprBetween(pstate, a);
213 514 : break;
214 0 : default:
215 0 : elog(ERROR, "unrecognized A_Expr kind: %d", a->kind);
216 : result = NULL; /* keep compiler quiet */
217 : break;
218 : }
219 615308 : break;
220 : }
221 :
222 142964 : case T_BoolExpr:
223 142964 : result = transformBoolExpr(pstate, (BoolExpr *) expr);
224 142944 : break;
225 :
226 357938 : case T_FuncCall:
227 357938 : result = transformFuncCall(pstate, (FuncCall *) expr);
228 356906 : break;
229 :
230 378 : case T_MultiAssignRef:
231 378 : result = transformMultiAssignRef(pstate, (MultiAssignRef *) expr);
232 372 : break;
233 :
234 362 : case T_GroupingFunc:
235 362 : result = transformGroupingFunc(pstate, (GroupingFunc *) expr);
236 362 : break;
237 :
238 168 : case T_MergeSupportFunc:
239 168 : result = transformMergeSupportFunc(pstate,
240 : (MergeSupportFunc *) expr);
241 156 : break;
242 :
243 50576 : case T_NamedArgExpr:
244 : {
245 50576 : NamedArgExpr *na = (NamedArgExpr *) expr;
246 :
247 50576 : na->arg = (Expr *) transformExprRecurse(pstate, (Node *) na->arg);
248 50576 : result = expr;
249 50576 : break;
250 : }
251 :
252 40332 : case T_SubLink:
253 40332 : result = transformSubLink(pstate, (SubLink *) expr);
254 40242 : break;
255 :
256 54756 : case T_CaseExpr:
257 54756 : result = transformCaseExpr(pstate, (CaseExpr *) expr);
258 54750 : break;
259 :
260 5650 : case T_RowExpr:
261 5650 : result = transformRowExpr(pstate, (RowExpr *) expr, false);
262 5650 : break;
263 :
264 2954 : case T_CoalesceExpr:
265 2954 : result = transformCoalesceExpr(pstate, (CoalesceExpr *) expr);
266 2948 : break;
267 :
268 256 : case T_MinMaxExpr:
269 256 : result = transformMinMaxExpr(pstate, (MinMaxExpr *) expr);
270 256 : break;
271 :
272 2638 : case T_SQLValueFunction:
273 2638 : result = transformSQLValueFunction(pstate,
274 : (SQLValueFunction *) expr);
275 2638 : break;
276 :
277 596 : case T_XmlExpr:
278 596 : result = transformXmlExpr(pstate, (XmlExpr *) expr);
279 566 : break;
280 :
281 202 : case T_XmlSerialize:
282 202 : result = transformXmlSerialize(pstate, (XmlSerialize *) expr);
283 202 : break;
284 :
285 16096 : case T_NullTest:
286 : {
287 16096 : NullTest *n = (NullTest *) expr;
288 :
289 16096 : n->arg = (Expr *) transformExprRecurse(pstate, (Node *) n->arg);
290 : /* the argument can be any type, so don't coerce it */
291 16096 : n->argisrow = type_is_rowtype(exprType((Node *) n->arg));
292 16096 : result = expr;
293 16096 : break;
294 : }
295 :
296 806 : case T_BooleanTest:
297 806 : result = transformBooleanTest(pstate, (BooleanTest *) expr);
298 806 : break;
299 :
300 254 : case T_CurrentOfExpr:
301 254 : result = transformCurrentOfExpr(pstate, (CurrentOfExpr *) expr);
302 254 : break;
303 :
304 : /*
305 : * In all places where DEFAULT is legal, the caller should have
306 : * processed it rather than passing it to transformExpr().
307 : */
308 0 : case T_SetToDefault:
309 0 : ereport(ERROR,
310 : (errcode(ERRCODE_SYNTAX_ERROR),
311 : errmsg("DEFAULT is not allowed in this context"),
312 : parser_errposition(pstate,
313 : ((SetToDefault *) expr)->location)));
314 : break;
315 :
316 : /*
317 : * CaseTestExpr doesn't require any processing; it is only
318 : * injected into parse trees in a fully-formed state.
319 : *
320 : * Ordinarily we should not see a Var here, but it is convenient
321 : * for transformJoinUsingClause() to create untransformed operator
322 : * trees containing already-transformed Vars. The best
323 : * alternative would be to deconstruct and reconstruct column
324 : * references, which seems expensively pointless. So allow it.
325 : */
326 27086 : case T_CaseTestExpr:
327 : case T_Var:
328 : {
329 27086 : result = (Node *) expr;
330 27086 : break;
331 : }
332 :
333 434 : case T_JsonObjectConstructor:
334 434 : result = transformJsonObjectConstructor(pstate, (JsonObjectConstructor *) expr);
335 392 : break;
336 :
337 194 : case T_JsonArrayConstructor:
338 194 : result = transformJsonArrayConstructor(pstate, (JsonArrayConstructor *) expr);
339 176 : break;
340 :
341 54 : case T_JsonArrayQueryConstructor:
342 54 : result = transformJsonArrayQueryConstructor(pstate, (JsonArrayQueryConstructor *) expr);
343 36 : break;
344 :
345 204 : case T_JsonObjectAgg:
346 204 : result = transformJsonObjectAgg(pstate, (JsonObjectAgg *) expr);
347 204 : break;
348 :
349 192 : case T_JsonArrayAgg:
350 192 : result = transformJsonArrayAgg(pstate, (JsonArrayAgg *) expr);
351 192 : break;
352 :
353 350 : case T_JsonIsPredicate:
354 350 : result = transformJsonIsPredicate(pstate, (JsonIsPredicate *) expr);
355 344 : break;
356 :
357 164 : case T_JsonParseExpr:
358 164 : result = transformJsonParseExpr(pstate, (JsonParseExpr *) expr);
359 138 : break;
360 :
361 112 : case T_JsonScalarExpr:
362 112 : result = transformJsonScalarExpr(pstate, (JsonScalarExpr *) expr);
363 112 : break;
364 :
365 108 : case T_JsonSerializeExpr:
366 108 : result = transformJsonSerializeExpr(pstate, (JsonSerializeExpr *) expr);
367 98 : break;
368 :
369 3094 : case T_JsonFuncExpr:
370 3094 : result = transformJsonFuncExpr(pstate, (JsonFuncExpr *) expr);
371 2956 : break;
372 :
373 0 : default:
374 : /* should not reach here */
375 0 : elog(ERROR, "unrecognized node type: %d", (int) nodeTag(expr));
376 : result = NULL; /* keep compiler quiet */
377 : break;
378 : }
379 :
380 4473068 : return result;
381 : }
382 :
383 : /*
384 : * helper routine for delivering "column does not exist" error message
385 : *
386 : * (Usually we don't have to work this hard, but the general case of field
387 : * selection from an arbitrary node needs it.)
388 : */
389 : static void
390 38 : unknown_attribute(ParseState *pstate, Node *relref, const char *attname,
391 : int location)
392 : {
393 : RangeTblEntry *rte;
394 :
395 38 : if (IsA(relref, Var) &&
396 12 : ((Var *) relref)->varattno == InvalidAttrNumber)
397 : {
398 : /* Reference the RTE by alias not by actual table name */
399 0 : rte = GetRTEByRangeTablePosn(pstate,
400 : ((Var *) relref)->varno,
401 0 : ((Var *) relref)->varlevelsup);
402 0 : ereport(ERROR,
403 : (errcode(ERRCODE_UNDEFINED_COLUMN),
404 : errmsg("column %s.%s does not exist",
405 : rte->eref->aliasname, attname),
406 : parser_errposition(pstate, location)));
407 : }
408 : else
409 : {
410 : /* Have to do it by reference to the type of the expression */
411 38 : Oid relTypeId = exprType(relref);
412 :
413 38 : if (ISCOMPLEX(relTypeId))
414 18 : ereport(ERROR,
415 : (errcode(ERRCODE_UNDEFINED_COLUMN),
416 : errmsg("column \"%s\" not found in data type %s",
417 : attname, format_type_be(relTypeId)),
418 : parser_errposition(pstate, location)));
419 20 : else if (relTypeId == RECORDOID)
420 20 : ereport(ERROR,
421 : (errcode(ERRCODE_UNDEFINED_COLUMN),
422 : errmsg("could not identify column \"%s\" in record data type",
423 : attname),
424 : parser_errposition(pstate, location)));
425 : else
426 0 : ereport(ERROR,
427 : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
428 : errmsg("column notation .%s applied to type %s, "
429 : "which is not a composite type",
430 : attname, format_type_be(relTypeId)),
431 : parser_errposition(pstate, location)));
432 : }
433 : }
434 :
435 : static Node *
436 21454 : transformIndirection(ParseState *pstate, A_Indirection *ind)
437 : {
438 21454 : Node *last_srf = pstate->p_last_srf;
439 21454 : Node *result = transformExprRecurse(pstate, ind->arg);
440 21454 : List *subscripts = NIL;
441 21454 : int location = exprLocation(result);
442 : ListCell *i;
443 :
444 : /*
445 : * We have to split any field-selection operations apart from
446 : * subscripting. Adjacent A_Indices nodes have to be treated as a single
447 : * multidimensional subscript operation.
448 : */
449 42436 : foreach(i, ind->indirection)
450 : {
451 21020 : Node *n = lfirst(i);
452 :
453 21020 : if (IsA(n, A_Indices))
454 10812 : subscripts = lappend(subscripts, n);
455 10208 : else if (IsA(n, A_Star))
456 : {
457 0 : ereport(ERROR,
458 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
459 : errmsg("row expansion via \"*\" is not supported here"),
460 : parser_errposition(pstate, location)));
461 : }
462 : else
463 : {
464 : Node *newresult;
465 :
466 : Assert(IsA(n, String));
467 :
468 : /* process subscripts before this field selection */
469 10208 : if (subscripts)
470 136 : result = (Node *) transformContainerSubscripts(pstate,
471 : result,
472 : exprType(result),
473 : exprTypmod(result),
474 : subscripts,
475 : false);
476 10208 : subscripts = NIL;
477 :
478 10208 : newresult = ParseFuncOrColumn(pstate,
479 10208 : list_make1(n),
480 10208 : list_make1(result),
481 : last_srf,
482 : NULL,
483 : false,
484 : location);
485 10208 : if (newresult == NULL)
486 38 : unknown_attribute(pstate, result, strVal(n), location);
487 10170 : result = newresult;
488 : }
489 : }
490 : /* process trailing subscripts, if any */
491 21416 : if (subscripts)
492 10362 : result = (Node *) transformContainerSubscripts(pstate,
493 : result,
494 : exprType(result),
495 : exprTypmod(result),
496 : subscripts,
497 : false);
498 :
499 21364 : 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 *
508 1585232 : transformColumnRef(ParseState *pstate, ColumnRef *cref)
509 : {
510 1585232 : Node *node = NULL;
511 1585232 : char *nspname = NULL;
512 1585232 : char *relname = NULL;
513 1585232 : char *colname = NULL;
514 : ParseNamespaceItem *nsitem;
515 : int levels_up;
516 : enum
517 : {
518 : CRERR_NO_COLUMN,
519 : CRERR_NO_RTE,
520 : CRERR_WRONG_DB,
521 : CRERR_TOO_MANY
522 1585232 : } 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 1585232 : err = NULL;
531 1585232 : switch (pstate->p_expr_kind)
532 : {
533 0 : case EXPR_KIND_NONE:
534 : Assert(false); /* can't happen */
535 0 : break;
536 1585148 : case EXPR_KIND_OTHER:
537 : case EXPR_KIND_JOIN_ON:
538 : case EXPR_KIND_JOIN_USING:
539 : case EXPR_KIND_FROM_SUBSELECT:
540 : case EXPR_KIND_FROM_FUNCTION:
541 : case EXPR_KIND_WHERE:
542 : case EXPR_KIND_POLICY:
543 : case EXPR_KIND_HAVING:
544 : case EXPR_KIND_FILTER:
545 : case EXPR_KIND_WINDOW_PARTITION:
546 : case EXPR_KIND_WINDOW_ORDER:
547 : case EXPR_KIND_WINDOW_FRAME_RANGE:
548 : case EXPR_KIND_WINDOW_FRAME_ROWS:
549 : case EXPR_KIND_WINDOW_FRAME_GROUPS:
550 : case EXPR_KIND_SELECT_TARGET:
551 : case EXPR_KIND_INSERT_TARGET:
552 : case EXPR_KIND_UPDATE_SOURCE:
553 : case EXPR_KIND_UPDATE_TARGET:
554 : case EXPR_KIND_MERGE_WHEN:
555 : case EXPR_KIND_GROUP_BY:
556 : case EXPR_KIND_ORDER_BY:
557 : case EXPR_KIND_DISTINCT_ON:
558 : case EXPR_KIND_LIMIT:
559 : case EXPR_KIND_OFFSET:
560 : case EXPR_KIND_RETURNING:
561 : case EXPR_KIND_MERGE_RETURNING:
562 : case EXPR_KIND_VALUES:
563 : case EXPR_KIND_VALUES_SINGLE:
564 : case EXPR_KIND_CHECK_CONSTRAINT:
565 : case EXPR_KIND_DOMAIN_CHECK:
566 : case EXPR_KIND_FUNCTION_DEFAULT:
567 : case EXPR_KIND_INDEX_EXPRESSION:
568 : case EXPR_KIND_INDEX_PREDICATE:
569 : case EXPR_KIND_STATS_EXPRESSION:
570 : case EXPR_KIND_ALTER_COL_TRANSFORM:
571 : case EXPR_KIND_EXECUTE_PARAMETER:
572 : case EXPR_KIND_TRIGGER_WHEN:
573 : case EXPR_KIND_PARTITION_EXPRESSION:
574 : case EXPR_KIND_CALL_ARGUMENT:
575 : case EXPR_KIND_COPY_WHERE:
576 : case EXPR_KIND_GENERATED_COLUMN:
577 : case EXPR_KIND_CYCLE_MARK:
578 : /* okay */
579 1585148 : break;
580 :
581 24 : case EXPR_KIND_COLUMN_DEFAULT:
582 24 : err = _("cannot use column reference in DEFAULT expression");
583 24 : break;
584 60 : case EXPR_KIND_PARTITION_BOUND:
585 60 : err = _("cannot use column reference in partition bound expression");
586 60 : break;
587 :
588 : /*
589 : * There is intentionally no default: case here, so that the
590 : * compiler will warn if we add a new ParseExprKind without
591 : * extending this switch. If we do see an unrecognized value at
592 : * runtime, the behavior will be the same as for EXPR_KIND_OTHER,
593 : * which is sane anyway.
594 : */
595 : }
596 1585232 : if (err)
597 84 : ereport(ERROR,
598 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
599 : errmsg_internal("%s", err),
600 : parser_errposition(pstate, cref->location)));
601 :
602 : /*
603 : * Give the PreParseColumnRefHook, if any, first shot. If it returns
604 : * non-null then that's all, folks.
605 : */
606 1585148 : if (pstate->p_pre_columnref_hook != NULL)
607 : {
608 36108 : node = pstate->p_pre_columnref_hook(pstate, cref);
609 36108 : if (node != NULL)
610 760 : return node;
611 : }
612 :
613 : /*----------
614 : * The allowed syntaxes are:
615 : *
616 : * A First try to resolve as unqualified column name;
617 : * if no luck, try to resolve as unqualified table name (A.*).
618 : * A.B A is an unqualified table name; B is either a
619 : * column or function name (trying column name first).
620 : * A.B.C schema A, table B, col or func name C.
621 : * A.B.C.D catalog A, schema B, table C, col or func D.
622 : * A.* A is an unqualified table name; means whole-row value.
623 : * A.B.* whole-row value of table B in schema A.
624 : * A.B.C.* whole-row value of table C in schema B in catalog A.
625 : *
626 : * We do not need to cope with bare "*"; that will only be accepted by
627 : * the grammar at the top level of a SELECT list, and transformTargetList
628 : * will take care of it before it ever gets here. Also, "A.*" etc will
629 : * be expanded by transformTargetList if they appear at SELECT top level,
630 : * so here we are only going to see them as function or operator inputs.
631 : *
632 : * Currently, if a catalog name is given then it must equal the current
633 : * database name; we check it here and then discard it.
634 : *----------
635 : */
636 1584388 : switch (list_length(cref->fields))
637 : {
638 633252 : case 1:
639 : {
640 633252 : Node *field1 = (Node *) linitial(cref->fields);
641 :
642 633252 : colname = strVal(field1);
643 :
644 : /* Try to identify as an unqualified column */
645 633252 : node = colNameToVar(pstate, colname, false, cref->location);
646 :
647 633192 : if (node == NULL)
648 : {
649 : /*
650 : * Not known as a column of any range-table entry.
651 : *
652 : * Try to find the name as a relation. Note that only
653 : * relations already entered into the rangetable will be
654 : * recognized.
655 : *
656 : * This is a hack for backwards compatibility with
657 : * PostQUEL-inspired syntax. The preferred form now is
658 : * "rel.*".
659 : */
660 35436 : nsitem = refnameNamespaceItem(pstate, NULL, colname,
661 : cref->location,
662 : &levels_up);
663 35436 : if (nsitem)
664 6662 : node = transformWholeRowRef(pstate, nsitem, levels_up,
665 : cref->location);
666 : }
667 633192 : break;
668 : }
669 951050 : case 2:
670 : {
671 951050 : Node *field1 = (Node *) linitial(cref->fields);
672 951050 : Node *field2 = (Node *) lsecond(cref->fields);
673 :
674 951050 : relname = strVal(field1);
675 :
676 : /* Locate the referenced nsitem */
677 951050 : nsitem = refnameNamespaceItem(pstate, nspname, relname,
678 : cref->location,
679 : &levels_up);
680 951026 : if (nsitem == NULL)
681 : {
682 5408 : crerr = CRERR_NO_RTE;
683 5408 : break;
684 : }
685 :
686 : /* Whole-row reference? */
687 945618 : if (IsA(field2, A_Star))
688 : {
689 1394 : node = transformWholeRowRef(pstate, nsitem, levels_up,
690 : cref->location);
691 1394 : break;
692 : }
693 :
694 944224 : colname = strVal(field2);
695 :
696 : /* Try to identify as a column of the nsitem */
697 944224 : node = scanNSItemForColumn(pstate, nsitem, levels_up, colname,
698 : cref->location);
699 944218 : if (node == NULL)
700 : {
701 : /* Try it as a function call on the whole row */
702 168 : node = transformWholeRowRef(pstate, nsitem, levels_up,
703 : cref->location);
704 168 : node = ParseFuncOrColumn(pstate,
705 168 : list_make1(makeString(colname)),
706 168 : list_make1(node),
707 : pstate->p_last_srf,
708 : NULL,
709 : false,
710 : cref->location);
711 : }
712 944218 : break;
713 : }
714 86 : case 3:
715 : {
716 86 : Node *field1 = (Node *) linitial(cref->fields);
717 86 : Node *field2 = (Node *) lsecond(cref->fields);
718 86 : Node *field3 = (Node *) lthird(cref->fields);
719 :
720 86 : nspname = strVal(field1);
721 86 : relname = strVal(field2);
722 :
723 : /* Locate the referenced nsitem */
724 86 : nsitem = refnameNamespaceItem(pstate, nspname, relname,
725 : cref->location,
726 : &levels_up);
727 86 : if (nsitem == NULL)
728 : {
729 68 : crerr = CRERR_NO_RTE;
730 68 : break;
731 : }
732 :
733 : /* Whole-row reference? */
734 18 : if (IsA(field3, A_Star))
735 : {
736 6 : node = transformWholeRowRef(pstate, nsitem, levels_up,
737 : cref->location);
738 6 : break;
739 : }
740 :
741 12 : colname = strVal(field3);
742 :
743 : /* Try to identify as a column of the nsitem */
744 12 : node = scanNSItemForColumn(pstate, nsitem, levels_up, colname,
745 : cref->location);
746 12 : if (node == NULL)
747 : {
748 : /* Try it as a function call on the whole row */
749 0 : node = transformWholeRowRef(pstate, nsitem, levels_up,
750 : cref->location);
751 0 : node = ParseFuncOrColumn(pstate,
752 0 : list_make1(makeString(colname)),
753 0 : list_make1(node),
754 : pstate->p_last_srf,
755 : NULL,
756 : false,
757 : cref->location);
758 : }
759 12 : break;
760 : }
761 0 : case 4:
762 : {
763 0 : Node *field1 = (Node *) linitial(cref->fields);
764 0 : Node *field2 = (Node *) lsecond(cref->fields);
765 0 : Node *field3 = (Node *) lthird(cref->fields);
766 0 : Node *field4 = (Node *) lfourth(cref->fields);
767 : char *catname;
768 :
769 0 : catname = strVal(field1);
770 0 : nspname = strVal(field2);
771 0 : relname = strVal(field3);
772 :
773 : /*
774 : * We check the catalog name and then ignore it.
775 : */
776 0 : if (strcmp(catname, get_database_name(MyDatabaseId)) != 0)
777 : {
778 0 : crerr = CRERR_WRONG_DB;
779 0 : break;
780 : }
781 :
782 : /* Locate the referenced nsitem */
783 0 : nsitem = refnameNamespaceItem(pstate, nspname, relname,
784 : cref->location,
785 : &levels_up);
786 0 : if (nsitem == NULL)
787 : {
788 0 : crerr = CRERR_NO_RTE;
789 0 : break;
790 : }
791 :
792 : /* Whole-row reference? */
793 0 : if (IsA(field4, A_Star))
794 : {
795 0 : node = transformWholeRowRef(pstate, nsitem, levels_up,
796 : cref->location);
797 0 : break;
798 : }
799 :
800 0 : colname = strVal(field4);
801 :
802 : /* Try to identify as a column of the nsitem */
803 0 : node = scanNSItemForColumn(pstate, nsitem, levels_up, colname,
804 : cref->location);
805 0 : if (node == NULL)
806 : {
807 : /* Try it as a function call on the whole row */
808 0 : node = transformWholeRowRef(pstate, nsitem, levels_up,
809 : cref->location);
810 0 : node = ParseFuncOrColumn(pstate,
811 0 : list_make1(makeString(colname)),
812 0 : list_make1(node),
813 : pstate->p_last_srf,
814 : NULL,
815 : false,
816 : cref->location);
817 : }
818 0 : break;
819 : }
820 0 : default:
821 0 : crerr = CRERR_TOO_MANY; /* too many dotted names */
822 0 : 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 1584298 : if (pstate->p_post_columnref_hook != NULL)
835 : {
836 : Node *hookresult;
837 :
838 47894 : hookresult = pstate->p_post_columnref_hook(pstate, cref, node);
839 47860 : if (node == NULL)
840 33870 : node = hookresult;
841 13990 : else if (hookresult != NULL)
842 0 : 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 1584264 : if (node == NULL)
853 : {
854 460 : switch (crerr)
855 : {
856 352 : case CRERR_NO_COLUMN:
857 352 : errorMissingColumn(pstate, relname, colname, cref->location);
858 : break;
859 108 : case CRERR_NO_RTE:
860 108 : errorMissingRTE(pstate, makeRangeVar(nspname, relname,
861 : cref->location));
862 : break;
863 0 : case CRERR_WRONG_DB:
864 0 : 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 0 : case CRERR_TOO_MANY:
871 0 : 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 1583804 : }
879 :
880 1583804 : return node;
881 : }
882 :
883 : static Node *
884 143702 : transformParamRef(ParseState *pstate, ParamRef *pref)
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 143702 : if (pstate->p_paramref_hook != NULL)
893 143696 : result = pstate->p_paramref_hook(pstate, pref);
894 : else
895 6 : result = NULL;
896 :
897 143702 : if (result == NULL)
898 12 : ereport(ERROR,
899 : (errcode(ERRCODE_UNDEFINED_PARAMETER),
900 : errmsg("there is no parameter $%d", pref->number),
901 : parser_errposition(pstate, pref->location)));
902 :
903 143690 : return result;
904 : }
905 :
906 : /* Test whether an a_expr is a plain NULL constant or not */
907 : static bool
908 1822 : exprIsNullConstant(Node *arg)
909 : {
910 1822 : if (arg && IsA(arg, A_Const))
911 : {
912 108 : A_Const *con = (A_Const *) arg;
913 :
914 108 : if (con->isnull)
915 30 : return true;
916 : }
917 1792 : return false;
918 : }
919 :
920 : static Node *
921 580206 : transformAExprOp(ParseState *pstate, A_Expr *a)
922 : {
923 580206 : Node *lexpr = a->lexpr;
924 580206 : Node *rexpr = a->rexpr;
925 : Node *result;
926 :
927 : /*
928 : * Special-case "foo = NULL" and "NULL = foo" for compatibility with
929 : * standards-broken products (like Microsoft's). Turn these into IS NULL
930 : * exprs. (If either side is a CaseTestExpr, then the expression was
931 : * generated internally from a CASE-WHEN expression, and
932 : * transform_null_equals does not apply.)
933 : */
934 580206 : if (Transform_null_equals &&
935 0 : list_length(a->name) == 1 &&
936 0 : strcmp(strVal(linitial(a->name)), "=") == 0 &&
937 0 : (exprIsNullConstant(lexpr) || exprIsNullConstant(rexpr)) &&
938 0 : (!IsA(lexpr, CaseTestExpr) && !IsA(rexpr, CaseTestExpr)))
939 0 : {
940 0 : NullTest *n = makeNode(NullTest);
941 :
942 0 : n->nulltesttype = IS_NULL;
943 0 : n->location = a->location;
944 :
945 0 : if (exprIsNullConstant(lexpr))
946 0 : n->arg = (Expr *) rexpr;
947 : else
948 0 : n->arg = (Expr *) lexpr;
949 :
950 0 : result = transformExprRecurse(pstate, (Node *) n);
951 : }
952 580206 : else if (lexpr && IsA(lexpr, RowExpr) &&
953 730 : rexpr && IsA(rexpr, SubLink) &&
954 30 : ((SubLink *) rexpr)->subLinkType == EXPR_SUBLINK)
955 30 : {
956 : /*
957 : * Convert "row op subselect" into a ROWCOMPARE sublink. Formerly the
958 : * grammar did this, but now that a row construct is allowed anywhere
959 : * in expressions, it's easier to do it here.
960 : */
961 30 : SubLink *s = (SubLink *) rexpr;
962 :
963 30 : s->subLinkType = ROWCOMPARE_SUBLINK;
964 30 : s->testexpr = lexpr;
965 30 : s->operName = a->name;
966 30 : s->location = a->location;
967 30 : result = transformExprRecurse(pstate, (Node *) s);
968 : }
969 580176 : else if (lexpr && IsA(lexpr, RowExpr) &&
970 700 : rexpr && IsA(rexpr, RowExpr))
971 : {
972 : /* ROW() op ROW() is handled specially */
973 694 : lexpr = transformExprRecurse(pstate, lexpr);
974 694 : rexpr = transformExprRecurse(pstate, rexpr);
975 :
976 694 : result = make_row_comparison_op(pstate,
977 : a->name,
978 : castNode(RowExpr, lexpr)->args,
979 : castNode(RowExpr, rexpr)->args,
980 : a->location);
981 : }
982 : else
983 : {
984 : /* Ordinary scalar operator */
985 579482 : Node *last_srf = pstate->p_last_srf;
986 :
987 579482 : lexpr = transformExprRecurse(pstate, lexpr);
988 579252 : rexpr = transformExprRecurse(pstate, rexpr);
989 :
990 579166 : result = (Node *) make_op(pstate,
991 : a->name,
992 : lexpr,
993 : rexpr,
994 : last_srf,
995 : a->location);
996 : }
997 :
998 579778 : return result;
999 : }
1000 :
1001 : static Node *
1002 15072 : transformAExprOpAny(ParseState *pstate, A_Expr *a)
1003 : {
1004 15072 : Node *lexpr = transformExprRecurse(pstate, a->lexpr);
1005 15072 : Node *rexpr = transformExprRecurse(pstate, a->rexpr);
1006 :
1007 15072 : return (Node *) make_scalar_array_op(pstate,
1008 : a->name,
1009 : true,
1010 : lexpr,
1011 : rexpr,
1012 : a->location);
1013 : }
1014 :
1015 : static Node *
1016 300 : transformAExprOpAll(ParseState *pstate, A_Expr *a)
1017 : {
1018 300 : Node *lexpr = transformExprRecurse(pstate, a->lexpr);
1019 300 : Node *rexpr = transformExprRecurse(pstate, a->rexpr);
1020 :
1021 300 : return (Node *) make_scalar_array_op(pstate,
1022 : a->name,
1023 : false,
1024 : lexpr,
1025 : rexpr,
1026 : a->location);
1027 : }
1028 :
1029 : static Node *
1030 926 : transformAExprDistinct(ParseState *pstate, A_Expr *a)
1031 : {
1032 926 : Node *lexpr = a->lexpr;
1033 926 : Node *rexpr = a->rexpr;
1034 : Node *result;
1035 :
1036 : /*
1037 : * If either input is an undecorated NULL literal, transform to a NullTest
1038 : * on the other input. That's simpler to process than a full DistinctExpr,
1039 : * and it avoids needing to require that the datatype have an = operator.
1040 : */
1041 926 : if (exprIsNullConstant(rexpr))
1042 30 : return make_nulltest_from_distinct(pstate, a, lexpr);
1043 896 : if (exprIsNullConstant(lexpr))
1044 0 : return make_nulltest_from_distinct(pstate, a, rexpr);
1045 :
1046 896 : lexpr = transformExprRecurse(pstate, lexpr);
1047 896 : rexpr = transformExprRecurse(pstate, rexpr);
1048 :
1049 896 : if (lexpr && IsA(lexpr, RowExpr) &&
1050 6 : rexpr && IsA(rexpr, RowExpr))
1051 : {
1052 : /* ROW() op ROW() is handled specially */
1053 6 : result = make_row_distinct_op(pstate, a->name,
1054 : (RowExpr *) lexpr,
1055 : (RowExpr *) rexpr,
1056 : a->location);
1057 : }
1058 : else
1059 : {
1060 : /* Ordinary scalar operator */
1061 890 : result = (Node *) make_distinct_op(pstate,
1062 : a->name,
1063 : lexpr,
1064 : rexpr,
1065 : a->location);
1066 : }
1067 :
1068 : /*
1069 : * If it's NOT DISTINCT, we first build a DistinctExpr and then stick a
1070 : * NOT on top.
1071 : */
1072 896 : if (a->kind == AEXPR_NOT_DISTINCT)
1073 56 : result = (Node *) makeBoolExpr(NOT_EXPR,
1074 56 : list_make1(result),
1075 : a->location);
1076 :
1077 896 : return result;
1078 : }
1079 :
1080 : static Node *
1081 258 : transformAExprNullIf(ParseState *pstate, A_Expr *a)
1082 : {
1083 258 : Node *lexpr = transformExprRecurse(pstate, a->lexpr);
1084 258 : Node *rexpr = transformExprRecurse(pstate, a->rexpr);
1085 : OpExpr *result;
1086 :
1087 258 : result = (OpExpr *) make_op(pstate,
1088 : a->name,
1089 : lexpr,
1090 : rexpr,
1091 : pstate->p_last_srf,
1092 : a->location);
1093 :
1094 : /*
1095 : * The comparison operator itself should yield boolean ...
1096 : */
1097 258 : if (result->opresulttype != BOOLOID)
1098 0 : ereport(ERROR,
1099 : (errcode(ERRCODE_DATATYPE_MISMATCH),
1100 : /* translator: %s is name of a SQL construct, eg NULLIF */
1101 : errmsg("%s requires = operator to yield boolean", "NULLIF"),
1102 : parser_errposition(pstate, a->location)));
1103 258 : if (result->opretset)
1104 0 : ereport(ERROR,
1105 : (errcode(ERRCODE_DATATYPE_MISMATCH),
1106 : /* translator: %s is name of a SQL construct, eg NULLIF */
1107 : errmsg("%s must not return a set", "NULLIF"),
1108 : parser_errposition(pstate, a->location)));
1109 :
1110 : /*
1111 : * ... but the NullIfExpr will yield the first operand's type.
1112 : */
1113 258 : result->opresulttype = exprType((Node *) linitial(result->args));
1114 :
1115 : /*
1116 : * We rely on NullIfExpr and OpExpr being the same struct
1117 : */
1118 258 : NodeSetTag(result, T_NullIfExpr);
1119 :
1120 258 : return (Node *) result;
1121 : }
1122 :
1123 : static Node *
1124 18484 : transformAExprIn(ParseState *pstate, A_Expr *a)
1125 : {
1126 18484 : Node *result = NULL;
1127 : Node *lexpr;
1128 : List *rexprs;
1129 : List *rvars;
1130 : List *rnonvars;
1131 : bool useOr;
1132 : ListCell *l;
1133 :
1134 : /*
1135 : * If the operator is <>, combine with AND not OR.
1136 : */
1137 18484 : if (strcmp(strVal(linitial(a->name)), "<>") == 0)
1138 2182 : useOr = false;
1139 : else
1140 16302 : useOr = true;
1141 :
1142 : /*
1143 : * We try to generate a ScalarArrayOpExpr from IN/NOT IN, but this is only
1144 : * possible if there is a suitable array type available. If not, we fall
1145 : * back to a boolean condition tree with multiple copies of the lefthand
1146 : * expression. Also, any IN-list items that contain Vars are handled as
1147 : * separate boolean conditions, because that gives the planner more scope
1148 : * for optimization on such clauses.
1149 : *
1150 : * First step: transform all the inputs, and detect whether any contain
1151 : * Vars.
1152 : */
1153 18484 : lexpr = transformExprRecurse(pstate, a->lexpr);
1154 18484 : rexprs = rvars = rnonvars = NIL;
1155 68992 : foreach(l, (List *) a->rexpr)
1156 : {
1157 50514 : Node *rexpr = transformExprRecurse(pstate, lfirst(l));
1158 :
1159 50508 : rexprs = lappend(rexprs, rexpr);
1160 50508 : if (contain_vars_of_level(rexpr, 0))
1161 0 : rvars = lappend(rvars, rexpr);
1162 : else
1163 50508 : rnonvars = lappend(rnonvars, rexpr);
1164 : }
1165 :
1166 : /*
1167 : * ScalarArrayOpExpr is only going to be useful if there's more than one
1168 : * non-Var righthand item.
1169 : */
1170 18478 : if (list_length(rnonvars) > 1)
1171 : {
1172 : List *allexprs;
1173 : Oid scalar_type;
1174 : Oid array_type;
1175 :
1176 : /*
1177 : * Try to select a common type for the array elements. Note that
1178 : * since the LHS' type is first in the list, it will be preferred when
1179 : * there is doubt (eg, when all the RHS items are unknown literals).
1180 : *
1181 : * Note: use list_concat here not lcons, to avoid damaging rnonvars.
1182 : */
1183 15940 : allexprs = list_concat(list_make1(lexpr), rnonvars);
1184 15940 : scalar_type = select_common_type(pstate, allexprs, NULL, NULL);
1185 :
1186 : /* We have to verify that the selected type actually works */
1187 15940 : if (OidIsValid(scalar_type) &&
1188 15940 : !verify_common_type(scalar_type, allexprs))
1189 6 : scalar_type = InvalidOid;
1190 :
1191 : /*
1192 : * Do we have an array type to use? Aside from the case where there
1193 : * isn't one, we don't risk using ScalarArrayOpExpr when the common
1194 : * type is RECORD, because the RowExpr comparison logic below can cope
1195 : * with some cases of non-identical row types.
1196 : */
1197 15940 : if (OidIsValid(scalar_type) && scalar_type != RECORDOID)
1198 15916 : array_type = get_array_type(scalar_type);
1199 : else
1200 24 : array_type = InvalidOid;
1201 15940 : if (array_type != InvalidOid)
1202 : {
1203 : /*
1204 : * OK: coerce all the right-hand non-Var inputs to the common type
1205 : * and build an ArrayExpr for them.
1206 : */
1207 : List *aexprs;
1208 : ArrayExpr *newa;
1209 :
1210 15904 : aexprs = NIL;
1211 63802 : foreach(l, rnonvars)
1212 : {
1213 47898 : Node *rexpr = (Node *) lfirst(l);
1214 :
1215 47898 : rexpr = coerce_to_common_type(pstate, rexpr,
1216 : scalar_type,
1217 : "IN");
1218 47898 : aexprs = lappend(aexprs, rexpr);
1219 : }
1220 15904 : newa = makeNode(ArrayExpr);
1221 15904 : newa->array_typeid = array_type;
1222 : /* array_collid will be set by parse_collate.c */
1223 15904 : newa->element_typeid = scalar_type;
1224 15904 : newa->elements = aexprs;
1225 15904 : newa->multidims = false;
1226 15904 : newa->location = -1;
1227 :
1228 15904 : result = (Node *) make_scalar_array_op(pstate,
1229 : a->name,
1230 : useOr,
1231 : lexpr,
1232 : (Node *) newa,
1233 : a->location);
1234 :
1235 : /* Consider only the Vars (if any) in the loop below */
1236 15904 : rexprs = rvars;
1237 : }
1238 : }
1239 :
1240 : /*
1241 : * Must do it the hard way, ie, with a boolean expression tree.
1242 : */
1243 21076 : foreach(l, rexprs)
1244 : {
1245 2604 : Node *rexpr = (Node *) lfirst(l);
1246 : Node *cmp;
1247 :
1248 2604 : if (IsA(lexpr, RowExpr) &&
1249 36 : IsA(rexpr, RowExpr))
1250 : {
1251 : /* ROW() op ROW() is handled specially */
1252 36 : cmp = make_row_comparison_op(pstate,
1253 : a->name,
1254 36 : copyObject(((RowExpr *) lexpr)->args),
1255 : ((RowExpr *) rexpr)->args,
1256 : a->location);
1257 : }
1258 : else
1259 : {
1260 : /* Ordinary scalar operator */
1261 2568 : cmp = (Node *) make_op(pstate,
1262 : a->name,
1263 2568 : copyObject(lexpr),
1264 : rexpr,
1265 : pstate->p_last_srf,
1266 : a->location);
1267 : }
1268 :
1269 2598 : cmp = coerce_to_boolean(pstate, cmp, "IN");
1270 2598 : if (result == NULL)
1271 2568 : result = cmp;
1272 : else
1273 30 : result = (Node *) makeBoolExpr(useOr ? OR_EXPR : AND_EXPR,
1274 30 : list_make2(result, cmp),
1275 : a->location);
1276 : }
1277 :
1278 18472 : return result;
1279 : }
1280 :
1281 : static Node *
1282 514 : transformAExprBetween(ParseState *pstate, A_Expr *a)
1283 : {
1284 : Node *aexpr;
1285 : Node *bexpr;
1286 : Node *cexpr;
1287 : Node *result;
1288 : Node *sub1;
1289 : Node *sub2;
1290 : List *args;
1291 :
1292 : /* Deconstruct A_Expr into three subexprs */
1293 514 : aexpr = a->lexpr;
1294 514 : args = castNode(List, a->rexpr);
1295 : Assert(list_length(args) == 2);
1296 514 : bexpr = (Node *) linitial(args);
1297 514 : cexpr = (Node *) lsecond(args);
1298 :
1299 : /*
1300 : * Build the equivalent comparison expression. Make copies of
1301 : * multiply-referenced subexpressions for safety. (XXX this is really
1302 : * wrong since it results in multiple runtime evaluations of what may be
1303 : * volatile expressions ...)
1304 : *
1305 : * Ideally we would not use hard-wired operators here but instead use
1306 : * opclasses. However, mixed data types and other issues make this
1307 : * difficult:
1308 : * http://archives.postgresql.org/pgsql-hackers/2008-08/msg01142.php
1309 : */
1310 514 : switch (a->kind)
1311 : {
1312 478 : case AEXPR_BETWEEN:
1313 478 : args = list_make2(makeSimpleA_Expr(AEXPR_OP, ">=",
1314 : aexpr, bexpr,
1315 : a->location),
1316 : makeSimpleA_Expr(AEXPR_OP, "<=",
1317 : copyObject(aexpr), cexpr,
1318 : a->location));
1319 478 : result = (Node *) makeBoolExpr(AND_EXPR, args, a->location);
1320 478 : break;
1321 12 : case AEXPR_NOT_BETWEEN:
1322 12 : args = list_make2(makeSimpleA_Expr(AEXPR_OP, "<",
1323 : aexpr, bexpr,
1324 : a->location),
1325 : makeSimpleA_Expr(AEXPR_OP, ">",
1326 : copyObject(aexpr), cexpr,
1327 : a->location));
1328 12 : result = (Node *) makeBoolExpr(OR_EXPR, args, a->location);
1329 12 : break;
1330 12 : case AEXPR_BETWEEN_SYM:
1331 12 : args = list_make2(makeSimpleA_Expr(AEXPR_OP, ">=",
1332 : aexpr, bexpr,
1333 : a->location),
1334 : makeSimpleA_Expr(AEXPR_OP, "<=",
1335 : copyObject(aexpr), cexpr,
1336 : a->location));
1337 12 : sub1 = (Node *) makeBoolExpr(AND_EXPR, args, a->location);
1338 12 : args = list_make2(makeSimpleA_Expr(AEXPR_OP, ">=",
1339 : copyObject(aexpr), copyObject(cexpr),
1340 : a->location),
1341 : makeSimpleA_Expr(AEXPR_OP, "<=",
1342 : copyObject(aexpr), copyObject(bexpr),
1343 : a->location));
1344 12 : sub2 = (Node *) makeBoolExpr(AND_EXPR, args, a->location);
1345 12 : args = list_make2(sub1, sub2);
1346 12 : result = (Node *) makeBoolExpr(OR_EXPR, args, a->location);
1347 12 : break;
1348 12 : case AEXPR_NOT_BETWEEN_SYM:
1349 12 : args = list_make2(makeSimpleA_Expr(AEXPR_OP, "<",
1350 : aexpr, bexpr,
1351 : a->location),
1352 : makeSimpleA_Expr(AEXPR_OP, ">",
1353 : copyObject(aexpr), cexpr,
1354 : a->location));
1355 12 : sub1 = (Node *) makeBoolExpr(OR_EXPR, args, a->location);
1356 12 : args = list_make2(makeSimpleA_Expr(AEXPR_OP, "<",
1357 : copyObject(aexpr), copyObject(cexpr),
1358 : a->location),
1359 : makeSimpleA_Expr(AEXPR_OP, ">",
1360 : copyObject(aexpr), copyObject(bexpr),
1361 : a->location));
1362 12 : sub2 = (Node *) makeBoolExpr(OR_EXPR, args, a->location);
1363 12 : args = list_make2(sub1, sub2);
1364 12 : result = (Node *) makeBoolExpr(AND_EXPR, args, a->location);
1365 12 : break;
1366 0 : default:
1367 0 : elog(ERROR, "unrecognized A_Expr kind: %d", a->kind);
1368 : result = NULL; /* keep compiler quiet */
1369 : break;
1370 : }
1371 :
1372 514 : return transformExprRecurse(pstate, result);
1373 : }
1374 :
1375 : static Node *
1376 168 : transformMergeSupportFunc(ParseState *pstate, MergeSupportFunc *f)
1377 : {
1378 : /*
1379 : * All we need to do is check that we're in the RETURNING list of a MERGE
1380 : * command. If so, we just return the node as-is.
1381 : */
1382 168 : if (pstate->p_expr_kind != EXPR_KIND_MERGE_RETURNING)
1383 : {
1384 18 : ParseState *parent_pstate = pstate->parentParseState;
1385 :
1386 18 : while (parent_pstate &&
1387 6 : parent_pstate->p_expr_kind != EXPR_KIND_MERGE_RETURNING)
1388 0 : parent_pstate = parent_pstate->parentParseState;
1389 :
1390 18 : if (!parent_pstate)
1391 12 : ereport(ERROR,
1392 : errcode(ERRCODE_SYNTAX_ERROR),
1393 : errmsg("MERGE_ACTION() can only be used in the RETURNING list of a MERGE command"),
1394 : parser_errposition(pstate, f->location));
1395 : }
1396 :
1397 156 : return (Node *) f;
1398 : }
1399 :
1400 : static Node *
1401 142964 : transformBoolExpr(ParseState *pstate, BoolExpr *a)
1402 : {
1403 142964 : List *args = NIL;
1404 : const char *opname;
1405 : ListCell *lc;
1406 :
1407 142964 : switch (a->boolop)
1408 : {
1409 116394 : case AND_EXPR:
1410 116394 : opname = "AND";
1411 116394 : break;
1412 12200 : case OR_EXPR:
1413 12200 : opname = "OR";
1414 12200 : break;
1415 14370 : case NOT_EXPR:
1416 14370 : opname = "NOT";
1417 14370 : break;
1418 0 : default:
1419 0 : elog(ERROR, "unrecognized boolop: %d", (int) a->boolop);
1420 : opname = NULL; /* keep compiler quiet */
1421 : break;
1422 : }
1423 :
1424 515608 : foreach(lc, a->args)
1425 : {
1426 372664 : Node *arg = (Node *) lfirst(lc);
1427 :
1428 372664 : arg = transformExprRecurse(pstate, arg);
1429 372644 : arg = coerce_to_boolean(pstate, arg, opname);
1430 372644 : args = lappend(args, arg);
1431 : }
1432 :
1433 142944 : return (Node *) makeBoolExpr(a->boolop, args, a->location);
1434 : }
1435 :
1436 : static Node *
1437 357938 : transformFuncCall(ParseState *pstate, FuncCall *fn)
1438 : {
1439 357938 : Node *last_srf = pstate->p_last_srf;
1440 : List *targs;
1441 : ListCell *args;
1442 :
1443 : /* Transform the list of arguments ... */
1444 357938 : targs = NIL;
1445 886510 : foreach(args, fn->args)
1446 : {
1447 528572 : targs = lappend(targs, transformExprRecurse(pstate,
1448 528632 : (Node *) lfirst(args)));
1449 : }
1450 :
1451 : /*
1452 : * When WITHIN GROUP is used, we treat its ORDER BY expressions as
1453 : * additional arguments to the function, for purposes of function lookup
1454 : * and argument type coercion. So, transform each such expression and add
1455 : * them to the targs list. We don't explicitly mark where each argument
1456 : * came from, but ParseFuncOrColumn can tell what's what by reference to
1457 : * list_length(fn->agg_order).
1458 : */
1459 357878 : if (fn->agg_within_group)
1460 : {
1461 : Assert(fn->agg_order != NIL);
1462 744 : foreach(args, fn->agg_order)
1463 : {
1464 402 : SortBy *arg = (SortBy *) lfirst(args);
1465 :
1466 402 : targs = lappend(targs, transformExpr(pstate, arg->node,
1467 : EXPR_KIND_ORDER_BY));
1468 : }
1469 : }
1470 :
1471 : /* ... and hand off to ParseFuncOrColumn */
1472 357878 : return ParseFuncOrColumn(pstate,
1473 : fn->funcname,
1474 : targs,
1475 : last_srf,
1476 : fn,
1477 : false,
1478 : fn->location);
1479 : }
1480 :
1481 : static Node *
1482 378 : transformMultiAssignRef(ParseState *pstate, MultiAssignRef *maref)
1483 : {
1484 : SubLink *sublink;
1485 : RowExpr *rexpr;
1486 : Query *qtree;
1487 : TargetEntry *tle;
1488 :
1489 : /* We should only see this in first-stage processing of UPDATE tlists */
1490 : Assert(pstate->p_expr_kind == EXPR_KIND_UPDATE_SOURCE);
1491 :
1492 : /* We only need to transform the source if this is the first column */
1493 378 : if (maref->colno == 1)
1494 : {
1495 : /*
1496 : * For now, we only allow EXPR SubLinks and RowExprs as the source of
1497 : * an UPDATE multiassignment. This is sufficient to cover interesting
1498 : * cases; at worst, someone would have to write (SELECT * FROM expr)
1499 : * to expand a composite-returning expression of another form.
1500 : */
1501 184 : if (IsA(maref->source, SubLink) &&
1502 138 : ((SubLink *) maref->source)->subLinkType == EXPR_SUBLINK)
1503 : {
1504 : /* Relabel it as a MULTIEXPR_SUBLINK */
1505 138 : sublink = (SubLink *) maref->source;
1506 138 : sublink->subLinkType = MULTIEXPR_SUBLINK;
1507 : /* And transform it */
1508 138 : sublink = (SubLink *) transformExprRecurse(pstate,
1509 : (Node *) sublink);
1510 :
1511 138 : qtree = castNode(Query, sublink->subselect);
1512 :
1513 : /* Check subquery returns required number of columns */
1514 138 : if (count_nonjunk_tlist_entries(qtree->targetList) != maref->ncolumns)
1515 0 : ereport(ERROR,
1516 : (errcode(ERRCODE_SYNTAX_ERROR),
1517 : errmsg("number of columns does not match number of values"),
1518 : parser_errposition(pstate, sublink->location)));
1519 :
1520 : /*
1521 : * Build a resjunk tlist item containing the MULTIEXPR SubLink,
1522 : * and add it to pstate->p_multiassign_exprs, whence it will later
1523 : * get appended to the completed targetlist. We needn't worry
1524 : * about selecting a resno for it; transformUpdateStmt will do
1525 : * that.
1526 : */
1527 138 : tle = makeTargetEntry((Expr *) sublink, 0, NULL, true);
1528 138 : pstate->p_multiassign_exprs = lappend(pstate->p_multiassign_exprs,
1529 : tle);
1530 :
1531 : /*
1532 : * Assign a unique-within-this-targetlist ID to the MULTIEXPR
1533 : * SubLink. We can just use its position in the
1534 : * p_multiassign_exprs list.
1535 : */
1536 138 : sublink->subLinkId = list_length(pstate->p_multiassign_exprs);
1537 : }
1538 46 : else if (IsA(maref->source, RowExpr))
1539 : {
1540 : /* Transform the RowExpr, allowing SetToDefault items */
1541 40 : rexpr = (RowExpr *) transformRowExpr(pstate,
1542 40 : (RowExpr *) maref->source,
1543 : true);
1544 :
1545 : /* Check it returns required number of columns */
1546 40 : if (list_length(rexpr->args) != maref->ncolumns)
1547 0 : ereport(ERROR,
1548 : (errcode(ERRCODE_SYNTAX_ERROR),
1549 : errmsg("number of columns does not match number of values"),
1550 : parser_errposition(pstate, rexpr->location)));
1551 :
1552 : /*
1553 : * Temporarily append it to p_multiassign_exprs, so we can get it
1554 : * back when we come back here for additional columns.
1555 : */
1556 40 : tle = makeTargetEntry((Expr *) rexpr, 0, NULL, true);
1557 40 : pstate->p_multiassign_exprs = lappend(pstate->p_multiassign_exprs,
1558 : tle);
1559 : }
1560 : else
1561 6 : ereport(ERROR,
1562 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1563 : errmsg("source for a multiple-column UPDATE item must be a sub-SELECT or ROW() expression"),
1564 : parser_errposition(pstate, exprLocation(maref->source))));
1565 : }
1566 : else
1567 : {
1568 : /*
1569 : * Second or later column in a multiassignment. Re-fetch the
1570 : * transformed SubLink or RowExpr, which we assume is still the last
1571 : * entry in p_multiassign_exprs.
1572 : */
1573 : Assert(pstate->p_multiassign_exprs != NIL);
1574 194 : tle = (TargetEntry *) llast(pstate->p_multiassign_exprs);
1575 : }
1576 :
1577 : /*
1578 : * Emit the appropriate output expression for the current column
1579 : */
1580 372 : if (IsA(tle->expr, SubLink))
1581 : {
1582 : Param *param;
1583 :
1584 280 : sublink = (SubLink *) tle->expr;
1585 : Assert(sublink->subLinkType == MULTIEXPR_SUBLINK);
1586 280 : qtree = castNode(Query, sublink->subselect);
1587 :
1588 : /* Build a Param representing the current subquery output column */
1589 280 : tle = (TargetEntry *) list_nth(qtree->targetList, maref->colno - 1);
1590 : Assert(!tle->resjunk);
1591 :
1592 280 : param = makeNode(Param);
1593 280 : param->paramkind = PARAM_MULTIEXPR;
1594 280 : param->paramid = (sublink->subLinkId << 16) | maref->colno;
1595 280 : param->paramtype = exprType((Node *) tle->expr);
1596 280 : param->paramtypmod = exprTypmod((Node *) tle->expr);
1597 280 : param->paramcollid = exprCollation((Node *) tle->expr);
1598 280 : param->location = exprLocation((Node *) tle->expr);
1599 :
1600 280 : return (Node *) param;
1601 : }
1602 :
1603 92 : if (IsA(tle->expr, RowExpr))
1604 : {
1605 : Node *result;
1606 :
1607 92 : rexpr = (RowExpr *) tle->expr;
1608 :
1609 : /* Just extract and return the next element of the RowExpr */
1610 92 : result = (Node *) list_nth(rexpr->args, maref->colno - 1);
1611 :
1612 : /*
1613 : * If we're at the last column, delete the RowExpr from
1614 : * p_multiassign_exprs; we don't need it anymore, and don't want it in
1615 : * the finished UPDATE tlist. We assume this is still the last entry
1616 : * in p_multiassign_exprs.
1617 : */
1618 92 : if (maref->colno == maref->ncolumns)
1619 40 : pstate->p_multiassign_exprs =
1620 40 : list_delete_last(pstate->p_multiassign_exprs);
1621 :
1622 92 : return result;
1623 : }
1624 :
1625 0 : elog(ERROR, "unexpected expr type in multiassign list");
1626 : return NULL; /* keep compiler quiet */
1627 : }
1628 :
1629 : static Node *
1630 54756 : transformCaseExpr(ParseState *pstate, CaseExpr *c)
1631 : {
1632 54756 : CaseExpr *newc = makeNode(CaseExpr);
1633 54756 : Node *last_srf = pstate->p_last_srf;
1634 : Node *arg;
1635 : CaseTestExpr *placeholder;
1636 : List *newargs;
1637 : List *resultexprs;
1638 : ListCell *l;
1639 : Node *defresult;
1640 : Oid ptype;
1641 :
1642 : /* transform the test expression, if any */
1643 54756 : arg = transformExprRecurse(pstate, (Node *) c->arg);
1644 :
1645 : /* generate placeholder for test expression */
1646 54756 : if (arg)
1647 : {
1648 : /*
1649 : * If test expression is an untyped literal, force it to text. We have
1650 : * to do something now because we won't be able to do this coercion on
1651 : * the placeholder. This is not as flexible as what was done in 7.4
1652 : * and before, but it's good enough to handle the sort of silly coding
1653 : * commonly seen.
1654 : */
1655 5808 : if (exprType(arg) == UNKNOWNOID)
1656 6 : arg = coerce_to_common_type(pstate, arg, TEXTOID, "CASE");
1657 :
1658 : /*
1659 : * Run collation assignment on the test expression so that we know
1660 : * what collation to mark the placeholder with. In principle we could
1661 : * leave it to parse_collate.c to do that later, but propagating the
1662 : * result to the CaseTestExpr would be unnecessarily complicated.
1663 : */
1664 5808 : assign_expr_collations(pstate, arg);
1665 :
1666 5808 : placeholder = makeNode(CaseTestExpr);
1667 5808 : placeholder->typeId = exprType(arg);
1668 5808 : placeholder->typeMod = exprTypmod(arg);
1669 5808 : placeholder->collation = exprCollation(arg);
1670 : }
1671 : else
1672 48948 : placeholder = NULL;
1673 :
1674 54756 : newc->arg = (Expr *) arg;
1675 :
1676 : /* transform the list of arguments */
1677 54756 : newargs = NIL;
1678 54756 : resultexprs = NIL;
1679 152640 : foreach(l, c->args)
1680 : {
1681 97884 : CaseWhen *w = lfirst_node(CaseWhen, l);
1682 97884 : CaseWhen *neww = makeNode(CaseWhen);
1683 : Node *warg;
1684 :
1685 97884 : warg = (Node *) w->expr;
1686 97884 : if (placeholder)
1687 : {
1688 : /* shorthand form was specified, so expand... */
1689 22900 : warg = (Node *) makeSimpleA_Expr(AEXPR_OP, "=",
1690 : (Node *) placeholder,
1691 : warg,
1692 : w->location);
1693 : }
1694 97884 : neww->expr = (Expr *) transformExprRecurse(pstate, warg);
1695 :
1696 195768 : neww->expr = (Expr *) coerce_to_boolean(pstate,
1697 97884 : (Node *) neww->expr,
1698 : "CASE/WHEN");
1699 :
1700 97884 : warg = (Node *) w->result;
1701 97884 : neww->result = (Expr *) transformExprRecurse(pstate, warg);
1702 97884 : neww->location = w->location;
1703 :
1704 97884 : newargs = lappend(newargs, neww);
1705 97884 : resultexprs = lappend(resultexprs, neww->result);
1706 : }
1707 :
1708 54756 : newc->args = newargs;
1709 :
1710 : /* transform the default clause */
1711 54756 : defresult = (Node *) c->defresult;
1712 54756 : if (defresult == NULL)
1713 : {
1714 8520 : A_Const *n = makeNode(A_Const);
1715 :
1716 8520 : n->isnull = true;
1717 8520 : n->location = -1;
1718 8520 : defresult = (Node *) n;
1719 : }
1720 54756 : newc->defresult = (Expr *) transformExprRecurse(pstate, defresult);
1721 :
1722 : /*
1723 : * Note: default result is considered the most significant type in
1724 : * determining preferred type. This is how the code worked before, but it
1725 : * seems a little bogus to me --- tgl
1726 : */
1727 54756 : resultexprs = lcons(newc->defresult, resultexprs);
1728 :
1729 54756 : ptype = select_common_type(pstate, resultexprs, "CASE", NULL);
1730 : Assert(OidIsValid(ptype));
1731 54756 : newc->casetype = ptype;
1732 : /* casecollid will be set by parse_collate.c */
1733 :
1734 : /* Convert default result clause, if necessary */
1735 54756 : newc->defresult = (Expr *)
1736 54756 : coerce_to_common_type(pstate,
1737 54756 : (Node *) newc->defresult,
1738 : ptype,
1739 : "CASE/ELSE");
1740 :
1741 : /* Convert when-clause results, if necessary */
1742 152640 : foreach(l, newc->args)
1743 : {
1744 97884 : CaseWhen *w = (CaseWhen *) lfirst(l);
1745 :
1746 97884 : w->result = (Expr *)
1747 97884 : coerce_to_common_type(pstate,
1748 97884 : (Node *) w->result,
1749 : ptype,
1750 : "CASE/WHEN");
1751 : }
1752 :
1753 : /* if any subexpression contained a SRF, complain */
1754 54756 : if (pstate->p_last_srf != last_srf)
1755 6 : ereport(ERROR,
1756 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1757 : /* translator: %s is name of a SQL construct, eg GROUP BY */
1758 : errmsg("set-returning functions are not allowed in %s",
1759 : "CASE"),
1760 : errhint("You might be able to move the set-returning function into a LATERAL FROM item."),
1761 : parser_errposition(pstate,
1762 : exprLocation(pstate->p_last_srf))));
1763 :
1764 54750 : newc->location = c->location;
1765 :
1766 54750 : return (Node *) newc;
1767 : }
1768 :
1769 : static Node *
1770 40332 : transformSubLink(ParseState *pstate, SubLink *sublink)
1771 : {
1772 40332 : Node *result = (Node *) sublink;
1773 : Query *qtree;
1774 : const char *err;
1775 :
1776 : /*
1777 : * Check to see if the sublink is in an invalid place within the query. We
1778 : * allow sublinks everywhere in SELECT/INSERT/UPDATE/DELETE/MERGE, but
1779 : * generally not in utility statements.
1780 : */
1781 40332 : err = NULL;
1782 40332 : switch (pstate->p_expr_kind)
1783 : {
1784 0 : case EXPR_KIND_NONE:
1785 : Assert(false); /* can't happen */
1786 0 : break;
1787 0 : case EXPR_KIND_OTHER:
1788 : /* Accept sublink here; caller must throw error if wanted */
1789 0 : break;
1790 40296 : case EXPR_KIND_JOIN_ON:
1791 : case EXPR_KIND_JOIN_USING:
1792 : case EXPR_KIND_FROM_SUBSELECT:
1793 : case EXPR_KIND_FROM_FUNCTION:
1794 : case EXPR_KIND_WHERE:
1795 : case EXPR_KIND_POLICY:
1796 : case EXPR_KIND_HAVING:
1797 : case EXPR_KIND_FILTER:
1798 : case EXPR_KIND_WINDOW_PARTITION:
1799 : case EXPR_KIND_WINDOW_ORDER:
1800 : case EXPR_KIND_WINDOW_FRAME_RANGE:
1801 : case EXPR_KIND_WINDOW_FRAME_ROWS:
1802 : case EXPR_KIND_WINDOW_FRAME_GROUPS:
1803 : case EXPR_KIND_SELECT_TARGET:
1804 : case EXPR_KIND_INSERT_TARGET:
1805 : case EXPR_KIND_UPDATE_SOURCE:
1806 : case EXPR_KIND_UPDATE_TARGET:
1807 : case EXPR_KIND_MERGE_WHEN:
1808 : case EXPR_KIND_GROUP_BY:
1809 : case EXPR_KIND_ORDER_BY:
1810 : case EXPR_KIND_DISTINCT_ON:
1811 : case EXPR_KIND_LIMIT:
1812 : case EXPR_KIND_OFFSET:
1813 : case EXPR_KIND_RETURNING:
1814 : case EXPR_KIND_MERGE_RETURNING:
1815 : case EXPR_KIND_VALUES:
1816 : case EXPR_KIND_VALUES_SINGLE:
1817 : case EXPR_KIND_CYCLE_MARK:
1818 : /* okay */
1819 40296 : break;
1820 0 : case EXPR_KIND_CHECK_CONSTRAINT:
1821 : case EXPR_KIND_DOMAIN_CHECK:
1822 0 : err = _("cannot use subquery in check constraint");
1823 0 : break;
1824 6 : case EXPR_KIND_COLUMN_DEFAULT:
1825 : case EXPR_KIND_FUNCTION_DEFAULT:
1826 6 : err = _("cannot use subquery in DEFAULT expression");
1827 6 : break;
1828 0 : case EXPR_KIND_INDEX_EXPRESSION:
1829 0 : err = _("cannot use subquery in index expression");
1830 0 : break;
1831 0 : case EXPR_KIND_INDEX_PREDICATE:
1832 0 : err = _("cannot use subquery in index predicate");
1833 0 : break;
1834 0 : case EXPR_KIND_STATS_EXPRESSION:
1835 0 : err = _("cannot use subquery in statistics expression");
1836 0 : break;
1837 0 : case EXPR_KIND_ALTER_COL_TRANSFORM:
1838 0 : err = _("cannot use subquery in transform expression");
1839 0 : break;
1840 0 : case EXPR_KIND_EXECUTE_PARAMETER:
1841 0 : err = _("cannot use subquery in EXECUTE parameter");
1842 0 : break;
1843 0 : case EXPR_KIND_TRIGGER_WHEN:
1844 0 : err = _("cannot use subquery in trigger WHEN condition");
1845 0 : break;
1846 12 : case EXPR_KIND_PARTITION_BOUND:
1847 12 : err = _("cannot use subquery in partition bound");
1848 12 : break;
1849 6 : case EXPR_KIND_PARTITION_EXPRESSION:
1850 6 : err = _("cannot use subquery in partition key expression");
1851 6 : break;
1852 0 : case EXPR_KIND_CALL_ARGUMENT:
1853 0 : err = _("cannot use subquery in CALL argument");
1854 0 : break;
1855 6 : case EXPR_KIND_COPY_WHERE:
1856 6 : err = _("cannot use subquery in COPY FROM WHERE condition");
1857 6 : break;
1858 6 : case EXPR_KIND_GENERATED_COLUMN:
1859 6 : err = _("cannot use subquery in column generation expression");
1860 6 : break;
1861 :
1862 : /*
1863 : * There is intentionally no default: case here, so that the
1864 : * compiler will warn if we add a new ParseExprKind without
1865 : * extending this switch. If we do see an unrecognized value at
1866 : * runtime, the behavior will be the same as for EXPR_KIND_OTHER,
1867 : * which is sane anyway.
1868 : */
1869 : }
1870 40332 : if (err)
1871 36 : ereport(ERROR,
1872 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1873 : errmsg_internal("%s", err),
1874 : parser_errposition(pstate, sublink->location)));
1875 :
1876 40296 : pstate->p_hasSubLinks = true;
1877 :
1878 : /*
1879 : * OK, let's transform the sub-SELECT.
1880 : */
1881 40296 : qtree = parse_sub_analyze(sublink->subselect, pstate, NULL, false, true);
1882 :
1883 : /*
1884 : * Check that we got a SELECT. Anything else should be impossible given
1885 : * restrictions of the grammar, but check anyway.
1886 : */
1887 40254 : if (!IsA(qtree, Query) ||
1888 40254 : qtree->commandType != CMD_SELECT)
1889 0 : elog(ERROR, "unexpected non-SELECT command in SubLink");
1890 :
1891 40254 : sublink->subselect = (Node *) qtree;
1892 :
1893 40254 : if (sublink->subLinkType == EXISTS_SUBLINK)
1894 : {
1895 : /*
1896 : * EXISTS needs no test expression or combining operator. These fields
1897 : * should be null already, but make sure.
1898 : */
1899 5304 : sublink->testexpr = NULL;
1900 5304 : sublink->operName = NIL;
1901 : }
1902 34950 : else if (sublink->subLinkType == EXPR_SUBLINK ||
1903 10558 : sublink->subLinkType == ARRAY_SUBLINK)
1904 : {
1905 : /*
1906 : * Make sure the subselect delivers a single column (ignoring resjunk
1907 : * targets).
1908 : */
1909 32090 : if (count_nonjunk_tlist_entries(qtree->targetList) != 1)
1910 0 : ereport(ERROR,
1911 : (errcode(ERRCODE_SYNTAX_ERROR),
1912 : errmsg("subquery must return only one column"),
1913 : parser_errposition(pstate, sublink->location)));
1914 :
1915 : /*
1916 : * EXPR and ARRAY need no test expression or combining operator. These
1917 : * fields should be null already, but make sure.
1918 : */
1919 32090 : sublink->testexpr = NULL;
1920 32090 : sublink->operName = NIL;
1921 : }
1922 2860 : else if (sublink->subLinkType == MULTIEXPR_SUBLINK)
1923 : {
1924 : /* Same as EXPR case, except no restriction on number of columns */
1925 138 : sublink->testexpr = NULL;
1926 138 : sublink->operName = NIL;
1927 : }
1928 : else
1929 : {
1930 : /* ALL, ANY, or ROWCOMPARE: generate row-comparing expression */
1931 : Node *lefthand;
1932 : List *left_list;
1933 : List *right_list;
1934 : ListCell *l;
1935 :
1936 : /*
1937 : * If the source was "x IN (select)", convert to "x = ANY (select)".
1938 : */
1939 2722 : if (sublink->operName == NIL)
1940 2526 : sublink->operName = list_make1(makeString("="));
1941 :
1942 : /*
1943 : * Transform lefthand expression, and convert to a list
1944 : */
1945 2722 : lefthand = transformExprRecurse(pstate, sublink->testexpr);
1946 2722 : if (lefthand && IsA(lefthand, RowExpr))
1947 270 : left_list = ((RowExpr *) lefthand)->args;
1948 : else
1949 2452 : left_list = list_make1(lefthand);
1950 :
1951 : /*
1952 : * Build a list of PARAM_SUBLINK nodes representing the output columns
1953 : * of the subquery.
1954 : */
1955 2722 : right_list = NIL;
1956 5886 : foreach(l, qtree->targetList)
1957 : {
1958 3164 : TargetEntry *tent = (TargetEntry *) lfirst(l);
1959 : Param *param;
1960 :
1961 3164 : if (tent->resjunk)
1962 12 : continue;
1963 :
1964 3152 : param = makeNode(Param);
1965 3152 : param->paramkind = PARAM_SUBLINK;
1966 3152 : param->paramid = tent->resno;
1967 3152 : param->paramtype = exprType((Node *) tent->expr);
1968 3152 : param->paramtypmod = exprTypmod((Node *) tent->expr);
1969 3152 : param->paramcollid = exprCollation((Node *) tent->expr);
1970 3152 : param->location = -1;
1971 :
1972 3152 : right_list = lappend(right_list, param);
1973 : }
1974 :
1975 : /*
1976 : * We could rely on make_row_comparison_op to complain if the list
1977 : * lengths differ, but we prefer to generate a more specific error
1978 : * message.
1979 : */
1980 2722 : if (list_length(left_list) < list_length(right_list))
1981 0 : ereport(ERROR,
1982 : (errcode(ERRCODE_SYNTAX_ERROR),
1983 : errmsg("subquery has too many columns"),
1984 : parser_errposition(pstate, sublink->location)));
1985 2722 : if (list_length(left_list) > list_length(right_list))
1986 0 : ereport(ERROR,
1987 : (errcode(ERRCODE_SYNTAX_ERROR),
1988 : errmsg("subquery has too few columns"),
1989 : parser_errposition(pstate, sublink->location)));
1990 :
1991 : /*
1992 : * Identify the combining operator(s) and generate a suitable
1993 : * row-comparison expression.
1994 : */
1995 2722 : sublink->testexpr = make_row_comparison_op(pstate,
1996 : sublink->operName,
1997 : left_list,
1998 : right_list,
1999 : sublink->location);
2000 : }
2001 :
2002 40242 : return result;
2003 : }
2004 :
2005 : /*
2006 : * transformArrayExpr
2007 : *
2008 : * If the caller specifies the target type, the resulting array will
2009 : * be of exactly that type. Otherwise we try to infer a common type
2010 : * for the elements using select_common_type().
2011 : */
2012 : static Node *
2013 7596 : transformArrayExpr(ParseState *pstate, A_ArrayExpr *a,
2014 : Oid array_type, Oid element_type, int32 typmod)
2015 : {
2016 7596 : ArrayExpr *newa = makeNode(ArrayExpr);
2017 7596 : List *newelems = NIL;
2018 7596 : List *newcoercedelems = NIL;
2019 : ListCell *element;
2020 : Oid coerce_type;
2021 : bool coerce_hard;
2022 :
2023 : /*
2024 : * Transform the element expressions
2025 : *
2026 : * Assume that the array is one-dimensional unless we find an array-type
2027 : * element expression.
2028 : */
2029 7596 : newa->multidims = false;
2030 25254 : foreach(element, a->elements)
2031 : {
2032 17658 : Node *e = (Node *) lfirst(element);
2033 : Node *newe;
2034 :
2035 : /*
2036 : * If an element is itself an A_ArrayExpr, recurse directly so that we
2037 : * can pass down any target type we were given.
2038 : */
2039 17658 : if (IsA(e, A_ArrayExpr))
2040 : {
2041 814 : newe = transformArrayExpr(pstate,
2042 : (A_ArrayExpr *) e,
2043 : array_type,
2044 : element_type,
2045 : typmod);
2046 : /* we certainly have an array here */
2047 : Assert(array_type == InvalidOid || array_type == exprType(newe));
2048 814 : newa->multidims = true;
2049 : }
2050 : else
2051 : {
2052 16844 : newe = transformExprRecurse(pstate, e);
2053 :
2054 : /*
2055 : * Check for sub-array expressions, if we haven't already found
2056 : * one.
2057 : */
2058 16844 : if (!newa->multidims && type_is_array(exprType(newe)))
2059 6 : newa->multidims = true;
2060 : }
2061 :
2062 17658 : newelems = lappend(newelems, newe);
2063 : }
2064 :
2065 : /*
2066 : * Select a target type for the elements.
2067 : *
2068 : * If we haven't been given a target array type, we must try to deduce a
2069 : * common type based on the types of the individual elements present.
2070 : */
2071 7596 : if (OidIsValid(array_type))
2072 : {
2073 : /* Caller must ensure array_type matches element_type */
2074 : Assert(OidIsValid(element_type));
2075 816 : coerce_type = (newa->multidims ? array_type : element_type);
2076 816 : coerce_hard = true;
2077 : }
2078 : else
2079 : {
2080 : /* Can't handle an empty array without a target type */
2081 6780 : if (newelems == NIL)
2082 6 : ereport(ERROR,
2083 : (errcode(ERRCODE_INDETERMINATE_DATATYPE),
2084 : errmsg("cannot determine type of empty array"),
2085 : errhint("Explicitly cast to the desired type, "
2086 : "for example ARRAY[]::integer[]."),
2087 : parser_errposition(pstate, a->location)));
2088 :
2089 : /* Select a common type for the elements */
2090 6774 : coerce_type = select_common_type(pstate, newelems, "ARRAY", NULL);
2091 :
2092 6774 : if (newa->multidims)
2093 : {
2094 392 : array_type = coerce_type;
2095 392 : element_type = get_element_type(array_type);
2096 392 : if (!OidIsValid(element_type))
2097 0 : ereport(ERROR,
2098 : (errcode(ERRCODE_UNDEFINED_OBJECT),
2099 : errmsg("could not find element type for data type %s",
2100 : format_type_be(array_type)),
2101 : parser_errposition(pstate, a->location)));
2102 : }
2103 : else
2104 : {
2105 6382 : element_type = coerce_type;
2106 6382 : array_type = get_array_type(element_type);
2107 6382 : if (!OidIsValid(array_type))
2108 0 : ereport(ERROR,
2109 : (errcode(ERRCODE_UNDEFINED_OBJECT),
2110 : errmsg("could not find array type for data type %s",
2111 : format_type_be(element_type)),
2112 : parser_errposition(pstate, a->location)));
2113 : }
2114 6774 : coerce_hard = false;
2115 : }
2116 :
2117 : /*
2118 : * Coerce elements to target type
2119 : *
2120 : * If the array has been explicitly cast, then the elements are in turn
2121 : * explicitly coerced.
2122 : *
2123 : * If the array's type was merely derived from the common type of its
2124 : * elements, then the elements are implicitly coerced to the common type.
2125 : * This is consistent with other uses of select_common_type().
2126 : */
2127 25248 : foreach(element, newelems)
2128 : {
2129 17658 : Node *e = (Node *) lfirst(element);
2130 : Node *newe;
2131 :
2132 17658 : if (coerce_hard)
2133 : {
2134 2002 : newe = coerce_to_target_type(pstate, e,
2135 : exprType(e),
2136 : coerce_type,
2137 : typmod,
2138 : COERCION_EXPLICIT,
2139 : COERCE_EXPLICIT_CAST,
2140 : -1);
2141 2002 : if (newe == NULL)
2142 0 : ereport(ERROR,
2143 : (errcode(ERRCODE_CANNOT_COERCE),
2144 : errmsg("cannot cast type %s to %s",
2145 : format_type_be(exprType(e)),
2146 : format_type_be(coerce_type)),
2147 : parser_errposition(pstate, exprLocation(e))));
2148 : }
2149 : else
2150 15656 : newe = coerce_to_common_type(pstate, e,
2151 : coerce_type,
2152 : "ARRAY");
2153 17658 : newcoercedelems = lappend(newcoercedelems, newe);
2154 : }
2155 :
2156 7590 : newa->array_typeid = array_type;
2157 : /* array_collid will be set by parse_collate.c */
2158 7590 : newa->element_typeid = element_type;
2159 7590 : newa->elements = newcoercedelems;
2160 7590 : newa->location = a->location;
2161 :
2162 7590 : return (Node *) newa;
2163 : }
2164 :
2165 : static Node *
2166 5690 : transformRowExpr(ParseState *pstate, RowExpr *r, bool allowDefault)
2167 : {
2168 : RowExpr *newr;
2169 : char fname[16];
2170 : int fnum;
2171 :
2172 5690 : newr = makeNode(RowExpr);
2173 :
2174 : /* Transform the field expressions */
2175 5690 : newr->args = transformExpressionList(pstate, r->args,
2176 : pstate->p_expr_kind, allowDefault);
2177 :
2178 : /* Disallow more columns than will fit in a tuple */
2179 5690 : if (list_length(newr->args) > MaxTupleAttributeNumber)
2180 0 : ereport(ERROR,
2181 : (errcode(ERRCODE_TOO_MANY_COLUMNS),
2182 : errmsg("ROW expressions can have at most %d entries",
2183 : MaxTupleAttributeNumber),
2184 : parser_errposition(pstate, r->location)));
2185 :
2186 : /* Barring later casting, we consider the type RECORD */
2187 5690 : newr->row_typeid = RECORDOID;
2188 5690 : newr->row_format = COERCE_IMPLICIT_CAST;
2189 :
2190 : /* ROW() has anonymous columns, so invent some field names */
2191 5690 : newr->colnames = NIL;
2192 20058 : for (fnum = 1; fnum <= list_length(newr->args); fnum++)
2193 : {
2194 14368 : snprintf(fname, sizeof(fname), "f%d", fnum);
2195 14368 : newr->colnames = lappend(newr->colnames, makeString(pstrdup(fname)));
2196 : }
2197 :
2198 5690 : newr->location = r->location;
2199 :
2200 5690 : return (Node *) newr;
2201 : }
2202 :
2203 : static Node *
2204 2954 : transformCoalesceExpr(ParseState *pstate, CoalesceExpr *c)
2205 : {
2206 2954 : CoalesceExpr *newc = makeNode(CoalesceExpr);
2207 2954 : Node *last_srf = pstate->p_last_srf;
2208 2954 : List *newargs = NIL;
2209 2954 : List *newcoercedargs = NIL;
2210 : ListCell *args;
2211 :
2212 8796 : foreach(args, c->args)
2213 : {
2214 5842 : Node *e = (Node *) lfirst(args);
2215 : Node *newe;
2216 :
2217 5842 : newe = transformExprRecurse(pstate, e);
2218 5842 : newargs = lappend(newargs, newe);
2219 : }
2220 :
2221 2954 : newc->coalescetype = select_common_type(pstate, newargs, "COALESCE", NULL);
2222 : /* coalescecollid will be set by parse_collate.c */
2223 :
2224 : /* Convert arguments if necessary */
2225 8796 : foreach(args, newargs)
2226 : {
2227 5842 : Node *e = (Node *) lfirst(args);
2228 : Node *newe;
2229 :
2230 5842 : newe = coerce_to_common_type(pstate, e,
2231 : newc->coalescetype,
2232 : "COALESCE");
2233 5842 : newcoercedargs = lappend(newcoercedargs, newe);
2234 : }
2235 :
2236 : /* if any subexpression contained a SRF, complain */
2237 2954 : if (pstate->p_last_srf != last_srf)
2238 6 : ereport(ERROR,
2239 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2240 : /* translator: %s is name of a SQL construct, eg GROUP BY */
2241 : errmsg("set-returning functions are not allowed in %s",
2242 : "COALESCE"),
2243 : errhint("You might be able to move the set-returning function into a LATERAL FROM item."),
2244 : parser_errposition(pstate,
2245 : exprLocation(pstate->p_last_srf))));
2246 :
2247 2948 : newc->args = newcoercedargs;
2248 2948 : newc->location = c->location;
2249 2948 : return (Node *) newc;
2250 : }
2251 :
2252 : static Node *
2253 256 : transformMinMaxExpr(ParseState *pstate, MinMaxExpr *m)
2254 : {
2255 256 : MinMaxExpr *newm = makeNode(MinMaxExpr);
2256 256 : List *newargs = NIL;
2257 256 : List *newcoercedargs = NIL;
2258 256 : const char *funcname = (m->op == IS_GREATEST) ? "GREATEST" : "LEAST";
2259 : ListCell *args;
2260 :
2261 256 : newm->op = m->op;
2262 822 : foreach(args, m->args)
2263 : {
2264 566 : Node *e = (Node *) lfirst(args);
2265 : Node *newe;
2266 :
2267 566 : newe = transformExprRecurse(pstate, e);
2268 566 : newargs = lappend(newargs, newe);
2269 : }
2270 :
2271 256 : newm->minmaxtype = select_common_type(pstate, newargs, funcname, NULL);
2272 : /* minmaxcollid and inputcollid will be set by parse_collate.c */
2273 :
2274 : /* Convert arguments if necessary */
2275 822 : foreach(args, newargs)
2276 : {
2277 566 : Node *e = (Node *) lfirst(args);
2278 : Node *newe;
2279 :
2280 566 : newe = coerce_to_common_type(pstate, e,
2281 : newm->minmaxtype,
2282 : funcname);
2283 566 : newcoercedargs = lappend(newcoercedargs, newe);
2284 : }
2285 :
2286 256 : newm->args = newcoercedargs;
2287 256 : newm->location = m->location;
2288 256 : return (Node *) newm;
2289 : }
2290 :
2291 : static Node *
2292 2638 : transformSQLValueFunction(ParseState *pstate, SQLValueFunction *svf)
2293 : {
2294 : /*
2295 : * All we need to do is insert the correct result type and (where needed)
2296 : * validate the typmod, so we just modify the node in-place.
2297 : */
2298 2638 : switch (svf->op)
2299 : {
2300 288 : case SVFOP_CURRENT_DATE:
2301 288 : svf->type = DATEOID;
2302 288 : break;
2303 24 : case SVFOP_CURRENT_TIME:
2304 24 : svf->type = TIMETZOID;
2305 24 : break;
2306 24 : case SVFOP_CURRENT_TIME_N:
2307 24 : svf->type = TIMETZOID;
2308 24 : svf->typmod = anytime_typmod_check(true, svf->typmod);
2309 24 : break;
2310 288 : case SVFOP_CURRENT_TIMESTAMP:
2311 288 : svf->type = TIMESTAMPTZOID;
2312 288 : break;
2313 116 : case SVFOP_CURRENT_TIMESTAMP_N:
2314 116 : svf->type = TIMESTAMPTZOID;
2315 116 : svf->typmod = anytimestamp_typmod_check(true, svf->typmod);
2316 116 : break;
2317 24 : case SVFOP_LOCALTIME:
2318 24 : svf->type = TIMEOID;
2319 24 : break;
2320 24 : case SVFOP_LOCALTIME_N:
2321 24 : svf->type = TIMEOID;
2322 24 : svf->typmod = anytime_typmod_check(false, svf->typmod);
2323 24 : break;
2324 36 : case SVFOP_LOCALTIMESTAMP:
2325 36 : svf->type = TIMESTAMPOID;
2326 36 : break;
2327 24 : case SVFOP_LOCALTIMESTAMP_N:
2328 24 : svf->type = TIMESTAMPOID;
2329 24 : svf->typmod = anytimestamp_typmod_check(false, svf->typmod);
2330 24 : break;
2331 1790 : case SVFOP_CURRENT_ROLE:
2332 : case SVFOP_CURRENT_USER:
2333 : case SVFOP_USER:
2334 : case SVFOP_SESSION_USER:
2335 : case SVFOP_CURRENT_CATALOG:
2336 : case SVFOP_CURRENT_SCHEMA:
2337 1790 : svf->type = NAMEOID;
2338 1790 : break;
2339 : }
2340 :
2341 2638 : return (Node *) svf;
2342 : }
2343 :
2344 : static Node *
2345 596 : transformXmlExpr(ParseState *pstate, XmlExpr *x)
2346 : {
2347 : XmlExpr *newx;
2348 : ListCell *lc;
2349 : int i;
2350 :
2351 596 : newx = makeNode(XmlExpr);
2352 596 : newx->op = x->op;
2353 596 : if (x->name)
2354 258 : newx->name = map_sql_identifier_to_xml_name(x->name, false, false);
2355 : else
2356 338 : newx->name = NULL;
2357 596 : newx->xmloption = x->xmloption;
2358 596 : newx->type = XMLOID; /* this just marks the node as transformed */
2359 596 : newx->typmod = -1;
2360 596 : newx->location = x->location;
2361 :
2362 : /*
2363 : * gram.y built the named args as a list of ResTarget. Transform each,
2364 : * and break the names out as a separate list.
2365 : */
2366 596 : newx->named_args = NIL;
2367 596 : newx->arg_names = NIL;
2368 :
2369 816 : foreach(lc, x->named_args)
2370 : {
2371 232 : ResTarget *r = lfirst_node(ResTarget, lc);
2372 : Node *expr;
2373 : char *argname;
2374 :
2375 232 : expr = transformExprRecurse(pstate, r->val);
2376 :
2377 232 : if (r->name)
2378 106 : argname = map_sql_identifier_to_xml_name(r->name, false, false);
2379 126 : else if (IsA(r->val, ColumnRef))
2380 120 : argname = map_sql_identifier_to_xml_name(FigureColname(r->val),
2381 : true, false);
2382 : else
2383 : {
2384 6 : ereport(ERROR,
2385 : (errcode(ERRCODE_SYNTAX_ERROR),
2386 : x->op == IS_XMLELEMENT
2387 : ? errmsg("unnamed XML attribute value must be a column reference")
2388 : : errmsg("unnamed XML element value must be a column reference"),
2389 : parser_errposition(pstate, r->location)));
2390 : argname = NULL; /* keep compiler quiet */
2391 : }
2392 :
2393 : /* reject duplicate argnames in XMLELEMENT only */
2394 226 : if (x->op == IS_XMLELEMENT)
2395 : {
2396 : ListCell *lc2;
2397 :
2398 120 : foreach(lc2, newx->arg_names)
2399 : {
2400 38 : if (strcmp(argname, strVal(lfirst(lc2))) == 0)
2401 6 : ereport(ERROR,
2402 : (errcode(ERRCODE_SYNTAX_ERROR),
2403 : errmsg("XML attribute name \"%s\" appears more than once",
2404 : argname),
2405 : parser_errposition(pstate, r->location)));
2406 : }
2407 : }
2408 :
2409 220 : newx->named_args = lappend(newx->named_args, expr);
2410 220 : newx->arg_names = lappend(newx->arg_names, makeString(argname));
2411 : }
2412 :
2413 : /* The other arguments are of varying types depending on the function */
2414 584 : newx->args = NIL;
2415 584 : i = 0;
2416 1402 : foreach(lc, x->args)
2417 : {
2418 836 : Node *e = (Node *) lfirst(lc);
2419 : Node *newe;
2420 :
2421 836 : newe = transformExprRecurse(pstate, e);
2422 836 : switch (x->op)
2423 : {
2424 130 : case IS_XMLCONCAT:
2425 130 : newe = coerce_to_specific_type(pstate, newe, XMLOID,
2426 : "XMLCONCAT");
2427 118 : break;
2428 136 : case IS_XMLELEMENT:
2429 : /* no coercion necessary */
2430 136 : break;
2431 0 : case IS_XMLFOREST:
2432 0 : newe = coerce_to_specific_type(pstate, newe, XMLOID,
2433 : "XMLFOREST");
2434 0 : break;
2435 280 : case IS_XMLPARSE:
2436 280 : if (i == 0)
2437 140 : newe = coerce_to_specific_type(pstate, newe, TEXTOID,
2438 : "XMLPARSE");
2439 : else
2440 140 : newe = coerce_to_boolean(pstate, newe, "XMLPARSE");
2441 280 : break;
2442 50 : case IS_XMLPI:
2443 50 : newe = coerce_to_specific_type(pstate, newe, TEXTOID,
2444 : "XMLPI");
2445 50 : break;
2446 204 : case IS_XMLROOT:
2447 204 : if (i == 0)
2448 68 : newe = coerce_to_specific_type(pstate, newe, XMLOID,
2449 : "XMLROOT");
2450 136 : else if (i == 1)
2451 68 : newe = coerce_to_specific_type(pstate, newe, TEXTOID,
2452 : "XMLROOT");
2453 : else
2454 68 : newe = coerce_to_specific_type(pstate, newe, INT4OID,
2455 : "XMLROOT");
2456 204 : break;
2457 0 : case IS_XMLSERIALIZE:
2458 : /* not handled here */
2459 : Assert(false);
2460 0 : break;
2461 36 : case IS_DOCUMENT:
2462 36 : newe = coerce_to_specific_type(pstate, newe, XMLOID,
2463 : "IS DOCUMENT");
2464 30 : break;
2465 : }
2466 818 : newx->args = lappend(newx->args, newe);
2467 818 : i++;
2468 : }
2469 :
2470 566 : return (Node *) newx;
2471 : }
2472 :
2473 : static Node *
2474 202 : transformXmlSerialize(ParseState *pstate, XmlSerialize *xs)
2475 : {
2476 : Node *result;
2477 : XmlExpr *xexpr;
2478 : Oid targetType;
2479 : int32 targetTypmod;
2480 :
2481 202 : xexpr = makeNode(XmlExpr);
2482 202 : xexpr->op = IS_XMLSERIALIZE;
2483 202 : xexpr->args = list_make1(coerce_to_specific_type(pstate,
2484 : transformExprRecurse(pstate, xs->expr),
2485 : XMLOID,
2486 : "XMLSERIALIZE"));
2487 :
2488 202 : typenameTypeIdAndMod(pstate, xs->typeName, &targetType, &targetTypmod);
2489 :
2490 202 : xexpr->xmloption = xs->xmloption;
2491 202 : xexpr->indent = xs->indent;
2492 202 : xexpr->location = xs->location;
2493 : /* We actually only need these to be able to parse back the expression. */
2494 202 : xexpr->type = targetType;
2495 202 : xexpr->typmod = targetTypmod;
2496 :
2497 : /*
2498 : * The actual target type is determined this way. SQL allows char and
2499 : * varchar as target types. We allow anything that can be cast implicitly
2500 : * from text. This way, user-defined text-like data types automatically
2501 : * fit in.
2502 : */
2503 202 : result = coerce_to_target_type(pstate, (Node *) xexpr,
2504 : TEXTOID, targetType, targetTypmod,
2505 : COERCION_IMPLICIT,
2506 : COERCE_IMPLICIT_CAST,
2507 : -1);
2508 202 : if (result == NULL)
2509 0 : ereport(ERROR,
2510 : (errcode(ERRCODE_CANNOT_COERCE),
2511 : errmsg("cannot cast XMLSERIALIZE result to %s",
2512 : format_type_be(targetType)),
2513 : parser_errposition(pstate, xexpr->location)));
2514 202 : return result;
2515 : }
2516 :
2517 : static Node *
2518 806 : transformBooleanTest(ParseState *pstate, BooleanTest *b)
2519 : {
2520 : const char *clausename;
2521 :
2522 806 : switch (b->booltesttype)
2523 : {
2524 372 : case IS_TRUE:
2525 372 : clausename = "IS TRUE";
2526 372 : break;
2527 140 : case IS_NOT_TRUE:
2528 140 : clausename = "IS NOT TRUE";
2529 140 : break;
2530 102 : case IS_FALSE:
2531 102 : clausename = "IS FALSE";
2532 102 : break;
2533 92 : case IS_NOT_FALSE:
2534 92 : clausename = "IS NOT FALSE";
2535 92 : break;
2536 52 : case IS_UNKNOWN:
2537 52 : clausename = "IS UNKNOWN";
2538 52 : break;
2539 48 : case IS_NOT_UNKNOWN:
2540 48 : clausename = "IS NOT UNKNOWN";
2541 48 : break;
2542 0 : default:
2543 0 : elog(ERROR, "unrecognized booltesttype: %d",
2544 : (int) b->booltesttype);
2545 : clausename = NULL; /* keep compiler quiet */
2546 : }
2547 :
2548 806 : b->arg = (Expr *) transformExprRecurse(pstate, (Node *) b->arg);
2549 :
2550 1612 : b->arg = (Expr *) coerce_to_boolean(pstate,
2551 806 : (Node *) b->arg,
2552 : clausename);
2553 :
2554 806 : return (Node *) b;
2555 : }
2556 :
2557 : static Node *
2558 254 : transformCurrentOfExpr(ParseState *pstate, CurrentOfExpr *cexpr)
2559 : {
2560 : /* CURRENT OF can only appear at top level of UPDATE/DELETE */
2561 : Assert(pstate->p_target_nsitem != NULL);
2562 254 : cexpr->cvarno = pstate->p_target_nsitem->p_rtindex;
2563 :
2564 : /*
2565 : * Check to see if the cursor name matches a parameter of type REFCURSOR.
2566 : * If so, replace the raw name reference with a parameter reference. (This
2567 : * is a hack for the convenience of plpgsql.)
2568 : */
2569 254 : if (cexpr->cursor_name != NULL) /* in case already transformed */
2570 : {
2571 254 : ColumnRef *cref = makeNode(ColumnRef);
2572 254 : Node *node = NULL;
2573 :
2574 : /* Build an unqualified ColumnRef with the given name */
2575 254 : cref->fields = list_make1(makeString(cexpr->cursor_name));
2576 254 : cref->location = -1;
2577 :
2578 : /* See if there is a translation available from a parser hook */
2579 254 : if (pstate->p_pre_columnref_hook != NULL)
2580 12 : node = pstate->p_pre_columnref_hook(pstate, cref);
2581 254 : if (node == NULL && pstate->p_post_columnref_hook != NULL)
2582 12 : node = pstate->p_post_columnref_hook(pstate, cref, NULL);
2583 :
2584 : /*
2585 : * XXX Should we throw an error if we get a translation that isn't a
2586 : * refcursor Param? For now it seems best to silently ignore false
2587 : * matches.
2588 : */
2589 254 : if (node != NULL && IsA(node, Param))
2590 : {
2591 12 : Param *p = (Param *) node;
2592 :
2593 12 : if (p->paramkind == PARAM_EXTERN &&
2594 12 : p->paramtype == REFCURSOROID)
2595 : {
2596 : /* Matches, so convert CURRENT OF to a param reference */
2597 12 : cexpr->cursor_name = NULL;
2598 12 : cexpr->cursor_param = p->paramid;
2599 : }
2600 : }
2601 : }
2602 :
2603 254 : return (Node *) cexpr;
2604 : }
2605 :
2606 : /*
2607 : * Construct a whole-row reference to represent the notation "relation.*".
2608 : */
2609 : static Node *
2610 8230 : transformWholeRowRef(ParseState *pstate, ParseNamespaceItem *nsitem,
2611 : int sublevels_up, int location)
2612 : {
2613 : /*
2614 : * Build the appropriate referencing node. Normally this can be a
2615 : * whole-row Var, but if the nsitem is a JOIN USING alias then it contains
2616 : * only a subset of the columns of the underlying join RTE, so that will
2617 : * not work. Instead we immediately expand the reference into a RowExpr.
2618 : * Since the JOIN USING's common columns are fully determined at this
2619 : * point, there seems no harm in expanding it now rather than during
2620 : * planning.
2621 : *
2622 : * Note that if the nsitem is an OLD/NEW alias for the target RTE (as can
2623 : * appear in a RETURNING list), its alias won't match the target RTE's
2624 : * alias, but we still want to make a whole-row Var here rather than a
2625 : * RowExpr, for consistency with direct references to the target RTE, and
2626 : * so that any dropped columns are handled correctly. Thus we also check
2627 : * p_returning_type here.
2628 : *
2629 : * Note that if the RTE is a function returning scalar, we create just a
2630 : * plain reference to the function value, not a composite containing a
2631 : * single column. This is pretty inconsistent at first sight, but it's
2632 : * what we've done historically. One argument for it is that "rel" and
2633 : * "rel.*" mean the same thing for composite relations, so why not for
2634 : * scalar functions...
2635 : */
2636 8230 : if (nsitem->p_names == nsitem->p_rte->eref ||
2637 276 : nsitem->p_returning_type != VAR_RETURNING_DEFAULT)
2638 : {
2639 : Var *result;
2640 :
2641 8218 : result = makeWholeRowVar(nsitem->p_rte, nsitem->p_rtindex,
2642 : sublevels_up, true);
2643 :
2644 : /* mark Var for RETURNING OLD/NEW, as necessary */
2645 8218 : result->varreturningtype = nsitem->p_returning_type;
2646 :
2647 : /* location is not filled in by makeWholeRowVar */
2648 8218 : result->location = location;
2649 :
2650 : /* mark Var if it's nulled by any outer joins */
2651 8218 : markNullableIfNeeded(pstate, result);
2652 :
2653 : /* mark relation as requiring whole-row SELECT access */
2654 8218 : markVarForSelectPriv(pstate, result);
2655 :
2656 8218 : return (Node *) result;
2657 : }
2658 : else
2659 : {
2660 : RowExpr *rowexpr;
2661 : List *fields;
2662 :
2663 : /*
2664 : * We want only as many columns as are listed in p_names->colnames,
2665 : * and we should use those names not whatever possibly-aliased names
2666 : * are in the RTE. We needn't worry about marking the RTE for SELECT
2667 : * access, as the common columns are surely so marked already.
2668 : */
2669 12 : expandRTE(nsitem->p_rte, nsitem->p_rtindex, sublevels_up,
2670 : nsitem->p_returning_type, location, false, NULL, &fields);
2671 12 : rowexpr = makeNode(RowExpr);
2672 12 : rowexpr->args = list_truncate(fields,
2673 12 : list_length(nsitem->p_names->colnames));
2674 12 : rowexpr->row_typeid = RECORDOID;
2675 12 : rowexpr->row_format = COERCE_IMPLICIT_CAST;
2676 12 : rowexpr->colnames = copyObject(nsitem->p_names->colnames);
2677 12 : rowexpr->location = location;
2678 :
2679 : /* XXX we ought to mark the row as possibly nullable */
2680 :
2681 12 : return (Node *) rowexpr;
2682 : }
2683 : }
2684 :
2685 : /*
2686 : * Handle an explicit CAST construct.
2687 : *
2688 : * Transform the argument, look up the type name, and apply any necessary
2689 : * coercion function(s).
2690 : */
2691 : static Node *
2692 266784 : transformTypeCast(ParseState *pstate, TypeCast *tc)
2693 : {
2694 : Node *result;
2695 266784 : Node *arg = tc->arg;
2696 : Node *expr;
2697 : Oid inputType;
2698 : Oid targetType;
2699 : int32 targetTypmod;
2700 : int location;
2701 :
2702 : /* Look up the type name first */
2703 266784 : typenameTypeIdAndMod(pstate, tc->typeName, &targetType, &targetTypmod);
2704 :
2705 : /*
2706 : * If the subject of the typecast is an ARRAY[] construct and the target
2707 : * type is an array type, we invoke transformArrayExpr() directly so that
2708 : * we can pass down the type information. This avoids some cases where
2709 : * transformArrayExpr() might not infer the correct type. Otherwise, just
2710 : * transform the argument normally.
2711 : */
2712 266784 : if (IsA(arg, A_ArrayExpr))
2713 : {
2714 : Oid targetBaseType;
2715 : int32 targetBaseTypmod;
2716 : Oid elementType;
2717 :
2718 : /*
2719 : * If target is a domain over array, work with the base array type
2720 : * here. Below, we'll cast the array type to the domain. In the
2721 : * usual case that the target is not a domain, the remaining steps
2722 : * will be a no-op.
2723 : */
2724 698 : targetBaseTypmod = targetTypmod;
2725 698 : targetBaseType = getBaseTypeAndTypmod(targetType, &targetBaseTypmod);
2726 698 : elementType = get_element_type(targetBaseType);
2727 698 : if (OidIsValid(elementType))
2728 : {
2729 688 : expr = transformArrayExpr(pstate,
2730 : (A_ArrayExpr *) arg,
2731 : targetBaseType,
2732 : elementType,
2733 : targetBaseTypmod);
2734 : }
2735 : else
2736 10 : expr = transformExprRecurse(pstate, arg);
2737 : }
2738 : else
2739 266086 : expr = transformExprRecurse(pstate, arg);
2740 :
2741 266766 : inputType = exprType(expr);
2742 266766 : if (inputType == InvalidOid)
2743 0 : return expr; /* do nothing if NULL input */
2744 :
2745 : /*
2746 : * Location of the coercion is preferentially the location of the :: or
2747 : * CAST symbol, but if there is none then use the location of the type
2748 : * name (this can happen in TypeName 'string' syntax, for instance).
2749 : */
2750 266766 : location = tc->location;
2751 266766 : if (location < 0)
2752 17056 : location = tc->typeName->location;
2753 :
2754 266766 : result = coerce_to_target_type(pstate, expr, inputType,
2755 : targetType, targetTypmod,
2756 : COERCION_EXPLICIT,
2757 : COERCE_EXPLICIT_CAST,
2758 : location);
2759 263448 : if (result == NULL)
2760 22 : ereport(ERROR,
2761 : (errcode(ERRCODE_CANNOT_COERCE),
2762 : errmsg("cannot cast type %s to %s",
2763 : format_type_be(inputType),
2764 : format_type_be(targetType)),
2765 : parser_coercion_errposition(pstate, location, expr)));
2766 :
2767 263426 : return result;
2768 : }
2769 :
2770 : /*
2771 : * Handle an explicit COLLATE clause.
2772 : *
2773 : * Transform the argument, and look up the collation name.
2774 : */
2775 : static Node *
2776 8516 : transformCollateClause(ParseState *pstate, CollateClause *c)
2777 : {
2778 : CollateExpr *newc;
2779 : Oid argtype;
2780 :
2781 8516 : newc = makeNode(CollateExpr);
2782 8516 : newc->arg = (Expr *) transformExprRecurse(pstate, c->arg);
2783 :
2784 8516 : argtype = exprType((Node *) newc->arg);
2785 :
2786 : /*
2787 : * The unknown type is not collatable, but coerce_type() takes care of it
2788 : * separately, so we'll let it go here.
2789 : */
2790 8516 : if (!type_is_collatable(argtype) && argtype != UNKNOWNOID)
2791 18 : ereport(ERROR,
2792 : (errcode(ERRCODE_DATATYPE_MISMATCH),
2793 : errmsg("collations are not supported by type %s",
2794 : format_type_be(argtype)),
2795 : parser_errposition(pstate, c->location)));
2796 :
2797 8498 : newc->collOid = LookupCollation(pstate, c->collname, c->location);
2798 8498 : newc->location = c->location;
2799 :
2800 8498 : return (Node *) newc;
2801 : }
2802 :
2803 : /*
2804 : * Transform a "row compare-op row" construct
2805 : *
2806 : * The inputs are lists of already-transformed expressions.
2807 : * As with coerce_type, pstate may be NULL if no special unknown-Param
2808 : * processing is wanted.
2809 : *
2810 : * The output may be a single OpExpr, an AND or OR combination of OpExprs,
2811 : * or a RowCompareExpr. In all cases it is guaranteed to return boolean.
2812 : * The AND, OR, and RowCompareExpr cases further imply things about the
2813 : * behavior of the operators (ie, they behave as =, <>, or < <= > >=).
2814 : */
2815 : static Node *
2816 3452 : make_row_comparison_op(ParseState *pstate, List *opname,
2817 : List *largs, List *rargs, int location)
2818 : {
2819 : RowCompareExpr *rcexpr;
2820 : CompareType cmptype;
2821 : List *opexprs;
2822 : List *opnos;
2823 : List *opfamilies;
2824 : ListCell *l,
2825 : *r;
2826 : List **opinfo_lists;
2827 : Bitmapset *strats;
2828 : int nopers;
2829 : int i;
2830 :
2831 3452 : nopers = list_length(largs);
2832 3452 : if (nopers != list_length(rargs))
2833 0 : ereport(ERROR,
2834 : (errcode(ERRCODE_SYNTAX_ERROR),
2835 : errmsg("unequal number of entries in row expressions"),
2836 : parser_errposition(pstate, location)));
2837 :
2838 : /*
2839 : * We can't compare zero-length rows because there is no principled basis
2840 : * for figuring out what the operator is.
2841 : */
2842 3452 : if (nopers == 0)
2843 6 : ereport(ERROR,
2844 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2845 : errmsg("cannot compare rows of zero length"),
2846 : parser_errposition(pstate, location)));
2847 :
2848 : /*
2849 : * Identify all the pairwise operators, using make_op so that behavior is
2850 : * the same as in the simple scalar case.
2851 : */
2852 3446 : opexprs = NIL;
2853 8100 : forboth(l, largs, r, rargs)
2854 : {
2855 4666 : Node *larg = (Node *) lfirst(l);
2856 4666 : Node *rarg = (Node *) lfirst(r);
2857 : OpExpr *cmp;
2858 :
2859 4666 : cmp = castNode(OpExpr, make_op(pstate, opname, larg, rarg,
2860 : pstate->p_last_srf, location));
2861 :
2862 : /*
2863 : * We don't use coerce_to_boolean here because we insist on the
2864 : * operator yielding boolean directly, not via coercion. If it
2865 : * doesn't yield bool it won't be in any index opfamilies...
2866 : */
2867 4654 : if (cmp->opresulttype != BOOLOID)
2868 0 : ereport(ERROR,
2869 : (errcode(ERRCODE_DATATYPE_MISMATCH),
2870 : errmsg("row comparison operator must yield type boolean, "
2871 : "not type %s",
2872 : format_type_be(cmp->opresulttype)),
2873 : parser_errposition(pstate, location)));
2874 4654 : if (expression_returns_set((Node *) cmp))
2875 0 : ereport(ERROR,
2876 : (errcode(ERRCODE_DATATYPE_MISMATCH),
2877 : errmsg("row comparison operator must not return a set"),
2878 : parser_errposition(pstate, location)));
2879 4654 : opexprs = lappend(opexprs, cmp);
2880 : }
2881 :
2882 : /*
2883 : * If rows are length 1, just return the single operator. In this case we
2884 : * don't insist on identifying btree semantics for the operator (but we
2885 : * still require it to return boolean).
2886 : */
2887 3434 : if (nopers == 1)
2888 2458 : return (Node *) linitial(opexprs);
2889 :
2890 : /*
2891 : * Now we must determine which row comparison semantics (= <> < <= > >=)
2892 : * apply to this set of operators. We look for btree opfamilies
2893 : * containing the operators, and see which interpretations (strategy
2894 : * numbers) exist for each operator.
2895 : */
2896 976 : opinfo_lists = (List **) palloc(nopers * sizeof(List *));
2897 976 : strats = NULL;
2898 976 : i = 0;
2899 3172 : foreach(l, opexprs)
2900 : {
2901 2196 : Oid opno = ((OpExpr *) lfirst(l))->opno;
2902 : Bitmapset *this_strats;
2903 : ListCell *j;
2904 :
2905 2196 : opinfo_lists[i] = get_op_btree_interpretation(opno);
2906 :
2907 : /*
2908 : * convert strategy numbers into a Bitmapset to make the intersection
2909 : * calculation easy.
2910 : */
2911 2196 : this_strats = NULL;
2912 4538 : foreach(j, opinfo_lists[i])
2913 : {
2914 2342 : OpBtreeInterpretation *opinfo = lfirst(j);
2915 :
2916 2342 : this_strats = bms_add_member(this_strats, opinfo->strategy);
2917 : }
2918 2196 : if (i == 0)
2919 976 : strats = this_strats;
2920 : else
2921 1220 : strats = bms_int_members(strats, this_strats);
2922 2196 : i++;
2923 : }
2924 :
2925 : /*
2926 : * If there are multiple common interpretations, we may use any one of
2927 : * them ... this coding arbitrarily picks the lowest btree strategy
2928 : * number.
2929 : */
2930 976 : i = bms_next_member(strats, -1);
2931 976 : if (i < 0)
2932 : {
2933 : /* No common interpretation, so fail */
2934 6 : ereport(ERROR,
2935 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2936 : errmsg("could not determine interpretation of row comparison operator %s",
2937 : strVal(llast(opname))),
2938 : errhint("Row comparison operators must be associated with btree operator families."),
2939 : parser_errposition(pstate, location)));
2940 : }
2941 970 : cmptype = (CompareType) i;
2942 :
2943 : /*
2944 : * For = and <> cases, we just combine the pairwise operators with AND or
2945 : * OR respectively.
2946 : */
2947 970 : if (cmptype == COMPARE_EQ)
2948 380 : return (Node *) makeBoolExpr(AND_EXPR, opexprs, location);
2949 590 : if (cmptype == COMPARE_NE)
2950 356 : return (Node *) makeBoolExpr(OR_EXPR, opexprs, location);
2951 :
2952 : /*
2953 : * Otherwise we need to choose exactly which opfamily to associate with
2954 : * each operator.
2955 : */
2956 234 : opfamilies = NIL;
2957 756 : for (i = 0; i < nopers; i++)
2958 : {
2959 522 : Oid opfamily = InvalidOid;
2960 : ListCell *j;
2961 :
2962 522 : foreach(j, opinfo_lists[i])
2963 : {
2964 522 : OpBtreeInterpretation *opinfo = lfirst(j);
2965 :
2966 522 : if (opinfo->strategy == cmptype)
2967 : {
2968 522 : opfamily = opinfo->opfamily_id;
2969 522 : break;
2970 : }
2971 : }
2972 522 : if (OidIsValid(opfamily))
2973 522 : opfamilies = lappend_oid(opfamilies, opfamily);
2974 : else /* should not happen */
2975 0 : ereport(ERROR,
2976 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2977 : errmsg("could not determine interpretation of row comparison operator %s",
2978 : strVal(llast(opname))),
2979 : errdetail("There are multiple equally-plausible candidates."),
2980 : parser_errposition(pstate, location)));
2981 : }
2982 :
2983 : /*
2984 : * Now deconstruct the OpExprs and create a RowCompareExpr.
2985 : *
2986 : * Note: can't just reuse the passed largs/rargs lists, because of
2987 : * possibility that make_op inserted coercion operations.
2988 : */
2989 234 : opnos = NIL;
2990 234 : largs = NIL;
2991 234 : rargs = NIL;
2992 756 : foreach(l, opexprs)
2993 : {
2994 522 : OpExpr *cmp = (OpExpr *) lfirst(l);
2995 :
2996 522 : opnos = lappend_oid(opnos, cmp->opno);
2997 522 : largs = lappend(largs, linitial(cmp->args));
2998 522 : rargs = lappend(rargs, lsecond(cmp->args));
2999 : }
3000 :
3001 234 : rcexpr = makeNode(RowCompareExpr);
3002 234 : rcexpr->cmptype = cmptype;
3003 234 : rcexpr->opnos = opnos;
3004 234 : rcexpr->opfamilies = opfamilies;
3005 234 : rcexpr->inputcollids = NIL; /* assign_expr_collations will fix this */
3006 234 : rcexpr->largs = largs;
3007 234 : rcexpr->rargs = rargs;
3008 :
3009 234 : return (Node *) rcexpr;
3010 : }
3011 :
3012 : /*
3013 : * Transform a "row IS DISTINCT FROM row" construct
3014 : *
3015 : * The input RowExprs are already transformed
3016 : */
3017 : static Node *
3018 6 : make_row_distinct_op(ParseState *pstate, List *opname,
3019 : RowExpr *lrow, RowExpr *rrow,
3020 : int location)
3021 : {
3022 6 : Node *result = NULL;
3023 6 : List *largs = lrow->args;
3024 6 : List *rargs = rrow->args;
3025 : ListCell *l,
3026 : *r;
3027 :
3028 6 : if (list_length(largs) != list_length(rargs))
3029 0 : ereport(ERROR,
3030 : (errcode(ERRCODE_SYNTAX_ERROR),
3031 : errmsg("unequal number of entries in row expressions"),
3032 : parser_errposition(pstate, location)));
3033 :
3034 24 : forboth(l, largs, r, rargs)
3035 : {
3036 18 : Node *larg = (Node *) lfirst(l);
3037 18 : Node *rarg = (Node *) lfirst(r);
3038 : Node *cmp;
3039 :
3040 18 : cmp = (Node *) make_distinct_op(pstate, opname, larg, rarg, location);
3041 18 : if (result == NULL)
3042 6 : result = cmp;
3043 : else
3044 12 : result = (Node *) makeBoolExpr(OR_EXPR,
3045 12 : list_make2(result, cmp),
3046 : location);
3047 : }
3048 :
3049 6 : if (result == NULL)
3050 : {
3051 : /* zero-length rows? Generate constant FALSE */
3052 0 : result = makeBoolConst(false, false);
3053 : }
3054 :
3055 6 : return result;
3056 : }
3057 :
3058 : /*
3059 : * make the node for an IS DISTINCT FROM operator
3060 : */
3061 : static Expr *
3062 908 : make_distinct_op(ParseState *pstate, List *opname, Node *ltree, Node *rtree,
3063 : int location)
3064 : {
3065 : Expr *result;
3066 :
3067 908 : result = make_op(pstate, opname, ltree, rtree,
3068 : pstate->p_last_srf, location);
3069 908 : if (((OpExpr *) result)->opresulttype != BOOLOID)
3070 0 : ereport(ERROR,
3071 : (errcode(ERRCODE_DATATYPE_MISMATCH),
3072 : /* translator: %s is name of a SQL construct, eg NULLIF */
3073 : errmsg("%s requires = operator to yield boolean",
3074 : "IS DISTINCT FROM"),
3075 : parser_errposition(pstate, location)));
3076 908 : if (((OpExpr *) result)->opretset)
3077 0 : ereport(ERROR,
3078 : (errcode(ERRCODE_DATATYPE_MISMATCH),
3079 : /* translator: %s is name of a SQL construct, eg NULLIF */
3080 : errmsg("%s must not return a set", "IS DISTINCT FROM"),
3081 : parser_errposition(pstate, location)));
3082 :
3083 : /*
3084 : * We rely on DistinctExpr and OpExpr being same struct
3085 : */
3086 908 : NodeSetTag(result, T_DistinctExpr);
3087 :
3088 908 : return result;
3089 : }
3090 :
3091 : /*
3092 : * Produce a NullTest node from an IS [NOT] DISTINCT FROM NULL construct
3093 : *
3094 : * "arg" is the untransformed other argument
3095 : */
3096 : static Node *
3097 30 : make_nulltest_from_distinct(ParseState *pstate, A_Expr *distincta, Node *arg)
3098 : {
3099 30 : NullTest *nt = makeNode(NullTest);
3100 :
3101 30 : nt->arg = (Expr *) transformExprRecurse(pstate, arg);
3102 : /* the argument can be any type, so don't coerce it */
3103 30 : if (distincta->kind == AEXPR_NOT_DISTINCT)
3104 12 : nt->nulltesttype = IS_NULL;
3105 : else
3106 18 : nt->nulltesttype = IS_NOT_NULL;
3107 : /* argisrow = false is correct whether or not arg is composite */
3108 30 : nt->argisrow = false;
3109 30 : nt->location = distincta->location;
3110 30 : return (Node *) nt;
3111 : }
3112 :
3113 : /*
3114 : * Produce a string identifying an expression by kind.
3115 : *
3116 : * Note: when practical, use a simple SQL keyword for the result. If that
3117 : * doesn't work well, check call sites to see whether custom error message
3118 : * strings are required.
3119 : */
3120 : const char *
3121 78 : ParseExprKindName(ParseExprKind exprKind)
3122 : {
3123 78 : switch (exprKind)
3124 : {
3125 0 : case EXPR_KIND_NONE:
3126 0 : return "invalid expression context";
3127 0 : case EXPR_KIND_OTHER:
3128 0 : return "extension expression";
3129 0 : case EXPR_KIND_JOIN_ON:
3130 0 : return "JOIN/ON";
3131 0 : case EXPR_KIND_JOIN_USING:
3132 0 : return "JOIN/USING";
3133 0 : case EXPR_KIND_FROM_SUBSELECT:
3134 0 : return "sub-SELECT in FROM";
3135 0 : case EXPR_KIND_FROM_FUNCTION:
3136 0 : return "function in FROM";
3137 24 : case EXPR_KIND_WHERE:
3138 24 : return "WHERE";
3139 0 : case EXPR_KIND_POLICY:
3140 0 : return "POLICY";
3141 0 : case EXPR_KIND_HAVING:
3142 0 : return "HAVING";
3143 12 : case EXPR_KIND_FILTER:
3144 12 : return "FILTER";
3145 0 : case EXPR_KIND_WINDOW_PARTITION:
3146 0 : return "window PARTITION BY";
3147 0 : case EXPR_KIND_WINDOW_ORDER:
3148 0 : return "window ORDER BY";
3149 0 : case EXPR_KIND_WINDOW_FRAME_RANGE:
3150 0 : return "window RANGE";
3151 0 : case EXPR_KIND_WINDOW_FRAME_ROWS:
3152 0 : return "window ROWS";
3153 0 : case EXPR_KIND_WINDOW_FRAME_GROUPS:
3154 0 : return "window GROUPS";
3155 0 : case EXPR_KIND_SELECT_TARGET:
3156 0 : return "SELECT";
3157 0 : case EXPR_KIND_INSERT_TARGET:
3158 0 : return "INSERT";
3159 6 : case EXPR_KIND_UPDATE_SOURCE:
3160 : case EXPR_KIND_UPDATE_TARGET:
3161 6 : return "UPDATE";
3162 0 : case EXPR_KIND_MERGE_WHEN:
3163 0 : return "MERGE WHEN";
3164 12 : case EXPR_KIND_GROUP_BY:
3165 12 : return "GROUP BY";
3166 0 : case EXPR_KIND_ORDER_BY:
3167 0 : return "ORDER BY";
3168 0 : case EXPR_KIND_DISTINCT_ON:
3169 0 : return "DISTINCT ON";
3170 6 : case EXPR_KIND_LIMIT:
3171 6 : return "LIMIT";
3172 0 : case EXPR_KIND_OFFSET:
3173 0 : return "OFFSET";
3174 12 : case EXPR_KIND_RETURNING:
3175 : case EXPR_KIND_MERGE_RETURNING:
3176 12 : return "RETURNING";
3177 6 : case EXPR_KIND_VALUES:
3178 : case EXPR_KIND_VALUES_SINGLE:
3179 6 : return "VALUES";
3180 0 : case EXPR_KIND_CHECK_CONSTRAINT:
3181 : case EXPR_KIND_DOMAIN_CHECK:
3182 0 : return "CHECK";
3183 0 : case EXPR_KIND_COLUMN_DEFAULT:
3184 : case EXPR_KIND_FUNCTION_DEFAULT:
3185 0 : return "DEFAULT";
3186 0 : case EXPR_KIND_INDEX_EXPRESSION:
3187 0 : return "index expression";
3188 0 : case EXPR_KIND_INDEX_PREDICATE:
3189 0 : return "index predicate";
3190 0 : case EXPR_KIND_STATS_EXPRESSION:
3191 0 : return "statistics expression";
3192 0 : case EXPR_KIND_ALTER_COL_TRANSFORM:
3193 0 : return "USING";
3194 0 : case EXPR_KIND_EXECUTE_PARAMETER:
3195 0 : return "EXECUTE";
3196 0 : case EXPR_KIND_TRIGGER_WHEN:
3197 0 : return "WHEN";
3198 0 : case EXPR_KIND_PARTITION_BOUND:
3199 0 : return "partition bound";
3200 0 : case EXPR_KIND_PARTITION_EXPRESSION:
3201 0 : return "PARTITION BY";
3202 0 : case EXPR_KIND_CALL_ARGUMENT:
3203 0 : return "CALL";
3204 0 : case EXPR_KIND_COPY_WHERE:
3205 0 : return "WHERE";
3206 0 : case EXPR_KIND_GENERATED_COLUMN:
3207 0 : return "GENERATED AS";
3208 0 : case EXPR_KIND_CYCLE_MARK:
3209 0 : return "CYCLE";
3210 :
3211 : /*
3212 : * There is intentionally no default: case here, so that the
3213 : * compiler will warn if we add a new ParseExprKind without
3214 : * extending this switch. If we do see an unrecognized value at
3215 : * runtime, we'll fall through to the "unrecognized" return.
3216 : */
3217 : }
3218 0 : return "unrecognized expression kind";
3219 : }
3220 :
3221 : /*
3222 : * Make string Const node from JSON encoding name.
3223 : *
3224 : * UTF8 is default encoding.
3225 : */
3226 : static Const *
3227 192 : getJsonEncodingConst(JsonFormat *format)
3228 : {
3229 : JsonEncoding encoding;
3230 : const char *enc;
3231 192 : Name encname = palloc(sizeof(NameData));
3232 :
3233 192 : if (!format ||
3234 192 : format->format_type == JS_FORMAT_DEFAULT ||
3235 132 : format->encoding == JS_ENC_DEFAULT)
3236 168 : encoding = JS_ENC_UTF8;
3237 : else
3238 24 : encoding = format->encoding;
3239 :
3240 192 : switch (encoding)
3241 : {
3242 0 : case JS_ENC_UTF16:
3243 0 : enc = "UTF16";
3244 0 : break;
3245 0 : case JS_ENC_UTF32:
3246 0 : enc = "UTF32";
3247 0 : break;
3248 192 : case JS_ENC_UTF8:
3249 192 : enc = "UTF8";
3250 192 : break;
3251 0 : default:
3252 0 : elog(ERROR, "invalid JSON encoding: %d", encoding);
3253 : break;
3254 : }
3255 :
3256 192 : namestrcpy(encname, enc);
3257 :
3258 192 : return makeConst(NAMEOID, -1, InvalidOid, NAMEDATALEN,
3259 : NameGetDatum(encname), false, false);
3260 : }
3261 :
3262 : /*
3263 : * Make bytea => text conversion using specified JSON format encoding.
3264 : */
3265 : static Node *
3266 132 : makeJsonByteaToTextConversion(Node *expr, JsonFormat *format, int location)
3267 : {
3268 132 : Const *encoding = getJsonEncodingConst(format);
3269 132 : FuncExpr *fexpr = makeFuncExpr(F_CONVERT_FROM, TEXTOID,
3270 132 : list_make2(expr, encoding),
3271 : InvalidOid, InvalidOid,
3272 : COERCE_EXPLICIT_CALL);
3273 :
3274 132 : fexpr->location = location;
3275 :
3276 132 : return (Node *) fexpr;
3277 : }
3278 :
3279 : /*
3280 : * Transform JSON value expression using specified input JSON format or
3281 : * default format otherwise, coercing to the targettype if needed.
3282 : *
3283 : * Returned expression is either ve->raw_expr coerced to text (if needed) or
3284 : * a JsonValueExpr with formatted_expr set to the coerced copy of raw_expr
3285 : * if the specified format and the targettype requires it.
3286 : */
3287 : static Node *
3288 5708 : transformJsonValueExpr(ParseState *pstate, const char *constructName,
3289 : JsonValueExpr *ve, JsonFormatType default_format,
3290 : Oid targettype, bool isarg)
3291 : {
3292 5708 : Node *expr = transformExprRecurse(pstate, (Node *) ve->raw_expr);
3293 : Node *rawexpr;
3294 : JsonFormatType format;
3295 : Oid exprtype;
3296 : int location;
3297 : char typcategory;
3298 : bool typispreferred;
3299 :
3300 5708 : if (exprType(expr) == UNKNOWNOID)
3301 680 : expr = coerce_to_specific_type(pstate, expr, TEXTOID, constructName);
3302 :
3303 5708 : rawexpr = expr;
3304 5708 : exprtype = exprType(expr);
3305 5708 : location = exprLocation(expr);
3306 :
3307 5708 : get_type_category_preferred(exprtype, &typcategory, &typispreferred);
3308 :
3309 5708 : if (ve->format->format_type != JS_FORMAT_DEFAULT)
3310 : {
3311 246 : if (ve->format->encoding != JS_ENC_DEFAULT && exprtype != BYTEAOID)
3312 28 : ereport(ERROR,
3313 : errcode(ERRCODE_DATATYPE_MISMATCH),
3314 : errmsg("JSON ENCODING clause is only allowed for bytea input type"),
3315 : parser_errposition(pstate, ve->format->location));
3316 :
3317 218 : if (exprtype == JSONOID || exprtype == JSONBOID)
3318 12 : format = JS_FORMAT_DEFAULT; /* do not format json[b] types */
3319 : else
3320 206 : format = ve->format->format_type;
3321 : }
3322 5462 : else if (isarg)
3323 : {
3324 : /*
3325 : * Special treatment for PASSING arguments.
3326 : *
3327 : * Pass types supported by GetJsonPathVar() / JsonItemFromDatum()
3328 : * directly without converting to json[b].
3329 : */
3330 1200 : switch (exprtype)
3331 : {
3332 930 : case BOOLOID:
3333 : case NUMERICOID:
3334 : case INT2OID:
3335 : case INT4OID:
3336 : case INT8OID:
3337 : case FLOAT4OID:
3338 : case FLOAT8OID:
3339 : case TEXTOID:
3340 : case VARCHAROID:
3341 : case DATEOID:
3342 : case TIMEOID:
3343 : case TIMETZOID:
3344 : case TIMESTAMPOID:
3345 : case TIMESTAMPTZOID:
3346 930 : return expr;
3347 :
3348 270 : default:
3349 270 : if (typcategory == TYPCATEGORY_STRING)
3350 0 : return expr;
3351 : /* else convert argument to json[b] type */
3352 270 : break;
3353 : }
3354 :
3355 270 : format = default_format;
3356 : }
3357 4262 : else if (exprtype == JSONOID || exprtype == JSONBOID)
3358 3012 : format = JS_FORMAT_DEFAULT; /* do not format json[b] types */
3359 : else
3360 1250 : format = default_format;
3361 :
3362 4750 : if (format != JS_FORMAT_DEFAULT ||
3363 2966 : (OidIsValid(targettype) && exprtype != targettype))
3364 : {
3365 : Node *coerced;
3366 754 : bool only_allow_cast = OidIsValid(targettype);
3367 :
3368 : /*
3369 : * PASSING args are handled appropriately by GetJsonPathVar() /
3370 : * JsonItemFromDatum().
3371 : */
3372 754 : if (!isarg &&
3373 484 : !only_allow_cast &&
3374 200 : exprtype != BYTEAOID && typcategory != TYPCATEGORY_STRING)
3375 6 : ereport(ERROR,
3376 : errcode(ERRCODE_DATATYPE_MISMATCH),
3377 : ve->format->format_type == JS_FORMAT_DEFAULT ?
3378 : errmsg("cannot use non-string types with implicit FORMAT JSON clause") :
3379 : errmsg("cannot use non-string types with explicit FORMAT JSON clause"),
3380 : parser_errposition(pstate, ve->format->location >= 0 ?
3381 : ve->format->location : location));
3382 :
3383 : /* Convert encoded JSON text from bytea. */
3384 748 : if (format == JS_FORMAT_JSON && exprtype == BYTEAOID)
3385 : {
3386 72 : expr = makeJsonByteaToTextConversion(expr, ve->format, location);
3387 72 : exprtype = TEXTOID;
3388 : }
3389 :
3390 748 : if (!OidIsValid(targettype))
3391 518 : targettype = format == JS_FORMAT_JSONB ? JSONBOID : JSONOID;
3392 :
3393 : /* Try to coerce to the target type. */
3394 748 : coerced = coerce_to_target_type(pstate, expr, exprtype,
3395 : targettype, -1,
3396 : COERCION_EXPLICIT,
3397 : COERCE_EXPLICIT_CAST,
3398 : location);
3399 :
3400 748 : if (!coerced)
3401 : {
3402 : /* If coercion failed, use to_json()/to_jsonb() functions. */
3403 : FuncExpr *fexpr;
3404 : Oid fnoid;
3405 :
3406 : /*
3407 : * Though only allow a cast when the target type is specified by
3408 : * the caller.
3409 : */
3410 30 : if (only_allow_cast)
3411 6 : ereport(ERROR,
3412 : (errcode(ERRCODE_CANNOT_COERCE),
3413 : errmsg("cannot cast type %s to %s",
3414 : format_type_be(exprtype),
3415 : format_type_be(targettype)),
3416 : parser_errposition(pstate, location)));
3417 :
3418 24 : fnoid = targettype == JSONOID ? F_TO_JSON : F_TO_JSONB;
3419 24 : fexpr = makeFuncExpr(fnoid, targettype, list_make1(expr),
3420 : InvalidOid, InvalidOid, COERCE_EXPLICIT_CALL);
3421 :
3422 24 : fexpr->location = location;
3423 :
3424 24 : coerced = (Node *) fexpr;
3425 : }
3426 :
3427 742 : if (coerced == expr)
3428 0 : expr = rawexpr;
3429 : else
3430 : {
3431 742 : ve = copyObject(ve);
3432 742 : ve->raw_expr = (Expr *) rawexpr;
3433 742 : ve->formatted_expr = (Expr *) coerced;
3434 :
3435 742 : expr = (Node *) ve;
3436 : }
3437 : }
3438 :
3439 : /* If returning a JsonValueExpr, formatted_expr must have been set. */
3440 : Assert(!IsA(expr, JsonValueExpr) ||
3441 : ((JsonValueExpr *) expr)->formatted_expr != NULL);
3442 :
3443 4738 : return expr;
3444 : }
3445 :
3446 : /*
3447 : * Checks specified output format for its applicability to the target type.
3448 : */
3449 : static void
3450 248 : checkJsonOutputFormat(ParseState *pstate, const JsonFormat *format,
3451 : Oid targettype, bool allow_format_for_non_strings)
3452 : {
3453 248 : if (!allow_format_for_non_strings &&
3454 144 : format->format_type != JS_FORMAT_DEFAULT &&
3455 126 : (targettype != BYTEAOID &&
3456 120 : targettype != JSONOID &&
3457 : targettype != JSONBOID))
3458 : {
3459 : char typcategory;
3460 : bool typispreferred;
3461 :
3462 90 : get_type_category_preferred(targettype, &typcategory, &typispreferred);
3463 :
3464 90 : if (typcategory != TYPCATEGORY_STRING)
3465 0 : ereport(ERROR,
3466 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3467 : parser_errposition(pstate, format->location),
3468 : errmsg("cannot use JSON format with non-string output types"));
3469 : }
3470 :
3471 248 : if (format->format_type == JS_FORMAT_JSON)
3472 : {
3473 496 : JsonEncoding enc = format->encoding != JS_ENC_DEFAULT ?
3474 248 : format->encoding : JS_ENC_UTF8;
3475 :
3476 248 : if (targettype != BYTEAOID &&
3477 182 : format->encoding != JS_ENC_DEFAULT)
3478 12 : ereport(ERROR,
3479 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3480 : parser_errposition(pstate, format->location),
3481 : errmsg("cannot set JSON encoding for non-bytea output types"));
3482 :
3483 236 : if (enc != JS_ENC_UTF8)
3484 24 : ereport(ERROR,
3485 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3486 : errmsg("unsupported JSON encoding"),
3487 : errhint("Only UTF8 JSON encoding is supported."),
3488 : parser_errposition(pstate, format->location));
3489 : }
3490 212 : }
3491 :
3492 : /*
3493 : * Transform JSON output clause.
3494 : *
3495 : * Assigns target type oid and modifier.
3496 : * Assigns default format or checks specified format for its applicability to
3497 : * the target type.
3498 : */
3499 : static JsonReturning *
3500 4084 : transformJsonOutput(ParseState *pstate, const JsonOutput *output,
3501 : bool allow_format)
3502 : {
3503 : JsonReturning *ret;
3504 :
3505 : /* if output clause is not specified, make default clause value */
3506 4084 : if (!output)
3507 : {
3508 1780 : ret = makeNode(JsonReturning);
3509 :
3510 1780 : ret->format = makeJsonFormat(JS_FORMAT_DEFAULT, JS_ENC_DEFAULT, -1);
3511 1780 : ret->typid = InvalidOid;
3512 1780 : ret->typmod = -1;
3513 :
3514 1780 : return ret;
3515 : }
3516 :
3517 2304 : ret = copyObject(output->returning);
3518 :
3519 2304 : typenameTypeIdAndMod(pstate, output->typeName, &ret->typid, &ret->typmod);
3520 :
3521 2304 : if (output->typeName->setof)
3522 0 : ereport(ERROR,
3523 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3524 : errmsg("returning SETOF types is not supported in SQL/JSON functions"));
3525 :
3526 2304 : if (get_typtype(ret->typid) == TYPTYPE_PSEUDO)
3527 12 : ereport(ERROR,
3528 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3529 : errmsg("returning pseudo-types is not supported in SQL/JSON functions"));
3530 :
3531 2292 : if (ret->format->format_type == JS_FORMAT_DEFAULT)
3532 : /* assign JSONB format when returning jsonb, or JSON format otherwise */
3533 2044 : ret->format->format_type =
3534 2044 : ret->typid == JSONBOID ? JS_FORMAT_JSONB : JS_FORMAT_JSON;
3535 : else
3536 248 : checkJsonOutputFormat(pstate, ret->format, ret->typid, allow_format);
3537 :
3538 2256 : return ret;
3539 : }
3540 :
3541 : /*
3542 : * Transform JSON output clause of JSON constructor functions.
3543 : *
3544 : * Derive RETURNING type, if not specified, from argument types.
3545 : */
3546 : static JsonReturning *
3547 1000 : transformJsonConstructorOutput(ParseState *pstate, JsonOutput *output,
3548 : List *args)
3549 : {
3550 1000 : JsonReturning *returning = transformJsonOutput(pstate, output, true);
3551 :
3552 964 : if (!OidIsValid(returning->typid))
3553 : {
3554 : ListCell *lc;
3555 476 : bool have_jsonb = false;
3556 :
3557 1620 : foreach(lc, args)
3558 : {
3559 1168 : Node *expr = lfirst(lc);
3560 1168 : Oid typid = exprType(expr);
3561 :
3562 1168 : have_jsonb |= typid == JSONBOID;
3563 :
3564 1168 : if (have_jsonb)
3565 24 : break;
3566 : }
3567 :
3568 476 : if (have_jsonb)
3569 : {
3570 24 : returning->typid = JSONBOID;
3571 24 : returning->format->format_type = JS_FORMAT_JSONB;
3572 : }
3573 : else
3574 : {
3575 : /* XXX TEXT is default by the standard, but we return JSON */
3576 452 : returning->typid = JSONOID;
3577 452 : returning->format->format_type = JS_FORMAT_JSON;
3578 : }
3579 :
3580 476 : returning->typmod = -1;
3581 : }
3582 :
3583 964 : return returning;
3584 : }
3585 :
3586 : /*
3587 : * Coerce json[b]-valued function expression to the output type.
3588 : */
3589 : static Node *
3590 1312 : coerceJsonFuncExpr(ParseState *pstate, Node *expr,
3591 : const JsonReturning *returning, bool report_error)
3592 : {
3593 : Node *res;
3594 : int location;
3595 1312 : Oid exprtype = exprType(expr);
3596 :
3597 : /* if output type is not specified or equals to function type, return */
3598 1312 : if (!OidIsValid(returning->typid) || returning->typid == exprtype)
3599 986 : return expr;
3600 :
3601 326 : location = exprLocation(expr);
3602 :
3603 326 : if (location < 0)
3604 326 : location = returning->format->location;
3605 :
3606 : /* special case for RETURNING bytea FORMAT json */
3607 326 : if (returning->format->format_type == JS_FORMAT_JSON &&
3608 326 : returning->typid == BYTEAOID)
3609 : {
3610 : /* encode json text into bytea using pg_convert_to() */
3611 60 : Node *texpr = coerce_to_specific_type(pstate, expr, TEXTOID,
3612 : "JSON_FUNCTION");
3613 60 : Const *enc = getJsonEncodingConst(returning->format);
3614 60 : FuncExpr *fexpr = makeFuncExpr(F_CONVERT_TO, BYTEAOID,
3615 60 : list_make2(texpr, enc),
3616 : InvalidOid, InvalidOid,
3617 : COERCE_EXPLICIT_CALL);
3618 :
3619 60 : fexpr->location = location;
3620 :
3621 60 : return (Node *) fexpr;
3622 : }
3623 :
3624 : /*
3625 : * For other cases, try to coerce expression to the output type using
3626 : * assignment-level casts, erroring out if none available. This basically
3627 : * allows coercing the jsonb value to any string type (typcategory = 'S').
3628 : *
3629 : * Requesting assignment-level here means that typmod / length coercion
3630 : * assumes implicit coercion which is the behavior we want; see
3631 : * build_coercion_expression().
3632 : */
3633 266 : res = coerce_to_target_type(pstate, expr, exprtype,
3634 : returning->typid, returning->typmod,
3635 : COERCION_ASSIGNMENT,
3636 : COERCE_IMPLICIT_CAST,
3637 : location);
3638 :
3639 266 : if (!res && report_error)
3640 0 : ereport(ERROR,
3641 : errcode(ERRCODE_CANNOT_COERCE),
3642 : errmsg("cannot cast type %s to %s",
3643 : format_type_be(exprtype),
3644 : format_type_be(returning->typid)),
3645 : parser_coercion_errposition(pstate, location, expr));
3646 :
3647 266 : return res;
3648 : }
3649 :
3650 : /*
3651 : * Make a JsonConstructorExpr node.
3652 : */
3653 : static Node *
3654 1312 : makeJsonConstructorExpr(ParseState *pstate, JsonConstructorType type,
3655 : List *args, Expr *fexpr, JsonReturning *returning,
3656 : bool unique, bool absent_on_null, int location)
3657 : {
3658 1312 : JsonConstructorExpr *jsctor = makeNode(JsonConstructorExpr);
3659 : Node *placeholder;
3660 : Node *coercion;
3661 :
3662 1312 : jsctor->args = args;
3663 1312 : jsctor->func = fexpr;
3664 1312 : jsctor->type = type;
3665 1312 : jsctor->returning = returning;
3666 1312 : jsctor->unique = unique;
3667 1312 : jsctor->absent_on_null = absent_on_null;
3668 1312 : jsctor->location = location;
3669 :
3670 : /*
3671 : * Coerce to the RETURNING type and format, if needed. We abuse
3672 : * CaseTestExpr here as placeholder to pass the result of either
3673 : * evaluating 'fexpr' or whatever is produced by ExecEvalJsonConstructor()
3674 : * that is of type JSON or JSONB to the coercion function.
3675 : */
3676 1312 : if (fexpr)
3677 : {
3678 396 : CaseTestExpr *cte = makeNode(CaseTestExpr);
3679 :
3680 396 : cte->typeId = exprType((Node *) fexpr);
3681 396 : cte->typeMod = exprTypmod((Node *) fexpr);
3682 396 : cte->collation = exprCollation((Node *) fexpr);
3683 :
3684 396 : placeholder = (Node *) cte;
3685 : }
3686 : else
3687 : {
3688 916 : CaseTestExpr *cte = makeNode(CaseTestExpr);
3689 :
3690 1832 : cte->typeId = returning->format->format_type == JS_FORMAT_JSONB ?
3691 916 : JSONBOID : JSONOID;
3692 916 : cte->typeMod = -1;
3693 916 : cte->collation = InvalidOid;
3694 :
3695 916 : placeholder = (Node *) cte;
3696 : }
3697 :
3698 1312 : coercion = coerceJsonFuncExpr(pstate, placeholder, returning, true);
3699 :
3700 1312 : if (coercion != placeholder)
3701 326 : jsctor->coercion = (Expr *) coercion;
3702 :
3703 1312 : return (Node *) jsctor;
3704 : }
3705 :
3706 : /*
3707 : * Transform JSON_OBJECT() constructor.
3708 : *
3709 : * JSON_OBJECT() is transformed into a JsonConstructorExpr node of type
3710 : * JSCTOR_JSON_OBJECT. The result is coerced to the target type given
3711 : * by ctor->output.
3712 : */
3713 : static Node *
3714 434 : transformJsonObjectConstructor(ParseState *pstate, JsonObjectConstructor *ctor)
3715 : {
3716 : JsonReturning *returning;
3717 434 : List *args = NIL;
3718 :
3719 : /* transform key-value pairs, if any */
3720 434 : if (ctor->exprs)
3721 : {
3722 : ListCell *lc;
3723 :
3724 : /* transform and append key-value arguments */
3725 916 : foreach(lc, ctor->exprs)
3726 : {
3727 598 : JsonKeyValue *kv = castNode(JsonKeyValue, lfirst(lc));
3728 598 : Node *key = transformExprRecurse(pstate, (Node *) kv->key);
3729 598 : Node *val = transformJsonValueExpr(pstate, "JSON_OBJECT()",
3730 : kv->value,
3731 : JS_FORMAT_DEFAULT,
3732 : InvalidOid, false);
3733 :
3734 574 : args = lappend(args, key);
3735 574 : args = lappend(args, val);
3736 : }
3737 : }
3738 :
3739 410 : returning = transformJsonConstructorOutput(pstate, ctor->output, args);
3740 :
3741 784 : return makeJsonConstructorExpr(pstate, JSCTOR_JSON_OBJECT, args, NULL,
3742 392 : returning, ctor->unique,
3743 392 : ctor->absent_on_null, ctor->location);
3744 : }
3745 :
3746 : /*
3747 : * Transform JSON_ARRAY(query [FORMAT] [RETURNING] [ON NULL]) into
3748 : * (SELECT JSON_ARRAYAGG(a [FORMAT] [RETURNING] [ON NULL]) FROM (query) q(a))
3749 : */
3750 : static Node *
3751 54 : transformJsonArrayQueryConstructor(ParseState *pstate,
3752 : JsonArrayQueryConstructor *ctor)
3753 : {
3754 54 : SubLink *sublink = makeNode(SubLink);
3755 54 : SelectStmt *select = makeNode(SelectStmt);
3756 54 : RangeSubselect *range = makeNode(RangeSubselect);
3757 54 : Alias *alias = makeNode(Alias);
3758 54 : ResTarget *target = makeNode(ResTarget);
3759 54 : JsonArrayAgg *agg = makeNode(JsonArrayAgg);
3760 54 : ColumnRef *colref = makeNode(ColumnRef);
3761 : Query *query;
3762 : ParseState *qpstate;
3763 :
3764 : /* Transform query only for counting target list entries. */
3765 54 : qpstate = make_parsestate(pstate);
3766 :
3767 54 : query = transformStmt(qpstate, ctor->query);
3768 :
3769 54 : if (count_nonjunk_tlist_entries(query->targetList) != 1)
3770 18 : ereport(ERROR,
3771 : errcode(ERRCODE_SYNTAX_ERROR),
3772 : errmsg("subquery must return only one column"),
3773 : parser_errposition(pstate, ctor->location));
3774 :
3775 36 : free_parsestate(qpstate);
3776 :
3777 36 : colref->fields = list_make2(makeString(pstrdup("q")),
3778 : makeString(pstrdup("a")));
3779 36 : colref->location = ctor->location;
3780 :
3781 : /*
3782 : * No formatting necessary, so set formatted_expr to be the same as
3783 : * raw_expr.
3784 : */
3785 36 : agg->arg = makeJsonValueExpr((Expr *) colref, (Expr *) colref,
3786 : ctor->format);
3787 36 : agg->absent_on_null = ctor->absent_on_null;
3788 36 : agg->constructor = makeNode(JsonAggConstructor);
3789 36 : agg->constructor->agg_order = NIL;
3790 36 : agg->constructor->output = ctor->output;
3791 36 : agg->constructor->location = ctor->location;
3792 :
3793 36 : target->name = NULL;
3794 36 : target->indirection = NIL;
3795 36 : target->val = (Node *) agg;
3796 36 : target->location = ctor->location;
3797 :
3798 36 : alias->aliasname = pstrdup("q");
3799 36 : alias->colnames = list_make1(makeString(pstrdup("a")));
3800 :
3801 36 : range->lateral = false;
3802 36 : range->subquery = ctor->query;
3803 36 : range->alias = alias;
3804 :
3805 36 : select->targetList = list_make1(target);
3806 36 : select->fromClause = list_make1(range);
3807 :
3808 36 : sublink->subLinkType = EXPR_SUBLINK;
3809 36 : sublink->subLinkId = 0;
3810 36 : sublink->testexpr = NULL;
3811 36 : sublink->operName = NIL;
3812 36 : sublink->subselect = (Node *) select;
3813 36 : sublink->location = ctor->location;
3814 :
3815 36 : return transformExprRecurse(pstate, (Node *) sublink);
3816 : }
3817 :
3818 : /*
3819 : * Common code for JSON_OBJECTAGG and JSON_ARRAYAGG transformation.
3820 : */
3821 : static Node *
3822 396 : transformJsonAggConstructor(ParseState *pstate, JsonAggConstructor *agg_ctor,
3823 : JsonReturning *returning, List *args,
3824 : Oid aggfnoid, Oid aggtype,
3825 : JsonConstructorType ctor_type,
3826 : bool unique, bool absent_on_null)
3827 : {
3828 : Node *node;
3829 : Expr *aggfilter;
3830 :
3831 792 : aggfilter = agg_ctor->agg_filter ? (Expr *)
3832 42 : transformWhereClause(pstate, agg_ctor->agg_filter,
3833 396 : EXPR_KIND_FILTER, "FILTER") : NULL;
3834 :
3835 396 : if (agg_ctor->over)
3836 : {
3837 : /* window function */
3838 48 : WindowFunc *wfunc = makeNode(WindowFunc);
3839 :
3840 48 : wfunc->winfnoid = aggfnoid;
3841 48 : wfunc->wintype = aggtype;
3842 : /* wincollid and inputcollid will be set by parse_collate.c */
3843 48 : wfunc->args = args;
3844 48 : wfunc->aggfilter = aggfilter;
3845 48 : wfunc->runCondition = NIL;
3846 : /* winref will be set by transformWindowFuncCall */
3847 48 : wfunc->winstar = false;
3848 48 : wfunc->winagg = true;
3849 48 : wfunc->location = agg_ctor->location;
3850 :
3851 : /*
3852 : * ordered aggs not allowed in windows yet
3853 : */
3854 48 : if (agg_ctor->agg_order != NIL)
3855 0 : ereport(ERROR,
3856 : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3857 : errmsg("aggregate ORDER BY is not implemented for window functions"),
3858 : parser_errposition(pstate, agg_ctor->location));
3859 :
3860 : /* parse_agg.c does additional window-func-specific processing */
3861 48 : transformWindowFuncCall(pstate, wfunc, agg_ctor->over);
3862 :
3863 48 : node = (Node *) wfunc;
3864 : }
3865 : else
3866 : {
3867 348 : Aggref *aggref = makeNode(Aggref);
3868 :
3869 348 : aggref->aggfnoid = aggfnoid;
3870 348 : aggref->aggtype = aggtype;
3871 :
3872 : /* aggcollid and inputcollid will be set by parse_collate.c */
3873 : /* aggtranstype will be set by planner */
3874 : /* aggargtypes will be set by transformAggregateCall */
3875 : /* aggdirectargs and args will be set by transformAggregateCall */
3876 : /* aggorder and aggdistinct will be set by transformAggregateCall */
3877 348 : aggref->aggfilter = aggfilter;
3878 348 : aggref->aggstar = false;
3879 348 : aggref->aggvariadic = false;
3880 348 : aggref->aggkind = AGGKIND_NORMAL;
3881 348 : aggref->aggpresorted = false;
3882 : /* agglevelsup will be set by transformAggregateCall */
3883 348 : aggref->aggsplit = AGGSPLIT_SIMPLE; /* planner might change this */
3884 348 : aggref->aggno = -1; /* planner will set aggno and aggtransno */
3885 348 : aggref->aggtransno = -1;
3886 348 : aggref->location = agg_ctor->location;
3887 :
3888 348 : transformAggregateCall(pstate, aggref, args, agg_ctor->agg_order, false);
3889 :
3890 348 : node = (Node *) aggref;
3891 : }
3892 :
3893 396 : return makeJsonConstructorExpr(pstate, ctor_type, NIL, (Expr *) node,
3894 : returning, unique, absent_on_null,
3895 : agg_ctor->location);
3896 : }
3897 :
3898 : /*
3899 : * Transform JSON_OBJECTAGG() aggregate function.
3900 : *
3901 : * JSON_OBJECTAGG() is transformed into a JsonConstructorExpr node of type
3902 : * JSCTOR_JSON_OBJECTAGG, which at runtime becomes a
3903 : * json[b]_object_agg[_unique][_strict](agg->arg->key, agg->arg->value) call
3904 : * depending on the output JSON format. The result is coerced to the target
3905 : * type given by agg->constructor->output.
3906 : */
3907 : static Node *
3908 204 : transformJsonObjectAgg(ParseState *pstate, JsonObjectAgg *agg)
3909 : {
3910 : JsonReturning *returning;
3911 : Node *key;
3912 : Node *val;
3913 : List *args;
3914 : Oid aggfnoid;
3915 : Oid aggtype;
3916 :
3917 204 : key = transformExprRecurse(pstate, (Node *) agg->arg->key);
3918 204 : val = transformJsonValueExpr(pstate, "JSON_OBJECTAGG()",
3919 204 : agg->arg->value,
3920 : JS_FORMAT_DEFAULT,
3921 : InvalidOid, false);
3922 204 : args = list_make2(key, val);
3923 :
3924 204 : returning = transformJsonConstructorOutput(pstate, agg->constructor->output,
3925 : args);
3926 :
3927 204 : if (returning->format->format_type == JS_FORMAT_JSONB)
3928 : {
3929 54 : if (agg->absent_on_null)
3930 18 : if (agg->unique)
3931 12 : aggfnoid = F_JSONB_OBJECT_AGG_UNIQUE_STRICT;
3932 : else
3933 6 : aggfnoid = F_JSONB_OBJECT_AGG_STRICT;
3934 36 : else if (agg->unique)
3935 6 : aggfnoid = F_JSONB_OBJECT_AGG_UNIQUE;
3936 : else
3937 30 : aggfnoid = F_JSONB_OBJECT_AGG;
3938 :
3939 54 : aggtype = JSONBOID;
3940 : }
3941 : else
3942 : {
3943 150 : if (agg->absent_on_null)
3944 36 : if (agg->unique)
3945 18 : aggfnoid = F_JSON_OBJECT_AGG_UNIQUE_STRICT;
3946 : else
3947 18 : aggfnoid = F_JSON_OBJECT_AGG_STRICT;
3948 114 : else if (agg->unique)
3949 48 : aggfnoid = F_JSON_OBJECT_AGG_UNIQUE;
3950 : else
3951 66 : aggfnoid = F_JSON_OBJECT_AGG;
3952 :
3953 150 : aggtype = JSONOID;
3954 : }
3955 :
3956 408 : return transformJsonAggConstructor(pstate, agg->constructor, returning,
3957 : args, aggfnoid, aggtype,
3958 : JSCTOR_JSON_OBJECTAGG,
3959 204 : agg->unique, agg->absent_on_null);
3960 : }
3961 :
3962 : /*
3963 : * Transform JSON_ARRAYAGG() aggregate function.
3964 : *
3965 : * JSON_ARRAYAGG() is transformed into a JsonConstructorExpr node of type
3966 : * JSCTOR_JSON_ARRAYAGG, which at runtime becomes a
3967 : * json[b]_object_agg[_unique][_strict](agg->arg) call depending on the output
3968 : * JSON format. The result is coerced to the target type given by
3969 : * agg->constructor->output.
3970 : */
3971 : static Node *
3972 192 : transformJsonArrayAgg(ParseState *pstate, JsonArrayAgg *agg)
3973 : {
3974 : JsonReturning *returning;
3975 : Node *arg;
3976 : Oid aggfnoid;
3977 : Oid aggtype;
3978 :
3979 192 : arg = transformJsonValueExpr(pstate, "JSON_ARRAYAGG()", agg->arg,
3980 : JS_FORMAT_DEFAULT, InvalidOid, false);
3981 :
3982 192 : returning = transformJsonConstructorOutput(pstate, agg->constructor->output,
3983 192 : list_make1(arg));
3984 :
3985 192 : if (returning->format->format_type == JS_FORMAT_JSONB)
3986 : {
3987 72 : aggfnoid = agg->absent_on_null ? F_JSONB_AGG_STRICT : F_JSONB_AGG;
3988 72 : aggtype = JSONBOID;
3989 : }
3990 : else
3991 : {
3992 120 : aggfnoid = agg->absent_on_null ? F_JSON_AGG_STRICT : F_JSON_AGG;
3993 120 : aggtype = JSONOID;
3994 : }
3995 :
3996 192 : return transformJsonAggConstructor(pstate, agg->constructor, returning,
3997 192 : list_make1(arg), aggfnoid, aggtype,
3998 : JSCTOR_JSON_ARRAYAGG,
3999 192 : false, agg->absent_on_null);
4000 : }
4001 :
4002 : /*
4003 : * Transform JSON_ARRAY() constructor.
4004 : *
4005 : * JSON_ARRAY() is transformed into a JsonConstructorExpr node of type
4006 : * JSCTOR_JSON_ARRAY. The result is coerced to the target type given
4007 : * by ctor->output.
4008 : */
4009 : static Node *
4010 194 : transformJsonArrayConstructor(ParseState *pstate, JsonArrayConstructor *ctor)
4011 : {
4012 : JsonReturning *returning;
4013 194 : List *args = NIL;
4014 :
4015 : /* transform element expressions, if any */
4016 194 : if (ctor->exprs)
4017 : {
4018 : ListCell *lc;
4019 :
4020 : /* transform and append element arguments */
4021 342 : foreach(lc, ctor->exprs)
4022 : {
4023 234 : JsonValueExpr *jsval = castNode(JsonValueExpr, lfirst(lc));
4024 234 : Node *val = transformJsonValueExpr(pstate, "JSON_ARRAY()",
4025 : jsval, JS_FORMAT_DEFAULT,
4026 : InvalidOid, false);
4027 :
4028 234 : args = lappend(args, val);
4029 : }
4030 : }
4031 :
4032 194 : returning = transformJsonConstructorOutput(pstate, ctor->output, args);
4033 :
4034 352 : return makeJsonConstructorExpr(pstate, JSCTOR_JSON_ARRAY, args, NULL,
4035 176 : returning, false, ctor->absent_on_null,
4036 : ctor->location);
4037 : }
4038 :
4039 : static Node *
4040 376 : transformJsonParseArg(ParseState *pstate, Node *jsexpr, JsonFormat *format,
4041 : Oid *exprtype)
4042 : {
4043 376 : Node *raw_expr = transformExprRecurse(pstate, jsexpr);
4044 376 : Node *expr = raw_expr;
4045 :
4046 376 : *exprtype = exprType(expr);
4047 :
4048 : /* prepare input document */
4049 376 : if (*exprtype == BYTEAOID)
4050 : {
4051 : JsonValueExpr *jve;
4052 :
4053 60 : expr = raw_expr;
4054 60 : expr = makeJsonByteaToTextConversion(expr, format, exprLocation(expr));
4055 60 : *exprtype = TEXTOID;
4056 :
4057 60 : jve = makeJsonValueExpr((Expr *) raw_expr, (Expr *) expr, format);
4058 60 : expr = (Node *) jve;
4059 : }
4060 : else
4061 : {
4062 : char typcategory;
4063 : bool typispreferred;
4064 :
4065 316 : get_type_category_preferred(*exprtype, &typcategory, &typispreferred);
4066 :
4067 316 : if (*exprtype == UNKNOWNOID || typcategory == TYPCATEGORY_STRING)
4068 : {
4069 192 : expr = coerce_to_target_type(pstate, (Node *) expr, *exprtype,
4070 : TEXTOID, -1,
4071 : COERCION_IMPLICIT,
4072 : COERCE_IMPLICIT_CAST, -1);
4073 192 : *exprtype = TEXTOID;
4074 : }
4075 :
4076 316 : if (format->encoding != JS_ENC_DEFAULT)
4077 0 : ereport(ERROR,
4078 : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
4079 : parser_errposition(pstate, format->location),
4080 : errmsg("cannot use JSON FORMAT ENCODING clause for non-bytea input types")));
4081 : }
4082 :
4083 376 : return expr;
4084 : }
4085 :
4086 : /*
4087 : * Transform IS JSON predicate.
4088 : */
4089 : static Node *
4090 350 : transformJsonIsPredicate(ParseState *pstate, JsonIsPredicate *pred)
4091 : {
4092 : Oid exprtype;
4093 350 : Node *expr = transformJsonParseArg(pstate, pred->expr, pred->format,
4094 : &exprtype);
4095 :
4096 : /* make resulting expression */
4097 350 : if (exprtype != TEXTOID && exprtype != JSONOID && exprtype != JSONBOID)
4098 6 : ereport(ERROR,
4099 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4100 : errmsg("cannot use type %s in IS JSON predicate",
4101 : format_type_be(exprtype))));
4102 :
4103 : /* This intentionally(?) drops the format clause. */
4104 688 : return makeJsonIsPredicate(expr, NULL, pred->item_type,
4105 344 : pred->unique_keys, pred->location);
4106 : }
4107 :
4108 : /*
4109 : * Transform the RETURNING clause of a JSON_*() expression if there is one and
4110 : * create one if not.
4111 : */
4112 : static JsonReturning *
4113 276 : transformJsonReturning(ParseState *pstate, JsonOutput *output, const char *fname)
4114 : {
4115 : JsonReturning *returning;
4116 :
4117 276 : if (output)
4118 : {
4119 0 : returning = transformJsonOutput(pstate, output, false);
4120 :
4121 : Assert(OidIsValid(returning->typid));
4122 :
4123 0 : if (returning->typid != JSONOID && returning->typid != JSONBOID)
4124 0 : ereport(ERROR,
4125 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4126 : errmsg("cannot use type %s in RETURNING clause of %s",
4127 : format_type_be(returning->typid), fname),
4128 : errhint("Try returning json or jsonb."),
4129 : parser_errposition(pstate, output->typeName->location)));
4130 : }
4131 : else
4132 : {
4133 : /* Output type is JSON by default. */
4134 276 : Oid targettype = JSONOID;
4135 276 : JsonFormatType format = JS_FORMAT_JSON;
4136 :
4137 276 : returning = makeNode(JsonReturning);
4138 276 : returning->format = makeJsonFormat(format, JS_ENC_DEFAULT, -1);
4139 276 : returning->typid = targettype;
4140 276 : returning->typmod = -1;
4141 : }
4142 :
4143 276 : return returning;
4144 : }
4145 :
4146 : /*
4147 : * Transform a JSON() expression.
4148 : *
4149 : * JSON() is transformed into a JsonConstructorExpr of type JSCTOR_JSON_PARSE,
4150 : * which validates the input expression value as JSON.
4151 : */
4152 : static Node *
4153 164 : transformJsonParseExpr(ParseState *pstate, JsonParseExpr *jsexpr)
4154 : {
4155 164 : JsonOutput *output = jsexpr->output;
4156 : JsonReturning *returning;
4157 : Node *arg;
4158 :
4159 164 : returning = transformJsonReturning(pstate, output, "JSON()");
4160 :
4161 164 : if (jsexpr->unique_keys)
4162 : {
4163 : /*
4164 : * Coerce string argument to text and then to json[b] in the executor
4165 : * node with key uniqueness check.
4166 : */
4167 26 : JsonValueExpr *jve = jsexpr->expr;
4168 : Oid arg_type;
4169 :
4170 26 : arg = transformJsonParseArg(pstate, (Node *) jve->raw_expr, jve->format,
4171 : &arg_type);
4172 :
4173 26 : if (arg_type != TEXTOID)
4174 10 : ereport(ERROR,
4175 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4176 : errmsg("cannot use non-string types with WITH UNIQUE KEYS clause"),
4177 : parser_errposition(pstate, jsexpr->location)));
4178 : }
4179 : else
4180 : {
4181 : /*
4182 : * Coerce argument to target type using CAST for compatibility with PG
4183 : * function-like CASTs.
4184 : */
4185 138 : arg = transformJsonValueExpr(pstate, "JSON()", jsexpr->expr,
4186 : JS_FORMAT_JSON, returning->typid, false);
4187 : }
4188 :
4189 138 : return makeJsonConstructorExpr(pstate, JSCTOR_JSON_PARSE, list_make1(arg), NULL,
4190 138 : returning, jsexpr->unique_keys, false,
4191 : jsexpr->location);
4192 : }
4193 :
4194 : /*
4195 : * Transform a JSON_SCALAR() expression.
4196 : *
4197 : * JSON_SCALAR() is transformed into a JsonConstructorExpr of type
4198 : * JSCTOR_JSON_SCALAR, which converts the input SQL scalar value into
4199 : * a json[b] value.
4200 : */
4201 : static Node *
4202 112 : transformJsonScalarExpr(ParseState *pstate, JsonScalarExpr *jsexpr)
4203 : {
4204 112 : Node *arg = transformExprRecurse(pstate, (Node *) jsexpr->expr);
4205 112 : JsonOutput *output = jsexpr->output;
4206 : JsonReturning *returning;
4207 :
4208 112 : returning = transformJsonReturning(pstate, output, "JSON_SCALAR()");
4209 :
4210 112 : if (exprType(arg) == UNKNOWNOID)
4211 26 : arg = coerce_to_specific_type(pstate, arg, TEXTOID, "JSON_SCALAR");
4212 :
4213 112 : return makeJsonConstructorExpr(pstate, JSCTOR_JSON_SCALAR, list_make1(arg), NULL,
4214 : returning, false, false, jsexpr->location);
4215 : }
4216 :
4217 : /*
4218 : * Transform a JSON_SERIALIZE() expression.
4219 : *
4220 : * JSON_SERIALIZE() is transformed into a JsonConstructorExpr of type
4221 : * JSCTOR_JSON_SERIALIZE which converts the input JSON value into a character
4222 : * or bytea string.
4223 : */
4224 : static Node *
4225 108 : transformJsonSerializeExpr(ParseState *pstate, JsonSerializeExpr *expr)
4226 : {
4227 : JsonReturning *returning;
4228 108 : Node *arg = transformJsonValueExpr(pstate, "JSON_SERIALIZE()",
4229 : expr->expr,
4230 : JS_FORMAT_JSON,
4231 : InvalidOid, false);
4232 :
4233 108 : if (expr->output)
4234 : {
4235 50 : returning = transformJsonOutput(pstate, expr->output, true);
4236 :
4237 50 : if (returning->typid != BYTEAOID)
4238 : {
4239 : char typcategory;
4240 : bool typispreferred;
4241 :
4242 38 : get_type_category_preferred(returning->typid, &typcategory,
4243 : &typispreferred);
4244 38 : if (typcategory != TYPCATEGORY_STRING)
4245 10 : ereport(ERROR,
4246 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4247 : errmsg("cannot use type %s in RETURNING clause of %s",
4248 : format_type_be(returning->typid),
4249 : "JSON_SERIALIZE()"),
4250 : errhint("Try returning a string type or bytea.")));
4251 : }
4252 : }
4253 : else
4254 : {
4255 : /* RETURNING TEXT FORMAT JSON is by default */
4256 58 : returning = makeNode(JsonReturning);
4257 58 : returning->format = makeJsonFormat(JS_FORMAT_JSON, JS_ENC_DEFAULT, -1);
4258 58 : returning->typid = TEXTOID;
4259 58 : returning->typmod = -1;
4260 : }
4261 :
4262 98 : return makeJsonConstructorExpr(pstate, JSCTOR_JSON_SERIALIZE, list_make1(arg),
4263 : NULL, returning, false, false, expr->location);
4264 : }
4265 :
4266 : /*
4267 : * Transform JSON_VALUE, JSON_QUERY, JSON_EXISTS, JSON_TABLE functions into
4268 : * a JsonExpr node.
4269 : */
4270 : static Node *
4271 3094 : transformJsonFuncExpr(ParseState *pstate, JsonFuncExpr *func)
4272 : {
4273 : JsonExpr *jsexpr;
4274 : Node *path_spec;
4275 3094 : const char *func_name = NULL;
4276 : JsonFormatType default_format;
4277 :
4278 3094 : switch (func->op)
4279 : {
4280 306 : case JSON_EXISTS_OP:
4281 306 : func_name = "JSON_EXISTS";
4282 306 : default_format = JS_FORMAT_DEFAULT;
4283 306 : break;
4284 1266 : case JSON_QUERY_OP:
4285 1266 : func_name = "JSON_QUERY";
4286 1266 : default_format = JS_FORMAT_JSONB;
4287 1266 : break;
4288 1046 : case JSON_VALUE_OP:
4289 1046 : func_name = "JSON_VALUE";
4290 1046 : default_format = JS_FORMAT_DEFAULT;
4291 1046 : break;
4292 476 : case JSON_TABLE_OP:
4293 476 : func_name = "JSON_TABLE";
4294 476 : default_format = JS_FORMAT_JSONB;
4295 476 : break;
4296 0 : default:
4297 0 : elog(ERROR, "invalid JsonFuncExpr op %d", (int) func->op);
4298 : default_format = JS_FORMAT_DEFAULT; /* keep compiler quiet */
4299 : break;
4300 : }
4301 :
4302 : /*
4303 : * Even though the syntax allows it, FORMAT JSON specification in
4304 : * RETURNING is meaningless except for JSON_QUERY(). Flag if not
4305 : * JSON_QUERY().
4306 : */
4307 3094 : if (func->output && func->op != JSON_QUERY_OP)
4308 : {
4309 1004 : JsonFormat *format = func->output->returning->format;
4310 :
4311 1004 : if (format->format_type != JS_FORMAT_DEFAULT ||
4312 998 : format->encoding != JS_ENC_DEFAULT)
4313 6 : ereport(ERROR,
4314 : errcode(ERRCODE_SYNTAX_ERROR),
4315 : errmsg("cannot specify FORMAT JSON in RETURNING clause of %s()",
4316 : func_name),
4317 : parser_errposition(pstate, format->location));
4318 : }
4319 :
4320 : /* OMIT QUOTES is meaningless when strings are wrapped. */
4321 3088 : if (func->op == JSON_QUERY_OP)
4322 : {
4323 1266 : if (func->quotes == JS_QUOTES_OMIT &&
4324 180 : (func->wrapper == JSW_CONDITIONAL ||
4325 174 : func->wrapper == JSW_UNCONDITIONAL))
4326 18 : ereport(ERROR,
4327 : errcode(ERRCODE_SYNTAX_ERROR),
4328 : errmsg("SQL/JSON QUOTES behavior must not be specified when WITH WRAPPER is used"),
4329 : parser_errposition(pstate, func->location));
4330 1248 : if (func->on_empty != NULL &&
4331 96 : func->on_empty->btype != JSON_BEHAVIOR_ERROR &&
4332 60 : func->on_empty->btype != JSON_BEHAVIOR_NULL &&
4333 54 : func->on_empty->btype != JSON_BEHAVIOR_EMPTY &&
4334 54 : func->on_empty->btype != JSON_BEHAVIOR_EMPTY_ARRAY &&
4335 30 : func->on_empty->btype != JSON_BEHAVIOR_EMPTY_OBJECT &&
4336 24 : func->on_empty->btype != JSON_BEHAVIOR_DEFAULT)
4337 : {
4338 0 : if (func->column_name == NULL)
4339 0 : ereport(ERROR,
4340 : errcode(ERRCODE_SYNTAX_ERROR),
4341 : /*- translator: %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4342 : errmsg("invalid %s behavior", "ON EMPTY"),
4343 : /*- translator: first %s is name of a SQL/JSON clause (eg. ON EMPTY),
4344 : second %s is a SQL/JSON function name (e.g. JSON_QUERY) */
4345 : errdetail("Only ERROR, NULL, EMPTY ARRAY, EMPTY OBJECT, or DEFAULT expression is allowed in %s for %s.",
4346 : "ON EMPTY", "JSON_QUERY()"),
4347 : parser_errposition(pstate, func->on_empty->location));
4348 : else
4349 0 : ereport(ERROR,
4350 : errcode(ERRCODE_SYNTAX_ERROR),
4351 : /*- translator: first %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4352 : errmsg("invalid %s behavior for column \"%s\"",
4353 : "ON EMPTY", func->column_name),
4354 : /*- translator: %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4355 : errdetail("Only ERROR, NULL, EMPTY ARRAY, EMPTY OBJECT, or DEFAULT expression is allowed in %s for formatted columns.",
4356 : "ON EMPTY"),
4357 : parser_errposition(pstate, func->on_empty->location));
4358 : }
4359 1248 : if (func->on_error != NULL &&
4360 330 : func->on_error->btype != JSON_BEHAVIOR_ERROR &&
4361 156 : func->on_error->btype != JSON_BEHAVIOR_NULL &&
4362 150 : func->on_error->btype != JSON_BEHAVIOR_EMPTY &&
4363 150 : func->on_error->btype != JSON_BEHAVIOR_EMPTY_ARRAY &&
4364 144 : func->on_error->btype != JSON_BEHAVIOR_EMPTY_OBJECT &&
4365 90 : func->on_error->btype != JSON_BEHAVIOR_DEFAULT)
4366 : {
4367 12 : if (func->column_name == NULL)
4368 6 : ereport(ERROR,
4369 : errcode(ERRCODE_SYNTAX_ERROR),
4370 : /*- translator: %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4371 : errmsg("invalid %s behavior", "ON ERROR"),
4372 : /*- translator: first %s is name of a SQL/JSON clause (eg. ON EMPTY),
4373 : second %s is a SQL/JSON function name (e.g. JSON_QUERY) */
4374 : errdetail("Only ERROR, NULL, EMPTY ARRAY, EMPTY OBJECT, or DEFAULT expression is allowed in %s for %s.",
4375 : "ON ERROR", "JSON_QUERY()"),
4376 : parser_errposition(pstate, func->on_error->location));
4377 : else
4378 6 : ereport(ERROR,
4379 : errcode(ERRCODE_SYNTAX_ERROR),
4380 : /*- translator: first %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4381 : errmsg("invalid %s behavior for column \"%s\"",
4382 : "ON ERROR", func->column_name),
4383 : /*- translator: %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4384 : errdetail("Only ERROR, NULL, EMPTY ARRAY, EMPTY OBJECT, or DEFAULT expression is allowed in %s for formatted columns.",
4385 : "ON ERROR"),
4386 : parser_errposition(pstate, func->on_error->location));
4387 : }
4388 : }
4389 :
4390 : /* Check that ON ERROR/EMPTY behavior values are valid for the function. */
4391 3058 : if (func->op == JSON_EXISTS_OP &&
4392 306 : func->on_error != NULL &&
4393 90 : func->on_error->btype != JSON_BEHAVIOR_ERROR &&
4394 48 : func->on_error->btype != JSON_BEHAVIOR_TRUE &&
4395 36 : func->on_error->btype != JSON_BEHAVIOR_FALSE &&
4396 24 : func->on_error->btype != JSON_BEHAVIOR_UNKNOWN)
4397 : {
4398 12 : if (func->column_name == NULL)
4399 6 : ereport(ERROR,
4400 : errcode(ERRCODE_SYNTAX_ERROR),
4401 : /*- translator: %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4402 : errmsg("invalid %s behavior", "ON ERROR"),
4403 : errdetail("Only ERROR, TRUE, FALSE, or UNKNOWN is allowed in %s for %s.",
4404 : "ON ERROR", "JSON_EXISTS()"),
4405 : parser_errposition(pstate, func->on_error->location));
4406 : else
4407 6 : ereport(ERROR,
4408 : errcode(ERRCODE_SYNTAX_ERROR),
4409 : /*- translator: first %s is name a SQL/JSON clause (eg. ON EMPTY) */
4410 : errmsg("invalid %s behavior for column \"%s\"",
4411 : "ON ERROR", func->column_name),
4412 : /*- translator: %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4413 : errdetail("Only ERROR, TRUE, FALSE, or UNKNOWN is allowed in %s for EXISTS columns.",
4414 : "ON ERROR"),
4415 : parser_errposition(pstate, func->on_error->location));
4416 : }
4417 3046 : if (func->op == JSON_VALUE_OP)
4418 : {
4419 1040 : if (func->on_empty != NULL &&
4420 174 : func->on_empty->btype != JSON_BEHAVIOR_ERROR &&
4421 144 : func->on_empty->btype != JSON_BEHAVIOR_NULL &&
4422 138 : func->on_empty->btype != JSON_BEHAVIOR_DEFAULT)
4423 : {
4424 6 : if (func->column_name == NULL)
4425 0 : ereport(ERROR,
4426 : errcode(ERRCODE_SYNTAX_ERROR),
4427 : /*- translator: %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4428 : errmsg("invalid %s behavior", "ON EMPTY"),
4429 : /*- translator: first %s is name of a SQL/JSON clause (eg. ON EMPTY),
4430 : second %s is a SQL/JSON function name (e.g. JSON_QUERY) */
4431 : errdetail("Only ERROR, NULL, or DEFAULT expression is allowed in %s for %s.",
4432 : "ON EMPTY", "JSON_VALUE()"),
4433 : parser_errposition(pstate, func->on_empty->location));
4434 : else
4435 6 : ereport(ERROR,
4436 : errcode(ERRCODE_SYNTAX_ERROR),
4437 : /*- translator: first %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4438 : errmsg("invalid %s behavior for column \"%s\"",
4439 : "ON EMPTY", func->column_name),
4440 : /*- translator: %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4441 : errdetail("Only ERROR, NULL, or DEFAULT expression is allowed in %s for scalar columns.",
4442 : "ON EMPTY"),
4443 : parser_errposition(pstate, func->on_empty->location));
4444 : }
4445 1034 : if (func->on_error != NULL &&
4446 324 : func->on_error->btype != JSON_BEHAVIOR_ERROR &&
4447 144 : func->on_error->btype != JSON_BEHAVIOR_NULL &&
4448 144 : func->on_error->btype != JSON_BEHAVIOR_DEFAULT)
4449 : {
4450 6 : if (func->column_name == NULL)
4451 6 : ereport(ERROR,
4452 : errcode(ERRCODE_SYNTAX_ERROR),
4453 : /*- translator: %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4454 : errmsg("invalid %s behavior", "ON ERROR"),
4455 : /*- translator: first %s is name of a SQL/JSON clause (eg. ON EMPTY),
4456 : second %s is a SQL/JSON function name (e.g. JSON_QUERY) */
4457 : errdetail("Only ERROR, NULL, or DEFAULT expression is allowed in %s for %s.",
4458 : "ON ERROR", "JSON_VALUE()"),
4459 : parser_errposition(pstate, func->on_error->location));
4460 : else
4461 0 : ereport(ERROR,
4462 : errcode(ERRCODE_SYNTAX_ERROR),
4463 : /*- translator: first %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4464 : errmsg("invalid %s behavior for column \"%s\"",
4465 : "ON ERROR", func->column_name),
4466 : /*- translator: %s is name of a SQL/JSON clause (eg. ON EMPTY) */
4467 : errdetail("Only ERROR, NULL, or DEFAULT expression is allowed in %s for scalar columns.",
4468 : "ON ERROR"),
4469 : parser_errposition(pstate, func->on_error->location));
4470 : }
4471 : }
4472 :
4473 3034 : jsexpr = makeNode(JsonExpr);
4474 3034 : jsexpr->location = func->location;
4475 3034 : jsexpr->op = func->op;
4476 3034 : jsexpr->column_name = func->column_name;
4477 :
4478 : /*
4479 : * jsonpath machinery can only handle jsonb documents, so coerce the input
4480 : * if not already of jsonb type.
4481 : */
4482 3034 : jsexpr->formatted_expr = transformJsonValueExpr(pstate, func_name,
4483 : func->context_item,
4484 : default_format,
4485 : JSONBOID,
4486 : false);
4487 3034 : jsexpr->format = func->context_item->format;
4488 :
4489 3034 : path_spec = transformExprRecurse(pstate, func->pathspec);
4490 3034 : path_spec = coerce_to_target_type(pstate, path_spec, exprType(path_spec),
4491 : JSONPATHOID, -1,
4492 : COERCION_EXPLICIT, COERCE_IMPLICIT_CAST,
4493 : exprLocation(path_spec));
4494 3034 : if (path_spec == NULL)
4495 0 : ereport(ERROR,
4496 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4497 : errmsg("JSON path expression must be of type %s, not of type %s",
4498 : "jsonpath", format_type_be(exprType(path_spec))),
4499 : parser_errposition(pstate, exprLocation(path_spec))));
4500 3034 : jsexpr->path_spec = path_spec;
4501 :
4502 : /* Transform and coerce the PASSING arguments to jsonb. */
4503 3034 : transformJsonPassingArgs(pstate, func_name,
4504 : JS_FORMAT_JSONB,
4505 : func->passing,
4506 : &jsexpr->passing_values,
4507 : &jsexpr->passing_names);
4508 :
4509 : /* Transform the JsonOutput into JsonReturning. */
4510 3034 : jsexpr->returning = transformJsonOutput(pstate, func->output, false);
4511 :
4512 3022 : switch (func->op)
4513 : {
4514 294 : case JSON_EXISTS_OP:
4515 : /* JSON_EXISTS returns boolean by default. */
4516 294 : if (!OidIsValid(jsexpr->returning->typid))
4517 : {
4518 162 : jsexpr->returning->typid = BOOLOID;
4519 162 : jsexpr->returning->typmod = -1;
4520 : }
4521 :
4522 : /* JSON_TABLE() COLUMNS can specify a non-boolean type. */
4523 294 : if (jsexpr->returning->typid != BOOLOID)
4524 120 : jsexpr->use_json_coercion = true;
4525 :
4526 294 : jsexpr->on_error = transformJsonBehavior(pstate, func->on_error,
4527 : JSON_BEHAVIOR_FALSE,
4528 : jsexpr->returning);
4529 294 : break;
4530 :
4531 1230 : case JSON_QUERY_OP:
4532 : /* JSON_QUERY returns jsonb by default. */
4533 1230 : if (!OidIsValid(jsexpr->returning->typid))
4534 : {
4535 492 : JsonReturning *ret = jsexpr->returning;
4536 :
4537 492 : ret->typid = JSONBOID;
4538 492 : ret->typmod = -1;
4539 : }
4540 :
4541 : /*
4542 : * Keep quotes on scalar strings by default, omitting them only if
4543 : * OMIT QUOTES is specified.
4544 : */
4545 1230 : jsexpr->omit_quotes = (func->quotes == JS_QUOTES_OMIT);
4546 1230 : jsexpr->wrapper = func->wrapper;
4547 :
4548 : /*
4549 : * Set up to coerce the result value of JsonPathValue() to the
4550 : * RETURNING type (default or user-specified), if needed. Also if
4551 : * OMIT QUOTES is specified.
4552 : */
4553 1230 : if (jsexpr->returning->typid != JSONBOID || jsexpr->omit_quotes)
4554 690 : jsexpr->use_json_coercion = true;
4555 :
4556 : /* Assume NULL ON EMPTY when ON EMPTY is not specified. */
4557 1230 : jsexpr->on_empty = transformJsonBehavior(pstate, func->on_empty,
4558 : JSON_BEHAVIOR_NULL,
4559 : jsexpr->returning);
4560 : /* Assume NULL ON ERROR when ON ERROR is not specified. */
4561 1230 : jsexpr->on_error = transformJsonBehavior(pstate, func->on_error,
4562 : JSON_BEHAVIOR_NULL,
4563 : jsexpr->returning);
4564 1170 : break;
4565 :
4566 1022 : case JSON_VALUE_OP:
4567 : /* JSON_VALUE returns text by default. */
4568 1022 : if (!OidIsValid(jsexpr->returning->typid))
4569 : {
4570 174 : jsexpr->returning->typid = TEXTOID;
4571 174 : jsexpr->returning->typmod = -1;
4572 : }
4573 :
4574 : /*
4575 : * Override whatever transformJsonOutput() set these to, which
4576 : * assumes that output type to be jsonb.
4577 : */
4578 1022 : jsexpr->returning->format->format_type = JS_FORMAT_DEFAULT;
4579 1022 : jsexpr->returning->format->encoding = JS_ENC_DEFAULT;
4580 :
4581 : /* Always omit quotes from scalar strings. */
4582 1022 : jsexpr->omit_quotes = true;
4583 :
4584 : /*
4585 : * Set up to coerce the result value of JsonPathValue() to the
4586 : * RETURNING type (default or user-specified), if needed.
4587 : */
4588 1022 : if (jsexpr->returning->typid != TEXTOID)
4589 : {
4590 908 : if (get_typtype(jsexpr->returning->typid) == TYPTYPE_DOMAIN &&
4591 144 : DomainHasConstraints(jsexpr->returning->typid))
4592 132 : jsexpr->use_json_coercion = true;
4593 : else
4594 632 : jsexpr->use_io_coercion = true;
4595 : }
4596 :
4597 : /* Assume NULL ON EMPTY when ON EMPTY is not specified. */
4598 1022 : jsexpr->on_empty = transformJsonBehavior(pstate, func->on_empty,
4599 : JSON_BEHAVIOR_NULL,
4600 : jsexpr->returning);
4601 : /* Assume NULL ON ERROR when ON ERROR is not specified. */
4602 1022 : jsexpr->on_error = transformJsonBehavior(pstate, func->on_error,
4603 : JSON_BEHAVIOR_NULL,
4604 : jsexpr->returning);
4605 1016 : break;
4606 :
4607 476 : case JSON_TABLE_OP:
4608 476 : if (!OidIsValid(jsexpr->returning->typid))
4609 : {
4610 476 : jsexpr->returning->typid = exprType(jsexpr->formatted_expr);
4611 476 : jsexpr->returning->typmod = -1;
4612 : }
4613 :
4614 : /*
4615 : * Assume EMPTY ARRAY ON ERROR when ON ERROR is not specified.
4616 : *
4617 : * ON EMPTY cannot be specified at the top level but it can be for
4618 : * the individual columns.
4619 : */
4620 476 : jsexpr->on_error = transformJsonBehavior(pstate, func->on_error,
4621 : JSON_BEHAVIOR_EMPTY_ARRAY,
4622 : jsexpr->returning);
4623 476 : break;
4624 :
4625 0 : default:
4626 0 : elog(ERROR, "invalid JsonFuncExpr op %d", (int) func->op);
4627 : break;
4628 : }
4629 :
4630 2956 : return (Node *) jsexpr;
4631 : }
4632 :
4633 : /*
4634 : * Transform a SQL/JSON PASSING clause.
4635 : */
4636 : static void
4637 3034 : transformJsonPassingArgs(ParseState *pstate, const char *constructName,
4638 : JsonFormatType format, List *args,
4639 : List **passing_values, List **passing_names)
4640 : {
4641 : ListCell *lc;
4642 :
4643 3034 : *passing_values = NIL;
4644 3034 : *passing_names = NIL;
4645 :
4646 4234 : foreach(lc, args)
4647 : {
4648 1200 : JsonArgument *arg = castNode(JsonArgument, lfirst(lc));
4649 1200 : Node *expr = transformJsonValueExpr(pstate, constructName,
4650 : arg->val, format,
4651 : InvalidOid, true);
4652 :
4653 1200 : *passing_values = lappend(*passing_values, expr);
4654 1200 : *passing_names = lappend(*passing_names, makeString(arg->name));
4655 : }
4656 3034 : }
4657 :
4658 : /*
4659 : * Recursively checks if the given expression, or its sub-node in some cases,
4660 : * is valid for using as an ON ERROR / ON EMPTY DEFAULT expression.
4661 : */
4662 : static bool
4663 492 : ValidJsonBehaviorDefaultExpr(Node *expr, void *context)
4664 : {
4665 492 : if (expr == NULL)
4666 0 : return false;
4667 :
4668 492 : switch (nodeTag(expr))
4669 : {
4670 : /* Acceptable expression nodes */
4671 324 : case T_Const:
4672 : case T_FuncExpr:
4673 : case T_OpExpr:
4674 324 : return true;
4675 :
4676 : /* Acceptable iff arg of the following nodes is one of the above */
4677 114 : case T_CoerceViaIO:
4678 : case T_CoerceToDomain:
4679 : case T_ArrayCoerceExpr:
4680 : case T_ConvertRowtypeExpr:
4681 : case T_RelabelType:
4682 : case T_CollateExpr:
4683 114 : return expression_tree_walker(expr, ValidJsonBehaviorDefaultExpr,
4684 : context);
4685 54 : default:
4686 54 : break;
4687 : }
4688 :
4689 54 : return false;
4690 : }
4691 :
4692 : /*
4693 : * Transform a JSON BEHAVIOR clause.
4694 : */
4695 : static JsonBehavior *
4696 5274 : transformJsonBehavior(ParseState *pstate, JsonBehavior *behavior,
4697 : JsonBehaviorType default_behavior,
4698 : JsonReturning *returning)
4699 : {
4700 5274 : JsonBehaviorType btype = default_behavior;
4701 5274 : Node *expr = NULL;
4702 5274 : bool coerce_at_runtime = false;
4703 5274 : int location = -1;
4704 :
4705 5274 : if (behavior)
4706 : {
4707 1014 : btype = behavior->btype;
4708 1014 : location = behavior->location;
4709 1014 : if (btype == JSON_BEHAVIOR_DEFAULT)
4710 : {
4711 372 : expr = transformExprRecurse(pstate, behavior->expr);
4712 372 : if (!ValidJsonBehaviorDefaultExpr(expr, NULL))
4713 48 : ereport(ERROR,
4714 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4715 : errmsg("can only specify a constant, non-aggregate function, or operator expression for DEFAULT"),
4716 : parser_errposition(pstate, exprLocation(expr))));
4717 324 : if (contain_var_clause(expr))
4718 6 : ereport(ERROR,
4719 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4720 : errmsg("DEFAULT expression must not contain column references"),
4721 : parser_errposition(pstate, exprLocation(expr))));
4722 318 : if (expression_returns_set(expr))
4723 6 : ereport(ERROR,
4724 : (errcode(ERRCODE_DATATYPE_MISMATCH),
4725 : errmsg("DEFAULT expression must not return a set"),
4726 : parser_errposition(pstate, exprLocation(expr))));
4727 : }
4728 : }
4729 :
4730 5214 : if (expr == NULL && btype != JSON_BEHAVIOR_ERROR)
4731 4416 : expr = GetJsonBehaviorConst(btype, location);
4732 :
4733 : /*
4734 : * Try to coerce the expression if needed.
4735 : *
4736 : * Use runtime coercion using json_populate_type() if the expression is
4737 : * NULL, jsonb-valued, or boolean-valued (unless the target type is
4738 : * integer or domain over integer, in which case use the
4739 : * boolean-to-integer cast function).
4740 : *
4741 : * For other non-NULL expressions, try to find a cast and error out if one
4742 : * is not found.
4743 : */
4744 5214 : if (expr && exprType(expr) != returning->typid)
4745 : {
4746 3222 : bool isnull = (IsA(expr, Const) && ((Const *) expr)->constisnull);
4747 :
4748 3510 : if (isnull ||
4749 534 : exprType(expr) == JSONBOID ||
4750 324 : (exprType(expr) == BOOLOID &&
4751 78 : getBaseType(returning->typid) != INT4OID))
4752 : {
4753 3018 : coerce_at_runtime = true;
4754 :
4755 : /*
4756 : * json_populate_type() expects to be passed a jsonb value, so gin
4757 : * up a Const containing the appropriate boolean value represented
4758 : * as jsonb, discarding the original Const containing a plain
4759 : * boolean.
4760 : */
4761 3018 : if (exprType(expr) == BOOLOID)
4762 : {
4763 42 : char *val = btype == JSON_BEHAVIOR_TRUE ? "true" : "false";
4764 :
4765 42 : expr = (Node *) makeConst(JSONBOID, -1, InvalidOid, -1,
4766 : DirectFunctionCall1(jsonb_in,
4767 : CStringGetDatum(val)),
4768 : false, false);
4769 : }
4770 : }
4771 : else
4772 : {
4773 : Node *coerced_expr;
4774 204 : char typcategory = TypeCategory(returning->typid);
4775 :
4776 : /*
4777 : * Use an assignment cast if coercing to a string type so that
4778 : * build_coercion_expression() assumes implicit coercion when
4779 : * coercing the typmod, so that inputs exceeding length cause an
4780 : * error instead of silent truncation.
4781 : */
4782 : coerced_expr =
4783 300 : coerce_to_target_type(pstate, expr, exprType(expr),
4784 : returning->typid, returning->typmod,
4785 96 : (typcategory == TYPCATEGORY_STRING ||
4786 : typcategory == TYPCATEGORY_BITSTRING) ?
4787 : COERCION_ASSIGNMENT :
4788 : COERCION_EXPLICIT,
4789 : COERCE_EXPLICIT_CAST,
4790 : exprLocation((Node *) behavior));
4791 :
4792 204 : if (coerced_expr == NULL)
4793 : {
4794 : /*
4795 : * Provide a HINT if the expression comes from a DEFAULT
4796 : * clause.
4797 : */
4798 6 : if (btype == JSON_BEHAVIOR_DEFAULT)
4799 6 : ereport(ERROR,
4800 : errcode(ERRCODE_CANNOT_COERCE),
4801 : errmsg("cannot cast behavior expression of type %s to %s",
4802 : format_type_be(exprType(expr)),
4803 : format_type_be(returning->typid)),
4804 : errhint("You will need to explicitly cast the expression to type %s.",
4805 : format_type_be(returning->typid)),
4806 : parser_errposition(pstate, exprLocation(expr)));
4807 : else
4808 0 : ereport(ERROR,
4809 : errcode(ERRCODE_CANNOT_COERCE),
4810 : errmsg("cannot cast behavior expression of type %s to %s",
4811 : format_type_be(exprType(expr)),
4812 : format_type_be(returning->typid)),
4813 : parser_errposition(pstate, exprLocation(expr)));
4814 : }
4815 :
4816 198 : expr = coerced_expr;
4817 : }
4818 : }
4819 :
4820 5208 : if (behavior)
4821 948 : behavior->expr = expr;
4822 : else
4823 4260 : behavior = makeJsonBehavior(btype, expr, location);
4824 :
4825 5208 : behavior->coerce = coerce_at_runtime;
4826 :
4827 5208 : return behavior;
4828 : }
4829 :
4830 : /*
4831 : * Returns a Const node holding the value for the given non-ERROR
4832 : * JsonBehaviorType.
4833 : */
4834 : static Node *
4835 4416 : GetJsonBehaviorConst(JsonBehaviorType btype, int location)
4836 : {
4837 4416 : Datum val = (Datum) 0;
4838 4416 : Oid typid = JSONBOID;
4839 4416 : int len = -1;
4840 4416 : bool isbyval = false;
4841 4416 : bool isnull = false;
4842 : Const *con;
4843 :
4844 4416 : switch (btype)
4845 : {
4846 482 : case JSON_BEHAVIOR_EMPTY_ARRAY:
4847 482 : val = DirectFunctionCall1(jsonb_in, CStringGetDatum("[]"));
4848 482 : break;
4849 :
4850 54 : case JSON_BEHAVIOR_EMPTY_OBJECT:
4851 54 : val = DirectFunctionCall1(jsonb_in, CStringGetDatum("{}"));
4852 54 : break;
4853 :
4854 12 : case JSON_BEHAVIOR_TRUE:
4855 12 : val = BoolGetDatum(true);
4856 12 : typid = BOOLOID;
4857 12 : len = sizeof(bool);
4858 12 : isbyval = true;
4859 12 : break;
4860 :
4861 228 : case JSON_BEHAVIOR_FALSE:
4862 228 : val = BoolGetDatum(false);
4863 228 : typid = BOOLOID;
4864 228 : len = sizeof(bool);
4865 228 : isbyval = true;
4866 228 : break;
4867 :
4868 3640 : case JSON_BEHAVIOR_NULL:
4869 : case JSON_BEHAVIOR_UNKNOWN:
4870 : case JSON_BEHAVIOR_EMPTY:
4871 3640 : val = (Datum) 0;
4872 3640 : isnull = true;
4873 3640 : typid = INT4OID;
4874 3640 : len = sizeof(int32);
4875 3640 : isbyval = true;
4876 3640 : break;
4877 :
4878 : /* These two behavior types are handled by the caller. */
4879 0 : case JSON_BEHAVIOR_DEFAULT:
4880 : case JSON_BEHAVIOR_ERROR:
4881 : Assert(false);
4882 0 : break;
4883 :
4884 0 : default:
4885 0 : elog(ERROR, "unrecognized SQL/JSON behavior %d", btype);
4886 : break;
4887 : }
4888 :
4889 4416 : con = makeConst(typid, -1, InvalidOid, len, val, isnull, isbyval);
4890 4416 : con->location = location;
4891 :
4892 4416 : return (Node *) con;
4893 : }
|
