659 	struct btree_node *ln, *rn, *pn;  in split_one_into_two()  local
668 	ln = dm_block_data(left);  in split_one_into_two()
671 	rn->header.flags = ln->header.flags;  in split_one_into_two()
673 	rn->header.max_entries = ln->header.max_entries;  in split_one_into_two()
674 	rn->header.value_size = ln->header.value_size;  in split_one_into_two()
675 	redistribute2(ln, rn);  in split_one_into_two()
743 	struct btree_node *ln, *rn, *mn, *pn;  in split_two_into_three()  local
767 	ln = dm_block_data(left);  in split_two_into_three()
772 	mn->header.flags = ln->header.flags;  in split_two_into_three()
773 	mn->header.max_entries = ln->header.max_entries;  in split_two_into_three()
774 	mn->header.value_size = ln->header.value_size;  in split_two_into_three()
776 	redistribute3(ln, mn, rn);  in split_two_into_three()
844 	struct btree_node *pn, *ln, *rn;  in btree_split_beneath()  local
858 	ln = dm_block_data(left);  in btree_split_beneath()
861 	ln->header.flags = pn->header.flags;  in btree_split_beneath()
862 	ln->header.nr_entries = cpu_to_le32(nr_left);  in btree_split_beneath()
863 	ln->header.max_entries = pn->header.max_entries;  in btree_split_beneath()
864 	ln->header.value_size = pn->header.value_size;  in btree_split_beneath()
865 	memcpy(ln->keys, pn->keys, nr_left * sizeof(pn->keys[0]));  in btree_split_beneath()
866 	memcpy(value_ptr(ln, 0), value_ptr(pn, 0), nr_left * size);  in btree_split_beneath()
897 	pn->keys[0] = ln->keys[0];  in btree_split_beneath()