blob: 26fb25ddc1341af62b80571f8699b5e9740dd8d3 [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
34#define MAX_IOV_SIZE MIN(IOV_MAX, 64)
35
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;
Daniel P. Berrangea24939f2016-04-27 11:05:13 +010056};
57
Dr. David Alan Gilberte1a8c9b2015-01-08 11:11:30 +000058/*
59 * Stop a file from being read/written - not all backing files can do this
60 * typically only sockets can.
61 */
62int qemu_file_shutdown(QEMUFile *f)
63{
64 if (!f->ops->shut_down) {
65 return -ENOSYS;
66 }
Yury Kotov3d661c82019-04-22 13:34:20 +030067 return f->ops->shut_down(f->opaque, true, true, NULL);
Dr. David Alan Gilberte1a8c9b2015-01-08 11:11:30 +000068}
69
Dr. David Alan Gilbertadc468e2015-11-05 18:10:43 +000070/*
71 * Result: QEMUFile* for a 'return path' for comms in the opposite direction
72 * NULL if not available
73 */
74QEMUFile *qemu_file_get_return_path(QEMUFile *f)
75{
76 if (!f->ops->get_return_path) {
77 return NULL;
78 }
79 return f->ops->get_return_path(f->opaque);
80}
81
Eduardo Habkost093c4552013-11-28 12:01:16 -020082bool qemu_file_mode_is_not_valid(const char *mode)
83{
84 if (mode == NULL ||
85 (mode[0] != 'r' && mode[0] != 'w') ||
86 mode[1] != 'b' || mode[2] != 0) {
87 fprintf(stderr, "qemu_fopen: Argument validity check failed\n");
88 return true;
89 }
90
91 return false;
92}
93
Eduardo Habkost093c4552013-11-28 12:01:16 -020094QEMUFile *qemu_fopen_ops(void *opaque, const QEMUFileOps *ops)
95{
96 QEMUFile *f;
97
Markus Armbruster97f3ad32015-09-14 13:51:31 +020098 f = g_new0(QEMUFile, 1);
Eduardo Habkost093c4552013-11-28 12:01:16 -020099
100 f->opaque = opaque;
101 f->ops = ops;
102 return f;
103}
104
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100105
106void qemu_file_set_hooks(QEMUFile *f, const QEMUFileHooks *hooks)
107{
108 f->hooks = hooks;
109}
110
Eduardo Habkost093c4552013-11-28 12:01:16 -0200111/*
Yury Kotov3d661c82019-04-22 13:34:20 +0300112 * Get last error for stream f with optional Error*
113 *
114 * Return negative error value if there has been an error on previous
115 * operations, return 0 if no error happened.
116 * Optional, it returns Error* in errp, but it may be NULL even if return value
117 * is not 0.
118 *
119 */
120int qemu_file_get_error_obj(QEMUFile *f, Error **errp)
121{
122 if (errp) {
123 *errp = f->last_error_obj ? error_copy(f->last_error_obj) : NULL;
124 }
125 return f->last_error;
126}
127
128/*
129 * Set the last error for stream f with optional Error*
130 */
131void qemu_file_set_error_obj(QEMUFile *f, int ret, Error *err)
132{
133 if (f->last_error == 0 && ret) {
134 f->last_error = ret;
135 error_propagate(&f->last_error_obj, err);
136 } else if (err) {
137 error_report_err(err);
138 }
139}
140
141/*
Eduardo Habkost093c4552013-11-28 12:01:16 -0200142 * Get last error for stream f
143 *
144 * Return negative error value if there has been an error on previous
145 * operations, return 0 if no error happened.
146 *
147 */
148int qemu_file_get_error(QEMUFile *f)
149{
Yury Kotov3d661c82019-04-22 13:34:20 +0300150 return qemu_file_get_error_obj(f, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200151}
152
Yury Kotov3d661c82019-04-22 13:34:20 +0300153/*
154 * Set the last error for stream f
155 */
Eduardo Habkost093c4552013-11-28 12:01:16 -0200156void qemu_file_set_error(QEMUFile *f, int ret)
157{
Yury Kotov3d661c82019-04-22 13:34:20 +0300158 qemu_file_set_error_obj(f, ret, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200159}
160
Eduardo Habkoste68dd362014-10-01 17:34:34 -0300161bool qemu_file_is_writable(QEMUFile *f)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200162{
Daniel P. Berrange11808bb2016-04-27 11:05:17 +0100163 return f->ops->writev_buffer;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200164}
165
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300166static void qemu_iovec_release_ram(QEMUFile *f)
167{
168 struct iovec iov;
169 unsigned long idx;
170
171 /* Find and release all the contiguous memory ranges marked as may_free. */
172 idx = find_next_bit(f->may_free, f->iovcnt, 0);
173 if (idx >= f->iovcnt) {
174 return;
175 }
176 iov = f->iov[idx];
177
178 /* The madvise() in the loop is called for iov within a continuous range and
179 * then reinitialize the iov. And in the end, madvise() is called for the
180 * last iov.
181 */
182 while ((idx = find_next_bit(f->may_free, f->iovcnt, idx + 1)) < f->iovcnt) {
183 /* check for adjacent buffer and coalesce them */
184 if (iov.iov_base + iov.iov_len == f->iov[idx].iov_base) {
185 iov.iov_len += f->iov[idx].iov_len;
186 continue;
187 }
188 if (qemu_madvise(iov.iov_base, iov.iov_len, QEMU_MADV_DONTNEED) < 0) {
189 error_report("migrate: madvise DONTNEED failed %p %zd: %s",
190 iov.iov_base, iov.iov_len, strerror(errno));
191 }
192 iov = f->iov[idx];
193 }
194 if (qemu_madvise(iov.iov_base, iov.iov_len, QEMU_MADV_DONTNEED) < 0) {
195 error_report("migrate: madvise DONTNEED failed %p %zd: %s",
196 iov.iov_base, iov.iov_len, strerror(errno));
197 }
198 memset(f->may_free, 0, sizeof(f->may_free));
199}
200
Eduardo Habkost093c4552013-11-28 12:01:16 -0200201/**
202 * Flushes QEMUFile buffer
203 *
Dr. David Alan Gilbert3b348702019-08-23 11:39:46 +0100204 * This will flush all pending data. If data was only partially flushed, it
205 * will set an error state.
Eduardo Habkost093c4552013-11-28 12:01:16 -0200206 */
207void qemu_fflush(QEMUFile *f)
208{
209 ssize_t ret = 0;
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100210 ssize_t expect = 0;
Yury Kotov3d661c82019-04-22 13:34:20 +0300211 Error *local_error = NULL;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200212
213 if (!qemu_file_is_writable(f)) {
214 return;
215 }
216
Daniel P. Berrange11808bb2016-04-27 11:05:17 +0100217 if (f->iovcnt > 0) {
218 expect = iov_size(f->iov, f->iovcnt);
Yury Kotov3d661c82019-04-22 13:34:20 +0300219 ret = f->ops->writev_buffer(f->opaque, f->iov, f->iovcnt, f->pos,
220 &local_error);
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300221
222 qemu_iovec_release_ram(f);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200223 }
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100224
Eduardo Habkost093c4552013-11-28 12:01:16 -0200225 if (ret >= 0) {
226 f->pos += ret;
227 }
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100228 /* We expect the QEMUFile write impl to send the full
229 * data set we requested, so sanity check that.
230 */
231 if (ret != expect) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300232 qemu_file_set_error_obj(f, ret < 0 ? ret : -EIO, local_error);
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100233 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200234 f->buf_index = 0;
235 f->iovcnt = 0;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200236}
237
238void ram_control_before_iterate(QEMUFile *f, uint64_t flags)
239{
240 int ret = 0;
241
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100242 if (f->hooks && f->hooks->before_ram_iterate) {
243 ret = f->hooks->before_ram_iterate(f, f->opaque, flags, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200244 if (ret < 0) {
245 qemu_file_set_error(f, ret);
246 }
247 }
248}
249
250void ram_control_after_iterate(QEMUFile *f, uint64_t flags)
251{
252 int ret = 0;
253
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100254 if (f->hooks && f->hooks->after_ram_iterate) {
255 ret = f->hooks->after_ram_iterate(f, f->opaque, flags, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200256 if (ret < 0) {
257 qemu_file_set_error(f, ret);
258 }
259 }
260}
261
Dr. David Alan Gilbert632e3a52015-06-11 18:17:23 +0100262void ram_control_load_hook(QEMUFile *f, uint64_t flags, void *data)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200263{
264 int ret = -EINVAL;
265
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100266 if (f->hooks && f->hooks->hook_ram_load) {
267 ret = f->hooks->hook_ram_load(f, f->opaque, flags, data);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200268 if (ret < 0) {
269 qemu_file_set_error(f, ret);
270 }
271 } else {
Dr. David Alan Gilbert632e3a52015-06-11 18:17:23 +0100272 /*
273 * Hook is a hook specifically requested by the source sending a flag
274 * that expects there to be a hook on the destination.
275 */
276 if (flags == RAM_CONTROL_HOOK) {
277 qemu_file_set_error(f, ret);
278 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200279 }
280}
281
282size_t ram_control_save_page(QEMUFile *f, ram_addr_t block_offset,
Juan Quintela6e1dea42015-02-12 19:02:42 +0100283 ram_addr_t offset, size_t size,
284 uint64_t *bytes_sent)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200285{
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100286 if (f->hooks && f->hooks->save_page) {
287 int ret = f->hooks->save_page(f, f->opaque, block_offset,
288 offset, size, bytes_sent);
Lidong Chenccb7e1b2018-08-06 21:29:27 +0800289 if (ret != RAM_SAVE_CONTROL_NOT_SUPP) {
290 f->bytes_xfer += size;
291 }
292
293 if (ret != RAM_SAVE_CONTROL_DELAYED &&
294 ret != RAM_SAVE_CONTROL_NOT_SUPP) {
Eduardo Habkost093c4552013-11-28 12:01:16 -0200295 if (bytes_sent && *bytes_sent > 0) {
296 qemu_update_position(f, *bytes_sent);
297 } else if (ret < 0) {
298 qemu_file_set_error(f, ret);
299 }
300 }
301
302 return ret;
303 }
304
305 return RAM_SAVE_CONTROL_NOT_SUPP;
306}
307
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100308/*
309 * Attempt to fill the buffer from the underlying file
310 * Returns the number of bytes read, or negative value for an error.
311 *
312 * Note that it can return a partially full buffer even in a not error/not EOF
313 * case if the underlying file descriptor gives a short read, and that can
314 * happen even on a blocking fd.
315 */
316static ssize_t qemu_fill_buffer(QEMUFile *f)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200317{
318 int len;
319 int pending;
Yury Kotov3d661c82019-04-22 13:34:20 +0300320 Error *local_error = NULL;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200321
322 assert(!qemu_file_is_writable(f));
323
324 pending = f->buf_size - f->buf_index;
325 if (pending > 0) {
326 memmove(f->buf, f->buf + f->buf_index, pending);
327 }
328 f->buf_index = 0;
329 f->buf_size = pending;
330
331 len = f->ops->get_buffer(f->opaque, f->buf + pending, f->pos,
Yury Kotov3d661c82019-04-22 13:34:20 +0300332 IO_BUF_SIZE - pending, &local_error);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200333 if (len > 0) {
334 f->buf_size += len;
335 f->pos += len;
336 } else if (len == 0) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300337 qemu_file_set_error_obj(f, -EIO, local_error);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200338 } else if (len != -EAGAIN) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300339 qemu_file_set_error_obj(f, len, local_error);
340 } else {
341 error_free(local_error);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200342 }
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100343
344 return len;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200345}
346
Eduardo Habkost093c4552013-11-28 12:01:16 -0200347void qemu_update_position(QEMUFile *f, size_t size)
348{
349 f->pos += size;
350}
351
352/** Closes the file
353 *
354 * Returns negative error value if any error happened on previous operations or
355 * while closing the file. Returns 0 or positive number on success.
356 *
357 * The meaning of return value on success depends on the specific backend
358 * being used.
359 */
360int qemu_fclose(QEMUFile *f)
361{
362 int ret;
363 qemu_fflush(f);
364 ret = qemu_file_get_error(f);
365
366 if (f->ops->close) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300367 int ret2 = f->ops->close(f->opaque, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200368 if (ret >= 0) {
369 ret = ret2;
370 }
371 }
372 /* If any error was spotted before closing, we should report it
373 * instead of the close() return value.
374 */
375 if (f->last_error) {
376 ret = f->last_error;
377 }
Yury Kotov3d661c82019-04-22 13:34:20 +0300378 error_free(f->last_error_obj);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200379 g_free(f);
Alexey Kardashevskiy9013dca2014-03-11 10:42:29 +1100380 trace_qemu_file_fclose();
Eduardo Habkost093c4552013-11-28 12:01:16 -0200381 return ret;
382}
383
Wei Yang1bf57fb2019-09-11 13:28:39 +0000384/*
385 * Add buf to iovec. Do flush if iovec is full.
386 *
387 * Return values:
388 * 1 iovec is full and flushed
389 * 0 iovec is not flushed
390 *
391 */
392static int add_to_iovec(QEMUFile *f, const uint8_t *buf, size_t size,
393 bool may_free)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200394{
395 /* check for adjacent buffer and coalesce them */
396 if (f->iovcnt > 0 && buf == f->iov[f->iovcnt - 1].iov_base +
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300397 f->iov[f->iovcnt - 1].iov_len &&
398 may_free == test_bit(f->iovcnt - 1, f->may_free))
399 {
Eduardo Habkost093c4552013-11-28 12:01:16 -0200400 f->iov[f->iovcnt - 1].iov_len += size;
401 } else {
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300402 if (may_free) {
403 set_bit(f->iovcnt, f->may_free);
404 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200405 f->iov[f->iovcnt].iov_base = (uint8_t *)buf;
406 f->iov[f->iovcnt++].iov_len = size;
407 }
408
409 if (f->iovcnt >= MAX_IOV_SIZE) {
410 qemu_fflush(f);
Wei Yang1bf57fb2019-09-11 13:28:39 +0000411 return 1;
412 }
413
414 return 0;
415}
416
417static void add_buf_to_iovec(QEMUFile *f, size_t len)
418{
419 if (!add_to_iovec(f, f->buf + f->buf_index, len, false)) {
420 f->buf_index += len;
421 if (f->buf_index == IO_BUF_SIZE) {
422 qemu_fflush(f);
423 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200424 }
425}
426
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300427void qemu_put_buffer_async(QEMUFile *f, const uint8_t *buf, size_t size,
428 bool may_free)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200429{
Eduardo Habkost093c4552013-11-28 12:01:16 -0200430 if (f->last_error) {
431 return;
432 }
433
434 f->bytes_xfer += size;
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300435 add_to_iovec(f, buf, size, may_free);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200436}
437
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100438void qemu_put_buffer(QEMUFile *f, const uint8_t *buf, size_t size)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200439{
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100440 size_t l;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200441
442 if (f->last_error) {
443 return;
444 }
445
446 while (size > 0) {
447 l = IO_BUF_SIZE - f->buf_index;
448 if (l > size) {
449 l = size;
450 }
451 memcpy(f->buf + f->buf_index, buf, l);
452 f->bytes_xfer += l;
Wei Yang1bf57fb2019-09-11 13:28:39 +0000453 add_buf_to_iovec(f, l);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200454 if (qemu_file_get_error(f)) {
455 break;
456 }
457 buf += l;
458 size -= l;
459 }
460}
461
462void qemu_put_byte(QEMUFile *f, int v)
463{
464 if (f->last_error) {
465 return;
466 }
467
468 f->buf[f->buf_index] = v;
469 f->bytes_xfer++;
Wei Yang1bf57fb2019-09-11 13:28:39 +0000470 add_buf_to_iovec(f, 1);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200471}
472
473void qemu_file_skip(QEMUFile *f, int size)
474{
475 if (f->buf_index + size <= f->buf_size) {
476 f->buf_index += size;
477 }
478}
479
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100480/*
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100481 * Read 'size' bytes from file (at 'offset') without moving the
482 * pointer and set 'buf' to point to that data.
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100483 *
484 * It will return size bytes unless there was an error, in which case it will
485 * return as many as it managed to read (assuming blocking fd's which
486 * all current QEMUFile are)
487 */
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100488size_t qemu_peek_buffer(QEMUFile *f, uint8_t **buf, size_t size, size_t offset)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200489{
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100490 ssize_t pending;
491 size_t index;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200492
493 assert(!qemu_file_is_writable(f));
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100494 assert(offset < IO_BUF_SIZE);
495 assert(size <= IO_BUF_SIZE - offset);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200496
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100497 /* The 1st byte to read from */
Eduardo Habkost093c4552013-11-28 12:01:16 -0200498 index = f->buf_index + offset;
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100499 /* The number of available bytes starting at index */
Eduardo Habkost093c4552013-11-28 12:01:16 -0200500 pending = f->buf_size - index;
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100501
502 /*
503 * qemu_fill_buffer might return just a few bytes, even when there isn't
504 * an error, so loop collecting them until we get enough.
505 */
506 while (pending < size) {
507 int received = qemu_fill_buffer(f);
508
509 if (received <= 0) {
510 break;
511 }
512
Eduardo Habkost093c4552013-11-28 12:01:16 -0200513 index = f->buf_index + offset;
514 pending = f->buf_size - index;
515 }
516
517 if (pending <= 0) {
518 return 0;
519 }
520 if (size > pending) {
521 size = pending;
522 }
523
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100524 *buf = f->buf + index;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200525 return size;
526}
527
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100528/*
529 * Read 'size' bytes of data from the file into buf.
530 * 'size' can be larger than the internal buffer.
531 *
532 * It will return size bytes unless there was an error, in which case it will
533 * return as many as it managed to read (assuming blocking fd's which
534 * all current QEMUFile are)
535 */
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100536size_t qemu_get_buffer(QEMUFile *f, uint8_t *buf, size_t size)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200537{
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100538 size_t pending = size;
539 size_t done = 0;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200540
541 while (pending > 0) {
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100542 size_t res;
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100543 uint8_t *src;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200544
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100545 res = qemu_peek_buffer(f, &src, MIN(pending, IO_BUF_SIZE), 0);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200546 if (res == 0) {
547 return done;
548 }
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100549 memcpy(buf, src, res);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200550 qemu_file_skip(f, res);
551 buf += res;
552 pending -= res;
553 done += res;
554 }
555 return done;
556}
557
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100558/*
Dr. David Alan Gilbert9504fb52015-11-05 18:10:35 +0000559 * Read 'size' bytes of data from the file.
560 * 'size' can be larger than the internal buffer.
561 *
562 * The data:
563 * may be held on an internal buffer (in which case *buf is updated
564 * to point to it) that is valid until the next qemu_file operation.
565 * OR
566 * will be copied to the *buf that was passed in.
567 *
568 * The code tries to avoid the copy if possible.
569 *
570 * It will return size bytes unless there was an error, in which case it will
571 * return as many as it managed to read (assuming blocking fd's which
572 * all current QEMUFile are)
573 *
574 * Note: Since **buf may get changed, the caller should take care to
575 * keep a pointer to the original buffer if it needs to deallocate it.
576 */
577size_t qemu_get_buffer_in_place(QEMUFile *f, uint8_t **buf, size_t size)
578{
579 if (size < IO_BUF_SIZE) {
580 size_t res;
581 uint8_t *src;
582
583 res = qemu_peek_buffer(f, &src, size, 0);
584
585 if (res == size) {
586 qemu_file_skip(f, res);
587 *buf = src;
588 return res;
589 }
590 }
591
592 return qemu_get_buffer(f, *buf, size);
593}
594
595/*
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100596 * Peeks a single byte from the buffer; this isn't guaranteed to work if
597 * offset leaves a gap after the previous read/peeked data.
598 */
Eduardo Habkost093c4552013-11-28 12:01:16 -0200599int qemu_peek_byte(QEMUFile *f, int offset)
600{
601 int index = f->buf_index + offset;
602
603 assert(!qemu_file_is_writable(f));
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100604 assert(offset < IO_BUF_SIZE);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200605
606 if (index >= f->buf_size) {
607 qemu_fill_buffer(f);
608 index = f->buf_index + offset;
609 if (index >= f->buf_size) {
610 return 0;
611 }
612 }
613 return f->buf[index];
614}
615
616int qemu_get_byte(QEMUFile *f)
617{
618 int result;
619
620 result = qemu_peek_byte(f, 0);
621 qemu_file_skip(f, 1);
622 return result;
623}
624
Alexander Graf97221402015-01-22 15:01:38 +0100625int64_t qemu_ftell_fast(QEMUFile *f)
626{
627 int64_t ret = f->pos;
628 int i;
629
Daniel P. Berrange11808bb2016-04-27 11:05:17 +0100630 for (i = 0; i < f->iovcnt; i++) {
631 ret += f->iov[i].iov_len;
Alexander Graf97221402015-01-22 15:01:38 +0100632 }
633
634 return ret;
635}
636
Eduardo Habkost093c4552013-11-28 12:01:16 -0200637int64_t qemu_ftell(QEMUFile *f)
638{
639 qemu_fflush(f);
640 return f->pos;
641}
642
643int qemu_file_rate_limit(QEMUFile *f)
644{
645 if (qemu_file_get_error(f)) {
646 return 1;
647 }
648 if (f->xfer_limit > 0 && f->bytes_xfer > f->xfer_limit) {
649 return 1;
650 }
651 return 0;
652}
653
654int64_t qemu_file_get_rate_limit(QEMUFile *f)
655{
656 return f->xfer_limit;
657}
658
659void qemu_file_set_rate_limit(QEMUFile *f, int64_t limit)
660{
661 f->xfer_limit = limit;
662}
663
664void qemu_file_reset_rate_limit(QEMUFile *f)
665{
666 f->bytes_xfer = 0;
667}
668
Ivan Ren5d7d2552019-07-30 13:33:34 +0800669void qemu_file_update_transfer(QEMUFile *f, int64_t len)
670{
671 f->bytes_xfer += len;
672}
673
Eduardo Habkost093c4552013-11-28 12:01:16 -0200674void qemu_put_be16(QEMUFile *f, unsigned int v)
675{
676 qemu_put_byte(f, v >> 8);
677 qemu_put_byte(f, v);
678}
679
680void qemu_put_be32(QEMUFile *f, unsigned int v)
681{
682 qemu_put_byte(f, v >> 24);
683 qemu_put_byte(f, v >> 16);
684 qemu_put_byte(f, v >> 8);
685 qemu_put_byte(f, v);
686}
687
688void qemu_put_be64(QEMUFile *f, uint64_t v)
689{
690 qemu_put_be32(f, v >> 32);
691 qemu_put_be32(f, v);
692}
693
694unsigned int qemu_get_be16(QEMUFile *f)
695{
696 unsigned int v;
697 v = qemu_get_byte(f) << 8;
698 v |= qemu_get_byte(f);
699 return v;
700}
701
702unsigned int qemu_get_be32(QEMUFile *f)
703{
704 unsigned int v;
Peter Maydell90d6a672014-12-23 22:26:55 +0000705 v = (unsigned int)qemu_get_byte(f) << 24;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200706 v |= qemu_get_byte(f) << 16;
707 v |= qemu_get_byte(f) << 8;
708 v |= qemu_get_byte(f);
709 return v;
710}
711
712uint64_t qemu_get_be64(QEMUFile *f)
713{
714 uint64_t v;
715 v = (uint64_t)qemu_get_be32(f) << 32;
716 v |= qemu_get_be32(f);
717 return v;
718}
Liang Li44f0ead2015-03-23 16:32:19 +0800719
Xiao Guangrongdcaf4462018-03-30 15:51:20 +0800720/* return the size after compression, or negative value on error */
721static int qemu_compress_data(z_stream *stream, uint8_t *dest, size_t dest_len,
722 const uint8_t *source, size_t source_len)
723{
724 int err;
725
726 err = deflateReset(stream);
727 if (err != Z_OK) {
728 return -1;
729 }
730
731 stream->avail_in = source_len;
732 stream->next_in = (uint8_t *)source;
733 stream->avail_out = dest_len;
734 stream->next_out = dest;
735
736 err = deflate(stream, Z_FINISH);
737 if (err != Z_STREAM_END) {
738 return -1;
739 }
740
741 return stream->next_out - dest;
742}
743
744/* Compress size bytes of data start at p and store the compressed
745 * data to the buffer of f.
Liang Lib3be2892016-05-05 15:32:54 +0800746 *
747 * When f is not writable, return -1 if f has no space to save the
748 * compressed data.
749 * When f is wirtable and it has no space to save the compressed data,
750 * do fflush first, if f still has no space to save the compressed
751 * data, return -1.
Liang Li44f0ead2015-03-23 16:32:19 +0800752 */
Xiao Guangrongdcaf4462018-03-30 15:51:20 +0800753ssize_t qemu_put_compression_data(QEMUFile *f, z_stream *stream,
754 const uint8_t *p, size_t size)
Liang Li44f0ead2015-03-23 16:32:19 +0800755{
756 ssize_t blen = IO_BUF_SIZE - f->buf_index - sizeof(int32_t);
757
758 if (blen < compressBound(size)) {
Liang Lib3be2892016-05-05 15:32:54 +0800759 if (!qemu_file_is_writable(f)) {
760 return -1;
761 }
762 qemu_fflush(f);
763 blen = IO_BUF_SIZE - sizeof(int32_t);
764 if (blen < compressBound(size)) {
765 return -1;
766 }
Liang Li44f0ead2015-03-23 16:32:19 +0800767 }
Xiao Guangrongdcaf4462018-03-30 15:51:20 +0800768
769 blen = qemu_compress_data(stream, f->buf + f->buf_index + sizeof(int32_t),
770 blen, p, size);
771 if (blen < 0) {
Xiao Guangrong34ab9e92018-03-30 15:51:22 +0800772 return -1;
Liang Li44f0ead2015-03-23 16:32:19 +0800773 }
Xiao Guangrong34ab9e92018-03-30 15:51:22 +0800774
Liang Li44f0ead2015-03-23 16:32:19 +0800775 qemu_put_be32(f, blen);
Wei Yang1bf57fb2019-09-11 13:28:39 +0000776 add_buf_to_iovec(f, blen);
Liang Li44f0ead2015-03-23 16:32:19 +0800777 return blen + sizeof(int32_t);
778}
779
780/* Put the data in the buffer of f_src to the buffer of f_des, and
781 * then reset the buf_index of f_src to 0.
782 */
783
784int qemu_put_qemu_file(QEMUFile *f_des, QEMUFile *f_src)
785{
786 int len = 0;
787
788 if (f_src->buf_index > 0) {
789 len = f_src->buf_index;
790 qemu_put_buffer(f_des, f_src->buf, f_src->buf_index);
791 f_src->buf_index = 0;
Liang Li787d1342016-08-09 08:22:26 +0800792 f_src->iovcnt = 0;
Liang Li44f0ead2015-03-23 16:32:19 +0800793 }
794 return len;
795}
Dr. David Alan Gilbertb3af1bc2015-05-21 13:24:11 +0100796
797/*
798 * Get a string whose length is determined by a single preceding byte
799 * A preallocated 256 byte buffer must be passed in.
800 * Returns: len on success and a 0 terminated string in the buffer
801 * else 0
802 * (Note a 0 length string will return 0 either way)
803 */
804size_t qemu_get_counted_string(QEMUFile *f, char buf[256])
805{
806 size_t len = qemu_get_byte(f);
807 size_t res = qemu_get_buffer(f, (uint8_t *)buf, len);
808
809 buf[res] = 0;
810
811 return res == len ? res : 0;
812}
Dr. David Alan Gilberta800cd52015-11-05 18:10:36 +0000813
814/*
Vladimir Sementsov-Ogievskiyf0d64cb2018-03-13 15:34:00 -0400815 * Put a string with one preceding byte containing its length. The length of
816 * the string should be less than 256.
817 */
818void qemu_put_counted_string(QEMUFile *f, const char *str)
819{
820 size_t len = strlen(str);
821
822 assert(len < 256);
823 qemu_put_byte(f, len);
824 qemu_put_buffer(f, (const uint8_t *)str, len);
825}
826
827/*
Dr. David Alan Gilberta800cd52015-11-05 18:10:36 +0000828 * Set the blocking state of the QEMUFile.
829 * Note: On some transports the OS only keeps a single blocking state for
830 * both directions, and thus changing the blocking on the main
831 * QEMUFile can also affect the return path.
832 */
833void qemu_file_set_blocking(QEMUFile *f, bool block)
834{
Daniel P. Berrange06ad5132016-04-27 11:04:56 +0100835 if (f->ops->set_blocking) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300836 f->ops->set_blocking(f->opaque, block, NULL);
Dr. David Alan Gilberta800cd52015-11-05 18:10:36 +0000837 }
838}