Searched refs:lowest_level (Results 1 - 7 of 7) sorted by relevance
/linux-master/fs/btrfs/ |
H A D | ctree.h | 65 u8 lowest_level; member in struct:btrfs_path 533 struct btrfs_key *key, int lowest_level,
|
H A D | ctree.c | 1794 const int i = path->lowest_level; 2010 u8 lowest_level = 0; local 2016 lowest_level = p->lowest_level; 2017 WARN_ON(lowest_level && ins_len > 0); 2047 if (cow && (p->keep_locks || p->lowest_level)) 2182 if (level == lowest_level) { 2258 u8 lowest_level = 0; local 2260 lowest_level = p->lowest_level; [all...] |
H A D | relocation.c | 1210 int lowest_level, int max_level) 1233 slot = path->slots[lowest_level]; 1234 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 1239 if (level < lowest_level) { 1264 ASSERT(level >= lowest_level); 1297 if (level <= lowest_level) { 1337 path->lowest_level = level; 1341 path->lowest_level = 0; 1728 path->lowest_level = level; 1730 path->lowest_level 1207 replace_path(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_root *dest, struct btrfs_root *src, struct btrfs_path *path, struct btrfs_key *next_key, int lowest_level, int max_level) argument [all...] |
H A D | backref.c | 663 path->lowest_level = level; 691 path->lowest_level = 0; 3356 path->lowest_level = level; 3358 path->lowest_level = 0;
|
H A D | defrag.c | 504 * leafs from path->nodes[1], so set lowest_level to 1 to avoid later 507 path->lowest_level = 1; 520 * keep_locks set and lowest_level is 1, regardless of the value of
|
H A D | send.c | 7335 btrfs_print_tree(path->nodes[path->lowest_level], false); 7337 "send: key (%llu %u %llu) not found in %s root %llu, lowest_level %d, slot %d", 7340 root->root_key.objectid, path->lowest_level, 7341 path->slots[path->lowest_level]); 7605 left_path->lowest_level = left_level; 7610 right_path->lowest_level = right_level;
|
H A D | extent-tree.c | 5924 path->lowest_level = level; 5926 path->lowest_level = 0;
|
Completed in 421 milliseconds