btree.h File Reference

#include "btree_auto.h"
#include "btree_ext.h"
#include "db_am.h"

Go to the source code of this file.

Classes
struct	__btree
struct	__cursor
struct	__epg
Defines
#define	BI_DELETED   0x01
#define	BT_STK_CLR(c)   ((c)->csp = (c)->sp)
#define	BT_STK_ENTER(dbenv, c, pagep, page_indx, l, mode, ret)
#define	BT_STK_NUM(dbenv, c, pagep, page_indx, ret)
#define	BT_STK_NUMPUSH(dbenv, c, pagep, page_indx, ret)
#define	BT_STK_POP(c)   ((c)->csp == (c)->stack ? NULL : --(c)->csp)
#define	BT_STK_PUSH(dbenv, c, pagep, page_indx, lock, mode, ret)
#define	C_DELETED   0x0001
#define	C_RECNUM   0x0002
#define	C_RENUMBER   0x0004
#define	CAD_UPDATEROOT   0x01
#define	DEFMINKEYPAGE   (2)
#define	ISINTERNAL(p)   (TYPE(p) == P_IBTREE || TYPE(p) == P_IRECNO)
#define	ISLEAF(p)
#define	RECNO_MODIFIED   0x01
#define	RECNO_READFILE   0x02
#define	S_APPEND   0x00040
#define	S_DELETE   (S_WRITE | S_DUPFIRST | S_DELNO | S_EXACT | S_STACK)
#define	S_DELNO   0x00080
#define	S_DUPFIRST   0x00100
#define	S_DUPLAST   0x00200
#define	S_EXACT   0x00400
#define	S_FIND   (S_READ | S_DUPFIRST | S_DELNO)
#define	S_FIND_WR   (S_WRITE | S_DUPFIRST | S_DELNO)
#define	S_INSERT   (S_WRITE | S_DUPLAST | S_PAST_EOF | S_STACK)
#define	S_KEYFIRST   (S_WRITE | S_DUPFIRST | S_PAST_EOF | S_STACK)
#define	S_KEYLAST   (S_WRITE | S_DUPLAST | S_PAST_EOF | S_STACK)
#define	S_PARENT   0x00800
#define	S_PAST_EOF   0x02000
#define	S_READ   0x00001
#define	S_STACK   0x01000
#define	S_STK_ONLY   0x04000
#define	S_WRITE   0x00002
#define	S_WRPAIR   (S_WRITE | S_DUPLAST | S_PAST_EOF | S_PARENT)
#define	SPL_NRECS   0x01
#define	STK_CLRDBC   0x01
#define	STK_NOLOCK   0x02
Typedefs
typedef struct __btree	BTREE
typedef struct __cursor	BTREE_CURSOR
typedef struct __epg	EPG
typedef struct __recno	RECNO
Enumerations
enum	ca_recno_arg { CA_DELETE, CA_IAFTER, CA_IBEFORE }