PostgreSQL Source Code  git master
nodeAppend.h File Reference
#include "access/parallel.h"
#include "nodes/execnodes.h"
Include dependency graph for nodeAppend.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions

AppendStateExecInitAppend (Append *node, EState *estate, int eflags)
 
void ExecEndAppend (AppendState *node)
 
void ExecReScanAppend (AppendState *node)
 
void ExecAppendEstimate (AppendState *node, ParallelContext *pcxt)
 
void ExecAppendInitializeDSM (AppendState *node, ParallelContext *pcxt)
 
void ExecAppendReInitializeDSM (AppendState *node, ParallelContext *pcxt)
 
void ExecAppendInitializeWorker (AppendState *node, ParallelWorkerContext *pwcxt)
 
void ExecAsyncAppendResponse (AsyncRequest *areq)
 

Function Documentation

◆ ExecAppendEstimate()

void ExecAppendEstimate ( AppendState node,
ParallelContext pcxt 
)

Definition at line 482 of file nodeAppend.c.

484 {
485  node->pstate_len =
486  add_size(offsetof(ParallelAppendState, pa_finished),
487  sizeof(bool) * node->as_nplans);
488 
490  shm_toc_estimate_keys(&pcxt->estimator, 1);
491 }
#define offsetof(type, field)
Definition: c.h:738
#define shm_toc_estimate_chunk(e, sz)
Definition: shm_toc.h:51
#define shm_toc_estimate_keys(e, cnt)
Definition: shm_toc.h:53
Size add_size(Size s1, Size s2)
Definition: shmem.c:502
Size pstate_len
Definition: execnodes.h:1318
shm_toc_estimator estimator
Definition: parallel.h:42

References add_size(), AppendState::as_nplans, ParallelContext::estimator, offsetof, AppendState::pstate_len, shm_toc_estimate_chunk, and shm_toc_estimate_keys.

Referenced by ExecParallelEstimate().

◆ ExecAppendInitializeDSM()

void ExecAppendInitializeDSM ( AppendState node,
ParallelContext pcxt 
)

Definition at line 501 of file nodeAppend.c.

503 {
504  ParallelAppendState *pstate;
505 
506  pstate = shm_toc_allocate(pcxt->toc, node->pstate_len);
507  memset(pstate, 0, node->pstate_len);
509  shm_toc_insert(pcxt->toc, node->ps.plan->plan_node_id, pstate);
510 
511  node->as_pstate = pstate;
513 }
void LWLockInitialize(LWLock *lock, int tranche_id)
Definition: lwlock.c:734
@ LWTRANCHE_PARALLEL_APPEND
Definition: lwlock.h:191
static bool choose_next_subplan_for_leader(AppendState *node)
Definition: nodeAppend.c:615
void shm_toc_insert(shm_toc *toc, uint64 key, void *address)
Definition: shm_toc.c:171
void * shm_toc_allocate(shm_toc *toc, Size nbytes)
Definition: shm_toc.c:88
bool(* choose_next_subplan)(AppendState *)
Definition: execnodes.h:1322
PlanState ps
Definition: execnodes.h:1299
ParallelAppendState * as_pstate
Definition: execnodes.h:1317
shm_toc * toc
Definition: parallel.h:45
Plan * plan
Definition: execnodes.h:998
int plan_node_id
Definition: plannodes.h:141

References AppendState::as_pstate, AppendState::choose_next_subplan, choose_next_subplan_for_leader(), LWLockInitialize(), LWTRANCHE_PARALLEL_APPEND, ParallelAppendState::pa_lock, PlanState::plan, Plan::plan_node_id, AppendState::ps, AppendState::pstate_len, shm_toc_allocate(), shm_toc_insert(), and ParallelContext::toc.

Referenced by ExecParallelInitializeDSM().

◆ ExecAppendInitializeWorker()

void ExecAppendInitializeWorker ( AppendState node,
ParallelWorkerContext pwcxt 
)

Definition at line 538 of file nodeAppend.c.

539 {
540  node->as_pstate = shm_toc_lookup(pwcxt->toc, node->ps.plan->plan_node_id, false);
542 }
static bool choose_next_subplan_for_worker(AppendState *node)
Definition: nodeAppend.c:696
void * shm_toc_lookup(shm_toc *toc, uint64 key, bool noError)
Definition: shm_toc.c:232

References AppendState::as_pstate, AppendState::choose_next_subplan, choose_next_subplan_for_worker(), PlanState::plan, Plan::plan_node_id, AppendState::ps, shm_toc_lookup(), and ParallelWorkerContext::toc.

