430 	struct btree_node *ln, *rn, *pn;  in btree_split_sibling()  local
439 	ln = dm_block_data(left);  in btree_split_sibling()
442 	nr_left = le32_to_cpu(ln->header.nr_entries) / 2;  in btree_split_sibling()
443 	nr_right = le32_to_cpu(ln->header.nr_entries) - nr_left;  in btree_split_sibling()
445 	ln->header.nr_entries = cpu_to_le32(nr_left);  in btree_split_sibling()
447 	rn->header.flags = ln->header.flags;  in btree_split_sibling()
449 	rn->header.max_entries = ln->header.max_entries;  in btree_split_sibling()
450 	rn->header.value_size = ln->header.value_size;  in btree_split_sibling()
451 	memcpy(rn->keys, ln->keys + nr_left, nr_right * sizeof(rn->keys[0]));  in btree_split_sibling()
453 	size = le32_to_cpu(ln->header.flags) & INTERNAL_NODE ?  in btree_split_sibling()
455 	memcpy(value_ptr(rn, 0), value_ptr(ln, nr_left),  in btree_split_sibling()
515 	struct btree_node *pn, *ln, *rn;  in btree_split_beneath()  local
531 	ln = dm_block_data(left);  in btree_split_beneath()
537 	ln->header.flags = pn->header.flags;  in btree_split_beneath()
538 	ln->header.nr_entries = cpu_to_le32(nr_left);  in btree_split_beneath()
539 	ln->header.max_entries = pn->header.max_entries;  in btree_split_beneath()
540 	ln->header.value_size = pn->header.value_size;  in btree_split_beneath()
547 	memcpy(ln->keys, pn->keys, nr_left * sizeof(pn->keys[0]));  in btree_split_beneath()
552 	memcpy(value_ptr(ln, 0), value_ptr(pn, 0), nr_left * size);  in btree_split_beneath()
567 	pn->keys[0] = ln->keys[0];  in btree_split_beneath()