Lines Matching full:page
42 static int __bt_snext(BTREE *, PAGE *, const DBT *, int *);
43 static int __bt_sprev(BTREE *, PAGE *, const DBT *, int *);
62 PAGE *h; in __bt_search()
72 /* Do a binary search on the current page. */ in __bt_search()
73 t->bt_cur.page = h; in __bt_search()
90 * If it's a leaf page, we're almost done. If no duplicates in __bt_search()
92 * it's possible that there were matching keys on this page, in __bt_search()
93 * which later deleted, and we're on a page with no matches in __bt_search()
95 * end of a page, check the adjacent page. in __bt_search()
116 * decrement by one, and record the internal page which should in __bt_search()
117 * be a parent page for the key. If a split later occurs, the in __bt_search()
118 * inserted page will be to the right of the saved page. in __bt_search()
134 * h: current page
142 __bt_snext(BTREE *t, PAGE *h, const DBT *key, int *exactp) in __bt_snext()
147 * Get the next page. The key is either an exact in __bt_snext()
150 if ((e.page = mpool_get(t->bt_mp, h->nextpg, 0)) == NULL) in __bt_snext()
159 mpool_put(t->bt_mp, e.page, 0); in __bt_snext()
169 * h: current page
177 __bt_sprev(BTREE *t, PAGE *h, const DBT *key, int *exactp) in __bt_sprev()
182 * Get the previous page. The key is either an exact in __bt_sprev()
185 if ((e.page = mpool_get(t->bt_mp, h->prevpg, 0)) == NULL) in __bt_sprev()
187 e.index = NEXTINDEX(e.page) - 1; in __bt_sprev()
194 mpool_put(t->bt_mp, e.page, 0); in __bt_sprev()