#include "postgres.h"
#include <math.h>
#include "access/relscan.h"
#include "access/tableam.h"
#include "access/transam.h"
#include "access/visibilitymap.h"
#include "executor/execdebug.h"
#include "executor/nodeBitmapHeapscan.h"
#include "miscadmin.h"
#include "pgstat.h"
#include "storage/bufmgr.h"
#include "storage/predicate.h"
#include "utils/memutils.h"
#include "utils/rel.h"
#include "utils/snapmgr.h"
#include "utils/spccache.h"

Include dependency graph for nodeBitmapHeapscan.c:

Functions
static TupleTableSlot *	BitmapHeapNext (BitmapHeapScanState *node)

static void	BitmapDoneInitializingSharedState (ParallelBitmapHeapState *pstate)

static void	BitmapAdjustPrefetchIterator (BitmapHeapScanState node, TBMIterateResult tbmres)

static void	BitmapAdjustPrefetchTarget (BitmapHeapScanState *node)

static void	BitmapPrefetch (BitmapHeapScanState *node, TableScanDesc scan)

static bool	BitmapShouldInitializeSharedState (ParallelBitmapHeapState *pstate)

static bool	BitmapHeapRecheck (BitmapHeapScanState node, TupleTableSlot slot)

static TupleTableSlot *	ExecBitmapHeapScan (PlanState *pstate)

void	ExecReScanBitmapHeapScan (BitmapHeapScanState *node)

void	ExecEndBitmapHeapScan (BitmapHeapScanState *node)

BitmapHeapScanState *	ExecInitBitmapHeapScan (BitmapHeapScan node, EState estate, int eflags)

void	ExecBitmapHeapEstimate (BitmapHeapScanState node, ParallelContext pcxt)

void	ExecBitmapHeapInitializeDSM (BitmapHeapScanState node, ParallelContext pcxt)

void	ExecBitmapHeapReInitializeDSM (BitmapHeapScanState node, ParallelContext pcxt)

void	ExecBitmapHeapInitializeWorker (BitmapHeapScanState node, ParallelWorkerContext pwcxt)

Function Documentation

◆ BitmapAdjustPrefetchIterator()

static void BitmapAdjustPrefetchIterator	(	BitmapHeapScanState *	node,
		TBMIterateResult *	tbmres
	)

inlinestatic

Definition at line 360 of file nodeBitmapHeapscan.c.

 {
 #ifdef USE_PREFETCH
     ParallelBitmapHeapState *pstate = node->pstate;
  
     if (pstate == NULL)
     {
         TBMIterator *prefetch_iterator = node->prefetch_iterator;
  
         if (node->prefetch_pages > 0)
         {
             /* The main iterator has closed the distance by one page */
             node->prefetch_pages--;
         }
         else if (prefetch_iterator)
         {
             /* Do not let the prefetch iterator get behind the main one */
             TBMIterateResult *tbmpre = tbm_iterate(prefetch_iterator);
  
             if (tbmpre == NULL || tbmpre->blockno != tbmres->blockno)
                 elog(ERROR, "prefetch and main iterators are out of sync");
         }
         return;
     }
  
     if (node->prefetch_maximum > 0)
     {
         TBMSharedIterator *prefetch_iterator = node->shared_prefetch_iterator;
  
         SpinLockAcquire(&pstate->mutex);
         if (pstate->prefetch_pages > 0)
         {
             pstate->prefetch_pages--;
             SpinLockRelease(&pstate->mutex);
         }
         else
         {
             /* Release the mutex before iterating */
             SpinLockRelease(&pstate->mutex);
  
             /*
              * In case of shared mode, we can not ensure that the current
              * blockno of the main iterator and that of the prefetch iterator
              * are same.  It's possible that whatever blockno we are
              * prefetching will be processed by another process.  Therefore,
              * we don't validate the blockno here as we do in non-parallel
              * case.
              */
             if (prefetch_iterator)
                 tbm_shared_iterate(prefetch_iterator);
         }
     }
 #endif                          /* USE_PREFETCH */
 }

References TBMIterateResult::blockno, elog(), ERROR, ParallelBitmapHeapState::mutex, BitmapHeapScanState::prefetch_iterator, BitmapHeapScanState::prefetch_maximum, ParallelBitmapHeapState::prefetch_pages, BitmapHeapScanState::prefetch_pages, BitmapHeapScanState::pstate, BitmapHeapScanState::shared_prefetch_iterator, SpinLockAcquire, SpinLockRelease, tbm_iterate(), and tbm_shared_iterate().

