blob: e33c46764fc40d2d262d1720f511881033a331b9 [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 *
204 * If there is writev_buffer QEMUFileOps it uses it otherwise uses
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100205 * put_buffer ops. This will flush all pending data. If data was
206 * only partially flushed, it will set an error state.
Eduardo Habkost093c4552013-11-28 12:01:16 -0200207 */
208void qemu_fflush(QEMUFile *f)
209{
210 ssize_t ret = 0;
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100211 ssize_t expect = 0;
Yury Kotov3d661c82019-04-22 13:34:20 +0300212 Error *local_error = NULL;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200213
214 if (!qemu_file_is_writable(f)) {
215 return;
216 }
217
Daniel P. Berrange11808bb2016-04-27 11:05:17 +0100218 if (f->iovcnt > 0) {
219 expect = iov_size(f->iov, f->iovcnt);
Yury Kotov3d661c82019-04-22 13:34:20 +0300220 ret = f->ops->writev_buffer(f->opaque, f->iov, f->iovcnt, f->pos,
221 &local_error);
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300222
223 qemu_iovec_release_ram(f);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200224 }
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100225
Eduardo Habkost093c4552013-11-28 12:01:16 -0200226 if (ret >= 0) {
227 f->pos += ret;
228 }
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100229 /* We expect the QEMUFile write impl to send the full
230 * data set we requested, so sanity check that.
231 */
232 if (ret != expect) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300233 qemu_file_set_error_obj(f, ret < 0 ? ret : -EIO, local_error);
Daniel P. Berrangebaf51e72016-04-27 11:04:54 +0100234 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200235 f->buf_index = 0;
236 f->iovcnt = 0;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200237}
238
239void ram_control_before_iterate(QEMUFile *f, uint64_t flags)
240{
241 int ret = 0;
242
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100243 if (f->hooks && f->hooks->before_ram_iterate) {
244 ret = f->hooks->before_ram_iterate(f, f->opaque, flags, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200245 if (ret < 0) {
246 qemu_file_set_error(f, ret);
247 }
248 }
249}
250
251void ram_control_after_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->after_ram_iterate) {
256 ret = f->hooks->after_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
Dr. David Alan Gilbert632e3a52015-06-11 18:17:23 +0100263void ram_control_load_hook(QEMUFile *f, uint64_t flags, void *data)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200264{
265 int ret = -EINVAL;
266
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100267 if (f->hooks && f->hooks->hook_ram_load) {
268 ret = f->hooks->hook_ram_load(f, f->opaque, flags, data);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200269 if (ret < 0) {
270 qemu_file_set_error(f, ret);
271 }
272 } else {
Dr. David Alan Gilbert632e3a52015-06-11 18:17:23 +0100273 /*
274 * Hook is a hook specifically requested by the source sending a flag
275 * that expects there to be a hook on the destination.
276 */
277 if (flags == RAM_CONTROL_HOOK) {
278 qemu_file_set_error(f, ret);
279 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200280 }
281}
282
283size_t ram_control_save_page(QEMUFile *f, ram_addr_t block_offset,
Juan Quintela6e1dea42015-02-12 19:02:42 +0100284 ram_addr_t offset, size_t size,
285 uint64_t *bytes_sent)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200286{
Daniel P. Berrange0436e092016-04-27 11:04:55 +0100287 if (f->hooks && f->hooks->save_page) {
288 int ret = f->hooks->save_page(f, f->opaque, block_offset,
289 offset, size, bytes_sent);
Lidong Chenccb7e1b2018-08-06 21:29:27 +0800290 if (ret != RAM_SAVE_CONTROL_NOT_SUPP) {
291 f->bytes_xfer += size;
292 }
293
294 if (ret != RAM_SAVE_CONTROL_DELAYED &&
295 ret != RAM_SAVE_CONTROL_NOT_SUPP) {
Eduardo Habkost093c4552013-11-28 12:01:16 -0200296 if (bytes_sent && *bytes_sent > 0) {
297 qemu_update_position(f, *bytes_sent);
298 } else if (ret < 0) {
299 qemu_file_set_error(f, ret);
300 }
301 }
302
303 return ret;
304 }
305
306 return RAM_SAVE_CONTROL_NOT_SUPP;
307}
308
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100309/*
310 * Attempt to fill the buffer from the underlying file
311 * Returns the number of bytes read, or negative value for an error.
312 *
313 * Note that it can return a partially full buffer even in a not error/not EOF
314 * case if the underlying file descriptor gives a short read, and that can
315 * happen even on a blocking fd.
316 */
317static ssize_t qemu_fill_buffer(QEMUFile *f)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200318{
319 int len;
320 int pending;
Yury Kotov3d661c82019-04-22 13:34:20 +0300321 Error *local_error = NULL;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200322
323 assert(!qemu_file_is_writable(f));
324
325 pending = f->buf_size - f->buf_index;
326 if (pending > 0) {
327 memmove(f->buf, f->buf + f->buf_index, pending);
328 }
329 f->buf_index = 0;
330 f->buf_size = pending;
331
332 len = f->ops->get_buffer(f->opaque, f->buf + pending, f->pos,
Yury Kotov3d661c82019-04-22 13:34:20 +0300333 IO_BUF_SIZE - pending, &local_error);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200334 if (len > 0) {
335 f->buf_size += len;
336 f->pos += len;
337 } else if (len == 0) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300338 qemu_file_set_error_obj(f, -EIO, local_error);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200339 } else if (len != -EAGAIN) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300340 qemu_file_set_error_obj(f, len, local_error);
341 } else {
342 error_free(local_error);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200343 }
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100344
345 return len;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200346}
347
Eduardo Habkost093c4552013-11-28 12:01:16 -0200348void qemu_update_position(QEMUFile *f, size_t size)
349{
350 f->pos += size;
351}
352
353/** Closes the file
354 *
355 * Returns negative error value if any error happened on previous operations or
356 * while closing the file. Returns 0 or positive number on success.
357 *
358 * The meaning of return value on success depends on the specific backend
359 * being used.
360 */
361int qemu_fclose(QEMUFile *f)
362{
363 int ret;
364 qemu_fflush(f);
365 ret = qemu_file_get_error(f);
366
367 if (f->ops->close) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300368 int ret2 = f->ops->close(f->opaque, NULL);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200369 if (ret >= 0) {
370 ret = ret2;
371 }
372 }
373 /* If any error was spotted before closing, we should report it
374 * instead of the close() return value.
375 */
376 if (f->last_error) {
377 ret = f->last_error;
378 }
Yury Kotov3d661c82019-04-22 13:34:20 +0300379 error_free(f->last_error_obj);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200380 g_free(f);
Alexey Kardashevskiy9013dca2014-03-11 10:42:29 +1100381 trace_qemu_file_fclose();
Eduardo Habkost093c4552013-11-28 12:01:16 -0200382 return ret;
383}
384
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300385static void add_to_iovec(QEMUFile *f, const uint8_t *buf, size_t size,
386 bool may_free)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200387{
388 /* check for adjacent buffer and coalesce them */
389 if (f->iovcnt > 0 && buf == f->iov[f->iovcnt - 1].iov_base +
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300390 f->iov[f->iovcnt - 1].iov_len &&
391 may_free == test_bit(f->iovcnt - 1, f->may_free))
392 {
Eduardo Habkost093c4552013-11-28 12:01:16 -0200393 f->iov[f->iovcnt - 1].iov_len += size;
394 } else {
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300395 if (may_free) {
396 set_bit(f->iovcnt, f->may_free);
397 }
Eduardo Habkost093c4552013-11-28 12:01:16 -0200398 f->iov[f->iovcnt].iov_base = (uint8_t *)buf;
399 f->iov[f->iovcnt++].iov_len = size;
400 }
401
402 if (f->iovcnt >= MAX_IOV_SIZE) {
403 qemu_fflush(f);
404 }
405}
406
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300407void qemu_put_buffer_async(QEMUFile *f, const uint8_t *buf, size_t size,
408 bool may_free)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200409{
Eduardo Habkost093c4552013-11-28 12:01:16 -0200410 if (f->last_error) {
411 return;
412 }
413
414 f->bytes_xfer += size;
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300415 add_to_iovec(f, buf, size, may_free);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200416}
417
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100418void qemu_put_buffer(QEMUFile *f, const uint8_t *buf, size_t size)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200419{
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100420 size_t l;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200421
422 if (f->last_error) {
423 return;
424 }
425
426 while (size > 0) {
427 l = IO_BUF_SIZE - f->buf_index;
428 if (l > size) {
429 l = size;
430 }
431 memcpy(f->buf + f->buf_index, buf, l);
432 f->bytes_xfer += l;
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300433 add_to_iovec(f, f->buf + f->buf_index, l, false);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200434 f->buf_index += l;
435 if (f->buf_index == IO_BUF_SIZE) {
436 qemu_fflush(f);
437 }
438 if (qemu_file_get_error(f)) {
439 break;
440 }
441 buf += l;
442 size -= l;
443 }
444}
445
446void qemu_put_byte(QEMUFile *f, int v)
447{
448 if (f->last_error) {
449 return;
450 }
451
452 f->buf[f->buf_index] = v;
453 f->bytes_xfer++;
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300454 add_to_iovec(f, f->buf + f->buf_index, 1, false);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200455 f->buf_index++;
456 if (f->buf_index == IO_BUF_SIZE) {
457 qemu_fflush(f);
458 }
459}
460
461void qemu_file_skip(QEMUFile *f, int size)
462{
463 if (f->buf_index + size <= f->buf_size) {
464 f->buf_index += size;
465 }
466}
467
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100468/*
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100469 * Read 'size' bytes from file (at 'offset') without moving the
470 * pointer and set 'buf' to point to that data.
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100471 *
472 * It will return size bytes unless there was an error, in which case it will
473 * return as many as it managed to read (assuming blocking fd's which
474 * all current QEMUFile are)
475 */
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100476size_t qemu_peek_buffer(QEMUFile *f, uint8_t **buf, size_t size, size_t offset)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200477{
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100478 ssize_t pending;
479 size_t index;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200480
481 assert(!qemu_file_is_writable(f));
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100482 assert(offset < IO_BUF_SIZE);
483 assert(size <= IO_BUF_SIZE - offset);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200484
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100485 /* The 1st byte to read from */
Eduardo Habkost093c4552013-11-28 12:01:16 -0200486 index = f->buf_index + offset;
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100487 /* The number of available bytes starting at index */
Eduardo Habkost093c4552013-11-28 12:01:16 -0200488 pending = f->buf_size - index;
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100489
490 /*
491 * qemu_fill_buffer might return just a few bytes, even when there isn't
492 * an error, so loop collecting them until we get enough.
493 */
494 while (pending < size) {
495 int received = qemu_fill_buffer(f);
496
497 if (received <= 0) {
498 break;
499 }
500
Eduardo Habkost093c4552013-11-28 12:01:16 -0200501 index = f->buf_index + offset;
502 pending = f->buf_size - index;
503 }
504
505 if (pending <= 0) {
506 return 0;
507 }
508 if (size > pending) {
509 size = pending;
510 }
511
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100512 *buf = f->buf + index;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200513 return size;
514}
515
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100516/*
517 * Read 'size' bytes of data from the file into buf.
518 * 'size' can be larger than the internal buffer.
519 *
520 * It will return size bytes unless there was an error, in which case it will
521 * return as many as it managed to read (assuming blocking fd's which
522 * all current QEMUFile are)
523 */
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100524size_t qemu_get_buffer(QEMUFile *f, uint8_t *buf, size_t size)
Eduardo Habkost093c4552013-11-28 12:01:16 -0200525{
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100526 size_t pending = size;
527 size_t done = 0;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200528
529 while (pending > 0) {
Dr. David Alan Gilbert56f38352015-08-13 11:51:34 +0100530 size_t res;
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100531 uint8_t *src;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200532
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100533 res = qemu_peek_buffer(f, &src, MIN(pending, IO_BUF_SIZE), 0);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200534 if (res == 0) {
535 return done;
536 }
Dr. David Alan Gilbert7c1e52b2015-05-21 13:24:15 +0100537 memcpy(buf, src, res);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200538 qemu_file_skip(f, res);
539 buf += res;
540 pending -= res;
541 done += res;
542 }
543 return done;
544}
545
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100546/*
Dr. David Alan Gilbert9504fb52015-11-05 18:10:35 +0000547 * Read 'size' bytes of data from the file.
548 * 'size' can be larger than the internal buffer.
549 *
550 * The data:
551 * may be held on an internal buffer (in which case *buf is updated
552 * to point to it) that is valid until the next qemu_file operation.
553 * OR
554 * will be copied to the *buf that was passed in.
555 *
556 * The code tries to avoid the copy if possible.
557 *
558 * It will return size bytes unless there was an error, in which case it will
559 * return as many as it managed to read (assuming blocking fd's which
560 * all current QEMUFile are)
561 *
562 * Note: Since **buf may get changed, the caller should take care to
563 * keep a pointer to the original buffer if it needs to deallocate it.
564 */
565size_t qemu_get_buffer_in_place(QEMUFile *f, uint8_t **buf, size_t size)
566{
567 if (size < IO_BUF_SIZE) {
568 size_t res;
569 uint8_t *src;
570
571 res = qemu_peek_buffer(f, &src, size, 0);
572
573 if (res == size) {
574 qemu_file_skip(f, res);
575 *buf = src;
576 return res;
577 }
578 }
579
580 return qemu_get_buffer(f, *buf, size);
581}
582
583/*
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100584 * Peeks a single byte from the buffer; this isn't guaranteed to work if
585 * offset leaves a gap after the previous read/peeked data.
586 */
Eduardo Habkost093c4552013-11-28 12:01:16 -0200587int qemu_peek_byte(QEMUFile *f, int offset)
588{
589 int index = f->buf_index + offset;
590
591 assert(!qemu_file_is_writable(f));
Dr. David Alan Gilbert548f52e2014-04-08 15:29:37 +0100592 assert(offset < IO_BUF_SIZE);
Eduardo Habkost093c4552013-11-28 12:01:16 -0200593
594 if (index >= f->buf_size) {
595 qemu_fill_buffer(f);
596 index = f->buf_index + offset;
597 if (index >= f->buf_size) {
598 return 0;
599 }
600 }
601 return f->buf[index];
602}
603
604int qemu_get_byte(QEMUFile *f)
605{
606 int result;
607
608 result = qemu_peek_byte(f, 0);
609 qemu_file_skip(f, 1);
610 return result;
611}
612
Alexander Graf97221402015-01-22 15:01:38 +0100613int64_t qemu_ftell_fast(QEMUFile *f)
614{
615 int64_t ret = f->pos;
616 int i;
617
Daniel P. Berrange11808bb2016-04-27 11:05:17 +0100618 for (i = 0; i < f->iovcnt; i++) {
619 ret += f->iov[i].iov_len;
Alexander Graf97221402015-01-22 15:01:38 +0100620 }
621
622 return ret;
623}
624
Eduardo Habkost093c4552013-11-28 12:01:16 -0200625int64_t qemu_ftell(QEMUFile *f)
626{
627 qemu_fflush(f);
628 return f->pos;
629}
630
631int qemu_file_rate_limit(QEMUFile *f)
632{
633 if (qemu_file_get_error(f)) {
634 return 1;
635 }
636 if (f->xfer_limit > 0 && f->bytes_xfer > f->xfer_limit) {
637 return 1;
638 }
639 return 0;
640}
641
642int64_t qemu_file_get_rate_limit(QEMUFile *f)
643{
644 return f->xfer_limit;
645}
646
647void qemu_file_set_rate_limit(QEMUFile *f, int64_t limit)
648{
649 f->xfer_limit = limit;
650}
651
652void qemu_file_reset_rate_limit(QEMUFile *f)
653{
654 f->bytes_xfer = 0;
655}
656
Ivan Ren5d7d2552019-07-30 13:33:34 +0800657void qemu_file_update_transfer(QEMUFile *f, int64_t len)
658{
659 f->bytes_xfer += len;
660}
661
Eduardo Habkost093c4552013-11-28 12:01:16 -0200662void qemu_put_be16(QEMUFile *f, unsigned int v)
663{
664 qemu_put_byte(f, v >> 8);
665 qemu_put_byte(f, v);
666}
667
668void qemu_put_be32(QEMUFile *f, unsigned int v)
669{
670 qemu_put_byte(f, v >> 24);
671 qemu_put_byte(f, v >> 16);
672 qemu_put_byte(f, v >> 8);
673 qemu_put_byte(f, v);
674}
675
676void qemu_put_be64(QEMUFile *f, uint64_t v)
677{
678 qemu_put_be32(f, v >> 32);
679 qemu_put_be32(f, v);
680}
681
682unsigned int qemu_get_be16(QEMUFile *f)
683{
684 unsigned int v;
685 v = qemu_get_byte(f) << 8;
686 v |= qemu_get_byte(f);
687 return v;
688}
689
690unsigned int qemu_get_be32(QEMUFile *f)
691{
692 unsigned int v;
Peter Maydell90d6a672014-12-23 22:26:55 +0000693 v = (unsigned int)qemu_get_byte(f) << 24;
Eduardo Habkost093c4552013-11-28 12:01:16 -0200694 v |= qemu_get_byte(f) << 16;
695 v |= qemu_get_byte(f) << 8;
696 v |= qemu_get_byte(f);
697 return v;
698}
699
700uint64_t qemu_get_be64(QEMUFile *f)
701{
702 uint64_t v;
703 v = (uint64_t)qemu_get_be32(f) << 32;
704 v |= qemu_get_be32(f);
705 return v;
706}
Liang Li44f0ead2015-03-23 16:32:19 +0800707
Xiao Guangrongdcaf4462018-03-30 15:51:20 +0800708/* return the size after compression, or negative value on error */
709static int qemu_compress_data(z_stream *stream, uint8_t *dest, size_t dest_len,
710 const uint8_t *source, size_t source_len)
711{
712 int err;
713
714 err = deflateReset(stream);
715 if (err != Z_OK) {
716 return -1;
717 }
718
719 stream->avail_in = source_len;
720 stream->next_in = (uint8_t *)source;
721 stream->avail_out = dest_len;
722 stream->next_out = dest;
723
724 err = deflate(stream, Z_FINISH);
725 if (err != Z_STREAM_END) {
726 return -1;
727 }
728
729 return stream->next_out - dest;
730}
731
732/* Compress size bytes of data start at p and store the compressed
733 * data to the buffer of f.
Liang Lib3be2892016-05-05 15:32:54 +0800734 *
735 * When f is not writable, return -1 if f has no space to save the
736 * compressed data.
737 * When f is wirtable and it has no space to save the compressed data,
738 * do fflush first, if f still has no space to save the compressed
739 * data, return -1.
Liang Li44f0ead2015-03-23 16:32:19 +0800740 */
Xiao Guangrongdcaf4462018-03-30 15:51:20 +0800741ssize_t qemu_put_compression_data(QEMUFile *f, z_stream *stream,
742 const uint8_t *p, size_t size)
Liang Li44f0ead2015-03-23 16:32:19 +0800743{
744 ssize_t blen = IO_BUF_SIZE - f->buf_index - sizeof(int32_t);
745
746 if (blen < compressBound(size)) {
Liang Lib3be2892016-05-05 15:32:54 +0800747 if (!qemu_file_is_writable(f)) {
748 return -1;
749 }
750 qemu_fflush(f);
751 blen = IO_BUF_SIZE - sizeof(int32_t);
752 if (blen < compressBound(size)) {
753 return -1;
754 }
Liang Li44f0ead2015-03-23 16:32:19 +0800755 }
Xiao Guangrongdcaf4462018-03-30 15:51:20 +0800756
757 blen = qemu_compress_data(stream, f->buf + f->buf_index + sizeof(int32_t),
758 blen, p, size);
759 if (blen < 0) {
Xiao Guangrong34ab9e92018-03-30 15:51:22 +0800760 return -1;
Liang Li44f0ead2015-03-23 16:32:19 +0800761 }
Xiao Guangrong34ab9e92018-03-30 15:51:22 +0800762
Liang Li44f0ead2015-03-23 16:32:19 +0800763 qemu_put_be32(f, blen);
Liang Lib3be2892016-05-05 15:32:54 +0800764 if (f->ops->writev_buffer) {
Pavel Butsykin53f09a12017-02-03 18:23:20 +0300765 add_to_iovec(f, f->buf + f->buf_index, blen, false);
Liang Lib3be2892016-05-05 15:32:54 +0800766 }
Liang Li44f0ead2015-03-23 16:32:19 +0800767 f->buf_index += blen;
Liang Lib3be2892016-05-05 15:32:54 +0800768 if (f->buf_index == IO_BUF_SIZE) {
769 qemu_fflush(f);
770 }
Liang Li44f0ead2015-03-23 16:32:19 +0800771 return blen + sizeof(int32_t);
772}
773
774/* Put the data in the buffer of f_src to the buffer of f_des, and
775 * then reset the buf_index of f_src to 0.
776 */
777
778int qemu_put_qemu_file(QEMUFile *f_des, QEMUFile *f_src)
779{
780 int len = 0;
781
782 if (f_src->buf_index > 0) {
783 len = f_src->buf_index;
784 qemu_put_buffer(f_des, f_src->buf, f_src->buf_index);
785 f_src->buf_index = 0;
Liang Li787d1342016-08-09 08:22:26 +0800786 f_src->iovcnt = 0;
Liang Li44f0ead2015-03-23 16:32:19 +0800787 }
788 return len;
789}
Dr. David Alan Gilbertb3af1bc2015-05-21 13:24:11 +0100790
791/*
792 * Get a string whose length is determined by a single preceding byte
793 * A preallocated 256 byte buffer must be passed in.
794 * Returns: len on success and a 0 terminated string in the buffer
795 * else 0
796 * (Note a 0 length string will return 0 either way)
797 */
798size_t qemu_get_counted_string(QEMUFile *f, char buf[256])
799{
800 size_t len = qemu_get_byte(f);
801 size_t res = qemu_get_buffer(f, (uint8_t *)buf, len);
802
803 buf[res] = 0;
804
805 return res == len ? res : 0;
806}
Dr. David Alan Gilberta800cd52015-11-05 18:10:36 +0000807
808/*
Vladimir Sementsov-Ogievskiyf0d64cb2018-03-13 15:34:00 -0400809 * Put a string with one preceding byte containing its length. The length of
810 * the string should be less than 256.
811 */
812void qemu_put_counted_string(QEMUFile *f, const char *str)
813{
814 size_t len = strlen(str);
815
816 assert(len < 256);
817 qemu_put_byte(f, len);
818 qemu_put_buffer(f, (const uint8_t *)str, len);
819}
820
821/*
Dr. David Alan Gilberta800cd52015-11-05 18:10:36 +0000822 * Set the blocking state of the QEMUFile.
823 * Note: On some transports the OS only keeps a single blocking state for
824 * both directions, and thus changing the blocking on the main
825 * QEMUFile can also affect the return path.
826 */
827void qemu_file_set_blocking(QEMUFile *f, bool block)
828{
Daniel P. Berrange06ad5132016-04-27 11:04:56 +0100829 if (f->ops->set_blocking) {
Yury Kotov3d661c82019-04-22 13:34:20 +0300830 f->ops->set_blocking(f->opaque, block, NULL);
Dr. David Alan Gilberta800cd52015-11-05 18:10:36 +0000831 }
832}