Home
last modified time | relevance | path

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

/linux-4.1.27/fs/btrfs/
Drelocation.c103 struct backref_node *path[BTRFS_MAX_LEVEL];
109 struct list_head pending[BTRFS_MAX_LEVEL];
211 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in backref_cache_init()
237 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in backref_cache_cleanup()
513 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
929 for (; level < BTRFS_MAX_LEVEL; level++) {
1949 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
2092 while (level < BTRFS_MAX_LEVEL) {
2161 min_reserved = root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
2274 rc->merging_rsv_size += root->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
[all …]
Dctree.c59 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_set_path_blocking()
92 for (i = BTRFS_MAX_LEVEL - 1; i >= 0; i--) { in btrfs_clear_path_blocking()
125 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()
1905 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()
2117 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()
2369 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()
2419 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in btrfs_unlock_up_safe()
2706 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.c157 # if BTRFS_MAX_LEVEL != 8
164 char names[BTRFS_MAX_LEVEL + 1][20];
165 struct lock_class_key keys[BTRFS_MAX_LEVEL + 1];
645 if (found_level >= BTRFS_MAX_LEVEL) { in btree_readpage_end_io_hook()
3918 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_check_super_valid()
3920 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_check_super_valid()
3923 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_check_super_valid()
3925 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_check_super_valid()
3928 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in btrfs_check_super_valid()
3930 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in btrfs_check_super_valid()
Dctree.h62 #define BTRFS_MAX_LEVEL 8 macro
594 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
595 int slots[BTRFS_MAX_LEVEL];
597 int locks[BTRFS_MAX_LEVEL];
3336 return (root->nodesize + root->nodesize * (BTRFS_MAX_LEVEL - 1)) * in btrfs_calc_trans_metadata_size()
3347 return root->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_trunc_metadata_size()
Dcheck-integrity.c782 BTRFS_MAX_LEVEL + 3, 1); in btrfsic_process_superblock()
2442 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_check_all_ref_blocks()
2566 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_is_block_ref_by_superblock()
Dtree-log.c2301 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()
2305 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()
2376 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()
2394 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { in walk_up_log_tree()
Dextent-tree.c1439 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
7667 u64 refs[BTRFS_MAX_LEVEL];
7668 u64 flags[BTRFS_MAX_LEVEL];
7879 BUG_ON(root_level < 0 || root_level > BTRFS_MAX_LEVEL); in account_shared_subtree()
8511 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()