Lines Matching refs:PAGE
51 static int __bt_snext(BTREE *, PAGE *, const DBT *, int *);
52 static int __bt_sprev(BTREE *, PAGE *, const DBT *, int *);
71 PAGE *h;
81 /* Do a binary search on the current page. */
82 t->bt_cur.page = h;
99 * If it's a leaf page, we're almost done. If no duplicates
101 * it's possible that there were matching keys on this page,
102 * which later deleted, and we're on a page with no matches
104 * end of a page, check the adjacent page.
125 * decrement by one, and record the internal page which should
126 * be a parent page for the key. If a split later occurs, the
127 * inserted page will be to the right of the saved page.
143 * h: current page
151 __bt_snext(BTREE *t, PAGE *h, const DBT *key, int *exactp)
161 * Get the next page. The key is either an exact
164 if ((e.page = mpool_get(t->bt_mp, h->nextpg, 0)) == NULL)
168 mpool_put(t->bt_mp, e.page, 0);
181 /* Get the parent page. */
202 /* Lose the currently pinned page. */
220 * h: current page
228 __bt_sprev(BTREE *t, PAGE *h, const DBT *key, int *exactp)
238 * Get the previous page. The key is either an exact
241 if ((e.page = mpool_get(t->bt_mp, h->prevpg, 0)) == NULL)
243 e.index = NEXTINDEX(e.page) - 1;
245 mpool_put(t->bt_mp, e.page, 0);
259 /* Get the parent page. */
278 /* Lose the currently pinned page. */
Indexes created Mon Oct 20 20:10:13 GMT 2025