Referenced by BitmapHeapNext().

◆ BitmapAdjustPrefetchTarget()

static void BitmapAdjustPrefetchTarget ( BitmapHeapScanState * node )

inlinestatic

Definition at line 425 of file nodeBitmapHeapscan.c.

 {
 #ifdef USE_PREFETCH
     ParallelBitmapHeapState *pstate = node->pstate;
  
     if (pstate == NULL)
     {
         if (node->prefetch_target >= node->prefetch_maximum)
              /* don't increase any further */ ;
         else if (node->prefetch_target >= node->prefetch_maximum / 2)
             node->prefetch_target = node->prefetch_maximum;
         else if (node->prefetch_target > 0)
             node->prefetch_target *= 2;
         else
             node->prefetch_target++;
         return;
     }
  
     /* Do an unlocked check first to save spinlock acquisitions. */
     if (pstate->prefetch_target < node->prefetch_maximum)
     {
         SpinLockAcquire(&pstate->mutex);
         if (pstate->prefetch_target >= node->prefetch_maximum)
              /* don't increase any further */ ;
         else if (pstate->prefetch_target >= node->prefetch_maximum / 2)
             pstate->prefetch_target = node->prefetch_maximum;
         else if (pstate->prefetch_target > 0)
             pstate->prefetch_target *= 2;
         else
             pstate->prefetch_target++;
         SpinLockRelease(&pstate->mutex);
     }
 #endif                          /* USE_PREFETCH */
 }

References ParallelBitmapHeapState::mutex, BitmapHeapScanState::prefetch_maximum, ParallelBitmapHeapState::prefetch_target, BitmapHeapScanState::prefetch_target, BitmapHeapScanState::pstate, SpinLockAcquire, and SpinLockRelease.

Referenced by BitmapHeapNext().

◆ BitmapDoneInitializingSharedState()

static void BitmapDoneInitializingSharedState ( ParallelBitmapHeapState * pstate )

inlinestatic

Definition at line 348 of file nodeBitmapHeapscan.c.

 {
     SpinLockAcquire(&pstate->mutex);
     pstate->state = BM_FINISHED;
     SpinLockRelease(&pstate->mutex);
     ConditionVariableBroadcast(&pstate->cv);
 }

References BM_FINISHED, ConditionVariableBroadcast(), ParallelBitmapHeapState::cv, ParallelBitmapHeapState::mutex, SpinLockAcquire, SpinLockRelease, and ParallelBitmapHeapState::state.

Referenced by BitmapHeapNext().

◆ BitmapHeapNext()

static TupleTableSlot * BitmapHeapNext ( BitmapHeapScanState * node )

static

