Home
last modified time | relevance | path

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

/linux/fs/btrfs/
A Dtree-checker.c1149 if (unlikely(btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1152 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1155 if (unlikely(btrfs_root_drop_level(&ri) >= BTRFS_MAX_LEVEL)) { in check_root_item()
1158 btrfs_root_drop_level(&ri), BTRFS_MAX_LEVEL - 1); in check_root_item()
1233 key->offset >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1236 key->offset, BTRFS_MAX_LEVEL - 1); in check_extent_item()
1324 if (unlikely(btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL)) { in check_extent_item()
1328 BTRFS_MAX_LEVEL - 1); in check_extent_item()
1766 if (unlikely(level <= 0 || level >= BTRFS_MAX_LEVEL)) { in btrfs_check_node()
1769 level, BTRFS_MAX_LEVEL - 1); in btrfs_check_node()
A Dbackref.h238 struct btrfs_backref_node *path[BTRFS_MAX_LEVEL];
243 struct list_head pending[BTRFS_MAX_LEVEL];
A Dctree.c102 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_release_path()
883 if (level < BTRFS_MAX_LEVEL - 1) { in balance_level()
1107 if (level < BTRFS_MAX_LEVEL - 1) { in push_nodes_for_insert()
1352 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in unlock_up()
1620 if (write_lock_level < BTRFS_MAX_LEVEL) { in btrfs_search_slot_get_root()
1724 write_lock_level = BTRFS_MAX_LEVEL; in btrfs_search_slot()
1758 level + 1 < BTRFS_MAX_LEVEL && in btrfs_search_slot()
4341 while (level < BTRFS_MAX_LEVEL) { in btrfs_find_next_key()
4352 if (level + 1 >= BTRFS_MAX_LEVEL || in btrfs_find_next_key()
4464 while (level < BTRFS_MAX_LEVEL) { in btrfs_next_old_leaf()
[all …]
A Dlocking.c148 for (i = level; i < BTRFS_MAX_LEVEL; i++) { in btrfs_unlock_up_safe()
A Drelocation.c279 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in update_backref_cache()
1437 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in walk_up_reloc_tree()
1577 while (level < BTRFS_MAX_LEVEL) { in find_next_key()
1851 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; in prepare_to_merge()
2236 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in select_one_root()
2279 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in calcu_metadata_size()
2362 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in do_relocation()
2533 for (level = 0; level < BTRFS_MAX_LEVEL; level++) { in finish_pending_nodes()
2560 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1]; in update_processed_blocks()
A Ddisk-io.c148 # if BTRFS_MAX_LEVEL != 8
168 char names[BTRFS_MAX_LEVEL][20];
169 struct lock_class_key keys[BTRFS_MAX_LEVEL];
588 if (found_level >= BTRFS_MAX_LEVEL) { in validate_extent_buffer()
2575 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
2577 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
2580 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
2582 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
2585 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { in validate_super()
2587 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); in validate_super()
A Dctree.h66 #define BTRFS_MAX_LEVEL 8 macro
384 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
385 int slots[BTRFS_MAX_LEVEL];
387 u8 locks[BTRFS_MAX_LEVEL];
1123 struct rb_root blocks[BTRFS_MAX_LEVEL];
2687 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; in btrfs_calc_insert_metadata_size()
2697 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; in btrfs_calc_metadata_size()
A Dqgroup.c2076 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2077 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 || in qgroup_trace_new_subtree_blocks()
2229 BUG_ON(root_level < 0 || root_level >= BTRFS_MAX_LEVEL); in btrfs_qgroup_trace_subtree()
3130 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { in is_last_leaf()
4026 for (i = 0; i < BTRFS_MAX_LEVEL; i++) in btrfs_qgroup_init_swapped_blocks()
4047 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_clean_swapped_blocks()
4226 for (i = 0; i < BTRFS_MAX_LEVEL; i++) { in btrfs_qgroup_trace_subtree_after_cow()
A Dbackref.c2483 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
2499 ASSERT(level >= 0 && level < BTRFS_MAX_LEVEL);
2586 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
2754 for (; level < BTRFS_MAX_LEVEL; level++) {
A Dcheck-integrity.c688 BTRFS_MAX_LEVEL + 3, 1); in btrfsic_process_superblock()
2223 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_check_all_ref_blocks()
2333 if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { in btrfsic_is_block_ref_by_superblock()
A Dref-verify.c585 for (l = 0; l < BTRFS_MAX_LEVEL; l++) { in walk_up_tree()
A Dextent-tree.c751 for (; level < BTRFS_MAX_LEVEL; level++) { in find_next_key()
4957 u64 refs[BTRFS_MAX_LEVEL];
4958 u64 flags[BTRFS_MAX_LEVEL];
5693 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); in btrfs_drop_snapshot()
A Dtree-log.c2883 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) { in walk_up_log_tree()

Completed in 79 milliseconds