]> git.proxmox.com Git - mirror_qemu.git/blame - tests/test-blockjob-txn.c
blockjob: group BlockJob transaction functions together
[mirror_qemu.git] / tests / test-blockjob-txn.c
CommitLineData
6c6f312d
SH
1/*
2 * Blockjob transactions tests
3 *
4 * Copyright Red Hat, Inc. 2015
5 *
6 * Authors:
7 * Stefan Hajnoczi <stefanha@redhat.com>
8 *
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.
11 */
12
681c28a3 13#include "qemu/osdep.h"
da34e65c 14#include "qapi/error.h"
6c6f312d 15#include "qemu/main-loop.h"
c87621ea 16#include "block/blockjob_int.h"
b75536c9 17#include "sysemu/block-backend.h"
6c6f312d
SH
18
19typedef struct {
20 BlockJob common;
21 unsigned int iterations;
22 bool use_timer;
23 int rc;
24 int *result;
25} TestBlockJob;
26
6c6f312d
SH
27static void test_block_job_complete(BlockJob *job, void *opaque)
28{
b75536c9 29 BlockDriverState *bs = blk_bs(job->blk);
6c6f312d
SH
30 int rc = (intptr_t)opaque;
31
32 if (block_job_is_cancelled(job)) {
33 rc = -ECANCELED;
34 }
35
36 block_job_completed(job, rc);
37 bdrv_unref(bs);
38}
39
40static void coroutine_fn test_block_job_run(void *opaque)
41{
42 TestBlockJob *s = opaque;
43 BlockJob *job = &s->common;
44
45 while (s->iterations--) {
46 if (s->use_timer) {
47 block_job_sleep_ns(job, QEMU_CLOCK_REALTIME, 0);
48 } else {
49 block_job_yield(job);
50 }
51
52 if (block_job_is_cancelled(job)) {
53 break;
54 }
55 }
56
57 block_job_defer_to_main_loop(job, test_block_job_complete,
58 (void *)(intptr_t)s->rc);
59}
60
61typedef struct {
62 TestBlockJob *job;
63 int *result;
64} TestBlockJobCBData;
65
66static void test_block_job_cb(void *opaque, int ret)
67{
68 TestBlockJobCBData *data = opaque;
69 if (!ret && block_job_is_cancelled(&data->job->common)) {
70 ret = -ECANCELED;
71 }
72 *data->result = ret;
73 g_free(data);
74}
75
5ccac6f1
JS
76static const BlockJobDriver test_block_job_driver = {
77 .instance_size = sizeof(TestBlockJob),
78 .start = test_block_job_run,
79};
80
6c6f312d
SH
81/* Create a block job that completes with a given return code after a given
82 * number of event loop iterations. The return code is stored in the given
83 * result pointer.
84 *
85 * The event loop iterations can either be handled automatically with a 0 delay
86 * timer, or they can be stepped manually by entering the coroutine.
87 */
88static BlockJob *test_block_job_start(unsigned int iterations,
89 bool use_timer,
90 int rc, int *result)
91{
92 BlockDriverState *bs;
93 TestBlockJob *s;
94 TestBlockJobCBData *data;
7f0317cf
AG
95 static unsigned counter;
96 char job_id[24];
6c6f312d
SH
97
98 data = g_new0(TestBlockJobCBData, 1);
d185cf0e
KW
99
100 bs = bdrv_open("null-co://", NULL, NULL, 0, &error_abort);
101 g_assert_nonnull(bs);
102
7f0317cf 103 snprintf(job_id, sizeof(job_id), "job%u", counter++);
c6cc12bf
KW
104 s = block_job_create(job_id, &test_block_job_driver, bs,
105 0, BLK_PERM_ALL, 0, BLOCK_JOB_DEFAULT,
106 test_block_job_cb, data, &error_abort);
6c6f312d
SH
107 s->iterations = iterations;
108 s->use_timer = use_timer;
109 s->rc = rc;
110 s->result = result;
6c6f312d
SH
111 data->job = s;
112 data->result = result;
6c6f312d
SH
113 return &s->common;
114}
115
116static void test_single_job(int expected)
117{
118 BlockJob *job;
119 BlockJobTxn *txn;
120 int result = -EINPROGRESS;
121
122 txn = block_job_txn_new();
123 job = test_block_job_start(1, true, expected, &result);
124 block_job_txn_add_job(txn, job);
d90fce94 125 block_job_start(job);
6c6f312d
SH
126
127 if (expected == -ECANCELED) {
128 block_job_cancel(job);
129 }
130
131 while (result == -EINPROGRESS) {
132 aio_poll(qemu_get_aio_context(), true);
133 }
134 g_assert_cmpint(result, ==, expected);
135
136 block_job_txn_unref(txn);
137}
138
139static void test_single_job_success(void)
140{
141 test_single_job(0);
142}
143
144static void test_single_job_failure(void)
145{
146 test_single_job(-EIO);
147}
148
149static void test_single_job_cancel(void)
150{
151 test_single_job(-ECANCELED);
152}
153
154static void test_pair_jobs(int expected1, int expected2)
155{
156 BlockJob *job1;
157 BlockJob *job2;
158 BlockJobTxn *txn;
159 int result1 = -EINPROGRESS;
160 int result2 = -EINPROGRESS;
161
162 txn = block_job_txn_new();
163 job1 = test_block_job_start(1, true, expected1, &result1);
164 block_job_txn_add_job(txn, job1);
165 job2 = test_block_job_start(2, true, expected2, &result2);
166 block_job_txn_add_job(txn, job2);
d90fce94
FZ
167 block_job_start(job1);
168 block_job_start(job2);
6c6f312d
SH
169
170 if (expected1 == -ECANCELED) {
171 block_job_cancel(job1);
172 }
173 if (expected2 == -ECANCELED) {
174 block_job_cancel(job2);
175 }
176
177 while (result1 == -EINPROGRESS || result2 == -EINPROGRESS) {
178 aio_poll(qemu_get_aio_context(), true);
179 }
180
181 /* Failure or cancellation of one job cancels the other job */
182 if (expected1 != 0) {
183 expected2 = -ECANCELED;
184 } else if (expected2 != 0) {
185 expected1 = -ECANCELED;
186 }
187
188 g_assert_cmpint(result1, ==, expected1);
189 g_assert_cmpint(result2, ==, expected2);
190
191 block_job_txn_unref(txn);
192}
193
194static void test_pair_jobs_success(void)
195{
196 test_pair_jobs(0, 0);
197}
198
199static void test_pair_jobs_failure(void)
200{
201 /* Test both orderings. The two jobs run for a different number of
202 * iterations so the code path is different depending on which job fails
203 * first.
204 */
205 test_pair_jobs(-EIO, 0);
206 test_pair_jobs(0, -EIO);
207}
208
209static void test_pair_jobs_cancel(void)
210{
211 test_pair_jobs(-ECANCELED, 0);
212 test_pair_jobs(0, -ECANCELED);
213}
214
215static void test_pair_jobs_fail_cancel_race(void)
216{
217 BlockJob *job1;
218 BlockJob *job2;
219 BlockJobTxn *txn;
220 int result1 = -EINPROGRESS;
221 int result2 = -EINPROGRESS;
222
223 txn = block_job_txn_new();
224 job1 = test_block_job_start(1, true, -ECANCELED, &result1);
225 block_job_txn_add_job(txn, job1);
226 job2 = test_block_job_start(2, false, 0, &result2);
227 block_job_txn_add_job(txn, job2);
d90fce94
FZ
228 block_job_start(job1);
229 block_job_start(job2);
6c6f312d
SH
230
231 block_job_cancel(job1);
232
233 /* Now make job2 finish before the main loop kicks jobs. This simulates
234 * the race between a pending kick and another job completing.
235 */
236 block_job_enter(job2);
237 block_job_enter(job2);
238
239 while (result1 == -EINPROGRESS || result2 == -EINPROGRESS) {
240 aio_poll(qemu_get_aio_context(), true);
241 }
242
243 g_assert_cmpint(result1, ==, -ECANCELED);
244 g_assert_cmpint(result2, ==, -ECANCELED);
245
246 block_job_txn_unref(txn);
247}
248
249int main(int argc, char **argv)
250{
251 qemu_init_main_loop(&error_abort);
d185cf0e 252 bdrv_init();
6c6f312d
SH
253
254 g_test_init(&argc, &argv, NULL);
255 g_test_add_func("/single/success", test_single_job_success);
256 g_test_add_func("/single/failure", test_single_job_failure);
257 g_test_add_func("/single/cancel", test_single_job_cancel);
258 g_test_add_func("/pair/success", test_pair_jobs_success);
259 g_test_add_func("/pair/failure", test_pair_jobs_failure);
260 g_test_add_func("/pair/cancel", test_pair_jobs_cancel);
261 g_test_add_func("/pair/fail-cancel-race", test_pair_jobs_fail_cancel_race);
262 return g_test_run();
263}