PostgreSQL Source Code git master
Loading...
Searching...
No Matches
nodeBitmapHeapscan.c
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 *
3 * nodeBitmapHeapscan.c
4 * Routines to support bitmapped scans of relations
5 *
6 * NOTE: it is critical that this plan type only be used with MVCC-compliant
7 * snapshots (ie, regular snapshots, not SnapshotAny or one of the other
8 * special snapshots). The reason is that since index and heap scans are
9 * decoupled, there can be no assurance that the index tuple prompting a
10 * visit to a particular heap TID still exists when the visit is made.
11 * Therefore the tuple might not exist anymore either (which is OK because
12 * heap_fetch will cope) --- but worse, the tuple slot could have been
13 * re-used for a newer tuple. With an MVCC snapshot the newer tuple is
14 * certain to fail the time qual and so it will not be mistakenly returned,
15 * but with anything else we might return a tuple that doesn't meet the
16 * required index qual conditions.
17 *
18 *
19 * Portions Copyright (c) 1996-2026, PostgreSQL Global Development Group
20 * Portions Copyright (c) 1994, Regents of the University of California
21 *
22 *
23 * IDENTIFICATION
24 * src/backend/executor/nodeBitmapHeapscan.c
25 *
26 *-------------------------------------------------------------------------
27 */
28/*
29 * INTERFACE ROUTINES
30 * ExecBitmapHeapScan scans a relation using bitmap info
31 * ExecBitmapHeapNext workhorse for above
32 * ExecInitBitmapHeapScan creates and initializes state info.
33 * ExecReScanBitmapHeapScan prepares to rescan the plan.
34 * ExecEndBitmapHeapScan releases all storage.
35 */
36#include "postgres.h"
37
38#include "access/relscan.h"
39#include "access/tableam.h"
41#include "executor/executor.h"
42#include "executor/instrument.h"
44#include "miscadmin.h"
45#include "pgstat.h"
46#include "storage/bufmgr.h"
48#include "utils/dsa.h"
49#include "utils/rel.h"
50#include "utils/spccache.h"
51#include "utils/wait_event.h"
52
57
58
59/* ----------------
60 * SharedBitmapState information
61 *
62 * BM_INITIAL TIDBitmap creation is not yet started, so first worker
63 * to see this state will set the state to BM_INPROGRESS
64 * and that process will be responsible for creating
65 * TIDBitmap.
66 * BM_INPROGRESS TIDBitmap creation is in progress; workers need to
67 * sleep until it's finished.
68 * BM_FINISHED TIDBitmap creation is done, so now all workers can
69 * proceed to iterate over TIDBitmap.
70 * ----------------
71 */
78
79/* ----------------
80 * ParallelBitmapHeapState information
81 * tbmiterator iterator for scanning current pages
82 * mutex mutual exclusion for state
83 * state current state of the TIDBitmap
84 * cv conditional wait variable
85 * ----------------
86 */
94
95
96/*
97 * Do the underlying index scan, build the bitmap, set up the parallel state
98 * needed for parallel workers to iterate through the bitmap, and set up the
99 * underlying table scan descriptor.
100 */
101static void
103{
104 TBMIterator tbmiterator = {0};
105 ParallelBitmapHeapState *pstate = node->pstate;
106 dsa_area *dsa = node->ss.ps.state->es_query_dsa;
107
108 if (!pstate)
109 {
111
112 if (!node->tbm || !IsA(node->tbm, TIDBitmap))
113 elog(ERROR, "unrecognized result from subplan");
114 }
115 else if (BitmapShouldInitializeSharedState(pstate))
116 {
117 /*
118 * The leader will immediately come out of the function, but others
119 * will be blocked until leader populates the TBM and wakes them up.
120 */
122 if (!node->tbm || !IsA(node->tbm, TIDBitmap))
123 elog(ERROR, "unrecognized result from subplan");
124
125 /*
126 * Prepare to iterate over the TBM. This will return the dsa_pointer
127 * of the iterator state which will be used by multiple processes to
128 * iterate jointly.
129 */
131
132 /* We have initialized the shared state so wake up others. */
134 }
135
136 tbmiterator = tbm_begin_iterate(node->tbm, dsa,
137 pstate ?
138 pstate->tbmiterator :
140
141 /*
142 * If this is the first scan of the underlying table, create the table
143 * scan descriptor and begin the scan.
144 */
145 if (!node->ss.ss_currentScanDesc)
146 {
147 uint32 flags = SO_NONE;
148
149 if (ScanRelIsReadOnly(&node->ss))
150 flags |= SO_HINT_REL_READ_ONLY;
151
153 flags |= SO_SCAN_INSTRUMENT;
154
155 node->ss.ss_currentScanDesc =
157 node->ss.ps.state->es_snapshot,
158 0,
159 NULL,
160 flags);
161 }
162
163 node->ss.ss_currentScanDesc->st.rs_tbmiterator = tbmiterator;
164 node->initialized = true;
165}
166
167/* ----------------------------------------------------------------
168 * BitmapHeapNext
169 *
170 * Retrieve next tuple from the BitmapHeapScan node's currentRelation
171 * ----------------------------------------------------------------
172 */
173static TupleTableSlot *
175{
176 ExprContext *econtext = node->ss.ps.ps_ExprContext;
177 TupleTableSlot *slot = node->ss.ss_ScanTupleSlot;
178
179 /*
180 * If we haven't yet performed the underlying index scan, do it, and begin
181 * the iteration over the bitmap.
182 */
183 if (!node->initialized)
185
187 slot, &node->recheck,
188 &node->stats.lossy_pages,
189 &node->stats.exact_pages))
190 {
191 /*
192 * Continuing in previously obtained page.
193 */
195
196 /*
197 * If we are using lossy info, we have to recheck the qual conditions
198 * at every tuple.
199 */
200 if (node->recheck)
201 {
202 econtext->ecxt_scantuple = slot;
203 if (!ExecQualAndReset(node->bitmapqualorig, econtext))
204 {
205 /* Fails recheck, so drop it and loop back for another */
206 InstrCountFiltered2(node, 1);
207 ExecClearTuple(slot);
208 continue;
209 }
210 }
211
212 /* OK to return this tuple */
213 return slot;
214 }
215
216 /*
217 * if we get here it means we are at the end of the scan..
218 */
219 return ExecClearTuple(slot);
220}
221
222/*
223 * BitmapDoneInitializingSharedState - Shared state is initialized
224 *
225 * By this time the leader has already populated the TBM and initialized the
226 * shared state so wake up other processes.
227 */
228static inline void
236
237/*
238 * BitmapHeapRecheck -- access method routine to recheck a tuple in EvalPlanQual
239 */
240static bool
242{
243 ExprContext *econtext;
244
245 /*
246 * extract necessary information from index scan node
247 */
248 econtext = node->ss.ps.ps_ExprContext;
249
250 /* Does the tuple meet the original qual conditions? */
251 econtext->ecxt_scantuple = slot;
252 return ExecQualAndReset(node->bitmapqualorig, econtext);
253}
254
255/* ----------------------------------------------------------------
256 * ExecBitmapHeapScan(node)
257 * ----------------------------------------------------------------
258 */
259static TupleTableSlot *
268
269/* ----------------------------------------------------------------
270 * ExecReScanBitmapHeapScan(node)
271 * ----------------------------------------------------------------
272 */
273void
275{
277
279
280 if (scan)
281 {
282 /*
283 * End iteration on iterators saved in scan descriptor if they have
284 * not already been cleaned up.
285 */
286 if (!tbm_exhausted(&scan->st.rs_tbmiterator))
288
289 /* rescan to release any page pin */
291 }
292
293 /* release bitmaps and buffers if any */
294 if (node->tbm)
295 tbm_free(node->tbm);
296 node->tbm = NULL;
297 node->initialized = false;
298 node->recheck = true;
299
300 ExecScanReScan(&node->ss);
301
302 /*
303 * if chgParam of subnode is not null then plan will be re-scanned by
304 * first ExecProcNode.
305 */
306 if (outerPlan->chgParam == NULL)
308}
309
310/* ----------------------------------------------------------------
311 * ExecEndBitmapHeapScan
312 * ----------------------------------------------------------------
313 */
314void
316{
318
319 /*
320 * When ending a parallel worker, copy the statistics gathered by the
321 * worker back into shared memory so that it can be picked up by the main
322 * process to report in EXPLAIN ANALYZE.
323 */
324 if (node->sinstrument != NULL && IsParallelWorker())
325 {
327
328 Assert(ParallelWorkerNumber < node->sinstrument->num_workers);
330
331 /*
332 * Here we accumulate the stats rather than performing memcpy on
333 * node->stats into si. When a Gather/GatherMerge node finishes it
334 * will perform planner shutdown on the workers. On rescan it will
335 * spin up new workers which will have a new BitmapHeapScanState and
336 * zeroed stats.
337 */
339 si->lossy_pages += node->stats.lossy_pages;
340
341 /* collect I/O instrumentation for this process */
342 if (node->ss.ss_currentScanDesc &&
344 {
345 AccumulateIOStats(&si->stats.io,
347 }
348 }
349
350 /*
351 * extract information from the node
352 */
354
355 /*
356 * close down subplans
357 */
359
360 if (scanDesc)
361 {
362 /*
363 * End iteration on iterators saved in scan descriptor if they have
364 * not already been cleaned up.
365 */
366 if (!tbm_exhausted(&scanDesc->st.rs_tbmiterator))
367 tbm_end_iterate(&scanDesc->st.rs_tbmiterator);
368
369 /*
370 * close table scan
371 */
373 }
374
375 /*
376 * release bitmaps and buffers if any
377 */
378 if (node->tbm)
379 tbm_free(node->tbm);
380}
381
382/* ----------------------------------------------------------------
383 * ExecInitBitmapHeapScan
384 *
385 * Initializes the scan's state information.
386 * ----------------------------------------------------------------
387 */
390{
393
394 /* check for unsupported flags */
396
397 /*
398 * Assert caller didn't ask for an unsafe snapshot --- see comments at
399 * head of file.
400 */
402
403 /*
404 * create state structure
405 */
407 scanstate->ss.ps.plan = (Plan *) node;
408 scanstate->ss.ps.state = estate;
409 scanstate->ss.ps.ExecProcNode = ExecBitmapHeapScan;
410
411 scanstate->tbm = NULL;
412
413 /* Zero the statistics counters */
415
416 scanstate->initialized = false;
417 scanstate->pstate = NULL;
418 scanstate->recheck = true;
419
420 /*
421 * Miscellaneous initialization
422 *
423 * create expression context for node
424 */
425 ExecAssignExprContext(estate, &scanstate->ss.ps);
426
427 /*
428 * open the scan relation
429 */
430 currentRelation = ExecOpenScanRelation(estate, node->scan.scanrelid, eflags);
431
432 /*
433 * initialize child nodes
434 */
435 outerPlanState(scanstate) = ExecInitNode(outerPlan(node), estate, eflags);
436
437 /*
438 * get the scan type from the relation descriptor.
439 */
440 ExecInitScanTupleSlot(estate, &scanstate->ss,
444
445 /*
446 * Initialize result type and projection.
447 */
450
451 /*
452 * initialize child expressions
453 */
454 scanstate->ss.ps.qual =
455 ExecInitQual(node->scan.plan.qual, (PlanState *) scanstate);
456 scanstate->bitmapqualorig =
458
459 scanstate->ss.ss_currentRelation = currentRelation;
460
461 /*
462 * all done.
463 */
464 return scanstate;
465}
466
467/*----------------
468 * BitmapShouldInitializeSharedState
469 *
470 * The first process to come here and see the state to the BM_INITIAL
471 * will become the leader for the parallel bitmap scan and will be
472 * responsible for populating the TIDBitmap. The other processes will
473 * be blocked by the condition variable until the leader wakes them up.
474 * ---------------
475 */
476static bool
478{
480
481 while (1)
482 {
483 SpinLockAcquire(&pstate->mutex);
484 state = pstate->state;
485 if (pstate->state == BM_INITIAL)
486 pstate->state = BM_INPROGRESS;
487 SpinLockRelease(&pstate->mutex);
488
489 /* Exit if bitmap is done, or if we're the leader. */
490 if (state != BM_INPROGRESS)
491 break;
492
493 /* Wait for the leader to wake us up. */
495 }
496
498
499 return (state == BM_INITIAL);
500}
501
502/* ----------------------------------------------------------------
503 * ExecBitmapHeapEstimate
504 *
505 * Compute the amount of space we'll need in the parallel
506 * query DSM, and inform pcxt->estimator about our needs.
507 * ----------------------------------------------------------------
508 */
509void
517
518/* ----------------------------------------------------------------
519 * ExecBitmapHeapInitializeDSM
520 *
521 * Set up a parallel bitmap heap scan descriptor.
522 * ----------------------------------------------------------------
523 */
524void
526 ParallelContext *pcxt)
527{
529 dsa_area *dsa = node->ss.ps.state->es_query_dsa;
530
531 /* If there's no DSA, there are no workers; initialize nothing. */
532 if (dsa == NULL)
533 return;
534
535 pstate = (ParallelBitmapHeapState *)
536 shm_toc_allocate(pcxt->toc,
538
539 pstate->tbmiterator = 0;
540
541 /* Initialize the mutex */
542 SpinLockInit(&pstate->mutex);
543 pstate->state = BM_INITIAL;
544
545 ConditionVariableInit(&pstate->cv);
546
547 shm_toc_insert(pcxt->toc, node->ss.ps.plan->plan_node_id, pstate);
548 node->pstate = pstate;
549}
550
551/* ----------------------------------------------------------------
552 * ExecBitmapHeapReInitializeDSM
553 *
554 * Reset shared state before beginning a fresh scan.
555 * ----------------------------------------------------------------
556 */
557void
559 ParallelContext *pcxt)
560{
561 ParallelBitmapHeapState *pstate = node->pstate;
562 dsa_area *dsa = node->ss.ps.state->es_query_dsa;
563
564 /* If there's no DSA, there are no workers; do nothing. */
565 if (dsa == NULL)
566 return;
567
568 pstate->state = BM_INITIAL;
569
570 if (DsaPointerIsValid(pstate->tbmiterator))
571 tbm_free_shared_area(dsa, pstate->tbmiterator);
572
574}
575
576/* ----------------------------------------------------------------
577 * ExecBitmapHeapInitializeWorker
578 *
579 * Copy relevant information from TOC into planstate.
580 * ----------------------------------------------------------------
581 */
582void
591
592/*
593 * Compute the amount of space we'll need for the shared instrumentation and
594 * inform pcxt->estimator.
595 */
596void
598 ParallelContext *pcxt)
599{
600 Size size;
601
602 if (!node->ss.ps.instrument || pcxt->nworkers == 0)
603 return;
604
607 shm_toc_estimate_chunk(&pcxt->estimator, size);
609}
610
611/*
612 * Set up parallel bitmap heap scan instrumentation.
613 */
614void
616 ParallelContext *pcxt)
617{
618 Size size;
619
620 if (!node->ss.ps.instrument || pcxt->nworkers == 0)
621 return;
622
625 node->sinstrument =
627
628 /* Each per-worker area must start out as zeroes */
629 memset(node->sinstrument, 0, size);
630 node->sinstrument->num_workers = pcxt->nworkers;
631 shm_toc_insert(pcxt->toc,
632 node->ss.ps.plan->plan_node_id +
634 node->sinstrument);
635}
636
637/*
638 * Look up and save the location of the shared instrumentation.
639 */
640void
653
654/* ----------------------------------------------------------------
655 * ExecBitmapHeapRetrieveInstrumentation
656 *
657 * Transfer bitmap heap scan statistics from DSM to private memory.
658 * ----------------------------------------------------------------
659 */
660void
662{
663 SharedBitmapHeapInstrumentation *sinstrument = node->sinstrument;
664 Size size;
665
666 if (sinstrument == NULL)
667 return;
668
669 size = offsetof(SharedBitmapHeapInstrumentation, sinstrument)
670 + sinstrument->num_workers * sizeof(BitmapHeapScanInstrumentation);
671
672 node->sinstrument = palloc(size);
673 memcpy(node->sinstrument, sinstrument, size);
674}
int ParallelWorkerNumber
Definition parallel.c:117
#define MAXALIGN(LEN)
Definition c.h:896
#define Assert(condition)
Definition c.h:943
uint32_t uint32
Definition c.h:624
size_t Size
Definition c.h:689
memcpy(sums, checksumBaseOffsets, sizeof(checksumBaseOffsets))
bool ConditionVariableCancelSleep(void)
void ConditionVariableBroadcast(ConditionVariable *cv)
void ConditionVariableInit(ConditionVariable *cv)
void ConditionVariableSleep(ConditionVariable *cv, uint32 wait_event_info)
uint64 dsa_pointer
Definition dsa.h:62
#define InvalidDsaPointer
Definition dsa.h:78
#define DsaPointerIsValid(x)
Definition dsa.h:106
#define ERROR
Definition elog.h:40
#define elog(elevel,...)
Definition elog.h:228
void ExecReScan(PlanState *node)
Definition execAmi.c:78
ExprState * ExecInitQual(List *qual, PlanState *parent)
Definition execExpr.c:250
Node * MultiExecProcNode(PlanState *node)
void ExecEndNode(PlanState *node)
PlanState * ExecInitNode(Plan *node, EState *estate, int eflags)
TupleTableSlot * ExecScan(ScanState *node, ExecScanAccessMtd accessMtd, ExecScanRecheckMtd recheckMtd)
Definition execScan.c:47
void ExecAssignScanProjectionInfo(ScanState *node)
Definition execScan.c:81
void ExecScanReScan(ScanState *node)
Definition execScan.c:108
void ExecInitScanTupleSlot(EState *estate, ScanState *scanstate, TupleDesc tupledesc, const TupleTableSlotOps *tts_ops, uint16 flags)
void ExecInitResultTypeTL(PlanState *planstate)
bool ScanRelIsReadOnly(ScanState *ss)
Definition execUtils.c:751
void ExecAssignExprContext(EState *estate, PlanState *planstate)
Definition execUtils.c:490
Relation ExecOpenScanRelation(EState *estate, Index scanrelid, int eflags)
Definition execUtils.c:768
#define outerPlanState(node)
Definition execnodes.h:1299
#define InstrCountFiltered2(node, delta)
Definition execnodes.h:1312
#define EXEC_FLAG_BACKWARD
Definition executor.h:70
bool(* ExecScanRecheckMtd)(ScanState *node, TupleTableSlot *slot)
Definition executor.h:590
static bool ExecQualAndReset(ExprState *state, ExprContext *econtext)
Definition executor.h:556
TupleTableSlot *(* ExecScanAccessMtd)(ScanState *node)
Definition executor.h:589
#define EXEC_FLAG_MARK
Definition executor.h:71
#define IsParallelWorker()
Definition parallel.h:62
@ INSTRUMENT_IO
Definition instrument.h:67
#define PARALLEL_KEY_SCAN_INSTRUMENT_OFFSET
static void AccumulateIOStats(IOStats *dst, IOStats *src)
void * palloc(Size size)
Definition mcxt.c:1387
#define CHECK_FOR_INTERRUPTS()
Definition miscadmin.h:125
void ExecBitmapHeapInstrumentInitWorker(BitmapHeapScanState *node, ParallelWorkerContext *pwcxt)
void ExecBitmapHeapInstrumentInitDSM(BitmapHeapScanState *node, ParallelContext *pcxt)
void ExecEndBitmapHeapScan(BitmapHeapScanState *node)
void ExecBitmapHeapInitializeWorker(BitmapHeapScanState *node, ParallelWorkerContext *pwcxt)
void ExecReScanBitmapHeapScan(BitmapHeapScanState *node)
void ExecBitmapHeapEstimate(BitmapHeapScanState *node, ParallelContext *pcxt)
void ExecBitmapHeapRetrieveInstrumentation(BitmapHeapScanState *node)
void ExecBitmapHeapInitializeDSM(BitmapHeapScanState *node, ParallelContext *pcxt)
SharedBitmapState
@ BM_INITIAL
@ BM_FINISHED
@ BM_INPROGRESS
static bool BitmapShouldInitializeSharedState(ParallelBitmapHeapState *pstate)
void ExecBitmapHeapReInitializeDSM(BitmapHeapScanState *node, ParallelContext *pcxt)
static TupleTableSlot * ExecBitmapHeapScan(PlanState *pstate)
BitmapHeapScanState * ExecInitBitmapHeapScan(BitmapHeapScan *node, EState *estate, int eflags)
static TupleTableSlot * BitmapHeapNext(BitmapHeapScanState *node)
static void BitmapTableScanSetup(BitmapHeapScanState *node)
static void BitmapDoneInitializingSharedState(ParallelBitmapHeapState *pstate)
void ExecBitmapHeapInstrumentEstimate(BitmapHeapScanState *node, ParallelContext *pcxt)
static bool BitmapHeapRecheck(BitmapHeapScanState *node, TupleTableSlot *slot)
#define IsA(nodeptr, _type_)
Definition nodes.h:164
#define makeNode(_type_)
Definition nodes.h:161
#define castNode(_type_, nodeptr)
Definition nodes.h:182
#define outerPlan(node)
Definition plannodes.h:267
static int fb(int x)
#define RelationGetDescr(relation)
Definition rel.h:542
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
Size add_size(Size s1, Size s2)
Definition shmem.c:1048
Size mul_size(Size s1, Size s2)
Definition shmem.c:1063
#define IsMVCCSnapshot(snapshot)
Definition snapmgr.h:59
static void SpinLockRelease(volatile slock_t *lock)
Definition spin.h:62
static void SpinLockAcquire(volatile slock_t *lock)
Definition spin.h:56
static void SpinLockInit(volatile slock_t *lock)
Definition spin.h:50
ParallelBitmapHeapState * pstate
Definition execnodes.h:1882
ExprState * bitmapqualorig
Definition execnodes.h:1878
BitmapHeapScanInstrumentation stats
Definition execnodes.h:1880
SharedBitmapHeapInstrumentation * sinstrument
Definition execnodes.h:1883
List * bitmapqualorig
Definition plannodes.h:714
struct dsa_area * es_query_dsa
Definition execnodes.h:788
int es_instrument
Definition execnodes.h:756
Snapshot es_snapshot
Definition execnodes.h:696
TupleTableSlot * ecxt_scantuple
Definition execnodes.h:287
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
ExprContext * ps_ExprContext
Definition execnodes.h:1242
int plan_node_id
Definition plannodes.h:233
Relation ss_currentRelation
Definition execnodes.h:1660
TupleTableSlot * ss_ScanTupleSlot
Definition execnodes.h:1662
PlanState ps
Definition execnodes.h:1659
struct TableScanDescData * ss_currentScanDesc
Definition execnodes.h:1661
Index scanrelid
Definition plannodes.h:544
BitmapHeapScanInstrumentation sinstrument[FLEXIBLE_ARRAY_MEMBER]
TBMIterator rs_tbmiterator
Definition relscan.h:47
union TableScanDescData::@55 st
struct TableScanInstrumentation * rs_instrument
Definition relscan.h:72
const TupleTableSlotOps * table_slot_callbacks(Relation relation)
Definition tableam.c:59
@ SO_HINT_REL_READ_ONLY
Definition tableam.h:71
@ SO_NONE
Definition tableam.h:49
@ SO_SCAN_INSTRUMENT
Definition tableam.h:74
static void table_endscan(TableScanDesc scan)
Definition tableam.h:1061
static bool table_scan_bitmap_next_tuple(TableScanDesc scan, TupleTableSlot *slot, bool *recheck, uint64 *lossy_pages, uint64 *exact_pages)
Definition tableam.h:2037
static TableScanDesc table_beginscan_bm(Relation rel, Snapshot snapshot, int nkeys, ScanKeyData *key, uint32 flags)
Definition tableam.h:992
static void table_rescan(TableScanDesc scan, ScanKeyData *key)
Definition tableam.h:1070
void tbm_free(TIDBitmap *tbm)
Definition tidbitmap.c:312
void tbm_end_iterate(TBMIterator *iterator)
Definition tidbitmap.c:1594
dsa_pointer tbm_prepare_shared_iterate(TIDBitmap *tbm)
Definition tidbitmap.c:752
void tbm_free_shared_area(dsa_area *dsa, dsa_pointer dp)
Definition tidbitmap.c:331
TBMIterator tbm_begin_iterate(TIDBitmap *tbm, dsa_area *dsa, dsa_pointer dsp)
Definition tidbitmap.c:1571
static bool tbm_exhausted(TBMIterator *iterator)
Definition tidbitmap.h:118
static TupleTableSlot * ExecClearTuple(TupleTableSlot *slot)
Definition tuptable.h:476
#define TTS_FLAG_OBEYS_NOT_NULL_CONSTRAINTS
Definition tuptable.h:102