Branch data Line data Source code
1 : : /*-------------------------------------------------------------------------
2 : : *
3 : : * execMain.c
4 : : * top level executor interface routines
5 : : *
6 : : * INTERFACE ROUTINES
7 : : * ExecutorStart()
8 : : * ExecutorRun()
9 : : * ExecutorFinish()
10 : : * ExecutorEnd()
11 : : *
12 : : * These four procedures are the external interface to the executor.
13 : : * In each case, the query descriptor is required as an argument.
14 : : *
15 : : * ExecutorStart must be called at the beginning of execution of any
16 : : * query plan and ExecutorEnd must always be called at the end of
17 : : * execution of a plan (unless it is aborted due to error).
18 : : *
19 : : * ExecutorRun accepts direction and count arguments that specify whether
20 : : * the plan is to be executed forwards, backwards, and for how many tuples.
21 : : * In some cases ExecutorRun may be called multiple times to process all
22 : : * the tuples for a plan. It is also acceptable to stop short of executing
23 : : * the whole plan (but only if it is a SELECT).
24 : : *
25 : : * ExecutorFinish must be called after the final ExecutorRun call and
26 : : * before ExecutorEnd. This can be omitted only in case of EXPLAIN,
27 : : * which should also omit ExecutorRun.
28 : : *
29 : : * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
30 : : * Portions Copyright (c) 1994, Regents of the University of California
31 : : *
32 : : *
33 : : * IDENTIFICATION
34 : : * src/backend/executor/execMain.c
35 : : *
36 : : *-------------------------------------------------------------------------
37 : : */
38 : : #include "postgres.h"
39 : :
40 : : #include "access/sysattr.h"
41 : : #include "access/table.h"
42 : : #include "access/tableam.h"
43 : : #include "access/xact.h"
44 : : #include "catalog/namespace.h"
45 : : #include "catalog/partition.h"
46 : : #include "commands/matview.h"
47 : : #include "commands/trigger.h"
48 : : #include "executor/executor.h"
49 : : #include "executor/execPartition.h"
50 : : #include "executor/nodeSubplan.h"
51 : : #include "foreign/fdwapi.h"
52 : : #include "mb/pg_wchar.h"
53 : : #include "miscadmin.h"
54 : : #include "nodes/queryjumble.h"
55 : : #include "parser/parse_relation.h"
56 : : #include "pgstat.h"
57 : : #include "rewrite/rewriteHandler.h"
58 : : #include "tcop/utility.h"
59 : : #include "utils/acl.h"
60 : : #include "utils/backend_status.h"
61 : : #include "utils/lsyscache.h"
62 : : #include "utils/partcache.h"
63 : : #include "utils/rls.h"
64 : : #include "utils/snapmgr.h"
65 : :
66 : :
67 : : /* Hooks for plugins to get control in ExecutorStart/Run/Finish/End */
68 : : ExecutorStart_hook_type ExecutorStart_hook = NULL;
69 : : ExecutorRun_hook_type ExecutorRun_hook = NULL;
70 : : ExecutorFinish_hook_type ExecutorFinish_hook = NULL;
71 : : ExecutorEnd_hook_type ExecutorEnd_hook = NULL;
72 : :
73 : : /* Hook for plugin to get control in ExecCheckPermissions() */
74 : : ExecutorCheckPerms_hook_type ExecutorCheckPerms_hook = NULL;
75 : :
76 : : /* decls for local routines only used within this module */
77 : : static void InitPlan(QueryDesc *queryDesc, int eflags);
78 : : static void CheckValidRowMarkRel(Relation rel, RowMarkType markType);
79 : : static void ExecPostprocessPlan(EState *estate);
80 : : static void ExecEndPlan(PlanState *planstate, EState *estate);
81 : : static void ExecutePlan(QueryDesc *queryDesc,
82 : : CmdType operation,
83 : : bool sendTuples,
84 : : uint64 numberTuples,
85 : : ScanDirection direction,
86 : : DestReceiver *dest);
87 : : static bool ExecCheckPermissionsModified(Oid relOid, Oid userid,
88 : : Bitmapset *modifiedCols,
89 : : AclMode requiredPerms);
90 : : static void ExecCheckXactReadOnly(PlannedStmt *plannedstmt);
91 : : static void EvalPlanQualStart(EPQState *epqstate, Plan *planTree);
92 : : static void ReportNotNullViolationError(ResultRelInfo *resultRelInfo,
93 : : TupleTableSlot *slot,
94 : : EState *estate, int attnum);
95 : :
96 : : /* end of local decls */
97 : :
98 : :
99 : : /* ----------------------------------------------------------------
100 : : * ExecutorStart
101 : : *
102 : : * This routine must be called at the beginning of any execution of any
103 : : * query plan
104 : : *
105 : : * Takes a QueryDesc previously created by CreateQueryDesc (which is separate
106 : : * only because some places use QueryDescs for utility commands). The tupDesc
107 : : * field of the QueryDesc is filled in to describe the tuples that will be
108 : : * returned, and the internal fields (estate and planstate) are set up.
109 : : *
110 : : * eflags contains flag bits as described in executor.h.
111 : : *
112 : : * NB: the CurrentMemoryContext when this is called will become the parent
113 : : * of the per-query context used for this Executor invocation.
114 : : *
115 : : * We provide a function hook variable that lets loadable plugins
116 : : * get control when ExecutorStart is called. Such a plugin would
117 : : * normally call standard_ExecutorStart().
118 : : *
119 : : * ----------------------------------------------------------------
120 : : */
121 : : void
122 : 454253 : ExecutorStart(QueryDesc *queryDesc, int eflags)
123 : : {
124 : : /*
125 : : * In some cases (e.g. an EXECUTE statement or an execute message with the
126 : : * extended query protocol) the query_id won't be reported, so do it now.
127 : : *
128 : : * Note that it's harmless to report the query_id multiple times, as the
129 : : * call will be ignored if the top level query_id has already been
130 : : * reported.
131 : : */
132 : 454253 : pgstat_report_query_id(queryDesc->plannedstmt->queryId, false);
133 : :
134 [ - + ]: 454253 : if (ExecutorStart_hook)
135 : 0 : (*ExecutorStart_hook) (queryDesc, eflags);
136 : : else
137 : 454253 : standard_ExecutorStart(queryDesc, eflags);
138 : 454253 : }
139 : :
140 : : void
141 : 454251 : standard_ExecutorStart(QueryDesc *queryDesc, int eflags)
142 : : {
143 : 454251 : EState *estate;
144 : 454251 : MemoryContext oldcontext;
145 : :
146 : : /* sanity checks: queryDesc must not be started already */
147 [ + - ]: 454251 : Assert(queryDesc != NULL);
148 [ + - ]: 454251 : Assert(queryDesc->estate == NULL);
149 : :
150 : : /* caller must ensure the query's snapshot is active */
151 [ + - ]: 454251 : Assert(GetActiveSnapshot() == queryDesc->snapshot);
152 : :
153 : : /*
154 : : * If the transaction is read-only, we need to check if any writes are
155 : : * planned to non-temporary tables. EXPLAIN is considered read-only.
156 : : *
157 : : * Don't allow writes in parallel mode. Supporting UPDATE and DELETE
158 : : * would require (a) storing the combo CID hash in shared memory, rather
159 : : * than synchronizing it just once at the start of parallelism, and (b) an
160 : : * alternative to heap_update()'s reliance on xmax for mutual exclusion.
161 : : * INSERT may have no such troubles, but we forbid it to simplify the
162 : : * checks.
163 : : *
164 : : * We have lower-level defenses in CommandCounterIncrement and elsewhere
165 : : * against performing unsafe operations in parallel mode, but this gives a
166 : : * more user-friendly error message.
167 : : */
168 [ + + + + ]: 454251 : if ((XactReadOnly || IsInParallelMode()) &&
169 : 454251 : !(eflags & EXEC_FLAG_EXPLAIN_ONLY))
170 : 469 : ExecCheckXactReadOnly(queryDesc->plannedstmt);
171 : :
172 : : /*
173 : : * Build EState, switch into per-query memory context for startup.
174 : : */
175 : 454251 : estate = CreateExecutorState();
176 : 454251 : queryDesc->estate = estate;
177 : :
178 : 454251 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
179 : :
180 : : /*
181 : : * Fill in external parameters, if any, from queryDesc; and allocate
182 : : * workspace for internal parameters
183 : : */
184 : 454251 : estate->es_param_list_info = queryDesc->params;
185 : :
186 [ + + ]: 454251 : if (queryDesc->plannedstmt->paramExecTypes != NIL)
187 : : {
188 : 417166 : int nParamExec;
189 : :
190 : 417166 : nParamExec = list_length(queryDesc->plannedstmt->paramExecTypes);
191 : 417166 : estate->es_param_exec_vals = (ParamExecData *)
192 : 417166 : palloc0_array(ParamExecData, nParamExec);
193 : 417166 : }
194 : :
195 : : /* We now require all callers to provide sourceText */
196 [ + - ]: 454251 : Assert(queryDesc->sourceText != NULL);
197 : 454251 : estate->es_sourceText = queryDesc->sourceText;
198 : :
199 : : /*
200 : : * Fill in the query environment, if any, from queryDesc.
201 : : */
202 : 454251 : estate->es_queryEnv = queryDesc->queryEnv;
203 : :
204 : : /*
205 : : * If non-read-only query, set the command ID to mark output tuples with
206 : : */
207 [ + + - ]: 454251 : switch (queryDesc->operation)
208 : : {
209 : : case CMD_SELECT:
210 : :
211 : : /*
212 : : * SELECT FOR [KEY] UPDATE/SHARE and modifying CTEs need to mark
213 : : * tuples
214 : : */
215 [ + + + + ]: 444028 : if (queryDesc->plannedstmt->rowMarks != NIL ||
216 : 43235 : queryDesc->plannedstmt->hasModifyingCTE)
217 : 400814 : estate->es_output_cid = GetCurrentCommandId(true);
218 : :
219 : : /*
220 : : * A SELECT without modifying CTEs can't possibly queue triggers,
221 : : * so force skip-triggers mode. This is just a marginal efficiency
222 : : * hack, since AfterTriggerBeginQuery/AfterTriggerEndQuery aren't
223 : : * all that expensive, but we might as well do it.
224 : : */
225 [ + + ]: 444028 : if (!queryDesc->plannedstmt->hasModifyingCTE)
226 : 444006 : eflags |= EXEC_FLAG_SKIP_TRIGGERS;
227 : 444028 : break;
228 : :
229 : : case CMD_INSERT:
230 : : case CMD_DELETE:
231 : : case CMD_UPDATE:
232 : : case CMD_MERGE:
233 : 10223 : estate->es_output_cid = GetCurrentCommandId(true);
234 : 10223 : break;
235 : :
236 : : default:
237 [ # # # # ]: 0 : elog(ERROR, "unrecognized operation code: %d",
238 : : (int) queryDesc->operation);
239 : 0 : break;
240 : : }
241 : :
242 : : /*
243 : : * Copy other important information into the EState
244 : : */
245 : 454251 : estate->es_snapshot = RegisterSnapshot(queryDesc->snapshot);
246 : 454251 : estate->es_crosscheck_snapshot = RegisterSnapshot(queryDesc->crosscheck_snapshot);
247 : 454251 : estate->es_top_eflags = eflags;
248 : 454251 : estate->es_instrument = queryDesc->instrument_options;
249 : 454251 : estate->es_jit_flags = queryDesc->plannedstmt->jitFlags;
250 : :
251 : : /*
252 : : * Set up an AFTER-trigger statement context, unless told not to, or
253 : : * unless it's EXPLAIN-only mode (when ExecutorFinish won't be called).
254 : : */
255 [ + + ]: 454251 : if (!(eflags & (EXEC_FLAG_SKIP_TRIGGERS | EXEC_FLAG_EXPLAIN_ONLY)))
256 : 10014 : AfterTriggerBeginQuery();
257 : :
258 : : /*
259 : : * Initialize the plan state tree
260 : : */
261 : 454251 : InitPlan(queryDesc, eflags);
262 : :
263 : 454251 : MemoryContextSwitchTo(oldcontext);
264 : 454251 : }
265 : :
266 : : /* ----------------------------------------------------------------
267 : : * ExecutorRun
268 : : *
269 : : * This is the main routine of the executor module. It accepts
270 : : * the query descriptor from the traffic cop and executes the
271 : : * query plan.
272 : : *
273 : : * ExecutorStart must have been called already.
274 : : *
275 : : * If direction is NoMovementScanDirection then nothing is done
276 : : * except to start up/shut down the destination. Otherwise,
277 : : * we retrieve up to 'count' tuples in the specified direction.
278 : : *
279 : : * Note: count = 0 is interpreted as no portal limit, i.e., run to
280 : : * completion. Also note that the count limit is only applied to
281 : : * retrieved tuples, not for instance to those inserted/updated/deleted
282 : : * by a ModifyTable plan node.
283 : : *
284 : : * There is no return value, but output tuples (if any) are sent to
285 : : * the destination receiver specified in the QueryDesc; and the number
286 : : * of tuples processed at the top level can be found in
287 : : * estate->es_processed. The total number of tuples processed in all
288 : : * the ExecutorRun calls can be found in estate->es_total_processed.
289 : : *
290 : : * We provide a function hook variable that lets loadable plugins
291 : : * get control when ExecutorRun is called. Such a plugin would
292 : : * normally call standard_ExecutorRun().
293 : : *
294 : : * ----------------------------------------------------------------
295 : : */
296 : : void
297 : 452537 : ExecutorRun(QueryDesc *queryDesc,
298 : : ScanDirection direction, uint64 count)
299 : : {
300 [ - + ]: 452537 : if (ExecutorRun_hook)
301 : 0 : (*ExecutorRun_hook) (queryDesc, direction, count);
302 : : else
303 : 452537 : standard_ExecutorRun(queryDesc, direction, count);
304 : 452537 : }
305 : :
306 : : void
307 : 452537 : standard_ExecutorRun(QueryDesc *queryDesc,
308 : : ScanDirection direction, uint64 count)
309 : : {
310 : 452537 : EState *estate;
311 : 452537 : CmdType operation;
312 : 452537 : DestReceiver *dest;
313 : 452537 : bool sendTuples;
314 : 452537 : MemoryContext oldcontext;
315 : :
316 : : /* sanity checks */
317 [ + - ]: 452537 : Assert(queryDesc != NULL);
318 : :
319 : 452537 : estate = queryDesc->estate;
320 : :
321 [ + - ]: 452537 : Assert(estate != NULL);
322 [ + - ]: 452537 : Assert(!(estate->es_top_eflags & EXEC_FLAG_EXPLAIN_ONLY));
323 : :
324 : : /* caller must ensure the query's snapshot is active */
325 [ + - ]: 452537 : Assert(GetActiveSnapshot() == estate->es_snapshot);
326 : :
327 : : /*
328 : : * Switch into per-query memory context
329 : : */
330 : 452537 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
331 : :
332 : : /* Allow instrumentation of Executor overall runtime */
333 [ + - ]: 452537 : if (queryDesc->totaltime)
334 : 0 : InstrStartNode(queryDesc->totaltime);
335 : :
336 : : /*
337 : : * extract information from the query descriptor and the query feature.
338 : : */
339 : 452537 : operation = queryDesc->operation;
340 : 452537 : dest = queryDesc->dest;
341 : :
342 : : /*
343 : : * startup tuple receiver, if we will be emitting tuples
344 : : */
345 : 452537 : estate->es_processed = 0;
346 : :
347 [ + + ]: 452537 : sendTuples = (operation == CMD_SELECT ||
348 : 9935 : queryDesc->plannedstmt->hasReturning);
349 : :
350 [ + + ]: 452537 : if (sendTuples)
351 : 443009 : dest->rStartup(dest, operation, queryDesc->tupDesc);
352 : :
353 : : /*
354 : : * Run plan, unless direction is NoMovement.
355 : : *
356 : : * Note: pquery.c selects NoMovement if a prior call already reached
357 : : * end-of-data in the user-specified fetch direction. This is important
358 : : * because various parts of the executor can misbehave if called again
359 : : * after reporting EOF. For example, heapam.c would actually restart a
360 : : * heapscan and return all its data afresh. There is also some doubt
361 : : * about whether a parallel plan would operate properly if an additional,
362 : : * necessarily non-parallel execution request occurs after completing a
363 : : * parallel execution. (That case should work, but it's untested.)
364 : : */
365 [ + + ]: 452537 : if (!ScanDirectionIsNoMovement(direction))
366 : 904790 : ExecutePlan(queryDesc,
367 : 452395 : operation,
368 : 452395 : sendTuples,
369 : 452395 : count,
370 : 452395 : direction,
371 : 452395 : dest);
372 : :
373 : : /*
374 : : * Update es_total_processed to keep track of the number of tuples
375 : : * processed across multiple ExecutorRun() calls.
376 : : */
377 : 452537 : estate->es_total_processed += estate->es_processed;
378 : :
379 : : /*
380 : : * shutdown tuple receiver, if we started it
381 : : */
382 [ + + ]: 452537 : if (sendTuples)
383 : 437409 : dest->rShutdown(dest);
384 : :
385 [ + - ]: 452537 : if (queryDesc->totaltime)
386 : 0 : InstrStopNode(queryDesc->totaltime, estate->es_processed);
387 : :
388 : 452537 : MemoryContextSwitchTo(oldcontext);
389 : 452537 : }
390 : :
391 : : /* ----------------------------------------------------------------
392 : : * ExecutorFinish
393 : : *
394 : : * This routine must be called after the last ExecutorRun call.
395 : : * It performs cleanup such as firing AFTER triggers. It is
396 : : * separate from ExecutorEnd because EXPLAIN ANALYZE needs to
397 : : * include these actions in the total runtime.
398 : : *
399 : : * We provide a function hook variable that lets loadable plugins
400 : : * get control when ExecutorFinish is called. Such a plugin would
401 : : * normally call standard_ExecutorFinish().
402 : : *
403 : : * ----------------------------------------------------------------
404 : : */
405 : : void
406 : 444558 : ExecutorFinish(QueryDesc *queryDesc)
407 : : {
408 [ - + ]: 444558 : if (ExecutorFinish_hook)
409 : 0 : (*ExecutorFinish_hook) (queryDesc);
410 : : else
411 : 444558 : standard_ExecutorFinish(queryDesc);
412 : 444558 : }
413 : :
414 : : void
415 : 444558 : standard_ExecutorFinish(QueryDesc *queryDesc)
416 : : {
417 : 444558 : EState *estate;
418 : 444558 : MemoryContext oldcontext;
419 : :
420 : : /* sanity checks */
421 [ + - ]: 444558 : Assert(queryDesc != NULL);
422 : :
423 : 444558 : estate = queryDesc->estate;
424 : :
425 [ + - ]: 444558 : Assert(estate != NULL);
426 [ + - ]: 444558 : Assert(!(estate->es_top_eflags & EXEC_FLAG_EXPLAIN_ONLY));
427 : :
428 : : /* This should be run once and only once per Executor instance */
429 [ + - ]: 444558 : Assert(!estate->es_finished);
430 : :
431 : : /* Switch into per-query memory context */
432 : 444558 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
433 : :
434 : : /* Allow instrumentation of Executor overall runtime */
435 [ + - ]: 444558 : if (queryDesc->totaltime)
436 : 0 : InstrStartNode(queryDesc->totaltime);
437 : :
438 : : /* Run ModifyTable nodes to completion */
439 : 444558 : ExecPostprocessPlan(estate);
440 : :
441 : : /* Execute queued AFTER triggers, unless told not to */
442 [ + + ]: 444558 : if (!(estate->es_top_eflags & EXEC_FLAG_SKIP_TRIGGERS))
443 : 9392 : AfterTriggerEndQuery(estate);
444 : :
445 [ + - ]: 444558 : if (queryDesc->totaltime)
446 : 0 : InstrStopNode(queryDesc->totaltime, 0);
447 : :
448 : 444558 : MemoryContextSwitchTo(oldcontext);
449 : :
450 : 444558 : estate->es_finished = true;
451 : 444558 : }
452 : :
453 : : /* ----------------------------------------------------------------
454 : : * ExecutorEnd
455 : : *
456 : : * This routine must be called at the end of execution of any
457 : : * query plan
458 : : *
459 : : * We provide a function hook variable that lets loadable plugins
460 : : * get control when ExecutorEnd is called. Such a plugin would
461 : : * normally call standard_ExecutorEnd().
462 : : *
463 : : * ----------------------------------------------------------------
464 : : */
465 : : void
466 : 447452 : ExecutorEnd(QueryDesc *queryDesc)
467 : : {
468 [ - + ]: 447452 : if (ExecutorEnd_hook)
469 : 0 : (*ExecutorEnd_hook) (queryDesc);
470 : : else
471 : 447452 : standard_ExecutorEnd(queryDesc);
472 : 447452 : }
473 : :
474 : : void
475 : 447452 : standard_ExecutorEnd(QueryDesc *queryDesc)
476 : : {
477 : 447452 : EState *estate;
478 : 447452 : MemoryContext oldcontext;
479 : :
480 : : /* sanity checks */
481 [ + - ]: 447452 : Assert(queryDesc != NULL);
482 : :
483 : 447452 : estate = queryDesc->estate;
484 : :
485 [ + - ]: 447452 : Assert(estate != NULL);
486 : :
487 [ + + ]: 447452 : if (estate->es_parallel_workers_to_launch > 0)
488 : 230 : pgstat_update_parallel_workers_stats((PgStat_Counter) estate->es_parallel_workers_to_launch,
489 : 115 : (PgStat_Counter) estate->es_parallel_workers_launched);
490 : :
491 : : /*
492 : : * Check that ExecutorFinish was called, unless in EXPLAIN-only mode. This
493 : : * Assert is needed because ExecutorFinish is new as of 9.1, and callers
494 : : * might forget to call it.
495 : : */
496 [ + + + - ]: 447452 : Assert(estate->es_finished ||
497 : : (estate->es_top_eflags & EXEC_FLAG_EXPLAIN_ONLY));
498 : :
499 : : /*
500 : : * Switch into per-query memory context to run ExecEndPlan
501 : : */
502 : 447452 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
503 : :
504 : 447452 : ExecEndPlan(queryDesc->planstate, estate);
505 : :
506 : : /* do away with our snapshots */
507 : 447452 : UnregisterSnapshot(estate->es_snapshot);
508 : 447452 : UnregisterSnapshot(estate->es_crosscheck_snapshot);
509 : :
510 : : /*
511 : : * Must switch out of context before destroying it
512 : : */
513 : 447452 : MemoryContextSwitchTo(oldcontext);
514 : :
515 : : /*
516 : : * Release EState and per-query memory context. This should release
517 : : * everything the executor has allocated.
518 : : */
519 : 447452 : FreeExecutorState(estate);
520 : :
521 : : /* Reset queryDesc fields that no longer point to anything */
522 : 447452 : queryDesc->tupDesc = NULL;
523 : 447452 : queryDesc->estate = NULL;
524 : 447452 : queryDesc->planstate = NULL;
525 : 447452 : queryDesc->totaltime = NULL;
526 : 447452 : }
527 : :
528 : : /* ----------------------------------------------------------------
529 : : * ExecutorRewind
530 : : *
531 : : * This routine may be called on an open queryDesc to rewind it
532 : : * to the start.
533 : : * ----------------------------------------------------------------
534 : : */
535 : : void
536 : 12 : ExecutorRewind(QueryDesc *queryDesc)
537 : : {
538 : 12 : EState *estate;
539 : 12 : MemoryContext oldcontext;
540 : :
541 : : /* sanity checks */
542 [ + - ]: 12 : Assert(queryDesc != NULL);
543 : :
544 : 12 : estate = queryDesc->estate;
545 : :
546 [ + - ]: 12 : Assert(estate != NULL);
547 : :
548 : : /* It's probably not sensible to rescan updating queries */
549 [ + - ]: 12 : Assert(queryDesc->operation == CMD_SELECT);
550 : :
551 : : /*
552 : : * Switch into per-query memory context
553 : : */
554 : 12 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
555 : :
556 : : /*
557 : : * rescan plan
558 : : */
559 : 12 : ExecReScan(queryDesc->planstate);
560 : :
561 : 12 : MemoryContextSwitchTo(oldcontext);
562 : 12 : }
563 : :
564 : :
565 : : /*
566 : : * ExecCheckPermissions
567 : : * Check access permissions of relations mentioned in a query
568 : : *
569 : : * Returns true if permissions are adequate. Otherwise, throws an appropriate
570 : : * error if ereport_on_violation is true, or simply returns false otherwise.
571 : : *
572 : : * Note that this does NOT address row-level security policies (aka: RLS). If
573 : : * rows will be returned to the user as a result of this permission check
574 : : * passing, then RLS also needs to be consulted (and check_enable_rls()).
575 : : *
576 : : * See rewrite/rowsecurity.c.
577 : : *
578 : : * NB: rangeTable is no longer used by us, but kept around for the hooks that
579 : : * might still want to look at the RTEs.
580 : : */
581 : : bool
582 : 454682 : ExecCheckPermissions(List *rangeTable, List *rteperminfos,
583 : : bool ereport_on_violation)
584 : : {
585 : 454682 : ListCell *l;
586 : 454682 : bool result = true;
587 : :
588 : : #ifdef USE_ASSERT_CHECKING
589 : 454682 : Bitmapset *indexset = NULL;
590 : :
591 : : /* Check that rteperminfos is consistent with rangeTable */
592 [ + - + + : 965111 : foreach(l, rangeTable)
+ + ]
593 : : {
594 : 510429 : RangeTblEntry *rte = lfirst_node(RangeTblEntry, l);
595 : :
596 [ + + ]: 510429 : if (rte->perminfoindex != 0)
597 : : {
598 : : /* Sanity checks */
599 : :
600 : : /*
601 : : * Only relation RTEs and subquery RTEs that were once relation
602 : : * RTEs (views) have their perminfoindex set.
603 : : */
604 [ + + + - ]: 455334 : Assert(rte->rtekind == RTE_RELATION ||
605 : : (rte->rtekind == RTE_SUBQUERY &&
606 : : rte->relkind == RELKIND_VIEW));
607 : :
608 : 455334 : (void) getRTEPermissionInfo(rteperminfos, rte);
609 : : /* Many-to-one mapping not allowed */
610 [ + - ]: 455334 : Assert(!bms_is_member(rte->perminfoindex, indexset));
611 : 455334 : indexset = bms_add_member(indexset, rte->perminfoindex);
612 : 455334 : }
613 : 510429 : }
614 : :
615 : : /* All rteperminfos are referenced */
616 [ + - ]: 454682 : Assert(bms_num_members(indexset) == list_length(rteperminfos));
617 : : #endif
618 : :
619 [ + + + + : 910180 : foreach(l, rteperminfos)
+ + + + ]
620 : : {
621 : 455506 : RTEPermissionInfo *perminfo = lfirst_node(RTEPermissionInfo, l);
622 : :
623 [ + - ]: 455506 : Assert(OidIsValid(perminfo->relid));
624 : 455506 : result = ExecCheckOneRelPerms(perminfo);
625 [ + + ]: 455506 : if (!result)
626 : : {
627 [ + + ]: 428 : if (ereport_on_violation)
628 : 215 : aclcheck_error(ACLCHECK_NO_PRIV,
629 : 215 : get_relkind_objtype(get_rel_relkind(perminfo->relid)),
630 : 215 : get_rel_name(perminfo->relid));
631 : 428 : return false;
632 : : }
633 [ + + ]: 455080 : }
634 : :
635 [ - + ]: 454465 : if (ExecutorCheckPerms_hook)
636 : 0 : result = (*ExecutorCheckPerms_hook) (rangeTable, rteperminfos,
637 : 0 : ereport_on_violation);
638 : 454465 : return result;
639 : 454674 : }
640 : :
641 : : /*
642 : : * ExecCheckOneRelPerms
643 : : * Check access permissions for a single relation.
644 : : */
645 : : bool
646 : 457712 : ExecCheckOneRelPerms(RTEPermissionInfo *perminfo)
647 : : {
648 : 457712 : AclMode requiredPerms;
649 : 457712 : AclMode relPerms;
650 : 457712 : AclMode remainingPerms;
651 : 457712 : Oid userid;
652 : 457712 : Oid relOid = perminfo->relid;
653 : :
654 : 457712 : requiredPerms = perminfo->requiredPerms;
655 [ + - ]: 457712 : Assert(requiredPerms != 0);
656 : :
657 : : /*
658 : : * userid to check as: current user unless we have a setuid indication.
659 : : *
660 : : * Note: GetUserId() is presently fast enough that there's no harm in
661 : : * calling it separately for each relation. If that stops being true, we
662 : : * could call it once in ExecCheckPermissions and pass the userid down
663 : : * from there. But for now, no need for the extra clutter.
664 : : */
665 [ + + ]: 457712 : userid = OidIsValid(perminfo->checkAsUser) ?
666 : 457712 : perminfo->checkAsUser : GetUserId();
667 : :
668 : : /*
669 : : * We must have *all* the requiredPerms bits, but some of the bits can be
670 : : * satisfied from column-level rather than relation-level permissions.
671 : : * First, remove any bits that are satisfied by relation permissions.
672 : : */
673 : 457712 : relPerms = pg_class_aclmask(relOid, userid, requiredPerms, ACLMASK_ALL);
674 : 457712 : remainingPerms = requiredPerms & ~relPerms;
675 [ + + ]: 457712 : if (remainingPerms != 0)
676 : : {
677 : 474 : int col = -1;
678 : :
679 : : /*
680 : : * If we lack any permissions that exist only as relation permissions,
681 : : * we can fail straight away.
682 : : */
683 [ + + ]: 474 : if (remainingPerms & ~(ACL_SELECT | ACL_INSERT | ACL_UPDATE))
684 : 26 : return false;
685 : :
686 : : /*
687 : : * Check to see if we have the needed privileges at column level.
688 : : *
689 : : * Note: failures just report a table-level error; it would be nicer
690 : : * to report a column-level error if we have some but not all of the
691 : : * column privileges.
692 : : */
693 [ + + ]: 448 : if (remainingPerms & ACL_SELECT)
694 : : {
695 : : /*
696 : : * When the query doesn't explicitly reference any columns (for
697 : : * example, SELECT COUNT(*) FROM table), allow the query if we
698 : : * have SELECT on any column of the rel, as per SQL spec.
699 : : */
700 [ + + ]: 248 : if (bms_is_empty(perminfo->selectedCols))
701 : : {
702 : 9 : if (pg_attribute_aclcheck_all(relOid, userid, ACL_SELECT,
703 [ + + ]: 9 : ACLMASK_ANY) != ACLCHECK_OK)
704 : 2 : return false;
705 : 7 : }
706 : :
707 [ + + ]: 387 : while ((col = bms_next_member(perminfo->selectedCols, col)) >= 0)
708 : : {
709 : : /* bit #s are offset by FirstLowInvalidHeapAttributeNumber */
710 : 302 : AttrNumber attno = col + FirstLowInvalidHeapAttributeNumber;
711 : :
712 [ + + ]: 302 : if (attno == InvalidAttrNumber)
713 : : {
714 : : /* Whole-row reference, must have priv on all cols */
715 : 11 : if (pg_attribute_aclcheck_all(relOid, userid, ACL_SELECT,
716 [ + + ]: 11 : ACLMASK_ALL) != ACLCHECK_OK)
717 : 7 : return false;
718 : 4 : }
719 : : else
720 : : {
721 : 291 : if (pg_attribute_aclcheck(relOid, attno, userid,
722 [ + + ]: 291 : ACL_SELECT) != ACLCHECK_OK)
723 : 154 : return false;
724 : : }
725 [ + + ]: 302 : }
726 : 85 : }
727 : :
728 : : /*
729 : : * Basically the same for the mod columns, for both INSERT and UPDATE
730 : : * privilege as specified by remainingPerms.
731 : : */
732 [ + + + + ]: 285 : if (remainingPerms & ACL_INSERT &&
733 : 100 : !ExecCheckPermissionsModified(relOid,
734 : 50 : userid,
735 : 50 : perminfo->insertedCols,
736 : : ACL_INSERT))
737 : 28 : return false;
738 : :
739 [ + + + + ]: 257 : if (remainingPerms & ACL_UPDATE &&
740 : 380 : !ExecCheckPermissionsModified(relOid,
741 : 190 : userid,
742 : 190 : perminfo->updatedCols,
743 : : ACL_UPDATE))
744 : 64 : return false;
745 [ + + ]: 474 : }
746 : 457431 : return true;
747 : 457712 : }
748 : :
749 : : /*
750 : : * ExecCheckPermissionsModified
751 : : * Check INSERT or UPDATE access permissions for a single relation (these
752 : : * are processed uniformly).
753 : : */
754 : : static bool
755 : 240 : ExecCheckPermissionsModified(Oid relOid, Oid userid, Bitmapset *modifiedCols,
756 : : AclMode requiredPerms)
757 : : {
758 : 240 : int col = -1;
759 : :
760 : : /*
761 : : * When the query doesn't explicitly update any columns, allow the query
762 : : * if we have permission on any column of the rel. This is to handle
763 : : * SELECT FOR UPDATE as well as possible corner cases in UPDATE.
764 : : */
765 [ + + ]: 240 : if (bms_is_empty(modifiedCols))
766 : : {
767 : 8 : if (pg_attribute_aclcheck_all(relOid, userid, requiredPerms,
768 [ + - ]: 8 : ACLMASK_ANY) != ACLCHECK_OK)
769 : 8 : return false;
770 : 0 : }
771 : :
772 [ + + ]: 405 : while ((col = bms_next_member(modifiedCols, col)) >= 0)
773 : : {
774 : : /* bit #s are offset by FirstLowInvalidHeapAttributeNumber */
775 : 257 : AttrNumber attno = col + FirstLowInvalidHeapAttributeNumber;
776 : :
777 [ + - ]: 257 : if (attno == InvalidAttrNumber)
778 : : {
779 : : /* whole-row reference can't happen here */
780 [ # # # # ]: 0 : elog(ERROR, "whole-row update is not implemented");
781 : 0 : }
782 : : else
783 : : {
784 : 514 : if (pg_attribute_aclcheck(relOid, attno, userid,
785 [ + + + + ]: 514 : requiredPerms) != ACLCHECK_OK)
786 : 84 : return false;
787 : : }
788 [ + + ]: 257 : }
789 : 148 : return true;
790 : 240 : }
791 : :
792 : : /*
793 : : * Check that the query does not imply any writes to non-temp tables;
794 : : * unless we're in parallel mode, in which case don't even allow writes
795 : : * to temp tables.
796 : : *
797 : : * Note: in a Hot Standby this would need to reject writes to temp
798 : : * tables just as we do in parallel mode; but an HS standby can't have created
799 : : * any temp tables in the first place, so no need to check that.
800 : : */
801 : : static void
802 : 467 : ExecCheckXactReadOnly(PlannedStmt *plannedstmt)
803 : : {
804 : 467 : ListCell *l;
805 : :
806 : : /*
807 : : * Fail if write permissions are requested in parallel mode for table
808 : : * (temp or non-temp), otherwise fail for any non-temp table.
809 : : */
810 [ + + + + : 1194 : foreach(l, plannedstmt->permInfos)
+ + ]
811 : : {
812 : 727 : RTEPermissionInfo *perminfo = lfirst_node(RTEPermissionInfo, l);
813 : :
814 [ + + ]: 727 : if ((perminfo->requiredPerms & (~ACL_SELECT)) == 0)
815 : 723 : continue;
816 : :
817 [ + + ]: 4 : if (isTempNamespace(get_rel_namespace(perminfo->relid)))
818 : 2 : continue;
819 : :
820 : 2 : PreventCommandIfReadOnly(CreateCommandName((Node *) plannedstmt));
821 [ - + - ]: 727 : }
822 : :
823 [ + + - + ]: 467 : if (plannedstmt->commandType != CMD_SELECT || plannedstmt->hasModifyingCTE)
824 : 2 : PreventCommandIfParallelMode(CreateCommandName((Node *) plannedstmt));
825 : 467 : }
826 : :
827 : :
828 : : /* ----------------------------------------------------------------
829 : : * InitPlan
830 : : *
831 : : * Initializes the query plan: open files, allocate storage
832 : : * and start up the rule manager
833 : : * ----------------------------------------------------------------
834 : : */
835 : : static void
836 : 454049 : InitPlan(QueryDesc *queryDesc, int eflags)
837 : : {
838 : 454049 : CmdType operation = queryDesc->operation;
839 : 454049 : PlannedStmt *plannedstmt = queryDesc->plannedstmt;
840 : 454049 : Plan *plan = plannedstmt->planTree;
841 : 454049 : List *rangeTable = plannedstmt->rtable;
842 : 454049 : EState *estate = queryDesc->estate;
843 : 454049 : PlanState *planstate;
844 : 454049 : TupleDesc tupType;
845 : 454049 : ListCell *l;
846 : 454049 : int i;
847 : :
848 : : /*
849 : : * Do permissions checks
850 : : */
851 : 454049 : ExecCheckPermissions(rangeTable, plannedstmt->permInfos, true);
852 : :
853 : : /*
854 : : * initialize the node's execution state
855 : : */
856 : 908098 : ExecInitRangeTable(estate, rangeTable, plannedstmt->permInfos,
857 : 454049 : bms_copy(plannedstmt->unprunableRelids));
858 : :
859 : 454049 : estate->es_plannedstmt = plannedstmt;
860 : 454049 : estate->es_part_prune_infos = plannedstmt->partPruneInfos;
861 : :
862 : : /*
863 : : * Perform runtime "initial" pruning to identify which child subplans,
864 : : * corresponding to the children of plan nodes that contain
865 : : * PartitionPruneInfo such as Append, will not be executed. The results,
866 : : * which are bitmapsets of indexes of the child subplans that will be
867 : : * executed, are saved in es_part_prune_results. These results correspond
868 : : * to each PartitionPruneInfo entry, and the es_part_prune_results list is
869 : : * parallel to es_part_prune_infos.
870 : : */
871 : 454049 : ExecDoInitialPruning(estate);
872 : :
873 : : /*
874 : : * Next, build the ExecRowMark array from the PlanRowMark(s), if any.
875 : : */
876 [ + + ]: 454049 : if (plannedstmt->rowMarks)
877 : : {
878 : 401103 : estate->es_rowmarks = (ExecRowMark **)
879 : 401103 : palloc0_array(ExecRowMark *, estate->es_range_table_size);
880 [ + - + + : 802654 : foreach(l, plannedstmt->rowMarks)
+ + ]
881 : : {
882 : 401551 : PlanRowMark *rc = (PlanRowMark *) lfirst(l);
883 : 401551 : RangeTblEntry *rte = exec_rt_fetch(rc->rti, estate);
884 : 401551 : Oid relid;
885 : 401551 : Relation relation;
886 : 401551 : ExecRowMark *erm;
887 : :
888 : : /* ignore "parent" rowmarks; they are irrelevant at runtime */
889 [ + + ]: 401551 : if (rc->isParent)
890 : 260 : continue;
891 : :
892 : : /*
893 : : * Also ignore rowmarks belonging to child tables that have been
894 : : * pruned in ExecDoInitialPruning().
895 : : */
896 [ + + + + ]: 401291 : if (rte->rtekind == RTE_RELATION &&
897 : 401216 : !bms_is_member(rc->rti, estate->es_unpruned_relids))
898 : 12 : continue;
899 : :
900 : : /* get relation's OID (will produce InvalidOid if subquery) */
901 : 401279 : relid = rte->relid;
902 : :
903 : : /* open relation, if we need to access it for this mark type */
904 [ + + - ]: 401279 : switch (rc->markType)
905 : : {
906 : : case ROW_MARK_EXCLUSIVE:
907 : : case ROW_MARK_NOKEYEXCLUSIVE:
908 : : case ROW_MARK_SHARE:
909 : : case ROW_MARK_KEYSHARE:
910 : : case ROW_MARK_REFERENCE:
911 : 401204 : relation = ExecGetRangeTableRelation(estate, rc->rti, false);
912 : 401204 : break;
913 : : case ROW_MARK_COPY:
914 : : /* no physical table access is required */
915 : 75 : relation = NULL;
916 : 75 : break;
917 : : default:
918 [ # # # # ]: 0 : elog(ERROR, "unrecognized markType: %d", rc->markType);
919 : 0 : relation = NULL; /* keep compiler quiet */
920 : 0 : break;
921 : : }
922 : :
923 : : /* Check that relation is a legal target for marking */
924 [ + + ]: 401279 : if (relation)
925 : 401204 : CheckValidRowMarkRel(relation, rc->markType);
926 : :
927 : 401279 : erm = palloc_object(ExecRowMark);
928 : 401279 : erm->relation = relation;
929 : 401279 : erm->relid = relid;
930 : 401279 : erm->rti = rc->rti;
931 : 401279 : erm->prti = rc->prti;
932 : 401279 : erm->rowmarkId = rc->rowmarkId;
933 : 401279 : erm->markType = rc->markType;
934 : 401279 : erm->strength = rc->strength;
935 : 401279 : erm->waitPolicy = rc->waitPolicy;
936 : 401279 : erm->ermActive = false;
937 : 401279 : ItemPointerSetInvalid(&(erm->curCtid));
938 : 401279 : erm->ermExtra = NULL;
939 : :
940 [ + - ]: 401279 : Assert(erm->rti > 0 && erm->rti <= estate->es_range_table_size &&
941 : : estate->es_rowmarks[erm->rti - 1] == NULL);
942 : :
943 : 401279 : estate->es_rowmarks[erm->rti - 1] = erm;
944 [ - + + ]: 401551 : }
945 : 401103 : }
946 : :
947 : : /*
948 : : * Initialize the executor's tuple table to empty.
949 : : */
950 : 454049 : estate->es_tupleTable = NIL;
951 : :
952 : : /* signal that this EState is not used for EPQ */
953 : 454049 : estate->es_epq_active = NULL;
954 : :
955 : : /*
956 : : * Initialize private state information for each SubPlan. We must do this
957 : : * before running ExecInitNode on the main query tree, since
958 : : * ExecInitSubPlan expects to be able to find these entries.
959 : : */
960 [ + - ]: 454049 : Assert(estate->es_subplanstates == NIL);
961 : 454049 : i = 1; /* subplan indices count from 1 */
962 [ + + + + : 458651 : foreach(l, plannedstmt->subplans)
+ + ]
963 : : {
964 : 4602 : Plan *subplan = (Plan *) lfirst(l);
965 : 4602 : PlanState *subplanstate;
966 : 4602 : int sp_eflags;
967 : :
968 : : /*
969 : : * A subplan will never need to do BACKWARD scan nor MARK/RESTORE. If
970 : : * it is a parameterless subplan (not initplan), we suggest that it be
971 : : * prepared to handle REWIND efficiently; otherwise there is no need.
972 : : */
973 : 9204 : sp_eflags = eflags
974 : 4602 : & ~(EXEC_FLAG_REWIND | EXEC_FLAG_BACKWARD | EXEC_FLAG_MARK);
975 [ + + ]: 4602 : if (bms_is_member(i, plannedstmt->rewindPlanIDs))
976 : 7 : sp_eflags |= EXEC_FLAG_REWIND;
977 : :
978 : 4602 : subplanstate = ExecInitNode(subplan, estate, sp_eflags);
979 : :
980 : 9204 : estate->es_subplanstates = lappend(estate->es_subplanstates,
981 : 4602 : subplanstate);
982 : :
983 : 4602 : i++;
984 : 4602 : }
985 : :
986 : : /*
987 : : * Initialize the private state information for all the nodes in the query
988 : : * tree. This opens files, allocates storage and leaves us ready to start
989 : : * processing tuples.
990 : : */
991 : 454049 : planstate = ExecInitNode(plan, estate, eflags);
992 : :
993 : : /*
994 : : * Get the tuple descriptor describing the type of tuples to return.
995 : : */
996 : 454049 : tupType = ExecGetResultType(planstate);
997 : :
998 : : /*
999 : : * Initialize the junk filter if needed. SELECT queries need a filter if
1000 : : * there are any junk attrs in the top-level tlist.
1001 : : */
1002 [ + + ]: 454049 : if (operation == CMD_SELECT)
1003 : : {
1004 : 443927 : bool junk_filter_needed = false;
1005 : 443927 : ListCell *tlist;
1006 : :
1007 [ + + + + : 1354990 : foreach(tlist, plan->targetlist)
+ + ]
1008 : : {
1009 : 911063 : TargetEntry *tle = (TargetEntry *) lfirst(tlist);
1010 : :
1011 [ + + ]: 911063 : if (tle->resjunk)
1012 : : {
1013 : 403339 : junk_filter_needed = true;
1014 : 403339 : break;
1015 : : }
1016 [ + + ]: 911063 : }
1017 : :
1018 [ + + ]: 443927 : if (junk_filter_needed)
1019 : : {
1020 : 403339 : JunkFilter *j;
1021 : 403339 : TupleTableSlot *slot;
1022 : :
1023 : 403339 : slot = ExecInitExtraTupleSlot(estate, NULL, &TTSOpsVirtual);
1024 : 806678 : j = ExecInitJunkFilter(planstate->plan->targetlist,
1025 : 403339 : slot);
1026 : 403339 : estate->es_junkFilter = j;
1027 : :
1028 : : /* Want to return the cleaned tuple type */
1029 : 403339 : tupType = j->jf_cleanTupType;
1030 : 403339 : }
1031 : 443927 : }
1032 : :
1033 : 454049 : queryDesc->tupDesc = tupType;
1034 : 454049 : queryDesc->planstate = planstate;
1035 : 454049 : }
1036 : :
1037 : : /*
1038 : : * Check that a proposed result relation is a legal target for the operation
1039 : : *
1040 : : * Generally the parser and/or planner should have noticed any such mistake
1041 : : * already, but let's make sure.
1042 : : *
1043 : : * For INSERT ON CONFLICT, the result relation is required to support the
1044 : : * onConflictAction, regardless of whether a conflict actually occurs.
1045 : : *
1046 : : * For MERGE, mergeActions is the list of actions that may be performed. The
1047 : : * result relation is required to support every action, regardless of whether
1048 : : * or not they are all executed.
1049 : : *
1050 : : * Note: when changing this function, you probably also need to look at
1051 : : * CheckValidRowMarkRel.
1052 : : */
1053 : : void
1054 : 11684 : CheckValidResultRel(ResultRelInfo *resultRelInfo, CmdType operation,
1055 : : OnConflictAction onConflictAction, List *mergeActions)
1056 : : {
1057 : 11684 : Relation resultRel = resultRelInfo->ri_RelationDesc;
1058 : 11684 : FdwRoutine *fdwroutine;
1059 : :
1060 : : /* Expect a fully-formed ResultRelInfo from InitResultRelInfo(). */
1061 [ + - ]: 11684 : Assert(resultRelInfo->ri_needLockTagTuple ==
1062 : : IsInplaceUpdateRelation(resultRel));
1063 : :
1064 [ + + + - : 11684 : switch (resultRel->rd_rel->relkind)
- - - ]
1065 : : {
1066 : : case RELKIND_RELATION:
1067 : : case RELKIND_PARTITIONED_TABLE:
1068 : :
1069 : : /*
1070 : : * For MERGE, check that the target relation supports each action.
1071 : : * For other operations, just check the operation itself.
1072 : : */
1073 [ + + ]: 11603 : if (operation == CMD_MERGE)
1074 [ + + + - : 950 : foreach_node(MergeAction, action, mergeActions)
+ + + + ]
1075 : 950 : CheckCmdReplicaIdentity(resultRel, action->commandType);
1076 : : else
1077 : 11346 : CheckCmdReplicaIdentity(resultRel, operation);
1078 : :
1079 : : /*
1080 : : * For INSERT ON CONFLICT DO UPDATE, additionally check that the
1081 : : * target relation supports UPDATE.
1082 : : */
1083 [ + + ]: 11603 : if (onConflictAction == ONCONFLICT_UPDATE)
1084 : 176 : CheckCmdReplicaIdentity(resultRel, CMD_UPDATE);
1085 : 11603 : break;
1086 : : case RELKIND_SEQUENCE:
1087 [ # # # # ]: 0 : ereport(ERROR,
1088 : : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1089 : : errmsg("cannot change sequence \"%s\"",
1090 : : RelationGetRelationName(resultRel))));
1091 : 0 : break;
1092 : : case RELKIND_TOASTVALUE:
1093 [ # # # # ]: 0 : ereport(ERROR,
1094 : : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1095 : : errmsg("cannot change TOAST relation \"%s\"",
1096 : : RelationGetRelationName(resultRel))));
1097 : 0 : break;
1098 : : case RELKIND_VIEW:
1099 : :
1100 : : /*
1101 : : * Okay only if there's a suitable INSTEAD OF trigger. Otherwise,
1102 : : * complain, but omit errdetail because we haven't got the
1103 : : * information handy (and given that it really shouldn't happen,
1104 : : * it's not worth great exertion to get).
1105 : : */
1106 [ + - ]: 67 : if (!view_has_instead_trigger(resultRel, operation, mergeActions))
1107 : 0 : error_view_not_updatable(resultRel, operation, mergeActions,
1108 : : NULL);
1109 : 67 : break;
1110 : : case RELKIND_MATVIEW:
1111 [ + - ]: 14 : if (!MatViewIncrementalMaintenanceIsEnabled())
1112 [ # # # # ]: 0 : ereport(ERROR,
1113 : : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1114 : : errmsg("cannot change materialized view \"%s\"",
1115 : : RelationGetRelationName(resultRel))));
1116 : 14 : break;
1117 : : case RELKIND_FOREIGN_TABLE:
1118 : : /* Okay only if the FDW supports it */
1119 : 0 : fdwroutine = resultRelInfo->ri_FdwRoutine;
1120 [ # # # # ]: 0 : switch (operation)
1121 : : {
1122 : : case CMD_INSERT:
1123 [ # # ]: 0 : if (fdwroutine->ExecForeignInsert == NULL)
1124 [ # # # # ]: 0 : ereport(ERROR,
1125 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1126 : : errmsg("cannot insert into foreign table \"%s\"",
1127 : : RelationGetRelationName(resultRel))));
1128 [ # # # # ]: 0 : if (fdwroutine->IsForeignRelUpdatable != NULL &&
1129 : 0 : (fdwroutine->IsForeignRelUpdatable(resultRel) & (1 << CMD_INSERT)) == 0)
1130 [ # # # # ]: 0 : ereport(ERROR,
1131 : : (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1132 : : errmsg("foreign table \"%s\" does not allow inserts",
1133 : : RelationGetRelationName(resultRel))));
1134 : 0 : break;
1135 : : case CMD_UPDATE:
1136 [ # # ]: 0 : if (fdwroutine->ExecForeignUpdate == NULL)
1137 [ # # # # ]: 0 : ereport(ERROR,
1138 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1139 : : errmsg("cannot update foreign table \"%s\"",
1140 : : RelationGetRelationName(resultRel))));
1141 [ # # # # ]: 0 : if (fdwroutine->IsForeignRelUpdatable != NULL &&
1142 : 0 : (fdwroutine->IsForeignRelUpdatable(resultRel) & (1 << CMD_UPDATE)) == 0)
1143 [ # # # # ]: 0 : ereport(ERROR,
1144 : : (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1145 : : errmsg("foreign table \"%s\" does not allow updates",
1146 : : RelationGetRelationName(resultRel))));
1147 : 0 : break;
1148 : : case CMD_DELETE:
1149 [ # # ]: 0 : if (fdwroutine->ExecForeignDelete == NULL)
1150 [ # # # # ]: 0 : ereport(ERROR,
1151 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1152 : : errmsg("cannot delete from foreign table \"%s\"",
1153 : : RelationGetRelationName(resultRel))));
1154 [ # # # # ]: 0 : if (fdwroutine->IsForeignRelUpdatable != NULL &&
1155 : 0 : (fdwroutine->IsForeignRelUpdatable(resultRel) & (1 << CMD_DELETE)) == 0)
1156 [ # # # # ]: 0 : ereport(ERROR,
1157 : : (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1158 : : errmsg("foreign table \"%s\" does not allow deletes",
1159 : : RelationGetRelationName(resultRel))));
1160 : 0 : break;
1161 : : default:
1162 [ # # # # ]: 0 : elog(ERROR, "unrecognized CmdType: %d", (int) operation);
1163 : 0 : break;
1164 : : }
1165 : 0 : break;
1166 : : default:
1167 [ # # # # ]: 0 : ereport(ERROR,
1168 : : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1169 : : errmsg("cannot change relation \"%s\"",
1170 : : RelationGetRelationName(resultRel))));
1171 : 0 : break;
1172 : : }
1173 : 11684 : }
1174 : :
1175 : : /*
1176 : : * Check that a proposed rowmark target relation is a legal target
1177 : : *
1178 : : * In most cases parser and/or planner should have noticed this already, but
1179 : : * they don't cover all cases.
1180 : : */
1181 : : static void
1182 : 401204 : CheckValidRowMarkRel(Relation rel, RowMarkType markType)
1183 : : {
1184 : 401204 : FdwRoutine *fdwroutine;
1185 : :
1186 [ + + - - : 401204 : switch (rel->rd_rel->relkind)
- - - ]
1187 : : {
1188 : : case RELKIND_RELATION:
1189 : : case RELKIND_PARTITIONED_TABLE:
1190 : : /* OK */
1191 : 401202 : break;
1192 : : case RELKIND_SEQUENCE:
1193 : : /* Must disallow this because we don't vacuum sequences */
1194 [ # # # # ]: 0 : ereport(ERROR,
1195 : : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1196 : : errmsg("cannot lock rows in sequence \"%s\"",
1197 : : RelationGetRelationName(rel))));
1198 : 0 : break;
1199 : : case RELKIND_TOASTVALUE:
1200 : : /* We could allow this, but there seems no good reason to */
1201 [ # # # # ]: 0 : ereport(ERROR,
1202 : : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1203 : : errmsg("cannot lock rows in TOAST relation \"%s\"",
1204 : : RelationGetRelationName(rel))));
1205 : 0 : break;
1206 : : case RELKIND_VIEW:
1207 : : /* Should not get here; planner should have expanded the view */
1208 [ # # # # ]: 0 : ereport(ERROR,
1209 : : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1210 : : errmsg("cannot lock rows in view \"%s\"",
1211 : : RelationGetRelationName(rel))));
1212 : 0 : break;
1213 : : case RELKIND_MATVIEW:
1214 : : /* Allow referencing a matview, but not actual locking clauses */
1215 [ + + ]: 2 : if (markType != ROW_MARK_REFERENCE)
1216 [ + - + - ]: 1 : ereport(ERROR,
1217 : : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1218 : : errmsg("cannot lock rows in materialized view \"%s\"",
1219 : : RelationGetRelationName(rel))));
1220 : 1 : break;
1221 : : case RELKIND_FOREIGN_TABLE:
1222 : : /* Okay only if the FDW supports it */
1223 : 0 : fdwroutine = GetFdwRoutineForRelation(rel, false);
1224 [ # # ]: 0 : if (fdwroutine->RefetchForeignRow == NULL)
1225 [ # # # # ]: 0 : ereport(ERROR,
1226 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1227 : : errmsg("cannot lock rows in foreign table \"%s\"",
1228 : : RelationGetRelationName(rel))));
1229 : 0 : break;
1230 : : default:
1231 [ # # # # ]: 0 : ereport(ERROR,
1232 : : (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1233 : : errmsg("cannot lock rows in relation \"%s\"",
1234 : : RelationGetRelationName(rel))));
1235 : 0 : break;
1236 : : }
1237 : 401203 : }
1238 : :
1239 : : /*
1240 : : * Initialize ResultRelInfo data for one result relation
1241 : : *
1242 : : * Caution: before Postgres 9.1, this function included the relkind checking
1243 : : * that's now in CheckValidResultRel, and it also did ExecOpenIndices if
1244 : : * appropriate. Be sure callers cover those needs.
1245 : : */
1246 : : void
1247 : 13001 : InitResultRelInfo(ResultRelInfo *resultRelInfo,
1248 : : Relation resultRelationDesc,
1249 : : Index resultRelationIndex,
1250 : : ResultRelInfo *partition_root_rri,
1251 : : int instrument_options)
1252 : : {
1253 [ + - + - : 663051 : MemSet(resultRelInfo, 0, sizeof(ResultRelInfo));
+ - - + +
+ ]
1254 : 13001 : resultRelInfo->type = T_ResultRelInfo;
1255 : 13001 : resultRelInfo->ri_RangeTableIndex = resultRelationIndex;
1256 : 13001 : resultRelInfo->ri_RelationDesc = resultRelationDesc;
1257 : 13001 : resultRelInfo->ri_NumIndices = 0;
1258 : 13001 : resultRelInfo->ri_IndexRelationDescs = NULL;
1259 : 13001 : resultRelInfo->ri_IndexRelationInfo = NULL;
1260 : 13001 : resultRelInfo->ri_needLockTagTuple =
1261 : 13001 : IsInplaceUpdateRelation(resultRelationDesc);
1262 : : /* make a copy so as not to depend on relcache info not changing... */
1263 : 13001 : resultRelInfo->ri_TrigDesc = CopyTriggerDesc(resultRelationDesc->trigdesc);
1264 [ + + ]: 13001 : if (resultRelInfo->ri_TrigDesc)
1265 : : {
1266 : 2544 : int n = resultRelInfo->ri_TrigDesc->numtriggers;
1267 : :
1268 : 2544 : resultRelInfo->ri_TrigFunctions = (FmgrInfo *)
1269 : 2544 : palloc0_array(FmgrInfo, n);
1270 : 2544 : resultRelInfo->ri_TrigWhenExprs = (ExprState **)
1271 : 2544 : palloc0_array(ExprState *, n);
1272 [ + - ]: 2544 : if (instrument_options)
1273 : 0 : resultRelInfo->ri_TrigInstrument = InstrAlloc(n, instrument_options, false);
1274 : 2544 : }
1275 : : else
1276 : : {
1277 : 10457 : resultRelInfo->ri_TrigFunctions = NULL;
1278 : 10457 : resultRelInfo->ri_TrigWhenExprs = NULL;
1279 : 10457 : resultRelInfo->ri_TrigInstrument = NULL;
1280 : : }
1281 [ - + ]: 13001 : if (resultRelationDesc->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
1282 : 0 : resultRelInfo->ri_FdwRoutine = GetFdwRoutineForRelation(resultRelationDesc, true);
1283 : : else
1284 : 13001 : resultRelInfo->ri_FdwRoutine = NULL;
1285 : :
1286 : : /* The following fields are set later if needed */
1287 : 13001 : resultRelInfo->ri_RowIdAttNo = 0;
1288 : 13001 : resultRelInfo->ri_extraUpdatedCols = NULL;
1289 : 13001 : resultRelInfo->ri_projectNew = NULL;
1290 : 13001 : resultRelInfo->ri_newTupleSlot = NULL;
1291 : 13001 : resultRelInfo->ri_oldTupleSlot = NULL;
1292 : 13001 : resultRelInfo->ri_projectNewInfoValid = false;
1293 : 13001 : resultRelInfo->ri_FdwState = NULL;
1294 : 13001 : resultRelInfo->ri_usesFdwDirectModify = false;
1295 : 13001 : resultRelInfo->ri_CheckConstraintExprs = NULL;
1296 : 13001 : resultRelInfo->ri_GenVirtualNotNullConstraintExprs = NULL;
1297 : 13001 : resultRelInfo->ri_GeneratedExprsI = NULL;
1298 : 13001 : resultRelInfo->ri_GeneratedExprsU = NULL;
1299 : 13001 : resultRelInfo->ri_projectReturning = NULL;
1300 : 13001 : resultRelInfo->ri_onConflictArbiterIndexes = NIL;
1301 : 13001 : resultRelInfo->ri_onConflict = NULL;
1302 : 13001 : resultRelInfo->ri_ReturningSlot = NULL;
1303 : 13001 : resultRelInfo->ri_TrigOldSlot = NULL;
1304 : 13001 : resultRelInfo->ri_TrigNewSlot = NULL;
1305 : 13001 : resultRelInfo->ri_AllNullSlot = NULL;
1306 : 13001 : resultRelInfo->ri_MergeActions[MERGE_WHEN_MATCHED] = NIL;
1307 : 13001 : resultRelInfo->ri_MergeActions[MERGE_WHEN_NOT_MATCHED_BY_SOURCE] = NIL;
1308 : 13001 : resultRelInfo->ri_MergeActions[MERGE_WHEN_NOT_MATCHED_BY_TARGET] = NIL;
1309 : 13001 : resultRelInfo->ri_MergeJoinCondition = NULL;
1310 : :
1311 : : /*
1312 : : * Only ExecInitPartitionInfo() and ExecInitPartitionDispatchInfo() pass
1313 : : * non-NULL partition_root_rri. For child relations that are part of the
1314 : : * initial query rather than being dynamically added by tuple routing,
1315 : : * this field is filled in ExecInitModifyTable().
1316 : : */
1317 : 13001 : resultRelInfo->ri_RootResultRelInfo = partition_root_rri;
1318 : : /* Set by ExecGetRootToChildMap */
1319 : 13001 : resultRelInfo->ri_RootToChildMap = NULL;
1320 : 13001 : resultRelInfo->ri_RootToChildMapValid = false;
1321 : : /* Set by ExecInitRoutingInfo */
1322 : 13001 : resultRelInfo->ri_PartitionTupleSlot = NULL;
1323 : 13001 : resultRelInfo->ri_ChildToRootMap = NULL;
1324 : 13001 : resultRelInfo->ri_ChildToRootMapValid = false;
1325 : 13001 : resultRelInfo->ri_CopyMultiInsertBuffer = NULL;
1326 : 13001 : }
1327 : :
1328 : : /*
1329 : : * ExecGetTriggerResultRel
1330 : : * Get a ResultRelInfo for a trigger target relation.
1331 : : *
1332 : : * Most of the time, triggers are fired on one of the result relations of the
1333 : : * query, and so we can just return a suitable one we already made and stored
1334 : : * in the es_opened_result_relations or es_tuple_routing_result_relations
1335 : : * Lists.
1336 : : *
1337 : : * However, it is sometimes necessary to fire triggers on other relations;
1338 : : * this happens mainly when an RI update trigger queues additional triggers
1339 : : * on other relations, which will be processed in the context of the outer
1340 : : * query. For efficiency's sake, we want to have a ResultRelInfo for those
1341 : : * triggers too; that can avoid repeated re-opening of the relation. (It
1342 : : * also provides a way for EXPLAIN ANALYZE to report the runtimes of such
1343 : : * triggers.) So we make additional ResultRelInfo's as needed, and save them
1344 : : * in es_trig_target_relations.
1345 : : */
1346 : : ResultRelInfo *
1347 : 1159 : ExecGetTriggerResultRel(EState *estate, Oid relid,
1348 : : ResultRelInfo *rootRelInfo)
1349 : : {
1350 : 1159 : ResultRelInfo *rInfo;
1351 : 1159 : ListCell *l;
1352 : 1159 : Relation rel;
1353 : 1159 : MemoryContext oldcontext;
1354 : :
1355 : : /*
1356 : : * Before creating a new ResultRelInfo, check if we've already made and
1357 : : * cached one for this relation. We must ensure that the given
1358 : : * 'rootRelInfo' matches the one stored in the cached ResultRelInfo as
1359 : : * trigger handling for partitions can result in mixed requirements for
1360 : : * what ri_RootResultRelInfo is set to.
1361 : : */
1362 : :
1363 : : /* Search through the query result relations */
1364 [ + + + + : 2473 : foreach(l, estate->es_opened_result_relations)
+ + + + ]
1365 : : {
1366 : 1314 : rInfo = lfirst(l);
1367 [ + + + + ]: 1314 : if (RelationGetRelid(rInfo->ri_RelationDesc) == relid &&
1368 : 923 : rInfo->ri_RootResultRelInfo == rootRelInfo)
1369 : 861 : return rInfo;
1370 : 453 : }
1371 : :
1372 : : /*
1373 : : * Search through the result relations that were created during tuple
1374 : : * routing, if any.
1375 : : */
1376 [ + + + + : 474 : foreach(l, estate->es_tuple_routing_result_relations)
+ + + + ]
1377 : : {
1378 : 176 : rInfo = (ResultRelInfo *) lfirst(l);
1379 [ + + + + ]: 176 : if (RelationGetRelid(rInfo->ri_RelationDesc) == relid &&
1380 : 114 : rInfo->ri_RootResultRelInfo == rootRelInfo)
1381 : 5 : return rInfo;
1382 : 171 : }
1383 : :
1384 : : /* Nope, but maybe we already made an extra ResultRelInfo for it */
1385 [ + + + + : 427 : foreach(l, estate->es_trig_target_relations)
+ + + + ]
1386 : : {
1387 : 134 : rInfo = (ResultRelInfo *) lfirst(l);
1388 [ + + + + ]: 134 : if (RelationGetRelid(rInfo->ri_RelationDesc) == relid &&
1389 : 6 : rInfo->ri_RootResultRelInfo == rootRelInfo)
1390 : 3 : return rInfo;
1391 : 131 : }
1392 : : /* Nope, so we need a new one */
1393 : :
1394 : : /*
1395 : : * Open the target relation's relcache entry. We assume that an
1396 : : * appropriate lock is still held by the backend from whenever the trigger
1397 : : * event got queued, so we need take no new lock here. Also, we need not
1398 : : * recheck the relkind, so no need for CheckValidResultRel.
1399 : : */
1400 : 290 : rel = table_open(relid, NoLock);
1401 : :
1402 : : /*
1403 : : * Make the new entry in the right context.
1404 : : */
1405 : 290 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
1406 : 290 : rInfo = makeNode(ResultRelInfo);
1407 : 580 : InitResultRelInfo(rInfo,
1408 : 290 : rel,
1409 : : 0, /* dummy rangetable index */
1410 : 290 : rootRelInfo,
1411 : 290 : estate->es_instrument);
1412 : 290 : estate->es_trig_target_relations =
1413 : 290 : lappend(estate->es_trig_target_relations, rInfo);
1414 : 290 : MemoryContextSwitchTo(oldcontext);
1415 : :
1416 : : /*
1417 : : * Currently, we don't need any index information in ResultRelInfos used
1418 : : * only for triggers, so no need to call ExecOpenIndices.
1419 : : */
1420 : :
1421 : 290 : return rInfo;
1422 : 1159 : }
1423 : :
1424 : : /*
1425 : : * Return the ancestor relations of a given leaf partition result relation
1426 : : * up to and including the query's root target relation.
1427 : : *
1428 : : * These work much like the ones opened by ExecGetTriggerResultRel, except
1429 : : * that we need to keep them in a separate list.
1430 : : *
1431 : : * These are closed by ExecCloseResultRelations.
1432 : : */
1433 : : List *
1434 : 49 : ExecGetAncestorResultRels(EState *estate, ResultRelInfo *resultRelInfo)
1435 : : {
1436 : 49 : ResultRelInfo *rootRelInfo = resultRelInfo->ri_RootResultRelInfo;
1437 : 49 : Relation partRel = resultRelInfo->ri_RelationDesc;
1438 : 49 : Oid rootRelOid;
1439 : :
1440 [ + - ]: 49 : if (!partRel->rd_rel->relispartition)
1441 [ # # # # ]: 0 : elog(ERROR, "cannot find ancestors of a non-partition result relation");
1442 [ + - ]: 49 : Assert(rootRelInfo != NULL);
1443 : 49 : rootRelOid = RelationGetRelid(rootRelInfo->ri_RelationDesc);
1444 [ + + ]: 49 : if (resultRelInfo->ri_ancestorResultRels == NIL)
1445 : : {
1446 : 38 : ListCell *lc;
1447 : 38 : List *oids = get_partition_ancestors(RelationGetRelid(partRel));
1448 : 38 : List *ancResultRels = NIL;
1449 : :
1450 [ + - - + : 87 : foreach(lc, oids)
+ - ]
1451 : : {
1452 : 49 : Oid ancOid = lfirst_oid(lc);
1453 : 49 : Relation ancRel;
1454 : 49 : ResultRelInfo *rInfo;
1455 : :
1456 : : /*
1457 : : * Ignore the root ancestor here, and use ri_RootResultRelInfo
1458 : : * (below) for it instead. Also, we stop climbing up the
1459 : : * hierarchy when we find the table that was mentioned in the
1460 : : * query.
1461 : : */
1462 [ + + ]: 49 : if (ancOid == rootRelOid)
1463 : 38 : break;
1464 : :
1465 : : /*
1466 : : * All ancestors up to the root target relation must have been
1467 : : * locked by the planner or AcquireExecutorLocks().
1468 : : */
1469 : 11 : ancRel = table_open(ancOid, NoLock);
1470 : 11 : rInfo = makeNode(ResultRelInfo);
1471 : :
1472 : : /* dummy rangetable index */
1473 : 22 : InitResultRelInfo(rInfo, ancRel, 0, NULL,
1474 : 11 : estate->es_instrument);
1475 : 11 : ancResultRels = lappend(ancResultRels, rInfo);
1476 [ + + ]: 49 : }
1477 : 38 : ancResultRels = lappend(ancResultRels, rootRelInfo);
1478 : 38 : resultRelInfo->ri_ancestorResultRels = ancResultRels;
1479 : 38 : }
1480 : :
1481 : : /* We must have found some ancestor */
1482 [ - + ]: 49 : Assert(resultRelInfo->ri_ancestorResultRels != NIL);
1483 : :
1484 : 98 : return resultRelInfo->ri_ancestorResultRels;
1485 : 49 : }
1486 : :
1487 : : /* ----------------------------------------------------------------
1488 : : * ExecPostprocessPlan
1489 : : *
1490 : : * Give plan nodes a final chance to execute before shutdown
1491 : : * ----------------------------------------------------------------
1492 : : */
1493 : : static void
1494 : 444558 : ExecPostprocessPlan(EState *estate)
1495 : : {
1496 : 444558 : ListCell *lc;
1497 : :
1498 : : /*
1499 : : * Make sure nodes run forward.
1500 : : */
1501 : 444558 : estate->es_direction = ForwardScanDirection;
1502 : :
1503 : : /*
1504 : : * Run any secondary ModifyTable nodes to completion, in case the main
1505 : : * query did not fetch all rows from them. (We do this to ensure that
1506 : : * such nodes have predictable results.)
1507 : : */
1508 [ + + + + : 444697 : foreach(lc, estate->es_auxmodifytables)
+ + ]
1509 : : {
1510 : 139 : PlanState *ps = (PlanState *) lfirst(lc);
1511 : :
1512 : 164 : for (;;)
1513 : : {
1514 : 164 : TupleTableSlot *slot;
1515 : :
1516 : : /* Reset the per-output-tuple exprcontext each time */
1517 [ + + ]: 164 : ResetPerTupleExprContext(estate);
1518 : :
1519 : 164 : slot = ExecProcNode(ps);
1520 : :
1521 [ + + - + ]: 164 : if (TupIsNull(slot))
1522 : 139 : break;
1523 [ - + + ]: 164 : }
1524 : 139 : }
1525 : 444558 : }
1526 : :
1527 : : /* ----------------------------------------------------------------
1528 : : * ExecEndPlan
1529 : : *
1530 : : * Cleans up the query plan -- closes files and frees up storage
1531 : : *
1532 : : * NOTE: we are no longer very worried about freeing storage per se
1533 : : * in this code; FreeExecutorState should be guaranteed to release all
1534 : : * memory that needs to be released. What we are worried about doing
1535 : : * is closing relations and dropping buffer pins. Thus, for example,
1536 : : * tuple tables must be cleared or dropped to ensure pins are released.
1537 : : * ----------------------------------------------------------------
1538 : : */
1539 : : static void
1540 : 447452 : ExecEndPlan(PlanState *planstate, EState *estate)
1541 : : {
1542 : 447452 : ListCell *l;
1543 : :
1544 : : /*
1545 : : * shut down the node-type-specific query processing
1546 : : */
1547 : 447452 : ExecEndNode(planstate);
1548 : :
1549 : : /*
1550 : : * for subplans too
1551 : : */
1552 [ + + + + : 451961 : foreach(l, estate->es_subplanstates)
+ + ]
1553 : : {
1554 : 4509 : PlanState *subplanstate = (PlanState *) lfirst(l);
1555 : :
1556 : 4509 : ExecEndNode(subplanstate);
1557 : 4509 : }
1558 : :
1559 : : /*
1560 : : * destroy the executor's tuple table. Actually we only care about
1561 : : * releasing buffer pins and tupdesc refcounts; there's no need to pfree
1562 : : * the TupleTableSlots, since the containing memory context is about to go
1563 : : * away anyway.
1564 : : */
1565 : 447452 : ExecResetTupleTable(estate->es_tupleTable, false);
1566 : :
1567 : : /*
1568 : : * Close any Relations that have been opened for range table entries or
1569 : : * result relations.
1570 : : */
1571 : 447452 : ExecCloseResultRelations(estate);
1572 : 447452 : ExecCloseRangeTableRelations(estate);
1573 : 447452 : }
1574 : :
1575 : : /*
1576 : : * Close any relations that have been opened for ResultRelInfos.
1577 : : */
1578 : : void
1579 : 447619 : ExecCloseResultRelations(EState *estate)
1580 : : {
1581 : 447619 : ListCell *l;
1582 : :
1583 : : /*
1584 : : * close indexes of result relation(s) if any. (Rels themselves are
1585 : : * closed in ExecCloseRangeTableRelations())
1586 : : *
1587 : : * In addition, close the stub RTs that may be in each resultrel's
1588 : : * ri_ancestorResultRels.
1589 : : */
1590 [ + + + + : 457841 : foreach(l, estate->es_opened_result_relations)
+ + ]
1591 : : {
1592 : 10222 : ResultRelInfo *resultRelInfo = lfirst(l);
1593 : 10222 : ListCell *lc;
1594 : :
1595 : 10222 : ExecCloseIndices(resultRelInfo);
1596 [ + + + + : 10263 : foreach(lc, resultRelInfo->ri_ancestorResultRels)
+ + ]
1597 : : {
1598 : 41 : ResultRelInfo *rInfo = lfirst(lc);
1599 : :
1600 : : /*
1601 : : * Ancestors with RTI > 0 (should only be the root ancestor) are
1602 : : * closed by ExecCloseRangeTableRelations.
1603 : : */
1604 [ + + ]: 41 : if (rInfo->ri_RangeTableIndex > 0)
1605 : 33 : continue;
1606 : :
1607 : 8 : table_close(rInfo->ri_RelationDesc, NoLock);
1608 [ - + + ]: 41 : }
1609 : 10222 : }
1610 : :
1611 : : /* Close any relations that have been opened by ExecGetTriggerResultRel(). */
1612 [ + + + + : 447822 : foreach(l, estate->es_trig_target_relations)
+ + ]
1613 : : {
1614 : 203 : ResultRelInfo *resultRelInfo = (ResultRelInfo *) lfirst(l);
1615 : :
1616 : : /*
1617 : : * Assert this is a "dummy" ResultRelInfo, see above. Otherwise we
1618 : : * might be issuing a duplicate close against a Relation opened by
1619 : : * ExecGetRangeTableRelation.
1620 : : */
1621 [ + - ]: 203 : Assert(resultRelInfo->ri_RangeTableIndex == 0);
1622 : :
1623 : : /*
1624 : : * Since ExecGetTriggerResultRel doesn't call ExecOpenIndices for
1625 : : * these rels, we needn't call ExecCloseIndices either.
1626 : : */
1627 [ + - ]: 203 : Assert(resultRelInfo->ri_NumIndices == 0);
1628 : :
1629 : 203 : table_close(resultRelInfo->ri_RelationDesc, NoLock);
1630 : 203 : }
1631 : 447619 : }
1632 : :
1633 : : /*
1634 : : * Close all relations opened by ExecGetRangeTableRelation().
1635 : : *
1636 : : * We do not release any locks we might hold on those rels.
1637 : : */
1638 : : void
1639 : 447593 : ExecCloseRangeTableRelations(EState *estate)
1640 : : {
1641 : 447593 : int i;
1642 : :
1643 [ + + ]: 949549 : for (i = 0; i < estate->es_range_table_size; i++)
1644 : : {
1645 [ + + ]: 501956 : if (estate->es_relations[i])
1646 : 452820 : table_close(estate->es_relations[i], NoLock);
1647 : 501956 : }
1648 : 447593 : }
1649 : :
1650 : : /* ----------------------------------------------------------------
1651 : : * ExecutePlan
1652 : : *
1653 : : * Processes the query plan until we have retrieved 'numberTuples' tuples,
1654 : : * moving in the specified direction.
1655 : : *
1656 : : * Runs to completion if numberTuples is 0
1657 : : * ----------------------------------------------------------------
1658 : : */
1659 : : static void
1660 : 455449 : ExecutePlan(QueryDesc *queryDesc,
1661 : : CmdType operation,
1662 : : bool sendTuples,
1663 : : uint64 numberTuples,
1664 : : ScanDirection direction,
1665 : : DestReceiver *dest)
1666 : : {
1667 : 455449 : EState *estate = queryDesc->estate;
1668 : 455449 : PlanState *planstate = queryDesc->planstate;
1669 : 455449 : bool use_parallel_mode;
1670 : 455449 : TupleTableSlot *slot;
1671 : 455449 : uint64 current_tuple_count;
1672 : :
1673 : : /*
1674 : : * initialize local variables
1675 : : */
1676 : 455449 : current_tuple_count = 0;
1677 : :
1678 : : /*
1679 : : * Set the direction.
1680 : : */
1681 : 455449 : estate->es_direction = direction;
1682 : :
1683 : : /*
1684 : : * Set up parallel mode if appropriate.
1685 : : *
1686 : : * Parallel mode only supports complete execution of a plan. If we've
1687 : : * already partially executed it, or if the caller asks us to exit early,
1688 : : * we must force the plan to run without parallelism.
1689 : : */
1690 [ + + + + ]: 455449 : if (queryDesc->already_executed || numberTuples != 0)
1691 : 415607 : use_parallel_mode = false;
1692 : : else
1693 : 39842 : use_parallel_mode = queryDesc->plannedstmt->parallelModeNeeded;
1694 : 446357 : queryDesc->already_executed = true;
1695 : :
1696 : 446357 : estate->es_use_parallel_mode = use_parallel_mode;
1697 [ + + ]: 446357 : if (use_parallel_mode)
1698 : 117 : EnterParallelMode();
1699 : :
1700 : : /*
1701 : : * Loop until we've processed the proper number of tuples from the plan.
1702 : : */
1703 : 1322734 : for (;;)
1704 : : {
1705 : : /* Reset the per-output-tuple exprcontext */
1706 [ + + ]: 1322734 : ResetPerTupleExprContext(estate);
1707 : :
1708 : : /*
1709 : : * Execute the plan and obtain a tuple
1710 : : */
1711 : 1322734 : slot = ExecProcNode(planstate);
1712 : :
1713 : : /*
1714 : : * if the tuple is null, then we assume there is nothing more to
1715 : : * process so we just end the loop...
1716 : : */
1717 [ + + + + ]: 1322734 : if (TupIsNull(slot))
1718 : 40683 : break;
1719 : :
1720 : : /*
1721 : : * If we have a junk filter, then project a new tuple with the junk
1722 : : * removed.
1723 : : *
1724 : : * Store this new "clean" tuple in the junkfilter's resultSlot.
1725 : : * (Formerly, we stored it back over the "dirty" tuple, which is WRONG
1726 : : * because that tuple slot has the wrong descriptor.)
1727 : : */
1728 [ + + ]: 1282051 : if (estate->es_junkFilter != NULL)
1729 : 438618 : slot = ExecFilterJunk(estate->es_junkFilter, slot);
1730 : :
1731 : : /*
1732 : : * If we are supposed to send the tuple somewhere, do so. (In
1733 : : * practice, this is probably always the case at this point.)
1734 : : */
1735 [ - + ]: 1282051 : if (sendTuples)
1736 : : {
1737 : : /*
1738 : : * If we are not able to send the tuple, we assume the destination
1739 : : * has closed and no more tuples can be sent. If that's the case,
1740 : : * end the loop.
1741 : : */
1742 [ + - ]: 1282051 : if (!dest->receiveSlot(slot, dest))
1743 : 0 : break;
1744 : 1282051 : }
1745 : :
1746 : : /*
1747 : : * Count tuples processed, if this is a SELECT. (For other operation
1748 : : * types, the ModifyTable plan node must count the appropriate
1749 : : * events.)
1750 : : */
1751 [ + + ]: 1282051 : if (operation == CMD_SELECT)
1752 : 1281456 : (estate->es_processed)++;
1753 : :
1754 : : /*
1755 : : * check our tuple count.. if we've processed the proper number then
1756 : : * quit, else loop again and process more tuples. Zero numberTuples
1757 : : * means no limit.
1758 : : */
1759 : 1282051 : current_tuple_count++;
1760 [ + + + + ]: 1282051 : if (numberTuples && numberTuples == current_tuple_count)
1761 : 405674 : break;
1762 : : }
1763 : :
1764 : : /*
1765 : : * If we know we won't need to back up, we can release resources at this
1766 : : * point.
1767 : : */
1768 [ + + ]: 446357 : if (!(estate->es_top_eflags & EXEC_FLAG_BACKWARD))
1769 : 445621 : ExecShutdownNode(planstate);
1770 : :
1771 [ + + ]: 446357 : if (use_parallel_mode)
1772 : 115 : ExitParallelMode();
1773 : 446357 : }
1774 : :
1775 : :
1776 : : /*
1777 : : * ExecRelCheck --- check that tuple meets check constraints for result relation
1778 : : *
1779 : : * Returns NULL if OK, else name of failed check constraint
1780 : : */
1781 : : static const char *
1782 : 354 : ExecRelCheck(ResultRelInfo *resultRelInfo,
1783 : : TupleTableSlot *slot, EState *estate)
1784 : : {
1785 : 354 : Relation rel = resultRelInfo->ri_RelationDesc;
1786 : 354 : int ncheck = rel->rd_att->constr->num_check;
1787 : 354 : ConstrCheck *check = rel->rd_att->constr->check;
1788 : 354 : ExprContext *econtext;
1789 : 354 : MemoryContext oldContext;
1790 : :
1791 : : /*
1792 : : * CheckNNConstraintFetch let this pass with only a warning, but now we
1793 : : * should fail rather than possibly failing to enforce an important
1794 : : * constraint.
1795 : : */
1796 [ + - ]: 354 : if (ncheck != rel->rd_rel->relchecks)
1797 [ # # # # ]: 0 : elog(ERROR, "%d pg_constraint record(s) missing for relation \"%s\"",
1798 : : rel->rd_rel->relchecks - ncheck, RelationGetRelationName(rel));
1799 : :
1800 : : /*
1801 : : * If first time through for this result relation, build expression
1802 : : * nodetrees for rel's constraint expressions. Keep them in the per-query
1803 : : * memory context so they'll survive throughout the query.
1804 : : */
1805 [ + + ]: 354 : if (resultRelInfo->ri_CheckConstraintExprs == NULL)
1806 : : {
1807 : 214 : oldContext = MemoryContextSwitchTo(estate->es_query_cxt);
1808 : 214 : resultRelInfo->ri_CheckConstraintExprs = palloc0_array(ExprState *, ncheck);
1809 [ + + ]: 559 : for (int i = 0; i < ncheck; i++)
1810 : : {
1811 : 345 : Expr *checkconstr;
1812 : :
1813 : : /* Skip not enforced constraint */
1814 [ + + ]: 345 : if (!check[i].ccenforced)
1815 : 40 : continue;
1816 : :
1817 : 305 : checkconstr = stringToNode(check[i].ccbin);
1818 : 305 : checkconstr = (Expr *) expand_generated_columns_in_expr((Node *) checkconstr, rel, 1);
1819 : 305 : resultRelInfo->ri_CheckConstraintExprs[i] =
1820 : 305 : ExecPrepareExpr(checkconstr, estate);
1821 [ - + + ]: 345 : }
1822 : 214 : MemoryContextSwitchTo(oldContext);
1823 : 214 : }
1824 : :
1825 : : /*
1826 : : * We will use the EState's per-tuple context for evaluating constraint
1827 : : * expressions (creating it if it's not already there).
1828 : : */
1829 [ + + ]: 354 : econtext = GetPerTupleExprContext(estate);
1830 : :
1831 : : /* Arrange for econtext's scan tuple to be the tuple under test */
1832 : 354 : econtext->ecxt_scantuple = slot;
1833 : :
1834 : : /* And evaluate the constraints */
1835 [ + + + + ]: 911 : for (int i = 0; i < ncheck; i++)
1836 : : {
1837 : 557 : ExprState *checkconstr = resultRelInfo->ri_CheckConstraintExprs[i];
1838 : :
1839 : : /*
1840 : : * NOTE: SQL specifies that a NULL result from a constraint expression
1841 : : * is not to be treated as a failure. Therefore, use ExecCheck not
1842 : : * ExecQual.
1843 : : */
1844 [ + + + + ]: 557 : if (checkconstr && !ExecCheck(checkconstr, econtext))
1845 : 74 : return check[i].ccname;
1846 [ + + ]: 557 : }
1847 : :
1848 : : /* NULL result means no error */
1849 : 280 : return NULL;
1850 : 354 : }
1851 : :
1852 : : /*
1853 : : * ExecPartitionCheck --- check that tuple meets the partition constraint.
1854 : : *
1855 : : * Returns true if it meets the partition constraint. If the constraint
1856 : : * fails and we're asked to emit an error, do so and don't return; otherwise
1857 : : * return false.
1858 : : */
1859 : : bool
1860 : 1709 : ExecPartitionCheck(ResultRelInfo *resultRelInfo, TupleTableSlot *slot,
1861 : : EState *estate, bool emitError)
1862 : : {
1863 : 1709 : ExprContext *econtext;
1864 : 1709 : bool success;
1865 : :
1866 : : /*
1867 : : * If first time through, build expression state tree for the partition
1868 : : * check expression. (In the corner case where the partition check
1869 : : * expression is empty, ie there's a default partition and nothing else,
1870 : : * we'll be fooled into executing this code each time through. But it's
1871 : : * pretty darn cheap in that case, so we don't worry about it.)
1872 : : */
1873 [ + + ]: 1709 : if (resultRelInfo->ri_PartitionCheckExpr == NULL)
1874 : : {
1875 : : /*
1876 : : * Ensure that the qual tree and prepared expression are in the
1877 : : * query-lifespan context.
1878 : : */
1879 : 498 : MemoryContext oldcxt = MemoryContextSwitchTo(estate->es_query_cxt);
1880 : 498 : List *qual = RelationGetPartitionQual(resultRelInfo->ri_RelationDesc);
1881 : :
1882 : 498 : resultRelInfo->ri_PartitionCheckExpr = ExecPrepareCheck(qual, estate);
1883 : 498 : MemoryContextSwitchTo(oldcxt);
1884 : 498 : }
1885 : :
1886 : : /*
1887 : : * We will use the EState's per-tuple context for evaluating constraint
1888 : : * expressions (creating it if it's not already there).
1889 : : */
1890 [ + + ]: 1709 : econtext = GetPerTupleExprContext(estate);
1891 : :
1892 : : /* Arrange for econtext's scan tuple to be the tuple under test */
1893 : 1709 : econtext->ecxt_scantuple = slot;
1894 : :
1895 : : /*
1896 : : * As in case of the cataloged constraints, we treat a NULL result as
1897 : : * success here, not a failure.
1898 : : */
1899 : 1709 : success = ExecCheck(resultRelInfo->ri_PartitionCheckExpr, econtext);
1900 : :
1901 : : /* if asked to emit error, don't actually return on failure */
1902 [ + + + + ]: 1709 : if (!success && emitError)
1903 : 33 : ExecPartitionCheckEmitError(resultRelInfo, slot, estate);
1904 : :
1905 : 3418 : return success;
1906 : 1709 : }
1907 : :
1908 : : /*
1909 : : * ExecPartitionCheckEmitError - Form and emit an error message after a failed
1910 : : * partition constraint check.
1911 : : */
1912 : : void
1913 : 41 : ExecPartitionCheckEmitError(ResultRelInfo *resultRelInfo,
1914 : : TupleTableSlot *slot,
1915 : : EState *estate)
1916 : : {
1917 : 41 : Oid root_relid;
1918 : 41 : TupleDesc tupdesc;
1919 : 41 : char *val_desc;
1920 : 41 : Bitmapset *modifiedCols;
1921 : :
1922 : : /*
1923 : : * If the tuple has been routed, it's been converted to the partition's
1924 : : * rowtype, which might differ from the root table's. We must convert it
1925 : : * back to the root table's rowtype so that val_desc in the error message
1926 : : * matches the input tuple.
1927 : : */
1928 [ + + ]: 41 : if (resultRelInfo->ri_RootResultRelInfo)
1929 : : {
1930 : 3 : ResultRelInfo *rootrel = resultRelInfo->ri_RootResultRelInfo;
1931 : 3 : TupleDesc old_tupdesc;
1932 : 3 : AttrMap *map;
1933 : :
1934 : 3 : root_relid = RelationGetRelid(rootrel->ri_RelationDesc);
1935 : 3 : tupdesc = RelationGetDescr(rootrel->ri_RelationDesc);
1936 : :
1937 : 3 : old_tupdesc = RelationGetDescr(resultRelInfo->ri_RelationDesc);
1938 : : /* a reverse map */
1939 : 3 : map = build_attrmap_by_name_if_req(old_tupdesc, tupdesc, false);
1940 : :
1941 : : /*
1942 : : * Partition-specific slot's tupdesc can't be changed, so allocate a
1943 : : * new one.
1944 : : */
1945 [ + + ]: 3 : if (map != NULL)
1946 : 2 : slot = execute_attr_map_slot(map, slot,
1947 : 1 : MakeTupleTableSlot(tupdesc, &TTSOpsVirtual));
1948 : 6 : modifiedCols = bms_union(ExecGetInsertedCols(rootrel, estate),
1949 : 3 : ExecGetUpdatedCols(rootrel, estate));
1950 : 3 : }
1951 : : else
1952 : : {
1953 : 38 : root_relid = RelationGetRelid(resultRelInfo->ri_RelationDesc);
1954 : 38 : tupdesc = RelationGetDescr(resultRelInfo->ri_RelationDesc);
1955 : 76 : modifiedCols = bms_union(ExecGetInsertedCols(resultRelInfo, estate),
1956 : 38 : ExecGetUpdatedCols(resultRelInfo, estate));
1957 : : }
1958 : :
1959 : 82 : val_desc = ExecBuildSlotValueDescription(root_relid,
1960 : 41 : slot,
1961 : 41 : tupdesc,
1962 : 41 : modifiedCols,
1963 : : 64);
1964 [ - + + - : 41 : ereport(ERROR,
+ - ]
1965 : : (errcode(ERRCODE_CHECK_VIOLATION),
1966 : : errmsg("new row for relation \"%s\" violates partition constraint",
1967 : : RelationGetRelationName(resultRelInfo->ri_RelationDesc)),
1968 : : val_desc ? errdetail("Failing row contains %s.", val_desc) : 0,
1969 : : errtable(resultRelInfo->ri_RelationDesc)));
1970 : 0 : }
1971 : :
1972 : : /*
1973 : : * ExecConstraints - check constraints of the tuple in 'slot'
1974 : : *
1975 : : * This checks the traditional NOT NULL and check constraints.
1976 : : *
1977 : : * The partition constraint is *NOT* checked.
1978 : : *
1979 : : * Note: 'slot' contains the tuple to check the constraints of, which may
1980 : : * have been converted from the original input tuple after tuple routing.
1981 : : * 'resultRelInfo' is the final result relation, after tuple routing.
1982 : : */
1983 : : void
1984 : 492300 : ExecConstraints(ResultRelInfo *resultRelInfo,
1985 : : TupleTableSlot *slot, EState *estate)
1986 : : {
1987 : 492300 : Relation rel = resultRelInfo->ri_RelationDesc;
1988 : 492300 : TupleDesc tupdesc = RelationGetDescr(rel);
1989 : 492300 : TupleConstr *constr = tupdesc->constr;
1990 : 492300 : Bitmapset *modifiedCols;
1991 : 492300 : List *notnull_virtual_attrs = NIL;
1992 : :
1993 [ + - ]: 492300 : Assert(constr); /* we should not be called otherwise */
1994 : :
1995 : : /*
1996 : : * Verify not-null constraints.
1997 : : *
1998 : : * Not-null constraints on virtual generated columns are collected and
1999 : : * checked separately below.
2000 : : */
2001 [ + + ]: 492300 : if (constr->has_not_null)
2002 : : {
2003 [ + + ]: 1698538 : for (AttrNumber attnum = 1; attnum <= tupdesc->natts; attnum++)
2004 : : {
2005 : 1206848 : Form_pg_attribute att = TupleDescAttr(tupdesc, attnum - 1);
2006 : :
2007 [ + + + + ]: 1206848 : if (att->attnotnull && att->attgenerated == ATTRIBUTE_GENERATED_VIRTUAL)
2008 : 15 : notnull_virtual_attrs = lappend_int(notnull_virtual_attrs, attnum);
2009 [ + + + + ]: 1206833 : else if (att->attnotnull && slot_attisnull(slot, attnum))
2010 : 52 : ReportNotNullViolationError(resultRelInfo, slot, estate, attnum);
2011 : 1206848 : }
2012 : 491690 : }
2013 : :
2014 : : /*
2015 : : * Verify not-null constraints on virtual generated column, if any.
2016 : : */
2017 [ + + ]: 492300 : if (notnull_virtual_attrs)
2018 : : {
2019 : 15 : AttrNumber attnum;
2020 : :
2021 : 30 : attnum = ExecRelGenVirtualNotNull(resultRelInfo, slot, estate,
2022 : 15 : notnull_virtual_attrs);
2023 [ + + ]: 15 : if (attnum != InvalidAttrNumber)
2024 : 7 : ReportNotNullViolationError(resultRelInfo, slot, estate, attnum);
2025 : 15 : }
2026 : :
2027 : : /*
2028 : : * Verify check constraints.
2029 : : */
2030 [ + + ]: 492300 : if (rel->rd_rel->relchecks > 0)
2031 : : {
2032 : 354 : const char *failed;
2033 : :
2034 [ + + ]: 354 : if ((failed = ExecRelCheck(resultRelInfo, slot, estate)) != NULL)
2035 : : {
2036 : 74 : char *val_desc;
2037 : 74 : Relation orig_rel = rel;
2038 : :
2039 : : /*
2040 : : * If the tuple has been routed, it's been converted to the
2041 : : * partition's rowtype, which might differ from the root table's.
2042 : : * We must convert it back to the root table's rowtype so that
2043 : : * val_desc shown error message matches the input tuple.
2044 : : */
2045 [ + + ]: 74 : if (resultRelInfo->ri_RootResultRelInfo)
2046 : : {
2047 : 17 : ResultRelInfo *rootrel = resultRelInfo->ri_RootResultRelInfo;
2048 : 17 : TupleDesc old_tupdesc = RelationGetDescr(rel);
2049 : 17 : AttrMap *map;
2050 : :
2051 : 17 : tupdesc = RelationGetDescr(rootrel->ri_RelationDesc);
2052 : : /* a reverse map */
2053 : 34 : map = build_attrmap_by_name_if_req(old_tupdesc,
2054 : 17 : tupdesc,
2055 : : false);
2056 : :
2057 : : /*
2058 : : * Partition-specific slot's tupdesc can't be changed, so
2059 : : * allocate a new one.
2060 : : */
2061 [ + + ]: 17 : if (map != NULL)
2062 : 20 : slot = execute_attr_map_slot(map, slot,
2063 : 10 : MakeTupleTableSlot(tupdesc, &TTSOpsVirtual));
2064 : 34 : modifiedCols = bms_union(ExecGetInsertedCols(rootrel, estate),
2065 : 17 : ExecGetUpdatedCols(rootrel, estate));
2066 : 17 : rel = rootrel->ri_RelationDesc;
2067 : 17 : }
2068 : : else
2069 : 114 : modifiedCols = bms_union(ExecGetInsertedCols(resultRelInfo, estate),
2070 : 57 : ExecGetUpdatedCols(resultRelInfo, estate));
2071 : 148 : val_desc = ExecBuildSlotValueDescription(RelationGetRelid(rel),
2072 : 74 : slot,
2073 : 74 : tupdesc,
2074 : 74 : modifiedCols,
2075 : : 64);
2076 [ - + + - : 74 : ereport(ERROR,
+ - ]
2077 : : (errcode(ERRCODE_CHECK_VIOLATION),
2078 : : errmsg("new row for relation \"%s\" violates check constraint \"%s\"",
2079 : : RelationGetRelationName(orig_rel), failed),
2080 : : val_desc ? errdetail("Failing row contains %s.", val_desc) : 0,
2081 : : errtableconstraint(orig_rel, failed)));
2082 : 0 : }
2083 : 280 : }
2084 : 492226 : }
2085 : :
2086 : : /*
2087 : : * Verify not-null constraints on virtual generated columns of the given
2088 : : * tuple slot.
2089 : : *
2090 : : * Return value of InvalidAttrNumber means all not-null constraints on virtual
2091 : : * generated columns are satisfied. A return value > 0 means a not-null
2092 : : * violation happened for that attribute.
2093 : : *
2094 : : * notnull_virtual_attrs is the list of the attnums of virtual generated column with
2095 : : * not-null constraints.
2096 : : */
2097 : : AttrNumber
2098 : 29 : ExecRelGenVirtualNotNull(ResultRelInfo *resultRelInfo, TupleTableSlot *slot,
2099 : : EState *estate, List *notnull_virtual_attrs)
2100 : : {
2101 : 29 : Relation rel = resultRelInfo->ri_RelationDesc;
2102 : 29 : ExprContext *econtext;
2103 : 29 : MemoryContext oldContext;
2104 : :
2105 : : /*
2106 : : * We implement this by building a NullTest node for each virtual
2107 : : * generated column, which we cache in resultRelInfo, and running those
2108 : : * through ExecCheck().
2109 : : */
2110 [ + + ]: 29 : if (resultRelInfo->ri_GenVirtualNotNullConstraintExprs == NULL)
2111 : : {
2112 : 21 : oldContext = MemoryContextSwitchTo(estate->es_query_cxt);
2113 : 21 : resultRelInfo->ri_GenVirtualNotNullConstraintExprs =
2114 : 21 : palloc0_array(ExprState *, list_length(notnull_virtual_attrs));
2115 : :
2116 [ + + + - : 68 : foreach_int(attnum, notnull_virtual_attrs)
+ + + + ]
2117 : : {
2118 : 26 : int i = foreach_current_index(attnum);
2119 : 26 : NullTest *nnulltest;
2120 : :
2121 : : /* "generated_expression IS NOT NULL" check. */
2122 : 26 : nnulltest = makeNode(NullTest);
2123 : 26 : nnulltest->arg = (Expr *) build_generation_expression(rel, attnum);
2124 : 26 : nnulltest->nulltesttype = IS_NOT_NULL;
2125 : 26 : nnulltest->argisrow = false;
2126 : 26 : nnulltest->location = -1;
2127 : :
2128 : 26 : resultRelInfo->ri_GenVirtualNotNullConstraintExprs[i] =
2129 : 26 : ExecPrepareExpr((Expr *) nnulltest, estate);
2130 : 47 : }
2131 : 21 : MemoryContextSwitchTo(oldContext);
2132 : 21 : }
2133 : :
2134 : : /*
2135 : : * We will use the EState's per-tuple context for evaluating virtual
2136 : : * generated column not null constraint expressions (creating it if it's
2137 : : * not already there).
2138 : : */
2139 [ + + ]: 29 : econtext = GetPerTupleExprContext(estate);
2140 : :
2141 : : /* Arrange for econtext's scan tuple to be the tuple under test */
2142 : 29 : econtext->ecxt_scantuple = slot;
2143 : :
2144 : : /* And evaluate the check constraints for virtual generated column */
2145 [ + + + - : 84 : foreach_int(attnum, notnull_virtual_attrs)
+ + + + +
+ + + ]
2146 : : {
2147 : 38 : int i = foreach_current_index(attnum);
2148 : 38 : ExprState *exprstate = resultRelInfo->ri_GenVirtualNotNullConstraintExprs[i];
2149 : :
2150 [ + - ]: 38 : Assert(exprstate != NULL);
2151 [ + + ]: 38 : if (!ExecCheck(exprstate, econtext))
2152 : 12 : return attnum;
2153 [ + + ]: 55 : }
2154 : :
2155 : : /* InvalidAttrNumber result means no error */
2156 : 17 : return InvalidAttrNumber;
2157 : 29 : }
2158 : :
2159 : : /*
2160 : : * Report a violation of a not-null constraint that was already detected.
2161 : : */
2162 : : static void
2163 : 59 : ReportNotNullViolationError(ResultRelInfo *resultRelInfo, TupleTableSlot *slot,
2164 : : EState *estate, int attnum)
2165 : : {
2166 : 59 : Bitmapset *modifiedCols;
2167 : 59 : char *val_desc;
2168 : 59 : Relation rel = resultRelInfo->ri_RelationDesc;
2169 : 59 : Relation orig_rel = rel;
2170 : 59 : TupleDesc tupdesc = RelationGetDescr(rel);
2171 : 59 : TupleDesc orig_tupdesc = RelationGetDescr(rel);
2172 : 59 : Form_pg_attribute att = TupleDescAttr(tupdesc, attnum - 1);
2173 : :
2174 [ + - ]: 59 : Assert(attnum > 0);
2175 : :
2176 : : /*
2177 : : * If the tuple has been routed, it's been converted to the partition's
2178 : : * rowtype, which might differ from the root table's. We must convert it
2179 : : * back to the root table's rowtype so that val_desc shown error message
2180 : : * matches the input tuple.
2181 : : */
2182 [ + + ]: 59 : if (resultRelInfo->ri_RootResultRelInfo)
2183 : : {
2184 : 12 : ResultRelInfo *rootrel = resultRelInfo->ri_RootResultRelInfo;
2185 : 12 : AttrMap *map;
2186 : :
2187 : 12 : tupdesc = RelationGetDescr(rootrel->ri_RelationDesc);
2188 : : /* a reverse map */
2189 : 24 : map = build_attrmap_by_name_if_req(orig_tupdesc,
2190 : 12 : tupdesc,
2191 : : false);
2192 : :
2193 : : /*
2194 : : * Partition-specific slot's tupdesc can't be changed, so allocate a
2195 : : * new one.
2196 : : */
2197 [ + + ]: 12 : if (map != NULL)
2198 : 14 : slot = execute_attr_map_slot(map, slot,
2199 : 7 : MakeTupleTableSlot(tupdesc, &TTSOpsVirtual));
2200 : 24 : modifiedCols = bms_union(ExecGetInsertedCols(rootrel, estate),
2201 : 12 : ExecGetUpdatedCols(rootrel, estate));
2202 : 12 : rel = rootrel->ri_RelationDesc;
2203 : 12 : }
2204 : : else
2205 : 94 : modifiedCols = bms_union(ExecGetInsertedCols(resultRelInfo, estate),
2206 : 47 : ExecGetUpdatedCols(resultRelInfo, estate));
2207 : :
2208 : 118 : val_desc = ExecBuildSlotValueDescription(RelationGetRelid(rel),
2209 : 59 : slot,
2210 : 59 : tupdesc,
2211 : 59 : modifiedCols,
2212 : : 64);
2213 [ - + + - : 59 : ereport(ERROR,
+ - ]
2214 : : errcode(ERRCODE_NOT_NULL_VIOLATION),
2215 : : errmsg("null value in column \"%s\" of relation \"%s\" violates not-null constraint",
2216 : : NameStr(att->attname),
2217 : : RelationGetRelationName(orig_rel)),
2218 : : val_desc ? errdetail("Failing row contains %s.", val_desc) : 0,
2219 : : errtablecol(orig_rel, attnum));
2220 : 0 : }
2221 : :
2222 : : /*
2223 : : * ExecWithCheckOptions -- check that tuple satisfies any WITH CHECK OPTIONs
2224 : : * of the specified kind.
2225 : : *
2226 : : * Note that this needs to be called multiple times to ensure that all kinds of
2227 : : * WITH CHECK OPTIONs are handled (both those from views which have the WITH
2228 : : * CHECK OPTION set and from row-level security policies). See ExecInsert()
2229 : : * and ExecUpdate().
2230 : : */
2231 : : void
2232 : 376 : ExecWithCheckOptions(WCOKind kind, ResultRelInfo *resultRelInfo,
2233 : : TupleTableSlot *slot, EState *estate)
2234 : : {
2235 : 376 : Relation rel = resultRelInfo->ri_RelationDesc;
2236 : 376 : TupleDesc tupdesc = RelationGetDescr(rel);
2237 : 376 : ExprContext *econtext;
2238 : 376 : ListCell *l1,
2239 : : *l2;
2240 : :
2241 : : /*
2242 : : * We will use the EState's per-tuple context for evaluating constraint
2243 : : * expressions (creating it if it's not already there).
2244 : : */
2245 [ + + ]: 376 : econtext = GetPerTupleExprContext(estate);
2246 : :
2247 : : /* Arrange for econtext's scan tuple to be the tuple under test */
2248 : 376 : econtext->ecxt_scantuple = slot;
2249 : :
2250 : : /* Check each of the constraints */
2251 [ + - + + : 1022 : forboth(l1, resultRelInfo->ri_WithCheckOptions,
+ - + + +
+ + + ]
2252 : : l2, resultRelInfo->ri_WithCheckOptionExprs)
2253 : : {
2254 : 727 : WithCheckOption *wco = (WithCheckOption *) lfirst(l1);
2255 : 727 : ExprState *wcoExpr = (ExprState *) lfirst(l2);
2256 : :
2257 : : /*
2258 : : * Skip any WCOs which are not the kind we are looking for at this
2259 : : * time.
2260 : : */
2261 [ + + ]: 727 : if (wco->kind != kind)
2262 : 445 : continue;
2263 : :
2264 : : /*
2265 : : * WITH CHECK OPTION checks are intended to ensure that the new tuple
2266 : : * is visible (in the case of a view) or that it passes the
2267 : : * 'with-check' policy (in the case of row security). If the qual
2268 : : * evaluates to NULL or FALSE, then the new tuple won't be included in
2269 : : * the view or doesn't pass the 'with-check' policy for the table.
2270 : : */
2271 [ + + ]: 282 : if (!ExecQual(wcoExpr, econtext))
2272 : : {
2273 : 81 : char *val_desc;
2274 : 81 : Bitmapset *modifiedCols;
2275 : :
2276 [ + + - + : 81 : switch (wco->kind)
+ ]
2277 : : {
2278 : : /*
2279 : : * For WITH CHECK OPTIONs coming from views, we might be
2280 : : * able to provide the details on the row, depending on
2281 : : * the permissions on the relation (that is, if the user
2282 : : * could view it directly anyway). For RLS violations, we
2283 : : * don't include the data since we don't know if the user
2284 : : * should be able to view the tuple as that depends on the
2285 : : * USING policy.
2286 : : */
2287 : : case WCO_VIEW_CHECK:
2288 : : /* See the comment in ExecConstraints(). */
2289 [ + + ]: 36 : if (resultRelInfo->ri_RootResultRelInfo)
2290 : : {
2291 : 6 : ResultRelInfo *rootrel = resultRelInfo->ri_RootResultRelInfo;
2292 : 6 : TupleDesc old_tupdesc = RelationGetDescr(rel);
2293 : 6 : AttrMap *map;
2294 : :
2295 : 6 : tupdesc = RelationGetDescr(rootrel->ri_RelationDesc);
2296 : : /* a reverse map */
2297 : 12 : map = build_attrmap_by_name_if_req(old_tupdesc,
2298 : 6 : tupdesc,
2299 : : false);
2300 : :
2301 : : /*
2302 : : * Partition-specific slot's tupdesc can't be changed,
2303 : : * so allocate a new one.
2304 : : */
2305 [ + + ]: 6 : if (map != NULL)
2306 : 8 : slot = execute_attr_map_slot(map, slot,
2307 : 4 : MakeTupleTableSlot(tupdesc, &TTSOpsVirtual));
2308 : :
2309 : 12 : modifiedCols = bms_union(ExecGetInsertedCols(rootrel, estate),
2310 : 6 : ExecGetUpdatedCols(rootrel, estate));
2311 : 6 : rel = rootrel->ri_RelationDesc;
2312 : 6 : }
2313 : : else
2314 : 60 : modifiedCols = bms_union(ExecGetInsertedCols(resultRelInfo, estate),
2315 : 30 : ExecGetUpdatedCols(resultRelInfo, estate));
2316 : 72 : val_desc = ExecBuildSlotValueDescription(RelationGetRelid(rel),
2317 : 36 : slot,
2318 : 36 : tupdesc,
2319 : 36 : modifiedCols,
2320 : : 64);
2321 : :
2322 [ - + + - : 36 : ereport(ERROR,
+ - ]
2323 : : (errcode(ERRCODE_WITH_CHECK_OPTION_VIOLATION),
2324 : : errmsg("new row violates check option for view \"%s\"",
2325 : : wco->relname),
2326 : : val_desc ? errdetail("Failing row contains %s.",
2327 : : val_desc) : 0));
2328 : 0 : break;
2329 : : case WCO_RLS_INSERT_CHECK:
2330 : : case WCO_RLS_UPDATE_CHECK:
2331 [ + + ]: 37 : if (wco->polname != NULL)
2332 [ + - + - ]: 9 : ereport(ERROR,
2333 : : (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
2334 : : errmsg("new row violates row-level security policy \"%s\" for table \"%s\"",
2335 : : wco->polname, wco->relname)));
2336 : : else
2337 [ + - + - ]: 28 : ereport(ERROR,
2338 : : (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
2339 : : errmsg("new row violates row-level security policy for table \"%s\"",
2340 : : wco->relname)));
2341 : 0 : break;
2342 : : case WCO_RLS_MERGE_UPDATE_CHECK:
2343 : : case WCO_RLS_MERGE_DELETE_CHECK:
2344 [ - + ]: 4 : if (wco->polname != NULL)
2345 [ # # # # ]: 0 : ereport(ERROR,
2346 : : (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
2347 : : errmsg("target row violates row-level security policy \"%s\" (USING expression) for table \"%s\"",
2348 : : wco->polname, wco->relname)));
2349 : : else
2350 [ + - + - ]: 4 : ereport(ERROR,
2351 : : (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
2352 : : errmsg("target row violates row-level security policy (USING expression) for table \"%s\"",
2353 : : wco->relname)));
2354 : 0 : break;
2355 : : case WCO_RLS_CONFLICT_CHECK:
2356 [ - + ]: 4 : if (wco->polname != NULL)
2357 [ # # # # ]: 0 : ereport(ERROR,
2358 : : (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
2359 : : errmsg("new row violates row-level security policy \"%s\" (USING expression) for table \"%s\"",
2360 : : wco->polname, wco->relname)));
2361 : : else
2362 [ + - + - ]: 4 : ereport(ERROR,
2363 : : (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
2364 : : errmsg("new row violates row-level security policy (USING expression) for table \"%s\"",
2365 : : wco->relname)));
2366 : 0 : break;
2367 : : default:
2368 [ # # # # ]: 0 : elog(ERROR, "unrecognized WCO kind: %u", wco->kind);
2369 : 0 : break;
2370 : : }
2371 : 0 : }
2372 [ - + + ]: 646 : }
2373 : 295 : }
2374 : :
2375 : : /*
2376 : : * ExecBuildSlotValueDescription -- construct a string representing a tuple
2377 : : *
2378 : : * This is intentionally very similar to BuildIndexValueDescription, but
2379 : : * unlike that function, we truncate long field values (to at most maxfieldlen
2380 : : * bytes). That seems necessary here since heap field values could be very
2381 : : * long, whereas index entries typically aren't so wide.
2382 : : *
2383 : : * Also, unlike the case with index entries, we need to be prepared to ignore
2384 : : * dropped columns. We used to use the slot's tuple descriptor to decode the
2385 : : * data, but the slot's descriptor doesn't identify dropped columns, so we
2386 : : * now need to be passed the relation's descriptor.
2387 : : *
2388 : : * Note that, like BuildIndexValueDescription, if the user does not have
2389 : : * permission to view any of the columns involved, a NULL is returned. Unlike
2390 : : * BuildIndexValueDescription, if the user has access to view a subset of the
2391 : : * column involved, that subset will be returned with a key identifying which
2392 : : * columns they are.
2393 : : */
2394 : : char *
2395 : 210 : ExecBuildSlotValueDescription(Oid reloid,
2396 : : TupleTableSlot *slot,
2397 : : TupleDesc tupdesc,
2398 : : Bitmapset *modifiedCols,
2399 : : int maxfieldlen)
2400 : : {
2401 : 210 : StringInfoData buf;
2402 : 210 : StringInfoData collist;
2403 : 210 : bool write_comma = false;
2404 : 210 : bool write_comma_collist = false;
2405 : 210 : int i;
2406 : 210 : AclResult aclresult;
2407 : 210 : bool table_perm = false;
2408 : 210 : bool any_perm = false;
2409 : :
2410 : : /*
2411 : : * Check if RLS is enabled and should be active for the relation; if so,
2412 : : * then don't return anything. Otherwise, go through normal permission
2413 : : * checks.
2414 : : */
2415 [ - + ]: 210 : if (check_enable_rls(reloid, InvalidOid, true) == RLS_ENABLED)
2416 : 0 : return NULL;
2417 : :
2418 : 210 : initStringInfo(&buf);
2419 : :
2420 : 210 : appendStringInfoChar(&buf, '(');
2421 : :
2422 : : /*
2423 : : * Check if the user has permissions to see the row. Table-level SELECT
2424 : : * allows access to all columns. If the user does not have table-level
2425 : : * SELECT then we check each column and include those the user has SELECT
2426 : : * rights on. Additionally, we always include columns the user provided
2427 : : * data for.
2428 : : */
2429 : 210 : aclresult = pg_class_aclcheck(reloid, GetUserId(), ACL_SELECT);
2430 [ + + ]: 210 : if (aclresult != ACLCHECK_OK)
2431 : : {
2432 : : /* Set up the buffer for the column list */
2433 : 10 : initStringInfo(&collist);
2434 : 10 : appendStringInfoChar(&collist, '(');
2435 : 10 : }
2436 : : else
2437 : 200 : table_perm = any_perm = true;
2438 : :
2439 : : /* Make sure the tuple is fully deconstructed */
2440 : 210 : slot_getallattrs(slot);
2441 : :
2442 [ + + ]: 749 : for (i = 0; i < tupdesc->natts; i++)
2443 : : {
2444 : 539 : bool column_perm = false;
2445 : 539 : char *val;
2446 : 539 : int vallen;
2447 : 539 : Form_pg_attribute att = TupleDescAttr(tupdesc, i);
2448 : :
2449 : : /* ignore dropped columns */
2450 [ + + ]: 539 : if (att->attisdropped)
2451 : 6 : continue;
2452 : :
2453 [ + + ]: 533 : if (!table_perm)
2454 : : {
2455 : : /*
2456 : : * No table-level SELECT, so need to make sure they either have
2457 : : * SELECT rights on the column or that they have provided the data
2458 : : * for the column. If not, omit this column from the error
2459 : : * message.
2460 : : */
2461 : 78 : aclresult = pg_attribute_aclcheck(reloid, att->attnum,
2462 : 39 : GetUserId(), ACL_SELECT);
2463 : 78 : if (bms_is_member(att->attnum - FirstLowInvalidHeapAttributeNumber,
2464 [ + + + + : 78 : modifiedCols) || aclresult == ACLCHECK_OK)
+ + ]
2465 : : {
2466 : 24 : column_perm = any_perm = true;
2467 : :
2468 [ + + ]: 24 : if (write_comma_collist)
2469 : 14 : appendStringInfoString(&collist, ", ");
2470 : : else
2471 : 10 : write_comma_collist = true;
2472 : :
2473 : 24 : appendStringInfoString(&collist, NameStr(att->attname));
2474 : 24 : }
2475 : 39 : }
2476 : :
2477 [ + + + + ]: 533 : if (table_perm || column_perm)
2478 : : {
2479 [ + + ]: 518 : if (att->attgenerated == ATTRIBUTE_GENERATED_VIRTUAL)
2480 : 10 : val = "virtual";
2481 [ + + ]: 508 : else if (slot->tts_isnull[i])
2482 : 99 : val = "null";
2483 : : else
2484 : : {
2485 : 409 : Oid foutoid;
2486 : 409 : bool typisvarlena;
2487 : :
2488 : 409 : getTypeOutputInfo(att->atttypid,
2489 : : &foutoid, &typisvarlena);
2490 : 409 : val = OidOutputFunctionCall(foutoid, slot->tts_values[i]);
2491 : 409 : }
2492 : :
2493 [ + + ]: 518 : if (write_comma)
2494 : 308 : appendStringInfoString(&buf, ", ");
2495 : : else
2496 : 210 : write_comma = true;
2497 : :
2498 : : /* truncate if needed */
2499 : 518 : vallen = strlen(val);
2500 [ + - ]: 518 : if (vallen <= maxfieldlen)
2501 : 518 : appendBinaryStringInfo(&buf, val, vallen);
2502 : : else
2503 : : {
2504 : 0 : vallen = pg_mbcliplen(val, vallen, maxfieldlen);
2505 : 0 : appendBinaryStringInfo(&buf, val, vallen);
2506 : 0 : appendStringInfoString(&buf, "...");
2507 : : }
2508 : 518 : }
2509 [ - + + ]: 539 : }
2510 : :
2511 : : /* If we end up with zero columns being returned, then return NULL. */
2512 [ + - ]: 210 : if (!any_perm)
2513 : 0 : return NULL;
2514 : :
2515 : 210 : appendStringInfoChar(&buf, ')');
2516 : :
2517 [ + + ]: 210 : if (!table_perm)
2518 : : {
2519 : 10 : appendStringInfoString(&collist, ") = ");
2520 : 10 : appendBinaryStringInfo(&collist, buf.data, buf.len);
2521 : :
2522 : 10 : return collist.data;
2523 : : }
2524 : :
2525 : 200 : return buf.data;
2526 : 210 : }
2527 : :
2528 : :
2529 : : /*
2530 : : * ExecUpdateLockMode -- find the appropriate UPDATE tuple lock mode for a
2531 : : * given ResultRelInfo
2532 : : */
2533 : : LockTupleMode
2534 : 366 : ExecUpdateLockMode(EState *estate, ResultRelInfo *relinfo)
2535 : : {
2536 : 366 : Bitmapset *keyCols;
2537 : 366 : Bitmapset *updatedCols;
2538 : :
2539 : : /*
2540 : : * Compute lock mode to use. If columns that are part of the key have not
2541 : : * been modified, then we can use a weaker lock, allowing for better
2542 : : * concurrency.
2543 : : */
2544 : 366 : updatedCols = ExecGetAllUpdatedCols(relinfo, estate);
2545 : 366 : keyCols = RelationGetIndexAttrBitmap(relinfo->ri_RelationDesc,
2546 : : INDEX_ATTR_BITMAP_KEY);
2547 : :
2548 [ + + ]: 366 : if (bms_overlap(keyCols, updatedCols))
2549 : 39 : return LockTupleExclusive;
2550 : :
2551 : 327 : return LockTupleNoKeyExclusive;
2552 : 366 : }
2553 : :
2554 : : /*
2555 : : * ExecFindRowMark -- find the ExecRowMark struct for given rangetable index
2556 : : *
2557 : : * If no such struct, either return NULL or throw error depending on missing_ok
2558 : : */
2559 : : ExecRowMark *
2560 : 401276 : ExecFindRowMark(EState *estate, Index rti, bool missing_ok)
2561 : : {
2562 [ + - + - : 401276 : if (rti > 0 && rti <= estate->es_range_table_size &&
- + ]
2563 : 401276 : estate->es_rowmarks != NULL)
2564 : : {
2565 : 401276 : ExecRowMark *erm = estate->es_rowmarks[rti - 1];
2566 : :
2567 [ + - ]: 401276 : if (erm)
2568 : 401276 : return erm;
2569 [ - + - ]: 401276 : }
2570 [ # # ]: 0 : if (!missing_ok)
2571 [ # # # # ]: 0 : elog(ERROR, "failed to find ExecRowMark for rangetable index %u", rti);
2572 : 0 : return NULL;
2573 : 401276 : }
2574 : :
2575 : : /*
2576 : : * ExecBuildAuxRowMark -- create an ExecAuxRowMark struct
2577 : : *
2578 : : * Inputs are the underlying ExecRowMark struct and the targetlist of the
2579 : : * input plan node (not planstate node!). We need the latter to find out
2580 : : * the column numbers of the resjunk columns.
2581 : : */
2582 : : ExecAuxRowMark *
2583 : 401276 : ExecBuildAuxRowMark(ExecRowMark *erm, List *targetlist)
2584 : : {
2585 : 401276 : ExecAuxRowMark *aerm = palloc0_object(ExecAuxRowMark);
2586 : 401276 : char resname[32];
2587 : :
2588 : 401276 : aerm->rowmark = erm;
2589 : :
2590 : : /* Look up the resjunk columns associated with this rowmark */
2591 [ + + ]: 401276 : if (erm->markType != ROW_MARK_COPY)
2592 : : {
2593 : : /* need ctid for all methods other than COPY */
2594 : 401201 : snprintf(resname, sizeof(resname), "ctid%u", erm->rowmarkId);
2595 : 802402 : aerm->ctidAttNo = ExecFindJunkAttributeInTlist(targetlist,
2596 : 401201 : resname);
2597 [ + - ]: 401201 : if (!AttributeNumberIsValid(aerm->ctidAttNo))
2598 [ # # # # ]: 0 : elog(ERROR, "could not find junk %s column", resname);
2599 : 401201 : }
2600 : : else
2601 : : {
2602 : : /* need wholerow if COPY */
2603 : 75 : snprintf(resname, sizeof(resname), "wholerow%u", erm->rowmarkId);
2604 : 150 : aerm->wholeAttNo = ExecFindJunkAttributeInTlist(targetlist,
2605 : 75 : resname);
2606 [ + - ]: 75 : if (!AttributeNumberIsValid(aerm->wholeAttNo))
2607 [ # # # # ]: 0 : elog(ERROR, "could not find junk %s column", resname);
2608 : : }
2609 : :
2610 : : /* if child rel, need tableoid */
2611 [ + + ]: 401276 : if (erm->rti != erm->prti)
2612 : : {
2613 : 265 : snprintf(resname, sizeof(resname), "tableoid%u", erm->rowmarkId);
2614 : 530 : aerm->toidAttNo = ExecFindJunkAttributeInTlist(targetlist,
2615 : 265 : resname);
2616 [ + - ]: 265 : if (!AttributeNumberIsValid(aerm->toidAttNo))
2617 [ # # # # ]: 0 : elog(ERROR, "could not find junk %s column", resname);
2618 : 265 : }
2619 : :
2620 : 802552 : return aerm;
2621 : 401276 : }
2622 : :
2623 : :
2624 : : /*
2625 : : * EvalPlanQual logic --- recheck modified tuple(s) to see if we want to
2626 : : * process the updated version under READ COMMITTED rules.
2627 : : *
2628 : : * See backend/executor/README for some info about how this works.
2629 : : */
2630 : :
2631 : :
2632 : : /*
2633 : : * Check the updated version of a tuple to see if we want to process it under
2634 : : * READ COMMITTED rules.
2635 : : *
2636 : : * epqstate - state for EvalPlanQual rechecking
2637 : : * relation - table containing tuple
2638 : : * rti - rangetable index of table containing tuple
2639 : : * inputslot - tuple for processing - this can be the slot from
2640 : : * EvalPlanQualSlot() for this rel, for increased efficiency.
2641 : : *
2642 : : * This tests whether the tuple in inputslot still matches the relevant
2643 : : * quals. For that result to be useful, typically the input tuple has to be
2644 : : * last row version (otherwise the result isn't particularly useful) and
2645 : : * locked (otherwise the result might be out of date). That's typically
2646 : : * achieved by using table_tuple_lock() with the
2647 : : * TUPLE_LOCK_FLAG_FIND_LAST_VERSION flag.
2648 : : *
2649 : : * Returns a slot containing the new candidate update/delete tuple, or
2650 : : * NULL if we determine we shouldn't process the row.
2651 : : */
2652 : : TupleTableSlot *
2653 : 0 : EvalPlanQual(EPQState *epqstate, Relation relation,
2654 : : Index rti, TupleTableSlot *inputslot)
2655 : : {
2656 : 0 : TupleTableSlot *slot;
2657 : 0 : TupleTableSlot *testslot;
2658 : :
2659 [ # # ]: 0 : Assert(rti > 0);
2660 : :
2661 : : /*
2662 : : * Need to run a recheck subquery. Initialize or reinitialize EPQ state.
2663 : : */
2664 : 0 : EvalPlanQualBegin(epqstate);
2665 : :
2666 : : /*
2667 : : * Callers will often use the EvalPlanQualSlot to store the tuple to avoid
2668 : : * an unnecessary copy.
2669 : : */
2670 : 0 : testslot = EvalPlanQualSlot(epqstate, relation, rti);
2671 [ # # ]: 0 : if (testslot != inputslot)
2672 : 0 : ExecCopySlot(testslot, inputslot);
2673 : :
2674 : : /*
2675 : : * Mark that an EPQ tuple is available for this relation. (If there is
2676 : : * more than one result relation, the others remain marked as having no
2677 : : * tuple available.)
2678 : : */
2679 : 0 : epqstate->relsubs_done[rti - 1] = false;
2680 : 0 : epqstate->relsubs_blocked[rti - 1] = false;
2681 : :
2682 : : /*
2683 : : * Run the EPQ query. We assume it will return at most one tuple.
2684 : : */
2685 : 0 : slot = EvalPlanQualNext(epqstate);
2686 : :
2687 : : /*
2688 : : * If we got a tuple, force the slot to materialize the tuple so that it
2689 : : * is not dependent on any local state in the EPQ query (in particular,
2690 : : * it's highly likely that the slot contains references to any pass-by-ref
2691 : : * datums that may be present in copyTuple). As with the next step, this
2692 : : * is to guard against early re-use of the EPQ query.
2693 : : */
2694 [ # # # # ]: 0 : if (!TupIsNull(slot))
2695 : 0 : ExecMaterializeSlot(slot);
2696 : :
2697 : : /*
2698 : : * Clear out the test tuple, and mark that no tuple is available here.
2699 : : * This is needed in case the EPQ state is re-used to test a tuple for a
2700 : : * different target relation.
2701 : : */
2702 : 0 : ExecClearTuple(testslot);
2703 : 0 : epqstate->relsubs_blocked[rti - 1] = true;
2704 : :
2705 : 0 : return slot;
2706 : 0 : }
2707 : :
2708 : : /*
2709 : : * EvalPlanQualInit -- initialize during creation of a plan state node
2710 : : * that might need to invoke EPQ processing.
2711 : : *
2712 : : * If the caller intends to use EvalPlanQual(), resultRelations should be
2713 : : * a list of RT indexes of potential target relations for EvalPlanQual(),
2714 : : * and we will arrange that the other listed relations don't return any
2715 : : * tuple during an EvalPlanQual() call. Otherwise resultRelations
2716 : : * should be NIL.
2717 : : *
2718 : : * Note: subplan/auxrowmarks can be NULL/NIL if they will be set later
2719 : : * with EvalPlanQualSetPlan.
2720 : : */
2721 : : void
2722 : 410989 : EvalPlanQualInit(EPQState *epqstate, EState *parentestate,
2723 : : Plan *subplan, List *auxrowmarks,
2724 : : int epqParam, List *resultRelations)
2725 : : {
2726 : 410989 : Index rtsize = parentestate->es_range_table_size;
2727 : :
2728 : : /* initialize data not changing over EPQState's lifetime */
2729 : 410989 : epqstate->parentestate = parentestate;
2730 : 410989 : epqstate->epqParam = epqParam;
2731 : 410989 : epqstate->resultRelations = resultRelations;
2732 : :
2733 : : /*
2734 : : * Allocate space to reference a slot for each potential rti - do so now
2735 : : * rather than in EvalPlanQualBegin(), as done for other dynamically
2736 : : * allocated resources, so EvalPlanQualSlot() can be used to hold tuples
2737 : : * that *may* need EPQ later, without forcing the overhead of
2738 : : * EvalPlanQualBegin().
2739 : : */
2740 : 410989 : epqstate->tuple_table = NIL;
2741 : 410989 : epqstate->relsubs_slot = palloc0_array(TupleTableSlot *, rtsize);
2742 : :
2743 : : /* ... and remember data that EvalPlanQualBegin will need */
2744 : 410989 : epqstate->plan = subplan;
2745 : 410989 : epqstate->arowMarks = auxrowmarks;
2746 : :
2747 : : /* ... and mark the EPQ state inactive */
2748 : 410989 : epqstate->origslot = NULL;
2749 : 410989 : epqstate->recheckestate = NULL;
2750 : 410989 : epqstate->recheckplanstate = NULL;
2751 : 410989 : epqstate->relsubs_rowmark = NULL;
2752 : 410989 : epqstate->relsubs_done = NULL;
2753 : 410989 : epqstate->relsubs_blocked = NULL;
2754 : 410989 : }
2755 : :
2756 : : /*
2757 : : * EvalPlanQualSetPlan -- set or change subplan of an EPQState.
2758 : : *
2759 : : * We used to need this so that ModifyTable could deal with multiple subplans.
2760 : : * It could now be refactored out of existence.
2761 : : */
2762 : : void
2763 : 10106 : EvalPlanQualSetPlan(EPQState *epqstate, Plan *subplan, List *auxrowmarks)
2764 : : {
2765 : : /* If we have a live EPQ query, shut it down */
2766 : 10106 : EvalPlanQualEnd(epqstate);
2767 : : /* And set/change the plan pointer */
2768 : 10106 : epqstate->plan = subplan;
2769 : : /* The rowmarks depend on the plan, too */
2770 : 10106 : epqstate->arowMarks = auxrowmarks;
2771 : 10106 : }
2772 : :
2773 : : /*
2774 : : * Return, and create if necessary, a slot for an EPQ test tuple.
2775 : : *
2776 : : * Note this only requires EvalPlanQualInit() to have been called,
2777 : : * EvalPlanQualBegin() is not necessary.
2778 : : */
2779 : : TupleTableSlot *
2780 : 400584 : EvalPlanQualSlot(EPQState *epqstate,
2781 : : Relation relation, Index rti)
2782 : : {
2783 : 400584 : TupleTableSlot **slot;
2784 : :
2785 [ + - ]: 400584 : Assert(relation);
2786 [ + - ]: 400584 : Assert(rti > 0 && rti <= epqstate->parentestate->es_range_table_size);
2787 : 400584 : slot = &epqstate->relsubs_slot[rti - 1];
2788 : :
2789 [ + + ]: 400584 : if (*slot == NULL)
2790 : : {
2791 : 400525 : MemoryContext oldcontext;
2792 : :
2793 : 400525 : oldcontext = MemoryContextSwitchTo(epqstate->parentestate->es_query_cxt);
2794 : 400525 : *slot = table_slot_create(relation, &epqstate->tuple_table);
2795 : 400525 : MemoryContextSwitchTo(oldcontext);
2796 : 400525 : }
2797 : :
2798 : 801168 : return *slot;
2799 : 400584 : }
2800 : :
2801 : : /*
2802 : : * Fetch the current row value for a non-locked relation, identified by rti,
2803 : : * that needs to be scanned by an EvalPlanQual operation. origslot must have
2804 : : * been set to contain the current result row (top-level row) that we need to
2805 : : * recheck. Returns true if a substitution tuple was found, false if not.
2806 : : */
2807 : : bool
2808 : 0 : EvalPlanQualFetchRowMark(EPQState *epqstate, Index rti, TupleTableSlot *slot)
2809 : : {
2810 : 0 : ExecAuxRowMark *earm = epqstate->relsubs_rowmark[rti - 1];
2811 : 0 : ExecRowMark *erm;
2812 : 0 : Datum datum;
2813 : 0 : bool isNull;
2814 : :
2815 [ # # ]: 0 : Assert(earm != NULL);
2816 [ # # ]: 0 : Assert(epqstate->origslot != NULL);
2817 : :
2818 : 0 : erm = earm->rowmark;
2819 : :
2820 [ # # ]: 0 : if (RowMarkRequiresRowShareLock(erm->markType))
2821 [ # # # # ]: 0 : elog(ERROR, "EvalPlanQual doesn't support locking rowmarks");
2822 : :
2823 : : /* if child rel, must check whether it produced this row */
2824 [ # # ]: 0 : if (erm->rti != erm->prti)
2825 : : {
2826 : 0 : Oid tableoid;
2827 : :
2828 : 0 : datum = ExecGetJunkAttribute(epqstate->origslot,
2829 : 0 : earm->toidAttNo,
2830 : : &isNull);
2831 : : /* non-locked rels could be on the inside of outer joins */
2832 [ # # ]: 0 : if (isNull)
2833 : 0 : return false;
2834 : :
2835 : 0 : tableoid = DatumGetObjectId(datum);
2836 : :
2837 [ # # ]: 0 : Assert(OidIsValid(erm->relid));
2838 [ # # ]: 0 : if (tableoid != erm->relid)
2839 : : {
2840 : : /* this child is inactive right now */
2841 : 0 : return false;
2842 : : }
2843 [ # # ]: 0 : }
2844 : :
2845 [ # # ]: 0 : if (erm->markType == ROW_MARK_REFERENCE)
2846 : : {
2847 [ # # ]: 0 : Assert(erm->relation != NULL);
2848 : :
2849 : : /* fetch the tuple's ctid */
2850 : 0 : datum = ExecGetJunkAttribute(epqstate->origslot,
2851 : 0 : earm->ctidAttNo,
2852 : : &isNull);
2853 : : /* non-locked rels could be on the inside of outer joins */
2854 [ # # ]: 0 : if (isNull)
2855 : 0 : return false;
2856 : :
2857 : : /* fetch requests on foreign tables must be passed to their FDW */
2858 [ # # ]: 0 : if (erm->relation->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
2859 : : {
2860 : 0 : FdwRoutine *fdwroutine;
2861 : 0 : bool updated = false;
2862 : :
2863 : 0 : fdwroutine = GetFdwRoutineForRelation(erm->relation, false);
2864 : : /* this should have been checked already, but let's be safe */
2865 [ # # ]: 0 : if (fdwroutine->RefetchForeignRow == NULL)
2866 [ # # # # ]: 0 : ereport(ERROR,
2867 : : (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2868 : : errmsg("cannot lock rows in foreign table \"%s\"",
2869 : : RelationGetRelationName(erm->relation))));
2870 : :
2871 : 0 : fdwroutine->RefetchForeignRow(epqstate->recheckestate,
2872 : 0 : erm,
2873 : 0 : datum,
2874 : 0 : slot,
2875 : : &updated);
2876 [ # # ]: 0 : if (TupIsNull(slot))
2877 [ # # # # ]: 0 : elog(ERROR, "failed to fetch tuple for EvalPlanQual recheck");
2878 : :
2879 : : /*
2880 : : * Ideally we'd insist on updated == false here, but that assumes
2881 : : * that FDWs can track that exactly, which they might not be able
2882 : : * to. So just ignore the flag.
2883 : : */
2884 : 0 : return true;
2885 : 0 : }
2886 : : else
2887 : : {
2888 : : /* ordinary table, fetch the tuple */
2889 [ # # # # ]: 0 : if (!table_tuple_fetch_row_version(erm->relation,
2890 : 0 : (ItemPointer) DatumGetPointer(datum),
2891 : 0 : SnapshotAny, slot))
2892 [ # # # # ]: 0 : elog(ERROR, "failed to fetch tuple for EvalPlanQual recheck");
2893 : 0 : return true;
2894 : : }
2895 : : }
2896 : : else
2897 : : {
2898 [ # # ]: 0 : Assert(erm->markType == ROW_MARK_COPY);
2899 : :
2900 : : /* fetch the whole-row Var for the relation */
2901 : 0 : datum = ExecGetJunkAttribute(epqstate->origslot,
2902 : 0 : earm->wholeAttNo,
2903 : : &isNull);
2904 : : /* non-locked rels could be on the inside of outer joins */
2905 [ # # ]: 0 : if (isNull)
2906 : 0 : return false;
2907 : :
2908 : 0 : ExecStoreHeapTupleDatum(datum, slot);
2909 : 0 : return true;
2910 : : }
2911 : 0 : }
2912 : :
2913 : : /*
2914 : : * Fetch the next row (if any) from EvalPlanQual testing
2915 : : *
2916 : : * (In practice, there should never be more than one row...)
2917 : : */
2918 : : TupleTableSlot *
2919 : 0 : EvalPlanQualNext(EPQState *epqstate)
2920 : : {
2921 : 0 : MemoryContext oldcontext;
2922 : 0 : TupleTableSlot *slot;
2923 : :
2924 : 0 : oldcontext = MemoryContextSwitchTo(epqstate->recheckestate->es_query_cxt);
2925 : 0 : slot = ExecProcNode(epqstate->recheckplanstate);
2926 : 0 : MemoryContextSwitchTo(oldcontext);
2927 : :
2928 : 0 : return slot;
2929 : 0 : }
2930 : :
2931 : : /*
2932 : : * Initialize or reset an EvalPlanQual state tree
2933 : : */
2934 : : void
2935 : 0 : EvalPlanQualBegin(EPQState *epqstate)
2936 : : {
2937 : 0 : EState *parentestate = epqstate->parentestate;
2938 : 0 : EState *recheckestate = epqstate->recheckestate;
2939 : :
2940 [ # # ]: 0 : if (recheckestate == NULL)
2941 : : {
2942 : : /* First time through, so create a child EState */
2943 : 0 : EvalPlanQualStart(epqstate, epqstate->plan);
2944 : 0 : }
2945 : : else
2946 : : {
2947 : : /*
2948 : : * We already have a suitable child EPQ tree, so just reset it.
2949 : : */
2950 : 0 : Index rtsize = parentestate->es_range_table_size;
2951 : 0 : PlanState *rcplanstate = epqstate->recheckplanstate;
2952 : :
2953 : : /*
2954 : : * Reset the relsubs_done[] flags to equal relsubs_blocked[], so that
2955 : : * the EPQ run will never attempt to fetch tuples from blocked target
2956 : : * relations.
2957 : : */
2958 : 0 : memcpy(epqstate->relsubs_done, epqstate->relsubs_blocked,
2959 : : rtsize * sizeof(bool));
2960 : :
2961 : : /* Recopy current values of parent parameters */
2962 [ # # ]: 0 : if (parentestate->es_plannedstmt->paramExecTypes != NIL)
2963 : : {
2964 : 0 : int i;
2965 : :
2966 : : /*
2967 : : * Force evaluation of any InitPlan outputs that could be needed
2968 : : * by the subplan, just in case they got reset since
2969 : : * EvalPlanQualStart (see comments therein).
2970 : : */
2971 : 0 : ExecSetParamPlanMulti(rcplanstate->plan->extParam,
2972 [ # # ]: 0 : GetPerTupleExprContext(parentestate));
2973 : :
2974 : 0 : i = list_length(parentestate->es_plannedstmt->paramExecTypes);
2975 : :
2976 [ # # ]: 0 : while (--i >= 0)
2977 : : {
2978 : : /* copy value if any, but not execPlan link */
2979 : 0 : recheckestate->es_param_exec_vals[i].value =
2980 : 0 : parentestate->es_param_exec_vals[i].value;
2981 : 0 : recheckestate->es_param_exec_vals[i].isnull =
2982 : 0 : parentestate->es_param_exec_vals[i].isnull;
2983 : : }
2984 : 0 : }
2985 : :
2986 : : /*
2987 : : * Mark child plan tree as needing rescan at all scan nodes. The
2988 : : * first ExecProcNode will take care of actually doing the rescan.
2989 : : */
2990 : 0 : rcplanstate->chgParam = bms_add_member(rcplanstate->chgParam,
2991 : 0 : epqstate->epqParam);
2992 : 0 : }
2993 : 0 : }
2994 : :
2995 : : /*
2996 : : * Start execution of an EvalPlanQual plan tree.
2997 : : *
2998 : : * This is a cut-down version of ExecutorStart(): we copy some state from
2999 : : * the top-level estate rather than initializing it fresh.
3000 : : */
3001 : : static void
3002 : 0 : EvalPlanQualStart(EPQState *epqstate, Plan *planTree)
3003 : : {
3004 : 0 : EState *parentestate = epqstate->parentestate;
3005 : 0 : Index rtsize = parentestate->es_range_table_size;
3006 : 0 : EState *rcestate;
3007 : 0 : MemoryContext oldcontext;
3008 : 0 : ListCell *l;
3009 : :
3010 : 0 : epqstate->recheckestate = rcestate = CreateExecutorState();
3011 : :
3012 : 0 : oldcontext = MemoryContextSwitchTo(rcestate->es_query_cxt);
3013 : :
3014 : : /* signal that this is an EState for executing EPQ */
3015 : 0 : rcestate->es_epq_active = epqstate;
3016 : :
3017 : : /*
3018 : : * Child EPQ EStates share the parent's copy of unchanging state such as
3019 : : * the snapshot, rangetable, and external Param info. They need their own
3020 : : * copies of local state, including a tuple table, es_param_exec_vals,
3021 : : * result-rel info, etc.
3022 : : */
3023 : 0 : rcestate->es_direction = ForwardScanDirection;
3024 : 0 : rcestate->es_snapshot = parentestate->es_snapshot;
3025 : 0 : rcestate->es_crosscheck_snapshot = parentestate->es_crosscheck_snapshot;
3026 : 0 : rcestate->es_range_table = parentestate->es_range_table;
3027 : 0 : rcestate->es_range_table_size = parentestate->es_range_table_size;
3028 : 0 : rcestate->es_relations = parentestate->es_relations;
3029 : 0 : rcestate->es_rowmarks = parentestate->es_rowmarks;
3030 : 0 : rcestate->es_rteperminfos = parentestate->es_rteperminfos;
3031 : 0 : rcestate->es_plannedstmt = parentestate->es_plannedstmt;
3032 : 0 : rcestate->es_junkFilter = parentestate->es_junkFilter;
3033 : 0 : rcestate->es_output_cid = parentestate->es_output_cid;
3034 : 0 : rcestate->es_queryEnv = parentestate->es_queryEnv;
3035 : :
3036 : : /*
3037 : : * ResultRelInfos needed by subplans are initialized from scratch when the
3038 : : * subplans themselves are initialized.
3039 : : */
3040 : 0 : rcestate->es_result_relations = NULL;
3041 : : /* es_trig_target_relations must NOT be copied */
3042 : 0 : rcestate->es_top_eflags = parentestate->es_top_eflags;
3043 : 0 : rcestate->es_instrument = parentestate->es_instrument;
3044 : : /* es_auxmodifytables must NOT be copied */
3045 : :
3046 : : /*
3047 : : * The external param list is simply shared from parent. The internal
3048 : : * param workspace has to be local state, but we copy the initial values
3049 : : * from the parent, so as to have access to any param values that were
3050 : : * already set from other parts of the parent's plan tree.
3051 : : */
3052 : 0 : rcestate->es_param_list_info = parentestate->es_param_list_info;
3053 [ # # ]: 0 : if (parentestate->es_plannedstmt->paramExecTypes != NIL)
3054 : : {
3055 : 0 : int i;
3056 : :
3057 : : /*
3058 : : * Force evaluation of any InitPlan outputs that could be needed by
3059 : : * the subplan. (With more complexity, maybe we could postpone this
3060 : : * till the subplan actually demands them, but it doesn't seem worth
3061 : : * the trouble; this is a corner case already, since usually the
3062 : : * InitPlans would have been evaluated before reaching EvalPlanQual.)
3063 : : *
3064 : : * This will not touch output params of InitPlans that occur somewhere
3065 : : * within the subplan tree, only those that are attached to the
3066 : : * ModifyTable node or above it and are referenced within the subplan.
3067 : : * That's OK though, because the planner would only attach such
3068 : : * InitPlans to a lower-level SubqueryScan node, and EPQ execution
3069 : : * will not descend into a SubqueryScan.
3070 : : *
3071 : : * The EState's per-output-tuple econtext is sufficiently short-lived
3072 : : * for this, since it should get reset before there is any chance of
3073 : : * doing EvalPlanQual again.
3074 : : */
3075 : 0 : ExecSetParamPlanMulti(planTree->extParam,
3076 [ # # ]: 0 : GetPerTupleExprContext(parentestate));
3077 : :
3078 : : /* now make the internal param workspace ... */
3079 : 0 : i = list_length(parentestate->es_plannedstmt->paramExecTypes);
3080 : 0 : rcestate->es_param_exec_vals = palloc0_array(ParamExecData, i);
3081 : : /* ... and copy down all values, whether really needed or not */
3082 [ # # ]: 0 : while (--i >= 0)
3083 : : {
3084 : : /* copy value if any, but not execPlan link */
3085 : 0 : rcestate->es_param_exec_vals[i].value =
3086 : 0 : parentestate->es_param_exec_vals[i].value;
3087 : 0 : rcestate->es_param_exec_vals[i].isnull =
3088 : 0 : parentestate->es_param_exec_vals[i].isnull;
3089 : : }
3090 : 0 : }
3091 : :
3092 : : /*
3093 : : * Copy es_unpruned_relids so that pruned relations are ignored by
3094 : : * ExecInitLockRows() and ExecInitModifyTable() when initializing the plan
3095 : : * trees below.
3096 : : */
3097 : 0 : rcestate->es_unpruned_relids = parentestate->es_unpruned_relids;
3098 : :
3099 : : /*
3100 : : * Also make the PartitionPruneInfo and the results of pruning available.
3101 : : * These need to match exactly so that we initialize all the same Append
3102 : : * and MergeAppend subplans as the parent did.
3103 : : */
3104 : 0 : rcestate->es_part_prune_infos = parentestate->es_part_prune_infos;
3105 : 0 : rcestate->es_part_prune_states = parentestate->es_part_prune_states;
3106 : 0 : rcestate->es_part_prune_results = parentestate->es_part_prune_results;
3107 : :
3108 : : /* We'll also borrow the es_partition_directory from the parent state */
3109 : 0 : rcestate->es_partition_directory = parentestate->es_partition_directory;
3110 : :
3111 : : /*
3112 : : * Initialize private state information for each SubPlan. We must do this
3113 : : * before running ExecInitNode on the main query tree, since
3114 : : * ExecInitSubPlan expects to be able to find these entries. Some of the
3115 : : * SubPlans might not be used in the part of the plan tree we intend to
3116 : : * run, but since it's not easy to tell which, we just initialize them
3117 : : * all.
3118 : : */
3119 [ # # ]: 0 : Assert(rcestate->es_subplanstates == NIL);
3120 [ # # # # : 0 : foreach(l, parentestate->es_plannedstmt->subplans)
# # ]
3121 : : {
3122 : 0 : Plan *subplan = (Plan *) lfirst(l);
3123 : 0 : PlanState *subplanstate;
3124 : :
3125 : 0 : subplanstate = ExecInitNode(subplan, rcestate, 0);
3126 : 0 : rcestate->es_subplanstates = lappend(rcestate->es_subplanstates,
3127 : 0 : subplanstate);
3128 : 0 : }
3129 : :
3130 : : /*
3131 : : * Build an RTI indexed array of rowmarks, so that
3132 : : * EvalPlanQualFetchRowMark() can efficiently access the to be fetched
3133 : : * rowmark.
3134 : : */
3135 : 0 : epqstate->relsubs_rowmark = palloc0_array(ExecAuxRowMark *, rtsize);
3136 [ # # # # : 0 : foreach(l, epqstate->arowMarks)
# # ]
3137 : : {
3138 : 0 : ExecAuxRowMark *earm = (ExecAuxRowMark *) lfirst(l);
3139 : :
3140 : 0 : epqstate->relsubs_rowmark[earm->rowmark->rti - 1] = earm;
3141 : 0 : }
3142 : :
3143 : : /*
3144 : : * Initialize per-relation EPQ tuple states. Result relations, if any,
3145 : : * get marked as blocked; others as not-fetched.
3146 : : */
3147 : 0 : epqstate->relsubs_done = palloc_array(bool, rtsize);
3148 : 0 : epqstate->relsubs_blocked = palloc0_array(bool, rtsize);
3149 : :
3150 [ # # # # : 0 : foreach(l, epqstate->resultRelations)
# # ]
3151 : : {
3152 : 0 : int rtindex = lfirst_int(l);
3153 : :
3154 [ # # ]: 0 : Assert(rtindex > 0 && rtindex <= rtsize);
3155 : 0 : epqstate->relsubs_blocked[rtindex - 1] = true;
3156 : 0 : }
3157 : :
3158 : 0 : memcpy(epqstate->relsubs_done, epqstate->relsubs_blocked,
3159 : : rtsize * sizeof(bool));
3160 : :
3161 : : /*
3162 : : * Initialize the private state information for all the nodes in the part
3163 : : * of the plan tree we need to run. This opens files, allocates storage
3164 : : * and leaves us ready to start processing tuples.
3165 : : */
3166 : 0 : epqstate->recheckplanstate = ExecInitNode(planTree, rcestate, 0);
3167 : :
3168 : 0 : MemoryContextSwitchTo(oldcontext);
3169 : 0 : }
3170 : :
3171 : : /*
3172 : : * EvalPlanQualEnd -- shut down at termination of parent plan state node,
3173 : : * or if we are done with the current EPQ child.
3174 : : *
3175 : : * This is a cut-down version of ExecutorEnd(); basically we want to do most
3176 : : * of the normal cleanup, but *not* close result relations (which we are
3177 : : * just sharing from the outer query). We do, however, have to close any
3178 : : * result and trigger target relations that got opened, since those are not
3179 : : * shared. (There probably shouldn't be any of the latter, but just in
3180 : : * case...)
3181 : : */
3182 : : void
3183 : 420791 : EvalPlanQualEnd(EPQState *epqstate)
3184 : : {
3185 : 420791 : EState *estate = epqstate->recheckestate;
3186 : 420791 : Index rtsize;
3187 : 420791 : MemoryContext oldcontext;
3188 : 420791 : ListCell *l;
3189 : :
3190 : 420791 : rtsize = epqstate->parentestate->es_range_table_size;
3191 : :
3192 : : /*
3193 : : * We may have a tuple table, even if EPQ wasn't started, because we allow
3194 : : * use of EvalPlanQualSlot() without calling EvalPlanQualBegin().
3195 : : */
3196 [ + + ]: 420791 : if (epqstate->tuple_table != NIL)
3197 : : {
3198 : 400502 : memset(epqstate->relsubs_slot, 0,
3199 : : rtsize * sizeof(TupleTableSlot *));
3200 : 400502 : ExecResetTupleTable(epqstate->tuple_table, true);
3201 : 400502 : epqstate->tuple_table = NIL;
3202 : 400502 : }
3203 : :
3204 : : /* EPQ wasn't started, nothing further to do */
3205 [ - + ]: 420791 : if (estate == NULL)
3206 : 420791 : return;
3207 : :
3208 : 0 : oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
3209 : :
3210 : 0 : ExecEndNode(epqstate->recheckplanstate);
3211 : :
3212 [ # # # # : 0 : foreach(l, estate->es_subplanstates)
# # ]
3213 : : {
3214 : 0 : PlanState *subplanstate = (PlanState *) lfirst(l);
3215 : :
3216 : 0 : ExecEndNode(subplanstate);
3217 : 0 : }
3218 : :
3219 : : /* throw away the per-estate tuple table, some node may have used it */
3220 : 0 : ExecResetTupleTable(estate->es_tupleTable, false);
3221 : :
3222 : : /* Close any result and trigger target relations attached to this EState */
3223 : 0 : ExecCloseResultRelations(estate);
3224 : :
3225 : 0 : MemoryContextSwitchTo(oldcontext);
3226 : :
3227 : : /*
3228 : : * NULLify the partition directory before freeing the executor state.
3229 : : * Since EvalPlanQualStart() just borrowed the parent EState's directory,
3230 : : * we'd better leave it up to the parent to delete it.
3231 : : */
3232 : 0 : estate->es_partition_directory = NULL;
3233 : :
3234 : 0 : FreeExecutorState(estate);
3235 : :
3236 : : /* Mark EPQState idle */
3237 : 0 : epqstate->origslot = NULL;
3238 : 0 : epqstate->recheckestate = NULL;
3239 : 0 : epqstate->recheckplanstate = NULL;
3240 : 0 : epqstate->relsubs_rowmark = NULL;
3241 : 0 : epqstate->relsubs_done = NULL;
3242 : 0 : epqstate->relsubs_blocked = NULL;
3243 [ - + ]: 420791 : }
|
