Home
last modified time | relevance | path

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

/linux-4.1.27/fs/btrfs/
Dctree.c2677 u8 lowest_level = 0; in btrfs_search_slot() local
2681 lowest_level = p->lowest_level; in btrfs_search_slot()
2682 WARN_ON(lowest_level && ins_len > 0); in btrfs_search_slot()
2705 if (cow && (p->keep_locks || p->lowest_level)) in btrfs_search_slot()
2855 if (level == lowest_level) { in btrfs_search_slot()
2953 u8 lowest_level = 0; in btrfs_search_old_slot() local
2956 lowest_level = p->lowest_level; in btrfs_search_old_slot()
2998 if (level == lowest_level) { in btrfs_search_old_slot()
5146 if (level == path->lowest_level) { in btrfs_search_forward()
5190 if (level == path->lowest_level) { in btrfs_search_forward()
[all …]
Drelocation.c913 path2->lowest_level = level;
915 path2->lowest_level = 0;
1764 int lowest_level, int max_level) argument
1785 slot = path->slots[lowest_level];
1786 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot);
1792 if (level < lowest_level) {
1813 BUG_ON(level < lowest_level);
1844 if (level <= lowest_level) {
1881 path->lowest_level = level;
1883 path->lowest_level = 0;
[all …]
Dbackref.c345 path->lowest_level = level; in __resolve_indirect_ref()
372 path->lowest_level = 0; in __resolve_indirect_ref()
Dctree.h600 int lowest_level; member
3533 struct btrfs_key *key, int lowest_level,
Dextent-tree.c8454 path->lowest_level = level; in btrfs_drop_snapshot()
8456 path->lowest_level = 0; in btrfs_drop_snapshot()