Home
last modified time | relevance | path

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

/linux/fs/btrfs/
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()
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];
A Dctree.h60 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
61 int slots[BTRFS_MAX_LEVEL];
63 u8 locks[BTRFS_MAX_LEVEL];
161 struct rb_root blocks[BTRFS_MAX_LEVEL];
A Dtree-checker.c1238 if (unlikely(btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1241 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1244 if (unlikely(btrfs_root_drop_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1247 btrfs_root_drop_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1339 key->offset >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1342 key->offset, BTRFS_MAX_LEVEL - 1); in check_extent_item()
1442 if (unlikely(btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1446 BTRFS_MAX_LEVEL - 1); in check_extent_item()
2076 if (unlikely(level <= 0 || level >= BTRFS_MAX_LEVEL)) { in __btrfs_check_node()
2079 level, BTRFS_MAX_LEVEL - 1); in __btrfs_check_node()
A Dctree.c215 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()
943 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()
1209 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()
1464 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()
1744 if (write_lock_level < BTRFS_MAX_LEVEL) { in btrfs_search_slot_get_root()
2060 write_lock_level = BTRFS_MAX_LEVEL; in btrfs_search_slot()
2104 level + 1 < BTRFS_MAX_LEVEL && in btrfs_search_slot()
4755 while (level < BTRFS_MAX_LEVEL) { in btrfs_find_next_key()
4766 if (level + 1 >= BTRFS_MAX_LEVEL || in btrfs_find_next_key()
4900 while (level < BTRFS_MAX_LEVEL) { in btrfs_next_old_leaf()
[all …]
A Dfs.h940 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_insert_metadata_size()
950 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_metadata_size()
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()
3182 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_backref_release_cache()
3371 for (; level < BTRFS_MAX_LEVEL; level++) { in handle_indirect_tree_backref()
A Drelocation.c1349 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in walk_up_reloc_tree()
1492 while (level < BTRFS_MAX_LEVEL) { in find_next_key()
1767 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in prepare_to_merge()
2181 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root()
2223 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in calcu_metadata_size()
2306 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in do_relocation()
2480 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in finish_pending_nodes()
2507 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in update_processed_blocks()
A Dqgroup.c2466 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2467 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2630 ASSERT(0 <= root_level && root_level < BTRFS_MAX_LEVEL); in btrfs_qgroup_trace_subtree()
3712 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in is_last_leaf()
4644 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_qgroup_init_swapped_blocks()
4665 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_clean_swapped_blocks()
4844 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_trace_subtree_after_cow()
A Ddisk-io.c389 if (found_level >= BTRFS_MAX_LEVEL) { in btrfs_validate_extent_buffer()
2365 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2367 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2370 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2372 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2375 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2377 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
A Dref-verify.c596 for (l = 0; l < BTRFS_MAX_LEVEL; l++) { in walk_up_tree()
A Dextent-tree.c735 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
5220 u64 refs[BTRFS_MAX_LEVEL];
5221 u64 flags[BTRFS_MAX_LEVEL];
6166 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
A Dsysfs.c2312 if (new_thres > BTRFS_MAX_LEVEL) in qgroup_drop_subtree_thres_store()
A Dtree-log.c2694 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { in walk_up_log_tree()
/linux/include/uapi/linux/
A Dbtrfs_tree.h16 #define BTRFS_MAX_LEVEL 8 macro

Completed in 84 milliseconds