lower              33 htags/incop.c  	static char lower[MAXPATHLEN];
lower              34 htags/incop.c  	char *t = lower, *end = lower + sizeof(lower);
lower              47 htags/incop.c  	return lower;
lower              79 libdb/bt_conv.c 	M_16_SWAP(h->lower);
lower             197 libdb/bt_conv.c 	M_16_SWAP(h->lower);
lower             189 libdb/bt_debug.c 	    h->lower, h->upper, top);
lower             268 libdb/bt_debug.c 			ifree += h->upper - h->lower;
lower             273 libdb/bt_debug.c 			lfree += h->upper - h->lower;
lower             420 libdb/bt_delete.c 				pg->lower = BTDATAOFF;
lower             442 libdb/bt_delete.c 			pg->lower -= sizeof(indx_t);
lower             509 libdb/bt_delete.c 	h->lower -= sizeof(indx_t);
lower             394 libdb/bt_open.c 	root->lower = BTDATAOFF;
lower             164 libdb/bt_overflow.c 		h->lower = h->upper = 0;
lower             208 libdb/bt_put.c 	if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
lower             218 libdb/bt_put.c 	h->lower += sizeof(indx_t);
lower             289 libdb/bt_put.c 	if (h->upper - h->lower < nbytes + sizeof(indx_t))
lower             218 libdb/bt_split.c 		if (h->upper - h->lower < nbytes + sizeof(indx_t)) {
lower             230 libdb/bt_split.c 			h->lower += sizeof(indx_t);
lower             359 libdb/bt_split.c 	r->lower = BTDATAOFF;
lower             380 libdb/bt_split.c 		r->lower = BTDATAOFF + sizeof(indx_t);
lower             398 libdb/bt_split.c 	l->lower = BTDATAOFF;
lower             469 libdb/bt_split.c 	l->lower = r->lower = BTDATAOFF;
lower             510 libdb/bt_split.c 	h->lower = BTDATAOFF + 2 * sizeof(indx_t);
lower             584 libdb/bt_split.c 	h->lower = BTDATAOFF + 2 * sizeof(indx_t);
lower             698 libdb/bt_split.c 	l->lower += (off + 1) * sizeof(indx_t);
lower             761 libdb/bt_split.c 	r->lower += off * sizeof(indx_t);
lower             765 libdb/bt_split.c 		r->lower += sizeof(indx_t);
lower              95 libdb/btree.h  	indx_t	lower;			/**< lower bound of free space on page */
lower             104 libdb/btree.h  #define	NEXTINDEX(p)	(((p)->lower - BTDATAOFF) / sizeof(indx_t))