PostgreSQL Source Code git master
Loading...
Searching...
No Matches
nodeBitmapIndexscan.c
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 *
3 * nodeBitmapIndexscan.c
4 * Routines to support bitmapped index scans of relations
5 *
6 * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
7 * Portions Copyright (c) 1994, Regents of the University of California
8 *
9 *
10 * IDENTIFICATION
11 * src/backend/executor/nodeBitmapIndexscan.c
12 *
13 *-------------------------------------------------------------------------
14 */
15/*
16 * INTERFACE ROUTINES
17 * MultiExecBitmapIndexScan scans a relation using index.
18 * ExecInitBitmapIndexScan creates and initializes state info.
19 * ExecReScanBitmapIndexScan prepares to rescan the plan.
20 * ExecEndBitmapIndexScan releases all storage.
21 */
22#include "postgres.h"
23
24#include "access/genam.h"
25#include "executor/executor.h"
26#include "executor/instrument.h"
29#include "miscadmin.h"
30#include "nodes/tidbitmap.h"
31
32
33/* ----------------------------------------------------------------
34 * ExecBitmapIndexScan
35 *
36 * stub for pro forma compliance
37 * ----------------------------------------------------------------
38 */
39static TupleTableSlot *
41{
42 elog(ERROR, "BitmapIndexScan node does not support ExecProcNode call convention");
43 return NULL;
44}
45
46/* ----------------------------------------------------------------
47 * MultiExecBitmapIndexScan(node)
48 * ----------------------------------------------------------------
49 */
50Node *
52{
53 TIDBitmap *tbm;
54 IndexScanDesc scandesc;
55 double nTuples = 0;
56 bool doscan;
57
58 /* must provide our own instrumentation support */
59 if (node->ss.ps.instrument)
61
62 /*
63 * extract necessary information from index scan node
64 */
65 scandesc = node->biss_ScanDesc;
66
67 /*
68 * If we have runtime keys and they've not already been set up, do it now.
69 * Array keys are also treated as runtime keys; note that if ExecReScan
70 * returns with biss_RuntimeKeysReady still false, then there is an empty
71 * array key so we should do nothing.
72 */
73 if (!node->biss_RuntimeKeysReady &&
74 (node->biss_NumRuntimeKeys != 0 || node->biss_NumArrayKeys != 0))
75 {
76 ExecReScan((PlanState *) node);
77 doscan = node->biss_RuntimeKeysReady;
78 }
79 else
80 doscan = true;
81
82 /*
83 * Prepare the result bitmap. Normally we just create a new one to pass
84 * back; however, our parent node is allowed to store a pre-made one into
85 * node->biss_result, in which case we just OR our tuple IDs into the
86 * existing bitmap. (This saves needing explicit UNION steps.)
87 */
88 if (node->biss_result)
89 {
90 tbm = node->biss_result;
91 node->biss_result = NULL; /* reset for next time */
92 }
93 else
94 {
95 /* XXX should we use less than work_mem for this? */
96 tbm = tbm_create(work_mem * (Size) 1024,
97 ((BitmapIndexScan *) node->ss.ps.plan)->isshared ?
98 node->ss.ps.state->es_query_dsa : NULL);
99 }
100
101 /*
102 * Get TIDs from index and insert into bitmap
103 */
104 while (doscan)
105 {
106 nTuples += (double) index_getbitmap(scandesc, tbm);
107
109
111 node->biss_NumArrayKeys);
112 if (doscan) /* reset index scan */
114 node->biss_ScanKeys, node->biss_NumScanKeys,
115 NULL, 0);
116 }
117
118 /* must provide our own instrumentation support */
119 if (node->ss.ps.instrument)
120 InstrStopNode(node->ss.ps.instrument, nTuples);
121
122 return (Node *) tbm;
123}
124
125/* ----------------------------------------------------------------
126 * ExecReScanBitmapIndexScan(node)
127 *
128 * Recalculates the values of any scan keys whose value depends on
129 * information known at runtime, then rescans the indexed relation.
130 * ----------------------------------------------------------------
131 */
132void
134{
135 ExprContext *econtext = node->biss_RuntimeContext;
136
137 /*
138 * Reset the runtime-key context so we don't leak memory as each outer
139 * tuple is scanned. Note this assumes that we will recalculate *all*
140 * runtime keys on each call.
141 */
142 if (econtext)
143 ResetExprContext(econtext);
144
145 /*
146 * If we are doing runtime key calculations (ie, any of the index key
147 * values weren't simple Consts), compute the new key values.
148 *
149 * Array keys are also treated as runtime keys; note that if we return
150 * with biss_RuntimeKeysReady still false, then there is an empty array
151 * key so no index scan is needed.
152 */
153 if (node->biss_NumRuntimeKeys != 0)
155 node->biss_RuntimeKeys,
156 node->biss_NumRuntimeKeys);
157 if (node->biss_NumArrayKeys != 0)
159 ExecIndexEvalArrayKeys(econtext,
160 node->biss_ArrayKeys,
161 node->biss_NumArrayKeys);
162 else
163 node->biss_RuntimeKeysReady = true;
164
165 /* reset index scan */
166 if (node->biss_RuntimeKeysReady)
168 node->biss_ScanKeys, node->biss_NumScanKeys,
169 NULL, 0);
170}
171
172/* ----------------------------------------------------------------
173 * ExecEndBitmapIndexScan
174 * ----------------------------------------------------------------
175 */
176void
178{
181
182 /*
183 * extract information from the node
184 */
187
188 /*
189 * When ending a parallel worker, copy the statistics gathered by the
190 * worker back into shared memory so that it can be picked up by the main
191 * process to report in EXPLAIN ANALYZE
192 */
193 if (node->biss_SharedInfo != NULL && IsParallelWorker())
194 {
195 IndexScanInstrumentation *winstrument;
196
197 Assert(ParallelWorkerNumber < node->biss_SharedInfo->num_workers);
198 winstrument = &node->biss_SharedInfo->winstrument[ParallelWorkerNumber];
199
200 /*
201 * We have to accumulate the stats rather than performing a memcpy.
202 * When a Gather/GatherMerge node finishes it will perform planner
203 * shutdown on the workers. On rescan it will spin up new workers
204 * which will have a new BitmapIndexScanState and zeroed stats.
205 */
206 winstrument->nsearches += node->biss_Instrument->nsearches;
207 }
208
209 /*
210 * close the index relation (no-op if we didn't open it)
211 */
212 if (indexScanDesc)
216}
217
218/* ----------------------------------------------------------------
219 * ExecInitBitmapIndexScan
220 *
221 * Initializes the index scan's state information.
222 * ----------------------------------------------------------------
223 */
226{
228 LOCKMODE lockmode;
229
230 /* check for unsupported flags */
232
233 /*
234 * create state structure
235 */
237 indexstate->ss.ps.plan = (Plan *) node;
238 indexstate->ss.ps.state = estate;
239 indexstate->ss.ps.ExecProcNode = ExecBitmapIndexScan;
240
241 /* normally we don't make the result bitmap till runtime */
242 indexstate->biss_result = NULL;
243
244 /*
245 * We do not open or lock the base relation here. We assume that an
246 * ancestor BitmapHeapScan node is holding AccessShareLock (or better) on
247 * the heap relation throughout the execution of the plan tree.
248 */
249
250 indexstate->ss.ss_currentRelation = NULL;
251 indexstate->ss.ss_currentScanDesc = NULL;
252
253 /*
254 * Miscellaneous initialization
255 *
256 * We do not need a standard exprcontext for this node, though we may
257 * decide below to create a runtime-key exprcontext
258 */
259
260 /*
261 * initialize child expressions
262 *
263 * We don't need to initialize targetlist or qual since neither are used.
264 *
265 * Note: we don't initialize all of the indexqual expression, only the
266 * sub-parts corresponding to runtime keys (see below).
267 */
268
269 /*
270 * If we are just doing EXPLAIN (ie, aren't going to run the plan), stop
271 * here. This allows an index-advisor plugin to EXPLAIN a plan containing
272 * references to nonexistent indexes.
273 */
274 if (eflags & EXEC_FLAG_EXPLAIN_ONLY)
275 return indexstate;
276
277 /* Set up instrumentation of bitmap index scans if requested */
278 if (estate->es_instrument)
280
281 /* Open the index relation. */
282 lockmode = exec_rt_fetch(node->scan.scanrelid, estate)->rellockmode;
283 indexstate->biss_RelationDesc = index_open(node->indexid, lockmode);
284
285 /*
286 * Initialize index-specific scan state
287 */
288 indexstate->biss_RuntimeKeysReady = false;
289 indexstate->biss_RuntimeKeys = NULL;
290 indexstate->biss_NumRuntimeKeys = 0;
291
292 /*
293 * build the index scan keys from the index qualification
294 */
296 indexstate->biss_RelationDesc,
297 node->indexqual,
298 false,
299 &indexstate->biss_ScanKeys,
300 &indexstate->biss_NumScanKeys,
301 &indexstate->biss_RuntimeKeys,
302 &indexstate->biss_NumRuntimeKeys,
303 &indexstate->biss_ArrayKeys,
304 &indexstate->biss_NumArrayKeys);
305
306 /*
307 * If we have runtime keys or array keys, we need an ExprContext to
308 * evaluate them. We could just create a "standard" plan node exprcontext,
309 * but to keep the code looking similar to nodeIndexscan.c, it seems
310 * better to stick with the approach of using a separate ExprContext.
311 */
312 if (indexstate->biss_NumRuntimeKeys != 0 ||
313 indexstate->biss_NumArrayKeys != 0)
314 {
315 ExprContext *stdecontext = indexstate->ss.ps.ps_ExprContext;
316
317 ExecAssignExprContext(estate, &indexstate->ss.ps);
318 indexstate->biss_RuntimeContext = indexstate->ss.ps.ps_ExprContext;
319 indexstate->ss.ps.ps_ExprContext = stdecontext;
320 }
321 else
322 {
323 indexstate->biss_RuntimeContext = NULL;
324 }
325
326 /*
327 * Initialize scan descriptor.
328 */
329 indexstate->biss_ScanDesc =
330 index_beginscan_bitmap(indexstate->biss_RelationDesc,
331 estate->es_snapshot,
332 indexstate->biss_Instrument,
333 indexstate->biss_NumScanKeys);
334
335 /*
336 * If no run-time keys to calculate, go ahead and pass the scankeys to the
337 * index AM.
338 */
339 if (indexstate->biss_NumRuntimeKeys == 0 &&
340 indexstate->biss_NumArrayKeys == 0)
341 index_rescan(indexstate->biss_ScanDesc,
342 indexstate->biss_ScanKeys, indexstate->biss_NumScanKeys,
343 NULL, 0);
344
345 /*
346 * all done.
347 */
348 return indexstate;
349}
350
351/* ----------------------------------------------------------------
352 * ExecBitmapIndexScanEstimate
353 *
354 * Compute the amount of space we'll need in the parallel
355 * query DSM, and inform pcxt->estimator about our needs.
356 * ----------------------------------------------------------------
357 */
358void
360{
361 Size size;
362
363 /*
364 * Parallel bitmap index scans are not supported, but we still need to
365 * store the scan's instrumentation in DSM during parallel query
366 */
367 if (!node->ss.ps.instrument || pcxt->nworkers == 0)
368 return;
369
370 size = offsetof(SharedIndexScanInstrumentation, winstrument) +
371 pcxt->nworkers * sizeof(IndexScanInstrumentation);
372 shm_toc_estimate_chunk(&pcxt->estimator, size);
374}
375
376/* ----------------------------------------------------------------
377 * ExecBitmapIndexScanInitializeDSM
378 *
379 * Set up bitmap index scan shared instrumentation.
380 * ----------------------------------------------------------------
381 */
382void
384 ParallelContext *pcxt)
385{
386 Size size;
387
388 /* don't need this if not instrumenting or no workers */
389 if (!node->ss.ps.instrument || pcxt->nworkers == 0)
390 return;
391
392 size = offsetof(SharedIndexScanInstrumentation, winstrument) +
393 pcxt->nworkers * sizeof(IndexScanInstrumentation);
394 node->biss_SharedInfo =
396 size);
397 shm_toc_insert(pcxt->toc,
398 node->ss.ps.plan->plan_node_id +
400 node->biss_SharedInfo);
401
402 /* Each per-worker area must start out as zeroes */
403 memset(node->biss_SharedInfo, 0, size);
404 node->biss_SharedInfo->num_workers = pcxt->nworkers;
405}
406
407/* ----------------------------------------------------------------
408 * ExecBitmapIndexScanInitializeWorker
409 *
410 * Copy relevant information from TOC into planstate.
411 * ----------------------------------------------------------------
412 */
413void
416{
417 /* don't need this if not instrumenting */
418 if (!node->ss.ps.instrument)
419 return;
420
423 node->ss.ps.plan->plan_node_id +
425 false);
426}
427
428/* ----------------------------------------------------------------
429 * ExecBitmapIndexScanRetrieveInstrumentation
430 *
431 * Transfer bitmap index scan statistics from DSM to private memory.
432 * ----------------------------------------------------------------
433 */
434void
436{
438 size_t size;
439
440 if (SharedInfo == NULL)
441 return;
442
443 /* Create a copy of SharedInfo in backend-local memory */
444 size = offsetof(SharedIndexScanInstrumentation, winstrument) +
446 node->biss_SharedInfo = palloc(size);
447 memcpy(node->biss_SharedInfo, SharedInfo, size);
448}
int ParallelWorkerNumber
Definition parallel.c:117
#define Assert(condition)
Definition c.h:943
size_t Size
Definition c.h:689
memcpy(sums, checksumBaseOffsets, sizeof(checksumBaseOffsets))
#define ERROR
Definition elog.h:40
#define elog(elevel,...)
Definition elog.h:228
void ExecReScan(PlanState *node)
Definition execAmi.c:78
void ExecAssignExprContext(EState *estate, PlanState *planstate)
Definition execUtils.c:490
#define EXEC_FLAG_BACKWARD
Definition executor.h:70
static RangeTblEntry * exec_rt_fetch(Index rti, EState *estate)
Definition executor.h:710
#define ResetExprContext(econtext)
Definition executor.h:661
#define EXEC_FLAG_EXPLAIN_ONLY
Definition executor.h:67
#define EXEC_FLAG_MARK
Definition executor.h:71
#define palloc0_object(type)
Definition fe_memutils.h:75
int work_mem
Definition globals.c:133
#define IsParallelWorker()
Definition parallel.h:62
void index_close(Relation relation, LOCKMODE lockmode)
Definition indexam.c:178
void index_endscan(IndexScanDesc scan)
Definition indexam.c:394
IndexScanDesc index_beginscan_bitmap(Relation indexRelation, Snapshot snapshot, IndexScanInstrumentation *instrument, int nkeys)
Definition indexam.c:301
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition indexam.c:134
int64 index_getbitmap(IndexScanDesc scan, TIDBitmap *bitmap)
Definition indexam.c:743
void index_rescan(IndexScanDesc scan, ScanKey keys, int nkeys, ScanKey orderbys, int norderbys)
Definition indexam.c:368
void InstrStartNode(NodeInstrumentation *instr)
Definition instrument.c:132
void InstrStopNode(NodeInstrumentation *instr, double nTuples)
Definition instrument.c:139
#define PARALLEL_KEY_SCAN_INSTRUMENT_OFFSET
int LOCKMODE
Definition lockdefs.h:26
#define NoLock
Definition lockdefs.h:34
void * palloc(Size size)
Definition mcxt.c:1387
#define CHECK_FOR_INTERRUPTS()
Definition miscadmin.h:125
void ExecBitmapIndexScanEstimate(BitmapIndexScanState *node, ParallelContext *pcxt)
Node * MultiExecBitmapIndexScan(BitmapIndexScanState *node)
void ExecEndBitmapIndexScan(BitmapIndexScanState *node)
void ExecBitmapIndexScanInitializeDSM(BitmapIndexScanState *node, ParallelContext *pcxt)
BitmapIndexScanState * ExecInitBitmapIndexScan(BitmapIndexScan *node, EState *estate, int eflags)
void ExecReScanBitmapIndexScan(BitmapIndexScanState *node)
void ExecBitmapIndexScanRetrieveInstrumentation(BitmapIndexScanState *node)
static TupleTableSlot * ExecBitmapIndexScan(PlanState *pstate)
void ExecBitmapIndexScanInitializeWorker(BitmapIndexScanState *node, ParallelWorkerContext *pwcxt)
void ExecIndexBuildScanKeys(PlanState *planstate, Relation index, List *quals, bool isorderby, ScanKey *scanKeys, int *numScanKeys, IndexRuntimeKeyInfo **runtimeKeys, int *numRuntimeKeys, IndexArrayKeyInfo **arrayKeys, int *numArrayKeys)
bool ExecIndexEvalArrayKeys(ExprContext *econtext, IndexArrayKeyInfo *arrayKeys, int numArrayKeys)
void ExecIndexEvalRuntimeKeys(ExprContext *econtext, IndexRuntimeKeyInfo *runtimeKeys, int numRuntimeKeys)
bool ExecIndexAdvanceArrayKeys(IndexArrayKeyInfo *arrayKeys, int numArrayKeys)
#define makeNode(_type_)
Definition nodes.h:161
static int fb(int x)
void * shm_toc_allocate(shm_toc *toc, Size nbytes)
Definition shm_toc.c:88
void shm_toc_insert(shm_toc *toc, uint64 key, void *address)
Definition shm_toc.c:171
void * shm_toc_lookup(shm_toc *toc, uint64 key, bool noError)
Definition shm_toc.c:239
#define shm_toc_estimate_chunk(e, sz)
Definition shm_toc.h:51
#define shm_toc_estimate_keys(e, cnt)
Definition shm_toc.h:53
ExprContext * biss_RuntimeContext
Definition execnodes.h:1851
IndexArrayKeyInfo * biss_ArrayKeys
Definition execnodes.h:1848
ScanKeyData * biss_ScanKeys
Definition execnodes.h:1844
IndexRuntimeKeyInfo * biss_RuntimeKeys
Definition execnodes.h:1846
SharedIndexScanInstrumentation * biss_SharedInfo
Definition execnodes.h:1855
TIDBitmap * biss_result
Definition execnodes.h:1843
struct IndexScanDescData * biss_ScanDesc
Definition execnodes.h:1853
IndexScanInstrumentation * biss_Instrument
Definition execnodes.h:1854
Relation biss_RelationDesc
Definition execnodes.h:1852
struct dsa_area * es_query_dsa
Definition execnodes.h:788
int es_instrument
Definition execnodes.h:756
Snapshot es_snapshot
Definition execnodes.h:696
Definition nodes.h:135
shm_toc_estimator estimator
Definition parallel.h:43
shm_toc * toc
Definition parallel.h:46
Plan * plan
Definition execnodes.h:1201
EState * state
Definition execnodes.h:1203
NodeInstrumentation * instrument
Definition execnodes.h:1211
int plan_node_id
Definition plannodes.h:233
PlanState ps
Definition execnodes.h:1659
Index scanrelid
Definition plannodes.h:544
IndexScanInstrumentation winstrument[FLEXIBLE_ARRAY_MEMBER]
TIDBitmap * tbm_create(Size maxbytes, dsa_area *dsa)
Definition tidbitmap.c:256