Searched refs:lowest_unlock (Results 1 - 2 of 2) sorted by relevance
| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | ctree.c | 2337 * lowest_unlock sets the lowest level in the tree we're allowed to unlock. so
2338 * if lowest_unlock is 1, level 0 won't be unlocked
2341 int lowest_unlock, int min_write_lock_level, in unlock_up()
2367 if (skip_level < i && i >= lowest_unlock) in unlock_up()
2371 if (i >= lowest_unlock && i > skip_level) { in unlock_up()
2716 int lowest_unlock = 1; in btrfs_search_slot() local
2729 lowest_unlock = 2; in btrfs_search_slot()
2872 unlock_up(p, level, lowest_unlock, in btrfs_search_slot()
2903 unlock_up(p, level, lowest_unlock, min_write_lock_level, in btrfs_search_slot()
2972 int lowest_unlock in btrfs_search_old_slot() local
2340 unlock_up(struct btrfs_path *path, int level, int lowest_unlock, int min_write_lock_level, int *write_lock_level) unlock_up() argument
[all...] |
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | ctree.c | 1563 * lowest_unlock sets the lowest level in the tree we're allowed to unlock. so
1564 * if lowest_unlock is 1, level 0 won't be unlocked
1567 int lowest_unlock, int min_write_lock_level, in unlock_up()
1597 if (i >= lowest_unlock && i > skip_level) { in unlock_up()
2134 int lowest_unlock = 1; in btrfs_search_slot() local
2156 lowest_unlock = 2; in btrfs_search_slot()
2269 unlock_up(p, level, lowest_unlock, in btrfs_search_slot()
2306 unlock_up(p, level, lowest_unlock, min_write_lock_level, in btrfs_search_slot()
2384 int lowest_unlock = 1; in btrfs_search_old_slot() local
2425 unlock_up(p, level, lowest_unlock, in btrfs_search_old_slot()
1566 unlock_up(struct btrfs_path *path, int level, int lowest_unlock, int min_write_lock_level, int *write_lock_level) unlock_up() argument
[all...] |
Completed in 10 milliseconds