Home
last modified time | relevance | path

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

/kernel/linux/linux-5.10/fs/btrfs/
Dtree-checker.c1122 if (btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL) { in check_root_item()
1125 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1128 if (ri.drop_level >= BTRFS_MAX_LEVEL) { in check_root_item()
1131 ri.drop_level, BTRFS_MAX_LEVEL - 1); in check_root_item()
1206 key->offset >= BTRFS_MAX_LEVEL) { in check_extent_item()
1209 key->offset, BTRFS_MAX_LEVEL - 1); in check_extent_item()
1291 if (btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL) { in check_extent_item()
1295 BTRFS_MAX_LEVEL - 1); in check_extent_item()
1730 if (level <= 0 || level >= BTRFS_MAX_LEVEL) { in btrfs_check_node()
1733 level, BTRFS_MAX_LEVEL - 1); in btrfs_check_node()
Dbackref.h237 struct btrfs_backref_node *path[BTRFS_MAX_LEVEL];
242 struct list_head pending[BTRFS_MAX_LEVEL];
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()
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; i++) { in fixup_low_keys()
[all …]
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()
Ddisk-io.c149 # 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()
2418 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
2420 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
2423 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
2425 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
2428 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
2430 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
Dctree.h65 #define BTRFS_MAX_LEVEL 8 macro
358 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
359 int slots[BTRFS_MAX_LEVEL];
361 u8 locks[BTRFS_MAX_LEVEL];
1046 struct rb_root blocks[BTRFS_MAX_LEVEL];
2538 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_insert_metadata_size()
2548 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_metadata_size()
Dqgroup.c2085 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2086 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2248 BUG_ON(root_level < 0 || root_level >= BTRFS_MAX_LEVEL); in btrfs_qgroup_trace_subtree()
3159 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in is_last_leaf()
4079 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_qgroup_init_swapped_blocks()
4100 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_clean_swapped_blocks()
4279 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_trace_subtree_after_cow()
Dbackref.c2496 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
2512 ASSERT(level >= 0 && level < BTRFS_MAX_LEVEL);
2599 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
2767 for (; level < BTRFS_MAX_LEVEL; level++) {
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()
Dref-verify.c597 for (l = 0; l < BTRFS_MAX_LEVEL; l++) { in walk_up_tree()
Dextent-tree.c749 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
4728 u64 refs[BTRFS_MAX_LEVEL];
4729 u64 flags[BTRFS_MAX_LEVEL];
5470 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
Dtree-log.c2810 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { in walk_up_log_tree()