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