lib/libc/db/btree/bt_close.c

117

BTREE *t;

lib/libc/db/btree/bt_close.c

156

bt_meta(BTREE *t)

lib/libc/db/btree/bt_close.c

49

static int bt_meta(BTREE *);

lib/libc/db/btree/bt_close.c

63

BTREE *t;

lib/libc/db/btree/bt_conv.c

128

if (!F_ISSET(((BTREE *)t), B_NEEDSWAP))

lib/libc/db/btree/bt_conv.c

63

if (!F_ISSET(((BTREE *)t), B_NEEDSWAP))

lib/libc/db/btree/bt_debug.c

130

BTREE *t;

lib/libc/db/btree/bt_debug.c

246

BTREE *t;

lib/libc/db/btree/bt_debug.c

55

BTREE *t;

lib/libc/db/btree/bt_delete.c

136

__bt_stkacq(BTREE *t, PAGE **hp, CURSOR *c)

lib/libc/db/btree/bt_delete.c

280

__bt_bdelete(BTREE *t, const DBT *key)

lib/libc/db/btree/bt_delete.c

365

__bt_pdelete(BTREE *t, PAGE *h)

lib/libc/db/btree/bt_delete.c

45

static int __bt_bdelete(BTREE *, const DBT *);

lib/libc/db/btree/bt_delete.c

459

__bt_dleaf(BTREE *t, const DBT *key, PAGE *h, unsigned int idx)

lib/libc/db/btree/bt_delete.c

46

static int __bt_curdel(BTREE *, const DBT *, PAGE *, unsigned int);

lib/libc/db/btree/bt_delete.c

47

static int __bt_pdelete(BTREE *, PAGE *);

lib/libc/db/btree/bt_delete.c

48

static int __bt_relink(BTREE *, PAGE *);

lib/libc/db/btree/bt_delete.c

49

static int __bt_stkacq(BTREE *, PAGE **, CURSOR *);

lib/libc/db/btree/bt_delete.c

520

__bt_curdel(BTREE *t, const DBT *key, PAGE *h, unsigned int idx)

lib/libc/db/btree/bt_delete.c

60

BTREE *t;

lib/libc/db/btree/bt_delete.c

615

__bt_relink(BTREE *t, PAGE *h)

lib/libc/db/btree/bt_get.c

60

BTREE *t;

lib/libc/db/btree/bt_open.c

158

if ((t = (BTREE *)calloc(1, sizeof(BTREE))) == NULL)

lib/libc/db/btree/bt_open.c

353

nroot(BTREE *t)

lib/libc/db/btree/bt_open.c

438

BTREE *t;

lib/libc/db/btree/bt_open.c

68

static int nroot(BTREE *);

lib/libc/db/btree/bt_open.c

93

BTREE *t;

lib/libc/db/btree/bt_overflow.c

129

__ovfl_put(BTREE *t, const DBT *dbt, pgno_t *pg)

lib/libc/db/btree/bt_overflow.c

180

__ovfl_delete(BTREE *t, void *p)

lib/libc/db/btree/bt_overflow.c

75

__ovfl_get(BTREE *t, void *p, size_t *ssz, void **buf, size_t *bufsz)

lib/libc/db/btree/bt_page.c

55

__bt_free(BTREE *t, PAGE *h)

lib/libc/db/btree/bt_page.c

79

__bt_new(BTREE *t, pgno_t *npg)

lib/libc/db/btree/bt_put.c

260

bt_fast(BTREE *t, const DBT *key, const DBT *data, int *exactp)

lib/libc/db/btree/bt_put.c

46

static EPG *bt_fast(BTREE *, const DBT *, const DBT *, int *);

lib/libc/db/btree/bt_put.c

64

BTREE *t;

lib/libc/db/btree/bt_search.c

143

__bt_snext(BTREE *t, PAGE *h, const DBT *key, int *exactp)

lib/libc/db/btree/bt_search.c

178

__bt_sprev(BTREE *t, PAGE *h, const DBT *key, int *exactp)

