indx_t             64 libdb/bt_conv.c 	indx_t i, top;
indx_t            132 libdb/bt_conv.c 	indx_t i, top;
indx_t            166 libdb/bt_debug.c 	indx_t cur, top;
indx_t            156 libdb/bt_delete.c 	indx_t index = 0;
indx_t            388 libdb/bt_delete.c 	indx_t cnt, index, *ip, offset;
indx_t            448 libdb/bt_delete.c 			pg->lower -= sizeof(indx_t);
indx_t            484 libdb/bt_delete.c 	indx_t cnt, *ip, offset;
indx_t            517 libdb/bt_delete.c 	h->lower -= sizeof(indx_t);
indx_t            140 libdb/bt_open.c 		    b.psize & (sizeof(indx_t) - 1)))
indx_t            262 libdb/bt_open.c 		    m.psize & (sizeof(indx_t) - 1))
indx_t            319 libdb/bt_open.c 	    (sizeof(indx_t) + NBLEAFDBT(0, 0));
indx_t            320 libdb/bt_open.c 	if (t->bt_ovflsize < NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t))
indx_t            322 libdb/bt_open.c 		    NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t);
indx_t             82 libdb/bt_put.c 	indx_t index, nxtindex;
indx_t            209 libdb/bt_put.c 	if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
indx_t            218 libdb/bt_put.c 		    (nxtindex - index) * sizeof(indx_t));
indx_t            219 libdb/bt_put.c 	h->lower += sizeof(indx_t);
indx_t            290 libdb/bt_put.c 	if (h->upper - h->lower < nbytes + sizeof(indx_t))
indx_t             71 libdb/bt_search.c 	indx_t base, index, lim;
indx_t            248 libdb/bt_seq.c 	indx_t index = 0;
indx_t             58 libdb/bt_split.c static PAGE	*bt_page(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
indx_t             60 libdb/bt_split.c static PAGE	*bt_psplit(BTREE *, PAGE *, PAGE *, PAGE *, indx_t *, size_t);
indx_t             61 libdb/bt_split.c static PAGE	*bt_root(BTREE *, PAGE *, PAGE **, PAGE **, indx_t *, size_t);
indx_t             96 libdb/bt_split.c 	indx_t nxtindex;
indx_t            219 libdb/bt_split.c 		if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
indx_t            230 libdb/bt_split.c 				    (nxtindex - skip) * sizeof(indx_t));
indx_t            231 libdb/bt_split.c 			h->lower += sizeof(indx_t);
indx_t            348 libdb/bt_split.c 	indx_t *skip;
indx_t            382 libdb/bt_split.c 		r->lower = BTDATAOFF + sizeof(indx_t);
indx_t            453 libdb/bt_split.c 	indx_t *skip;
indx_t            514 libdb/bt_split.c 	h->lower = BTDATAOFF + 2 * sizeof(indx_t);
indx_t            589 libdb/bt_split.c 	h->lower = BTDATAOFF + 2 * sizeof(indx_t);
indx_t            617 libdb/bt_split.c 	indx_t *pskip;
indx_t            626 libdb/bt_split.c 	indx_t full, half, nxt, off, skip, top, used;
indx_t            678 libdb/bt_split.c 		    used + nbytes + sizeof(indx_t) >= full) || nxt == top - 1) {
indx_t            691 libdb/bt_split.c 		used += nbytes + sizeof(indx_t);
indx_t            704 libdb/bt_split.c 	l->lower += (off + 1) * sizeof(indx_t);
indx_t            767 libdb/bt_split.c 	r->lower += off * sizeof(indx_t);
indx_t            771 libdb/bt_split.c 		r->lower += sizeof(indx_t);
indx_t            824 libdb/bt_split.c 	indx_t nxt, top;
indx_t             77 libdb/btree.h  	indx_t	lower;			/* lower bound of free space on page */
indx_t             78 libdb/btree.h  	indx_t	upper;			/* upper bound of free space on page */
indx_t             79 libdb/btree.h  	indx_t	linp[1];		/* indx_t-aligned VAR. LENGTH DATA */
indx_t             85 libdb/btree.h  	    sizeof(u_int32_t) + sizeof(indx_t) + sizeof(indx_t))
indx_t             86 libdb/btree.h  #define	NEXTINDEX(p)	(((p)->lower - BTDATAOFF) / sizeof(indx_t))
indx_t            239 libdb/btree.h  	indx_t	index;			/* the index on the page */
indx_t            244 libdb/btree.h  	indx_t	 index;			/* the index on the page */
indx_t            327 libdb/btree.h  	indx_t	  bt_ovflsize;		/* cut-off for key/data overflow */