650 	struct btree_node *ln, *rn, *pn;  in split_one_into_two()  local
660 	rn = dm_block_data(right);  in split_one_into_two()
662 	rn->header.flags = ln->header.flags;  in split_one_into_two()
663 	rn->header.nr_entries = cpu_to_le32(0);  in split_one_into_two()
664 	rn->header.max_entries = ln->header.max_entries;  in split_one_into_two()
665 	rn->header.value_size = ln->header.value_size;  in split_one_into_two()
666 	redistribute2(ln, rn);  in split_one_into_two()
675 		      le64_to_cpu(rn->keys[0]), &location);  in split_one_into_two()
682 	if (key < le64_to_cpu(rn->keys[0])) {  in split_one_into_two()
734 	struct btree_node *ln, *rn, *mn, *pn;  in split_two_into_three()  local
760 	rn = dm_block_data(right);  in split_two_into_three()
767 	redistribute3(ln, mn, rn);  in split_two_into_three()
770 	pn->keys[middle_index] = rn->keys[0];  in split_two_into_three()
793 	} else if (key < le64_to_cpu(rn->keys[0])) {  in split_two_into_three()
835 	struct btree_node *pn, *ln, *rn;  in btree_split_beneath()  local
866 	rn = dm_block_data(right);  in btree_split_beneath()
869 	rn->header.flags = pn->header.flags;  in btree_split_beneath()
870 	rn->header.nr_entries = cpu_to_le32(nr_right);  in btree_split_beneath()
871 	rn->header.max_entries = pn->header.max_entries;  in btree_split_beneath()
872 	rn->header.value_size = pn->header.value_size;  in btree_split_beneath()
873 	memcpy(rn->keys, pn->keys + nr_left, nr_right * sizeof(pn->keys[0]));  in btree_split_beneath()
874 	memcpy(value_ptr(rn, 0), value_ptr(pn, nr_left),  in btree_split_beneath()
893 	pn->keys[1] = rn->keys[0];  in btree_split_beneath()