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