Lines Matching refs:rn
659 struct btree_node *ln, *rn, *pn; in split_one_into_two() local
669 rn = dm_block_data(right); in split_one_into_two()
671 rn->header.flags = ln->header.flags; in split_one_into_two()
672 rn->header.nr_entries = cpu_to_le32(0); 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()
684 le64_to_cpu(rn->keys[0]), &location); in split_one_into_two()
691 if (key < le64_to_cpu(rn->keys[0])) { in split_one_into_two()
743 struct btree_node *ln, *rn, *mn, *pn; in split_two_into_three() local
769 rn = dm_block_data(right); in split_two_into_three()
776 redistribute3(ln, mn, rn); in split_two_into_three()
779 pn->keys[middle_index] = rn->keys[0]; in split_two_into_three()
802 } else if (key < le64_to_cpu(rn->keys[0])) { in split_two_into_three()
844 struct btree_node *pn, *ln, *rn; in btree_split_beneath() local
875 rn = dm_block_data(right); in btree_split_beneath()
878 rn->header.flags = pn->header.flags; in btree_split_beneath()
879 rn->header.nr_entries = cpu_to_le32(nr_right); in btree_split_beneath()
880 rn->header.max_entries = pn->header.max_entries; in btree_split_beneath()
881 rn->header.value_size = pn->header.value_size; in btree_split_beneath()
882 memcpy(rn->keys, pn->keys + nr_left, nr_right * sizeof(pn->keys[0])); in btree_split_beneath()
883 memcpy(value_ptr(rn, 0), value_ptr(pn, nr_left), in btree_split_beneath()
902 pn->keys[1] = rn->keys[0]; in btree_split_beneath()