PostgreSQL Source Code  git master
executor.h File Reference
Include dependency graph for executor.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

struct  TupOutputState
 

Macros

#define EXEC_FLAG_EXPLAIN_ONLY   0x0001 /* EXPLAIN, no ANALYZE */
 
#define EXEC_FLAG_REWIND   0x0002 /* need efficient rescan */
 
#define EXEC_FLAG_BACKWARD   0x0004 /* need backward scan */
 
#define EXEC_FLAG_MARK   0x0008 /* need mark/restore */
 
#define EXEC_FLAG_SKIP_TRIGGERS   0x0010 /* skip AfterTrigger calls */
 
#define EXEC_FLAG_WITH_OIDS   0x0020 /* force OIDs in returned tuples */
 
#define EXEC_FLAG_WITHOUT_OIDS   0x0040 /* force no OIDs in returned tuples */
 
#define EXEC_FLAG_WITH_NO_DATA   0x0080 /* rel scannability doesn't matter */
 
#define EvalPlanQualSetSlot(epqstate, slot)   ((epqstate)->origslot = (slot))
 
#define do_text_output_oneline(tstate, str_to_emit)
 
#define ResetExprContext(econtext)   MemoryContextReset((econtext)->ecxt_per_tuple_memory)
 
#define GetPerTupleExprContext(estate)
 
#define GetPerTupleMemoryContext(estate)   (GetPerTupleExprContext(estate)->ecxt_per_tuple_memory)
 
#define ResetPerTupleExprContext(estate)
 

Typedefs

typedef void(* ExecutorStart_hook_type) (QueryDesc *queryDesc, int eflags)
 
typedef void(* ExecutorRun_hook_type) (QueryDesc *queryDesc, ScanDirection direction, uint64 count, bool execute_once)
 
typedef void(* ExecutorFinish_hook_type) (QueryDesc *queryDesc)
 
typedef void(* ExecutorEnd_hook_type) (QueryDesc *queryDesc)
 
typedef bool(* ExecutorCheckPerms_hook_type) (List *, bool)
 
typedef TupleTableSlot *(* ExecScanAccessMtd) (ScanState *node)
 
typedef bool(* ExecScanRecheckMtd) (ScanState *node, TupleTableSlot *slot)
 
typedef struct TupOutputState TupOutputState
 

Functions

void ExecReScan (PlanState *node)
 
void ExecMarkPos (PlanState *node)
 
void ExecRestrPos (PlanState *node)
 
bool ExecSupportsMarkRestore (struct Path *pathnode)
 
bool ExecSupportsBackwardScan (Plan *node)
 
bool ExecMaterializesOutput (NodeTag plantype)
 
bool execCurrentOf (CurrentOfExpr *cexpr, ExprContext *econtext, Oid table_oid, ItemPointer current_tid)
 
bool execTuplesMatch (TupleTableSlot *slot1, TupleTableSlot *slot2, int numCols, AttrNumber *matchColIdx, FmgrInfo *eqfunctions, MemoryContext evalContext)
 
bool execTuplesUnequal (TupleTableSlot *slot1, TupleTableSlot *slot2, int numCols, AttrNumber *matchColIdx, FmgrInfo *eqfunctions, MemoryContext evalContext)
 
FmgrInfoexecTuplesMatchPrepare (int numCols, Oid *eqOperators)
 
void execTuplesHashPrepare (int numCols, Oid *eqOperators, FmgrInfo **eqFunctions, FmgrInfo **hashFunctions)
 
TupleHashTable BuildTupleHashTable (int numCols, AttrNumber *keyColIdx, FmgrInfo *eqfunctions, FmgrInfo *hashfunctions, long nbuckets, Size additionalsize, MemoryContext tablecxt, MemoryContext tempcxt, bool use_variable_hash_iv)
 
TupleHashEntry LookupTupleHashEntry (TupleHashTable hashtable, TupleTableSlot *slot, bool *isnew)
 
TupleHashEntry FindTupleHashEntry (TupleHashTable hashtable, TupleTableSlot *slot, FmgrInfo *eqfunctions, FmgrInfo *hashfunctions)
 
JunkFilterExecInitJunkFilter (List *targetList, bool hasoid, TupleTableSlot *slot)
 
JunkFilterExecInitJunkFilterConversion (List *targetList, TupleDesc cleanTupType, TupleTableSlot *slot)
 
AttrNumber ExecFindJunkAttribute (JunkFilter *junkfilter, const char *attrName)
 
AttrNumber ExecFindJunkAttributeInTlist (List *targetlist, const char *attrName)
 
Datum ExecGetJunkAttribute (TupleTableSlot *slot, AttrNumber attno, bool *isNull)
 
TupleTableSlotExecFilterJunk (JunkFilter *junkfilter, TupleTableSlot *slot)
 
void ExecutorStart (QueryDesc *queryDesc, int eflags)
 
void standard_ExecutorStart (QueryDesc *queryDesc, int eflags)
 
void ExecutorRun (QueryDesc *queryDesc, ScanDirection direction, uint64 count, bool execute_once)
 
void standard_ExecutorRun (QueryDesc *queryDesc, ScanDirection direction, uint64 count, bool execute_once)
 
void ExecutorFinish (QueryDesc *queryDesc)
 
void standard_ExecutorFinish (QueryDesc *queryDesc)
 
void ExecutorEnd (QueryDesc *queryDesc)
 
void standard_ExecutorEnd (QueryDesc *queryDesc)
 
void ExecutorRewind (QueryDesc *queryDesc)
 
bool ExecCheckRTPerms (List *rangeTable, bool ereport_on_violation)
 
void CheckValidResultRel (ResultRelInfo *resultRelInfo, CmdType operation)
 
void InitResultRelInfo (ResultRelInfo *resultRelInfo, Relation resultRelationDesc, Index resultRelationIndex, Relation partition_root, int instrument_options)
 
ResultRelInfoExecGetTriggerResultRel (EState *estate, Oid relid)
 
void ExecCleanUpTriggerState (EState *estate)
 
bool ExecContextForcesOids (PlanState *planstate, bool *hasoids)
 
void ExecConstraints (ResultRelInfo *resultRelInfo, TupleTableSlot *slot, EState *estate)
 
void ExecPartitionCheck (ResultRelInfo *resultRelInfo, TupleTableSlot *slot, EState *estate)
 
void ExecWithCheckOptions (WCOKind kind, ResultRelInfo *resultRelInfo, TupleTableSlot *slot, EState *estate)
 
LockTupleMode ExecUpdateLockMode (EState *estate, ResultRelInfo *relinfo)
 
ExecRowMarkExecFindRowMark (EState *estate, Index rti, bool missing_ok)
 
ExecAuxRowMarkExecBuildAuxRowMark (ExecRowMark *erm, List *targetlist)
 
TupleTableSlotEvalPlanQual (EState *estate, EPQState *epqstate, Relation relation, Index rti, int lockmode, ItemPointer tid, TransactionId priorXmax)
 
HeapTuple EvalPlanQualFetch (EState *estate, Relation relation, int lockmode, LockWaitPolicy wait_policy, ItemPointer tid, TransactionId priorXmax)
 
void EvalPlanQualInit (EPQState *epqstate, EState *estate, Plan *subplan, List *auxrowmarks, int epqParam)
 
void EvalPlanQualSetPlan (EPQState *epqstate, Plan *subplan, List *auxrowmarks)
 
void EvalPlanQualSetTuple (EPQState *epqstate, Index rti, HeapTuple tuple)
 
HeapTuple EvalPlanQualGetTuple (EPQState *epqstate, Index rti)
 
void EvalPlanQualFetchRowMarks (EPQState *epqstate)
 
TupleTableSlotEvalPlanQualNext (EPQState *epqstate)
 
void EvalPlanQualBegin (EPQState *epqstate, EState *parentestate)
 
void EvalPlanQualEnd (EPQState *epqstate)
 
PlanStateExecInitNode (Plan *node, EState *estate, int eflags)
 
NodeMultiExecProcNode (PlanState *node)
 
void ExecEndNode (PlanState *node)
 
bool ExecShutdownNode (PlanState *node)
 
void ExecSetTupleBound (int64 tuples_needed, PlanState *child_node)
 
static TupleTableSlotExecProcNode (PlanState *node)
 
ExprStateExecInitExpr (Expr *node, PlanState *parent)
 
ExprStateExecInitQual (List *qual, PlanState *parent)
 
ExprStateExecInitCheck (List *qual, PlanState *parent)
 
ListExecInitExprList (List *nodes, PlanState *parent)
 
ProjectionInfoExecBuildProjectionInfo (List *targetList, ExprContext *econtext, TupleTableSlot *slot, PlanState *parent, TupleDesc inputDesc)
 
ExprStateExecPrepareExpr (Expr *node, EState *estate)
 
ExprStateExecPrepareQual (List *qual, EState *estate)
 
ExprStateExecPrepareCheck (List *qual, EState *estate)
 
ListExecPrepareExprList (List *nodes, EState *estate)
 
static Datum ExecEvalExpr (ExprState *state, ExprContext *econtext, bool *isNull)
 
static Datum ExecEvalExprSwitchContext (ExprState *state, ExprContext *econtext, bool *isNull)
 
static TupleTableSlotExecProject (ProjectionInfo *projInfo)
 
static bool ExecQual (ExprState *state, ExprContext *econtext)
 
bool ExecCheck (ExprState *state, ExprContext *context)
 
SetExprStateExecInitTableFunctionResult (Expr *expr, ExprContext *econtext, PlanState *parent)
 
TuplestorestateExecMakeTableFunctionResult (SetExprState *setexpr, ExprContext *econtext, MemoryContext argContext, TupleDesc expectedDesc, bool randomAccess)
 
SetExprStateExecInitFunctionResultSet (Expr *expr, ExprContext *econtext, PlanState *parent)
 
Datum ExecMakeFunctionResultSet (SetExprState *fcache, ExprContext *econtext, MemoryContext argContext, bool *isNull, ExprDoneCond *isDone)
 
TupleTableSlotExecScan (ScanState *node, ExecScanAccessMtd accessMtd, ExecScanRecheckMtd recheckMtd)
 
void ExecAssignScanProjectionInfo (ScanState *node)
 
void ExecAssignScanProjectionInfoWithVarno (ScanState *node, Index varno)
 
void ExecScanReScan (ScanState *node)
 
void ExecInitResultTupleSlot (EState *estate, PlanState *planstate)
 
void ExecInitScanTupleSlot (EState *estate, ScanState *scanstate)
 
TupleTableSlotExecInitExtraTupleSlot (EState *estate)
 
TupleTableSlotExecInitNullTupleSlot (EState *estate, TupleDesc tupType)
 
TupleDesc ExecTypeFromTL (List *targetList, bool hasoid)
 
TupleDesc ExecCleanTypeFromTL (List *targetList, bool hasoid)
 
TupleDesc ExecTypeFromExprList (List *exprList)
 
void ExecTypeSetColNames (TupleDesc typeInfo, List *namesList)
 
void UpdateChangedParamSet (PlanState *node, Bitmapset *newchg)
 
TupOutputStatebegin_tup_output_tupdesc (DestReceiver *dest, TupleDesc tupdesc)
 
void do_tup_output (TupOutputState *tstate, Datum *values, bool *isnull)
 
void do_text_output_multiline (TupOutputState *tstate, const char *txt)
 
void end_tup_output (TupOutputState *tstate)
 
EStateCreateExecutorState (void)
 
void FreeExecutorState (EState *estate)
 
ExprContextCreateExprContext (EState *estate)
 
ExprContextCreateStandaloneExprContext (void)
 
void FreeExprContext (ExprContext *econtext, bool isCommit)
 
void ReScanExprContext (ExprContext *econtext)
 
ExprContextMakePerTupleExprContext (EState *estate)
 
void ExecAssignExprContext (EState *estate, PlanState *planstate)
 
void ExecAssignResultType (PlanState *planstate, TupleDesc tupDesc)
 
void ExecAssignResultTypeFromTL (PlanState *planstate)
 
TupleDesc ExecGetResultType (PlanState *planstate)
 
void ExecAssignProjectionInfo (PlanState *planstate, TupleDesc inputDesc)
 
void ExecFreeExprContext (PlanState *planstate)
 
void ExecAssignScanType (ScanState *scanstate, TupleDesc tupDesc)
 
void ExecAssignScanTypeFromOuterPlan (ScanState *scanstate)
 
bool ExecRelationIsTargetRelation (EState *estate, Index scanrelid)
 
Relation ExecOpenScanRelation (EState *estate, Index scanrelid, int eflags)
 
void ExecCloseScanRelation (Relation scanrel)
 
int executor_errposition (EState *estate, int location)
 
void RegisterExprContextCallback (ExprContext *econtext, ExprContextCallbackFunction function, Datum arg)
 
void UnregisterExprContextCallback (ExprContext *econtext, ExprContextCallbackFunction function, Datum arg)
 
void ExecLockNonLeafAppendTables (List *partitioned_rels, EState *estate)
 
Datum GetAttributeByName (HeapTupleHeader tuple, const char *attname, bool *isNull)
 
Datum GetAttributeByNum (HeapTupleHeader tuple, AttrNumber attrno, bool *isNull)
 
int ExecTargetListLength (List *targetlist)
 
int ExecCleanTargetListLength (List *targetlist)
 
void ExecOpenIndices (ResultRelInfo *resultRelInfo, bool speculative)
 
void ExecCloseIndices (ResultRelInfo *resultRelInfo)
 
ListExecInsertIndexTuples (TupleTableSlot *slot, ItemPointer tupleid, EState *estate, bool noDupErr, bool *specConflict, List *arbiterIndexes)
 
bool ExecCheckIndexConstraints (TupleTableSlot *slot, EState *estate, ItemPointer conflictTid, List *arbiterIndexes)
 
void check_exclusion_constraint (Relation heap, Relation index, IndexInfo *indexInfo, ItemPointer tupleid, Datum *values, bool *isnull, EState *estate, bool newIndex)
 
bool RelationFindReplTupleByIndex (Relation rel, Oid idxoid, LockTupleMode lockmode, TupleTableSlot *searchslot, TupleTableSlot *outslot)
 
bool RelationFindReplTupleSeq (Relation rel, LockTupleMode lockmode, TupleTableSlot *searchslot, TupleTableSlot *outslot)
 
void ExecSimpleRelationInsert (EState *estate, TupleTableSlot *slot)
 
void ExecSimpleRelationUpdate (EState *estate, EPQState *epqstate, TupleTableSlot *searchslot, TupleTableSlot *slot)
 
void ExecSimpleRelationDelete (EState *estate, EPQState *epqstate, TupleTableSlot *searchslot)
 
void CheckCmdReplicaIdentity (Relation rel, CmdType cmd)
 
void CheckSubscriptionRelkind (char relkind, const char *nspname, const char *relname)
 

Variables

PGDLLIMPORT ExecutorStart_hook_type ExecutorStart_hook
 
PGDLLIMPORT ExecutorRun_hook_type ExecutorRun_hook
 
PGDLLIMPORT ExecutorFinish_hook_type ExecutorFinish_hook
 
PGDLLIMPORT ExecutorEnd_hook_type ExecutorEnd_hook
 
PGDLLIMPORT ExecutorCheckPerms_hook_type ExecutorCheckPerms_hook
 

Macro Definition Documentation

◆ do_text_output_oneline

#define do_text_output_oneline (   tstate,
  str_to_emit 
)
Value:
do { \
Datum values_[1]; \
bool isnull_[1]; \
values_[0] = PointerGetDatum(cstring_to_text(str_to_emit)); \
isnull_[0] = false; \
do_tup_output(tstate, values_, isnull_); \
pfree(DatumGetPointer(values_[0])); \
} while (0)
#define PointerGetDatum(X)
Definition: postgres.h:562
text * cstring_to_text(const char *s)
Definition: varlena.c:149
#define DatumGetPointer(X)
Definition: postgres.h:555

Definition at line 440 of file executor.h.

Referenced by ExplainQuery(), and ShowGUCConfigOption().

◆ EvalPlanQualSetSlot

#define EvalPlanQualSetSlot (   epqstate,
  slot 
)    ((epqstate)->origslot = (slot))

◆ EXEC_FLAG_BACKWARD

◆ EXEC_FLAG_EXPLAIN_ONLY

◆ EXEC_FLAG_MARK

◆ EXEC_FLAG_REWIND

◆ EXEC_FLAG_SKIP_TRIGGERS

#define EXEC_FLAG_SKIP_TRIGGERS   0x0010 /* skip AfterTrigger calls */

◆ EXEC_FLAG_WITH_NO_DATA

#define EXEC_FLAG_WITH_NO_DATA   0x0080 /* rel scannability doesn't matter */

Definition at line 65 of file executor.h.

Referenced by ExecOpenScanRelation(), GetIntoRelEFlags(), and InitPlan().

◆ EXEC_FLAG_WITH_OIDS

#define EXEC_FLAG_WITH_OIDS   0x0020 /* force OIDs in returned tuples */

Definition at line 63 of file executor.h.

Referenced by ExecContextForcesOids(), and GetIntoRelEFlags().

◆ EXEC_FLAG_WITHOUT_OIDS

#define EXEC_FLAG_WITHOUT_OIDS   0x0040 /* force no OIDs in returned tuples */

Definition at line 64 of file executor.h.

Referenced by ExecContextForcesOids(), GetIntoRelEFlags(), and refresh_matview_datafill().

◆ GetPerTupleExprContext

◆ GetPerTupleMemoryContext

◆ ResetExprContext

◆ ResetPerTupleExprContext

#define ResetPerTupleExprContext (   estate)
Value:
do { \
if ((estate)->es_per_tuple_exprcontext) \
ResetExprContext((estate)->es_per_tuple_exprcontext); \
} while (0)

Definition at line 476 of file executor.h.

Referenced by comparetup_cluster(), CopyFrom(), ExecModifyTable(), ExecPostprocessPlan(), and ExecutePlan().

Typedef Documentation

◆ ExecScanAccessMtd

typedef TupleTableSlot*(* ExecScanAccessMtd) (ScanState *node)

Definition at line 400 of file executor.h.

◆ ExecScanRecheckMtd

typedef bool(* ExecScanRecheckMtd) (ScanState *node, TupleTableSlot *slot)

Definition at line 401 of file executor.h.

◆ ExecutorCheckPerms_hook_type

typedef bool(* ExecutorCheckPerms_hook_type) (List *, bool)

Definition at line 88 of file executor.h.

◆ ExecutorEnd_hook_type

typedef void(* ExecutorEnd_hook_type) (QueryDesc *queryDesc)

Definition at line 84 of file executor.h.

◆ ExecutorFinish_hook_type

typedef void(* ExecutorFinish_hook_type) (QueryDesc *queryDesc)

Definition at line 80 of file executor.h.

◆ ExecutorRun_hook_type

typedef void(* ExecutorRun_hook_type) (QueryDesc *queryDesc, ScanDirection direction, uint64 count, bool execute_once)

Definition at line 73 of file executor.h.

◆ ExecutorStart_hook_type

typedef void(* ExecutorStart_hook_type) (QueryDesc *queryDesc, int eflags)

Definition at line 69 of file executor.h.

◆ TupOutputState

Function Documentation

◆ begin_tup_output_tupdesc()

TupOutputState* begin_tup_output_tupdesc ( DestReceiver dest,
TupleDesc  tupdesc 
)

Definition at line 1235 of file execTuples.c.

References CMD_SELECT, generate_unaccent_rules::dest, TupOutputState::dest, MakeSingleTupleTableSlot(), palloc(), _DestReceiver::rStartup, and TupOutputState::slot.

Referenced by CreateReplicationSlot(), ExplainQuery(), IdentifySystem(), ShowAllGUCConfig(), ShowGUCConfigOption(), and StartReplication().

1236 {
1237  TupOutputState *tstate;
1238 
1239  tstate = (TupOutputState *) palloc(sizeof(TupOutputState));
1240 
1241  tstate->slot = MakeSingleTupleTableSlot(tupdesc);
1242  tstate->dest = dest;
1243 
1244  tstate->dest->rStartup(tstate->dest, (int) CMD_SELECT, tupdesc);
1245 
1246  return tstate;
1247 }
TupleTableSlot * slot
Definition: executor.h:425
void(* rStartup)(DestReceiver *self, int operation, TupleDesc typeinfo)
Definition: dest.h:121
TupleTableSlot * MakeSingleTupleTableSlot(TupleDesc tupdesc)
Definition: execTuples.c:199
void * palloc(Size size)
Definition: mcxt.c:848
DestReceiver * dest
Definition: executor.h:426

◆ BuildTupleHashTable()

TupleHashTable BuildTupleHashTable ( int  numCols,
AttrNumber keyColIdx,
FmgrInfo eqfunctions,
FmgrInfo hashfunctions,
long  nbuckets,
Size  additionalsize,
MemoryContext  tablecxt,
MemoryContext  tempcxt,
bool  use_variable_hash_iv 
)

Definition at line 290 of file execGrouping.c.

References Assert, TupleHashTableData::cur_eq_funcs, TupleHashTableData::entrysize, TupleHashTableData::hash_iv, hash_uint32(), TupleHashTableData::hashtab, TupleHashTableData::in_hash_funcs, TupleHashTableData::inputslot, TupleHashTableData::keyColIdx, MemoryContextAlloc(), Min, TupleHashTableData::numCols, ParallelWorkerNumber, TupleHashTableData::tab_eq_funcs, TupleHashTableData::tab_hash_funcs, TupleHashTableData::tablecxt, TupleHashTableData::tableslot, TupleHashTableData::tempcxt, and work_mem.

Referenced by build_hash_table(), and buildSubPlanHash().

