Branch data Line data Source code
1 : : /*-------------------------------------------------------------------------
2 : : *
3 : : * analyze.c
4 : : * transform the raw parse tree into a query tree
5 : : *
6 : : * For optimizable statements, we are careful to obtain a suitable lock on
7 : : * each referenced table, and other modules of the backend preserve or
8 : : * re-obtain these locks before depending on the results. It is therefore
9 : : * okay to do significant semantic analysis of these statements. For
10 : : * utility commands, no locks are obtained here (and if they were, we could
11 : : * not be sure we'd still have them at execution). Hence the general rule
12 : : * for utility commands is to just dump them into a Query node untransformed.
13 : : * DECLARE CURSOR, EXPLAIN, and CREATE TABLE AS are exceptions because they
14 : : * contain optimizable statements, which we should transform.
15 : : *
16 : : *
17 : : * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
18 : : * Portions Copyright (c) 1994, Regents of the University of California
19 : : *
20 : : * src/backend/parser/analyze.c
21 : : *
22 : : *-------------------------------------------------------------------------
23 : : */
24 : :
25 : : #include "postgres.h"
26 : :
27 : : #include "access/stratnum.h"
28 : : #include "access/sysattr.h"
29 : : #include "catalog/dependency.h"
30 : : #include "catalog/pg_am.h"
31 : : #include "catalog/pg_operator.h"
32 : : #include "catalog/pg_proc.h"
33 : : #include "catalog/pg_type.h"
34 : : #include "commands/defrem.h"
35 : : #include "miscadmin.h"
36 : : #include "nodes/makefuncs.h"
37 : : #include "nodes/nodeFuncs.h"
38 : : #include "nodes/queryjumble.h"
39 : : #include "optimizer/optimizer.h"
40 : : #include "parser/analyze.h"
41 : : #include "parser/parse_agg.h"
42 : : #include "parser/parse_clause.h"
43 : : #include "parser/parse_coerce.h"
44 : : #include "parser/parse_collate.h"
45 : : #include "parser/parse_cte.h"
46 : : #include "parser/parse_expr.h"
47 : : #include "parser/parse_func.h"
48 : : #include "parser/parse_merge.h"
49 : : #include "parser/parse_oper.h"
50 : : #include "parser/parse_param.h"
51 : : #include "parser/parse_relation.h"
52 : : #include "parser/parse_target.h"
53 : : #include "parser/parse_type.h"
54 : : #include "parser/parsetree.h"
55 : : #include "utils/backend_status.h"
56 : : #include "utils/builtins.h"
57 : : #include "utils/fmgroids.h"
58 : : #include "utils/guc.h"
59 : : #include "utils/lsyscache.h"
60 : : #include "utils/rangetypes.h"
61 : : #include "utils/rel.h"
62 : : #include "utils/syscache.h"
63 : :
64 : :
65 : : /* Passthrough data for transformPLAssignStmtTarget */
66 : : typedef struct SelectStmtPassthrough
67 : : {
68 : : PLAssignStmt *stmt; /* the assignment statement */
69 : : Node *target; /* node representing the target variable */
70 : : List *indirection; /* indirection yet to be applied to target */
71 : : } SelectStmtPassthrough;
72 : :
73 : : /* Hook for plugins to get control at end of parse analysis */
74 : : post_parse_analyze_hook_type post_parse_analyze_hook = NULL;
75 : :
76 : : static Query *transformOptionalSelectInto(ParseState *pstate, Node *parseTree);
77 : : static Query *transformDeleteStmt(ParseState *pstate, DeleteStmt *stmt);
78 : : static Query *transformInsertStmt(ParseState *pstate, InsertStmt *stmt);
79 : : static OnConflictExpr *transformOnConflictClause(ParseState *pstate,
80 : : OnConflictClause *onConflictClause);
81 : : static ForPortionOfExpr *transformForPortionOfClause(ParseState *pstate,
82 : : int rtindex,
83 : : const ForPortionOfClause *forPortionOf,
84 : : const Node *whereClause,
85 : : bool isUpdate);
86 : : static int count_rowexpr_columns(ParseState *pstate, Node *expr);
87 : : static Query *transformSelectStmt(ParseState *pstate, SelectStmt *stmt,
88 : : SelectStmtPassthrough *passthru);
89 : : static Query *transformValuesClause(ParseState *pstate, SelectStmt *stmt);
90 : : static Query *transformSetOperationStmt(ParseState *pstate, SelectStmt *stmt);
91 : : static Node *transformSetOperationTree(ParseState *pstate, SelectStmt *stmt,
92 : : bool isTopLevel, List **targetlist);
93 : : static void determineRecursiveColTypes(ParseState *pstate,
94 : : Node *larg, List *nrtargetlist);
95 : : static Query *transformReturnStmt(ParseState *pstate, ReturnStmt *stmt);
96 : : static Query *transformUpdateStmt(ParseState *pstate, UpdateStmt *stmt);
97 : : static Query *transformPLAssignStmt(ParseState *pstate,
98 : : PLAssignStmt *stmt);
99 : : static List *transformPLAssignStmtTarget(ParseState *pstate, List *tlist,
100 : : SelectStmtPassthrough *passthru);
101 : : static Query *transformDeclareCursorStmt(ParseState *pstate,
102 : : DeclareCursorStmt *stmt);
103 : : static Query *transformExplainStmt(ParseState *pstate,
104 : : ExplainStmt *stmt);
105 : : static Query *transformCreateTableAsStmt(ParseState *pstate,
106 : : CreateTableAsStmt *stmt);
107 : : static Query *transformCallStmt(ParseState *pstate,
108 : : CallStmt *stmt);
109 : : static void transformLockingClause(ParseState *pstate, Query *qry,
110 : : LockingClause *lc, bool pushedDown);
111 : : #ifdef DEBUG_NODE_TESTS_ENABLED
112 : : static bool test_raw_expression_coverage(Node *node, void *context);
113 : : #endif
114 : :
115 : :
116 : : /*
117 : : * parse_analyze_fixedparams
118 : : * Analyze a raw parse tree and transform it to Query form.
119 : : *
120 : : * Optionally, information about $n parameter types can be supplied.
121 : : * References to $n indexes not defined by paramTypes[] are disallowed.
122 : : *
123 : : * The result is a Query node. Optimizable statements require considerable
124 : : * transformation, while utility-type statements are simply hung off
125 : : * a dummy CMD_UTILITY Query node.
126 : : */
127 : : Query *
128 : 492552 : parse_analyze_fixedparams(RawStmt *parseTree, const char *sourceText,
129 : : const Oid *paramTypes, int numParams,
130 : : QueryEnvironment *queryEnv)
131 : : {
132 : 492552 : ParseState *pstate = make_parsestate(NULL);
133 : : Query *query;
134 : 492552 : JumbleState *jstate = NULL;
135 : :
136 : : Assert(sourceText != NULL); /* required as of 8.4 */
137 : :
138 : 492552 : pstate->p_sourcetext = sourceText;
139 : :
140 [ + + ]: 492552 : if (numParams > 0)
141 : 1602 : setup_parse_fixed_parameters(pstate, paramTypes, numParams);
142 : :
143 : 492552 : pstate->p_queryEnv = queryEnv;
144 : :
145 : 492552 : query = transformTopLevelStmt(pstate, parseTree);
146 : :
147 [ + + ]: 486681 : if (IsQueryIdEnabled())
148 : 76283 : jstate = JumbleQuery(query);
149 : :
150 [ + + ]: 486681 : if (post_parse_analyze_hook)
151 : 76110 : (*post_parse_analyze_hook) (pstate, query, jstate);
152 : :
153 : 486681 : free_parsestate(pstate);
154 : :
155 : 486681 : pgstat_report_query_id(query->queryId, false);
156 : :
157 : 486681 : return query;
158 : : }
159 : :
160 : : /*
161 : : * parse_analyze_varparams
162 : : *
163 : : * This variant is used when it's okay to deduce information about $n
164 : : * symbol datatypes from context. The passed-in paramTypes[] array can
165 : : * be modified or enlarged (via repalloc).
166 : : */
167 : : Query *
168 : 6984 : parse_analyze_varparams(RawStmt *parseTree, const char *sourceText,
169 : : Oid **paramTypes, int *numParams,
170 : : QueryEnvironment *queryEnv)
171 : : {
172 : 6984 : ParseState *pstate = make_parsestate(NULL);
173 : : Query *query;
174 : 6984 : JumbleState *jstate = NULL;
175 : :
176 : : Assert(sourceText != NULL); /* required as of 8.4 */
177 : :
178 : 6984 : pstate->p_sourcetext = sourceText;
179 : :
180 : 6984 : setup_parse_variable_parameters(pstate, paramTypes, numParams);
181 : :
182 : 6984 : pstate->p_queryEnv = queryEnv;
183 : :
184 : 6984 : query = transformTopLevelStmt(pstate, parseTree);
185 : :
186 : : /* make sure all is well with parameter types */
187 : 6975 : check_variable_parameters(pstate, query);
188 : :
189 [ + + ]: 6975 : if (IsQueryIdEnabled())
190 : 288 : jstate = JumbleQuery(query);
191 : :
192 [ + + ]: 6975 : if (post_parse_analyze_hook)
193 : 288 : (*post_parse_analyze_hook) (pstate, query, jstate);
194 : :
195 : 6975 : free_parsestate(pstate);
196 : :
197 : 6975 : pgstat_report_query_id(query->queryId, false);
198 : :
199 : 6975 : return query;
200 : : }
201 : :
202 : : /*
203 : : * parse_analyze_withcb
204 : : *
205 : : * This variant is used when the caller supplies their own parser callback to
206 : : * resolve parameters and possibly other things.
207 : : */
208 : : Query *
209 : 25037 : parse_analyze_withcb(RawStmt *parseTree, const char *sourceText,
210 : : ParserSetupHook parserSetup,
211 : : void *parserSetupArg,
212 : : QueryEnvironment *queryEnv)
213 : : {
214 : 25037 : ParseState *pstate = make_parsestate(NULL);
215 : : Query *query;
216 : 25037 : JumbleState *jstate = NULL;
217 : :
218 : : Assert(sourceText != NULL); /* required as of 8.4 */
219 : :
220 : 25037 : pstate->p_sourcetext = sourceText;
221 : 25037 : pstate->p_queryEnv = queryEnv;
222 : 25037 : (*parserSetup) (pstate, parserSetupArg);
223 : :
224 : 25037 : query = transformTopLevelStmt(pstate, parseTree);
225 : :
226 [ + + ]: 24962 : if (IsQueryIdEnabled())
227 : 4221 : jstate = JumbleQuery(query);
228 : :
229 [ + + ]: 24962 : if (post_parse_analyze_hook)
230 : 4213 : (*post_parse_analyze_hook) (pstate, query, jstate);
231 : :
232 : 24962 : free_parsestate(pstate);
233 : :
234 : 24962 : pgstat_report_query_id(query->queryId, false);
235 : :
236 : 24962 : return query;
237 : : }
238 : :
239 : :
240 : : /*
241 : : * parse_sub_analyze
242 : : * Entry point for recursively analyzing a sub-statement.
243 : : */
244 : : Query *
245 : 72866 : parse_sub_analyze(Node *parseTree, ParseState *parentParseState,
246 : : CommonTableExpr *parentCTE,
247 : : bool locked_from_parent,
248 : : bool resolve_unknowns)
249 : : {
250 : 72866 : ParseState *pstate = make_parsestate(parentParseState);
251 : : Query *query;
252 : :
253 : 72866 : pstate->p_parent_cte = parentCTE;
254 : 72866 : pstate->p_locked_from_parent = locked_from_parent;
255 : 72866 : pstate->p_resolve_unknowns = resolve_unknowns;
256 : :
257 : 72866 : query = transformStmt(pstate, parseTree);
258 : :
259 : 72725 : free_parsestate(pstate);
260 : :
261 : 72725 : return query;
262 : : }
263 : :
264 : : /*
265 : : * transformTopLevelStmt -
266 : : * transform a Parse tree into a Query tree.
267 : : *
268 : : * This function is just responsible for transferring statement location data
269 : : * from the RawStmt into the finished Query.
270 : : */
271 : : Query *
272 : 527014 : transformTopLevelStmt(ParseState *pstate, RawStmt *parseTree)
273 : : {
274 : : Query *result;
275 : :
276 : : /* We're at top level, so allow SELECT INTO */
277 : 527014 : result = transformOptionalSelectInto(pstate, parseTree->stmt);
278 : :
279 : 521055 : result->stmt_location = parseTree->stmt_location;
280 : 521055 : result->stmt_len = parseTree->stmt_len;
281 : :
282 : 521055 : return result;
283 : : }
284 : :
285 : : /*
286 : : * transformOptionalSelectInto -
287 : : * If SELECT has INTO, convert it to CREATE TABLE AS.
288 : : *
289 : : * The only thing we do here that we don't do in transformStmt() is to
290 : : * convert SELECT ... INTO into CREATE TABLE AS. Since utility statements
291 : : * aren't allowed within larger statements, this is only allowed at the top
292 : : * of the parse tree, and so we only try it before entering the recursive
293 : : * transformStmt() processing.
294 : : */
295 : : static Query *
296 : 543715 : transformOptionalSelectInto(ParseState *pstate, Node *parseTree)
297 : : {
298 [ + + ]: 543715 : if (IsA(parseTree, SelectStmt))
299 : : {
300 : 236400 : SelectStmt *stmt = (SelectStmt *) parseTree;
301 : :
302 : : /* If it's a set-operation tree, drill down to leftmost SelectStmt */
303 [ + - + + ]: 243488 : while (stmt && stmt->op != SETOP_NONE)
304 : 7088 : stmt = stmt->larg;
305 : : Assert(stmt && IsA(stmt, SelectStmt) && stmt->larg == NULL);
306 : :
307 [ + + ]: 236400 : if (stmt->intoClause)
308 : : {
309 : 71 : CreateTableAsStmt *ctas = makeNode(CreateTableAsStmt);
310 : :
311 : 71 : ctas->query = parseTree;
312 : 71 : ctas->into = stmt->intoClause;
313 : 71 : ctas->objtype = OBJECT_TABLE;
314 : 71 : ctas->is_select_into = true;
315 : :
316 : : /*
317 : : * Remove the intoClause from the SelectStmt. This makes it safe
318 : : * for transformSelectStmt to complain if it finds intoClause set
319 : : * (implying that the INTO appeared in a disallowed place).
320 : : */
321 : 71 : stmt->intoClause = NULL;
322 : :
323 : 71 : parseTree = (Node *) ctas;
324 : : }
325 : : }
326 : :
327 : 543715 : return transformStmt(pstate, parseTree);
328 : : }
329 : :
330 : : /*
331 : : * transformStmt -
332 : : * recursively transform a Parse tree into a Query tree.
333 : : */
334 : : Query *
335 : 629221 : transformStmt(ParseState *pstate, Node *parseTree)
336 : : {
337 : : Query *result;
338 : :
339 : : #ifdef DEBUG_NODE_TESTS_ENABLED
340 : :
341 : : /*
342 : : * We apply debug_raw_expression_coverage_test testing to basic DML
343 : : * statements; we can't just run it on everything because
344 : : * raw_expression_tree_walker() doesn't claim to handle utility
345 : : * statements.
346 : : */
347 [ + - ]: 629221 : if (Debug_raw_expression_coverage_test)
348 : : {
349 [ + + ]: 629221 : switch (nodeTag(parseTree))
350 : : {
351 : 377645 : case T_SelectStmt:
352 : : case T_InsertStmt:
353 : : case T_UpdateStmt:
354 : : case T_DeleteStmt:
355 : : case T_MergeStmt:
356 : 377645 : (void) test_raw_expression_coverage(parseTree, NULL);
357 : 377645 : break;
358 : 251576 : default:
359 : 251576 : break;
360 : : }
361 : : }
362 : : #endif /* DEBUG_NODE_TESTS_ENABLED */
363 : :
364 : : /*
365 : : * Caution: when changing the set of statement types that have non-default
366 : : * processing here, see also stmt_requires_parse_analysis() and
367 : : * analyze_requires_snapshot().
368 : : */
369 [ + + + + : 629221 : switch (nodeTag(parseTree))
+ + + + +
+ + + ]
370 : : {
371 : : /*
372 : : * Optimizable statements
373 : : */
374 : 45428 : case T_InsertStmt:
375 : 45428 : result = transformInsertStmt(pstate, (InsertStmt *) parseTree);
376 : 44433 : break;
377 : :
378 : 3392 : case T_DeleteStmt:
379 : 3392 : result = transformDeleteStmt(pstate, (DeleteStmt *) parseTree);
380 : 3300 : break;
381 : :
382 : 9351 : case T_UpdateStmt:
383 : 9351 : result = transformUpdateStmt(pstate, (UpdateStmt *) parseTree);
384 : 9214 : break;
385 : :
386 : 1386 : case T_MergeStmt:
387 : 1386 : result = transformMergeStmt(pstate, (MergeStmt *) parseTree);
388 : 1342 : break;
389 : :
390 : 318088 : case T_SelectStmt:
391 : : {
392 : 318088 : SelectStmt *n = (SelectStmt *) parseTree;
393 : :
394 [ + + ]: 318088 : if (n->valuesLists)
395 : 5830 : result = transformValuesClause(pstate, n);
396 [ + + ]: 312258 : else if (n->op == SETOP_NONE)
397 : 303698 : result = transformSelectStmt(pstate, n, NULL);
398 : : else
399 : 8560 : result = transformSetOperationStmt(pstate, n);
400 : : }
401 : 313286 : break;
402 : :
403 : 2776 : case T_ReturnStmt:
404 : 2776 : result = transformReturnStmt(pstate, (ReturnStmt *) parseTree);
405 : 2772 : break;
406 : :
407 : 3364 : case T_PLAssignStmt:
408 : 3364 : result = transformPLAssignStmt(pstate,
409 : : (PLAssignStmt *) parseTree);
410 : 3351 : break;
411 : :
412 : : /*
413 : : * Special cases
414 : : */
415 : 2755 : case T_DeclareCursorStmt:
416 : 2755 : result = transformDeclareCursorStmt(pstate,
417 : : (DeclareCursorStmt *) parseTree);
418 : 2742 : break;
419 : :
420 : 16701 : case T_ExplainStmt:
421 : 16701 : result = transformExplainStmt(pstate,
422 : : (ExplainStmt *) parseTree);
423 : 16696 : break;
424 : :
425 : 1319 : case T_CreateTableAsStmt:
426 : 1319 : result = transformCreateTableAsStmt(pstate,
427 : : (CreateTableAsStmt *) parseTree);
428 : 1309 : break;
429 : :
430 : 312 : case T_CallStmt:
431 : 312 : result = transformCallStmt(pstate,
432 : : (CallStmt *) parseTree);
433 : 291 : break;
434 : :
435 : 224349 : default:
436 : :
437 : : /*
438 : : * other statements don't require any transformation; just return
439 : : * the original parsetree with a Query node plastered on top.
440 : : */
441 : 224349 : result = makeNode(Query);
442 : 224349 : result->commandType = CMD_UTILITY;
443 : 224349 : result->utilityStmt = parseTree;
444 : 224349 : break;
445 : : }
446 : :
447 : : /* Mark as original query until we learn differently */
448 : 623085 : result->querySource = QSRC_ORIGINAL;
449 : 623085 : result->canSetTag = true;
450 : :
451 : 623085 : return result;
452 : : }
453 : :
454 : : /*
455 : : * stmt_requires_parse_analysis
456 : : * Returns true if parse analysis will do anything non-trivial
457 : : * with the given raw parse tree.
458 : : *
459 : : * Generally, this should return true for any statement type for which
460 : : * transformStmt() does more than wrap a CMD_UTILITY Query around it.
461 : : * When it returns false, the caller can assume that there is no situation
462 : : * in which parse analysis of the raw statement could need to be re-done.
463 : : *
464 : : * Currently, since the rewriter and planner do nothing for CMD_UTILITY
465 : : * Queries, a false result means that the entire parse analysis/rewrite/plan
466 : : * pipeline will never need to be re-done. If that ever changes, callers
467 : : * will likely need adjustment.
468 : : */
469 : : bool
470 : 22455705 : stmt_requires_parse_analysis(RawStmt *parseTree)
471 : : {
472 : : bool result;
473 : :
474 [ + + + ]: 22455705 : switch (nodeTag(parseTree->stmt))
475 : : {
476 : : /*
477 : : * Optimizable statements
478 : : */
479 : 21924133 : case T_InsertStmt:
480 : : case T_DeleteStmt:
481 : : case T_UpdateStmt:
482 : : case T_MergeStmt:
483 : : case T_SelectStmt:
484 : : case T_ReturnStmt:
485 : : case T_PLAssignStmt:
486 : 21924133 : result = true;
487 : 21924133 : break;
488 : :
489 : : /*
490 : : * Special cases
491 : : */
492 : 32045 : case T_DeclareCursorStmt:
493 : : case T_ExplainStmt:
494 : : case T_CreateTableAsStmt:
495 : : case T_CallStmt:
496 : 32045 : result = true;
497 : 32045 : break;
498 : :
499 : 499527 : default:
500 : : /* all other statements just get wrapped in a CMD_UTILITY Query */
501 : 499527 : result = false;
502 : 499527 : break;
503 : : }
504 : :
505 : 22455705 : return result;
506 : : }
507 : :
508 : : /*
509 : : * analyze_requires_snapshot
510 : : * Returns true if a snapshot must be set before doing parse analysis
511 : : * on the given raw parse tree.
512 : : */
513 : : bool
514 : 461919 : analyze_requires_snapshot(RawStmt *parseTree)
515 : : {
516 : : /*
517 : : * Currently, this should return true in exactly the same cases that
518 : : * stmt_requires_parse_analysis() does, so we just invoke that function
519 : : * rather than duplicating it. We keep the two entry points separate for
520 : : * clarity of callers, since from the callers' standpoint these are
521 : : * different conditions.
522 : : *
523 : : * While there may someday be a statement type for which transformStmt()
524 : : * does something nontrivial and yet no snapshot is needed for that
525 : : * processing, it seems likely that making such a choice would be fragile.
526 : : * If you want to install an exception, document the reasoning for it in a
527 : : * comment.
528 : : */
529 : 461919 : return stmt_requires_parse_analysis(parseTree);
530 : : }
531 : :
532 : : /*
533 : : * query_requires_rewrite_plan()
534 : : * Returns true if rewriting or planning is non-trivial for this Query.
535 : : *
536 : : * This is much like stmt_requires_parse_analysis(), but applies one step
537 : : * further down the pipeline.
538 : : *
539 : : * We do not provide an equivalent of analyze_requires_snapshot(): callers
540 : : * can assume that any rewriting or planning activity needs a snapshot.
541 : : */
542 : : bool
543 : 384391 : query_requires_rewrite_plan(Query *query)
544 : : {
545 : : bool result;
546 : :
547 [ + - ]: 384391 : if (query->commandType != CMD_UTILITY)
548 : : {
549 : : /* All optimizable statements require rewriting/planning */
550 : 384391 : result = true;
551 : : }
552 : : else
553 : : {
554 : : /* This list should match stmt_requires_parse_analysis() */
555 [ # # ]: 0 : switch (nodeTag(query->utilityStmt))
556 : : {
557 : 0 : case T_DeclareCursorStmt:
558 : : case T_ExplainStmt:
559 : : case T_CreateTableAsStmt:
560 : : case T_CallStmt:
561 : 0 : result = true;
562 : 0 : break;
563 : 0 : default:
564 : 0 : result = false;
565 : 0 : break;
566 : : }
567 : : }
568 : 384391 : return result;
569 : : }
570 : :
571 : : /*
572 : : * transformDeleteStmt -
573 : : * transforms a Delete Statement
574 : : */
575 : : static Query *
576 : 3392 : transformDeleteStmt(ParseState *pstate, DeleteStmt *stmt)
577 : : {
578 : 3392 : Query *qry = makeNode(Query);
579 : : ParseNamespaceItem *nsitem;
580 : : Node *qual;
581 : :
582 : 3392 : qry->commandType = CMD_DELETE;
583 : :
584 : : /* process the WITH clause independently of all else */
585 [ + + ]: 3392 : if (stmt->withClause)
586 : : {
587 : 20 : qry->hasRecursive = stmt->withClause->recursive;
588 : 20 : qry->cteList = transformWithClause(pstate, stmt->withClause);
589 : 20 : qry->hasModifyingCTE = pstate->p_hasModifyingCTE;
590 : : }
591 : :
592 : : /* set up range table with just the result rel */
593 : 6780 : qry->resultRelation = setTargetTable(pstate, stmt->relation,
594 : 3392 : stmt->relation->inh,
595 : : true,
596 : : ACL_DELETE);
597 : 3388 : nsitem = pstate->p_target_nsitem;
598 : :
599 : : /* disallow DELETE ... WHERE CURRENT OF on a view */
600 [ + + ]: 3388 : if (stmt->whereClause &&
601 [ + + ]: 2282 : IsA(stmt->whereClause, CurrentOfExpr) &&
602 [ + + ]: 80 : pstate->p_target_relation->rd_rel->relkind == RELKIND_VIEW)
603 [ + - ]: 4 : ereport(ERROR,
604 : : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
605 : : errmsg("WHERE CURRENT OF on a view is not implemented"));
606 : :
607 : : /* there's no DISTINCT in DELETE */
608 : 3384 : qry->distinctClause = NIL;
609 : :
610 : : /* subqueries in USING cannot access the result relation */
611 : 3384 : nsitem->p_lateral_only = true;
612 : 3384 : nsitem->p_lateral_ok = false;
613 : :
614 : : /*
615 : : * The USING clause is non-standard SQL syntax, and is equivalent in
616 : : * functionality to the FROM list that can be specified for UPDATE. The
617 : : * USING keyword is used rather than FROM because FROM is already a
618 : : * keyword in the DELETE syntax.
619 : : */
620 : 3384 : transformFromClause(pstate, stmt->usingClause);
621 : :
622 : : /* remaining clauses can reference the result relation normally */
623 : 3372 : nsitem->p_lateral_only = false;
624 : 3372 : nsitem->p_lateral_ok = true;
625 : :
626 [ + + ]: 3372 : if (stmt->forPortionOf)
627 : 423 : qry->forPortionOf = transformForPortionOfClause(pstate,
628 : : qry->resultRelation,
629 : 475 : stmt->forPortionOf,
630 : 475 : stmt->whereClause,
631 : : false);
632 : :
633 : 3320 : qual = transformWhereClause(pstate, stmt->whereClause,
634 : : EXPR_KIND_WHERE, "WHERE");
635 : :
636 : 3304 : transformReturningClause(pstate, qry, stmt->returningClause,
637 : : EXPR_KIND_RETURNING);
638 : :
639 : : /* done building the range table and jointree */
640 : 3300 : qry->rtable = pstate->p_rtable;
641 : 3300 : qry->rteperminfos = pstate->p_rteperminfos;
642 : 3300 : qry->jointree = makeFromExpr(pstate->p_joinlist, qual);
643 : :
644 : 3300 : qry->hasSubLinks = pstate->p_hasSubLinks;
645 : 3300 : qry->hasWindowFuncs = pstate->p_hasWindowFuncs;
646 : 3300 : qry->hasTargetSRFs = pstate->p_hasTargetSRFs;
647 : 3300 : qry->hasAggs = pstate->p_hasAggs;
648 : :
649 : 3300 : assign_query_collations(pstate, qry);
650 : :
651 : : /* this must be done after collations, for reliable comparison of exprs */
652 [ - + ]: 3300 : if (pstate->p_hasAggs)
653 : 0 : parseCheckAggregates(pstate, qry);
654 : :
655 : 3300 : return qry;
656 : : }
657 : :
658 : : /*
659 : : * transformInsertStmt -
660 : : * transform an Insert Statement
661 : : */
662 : : static Query *
663 : 45428 : transformInsertStmt(ParseState *pstate, InsertStmt *stmt)
664 : : {
665 : 45428 : Query *qry = makeNode(Query);
666 : 45428 : SelectStmt *selectStmt = (SelectStmt *) stmt->selectStmt;
667 : 45428 : List *exprList = NIL;
668 : : bool isGeneralSelect;
669 : : List *sub_rtable;
670 : : List *sub_rteperminfos;
671 : : List *sub_namespace;
672 : : List *icolumns;
673 : : List *attrnos;
674 : : ParseNamespaceItem *nsitem;
675 : : RTEPermissionInfo *perminfo;
676 : : ListCell *icols;
677 : : ListCell *attnos;
678 : : ListCell *lc;
679 : : bool requiresUpdatePerm;
680 : : AclMode targetPerms;
681 : :
682 : : /* There can't be any outer WITH to worry about */
683 : : Assert(pstate->p_ctenamespace == NIL);
684 : :
685 : 45428 : qry->commandType = CMD_INSERT;
686 : :
687 : : /* process the WITH clause independently of all else */
688 [ + + ]: 45428 : if (stmt->withClause)
689 : : {
690 : 190 : qry->hasRecursive = stmt->withClause->recursive;
691 : 190 : qry->cteList = transformWithClause(pstate, stmt->withClause);
692 : 190 : qry->hasModifyingCTE = pstate->p_hasModifyingCTE;
693 : : }
694 : :
695 : 45428 : qry->override = stmt->override;
696 : :
697 : : /*
698 : : * ON CONFLICT DO UPDATE and ON CONFLICT DO SELECT FOR UPDATE/SHARE
699 : : * require UPDATE permission on the target relation.
700 : : */
701 [ + + ]: 46989 : requiresUpdatePerm = (stmt->onConflictClause &&
702 [ + + ]: 1561 : (stmt->onConflictClause->action == ONCONFLICT_UPDATE ||
703 [ + + ]: 626 : (stmt->onConflictClause->action == ONCONFLICT_SELECT &&
704 [ + + ]: 240 : stmt->onConflictClause->lockStrength != LCS_NONE)));
705 : :
706 : : /*
707 : : * We have three cases to deal with: DEFAULT VALUES (selectStmt == NULL),
708 : : * VALUES list, or general SELECT input. We special-case VALUES, both for
709 : : * efficiency and so we can handle DEFAULT specifications.
710 : : *
711 : : * The grammar allows attaching ORDER BY, LIMIT, FOR UPDATE, or WITH to a
712 : : * VALUES clause. If we have any of those, treat it as a general SELECT;
713 : : * so it will work, but you can't use DEFAULT items together with those.
714 : : */
715 [ + + + + ]: 80823 : isGeneralSelect = (selectStmt && (selectStmt->valuesLists == NIL ||
716 [ + - ]: 35395 : selectStmt->sortClause != NIL ||
717 [ + - ]: 35395 : selectStmt->limitOffset != NULL ||
718 [ + - ]: 35395 : selectStmt->limitCount != NULL ||
719 [ + - ]: 35395 : selectStmt->lockingClause != NIL ||
720 [ - + ]: 35395 : selectStmt->withClause != NULL));
721 : :
722 : : /*
723 : : * If a non-nil rangetable/namespace was passed in, and we are doing
724 : : * INSERT/SELECT, arrange to pass the rangetable/rteperminfos/namespace
725 : : * down to the SELECT. This can only happen if we are inside a CREATE
726 : : * RULE, and in that case we want the rule's OLD and NEW rtable entries to
727 : : * appear as part of the SELECT's rtable, not as outer references for it.
728 : : * (Kluge!) The SELECT's joinlist is not affected however. We must do
729 : : * this before adding the target table to the INSERT's rtable.
730 : : */
731 [ + + ]: 45428 : if (isGeneralSelect)
732 : : {
733 : 4501 : sub_rtable = pstate->p_rtable;
734 : 4501 : pstate->p_rtable = NIL;
735 : 4501 : sub_rteperminfos = pstate->p_rteperminfos;
736 : 4501 : pstate->p_rteperminfos = NIL;
737 : 4501 : sub_namespace = pstate->p_namespace;
738 : 4501 : pstate->p_namespace = NIL;
739 : : }
740 : : else
741 : : {
742 : 40927 : sub_rtable = NIL; /* not used, but keep compiler quiet */
743 : 40927 : sub_rteperminfos = NIL;
744 : 40927 : sub_namespace = NIL;
745 : : }
746 : :
747 : : /*
748 : : * Must get write lock on INSERT target table before scanning SELECT, else
749 : : * we will grab the wrong kind of initial lock if the target table is also
750 : : * mentioned in the SELECT part. Note that the target table is not added
751 : : * to the joinlist or namespace.
752 : : */
753 : 45428 : targetPerms = ACL_INSERT;
754 [ + + ]: 45428 : if (requiresUpdatePerm)
755 : 1013 : targetPerms |= ACL_UPDATE;
756 : 45428 : qry->resultRelation = setTargetTable(pstate, stmt->relation,
757 : : false, false, targetPerms);
758 : :
759 : : /* Validate stmt->cols list, or build default list if no list given */
760 : 45412 : icolumns = checkInsertTargets(pstate, stmt->cols, &attrnos);
761 : : Assert(list_length(icolumns) == list_length(attrnos));
762 : :
763 : : /*
764 : : * Determine which variant of INSERT we have.
765 : : */
766 [ + + ]: 45380 : if (selectStmt == NULL)
767 : : {
768 : : /*
769 : : * We have INSERT ... DEFAULT VALUES. We can handle this case by
770 : : * emitting an empty targetlist --- all columns will be defaulted when
771 : : * the planner expands the targetlist.
772 : : */
773 : 5532 : exprList = NIL;
774 : : }
775 [ + + ]: 39848 : else if (isGeneralSelect)
776 : : {
777 : : /*
778 : : * We make the sub-pstate a child of the outer pstate so that it can
779 : : * see any Param definitions supplied from above. Since the outer
780 : : * pstate's rtable and namespace are presently empty, there are no
781 : : * side-effects of exposing names the sub-SELECT shouldn't be able to
782 : : * see.
783 : : */
784 : 4501 : ParseState *sub_pstate = make_parsestate(pstate);
785 : : Query *selectQuery;
786 : :
787 : : /*
788 : : * Process the source SELECT.
789 : : *
790 : : * It is important that this be handled just like a standalone SELECT;
791 : : * otherwise the behavior of SELECT within INSERT might be different
792 : : * from a stand-alone SELECT. (Indeed, Postgres up through 6.5 had
793 : : * bugs of just that nature...)
794 : : *
795 : : * The sole exception is that we prevent resolving unknown-type
796 : : * outputs as TEXT. This does not change the semantics since if the
797 : : * column type matters semantically, it would have been resolved to
798 : : * something else anyway. Doing this lets us resolve such outputs as
799 : : * the target column's type, which we handle below.
800 : : */
801 : 4501 : sub_pstate->p_rtable = sub_rtable;
802 : 4501 : sub_pstate->p_rteperminfos = sub_rteperminfos;
803 : 4501 : sub_pstate->p_joinexprs = NIL; /* sub_rtable has no joins */
804 : 4501 : sub_pstate->p_nullingrels = NIL;
805 : 4501 : sub_pstate->p_namespace = sub_namespace;
806 : 4501 : sub_pstate->p_resolve_unknowns = false;
807 : :
808 : 4501 : selectQuery = transformStmt(sub_pstate, stmt->selectStmt);
809 : :
810 : 4497 : free_parsestate(sub_pstate);
811 : :
812 : : /* The grammar should have produced a SELECT */
813 [ + - ]: 4497 : if (!IsA(selectQuery, Query) ||
814 [ - + ]: 4497 : selectQuery->commandType != CMD_SELECT)
815 [ # # ]: 0 : elog(ERROR, "unexpected non-SELECT command in INSERT ... SELECT");
816 : :
817 : : /*
818 : : * Make the source be a subquery in the INSERT's rangetable, and add
819 : : * it to the INSERT's joinlist (but not the namespace).
820 : : */
821 : 4497 : nsitem = addRangeTableEntryForSubquery(pstate,
822 : : selectQuery,
823 : : NULL,
824 : : false,
825 : : false);
826 : 4497 : addNSItemToQuery(pstate, nsitem, true, false, false);
827 : :
828 : : /*----------
829 : : * Generate an expression list for the INSERT that selects all the
830 : : * non-resjunk columns from the subquery. (INSERT's tlist must be
831 : : * separate from the subquery's tlist because we may add columns,
832 : : * insert datatype coercions, etc.)
833 : : *
834 : : * HACK: unknown-type constants and params in the SELECT's targetlist
835 : : * are copied up as-is rather than being referenced as subquery
836 : : * outputs. This is to ensure that when we try to coerce them to
837 : : * the target column's datatype, the right things happen (see
838 : : * special cases in coerce_type). Otherwise, this fails:
839 : : * INSERT INTO foo SELECT 'bar', ... FROM baz
840 : : *----------
841 : : */
842 : 4497 : exprList = NIL;
843 [ + + + + : 15753 : foreach(lc, selectQuery->targetList)
+ + ]
844 : : {
845 : 11256 : TargetEntry *tle = (TargetEntry *) lfirst(lc);
846 : : Expr *expr;
847 : :
848 [ + + ]: 11256 : if (tle->resjunk)
849 : 64 : continue;
850 [ + - ]: 11192 : if (tle->expr &&
851 [ + + + + : 13875 : (IsA(tle->expr, Const) || IsA(tle->expr, Param)) &&
+ + ]
852 : 2683 : exprType((Node *) tle->expr) == UNKNOWNOID)
853 : 835 : expr = tle->expr;
854 : : else
855 : : {
856 : 10357 : Var *var = makeVarFromTargetEntry(nsitem->p_rtindex, tle);
857 : :
858 : 10357 : var->location = exprLocation((Node *) tle->expr);
859 : 10357 : expr = (Expr *) var;
860 : : }
861 : 11192 : exprList = lappend(exprList, expr);
862 : : }
863 : :
864 : : /* Prepare row for assignment to target table */
865 : 4497 : exprList = transformInsertRow(pstate, exprList,
866 : : stmt->cols,
867 : : icolumns, attrnos,
868 : : false);
869 : : }
870 [ + + ]: 35347 : else if (list_length(selectStmt->valuesLists) > 1)
871 : : {
872 : : /*
873 : : * Process INSERT ... VALUES with multiple VALUES sublists. We
874 : : * generate a VALUES RTE holding the transformed expression lists, and
875 : : * build up a targetlist containing Vars that reference the VALUES
876 : : * RTE.
877 : : */
878 : 3382 : List *exprsLists = NIL;
879 : 3382 : List *coltypes = NIL;
880 : 3382 : List *coltypmods = NIL;
881 : 3382 : List *colcollations = NIL;
882 : 3382 : int sublist_length = -1;
883 : 3382 : bool lateral = false;
884 : :
885 : : Assert(selectStmt->intoClause == NULL);
886 : :
887 [ + - + + : 14857 : foreach(lc, selectStmt->valuesLists)
+ + ]
888 : : {
889 : 11475 : List *sublist = (List *) lfirst(lc);
890 : :
891 : : /*
892 : : * Do basic expression transformation (same as a ROW() expr, but
893 : : * allow SetToDefault at top level)
894 : : */
895 : 11475 : sublist = transformExpressionList(pstate, sublist,
896 : : EXPR_KIND_VALUES, true);
897 : :
898 : : /*
899 : : * All the sublists must be the same length, *after*
900 : : * transformation (which might expand '*' into multiple items).
901 : : * The VALUES RTE can't handle anything different.
902 : : */
903 [ + + ]: 11475 : if (sublist_length < 0)
904 : : {
905 : : /* Remember post-transformation length of first sublist */
906 : 3382 : sublist_length = list_length(sublist);
907 : : }
908 [ - + ]: 8093 : else if (sublist_length != list_length(sublist))
909 : : {
910 [ # # ]: 0 : ereport(ERROR,
911 : : (errcode(ERRCODE_SYNTAX_ERROR),
912 : : errmsg("VALUES lists must all be the same length"),
913 : : parser_errposition(pstate,
914 : : exprLocation((Node *) sublist))));
915 : : }
916 : :
917 : : /*
918 : : * Prepare row for assignment to target table. We process any
919 : : * indirection on the target column specs normally but then strip
920 : : * off the resulting field/array assignment nodes, since we don't
921 : : * want the parsed statement to contain copies of those in each
922 : : * VALUES row. (It's annoying to have to transform the
923 : : * indirection specs over and over like this, but avoiding it
924 : : * would take some really messy refactoring of
925 : : * transformAssignmentIndirection.)
926 : : */
927 : 11475 : sublist = transformInsertRow(pstate, sublist,
928 : : stmt->cols,
929 : : icolumns, attrnos,
930 : : true);
931 : :
932 : : /*
933 : : * We must assign collations now because assign_query_collations
934 : : * doesn't process rangetable entries. We just assign all the
935 : : * collations independently in each row, and don't worry about
936 : : * whether they are consistent vertically. The outer INSERT query
937 : : * isn't going to care about the collations of the VALUES columns,
938 : : * so it's not worth the effort to identify a common collation for
939 : : * each one here. (But note this does have one user-visible
940 : : * consequence: INSERT ... VALUES won't complain about conflicting
941 : : * explicit COLLATEs in a column, whereas the same VALUES
942 : : * construct in another context would complain.)
943 : : */
944 : 11475 : assign_list_collations(pstate, sublist);
945 : :
946 : 11475 : exprsLists = lappend(exprsLists, sublist);
947 : : }
948 : :
949 : : /*
950 : : * Construct column type/typmod/collation lists for the VALUES RTE.
951 : : * Every expression in each column has been coerced to the type/typmod
952 : : * of the corresponding target column or subfield, so it's sufficient
953 : : * to look at the exprType/exprTypmod of the first row. We don't care
954 : : * about the collation labeling, so just fill in InvalidOid for that.
955 : : */
956 [ + - + + : 9807 : foreach(lc, (List *) linitial(exprsLists))
+ + ]
957 : : {
958 : 6425 : Node *val = (Node *) lfirst(lc);
959 : :
960 : 6425 : coltypes = lappend_oid(coltypes, exprType(val));
961 : 6425 : coltypmods = lappend_int(coltypmods, exprTypmod(val));
962 : 6425 : colcollations = lappend_oid(colcollations, InvalidOid);
963 : : }
964 : :
965 : : /*
966 : : * Ordinarily there can't be any current-level Vars in the expression
967 : : * lists, because the namespace was empty ... but if we're inside
968 : : * CREATE RULE, then NEW/OLD references might appear. In that case we
969 : : * have to mark the VALUES RTE as LATERAL.
970 : : */
971 [ + + + - ]: 3400 : if (list_length(pstate->p_rtable) != 1 &&
972 : 18 : contain_vars_of_level((Node *) exprsLists, 0))
973 : 18 : lateral = true;
974 : :
975 : : /*
976 : : * Generate the VALUES RTE
977 : : */
978 : 3382 : nsitem = addRangeTableEntryForValues(pstate, exprsLists,
979 : : coltypes, coltypmods, colcollations,
980 : : NULL, lateral, true);
981 : 3382 : addNSItemToQuery(pstate, nsitem, true, false, false);
982 : :
983 : : /*
984 : : * Generate list of Vars referencing the RTE
985 : : */
986 : 3382 : exprList = expandNSItemVars(pstate, nsitem, 0, -1, NULL);
987 : :
988 : : /*
989 : : * Re-apply any indirection on the target column specs to the Vars
990 : : */
991 : 3382 : exprList = transformInsertRow(pstate, exprList,
992 : : stmt->cols,
993 : : icolumns, attrnos,
994 : : false);
995 : : }
996 : : else
997 : : {
998 : : /*
999 : : * Process INSERT ... VALUES with a single VALUES sublist. We treat
1000 : : * this case separately for efficiency. The sublist is just computed
1001 : : * directly as the Query's targetlist, with no VALUES RTE. So it
1002 : : * works just like a SELECT without any FROM.
1003 : : */
1004 : 31965 : List *valuesLists = selectStmt->valuesLists;
1005 : :
1006 : : Assert(list_length(valuesLists) == 1);
1007 : : Assert(selectStmt->intoClause == NULL);
1008 : :
1009 : : /*
1010 : : * Do basic expression transformation (same as a ROW() expr, but allow
1011 : : * SetToDefault at top level)
1012 : : */
1013 : 31965 : exprList = transformExpressionList(pstate,
1014 : 31965 : (List *) linitial(valuesLists),
1015 : : EXPR_KIND_VALUES_SINGLE,
1016 : : true);
1017 : :
1018 : : /* Prepare row for assignment to target table */
1019 : 31949 : exprList = transformInsertRow(pstate, exprList,
1020 : : stmt->cols,
1021 : : icolumns, attrnos,
1022 : : false);
1023 : : }
1024 : :
1025 : : /*
1026 : : * Generate query's target list using the computed list of expressions.
1027 : : * Also, mark all the target columns as needing insert permissions.
1028 : : */
1029 : 44509 : perminfo = pstate->p_target_nsitem->p_perminfo;
1030 : 44509 : qry->targetList = NIL;
1031 : : Assert(list_length(exprList) <= list_length(icolumns));
1032 [ + + + + : 131267 : forthree(lc, exprList, icols, icolumns, attnos, attrnos)
+ + + + +
+ + + + +
+ - + - +
+ ]
1033 : : {
1034 : 86758 : Expr *expr = (Expr *) lfirst(lc);
1035 : 86758 : ResTarget *col = lfirst_node(ResTarget, icols);
1036 : 86758 : AttrNumber attr_num = (AttrNumber) lfirst_int(attnos);
1037 : : TargetEntry *tle;
1038 : :
1039 : 86758 : tle = makeTargetEntry(expr,
1040 : : attr_num,
1041 : : col->name,
1042 : : false);
1043 : 86758 : qry->targetList = lappend(qry->targetList, tle);
1044 : :
1045 : 86758 : perminfo->insertedCols = bms_add_member(perminfo->insertedCols,
1046 : : attr_num - FirstLowInvalidHeapAttributeNumber);
1047 : : }
1048 : :
1049 : : /*
1050 : : * If we have any clauses yet to process, set the query namespace to
1051 : : * contain only the target relation, removing any entries added in a
1052 : : * sub-SELECT or VALUES list.
1053 : : */
1054 [ + + + + ]: 44509 : if (stmt->onConflictClause || stmt->returningClause)
1055 : : {
1056 : 2208 : pstate->p_namespace = NIL;
1057 : 2208 : addNSItemToQuery(pstate, pstate->p_target_nsitem,
1058 : : false, true, true);
1059 : : }
1060 : :
1061 : : /* ON CONFLICT DO SELECT requires a RETURNING clause */
1062 [ + + ]: 44509 : if (stmt->onConflictClause &&
1063 [ + + ]: 1561 : stmt->onConflictClause->action == ONCONFLICT_SELECT &&
1064 [ + + ]: 240 : !stmt->returningClause)
1065 [ + - ]: 4 : ereport(ERROR,
1066 : : errcode(ERRCODE_SYNTAX_ERROR),
1067 : : errmsg("ON CONFLICT DO SELECT requires a RETURNING clause"),
1068 : : parser_errposition(pstate, stmt->onConflictClause->location));
1069 : :
1070 : : /* Process ON CONFLICT, if any. */
1071 [ + + ]: 44505 : if (stmt->onConflictClause)
1072 : 1557 : qry->onConflict = transformOnConflictClause(pstate,
1073 : : stmt->onConflictClause);
1074 : :
1075 : : /* Process RETURNING, if any. */
1076 [ + + ]: 44465 : if (stmt->returningClause)
1077 : 1099 : transformReturningClause(pstate, qry, stmt->returningClause,
1078 : : EXPR_KIND_RETURNING);
1079 : :
1080 : : /* done building the range table and jointree */
1081 : 44433 : qry->rtable = pstate->p_rtable;
1082 : 44433 : qry->rteperminfos = pstate->p_rteperminfos;
1083 : 44433 : qry->jointree = makeFromExpr(pstate->p_joinlist, NULL);
1084 : :
1085 : 44433 : qry->hasTargetSRFs = pstate->p_hasTargetSRFs;
1086 : 44433 : qry->hasSubLinks = pstate->p_hasSubLinks;
1087 : :
1088 : 44433 : assign_query_collations(pstate, qry);
1089 : :
1090 : 44433 : return qry;
1091 : : }
1092 : :
1093 : : /*
1094 : : * Prepare an INSERT row for assignment to the target table.
1095 : : *
1096 : : * exprlist: transformed expressions for source values; these might come from
1097 : : * a VALUES row, or be Vars referencing a sub-SELECT or VALUES RTE output.
1098 : : * stmtcols: original target-columns spec for INSERT (we just test for NIL)
1099 : : * icolumns: effective target-columns spec (list of ResTarget)
1100 : : * attrnos: integer column numbers (must be same length as icolumns)
1101 : : * strip_indirection: if true, remove any field/array assignment nodes
1102 : : */
1103 : : List *
1104 : 51959 : transformInsertRow(ParseState *pstate, List *exprlist,
1105 : : List *stmtcols, List *icolumns, List *attrnos,
1106 : : bool strip_indirection)
1107 : : {
1108 : : List *result;
1109 : : ListCell *lc;
1110 : : ListCell *icols;
1111 : : ListCell *attnos;
1112 : :
1113 : : /*
1114 : : * Check length of expr list. It must not have more expressions than
1115 : : * there are target columns. We allow fewer, but only if no explicit
1116 : : * columns list was given (the remaining columns are implicitly
1117 : : * defaulted). Note we must check this *after* transformation because
1118 : : * that could expand '*' into multiple items.
1119 : : */
1120 [ + + ]: 51959 : if (list_length(exprlist) > list_length(icolumns))
1121 [ + - ]: 17 : ereport(ERROR,
1122 : : (errcode(ERRCODE_SYNTAX_ERROR),
1123 : : errmsg("INSERT has more expressions than target columns"),
1124 : : parser_errposition(pstate,
1125 : : exprLocation(list_nth(exprlist,
1126 : : list_length(icolumns))))));
1127 [ + + + + ]: 62907 : if (stmtcols != NIL &&
1128 : 10965 : list_length(exprlist) < list_length(icolumns))
1129 : : {
1130 : : /*
1131 : : * We can get here for cases like INSERT ... SELECT (a,b,c) FROM ...
1132 : : * where the user accidentally created a RowExpr instead of separate
1133 : : * columns. Add a suitable hint if that seems to be the problem,
1134 : : * because the main error message is quite misleading for this case.
1135 : : * (If there's no stmtcols, you'll get something about data type
1136 : : * mismatch, which is less misleading so we don't worry about giving a
1137 : : * hint in that case.)
1138 : : */
1139 [ + - - + : 8 : ereport(ERROR,
- - ]
1140 : : (errcode(ERRCODE_SYNTAX_ERROR),
1141 : : errmsg("INSERT has more target columns than expressions"),
1142 : : ((list_length(exprlist) == 1 &&
1143 : : count_rowexpr_columns(pstate, linitial(exprlist)) ==
1144 : : list_length(icolumns)) ?
1145 : : errhint("The insertion source is a row expression containing the same number of columns expected by the INSERT. Did you accidentally use extra parentheses?") : 0),
1146 : : parser_errposition(pstate,
1147 : : exprLocation(list_nth(icolumns,
1148 : : list_length(exprlist))))));
1149 : : }
1150 : :
1151 : : /*
1152 : : * Prepare columns for assignment to target table.
1153 : : */
1154 : 51934 : result = NIL;
1155 [ + + + + : 165267 : forthree(lc, exprlist, icols, icolumns, attnos, attrnos)
+ + + + +
+ + + + +
+ - + - +
+ ]
1156 : : {
1157 : 114159 : Expr *expr = (Expr *) lfirst(lc);
1158 : 114159 : ResTarget *col = lfirst_node(ResTarget, icols);
1159 : 114159 : int attno = lfirst_int(attnos);
1160 : :
1161 : 114159 : expr = transformAssignedExpr(pstate, expr,
1162 : : EXPR_KIND_INSERT_TARGET,
1163 : 114159 : col->name,
1164 : : attno,
1165 : : col->indirection,
1166 : : col->location);
1167 : :
1168 [ + + ]: 113333 : if (strip_indirection)
1169 : : {
1170 : : /*
1171 : : * We need to remove top-level FieldStores and SubscriptingRefs,
1172 : : * as well as any CoerceToDomain appearing above one of those ---
1173 : : * but not a CoerceToDomain that isn't above one of those.
1174 : : */
1175 [ + - ]: 25431 : while (expr)
1176 : : {
1177 : 25431 : Expr *subexpr = expr;
1178 : :
1179 [ + + ]: 25607 : while (IsA(subexpr, CoerceToDomain))
1180 : : {
1181 : 176 : subexpr = ((CoerceToDomain *) subexpr)->arg;
1182 : : }
1183 [ + + ]: 25431 : if (IsA(subexpr, FieldStore))
1184 : : {
1185 : 144 : FieldStore *fstore = (FieldStore *) subexpr;
1186 : :
1187 : 144 : expr = (Expr *) linitial(fstore->newvals);
1188 : : }
1189 [ + + ]: 25287 : else if (IsA(subexpr, SubscriptingRef))
1190 : : {
1191 : 232 : SubscriptingRef *sbsref = (SubscriptingRef *) subexpr;
1192 : :
1193 [ - + ]: 232 : if (sbsref->refassgnexpr == NULL)
1194 : 0 : break;
1195 : :
1196 : 232 : expr = sbsref->refassgnexpr;
1197 : : }
1198 : : else
1199 : 25055 : break;
1200 : : }
1201 : : }
1202 : :
1203 : 113333 : result = lappend(result, expr);
1204 : : }
1205 : :
1206 : 51108 : return result;
1207 : : }
1208 : :
1209 : : /*
1210 : : * transformOnConflictClause -
1211 : : * transforms an OnConflictClause in an INSERT
1212 : : */
1213 : : static OnConflictExpr *
1214 : 1557 : transformOnConflictClause(ParseState *pstate,
1215 : : OnConflictClause *onConflictClause)
1216 : : {
1217 : 1557 : ParseNamespaceItem *exclNSItem = NULL;
1218 : : List *arbiterElems;
1219 : : Node *arbiterWhere;
1220 : : Oid arbiterConstraint;
1221 : 1557 : List *onConflictSet = NIL;
1222 : 1557 : Node *onConflictWhere = NULL;
1223 : 1557 : int exclRelIndex = 0;
1224 : 1557 : List *exclRelTlist = NIL;
1225 : : OnConflictExpr *result;
1226 : :
1227 : : /*
1228 : : * If this is ON CONFLICT DO SELECT/UPDATE, first create the range table
1229 : : * entry for the EXCLUDED pseudo relation, so that that will be present
1230 : : * while processing arbiter expressions. (You can't actually reference it
1231 : : * from there, but this provides a useful error message if you try.)
1232 : : */
1233 [ + + ]: 1557 : if (onConflictClause->action == ONCONFLICT_UPDATE ||
1234 [ + + ]: 622 : onConflictClause->action == ONCONFLICT_SELECT)
1235 : : {
1236 : 1171 : Relation targetrel = pstate->p_target_relation;
1237 : : RangeTblEntry *exclRte;
1238 : :
1239 : 1171 : exclNSItem = addRangeTableEntryForRelation(pstate,
1240 : : targetrel,
1241 : : RowExclusiveLock,
1242 : : makeAlias("excluded", NIL),
1243 : : false, false);
1244 : 1171 : exclRte = exclNSItem->p_rte;
1245 : 1171 : exclRelIndex = exclNSItem->p_rtindex;
1246 : :
1247 : : /*
1248 : : * relkind is set to composite to signal that we're not dealing with
1249 : : * an actual relation, and no permission checks are required on it.
1250 : : * (We'll check the actual target relation, instead.)
1251 : : */
1252 : 1171 : exclRte->relkind = RELKIND_COMPOSITE_TYPE;
1253 : :
1254 : : /* Create EXCLUDED rel's targetlist for use by EXPLAIN */
1255 : 1171 : exclRelTlist = BuildOnConflictExcludedTargetlist(targetrel,
1256 : : exclRelIndex);
1257 : : }
1258 : :
1259 : : /* Process the arbiter clause, ON CONFLICT ON (...) */
1260 : 1557 : transformOnConflictArbiter(pstate, onConflictClause, &arbiterElems,
1261 : : &arbiterWhere, &arbiterConstraint);
1262 : :
1263 : : /* Process DO SELECT/UPDATE */
1264 [ + + ]: 1537 : if (onConflictClause->action == ONCONFLICT_UPDATE ||
1265 [ + + ]: 610 : onConflictClause->action == ONCONFLICT_SELECT)
1266 : : {
1267 : : /*
1268 : : * Add the EXCLUDED pseudo relation to the query namespace, making it
1269 : : * available in SET and WHERE subexpressions.
1270 : : */
1271 : 1163 : addNSItemToQuery(pstate, exclNSItem, false, true, true);
1272 : :
1273 : : /* Process the UPDATE SET clause */
1274 [ + + ]: 1163 : if (onConflictClause->action == ONCONFLICT_UPDATE)
1275 : : onConflictSet =
1276 : 927 : transformUpdateTargetList(pstate, onConflictClause->targetList, NULL);
1277 : :
1278 : : /* Process the SELECT/UPDATE WHERE clause */
1279 : 1143 : onConflictWhere = transformWhereClause(pstate,
1280 : : onConflictClause->whereClause,
1281 : : EXPR_KIND_WHERE, "WHERE");
1282 : :
1283 : : /*
1284 : : * Remove the EXCLUDED pseudo relation from the query namespace, since
1285 : : * it's not supposed to be available in RETURNING. (Maybe someday we
1286 : : * could allow that, and drop this step.)
1287 : : */
1288 : : Assert((ParseNamespaceItem *) llast(pstate->p_namespace) == exclNSItem);
1289 : 1143 : pstate->p_namespace = list_delete_last(pstate->p_namespace);
1290 : : }
1291 : :
1292 : : /* Finally, build ON CONFLICT DO [NOTHING | SELECT | UPDATE] expression */
1293 : 1517 : result = makeNode(OnConflictExpr);
1294 : :
1295 : 1517 : result->action = onConflictClause->action;
1296 : 1517 : result->arbiterElems = arbiterElems;
1297 : 1517 : result->arbiterWhere = arbiterWhere;
1298 : 1517 : result->constraint = arbiterConstraint;
1299 : 1517 : result->lockStrength = onConflictClause->lockStrength;
1300 : 1517 : result->onConflictSet = onConflictSet;
1301 : 1517 : result->onConflictWhere = onConflictWhere;
1302 : 1517 : result->exclRelIndex = exclRelIndex;
1303 : 1517 : result->exclRelTlist = exclRelTlist;
1304 : :
1305 : 1517 : return result;
1306 : : }
1307 : :
1308 : : /*
1309 : : * transformForPortionOfClause
1310 : : *
1311 : : * Transforms a ForPortionOfClause in an UPDATE/DELETE statement.
1312 : : *
1313 : : * - Look up the range/period requested.
1314 : : * - Build a compatible range value from the FROM and TO expressions.
1315 : : * - Build an "overlaps" expression for filtering, used later by the
1316 : : * rewriter.
1317 : : * - For UPDATEs, build an "intersects" expression the rewriter can add
1318 : : * to the targetList to change the temporal bounds.
1319 : : */
1320 : : static ForPortionOfExpr *
1321 : 1093 : transformForPortionOfClause(ParseState *pstate,
1322 : : int rtindex,
1323 : : const ForPortionOfClause *forPortionOf,
1324 : : const Node *whereClause,
1325 : : bool isUpdate)
1326 : : {
1327 : 1093 : Relation targetrel = pstate->p_target_relation;
1328 : 1093 : int range_attno = InvalidAttrNumber;
1329 : : Form_pg_attribute attr;
1330 : : Oid attbasetype;
1331 : : Oid opclass;
1332 : : Oid opfamily;
1333 : : Oid opcintype;
1334 : 1093 : Oid funcid = InvalidOid;
1335 : : StrategyNumber strat;
1336 : : Oid opid;
1337 : : OpExpr *op;
1338 : : ForPortionOfExpr *result;
1339 : : Var *rangeVar;
1340 : :
1341 : : /* disallow FOR PORTION OF ... WHERE CURRENT OF */
1342 [ + + + + ]: 1093 : if (whereClause && IsA(whereClause, CurrentOfExpr))
1343 [ + - ]: 8 : ereport(ERROR,
1344 : : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1345 : : errmsg("WHERE CURRENT OF with FOR PORTION OF is not implemented"));
1346 : :
1347 : 1085 : result = makeNode(ForPortionOfExpr);
1348 : :
1349 : : /* Look up the FOR PORTION OF name requested. */
1350 : 1085 : range_attno = attnameAttNum(targetrel, forPortionOf->range_name, false);
1351 [ + + ]: 1085 : if (range_attno == InvalidAttrNumber)
1352 [ + - ]: 8 : ereport(ERROR,
1353 : : (errcode(ERRCODE_UNDEFINED_COLUMN),
1354 : : errmsg("column \"%s\" of relation \"%s\" does not exist",
1355 : : forPortionOf->range_name,
1356 : : RelationGetRelationName(targetrel)),
1357 : : parser_errposition(pstate, forPortionOf->location)));
1358 : 1077 : attr = TupleDescAttr(targetrel->rd_att, range_attno - 1);
1359 : :
1360 : 1077 : attbasetype = getBaseType(attr->atttypid);
1361 : :
1362 : 1077 : rangeVar = makeVar(rtindex,
1363 : : range_attno,
1364 : : attr->atttypid,
1365 : : attr->atttypmod,
1366 : : attr->attcollation,
1367 : : 0);
1368 : 1077 : rangeVar->location = forPortionOf->location;
1369 : 1077 : result->rangeVar = rangeVar;
1370 : :
1371 : : /* Require SELECT privilege on the application-time column. */
1372 : 1077 : markVarForSelectPriv(pstate, rangeVar);
1373 : :
1374 : : /*
1375 : : * Use the basetype for the target, which shouldn't be required to follow
1376 : : * domain rules. The table's column type is in the Var if we need it.
1377 : : */
1378 : 1077 : result->rangeType = attbasetype;
1379 : 1077 : result->isDomain = attbasetype != attr->atttypid;
1380 : :
1381 [ + + ]: 1077 : if (forPortionOf->target)
1382 : : {
1383 : 200 : Oid declared_target_type = attbasetype;
1384 : : Oid actual_target_type;
1385 : :
1386 : : /*
1387 : : * We were already given an expression for the target, so we don't
1388 : : * have to build anything. We still have to make sure we got the right
1389 : : * type. NULL will be caught be the executor.
1390 : : */
1391 : :
1392 : 400 : result->targetRange = transformExpr(pstate,
1393 : 200 : forPortionOf->target,
1394 : : EXPR_KIND_FOR_PORTION);
1395 : :
1396 : 200 : actual_target_type = exprType(result->targetRange);
1397 : :
1398 [ + + ]: 200 : if (!can_coerce_type(1, &actual_target_type, &declared_target_type, COERCION_IMPLICIT))
1399 [ + - ]: 32 : ereport(ERROR,
1400 : : (errcode(ERRCODE_DATATYPE_MISMATCH),
1401 : : errmsg("could not coerce FOR PORTION OF target from %s to %s",
1402 : : format_type_be(actual_target_type),
1403 : : format_type_be(declared_target_type)),
1404 : : parser_errposition(pstate, exprLocation(forPortionOf->target))));
1405 : :
1406 : 168 : result->targetRange = coerce_type(pstate,
1407 : : result->targetRange,
1408 : : actual_target_type,
1409 : : declared_target_type,
1410 : : -1,
1411 : : COERCION_IMPLICIT,
1412 : : COERCE_IMPLICIT_CAST,
1413 : 168 : exprLocation(forPortionOf->target));
1414 : :
1415 : : /*
1416 : : * XXX: For now we only support ranges and multiranges, so we fail on
1417 : : * anything else.
1418 : : */
1419 [ + + + + ]: 168 : if (!type_is_range(attbasetype) && !type_is_multirange(attbasetype))
1420 [ + - ]: 24 : ereport(ERROR,
1421 : : (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
1422 : : errmsg("column \"%s\" of relation \"%s\" is not a range or multirange type",
1423 : : forPortionOf->range_name,
1424 : : RelationGetRelationName(targetrel)),
1425 : : parser_errposition(pstate, forPortionOf->location)));
1426 : :
1427 : : }
1428 : : else
1429 : : {
1430 : : Oid rngsubtype;
1431 : : Oid declared_arg_types[2];
1432 : : Oid actual_arg_types[2];
1433 : : List *args;
1434 : :
1435 : : /*
1436 : : * Make sure it's a range column. XXX: We could support this syntax on
1437 : : * multirange columns too, if we just built a one-range multirange
1438 : : * from the FROM/TO phrases.
1439 : : */
1440 [ + + ]: 877 : if (!type_is_range(attbasetype))
1441 [ + - ]: 8 : ereport(ERROR,
1442 : : (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
1443 : : errmsg("column \"%s\" of relation \"%s\" is not a range type",
1444 : : forPortionOf->range_name,
1445 : : RelationGetRelationName(targetrel)),
1446 : : parser_errposition(pstate, forPortionOf->location)));
1447 : :
1448 : 869 : rngsubtype = get_range_subtype(attbasetype);
1449 : 869 : declared_arg_types[0] = rngsubtype;
1450 : 869 : declared_arg_types[1] = rngsubtype;
1451 : :
1452 : : /*
1453 : : * Build a range from the FROM ... TO ... bounds. This should give a
1454 : : * constant result, so we accept functions like NOW() but not column
1455 : : * references, subqueries, etc.
1456 : : */
1457 : 1722 : result->targetFrom = transformExpr(pstate,
1458 : 869 : forPortionOf->target_start,
1459 : : EXPR_KIND_FOR_PORTION);
1460 : 1706 : result->targetTo = transformExpr(pstate,
1461 : 853 : forPortionOf->target_end,
1462 : : EXPR_KIND_FOR_PORTION);
1463 : 853 : actual_arg_types[0] = exprType(result->targetFrom);
1464 : 853 : actual_arg_types[1] = exprType(result->targetTo);
1465 : 853 : args = list_make2(copyObject(result->targetFrom),
1466 : : copyObject(result->targetTo));
1467 : :
1468 : : /*
1469 : : * Check the bound types separately, for better error message and
1470 : : * location
1471 : : */
1472 [ + + ]: 853 : if (!can_coerce_type(1, actual_arg_types, declared_arg_types, COERCION_IMPLICIT))
1473 [ + - ]: 8 : ereport(ERROR,
1474 : : (errcode(ERRCODE_DATATYPE_MISMATCH),
1475 : : errmsg("could not coerce FOR PORTION OF %s bound from %s to %s",
1476 : : "FROM",
1477 : : format_type_be(actual_arg_types[0]),
1478 : : format_type_be(declared_arg_types[0])),
1479 : : parser_errposition(pstate, exprLocation(forPortionOf->target_start))));
1480 [ + + ]: 845 : if (!can_coerce_type(1, &actual_arg_types[1], &declared_arg_types[1], COERCION_IMPLICIT))
1481 [ + - ]: 8 : ereport(ERROR,
1482 : : (errcode(ERRCODE_DATATYPE_MISMATCH),
1483 : : errmsg("could not coerce FOR PORTION OF %s bound from %s to %s",
1484 : : "TO",
1485 : : format_type_be(actual_arg_types[1]),
1486 : : format_type_be(declared_arg_types[1])),
1487 : : parser_errposition(pstate, exprLocation(forPortionOf->target_end))));
1488 : :
1489 : 837 : make_fn_arguments(pstate, args, actual_arg_types, declared_arg_types);
1490 : 837 : result->targetRange = (Node *) makeFuncExpr(get_range_constructor2(attbasetype),
1491 : : attbasetype,
1492 : : args,
1493 : : InvalidOid, InvalidOid, COERCE_EXPLICIT_CALL);
1494 : : }
1495 : :
1496 : : /*
1497 : : * Build overlapsExpr to use as an extra qual. This means we only hit rows
1498 : : * matching the FROM & TO bounds. We must look up the overlaps operator
1499 : : * (usually "&&").
1500 : : */
1501 : 981 : opclass = GetDefaultOpClass(attr->atttypid, GIST_AM_OID);
1502 [ - + ]: 981 : if (!OidIsValid(opclass))
1503 [ # # ]: 0 : ereport(ERROR,
1504 : : (errcode(ERRCODE_UNDEFINED_OBJECT),
1505 : : errmsg("data type %s has no default operator class for access method \"%s\"",
1506 : : format_type_be(attr->atttypid), "gist"),
1507 : : errhint("You must define a default operator class for the data type.")));
1508 : :
1509 : : /* Look up the operators and functions we need. */
1510 : 981 : GetOperatorFromCompareType(opclass, InvalidOid, COMPARE_OVERLAP, &opid, &strat);
1511 : 981 : op = makeNode(OpExpr);
1512 : 981 : op->opno = opid;
1513 : 981 : op->opfuncid = get_opcode(opid);
1514 : 981 : op->opresulttype = BOOLOID;
1515 : 981 : op->args = list_make2(copyObject(rangeVar), copyObject(result->targetRange));
1516 : 981 : result->overlapsExpr = (Node *) op;
1517 : :
1518 : : /*
1519 : : * Look up the without_portion func. This computes the bounds of temporal
1520 : : * leftovers.
1521 : : *
1522 : : * XXX: Find a more extensible way to look up the function, permitting
1523 : : * user-defined types. An opclass support function doesn't make sense,
1524 : : * since there is no index involved. Perhaps a type support function.
1525 : : */
1526 [ + - ]: 981 : if (get_opclass_opfamily_and_input_type(opclass, &opfamily, &opcintype))
1527 [ + + - ]: 981 : switch (opcintype)
1528 : : {
1529 : 893 : case ANYRANGEOID:
1530 : 893 : result->withoutPortionProc = F_RANGE_MINUS_MULTI;
1531 : 893 : break;
1532 : 88 : case ANYMULTIRANGEOID:
1533 : 88 : result->withoutPortionProc = F_MULTIRANGE_MINUS_MULTI;
1534 : 88 : break;
1535 : 0 : default:
1536 [ # # ]: 0 : elog(ERROR, "unexpected opcintype: %u", opcintype);
1537 : : }
1538 : : else
1539 [ # # ]: 0 : elog(ERROR, "unexpected opclass: %u", opclass);
1540 : :
1541 [ + + ]: 981 : if (isUpdate)
1542 : : {
1543 : : /*
1544 : : * Now make sure we update the start/end time of the record. For a
1545 : : * range col (r) this is `r = r * targetRange` (where * is the
1546 : : * intersect operator).
1547 : : */
1548 : : Oid intersectoperoid;
1549 : : List *funcArgs;
1550 : : Node *rangeTLEExpr;
1551 : : TargetEntry *tle;
1552 : 558 : RTEPermissionInfo *target_perminfo = pstate->p_target_nsitem->p_perminfo;
1553 : :
1554 : : /*
1555 : : * Whatever operator is used for intersect by temporal foreign keys,
1556 : : * we can use its backing procedure for intersects in FOR PORTION OF.
1557 : : * XXX: Share code with FindFKPeriodOpers?
1558 : : */
1559 [ + + - ]: 558 : switch (opcintype)
1560 : : {
1561 : 510 : case ANYRANGEOID:
1562 : 510 : intersectoperoid = OID_RANGE_INTERSECT_RANGE_OP;
1563 : 510 : break;
1564 : 48 : case ANYMULTIRANGEOID:
1565 : 48 : intersectoperoid = OID_MULTIRANGE_INTERSECT_MULTIRANGE_OP;
1566 : 48 : break;
1567 : 0 : default:
1568 [ # # ]: 0 : elog(ERROR, "unexpected opcintype: %u", opcintype);
1569 : : }
1570 : 558 : funcid = get_opcode(intersectoperoid);
1571 [ - + ]: 558 : if (!OidIsValid(funcid))
1572 [ # # ]: 0 : ereport(ERROR,
1573 : : errcode(ERRCODE_UNDEFINED_OBJECT),
1574 : : errmsg("could not identify an intersect function for type %s",
1575 : : format_type_be(opcintype)));
1576 : :
1577 : 558 : funcArgs = list_make2(copyObject(rangeVar),
1578 : : copyObject(result->targetRange));
1579 : 558 : rangeTLEExpr = (Node *) makeFuncExpr(funcid, attbasetype, funcArgs,
1580 : : InvalidOid, InvalidOid,
1581 : : COERCE_EXPLICIT_CALL);
1582 : :
1583 : : /*
1584 : : * Coerce to domain if necessary. If we skip this, we will allow
1585 : : * updating to forbidden values.
1586 : : */
1587 : 558 : rangeTLEExpr = coerce_type(pstate,
1588 : : rangeTLEExpr,
1589 : : attbasetype,
1590 : : attr->atttypid,
1591 : : -1,
1592 : : COERCION_IMPLICIT,
1593 : : COERCE_IMPLICIT_CAST,
1594 : 558 : exprLocation(forPortionOf->target));
1595 : :
1596 : : /* Make a TLE to set the range column */
1597 : 558 : result->rangeTargetList = NIL;
1598 : 558 : tle = makeTargetEntry((Expr *) rangeTLEExpr, range_attno,
1599 : 558 : forPortionOf->range_name, false);
1600 : 558 : result->rangeTargetList = lappend(result->rangeTargetList, tle);
1601 : :
1602 : : /* Mark the range column as requiring update permissions */
1603 : 558 : target_perminfo->updatedCols = bms_add_member(target_perminfo->updatedCols,
1604 : : range_attno - FirstLowInvalidHeapAttributeNumber);
1605 : : }
1606 : : else
1607 : 423 : result->rangeTargetList = NIL;
1608 : :
1609 : 981 : result->range_name = forPortionOf->range_name;
1610 : 981 : result->location = forPortionOf->location;
1611 : 981 : result->targetLocation = forPortionOf->target_location;
1612 : :
1613 : 981 : return result;
1614 : : }
1615 : :
1616 : : /*
1617 : : * BuildOnConflictExcludedTargetlist
1618 : : * Create target list for the EXCLUDED pseudo-relation of ON CONFLICT,
1619 : : * representing the columns of targetrel with varno exclRelIndex.
1620 : : *
1621 : : * Note: Exported for use in the rewriter.
1622 : : */
1623 : : List *
1624 : 1319 : BuildOnConflictExcludedTargetlist(Relation targetrel,
1625 : : Index exclRelIndex)
1626 : : {
1627 : 1319 : List *result = NIL;
1628 : : int attno;
1629 : : Var *var;
1630 : : TargetEntry *te;
1631 : :
1632 : : /*
1633 : : * Note that resnos of the tlist must correspond to attnos of the
1634 : : * underlying relation, hence we need entries for dropped columns too.
1635 : : */
1636 [ + + ]: 4727 : for (attno = 0; attno < RelationGetNumberOfAttributes(targetrel); attno++)
1637 : : {
1638 : 3408 : Form_pg_attribute attr = TupleDescAttr(targetrel->rd_att, attno);
1639 : : char *name;
1640 : :
1641 [ + + ]: 3408 : if (attr->attisdropped)
1642 : : {
1643 : : /*
1644 : : * can't use atttypid here, but it doesn't really matter what type
1645 : : * the Const claims to be.
1646 : : */
1647 : 74 : var = (Var *) makeNullConst(INT4OID, -1, InvalidOid);
1648 : 74 : name = NULL;
1649 : : }
1650 : : else
1651 : : {
1652 : 3334 : var = makeVar(exclRelIndex, attno + 1,
1653 : : attr->atttypid, attr->atttypmod,
1654 : : attr->attcollation,
1655 : : 0);
1656 : 3334 : name = pstrdup(NameStr(attr->attname));
1657 : : }
1658 : :
1659 : 3408 : te = makeTargetEntry((Expr *) var,
1660 : 3408 : attno + 1,
1661 : : name,
1662 : : false);
1663 : :
1664 : 3408 : result = lappend(result, te);
1665 : : }
1666 : :
1667 : : /*
1668 : : * Add a whole-row-Var entry to support references to "EXCLUDED.*". Like
1669 : : * the other entries in the EXCLUDED tlist, its resno must match the Var's
1670 : : * varattno, else the wrong things happen while resolving references in
1671 : : * setrefs.c. This is against normal conventions for targetlists, but
1672 : : * it's okay since we don't use this as a real tlist.
1673 : : */
1674 : 1319 : var = makeVar(exclRelIndex, InvalidAttrNumber,
1675 : 1319 : targetrel->rd_rel->reltype,
1676 : : -1, InvalidOid, 0);
1677 : 1319 : te = makeTargetEntry((Expr *) var, InvalidAttrNumber, NULL, true);
1678 : 1319 : result = lappend(result, te);
1679 : :
1680 : 1319 : return result;
1681 : : }
1682 : :
1683 : :
1684 : : /*
1685 : : * count_rowexpr_columns -
1686 : : * get number of columns contained in a ROW() expression;
1687 : : * return -1 if expression isn't a RowExpr or a Var referencing one.
1688 : : *
1689 : : * This is currently used only for hint purposes, so we aren't terribly
1690 : : * tense about recognizing all possible cases. The Var case is interesting
1691 : : * because that's what we'll get in the INSERT ... SELECT (...) case.
1692 : : */
1693 : : static int
1694 : 0 : count_rowexpr_columns(ParseState *pstate, Node *expr)
1695 : : {
1696 [ # # ]: 0 : if (expr == NULL)
1697 : 0 : return -1;
1698 [ # # ]: 0 : if (IsA(expr, RowExpr))
1699 : 0 : return list_length(((RowExpr *) expr)->args);
1700 [ # # ]: 0 : if (IsA(expr, Var))
1701 : : {
1702 : 0 : Var *var = (Var *) expr;
1703 : 0 : AttrNumber attnum = var->varattno;
1704 : :
1705 [ # # # # ]: 0 : if (attnum > 0 && var->vartype == RECORDOID)
1706 : : {
1707 : : RangeTblEntry *rte;
1708 : :
1709 : 0 : rte = GetRTEByRangeTablePosn(pstate, var->varno, var->varlevelsup);
1710 [ # # ]: 0 : if (rte->rtekind == RTE_SUBQUERY)
1711 : : {
1712 : : /* Subselect-in-FROM: examine sub-select's output expr */
1713 : 0 : TargetEntry *ste = get_tle_by_resno(rte->subquery->targetList,
1714 : : attnum);
1715 : :
1716 [ # # # # ]: 0 : if (ste == NULL || ste->resjunk)
1717 : 0 : return -1;
1718 : 0 : expr = (Node *) ste->expr;
1719 [ # # ]: 0 : if (IsA(expr, RowExpr))
1720 : 0 : return list_length(((RowExpr *) expr)->args);
1721 : : }
1722 : : }
1723 : : }
1724 : 0 : return -1;
1725 : : }
1726 : :
1727 : :
1728 : : /*
1729 : : * transformSelectStmt -
1730 : : * transforms a Select Statement
1731 : : *
1732 : : * This function is also used to transform the source expression of a
1733 : : * PLAssignStmt. In that usage, passthru is non-NULL and we need to
1734 : : * call transformPLAssignStmtTarget after the initial transformation of the
1735 : : * SELECT's targetlist. (We could generalize this into an arbitrary callback
1736 : : * function, but for now that would just be more notation with no benefit.)
1737 : : * All the rest is the same as a regular SelectStmt.
1738 : : *
1739 : : * Note: this covers only cases with no set operations and no VALUES lists;
1740 : : * see below for the other cases.
1741 : : */
1742 : : static Query *
1743 : 307056 : transformSelectStmt(ParseState *pstate, SelectStmt *stmt,
1744 : : SelectStmtPassthrough *passthru)
1745 : : {
1746 : 307056 : Query *qry = makeNode(Query);
1747 : : Node *qual;
1748 : : ListCell *l;
1749 : :
1750 : 307056 : qry->commandType = CMD_SELECT;
1751 : :
1752 : : /* process the WITH clause independently of all else */
1753 [ + + ]: 307056 : if (stmt->withClause)
1754 : : {
1755 : 1663 : qry->hasRecursive = stmt->withClause->recursive;
1756 : 1663 : qry->cteList = transformWithClause(pstate, stmt->withClause);
1757 : 1466 : qry->hasModifyingCTE = pstate->p_hasModifyingCTE;
1758 : : }
1759 : :
1760 : : /* Complain if we get called from someplace where INTO is not allowed */
1761 [ + + ]: 306859 : if (stmt->intoClause)
1762 [ + - ]: 12 : ereport(ERROR,
1763 : : (errcode(ERRCODE_SYNTAX_ERROR),
1764 : : errmsg("SELECT ... INTO is not allowed here"),
1765 : : parser_errposition(pstate,
1766 : : exprLocation((Node *) stmt->intoClause))));
1767 : :
1768 : : /* make FOR UPDATE/FOR SHARE info available to addRangeTableEntry */
1769 : 306847 : pstate->p_locking_clause = stmt->lockingClause;
1770 : :
1771 : : /* make WINDOW info available for window functions, too */
1772 : 306847 : pstate->p_windowdefs = stmt->windowClause;
1773 : :
1774 : : /* process the FROM clause */
1775 : 306847 : transformFromClause(pstate, stmt->fromClause);
1776 : :
1777 : : /* transform targetlist */
1778 : 306306 : qry->targetList = transformTargetList(pstate, stmt->targetList,
1779 : : EXPR_KIND_SELECT_TARGET);
1780 : :
1781 : : /*
1782 : : * If we're within a PLAssignStmt, do further transformation of the
1783 : : * targetlist; that has to happen before we consider sorting or grouping.
1784 : : * Otherwise, mark column origins (which are useless in a PLAssignStmt).
1785 : : */
1786 [ + + ]: 302634 : if (passthru)
1787 : 3358 : qry->targetList = transformPLAssignStmtTarget(pstate, qry->targetList,
1788 : : passthru);
1789 : : else
1790 : 299276 : markTargetListOrigins(pstate, qry->targetList);
1791 : :
1792 : : /* transform WHERE */
1793 : 302627 : qual = transformWhereClause(pstate, stmt->whereClause,
1794 : : EXPR_KIND_WHERE, "WHERE");
1795 : :
1796 : : /* initial processing of HAVING clause is much like WHERE clause */
1797 : 302556 : qry->havingQual = transformWhereClause(pstate, stmt->havingClause,
1798 : : EXPR_KIND_HAVING, "HAVING");
1799 : :
1800 : : /*
1801 : : * Transform sorting/grouping stuff. Do ORDER BY first because both
1802 : : * transformGroupClause and transformDistinctClause need the results. Note
1803 : : * that these functions can also change the targetList, so it's passed to
1804 : : * them by reference.
1805 : : */
1806 : 302552 : qry->sortClause = transformSortClause(pstate,
1807 : : stmt->sortClause,
1808 : : &qry->targetList,
1809 : : EXPR_KIND_ORDER_BY,
1810 : : false /* allow SQL92 rules */ );
1811 : :
1812 : 302532 : qry->groupClause = transformGroupClause(pstate,
1813 : : stmt->groupClause,
1814 : : &qry->groupingSets,
1815 : : &qry->targetList,
1816 : : qry->sortClause,
1817 : : EXPR_KIND_GROUP_BY,
1818 : : false /* allow SQL92 rules */ );
1819 : 302516 : qry->groupDistinct = stmt->groupDistinct;
1820 : :
1821 [ + + ]: 302516 : if (stmt->distinctClause == NIL)
1822 : : {
1823 : 299994 : qry->distinctClause = NIL;
1824 : 299994 : qry->hasDistinctOn = false;
1825 : : }
1826 [ + + ]: 2522 : else if (linitial(stmt->distinctClause) == NULL)
1827 : : {
1828 : : /* We had SELECT DISTINCT */
1829 : 2322 : qry->distinctClause = transformDistinctClause(pstate,
1830 : : &qry->targetList,
1831 : : qry->sortClause,
1832 : : false);
1833 : 2322 : qry->hasDistinctOn = false;
1834 : : }
1835 : : else
1836 : : {
1837 : : /* We had SELECT DISTINCT ON */
1838 : 200 : qry->distinctClause = transformDistinctOnClause(pstate,
1839 : : stmt->distinctClause,
1840 : : &qry->targetList,
1841 : : qry->sortClause);
1842 : 192 : qry->hasDistinctOn = true;
1843 : : }
1844 : :
1845 : : /* transform LIMIT */
1846 : 302508 : qry->limitOffset = transformLimitClause(pstate, stmt->limitOffset,
1847 : : EXPR_KIND_OFFSET, "OFFSET",
1848 : : stmt->limitOption);
1849 : 302508 : qry->limitCount = transformLimitClause(pstate, stmt->limitCount,
1850 : : EXPR_KIND_LIMIT, "LIMIT",
1851 : : stmt->limitOption);
1852 : 302500 : qry->limitOption = stmt->limitOption;
1853 : :
1854 : : /* transform window clauses after we have seen all window functions */
1855 : 302500 : qry->windowClause = transformWindowDefinitions(pstate,
1856 : : pstate->p_windowdefs,
1857 : : &qry->targetList);
1858 : :
1859 : : /* resolve any still-unresolved output columns as being type text */
1860 [ + + ]: 302444 : if (pstate->p_resolve_unknowns)
1861 : 275385 : resolveTargetListUnknowns(pstate, qry->targetList);
1862 : :
1863 : 302444 : qry->rtable = pstate->p_rtable;
1864 : 302444 : qry->rteperminfos = pstate->p_rteperminfos;
1865 : 302444 : qry->jointree = makeFromExpr(pstate->p_joinlist, qual);
1866 : :
1867 : 302444 : qry->hasSubLinks = pstate->p_hasSubLinks;
1868 : 302444 : qry->hasWindowFuncs = pstate->p_hasWindowFuncs;
1869 : 302444 : qry->hasTargetSRFs = pstate->p_hasTargetSRFs;
1870 : 302444 : qry->hasAggs = pstate->p_hasAggs;
1871 : :
1872 [ + + + + : 307451 : foreach(l, stmt->lockingClause)
+ + ]
1873 : : {
1874 : 5039 : transformLockingClause(pstate, qry,
1875 : 5039 : (LockingClause *) lfirst(l), false);
1876 : : }
1877 : :
1878 : 302412 : assign_query_collations(pstate, qry);
1879 : :
1880 : : /* this must be done after collations, for reliable comparison of exprs */
1881 [ + + + + : 302384 : if (pstate->p_hasAggs || qry->groupClause || qry->groupingSets || qry->havingQual)
+ + + + ]
1882 : 27549 : parseCheckAggregates(pstate, qry);
1883 : :
1884 : 302312 : return qry;
1885 : : }
1886 : :
1887 : : /*
1888 : : * transformValuesClause -
1889 : : * transforms a VALUES clause that's being used as a standalone SELECT
1890 : : *
1891 : : * We build a Query containing a VALUES RTE, rather as if one had written
1892 : : * SELECT * FROM (VALUES ...) AS "*VALUES*"
1893 : : */
1894 : : static Query *
1895 : 5830 : transformValuesClause(ParseState *pstate, SelectStmt *stmt)
1896 : : {
1897 : 5830 : Query *qry = makeNode(Query);
1898 : 5830 : List *exprsLists = NIL;
1899 : 5830 : List *coltypes = NIL;
1900 : 5830 : List *coltypmods = NIL;
1901 : 5830 : List *colcollations = NIL;
1902 : 5830 : List **colexprs = NULL;
1903 : 5830 : int sublist_length = -1;
1904 : 5830 : bool lateral = false;
1905 : : ParseNamespaceItem *nsitem;
1906 : : ListCell *lc;
1907 : : ListCell *lc2;
1908 : : int i;
1909 : :
1910 : 5830 : qry->commandType = CMD_SELECT;
1911 : :
1912 : : /* Most SELECT stuff doesn't apply in a VALUES clause */
1913 : : Assert(stmt->distinctClause == NIL);
1914 : : Assert(stmt->intoClause == NULL);
1915 : : Assert(stmt->targetList == NIL);
1916 : : Assert(stmt->fromClause == NIL);
1917 : : Assert(stmt->whereClause == NULL);
1918 : : Assert(stmt->groupClause == NIL);
1919 : : Assert(stmt->havingClause == NULL);
1920 : : Assert(stmt->windowClause == NIL);
1921 : : Assert(stmt->op == SETOP_NONE);
1922 : :
1923 : : /* process the WITH clause independently of all else */
1924 [ + + ]: 5830 : if (stmt->withClause)
1925 : : {
1926 : 40 : qry->hasRecursive = stmt->withClause->recursive;
1927 : 40 : qry->cteList = transformWithClause(pstate, stmt->withClause);
1928 : 36 : qry->hasModifyingCTE = pstate->p_hasModifyingCTE;
1929 : : }
1930 : :
1931 : : /*
1932 : : * For each row of VALUES, transform the raw expressions.
1933 : : *
1934 : : * Note that the intermediate representation we build is column-organized
1935 : : * not row-organized. That simplifies the type and collation processing
1936 : : * below.
1937 : : */
1938 [ + - + + : 21654 : foreach(lc, stmt->valuesLists)
+ + ]
1939 : : {
1940 : 15833 : List *sublist = (List *) lfirst(lc);
1941 : :
1942 : : /*
1943 : : * Do basic expression transformation (same as a ROW() expr, but here
1944 : : * we disallow SetToDefault)
1945 : : */
1946 : 15833 : sublist = transformExpressionList(pstate, sublist,
1947 : : EXPR_KIND_VALUES, false);
1948 : :
1949 : : /*
1950 : : * All the sublists must be the same length, *after* transformation
1951 : : * (which might expand '*' into multiple items). The VALUES RTE can't
1952 : : * handle anything different.
1953 : : */
1954 [ + + ]: 15828 : if (sublist_length < 0)
1955 : : {
1956 : : /* Remember post-transformation length of first sublist */
1957 : 5821 : sublist_length = list_length(sublist);
1958 : : /* and allocate array for per-column lists */
1959 : 5821 : colexprs = (List **) palloc0(sublist_length * sizeof(List *));
1960 : : }
1961 [ - + ]: 10007 : else if (sublist_length != list_length(sublist))
1962 : : {
1963 [ # # ]: 0 : ereport(ERROR,
1964 : : (errcode(ERRCODE_SYNTAX_ERROR),
1965 : : errmsg("VALUES lists must all be the same length"),
1966 : : parser_errposition(pstate,
1967 : : exprLocation((Node *) sublist))));
1968 : : }
1969 : :
1970 : : /* Build per-column expression lists */
1971 : 15828 : i = 0;
1972 [ + + + + : 37780 : foreach(lc2, sublist)
+ + ]
1973 : : {
1974 : 21952 : Node *col = (Node *) lfirst(lc2);
1975 : :
1976 : 21952 : colexprs[i] = lappend(colexprs[i], col);
1977 : 21952 : i++;
1978 : : }
1979 : :
1980 : : /* Release sub-list's cells to save memory */
1981 : 15828 : list_free(sublist);
1982 : :
1983 : : /* Prepare an exprsLists element for this row */
1984 : 15828 : exprsLists = lappend(exprsLists, NIL);
1985 : : }
1986 : :
1987 : : /*
1988 : : * Now resolve the common types of the columns, and coerce everything to
1989 : : * those types. Then identify the common typmod and common collation, if
1990 : : * any, of each column.
1991 : : *
1992 : : * We must do collation processing now because (1) assign_query_collations
1993 : : * doesn't process rangetable entries, and (2) we need to label the VALUES
1994 : : * RTE with column collations for use in the outer query. We don't
1995 : : * consider conflict of implicit collations to be an error here; instead
1996 : : * the column will just show InvalidOid as its collation, and you'll get a
1997 : : * failure later if that results in failure to resolve a collation.
1998 : : *
1999 : : * Note we modify the per-column expression lists in-place.
2000 : : */
2001 [ + + ]: 13409 : for (i = 0; i < sublist_length; i++)
2002 : : {
2003 : : Oid coltype;
2004 : : int32 coltypmod;
2005 : : Oid colcoll;
2006 : :
2007 : 7588 : coltype = select_common_type(pstate, colexprs[i], "VALUES", NULL);
2008 : :
2009 [ + - + + : 29540 : foreach(lc, colexprs[i])
+ + ]
2010 : : {
2011 : 21952 : Node *col = (Node *) lfirst(lc);
2012 : :
2013 : 21952 : col = coerce_to_common_type(pstate, col, coltype, "VALUES");
2014 : 21952 : lfirst(lc) = col;
2015 : : }
2016 : :
2017 : 7588 : coltypmod = select_common_typmod(pstate, colexprs[i], coltype);
2018 : 7588 : colcoll = select_common_collation(pstate, colexprs[i], true);
2019 : :
2020 : 7588 : coltypes = lappend_oid(coltypes, coltype);
2021 : 7588 : coltypmods = lappend_int(coltypmods, coltypmod);
2022 : 7588 : colcollations = lappend_oid(colcollations, colcoll);
2023 : : }
2024 : :
2025 : : /*
2026 : : * Finally, rearrange the coerced expressions into row-organized lists.
2027 : : */
2028 [ + + ]: 13409 : for (i = 0; i < sublist_length; i++)
2029 : : {
2030 [ + - + + : 29540 : forboth(lc, colexprs[i], lc2, exprsLists)
+ - + + +
+ + - +
+ ]
2031 : : {
2032 : 21952 : Node *col = (Node *) lfirst(lc);
2033 : 21952 : List *sublist = lfirst(lc2);
2034 : :
2035 : 21952 : sublist = lappend(sublist, col);
2036 : 21952 : lfirst(lc2) = sublist;
2037 : : }
2038 : 7588 : list_free(colexprs[i]);
2039 : : }
2040 : :
2041 : : /*
2042 : : * Ordinarily there can't be any current-level Vars in the expression
2043 : : * lists, because the namespace was empty ... but if we're inside CREATE
2044 : : * RULE, then NEW/OLD references might appear. In that case we have to
2045 : : * mark the VALUES RTE as LATERAL.
2046 : : */
2047 [ + + + - ]: 5826 : if (pstate->p_rtable != NIL &&
2048 : 5 : contain_vars_of_level((Node *) exprsLists, 0))
2049 : 5 : lateral = true;
2050 : :
2051 : : /*
2052 : : * Generate the VALUES RTE
2053 : : */
2054 : 5821 : nsitem = addRangeTableEntryForValues(pstate, exprsLists,
2055 : : coltypes, coltypmods, colcollations,
2056 : : NULL, lateral, true);
2057 : 5821 : addNSItemToQuery(pstate, nsitem, true, true, true);
2058 : :
2059 : : /*
2060 : : * Generate a targetlist as though expanding "*"
2061 : : */
2062 : : Assert(pstate->p_next_resno == 1);
2063 : 5821 : qry->targetList = expandNSItemAttrs(pstate, nsitem, 0, true, -1);
2064 : :
2065 : : /*
2066 : : * The grammar allows attaching ORDER BY, LIMIT, and FOR UPDATE to a
2067 : : * VALUES, so cope.
2068 : : */
2069 : 5821 : qry->sortClause = transformSortClause(pstate,
2070 : : stmt->sortClause,
2071 : : &qry->targetList,
2072 : : EXPR_KIND_ORDER_BY,
2073 : : false /* allow SQL92 rules */ );
2074 : :
2075 : 5821 : qry->limitOffset = transformLimitClause(pstate, stmt->limitOffset,
2076 : : EXPR_KIND_OFFSET, "OFFSET",
2077 : : stmt->limitOption);
2078 : 5821 : qry->limitCount = transformLimitClause(pstate, stmt->limitCount,
2079 : : EXPR_KIND_LIMIT, "LIMIT",
2080 : : stmt->limitOption);
2081 : 5821 : qry->limitOption = stmt->limitOption;
2082 : :
2083 [ - + ]: 5821 : if (stmt->lockingClause)
2084 [ # # ]: 0 : ereport(ERROR,
2085 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2086 : : /*------
2087 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
2088 : : errmsg("%s cannot be applied to VALUES",
2089 : : LCS_asString(((LockingClause *)
2090 : : linitial(stmt->lockingClause))->strength))));
2091 : :
2092 : 5821 : qry->rtable = pstate->p_rtable;
2093 : 5821 : qry->rteperminfos = pstate->p_rteperminfos;
2094 : 5821 : qry->jointree = makeFromExpr(pstate->p_joinlist, NULL);
2095 : :
2096 : 5821 : qry->hasSubLinks = pstate->p_hasSubLinks;
2097 : :
2098 : 5821 : assign_query_collations(pstate, qry);
2099 : :
2100 : 5821 : return qry;
2101 : : }
2102 : :
2103 : : /*
2104 : : * transformSetOperationStmt -
2105 : : * transforms a set-operations tree
2106 : : *
2107 : : * A set-operation tree is just a SELECT, but with UNION/INTERSECT/EXCEPT
2108 : : * structure to it. We must transform each leaf SELECT and build up a top-
2109 : : * level Query that contains the leaf SELECTs as subqueries in its rangetable.
2110 : : * The tree of set operations is converted into the setOperations field of
2111 : : * the top-level Query.
2112 : : */
2113 : : static Query *
2114 : 8560 : transformSetOperationStmt(ParseState *pstate, SelectStmt *stmt)
2115 : : {
2116 : 8560 : Query *qry = makeNode(Query);
2117 : : SelectStmt *leftmostSelect;
2118 : : int leftmostRTI;
2119 : : Query *leftmostQuery;
2120 : : SetOperationStmt *sostmt;
2121 : : List *sortClause;
2122 : : Node *limitOffset;
2123 : : Node *limitCount;
2124 : : List *lockingClause;
2125 : : WithClause *withClause;
2126 : : Node *node;
2127 : : ListCell *left_tlist,
2128 : : *lct,
2129 : : *lcm,
2130 : : *lcc,
2131 : : *l;
2132 : : List *targetvars,
2133 : : *targetnames,
2134 : : *sv_namespace;
2135 : : int sv_rtable_length;
2136 : : ParseNamespaceItem *jnsitem;
2137 : : ParseNamespaceColumn *sortnscolumns;
2138 : : int sortcolindex;
2139 : : int tllen;
2140 : :
2141 : 8560 : qry->commandType = CMD_SELECT;
2142 : :
2143 : : /*
2144 : : * Find leftmost leaf SelectStmt. We currently only need to do this in
2145 : : * order to deliver a suitable error message if there's an INTO clause
2146 : : * there, implying the set-op tree is in a context that doesn't allow
2147 : : * INTO. (transformSetOperationTree would throw error anyway, but it
2148 : : * seems worth the trouble to throw a different error for non-leftmost
2149 : : * INTO, so we produce that error in transformSetOperationTree.)
2150 : : */
2151 : 8560 : leftmostSelect = stmt->larg;
2152 [ + - + + ]: 12868 : while (leftmostSelect && leftmostSelect->op != SETOP_NONE)
2153 : 4308 : leftmostSelect = leftmostSelect->larg;
2154 : : Assert(leftmostSelect && IsA(leftmostSelect, SelectStmt) &&
2155 : : leftmostSelect->larg == NULL);
2156 [ - + ]: 8560 : if (leftmostSelect->intoClause)
2157 [ # # ]: 0 : ereport(ERROR,
2158 : : (errcode(ERRCODE_SYNTAX_ERROR),
2159 : : errmsg("SELECT ... INTO is not allowed here"),
2160 : : parser_errposition(pstate,
2161 : : exprLocation((Node *) leftmostSelect->intoClause))));
2162 : :
2163 : : /*
2164 : : * We need to extract ORDER BY and other top-level clauses here and not
2165 : : * let transformSetOperationTree() see them --- else it'll just recurse
2166 : : * right back here!
2167 : : */
2168 : 8560 : sortClause = stmt->sortClause;
2169 : 8560 : limitOffset = stmt->limitOffset;
2170 : 8560 : limitCount = stmt->limitCount;
2171 : 8560 : lockingClause = stmt->lockingClause;
2172 : 8560 : withClause = stmt->withClause;
2173 : :
2174 : 8560 : stmt->sortClause = NIL;
2175 : 8560 : stmt->limitOffset = NULL;
2176 : 8560 : stmt->limitCount = NULL;
2177 : 8560 : stmt->lockingClause = NIL;
2178 : 8560 : stmt->withClause = NULL;
2179 : :
2180 : : /* We don't support FOR UPDATE/SHARE with set ops at the moment. */
2181 [ + + ]: 8560 : if (lockingClause)
2182 [ + - ]: 4 : ereport(ERROR,
2183 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2184 : : /*------
2185 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
2186 : : errmsg("%s is not allowed with UNION/INTERSECT/EXCEPT",
2187 : : LCS_asString(((LockingClause *)
2188 : : linitial(lockingClause))->strength))));
2189 : :
2190 : : /* Process the WITH clause independently of all else */
2191 [ + + ]: 8556 : if (withClause)
2192 : : {
2193 : 170 : qry->hasRecursive = withClause->recursive;
2194 : 170 : qry->cteList = transformWithClause(pstate, withClause);
2195 : 170 : qry->hasModifyingCTE = pstate->p_hasModifyingCTE;
2196 : : }
2197 : :
2198 : : /*
2199 : : * Recursively transform the components of the tree.
2200 : : */
2201 : 8556 : sostmt = castNode(SetOperationStmt,
2202 : : transformSetOperationTree(pstate, stmt, true, NULL));
2203 : : Assert(sostmt);
2204 : 8508 : qry->setOperations = (Node *) sostmt;
2205 : :
2206 : : /*
2207 : : * Re-find leftmost SELECT (now it's a sub-query in rangetable)
2208 : : */
2209 : 8508 : node = sostmt->larg;
2210 [ + - + + ]: 12804 : while (node && IsA(node, SetOperationStmt))
2211 : 4296 : node = ((SetOperationStmt *) node)->larg;
2212 : : Assert(node && IsA(node, RangeTblRef));
2213 : 8508 : leftmostRTI = ((RangeTblRef *) node)->rtindex;
2214 : 8508 : leftmostQuery = rt_fetch(leftmostRTI, pstate->p_rtable)->subquery;
2215 : : Assert(leftmostQuery != NULL);
2216 : :
2217 : : /*
2218 : : * Generate dummy targetlist for outer query using column names of
2219 : : * leftmost select and common datatypes/collations of topmost set
2220 : : * operation. Also make lists of the dummy vars and their names for use
2221 : : * in parsing ORDER BY.
2222 : : *
2223 : : * Note: we use leftmostRTI as the varno of the dummy variables. It
2224 : : * shouldn't matter too much which RT index they have, as long as they
2225 : : * have one that corresponds to a real RT entry; else funny things may
2226 : : * happen when the tree is mashed by rule rewriting.
2227 : : */
2228 : 8508 : qry->targetList = NIL;
2229 : 8508 : targetvars = NIL;
2230 : 8508 : targetnames = NIL;
2231 : : sortnscolumns = (ParseNamespaceColumn *)
2232 : 8508 : palloc0(list_length(sostmt->colTypes) * sizeof(ParseNamespaceColumn));
2233 : 8508 : sortcolindex = 0;
2234 : :
2235 [ + + + + : 29030 : forfour(lct, sostmt->colTypes,
+ + + + +
+ + + + +
+ + + + +
- + - + -
+ + ]
2236 : : lcm, sostmt->colTypmods,
2237 : : lcc, sostmt->colCollations,
2238 : : left_tlist, leftmostQuery->targetList)
2239 : : {
2240 : 20522 : Oid colType = lfirst_oid(lct);
2241 : 20522 : int32 colTypmod = lfirst_int(lcm);
2242 : 20522 : Oid colCollation = lfirst_oid(lcc);
2243 : 20522 : TargetEntry *lefttle = (TargetEntry *) lfirst(left_tlist);
2244 : : char *colName;
2245 : : TargetEntry *tle;
2246 : : Var *var;
2247 : :
2248 : : Assert(!lefttle->resjunk);
2249 : 20522 : colName = pstrdup(lefttle->resname);
2250 : 20522 : var = makeVar(leftmostRTI,
2251 : 20522 : lefttle->resno,
2252 : : colType,
2253 : : colTypmod,
2254 : : colCollation,
2255 : : 0);
2256 : 20522 : var->location = exprLocation((Node *) lefttle->expr);
2257 : 20522 : tle = makeTargetEntry((Expr *) var,
2258 : 20522 : (AttrNumber) pstate->p_next_resno++,
2259 : : colName,
2260 : : false);
2261 : 20522 : qry->targetList = lappend(qry->targetList, tle);
2262 : 20522 : targetvars = lappend(targetvars, var);
2263 : 20522 : targetnames = lappend(targetnames, makeString(colName));
2264 : 20522 : sortnscolumns[sortcolindex].p_varno = leftmostRTI;
2265 : 20522 : sortnscolumns[sortcolindex].p_varattno = lefttle->resno;
2266 : 20522 : sortnscolumns[sortcolindex].p_vartype = colType;
2267 : 20522 : sortnscolumns[sortcolindex].p_vartypmod = colTypmod;
2268 : 20522 : sortnscolumns[sortcolindex].p_varcollid = colCollation;
2269 : 20522 : sortnscolumns[sortcolindex].p_varnosyn = leftmostRTI;
2270 : 20522 : sortnscolumns[sortcolindex].p_varattnosyn = lefttle->resno;
2271 : 20522 : sortcolindex++;
2272 : : }
2273 : :
2274 : : /*
2275 : : * As a first step towards supporting sort clauses that are expressions
2276 : : * using the output columns, generate a namespace entry that makes the
2277 : : * output columns visible. A Join RTE node is handy for this, since we
2278 : : * can easily control the Vars generated upon matches.
2279 : : *
2280 : : * Note: we don't yet do anything useful with such cases, but at least
2281 : : * "ORDER BY upper(foo)" will draw the right error message rather than
2282 : : * "foo not found".
2283 : : */
2284 : 8508 : sv_rtable_length = list_length(pstate->p_rtable);
2285 : :
2286 : 8508 : jnsitem = addRangeTableEntryForJoin(pstate,
2287 : : targetnames,
2288 : : sortnscolumns,
2289 : : JOIN_INNER,
2290 : : 0,
2291 : : targetvars,
2292 : : NIL,
2293 : : NIL,
2294 : : NULL,
2295 : : NULL,
2296 : : false);
2297 : :
2298 : 8508 : sv_namespace = pstate->p_namespace;
2299 : 8508 : pstate->p_namespace = NIL;
2300 : :
2301 : : /* add jnsitem to column namespace only */
2302 : 8508 : addNSItemToQuery(pstate, jnsitem, false, false, true);
2303 : :
2304 : : /*
2305 : : * For now, we don't support resjunk sort clauses on the output of a
2306 : : * setOperation tree --- you can only use the SQL92-spec options of
2307 : : * selecting an output column by name or number. Enforce by checking that
2308 : : * transformSortClause doesn't add any items to tlist. Note, if changing
2309 : : * this, add_setop_child_rel_equivalences() will need to be updated.
2310 : : */
2311 : 8508 : tllen = list_length(qry->targetList);
2312 : :
2313 : 8508 : qry->sortClause = transformSortClause(pstate,
2314 : : sortClause,
2315 : : &qry->targetList,
2316 : : EXPR_KIND_ORDER_BY,
2317 : : false /* allow SQL92 rules */ );
2318 : :
2319 : : /* restore namespace, remove join RTE from rtable */
2320 : 8504 : pstate->p_namespace = sv_namespace;
2321 : 8504 : pstate->p_rtable = list_truncate(pstate->p_rtable, sv_rtable_length);
2322 : :
2323 [ - + ]: 8504 : if (tllen != list_length(qry->targetList))
2324 [ # # ]: 0 : ereport(ERROR,
2325 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2326 : : errmsg("invalid UNION/INTERSECT/EXCEPT ORDER BY clause"),
2327 : : errdetail("Only result column names can be used, not expressions or functions."),
2328 : : errhint("Add the expression/function to every SELECT, or move the UNION into a FROM clause."),
2329 : : parser_errposition(pstate,
2330 : : exprLocation(list_nth(qry->targetList, tllen)))));
2331 : :
2332 : 8504 : qry->limitOffset = transformLimitClause(pstate, limitOffset,
2333 : : EXPR_KIND_OFFSET, "OFFSET",
2334 : : stmt->limitOption);
2335 : 8504 : qry->limitCount = transformLimitClause(pstate, limitCount,
2336 : : EXPR_KIND_LIMIT, "LIMIT",
2337 : : stmt->limitOption);
2338 : 8504 : qry->limitOption = stmt->limitOption;
2339 : :
2340 : 8504 : qry->rtable = pstate->p_rtable;
2341 : 8504 : qry->rteperminfos = pstate->p_rteperminfos;
2342 : 8504 : qry->jointree = makeFromExpr(pstate->p_joinlist, NULL);
2343 : :
2344 : 8504 : qry->hasSubLinks = pstate->p_hasSubLinks;
2345 : 8504 : qry->hasWindowFuncs = pstate->p_hasWindowFuncs;
2346 : 8504 : qry->hasTargetSRFs = pstate->p_hasTargetSRFs;
2347 : 8504 : qry->hasAggs = pstate->p_hasAggs;
2348 : :
2349 [ - + - - : 8504 : foreach(l, lockingClause)
- + ]
2350 : : {
2351 : 0 : transformLockingClause(pstate, qry,
2352 : 0 : (LockingClause *) lfirst(l), false);
2353 : : }
2354 : :
2355 : 8504 : assign_query_collations(pstate, qry);
2356 : :
2357 : : /* this must be done after collations, for reliable comparison of exprs */
2358 [ + - + - : 8504 : if (pstate->p_hasAggs || qry->groupClause || qry->groupingSets || qry->havingQual)
+ - - + ]
2359 : 0 : parseCheckAggregates(pstate, qry);
2360 : :
2361 : 8504 : return qry;
2362 : : }
2363 : :
2364 : : /*
2365 : : * Make a SortGroupClause node for a SetOperationStmt's groupClauses
2366 : : *
2367 : : * If require_hash is true, the caller is indicating that they need hash
2368 : : * support or they will fail. So look extra hard for hash support.
2369 : : */
2370 : : SortGroupClause *
2371 : 17522 : makeSortGroupClauseForSetOp(Oid rescoltype, bool require_hash)
2372 : : {
2373 : 17522 : SortGroupClause *grpcl = makeNode(SortGroupClause);
2374 : : Oid sortop;
2375 : : Oid eqop;
2376 : : bool hashable;
2377 : :
2378 : : /* determine the eqop and optional sortop */
2379 : 17522 : get_sort_group_operators(rescoltype,
2380 : : false, true, false,
2381 : : &sortop, &eqop, NULL,
2382 : : &hashable);
2383 : :
2384 : : /*
2385 : : * The type cache doesn't believe that record is hashable (see
2386 : : * cache_record_field_properties()), but if the caller really needs hash
2387 : : * support, we can assume it does. Worst case, if any components of the
2388 : : * record don't support hashing, we will fail at execution.
2389 : : */
2390 [ + + + + : 17522 : if (require_hash && (rescoltype == RECORDOID || rescoltype == RECORDARRAYOID))
+ + ]
2391 : 16 : hashable = true;
2392 : :
2393 : : /* we don't have a tlist yet, so can't assign sortgrouprefs */
2394 : 17522 : grpcl->tleSortGroupRef = 0;
2395 : 17522 : grpcl->eqop = eqop;
2396 : 17522 : grpcl->sortop = sortop;
2397 : 17522 : grpcl->reverse_sort = false; /* Sort-op is "less than", or InvalidOid */
2398 : 17522 : grpcl->nulls_first = false; /* OK with or without sortop */
2399 : 17522 : grpcl->hashable = hashable;
2400 : :
2401 : 17522 : return grpcl;
2402 : : }
2403 : :
2404 : : /*
2405 : : * transformSetOperationTree
2406 : : * Recursively transform leaves and internal nodes of a set-op tree
2407 : : *
2408 : : * In addition to returning the transformed node, if targetlist isn't NULL
2409 : : * then we return a list of its non-resjunk TargetEntry nodes. For a leaf
2410 : : * set-op node these are the actual targetlist entries; otherwise they are
2411 : : * dummy entries created to carry the type, typmod, collation, and location
2412 : : * (for error messages) of each output column of the set-op node. This info
2413 : : * is needed only during the internal recursion of this function, so outside
2414 : : * callers pass NULL for targetlist. Note: the reason for passing the
2415 : : * actual targetlist entries of a leaf node is so that upper levels can
2416 : : * replace UNKNOWN Consts with properly-coerced constants.
2417 : : */
2418 : : static Node *
2419 : 34360 : transformSetOperationTree(ParseState *pstate, SelectStmt *stmt,
2420 : : bool isTopLevel, List **targetlist)
2421 : : {
2422 : : bool isLeaf;
2423 : :
2424 : : Assert(stmt && IsA(stmt, SelectStmt));
2425 : :
2426 : : /* Guard against stack overflow due to overly complex set-expressions */
2427 : 34360 : check_stack_depth();
2428 : :
2429 : : /*
2430 : : * Validity-check both leaf and internal SELECTs for disallowed ops.
2431 : : */
2432 [ - + ]: 34360 : if (stmt->intoClause)
2433 [ # # ]: 0 : ereport(ERROR,
2434 : : (errcode(ERRCODE_SYNTAX_ERROR),
2435 : : errmsg("INTO is only allowed on first SELECT of UNION/INTERSECT/EXCEPT"),
2436 : : parser_errposition(pstate,
2437 : : exprLocation((Node *) stmt->intoClause))));
2438 : :
2439 : : /* We don't support FOR UPDATE/SHARE with set ops at the moment. */
2440 [ - + ]: 34360 : if (stmt->lockingClause)
2441 [ # # ]: 0 : ereport(ERROR,
2442 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2443 : : /*------
2444 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
2445 : : errmsg("%s is not allowed with UNION/INTERSECT/EXCEPT",
2446 : : LCS_asString(((LockingClause *)
2447 : : linitial(stmt->lockingClause))->strength))));
2448 : :
2449 : : /*
2450 : : * If an internal node of a set-op tree has ORDER BY, LIMIT, FOR UPDATE,
2451 : : * or WITH clauses attached, we need to treat it like a leaf node to
2452 : : * generate an independent sub-Query tree. Otherwise, it can be
2453 : : * represented by a SetOperationStmt node underneath the parent Query.
2454 : : */
2455 [ + + ]: 34360 : if (stmt->op == SETOP_NONE)
2456 : : {
2457 : : Assert(stmt->larg == NULL && stmt->rarg == NULL);
2458 : 21416 : isLeaf = true;
2459 : : }
2460 : : else
2461 : : {
2462 : : Assert(stmt->larg != NULL && stmt->rarg != NULL);
2463 [ + + + - : 12944 : if (stmt->sortClause || stmt->limitOffset || stmt->limitCount ||
+ - ]
2464 [ + - + + ]: 12928 : stmt->lockingClause || stmt->withClause)
2465 : 40 : isLeaf = true;
2466 : : else
2467 : 12904 : isLeaf = false;
2468 : : }
2469 : :
2470 [ + + ]: 34360 : if (isLeaf)
2471 : : {
2472 : : /* Process leaf SELECT */
2473 : : Query *selectQuery;
2474 : : ParseNamespaceItem *nsitem;
2475 : : RangeTblRef *rtr;
2476 : :
2477 : : /*
2478 : : * Transform SelectStmt into a Query.
2479 : : *
2480 : : * This works the same as SELECT transformation normally would, except
2481 : : * that we prevent resolving unknown-type outputs as TEXT. This does
2482 : : * not change the subquery's semantics since if the column type
2483 : : * matters semantically, it would have been resolved to something else
2484 : : * anyway. Doing this lets us resolve such outputs using
2485 : : * select_common_type(), below.
2486 : : *
2487 : : * Note: previously transformed sub-queries don't affect the parsing
2488 : : * of this sub-query, because they are not in the toplevel pstate's
2489 : : * namespace list.
2490 : : */
2491 : 21456 : selectQuery = parse_sub_analyze((Node *) stmt, pstate,
2492 : : NULL, false, false);
2493 : :
2494 : : /*
2495 : : * Check for bogus references to Vars on the current query level (but
2496 : : * upper-level references are okay). Normally this can't happen
2497 : : * because the namespace will be empty, but it could happen if we are
2498 : : * inside a rule.
2499 : : */
2500 [ - + ]: 21436 : if (pstate->p_namespace)
2501 : : {
2502 [ # # ]: 0 : if (contain_vars_of_level((Node *) selectQuery, 1))
2503 [ # # ]: 0 : ereport(ERROR,
2504 : : (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
2505 : : errmsg("UNION/INTERSECT/EXCEPT member statement cannot refer to other relations of same query level"),
2506 : : parser_errposition(pstate,
2507 : : locate_var_of_level((Node *) selectQuery, 1))));
2508 : : }
2509 : :
2510 : : /*
2511 : : * Extract a list of the non-junk TLEs for upper-level processing.
2512 : : */
2513 [ + - ]: 21436 : if (targetlist)
2514 : : {
2515 : : ListCell *tl;
2516 : :
2517 : 21436 : *targetlist = NIL;
2518 [ + + + + : 81256 : foreach(tl, selectQuery->targetList)
+ + ]
2519 : : {
2520 : 59820 : TargetEntry *tle = (TargetEntry *) lfirst(tl);
2521 : :
2522 [ + + ]: 59820 : if (!tle->resjunk)
2523 : 59812 : *targetlist = lappend(*targetlist, tle);
2524 : : }
2525 : : }
2526 : :
2527 : : /*
2528 : : * Make the leaf query be a subquery in the top-level rangetable.
2529 : : */
2530 : 21436 : nsitem = addRangeTableEntryForSubquery(pstate,
2531 : : selectQuery,
2532 : : NULL,
2533 : : false,
2534 : : false);
2535 : :
2536 : : /*
2537 : : * Return a RangeTblRef to replace the SelectStmt in the set-op tree.
2538 : : */
2539 : 21436 : rtr = makeNode(RangeTblRef);
2540 : 21436 : rtr->rtindex = nsitem->p_rtindex;
2541 : 21436 : return (Node *) rtr;
2542 : : }
2543 : : else
2544 : : {
2545 : : /* Process an internal node (set operation node) */
2546 : 12904 : SetOperationStmt *op = makeNode(SetOperationStmt);
2547 : : List *ltargetlist;
2548 : : List *rtargetlist;
2549 : : const char *context;
2550 [ + + ]: 13640 : bool recursive = (pstate->p_parent_cte &&
2551 [ + + ]: 736 : pstate->p_parent_cte->cterecursive);
2552 : :
2553 [ + + ]: 13435 : context = (stmt->op == SETOP_UNION ? "UNION" :
2554 [ + + ]: 531 : (stmt->op == SETOP_INTERSECT ? "INTERSECT" :
2555 : : "EXCEPT"));
2556 : :
2557 : 12904 : op->op = stmt->op;
2558 : 12904 : op->all = stmt->all;
2559 : :
2560 : : /*
2561 : : * Recursively transform the left child node.
2562 : : */
2563 : 12904 : op->larg = transformSetOperationTree(pstate, stmt->larg,
2564 : : false,
2565 : : <argetlist);
2566 : :
2567 : : /*
2568 : : * If we are processing a recursive union query, now is the time to
2569 : : * examine the non-recursive term's output columns and mark the
2570 : : * containing CTE as having those result columns. We should do this
2571 : : * only at the topmost setop of the CTE, of course.
2572 : : */
2573 [ + + + + ]: 12900 : if (isTopLevel && recursive)
2574 : 640 : determineRecursiveColTypes(pstate, op->larg, ltargetlist);
2575 : :
2576 : : /*
2577 : : * Recursively transform the right child node.
2578 : : */
2579 : 12900 : op->rarg = transformSetOperationTree(pstate, stmt->rarg,
2580 : : false,
2581 : : &rtargetlist);
2582 : :
2583 : 12884 : constructSetOpTargetlist(pstate, op, ltargetlist, rtargetlist, targetlist,
2584 : : context, recursive);
2585 : :
2586 : 12856 : return (Node *) op;
2587 : : }
2588 : : }
2589 : :
2590 : : /*
2591 : : * constructSetOpTargetlist
2592 : : * Compute the types, typmods and collations of the columns in the target
2593 : : * list of the given set operation.
2594 : : *
2595 : : * For every pair of columns in the targetlists of the children, compute the
2596 : : * common type, typmod, and collation representing the output (UNION) column.
2597 : : * If targetlist is not NULL, also build the dummy output targetlist
2598 : : * containing non-resjunk output columns. The values are stored into the
2599 : : * given SetOperationStmt node. context is a string for error messages
2600 : : * ("UNION" etc.). recursive is true if it is a recursive union.
2601 : : */
2602 : : void
2603 : 13252 : constructSetOpTargetlist(ParseState *pstate, SetOperationStmt *op,
2604 : : const List *ltargetlist, const List *rtargetlist,
2605 : : List **targetlist, const char *context, bool recursive)
2606 : : {
2607 : : ListCell *ltl;
2608 : : ListCell *rtl;
2609 : :
2610 : : /*
2611 : : * Verify that the two children have the same number of non-junk columns,
2612 : : * and determine the types of the merged output columns.
2613 : : */
2614 [ - + ]: 13252 : if (list_length(ltargetlist) != list_length(rtargetlist))
2615 [ # # ]: 0 : ereport(ERROR,
2616 : : (errcode(ERRCODE_SYNTAX_ERROR),
2617 : : errmsg("each %s query must have the same number of columns",
2618 : : context),
2619 : : parser_errposition(pstate,
2620 : : exprLocation((const Node *) rtargetlist))));
2621 : :
2622 [ + + ]: 13252 : if (targetlist)
2623 : 4586 : *targetlist = NIL;
2624 : 13252 : op->colTypes = NIL;
2625 : 13252 : op->colTypmods = NIL;
2626 : 13252 : op->colCollations = NIL;
2627 : 13252 : op->groupClauses = NIL;
2628 : :
2629 [ + + + + : 53405 : forboth(ltl, ltargetlist, rtl, rtargetlist)
+ + + + +
+ + - +
+ ]
2630 : : {
2631 : 40181 : TargetEntry *ltle = (TargetEntry *) lfirst(ltl);
2632 : 40181 : TargetEntry *rtle = (TargetEntry *) lfirst(rtl);
2633 : 40181 : Node *lcolnode = (Node *) ltle->expr;
2634 : 40181 : Node *rcolnode = (Node *) rtle->expr;
2635 : 40181 : Oid lcoltype = exprType(lcolnode);
2636 : 40181 : Oid rcoltype = exprType(rcolnode);
2637 : : Node *bestexpr;
2638 : : int bestlocation;
2639 : : Oid rescoltype;
2640 : : int32 rescoltypmod;
2641 : : Oid rescolcoll;
2642 : :
2643 : : /* select common type, same as CASE et al */
2644 : 40181 : rescoltype = select_common_type(pstate,
2645 : : list_make2(lcolnode, rcolnode),
2646 : : context,
2647 : : &bestexpr);
2648 : 40181 : bestlocation = exprLocation(bestexpr);
2649 : :
2650 : : /*
2651 : : * Verify the coercions are actually possible. If not, we'd fail
2652 : : * later anyway, but we want to fail now while we have sufficient
2653 : : * context to produce an error cursor position.
2654 : : *
2655 : : * For all non-UNKNOWN-type cases, we verify coercibility but we don't
2656 : : * modify the child's expression, for fear of changing the child
2657 : : * query's semantics.
2658 : : *
2659 : : * If a child expression is an UNKNOWN-type Const or Param, we want to
2660 : : * replace it with the coerced expression. This can only happen when
2661 : : * the child is a leaf set-op node. It's safe to replace the
2662 : : * expression because if the child query's semantics depended on the
2663 : : * type of this output column, it'd have already coerced the UNKNOWN
2664 : : * to something else. We want to do this because (a) we want to
2665 : : * verify that a Const is valid for the target type, or resolve the
2666 : : * actual type of an UNKNOWN Param, and (b) we want to avoid
2667 : : * unnecessary discrepancies between the output type of the child
2668 : : * query and the resolved target type. Such a discrepancy would
2669 : : * disable optimization in the planner.
2670 : : *
2671 : : * If it's some other UNKNOWN-type node, eg a Var, we do nothing
2672 : : * (knowing that coerce_to_common_type would fail). The planner is
2673 : : * sometimes able to fold an UNKNOWN Var to a constant before it has
2674 : : * to coerce the type, so failing now would just break cases that
2675 : : * might work.
2676 : : */
2677 [ + + ]: 40181 : if (lcoltype != UNKNOWNOID)
2678 : 35856 : lcolnode = coerce_to_common_type(pstate, lcolnode,
2679 : : rescoltype, context);
2680 [ - + ]: 4325 : else if (IsA(lcolnode, Const) ||
2681 [ # # ]: 0 : IsA(lcolnode, Param))
2682 : : {
2683 : 4325 : lcolnode = coerce_to_common_type(pstate, lcolnode,
2684 : : rescoltype, context);
2685 : 4325 : ltle->expr = (Expr *) lcolnode;
2686 : : }
2687 : :
2688 [ + + ]: 40181 : if (rcoltype != UNKNOWNOID)
2689 : 35312 : rcolnode = coerce_to_common_type(pstate, rcolnode,
2690 : : rescoltype, context);
2691 [ - + ]: 4869 : else if (IsA(rcolnode, Const) ||
2692 [ # # ]: 0 : IsA(rcolnode, Param))
2693 : : {
2694 : 4869 : rcolnode = coerce_to_common_type(pstate, rcolnode,
2695 : : rescoltype, context);
2696 : 4865 : rtle->expr = (Expr *) rcolnode;
2697 : : }
2698 : :
2699 : 40177 : rescoltypmod = select_common_typmod(pstate,
2700 : : list_make2(lcolnode, rcolnode),
2701 : : rescoltype);
2702 : :
2703 : : /*
2704 : : * Select common collation. A common collation is required for all
2705 : : * set operators except UNION ALL; see SQL:2008 7.13 <query
2706 : : * expression> Syntax Rule 15c. (If we fail to identify a common
2707 : : * collation for a UNION ALL column, the colCollations element will be
2708 : : * set to InvalidOid, which may result in a runtime error if something
2709 : : * at a higher query level wants to use the column's collation.)
2710 : : */
2711 : 40177 : rescolcoll = select_common_collation(pstate,
2712 : : list_make2(lcolnode, rcolnode),
2713 [ + + + + ]: 40177 : (op->op == SETOP_UNION && op->all));
2714 : :
2715 : : /* emit results */
2716 : 40153 : op->colTypes = lappend_oid(op->colTypes, rescoltype);
2717 : 40153 : op->colTypmods = lappend_int(op->colTypmods, rescoltypmod);
2718 : 40153 : op->colCollations = lappend_oid(op->colCollations, rescolcoll);
2719 : :
2720 : : /*
2721 : : * For all cases except UNION ALL, identify the grouping operators
2722 : : * (and, if available, sorting operators) that will be used to
2723 : : * eliminate duplicates.
2724 : : */
2725 [ + + + + ]: 40153 : if (op->op != SETOP_UNION || !op->all)
2726 : : {
2727 : : ParseCallbackState pcbstate;
2728 : :
2729 : 17506 : setup_parser_errposition_callback(&pcbstate, pstate,
2730 : : bestlocation);
2731 : :
2732 : : /* If it's a recursive union, we need to require hashing support. */
2733 : 17506 : op->groupClauses = lappend(op->groupClauses,
2734 : 17506 : makeSortGroupClauseForSetOp(rescoltype, recursive));
2735 : :
2736 : 17506 : cancel_parser_errposition_callback(&pcbstate);
2737 : : }
2738 : :
2739 : : /*
2740 : : * Construct a dummy tlist entry to return. We use a SetToDefault
2741 : : * node for the expression, since it carries exactly the fields
2742 : : * needed, but any other expression node type would do as well.
2743 : : */
2744 [ + + ]: 40153 : if (targetlist)
2745 : : {
2746 : 19260 : SetToDefault *rescolnode = makeNode(SetToDefault);
2747 : : TargetEntry *restle;
2748 : :
2749 : 19260 : rescolnode->typeId = rescoltype;
2750 : 19260 : rescolnode->typeMod = rescoltypmod;
2751 : 19260 : rescolnode->collation = rescolcoll;
2752 : 19260 : rescolnode->location = bestlocation;
2753 : 19260 : restle = makeTargetEntry((Expr *) rescolnode,
2754 : : 0, /* no need to set resno */
2755 : : NULL,
2756 : : false);
2757 : 19260 : *targetlist = lappend(*targetlist, restle);
2758 : : }
2759 : : }
2760 : 13224 : }
2761 : :
2762 : : /*
2763 : : * Process the outputs of the non-recursive term of a recursive union
2764 : : * to set up the parent CTE's columns
2765 : : */
2766 : : static void
2767 : 640 : determineRecursiveColTypes(ParseState *pstate, Node *larg, List *nrtargetlist)
2768 : : {
2769 : : Node *node;
2770 : : int leftmostRTI;
2771 : : Query *leftmostQuery;
2772 : : List *targetList;
2773 : : ListCell *left_tlist;
2774 : : ListCell *nrtl;
2775 : : int next_resno;
2776 : :
2777 : : /*
2778 : : * Find leftmost leaf SELECT
2779 : : */
2780 : 640 : node = larg;
2781 [ + - + + ]: 644 : while (node && IsA(node, SetOperationStmt))
2782 : 4 : node = ((SetOperationStmt *) node)->larg;
2783 : : Assert(node && IsA(node, RangeTblRef));
2784 : 640 : leftmostRTI = ((RangeTblRef *) node)->rtindex;
2785 : 640 : leftmostQuery = rt_fetch(leftmostRTI, pstate->p_rtable)->subquery;
2786 : : Assert(leftmostQuery != NULL);
2787 : :
2788 : : /*
2789 : : * Generate dummy targetlist using column names of leftmost select and
2790 : : * dummy result expressions of the non-recursive term.
2791 : : */
2792 : 640 : targetList = NIL;
2793 : 640 : next_resno = 1;
2794 : :
2795 [ + - + + : 1980 : forboth(nrtl, nrtargetlist, left_tlist, leftmostQuery->targetList)
+ - + + +
+ + - +
+ ]
2796 : : {
2797 : 1340 : TargetEntry *nrtle = (TargetEntry *) lfirst(nrtl);
2798 : 1340 : TargetEntry *lefttle = (TargetEntry *) lfirst(left_tlist);
2799 : : char *colName;
2800 : : TargetEntry *tle;
2801 : :
2802 : : Assert(!lefttle->resjunk);
2803 : 1340 : colName = pstrdup(lefttle->resname);
2804 : 1340 : tle = makeTargetEntry(nrtle->expr,
2805 : 1340 : next_resno++,
2806 : : colName,
2807 : : false);
2808 : 1340 : targetList = lappend(targetList, tle);
2809 : : }
2810 : :
2811 : : /* Now build CTE's output column info using dummy targetlist */
2812 : 640 : analyzeCTETargetList(pstate, pstate->p_parent_cte, targetList);
2813 : 640 : }
2814 : :
2815 : :
2816 : : /*
2817 : : * transformReturnStmt -
2818 : : * transforms a return statement
2819 : : */
2820 : : static Query *
2821 : 2776 : transformReturnStmt(ParseState *pstate, ReturnStmt *stmt)
2822 : : {
2823 : 2776 : Query *qry = makeNode(Query);
2824 : :
2825 : 2776 : qry->commandType = CMD_SELECT;
2826 : 2776 : qry->isReturn = true;
2827 : :
2828 : 2776 : qry->targetList = list_make1(makeTargetEntry((Expr *) transformExpr(pstate, stmt->returnval, EXPR_KIND_SELECT_TARGET),
2829 : : 1, NULL, false));
2830 : :
2831 [ + - ]: 2772 : if (pstate->p_resolve_unknowns)
2832 : 2772 : resolveTargetListUnknowns(pstate, qry->targetList);
2833 : 2772 : qry->rtable = pstate->p_rtable;
2834 : 2772 : qry->rteperminfos = pstate->p_rteperminfos;
2835 : 2772 : qry->jointree = makeFromExpr(pstate->p_joinlist, NULL);
2836 : 2772 : qry->hasSubLinks = pstate->p_hasSubLinks;
2837 : 2772 : qry->hasWindowFuncs = pstate->p_hasWindowFuncs;
2838 : 2772 : qry->hasTargetSRFs = pstate->p_hasTargetSRFs;
2839 : 2772 : qry->hasAggs = pstate->p_hasAggs;
2840 : :
2841 : 2772 : assign_query_collations(pstate, qry);
2842 : :
2843 : 2772 : return qry;
2844 : : }
2845 : :
2846 : :
2847 : : /*
2848 : : * transformUpdateStmt -
2849 : : * transforms an update statement
2850 : : */
2851 : : static Query *
2852 : 9351 : transformUpdateStmt(ParseState *pstate, UpdateStmt *stmt)
2853 : : {
2854 : 9351 : Query *qry = makeNode(Query);
2855 : : ParseNamespaceItem *nsitem;
2856 : : Node *qual;
2857 : :
2858 : 9351 : qry->commandType = CMD_UPDATE;
2859 : :
2860 : : /* process the WITH clause independently of all else */
2861 [ + + ]: 9351 : if (stmt->withClause)
2862 : : {
2863 : 55 : qry->hasRecursive = stmt->withClause->recursive;
2864 : 55 : qry->cteList = transformWithClause(pstate, stmt->withClause);
2865 : 55 : qry->hasModifyingCTE = pstate->p_hasModifyingCTE;
2866 : : }
2867 : :
2868 : 18701 : qry->resultRelation = setTargetTable(pstate, stmt->relation,
2869 : 9351 : stmt->relation->inh,
2870 : : true,
2871 : : ACL_UPDATE);
2872 : :
2873 : : /* disallow UPDATE ... WHERE CURRENT OF on a view */
2874 [ + + ]: 9350 : if (stmt->whereClause &&
2875 [ + + ]: 7014 : IsA(stmt->whereClause, CurrentOfExpr) &&
2876 [ + + ]: 108 : pstate->p_target_relation->rd_rel->relkind == RELKIND_VIEW)
2877 [ + - ]: 4 : ereport(ERROR,
2878 : : errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2879 : : errmsg("WHERE CURRENT OF on a view is not implemented"));
2880 : :
2881 [ + + ]: 9346 : if (stmt->forPortionOf)
2882 : 558 : qry->forPortionOf = transformForPortionOfClause(pstate,
2883 : : qry->resultRelation,
2884 : 618 : stmt->forPortionOf,
2885 : 618 : stmt->whereClause,
2886 : : true);
2887 : :
2888 : 9286 : nsitem = pstate->p_target_nsitem;
2889 : :
2890 : : /* subqueries in FROM cannot access the result relation */
2891 : 9286 : nsitem->p_lateral_only = true;
2892 : 9286 : nsitem->p_lateral_ok = false;
2893 : :
2894 : : /*
2895 : : * the FROM clause is non-standard SQL syntax. We used to be able to do
2896 : : * this with REPLACE in POSTQUEL so we keep the feature.
2897 : : */
2898 : 9286 : transformFromClause(pstate, stmt->fromClause);
2899 : :
2900 : : /* remaining clauses can reference the result relation normally */
2901 : 9270 : nsitem->p_lateral_only = false;
2902 : 9270 : nsitem->p_lateral_ok = true;
2903 : :
2904 : 9270 : qual = transformWhereClause(pstate, stmt->whereClause,
2905 : : EXPR_KIND_WHERE, "WHERE");
2906 : :
2907 : 9262 : transformReturningClause(pstate, qry, stmt->returningClause,
2908 : : EXPR_KIND_RETURNING);
2909 : :
2910 : : /*
2911 : : * Now we are done with SELECT-like processing, and can get on with
2912 : : * transforming the target list to match the UPDATE target columns.
2913 : : */
2914 : 9250 : qry->targetList = transformUpdateTargetList(pstate, stmt->targetList,
2915 : : qry->forPortionOf);
2916 : :
2917 : 9214 : qry->rtable = pstate->p_rtable;
2918 : 9214 : qry->rteperminfos = pstate->p_rteperminfos;
2919 : 9214 : qry->jointree = makeFromExpr(pstate->p_joinlist, qual);
2920 : :
2921 : 9214 : qry->hasTargetSRFs = pstate->p_hasTargetSRFs;
2922 : 9214 : qry->hasSubLinks = pstate->p_hasSubLinks;
2923 : :
2924 : 9214 : assign_query_collations(pstate, qry);
2925 : :
2926 : 9214 : return qry;
2927 : : }
2928 : :
2929 : : /*
2930 : : * transformUpdateTargetList -
2931 : : * handle SET clause in UPDATE/MERGE/INSERT ... ON CONFLICT UPDATE
2932 : : */
2933 : : List *
2934 : 11164 : transformUpdateTargetList(ParseState *pstate, List *origTlist, ForPortionOfExpr *forPortionOf)
2935 : : {
2936 : 11164 : List *tlist = NIL;
2937 : : RTEPermissionInfo *target_perminfo;
2938 : : ListCell *orig_tl;
2939 : : ListCell *tl;
2940 : :
2941 : 11164 : tlist = transformTargetList(pstate, origTlist,
2942 : : EXPR_KIND_UPDATE_SOURCE);
2943 : :
2944 : : /* Prepare to assign non-conflicting resnos to resjunk attributes */
2945 [ + + ]: 11132 : if (pstate->p_next_resno <= RelationGetNumberOfAttributes(pstate->p_target_relation))
2946 : 9468 : pstate->p_next_resno = RelationGetNumberOfAttributes(pstate->p_target_relation) + 1;
2947 : :
2948 : : /* Prepare non-junk columns for assignment to target table */
2949 : 11132 : target_perminfo = pstate->p_target_nsitem->p_perminfo;
2950 : 11132 : orig_tl = list_head(origTlist);
2951 : :
2952 [ + - + + : 24915 : foreach(tl, tlist)
+ + ]
2953 : : {
2954 : 13811 : TargetEntry *tle = (TargetEntry *) lfirst(tl);
2955 : : ResTarget *origTarget;
2956 : : int attrno;
2957 : :
2958 [ + + ]: 13811 : if (tle->resjunk)
2959 : : {
2960 : : /*
2961 : : * Resjunk nodes need no additional processing, but be sure they
2962 : : * have resnos that do not match any target columns; else rewriter
2963 : : * or planner might get confused. They don't need a resname
2964 : : * either.
2965 : : */
2966 : 91 : tle->resno = (AttrNumber) pstate->p_next_resno++;
2967 : 91 : tle->resname = NULL;
2968 : 91 : continue;
2969 : : }
2970 [ - + ]: 13720 : if (orig_tl == NULL)
2971 [ # # ]: 0 : elog(ERROR, "UPDATE target count mismatch --- internal error");
2972 : 13720 : origTarget = lfirst_node(ResTarget, orig_tl);
2973 : :
2974 : 13720 : attrno = attnameAttNum(pstate->p_target_relation,
2975 : 13720 : origTarget->name, true);
2976 [ + + ]: 13720 : if (attrno == InvalidAttrNumber)
2977 [ + - + + : 16 : ereport(ERROR,
+ - ]
2978 : : (errcode(ERRCODE_UNDEFINED_COLUMN),
2979 : : errmsg("column \"%s\" of relation \"%s\" does not exist",
2980 : : origTarget->name,
2981 : : RelationGetRelationName(pstate->p_target_relation)),
2982 : : (origTarget->indirection != NIL &&
2983 : : strcmp(origTarget->name, pstate->p_target_nsitem->p_names->aliasname) == 0) ?
2984 : : errhint("SET target columns cannot be qualified with the relation name.") : 0,
2985 : : parser_errposition(pstate, origTarget->location)));
2986 : :
2987 : : /*
2988 : : * If this is a FOR PORTION OF update, forbid directly setting the
2989 : : * range column, since that would conflict with the implicit updates.
2990 : : */
2991 [ + + ]: 13704 : if (forPortionOf != NULL)
2992 : : {
2993 [ + + ]: 571 : if (attrno == forPortionOf->rangeVar->varattno)
2994 [ + - ]: 4 : ereport(ERROR,
2995 : : (errcode(ERRCODE_SYNTAX_ERROR),
2996 : : errmsg("cannot update column \"%s\" because it is used in FOR PORTION OF",
2997 : : origTarget->name),
2998 : : parser_errposition(pstate, origTarget->location)));
2999 : : }
3000 : :
3001 : 13700 : updateTargetListEntry(pstate, tle, origTarget->name,
3002 : : attrno,
3003 : : origTarget->indirection,
3004 : : origTarget->location);
3005 : :
3006 : : /* Mark the target column as requiring update permissions */
3007 : 13692 : target_perminfo->updatedCols = bms_add_member(target_perminfo->updatedCols,
3008 : : attrno - FirstLowInvalidHeapAttributeNumber);
3009 : :
3010 : 13692 : orig_tl = lnext(origTlist, orig_tl);
3011 : : }
3012 [ - + ]: 11104 : if (orig_tl != NULL)
3013 [ # # ]: 0 : elog(ERROR, "UPDATE target count mismatch --- internal error");
3014 : :
3015 : 11104 : return tlist;
3016 : : }
3017 : :
3018 : : /*
3019 : : * addNSItemForReturning -
3020 : : * add a ParseNamespaceItem for the OLD or NEW alias in RETURNING.
3021 : : */
3022 : : static void
3023 : 4632 : addNSItemForReturning(ParseState *pstate, const char *aliasname,
3024 : : VarReturningType returning_type)
3025 : : {
3026 : : List *colnames;
3027 : : int numattrs;
3028 : : ParseNamespaceColumn *nscolumns;
3029 : : ParseNamespaceItem *nsitem;
3030 : :
3031 : : /* copy per-column data from the target relation */
3032 : 4632 : colnames = pstate->p_target_nsitem->p_rte->eref->colnames;
3033 : 4632 : numattrs = list_length(colnames);
3034 : :
3035 : 4632 : nscolumns = palloc_array(ParseNamespaceColumn, numattrs);
3036 : :
3037 : 4632 : memcpy(nscolumns, pstate->p_target_nsitem->p_nscolumns,
3038 : : numattrs * sizeof(ParseNamespaceColumn));
3039 : :
3040 : : /* mark all columns as returning OLD/NEW */
3041 [ + + ]: 18206 : for (int i = 0; i < numattrs; i++)
3042 : 13574 : nscolumns[i].p_varreturningtype = returning_type;
3043 : :
3044 : : /* build the nsitem, copying most fields from the target relation */
3045 : 4632 : nsitem = palloc_object(ParseNamespaceItem);
3046 : 4632 : nsitem->p_names = makeAlias(aliasname, colnames);
3047 : 4632 : nsitem->p_rte = pstate->p_target_nsitem->p_rte;
3048 : 4632 : nsitem->p_rtindex = pstate->p_target_nsitem->p_rtindex;
3049 : 4632 : nsitem->p_perminfo = pstate->p_target_nsitem->p_perminfo;
3050 : 4632 : nsitem->p_nscolumns = nscolumns;
3051 : 4632 : nsitem->p_returning_type = returning_type;
3052 : :
3053 : : /* add it to the query namespace as a table-only item */
3054 : 4632 : addNSItemToQuery(pstate, nsitem, false, true, false);
3055 : 4632 : }
3056 : :
3057 : : /*
3058 : : * transformReturningClause -
3059 : : * handle a RETURNING clause in INSERT/UPDATE/DELETE/MERGE
3060 : : */
3061 : : void
3062 : 15031 : transformReturningClause(ParseState *pstate, Query *qry,
3063 : : ReturningClause *returningClause,
3064 : : ParseExprKind exprKind)
3065 : : {
3066 : 15031 : int save_nslen = list_length(pstate->p_namespace);
3067 : : int save_next_resno;
3068 : :
3069 [ + + ]: 15031 : if (returningClause == NULL)
3070 : 12669 : return; /* nothing to do */
3071 : :
3072 : : /*
3073 : : * Scan RETURNING WITH(...) options for OLD/NEW alias names. Complain if
3074 : : * there is any conflict with existing relations.
3075 : : */
3076 [ + + + + : 4772 : foreach_node(ReturningOption, option, returningClause->options)
+ + ]
3077 : : {
3078 [ + + - ]: 80 : switch (option->option)
3079 : : {
3080 : 36 : case RETURNING_OPTION_OLD:
3081 [ + + ]: 36 : if (qry->returningOldAlias != NULL)
3082 [ + - ]: 4 : ereport(ERROR,
3083 : : errcode(ERRCODE_SYNTAX_ERROR),
3084 : : /* translator: %s is OLD or NEW */
3085 : : errmsg("%s cannot be specified multiple times", "OLD"),
3086 : : parser_errposition(pstate, option->location));
3087 : 32 : qry->returningOldAlias = option->value;
3088 : 32 : break;
3089 : :
3090 : 44 : case RETURNING_OPTION_NEW:
3091 [ + + ]: 44 : if (qry->returningNewAlias != NULL)
3092 [ + - ]: 4 : ereport(ERROR,
3093 : : errcode(ERRCODE_SYNTAX_ERROR),
3094 : : /* translator: %s is OLD or NEW */
3095 : : errmsg("%s cannot be specified multiple times", "NEW"),
3096 : : parser_errposition(pstate, option->location));
3097 : 40 : qry->returningNewAlias = option->value;
3098 : 40 : break;
3099 : :
3100 : 0 : default:
3101 [ # # ]: 0 : elog(ERROR, "unrecognized returning option: %d", option->option);
3102 : : }
3103 : :
3104 [ + + ]: 72 : if (refnameNamespaceItem(pstate, NULL, option->value, -1, NULL) != NULL)
3105 [ + - ]: 8 : ereport(ERROR,
3106 : : errcode(ERRCODE_DUPLICATE_ALIAS),
3107 : : errmsg("table name \"%s\" specified more than once",
3108 : : option->value),
3109 : : parser_errposition(pstate, option->location));
3110 : :
3111 : 64 : addNSItemForReturning(pstate, option->value,
3112 [ + + ]: 64 : option->option == RETURNING_OPTION_OLD ?
3113 : : VAR_RETURNING_OLD : VAR_RETURNING_NEW);
3114 : : }
3115 : :
3116 : : /*
3117 : : * If OLD/NEW alias names weren't explicitly specified, use "old"/"new"
3118 : : * unless masked by existing relations.
3119 : : */
3120 [ + + + + ]: 4672 : if (qry->returningOldAlias == NULL &&
3121 : 2326 : refnameNamespaceItem(pstate, NULL, "old", -1, NULL) == NULL)
3122 : : {
3123 : 2286 : qry->returningOldAlias = "old";
3124 : 2286 : addNSItemForReturning(pstate, "old", VAR_RETURNING_OLD);
3125 : : }
3126 [ + + + + ]: 4668 : if (qry->returningNewAlias == NULL &&
3127 : 2322 : refnameNamespaceItem(pstate, NULL, "new", -1, NULL) == NULL)
3128 : : {
3129 : 2282 : qry->returningNewAlias = "new";
3130 : 2282 : addNSItemForReturning(pstate, "new", VAR_RETURNING_NEW);
3131 : : }
3132 : :
3133 : : /*
3134 : : * We need to assign resnos starting at one in the RETURNING list. Save
3135 : : * and restore the main tlist's value of p_next_resno, just in case
3136 : : * someone looks at it later (probably won't happen).
3137 : : */
3138 : 2346 : save_next_resno = pstate->p_next_resno;
3139 : 2346 : pstate->p_next_resno = 1;
3140 : :
3141 : : /* transform RETURNING expressions identically to a SELECT targetlist */
3142 : 2346 : qry->returningList = transformTargetList(pstate,
3143 : : returningClause->exprs,
3144 : : exprKind);
3145 : :
3146 : : /*
3147 : : * Complain if the nonempty tlist expanded to nothing (which is possible
3148 : : * if it contains only a star-expansion of a zero-column table). If we
3149 : : * allow this, the parsed Query will look like it didn't have RETURNING,
3150 : : * with results that would probably surprise the user.
3151 : : */
3152 [ + + ]: 2318 : if (qry->returningList == NIL)
3153 [ + - ]: 4 : ereport(ERROR,
3154 : : (errcode(ERRCODE_SYNTAX_ERROR),
3155 : : errmsg("RETURNING must have at least one column"),
3156 : : parser_errposition(pstate,
3157 : : exprLocation(linitial(returningClause->exprs)))));
3158 : :
3159 : : /* mark column origins */
3160 : 2314 : markTargetListOrigins(pstate, qry->returningList);
3161 : :
3162 : : /* resolve any still-unresolved output columns as being type text */
3163 [ + - ]: 2314 : if (pstate->p_resolve_unknowns)
3164 : 2314 : resolveTargetListUnknowns(pstate, qry->returningList);
3165 : :
3166 : : /* restore state */
3167 : 2314 : pstate->p_namespace = list_truncate(pstate->p_namespace, save_nslen);
3168 : 2314 : pstate->p_next_resno = save_next_resno;
3169 : : }
3170 : :
3171 : :
3172 : : /*
3173 : : * transformPLAssignStmt -
3174 : : * transform a PL/pgSQL assignment statement
3175 : : *
3176 : : * If there is no opt_indirection, the transformed statement looks like
3177 : : * "SELECT a_expr ...", except the expression has been cast to the type of
3178 : : * the target. With indirection, it's still a SELECT, but the expression will
3179 : : * incorporate FieldStore and/or assignment SubscriptingRef nodes to compute a
3180 : : * new value for a container-type variable represented by the target. The
3181 : : * expression references the target as the container source.
3182 : : */
3183 : : static Query *
3184 : 3364 : transformPLAssignStmt(ParseState *pstate, PLAssignStmt *stmt)
3185 : : {
3186 : : Query *qry;
3187 : 3364 : ColumnRef *cref = makeNode(ColumnRef);
3188 : 3364 : List *indirection = stmt->indirection;
3189 : 3364 : int nnames = stmt->nnames;
3190 : : Node *target;
3191 : : SelectStmtPassthrough passthru;
3192 : : bool save_resolve_unknowns;
3193 : :
3194 : : /*
3195 : : * First, construct a ColumnRef for the target variable. If the target
3196 : : * has more than one dotted name, we have to pull the extra names out of
3197 : : * the indirection list.
3198 : : */
3199 : 3364 : cref->fields = list_make1(makeString(stmt->name));
3200 : 3364 : cref->location = stmt->location;
3201 [ + + ]: 3364 : if (nnames > 1)
3202 : : {
3203 : : /* avoid munging the raw parsetree */
3204 : 268 : indirection = list_copy(indirection);
3205 [ + + + - ]: 543 : while (--nnames > 0 && indirection != NIL)
3206 : : {
3207 : 275 : Node *ind = (Node *) linitial(indirection);
3208 : :
3209 [ - + ]: 275 : if (!IsA(ind, String))
3210 [ # # ]: 0 : elog(ERROR, "invalid name count in PLAssignStmt");
3211 : 275 : cref->fields = lappend(cref->fields, ind);
3212 : 275 : indirection = list_delete_first(indirection);
3213 : : }
3214 : : }
3215 : :
3216 : : /*
3217 : : * Transform the target reference. Typically we will get back a Param
3218 : : * node, but there's no reason to be too picky about its type. (Note that
3219 : : * we must do this before calling transformSelectStmt. It's tempting to
3220 : : * do it inside transformPLAssignStmtTarget, but we need to do it before
3221 : : * adding any FROM tables to the pstate's namespace, else we might wrongly
3222 : : * resolve the target as a table column.)
3223 : : */
3224 : 3364 : target = transformExpr(pstate, (Node *) cref,
3225 : : EXPR_KIND_UPDATE_TARGET);
3226 : :
3227 : : /* Set up passthrough data for transformPLAssignStmtTarget */
3228 : 3358 : passthru.stmt = stmt;
3229 : 3358 : passthru.target = target;
3230 : 3358 : passthru.indirection = indirection;
3231 : :
3232 : : /*
3233 : : * To avoid duplicating a lot of code, we use transformSelectStmt to do
3234 : : * almost all of the work. However, we need to do additional processing
3235 : : * on the SELECT's targetlist after it's been transformed, but before
3236 : : * possible addition of targetlist items for ORDER BY or GROUP BY.
3237 : : * transformSelectStmt knows it should call transformPLAssignStmtTarget if
3238 : : * it's passed a passthru argument.
3239 : : *
3240 : : * Also, disable resolution of unknown-type tlist items; PL/pgSQL wants to
3241 : : * deal with that itself.
3242 : : */
3243 : 3358 : save_resolve_unknowns = pstate->p_resolve_unknowns;
3244 : 3358 : pstate->p_resolve_unknowns = false;
3245 : 3358 : qry = transformSelectStmt(pstate, stmt->val, &passthru);
3246 : 3351 : pstate->p_resolve_unknowns = save_resolve_unknowns;
3247 : :
3248 : 3351 : return qry;
3249 : : }
3250 : :
3251 : : /*
3252 : : * Callback function to adjust a SELECT's tlist to make the output suitable
3253 : : * for assignment to a PLAssignStmt's target variable.
3254 : : *
3255 : : * Note: we actually modify the tle->expr in-place, but the function's API
3256 : : * is set up to not presume that.
3257 : : */
3258 : : static List *
3259 : 3358 : transformPLAssignStmtTarget(ParseState *pstate, List *tlist,
3260 : : SelectStmtPassthrough *passthru)
3261 : : {
3262 : 3358 : PLAssignStmt *stmt = passthru->stmt;
3263 : 3358 : Node *target = passthru->target;
3264 : 3358 : List *indirection = passthru->indirection;
3265 : : Oid targettype;
3266 : : int32 targettypmod;
3267 : : Oid targetcollation;
3268 : : TargetEntry *tle;
3269 : : Oid type_id;
3270 : :
3271 : 3358 : targettype = exprType(target);
3272 : 3358 : targettypmod = exprTypmod(target);
3273 : 3358 : targetcollation = exprCollation(target);
3274 : :
3275 : : /* we should have exactly one targetlist item */
3276 [ + + ]: 3358 : if (list_length(tlist) != 1)
3277 [ + - ]: 2 : ereport(ERROR,
3278 : : (errcode(ERRCODE_SYNTAX_ERROR),
3279 : : errmsg_plural("assignment source returned %d column",
3280 : : "assignment source returned %d columns",
3281 : : list_length(tlist),
3282 : : list_length(tlist))));
3283 : :
3284 : 3356 : tle = linitial_node(TargetEntry, tlist);
3285 : :
3286 : : /*
3287 : : * This next bit is similar to transformAssignedExpr; the key difference
3288 : : * is we use COERCION_PLPGSQL not COERCION_ASSIGNMENT.
3289 : : */
3290 : 3356 : type_id = exprType((Node *) tle->expr);
3291 : :
3292 : 3356 : pstate->p_expr_kind = EXPR_KIND_UPDATE_TARGET;
3293 : :
3294 [ + + ]: 3356 : if (indirection)
3295 : : {
3296 : 60 : tle->expr = (Expr *)
3297 : 65 : transformAssignmentIndirection(pstate,
3298 : : target,
3299 : 65 : stmt->name,
3300 : : false,
3301 : : targettype,
3302 : : targettypmod,
3303 : : targetcollation,
3304 : : indirection,
3305 : : list_head(indirection),
3306 : 65 : (Node *) tle->expr,
3307 : : COERCION_PLPGSQL,
3308 : : exprLocation(target));
3309 : : }
3310 [ + + + + ]: 3291 : else if (targettype != type_id &&
3311 [ + + + + ]: 910 : (targettype == RECORDOID || ISCOMPLEX(targettype)) &&
3312 [ + + ]: 226 : (type_id == RECORDOID || ISCOMPLEX(type_id)))
3313 : : {
3314 : : /*
3315 : : * Hack: do not let coerce_to_target_type() deal with inconsistent
3316 : : * composite types. Just pass the expression result through as-is,
3317 : : * and let the PL/pgSQL executor do the conversion its way. This is
3318 : : * rather bogus, but it's needed for backwards compatibility.
3319 : : */
3320 : : }
3321 : : else
3322 : : {
3323 : : /*
3324 : : * For normal non-qualified target column, do type checking and
3325 : : * coercion.
3326 : : */
3327 : 3104 : Node *orig_expr = (Node *) tle->expr;
3328 : :
3329 : 3104 : tle->expr = (Expr *)
3330 : 3104 : coerce_to_target_type(pstate,
3331 : : orig_expr, type_id,
3332 : : targettype, targettypmod,
3333 : : COERCION_PLPGSQL,
3334 : : COERCE_IMPLICIT_CAST,
3335 : : -1);
3336 : : /* With COERCION_PLPGSQL, this error is probably unreachable */
3337 [ - + ]: 3104 : if (tle->expr == NULL)
3338 [ # # ]: 0 : ereport(ERROR,
3339 : : (errcode(ERRCODE_DATATYPE_MISMATCH),
3340 : : errmsg("variable \"%s\" is of type %s"
3341 : : " but expression is of type %s",
3342 : : stmt->name,
3343 : : format_type_be(targettype),
3344 : : format_type_be(type_id)),
3345 : : errhint("You will need to rewrite or cast the expression."),
3346 : : parser_errposition(pstate, exprLocation(orig_expr))));
3347 : : }
3348 : :
3349 : 3351 : pstate->p_expr_kind = EXPR_KIND_NONE;
3350 : :
3351 : 3351 : return list_make1(tle);
3352 : : }
3353 : :
3354 : :
3355 : : /*
3356 : : * transformDeclareCursorStmt -
3357 : : * transform a DECLARE CURSOR Statement
3358 : : *
3359 : : * DECLARE CURSOR is like other utility statements in that we emit it as a
3360 : : * CMD_UTILITY Query node; however, we must first transform the contained
3361 : : * query. We used to postpone that until execution, but it's really necessary
3362 : : * to do it during the normal parse analysis phase to ensure that side effects
3363 : : * of parser hooks happen at the expected time.
3364 : : */
3365 : : static Query *
3366 : 2755 : transformDeclareCursorStmt(ParseState *pstate, DeclareCursorStmt *stmt)
3367 : : {
3368 : : Query *result;
3369 : : Query *query;
3370 : :
3371 [ + + ]: 2755 : if ((stmt->options & CURSOR_OPT_SCROLL) &&
3372 [ - + ]: 160 : (stmt->options & CURSOR_OPT_NO_SCROLL))
3373 [ # # ]: 0 : ereport(ERROR,
3374 : : (errcode(ERRCODE_INVALID_CURSOR_DEFINITION),
3375 : : /* translator: %s is a SQL keyword */
3376 : : errmsg("cannot specify both %s and %s",
3377 : : "SCROLL", "NO SCROLL")));
3378 : :
3379 [ - + ]: 2755 : if ((stmt->options & CURSOR_OPT_ASENSITIVE) &&
3380 [ # # ]: 0 : (stmt->options & CURSOR_OPT_INSENSITIVE))
3381 [ # # ]: 0 : ereport(ERROR,
3382 : : (errcode(ERRCODE_INVALID_CURSOR_DEFINITION),
3383 : : /* translator: %s is a SQL keyword */
3384 : : errmsg("cannot specify both %s and %s",
3385 : : "ASENSITIVE", "INSENSITIVE")));
3386 : :
3387 : : /* Transform contained query, not allowing SELECT INTO */
3388 : 2755 : query = transformStmt(pstate, stmt->query);
3389 : 2742 : stmt->query = (Node *) query;
3390 : :
3391 : : /* Grammar should not have allowed anything but SELECT */
3392 [ + - ]: 2742 : if (!IsA(query, Query) ||
3393 [ - + ]: 2742 : query->commandType != CMD_SELECT)
3394 [ # # ]: 0 : elog(ERROR, "unexpected non-SELECT command in DECLARE CURSOR");
3395 : :
3396 : : /*
3397 : : * We also disallow data-modifying WITH in a cursor. (This could be
3398 : : * allowed, but the semantics of when the updates occur might be
3399 : : * surprising.)
3400 : : */
3401 [ - + ]: 2742 : if (query->hasModifyingCTE)
3402 [ # # ]: 0 : ereport(ERROR,
3403 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3404 : : errmsg("DECLARE CURSOR must not contain data-modifying statements in WITH")));
3405 : :
3406 : : /* FOR UPDATE and WITH HOLD are not compatible */
3407 [ + + - + ]: 2742 : if (query->rowMarks != NIL && (stmt->options & CURSOR_OPT_HOLD))
3408 [ # # ]: 0 : ereport(ERROR,
3409 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3410 : : /*------
3411 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3412 : : errmsg("DECLARE CURSOR WITH HOLD ... %s is not supported",
3413 : : LCS_asString(((RowMarkClause *)
3414 : : linitial(query->rowMarks))->strength)),
3415 : : errdetail("Holdable cursors must be READ ONLY.")));
3416 : :
3417 : : /* FOR UPDATE and SCROLL are not compatible */
3418 [ + + - + ]: 2742 : if (query->rowMarks != NIL && (stmt->options & CURSOR_OPT_SCROLL))
3419 [ # # ]: 0 : ereport(ERROR,
3420 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3421 : : /*------
3422 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3423 : : errmsg("DECLARE SCROLL CURSOR ... %s is not supported",
3424 : : LCS_asString(((RowMarkClause *)
3425 : : linitial(query->rowMarks))->strength)),
3426 : : errdetail("Scrollable cursors must be READ ONLY.")));
3427 : :
3428 : : /* FOR UPDATE and INSENSITIVE are not compatible */
3429 [ + + - + ]: 2742 : if (query->rowMarks != NIL && (stmt->options & CURSOR_OPT_INSENSITIVE))
3430 [ # # ]: 0 : ereport(ERROR,
3431 : : (errcode(ERRCODE_INVALID_CURSOR_DEFINITION),
3432 : : /*------
3433 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3434 : : errmsg("DECLARE INSENSITIVE CURSOR ... %s is not valid",
3435 : : LCS_asString(((RowMarkClause *)
3436 : : linitial(query->rowMarks))->strength)),
3437 : : errdetail("Insensitive cursors must be READ ONLY.")));
3438 : :
3439 : : /* represent the command as a utility Query */
3440 : 2742 : result = makeNode(Query);
3441 : 2742 : result->commandType = CMD_UTILITY;
3442 : 2742 : result->utilityStmt = (Node *) stmt;
3443 : :
3444 : 2742 : return result;
3445 : : }
3446 : :
3447 : :
3448 : : /*
3449 : : * transformExplainStmt -
3450 : : * transform an EXPLAIN Statement
3451 : : *
3452 : : * EXPLAIN is like other utility statements in that we emit it as a
3453 : : * CMD_UTILITY Query node; however, we must first transform the contained
3454 : : * query. We used to postpone that until execution, but it's really necessary
3455 : : * to do it during the normal parse analysis phase to ensure that side effects
3456 : : * of parser hooks happen at the expected time.
3457 : : */
3458 : : static Query *
3459 : 16701 : transformExplainStmt(ParseState *pstate, ExplainStmt *stmt)
3460 : : {
3461 : : Query *result;
3462 : 16701 : bool generic_plan = false;
3463 : 16701 : Oid *paramTypes = NULL;
3464 : 16701 : int numParams = 0;
3465 : :
3466 : : /*
3467 : : * If we have no external source of parameter definitions, and the
3468 : : * GENERIC_PLAN option is specified, then accept variable parameter
3469 : : * definitions (similarly to PREPARE, for example).
3470 : : */
3471 [ + + ]: 16701 : if (pstate->p_paramref_hook == NULL)
3472 : : {
3473 : : ListCell *lc;
3474 : :
3475 [ + + + + : 33205 : foreach(lc, stmt->options)
+ + ]
3476 : : {
3477 : 16516 : DefElem *opt = (DefElem *) lfirst(lc);
3478 : :
3479 [ + + ]: 16516 : if (strcmp(opt->defname, "generic_plan") == 0)
3480 : 12 : generic_plan = defGetBoolean(opt);
3481 : : /* don't "break", as we want the last value */
3482 : : }
3483 [ + + ]: 16689 : if (generic_plan)
3484 : 12 : setup_parse_variable_parameters(pstate, ¶mTypes, &numParams);
3485 : : }
3486 : :
3487 : : /* transform contained query, allowing SELECT INTO */
3488 : 16701 : stmt->query = (Node *) transformOptionalSelectInto(pstate, stmt->query);
3489 : :
3490 : : /* make sure all is well with parameter types */
3491 [ + + ]: 16696 : if (generic_plan)
3492 : 12 : check_variable_parameters(pstate, (Query *) stmt->query);
3493 : :
3494 : : /* represent the command as a utility Query */
3495 : 16696 : result = makeNode(Query);
3496 : 16696 : result->commandType = CMD_UTILITY;
3497 : 16696 : result->utilityStmt = (Node *) stmt;
3498 : :
3499 : 16696 : return result;
3500 : : }
3501 : :
3502 : :
3503 : : /*
3504 : : * transformCreateTableAsStmt -
3505 : : * transform a CREATE TABLE AS, SELECT ... INTO, or CREATE MATERIALIZED VIEW
3506 : : * Statement
3507 : : *
3508 : : * As with DECLARE CURSOR and EXPLAIN, transform the contained statement now.
3509 : : */
3510 : : static Query *
3511 : 1319 : transformCreateTableAsStmt(ParseState *pstate, CreateTableAsStmt *stmt)
3512 : : {
3513 : : Query *result;
3514 : : Query *query;
3515 : :
3516 : : /* transform contained query, not allowing SELECT INTO */
3517 : 1319 : query = transformStmt(pstate, stmt->query);
3518 : 1317 : stmt->query = (Node *) query;
3519 : :
3520 : : /* additional work needed for CREATE MATERIALIZED VIEW */
3521 [ + + ]: 1317 : if (stmt->objtype == OBJECT_MATVIEW)
3522 : : {
3523 : : ObjectAddress temp_object;
3524 : :
3525 : : /*
3526 : : * Prohibit a data-modifying CTE in the query used to create a
3527 : : * materialized view. It's not sufficiently clear what the user would
3528 : : * want to happen if the MV is refreshed or incrementally maintained.
3529 : : */
3530 [ - + ]: 356 : if (query->hasModifyingCTE)
3531 [ # # ]: 0 : ereport(ERROR,
3532 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3533 : : errmsg("materialized views must not use data-modifying statements in WITH")));
3534 : :
3535 : : /*
3536 : : * Check whether any temporary database objects are used in the
3537 : : * creation query. It would be hard to refresh data or incrementally
3538 : : * maintain it if a source disappeared.
3539 : : */
3540 [ + + ]: 356 : if (query_uses_temp_object(query, &temp_object))
3541 [ + - ]: 4 : ereport(ERROR,
3542 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3543 : : errmsg("materialized views must not use temporary objects"),
3544 : : errdetail("This view depends on temporary %s.",
3545 : : getObjectDescription(&temp_object, false))));
3546 : :
3547 : : /*
3548 : : * A materialized view would either need to save parameters for use in
3549 : : * maintaining/loading the data or prohibit them entirely. The latter
3550 : : * seems safer and more sane.
3551 : : */
3552 [ - + ]: 348 : if (query_contains_extern_params(query))
3553 [ # # ]: 0 : ereport(ERROR,
3554 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3555 : : errmsg("materialized views may not be defined using bound parameters")));
3556 : :
3557 : : /*
3558 : : * For now, we disallow unlogged materialized views, because it seems
3559 : : * like a bad idea for them to just go to empty after a crash. (If we
3560 : : * could mark them as unpopulated, that would be better, but that
3561 : : * requires catalog changes which crash recovery can't presently
3562 : : * handle.)
3563 : : */
3564 [ - + ]: 348 : if (stmt->into->rel->relpersistence == RELPERSISTENCE_UNLOGGED)
3565 [ # # ]: 0 : ereport(ERROR,
3566 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3567 : : errmsg("materialized views cannot be unlogged")));
3568 : :
3569 : : /*
3570 : : * At runtime, we'll need a copy of the parsed-but-not-rewritten Query
3571 : : * for purposes of creating the view's ON SELECT rule. We stash that
3572 : : * in the IntoClause because that's where intorel_startup() can
3573 : : * conveniently get it from.
3574 : : */
3575 : 348 : stmt->into->viewQuery = copyObject(query);
3576 : : }
3577 : :
3578 : : /* represent the command as a utility Query */
3579 : 1309 : result = makeNode(Query);
3580 : 1309 : result->commandType = CMD_UTILITY;
3581 : 1309 : result->utilityStmt = (Node *) stmt;
3582 : :
3583 : 1309 : return result;
3584 : : }
3585 : :
3586 : : /*
3587 : : * transform a CallStmt
3588 : : */
3589 : : static Query *
3590 : 312 : transformCallStmt(ParseState *pstate, CallStmt *stmt)
3591 : : {
3592 : : List *targs;
3593 : : ListCell *lc;
3594 : : Node *node;
3595 : : FuncExpr *fexpr;
3596 : : HeapTuple proctup;
3597 : : Datum proargmodes;
3598 : : bool isNull;
3599 : 312 : List *outargs = NIL;
3600 : : Query *result;
3601 : :
3602 : : /*
3603 : : * First, do standard parse analysis on the procedure call and its
3604 : : * arguments, allowing us to identify the called procedure.
3605 : : */
3606 : 312 : targs = NIL;
3607 [ + + + + : 764 : foreach(lc, stmt->funccall->args)
+ + ]
3608 : : {
3609 : 452 : targs = lappend(targs, transformExpr(pstate,
3610 : 452 : (Node *) lfirst(lc),
3611 : : EXPR_KIND_CALL_ARGUMENT));
3612 : : }
3613 : :
3614 : 312 : node = ParseFuncOrColumn(pstate,
3615 : 312 : stmt->funccall->funcname,
3616 : : targs,
3617 : : pstate->p_last_srf,
3618 : : stmt->funccall,
3619 : : true,
3620 : 312 : stmt->funccall->location);
3621 : :
3622 : 291 : assign_expr_collations(pstate, node);
3623 : :
3624 : 291 : fexpr = castNode(FuncExpr, node);
3625 : :
3626 : 291 : proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(fexpr->funcid));
3627 [ - + ]: 291 : if (!HeapTupleIsValid(proctup))
3628 [ # # ]: 0 : elog(ERROR, "cache lookup failed for function %u", fexpr->funcid);
3629 : :
3630 : : /*
3631 : : * Expand the argument list to deal with named-argument notation and
3632 : : * default arguments. For ordinary FuncExprs this'd be done during
3633 : : * planning, but a CallStmt doesn't go through planning, and there seems
3634 : : * no good reason not to do it here.
3635 : : */
3636 : 291 : fexpr->args = expand_function_arguments(fexpr->args,
3637 : : true,
3638 : : fexpr->funcresulttype,
3639 : : proctup);
3640 : :
3641 : : /* Fetch proargmodes; if it's null, there are no output args */
3642 : 291 : proargmodes = SysCacheGetAttr(PROCOID, proctup,
3643 : : Anum_pg_proc_proargmodes,
3644 : : &isNull);
3645 [ + + ]: 291 : if (!isNull)
3646 : : {
3647 : : /*
3648 : : * Split the list into input arguments in fexpr->args and output
3649 : : * arguments in stmt->outargs. INOUT arguments appear in both lists.
3650 : : */
3651 : : ArrayType *arr;
3652 : : int numargs;
3653 : : char *argmodes;
3654 : : List *inargs;
3655 : : int i;
3656 : :
3657 : 119 : arr = DatumGetArrayTypeP(proargmodes); /* ensure not toasted */
3658 : 119 : numargs = list_length(fexpr->args);
3659 [ + - ]: 119 : if (ARR_NDIM(arr) != 1 ||
3660 [ + - ]: 119 : ARR_DIMS(arr)[0] != numargs ||
3661 [ + - ]: 119 : ARR_HASNULL(arr) ||
3662 [ - + ]: 119 : ARR_ELEMTYPE(arr) != CHAROID)
3663 [ # # ]: 0 : elog(ERROR, "proargmodes is not a 1-D char array of length %d or it contains nulls",
3664 : : numargs);
3665 [ - + ]: 119 : argmodes = (char *) ARR_DATA_PTR(arr);
3666 : :
3667 : 119 : inargs = NIL;
3668 : 119 : i = 0;
3669 [ + - + + : 395 : foreach(lc, fexpr->args)
+ + ]
3670 : : {
3671 : 276 : Node *n = lfirst(lc);
3672 : :
3673 [ + + + - ]: 276 : switch (argmodes[i])
3674 : : {
3675 : 91 : case PROARGMODE_IN:
3676 : : case PROARGMODE_VARIADIC:
3677 : 91 : inargs = lappend(inargs, n);
3678 : 91 : break;
3679 : 72 : case PROARGMODE_OUT:
3680 : 72 : outargs = lappend(outargs, n);
3681 : 72 : break;
3682 : 113 : case PROARGMODE_INOUT:
3683 : 113 : inargs = lappend(inargs, n);
3684 : 113 : outargs = lappend(outargs, copyObject(n));
3685 : 113 : break;
3686 : 0 : default:
3687 : : /* note we don't support PROARGMODE_TABLE */
3688 [ # # ]: 0 : elog(ERROR, "invalid argmode %c for procedure",
3689 : : argmodes[i]);
3690 : : break;
3691 : : }
3692 : 276 : i++;
3693 : : }
3694 : 119 : fexpr->args = inargs;
3695 : : }
3696 : :
3697 : 291 : stmt->funcexpr = fexpr;
3698 : 291 : stmt->outargs = outargs;
3699 : :
3700 : 291 : ReleaseSysCache(proctup);
3701 : :
3702 : : /* represent the command as a utility Query */
3703 : 291 : result = makeNode(Query);
3704 : 291 : result->commandType = CMD_UTILITY;
3705 : 291 : result->utilityStmt = (Node *) stmt;
3706 : :
3707 : 291 : return result;
3708 : : }
3709 : :
3710 : : /*
3711 : : * Produce a string representation of a LockClauseStrength value.
3712 : : * This should only be applied to valid values (not LCS_NONE).
3713 : : */
3714 : : const char *
3715 : 36 : LCS_asString(LockClauseStrength strength)
3716 : : {
3717 [ - - - + : 36 : switch (strength)
+ - ]
3718 : : {
3719 : 0 : case LCS_NONE:
3720 : : Assert(false);
3721 : 0 : break;
3722 : 0 : case LCS_FORKEYSHARE:
3723 : 0 : return "FOR KEY SHARE";
3724 : 0 : case LCS_FORSHARE:
3725 : 0 : return "FOR SHARE";
3726 : 4 : case LCS_FORNOKEYUPDATE:
3727 : 4 : return "FOR NO KEY UPDATE";
3728 : 32 : case LCS_FORUPDATE:
3729 : 32 : return "FOR UPDATE";
3730 : : }
3731 : 0 : return "FOR some"; /* shouldn't happen */
3732 : : }
3733 : :
3734 : : /*
3735 : : * Check for features that are not supported with FOR [KEY] UPDATE/SHARE.
3736 : : *
3737 : : * exported so planner can check again after rewriting, query pullup, etc
3738 : : */
3739 : : void
3740 : 11617 : CheckSelectLocking(Query *qry, LockClauseStrength strength)
3741 : : {
3742 : : Assert(strength != LCS_NONE); /* else caller error */
3743 : :
3744 [ - + ]: 11617 : if (qry->setOperations)
3745 [ # # ]: 0 : ereport(ERROR,
3746 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3747 : : /*------
3748 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3749 : : errmsg("%s is not allowed with UNION/INTERSECT/EXCEPT",
3750 : : LCS_asString(strength))));
3751 [ - + ]: 11617 : if (qry->distinctClause != NIL)
3752 [ # # ]: 0 : ereport(ERROR,
3753 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3754 : : /*------
3755 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3756 : : errmsg("%s is not allowed with DISTINCT clause",
3757 : : LCS_asString(strength))));
3758 [ + + + + ]: 11617 : if (qry->groupClause != NIL || qry->groupingSets != NIL)
3759 [ + - ]: 8 : ereport(ERROR,
3760 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3761 : : /*------
3762 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3763 : : errmsg("%s is not allowed with GROUP BY clause",
3764 : : LCS_asString(strength))));
3765 [ - + ]: 11609 : if (qry->havingQual != NULL)
3766 [ # # ]: 0 : ereport(ERROR,
3767 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3768 : : /*------
3769 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3770 : : errmsg("%s is not allowed with HAVING clause",
3771 : : LCS_asString(strength))));
3772 [ + + ]: 11609 : if (qry->hasAggs)
3773 [ + - ]: 4 : ereport(ERROR,
3774 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3775 : : /*------
3776 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3777 : : errmsg("%s is not allowed with aggregate functions",
3778 : : LCS_asString(strength))));
3779 [ - + ]: 11605 : if (qry->hasWindowFuncs)
3780 [ # # ]: 0 : ereport(ERROR,
3781 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3782 : : /*------
3783 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3784 : : errmsg("%s is not allowed with window functions",
3785 : : LCS_asString(strength))));
3786 [ - + ]: 11605 : if (qry->hasTargetSRFs)
3787 [ # # ]: 0 : ereport(ERROR,
3788 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3789 : : /*------
3790 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3791 : : errmsg("%s is not allowed with set-returning functions in the target list",
3792 : : LCS_asString(strength))));
3793 : 11605 : }
3794 : :
3795 : : /*
3796 : : * Transform a FOR [KEY] UPDATE/SHARE clause
3797 : : *
3798 : : * This basically involves replacing names by integer relids.
3799 : : *
3800 : : * NB: if you need to change this, see also markQueryForLocking()
3801 : : * in rewriteHandler.c, and isLockedRefname() in parse_relation.c.
3802 : : */
3803 : : static void
3804 : 5045 : transformLockingClause(ParseState *pstate, Query *qry, LockingClause *lc,
3805 : : bool pushedDown)
3806 : : {
3807 : 5045 : List *lockedRels = lc->lockedRels;
3808 : : ListCell *l;
3809 : : ListCell *rt;
3810 : : Index i;
3811 : : LockingClause *allrels;
3812 : :
3813 : 5045 : CheckSelectLocking(qry, lc->strength);
3814 : :
3815 : : /* make a clause we can pass down to subqueries to select all rels */
3816 : 5033 : allrels = makeNode(LockingClause);
3817 : 5033 : allrels->lockedRels = NIL; /* indicates all rels */
3818 : 5033 : allrels->strength = lc->strength;
3819 : 5033 : allrels->waitPolicy = lc->waitPolicy;
3820 : :
3821 [ + + ]: 5033 : if (lockedRels == NIL)
3822 : : {
3823 : : /*
3824 : : * Lock all regular tables used in query and its subqueries. We
3825 : : * examine inFromCl to exclude auto-added RTEs, particularly NEW/OLD
3826 : : * in rules. This is a bit of an abuse of a mostly-obsolete flag, but
3827 : : * it's convenient. We can't rely on the namespace mechanism that has
3828 : : * largely replaced inFromCl, since for example we need to lock
3829 : : * base-relation RTEs even if they are masked by upper joins.
3830 : : */
3831 : 3808 : i = 0;
3832 [ + + + + : 7666 : foreach(rt, qry->rtable)
+ + ]
3833 : : {
3834 : 3858 : RangeTblEntry *rte = (RangeTblEntry *) lfirst(rt);
3835 : :
3836 : 3858 : ++i;
3837 [ + + ]: 3858 : if (!rte->inFromCl)
3838 : 8 : continue;
3839 [ + - + ]: 3850 : switch (rte->rtekind)
3840 : : {
3841 : 3830 : case RTE_RELATION:
3842 : : {
3843 : : RTEPermissionInfo *perminfo;
3844 : :
3845 : 3830 : applyLockingClause(qry, i,
3846 : : lc->strength,
3847 : : lc->waitPolicy,
3848 : : pushedDown);
3849 : 3830 : perminfo = getRTEPermissionInfo(qry->rteperminfos, rte);
3850 : 3830 : perminfo->requiredPerms |= ACL_SELECT_FOR_UPDATE;
3851 : : }
3852 : 3830 : break;
3853 : 0 : case RTE_SUBQUERY:
3854 : 0 : applyLockingClause(qry, i, lc->strength, lc->waitPolicy,
3855 : : pushedDown);
3856 : :
3857 : : /*
3858 : : * FOR UPDATE/SHARE of subquery is propagated to all of
3859 : : * subquery's rels, too. We could do this later (based on
3860 : : * the marking of the subquery RTE) but it is convenient
3861 : : * to have local knowledge in each query level about which
3862 : : * rels need to be opened with RowShareLock.
3863 : : */
3864 : 0 : transformLockingClause(pstate, rte->subquery,
3865 : : allrels, true);
3866 : 0 : break;
3867 : 20 : default:
3868 : : /* ignore all other RTE kinds */
3869 : 20 : break;
3870 : : }
3871 : : }
3872 : : }
3873 : : else
3874 : : {
3875 : : /*
3876 : : * Lock just the named tables. As above, we allow locking any base
3877 : : * relation regardless of alias-visibility rules, so we need to
3878 : : * examine inFromCl to exclude OLD/NEW.
3879 : : */
3880 [ + - + + : 2436 : foreach(l, lockedRels)
+ + ]
3881 : : {
3882 : 1231 : RangeVar *thisrel = (RangeVar *) lfirst(l);
3883 : :
3884 : : /* For simplicity we insist on unqualified alias names here */
3885 [ + - - + ]: 1231 : if (thisrel->catalogname || thisrel->schemaname)
3886 [ # # ]: 0 : ereport(ERROR,
3887 : : (errcode(ERRCODE_SYNTAX_ERROR),
3888 : : /*------
3889 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3890 : : errmsg("%s must specify unqualified relation names",
3891 : : LCS_asString(lc->strength)),
3892 : : parser_errposition(pstate, thisrel->location)));
3893 : :
3894 : 1231 : i = 0;
3895 [ + - + + : 1425 : foreach(rt, qry->rtable)
+ + ]
3896 : : {
3897 : 1417 : RangeTblEntry *rte = (RangeTblEntry *) lfirst(rt);
3898 : 1417 : char *rtename = rte->eref->aliasname;
3899 : :
3900 : 1417 : ++i;
3901 [ + + ]: 1417 : if (!rte->inFromCl)
3902 : 16 : continue;
3903 : :
3904 : : /*
3905 : : * A join RTE without an alias is not visible as a relation
3906 : : * name and needs to be skipped (otherwise it might hide a
3907 : : * base relation with the same name), except if it has a USING
3908 : : * alias, which *is* visible.
3909 : : *
3910 : : * Subquery and values RTEs without aliases are never visible
3911 : : * as relation names and must always be skipped.
3912 : : */
3913 [ + + ]: 1401 : if (rte->alias == NULL)
3914 : : {
3915 [ + + ]: 109 : if (rte->rtekind == RTE_JOIN)
3916 : : {
3917 [ + + ]: 40 : if (rte->join_using_alias == NULL)
3918 : 32 : continue;
3919 : 8 : rtename = rte->join_using_alias->aliasname;
3920 : : }
3921 [ + + ]: 69 : else if (rte->rtekind == RTE_SUBQUERY ||
3922 [ - + ]: 65 : rte->rtekind == RTE_VALUES)
3923 : 4 : continue;
3924 : : }
3925 : :
3926 [ + + ]: 1365 : if (strcmp(rtename, thisrel->relname) == 0)
3927 : : {
3928 [ + + + - : 1223 : switch (rte->rtekind)
- - - - +
- ]
3929 : : {
3930 : 1205 : case RTE_RELATION:
3931 : : {
3932 : : RTEPermissionInfo *perminfo;
3933 : :
3934 : 1205 : applyLockingClause(qry, i,
3935 : : lc->strength,
3936 : : lc->waitPolicy,
3937 : : pushedDown);
3938 : 1205 : perminfo = getRTEPermissionInfo(qry->rteperminfos, rte);
3939 : 1205 : perminfo->requiredPerms |= ACL_SELECT_FOR_UPDATE;
3940 : : }
3941 : 1205 : break;
3942 : 6 : case RTE_SUBQUERY:
3943 : 6 : applyLockingClause(qry, i, lc->strength,
3944 : : lc->waitPolicy, pushedDown);
3945 : : /* see comment above */
3946 : 6 : transformLockingClause(pstate, rte->subquery,
3947 : : allrels, true);
3948 : 6 : break;
3949 : 8 : case RTE_JOIN:
3950 [ + - ]: 8 : ereport(ERROR,
3951 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3952 : : /*------
3953 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3954 : : errmsg("%s cannot be applied to a join",
3955 : : LCS_asString(lc->strength)),
3956 : : parser_errposition(pstate, thisrel->location)));
3957 : : break;
3958 : 0 : case RTE_FUNCTION:
3959 [ # # ]: 0 : ereport(ERROR,
3960 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3961 : : /*------
3962 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3963 : : errmsg("%s cannot be applied to a function",
3964 : : LCS_asString(lc->strength)),
3965 : : parser_errposition(pstate, thisrel->location)));
3966 : : break;
3967 : 0 : case RTE_TABLEFUNC:
3968 [ # # ]: 0 : ereport(ERROR,
3969 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3970 : : /*------
3971 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3972 : : errmsg("%s cannot be applied to a table function",
3973 : : LCS_asString(lc->strength)),
3974 : : parser_errposition(pstate, thisrel->location)));
3975 : : break;
3976 : 0 : case RTE_VALUES:
3977 [ # # ]: 0 : ereport(ERROR,
3978 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3979 : : /*------
3980 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3981 : : errmsg("%s cannot be applied to VALUES",
3982 : : LCS_asString(lc->strength)),
3983 : : parser_errposition(pstate, thisrel->location)));
3984 : : break;
3985 : 0 : case RTE_CTE:
3986 [ # # ]: 0 : ereport(ERROR,
3987 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3988 : : /*------
3989 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3990 : : errmsg("%s cannot be applied to a WITH query",
3991 : : LCS_asString(lc->strength)),
3992 : : parser_errposition(pstate, thisrel->location)));
3993 : : break;
3994 : 0 : case RTE_NAMEDTUPLESTORE:
3995 [ # # ]: 0 : ereport(ERROR,
3996 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
3997 : : /*------
3998 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
3999 : : errmsg("%s cannot be applied to a named tuplestore",
4000 : : LCS_asString(lc->strength)),
4001 : : parser_errposition(pstate, thisrel->location)));
4002 : : break;
4003 : 4 : case RTE_GRAPH_TABLE:
4004 [ + - ]: 4 : ereport(ERROR,
4005 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
4006 : : /*------
4007 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
4008 : : errmsg("%s cannot be applied to GRAPH_TABLE",
4009 : : LCS_asString(lc->strength)),
4010 : : parser_errposition(pstate, thisrel->location)));
4011 : : break;
4012 : :
4013 : : /* Shouldn't be possible to see RTE_RESULT here */
4014 : :
4015 : 0 : default:
4016 [ # # ]: 0 : elog(ERROR, "unrecognized RTE type: %d",
4017 : : (int) rte->rtekind);
4018 : : break;
4019 : : }
4020 : 1211 : break; /* out of foreach loop */
4021 : : }
4022 : : }
4023 [ + + ]: 1219 : if (rt == NULL)
4024 [ + - ]: 8 : ereport(ERROR,
4025 : : (errcode(ERRCODE_UNDEFINED_TABLE),
4026 : : /*------
4027 : : translator: %s is a SQL row locking clause such as FOR UPDATE */
4028 : : errmsg("relation \"%s\" in %s clause not found in FROM clause",
4029 : : thisrel->relname,
4030 : : LCS_asString(lc->strength)),
4031 : : parser_errposition(pstate, thisrel->location)));
4032 : : }
4033 : : }
4034 : 5013 : }
4035 : :
4036 : : /*
4037 : : * Record locking info for a single rangetable item
4038 : : */
4039 : : void
4040 : 5105 : applyLockingClause(Query *qry, Index rtindex,
4041 : : LockClauseStrength strength, LockWaitPolicy waitPolicy,
4042 : : bool pushedDown)
4043 : : {
4044 : : RowMarkClause *rc;
4045 : :
4046 : : Assert(strength != LCS_NONE); /* else caller error */
4047 : :
4048 : : /* If it's an explicit clause, make sure hasForUpdate gets set */
4049 [ + + ]: 5105 : if (!pushedDown)
4050 : 5039 : qry->hasForUpdate = true;
4051 : :
4052 : : /* Check for pre-existing entry for same rtindex */
4053 [ - + ]: 5105 : if ((rc = get_parse_rowmark(qry, rtindex)) != NULL)
4054 : : {
4055 : : /*
4056 : : * If the same RTE is specified with more than one locking strength,
4057 : : * use the strongest. (Reasonable, since you can't take both a shared
4058 : : * and exclusive lock at the same time; it'll end up being exclusive
4059 : : * anyway.)
4060 : : *
4061 : : * Similarly, if the same RTE is specified with more than one lock
4062 : : * wait policy, consider that NOWAIT wins over SKIP LOCKED, which in
4063 : : * turn wins over waiting for the lock (the default). This is a bit
4064 : : * more debatable but raising an error doesn't seem helpful. (Consider
4065 : : * for instance SELECT FOR UPDATE NOWAIT from a view that internally
4066 : : * contains a plain FOR UPDATE spec.) Having NOWAIT win over SKIP
4067 : : * LOCKED is reasonable since the former throws an error in case of
4068 : : * coming across a locked tuple, which may be undesirable in some
4069 : : * cases but it seems better than silently returning inconsistent
4070 : : * results.
4071 : : *
4072 : : * And of course pushedDown becomes false if any clause is explicit.
4073 : : */
4074 : 0 : rc->strength = Max(rc->strength, strength);
4075 : 0 : rc->waitPolicy = Max(rc->waitPolicy, waitPolicy);
4076 : 0 : rc->pushedDown &= pushedDown;
4077 : 0 : return;
4078 : : }
4079 : :
4080 : : /* Make a new RowMarkClause */
4081 : 5105 : rc = makeNode(RowMarkClause);
4082 : 5105 : rc->rti = rtindex;
4083 : 5105 : rc->strength = strength;
4084 : 5105 : rc->waitPolicy = waitPolicy;
4085 : 5105 : rc->pushedDown = pushedDown;
4086 : 5105 : qry->rowMarks = lappend(qry->rowMarks, rc);
4087 : : }
4088 : :
4089 : : #ifdef DEBUG_NODE_TESTS_ENABLED
4090 : : /*
4091 : : * Coverage testing for raw_expression_tree_walker().
4092 : : *
4093 : : * When enabled, we run raw_expression_tree_walker() over every DML statement
4094 : : * submitted to parse analysis. Without this provision, that function is only
4095 : : * applied in limited cases involving CTEs, and we don't really want to have
4096 : : * to test everything inside as well as outside a CTE.
4097 : : */
4098 : : static bool
4099 : 17316751 : test_raw_expression_coverage(Node *node, void *context)
4100 : : {
4101 [ + + ]: 17316751 : if (node == NULL)
4102 : 9337356 : return false;
4103 : 7979395 : return raw_expression_tree_walker(node,
4104 : : test_raw_expression_coverage,
4105 : : context);
4106 : : }
4107 : : #endif /* DEBUG_NODE_TESTS_ENABLED */
|