Definition at line 72 of file nodeBitmapHeapscan.c.

 {
     ExprContext *econtext;
     TableScanDesc scan;
     TIDBitmap  *tbm;
     TBMIterator *tbmiterator = NULL;
     TBMSharedIterator *shared_tbmiterator = NULL;
     TBMIterateResult *tbmres;
     TupleTableSlot *slot;
     ParallelBitmapHeapState *pstate = node->pstate;
     dsa_area   *dsa = node->ss.ps.state->es_query_dsa;
  
     /*
      * extract necessary information from index scan node
      */
     econtext = node->ss.ps.ps_ExprContext;
     slot = node->ss.ss_ScanTupleSlot;
     scan = node->ss.ss_currentScanDesc;
     tbm = node->tbm;
     if (pstate == NULL)
         tbmiterator = node->tbmiterator;
     else
         shared_tbmiterator = node->shared_tbmiterator;
     tbmres = node->tbmres;
  
     /*
      * If we haven't yet performed the underlying index scan, do it, and begin
      * the iteration over the bitmap.
      *
      * For prefetching, we use *two* iterators, one for the pages we are
      * actually scanning and another that runs ahead of the first for
      * prefetching.  node->prefetch_pages tracks exactly how many pages ahead
      * the prefetch iterator is.  Also, node->prefetch_target tracks the
      * desired prefetch distance, which starts small and increases up to the
      * node->prefetch_maximum.  This is to avoid doing a lot of prefetching in
      * a scan that stops after a few tuples because of a LIMIT.
      */
     if (!node->initialized)
     {
         if (!pstate)
         {
             tbm = (TIDBitmap *) MultiExecProcNode(outerPlanState(node));
  
             if (!tbm || !IsA(tbm, TIDBitmap))
                 elog(ERROR, "unrecognized result from subplan");
  
             node->tbm = tbm;
             node->tbmiterator = tbmiterator = tbm_begin_iterate(tbm);
             node->tbmres = tbmres = NULL;
  
 #ifdef USE_PREFETCH
             if (node->prefetch_maximum > 0)
             {
                 node->prefetch_iterator = tbm_begin_iterate(tbm);
                 node->prefetch_pages = 0;
                 node->prefetch_target = -1;
             }
 #endif                          /* USE_PREFETCH */
         }
         else
         {
             /*
              * The leader will immediately come out of the function, but
              * others will be blocked until leader populates the TBM and wakes
              * them up.
              */
             if (BitmapShouldInitializeSharedState(pstate))
             {
                 tbm = (TIDBitmap *) MultiExecProcNode(outerPlanState(node));
                 if (!tbm || !IsA(tbm, TIDBitmap))
                     elog(ERROR, "unrecognized result from subplan");
  
                 node->tbm = tbm;
  
                 /*
                  * Prepare to iterate over the TBM. This will return the
                  * dsa_pointer of the iterator state which will be used by
                  * multiple processes to iterate jointly.
                  */
                 pstate->tbmiterator = tbm_prepare_shared_iterate(tbm);
 #ifdef USE_PREFETCH
                 if (node->prefetch_maximum > 0)
                 {
                     pstate->prefetch_iterator =
                         tbm_prepare_shared_iterate(tbm);
  
                     /*
                      * We don't need the mutex here as we haven't yet woke up
                      * others.
                      */
                     pstate->prefetch_pages = 0;
                     pstate->prefetch_target = -1;
                 }
 #endif
  
                 /* We have initialized the shared state so wake up others. */
                 BitmapDoneInitializingSharedState(pstate);
             }
  
             /* Allocate a private iterator and attach the shared state to it */
             node->shared_tbmiterator = shared_tbmiterator =
                 tbm_attach_shared_iterate(dsa, pstate->tbmiterator);
             node->tbmres = tbmres = NULL;
  
 #ifdef USE_PREFETCH
             if (node->prefetch_maximum > 0)
             {
                 node->shared_prefetch_iterator =
                     tbm_attach_shared_iterate(dsa, pstate->prefetch_iterator);
             }
 #endif                          /* USE_PREFETCH */
         }
         node->initialized = true;
     }
  
     for (;;)
     {
         bool        skip_fetch;
  
         CHECK_FOR_INTERRUPTS();
  
         /*
          * Get next page of results if needed
          */
         if (tbmres == NULL)
         {
             if (!pstate)
                 node->tbmres = tbmres = tbm_iterate(tbmiterator);
             else
                 node->tbmres = tbmres = tbm_shared_iterate(shared_tbmiterator);
             if (tbmres == NULL)
             {
                 /* no more entries in the bitmap */
                 break;
             }
  
             BitmapAdjustPrefetchIterator(node, tbmres);
  
             /*
              * We can skip fetching the heap page if we don't need any fields
              * from the heap, and the bitmap entries don't need rechecking,
              * and all tuples on the page are visible to our transaction.
              *
              * XXX: It's a layering violation that we do these checks above
              * tableam, they should probably moved below it at some point.
              */
             skip_fetch = (node->can_skip_fetch &&
                           !tbmres->recheck &&
                           VM_ALL_VISIBLE(node->ss.ss_currentRelation,
                                          tbmres->blockno,
                                          &node->vmbuffer));
  
             if (skip_fetch)
             {
                 /* can't be lossy in the skip_fetch case */
                 Assert(tbmres->ntuples >= 0);
  
                 /*
                  * The number of tuples on this page is put into
                  * node->return_empty_tuples.
                  */
                 node->return_empty_tuples = tbmres->ntuples;
             }
             else if (!table_scan_bitmap_next_block(scan, tbmres))
             {
                 /* AM doesn't think this block is valid, skip */
                 continue;
             }
  
             if (tbmres->ntuples >= 0)
                 node->exact_pages++;
             else
                 node->lossy_pages++;
  
             /* Adjust the prefetch target */
             BitmapAdjustPrefetchTarget(node);
         }
         else
         {
             /*
              * Continuing in previously obtained page.
              */
  
 #ifdef USE_PREFETCH
  
             /*
              * Try to prefetch at least a few pages even before we get to the
              * second page if we don't stop reading after the first tuple.
              */
             if (!pstate)
             {
                 if (node->prefetch_target < node->prefetch_maximum)
                     node->prefetch_target++;
             }
             else if (pstate->prefetch_target < node->prefetch_maximum)
             {
                 /* take spinlock while updating shared state */
                 SpinLockAcquire(&pstate->mutex);
                 if (pstate->prefetch_target < node->prefetch_maximum)
                     pstate->prefetch_target++;
                 SpinLockRelease(&pstate->mutex);
             }
 #endif                          /* USE_PREFETCH */
         }
  
         /*
          * We issue prefetch requests *after* fetching the current page to try
          * to avoid having prefetching interfere with the main I/O. Also, this
          * should happen only when we have determined there is still something
          * to do on the current page, else we may uselessly prefetch the same
          * page we are just about to request for real.
          *
          * XXX: It's a layering violation that we do these checks above
          * tableam, they should probably moved below it at some point.
          */
         BitmapPrefetch(node, scan);
  
         if (node->return_empty_tuples > 0)
         {
             /*
              * If we don't have to fetch the tuple, just return nulls.
              */
             ExecStoreAllNullTuple(slot);
  
             if (--node->return_empty_tuples == 0)
             {
                 /* no more tuples to return in the next round */
                 node->tbmres = tbmres = NULL;
             }
         }
         else
         {
             /*
              * Attempt to fetch tuple from AM.
              */
             if (!table_scan_bitmap_next_tuple(scan, tbmres, slot))
             {
                 /* nothing more to look at on this page */
                 node->tbmres = tbmres = NULL;
                 continue;
             }
  
             /*
              * If we are using lossy info, we have to recheck the qual
              * conditions at every tuple.
              */
             if (tbmres->recheck)
             {
                 econtext->ecxt_scantuple = slot;
                 if (!ExecQualAndReset(node->bitmapqualorig, econtext))
                 {
                     /* Fails recheck, so drop it and loop back for another */
                     InstrCountFiltered2(node, 1);
                     ExecClearTuple(slot);
                     continue;
                 }
             }
         }
  
         /* OK to return this tuple */
         return slot;
     }
  
     /*
      * if we get here it means we are at the end of the scan..
      */
     return ExecClearTuple(slot);
 }