296 {
297  TupleHashTable hashtable;
298  Size entrysize = sizeof(TupleHashEntryData) + additionalsize;
299 
300  Assert(nbuckets > 0);
301 
302  /* Limit initial table size request to not more than work_mem */
303  nbuckets = Min(nbuckets, (long) ((work_mem * 1024L) / entrysize));
304 
305  hashtable = (TupleHashTable)
306  MemoryContextAlloc(tablecxt, sizeof(TupleHashTableData));
307 
308  hashtable->numCols = numCols;
309  hashtable->keyColIdx = keyColIdx;
310  hashtable->tab_hash_funcs = hashfunctions;
311  hashtable->tab_eq_funcs = eqfunctions;
312  hashtable->tablecxt = tablecxt;
313  hashtable->tempcxt = tempcxt;
314  hashtable->entrysize = entrysize;
315  hashtable->tableslot = NULL; /* will be made on first lookup */
316  hashtable->inputslot = NULL;
317  hashtable->in_hash_funcs = NULL;
318  hashtable->cur_eq_funcs = NULL;
319 
320  /*
321  * If parallelism is in use, even if the master backend is performing the
322  * scan itself, we don't want to create the hashtable exactly the same way
323  * in all workers. As hashtables are iterated over in keyspace-order,
324  * doing so in all processes in the same way is likely to lead to
325  * "unbalanced" hashtables when the table size initially is
326  * underestimated.
327  */
328  if (use_variable_hash_iv)
330  else
331  hashtable->hash_iv = 0;
332 
333  hashtable->hashtab = tuplehash_create(tablecxt, nbuckets, hashtable);
334 
335  return hashtable;
336 }
TupleTableSlot * inputslot
Definition: execnodes.h:617
#define Min(x, y)
Definition: c.h:802
AttrNumber * keyColIdx
Definition: execnodes.h:609
FmgrInfo * tab_hash_funcs
Definition: execnodes.h:610
FmgrInfo * in_hash_funcs
Definition: execnodes.h:618
struct TupleHashEntryData TupleHashEntryData
MemoryContext tablecxt
Definition: execnodes.h:612
struct TupleHashTableData * TupleHashTable
Definition: execnodes.h:587
int ParallelWorkerNumber
Definition: parallel.c:100
Datum hash_uint32(uint32 k)
Definition: hashfunc.c:853
int work_mem
Definition: globals.c:113
tuplehash_hash * hashtab
Definition: execnodes.h:607
#define Assert(condition)
Definition: c.h:670
TupleTableSlot * tableslot
Definition: execnodes.h:615
size_t Size
Definition: c.h:404
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:706
FmgrInfo * cur_eq_funcs
Definition: execnodes.h:619
MemoryContext tempcxt
Definition: execnodes.h:613
FmgrInfo * tab_eq_funcs
Definition: execnodes.h:611

◆ check_exclusion_constraint()

void check_exclusion_constraint ( Relation  heap,
Relation  index,
IndexInfo indexInfo,
ItemPointer  tupleid,
Datum values,
bool isnull,
EState estate,
bool  newIndex 
)

Definition at line 863 of file execIndexing.c.

References CEOUC_WAIT, and check_exclusion_or_unique_constraint().

Referenced by IndexCheckExclusion(), and unique_key_recheck().

868 {
869  (void) check_exclusion_or_unique_constraint(heap, index, indexInfo, tupleid,
870  values, isnull,
871  estate, newIndex,
872  CEOUC_WAIT, false, NULL);
873 }
static bool check_exclusion_or_unique_constraint(Relation heap, Relation index, IndexInfo *indexInfo, ItemPointer tupleid, Datum *values, bool *isnull, EState *estate, bool newIndex, CEOUC_WAIT_MODE waitMode, bool errorOK, ItemPointer conflictTid)
Definition: execIndexing.c:639
static Datum values[MAXATTR]
Definition: bootstrap.c:164

◆ CheckCmdReplicaIdentity()

void CheckCmdReplicaIdentity ( Relation  rel,
CmdType  cmd 
)

Definition at line 540 of file execReplication.c.

References CMD_DELETE, CMD_UPDATE, ereport, errcode(), errhint(), errmsg(), ERROR, GetRelationPublicationActions(), OidIsValid, PublicationActions::pubdelete, PublicationActions::pubupdate, RelationData::rd_rel, RelationGetRelationName, RelationGetReplicaIndex(), and REPLICA_IDENTITY_FULL.

Referenced by CheckValidResultRel(), ExecSimpleRelationDelete(), ExecSimpleRelationInsert(), and ExecSimpleRelationUpdate().

541 {
542  PublicationActions *pubactions;
543 
544  /* We only need to do checks for UPDATE and DELETE. */
545  if (cmd != CMD_UPDATE && cmd != CMD_DELETE)
546  return;
547 
548  /* If relation has replica identity we are always good. */
549  if (rel->rd_rel->relreplident == REPLICA_IDENTITY_FULL ||
551  return;
552 
553  /*
554  * This is either UPDATE OR DELETE and there is no replica identity.
555  *
556  * Check if the table publishes UPDATES or DELETES.
557  */
558  pubactions = GetRelationPublicationActions(rel);
559  if (cmd == CMD_UPDATE && pubactions->pubupdate)
560  ereport(ERROR,
561  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
562  errmsg("cannot update table \"%s\" because it does not have a replica identity and publishes updates",
564  errhint("To enable updating the table, set REPLICA IDENTITY using ALTER TABLE.")));
565  else if (cmd == CMD_DELETE && pubactions->pubdelete)
566  ereport(ERROR,
567  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
568  errmsg("cannot delete from table \"%s\" because it does not have a replica identity and publishes deletes",
570  errhint("To enable deleting from the table, set REPLICA IDENTITY using ALTER TABLE.")));
571 }
int errhint(const char *fmt,...)
Definition: elog.c:987
Oid RelationGetReplicaIndex(Relation relation)
Definition: relcache.c:4691
int errcode(int sqlerrcode)
Definition: elog.c:575
Form_pg_class rd_rel
Definition: rel.h:114
#define OidIsValid(objectId)
Definition: c.h:576
#define REPLICA_IDENTITY_FULL
Definition: pg_class.h:179
#define ERROR
Definition: elog.h:43
#define RelationGetRelationName(relation)
Definition: rel.h:445
#define ereport(elevel, rest)
Definition: elog.h:122
struct PublicationActions * GetRelationPublicationActions(Relation relation)
Definition: relcache.c:5187
int errmsg(const char *fmt,...)
Definition: elog.c:797

◆ CheckSubscriptionRelkind()

void CheckSubscriptionRelkind ( char  relkind,
const char *  nspname,
const char *  relname 
)

Definition at line 580 of file execReplication.c.

References ereport, errcode(), errmsg(), ERROR, and RELKIND_RELATION.

Referenced by AlterSubscription_refresh(), CreateSubscription(), and logicalrep_rel_open().

582 {
583  /*
584  * We currently only support writing to regular tables.
585  */
586  if (relkind != RELKIND_RELATION)
587  ereport(ERROR,
588  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
589  errmsg("logical replication target relation \"%s.%s\" is not a table",
590  nspname, relname)));
591 }
int errcode(int sqlerrcode)
Definition: elog.c:575
#define ERROR
Definition: elog.h:43
#define ereport(elevel, rest)
Definition: elog.h:122
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define RELKIND_RELATION
Definition: pg_class.h:160

◆ CheckValidResultRel()

void CheckValidResultRel ( ResultRelInfo resultRelInfo,
CmdType  operation 
)

Definition at line 1098 of file execMain.c.

References CheckCmdReplicaIdentity(), CMD_DELETE, CMD_INSERT, CMD_UPDATE, elog, ereport, errcode(), errhint(), errmsg(), ERROR, FdwRoutine::ExecForeignDelete, FdwRoutine::ExecForeignInsert, FdwRoutine::ExecForeignUpdate, FdwRoutine::IsForeignRelUpdatable, MatViewIncrementalMaintenanceIsEnabled(), RelationData::rd_rel, RelationGetRelationName, RELKIND_FOREIGN_TABLE, RELKIND_MATVIEW, RELKIND_PARTITIONED_TABLE, RELKIND_RELATION, RELKIND_SEQUENCE, RELKIND_TOASTVALUE, RELKIND_VIEW, ResultRelInfo::ri_FdwRoutine, ResultRelInfo::ri_PartitionRoot, ResultRelInfo::ri_RelationDesc, TriggerDesc::trig_delete_instead_row, TriggerDesc::trig_insert_instead_row, TriggerDesc::trig_update_instead_row, and RelationData::trigdesc.

Referenced by ExecInitModifyTable(), and ExecSetupPartitionTupleRouting().

1099 {
1100  Relation resultRel = resultRelInfo->ri_RelationDesc;
1101  TriggerDesc *trigDesc = resultRel->trigdesc;
1102  FdwRoutine *fdwroutine;
1103 
1104  switch (resultRel->rd_rel->relkind)
1105  {
1106  case RELKIND_RELATION:
1108  CheckCmdReplicaIdentity(resultRel, operation);
1109  break;
1110  case RELKIND_SEQUENCE:
1111  ereport(ERROR,
1112  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1113  errmsg("cannot change sequence \"%s\"",
1114  RelationGetRelationName(resultRel))));
1115  break;
1116  case RELKIND_TOASTVALUE:
1117  ereport(ERROR,
1118  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1119  errmsg("cannot change TOAST relation \"%s\"",
1120  RelationGetRelationName(resultRel))));
1121  break;
1122  case RELKIND_VIEW:
1123 
1124  /*
1125  * Okay only if there's a suitable INSTEAD OF trigger. Messages
1126  * here should match rewriteHandler.c's rewriteTargetView, except
1127  * that we omit errdetail because we haven't got the information
1128  * handy (and given that we really shouldn't get here anyway, it's
1129  * not worth great exertion to get).
1130  */
1131  switch (operation)
1132  {
1133  case CMD_INSERT:
1134  if (!trigDesc || !trigDesc->trig_insert_instead_row)
1135  ereport(ERROR,
1136  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1137  errmsg("cannot insert into view \"%s\"",
1138  RelationGetRelationName(resultRel)),
1139  errhint("To enable inserting into the view, provide an INSTEAD OF INSERT trigger or an unconditional ON INSERT DO INSTEAD rule.")));
1140  break;
1141  case CMD_UPDATE:
1142  if (!trigDesc || !trigDesc->trig_update_instead_row)
1143  ereport(ERROR,
1144  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1145  errmsg("cannot update view \"%s\"",
1146  RelationGetRelationName(resultRel)),
1147  errhint("To enable updating the view, provide an INSTEAD OF UPDATE trigger or an unconditional ON UPDATE DO INSTEAD rule.")));
1148  break;
1149  case CMD_DELETE:
1150  if (!trigDesc || !trigDesc->trig_delete_instead_row)
1151  ereport(ERROR,
1152  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1153  errmsg("cannot delete from view \"%s\"",
1154  RelationGetRelationName(resultRel)),
1155  errhint("To enable deleting from the view, provide an INSTEAD OF DELETE trigger or an unconditional ON DELETE DO INSTEAD rule.")));
1156  break;
1157  default:
1158  elog(ERROR, "unrecognized CmdType: %d", (int) operation);
1159  break;
1160  }
1161  break;
1162  case RELKIND_MATVIEW:
1164  ereport(ERROR,
1165  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1166  errmsg("cannot change materialized view \"%s\"",
1167  RelationGetRelationName(resultRel))));
1168  break;
1169  case RELKIND_FOREIGN_TABLE:
1170  /* Okay only if the FDW supports it */
1171  fdwroutine = resultRelInfo->ri_FdwRoutine;
1172  switch (operation)
1173  {
1174  case CMD_INSERT:
1175 
1176  /*
1177  * If foreign partition to do tuple-routing for, skip the
1178  * check; it's disallowed elsewhere.
1179  */
1180  if (resultRelInfo->ri_PartitionRoot)
1181  break;
1182  if (fdwroutine->ExecForeignInsert == NULL)
1183  ereport(ERROR,
1184  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1185  errmsg("cannot insert into foreign table \"%s\"",
1186  RelationGetRelationName(resultRel))));
1187  if (fdwroutine->IsForeignRelUpdatable != NULL &&
1188  (fdwroutine->IsForeignRelUpdatable(resultRel) & (1 << CMD_INSERT)) == 0)
1189  ereport(ERROR,
1190  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1191  errmsg("foreign table \"%s\" does not allow inserts",
1192  RelationGetRelationName(resultRel))));
1193  break;
1194  case CMD_UPDATE:
1195  if (fdwroutine->ExecForeignUpdate == NULL)
1196  ereport(ERROR,
1197  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1198  errmsg("cannot update foreign table \"%s\"",
1199  RelationGetRelationName(resultRel))));
1200  if (fdwroutine->IsForeignRelUpdatable != NULL &&
1201  (fdwroutine->IsForeignRelUpdatable(resultRel) & (1 << CMD_UPDATE)) == 0)
1202  ereport(ERROR,
1203  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1204  errmsg("foreign table \"%s\" does not allow updates",
1205  RelationGetRelationName(resultRel))));
1206  break;
1207  case CMD_DELETE:
1208  if (fdwroutine->ExecForeignDelete == NULL)
1209  ereport(ERROR,
1210  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1211  errmsg("cannot delete from foreign table \"%s\"",
1212  RelationGetRelationName(resultRel))));
1213  if (fdwroutine->IsForeignRelUpdatable != NULL &&
1214  (fdwroutine->IsForeignRelUpdatable(resultRel) & (1 << CMD_DELETE)) == 0)
1215  ereport(ERROR,
1216  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1217  errmsg("foreign table \"%s\" does not allow deletes",
1218  RelationGetRelationName(resultRel))));
1219  break;
1220  default:
1221  elog(ERROR, "unrecognized CmdType: %d", (int) operation);
1222  break;
1223  }
1224  break;
1225  default:
1226  ereport(ERROR,
1227  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1228  errmsg("cannot change relation \"%s\"",
1229  RelationGetRelationName(resultRel))));
1230  break;
1231  }
1232 }
ExecForeignDelete_function ExecForeignDelete
Definition: fdwapi.h:205
Relation ri_RelationDesc
Definition: execnodes.h:354
int errhint(const char *fmt,...)
Definition: elog.c:987
bool MatViewIncrementalMaintenanceIsEnabled(void)
Definition: matview.c:861
ExecForeignInsert_function ExecForeignInsert
Definition: fdwapi.h:203
Relation ri_PartitionRoot
Definition: execnodes.h:414
#define RELKIND_MATVIEW
Definition: pg_class.h:165
int errcode(int sqlerrcode)
Definition: elog.c:575
Form_pg_class rd_rel
Definition: rel.h:114
bool trig_insert_instead_row
Definition: reltrigger.h:57
#define ERROR
Definition: elog.h:43
TriggerDesc * trigdesc
Definition: rel.h:120
#define RelationGetRelationName(relation)
Definition: rel.h:445
struct FdwRoutine * ri_FdwRoutine
Definition: execnodes.h:378
#define RELKIND_FOREIGN_TABLE
Definition: pg_class.h:167
void CheckCmdReplicaIdentity(Relation rel, CmdType cmd)
#define ereport(elevel, rest)
Definition: elog.h:122
bool trig_update_instead_row
Definition: reltrigger.h:62
#define RELKIND_PARTITIONED_TABLE
Definition: pg_class.h:168
bool trig_delete_instead_row
Definition: reltrigger.h:67
#define RELKIND_TOASTVALUE
Definition: pg_class.h:163
ExecForeignUpdate_function ExecForeignUpdate
Definition: fdwapi.h:204
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define RELKIND_VIEW
Definition: pg_class.h:164
IsForeignRelUpdatable_function IsForeignRelUpdatable
Definition: fdwapi.h:207
#define elog
Definition: elog.h:219
#define RELKIND_RELATION
Definition: pg_class.h:160
#define RELKIND_SEQUENCE
Definition: pg_class.h:162

◆ CreateExecutorState()

EState* CreateExecutorState ( void  )

Definition at line 80 of file execUtils.c.

References ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate(), CurrentMemoryContext, EState::es_auxmodifytables, EState::es_crosscheck_snapshot, EState::es_direction, EState::es_epqScanDone, EState::es_epqTuple, EState::es_epqTupleSet, EState::es_exprcontexts, EState::es_finished, EState::es_instrument, EState::es_junkFilter, EState::es_lastoid, EState::es_leaf_result_relations, EState::es_num_result_relations, EState::es_num_root_result_relations, EState::es_output_cid, EState::es_param_exec_vals, EState::es_param_list_info, EState::es_per_tuple_exprcontext, EState::es_plannedstmt, EState::es_processed, EState::es_query_cxt, EState::es_queryEnv, EState::es_range_table, EState::es_result_relation_info, EState::es_result_relations, EState::es_root_result_relations, EState::es_rowMarks, EState::es_snapshot, EState::es_sourceText, EState::es_subplanstates, EState::es_top_eflags, EState::es_trig_newtup_slot, EState::es_trig_oldtup_slot, EState::es_trig_target_relations, EState::es_trig_tuple_slot, EState::es_tupleTable, EState::es_use_parallel_mode, ForwardScanDirection, InvalidOid, InvalidSnapshot, makeNode, MemoryContextSwitchTo(), and NIL.

Referenced by afterTriggerInvokeEvents(), ATRewriteTable(), check_default_allows_bound(), compute_index_stats(), CopyFrom(), create_estate_for_relation(), EvalPlanQualStart(), evaluate_expr(), ExecuteQuery(), ExecuteTruncate(), ExplainExecuteQuery(), get_actual_variable_range(), get_qual_for_range(), IndexBuildHeapRangeScan(), IndexCheckExclusion(), operator_predicate_proof(), plpgsql_create_econtext(), plpgsql_inline_handler(), standard_ExecutorStart(), tuplesort_begin_cluster(), unique_key_recheck(), validate_index_heapscan(), validateCheckConstraint(), and validateDomainConstraint().

81 {
82  EState *estate;
83  MemoryContext qcontext;
84  MemoryContext oldcontext;
85 
86  /*
87  * Create the per-query context for this Executor run.
88  */
90  "ExecutorState",
92 
93  /*
94  * Make the EState node within the per-query context. This way, we don't
95  * need a separate pfree() operation for it at shutdown.
96  */
97  oldcontext = MemoryContextSwitchTo(qcontext);
98 
99  estate = makeNode(EState);
100 
101  /*
102  * Initialize all fields of the Executor State structure
103  */
105  estate->es_snapshot = InvalidSnapshot; /* caller must initialize this */
106  estate->es_crosscheck_snapshot = InvalidSnapshot; /* no crosscheck */
107  estate->es_range_table = NIL;
108  estate->es_plannedstmt = NULL;
109 
110  estate->es_junkFilter = NULL;
111 
112  estate->es_output_cid = (CommandId) 0;
113 
114  estate->es_result_relations = NULL;
115  estate->es_num_result_relations = 0;
116  estate->es_result_relation_info = NULL;
117 
118  estate->es_root_result_relations = NULL;
119  estate->es_num_root_result_relations = 0;
120 
121  estate->es_leaf_result_relations = NIL;
122 
123  estate->es_trig_target_relations = NIL;
124  estate->es_trig_tuple_slot = NULL;
125  estate->es_trig_oldtup_slot = NULL;
126  estate->es_trig_newtup_slot = NULL;
127 
128  estate->es_param_list_info = NULL;
129  estate->es_param_exec_vals = NULL;
130 
131  estate->es_queryEnv = NULL;
132 
133  estate->es_query_cxt = qcontext;
134 
135  estate->es_tupleTable = NIL;
136 
137  estate->es_rowMarks = NIL;
138 
139  estate->es_processed = 0;
140  estate->es_lastoid = InvalidOid;
141 
142  estate->es_top_eflags = 0;
143  estate->es_instrument = 0;
144  estate->es_finished = false;
145 
146  estate->es_exprcontexts = NIL;
147 
148  estate->es_subplanstates = NIL;
149 
150  estate->es_auxmodifytables = NIL;
151 
152  estate->es_per_tuple_exprcontext = NULL;
153 
154  estate->es_epqTuple = NULL;
155  estate->es_epqTupleSet = NULL;
156  estate->es_epqScanDone = NULL;
157  estate->es_sourceText = NULL;
158 
159  estate->es_use_parallel_mode = false;
160 
161  /*
162  * Return the executor state structure
163  */
164  MemoryContextSwitchTo(oldcontext);
165 
166  return estate;
167 }
#define NIL
Definition: pg_list.h:69
uint32 CommandId
Definition: c.h:459
HeapTuple * es_epqTuple
Definition: execnodes.h:506
JunkFilter * es_junkFilter
Definition: execnodes.h:435
CommandId es_output_cid
Definition: execnodes.h:438
TupleTableSlot * es_trig_newtup_slot
Definition: execnodes.h:462
Oid es_lastoid
Definition: execnodes.h:478
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
PlannedStmt * es_plannedstmt
Definition: execnodes.h:432
Snapshot es_crosscheck_snapshot
Definition: execnodes.h:430
ExprContext * es_per_tuple_exprcontext
Definition: execnodes.h:495
Snapshot es_snapshot
Definition: execnodes.h:429
List * es_range_table
Definition: execnodes.h:431
ScanDirection es_direction
Definition: execnodes.h:428
bool es_use_parallel_mode
Definition: execnodes.h:510
const char * es_sourceText
Definition: execnodes.h:433
ParamExecData * es_param_exec_vals
Definition: execnodes.h:466
MemoryContext es_query_cxt
Definition: execnodes.h:471
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:165
ResultRelInfo * es_result_relations
Definition: execnodes.h:441
TupleTableSlot * es_trig_oldtup_slot
Definition: execnodes.h:461
MemoryContext CurrentMemoryContext
Definition: mcxt.c:37
int es_instrument
Definition: execnodes.h:481
TupleTableSlot * es_trig_tuple_slot
Definition: execnodes.h:460
List * es_leaf_result_relations
Definition: execnodes.h:456
QueryEnvironment * es_queryEnv
Definition: execnodes.h:468
int es_num_root_result_relations
Definition: execnodes.h:453
#define InvalidSnapshot
Definition: snapshot.h:25
List * es_trig_target_relations
Definition: execnodes.h:459
List * es_tupleTable
Definition: execnodes.h:473
MemoryContext AllocSetContextCreate(MemoryContext parent, const char *name, Size minContextSize, Size initBlockSize, Size maxBlockSize)
Definition: aset.c:322
List * es_auxmodifytables
Definition: execnodes.h:488
int es_num_result_relations
Definition: execnodes.h:442
#define InvalidOid
Definition: postgres_ext.h:36
bool es_finished
Definition: execnodes.h:482
#define makeNode(_type_)
Definition: nodes.h:558
uint64 es_processed
Definition: execnodes.h:477
bool * es_epqTupleSet
Definition: execnodes.h:507
List * es_subplanstates
Definition: execnodes.h:486
List * es_rowMarks
Definition: execnodes.h:475
int es_top_eflags
Definition: execnodes.h:480
ResultRelInfo * es_root_result_relations
Definition: execnodes.h:452
bool * es_epqScanDone
Definition: execnodes.h:508
ParamListInfo es_param_list_info
Definition: execnodes.h:465
List * es_exprcontexts
Definition: execnodes.h:484
ResultRelInfo * es_result_relation_info
Definition: execnodes.h:443

