Home
last modified time | relevance | path

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

/linux/fs/btrfs/
H A Dlocking.c41 #if BTRFS_MAX_LEVEL != 8
61 char names[BTRFS_MAX_LEVEL][24];
62 struct lock_class_key keys[BTRFS_MAX_LEVEL];
235 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in btrfs_unlock_up_safe()
H A Dbackref.h184 struct btrfs_backref_shared_cache_entry path_cache_entries[BTRFS_MAX_LEVEL];
388 struct btrfs_backref_node *path[BTRFS_MAX_LEVEL];
393 struct list_head pending[BTRFS_MAX_LEVEL];
H A Dctree.h59 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
60 int slots[BTRFS_MAX_LEVEL];
62 u8 locks[BTRFS_MAX_LEVEL];
157 struct rb_root blocks[BTRFS_MAX_LEVEL];
H A Dtree-checker.c1219 if (unlikely(btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1222 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1225 if (unlikely(btrfs_root_drop_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1228 btrfs_root_drop_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1307 key->offset >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1310 key->offset, BTRFS_MAX_LEVEL - 1); in check_extent_item()
1410 if (unlikely(btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1414 BTRFS_MAX_LEVEL - 1); in check_extent_item()
1960 if (unlikely(level <= 0 || level >= BTRFS_MAX_LEVEL)) { in __btrfs_check_node()
1963 level, BTRFS_MAX_LEVEL - 1); in __btrfs_check_node()
H A Dctree.c215 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()
935 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()
1189 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()
1444 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()
1503 unlock_up = ((level + 1 < BTRFS_MAX_LEVEL) && p->locks[level + 1]); in read_block_for_search()
1729 if (write_lock_level < BTRFS_MAX_LEVEL) { in btrfs_search_slot_get_root()
2045 write_lock_level = BTRFS_MAX_LEVEL; in btrfs_search_slot()
2073 bool last_level = (level == (BTRFS_MAX_LEVEL - 1)); in btrfs_search_slot()
2089 level + 1 < BTRFS_MAX_LEVEL && in btrfs_search_slot()
2127 if (u < BTRFS_MAX_LEVEL && p->locks[u]) { in btrfs_search_slot()
[all …]
H A Dfs.h936 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_insert_metadata_size()
946 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_metadata_size()
H A Drelocation.c285 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
1415 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in walk_up_reloc_tree()
1558 while (level < BTRFS_MAX_LEVEL) { in find_next_key()
1833 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in prepare_to_merge()
2247 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root()
2289 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in calcu_metadata_size()
2372 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in do_relocation()
2546 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in finish_pending_nodes()
2573 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in update_processed_blocks()
H A Dbackref.c1257 if (WARN_ON_ONCE(level >= BTRFS_MAX_LEVEL)) in lookup_backref_shared_cache()
1328 if (WARN_ON_ONCE(level >= BTRFS_MAX_LEVEL)) in store_backref_shared_cache()
2011 for ( ; i < BTRFS_MAX_LEVEL; i++) in btrfs_is_data_extent_shared()
3022 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_backref_init_cache()
3038 ASSERT(level >= 0 && level < BTRFS_MAX_LEVEL); in btrfs_backref_alloc_node()
3184 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_backref_release_cache()
3367 for (; level < BTRFS_MAX_LEVEL; level++) { in handle_indirect_tree_backref()
H A Dqgroup.c1425 fs_info->qgroup_drop_subtree_thres = BTRFS_MAX_LEVEL; in btrfs_quota_disable()
2356 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2357 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2520 ASSERT(0 <= root_level && root_level < BTRFS_MAX_LEVEL); in btrfs_qgroup_trace_subtree()
3600 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in is_last_leaf()
4547 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_qgroup_init_swapped_blocks()
4568 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_clean_swapped_blocks()
4747 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_trace_subtree_after_cow()
H A Ddisk-io.c388 if (found_level >= BTRFS_MAX_LEVEL) { in btrfs_validate_extent_buffer()
1974 fs_info->qgroup_drop_subtree_thres = BTRFS_MAX_LEVEL; in btrfs_init_qgroup()
2369 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2371 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2374 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2376 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2379 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2381 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
H A Dref-verify.c591 for (l = 0; l < BTRFS_MAX_LEVEL; l++) { in walk_up_tree()
H A Dextent-tree.c746 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
5210 u64 refs[BTRFS_MAX_LEVEL];
5211 u64 flags[BTRFS_MAX_LEVEL];
5956 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
H A Dsysfs.c2229 if (new_thres > BTRFS_MAX_LEVEL) in qgroup_drop_subtree_thres_store()
H A Dtree-log.c2674 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { in walk_up_log_tree()
/linux/include/uapi/linux/
H A Dbtrfs_tree.h16 #define BTRFS_MAX_LEVEL 8 macro