Search for the page a given key should be in. * Stores a pointer to the found page in *mpp. * If key is NULL, search for the lowest page (used by md

Search for key within a leaf page, using binary search. * Returns the smallest entry larger or equal to the key. * If exactp is non-null, stores whe

Touch a page: make it dirty and re-insert into tree with updated pgno. */

Allocate a page and initialize it */

Allocate new page(s) for writing */

downgrade the exclusive lock on the region back to shared */

Move a node from src to dst. */

Split page <*mpp>, and insert <key,(data|newpgno)> in either left or * right sibling, at index <*newindxp> (as if unsplit). Updates *mpp and * *newi

Return the count of duplicate data items for the current key */

Windows doesn't support destructor callbacks for thread-specific storage */