Lines Matching refs:page
136 * Delete one or more entries from a page.
177 * the actual page item.
186 * Check for a duplicate after us on the page. NOTE:
196 * Check for a duplicate before us on the page. It
238 /* Mark the page dirty. */
244 * Adjust an index on the page.
282 /* Mark the page dirty. */
292 * Delete a page from the tree.
317 * Call __bam_search to reacquire the empty leaf page, but this time
318 * get both the leaf page and it's parent, locked. Walk back up the
320 * Once we have the top page that we want to delete locked, lock the
325 /* Acquire a page and its parent, locked. */
331 * If we reach the root or the page isn't going to be empty
334 h = cp->csp[-1].page;
339 (void)memp_fput(dbp->mpf, cp->csp[-1].page, 0);
341 (void)memp_fput(dbp->mpf, cp->csp[0].page, 0);
352 * cp->csp[-2].page is the top page, which we're not going to delete,
353 * and cp->csp[-1].page is the first page we are going to delete.
356 * retrieved the leaf page. If we find any pages that aren't going
360 for (h = cp->csp[-1].page;;) {
370 * Get the next page, write lock it and push it onto the stack.
383 /* Adjust back to reference the last page on the stack. */
390 /* Adjust back to reference the last page on the stack. */
427 * the leaf page chain around the leaf page being deleted. Consider
428 * a cursor walking through the leaf pages, that has the previous page
429 * read-locked and is waiting on a lock for the page we're deleting.
431 * selected to resolve the deadlock, we'll leave an empty leaf page
433 * we unlink the subtree, we relink the leaf page chain.
435 if ((ret = __db_relink(dbc, DB_REM_PAGE, cp->csp->page, NULL, 1)) != 0)
441 * Delete the highest page in the tree's reference to the underlying
442 * stack of pages. Then, release that page, letting the rest of the
445 if ((ret = __bam_ditem(dbc, epg->page, epg->indx)) != 0) {
450 pgno = epg->page->pgno;
451 nitems = NUM_ENT(epg->page);
453 (void)memp_fput(dbp->mpf, epg->page, 0);
466 * Delete page entries so they will be restored as part of
469 if (NUM_ENT(epg->page) != 0)
470 (void)__bam_ditem(dbc, epg->page, epg->indx);
472 (void)__bam_free(dbc, epg->page);
479 * if we've deleted the next-to-last element from the root page.
483 * If we've just deleted the last item from the root page, there is no
484 * further work to be done. The code above has emptied the root page
491 * If we just deleted the next-to-last item from the root page, the
493 * single item on the root page, write lock the last page referenced
494 * by the root page and copy it over the root page. If we can't get a
518 /* Lock the child page. */
542 * converting to a leaf page, we have to preserve the total
546 * stores its LSN on the child page. When the child is copied
568 * Free the page copied onto the root page and discard its
570 * to the page.)