Revert "spapr: Ensure CPU cores are added contiguously and removed in LIFO order"
[qemu.git] / migration / qemu-file.c
blobbbc565eb53cbe6ac4e58fd1d149d0d38e058cb0f
1 /*
2 * QEMU System Emulator
4 * Copyright (c) 2003-2008 Fabrice Bellard
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:
13 * The above copyright notice and this permission notice shall be included in
14 * all copies or substantial portions of the Software.
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.
24 #include "qemu/osdep.h"
25 #include <zlib.h>
26 #include "qemu-common.h"
27 #include "qemu/error-report.h"
28 #include "qemu/iov.h"
29 #include "qemu/sockets.h"
30 #include "qemu/coroutine.h"
31 #include "migration/migration.h"
32 #include "migration/qemu-file.h"
33 #include "trace.h"
35 #define IO_BUF_SIZE 32768
36 #define MAX_IOV_SIZE MIN(IOV_MAX, 64)
38 struct QEMUFile {
39 const QEMUFileOps *ops;
40 const QEMUFileHooks *hooks;
41 void *opaque;
43 int64_t bytes_xfer;
44 int64_t xfer_limit;
46 int64_t pos; /* start of buffer when writing, end of buffer
47 when reading */
48 int buf_index;
49 int buf_size; /* 0 when writing */
50 uint8_t buf[IO_BUF_SIZE];
52 struct iovec iov[MAX_IOV_SIZE];
53 unsigned int iovcnt;
55 int last_error;
59 * Stop a file from being read/written - not all backing files can do this
60 * typically only sockets can.
62 int qemu_file_shutdown(QEMUFile *f)
64 if (!f->ops->shut_down) {
65 return -ENOSYS;
67 return f->ops->shut_down(f->opaque, true, true);
71 * Result: QEMUFile* for a 'return path' for comms in the opposite direction
72 * NULL if not available
74 QEMUFile *qemu_file_get_return_path(QEMUFile *f)
76 if (!f->ops->get_return_path) {
77 return NULL;
79 return f->ops->get_return_path(f->opaque);
82 bool qemu_file_mode_is_not_valid(const char *mode)
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;
91 return false;
94 QEMUFile *qemu_fopen_ops(void *opaque, const QEMUFileOps *ops)
96 QEMUFile *f;
98 f = g_new0(QEMUFile, 1);
100 f->opaque = opaque;
101 f->ops = ops;
102 return f;
106 void qemu_file_set_hooks(QEMUFile *f, const QEMUFileHooks *hooks)
108 f->hooks = hooks;
112 * Get last error for stream f
114 * Return negative error value if there has been an error on previous
115 * operations, return 0 if no error happened.
118 int qemu_file_get_error(QEMUFile *f)
120 return f->last_error;
123 void qemu_file_set_error(QEMUFile *f, int ret)
125 if (f->last_error == 0) {
126 f->last_error = ret;
130 bool qemu_file_is_writable(QEMUFile *f)
132 return f->ops->writev_buffer;
136 * Flushes QEMUFile buffer
138 * If there is writev_buffer QEMUFileOps it uses it otherwise uses
139 * put_buffer ops. This will flush all pending data. If data was
140 * only partially flushed, it will set an error state.
142 void qemu_fflush(QEMUFile *f)
144 ssize_t ret = 0;
145 ssize_t expect = 0;
147 if (!qemu_file_is_writable(f)) {
148 return;
151 if (f->iovcnt > 0) {
152 expect = iov_size(f->iov, f->iovcnt);
153 ret = f->ops->writev_buffer(f->opaque, f->iov, f->iovcnt, f->pos);
156 if (ret >= 0) {
157 f->pos += ret;
159 /* We expect the QEMUFile write impl to send the full
160 * data set we requested, so sanity check that.
162 if (ret != expect) {
163 qemu_file_set_error(f, ret < 0 ? ret : -EIO);
165 f->buf_index = 0;
166 f->iovcnt = 0;
169 void ram_control_before_iterate(QEMUFile *f, uint64_t flags)
171 int ret = 0;
173 if (f->hooks && f->hooks->before_ram_iterate) {
174 ret = f->hooks->before_ram_iterate(f, f->opaque, flags, NULL);
175 if (ret < 0) {
176 qemu_file_set_error(f, ret);
181 void ram_control_after_iterate(QEMUFile *f, uint64_t flags)
183 int ret = 0;
185 if (f->hooks && f->hooks->after_ram_iterate) {
186 ret = f->hooks->after_ram_iterate(f, f->opaque, flags, NULL);
187 if (ret < 0) {
188 qemu_file_set_error(f, ret);
193 void ram_control_load_hook(QEMUFile *f, uint64_t flags, void *data)
195 int ret = -EINVAL;
197 if (f->hooks && f->hooks->hook_ram_load) {
198 ret = f->hooks->hook_ram_load(f, f->opaque, flags, data);
199 if (ret < 0) {
200 qemu_file_set_error(f, ret);
202 } else {
204 * Hook is a hook specifically requested by the source sending a flag
205 * that expects there to be a hook on the destination.
207 if (flags == RAM_CONTROL_HOOK) {
208 qemu_file_set_error(f, ret);
213 size_t ram_control_save_page(QEMUFile *f, ram_addr_t block_offset,
214 ram_addr_t offset, size_t size,
215 uint64_t *bytes_sent)
217 if (f->hooks && f->hooks->save_page) {
218 int ret = f->hooks->save_page(f, f->opaque, block_offset,
219 offset, size, bytes_sent);
221 if (ret != RAM_SAVE_CONTROL_DELAYED) {
222 if (bytes_sent && *bytes_sent > 0) {
223 qemu_update_position(f, *bytes_sent);
224 } else if (ret < 0) {
225 qemu_file_set_error(f, ret);
229 return ret;
232 return RAM_SAVE_CONTROL_NOT_SUPP;
236 * Attempt to fill the buffer from the underlying file
237 * Returns the number of bytes read, or negative value for an error.
239 * Note that it can return a partially full buffer even in a not error/not EOF
240 * case if the underlying file descriptor gives a short read, and that can
241 * happen even on a blocking fd.
243 static ssize_t qemu_fill_buffer(QEMUFile *f)
245 int len;
246 int pending;
248 assert(!qemu_file_is_writable(f));
250 pending = f->buf_size - f->buf_index;
251 if (pending > 0) {
252 memmove(f->buf, f->buf + f->buf_index, pending);
254 f->buf_index = 0;
255 f->buf_size = pending;
257 len = f->ops->get_buffer(f->opaque, f->buf + pending, f->pos,
258 IO_BUF_SIZE - pending);
259 if (len > 0) {
260 f->buf_size += len;
261 f->pos += len;
262 } else if (len == 0) {
263 qemu_file_set_error(f, -EIO);
264 } else if (len != -EAGAIN) {
265 qemu_file_set_error(f, len);
268 return len;
271 void qemu_update_position(QEMUFile *f, size_t size)
273 f->pos += size;
276 /** Closes the file
278 * Returns negative error value if any error happened on previous operations or
279 * while closing the file. Returns 0 or positive number on success.
281 * The meaning of return value on success depends on the specific backend
282 * being used.
284 int qemu_fclose(QEMUFile *f)
286 int ret;
287 qemu_fflush(f);
288 ret = qemu_file_get_error(f);
290 if (f->ops->close) {
291 int ret2 = f->ops->close(f->opaque);
292 if (ret >= 0) {
293 ret = ret2;
296 /* If any error was spotted before closing, we should report it
297 * instead of the close() return value.
299 if (f->last_error) {
300 ret = f->last_error;
302 g_free(f);
303 trace_qemu_file_fclose();
304 return ret;
307 static void add_to_iovec(QEMUFile *f, const uint8_t *buf, size_t size)
309 /* check for adjacent buffer and coalesce them */
310 if (f->iovcnt > 0 && buf == f->iov[f->iovcnt - 1].iov_base +
311 f->iov[f->iovcnt - 1].iov_len) {
312 f->iov[f->iovcnt - 1].iov_len += size;
313 } else {
314 f->iov[f->iovcnt].iov_base = (uint8_t *)buf;
315 f->iov[f->iovcnt++].iov_len = size;
318 if (f->iovcnt >= MAX_IOV_SIZE) {
319 qemu_fflush(f);
323 void qemu_put_buffer_async(QEMUFile *f, const uint8_t *buf, size_t size)
325 if (f->last_error) {
326 return;
329 f->bytes_xfer += size;
330 add_to_iovec(f, buf, size);
333 void qemu_put_buffer(QEMUFile *f, const uint8_t *buf, size_t size)
335 size_t l;
337 if (f->last_error) {
338 return;
341 while (size > 0) {
342 l = IO_BUF_SIZE - f->buf_index;
343 if (l > size) {
344 l = size;
346 memcpy(f->buf + f->buf_index, buf, l);
347 f->bytes_xfer += l;
348 add_to_iovec(f, f->buf + f->buf_index, l);
349 f->buf_index += l;
350 if (f->buf_index == IO_BUF_SIZE) {
351 qemu_fflush(f);
353 if (qemu_file_get_error(f)) {
354 break;
356 buf += l;
357 size -= l;
361 void qemu_put_byte(QEMUFile *f, int v)
363 if (f->last_error) {
364 return;
367 f->buf[f->buf_index] = v;
368 f->bytes_xfer++;
369 add_to_iovec(f, f->buf + f->buf_index, 1);
370 f->buf_index++;
371 if (f->buf_index == IO_BUF_SIZE) {
372 qemu_fflush(f);
376 void qemu_file_skip(QEMUFile *f, int size)
378 if (f->buf_index + size <= f->buf_size) {
379 f->buf_index += size;
384 * Read 'size' bytes from file (at 'offset') without moving the
385 * pointer and set 'buf' to point to that data.
387 * It will return size bytes unless there was an error, in which case it will
388 * return as many as it managed to read (assuming blocking fd's which
389 * all current QEMUFile are)
391 size_t qemu_peek_buffer(QEMUFile *f, uint8_t **buf, size_t size, size_t offset)
393 ssize_t pending;
394 size_t index;
396 assert(!qemu_file_is_writable(f));
397 assert(offset < IO_BUF_SIZE);
398 assert(size <= IO_BUF_SIZE - offset);
400 /* The 1st byte to read from */
401 index = f->buf_index + offset;
402 /* The number of available bytes starting at index */
403 pending = f->buf_size - index;
406 * qemu_fill_buffer might return just a few bytes, even when there isn't
407 * an error, so loop collecting them until we get enough.
409 while (pending < size) {
410 int received = qemu_fill_buffer(f);
412 if (received <= 0) {
413 break;
416 index = f->buf_index + offset;
417 pending = f->buf_size - index;
420 if (pending <= 0) {
421 return 0;
423 if (size > pending) {
424 size = pending;
427 *buf = f->buf + index;
428 return size;
432 * Read 'size' bytes of data from the file into buf.
433 * 'size' can be larger than the internal buffer.
435 * It will return size bytes unless there was an error, in which case it will
436 * return as many as it managed to read (assuming blocking fd's which
437 * all current QEMUFile are)
439 size_t qemu_get_buffer(QEMUFile *f, uint8_t *buf, size_t size)
441 size_t pending = size;
442 size_t done = 0;
444 while (pending > 0) {
445 size_t res;
446 uint8_t *src;
448 res = qemu_peek_buffer(f, &src, MIN(pending, IO_BUF_SIZE), 0);
449 if (res == 0) {
450 return done;
452 memcpy(buf, src, res);
453 qemu_file_skip(f, res);
454 buf += res;
455 pending -= res;
456 done += res;
458 return done;
462 * Read 'size' bytes of data from the file.
463 * 'size' can be larger than the internal buffer.
465 * The data:
466 * may be held on an internal buffer (in which case *buf is updated
467 * to point to it) that is valid until the next qemu_file operation.
468 * OR
469 * will be copied to the *buf that was passed in.
471 * The code tries to avoid the copy if possible.
473 * It will return size bytes unless there was an error, in which case it will
474 * return as many as it managed to read (assuming blocking fd's which
475 * all current QEMUFile are)
477 * Note: Since **buf may get changed, the caller should take care to
478 * keep a pointer to the original buffer if it needs to deallocate it.
480 size_t qemu_get_buffer_in_place(QEMUFile *f, uint8_t **buf, size_t size)
482 if (size < IO_BUF_SIZE) {
483 size_t res;
484 uint8_t *src;
486 res = qemu_peek_buffer(f, &src, size, 0);
488 if (res == size) {
489 qemu_file_skip(f, res);
490 *buf = src;
491 return res;
495 return qemu_get_buffer(f, *buf, size);
499 * Peeks a single byte from the buffer; this isn't guaranteed to work if
500 * offset leaves a gap after the previous read/peeked data.
502 int qemu_peek_byte(QEMUFile *f, int offset)
504 int index = f->buf_index + offset;
506 assert(!qemu_file_is_writable(f));
507 assert(offset < IO_BUF_SIZE);
509 if (index >= f->buf_size) {
510 qemu_fill_buffer(f);
511 index = f->buf_index + offset;
512 if (index >= f->buf_size) {
513 return 0;
516 return f->buf[index];
519 int qemu_get_byte(QEMUFile *f)
521 int result;
523 result = qemu_peek_byte(f, 0);
524 qemu_file_skip(f, 1);
525 return result;
528 int64_t qemu_ftell_fast(QEMUFile *f)
530 int64_t ret = f->pos;
531 int i;
533 for (i = 0; i < f->iovcnt; i++) {
534 ret += f->iov[i].iov_len;
537 return ret;
540 int64_t qemu_ftell(QEMUFile *f)
542 qemu_fflush(f);
543 return f->pos;
546 int qemu_file_rate_limit(QEMUFile *f)
548 if (qemu_file_get_error(f)) {
549 return 1;
551 if (f->xfer_limit > 0 && f->bytes_xfer > f->xfer_limit) {
552 return 1;
554 return 0;
557 int64_t qemu_file_get_rate_limit(QEMUFile *f)
559 return f->xfer_limit;
562 void qemu_file_set_rate_limit(QEMUFile *f, int64_t limit)
564 f->xfer_limit = limit;
567 void qemu_file_reset_rate_limit(QEMUFile *f)
569 f->bytes_xfer = 0;
572 void qemu_put_be16(QEMUFile *f, unsigned int v)
574 qemu_put_byte(f, v >> 8);
575 qemu_put_byte(f, v);
578 void qemu_put_be32(QEMUFile *f, unsigned int v)
580 qemu_put_byte(f, v >> 24);
581 qemu_put_byte(f, v >> 16);
582 qemu_put_byte(f, v >> 8);
583 qemu_put_byte(f, v);
586 void qemu_put_be64(QEMUFile *f, uint64_t v)
588 qemu_put_be32(f, v >> 32);
589 qemu_put_be32(f, v);
592 unsigned int qemu_get_be16(QEMUFile *f)
594 unsigned int v;
595 v = qemu_get_byte(f) << 8;
596 v |= qemu_get_byte(f);
597 return v;
600 unsigned int qemu_get_be32(QEMUFile *f)
602 unsigned int v;
603 v = (unsigned int)qemu_get_byte(f) << 24;
604 v |= qemu_get_byte(f) << 16;
605 v |= qemu_get_byte(f) << 8;
606 v |= qemu_get_byte(f);
607 return v;
610 uint64_t qemu_get_be64(QEMUFile *f)
612 uint64_t v;
613 v = (uint64_t)qemu_get_be32(f) << 32;
614 v |= qemu_get_be32(f);
615 return v;
618 /* Compress size bytes of data start at p with specific compression
619 * level and store the compressed data to the buffer of f.
621 * When f is not writable, return -1 if f has no space to save the
622 * compressed data.
623 * When f is wirtable and it has no space to save the compressed data,
624 * do fflush first, if f still has no space to save the compressed
625 * data, return -1.
628 ssize_t qemu_put_compression_data(QEMUFile *f, const uint8_t *p, size_t size,
629 int level)
631 ssize_t blen = IO_BUF_SIZE - f->buf_index - sizeof(int32_t);
633 if (blen < compressBound(size)) {
634 if (!qemu_file_is_writable(f)) {
635 return -1;
637 qemu_fflush(f);
638 blen = IO_BUF_SIZE - sizeof(int32_t);
639 if (blen < compressBound(size)) {
640 return -1;
643 if (compress2(f->buf + f->buf_index + sizeof(int32_t), (uLongf *)&blen,
644 (Bytef *)p, size, level) != Z_OK) {
645 error_report("Compress Failed!");
646 return 0;
648 qemu_put_be32(f, blen);
649 if (f->ops->writev_buffer) {
650 add_to_iovec(f, f->buf + f->buf_index, blen);
652 f->buf_index += blen;
653 if (f->buf_index == IO_BUF_SIZE) {
654 qemu_fflush(f);
656 return blen + sizeof(int32_t);
659 /* Put the data in the buffer of f_src to the buffer of f_des, and
660 * then reset the buf_index of f_src to 0.
663 int qemu_put_qemu_file(QEMUFile *f_des, QEMUFile *f_src)
665 int len = 0;
667 if (f_src->buf_index > 0) {
668 len = f_src->buf_index;
669 qemu_put_buffer(f_des, f_src->buf, f_src->buf_index);
670 f_src->buf_index = 0;
672 return len;
676 * Get a string whose length is determined by a single preceding byte
677 * A preallocated 256 byte buffer must be passed in.
678 * Returns: len on success and a 0 terminated string in the buffer
679 * else 0
680 * (Note a 0 length string will return 0 either way)
682 size_t qemu_get_counted_string(QEMUFile *f, char buf[256])
684 size_t len = qemu_get_byte(f);
685 size_t res = qemu_get_buffer(f, (uint8_t *)buf, len);
687 buf[res] = 0;
689 return res == len ? res : 0;
693 * Set the blocking state of the QEMUFile.
694 * Note: On some transports the OS only keeps a single blocking state for
695 * both directions, and thus changing the blocking on the main
696 * QEMUFile can also affect the return path.
698 void qemu_file_set_blocking(QEMUFile *f, bool block)
700 if (f->ops->set_blocking) {
701 f->ops->set_blocking(f->opaque, block);