Referenced by ExecBitmapHeapScan().

◆ BitmapHeapRecheck()

static bool BitmapHeapRecheck	(	BitmapHeapScanState *	node,
		TupleTableSlot *	slot
	)

static

Definition at line 569 of file nodeBitmapHeapscan.c.

 {
     ExprContext *econtext;
  
     /*
      * extract necessary information from index scan node
      */
     econtext = node->ss.ps.ps_ExprContext;
  
     /* Does the tuple meet the original qual conditions? */
     econtext->ecxt_scantuple = slot;
     return ExecQualAndReset(node->bitmapqualorig, econtext);
 }

References BitmapHeapScanState::bitmapqualorig, ExprContext::ecxt_scantuple, ExecQualAndReset(), ScanState::ps, PlanState::ps_ExprContext, and BitmapHeapScanState::ss.

Referenced by ExecBitmapHeapScan().

◆ BitmapPrefetch()

static void BitmapPrefetch	(	BitmapHeapScanState *	node,
		TableScanDesc	scan
	)

inlinestatic

Definition at line 464 of file nodeBitmapHeapscan.c.

 {
 #ifdef USE_PREFETCH
     ParallelBitmapHeapState *pstate = node->pstate;
  
     if (pstate == NULL)
     {
         TBMIterator *prefetch_iterator = node->prefetch_iterator;
  
         if (prefetch_iterator)
         {
             while (node->prefetch_pages < node->prefetch_target)
             {
                 TBMIterateResult *tbmpre = tbm_iterate(prefetch_iterator);
                 bool        skip_fetch;
  
                 if (tbmpre == NULL)
                 {
                     /* No more pages to prefetch */
                     tbm_end_iterate(prefetch_iterator);
                     node->prefetch_iterator = NULL;
                     break;
                 }
                 node->prefetch_pages++;
  
                 /*
                  * If we expect not to have to actually read this heap page,
                  * skip this prefetch call, but continue to run the prefetch
                  * logic normally.  (Would it be better not to increment
                  * prefetch_pages?)
                  *
                  * This depends on the assumption that the index AM will
                  * report the same recheck flag for this future heap page as
                  * it did for the current heap page; which is not a certainty
                  * but is true in many cases.
                  */
                 skip_fetch = (node->can_skip_fetch &&
                               (node->tbmres ? !node->tbmres->recheck : false) &&
                               VM_ALL_VISIBLE(node->ss.ss_currentRelation,
                                              tbmpre->blockno,
                                              &node->pvmbuffer));
  
                 if (!skip_fetch)
                     PrefetchBuffer(scan->rs_rd, MAIN_FORKNUM, tbmpre->blockno);
             }
         }
  
         return;
     }
  
     if (pstate->prefetch_pages < pstate->prefetch_target)
     {
         TBMSharedIterator *prefetch_iterator = node->shared_prefetch_iterator;
  
         if (prefetch_iterator)
         {
             while (1)
             {
                 TBMIterateResult *tbmpre;
                 bool        do_prefetch = false;
                 bool        skip_fetch;
  
                 /*
                  * Recheck under the mutex. If some other process has already
                  * done enough prefetching then we need not to do anything.
                  */
                 SpinLockAcquire(&pstate->mutex);
                 if (pstate->prefetch_pages < pstate->prefetch_target)
                 {
                     pstate->prefetch_pages++;
                     do_prefetch = true;
                 }
                 SpinLockRelease(&pstate->mutex);
  
                 if (!do_prefetch)
                     return;
  
                 tbmpre = tbm_shared_iterate(prefetch_iterator);
                 if (tbmpre == NULL)
                 {
                     /* No more pages to prefetch */
                     tbm_end_shared_iterate(prefetch_iterator);
                     node->shared_prefetch_iterator = NULL;
                     break;
                 }
  
                 /* As above, skip prefetch if we expect not to need page */
                 skip_fetch = (node->can_skip_fetch &&
                               (node->tbmres ? !node->tbmres->recheck : false) &&
                               VM_ALL_VISIBLE(node->ss.ss_currentRelation,
                                              tbmpre->blockno,
                                              &node->pvmbuffer));
  
                 if (!skip_fetch)
                     PrefetchBuffer(scan->rs_rd, MAIN_FORKNUM, tbmpre->blockno);
             }
         }
     }
 #endif                          /* USE_PREFETCH */
 }