lib/libc/db/btree/bt_search.c

43

static int __bt_snext(BTREE *, PAGE *, const DBT *, int *);

lib/libc/db/btree/bt_search.c

44

static int __bt_sprev(BTREE *, PAGE *, const DBT *, int *);

lib/libc/db/btree/bt_search.c

61

__bt_search(BTREE *t, const DBT *key, int *exactp)

lib/libc/db/btree/bt_seq.c

144

__bt_seqset(BTREE *t, EPG *ep, DBT *key, int flags)

lib/libc/db/btree/bt_seq.c

228

__bt_seqadv(BTREE *t, EPG *ep, int flags)

lib/libc/db/btree/bt_seq.c

327

__bt_first(BTREE *t, const DBT *key, EPG *erval, int *exactp)

lib/libc/db/btree/bt_seq.c

424

__bt_setcur(BTREE *t, pgno_t pgno, unsigned int idx)

lib/libc/db/btree/bt_seq.c

46

static int __bt_first(BTREE *, const DBT *, EPG *, int *);

lib/libc/db/btree/bt_seq.c

47

static int __bt_seqadv(BTREE *, EPG *, int);

lib/libc/db/btree/bt_seq.c

48

static int __bt_seqset(BTREE *, EPG *, DBT *, int);

lib/libc/db/btree/bt_seq.c

74

BTREE *t;

lib/libc/db/btree/bt_split.c

332

bt_page(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)

lib/libc/db/btree/bt_split.c

430

bt_root(BTREE *t, PAGE *h, PAGE **lp, PAGE **rp, indx_t *skip, size_t ilen)

lib/libc/db/btree/bt_split.c

47

static int bt_broot(BTREE *, PAGE *, PAGE *, PAGE *);

lib/libc/db/btree/bt_split.c

473

bt_rroot(BTREE *t, PAGE *h, PAGE *l, PAGE *r)

lib/libc/db/btree/bt_split.c

48

static PAGE *bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);

lib/libc/db/btree/bt_split.c

49

static int bt_preserve(BTREE *, pgno_t);

lib/libc/db/btree/bt_split.c

50

static PAGE *bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t);

lib/libc/db/btree/bt_split.c

51

static PAGE *bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);

lib/libc/db/btree/bt_split.c

511

bt_broot(BTREE *t, PAGE *h, PAGE *l, PAGE *r)

lib/libc/db/btree/bt_split.c

52

static int bt_rroot(BTREE *, PAGE *, PAGE *, PAGE *);

lib/libc/db/btree/bt_split.c

586

bt_psplit(BTREE *t, PAGE *h, PAGE *l, PAGE *r, indx_t *pskip, size_t ilen)

lib/libc/db/btree/bt_split.c

75

