PostgreSQL Source Code git master
Loading...
Searching...
No Matches
nodeGatherMerge.h File Reference
#include "nodes/execnodes.h"
Include dependency graph for nodeGatherMerge.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions

GatherMergeStateExecInitGatherMerge (GatherMerge *node, EState *estate, int eflags)
 
void ExecEndGatherMerge (GatherMergeState *node)
 
void ExecReScanGatherMerge (GatherMergeState *node)
 
void ExecShutdownGatherMerge (GatherMergeState *node)
 

Function Documentation

◆ ExecEndGatherMerge()

void ExecEndGatherMerge ( GatherMergeState node)
extern

Definition at line 291 of file nodeGatherMerge.c.

292{
293 ExecEndNode(outerPlanState(node)); /* let children clean up first */
295}
void ExecEndNode(PlanState *node)
#define outerPlanState(node)
Definition execnodes.h:1263
void ExecShutdownGatherMerge(GatherMergeState *node)

References ExecEndNode(), ExecShutdownGatherMerge(), and outerPlanState.

Referenced by ExecEndNode().

◆ ExecInitGatherMerge()

GatherMergeState * ExecInitGatherMerge ( GatherMerge node,
EState estate,
int  eflags 
)
extern

Definition at line 68 of file nodeGatherMerge.c.

69{
72 TupleDesc tupDesc;
73
74 /* Gather merge node doesn't have innerPlan node. */
75 Assert(innerPlan(node) == NULL);
76
77 /*
78 * create state structure
79 */
81 gm_state->ps.plan = (Plan *) node;
82 gm_state->ps.state = estate;
83 gm_state->ps.ExecProcNode = ExecGatherMerge;
84
85 gm_state->initialized = false;
86 gm_state->gm_initialized = false;
87 gm_state->tuples_needed = -1;
88
89 /*
90 * Miscellaneous initialization
91 *
92 * create expression context for node
93 */
94 ExecAssignExprContext(estate, &gm_state->ps);
95
96 /*
97 * GatherMerge doesn't support checking a qual (it's always more efficient
98 * to do it in the child node).
99 */
100 Assert(!node->plan.qual);
101
102 /*
103 * now initialize outer plan
104 */
105 outerNode = outerPlan(node);
106 outerPlanState(gm_state) = ExecInitNode(outerNode, estate, eflags);
107
108 /*
109 * Leader may access ExecProcNode result directly (if
110 * need_to_scan_locally), or from workers via tuple queue. So we can't
111 * trivially rely on the slot type being fixed for expressions evaluated
112 * within this node.
113 */
114 gm_state->ps.outeropsset = true;
115 gm_state->ps.outeropsfixed = false;
116
117 /*
118 * Store the tuple descriptor into gather merge state, so we can use it
119 * while initializing the gather merge slots.
120 */
122 gm_state->tupDesc = tupDesc;
123
124 /*
125 * Initialize result type and projection.
126 */
129
130 /*
131 * Without projections result slot type is not trivially known, see
132 * comment above.
133 */
134 if (gm_state->ps.ps_ProjInfo == NULL)
135 {
136 gm_state->ps.resultopsset = true;
137 gm_state->ps.resultopsfixed = false;
138 }
139
140 /*
141 * initialize sort-key information
142 */
143 if (node->numCols)
144 {
145 int i;
146
147 gm_state->gm_nkeys = node->numCols;
148 gm_state->gm_sortkeys = palloc0_array(SortSupportData, node->numCols);
149
150 for (i = 0; i < node->numCols; i++)
151 {
152 SortSupport sortKey = gm_state->gm_sortkeys + i;
153
155 sortKey->ssup_collation = node->collations[i];
156 sortKey->ssup_nulls_first = node->nullsFirst[i];
157 sortKey->ssup_attno = node->sortColIdx[i];
158
159 /*
160 * We don't perform abbreviated key conversion here, for the same
161 * reasons that it isn't used in MergeAppend
162 */
163 sortKey->abbreviate = false;
164
165 PrepareSortSupportFromOrderingOp(node->sortOperators[i], sortKey);
166 }
167 }
168
169 /* Now allocate the workspace for gather merge */
171
172 return gm_state;
173}
#define Assert(condition)
Definition c.h:873
PlanState * ExecInitNode(Plan *node, EState *estate, int eflags)
void ExecInitResultTypeTL(PlanState *planstate)
TupleDesc ExecGetResultType(PlanState *planstate)
Definition execUtils.c:495
void ExecAssignExprContext(EState *estate, PlanState *planstate)
Definition execUtils.c:485
void ExecConditionalAssignProjectionInfo(PlanState *planstate, TupleDesc inputDesc, int varno)
Definition execUtils.c:603
#define palloc0_array(type, count)
Definition fe_memutils.h:77
int i
Definition isn.c:77
MemoryContext CurrentMemoryContext
Definition mcxt.c:160
static void gather_merge_setup(GatherMergeState *gm_state)
static TupleTableSlot * ExecGatherMerge(PlanState *pstate)
#define makeNode(_type_)
Definition nodes.h:161
#define innerPlan(node)
Definition plannodes.h:260
#define outerPlan(node)
Definition plannodes.h:261
static int fb(int x)
#define OUTER_VAR
Definition primnodes.h:243
void PrepareSortSupportFromOrderingOp(Oid orderingOp, SortSupport ssup)
List * qual
Definition plannodes.h:231
MemoryContext ssup_cxt
Definition sortsupport.h:66