Referenced by BitmapHeapNext().

◆ BitmapShouldInitializeSharedState()

static bool BitmapShouldInitializeSharedState ( ParallelBitmapHeapState * pstate )

static

Definition at line 811 of file nodeBitmapHeapscan.c.

 {
     SharedBitmapState state;
  
     while (1)
     {
         SpinLockAcquire(&pstate->mutex);
         state = pstate->state;
         if (pstate->state == BM_INITIAL)
             pstate->state = BM_INPROGRESS;
         SpinLockRelease(&pstate->mutex);
  
         /* Exit if bitmap is done, or if we're the leader. */
         if (state != BM_INPROGRESS)
             break;
  
         /* Wait for the leader to wake us up. */
         ConditionVariableSleep(&pstate->cv, WAIT_EVENT_PARALLEL_BITMAP_SCAN);
     }
  
     ConditionVariableCancelSleep();
  
     return (state == BM_INITIAL);
 }

References BM_INITIAL, BM_INPROGRESS, ConditionVariableCancelSleep(), ConditionVariableSleep(), ParallelBitmapHeapState::cv, ParallelBitmapHeapState::mutex, SpinLockAcquire, SpinLockRelease, and ParallelBitmapHeapState::state.

Referenced by BitmapHeapNext().

◆ ExecBitmapHeapEstimate()

void ExecBitmapHeapEstimate	(	BitmapHeapScanState *	node,
		ParallelContext *	pcxt
	)

Definition at line 844 of file nodeBitmapHeapscan.c.

 {
     EState     *estate = node->ss.ps.state;
  
     node->pscan_len = add_size(offsetof(ParallelBitmapHeapState,
                                         phs_snapshot_data),
                                EstimateSnapshotSpace(estate->es_snapshot));
  
     shm_toc_estimate_chunk(&pcxt->estimator, node->pscan_len);
     shm_toc_estimate_keys(&pcxt->estimator, 1);
 }

References add_size(), EState::es_snapshot, EstimateSnapshotSpace(), ParallelContext::estimator, ScanState::ps, BitmapHeapScanState::pscan_len, shm_toc_estimate_chunk, shm_toc_estimate_keys, BitmapHeapScanState::ss, and PlanState::state.

Referenced by ExecParallelEstimate().

◆ ExecBitmapHeapInitializeDSM()

void ExecBitmapHeapInitializeDSM	(	BitmapHeapScanState *	node,
		ParallelContext *	pcxt
	)

