Home
last modified time | relevance | path

Searched refs:eb (Results 1 – 25 of 46) sorted by relevance

12

/fs/btrfs/
A Dlocking.c100 eb, btrfs_header_level(eb)); in btrfs_maybe_reset_lockdep_class()
108 eb->lock_owner = owner; in btrfs_set_eb_lock_owner()
169 up_read(&eb->lock); in btrfs_tree_read_unlock()
181 __acquires(&eb->lock) in btrfs_tree_lock_nested()
200 up_write(&eb->lock); in btrfs_tree_unlock()
243 btrfs_tree_lock(eb); in btrfs_lock_root_node()
244 if (eb == root->node) in btrfs_lock_root_node()
249 return eb; in btrfs_lock_root_node()
267 if (eb == root->node) in btrfs_read_lock_root_node()
272 return eb; in btrfs_read_lock_root_node()
[all …]
A Dextent_io.c80 eb->start, eb->len, refcount_read(&eb->refs), eb->bflags, in btrfs_extent_buffer_leak_debug_check()
2058 if (eb && !refcount_inc_not_zero(&eb->refs)) in find_extent_buffer_nolock()
2129 eb->start + eb->len) - range_start; in write_one_eb()
2221 ctx.eb = eb; in btree_write_cache_pages()
3245 eb->folio_size = folio_size(eb->folios[i]); in attach_eb_folio_to_filemap()
3246 eb->folio_shift = folio_shift(eb->folios[i]); in attach_eb_folio_to_filemap()
3396 eb->addr = folio_address(eb->folios[0]) + offset_in_page(eb->start); in alloc_extent_buffer()
3773 eb->start + eb->len) - range_start; in read_extent_buffer_pages_nowait()
3802 eb->start, eb->len, start, len); in report_eb_range()
3878 WARN_ON(start + len > eb->start + eb->len); in read_extent_buffer_to_user_nofault()
[all …]
A Dtree-mod-log.c212 if (eb && skip_eb_logging(eb)) in tree_mod_dont_log()
230 if (eb && skip_eb_logging(eb)) in tree_mod_need_log()
267 if (!tree_mod_need_log(eb->fs_info, eb)) in btrfs_tree_mod_log_insert_key()
274 if (tree_mod_dont_log(eb->fs_info, eb)) { in btrfs_tree_mod_log_insert_key()
328 if (!tree_mod_need_log(eb->fs_info, eb)) in btrfs_tree_mod_log_insert_move()
354 if (tree_mod_dont_log(eb->fs_info, eb)) { in btrfs_tree_mod_log_insert_move()
713 if (!tree_mod_need_log(eb->fs_info, eb)) in btrfs_tree_mod_log_free_eb()
733 if (tree_mod_dont_log(eb->fs_info, eb)) { in btrfs_tree_mod_log_free_eb()
1089 if (!eb) in btrfs_get_old_root()
1092 btrfs_set_header_bytenr(eb, eb->start); in btrfs_get_old_root()
[all …]
A Daccessors.h79 offset_in_page(eb->start); \
85 type *p = folio_address(eb->folios[0]) + offset_in_page(eb->start); \
451 return btrfs_raw_item_##member(eb, btrfs_item_nr(eb, slot)); \
456 btrfs_set_raw_item_##member(eb, btrfs_item_nr(eb, slot), val); \
464 return btrfs_item_offset(eb, nr) + btrfs_item_size(eb, nr); in btrfs_item_data_end()
578 btrfs_node_key(eb, disk_key, nr); in btrfs_node_key_to_cpu()
586 btrfs_item_key(eb, disk_key, nr); in btrfs_item_key_to_cpu()
621 btrfs_node_key(eb, &disk_key, nr); in btrfs_node_key_to_cpu()
630 btrfs_item_key(eb, &disk_key, nr); in btrfs_item_key_to_cpu()
666 u64 flags = btrfs_header_flags(eb); in btrfs_set_header_flag()
[all …]
A Dextent_io.h124 struct extent_buffer *eb; member
132 ASSERT(eb->folio_size); in offset_in_eb_folio()
133 return start & (eb->folio_size - 1); in offset_in_eb_folio()
162 return offset_in_folio(eb->folios[0], offset + eb->start); in get_eb_offset_in_folio()
180 return offset >> eb->folio_shift; in get_eb_folio_index()
255 void free_extent_buffer(struct extent_buffer *eb);
282 return (eb->len >> PAGE_SHIFT) ?: 1; in num_extent_pages()
296 if (!eb->folios[0]) in num_extent_folios()
298 if (folio_order(eb->folios[0])) in num_extent_folios()
300 return num_extent_pages(eb); in num_extent_folios()
[all …]
A Daccessors.c17 btrfs_warn(eb->fs_info, in report_setget_bounds()
19 (member_offset > eb->len ? "start" : "end"), in report_setget_bounds()
20 (unsigned long)ptr, eb->start, member_offset, size); in report_setget_bounds()
60 const int part = eb->folio_size - oif; \
73 kaddr = folio_address(eb->folios[idx + 1]); \
77 folio_address(eb->folios[idx + 1]), \
90 const int part = eb->folio_size - oif; \
105 kaddr = folio_address(eb->folios[idx + 1]); \
109 kaddr = folio_address(eb->folios[idx + 1]); \
119 void btrfs_node_key(const struct extent_buffer *eb, in btrfs_node_key() argument
[all …]
A Dprint-tree.c60 btrfs_chunk_length(eb, chunk), btrfs_chunk_owner(eb, chunk), in print_chunk()
72 btrfs_device_id(eb, dev_item), in print_dev_item()
109 btrfs_err(eb->fs_info, in print_extent_item()
116 flags = btrfs_extent_flags(eb, ei); in print_extent_item()
119 btrfs_extent_refs(eb, ei), btrfs_extent_generation(eb, ei), in print_extent_item()
126 btrfs_tree_block_key(eb, info, &key); in print_extent_item()
156 offset, eb->fs_info->sectorsize); in print_extent_item()
160 print_extent_data_ref(eb, dref); in print_extent_item()
177 print_extent_owner_ref(eb, oref); in print_extent_item()
181 eb->start, type); in print_extent_item()
[all …]
A Dlocking.h179 btrfs_tree_lock_nested(eb, BTRFS_NESTING_NORMAL); in btrfs_tree_lock()
182 void btrfs_tree_unlock(struct extent_buffer *eb);
188 btrfs_tree_read_lock_nested(eb, BTRFS_NESTING_NORMAL); in btrfs_tree_read_lock()
191 void btrfs_tree_read_unlock(struct extent_buffer *eb);
192 bool btrfs_try_tree_read_lock(struct extent_buffer *eb);
200 lockdep_assert_held_write(&eb->lock); in btrfs_assert_tree_write_locked()
204 lockdep_assert_held_read(&eb->lock); in btrfs_assert_tree_read_locked()
216 btrfs_tree_unlock(eb); in btrfs_tree_unlock_rw()
218 btrfs_tree_read_unlock(eb); in btrfs_tree_unlock_rw()
242 struct extent_buffer *eb, int level) in btrfs_set_buffer_lockdep_class() argument
[all …]
A Duuid-tree.c31 struct extent_buffer *eb; in btrfs_uuid_tree_lookup() local
57 eb = path->nodes[0]; in btrfs_uuid_tree_lookup()
59 item_size = btrfs_item_size(eb, slot); in btrfs_uuid_tree_lookup()
94 struct extent_buffer *eb; in btrfs_uuid_tree_add() local
120 eb = path->nodes[0]; in btrfs_uuid_tree_add()
129 eb = path->nodes[0]; in btrfs_uuid_tree_add()
156 struct extent_buffer *eb; in btrfs_uuid_tree_remove() local
188 eb = path->nodes[0]; in btrfs_uuid_tree_remove()
401 struct extent_buffer *eb; in btrfs_uuid_scan_kthread() local
437 eb = path->nodes[0]; in btrfs_uuid_scan_kthread()
[all …]
A Dbackref.c504 eb = path->nodes[0]; in add_all_parents()
515 eb = path->nodes[0]; in add_all_parents()
677 while (!eb) { in resolve_indirect_ref()
858 if (IS_ERR(eb)) { in add_missing_keys()
1613 if (IS_ERR(eb)) { in find_parent_nodes()
2146 if (eb != eb_in) { in btrfs_ref_to_path()
2167 if (eb != eb_in) { in btrfs_ref_to_path()
2612 if (!eb) { in iterate_inode_refs()
2670 if (!eb) { in iterate_inode_extrefs()
3094 if (node->eb) { in btrfs_backref_drop_node_buffer()
[all …]
A Dtree-checker.c72 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot, &vaf); in generic_err()
100 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot, in file_extent_err()
161 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot, in dir_item_err()
676 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot, in block_group_err()
1042 btrfs_crit(eb->fs_info, in dev_item_err()
1045 btrfs_header_owner(eb), btrfs_header_bytenr(eb), slot, in dev_item_err()
1289 len = eb->fs_info->nodesize; in extent_err()
1298 btrfs_crit(eb->fs_info, in extent_err()
2198 btrfs_crit(eb->fs_info, in btrfs_check_eb_owner()
2213 btrfs_crit(eb->fs_info, in btrfs_check_eb_owner()
[all …]
A Drelocation.c1061 ret = btrfs_cow_block(trans, dest, eb, NULL, 0, &eb, in replace_path()
1076 parent = eb; in replace_path()
1137 parent = eb; in replace_path()
1330 eb = btrfs_read_node_slot(eb, path->slots[i]); in walk_down_reloc_tree()
1331 if (IS_ERR(eb)) in walk_down_reloc_tree()
2294 eb = btrfs_read_node_slot(upper->eb, slot); in do_relocation()
2301 if (!node->eb) { in do_relocation()
2302 ret = btrfs_cow_block(trans, root, eb, upper->eb, in do_relocation()
2312 ASSERT(node->eb == eb); in do_relocation()
2455 if (IS_ERR(eb)) in get_tree_block_key()
[all …]
A Ddisk-io.c134 eb->start, eb->read_mirror, in btrfs_buffer_uptodate()
193 u64 end = min_t(u64, eb->start + eb->len, in btrfs_repair_eb_io_failure()
233 eb->start, eb->len); in btrfs_read_extent_buffer()
280 memzero_extent_buffer(eb, 0, eb->len); in btree_csum_one_bio()
311 eb->start, btrfs_header_generation(eb), last_trans); in btree_csum_one_bio()
376 eb->read_mirror, eb->start, found_start); in btrfs_validate_extent_buffer()
382 eb->start, eb->read_mirror); in btrfs_validate_extent_buffer()
390 eb->read_mirror, btrfs_header_level(eb), eb->start); in btrfs_validate_extent_buffer()
402 eb->start, eb->read_mirror, in btrfs_validate_extent_buffer()
424 eb->start, eb->read_mirror, check->transid, in btrfs_validate_extent_buffer()
[all …]
A Ddev-replace.c76 struct extent_buffer *eb; in btrfs_init_dev_replace() local
125 eb = path->nodes[0]; in btrfs_init_dev_replace()
126 item_size = btrfs_item_size(eb, slot); in btrfs_init_dev_replace()
141 btrfs_dev_replace_time_stopped(eb, ptr); in btrfs_init_dev_replace()
345 struct extent_buffer *eb; in btrfs_run_dev_replace() local
408 eb = path->nodes[0]; in btrfs_run_dev_replace()
409 ptr = btrfs_item_ptr(eb, path->slots[0], in btrfs_run_dev_replace()
414 btrfs_set_dev_replace_src_devid(eb, ptr, in btrfs_run_dev_replace()
420 btrfs_set_dev_replace_replace_state(eb, ptr, in btrfs_run_dev_replace()
430 btrfs_set_dev_replace_cursor_left(eb, ptr, in btrfs_run_dev_replace()
[all …]
A Dtree-log.c1273 ret = read_alloc_one_name(eb, ref + 1, btrfs_inode_ref_name_len(eb, ref), in ref_get_fields()
1314 eb = path->nodes[0]; in unlink_old_inode_refs()
1898 ret = read_alloc_one_name(eb, di + 1, btrfs_dir_name_len(eb, di), &name); in replay_one_name()
2170 eb = path->nodes[0]; in check_item_in_log()
2173 ret = read_alloc_one_name(eb, di + 1, btrfs_dir_name_len(eb, di), &name); in check_item_in_log()
2516 eb, i, &key); in replay_one_buffer()
2568 eb, i, &key); in replay_one_buffer()
2585 eb, i, &key); in replay_one_buffer()
2590 eb, i, &key); in replay_one_buffer()
2633 btrfs_tree_lock(eb); in clean_log_buffer()
[all …]
A Dsubpage.c640 void btrfs_meta_folio_set_##name(struct folio *folio, const struct extent_buffer *eb) \
642 if (!btrfs_meta_is_subpage(eb->fs_info)) { \
646 btrfs_subpage_set_##name(eb->fs_info, folio, eb->start, eb->len); \
648 void btrfs_meta_folio_clear_##name(struct folio *folio, const struct extent_buffer *eb) \
650 if (!btrfs_meta_is_subpage(eb->fs_info)) { \
654 btrfs_subpage_clear_##name(eb->fs_info, folio, eb->start, eb->len); \
656 bool btrfs_meta_folio_test_##name(struct folio *folio, const struct extent_buffer *eb) \
658 if (!btrfs_meta_is_subpage(eb->fs_info)) \
660 return btrfs_subpage_test_##name(eb->fs_info, folio, eb->start, eb->len); \
775 if (!btrfs_meta_is_subpage(eb->fs_info)) { in btrfs_meta_folio_clear_and_test_dirty()
[all …]
A Dtree-mod-log.h40 int btrfs_tree_mod_log_insert_key(const struct extent_buffer *eb, int slot,
42 int btrfs_tree_mod_log_free_eb(struct extent_buffer *eb);
44 struct extent_buffer *eb,
53 int btrfs_tree_mod_log_insert_move(const struct extent_buffer *eb,
A Dextent-tree.h99 int btrfs_get_extent_inline_ref_type(const struct extent_buffer *eb,
116 const struct extent_buffer *eb);
117 int btrfs_exclude_logged_extents(struct extent_buffer *eb);
147 struct extent_buffer *eb, u64 flags);
155 const struct extent_buffer *eb);
A Dextent-tree.c380 btrfs_print_leaf(eb); in btrfs_get_extent_inline_ref_type()
2196 ret = btrfs_add_delayed_extent_op(trans, eb->start, eb->len, in btrfs_set_disk_extent_flags()
2645 pin_down_extent(trans, cache, eb->start, eb->len, 0); in btrfs_pin_extent_for_log_replay()
2648 ret = btrfs_remove_free_space(cache, eb->start, eb->len); in btrfs_pin_extent_for_log_replay()
4773 eb->start); in btrfs_pin_reserved_extent()
4777 ret = pin_down_extent(trans, cache, eb->start, eb->len, 1); in btrfs_pin_reserved_extent()
5039 eb->start, btrfs_header_owner(eb), current->pid); in check_eb_lock_owner()
5453 eb->start); in walk_down_proc()
5846 btrfs_tree_lock(eb); in walk_up_proc()
5862 eb->start); in walk_up_proc()
[all …]
A Dsubpage.h178 void btrfs_meta_folio_set_##name(struct folio *folio, const struct extent_buffer *eb); \
179 void btrfs_meta_folio_clear_##name(struct folio *folio, const struct extent_buffer *eb); \
180 bool btrfs_meta_folio_test_##name(struct folio *folio, const struct extent_buffer *eb);
206 bool btrfs_meta_folio_clear_and_test_dirty(struct folio *folio, const struct extent_buffer *eb);
/fs/xfs/
A Dxfs_extent_busy.c55 spin_lock(&eb->eb_lock); in xfs_extent_busy_insert_list()
56 rbp = &eb->eb_tree.rb_node; in xfs_extent_busy_insert_list()
77 spin_unlock(&eb->eb_lock); in xfs_extent_busy_insert_list()
123 spin_lock(&eb->eb_lock); in xfs_extent_busy_search()
165 __releases(&eb->eb_lock) in xfs_extent_busy_update_extent()
166 __acquires(&eb->eb_lock) in xfs_extent_busy_update_extent()
587 eb->eb_gen++; in xfs_extent_busy_clear()
721 eb = kzalloc(sizeof(*eb), GFP_KERNEL); in xfs_extent_busy_alloc()
722 if (!eb) in xfs_extent_busy_alloc()
726 eb->eb_tree = RB_ROOT; in xfs_extent_busy_alloc()
[all …]
/fs/btrfs/tests/
A Dextent-io-tests.c383 struct extent_buffer *eb, in test_bitmap_set() argument
398 struct extent_buffer *eb, in test_bitmap_clear() argument
509 struct extent_buffer *eb = NULL; in test_eb_bitmaps() local
528 if (!eb) { in test_eb_bitmaps()
538 free_extent_buffer(eb); in test_eb_bitmaps()
545 if (!eb) { in test_eb_bitmaps()
553 free_extent_buffer(eb); in test_eb_bitmaps()
707 write_extent_buffer(eb, memory, 0, eb->len); in init_eb_and_memory()
733 if (!eb) { in test_eb_mem_ops()
739 init_eb_and_memory(eb, memory); in test_eb_mem_ops()
[all …]
A Dextent-buffer-tests.c18 struct extent_buffer *eb; in test_btrfs_split_item() local
52 path->nodes[0] = eb; in test_btrfs_split_item()
53 if (!eb) { in test_btrfs_split_item()
69 write_extent_buffer(eb, value, btrfs_item_ptr_offset(eb, 0), in test_btrfs_split_item()
89 btrfs_item_key_to_cpu(eb, &key, 0); in test_btrfs_split_item()
103 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 0), in test_btrfs_split_item()
113 btrfs_item_key_to_cpu(eb, &key, 1); in test_btrfs_split_item()
127 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 1), in test_btrfs_split_item()
158 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 0), in test_btrfs_split_item()
181 read_extent_buffer(eb, buf, btrfs_item_ptr_offset(eb, 1), in test_btrfs_split_item()
[all …]
/fs/ocfs2/
A Dalloc.c907 eb->h_signature); in ocfs2_validate_extent_block()
967 el = &eb->h_list; in ocfs2_num_free_extents()
1170 el = &eb->h_list; in ocfs2_add_branch()
1252 eb_el = &eb->h_list; in ocfs2_add_branch()
1387 eb_el = &eb->h_list; in ocfs2_shift_tree_depth()
1496 el = &eb->h_list; in ocfs2_find_branch_target()
1857 el = &eb->h_list; in __ocfs2_find_path()
2556 el = &eb->h_list; in ocfs2_update_edge_lengths()
2594 el = &eb->h_list; in ocfs2_unlink_path()
3198 el = &eb->h_list; in ocfs2_rotate_tree_left()
[all …]
A Dextent_map.c280 struct ocfs2_extent_block *eb; in ocfs2_last_eb_is_empty() local
289 eb = (struct ocfs2_extent_block *) eb_bh->b_data; in ocfs2_last_eb_is_empty()
290 el = &eb->h_list; in ocfs2_last_eb_is_empty()
351 struct ocfs2_extent_block *eb, *next_eb; in ocfs2_figure_hole_clusters() local
362 if (le64_to_cpu(eb->h_next_leaf_blk) == 0ULL) in ocfs2_figure_hole_clusters()
366 le64_to_cpu(eb->h_next_leaf_blk), in ocfs2_figure_hole_clusters()
404 struct ocfs2_extent_block *eb; in ocfs2_get_clusters_nocache() local
426 el = &eb->h_list; in ocfs2_get_clusters_nocache()
504 else if (eb->h_blkno == di->i_last_eb_blk) in ocfs2_get_clusters_nocache()
547 struct ocfs2_extent_block *eb; in ocfs2_xattr_get_clusters() local
[all …]

Completed in 129 milliseconds

12