Lines Matching refs:left
553 static void redistribute2(struct btree_node *left, struct btree_node *right)
555 unsigned int nr_left = le32_to_cpu(left->header.nr_entries);
564 copy_entries(left, nr_left, right, 0, delta);
571 copy_entries(right, 0, left, target_left, delta);
574 left->header.nr_entries = cpu_to_le32(target_left);
582 static void redistribute3(struct btree_node *left, struct btree_node *center,
585 unsigned int nr_left = le32_to_cpu(left->header.nr_entries);
600 copy_entries(left, nr_left, right, 0, left_short);
607 copy_entries(center, 0, left, target_left, left_to_center);
615 copy_entries(right, 0, left, nr_left - right_short, right_short);
616 copy_entries(center, 0, left, target_left, nr_left - target_left);
619 left->header.nr_entries = cpu_to_le32(target_left);
658 struct dm_block *left, *right, *parent;
662 left = shadow_current(s);
668 ln = dm_block_data(left);
693 s->nodes[1] = left;
695 unlock_block(s->info, left);
742 struct dm_block *left, *middle, *right, *parent;
751 left = shadow_current(s);
758 r = shadow_child(s->info, vt, pn, parent_index - 1, &left);
767 ln = dm_block_data(left);
785 if (shadow_current(s) != left)
786 unlock_block(s->info, left);
801 s->nodes[1] = left;
803 unlock_block(s->info, left);
807 unlock_block(s->info, left);
843 struct dm_block *left, *right, *new_parent;
853 /* create & init the left block */
854 r = new_block(s->info, &left);
858 ln = dm_block_data(left);
871 unlock_block(s->info, left);
895 val = cpu_to_le64(dm_block_location(left));
905 unlock_block(s->info, left);
913 * Redistributes a node's entries with its left sibling.
920 struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s));
926 left = dm_block_data(sib);
928 redistribute2(left, right);
949 struct btree_node *left, *right, *parent = dm_block_data(shadow_parent(s));
955 left = dm_block_data(shadow_current(s));
957 redistribute2(left, right);
1010 /* Should we move entries to the left sibling? */