◆ CreateExprContext()

ExprContext* CreateExprContext ( EState estate)

Definition at line 225 of file execUtils.c.

References ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate(), ExprContext::caseValue_datum, ExprContext::caseValue_isNull, ExprContext::domainValue_datum, ExprContext::domainValue_isNull, ExprContext::ecxt_aggnulls, ExprContext::ecxt_aggvalues, ExprContext::ecxt_callbacks, ExprContext::ecxt_estate, ExprContext::ecxt_innertuple, ExprContext::ecxt_outertuple, ExprContext::ecxt_param_exec_vals, ExprContext::ecxt_param_list_info, ExprContext::ecxt_per_query_memory, ExprContext::ecxt_per_tuple_memory, ExprContext::ecxt_scantuple, EState::es_exprcontexts, EState::es_param_exec_vals, EState::es_param_list_info, EState::es_query_cxt, lcons(), makeNode, and MemoryContextSwitchTo().

Referenced by ExecAssignExprContext(), ExecInitMergeJoin(), ExecInitSubPlan(), MakePerTupleExprContext(), and plpgsql_create_econtext().

226 {
227  ExprContext *econtext;
228  MemoryContext oldcontext;
229 
230  /* Create the ExprContext node within the per-query memory context */
231  oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
232 
233  econtext = makeNode(ExprContext);
234 
235  /* Initialize fields of ExprContext */
236  econtext->ecxt_scantuple = NULL;
237  econtext->ecxt_innertuple = NULL;
238  econtext->ecxt_outertuple = NULL;
239 
240  econtext->ecxt_per_query_memory = estate->es_query_cxt;
241 
242  /*
243  * Create working memory for expression evaluation in this context.
244  */
245  econtext->ecxt_per_tuple_memory =
247  "ExprContext",
249 
250  econtext->ecxt_param_exec_vals = estate->es_param_exec_vals;
251  econtext->ecxt_param_list_info = estate->es_param_list_info;
252 
253  econtext->ecxt_aggvalues = NULL;
254  econtext->ecxt_aggnulls = NULL;
255 
256  econtext->caseValue_datum = (Datum) 0;
257  econtext->caseValue_isNull = true;
258 
259  econtext->domainValue_datum = (Datum) 0;
260  econtext->domainValue_isNull = true;
261 
262  econtext->ecxt_estate = estate;
263 
264  econtext->ecxt_callbacks = NULL;
265 
266  /*
267  * Link the ExprContext into the EState to ensure it is shut down when the
268  * EState is freed. Because we use lcons(), shutdowns will occur in
269  * reverse order of creation, which may not be essential but can't hurt.
270  */
271  estate->es_exprcontexts = lcons(econtext, estate->es_exprcontexts);
272 
273  MemoryContextSwitchTo(oldcontext);
274 
275  return econtext;
276 }
Datum * ecxt_aggvalues
Definition: execnodes.h:213
MemoryContext ecxt_per_tuple_memory
Definition: execnodes.h:203
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
Datum domainValue_datum
Definition: execnodes.h:221
ParamExecData * es_param_exec_vals
Definition: execnodes.h:466
MemoryContext es_query_cxt
Definition: execnodes.h:471
Datum caseValue_datum
Definition: execnodes.h:217
ExprContext_CB * ecxt_callbacks
Definition: execnodes.h:228
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:165
TupleTableSlot * ecxt_innertuple
Definition: execnodes.h:198
ParamExecData * ecxt_param_exec_vals
Definition: execnodes.h:206
struct EState * ecxt_estate
Definition: execnodes.h:225
bool domainValue_isNull
Definition: execnodes.h:222
bool * ecxt_aggnulls
Definition: execnodes.h:214
MemoryContext AllocSetContextCreate(MemoryContext parent, const char *name, Size minContextSize, Size initBlockSize, Size maxBlockSize)
Definition: aset.c:322
uintptr_t Datum
Definition: postgres.h:372
List * lcons(void *datum, List *list)
Definition: list.c:259
#define makeNode(_type_)
Definition: nodes.h:558
TupleTableSlot * ecxt_outertuple
Definition: execnodes.h:199
TupleTableSlot * ecxt_scantuple
Definition: execnodes.h:197
MemoryContext ecxt_per_query_memory
Definition: execnodes.h:202
bool caseValue_isNull
Definition: execnodes.h:218
ParamListInfo es_param_list_info
Definition: execnodes.h:465
List * es_exprcontexts
Definition: execnodes.h:484
ParamListInfo ecxt_param_list_info
Definition: execnodes.h:207

◆ CreateStandaloneExprContext()

ExprContext* CreateStandaloneExprContext ( void  )

Definition at line 297 of file execUtils.c.

References ALLOCSET_DEFAULT_SIZES, AllocSetContextCreate(), ExprContext::caseValue_datum, ExprContext::caseValue_isNull, CurrentMemoryContext, ExprContext::domainValue_datum, ExprContext::domainValue_isNull, ExprContext::ecxt_aggnulls, ExprContext::ecxt_aggvalues, ExprContext::ecxt_callbacks, ExprContext::ecxt_estate, ExprContext::ecxt_innertuple, ExprContext::ecxt_outertuple, ExprContext::ecxt_param_exec_vals, ExprContext::ecxt_param_list_info, ExprContext::ecxt_per_query_memory, ExprContext::ecxt_per_tuple_memory, ExprContext::ecxt_scantuple, and makeNode.

Referenced by domain_check_input().

298 {
299  ExprContext *econtext;
300 
301  /* Create the ExprContext node within the caller's memory context */
302  econtext = makeNode(ExprContext);
303 
304  /* Initialize fields of ExprContext */
305  econtext->ecxt_scantuple = NULL;
306  econtext->ecxt_innertuple = NULL;
307  econtext->ecxt_outertuple = NULL;
308 
310 
311  /*
312  * Create working memory for expression evaluation in this context.
313  */
314  econtext->ecxt_per_tuple_memory =
316  "ExprContext",
318 
319  econtext->ecxt_param_exec_vals = NULL;
320  econtext->ecxt_param_list_info = NULL;
321 
322  econtext->ecxt_aggvalues = NULL;
323  econtext->ecxt_aggnulls = NULL;
324 
325  econtext->caseValue_datum = (Datum) 0;
326  econtext->caseValue_isNull = true;
327 
328  econtext->domainValue_datum = (Datum) 0;
329  econtext->domainValue_isNull = true;
330 
331  econtext->ecxt_estate = NULL;
332 
333  econtext->ecxt_callbacks = NULL;
334 
335  return econtext;
336 }
Datum * ecxt_aggvalues
Definition: execnodes.h:213
MemoryContext ecxt_per_tuple_memory
Definition: execnodes.h:203
Datum domainValue_datum
Definition: execnodes.h:221
Datum caseValue_datum
Definition: execnodes.h:217
ExprContext_CB * ecxt_callbacks
Definition: execnodes.h:228
#define ALLOCSET_DEFAULT_SIZES
Definition: memutils.h:165
TupleTableSlot * ecxt_innertuple
Definition: execnodes.h:198
ParamExecData * ecxt_param_exec_vals
Definition: execnodes.h:206
struct EState * ecxt_estate
Definition: execnodes.h:225
MemoryContext CurrentMemoryContext
Definition: mcxt.c:37
bool domainValue_isNull
Definition: execnodes.h:222
bool * ecxt_aggnulls
Definition: execnodes.h:214
MemoryContext AllocSetContextCreate(MemoryContext parent, const char *name, Size minContextSize, Size initBlockSize, Size maxBlockSize)
Definition: aset.c:322
uintptr_t Datum
Definition: postgres.h:372
#define makeNode(_type_)
Definition: nodes.h:558
TupleTableSlot * ecxt_outertuple
Definition: execnodes.h:199
TupleTableSlot * ecxt_scantuple
Definition: execnodes.h:197
MemoryContext ecxt_per_query_memory
Definition: execnodes.h:202
bool caseValue_isNull
Definition: execnodes.h:218
ParamListInfo ecxt_param_list_info
Definition: execnodes.h:207

◆ do_text_output_multiline()

void do_text_output_multiline ( TupOutputState tstate,
const char *  txt 
)

Definition at line 1281 of file execTuples.c.

References cstring_to_text_with_len(), DatumGetPointer, do_tup_output(), pfree(), PointerGetDatum, and values.

Referenced by ExplainQuery().

1282 {
1283  Datum values[1];
1284  bool isnull[1] = {false};
1285 
1286  while (*txt)
1287  {
1288  const char *eol;
1289  int len;
1290 
1291  eol = strchr(txt, '\n');
1292  if (eol)
1293  {
1294  len = eol - txt;
1295  eol++;
1296  }
1297  else
1298  {
1299  len = strlen(txt);
1300  eol = txt + len;
1301  }
1302 
1303  values[0] = PointerGetDatum(cstring_to_text_with_len(txt, len));
1304  do_tup_output(tstate, values, isnull);
1305  pfree(DatumGetPointer(values[0]));
1306  txt = eol;
1307  }
1308 }
#define PointerGetDatum(X)
Definition: postgres.h:562
void do_tup_output(TupOutputState *tstate, Datum *values, bool *isnull)
Definition: execTuples.c:1253
void pfree(void *pointer)
Definition: mcxt.c:949
text * cstring_to_text_with_len(const char *s, int len)
Definition: varlena.c:161
uintptr_t Datum
Definition: postgres.h:372
#define DatumGetPointer(X)
Definition: postgres.h:555
static Datum values[MAXATTR]
Definition: bootstrap.c:164

◆ do_tup_output()

void do_tup_output ( TupOutputState tstate,
Datum values,
bool isnull 
)

Definition at line 1253 of file execTuples.c.

References TupOutputState::dest, ExecClearTuple(), ExecStoreVirtualTuple(), tupleDesc::natts, _DestReceiver::receiveSlot, TupOutputState::slot, TupleTableSlot::tts_isnull, TupleTableSlot::tts_tupleDescriptor, and TupleTableSlot::tts_values.

Referenced by CreateReplicationSlot(), do_text_output_multiline(), IdentifySystem(), ShowAllGUCConfig(), and StartReplication().

1254 {
1255  TupleTableSlot *slot = tstate->slot;
1256  int natts = slot->tts_tupleDescriptor->natts;
1257 
1258  /* make sure the slot is clear */
1259  ExecClearTuple(slot);
1260 
1261  /* insert data */
1262  memcpy(slot->tts_values, values, natts * sizeof(Datum));
1263  memcpy(slot->tts_isnull, isnull, natts * sizeof(bool));
1264 
1265  /* mark slot as containing a virtual tuple */
1266  ExecStoreVirtualTuple(slot);
1267 
1268  /* send the tuple to the receiver */
1269  (void) tstate->dest->receiveSlot(slot, tstate->dest);
1270 
1271  /* clean up */
1272  ExecClearTuple(slot);
1273 }
bool(* receiveSlot)(TupleTableSlot *slot, DestReceiver *self)
Definition: dest.h:118
TupleTableSlot * ExecClearTuple(TupleTableSlot *slot)
Definition: execTuples.c:439
Datum * tts_values
Definition: tuptable.h:125
TupleTableSlot * slot
Definition: executor.h:425
int natts
Definition: tupdesc.h:79
bool * tts_isnull
Definition: tuptable.h:126
TupleDesc tts_tupleDescriptor
Definition: tuptable.h:121
uintptr_t Datum
Definition: postgres.h:372
static Datum values[MAXATTR]
Definition: bootstrap.c:164
DestReceiver * dest
Definition: executor.h:426
TupleTableSlot * ExecStoreVirtualTuple(TupleTableSlot *slot)
Definition: execTuples.c:488

◆ end_tup_output()

void end_tup_output ( TupOutputState tstate)

Definition at line 1311 of file execTuples.c.

References TupOutputState::dest, ExecDropSingleTupleTableSlot(), pfree(), _DestReceiver::rShutdown, and TupOutputState::slot.

Referenced by CreateReplicationSlot(), ExplainQuery(), IdentifySystem(), ShowAllGUCConfig(), ShowGUCConfigOption(), and StartReplication().

1312 {
1313  tstate->dest->rShutdown(tstate->dest);
1314  /* note that destroying the dest is not ours to do */
1316  pfree(tstate);
1317 }
TupleTableSlot * slot
Definition: executor.h:425
void pfree(void *pointer)
Definition: mcxt.c:949
void ExecDropSingleTupleTableSlot(TupleTableSlot *slot)
Definition: execTuples.c:216
void(* rShutdown)(DestReceiver *self)
Definition: dest.h:124
DestReceiver * dest
Definition: executor.h:426

◆ EvalPlanQual()

TupleTableSlot* EvalPlanQual ( EState estate,
EPQState epqstate,
Relation  relation,
Index  rti,
int  lockmode,
ItemPointer  tid,
TransactionId  priorXmax 
)

Definition at line 2478 of file execMain.c.

References Assert, EvalPlanQualBegin(), EvalPlanQualFetch(), EvalPlanQualFetchRowMarks(), EvalPlanQualNext(), EvalPlanQualSetTuple(), ExecMaterializeSlot(), LockWaitBlock, HeapTupleData::t_self, and TupIsNull.

Referenced by ExecDelete(), ExecUpdate(), and GetTupleForTrigger().

2481 {
2482  TupleTableSlot *slot;
2483  HeapTuple copyTuple;
2484 
2485  Assert(rti > 0);
2486 
2487  /*
2488  * Get and lock the updated version of the row; if fail, return NULL.
2489  */
2490  copyTuple = EvalPlanQualFetch(estate, relation, lockmode, LockWaitBlock,
2491  tid, priorXmax);
2492 
2493  if (copyTuple == NULL)
2494  return NULL;
2495 
2496  /*
2497  * For UPDATE/DELETE we have to return tid of actual row we're executing
2498  * PQ for.
2499  */
2500  *tid = copyTuple->t_self;
2501 
2502  /*
2503  * Need to run a recheck subquery. Initialize or reinitialize EPQ state.
2504  */
2505  EvalPlanQualBegin(epqstate, estate);
2506 
2507  /*
2508  * Free old test tuple, if any, and store new tuple where relation's scan
2509  * node will see it
2510  */
2511  EvalPlanQualSetTuple(epqstate, rti, copyTuple);
2512 
2513  /*
2514  * Fetch any non-locked source rows
2515  */
2516  EvalPlanQualFetchRowMarks(epqstate);
2517 
2518  /*
2519  * Run the EPQ query. We assume it will return at most one tuple.
2520  */
2521  slot = EvalPlanQualNext(epqstate);
2522 
2523  /*
2524  * If we got a tuple, force the slot to materialize the tuple so that it
2525  * is not dependent on any local state in the EPQ query (in particular,
2526  * it's highly likely that the slot contains references to any pass-by-ref
2527  * datums that may be present in copyTuple). As with the next step, this
2528  * is to guard against early re-use of the EPQ query.
2529  */
2530  if (!TupIsNull(slot))
2531  (void) ExecMaterializeSlot(slot);
2532 
2533  /*
2534  * Clear out the test tuple. This is needed in case the EPQ query is
2535  * re-used to test a tuple for a different relation. (Not clear that can
2536  * really happen, but let's be safe.)
2537  */
2538  EvalPlanQualSetTuple(epqstate, rti, NULL);
2539 
2540  return slot;
2541 }
void EvalPlanQualSetTuple(EPQState *epqstate, Index rti, HeapTuple tuple)
Definition: execMain.c:2829
HeapTuple EvalPlanQualFetch(EState *estate, Relation relation, int lockmode, LockWaitPolicy wait_policy, ItemPointer tid, TransactionId priorXmax)
Definition: execMain.c:2565
void EvalPlanQualFetchRowMarks(EPQState *epqstate)
Definition: execMain.c:2864
void EvalPlanQualBegin(EPQState *epqstate, EState *parentestate)
Definition: execMain.c:3015
TupleTableSlot * EvalPlanQualNext(EPQState *epqstate)
Definition: execMain.c:2999
ItemPointerData t_self
Definition: htup.h:65
#define TupIsNull(slot)
Definition: tuptable.h:138
#define Assert(condition)
Definition: c.h:670
HeapTuple ExecMaterializeSlot(TupleTableSlot *slot)
Definition: execTuples.c:725

◆ EvalPlanQualBegin()

void EvalPlanQualBegin ( EPQState epqstate,
EState parentestate 
)

Definition at line 3015 of file execMain.c.

References bms_add_member(), PlanState::chgParam, EPQState::epqParam, EState::es_epqScanDone, EState::es_param_exec_vals, EState::es_plannedstmt, EState::es_range_table, EPQState::estate, EvalPlanQualStart(), i, ParamExecData::isnull, list_length(), MemSet, NIL, PlannedStmt::paramExecTypes, EPQState::plan, EPQState::planstate, and ParamExecData::value.

Referenced by EvalPlanQual(), and ExecLockRows().

3016 {
3017  EState *estate = epqstate->estate;
3018 
3019  if (estate == NULL)
3020  {
3021  /* First time through, so create a child EState */
3022  EvalPlanQualStart(epqstate, parentestate, epqstate->plan);
3023  }
3024  else
3025  {
3026  /*
3027  * We already have a suitable child EPQ tree, so just reset it.
3028  */
3029  int rtsize = list_length(parentestate->es_range_table);
3030  PlanState *planstate = epqstate->planstate;
3031 
3032  MemSet(estate->es_epqScanDone, 0, rtsize * sizeof(bool));
3033 
3034  /* Recopy current values of parent parameters */
3035  if (parentestate->es_plannedstmt->paramExecTypes != NIL)
3036  {
3037  int i;
3038 
3039  i = list_length(parentestate->es_plannedstmt->paramExecTypes);
3040 
3041  while (--i >= 0)
3042  {
3043  /* copy value if any, but not execPlan link */
3044  estate->es_param_exec_vals[i].value =
3045  parentestate->es_param_exec_vals[i].value;
3046  estate->es_param_exec_vals[i].isnull =
3047  parentestate->es_param_exec_vals[i].isnull;
3048  }
3049  }
3050 
3051  /*
3052  * Mark child plan tree as needing rescan at all scan nodes. The
3053  * first ExecProcNode will take care of actually doing the rescan.
3054  */
3055  planstate->chgParam = bms_add_member(planstate->chgParam,
3056  epqstate->epqParam);
3057  }
3058 }
List * paramExecTypes
Definition: plannodes.h:92
#define NIL
Definition: pg_list.h:69
PlannedStmt * es_plannedstmt
Definition: execnodes.h:432
#define MemSet(start, val, len)
Definition: c.h:853
List * es_range_table
Definition: execnodes.h:431
PlanState * planstate
Definition: execnodes.h:917
ParamExecData * es_param_exec_vals
Definition: execnodes.h:466
bool isnull
Definition: params.h:101
static void EvalPlanQualStart(EPQState *epqstate, EState *parentestate, Plan *planTree)
Definition: execMain.c:3067
Bitmapset * chgParam
Definition: execnodes.h:877
Plan * plan
Definition: execnodes.h:919
static int list_length(const List *l)
Definition: pg_list.h:89
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:698
int i
bool * es_epqScanDone
Definition: execnodes.h:508
Datum value
Definition: params.h:100
int epqParam
Definition: execnodes.h:921
EState * estate
Definition: execnodes.h:916

◆ EvalPlanQualEnd()

void EvalPlanQualEnd ( EPQState epqstate)

Definition at line 3208 of file execMain.c.

References EState::es_query_cxt, EState::es_subplanstates, EState::es_tupleTable, EPQState::estate, ExecCleanUpTriggerState(), ExecEndNode(), ExecResetTupleTable(), FreeExecutorState(), lfirst, MemoryContextSwitchTo(), EPQState::origslot, and EPQState::planstate.

Referenced by apply_handle_delete(), apply_handle_update(), EvalPlanQualSetPlan(), ExecEndLockRows(), and ExecEndModifyTable().

3209 {
3210  EState *estate = epqstate->estate;
3211  MemoryContext oldcontext;
3212  ListCell *l;
3213 
3214  if (estate == NULL)
3215  return; /* idle, so nothing to do */
3216 
3217  oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
3218 
3219  ExecEndNode(epqstate->planstate);
3220 
3221  foreach(l, estate->es_subplanstates)
3222  {
3223  PlanState *subplanstate = (PlanState *) lfirst(l);
3224 
3225  ExecEndNode(subplanstate);
3226  }
3227 
3228  /* throw away the per-estate tuple table */
3229  ExecResetTupleTable(estate->es_tupleTable, false);
3230 
3231  /* close any trigger target relations attached to this EState */
3232  ExecCleanUpTriggerState(estate);
3233 
3234  MemoryContextSwitchTo(oldcontext);
3235 
3236  FreeExecutorState(estate);
3237 
3238  /* Mark EPQState idle */
3239  epqstate->estate = NULL;
3240  epqstate->planstate = NULL;
3241  epqstate->origslot = NULL;
3242 }
void ExecEndNode(PlanState *node)
Definition: execProcnode.c:523
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
PlanState * planstate
Definition: execnodes.h:917
void FreeExecutorState(EState *estate)
Definition: execUtils.c:185
MemoryContext es_query_cxt
Definition: execnodes.h:471
TupleTableSlot * origslot
Definition: execnodes.h:918
List * es_tupleTable
Definition: execnodes.h:473
void ExecResetTupleTable(List *tupleTable, bool shouldFree)
Definition: execTuples.c:156
#define lfirst(lc)
Definition: pg_list.h:106
List * es_subplanstates
Definition: execnodes.h:486
void ExecCleanUpTriggerState(EState *estate)
Definition: execMain.c:1466
EState * estate
Definition: execnodes.h:916

◆ EvalPlanQualFetch()

HeapTuple EvalPlanQualFetch ( EState estate,
Relation  relation,
int  lockmode,
LockWaitPolicy  wait_policy,
ItemPointer  tid,
TransactionId  priorXmax 
)

Definition at line 2565 of file execMain.c.

