indx_t             63 libdb/bt_conv.c 	indx_t i, top;
indx_t            140 libdb/bt_conv.c 	indx_t i, top;
indx_t            163 libdb/bt_debug.c 	indx_t cur, top;
indx_t            154 libdb/bt_delete.c 	indx_t index = 0;
indx_t            382 libdb/bt_delete.c 	indx_t cnt, index, *ip, offset;
indx_t            442 libdb/bt_delete.c 			pg->lower -= sizeof(indx_t);
indx_t            476 libdb/bt_delete.c 	indx_t cnt, *ip, offset;
indx_t            509 libdb/bt_delete.c 	h->lower -= sizeof(indx_t);
indx_t            141 libdb/bt_open.c 		    b.psize & (sizeof(indx_t) - 1)))
indx_t            263 libdb/bt_open.c 		    m.psize & (sizeof(indx_t) - 1))
indx_t            320 libdb/bt_open.c 	    (sizeof(indx_t) + NBLEAFDBT(0, 0));
indx_t            321 libdb/bt_open.c 	if (t->bt_ovflsize < NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t))
indx_t            323 libdb/bt_open.c 		    NBLEAFDBT(NOVFLSIZE, NOVFLSIZE) + sizeof(indx_t);
indx_t             81 libdb/bt_put.c 	indx_t index, nxtindex;
indx_t            208 libdb/bt_put.c 	if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
indx_t            217 libdb/bt_put.c 		    (nxtindex - index) * sizeof(indx_t));
indx_t            218 libdb/bt_put.c 	h->lower += sizeof(indx_t);
indx_t            289 libdb/bt_put.c 	if (h->upper - h->lower < nbytes + sizeof(indx_t))
indx_t             70 libdb/bt_search.c 	indx_t base, index, lim;
indx_t            247 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             95 libdb/bt_split.c 	indx_t nxtindex;
indx_t            218 libdb/bt_split.c 		if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
indx_t            229 libdb/bt_split.c 				    (nxtindex - skip) * sizeof(indx_t));
indx_t            230 libdb/bt_split.c 			h->lower += sizeof(indx_t);
indx_t            346 libdb/bt_split.c 	indx_t *skip;
indx_t            380 libdb/bt_split.c 		r->lower = BTDATAOFF + sizeof(indx_t);
indx_t            450 libdb/bt_split.c 	indx_t *skip;
indx_t            510 libdb/bt_split.c 	h->lower = BTDATAOFF + 2 * sizeof(indx_t);
indx_t            584 libdb/bt_split.c 	h->lower = BTDATAOFF + 2 * sizeof(indx_t);
indx_t            611 libdb/bt_split.c 	indx_t *pskip;
indx_t            620 libdb/bt_split.c 	indx_t full, half, nxt, off, skip, top, used;
indx_t            672 libdb/bt_split.c 		    used + nbytes + sizeof(indx_t) >= full) || nxt == top - 1) {
indx_t            685 libdb/bt_split.c 		used += nbytes + sizeof(indx_t);
indx_t            698 libdb/bt_split.c 	l->lower += (off + 1) * sizeof(indx_t);
indx_t            761 libdb/bt_split.c 	r->lower += off * sizeof(indx_t);
indx_t            765 libdb/bt_split.c 		r->lower += sizeof(indx_t);
indx_t            816 libdb/bt_split.c 	indx_t nxt, top;
indx_t             95 libdb/btree.h  	indx_t	lower;			/**< lower bound of free space on page */
indx_t             96 libdb/btree.h  	indx_t	upper;			/**< upper bound of free space on page */
indx_t             97 libdb/btree.h  	indx_t	linp[1];		/**< #indx_t-aligned VAR. LENGTH DATA */
indx_t            103 libdb/btree.h  	    sizeof(u_int32_t) + sizeof(indx_t) + sizeof(indx_t))
indx_t            104 libdb/btree.h  #define	NEXTINDEX(p)	(((p)->lower - BTDATAOFF) / sizeof(indx_t))
indx_t            260 libdb/btree.h  	indx_t	index;			/**< the index on the page */
indx_t            265 libdb/btree.h  	indx_t	 index;			/**< the index on the page */
indx_t            354 libdb/btree.h  	indx_t	  bt_ovflsize;		/**< cut-off for key/data overflow */