1 /*-------------------------------------------------------------------------
4 * top level executor interface routines
11 * The old ExecutorMain() has been replaced by ExecutorStart(),
12 * ExecutorRun() and ExecutorEnd()
14 * These three procedures are the external interfaces to the executor.
15 * In each case, the query descriptor is required as an argument.
17 * ExecutorStart() must be called at the beginning of execution of any
18 * query plan and ExecutorEnd() should always be called at the end of
19 * execution of a plan.
21 * ExecutorRun accepts direction and count arguments that specify whether
22 * the plan is to be executed forwards, backwards, and for how many tuples.
24 * Portions Copyright (c) 1996-2002, PostgreSQL Global Development Group
25 * Portions Copyright (c) 1994, Regents of the University of California
29 * $Header: /cvsroot/pgsql/src/backend/executor/execMain.c,v 1.202 2003/03/11 19:40:22 tgl Exp $
31 *-------------------------------------------------------------------------
35 #include "access/heapam.h"
36 #include "catalog/heap.h"
37 #include "catalog/namespace.h"
38 #include "commands/tablecmds.h"
39 #include "commands/trigger.h"
40 #include "executor/execdebug.h"
41 #include "executor/execdefs.h"
42 #include "miscadmin.h"
43 #include "optimizer/var.h"
44 #include "parser/parsetree.h"
45 #include "utils/acl.h"
46 #include "utils/lsyscache.h"
49 typedef struct execRowMark
56 typedef struct evalPlanQual
61 struct evalPlanQual *next; /* stack of active PlanQual plans */
62 struct evalPlanQual *free; /* list of free PlanQual plans */
65 /* decls for local routines only used within this module */
66 static void InitPlan(QueryDesc *queryDesc);
67 static void initResultRelInfo(ResultRelInfo *resultRelInfo,
68 Index resultRelationIndex,
71 static TupleTableSlot *ExecutePlan(EState *estate, PlanState *planstate,
74 ScanDirection direction,
75 DestReceiver *destfunc);
76 static void ExecSelect(TupleTableSlot *slot,
77 DestReceiver *destfunc,
79 static void ExecInsert(TupleTableSlot *slot, ItemPointer tupleid,
81 static void ExecDelete(TupleTableSlot *slot, ItemPointer tupleid,
83 static void ExecUpdate(TupleTableSlot *slot, ItemPointer tupleid,
85 static TupleTableSlot *EvalPlanQualNext(EState *estate);
86 static void EndEvalPlanQual(EState *estate);
87 static void ExecCheckRTEPerms(RangeTblEntry *rte, CmdType operation);
88 static void ExecCheckXactReadOnly(Query *parsetree, CmdType operation);
89 static void EvalPlanQualStart(evalPlanQual *epq, EState *estate,
90 evalPlanQual *priorepq);
91 static void EvalPlanQualStop(evalPlanQual *epq);
93 /* end of local decls */
96 /* ----------------------------------------------------------------
99 * This routine must be called at the beginning of any execution of any
102 * Takes a QueryDesc previously created by CreateQueryDesc (it's not real
103 * clear why we bother to separate the two functions, but...). The tupDesc
104 * field of the QueryDesc is filled in to describe the tuples that will be
105 * returned, and the internal fields (estate and planstate) are set up.
107 * NB: the CurrentMemoryContext when this is called will become the parent
108 * of the per-query context used for this Executor invocation.
109 * ----------------------------------------------------------------
112 ExecutorStart(QueryDesc *queryDesc)
115 MemoryContext oldcontext;
117 /* sanity checks: queryDesc must not be started already */
118 Assert(queryDesc != NULL);
119 Assert(queryDesc->estate == NULL);
122 * Build EState, switch into per-query memory context for startup.
124 estate = CreateExecutorState();
125 queryDesc->estate = estate;
127 oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
130 * Fill in parameters, if any, from queryDesc
132 estate->es_param_list_info = queryDesc->params;
134 if (queryDesc->plantree->nParamExec > 0)
135 estate->es_param_exec_vals = (ParamExecData *)
136 palloc0(queryDesc->plantree->nParamExec * sizeof(ParamExecData));
138 estate->es_instrument = queryDesc->doInstrument;
141 * Make our own private copy of the current query snapshot data.
143 * This "freezes" our idea of which tuples are good and which are not for
144 * the life of this query, even if it outlives the current command and
147 estate->es_snapshot = CopyQuerySnapshot();
150 * Initialize the plan state tree
154 MemoryContextSwitchTo(oldcontext);
157 /* ----------------------------------------------------------------
160 * This is the main routine of the executor module. It accepts
161 * the query descriptor from the traffic cop and executes the
164 * ExecutorStart must have been called already.
166 * If direction is NoMovementScanDirection then nothing is done
167 * except to start up/shut down the destination. Otherwise,
168 * we retrieve up to 'count' tuples in the specified direction.
170 * Note: count = 0 is interpreted as no portal limit, i.e., run to
173 * ----------------------------------------------------------------
176 ExecutorRun(QueryDesc *queryDesc,
177 ScanDirection direction, long count)
182 DestReceiver *destfunc;
183 TupleTableSlot *result;
184 MemoryContext oldcontext;
187 Assert(queryDesc != NULL);
189 estate = queryDesc->estate;
191 Assert(estate != NULL);
194 * Switch into per-query memory context
196 oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
199 * extract information from the query descriptor and the query
202 operation = queryDesc->operation;
203 dest = queryDesc->dest;
206 * If the transaction is read-only, we need to check if any writes
207 * are planned to non-temporary tables. This is done here at this
208 * rather late stage so that we can handle EXPLAIN vs. EXPLAIN
211 ExecCheckXactReadOnly(queryDesc->parsetree, operation);
214 * startup tuple receiver
216 estate->es_processed = 0;
217 estate->es_lastoid = InvalidOid;
219 destfunc = DestToFunction(dest);
220 (*destfunc->setup) (destfunc, (int) operation,
221 queryDesc->portalName, queryDesc->tupDesc);
226 if (direction == NoMovementScanDirection)
229 result = ExecutePlan(estate,
230 queryDesc->planstate,
239 (*destfunc->cleanup) (destfunc);
241 MemoryContextSwitchTo(oldcontext);
246 /* ----------------------------------------------------------------
249 * This routine must be called at the end of execution of any
251 * ----------------------------------------------------------------
254 ExecutorEnd(QueryDesc *queryDesc)
257 MemoryContext oldcontext;
260 Assert(queryDesc != NULL);
262 estate = queryDesc->estate;
264 Assert(estate != NULL);
267 * Switch into per-query memory context to run ExecEndPlan
269 oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
271 ExecEndPlan(queryDesc->planstate, estate);
274 * Must switch out of context before destroying it
276 MemoryContextSwitchTo(oldcontext);
279 * Release EState and per-query memory context. This should release
280 * everything the executor has allocated.
282 FreeExecutorState(estate);
284 /* Reset queryDesc fields that no longer point to anything */
285 queryDesc->tupDesc = NULL;
286 queryDesc->estate = NULL;
287 queryDesc->planstate = NULL;
290 /* ----------------------------------------------------------------
293 * This routine may be called on an open queryDesc to rewind it
295 * ----------------------------------------------------------------
298 ExecutorRewind(QueryDesc *queryDesc)
301 MemoryContext oldcontext;
304 Assert(queryDesc != NULL);
306 estate = queryDesc->estate;
308 Assert(estate != NULL);
310 /* It's probably not sensible to rescan updating queries */
311 Assert(queryDesc->operation == CMD_SELECT);
314 * Switch into per-query memory context
316 oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
321 ExecReScan(queryDesc->planstate, NULL);
323 MemoryContextSwitchTo(oldcontext);
329 * Check access permissions for all relations listed in a range table.
332 ExecCheckRTPerms(List *rangeTable, CmdType operation)
336 foreach(lp, rangeTable)
338 RangeTblEntry *rte = lfirst(lp);
340 ExecCheckRTEPerms(rte, operation);
346 * Check access permissions for a single RTE.
349 ExecCheckRTEPerms(RangeTblEntry *rte, CmdType operation)
353 AclResult aclcheck_result;
356 * If it's a subquery, recursively examine its rangetable.
358 if (rte->rtekind == RTE_SUBQUERY)
360 ExecCheckRTPerms(rte->subquery->rtable, operation);
365 * Otherwise, only plain-relation RTEs need to be checked here.
366 * Function RTEs are checked by init_fcache when the function is prepared
367 * for execution. Join and special RTEs need no checks.
369 if (rte->rtekind != RTE_RELATION)
375 * userid to check as: current user unless we have a setuid
378 * Note: GetUserId() is presently fast enough that there's no harm in
379 * calling it separately for each RTE. If that stops being true, we
380 * could call it once in ExecCheckRTPerms and pass the userid down
381 * from there. But for now, no need for the extra clutter.
383 userid = rte->checkAsUser ? rte->checkAsUser : GetUserId();
385 #define CHECK(MODE) pg_class_aclcheck(relOid, userid, MODE)
387 if (rte->checkForRead)
389 aclcheck_result = CHECK(ACL_SELECT);
390 if (aclcheck_result != ACLCHECK_OK)
391 aclcheck_error(aclcheck_result, get_rel_name(relOid));
394 if (rte->checkForWrite)
397 * Note: write access in a SELECT context means SELECT FOR UPDATE.
398 * Right now we don't distinguish that from true update as far as
399 * permissions checks are concerned.
404 aclcheck_result = CHECK(ACL_INSERT);
408 aclcheck_result = CHECK(ACL_UPDATE);
411 aclcheck_result = CHECK(ACL_DELETE);
414 elog(ERROR, "ExecCheckRTEPerms: bogus operation %d",
416 aclcheck_result = ACLCHECK_OK; /* keep compiler quiet */
419 if (aclcheck_result != ACLCHECK_OK)
420 aclcheck_error(aclcheck_result, get_rel_name(relOid));
425 /* ===============================================================
426 * ===============================================================
427 static routines follow
428 * ===============================================================
429 * ===============================================================
434 ExecCheckXactReadOnly(Query *parsetree, CmdType operation)
439 /* CREATE TABLE AS or SELECT INTO */
440 if (operation == CMD_SELECT && parsetree->into != NULL)
443 if (operation == CMD_DELETE || operation == CMD_INSERT
444 || operation == CMD_UPDATE)
448 foreach(lp, parsetree->rtable)
450 RangeTblEntry *rte = lfirst(lp);
452 if (rte->rtekind != RTE_RELATION)
455 if (!rte->checkForWrite)
458 if (isTempNamespace(get_rel_namespace(rte->relid)))
468 elog(ERROR, "transaction is read-only");
472 /* ----------------------------------------------------------------
475 * Initializes the query plan: open files, allocate storage
476 * and start up the rule manager
477 * ----------------------------------------------------------------
480 InitPlan(QueryDesc *queryDesc)
482 CmdType operation = queryDesc->operation;
483 Query *parseTree = queryDesc->parsetree;
484 Plan *plan = queryDesc->plantree;
485 EState *estate = queryDesc->estate;
486 PlanState *planstate;
488 Relation intoRelationDesc;
493 * Do permissions checks. It's sufficient to examine the query's
494 * top rangetable here --- subplan RTEs will be checked during
497 ExecCheckRTPerms(parseTree->rtable, operation);
500 * get information from query descriptor
502 rangeTable = parseTree->rtable;
505 * initialize the node's execution state
507 estate->es_range_table = rangeTable;
510 * if there is a result relation, initialize result relation stuff
512 if (parseTree->resultRelation != 0 && operation != CMD_SELECT)
514 List *resultRelations = parseTree->resultRelations;
515 int numResultRelations;
516 ResultRelInfo *resultRelInfos;
518 if (resultRelations != NIL)
521 * Multiple result relations (due to inheritance)
522 * parseTree->resultRelations identifies them all
524 ResultRelInfo *resultRelInfo;
526 numResultRelations = length(resultRelations);
527 resultRelInfos = (ResultRelInfo *)
528 palloc(numResultRelations * sizeof(ResultRelInfo));
529 resultRelInfo = resultRelInfos;
530 while (resultRelations != NIL)
532 initResultRelInfo(resultRelInfo,
533 lfirsti(resultRelations),
537 resultRelations = lnext(resultRelations);
543 * Single result relation identified by
544 * parseTree->resultRelation
546 numResultRelations = 1;
547 resultRelInfos = (ResultRelInfo *) palloc(sizeof(ResultRelInfo));
548 initResultRelInfo(resultRelInfos,
549 parseTree->resultRelation,
554 estate->es_result_relations = resultRelInfos;
555 estate->es_num_result_relations = numResultRelations;
556 /* Initialize to first or only result rel */
557 estate->es_result_relation_info = resultRelInfos;
562 * if no result relation, then set state appropriately
564 estate->es_result_relations = NULL;
565 estate->es_num_result_relations = 0;
566 estate->es_result_relation_info = NULL;
570 * Detect whether we're doing SELECT INTO. If so, set the force_oids
571 * flag appropriately so that the plan tree will be initialized with
572 * the correct tuple descriptors.
574 do_select_into = false;
576 if (operation == CMD_SELECT && parseTree->into != NULL)
578 do_select_into = true;
580 * For now, always create OIDs in SELECT INTO; this is for backwards
581 * compatibility with pre-7.3 behavior. Eventually we might want
582 * to allow the user to choose.
584 estate->es_force_oids = true;
588 * Have to lock relations selected for update
590 estate->es_rowMark = NIL;
591 if (parseTree->rowMarks != NIL)
595 foreach(l, parseTree->rowMarks)
597 Index rti = lfirsti(l);
598 Oid relid = getrelid(rti, rangeTable);
602 relation = heap_open(relid, RowShareLock);
603 erm = (execRowMark *) palloc(sizeof(execRowMark));
604 erm->relation = relation;
606 snprintf(erm->resname, 32, "ctid%u", rti);
607 estate->es_rowMark = lappend(estate->es_rowMark, erm);
612 * initialize the executor "tuple" table. We need slots for all the
613 * plan nodes, plus possibly output slots for the junkfilter(s). At
614 * this point we aren't sure if we need junkfilters, so just add slots
615 * for them unconditionally.
618 int nSlots = ExecCountSlotsNode(plan);
620 if (parseTree->resultRelations != NIL)
621 nSlots += length(parseTree->resultRelations);
624 estate->es_tupleTable = ExecCreateTupleTable(nSlots);
627 /* mark EvalPlanQual not active */
628 estate->es_topPlan = plan;
629 estate->es_evalPlanQual = NULL;
630 estate->es_evTupleNull = NULL;
631 estate->es_evTuple = NULL;
632 estate->es_useEvalPlan = false;
635 * initialize the private state information for all the nodes in the
636 * query tree. This opens files, allocates storage and leaves us
637 * ready to start processing tuples.
639 planstate = ExecInitNode(plan, estate);
642 * Get the tuple descriptor describing the type of tuples to return.
643 * (this is especially important if we are creating a relation with
646 tupType = ExecGetTupType(planstate);
649 * Initialize the junk filter if needed. SELECT and INSERT queries need a
650 * filter if there are any junk attrs in the tlist. INSERT and SELECT
651 * INTO also need a filter if the top plan node is a scan node that's not
652 * doing projection (else we'll be scribbling on the scan tuple!) UPDATE
653 * and DELETE always need a filter, since there's always a junk 'ctid'
654 * attribute present --- no need to look first.
657 bool junk_filter_needed = false;
664 foreach(tlist, plan->targetlist)
666 TargetEntry *tle = (TargetEntry *) lfirst(tlist);
668 if (tle->resdom->resjunk)
670 junk_filter_needed = true;
674 if (!junk_filter_needed &&
675 (operation == CMD_INSERT || do_select_into))
677 if (IsA(planstate, SeqScanState) ||
678 IsA(planstate, IndexScanState) ||
679 IsA(planstate, TidScanState) ||
680 IsA(planstate, SubqueryScanState) ||
681 IsA(planstate, FunctionScanState))
683 if (planstate->ps_ProjInfo == NULL)
684 junk_filter_needed = true;
690 junk_filter_needed = true;
696 if (junk_filter_needed)
699 * If there are multiple result relations, each one needs its
700 * own junk filter. Note this is only possible for
701 * UPDATE/DELETE, so we can't be fooled by some needing a
702 * filter and some not.
704 if (parseTree->resultRelations != NIL)
706 PlanState **appendplans;
708 ResultRelInfo *resultRelInfo;
711 /* Top plan had better be an Append here. */
712 Assert(IsA(plan, Append));
713 Assert(((Append *) plan)->isTarget);
714 Assert(IsA(planstate, AppendState));
715 appendplans = ((AppendState *) planstate)->appendplans;
716 as_nplans = ((AppendState *) planstate)->as_nplans;
717 Assert(as_nplans == estate->es_num_result_relations);
718 resultRelInfo = estate->es_result_relations;
719 for (i = 0; i < as_nplans; i++)
721 PlanState *subplan = appendplans[i];
724 j = ExecInitJunkFilter(subplan->plan->targetlist,
725 ExecGetTupType(subplan),
726 ExecAllocTableSlot(estate->es_tupleTable));
727 resultRelInfo->ri_junkFilter = j;
732 * Set active junkfilter too; at this point ExecInitAppend
733 * has already selected an active result relation...
735 estate->es_junkFilter =
736 estate->es_result_relation_info->ri_junkFilter;
740 /* Normal case with just one JunkFilter */
743 j = ExecInitJunkFilter(planstate->plan->targetlist,
745 ExecAllocTableSlot(estate->es_tupleTable));
746 estate->es_junkFilter = j;
747 if (estate->es_result_relation_info)
748 estate->es_result_relation_info->ri_junkFilter = j;
750 /* For SELECT, want to return the cleaned tuple type */
751 if (operation == CMD_SELECT)
752 tupType = j->jf_cleanTupType;
756 estate->es_junkFilter = NULL;
760 * If doing SELECT INTO, initialize the "into" relation. We must wait
761 * till now so we have the "clean" result tuple type to create the
764 intoRelationDesc = (Relation) NULL;
775 * find namespace to create in, check permissions
777 intoName = parseTree->into->relname;
778 namespaceId = RangeVarGetCreationNamespace(parseTree->into);
780 aclresult = pg_namespace_aclcheck(namespaceId, GetUserId(),
782 if (aclresult != ACLCHECK_OK)
783 aclcheck_error(aclresult, get_namespace_name(namespaceId));
786 * have to copy tupType to get rid of constraints
788 tupdesc = CreateTupleDescCopy(tupType);
790 intoRelationId = heap_create_with_catalog(intoName,
796 allowSystemTableMods);
798 FreeTupleDesc(tupdesc);
801 * Advance command counter so that the newly-created
802 * relation's catalog tuples will be visible to heap_open.
804 CommandCounterIncrement();
807 * If necessary, create a TOAST table for the into
808 * relation. Note that AlterTableCreateToastTable ends
809 * with CommandCounterIncrement(), so that the TOAST table
810 * will be visible for insertion.
812 AlterTableCreateToastTable(intoRelationId, true);
815 * And open the constructed table for writing.
817 intoRelationDesc = heap_open(intoRelationId, AccessExclusiveLock);
820 estate->es_into_relation_descriptor = intoRelationDesc;
822 queryDesc->tupDesc = tupType;
823 queryDesc->planstate = planstate;
827 * Initialize ResultRelInfo data for one result relation
830 initResultRelInfo(ResultRelInfo *resultRelInfo,
831 Index resultRelationIndex,
835 Oid resultRelationOid;
836 Relation resultRelationDesc;
838 resultRelationOid = getrelid(resultRelationIndex, rangeTable);
839 resultRelationDesc = heap_open(resultRelationOid, RowExclusiveLock);
841 switch (resultRelationDesc->rd_rel->relkind)
843 case RELKIND_SEQUENCE:
844 elog(ERROR, "You can't change sequence relation %s",
845 RelationGetRelationName(resultRelationDesc));
847 case RELKIND_TOASTVALUE:
848 elog(ERROR, "You can't change toast relation %s",
849 RelationGetRelationName(resultRelationDesc));
852 elog(ERROR, "You can't change view relation %s",
853 RelationGetRelationName(resultRelationDesc));
857 MemSet(resultRelInfo, 0, sizeof(ResultRelInfo));
858 resultRelInfo->type = T_ResultRelInfo;
859 resultRelInfo->ri_RangeTableIndex = resultRelationIndex;
860 resultRelInfo->ri_RelationDesc = resultRelationDesc;
861 resultRelInfo->ri_NumIndices = 0;
862 resultRelInfo->ri_IndexRelationDescs = NULL;
863 resultRelInfo->ri_IndexRelationInfo = NULL;
864 /* make a copy so as not to depend on relcache info not changing... */
865 resultRelInfo->ri_TrigDesc = CopyTriggerDesc(resultRelationDesc->trigdesc);
866 resultRelInfo->ri_TrigFunctions = NULL;
867 resultRelInfo->ri_ConstraintExprs = NULL;
868 resultRelInfo->ri_junkFilter = NULL;
871 * If there are indices on the result relation, open them and save
872 * descriptors in the result relation info, so that we can add new
873 * index entries for the tuples we add/update. We need not do this
874 * for a DELETE, however, since deletion doesn't affect indexes.
876 if (resultRelationDesc->rd_rel->relhasindex &&
877 operation != CMD_DELETE)
878 ExecOpenIndices(resultRelInfo);
881 /* ----------------------------------------------------------------
884 * Cleans up the query plan -- closes files and frees up storage
886 * NOTE: we are no longer very worried about freeing storage per se
887 * in this code; FreeExecutorState should be guaranteed to release all
888 * memory that needs to be released. What we are worried about doing
889 * is closing relations and dropping buffer pins. Thus, for example,
890 * tuple tables must be cleared or dropped to ensure pins are released.
891 * ----------------------------------------------------------------
894 ExecEndPlan(PlanState *planstate, EState *estate)
896 ResultRelInfo *resultRelInfo;
901 * shut down any PlanQual processing we were doing
903 if (estate->es_evalPlanQual != NULL)
904 EndEvalPlanQual(estate);
907 * shut down the node-type-specific query processing
909 ExecEndNode(planstate);
912 * destroy the executor "tuple" table.
914 ExecDropTupleTable(estate->es_tupleTable, true);
915 estate->es_tupleTable = NULL;
918 * close the result relation(s) if any, but hold locks until xact
921 resultRelInfo = estate->es_result_relations;
922 for (i = estate->es_num_result_relations; i > 0; i--)
924 /* Close indices and then the relation itself */
925 ExecCloseIndices(resultRelInfo);
926 heap_close(resultRelInfo->ri_RelationDesc, NoLock);
931 * close the "into" relation if necessary, again keeping lock
933 if (estate->es_into_relation_descriptor != NULL)
934 heap_close(estate->es_into_relation_descriptor, NoLock);
937 * close any relations selected FOR UPDATE, again keeping locks
939 foreach(l, estate->es_rowMark)
941 execRowMark *erm = lfirst(l);
943 heap_close(erm->relation, NoLock);
947 /* ----------------------------------------------------------------
950 * processes the query plan to retrieve 'numberTuples' tuples in the
951 * direction specified.
953 * Retrieves all tuples if numberTuples is 0
955 * result is either a slot containing the last tuple in the case
956 * of a SELECT or NULL otherwise.
958 * Note: the ctid attribute is a 'junk' attribute that is removed before the
960 * ----------------------------------------------------------------
962 static TupleTableSlot *
963 ExecutePlan(EState *estate,
964 PlanState *planstate,
967 ScanDirection direction,
968 DestReceiver *destfunc)
970 JunkFilter *junkfilter;
971 TupleTableSlot *slot;
972 ItemPointer tupleid = NULL;
973 ItemPointerData tuple_ctid;
974 long current_tuple_count;
975 TupleTableSlot *result;
978 * initialize local variables
981 current_tuple_count = 0;
987 estate->es_direction = direction;
990 * Process BEFORE EACH STATEMENT triggers
995 ExecBSUpdateTriggers(estate, estate->es_result_relation_info);
998 ExecBSDeleteTriggers(estate, estate->es_result_relation_info);
1001 ExecBSInsertTriggers(estate, estate->es_result_relation_info);
1009 * Loop until we've processed the proper number of tuples from the
1015 /* Reset the per-output-tuple exprcontext */
1016 ResetPerTupleExprContext(estate);
1019 * Execute the plan and obtain a tuple
1022 if (estate->es_useEvalPlan)
1024 slot = EvalPlanQualNext(estate);
1025 if (TupIsNull(slot))
1026 slot = ExecProcNode(planstate);
1029 slot = ExecProcNode(planstate);
1032 * if the tuple is null, then we assume there is nothing more to
1033 * process so we just return null...
1035 if (TupIsNull(slot))
1042 * if we have a junk filter, then project a new tuple with the
1045 * Store this new "clean" tuple in the junkfilter's resultSlot.
1046 * (Formerly, we stored it back over the "dirty" tuple, which is
1047 * WRONG because that tuple slot has the wrong descriptor.)
1049 * Also, extract all the junk information we need.
1051 if ((junkfilter = estate->es_junkFilter) != (JunkFilter *) NULL)
1058 * extract the 'ctid' junk attribute.
1060 if (operation == CMD_UPDATE || operation == CMD_DELETE)
1062 if (!ExecGetJunkAttribute(junkfilter,
1067 elog(ERROR, "ExecutePlan: NO (junk) `ctid' was found!");
1069 /* shouldn't ever get a null result... */
1071 elog(ERROR, "ExecutePlan: (junk) `ctid' is NULL!");
1073 tupleid = (ItemPointer) DatumGetPointer(datum);
1074 tuple_ctid = *tupleid; /* make sure we don't free the
1076 tupleid = &tuple_ctid;
1078 else if (estate->es_rowMark != NIL)
1083 foreach(l, estate->es_rowMark)
1085 execRowMark *erm = lfirst(l);
1087 HeapTupleData tuple;
1088 TupleTableSlot *newSlot;
1091 if (!ExecGetJunkAttribute(junkfilter,
1096 elog(ERROR, "ExecutePlan: NO (junk) `%s' was found!",
1099 /* shouldn't ever get a null result... */
1101 elog(ERROR, "ExecutePlan: (junk) `%s' is NULL!",
1104 tuple.t_self = *((ItemPointer) DatumGetPointer(datum));
1105 test = heap_mark4update(erm->relation, &tuple, &buffer,
1106 estate->es_snapshot->curcid);
1107 ReleaseBuffer(buffer);
1110 case HeapTupleSelfUpdated:
1111 /* treat it as deleted; do not process */
1114 case HeapTupleMayBeUpdated:
1117 case HeapTupleUpdated:
1118 if (XactIsoLevel == XACT_SERIALIZABLE)
1119 elog(ERROR, "Can't serialize access due to concurrent update");
1120 if (!(ItemPointerEquals(&(tuple.t_self),
1121 (ItemPointer) DatumGetPointer(datum))))
1123 newSlot = EvalPlanQual(estate, erm->rti, &(tuple.t_self));
1124 if (!(TupIsNull(newSlot)))
1127 estate->es_useEvalPlan = true;
1133 * if tuple was deleted or PlanQual failed for
1134 * updated tuple - we must not return this
1140 elog(ERROR, "Unknown status %u from heap_mark4update", test);
1147 * Finally create a new "clean" tuple with all junk attributes
1150 newTuple = ExecRemoveJunk(junkfilter, slot);
1152 slot = ExecStoreTuple(newTuple, /* tuple to store */
1153 junkfilter->jf_resultSlot, /* dest slot */
1154 InvalidBuffer, /* this tuple has no
1156 true); /* tuple should be pfreed */
1160 * now that we have a tuple, do the appropriate thing with it..
1161 * either return it to the user, add it to a relation someplace,
1162 * delete it from a relation, or modify some of its attributes.
1167 ExecSelect(slot, /* slot containing tuple */
1168 destfunc, /* destination's tuple-receiver
1175 ExecInsert(slot, tupleid, estate);
1180 ExecDelete(slot, tupleid, estate);
1185 ExecUpdate(slot, tupleid, estate);
1190 elog(LOG, "ExecutePlan: unknown operation in queryDesc");
1196 * check our tuple count.. if we've processed the proper number
1197 * then quit, else loop again and process more tuples. Zero
1198 * numberTuples means no limit.
1200 current_tuple_count++;
1201 if (numberTuples && numberTuples == current_tuple_count)
1206 * Process AFTER EACH STATEMENT triggers
1211 ExecASUpdateTriggers(estate, estate->es_result_relation_info);
1214 ExecASDeleteTriggers(estate, estate->es_result_relation_info);
1217 ExecASInsertTriggers(estate, estate->es_result_relation_info);
1225 * here, result is either a slot containing a tuple in the case of a
1226 * SELECT or NULL otherwise.
1231 /* ----------------------------------------------------------------
1234 * SELECTs are easy.. we just pass the tuple to the appropriate
1235 * print function. The only complexity is when we do a
1236 * "SELECT INTO", in which case we insert the tuple into
1237 * the appropriate relation (note: this is a newly created relation
1238 * so we don't need to worry about indices or locks.)
1239 * ----------------------------------------------------------------
1242 ExecSelect(TupleTableSlot *slot,
1243 DestReceiver *destfunc,
1250 * get the heap tuple out of the tuple table slot
1253 attrtype = slot->ttc_tupleDescriptor;
1256 * insert the tuple into the "into relation"
1258 if (estate->es_into_relation_descriptor != NULL)
1260 heap_insert(estate->es_into_relation_descriptor, tuple,
1261 estate->es_snapshot->curcid);
1266 * send the tuple to the front end (or the screen)
1268 (*destfunc->receiveTuple) (tuple, attrtype, destfunc);
1270 (estate->es_processed)++;
1273 /* ----------------------------------------------------------------
1276 * INSERTs are trickier.. we have to insert the tuple into
1277 * the base relation and insert appropriate tuples into the
1279 * ----------------------------------------------------------------
1282 ExecInsert(TupleTableSlot *slot,
1283 ItemPointer tupleid,
1287 ResultRelInfo *resultRelInfo;
1288 Relation resultRelationDesc;
1293 * get the heap tuple out of the tuple table slot
1298 * get information on the (current) result relation
1300 resultRelInfo = estate->es_result_relation_info;
1301 resultRelationDesc = resultRelInfo->ri_RelationDesc;
1303 /* BEFORE ROW INSERT Triggers */
1304 if (resultRelInfo->ri_TrigDesc &&
1305 resultRelInfo->ri_TrigDesc->n_before_row[TRIGGER_EVENT_INSERT] > 0)
1309 newtuple = ExecBRInsertTriggers(estate, resultRelInfo, tuple);
1311 if (newtuple == NULL) /* "do nothing" */
1314 if (newtuple != tuple) /* modified by Trigger(s) */
1317 * Insert modified tuple into tuple table slot, replacing the
1318 * original. We assume that it was allocated in per-tuple
1319 * memory context, and therefore will go away by itself. The
1320 * tuple table slot should not try to clear it.
1322 ExecStoreTuple(newtuple, slot, InvalidBuffer, false);
1328 * Check the constraints of the tuple
1330 if (resultRelationDesc->rd_att->constr)
1331 ExecConstraints("ExecInsert", resultRelInfo, slot, estate);
1336 newId = heap_insert(resultRelationDesc, tuple,
1337 estate->es_snapshot->curcid);
1340 (estate->es_processed)++;
1341 estate->es_lastoid = newId;
1342 setLastTid(&(tuple->t_self));
1347 * Note: heap_insert adds a new tuple to a relation. As a side effect,
1348 * the tupleid of the new tuple is placed in the new tuple's t_ctid
1351 numIndices = resultRelInfo->ri_NumIndices;
1353 ExecInsertIndexTuples(slot, &(tuple->t_self), estate, false);
1355 /* AFTER ROW INSERT Triggers */
1356 ExecARInsertTriggers(estate, resultRelInfo, tuple);
1359 /* ----------------------------------------------------------------
1362 * DELETE is like UPDATE, we delete the tuple and its
1364 * ----------------------------------------------------------------
1367 ExecDelete(TupleTableSlot *slot,
1368 ItemPointer tupleid,
1371 ResultRelInfo *resultRelInfo;
1372 Relation resultRelationDesc;
1373 ItemPointerData ctid;
1377 * get information on the (current) result relation
1379 resultRelInfo = estate->es_result_relation_info;
1380 resultRelationDesc = resultRelInfo->ri_RelationDesc;
1382 /* BEFORE ROW DELETE Triggers */
1383 if (resultRelInfo->ri_TrigDesc &&
1384 resultRelInfo->ri_TrigDesc->n_before_row[TRIGGER_EVENT_DELETE] > 0)
1388 dodelete = ExecBRDeleteTriggers(estate, resultRelInfo, tupleid);
1390 if (!dodelete) /* "do nothing" */
1398 result = heap_delete(resultRelationDesc, tupleid,
1400 estate->es_snapshot->curcid);
1403 case HeapTupleSelfUpdated:
1404 /* already deleted by self; nothing to do */
1407 case HeapTupleMayBeUpdated:
1410 case HeapTupleUpdated:
1411 if (XactIsoLevel == XACT_SERIALIZABLE)
1412 elog(ERROR, "Can't serialize access due to concurrent update");
1413 else if (!(ItemPointerEquals(tupleid, &ctid)))
1415 TupleTableSlot *epqslot = EvalPlanQual(estate,
1416 resultRelInfo->ri_RangeTableIndex, &ctid);
1418 if (!TupIsNull(epqslot))
1424 /* tuple already deleted; nothing to do */
1428 elog(ERROR, "Unknown status %u from heap_delete", result);
1433 (estate->es_processed)++;
1436 * Note: Normally one would think that we have to delete index tuples
1437 * associated with the heap tuple now..
1439 * ... but in POSTGRES, we have no need to do this because the vacuum
1440 * daemon automatically opens an index scan and deletes index tuples
1441 * when it finds deleted heap tuples. -cim 9/27/89
1444 /* AFTER ROW DELETE Triggers */
1445 ExecARDeleteTriggers(estate, resultRelInfo, tupleid);
1448 /* ----------------------------------------------------------------
1451 * note: we can't run UPDATE queries with transactions
1452 * off because UPDATEs are actually INSERTs and our
1453 * scan will mistakenly loop forever, updating the tuple
1454 * it just inserted.. This should be fixed but until it
1455 * is, we don't want to get stuck in an infinite loop
1456 * which corrupts your database..
1457 * ----------------------------------------------------------------
1460 ExecUpdate(TupleTableSlot *slot,
1461 ItemPointer tupleid,
1465 ResultRelInfo *resultRelInfo;
1466 Relation resultRelationDesc;
1467 ItemPointerData ctid;
1472 * abort the operation if not running transactions
1474 if (IsBootstrapProcessingMode())
1476 elog(WARNING, "ExecUpdate: UPDATE can't run without transactions");
1481 * get the heap tuple out of the tuple table slot
1486 * get information on the (current) result relation
1488 resultRelInfo = estate->es_result_relation_info;
1489 resultRelationDesc = resultRelInfo->ri_RelationDesc;
1491 /* BEFORE ROW UPDATE Triggers */
1492 if (resultRelInfo->ri_TrigDesc &&
1493 resultRelInfo->ri_TrigDesc->n_before_row[TRIGGER_EVENT_UPDATE] > 0)
1497 newtuple = ExecBRUpdateTriggers(estate, resultRelInfo,
1500 if (newtuple == NULL) /* "do nothing" */
1503 if (newtuple != tuple) /* modified by Trigger(s) */
1506 * Insert modified tuple into tuple table slot, replacing the
1507 * original. We assume that it was allocated in per-tuple
1508 * memory context, and therefore will go away by itself. The
1509 * tuple table slot should not try to clear it.
1511 ExecStoreTuple(newtuple, slot, InvalidBuffer, false);
1517 * Check the constraints of the tuple
1519 * If we generate a new candidate tuple after EvalPlanQual testing, we
1520 * must loop back here and recheck constraints. (We don't need to
1521 * redo triggers, however. If there are any BEFORE triggers then
1522 * trigger.c will have done mark4update to lock the correct tuple, so
1523 * there's no need to do them again.)
1526 if (resultRelationDesc->rd_att->constr)
1527 ExecConstraints("ExecUpdate", resultRelInfo, slot, estate);
1530 * replace the heap tuple
1532 result = heap_update(resultRelationDesc, tupleid, tuple,
1534 estate->es_snapshot->curcid);
1537 case HeapTupleSelfUpdated:
1538 /* already deleted by self; nothing to do */
1541 case HeapTupleMayBeUpdated:
1544 case HeapTupleUpdated:
1545 if (XactIsoLevel == XACT_SERIALIZABLE)
1546 elog(ERROR, "Can't serialize access due to concurrent update");
1547 else if (!(ItemPointerEquals(tupleid, &ctid)))
1549 TupleTableSlot *epqslot = EvalPlanQual(estate,
1550 resultRelInfo->ri_RangeTableIndex, &ctid);
1552 if (!TupIsNull(epqslot))
1555 tuple = ExecRemoveJunk(estate->es_junkFilter, epqslot);
1556 slot = ExecStoreTuple(tuple,
1557 estate->es_junkFilter->jf_resultSlot,
1558 InvalidBuffer, true);
1562 /* tuple already deleted; nothing to do */
1566 elog(ERROR, "Unknown status %u from heap_update", result);
1571 (estate->es_processed)++;
1574 * Note: instead of having to update the old index tuples associated
1575 * with the heap tuple, all we do is form and insert new index tuples.
1576 * This is because UPDATEs are actually DELETEs and INSERTs and index
1577 * tuple deletion is done automagically by the vacuum daemon. All we
1578 * do is insert new index tuples. -cim 9/27/89
1584 * heap_update updates a tuple in the base relation by invalidating it
1585 * and then inserting a new tuple to the relation. As a side effect,
1586 * the tupleid of the new tuple is placed in the new tuple's t_ctid
1587 * field. So we now insert index tuples using the new tupleid stored
1591 numIndices = resultRelInfo->ri_NumIndices;
1593 ExecInsertIndexTuples(slot, &(tuple->t_self), estate, false);
1595 /* AFTER ROW UPDATE Triggers */
1596 ExecARUpdateTriggers(estate, resultRelInfo, tupleid, tuple);
1600 ExecRelCheck(ResultRelInfo *resultRelInfo,
1601 TupleTableSlot *slot, EState *estate)
1603 Relation rel = resultRelInfo->ri_RelationDesc;
1604 int ncheck = rel->rd_att->constr->num_check;
1605 ConstrCheck *check = rel->rd_att->constr->check;
1606 ExprContext *econtext;
1607 MemoryContext oldContext;
1612 * If first time through for this result relation, build expression
1613 * nodetrees for rel's constraint expressions. Keep them in the
1614 * per-query memory context so they'll survive throughout the query.
1616 if (resultRelInfo->ri_ConstraintExprs == NULL)
1618 oldContext = MemoryContextSwitchTo(estate->es_query_cxt);
1619 resultRelInfo->ri_ConstraintExprs =
1620 (List **) palloc(ncheck * sizeof(List *));
1621 for (i = 0; i < ncheck; i++)
1623 qual = (List *) stringToNode(check[i].ccbin);
1624 resultRelInfo->ri_ConstraintExprs[i] = (List *)
1625 ExecPrepareExpr((Expr *) qual, estate);
1627 MemoryContextSwitchTo(oldContext);
1631 * We will use the EState's per-tuple context for evaluating
1632 * constraint expressions (creating it if it's not already there).
1634 econtext = GetPerTupleExprContext(estate);
1636 /* Arrange for econtext's scan tuple to be the tuple under test */
1637 econtext->ecxt_scantuple = slot;
1639 /* And evaluate the constraints */
1640 for (i = 0; i < ncheck; i++)
1642 qual = resultRelInfo->ri_ConstraintExprs[i];
1645 * NOTE: SQL92 specifies that a NULL result from a constraint
1646 * expression is not to be treated as a failure. Therefore, tell
1647 * ExecQual to return TRUE for NULL.
1649 if (!ExecQual(qual, econtext, true))
1650 return check[i].ccname;
1653 /* NULL result means no error */
1654 return (char *) NULL;
1658 ExecConstraints(const char *caller, ResultRelInfo *resultRelInfo,
1659 TupleTableSlot *slot, EState *estate)
1661 Relation rel = resultRelInfo->ri_RelationDesc;
1662 HeapTuple tuple = slot->val;
1663 TupleConstr *constr = rel->rd_att->constr;
1667 if (constr->has_not_null)
1669 int natts = rel->rd_att->natts;
1672 for (attrChk = 1; attrChk <= natts; attrChk++)
1674 if (rel->rd_att->attrs[attrChk - 1]->attnotnull &&
1675 heap_attisnull(tuple, attrChk))
1676 elog(ERROR, "%s: Fail to add null value in not null attribute %s",
1677 caller, NameStr(rel->rd_att->attrs[attrChk - 1]->attname));
1681 if (constr->num_check > 0)
1685 if ((failed = ExecRelCheck(resultRelInfo, slot, estate)) != NULL)
1686 elog(ERROR, "%s: rejected due to CHECK constraint \"%s\" on \"%s\"",
1687 caller, failed, RelationGetRelationName(rel));
1692 * Check a modified tuple to see if we want to process its updated version
1693 * under READ COMMITTED rules.
1695 * See backend/executor/README for some info about how this works.
1698 EvalPlanQual(EState *estate, Index rti, ItemPointer tid)
1703 HeapTupleData tuple;
1704 HeapTuple copyTuple = NULL;
1710 * find relation containing target tuple
1712 if (estate->es_result_relation_info != NULL &&
1713 estate->es_result_relation_info->ri_RangeTableIndex == rti)
1714 relation = estate->es_result_relation_info->ri_RelationDesc;
1720 foreach(l, estate->es_rowMark)
1722 if (((execRowMark *) lfirst(l))->rti == rti)
1724 relation = ((execRowMark *) lfirst(l))->relation;
1728 if (relation == NULL)
1729 elog(ERROR, "EvalPlanQual: can't find RTE %d", (int) rti);
1735 * Loop here to deal with updated or busy tuples
1737 tuple.t_self = *tid;
1742 if (heap_fetch(relation, SnapshotDirty, &tuple, &buffer, false, NULL))
1744 TransactionId xwait = SnapshotDirty->xmax;
1746 if (TransactionIdIsValid(SnapshotDirty->xmin))
1747 elog(ERROR, "EvalPlanQual: t_xmin is uncommitted ?!");
1750 * If tuple is being updated by other transaction then we have
1751 * to wait for its commit/abort.
1753 if (TransactionIdIsValid(xwait))
1755 ReleaseBuffer(buffer);
1756 XactLockTableWait(xwait);
1761 * We got tuple - now copy it for use by recheck query.
1763 copyTuple = heap_copytuple(&tuple);
1764 ReleaseBuffer(buffer);
1769 * Oops! Invalid tuple. Have to check is it updated or deleted.
1770 * Note that it's possible to get invalid SnapshotDirty->tid if
1771 * tuple updated by this transaction. Have we to check this ?
1773 if (ItemPointerIsValid(&(SnapshotDirty->tid)) &&
1774 !(ItemPointerEquals(&(tuple.t_self), &(SnapshotDirty->tid))))
1776 /* updated, so look at the updated copy */
1777 tuple.t_self = SnapshotDirty->tid;
1782 * Deleted or updated by this transaction; forget it.
1788 * For UPDATE/DELETE we have to return tid of actual row we're
1791 *tid = tuple.t_self;
1794 * Need to run a recheck subquery. Find or create a PQ stack entry.
1796 epq = estate->es_evalPlanQual;
1799 if (epq != NULL && epq->rti == 0)
1801 /* Top PQ stack entry is idle, so re-use it */
1802 Assert(!(estate->es_useEvalPlan) && epq->next == NULL);
1808 * If this is request for another RTE - Ra, - then we have to check
1809 * wasn't PlanQual requested for Ra already and if so then Ra' row was
1810 * updated again and we have to re-start old execution for Ra and
1811 * forget all what we done after Ra was suspended. Cool? -:))
1813 if (epq != NULL && epq->rti != rti &&
1814 epq->estate->es_evTuple[rti - 1] != NULL)
1818 evalPlanQual *oldepq;
1820 /* stop execution */
1821 EvalPlanQualStop(epq);
1822 /* pop previous PlanQual from the stack */
1824 Assert(oldepq && oldepq->rti != 0);
1825 /* push current PQ to freePQ stack */
1828 estate->es_evalPlanQual = epq;
1829 } while (epq->rti != rti);
1833 * If we are requested for another RTE then we have to suspend
1834 * execution of current PlanQual and start execution for new one.
1836 if (epq == NULL || epq->rti != rti)
1838 /* try to reuse plan used previously */
1839 evalPlanQual *newepq = (epq != NULL) ? epq->free : NULL;
1841 if (newepq == NULL) /* first call or freePQ stack is empty */
1843 newepq = (evalPlanQual *) palloc0(sizeof(evalPlanQual));
1844 newepq->free = NULL;
1845 newepq->estate = NULL;
1846 newepq->planstate = NULL;
1850 /* recycle previously used PlanQual */
1851 Assert(newepq->estate == NULL);
1854 /* push current PQ to the stack */
1857 estate->es_evalPlanQual = epq;
1862 Assert(epq->rti == rti);
1865 * Ok - we're requested for the same RTE. Unfortunately we still have
1866 * to end and restart execution of the plan, because ExecReScan
1867 * wouldn't ensure that upper plan nodes would reset themselves. We
1868 * could make that work if insertion of the target tuple were
1869 * integrated with the Param mechanism somehow, so that the upper plan
1870 * nodes know that their children's outputs have changed.
1872 * Note that the stack of free evalPlanQual nodes is quite useless at
1873 * the moment, since it only saves us from pallocing/releasing the
1874 * evalPlanQual nodes themselves. But it will be useful once we
1875 * implement ReScan instead of end/restart for re-using PlanQual nodes.
1879 /* stop execution */
1880 EvalPlanQualStop(epq);
1884 * Initialize new recheck query.
1886 * Note: if we were re-using PlanQual plans via ExecReScan, we'd need
1887 * to instead copy down changeable state from the top plan (including
1888 * es_result_relation_info, es_junkFilter) and reset locally changeable
1889 * state in the epq (including es_param_exec_vals, es_evTupleNull).
1891 EvalPlanQualStart(epq, estate, epq->next);
1894 * free old RTE' tuple, if any, and store target tuple where
1895 * relation's scan node will see it
1897 epqstate = epq->estate;
1898 if (epqstate->es_evTuple[rti - 1] != NULL)
1899 heap_freetuple(epqstate->es_evTuple[rti - 1]);
1900 epqstate->es_evTuple[rti - 1] = copyTuple;
1902 return EvalPlanQualNext(estate);
1905 static TupleTableSlot *
1906 EvalPlanQualNext(EState *estate)
1908 evalPlanQual *epq = estate->es_evalPlanQual;
1909 MemoryContext oldcontext;
1910 TupleTableSlot *slot;
1912 Assert(epq->rti != 0);
1915 oldcontext = MemoryContextSwitchTo(epq->estate->es_query_cxt);
1916 slot = ExecProcNode(epq->planstate);
1917 MemoryContextSwitchTo(oldcontext);
1920 * No more tuples for this PQ. Continue previous one.
1922 if (TupIsNull(slot))
1924 evalPlanQual *oldepq;
1926 /* stop execution */
1927 EvalPlanQualStop(epq);
1928 /* pop old PQ from the stack */
1932 /* this is the first (oldest) PQ - mark as free */
1934 estate->es_useEvalPlan = false;
1935 /* and continue Query execution */
1938 Assert(oldepq->rti != 0);
1939 /* push current PQ to freePQ stack */
1942 estate->es_evalPlanQual = epq;
1950 EndEvalPlanQual(EState *estate)
1952 evalPlanQual *epq = estate->es_evalPlanQual;
1954 if (epq->rti == 0) /* plans already shutdowned */
1956 Assert(epq->next == NULL);
1962 evalPlanQual *oldepq;
1964 /* stop execution */
1965 EvalPlanQualStop(epq);
1966 /* pop old PQ from the stack */
1970 /* this is the first (oldest) PQ - mark as free */
1972 estate->es_useEvalPlan = false;
1975 Assert(oldepq->rti != 0);
1976 /* push current PQ to freePQ stack */
1979 estate->es_evalPlanQual = epq;
1984 * Start execution of one level of PlanQual.
1986 * This is a cut-down version of ExecutorStart(): we copy some state from
1987 * the top-level estate rather than initializing it fresh.
1990 EvalPlanQualStart(evalPlanQual *epq, EState *estate, evalPlanQual *priorepq)
1994 MemoryContext oldcontext;
1996 rtsize = length(estate->es_range_table);
1998 epq->estate = epqstate = CreateExecutorState();
2000 oldcontext = MemoryContextSwitchTo(epqstate->es_query_cxt);
2003 * The epqstates share the top query's copy of unchanging state such
2004 * as the snapshot, rangetable, result-rel info, and external Param info.
2005 * They need their own copies of local state, including a tuple table,
2006 * es_param_exec_vals, etc.
2008 epqstate->es_direction = ForwardScanDirection;
2009 epqstate->es_snapshot = estate->es_snapshot;
2010 epqstate->es_range_table = estate->es_range_table;
2011 epqstate->es_result_relations = estate->es_result_relations;
2012 epqstate->es_num_result_relations = estate->es_num_result_relations;
2013 epqstate->es_result_relation_info = estate->es_result_relation_info;
2014 epqstate->es_junkFilter = estate->es_junkFilter;
2015 epqstate->es_into_relation_descriptor = estate->es_into_relation_descriptor;
2016 epqstate->es_param_list_info = estate->es_param_list_info;
2017 if (estate->es_topPlan->nParamExec > 0)
2018 epqstate->es_param_exec_vals = (ParamExecData *)
2019 palloc0(estate->es_topPlan->nParamExec * sizeof(ParamExecData));
2020 epqstate->es_rowMark = estate->es_rowMark;
2021 epqstate->es_instrument = estate->es_instrument;
2022 epqstate->es_force_oids = estate->es_force_oids;
2023 epqstate->es_topPlan = estate->es_topPlan;
2025 * Each epqstate must have its own es_evTupleNull state, but
2026 * all the stack entries share es_evTuple state. This allows
2027 * sub-rechecks to inherit the value being examined by an
2030 epqstate->es_evTupleNull = (bool *) palloc0(rtsize * sizeof(bool));
2031 if (priorepq == NULL)
2032 /* first PQ stack entry */
2033 epqstate->es_evTuple = (HeapTuple *)
2034 palloc0(rtsize * sizeof(HeapTuple));
2036 /* later stack entries share the same storage */
2037 epqstate->es_evTuple = priorepq->estate->es_evTuple;
2039 epqstate->es_tupleTable =
2040 ExecCreateTupleTable(estate->es_tupleTable->size);
2042 epq->planstate = ExecInitNode(estate->es_topPlan, epqstate);
2044 MemoryContextSwitchTo(oldcontext);
2048 * End execution of one level of PlanQual.
2050 * This is a cut-down version of ExecutorEnd(); basically we want to do most
2051 * of the normal cleanup, but *not* close result relations (which we are
2052 * just sharing from the outer query).
2055 EvalPlanQualStop(evalPlanQual *epq)
2057 EState *epqstate = epq->estate;
2058 MemoryContext oldcontext;
2060 oldcontext = MemoryContextSwitchTo(epqstate->es_query_cxt);
2062 ExecEndNode(epq->planstate);
2064 ExecDropTupleTable(epqstate->es_tupleTable, true);
2065 epqstate->es_tupleTable = NULL;
2067 if (epqstate->es_evTuple[epq->rti - 1] != NULL)
2069 heap_freetuple(epqstate->es_evTuple[epq->rti - 1]);
2070 epqstate->es_evTuple[epq->rti - 1] = NULL;
2073 MemoryContextSwitchTo(oldcontext);
2075 FreeExecutorState(epqstate);
2078 epq->planstate = NULL;