diff options
Diffstat (limited to 'src/include/access/nbtree.h')
| -rw-r--r-- | src/include/access/nbtree.h | 12 |
1 files changed, 3 insertions, 9 deletions
diff --git a/src/include/access/nbtree.h b/src/include/access/nbtree.h index fedd539e5dc..b1c54366d88 100644 --- a/src/include/access/nbtree.h +++ b/src/include/access/nbtree.h @@ -6,7 +6,7 @@ * * Copyright (c) 1994, Regents of the University of California * - * $Id: nbtree.h,v 1.23 1999/02/13 23:20:55 momjian Exp $ + * $Id: nbtree.h,v 1.24 1999/03/28 20:32:34 vadim Exp $ * *------------------------------------------------------------------------- */ @@ -42,6 +42,7 @@ typedef struct BTPageOpaqueData { BlockNumber btpo_prev; BlockNumber btpo_next; + BlockNumber btpo_parent; uint16 btpo_flags; #define BTP_LEAF (1 << 0) @@ -177,13 +178,6 @@ typedef struct BTPageState #define BT_DESCENT 1 /* - * We must classify index modification types for the benefit of - * _bt_adjscans. - */ -#define BT_INSERT 0 -#define BT_DELETE 1 - -/* * In general, the btree code tries to localize its knowledge about * page layout to a couple of routines. However, we need a special * value to indicate "no page number" in those places where we expect @@ -268,7 +262,7 @@ extern void btdelete(Relation rel, ItemPointer tid); */ extern void _bt_regscan(IndexScanDesc scan); extern void _bt_dropscan(IndexScanDesc scan); -extern void _bt_adjscans(Relation rel, ItemPointer tid, int op); +extern void _bt_adjscans(Relation rel, ItemPointer tid); /* * prototypes for functions in nbtsearch.c |