References Assert, buffer, ConditionalXactLockTableWait(), HeapUpdateFailureData::ctid, elog, ereport, errcode(), errmsg(), ERROR, EState::es_output_cid, heap_copytuple(), heap_fetch(), heap_lock_tuple(), HeapTupleHeaderGetCmin(), HeapTupleHeaderGetUpdateXid, HeapTupleHeaderGetXmin, HeapTupleHeaderIsSpeculative, HeapTupleInvisible, HeapTupleMayBeUpdated, HeapTupleSelfUpdated, HeapTupleUpdated, HeapTupleWouldBlock, InitDirtySnapshot, IsolationUsesXactSnapshot, ItemPointerEquals(), LockWaitBlock, LockWaitError, LockWaitSkip, RelationGetRelationName, ReleaseBuffer(), HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, HeapTupleData::t_self, test(), TransactionIdEquals, TransactionIdIsCurrentTransactionId(), TransactionIdIsValid, XactLockTableWait(), XLTW_FetchUpdated, SnapshotData::xmax, HeapUpdateFailureData::xmax, and SnapshotData::xmin.

Referenced by EvalPlanQual(), and ExecLockRows().

2568 {
2569  HeapTuple copyTuple = NULL;
2570  HeapTupleData tuple;
2571  SnapshotData SnapshotDirty;
2572 
2573  /*
2574  * fetch target tuple
2575  *
2576  * Loop here to deal with updated or busy tuples
2577  */
2578  InitDirtySnapshot(SnapshotDirty);
2579  tuple.t_self = *tid;
2580  for (;;)
2581  {
2582  Buffer buffer;
2583 
2584  if (heap_fetch(relation, &SnapshotDirty, &tuple, &buffer, true, NULL))
2585  {
2586  HTSU_Result test;
2587  HeapUpdateFailureData hufd;
2588 
2589  /*
2590  * If xmin isn't what we're expecting, the slot must have been
2591  * recycled and reused for an unrelated tuple. This implies that
2592  * the latest version of the row was deleted, so we need do
2593  * nothing. (Should be safe to examine xmin without getting
2594  * buffer's content lock. We assume reading a TransactionId to be
2595  * atomic, and Xmin never changes in an existing tuple, except to
2596  * invalid or frozen, and neither of those can match priorXmax.)
2597  */
2599  priorXmax))
2600  {
2601  ReleaseBuffer(buffer);
2602  return NULL;
2603  }
2604 
2605  /* otherwise xmin should not be dirty... */
2606  if (TransactionIdIsValid(SnapshotDirty.xmin))
2607  elog(ERROR, "t_xmin is uncommitted in tuple to be updated");
2608 
2609  /*
2610  * If tuple is being updated by other transaction then we have to
2611  * wait for its commit/abort, or die trying.
2612  */
2613  if (TransactionIdIsValid(SnapshotDirty.xmax))
2614  {
2615  ReleaseBuffer(buffer);
2616  switch (wait_policy)
2617  {
2618  case LockWaitBlock:
2619  XactLockTableWait(SnapshotDirty.xmax,
2620  relation, &tuple.t_self,
2622  break;
2623  case LockWaitSkip:
2624  if (!ConditionalXactLockTableWait(SnapshotDirty.xmax))
2625  return NULL; /* skip instead of waiting */
2626  break;
2627  case LockWaitError:
2628  if (!ConditionalXactLockTableWait(SnapshotDirty.xmax))
2629  ereport(ERROR,
2630  (errcode(ERRCODE_LOCK_NOT_AVAILABLE),
2631  errmsg("could not obtain lock on row in relation \"%s\"",
2632  RelationGetRelationName(relation))));
2633  break;
2634  }
2635  continue; /* loop back to repeat heap_fetch */
2636  }
2637 
2638  /*
2639  * If tuple was inserted by our own transaction, we have to check
2640  * cmin against es_output_cid: cmin >= current CID means our
2641  * command cannot see the tuple, so we should ignore it. Otherwise
2642  * heap_lock_tuple() will throw an error, and so would any later
2643  * attempt to update or delete the tuple. (We need not check cmax
2644  * because HeapTupleSatisfiesDirty will consider a tuple deleted
2645  * by our transaction dead, regardless of cmax.) We just checked
2646  * that priorXmax == xmin, so we can test that variable instead of
2647  * doing HeapTupleHeaderGetXmin again.
2648  */
2649  if (TransactionIdIsCurrentTransactionId(priorXmax) &&
2650  HeapTupleHeaderGetCmin(tuple.t_data) >= estate->es_output_cid)
2651  {
2652  ReleaseBuffer(buffer);
2653  return NULL;
2654  }
2655 
2656  /*
2657  * This is a live tuple, so now try to lock it.
2658  */
2659  test = heap_lock_tuple(relation, &tuple,
2660  estate->es_output_cid,
2661  lockmode, wait_policy,
2662  false, &buffer, &hufd);
2663  /* We now have two pins on the buffer, get rid of one */
2664  ReleaseBuffer(buffer);
2665 
2666  switch (test)
2667  {
2668  case HeapTupleSelfUpdated:
2669 
2670  /*
2671  * The target tuple was already updated or deleted by the
2672  * current command, or by a later command in the current
2673  * transaction. We *must* ignore the tuple in the former
2674  * case, so as to avoid the "Halloween problem" of
2675  * repeated update attempts. In the latter case it might
2676  * be sensible to fetch the updated tuple instead, but
2677  * doing so would require changing heap_update and
2678  * heap_delete to not complain about updating "invisible"
2679  * tuples, which seems pretty scary (heap_lock_tuple will
2680  * not complain, but few callers expect
2681  * HeapTupleInvisible, and we're not one of them). So for
2682  * now, treat the tuple as deleted and do not process.
2683  */
2684  ReleaseBuffer(buffer);
2685  return NULL;
2686 
2687  case HeapTupleMayBeUpdated:
2688  /* successfully locked */
2689  break;
2690 
2691  case HeapTupleUpdated:
2692  ReleaseBuffer(buffer);
2694  ereport(ERROR,
2695  (errcode(ERRCODE_T_R_SERIALIZATION_FAILURE),
2696  errmsg("could not serialize access due to concurrent update")));
2697 
2698  /* Should not encounter speculative tuple on recheck */
2700  if (!ItemPointerEquals(&hufd.ctid, &tuple.t_self))
2701  {
2702  /* it was updated, so look at the updated version */
2703  tuple.t_self = hufd.ctid;
2704  /* updated row should have xmin matching this xmax */
2705  priorXmax = hufd.xmax;
2706  continue;
2707  }
2708  /* tuple was deleted, so give up */
2709  return NULL;
2710 
2711  case HeapTupleWouldBlock:
2712  ReleaseBuffer(buffer);
2713  return NULL;
2714 
2715  case HeapTupleInvisible:
2716  elog(ERROR, "attempted to lock invisible tuple");
2717 
2718  default:
2719  ReleaseBuffer(buffer);
2720  elog(ERROR, "unrecognized heap_lock_tuple status: %u",
2721  test);
2722  return NULL; /* keep compiler quiet */
2723  }
2724 
2725  /*
2726  * We got tuple - now copy it for use by recheck query.
2727  */
2728  copyTuple = heap_copytuple(&tuple);
2729  ReleaseBuffer(buffer);
2730  break;
2731  }
2732 
2733  /*
2734  * If the referenced slot was actually empty, the latest version of
2735  * the row must have been deleted, so we need do nothing.
2736  */
2737  if (tuple.t_data == NULL)
2738  {
2739  ReleaseBuffer(buffer);
2740  return NULL;
2741  }
2742 
2743  /*
2744  * As above, if xmin isn't what we're expecting, do nothing.
2745  */
2747  priorXmax))
2748  {
2749  ReleaseBuffer(buffer);
2750  return NULL;
2751  }
2752 
2753  /*
2754  * If we get here, the tuple was found but failed SnapshotDirty.
2755  * Assuming the xmin is either a committed xact or our own xact (as it
2756  * certainly should be if we're trying to modify the tuple), this must
2757  * mean that the row was updated or deleted by either a committed xact
2758  * or our own xact. If it was deleted, we can ignore it; if it was
2759  * updated then chain up to the next version and repeat the whole
2760  * process.
2761  *
2762  * As above, it should be safe to examine xmax and t_ctid without the
2763  * buffer content lock, because they can't be changing.
2764  */
2765  if (ItemPointerEquals(&tuple.t_self, &tuple.t_data->t_ctid))
2766  {
2767  /* deleted, so forget about it */
2768  ReleaseBuffer(buffer);
2769  return NULL;
2770  }
2771 
2772  /* updated, so look at the updated row */
2773  tuple.t_self = tuple.t_data->t_ctid;
2774  /* updated row should have xmin matching this xmax */
2775  priorXmax = HeapTupleHeaderGetUpdateXid(tuple.t_data);
2776  ReleaseBuffer(buffer);
2777  /* loop back to fetch next in chain */
2778  }
2779 
2780  /*
2781  * Return the copied tuple
2782  */
2783  return copyTuple;
2784 }
#define HeapTupleHeaderGetUpdateXid(tup)
Definition: htup_details.h:364
HeapTuple heap_copytuple(HeapTuple tuple)
Definition: heaptuple.c:611
CommandId es_output_cid
Definition: execnodes.h:438
static void test(void)
#define TransactionIdEquals(id1, id2)
Definition: transam.h:43
bool TransactionIdIsCurrentTransactionId(TransactionId xid)
Definition: xact.c:766
HTSU_Result heap_lock_tuple(Relation relation, HeapTuple tuple, CommandId cid, LockTupleMode mode, LockWaitPolicy wait_policy, bool follow_updates, Buffer *buffer, HeapUpdateFailureData *hufd)
Definition: heapam.c:4560
CommandId HeapTupleHeaderGetCmin(HeapTupleHeader tup)
Definition: combocid.c:105
bool heap_fetch(Relation relation, Snapshot snapshot, HeapTuple tuple, Buffer *userbuf, bool keep_buf, Relation stats_relation)
Definition: heapam.c:1876
#define IsolationUsesXactSnapshot()
Definition: xact.h:43
#define HeapTupleHeaderIsSpeculative(tup)
Definition: htup_details.h:428
int errcode(int sqlerrcode)
Definition: elog.c:575
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3309
bool ConditionalXactLockTableWait(TransactionId xid)
Definition: lmgr.c:607
HeapTupleHeader t_data
Definition: htup.h:67
#define ERROR
Definition: elog.h:43
#define InitDirtySnapshot(snapshotdata)
Definition: tqual.h:103
ItemPointerData t_ctid
Definition: htup_details.h:155
ItemPointerData t_self
Definition: htup.h:65
HTSU_Result
Definition: snapshot.h:121
#define RelationGetRelationName(relation)
Definition: rel.h:445
TransactionId xmax
Definition: snapshot.h:69
TransactionId xmin
Definition: snapshot.h:68
#define ereport(elevel, rest)
Definition: elog.h:122
TransactionId xmax
Definition: heapam.h:71
void XactLockTableWait(TransactionId xid, Relation rel, ItemPointer ctid, XLTW_Oper oper)
Definition: lmgr.c:554
#define Assert(condition)
Definition: c.h:670
WalTimeSample buffer[LAG_TRACKER_BUFFER_SIZE]
Definition: walsender.c:214
#define HeapTupleHeaderGetXmin(tup)
Definition: htup_details.h:312
bool ItemPointerEquals(ItemPointer pointer1, ItemPointer pointer2)
Definition: itemptr.c:29
int errmsg(const char *fmt,...)
Definition: elog.c:797
ItemPointerData ctid
Definition: heapam.h:70
#define elog
Definition: elog.h:219
#define TransactionIdIsValid(xid)
Definition: transam.h:41
int Buffer
Definition: buf.h:23

◆ EvalPlanQualFetchRowMarks()

void EvalPlanQualFetchRowMarks ( EPQState epqstate)

Definition at line 2864 of file execMain.c.

References EPQState::arowMarks, Assert, buffer, ExecAuxRowMark::ctidAttNo, DatumGetHeapTupleHeader, DatumGetObjectId, DatumGetPointer, elog, ereport, errcode(), errmsg(), ERROR, EPQState::estate, EvalPlanQualSetTuple(), ExecGetJunkAttribute(), GetFdwRoutineForRelation(), heap_copytuple(), heap_fetch(), HeapTupleHeaderGetDatumLength, lfirst, ExecRowMark::markType, OidIsValid, EPQState::origslot, ExecRowMark::prti, RelationData::rd_rel, FdwRoutine::RefetchForeignRow, ExecRowMark::relation, RelationGetRelationName, ReleaseBuffer(), ExecRowMark::relid, RELKIND_FOREIGN_TABLE, ROW_MARK_COPY, ROW_MARK_REFERENCE, ExecAuxRowMark::rowmark, RowMarkRequiresRowShareLock, ExecRowMark::rti, SnapshotAny, HeapTupleHeaderData::t_ctid, HeapTupleData::t_data, HeapTupleData::t_len, HeapTupleData::t_self, HeapTupleData::t_tableOid, ExecAuxRowMark::toidAttNo, and ExecAuxRowMark::wholeAttNo.

Referenced by EvalPlanQual(), and ExecLockRows().