Referenced by ExecParallelInitializeWorker().

◆ ExecAppendReInitializeDSM()

void ExecAppendReInitializeDSM ( AppendState node,
ParallelContext pcxt 
)

Definition at line 522 of file nodeAppend.c.

523 {
524  ParallelAppendState *pstate = node->as_pstate;
525 
526  pstate->pa_next_plan = 0;
527  memset(pstate->pa_finished, 0, sizeof(bool) * node->as_nplans);
528 }
bool pa_finished[FLEXIBLE_ARRAY_MEMBER]
Definition: nodeAppend.c:80

References AppendState::as_nplans, AppendState::as_pstate, ParallelAppendState::pa_finished, and ParallelAppendState::pa_next_plan.

Referenced by ExecParallelReInitializeDSM().

◆ ExecAsyncAppendResponse()

void ExecAsyncAppendResponse ( AsyncRequest areq)

Definition at line 1095 of file nodeAppend.c.

1096 {
1097  AppendState *node = (AppendState *) areq->requestor;
1098  TupleTableSlot *slot = areq->result;
1099 
1100  /* The result should be a TupleTableSlot or NULL. */
1101  Assert(slot == NULL || IsA(slot, TupleTableSlot));
1102 
1103  /* Nothing to do if the request is pending. */
1104  if (!areq->request_complete)
1105  {
1106  /* The request would have been pending for a callback. */
1107  Assert(areq->callback_pending);
1108  return;
1109  }
1110 
1111  /* If the result is NULL or an empty slot, there's nothing more to do. */
1112  if (TupIsNull(slot))
1113  {
1114  /* The ending subplan wouldn't have been pending for a callback. */
1115  Assert(!areq->callback_pending);
1116  --node->as_nasyncremain;
1117  return;
1118  }
1119 
1120  /* Save result so we can return it. */
1121  Assert(node->as_nasyncresults < node->as_nasyncplans);
1122  node->as_asyncresults[node->as_nasyncresults++] = slot;
1123 
1124  /*
1125  * Mark the subplan that returned a result as ready for a new request. We
1126  * don't launch another one here immediately because it might complete.
1127  */
1129  areq->request_index);
1130 }
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:738
Assert(fmt[strlen(fmt) - 1] !='\n')
#define IsA(nodeptr, _type_)
Definition: nodes.h:625
Bitmapset * as_needrequest
Definition: execnodes.h:1312
int as_nasyncresults
Definition: execnodes.h:1308
int as_nasyncremain
Definition: execnodes.h:1311
TupleTableSlot ** as_asyncresults
Definition: execnodes.h:1307
int as_nasyncplans
Definition: execnodes.h:1305
struct PlanState * requestor
Definition: execnodes.h:569
TupleTableSlot * result
Definition: execnodes.h:574
bool request_complete
Definition: execnodes.h:573
int request_index
Definition: execnodes.h:571
bool callback_pending
Definition: execnodes.h:572
#define TupIsNull(slot)
Definition: tuptable.h:292

References AppendState::as_asyncresults, AppendState::as_nasyncplans, AppendState::as_nasyncremain, AppendState::as_nasyncresults, AppendState::as_needrequest, Assert(), bms_add_member(), AsyncRequest::callback_pending, IsA, AsyncRequest::request_complete, AsyncRequest::request_index, AsyncRequest::requestor, AsyncRequest::result, and TupIsNull.

Referenced by ExecAsyncResponse().

◆ ExecEndAppend()

void ExecEndAppend ( AppendState node)

Definition at line 382 of file nodeAppend.c.

383 {
384  PlanState **appendplans;
385  int nplans;
386  int i;
387 
388  /*
389  * get information from the node
390  */
391  appendplans = node->appendplans;
392  nplans = node->as_nplans;
393 
394  /*
395  * shut down each of the subscans
396  */
397  for (i = 0; i < nplans; i++)
398  ExecEndNode(appendplans[i]);
399 }
void ExecEndNode(PlanState *node)
Definition: execProcnode.c:556
int i
Definition: isn.c:73
PlanState ** appendplans
Definition: execnodes.h:1300

References AppendState::appendplans, AppendState::as_nplans, ExecEndNode(), and i.

Referenced by ExecEndNode().

◆ ExecInitAppend()

AppendState* ExecInitAppend ( Append node,
EState estate,
int  eflags 
)

Definition at line 109 of file nodeAppend.c.

