Home
last modified time | relevance | path

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

/linux/fs/btrfs/
H A Dbackref.h184 struct btrfs_backref_shared_cache_entry path_cache_entries[BTRFS_MAX_LEVEL];
390 struct btrfs_backref_node *path[BTRFS_MAX_LEVEL];
395 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];
160 struct rb_root blocks[BTRFS_MAX_LEVEL];
H A Dtree-checker.c1250 if (unlikely(btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1253 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1256 if (unlikely(btrfs_root_drop_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1259 btrfs_root_drop_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1351 key->offset >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1354 key->offset, BTRFS_MAX_LEVEL - 1); in check_extent_item()
1454 if (unlikely(btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1458 BTRFS_MAX_LEVEL - 1); in check_extent_item()
2113 if (unlikely(level <= 0 || level >= BTRFS_MAX_LEVEL)) { in __btrfs_check_node()
2116 level, BTRFS_MAX_LEVEL - 1); in __btrfs_check_node()
H A Dctree.c164 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()
873 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()
1139 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()
1394 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()
1712 if (write_lock_level < BTRFS_MAX_LEVEL) { in btrfs_search_slot_get_root()
2032 write_lock_level = BTRFS_MAX_LEVEL; in btrfs_search_slot()
2060 bool last_level = (level == (BTRFS_MAX_LEVEL - 1)); in btrfs_search_slot()
2076 level + 1 < BTRFS_MAX_LEVEL && in btrfs_search_slot()
2114 if (u < BTRFS_MAX_LEVEL && p->locks[u]) { in btrfs_search_slot()
2546 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in fixup_low_keys()
[all …]
H A Dfs.h948 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_insert_metadata_size()
958 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_metadata_size()
H A Drelocation.c1249 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in walk_up_reloc_tree()
1392 while (level < BTRFS_MAX_LEVEL) { in find_next_key()
1667 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in prepare_to_merge()
2053 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root()
2095 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in calcu_metadata_size()
2183 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in do_relocation()
2357 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in finish_pending_nodes()
2384 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in update_processed_blocks()
H A Dbackref.c1256 if (WARN_ON_ONCE(level >= BTRFS_MAX_LEVEL)) in lookup_backref_shared_cache()
1327 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()
3035 ASSERT(level >= 0 && level < BTRFS_MAX_LEVEL); in btrfs_backref_alloc_node()
3340 for (; level < BTRFS_MAX_LEVEL; level++) { in handle_indirect_tree_backref()
H A Dqgroup.c2453 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2454 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2617 ASSERT(0 <= root_level && root_level < BTRFS_MAX_LEVEL); in btrfs_qgroup_trace_subtree()
3700 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in is_last_leaf()
4639 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_qgroup_init_swapped_blocks()
4660 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_clean_swapped_blocks()
4838 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_trace_subtree_after_cow()
H A Ddisk-io.c389 if (found_level >= BTRFS_MAX_LEVEL) { in btrfs_validate_extent_buffer()
2430 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2432 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2435 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2437 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
2440 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_validate_super()
2442 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_validate_super()
H A Dref-verify.c596 for (l = 0; l < BTRFS_MAX_LEVEL; l++) { in walk_up_tree()
H A Dextent-tree.c733 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
5195 u64 refs[BTRFS_MAX_LEVEL];
5196 u64 flags[BTRFS_MAX_LEVEL];
6140 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
H A Dsysfs.c2448 if (new_thres > BTRFS_MAX_LEVEL) in qgroup_drop_subtree_thres_store()
H A Dtree-log.c2693 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