lib/libc/db/btree/bt_conv.c

124

indx_t i, top;

lib/libc/db/btree/bt_conv.c

59

indx_t i, top;

lib/libc/db/btree/bt_debug.c

151

indx_t cur, top;

lib/libc/db/btree/bt_delete.c

142

indx_t idx;

lib/libc/db/btree/bt_delete.c

370

indx_t cnt, idx, *ip, offset;

lib/libc/db/btree/bt_delete.c

430

pg->lower -= sizeof(indx_t);

lib/libc/db/btree/bt_delete.c

462

indx_t cnt, *ip, offset;

lib/libc/db/btree/bt_delete.c

495

h->lower -= sizeof(indx_t);

lib/libc/db/btree/bt_open.c

124

b.psize & (sizeof(indx_t) - 1) ))

lib/libc/db/btree/bt_open.c

242

m.psize & (sizeof(indx_t) - 1) )

lib/libc/db/btree/bt_open.c

299

(sizeof(indx_t) + NBLEAFDBT(0, 0));

lib/libc/db/btree/bt_open.c

300

if (t->bt_ovflsize < NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t))

lib/libc/db/btree/bt_open.c

302

NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t);

lib/libc/db/btree/bt_put.c

197

if ((uint32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) {

lib/libc/db/btree/bt_put.c

206

(nxtindex - idx) * sizeof(indx_t));

lib/libc/db/btree/bt_put.c

207

h->lower += sizeof(indx_t);

lib/libc/db/btree/bt_put.c

278

if ((uint32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t))

lib/libc/db/btree/bt_put.c

68

indx_t idx, nxtindex;

lib/libc/db/btree/bt_search.c

64

indx_t base, idx, lim;

lib/libc/db/btree/bt_seq.c

232

indx_t idx;

lib/libc/db/btree/bt_split.c

206

if ((uint32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) {

lib/libc/db/btree/bt_split.c

217

(nxtindex - skip) * sizeof(indx_t));

lib/libc/db/btree/bt_split.c

218

h->lower += sizeof(indx_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

365

r->lower = BTDATAOFF + sizeof(indx_t);

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

48

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

lib/libc/db/btree/bt_split.c

488

h->lower = BTDATAOFF + 2 * sizeof(indx_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

561

h->lower = BTDATAOFF + 2 * sizeof(indx_t);

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

594

indx_t full, half, nxt, off, skip, top, used;

lib/libc/db/btree/bt_split.c

645

if ((skip <= off && used + nbytes + sizeof(indx_t) >= full) ||

lib/libc/db/btree/bt_split.c

659

used += nbytes + sizeof(indx_t);

lib/libc/db/btree/bt_split.c

672

l->lower += (off + 1) * sizeof(indx_t);

lib/libc/db/btree/bt_split.c

735

r->lower += off * sizeof(indx_t);

lib/libc/db/btree/bt_split.c

739

r->lower += sizeof(indx_t);

lib/libc/db/btree/bt_split.c

789

indx_t nxt, top;

lib/libc/db/btree/bt_split.c

83

indx_t nxtindex;

lib/libc/db/btree/btree.h

242

indx_t index; /* the index on the page */

lib/libc/db/btree/btree.h

247

indx_t index; /* the index on the page */

lib/libc/db/btree/btree.h

330

indx_t bt_ovflsize; /* cut-off for key/data overflow */

lib/libc/db/btree/btree.h

79

indx_t lower; /* lower bound of free space on page */

lib/libc/db/btree/btree.h

80

indx_t upper; /* upper bound of free space on page */

lib/libc/db/btree/btree.h

81

indx_t linp[1]; /* indx_t-aligned VAR. LENGTH DATA */

lib/libc/db/btree/btree.h

87

sizeof(uint32_t) + sizeof(indx_t) + sizeof(indx_t))

lib/libc/db/btree/btree.h

88

#define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t))

lib/libc/db/recno/rec_delete.c

147

indx_t *ip, cnt, offset;

lib/libc/db/recno/rec_delete.c

181

h->lower -= sizeof(indx_t);

lib/libc/db/recno/rec_put.c

191

indx_t idx, nxtindex;

lib/libc/db/recno/rec_put.c

251

if ((uint32_t)(h->upper - h->lower) < nbytes + sizeof(indx_t)) {

lib/libc/db/recno/rec_put.c

260

(nxtindex - idx) * sizeof(indx_t));

lib/libc/db/recno/rec_put.c

261

h->lower += sizeof(indx_t);

lib/libc/db/recno/rec_search.c

61

indx_t idx;

lib/libc/db/recno/rec_search.c

66

indx_t top;