110 {
111  AppendState *appendstate = makeNode(AppendState);
112  PlanState **appendplanstates;
113  Bitmapset *validsubplans;
114  Bitmapset *asyncplans;
115  int nplans;
116  int nasyncplans;
117  int firstvalid;
118  int i,
119  j;
120 
121  /* check for unsupported flags */
122  Assert(!(eflags & EXEC_FLAG_MARK));
123 
124  /*
125  * create new AppendState for our append node
126  */
127  appendstate->ps.plan = (Plan *) node;
128  appendstate->ps.state = estate;
129  appendstate->ps.ExecProcNode = ExecAppend;
130 
131  /* Let choose_next_subplan_* function handle setting the first subplan */
132  appendstate->as_whichplan = INVALID_SUBPLAN_INDEX;
133  appendstate->as_syncdone = false;
134  appendstate->as_begun = false;
135 
136  /* If run-time partition pruning is enabled, then set that up now */
137  if (node->part_prune_info != NULL)
138  {
139  PartitionPruneState *prunestate;
140 
141  /*
142  * Set up pruning data structure. This also initializes the set of
143  * subplans to initialize (validsubplans) by taking into account the
144  * result of performing initial pruning if any.
145  */
146  prunestate = ExecInitPartitionPruning(&appendstate->ps,
147  list_length(node->appendplans),
148  node->part_prune_info,
149  &validsubplans);
150  appendstate->as_prune_state = prunestate;
151  nplans = bms_num_members(validsubplans);
152 
153  /*
154  * When no run-time pruning is required and there's at least one
155  * subplan, we can fill as_valid_subplans immediately, preventing
156  * later calls to ExecFindMatchingSubPlans.
157  */
158  if (!prunestate->do_exec_prune && nplans > 0)
159  appendstate->as_valid_subplans = bms_add_range(NULL, 0, nplans - 1);
160  }
161  else
162  {
163  nplans = list_length(node->appendplans);
164 
165  /*
166  * When run-time partition pruning is not enabled we can just mark all
167  * subplans as valid; they must also all be initialized.
168  */
169  Assert(nplans > 0);
170  appendstate->as_valid_subplans = validsubplans =
171  bms_add_range(NULL, 0, nplans - 1);
172  appendstate->as_prune_state = NULL;
173  }
174 
175  /*
176  * Initialize result tuple type and slot.
177  */
178  ExecInitResultTupleSlotTL(&appendstate->ps, &TTSOpsVirtual);
179 
180  /* node returns slots from each of its subnodes, therefore not fixed */
181  appendstate->ps.resultopsset = true;
182  appendstate->ps.resultopsfixed = false;
183 
184  appendplanstates = (PlanState **) palloc(nplans *
185  sizeof(PlanState *));
186 
187  /*
188  * call ExecInitNode on each of the valid plans to be executed and save
189  * the results into the appendplanstates array.
190  *
191  * While at it, find out the first valid partial plan.
192  */
193  j = 0;
194  asyncplans = NULL;
195  nasyncplans = 0;
196  firstvalid = nplans;
197  i = -1;
198  while ((i = bms_next_member(validsubplans, i)) >= 0)
199  {
200  Plan *initNode = (Plan *) list_nth(node->appendplans, i);
201 
202  /*
203  * Record async subplans. When executing EvalPlanQual, we treat them
204  * as sync ones; don't do this when initializing an EvalPlanQual plan
205  * tree.
206  */
207  if (initNode->async_capable && estate->es_epq_active == NULL)
208  {
209  asyncplans = bms_add_member(asyncplans, j);
210  nasyncplans++;
211  }
212 
213  /*
214  * Record the lowest appendplans index which is a valid partial plan.
215  */
216  if (i >= node->first_partial_plan && j < firstvalid)
217  firstvalid = j;
218 
219  appendplanstates[j++] = ExecInitNode(initNode, estate, eflags);
220  }
221 
222  appendstate->as_first_partial_plan = firstvalid;
223  appendstate->appendplans = appendplanstates;
224  appendstate->as_nplans = nplans;
225 
226  /* Initialize async state */
227  appendstate->as_asyncplans = asyncplans;
228  appendstate->as_nasyncplans = nasyncplans;
229  appendstate->as_asyncrequests = NULL;
230  appendstate->as_asyncresults = NULL;
231  appendstate->as_nasyncresults = 0;
232  appendstate->as_nasyncremain = 0;
233  appendstate->as_needrequest = NULL;
234  appendstate->as_eventset = NULL;
235  appendstate->as_valid_asyncplans = NULL;
236 
237  if (nasyncplans > 0)
238  {
239  appendstate->as_asyncrequests = (AsyncRequest **)
240  palloc0(nplans * sizeof(AsyncRequest *));
241 
242  i = -1;
243  while ((i = bms_next_member(asyncplans, i)) >= 0)
244  {
245  AsyncRequest *areq;
246 
247  areq = palloc(sizeof(AsyncRequest));
248  areq->requestor = (PlanState *) appendstate;
249  areq->requestee = appendplanstates[i];
250  areq->request_index = i;
251  areq->callback_pending = false;
252  areq->request_complete = false;
253  areq->result = NULL;
254 
255  appendstate->as_asyncrequests[i] = areq;
256  }
257 
258  appendstate->as_asyncresults = (TupleTableSlot **)
259  palloc0(nasyncplans * sizeof(TupleTableSlot *));
260 
261  if (appendstate->as_valid_subplans != NULL)
262  classify_matching_subplans(appendstate);
263  }
264 
265  /*
266  * Miscellaneous initialization
267  */
268 
269  appendstate->ps.ps_ProjInfo = NULL;
270 
271  /* For parallel query, this will be overridden later. */
273 
274  return appendstate;
275 }
int bms_next_member(const Bitmapset *a, int prevbit)
Definition: bitmapset.c:1045
int bms_num_members(const Bitmapset *a)
Definition: bitmapset.c:648
Bitmapset * bms_add_range(Bitmapset *a, int lower, int upper)
Definition: bitmapset.c:836
PartitionPruneState * ExecInitPartitionPruning(PlanState *planstate, int n_total_subplans, PartitionPruneInfo *pruneinfo, Bitmapset **initially_valid_subplans)
PlanState * ExecInitNode(Plan *node, EState *estate, int eflags)
Definition: execProcnode.c:141
const TupleTableSlotOps TTSOpsVirtual
Definition: execTuples.c:83
void ExecInitResultTupleSlotTL(PlanState *planstate, const TupleTableSlotOps *tts_ops)
Definition: execTuples.c:1799
#define EXEC_FLAG_MARK
Definition: executor.h:59
int j
Definition: isn.c:74
void * palloc0(Size size)
Definition: mcxt.c:1099
void * palloc(Size size)
Definition: mcxt.c:1068
static void classify_matching_subplans(AppendState *node)
Definition: nodeAppend.c:1141
static TupleTableSlot * ExecAppend(PlanState *pstate)
Definition: nodeAppend.c:284
#define INVALID_SUBPLAN_INDEX
Definition: nodeAppend.c:83
static bool choose_next_subplan_locally(AppendState *node)
Definition: nodeAppend.c:552
#define makeNode(_type_)
Definition: nodes.h:622
static int list_length(const List *l)
Definition: pg_list.h:150
static void * list_nth(const List *list, int n)
Definition: pg_list.h:297
struct PartitionPruneState * as_prune_state
Definition: execnodes.h:1319
Bitmapset * as_valid_asyncplans
Definition: execnodes.h:1321
bool as_syncdone
Definition: execnodes.h:1309
AsyncRequest ** as_asyncrequests
Definition: execnodes.h:1306
bool as_begun
Definition: execnodes.h:1303
Bitmapset * as_asyncplans
Definition: execnodes.h:1304
int as_whichplan
Definition: execnodes.h:1302
struct WaitEventSet * as_eventset
Definition: execnodes.h:1313
int as_first_partial_plan
Definition: execnodes.h:1315
Bitmapset * as_valid_subplans
Definition: execnodes.h:1320
int first_partial_plan
Definition: plannodes.h:263
struct PartitionPruneInfo * part_prune_info
Definition: plannodes.h:266
List * appendplans
Definition: plannodes.h:256
struct PlanState * requestee
Definition: execnodes.h:570
struct EPQState * es_epq_active
Definition: execnodes.h:661
bool resultopsset
Definition: execnodes.h:1083
EState * state
Definition: execnodes.h:1000
ProjectionInfo * ps_ProjInfo
Definition: execnodes.h:1038
bool resultopsfixed
Definition: execnodes.h:1079
ExecProcNodeMtd ExecProcNode
Definition: execnodes.h:1004
bool async_capable
Definition: plannodes.h:136