Definition at line 864 of file nodeBitmapHeapscan.c.

 {
     ParallelBitmapHeapState *pstate;
     EState     *estate = node->ss.ps.state;
     dsa_area   *dsa = node->ss.ps.state->es_query_dsa;
  
     /* If there's no DSA, there are no workers; initialize nothing. */
     if (dsa == NULL)
         return;
  
     pstate = shm_toc_allocate(pcxt->toc, node->pscan_len);
  
     pstate->tbmiterator = 0;
     pstate->prefetch_iterator = 0;
  
     /* Initialize the mutex */
     SpinLockInit(&pstate->mutex);
     pstate->prefetch_pages = 0;
     pstate->prefetch_target = 0;
     pstate->state = BM_INITIAL;
  
     ConditionVariableInit(&pstate->cv);
     SerializeSnapshot(estate->es_snapshot, pstate->phs_snapshot_data);
  
     shm_toc_insert(pcxt->toc, node->ss.ps.plan->plan_node_id, pstate);
     node->pstate = pstate;
 }

Referenced by ExecParallelInitializeDSM().

◆ ExecBitmapHeapInitializeWorker()

void ExecBitmapHeapInitializeWorker	(	BitmapHeapScanState *	node,
		ParallelWorkerContext *	pwcxt
	)

Definition at line 929 of file nodeBitmapHeapscan.c.

 {
     ParallelBitmapHeapState *pstate;
     Snapshot    snapshot;
  
     Assert(node->ss.ps.state->es_query_dsa != NULL);
  
     pstate = shm_toc_lookup(pwcxt->toc, node->ss.ps.plan->plan_node_id, false);
     node->pstate = pstate;
  
     snapshot = RestoreSnapshot(pstate->phs_snapshot_data);
     table_scan_update_snapshot(node->ss.ss_currentScanDesc, snapshot);
 }

References Assert(), EState::es_query_dsa, ParallelBitmapHeapState::phs_snapshot_data, PlanState::plan, Plan::plan_node_id, ScanState::ps, BitmapHeapScanState::pstate, RestoreSnapshot(), shm_toc_lookup(), BitmapHeapScanState::ss, ScanState::ss_currentScanDesc, PlanState::state, table_scan_update_snapshot(), and ParallelWorkerContext::toc.

Referenced by ExecParallelInitializeWorker().

◆ ExecBitmapHeapReInitializeDSM()

void ExecBitmapHeapReInitializeDSM	(	BitmapHeapScanState *	node,
		ParallelContext *	pcxt
	)

Definition at line 900 of file nodeBitmapHeapscan.c.

 {
     ParallelBitmapHeapState *pstate = node->pstate;
     dsa_area   *dsa = node->ss.ps.state->es_query_dsa;
  
     /* If there's no DSA, there are no workers; do nothing. */
     if (dsa == NULL)
         return;
  
     pstate->state = BM_INITIAL;
  
     if (DsaPointerIsValid(pstate->tbmiterator))
         tbm_free_shared_area(dsa, pstate->tbmiterator);
  
     if (DsaPointerIsValid(pstate->prefetch_iterator))
         tbm_free_shared_area(dsa, pstate->prefetch_iterator);
  
     pstate->tbmiterator = InvalidDsaPointer;
     pstate->prefetch_iterator = InvalidDsaPointer;
 }

References BM_INITIAL, DsaPointerIsValid, EState::es_query_dsa, InvalidDsaPointer, ParallelBitmapHeapState::prefetch_iterator, ScanState::ps, BitmapHeapScanState::pstate, BitmapHeapScanState::ss, PlanState::state, ParallelBitmapHeapState::state, tbm_free_shared_area(), and ParallelBitmapHeapState::tbmiterator.

Referenced by ExecParallelReInitializeDSM().

◆ ExecBitmapHeapScan()

static TupleTableSlot* ExecBitmapHeapScan ( PlanState * pstate )

static

Definition at line 588 of file nodeBitmapHeapscan.c.

 {
     BitmapHeapScanState *node = castNode(BitmapHeapScanState, pstate);
  
     return ExecScan(&node->ss,
                     (ExecScanAccessMtd) BitmapHeapNext,
                     (ExecScanRecheckMtd) BitmapHeapRecheck);
 }

References BitmapHeapNext(), BitmapHeapRecheck(), castNode, ExecScan(), and BitmapHeapScanState::ss.

Referenced by ExecInitBitmapHeapScan().

◆ ExecEndBitmapHeapScan()

void ExecEndBitmapHeapScan ( BitmapHeapScanState * node )

