Lines Matching defs:right
553 static void redistribute2(struct btree_node *left, struct btree_node *right)
556 unsigned int nr_right = le32_to_cpu(right->header.nr_entries);
564 copy_entries(left, nr_left, right, 0, delta);
565 shift_down(right, delta);
570 shift_up(right, delta);
571 copy_entries(right, 0, left, target_left, delta);
575 right->header.nr_entries = cpu_to_le32(target_right);
583 struct btree_node *right)
587 unsigned int nr_right = le32_to_cpu(right->header.nr_entries);
600 copy_entries(left, nr_left, right, 0, left_short);
601 copy_entries(center, 0, right, left_short, target_center);
602 shift_down(right, nr_right - target_right);
608 copy_entries(center, left_to_center, right, 0, target_center - left_to_center);
609 shift_down(right, nr_right - target_right);
614 shift_up(right, right_short);
615 copy_entries(right, 0, left, nr_left - right_short, right_short);
621 right->header.nr_entries = cpu_to_le32(target_right);
658 struct dm_block *left, *right, *parent;
664 r = new_block(s->info, &right);
669 rn = dm_block_data(right);
681 location = cpu_to_le64(dm_block_location(right));
686 unlock_block(s->info, right);
692 unlock_block(s->info, right);
696 s->nodes[1] = right;
742 struct dm_block *left, *middle, *right, *parent;
752 r = shadow_child(s->info, vt, pn, parent_index + 1, &right);
757 right = shadow_current(s);
769 rn = dm_block_data(right);
790 if (shadow_current(s) != right)
791 unlock_block(s->info, right);
800 unlock_block(s->info, right);
804 unlock_block(s->info, right);
809 s->nodes[1] = right;
843 struct dm_block *left, *right, *new_parent;
868 /* create & init the right block */
869 r = new_block(s->info, &right);
875 rn = dm_block_data(right);
900 val = cpu_to_le64(dm_block_location(right));
906 unlock_block(s->info, right);
920 struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s));
927 right = dm_block_data(shadow_current(s));
928 redistribute2(left, right);
929 *key_ptr(parent, parent_index) = right->keys[0];
931 if (key < le64_to_cpu(right->keys[0])) {
942 * Redistributes a nodes entries with its right sibling.
949 struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s));
956 right = dm_block_data(sib);
957 redistribute2(left, right);
958 *key_ptr(parent, parent_index + 1) = right->keys[0];
960 if (key < le64_to_cpu(right->keys[0])) {
1028 /* Should we move entries to the right sibling? */