2865 {
2866  ListCell *l;
2867 
2868  Assert(epqstate->origslot != NULL);
2869 
2870  foreach(l, epqstate->arowMarks)
2871  {
2872  ExecAuxRowMark *aerm = (ExecAuxRowMark *) lfirst(l);
2873  ExecRowMark *erm = aerm->rowmark;
2874  Datum datum;
2875  bool isNull;
2876  HeapTupleData tuple;
2877 
2879  elog(ERROR, "EvalPlanQual doesn't support locking rowmarks");
2880 
2881  /* clear any leftover test tuple for this rel */
2882  EvalPlanQualSetTuple(epqstate, erm->rti, NULL);
2883 
2884  /* if child rel, must check whether it produced this row */
2885  if (erm->rti != erm->prti)
2886  {
2887  Oid tableoid;
2888 
2889  datum = ExecGetJunkAttribute(epqstate->origslot,
2890  aerm->toidAttNo,
2891  &isNull);
2892  /* non-locked rels could be on the inside of outer joins */
2893  if (isNull)
2894  continue;
2895  tableoid = DatumGetObjectId(datum);
2896 
2897  Assert(OidIsValid(erm->relid));
2898  if (tableoid != erm->relid)
2899  {
2900  /* this child is inactive right now */
2901  continue;
2902  }
2903  }
2904 
2905  if (erm->markType == ROW_MARK_REFERENCE)
2906  {
2907  HeapTuple copyTuple;
2908 
2909  Assert(erm->relation != NULL);
2910 
2911  /* fetch the tuple's ctid */
2912  datum = ExecGetJunkAttribute(epqstate->origslot,
2913  aerm->ctidAttNo,
2914  &isNull);
2915  /* non-locked rels could be on the inside of outer joins */
2916  if (isNull)
2917  continue;
2918 
2919  /* fetch requests on foreign tables must be passed to their FDW */
2920  if (erm->relation->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
2921  {
2922  FdwRoutine *fdwroutine;
2923  bool updated = false;
2924 
2925  fdwroutine = GetFdwRoutineForRelation(erm->relation, false);
2926  /* this should have been checked already, but let's be safe */
2927  if (fdwroutine->RefetchForeignRow == NULL)
2928  ereport(ERROR,
2929  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
2930  errmsg("cannot lock rows in foreign table \"%s\"",
2932  copyTuple = fdwroutine->RefetchForeignRow(epqstate->estate,
2933  erm,
2934  datum,
2935  &updated);
2936  if (copyTuple == NULL)
2937  elog(ERROR, "failed to fetch tuple for EvalPlanQual recheck");
2938 
2939  /*
2940  * Ideally we'd insist on updated == false here, but that
2941  * assumes that FDWs can track that exactly, which they might
2942  * not be able to. So just ignore the flag.
2943  */
2944  }
2945  else
2946  {
2947  /* ordinary table, fetch the tuple */
2948  Buffer buffer;
2949 
2950  tuple.t_self = *((ItemPointer) DatumGetPointer(datum));
2951  if (!heap_fetch(erm->relation, SnapshotAny, &tuple, &buffer,
2952  false, NULL))
2953  elog(ERROR, "failed to fetch tuple for EvalPlanQual recheck");
2954 
2955  /* successful, copy tuple */
2956  copyTuple = heap_copytuple(&tuple);
2957  ReleaseBuffer(buffer);
2958  }
2959 
2960  /* store tuple */
2961  EvalPlanQualSetTuple(epqstate, erm->rti, copyTuple);
2962  }
2963  else
2964  {
2965  HeapTupleHeader td;
2966 
2967  Assert(erm->markType == ROW_MARK_COPY);
2968 
2969  /* fetch the whole-row Var for the relation */
2970  datum = ExecGetJunkAttribute(epqstate->origslot,
2971  aerm->wholeAttNo,
2972  &isNull);
2973  /* non-locked rels could be on the inside of outer joins */
2974  if (isNull)
2975  continue;
2976  td = DatumGetHeapTupleHeader(datum);
2977 
2978  /* build a temporary HeapTuple control structure */
2980  tuple.t_data = td;
2981  /* relation might be a foreign table, if so provide tableoid */
2982  tuple.t_tableOid = erm->relid;
2983  /* also copy t_ctid in case there's valid data there */
2984  tuple.t_self = td->t_ctid;
2985 
2986  /* copy and store tuple */
2987  EvalPlanQualSetTuple(epqstate, erm->rti,
2988  heap_copytuple(&tuple));
2989  }
2990  }
2991 }
HeapTuple heap_copytuple(HeapTuple tuple)
Definition: heaptuple.c:611
void EvalPlanQualSetTuple(EPQState *epqstate, Index rti, HeapTuple tuple)
Definition: execMain.c:2829
Relation relation
Definition: execnodes.h:536
bool heap_fetch(Relation relation, Snapshot snapshot, HeapTuple tuple, Buffer *userbuf, bool keep_buf, Relation stats_relation)
Definition: heapam.c:1876
#define DatumGetObjectId(X)
Definition: postgres.h:506
int errcode(int sqlerrcode)
Definition: elog.c:575
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3309
Form_pg_class rd_rel
Definition: rel.h:114
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:576
#define DatumGetHeapTupleHeader(X)
Definition: fmgr.h:259
#define RowMarkRequiresRowShareLock(marktype)
Definition: plannodes.h:973
ItemPointerData * ItemPointer
Definition: itemptr.h:49
ExecRowMark * rowmark
Definition: execnodes.h:563
HeapTupleHeader t_data
Definition: htup.h:67
#define ERROR
Definition: elog.h:43
ItemPointerData t_ctid
Definition: htup_details.h:155
ItemPointerData t_self
Definition: htup.h:65
List * arowMarks
Definition: execnodes.h:920
uint32 t_len
Definition: htup.h:64
Index rti
Definition: execnodes.h:538
AttrNumber wholeAttNo
Definition: execnodes.h:566
Index prti
Definition: execnodes.h:539
#define RelationGetRelationName(relation)
Definition: rel.h:445
Oid t_tableOid
Definition: htup.h:66
#define RELKIND_FOREIGN_TABLE
Definition: pg_class.h:167
TupleTableSlot * origslot
Definition: execnodes.h:918
#define ereport(elevel, rest)
Definition: elog.h:122
uintptr_t Datum
Definition: postgres.h:372
#define SnapshotAny
Definition: tqual.h:28
#define Assert(condition)
Definition: c.h:670
#define lfirst(lc)
Definition: pg_list.h:106
WalTimeSample buffer[LAG_TRACKER_BUFFER_SIZE]
Definition: walsender.c:214
RowMarkType markType
Definition: execnodes.h:541
AttrNumber toidAttNo
Definition: execnodes.h:565
#define DatumGetPointer(X)
Definition: postgres.h:555
int errmsg(const char *fmt,...)
Definition: elog.c:797
FdwRoutine * GetFdwRoutineForRelation(Relation relation, bool makecopy)
Definition: foreign.c:395
Datum ExecGetJunkAttribute(TupleTableSlot *slot, AttrNumber attno, bool *isNull)
Definition: execJunk.c:248
#define elog
Definition: elog.h:219
EState * estate
Definition: execnodes.h:916
int Buffer
Definition: buf.h:23
AttrNumber ctidAttNo
Definition: execnodes.h:564
RefetchForeignRow_function RefetchForeignRow
Definition: fdwapi.h:215
#define HeapTupleHeaderGetDatumLength(tup)
Definition: htup_details.h:444

◆ EvalPlanQualGetTuple()

HeapTuple EvalPlanQualGetTuple ( EPQState epqstate,
Index  rti 
)

Definition at line 2849 of file execMain.c.

References Assert, EState::es_epqTuple, and EPQState::estate.

2850 {
2851  EState *estate = epqstate->estate;
2852 
2853  Assert(rti > 0);
2854 
2855  return estate->es_epqTuple[rti - 1];
2856 }
HeapTuple * es_epqTuple
Definition: execnodes.h:506
#define Assert(condition)
Definition: c.h:670
EState * estate
Definition: execnodes.h:916

◆ EvalPlanQualInit()

void EvalPlanQualInit ( EPQState epqstate,
EState estate,
Plan subplan,
List auxrowmarks,
int  epqParam 
)

Definition at line 2794 of file execMain.c.

References EPQState::arowMarks, EPQState::epqParam, EPQState::estate, EPQState::origslot, EPQState::plan, and EPQState::planstate.

Referenced by apply_handle_delete(), apply_handle_update(), ExecInitLockRows(), and ExecInitModifyTable().

2796 {
2797  /* Mark the EPQ state inactive */
2798  epqstate->estate = NULL;
2799  epqstate->planstate = NULL;
2800  epqstate->origslot = NULL;
2801  /* ... and remember data that EvalPlanQualBegin will need */
2802  epqstate->plan = subplan;
2803  epqstate->arowMarks = auxrowmarks;
2804  epqstate->epqParam = epqParam;
2805 }
PlanState * planstate
Definition: execnodes.h:917
List * arowMarks
Definition: execnodes.h:920
TupleTableSlot * origslot
Definition: execnodes.h:918
Plan * plan
Definition: execnodes.h:919
int epqParam
Definition: execnodes.h:921
EState * estate
Definition: execnodes.h:916

◆ EvalPlanQualNext()

TupleTableSlot* EvalPlanQualNext ( EPQState epqstate)

Definition at line 2999 of file execMain.c.

References EState::es_query_cxt, EPQState::estate, ExecProcNode(), MemoryContextSwitchTo(), and EPQState::planstate.

Referenced by EvalPlanQual(), and ExecLockRows().

3000 {
3001  MemoryContext oldcontext;
3002  TupleTableSlot *slot;
3003 
3004  oldcontext = MemoryContextSwitchTo(epqstate->estate->es_query_cxt);
3005  slot = ExecProcNode(epqstate->planstate);
3006  MemoryContextSwitchTo(oldcontext);
3007 
3008  return slot;
3009 }
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
PlanState * planstate
Definition: execnodes.h:917
MemoryContext es_query_cxt
Definition: execnodes.h:471
static TupleTableSlot * ExecProcNode(PlanState *node)
Definition: executor.h:236
EState * estate
Definition: execnodes.h:916

◆ EvalPlanQualSetPlan()

void EvalPlanQualSetPlan ( EPQState epqstate,
Plan subplan,
List auxrowmarks 
)

Definition at line 2813 of file execMain.c.

References EPQState::arowMarks, EvalPlanQualEnd(), and EPQState::plan.

Referenced by ExecInitModifyTable(), and ExecModifyTable().

2814 {
2815  /* If we have a live EPQ query, shut it down */
2816  EvalPlanQualEnd(epqstate);
2817  /* And set/change the plan pointer */
2818  epqstate->plan = subplan;
2819  /* The rowmarks depend on the plan, too */
2820  epqstate->arowMarks = auxrowmarks;
2821 }
void EvalPlanQualEnd(EPQState *epqstate)
Definition: execMain.c:3208
List * arowMarks
Definition: execnodes.h:920
Plan * plan
Definition: execnodes.h:919

◆ EvalPlanQualSetTuple()

void EvalPlanQualSetTuple ( EPQState epqstate,
Index  rti,
HeapTuple  tuple 
)

Definition at line 2829 of file execMain.c.

References Assert, EState::es_epqTuple, EState::es_epqTupleSet, EPQState::estate, and heap_freetuple().

Referenced by EvalPlanQual(), EvalPlanQualFetchRowMarks(), and ExecLockRows().

2830 {
2831  EState *estate = epqstate->estate;
2832 
2833  Assert(rti > 0);
2834 
2835  /*
2836  * free old test tuple, if any, and store new tuple where relation's scan
2837  * node will see it
2838  */
2839  if (estate->es_epqTuple[rti - 1] != NULL)
2840  heap_freetuple(estate->es_epqTuple[rti - 1]);
2841  estate->es_epqTuple[rti - 1] = tuple;
2842  estate->es_epqTupleSet[rti - 1] = true;
2843 }
HeapTuple * es_epqTuple
Definition: execnodes.h:506
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1373
#define Assert(condition)
Definition: c.h:670
bool * es_epqTupleSet
Definition: execnodes.h:507
EState * estate
Definition: execnodes.h:916

◆ ExecAssignExprContext()

◆ ExecAssignProjectionInfo()

void ExecAssignProjectionInfo ( PlanState planstate,
TupleDesc  inputDesc 
)

Definition at line 494 of file execUtils.c.

References ExecBuildProjectionInfo(), PlanState::plan, PlanState::ps_ExprContext, PlanState::ps_ProjInfo, PlanState::ps_ResultTupleSlot, and Plan::targetlist.

Referenced by ExecAssignScanProjectionInfoWithVarno(), ExecInitAgg(), ExecInitGather(), ExecInitGatherMerge(), ExecInitGroup(), ExecInitHashJoin(), ExecInitMergeJoin(), ExecInitNestLoop(), ExecInitResult(), and ExecInitWindowAgg().

496 {
497  planstate->ps_ProjInfo =
499  planstate->ps_ExprContext,
500  planstate->ps_ResultTupleSlot,
501  planstate,
502  inputDesc);
503 }
ProjectionInfo * ps_ProjInfo
Definition: execnodes.h:884
ExprContext * ps_ExprContext
Definition: execnodes.h:883
TupleTableSlot * ps_ResultTupleSlot
Definition: execnodes.h:882
Plan * plan
Definition: execnodes.h:849
List * targetlist
Definition: plannodes.h:144
ProjectionInfo * ExecBuildProjectionInfo(List *targetList, ExprContext *econtext, TupleTableSlot *slot, PlanState *parent, TupleDesc inputDesc)
Definition: execExpr.c:301

◆ ExecAssignResultType()

void ExecAssignResultType ( PlanState planstate,
TupleDesc  tupDesc 
)

Definition at line 435 of file execUtils.c.

References ExecSetSlotDescriptor(), and PlanState::ps_ResultTupleSlot.

Referenced by ExecAssignResultTypeFromTL(), and ExecInitModifyTable().

436 {
437  TupleTableSlot *slot = planstate->ps_ResultTupleSlot;
438 
439  ExecSetSlotDescriptor(slot, tupDesc);
440 }
TupleTableSlot * ps_ResultTupleSlot
Definition: execnodes.h:882
void ExecSetSlotDescriptor(TupleTableSlot *slot, TupleDesc tupdesc)
Definition: execTuples.c:247

◆ ExecAssignResultTypeFromTL()

void ExecAssignResultTypeFromTL ( PlanState planstate)

Definition at line 447 of file execUtils.c.

References ExecAssignResultType(), ExecContextForcesOids(), ExecTypeFromTL(), PlanState::plan, and Plan::targetlist.

Referenced by ExecInitAgg(), ExecInitAppend(), ExecInitBitmapHeapScan(), ExecInitCteScan(), ExecInitCustomScan(), ExecInitForeignScan(), ExecInitFunctionScan(), ExecInitGather(), ExecInitGatherMerge(), ExecInitGroup(), ExecInitHash(), ExecInitHashJoin(), ExecInitIndexOnlyScan(), ExecInitIndexScan(), ExecInitLimit(), ExecInitLockRows(), ExecInitMaterial(), ExecInitMergeAppend(), ExecInitMergeJoin(), ExecInitNamedTuplestoreScan(), ExecInitNestLoop(), ExecInitProjectSet(), ExecInitRecursiveUnion(), ExecInitResult(), ExecInitSampleScan(), ExecInitSeqScan(), ExecInitSetOp(), ExecInitSort(), ExecInitSubqueryScan(), ExecInitTableFuncScan(), ExecInitTidScan(), ExecInitUnique(), ExecInitValuesScan(), ExecInitWindowAgg(), and ExecInitWorkTableScan().

448 {
449  bool hasoid;
450  TupleDesc tupDesc;
451 
452  if (ExecContextForcesOids(planstate, &hasoid))
453  {
454  /* context forces OID choice; hasoid is now set correctly */
455  }
456  else
457  {
458  /* given free choice, don't leave space for OIDs in result tuples */
459  hasoid = false;
460  }
461 
462  /*
463  * ExecTypeFromTL needs the parse-time representation of the tlist, not a
464  * list of ExprStates. This is good because some plan nodes don't bother
465  * to set up planstate->targetlist ...
466  */
467  tupDesc = ExecTypeFromTL(planstate->plan->targetlist, hasoid);
468  ExecAssignResultType(planstate, tupDesc);
469 }
void ExecAssignResultType(PlanState *planstate, TupleDesc tupDesc)
Definition: execUtils.c:435
TupleDesc ExecTypeFromTL(List *targetList, bool hasoid)
Definition: execTuples.c:888
Plan * plan
Definition: execnodes.h:849
List * targetlist
Definition: plannodes.h:144
bool ExecContextForcesOids(PlanState *planstate, bool *hasoids)
Definition: execMain.c:1513

◆ ExecAssignScanProjectionInfo()

void ExecAssignScanProjectionInfo ( ScanState node)

◆ ExecAssignScanProjectionInfoWithVarno()

void ExecAssignScanProjectionInfoWithVarno ( ScanState node,
Index  varno 
)

Definition at line 249 of file execScan.c.

References ExecAssignProjectionInfo(), Scan::plan, PlanState::plan, ScanState::ps, PlanState::ps_ProjInfo, ScanState::ss_ScanTupleSlot, Plan::targetlist, tlist_matches_tupdesc(), and TupleTableSlot::tts_tupleDescriptor.

Referenced by ExecAssignScanProjectionInfo(), ExecInitCustomScan(), ExecInitForeignScan(), and ExecInitIndexOnlyScan().

250 {
251  Scan *scan = (Scan *) node->ps.plan;
252 
253  if (tlist_matches_tupdesc(&node->ps,
254  scan->plan.targetlist,
255  varno,
257  node->ps.ps_ProjInfo = NULL;
258  else
261 }
Plan plan
Definition: plannodes.h:328
ProjectionInfo * ps_ProjInfo
Definition: execnodes.h:884
TupleTableSlot * ss_ScanTupleSlot
Definition: execnodes.h:1106
PlanState ps
Definition: execnodes.h:1103
void ExecAssignProjectionInfo(PlanState *planstate, TupleDesc inputDesc)
Definition: execUtils.c:494
TupleDesc tts_tupleDescriptor
Definition: tuptable.h:121
static bool tlist_matches_tupdesc(PlanState *ps, List *tlist, Index varno, TupleDesc tupdesc)
Definition: execScan.c:264
Plan * plan
Definition: execnodes.h:849
List * targetlist
Definition: plannodes.h:144

◆ ExecAssignScanType()

◆ ExecAssignScanTypeFromOuterPlan()

void ExecAssignScanTypeFromOuterPlan ( ScanState scanstate)

Definition at line 559 of file execUtils.c.

References ExecAssignScanType(), ExecGetResultType(), outerPlan, and outerPlanState.

Referenced by ExecInitAgg(), ExecInitGroup(), ExecInitMaterial(), ExecInitSort(), and ExecInitWindowAgg().

560 {
562  TupleDesc tupDesc;
563 
564  outerPlan = outerPlanState(scanstate);
565  tupDesc = ExecGetResultType(outerPlan);
566 
567  ExecAssignScanType(scanstate, tupDesc);
568 }
#define outerPlanState(node)
Definition: execnodes.h:895
#define outerPlan(node)
Definition: plannodes.h:174
TupleDesc ExecGetResultType(PlanState *planstate)
Definition: execUtils.c:476
void ExecAssignScanType(ScanState *scanstate, TupleDesc tupDesc)
Definition: execUtils.c:547

◆ ExecBuildAuxRowMark()

ExecAuxRowMark* ExecBuildAuxRowMark ( ExecRowMark erm,
List targetlist 
)

Definition at line 2407 of file execMain.c.

References AttributeNumberIsValid, ExecAuxRowMark::ctidAttNo, elog, ERROR, ExecFindJunkAttributeInTlist(), ExecRowMark::markType, palloc0(), ExecRowMark::prti, ROW_MARK_COPY, ExecAuxRowMark::rowmark, ExecRowMark::rowmarkId, ExecRowMark::rti, snprintf(), ExecAuxRowMark::toidAttNo, and ExecAuxRowMark::wholeAttNo.

Referenced by ExecInitLockRows(), and ExecInitModifyTable().

2408 {
2409  ExecAuxRowMark *aerm = (ExecAuxRowMark *) palloc0(sizeof(ExecAuxRowMark));
2410  char resname[32];
2411 
2412  aerm->rowmark = erm;
2413 
2414  /* Look up the resjunk columns associated with this rowmark */
2415  if (erm->markType != ROW_MARK_COPY)
2416  {
2417  /* need ctid for all methods other than COPY */
2418  snprintf(resname, sizeof(resname), "ctid%u", erm->rowmarkId);
2419  aerm->ctidAttNo = ExecFindJunkAttributeInTlist(targetlist,
2420  resname);
2421  if (!AttributeNumberIsValid(aerm->ctidAttNo))
2422  elog(ERROR, "could not find junk %s column", resname);
2423  }
2424  else
2425  {
2426  /* need wholerow if COPY */
2427  snprintf(resname, sizeof(resname), "wholerow%u", erm->rowmarkId);
2428  aerm->wholeAttNo = ExecFindJunkAttributeInTlist(targetlist,
2429  resname);
2430  if (!AttributeNumberIsValid(aerm->wholeAttNo))
2431  elog(ERROR, "could not find junk %s column", resname);
2432  }
2433 
2434  /* if child rel, need tableoid */
2435  if (erm->rti != erm->prti)
2436  {
2437  snprintf(resname, sizeof(resname), "tableoid%u", erm->rowmarkId);
2438  aerm->toidAttNo = ExecFindJunkAttributeInTlist(targetlist,
2439  resname);
2440  if (!AttributeNumberIsValid(aerm->toidAttNo))
2441  elog(ERROR, "could not find junk %s column", resname);
2442  }
2443 
2444  return aerm;
2445 }
AttrNumber ExecFindJunkAttributeInTlist(List *targetlist, const char *attrName)
Definition: execJunk.c:221
int snprintf(char *str, size_t count, const char *fmt,...) pg_attribute_printf(3
ExecRowMark * rowmark
Definition: execnodes.h:563
#define ERROR
Definition: elog.h:43
Index rti
Definition: execnodes.h:538
AttrNumber wholeAttNo
Definition: execnodes.h:566
Index prti
Definition: execnodes.h:539
Index rowmarkId
Definition: execnodes.h:540
#define AttributeNumberIsValid(attributeNumber)
Definition: attnum.h:34
void * palloc0(Size size)
Definition: mcxt.c:877
RowMarkType markType
Definition: execnodes.h:541
AttrNumber toidAttNo
Definition: execnodes.h:565
#define elog
Definition: elog.h:219
AttrNumber ctidAttNo
Definition: execnodes.h:564

◆ ExecBuildProjectionInfo()

ProjectionInfo* ExecBuildProjectionInfo ( List targetList,
ExprContext econtext,
TupleTableSlot slot,
PlanState parent,
TupleDesc  inputDesc 
)

Definition at line 301 of file execExpr.c.

References ExprEvalStep::assign_tmp, ExprEvalStep::assign_var, ExprEvalStep::d, EEOP_ASSIGN_INNER_VAR, EEOP_ASSIGN_OUTER_VAR, EEOP_ASSIGN_SCAN_VAR, EEOP_ASSIGN_TMP, EEOP_ASSIGN_TMP_MAKE_RO, EEOP_DONE, ExecInitExprRec(), ExecInitExprSlots(), ExecReadyExpr(), ExprState::expr, TargetEntry::expr, ExprEvalPushStep(), exprType(), get_typlen(), INNER_VAR, IsA, lfirst_node, makeNode, ExprEvalStep::opcode, OUTER_VAR, ProjectionInfo::pi_exprContext, ProjectionInfo::pi_state, TargetEntry::resno, ExprState::resnull, ExprState::resultslot, ExprState::resvalue, T_ExprState, ExprState::tag, TupleDescAttr, Node::type, Var::varattno, Var::varno, and Var::vartype.

Referenced by ExecAssignProjectionInfo(), ExecInitAgg(), ExecInitModifyTable(), ExecInitSubPlan(), and ExecProcNode().

306 {
308  ExprState *state;
309  ExprEvalStep scratch;
310  ListCell *lc;
311 
312  projInfo->pi_exprContext = econtext;
313  /* We embed ExprState into ProjectionInfo instead of doing extra palloc */
314  projInfo->pi_state.tag.type = T_ExprState;
315  state = &projInfo->pi_state;
316  state->expr = (Expr *) targetList;
317  state->resultslot = slot;
318 
319  /* Insert EEOP_*_FETCHSOME steps as needed */
320  ExecInitExprSlots(state, (Node *) targetList);
321 
322  /* Now compile each tlist column */
323  foreach(lc, targetList)
324  {
325  TargetEntry *tle = lfirst_node(TargetEntry, lc);
326  Var *variable = NULL;
327  AttrNumber attnum = 0;
328  bool isSafeVar = false;
329 
330  /*
331  * If tlist expression is a safe non-system Var, use the fast-path
332  * ASSIGN_*_VAR opcodes. "Safe" means that we don't need to apply
333  * CheckVarSlotCompatibility() during plan startup. If a source slot
334  * was provided, we make the equivalent tests here; if a slot was not
335  * provided, we assume that no check is needed because we're dealing
336  * with a non-relation-scan-level expression.
337  */
338  if (tle->expr != NULL &&
339  IsA(tle->expr, Var) &&
340  ((Var *) tle->expr)->varattno > 0)
341  {
342  /* Non-system Var, but how safe is it? */
343  variable = (Var *) tle->expr;
344  attnum = variable->varattno;
345 
346  if (inputDesc == NULL)
347  isSafeVar = true; /* can't check, just assume OK */
348  else if (attnum <= inputDesc->natts)
349  {
350  Form_pg_attribute attr = TupleDescAttr(inputDesc, attnum - 1);
351 
352  /*
353  * If user attribute is dropped or has a type mismatch, don't
354  * use ASSIGN_*_VAR. Instead let the normal expression
355  * machinery handle it (which'll possibly error out).
356  */
357  if (!attr->attisdropped && variable->vartype == attr->atttypid)
358  {
359  isSafeVar = true;
360  }
361  }
362  }
363 
364  if (isSafeVar)
365  {
366  /* Fast-path: just generate an EEOP_ASSIGN_*_VAR step */
367  switch (variable->varno)
368  {
369  case INNER_VAR:
370  /* get the tuple from the inner node */
371  scratch.opcode = EEOP_ASSIGN_INNER_VAR;
372  break;
373 
374  case OUTER_VAR:
375  /* get the tuple from the outer node */
376  scratch.opcode = EEOP_ASSIGN_OUTER_VAR;
377  break;
378 
379  /* INDEX_VAR is handled by default case */
380 
381  default:
382  /* get the tuple from the relation being scanned */
383  scratch.opcode = EEOP_ASSIGN_SCAN_VAR;
384  break;
385  }
386 
387  scratch.d.assign_var.attnum = attnum - 1;
388  scratch.d.assign_var.resultnum = tle->resno - 1;
389  ExprEvalPushStep(state, &scratch);
390  }
391  else
392  {
393  /*
394  * Otherwise, compile the column expression normally.
395  *
396  * We can't tell the expression to evaluate directly into the
397  * result slot, as the result slot (and the exprstate for that
398  * matter) can change between executions. We instead evaluate
399  * into the ExprState's resvalue/resnull and then move.
400  */
401  ExecInitExprRec(tle->expr, parent, state,
402  &state->resvalue, &state->resnull);
403 
404  /*
405  * Column might be referenced multiple times in upper nodes, so
406  * force value to R/O - but only if it could be an expanded datum.
407  */
408  if (get_typlen(exprType((Node *) tle->expr)) == -1)
410  else
411  scratch.opcode = EEOP_ASSIGN_TMP;
412  scratch.d.assign_tmp.resultnum = tle->resno - 1;
413  ExprEvalPushStep(state, &scratch);
414  }
415  }
416 
417  scratch.opcode = EEOP_DONE;
418  ExprEvalPushStep(state, &scratch);
419 
420  ExecReadyExpr(state);
421 
422  return projInfo;
423 }
Node tag
Definition: execnodes.h:55
#define IsA(nodeptr, _type_)
Definition: nodes.h:561
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:90
Definition: nodes.h:510
AttrNumber varattno
Definition: primnodes.h:168
TupleTableSlot * resultslot
Definition: execnodes.h:69
union ExprEvalStep::@52 d
Definition: primnodes.h:163
bool resnull
Definition: execnodes.h:63
Expr * expr
Definition: execnodes.h:83
Oid vartype
Definition: primnodes.h:170
static void ExecInitExprSlots(ExprState *state, Node *node)
Definition: execExpr.c:2179
#define lfirst_node(type, lc)
Definition: pg_list.h:109
NodeTag type
Definition: nodes.h:512
AttrNumber resno
Definition: primnodes.h:1376
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:187
Index varno
Definition: primnodes.h:166
static void ExecReadyExpr(ExprState *state)
Definition: execExpr.c:574
struct ExprEvalStep::@52::@56 assign_var
#define INNER_VAR
Definition: primnodes.h:153
#define makeNode(_type_)
Definition: nodes.h:558
Definition: regguts.h:298
intptr_t opcode
Definition: execExpr.h:227
Expr * expr
Definition: primnodes.h:1375
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:42
static void ExprEvalPushStep(ExprState *es, const ExprEvalStep *s)
Definition: execExpr.c:2050
int16 get_typlen(Oid typid)
Definition: lsyscache.c:1947
ExprState pi_state
Definition: execnodes.h:296
static void ExecInitExprRec(Expr *node, PlanState *parent, ExprState *state, Datum *resv, bool *resnull)
Definition: execExpr.c:589
ExprContext * pi_exprContext
Definition: execnodes.h:298
Datum resvalue
Definition: execnodes.h:64
int16 AttrNumber
Definition: attnum.h:21
#define OUTER_VAR
Definition: primnodes.h:154
struct ExprEvalStep::@52::@57 assign_tmp

◆ ExecCheck()

bool ExecCheck ( ExprState state,
ExprContext context 
)

Definition at line 544 of file execExpr.c.

References Assert, DatumGetBool, EEO_FLAG_IS_QUAL, ExecEvalExprSwitchContext(), and ExprState::flags.

Referenced by ATRewriteTable(), check_default_allows_bound(), domain_check_input(), ExecPartitionCheck(), ExecQual(), ExecRelCheck(), and validateCheckConstraint().

545 {
546  Datum ret;
547  bool isnull;
548 
549  /* short-circuit (here and in ExecInitCheck) for empty restriction list */
550  if (state == NULL)
551  return true;
552 
553  /* verify that expression was not compiled using ExecInitQual */
554  Assert(!(state->flags & EEO_FLAG_IS_QUAL));
555 
556  ret = ExecEvalExprSwitchContext(state, econtext, &isnull);
557 
558  if (isnull)
559  return true;
560 
561  return DatumGetBool(ret);
562 }
static Datum ExecEvalExprSwitchContext(ExprState *state, ExprContext *econtext, bool *isNull)
Definition: executor.h:291
#define EEO_FLAG_IS_QUAL
Definition: execnodes.h:51
#define DatumGetBool(X)
Definition: postgres.h:399
uintptr_t Datum
Definition: postgres.h:372
#define Assert(condition)
Definition: c.h:670
uint8 flags
Definition: execnodes.h:57

◆ ExecCheckIndexConstraints()

bool ExecCheckIndexConstraints ( TupleTableSlot slot,
EState estate,
ItemPointer  conflictTid,
List arbiterIndexes 
)

Definition at line 475 of file execIndexing.c.

References CEOUC_WAIT, check_exclusion_or_unique_constraint(), ExprContext::ecxt_scantuple, elog, ereport, errcode(), errmsg(), ERROR, errtableconstraint(), EState::es_result_relation_info, ExecPrepareQual(), ExecQual(), FormIndexDatum(), GetPerTupleExprContext, i, IndexInfo::ii_ExclusionOps, IndexInfo::ii_Predicate, IndexInfo::ii_PredicateState, IndexInfo::ii_ReadyForInserts, IndexInfo::ii_Unique, INDEX_MAX_KEYS, ItemPointerSetInvalid, list_member_oid(), NIL, RelationData::rd_index, RelationGetRelationName, ResultRelInfo::ri_IndexRelationDescs, ResultRelInfo::ri_IndexRelationInfo, ResultRelInfo::ri_NumIndices, ResultRelInfo::ri_RelationDesc, and values.

Referenced by ExecInsert().

478 {
479  ResultRelInfo *resultRelInfo;
480  int i;
481  int numIndices;
482  RelationPtr relationDescs;
483  Relation heapRelation;
484  IndexInfo **indexInfoArray;
485  ExprContext *econtext;
487  bool isnull[INDEX_MAX_KEYS];
488  ItemPointerData invalidItemPtr;
489  bool checkedIndex = false;
490 
491  ItemPointerSetInvalid(conflictTid);
492  ItemPointerSetInvalid(&invalidItemPtr);
493 
494  /*
495  * Get information from the result relation info structure.
496  */
497  resultRelInfo = estate->es_result_relation_info;
498  numIndices = resultRelInfo->ri_NumIndices;
499  relationDescs = resultRelInfo->ri_IndexRelationDescs;
500  indexInfoArray = resultRelInfo->ri_IndexRelationInfo;
501  heapRelation = resultRelInfo->ri_RelationDesc;
502 
503  /*
504  * We will use the EState's per-tuple context for evaluating predicates
505  * and index expressions (creating it if it's not already there).
506  */
507  econtext = GetPerTupleExprContext(estate);
508 
509  /* Arrange for econtext's scan tuple to be the tuple under test */
510  econtext->ecxt_scantuple = slot;
511 
512  /*
513  * For each index, form index tuple and check if it satisfies the
514  * constraint.
515  */
516  for (i = 0; i < numIndices; i++)
517  {
518  Relation indexRelation = relationDescs[i];
519  IndexInfo *indexInfo;
520  bool satisfiesConstraint;
521 
522  if (indexRelation == NULL)
523  continue;
524 
525  indexInfo = indexInfoArray[i];
526 
527  if (!indexInfo->ii_Unique && !indexInfo->ii_ExclusionOps)
528  continue;
529 
530  /* If the index is marked as read-only, ignore it */
531  if (!indexInfo->ii_ReadyForInserts)
532  continue;
533 
534  /* When specific arbiter indexes requested, only examine them */
535  if (arbiterIndexes != NIL &&
536  !list_member_oid(arbiterIndexes,
537  indexRelation->rd_index->indexrelid))
538  continue;
539 
540  if (!indexRelation->rd_index->indimmediate)
541  ereport(ERROR,
542  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
543  errmsg("ON CONFLICT does not support deferrable unique constraints/exclusion constraints as arbiters"),
544  errtableconstraint(heapRelation,
545  RelationGetRelationName(indexRelation))));
546 
547  checkedIndex = true;
548 
549  /* Check for partial index */
550  if (indexInfo->ii_Predicate != NIL)
551  {
552  ExprState *predicate;
553 
554  /*
555  * If predicate state not set up yet, create it (in the estate's
556  * per-query context)
557  */
558  predicate = indexInfo->ii_PredicateState;
559  if (predicate == NULL)
560  {
561  predicate = ExecPrepareQual(indexInfo->ii_Predicate, estate);
562  indexInfo->ii_PredicateState = predicate;
563  }
564 
565  /* Skip this index-update if the predicate isn't satisfied */
566  if (!ExecQual(predicate, econtext))
567  continue;
568  }
569 
570  /*
571  * FormIndexDatum fills in its values and isnull parameters with the
572  * appropriate values for the column(s) of the index.
573  */
574  FormIndexDatum(indexInfo,
575  slot,
576  estate,
577  values,
578  isnull);
579 
580  satisfiesConstraint =
581  check_exclusion_or_unique_constraint(heapRelation, indexRelation,
582  indexInfo, &invalidItemPtr,
583  values, isnull, estate, false,
584  CEOUC_WAIT, true,
585  conflictTid);
586  if (!satisfiesConstraint)
587  return false;
588  }
589 
590  if (arbiterIndexes != NIL && !checkedIndex)
591  elog(ERROR, "unexpected failure to find arbiter index");
592 
593  return true;
594 }
void FormIndexDatum(IndexInfo *indexInfo, TupleTableSlot *slot, EState *estate, Datum *values, bool *isnull)
Definition: index.c:1774
int ri_NumIndices
Definition: execnodes.h:357
#define NIL
Definition: pg_list.h:69
Relation ri_RelationDesc
Definition: execnodes.h:354
List * ii_Predicate
Definition: execnodes.h:138
ExprState * ii_PredicateState
Definition: execnodes.h:139
int errcode(int sqlerrcode)
Definition: elog.c:575
static bool ExecQual(ExprState *state, ExprContext *econtext)
Definition: executor.h:356
static bool check_exclusion_or_unique_constraint(Relation heap, Relation index, IndexInfo *indexInfo, ItemPointer tupleid, Datum *values, bool *isnull, EState *estate, bool newIndex, CEOUC_WAIT_MODE waitMode, bool errorOK, ItemPointer conflictTid)
Definition: execIndexing.c:639
#define GetPerTupleExprContext(estate)
Definition: executor.h:467
int errtableconstraint(Relation rel, const char *conname)
Definition: relcache.c:5312
Form_pg_index rd_index
Definition: rel.h:159
#define ERROR
Definition: elog.h:43
#define RelationGetRelationName(relation)
Definition: rel.h:445
ExprState * ExecPrepareQual(List *qual, EState *estate)
Definition: execExpr.c:465
bool ii_ReadyForInserts
Definition: execnodes.h:147
#define ereport(elevel, rest)
Definition: elog.h:122
uintptr_t Datum
Definition: postgres.h:372
bool ii_Unique
Definition: execnodes.h:146
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:505
#define INDEX_MAX_KEYS
TupleTableSlot * ecxt_scantuple
Definition: execnodes.h:197
static Datum values[MAXATTR]
Definition: bootstrap.c:164
#define ItemPointerSetInvalid(pointer)
Definition: itemptr.h:150
Oid * ii_ExclusionOps
Definition: execnodes.h:140
int errmsg(const char *fmt,...)
Definition: elog.c:797
IndexInfo ** ri_IndexRelationInfo
Definition: execnodes.h:363
int i
#define elog
Definition: elog.h:219
RelationPtr ri_IndexRelationDescs
Definition: execnodes.h:360
ResultRelInfo * es_result_relation_info
Definition: execnodes.h:443

◆ ExecCheckRTPerms()

bool ExecCheckRTPerms ( List rangeTable,
bool  ereport_on_violation 
)

Definition at line 568 of file execMain.c.

References ACL_KIND_CLASS, aclcheck_error(), ACLCHECK_NO_PRIV, Assert, ExecCheckRTEPerms(), ExecutorCheckPerms_hook, get_rel_name(), lfirst, RangeTblEntry::relid, RTE_RELATION, and RangeTblEntry::rtekind.

Referenced by DoCopy(), InitPlan(), intorel_startup(), and RI_Initial_Check().

569 {
570  ListCell *l;
571  bool result = true;
572 
573  foreach(l, rangeTable)
574  {
575  RangeTblEntry *rte = (RangeTblEntry *) lfirst(l);
576 
577  result = ExecCheckRTEPerms(rte);
578  if (!result)
579  {
580  Assert(rte->rtekind == RTE_RELATION);
581  if (ereport_on_violation)
583  get_rel_name(rte->relid));
584  return false;
585  }
586  }
587 
589  result = (*ExecutorCheckPerms_hook) (rangeTable,
590  ereport_on_violation);
591  return result;
592 }
void aclcheck_error(AclResult aclerr, AclObjectKind objectkind, const char *objectname)
Definition: aclchk.c:3399
static bool ExecCheckRTEPerms(RangeTblEntry *rte)
Definition: execMain.c:599
ExecutorCheckPerms_hook_type ExecutorCheckPerms_hook
Definition: execMain.c:75
#define Assert(condition)
Definition: c.h:670
#define lfirst(lc)
Definition: pg_list.h:106
RTEKind rtekind
Definition: parsenodes.h:951
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1726

◆ ExecCleanTargetListLength()

int ExecCleanTargetListLength ( List targetlist)

Definition at line 1016 of file execUtils.c.

References lfirst_node, and TargetEntry::resjunk.

Referenced by check_sql_fn_retval(), and ExecTypeFromTLInternal().

1017 {
1018  int len = 0;
1019  ListCell *tl;
1020 
1021  foreach(tl, targetlist)
1022  {
1023  TargetEntry *curTle = lfirst_node(TargetEntry, tl);
1024 
1025  if (!curTle->resjunk)
1026  len++;
1027  }
1028  return len;
1029 }
bool resjunk
Definition: primnodes.h:1382
#define lfirst_node(type, lc)
Definition: pg_list.h:109

◆ ExecCleanTypeFromTL()

TupleDesc ExecCleanTypeFromTL ( List targetList,
bool  hasoid 
)

Definition at line 900 of file execTuples.c.

References ExecTypeFromTLInternal().

Referenced by ExecInitJunkFilter(), PlanCacheComputeResultDesc(), and PortalStart().

901 {
902  return ExecTypeFromTLInternal(targetList, hasoid, true);
903 }
static TupleDesc ExecTypeFromTLInternal(List *targetList, bool hasoid, bool skipjunk)
Definition: execTuples.c:906

◆ ExecCleanUpTriggerState()

void ExecCleanUpTriggerState ( EState estate)

Definition at line 1466 of file execMain.c.

References EState::es_trig_target_relations, ExecCloseIndices(), heap_close, lfirst, NoLock, and ResultRelInfo::ri_RelationDesc.

Referenced by afterTriggerInvokeEvents(), CopyFrom(), EvalPlanQualEnd(), and ExecEndPlan().

1467 {
1468  ListCell *l;
1469 
1470  foreach(l, estate->es_trig_target_relations)
1471  {
1472  ResultRelInfo *resultRelInfo = (ResultRelInfo *) lfirst(l);
1473 
1474  /* Close indices and then the relation itself */
1475  ExecCloseIndices(resultRelInfo);
1476  heap_close(resultRelInfo->ri_RelationDesc, NoLock);
1477  }
1478 }
Relation ri_RelationDesc
Definition: execnodes.h:354
#define heap_close(r, l)
Definition: heapam.h:97
#define NoLock
Definition: lockdefs.h:34
List * es_trig_target_relations
Definition: execnodes.h:459
#define lfirst(lc)
Definition: pg_list.h:106
void ExecCloseIndices(ResultRelInfo *resultRelInfo)
Definition: execIndexing.c:224

◆ ExecCloseIndices()

void ExecCloseIndices ( ResultRelInfo resultRelInfo)

Definition at line 224 of file execIndexing.c.

References i, index_close(), ResultRelInfo::ri_IndexRelationDescs, ResultRelInfo::ri_NumIndices, and RowExclusiveLock.

Referenced by apply_handle_delete(), apply_handle_insert(), apply_handle_update(), CatalogCloseIndexes(), CopyFrom(), ExecCleanUpTriggerState(), ExecEndModifyTable(), and ExecEndPlan().

225 {
226  int i;
227  int numIndices;
228  RelationPtr indexDescs;
229 
230  numIndices = resultRelInfo->ri_NumIndices;
231  indexDescs = resultRelInfo->ri_IndexRelationDescs;
232 
233  for (i = 0; i < numIndices; i++)
234  {
235  if (indexDescs[i] == NULL)
236  continue; /* shouldn't happen? */
237 
238  /* Drop lock acquired by ExecOpenIndices */
239  index_close(indexDescs[i], RowExclusiveLock);
240  }
241 
242  /*
243  * XXX should free indexInfo array here too? Currently we assume that
244  * such stuff will be cleaned up automatically in FreeExecutorState.
245  */
246 }
int ri_NumIndices
Definition: execnodes.h:357
#define RowExclusiveLock
Definition: lockdefs.h:38
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:176
int i
RelationPtr ri_IndexRelationDescs
Definition: execnodes.h:360

◆ ExecCloseScanRelation()

void ExecCloseScanRelation ( Relation  scanrel)

Definition at line 668 of file execUtils.c.

References heap_close, and NoLock.

Referenced by ExecEndBitmapHeapScan(), ExecEndCustomScan(), ExecEndForeignScan(), ExecEndIndexOnlyScan(), ExecEndIndexScan(), ExecEndSampleScan(), ExecEndSeqScan(), and ExecEndTidScan().

669 {
670  heap_close(scanrel, NoLock);
671 }
#define heap_close(r, l)
Definition: heapam.h:97
#define NoLock
Definition: lockdefs.h:34

◆ ExecConstraints()

void ExecConstraints ( ResultRelInfo resultRelInfo,
TupleTableSlot slot,
EState estate 
)

Definition at line 1941 of file execMain.c.

References Assert, bms_union(), tupleDesc::constr, convert_tuples_by_name(), do_convert_tuple(), ereport, errcode(), errdetail(), errmsg(), ERROR, errtablecol(), errtableconstraint(), ExecBuildSlotValueDescription(), ExecFetchSlotTuple(), ExecPartitionCheck(), ExecRelCheck(), ExecSetSlotDescriptor(), ExecStoreTuple(), GetInsertedColumns, gettext_noop, GetUpdatedColumns, tupleConstr::has_not_null, InvalidBuffer, NameStr, tupleDesc::natts, tupleConstr::num_check, RelationGetDescr, RelationGetRelationName, RelationGetRelid, ResultRelInfo::ri_PartitionCheck, ResultRelInfo::ri_PartitionRoot, ResultRelInfo::ri_RelationDesc, slot_attisnull(), and TupleDescAttr.

Referenced by CopyFrom(), ExecInsert(), ExecSimpleRelationInsert(), ExecSimpleRelationUpdate(), and ExecUpdate().

1943 {
1944  Relation rel = resultRelInfo->ri_RelationDesc;
1945  TupleDesc tupdesc = RelationGetDescr(rel);
1946  TupleConstr *constr = tupdesc->constr;
1947  Bitmapset *modifiedCols;
1948  Bitmapset *insertedCols;
1949  Bitmapset *updatedCols;
1950 
1951  Assert(constr || resultRelInfo->ri_PartitionCheck);
1952 
1953  if (constr && constr->has_not_null)
1954  {
1955  int natts = tupdesc->natts;
1956  int attrChk;
1957 
1958  for (attrChk = 1; attrChk <= natts; attrChk++)
1959  {
1960  Form_pg_attribute att = TupleDescAttr(tupdesc, attrChk - 1);
1961 
1962  if (att->attnotnull && slot_attisnull(slot, attrChk))
1963  {
1964  char *val_desc;
1965  Relation orig_rel = rel;
1966  TupleDesc orig_tupdesc = RelationGetDescr(rel);
1967 
1968  /*
1969  * If the tuple has been routed, it's been converted to the
1970  * partition's rowtype, which might differ from the root
1971  * table's. We must convert it back to the root table's
1972  * rowtype so that val_desc shown error message matches the
1973  * input tuple.
1974  */
1975  if (resultRelInfo->ri_PartitionRoot)
1976  {
1977  HeapTuple tuple = ExecFetchSlotTuple(slot);
1978  TupleConversionMap *map;
1979 
1980  rel = resultRelInfo->ri_PartitionRoot;
1981  tupdesc = RelationGetDescr(rel);
1982  /* a reverse map */
1983  map = convert_tuples_by_name(orig_tupdesc, tupdesc,
1984  gettext_noop("could not convert row type"));
1985  if (map != NULL)
1986  {
1987  tuple = do_convert_tuple(tuple, map);
1988  ExecSetSlotDescriptor(slot, tupdesc);
1989  ExecStoreTuple(tuple, slot, InvalidBuffer, false);
1990  }
1991  }
1992 
1993  insertedCols = GetInsertedColumns(resultRelInfo, estate);
1994  updatedCols = GetUpdatedColumns(resultRelInfo, estate);
1995  modifiedCols = bms_union(insertedCols, updatedCols);
1997  slot,
1998  tupdesc,
1999  modifiedCols,
2000  64);
2001 
2002  ereport(ERROR,
2003  (errcode(ERRCODE_NOT_NULL_VIOLATION),
2004  errmsg("null value in column \"%s\" violates not-null constraint",
2005  NameStr(att->attname)),
2006  val_desc ? errdetail("Failing row contains %s.", val_desc) : 0,
2007  errtablecol(orig_rel, attrChk)));
2008  }
2009  }
2010  }
2011 
2012  if (constr && constr->num_check > 0)
2013  {
2014  const char *failed;
2015 
2016  if ((failed = ExecRelCheck(resultRelInfo, slot, estate)) != NULL)
2017  {
2018  char *val_desc;
2019  Relation orig_rel = rel;
2020 
2021  /* See the comment above. */
2022  if (resultRelInfo->ri_PartitionRoot)
2023  {
2024  HeapTuple tuple = ExecFetchSlotTuple(slot);
2025  TupleDesc old_tupdesc = RelationGetDescr(rel);
2026  TupleConversionMap *map;
2027 
2028  rel = resultRelInfo->ri_PartitionRoot;
2029  tupdesc = RelationGetDescr(rel);
2030  /* a reverse map */
2031  map = convert_tuples_by_name(old_tupdesc, tupdesc,
2032  gettext_noop("could not convert row type"));
2033  if (map != NULL)
2034  {
2035  tuple = do_convert_tuple(tuple, map);
2036  ExecSetSlotDescriptor(slot, tupdesc);
2037  ExecStoreTuple(tuple, slot, InvalidBuffer, false);
2038  }
2039  }
2040 
2041  insertedCols = GetInsertedColumns(resultRelInfo, estate);
2042  updatedCols = GetUpdatedColumns(resultRelInfo, estate);
2043  modifiedCols = bms_union(insertedCols, updatedCols);
2045  slot,
2046  tupdesc,
2047  modifiedCols,
2048  64);
2049  ereport(ERROR,
2050  (errcode(ERRCODE_CHECK_VIOLATION),
2051  errmsg("new row for relation \"%s\" violates check constraint \"%s\"",
2052  RelationGetRelationName(orig_rel), failed),
2053  val_desc ? errdetail("Failing row contains %s.", val_desc) : 0,
2054  errtableconstraint(orig_rel, failed)));
2055  }
2056  }
2057 
2058  if (resultRelInfo->ri_PartitionCheck)
2059  ExecPartitionCheck(resultRelInfo, slot, estate);
2060 }
#define GetUpdatedColumns(relinfo, estate)
Definition: execMain.c:111
TupleTableSlot * ExecStoreTuple(HeapTuple tuple, TupleTableSlot *slot, Buffer buffer, bool shouldFree)
Definition: execTuples.c:320
Relation ri_RelationDesc
Definition: execnodes.h:354
#define RelationGetDescr(relation)
Definition: rel.h:437
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:90
Relation ri_PartitionRoot
Definition: execnodes.h:414
#define InvalidBuffer
Definition: buf.h:25
#define gettext_noop(x)
Definition: c.h:981
int errcode(int sqlerrcode)
Definition: elog.c:575
int natts
Definition: tupdesc.h:79
int errtableconstraint(Relation rel, const char *conname)
Definition: relcache.c:5312
#define ERROR
Definition: elog.h:43
static char * ExecBuildSlotValueDescription(Oid reloid, TupleTableSlot *slot, TupleDesc tupdesc, Bitmapset *modifiedCols, int maxfieldlen)
Definition: execMain.c:2220
int errdetail(const char *fmt,...)
Definition: elog.c:873
#define RelationGetRelationName(relation)
Definition: rel.h:445
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:187
#define ereport(elevel, rest)
Definition: elog.h:122
bool has_not_null
Definition: tupdesc.h:43
TupleConversionMap * convert_tuples_by_name(TupleDesc indesc, TupleDesc outdesc, const char *msg)
Definition: tupconvert.c:210
void ExecSetSlotDescriptor(TupleTableSlot *slot, TupleDesc tupdesc)
Definition: execTuples.c:247
List * ri_PartitionCheck
Definition: execnodes.h:408
static const char * ExecRelCheck(ResultRelInfo *resultRelInfo, TupleTableSlot *slot, EState *estate)
Definition: execMain.c:1790
bool slot_attisnull(TupleTableSlot *slot, int attnum)
Definition: heaptuple.c:1329
void ExecPartitionCheck(ResultRelInfo *resultRelInfo, TupleTableSlot *slot, EState *estate)
Definition: execMain.c:1854
#define Assert(condition)
Definition: c.h:670
int errtablecol(Relation rel, int attnum)
Definition: relcache.c:5275
TupleConstr * constr
Definition: tupdesc.h:84
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:218
HeapTuple do_convert_tuple(HeapTuple tuple, TupleConversionMap *map)
Definition: tupconvert.c:354
HeapTuple ExecFetchSlotTuple(TupleTableSlot *slot)
Definition: execTuples.c:618
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define NameStr(name)
Definition: c.h:547
uint16 num_check
Definition: tupdesc.h:42
#define RelationGetRelid(relation)
Definition: rel.h:425
#define GetInsertedColumns(relinfo, estate)
Definition: execMain.c:109

◆ ExecContextForcesOids()

bool ExecContextForcesOids ( PlanState planstate,
bool hasoids 
)

Definition at line 1513 of file execMain.c.

References EState::es_result_relation_info, EState::es_top_eflags, EXEC_FLAG_WITH_OIDS, EXEC_FLAG_WITHOUT_OIDS, RelationData::rd_rel, ResultRelInfo::ri_RelationDesc, and PlanState::state.

Referenced by ExecAssignResultTypeFromTL(), ExecInitGather(), ExecInitGatherMerge(), and tlist_matches_tupdesc().

1514 {
1515  ResultRelInfo *ri = planstate->state->es_result_relation_info;
1516 
1517  if (ri != NULL)
1518  {
1519  Relation rel = ri->ri_RelationDesc;
1520 
1521  if (rel != NULL)
1522  {
1523  *hasoids = rel->rd_rel->relhasoids;
1524  return true;
1525  }
1526  }
1527 
1528  if (planstate->state->es_top_eflags & EXEC_FLAG_WITH_OIDS)
1529  {
1530  *hasoids = true;
1531  return true;
1532  }
1533  if (planstate->state->es_top_eflags & EXEC_FLAG_WITHOUT_OIDS)
1534  {
1535  *hasoids = false;
1536  return true;
1537  }
1538 
1539  return false;
1540 }
Relation ri_RelationDesc
Definition: execnodes.h:354
EState * state
Definition: execnodes.h:851
Form_pg_class rd_rel
Definition: rel.h:114
#define EXEC_FLAG_WITHOUT_OIDS
Definition: executor.h:64
#define EXEC_FLAG_WITH_OIDS
Definition: executor.h:63
int es_top_eflags
Definition: execnodes.h:480
ResultRelInfo * es_result_relation_info
Definition: execnodes.h:443

◆ execCurrentOf()

bool execCurrentOf ( CurrentOfExpr cexpr,
ExprContext econtext,
Oid  table_oid,
ItemPointer  current_tid 
)

Definition at line 41 of file execCurrent.c.

References Assert, PortalData::atEnd, PortalData::atStart, ExecRowMark::curCtid, CurrentOfExpr::cursor_name, CurrentOfExpr::cursor_param, DatumGetObjectId, DatumGetPointer, elog, ereport, errcode(), errmsg(), ERROR, EState::es_rowMarks, QueryDesc::estate, fetch_cursor_param_value(), get_rel_name(), GetPortalByName(), ItemPointerIsValid, lfirst, ExecRowMark::markType, PG_USED_FOR_ASSERTS_ONLY, QueryDesc::planstate, PORTAL_ONE_SELECT, PortalGetQueryDesc, PortalIsValid, ExecRowMark::relid, RowMarkRequiresRowShareLock, search_plan_tree(), SelfItemPointerAttributeNumber, slot_getattr(), ScanState::ss_ScanTupleSlot, PortalData::strategy, TableOidAttributeNumber, and TupIsNull.

Referenced by TidListEval().

45 {
46  char *cursor_name;
47  char *table_name;
48  Portal portal;
49  QueryDesc *queryDesc;
50 
51  /* Get the cursor name --- may have to look up a parameter reference */
52  if (cexpr->cursor_name)
53  cursor_name = cexpr->cursor_name;
54  else
55  cursor_name = fetch_cursor_param_value(econtext, cexpr->cursor_param);
56 
57  /* Fetch table name for possible use in error messages */
58  table_name = get_rel_name(table_oid);
59  if (table_name == NULL)
60  elog(ERROR, "cache lookup failed for relation %u", table_oid);
61 
62  /* Find the cursor's portal */
63  portal = GetPortalByName(cursor_name);
64  if (!PortalIsValid(portal))
65  ereport(ERROR,
66  (errcode(ERRCODE_UNDEFINED_CURSOR),
67  errmsg("cursor \"%s\" does not exist", cursor_name)));
68 
69  /*
70  * We have to watch out for non-SELECT queries as well as held cursors,
71  * both of which may have null queryDesc.
72  */
73  if (portal->strategy != PORTAL_ONE_SELECT)
74  ereport(ERROR,
75  (errcode(ERRCODE_INVALID_CURSOR_STATE),
76  errmsg("cursor \"%s\" is not a SELECT query",
77  cursor_name)));
78  queryDesc = PortalGetQueryDesc(portal);
79  if (queryDesc == NULL || queryDesc->estate == NULL)
80  ereport(ERROR,
81  (errcode(ERRCODE_INVALID_CURSOR_STATE),
82  errmsg("cursor \"%s\" is held from a previous transaction",
83  cursor_name)));
84 
85  /*
86  * We have two different strategies depending on whether the cursor uses
87  * FOR UPDATE/SHARE or not. The reason for supporting both is that the
88  * FOR UPDATE code is able to identify a target table in many cases where
89  * the other code can't, while the non-FOR-UPDATE case allows use of WHERE
90  * CURRENT OF with an insensitive cursor.
91  */
92  if (queryDesc->estate->es_rowMarks)
93  {
94  ExecRowMark *erm;
95  ListCell *lc;
96 
97  /*
98  * Here, the query must have exactly one FOR UPDATE/SHARE reference to
99  * the target table, and we dig the ctid info out of that.
100  */
101  erm = NULL;
102  foreach(lc, queryDesc->estate->es_rowMarks)
103  {
104  ExecRowMark *thiserm = (ExecRowMark *) lfirst(lc);
105 
106  if (!RowMarkRequiresRowShareLock(thiserm->markType))
107  continue; /* ignore non-FOR UPDATE/SHARE items */
108 
109  if (thiserm->relid == table_oid)
110  {
111  if (erm)
112  ereport(ERROR,
113  (errcode(ERRCODE_INVALID_CURSOR_STATE),
114  errmsg("cursor \"%s\" has multiple FOR UPDATE/SHARE references to table \"%s\"",
115  cursor_name, table_name)));
116  erm = thiserm;
117  }
118  }
119 
120  if (erm == NULL)
121  ereport(ERROR,
122  (errcode(ERRCODE_INVALID_CURSOR_STATE),
123  errmsg("cursor \"%s\" does not have a FOR UPDATE/SHARE reference to table \"%s\"",
124  cursor_name, table_name)));
125 
126  /*
127  * The cursor must have a current result row: per the SQL spec, it's
128  * an error if not.
129  */
130  if (portal->atStart || portal->atEnd)
131  ereport(ERROR,
132  (errcode(ERRCODE_INVALID_CURSOR_STATE),
133  errmsg("cursor \"%s\" is not positioned on a row",
134  cursor_name)));
135 
136  /* Return the currently scanned TID, if there is one */
137  if (ItemPointerIsValid(&(erm->curCtid)))
138  {
139  *current_tid = erm->curCtid;
140  return true;
141  }
142 
143  /*
144  * This table didn't produce the cursor's current row; some other
145  * inheritance child of the same parent must have. Signal caller to
146  * do nothing on this table.
147  */
148  return false;
149  }
150  else
151  {
152  ScanState *scanstate;
153  bool lisnull;
154  Oid tuple_tableoid PG_USED_FOR_ASSERTS_ONLY;
155  ItemPointer tuple_tid;
156 
157  /*
158  * Without FOR UPDATE, we dig through the cursor's plan to find the
159  * scan node. Fail if it's not there or buried underneath
160  * aggregation.
161  */
162  scanstate = search_plan_tree(queryDesc->planstate, table_oid);
163  if (!scanstate)
164  ereport(ERROR,
165  (errcode(ERRCODE_INVALID_CURSOR_STATE),
166  errmsg("cursor \"%s\" is not a simply updatable scan of table \"%s\"",
167  cursor_name, table_name)));
168 
169  /*
170  * The cursor must have a current result row: per the SQL spec, it's
171  * an error if not. We test this at the top level, rather than at the
172  * scan node level, because in inheritance cases any one table scan
173  * could easily not be on a row. We want to return false, not raise
174  * error, if the passed-in table OID is for one of the inactive scans.
175  */
176  if (portal->atStart || portal->atEnd)
177  ereport(ERROR,
178  (errcode(ERRCODE_INVALID_CURSOR_STATE),
179  errmsg("cursor \"%s\" is not positioned on a row",
180  cursor_name)));
181 
182  /* Now OK to return false if we found an inactive scan */
183  if (TupIsNull(scanstate->ss_ScanTupleSlot))
184  return false;
185 
186  /* Use slot_getattr to catch any possible mistakes */
187  tuple_tableoid =
190  &lisnull));
191  Assert(!lisnull);
192  tuple_tid = (ItemPointer)
195  &lisnull));
196  Assert(!lisnull);
197 
198  Assert(tuple_tableoid == table_oid);
199 
200  *current_tid = *tuple_tid;
201 
202  return true;
203  }
204 }
#define ItemPointerIsValid(pointer)
Definition: itemptr.h:60
bool atEnd
Definition: portal.h:187
EState * estate
Definition: execdesc.h:48
Portal GetPortalByName(const char *name)
Definition: portalmem.c:129
#define DatumGetObjectId(X)
Definition: postgres.h:506
int errcode(int sqlerrcode)
Definition: elog.c:575
TupleTableSlot * ss_ScanTupleSlot
Definition: execnodes.h:1106
unsigned int Oid
Definition: postgres_ext.h:31
#define RowMarkRequiresRowShareLock(marktype)
Definition: plannodes.h:973
ItemPointerData * ItemPointer
Definition: itemptr.h:49
ItemPointerData curCtid
Definition: execnodes.h:545
#define ERROR
Definition: elog.h:43
PlanState * planstate
Definition: execdesc.h:49
#define TupIsNull(slot)
Definition: tuptable.h:138
#define TableOidAttributeNumber
Definition: sysattr.h:27
char * cursor_name
Definition: primnodes.h:1285
PortalStrategy strategy
Definition: portal.h:143
#define ereport(elevel, rest)
Definition: elog.h:122
#define PortalIsValid(p)
Definition: portal.h:199
static ScanState * search_plan_tree(PlanState *node, Oid table_oid)
Definition: execCurrent.c:254
#define Assert(condition)
Definition: c.h:670
#define lfirst(lc)
Definition: pg_list.h:106
RowMarkType markType
Definition: execnodes.h:541
List * es_rowMarks
Definition: execnodes.h:475
#define DatumGetPointer(X)
Definition: postgres.h:555
#define PortalGetQueryDesc(portal)
Definition: portal.h:204
bool atStart
Definition: portal.h:186
int errmsg(const char *fmt,...)
Definition: elog.c:797
static char * fetch_cursor_param_value(ExprContext *econtext, int paramId)
Definition: execCurrent.c:212
Datum slot_getattr(TupleTableSlot *slot, int attnum, bool *isnull)
Definition: heaptuple.c:1142
#define SelfItemPointerAttributeNumber
Definition: sysattr.h:21
#define elog
Definition: elog.h:219
#define PG_USED_FOR_ASSERTS_ONLY
Definition: c.h:122
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1726