Definition at line 649 of file nodeBitmapHeapscan.c.

 {
     TableScanDesc scanDesc;
  
     /*
      * extract information from the node
      */
     scanDesc = node->ss.ss_currentScanDesc;
  
     /*
      * close down subplans
      */
     ExecEndNode(outerPlanState(node));
  
     /*
      * release bitmaps and buffers if any
      */
     if (node->tbmiterator)
         tbm_end_iterate(node->tbmiterator);
     if (node->prefetch_iterator)
         tbm_end_iterate(node->prefetch_iterator);
     if (node->tbm)
         tbm_free(node->tbm);
     if (node->shared_tbmiterator)
         tbm_end_shared_iterate(node->shared_tbmiterator);
     if (node->shared_prefetch_iterator)
         tbm_end_shared_iterate(node->shared_prefetch_iterator);
     if (node->vmbuffer != InvalidBuffer)
         ReleaseBuffer(node->vmbuffer);
     if (node->pvmbuffer != InvalidBuffer)
         ReleaseBuffer(node->pvmbuffer);
  
     /*
      * close heap scan
      */
     table_endscan(scanDesc);
 }

References ExecEndNode(), InvalidBuffer, outerPlanState, BitmapHeapScanState::prefetch_iterator, BitmapHeapScanState::pvmbuffer, ReleaseBuffer(), BitmapHeapScanState::shared_prefetch_iterator, BitmapHeapScanState::shared_tbmiterator, BitmapHeapScanState::ss, ScanState::ss_currentScanDesc, table_endscan(), BitmapHeapScanState::tbm, tbm_end_iterate(), tbm_end_shared_iterate(), tbm_free(), BitmapHeapScanState::tbmiterator, and BitmapHeapScanState::vmbuffer.

Referenced by ExecEndNode().

◆ ExecInitBitmapHeapScan()

BitmapHeapScanState* ExecInitBitmapHeapScan	(	BitmapHeapScan *	node,
		EState *	estate,
		int	eflags
	)

Definition at line 694 of file nodeBitmapHeapscan.c.

 {
     BitmapHeapScanState *scanstate;
     Relation    currentRelation;
  
     /* check for unsupported flags */
     Assert(!(eflags & (EXEC_FLAG_BACKWARD | EXEC_FLAG_MARK)));
  
     /*
      * Assert caller didn't ask for an unsafe snapshot --- see comments at
      * head of file.
      */
     Assert(IsMVCCSnapshot(estate->es_snapshot));
  
     /*
      * create state structure
      */
     scanstate = makeNode(BitmapHeapScanState);
     scanstate->ss.ps.plan = (Plan *) node;
     scanstate->ss.ps.state = estate;
     scanstate->ss.ps.ExecProcNode = ExecBitmapHeapScan;
  
     scanstate->tbm = NULL;
     scanstate->tbmiterator = NULL;
     scanstate->tbmres = NULL;
     scanstate->return_empty_tuples = 0;
     scanstate->vmbuffer = InvalidBuffer;
     scanstate->pvmbuffer = InvalidBuffer;
     scanstate->exact_pages = 0;
     scanstate->lossy_pages = 0;
     scanstate->prefetch_iterator = NULL;
     scanstate->prefetch_pages = 0;
     scanstate->prefetch_target = 0;
     scanstate->pscan_len = 0;
     scanstate->initialized = false;
     scanstate->shared_tbmiterator = NULL;
     scanstate->shared_prefetch_iterator = NULL;
     scanstate->pstate = NULL;
  
     /*
      * We can potentially skip fetching heap pages if we do not need any
      * columns of the table, either for checking non-indexable quals or for
      * returning data.  This test is a bit simplistic, as it checks the
      * stronger condition that there's no qual or return tlist at all.  But in
      * most cases it's probably not worth working harder than that.
      */
     scanstate->can_skip_fetch = (node->scan.plan.qual == NIL &&
                                  node->scan.plan.targetlist == NIL);
  
     /*
      * Miscellaneous initialization
      *
      * create expression context for node
      */
     ExecAssignExprContext(estate, &scanstate->ss.ps);
  
     /*
      * open the scan relation
      */
     currentRelation = ExecOpenScanRelation(estate, node->scan.scanrelid, eflags);
  
     /*
      * initialize child nodes
      */
     outerPlanState(scanstate) = ExecInitNode(outerPlan(node), estate, eflags);
  
     /*
      * get the scan type from the relation descriptor.
      */
     ExecInitScanTupleSlot(estate, &scanstate->ss,
                           RelationGetDescr(currentRelation),
                           table_slot_callbacks(currentRelation));
  
     /*
      * Initialize result type and projection.
      */
     ExecInitResultTypeTL(&scanstate->ss.ps);
     ExecAssignScanProjectionInfo(&scanstate->ss);
  
     /*
      * initialize child expressions
      */
     scanstate->ss.ps.qual =
         ExecInitQual(node->scan.plan.qual, (PlanState *) scanstate);
     scanstate->bitmapqualorig =
         ExecInitQual(node->bitmapqualorig, (PlanState *) scanstate);
  
     /*
      * Maximum number of prefetches for the tablespace if configured,
      * otherwise the current value of the effective_io_concurrency GUC.
      */
     scanstate->prefetch_maximum =
         get_tablespace_io_concurrency(currentRelation->rd_rel->reltablespace);
  
     scanstate->ss.ss_currentRelation = currentRelation;
  
     scanstate->ss.ss_currentScanDesc = table_beginscan_bm(currentRelation,
                                                           estate->es_snapshot,
                                                           0,
                                                           NULL);
  
     /*
      * all done.
      */
     return scanstate;
 }

