Home
last modified time | relevance | path

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

/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()
Dtree-checker.c1178 if (unlikely(btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1181 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1184 if (unlikely(btrfs_root_drop_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1187 btrfs_root_drop_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1263 key->offset >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1266 key->offset, BTRFS_MAX_LEVEL - 1); in check_extent_item()
1354 if (unlikely(btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1358 BTRFS_MAX_LEVEL - 1); in check_extent_item()
1816 if (unlikely(level <= 0 || level >= BTRFS_MAX_LEVEL)) { in btrfs_check_node()
1819 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];
Dctree.c101 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()
913 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()
1148 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()
1393 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()
1642 if (write_lock_level < BTRFS_MAX_LEVEL) { in btrfs_search_slot_get_root()
1794 write_lock_level = BTRFS_MAX_LEVEL; in btrfs_search_slot()
1817 bool last_level = (level == (BTRFS_MAX_LEVEL - 1)); in btrfs_search_slot()
1833 level + 1 < BTRFS_MAX_LEVEL && in btrfs_search_slot()
1875 if (u < BTRFS_MAX_LEVEL && p->locks[u]) { in btrfs_search_slot()
2230 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in fixup_low_keys()
[all …]
Drelocation.c278 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
1444 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in walk_up_reloc_tree()
1584 while (level < BTRFS_MAX_LEVEL) { in find_next_key()
1858 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in prepare_to_merge()
2272 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root()
2315 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in calcu_metadata_size()
2398 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in do_relocation()
2570 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in finish_pending_nodes()
2597 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in update_processed_blocks()
Dqgroup.c2159 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2160 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()
3215 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in is_last_leaf()
4122 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_qgroup_init_swapped_blocks()
4143 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_clean_swapped_blocks()
4322 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_trace_subtree_after_cow()
Dctree.h65 #define BTRFS_MAX_LEVEL 8 macro
392 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
393 int slots[BTRFS_MAX_LEVEL];
395 u8 locks[BTRFS_MAX_LEVEL];
1143 struct rb_root blocks[BTRFS_MAX_LEVEL];
2708 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_insert_metadata_size()
2718 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_metadata_size()
Ddisk-io.c525 if (found_level >= BTRFS_MAX_LEVEL) { in validate_extent_buffer()
2545 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2547 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2550 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2552 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2555 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2557 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
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++) {
Dcheck-integrity.c690 BTRFS_MAX_LEVEL + 3, 1); in btrfsic_process_superblock()
2209 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_check_all_ref_blocks()
2313 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.c751 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
4961 u64 refs[BTRFS_MAX_LEVEL];
4962 u64 flags[BTRFS_MAX_LEVEL];
5700 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
Dtree-log.c2835 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { in walk_up_log_tree()