Lines Matching full:path
97 static inline bool btree_path_pos_before_node(struct btree_path *path, in btree_path_pos_before_node() argument
100 return bpos_lt(path->pos, b->data->min_key); in btree_path_pos_before_node()
103 static inline bool btree_path_pos_after_node(struct btree_path *path, in btree_path_pos_after_node() argument
106 return bpos_gt(path->pos, b->key.k.p); in btree_path_pos_after_node()
109 static inline bool btree_path_pos_in_node(struct btree_path *path, in btree_path_pos_in_node() argument
112 return path->btree_id == b->c.btree_id && in btree_path_pos_in_node()
113 !btree_path_pos_before_node(path, b) && in btree_path_pos_in_node()
114 !btree_path_pos_after_node(path, b); in btree_path_pos_in_node()
122 struct btree_path *path) in bch2_btree_path_verify_cached() argument
125 bool locked = btree_node_locked(path, 0); in bch2_btree_path_verify_cached()
127 if (!bch2_btree_node_relock(trans, path, 0)) in bch2_btree_path_verify_cached()
130 ck = (void *) path->l[0].b; in bch2_btree_path_verify_cached()
131 BUG_ON(ck->key.btree_id != path->btree_id || in bch2_btree_path_verify_cached()
132 !bkey_eq(ck->key.pos, path->pos)); in bch2_btree_path_verify_cached()
135 btree_node_unlock(trans, path, 0); in bch2_btree_path_verify_cached()
139 struct btree_path *path, unsigned level) in bch2_btree_path_verify_level() argument
153 l = &path->l[level]; in bch2_btree_path_verify_level()
155 locked = btree_node_locked(path, level); in bch2_btree_path_verify_level()
157 if (path->cached) { in bch2_btree_path_verify_level()
159 bch2_btree_path_verify_cached(trans, path); in bch2_btree_path_verify_level()
163 if (!btree_path_node(path, level)) in bch2_btree_path_verify_level()
166 if (!bch2_btree_node_relock_notrace(trans, path, level)) in bch2_btree_path_verify_level()
169 BUG_ON(!btree_path_pos_in_node(path, l->b)); in bch2_btree_path_verify_level()
181 if (p && bkey_iter_pos_cmp(l->b, p, &path->pos) >= 0) { in bch2_btree_path_verify_level()
186 if (k && bkey_iter_pos_cmp(l->b, k, &path->pos) < 0) { in bch2_btree_path_verify_level()
192 btree_node_unlock(trans, path, level); in bch2_btree_path_verify_level()
195 bch2_bpos_to_text(&buf1, path->pos); in bch2_btree_path_verify_level()
213 panic("path should be %s key at level %u:\n" in bch2_btree_path_verify_level()
214 "path pos %s\n" in bch2_btree_path_verify_level()
221 struct btree_path *path) in bch2_btree_path_verify() argument
225 for (unsigned i = 0; i < (!path->cached ? BTREE_MAX_DEPTH : 1); i++) { in bch2_btree_path_verify()
226 if (!path->l[i].b) { in bch2_btree_path_verify()
227 BUG_ON(!path->cached && in bch2_btree_path_verify()
228 bch2_btree_id_root(c, path->btree_id)->b->c.level > i); in bch2_btree_path_verify()
232 bch2_btree_path_verify_level(trans, path, i); in bch2_btree_path_verify()
235 bch2_btree_path_verify_locks(path); in bch2_btree_path_verify()
240 struct btree_path *path; in bch2_trans_verify_paths() local
243 trans_for_each_path(trans, path, iter) in bch2_trans_verify_paths()
244 bch2_btree_path_verify(trans, path); in bch2_trans_verify_paths()
334 struct btree_path *path; in bch2_assert_pos_locked() local
340 trans_for_each_path_inorder(trans, path, iter) { in bch2_assert_pos_locked()
341 if (path->btree_id != id || in bch2_assert_pos_locked()
342 !btree_node_locked(path, 0) || in bch2_assert_pos_locked()
343 !path->should_be_locked) in bch2_assert_pos_locked()
346 if (!path->cached) { in bch2_assert_pos_locked()
347 if (bkey_ge(pos, path->l[0].b->data->min_key) && in bch2_assert_pos_locked()
348 bkey_le(pos, path->l[0].b->key.k.p)) in bch2_assert_pos_locked()
351 if (bkey_eq(pos, path->pos)) in bch2_assert_pos_locked()
365 struct btree_path *path, unsigned l) {} in bch2_btree_path_verify_level() argument
367 struct btree_path *path) {} in bch2_btree_path_verify() argument
374 /* Btree path: fixups after btree updates */
393 static void __bch2_btree_path_fix_key_modified(struct btree_path *path, in __bch2_btree_path_fix_key_modified() argument
397 struct btree_path_level *l = &path->l[b->c.level]; in __bch2_btree_path_fix_key_modified()
402 if (bkey_iter_pos_cmp(l->b, where, &path->pos) < 0) in __bch2_btree_path_fix_key_modified()
410 struct btree_path *path; in bch2_btree_path_fix_key_modified() local
413 trans_for_each_path_with_node(trans, b, path, i) { in bch2_btree_path_fix_key_modified()
414 __bch2_btree_path_fix_key_modified(path, b, where); in bch2_btree_path_fix_key_modified()
415 bch2_btree_path_verify_level(trans, path, b->c.level); in bch2_btree_path_fix_key_modified()
419 static void __bch2_btree_node_iter_fix(struct btree_path *path, in __bch2_btree_node_iter_fix() argument
443 bkey_iter_pos_cmp(b, where, &path->pos) >= 0) { in __bch2_btree_node_iter_fix()
458 bkey_iter_pos_cmp(b, where, &path->pos) >= 0) { in __bch2_btree_node_iter_fix()
511 struct btree_path *path, in bch2_btree_node_iter_fix() argument
522 if (node_iter != &path->l[b->c.level].iter) { in bch2_btree_node_iter_fix()
523 __bch2_btree_node_iter_fix(path, b, node_iter, t, in bch2_btree_node_iter_fix()
538 /* Btree path level: pointer to a particular btree node and node iter */
566 struct btree_path *path, in btree_path_level_peek() argument
573 path->pos = k.k ? k.k->p : l->b->key.k.p; in btree_path_level_peek()
575 bch2_btree_path_verify_level(trans, path, l - path->l); in btree_path_level_peek()
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()
640 /* Btree path: fixups after btree node updates: */
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()
730 /* Btree path: traverse, set_pos: */
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
897 struct btree_path_level *l = path_l(path); in btree_node_iter_and_journal_peek()
902 __bch2_btree_and_journal_iter_init_node_iter(trans, &jiter, l->b, l->iter, path->pos); in btree_node_iter_and_journal_peek()
909 bch2_bpos_to_text(&buf, path->pos); in btree_node_iter_and_journal_peek()
922 ret = btree_path_prefetch_j(trans, path, &jiter); in btree_node_iter_and_journal_peek()
930 struct btree_path *path, in btree_path_down() argument
935 struct btree_path_level *l = path_l(path); in btree_path_down()
937 unsigned level = path->level - 1; in btree_path_down()
938 enum six_lock_type lock_type = __btree_lock_want(path, level); in btree_path_down()
942 EBUG_ON(!btree_node_locked(path, path->level)); in btree_path_down()
947 ret = btree_node_iter_and_journal_peek(trans, path, flags, &tmp); in btree_path_down()
956 bch2_bpos_to_text(&buf, path->pos); in btree_path_down()
970 ret = btree_path_prefetch(trans, path); in btree_path_down()
976 b = bch2_btree_node_get(trans, path, tmp.k, level, lock_type, trace_ip); in btree_path_down()
984 btree_node_mem_ptr_set(trans, path, level + 1, b); in btree_path_down()
986 if (btree_node_read_locked(path, level + 1)) in btree_path_down()
987 btree_node_unlock(trans, path, level + 1); in btree_path_down()
989 mark_btree_node_locked(trans, path, level, in btree_path_down()
991 path->level = level; in btree_path_down()
992 bch2_btree_path_level_init(trans, path, b); in btree_path_down()
994 bch2_btree_path_verify_locks(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()
1042 * Traversing a path can cause another path to be added at about in bch2_btree_path_traverse_all()
1062 * (path->uptodate < BTREE_ITER_NEED_TRAVERSE); however, since in bch2_btree_path_traverse_all()
1063 * path->should_be_locked is not set yet, we might have unlocked and in bch2_btree_path_traverse_all()
1064 * then failed to relock a path - that's fine. 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(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()
1170 * Ensure we obey path->should_be_locked: if it's set, we can't unlock in bch2_btree_path_traverse_one()
1171 * and re-traverse the path without a transaction restart: 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()
1179 ret = bch2_btree_path_traverse_cached(trans, path, flags); 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()
1195 * Note: path->nodes[path->level] may be temporarily NULL here - that 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(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(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()
1341 /* Btree path: main interface: */
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; in bch2_path_put() local
1404 if (!__btree_path_put(trans, path, intent)) in bch2_path_put()
1407 dup = path->preserve in bch2_path_put()
1408 ? have_path_at_pos(trans, path) in bch2_path_put()
1409 : have_node_at_pos(trans, path); in bch2_path_put()
1413 if (!dup && !(!path->preserve && !is_btree_node(path, path->level))) in bch2_path_put()
1416 if (path->should_be_locked && !trans->restarted) { in bch2_path_put()
1427 dup->preserve |= path->preserve; in bch2_path_put()
1428 dup->should_be_locked |= path->should_be_locked; in bch2_path_put()
1434 static void bch2_path_put_nokeep(struct btree_trans *trans, btree_path_idx_t path, in bch2_path_put_nokeep() argument
1437 if (!__btree_path_put(trans, trans->paths + path, intent)) in bch2_path_put_nokeep()
1440 __bch2_path_free(trans, path); in bch2_path_put_nokeep()
1522 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text_short() local
1524 prt_printf(out, "path: idx %3u ref %u:%u %c %c %c ", in bch2_btree_path_to_text_short()
1525 path_idx, path->ref, path->intent_ref, in bch2_btree_path_to_text_short()
1526 path->preserve ? 'P' : ' ', in bch2_btree_path_to_text_short()
1527 path->should_be_locked ? 'S' : ' ', in bch2_btree_path_to_text_short()
1528 path->cached ? 'C' : 'B'); in bch2_btree_path_to_text_short()
1529 bch2_btree_id_level_to_text(out, path->btree_id, path->level); in bch2_btree_path_to_text_short()
1531 bch2_bpos_to_text(out, path->pos); in bch2_btree_path_to_text_short()
1533 if (!path->cached && btree_node_locked(path, path->level)) { in bch2_btree_path_to_text_short()
1535 struct btree *b = path_l(path)->b; in bch2_btree_path_to_text_short()
1542 prt_printf(out, " %pS", (void *) path->ip_allocated); in bch2_btree_path_to_text_short()
1566 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text() local
1568 prt_printf(out, " uptodate %u locks_want %u", path->uptodate, path->locks_want); in bch2_btree_path_to_text()
1574 btree_node_locked_str(btree_node_locked_type(path, l)), in bch2_btree_path_to_text()
1575 path->l[l].lock_seq); in bch2_btree_path_to_text()
1577 int ret = PTR_ERR_OR_ZERO(path->l[l].b); in bch2_btree_path_to_text()
1581 prt_printf(out, "%px", path->l[l].b); in bch2_btree_path_to_text()
1668 bch_err(trans->c, "trans path overflow"); in btree_path_overflow()
1726 * Do this before marking the new path as allocated, since it won't be in btree_path_alloc()
1734 struct btree_path *path = &trans->paths[idx]; in btree_path_alloc() local
1735 path->ref = 0; in btree_path_alloc()
1736 path->intent_ref = 0; in btree_path_alloc()
1737 path->nodes_locked = 0; in btree_path_alloc()
1749 struct btree_path *path; in bch2_path_get() local
1760 trans_for_each_path_inorder(trans, path, iter) { in bch2_path_get()
1761 if (__btree_path_cmp(path, in bch2_path_get()
1779 path = trans->paths + path_idx; in bch2_path_get()
1782 path = trans->paths + path_idx; in bch2_path_get()
1784 __btree_path_get(trans, path, intent); in bch2_path_get()
1785 path->pos = pos; in bch2_path_get()
1786 path->btree_id = btree_id; in bch2_path_get()
1787 path->cached = cached; in bch2_path_get()
1788 path->uptodate = BTREE_ITER_NEED_TRAVERSE; in bch2_path_get()
1789 path->should_be_locked = false; in bch2_path_get()
1790 path->level = level; in bch2_path_get()
1791 path->locks_want = locks_want; in bch2_path_get()
1792 path->nodes_locked = 0; in bch2_path_get()
1793 for (unsigned i = 0; i < ARRAY_SIZE(path->l); i++) in bch2_path_get()
1794 path->l[i].b = ERR_PTR(-BCH_ERR_no_btree_node_init); in bch2_path_get()
1796 path->ip_allocated = ip; in bch2_path_get()
1800 trace_btree_path_alloc(trans, path); in bch2_path_get()
1804 path->preserve = true; in bch2_path_get()
1806 if (path->intent_ref) in bch2_path_get()
1810 * If the path has locks_want greater than requested, we don't downgrade in bch2_path_get()
1818 if (locks_want > path->locks_want) in bch2_path_get()
1819 bch2_btree_path_upgrade_noupgrade_sibs(trans, path, locks_want, NULL); in bch2_path_get()
1834 struct btree_path *path = trans->paths + path_idx; in bch2_path_get_unlocked_mut() local
1835 bch2_btree_path_downgrade(trans, path); in bch2_path_get_unlocked_mut()
1836 __bch2_btree_path_unlock(trans, path); in bch2_path_get_unlocked_mut()
1840 struct bkey_s_c bch2_btree_path_peek_slot(struct btree_path *path, struct bkey *u) in bch2_btree_path_peek_slot() argument
1843 struct btree_path_level *l = path_l(path); in bch2_btree_path_peek_slot()
1850 EBUG_ON(path->uptodate != BTREE_ITER_UPTODATE); in bch2_btree_path_peek_slot()
1851 EBUG_ON(!btree_node_locked(path, path->level)); in bch2_btree_path_peek_slot()
1853 if (!path->cached) { in bch2_btree_path_peek_slot()
1857 EBUG_ON(k.k && bkey_deleted(k.k) && bpos_eq(k.k->p, path->pos)); in bch2_btree_path_peek_slot()
1859 if (!k.k || !bpos_eq(path->pos, k.k->p)) in bch2_btree_path_peek_slot()
1862 struct bkey_cached *ck = (void *) path->l[0].b; in bch2_btree_path_peek_slot()
1866 EBUG_ON(path->btree_id != ck->key.btree_id || in bch2_btree_path_peek_slot()
1867 !bkey_eq(path->pos, ck->key.pos)); in bch2_btree_path_peek_slot()
1876 u->p = path->pos; in bch2_btree_path_peek_slot()
1884 if (!iter->path || trans->restarted) in bch2_set_btree_iter_dontneed()
1887 struct btree_path *path = btree_iter_path(trans, iter); in bch2_set_btree_iter_dontneed() local
1888 path->preserve = false; in bch2_set_btree_iter_dontneed()
1889 if (path->ref == 1) in bch2_set_btree_iter_dontneed()
1890 path->should_be_locked = false; in bch2_set_btree_iter_dontneed()
1897 return bch2_btree_path_traverse(iter->trans, iter->path, iter->flags); in __bch2_btree_iter_traverse()
1908 iter->path = bch2_btree_path_set_pos(trans, iter->path, in bch2_btree_iter_traverse()
1913 ret = bch2_btree_path_traverse(iter->trans, iter->path, iter->flags); in bch2_btree_iter_traverse()
1917 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_traverse() local
1918 if (btree_path_node(path, path->level)) in bch2_btree_iter_traverse()
1919 btree_path_set_should_be_locked(trans, path); in bch2_btree_iter_traverse()
1931 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_peek_node()
1934 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_peek_node()
1938 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_peek_node() local
1939 b = btree_path_node(path, path->level); in bch2_btree_iter_peek_node()
1948 iter->path = bch2_btree_path_set_pos(trans, iter->path, b->key.k.p, in bch2_btree_iter_peek_node()
1980 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_next_node()
1984 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_next_node()
1989 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node() local
1992 if (!btree_path_node(path, path->level)) in bch2_btree_iter_next_node()
1996 if (!btree_path_node(path, path->level + 1)) { in bch2_btree_iter_next_node()
1997 btree_path_set_level_up(trans, path); in bch2_btree_iter_next_node()
2001 if (!bch2_btree_node_relock(trans, path, path->level + 1)) { in bch2_btree_iter_next_node()
2002 __bch2_btree_path_unlock(trans, path); in bch2_btree_iter_next_node()
2003 path->l[path->level].b = ERR_PTR(-BCH_ERR_no_btree_node_relock); in bch2_btree_iter_next_node()
2004 path->l[path->level + 1].b = ERR_PTR(-BCH_ERR_no_btree_node_relock); in bch2_btree_iter_next_node()
2005 btree_path_set_dirty(path, BTREE_ITER_NEED_TRAVERSE); in bch2_btree_iter_next_node()
2006 trace_and_count(trans->c, trans_restart_relock_next_node, trans, _THIS_IP_, path); in bch2_btree_iter_next_node()
2011 b = btree_path_node(path, path->level + 1); in bch2_btree_iter_next_node()
2014 __btree_path_set_level_up(trans, path, path->level++); in bch2_btree_iter_next_node()
2016 if (btree_lock_want(path, path->level + 1) == BTREE_NODE_UNLOCKED) in bch2_btree_iter_next_node()
2017 btree_node_unlock(trans, path, path->level + 1); in bch2_btree_iter_next_node()
2023 iter->path = bch2_btree_path_set_pos(trans, iter->path, in bch2_btree_iter_next_node()
2028 path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node()
2029 btree_path_set_level_down(trans, path, iter->min_depth); in bch2_btree_iter_next_node()
2031 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_next_node()
2035 path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node()
2036 b = path->l[path->level].b; in bch2_btree_iter_next_node()
2042 iter->path = bch2_btree_path_set_pos(trans, iter->path, b->key.k.p, in bch2_btree_iter_next_node()
2105 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_trans_peek_updates() local
2106 struct bpos end = path_l(path)->b->key.k.p; in bch2_btree_trans_peek_updates()
2111 bpos_ge(i->k->k.p, path->pos) && in bch2_btree_trans_peek_updates()
2135 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_journal_peek() local
2138 path->level, in bch2_btree_journal_peek()
2139 path->pos, in bch2_btree_journal_peek()
2148 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_slot_journal() local
2149 struct bkey_i *k = bch2_btree_journal_peek(trans, iter, path->pos); in btree_trans_peek_slot_journal()
2164 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_journal() local
2167 k->k ? k->k->p : path_l(path)->b->key.k.p); in btree_trans_peek_journal()
2178 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_journal_peek_prev() local
2181 path->level, in bch2_btree_journal_peek_prev()
2182 path->pos, in bch2_btree_journal_peek_prev()
2192 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_prev_journal() local
2195 k->k ? k->k->p : path_l(path)->b->key.k.p); in btree_trans_peek_prev_journal()
2266 iter->path = bch2_btree_path_set_pos(trans, iter->path, search_key, in __bch2_btree_iter_peek()
2270 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in __bch2_btree_iter_peek()
2278 struct btree_path *path = btree_iter_path(trans, iter); in __bch2_btree_iter_peek() local
2279 struct btree_path_level *l = path_l(path); in __bch2_btree_iter_peek()
2288 btree_path_set_should_be_locked(trans, path); in __bch2_btree_iter_peek()
2415 * advance, same as on exit for iter->path, but only up in bch2_btree_iter_peek_max()
2418 __btree_path_get(trans, trans->paths + iter->path, iter->flags & BTREE_ITER_intent); in bch2_btree_iter_peek_max()
2419 iter->update_path = iter->path; in bch2_btree_iter_peek_max()
2470 iter->path = bch2_btree_path_set_pos(trans, iter->path, k.k->p, in bch2_btree_iter_peek_max()
2525 iter->path = bch2_btree_path_set_pos(trans, iter->path, search_key, in __bch2_btree_iter_peek_prev()
2529 int ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in __bch2_btree_iter_peek_prev()
2537 struct btree_path *path = btree_iter_path(trans, iter); in __bch2_btree_iter_peek_prev() local
2538 struct btree_path_level *l = path_l(path); in __bch2_btree_iter_peek_prev()
2547 btree_path_set_should_be_locked(trans, path); in __bch2_btree_iter_peek_prev()
2551 k = btree_path_level_prev(trans, path, l, &iter->k); in __bch2_btree_iter_peek_prev()
2577 } else if (likely(!bpos_eq(path->l[0].b->data->min_key, POS_MIN))) { in __bch2_btree_iter_peek_prev()
2579 search_key = bpos_predecessor(path->l[0].b->data->min_key); in __bch2_btree_iter_peek_prev()
2652 bch2_path_put_nokeep(trans, iter->path, in bch2_btree_iter_peek_prev_min()
2654 iter->path = saved_path; in bch2_btree_iter_peek_prev_min()
2688 saved_path = btree_path_clone(trans, iter->path, in bch2_btree_iter_peek_prev_min()
2692 trans->paths + iter->path, in bch2_btree_iter_peek_prev_min()
2780 iter->path = bch2_btree_path_set_pos(trans, iter->path, search_key, in bch2_btree_iter_peek_slot()
2784 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_peek_slot()
2790 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_peek_slot() local
2791 if (unlikely(!btree_path_node(path, path->level))) in bch2_btree_iter_peek_slot()
2813 /* We're not returning a key from iter->path: */ in bch2_btree_iter_peek_slot()
2817 k = bch2_btree_path_peek_slot(trans->paths + iter->path, &iter->k); in bch2_btree_iter_peek_slot()
2924 struct btree_path *path; in btree_trans_verify_sorted_refs() local
2929 trans_for_each_path(trans, path, i) { in btree_trans_verify_sorted_refs()
2930 BUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_trans_verify_sorted_refs()
2931 BUG_ON(trans->sorted[path->sorted_idx] != i); in btree_trans_verify_sorted_refs()
2944 struct btree_path *path, *prev = NULL; in btree_trans_verify_sorted() local
2950 trans_for_each_path_inorder(trans, path, iter) { in btree_trans_verify_sorted()
2951 if (prev && btree_path_cmp(prev, path) > 0) { in btree_trans_verify_sorted()
2955 prev = path; in btree_trans_verify_sorted()
3005 struct btree_path *path) in btree_path_list_remove() argument
3007 EBUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_path_list_remove()
3010 memmove_u64s_down_small(trans->sorted + path->sorted_idx, in btree_path_list_remove()
3011 trans->sorted + path->sorted_idx + 1, in btree_path_list_remove()
3012 DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx, in btree_path_list_remove()
3015 array_remove_item(trans->sorted, trans->nr_sorted, path->sorted_idx); in btree_path_list_remove()
3017 for (unsigned i = path->sorted_idx; i < trans->nr_sorted; i++) in btree_path_list_remove()
3025 struct btree_path *path = trans->paths + path_idx; in btree_path_list_add() local
3027 path->sorted_idx = pos ? trans->paths[pos].sorted_idx + 1 : trans->nr_sorted; in btree_path_list_add()
3030 memmove_u64s_up_small(trans->sorted + path->sorted_idx + 1, in btree_path_list_add()
3031 trans->sorted + path->sorted_idx, in btree_path_list_add()
3032 DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx, in btree_path_list_add()
3035 trans->sorted[path->sorted_idx] = path_idx; in btree_path_list_add()
3037 array_insert_item(trans->sorted, trans->nr_sorted, path->sorted_idx, path_idx); in btree_path_list_add()
3040 for (unsigned i = path->sorted_idx; i < trans->nr_sorted; i++) in btree_path_list_add()
3051 if (iter->path) in bch2_trans_iter_exit()
3052 bch2_path_put(trans, iter->path, in bch2_trans_iter_exit()
3057 iter->path = 0; in bch2_trans_iter_exit()
3094 struct btree_path *path = btree_iter_path(trans, iter); in bch2_trans_node_iter_init() local
3095 BUG_ON(path->locks_want < min(locks_want, BTREE_MAX_DEPTH)); in bch2_trans_node_iter_init()
3096 BUG_ON(path->level != depth); in bch2_trans_node_iter_init()
3108 if (src->path) in bch2_trans_copy_iter()
3109 __btree_path_get(trans, trans->paths + src->path, src->flags & BTREE_ITER_intent); in bch2_trans_copy_iter()
3209 struct btree_path *path; in bch2_trans_srcu_unlock() local
3212 trans_for_each_path(trans, path, i) in bch2_trans_srcu_unlock()
3213 if (path->cached && !btree_node_locked(path, 0)) in bch2_trans_srcu_unlock()
3214 path->l[0].b = ERR_PTR(-BCH_ERR_no_btree_node_srcu_reset); in bch2_trans_srcu_unlock()
3243 struct btree_path *path; in bch2_trans_begin() local
3253 trans_for_each_path(trans, path, i) { in bch2_trans_begin()
3254 path->should_be_locked = false; in bch2_trans_begin()
3261 if (!trans->restarted && path->btree_id != BTREE_ID_subvolumes) in bch2_trans_begin()
3262 path->preserve = false; in bch2_trans_begin()
3269 if (!path->ref && !path->preserve) in bch2_trans_begin()
3272 path->preserve = false; in bch2_trans_begin()
3359 * but the data move path calls bch2_write when we in __bch2_trans_get()
3421 struct btree_path *path; in check_btree_paths_leaked() local
3424 trans_for_each_path(trans, path, i) in check_btree_paths_leaked()
3425 if (path->ref) in check_btree_paths_leaked()
3430 trans_for_each_path(trans, path, i) in check_btree_paths_leaked()
3431 if (path->ref) in check_btree_paths_leaked()
3433 bch2_btree_id_str(path->btree_id), in check_btree_paths_leaked()
3434 (void *) path->ip_allocated); in check_btree_paths_leaked()
3451 __btree_path_put(trans, trans->paths + i->path, true); in bch2_trans_put()
3565 struct btree_path *path = paths + idx; in bch2_btree_trans_to_text() local
3566 if (!path->nodes_locked) in bch2_btree_trans_to_text()
3569 prt_printf(out, " path %u %c ", in bch2_btree_trans_to_text()
3571 path->cached ? 'c' : 'b'); in bch2_btree_trans_to_text()
3572 bch2_btree_id_to_text(out, path->btree_id); in bch2_btree_trans_to_text()
3573 prt_printf(out, " l=%u:", path->level); in bch2_btree_trans_to_text()
3574 bch2_bpos_to_text(out, path->pos); in bch2_btree_trans_to_text()
3578 if (btree_node_locked(path, l) && in bch2_btree_trans_to_text()
3579 !IS_ERR_OR_NULL(b = (void *) READ_ONCE(path->l[l].b))) { in bch2_btree_trans_to_text()
3581 lock_types[btree_node_locked_type(path, l)], l); in bch2_btree_trans_to_text()