Lines Matching defs:stack
223 cp->sp = cp->stack;
224 cp->esp = cp->stack + sizeof(cp->stack) / sizeof(cp->stack[0]);
295 * 2. Closing a primary and an off-page duplicate cursor stack: we
302 * 3. Closing an off-page duplicate cursor stack: we get called with
340 * the problem is that we may be dealing with a stack of pages. The
342 * stack and we need the top of the stack.
553 * Discard the page references and locks, and confirm that the stack
582 if (cp->sp != cp->stack)
1794 int cmp, exact, own, ret, stack;
1802 split: ret = stack = 0;
1839 stack = 1;
1868 stack = 1;
1982 * that we're sorry we ever acquired). If stack is set and the
1984 * the stack, don't free them twice.
1986 if (stack)
2019 * If the tree has record numbers, we need a complete stack so
2045 * the leaf page. Note, the leaf page participated in any stack we
2046 * acquired, and so we have to adjust the stack as necessary. If
2047 * there was only a single page on the stack, we don't have to free
2048 * further stack pages.
2050 if (stack && BT_STK_POP(cp) != NULL)
2118 /* Release the stack. */
2478 * Insert the entry in the stack. (Our caller is likely to
2508 /* Initialize the cursor from the stack. */
2635 * If everything worked, delete the stack, otherwise, release the
2636 * stack and page locks without further damage.
2650 * Acquire a full stack for a cursor.
2682 /* Get a write-locked stack for the page. */