Home
last modified time | relevance | path

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

/linux-4.19.296/fs/btrfs/
Dtree-defrag.c83 path->lowest_level = 1; in btrfs_defrag_leaves()
Dctree.c2802 u8 lowest_level = 0; in btrfs_search_slot() local
2806 lowest_level = p->lowest_level; in btrfs_search_slot()
2807 WARN_ON(lowest_level && ins_len > 0); in btrfs_search_slot()
2830 if (cow && (p->keep_locks || p->lowest_level)) in btrfs_search_slot()
2951 if (level == lowest_level) { in btrfs_search_slot()
3050 u8 lowest_level = 0; in btrfs_search_old_slot() local
3053 lowest_level = p->lowest_level; in btrfs_search_old_slot()
3099 if (level == lowest_level) { in btrfs_search_old_slot()
5276 if (level == path->lowest_level) { in btrfs_search_forward()
5320 if (level == path->lowest_level) { in btrfs_search_forward()
[all …]
Drelocation.c872 path2->lowest_level = level; in build_backref_tree()
874 path2->lowest_level = 0; in build_backref_tree()
1741 int lowest_level, int max_level) in replace_path() argument
1763 slot = path->slots[lowest_level]; in replace_path()
1764 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); in replace_path()
1770 if (level < lowest_level) { in replace_path()
1793 ASSERT(level >= lowest_level); in replace_path()
1825 if (level <= lowest_level) { in replace_path()
1866 path->lowest_level = level; in replace_path()
1868 path->lowest_level = 0; in replace_path()
[all …]
Dbackref.c547 path->lowest_level = level; in resolve_indirect_ref()
579 path->lowest_level = 0; in resolve_indirect_ref()
Dctree.h334 u8 lowest_level; member
2832 struct btrfs_key *key, int lowest_level,
Dextent-tree.c8955 path->lowest_level = level; in btrfs_drop_snapshot()
8957 path->lowest_level = 0; in btrfs_drop_snapshot()