◆ ExecEndNode()

void ExecEndNode ( PlanState node)

Definition at line 523 of file execProcnode.c.

References bms_free(), check_stack_depth(), PlanState::chgParam, elog, ERROR, ExecEndAgg(), ExecEndAppend(), ExecEndBitmapAnd(), ExecEndBitmapHeapScan(), ExecEndBitmapIndexScan(), ExecEndBitmapOr(), ExecEndCteScan(), ExecEndCustomScan(), ExecEndForeignScan(), ExecEndFunctionScan(), ExecEndGather(), ExecEndGatherMerge(), ExecEndGroup(), ExecEndHash(), ExecEndHashJoin(), ExecEndIndexOnlyScan(), ExecEndIndexScan(), ExecEndLimit(), ExecEndLockRows(), ExecEndMaterial(), ExecEndMergeAppend(), ExecEndMergeJoin(), ExecEndModifyTable(), ExecEndNamedTuplestoreScan(), ExecEndNestLoop(), ExecEndProjectSet(), ExecEndRecursiveUnion(), ExecEndResult(), ExecEndSampleScan(), ExecEndSeqScan(), ExecEndSetOp(), ExecEndSort(), ExecEndSubqueryScan(), ExecEndTableFuncScan(), ExecEndTidScan(), ExecEndUnique(), ExecEndValuesScan(), ExecEndWindowAgg(), ExecEndWorkTableScan(), nodeTag, T_AggState, T_AppendState, T_BitmapAndState, T_BitmapHeapScanState, T_BitmapIndexScanState, T_BitmapOrState, T_CteScanState, T_CustomScanState, T_ForeignScanState, T_FunctionScanState, T_GatherMergeState, T_GatherState, T_GroupState, T_HashJoinState, T_HashState, T_IndexOnlyScanState, T_IndexScanState, T_LimitState, T_LockRowsState, T_MaterialState, T_MergeAppendState, T_MergeJoinState, T_ModifyTableState, T_NamedTuplestoreScanState, T_NestLoopState, T_ProjectSetState, T_RecursiveUnionState, T_ResultState, T_SampleScanState, T_SeqScanState, T_SetOpState, T_SortState, T_SubqueryScanState, T_TableFuncScanState, T_TidScanState, T_UniqueState, T_ValuesScanState, T_WindowAggState, and T_WorkTableScanState.

