Home
last modified time | relevance | path

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

/fs/btrfs/
Dtree-defrag.c83 path->lowest_level = 1; in btrfs_defrag_leaves()
Dctree.c2788 u8 lowest_level = 0; in btrfs_search_slot() local
2792 lowest_level = p->lowest_level; in btrfs_search_slot()
2793 WARN_ON(lowest_level && ins_len > 0); in btrfs_search_slot()
2816 if (cow && (p->keep_locks || p->lowest_level)) in btrfs_search_slot()
2940 if (level == lowest_level) { in btrfs_search_slot()
3032 u8 lowest_level = 0; in btrfs_search_old_slot() local
3035 lowest_level = p->lowest_level; in btrfs_search_old_slot()
3082 if (level == lowest_level) { in btrfs_search_old_slot()
5266 if (level == path->lowest_level) { in btrfs_search_forward()
5310 if (level == path->lowest_level) { in btrfs_search_forward()
[all …]
Drelocation.c914 path2->lowest_level = level; in build_backref_tree()
916 path2->lowest_level = 0; in build_backref_tree()
1821 int lowest_level, int max_level) in replace_path() argument
1844 slot = path->slots[lowest_level]; in replace_path()
1845 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); in replace_path()
1851 if (level < lowest_level) { in replace_path()
1874 ASSERT(level >= lowest_level); in replace_path()
1908 if (level <= lowest_level) { in replace_path()
1949 path->lowest_level = level; in replace_path()
1951 path->lowest_level = 0; in replace_path()
[all …]
Dbackref.c608 path->lowest_level = level; in resolve_indirect_ref()
638 path->lowest_level = 0; in resolve_indirect_ref()
Dctree.h353 u8 lowest_level; member
2528 struct btrfs_key *key, int lowest_level,
Dextent-tree.c5309 path->lowest_level = level; in btrfs_drop_snapshot()
5311 path->lowest_level = 0; in btrfs_drop_snapshot()