Home
last modified time | relevance | path

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

/fs/btrfs/
Drelocation.c104 struct backref_node *path[BTRFS_MAX_LEVEL];
110 struct list_head pending[BTRFS_MAX_LEVEL];
212 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in backref_cache_init()
238 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in backref_cache_cleanup()
515 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
939 for (; level < BTRFS_MAX_LEVEL; level++) {
1973 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
2118 while (level < BTRFS_MAX_LEVEL) {
2187 min_reserved = root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
2300 rc->merging_rsv_size += root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
[all …]
Dctree.c58 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_set_path_blocking()
91 for (i = BTRFS_MAX_LEVEL - 1; i >= 0; i--) { in btrfs_clear_path_blocking()
124 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()
1893 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()
2112 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()
2365 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()
2415 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in btrfs_unlock_up_safe()
2704 write_lock_level = BTRFS_MAX_LEVEL; in btrfs_search_slot()
2779 level + 1 < BTRFS_MAX_LEVEL && in btrfs_search_slot()
2813 if (u < BTRFS_MAX_LEVEL && p->locks[u]) { in btrfs_search_slot()
[all …]
Ddisk-io.c162 # if BTRFS_MAX_LEVEL != 8
169 char names[BTRFS_MAX_LEVEL + 1][20];
170 struct lock_class_key keys[BTRFS_MAX_LEVEL + 1];
733 if (found_level >= BTRFS_MAX_LEVEL) { in btree_readpage_end_io_hook()
4148 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_check_super_valid()
4150 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_check_super_valid()
4153 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_check_super_valid()
4155 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_check_super_valid()
4158 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_check_super_valid()
4160 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_check_super_valid()
Dctree.h65 #define BTRFS_MAX_LEVEL 8 macro
323 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
324 int slots[BTRFS_MAX_LEVEL];
326 u8 locks[BTRFS_MAX_LEVEL];
2540 return root->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_trans_metadata_size()
2550 return root->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_trunc_metadata_size()
Dcheck-integrity.c769 BTRFS_MAX_LEVEL + 3, 1); in btrfsic_process_superblock()
2341 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_check_all_ref_blocks()
2445 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_is_block_ref_by_superblock()
Dtree-log.c2421 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()
2425 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()
2499 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()
2517 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { in walk_up_log_tree()
Dextent-tree.c1504 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
8447 u64 refs[BTRFS_MAX_LEVEL];
8448 u64 flags[BTRFS_MAX_LEVEL];
8659 BUG_ON(root_level < 0 || root_level > BTRFS_MAX_LEVEL); in account_shared_subtree()
9310 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()