Lines Matching defs:stack
260 cp->sp = cp->stack;
261 cp->esp = cp->stack + sizeof(cp->stack) / sizeof(cp->stack[0]);
344 * 2. Closing a primary and an off-page duplicate cursor stack: we
351 * 3. Closing an off-page duplicate cursor stack: we get called with
389 * the problem is that we may be dealing with a stack of pages. The
391 * stack and we need the top of the stack.
607 * Discard the page references and locks, and confirm that the stack
667 if (cp->sp != cp->stack)
2059 int cmp, exact, own, ret, stack;
2068 split: ret = stack = 0;
2105 stack = 1;
2135 stack = 1;
2248 * that we're sorry we ever acquired). If stack is set and the
2250 * the stack, don't free them twice.
2252 if (stack)
2285 * If the tree has record numbers, we need a complete stack so
2311 * the leaf page. Note, the leaf page participated in any stack we
2312 * acquired, and so we have to adjust the stack as necessary. If
2313 * there was only a single page on the stack, we don't have to free
2314 * further stack pages.
2316 if (stack && BT_STK_POP(cp) != NULL)
2384 /* Release the stack. */
2760 * Insert the entry in the stack. (Our caller is likely to
2789 done: /* Initialize the cursor from the stack. */
2942 * If everything worked, delete the stack, otherwise, release the
2943 * stack and page locks without further damage.
2957 * Acquire a full stack for a cursor.
2993 /* Get a write-locked stack for the page. */