References Assert, CurrentMemoryContext, ExecAssignExprContext(), ExecConditionalAssignProjectionInfo(), ExecGatherMerge(), ExecGetResultType(), ExecInitNode(), ExecInitResultTypeTL(), fb(), gather_merge_setup(), i, innerPlan, makeNode, GatherMerge::numCols, OUTER_VAR, outerPlan, outerPlanState, palloc0_array, GatherMerge::plan, PrepareSortSupportFromOrderingOp(), Plan::qual, and SortSupportData::ssup_cxt.

Referenced by ExecInitNode().

◆ ExecReScanGatherMerge()

void ExecReScanGatherMerge ( GatherMergeState node)
extern

Definition at line 341 of file nodeGatherMerge.c.

342{
343 GatherMerge *gm = (GatherMerge *) node->ps.plan;
345
346 /* Make sure any existing workers are gracefully shut down */
348
349 /* Free any unused tuples, so we don't leak memory across rescans */
351
352 /* Mark node so that shared state will be rebuilt at next call */
353 node->initialized = false;
354 node->gm_initialized = false;
355
356 /*
357 * Set child node's chgParam to tell it that the next scan might deliver a
358 * different set of rows within the leader process. (The overall rowset
359 * shouldn't change, but the leader process's subset might; hence nodes
360 * between here and the parallel table scan node mustn't optimize on the
361 * assumption of an unchanging rowset.)
362 */
363 if (gm->rescan_param >= 0)
364 outerPlan->chgParam = bms_add_member(outerPlan->chgParam,
365 gm->rescan_param);
366
367 /*
368 * If chgParam of subnode is not null then plan will be re-scanned by
369 * first ExecProcNode. Note: because this does nothing if we have a
370 * rescan_param, it's currently guaranteed that parallel-aware child nodes
371 * will not see a ReScan call until after they get a ReInitializeDSM call.
372 * That ordering might not be something to rely on, though. A good rule
373 * of thumb is that ReInitializeDSM should reset only shared state, ReScan
374 * should reset only local state, and anything that depends on both of
375 * those steps being finished must wait until the first ExecProcNode call.
376 */
377 if (outerPlan->chgParam == NULL)
379}
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition bitmapset.c:814
void ExecReScan(PlanState *node)
Definition execAmi.c:77
static void gather_merge_clear_tuples(GatherMergeState *gm_state)
static void ExecShutdownGatherMergeWorkers(GatherMergeState *node)
Plan * plan
Definition execnodes.h:1167

References bms_add_member(), ExecReScan(), ExecShutdownGatherMergeWorkers(), fb(), gather_merge_clear_tuples(), GatherMergeState::gm_initialized, GatherMergeState::initialized, outerPlan, outerPlanState, PlanState::plan, and GatherMergeState::ps.

Referenced by ExecReScan().

◆ ExecShutdownGatherMerge()

void ExecShutdownGatherMerge ( GatherMergeState node)
extern

Definition at line 304 of file nodeGatherMerge.c.

305{
307
308 /* Now destroy the parallel context. */
309 if (node->pei != NULL)
310 {
312 node->pei = NULL;
313 }
314}
void ExecParallelCleanup(ParallelExecutorInfo *pei)
struct ParallelExecutorInfo * pei
Definition execnodes.h:2664

References ExecParallelCleanup(), ExecShutdownGatherMergeWorkers(), fb(), and GatherMergeState::pei.

Referenced by ExecEndGatherMerge(), and ExecShutdownNode_walker().