| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | tree-defrag.c | 80 * leafs from path->nodes[1], so set lowest_level to 1 to avoid later in btrfs_defrag_leaves()
83 path->lowest_level = 1; in btrfs_defrag_leaves()
96 * keep_locks set and lowest_level is 1, regardless of the value of in btrfs_defrag_leaves()
|
| H A D | relocation.c | 1190 int lowest_level, int max_level) in replace_path()
1213 slot = path->slots[lowest_level]; in replace_path()
1214 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); in replace_path()
1220 if (level < lowest_level) { in replace_path()
1244 ASSERT(level >= lowest_level); in replace_path()
1278 if (level <= lowest_level) { in replace_path()
1320 path->lowest_level = level; in replace_path()
1322 path->lowest_level = 0; in replace_path()
1695 path->lowest_level = level; in merge_reloc_root()
1697 path->lowest_level in merge_reloc_root()
1187 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) replace_path() argument
[all...] |
| H A D | ctree.c | 2719 u8 lowest_level = 0; in btrfs_search_slot() local
2723 lowest_level = p->lowest_level; in btrfs_search_slot()
2724 WARN_ON(lowest_level && ins_len > 0); in btrfs_search_slot()
2747 if (cow && (p->keep_locks || p->lowest_level)) in btrfs_search_slot()
2906 if (level == lowest_level) { in btrfs_search_slot()
2973 u8 lowest_level = 0; in btrfs_search_old_slot() local
2975 lowest_level = p->lowest_level; in btrfs_search_old_slot()
3023 if (level == lowest_level) { in btrfs_search_old_slot()
[all...] |
| H A D | backref.c | 614 path->lowest_level = level; in resolve_indirect_ref()
643 path->lowest_level = 0; in resolve_indirect_ref()
2797 path->lowest_level = level;
2799 path->lowest_level = 0;
|
| H A D | ctree.h | 364 u8 lowest_level; member
2703 struct btrfs_key *key, int lowest_level,
|
| H A D | extent-tree.c | 5425 path->lowest_level = level; in btrfs_drop_snapshot()
5427 path->lowest_level = 0; in btrfs_drop_snapshot()
|
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | relocation.c | 1214 int lowest_level, int max_level) in replace_path()
1237 slot = path->slots[lowest_level]; in replace_path()
1238 btrfs_node_key_to_cpu(path->nodes[lowest_level], &key, slot); in replace_path()
1243 if (level < lowest_level) { in replace_path()
1268 ASSERT(level >= lowest_level); in replace_path()
1301 if (level <= lowest_level) { in replace_path()
1341 path->lowest_level = level; in replace_path()
1345 path->lowest_level = 0; in replace_path()
1729 path->lowest_level = level; in merge_reloc_root()
1731 path->lowest_level in merge_reloc_root()
1211 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) replace_path() argument
[all...] |
| H A D | ctree.c | 1921 const int i = path->lowest_level; in finish_need_commit_sem_search()
2137 u8 lowest_level = 0; in btrfs_search_slot() local
2143 lowest_level = p->lowest_level; in btrfs_search_slot()
2144 WARN_ON(lowest_level && ins_len > 0); in btrfs_search_slot()
2174 if (cow && (p->keep_locks || p->lowest_level)) in btrfs_search_slot()
2309 if (level == lowest_level) { in btrfs_search_slot()
2385 u8 lowest_level = 0; in btrfs_search_old_slot() local
2387 lowest_level = p->lowest_level; in btrfs_search_old_slot()
[all...] |
| H A D | ctree.h | 93 u8 lowest_level; member
526 struct btrfs_key *key, int lowest_level,
|
| H A D | backref.c | 666 path->lowest_level = level; in resolve_indirect_ref()
694 path->lowest_level = 0; in resolve_indirect_ref()
3256 path->lowest_level = level; in handle_indirect_tree_backref()
3258 path->lowest_level = 0; in handle_indirect_tree_backref()
|
| H A D | defrag.c | 400 * leafs from path->nodes[1], so set lowest_level to 1 to avoid later in btrfs_defrag_leaves()
403 path->lowest_level = 1; in btrfs_defrag_leaves()
416 * keep_locks set and lowest_level is 1, regardless of the value of in btrfs_defrag_leaves()
|
| H A D | send.c | 7321 btrfs_print_tree(path->nodes[path->lowest_level], false); in search_key_again()
7323 "send: key (%llu %u %llu) not found in %s root %llu, lowest_level %d, slot %d", in search_key_again()
7326 root->root_key.objectid, path->lowest_level, in search_key_again()
7327 path->slots[path->lowest_level]); in search_key_again()
7591 left_path->lowest_level = left_level; in restart_after_relocation()
7596 right_path->lowest_level = right_level; in restart_after_relocation()
|
| H A D | extent-tree.c | 5705 path->lowest_level = level; in btrfs_drop_snapshot()
5707 path->lowest_level = 0; in btrfs_drop_snapshot()
|