Searched refs:BTRFS_MAX_LEVEL (Results 1 – 9 of 9) sorted by relevance
44 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_set_path_blocking()77 for (i = BTRFS_MAX_LEVEL - 1; i >= 0; i--) { in btrfs_clear_path_blocking()110 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()1829 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()2052 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()2307 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()2357 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in btrfs_unlock_up_safe()2637 if (write_lock_level < BTRFS_MAX_LEVEL) { in btrfs_search_slot_get_root()2736 write_lock_level = BTRFS_MAX_LEVEL; in btrfs_search_slot()2752 bool last_level = (level == (BTRFS_MAX_LEVEL - 1)); in btrfs_search_slot()[all …]
92 struct backref_node *path[BTRFS_MAX_LEVEL];98 struct list_head pending[BTRFS_MAX_LEVEL];200 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in backref_cache_init()226 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in backref_cache_cleanup()503 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()895 for (; level < BTRFS_MAX_LEVEL; level++) { in build_backref_tree()1954 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in walk_up_reloc_tree()2105 while (level < BTRFS_MAX_LEVEL) { in find_next_key()2175 min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in merge_reloc_root()2289 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in prepare_to_merge()[all …]
144 # if BTRFS_MAX_LEVEL != 8151 char names[BTRFS_MAX_LEVEL + 1][20];152 struct lock_class_key keys[BTRFS_MAX_LEVEL + 1];624 if (found_level >= BTRFS_MAX_LEVEL) { in btree_readpage_end_io_hook()2423 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()2425 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()2428 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()2430 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()2433 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()2435 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
54 #define BTRFS_MAX_LEVEL 8 macro327 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];328 int slots[BTRFS_MAX_LEVEL];330 u8 locks[BTRFS_MAX_LEVEL];2597 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_trans_metadata_size()2607 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_trunc_metadata_size()
752 BTRFS_MAX_LEVEL + 3, 1); in btrfsic_process_superblock()2320 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_check_all_ref_blocks()2424 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_is_block_ref_by_superblock()
605 for (l = 0; l < BTRFS_MAX_LEVEL; l++) { in walk_up_tree()
2607 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()2613 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()2690 WARN_ON(*level >= BTRFS_MAX_LEVEL); in walk_down_log_tree()2709 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { in walk_up_log_tree()
1725 BUG_ON(root_level < 0 || root_level >= BTRFS_MAX_LEVEL); in btrfs_qgroup_trace_subtree()2631 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in is_last_leaf()
1442 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()8317 u64 refs[BTRFS_MAX_LEVEL];8318 u64 flags[BTRFS_MAX_LEVEL];8973 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
