PostgreSQL Source Code  git master
nbtree.h
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * nbtree.h
4  * header file for postgres btree access method implementation.
5  *
6  *
7  * Portions Copyright (c) 1996-2022, PostgreSQL Global Development Group
8  * Portions Copyright (c) 1994, Regents of the University of California
9  *
10  * src/include/access/nbtree.h
11  *
12  *-------------------------------------------------------------------------
13  */
14 #ifndef NBTREE_H
15 #define NBTREE_H
16 
17 #include "access/amapi.h"
18 #include "access/itup.h"
19 #include "access/sdir.h"
20 #include "access/tableam.h"
21 #include "access/xlogreader.h"
22 #include "catalog/pg_am_d.h"
23 #include "catalog/pg_index.h"
24 #include "lib/stringinfo.h"
25 #include "storage/bufmgr.h"
26 #include "storage/shm_toc.h"
27 
28 /* There's room for a 16-bit vacuum cycle ID in BTPageOpaqueData */
29 typedef uint16 BTCycleId;
30 
31 /*
32  * BTPageOpaqueData -- At the end of every page, we store a pointer
33  * to both siblings in the tree. This is used to do forward/backward
34  * index scans. The next-page link is also critical for recovery when
35  * a search has navigated to the wrong page due to concurrent page splits
36  * or deletions; see src/backend/access/nbtree/README for more info.
37  *
38  * In addition, we store the page's btree level (counting upwards from
39  * zero at a leaf page) as well as some flag bits indicating the page type
40  * and status. If the page is deleted, a BTDeletedPageData struct is stored
41  * in the page's tuple area, while a standard BTPageOpaqueData struct is
42  * stored in the page special area.
43  *
44  * We also store a "vacuum cycle ID". When a page is split while VACUUM is
45  * processing the index, a nonzero value associated with the VACUUM run is
46  * stored into both halves of the split page. (If VACUUM is not running,
47  * both pages receive zero cycleids.) This allows VACUUM to detect whether
48  * a page was split since it started, with a small probability of false match
49  * if the page was last split some exact multiple of MAX_BT_CYCLE_ID VACUUMs
50  * ago. Also, during a split, the BTP_SPLIT_END flag is cleared in the left
51  * (original) page, and set in the right page, but only if the next page
52  * to its right has a different cycleid.
53  *
54  * NOTE: the BTP_LEAF flag bit is redundant since level==0 could be tested
55  * instead.
56  *
57  * NOTE: the btpo_level field used to be a union type in order to allow
58  * deleted pages to store a 32-bit safexid in the same field. We now store
59  * 64-bit/full safexid values using BTDeletedPageData instead.
60  */
61 
62 typedef struct BTPageOpaqueData
63 {
64  BlockNumber btpo_prev; /* left sibling, or P_NONE if leftmost */
65  BlockNumber btpo_next; /* right sibling, or P_NONE if rightmost */
66  uint32 btpo_level; /* tree level --- zero for leaf pages */
67  uint16 btpo_flags; /* flag bits, see below */
68  BTCycleId btpo_cycleid; /* vacuum cycle ID of latest split */
70 
72 
73 #define BTPageGetOpaque(page) ((BTPageOpaque) PageGetSpecialPointer(page))
74 
75 /* Bits defined in btpo_flags */
76 #define BTP_LEAF (1 << 0) /* leaf page, i.e. not internal page */
77 #define BTP_ROOT (1 << 1) /* root page (has no parent) */
78 #define BTP_DELETED (1 << 2) /* page has been deleted from tree */
79 #define BTP_META (1 << 3) /* meta-page */
80 #define BTP_HALF_DEAD (1 << 4) /* empty, but still in tree */
81 #define BTP_SPLIT_END (1 << 5) /* rightmost page of split group */
82 #define BTP_HAS_GARBAGE (1 << 6) /* page has LP_DEAD tuples (deprecated) */
83 #define BTP_INCOMPLETE_SPLIT (1 << 7) /* right sibling's downlink is missing */
84 #define BTP_HAS_FULLXID (1 << 8) /* contains BTDeletedPageData */
85 
86 /*
87  * The max allowed value of a cycle ID is a bit less than 64K. This is
88  * for convenience of pg_filedump and similar utilities: we want to use
89  * the last 2 bytes of special space as an index type indicator, and
90  * restricting cycle ID lets btree use that space for vacuum cycle IDs
91  * while still allowing index type to be identified.
92  */
93 #define MAX_BT_CYCLE_ID 0xFF7F
94 
95 
96 /*
97  * The Meta page is always the first page in the btree index.
98  * Its primary purpose is to point to the location of the btree root page.
99  * We also point to the "fast" root, which is the current effective root;
100  * see README for discussion.
101  */
102 
103 typedef struct BTMetaPageData
104 {
105  uint32 btm_magic; /* should contain BTREE_MAGIC */
106  uint32 btm_version; /* nbtree version (always <= BTREE_VERSION) */
107  BlockNumber btm_root; /* current root location */
108  uint32 btm_level; /* tree level of the root page */
109  BlockNumber btm_fastroot; /* current "fast" root location */
110  uint32 btm_fastlevel; /* tree level of the "fast" root page */
111  /* remaining fields only valid when btm_version >= BTREE_NOVAC_VERSION */
112 
113  /* number of deleted, non-recyclable pages during last cleanup */
115  /* number of heap tuples during last cleanup (deprecated) */
117 
118  bool btm_allequalimage; /* are all columns "equalimage"? */
120 
121 #define BTPageGetMeta(p) \
122  ((BTMetaPageData *) PageGetContents(p))
123 
124 /*
125  * The current Btree version is 4. That's what you'll get when you create
126  * a new index.
127  *
128  * Btree version 3 was used in PostgreSQL v11. It is mostly the same as
129  * version 4, but heap TIDs were not part of the keyspace. Index tuples
130  * with duplicate keys could be stored in any order. We continue to
131  * support reading and writing Btree versions 2 and 3, so that they don't
132  * need to be immediately re-indexed at pg_upgrade. In order to get the
133  * new heapkeyspace semantics, however, a REINDEX is needed.
134  *
135  * Deduplication is safe to use when the btm_allequalimage field is set to
136  * true. It's safe to read the btm_allequalimage field on version 3, but
137  * only version 4 indexes make use of deduplication. Even version 4
138  * indexes created on PostgreSQL v12 will need a REINDEX to make use of
139  * deduplication, though, since there is no other way to set
140  * btm_allequalimage to true (pg_upgrade hasn't been taught to set the
141  * metapage field).
142  *
143  * Btree version 2 is mostly the same as version 3. There are two new
144  * fields in the metapage that were introduced in version 3. A version 2
145  * metapage will be automatically upgraded to version 3 on the first
146  * insert to it. INCLUDE indexes cannot use version 2.
147  */
148 #define BTREE_METAPAGE 0 /* first page is meta */
149 #define BTREE_MAGIC 0x053162 /* magic number in metapage */
150 #define BTREE_VERSION 4 /* current version number */
151 #define BTREE_MIN_VERSION 2 /* minimum supported version */
152 #define BTREE_NOVAC_VERSION 3 /* version with all meta fields set */
153 
154 /*
155  * Maximum size of a btree index entry, including its tuple header.
156  *
157  * We actually need to be able to fit three items on every page,
158  * so restrict any one item to 1/3 the per-page available space.
159  *
160  * There are rare cases where _bt_truncate() will need to enlarge
161  * a heap index tuple to make space for a tiebreaker heap TID
162  * attribute, which we account for here.
163  */
164 #define BTMaxItemSize(page) \
165  (MAXALIGN_DOWN((PageGetPageSize(page) - \
166  MAXALIGN(SizeOfPageHeaderData + 3*sizeof(ItemIdData)) - \
167  MAXALIGN(sizeof(BTPageOpaqueData))) / 3) - \
168  MAXALIGN(sizeof(ItemPointerData)))
169 #define BTMaxItemSizeNoHeapTid(page) \
170  MAXALIGN_DOWN((PageGetPageSize(page) - \
171  MAXALIGN(SizeOfPageHeaderData + 3*sizeof(ItemIdData)) - \
172  MAXALIGN(sizeof(BTPageOpaqueData))) / 3)
173 
174 /*
175  * MaxTIDsPerBTreePage is an upper bound on the number of heap TIDs tuples
176  * that may be stored on a btree leaf page. It is used to size the
177  * per-page temporary buffers.
178  *
179  * Note: we don't bother considering per-tuple overheads here to keep
180  * things simple (value is based on how many elements a single array of
181  * heap TIDs must have to fill the space between the page header and
182  * special area). The value is slightly higher (i.e. more conservative)
183  * than necessary as a result, which is considered acceptable.
184  */
185 #define MaxTIDsPerBTreePage \
186  (int) ((BLCKSZ - SizeOfPageHeaderData - sizeof(BTPageOpaqueData)) / \
187  sizeof(ItemPointerData))
188 
189 /*
190  * The leaf-page fillfactor defaults to 90% but is user-adjustable.
191  * For pages above the leaf level, we use a fixed 70% fillfactor.
192  * The fillfactor is applied during index build and when splitting
193  * a rightmost page; when splitting non-rightmost pages we try to
194  * divide the data equally. When splitting a page that's entirely
195  * filled with a single value (duplicates), the effective leaf-page
196  * fillfactor is 96%, regardless of whether the page is a rightmost
197  * page.
198  */
199 #define BTREE_MIN_FILLFACTOR 10
200 #define BTREE_DEFAULT_FILLFACTOR 90
201 #define BTREE_NONLEAF_FILLFACTOR 70
202 #define BTREE_SINGLEVAL_FILLFACTOR 96
203 
204 /*
205  * In general, the btree code tries to localize its knowledge about
206  * page layout to a couple of routines. However, we need a special
207  * value to indicate "no page number" in those places where we expect
208  * page numbers. We can use zero for this because we never need to
209  * make a pointer to the metadata page.
210  */
211 
212 #define P_NONE 0
213 
214 /*
215  * Macros to test whether a page is leftmost or rightmost on its tree level,
216  * as well as other state info kept in the opaque data.
217  */
218 #define P_LEFTMOST(opaque) ((opaque)->btpo_prev == P_NONE)
219 #define P_RIGHTMOST(opaque) ((opaque)->btpo_next == P_NONE)
220 #define P_ISLEAF(opaque) (((opaque)->btpo_flags & BTP_LEAF) != 0)
221 #define P_ISROOT(opaque) (((opaque)->btpo_flags & BTP_ROOT) != 0)
222 #define P_ISDELETED(opaque) (((opaque)->btpo_flags & BTP_DELETED) != 0)
223 #define P_ISMETA(opaque) (((opaque)->btpo_flags & BTP_META) != 0)
224 #define P_ISHALFDEAD(opaque) (((opaque)->btpo_flags & BTP_HALF_DEAD) != 0)
225 #define P_IGNORE(opaque) (((opaque)->btpo_flags & (BTP_DELETED|BTP_HALF_DEAD)) != 0)
226 #define P_HAS_GARBAGE(opaque) (((opaque)->btpo_flags & BTP_HAS_GARBAGE) != 0)
227 #define P_INCOMPLETE_SPLIT(opaque) (((opaque)->btpo_flags & BTP_INCOMPLETE_SPLIT) != 0)
228 #define P_HAS_FULLXID(opaque) (((opaque)->btpo_flags & BTP_HAS_FULLXID) != 0)
229 
230 /*
231  * BTDeletedPageData is the page contents of a deleted page
232  */
233 typedef struct BTDeletedPageData
234 {
235  FullTransactionId safexid; /* See BTPageIsRecyclable() */
237 
238 static inline void
240 {
241  BTPageOpaque opaque;
243  BTDeletedPageData *contents;
244 
245  opaque = BTPageGetOpaque(page);
246  header = ((PageHeader) page);
247 
248  opaque->btpo_flags &= ~BTP_HALF_DEAD;
250  header->pd_lower = MAXALIGN(SizeOfPageHeaderData) +
251  sizeof(BTDeletedPageData);
252  header->pd_upper = header->pd_special;
253 
254  /* Set safexid in deleted page */
255  contents = ((BTDeletedPageData *) PageGetContents(page));
256  contents->safexid = safexid;
257 }
258 
259 static inline FullTransactionId
261 {
262  BTPageOpaque opaque;
263  BTDeletedPageData *contents;
264 
265  /* We only expect to be called with a deleted page */
266  Assert(!PageIsNew(page));
267  opaque = BTPageGetOpaque(page);
268  Assert(P_ISDELETED(opaque));
269 
270  /* pg_upgrade'd deleted page -- must be safe to delete now */
271  if (!P_HAS_FULLXID(opaque))
273 
274  /* Get safexid from deleted page */
275  contents = ((BTDeletedPageData *) PageGetContents(page));
276  return contents->safexid;
277 }
278 
279 /*
280  * Is an existing page recyclable?
281  *
282  * This exists to centralize the policy on which deleted pages are now safe to
283  * re-use. However, _bt_pendingfsm_finalize() duplicates some of the same
284  * logic because it doesn't work directly with pages -- keep the two in sync.
285  *
286  * Note: PageIsNew() pages are always safe to recycle, but we can't deal with
287  * them here (caller is responsible for that case themselves). Caller might
288  * well need special handling for new pages anyway.
289  */
290 static inline bool
292 {
293  BTPageOpaque opaque;
294 
295  Assert(!PageIsNew(page));
296 
297  /* Recycling okay iff page is deleted and safexid is old enough */
298  opaque = BTPageGetOpaque(page);
299  if (P_ISDELETED(opaque))
300  {
301  /*
302  * The page was deleted, but when? If it was just deleted, a scan
303  * might have seen the downlink to it, and will read the page later.
304  * As long as that can happen, we must keep the deleted page around as
305  * a tombstone.
306  *
307  * For that check if the deletion XID could still be visible to
308  * anyone. If not, then no scan that's still in progress could have
309  * seen its downlink, and we can recycle it.
310  *
311  * XXX: If we had the heap relation we could be more aggressive about
312  * recycling deleted pages in non-catalog relations. For now we just
313  * pass NULL. That is at least simple and consistent.
314  */
316  }
317 
318  return false;
319 }
320 
321 /*
322  * BTVacState and BTPendingFSM are private nbtree.c state used during VACUUM.
323  * They are exported for use by page deletion related code in nbtpage.c.
324  */
325 typedef struct BTPendingFSM
326 {
327  BlockNumber target; /* Page deleted by current VACUUM */
328  FullTransactionId safexid; /* Page's BTDeletedPageData.safexid */
330 
331 typedef struct BTVacState
332 {
339 
340  /*
341  * _bt_pendingfsm_finalize() state
342  */
343  int bufsize; /* pendingpages space (in # elements) */
344  int maxbufsize; /* max bufsize that respects work_mem */
345  BTPendingFSM *pendingpages; /* One entry per newly deleted page */
346  int npendingpages; /* current # valid pendingpages */
348 
349 /*
350  * Lehman and Yao's algorithm requires a ``high key'' on every non-rightmost
351  * page. The high key is not a tuple that is used to visit the heap. It is
352  * a pivot tuple (see "Notes on B-Tree tuple format" below for definition).
353  * The high key on a page is required to be greater than or equal to any
354  * other key that appears on the page. If we find ourselves trying to
355  * insert a key that is strictly > high key, we know we need to move right
356  * (this should only happen if the page was split since we examined the
357  * parent page).
358  *
359  * Our insertion algorithm guarantees that we can use the initial least key
360  * on our right sibling as the high key. Once a page is created, its high
361  * key changes only if the page is split.
362  *
363  * On a non-rightmost page, the high key lives in item 1 and data items
364  * start in item 2. Rightmost pages have no high key, so we store data
365  * items beginning in item 1.
366  */
367 
368 #define P_HIKEY ((OffsetNumber) 1)
369 #define P_FIRSTKEY ((OffsetNumber) 2)
370 #define P_FIRSTDATAKEY(opaque) (P_RIGHTMOST(opaque) ? P_HIKEY : P_FIRSTKEY)
371 
372 /*
373  * Notes on B-Tree tuple format, and key and non-key attributes:
374  *
375  * INCLUDE B-Tree indexes have non-key attributes. These are extra
376  * attributes that may be returned by index-only scans, but do not influence
377  * the order of items in the index (formally, non-key attributes are not
378  * considered to be part of the key space). Non-key attributes are only
379  * present in leaf index tuples whose item pointers actually point to heap
380  * tuples (non-pivot tuples). _bt_check_natts() enforces the rules
381  * described here.
382  *
383  * Non-pivot tuple format (plain/non-posting variant):
384  *
385  * t_tid | t_info | key values | INCLUDE columns, if any
386  *
387  * t_tid points to the heap TID, which is a tiebreaker key column as of
388  * BTREE_VERSION 4.
389  *
390  * Non-pivot tuples complement pivot tuples, which only have key columns.
391  * The sole purpose of pivot tuples is to represent how the key space is
392  * separated. In general, any B-Tree index that has more than one level
393  * (i.e. any index that does not just consist of a metapage and a single
394  * leaf root page) must have some number of pivot tuples, since pivot
395  * tuples are used for traversing the tree. Suffix truncation can omit
396  * trailing key columns when a new pivot is formed, which makes minus
397  * infinity their logical value. Since BTREE_VERSION 4 indexes treat heap
398  * TID as a trailing key column that ensures that all index tuples are
399  * physically unique, it is necessary to represent heap TID as a trailing
400  * key column in pivot tuples, though very often this can be truncated
401  * away, just like any other key column. (Actually, the heap TID is
402  * omitted rather than truncated, since its representation is different to
403  * the non-pivot representation.)
404  *
405  * Pivot tuple format:
406  *
407  * t_tid | t_info | key values | [heap TID]
408  *
409  * We store the number of columns present inside pivot tuples by abusing
410  * their t_tid offset field, since pivot tuples never need to store a real
411  * offset (pivot tuples generally store a downlink in t_tid, though). The
412  * offset field only stores the number of columns/attributes when the
413  * INDEX_ALT_TID_MASK bit is set, which doesn't count the trailing heap
414  * TID column sometimes stored in pivot tuples -- that's represented by
415  * the presence of BT_PIVOT_HEAP_TID_ATTR. The INDEX_ALT_TID_MASK bit in
416  * t_info is always set on BTREE_VERSION 4 pivot tuples, since
417  * BTreeTupleIsPivot() must work reliably on heapkeyspace versions.
418  *
419  * In version 2 or version 3 (!heapkeyspace) indexes, INDEX_ALT_TID_MASK
420  * might not be set in pivot tuples. BTreeTupleIsPivot() won't work
421  * reliably as a result. The number of columns stored is implicitly the
422  * same as the number of columns in the index, just like any non-pivot
423  * tuple. (The number of columns stored should not vary, since suffix
424  * truncation of key columns is unsafe within any !heapkeyspace index.)
425  *
426  * The 12 least significant bits from t_tid's offset number are used to
427  * represent the number of key columns within a pivot tuple. This leaves 4
428  * status bits (BT_STATUS_OFFSET_MASK bits), which are shared by all tuples
429  * that have the INDEX_ALT_TID_MASK bit set (set in t_info) to store basic
430  * tuple metadata. BTreeTupleIsPivot() and BTreeTupleIsPosting() use the
431  * BT_STATUS_OFFSET_MASK bits.
432  *
433  * Sometimes non-pivot tuples also use a representation that repurposes
434  * t_tid to store metadata rather than a TID. PostgreSQL v13 introduced a
435  * new non-pivot tuple format to support deduplication: posting list
436  * tuples. Deduplication merges together multiple equal non-pivot tuples
437  * into a logically equivalent, space efficient representation. A posting
438  * list is an array of ItemPointerData elements. Non-pivot tuples are
439  * merged together to form posting list tuples lazily, at the point where
440  * we'd otherwise have to split a leaf page.
441  *
442  * Posting tuple format (alternative non-pivot tuple representation):
443  *
444  * t_tid | t_info | key values | posting list (TID array)
445  *
446  * Posting list tuples are recognized as such by having the
447  * INDEX_ALT_TID_MASK status bit set in t_info and the BT_IS_POSTING status
448  * bit set in t_tid's offset number. These flags redefine the content of
449  * the posting tuple's t_tid to store the location of the posting list
450  * (instead of a block number), as well as the total number of heap TIDs
451  * present in the tuple (instead of a real offset number).
452  *
453  * The 12 least significant bits from t_tid's offset number are used to
454  * represent the number of heap TIDs present in the tuple, leaving 4 status
455  * bits (the BT_STATUS_OFFSET_MASK bits). Like any non-pivot tuple, the
456  * number of columns stored is always implicitly the total number in the
457  * index (in practice there can never be non-key columns stored, since
458  * deduplication is not supported with INCLUDE indexes).
459  */
460 #define INDEX_ALT_TID_MASK INDEX_AM_RESERVED_BIT
461 
462 /* Item pointer offset bit masks */
463 #define BT_OFFSET_MASK 0x0FFF
464 #define BT_STATUS_OFFSET_MASK 0xF000
465 /* BT_STATUS_OFFSET_MASK status bits */
466 #define BT_PIVOT_HEAP_TID_ATTR 0x1000
467 #define BT_IS_POSTING 0x2000
468 
469 /*
470  * Note: BTreeTupleIsPivot() can have false negatives (but not false
471  * positives) when used with !heapkeyspace indexes
472  */
473 static inline bool
475 {
476  if ((itup->t_info & INDEX_ALT_TID_MASK) == 0)
477  return false;
478  /* absence of BT_IS_POSTING in offset number indicates pivot tuple */
480  return false;
481 
482  return true;
483 }
484 
485 static inline bool
487 {
488  if ((itup->t_info & INDEX_ALT_TID_MASK) == 0)
489  return false;
490  /* presence of BT_IS_POSTING in offset number indicates posting tuple */
492  return false;
493 
494  return true;
495 }
496 
497 static inline void
498 BTreeTupleSetPosting(IndexTuple itup, uint16 nhtids, int postingoffset)
499 {
500  Assert(nhtids > 1);
501  Assert((nhtids & BT_STATUS_OFFSET_MASK) == 0);
502  Assert((size_t) postingoffset == MAXALIGN(postingoffset));
503  Assert(postingoffset < INDEX_SIZE_MASK);
504  Assert(!BTreeTupleIsPivot(itup));
505 
506  itup->t_info |= INDEX_ALT_TID_MASK;
507  ItemPointerSetOffsetNumber(&itup->t_tid, (nhtids | BT_IS_POSTING));
508  ItemPointerSetBlockNumber(&itup->t_tid, postingoffset);
509 }
510 
511 static inline uint16
513 {
514  OffsetNumber existing;
515 
516  Assert(BTreeTupleIsPosting(posting));
517 
518  existing = ItemPointerGetOffsetNumberNoCheck(&posting->t_tid);
519  return (existing & BT_OFFSET_MASK);
520 }
521 
522 static inline uint32
524 {
525  Assert(BTreeTupleIsPosting(posting));
526 
527  return ItemPointerGetBlockNumberNoCheck(&posting->t_tid);
528 }
529 
530 static inline ItemPointer
532 {
533  return (ItemPointer) ((char *) posting +
534  BTreeTupleGetPostingOffset(posting));
535 }
536 
537 static inline ItemPointer
539 {
540  return BTreeTupleGetPosting(posting) + n;
541 }
542 
543 /*
544  * Get/set downlink block number in pivot tuple.
545  *
546  * Note: Cannot assert that tuple is a pivot tuple. If we did so then
547  * !heapkeyspace indexes would exhibit false positive assertion failures.
548  */
549 static inline BlockNumber
551 {
552  return ItemPointerGetBlockNumberNoCheck(&pivot->t_tid);
553 }
554 
555 static inline void
557 {
558  ItemPointerSetBlockNumber(&pivot->t_tid, blkno);
559 }
560 
561 /*
562  * Get number of attributes within tuple.
563  *
564  * Note that this does not include an implicit tiebreaker heap TID
565  * attribute, if any. Note also that the number of key attributes must be
566  * explicitly represented in all heapkeyspace pivot tuples.
567  *
568  * Note: This is defined as a macro rather than an inline function to
569  * avoid including rel.h.
570  */
571 #define BTreeTupleGetNAtts(itup, rel) \
572  ( \
573  (BTreeTupleIsPivot(itup)) ? \
574  ( \
575  ItemPointerGetOffsetNumberNoCheck(&(itup)->t_tid) & BT_OFFSET_MASK \
576  ) \
577  : \
578  IndexRelationGetNumberOfAttributes(rel) \
579  )
580 
581 /*
582  * Set number of key attributes in tuple.
583  *
584  * The heap TID tiebreaker attribute bit may also be set here, indicating that
585  * a heap TID value will be stored at the end of the tuple (i.e. using the
586  * special pivot tuple representation).
587  */
588 static inline void
589 BTreeTupleSetNAtts(IndexTuple itup, uint16 nkeyatts, bool heaptid)
590 {
591  Assert(nkeyatts <= INDEX_MAX_KEYS);
592  Assert((nkeyatts & BT_STATUS_OFFSET_MASK) == 0);
593  Assert(!heaptid || nkeyatts > 0);
594  Assert(!BTreeTupleIsPivot(itup) || nkeyatts == 0);
595 
596  itup->t_info |= INDEX_ALT_TID_MASK;
597 
598  if (heaptid)
599  nkeyatts |= BT_PIVOT_HEAP_TID_ATTR;
600 
601  /* BT_IS_POSTING bit is deliberately unset here */
602  ItemPointerSetOffsetNumber(&itup->t_tid, nkeyatts);
603  Assert(BTreeTupleIsPivot(itup));
604 }
605 
606 /*
607  * Get/set leaf page's "top parent" link from its high key. Used during page
608  * deletion.
609  *
610  * Note: Cannot assert that tuple is a pivot tuple. If we did so then
611  * !heapkeyspace indexes would exhibit false positive assertion failures.
612  */
613 static inline BlockNumber
615 {
616  return ItemPointerGetBlockNumberNoCheck(&leafhikey->t_tid);
617 }
618 
619 static inline void
621 {
622  ItemPointerSetBlockNumber(&leafhikey->t_tid, blkno);
623  BTreeTupleSetNAtts(leafhikey, 0, false);
624 }
625 
626 /*
627  * Get tiebreaker heap TID attribute, if any.
628  *
629  * This returns the first/lowest heap TID in the case of a posting list tuple.
630  */
631 static inline ItemPointer
633 {
634  if (BTreeTupleIsPivot(itup))
635  {
636  /* Pivot tuple heap TID representation? */
639  return (ItemPointer) ((char *) itup + IndexTupleSize(itup) -
640  sizeof(ItemPointerData));
641 
642  /* Heap TID attribute was truncated */
643  return NULL;
644  }
645  else if (BTreeTupleIsPosting(itup))
646  return BTreeTupleGetPosting(itup);
647 
648  return &itup->t_tid;
649 }
650 
651 /*
652  * Get maximum heap TID attribute, which could be the only TID in the case of
653  * a non-pivot tuple that does not have a posting list tuple.
654  *
655  * Works with non-pivot tuples only.
656  */
657 static inline ItemPointer
659 {
660  Assert(!BTreeTupleIsPivot(itup));
661 
662  if (BTreeTupleIsPosting(itup))
663  {
664  uint16 nposting = BTreeTupleGetNPosting(itup);
665 
666  return BTreeTupleGetPostingN(itup, nposting - 1);
667  }
668 
669  return &itup->t_tid;
670 }
671 
672 /*
673  * Operator strategy numbers for B-tree have been moved to access/stratnum.h,
674  * because many places need to use them in ScanKeyInit() calls.
675  *
676  * The strategy numbers are chosen so that we can commute them by
677  * subtraction, thus:
678  */
679 #define BTCommuteStrategyNumber(strat) (BTMaxStrategyNumber + 1 - (strat))
680 
681 /*
682  * When a new operator class is declared, we require that the user
683  * supply us with an amproc procedure (BTORDER_PROC) for determining
684  * whether, for two keys a and b, a < b, a = b, or a > b. This routine
685  * must return < 0, 0, > 0, respectively, in these three cases.
686  *
687  * To facilitate accelerated sorting, an operator class may choose to
688  * offer a second procedure (BTSORTSUPPORT_PROC). For full details, see
689  * src/include/utils/sortsupport.h.
690  *
691  * To support window frames defined by "RANGE offset PRECEDING/FOLLOWING",
692  * an operator class may choose to offer a third amproc procedure
693  * (BTINRANGE_PROC), independently of whether it offers sortsupport.
694  * For full details, see doc/src/sgml/btree.sgml.
695  *
696  * To facilitate B-Tree deduplication, an operator class may choose to
697  * offer a forth amproc procedure (BTEQUALIMAGE_PROC). For full details,
698  * see doc/src/sgml/btree.sgml.
699  */
700 
701 #define BTORDER_PROC 1
702 #define BTSORTSUPPORT_PROC 2
703 #define BTINRANGE_PROC 3
704 #define BTEQUALIMAGE_PROC 4
705 #define BTOPTIONS_PROC 5
706 #define BTNProcs 5
707 
708 /*
709  * We need to be able to tell the difference between read and write
710  * requests for pages, in order to do locking correctly.
711  */
712 
713 #define BT_READ BUFFER_LOCK_SHARE
714 #define BT_WRITE BUFFER_LOCK_EXCLUSIVE
715 
716 /*
717  * BTStackData -- As we descend a tree, we push the location of pivot
718  * tuples whose downlink we are about to follow onto a private stack. If
719  * we split a leaf, we use this stack to walk back up the tree and insert
720  * data into its parent page at the correct location. We also have to
721  * recursively insert into the grandparent page if and when the parent page
722  * splits. Our private stack can become stale due to concurrent page
723  * splits and page deletions, but it should never give us an irredeemably
724  * bad picture.
725  */
726 typedef struct BTStackData
727 {
732 
734 
735 /*
736  * BTScanInsertData is the btree-private state needed to find an initial
737  * position for an indexscan, or to insert new tuples -- an "insertion
738  * scankey" (not to be confused with a search scankey). It's used to descend
739  * a B-Tree using _bt_search.
740  *
741  * heapkeyspace indicates if we expect all keys in the index to be physically
742  * unique because heap TID is used as a tiebreaker attribute, and if index may
743  * have truncated key attributes in pivot tuples. This is actually a property
744  * of the index relation itself (not an indexscan). heapkeyspace indexes are
745  * indexes whose version is >= version 4. It's convenient to keep this close
746  * by, rather than accessing the metapage repeatedly.
747  *
748  * allequalimage is set to indicate that deduplication is safe for the index.
749  * This is also a property of the index relation rather than an indexscan.
750  *
751  * anynullkeys indicates if any of the keys had NULL value when scankey was
752  * built from index tuple (note that already-truncated tuple key attributes
753  * set NULL as a placeholder key value, which also affects value of
754  * anynullkeys). This is a convenience for unique index non-pivot tuple
755  * insertion, which usually temporarily unsets scantid, but shouldn't iff
756  * anynullkeys is true. Value generally matches non-pivot tuple's HasNulls
757  * bit, but may not when inserting into an INCLUDE index (tuple header value
758  * is affected by the NULL-ness of both key and non-key attributes).
759  *
760  * When nextkey is false (the usual case), _bt_search and _bt_binsrch will
761  * locate the first item >= scankey. When nextkey is true, they will locate
762  * the first item > scan key.
763  *
764  * pivotsearch is set to true by callers that want to re-find a leaf page
765  * using a scankey built from a leaf page's high key. Most callers set this
766  * to false.
767  *
768  * scantid is the heap TID that is used as a final tiebreaker attribute. It
769  * is set to NULL when index scan doesn't need to find a position for a
770  * specific physical tuple. Must be set when inserting new tuples into
771  * heapkeyspace indexes, since every tuple in the tree unambiguously belongs
772  * in one exact position (it's never set with !heapkeyspace indexes, though).
773  * Despite the representational difference, nbtree search code considers
774  * scantid to be just another insertion scankey attribute.
775  *
776  * scankeys is an array of scan key entries for attributes that are compared
777  * before scantid (user-visible attributes). keysz is the size of the array.
778  * During insertion, there must be a scan key for every attribute, but when
779  * starting a regular index scan some can be omitted. The array is used as a
780  * flexible array member, though it's sized in a way that makes it possible to
781  * use stack allocations. See nbtree/README for full details.
782  */
783 typedef struct BTScanInsertData
784 {
788  bool nextkey;
790  ItemPointer scantid; /* tiebreaker for scankeys */
791  int keysz; /* Size of scankeys array */
792  ScanKeyData scankeys[INDEX_MAX_KEYS]; /* Must appear last */
794 
796 
797 /*
798  * BTInsertStateData is a working area used during insertion.
799  *
800  * This is filled in after descending the tree to the first leaf page the new
801  * tuple might belong on. Tracks the current position while performing
802  * uniqueness check, before we have determined which exact page to insert
803  * to.
804  *
805  * (This should be private to nbtinsert.c, but it's also used by
806  * _bt_binsrch_insert)
807  */
808 typedef struct BTInsertStateData
809 {
810  IndexTuple itup; /* Item we're inserting */
811  Size itemsz; /* Size of itup -- should be MAXALIGN()'d */
812  BTScanInsert itup_key; /* Insertion scankey */
813 
814  /* Buffer containing leaf page we're likely to insert itup on */
816 
817  /*
818  * Cache of bounds within the current buffer. Only used for insertions
819  * where _bt_check_unique is called. See _bt_binsrch_insert and
820  * _bt_findinsertloc for details.
821  */
825 
826  /*
827  * if _bt_binsrch_insert found the location inside existing posting list,
828  * save the position inside the list. -1 sentinel value indicates overlap
829  * with an existing posting list tuple that has its LP_DEAD bit set.
830  */
833 
835 
836 /*
837  * State used to representing an individual pending tuple during
838  * deduplication.
839  */
840 typedef struct BTDedupInterval
841 {
845 
846 /*
847  * BTDedupStateData is a working area used during deduplication.
848  *
849  * The status info fields track the state of a whole-page deduplication pass.
850  * State about the current pending posting list is also tracked.
851  *
852  * A pending posting list is comprised of a contiguous group of equal items
853  * from the page, starting from page offset number 'baseoff'. This is the
854  * offset number of the "base" tuple for new posting list. 'nitems' is the
855  * current total number of existing items from the page that will be merged to
856  * make a new posting list tuple, including the base tuple item. (Existing
857  * items may themselves be posting list tuples, or regular non-pivot tuples.)
858  *
859  * The total size of the existing tuples to be freed when pending posting list
860  * is processed gets tracked by 'phystupsize'. This information allows
861  * deduplication to calculate the space saving for each new posting list
862  * tuple, and for the entire pass over the page as a whole.
863  */
864 typedef struct BTDedupStateData
865 {
866  /* Deduplication status info for entire pass over page */
867  bool deduplicate; /* Still deduplicating page? */
868  int nmaxitems; /* Number of max-sized tuples so far */
869  Size maxpostingsize; /* Limit on size of final tuple */
870 
871  /* Metadata about base tuple of current pending posting list */
872  IndexTuple base; /* Use to form new posting list */
873  OffsetNumber baseoff; /* page offset of base */
874  Size basetupsize; /* base size without original posting list */
875 
876  /* Other metadata about pending posting list */
877  ItemPointer htids; /* Heap TIDs in pending posting list */
878  int nhtids; /* Number of heap TIDs in htids array */
879  int nitems; /* Number of existing tuples/line pointers */
880  Size phystupsize; /* Includes line pointer overhead */
881 
882  /*
883  * Array of tuples to go on new version of the page. Contains one entry
884  * for each group of consecutive items. Note that existing tuples that
885  * will not become posting list tuples do not appear in the array (they
886  * are implicitly unchanged by deduplication pass).
887  */
888  int nintervals; /* current number of intervals in array */
891 
893 
894 /*
895  * BTVacuumPostingData is state that represents how to VACUUM (or delete) a
896  * posting list tuple when some (though not all) of its TIDs are to be
897  * deleted.
898  *
899  * Convention is that itup field is the original posting list tuple on input,
900  * and palloc()'d final tuple used to overwrite existing tuple on output.
901  */
902 typedef struct BTVacuumPostingData
903 {
904  /* Tuple that will be/was updated */
907 
908  /* State needed to describe final itup in WAL */
912 
914 
915 /*
916  * BTScanOpaqueData is the btree-private state needed for an indexscan.
917  * This consists of preprocessed scan keys (see _bt_preprocess_keys() for
918  * details of the preprocessing), information about the current location
919  * of the scan, and information about the marked location, if any. (We use
920  * BTScanPosData to represent the data needed for each of current and marked
921  * locations.) In addition we can remember some known-killed index entries
922  * that must be marked before we can move off the current page.
923  *
924  * Index scans work a page at a time: we pin and read-lock the page, identify
925  * all the matching items on the page and save them in BTScanPosData, then
926  * release the read-lock while returning the items to the caller for
927  * processing. This approach minimizes lock/unlock traffic. Note that we
928  * keep the pin on the index page until the caller is done with all the items
929  * (this is needed for VACUUM synchronization, see nbtree/README). When we
930  * are ready to step to the next page, if the caller has told us any of the
931  * items were killed, we re-lock the page to mark them killed, then unlock.
932  * Finally we drop the pin and step to the next page in the appropriate
933  * direction.
934  *
935  * If we are doing an index-only scan, we save the entire IndexTuple for each
936  * matched item, otherwise only its heap TID and offset. The IndexTuples go
937  * into a separate workspace array; each BTScanPosItem stores its tuple's
938  * offset within that array. Posting list tuples store a "base" tuple once,
939  * allowing the same key to be returned for each TID in the posting list
940  * tuple.
941  */
942 
943 typedef struct BTScanPosItem /* what we remember about each match */
944 {
945  ItemPointerData heapTid; /* TID of referenced heap item */
946  OffsetNumber indexOffset; /* index item's location within page */
947  LocationIndex tupleOffset; /* IndexTuple's offset in workspace, if any */
949 
950 typedef struct BTScanPosData
951 {
952  Buffer buf; /* if valid, the buffer is pinned */
953 
954  XLogRecPtr lsn; /* pos in the WAL stream when page was read */
955  BlockNumber currPage; /* page referenced by items array */
956  BlockNumber nextPage; /* page's right link when we scanned it */
957 
958  /*
959  * moreLeft and moreRight track whether we think there may be matching
960  * index entries to the left and right of the current page, respectively.
961  * We can clear the appropriate one of these flags when _bt_checkkeys()
962  * returns continuescan = false.
963  */
964  bool moreLeft;
965  bool moreRight;
966 
967  /*
968  * If we are doing an index-only scan, nextTupleOffset is the first free
969  * location in the associated tuple storage workspace.
970  */
972 
973  /*
974  * The items array is always ordered in index order (ie, increasing
975  * indexoffset). When scanning backwards it is convenient to fill the
976  * array back-to-front, so we start at the last slot and fill downwards.
977  * Hence we need both a first-valid-entry and a last-valid-entry counter.
978  * itemIndex is a cursor showing which entry was last returned to caller.
979  */
980  int firstItem; /* first valid index in items[] */
981  int lastItem; /* last valid index in items[] */
982  int itemIndex; /* current index in items[] */
983 
986 
988 
989 #define BTScanPosIsPinned(scanpos) \
990 ( \
991  AssertMacro(BlockNumberIsValid((scanpos).currPage) || \
992  !BufferIsValid((scanpos).buf)), \
993  BufferIsValid((scanpos).buf) \
994 )
995 #define BTScanPosUnpin(scanpos) \
996  do { \
997  ReleaseBuffer((scanpos).buf); \
998  (scanpos).buf = InvalidBuffer; \
999  } while (0)
1000 #define BTScanPosUnpinIfPinned(scanpos) \
1001  do { \
1002  if (BTScanPosIsPinned(scanpos)) \
1003  BTScanPosUnpin(scanpos); \
1004  } while (0)
1005 
1006 #define BTScanPosIsValid(scanpos) \
1007 ( \
1008  AssertMacro(BlockNumberIsValid((scanpos).currPage) || \
1009  !BufferIsValid((scanpos).buf)), \
1010  BlockNumberIsValid((scanpos).currPage) \
1011 )
1012 #define BTScanPosInvalidate(scanpos) \
1013  do { \
1014  (scanpos).currPage = InvalidBlockNumber; \
1015  (scanpos).nextPage = InvalidBlockNumber; \
1016  (scanpos).buf = InvalidBuffer; \
1017  (scanpos).lsn = InvalidXLogRecPtr; \
1018  (scanpos).nextTupleOffset = 0; \
1019  } while (0)
1020 
1021 /* We need one of these for each equality-type SK_SEARCHARRAY scan key */
1022 typedef struct BTArrayKeyInfo
1023 {
1024  int scan_key; /* index of associated key in arrayKeyData */
1025  int cur_elem; /* index of current element in elem_values */
1026  int mark_elem; /* index of marked element in elem_values */
1027  int num_elems; /* number of elems in current array value */
1028  Datum *elem_values; /* array of num_elems Datums */
1030 
1031 typedef struct BTScanOpaqueData
1032 {
1033  /* these fields are set by _bt_preprocess_keys(): */
1034  bool qual_ok; /* false if qual can never be satisfied */
1035  int numberOfKeys; /* number of preprocessed scan keys */
1036  ScanKey keyData; /* array of preprocessed scan keys */
1037 
1038  /* workspace for SK_SEARCHARRAY support */
1039  ScanKey arrayKeyData; /* modified copy of scan->keyData */
1040  int numArrayKeys; /* number of equality-type array keys (-1 if
1041  * there are any unsatisfiable array keys) */
1042  int arrayKeyCount; /* count indicating number of array scan keys
1043  * processed */
1044  BTArrayKeyInfo *arrayKeys; /* info about each equality-type array key */
1045  MemoryContext arrayContext; /* scan-lifespan context for array data */
1046 
1047  /* info about killed items if any (killedItems is NULL if never used) */
1048  int *killedItems; /* currPos.items indexes of killed items */
1049  int numKilled; /* number of currently stored items */
1050 
1051  /*
1052  * If we are doing an index-only scan, these are the tuple storage
1053  * workspaces for the currPos and markPos respectively. Each is of size
1054  * BLCKSZ, so it can hold as much as a full page's worth of tuples.
1055  */
1056  char *currTuples; /* tuple storage for currPos */
1057  char *markTuples; /* tuple storage for markPos */
1058 
1059  /*
1060  * If the marked position is on the same page as current position, we
1061  * don't use markPos, but just keep the marked itemIndex in markItemIndex
1062  * (all the rest of currPos is valid for the mark position). Hence, to
1063  * determine if there is a mark, first look at markItemIndex, then at
1064  * markPos.
1065  */
1066  int markItemIndex; /* itemIndex, or -1 if not valid */
1067 
1068  /* keep these last in struct for efficiency */
1069  BTScanPosData currPos; /* current position data */
1070  BTScanPosData markPos; /* marked position, if any */
1072 
1074 
1075 /*
1076  * We use some private sk_flags bits in preprocessed scan keys. We're allowed
1077  * to use bits 16-31 (see skey.h). The uppermost bits are copied from the
1078  * index's indoption[] array entry for the index attribute.
1079  */
1080 #define SK_BT_REQFWD 0x00010000 /* required to continue forward scan */
1081 #define SK_BT_REQBKWD 0x00020000 /* required to continue backward scan */
1082 #define SK_BT_INDOPTION_SHIFT 24 /* must clear the above bits */
1083 #define SK_BT_DESC (INDOPTION_DESC << SK_BT_INDOPTION_SHIFT)
1084 #define SK_BT_NULLS_FIRST (INDOPTION_NULLS_FIRST << SK_BT_INDOPTION_SHIFT)
1085 
1086 typedef struct BTOptions
1087 {
1088  int32 varlena_header_; /* varlena header (do not touch directly!) */
1089  int fillfactor; /* page fill factor in percent (0..100) */
1091  bool deduplicate_items; /* Try to deduplicate items? */
1093 
1094 #define BTGetFillFactor(relation) \
1095  (AssertMacro(relation->rd_rel->relkind == RELKIND_INDEX && \
1096  relation->rd_rel->relam == BTREE_AM_OID), \
1097  (relation)->rd_options ? \
1098  ((BTOptions *) (relation)->rd_options)->fillfactor : \
1099  BTREE_DEFAULT_FILLFACTOR)
1100 #define BTGetTargetPageFreeSpace(relation) \
1101  (BLCKSZ * (100 - BTGetFillFactor(relation)) / 100)
1102 #define BTGetDeduplicateItems(relation) \
1103  (AssertMacro(relation->rd_rel->relkind == RELKIND_INDEX && \
1104  relation->rd_rel->relam == BTREE_AM_OID), \
1105  ((relation)->rd_options ? \
1106  ((BTOptions *) (relation)->rd_options)->deduplicate_items : true))
1107 
1108 /*
1109  * Constant definition for progress reporting. Phase numbers must match
1110  * btbuildphasename.
1111  */
1112 /* PROGRESS_CREATEIDX_SUBPHASE_INITIALIZE is 1 (see progress.h) */
1113 #define PROGRESS_BTREE_PHASE_INDEXBUILD_TABLESCAN 2
1114 #define PROGRESS_BTREE_PHASE_PERFORMSORT_1 3
1115 #define PROGRESS_BTREE_PHASE_PERFORMSORT_2 4
1116 #define PROGRESS_BTREE_PHASE_LEAF_LOAD 5
1117 
1118 /*
1119  * external entry points for btree, in nbtree.c
1120  */
1121 extern void btbuildempty(Relation index);
1122 extern bool btinsert(Relation rel, Datum *values, bool *isnull,
1123  ItemPointer ht_ctid, Relation heapRel,
1124  IndexUniqueCheck checkUnique,
1125  bool indexUnchanged,
1126  struct IndexInfo *indexInfo);
1127 extern IndexScanDesc btbeginscan(Relation rel, int nkeys, int norderbys);
1128 extern Size btestimateparallelscan(void);
1129 extern void btinitparallelscan(void *target);
1130 extern bool btgettuple(IndexScanDesc scan, ScanDirection dir);
1131 extern int64 btgetbitmap(IndexScanDesc scan, TIDBitmap *tbm);
1132 extern void btrescan(IndexScanDesc scan, ScanKey scankey, int nscankeys,
1133  ScanKey orderbys, int norderbys);
1134 extern void btparallelrescan(IndexScanDesc scan);
1135 extern void btendscan(IndexScanDesc scan);
1136 extern void btmarkpos(IndexScanDesc scan);
1137 extern void btrestrpos(IndexScanDesc scan);
1139  IndexBulkDeleteResult *stats,
1141  void *callback_state);
1143  IndexBulkDeleteResult *stats);
1144 extern bool btcanreturn(Relation index, int attno);
1145 
1146 /*
1147  * prototypes for internal functions in nbtree.c
1148  */
1149 extern bool _bt_parallel_seize(IndexScanDesc scan, BlockNumber *pageno);
1150 extern void _bt_parallel_release(IndexScanDesc scan, BlockNumber scan_page);
1151 extern void _bt_parallel_done(IndexScanDesc scan);
1153 
1154 /*
1155  * prototypes for functions in nbtdedup.c
1156  */
1157 extern void _bt_dedup_pass(Relation rel, Buffer buf, Relation heapRel,
1158  IndexTuple newitem, Size newitemsz,
1159  bool bottomupdedup);
1160 extern bool _bt_bottomupdel_pass(Relation rel, Buffer buf, Relation heapRel,
1161  Size newitemsz);
1163  OffsetNumber baseoff);
1167  int nhtids);
1168 extern void _bt_update_posting(BTVacuumPosting vacposting);
1169 extern IndexTuple _bt_swap_posting(IndexTuple newitem, IndexTuple oposting,
1170  int postingoff);
1171 
1172 /*
1173  * prototypes for functions in nbtinsert.c
1174  */
1175 extern bool _bt_doinsert(Relation rel, IndexTuple itup,
1176  IndexUniqueCheck checkUnique, bool indexUnchanged,
1177  Relation heapRel);
1178 extern void _bt_finish_split(Relation rel, Buffer lbuf, BTStack stack);
1179 extern Buffer _bt_getstackbuf(Relation rel, BTStack stack, BlockNumber child);
1180 
1181 /*
1182  * prototypes for functions in nbtsplitloc.c
1183  */
1184 extern OffsetNumber _bt_findsplitloc(Relation rel, Page origpage,
1185  OffsetNumber newitemoff, Size newitemsz, IndexTuple newitem,
1186  bool *newitemonleft);
1187 
1188 /*
1189  * prototypes for functions in nbtpage.c
1190  */
1191 extern void _bt_initmetapage(Page page, BlockNumber rootbknum, uint32 level,
1192  bool allequalimage);
1193 extern bool _bt_vacuum_needs_cleanup(Relation rel);
1194 extern void _bt_set_cleanup_info(Relation rel, BlockNumber num_delpages);
1195 extern void _bt_upgrademetapage(Page page);
1196 extern Buffer _bt_getroot(Relation rel, int access);
1197 extern Buffer _bt_gettrueroot(Relation rel);
1198 extern int _bt_getrootheight(Relation rel);
1199 extern void _bt_metaversion(Relation rel, bool *heapkeyspace,
1200  bool *allequalimage);
1201 extern void _bt_checkpage(Relation rel, Buffer buf);
1202 extern Buffer _bt_getbuf(Relation rel, BlockNumber blkno, int access);
1203 extern Buffer _bt_relandgetbuf(Relation rel, Buffer obuf,
1204  BlockNumber blkno, int access);
1205 extern void _bt_relbuf(Relation rel, Buffer buf);
1206 extern void _bt_lockbuf(Relation rel, Buffer buf, int access);
1207 extern void _bt_unlockbuf(Relation rel, Buffer buf);
1208 extern bool _bt_conditionallockbuf(Relation rel, Buffer buf);
1209 extern void _bt_upgradelockbufcleanup(Relation rel, Buffer buf);
1210 extern void _bt_pageinit(Page page, Size size);
1211 extern void _bt_delitems_vacuum(Relation rel, Buffer buf,
1212  OffsetNumber *deletable, int ndeletable,
1213  BTVacuumPosting *updatable, int nupdatable);
1214 extern void _bt_delitems_delete_check(Relation rel, Buffer buf,
1215  Relation heapRel,
1216  TM_IndexDeleteOp *delstate);
1217 extern void _bt_pagedel(Relation rel, Buffer leafbuf, BTVacState *vstate);
1218 extern void _bt_pendingfsm_init(Relation rel, BTVacState *vstate,
1219  bool cleanuponly);
1220 extern void _bt_pendingfsm_finalize(Relation rel, BTVacState *vstate);
1221 
1222 /*
1223  * prototypes for functions in nbtsearch.c
1224  */
1225 extern BTStack _bt_search(Relation rel, BTScanInsert key, Buffer *bufP,
1226  int access, Snapshot snapshot);
1228  bool forupdate, BTStack stack, int access, Snapshot snapshot);
1229 extern OffsetNumber _bt_binsrch_insert(Relation rel, BTInsertState insertstate);
1230 extern int32 _bt_compare(Relation rel, BTScanInsert key, Page page, OffsetNumber offnum);
1231 extern bool _bt_first(IndexScanDesc scan, ScanDirection dir);
1232 extern bool _bt_next(IndexScanDesc scan, ScanDirection dir);
1233 extern Buffer _bt_get_endpoint(Relation rel, uint32 level, bool rightmost,
1234  Snapshot snapshot);
1235 
1236 /*
1237  * prototypes for functions in nbtutils.c
1238  */
1239 extern BTScanInsert _bt_mkscankey(Relation rel, IndexTuple itup);
1240 extern void _bt_freestack(BTStack stack);
1241 extern void _bt_preprocess_array_keys(IndexScanDesc scan);
1242 extern void _bt_start_array_keys(IndexScanDesc scan, ScanDirection dir);
1243 extern bool _bt_advance_array_keys(IndexScanDesc scan, ScanDirection dir);
1244 extern void _bt_mark_array_keys(IndexScanDesc scan);
1245 extern void _bt_restore_array_keys(IndexScanDesc scan);
1246 extern void _bt_preprocess_keys(IndexScanDesc scan);
1247 extern bool _bt_checkkeys(IndexScanDesc scan, IndexTuple tuple,
1248  int tupnatts, ScanDirection dir, bool *continuescan);
1249 extern void _bt_killitems(IndexScanDesc scan);
1251 extern BTCycleId _bt_start_vacuum(Relation rel);
1252 extern void _bt_end_vacuum(Relation rel);
1253 extern void _bt_end_vacuum_callback(int code, Datum arg);
1254 extern Size BTreeShmemSize(void);
1255 extern void BTreeShmemInit(void);
1256 extern bytea *btoptions(Datum reloptions, bool validate);
1257 extern bool btproperty(Oid index_oid, int attno,
1258  IndexAMProperty prop, const char *propname,
1259  bool *res, bool *isnull);
1260 extern char *btbuildphasename(int64 phasenum);
1261 extern IndexTuple _bt_truncate(Relation rel, IndexTuple lastleft,
1262  IndexTuple firstright, BTScanInsert itup_key);
1263 extern int _bt_keep_natts_fast(Relation rel, IndexTuple lastleft,
1264  IndexTuple firstright);
1265 extern bool _bt_check_natts(Relation rel, bool heapkeyspace, Page page,
1266  OffsetNumber offnum);
1267 extern void _bt_check_third_page(Relation rel, Relation heap,
1268  bool needheaptidspace, Page page, IndexTuple newtup);
1269 extern bool _bt_allequalimage(Relation rel, bool debugmessage);
1270 
1271 /*
1272  * prototypes for functions in nbtvalidate.c
1273  */
1274 extern bool btvalidate(Oid opclassoid);
1275 extern void btadjustmembers(Oid opfamilyoid,
1276  Oid opclassoid,
1277  List *operators,
1278  List *functions);
1279 
1280 /*
1281  * prototypes for functions in nbtsort.c
1282  */
1284  struct IndexInfo *indexInfo);
1285 extern void _bt_parallel_build_main(dsm_segment *seg, shm_toc *toc);
1286 
1287 #endif /* NBTREE_H */
IndexAMProperty
Definition: amapi.h:35
uint32 BlockNumber
Definition: block.h:31
static Datum values[MAXATTR]
Definition: bootstrap.c:156
int Buffer
Definition: buf.h:23
PageHeaderData * PageHeader
Definition: bufpage.h:170
static char * PageGetContents(Page page)
Definition: bufpage.h:254
Pointer Page
Definition: bufpage.h:78
#define SizeOfPageHeaderData
Definition: bufpage.h:213
static bool PageIsNew(Page page)
Definition: bufpage.h:230
uint16 LocationIndex
Definition: bufpage.h:87
unsigned short uint16
Definition: c.h:441
unsigned int uint32
Definition: c.h:442
#define MAXALIGN(LEN)
Definition: c.h:747
signed int int32
Definition: c.h:430
double float8
Definition: c.h:566
#define FLEXIBLE_ARRAY_MEMBER
Definition: c.h:362
size_t Size
Definition: c.h:541
bool(* IndexBulkDeleteCallback)(ItemPointer itemptr, void *state)
Definition: genam.h:86
IndexUniqueCheck
Definition: genam.h:115
static void ItemPointerSetOffsetNumber(ItemPointerData *pointer, OffsetNumber offsetNumber)
Definition: itemptr.h:158
static void ItemPointerSetBlockNumber(ItemPointerData *pointer, BlockNumber blockNumber)
Definition: itemptr.h:147
static OffsetNumber ItemPointerGetOffsetNumberNoCheck(const ItemPointerData *pointer)
Definition: itemptr.h:114
static BlockNumber ItemPointerGetBlockNumberNoCheck(const ItemPointerData *pointer)
Definition: itemptr.h:93
struct ItemPointerData ItemPointerData
#define IndexTupleSize(itup)
Definition: itup.h:70
#define MaxIndexTuplesPerPage
Definition: itup.h:165
#define INDEX_SIZE_MASK
Definition: itup.h:65
Assert(fmt[strlen(fmt) - 1] !='\n')
#define P_HAS_FULLXID(opaque)
Definition: nbtree.h:228
bool btinsert(Relation rel, Datum *values, bool *isnull, ItemPointer ht_ctid, Relation heapRel, IndexUniqueCheck checkUnique, bool indexUnchanged, struct IndexInfo *indexInfo)
Definition: nbtree.c:187
Buffer _bt_relandgetbuf(Relation rel, Buffer obuf, BlockNumber blkno, int access)
Definition: nbtpage.c:1015
void _bt_check_third_page(Relation rel, Relation heap, bool needheaptidspace, Page page, IndexTuple newtup)
Definition: nbtutils.c:2638
bool btcanreturn(Relation index, int attno)
Definition: nbtree.c:1418
void _bt_parallel_release(IndexScanDesc scan, BlockNumber scan_page)
Definition: nbtree.c:693
BTPageOpaqueData * BTPageOpaque
Definition: nbtree.h:71
#define BT_PIVOT_HEAP_TID_ATTR
Definition: nbtree.h:466
static uint16 BTreeTupleGetNPosting(IndexTuple posting)
Definition: nbtree.h:512
void _bt_upgrademetapage(Page page)
Definition: nbtpage.c:109
void _bt_relbuf(Relation rel, Buffer buf)
Definition: nbtpage.c:1035
IndexTuple _bt_swap_posting(IndexTuple newitem, IndexTuple oposting, int postingoff)
Definition: nbtdedup.c:1022
static bool BTreeTupleIsPivot(IndexTuple itup)
Definition: nbtree.h:474
Buffer _bt_gettrueroot(Relation rel)
Definition: nbtpage.c:577
int _bt_getrootheight(Relation rel)
Definition: nbtpage.c:672
BTStackData * BTStack
Definition: nbtree.h:733
void _bt_end_vacuum(Relation rel)
Definition: nbtutils.c:2033
bool btvalidate(Oid opclassoid)
Definition: nbtvalidate.c:41
void _bt_pageinit(Page page, Size size)
Definition: nbtpage.c:1141
bool _bt_first(IndexScanDesc scan, ScanDirection dir)
Definition: nbtsearch.c:860
OffsetNumber _bt_findsplitloc(Relation rel, Page origpage, OffsetNumber newitemoff, Size newitemsz, IndexTuple newitem, bool *newitemonleft)
Definition: nbtsplitloc.c:129
static FullTransactionId BTPageGetDeleteXid(Page page)
Definition: nbtree.h:260
#define BTP_HAS_FULLXID
Definition: nbtree.h:84
void _bt_update_posting(BTVacuumPosting vacposting)
Definition: nbtdedup.c:924
bool _bt_bottomupdel_pass(Relation rel, Buffer buf, Relation heapRel, Size newitemsz)
Definition: nbtdedup.c:307
char * btbuildphasename(int64 phasenum)
Definition: nbtutils.c:2157
#define BTP_HALF_DEAD
Definition: nbtree.h:80
static bool BTPageIsRecyclable(Page page)
Definition: nbtree.h:291
bool _bt_dedup_save_htid(BTDedupState state, IndexTuple itup)
Definition: nbtdedup.c:484
void _bt_end_vacuum_callback(int code, Datum arg)
Definition: nbtutils.c:2061
void _bt_pagedel(Relation rel, Buffer leafbuf, BTVacState *vstate)
Definition: nbtpage.c:1816
struct BTPageOpaqueData BTPageOpaqueData
IndexScanDesc btbeginscan(Relation rel, int nkeys, int norderbys)
Definition: nbtree.c:343
void _bt_delitems_vacuum(Relation rel, Buffer buf, OffsetNumber *deletable, int ndeletable, BTVacuumPosting *updatable, int nupdatable)
Definition: nbtpage.c:1166
static void BTreeTupleSetTopParent(IndexTuple leafhikey, BlockNumber blkno)
Definition: nbtree.h:620
Buffer _bt_getroot(Relation rel, int access)
Definition: nbtpage.c:343
void _bt_freestack(BTStack stack)
Definition: nbtutils.c:182
static void BTreeTupleSetPosting(IndexTuple itup, uint16 nhtids, int postingoffset)
Definition: nbtree.h:498
void BTreeShmemInit(void)
Definition: nbtutils.c:2083
void _bt_parallel_done(IndexScanDesc scan)
Definition: nbtree.c:716
IndexBulkDeleteResult * btbulkdelete(IndexVacuumInfo *info, IndexBulkDeleteResult *stats, IndexBulkDeleteCallback callback, void *callback_state)
Definition: nbtree.c:785
void _bt_dedup_start_pending(BTDedupState state, IndexTuple base, OffsetNumber baseoff)
Definition: nbtdedup.c:433
#define BTPageGetOpaque(page)
Definition: nbtree.h:73
#define P_ISDELETED(opaque)
Definition: nbtree.h:222
bytea * btoptions(Datum reloptions, bool validate)
Definition: nbtutils.c:2111
static ItemPointer BTreeTupleGetPosting(IndexTuple posting)
Definition: nbtree.h:531
void _bt_checkpage(Relation rel, Buffer buf)
Definition: nbtpage.c:794
bool _bt_advance_array_keys(IndexScanDesc scan, ScanDirection dir)
Definition: nbtutils.c:551
BTCycleId _bt_vacuum_cycleid(Relation rel)
Definition: nbtutils.c:1942
void _bt_metaversion(Relation rel, bool *heapkeyspace, bool *allequalimage)
Definition: nbtpage.c:736
static BlockNumber BTreeTupleGetTopParent(IndexTuple leafhikey)
Definition: nbtree.h:614
struct BTArrayKeyInfo BTArrayKeyInfo
void _bt_parallel_advance_array_keys(IndexScanDesc scan)
Definition: nbtree.c:757
void btadjustmembers(Oid opfamilyoid, Oid opclassoid, List *operators, List *functions)
Definition: nbtvalidate.c:293
BTScanInsert _bt_mkscankey(Relation rel, IndexTuple itup)
Definition: nbtutils.c:90
struct BTPendingFSM BTPendingFSM
void _bt_killitems(IndexScanDesc scan)
Definition: nbtutils.c:1725
#define BT_OFFSET_MASK
Definition: nbtree.h:463
IndexBulkDeleteResult * btvacuumcleanup(IndexVacuumInfo *info, IndexBulkDeleteResult *stats)
Definition: nbtree.c:815
IndexTuple _bt_form_posting(IndexTuple base, ItemPointer htids, int nhtids)
Definition: nbtdedup.c:864
bool _bt_doinsert(Relation rel, IndexTuple itup, IndexUniqueCheck checkUnique, bool indexUnchanged, Relation heapRel)
Definition: nbtinsert.c:100
#define MaxTIDsPerBTreePage
Definition: nbtree.h:185
void _bt_finish_split(Relation rel, Buffer lbuf, BTStack stack)
Definition: nbtinsert.c:2230
static void BTreeTupleSetDownLink(IndexTuple pivot, BlockNumber blkno)
Definition: nbtree.h:556
bool _bt_checkkeys(IndexScanDesc scan, IndexTuple tuple, int tupnatts, ScanDirection dir, bool *continuescan)
Definition: nbtutils.c:1362
bool btgettuple(IndexScanDesc scan, ScanDirection dir)
Definition: nbtree.c:211
void btparallelrescan(IndexScanDesc scan)
Definition: nbtree.c:594
struct BTVacState BTVacState
void _bt_preprocess_array_keys(IndexScanDesc scan)
Definition: nbtutils.c:210
bool _bt_check_natts(Relation rel, bool heapkeyspace, Page page, OffsetNumber offnum)
Definition: nbtutils.c:2471
IndexTuple _bt_truncate(Relation rel, IndexTuple lastleft, IndexTuple firstright, BTScanInsert itup_key)
Definition: nbtutils.c:2205
void _bt_set_cleanup_info(Relation rel, BlockNumber num_delpages)
Definition: nbtpage.c:234
#define BT_STATUS_OFFSET_MASK
Definition: nbtree.h:464
uint16 BTCycleId
Definition: nbtree.h:29
static uint32 BTreeTupleGetPostingOffset(IndexTuple posting)
Definition: nbtree.h:523
struct BTScanInsertData BTScanInsertData
void btbuildempty(Relation index)
Definition: nbtree.c:151
bool _bt_parallel_seize(IndexScanDesc scan, BlockNumber *pageno)
Definition: nbtree.c:635
struct BTMetaPageData BTMetaPageData
bool _bt_conditionallockbuf(Relation rel, Buffer buf)
Definition: nbtpage.c:1105
Buffer _bt_getbuf(Relation rel, BlockNumber blkno, int access)
Definition: nbtpage.c:871
BTScanInsertData * BTScanInsert
Definition: nbtree.h:795
Size btestimateparallelscan(void)
Definition: nbtree.c:570
int _bt_keep_natts_fast(Relation rel, IndexTuple lastleft, IndexTuple firstright)
Definition: nbtutils.c:2424
static ItemPointer BTreeTupleGetPostingN(IndexTuple posting, int n)
Definition: nbtree.h:538
IndexBuildResult * btbuild(Relation heap, Relation index, struct IndexInfo *indexInfo)
Definition: nbtsort.c:301
void btinitparallelscan(void *target)
Definition: nbtree.c:579
void _bt_parallel_build_main(dsm_segment *seg, shm_toc *toc)
Definition: nbtsort.c:1798
void _bt_unlockbuf(Relation rel, Buffer buf)
Definition: nbtpage.c:1082
static BlockNumber BTreeTupleGetDownLink(IndexTuple pivot)
Definition: nbtree.h:550
void _bt_restore_array_keys(IndexScanDesc scan)
Definition: nbtutils.c:629
#define INDEX_ALT_TID_MASK
Definition: nbtree.h:460
void _bt_upgradelockbufcleanup(Relation rel, Buffer buf)
Definition: nbtpage.c:1121
void _bt_initmetapage(Page page, BlockNumber rootbknum, uint32 level, bool allequalimage)
Definition: nbtpage.c:69
Buffer _bt_getstackbuf(Relation rel, BTStack stack, BlockNumber child)
Definition: nbtinsert.c:2307
BTVacuumPostingData * BTVacuumPosting
Definition: nbtree.h:913
void _bt_delitems_delete_check(Relation rel, Buffer buf, Relation heapRel, TM_IndexDeleteOp *delstate)
Definition: nbtpage.c:1529
struct BTDeletedPageData BTDeletedPageData
bool _bt_vacuum_needs_cleanup(Relation rel)
Definition: nbtpage.c:181
OffsetNumber _bt_binsrch_insert(Relation rel, BTInsertState insertstate)
Definition: nbtsearch.c:442
bool _bt_next(IndexScanDesc scan, ScanDirection dir)
Definition: nbtsearch.c:1466
struct BTDedupInterval BTDedupInterval
int32 _bt_compare(Relation rel, BTScanInsert key, Page page, OffsetNumber offnum)
Definition: nbtsearch.c:656
struct BTScanPosItem BTScanPosItem
static ItemPointer BTreeTupleGetMaxHeapTID(IndexTuple itup)
Definition: nbtree.h:658
void _bt_dedup_pass(Relation rel, Buffer buf, Relation heapRel, IndexTuple newitem, Size newitemsz, bool bottomupdedup)
Definition: nbtdedup.c:58
static bool BTreeTupleIsPosting(IndexTuple itup)
Definition: nbtree.h:486
Size BTreeShmemSize(void)
Definition: nbtutils.c:2070
Buffer _bt_get_endpoint(Relation rel, uint32 level, bool rightmost, Snapshot snapshot)
Definition: nbtsearch.c:2307
void _bt_mark_array_keys(IndexScanDesc scan)
Definition: nbtutils.c:610
static void BTPageSetDeleted(Page page, FullTransactionId safexid)
Definition: nbtree.h:239
int64 btgetbitmap(IndexScanDesc scan, TIDBitmap *tbm)
Definition: nbtree.c:285
void btmarkpos(IndexScanDesc scan)
Definition: nbtree.c:484
BTDedupStateData * BTDedupState
Definition: nbtree.h:892
void btendscan(IndexScanDesc scan)
Definition: nbtree.c:448
void _bt_pendingfsm_finalize(Relation rel, BTVacState *vstate)
Definition: nbtpage.c:2956
#define BT_IS_POSTING
Definition: nbtree.h:467
void _bt_lockbuf(Relation rel, Buffer buf, int access)
Definition: nbtpage.c:1051
struct BTOptions BTOptions
void btrescan(IndexScanDesc scan, ScanKey scankey, int nscankeys, ScanKey orderbys, int norderbys)
Definition: nbtree.c:389
bool btproperty(Oid index_oid, int attno, IndexAMProperty prop, const char *propname, bool *res, bool *isnull)
Definition: nbtutils.c:2134
struct BTScanPosData BTScanPosData
static ItemPointer BTreeTupleGetHeapTID(IndexTuple itup)
Definition: nbtree.h:632
void _bt_pendingfsm_init(Relation rel, BTVacState *vstate, bool cleanuponly)
Definition: nbtpage.c:2915
Size _bt_dedup_finish_pending(Page newpage, BTDedupState state)
Definition: nbtdedup.c:555
struct BTScanOpaqueData BTScanOpaqueData
BTStack _bt_search(Relation rel, BTScanInsert key, Buffer *bufP, int access, Snapshot snapshot)
Definition: nbtsearch.c:96
BTInsertStateData * BTInsertState
Definition: nbtree.h:834
static void BTreeTupleSetNAtts(IndexTuple itup, uint16 nkeyatts, bool heaptid)
Definition: nbtree.h:589
void btrestrpos(IndexScanDesc scan)
Definition: nbtree.c:514
bool _bt_allequalimage(Relation rel, bool debugmessage)
Definition: nbtutils.c:2696
struct BTDedupStateData BTDedupStateData
#define BTP_DELETED
Definition: nbtree.h:78
void _bt_start_array_keys(IndexScanDesc scan, ScanDirection dir)
Definition: nbtutils.c:525
void _bt_preprocess_keys(IndexScanDesc scan)
Definition: nbtutils.c:749
struct BTStackData BTStackData
BTCycleId _bt_start_vacuum(Relation rel)
Definition: nbtutils.c:1976
BTScanPosData * BTScanPos
Definition: nbtree.h:987
struct BTInsertStateData BTInsertStateData
struct BTVacuumPostingData BTVacuumPostingData
Buffer _bt_moveright(Relation rel, BTScanInsert key, Buffer buf, bool forupdate, BTStack stack, int access, Snapshot snapshot)
Definition: nbtsearch.c:236
BTScanOpaqueData * BTScanOpaque
Definition: nbtree.h:1073
uint16 OffsetNumber
Definition: off.h:24
void * arg
#define INDEX_MAX_KEYS
static void header(const char *fmt,...) pg_attribute_printf(1
Definition: pg_regress.c:208
static char * buf
Definition: pg_test_fsync.c:67
uintptr_t Datum
Definition: postgres.h:412
unsigned int Oid
Definition: postgres_ext.h:31
short access
Definition: preproc-type.c:36
bool GlobalVisCheckRemovableFullXid(Relation rel, FullTransactionId fxid)
Definition: procarray.c:4275
static const struct fns functions
Definition: regcomp.c:357
ScanDirection
Definition: sdir.h:23
Datum * elem_values
Definition: nbtree.h:1028
uint16 nitems
Definition: nbtree.h:843
OffsetNumber baseoff
Definition: nbtree.h:842
Size maxpostingsize
Definition: nbtree.h:869
ItemPointer htids
Definition: nbtree.h:877
bool deduplicate
Definition: nbtree.h:867
OffsetNumber baseoff
Definition: nbtree.h:873
Size basetupsize
Definition: nbtree.h:874
BTDedupInterval intervals[MaxIndexTuplesPerPage]
Definition: nbtree.h:889
IndexTuple base
Definition: nbtree.h:872
Size phystupsize
Definition: nbtree.h:880
FullTransactionId safexid
Definition: nbtree.h:235
OffsetNumber stricthigh
Definition: nbtree.h:824
bool bounds_valid
Definition: nbtree.h:822
OffsetNumber low
Definition: nbtree.h:823
IndexTuple itup
Definition: nbtree.h:810
BTScanInsert itup_key
Definition: nbtree.h:812
uint32 btm_last_cleanup_num_delpages
Definition: nbtree.h:114
uint32 btm_level
Definition: nbtree.h:108
float8 btm_last_cleanup_num_heap_tuples
Definition: nbtree.h:116
BlockNumber btm_fastroot
Definition: nbtree.h:109
uint32 btm_version
Definition: nbtree.h:106
uint32 btm_magic
Definition: nbtree.h:105
BlockNumber btm_root
Definition: nbtree.h:107
bool btm_allequalimage
Definition: nbtree.h:118
uint32 btm_fastlevel
Definition: nbtree.h:110
int fillfactor
Definition: nbtree.h:1089
bool deduplicate_items
Definition: nbtree.h:1091
float8 vacuum_cleanup_index_scale_factor
Definition: nbtree.h:1090
int32 varlena_header_
Definition: nbtree.h:1088
BlockNumber btpo_next
Definition: nbtree.h:65
BlockNumber btpo_prev
Definition: nbtree.h:64
uint16 btpo_flags
Definition: nbtree.h:67
uint32 btpo_level
Definition: nbtree.h:66
BTCycleId btpo_cycleid
Definition: nbtree.h:68
FullTransactionId safexid
Definition: nbtree.h:328
BlockNumber target
Definition: nbtree.h:327
bool pivotsearch
Definition: nbtree.h:789
ItemPointer scantid
Definition: nbtree.h:790
bool allequalimage
Definition: nbtree.h:786
bool heapkeyspace
Definition: nbtree.h:785
bool anynullkeys
Definition: nbtree.h:787
ScanKeyData scankeys[INDEX_MAX_KEYS]
Definition: nbtree.h:792
BTArrayKeyInfo * arrayKeys
Definition: nbtree.h:1044
char * markTuples
Definition: nbtree.h:1057
BTScanPosData currPos
Definition: nbtree.h:1069
int * killedItems
Definition: nbtree.h:1048
char * currTuples
Definition: nbtree.h:1056
ScanKey arrayKeyData
Definition: nbtree.h:1039
BTScanPosData markPos
Definition: nbtree.h:1070
ScanKey keyData
Definition: nbtree.h:1036
MemoryContext arrayContext
Definition: nbtree.h:1045
bool moreRight
Definition: nbtree.h:965
Buffer buf
Definition: nbtree.h:952
BlockNumber currPage
Definition: nbtree.h:955
int firstItem
Definition: nbtree.h:980
int nextTupleOffset
Definition: nbtree.h:971
BlockNumber nextPage
Definition: nbtree.h:956
bool moreLeft
Definition: nbtree.h:964
int lastItem
Definition: nbtree.h:981
BTScanPosItem items[MaxTIDsPerBTreePage]
Definition: nbtree.h:984
int itemIndex
Definition: nbtree.h:982
XLogRecPtr lsn
Definition: nbtree.h:954
ItemPointerData heapTid
Definition: nbtree.h:945
LocationIndex tupleOffset
Definition: nbtree.h:947
OffsetNumber indexOffset
Definition: nbtree.h:946
BlockNumber bts_blkno
Definition: nbtree.h:728
struct BTStackData * bts_parent
Definition: nbtree.h:730
OffsetNumber bts_offset
Definition: nbtree.h:729
IndexBulkDeleteResult * stats
Definition: nbtree.h:334
BTCycleId cycleid
Definition: nbtree.h:337
BTPendingFSM * pendingpages
Definition: nbtree.h:345
int npendingpages
Definition: nbtree.h:346
IndexBulkDeleteCallback callback
Definition: nbtree.h:335
MemoryContext pagedelcontext
Definition: nbtree.h:338
IndexVacuumInfo * info
Definition: nbtree.h:333
int bufsize
Definition: nbtree.h:343
int maxbufsize
Definition: nbtree.h:344
void * callback_state
Definition: nbtree.h:336
uint16 deletetids[FLEXIBLE_ARRAY_MEMBER]
Definition: nbtree.h:910
uint16 ndeletedtids
Definition: nbtree.h:909
IndexTuple itup
Definition: nbtree.h:905
OffsetNumber updatedoffset
Definition: nbtree.h:906
ItemPointerData t_tid
Definition: itup.h:37
unsigned short t_info
Definition: itup.h:49
Definition: pg_list.h:52
Definition: type.h:95
Definition: regguts.h:318
Definition: c.h:623
static void callback(struct sockaddr *addr, struct sockaddr *mask, void *unused)
Definition: test_ifaddrs.c:46
#define FirstNormalFullTransactionId
Definition: transam.h:57
uint64 XLogRecPtr
Definition: xlogdefs.h:21