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 | 1791 const int i = path->lowest_level; 2007 u8 lowest_level = 0; local 2013 lowest_level = p->lowest_level; 2014 WARN_ON(lowest_level && ins_len > 0); 2044 if (cow && (p->keep_locks || p->lowest_level)) 2179 if (level == lowest_level) { 2255 u8 lowest_level = 0; local 2257 lowest_level = p->lowest_level; [all...] |
H A D | relocation.c | 1161 int lowest_level, int max_level) 1184 slot = path->slots[lowest_level]; 1185 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); 1190 if (level < lowest_level) { 1215 ASSERT(level >= lowest_level); 1248 if (level <= lowest_level) { 1288 path->lowest_level = level; 1292 path->lowest_level = 0; 1692 path->lowest_level = level; 1694 path->lowest_level 1158 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; 3344 path->lowest_level = level; 3346 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 btrfs_root_id(root), 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 | 5899 path->lowest_level = level; 5901 path->lowest_level = 0;
|
Completed in 297 milliseconds