blob: be21518c5708e6f720c15757a870f11c5d342402 [file] [log] [blame]
Eduardo Habkost9a4ac512014-10-01 14:47:33 -03001/*
2 * QEMU System Emulator
3 *
4 * Copyright (c) 2003-2008 Fabrice Bellard
5 *
6 * Permission is hereby granted, free of charge, to any person obtaining a copy
7 * of this software and associated documentation files (the "Software"), to deal
8 * in the Software without restriction, including without limitation the rights
9 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
10 * copies of the Software, and to permit persons to whom the Software is
11 * furnished to do so, subject to the following conditions:
12 *
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
15 *
16 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
17 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
18 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
19 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
20 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
21 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
22 * THE SOFTWARE.
23 */
Peter Maydell1393a482016-01-26 18:16:54 +000024#include "qemu/osdep.h"
Liang Li44f0ead2015-03-23 16:32:19 +080025#include <zlib.h>
Markus Armbrusterd49b6832015-03-17 18:29:20 +010026#include "qemu/error-report.h"
Eduardo Habkost093c4552013-11-28 12:01:16 -020027#include "qemu/iov.h"
Juan Quintela6666c962017-04-24 20:07:27 +020028#include "migration.h"
Juan Quintela08a0aee2017-04-20 18:52:18 +020029#include "qemu-file.h"
Alexey Kardashevskiy9013dca2014-03-11 10:42:29 +110030#include "trace.h"
Yury Kotov3d661c82019-04-22 13:34:20 +030031#include "qapi/error.h"
Eduardo Habkost093c4552013-11-28 12:01:16 -020032
Daniel P. Berrangea24939f2016-04-27 11:05:13 +010033#define IO_BUF_SIZE 32768
Eric Blakef9919112020-06-25 11:26:02 -050034#define MAX_IOV_SIZE MIN_CONST(IOV_MAX, 64)
Daniel P. Berrangea24939f2016-04-27 11:05:13 +010035
36struct QEMUFile {
37 const QEMUFileOps *ops;
38 const QEMUFileHooks *hooks;
39 void *opaque;
40
41 int64_t bytes_xfer;
42 int64_t xfer_limit;
43
44 int64_t pos; /* start of buffer when writing, end of buffer
45 when reading */
46 int buf_index;
47 int buf_size; /* 0 when writing */
48 uint8_t buf[IO_BUF_SIZE];
49
Pavel Butsykin53f09a12017-02-03 18:23:20 +030050 DECLARE_BITMAP(may_free, MAX_IOV_SIZE);
Daniel P. Berrangea24939f2016-04-27 11:05:13 +010051 struct iovec iov[MAX_IOV_SIZE];
52 unsigned int iovcnt;
53
54 int last_error;
Yury Kotov3d661c82019-04-22 13:34:20 +030055 Error *last_error_obj;
Juan Quintelaa555b802019-12-18 05:11:31 +010056 /* has the file has been shutdown */
57 bool shutdown;
Daniel P. Berrangea24939f2016-04-27 11:05:13 +010058};
59
Dr. David Alan Gilberte1a8c9b2015-01-08 11:11:30 +000060/*
61 * Stop a file from being read/written - not all backing files can do this
62 * typically only sockets can.
63 */
64int qemu_file_shutdown(QEMUFile *f)
65{
Juan Quintelaa555b802019-12-18 05:11:31 +010066 int ret;
67
68 f->shutdown = true;
Dr. David Alan Gilberte1a8c9b2015-01-08 11:11:30 +000069 if (!f->ops->shut_down) {
70 return -ENOSYS;
71 }
Juan Quintelaa555b802019-12-18 05:11:31 +010072 ret = f->ops->shut_down(f->opaque, true, true, NULL);
73
74 if (!f->last_error) {
75 qemu_file_set_error(f, -EIO);
76 }
77 return ret;
Dr. David Alan Gilberte1a8c9b2015-01-08 11:11:30 +000078}
79
Dr. David Alan Gilbertadc468e2015-11-05 18:10:43 +000080/*
81 * Result: QEMUFile* for a 'return path' for comms in the opposite direction
82 * NULL if not available
83 */
84QEMUFile *qemu_file_get_return_path(QEMUFile *f)
85{
86 if (!f->ops->get_return_path) {
87 return NULL;
88 }
89 return f->ops->get_return_path(f->opaque);
90}
91
Eduardo Habkost093c4552013-11-28 12:01:16 -020092bool qemu_file_mode_is_not_valid(const char *mode)
93{
94 if (mode == NULL ||
95 (mode[0] != 'r' && mode[0] != 'w') ||
96 mode[1] != 'b' || mode[2] != 0) {
97 fprintf(stderr, "qemu_fopen: Argument validity check failed\n");
98 return true;
99 }
100
101 return false;
102}
103
Eduardo Habkost093c4552013-11-28 12:01:16 -0200104QEMUFile *qemu_fopen_ops(void *opaque, const QEMUFileOps *ops)
105{
106 QEMUFile *f;
107
Markus Armbruster97f3ad32015-09-14 13:51:31 +0200108 f = g_new0(QEMUFile, 1);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200109
110 f->opaque = opaque;
111 f->ops = ops;
112 return f;
113}
114
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100115
116void qemu_file_set_hooks(QEMUFile *f, const QEMUFileHooks *hooks)
117{
118 f->hooks = hooks;
119}
120
Eduardo Habkost093c4552013-11-28 12:01:16 -0200121/*
Yury Kotov3d661c82019-04-22 13:34:20 +0300122 * Get last error for stream f with optional Error*
123 *
124 * Return negative error value if there has been an error on previous
125 * operations, return 0 if no error happened.
126 * Optional, it returns Error* in errp, but it may be NULL even if return value
127 * is not 0.
128 *
129 */
130int qemu_file_get_error_obj(QEMUFile *f, Error **errp)
131{
132 if (errp) {
133 *errp = f->last_error_obj ? error_copy(f->last_error_obj) : NULL;
134 }
135 return f->last_error;
136}
137
138/*
139 * Set the last error for stream f with optional Error*
140 */
141void qemu_file_set_error_obj(QEMUFile *f, int ret, Error *err)
142{
143 if (f->last_error == 0 && ret) {
144 f->last_error = ret;
145 error_propagate(&f->last_error_obj, err);
146 } else if (err) {
147 error_report_err(err);
148 }
149}
150
151/*
Eduardo Habkost093c4552013-11-28 12:01:16 -0200152 * Get last error for stream f
153 *
154 * Return negative error value if there has been an error on previous
155 * operations, return 0 if no error happened.
156 *
157 */
158int qemu_file_get_error(QEMUFile *f)
159{
Yury Kotov3d661c82019-04-22 13:34:20 +0300160 return qemu_file_get_error_obj(f, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200161}
162
Yury Kotov3d661c82019-04-22 13:34:20 +0300163/*
164 * Set the last error for stream f
165 */
Eduardo Habkost093c4552013-11-28 12:01:16 -0200166void qemu_file_set_error(QEMUFile *f, int ret)
167{
Yury Kotov3d661c82019-04-22 13:34:20 +0300168 qemu_file_set_error_obj(f, ret, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200169}
170
Eduardo Habkoste68dd362014-10-01 17:34:34 -0300171bool qemu_file_is_writable(QEMUFile *f)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200172{
Daniel P. Berrange11808bb2016-04-27 11:05:17 +0100173 return f->ops->writev_buffer;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200174}
175
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300176static void qemu_iovec_release_ram(QEMUFile *f)
177{
178 struct iovec iov;
179 unsigned long idx;
180
181 /* Find and release all the contiguous memory ranges marked as may_free. */
182 idx = find_next_bit(f->may_free, f->iovcnt, 0);
183 if (idx >= f->iovcnt) {
184 return;
185 }
186 iov = f->iov[idx];
187
188 /* The madvise() in the loop is called for iov within a continuous range and
189 * then reinitialize the iov. And in the end, madvise() is called for the
190 * last iov.
191 */
192 while ((idx = find_next_bit(f->may_free, f->iovcnt, idx + 1)) < f->iovcnt) {
193 /* check for adjacent buffer and coalesce them */
194 if (iov.iov_base + iov.iov_len == f->iov[idx].iov_base) {
195 iov.iov_len += f->iov[idx].iov_len;
196 continue;
197 }
198 if (qemu_madvise(iov.iov_base, iov.iov_len, QEMU_MADV_DONTNEED) < 0) {
199 error_report("migrate: madvise DONTNEED failed %p %zd: %s",
200 iov.iov_base, iov.iov_len, strerror(errno));
201 }
202 iov = f->iov[idx];
203 }
204 if (qemu_madvise(iov.iov_base, iov.iov_len, QEMU_MADV_DONTNEED) < 0) {
205 error_report("migrate: madvise DONTNEED failed %p %zd: %s",
206 iov.iov_base, iov.iov_len, strerror(errno));
207 }
208 memset(f->may_free, 0, sizeof(f->may_free));
209}
210
Eduardo Habkost093c4552013-11-28 12:01:16 -0200211/**
212 * Flushes QEMUFile buffer
213 *
Dr. David Alan Gilbert3b348702019-08-23 11:39:46 +0100214 * This will flush all pending data. If data was only partially flushed, it
215 * will set an error state.
Eduardo Habkost093c4552013-11-28 12:01:16 -0200216 */
217void qemu_fflush(QEMUFile *f)
218{
219 ssize_t ret = 0;
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100220 ssize_t expect = 0;
Yury Kotov3d661c82019-04-22 13:34:20 +0300221 Error *local_error = NULL;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200222
223 if (!qemu_file_is_writable(f)) {
224 return;
225 }
226
Juan Quintelaa555b802019-12-18 05:11:31 +0100227 if (f->shutdown) {
228 return;
229 }
Daniel P. Berrange11808bb2016-04-27 11:05:17 +0100230 if (f->iovcnt > 0) {
231 expect = iov_size(f->iov, f->iovcnt);
Yury Kotov3d661c82019-04-22 13:34:20 +0300232 ret = f->ops->writev_buffer(f->opaque, f->iov, f->iovcnt, f->pos,
233 &local_error);
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300234
235 qemu_iovec_release_ram(f);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200236 }
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100237
Eduardo Habkost093c4552013-11-28 12:01:16 -0200238 if (ret >= 0) {
239 f->pos += ret;
240 }
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100241 /* We expect the QEMUFile write impl to send the full
242 * data set we requested, so sanity check that.
243 */
244 if (ret != expect) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300245 qemu_file_set_error_obj(f, ret < 0 ? ret : -EIO, local_error);
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100246 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200247 f->buf_index = 0;
248 f->iovcnt = 0;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200249}
250
251void ram_control_before_iterate(QEMUFile *f, uint64_t flags)
252{
253 int ret = 0;
254
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100255 if (f->hooks && f->hooks->before_ram_iterate) {
256 ret = f->hooks->before_ram_iterate(f, f->opaque, flags, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200257 if (ret < 0) {
258 qemu_file_set_error(f, ret);
259 }
260 }
261}
262
263void ram_control_after_iterate(QEMUFile *f, uint64_t flags)
264{
265 int ret = 0;
266
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100267 if (f->hooks && f->hooks->after_ram_iterate) {
268 ret = f->hooks->after_ram_iterate(f, f->opaque, flags, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200269 if (ret < 0) {
270 qemu_file_set_error(f, ret);
271 }
272 }
273}
274
Dr. David Alan Gilbert632e3a52015-06-11 18:17:23 +0100275void ram_control_load_hook(QEMUFile *f, uint64_t flags, void *data)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200276{
277 int ret = -EINVAL;
278
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100279 if (f->hooks && f->hooks->hook_ram_load) {
280 ret = f->hooks->hook_ram_load(f, f->opaque, flags, data);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200281 if (ret < 0) {
282 qemu_file_set_error(f, ret);
283 }
284 } else {
Dr. David Alan Gilbert632e3a52015-06-11 18:17:23 +0100285 /*
286 * Hook is a hook specifically requested by the source sending a flag
287 * that expects there to be a hook on the destination.
288 */
289 if (flags == RAM_CONTROL_HOOK) {
290 qemu_file_set_error(f, ret);
291 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200292 }
293}
294
295size_t ram_control_save_page(QEMUFile *f, ram_addr_t block_offset,
Juan Quintela6e1dea42015-02-12 19:02:42 +0100296 ram_addr_t offset, size_t size,
297 uint64_t *bytes_sent)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200298{
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100299 if (f->hooks && f->hooks->save_page) {
300 int ret = f->hooks->save_page(f, f->opaque, block_offset,
301 offset, size, bytes_sent);
Lidong Chenccb7e1b2018-08-06 21:29:27 +0800302 if (ret != RAM_SAVE_CONTROL_NOT_SUPP) {
303 f->bytes_xfer += size;
304 }
305
306 if (ret != RAM_SAVE_CONTROL_DELAYED &&
307 ret != RAM_SAVE_CONTROL_NOT_SUPP) {
Eduardo Habkost093c4552013-11-28 12:01:16 -0200308 if (bytes_sent && *bytes_sent > 0) {
309 qemu_update_position(f, *bytes_sent);
310 } else if (ret < 0) {
311 qemu_file_set_error(f, ret);
312 }
313 }
314
315 return ret;
316 }
317
318 return RAM_SAVE_CONTROL_NOT_SUPP;
319}
320
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100321/*
322 * Attempt to fill the buffer from the underlying file
323 * Returns the number of bytes read, or negative value for an error.
324 *
325 * Note that it can return a partially full buffer even in a not error/not EOF
326 * case if the underlying file descriptor gives a short read, and that can
327 * happen even on a blocking fd.
328 */
329static ssize_t qemu_fill_buffer(QEMUFile *f)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200330{
331 int len;
332 int pending;
Yury Kotov3d661c82019-04-22 13:34:20 +0300333 Error *local_error = NULL;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200334
335 assert(!qemu_file_is_writable(f));
336
337 pending = f->buf_size - f->buf_index;
338 if (pending > 0) {
339 memmove(f->buf, f->buf + f->buf_index, pending);
340 }
341 f->buf_index = 0;
342 f->buf_size = pending;
343
Juan Quintelaa555b802019-12-18 05:11:31 +0100344 if (f->shutdown) {
345 return 0;
346 }
347
Eduardo Habkost093c4552013-11-28 12:01:16 -0200348 len = f->ops->get_buffer(f->opaque, f->buf + pending, f->pos,
Yury Kotov3d661c82019-04-22 13:34:20 +0300349 IO_BUF_SIZE - pending, &local_error);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200350 if (len > 0) {
351 f->buf_size += len;
352 f->pos += len;
353 } else if (len == 0) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300354 qemu_file_set_error_obj(f, -EIO, local_error);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200355 } else if (len != -EAGAIN) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300356 qemu_file_set_error_obj(f, len, local_error);
357 } else {
358 error_free(local_error);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200359 }
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100360
361 return len;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200362}
363
Eduardo Habkost093c4552013-11-28 12:01:16 -0200364void qemu_update_position(QEMUFile *f, size_t size)
365{
366 f->pos += size;
367}
368
369/** Closes the file
370 *
371 * Returns negative error value if any error happened on previous operations or
372 * while closing the file. Returns 0 or positive number on success.
373 *
374 * The meaning of return value on success depends on the specific backend
375 * being used.
376 */
377int qemu_fclose(QEMUFile *f)
378{
379 int ret;
380 qemu_fflush(f);
381 ret = qemu_file_get_error(f);
382
383 if (f->ops->close) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300384 int ret2 = f->ops->close(f->opaque, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200385 if (ret >= 0) {
386 ret = ret2;
387 }
388 }
389 /* If any error was spotted before closing, we should report it
390 * instead of the close() return value.
391 */
392 if (f->last_error) {
393 ret = f->last_error;
394 }
Yury Kotov3d661c82019-04-22 13:34:20 +0300395 error_free(f->last_error_obj);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200396 g_free(f);
Alexey Kardashevskiy9013dca2014-03-11 10:42:29 +1100397 trace_qemu_file_fclose();
Eduardo Habkost093c4552013-11-28 12:01:16 -0200398 return ret;
399}
400
Wei Yang1bf57fb2019-09-11 13:28:39 +0000401/*
402 * Add buf to iovec. Do flush if iovec is full.
403 *
404 * Return values:
405 * 1 iovec is full and flushed
406 * 0 iovec is not flushed
407 *
408 */
409static int add_to_iovec(QEMUFile *f, const uint8_t *buf, size_t size,
410 bool may_free)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200411{
412 /* check for adjacent buffer and coalesce them */
413 if (f->iovcnt > 0 && buf == f->iov[f->iovcnt - 1].iov_base +
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300414 f->iov[f->iovcnt - 1].iov_len &&
415 may_free == test_bit(f->iovcnt - 1, f->may_free))
416 {
Eduardo Habkost093c4552013-11-28 12:01:16 -0200417 f->iov[f->iovcnt - 1].iov_len += size;
418 } else {
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300419 if (may_free) {
420 set_bit(f->iovcnt, f->may_free);
421 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200422 f->iov[f->iovcnt].iov_base = (uint8_t *)buf;
423 f->iov[f->iovcnt++].iov_len = size;
424 }
425
426 if (f->iovcnt >= MAX_IOV_SIZE) {
427 qemu_fflush(f);
Wei Yang1bf57fb2019-09-11 13:28:39 +0000428 return 1;
429 }
430
431 return 0;
432}
433
434static void add_buf_to_iovec(QEMUFile *f, size_t len)
435{
436 if (!add_to_iovec(f, f->buf + f->buf_index, len, false)) {
437 f->buf_index += len;
438 if (f->buf_index == IO_BUF_SIZE) {
439 qemu_fflush(f);
440 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200441 }
442}
443
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300444void qemu_put_buffer_async(QEMUFile *f, const uint8_t *buf, size_t size,
445 bool may_free)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200446{
Eduardo Habkost093c4552013-11-28 12:01:16 -0200447 if (f->last_error) {
448 return;
449 }
450
451 f->bytes_xfer += size;
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300452 add_to_iovec(f, buf, size, may_free);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200453}
454
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100455void qemu_put_buffer(QEMUFile *f, const uint8_t *buf, size_t size)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200456{
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100457 size_t l;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200458
459 if (f->last_error) {
460 return;
461 }
462
463 while (size > 0) {
464 l = IO_BUF_SIZE - f->buf_index;
465 if (l > size) {
466 l = size;
467 }
468 memcpy(f->buf + f->buf_index, buf, l);
469 f->bytes_xfer += l;
Wei Yang1bf57fb2019-09-11 13:28:39 +0000470 add_buf_to_iovec(f, l);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200471 if (qemu_file_get_error(f)) {
472 break;
473 }
474 buf += l;
475 size -= l;
476 }
477}
478
479void qemu_put_byte(QEMUFile *f, int v)
480{
481 if (f->last_error) {
482 return;
483 }
484
485 f->buf[f->buf_index] = v;
486 f->bytes_xfer++;
Wei Yang1bf57fb2019-09-11 13:28:39 +0000487 add_buf_to_iovec(f, 1);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200488}
489
490void qemu_file_skip(QEMUFile *f, int size)
491{
492 if (f->buf_index + size <= f->buf_size) {
493 f->buf_index += size;
494 }
495}
496
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100497/*
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100498 * Read 'size' bytes from file (at 'offset') without moving the
499 * pointer and set 'buf' to point to that data.
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100500 *
501 * It will return size bytes unless there was an error, in which case it will
502 * return as many as it managed to read (assuming blocking fd's which
503 * all current QEMUFile are)
504 */
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100505size_t qemu_peek_buffer(QEMUFile *f, uint8_t **buf, size_t size, size_t offset)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200506{
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100507 ssize_t pending;
508 size_t index;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200509
510 assert(!qemu_file_is_writable(f));
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100511 assert(offset < IO_BUF_SIZE);
512 assert(size <= IO_BUF_SIZE - offset);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200513
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100514 /* The 1st byte to read from */
Eduardo Habkost093c4552013-11-28 12:01:16 -0200515 index = f->buf_index + offset;
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100516 /* The number of available bytes starting at index */
Eduardo Habkost093c4552013-11-28 12:01:16 -0200517 pending = f->buf_size - index;
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100518
519 /*
520 * qemu_fill_buffer might return just a few bytes, even when there isn't
521 * an error, so loop collecting them until we get enough.
522 */
523 while (pending < size) {
524 int received = qemu_fill_buffer(f);
525
526 if (received <= 0) {
527 break;
528 }
529
Eduardo Habkost093c4552013-11-28 12:01:16 -0200530 index = f->buf_index + offset;
531 pending = f->buf_size - index;
532 }
533
534 if (pending <= 0) {
535 return 0;
536 }
537 if (size > pending) {
538 size = pending;
539 }
540
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100541 *buf = f->buf + index;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200542 return size;
543}
544
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100545/*
546 * Read 'size' bytes of data from the file into buf.
547 * 'size' can be larger than the internal buffer.
548 *
549 * It will return size bytes unless there was an error, in which case it will
550 * return as many as it managed to read (assuming blocking fd's which
551 * all current QEMUFile are)
552 */
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100553size_t qemu_get_buffer(QEMUFile *f, uint8_t *buf, size_t size)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200554{
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100555 size_t pending = size;
556 size_t done = 0;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200557
558 while (pending > 0) {
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100559 size_t res;
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100560 uint8_t *src;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200561
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100562 res = qemu_peek_buffer(f, &src, MIN(pending, IO_BUF_SIZE), 0);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200563 if (res == 0) {
564 return done;
565 }
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100566 memcpy(buf, src, res);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200567 qemu_file_skip(f, res);
568 buf += res;
569 pending -= res;
570 done += res;
571 }
572 return done;
573}
574
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100575/*
Dr. David Alan Gilbert9504fb52015-11-05 18:10:35 +0000576 * Read 'size' bytes of data from the file.
577 * 'size' can be larger than the internal buffer.
578 *
579 * The data:
580 * may be held on an internal buffer (in which case *buf is updated
581 * to point to it) that is valid until the next qemu_file operation.
582 * OR
583 * will be copied to the *buf that was passed in.
584 *
585 * The code tries to avoid the copy if possible.
586 *
587 * It will return size bytes unless there was an error, in which case it will
588 * return as many as it managed to read (assuming blocking fd's which
589 * all current QEMUFile are)
590 *
591 * Note: Since **buf may get changed, the caller should take care to
592 * keep a pointer to the original buffer if it needs to deallocate it.
593 */
594size_t qemu_get_buffer_in_place(QEMUFile *f, uint8_t **buf, size_t size)
595{
596 if (size < IO_BUF_SIZE) {
597 size_t res;
598 uint8_t *src;
599
600 res = qemu_peek_buffer(f, &src, size, 0);
601
602 if (res == size) {
603 qemu_file_skip(f, res);
604 *buf = src;
605 return res;
606 }
607 }
608
609 return qemu_get_buffer(f, *buf, size);
610}
611
612/*
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100613 * Peeks a single byte from the buffer; this isn't guaranteed to work if
614 * offset leaves a gap after the previous read/peeked data.
615 */
Eduardo Habkost093c4552013-11-28 12:01:16 -0200616int qemu_peek_byte(QEMUFile *f, int offset)
617{
618 int index = f->buf_index + offset;
619
620 assert(!qemu_file_is_writable(f));
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100621 assert(offset < IO_BUF_SIZE);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200622
623 if (index >= f->buf_size) {
624 qemu_fill_buffer(f);
625 index = f->buf_index + offset;
626 if (index >= f->buf_size) {
627 return 0;
628 }
629 }
630 return f->buf[index];
631}
632
633int qemu_get_byte(QEMUFile *f)
634{
635 int result;
636
637 result = qemu_peek_byte(f, 0);
638 qemu_file_skip(f, 1);
639 return result;
640}
641
Alexander Graf97221402015-01-22 15:01:38 +0100642int64_t qemu_ftell_fast(QEMUFile *f)
643{
644 int64_t ret = f->pos;
645 int i;
646
Daniel P. Berrange11808bb2016-04-27 11:05:17 +0100647 for (i = 0; i < f->iovcnt; i++) {
648 ret += f->iov[i].iov_len;
Alexander Graf97221402015-01-22 15:01:38 +0100649 }
650
651 return ret;
652}
653
Eduardo Habkost093c4552013-11-28 12:01:16 -0200654int64_t qemu_ftell(QEMUFile *f)
655{
656 qemu_fflush(f);
657 return f->pos;
658}
659
660int qemu_file_rate_limit(QEMUFile *f)
661{
Juan Quintelaa555b802019-12-18 05:11:31 +0100662 if (f->shutdown) {
663 return 1;
664 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200665 if (qemu_file_get_error(f)) {
666 return 1;
667 }
668 if (f->xfer_limit > 0 && f->bytes_xfer > f->xfer_limit) {
669 return 1;
670 }
671 return 0;
672}
673
674int64_t qemu_file_get_rate_limit(QEMUFile *f)
675{
676 return f->xfer_limit;
677}
678
679void qemu_file_set_rate_limit(QEMUFile *f, int64_t limit)
680{
681 f->xfer_limit = limit;
682}
683
684void qemu_file_reset_rate_limit(QEMUFile *f)
685{
686 f->bytes_xfer = 0;
687}
688
Ivan Ren5d7d2552019-07-30 13:33:34 +0800689void qemu_file_update_transfer(QEMUFile *f, int64_t len)
690{
691 f->bytes_xfer += len;
692}
693
Eduardo Habkost093c4552013-11-28 12:01:16 -0200694void qemu_put_be16(QEMUFile *f, unsigned int v)
695{
696 qemu_put_byte(f, v >> 8);
697 qemu_put_byte(f, v);
698}
699
700void qemu_put_be32(QEMUFile *f, unsigned int v)
701{
702 qemu_put_byte(f, v >> 24);
703 qemu_put_byte(f, v >> 16);
704 qemu_put_byte(f, v >> 8);
705 qemu_put_byte(f, v);
706}
707
708void qemu_put_be64(QEMUFile *f, uint64_t v)
709{
710 qemu_put_be32(f, v >> 32);
711 qemu_put_be32(f, v);
712}
713
714unsigned int qemu_get_be16(QEMUFile *f)
715{
716 unsigned int v;
717 v = qemu_get_byte(f) << 8;
718 v |= qemu_get_byte(f);
719 return v;
720}
721
722unsigned int qemu_get_be32(QEMUFile *f)
723{
724 unsigned int v;
Peter Maydell90d6a672014-12-23 22:26:55 +0000725 v = (unsigned int)qemu_get_byte(f) << 24;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200726 v |= qemu_get_byte(f) << 16;
727 v |= qemu_get_byte(f) << 8;
728 v |= qemu_get_byte(f);
729 return v;
730}
731
732uint64_t qemu_get_be64(QEMUFile *f)
733{
734 uint64_t v;
735 v = (uint64_t)qemu_get_be32(f) << 32;
736 v |= qemu_get_be32(f);
737 return v;
738}
Liang Li44f0ead2015-03-23 16:32:19 +0800739
Xiao Guangrongdcaf4462018-03-30 15:51:20 +0800740/* return the size after compression, or negative value on error */
741static int qemu_compress_data(z_stream *stream, uint8_t *dest, size_t dest_len,
742 const uint8_t *source, size_t source_len)
743{
744 int err;
745
746 err = deflateReset(stream);
747 if (err != Z_OK) {
748 return -1;
749 }
750
751 stream->avail_in = source_len;
752 stream->next_in = (uint8_t *)source;
753 stream->avail_out = dest_len;
754 stream->next_out = dest;
755
756 err = deflate(stream, Z_FINISH);
757 if (err != Z_STREAM_END) {
758 return -1;
759 }
760
761 return stream->next_out - dest;
762}
763
764/* Compress size bytes of data start at p and store the compressed
765 * data to the buffer of f.
Liang Lib3be2892016-05-05 15:32:54 +0800766 *
Wei Yang42d24612019-10-12 10:39:31 +0800767 * Since the file is dummy file with empty_ops, return -1 if f has no space to
768 * save the compressed data.
Liang Li44f0ead2015-03-23 16:32:19 +0800769 */
Xiao Guangrongdcaf4462018-03-30 15:51:20 +0800770ssize_t qemu_put_compression_data(QEMUFile *f, z_stream *stream,
771 const uint8_t *p, size_t size)
Liang Li44f0ead2015-03-23 16:32:19 +0800772{
773 ssize_t blen = IO_BUF_SIZE - f->buf_index - sizeof(int32_t);
774
775 if (blen < compressBound(size)) {
Wei Yang42d24612019-10-12 10:39:31 +0800776 return -1;
Liang Li44f0ead2015-03-23 16:32:19 +0800777 }
Xiao Guangrongdcaf4462018-03-30 15:51:20 +0800778
779 blen = qemu_compress_data(stream, f->buf + f->buf_index + sizeof(int32_t),
780 blen, p, size);
781 if (blen < 0) {
Xiao Guangrong34ab9e92018-03-30 15:51:22 +0800782 return -1;
Liang Li44f0ead2015-03-23 16:32:19 +0800783 }
Xiao Guangrong34ab9e92018-03-30 15:51:22 +0800784
Liang Li44f0ead2015-03-23 16:32:19 +0800785 qemu_put_be32(f, blen);
Wei Yang1bf57fb2019-09-11 13:28:39 +0000786 add_buf_to_iovec(f, blen);
Liang Li44f0ead2015-03-23 16:32:19 +0800787 return blen + sizeof(int32_t);
788}
789
790/* Put the data in the buffer of f_src to the buffer of f_des, and
791 * then reset the buf_index of f_src to 0.
792 */
793
794int qemu_put_qemu_file(QEMUFile *f_des, QEMUFile *f_src)
795{
796 int len = 0;
797
798 if (f_src->buf_index > 0) {
799 len = f_src->buf_index;
800 qemu_put_buffer(f_des, f_src->buf, f_src->buf_index);
801 f_src->buf_index = 0;
Liang Li787d1342016-08-09 08:22:26 +0800802 f_src->iovcnt = 0;
Liang Li44f0ead2015-03-23 16:32:19 +0800803 }
804 return len;
805}
Dr. David Alan Gilbertb3af1bc2015-05-21 13:24:11 +0100806
807/*
808 * Get a string whose length is determined by a single preceding byte
809 * A preallocated 256 byte buffer must be passed in.
810 * Returns: len on success and a 0 terminated string in the buffer
811 * else 0
812 * (Note a 0 length string will return 0 either way)
813 */
814size_t qemu_get_counted_string(QEMUFile *f, char buf[256])
815{
816 size_t len = qemu_get_byte(f);
817 size_t res = qemu_get_buffer(f, (uint8_t *)buf, len);
818
819 buf[res] = 0;
820
821 return res == len ? res : 0;
822}
Dr. David Alan Gilberta800cd52015-11-05 18:10:36 +0000823
824/*
Vladimir Sementsov-Ogievskiyf0d64cb2018-03-13 15:34:00 -0400825 * Put a string with one preceding byte containing its length. The length of
826 * the string should be less than 256.
827 */
828void qemu_put_counted_string(QEMUFile *f, const char *str)
829{
830 size_t len = strlen(str);
831
832 assert(len < 256);
833 qemu_put_byte(f, len);
834 qemu_put_buffer(f, (const uint8_t *)str, len);
835}
836
837/*
Dr. David Alan Gilberta800cd52015-11-05 18:10:36 +0000838 * Set the blocking state of the QEMUFile.
839 * Note: On some transports the OS only keeps a single blocking state for
840 * both directions, and thus changing the blocking on the main
841 * QEMUFile can also affect the return path.
842 */
843void qemu_file_set_blocking(QEMUFile *f, bool block)
844{
Daniel P. Berrange06ad5132016-04-27 11:04:56 +0100845 if (f->ops->set_blocking) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300846 f->ops->set_blocking(f->opaque, block, NULL);
Dr. David Alan Gilberta800cd52015-11-05 18:10:36 +0000847 }
848}