PostgreSQL Source Code  git master
execParallel.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * execParallel.c
4  * Support routines for parallel execution.
5  *
6  * Portions Copyright (c) 1996-2019, PostgreSQL Global Development Group
7  * Portions Copyright (c) 1994, Regents of the University of California
8  *
9  * This file contains routines that are intended to support setting up,
10  * using, and tearing down a ParallelContext from within the PostgreSQL
11  * executor. The ParallelContext machinery will handle starting the
12  * workers and ensuring that their state generally matches that of the
13  * leader; see src/backend/access/transam/README.parallel for details.
14  * However, we must save and restore relevant executor state, such as
15  * any ParamListInfo associated with the query, buffer usage info, and
16  * the actual plan to be passed down to the worker.
17  *
18  * IDENTIFICATION
19  * src/backend/executor/execParallel.c
20  *
21  *-------------------------------------------------------------------------
22  */
23 
24 #include "postgres.h"
25 
26 #include "executor/execParallel.h"
27 #include "executor/executor.h"
28 #include "executor/nodeAppend.h"
30 #include "executor/nodeCustom.h"
32 #include "executor/nodeHash.h"
33 #include "executor/nodeHashjoin.h"
34 #include "executor/nodeIndexscan.h"
36 #include "executor/nodeSeqscan.h"
37 #include "executor/nodeSort.h"
38 #include "executor/nodeSubplan.h"
39 #include "executor/tqueue.h"
40 #include "jit/jit.h"
41 #include "nodes/nodeFuncs.h"
42 #include "storage/spin.h"
43 #include "tcop/tcopprot.h"
44 #include "utils/datum.h"
45 #include "utils/dsa.h"
46 #include "utils/lsyscache.h"
47 #include "utils/memutils.h"
48 #include "utils/snapmgr.h"
49 #include "pgstat.h"
50 
51 /*
52  * Magic numbers for parallel executor communication. We use constants
53  * greater than any 32-bit integer here so that values < 2^32 can be used
54  * by individual parallel nodes to store their own state.
55  */
56 #define PARALLEL_KEY_EXECUTOR_FIXED UINT64CONST(0xE000000000000001)
57 #define PARALLEL_KEY_PLANNEDSTMT UINT64CONST(0xE000000000000002)
58 #define PARALLEL_KEY_PARAMLISTINFO UINT64CONST(0xE000000000000003)
59 #define PARALLEL_KEY_BUFFER_USAGE UINT64CONST(0xE000000000000004)
60 #define PARALLEL_KEY_TUPLE_QUEUE UINT64CONST(0xE000000000000005)
61 #define PARALLEL_KEY_INSTRUMENTATION UINT64CONST(0xE000000000000006)
62 #define PARALLEL_KEY_DSA UINT64CONST(0xE000000000000007)
63 #define PARALLEL_KEY_QUERY_TEXT UINT64CONST(0xE000000000000008)
64 #define PARALLEL_KEY_JIT_INSTRUMENTATION UINT64CONST(0xE000000000000009)
65 
66 #define PARALLEL_TUPLE_QUEUE_SIZE 65536
67 
68 /*
69  * Fixed-size random stuff that we need to pass to parallel workers.
70  */
72 {
73  int64 tuples_needed; /* tuple bound, see ExecSetTupleBound */
75  int eflags;
76  int jit_flags;
78 
79 /*
80  * DSM structure for accumulating per-PlanState instrumentation.
81  *
82  * instrument_options: Same meaning here as in instrument.c.
83  *
84  * instrument_offset: Offset, relative to the start of this structure,
85  * of the first Instrumentation object. This will depend on the length of
86  * the plan_node_id array.
87  *
88  * num_workers: Number of workers.
89  *
90  * num_plan_nodes: Number of plan nodes.
91  *
92  * plan_node_id: Array of plan nodes for which we are gathering instrumentation
93  * from parallel workers. The length of this array is given by num_plan_nodes.
94  */
96 {
101  int plan_node_id[FLEXIBLE_ARRAY_MEMBER];
102  /* array of num_plan_nodes * num_workers Instrumentation objects follows */
103 };
104 #define GetInstrumentationArray(sei) \
105  (AssertVariableIsOfTypeMacro(sei, SharedExecutorInstrumentation *), \
106  (Instrumentation *) (((char *) sei) + sei->instrument_offset))
107 
108 /* Context object for ExecParallelEstimate. */
110 {
112  int nnodes;
114 
115 /* Context object for ExecParallelInitializeDSM. */
117 {
120  int nnodes;
122 
123 /* Helper functions that run in the parallel leader. */
124 static char *ExecSerializePlan(Plan *plan, EState *estate);
125 static bool ExecParallelEstimate(PlanState *node,
127 static bool ExecParallelInitializeDSM(PlanState *node,
130  bool reinitialize);
131 static bool ExecParallelReInitializeDSM(PlanState *planstate,
132  ParallelContext *pcxt);
133 static bool ExecParallelRetrieveInstrumentation(PlanState *planstate,
134  SharedExecutorInstrumentation *instrumentation);
135 
136 /* Helper function that runs in the parallel worker. */
138 
139 /*
140  * Create a serialized representation of the plan to be sent to each worker.
141  */
142 static char *
144 {
145  PlannedStmt *pstmt;
146  ListCell *lc;
147 
148  /* We can't scribble on the original plan, so make a copy. */
149  plan = copyObject(plan);
150 
151  /*
152  * The worker will start its own copy of the executor, and that copy will
153  * insert a junk filter if the toplevel node has any resjunk entries. We
154  * don't want that to happen, because while resjunk columns shouldn't be
155  * sent back to the user, here the tuples are coming back to another
156  * backend which may very well need them. So mutate the target list
157  * accordingly. This is sort of a hack; there might be better ways to do
158  * this...
159  */
160  foreach(lc, plan->targetlist)
161  {
162  TargetEntry *tle = lfirst_node(TargetEntry, lc);
163 
164  tle->resjunk = false;
165  }
166 
167  /*
168  * Create a dummy PlannedStmt. Most of the fields don't need to be valid
169  * for our purposes, but the worker will need at least a minimal
170  * PlannedStmt to start the executor.
171  */
172  pstmt = makeNode(PlannedStmt);
173  pstmt->commandType = CMD_SELECT;
174  pstmt->queryId = UINT64CONST(0);
175  pstmt->hasReturning = false;
176  pstmt->hasModifyingCTE = false;
177  pstmt->canSetTag = true;
178  pstmt->transientPlan = false;
179  pstmt->dependsOnRole = false;
180  pstmt->parallelModeNeeded = false;
181  pstmt->planTree = plan;
182  pstmt->rtable = estate->es_range_table;
183  pstmt->resultRelations = NIL;
184 
185  /*
186  * Transfer only parallel-safe subplans, leaving a NULL "hole" in the list
187  * for unsafe ones (so that the list indexes of the safe ones are
188  * preserved). This positively ensures that the worker won't try to run,
189  * or even do ExecInitNode on, an unsafe subplan. That's important to
190  * protect, eg, non-parallel-aware FDWs from getting into trouble.
191  */
192  pstmt->subplans = NIL;
193  foreach(lc, estate->es_plannedstmt->subplans)
194  {
195  Plan *subplan = (Plan *) lfirst(lc);
196 
197  if (subplan && !subplan->parallel_safe)
198  subplan = NULL;
199  pstmt->subplans = lappend(pstmt->subplans, subplan);
200  }
201 
202  pstmt->rewindPlanIDs = NULL;
203  pstmt->rowMarks = NIL;
204  pstmt->relationOids = NIL;
205  pstmt->invalItems = NIL; /* workers can't replan anyway... */
206  pstmt->paramExecTypes = estate->es_plannedstmt->paramExecTypes;
207  pstmt->utilityStmt = NULL;
208  pstmt->stmt_location = -1;
209  pstmt->stmt_len = -1;
210 
211  /* Return serialized copy of our dummy PlannedStmt. */
212  return nodeToString(pstmt);
213 }
214 
215 /*
216  * Parallel-aware plan nodes (and occasionally others) may need some state
217  * which is shared across all parallel workers. Before we size the DSM, give
218  * them a chance to call shm_toc_estimate_chunk or shm_toc_estimate_keys on
219  * &pcxt->estimator.
220  *
221  * While we're at it, count the number of PlanState nodes in the tree, so
222  * we know how many Instrumentation structures we need.
223  */
224 static bool
226 {
227  if (planstate == NULL)
228  return false;
229 
230  /* Count this node. */
231  e->nnodes++;
232 
233  switch (nodeTag(planstate))
234  {
235  case T_SeqScanState:
236  if (planstate->plan->parallel_aware)
237  ExecSeqScanEstimate((SeqScanState *) planstate,
238  e->pcxt);
239  break;
240  case T_IndexScanState:
241  if (planstate->plan->parallel_aware)
243  e->pcxt);
244  break;
246  if (planstate->plan->parallel_aware)
248  e->pcxt);
249  break;
250  case T_ForeignScanState:
251  if (planstate->plan->parallel_aware)
253  e->pcxt);
254  break;
255  case T_AppendState:
256  if (planstate->plan->parallel_aware)
257  ExecAppendEstimate((AppendState *) planstate,
258  e->pcxt);
259  break;
260  case T_CustomScanState:
261  if (planstate->plan->parallel_aware)
263  e->pcxt);
264  break;
266  if (planstate->plan->parallel_aware)
268  e->pcxt);
269  break;
270  case T_HashJoinState:
271  if (planstate->plan->parallel_aware)
272  ExecHashJoinEstimate((HashJoinState *) planstate,
273  e->pcxt);
274  break;
275  case T_HashState:
276  /* even when not parallel-aware, for EXPLAIN ANALYZE */
277  ExecHashEstimate((HashState *) planstate, e->pcxt);
278  break;
279  case T_SortState:
280  /* even when not parallel-aware, for EXPLAIN ANALYZE */
281  ExecSortEstimate((SortState *) planstate, e->pcxt);
282  break;
283 
284  default:
285  break;
286  }
287 
288  return planstate_tree_walker(planstate, ExecParallelEstimate, e);
289 }
290 
291 /*
292  * Estimate the amount of space required to serialize the indicated parameters.
293  */
294 static Size
296 {
297  int paramid;
298  Size sz = sizeof(int);
299 
300  paramid = -1;
301  while ((paramid = bms_next_member(params, paramid)) >= 0)
302  {
303  Oid typeOid;
304  int16 typLen;
305  bool typByVal;
306  ParamExecData *prm;
307 
308  prm = &(estate->es_param_exec_vals[paramid]);
309  typeOid = list_nth_oid(estate->es_plannedstmt->paramExecTypes,
310  paramid);
311 
312  sz = add_size(sz, sizeof(int)); /* space for paramid */
313 
314  /* space for datum/isnull */
315  if (OidIsValid(typeOid))
316  get_typlenbyval(typeOid, &typLen, &typByVal);
317  else
318  {
319  /* If no type OID, assume by-value, like copyParamList does. */
320  typLen = sizeof(Datum);
321  typByVal = true;
322  }
323  sz = add_size(sz,
324  datumEstimateSpace(prm->value, prm->isnull,
325  typByVal, typLen));
326  }
327  return sz;
328 }
329 
330 /*
331  * Serialize specified PARAM_EXEC parameters.
332  *
333  * We write the number of parameters first, as a 4-byte integer, and then
334  * write details for each parameter in turn. The details for each parameter
335  * consist of a 4-byte paramid (location of param in execution time internal
336  * parameter array) and then the datum as serialized by datumSerialize().
337  */
338 static dsa_pointer
340 {
341  Size size;
342  int nparams;
343  int paramid;
344  ParamExecData *prm;
345  dsa_pointer handle;
346  char *start_address;
347 
348  /* Allocate enough space for the current parameter values. */
349  size = EstimateParamExecSpace(estate, params);
350  handle = dsa_allocate(area, size);
351  start_address = dsa_get_address(area, handle);
352 
353  /* First write the number of parameters as a 4-byte integer. */
354  nparams = bms_num_members(params);
355  memcpy(start_address, &nparams, sizeof(int));
356  start_address += sizeof(int);
357 
358  /* Write details for each parameter in turn. */
359  paramid = -1;
360  while ((paramid = bms_next_member(params, paramid)) >= 0)
361  {
362  Oid typeOid;
363  int16 typLen;
364  bool typByVal;
365 
366  prm = &(estate->es_param_exec_vals[paramid]);
367  typeOid = list_nth_oid(estate->es_plannedstmt->paramExecTypes,
368  paramid);
369 
370  /* Write paramid. */
371  memcpy(start_address, &paramid, sizeof(int));
372  start_address += sizeof(int);
373 
374  /* Write datum/isnull */
375  if (OidIsValid(typeOid))
376  get_typlenbyval(typeOid, &typLen, &typByVal);
377  else
378  {
379  /* If no type OID, assume by-value, like copyParamList does. */
380  typLen = sizeof(Datum);
381  typByVal = true;
382  }
383  datumSerialize(prm->value, prm->isnull, typByVal, typLen,
384  &start_address);
385  }
386 
387  return handle;
388 }
389 
390 /*
391  * Restore specified PARAM_EXEC parameters.
392  */
393 static void
394 RestoreParamExecParams(char *start_address, EState *estate)
395 {
396  int nparams;
397  int i;
398  int paramid;
399 
400  memcpy(&nparams, start_address, sizeof(int));
401  start_address += sizeof(int);
402 
403  for (i = 0; i < nparams; i++)
404  {
405  ParamExecData *prm;
406 
407  /* Read paramid */
408  memcpy(&paramid, start_address, sizeof(int));
409  start_address += sizeof(int);
410  prm = &(estate->es_param_exec_vals[paramid]);
411 
412  /* Read datum/isnull. */
413  prm->value = datumRestore(&start_address, &prm->isnull);
414  prm->execPlan = NULL;
415  }
416 }
417 
418 /*
419  * Initialize the dynamic shared memory segment that will be used to control
420  * parallel execution.
421  */
422 static bool
425 {
426  if (planstate == NULL)
427  return false;
428 
429  /* If instrumentation is enabled, initialize slot for this node. */
430  if (d->instrumentation != NULL)
432  planstate->plan->plan_node_id;
433 
434  /* Count this node. */
435  d->nnodes++;
436 
437  /*
438  * Call initializers for DSM-using plan nodes.
439  *
440  * Most plan nodes won't do anything here, but plan nodes that allocated
441  * DSM may need to initialize shared state in the DSM before parallel
442  * workers are launched. They can allocate the space they previously
443  * estimated using shm_toc_allocate, and add the keys they previously
444  * estimated using shm_toc_insert, in each case targeting pcxt->toc.
445  */
446  switch (nodeTag(planstate))
447  {
448  case T_SeqScanState:
449  if (planstate->plan->parallel_aware)
451  d->pcxt);
452  break;
453  case T_IndexScanState:
454  if (planstate->plan->parallel_aware)
456  d->pcxt);
457  break;
459  if (planstate->plan->parallel_aware)
461  d->pcxt);
462  break;
463  case T_ForeignScanState:
464  if (planstate->plan->parallel_aware)
466  d->pcxt);
467  break;
468  case T_AppendState:
469  if (planstate->plan->parallel_aware)
470  ExecAppendInitializeDSM((AppendState *) planstate,
471  d->pcxt);
472  break;
473  case T_CustomScanState:
474  if (planstate->plan->parallel_aware)
476  d->pcxt);
477  break;
479  if (planstate->plan->parallel_aware)
481  d->pcxt);
482  break;
483  case T_HashJoinState:
484  if (planstate->plan->parallel_aware)
486  d->pcxt);
487  break;
488  case T_HashState:
489  /* even when not parallel-aware, for EXPLAIN ANALYZE */
490  ExecHashInitializeDSM((HashState *) planstate, d->pcxt);
491  break;
492  case T_SortState:
493  /* even when not parallel-aware, for EXPLAIN ANALYZE */
494  ExecSortInitializeDSM((SortState *) planstate, d->pcxt);
495  break;
496 
497  default:
498  break;
499  }
500 
501  return planstate_tree_walker(planstate, ExecParallelInitializeDSM, d);
502 }
503 
504 /*
505  * It sets up the response queues for backend workers to return tuples
506  * to the main backend and start the workers.
507  */
508 static shm_mq_handle **
510 {
511  shm_mq_handle **responseq;
512  char *tqueuespace;
513  int i;
514 
515  /* Skip this if no workers. */
516  if (pcxt->nworkers == 0)
517  return NULL;
518 
519  /* Allocate memory for shared memory queue handles. */
520  responseq = (shm_mq_handle **)
521  palloc(pcxt->nworkers * sizeof(shm_mq_handle *));
522 
523  /*
524  * If not reinitializing, allocate space from the DSM for the queues;
525  * otherwise, find the already allocated space.
526  */
527  if (!reinitialize)
528  tqueuespace =
529  shm_toc_allocate(pcxt->toc,
531  pcxt->nworkers));
532  else
533  tqueuespace = shm_toc_lookup(pcxt->toc, PARALLEL_KEY_TUPLE_QUEUE, false);
534 
535  /* Create the queues, and become the receiver for each. */
536  for (i = 0; i < pcxt->nworkers; ++i)
537  {
538  shm_mq *mq;
539 
540  mq = shm_mq_create(tqueuespace +
542  (Size) PARALLEL_TUPLE_QUEUE_SIZE);
543 
545  responseq[i] = shm_mq_attach(mq, pcxt->seg, NULL);
546  }
547 
548  /* Add array of queues to shm_toc, so others can find it. */
549  if (!reinitialize)
550  shm_toc_insert(pcxt->toc, PARALLEL_KEY_TUPLE_QUEUE, tqueuespace);
551 
552  /* Return array of handles. */
553  return responseq;
554 }
555 
556 /*
557  * Sets up the required infrastructure for backend workers to perform
558  * execution and return results to the main backend.
559  */
562  Bitmapset *sendParams, int nworkers,
563  int64 tuples_needed)
564 {
566  ParallelContext *pcxt;
570  char *pstmt_data;
571  char *pstmt_space;
572  char *paramlistinfo_space;
573  BufferUsage *bufusage_space;
574  SharedExecutorInstrumentation *instrumentation = NULL;
575  SharedJitInstrumentation *jit_instrumentation = NULL;
576  int pstmt_len;
577  int paramlistinfo_len;
578  int instrumentation_len = 0;
579  int jit_instrumentation_len = 0;
580  int instrument_offset = 0;
581  Size dsa_minsize = dsa_minimum_size();
582  char *query_string;
583  int query_len;
584 
585  /*
586  * Force any initplan outputs that we're going to pass to workers to be
587  * evaluated, if they weren't already.
588  *
589  * For simplicity, we use the EState's per-output-tuple ExprContext here.
590  * That risks intra-query memory leakage, since we might pass through here
591  * many times before that ExprContext gets reset; but ExecSetParamPlan
592  * doesn't normally leak any memory in the context (see its comments), so
593  * it doesn't seem worth complicating this function's API to pass it a
594  * shorter-lived ExprContext. This might need to change someday.
595  */
596  ExecSetParamPlanMulti(sendParams, GetPerTupleExprContext(estate));
597 
598  /* Allocate object for return value. */
599  pei = palloc0(sizeof(ParallelExecutorInfo));
600  pei->finished = false;
601  pei->planstate = planstate;
602 
603  /* Fix up and serialize plan to be sent to workers. */
604  pstmt_data = ExecSerializePlan(planstate->plan, estate);
605 
606  /* Create a parallel context. */
607  pcxt = CreateParallelContext("postgres", "ParallelQueryMain", nworkers);
608  pei->pcxt = pcxt;
609 
610  /*
611  * Before telling the parallel context to create a dynamic shared memory
612  * segment, we need to figure out how big it should be. Estimate space
613  * for the various things we need to store.
614  */
615 
616  /* Estimate space for fixed-size state. */
619  shm_toc_estimate_keys(&pcxt->estimator, 1);
620 
621  /* Estimate space for query text. */
622  query_len = strlen(estate->es_sourceText);
623  shm_toc_estimate_chunk(&pcxt->estimator, query_len + 1);
624  shm_toc_estimate_keys(&pcxt->estimator, 1);
625 
626  /* Estimate space for serialized PlannedStmt. */
627  pstmt_len = strlen(pstmt_data) + 1;
628  shm_toc_estimate_chunk(&pcxt->estimator, pstmt_len);
629  shm_toc_estimate_keys(&pcxt->estimator, 1);
630 
631  /* Estimate space for serialized ParamListInfo. */
632  paramlistinfo_len = EstimateParamListSpace(estate->es_param_list_info);
633  shm_toc_estimate_chunk(&pcxt->estimator, paramlistinfo_len);
634  shm_toc_estimate_keys(&pcxt->estimator, 1);
635 
636  /*
637  * Estimate space for BufferUsage.
638  *
639  * If EXPLAIN is not in use and there are no extensions loaded that care,
640  * we could skip this. But we have no way of knowing whether anyone's
641  * looking at pgBufferUsage, so do it unconditionally.
642  */
644  mul_size(sizeof(BufferUsage), pcxt->nworkers));
645  shm_toc_estimate_keys(&pcxt->estimator, 1);
646 
647  /* Estimate space for tuple queues. */
650  shm_toc_estimate_keys(&pcxt->estimator, 1);
651 
652  /*
653  * Give parallel-aware nodes a chance to add to the estimates, and get a
654  * count of how many PlanState nodes there are.
655  */
656  e.pcxt = pcxt;
657  e.nnodes = 0;
658  ExecParallelEstimate(planstate, &e);
659 
660  /* Estimate space for instrumentation, if required. */
661  if (estate->es_instrument)
662  {
663  instrumentation_len =
664  offsetof(SharedExecutorInstrumentation, plan_node_id) +
665  sizeof(int) * e.nnodes;
666  instrumentation_len = MAXALIGN(instrumentation_len);
667  instrument_offset = instrumentation_len;
668  instrumentation_len +=
669  mul_size(sizeof(Instrumentation),
670  mul_size(e.nnodes, nworkers));
671  shm_toc_estimate_chunk(&pcxt->estimator, instrumentation_len);
672  shm_toc_estimate_keys(&pcxt->estimator, 1);
673 
674  /* Estimate space for JIT instrumentation, if required. */
675  if (estate->es_jit_flags != PGJIT_NONE)
676  {
677  jit_instrumentation_len =
678  offsetof(SharedJitInstrumentation, jit_instr) +
679  sizeof(JitInstrumentation) * nworkers;
680  shm_toc_estimate_chunk(&pcxt->estimator, jit_instrumentation_len);
681  shm_toc_estimate_keys(&pcxt->estimator, 1);
682  }
683  }
684 
685  /* Estimate space for DSA area. */
686  shm_toc_estimate_chunk(&pcxt->estimator, dsa_minsize);
687  shm_toc_estimate_keys(&pcxt->estimator, 1);
688 
689  /* Everyone's had a chance to ask for space, so now create the DSM. */
690  InitializeParallelDSM(pcxt);
691 
692  /*
693  * OK, now we have a dynamic shared memory segment, and it should be big
694  * enough to store all of the data we estimated we would want to put into
695  * it, plus whatever general stuff (not specifically executor-related) the
696  * ParallelContext itself needs to store there. None of the space we
697  * asked for has been allocated or initialized yet, though, so do that.
698  */
699 
700  /* Store fixed-size state. */
701  fpes = shm_toc_allocate(pcxt->toc, sizeof(FixedParallelExecutorState));
704  fpes->eflags = estate->es_top_eflags;
705  fpes->jit_flags = estate->es_jit_flags;
707 
708  /* Store query string */
709  query_string = shm_toc_allocate(pcxt->toc, query_len + 1);
710  memcpy(query_string, estate->es_sourceText, query_len + 1);
711  shm_toc_insert(pcxt->toc, PARALLEL_KEY_QUERY_TEXT, query_string);
712 
713  /* Store serialized PlannedStmt. */
714  pstmt_space = shm_toc_allocate(pcxt->toc, pstmt_len);
715  memcpy(pstmt_space, pstmt_data, pstmt_len);
716  shm_toc_insert(pcxt->toc, PARALLEL_KEY_PLANNEDSTMT, pstmt_space);
717 
718  /* Store serialized ParamListInfo. */
719  paramlistinfo_space = shm_toc_allocate(pcxt->toc, paramlistinfo_len);
720  shm_toc_insert(pcxt->toc, PARALLEL_KEY_PARAMLISTINFO, paramlistinfo_space);
721  SerializeParamList(estate->es_param_list_info, &paramlistinfo_space);
722 
723  /* Allocate space for each worker's BufferUsage; no need to initialize. */
724  bufusage_space = shm_toc_allocate(pcxt->toc,
725  mul_size(sizeof(BufferUsage), pcxt->nworkers));
726  shm_toc_insert(pcxt->toc, PARALLEL_KEY_BUFFER_USAGE, bufusage_space);
727  pei->buffer_usage = bufusage_space;
728 
729  /* Set up the tuple queues that the workers will write into. */
730  pei->tqueue = ExecParallelSetupTupleQueues(pcxt, false);
731 
732  /* We don't need the TupleQueueReaders yet, though. */
733  pei->reader = NULL;
734 
735  /*
736  * If instrumentation options were supplied, allocate space for the data.
737  * It only gets partially initialized here; the rest happens during
738  * ExecParallelInitializeDSM.
739  */
740  if (estate->es_instrument)
741  {
742  Instrumentation *instrument;
743  int i;
744 
745  instrumentation = shm_toc_allocate(pcxt->toc, instrumentation_len);
746  instrumentation->instrument_options = estate->es_instrument;
747  instrumentation->instrument_offset = instrument_offset;
748  instrumentation->num_workers = nworkers;
749  instrumentation->num_plan_nodes = e.nnodes;
750  instrument = GetInstrumentationArray(instrumentation);
751  for (i = 0; i < nworkers * e.nnodes; ++i)
752  InstrInit(&instrument[i], estate->es_instrument);
754  instrumentation);
755  pei->instrumentation = instrumentation;
756 
757  if (estate->es_jit_flags != PGJIT_NONE)
758  {
759  jit_instrumentation = shm_toc_allocate(pcxt->toc,
760  jit_instrumentation_len);
761  jit_instrumentation->num_workers = nworkers;
762  memset(jit_instrumentation->jit_instr, 0,
763  sizeof(JitInstrumentation) * nworkers);
765  jit_instrumentation);
766  pei->jit_instrumentation = jit_instrumentation;
767  }
768  }
769 
770  /*
771  * Create a DSA area that can be used by the leader and all workers.
772  * (However, if we failed to create a DSM and are using private memory
773  * instead, then skip this.)
774  */
775  if (pcxt->seg != NULL)
776  {
777  char *area_space;
778 
779  area_space = shm_toc_allocate(pcxt->toc, dsa_minsize);
780  shm_toc_insert(pcxt->toc, PARALLEL_KEY_DSA, area_space);
781  pei->area = dsa_create_in_place(area_space, dsa_minsize,
783  pcxt->seg);
784 
785  /*
786  * Serialize parameters, if any, using DSA storage. We don't dare use
787  * the main parallel query DSM for this because we might relaunch
788  * workers after the values have changed (and thus the amount of
789  * storage required has changed).
790  */
791  if (!bms_is_empty(sendParams))
792  {
793  pei->param_exec = SerializeParamExecParams(estate, sendParams,
794  pei->area);
795  fpes->param_exec = pei->param_exec;
796  }
797  }
798 
799  /*
800  * Give parallel-aware nodes a chance to initialize their shared data.
801  * This also initializes the elements of instrumentation->ps_instrument,
802  * if it exists.
803  */
804  d.pcxt = pcxt;
805  d.instrumentation = instrumentation;
806  d.nnodes = 0;
807 
808  /* Install our DSA area while initializing the plan. */
809  estate->es_query_dsa = pei->area;
810  ExecParallelInitializeDSM(planstate, &d);
811  estate->es_query_dsa = NULL;
812 
813  /*
814  * Make sure that the world hasn't shifted under our feet. This could
815  * probably just be an Assert(), but let's be conservative for now.
816  */
817  if (e.nnodes != d.nnodes)
818  elog(ERROR, "inconsistent count of PlanState nodes");
819 
820  /* OK, we're ready to rock and roll. */
821  return pei;
822 }
823 
824 /*
825  * Set up tuple queue readers to read the results of a parallel subplan.
826  *
827  * This is separate from ExecInitParallelPlan() because we can launch the
828  * worker processes and let them start doing something before we do this.
829  */
830 void
832 {
833  int nworkers = pei->pcxt->nworkers_launched;
834  int i;
835 
836  Assert(pei->reader == NULL);
837 
838  if (nworkers > 0)
839  {
840  pei->reader = (TupleQueueReader **)
841  palloc(nworkers * sizeof(TupleQueueReader *));
842 
843  for (i = 0; i < nworkers; i++)
844  {
845  shm_mq_set_handle(pei->tqueue[i],
846  pei->pcxt->worker[i].bgwhandle);
847  pei->reader[i] = CreateTupleQueueReader(pei->tqueue[i]);
848  }
849  }
850 }
851 
852 /*
853  * Re-initialize the parallel executor shared memory state before launching
854  * a fresh batch of workers.
855  */
856 void
859  Bitmapset *sendParams)
860 {
861  EState *estate = planstate->state;
863 
864  /* Old workers must already be shut down */
865  Assert(pei->finished);
866 
867  /*
868  * Force any initplan outputs that we're going to pass to workers to be
869  * evaluated, if they weren't already (see comments in
870  * ExecInitParallelPlan).
871  */
872  ExecSetParamPlanMulti(sendParams, GetPerTupleExprContext(estate));
873 
875  pei->tqueue = ExecParallelSetupTupleQueues(pei->pcxt, true);
876  pei->reader = NULL;
877  pei->finished = false;
878 
879  fpes = shm_toc_lookup(pei->pcxt->toc, PARALLEL_KEY_EXECUTOR_FIXED, false);
880 
881  /* Free any serialized parameters from the last round. */
882  if (DsaPointerIsValid(fpes->param_exec))
883  {
884  dsa_free(pei->area, fpes->param_exec);
886  }
887 
888  /* Serialize current parameter values if required. */
889  if (!bms_is_empty(sendParams))
890  {
891  pei->param_exec = SerializeParamExecParams(estate, sendParams,
892  pei->area);
893  fpes->param_exec = pei->param_exec;
894  }
895 
896  /* Traverse plan tree and let each child node reset associated state. */
897  estate->es_query_dsa = pei->area;
898  ExecParallelReInitializeDSM(planstate, pei->pcxt);
899  estate->es_query_dsa = NULL;
900 }
901 
902 /*
903  * Traverse plan tree to reinitialize per-node dynamic shared memory state
904  */
905 static bool
907  ParallelContext *pcxt)
908 {
909  if (planstate == NULL)
910  return false;
911 
912  /*
913  * Call reinitializers for DSM-using plan nodes.
914  */
915  switch (nodeTag(planstate))
916  {
917  case T_SeqScanState:
918  if (planstate->plan->parallel_aware)
920  pcxt);
921  break;
922  case T_IndexScanState:
923  if (planstate->plan->parallel_aware)
925  pcxt);
926  break;
928  if (planstate->plan->parallel_aware)
930  pcxt);
931  break;
932  case T_ForeignScanState:
933  if (planstate->plan->parallel_aware)
935  pcxt);
936  break;
937  case T_AppendState:
938  if (planstate->plan->parallel_aware)
939  ExecAppendReInitializeDSM((AppendState *) planstate, pcxt);
940  break;
941  case T_CustomScanState:
942  if (planstate->plan->parallel_aware)
944  pcxt);
945  break;
947  if (planstate->plan->parallel_aware)
949  pcxt);
950  break;
951  case T_HashJoinState:
952  if (planstate->plan->parallel_aware)
954  pcxt);
955  break;
956  case T_HashState:
957  case T_SortState:
958  /* these nodes have DSM state, but no reinitialization is required */
959  break;
960 
961  default:
962  break;
963  }
964 
965  return planstate_tree_walker(planstate, ExecParallelReInitializeDSM, pcxt);
966 }
967 
968 /*
969  * Copy instrumentation information about this node and its descendants from
970  * dynamic shared memory.
971  */
972 static bool
974  SharedExecutorInstrumentation *instrumentation)
975 {
976  Instrumentation *instrument;
977  int i;
978  int n;
979  int ibytes;
980  int plan_node_id = planstate->plan->plan_node_id;
981  MemoryContext oldcontext;
982 
983  /* Find the instrumentation for this node. */
984  for (i = 0; i < instrumentation->num_plan_nodes; ++i)
985  if (instrumentation->plan_node_id[i] == plan_node_id)
986  break;
987  if (i >= instrumentation->num_plan_nodes)
988  elog(ERROR, "plan node %d not found", plan_node_id);
989 
990  /* Accumulate the statistics from all workers. */
991  instrument = GetInstrumentationArray(instrumentation);
992  instrument += i * instrumentation->num_workers;
993  for (n = 0; n < instrumentation->num_workers; ++n)
994  InstrAggNode(planstate->instrument, &instrument[n]);
995 
996  /*
997  * Also store the per-worker detail.
998  *
999  * Worker instrumentation should be allocated in the same context as the
1000  * regular instrumentation information, which is the per-query context.
1001  * Switch into per-query memory context.
1002  */
1003  oldcontext = MemoryContextSwitchTo(planstate->state->es_query_cxt);
1004  ibytes = mul_size(instrumentation->num_workers, sizeof(Instrumentation));
1005  planstate->worker_instrument =
1006  palloc(ibytes + offsetof(WorkerInstrumentation, instrument));
1007  MemoryContextSwitchTo(oldcontext);
1008 
1009  planstate->worker_instrument->num_workers = instrumentation->num_workers;
1010  memcpy(&planstate->worker_instrument->instrument, instrument, ibytes);
1011 
1012  /* Perform any node-type-specific work that needs to be done. */
1013  switch (nodeTag(planstate))
1014  {
1015  case T_SortState:
1017  break;
1018  case T_HashState:
1020  break;
1021  default:
1022  break;
1023  }
1024 
1026  instrumentation);
1027 }
1028 
1029 /*
1030  * Add up the workers' JIT instrumentation from dynamic shared memory.
1031  */
1032 static void
1034  SharedJitInstrumentation *shared_jit)
1035 {
1036  JitInstrumentation *combined;
1037  int ibytes;
1038 
1039  int n;
1040 
1041  /*
1042  * Accumulate worker JIT instrumentation into the combined JIT
1043  * instrumentation, allocating it if required.
1044  */
1045  if (!planstate->state->es_jit_worker_instr)
1046  planstate->state->es_jit_worker_instr =
1048  combined = planstate->state->es_jit_worker_instr;
1049 
1050  /* Accumulate all the workers' instrumentations. */
1051  for (n = 0; n < shared_jit->num_workers; ++n)
1052  InstrJitAgg(combined, &shared_jit->jit_instr[n]);
1053 
1054  /*
1055  * Store the per-worker detail.
1056  *
1057  * Similar to ExecParallelRetrieveInstrumentation(), allocate the
1058  * instrumentation in per-query context.
1059  */
1060  ibytes = offsetof(SharedJitInstrumentation, jit_instr)
1061  + mul_size(shared_jit->num_workers, sizeof(JitInstrumentation));
1062  planstate->worker_jit_instrument =
1063  MemoryContextAlloc(planstate->state->es_query_cxt, ibytes);
1064 
1065  memcpy(planstate->worker_jit_instrument, shared_jit, ibytes);
1066 }
1067 
1068 /*
1069  * Finish parallel execution. We wait for parallel workers to finish, and
1070  * accumulate their buffer usage.
1071  */
1072 void
1074 {
1075  int nworkers = pei->pcxt->nworkers_launched;
1076  int i;
1077 
1078  /* Make this be a no-op if called twice in a row. */
1079  if (pei->finished)
1080  return;
1081 
1082  /*
1083  * Detach from tuple queues ASAP, so that any still-active workers will
1084  * notice that no further results are wanted.
1085  */
1086  if (pei->tqueue != NULL)
1087  {
1088  for (i = 0; i < nworkers; i++)
1089  shm_mq_detach(pei->tqueue[i]);
1090  pfree(pei->tqueue);
1091  pei->tqueue = NULL;
1092  }
1093 
1094  /*
1095  * While we're waiting for the workers to finish, let's get rid of the
1096  * tuple queue readers. (Any other local cleanup could be done here too.)
1097  */
1098  if (pei->reader != NULL)
1099  {
1100  for (i = 0; i < nworkers; i++)
1102  pfree(pei->reader);
1103  pei->reader = NULL;
1104  }
1105 
1106  /* Now wait for the workers to finish. */
1108 
1109  /*
1110  * Next, accumulate buffer usage. (This must wait for the workers to
1111  * finish, or we might get incomplete data.)
1112  */
1113  for (i = 0; i < nworkers; i++)
1115 
1116  pei->finished = true;
1117 }
1118 
1119 /*
1120  * Accumulate instrumentation, and then clean up whatever ParallelExecutorInfo
1121  * resources still exist after ExecParallelFinish. We separate these
1122  * routines because someone might want to examine the contents of the DSM
1123  * after ExecParallelFinish and before calling this routine.
1124  */
1125 void
1127 {
1128  /* Accumulate instrumentation, if any. */
1129  if (pei->instrumentation)
1131  pei->instrumentation);
1132 
1133  /* Accumulate JIT instrumentation, if any. */
1134  if (pei->jit_instrumentation)
1136  pei->jit_instrumentation);
1137 
1138  /* Free any serialized parameters. */
1139  if (DsaPointerIsValid(pei->param_exec))
1140  {
1141  dsa_free(pei->area, pei->param_exec);
1143  }
1144  if (pei->area != NULL)
1145  {
1146  dsa_detach(pei->area);
1147  pei->area = NULL;
1148  }
1149  if (pei->pcxt != NULL)
1150  {
1152  pei->pcxt = NULL;
1153  }
1154  pfree(pei);
1155 }
1156 
1157 /*
1158  * Create a DestReceiver to write tuples we produce to the shm_mq designated
1159  * for that purpose.
1160  */
1161 static DestReceiver *
1163 {
1164  char *mqspace;
1165  shm_mq *mq;
1166 
1167  mqspace = shm_toc_lookup(toc, PARALLEL_KEY_TUPLE_QUEUE, false);
1169  mq = (shm_mq *) mqspace;
1171  return CreateTupleQueueDestReceiver(shm_mq_attach(mq, seg, NULL));
1172 }
1173 
1174 /*
1175  * Create a QueryDesc for the PlannedStmt we are to execute, and return it.
1176  */
1177 static QueryDesc *
1179  int instrument_options)
1180 {
1181  char *pstmtspace;
1182  char *paramspace;
1183  PlannedStmt *pstmt;
1184  ParamListInfo paramLI;
1185  char *queryString;
1186 
1187  /* Get the query string from shared memory */
1188  queryString = shm_toc_lookup(toc, PARALLEL_KEY_QUERY_TEXT, false);
1189 
1190  /* Reconstruct leader-supplied PlannedStmt. */
1191  pstmtspace = shm_toc_lookup(toc, PARALLEL_KEY_PLANNEDSTMT, false);
1192  pstmt = (PlannedStmt *) stringToNode(pstmtspace);
1193 
1194  /* Reconstruct ParamListInfo. */
1195  paramspace = shm_toc_lookup(toc, PARALLEL_KEY_PARAMLISTINFO, false);
1196  paramLI = RestoreParamList(&paramspace);
1197 
1198  /* Create a QueryDesc for the query. */
1199  return CreateQueryDesc(pstmt,
1200  queryString,
1202  receiver, paramLI, NULL, instrument_options);
1203 }
1204 
1205 /*
1206  * Copy instrumentation information from this node and its descendants into
1207  * dynamic shared memory, so that the parallel leader can retrieve it.
1208  */
1209 static bool
1211  SharedExecutorInstrumentation *instrumentation)
1212 {
1213  int i;
1214  int plan_node_id = planstate->plan->plan_node_id;
1215  Instrumentation *instrument;
1216 
1217  InstrEndLoop(planstate->instrument);
1218 
1219  /*
1220  * If we shuffled the plan_node_id values in ps_instrument into sorted
1221  * order, we could use binary search here. This might matter someday if
1222  * we're pushing down sufficiently large plan trees. For now, do it the
1223  * slow, dumb way.
1224  */
1225  for (i = 0; i < instrumentation->num_plan_nodes; ++i)
1226  if (instrumentation->plan_node_id[i] == plan_node_id)
1227  break;
1228  if (i >= instrumentation->num_plan_nodes)
1229  elog(ERROR, "plan node %d not found", plan_node_id);
1230 
1231  /*
1232  * Add our statistics to the per-node, per-worker totals. It's possible
1233  * that this could happen more than once if we relaunched workers.
1234  */
1235  instrument = GetInstrumentationArray(instrumentation);
1236  instrument += i * instrumentation->num_workers;
1238  Assert(ParallelWorkerNumber < instrumentation->num_workers);
1239  InstrAggNode(&instrument[ParallelWorkerNumber], planstate->instrument);
1240 
1242  instrumentation);
1243 }
1244 
1245 /*
1246  * Initialize the PlanState and its descendants with the information
1247  * retrieved from shared memory. This has to be done once the PlanState
1248  * is allocated and initialized by executor; that is, after ExecutorStart().
1249  */
1250 static bool
1252 {
1253  if (planstate == NULL)
1254  return false;
1255 
1256  switch (nodeTag(planstate))
1257  {
1258  case T_SeqScanState:
1259  if (planstate->plan->parallel_aware)
1260  ExecSeqScanInitializeWorker((SeqScanState *) planstate, pwcxt);
1261  break;
1262  case T_IndexScanState:
1263  if (planstate->plan->parallel_aware)
1265  pwcxt);
1266  break;
1267  case T_IndexOnlyScanState:
1268  if (planstate->plan->parallel_aware)
1270  pwcxt);
1271  break;
1272  case T_ForeignScanState:
1273  if (planstate->plan->parallel_aware)
1275  pwcxt);
1276  break;
1277  case T_AppendState:
1278  if (planstate->plan->parallel_aware)
1279  ExecAppendInitializeWorker((AppendState *) planstate, pwcxt);
1280  break;
1281  case T_CustomScanState:
1282  if (planstate->plan->parallel_aware)
1284  pwcxt);
1285  break;
1286  case T_BitmapHeapScanState:
1287  if (planstate->plan->parallel_aware)
1289  pwcxt);
1290  break;
1291  case T_HashJoinState:
1292  if (planstate->plan->parallel_aware)
1294  pwcxt);
1295  break;
1296  case T_HashState:
1297  /* even when not parallel-aware, for EXPLAIN ANALYZE */
1298  ExecHashInitializeWorker((HashState *) planstate, pwcxt);
1299  break;
1300  case T_SortState:
1301  /* even when not parallel-aware, for EXPLAIN ANALYZE */
1302  ExecSortInitializeWorker((SortState *) planstate, pwcxt);
1303  break;
1304 
1305  default:
1306  break;
1307  }
1308 
1310  pwcxt);
1311 }
1312 
1313 /*
1314  * Main entrypoint for parallel query worker processes.
1315  *
1316  * We reach this function from ParallelWorkerMain, so the setup necessary to
1317  * create a sensible parallel environment has already been done;
1318  * ParallelWorkerMain worries about stuff like the transaction state, combo
1319  * CID mappings, and GUC values, so we don't need to deal with any of that
1320  * here.
1321  *
1322  * Our job is to deal with concerns specific to the executor. The parallel
1323  * group leader will have stored a serialized PlannedStmt, and it's our job
1324  * to execute that plan and write the resulting tuples to the appropriate
1325  * tuple queue. Various bits of supporting information that we need in order
1326  * to do this are also stored in the dsm_segment and can be accessed through
1327  * the shm_toc.
1328  */
1329 void
1331 {
1333  BufferUsage *buffer_usage;
1334  DestReceiver *receiver;
1335  QueryDesc *queryDesc;
1336  SharedExecutorInstrumentation *instrumentation;
1337  SharedJitInstrumentation *jit_instrumentation;
1338  int instrument_options = 0;
1339  void *area_space;
1340  dsa_area *area;
1341  ParallelWorkerContext pwcxt;
1342 
1343  /* Get fixed-size state. */
1344  fpes = shm_toc_lookup(toc, PARALLEL_KEY_EXECUTOR_FIXED, false);
1345 
1346  /* Set up DestReceiver, SharedExecutorInstrumentation, and QueryDesc. */
1347  receiver = ExecParallelGetReceiver(seg, toc);
1348  instrumentation = shm_toc_lookup(toc, PARALLEL_KEY_INSTRUMENTATION, true);
1349  if (instrumentation != NULL)
1350  instrument_options = instrumentation->instrument_options;
1351  jit_instrumentation = shm_toc_lookup(toc, PARALLEL_KEY_JIT_INSTRUMENTATION,
1352  true);
1353  queryDesc = ExecParallelGetQueryDesc(toc, receiver, instrument_options);
1354 
1355  /* Setting debug_query_string for individual workers */
1356  debug_query_string = queryDesc->sourceText;
1357 
1358  /* Report workers' query for monitoring purposes */
1360 
1361  /* Attach to the dynamic shared memory area. */
1362  area_space = shm_toc_lookup(toc, PARALLEL_KEY_DSA, false);
1363  area = dsa_attach_in_place(area_space, seg);
1364 
1365  /* Start up the executor */
1366  queryDesc->plannedstmt->jitFlags = fpes->jit_flags;
1367  ExecutorStart(queryDesc, fpes->eflags);
1368 
1369  /* Special executor initialization steps for parallel workers */
1370  queryDesc->planstate->state->es_query_dsa = area;
1371  if (DsaPointerIsValid(fpes->param_exec))
1372  {
1373  char *paramexec_space;
1374 
1375  paramexec_space = dsa_get_address(area, fpes->param_exec);
1376  RestoreParamExecParams(paramexec_space, queryDesc->estate);
1377 
1378  }
1379  pwcxt.toc = toc;
1380  pwcxt.seg = seg;
1381  ExecParallelInitializeWorker(queryDesc->planstate, &pwcxt);
1382 
1383  /* Pass down any tuple bound */
1384  ExecSetTupleBound(fpes->tuples_needed, queryDesc->planstate);
1385 
1386  /*
1387  * Prepare to track buffer usage during query execution.
1388  *
1389  * We do this after starting up the executor to match what happens in the
1390  * leader, which also doesn't count buffer accesses that occur during
1391  * executor startup.
1392  */
1394 
1395  /*
1396  * Run the plan. If we specified a tuple bound, be careful not to demand
1397  * more tuples than that.
1398  */
1399  ExecutorRun(queryDesc,
1401  fpes->tuples_needed < 0 ? (int64) 0 : fpes->tuples_needed,
1402  true);
1403 
1404  /* Shut down the executor */
1405  ExecutorFinish(queryDesc);
1406 
1407  /* Report buffer usage during parallel execution. */
1408  buffer_usage = shm_toc_lookup(toc, PARALLEL_KEY_BUFFER_USAGE, false);
1410 
1411  /* Report instrumentation data if any instrumentation options are set. */
1412  if (instrumentation != NULL)
1414  instrumentation);
1415 
1416  /* Report JIT instrumentation data if any */
1417  if (queryDesc->estate->es_jit && jit_instrumentation != NULL)
1418  {
1419  Assert(ParallelWorkerNumber < jit_instrumentation->num_workers);
1420  jit_instrumentation->jit_instr[ParallelWorkerNumber] =
1421  queryDesc->estate->es_jit->instr;
1422  }
1423 
1424  /* Must do this after capturing instrumentation. */
1425  ExecutorEnd(queryDesc);
1426 
1427  /* Cleanup. */
1428  dsa_detach(area);
1429  FreeQueryDesc(queryDesc);
1430  receiver->rDestroy(receiver);
1431 }
void ExecForeignScanInitializeWorker(ForeignScanState *node, ParallelWorkerContext *pwcxt)
signed short int16
Definition: c.h:345
bool dependsOnRole
Definition: plannodes.h:58
List * paramExecTypes
Definition: plannodes.h:88
#define NIL
Definition: pg_list.h:65
void ExecIndexScanInitializeDSM(IndexScanState *node, ParallelContext *pcxt)
struct dsa_area * es_query_dsa
Definition: execnodes.h:584
void ExecSetParamPlanMulti(const Bitmapset *params, ExprContext *econtext)
Definition: nodeSubplan.c:1246
void * execPlan
Definition: params.h:147
ParallelContext * pcxt
Definition: execParallel.h:27
void DestroyTupleQueueReader(TupleQueueReader *reader)
Definition: tqueue.c:155
void ExecAppendInitializeWorker(AppendState *node, ParallelWorkerContext *pwcxt)
Definition: nodeAppend.c:443
#define PGJIT_NONE
Definition: jit.h:19
WorkerInstrumentation * worker_instrument
Definition: execnodes.h:951
struct ExecParallelEstimateContext ExecParallelEstimateContext
int plan_node_id[FLEXIBLE_ARRAY_MEMBER]
Definition: execParallel.c:101
EState * estate
Definition: execdesc.h:48
void ExecCustomScanInitializeWorker(CustomScanState *node, ParallelWorkerContext *pwcxt)
Definition: nodeCustom.c:207
Instrumentation * instrument
Definition: execnodes.h:950
#define InvalidDsaPointer
Definition: dsa.h:78
ParallelContext * CreateParallelContext(const char *library_name, const char *function_name, int nworkers)
Definition: parallel.c:159
struct JitContext * es_jit
Definition: execnodes.h:596
void ExecSortEstimate(SortState *node, ParallelContext *pcxt)
Definition: nodeSort.c:356
void ExecParallelFinish(ParallelExecutorInfo *pei)
#define PARALLEL_KEY_TUPLE_QUEUE
Definition: execParallel.c:60
void ExecCustomScanReInitializeDSM(CustomScanState *node, ParallelContext *pcxt)
Definition: nodeCustom.c:192
void FreeQueryDesc(QueryDesc *qdesc)
Definition: pquery.c:105
void pgstat_report_activity(BackendState state, const char *cmd_str)
Definition: pgstat.c:3121
void shm_mq_detach(shm_mq_handle *mqh)
Definition: shm_mq.c:793
PGPROC * MyProc
Definition: proc.c:68
void InstrAggNode(Instrumentation *dst, Instrumentation *add)
Definition: instrument.c:139
struct SharedJitInstrumentation * jit_instrumentation
Definition: execParallel.h:30
dsm_segment * seg
Definition: parallel.h:42
static bool ExecParallelReportInstrumentation(PlanState *planstate, SharedExecutorInstrumentation *instrumentation)
void ExecAppendReInitializeDSM(AppendState *node, ParallelContext *pcxt)
Definition: nodeAppend.c:427
List * relationOids
Definition: plannodes.h:84
shm_toc_estimator estimator
Definition: parallel.h:41
void ExecHashJoinReInitializeDSM(HashJoinState *state, ParallelContext *cxt)
struct JitInstrumentation * es_jit_worker_instr
Definition: execnodes.h:597
void ExecSortInitializeWorker(SortState *node, ParallelWorkerContext *pwcxt)
Definition: nodeSort.c:402
int bms_next_member(const Bitmapset *a, int prevbit)
Definition: bitmapset.c:1043
void ExecutorStart(QueryDesc *queryDesc, int eflags)
Definition: execMain.c:143
dsa_area * dsa_attach_in_place(void *place, dsm_segment *segment)
Definition: dsa.c:541
int plan_node_id
Definition: plannodes.h:139
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
Definition: palloc.h:109
Snapshot GetActiveSnapshot(void)
Definition: snapmgr.c:841
PlannedStmt * es_plannedstmt
Definition: execnodes.h:511
PlanState * planstate
Definition: execParallel.h:26
void InstrEndParallelQuery(BufferUsage *result)
Definition: instrument.c:174
void * stringToNode(const char *str)
Definition: read.c:89
size_t dsa_minimum_size(void)
Definition: dsa.c:1169
static char * ExecSerializePlan(Plan *plan, EState *estate)
Definition: execParallel.c:143
void ExecIndexScanReInitializeDSM(IndexScanState *node, ParallelContext *pcxt)
static shm_mq_handle ** ExecParallelSetupTupleQueues(ParallelContext *pcxt, bool reinitialize)
Definition: execParallel.c:509
EState * state
Definition: execnodes.h:942
void ExecIndexScanInitializeWorker(IndexScanState *node, ParallelWorkerContext *pwcxt)
void ExecHashRetrieveInstrumentation(HashState *node)
Definition: nodeHash.c:2642
List * es_range_table
Definition: execnodes.h:505
unsigned int Oid
Definition: postgres_ext.h:31
#define shm_toc_estimate_chunk(e, sz)
Definition: shm_toc.h:51
bool transientPlan
Definition: plannodes.h:56
Size EstimateParamListSpace(ParamListInfo paramLI)
Definition: params.c:103
#define OidIsValid(objectId)
Definition: c.h:638
JitInstrumentation jit_instr[FLEXIBLE_ARRAY_MEMBER]
Definition: jit.h:51
int stmt_len
Definition: plannodes.h:94
static bool ExecParallelReInitializeDSM(PlanState *planstate, ParallelContext *pcxt)
Definition: execParallel.c:906
uint64 dsa_pointer
Definition: dsa.h:62
static dsa_pointer SerializeParamExecParams(EState *estate, Bitmapset *params, dsa_area *area)
Definition: execParallel.c:339
void ExecSetTupleBound(int64 tuples_needed, PlanState *child_node)
Definition: execProcnode.c:812
struct Plan * planTree
Definition: plannodes.h:64
List * invalItems
Definition: plannodes.h:86
JitInstrumentation instr
Definition: jit.h:61
void ExecForeignScanReInitializeDSM(ForeignScanState *node, ParallelContext *pcxt)
static Oid list_nth_oid(const List *list, int n)
Definition: pg_list.h:299
void InstrEndLoop(Instrumentation *instr)
Definition: instrument.c:110
SharedExecutorInstrumentation * instrumentation
Definition: execParallel.c:119
void ExecutorEnd(QueryDesc *queryDesc)
Definition: execMain.c:462
void * dsa_get_address(dsa_area *area, dsa_pointer dp)
Definition: dsa.c:932
ParallelContext * pcxt
Definition: execParallel.c:111
#define GetPerTupleExprContext(estate)
Definition: executor.h:501
void WaitForParallelWorkersToFinish(ParallelContext *pcxt)
Definition: parallel.c:717
#define PARALLEL_KEY_INSTRUMENTATION
Definition: execParallel.c:61
void DestroyParallelContext(ParallelContext *pcxt)
Definition: parallel.c:871
const char * es_sourceText
Definition: execnodes.h:512
void ExecSortInitializeDSM(SortState *node, ParallelContext *pcxt)
Definition: nodeSort.c:377
ParallelWorkerInfo * worker
Definition: parallel.h:45
ParamExecData * es_param_exec_vals
Definition: execnodes.h:545
void pfree(void *pointer)
Definition: mcxt.c:1031
MemoryContext es_query_cxt
Definition: execnodes.h:550
void ExecSeqScanInitializeDSM(SeqScanState *node, ParallelContext *pcxt)
Definition: nodeSeqscan.c:268
static bool ExecParallelInitializeDSM(PlanState *node, ExecParallelInitializeDSMContext *d)
Definition: execParallel.c:423
bool resjunk
Definition: primnodes.h:1400
#define ERROR
Definition: elog.h:43
PlanState * planstate
Definition: execdesc.h:49
void ParallelQueryMain(dsm_segment *seg, shm_toc *toc)
void ExecBitmapHeapInitializeDSM(BitmapHeapScanState *node, ParallelContext *pcxt)
BufferUsage * buffer_usage
Definition: execParallel.h:28
void ExecutorRun(QueryDesc *queryDesc, ScanDirection direction, uint64 count, bool execute_once)
Definition: execMain.c:301
static bool ExecParallelInitializeWorker(PlanState *planstate, ParallelWorkerContext *pwcxt)
bool isnull
Definition: params.h:149
void ExecIndexOnlyScanEstimate(IndexOnlyScanState *node, ParallelContext *pcxt)
QueryDesc * CreateQueryDesc(PlannedStmt *plannedstmt, const char *sourceText, Snapshot snapshot, Snapshot crosscheck_snapshot, DestReceiver *dest, ParamListInfo params, QueryEnvironment *queryEnv, int instrument_options)
Definition: pquery.c:67
#define PARALLEL_KEY_PARAMLISTINFO
Definition: execParallel.c:58
shm_mq * shm_mq_create(void *address, Size size)
Definition: shm_mq.c:169
#define lfirst_node(type, lc)
Definition: pg_list.h:193
int bms_num_members(const Bitmapset *a)
Definition: bitmapset.c:646
void ExecParallelCreateReaders(ParallelExecutorInfo *pei)
Definition: execParallel.c:831
#define PARALLEL_KEY_PLANNEDSTMT
Definition: execParallel.c:57
ParamListInfo RestoreParamList(char **start_address)
Definition: params.c:226
int stmt_location
Definition: plannodes.h:93
int es_jit_flags
Definition: execnodes.h:595
static bool ExecParallelRetrieveInstrumentation(PlanState *planstate, SharedExecutorInstrumentation *instrumentation)
Definition: execParallel.c:973
bool hasReturning
Definition: plannodes.h:50
struct TupleQueueReader ** reader
Definition: execParallel.h:36
struct ExecParallelInitializeDSMContext ExecParallelInitializeDSMContext
void dsa_detach(dsa_area *area)
Definition: dsa.c:1913
Node * utilityStmt
Definition: plannodes.h:90
int ParallelWorkerNumber
Definition: parallel.c:110
BackgroundWorkerHandle * bgwhandle
Definition: parallel.h:27
bool parallel_aware
Definition: plannodes.h:133
#define PARALLEL_TUPLE_QUEUE_SIZE
Definition: execParallel.c:66
void InstrAccumParallelQuery(BufferUsage *result)
Definition: instrument.c:182
int jitFlags
Definition: plannodes.h:62
int es_instrument
Definition: execnodes.h:557
static Size EstimateParamExecSpace(EState *estate, Bitmapset *params)
Definition: execParallel.c:295
int nworkers_launched
Definition: parallel.h:37
void ExecHashInitializeDSM(HashState *node, ParallelContext *pcxt)
Definition: nodeHash.c:2589
#define PARALLEL_KEY_EXECUTOR_FIXED
Definition: execParallel.c:56
static bool ExecParallelEstimate(PlanState *node, ExecParallelEstimateContext *e)
Definition: execParallel.c:225
dsa_area * dsa_create_in_place(void *place, size_t size, int tranche_id, dsm_segment *segment)
Definition: dsa.c:469
void shm_mq_set_sender(shm_mq *mq, PGPROC *proc)
Definition: shm_mq.c:216
#define PARALLEL_KEY_BUFFER_USAGE
Definition: execParallel.c:59
#define IsParallelWorker()
Definition: parallel.h:60
struct SharedJitInstrumentation * worker_jit_instrument
Definition: execnodes.h:954
void ExecutorFinish(QueryDesc *queryDesc)
Definition: execMain.c:402
void ExecBitmapHeapReInitializeDSM(BitmapHeapScanState *node, ParallelContext *pcxt)
List * lappend(List *list, void *datum)
Definition: list.c:321
#define PARALLEL_KEY_JIT_INSTRUMENTATION
Definition: execParallel.c:64
Size datumEstimateSpace(Datum value, bool isnull, bool typByVal, int typLen)
Definition: datum.c:319
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
const char * debug_query_string
Definition: postgres.c:87
void InitializeParallelDSM(ParallelContext *pcxt)
Definition: parallel.c:196
void ExecHashJoinEstimate(HashJoinState *state, ParallelContext *pcxt)
#define InvalidSnapshot
Definition: snapshot.h:123
TupleQueueReader * CreateTupleQueueReader(shm_mq_handle *handle)
Definition: tqueue.c:139
void InstrStartParallelQuery(void)
Definition: instrument.c:167
void InstrInit(Instrumentation *instr, int instrument_options)
Definition: instrument.c:54
static void ExecParallelRetrieveJitInstrumentation(PlanState *planstate, SharedJitInstrumentation *shared_jit)
Size mul_size(Size s1, Size s2)
Definition: shmem.c:492
bool canSetTag
Definition: plannodes.h:54
Instrumentation instrument[FLEXIBLE_ARRAY_MEMBER]
Definition: instrument.h:70
void * palloc0(Size size)
Definition: mcxt.c:955
uintptr_t Datum
Definition: postgres.h:367
CmdType commandType
Definition: plannodes.h:46
Datum datumRestore(char **start_address, bool *isnull)
Definition: datum.c:428
void ExecHashEstimate(HashState *node, ParallelContext *pcxt)
Definition: nodeHash.c:2570
Size add_size(Size s1, Size s2)
Definition: shmem.c:475
void InstrJitAgg(JitInstrumentation *dst, JitInstrumentation *add)
Definition: jit.c:187
void ExecForeignScanInitializeDSM(ForeignScanState *node, ParallelContext *pcxt)
void ReinitializeParallelDSM(ParallelContext *pcxt)
Definition: parallel.c:447
void ExecHashJoinInitializeWorker(HashJoinState *state, ParallelWorkerContext *pwcxt)
void shm_mq_set_handle(shm_mq_handle *mqh, BackgroundWorkerHandle *handle)
Definition: shm_mq.c:310
List * rowMarks
Definition: plannodes.h:82
void * MemoryContextAllocZero(MemoryContext context, Size size)
Definition: mcxt.c:814
Plan * plan
Definition: execnodes.h:940
void ExecCustomScanInitializeDSM(CustomScanState *node, ParallelContext *pcxt)
Definition: nodeCustom.c:176
void ExecAppendInitializeDSM(AppendState *node, ParallelContext *pcxt)
Definition: nodeAppend.c:406
void(* rDestroy)(DestReceiver *self)
Definition: dest.h:126
void ExecAppendEstimate(AppendState *node, ParallelContext *pcxt)
Definition: nodeAppend.c:387
#define makeNode(_type_)
Definition: nodes.h:573
void ExecParallelCleanup(ParallelExecutorInfo *pei)
List * subplans
Definition: plannodes.h:77
void SerializeParamList(ParamListInfo paramLI, char **start_address)
Definition: params.c:163
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190
Bitmapset * rewindPlanIDs
Definition: plannodes.h:80
bool hasModifyingCTE
Definition: plannodes.h:52
struct FixedParallelExecutorState FixedParallelExecutorState
void ExecForeignScanEstimate(ForeignScanState *node, ParallelContext *pcxt)
size_t Size
Definition: c.h:466
void ExecSeqScanEstimate(SeqScanState *node, ParallelContext *pcxt)
Definition: nodeSeqscan.c:250
#define shm_toc_estimate_keys(e, cnt)
Definition: shm_toc.h:53
void get_typlenbyval(Oid typid, int16 *typlen, bool *typbyval)
Definition: lsyscache.c:2029
#define MAXALIGN(LEN)
Definition: c.h:685
void ExecParallelReinitialize(PlanState *planstate, ParallelExecutorInfo *pei, Bitmapset *sendParams)
Definition: execParallel.c:857
List * rtable
Definition: plannodes.h:66
void * shm_toc_allocate(shm_toc *toc, Size nbytes)
Definition: shm_toc.c:88
void ExecIndexOnlyScanInitializeWorker(IndexOnlyScanState *node, ParallelWorkerContext *pwcxt)
void ExecIndexOnlyScanReInitializeDSM(IndexOnlyScanState *node, ParallelContext *pcxt)
#define nodeTag(nodeptr)
Definition: nodes.h:530
shm_mq_handle * shm_mq_attach(shm_mq *mq, dsm_segment *seg, BackgroundWorkerHandle *handle)
Definition: shm_mq.c:282
List * targetlist
Definition: plannodes.h:140
dsa_pointer param_exec
Definition: execParallel.h:32
const char * sourceText
Definition: execdesc.h:38
#define DsaPointerIsValid(x)
Definition: dsa.h:81
#define PARALLEL_KEY_DSA
Definition: execParallel.c:62
void ExecSeqScanReInitializeDSM(SeqScanState *node, ParallelContext *pcxt)
Definition: nodeSeqscan.c:290
void ExecHashJoinInitializeDSM(HashJoinState *state, ParallelContext *pcxt)
e
Definition: preproc-init.c:82
void ExecHashInitializeWorker(HashState *node, ParallelWorkerContext *pwcxt)
Definition: nodeHash.c:2611
Definition: dsa.c:354
void dsa_free(dsa_area *area, dsa_pointer dp)
Definition: dsa.c:820
struct JitInstrumentation JitInstrumentation
void shm_toc_insert(shm_toc *toc, uint64 key, void *address)
Definition: shm_toc.c:171
void * palloc(Size size)
Definition: mcxt.c:924
uint64 queryId
Definition: plannodes.h:48
int es_top_eflags
Definition: execnodes.h:556
List * resultRelations
Definition: plannodes.h:69
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:771
bool parallelModeNeeded
Definition: plannodes.h:60
#define elog(elevel,...)
Definition: elog.h:226
void ExecBitmapHeapEstimate(BitmapHeapScanState *node, ParallelContext *pcxt)
int i
#define PARALLEL_KEY_QUERY_TEXT
Definition: execParallel.c:63
void datumSerialize(Datum value, bool isnull, bool typByVal, int typLen, char **start_address)
Definition: datum.c:366
Definition: shm_mq.c:70
Datum value
Definition: params.h:148
char * nodeToString(const void *obj)
Definition: outfuncs.c:4316
void ExecCustomScanEstimate(CustomScanState *node, ParallelContext *pcxt)
Definition: nodeCustom.c:163
ParamListInfo es_param_list_info
Definition: execnodes.h:544
void ExecIndexOnlyScanInitializeDSM(IndexOnlyScanState *node, ParallelContext *pcxt)
bool parallel_safe
Definition: plannodes.h:134
shm_mq_handle ** tqueue
Definition: execParallel.h:35
ParallelExecutorInfo * ExecInitParallelPlan(PlanState *planstate, EState *estate, Bitmapset *sendParams, int nworkers, int64 tuples_needed)
Definition: execParallel.c:561
static DestReceiver * ExecParallelGetReceiver(dsm_segment *seg, shm_toc *toc)
void shm_mq_set_receiver(shm_mq *mq, PGPROC *proc)
Definition: shm_mq.c:198
static void RestoreParamExecParams(char *start_address, EState *estate)
Definition: execParallel.c:394
void ExecSortRetrieveInstrumentation(SortState *node)
Definition: nodeSort.c:416
DestReceiver * CreateTupleQueueDestReceiver(shm_mq_handle *handle)
Definition: tqueue.c:119
PlannedStmt * plannedstmt
Definition: execdesc.h:37
#define copyObject(obj)
Definition: nodes.h:641
void ExecBitmapHeapInitializeWorker(BitmapHeapScanState *node, ParallelWorkerContext *pwcxt)
void ExecIndexScanEstimate(IndexScanState *node, ParallelContext *pcxt)
SharedExecutorInstrumentation * instrumentation
Definition: execParallel.h:29
void ExecSeqScanInitializeWorker(SeqScanState *node, ParallelWorkerContext *pwcxt)
Definition: nodeSeqscan.c:306
bool planstate_tree_walker(PlanState *planstate, bool(*walker)(), void *context)
Definition: nodeFuncs.c:3762
void * shm_toc_lookup(shm_toc *toc, uint64 key, bool noError)
Definition: shm_toc.c:232
static QueryDesc * ExecParallelGetQueryDesc(shm_toc *toc, DestReceiver *receiver, int instrument_options)
dsm_segment * seg
Definition: parallel.h:52
#define offsetof(type, field)
Definition: c.h:655
#define GetInstrumentationArray(sei)
Definition: execParallel.c:104
shm_toc * toc
Definition: parallel.h:44
#define dsa_allocate(area, size)
Definition: dsa.h:84