Searched refs:BTRFS_MAX_LEVEL (Results 1 - 15 of 15) sorted by relevance

/linux-master/fs/btrfs/
H A Dlocking.c37 * same as our lockdep setup here. If BTRFS_MAX_LEVEL changes, this code
41 #if BTRFS_MAX_LEVEL != 8
61 char names[BTRFS_MAX_LEVEL][24];
62 struct lock_class_key keys[BTRFS_MAX_LEVEL];
245 for (i = level; i < BTRFS_MAX_LEVEL; i++) {
H A Dbackref.h184 struct btrfs_backref_shared_cache_entry path_cache_entries[BTRFS_MAX_LEVEL];
388 struct btrfs_backref_node *path[BTRFS_MAX_LEVEL];
393 struct list_head pending[BTRFS_MAX_LEVEL];
H A Dctree.h52 * level 0 is always the leaf, and nodes[1...BTRFS_MAX_LEVEL] will point
59 struct extent_buffer *nodes[BTRFS_MAX_LEVEL];
60 int slots[BTRFS_MAX_LEVEL];
62 u8 locks[BTRFS_MAX_LEVEL];
157 struct rb_root blocks[BTRFS_MAX_LEVEL];
H A Dtree-checker.c1219 if (unlikely(btrfs_root_level(&ri) >= BTRFS_MAX_LEVEL)) {
1222 btrfs_root_level(&ri), BTRFS_MAX_LEVEL - 1);
1225 if (unlikely(btrfs_root_drop_level(&ri) >= BTRFS_MAX_LEVEL)) {
1228 btrfs_root_drop_level(&ri), BTRFS_MAX_LEVEL - 1);
1307 key->offset >= BTRFS_MAX_LEVEL)) {
1310 key->offset, BTRFS_MAX_LEVEL - 1);
1410 if (unlikely(btrfs_tree_block_level(leaf, info) >= BTRFS_MAX_LEVEL)) {
1414 BTRFS_MAX_LEVEL - 1);
1960 if (unlikely(level <= 0 || level >= BTRFS_MAX_LEVEL)) {
1963 level, BTRFS_MAX_LEVEL
[all...]
H A Dctree.c215 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
938 if (level < BTRFS_MAX_LEVEL - 1) {
1192 if (level < BTRFS_MAX_LEVEL - 1) {
1447 for (i = level; i < BTRFS_MAX_LEVEL; i++) {
1506 unlock_up = ((level + 1 < BTRFS_MAX_LEVEL) && p->locks[level + 1]);
1732 if (write_lock_level < BTRFS_MAX_LEVEL) {
2048 write_lock_level = BTRFS_MAX_LEVEL;
2076 bool last_level = (level == (BTRFS_MAX_LEVEL - 1));
2092 level + 1 < BTRFS_MAX_LEVEL &&
2130 if (u < BTRFS_MAX_LEVEL
[all...]
H A Dfs.h933 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * 2 * num_items;
943 return (u64)fs_info->nodesize * BTRFS_MAX_LEVEL * num_items;
H A Drelocation.c285 for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
1452 for (i = *level; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
1594 while (level < BTRFS_MAX_LEVEL) {
1869 rc->merging_rsv_size += fs_info->nodesize * (BTRFS_MAX_LEVEL - 1) * 2;
2283 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2326 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2409 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
2581 for (level = 0; level < BTRFS_MAX_LEVEL; level++) {
2608 struct btrfs_backref_edge *edges[BTRFS_MAX_LEVEL - 1];
H A Ddisk-io.c388 if (found_level >= BTRFS_MAX_LEVEL) {
1970 fs_info->qgroup_drop_subtree_thres = BTRFS_MAX_LEVEL;
2365 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) {
2367 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL);
2370 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) {
2372 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL);
2375 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) {
2377 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL);
H A Dqgroup.c1407 fs_info->qgroup_drop_subtree_thres = BTRFS_MAX_LEVEL;
2344 if (cur_level < 0 || cur_level >= BTRFS_MAX_LEVEL - 1 ||
2345 root_level < 0 || root_level >= BTRFS_MAX_LEVEL - 1 ||
2508 ASSERT(0 <= root_level && root_level < BTRFS_MAX_LEVEL);
3589 for (i = 1; i < BTRFS_MAX_LEVEL && path->nodes[i]; i++) {
4539 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
4560 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
4739 for (i = 0; i < BTRFS_MAX_LEVEL; i++) {
H A Dbackref.c1263 if (WARN_ON_ONCE(level >= BTRFS_MAX_LEVEL))
1334 if (WARN_ON_ONCE(level >= BTRFS_MAX_LEVEL))
2017 for ( ; i < BTRFS_MAX_LEVEL; i++)
3034 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
3050 ASSERT(level >= 0 && level < BTRFS_MAX_LEVEL);
3196 for (i = 0; i < BTRFS_MAX_LEVEL; i++)
3379 for (; level < BTRFS_MAX_LEVEL; level++) {
H A Dref-verify.c591 for (l = 0; l < BTRFS_MAX_LEVEL; l++) {
H A Dextent-tree.c750 for (; level < BTRFS_MAX_LEVEL; level++) {
5233 u64 refs[BTRFS_MAX_LEVEL];
5234 u64 flags[BTRFS_MAX_LEVEL];
5981 ret = walk_up_tree(trans, root, path, wc, BTRFS_MAX_LEVEL);
H A Dsysfs.c2229 if (new_thres > BTRFS_MAX_LEVEL)
H A Dtree-log.c2672 for (i = *level; i < BTRFS_MAX_LEVEL - 1 && path->nodes[i]; i++) {
/linux-master/include/uapi/linux/
H A Dbtrfs_tree.h16 #define BTRFS_MAX_LEVEL 8 macro

Completed in 277 milliseconds