Lines Matching defs:cursor
129 * the page the cursor references if they're successful.
178 * Pins the page the cursor references.
196 * cursor at it. The cursor may not be moved until a new key has
284 * There are a couple of states that we can be in. The cursor has
290 * The cursor was deleted and there weren't any duplicate records,
291 * so the cursor's key was saved. Find out where that key would
297 * the cursor record and then replaces it, so the cursor was saved,
300 * match, we could as easily put the new record before the cursor,
305 * In the current implementation, put's to the cursor are done with
310 * cursor record is deleted, moving the cursor forward or backward
312 * ahead of the cursor because duplicates aren't sorted in any way,
330 /* Get the page referenced by the cursor. */
335 * Find the next/previous record in the tree and point the cursor at
336 * it. The cursor may not be moved until a new key has been found.
341 * The cursor was deleted in duplicate records, and moved
360 * The cursor was deleted in duplicate records, and moved
497 * Set the cursor to an entry in the tree.
518 /* Update the cursor. */
524 /* Recursive descent cursor. */
526 CURSOR cursor;
668 * the page the cursor references if they're successful.
673 if (F_ISSET(&rc->cursor, CURS_INIT)) {
713 * rc: recursion cursor
717 * Pins the page the cursor references.
718 * Updates rc's stack and cursor.
737 * cursor at it. The cursor may not be moved until a new key has
795 rc->cursor.pg.pgno = ep->page->pgno;
796 rc->cursor.pg.index = ep->index;
797 F_CLR(&rc->cursor, CURS_ACQUIRE | CURS_AFTER | CURS_BEFORE);
798 F_SET(&rc->cursor, CURS_INIT);
809 * rc: recursion cursor
814 * Updates rc's stack and cursor.
834 * There are a couple of states that we can be in. The cursor has
837 c = &rc->cursor;
839 /* Get the page referenced by the cursor. */
844 * Find the next/previous record in the tree and point the cursor at
845 * it. The cursor may not be moved until a new key has been found.