References AppendState::appendplans, Append::appendplans, AppendState::as_asyncplans, AppendState::as_asyncrequests, AppendState::as_asyncresults, AppendState::as_begun, AppendState::as_eventset, AppendState::as_first_partial_plan, AppendState::as_nasyncplans, AppendState::as_nasyncremain, AppendState::as_nasyncresults, AppendState::as_needrequest, AppendState::as_nplans, AppendState::as_prune_state, AppendState::as_syncdone, AppendState::as_valid_asyncplans, AppendState::as_valid_subplans, AppendState::as_whichplan, Assert(), Plan::async_capable, bms_add_member(), bms_add_range(), bms_next_member(), bms_num_members(), AsyncRequest::callback_pending, AppendState::choose_next_subplan, choose_next_subplan_locally(), classify_matching_subplans(), PartitionPruneState::do_exec_prune, EState::es_epq_active, EXEC_FLAG_MARK, ExecAppend(), ExecInitNode(), ExecInitPartitionPruning(), ExecInitResultTupleSlotTL(), PlanState::ExecProcNode, Append::first_partial_plan, i, INVALID_SUBPLAN_INDEX, j, list_length(), list_nth(), makeNode, palloc(), palloc0(), Append::part_prune_info, PlanState::plan, AppendState::ps, PlanState::ps_ProjInfo, AsyncRequest::request_complete, AsyncRequest::request_index, AsyncRequest::requestee, AsyncRequest::requestor, AsyncRequest::result, PlanState::resultopsfixed, PlanState::resultopsset, PlanState::state, and TTSOpsVirtual.

