Home
last modified time | relevance | path

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

/fs/btrfs/
Dtree-checker.c967 if (btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL) { in check_root_item()
970 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
973 if (ri.drop_level >= BTRFS_MAX_LEVEL) { in check_root_item()
976 ri.drop_level, BTRFS_MAX_LEVEL - 1); in check_root_item()
1052 key->offset >= BTRFS_MAX_LEVEL) { in check_extent_item()
1055 key->offset, BTRFS_MAX_LEVEL - 1); in check_extent_item()
1137 if (btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL) { in check_extent_item()
1141 BTRFS_MAX_LEVEL - 1); in check_extent_item()
1541 if (level <= 0 || level >= BTRFS_MAX_LEVEL) { in btrfs_check_node()
1544 level, BTRFS_MAX_LEVEL - 1); in btrfs_check_node()
Dctree.c66 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_set_path_blocking()
103 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()
1902 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()
2125 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()
2378 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()
2428 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in btrfs_unlock_up_safe()
2708 if (write_lock_level < BTRFS_MAX_LEVEL) { in btrfs_search_slot_get_root()
2817 write_lock_level = BTRFS_MAX_LEVEL; in btrfs_search_slot()
2837 bool last_level = (level == (BTRFS_MAX_LEVEL - 1)); in btrfs_search_slot()
2855 level + 1 < BTRFS_MAX_LEVEL && in btrfs_search_slot()
[all …]
Drelocation.c94 struct backref_node *path[BTRFS_MAX_LEVEL];
100 struct list_head pending[BTRFS_MAX_LEVEL];
204 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in backref_cache_init()
230 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in backref_cache_cleanup()
507 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
940 for (; level < BTRFS_MAX_LEVEL; level++) { in build_backref_tree()
2043 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in walk_up_reloc_tree()
2194 while (level < BTRFS_MAX_LEVEL) { in find_next_key()
2459 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in prepare_to_merge()
2720 struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root()
[all …]
Ddisk-io.c143 # if BTRFS_MAX_LEVEL != 8
150 char names[BTRFS_MAX_LEVEL + 1][20];
151 struct lock_class_key keys[BTRFS_MAX_LEVEL + 1];
637 if (found_level >= BTRFS_MAX_LEVEL) { in btree_readpage_end_io_hook()
2423 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
2425 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
2428 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
2430 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
2433 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
2435 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
Dctree.h63 #define BTRFS_MAX_LEVEL 8 macro
347 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
348 int slots[BTRFS_MAX_LEVEL];
350 u8 locks[BTRFS_MAX_LEVEL];
956 struct rb_root blocks[BTRFS_MAX_LEVEL];
2389 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_insert_metadata_size()
2399 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_metadata_size()
Dqgroup.c2094 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2095 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2257 BUG_ON(root_level < 0 || root_level >= BTRFS_MAX_LEVEL); in btrfs_qgroup_trace_subtree()
3168 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in is_last_leaf()
4103 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_qgroup_init_swapped_blocks()
4124 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_clean_swapped_blocks()
4303 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_trace_subtree_after_cow()
Dcheck-integrity.c751 BTRFS_MAX_LEVEL + 3, 1); in btrfsic_process_superblock()
2323 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_check_all_ref_blocks()
2427 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.c787 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
4618 u64 refs[BTRFS_MAX_LEVEL];
4619 u64 flags[BTRFS_MAX_LEVEL];
5366 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
Dtree-log.c2741 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()
2747 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()
2824 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()
2843 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { in walk_up_log_tree()