Home
last modified time | relevance | path

Searched refs:BTRFS_MAX_LEVEL (Results 1 – 14 of 14) sorted by relevance

/linux-6.1.9/fs/btrfs/
Dlocking.c40 #if BTRFS_MAX_LEVEL != 8
60 char names[BTRFS_MAX_LEVEL][20];
61 struct lock_class_key keys[BTRFS_MAX_LEVEL];
232 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in btrfs_unlock_up_safe()
Dbackref.h31 struct btrfs_backref_shared_cache_entry entries[BTRFS_MAX_LEVEL];
254 struct btrfs_backref_node *path[BTRFS_MAX_LEVEL];
259 struct list_head pending[BTRFS_MAX_LEVEL];
Dtree-checker.c1181 if (unlikely(btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1184 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1187 if (unlikely(btrfs_root_drop_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1190 btrfs_root_drop_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1266 key->offset >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1269 key->offset, BTRFS_MAX_LEVEL - 1); in check_extent_item()
1357 if (unlikely(btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1361 BTRFS_MAX_LEVEL - 1); in check_extent_item()
1831 if (unlikely(level <= 0 || level >= BTRFS_MAX_LEVEL)) { in btrfs_check_node()
1834 level, BTRFS_MAX_LEVEL - 1); in btrfs_check_node()
Dctree.c103 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()
905 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()
1129 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()
1373 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()
1432 unlock_up = ((level + 1 < BTRFS_MAX_LEVEL) && p->locks[level + 1]); in read_block_for_search()
1655 if (write_lock_level < BTRFS_MAX_LEVEL) { in btrfs_search_slot_get_root()
1969 write_lock_level = BTRFS_MAX_LEVEL; in btrfs_search_slot()
1997 bool last_level = (level == (BTRFS_MAX_LEVEL - 1)); in btrfs_search_slot()
2013 level + 1 < BTRFS_MAX_LEVEL && in btrfs_search_slot()
2051 if (u < BTRFS_MAX_LEVEL && p->locks[u]) { in btrfs_search_slot()
[all …]
Drelocation.c280 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
1440 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in walk_up_reloc_tree()
1580 while (level < BTRFS_MAX_LEVEL) { in find_next_key()
1855 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in prepare_to_merge()
2240 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root()
2283 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in calcu_metadata_size()
2366 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in do_relocation()
2537 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in finish_pending_nodes()
2564 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in update_processed_blocks()
Dqgroup.c1282 fs_info->qgroup_drop_subtree_thres = BTRFS_MAX_LEVEL; in btrfs_quota_disable()
2161 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2162 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2315 BUG_ON(root_level < 0 || root_level >= BTRFS_MAX_LEVEL); in btrfs_qgroup_trace_subtree()
3236 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in is_last_leaf()
4154 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_qgroup_init_swapped_blocks()
4175 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_clean_swapped_blocks()
4353 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_trace_subtree_after_cow()
Dbackref.c1560 if (WARN_ON_ONCE(level >= BTRFS_MAX_LEVEL)) in lookup_backref_shared_cache()
1627 if (WARN_ON_ONCE(level >= BTRFS_MAX_LEVEL)) in store_backref_shared_cache()
2712 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_backref_init_cache()
2728 ASSERT(level >= 0 && level < BTRFS_MAX_LEVEL); in btrfs_backref_alloc_node()
2815 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_backref_release_cache()
2983 for (; level < BTRFS_MAX_LEVEL; level++) { in handle_indirect_tree_backref()
Dctree.h71 #define BTRFS_MAX_LEVEL 8 macro
422 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
423 int slots[BTRFS_MAX_LEVEL];
425 u8 locks[BTRFS_MAX_LEVEL];
1119 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_insert_metadata_size()
1129 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_metadata_size()
1313 struct rb_root blocks[BTRFS_MAX_LEVEL];
Ddisk-io.c490 if (found_level >= BTRFS_MAX_LEVEL) { in validate_extent_buffer()
2268 fs_info->qgroup_drop_subtree_thres = BTRFS_MAX_LEVEL; in btrfs_init_qgroup()
2635 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2637 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2640 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2642 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2645 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2647 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
Dcheck-integrity.c687 BTRFS_MAX_LEVEL + 3, 1); in btrfsic_process_superblock()
2219 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_check_all_ref_blocks()
2329 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_is_block_ref_by_superblock()
Dref-verify.c585 for (l = 0; l < BTRFS_MAX_LEVEL; l++) { in walk_up_tree()
Dextent-tree.c754 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
5038 u64 refs[BTRFS_MAX_LEVEL];
5039 u64 flags[BTRFS_MAX_LEVEL];
5779 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
Dsysfs.c2074 if (new_thres > BTRFS_MAX_LEVEL) in qgroup_drop_subtree_thres_store()
Dtree-log.c2708 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { in walk_up_log_tree()