Home
last modified time | relevance | path

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

/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-btree-remove.c84 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); in node_copy() local
90 BUG_ON(nr_left + shift > le32_to_cpu(left->header.max_entries)); in node_copy()
91 memcpy(key_ptr(left, nr_left), in node_copy()
94 memcpy(value_ptr(left, nr_left), in node_copy()
100 key_ptr(left, nr_left - shift), in node_copy()
103 value_ptr(left, nr_left - shift), in node_copy()
175 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); in shift() local
181 BUG_ON(nr_left - count > max_entries); in shift()
195 left->header.nr_entries = cpu_to_le32(nr_left - count); in shift()
204 uint32_t nr_left in __rebalance2() local
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
354 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); __rebalance3() local
[all...]
H A Ddm-btree.c540 unsigned nr_left, nr_right; in btree_split_sibling() local
554 nr_left = le32_to_cpu(ln->header.nr_entries) / 2; in btree_split_sibling()
555 nr_right = le32_to_cpu(ln->header.nr_entries) - nr_left; in btree_split_sibling()
557 ln->header.nr_entries = cpu_to_le32(nr_left); in btree_split_sibling()
563 memcpy(rn->keys, ln->keys + nr_left, nr_right * sizeof(rn->keys[0])); in btree_split_sibling()
567 memcpy(value_ptr(rn, 0), value_ptr(ln, nr_left), in btree_split_sibling()
627 unsigned nr_left, nr_right; in btree_split_beneath() local
644 nr_left = le32_to_cpu(pn->header.nr_entries) / 2; in btree_split_beneath()
647 ln->header.nr_entries = cpu_to_le32(nr_left); in btree_split_beneath()
650 memcpy(ln->keys, pn->keys, nr_left * sizeo in btree_split_beneath()
[all...]
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-btree-remove.c88 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); in node_copy() local
99 if (nr_left + shift > le32_to_cpu(left->header.max_entries)) { in node_copy()
104 memcpy(key_ptr(left, nr_left), in node_copy()
107 memcpy(value_ptr(left, nr_left), in node_copy()
117 key_ptr(left, nr_left - shift), in node_copy()
120 value_ptr(left, nr_left - shift), in node_copy()
195 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); in shift() local
205 if (nr_left - count > max_entries) { in shift()
230 left->header.nr_entries = cpu_to_le32(nr_left - count); in shift()
242 uint32_t nr_left in __rebalance2() local
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
425 uint32_t nr_left = le32_to_cpu(left->header.nr_entries); __rebalance3() local
[all...]
H A Ddm-btree.c555 unsigned int nr_left = le32_to_cpu(left->header.nr_entries); in redistribute2() local
557 unsigned int total = nr_left + nr_right; in redistribute2()
561 if (nr_left < target_left) { in redistribute2()
562 unsigned int delta = target_left - nr_left; in redistribute2()
564 copy_entries(left, nr_left, right, 0, delta); in redistribute2()
566 } else if (nr_left > target_left) { in redistribute2()
567 unsigned int delta = nr_left - target_left; in redistribute2()
585 unsigned int nr_left = le32_to_cpu(left->header.nr_entries); in redistribute3() local
592 total = nr_left + nr_right; in redistribute3()
597 if (nr_left < target_lef in redistribute3()
842 unsigned int nr_left, nr_right; btree_split_beneath() local
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dctree.c3246 int nr_left = btrfs_header_nritems(left); in check_sibling_keys() local
3250 if (!nr_left || !nr_right) in check_sibling_keys()
3254 btrfs_node_key_to_cpu(left, &left_last, nr_left - 1); in check_sibling_keys()
3257 btrfs_item_key_to_cpu(left, &left_last, nr_left - 1); in check_sibling_keys()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dctree.c2784 int nr_left = btrfs_header_nritems(left); in check_sibling_keys() local
2788 if (!nr_left || !nr_right) in check_sibling_keys()
2792 btrfs_node_key_to_cpu(left, &left_last, nr_left - 1); in check_sibling_keys()
2795 btrfs_item_key_to_cpu(left, &left_last, nr_left - 1); in check_sibling_keys()

Completed in 16 milliseconds