36#include "catalog/pg_opfamily_d.h"
55#define InvalidBtreeLevel ((uint32) InvalidBlockNumber)
56#define BTreeTupleGetNKeyAtts(itup, rel) \
57 Min(IndexRelationGetNumberOfKeyAttributes(rel), BTreeTupleGetNAtts(itup, rel))
178 void *
state,
bool readonly);
180 bool heapkeyspace,
bool readonly,
bool heapallindexed,
181 bool rootdescend,
bool checkunique);
212 bool tupleIsAlive,
void *checkstate);
255 args.heapallindexed =
false;
256 args.rootdescend =
false;
257 args.parentcheck =
false;
258 args.checkunique =
false;
287 args.heapallindexed =
false;
288 args.rootdescend =
false;
289 args.parentcheck =
true;
290 args.checkunique =
false;
318 (
errcode(ERRCODE_INDEX_CORRUPTED),
319 errmsg(
"index \"%s\" lacks a main relation fork",
324 if (allequalimage && !heapkeyspace)
326 (
errcode(ERRCODE_INDEX_CORRUPTED),
327 errmsg(
"index \"%s\" metapage has equalimage field set on unsupported nbtree version",
331 bool has_interval_ops =
false;
336 has_interval_ops =
true;
338 (
errcode(ERRCODE_INDEX_CORRUPTED),
339 errmsg(
"index \"%s\" metapage incorrectly indicates that deduplication is safe",
342 ?
errhint(
"This is known of \"interval\" indexes last built on a version predating 2023-11.")
349 args->heapallindexed,
args->rootdescend,
args->checkunique);
377 bool readonly,
bool heapallindexed,
bool rootdescend,
388 elog(
DEBUG1,
"verifying consistency of tree structure for index \"%s\"",
391 elog(
DEBUG1,
"verifying consistency of tree structure for index \"%s\" with cross-level checks",
405 state->heaprel = heaprel;
406 state->heapkeyspace = heapkeyspace;
407 state->readonly = readonly;
408 state->heapallindexed = heapallindexed;
409 state->rootdescend = rootdescend;
410 state->checkunique = checkunique;
413 if (
state->heapallindexed)
433 state->heaptuplespresent = 0;
442 if (!
state->readonly)
464 errmsg(
"index \"%s\" cannot be verified using transaction snapshot",
474 if (
state->checkunique)
477 if (
state->indexinfo->ii_Unique)
480 state->snapshot = snapshot;
487 if (
state->rootdescend && !
state->heapkeyspace)
489 (
errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
490 errmsg(
"cannot verify that tuples from index \"%s\" can each be found by an independent index search",
492 errhint(
"Only B-Tree version 4 indexes support rootdescend verification.")));
517 errdetail_internal(
"Fast root block %u (level %u) differs from true root block %u (level %u).",
540 (
errcode(ERRCODE_INDEX_CORRUPTED),
541 errmsg(
"index \"%s\" has no valid pages on level below %u or first level",
544 previouslevel = current.
level;
550 if (
state->heapallindexed)
593 elog(
DEBUG1,
"verifying that tuples from index \"%s\" are present in \"%s\"",
657 " (true root level)" : level.
level == 0 ?
" (leaf level)" :
"");
660 state->previncompletesplit =
false;
668 state->targetblock = current;
689 (
errcode(ERRCODE_INDEX_CORRUPTED),
690 errmsg(
"downlink or sibling link points to deleted block in index \"%s\"",
693 current, leftcurrent, opaque->
btpo_prev)));
697 (
errcode(ERRCODE_INDEX_CORRUPTED),
698 errmsg(
"block %u fell off the end of index \"%s\"",
720 (
errcode(ERRCODE_INDEX_CORRUPTED),
721 errmsg(
"block %u is not leftmost in index \"%s\"",
726 (
errcode(ERRCODE_INDEX_CORRUPTED),
727 errmsg(
"block %u is not true root in index \"%s\"",
787 (
errcode(ERRCODE_INDEX_CORRUPTED),
788 errmsg(
"leftmost down link for level points to block in index \"%s\" whose level is not one level down",
790 errdetail_internal(
"Block pointed to=%u expected level=%u level in pointed to block=%u.",
799 if (current == leftcurrent || current == opaque->
btpo_prev)
801 (
errcode(ERRCODE_INDEX_CORRUPTED),
802 errmsg(
"circular link chain found in block %u of index \"%s\"",
805 leftcurrent = current;
812 state->lowkey = NULL;
847 while (current !=
P_NONE);
853 state->lowkey = NULL;
859 return nextleveldown;
871 tid,
state->snapshot, slot);
903 if (nblock != lVis->
blkno || noffset != lVis->
offset)
904 nitid =
psprintf(
" tid=(%u,%u)", nblock, noffset);
910 pnposting =
psprintf(
" posting %u", nposting);
913 (
errcode(ERRCODE_INDEX_CORRUPTED),
914 errmsg(
"index uniqueness is violated for index \"%s\"",
916 errdetail(
"Index %s%s and%s%s (point to heap %s and %s) page lsn=%X/%X.",
917 itid, pposting, nitid, pnposting, htid, nhtid,
928 bool has_visible_entry =
false;
943 has_visible_entry =
true;
960 lVis->
blkno = targetblock;
978 has_visible_entry =
true;
987 lVis->
blkno = targetblock;
994 if (!has_visible_entry &&
996 lVis->
blkno != targetblock)
1004 errmsg(
"index uniqueness can not be checked for index tid=(%u,%u) in index \"%s\"",
1005 targetblock, offset,
1007 errdetail(
"It doesn't have visible heap tids and key is equal to the tid=(%u,%u)%s (points to heap tid=(%u,%u)).",
1011 errhint(
"VACUUM the table and repeat the check.")));
1027 reached_from =
start;
1028 bool all_half_dead =
true;
1036 while (reached !=
P_NONE && all_half_dead)
1050 reached != reached_from &&
1051 reached_opaque->
btpo_next == reached_from;
1059 errmsg_internal(
"harmless interrupted page deletion detected in index \"%s\"",
1062 reached, reached_from,
1065 reached_from = reached;
1072 return all_half_dead;
1118 if (!
state->readonly)
1148 if (newtargetblock != leftcurrent)
1152 state->checkstrategy);
1158 btpo_prev_from_target = opaque->
btpo_prev;
1180 if (btpo_prev_from_target == leftcurrent)
1184 (
errcode(ERRCODE_INTERNAL_ERROR),
1185 errmsg_internal(
"harmless concurrent page split detected in index \"%s\"",
1188 leftcurrent, newtargetblock,
1189 state->targetblock)));
1200 state->targetblock = newtargetblock;
1204 (
errcode(ERRCODE_INDEX_CORRUPTED),
1205 errmsg(
"left link/right link pair in index \"%s\" not in agreement",
1208 state->targetblock, leftcurrent,
1209 btpo_prev_from_target)));
1263 elog(
DEBUG2,
"verifying %u items on %s block %u", max,
1264 P_ISLEAF(topaque) ?
"leaf" :
"internal",
state->targetblock);
1283 (
errcode(ERRCODE_INDEX_CORRUPTED),
1284 errmsg(
"wrong number of high key index tuple attributes in index \"%s\"",
1289 P_ISLEAF(topaque) ?
"heap" :
"index",
1307 bool lowersizelimit;
1315 bool unique_checked =
false;
1320 state->target, offset);
1332 (
errcode(ERRCODE_INDEX_CORRUPTED),
1333 errmsg(
"index tuple size does not equal lp_len in index \"%s\"",
1336 state->targetblock, offset,
1339 errhint(
"This could be a torn page problem.")));
1356 (
errcode(ERRCODE_INDEX_CORRUPTED),
1357 errmsg(
"wrong number of index tuple attributes in index \"%s\"",
1362 P_ISLEAF(topaque) ?
"heap" :
"index",
1406 (
errcode(ERRCODE_INDEX_CORRUPTED),
1407 errmsg(
"could not find tuple using search from root page in index \"%s\"",
1432 char *itid =
psprintf(
"(%u,%u)",
state->targetblock, offset);
1435 (
errcode(ERRCODE_INDEX_CORRUPTED),
1436 errmsg_internal(
"posting list contains misplaced TID in index \"%s\"",
1488 (
errcode(ERRCODE_INDEX_CORRUPTED),
1489 errmsg(
"index row size %zu exceeds maximum for index \"%s\"",
1493 P_ISLEAF(topaque) ?
"heap" :
"index",
1515 if (norm != logtuple)
1595 (
errcode(ERRCODE_INDEX_CORRUPTED),
1596 errmsg(
"high key invariant violated for index \"%s\"",
1600 P_ISLEAF(topaque) ?
"heap" :
"index",
1641 (
errcode(ERRCODE_INDEX_CORRUPTED),
1642 errmsg(
"item order invariant violated for index \"%s\"",
1645 "higher index tid=%s (points to %s tid=%s) "
1648 P_ISLEAF(topaque) ?
"heap" :
"index",
1651 P_ISLEAF(topaque) ?
"heap" :
"index",
1662 if (
state->checkunique &&
state->indexinfo->ii_Unique &&
1668 unique_checked =
true;
1671 if (
state->checkunique &&
state->indexinfo->ii_Unique &&
1700 else if (!unique_checked)
1745 if (!
state->readonly)
1760 (
errcode(ERRCODE_INDEX_CORRUPTED),
1761 errmsg(
"cross page item order invariant violated for index \"%s\"",
1764 state->targetblock, offset,
1772 if (
state->checkunique &&
state->indexinfo->ii_Unique &&
1777 elog(
DEBUG2,
"check cross page unique condition");
1796 if (!unique_checked)
1813 (
errcode(ERRCODE_INDEX_CORRUPTED),
1814 errmsg(
"right block of leaf block is non-leaf for index \"%s\"",
1936 errmsg_internal(
"level %u sibling page in block %u of index \"%s\" was found deleted or half dead",
1938 errdetail_internal(
"Deleted page found when building scankey from right sibling.")));
2068 P_ISLEAF(opaque) ?
"leaf" :
"internal", targetnext,
2167 bool rightsplit =
state->previncompletesplit;
2176 state->target, target_downlinkoffnum);
2213 state->previncompletesplit =
false;
2220 (
errcode(ERRCODE_INDEX_CORRUPTED),
2221 errmsg(
"can't traverse from downlink %u to downlink %u of index \"%s\"",
2222 state->prevrightlink, downlink,
2226 if (blkno == downlink && loaded_child)
2227 page = loaded_child;
2237 (
errcode(ERRCODE_INDEX_CORRUPTED),
2238 errmsg(
"the first child of leftmost target page is not leftmost of its level in index \"%s\"",
2241 state->targetblock, blkno,
2248 (
errcode(ERRCODE_INDEX_CORRUPTED),
2249 errmsg(
"block found while following rightlinks from child of index \"%s\" has invalid level",
2251 errdetail_internal(
"Block pointed to=%u expected level=%u level in pointed to block=%u.",
2252 blkno, target_level - 1, opaque->
btpo_level)));
2255 if ((!first && blkno ==
state->prevrightlink) || blkno == opaque->
btpo_prev)
2257 (
errcode(ERRCODE_INDEX_CORRUPTED),
2258 errmsg(
"circular link chain found in block %u of index \"%s\"",
2261 if (blkno != downlink && !
P_IGNORE(opaque))
2305 if (blkno == downlink)
2308 pivotkey_offset = target_downlinkoffnum;
2323 (
errcode(ERRCODE_INDEX_CORRUPTED),
2324 errmsg(
"child high key is greater than rightmost pivot key on target level in index \"%s\"",
2327 state->targetblock, blkno,
2332 state->target, pivotkey_offset);
2353 (
errcode(ERRCODE_INDEX_CORRUPTED),
2354 errmsg(
"can't find left sibling high key in index \"%s\"",
2357 state->targetblock, blkno,
2359 itup =
state->lowkey;
2365 (
errcode(ERRCODE_INDEX_CORRUPTED),
2366 errmsg(
"mismatch between parent key and child high key in index \"%s\"",
2369 state->targetblock, blkno,
2375 if (blkno == downlink)
2378 state->previncompletesplit = rightsplit;
2386 if (page != loaded_child)
2419 state->target, downlinkoffnum);
2505 (
errcode(ERRCODE_INDEX_CORRUPTED),
2506 errmsg(
"downlink to deleted page found in index \"%s\"",
2509 state->targetblock, childblock,
2513 offset <= maxoffset;
2546 (
errcode(ERRCODE_INDEX_CORRUPTED),
2547 errmsg(
"down-link lower bound invariant violated for index \"%s\"",
2550 state->targetblock, childblock, offset,
2617 errmsg_internal(
"harmless interrupted page split detected in index \"%s\"",
2638 (
errcode(ERRCODE_INDEX_CORRUPTED),
2639 errmsg(
"leaf index block lacks downlink in index \"%s\"",
2646 elog(
DEBUG1,
"checking for interrupted multi-level deletion due to missing downlink in index \"%s\"",
2666 (
errcode(ERRCODE_INDEX_CORRUPTED),
2667 errmsg_internal(
"downlink points to block in index \"%s\" whose level is not one level down",
2669 errdetail_internal(
"Top parent/under check block=%u block pointed to=%u expected level=%u level in pointed to block=%u.",
2704 (
errcode(ERRCODE_INDEX_CORRUPTED),
2705 errmsg_internal(
"downlink to deleted leaf page found in index \"%s\"",
2707 errdetail_internal(
"Top parent/target block=%u leaf block=%u top parent/under check lsn=%X/%X.",
2730 (
errcode(ERRCODE_INDEX_CORRUPTED),
2731 errmsg(
"internal index block lacks downlink in index \"%s\"",
2795 bool *isnull,
bool tupleIsAlive,
void *checkstate)
2813 errmsg(
"heap tuple (%u,%u) from table \"%s\" lacks matching index tuple within index \"%s\"",
2819 ?
errhint(
"Retrying verification using the function bt_index_parent_check() might provide a more specific error.")
2822 state->heaptuplespresent++;
2868 bool formnewtup =
false;
2879 for (
i = 0;
i < tupleDescriptor->
natts;
i++)
2886 need_free[
i] =
false;
2890 if (att->attbyval || att->attlen != -1 || isnull[
i])
2900 (
errcode(ERRCODE_INDEX_CORRUPTED),
2901 errmsg(
"external varlena datum in tuple that references heap row (%u,%u) in index \"%s\"",
2907 (att->attstorage == TYPSTORAGE_EXTENDED ||
2908 att->attstorage == TYPSTORAGE_MAIN))
2921 need_free[
i] =
true;
2939 need_free[
i] =
true;
2968 for (
i = 0;
i < tupleDescriptor->
natts;
i++)
3051 insertstate.
itup = itup;
3056 insertstate.
buf = lbuf;
3134 if (!
key->heapkeyspace)
3165 if (
key->keysz == uppnkeyatts)
3166 return key->scantid == NULL && rheaptid != NULL;
3168 return key->keysz < uppnkeyatts;
3218 if (!
key->heapkeyspace)
3259 if (!
key->heapkeyspace)
3280 if (
key->keysz == uppnkeyatts)
3281 return key->scantid == NULL && childheaptid != NULL;
3283 return key->keysz < uppnkeyatts;
3318 state->checkstrategy);
3335 (
errcode(ERRCODE_INDEX_CORRUPTED),
3336 errmsg(
"invalid meta page found at block %u in index \"%s\"",
3347 (
errcode(ERRCODE_INDEX_CORRUPTED),
3348 errmsg(
"index \"%s\" meta page is corrupt",
3354 (
errcode(ERRCODE_INDEX_CORRUPTED),
3355 errmsg(
"version mismatch in index \"%s\": file version %d, "
3356 "current version %d, minimum supported version %d",
3376 (
errcode(ERRCODE_INDEX_CORRUPTED),
3377 errmsg_internal(
"invalid leaf page level %u for block %u in index \"%s\"",
3383 (
errcode(ERRCODE_INDEX_CORRUPTED),
3384 errmsg_internal(
"invalid internal page level 0 for block %u in index \"%s\"",
3411 (
errcode(ERRCODE_INDEX_CORRUPTED),
3412 errmsg(
"Number of items on block %u of index \"%s\" exceeds MaxIndexTuplesPerPage (%u)",
3418 (
errcode(ERRCODE_INDEX_CORRUPTED),
3419 errmsg(
"internal block %u in index \"%s\" lacks high key and/or at least one downlink",
3424 (
errcode(ERRCODE_INDEX_CORRUPTED),
3425 errmsg(
"non-rightmost leaf block %u in index \"%s\" lacks high key item",
3437 (
errcode(ERRCODE_INDEX_CORRUPTED),
3438 errmsg(
"internal page block %u in index \"%s\" is half-dead",
3440 errhint(
"This can be caused by an interrupted VACUUM in version 9.3 or older, before upgrade. Please REINDEX it.")));
3448 (
errcode(ERRCODE_INDEX_CORRUPTED),
3449 errmsg_internal(
"internal page block %u in index \"%s\" has garbage items",
3454 (
errcode(ERRCODE_INDEX_CORRUPTED),
3455 errmsg_internal(
"full transaction id page flag appears in non-deleted block %u in index \"%s\"",
3460 (
errcode(ERRCODE_INDEX_CORRUPTED),
3514 (
errcode(ERRCODE_INDEX_CORRUPTED),
3515 errmsg(
"line pointer points past end of tuple space in index \"%s\"",
3530 (
errcode(ERRCODE_INDEX_CORRUPTED),
3531 errmsg(
"invalid line pointer storage in index \"%s\"",
3559 (
errcode(ERRCODE_INDEX_CORRUPTED),
3560 errmsg_internal(
"block %u or its right sibling block or child block in index \"%s\" has unexpected pivot tuple",
3566 (
errcode(ERRCODE_INDEX_CORRUPTED),
3567 errmsg_internal(
"block %u or its right sibling block or child block in index \"%s\" has unexpected non-pivot tuple",
3574 (
errcode(ERRCODE_INDEX_CORRUPTED),
3575 errmsg(
"block %u or its right sibling block or child block in index \"%s\" contains non-pivot tuple that lacks a heap TID",
3606 return &itup->
t_tid;
#define InvalidBlockNumber
static bool BlockNumberIsValid(BlockNumber blockNumber)
void bloom_free(bloom_filter *filter)
bloom_filter * bloom_create(int64 total_elems, int bloom_work_mem, uint64 seed)
double bloom_prop_bits_set(bloom_filter *filter)
bool bloom_lacks_element(bloom_filter *filter, unsigned char *elem, size_t len)
void bloom_add_element(bloom_filter *filter, unsigned char *elem, size_t len)
static Datum values[MAXATTR]
void UnlockReleaseBuffer(Buffer buffer)
void LockBuffer(Buffer buffer, int mode)
Buffer ReadBufferExtended(Relation reln, ForkNumber forkNum, BlockNumber blockNum, ReadBufferMode mode, BufferAccessStrategy strategy)
#define RelationGetNumberOfBlocks(reln)
static Page BufferGetPage(Buffer buffer)
static bool BufferIsValid(Buffer bufnum)
static Item PageGetItem(const PageData *page, const ItemIdData *itemId)
static ItemId PageGetItemId(Page page, OffsetNumber offsetNumber)
static XLogRecPtr PageGetLSN(const PageData *page)
static OffsetNumber PageGetMaxOffsetNumber(const PageData *page)
int errmsg_internal(const char *fmt,...)
int errdetail_internal(const char *fmt,...)
int errdetail(const char *fmt,...)
int errhint(const char *fmt,...)
int errcode(int sqlerrcode)
int errmsg(const char *fmt,...)
#define ereport(elevel,...)
void ExecDropSingleTupleTableSlot(TupleTableSlot *slot)
#define PG_DETOAST_DATUM(datum)
#define PG_GETARG_BOOL(n)
BufferAccessStrategy GetAccessStrategy(BufferAccessStrategyType btype)
Assert(PointerIsAligned(start, uint64))
#define TOAST_INDEX_TARGET
static TransactionId HeapTupleHeaderGetXmin(const HeapTupleHeaderData *tup)
IndexInfo * BuildIndexInfo(Relation index)
IndexTuple index_form_tuple(TupleDesc tupleDescriptor, const Datum *values, const bool *isnull)
#define ItemIdGetLength(itemId)
#define ItemIdGetOffset(itemId)
#define ItemIdIsDead(itemId)
#define ItemIdIsUsed(itemId)
#define ItemIdIsRedirected(itemId)
#define ItemIdGetFlags(itemId)
int32 ItemPointerCompare(ItemPointer arg1, ItemPointer arg2)
static OffsetNumber ItemPointerGetOffsetNumber(const ItemPointerData *pointer)
static OffsetNumber ItemPointerGetOffsetNumberNoCheck(const ItemPointerData *pointer)
static BlockNumber ItemPointerGetBlockNumber(const ItemPointerData *pointer)
static BlockNumber ItemPointerGetBlockNumberNoCheck(const ItemPointerData *pointer)
static void ItemPointerCopy(const ItemPointerData *fromPointer, ItemPointerData *toPointer)
static bool ItemPointerIsValid(const ItemPointerData *pointer)
static bool IndexTupleHasVarwidths(const IndexTupleData *itup)
IndexTupleData * IndexTuple
static Datum index_getattr(IndexTuple tup, int attnum, TupleDesc tupleDesc, bool *isnull)
static Size IndexTupleSize(const IndexTupleData *itup)
#define MaxIndexTuplesPerPage
void * MemoryContextAlloc(MemoryContext context, Size size)
void MemoryContextReset(MemoryContext context)
void pfree(void *pointer)
void * palloc0(Size size)
MemoryContext CurrentMemoryContext
void MemoryContextDelete(MemoryContext context)
#define AllocSetContextCreate
#define ALLOCSET_DEFAULT_SIZES
#define CHECK_FOR_INTERRUPTS()
IndexTuple _bt_form_posting(IndexTuple base, ItemPointer htids, int nhtids)
void _bt_relbuf(Relation rel, Buffer buf)
void _bt_checkpage(Relation rel, Buffer buf)
void _bt_metaversion(Relation rel, bool *heapkeyspace, bool *allequalimage)
#define P_HAS_FULLXID(opaque)
#define P_ISHALFDEAD(opaque)
static uint16 BTreeTupleGetNPosting(IndexTuple posting)
static bool BTreeTupleIsPivot(IndexTuple itup)
#define BTREE_MIN_VERSION
#define P_HAS_GARBAGE(opaque)
#define BTPageGetOpaque(page)
#define P_ISDELETED(opaque)
static BlockNumber BTreeTupleGetTopParent(IndexTuple leafhikey)
#define MaxTIDsPerBTreePage
#define P_FIRSTDATAKEY(opaque)
#define P_RIGHTMOST(opaque)
#define P_INCOMPLETE_SPLIT(opaque)
static ItemPointer BTreeTupleGetPostingN(IndexTuple posting, int n)
static BlockNumber BTreeTupleGetDownLink(IndexTuple pivot)
static ItemPointer BTreeTupleGetMaxHeapTID(IndexTuple itup)
static bool BTreeTupleIsPosting(IndexTuple itup)
#define BTMaxItemSizeNoHeapTid
static ItemPointer BTreeTupleGetHeapTID(IndexTuple itup)
#define BTreeTupleGetNAtts(itup, rel)
BTStack _bt_search(Relation rel, Relation heaprel, BTScanInsert key, Buffer *bufP, int access)
OffsetNumber _bt_binsrch_insert(Relation rel, BTInsertState insertstate)
int32 _bt_compare(Relation rel, BTScanInsert key, Page page, OffsetNumber offnum)
void _bt_freestack(BTStack stack)
BTScanInsert _bt_mkscankey(Relation rel, IndexTuple itup)
bool _bt_check_natts(Relation rel, bool heapkeyspace, Page page, OffsetNumber offnum)
bool _bt_allequalimage(Relation rel, bool debugmessage)
#define InvalidOffsetNumber
#define OffsetNumberIsValid(offsetNumber)
#define OffsetNumberNext(offsetNumber)
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
FormData_pg_attribute * Form_pg_attribute
#define ERRCODE_DATA_CORRUPTED
uint64 pg_prng_uint64(pg_prng_state *state)
pg_prng_state pg_global_prng_state
#define ERRCODE_T_R_SERIALIZATION_FAILURE
static Datum PointerGetDatum(const void *X)
static Pointer DatumGetPointer(Datum X)
char * psprintf(const char *fmt,...)
static int cmp(const chr *x, const chr *y, size_t len)
static SMgrRelation RelationGetSmgr(Relation rel)
#define RelationGetDescr(relation)
#define RelationGetRelationName(relation)
#define IndexRelationGetNumberOfKeyAttributes(relation)
bool smgrexists(SMgrRelation reln, ForkNumber forknum)
Snapshot GetTransactionSnapshot(void)
void UnregisterSnapshot(Snapshot snapshot)
Snapshot RegisterSnapshot(Snapshot snapshot)
BufferAccessStrategy checkstrategy
BlockNumber prevrightlink
MemoryContext targetcontext
uint16 * ii_ExclusionStrats
struct HeapTupleData * rd_indextuple
TupleTableSlot * table_slot_create(Relation relation, List **reglist)
static TableScanDesc table_beginscan_strat(Relation rel, Snapshot snapshot, int nkeys, struct ScanKeyData *key, bool allow_strat, bool allow_sync)
static double table_index_build_scan(Relation table_rel, Relation index_rel, struct IndexInfo *index_info, bool allow_sync, bool progress, IndexBuildCallback callback, void *callback_state, TableScanDesc scan)
static bool table_tuple_fetch_row_version(Relation rel, ItemPointer tid, Snapshot snapshot, TupleTableSlot *slot)
bool TransactionIdPrecedes(TransactionId id1, TransactionId id2)
#define TransactionIdIsValid(xid)
static FormData_pg_attribute * TupleDescAttr(TupleDesc tupdesc, int i)
#define SET_VARSIZE_SHORT(PTR, len)
#define VARATT_CAN_MAKE_SHORT(PTR)
#define VARATT_IS_COMPRESSED(PTR)
#define VARATT_CONVERTED_SHORT_SIZE(PTR)
#define VARATT_IS_EXTERNAL(PTR)
void amcheck_lock_relation_and_check(Oid indrelid, Oid am_id, IndexDoCheckCallback check, LOCKMODE lockmode, void *state)
static bool offset_is_negative_infinity(BTPageOpaque opaque, OffsetNumber offset)
static bool bt_leftmost_ignoring_half_dead(BtreeCheckState *state, BlockNumber start, BTPageOpaque start_opaque)
static bool invariant_l_offset(BtreeCheckState *state, BTScanInsert key, OffsetNumber upperbound)
static ItemPointer BTreeTupleGetPointsToTID(IndexTuple itup)
struct BtreeCheckState BtreeCheckState
PG_MODULE_MAGIC_EXT(.name="amcheck",.version=PG_VERSION)
static IndexTuple bt_posting_plain_tuple(IndexTuple itup, int n)
struct BTCallbackState BTCallbackState
struct BtreeLastVisibleEntry BtreeLastVisibleEntry
static void bt_target_page_check(BtreeCheckState *state)
static void bt_check_every_level(Relation rel, Relation heaprel, bool heapkeyspace, bool readonly, bool heapallindexed, bool rootdescend, bool checkunique)
static void bt_report_duplicate(BtreeCheckState *state, BtreeLastVisibleEntry *lVis, ItemPointer nexttid, BlockNumber nblock, OffsetNumber noffset, int nposting)
static bool bt_pivot_tuple_identical(bool heapkeyspace, IndexTuple itup1, IndexTuple itup2)
static bool invariant_leq_offset(BtreeCheckState *state, BTScanInsert key, OffsetNumber upperbound)
Datum bt_index_parent_check(PG_FUNCTION_ARGS)
static void bt_child_highkey_check(BtreeCheckState *state, OffsetNumber target_downlinkoffnum, Page loaded_child, uint32 target_level)
static bool heap_entry_is_visible(BtreeCheckState *state, ItemPointer tid)
static BTScanInsert bt_mkscankey_pivotsearch(Relation rel, IndexTuple itup)
Datum bt_index_check(PG_FUNCTION_ARGS)
static BtreeLevel bt_check_level_from_leftmost(BtreeCheckState *state, BtreeLevel level)
static void bt_downlink_missing_check(BtreeCheckState *state, bool rightsplit, BlockNumber blkno, Page page)
PG_FUNCTION_INFO_V1(bt_index_check)
static ItemId PageGetItemIdCareful(BtreeCheckState *state, BlockNumber block, Page page, OffsetNumber offset)
static void bt_tuple_present_callback(Relation index, ItemPointer tid, Datum *values, bool *isnull, bool tupleIsAlive, void *checkstate)
static void bt_index_check_callback(Relation indrel, Relation heaprel, void *state, bool readonly)
static bool bt_rootdescend(BtreeCheckState *state, IndexTuple itup)
static BTScanInsert bt_right_page_check_scankey(BtreeCheckState *state, OffsetNumber *rightfirstoffset)
static bool invariant_g_offset(BtreeCheckState *state, BTScanInsert key, OffsetNumber lowerbound)
#define InvalidBtreeLevel
static Page palloc_btree_page(BtreeCheckState *state, BlockNumber blocknum)
static IndexTuple bt_normalize_tuple(BtreeCheckState *state, IndexTuple itup)
static void bt_recheck_sibling_links(BtreeCheckState *state, BlockNumber btpo_prev_from_target, BlockNumber leftcurrent)
static ItemPointer BTreeTupleGetHeapTIDCareful(BtreeCheckState *state, IndexTuple itup, bool nonpivot)
#define BTreeTupleGetNKeyAtts(itup, rel)
static void bt_child_check(BtreeCheckState *state, BTScanInsert targetkey, OffsetNumber downlinkoffnum)
static void bt_entry_unique_check(BtreeCheckState *state, IndexTuple itup, BlockNumber targetblock, OffsetNumber offset, BtreeLastVisibleEntry *lVis)
static bool invariant_l_nontarget_offset(BtreeCheckState *state, BTScanInsert key, BlockNumber nontargetblock, Page nontarget, OffsetNumber upperbound)
struct BtreeLevel BtreeLevel
#define IsolationUsesXactSnapshot()
#define LSN_FORMAT_ARGS(lsn)