Referenced by EvalPlanQualEnd(), ExecEndAgg(), ExecEndAppend(), ExecEndBitmapAnd(), ExecEndBitmapHeapScan(), ExecEndBitmapOr(), ExecEndForeignScan(), ExecEndGather(), ExecEndGatherMerge(), ExecEndGroup(), ExecEndHash(), ExecEndHashJoin(), ExecEndLimit(), ExecEndLockRows(), ExecEndMaterial(), ExecEndMergeAppend(), ExecEndMergeJoin(), ExecEndModifyTable(), ExecEndNestLoop(), ExecEndPlan(), ExecEndProjectSet(), ExecEndRecursiveUnion(), ExecEndResult(), ExecEndSetOp(), ExecEndSort(), ExecEndSubqueryScan(), ExecEndUnique(), and ExecEndWindowAgg().

524 {
525  /*
526  * do nothing when we get to the end of a leaf on tree.
527  */
528  if (node == NULL)
529  return;
530 
531  /*
532  * Make sure there's enough stack available. Need to check here, in
533  * addition to ExecProcNode() (via ExecProcNodeFirst()), because it's not
534  * guaranteed that ExecProcNode() is reached for all nodes.
535  */
537 
538  if (node->chgParam != NULL)
539  {
540  bms_free(node->chgParam);
541  node->chgParam = NULL;
542  }
543 
544  switch (nodeTag(node))
545  {
546  /*
547  * control nodes
548  */
549  case T_ResultState:
550  ExecEndResult((ResultState *) node);
551  break;
552 
553  case T_ProjectSetState:
555  break;
556 
557  case T_ModifyTableState:
559  break;
560 
561  case T_AppendState:
562  ExecEndAppend((AppendState *) node);
563  break;
564 
565  case T_MergeAppendState:
567  break;
568 
571  break;
572 
573  case T_BitmapAndState:
575  break;
576 
577  case T_BitmapOrState:
578  ExecEndBitmapOr((BitmapOrState *) node);
579  break;
580 
581  /*
582  * scan nodes
583  */
584  case T_SeqScanState:
585  ExecEndSeqScan((SeqScanState *) node);
586  break;
587 
588  case T_SampleScanState:
590  break;
591 
592  case T_GatherState:
593  ExecEndGather((GatherState *) node);
594  break;
595 
596  case T_GatherMergeState:
598  break;
599 
600  case T_IndexScanState:
602  break;
603 
606  break;
607 
610  break;
611 
614  break;
615 
616  case T_TidScanState:
617  ExecEndTidScan((TidScanState *) node);
618  break;
619 
620  case T_SubqueryScanState:
622  break;
623 
624  case T_FunctionScanState:
626  break;
627 
630  break;
631 
632  case T_ValuesScanState:
634  break;
635 
636  case T_CteScanState:
637  ExecEndCteScan((CteScanState *) node);
638  break;
639 
642  break;
643 
646  break;
647 
648  case T_ForeignScanState:
650  break;
651 
652  case T_CustomScanState:
654  break;
655 
656  /*
657  * join nodes
658  */
659  case T_NestLoopState:
660  ExecEndNestLoop((NestLoopState *) node);
661  break;
662 
663  case T_MergeJoinState:
665  break;
666 
667  case T_HashJoinState:
668  ExecEndHashJoin((HashJoinState *) node);
669  break;
670 
671  /*
672  * materialization nodes
673  */
674  case T_MaterialState:
675  ExecEndMaterial((MaterialState *) node);
676  break;
677 
678  case T_SortState:
679  ExecEndSort((SortState *) node);
680  break;
681 
682  case T_GroupState:
683  ExecEndGroup((GroupState *) node);
684  break;
685 
686  case T_AggState:
687  ExecEndAgg((AggState *) node);
688  break;
689 
690  case T_WindowAggState:
692  break;
693 
694  case T_UniqueState:
695  ExecEndUnique((UniqueState *) node);
696  break;
697 
698  case T_HashState:
699  ExecEndHash((HashState *) node);
700  break;
701 
702  case T_SetOpState:
703  ExecEndSetOp((SetOpState *) node);
704  break;
705 
706  case T_LockRowsState:
707  ExecEndLockRows((LockRowsState *) node);
708  break;
709 
710  case T_LimitState:
711  ExecEndLimit((LimitState *) node);
712  break;
713 
714  default:
715  elog(ERROR, "unrecognized node type: %d", (int) nodeTag(node));
716  break;
717  }
718 }
void ExecEndGroup(GroupState *node)
Definition: nodeGroup.c:231
void ExecEndSetOp(SetOpState *node)
Definition: nodeSetOp.c:582
void ExecEndFunctionScan(FunctionScanState *node)
void ExecEndNestLoop(NestLoopState *node)
Definition: nodeNestloop.c:366
void ExecEndIndexScan(IndexScanState *node)
void ExecEndLimit(LimitState *node)
Definition: nodeLimit.c:393
void ExecEndUnique(UniqueState *node)
Definition: nodeUnique.c:178
void ExecEndGatherMerge(GatherMergeState *node)
void ExecEndWorkTableScan(WorkTableScanState *node)
void ExecEndLockRows(LockRowsState *node)
Definition: nodeLockRows.c:451
void ExecEndNamedTuplestoreScan(NamedTuplestoreScanState *node)
void ExecEndBitmapAnd(BitmapAndState *node)
void ExecEndRecursiveUnion(RecursiveUnionState *node)
void ExecEndSubqueryScan(SubqueryScanState *node)
void ExecEndHashJoin(HashJoinState *node)
Definition: nodeHashjoin.c:551
void ExecEndTableFuncScan(TableFuncScanState *node)
void ExecEndResult(ResultState *node)
Definition: nodeResult.c:246
#define ERROR
Definition: elog.h:43
void ExecEndAppend(AppendState *node)
Definition: nodeAppend.c:259
void ExecEndForeignScan(ForeignScanState *node)
void ExecEndSort(SortState *node)
Definition: nodeSort.c:238
void ExecEndBitmapIndexScan(BitmapIndexScanState *node)
void check_stack_depth(void)
Definition: postgres.c:3150
void ExecEndValuesScan(ValuesScanState *node)
void ExecEndMergeJoin(MergeJoinState *node)
void ExecEndSeqScan(SeqScanState *node)
Definition: nodeSeqscan.c:225
void ExecEndIndexOnlyScan(IndexOnlyScanState *node)
void ExecEndTidScan(TidScanState *node)
Definition: nodeTidscan.c:482
Bitmapset * chgParam
Definition: execnodes.h:877
void ExecEndCteScan(CteScanState *node)
Definition: nodeCtescan.c:280
void ExecEndCustomScan(CustomScanState *node)
Definition: nodeCustom.c:122
void ExecEndBitmapOr(BitmapOrState *node)
Definition: nodeBitmapOr.c:196
void ExecEndSampleScan(SampleScanState *node)
void bms_free(Bitmapset *a)
Definition: bitmapset.c:201
void ExecEndWindowAgg(WindowAggState *node)
void ExecEndMergeAppend(MergeAppendState *node)
#define nodeTag(nodeptr)
Definition: nodes.h:515
void ExecEndHash(HashState *node)
Definition: nodeHash.c:219
void ExecEndProjectSet(ProjectSetState *node)
void ExecEndMaterial(MaterialState *node)
Definition: nodeMaterial.c:244
#define elog
Definition: elog.h:219
void ExecEndBitmapHeapScan(BitmapHeapScanState *node)
void ExecEndAgg(AggState *node)
Definition: nodeAgg.c:3935
void ExecEndModifyTable(ModifyTableState *node)
void ExecEndGather(GatherState *node)
Definition: nodeGather.c:238

◆ ExecEvalExpr()

◆ ExecEvalExprSwitchContext()

static Datum ExecEvalExprSwitchContext ( ExprState state,
ExprContext econtext,
bool isNull 
)
inlinestatic

Definition at line 291 of file executor.h.

References ExprContext::ecxt_per_tuple_memory, ExprState::evalfunc, and MemoryContextSwitchTo().

Referenced by evaluate_expr(), EvaluateParams(), ExecCheck(), ExecProject(), ExecQual(), ExecScanSubPlan(), ExecSetParamPlan(), ExecWindowAgg(), FormIndexDatum(), FormPartitionKeyDatum(), get_qual_for_range(), operator_predicate_proof(), recompute_limits(), tablesample_init(), TidListEval(), and validateDomainConstraint().

294 {
295  Datum retDatum;
296  MemoryContext oldContext;
297 
298  oldContext = MemoryContextSwitchTo(econtext->ecxt_per_tuple_memory);
299  retDatum = state->evalfunc(state, econtext, isNull);
300  MemoryContextSwitchTo(oldContext);
301  return retDatum;
302 }
MemoryContext ecxt_per_tuple_memory
Definition: execnodes.h:203
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
ExprStateEvalFunc evalfunc
Definition: execnodes.h:80
uintptr_t Datum
Definition: postgres.h:372

◆ ExecFilterJunk()

TupleTableSlot* ExecFilterJunk ( JunkFilter junkfilter,
TupleTableSlot slot 
)

Definition at line 262 of file execJunk.c.

References ExecClearTuple(), ExecStoreVirtualTuple(), i, JunkFilter::jf_cleanMap, JunkFilter::jf_cleanTupType, JunkFilter::jf_resultSlot, tupleDesc::natts, slot_getallattrs(), TupleTableSlot::tts_isnull, TupleTableSlot::tts_values, and values.

Referenced by ExecBRUpdateTriggers(), ExecEvalWholeRowVar(), ExecModifyTable(), ExecUpdate(), ExecutePlan(), and sqlfunction_receive().

