| /fs/btrfs/ |
| D | ctree.c | 203 struct extent_buffer *cow; in btrfs_copy_root() local
219 cow = btrfs_alloc_tree_block(trans, root, 0, new_root_objectid, in btrfs_copy_root()
222 if (IS_ERR(cow)) in btrfs_copy_root()
223 return PTR_ERR(cow); in btrfs_copy_root()
225 copy_extent_buffer_full(cow, buf); in btrfs_copy_root()
226 btrfs_set_header_bytenr(cow, cow->start); in btrfs_copy_root()
227 btrfs_set_header_generation(cow, trans->transid); in btrfs_copy_root()
228 btrfs_set_header_backref_rev(cow, BTRFS_MIXED_BACKREF_REV); in btrfs_copy_root()
229 btrfs_clear_header_flag(cow, BTRFS_HEADER_FLAG_WRITTEN | in btrfs_copy_root()
232 btrfs_set_header_flag(cow, BTRFS_HEADER_FLAG_RELOC); in btrfs_copy_root()
[all …]
|
| D | inode-item.c | 82 int cow) in btrfs_lookup_inode_extref() argument
91 ret = btrfs_search_slot(trans, root, &key, path, ins_len, cow); in btrfs_lookup_inode_extref()
400 int cow = mod != 0; in btrfs_lookup_inode() local
406 ret = btrfs_search_slot(trans, root, location, path, ins_len, cow); in btrfs_lookup_inode()
|
| D | free-space-tree.h | 37 struct btrfs_path *path, int cow);
|
| D | inode-item.h | 85 int cow);
|
| D | dir-item.c | 178 const int cow = (mod != 0); in btrfs_lookup_match_dir() local
181 ret = btrfs_search_slot(trans, root, key, path, ins_len, cow); in btrfs_lookup_match_dir()
|
| D | file-item.c | 190 u64 bytenr, int cow) in btrfs_lookup_csum() argument
205 ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow); in btrfs_lookup_csum()
247 int cow = mod != 0; in btrfs_lookup_file_extent() local
253 return btrfs_search_slot(trans, root, &file_key, path, ins_len, cow); in btrfs_lookup_file_extent()
|
| D | relocation.c | 1214 int cow = 0; in replace_path() local
1236 if (cow) { in replace_path()
1299 if (cow) { in replace_path()
1317 if (!cow) { in replace_path()
1320 cow = 1; in replace_path()
4401 struct extent_buffer *cow) in btrfs_reloc_cow_block() argument
4430 atomic_inc(&cow->refs); in btrfs_reloc_cow_block()
4431 node->eb = cow; in btrfs_reloc_cow_block()
4432 node->new_bytenr = cow->start; in btrfs_reloc_cow_block()
4448 ret = replace_file_extents(trans, rc, root, cow); in btrfs_reloc_cow_block()
|
| D | free-space-tree.c | 99 struct btrfs_path *path, int cow) in search_free_space_info() argument
110 ret = btrfs_search_slot(trans, root, &key, path, 0, cow); in search_free_space_info()
131 int ins_len, int cow) in btrfs_search_prev_slot() argument
135 ret = btrfs_search_slot(trans, root, key, p, ins_len, cow); in btrfs_search_prev_slot()
|
| D | ctree.h | 3058 int ins_len, int cow);
4025 struct extent_buffer *cow);
|
| D | inode.c | 502 static noinline int add_async_extent(struct async_chunk *cow, in add_async_extent() argument
519 list_add_tail(&async_extent->list, &cow->extents); in add_async_extent()
|
| /fs/ |
| D | dax.c | 365 struct vm_area_struct *vma, unsigned long address, bool cow) in dax_associate_entry() argument
377 if (cow) { in dax_associate_entry()
863 bool cow = dax_fault_is_cow(iter); in dax_insert_entry() local
868 if (cow || (dax_is_zero_entry(entry) && !(flags & DAX_ZERO_PAGE))) { in dax_insert_entry()
880 if (cow || dax_is_zero_entry(entry) || dax_is_empty_entry(entry)) { in dax_insert_entry()
885 cow); in dax_insert_entry()
905 if (cow) in dax_insert_entry()
|