lower 33 htags/incop.c static char lower[MAXPATHLEN];
lower 34 htags/incop.c char *t = lower, *end = lower + sizeof(lower);
lower 41 htags/incop.c return lower;
lower 80 libdb/bt_conv.c M_16_SWAP(h->lower);
lower 189 libdb/bt_conv.c M_16_SWAP(h->lower);
lower 192 libdb/bt_debug.c h->lower, h->upper, top);
lower 272 libdb/bt_debug.c ifree += h->upper - h->lower;
lower 277 libdb/bt_debug.c lfree += h->upper - h->lower;
lower 426 libdb/bt_delete.c pg->lower = BTDATAOFF;
lower 448 libdb/bt_delete.c pg->lower -= sizeof(indx_t);
lower 517 libdb/bt_delete.c h->lower -= sizeof(indx_t);
lower 395 libdb/bt_open.c root->lower = BTDATAOFF;
lower 166 libdb/bt_overflow.c h->lower = h->upper = 0;
lower 209 libdb/bt_put.c if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
lower 219 libdb/bt_put.c h->lower += sizeof(indx_t);
lower 290 libdb/bt_put.c if (h->upper - h->lower < nbytes + sizeof(indx_t))
lower 219 libdb/bt_split.c if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
lower 231 libdb/bt_split.c h->lower += sizeof(indx_t);
lower 361 libdb/bt_split.c r->lower = BTDATAOFF;
lower 382 libdb/bt_split.c r->lower = BTDATAOFF + sizeof(indx_t);
lower 400 libdb/bt_split.c l->lower = BTDATAOFF;
lower 472 libdb/bt_split.c l->lower = r->lower = BTDATAOFF;
lower 514 libdb/bt_split.c h->lower = BTDATAOFF + 2 * sizeof(indx_t);
lower 589 libdb/bt_split.c h->lower = BTDATAOFF + 2 * sizeof(indx_t);
lower 704 libdb/bt_split.c l->lower += (off + 1) * sizeof(indx_t);
lower 767 libdb/bt_split.c r->lower += off * sizeof(indx_t);
lower 771 libdb/bt_split.c r->lower += sizeof(indx_t);
lower 77 libdb/btree.h indx_t lower; /* lower bound of free space on page */
lower 86 libdb/btree.h #define NEXTINDEX(p) (((p)->lower - BTDATAOFF) / sizeof(indx_t))