__bt_split(BTREE *t, PAGE *sp, const DBT *key, const DBT *data, int flags,

lib/libc/db/btree/bt_split.c

760

bt_preserve(BTREE *t, pgno_t pg)

lib/libc/db/btree/bt_utils.c

141

__bt_cmp(BTREE *t, const DBT *k1, EPG *e)

lib/libc/db/btree/bt_utils.c

62

__bt_ret(BTREE *t, EPG *e, DBT *key, DBT *rkey, DBT *data, DBT *rdata, int copy)

lib/libc/db/btree/extern.h

37

int __bt_cmp(BTREE *, const DBT *, EPG *);

lib/libc/db/btree/extern.h

38

int __bt_crsrdel(BTREE *, EPGNO *);

lib/libc/db/btree/extern.h

42

int __bt_dleaf(BTREE *, const DBT *, PAGE *, unsigned int);

lib/libc/db/btree/extern.h

44

int __bt_free(BTREE *, PAGE *);

lib/libc/db/btree/extern.h

46

PAGE *__bt_new(BTREE *, pgno_t *);

lib/libc/db/btree/extern.h

49

int __bt_push(BTREE *, pgno_t, int);

lib/libc/db/btree/extern.h

51

int __bt_ret(BTREE *, EPG *, DBT *, DBT *, DBT *, DBT *, int);

lib/libc/db/btree/extern.h

52

EPG *__bt_search(BTREE *, const DBT *, int *);

lib/libc/db/btree/extern.h

54

void __bt_setcur(BTREE *, pgno_t, unsigned int);

lib/libc/db/btree/extern.h

55

int __bt_split(BTREE *, PAGE *,

lib/libc/db/btree/extern.h

59

int __ovfl_delete(BTREE *, void *);

lib/libc/db/btree/extern.h

60

int __ovfl_get(BTREE *, void *, size_t *, void **, size_t *);

lib/libc/db/btree/extern.h

61

int __ovfl_put(BTREE *, const DBT *, pgno_t *);

lib/libc/db/recno/extern.h

37

int __rec_dleaf(BTREE *, PAGE *, uint32_t);

lib/libc/db/recno/extern.h

39

int __rec_fmap(BTREE *, recno_t);

lib/libc/db/recno/extern.h

40

int __rec_fout(BTREE *);

lib/libc/db/recno/extern.h

41

int __rec_fpipe(BTREE *, recno_t);

lib/libc/db/recno/extern.h

43

int __rec_iput(BTREE *, recno_t, const DBT *, unsigned int);

lib/libc/db/recno/extern.h

45

int __rec_ret(BTREE *, EPG *, recno_t, DBT *, DBT *);

lib/libc/db/recno/extern.h

46

EPG *__rec_search(BTREE *, recno_t, enum SRCHOP);

lib/libc/db/recno/extern.h

49

int __rec_vmap(BTREE *, recno_t);

lib/libc/db/recno/extern.h

50

int __rec_vout(BTREE *);

lib/libc/db/recno/extern.h

51

int __rec_vpipe(BTREE *, recno_t);

lib/libc/db/recno/rec_close.c

107

BTREE *t;

lib/libc/db/recno/rec_close.c

59

BTREE *t;

lib/libc/db/recno/rec_delete.c

112

rec_rdelete(BTREE *t, recno_t nrec)

lib/libc/db/recno/rec_delete.c

144

__rec_dleaf(BTREE *t, PAGE *h, uint32_t idx)

lib/libc/db/recno/rec_delete.c

45

static int rec_rdelete(BTREE *, recno_t);

lib/libc/db/recno/rec_delete.c

61

BTREE *t;

lib/libc/db/recno/rec_get.c

113

__rec_fpipe(BTREE *t, recno_t top)

lib/libc/db/recno/rec_get.c

165

__rec_vpipe(BTREE *t, recno_t top)

lib/libc/db/recno/rec_get.c

220

__rec_fmap(BTREE *t, recno_t top)

lib/libc/db/recno/rec_get.c

266

__rec_vmap(BTREE *t, recno_t top)

lib/libc/db/recno/rec_get.c

60

BTREE *t;

lib/libc/db/recno/rec_open.c

219

BTREE *t;

lib/libc/db/recno/rec_open.c

56

BTREE *t;

lib/libc/db/recno/rec_put.c

186

__rec_iput(BTREE *t, recno_t nrec, const DBT *data, unsigned int flags)

lib/libc/db/recno/rec_put.c

59

BTREE *t;

lib/libc/db/recno/rec_search.c

59

__rec_search(BTREE *t, recno_t recno, enum SRCHOP op)

lib/libc/db/recno/rec_seq.c

58

BTREE *t;

lib/libc/db/recno/rec_utils.c

57

__rec_ret(BTREE *t, EPG *e, recno_t nrec, DBT *key, DBT *data)

lib/libc/db/test/btree.tests/main.c

668

BTREE *t;

lib/libc/db/test/btree.tests/main.c

696

mpool_stat(((BTREE *)db->internal)->bt_mp);

sys/net/zlib.c

3695

if (s->mode == BTREE || s->mode == DTREE)

sys/net/zlib.c

3858

s->mode = BTREE;

sys/net/zlib.c

3859

case BTREE: