Lines Matching refs:cursor
123 * the page the cursor references if they're successful.
172 * Pins the page the cursor references.
190 * cursor at it. The cursor may not be moved until a new key has
278 * There are a couple of states that we can be in. The cursor has
284 * The cursor was deleted and there weren't any duplicate records,
285 * so the cursor's key was saved. Find out where that key would
291 * the cursor record and then replaces it, so the cursor was saved,
294 * match, we could as easily put the new record before the cursor,
299 * In the current implementation, put's to the cursor are done with
304 * cursor record is deleted, moving the cursor forward or backward
306 * ahead of the cursor because duplicates aren't sorted in any way,
324 /* Get the page referenced by the cursor. */
329 * Find the next/previous record in the tree and point the cursor at
330 * it. The cursor may not be moved until a new key has been found.
335 * The cursor was deleted in duplicate records, and moved
354 * The cursor was deleted in duplicate records, and moved
494 * Set the cursor to an entry in the tree.
515 /* Update the cursor. */
521 /* Recursive descent cursor. */
523 CURSOR cursor;
665 * the page the cursor references if they're successful.
670 if (F_ISSET(&rc->cursor, CURS_INIT)) {
710 * rc: recursion cursor
714 * Pins the page the cursor references.
715 * Updates rc's stack and cursor.
734 * cursor at it. The cursor may not be moved until a new key has
792 rc->cursor.pg.pgno = ep->page->pgno;
793 rc->cursor.pg.index = ep->index;
794 F_CLR(&rc->cursor, CURS_ACQUIRE | CURS_AFTER | CURS_BEFORE);
795 F_SET(&rc->cursor, CURS_INIT);
806 * rc: recursion cursor
811 * Updates rc's stack and cursor.
831 * There are a couple of states that we can be in. The cursor has
834 c = &rc->cursor;
836 /* Get the page referenced by the cursor. */
841 * Find the next/previous record in the tree and point the cursor at
842 * it. The cursor may not be moved until a new key has been found.