Home
last modified time | relevance | path

Searched refs:new_root (Results 1 - 25 of 44) sorted by relevance

12

/kernel/linux/linux-5.10/drivers/md/persistent-data/
H A Ddm-bitset.h91 * new_root - on success, points to the new root block
93 int dm_bitset_empty(struct dm_disk_bitset *info, dm_block_t *new_root);
119 * new_root - on success, points to the new root block
123 bool default_value, dm_block_t *new_root);
136 * new_root - on success, points to the new root block
141 uint32_t index, dm_block_t *new_root);
149 * new_root - on success, points to the new root block
154 uint32_t index, dm_block_t *new_root);
162 * new_root - on success, points to the new root block (cached values may have been written)
168 uint32_t index, dm_block_t *new_root, boo
[all...]
H A Ddm-bitset.c86 bool default_value, dm_block_t *new_root) in dm_bitset_resize()
94 &value, new_root); in dm_bitset_resize()
105 dm_block_t *new_root) in dm_bitset_flush()
117 &value, new_root); in dm_bitset_flush()
147 uint32_t index, dm_block_t *new_root) in get_array_entry()
156 r = dm_bitset_flush(info, root, new_root); in get_array_entry()
165 uint32_t index, dm_block_t *new_root) in dm_bitset_set_bit()
170 r = get_array_entry(info, root, index, new_root); in dm_bitset_set_bit()
182 uint32_t index, dm_block_t *new_root) in dm_bitset_clear_bit()
187 r = get_array_entry(info, root, index, new_root); in dm_bitset_clear_bit()
84 dm_bitset_resize(struct dm_disk_bitset *info, dm_block_t root, uint32_t old_nr_entries, uint32_t new_nr_entries, bool default_value, dm_block_t *new_root) dm_bitset_resize() argument
104 dm_bitset_flush(struct dm_disk_bitset *info, dm_block_t root, dm_block_t *new_root) dm_bitset_flush() argument
146 get_array_entry(struct dm_disk_bitset *info, dm_block_t root, uint32_t index, dm_block_t *new_root) get_array_entry() argument
164 dm_bitset_set_bit(struct dm_disk_bitset *info, dm_block_t root, uint32_t index, dm_block_t *new_root) dm_bitset_set_bit() argument
181 dm_bitset_clear_bit(struct dm_disk_bitset *info, dm_block_t root, uint32_t index, dm_block_t *new_root) dm_bitset_clear_bit() argument
198 dm_bitset_test_bit(struct dm_disk_bitset *info, dm_block_t root, uint32_t index, dm_block_t *new_root, bool *result) dm_bitset_test_bit() argument
[all...]
H A Ddm-btree.h123 uint64_t *keys, void *value, dm_block_t *new_root)
132 uint64_t *keys, void *value, dm_block_t *new_root,
142 uint64_t *keys, dm_block_t *new_root);
152 dm_block_t *new_root, unsigned *nr_removed);
H A Ddm-array.h103 * new_root - on success, points to the new root block
111 const void *value, dm_block_t *new_root)
160 * new_root - the new root block
168 uint32_t index, const void *value, dm_block_t *new_root)
H A Ddm-array.c657 const void *value, dm_block_t *new_root) in array_resize()
663 *new_root = root; in array_resize()
683 *new_root = resize.root; in array_resize()
689 const void *value, dm_block_t *new_root)
692 int r = array_resize(info, root, old_size, new_size, value, new_root); in __dm_written_to_disk()
797 uint32_t index, const void *value, dm_block_t *new_root) in array_set_value()
814 *new_root = root; in array_set_value()
838 uint32_t index, const void *value, dm_block_t *new_root)
843 r = array_set_value(info, root, index, value, new_root); in __dm_written_to_disk()
655 array_resize(struct dm_array_info *info, dm_block_t root, uint32_t old_size, uint32_t new_size, const void *value, dm_block_t *new_root) array_resize() argument
796 array_set_value(struct dm_array_info *info, dm_block_t root, uint32_t index, const void *value, dm_block_t *new_root) array_set_value() argument
H A Ddm-btree-remove.c519 uint64_t *keys, dm_block_t *new_root) in dm_btree_remove()
553 *new_root = shadow_root(&spine); in dm_btree_remove()
617 dm_block_t *new_root, unsigned *nr_removed) in remove_one()
666 *new_root = shadow_root(&spine); in remove_one()
674 dm_block_t *new_root, unsigned *nr_removed) in dm_btree_remove_leaves()
685 *new_root = root; in dm_btree_remove_leaves()
518 dm_btree_remove(struct dm_btree_info *info, dm_block_t root, uint64_t *keys, dm_block_t *new_root) dm_btree_remove() argument
615 remove_one(struct dm_btree_info *info, dm_block_t root, uint64_t *keys, uint64_t end_key, dm_block_t *new_root, unsigned *nr_removed) remove_one() argument
672 dm_btree_remove_leaves(struct dm_btree_info *info, dm_block_t root, uint64_t *first_key, uint64_t end_key, dm_block_t *new_root, unsigned *nr_removed) dm_btree_remove_leaves() argument
H A Ddm-btree.c766 uint64_t *keys, void *value, dm_block_t *new_root,
840 *new_root = shadow_root(&spine); in __dm_written_to_disk()
853 uint64_t *keys, void *value, dm_block_t *new_root)
856 return insert(info, root, keys, value, new_root, NULL); in __dm_written_to_disk()
861 uint64_t *keys, void *value, dm_block_t *new_root,
865 return insert(info, root, keys, value, new_root, inserted); in __dm_written_to_disk()
/kernel/linux/linux-6.6/drivers/md/persistent-data/
H A Ddm-bitset.h92 * new_root - on success, points to the new root block
94 int dm_bitset_empty(struct dm_disk_bitset *info, dm_block_t *new_root);
120 * new_root - on success, points to the new root block
124 bool default_value, dm_block_t *new_root);
137 * new_root - on success, points to the new root block
142 uint32_t index, dm_block_t *new_root);
150 * new_root - on success, points to the new root block
155 uint32_t index, dm_block_t *new_root);
163 * new_root - on success, points to the new root block (cached values may have been written)
169 uint32_t index, dm_block_t *new_root, boo
[all...]
H A Ddm-bitset.c88 bool default_value, dm_block_t *new_root) in dm_bitset_resize()
96 &value, new_root); in dm_bitset_resize()
107 dm_block_t *new_root) in dm_bitset_flush()
119 &value, new_root); in dm_bitset_flush()
149 uint32_t index, dm_block_t *new_root) in get_array_entry()
158 r = dm_bitset_flush(info, root, new_root); in get_array_entry()
167 uint32_t index, dm_block_t *new_root) in dm_bitset_set_bit()
172 r = get_array_entry(info, root, index, new_root); in dm_bitset_set_bit()
184 uint32_t index, dm_block_t *new_root) in dm_bitset_clear_bit()
189 r = get_array_entry(info, root, index, new_root); in dm_bitset_clear_bit()
86 dm_bitset_resize(struct dm_disk_bitset *info, dm_block_t root, uint32_t old_nr_entries, uint32_t new_nr_entries, bool default_value, dm_block_t *new_root) dm_bitset_resize() argument
106 dm_bitset_flush(struct dm_disk_bitset *info, dm_block_t root, dm_block_t *new_root) dm_bitset_flush() argument
148 get_array_entry(struct dm_disk_bitset *info, dm_block_t root, uint32_t index, dm_block_t *new_root) get_array_entry() argument
166 dm_bitset_set_bit(struct dm_disk_bitset *info, dm_block_t root, uint32_t index, dm_block_t *new_root) dm_bitset_set_bit() argument
183 dm_bitset_clear_bit(struct dm_disk_bitset *info, dm_block_t root, uint32_t index, dm_block_t *new_root) dm_bitset_clear_bit() argument
200 dm_bitset_test_bit(struct dm_disk_bitset *info, dm_block_t root, uint32_t index, dm_block_t *new_root, bool *result) dm_bitset_test_bit() argument
[all...]
H A Ddm-btree.h124 uint64_t *keys, void *value, dm_block_t *new_root)
133 uint64_t *keys, void *value, dm_block_t *new_root,
143 uint64_t *keys, dm_block_t *new_root);
153 dm_block_t *new_root, unsigned int *nr_removed);
H A Ddm-array.h104 * new_root - on success, points to the new root block
112 const void *value, dm_block_t *new_root)
161 * new_root - the new root block
169 uint32_t index, const void *value, dm_block_t *new_root)
H A Ddm-array.c665 const void *value, dm_block_t *new_root) in array_resize()
671 *new_root = root; in array_resize()
691 *new_root = resize.root; in array_resize()
697 const void *value, dm_block_t *new_root)
700 int r = array_resize(info, root, old_size, new_size, value, new_root); in __dm_written_to_disk()
807 uint32_t index, const void *value, dm_block_t *new_root) in array_set_value()
824 *new_root = root; in array_set_value()
848 uint32_t index, const void *value, dm_block_t *new_root)
853 r = array_set_value(info, root, index, value, new_root); in __dm_written_to_disk()
663 array_resize(struct dm_array_info *info, dm_block_t root, uint32_t old_size, uint32_t new_size, const void *value, dm_block_t *new_root) array_resize() argument
806 array_set_value(struct dm_array_info *info, dm_block_t root, uint32_t index, const void *value, dm_block_t *new_root) array_set_value() argument
H A Ddm-btree-remove.c595 uint64_t *keys, dm_block_t *new_root) in dm_btree_remove()
629 *new_root = shadow_root(&spine); in dm_btree_remove()
694 dm_block_t *new_root, unsigned int *nr_removed) in remove_one()
743 *new_root = shadow_root(&spine); in remove_one()
751 dm_block_t *new_root, unsigned int *nr_removed) in dm_btree_remove_leaves()
762 *new_root = root; in dm_btree_remove_leaves()
594 dm_btree_remove(struct dm_btree_info *info, dm_block_t root, uint64_t *keys, dm_block_t *new_root) dm_btree_remove() argument
692 remove_one(struct dm_btree_info *info, dm_block_t root, uint64_t *keys, uint64_t end_key, dm_block_t *new_root, unsigned int *nr_removed) remove_one() argument
749 dm_btree_remove_leaves(struct dm_btree_info *info, dm_block_t root, uint64_t *first_key, uint64_t end_key, dm_block_t *new_root, unsigned int *nr_removed) dm_btree_remove_leaves() argument
H A Ddm-btree-internal.h160 dm_block_t *new_root, struct dm_block **leaf);
H A Ddm-btree.c1204 dm_block_t *new_root, struct dm_block **leaf) in btree_get_overwrite_leaf()
1213 *new_root = shadow_root(&spine); in btree_get_overwrite_leaf()
1235 uint64_t *keys, void *value, dm_block_t *new_root,
1309 *new_root = shadow_root(&spine); in __dm_written_to_disk()
1322 uint64_t *keys, void *value, dm_block_t *new_root)
1325 return insert(info, root, keys, value, new_root, NULL); in __dm_written_to_disk()
1330 uint64_t *keys, void *value, dm_block_t *new_root,
1334 return insert(info, root, keys, value, new_root, inserted); in __dm_written_to_disk()
1202 btree_get_overwrite_leaf(struct dm_btree_info *info, dm_block_t root, uint64_t key, int *index, dm_block_t *new_root, struct dm_block **leaf) btree_get_overwrite_leaf() argument
/kernel/linux/linux-5.10/fs/
H A Dfs_struct.c58 void chroot_fs_refs(const struct path *old_root, const struct path *new_root) in chroot_fs_refs() argument
72 hits += replace_path(&fs->root, old_root, new_root); in chroot_fs_refs()
73 hits += replace_path(&fs->pwd, old_root, new_root); in chroot_fs_refs()
77 path_get(new_root); in chroot_fs_refs()
/kernel/linux/linux-6.6/fs/
H A Dfs_struct.c58 void chroot_fs_refs(const struct path *old_root, const struct path *new_root) in chroot_fs_refs() argument
72 hits += replace_path(&fs->root, old_root, new_root); in chroot_fs_refs()
73 hits += replace_path(&fs->pwd, old_root, new_root); in chroot_fs_refs()
77 path_get(new_root); in chroot_fs_refs()
/kernel/linux/linux-5.10/lib/
H A Dgeneric-radix-tree.c113 struct genradix_root *r = v, *new_root; in __genradix_ptr_alloc() local
128 new_root = ((struct genradix_root *) in __genradix_ptr_alloc()
131 if ((v = cmpxchg_release(&radix->root, r, new_root)) == r) { in __genradix_ptr_alloc()
132 v = new_root; in __genradix_ptr_alloc()
H A Dassoc_array.c1463 struct assoc_array_ptr *new_root, *new_parent, **new_ptr_pp; in assoc_array_gc() local
1482 new_root = new_parent = NULL; in assoc_array_gc()
1483 new_ptr_pp = &new_root; in assoc_array_gc()
1638 new_root = ptr; in assoc_array_gc()
1655 new_root = ptr; in assoc_array_gc()
1688 new_root = assoc_array_node_to_ptr(new_n); in assoc_array_gc()
1718 edit->set[0].to = new_root; in assoc_array_gc()
1725 assoc_array_destroy_subtree(new_root, edit->ops); in assoc_array_gc()
/kernel/linux/linux-6.6/lib/
H A Dgeneric-radix-tree.c113 struct genradix_root *r = v, *new_root; in __genradix_ptr_alloc() local
128 new_root = ((struct genradix_root *) in __genradix_ptr_alloc()
131 if ((v = cmpxchg_release(&radix->root, r, new_root)) == r) { in __genradix_ptr_alloc()
132 v = new_root; in __genradix_ptr_alloc()
H A Dassoc_array.c1462 struct assoc_array_ptr *new_root, *new_parent, **new_ptr_pp; in assoc_array_gc() local
1481 new_root = new_parent = NULL; in assoc_array_gc()
1482 new_ptr_pp = &new_root; in assoc_array_gc()
1636 new_root = ptr; in assoc_array_gc()
1653 new_root = ptr; in assoc_array_gc()
1686 new_root = assoc_array_node_to_ptr(new_n); in assoc_array_gc()
1716 edit->set[0].to = new_root; in assoc_array_gc()
1723 assoc_array_destroy_subtree(new_root, edit->ops); in assoc_array_gc()
/kernel/linux/linux-5.10/fs/afs/
H A Dcell.c343 struct afs_cell *old_root, *new_root; in afs_cell_init() local
368 new_root = afs_lookup_cell(net, rootcell, len, vllist, false); in afs_cell_init()
369 if (IS_ERR(new_root)) { in afs_cell_init()
370 _leave(" = %ld", PTR_ERR(new_root)); in afs_cell_init()
371 return PTR_ERR(new_root); in afs_cell_init()
374 if (!test_and_set_bit(AFS_CELL_FL_NO_GC, &new_root->flags)) in afs_cell_init()
375 afs_use_cell(new_root, afs_cell_trace_use_pin); in afs_cell_init()
379 afs_see_cell(new_root, afs_cell_trace_see_ws); in afs_cell_init()
381 net->ws_cell = new_root; in afs_cell_init()
/kernel/linux/linux-6.6/fs/afs/
H A Dcell.c345 struct afs_cell *old_root, *new_root; in afs_cell_init() local
370 new_root = afs_lookup_cell(net, rootcell, len, vllist, false); in afs_cell_init()
371 if (IS_ERR(new_root)) { in afs_cell_init()
372 _leave(" = %ld", PTR_ERR(new_root)); in afs_cell_init()
373 return PTR_ERR(new_root); in afs_cell_init()
376 if (!test_and_set_bit(AFS_CELL_FL_NO_GC, &new_root->flags)) in afs_cell_init()
377 afs_use_cell(new_root, afs_cell_trace_use_pin); in afs_cell_init()
381 afs_see_cell(new_root, afs_cell_trace_see_ws); in afs_cell_init()
383 net->ws_cell = new_root; in afs_cell_init()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dtree-mod-log.h32 struct extent_buffer *new_root,
/kernel/linux/linux-5.10/fs/reiserfs/
H A Dibalance.c658 struct buffer_head *new_root; in balance_internal_when_delete() local
669 new_root = tb->R[h - 1]; in balance_internal_when_delete()
671 new_root = tb->L[h - 1]; in balance_internal_when_delete()
675 PUT_SB_ROOT_BLOCK(tb->tb_sb, new_root->b_blocknr); in balance_internal_when_delete()
686 check_internal(new_root); in balance_internal_when_delete()

Completed in 23 milliseconds

12