Home | History | Annotate | Download | only in btree

Lines Matching refs:ep

145  *	ep:	storage for returned key
156 __bt_seqset(BTREE *t, EPG *ep, DBT *key, int flags)
177 		return (__bt_first(t, key, ep, &exact));
199 		ep->page = h;
200 		ep->index = 0;
224 		ep->page = h;
225 		ep->index = NEXTINDEX(h) - 1;
246 __bt_seqadv(BTREE *t, EPG *ep, int flags)
288 		if ((rval = __bt_first(t, &c->key, ep, &exact)) == RET_ERROR)
296 		c->pg.pgno = ep->page->pgno;
297 		c->pg.index = ep->index;
298 		mpool_put(t->bt_mp, ep->page, 0);
322 				ep->page = h;
323 				ep->index = idx;
324 				return __bt_rseq_next(t, ep);
344 			ep->page = h;
345 			ep->index = c->pg.index;
351 				ep->page = h;
352 				ep->index = idx;
353 				return __bt_rseq_prev(t, ep);
367 	ep->page = h;
368 	ep->index = idx;
375 __bt_rseq_next(BTREE *t, EPG *ep)
382 	h = ep->page;
383 	idx = ep->index;
405 	ep->page = h;
406 	ep->index = idx;
414 __bt_rseq_prev(BTREE *t, EPG *ep)
421 	h = ep->page;
422 	idx = ep->index;
444 	ep->page = h;
445 	ep->index = idx;
467 	EPG *ep, save;
478 	if ((ep = __bt_search(t, key, exactp)) == NULL)
482 			*erval = *ep;
491 		save = *ep;
492 		h = ep->page;
494 			if (save.page->pgno != ep->page->pgno) {
496 				save = *ep;
498 				save.index = ep->index;
505 			if (ep->index == 0) {
517 				ep->page = h = hprev;
518 				ep->index = NEXTINDEX(h);
520 			--ep->index;
521 		} while (__bt_cmp(t, key, ep) == 0);
536 	if (ep->index == NEXTINDEX(ep->page)) {
537 		h = ep->page;
544 		ep->index = 0;
545 		ep->page = h;
547 	*erval = *ep;