BTRFS_MAX_LEVEL 751 fs/btrfs/check-integrity.c BTRFS_MAX_LEVEL + 3, 1); BTRFS_MAX_LEVEL 2323 fs/btrfs/check-integrity.c if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 2427 fs/btrfs/check-integrity.c if (recursion_level >= 3 + BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 66 fs/btrfs/ctree.c for (i = 0; i < BTRFS_MAX_LEVEL; i++) { BTRFS_MAX_LEVEL 103 fs/btrfs/ctree.c for (i = 0; i < BTRFS_MAX_LEVEL; i++) { BTRFS_MAX_LEVEL 1867 fs/btrfs/ctree.c if (level < BTRFS_MAX_LEVEL - 1) { BTRFS_MAX_LEVEL 2090 fs/btrfs/ctree.c if (level < BTRFS_MAX_LEVEL - 1) { BTRFS_MAX_LEVEL 2343 fs/btrfs/ctree.c for (i = level; i < BTRFS_MAX_LEVEL; i++) { BTRFS_MAX_LEVEL 2393 fs/btrfs/ctree.c for (i = level; i < BTRFS_MAX_LEVEL; i++) { BTRFS_MAX_LEVEL 2673 fs/btrfs/ctree.c if (write_lock_level < BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 2771 fs/btrfs/ctree.c write_lock_level = BTRFS_MAX_LEVEL; BTRFS_MAX_LEVEL 2791 fs/btrfs/ctree.c bool last_level = (level == (BTRFS_MAX_LEVEL - 1)); BTRFS_MAX_LEVEL 2809 fs/btrfs/ctree.c level + 1 < BTRFS_MAX_LEVEL && BTRFS_MAX_LEVEL 2850 fs/btrfs/ctree.c if (u < BTRFS_MAX_LEVEL && p->locks[u]) { BTRFS_MAX_LEVEL 3171 fs/btrfs/ctree.c for (i = level; i < BTRFS_MAX_LEVEL; i++) { BTRFS_MAX_LEVEL 5277 fs/btrfs/ctree.c while (level < BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 5288 fs/btrfs/ctree.c if (level + 1 >= BTRFS_MAX_LEVEL || BTRFS_MAX_LEVEL 5413 fs/btrfs/ctree.c while (level < BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 5423 fs/btrfs/ctree.c if (level == BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 347 fs/btrfs/ctree.h struct extent_buffer *nodes[BTRFS_MAX_LEVEL]; BTRFS_MAX_LEVEL 348 fs/btrfs/ctree.h int slots[BTRFS_MAX_LEVEL]; BTRFS_MAX_LEVEL 350 fs/btrfs/ctree.h u8 locks[BTRFS_MAX_LEVEL]; BTRFS_MAX_LEVEL 953 fs/btrfs/ctree.h struct rb_root blocks[BTRFS_MAX_LEVEL]; BTRFS_MAX_LEVEL 2383 fs/btrfs/ctree.h return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items; BTRFS_MAX_LEVEL 2393 fs/btrfs/ctree.h return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items; BTRFS_MAX_LEVEL 143 fs/btrfs/disk-io.c # if BTRFS_MAX_LEVEL != 8 BTRFS_MAX_LEVEL 150 fs/btrfs/disk-io.c char names[BTRFS_MAX_LEVEL + 1][20]; BTRFS_MAX_LEVEL 151 fs/btrfs/disk-io.c struct lock_class_key keys[BTRFS_MAX_LEVEL + 1]; BTRFS_MAX_LEVEL 637 fs/btrfs/disk-io.c if (found_level >= BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 2400 fs/btrfs/disk-io.c if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 2402 fs/btrfs/disk-io.c btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); BTRFS_MAX_LEVEL 2405 fs/btrfs/disk-io.c if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 2407 fs/btrfs/disk-io.c btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); BTRFS_MAX_LEVEL 2410 fs/btrfs/disk-io.c if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 2412 fs/btrfs/disk-io.c btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); BTRFS_MAX_LEVEL 787 fs/btrfs/extent-tree.c for (; level < BTRFS_MAX_LEVEL; level++) { BTRFS_MAX_LEVEL 4577 fs/btrfs/extent-tree.c u64 refs[BTRFS_MAX_LEVEL]; BTRFS_MAX_LEVEL 4578 fs/btrfs/extent-tree.c u64 flags[BTRFS_MAX_LEVEL]; BTRFS_MAX_LEVEL 5318 fs/btrfs/extent-tree.c ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL); BTRFS_MAX_LEVEL 1937 fs/btrfs/qgroup.c if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 || BTRFS_MAX_LEVEL 1938 fs/btrfs/qgroup.c root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 || BTRFS_MAX_LEVEL 2100 fs/btrfs/qgroup.c BUG_ON(root_level < 0 || root_level >= BTRFS_MAX_LEVEL); BTRFS_MAX_LEVEL 3038 fs/btrfs/qgroup.c for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { BTRFS_MAX_LEVEL 3791 fs/btrfs/qgroup.c for (i = 0; i < BTRFS_MAX_LEVEL; i++) BTRFS_MAX_LEVEL 3812 fs/btrfs/qgroup.c for (i = 0; i < BTRFS_MAX_LEVEL; i++) { BTRFS_MAX_LEVEL 3991 fs/btrfs/qgroup.c for (i = 0; i < BTRFS_MAX_LEVEL; i++) { BTRFS_MAX_LEVEL 595 fs/btrfs/ref-verify.c for (l = 0; l < BTRFS_MAX_LEVEL; l++) { BTRFS_MAX_LEVEL 94 fs/btrfs/relocation.c struct backref_node *path[BTRFS_MAX_LEVEL]; BTRFS_MAX_LEVEL 100 fs/btrfs/relocation.c struct list_head pending[BTRFS_MAX_LEVEL]; BTRFS_MAX_LEVEL 204 fs/btrfs/relocation.c for (i = 0; i < BTRFS_MAX_LEVEL; i++) BTRFS_MAX_LEVEL 230 fs/btrfs/relocation.c for (i = 0; i < BTRFS_MAX_LEVEL; i++) BTRFS_MAX_LEVEL 507 fs/btrfs/relocation.c for (level = 0; level < BTRFS_MAX_LEVEL; level++) { BTRFS_MAX_LEVEL 940 fs/btrfs/relocation.c for (; level < BTRFS_MAX_LEVEL; level++) { BTRFS_MAX_LEVEL 2030 fs/btrfs/relocation.c for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) { BTRFS_MAX_LEVEL 2181 fs/btrfs/relocation.c while (level < BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 2315 fs/btrfs/relocation.c min_reserved = fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; BTRFS_MAX_LEVEL 2424 fs/btrfs/relocation.c rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2; BTRFS_MAX_LEVEL 2680 fs/btrfs/relocation.c struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; BTRFS_MAX_LEVEL 2717 fs/btrfs/relocation.c struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; BTRFS_MAX_LEVEL 2801 fs/btrfs/relocation.c struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; BTRFS_MAX_LEVEL 2976 fs/btrfs/relocation.c for (level = 0; level < BTRFS_MAX_LEVEL; level++) { BTRFS_MAX_LEVEL 3022 fs/btrfs/relocation.c struct backref_edge *edges[BTRFS_MAX_LEVEL - 1]; BTRFS_MAX_LEVEL 896 fs/btrfs/tree-checker.c if (btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 899 fs/btrfs/tree-checker.c btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1); BTRFS_MAX_LEVEL 902 fs/btrfs/tree-checker.c if (ri.drop_level >= BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 905 fs/btrfs/tree-checker.c ri.drop_level, BTRFS_MAX_LEVEL - 1); BTRFS_MAX_LEVEL 980 fs/btrfs/tree-checker.c key->offset >= BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 983 fs/btrfs/tree-checker.c key->offset, BTRFS_MAX_LEVEL - 1); BTRFS_MAX_LEVEL 1065 fs/btrfs/tree-checker.c if (btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 1069 fs/btrfs/tree-checker.c BTRFS_MAX_LEVEL - 1); BTRFS_MAX_LEVEL 1455 fs/btrfs/tree-checker.c if (level <= 0 || level >= BTRFS_MAX_LEVEL) { BTRFS_MAX_LEVEL 1458 fs/btrfs/tree-checker.c level, BTRFS_MAX_LEVEL - 1); BTRFS_MAX_LEVEL 2696 fs/btrfs/tree-log.c WARN_ON(*level >= BTRFS_MAX_LEVEL); BTRFS_MAX_LEVEL 2702 fs/btrfs/tree-log.c WARN_ON(*level >= BTRFS_MAX_LEVEL); BTRFS_MAX_LEVEL 2779 fs/btrfs/tree-log.c WARN_ON(*level >= BTRFS_MAX_LEVEL); BTRFS_MAX_LEVEL 2798 fs/btrfs/tree-log.c for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) {