Lines Matching defs:to
7 * This code is derived from software contributed to Berkeley by
23 * may be used to endorse or promote products derived from this software
83 /* Check for change to a read-only tree. */
106 * If the page is about to be emptied, we'll need to
107 * delete it, which means we have to acquire a stack.
139 * hp: pointer to current, pinned PAGE pointer
140 * c: pointer to the cursor
175 * Move right, looking for the page. At each move we have to move
176 * up the stack until we don't have to move to the next page. If
177 * we have to change pages at an internal level, we have to fix the
191 /* Move to the next index. */
230 * Move left, looking for the page. At each move we have to move
231 * up the stack until we don't have to change pages to move to the
232 * next page. If we have to change pages at an internal level, we
233 * have to fix the stack back up.
246 /* Move to the next index. */
287 * key: key to delete
338 /* Delete from the key to the beginning of the page. */
396 * a page, so we have to delete the key from the parent page.
470 * idx: index on page to delete
485 void *to;
496 to = bl = GETBLEAF(h, idx);
506 memmove(from + nbytes, from, (char *)to - from);
535 * idx: idx on page to delete
553 * If there are duplicates, move forward or backward to one.
562 * We're going to have to do comparisons. If we weren't
637 * h: page to be deleted