lib/libc/db/btree/bt_debug.c

362

pleaf *= t->bt_psize - BTDATAOFF;

lib/libc/db/btree/bt_debug.c

368

pinternal *= t->bt_psize - BTDATAOFF;

lib/libc/db/btree/bt_delete.c

416

pg->lower = BTDATAOFF;

lib/libc/db/btree/bt_open.c

296

temp = (t->bt_psize - BTDATAOFF) / b.minkeypage -

lib/libc/db/btree/bt_open.c

383

root->lower = BTDATAOFF;

lib/libc/db/btree/bt_overflow.c

111

temp = t->bt_psize - BTDATAOFF;

lib/libc/db/btree/bt_overflow.c

119

memmove(p, (char *)(void *)h + BTDATAOFF, nb);

lib/libc/db/btree/bt_overflow.c

152

temp = t->bt_psize - BTDATAOFF;

lib/libc/db/btree/bt_overflow.c

170

(void)memmove((char *)(void *)h + BTDATAOFF, p, (size_t)nb);

lib/libc/db/btree/bt_overflow.c

221

temp = t->bt_psize - BTDATAOFF;

lib/libc/db/btree/bt_split.c

359

r->lower = BTDATAOFF;

lib/libc/db/btree/bt_split.c

380

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

lib/libc/db/btree/bt_split.c

398

l->lower = BTDATAOFF;

lib/libc/db/btree/bt_split.c

466

l->lower = r->lower = BTDATAOFF;

lib/libc/db/btree/bt_split.c

513

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

lib/libc/db/btree/bt_split.c

589

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

lib/libc/db/btree/bt_split.c

635

temp = t->bt_psize - BTDATAOFF;

lib/libc/db/btree/btree.h

93

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