650 	struct btree_node *ln, *rn, *pn;  in split_one_into_two()  local
659 	ln = dm_block_data(left);  in split_one_into_two()
662 	rn->header.flags = ln->header.flags;  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()
734 	struct btree_node *ln, *rn, *mn, *pn;  in split_two_into_three()  local
758 	ln = dm_block_data(left);  in split_two_into_three()
763 	mn->header.flags = ln->header.flags;  in split_two_into_three()
764 	mn->header.max_entries = ln->header.max_entries;  in split_two_into_three()
765 	mn->header.value_size = ln->header.value_size;  in split_two_into_three()
767 	redistribute3(ln, mn, rn);  in split_two_into_three()
835 	struct btree_node *pn, *ln, *rn;  in btree_split_beneath()  local
849 	ln = dm_block_data(left);  in btree_split_beneath()
852 	ln->header.flags = pn->header.flags;  in btree_split_beneath()
853 	ln->header.nr_entries = cpu_to_le32(nr_left);  in btree_split_beneath()
854 	ln->header.max_entries = pn->header.max_entries;  in btree_split_beneath()
855 	ln->header.value_size = pn->header.value_size;  in btree_split_beneath()
856 	memcpy(ln->keys, pn->keys, nr_left * sizeof(pn->keys[0]));  in btree_split_beneath()
857 	memcpy(value_ptr(ln, 0), value_ptr(pn, 0), nr_left * size);  in btree_split_beneath()
888 	pn->keys[0] = ln->keys[0];  in btree_split_beneath()