Lines Matching refs:path
98 static inline bool btree_path_pos_before_node(struct btree_path *path, in btree_path_pos_before_node() argument
101 return bpos_lt(path->pos, b->data->min_key); in btree_path_pos_before_node()
104 static inline bool btree_path_pos_after_node(struct btree_path *path, in btree_path_pos_after_node() argument
107 return bpos_gt(path->pos, b->key.k.p); in btree_path_pos_after_node()
110 static inline bool btree_path_pos_in_node(struct btree_path *path, in btree_path_pos_in_node() argument
113 return path->btree_id == b->c.btree_id && in btree_path_pos_in_node()
114 !btree_path_pos_before_node(path, b) && in btree_path_pos_in_node()
115 !btree_path_pos_after_node(path, b); in btree_path_pos_in_node()
121 struct btree_path *path) in __bch2_btree_path_verify_cached() argument
124 bool locked = btree_node_locked(path, 0); in __bch2_btree_path_verify_cached()
126 if (!bch2_btree_node_relock(trans, path, 0)) in __bch2_btree_path_verify_cached()
129 ck = (void *) path->l[0].b; in __bch2_btree_path_verify_cached()
130 BUG_ON(ck->key.btree_id != path->btree_id || in __bch2_btree_path_verify_cached()
131 !bkey_eq(ck->key.pos, path->pos)); in __bch2_btree_path_verify_cached()
134 btree_node_unlock(trans, path, 0); in __bch2_btree_path_verify_cached()
138 struct btree_path *path, unsigned level) in __bch2_btree_path_verify_level() argument
149 l = &path->l[level]; in __bch2_btree_path_verify_level()
151 locked = btree_node_locked(path, level); in __bch2_btree_path_verify_level()
153 if (path->cached) { in __bch2_btree_path_verify_level()
155 __bch2_btree_path_verify_cached(trans, path); in __bch2_btree_path_verify_level()
159 if (!btree_path_node(path, level)) in __bch2_btree_path_verify_level()
162 if (!bch2_btree_node_relock_notrace(trans, path, level)) in __bch2_btree_path_verify_level()
165 BUG_ON(!btree_path_pos_in_node(path, l->b)); in __bch2_btree_path_verify_level()
177 if (p && bkey_iter_pos_cmp(l->b, p, &path->pos) >= 0) { in __bch2_btree_path_verify_level()
182 if (k && bkey_iter_pos_cmp(l->b, k, &path->pos) < 0) { in __bch2_btree_path_verify_level()
188 btree_node_unlock(trans, path, level); in __bch2_btree_path_verify_level()
191 bch2_bpos_to_text(&buf1, path->pos); in __bch2_btree_path_verify_level()
217 struct btree_path *path) in __bch2_btree_path_verify() argument
221 for (unsigned i = 0; i < (!path->cached ? BTREE_MAX_DEPTH : 1); i++) { in __bch2_btree_path_verify()
222 if (!path->l[i].b) { in __bch2_btree_path_verify()
223 BUG_ON(!path->cached && in __bch2_btree_path_verify()
224 bch2_btree_id_root(c, path->btree_id)->b->c.level > i); in __bch2_btree_path_verify()
228 __bch2_btree_path_verify_level(trans, path, i); in __bch2_btree_path_verify()
231 bch2_btree_path_verify_locks(trans, path); in __bch2_btree_path_verify()
236 struct btree_path *path; in __bch2_trans_verify_paths() local
239 trans_for_each_path(trans, path, iter) in __bch2_trans_verify_paths()
240 __bch2_btree_path_verify(trans, path); in __bch2_trans_verify_paths()
325 struct btree_path *path; in __bch2_assert_pos_locked() local
331 trans_for_each_path_inorder(trans, path, iter) { in __bch2_assert_pos_locked()
332 if (path->btree_id != id || in __bch2_assert_pos_locked()
333 !btree_node_locked(path, 0) || in __bch2_assert_pos_locked()
334 !path->should_be_locked) in __bch2_assert_pos_locked()
337 if (!path->cached) { in __bch2_assert_pos_locked()
338 if (bkey_ge(pos, path->l[0].b->data->min_key) && in __bch2_assert_pos_locked()
339 bkey_le(pos, path->l[0].b->key.k.p)) in __bch2_assert_pos_locked()
342 if (bkey_eq(pos, path->pos)) in __bch2_assert_pos_locked()
354 struct btree_path *path, unsigned l) in bch2_btree_path_verify_level() argument
357 __bch2_btree_path_verify_level(trans, path, l); in bch2_btree_path_verify_level()
361 struct btree_path *path) in bch2_btree_path_verify() argument
364 __bch2_btree_path_verify(trans, path); in bch2_btree_path_verify()
407 static void __bch2_btree_path_fix_key_modified(struct btree_path *path, in __bch2_btree_path_fix_key_modified() argument
411 struct btree_path_level *l = &path->l[b->c.level]; in __bch2_btree_path_fix_key_modified()
416 if (bkey_iter_pos_cmp(l->b, where, &path->pos) < 0) in __bch2_btree_path_fix_key_modified()
424 struct btree_path *path; in bch2_btree_path_fix_key_modified() local
427 trans_for_each_path_with_node(trans, b, path, i) { in bch2_btree_path_fix_key_modified()
428 __bch2_btree_path_fix_key_modified(path, b, where); in bch2_btree_path_fix_key_modified()
429 bch2_btree_path_verify_level(trans, path, b->c.level); in bch2_btree_path_fix_key_modified()
433 static void __bch2_btree_node_iter_fix(struct btree_path *path, in __bch2_btree_node_iter_fix() argument
457 bkey_iter_pos_cmp(b, where, &path->pos) >= 0) { in __bch2_btree_node_iter_fix()
472 bkey_iter_pos_cmp(b, where, &path->pos) >= 0) { in __bch2_btree_node_iter_fix()
525 struct btree_path *path, in bch2_btree_node_iter_fix() argument
536 if (node_iter != &path->l[b->c.level].iter) { in bch2_btree_node_iter_fix()
537 __bch2_btree_node_iter_fix(path, b, node_iter, t, in bch2_btree_node_iter_fix()
580 struct btree_path *path, in btree_path_level_prev() argument
587 path->pos = k.k ? k.k->p : l->b->data->min_key; in btree_path_level_prev()
589 bch2_btree_path_verify_level(trans, path, l - path->l); in btree_path_level_prev()
593 static inline bool btree_path_advance_to_pos(struct btree_path *path, in btree_path_advance_to_pos() argument
601 bkey_iter_pos_cmp(l->b, k, &path->pos) < 0) { in btree_path_advance_to_pos()
612 static inline void __btree_path_level_init(struct btree_path *path, in __btree_path_level_init() argument
615 struct btree_path_level *l = &path->l[level]; in __btree_path_level_init()
617 bch2_btree_node_iter_init(&l->iter, l->b, &path->pos); in __btree_path_level_init()
628 struct btree_path *path, in bch2_btree_path_level_init() argument
631 BUG_ON(path->cached); in bch2_btree_path_level_init()
633 EBUG_ON(!btree_path_pos_in_node(path, b)); in bch2_btree_path_level_init()
635 path->l[b->c.level].lock_seq = six_lock_seq(&b->c.lock); in bch2_btree_path_level_init()
636 path->l[b->c.level].b = b; in bch2_btree_path_level_init()
637 __btree_path_level_init(path, b->c.level); in bch2_btree_path_level_init()
652 i->old_v = bch2_btree_path_peek_slot(trans->paths + i->path, &i->old_k).v; in bch2_trans_revalidate_updates_in_node()
672 struct btree_path *path, in bch2_trans_node_add() argument
677 BUG_ON(!btree_path_pos_in_node(path, b)); in bch2_trans_node_add()
679 while ((prev = prev_btree_path(trans, path)) && in bch2_trans_node_add()
681 path = prev; in bch2_trans_node_add()
684 path && btree_path_pos_in_node(path, b); in bch2_trans_node_add()
685 path = next_btree_path(trans, path)) in bch2_trans_node_add()
686 if (path->uptodate == BTREE_ITER_UPTODATE && !path->cached) { in bch2_trans_node_add()
688 btree_lock_want(path, b->c.level); in bch2_trans_node_add()
691 btree_node_unlock(trans, path, b->c.level); in bch2_trans_node_add()
693 mark_btree_node_locked(trans, path, b->c.level, t); in bch2_trans_node_add()
696 bch2_btree_path_level_init(trans, path, b); in bch2_trans_node_add()
705 struct btree_path *path; in bch2_trans_node_drop() local
708 trans_for_each_path(trans, path, i) in bch2_trans_node_drop()
709 if (path->l[level].b == b) { in bch2_trans_node_drop()
710 btree_node_unlock(trans, path, level); in bch2_trans_node_drop()
711 path->l[level].b = ERR_PTR(-BCH_ERR_no_btree_node_init); in bch2_trans_node_drop()
721 struct btree_path *path; in bch2_trans_node_reinit_iter() local
724 trans_for_each_path_with_node(trans, b, path, i) in bch2_trans_node_reinit_iter()
725 __btree_path_level_init(path, b->c.level); in bch2_trans_node_reinit_iter()
733 struct btree_path *path, in btree_path_lock_root() argument
738 struct btree_root *r = bch2_btree_id_root(c, path->btree_id); in btree_path_lock_root()
743 EBUG_ON(path->nodes_locked); in btree_path_lock_root()
752 path->level = READ_ONCE(b->c.level); in btree_path_lock_root()
754 if (unlikely(path->level < depth_want)) { in btree_path_lock_root()
761 path->level = depth_want; in btree_path_lock_root()
762 for (i = path->level; i < BTREE_MAX_DEPTH; i++) in btree_path_lock_root()
763 path->l[i].b = NULL; in btree_path_lock_root()
767 lock_type = __btree_lock_want(path, path->level); in btree_path_lock_root()
768 ret = btree_node_lock(trans, path, &b->c, in btree_path_lock_root()
769 path->level, lock_type, trace_ip); in btree_path_lock_root()
777 b->c.level == path->level && in btree_path_lock_root()
779 for (i = 0; i < path->level; i++) in btree_path_lock_root()
780 path->l[i].b = ERR_PTR(-BCH_ERR_no_btree_node_lock_root); in btree_path_lock_root()
781 path->l[path->level].b = b; in btree_path_lock_root()
782 for (i = path->level + 1; i < BTREE_MAX_DEPTH; i++) in btree_path_lock_root()
783 path->l[i].b = NULL; in btree_path_lock_root()
785 mark_btree_node_locked(trans, path, path->level, in btree_path_lock_root()
787 bch2_btree_path_level_init(trans, path, b); in btree_path_lock_root()
796 static int btree_path_prefetch(struct btree_trans *trans, struct btree_path *path) in btree_path_prefetch() argument
799 struct btree_path_level *l = path_l(path); in btree_path_prefetch()
804 ? (path->level > 1 ? 0 : 2) in btree_path_prefetch()
805 : (path->level > 1 ? 1 : 16); in btree_path_prefetch()
806 bool was_locked = btree_node_locked(path, path->level); in btree_path_prefetch()
812 if (!bch2_btree_node_relock(trans, path, path->level)) in btree_path_prefetch()
821 ret = bch2_btree_node_prefetch(trans, path, tmp.k, path->btree_id, in btree_path_prefetch()
822 path->level - 1); in btree_path_prefetch()
826 btree_node_unlock(trans, path, path->level); in btree_path_prefetch()
832 static int btree_path_prefetch_j(struct btree_trans *trans, struct btree_path *path, in btree_path_prefetch_j() argument
839 ? (path->level > 1 ? 0 : 2) in btree_path_prefetch_j()
840 : (path->level > 1 ? 1 : 16); in btree_path_prefetch_j()
841 bool was_locked = btree_node_locked(path, path->level); in btree_path_prefetch_j()
849 if (!bch2_btree_node_relock(trans, path, path->level)) in btree_path_prefetch_j()
858 ret = bch2_btree_node_prefetch(trans, path, tmp.k, path->btree_id, in btree_path_prefetch_j()
859 path->level - 1); in btree_path_prefetch_j()
863 btree_node_unlock(trans, path, path->level); in btree_path_prefetch_j()
870 struct btree_path *path, in btree_node_mem_ptr_set() argument
873 struct btree_path_level *l = &path->l[plevel]; in btree_node_mem_ptr_set()
874 bool locked = btree_node_locked(path, plevel); in btree_node_mem_ptr_set()
878 if (!bch2_btree_node_relock(trans, path, plevel)) in btree_node_mem_ptr_set()
888 btree_node_unlock(trans, path, plevel); in btree_node_mem_ptr_set()
892 struct btree_path *path, in btree_node_iter_and_journal_peek() argument
896 struct btree_path_level *l = path_l(path); in btree_node_iter_and_journal_peek()
901 __bch2_btree_and_journal_iter_init_node_iter(trans, &jiter, l->b, l->iter, path->pos); in btree_node_iter_and_journal_peek()
908 bch2_bpos_to_text(&buf, path->pos); in btree_node_iter_and_journal_peek()
921 ret = btree_path_prefetch_j(trans, path, &jiter); in btree_node_iter_and_journal_peek()
929 struct btree_path *path) in btree_node_missing_err() argument
935 bch2_bpos_to_text(&buf, path->pos); in btree_node_missing_err()
937 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(&path_l(path)->b->key)); in btree_node_missing_err()
945 struct btree_path *path, in btree_path_down() argument
950 struct btree_path_level *l = path_l(path); in btree_path_down()
952 unsigned level = path->level - 1; in btree_path_down()
953 enum six_lock_type lock_type = __btree_lock_want(path, level); in btree_path_down()
956 EBUG_ON(!btree_node_locked(path, path->level)); in btree_path_down()
959 ret = btree_node_iter_and_journal_peek(trans, path, flags); in btree_path_down()
965 return btree_node_missing_err(trans, path); in btree_path_down()
971 ret = btree_path_prefetch(trans, path); in btree_path_down()
977 b = bch2_btree_node_get(trans, path, &trans->btree_path_down, in btree_path_down()
986 btree_node_mem_ptr_set(trans, path, level + 1, b); in btree_path_down()
988 if (btree_node_read_locked(path, level + 1)) in btree_path_down()
989 btree_node_unlock(trans, path, level + 1); in btree_path_down()
991 mark_btree_node_locked(trans, path, level, in btree_path_down()
993 path->level = level; in btree_path_down()
994 bch2_btree_path_level_init(trans, path, b); in btree_path_down()
996 bch2_btree_path_verify_locks(trans, path); in btree_path_down()
1003 struct btree_path *path; in bch2_btree_path_traverse_all() local
1016 trans_for_each_path(trans, path, i) in bch2_btree_path_traverse_all()
1017 path->should_be_locked = false; in bch2_btree_path_traverse_all()
1075 static inline bool btree_path_check_pos_in_node(struct btree_path *path, in btree_path_check_pos_in_node() argument
1078 if (check_pos < 0 && btree_path_pos_before_node(path, path->l[l].b)) in btree_path_check_pos_in_node()
1080 if (check_pos > 0 && btree_path_pos_after_node(path, path->l[l].b)) in btree_path_check_pos_in_node()
1086 struct btree_path *path, in btree_path_good_node() argument
1089 return is_btree_node(path, l) && in btree_path_good_node()
1090 bch2_btree_node_relock(trans, path, l) && in btree_path_good_node()
1091 btree_path_check_pos_in_node(path, l, check_pos); in btree_path_good_node()
1095 struct btree_path *path, in btree_path_set_level_down() argument
1100 path->level = new_level; in btree_path_set_level_down()
1102 for (l = path->level + 1; l < BTREE_MAX_DEPTH; l++) in btree_path_set_level_down()
1103 if (btree_lock_want(path, l) == BTREE_NODE_UNLOCKED) in btree_path_set_level_down()
1104 btree_node_unlock(trans, path, l); in btree_path_set_level_down()
1106 btree_path_set_dirty(trans, path, BTREE_ITER_NEED_TRAVERSE); in btree_path_set_level_down()
1107 bch2_btree_path_verify(trans, path); in btree_path_set_level_down()
1111 struct btree_path *path, in __btree_path_up_until_good_node() argument
1114 unsigned i, l = path->level; in __btree_path_up_until_good_node()
1116 while (btree_path_node(path, l) && in __btree_path_up_until_good_node()
1117 !btree_path_good_node(trans, path, l, check_pos)) in __btree_path_up_until_good_node()
1118 __btree_path_set_level_up(trans, path, l++); in __btree_path_up_until_good_node()
1122 i < path->locks_want && btree_path_node(path, i); in __btree_path_up_until_good_node()
1124 if (!bch2_btree_node_relock(trans, path, i)) { in __btree_path_up_until_good_node()
1126 __btree_path_set_level_up(trans, path, l++); in __btree_path_up_until_good_node()
1134 struct btree_path *path, in btree_path_up_until_good_node() argument
1137 return likely(btree_node_locked(path, path->level) && in btree_path_up_until_good_node()
1138 btree_path_check_pos_in_node(path, path->level, check_pos)) in btree_path_up_until_good_node()
1139 ? path->level in btree_path_up_until_good_node()
1140 : __btree_path_up_until_good_node(trans, path, check_pos); in btree_path_up_until_good_node()
1157 struct btree_path *path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one() local
1158 unsigned depth_want = path->level; in bch2_btree_path_traverse_one()
1167 trace_btree_path_traverse_start(trans, path); in bch2_btree_path_traverse_one()
1173 if (path->should_be_locked) { in bch2_btree_path_traverse_one()
1174 ret = bch2_btree_path_relock(trans, path, trace_ip); in bch2_btree_path_traverse_one()
1178 if (path->cached) { in bch2_btree_path_traverse_one()
1183 path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one()
1185 if (unlikely(path->level >= BTREE_MAX_DEPTH)) in bch2_btree_path_traverse_one()
1188 path->level = btree_path_up_until_good_node(trans, path, 0); in bch2_btree_path_traverse_one()
1189 unsigned max_level = path->level; in bch2_btree_path_traverse_one()
1191 EBUG_ON(btree_path_node(path, path->level) && in bch2_btree_path_traverse_one()
1192 !btree_node_locked(path, path->level)); in bch2_btree_path_traverse_one()
1200 while (path->level > depth_want) { in bch2_btree_path_traverse_one()
1201 ret = btree_path_node(path, path->level) in bch2_btree_path_traverse_one()
1202 ? btree_path_down(trans, path, flags, trace_ip) in bch2_btree_path_traverse_one()
1203 : btree_path_lock_root(trans, path, depth_want, trace_ip); in bch2_btree_path_traverse_one()
1214 __bch2_btree_path_unlock(trans, path); in bch2_btree_path_traverse_one()
1215 path->level = depth_want; in bch2_btree_path_traverse_one()
1216 path->l[path->level].b = ERR_PTR(ret); in bch2_btree_path_traverse_one()
1221 if (unlikely(max_level > path->level)) { in bch2_btree_path_traverse_one()
1225 trans_for_each_path_with_node(trans, path_l(path)->b, linked, iter) in bch2_btree_path_traverse_one()
1226 for (unsigned j = path->level + 1; j < max_level; j++) in bch2_btree_path_traverse_one()
1227 linked->l[j] = path->l[j]; in bch2_btree_path_traverse_one()
1231 path->uptodate = BTREE_ITER_UPTODATE; in bch2_btree_path_traverse_one()
1232 trace_btree_path_traverse_end(trans, path); in bch2_btree_path_traverse_one()
1238 bch2_btree_path_verify(trans, path); in bch2_btree_path_traverse_one()
1273 btree_path_idx_t path, bool intent, unsigned long ip) in __bch2_btree_path_make_mut() argument
1275 struct btree_path *old = trans->paths + path; in __bch2_btree_path_make_mut()
1276 __btree_path_put(trans, trans->paths + path, intent); in __bch2_btree_path_make_mut()
1277 path = btree_path_clone(trans, path, intent, ip); in __bch2_btree_path_make_mut()
1278 trace_btree_path_clone(trans, old, trans->paths + path); in __bch2_btree_path_make_mut()
1279 trans->paths[path].preserve = false; in __bch2_btree_path_make_mut()
1280 return path; in __bch2_btree_path_make_mut()
1297 struct btree_path *path = trans->paths + path_idx; in __bch2_btree_path_set_pos() local
1298 path->pos = new_pos; in __bch2_btree_path_set_pos()
1301 if (unlikely(path->cached)) { in __bch2_btree_path_set_pos()
1302 btree_node_unlock(trans, path, 0); in __bch2_btree_path_set_pos()
1303 path->l[0].b = ERR_PTR(-BCH_ERR_no_btree_node_up); in __bch2_btree_path_set_pos()
1304 btree_path_set_dirty(trans, path, BTREE_ITER_NEED_TRAVERSE); in __bch2_btree_path_set_pos()
1308 unsigned level = btree_path_up_until_good_node(trans, path, cmp); in __bch2_btree_path_set_pos()
1310 if (btree_path_node(path, level)) { in __bch2_btree_path_set_pos()
1311 struct btree_path_level *l = &path->l[level]; in __bch2_btree_path_set_pos()
1313 BUG_ON(!btree_node_locked(path, level)); in __bch2_btree_path_set_pos()
1321 !btree_path_advance_to_pos(path, l, 8)) in __bch2_btree_path_set_pos()
1322 bch2_btree_node_iter_init(&l->iter, l->b, &path->pos); in __bch2_btree_path_set_pos()
1332 if (unlikely(level != path->level)) { in __bch2_btree_path_set_pos()
1333 btree_path_set_dirty(trans, path, BTREE_ITER_NEED_TRAVERSE); in __bch2_btree_path_set_pos()
1334 __bch2_btree_path_unlock(trans, path); in __bch2_btree_path_set_pos()
1337 bch2_btree_path_verify(trans, path); in __bch2_btree_path_set_pos()
1343 static struct btree_path *have_path_at_pos(struct btree_trans *trans, struct btree_path *path) in have_path_at_pos() argument
1347 sib = prev_btree_path(trans, path); in have_path_at_pos()
1348 if (sib && !btree_path_cmp(sib, path)) in have_path_at_pos()
1351 sib = next_btree_path(trans, path); in have_path_at_pos()
1352 if (sib && !btree_path_cmp(sib, path)) in have_path_at_pos()
1358 static struct btree_path *have_node_at_pos(struct btree_trans *trans, struct btree_path *path) in have_node_at_pos() argument
1362 sib = prev_btree_path(trans, path); in have_node_at_pos()
1363 if (sib && sib->level == path->level && path_l(sib)->b == path_l(path)->b) in have_node_at_pos()
1366 sib = next_btree_path(trans, path); in have_node_at_pos()
1367 if (sib && sib->level == path->level && path_l(sib)->b == path_l(path)->b) in have_node_at_pos()
1373 static inline void __bch2_path_free(struct btree_trans *trans, btree_path_idx_t path) in __bch2_path_free() argument
1375 __bch2_btree_path_unlock(trans, trans->paths + path); in __bch2_path_free()
1376 btree_path_list_remove(trans, trans->paths + path); in __bch2_path_free()
1377 __clear_bit(path, trans->paths_allocated); in __bch2_path_free()
1380 static bool bch2_btree_path_can_relock(struct btree_trans *trans, struct btree_path *path) in bch2_btree_path_can_relock() argument
1382 unsigned l = path->level; in bch2_btree_path_can_relock()
1385 if (!btree_path_node(path, l)) in bch2_btree_path_can_relock()
1388 if (!is_btree_node(path, l)) in bch2_btree_path_can_relock()
1391 if (path->l[l].lock_seq != path->l[l].b->c.lock.seq) in bch2_btree_path_can_relock()
1395 } while (l < path->locks_want); in bch2_btree_path_can_relock()
1402 struct btree_path *path = trans->paths + path_idx, *dup = NULL; in bch2_path_put() local
1404 if (!__btree_path_put(trans, path, intent)) in bch2_path_put()
1407 if (!path->preserve && !path->should_be_locked) in bch2_path_put()
1410 dup = path->preserve in bch2_path_put()
1411 ? have_path_at_pos(trans, path) in bch2_path_put()
1412 : have_node_at_pos(trans, path); in bch2_path_put()
1420 if (path->should_be_locked && in bch2_path_put()
1431 BUG_ON(path->should_be_locked && in bch2_path_put()
1436 path->should_be_locked = false; in bch2_path_put()
1437 dup->preserve |= path->preserve; in bch2_path_put()
1514 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text_short() local
1517 path_idx, path->ref, path->intent_ref, in bch2_btree_path_to_text_short()
1518 path->preserve ? 'P' : ' ', in bch2_btree_path_to_text_short()
1519 path->should_be_locked ? 'S' : ' ', in bch2_btree_path_to_text_short()
1520 path->cached ? 'C' : 'B'); in bch2_btree_path_to_text_short()
1521 bch2_btree_id_level_to_text(out, path->btree_id, path->level); in bch2_btree_path_to_text_short()
1523 bch2_bpos_to_text(out, path->pos); in bch2_btree_path_to_text_short()
1525 if (!path->cached && btree_node_locked(path, path->level)) { in bch2_btree_path_to_text_short()
1527 struct btree *b = path_l(path)->b; in bch2_btree_path_to_text_short()
1534 prt_printf(out, " %pS", (void *) path->ip_allocated); in bch2_btree_path_to_text_short()
1558 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text() local
1560 prt_printf(out, " uptodate %u locks_want %u", path->uptodate, path->locks_want); in bch2_btree_path_to_text()
1566 btree_node_locked_str(btree_node_locked_type(path, l)), in bch2_btree_path_to_text()
1567 path->l[l].lock_seq); in bch2_btree_path_to_text()
1569 int ret = PTR_ERR_OR_ZERO(path->l[l].b); in bch2_btree_path_to_text()
1573 prt_printf(out, "%px", path->l[l].b); in bch2_btree_path_to_text()
1726 struct btree_path *path = &trans->paths[idx]; in btree_path_alloc() local
1727 path->ref = 0; in btree_path_alloc()
1728 path->intent_ref = 0; in btree_path_alloc()
1729 path->nodes_locked = 0; in btree_path_alloc()
1741 struct btree_path *path; in bch2_path_get() local
1756 trans_for_each_path_inorder(trans, path, iter) { in bch2_path_get()
1757 if (__btree_path_cmp(path, in bch2_path_get()
1776 path = trans->paths + path_idx; in bch2_path_get()
1779 path = trans->paths + path_idx; in bch2_path_get()
1781 __btree_path_get(trans, path, intent); in bch2_path_get()
1782 path->pos = pos; in bch2_path_get()
1783 path->btree_id = btree_id; in bch2_path_get()
1784 path->cached = cached; in bch2_path_get()
1785 path->uptodate = BTREE_ITER_NEED_TRAVERSE; in bch2_path_get()
1786 path->should_be_locked = false; in bch2_path_get()
1787 path->level = level; in bch2_path_get()
1788 path->locks_want = locks_want; in bch2_path_get()
1789 path->nodes_locked = 0; in bch2_path_get()
1790 for (unsigned i = 0; i < ARRAY_SIZE(path->l); i++) in bch2_path_get()
1791 path->l[i].b = ERR_PTR(-BCH_ERR_no_btree_node_init); in bch2_path_get()
1793 path->ip_allocated = ip; in bch2_path_get()
1797 trace_btree_path_alloc(trans, path); in bch2_path_get()
1801 path->preserve = true; in bch2_path_get()
1824 struct btree_path *path = trans->paths + path_idx; in bch2_path_get_unlocked_mut() local
1825 bch2_btree_path_downgrade(trans, path); in bch2_path_get_unlocked_mut()
1826 __bch2_btree_path_unlock(trans, path); in bch2_path_get_unlocked_mut()
1830 struct bkey_s_c bch2_btree_path_peek_slot(struct btree_path *path, struct bkey *u) in bch2_btree_path_peek_slot() argument
1833 struct btree_path_level *l = path_l(path); in bch2_btree_path_peek_slot()
1840 EBUG_ON(path->uptodate != BTREE_ITER_UPTODATE); in bch2_btree_path_peek_slot()
1841 EBUG_ON(!btree_node_locked(path, path->level)); in bch2_btree_path_peek_slot()
1843 if (!path->cached) { in bch2_btree_path_peek_slot()
1847 EBUG_ON(k.k && bkey_deleted(k.k) && bpos_eq(k.k->p, path->pos)); in bch2_btree_path_peek_slot()
1849 if (!k.k || !bpos_eq(path->pos, k.k->p)) in bch2_btree_path_peek_slot()
1852 struct bkey_cached *ck = (void *) path->l[0].b; in bch2_btree_path_peek_slot()
1856 EBUG_ON(path->btree_id != ck->key.btree_id || in bch2_btree_path_peek_slot()
1857 !bkey_eq(path->pos, ck->key.pos)); in bch2_btree_path_peek_slot()
1866 u->p = path->pos; in bch2_btree_path_peek_slot()
1872 if (!iter->path || trans->restarted) in bch2_set_btree_iter_dontneed()
1875 struct btree_path *path = btree_iter_path(trans, iter); in bch2_set_btree_iter_dontneed() local
1876 path->preserve = false; in bch2_set_btree_iter_dontneed()
1877 if (path->ref == 1) in bch2_set_btree_iter_dontneed()
1878 path->should_be_locked = false; in bch2_set_btree_iter_dontneed()
1885 return bch2_btree_path_traverse(trans, iter->path, iter->flags); in __bch2_btree_iter_traverse()
1893 iter->path = bch2_btree_path_set_pos(trans, iter->path, in bch2_btree_iter_traverse()
1898 int ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_traverse()
1902 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_traverse() local
1903 if (btree_path_node(path, path->level)) in bch2_btree_iter_traverse()
1904 btree_path_set_should_be_locked(trans, path); in bch2_btree_iter_traverse()
1916 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_peek_node()
1919 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_peek_node()
1923 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_peek_node() local
1924 b = btree_path_node(path, path->level); in bch2_btree_iter_peek_node()
1933 iter->path = bch2_btree_path_set_pos(trans, iter->path, b->key.k.p, in bch2_btree_iter_peek_node()
1965 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_next_node()
1969 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_next_node()
1974 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node() local
1977 if (!btree_path_node(path, path->level)) in bch2_btree_iter_next_node()
1981 if (!btree_path_node(path, path->level + 1)) { in bch2_btree_iter_next_node()
1982 path->should_be_locked = false; in bch2_btree_iter_next_node()
1983 btree_path_set_level_up(trans, path); in bch2_btree_iter_next_node()
1991 bch2_btree_path_downgrade(trans, path); in bch2_btree_iter_next_node()
1993 if (!bch2_btree_node_relock(trans, path, path->level + 1)) { in bch2_btree_iter_next_node()
1994 trace_and_count(trans->c, trans_restart_relock_next_node, trans, _THIS_IP_, path); in bch2_btree_iter_next_node()
1996 __bch2_btree_path_unlock(trans, path); in bch2_btree_iter_next_node()
1997 path->l[path->level].b = ERR_PTR(-BCH_ERR_no_btree_node_relock); in bch2_btree_iter_next_node()
1998 path->l[path->level + 1].b = ERR_PTR(-BCH_ERR_no_btree_node_relock); in bch2_btree_iter_next_node()
1999 btree_path_set_dirty(trans, path, BTREE_ITER_NEED_TRAVERSE); in bch2_btree_iter_next_node()
2003 b = btree_path_node(path, path->level + 1); in bch2_btree_iter_next_node()
2006 __btree_path_set_level_up(trans, path, path->level++); in bch2_btree_iter_next_node()
2008 if (btree_lock_want(path, path->level + 1) == BTREE_NODE_UNLOCKED) in bch2_btree_iter_next_node()
2009 btree_node_unlock(trans, path, path->level + 1); in bch2_btree_iter_next_node()
2015 iter->path = bch2_btree_path_set_pos(trans, iter->path, in bch2_btree_iter_next_node()
2020 path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node()
2021 btree_path_set_level_down(trans, path, iter->min_depth); in bch2_btree_iter_next_node()
2023 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_next_node()
2027 path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node()
2028 b = path->l[path->level].b; in bch2_btree_iter_next_node()
2034 iter->path = bch2_btree_path_set_pos(trans, iter->path, b->key.k.p, in bch2_btree_iter_next_node()
2098 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_trans_peek_updates() local
2099 struct bpos end = path_l(path)->b->key.k.p; in bch2_btree_trans_peek_updates()
2129 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_journal_peek() local
2132 path->level, in bch2_btree_journal_peek()
2142 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_slot_journal() local
2143 struct bkey_i *k = bch2_btree_journal_peek(trans, iter, path->pos, path->pos); in btree_trans_peek_slot_journal()
2159 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_journal() local
2162 k->k ? k->k->p : path_l(path)->b->key.k.p); in btree_trans_peek_journal()
2174 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_journal_peek_prev() local
2177 path->level, in bch2_btree_journal_peek_prev()
2189 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_prev_journal() local
2192 k->k ? k->k->p : path_l(path)->b->data->min_key); in btree_trans_peek_prev_journal()
2263 iter->path = bch2_btree_path_set_pos(trans, iter->path, search_key, in __bch2_btree_iter_peek()
2267 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in __bch2_btree_iter_peek()
2275 struct btree_path *path = btree_iter_path(trans, iter); in __bch2_btree_iter_peek() local
2276 struct btree_path_level *l = path_l(path); in __bch2_btree_iter_peek()
2285 btree_path_set_should_be_locked(trans, path); in __bch2_btree_iter_peek()
2429 __btree_path_get(trans, trans->paths + iter->path, iter->flags & BTREE_ITER_intent); in bch2_btree_iter_peek_max()
2430 iter->update_path = iter->path; in bch2_btree_iter_peek_max()
2481 iter->path = bch2_btree_path_set_pos(trans, iter->path, k.k->p, in bch2_btree_iter_peek_max()
2550 iter->path = bch2_btree_path_set_pos(trans, iter->path, search_key, in __bch2_btree_iter_peek_prev()
2554 int ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in __bch2_btree_iter_peek_prev()
2562 struct btree_path *path = btree_iter_path(trans, iter); in __bch2_btree_iter_peek_prev() local
2563 struct btree_path_level *l = path_l(path); in __bch2_btree_iter_peek_prev()
2572 btree_path_set_should_be_locked(trans, path); in __bch2_btree_iter_peek_prev()
2576 k = btree_path_level_prev(trans, path, l, &iter->k); in __bch2_btree_iter_peek_prev()
2602 } else if (likely(!bpos_eq(path->l[0].b->data->min_key, POS_MIN))) { in __bch2_btree_iter_peek_prev()
2604 search_key = bpos_predecessor(path->l[0].b->data->min_key); in __bch2_btree_iter_peek_prev()
2681 bch2_path_put(trans, iter->path, in bch2_btree_iter_peek_prev_min()
2683 iter->path = saved_path; in bch2_btree_iter_peek_prev_min()
2717 saved_path = btree_path_clone(trans, iter->path, in bch2_btree_iter_peek_prev_min()
2721 trans->paths + iter->path, in bch2_btree_iter_peek_prev_min()
2824 iter->path = bch2_btree_path_set_pos(trans, iter->path, search_key, in bch2_btree_iter_peek_slot()
2828 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_peek_slot()
2834 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_peek_slot() local
2835 if (unlikely(!btree_path_node(path, path->level))) { in bch2_btree_iter_peek_slot()
2840 btree_path_set_should_be_locked(trans, path); in bch2_btree_iter_peek_slot()
2983 struct btree_path *path; in btree_trans_verify_sorted_refs() local
2988 trans_for_each_path(trans, path, i) { in btree_trans_verify_sorted_refs()
2989 BUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_trans_verify_sorted_refs()
2990 BUG_ON(trans->sorted[path->sorted_idx] != i); in btree_trans_verify_sorted_refs()
3003 struct btree_path *path, *prev = NULL; in btree_trans_verify_sorted() local
3009 trans_for_each_path_inorder(trans, path, iter) { in btree_trans_verify_sorted()
3010 if (prev && btree_path_cmp(prev, path) > 0) { in btree_trans_verify_sorted()
3014 prev = path; in btree_trans_verify_sorted()
3064 struct btree_path *path) in btree_path_list_remove() argument
3066 EBUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_path_list_remove()
3069 memmove_u64s_down_small(trans->sorted + path->sorted_idx, in btree_path_list_remove()
3070 trans->sorted + path->sorted_idx + 1, in btree_path_list_remove()
3071 DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx, in btree_path_list_remove()
3074 array_remove_item(trans->sorted, trans->nr_sorted, path->sorted_idx); in btree_path_list_remove()
3076 for (unsigned i = path->sorted_idx; i < trans->nr_sorted; i++) in btree_path_list_remove()
3084 struct btree_path *path = trans->paths + path_idx; in btree_path_list_add() local
3086 path->sorted_idx = pos ? trans->paths[pos].sorted_idx + 1 : trans->nr_sorted; in btree_path_list_add()
3089 memmove_u64s_up_small(trans->sorted + path->sorted_idx + 1, in btree_path_list_add()
3090 trans->sorted + path->sorted_idx, in btree_path_list_add()
3091 DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx, in btree_path_list_add()
3094 trans->sorted[path->sorted_idx] = path_idx; in btree_path_list_add()
3096 array_insert_item(trans->sorted, trans->nr_sorted, path->sorted_idx, path_idx); in btree_path_list_add()
3099 for (unsigned i = path->sorted_idx; i < trans->nr_sorted; i++) in btree_path_list_add()
3110 if (iter->path) in bch2_trans_iter_exit()
3111 bch2_path_put(trans, iter->path, in bch2_trans_iter_exit()
3116 iter->path = 0; in bch2_trans_iter_exit()
3152 struct btree_path *path = btree_iter_path(trans, iter); in bch2_trans_node_iter_init() local
3153 BUG_ON(path->locks_want < min(locks_want, BTREE_MAX_DEPTH)); in bch2_trans_node_iter_init()
3154 BUG_ON(path->level != depth); in bch2_trans_node_iter_init()
3165 if (src->path) in bch2_trans_copy_iter()
3166 __btree_path_get(trans, trans->paths + src->path, src->flags & BTREE_ITER_intent); in bch2_trans_copy_iter()
3283 struct btree_path *path; in bch2_trans_srcu_unlock() local
3286 trans_for_each_path(trans, path, i) in bch2_trans_srcu_unlock()
3287 if (path->cached && !btree_node_locked(path, 0)) in bch2_trans_srcu_unlock()
3288 path->l[0].b = ERR_PTR(-BCH_ERR_no_btree_node_srcu_reset); in bch2_trans_srcu_unlock()
3317 struct btree_path *path; in bch2_trans_begin() local
3347 trans_for_each_path(trans, path, i) { in bch2_trans_begin()
3348 path->should_be_locked = false; in bch2_trans_begin()
3355 if (!trans->restarted && path->btree_id != BTREE_ID_subvolumes) in bch2_trans_begin()
3356 path->preserve = false; in bch2_trans_begin()
3363 if (!path->ref && !path->preserve) in bch2_trans_begin()
3366 path->preserve = false; in bch2_trans_begin()
3518 struct btree_path *path; in btree_paths_leaked() local
3521 trans_for_each_path(trans, path, i) in btree_paths_leaked()
3522 if (path->ref) in btree_paths_leaked()
3531 struct btree_path *path; in check_btree_paths_leaked() local
3538 trans_for_each_path(trans, path, i) in check_btree_paths_leaked()
3539 if (path->ref) in check_btree_paths_leaked()
3541 bch2_btree_id_str(path->btree_id), in check_btree_paths_leaked()
3542 (void *) path->ip_allocated); in check_btree_paths_leaked()
3564 __btree_path_put(trans, trans->paths + i->path, true); in bch2_trans_put()
3680 struct btree_path *path = paths + idx; in bch2_btree_trans_to_text() local
3681 if (!path->nodes_locked) in bch2_btree_trans_to_text()
3686 path->cached ? 'c' : 'b'); in bch2_btree_trans_to_text()
3687 bch2_btree_id_to_text(out, path->btree_id); in bch2_btree_trans_to_text()
3688 prt_printf(out, " l=%u:", path->level); in bch2_btree_trans_to_text()
3689 bch2_bpos_to_text(out, path->pos); in bch2_btree_trans_to_text()
3693 if (btree_node_locked(path, l) && in bch2_btree_trans_to_text()
3694 !IS_ERR_OR_NULL(b = (void *) READ_ONCE(path->l[l].b))) { in bch2_btree_trans_to_text()
3696 lock_types[btree_node_locked_type(path, l)], l); in bch2_btree_trans_to_text()