1449 	int split;  in btree_split_internal()  local
1474 		split = (ondisk->count + 1) * 3 / 4;  in btree_split_internal()
1484 		split = (ondisk->count + 1) / 2;  in btree_split_internal()
1485 		if (cursor->index <= split)  in btree_split_internal()
1486 			--split;  in btree_split_internal()
1551 	elm = &ondisk->elms[split];  in btree_split_internal()
1553 	      (ondisk->count - split + 1) * esize);  /* +1 for boundary */  in btree_split_internal()
1554 	new_node->ondisk->count = ondisk->count - split;  in btree_split_internal()
1559 	hammer_cursor_split_node(node, new_node, split);  in btree_split_internal()
1568 	ondisk->count = split;  in btree_split_internal()
1645 	if (cursor->index >= split) {  in btree_split_internal()
1647 		cursor->index -= split;  in btree_split_internal()
1691 	int split;  in btree_split_leaf()  local
1716 		split = (ondisk->count + 1) * 3 / 4;  in btree_split_leaf()
1719 		split = (ondisk->count + 1) / 2;  in btree_split_leaf()
1727 	if (cursor->index == split)  in btree_split_leaf()
1728 		--split;  in btree_split_leaf()
1730 	KKASSERT(split > 0 && split < ondisk->count);  in btree_split_leaf()
1735 	elm = &ondisk->elms[split];  in btree_split_leaf()
1802 	elm = &ondisk->elms[split];  in btree_split_leaf()
1803 	bcopy(elm, &new_leaf->ondisk->elms[0], (ondisk->count - split) * esize);  in btree_split_leaf()
1804 	new_leaf->ondisk->count = ondisk->count - split;  in btree_split_leaf()
1810 	hammer_cursor_split_node(leaf, new_leaf, split);  in btree_split_leaf()
1818 	ondisk->count = split;  in btree_split_leaf()
1830 	KKASSERT(split != 0);  in btree_split_leaf()
1884 	if (cursor->index > split ||  in btree_split_leaf()
1885 	    (cursor->index == split &&  in btree_split_leaf()
1888 		cursor->index -= split;  in btree_split_leaf()