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()
332 struct btree_path *path; in bch2_assert_pos_locked() local
338 trans_for_each_path_inorder(trans, path, iter) { in bch2_assert_pos_locked()
339 if (path->btree_id != id || in bch2_assert_pos_locked()
340 !btree_node_locked(path, 0) || in bch2_assert_pos_locked()
341 !path->should_be_locked) in bch2_assert_pos_locked()
344 if (!path->cached) { in bch2_assert_pos_locked()
345 if (bkey_ge(pos, path->l[0].b->data->min_key) && in bch2_assert_pos_locked()
346 bkey_le(pos, path->l[0].b->key.k.p)) in bch2_assert_pos_locked()
349 if (bkey_eq(pos, path->pos)) in bch2_assert_pos_locked()
363 struct btree_path *path, unsigned l) {} in bch2_btree_path_verify_level() argument
365 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_prev() argument
573 path->pos = k.k ? k.k->p : l->b->data->min_key; in btree_path_level_prev()
575 bch2_btree_path_verify_level(trans, path, l - path->l); in btree_path_level_prev()
579 static inline bool btree_path_advance_to_pos(struct btree_path *path, in btree_path_advance_to_pos() argument
587 bkey_iter_pos_cmp(l->b, k, &path->pos) < 0) { in btree_path_advance_to_pos()
598 static inline void __btree_path_level_init(struct btree_path *path, in __btree_path_level_init() argument
601 struct btree_path_level *l = &path->l[level]; in __btree_path_level_init()
603 bch2_btree_node_iter_init(&l->iter, l->b, &path->pos); in __btree_path_level_init()
614 struct btree_path *path, in bch2_btree_path_level_init() argument
617 BUG_ON(path->cached); in bch2_btree_path_level_init()
619 EBUG_ON(!btree_path_pos_in_node(path, b)); in bch2_btree_path_level_init()
621 path->l[b->c.level].lock_seq = six_lock_seq(&b->c.lock); in bch2_btree_path_level_init()
622 path->l[b->c.level].b = b; in bch2_btree_path_level_init()
623 __btree_path_level_init(path, b->c.level); in bch2_btree_path_level_init()
626 /* Btree path: fixups after btree node updates: */
638 i->old_v = bch2_btree_path_peek_slot(trans->paths + i->path, &i->old_k).v; in bch2_trans_revalidate_updates_in_node()
658 struct btree_path *path, in bch2_trans_node_add() argument
663 BUG_ON(!btree_path_pos_in_node(path, b)); in bch2_trans_node_add()
665 while ((prev = prev_btree_path(trans, path)) && in bch2_trans_node_add()
667 path = prev; in bch2_trans_node_add()
670 path && btree_path_pos_in_node(path, b); in bch2_trans_node_add()
671 path = next_btree_path(trans, path)) in bch2_trans_node_add()
672 if (path->uptodate == BTREE_ITER_UPTODATE && !path->cached) { in bch2_trans_node_add()
674 btree_lock_want(path, b->c.level); in bch2_trans_node_add()
677 btree_node_unlock(trans, path, b->c.level); in bch2_trans_node_add()
679 mark_btree_node_locked(trans, path, b->c.level, t); in bch2_trans_node_add()
682 bch2_btree_path_level_init(trans, path, b); in bch2_trans_node_add()
691 struct btree_path *path; in bch2_trans_node_drop() local
694 trans_for_each_path(trans, path, i) in bch2_trans_node_drop()
695 if (path->l[level].b == b) { in bch2_trans_node_drop()
696 btree_node_unlock(trans, path, level); in bch2_trans_node_drop()
697 path->l[level].b = ERR_PTR(-BCH_ERR_no_btree_node_init); in bch2_trans_node_drop()
707 struct btree_path *path; in bch2_trans_node_reinit_iter() local
710 trans_for_each_path_with_node(trans, b, path, i) in bch2_trans_node_reinit_iter()
711 __btree_path_level_init(path, b->c.level); in bch2_trans_node_reinit_iter()
716 /* Btree path: traverse, set_pos: */
719 struct btree_path *path, in btree_path_lock_root() argument
724 struct btree_root *r = bch2_btree_id_root(c, path->btree_id); in btree_path_lock_root()
729 EBUG_ON(path->nodes_locked); in btree_path_lock_root()
738 path->level = READ_ONCE(b->c.level); in btree_path_lock_root()
740 if (unlikely(path->level < depth_want)) { in btree_path_lock_root()
747 path->level = depth_want; in btree_path_lock_root()
748 for (i = path->level; i < BTREE_MAX_DEPTH; i++) in btree_path_lock_root()
749 path->l[i].b = NULL; in btree_path_lock_root()
753 lock_type = __btree_lock_want(path, path->level); in btree_path_lock_root()
754 ret = btree_node_lock(trans, path, &b->c, in btree_path_lock_root()
755 path->level, lock_type, trace_ip); in btree_path_lock_root()
763 b->c.level == path->level && in btree_path_lock_root()
765 for (i = 0; i < path->level; i++) in btree_path_lock_root()
766 path->l[i].b = ERR_PTR(-BCH_ERR_no_btree_node_lock_root); in btree_path_lock_root()
767 path->l[path->level].b = b; in btree_path_lock_root()
768 for (i = path->level + 1; i < BTREE_MAX_DEPTH; i++) in btree_path_lock_root()
769 path->l[i].b = NULL; in btree_path_lock_root()
771 mark_btree_node_locked(trans, path, path->level, in btree_path_lock_root()
773 bch2_btree_path_level_init(trans, path, b); in btree_path_lock_root()
782 static int btree_path_prefetch(struct btree_trans *trans, struct btree_path *path) in btree_path_prefetch() argument
785 struct btree_path_level *l = path_l(path); in btree_path_prefetch()
790 ? (path->level > 1 ? 0 : 2) in btree_path_prefetch()
791 : (path->level > 1 ? 1 : 16); in btree_path_prefetch()
792 bool was_locked = btree_node_locked(path, path->level); in btree_path_prefetch()
798 if (!bch2_btree_node_relock(trans, path, path->level)) in btree_path_prefetch()
807 ret = bch2_btree_node_prefetch(trans, path, tmp.k, path->btree_id, in btree_path_prefetch()
808 path->level - 1); in btree_path_prefetch()
812 btree_node_unlock(trans, path, path->level); in btree_path_prefetch()
818 static int btree_path_prefetch_j(struct btree_trans *trans, struct btree_path *path, in btree_path_prefetch_j() argument
825 ? (path->level > 1 ? 0 : 2) in btree_path_prefetch_j()
826 : (path->level > 1 ? 1 : 16); in btree_path_prefetch_j()
827 bool was_locked = btree_node_locked(path, path->level); in btree_path_prefetch_j()
835 if (!bch2_btree_node_relock(trans, path, path->level)) in btree_path_prefetch_j()
844 ret = bch2_btree_node_prefetch(trans, path, tmp.k, path->btree_id, in btree_path_prefetch_j()
845 path->level - 1); in btree_path_prefetch_j()
849 btree_node_unlock(trans, path, path->level); in btree_path_prefetch_j()
856 struct btree_path *path, in btree_node_mem_ptr_set() argument
859 struct btree_path_level *l = &path->l[plevel]; in btree_node_mem_ptr_set()
860 bool locked = btree_node_locked(path, plevel); in btree_node_mem_ptr_set()
864 if (!bch2_btree_node_relock(trans, path, plevel)) in btree_node_mem_ptr_set()
874 btree_node_unlock(trans, path, plevel); in btree_node_mem_ptr_set()
878 struct btree_path *path, in btree_node_iter_and_journal_peek() argument
883 struct btree_path_level *l = path_l(path); in btree_node_iter_and_journal_peek()
888 __bch2_btree_and_journal_iter_init_node_iter(trans, &jiter, l->b, l->iter, path->pos); in btree_node_iter_and_journal_peek()
895 bch2_bpos_to_text(&buf, path->pos); in btree_node_iter_and_journal_peek()
908 ret = btree_path_prefetch_j(trans, path, &jiter); in btree_node_iter_and_journal_peek()
916 struct btree_path *path, in btree_path_down() argument
921 struct btree_path_level *l = path_l(path); in btree_path_down()
923 unsigned level = path->level - 1; in btree_path_down()
924 enum six_lock_type lock_type = __btree_lock_want(path, level); in btree_path_down()
928 EBUG_ON(!btree_node_locked(path, path->level)); in btree_path_down()
933 ret = btree_node_iter_and_journal_peek(trans, path, flags, &tmp); in btree_path_down()
942 bch2_bpos_to_text(&buf, path->pos); in btree_path_down()
956 ret = btree_path_prefetch(trans, path); in btree_path_down()
962 b = bch2_btree_node_get(trans, path, tmp.k, level, lock_type, trace_ip); in btree_path_down()
970 btree_node_mem_ptr_set(trans, path, level + 1, b); in btree_path_down()
972 if (btree_node_read_locked(path, level + 1)) in btree_path_down()
973 btree_node_unlock(trans, path, level + 1); in btree_path_down()
975 mark_btree_node_locked(trans, path, level, in btree_path_down()
977 path->level = level; in btree_path_down()
978 bch2_btree_path_level_init(trans, path, b); in btree_path_down()
980 bch2_btree_path_verify_locks(path); in btree_path_down()
989 struct btree_path *path; in bch2_btree_path_traverse_all() local
1002 trans_for_each_path(trans, path, i) in bch2_btree_path_traverse_all()
1003 path->should_be_locked = false; in bch2_btree_path_traverse_all()
1028 * Traversing a path can cause another path to be added at about in bch2_btree_path_traverse_all()
1048 * (path->uptodate < BTREE_ITER_NEED_TRAVERSE); however, since in bch2_btree_path_traverse_all()
1049 * path->should_be_locked is not set yet, we might have unlocked and in bch2_btree_path_traverse_all()
1050 * then failed to relock a path - that's fine. in bch2_btree_path_traverse_all()
1061 static inline bool btree_path_check_pos_in_node(struct btree_path *path, in btree_path_check_pos_in_node() argument
1064 if (check_pos < 0 && btree_path_pos_before_node(path, path->l[l].b)) in btree_path_check_pos_in_node()
1066 if (check_pos > 0 && btree_path_pos_after_node(path, path->l[l].b)) in btree_path_check_pos_in_node()
1072 struct btree_path *path, in btree_path_good_node() argument
1075 return is_btree_node(path, l) && in btree_path_good_node()
1076 bch2_btree_node_relock(trans, path, l) && in btree_path_good_node()
1077 btree_path_check_pos_in_node(path, l, check_pos); in btree_path_good_node()
1081 struct btree_path *path, in btree_path_set_level_down() argument
1086 path->level = new_level; in btree_path_set_level_down()
1088 for (l = path->level + 1; l < BTREE_MAX_DEPTH; l++) in btree_path_set_level_down()
1089 if (btree_lock_want(path, l) == BTREE_NODE_UNLOCKED) in btree_path_set_level_down()
1090 btree_node_unlock(trans, path, l); in btree_path_set_level_down()
1092 btree_path_set_dirty(path, BTREE_ITER_NEED_TRAVERSE); in btree_path_set_level_down()
1093 bch2_btree_path_verify(trans, path); in btree_path_set_level_down()
1097 struct btree_path *path, in __btree_path_up_until_good_node() argument
1100 unsigned i, l = path->level; in __btree_path_up_until_good_node()
1102 while (btree_path_node(path, l) && in __btree_path_up_until_good_node()
1103 !btree_path_good_node(trans, path, l, check_pos)) in __btree_path_up_until_good_node()
1104 __btree_path_set_level_up(trans, path, l++); in __btree_path_up_until_good_node()
1108 i < path->locks_want && btree_path_node(path, i); in __btree_path_up_until_good_node()
1110 if (!bch2_btree_node_relock(trans, path, i)) { in __btree_path_up_until_good_node()
1112 __btree_path_set_level_up(trans, path, l++); in __btree_path_up_until_good_node()
1120 struct btree_path *path, in btree_path_up_until_good_node() argument
1123 return likely(btree_node_locked(path, path->level) && in btree_path_up_until_good_node()
1124 btree_path_check_pos_in_node(path, path->level, check_pos)) in btree_path_up_until_good_node()
1125 ? path->level in btree_path_up_until_good_node()
1126 : __btree_path_up_until_good_node(trans, path, check_pos); in btree_path_up_until_good_node()
1143 struct btree_path *path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one() local
1144 unsigned depth_want = path->level; in bch2_btree_path_traverse_one()
1153 trace_btree_path_traverse_start(trans, path); in bch2_btree_path_traverse_one()
1156 * Ensure we obey path->should_be_locked: if it's set, we can't unlock in bch2_btree_path_traverse_one()
1157 * and re-traverse the path without a transaction restart: in bch2_btree_path_traverse_one()
1159 if (path->should_be_locked) { in bch2_btree_path_traverse_one()
1160 ret = bch2_btree_path_relock(trans, path, trace_ip); in bch2_btree_path_traverse_one()
1164 if (path->cached) { in bch2_btree_path_traverse_one()
1169 path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one()
1171 if (unlikely(path->level >= BTREE_MAX_DEPTH)) in bch2_btree_path_traverse_one()
1174 path->level = btree_path_up_until_good_node(trans, path, 0); in bch2_btree_path_traverse_one()
1175 unsigned max_level = path->level; in bch2_btree_path_traverse_one()
1177 EBUG_ON(btree_path_node(path, path->level) && in bch2_btree_path_traverse_one()
1178 !btree_node_locked(path, path->level)); in bch2_btree_path_traverse_one()
1181 * Note: path->nodes[path->level] may be temporarily NULL here - that in bch2_btree_path_traverse_one()
1186 while (path->level > depth_want) { in bch2_btree_path_traverse_one()
1187 ret = btree_path_node(path, path->level) in bch2_btree_path_traverse_one()
1188 ? btree_path_down(trans, path, flags, trace_ip) in bch2_btree_path_traverse_one()
1189 : btree_path_lock_root(trans, path, depth_want, trace_ip); in bch2_btree_path_traverse_one()
1200 __bch2_btree_path_unlock(trans, path); in bch2_btree_path_traverse_one()
1201 path->level = depth_want; in bch2_btree_path_traverse_one()
1202 path->l[path->level].b = ERR_PTR(ret); in bch2_btree_path_traverse_one()
1207 if (unlikely(max_level > path->level)) { in bch2_btree_path_traverse_one()
1211 trans_for_each_path_with_node(trans, path_l(path)->b, linked, iter) in bch2_btree_path_traverse_one()
1212 for (unsigned j = path->level + 1; j < max_level; j++) in bch2_btree_path_traverse_one()
1213 linked->l[j] = path->l[j]; in bch2_btree_path_traverse_one()
1217 path->uptodate = BTREE_ITER_UPTODATE; in bch2_btree_path_traverse_one()
1218 trace_btree_path_traverse_end(trans, path); in bch2_btree_path_traverse_one()
1224 bch2_btree_path_verify(trans, path); in bch2_btree_path_traverse_one()
1259 btree_path_idx_t path, bool intent, unsigned long ip) in __bch2_btree_path_make_mut() argument
1261 struct btree_path *old = trans->paths + path; in __bch2_btree_path_make_mut()
1262 __btree_path_put(trans, trans->paths + path, intent); in __bch2_btree_path_make_mut()
1263 path = btree_path_clone(trans, path, intent, ip); in __bch2_btree_path_make_mut()
1264 trace_btree_path_clone(trans, old, trans->paths + path); in __bch2_btree_path_make_mut()
1265 trans->paths[path].preserve = false; in __bch2_btree_path_make_mut()
1266 return path; in __bch2_btree_path_make_mut()
1283 struct btree_path *path = trans->paths + path_idx; in __bch2_btree_path_set_pos() local
1284 path->pos = new_pos; in __bch2_btree_path_set_pos()
1287 if (unlikely(path->cached)) { in __bch2_btree_path_set_pos()
1288 btree_node_unlock(trans, path, 0); in __bch2_btree_path_set_pos()
1289 path->l[0].b = ERR_PTR(-BCH_ERR_no_btree_node_up); in __bch2_btree_path_set_pos()
1290 btree_path_set_dirty(path, BTREE_ITER_NEED_TRAVERSE); in __bch2_btree_path_set_pos()
1294 unsigned level = btree_path_up_until_good_node(trans, path, cmp); in __bch2_btree_path_set_pos()
1296 if (btree_path_node(path, level)) { in __bch2_btree_path_set_pos()
1297 struct btree_path_level *l = &path->l[level]; in __bch2_btree_path_set_pos()
1299 BUG_ON(!btree_node_locked(path, level)); in __bch2_btree_path_set_pos()
1307 !btree_path_advance_to_pos(path, l, 8)) in __bch2_btree_path_set_pos()
1308 bch2_btree_node_iter_init(&l->iter, l->b, &path->pos); in __bch2_btree_path_set_pos()
1318 if (unlikely(level != path->level)) { in __bch2_btree_path_set_pos()
1319 btree_path_set_dirty(path, BTREE_ITER_NEED_TRAVERSE); in __bch2_btree_path_set_pos()
1320 __bch2_btree_path_unlock(trans, path); in __bch2_btree_path_set_pos()
1323 bch2_btree_path_verify(trans, path); in __bch2_btree_path_set_pos()
1327 /* Btree path: main interface: */
1329 static struct btree_path *have_path_at_pos(struct btree_trans *trans, struct btree_path *path) in have_path_at_pos() argument
1333 sib = prev_btree_path(trans, path); in have_path_at_pos()
1334 if (sib && !btree_path_cmp(sib, path)) in have_path_at_pos()
1337 sib = next_btree_path(trans, path); in have_path_at_pos()
1338 if (sib && !btree_path_cmp(sib, path)) in have_path_at_pos()
1344 static struct btree_path *have_node_at_pos(struct btree_trans *trans, struct btree_path *path) in have_node_at_pos() argument
1348 sib = prev_btree_path(trans, path); in have_node_at_pos()
1349 if (sib && sib->level == path->level && path_l(sib)->b == path_l(path)->b) in have_node_at_pos()
1352 sib = next_btree_path(trans, path); in have_node_at_pos()
1353 if (sib && sib->level == path->level && path_l(sib)->b == path_l(path)->b) in have_node_at_pos()
1359 static inline void __bch2_path_free(struct btree_trans *trans, btree_path_idx_t path) in __bch2_path_free() argument
1361 __bch2_btree_path_unlock(trans, trans->paths + path); in __bch2_path_free()
1362 btree_path_list_remove(trans, trans->paths + path); in __bch2_path_free()
1363 __clear_bit(path, trans->paths_allocated); in __bch2_path_free()
1366 static bool bch2_btree_path_can_relock(struct btree_trans *trans, struct btree_path *path) in bch2_btree_path_can_relock() argument
1368 unsigned l = path->level; in bch2_btree_path_can_relock()
1371 if (!btree_path_node(path, l)) in bch2_btree_path_can_relock()
1374 if (!is_btree_node(path, l)) in bch2_btree_path_can_relock()
1377 if (path->l[l].lock_seq != path->l[l].b->c.lock.seq) in bch2_btree_path_can_relock()
1381 } while (l < path->locks_want); in bch2_btree_path_can_relock()
1388 struct btree_path *path = trans->paths + path_idx, *dup; in bch2_path_put() local
1390 if (!__btree_path_put(trans, path, intent)) in bch2_path_put()
1393 dup = path->preserve in bch2_path_put()
1394 ? have_path_at_pos(trans, path) in bch2_path_put()
1395 : have_node_at_pos(trans, path); in bch2_path_put()
1399 if (!dup && !(!path->preserve && !is_btree_node(path, path->level))) in bch2_path_put()
1402 if (path->should_be_locked && !trans->restarted) { in bch2_path_put()
1413 dup->preserve |= path->preserve; in bch2_path_put()
1414 dup->should_be_locked |= path->should_be_locked; in bch2_path_put()
1420 static void bch2_path_put_nokeep(struct btree_trans *trans, btree_path_idx_t path, in bch2_path_put_nokeep() argument
1423 if (!__btree_path_put(trans, trans->paths + path, intent)) in bch2_path_put_nokeep()
1426 __bch2_path_free(trans, path); in bch2_path_put_nokeep()
1500 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text_short() local
1502 prt_printf(out, "path: idx %3u ref %u:%u %c %c %c ", in bch2_btree_path_to_text_short()
1503 path_idx, path->ref, path->intent_ref, in bch2_btree_path_to_text_short()
1504 path->preserve ? 'P' : ' ', in bch2_btree_path_to_text_short()
1505 path->should_be_locked ? 'S' : ' ', in bch2_btree_path_to_text_short()
1506 path->cached ? 'C' : 'B'); in bch2_btree_path_to_text_short()
1507 bch2_btree_id_level_to_text(out, path->btree_id, path->level); in bch2_btree_path_to_text_short()
1509 bch2_bpos_to_text(out, path->pos); in bch2_btree_path_to_text_short()
1511 if (!path->cached && btree_node_locked(path, path->level)) { in bch2_btree_path_to_text_short()
1513 struct btree *b = path_l(path)->b; in bch2_btree_path_to_text_short()
1520 prt_printf(out, " %pS", (void *) path->ip_allocated); in bch2_btree_path_to_text_short()
1544 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text() local
1546 prt_printf(out, " uptodate %u locks_want %u", path->uptodate, path->locks_want); in bch2_btree_path_to_text()
1552 btree_node_locked_str(btree_node_locked_type(path, l)), in bch2_btree_path_to_text()
1553 path->l[l].lock_seq); in bch2_btree_path_to_text()
1555 int ret = PTR_ERR_OR_ZERO(path->l[l].b); in bch2_btree_path_to_text()
1559 prt_printf(out, "%px", path->l[l].b); in bch2_btree_path_to_text()
1646 bch_err(trans->c, "trans path overflow"); in btree_path_overflow()
1704 * Do this before marking the new path as allocated, since it won't be in btree_path_alloc()
1712 struct btree_path *path = &trans->paths[idx]; in btree_path_alloc() local
1713 path->ref = 0; in btree_path_alloc()
1714 path->intent_ref = 0; in btree_path_alloc()
1715 path->nodes_locked = 0; in btree_path_alloc()
1727 struct btree_path *path; in bch2_path_get() local
1738 trans_for_each_path_inorder(trans, path, iter) { in bch2_path_get()
1739 if (__btree_path_cmp(path, in bch2_path_get()
1757 path = trans->paths + path_idx; in bch2_path_get()
1760 path = trans->paths + path_idx; in bch2_path_get()
1762 __btree_path_get(trans, path, intent); in bch2_path_get()
1763 path->pos = pos; in bch2_path_get()
1764 path->btree_id = btree_id; in bch2_path_get()
1765 path->cached = cached; in bch2_path_get()
1766 path->uptodate = BTREE_ITER_NEED_TRAVERSE; in bch2_path_get()
1767 path->should_be_locked = false; in bch2_path_get()
1768 path->level = level; in bch2_path_get()
1769 path->locks_want = locks_want; in bch2_path_get()
1770 path->nodes_locked = 0; in bch2_path_get()
1771 for (unsigned i = 0; i < ARRAY_SIZE(path->l); i++) in bch2_path_get()
1772 path->l[i].b = ERR_PTR(-BCH_ERR_no_btree_node_init); in bch2_path_get()
1774 path->ip_allocated = ip; in bch2_path_get()
1778 trace_btree_path_alloc(trans, path); in bch2_path_get()
1782 path->preserve = true; in bch2_path_get()
1784 if (path->intent_ref) in bch2_path_get()
1788 * If the path has locks_want greater than requested, we don't downgrade in bch2_path_get()
1796 if (locks_want > path->locks_want) in bch2_path_get()
1797 bch2_btree_path_upgrade_noupgrade_sibs(trans, path, locks_want, NULL); in bch2_path_get()
1812 struct btree_path *path = trans->paths + path_idx; in bch2_path_get_unlocked_mut() local
1813 bch2_btree_path_downgrade(trans, path); in bch2_path_get_unlocked_mut()
1814 __bch2_btree_path_unlock(trans, path); in bch2_path_get_unlocked_mut()
1818 struct bkey_s_c bch2_btree_path_peek_slot(struct btree_path *path, struct bkey *u) in bch2_btree_path_peek_slot() argument
1821 struct btree_path_level *l = path_l(path); in bch2_btree_path_peek_slot()
1828 EBUG_ON(path->uptodate != BTREE_ITER_UPTODATE); in bch2_btree_path_peek_slot()
1829 EBUG_ON(!btree_node_locked(path, path->level)); in bch2_btree_path_peek_slot()
1831 if (!path->cached) { in bch2_btree_path_peek_slot()
1835 EBUG_ON(k.k && bkey_deleted(k.k) && bpos_eq(k.k->p, path->pos)); in bch2_btree_path_peek_slot()
1837 if (!k.k || !bpos_eq(path->pos, k.k->p)) in bch2_btree_path_peek_slot()
1840 struct bkey_cached *ck = (void *) path->l[0].b; in bch2_btree_path_peek_slot()
1844 EBUG_ON(path->btree_id != ck->key.btree_id || in bch2_btree_path_peek_slot()
1845 !bkey_eq(path->pos, ck->key.pos)); in bch2_btree_path_peek_slot()
1854 u->p = path->pos; in bch2_btree_path_peek_slot()
1860 if (!iter->path || trans->restarted) in bch2_set_btree_iter_dontneed()
1863 struct btree_path *path = btree_iter_path(trans, iter); in bch2_set_btree_iter_dontneed() local
1864 path->preserve = false; in bch2_set_btree_iter_dontneed()
1865 if (path->ref == 1) in bch2_set_btree_iter_dontneed()
1866 path->should_be_locked = false; in bch2_set_btree_iter_dontneed()
1873 return bch2_btree_path_traverse(trans, iter->path, iter->flags); in __bch2_btree_iter_traverse()
1881 iter->path = bch2_btree_path_set_pos(trans, iter->path, in bch2_btree_iter_traverse()
1886 int ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_traverse()
1890 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_traverse() local
1891 if (btree_path_node(path, path->level)) in bch2_btree_iter_traverse()
1892 btree_path_set_should_be_locked(trans, path); in bch2_btree_iter_traverse()
1904 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_peek_node()
1907 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_peek_node()
1911 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_peek_node() local
1912 b = btree_path_node(path, path->level); in bch2_btree_iter_peek_node()
1921 iter->path = bch2_btree_path_set_pos(trans, iter->path, b->key.k.p, in bch2_btree_iter_peek_node()
1953 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_next_node()
1957 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_next_node()
1962 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node() local
1965 if (!btree_path_node(path, path->level)) in bch2_btree_iter_next_node()
1969 if (!btree_path_node(path, path->level + 1)) { in bch2_btree_iter_next_node()
1970 btree_path_set_level_up(trans, path); in bch2_btree_iter_next_node()
1978 bch2_btree_path_downgrade(trans, path); in bch2_btree_iter_next_node()
1980 if (!bch2_btree_node_relock(trans, path, path->level + 1)) { in bch2_btree_iter_next_node()
1981 __bch2_btree_path_unlock(trans, path); in bch2_btree_iter_next_node()
1982 path->l[path->level].b = ERR_PTR(-BCH_ERR_no_btree_node_relock); in bch2_btree_iter_next_node()
1983 path->l[path->level + 1].b = ERR_PTR(-BCH_ERR_no_btree_node_relock); in bch2_btree_iter_next_node()
1984 btree_path_set_dirty(path, BTREE_ITER_NEED_TRAVERSE); in bch2_btree_iter_next_node()
1985 trace_and_count(trans->c, trans_restart_relock_next_node, trans, _THIS_IP_, path); in bch2_btree_iter_next_node()
1990 b = btree_path_node(path, path->level + 1); in bch2_btree_iter_next_node()
1993 __btree_path_set_level_up(trans, path, path->level++); in bch2_btree_iter_next_node()
1995 if (btree_lock_want(path, path->level + 1) == BTREE_NODE_UNLOCKED) in bch2_btree_iter_next_node()
1996 btree_node_unlock(trans, path, path->level + 1); in bch2_btree_iter_next_node()
2002 iter->path = bch2_btree_path_set_pos(trans, iter->path, in bch2_btree_iter_next_node()
2007 path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node()
2008 btree_path_set_level_down(trans, path, iter->min_depth); in bch2_btree_iter_next_node()
2010 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_next_node()
2014 path = btree_iter_path(trans, iter); in bch2_btree_iter_next_node()
2015 b = path->l[path->level].b; in bch2_btree_iter_next_node()
2021 iter->path = bch2_btree_path_set_pos(trans, iter->path, b->key.k.p, in bch2_btree_iter_next_node()
2084 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_trans_peek_updates() local
2085 struct bpos end = path_l(path)->b->key.k.p; in bch2_btree_trans_peek_updates()
2090 bpos_ge(i->k->k.p, path->pos) && in bch2_btree_trans_peek_updates()
2114 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_journal_peek() local
2117 path->level, in bch2_btree_journal_peek()
2118 path->pos, in bch2_btree_journal_peek()
2127 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_slot_journal() local
2128 struct bkey_i *k = bch2_btree_journal_peek(trans, iter, path->pos); in btree_trans_peek_slot_journal()
2143 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_journal() local
2146 k->k ? k->k->p : path_l(path)->b->key.k.p); in btree_trans_peek_journal()
2157 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_journal_peek_prev() local
2160 path->level, in bch2_btree_journal_peek_prev()
2161 path->pos, in bch2_btree_journal_peek_prev()
2171 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_prev_journal() local
2174 k->k ? k->k->p : path_l(path)->b->key.k.p); in btree_trans_peek_prev_journal()
2245 iter->path = bch2_btree_path_set_pos(trans, iter->path, search_key, in __bch2_btree_iter_peek()
2249 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in __bch2_btree_iter_peek()
2257 struct btree_path *path = btree_iter_path(trans, iter); in __bch2_btree_iter_peek() local
2258 struct btree_path_level *l = path_l(path); in __bch2_btree_iter_peek()
2267 btree_path_set_should_be_locked(trans, path); in __bch2_btree_iter_peek()
2395 * advance, same as on exit for iter->path, but only up in bch2_btree_iter_peek_max()
2398 __btree_path_get(trans, trans->paths + iter->path, iter->flags & BTREE_ITER_intent); in bch2_btree_iter_peek_max()
2399 iter->update_path = iter->path; in bch2_btree_iter_peek_max()
2450 iter->path = bch2_btree_path_set_pos(trans, iter->path, k.k->p, in bch2_btree_iter_peek_max()
2506 iter->path = bch2_btree_path_set_pos(trans, iter->path, search_key, in __bch2_btree_iter_peek_prev()
2510 int ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in __bch2_btree_iter_peek_prev()
2518 struct btree_path *path = btree_iter_path(trans, iter); in __bch2_btree_iter_peek_prev() local
2519 struct btree_path_level *l = path_l(path); in __bch2_btree_iter_peek_prev()
2528 btree_path_set_should_be_locked(trans, path); in __bch2_btree_iter_peek_prev()
2532 k = btree_path_level_prev(trans, path, l, &iter->k); in __bch2_btree_iter_peek_prev()
2558 } else if (likely(!bpos_eq(path->l[0].b->data->min_key, POS_MIN))) { in __bch2_btree_iter_peek_prev()
2560 search_key = bpos_predecessor(path->l[0].b->data->min_key); in __bch2_btree_iter_peek_prev()
2637 bch2_path_put_nokeep(trans, iter->path, in bch2_btree_iter_peek_prev_min()
2639 iter->path = saved_path; in bch2_btree_iter_peek_prev_min()
2673 saved_path = btree_path_clone(trans, iter->path, in bch2_btree_iter_peek_prev_min()
2677 trans->paths + iter->path, in bch2_btree_iter_peek_prev_min()
2765 iter->path = bch2_btree_path_set_pos(trans, iter->path, search_key, in bch2_btree_iter_peek_slot()
2769 ret = bch2_btree_path_traverse(trans, iter->path, iter->flags); in bch2_btree_iter_peek_slot()
2775 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_iter_peek_slot() local
2776 if (unlikely(!btree_path_node(path, path->level))) in bch2_btree_iter_peek_slot()
2779 btree_path_set_should_be_locked(trans, path); in bch2_btree_iter_peek_slot()
2800 /* We're not returning a key from iter->path: */ in bch2_btree_iter_peek_slot()
2909 struct btree_path *path; in btree_trans_verify_sorted_refs() local
2914 trans_for_each_path(trans, path, i) { in btree_trans_verify_sorted_refs()
2915 BUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_trans_verify_sorted_refs()
2916 BUG_ON(trans->sorted[path->sorted_idx] != i); in btree_trans_verify_sorted_refs()
2929 struct btree_path *path, *prev = NULL; in btree_trans_verify_sorted() local
2935 trans_for_each_path_inorder(trans, path, iter) { in btree_trans_verify_sorted()
2936 if (prev && btree_path_cmp(prev, path) > 0) { in btree_trans_verify_sorted()
2940 prev = path; in btree_trans_verify_sorted()
2990 struct btree_path *path) in btree_path_list_remove() argument
2992 EBUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_path_list_remove()
2995 memmove_u64s_down_small(trans->sorted + path->sorted_idx, in btree_path_list_remove()
2996 trans->sorted + path->sorted_idx + 1, in btree_path_list_remove()
2997 DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx, in btree_path_list_remove()
3000 array_remove_item(trans->sorted, trans->nr_sorted, path->sorted_idx); in btree_path_list_remove()
3002 for (unsigned i = path->sorted_idx; i < trans->nr_sorted; i++) in btree_path_list_remove()
3010 struct btree_path *path = trans->paths + path_idx; in btree_path_list_add() local
3012 path->sorted_idx = pos ? trans->paths[pos].sorted_idx + 1 : trans->nr_sorted; in btree_path_list_add()
3015 memmove_u64s_up_small(trans->sorted + path->sorted_idx + 1, in btree_path_list_add()
3016 trans->sorted + path->sorted_idx, in btree_path_list_add()
3017 DIV_ROUND_UP(trans->nr_sorted - path->sorted_idx, in btree_path_list_add()
3020 trans->sorted[path->sorted_idx] = path_idx; in btree_path_list_add()
3022 array_insert_item(trans->sorted, trans->nr_sorted, path->sorted_idx, path_idx); in btree_path_list_add()
3025 for (unsigned i = path->sorted_idx; i < trans->nr_sorted; i++) in btree_path_list_add()
3036 if (iter->path) in bch2_trans_iter_exit()
3037 bch2_path_put(trans, iter->path, in bch2_trans_iter_exit()
3042 iter->path = 0; in bch2_trans_iter_exit()
3078 struct btree_path *path = btree_iter_path(trans, iter); in bch2_trans_node_iter_init() local
3079 BUG_ON(path->locks_want < min(locks_want, BTREE_MAX_DEPTH)); in bch2_trans_node_iter_init()
3080 BUG_ON(path->level != depth); in bch2_trans_node_iter_init()
3091 if (src->path) in bch2_trans_copy_iter()
3092 __btree_path_get(trans, trans->paths + src->path, src->flags & BTREE_ITER_intent); in bch2_trans_copy_iter()
3192 struct btree_path *path; in bch2_trans_srcu_unlock() local
3195 trans_for_each_path(trans, path, i) in bch2_trans_srcu_unlock()
3196 if (path->cached && !btree_node_locked(path, 0)) in bch2_trans_srcu_unlock()
3197 path->l[0].b = ERR_PTR(-BCH_ERR_no_btree_node_srcu_reset); in bch2_trans_srcu_unlock()
3226 struct btree_path *path; in bch2_trans_begin() local
3236 trans_for_each_path(trans, path, i) { in bch2_trans_begin()
3237 path->should_be_locked = false; in bch2_trans_begin()
3244 if (!trans->restarted && path->btree_id != BTREE_ID_subvolumes) in bch2_trans_begin()
3245 path->preserve = false; in bch2_trans_begin()
3252 if (!path->ref && !path->preserve) in bch2_trans_begin()
3255 path->preserve = false; in bch2_trans_begin()
3342 * but the data move path calls bch2_write when we in __bch2_trans_get()
3404 struct btree_path *path; in check_btree_paths_leaked() local
3407 trans_for_each_path(trans, path, i) in check_btree_paths_leaked()
3408 if (path->ref) in check_btree_paths_leaked()
3413 trans_for_each_path(trans, path, i) in check_btree_paths_leaked()
3414 if (path->ref) in check_btree_paths_leaked()
3416 bch2_btree_id_str(path->btree_id), in check_btree_paths_leaked()
3417 (void *) path->ip_allocated); in check_btree_paths_leaked()
3434 __btree_path_put(trans, trans->paths + i->path, true); in bch2_trans_put()
3548 struct btree_path *path = paths + idx; in bch2_btree_trans_to_text() local
3549 if (!path->nodes_locked) in bch2_btree_trans_to_text()
3552 prt_printf(out, " path %u %c ", in bch2_btree_trans_to_text()
3554 path->cached ? 'c' : 'b'); in bch2_btree_trans_to_text()
3555 bch2_btree_id_to_text(out, path->btree_id); in bch2_btree_trans_to_text()
3556 prt_printf(out, " l=%u:", path->level); in bch2_btree_trans_to_text()
3557 bch2_bpos_to_text(out, path->pos); in bch2_btree_trans_to_text()
3561 if (btree_node_locked(path, l) && in bch2_btree_trans_to_text()
3562 !IS_ERR_OR_NULL(b = (void *) READ_ONCE(path->l[l].b))) { in bch2_btree_trans_to_text()
3564 lock_types[btree_node_locked_type(path, l)], l); in bch2_btree_trans_to_text()