Lines Matching full:trans
121 static void bch2_btree_path_verify_cached(struct btree_trans *trans, in bch2_btree_path_verify_cached() argument
127 if (!bch2_btree_node_relock(trans, path, 0)) in bch2_btree_path_verify_cached()
135 btree_node_unlock(trans, path, 0); in bch2_btree_path_verify_cached()
138 static void bch2_btree_path_verify_level(struct btree_trans *trans, in bch2_btree_path_verify_level() argument
159 bch2_btree_path_verify_cached(trans, path); in bch2_btree_path_verify_level()
166 if (!bch2_btree_node_relock_notrace(trans, path, level)) in bch2_btree_path_verify_level()
192 btree_node_unlock(trans, path, level); in bch2_btree_path_verify_level()
220 static void bch2_btree_path_verify(struct btree_trans *trans, in bch2_btree_path_verify() argument
223 struct bch_fs *c = trans->c; in bch2_btree_path_verify()
232 bch2_btree_path_verify_level(trans, path, i); in bch2_btree_path_verify()
238 void bch2_trans_verify_paths(struct btree_trans *trans) in bch2_trans_verify_paths() argument
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()
249 struct btree_trans *trans = iter->trans; in bch2_btree_iter_verify() local
251 BUG_ON(!!(iter->flags & BTREE_ITER_cached) != btree_iter_path(trans, iter)->cached); in bch2_btree_iter_verify()
261 bch2_btree_path_verify(trans, &trans->paths[iter->update_path]); in bch2_btree_iter_verify()
262 bch2_btree_path_verify(trans, btree_iter_path(trans, iter)); in bch2_btree_iter_verify()
281 struct btree_trans *trans = iter->trans; in bch2_btree_iter_verify_ret() local
295 BUG_ON(!bch2_snapshot_is_ancestor(trans->c, in bch2_btree_iter_verify_ret()
299 bch2_trans_iter_init(trans, ©, iter->btree_id, iter->pos, in bch2_btree_iter_verify_ret()
311 bch2_snapshot_is_ancestor(trans->c, iter->snapshot, in bch2_btree_iter_verify_ret()
325 bch2_trans_iter_exit(trans, ©); in bch2_btree_iter_verify_ret()
329 void bch2_assert_pos_locked(struct btree_trans *trans, enum btree_id id, in bch2_assert_pos_locked() argument
332 bch2_trans_verify_not_unlocked_or_in_restart(trans); in bch2_assert_pos_locked()
338 btree_trans_sort_paths(trans); in bch2_assert_pos_locked()
340 trans_for_each_path_inorder(trans, path, iter) { in bch2_assert_pos_locked()
356 bch2_dump_trans_paths_updates(trans); in bch2_assert_pos_locked()
364 static inline void bch2_btree_path_verify_level(struct btree_trans *trans, in bch2_btree_path_verify_level() argument
366 static inline void bch2_btree_path_verify(struct btree_trans *trans, in bch2_btree_path_verify() argument
406 void bch2_btree_path_fix_key_modified(struct btree_trans *trans, in bch2_btree_path_fix_key_modified() argument
413 trans_for_each_path_with_node(trans, b, path, i) { 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()
510 void bch2_btree_node_iter_fix(struct btree_trans *trans, in bch2_btree_node_iter_fix() argument
530 trans_for_each_path_with_node(trans, b, linked, i) { in bch2_btree_node_iter_fix()
534 bch2_btree_path_verify_level(trans, linked, b->c.level); in bch2_btree_node_iter_fix()
565 static inline struct bkey_s_c btree_path_level_peek(struct btree_trans *trans, in btree_path_level_peek() argument
570 struct bkey_s_c k = __btree_iter_unpack(trans->c, l, u, in btree_path_level_peek()
574 trans->paths_sorted = false; in btree_path_level_peek()
575 bch2_btree_path_verify_level(trans, path, l - path->l); in btree_path_level_peek()
579 static inline struct bkey_s_c btree_path_level_prev(struct btree_trans *trans, in btree_path_level_prev() argument
584 struct bkey_s_c k = __btree_iter_unpack(trans->c, l, u, in btree_path_level_prev()
588 trans->paths_sorted = false; in btree_path_level_prev()
589 bch2_btree_path_verify_level(trans, path, l - path->l); in btree_path_level_prev()
627 void bch2_btree_path_level_init(struct btree_trans *trans, in bch2_btree_path_level_init() argument
642 static void bch2_trans_revalidate_updates_in_node(struct btree_trans *trans, struct btree *b) in bch2_trans_revalidate_updates_in_node() argument
644 struct bch_fs *c = trans->c; in bch2_trans_revalidate_updates_in_node()
646 trans_for_each_update(trans, i) in bch2_trans_revalidate_updates_in_node()
652 i->old_v = bch2_btree_path_peek_slot(trans->paths + i->path, &i->old_k).v; in bch2_trans_revalidate_updates_in_node()
654 if (unlikely(trans->journal_replay_not_finished)) { in bch2_trans_revalidate_updates_in_node()
671 void bch2_trans_node_add(struct btree_trans *trans, in bch2_trans_node_add() argument
679 while ((prev = prev_btree_path(trans, path)) && in bch2_trans_node_add()
685 path = next_btree_path(trans, path)) 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()
699 bch2_trans_revalidate_updates_in_node(trans, b); in bch2_trans_node_add()
702 void bch2_trans_node_drop(struct btree_trans *trans, in bch2_trans_node_drop() argument
708 trans_for_each_path(trans, path, i) in bch2_trans_node_drop()
710 btree_node_unlock(trans, path, level); in bch2_trans_node_drop()
719 void bch2_trans_node_reinit_iter(struct btree_trans *trans, struct btree *b) in bch2_trans_node_reinit_iter() argument
724 trans_for_each_path_with_node(trans, b, path, i) in bch2_trans_node_reinit_iter()
727 bch2_trans_revalidate_updates_in_node(trans, b); in bch2_trans_node_reinit_iter()
732 static inline int btree_path_lock_root(struct btree_trans *trans, in btree_path_lock_root() argument
737 struct bch_fs *c = trans->c; in btree_path_lock_root()
768 ret = btree_node_lock(trans, path, &b->c, 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
798 struct bch_fs *c = trans->c; 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()
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
835 struct bch_fs *c = trans->c; 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()
863 btree_node_unlock(trans, path, path->level); in btree_path_prefetch_j()
869 static noinline void btree_node_mem_ptr_set(struct btree_trans *trans, in btree_node_mem_ptr_set() argument
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()
891 static noinline int btree_node_iter_and_journal_peek(struct btree_trans *trans, in btree_node_iter_and_journal_peek() argument
896 struct bch_fs *c = trans->c; 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()
922 ret = btree_path_prefetch_j(trans, path, &jiter); in btree_node_iter_and_journal_peek()
929 static __always_inline int btree_path_down(struct btree_trans *trans, in btree_path_down() argument
934 struct bch_fs *c = trans->c; in btree_path_down()
946 if (unlikely(trans->journal_replay_not_finished)) { in btree_path_down()
947 ret = btree_node_iter_and_journal_peek(trans, path, flags, &tmp); 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()
981 if (likely(!trans->journal_replay_not_finished && in btree_path_down()
984 btree_node_mem_ptr_set(trans, path, level + 1, b); 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()
992 bch2_btree_path_level_init(trans, path, b); in btree_path_down()
1000 static int bch2_btree_path_traverse_all(struct btree_trans *trans) in bch2_btree_path_traverse_all() argument
1002 struct bch_fs *c = trans->c; in bch2_btree_path_traverse_all()
1008 if (trans->in_traverse_all) in bch2_btree_path_traverse_all()
1011 trans->in_traverse_all = true; in bch2_btree_path_traverse_all()
1013 trans->restarted = 0; in bch2_btree_path_traverse_all()
1014 trans->last_restarted_ip = 0; in bch2_btree_path_traverse_all()
1016 trans_for_each_path(trans, path, i) in bch2_btree_path_traverse_all()
1019 btree_trans_sort_paths(trans); in bch2_btree_path_traverse_all()
1021 bch2_trans_unlock(trans); in bch2_btree_path_traverse_all()
1023 trans_set_locked(trans, false); in bch2_btree_path_traverse_all()
1025 if (unlikely(trans->memory_allocation_failure)) { in bch2_btree_path_traverse_all()
1031 ret = bch2_btree_cache_cannibalize_lock(trans, &cl); in bch2_btree_path_traverse_all()
1038 while (i < trans->nr_sorted) { in bch2_btree_path_traverse_all()
1039 btree_path_idx_t idx = trans->sorted[i]; in bch2_btree_path_traverse_all()
1045 if (trans->paths[idx].uptodate) { in bch2_btree_path_traverse_all()
1046 __btree_path_get(trans, &trans->paths[idx], false); in bch2_btree_path_traverse_all()
1047 ret = bch2_btree_path_traverse_one(trans, idx, 0, _THIS_IP_); in bch2_btree_path_traverse_all()
1048 __btree_path_put(trans, &trans->paths[idx], false); in bch2_btree_path_traverse_all()
1067 bch2_btree_cache_cannibalize_unlock(trans); in bch2_btree_path_traverse_all()
1069 trans->in_traverse_all = false; in bch2_btree_path_traverse_all()
1071 trace_and_count(c, trans_traverse_all, trans, trace_ip); in bch2_btree_path_traverse_all()
1085 static inline bool btree_path_good_node(struct btree_trans *trans, in btree_path_good_node() argument
1090 bch2_btree_node_relock(trans, path, l) && in btree_path_good_node()
1094 static void btree_path_set_level_down(struct btree_trans *trans, in btree_path_set_level_down() argument
1104 btree_node_unlock(trans, path, l); in btree_path_set_level_down()
1107 bch2_btree_path_verify(trans, path); in btree_path_set_level_down()
1110 static noinline unsigned __btree_path_up_until_good_node(struct btree_trans *trans, in __btree_path_up_until_good_node() argument
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()
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()
1133 static inline unsigned btree_path_up_until_good_node(struct btree_trans *trans, in btree_path_up_until_good_node() argument
1140 : __btree_path_up_until_good_node(trans, path, check_pos); in btree_path_up_until_good_node()
1152 int bch2_btree_path_traverse_one(struct btree_trans *trans, in bch2_btree_path_traverse_one() argument
1157 struct btree_path *path = &trans->paths[path_idx]; in bch2_btree_path_traverse_one()
1159 int ret = -((int) trans->restarted); in bch2_btree_path_traverse_one()
1164 if (unlikely(!trans->srcu_held)) in bch2_btree_path_traverse_one()
1165 bch2_trans_srcu_lock(trans); in bch2_btree_path_traverse_one()
1167 trace_btree_path_traverse_start(trans, path); in bch2_btree_path_traverse_one()
1174 ret = bch2_btree_path_relock(trans, path, trace_ip); 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()
1188 path->level = btree_path_up_until_good_node(trans, path, 0); 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()
1225 trans_for_each_path_with_node(trans, path_l(path)->b, linked, iter) in bch2_btree_path_traverse_one()
1232 trace_btree_path_traverse_end(trans, path); in bch2_btree_path_traverse_one()
1234 if (bch2_err_matches(ret, BCH_ERR_transaction_restart) != !!trans->restarted) in bch2_btree_path_traverse_one()
1235 panic("ret %s (%i) trans->restarted %s (%i)\n", in bch2_btree_path_traverse_one()
1237 bch2_err_str(trans->restarted), trans->restarted); in bch2_btree_path_traverse_one()
1238 bch2_btree_path_verify(trans, path); in bch2_btree_path_traverse_one()
1242 static inline void btree_path_copy(struct btree_trans *trans, struct btree_path *dst, in btree_path_copy() argument
1259 static btree_path_idx_t btree_path_clone(struct btree_trans *trans, btree_path_idx_t src, in btree_path_clone() argument
1262 btree_path_idx_t new = btree_path_alloc(trans, src); in btree_path_clone()
1263 btree_path_copy(trans, trans->paths + new, trans->paths + src); in btree_path_clone()
1264 __btree_path_get(trans, trans->paths + new, intent); in btree_path_clone()
1266 trans->paths[new].ip_allocated = ip; in btree_path_clone()
1272 btree_path_idx_t __bch2_btree_path_make_mut(struct btree_trans *trans, 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()
1284 __bch2_btree_path_set_pos(struct btree_trans *trans, in __bch2_btree_path_set_pos() argument
1288 int cmp = bpos_cmp(new_pos, trans->paths[path_idx].pos); in __bch2_btree_path_set_pos()
1290 bch2_trans_verify_not_unlocked_or_in_restart(trans); in __bch2_btree_path_set_pos()
1291 EBUG_ON(!trans->paths[path_idx].ref); in __bch2_btree_path_set_pos()
1293 trace_btree_path_set_pos(trans, trans->paths + path_idx, &new_pos); in __bch2_btree_path_set_pos()
1295 path_idx = bch2_btree_path_make_mut(trans, path_idx, intent, ip); in __bch2_btree_path_set_pos()
1297 struct btree_path *path = trans->paths + path_idx; in __bch2_btree_path_set_pos()
1299 trans->paths_sorted = false; in __bch2_btree_path_set_pos()
1302 btree_node_unlock(trans, path, 0); in __bch2_btree_path_set_pos()
1308 unsigned level = btree_path_up_until_good_node(trans, path, cmp); 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()
1351 sib = next_btree_path(trans, 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()
1366 sib = next_btree_path(trans, path); 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
1400 void bch2_path_put(struct btree_trans *trans, btree_path_idx_t path_idx, bool intent) in bch2_path_put() argument
1402 struct btree_path *path = trans->paths + path_idx, *dup; in bch2_path_put()
1404 if (!__btree_path_put(trans, path, intent)) 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()
1411 trace_btree_path_free(trans, path_idx, dup); in bch2_path_put()
1416 if (path->should_be_locked && !trans->restarted) { in bch2_path_put()
1420 if (!(trans->locked in bch2_path_put()
1421 ? bch2_btree_path_relock_norestart(trans, dup) in bch2_path_put()
1422 : bch2_btree_path_can_relock(trans, dup))) in bch2_path_put()
1431 __bch2_path_free(trans, path_idx); 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()
1443 void __noreturn bch2_trans_restart_error(struct btree_trans *trans, u32 restart_count) in bch2_trans_restart_error() argument
1445 panic("trans->restart_count %u, should be %u, last restarted by %pS\n", in bch2_trans_restart_error()
1446 trans->restart_count, restart_count, in bch2_trans_restart_error()
1447 (void *) trans->last_begin_ip); in bch2_trans_restart_error()
1450 static void __noreturn bch2_trans_in_restart_error(struct btree_trans *trans) in bch2_trans_in_restart_error() argument
1454 bch2_prt_backtrace(&buf, &trans->last_restarted_trace); in bch2_trans_in_restart_error()
1456 bch2_err_str(trans->restarted), in bch2_trans_in_restart_error()
1460 bch2_err_str(trans->restarted), in bch2_trans_in_restart_error()
1461 (void *) trans->last_restarted_ip); in bch2_trans_in_restart_error()
1465 void __noreturn bch2_trans_unlocked_or_in_restart_error(struct btree_trans *trans) in bch2_trans_unlocked_or_in_restart_error() argument
1467 if (trans->restarted) in bch2_trans_unlocked_or_in_restart_error()
1468 bch2_trans_in_restart_error(trans); in bch2_trans_unlocked_or_in_restart_error()
1470 if (!trans->locked) in bch2_trans_unlocked_or_in_restart_error()
1471 panic("trans should be locked, unlocked by %pS\n", in bch2_trans_unlocked_or_in_restart_error()
1472 (void *) trans->last_unlock_ip); in bch2_trans_unlocked_or_in_restart_error()
1478 void bch2_trans_updates_to_text(struct printbuf *buf, struct btree_trans *trans) in bch2_trans_updates_to_text() argument
1481 trans->nr_updates, trans->fn, trans->journal_res.seq); in bch2_trans_updates_to_text()
1484 trans_for_each_update(trans, i) { in bch2_trans_updates_to_text()
1494 bch2_bkey_val_to_text(buf, trans->c, old); in bch2_trans_updates_to_text()
1498 bch2_bkey_val_to_text(buf, trans->c, bkey_i_to_s_c(i->k)); in bch2_trans_updates_to_text()
1502 for (struct jset_entry *e = trans->journal_entries; in bch2_trans_updates_to_text()
1503 e != btree_trans_journal_entries_top(trans); in bch2_trans_updates_to_text()
1505 bch2_journal_entry_to_text(buf, trans->c, e); in bch2_trans_updates_to_text()
1511 void bch2_dump_trans_updates(struct btree_trans *trans) in bch2_dump_trans_updates() argument
1515 bch2_trans_updates_to_text(&buf, trans); in bch2_dump_trans_updates()
1516 bch2_print_str(trans->c, buf.buf); in bch2_dump_trans_updates()
1520 static void bch2_btree_path_to_text_short(struct printbuf *out, struct btree_trans *trans, btree_pa… in bch2_btree_path_to_text_short() argument
1522 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text_short()
1562 void bch2_btree_path_to_text(struct printbuf *out, struct btree_trans *trans, btree_path_idx_t path… in bch2_btree_path_to_text() argument
1564 bch2_btree_path_to_text_short(out, trans, path_idx); in bch2_btree_path_to_text()
1566 struct btree_path *path = trans->paths + path_idx; in bch2_btree_path_to_text()
1588 void __bch2_trans_paths_to_text(struct printbuf *out, struct btree_trans *trans, in __bch2_trans_paths_to_text() argument
1594 btree_trans_sort_paths(trans); in __bch2_trans_paths_to_text()
1596 trans_for_each_path_idx_inorder(trans, iter) { in __bch2_trans_paths_to_text()
1597 bch2_btree_path_to_text_short(out, trans, iter.path_idx); in __bch2_trans_paths_to_text()
1603 void bch2_trans_paths_to_text(struct printbuf *out, struct btree_trans *trans) in bch2_trans_paths_to_text() argument
1605 __bch2_trans_paths_to_text(out, trans, false); in bch2_trans_paths_to_text()
1609 void __bch2_dump_trans_paths_updates(struct btree_trans *trans, bool nosort) in __bch2_dump_trans_paths_updates() argument
1613 __bch2_trans_paths_to_text(&buf, trans, nosort); in __bch2_dump_trans_paths_updates()
1614 bch2_trans_updates_to_text(&buf, trans); in __bch2_dump_trans_paths_updates()
1616 bch2_print_str(trans->c, buf.buf); in __bch2_dump_trans_paths_updates()
1621 void bch2_dump_trans_paths_updates(struct btree_trans *trans) in bch2_dump_trans_paths_updates() argument
1623 __bch2_dump_trans_paths_updates(trans, false); in bch2_dump_trans_paths_updates()
1627 static void bch2_trans_update_max_paths(struct btree_trans *trans) in bch2_trans_update_max_paths() argument
1629 struct btree_transaction_stats *s = btree_trans_stats(trans); in bch2_trans_update_max_paths()
1631 size_t nr = bitmap_weight(trans->paths_allocated, trans->nr_paths); in bch2_trans_update_max_paths()
1633 bch2_trans_paths_to_text(&buf, trans); in bch2_trans_update_max_paths()
1646 trans->nr_paths_max = nr; in bch2_trans_update_max_paths()
1650 int __bch2_btree_trans_too_many_iters(struct btree_trans *trans) in __bch2_btree_trans_too_many_iters() argument
1655 bch2_trans_paths_to_text(&buf, trans); in __bch2_btree_trans_too_many_iters()
1656 trace_trans_restart_too_many_iters(trans, _THIS_IP_, buf.buf); in __bch2_btree_trans_too_many_iters()
1660 count_event(trans->c, trans_restart_too_many_iters); in __bch2_btree_trans_too_many_iters()
1662 return btree_trans_restart(trans, BCH_ERR_transaction_restart_too_many_iters); in __bch2_btree_trans_too_many_iters()
1665 static noinline void btree_path_overflow(struct btree_trans *trans) in btree_path_overflow() argument
1667 bch2_dump_trans_paths_updates(trans); in btree_path_overflow()
1668 bch_err(trans->c, "trans path overflow"); in btree_path_overflow()
1671 static noinline void btree_paths_realloc(struct btree_trans *trans) in btree_paths_realloc() argument
1673 unsigned nr = trans->nr_paths * 2; in btree_paths_realloc()
1682 …memcpy(paths_allocated, trans->paths_allocated, BITS_TO_LONGS(trans->nr_paths) * sizeof(unsigned l… in btree_paths_realloc()
1688 memcpy(paths, trans->paths, trans->nr_paths * sizeof(struct btree_path)); in btree_paths_realloc()
1692 memcpy(sorted, trans->sorted, trans->nr_sorted * sizeof(btree_path_idx_t)); in btree_paths_realloc()
1696 memcpy(updates, trans->updates, trans->nr_paths * sizeof(struct btree_insert_entry)); in btree_paths_realloc()
1698 unsigned long *old = trans->paths_allocated; in btree_paths_realloc()
1700 rcu_assign_pointer(trans->paths_allocated, paths_allocated); in btree_paths_realloc()
1701 rcu_assign_pointer(trans->paths, paths); in btree_paths_realloc()
1702 rcu_assign_pointer(trans->sorted, sorted); in btree_paths_realloc()
1703 rcu_assign_pointer(trans->updates, updates); in btree_paths_realloc()
1705 trans->nr_paths = nr; in btree_paths_realloc()
1707 if (old != trans->_paths_allocated) in btree_paths_realloc()
1711 static inline btree_path_idx_t btree_path_alloc(struct btree_trans *trans, in btree_path_alloc() argument
1714 btree_path_idx_t idx = find_first_zero_bit(trans->paths_allocated, trans->nr_paths); in btree_path_alloc()
1716 if (unlikely(idx == trans->nr_paths)) { in btree_path_alloc()
1717 if (trans->nr_paths == BTREE_ITER_MAX) { in btree_path_alloc()
1718 btree_path_overflow(trans); in btree_path_alloc()
1722 btree_paths_realloc(trans); in btree_path_alloc()
1729 if (unlikely(idx > trans->nr_paths_max)) in btree_path_alloc()
1730 bch2_trans_update_max_paths(trans); in btree_path_alloc()
1732 __set_bit(idx, trans->paths_allocated); in btree_path_alloc()
1734 struct btree_path *path = &trans->paths[idx]; in btree_path_alloc()
1739 btree_path_list_add(trans, pos, idx); in btree_path_alloc()
1740 trans->paths_sorted = false; in btree_path_alloc()
1744 btree_path_idx_t bch2_path_get(struct btree_trans *trans, in bch2_path_get() argument
1755 bch2_trans_verify_not_unlocked_or_in_restart(trans); in bch2_path_get()
1756 bch2_trans_verify_locks(trans); in bch2_path_get()
1758 btree_trans_sort_paths(trans); in bch2_path_get()
1760 trans_for_each_path_inorder(trans, path, iter) { in bch2_path_get()
1772 trans->paths[path_pos].cached == cached && in bch2_path_get()
1773 trans->paths[path_pos].btree_id == btree_id && in bch2_path_get()
1774 trans->paths[path_pos].level == level) { in bch2_path_get()
1775 trace_btree_path_get(trans, trans->paths + path_pos, &pos); in bch2_path_get()
1777 __btree_path_get(trans, trans->paths + path_pos, intent); in bch2_path_get()
1778 path_idx = bch2_btree_path_set_pos(trans, path_pos, pos, intent, ip); in bch2_path_get()
1779 path = trans->paths + path_idx; in bch2_path_get()
1781 path_idx = btree_path_alloc(trans, path_pos); 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()
1798 trans->paths_sorted = false; in bch2_path_get()
1800 trace_btree_path_alloc(trans, path); in bch2_path_get()
1819 bch2_btree_path_upgrade_noupgrade_sibs(trans, path, locks_want, NULL); in bch2_path_get()
1824 btree_path_idx_t bch2_path_get_unlocked_mut(struct btree_trans *trans, in bch2_path_get_unlocked_mut() argument
1829 btree_path_idx_t path_idx = bch2_path_get(trans, btree_id, pos, level + 1, level, in bch2_path_get_unlocked_mut()
1832 path_idx = bch2_btree_path_make_mut(trans, path_idx, true, _RET_IP_); in bch2_path_get_unlocked_mut()
1834 struct btree_path *path = trans->paths + path_idx; in bch2_path_get_unlocked_mut()
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()
1882 struct btree_trans *trans = iter->trans; in bch2_set_btree_iter_dontneed() local
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()
1897 return bch2_btree_path_traverse(iter->trans, iter->path, iter->flags); in __bch2_btree_iter_traverse()
1903 struct btree_trans *trans = iter->trans; in bch2_btree_iter_traverse() local
1906 bch2_trans_verify_not_unlocked_or_in_restart(trans); 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()
1919 btree_path_set_should_be_locked(trans, path); in bch2_btree_iter_traverse()
1927 struct btree_trans *trans = iter->trans; in bch2_btree_iter_peek_node() local
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()
1948 iter->path = bch2_btree_path_set_pos(trans, iter->path, b->key.k.p, in bch2_btree_iter_peek_node()
1951 btree_path_set_should_be_locked(trans, btree_iter_path(trans, iter)); in bch2_btree_iter_peek_node()
1969 bch2_trans_begin(iter->trans); in bch2_btree_iter_peek_node_and_restart()
1976 struct btree_trans *trans = iter->trans; in bch2_btree_iter_next_node() local
1980 EBUG_ON(trans->paths[iter->path].cached); in bch2_btree_iter_next_node()
1981 bch2_trans_verify_not_unlocked_or_in_restart(trans); 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()
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()
2006 trace_and_count(trans->c, trans_restart_relock_next_node, trans, _THIS_IP_, path); in bch2_btree_iter_next_node()
2007 ret = btree_trans_restart(trans, BCH_ERR_transaction_restart_relock); in bch2_btree_iter_next_node()
2014 __btree_path_set_level_up(trans, path, path->level++); 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()
2042 iter->path = bch2_btree_path_set_pos(trans, iter->path, b->key.k.p, in bch2_btree_iter_next_node()
2045 btree_path_set_should_be_locked(trans, btree_iter_path(trans, iter)); in bch2_btree_iter_next_node()
2046 EBUG_ON(btree_iter_path(trans, iter)->uptodate); in bch2_btree_iter_next_node()
2086 void bch2_btree_trans_peek_prev_updates(struct btree_trans *trans, struct btree_iter *iter, in bch2_btree_trans_peek_prev_updates() argument
2089 struct bpos end = path_l(btree_iter_path(trans, iter))->b->data->min_key; in bch2_btree_trans_peek_prev_updates()
2091 trans_for_each_update(trans, i) in bch2_btree_trans_peek_prev_updates()
2102 void bch2_btree_trans_peek_updates(struct btree_trans *trans, struct btree_iter *iter, in bch2_btree_trans_peek_updates() argument
2105 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_trans_peek_updates()
2108 trans_for_each_update(trans, i) in bch2_btree_trans_peek_updates()
2119 void bch2_btree_trans_peek_slot_updates(struct btree_trans *trans, struct btree_iter *iter, in bch2_btree_trans_peek_slot_updates() argument
2122 trans_for_each_update(trans, i) in bch2_btree_trans_peek_slot_updates()
2131 static struct bkey_i *bch2_btree_journal_peek(struct btree_trans *trans, in bch2_btree_journal_peek() argument
2135 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_journal_peek()
2137 return bch2_journal_keys_peek_max(trans->c, iter->btree_id, in bch2_btree_journal_peek()
2145 struct bkey_s_c btree_trans_peek_slot_journal(struct btree_trans *trans, in btree_trans_peek_slot_journal() argument
2148 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_slot_journal()
2149 struct bkey_i *k = bch2_btree_journal_peek(trans, iter, path->pos); in btree_trans_peek_slot_journal()
2160 void btree_trans_peek_journal(struct btree_trans *trans, in btree_trans_peek_journal() argument
2164 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_journal()
2166 bch2_btree_journal_peek(trans, iter, in btree_trans_peek_journal()
2174 static struct bkey_i *bch2_btree_journal_peek_prev(struct btree_trans *trans, in bch2_btree_journal_peek_prev() argument
2178 struct btree_path *path = btree_iter_path(trans, iter); in bch2_btree_journal_peek_prev()
2180 return bch2_journal_keys_peek_prev_min(trans->c, iter->btree_id, in bch2_btree_journal_peek_prev()
2188 void btree_trans_peek_prev_journal(struct btree_trans *trans, in btree_trans_peek_prev_journal() argument
2192 struct btree_path *path = btree_iter_path(trans, iter); in btree_trans_peek_prev_journal()
2194 bch2_btree_journal_peek_prev(trans, iter, in btree_trans_peek_prev_journal()
2210 struct btree_trans *trans = iter->trans; in btree_trans_peek_key_cache() local
2211 struct bch_fs *c = trans->c; in btree_trans_peek_key_cache()
2216 bch2_trans_verify_not_unlocked_or_in_restart(trans); in btree_trans_peek_key_cache()
2226 iter->key_cache_path = bch2_path_get(trans, iter->btree_id, pos, in btree_trans_peek_key_cache()
2232 iter->key_cache_path = bch2_btree_path_set_pos(trans, iter->key_cache_path, pos, in btree_trans_peek_key_cache()
2236 ret = bch2_btree_path_traverse(trans, iter->key_cache_path, in btree_trans_peek_key_cache()
2238 bch2_btree_path_relock(trans, btree_iter_path(trans, iter), _THIS_IP_); in btree_trans_peek_key_cache()
2242 k = bch2_btree_path_peek_slot(trans->paths + iter->key_cache_path, &u); in btree_trans_peek_key_cache()
2252 btree_path_set_should_be_locked(trans, trans->paths + iter->key_cache_path); in btree_trans_peek_key_cache()
2258 struct btree_trans *trans = iter->trans; in __bch2_btree_iter_peek() local
2262 EBUG_ON(btree_iter_path(trans, iter)->cached); in __bch2_btree_iter_peek()
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()
2288 btree_path_set_should_be_locked(trans, path); in __bch2_btree_iter_peek()
2290 k = btree_path_level_peek_all(trans->c, l, &iter->k); in __bch2_btree_iter_peek()
2303 btree_trans_peek_journal(trans, iter, &k); in __bch2_btree_iter_peek()
2306 trans->nr_updates)) in __bch2_btree_iter_peek()
2307 bch2_btree_trans_peek_updates(trans, iter, &k); in __bch2_btree_iter_peek()
2350 struct btree_trans *trans = iter->trans; in bch2_btree_iter_peek_max() local
2356 bch2_trans_verify_not_unlocked_or_in_restart(trans); in bch2_btree_iter_peek_max()
2360 ret = trans_maybe_inject_restart(trans, _RET_IP_); in bch2_btree_iter_peek_max()
2367 bch2_path_put_nokeep(trans, iter->update_path, in bch2_btree_iter_peek_max()
2396 !bkey_eq(trans->paths[iter->update_path].pos, k.k->p)) { in bch2_btree_iter_peek_max()
2397 bch2_path_put_nokeep(trans, iter->update_path, 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()
2421 iter->update_path = bch2_btree_path_set_pos(trans, in bch2_btree_iter_peek_max()
2425 ret = bch2_btree_path_traverse(trans, iter->update_path, iter->flags); in bch2_btree_iter_peek_max()
2436 if (!bch2_snapshot_is_ancestor(trans->c, 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()
2474 btree_path_set_should_be_locked(trans, btree_iter_path(trans, iter)); in bch2_btree_iter_peek_max()
2477 ret = bch2_btree_path_relock(trans, trans->paths + iter->update_path, _THIS_IP_); in bch2_btree_iter_peek_max()
2481 btree_path_set_should_be_locked(trans, trans->paths + iter->update_path); in bch2_btree_iter_peek_max()
2519 struct btree_trans *trans = iter->trans; in __bch2_btree_iter_peek_prev() local
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()
2547 btree_path_set_should_be_locked(trans, path); in __bch2_btree_iter_peek_prev()
2549 k = btree_path_level_peek_all(trans->c, l, &iter->k); in __bch2_btree_iter_peek_prev()
2551 k = btree_path_level_prev(trans, path, l, &iter->k); in __bch2_btree_iter_peek_prev()
2567 btree_trans_peek_prev_journal(trans, iter, &k); in __bch2_btree_iter_peek_prev()
2570 trans->nr_updates)) in __bch2_btree_iter_peek_prev()
2571 bch2_btree_trans_peek_prev_updates(trans, iter, &k); in __bch2_btree_iter_peek_prev()
2622 struct btree_trans *trans = iter->trans; in bch2_btree_iter_peek_prev_min() local
2627 bch2_trans_verify_not_unlocked_or_in_restart(trans); in bch2_btree_iter_peek_prev_min()
2631 int ret = trans_maybe_inject_restart(trans, _RET_IP_); in bch2_btree_iter_peek_prev_min()
2645 struct btree_path *s = saved_path ? trans->paths + saved_path : NULL; in bch2_btree_iter_peek_prev_min()
2652 bch2_path_put_nokeep(trans, iter->path, in bch2_btree_iter_peek_prev_min()
2656 k = bch2_btree_path_peek_slot(btree_iter_path(trans, iter), &iter->k); in bch2_btree_iter_peek_prev_min()
2669 if (!bch2_snapshot_is_ancestor(trans->c, iter->snapshot, k.k->p.snapshot)) { in bch2_btree_iter_peek_prev_min()
2682 bch2_path_put_nokeep(trans, 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()
2691 trace_btree_path_save_pos(trans, in bch2_btree_iter_peek_prev_min()
2692 trans->paths + iter->path, in bch2_btree_iter_peek_prev_min()
2693 trans->paths + saved_path); in bch2_btree_iter_peek_prev_min()
2726 bch2_path_put_nokeep(trans, saved_path, iter->flags & BTREE_ITER_intent); in bch2_btree_iter_peek_prev_min()
2754 struct btree_trans *trans = iter->trans; in bch2_btree_iter_peek_slot() local
2759 bch2_trans_verify_not_unlocked_or_in_restart(trans); in bch2_btree_iter_peek_slot()
2762 EBUG_ON(btree_iter_path(trans, iter)->level && (iter->flags & BTREE_ITER_with_key_cache)); in bch2_btree_iter_peek_slot()
2764 ret = trans_maybe_inject_restart(trans, _RET_IP_); in bch2_btree_iter_peek_slot()
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()
2799 trans->nr_updates)) { in bch2_btree_iter_peek_slot()
2800 bch2_btree_trans_peek_slot_updates(trans, iter, &k); in bch2_btree_iter_peek_slot()
2806 (k = btree_trans_peek_slot_journal(trans, iter)).k) 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()
2832 EBUG_ON(btree_iter_path(trans, iter)->level); in bch2_btree_iter_peek_slot()
2845 bch2_trans_iter_exit(trans, &iter2); in bch2_btree_iter_peek_slot()
2879 btree_path_set_should_be_locked(trans, btree_iter_path(trans, iter)); in bch2_btree_iter_peek_slot()
2911 while (btree_trans_too_many_iters(iter->trans) || in bch2_btree_iter_peek_and_restart_outlined()
2914 bch2_trans_begin(iter->trans); in bch2_btree_iter_peek_and_restart_outlined()
2922 static void btree_trans_verify_sorted_refs(struct btree_trans *trans) in btree_trans_verify_sorted_refs() argument
2927 BUG_ON(trans->nr_sorted != bitmap_weight(trans->paths_allocated, trans->nr_paths) - 1); in btree_trans_verify_sorted_refs()
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()
2934 for (i = 0; i < trans->nr_sorted; i++) { in btree_trans_verify_sorted_refs()
2935 unsigned idx = trans->sorted[i]; in btree_trans_verify_sorted_refs()
2937 BUG_ON(!test_bit(idx, trans->paths_allocated)); in btree_trans_verify_sorted_refs()
2938 BUG_ON(trans->paths[idx].sorted_idx != i); in btree_trans_verify_sorted_refs()
2942 static void btree_trans_verify_sorted(struct btree_trans *trans) in btree_trans_verify_sorted() argument
2950 trans_for_each_path_inorder(trans, path, iter) { in btree_trans_verify_sorted()
2952 __bch2_dump_trans_paths_updates(trans, true); in btree_trans_verify_sorted()
2953 panic("trans paths out of order!\n"); in btree_trans_verify_sorted()
2959 static inline void btree_trans_verify_sorted_refs(struct btree_trans *trans) {} in btree_trans_verify_sorted_refs() argument
2960 static inline void btree_trans_verify_sorted(struct btree_trans *trans) {} in btree_trans_verify_sorted() argument
2963 void __bch2_btree_trans_sort_paths(struct btree_trans *trans) in __bch2_btree_trans_sort_paths() argument
2965 int i, l = 0, r = trans->nr_sorted, inc = 1; in __bch2_btree_trans_sort_paths()
2968 btree_trans_verify_sorted_refs(trans); in __bch2_btree_trans_sort_paths()
2970 if (trans->paths_sorted) in __bch2_btree_trans_sort_paths()
2983 if (btree_path_cmp(trans->paths + trans->sorted[i], in __bch2_btree_trans_sort_paths()
2984 trans->paths + trans->sorted[i + 1]) > 0) { in __bch2_btree_trans_sort_paths()
2985 swap(trans->sorted[i], trans->sorted[i + 1]); in __bch2_btree_trans_sort_paths()
2986 trans->paths[trans->sorted[i]].sorted_idx = i; in __bch2_btree_trans_sort_paths()
2987 trans->paths[trans->sorted[i + 1]].sorted_idx = i + 1; in __bch2_btree_trans_sort_paths()
2999 trans->paths_sorted = true; in __bch2_btree_trans_sort_paths()
3001 btree_trans_verify_sorted(trans); in __bch2_btree_trans_sort_paths()
3004 static inline void btree_path_list_remove(struct btree_trans *trans, in btree_path_list_remove() argument
3007 EBUG_ON(path->sorted_idx >= trans->nr_sorted); in btree_path_list_remove()
3009 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()
3018 trans->paths[trans->sorted[i]].sorted_idx = i; in btree_path_list_remove()
3021 static inline void btree_path_list_add(struct btree_trans *trans, in btree_path_list_add() argument
3025 struct btree_path *path = trans->paths + path_idx; in btree_path_list_add()
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()
3034 trans->nr_sorted++; 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()
3041 trans->paths[trans->sorted[i]].sorted_idx = i; in btree_path_list_add()
3043 btree_trans_verify_sorted_refs(trans); in btree_path_list_add()
3046 void bch2_trans_iter_exit(struct btree_trans *trans, struct btree_iter *iter) in bch2_trans_iter_exit() argument
3049 bch2_path_put_nokeep(trans, iter->update_path, in bch2_trans_iter_exit()
3052 bch2_path_put(trans, iter->path, in bch2_trans_iter_exit()
3055 bch2_path_put(trans, iter->key_cache_path, in bch2_trans_iter_exit()
3060 iter->trans = NULL; in bch2_trans_iter_exit()
3063 void bch2_trans_iter_init_outlined(struct btree_trans *trans, in bch2_trans_iter_init_outlined() argument
3068 bch2_trans_iter_init_common(trans, iter, btree_id, pos, 0, 0, in bch2_trans_iter_init_outlined()
3069 bch2_btree_iter_flags(trans, btree_id, 0, flags), in bch2_trans_iter_init_outlined()
3073 void bch2_trans_node_iter_init(struct btree_trans *trans, in bch2_trans_node_iter_init() argument
3085 if (!depth && btree_id_cached(trans->c, btree_id)) in bch2_trans_node_iter_init()
3088 bch2_trans_iter_init_common(trans, iter, btree_id, pos, locks_want, depth, in bch2_trans_node_iter_init()
3089 bch2_btree_iter_flags(trans, btree_id, depth, flags), in bch2_trans_node_iter_init()
3094 struct btree_path *path = btree_iter_path(trans, iter); in bch2_trans_node_iter_init()
3102 struct btree_trans *trans = src->trans; in bch2_trans_copy_iter() local
3109 __btree_path_get(trans, trans->paths + src->path, src->flags & BTREE_ITER_intent); in bch2_trans_copy_iter()
3111 __btree_path_get(trans, trans->paths + src->update_path, src->flags & BTREE_ITER_intent); in bch2_trans_copy_iter()
3115 void *__bch2_trans_kmalloc(struct btree_trans *trans, size_t size) in __bch2_trans_kmalloc() argument
3117 struct bch_fs *c = trans->c; in __bch2_trans_kmalloc()
3118 unsigned new_top = trans->mem_top + size; in __bch2_trans_kmalloc()
3119 unsigned old_bytes = trans->mem_bytes; in __bch2_trans_kmalloc()
3127 ret = trans_maybe_inject_restart(trans, _RET_IP_); in __bch2_trans_kmalloc()
3131 struct btree_transaction_stats *s = btree_trans_stats(trans); in __bch2_trans_kmalloc()
3134 if (trans->used_mempool) { in __bch2_trans_kmalloc()
3135 if (trans->mem_bytes >= new_bytes) in __bch2_trans_kmalloc()
3141 bch2_trans_unlock(trans); in __bch2_trans_kmalloc()
3147 ret = bch2_trans_relock(trans); in __bch2_trans_kmalloc()
3153 memcpy(new_mem, trans->mem, trans->mem_top); in __bch2_trans_kmalloc()
3154 trans->used_mempool = false; in __bch2_trans_kmalloc()
3155 mempool_free(trans->mem, &c->btree_trans_mem_pool); in __bch2_trans_kmalloc()
3159 new_mem = krealloc(trans->mem, new_bytes, GFP_NOWAIT|__GFP_NOWARN); in __bch2_trans_kmalloc()
3161 bch2_trans_unlock(trans); in __bch2_trans_kmalloc()
3163 new_mem = krealloc(trans->mem, new_bytes, GFP_KERNEL); in __bch2_trans_kmalloc()
3167 memcpy(new_mem, trans->mem, trans->mem_top); in __bch2_trans_kmalloc()
3168 trans->used_mempool = true; in __bch2_trans_kmalloc()
3169 kfree(trans->mem); in __bch2_trans_kmalloc()
3175 trans->mem = new_mem; in __bch2_trans_kmalloc()
3176 trans->mem_bytes = new_bytes; in __bch2_trans_kmalloc()
3178 ret = bch2_trans_relock(trans); in __bch2_trans_kmalloc()
3183 trans->mem = new_mem; in __bch2_trans_kmalloc()
3184 trans->mem_bytes = new_bytes; in __bch2_trans_kmalloc()
3187 trace_and_count(c, trans_restart_mem_realloced, trans, _RET_IP_, new_bytes); in __bch2_trans_kmalloc()
3188 return ERR_PTR(btree_trans_restart_ip(trans, in __bch2_trans_kmalloc()
3192 p = trans->mem + trans->mem_top; in __bch2_trans_kmalloc()
3193 trans->mem_top += size; in __bch2_trans_kmalloc()
3198 static inline void check_srcu_held_too_long(struct btree_trans *trans) in check_srcu_held_too_long() argument
3200 WARN(trans->srcu_held && time_after(jiffies, trans->srcu_lock_time + HZ * 10), in check_srcu_held_too_long()
3201 "btree trans held srcu lock (delaying memory reclaim) for %lu seconds", in check_srcu_held_too_long()
3202 (jiffies - trans->srcu_lock_time) / HZ); in check_srcu_held_too_long()
3205 void bch2_trans_srcu_unlock(struct btree_trans *trans) in bch2_trans_srcu_unlock() argument
3207 if (trans->srcu_held) { in bch2_trans_srcu_unlock()
3208 struct bch_fs *c = trans->c; in bch2_trans_srcu_unlock()
3212 trans_for_each_path(trans, path, i) in bch2_trans_srcu_unlock()
3216 check_srcu_held_too_long(trans); in bch2_trans_srcu_unlock()
3217 srcu_read_unlock(&c->btree_trans_barrier, trans->srcu_idx); in bch2_trans_srcu_unlock()
3218 trans->srcu_held = false; in bch2_trans_srcu_unlock()
3222 static void bch2_trans_srcu_lock(struct btree_trans *trans) in bch2_trans_srcu_lock() argument
3224 if (!trans->srcu_held) { in bch2_trans_srcu_lock()
3225 trans->srcu_idx = srcu_read_lock(&trans->c->btree_trans_barrier); in bch2_trans_srcu_lock()
3226 trans->srcu_lock_time = jiffies; in bch2_trans_srcu_lock()
3227 trans->srcu_held = true; in bch2_trans_srcu_lock()
3233 * @trans: transaction to reset
3241 u32 bch2_trans_begin(struct btree_trans *trans) in bch2_trans_begin() argument
3247 bch2_trans_reset_updates(trans); in bch2_trans_begin()
3249 trans->restart_count++; in bch2_trans_begin()
3250 trans->mem_top = 0; in bch2_trans_begin()
3251 trans->journal_entries = NULL; in bch2_trans_begin()
3253 trans_for_each_path(trans, path, i) { in bch2_trans_begin()
3261 if (!trans->restarted && path->btree_id != BTREE_ID_subvolumes) in bch2_trans_begin()
3270 __bch2_path_free(trans, i); in bch2_trans_begin()
3278 time_after64(now, trans->last_begin_time + 10)) in bch2_trans_begin()
3279 __bch2_time_stats_update(&btree_trans_stats(trans)->duration, in bch2_trans_begin()
3280 trans->last_begin_time, now); in bch2_trans_begin()
3282 if (!trans->restarted && in bch2_trans_begin()
3284 time_after64(now, trans->last_begin_time + BTREE_TRANS_MAX_LOCK_HOLD_TIME_NS))) { in bch2_trans_begin()
3285 bch2_trans_unlock(trans); in bch2_trans_begin()
3289 trans->last_begin_time = now; in bch2_trans_begin()
3291 if (unlikely(trans->srcu_held && in bch2_trans_begin()
3292 time_after(jiffies, trans->srcu_lock_time + msecs_to_jiffies(10)))) in bch2_trans_begin()
3293 bch2_trans_srcu_unlock(trans); in bch2_trans_begin()
3295 trans->last_begin_ip = _RET_IP_; in bch2_trans_begin()
3298 if (trans->restarted) { in bch2_trans_begin()
3299 trans->restart_count_this_trans++; in bch2_trans_begin()
3301 trans->restart_count_this_trans = 0; in bch2_trans_begin()
3305 trans_set_locked(trans, false); in bch2_trans_begin()
3307 if (trans->restarted) { in bch2_trans_begin()
3308 bch2_btree_path_traverse_all(trans); in bch2_trans_begin()
3309 trans->notrace_relock_fail = false; in bch2_trans_begin()
3312 bch2_trans_verify_not_unlocked_or_in_restart(trans); in bch2_trans_begin()
3313 return trans->restart_count; in bch2_trans_begin()
3334 struct btree_trans *trans; in __bch2_trans_get() local
3337 trans = this_cpu_xchg(c->btree_trans_bufs->trans, NULL); in __bch2_trans_get()
3338 if (trans) { in __bch2_trans_get()
3339 memset(trans, 0, offsetof(struct btree_trans, list)); in __bch2_trans_get()
3344 trans = mempool_alloc(&c->btree_trans_pool, GFP_NOFS); in __bch2_trans_get()
3345 memset(trans, 0, sizeof(*trans)); in __bch2_trans_get()
3352 trans->locking_wait.task = current; in __bch2_trans_get()
3368 list_add(&trans->list, &c->btree_trans_list); in __bch2_trans_get()
3371 trans->c = c; in __bch2_trans_get()
3372 trans->last_begin_time = local_clock(); in __bch2_trans_get()
3373 trans->fn_idx = fn_idx; in __bch2_trans_get()
3374 trans->locking_wait.task = current; in __bch2_trans_get()
3375 trans->journal_replay_not_finished = in __bch2_trans_get()
3378 trans->nr_paths = ARRAY_SIZE(trans->_paths); in __bch2_trans_get()
3379 trans->paths_allocated = trans->_paths_allocated; in __bch2_trans_get()
3380 trans->sorted = trans->_sorted; in __bch2_trans_get()
3381 trans->paths = trans->_paths; in __bch2_trans_get()
3382 trans->updates = trans->_updates; in __bch2_trans_get()
3384 *trans_paths_nr(trans->paths) = BTREE_ITER_INITIAL; in __bch2_trans_get()
3386 trans->paths_allocated[0] = 1; in __bch2_trans_get()
3389 lockdep_init_map(&trans->dep_map, "bcachefs_btree", &lockdep_key, 0); in __bch2_trans_get()
3392 trans->fn = bch2_btree_transaction_fns[fn_idx]; in __bch2_trans_get()
3399 trans->mem = kmalloc(expected_mem_bytes, GFP_KERNEL); in __bch2_trans_get()
3400 if (likely(trans->mem)) in __bch2_trans_get()
3401 trans->mem_bytes = expected_mem_bytes; in __bch2_trans_get()
3404 trans->nr_paths_max = s->nr_max_paths; in __bch2_trans_get()
3405 trans->journal_entries_size = s->journal_entries_size; in __bch2_trans_get()
3408 trans->srcu_idx = srcu_read_lock(&c->btree_trans_barrier); in __bch2_trans_get()
3409 trans->srcu_lock_time = jiffies; in __bch2_trans_get()
3410 trans->srcu_held = true; in __bch2_trans_get()
3411 trans_set_locked(trans, false); in __bch2_trans_get()
3413 closure_init_stack_release(&trans->ref); in __bch2_trans_get()
3414 return trans; in __bch2_trans_get()
3417 static void check_btree_paths_leaked(struct btree_trans *trans) in check_btree_paths_leaked() argument
3420 struct bch_fs *c = trans->c; in check_btree_paths_leaked()
3424 trans_for_each_path(trans, path, i) in check_btree_paths_leaked()
3429 bch_err(c, "btree paths leaked from %s!", trans->fn); in check_btree_paths_leaked()
3430 trans_for_each_path(trans, path, i) in check_btree_paths_leaked()
3440 void bch2_trans_put(struct btree_trans *trans) in bch2_trans_put() argument
3443 struct bch_fs *c = trans->c; in bch2_trans_put()
3445 if (trans->restarted) in bch2_trans_put()
3446 bch2_trans_in_restart_error(trans); in bch2_trans_put()
3448 bch2_trans_unlock(trans); in bch2_trans_put()
3450 trans_for_each_update(trans, i) in bch2_trans_put()
3451 __btree_path_put(trans, trans->paths + i->path, true); in bch2_trans_put()
3452 trans->nr_updates = 0; in bch2_trans_put()
3454 check_btree_paths_leaked(trans); in bch2_trans_put()
3456 if (trans->srcu_held) { in bch2_trans_put()
3457 check_srcu_held_too_long(trans); in bch2_trans_put()
3458 srcu_read_unlock(&c->btree_trans_barrier, trans->srcu_idx); in bch2_trans_put()
3461 if (unlikely(trans->journal_replay_not_finished)) in bch2_trans_put()
3465 * trans->ref protects trans->locking_wait.task, btree_paths array; used in bch2_trans_put()
3468 closure_return_sync(&trans->ref); in bch2_trans_put()
3469 trans->locking_wait.task = NULL; in bch2_trans_put()
3472 darray_exit(&trans->last_restarted_trace); in bch2_trans_put()
3475 unsigned long *paths_allocated = trans->paths_allocated; in bch2_trans_put()
3476 trans->paths_allocated = NULL; in bch2_trans_put()
3477 trans->paths = NULL; in bch2_trans_put()
3479 if (paths_allocated != trans->_paths_allocated) in bch2_trans_put()
3482 if (trans->used_mempool) in bch2_trans_put()
3483 mempool_free(trans->mem, &c->btree_trans_mem_pool); in bch2_trans_put()
3485 kfree(trans->mem); in bch2_trans_put()
3489 trans = this_cpu_xchg(c->btree_trans_bufs->trans, trans); in bch2_trans_put()
3491 if (trans) { in bch2_trans_put()
3493 list_del(&trans->list); in bch2_trans_put()
3496 mempool_free(trans, &c->btree_trans_pool); in bch2_trans_put()
3503 struct btree_trans *trans; in bch2_current_has_btree_trans() local
3505 list_for_each_entry(trans, &c->btree_trans_list, list) in bch2_current_has_btree_trans()
3506 if (trans->locking_wait.task == current && in bch2_current_has_btree_trans()
3507 trans->locked) { in bch2_current_has_btree_trans()
3537 void bch2_btree_trans_to_text(struct printbuf *out, struct btree_trans *trans) in bch2_btree_trans_to_text() argument
3541 struct task_struct *task = READ_ONCE(trans->locking_wait.task); in bch2_btree_trans_to_text()
3552 prt_printf(out, "%i %s\n", task ? task->pid : 0, trans->fn); in bch2_btree_trans_to_text()
3554 /* trans->paths is rcu protected vs. freeing */ in bch2_btree_trans_to_text()
3558 struct btree_path *paths = rcu_dereference(trans->paths); in bch2_btree_trans_to_text()
3588 b = READ_ONCE(trans->locking); in bch2_btree_trans_to_text()
3591 div_u64(local_clock() - trans->locking_wait.start_time, 1000)); in bch2_btree_trans_to_text()
3592 prt_printf(out, " %c", lock_types[trans->locking_wait.lock_want]); in bch2_btree_trans_to_text()
3604 struct btree_trans *trans; in bch2_fs_btree_iter_exit() local
3609 struct btree_trans *trans = in bch2_fs_btree_iter_exit() local
3610 per_cpu_ptr(c->btree_trans_bufs, cpu)->trans; in bch2_fs_btree_iter_exit()
3612 if (trans) { in bch2_fs_btree_iter_exit()
3614 list_del(&trans->list); in bch2_fs_btree_iter_exit()
3617 kfree(trans); in bch2_fs_btree_iter_exit()
3621 trans = list_first_entry_or_null(&c->btree_trans_list, struct btree_trans, list); in bch2_fs_btree_iter_exit()
3622 if (trans) in bch2_fs_btree_iter_exit()
3623 panic("%s leaked btree_trans\n", trans->fn); in bch2_fs_btree_iter_exit()
3678 struct btree_trans *trans = bch2_trans_get(c); in bch2_fs_btree_iter_init() local
3679 trans_set_locked(trans, false); in bch2_fs_btree_iter_init()
3680 bch2_trans_put(trans); in bch2_fs_btree_iter_init()