Referenced by ExecInitNode().

◆ ExecReScanBitmapHeapScan()

void ExecReScanBitmapHeapScan ( BitmapHeapScanState * node )

Definition at line 602 of file nodeBitmapHeapscan.c.

 {
     PlanState  *outerPlan = outerPlanState(node);
  
     /* rescan to release any page pin */
     table_rescan(node->ss.ss_currentScanDesc, NULL);
  
     /* release bitmaps and buffers if any */
     if (node->tbmiterator)
         tbm_end_iterate(node->tbmiterator);
     if (node->prefetch_iterator)
         tbm_end_iterate(node->prefetch_iterator);
     if (node->shared_tbmiterator)
         tbm_end_shared_iterate(node->shared_tbmiterator);
     if (node->shared_prefetch_iterator)
         tbm_end_shared_iterate(node->shared_prefetch_iterator);
     if (node->tbm)
         tbm_free(node->tbm);
     if (node->vmbuffer != InvalidBuffer)
         ReleaseBuffer(node->vmbuffer);
     if (node->pvmbuffer != InvalidBuffer)
         ReleaseBuffer(node->pvmbuffer);
     node->tbm = NULL;
     node->tbmiterator = NULL;
     node->tbmres = NULL;
     node->prefetch_iterator = NULL;
     node->initialized = false;
     node->shared_tbmiterator = NULL;
     node->shared_prefetch_iterator = NULL;
     node->vmbuffer = InvalidBuffer;
     node->pvmbuffer = InvalidBuffer;
  
     ExecScanReScan(&node->ss);
  
     /*
      * if chgParam of subnode is not null then plan will be re-scanned by
      * first ExecProcNode.
      */
     if (outerPlan->chgParam == NULL)
         ExecReScan(outerPlan);
 }

References ExecReScan(), ExecScanReScan(), BitmapHeapScanState::initialized, InvalidBuffer, outerPlan, outerPlanState, BitmapHeapScanState::prefetch_iterator, BitmapHeapScanState::pvmbuffer, ReleaseBuffer(), BitmapHeapScanState::shared_prefetch_iterator, BitmapHeapScanState::shared_tbmiterator, BitmapHeapScanState::ss, ScanState::ss_currentScanDesc, table_rescan(), BitmapHeapScanState::tbm, tbm_end_iterate(), tbm_end_shared_iterate(), tbm_free(), BitmapHeapScanState::tbmiterator, BitmapHeapScanState::tbmres, and BitmapHeapScanState::vmbuffer.

Referenced by ExecReScan().

Functions

Function Documentation

◆ BitmapAdjustPrefetchIterator()

◆ BitmapAdjustPrefetchTarget()

◆ BitmapDoneInitializingSharedState()

◆ BitmapHeapNext()

◆ BitmapHeapRecheck()

◆ BitmapPrefetch()

◆ BitmapShouldInitializeSharedState()

◆ ExecBitmapHeapEstimate()

◆ ExecBitmapHeapInitializeDSM()

◆ ExecBitmapHeapInitializeWorker()

◆ ExecBitmapHeapReInitializeDSM()

◆ ExecBitmapHeapScan()

◆ ExecEndBitmapHeapScan()

◆ ExecInitBitmapHeapScan()

◆ ExecReScanBitmapHeapScan()