2 * Blockjob transactions tests
4 * Copyright Red Hat, Inc. 2015
7 * Stefan Hajnoczi <stefanha@redhat.com>
9 * This work is licensed under the terms of the GNU LGPL, version 2 or later.
10 * See the COPYING.LIB file in the top-level directory.
13 #include "qemu/osdep.h"
14 #include "qapi/error.h"
15 #include "qemu/main-loop.h"
16 #include "block/blockjob_int.h"
17 #include "sysemu/block-backend.h"
21 unsigned int iterations
;
27 static void test_block_job_clean(Job
*job
)
29 BlockJob
*bjob
= container_of(job
, BlockJob
, job
);
30 BlockDriverState
*bs
= blk_bs(bjob
->blk
);
35 static int coroutine_fn
test_block_job_run(Job
*job
, Error
**errp
)
37 TestBlockJob
*s
= container_of(job
, TestBlockJob
, common
.job
);
39 while (s
->iterations
--) {
46 if (job_is_cancelled(job
)) {
59 static void test_block_job_cb(void *opaque
, int ret
)
61 TestBlockJobCBData
*data
= opaque
;
62 if (!ret
&& job_is_cancelled(&data
->job
->common
.job
)) {
69 static const BlockJobDriver test_block_job_driver
= {
71 .instance_size
= sizeof(TestBlockJob
),
72 .free
= block_job_free
,
73 .user_resume
= block_job_user_resume
,
74 .drain
= block_job_drain
,
75 .run
= test_block_job_run
,
76 .clean
= test_block_job_clean
,
80 /* Create a block job that completes with a given return code after a given
81 * number of event loop iterations. The return code is stored in the given
84 * The event loop iterations can either be handled automatically with a 0 delay
85 * timer, or they can be stepped manually by entering the coroutine.
87 static BlockJob
*test_block_job_start(unsigned int iterations
,
89 int rc
, int *result
, JobTxn
*txn
)
93 TestBlockJobCBData
*data
;
94 static unsigned counter
;
97 data
= g_new0(TestBlockJobCBData
, 1);
99 bs
= bdrv_open("null-co://", NULL
, NULL
, 0, &error_abort
);
100 g_assert_nonnull(bs
);
102 snprintf(job_id
, sizeof(job_id
), "job%u", counter
++);
103 s
= block_job_create(job_id
, &test_block_job_driver
, txn
, bs
,
104 0, BLK_PERM_ALL
, 0, JOB_DEFAULT
,
105 test_block_job_cb
, data
, &error_abort
);
106 s
->iterations
= iterations
;
107 s
->use_timer
= use_timer
;
111 data
->result
= result
;
115 static void test_single_job(int expected
)
119 int result
= -EINPROGRESS
;
122 job
= test_block_job_start(1, true, expected
, &result
, txn
);
123 job_start(&job
->job
);
125 if (expected
== -ECANCELED
) {
126 job_cancel(&job
->job
, false);
129 while (result
== -EINPROGRESS
) {
130 aio_poll(qemu_get_aio_context(), true);
132 g_assert_cmpint(result
, ==, expected
);
137 static void test_single_job_success(void)
142 static void test_single_job_failure(void)
144 test_single_job(-EIO
);
147 static void test_single_job_cancel(void)
149 test_single_job(-ECANCELED
);
152 static void test_pair_jobs(int expected1
, int expected2
)
157 int result1
= -EINPROGRESS
;
158 int result2
= -EINPROGRESS
;
161 job1
= test_block_job_start(1, true, expected1
, &result1
, txn
);
162 job2
= test_block_job_start(2, true, expected2
, &result2
, txn
);
163 job_start(&job1
->job
);
164 job_start(&job2
->job
);
166 /* Release our reference now to trigger as many nice
167 * use-after-free bugs as possible.
171 if (expected1
== -ECANCELED
) {
172 job_cancel(&job1
->job
, false);
174 if (expected2
== -ECANCELED
) {
175 job_cancel(&job2
->job
, false);
178 while (result1
== -EINPROGRESS
|| result2
== -EINPROGRESS
) {
179 aio_poll(qemu_get_aio_context(), true);
182 /* Failure or cancellation of one job cancels the other job */
183 if (expected1
!= 0) {
184 expected2
= -ECANCELED
;
185 } else if (expected2
!= 0) {
186 expected1
= -ECANCELED
;
189 g_assert_cmpint(result1
, ==, expected1
);
190 g_assert_cmpint(result2
, ==, expected2
);
193 static void test_pair_jobs_success(void)
195 test_pair_jobs(0, 0);
198 static void test_pair_jobs_failure(void)
200 /* Test both orderings. The two jobs run for a different number of
201 * iterations so the code path is different depending on which job fails
204 test_pair_jobs(-EIO
, 0);
205 test_pair_jobs(0, -EIO
);
208 static void test_pair_jobs_cancel(void)
210 test_pair_jobs(-ECANCELED
, 0);
211 test_pair_jobs(0, -ECANCELED
);
214 static void test_pair_jobs_fail_cancel_race(void)
219 int result1
= -EINPROGRESS
;
220 int result2
= -EINPROGRESS
;
223 job1
= test_block_job_start(1, true, -ECANCELED
, &result1
, txn
);
224 job2
= test_block_job_start(2, false, 0, &result2
, txn
);
225 job_start(&job1
->job
);
226 job_start(&job2
->job
);
228 job_cancel(&job1
->job
, false);
230 /* Now make job2 finish before the main loop kicks jobs. This simulates
231 * the race between a pending kick and another job completing.
233 job_enter(&job2
->job
);
234 job_enter(&job2
->job
);
236 while (result1
== -EINPROGRESS
|| result2
== -EINPROGRESS
) {
237 aio_poll(qemu_get_aio_context(), true);
240 g_assert_cmpint(result1
, ==, -ECANCELED
);
241 g_assert_cmpint(result2
, ==, -ECANCELED
);
246 int main(int argc
, char **argv
)
248 qemu_init_main_loop(&error_abort
);
251 g_test_init(&argc
, &argv
, NULL
);
252 g_test_add_func("/single/success", test_single_job_success
);
253 g_test_add_func("/single/failure", test_single_job_failure
);
254 g_test_add_func("/single/cancel", test_single_job_cancel
);
255 g_test_add_func("/pair/success", test_pair_jobs_success
);
256 g_test_add_func("/pair/failure", test_pair_jobs_failure
);
257 g_test_add_func("/pair/cancel", test_pair_jobs_cancel
);
258 g_test_add_func("/pair/fail-cancel-race", test_pair_jobs_fail_cancel_race
);