Lines Matching refs:trans
34 struct btree_trans *trans = bch2_trans_get(c); in test_delete() local
42 bch2_trans_iter_init(trans, &iter, BTREE_ID_xattrs, k.k.p, in test_delete()
45 ret = commit_do(trans, NULL, NULL, 0, in test_delete()
46 bch2_btree_iter_traverse(trans, &iter) ?: in test_delete()
47 bch2_trans_update(trans, &iter, &k.k_i, 0)); in test_delete()
53 ret = commit_do(trans, NULL, NULL, 0, in test_delete()
54 bch2_btree_iter_traverse(trans, &iter) ?: in test_delete()
55 bch2_btree_delete_at(trans, &iter, 0)); in test_delete()
61 ret = commit_do(trans, NULL, NULL, 0, in test_delete()
62 bch2_btree_iter_traverse(trans, &iter) ?: in test_delete()
63 bch2_btree_delete_at(trans, &iter, 0)); in test_delete()
68 bch2_trans_iter_exit(trans, &iter); in test_delete()
69 bch2_trans_put(trans); in test_delete()
75 struct btree_trans *trans = bch2_trans_get(c); in test_delete_written() local
83 bch2_trans_iter_init(trans, &iter, BTREE_ID_xattrs, k.k.p, in test_delete_written()
86 ret = commit_do(trans, NULL, NULL, 0, in test_delete_written()
87 bch2_btree_iter_traverse(trans, &iter) ?: in test_delete_written()
88 bch2_trans_update(trans, &iter, &k.k_i, 0)); in test_delete_written()
93 bch2_trans_unlock(trans); in test_delete_written()
96 ret = commit_do(trans, NULL, NULL, 0, in test_delete_written()
97 bch2_btree_iter_traverse(trans, &iter) ?: in test_delete_written()
98 bch2_btree_delete_at(trans, &iter, 0)); in test_delete_written()
103 bch2_trans_iter_exit(trans, &iter); in test_delete_written()
104 bch2_trans_put(trans); in test_delete_written()
134 for_each_btree_key_max(trans, iter, BTREE_ID_xattrs, in test_iterate()
149 for_each_btree_key_reverse(trans, iter, BTREE_ID_xattrs, in test_iterate()
189 for_each_btree_key_max(trans, iter, BTREE_ID_extents, in test_iterate_extents()
205 for_each_btree_key_reverse(trans, iter, BTREE_ID_extents, in test_iterate_extents()
245 for_each_btree_key_max(trans, iter, BTREE_ID_xattrs, in test_iterate_slots()
262 for_each_btree_key_max(trans, iter, BTREE_ID_xattrs, in test_iterate_slots()
305 for_each_btree_key_max(trans, iter, BTREE_ID_extents, in test_iterate_slots_extents()
323 for_each_btree_key_max(trans, iter, BTREE_ID_extents, in test_iterate_slots_extents()
347 struct btree_trans *trans = bch2_trans_get(c); in test_peek_end() local
351 bch2_trans_iter_init(trans, &iter, BTREE_ID_xattrs, in test_peek_end()
354 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)))); in test_peek_end()
357 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)))); in test_peek_end()
360 bch2_trans_iter_exit(trans, &iter); in test_peek_end()
361 bch2_trans_put(trans); in test_peek_end()
369 struct btree_trans *trans = bch2_trans_get(c); in test_peek_end_extents() local
373 bch2_trans_iter_init(trans, &iter, BTREE_ID_extents, in test_peek_end_extents()
376 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)))); in test_peek_end_extents()
379 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)))); in test_peek_end_extents()
382 bch2_trans_iter_exit(trans, &iter); in test_peek_end_extents()
383 bch2_trans_put(trans); in test_peek_end_extents()
458 bch2_btree_insert_nonextent(trans, BTREE_ID_extents, &k.k_i, in insert_test_overlapping_extent()
480 struct btree_trans *trans; in test_snapshot_filter() local
492 trans = bch2_trans_get(c); in test_snapshot_filter()
493 bch2_trans_iter_init(trans, &iter, BTREE_ID_xattrs, in test_snapshot_filter()
495 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)))); in test_snapshot_filter()
499 bch2_trans_iter_exit(trans, &iter); in test_snapshot_filter()
500 bch2_trans_put(trans); in test_snapshot_filter()
518 bch2_snapshot_node_create(trans, U32_MAX, in test_snapshots()
545 struct btree_trans *trans = bch2_trans_get(c); in rand_insert() local
555 ret = commit_do(trans, NULL, NULL, 0, in rand_insert()
556 bch2_btree_insert_trans(trans, BTREE_ID_xattrs, &k.k_i, 0)); in rand_insert()
561 bch2_trans_put(trans); in rand_insert()
567 struct btree_trans *trans = bch2_trans_get(c); in rand_insert_multi() local
580 ret = commit_do(trans, NULL, NULL, 0, in rand_insert_multi()
581 bch2_btree_insert_trans(trans, BTREE_ID_xattrs, &k[0].k_i, 0) ?: in rand_insert_multi()
582 bch2_btree_insert_trans(trans, BTREE_ID_xattrs, &k[1].k_i, 0) ?: in rand_insert_multi()
583 bch2_btree_insert_trans(trans, BTREE_ID_xattrs, &k[2].k_i, 0) ?: in rand_insert_multi()
584 bch2_btree_insert_trans(trans, BTREE_ID_xattrs, &k[3].k_i, 0) ?: in rand_insert_multi()
585 bch2_btree_insert_trans(trans, BTREE_ID_xattrs, &k[4].k_i, 0) ?: in rand_insert_multi()
586 bch2_btree_insert_trans(trans, BTREE_ID_xattrs, &k[5].k_i, 0) ?: in rand_insert_multi()
587 bch2_btree_insert_trans(trans, BTREE_ID_xattrs, &k[6].k_i, 0) ?: in rand_insert_multi()
588 bch2_btree_insert_trans(trans, BTREE_ID_xattrs, &k[7].k_i, 0)); in rand_insert_multi()
593 bch2_trans_put(trans); in rand_insert_multi()
599 struct btree_trans *trans = bch2_trans_get(c); in rand_lookup() local
605 bch2_trans_iter_init(trans, &iter, BTREE_ID_xattrs, in rand_lookup()
609 bch2_btree_iter_set_pos(trans, &iter, SPOS(0, test_rand(), U32_MAX)); in rand_lookup()
611 lockrestart_do(trans, bkey_err(k = bch2_btree_iter_peek(trans, &iter))); in rand_lookup()
617 bch2_trans_iter_exit(trans, &iter); in rand_lookup()
618 bch2_trans_put(trans); in rand_lookup()
622 static int rand_mixed_trans(struct btree_trans *trans, in rand_mixed_trans() argument
630 bch2_btree_iter_set_pos(trans, iter, SPOS(0, pos, U32_MAX)); in rand_mixed_trans()
632 k = bch2_btree_iter_peek(trans, iter); in rand_mixed_trans()
634 bch_err_msg(trans->c, ret, "lookup error"); in rand_mixed_trans()
641 ret = bch2_trans_update(trans, iter, &cookie->k_i, 0); in rand_mixed_trans()
649 struct btree_trans *trans = bch2_trans_get(c); in rand_mixed() local
655 bch2_trans_iter_init(trans, &iter, BTREE_ID_xattrs, in rand_mixed()
660 ret = commit_do(trans, NULL, NULL, 0, in rand_mixed()
661 rand_mixed_trans(trans, &iter, &cookie, i, rand)); in rand_mixed()
666 bch2_trans_iter_exit(trans, &iter); in rand_mixed()
667 bch2_trans_put(trans); in rand_mixed()
671 static int __do_delete(struct btree_trans *trans, struct bpos pos) in __do_delete() argument
677 bch2_trans_iter_init(trans, &iter, BTREE_ID_xattrs, pos, in __do_delete()
679 k = bch2_btree_iter_peek_max(trans, &iter, POS(0, U64_MAX)); in __do_delete()
687 ret = bch2_btree_delete_at(trans, &iter, 0); in __do_delete()
689 bch2_trans_iter_exit(trans, &iter); in __do_delete()
695 struct btree_trans *trans = bch2_trans_get(c); in rand_delete() local
702 ret = commit_do(trans, NULL, NULL, 0, in rand_delete()
703 __do_delete(trans, pos)); in rand_delete()
708 bch2_trans_put(trans); in rand_delete()
719 for_each_btree_key_commit(trans, iter, BTREE_ID_xattrs, in seq_insert()
726 bch2_trans_update(trans, &iter, &insert.k_i, 0); in seq_insert()
733 for_each_btree_key_max(trans, iter, BTREE_ID_xattrs, in seq_lookup()
742 for_each_btree_key_commit(trans, iter, BTREE_ID_xattrs, in seq_overwrite()
749 bch2_trans_update(trans, &iter, &u.k_i, 0); in seq_overwrite()