]> git.proxmox.com Git - mirror_qemu.git/blame - tests/test-blockjob-txn.c
qdev: Check dev->realized at set_size()
[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"
ca1ef1e6 18#include "qapi/qmp/qdict.h"
6c6f312d
SH
19
20typedef struct {
21 BlockJob common;
22 unsigned int iterations;
23 bool use_timer;
24 int rc;
25 int *result;
26} TestBlockJob;
27
e4dad427 28static void test_block_job_clean(Job *job)
6c6f312d 29{
1908a559
KW
30 BlockJob *bjob = container_of(job, BlockJob, job);
31 BlockDriverState *bs = blk_bs(bjob->blk);
6c6f312d 32
6c6f312d
SH
33 bdrv_unref(bs);
34}
35
f67432a2 36static int coroutine_fn test_block_job_run(Job *job, Error **errp)
6c6f312d 37{
f67432a2 38 TestBlockJob *s = container_of(job, TestBlockJob, common.job);
6c6f312d
SH
39
40 while (s->iterations--) {
41 if (s->use_timer) {
f67432a2 42 job_sleep_ns(job, 0);
6c6f312d 43 } else {
f67432a2 44 job_yield(job);
6c6f312d
SH
45 }
46
f67432a2 47 if (job_is_cancelled(job)) {
6c6f312d
SH
48 break;
49 }
50 }
51
f67432a2 52 return s->rc;
6c6f312d
SH
53}
54
55typedef struct {
56 TestBlockJob *job;
57 int *result;
58} TestBlockJobCBData;
59
60static void test_block_job_cb(void *opaque, int ret)
61{
62 TestBlockJobCBData *data = opaque;
daa7f2f9 63 if (!ret && job_is_cancelled(&data->job->common.job)) {
6c6f312d
SH
64 ret = -ECANCELED;
65 }
66 *data->result = ret;
67 g_free(data);
68}
69
5ccac6f1 70static const BlockJobDriver test_block_job_driver = {
33e9e9bd
KW
71 .job_driver = {
72 .instance_size = sizeof(TestBlockJob),
80fa2c75 73 .free = block_job_free,
b15de828 74 .user_resume = block_job_user_resume,
f67432a2 75 .run = test_block_job_run,
e4dad427 76 .clean = test_block_job_clean,
33e9e9bd 77 },
5ccac6f1
JS
78};
79
6c6f312d
SH
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
82 * result pointer.
83 *
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.
86 */
87static BlockJob *test_block_job_start(unsigned int iterations,
88 bool use_timer,
62c9e416 89 int rc, int *result, JobTxn *txn)
6c6f312d
SH
90{
91 BlockDriverState *bs;
92 TestBlockJob *s;
93 TestBlockJobCBData *data;
7f0317cf
AG
94 static unsigned counter;
95 char job_id[24];
6c6f312d
SH
96
97 data = g_new0(TestBlockJobCBData, 1);
d185cf0e 98
ca1ef1e6
AS
99 QDict *opt = qdict_new();
100 qdict_put_str(opt, "file.read-zeroes", "on");
101 bs = bdrv_open("null-co://", NULL, opt, 0, &error_abort);
d185cf0e
KW
102 g_assert_nonnull(bs);
103
7f0317cf 104 snprintf(job_id, sizeof(job_id), "job%u", counter++);
75859b94 105 s = block_job_create(job_id, &test_block_job_driver, txn, bs,
bb02b65c 106 0, BLK_PERM_ALL, 0, JOB_DEFAULT,
c6cc12bf 107 test_block_job_cb, data, &error_abort);
6c6f312d
SH
108 s->iterations = iterations;
109 s->use_timer = use_timer;
110 s->rc = rc;
111 s->result = result;
6c6f312d
SH
112 data->job = s;
113 data->result = result;
6c6f312d
SH
114 return &s->common;
115}
116
117static void test_single_job(int expected)
118{
119 BlockJob *job;
62c9e416 120 JobTxn *txn;
6c6f312d
SH
121 int result = -EINPROGRESS;
122
7eaa8fb5 123 txn = job_txn_new();
75859b94 124 job = test_block_job_start(1, true, expected, &result, txn);
da01ff7f 125 job_start(&job->job);
6c6f312d
SH
126
127 if (expected == -ECANCELED) {
3d70ff53 128 job_cancel(&job->job, false);
6c6f312d
SH
129 }
130
131 while (result == -EINPROGRESS) {
132 aio_poll(qemu_get_aio_context(), true);
133 }
134 g_assert_cmpint(result, ==, expected);
135
7eaa8fb5 136 job_txn_unref(txn);
6c6f312d
SH
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;
62c9e416 158 JobTxn *txn;
6c6f312d
SH
159 int result1 = -EINPROGRESS;
160 int result2 = -EINPROGRESS;
161
7eaa8fb5 162 txn = job_txn_new();
75859b94
JS
163 job1 = test_block_job_start(1, true, expected1, &result1, txn);
164 job2 = test_block_job_start(2, true, expected2, &result2, txn);
da01ff7f
KW
165 job_start(&job1->job);
166 job_start(&job2->job);
6c6f312d 167
7e74a734
PB
168 /* Release our reference now to trigger as many nice
169 * use-after-free bugs as possible.
170 */
7eaa8fb5 171 job_txn_unref(txn);
7e74a734 172
6c6f312d 173 if (expected1 == -ECANCELED) {
3d70ff53 174 job_cancel(&job1->job, false);
6c6f312d
SH
175 }
176 if (expected2 == -ECANCELED) {
3d70ff53 177 job_cancel(&job2->job, false);
6c6f312d
SH
178 }
179
180 while (result1 == -EINPROGRESS || result2 == -EINPROGRESS) {
181 aio_poll(qemu_get_aio_context(), true);
182 }
183
184 /* Failure or cancellation of one job cancels the other job */
185 if (expected1 != 0) {
186 expected2 = -ECANCELED;
187 } else if (expected2 != 0) {
188 expected1 = -ECANCELED;
189 }
190
191 g_assert_cmpint(result1, ==, expected1);
192 g_assert_cmpint(result2, ==, expected2);
6c6f312d
SH
193}
194
195static void test_pair_jobs_success(void)
196{
197 test_pair_jobs(0, 0);
198}
199
200static void test_pair_jobs_failure(void)
201{
202 /* Test both orderings. The two jobs run for a different number of
203 * iterations so the code path is different depending on which job fails
204 * first.
205 */
206 test_pair_jobs(-EIO, 0);
207 test_pair_jobs(0, -EIO);
208}
209
210static void test_pair_jobs_cancel(void)
211{
212 test_pair_jobs(-ECANCELED, 0);
213 test_pair_jobs(0, -ECANCELED);
214}
215
216static void test_pair_jobs_fail_cancel_race(void)
217{
218 BlockJob *job1;
219 BlockJob *job2;
62c9e416 220 JobTxn *txn;
6c6f312d
SH
221 int result1 = -EINPROGRESS;
222 int result2 = -EINPROGRESS;
223
7eaa8fb5 224 txn = job_txn_new();
75859b94
JS
225 job1 = test_block_job_start(1, true, -ECANCELED, &result1, txn);
226 job2 = test_block_job_start(2, false, 0, &result2, txn);
da01ff7f
KW
227 job_start(&job1->job);
228 job_start(&job2->job);
6c6f312d 229
3d70ff53 230 job_cancel(&job1->job, false);
6c6f312d
SH
231
232 /* Now make job2 finish before the main loop kicks jobs. This simulates
233 * the race between a pending kick and another job completing.
234 */
3d70ff53
KW
235 job_enter(&job2->job);
236 job_enter(&job2->job);
6c6f312d
SH
237
238 while (result1 == -EINPROGRESS || result2 == -EINPROGRESS) {
239 aio_poll(qemu_get_aio_context(), true);
240 }
241
242 g_assert_cmpint(result1, ==, -ECANCELED);
243 g_assert_cmpint(result2, ==, -ECANCELED);
244
7eaa8fb5 245 job_txn_unref(txn);
6c6f312d
SH
246}
247
248int main(int argc, char **argv)
249{
250 qemu_init_main_loop(&error_abort);
d185cf0e 251 bdrv_init();
6c6f312d
SH
252
253 g_test_init(&argc, &argv, NULL);
254 g_test_add_func("/single/success", test_single_job_success);
255 g_test_add_func("/single/failure", test_single_job_failure);
256 g_test_add_func("/single/cancel", test_single_job_cancel);
257 g_test_add_func("/pair/success", test_pair_jobs_success);
258 g_test_add_func("/pair/failure", test_pair_jobs_failure);
259 g_test_add_func("/pair/cancel", test_pair_jobs_cancel);
260 g_test_add_func("/pair/fail-cancel-race", test_pair_jobs_fail_cancel_race);
261 return g_test_run();
262}