]>
Commit | Line | Data |
---|---|---|
9a4ac51f EH |
1 | /* |
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 | */ | |
1393a485 | 24 | #include "qemu/osdep.h" |
44f0eadc | 25 | #include <zlib.h> |
093c455a | 26 | #include "qemu-common.h" |
d49b6836 | 27 | #include "qemu/error-report.h" |
093c455a EH |
28 | #include "qemu/iov.h" |
29 | #include "qemu/sockets.h" | |
10817bf0 | 30 | #include "qemu/coroutine.h" |
093c455a EH |
31 | #include "migration/migration.h" |
32 | #include "migration/qemu-file.h" | |
9013dca5 | 33 | #include "trace.h" |
093c455a | 34 | |
a24939f2 DB |
35 | #define IO_BUF_SIZE 32768 |
36 | #define MAX_IOV_SIZE MIN(IOV_MAX, 64) | |
37 | ||
38 | struct QEMUFile { | |
39 | const QEMUFileOps *ops; | |
40 | const QEMUFileHooks *hooks; | |
41 | void *opaque; | |
42 | ||
43 | int64_t bytes_xfer; | |
44 | int64_t xfer_limit; | |
45 | ||
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]; | |
51 | ||
52 | struct iovec iov[MAX_IOV_SIZE]; | |
53 | unsigned int iovcnt; | |
54 | ||
55 | int last_error; | |
56 | }; | |
57 | ||
e1a8c9b6 DDAG |
58 | /* |
59 | * Stop a file from being read/written - not all backing files can do this | |
60 | * typically only sockets can. | |
61 | */ | |
62 | int qemu_file_shutdown(QEMUFile *f) | |
63 | { | |
64 | if (!f->ops->shut_down) { | |
65 | return -ENOSYS; | |
66 | } | |
67 | return f->ops->shut_down(f->opaque, true, true); | |
68 | } | |
69 | ||
adc468e9 DDAG |
70 | /* |
71 | * Result: QEMUFile* for a 'return path' for comms in the opposite direction | |
72 | * NULL if not available | |
73 | */ | |
74 | QEMUFile *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 | ||
093c455a EH |
82 | bool 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 | ||
093c455a EH |
94 | QEMUFile *qemu_fopen_ops(void *opaque, const QEMUFileOps *ops) |
95 | { | |
96 | QEMUFile *f; | |
97 | ||
97f3ad35 | 98 | f = g_new0(QEMUFile, 1); |
093c455a EH |
99 | |
100 | f->opaque = opaque; | |
101 | f->ops = ops; | |
102 | return f; | |
103 | } | |
104 | ||
0436e09f DB |
105 | |
106 | void qemu_file_set_hooks(QEMUFile *f, const QEMUFileHooks *hooks) | |
107 | { | |
108 | f->hooks = hooks; | |
109 | } | |
110 | ||
093c455a EH |
111 | /* |
112 | * Get last error for stream f | |
113 | * | |
114 | * Return negative error value if there has been an error on previous | |
115 | * operations, return 0 if no error happened. | |
116 | * | |
117 | */ | |
118 | int qemu_file_get_error(QEMUFile *f) | |
119 | { | |
120 | return f->last_error; | |
121 | } | |
122 | ||
123 | void qemu_file_set_error(QEMUFile *f, int ret) | |
124 | { | |
125 | if (f->last_error == 0) { | |
126 | f->last_error = ret; | |
127 | } | |
128 | } | |
129 | ||
e68dd365 | 130 | bool qemu_file_is_writable(QEMUFile *f) |
093c455a EH |
131 | { |
132 | return f->ops->writev_buffer || f->ops->put_buffer; | |
133 | } | |
134 | ||
135 | /** | |
136 | * Flushes QEMUFile buffer | |
137 | * | |
138 | * If there is writev_buffer QEMUFileOps it uses it otherwise uses | |
baf51e77 DB |
139 | * put_buffer ops. This will flush all pending data. If data was |
140 | * only partially flushed, it will set an error state. | |
093c455a EH |
141 | */ |
142 | void qemu_fflush(QEMUFile *f) | |
143 | { | |
144 | ssize_t ret = 0; | |
baf51e77 | 145 | ssize_t expect = 0; |
093c455a EH |
146 | |
147 | if (!qemu_file_is_writable(f)) { | |
148 | return; | |
149 | } | |
150 | ||
151 | if (f->ops->writev_buffer) { | |
152 | if (f->iovcnt > 0) { | |
baf51e77 | 153 | expect = iov_size(f->iov, f->iovcnt); |
093c455a EH |
154 | ret = f->ops->writev_buffer(f->opaque, f->iov, f->iovcnt, f->pos); |
155 | } | |
156 | } else { | |
157 | if (f->buf_index > 0) { | |
baf51e77 | 158 | expect = f->buf_index; |
093c455a EH |
159 | ret = f->ops->put_buffer(f->opaque, f->buf, f->pos, f->buf_index); |
160 | } | |
161 | } | |
baf51e77 | 162 | |
093c455a EH |
163 | if (ret >= 0) { |
164 | f->pos += ret; | |
165 | } | |
baf51e77 DB |
166 | /* We expect the QEMUFile write impl to send the full |
167 | * data set we requested, so sanity check that. | |
168 | */ | |
169 | if (ret != expect) { | |
170 | qemu_file_set_error(f, ret < 0 ? ret : -EIO); | |
171 | } | |
093c455a EH |
172 | f->buf_index = 0; |
173 | f->iovcnt = 0; | |
093c455a EH |
174 | } |
175 | ||
176 | void ram_control_before_iterate(QEMUFile *f, uint64_t flags) | |
177 | { | |
178 | int ret = 0; | |
179 | ||
0436e09f DB |
180 | if (f->hooks && f->hooks->before_ram_iterate) { |
181 | ret = f->hooks->before_ram_iterate(f, f->opaque, flags, NULL); | |
093c455a EH |
182 | if (ret < 0) { |
183 | qemu_file_set_error(f, ret); | |
184 | } | |
185 | } | |
186 | } | |
187 | ||
188 | void ram_control_after_iterate(QEMUFile *f, uint64_t flags) | |
189 | { | |
190 | int ret = 0; | |
191 | ||
0436e09f DB |
192 | if (f->hooks && f->hooks->after_ram_iterate) { |
193 | ret = f->hooks->after_ram_iterate(f, f->opaque, flags, NULL); | |
093c455a EH |
194 | if (ret < 0) { |
195 | qemu_file_set_error(f, ret); | |
196 | } | |
197 | } | |
198 | } | |
199 | ||
632e3a5c | 200 | void ram_control_load_hook(QEMUFile *f, uint64_t flags, void *data) |
093c455a EH |
201 | { |
202 | int ret = -EINVAL; | |
203 | ||
0436e09f DB |
204 | if (f->hooks && f->hooks->hook_ram_load) { |
205 | ret = f->hooks->hook_ram_load(f, f->opaque, flags, data); | |
093c455a EH |
206 | if (ret < 0) { |
207 | qemu_file_set_error(f, ret); | |
208 | } | |
209 | } else { | |
632e3a5c DDAG |
210 | /* |
211 | * Hook is a hook specifically requested by the source sending a flag | |
212 | * that expects there to be a hook on the destination. | |
213 | */ | |
214 | if (flags == RAM_CONTROL_HOOK) { | |
215 | qemu_file_set_error(f, ret); | |
216 | } | |
093c455a EH |
217 | } |
218 | } | |
219 | ||
220 | size_t ram_control_save_page(QEMUFile *f, ram_addr_t block_offset, | |
6e1dea46 JQ |
221 | ram_addr_t offset, size_t size, |
222 | uint64_t *bytes_sent) | |
093c455a | 223 | { |
0436e09f DB |
224 | if (f->hooks && f->hooks->save_page) { |
225 | int ret = f->hooks->save_page(f, f->opaque, block_offset, | |
226 | offset, size, bytes_sent); | |
093c455a EH |
227 | |
228 | if (ret != RAM_SAVE_CONTROL_DELAYED) { | |
229 | if (bytes_sent && *bytes_sent > 0) { | |
230 | qemu_update_position(f, *bytes_sent); | |
231 | } else if (ret < 0) { | |
232 | qemu_file_set_error(f, ret); | |
233 | } | |
234 | } | |
235 | ||
236 | return ret; | |
237 | } | |
238 | ||
239 | return RAM_SAVE_CONTROL_NOT_SUPP; | |
240 | } | |
241 | ||
548f52ea DDAG |
242 | /* |
243 | * Attempt to fill the buffer from the underlying file | |
244 | * Returns the number of bytes read, or negative value for an error. | |
245 | * | |
246 | * Note that it can return a partially full buffer even in a not error/not EOF | |
247 | * case if the underlying file descriptor gives a short read, and that can | |
248 | * happen even on a blocking fd. | |
249 | */ | |
250 | static ssize_t qemu_fill_buffer(QEMUFile *f) | |
093c455a EH |
251 | { |
252 | int len; | |
253 | int pending; | |
254 | ||
255 | assert(!qemu_file_is_writable(f)); | |
256 | ||
257 | pending = f->buf_size - f->buf_index; | |
258 | if (pending > 0) { | |
259 | memmove(f->buf, f->buf + f->buf_index, pending); | |
260 | } | |
261 | f->buf_index = 0; | |
262 | f->buf_size = pending; | |
263 | ||
264 | len = f->ops->get_buffer(f->opaque, f->buf + pending, f->pos, | |
265 | IO_BUF_SIZE - pending); | |
266 | if (len > 0) { | |
267 | f->buf_size += len; | |
268 | f->pos += len; | |
269 | } else if (len == 0) { | |
270 | qemu_file_set_error(f, -EIO); | |
271 | } else if (len != -EAGAIN) { | |
272 | qemu_file_set_error(f, len); | |
273 | } | |
548f52ea DDAG |
274 | |
275 | return len; | |
093c455a EH |
276 | } |
277 | ||
278 | int qemu_get_fd(QEMUFile *f) | |
279 | { | |
280 | if (f->ops->get_fd) { | |
281 | return f->ops->get_fd(f->opaque); | |
282 | } | |
283 | return -1; | |
284 | } | |
285 | ||
286 | void qemu_update_position(QEMUFile *f, size_t size) | |
287 | { | |
288 | f->pos += size; | |
289 | } | |
290 | ||
291 | /** Closes the file | |
292 | * | |
293 | * Returns negative error value if any error happened on previous operations or | |
294 | * while closing the file. Returns 0 or positive number on success. | |
295 | * | |
296 | * The meaning of return value on success depends on the specific backend | |
297 | * being used. | |
298 | */ | |
299 | int qemu_fclose(QEMUFile *f) | |
300 | { | |
301 | int ret; | |
302 | qemu_fflush(f); | |
303 | ret = qemu_file_get_error(f); | |
304 | ||
305 | if (f->ops->close) { | |
306 | int ret2 = f->ops->close(f->opaque); | |
307 | if (ret >= 0) { | |
308 | ret = ret2; | |
309 | } | |
310 | } | |
311 | /* If any error was spotted before closing, we should report it | |
312 | * instead of the close() return value. | |
313 | */ | |
314 | if (f->last_error) { | |
315 | ret = f->last_error; | |
316 | } | |
317 | g_free(f); | |
9013dca5 | 318 | trace_qemu_file_fclose(); |
093c455a EH |
319 | return ret; |
320 | } | |
321 | ||
56f3835f | 322 | static void add_to_iovec(QEMUFile *f, const uint8_t *buf, size_t size) |
093c455a EH |
323 | { |
324 | /* check for adjacent buffer and coalesce them */ | |
325 | if (f->iovcnt > 0 && buf == f->iov[f->iovcnt - 1].iov_base + | |
326 | f->iov[f->iovcnt - 1].iov_len) { | |
327 | f->iov[f->iovcnt - 1].iov_len += size; | |
328 | } else { | |
329 | f->iov[f->iovcnt].iov_base = (uint8_t *)buf; | |
330 | f->iov[f->iovcnt++].iov_len = size; | |
331 | } | |
332 | ||
333 | if (f->iovcnt >= MAX_IOV_SIZE) { | |
334 | qemu_fflush(f); | |
335 | } | |
336 | } | |
337 | ||
56f3835f | 338 | void qemu_put_buffer_async(QEMUFile *f, const uint8_t *buf, size_t size) |
093c455a EH |
339 | { |
340 | if (!f->ops->writev_buffer) { | |
341 | qemu_put_buffer(f, buf, size); | |
342 | return; | |
343 | } | |
344 | ||
345 | if (f->last_error) { | |
346 | return; | |
347 | } | |
348 | ||
349 | f->bytes_xfer += size; | |
350 | add_to_iovec(f, buf, size); | |
351 | } | |
352 | ||
56f3835f | 353 | void qemu_put_buffer(QEMUFile *f, const uint8_t *buf, size_t size) |
093c455a | 354 | { |
56f3835f | 355 | size_t l; |
093c455a EH |
356 | |
357 | if (f->last_error) { | |
358 | return; | |
359 | } | |
360 | ||
361 | while (size > 0) { | |
362 | l = IO_BUF_SIZE - f->buf_index; | |
363 | if (l > size) { | |
364 | l = size; | |
365 | } | |
366 | memcpy(f->buf + f->buf_index, buf, l); | |
367 | f->bytes_xfer += l; | |
368 | if (f->ops->writev_buffer) { | |
369 | add_to_iovec(f, f->buf + f->buf_index, l); | |
370 | } | |
371 | f->buf_index += l; | |
372 | if (f->buf_index == IO_BUF_SIZE) { | |
373 | qemu_fflush(f); | |
374 | } | |
375 | if (qemu_file_get_error(f)) { | |
376 | break; | |
377 | } | |
378 | buf += l; | |
379 | size -= l; | |
380 | } | |
381 | } | |
382 | ||
383 | void qemu_put_byte(QEMUFile *f, int v) | |
384 | { | |
385 | if (f->last_error) { | |
386 | return; | |
387 | } | |
388 | ||
389 | f->buf[f->buf_index] = v; | |
390 | f->bytes_xfer++; | |
391 | if (f->ops->writev_buffer) { | |
392 | add_to_iovec(f, f->buf + f->buf_index, 1); | |
393 | } | |
394 | f->buf_index++; | |
395 | if (f->buf_index == IO_BUF_SIZE) { | |
396 | qemu_fflush(f); | |
397 | } | |
398 | } | |
399 | ||
400 | void qemu_file_skip(QEMUFile *f, int size) | |
401 | { | |
402 | if (f->buf_index + size <= f->buf_size) { | |
403 | f->buf_index += size; | |
404 | } | |
405 | } | |
406 | ||
548f52ea | 407 | /* |
7c1e52ba DDAG |
408 | * Read 'size' bytes from file (at 'offset') without moving the |
409 | * pointer and set 'buf' to point to that data. | |
548f52ea DDAG |
410 | * |
411 | * It will return size bytes unless there was an error, in which case it will | |
412 | * return as many as it managed to read (assuming blocking fd's which | |
413 | * all current QEMUFile are) | |
414 | */ | |
56f3835f | 415 | size_t qemu_peek_buffer(QEMUFile *f, uint8_t **buf, size_t size, size_t offset) |
093c455a | 416 | { |
56f3835f DDAG |
417 | ssize_t pending; |
418 | size_t index; | |
093c455a EH |
419 | |
420 | assert(!qemu_file_is_writable(f)); | |
548f52ea DDAG |
421 | assert(offset < IO_BUF_SIZE); |
422 | assert(size <= IO_BUF_SIZE - offset); | |
093c455a | 423 | |
548f52ea | 424 | /* The 1st byte to read from */ |
093c455a | 425 | index = f->buf_index + offset; |
548f52ea | 426 | /* The number of available bytes starting at index */ |
093c455a | 427 | pending = f->buf_size - index; |
548f52ea DDAG |
428 | |
429 | /* | |
430 | * qemu_fill_buffer might return just a few bytes, even when there isn't | |
431 | * an error, so loop collecting them until we get enough. | |
432 | */ | |
433 | while (pending < size) { | |
434 | int received = qemu_fill_buffer(f); | |
435 | ||
436 | if (received <= 0) { | |
437 | break; | |
438 | } | |
439 | ||
093c455a EH |
440 | index = f->buf_index + offset; |
441 | pending = f->buf_size - index; | |
442 | } | |
443 | ||
444 | if (pending <= 0) { | |
445 | return 0; | |
446 | } | |
447 | if (size > pending) { | |
448 | size = pending; | |
449 | } | |
450 | ||
7c1e52ba | 451 | *buf = f->buf + index; |
093c455a EH |
452 | return size; |
453 | } | |
454 | ||
548f52ea DDAG |
455 | /* |
456 | * Read 'size' bytes of data from the file into buf. | |
457 | * 'size' can be larger than the internal buffer. | |
458 | * | |
459 | * It will return size bytes unless there was an error, in which case it will | |
460 | * return as many as it managed to read (assuming blocking fd's which | |
461 | * all current QEMUFile are) | |
462 | */ | |
56f3835f | 463 | size_t qemu_get_buffer(QEMUFile *f, uint8_t *buf, size_t size) |
093c455a | 464 | { |
56f3835f DDAG |
465 | size_t pending = size; |
466 | size_t done = 0; | |
093c455a EH |
467 | |
468 | while (pending > 0) { | |
56f3835f | 469 | size_t res; |
7c1e52ba | 470 | uint8_t *src; |
093c455a | 471 | |
7c1e52ba | 472 | res = qemu_peek_buffer(f, &src, MIN(pending, IO_BUF_SIZE), 0); |
093c455a EH |
473 | if (res == 0) { |
474 | return done; | |
475 | } | |
7c1e52ba | 476 | memcpy(buf, src, res); |
093c455a EH |
477 | qemu_file_skip(f, res); |
478 | buf += res; | |
479 | pending -= res; | |
480 | done += res; | |
481 | } | |
482 | return done; | |
483 | } | |
484 | ||
9504fb51 DDAG |
485 | /* |
486 | * Read 'size' bytes of data from the file. | |
487 | * 'size' can be larger than the internal buffer. | |
488 | * | |
489 | * The data: | |
490 | * may be held on an internal buffer (in which case *buf is updated | |
491 | * to point to it) that is valid until the next qemu_file operation. | |
492 | * OR | |
493 | * will be copied to the *buf that was passed in. | |
494 | * | |
495 | * The code tries to avoid the copy if possible. | |
496 | * | |
497 | * It will return size bytes unless there was an error, in which case it will | |
498 | * return as many as it managed to read (assuming blocking fd's which | |
499 | * all current QEMUFile are) | |
500 | * | |
501 | * Note: Since **buf may get changed, the caller should take care to | |
502 | * keep a pointer to the original buffer if it needs to deallocate it. | |
503 | */ | |
504 | size_t qemu_get_buffer_in_place(QEMUFile *f, uint8_t **buf, size_t size) | |
505 | { | |
506 | if (size < IO_BUF_SIZE) { | |
507 | size_t res; | |
508 | uint8_t *src; | |
509 | ||
510 | res = qemu_peek_buffer(f, &src, size, 0); | |
511 | ||
512 | if (res == size) { | |
513 | qemu_file_skip(f, res); | |
514 | *buf = src; | |
515 | return res; | |
516 | } | |
517 | } | |
518 | ||
519 | return qemu_get_buffer(f, *buf, size); | |
520 | } | |
521 | ||
548f52ea DDAG |
522 | /* |
523 | * Peeks a single byte from the buffer; this isn't guaranteed to work if | |
524 | * offset leaves a gap after the previous read/peeked data. | |
525 | */ | |
093c455a EH |
526 | int qemu_peek_byte(QEMUFile *f, int offset) |
527 | { | |
528 | int index = f->buf_index + offset; | |
529 | ||
530 | assert(!qemu_file_is_writable(f)); | |
548f52ea | 531 | assert(offset < IO_BUF_SIZE); |
093c455a EH |
532 | |
533 | if (index >= f->buf_size) { | |
534 | qemu_fill_buffer(f); | |
535 | index = f->buf_index + offset; | |
536 | if (index >= f->buf_size) { | |
537 | return 0; | |
538 | } | |
539 | } | |
540 | return f->buf[index]; | |
541 | } | |
542 | ||
543 | int qemu_get_byte(QEMUFile *f) | |
544 | { | |
545 | int result; | |
546 | ||
547 | result = qemu_peek_byte(f, 0); | |
548 | qemu_file_skip(f, 1); | |
549 | return result; | |
550 | } | |
551 | ||
97221400 AG |
552 | int64_t qemu_ftell_fast(QEMUFile *f) |
553 | { | |
554 | int64_t ret = f->pos; | |
555 | int i; | |
556 | ||
557 | if (f->ops->writev_buffer) { | |
558 | for (i = 0; i < f->iovcnt; i++) { | |
559 | ret += f->iov[i].iov_len; | |
560 | } | |
561 | } else { | |
562 | ret += f->buf_index; | |
563 | } | |
564 | ||
565 | return ret; | |
566 | } | |
567 | ||
093c455a EH |
568 | int64_t qemu_ftell(QEMUFile *f) |
569 | { | |
570 | qemu_fflush(f); | |
571 | return f->pos; | |
572 | } | |
573 | ||
574 | int qemu_file_rate_limit(QEMUFile *f) | |
575 | { | |
576 | if (qemu_file_get_error(f)) { | |
577 | return 1; | |
578 | } | |
579 | if (f->xfer_limit > 0 && f->bytes_xfer > f->xfer_limit) { | |
580 | return 1; | |
581 | } | |
582 | return 0; | |
583 | } | |
584 | ||
585 | int64_t qemu_file_get_rate_limit(QEMUFile *f) | |
586 | { | |
587 | return f->xfer_limit; | |
588 | } | |
589 | ||
590 | void qemu_file_set_rate_limit(QEMUFile *f, int64_t limit) | |
591 | { | |
592 | f->xfer_limit = limit; | |
593 | } | |
594 | ||
595 | void qemu_file_reset_rate_limit(QEMUFile *f) | |
596 | { | |
597 | f->bytes_xfer = 0; | |
598 | } | |
599 | ||
600 | void qemu_put_be16(QEMUFile *f, unsigned int v) | |
601 | { | |
602 | qemu_put_byte(f, v >> 8); | |
603 | qemu_put_byte(f, v); | |
604 | } | |
605 | ||
606 | void qemu_put_be32(QEMUFile *f, unsigned int v) | |
607 | { | |
608 | qemu_put_byte(f, v >> 24); | |
609 | qemu_put_byte(f, v >> 16); | |
610 | qemu_put_byte(f, v >> 8); | |
611 | qemu_put_byte(f, v); | |
612 | } | |
613 | ||
614 | void qemu_put_be64(QEMUFile *f, uint64_t v) | |
615 | { | |
616 | qemu_put_be32(f, v >> 32); | |
617 | qemu_put_be32(f, v); | |
618 | } | |
619 | ||
620 | unsigned int qemu_get_be16(QEMUFile *f) | |
621 | { | |
622 | unsigned int v; | |
623 | v = qemu_get_byte(f) << 8; | |
624 | v |= qemu_get_byte(f); | |
625 | return v; | |
626 | } | |
627 | ||
628 | unsigned int qemu_get_be32(QEMUFile *f) | |
629 | { | |
630 | unsigned int v; | |
90d6a673 | 631 | v = (unsigned int)qemu_get_byte(f) << 24; |
093c455a EH |
632 | v |= qemu_get_byte(f) << 16; |
633 | v |= qemu_get_byte(f) << 8; | |
634 | v |= qemu_get_byte(f); | |
635 | return v; | |
636 | } | |
637 | ||
638 | uint64_t qemu_get_be64(QEMUFile *f) | |
639 | { | |
640 | uint64_t v; | |
641 | v = (uint64_t)qemu_get_be32(f) << 32; | |
642 | v |= qemu_get_be32(f); | |
643 | return v; | |
644 | } | |
44f0eadc LL |
645 | |
646 | /* compress size bytes of data start at p with specific compression | |
647 | * level and store the compressed data to the buffer of f. | |
648 | */ | |
649 | ||
650 | ssize_t qemu_put_compression_data(QEMUFile *f, const uint8_t *p, size_t size, | |
651 | int level) | |
652 | { | |
653 | ssize_t blen = IO_BUF_SIZE - f->buf_index - sizeof(int32_t); | |
654 | ||
655 | if (blen < compressBound(size)) { | |
656 | return 0; | |
657 | } | |
658 | if (compress2(f->buf + f->buf_index + sizeof(int32_t), (uLongf *)&blen, | |
659 | (Bytef *)p, size, level) != Z_OK) { | |
660 | error_report("Compress Failed!"); | |
661 | return 0; | |
662 | } | |
663 | qemu_put_be32(f, blen); | |
664 | f->buf_index += blen; | |
665 | return blen + sizeof(int32_t); | |
666 | } | |
667 | ||
668 | /* Put the data in the buffer of f_src to the buffer of f_des, and | |
669 | * then reset the buf_index of f_src to 0. | |
670 | */ | |
671 | ||
672 | int qemu_put_qemu_file(QEMUFile *f_des, QEMUFile *f_src) | |
673 | { | |
674 | int len = 0; | |
675 | ||
676 | if (f_src->buf_index > 0) { | |
677 | len = f_src->buf_index; | |
678 | qemu_put_buffer(f_des, f_src->buf, f_src->buf_index); | |
679 | f_src->buf_index = 0; | |
680 | } | |
681 | return len; | |
682 | } | |
b3af1bc9 DDAG |
683 | |
684 | /* | |
685 | * Get a string whose length is determined by a single preceding byte | |
686 | * A preallocated 256 byte buffer must be passed in. | |
687 | * Returns: len on success and a 0 terminated string in the buffer | |
688 | * else 0 | |
689 | * (Note a 0 length string will return 0 either way) | |
690 | */ | |
691 | size_t qemu_get_counted_string(QEMUFile *f, char buf[256]) | |
692 | { | |
693 | size_t len = qemu_get_byte(f); | |
694 | size_t res = qemu_get_buffer(f, (uint8_t *)buf, len); | |
695 | ||
696 | buf[res] = 0; | |
697 | ||
698 | return res == len ? res : 0; | |
699 | } | |
a800cd5c DDAG |
700 | |
701 | /* | |
702 | * Set the blocking state of the QEMUFile. | |
703 | * Note: On some transports the OS only keeps a single blocking state for | |
704 | * both directions, and thus changing the blocking on the main | |
705 | * QEMUFile can also affect the return path. | |
706 | */ | |
707 | void qemu_file_set_blocking(QEMUFile *f, bool block) | |
708 | { | |
06ad5135 DB |
709 | if (f->ops->set_blocking) { |
710 | f->ops->set_blocking(f->opaque, block); | |
a800cd5c | 711 | } else { |
06ad5135 DB |
712 | if (block) { |
713 | qemu_set_block(qemu_get_fd(f)); | |
714 | } else { | |
715 | qemu_set_nonblock(qemu_get_fd(f)); | |
716 | } | |
a800cd5c DDAG |
717 | } |
718 | } |