Referenced by ExecInitNode().

◆ ExecReScanAppend()

void ExecReScanAppend ( AppendState node)

Definition at line 402 of file nodeAppend.c.

403 {
404  int nasyncplans = node->as_nasyncplans;
405  int i;
406 
407  /*
408  * If any PARAM_EXEC Params used in pruning expressions have changed, then
409  * we'd better unset the valid subplans so that they are reselected for
410  * the new parameter values.
411  */
412  if (node->as_prune_state &&
413  bms_overlap(node->ps.chgParam,
415  {
417  node->as_valid_subplans = NULL;
418  if (nasyncplans > 0)
419  {
421  node->as_valid_asyncplans = NULL;
422  }
423  }
424 
425  for (i = 0; i < node->as_nplans; i++)
426  {
427  PlanState *subnode = node->appendplans[i];
428 
429  /*
430  * ExecReScan doesn't know about my subplans, so I have to do
431  * changed-parameter signaling myself.
432  */
433  if (node->ps.chgParam != NULL)
434  UpdateChangedParamSet(subnode, node->ps.chgParam);
435 
436  /*
437  * If chgParam of subnode is not null then plan will be re-scanned by
438  * first ExecProcNode or by first ExecAsyncRequest.
439  */
440  if (subnode->chgParam == NULL)
441  ExecReScan(subnode);
442  }
443 
444  /* Reset async state */
445  if (nasyncplans > 0)
446  {
447  i = -1;
448  while ((i = bms_next_member(node->as_asyncplans, i)) >= 0)
449  {
450  AsyncRequest *areq = node->as_asyncrequests[i];
451 
452  areq->callback_pending = false;
453  areq->request_complete = false;
454  areq->result = NULL;
455  }
456 
457  node->as_nasyncresults = 0;
458  node->as_nasyncremain = 0;
459  bms_free(node->as_needrequest);
460  node->as_needrequest = NULL;
461  }
462 
463  /* Let choose_next_subplan_* function handle setting the first subplan */
465  node->as_syncdone = false;
466  node->as_begun = false;
467 }
void bms_free(Bitmapset *a)
Definition: bitmapset.c:208
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:494
void ExecReScan(PlanState *node)
Definition: execAmi.c:78
void UpdateChangedParamSet(PlanState *node, Bitmapset *newchg)
Definition: execUtils.c:864
Bitmapset * execparamids
Bitmapset * chgParam
Definition: execnodes.h:1030

References AppendState::appendplans, AppendState::as_asyncplans, AppendState::as_asyncrequests, AppendState::as_begun, AppendState::as_nasyncplans, AppendState::as_nasyncremain, AppendState::as_nasyncresults, AppendState::as_needrequest, AppendState::as_nplans, AppendState::as_prune_state, AppendState::as_syncdone, AppendState::as_valid_asyncplans, AppendState::as_valid_subplans, AppendState::as_whichplan, bms_free(), bms_next_member(), bms_overlap(), AsyncRequest::callback_pending, PlanState::chgParam, PartitionPruneState::execparamids, ExecReScan(), i, INVALID_SUBPLAN_INDEX, AppendState::ps, AsyncRequest::request_complete, AsyncRequest::result, and UpdateChangedParamSet().

Referenced by ExecReScan().