PostgreSQL Source Code git master
relscan.h
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 *
3 * relscan.h
4 * POSTGRES relation scan descriptor definitions.
5 *
6 *
7 * Portions Copyright (c) 1996-2025, PostgreSQL Global Development Group
8 * Portions Copyright (c) 1994, Regents of the University of California
9 *
10 * src/include/access/relscan.h
11 *
12 *-------------------------------------------------------------------------
13 */
14#ifndef RELSCAN_H
15#define RELSCAN_H
16
17#include "access/htup_details.h"
18#include "access/itup.h"
19#include "nodes/tidbitmap.h"
20#include "port/atomics.h"
21#include "storage/buf.h"
23#include "storage/spin.h"
24#include "utils/relcache.h"
25
26
28
29/*
30 * Generic descriptor for table scans. This is the base-class for table scans,
31 * which needs to be embedded in the scans of individual AMs.
32 */
33typedef struct TableScanDescData
34{
35 /* scan parameters */
36 Relation rs_rd; /* heap relation descriptor */
37 struct SnapshotData *rs_snapshot; /* snapshot to see */
38 int rs_nkeys; /* number of scan keys */
39 struct ScanKeyData *rs_key; /* array of scan key descriptors */
40
41 /*
42 * Scan type-specific members
43 */
44 union
45 {
46 /* Iterator for Bitmap Table Scans */
48
49 /*
50 * Range of ItemPointers for table_scan_getnextslot_tidrange() to
51 * scan.
52 */
53 struct
54 {
58 } st;
59
60 /*
61 * Information about type and behaviour of the scan, a bitmask of members
62 * of the ScanOptions enum (see tableam.h).
63 */
65
66 struct ParallelTableScanDescData *rs_parallel; /* parallel scan
67 * information */
70
71/*
72 * Shared state for parallel table scan.
73 *
74 * Each backend participating in a parallel table scan has its own
75 * TableScanDesc in backend-private memory, and those objects all contain a
76 * pointer to this structure. The information here must be sufficient to
77 * properly initialize each new TableScanDesc as workers join the scan, and it
78 * must act as a information what to scan for those workers.
79 */
81{
82 RelFileLocator phs_locator; /* physical relation to scan */
83 bool phs_syncscan; /* report location to syncscan logic? */
84 bool phs_snapshot_any; /* SnapshotAny, not phs_snapshot_data? */
85 Size phs_snapshot_off; /* data for snapshot */
88
89/*
90 * Shared state for parallel table scans, for block oriented storage.
91 */
93{
95
96 BlockNumber phs_nblocks; /* # blocks in relation at start of scan */
97 slock_t phs_mutex; /* mutual exclusion for setting startblock */
98 BlockNumber phs_startblock; /* starting block number */
99 pg_atomic_uint64 phs_nallocated; /* number of blocks allocated to
100 * workers so far. */
103
104/*
105 * Per backend state for parallel table scan, for block-oriented storage.
106 */
108{
109 uint64 phsw_nallocated; /* Current # of blocks into the scan */
110 uint32 phsw_chunk_remaining; /* # blocks left in this chunk */
111 uint32 phsw_chunk_size; /* The number of blocks to allocate in
112 * each I/O chunk for the scan */
115
116/*
117 * Base class for fetches from a table via an index. This is the base-class
118 * for such scans, which needs to be embedded in the respective struct for
119 * individual AMs.
120 */
122{
125
127
128/*
129 * We use the same IndexScanDescData structure for both amgettuple-based
130 * and amgetbitmap-based index scans. Some fields are only relevant in
131 * amgettuple-based scans.
132 */
133typedef struct IndexScanDescData
134{
135 /* scan parameters */
136 Relation heapRelation; /* heap relation descriptor, or NULL */
137 Relation indexRelation; /* index relation descriptor */
138 struct SnapshotData *xs_snapshot; /* snapshot to see */
139 int numberOfKeys; /* number of index qualifier conditions */
140 int numberOfOrderBys; /* number of ordering operators */
141 struct ScanKeyData *keyData; /* array of index qualifier descriptors */
142 struct ScanKeyData *orderByData; /* array of ordering op descriptors */
143 bool xs_want_itup; /* caller requests index tuples */
144 bool xs_temp_snap; /* unregister snapshot at scan end? */
145
146 /* signaling to index AM about killing index tuples */
147 bool kill_prior_tuple; /* last-returned tuple is dead */
148 bool ignore_killed_tuples; /* do not return killed entries */
149 bool xactStartedInRecovery; /* prevents killing/seeing killed
150 * tuples */
151
152 /* index access method's private state */
153 void *opaque; /* access-method-specific info */
154
155 /*
156 * Instrumentation counters maintained by all index AMs during both
157 * amgettuple calls and amgetbitmap calls (unless field remains NULL)
158 */
160
161 /*
162 * In an index-only scan, a successful amgettuple call must fill either
163 * xs_itup (and xs_itupdesc) or xs_hitup (and xs_hitupdesc) to provide the
164 * data returned by the scan. It can fill both, in which case the heap
165 * format will be used.
166 */
167 IndexTuple xs_itup; /* index tuple returned by AM */
168 struct TupleDescData *xs_itupdesc; /* rowtype descriptor of xs_itup */
169 HeapTuple xs_hitup; /* index data returned by AM, as HeapTuple */
170 struct TupleDescData *xs_hitupdesc; /* rowtype descriptor of xs_hitup */
171
173 bool xs_heap_continue; /* T if must keep walking, potential
174 * further results */
176
177 bool xs_recheck; /* T means scan keys must be rechecked */
178
179 /*
180 * When fetching with an ordering operator, the values of the ORDER BY
181 * expressions of the last returned tuple, according to the index. If
182 * xs_recheckorderby is true, these need to be rechecked just like the
183 * scan keys, and the values returned here are a lower-bound on the actual
184 * values.
185 */
189
190 /* parallel index scan information, in shared memory */
193
194/* Generic structure for parallel scans */
196{
197 RelFileLocator ps_locator; /* physical table relation to scan */
198 RelFileLocator ps_indexlocator; /* physical index relation to scan */
199 Size ps_offset_ins; /* Offset to SharedIndexScanInstrumentation */
200 Size ps_offset_am; /* Offset to am-specific structure */
203
204struct TupleTableSlot;
205
206/* Struct for storage-or-index scans of system tables */
207typedef struct SysScanDescData
208{
209 Relation heap_rel; /* catalog being scanned */
210 Relation irel; /* NULL if doing heap scan */
211 struct TableScanDescData *scan; /* only valid in storage-scan case */
212 struct IndexScanDescData *iscan; /* only valid in index-scan case */
213 struct SnapshotData *snapshot; /* snapshot to unregister at end of scan */
216
217#endif /* RELSCAN_H */
uint32 BlockNumber
Definition: block.h:31
#define FLEXIBLE_ARRAY_MEMBER
Definition: c.h:434
uint64_t uint64
Definition: c.h:503
uint32_t uint32
Definition: c.h:502
size_t Size
Definition: c.h:576
uintptr_t Datum
Definition: postgres.h:69
struct ParallelBlockTableScanWorkerData ParallelBlockTableScanWorkerData
struct ParallelBlockTableScanDescData * ParallelBlockTableScanDesc
Definition: relscan.h:102
struct IndexScanDescData IndexScanDescData
struct ParallelTableScanDescData ParallelTableScanDescData
struct ParallelTableScanDescData * ParallelTableScanDesc
Definition: relscan.h:87
struct IndexFetchTableData IndexFetchTableData
struct SysScanDescData SysScanDescData
struct ParallelBlockTableScanDescData ParallelBlockTableScanDescData
struct TableScanDescData * TableScanDesc
Definition: relscan.h:69
struct TableScanDescData TableScanDescData
struct ParallelIndexScanDescData ParallelIndexScanDescData
struct ParallelBlockTableScanWorkerData * ParallelBlockTableScanWorker
Definition: relscan.h:114
struct ScanKeyData * keyData
Definition: relscan.h:141
bool xs_heap_continue
Definition: relscan.h:173
struct ScanKeyData * orderByData
Definition: relscan.h:142
HeapTuple xs_hitup
Definition: relscan.h:169
struct ParallelIndexScanDescData * parallel_scan
Definition: relscan.h:191
bool * xs_orderbynulls
Definition: relscan.h:187
bool ignore_killed_tuples
Definition: relscan.h:148
IndexFetchTableData * xs_heapfetch
Definition: relscan.h:175
int numberOfOrderBys
Definition: relscan.h:140
bool xactStartedInRecovery
Definition: relscan.h:149
bool xs_recheckorderby
Definition: relscan.h:188
struct IndexScanInstrumentation * instrument
Definition: relscan.h:159
IndexTuple xs_itup
Definition: relscan.h:167
bool kill_prior_tuple
Definition: relscan.h:147
struct TupleDescData * xs_hitupdesc
Definition: relscan.h:170
struct TupleDescData * xs_itupdesc
Definition: relscan.h:168
Relation indexRelation
Definition: relscan.h:137
ItemPointerData xs_heaptid
Definition: relscan.h:172
struct SnapshotData * xs_snapshot
Definition: relscan.h:138
Relation heapRelation
Definition: relscan.h:136
Datum * xs_orderbyvals
Definition: relscan.h:186
pg_atomic_uint64 phs_nallocated
Definition: relscan.h:99
ParallelTableScanDescData base
Definition: relscan.h:94
RelFileLocator ps_indexlocator
Definition: relscan.h:198
RelFileLocator ps_locator
Definition: relscan.h:197
char ps_snapshot_data[FLEXIBLE_ARRAY_MEMBER]
Definition: relscan.h:201
RelFileLocator phs_locator
Definition: relscan.h:82
Relation irel
Definition: relscan.h:210
Relation heap_rel
Definition: relscan.h:209
struct SnapshotData * snapshot
Definition: relscan.h:213
struct IndexScanDescData * iscan
Definition: relscan.h:212
struct TupleTableSlot * slot
Definition: relscan.h:214
struct TableScanDescData * scan
Definition: relscan.h:211
TBMIterator rs_tbmiterator
Definition: relscan.h:47
Relation rs_rd
Definition: relscan.h:36
ItemPointerData rs_mintid
Definition: relscan.h:55
union TableScanDescData::@49 st
ItemPointerData rs_maxtid
Definition: relscan.h:56
uint32 rs_flags
Definition: relscan.h:64
struct TableScanDescData::@49::@50 tidrange
struct ScanKeyData * rs_key
Definition: relscan.h:39
struct SnapshotData * rs_snapshot
Definition: relscan.h:37
struct ParallelTableScanDescData * rs_parallel
Definition: relscan.h:66