Home
last modified time | relevance | path

Searched refs:nr_right (Results 1 - 6 of 6) sorted by relevance

/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree-remove.c176 uint32_t nr_right = le32_to_cpu(right->header.nr_entries); in shift() local
182 BUG_ON(nr_right + count > max_entries); in shift()
196 right->header.nr_entries = cpu_to_le32(nr_right + count); in shift()
205 uint32_t nr_right = le32_to_cpu(right->header.nr_entries); in __rebalance2() local
214 if (nr_left + nr_right < threshold) { in __rebalance2()
218 node_copy(left, right, -nr_right); in __rebalance2()
219 left->header.nr_entries = cpu_to_le32(nr_left + nr_right); in __rebalance2()
231 unsigned target_left = (nr_left + nr_right) / 2; in __rebalance2()
272 uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) in delete_center_node()
283 BUG_ON((nr_right in delete_center_node()
269 delete_center_node(struct dm_btree_info *info, struct btree_node *parent, struct child *l, struct child *c, struct child *r, struct btree_node *left, struct btree_node *center, struct btree_node *right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) delete_center_node() argument
300 redistribute3(struct dm_btree_info *info, struct btree_node *parent, struct child *l, struct child *c, struct child *r, struct btree_node *left, struct btree_node *center, struct btree_node *right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) redistribute3() argument
356 uint32_t nr_right = le32_to_cpu(right->header.nr_entries); __rebalance3() local
[all...]
H A Ddm-btree.c540 unsigned nr_left, nr_right; in btree_split_sibling() local
555 nr_right = le32_to_cpu(ln->header.nr_entries) - nr_left; in btree_split_sibling()
560 rn->header.nr_entries = cpu_to_le32(nr_right); in btree_split_sibling()
563 memcpy(rn->keys, ln->keys + nr_left, nr_right * sizeof(rn->keys[0])); in btree_split_sibling()
568 size * nr_right); in btree_split_sibling() local
627 unsigned nr_left, nr_right; in btree_split_beneath() local
661 nr_right = le32_to_cpu(pn->header.nr_entries) - nr_left; in btree_split_beneath()
664 rn->header.nr_entries = cpu_to_le32(nr_right); in btree_split_beneath()
667 memcpy(rn->keys, pn->keys + nr_left, nr_right * sizeof(pn->keys[0])); in btree_split_beneath()
669 nr_right * siz in btree_split_beneath()
[all...]
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree-remove.c196 uint32_t nr_right = le32_to_cpu(right->header.nr_entries); in shift() local
210 if (nr_right + count > max_entries) { in shift()
231 right->header.nr_entries = cpu_to_le32(nr_right + count); in shift()
243 uint32_t nr_right = le32_to_cpu(right->header.nr_entries); in __rebalance2() local
252 if (nr_left + nr_right < threshold) { in __rebalance2()
256 node_copy(left, right, -nr_right); in __rebalance2()
257 left->header.nr_entries = cpu_to_le32(nr_left + nr_right); in __rebalance2()
269 unsigned int target_left = (nr_left + nr_right) / 2; in __rebalance2()
314 uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) in delete_center_node()
330 if ((nr_right in delete_center_node()
311 delete_center_node(struct dm_btree_info *info, struct btree_node *parent, struct child *l, struct child *c, struct child *r, struct btree_node *left, struct btree_node *center, struct btree_node *right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) delete_center_node() argument
351 redistribute3(struct dm_btree_info *info, struct btree_node *parent, struct child *l, struct child *c, struct child *r, struct btree_node *left, struct btree_node *center, struct btree_node *right, uint32_t nr_left, uint32_t nr_center, uint32_t nr_right) redistribute3() argument
427 uint32_t nr_right = le32_to_cpu(right->header.nr_entries); __rebalance3() local
[all...]
H A Ddm-btree.c556 unsigned int nr_right = le32_to_cpu(right->header.nr_entries); in redistribute2() local
557 unsigned int total = nr_left + nr_right; in redistribute2()
569 if (nr_right) in redistribute2()
587 unsigned int nr_right = le32_to_cpu(right->header.nr_entries); in redistribute3() local
592 total = nr_left + nr_right; in redistribute3()
602 shift_down(right, nr_right - target_right); in redistribute3()
609 shift_down(right, nr_right - target_right); in redistribute3()
612 unsigned int right_short = target_right - nr_right; in redistribute3()
842 unsigned int nr_left, nr_right; in btree_split_beneath() local
876 nr_right in btree_split_beneath()
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dctree.c3247 int nr_right = btrfs_header_nritems(right); in check_sibling_keys() local
3250 if (!nr_left || !nr_right) in check_sibling_keys()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dctree.c2785 int nr_right = btrfs_header_nritems(right); in check_sibling_keys() local
2788 if (!nr_left || !nr_right) in check_sibling_keys()

Completed in 17 milliseconds