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