Home
last modified time | relevance | path

Searched refs:lowest_level (Results 1 – 6 of 6) sorted by relevance

/OK3568_Linux_fs/kernel/fs/btrfs/
H A Dtree-defrag.c83 path->lowest_level = 1; in btrfs_defrag_leaves()
H A Drelocation.c1190 int lowest_level, int max_level) in replace_path() argument
1213 slot = path->slots[lowest_level]; in replace_path()
1214 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); in replace_path()
1220 if (level < lowest_level) { in replace_path()
1244 ASSERT(level >= lowest_level); in replace_path()
1278 if (level <= lowest_level) { in replace_path()
1320 path->lowest_level = level; in replace_path()
1322 path->lowest_level = 0; in replace_path()
1695 path->lowest_level = level; in merge_reloc_root()
1697 path->lowest_level = 0; in merge_reloc_root()
[all …]
H A Dctree.c2719 u8 lowest_level = 0; in btrfs_search_slot() local
2723 lowest_level = p->lowest_level; in btrfs_search_slot()
2724 WARN_ON(lowest_level && ins_len > 0); in btrfs_search_slot()
2747 if (cow && (p->keep_locks || p->lowest_level)) in btrfs_search_slot()
2906 if (level == lowest_level) { in btrfs_search_slot()
2973 u8 lowest_level = 0; in btrfs_search_old_slot() local
2975 lowest_level = p->lowest_level; in btrfs_search_old_slot()
3023 if (level == lowest_level) { in btrfs_search_old_slot()
5256 if (level == path->lowest_level) { in btrfs_search_forward()
5300 if (level == path->lowest_level) { in btrfs_search_forward()
[all …]
H A Dbackref.c610 path->lowest_level = level; in resolve_indirect_ref()
639 path->lowest_level = 0; in resolve_indirect_ref()
2793 path->lowest_level = level;
2795 path->lowest_level = 0;
H A Dctree.h364 u8 lowest_level; member
2705 struct btrfs_key *key, int lowest_level,
H A Dextent-tree.c5413 path->lowest_level = level; in btrfs_drop_snapshot()
5415 path->lowest_level = 0; in btrfs_drop_snapshot()