263 {
264  TupleTableSlot *resultSlot;
265  AttrNumber *cleanMap;
266  TupleDesc cleanTupType;
267  int cleanLength;
268  int i;
269  Datum *values;
270  bool *isnull;
271  Datum *old_values;
272  bool *old_isnull;
273 
274  /*
275  * Extract all the values of the old tuple.
276  */
277  slot_getallattrs(slot);
278  old_values = slot->tts_values;
279  old_isnull = slot->tts_isnull;
280 
281  /*
282  * get info from the junk filter
283  */
284  cleanTupType = junkfilter->jf_cleanTupType;
285  cleanLength = cleanTupType->natts;
286  cleanMap = junkfilter->jf_cleanMap;
287  resultSlot = junkfilter->jf_resultSlot;
288 
289  /*
290  * Prepare to build a virtual result tuple.
291  */
292  ExecClearTuple(resultSlot);
293  values = resultSlot->tts_values;
294  isnull = resultSlot->tts_isnull;
295 
296  /*
297  * Transpose data into proper fields of the new tuple.
298  */
299  for (i = 0; i < cleanLength; i++)
300  {
301  int j = cleanMap[i];
302 
303  if (j == 0)
304  {
305  values[i] = (Datum) 0;
306  isnull[i] = true;
307  }
308  else
309  {
310  values[i] = old_values[j - 1];
311  isnull[i] = old_isnull[j - 1];
312  }
313  }
314 
315  /*
316  * And return the virtual tuple.
317  */
318  return ExecStoreVirtualTuple(resultSlot);
319 }
AttrNumber * jf_cleanMap
Definition: execnodes.h:334
TupleTableSlot * ExecClearTuple(TupleTableSlot *slot)
Definition: execTuples.c:439
TupleTableSlot * jf_resultSlot
Definition: execnodes.h:335
Datum * tts_values
Definition: tuptable.h:125
int natts
Definition: tupdesc.h:79
bool * tts_isnull
Definition: tuptable.h:126
TupleDesc jf_cleanTupType
Definition: execnodes.h:333
void slot_getallattrs(TupleTableSlot *slot)
Definition: heaptuple.c:1238
uintptr_t Datum
Definition: postgres.h:372
static Datum values[MAXATTR]
Definition: bootstrap.c:164
int i
int16 AttrNumber
Definition: attnum.h:21
TupleTableSlot * ExecStoreVirtualTuple(TupleTableSlot *slot)
Definition: execTuples.c:488

◆ ExecFindJunkAttribute()

AttrNumber ExecFindJunkAttribute ( JunkFilter junkfilter,
const char *  attrName 
)

Definition at line 209 of file execJunk.c.

References ExecFindJunkAttributeInTlist(), and JunkFilter::jf_targetList.

Referenced by ExecInitModifyTable().

210 {
211  return ExecFindJunkAttributeInTlist(junkfilter->jf_targetList, attrName);
212 }
AttrNumber ExecFindJunkAttributeInTlist(List *targetlist, const char *attrName)
Definition: execJunk.c:221
List * jf_targetList
Definition: execnodes.h:332

◆ ExecFindJunkAttributeInTlist()

AttrNumber ExecFindJunkAttributeInTlist ( List targetlist,
const char *  attrName 
)

Definition at line 221 of file execJunk.c.

References InvalidAttrNumber, lfirst, TargetEntry::resjunk, TargetEntry::resname, and TargetEntry::resno.

Referenced by ExecBuildAuxRowMark(), ExecFindJunkAttribute(), and postgresBeginForeignModify().

222 {
223  ListCell *t;
224 
225  foreach(t, targetlist)
226  {
227  TargetEntry *tle = lfirst(t);
228 
229  if (tle->resjunk && tle->resname &&
230  (strcmp(tle->resname, attrName) == 0))
231  {
232  /* We found it ! */
233  return tle->resno;
234  }
235  }
236 
237  return InvalidAttrNumber;
238 }
char * resname
Definition: primnodes.h:1377
bool resjunk
Definition: primnodes.h:1382
AttrNumber resno
Definition: primnodes.h:1376
#define lfirst(lc)
Definition: pg_list.h:106
#define InvalidAttrNumber
Definition: attnum.h:23

◆ ExecFindRowMark()

ExecRowMark* ExecFindRowMark ( EState estate,
Index  rti,
bool  missing_ok 
)

Definition at line 2383 of file execMain.c.

References elog, ERROR, EState::es_rowMarks, lfirst, and ExecRowMark::rti.

Referenced by ExecInitLockRows(), ExecInitModifyTable(), and ExecOpenScanRelation().

2384 {
2385  ListCell *lc;
2386 
2387  foreach(lc, estate->es_rowMarks)
2388  {
2389  ExecRowMark *erm = (ExecRowMark *) lfirst(lc);
2390 
2391  if (erm->rti == rti)
2392  return erm;
2393  }
2394  if (!missing_ok)
2395  elog(ERROR, "failed to find ExecRowMark for rangetable index %u", rti);
2396  return NULL;
2397 }
#define ERROR
Definition: elog.h:43
Index rti
Definition: execnodes.h:538
#define lfirst(lc)
Definition: pg_list.h:106
List * es_rowMarks
Definition: execnodes.h:475
#define elog
Definition: elog.h:219

◆ ExecFreeExprContext()

◆ ExecGetJunkAttribute()

Datum ExecGetJunkAttribute ( TupleTableSlot slot,
AttrNumber  attno,
bool isNull 
)

Definition at line 248 of file execJunk.c.

References Assert, and slot_getattr().

Referenced by EvalPlanQualFetchRowMarks(), ExecLockRows(), ExecModifyTable(), postgresExecForeignDelete(), and postgresExecForeignUpdate().

250 {
251  Assert(attno > 0);
252 
253  return slot_getattr(slot, attno, isNull);
254 }
#define Assert(condition)
Definition: c.h:670
Datum slot_getattr(TupleTableSlot *slot, int attnum, bool *isnull)
Definition: heaptuple.c:1142

◆ ExecGetResultType()

◆ ExecGetTriggerResultRel()

ResultRelInfo* ExecGetTriggerResultRel ( EState estate,
Oid  relid 
)

Definition at line 1388 of file execMain.c.

References EState::es_instrument, EState::es_leaf_result_relations, EState::es_num_result_relations, EState::es_num_root_result_relations, EState::es_query_cxt, EState::es_result_relations, EState::es_root_result_relations, EState::es_trig_target_relations, heap_open(), InitResultRelInfo(), lappend(), lfirst, makeNode, MemoryContextSwitchTo(), NoLock, RelationGetRelid, and ResultRelInfo::ri_RelationDesc.

Referenced by afterTriggerInvokeEvents().

1389 {
1390  ResultRelInfo *rInfo;
1391  int nr;
1392  ListCell *l;
1393  Relation rel;
1394  MemoryContext oldcontext;
1395 
1396  /* First, search through the query result relations */
1397  rInfo = estate->es_result_relations;
1398  nr = estate->es_num_result_relations;
1399  while (nr > 0)
1400  {
1401  if (RelationGetRelid(rInfo->ri_RelationDesc) == relid)
1402  return rInfo;
1403  rInfo++;
1404  nr--;
1405  }
1406  /* Second, search through the root result relations, if any */
1407  rInfo = estate->es_root_result_relations;
1408  nr = estate->es_num_root_result_relations;
1409  while (nr > 0)
1410  {
1411  if (RelationGetRelid(rInfo->ri_RelationDesc) == relid)
1412  return rInfo;
1413  rInfo++;
1414  nr--;
1415  }
1416  /* Third, search through the leaf result relations, if any */
1417  foreach(l, estate->es_leaf_result_relations)
1418  {
1419  rInfo = (ResultRelInfo *) lfirst(l);
1420  if (RelationGetRelid(rInfo->ri_RelationDesc) == relid)
1421  return rInfo;
1422  }
1423  /* Nope, but maybe we already made an extra ResultRelInfo for it */
1424  foreach(l, estate->es_trig_target_relations)
1425  {
1426  rInfo = (ResultRelInfo *) lfirst(l);
1427  if (RelationGetRelid(rInfo->ri_RelationDesc) == relid)
1428  return rInfo;
1429  }
1430  /* Nope, so we need a new one */
1431 
1432  /*
1433  * Open the target relation's relcache entry. We assume that an
1434  * appropriate lock is still held by the backend from whenever the trigger
1435  * event got queued, so we need take no new lock here. Also, we need not
1436  * recheck the relkind, so no need for CheckValidResultRel.
1437  */
1438  rel = heap_open(relid, NoLock);
1439 
1440  /*
1441  * Make the new entry in the right context.
1442  */
1443  oldcontext = MemoryContextSwitchTo(estate->es_query_cxt);
1444  rInfo = makeNode(ResultRelInfo);
1445  InitResultRelInfo(rInfo,
1446  rel,
1447  0, /* dummy rangetable index */
1448  NULL,
1449  estate->es_instrument);
1450  estate->es_trig_target_relations =
1451  lappend(estate->es_trig_target_relations, rInfo);
1452  MemoryContextSwitchTo(oldcontext);
1453 
1454  /*
1455  * Currently, we don't need any index information in ResultRelInfos used
1456  * only for triggers, so no need to call ExecOpenIndices.
1457  */
1458 
1459  return rInfo;
1460 }
void InitResultRelInfo(ResultRelInfo *resultRelInfo, Relation resultRelationDesc, Index resultRelationIndex, Relation partition_root, int instrument_options)
Definition: execMain.c:1306
Relation ri_RelationDesc
Definition: execnodes.h:354
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
MemoryContext es_query_cxt
Definition: execnodes.h:471
#define NoLock
Definition: lockdefs.h:34
ResultRelInfo * es_result_relations
Definition: execnodes.h:441
int es_instrument
Definition: execnodes.h:481
List * es_leaf_result_relations
Definition: execnodes.h:456
List * lappend(List *list, void *datum)
Definition: list.c:128
int es_num_root_result_relations
Definition: execnodes.h:453
List * es_trig_target_relations
Definition: execnodes.h:459
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1290
int es_num_result_relations
Definition: execnodes.h:442
#define makeNode(_type_)
Definition: nodes.h:558
#define lfirst(lc)
Definition: pg_list.h:106
ResultRelInfo * es_root_result_relations
Definition: execnodes.h:452
#define RelationGetRelid(relation)
Definition: rel.h:425

◆ ExecInitCheck()

ExprState* ExecInitCheck ( List qual,
PlanState parent 
)

Definition at line 246 of file execExpr.c.

References Assert, ExecInitExpr(), IsA, make_ands_explicit(), and NIL.

Referenced by ExecPrepareCheck(), and ExecProcNode().

247 {
248  /* short-circuit (here and in ExecCheck) for empty restriction list */
249  if (qual == NIL)
250  return NULL;
251 
252  Assert(IsA(qual, List));
253 
254  /*
255  * Just convert the implicit-AND list to an explicit AND (if there's more
256  * than one entry), and compile normally. Unlike ExecQual, we can't
257  * short-circuit on NULL results, so the regular AND behavior is needed.
258  */
259  return ExecInitExpr(make_ands_explicit(qual), parent);
260 }
#define NIL
Definition: pg_list.h:69
#define IsA(nodeptr, _type_)
Definition: nodes.h:561
Expr * make_ands_explicit(List *andclauses)
Definition: clauses.c:367
#define Assert(condition)
Definition: c.h:670
ExprState * ExecInitExpr(Expr *node, PlanState *parent)
Definition: execExpr.c:113
Definition: pg_list.h:45

◆ ExecInitExpr()

ExprState* ExecInitExpr ( Expr node,
PlanState parent 
)

Definition at line 113 of file execExpr.c.

References EEOP_DONE, ExecInitExprRec(), ExecInitExprSlots(), ExecReadyExpr(), ExprState::expr, ExprEvalPushStep(), makeNode, ExprEvalStep::opcode, ExprState::resnull, and ExprState::resvalue.

Referenced by ATRewriteTable(), BeginCopyFrom(), evaluate_expr(), exec_eval_simple_expr(), ExecIndexBuildScanKeys(), ExecInitCheck(), ExecInitExprList(), ExecInitExprRec(), ExecInitHashJoin(), ExecInitLimit(), ExecInitProjectSet(), ExecInitSampleScan(), ExecInitSubPlan(), ExecInitTableFuncScan(), ExecInitTableFunctionResult(), ExecInitWindowAgg(), ExecPrepareExpr(), ExecProcNode(), get_cast_hashentry(), get_qual_for_range(), MJExamineQuals(), operator_predicate_proof(), prep_domain_constraints(), slot_fill_defaults(), and TidExprListCreate().

114 {
115  ExprState *state;
116  ExprEvalStep scratch;
117 
118  /* Special case: NULL expression produces a NULL ExprState pointer */
119  if (node == NULL)
120  return NULL;
121 
122  /* Initialize ExprState with empty step list */
123  state = makeNode(ExprState);
124  state->expr = node;
125 
126  /* Insert EEOP_*_FETCHSOME steps as needed */
127  ExecInitExprSlots(state, (Node *) node);
128 
129  /* Compile the expression proper */
130  ExecInitExprRec(node, parent, state, &state->resvalue, &state->resnull);
131 
132  /* Finally, append a DONE step */
133  scratch.opcode = EEOP_DONE;
134  ExprEvalPushStep(state, &scratch);
135 
136  ExecReadyExpr(state);
137 
138  return state;
139 }
Definition: nodes.h:510
bool resnull
Definition: execnodes.h:63
Expr * expr
Definition: execnodes.h:83
static void ExecInitExprSlots(ExprState *state, Node *node)
Definition: execExpr.c:2179
static void ExecReadyExpr(ExprState *state)
Definition: execExpr.c:574
#define makeNode(_type_)
Definition: nodes.h:558
Definition: regguts.h:298
intptr_t opcode
Definition: execExpr.h:227
static void ExprEvalPushStep(ExprState *es, const ExprEvalStep *s)
Definition: execExpr.c:2050
static void ExecInitExprRec(Expr *node, PlanState *parent, ExprState *state, Datum *resv, bool *resnull)
Definition: execExpr.c:589
Datum resvalue
Definition: execnodes.h:64

◆ ExecInitExprList()

List* ExecInitExprList ( List nodes,
PlanState parent 
)

Definition at line 266 of file execExpr.c.

References ExecInitExpr(), lappend(), lfirst, and NIL.

Referenced by ExecInitAgg(), ExecInitExprRec(), ExecInitFunctionResultSet(), ExecInitIndexScan(), ExecInitSampleScan(), ExecInitSubPlan(), ExecInitTableFuncScan(), ExecInitTableFunctionResult(), ExecProcNode(), prepare_query_params(), and ValuesNext().

267 {
268  List *result = NIL;
269  ListCell *lc;
270 
271  foreach(lc, nodes)
272  {
273  Expr *e = lfirst(lc);
274 
275  result = lappend(result, ExecInitExpr(e, parent));
276  }
277 
278  return result;
279 }
#define NIL
Definition: pg_list.h:69
List * lappend(List *list, void *datum)
Definition: list.c:128
#define lfirst(lc)
Definition: pg_list.h:106
e
Definition: preproc-init.c:82
ExprState * ExecInitExpr(Expr *node, PlanState *parent)
Definition: execExpr.c:113
Definition: pg_list.h:45

◆ ExecInitExtraTupleSlot()

◆ ExecInitFunctionResultSet()

SetExprState* ExecInitFunctionResultSet ( Expr expr,
ExprContext econtext,
PlanState parent 
)

Definition at line 424 of file execSRF.c.

References FuncExpr::args, OpExpr::args, SetExprState::args, Assert, ExprContext::ecxt_per_query_memory, elog, ERROR, ExecInitExprList(), SetExprState::expr, FmgrInfo::fn_oid, FmgrInfo::fn_retset, SetExprState::func, FuncExpr::funcid, SetExprState::funcReturnsSet, init_sexpr(), FuncExpr::inputcollid, OpExpr::inputcollid, InvalidOid, IsA, makeNode, nodeTag, and OpExpr::opfuncid.

Referenced by ExecInitProjectSet(), and ExecQual().

426 {
428 
429  state->funcReturnsSet = true;
430  state->expr = expr;
431  state->func.fn_oid = InvalidOid;
432 
433  /*
434  * Initialize metadata. The expression node could be either a FuncExpr or
435  * an OpExpr.
436  */
437  if (IsA(expr, FuncExpr))
438  {
439  FuncExpr *func = (FuncExpr *) expr;
440 
441  state->args = ExecInitExprList(func->args, parent);
442  init_sexpr(func->funcid, func->inputcollid, expr, state, parent,
443  econtext->ecxt_per_query_memory, true, true);
444  }
445  else if (IsA(expr, OpExpr))
446  {
447  OpExpr *op = (OpExpr *) expr;
448 
449  state->args = ExecInitExprList(op->args, parent);
450  init_sexpr(op->opfuncid, op->inputcollid, expr, state, parent,
451  econtext->ecxt_per_query_memory, true, true);
452  }
453  else
454  elog(ERROR, "unrecognized node type: %d",
455  (int) nodeTag(expr));
456 
457  /* shouldn't get here unless the selected function returns set */
458  Assert(state->func.fn_retset);
459 
460  return state;
461 }
FmgrInfo func
Definition: execnodes.h:704
#define IsA(nodeptr, _type_)
Definition: nodes.h:561
List * args
Definition: primnodes.h:457
List * args
Definition: execnodes.h:690
static void init_sexpr(Oid foid, Oid input_collation, Expr *node, SetExprState *sexpr, PlanState *parent, MemoryContext sexprCxt, bool allowSRF, bool needDescForSRF)
Definition: execSRF.c:676
bool fn_retset
Definition: fmgr.h:62
Oid funcid
Definition: primnodes.h:449
#define ERROR
Definition: elog.h:43
bool funcReturnsSet
Definition: execnodes.h:725
List * ExecInitExprList(List *nodes, PlanState *parent)
Definition: execExpr.c:266
Oid opfuncid
Definition: primnodes.h:497
Expr * expr
Definition: execnodes.h:689
#define InvalidOid
Definition: postgres_ext.h:36
Oid fn_oid
Definition: fmgr.h:59
#define makeNode(_type_)
Definition: nodes.h:558
Oid inputcollid
Definition: primnodes.h:456
#define Assert(condition)
Definition: c.h:670
Definition: regguts.h:298
Oid inputcollid
Definition: primnodes.h:501
MemoryContext ecxt_per_query_memory
Definition: execnodes.h:202
#define nodeTag(nodeptr)
Definition: nodes.h:515
#define elog
Definition: elog.h:219
List * args
Definition: primnodes.h:502

◆ ExecInitJunkFilter()

JunkFilter* ExecInitJunkFilter ( List targetList,
bool  hasoid,
TupleTableSlot slot 
)

Definition at line 61 of file execJunk.c.

References ExecCleanTypeFromTL(), ExecSetSlotDescriptor(), JunkFilter::jf_cleanMap, JunkFilter::jf_cleanTupType, JunkFilter::jf_resultSlot, JunkFilter::jf_targetList, lfirst, makeNode, MakeSingleTupleTableSlot(), tupleDesc::natts, palloc(), TargetEntry::resjunk, and TargetEntry::resno.

Referenced by check_sql_fn_retval(), ExecInitModifyTable(), ExecInitWholeRowVar(), and InitPlan().

62 {
63  JunkFilter *junkfilter;
64  TupleDesc cleanTupType;
65  int cleanLength;
66  AttrNumber *cleanMap;
67  ListCell *t;
68  AttrNumber cleanResno;
69 
70  /*
71  * Compute the tuple descriptor for the cleaned tuple.
72  */
73  cleanTupType = ExecCleanTypeFromTL(targetList, hasoid);
74 
75  /*
76  * Use the given slot, or make a new slot if we weren't given one.
77  */
78  if (slot)
79  ExecSetSlotDescriptor(slot, cleanTupType);
80  else
81  slot = MakeSingleTupleTableSlot(cleanTupType);
82 
83  /*
84  * Now calculate the mapping between the original tuple's attributes and
85  * the "clean" tuple's attributes.
86  *
87  * The "map" is an array of "cleanLength" attribute numbers, i.e. one
88  * entry for every attribute of the "clean" tuple. The value of this entry
89  * is the attribute number of the corresponding attribute of the
90  * "original" tuple. (Zero indicates a NULL output attribute, but we do
91  * not use that feature in this routine.)
92  */
93  cleanLength = cleanTupType->natts;
94  if (cleanLength > 0)
95  {
96  cleanMap = (AttrNumber *) palloc(cleanLength * sizeof(AttrNumber));
97  cleanResno = 1;
98  foreach(t, targetList)
99  {
100  TargetEntry *tle = lfirst(t);
101 
102  if (!tle->resjunk)
103  {
104  cleanMap[cleanResno - 1] = tle->resno;
105  cleanResno++;
106  }
107  }
108  }
109  else
110  cleanMap = NULL;
111 
112  /*
113  * Finally create and initialize the JunkFilter struct.
114  */
115  junkfilter = makeNode(JunkFilter);
116 
117  junkfilter->jf_targetList = targetList;
118  junkfilter->jf_cleanTupType = cleanTupType;
119  junkfilter->jf_cleanMap = cleanMap;
120  junkfilter->jf_resultSlot = slot;
121 
122  return junkfilter;
123 }
AttrNumber * jf_cleanMap
Definition: execnodes.h:334
List * jf_targetList
Definition: execnodes.h:332
TupleTableSlot * jf_resultSlot
Definition: execnodes.h:335
int natts
Definition: tupdesc.h:79
bool resjunk
Definition: primnodes.h:1382
TupleDesc jf_cleanTupType
Definition: execnodes.h:333
AttrNumber resno
Definition: primnodes.h:1376
TupleTableSlot * MakeSingleTupleTableSlot(TupleDesc tupdesc)
Definition: execTuples.c:199
void ExecSetSlotDescriptor(TupleTableSlot *slot, TupleDesc tupdesc)
Definition: execTuples.c:247
#define makeNode(_type_)
Definition: nodes.h:558
#define lfirst(lc)
Definition: pg_list.h:106
void * palloc(Size size)
Definition: mcxt.c:848
TupleDesc ExecCleanTypeFromTL(List *targetList, bool hasoid)
Definition: execTuples.c:900
int16 AttrNumber
Definition: attnum.h:21

◆ ExecInitJunkFilterConversion()

JunkFilter* ExecInitJunkFilterConversion ( List targetList,