58  * __BT_SPLIT -- Split the tree.
62  *	sp:	page to split
88 	 * Split the page into two pages, l and r.  The split routines return  in __bt_split()
102 	 * always cause a leaf page to split first.)  in __bt_split()
111 	/* If the root page was split, make it look right. */  in __bt_split()
119 	 * were traversed when we searched for the page that split.  Each stack  in __bt_split()
121 	 * the page traversed on the search.  We've just split a page, so we  in __bt_split()
124 	 * If the insert into the parent page causes it to split, may have to  in __bt_split()
126 	 * splits or the page inserted into didn't have to split to hold the  in __bt_split()
130 	 * in the case of a key being placed at index 0 causing the split, the  in __bt_split()
149 		 * The new key goes ONE AFTER the index, because the split  in __bt_split()
203 		/* Split the parent page if necessary or shift the indices. */  in __bt_split()
243 			 * Update the left page count.  If split  in __bt_split()
261 			 * Update the left page count.  If split  in __bt_split()
287 		/* If the root page was split, make it look right. */  in __bt_split()
319  * BT_PAGE -- Split a non-root page of a btree.
341 	/* Put the new right page for the split into place. */  in bt_page()
356 	 * wrong it's no big deal, we'll just do the split the right way next  in bt_page()
358 	 * reverse sorted data, that is, split the tree left, but it's not.  in bt_page()
373 	/* Put the new left page for the split into place. */  in bt_page()
385 	/* Fix up the previous pointer of the page after the split page. */  in bt_page()
397 	 * Split right.  The key/data pairs aren't sorted in the btree page so  in bt_page()
398 	 * it's simpler to copy the data from the split page onto two new pages  in bt_page()
401 	 * to swap the original and the allocated left page after the split.  in bt_page()
417  * BT_ROOT -- Split the root page of a btree.
440 	/* Put the new left and right pages for the split into place. */  in bt_root()
453 	/* Split the root page. */  in bt_root()
462  * BT_RROOT -- Fix up the recno root page after it has been split.
500  * BT_BROOT -- Fix up the btree root page after it has been split.
521 	 * We copy the key we split on (but not the key's data, in the case of  in bt_broot()
580  *	h:	page to be split
603 	 * Split the data to the left and right pages.  Leave the skip index  in bt_psplit()
604 	 * open.  Additionally, make some effort not to split on an overflow  in bt_psplit()
680 	 * adjusted to point to the same record as before the split.  If the  in bt_psplit()
683 	 * number of records split to the left page.  in bt_psplit()