Home
last modified time | relevance | path

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

/Linux-v5.4/fs/btrfs/
Dtree-defrag.c83 path->lowest_level = 1; in btrfs_defrag_leaves()
Dctree.c2746 u8 lowest_level = 0; in btrfs_search_slot() local
2750 lowest_level = p->lowest_level; in btrfs_search_slot()
2751 WARN_ON(lowest_level && ins_len > 0); in btrfs_search_slot()
2774 if (cow && (p->keep_locks || p->lowest_level)) in btrfs_search_slot()
2898 if (level == lowest_level) { in btrfs_search_slot()
2990 u8 lowest_level = 0; in btrfs_search_old_slot() local
2993 lowest_level = p->lowest_level; in btrfs_search_old_slot()
3040 if (level == lowest_level) { in btrfs_search_old_slot()
5192 if (level == path->lowest_level) { in btrfs_search_forward()
5236 if (level == path->lowest_level) { in btrfs_search_forward()
[all …]
Drelocation.c882 path2->lowest_level = level; in build_backref_tree()
884 path2->lowest_level = 0; in build_backref_tree()
1770 int lowest_level, int max_level) in replace_path() argument
1793 slot = path->slots[lowest_level]; in replace_path()
1794 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); in replace_path()
1800 if (level < lowest_level) { in replace_path()
1823 BUG_ON(level < lowest_level); in replace_path()
1857 if (level <= lowest_level) { in replace_path()
1898 path->lowest_level = level; in replace_path()
1900 path->lowest_level = 0; in replace_path()
[all …]
Dbackref.c548 path->lowest_level = level; in resolve_indirect_ref()
580 path->lowest_level = 0; in resolve_indirect_ref()
Dctree.h353 u8 lowest_level; member
2523 struct btrfs_key *key, int lowest_level,
Dextent-tree.c5242 path->lowest_level = level; in btrfs_drop_snapshot()
5244 path->lowest_level = 0; in btrfs_drop_snapshot()