PostgreSQL Source Code git master
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Pages
blutils.c
Go to the documentation of this file.
1/*-------------------------------------------------------------------------
2 *
3 * blutils.c
4 * Bloom index utilities.
5 *
6 * Portions Copyright (c) 2016-2024, PostgreSQL Global Development Group
7 * Portions Copyright (c) 1990-1993, Regents of the University of California
8 *
9 * IDENTIFICATION
10 * contrib/bloom/blutils.c
11 *
12 *-------------------------------------------------------------------------
13 */
14#include "postgres.h"
15
16#include "access/amapi.h"
17#include "access/generic_xlog.h"
18#include "access/reloptions.h"
19#include "bloom.h"
20#include "commands/vacuum.h"
21#include "storage/bufmgr.h"
22#include "storage/indexfsm.h"
23#include "utils/memutils.h"
24#include "varatt.h"
25
26/* Signature dealing macros - note i is assumed to be of type int */
27#define GETWORD(x,i) ( *( (BloomSignatureWord *)(x) + ( (i) / SIGNWORDBITS ) ) )
28#define CLRBIT(x,i) GETWORD(x,i) &= ~( 0x01 << ( (i) % SIGNWORDBITS ) )
29#define SETBIT(x,i) GETWORD(x,i) |= ( 0x01 << ( (i) % SIGNWORDBITS ) )
30#define GETBIT(x,i) ( (GETWORD(x,i) >> ( (i) % SIGNWORDBITS )) & 0x01 )
31
33
34/* Kind of relation options for bloom index */
36
37/* parse table for fillRelOptions */
39
40static int32 myRand(void);
41static void mySrand(uint32 seed);
42
43/*
44 * Module initialize function: initialize info about Bloom relation options.
45 *
46 * Note: keep this in sync with makeDefaultBloomOptions().
47 */
48void
50{
51 int i;
52 char buf[16];
53
55
56 /* Option for length of signature */
58 "Length of signature in bits",
61 bl_relopt_tab[0].optname = "length";
63 bl_relopt_tab[0].offset = offsetof(BloomOptions, bloomLength);
64
65 /* Number of bits for each possible index column: col1, col2, ... */
66 for (i = 0; i < INDEX_MAX_KEYS; i++)
67 {
68 snprintf(buf, sizeof(buf), "col%d", i + 1);
70 "Number of bits generated for each index column",
74 buf);
76 bl_relopt_tab[i + 1].offset = offsetof(BloomOptions, bitSize[0]) + sizeof(int) * i;
77 }
78}
79
80/*
81 * Construct a default set of Bloom options.
82 */
83static BloomOptions *
85{
87 int i;
88
90 /* Convert DEFAULT_BLOOM_LENGTH from # of bits to # of words */
91 opts->bloomLength = (DEFAULT_BLOOM_LENGTH + SIGNWORDBITS - 1) / SIGNWORDBITS;
92 for (i = 0; i < INDEX_MAX_KEYS; i++)
93 opts->bitSize[i] = DEFAULT_BLOOM_BITS;
95 return opts;
96}
97
98/*
99 * Bloom handler function: return IndexAmRoutine with access method parameters
100 * and callbacks.
101 */
102Datum
104{
106
107 amroutine->amstrategies = BLOOM_NSTRATEGIES;
108 amroutine->amsupport = BLOOM_NPROC;
110 amroutine->amcanorder = false;
111 amroutine->amcanorderbyop = false;
112 amroutine->amcanbackward = false;
113 amroutine->amcanunique = false;
114 amroutine->amcanmulticol = true;
115 amroutine->amoptionalkey = true;
116 amroutine->amsearcharray = false;
117 amroutine->amsearchnulls = false;
118 amroutine->amstorage = false;
119 amroutine->amclusterable = false;
120 amroutine->ampredlocks = false;
121 amroutine->amcanparallel = false;
122 amroutine->amcanbuildparallel = false;
123 amroutine->amcaninclude = false;
124 amroutine->amusemaintenanceworkmem = false;
125 amroutine->amparallelvacuumoptions =
127 amroutine->amkeytype = InvalidOid;
128
129 amroutine->ambuild = blbuild;
130 amroutine->ambuildempty = blbuildempty;
131 amroutine->aminsert = blinsert;
132 amroutine->aminsertcleanup = NULL;
133 amroutine->ambulkdelete = blbulkdelete;
134 amroutine->amvacuumcleanup = blvacuumcleanup;
135 amroutine->amcanreturn = NULL;
136 amroutine->amcostestimate = blcostestimate;
137 amroutine->amgettreeheight = NULL;
138 amroutine->amoptions = bloptions;
139 amroutine->amproperty = NULL;
140 amroutine->ambuildphasename = NULL;
141 amroutine->amvalidate = blvalidate;
142 amroutine->amadjustmembers = NULL;
143 amroutine->ambeginscan = blbeginscan;
144 amroutine->amrescan = blrescan;
145 amroutine->amgettuple = NULL;
146 amroutine->amgetbitmap = blgetbitmap;
147 amroutine->amendscan = blendscan;
148 amroutine->ammarkpos = NULL;
149 amroutine->amrestrpos = NULL;
150 amroutine->amestimateparallelscan = NULL;
151 amroutine->aminitparallelscan = NULL;
152 amroutine->amparallelrescan = NULL;
153
154 PG_RETURN_POINTER(amroutine);
155}
156
157/*
158 * Fill BloomState structure for particular index.
159 */
160void
162{
163 int i;
164
165 state->nColumns = index->rd_att->natts;
166
167 /* Initialize hash function for each attribute */
168 for (i = 0; i < index->rd_att->natts; i++)
169 {
170 fmgr_info_copy(&(state->hashFn[i]),
173 state->collations[i] = index->rd_indcollation[i];
174 }
175
176 /* Initialize amcache if needed with options from metapage */
177 if (!index->rd_amcache)
178 {
179 Buffer buffer;
180 Page page;
181 BloomMetaPageData *meta;
183
184 opts = MemoryContextAlloc(index->rd_indexcxt, sizeof(BloomOptions));
185
188
189 page = BufferGetPage(buffer);
190
191 if (!BloomPageIsMeta(page))
192 elog(ERROR, "Relation is not a bloom index");
193 meta = BloomPageGetMeta(BufferGetPage(buffer));
194
196 elog(ERROR, "Relation is not a bloom index");
197
198 *opts = meta->opts;
199
200 UnlockReleaseBuffer(buffer);
201
202 index->rd_amcache = opts;
203 }
204
205 memcpy(&state->opts, index->rd_amcache, sizeof(state->opts));
206 state->sizeOfBloomTuple = BLOOMTUPLEHDRSZ +
207 sizeof(BloomSignatureWord) * state->opts.bloomLength;
208}
209
210/*
211 * Random generator copied from FreeBSD. Using own random generator here for
212 * two reasons:
213 *
214 * 1) In this case random numbers are used for on-disk storage. Usage of
215 * PostgreSQL number generator would obstruct it from all possible changes.
216 * 2) Changing seed of PostgreSQL random generator would be undesirable side
217 * effect.
218 */
219static int32 next;
220
221static int32
223{
224 /*----------
225 * Compute x = (7^5 * x) mod (2^31 - 1)
226 * without overflowing 31 bits:
227 * (2^31 - 1) = 127773 * (7^5) + 2836
228 * From "Random number generators: good ones are hard to find",
229 * Park and Miller, Communications of the ACM, vol. 31, no. 10,
230 * October 1988, p. 1195.
231 *----------
232 */
233 int32 hi,
234 lo,
235 x;
236
237 /* Must be in [1, 0x7ffffffe] range at this point. */
238 hi = next / 127773;
239 lo = next % 127773;
240 x = 16807 * lo - 2836 * hi;
241 if (x < 0)
242 x += 0x7fffffff;
243 next = x;
244 /* Transform to [0, 0x7ffffffd] range. */
245 return (x - 1);
246}
247
248static void
250{
251 next = seed;
252 /* Transform to [1, 0x7ffffffe] range. */
253 next = (next % 0x7ffffffe) + 1;
254}
255
256/*
257 * Add bits of given value to the signature.
258 */
259void
261{
262 uint32 hashVal;
263 int nBit,
264 j;
265
266 /*
267 * init generator with "column's" number to get "hashed" seed for new
268 * value. We don't want to map the same numbers from different columns
269 * into the same bits!
270 */
271 mySrand(attno);
272
273 /*
274 * Init hash sequence to map our value into bits. the same values in
275 * different columns will be mapped into different bits because of step
276 * above
277 */
278 hashVal = DatumGetInt32(FunctionCall1Coll(&state->hashFn[attno], state->collations[attno], value));
279 mySrand(hashVal ^ myRand());
280
281 for (j = 0; j < state->opts.bitSize[attno]; j++)
282 {
283 /* prevent multiple evaluation in SETBIT macro */
284 nBit = myRand() % (state->opts.bloomLength * SIGNWORDBITS);
285 SETBIT(sign, nBit);
286 }
287}
288
289/*
290 * Make bloom tuple from values.
291 */
294{
295 int i;
296 BloomTuple *res = (BloomTuple *) palloc0(state->sizeOfBloomTuple);
297
298 res->heapPtr = *iptr;
299
300 /* Blooming each column */
301 for (i = 0; i < state->nColumns; i++)
302 {
303 /* skip nulls */
304 if (isnull[i])
305 continue;
306
307 signValue(state, res->sign, values[i], i);
308 }
309
310 return res;
311}
312
313/*
314 * Add new bloom tuple to the page. Returns true if new tuple was successfully
315 * added to the page. Returns false if it doesn't fit on the page.
316 */
317bool
319{
320 BloomTuple *itup;
321 BloomPageOpaque opaque;
322 Pointer ptr;
323
324 /* We shouldn't be pointed to an invalid page */
325 Assert(!PageIsNew(page) && !BloomPageIsDeleted(page));
326
327 /* Does new tuple fit on the page? */
328 if (BloomPageGetFreeSpace(state, page) < state->sizeOfBloomTuple)
329 return false;
330
331 /* Copy new tuple to the end of page */
332 opaque = BloomPageGetOpaque(page);
333 itup = BloomPageGetTuple(state, page, opaque->maxoff + 1);
334 memcpy((Pointer) itup, (Pointer) tuple, state->sizeOfBloomTuple);
335
336 /* Adjust maxoff and pd_lower */
337 opaque->maxoff++;
338 ptr = (Pointer) BloomPageGetTuple(state, page, opaque->maxoff + 1);
339 ((PageHeader) page)->pd_lower = ptr - page;
340
341 /* Assert we didn't overrun available space */
342 Assert(((PageHeader) page)->pd_lower <= ((PageHeader) page)->pd_upper);
343
344 return true;
345}
346
347/*
348 * Allocate a new page (either by recycling, or by extending the index file)
349 * The returned buffer is already pinned and exclusive-locked
350 * Caller is responsible for initializing the page by calling BloomInitPage
351 */
352Buffer
354{
355 Buffer buffer;
356
357 /* First, try to get a page from FSM */
358 for (;;)
359 {
361
362 if (blkno == InvalidBlockNumber)
363 break;
364
365 buffer = ReadBuffer(index, blkno);
366
367 /*
368 * We have to guard against the possibility that someone else already
369 * recycled this page; the buffer may be locked if so.
370 */
371 if (ConditionalLockBuffer(buffer))
372 {
373 Page page = BufferGetPage(buffer);
374
375 if (PageIsNew(page))
376 return buffer; /* OK to use, if never initialized */
377
378 if (BloomPageIsDeleted(page))
379 return buffer; /* OK to use */
380
382 }
383
384 /* Can't use it, so release buffer and try again */
385 ReleaseBuffer(buffer);
386 }
387
388 /* Must extend the file */
391
392 return buffer;
393}
394
395/*
396 * Initialize any page of a bloom index.
397 */
398void
400{
401 BloomPageOpaque opaque;
402
403 PageInit(page, BLCKSZ, sizeof(BloomPageOpaqueData));
404
405 opaque = BloomPageGetOpaque(page);
406 opaque->flags = flags;
408}
409
410/*
411 * Fill in metapage for bloom index.
412 */
413void
415{
417 BloomMetaPageData *metadata;
418
419 /*
420 * Choose the index's options. If reloptions have been assigned, use
421 * those, otherwise create default options.
422 */
423 opts = (BloomOptions *) index->rd_options;
424 if (!opts)
426
427 /*
428 * Initialize contents of meta page, including a copy of the options,
429 * which are now frozen for the life of the index.
430 */
431 BloomInitPage(metaPage, BLOOM_META);
432 metadata = BloomPageGetMeta(metaPage);
433 memset(metadata, 0, sizeof(BloomMetaPageData));
435 metadata->opts = *opts;
436 ((PageHeader) metaPage)->pd_lower += sizeof(BloomMetaPageData);
437
438 /* If this fails, probably FreeBlockNumberArray size calc is wrong: */
439 Assert(((PageHeader) metaPage)->pd_lower <= ((PageHeader) metaPage)->pd_upper);
440}
441
442/*
443 * Initialize metapage for bloom index.
444 */
445void
447{
448 Buffer metaBuffer;
449 Page metaPage;
451
452 /*
453 * Make a new page; since it is first page it should be associated with
454 * block number 0 (BLOOM_METAPAGE_BLKNO). No need to hold the extension
455 * lock because there cannot be concurrent inserters yet.
456 */
457 metaBuffer = ReadBufferExtended(index, forknum, P_NEW, RBM_NORMAL, NULL);
460
461 /* Initialize contents of meta page */
463 metaPage = GenericXLogRegisterBuffer(state, metaBuffer,
465 BloomFillMetapage(index, metaPage);
467
468 UnlockReleaseBuffer(metaBuffer);
469}
470
471/*
472 * Parse reloptions for bloom index, producing a BloomOptions struct.
473 */
474bytea *
475bloptions(Datum reloptions, bool validate)
476{
477 BloomOptions *rdopts;
478
479 /* Parse the user-given reloptions */
480 rdopts = (BloomOptions *) build_reloptions(reloptions, validate,
482 sizeof(BloomOptions),
485
486 /* Convert signature length from # of bits to # to words, rounding up */
487 if (rdopts)
488 rdopts->bloomLength = (rdopts->bloomLength + SIGNWORDBITS - 1) / SIGNWORDBITS;
489
490 return (bytea *) rdopts;
491}
void blcostestimate(PlannerInfo *root, IndexPath *path, double loop_count, Cost *indexStartupCost, Cost *indexTotalCost, Selectivity *indexSelectivity, double *indexCorrelation, double *indexPages)
Definition: blcost.c:22
void blbuildempty(Relation index)
Definition: blinsert.c:162
IndexBuildResult * blbuild(Relation heap, Relation index, IndexInfo *indexInfo)
Definition: blinsert.c:119
bool blinsert(Relation index, Datum *values, bool *isnull, ItemPointer ht_ctid, Relation heapRel, IndexUniqueCheck checkUnique, bool indexUnchanged, IndexInfo *indexInfo)
Definition: blinsert.c:172
uint32 BlockNumber
Definition: block.h:31
#define InvalidBlockNumber
Definition: block.h:33
#define BloomPageGetOpaque(page)
Definition: bloom.h:60
#define BLOOMTUPLEHDRSZ
Definition: bloom.h:163
#define SIGNWORDBITS
Definition: bloom.h:86
#define BloomPageGetFreeSpace(state, page)
Definition: bloom.h:149
bool blvalidate(Oid opclassoid)
Definition: blvalidate.c:30
#define BLOOM_PAGE_ID
Definition: bloom.h:57
int64 blgetbitmap(IndexScanDesc scan, TIDBitmap *tbm)
Definition: blscan.c:75
#define BloomPageGetMeta(page)
Definition: bloom.h:133
IndexScanDesc blbeginscan(Relation r, int nkeys, int norderbys)
Definition: blscan.c:25
#define DEFAULT_BLOOM_BITS
Definition: bloom.h:97
#define BLOOM_HASH_PROC
Definition: bloom.h:24
struct BloomMetaPageData BloomMetaPageData
#define BLOOM_MAGICK_NUMBER
Definition: bloom.h:128
IndexBulkDeleteResult * blbulkdelete(IndexVacuumInfo *info, IndexBulkDeleteResult *stats, IndexBulkDeleteCallback callback, void *callback_state)
Definition: blvacuum.c:30
#define BLOOM_NPROC
Definition: bloom.h:26
#define BloomPageGetTuple(state, page, offset)
Definition: bloom.h:71
#define BLOOM_NSTRATEGIES
Definition: bloom.h:30
IndexBulkDeleteResult * blvacuumcleanup(IndexVacuumInfo *info, IndexBulkDeleteResult *stats)
Definition: blvacuum.c:165
#define BLOOM_OPTIONS_PROC
Definition: bloom.h:25
uint16 BloomSignatureWord
Definition: bloom.h:84
#define BloomPageIsDeleted(page)
Definition: bloom.h:64
#define DEFAULT_BLOOM_LENGTH
Definition: bloom.h:91
#define BLOOM_META
Definition: bloom.h:46
#define MAX_BLOOM_BITS
Definition: bloom.h:98
void blendscan(IndexScanDesc scan)
Definition: blscan.c:62
#define MAX_BLOOM_LENGTH
Definition: bloom.h:92
#define BLOOM_METAPAGE_BLKNO
Definition: bloom.h:78
#define BloomPageIsMeta(page)
Definition: bloom.h:62
void blrescan(IndexScanDesc scan, ScanKey scankey, int nscankeys, ScanKey orderbys, int norderbys)
Definition: blscan.c:45
static int32 next
Definition: blutils.c:219
static int32 myRand(void)
Definition: blutils.c:222
void BloomInitPage(Page page, uint16 flags)
Definition: blutils.c:399
void _PG_init(void)
Definition: blutils.c:49
Datum blhandler(PG_FUNCTION_ARGS)
Definition: blutils.c:103
BloomTuple * BloomFormTuple(BloomState *state, ItemPointer iptr, Datum *values, bool *isnull)
Definition: blutils.c:293
PG_FUNCTION_INFO_V1(blhandler)
static BloomOptions * makeDefaultBloomOptions(void)
Definition: blutils.c:84
bool BloomPageAddItem(BloomState *state, Page page, BloomTuple *tuple)
Definition: blutils.c:318
static relopt_kind bl_relopt_kind
Definition: blutils.c:35
Buffer BloomNewBuffer(Relation index)
Definition: blutils.c:353
void BloomFillMetapage(Relation index, Page metaPage)
Definition: blutils.c:414
void BloomInitMetapage(Relation index, ForkNumber forknum)
Definition: blutils.c:446
bytea * bloptions(Datum reloptions, bool validate)
Definition: blutils.c:475
#define SETBIT(x, i)
Definition: blutils.c:29
void signValue(BloomState *state, BloomSignatureWord *sign, Datum value, int attno)
Definition: blutils.c:260
static void mySrand(uint32 seed)
Definition: blutils.c:249
void initBloomState(BloomState *state, Relation index)
Definition: blutils.c:161
static relopt_parse_elt bl_relopt_tab[INDEX_MAX_KEYS+1]
Definition: blutils.c:38
static Datum values[MAXATTR]
Definition: bootstrap.c:151
int Buffer
Definition: buf.h:23
BlockNumber BufferGetBlockNumber(Buffer buffer)
Definition: bufmgr.c:3724
Buffer ExtendBufferedRel(BufferManagerRelation bmr, ForkNumber forkNum, BufferAccessStrategy strategy, uint32 flags)
Definition: bufmgr.c:846
bool ConditionalLockBuffer(Buffer buffer)
Definition: bufmgr.c:5184
void ReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:4924
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:4941
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:5158
Buffer ReadBufferExtended(Relation reln, ForkNumber forkNum, BlockNumber blockNum, ReadBufferMode mode, BufferAccessStrategy strategy)
Definition: bufmgr.c:793
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:746
#define BUFFER_LOCK_UNLOCK
Definition: bufmgr.h:189
#define BUFFER_LOCK_SHARE
Definition: bufmgr.h:190
#define P_NEW
Definition: bufmgr.h:184
static Page BufferGetPage(Buffer buffer)
Definition: bufmgr.h:400
@ EB_LOCK_FIRST
Definition: bufmgr.h:86
#define BUFFER_LOCK_EXCLUSIVE
Definition: bufmgr.h:191
@ RBM_NORMAL
Definition: bufmgr.h:45
#define BMR_REL(p_rel)
Definition: bufmgr.h:107
void PageInit(Page page, Size pageSize, Size specialSize)
Definition: bufpage.c:42
PageHeaderData * PageHeader
Definition: bufpage.h:173
Pointer Page
Definition: bufpage.h:81
static bool PageIsNew(Page page)
Definition: bufpage.h:233
char * Pointer
Definition: c.h:476
#define Assert(condition)
Definition: c.h:812
int32_t int32
Definition: c.h:481
uint16_t uint16
Definition: c.h:484
uint32_t uint32
Definition: c.h:485
#define lengthof(array)
Definition: c.h:742
#define ERROR
Definition: elog.h:39
#define elog(elevel,...)
Definition: elog.h:225
Datum FunctionCall1Coll(FmgrInfo *flinfo, Oid collation, Datum arg1)
Definition: fmgr.c:1129
void fmgr_info_copy(FmgrInfo *dstinfo, FmgrInfo *srcinfo, MemoryContext destcxt)
Definition: fmgr.c:580
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:361
#define PG_FUNCTION_ARGS
Definition: fmgr.h:193
Page GenericXLogRegisterBuffer(GenericXLogState *state, Buffer buffer, int flags)
Definition: generic_xlog.c:299
GenericXLogState * GenericXLogStart(Relation relation)
Definition: generic_xlog.c:269
XLogRecPtr GenericXLogFinish(GenericXLogState *state)
Definition: generic_xlog.c:337
#define GENERIC_XLOG_FULL_IMAGE
Definition: generic_xlog.h:26
FmgrInfo * index_getprocinfo(Relation irel, AttrNumber attnum, uint16 procnum)
Definition: indexam.c:862
BlockNumber GetFreeIndexPage(Relation rel)
Definition: indexfsm.c:38
static struct @161 value
char sign
Definition: informix.c:693
int x
Definition: isn.c:70
int j
Definition: isn.c:73
int i
Definition: isn.c:72
if(TABLE==NULL||TABLE_index==NULL)
Definition: isn.c:76
#define AccessExclusiveLock
Definition: lockdefs.h:43
char * MemoryContextStrdup(MemoryContext context, const char *string)
Definition: mcxt.c:1683
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:1181
void * palloc0(Size size)
Definition: mcxt.c:1347
MemoryContext TopMemoryContext
Definition: mcxt.c:149
MemoryContext CurrentMemoryContext
Definition: mcxt.c:143
#define makeNode(_type_)
Definition: nodes.h:155
static AmcheckOptions opts
Definition: pg_amcheck.c:112
#define INDEX_MAX_KEYS
static char * buf
Definition: pg_test_fsync.c:72
#define snprintf
Definition: port.h:238
uintptr_t Datum
Definition: postgres.h:64
static int32 DatumGetInt32(Datum X)
Definition: postgres.h:202
#define InvalidOid
Definition: postgres_ext.h:36
void add_int_reloption(bits32 kinds, const char *name, const char *desc, int default_val, int min_val, int max_val, LOCKMODE lockmode)
Definition: reloptions.c:901
void * build_reloptions(Datum reloptions, bool validate, relopt_kind kind, Size relopt_struct_size, const relopt_parse_elt *relopt_elems, int num_relopt_elems)
Definition: reloptions.c:1908
relopt_kind add_reloption_kind(void)
Definition: reloptions.c:683
relopt_kind
Definition: reloptions.h:40
@ RELOPT_TYPE_INT
Definition: reloptions.h:32
ForkNumber
Definition: relpath.h:56
@ MAIN_FORKNUM
Definition: relpath.h:58
BloomOptions opts
Definition: bloom.h:123
uint32 magickNumber
Definition: bloom.h:120
int bloomLength
Definition: bloom.h:104
OffsetNumber maxoff
Definition: bloom.h:35
uint16 flags
Definition: bloom.h:36
uint16 bloom_page_id
Definition: bloom.h:40
ambuildphasename_function ambuildphasename
Definition: amapi.h:289
ambuildempty_function ambuildempty
Definition: amapi.h:279
amvacuumcleanup_function amvacuumcleanup
Definition: amapi.h:283
bool amclusterable
Definition: amapi.h:253
amoptions_function amoptions
Definition: amapi.h:287
amestimateparallelscan_function amestimateparallelscan
Definition: amapi.h:301
amrestrpos_function amrestrpos
Definition: amapi.h:298
aminsert_function aminsert
Definition: amapi.h:280
amendscan_function amendscan
Definition: amapi.h:296
uint16 amoptsprocnum
Definition: amapi.h:233
amparallelrescan_function amparallelrescan
Definition: amapi.h:303
Oid amkeytype
Definition: amapi.h:269
bool ampredlocks
Definition: amapi.h:255
uint16 amsupport
Definition: amapi.h:231
amcostestimate_function amcostestimate
Definition: amapi.h:285
bool amcanorderbyop
Definition: amapi.h:237
amadjustmembers_function amadjustmembers
Definition: amapi.h:291
ambuild_function ambuild
Definition: amapi.h:278
bool amstorage
Definition: amapi.h:251
uint16 amstrategies
Definition: amapi.h:229
bool amoptionalkey
Definition: amapi.h:245
amgettuple_function amgettuple
Definition: amapi.h:294
amcanreturn_function amcanreturn
Definition: amapi.h:284
bool amcanunique
Definition: amapi.h:241
amgetbitmap_function amgetbitmap
Definition: amapi.h:295
amproperty_function amproperty
Definition: amapi.h:288
ambulkdelete_function ambulkdelete
Definition: amapi.h:282
bool amsearcharray
Definition: amapi.h:247
amvalidate_function amvalidate
Definition: amapi.h:290
ammarkpos_function ammarkpos
Definition: amapi.h:297
bool amcanmulticol
Definition: amapi.h:243
bool amusemaintenanceworkmem
Definition: amapi.h:263
ambeginscan_function ambeginscan
Definition: amapi.h:292
bool amcanparallel
Definition: amapi.h:257
amrescan_function amrescan
Definition: amapi.h:293
bool amcanorder
Definition: amapi.h:235
bool amcanbuildparallel
Definition: amapi.h:259
aminitparallelscan_function aminitparallelscan
Definition: amapi.h:302
uint8 amparallelvacuumoptions
Definition: amapi.h:267
aminsertcleanup_function aminsertcleanup
Definition: amapi.h:281
bool amcanbackward
Definition: amapi.h:239
amgettreeheight_function amgettreeheight
Definition: amapi.h:286
bool amcaninclude
Definition: amapi.h:261
bool amsearchnulls
Definition: amapi.h:249
Definition: type.h:96
const char * optname
Definition: reloptions.h:152
relopt_type opttype
Definition: reloptions.h:153
Definition: regguts.h:323
Definition: c.h:641
#define VACUUM_OPTION_PARALLEL_CLEANUP
Definition: vacuum.h:63
#define VACUUM_OPTION_PARALLEL_BULKDEL
Definition: vacuum.h:48
#define SET_VARSIZE(PTR, len)
Definition: varatt.h:305