Home
last modified time | relevance | path

Searched refs:BTRFS_MAX_LEVEL (Results 1 - 25 of 29) sorted by relevance

12

/kernel/linux/linux-6.6/fs/btrfs/
H A Dlocking.c37 * same as our lockdep setup here. If BTRFS_MAX_LEVEL changes, this code
41 #if BTRFS_MAX_LEVEL != 8
61 char names[BTRFS_MAX_LEVEL][24];
62 struct lock_class_key keys[BTRFS_MAX_LEVEL];
234 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in btrfs_unlock_up_safe()
H A Dbackref.h172 struct btrfs_backref_shared_cache_entry path_cache_entries[BTRFS_MAX_LEVEL];
411 struct btrfs_backref_node *path[BTRFS_MAX_LEVEL];
416 struct list_head pending[BTRFS_MAX_LEVEL];
H A Dctree.h80 * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point
87 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
88 int slots[BTRFS_MAX_LEVEL];
90 u8 locks[BTRFS_MAX_LEVEL];
185 struct rb_root blocks[BTRFS_MAX_LEVEL];
H A Dtree-checker.c1213 if (unlikely(btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1216 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1219 if (unlikely(btrfs_root_drop_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1222 btrfs_root_drop_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1298 key->offset >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1301 key->offset, BTRFS_MAX_LEVEL - 1); in check_extent_item()
1389 if (unlikely(btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1393 BTRFS_MAX_LEVEL - 1); in check_extent_item()
1871 if (unlikely(level <= 0 || level >= BTRFS_MAX_LEVEL)) { in __btrfs_check_node()
1874 level, BTRFS_MAX_LEVEL in __btrfs_check_node()
[all...]
H A Dfs.h845 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_insert_metadata_size()
855 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_metadata_size()
H A Dctree.c215 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()
1065 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()
1319 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()
1574 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()
1633 unlock_up = ((level + 1 < BTRFS_MAX_LEVEL) && p->locks[level + 1]); in read_block_for_search()
1859 if (write_lock_level < BTRFS_MAX_LEVEL) { in btrfs_search_slot_get_root()
2175 write_lock_level = BTRFS_MAX_LEVEL; in btrfs_search_slot()
2203 bool last_level = (level == (BTRFS_MAX_LEVEL - 1)); in btrfs_search_slot()
2219 level + 1 < BTRFS_MAX_LEVEL && in btrfs_search_slot()
2257 if (u < BTRFS_MAX_LEVEL in btrfs_search_slot()
[all...]
H A Drelocation.c289 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
1453 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in walk_up_reloc_tree()
1595 while (level < BTRFS_MAX_LEVEL) { in find_next_key()
1870 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in prepare_to_merge()
2284 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root()
2327 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in calcu_metadata_size()
2410 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in do_relocation()
2581 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in finish_pending_nodes()
2608 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in update_processed_blocks()
H A Dqgroup.c1299 fs_info->qgroup_drop_subtree_thres = BTRFS_MAX_LEVEL; in btrfs_quota_disable()
2212 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2213 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2366 BUG_ON(root_level < 0 || root_level >= BTRFS_MAX_LEVEL); in btrfs_qgroup_trace_subtree()
3286 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in is_last_leaf()
4204 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_qgroup_init_swapped_blocks()
4225 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_clean_swapped_blocks()
4404 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_trace_subtree_after_cow()
H A Dbackref.c1265 if (WARN_ON_ONCE(level >= BTRFS_MAX_LEVEL)) in lookup_backref_shared_cache()
1336 if (WARN_ON_ONCE(level >= BTRFS_MAX_LEVEL)) in store_backref_shared_cache()
2017 for ( ; i < BTRFS_MAX_LEVEL; i++) in btrfs_is_data_extent_shared()
3006 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_backref_init_cache()
3022 ASSERT(level >= 0 && level < BTRFS_MAX_LEVEL); in btrfs_backref_alloc_node()
3109 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_backref_release_cache()
3279 for (; level < BTRFS_MAX_LEVEL; level++) { in handle_indirect_tree_backref()
H A Ddisk-io.c364 if (found_level >= BTRFS_MAX_LEVEL) { in btrfs_validate_extent_buffer()
1942 fs_info->qgroup_drop_subtree_thres = BTRFS_MAX_LEVEL; in btrfs_init_qgroup()
2324 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2326 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2329 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2331 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2334 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2336 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
H A Dcheck-integrity.c689 BTRFS_MAX_LEVEL + 3, 1); in btrfsic_process_superblock()
2226 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_check_all_ref_blocks()
2336 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_is_block_ref_by_superblock()
H A Dref-verify.c588 for (l = 0; l < BTRFS_MAX_LEVEL; l++) { in walk_up_tree()
H A Dextent-tree.c740 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
5018 u64 refs[BTRFS_MAX_LEVEL];
5019 u64 flags[BTRFS_MAX_LEVEL];
5762 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
/kernel/linux/linux-5.10/fs/btrfs/
H A Dtree-checker.c1137 if (btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL) { in check_root_item()
1140 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1143 if (ri.drop_level >= BTRFS_MAX_LEVEL) { in check_root_item()
1146 ri.drop_level, BTRFS_MAX_LEVEL - 1); in check_root_item()
1221 key->offset >= BTRFS_MAX_LEVEL) { in check_extent_item()
1224 key->offset, BTRFS_MAX_LEVEL - 1); in check_extent_item()
1306 if (btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL) { in check_extent_item()
1310 BTRFS_MAX_LEVEL - 1); in check_extent_item()
1745 if (level <= 0 || level >= BTRFS_MAX_LEVEL) { in btrfs_check_node()
1748 level, BTRFS_MAX_LEVEL in btrfs_check_node()
[all...]
H A Dlocking.c496 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_set_path_blocking()
530 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in btrfs_unlock_up_safe()
H A Dbackref.h236 struct btrfs_backref_node *path[BTRFS_MAX_LEVEL];
241 struct list_head pending[BTRFS_MAX_LEVEL];
H A Dctree.c100 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()
1869 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()
2095 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()
2349 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()
2639 if (write_lock_level < BTRFS_MAX_LEVEL) { in btrfs_search_slot_get_root()
2748 write_lock_level = BTRFS_MAX_LEVEL; in btrfs_search_slot()
2766 bool last_level = (level == (BTRFS_MAX_LEVEL - 1)); in btrfs_search_slot()
2784 level + 1 < BTRFS_MAX_LEVEL && in btrfs_search_slot()
2827 if (u < BTRFS_MAX_LEVEL && p->locks[u]) { in btrfs_search_slot()
3152 for (i = level; i < BTRFS_MAX_LEVEL; in fixup_low_keys()
[all...]
H A Drelocation.c277 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
1414 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in walk_up_reloc_tree()
1565 while (level < BTRFS_MAX_LEVEL) { in find_next_key()
1841 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in prepare_to_merge()
2108 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root()
2145 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in calcu_metadata_size()
2229 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in do_relocation()
2402 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in finish_pending_nodes()
2429 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in update_processed_blocks()
H A Ddisk-io.c145 * same as our lockdep setup here. If BTRFS_MAX_LEVEL changes, this code
149 # if BTRFS_MAX_LEVEL != 8
156 char names[BTRFS_MAX_LEVEL + 1][20];
157 struct lock_class_key keys[BTRFS_MAX_LEVEL + 1];
575 if (found_level >= BTRFS_MAX_LEVEL) { in btrfs_validate_metadata_buffer()
2448 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
2450 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
2453 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
2455 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
2458 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
[all...]
H A Dctree.h65 #define BTRFS_MAX_LEVEL 8 macro
350 * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point
358 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
359 int slots[BTRFS_MAX_LEVEL];
361 u8 locks[BTRFS_MAX_LEVEL];
1044 struct rb_root blocks[BTRFS_MAX_LEVEL];
2536 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_insert_metadata_size()
2546 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_metadata_size()
H A Dqgroup.c2149 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2150 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2312 BUG_ON(root_level < 0 || root_level >= BTRFS_MAX_LEVEL); in btrfs_qgroup_trace_subtree()
3225 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in is_last_leaf()
4156 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_qgroup_init_swapped_blocks()
4177 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_clean_swapped_blocks()
4356 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_trace_subtree_after_cow()
H A Dbackref.c2549 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
2565 ASSERT(level >= 0 && level < BTRFS_MAX_LEVEL);
2652 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
2820 for (; level < BTRFS_MAX_LEVEL; level++) {
H A Dcheck-integrity.c742 BTRFS_MAX_LEVEL + 3, 1); in btrfsic_process_superblock()
2262 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_check_all_ref_blocks()
2366 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_is_block_ref_by_superblock()
H A Dextent-tree.c749 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
4740 u64 refs[BTRFS_MAX_LEVEL];
4741 u64 flags[BTRFS_MAX_LEVEL];
5482 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
/kernel/linux/linux-6.6/include/uapi/linux/
H A Dbtrfs_tree.h16 #define BTRFS_MAX_LEVEL 8 macro

Completed in 81 milliseconds

12