xref: /openbmc/qemu/block/stream.c (revision a322714248b9e8dffe6a2bb379ffd5d59b394bb7)
1 /*
2  * Image streaming
3  *
4  * Copyright IBM, Corp. 2011
5  *
6  * Authors:
7  *  Stefan Hajnoczi   <stefanha@linux.vnet.ibm.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  */
13 
14 #include "qemu/osdep.h"
15 #include "trace.h"
16 #include "block/block_int.h"
17 #include "block/blockjob_int.h"
18 #include "qapi/error.h"
19 #include "qapi/qmp/qerror.h"
20 #include "qemu/ratelimit.h"
21 #include "sysemu/block-backend.h"
22 
23 enum {
24     /*
25      * Size of data buffer for populating the image file.  This should be large
26      * enough to process multiple clusters in a single call, so that populating
27      * contiguous regions of the image is efficient.
28      */
29     STREAM_BUFFER_SIZE = 512 * 1024, /* in bytes */
30 };
31 
32 typedef struct StreamBlockJob {
33     BlockJob common;
34     BlockDriverState *base;
35     BlockdevOnError on_error;
36     char *backing_file_str;
37     int bs_flags;
38 } StreamBlockJob;
39 
40 static int coroutine_fn stream_populate(BlockBackend *blk,
41                                         int64_t offset, uint64_t bytes,
42                                         void *buf)
43 {
44     struct iovec iov = {
45         .iov_base = buf,
46         .iov_len  = bytes,
47     };
48     QEMUIOVector qiov;
49 
50     assert(bytes < SIZE_MAX);
51     qemu_iovec_init_external(&qiov, &iov, 1);
52 
53     /* Copy-on-read the unallocated clusters */
54     return blk_co_preadv(blk, offset, qiov.size, &qiov, BDRV_REQ_COPY_ON_READ);
55 }
56 
57 typedef struct {
58     int ret;
59 } StreamCompleteData;
60 
61 static void stream_complete(BlockJob *job, void *opaque)
62 {
63     StreamBlockJob *s = container_of(job, StreamBlockJob, common);
64     StreamCompleteData *data = opaque;
65     BlockDriverState *bs = blk_bs(job->blk);
66     BlockDriverState *base = s->base;
67     Error *local_err = NULL;
68 
69     if (!block_job_is_cancelled(&s->common) && bs->backing &&
70         data->ret == 0) {
71         const char *base_id = NULL, *base_fmt = NULL;
72         if (base) {
73             base_id = s->backing_file_str;
74             if (base->drv) {
75                 base_fmt = base->drv->format_name;
76             }
77         }
78         data->ret = bdrv_change_backing_file(bs, base_id, base_fmt);
79         bdrv_set_backing_hd(bs, base, &local_err);
80         if (local_err) {
81             error_report_err(local_err);
82             data->ret = -EPERM;
83             goto out;
84         }
85     }
86 
87 out:
88     /* Reopen the image back in read-only mode if necessary */
89     if (s->bs_flags != bdrv_get_flags(bs)) {
90         /* Give up write permissions before making it read-only */
91         blk_set_perm(job->blk, 0, BLK_PERM_ALL, &error_abort);
92         bdrv_reopen(bs, s->bs_flags, NULL);
93     }
94 
95     g_free(s->backing_file_str);
96     block_job_completed(&s->common, data->ret);
97     g_free(data);
98 }
99 
100 static void coroutine_fn stream_run(void *opaque)
101 {
102     StreamBlockJob *s = opaque;
103     StreamCompleteData *data;
104     BlockBackend *blk = s->common.blk;
105     BlockDriverState *bs = blk_bs(blk);
106     BlockDriverState *base = s->base;
107     int64_t len;
108     int64_t offset = 0;
109     uint64_t delay_ns = 0;
110     int error = 0;
111     int ret = 0;
112     int64_t n = 0; /* bytes */
113     void *buf;
114 
115     if (!bs->backing) {
116         goto out;
117     }
118 
119     len = bdrv_getlength(bs);
120     if (len < 0) {
121         ret = len;
122         goto out;
123     }
124     block_job_progress_set_remaining(&s->common, len);
125 
126     buf = qemu_blockalign(bs, STREAM_BUFFER_SIZE);
127 
128     /* Turn on copy-on-read for the whole block device so that guest read
129      * requests help us make progress.  Only do this when copying the entire
130      * backing chain since the copy-on-read operation does not take base into
131      * account.
132      */
133     if (!base) {
134         bdrv_enable_copy_on_read(bs);
135     }
136 
137     for ( ; offset < len; offset += n) {
138         bool copy;
139 
140         /* Note that even when no rate limit is applied we need to yield
141          * with no pending I/O here so that bdrv_drain_all() returns.
142          */
143         block_job_sleep_ns(&s->common, delay_ns);
144         if (block_job_is_cancelled(&s->common)) {
145             break;
146         }
147 
148         copy = false;
149 
150         ret = bdrv_is_allocated(bs, offset, STREAM_BUFFER_SIZE, &n);
151         if (ret == 1) {
152             /* Allocated in the top, no need to copy.  */
153         } else if (ret >= 0) {
154             /* Copy if allocated in the intermediate images.  Limit to the
155              * known-unallocated area [offset, offset+n*BDRV_SECTOR_SIZE).  */
156             ret = bdrv_is_allocated_above(backing_bs(bs), base,
157                                           offset, n, &n);
158 
159             /* Finish early if end of backing file has been reached */
160             if (ret == 0 && n == 0) {
161                 n = len - offset;
162             }
163 
164             copy = (ret == 1);
165         }
166         trace_stream_one_iteration(s, offset, n, ret);
167         if (copy) {
168             ret = stream_populate(blk, offset, n, buf);
169         }
170         if (ret < 0) {
171             BlockErrorAction action =
172                 block_job_error_action(&s->common, s->on_error, true, -ret);
173             if (action == BLOCK_ERROR_ACTION_STOP) {
174                 n = 0;
175                 continue;
176             }
177             if (error == 0) {
178                 error = ret;
179             }
180             if (action == BLOCK_ERROR_ACTION_REPORT) {
181                 break;
182             }
183         }
184         ret = 0;
185 
186         /* Publish progress */
187         block_job_progress_update(&s->common, n);
188         if (copy) {
189             delay_ns = block_job_ratelimit_get_delay(&s->common, n);
190         } else {
191             delay_ns = 0;
192         }
193     }
194 
195     if (!base) {
196         bdrv_disable_copy_on_read(bs);
197     }
198 
199     /* Do not remove the backing file if an error was there but ignored.  */
200     ret = error;
201 
202     qemu_vfree(buf);
203 
204 out:
205     /* Modify backing chain and close BDSes in main loop */
206     data = g_malloc(sizeof(*data));
207     data->ret = ret;
208     block_job_defer_to_main_loop(&s->common, stream_complete, data);
209 }
210 
211 static const BlockJobDriver stream_job_driver = {
212     .instance_size = sizeof(StreamBlockJob),
213     .job_type      = BLOCK_JOB_TYPE_STREAM,
214     .start         = stream_run,
215 };
216 
217 void stream_start(const char *job_id, BlockDriverState *bs,
218                   BlockDriverState *base, const char *backing_file_str,
219                   int64_t speed, BlockdevOnError on_error, Error **errp)
220 {
221     StreamBlockJob *s;
222     BlockDriverState *iter;
223     int orig_bs_flags;
224 
225     /* Make sure that the image is opened in read-write mode */
226     orig_bs_flags = bdrv_get_flags(bs);
227     if (!(orig_bs_flags & BDRV_O_RDWR)) {
228         if (bdrv_reopen(bs, orig_bs_flags | BDRV_O_RDWR, errp) != 0) {
229             return;
230         }
231     }
232 
233     /* Prevent concurrent jobs trying to modify the graph structure here, we
234      * already have our own plans. Also don't allow resize as the image size is
235      * queried only at the job start and then cached. */
236     s = block_job_create(job_id, &stream_job_driver, NULL, bs,
237                          BLK_PERM_CONSISTENT_READ | BLK_PERM_WRITE_UNCHANGED |
238                          BLK_PERM_GRAPH_MOD,
239                          BLK_PERM_CONSISTENT_READ | BLK_PERM_WRITE_UNCHANGED |
240                          BLK_PERM_WRITE,
241                          speed, BLOCK_JOB_DEFAULT, NULL, NULL, errp);
242     if (!s) {
243         goto fail;
244     }
245 
246     /* Block all intermediate nodes between bs and base, because they will
247      * disappear from the chain after this operation. The streaming job reads
248      * every block only once, assuming that it doesn't change, so block writes
249      * and resizes. */
250     for (iter = backing_bs(bs); iter && iter != base; iter = backing_bs(iter)) {
251         block_job_add_bdrv(&s->common, "intermediate node", iter, 0,
252                            BLK_PERM_CONSISTENT_READ | BLK_PERM_WRITE_UNCHANGED,
253                            &error_abort);
254     }
255 
256     s->base = base;
257     s->backing_file_str = g_strdup(backing_file_str);
258     s->bs_flags = orig_bs_flags;
259 
260     s->on_error = on_error;
261     trace_stream_start(bs, base, s);
262     block_job_start(&s->common);
263     return;
264 
265 fail:
266     if (orig_bs_flags != bdrv_get_flags(bs)) {
267         bdrv_reopen(bs, orig_bs_flags, NULL);
268     }
269 }
270