2
0

savevm.c 56 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231
  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. */
  24. #include <unistd.h>
  25. #include <fcntl.h>
  26. #include <time.h>
  27. #include <errno.h>
  28. #include <sys/time.h>
  29. #include <zlib.h>
  30. /* Needed early for CONFIG_BSD etc. */
  31. #include "config-host.h"
  32. #ifndef _WIN32
  33. #include <sys/times.h>
  34. #include <sys/wait.h>
  35. #include <termios.h>
  36. #include <sys/mman.h>
  37. #include <sys/ioctl.h>
  38. #include <sys/resource.h>
  39. #include <sys/socket.h>
  40. #include <netinet/in.h>
  41. #include <net/if.h>
  42. #include <arpa/inet.h>
  43. #include <dirent.h>
  44. #include <netdb.h>
  45. #include <sys/select.h>
  46. #ifdef CONFIG_BSD
  47. #include <sys/stat.h>
  48. #if defined(__FreeBSD__) || defined(__FreeBSD_kernel__) || defined(__DragonFly__)
  49. #include <libutil.h>
  50. #else
  51. #include <util.h>
  52. #endif
  53. #ifdef __linux__
  54. #include <pty.h>
  55. #include <malloc.h>
  56. #include <linux/rtc.h>
  57. #endif
  58. #endif
  59. #endif
  60. #ifdef _WIN32
  61. #include <windows.h>
  62. #include <malloc.h>
  63. #include <sys/timeb.h>
  64. #include <mmsystem.h>
  65. #define getopt_long_only getopt_long
  66. #define memalign(align, size) malloc(size)
  67. #endif
  68. #include "qemu-common.h"
  69. #include "hw/hw.h"
  70. #include "hw/qdev.h"
  71. #include "net.h"
  72. #include "monitor.h"
  73. #include "sysemu.h"
  74. #include "qemu-timer.h"
  75. #include "qemu-char.h"
  76. #include "audio/audio.h"
  77. #include "migration.h"
  78. #include "qemu_socket.h"
  79. #include "qemu-queue.h"
  80. #include "qemu-timer.h"
  81. #include "cpus.h"
  82. #define SELF_ANNOUNCE_ROUNDS 5
  83. #ifndef ETH_P_RARP
  84. #define ETH_P_RARP 0x8035
  85. #endif
  86. #define ARP_HTYPE_ETH 0x0001
  87. #define ARP_PTYPE_IP 0x0800
  88. #define ARP_OP_REQUEST_REV 0x3
  89. static int announce_self_create(uint8_t *buf,
  90. uint8_t *mac_addr)
  91. {
  92. /* Ethernet header. */
  93. memset(buf, 0xff, 6); /* destination MAC addr */
  94. memcpy(buf + 6, mac_addr, 6); /* source MAC addr */
  95. *(uint16_t *)(buf + 12) = htons(ETH_P_RARP); /* ethertype */
  96. /* RARP header. */
  97. *(uint16_t *)(buf + 14) = htons(ARP_HTYPE_ETH); /* hardware addr space */
  98. *(uint16_t *)(buf + 16) = htons(ARP_PTYPE_IP); /* protocol addr space */
  99. *(buf + 18) = 6; /* hardware addr length (ethernet) */
  100. *(buf + 19) = 4; /* protocol addr length (IPv4) */
  101. *(uint16_t *)(buf + 20) = htons(ARP_OP_REQUEST_REV); /* opcode */
  102. memcpy(buf + 22, mac_addr, 6); /* source hw addr */
  103. memset(buf + 28, 0x00, 4); /* source protocol addr */
  104. memcpy(buf + 32, mac_addr, 6); /* target hw addr */
  105. memset(buf + 38, 0x00, 4); /* target protocol addr */
  106. /* Padding to get up to 60 bytes (ethernet min packet size, minus FCS). */
  107. memset(buf + 42, 0x00, 18);
  108. return 60; /* len (FCS will be added by hardware) */
  109. }
  110. static void qemu_announce_self_iter(NICState *nic, void *opaque)
  111. {
  112. uint8_t buf[60];
  113. int len;
  114. len = announce_self_create(buf, nic->conf->macaddr.a);
  115. qemu_send_packet_raw(&nic->nc, buf, len);
  116. }
  117. static void qemu_announce_self_once(void *opaque)
  118. {
  119. static int count = SELF_ANNOUNCE_ROUNDS;
  120. QEMUTimer *timer = *(QEMUTimer **)opaque;
  121. qemu_foreach_nic(qemu_announce_self_iter, NULL);
  122. if (--count) {
  123. /* delay 50ms, 150ms, 250ms, ... */
  124. qemu_mod_timer(timer, qemu_get_clock_ms(rt_clock) +
  125. 50 + (SELF_ANNOUNCE_ROUNDS - count - 1) * 100);
  126. } else {
  127. qemu_del_timer(timer);
  128. qemu_free_timer(timer);
  129. }
  130. }
  131. void qemu_announce_self(void)
  132. {
  133. static QEMUTimer *timer;
  134. timer = qemu_new_timer_ms(rt_clock, qemu_announce_self_once, &timer);
  135. qemu_announce_self_once(&timer);
  136. }
  137. /***********************************************************/
  138. /* savevm/loadvm support */
  139. #define IO_BUF_SIZE 32768
  140. struct QEMUFile {
  141. QEMUFilePutBufferFunc *put_buffer;
  142. QEMUFileGetBufferFunc *get_buffer;
  143. QEMUFileCloseFunc *close;
  144. QEMUFileRateLimit *rate_limit;
  145. QEMUFileSetRateLimit *set_rate_limit;
  146. QEMUFileGetRateLimit *get_rate_limit;
  147. void *opaque;
  148. int is_write;
  149. int64_t buf_offset; /* start of buffer when writing, end of buffer
  150. when reading */
  151. int buf_index;
  152. int buf_size; /* 0 when writing */
  153. uint8_t buf[IO_BUF_SIZE];
  154. int last_error;
  155. };
  156. typedef struct QEMUFileStdio
  157. {
  158. FILE *stdio_file;
  159. QEMUFile *file;
  160. } QEMUFileStdio;
  161. typedef struct QEMUFileSocket
  162. {
  163. int fd;
  164. QEMUFile *file;
  165. } QEMUFileSocket;
  166. static int socket_get_buffer(void *opaque, uint8_t *buf, int64_t pos, int size)
  167. {
  168. QEMUFileSocket *s = opaque;
  169. ssize_t len;
  170. do {
  171. len = qemu_recv(s->fd, buf, size, 0);
  172. } while (len == -1 && socket_error() == EINTR);
  173. if (len == -1)
  174. len = -socket_error();
  175. return len;
  176. }
  177. static int socket_close(void *opaque)
  178. {
  179. QEMUFileSocket *s = opaque;
  180. g_free(s);
  181. return 0;
  182. }
  183. static int stdio_put_buffer(void *opaque, const uint8_t *buf, int64_t pos, int size)
  184. {
  185. QEMUFileStdio *s = opaque;
  186. return fwrite(buf, 1, size, s->stdio_file);
  187. }
  188. static int stdio_get_buffer(void *opaque, uint8_t *buf, int64_t pos, int size)
  189. {
  190. QEMUFileStdio *s = opaque;
  191. FILE *fp = s->stdio_file;
  192. int bytes;
  193. do {
  194. clearerr(fp);
  195. bytes = fread(buf, 1, size, fp);
  196. } while ((bytes == 0) && ferror(fp) && (errno == EINTR));
  197. return bytes;
  198. }
  199. static int stdio_pclose(void *opaque)
  200. {
  201. QEMUFileStdio *s = opaque;
  202. int ret;
  203. ret = pclose(s->stdio_file);
  204. g_free(s);
  205. return ret;
  206. }
  207. static int stdio_fclose(void *opaque)
  208. {
  209. QEMUFileStdio *s = opaque;
  210. fclose(s->stdio_file);
  211. g_free(s);
  212. return 0;
  213. }
  214. QEMUFile *qemu_popen(FILE *stdio_file, const char *mode)
  215. {
  216. QEMUFileStdio *s;
  217. if (stdio_file == NULL || mode == NULL || (mode[0] != 'r' && mode[0] != 'w') || mode[1] != 0) {
  218. fprintf(stderr, "qemu_popen: Argument validity check failed\n");
  219. return NULL;
  220. }
  221. s = g_malloc0(sizeof(QEMUFileStdio));
  222. s->stdio_file = stdio_file;
  223. if(mode[0] == 'r') {
  224. s->file = qemu_fopen_ops(s, NULL, stdio_get_buffer, stdio_pclose,
  225. NULL, NULL, NULL);
  226. } else {
  227. s->file = qemu_fopen_ops(s, stdio_put_buffer, NULL, stdio_pclose,
  228. NULL, NULL, NULL);
  229. }
  230. return s->file;
  231. }
  232. QEMUFile *qemu_popen_cmd(const char *command, const char *mode)
  233. {
  234. FILE *popen_file;
  235. popen_file = popen(command, mode);
  236. if(popen_file == NULL) {
  237. return NULL;
  238. }
  239. return qemu_popen(popen_file, mode);
  240. }
  241. int qemu_stdio_fd(QEMUFile *f)
  242. {
  243. QEMUFileStdio *p;
  244. int fd;
  245. p = (QEMUFileStdio *)f->opaque;
  246. fd = fileno(p->stdio_file);
  247. return fd;
  248. }
  249. QEMUFile *qemu_fdopen(int fd, const char *mode)
  250. {
  251. QEMUFileStdio *s;
  252. if (mode == NULL ||
  253. (mode[0] != 'r' && mode[0] != 'w') ||
  254. mode[1] != 'b' || mode[2] != 0) {
  255. fprintf(stderr, "qemu_fdopen: Argument validity check failed\n");
  256. return NULL;
  257. }
  258. s = g_malloc0(sizeof(QEMUFileStdio));
  259. s->stdio_file = fdopen(fd, mode);
  260. if (!s->stdio_file)
  261. goto fail;
  262. if(mode[0] == 'r') {
  263. s->file = qemu_fopen_ops(s, NULL, stdio_get_buffer, stdio_fclose,
  264. NULL, NULL, NULL);
  265. } else {
  266. s->file = qemu_fopen_ops(s, stdio_put_buffer, NULL, stdio_fclose,
  267. NULL, NULL, NULL);
  268. }
  269. return s->file;
  270. fail:
  271. g_free(s);
  272. return NULL;
  273. }
  274. QEMUFile *qemu_fopen_socket(int fd)
  275. {
  276. QEMUFileSocket *s = g_malloc0(sizeof(QEMUFileSocket));
  277. s->fd = fd;
  278. s->file = qemu_fopen_ops(s, NULL, socket_get_buffer, socket_close,
  279. NULL, NULL, NULL);
  280. return s->file;
  281. }
  282. static int file_put_buffer(void *opaque, const uint8_t *buf,
  283. int64_t pos, int size)
  284. {
  285. QEMUFileStdio *s = opaque;
  286. fseek(s->stdio_file, pos, SEEK_SET);
  287. return fwrite(buf, 1, size, s->stdio_file);
  288. }
  289. static int file_get_buffer(void *opaque, uint8_t *buf, int64_t pos, int size)
  290. {
  291. QEMUFileStdio *s = opaque;
  292. fseek(s->stdio_file, pos, SEEK_SET);
  293. return fread(buf, 1, size, s->stdio_file);
  294. }
  295. QEMUFile *qemu_fopen(const char *filename, const char *mode)
  296. {
  297. QEMUFileStdio *s;
  298. if (mode == NULL ||
  299. (mode[0] != 'r' && mode[0] != 'w') ||
  300. mode[1] != 'b' || mode[2] != 0) {
  301. fprintf(stderr, "qemu_fopen: Argument validity check failed\n");
  302. return NULL;
  303. }
  304. s = g_malloc0(sizeof(QEMUFileStdio));
  305. s->stdio_file = fopen(filename, mode);
  306. if (!s->stdio_file)
  307. goto fail;
  308. if(mode[0] == 'w') {
  309. s->file = qemu_fopen_ops(s, file_put_buffer, NULL, stdio_fclose,
  310. NULL, NULL, NULL);
  311. } else {
  312. s->file = qemu_fopen_ops(s, NULL, file_get_buffer, stdio_fclose,
  313. NULL, NULL, NULL);
  314. }
  315. return s->file;
  316. fail:
  317. g_free(s);
  318. return NULL;
  319. }
  320. static int block_put_buffer(void *opaque, const uint8_t *buf,
  321. int64_t pos, int size)
  322. {
  323. bdrv_save_vmstate(opaque, buf, pos, size);
  324. return size;
  325. }
  326. static int block_get_buffer(void *opaque, uint8_t *buf, int64_t pos, int size)
  327. {
  328. return bdrv_load_vmstate(opaque, buf, pos, size);
  329. }
  330. static int bdrv_fclose(void *opaque)
  331. {
  332. return 0;
  333. }
  334. static QEMUFile *qemu_fopen_bdrv(BlockDriverState *bs, int is_writable)
  335. {
  336. if (is_writable)
  337. return qemu_fopen_ops(bs, block_put_buffer, NULL, bdrv_fclose,
  338. NULL, NULL, NULL);
  339. return qemu_fopen_ops(bs, NULL, block_get_buffer, bdrv_fclose, NULL, NULL, NULL);
  340. }
  341. QEMUFile *qemu_fopen_ops(void *opaque, QEMUFilePutBufferFunc *put_buffer,
  342. QEMUFileGetBufferFunc *get_buffer,
  343. QEMUFileCloseFunc *close,
  344. QEMUFileRateLimit *rate_limit,
  345. QEMUFileSetRateLimit *set_rate_limit,
  346. QEMUFileGetRateLimit *get_rate_limit)
  347. {
  348. QEMUFile *f;
  349. f = g_malloc0(sizeof(QEMUFile));
  350. f->opaque = opaque;
  351. f->put_buffer = put_buffer;
  352. f->get_buffer = get_buffer;
  353. f->close = close;
  354. f->rate_limit = rate_limit;
  355. f->set_rate_limit = set_rate_limit;
  356. f->get_rate_limit = get_rate_limit;
  357. f->is_write = 0;
  358. return f;
  359. }
  360. int qemu_file_get_error(QEMUFile *f)
  361. {
  362. return f->last_error;
  363. }
  364. void qemu_file_set_error(QEMUFile *f, int ret)
  365. {
  366. f->last_error = ret;
  367. }
  368. void qemu_fflush(QEMUFile *f)
  369. {
  370. if (!f->put_buffer)
  371. return;
  372. if (f->is_write && f->buf_index > 0) {
  373. int len;
  374. len = f->put_buffer(f->opaque, f->buf, f->buf_offset, f->buf_index);
  375. if (len > 0)
  376. f->buf_offset += f->buf_index;
  377. else
  378. f->last_error = -EINVAL;
  379. f->buf_index = 0;
  380. }
  381. }
  382. static void qemu_fill_buffer(QEMUFile *f)
  383. {
  384. int len;
  385. int pending;
  386. if (!f->get_buffer)
  387. return;
  388. if (f->is_write)
  389. abort();
  390. pending = f->buf_size - f->buf_index;
  391. if (pending > 0) {
  392. memmove(f->buf, f->buf + f->buf_index, pending);
  393. }
  394. f->buf_index = 0;
  395. f->buf_size = pending;
  396. len = f->get_buffer(f->opaque, f->buf + pending, f->buf_offset,
  397. IO_BUF_SIZE - pending);
  398. if (len > 0) {
  399. f->buf_size += len;
  400. f->buf_offset += len;
  401. } else if (len == 0) {
  402. f->last_error = -EIO;
  403. } else if (len != -EAGAIN)
  404. f->last_error = len;
  405. }
  406. int qemu_fclose(QEMUFile *f)
  407. {
  408. int ret = 0;
  409. qemu_fflush(f);
  410. if (f->close)
  411. ret = f->close(f->opaque);
  412. g_free(f);
  413. return ret;
  414. }
  415. void qemu_file_put_notify(QEMUFile *f)
  416. {
  417. f->put_buffer(f->opaque, NULL, 0, 0);
  418. }
  419. void qemu_put_buffer(QEMUFile *f, const uint8_t *buf, int size)
  420. {
  421. int l;
  422. if (!f->last_error && f->is_write == 0 && f->buf_index > 0) {
  423. fprintf(stderr,
  424. "Attempted to write to buffer while read buffer is not empty\n");
  425. abort();
  426. }
  427. while (!f->last_error && size > 0) {
  428. l = IO_BUF_SIZE - f->buf_index;
  429. if (l > size)
  430. l = size;
  431. memcpy(f->buf + f->buf_index, buf, l);
  432. f->is_write = 1;
  433. f->buf_index += l;
  434. buf += l;
  435. size -= l;
  436. if (f->buf_index >= IO_BUF_SIZE)
  437. qemu_fflush(f);
  438. }
  439. }
  440. void qemu_put_byte(QEMUFile *f, int v)
  441. {
  442. if (!f->last_error && f->is_write == 0 && f->buf_index > 0) {
  443. fprintf(stderr,
  444. "Attempted to write to buffer while read buffer is not empty\n");
  445. abort();
  446. }
  447. f->buf[f->buf_index++] = v;
  448. f->is_write = 1;
  449. if (f->buf_index >= IO_BUF_SIZE)
  450. qemu_fflush(f);
  451. }
  452. static void qemu_file_skip(QEMUFile *f, int size)
  453. {
  454. if (f->buf_index + size <= f->buf_size) {
  455. f->buf_index += size;
  456. }
  457. }
  458. static int qemu_peek_buffer(QEMUFile *f, uint8_t *buf, int size, size_t offset)
  459. {
  460. int pending;
  461. int index;
  462. if (f->is_write) {
  463. abort();
  464. }
  465. index = f->buf_index + offset;
  466. pending = f->buf_size - index;
  467. if (pending < size) {
  468. qemu_fill_buffer(f);
  469. index = f->buf_index + offset;
  470. pending = f->buf_size - index;
  471. }
  472. if (pending <= 0) {
  473. return 0;
  474. }
  475. if (size > pending) {
  476. size = pending;
  477. }
  478. memcpy(buf, f->buf + index, size);
  479. return size;
  480. }
  481. int qemu_get_buffer(QEMUFile *f, uint8_t *buf, int size)
  482. {
  483. int pending = size;
  484. int done = 0;
  485. while (pending > 0) {
  486. int res;
  487. res = qemu_peek_buffer(f, buf, pending, 0);
  488. if (res == 0) {
  489. return done;
  490. }
  491. qemu_file_skip(f, res);
  492. buf += res;
  493. pending -= res;
  494. done += res;
  495. }
  496. return done;
  497. }
  498. static int qemu_peek_byte(QEMUFile *f, int offset)
  499. {
  500. int index = f->buf_index + offset;
  501. if (f->is_write) {
  502. abort();
  503. }
  504. if (index >= f->buf_size) {
  505. qemu_fill_buffer(f);
  506. index = f->buf_index + offset;
  507. if (index >= f->buf_size) {
  508. return 0;
  509. }
  510. }
  511. return f->buf[index];
  512. }
  513. int qemu_get_byte(QEMUFile *f)
  514. {
  515. int result;
  516. result = qemu_peek_byte(f, 0);
  517. qemu_file_skip(f, 1);
  518. return result;
  519. }
  520. int64_t qemu_ftell(QEMUFile *f)
  521. {
  522. return f->buf_offset - f->buf_size + f->buf_index;
  523. }
  524. int64_t qemu_fseek(QEMUFile *f, int64_t pos, int whence)
  525. {
  526. if (whence == SEEK_SET) {
  527. /* nothing to do */
  528. } else if (whence == SEEK_CUR) {
  529. pos += qemu_ftell(f);
  530. } else {
  531. /* SEEK_END not supported */
  532. return -1;
  533. }
  534. if (f->put_buffer) {
  535. qemu_fflush(f);
  536. f->buf_offset = pos;
  537. } else {
  538. f->buf_offset = pos;
  539. f->buf_index = 0;
  540. f->buf_size = 0;
  541. }
  542. return pos;
  543. }
  544. int qemu_file_rate_limit(QEMUFile *f)
  545. {
  546. if (f->rate_limit)
  547. return f->rate_limit(f->opaque);
  548. return 0;
  549. }
  550. int64_t qemu_file_get_rate_limit(QEMUFile *f)
  551. {
  552. if (f->get_rate_limit)
  553. return f->get_rate_limit(f->opaque);
  554. return 0;
  555. }
  556. int64_t qemu_file_set_rate_limit(QEMUFile *f, int64_t new_rate)
  557. {
  558. /* any failed or completed migration keeps its state to allow probing of
  559. * migration data, but has no associated file anymore */
  560. if (f && f->set_rate_limit)
  561. return f->set_rate_limit(f->opaque, new_rate);
  562. return 0;
  563. }
  564. void qemu_put_be16(QEMUFile *f, unsigned int v)
  565. {
  566. qemu_put_byte(f, v >> 8);
  567. qemu_put_byte(f, v);
  568. }
  569. void qemu_put_be32(QEMUFile *f, unsigned int v)
  570. {
  571. qemu_put_byte(f, v >> 24);
  572. qemu_put_byte(f, v >> 16);
  573. qemu_put_byte(f, v >> 8);
  574. qemu_put_byte(f, v);
  575. }
  576. void qemu_put_be64(QEMUFile *f, uint64_t v)
  577. {
  578. qemu_put_be32(f, v >> 32);
  579. qemu_put_be32(f, v);
  580. }
  581. unsigned int qemu_get_be16(QEMUFile *f)
  582. {
  583. unsigned int v;
  584. v = qemu_get_byte(f) << 8;
  585. v |= qemu_get_byte(f);
  586. return v;
  587. }
  588. unsigned int qemu_get_be32(QEMUFile *f)
  589. {
  590. unsigned int v;
  591. v = qemu_get_byte(f) << 24;
  592. v |= qemu_get_byte(f) << 16;
  593. v |= qemu_get_byte(f) << 8;
  594. v |= qemu_get_byte(f);
  595. return v;
  596. }
  597. uint64_t qemu_get_be64(QEMUFile *f)
  598. {
  599. uint64_t v;
  600. v = (uint64_t)qemu_get_be32(f) << 32;
  601. v |= qemu_get_be32(f);
  602. return v;
  603. }
  604. /* timer */
  605. void qemu_put_timer(QEMUFile *f, QEMUTimer *ts)
  606. {
  607. uint64_t expire_time;
  608. expire_time = qemu_timer_expire_time_ns(ts);
  609. qemu_put_be64(f, expire_time);
  610. }
  611. void qemu_get_timer(QEMUFile *f, QEMUTimer *ts)
  612. {
  613. uint64_t expire_time;
  614. expire_time = qemu_get_be64(f);
  615. if (expire_time != -1) {
  616. qemu_mod_timer_ns(ts, expire_time);
  617. } else {
  618. qemu_del_timer(ts);
  619. }
  620. }
  621. /* bool */
  622. static int get_bool(QEMUFile *f, void *pv, size_t size)
  623. {
  624. bool *v = pv;
  625. *v = qemu_get_byte(f);
  626. return 0;
  627. }
  628. static void put_bool(QEMUFile *f, void *pv, size_t size)
  629. {
  630. bool *v = pv;
  631. qemu_put_byte(f, *v);
  632. }
  633. const VMStateInfo vmstate_info_bool = {
  634. .name = "bool",
  635. .get = get_bool,
  636. .put = put_bool,
  637. };
  638. /* 8 bit int */
  639. static int get_int8(QEMUFile *f, void *pv, size_t size)
  640. {
  641. int8_t *v = pv;
  642. qemu_get_s8s(f, v);
  643. return 0;
  644. }
  645. static void put_int8(QEMUFile *f, void *pv, size_t size)
  646. {
  647. int8_t *v = pv;
  648. qemu_put_s8s(f, v);
  649. }
  650. const VMStateInfo vmstate_info_int8 = {
  651. .name = "int8",
  652. .get = get_int8,
  653. .put = put_int8,
  654. };
  655. /* 16 bit int */
  656. static int get_int16(QEMUFile *f, void *pv, size_t size)
  657. {
  658. int16_t *v = pv;
  659. qemu_get_sbe16s(f, v);
  660. return 0;
  661. }
  662. static void put_int16(QEMUFile *f, void *pv, size_t size)
  663. {
  664. int16_t *v = pv;
  665. qemu_put_sbe16s(f, v);
  666. }
  667. const VMStateInfo vmstate_info_int16 = {
  668. .name = "int16",
  669. .get = get_int16,
  670. .put = put_int16,
  671. };
  672. /* 32 bit int */
  673. static int get_int32(QEMUFile *f, void *pv, size_t size)
  674. {
  675. int32_t *v = pv;
  676. qemu_get_sbe32s(f, v);
  677. return 0;
  678. }
  679. static void put_int32(QEMUFile *f, void *pv, size_t size)
  680. {
  681. int32_t *v = pv;
  682. qemu_put_sbe32s(f, v);
  683. }
  684. const VMStateInfo vmstate_info_int32 = {
  685. .name = "int32",
  686. .get = get_int32,
  687. .put = put_int32,
  688. };
  689. /* 32 bit int. See that the received value is the same than the one
  690. in the field */
  691. static int get_int32_equal(QEMUFile *f, void *pv, size_t size)
  692. {
  693. int32_t *v = pv;
  694. int32_t v2;
  695. qemu_get_sbe32s(f, &v2);
  696. if (*v == v2)
  697. return 0;
  698. return -EINVAL;
  699. }
  700. const VMStateInfo vmstate_info_int32_equal = {
  701. .name = "int32 equal",
  702. .get = get_int32_equal,
  703. .put = put_int32,
  704. };
  705. /* 32 bit int. See that the received value is the less or the same
  706. than the one in the field */
  707. static int get_int32_le(QEMUFile *f, void *pv, size_t size)
  708. {
  709. int32_t *old = pv;
  710. int32_t new;
  711. qemu_get_sbe32s(f, &new);
  712. if (*old <= new)
  713. return 0;
  714. return -EINVAL;
  715. }
  716. const VMStateInfo vmstate_info_int32_le = {
  717. .name = "int32 equal",
  718. .get = get_int32_le,
  719. .put = put_int32,
  720. };
  721. /* 64 bit int */
  722. static int get_int64(QEMUFile *f, void *pv, size_t size)
  723. {
  724. int64_t *v = pv;
  725. qemu_get_sbe64s(f, v);
  726. return 0;
  727. }
  728. static void put_int64(QEMUFile *f, void *pv, size_t size)
  729. {
  730. int64_t *v = pv;
  731. qemu_put_sbe64s(f, v);
  732. }
  733. const VMStateInfo vmstate_info_int64 = {
  734. .name = "int64",
  735. .get = get_int64,
  736. .put = put_int64,
  737. };
  738. /* 8 bit unsigned int */
  739. static int get_uint8(QEMUFile *f, void *pv, size_t size)
  740. {
  741. uint8_t *v = pv;
  742. qemu_get_8s(f, v);
  743. return 0;
  744. }
  745. static void put_uint8(QEMUFile *f, void *pv, size_t size)
  746. {
  747. uint8_t *v = pv;
  748. qemu_put_8s(f, v);
  749. }
  750. const VMStateInfo vmstate_info_uint8 = {
  751. .name = "uint8",
  752. .get = get_uint8,
  753. .put = put_uint8,
  754. };
  755. /* 16 bit unsigned int */
  756. static int get_uint16(QEMUFile *f, void *pv, size_t size)
  757. {
  758. uint16_t *v = pv;
  759. qemu_get_be16s(f, v);
  760. return 0;
  761. }
  762. static void put_uint16(QEMUFile *f, void *pv, size_t size)
  763. {
  764. uint16_t *v = pv;
  765. qemu_put_be16s(f, v);
  766. }
  767. const VMStateInfo vmstate_info_uint16 = {
  768. .name = "uint16",
  769. .get = get_uint16,
  770. .put = put_uint16,
  771. };
  772. /* 32 bit unsigned int */
  773. static int get_uint32(QEMUFile *f, void *pv, size_t size)
  774. {
  775. uint32_t *v = pv;
  776. qemu_get_be32s(f, v);
  777. return 0;
  778. }
  779. static void put_uint32(QEMUFile *f, void *pv, size_t size)
  780. {
  781. uint32_t *v = pv;
  782. qemu_put_be32s(f, v);
  783. }
  784. const VMStateInfo vmstate_info_uint32 = {
  785. .name = "uint32",
  786. .get = get_uint32,
  787. .put = put_uint32,
  788. };
  789. /* 32 bit uint. See that the received value is the same than the one
  790. in the field */
  791. static int get_uint32_equal(QEMUFile *f, void *pv, size_t size)
  792. {
  793. uint32_t *v = pv;
  794. uint32_t v2;
  795. qemu_get_be32s(f, &v2);
  796. if (*v == v2) {
  797. return 0;
  798. }
  799. return -EINVAL;
  800. }
  801. const VMStateInfo vmstate_info_uint32_equal = {
  802. .name = "uint32 equal",
  803. .get = get_uint32_equal,
  804. .put = put_uint32,
  805. };
  806. /* 64 bit unsigned int */
  807. static int get_uint64(QEMUFile *f, void *pv, size_t size)
  808. {
  809. uint64_t *v = pv;
  810. qemu_get_be64s(f, v);
  811. return 0;
  812. }
  813. static void put_uint64(QEMUFile *f, void *pv, size_t size)
  814. {
  815. uint64_t *v = pv;
  816. qemu_put_be64s(f, v);
  817. }
  818. const VMStateInfo vmstate_info_uint64 = {
  819. .name = "uint64",
  820. .get = get_uint64,
  821. .put = put_uint64,
  822. };
  823. /* 8 bit int. See that the received value is the same than the one
  824. in the field */
  825. static int get_uint8_equal(QEMUFile *f, void *pv, size_t size)
  826. {
  827. uint8_t *v = pv;
  828. uint8_t v2;
  829. qemu_get_8s(f, &v2);
  830. if (*v == v2)
  831. return 0;
  832. return -EINVAL;
  833. }
  834. const VMStateInfo vmstate_info_uint8_equal = {
  835. .name = "uint8 equal",
  836. .get = get_uint8_equal,
  837. .put = put_uint8,
  838. };
  839. /* 16 bit unsigned int int. See that the received value is the same than the one
  840. in the field */
  841. static int get_uint16_equal(QEMUFile *f, void *pv, size_t size)
  842. {
  843. uint16_t *v = pv;
  844. uint16_t v2;
  845. qemu_get_be16s(f, &v2);
  846. if (*v == v2)
  847. return 0;
  848. return -EINVAL;
  849. }
  850. const VMStateInfo vmstate_info_uint16_equal = {
  851. .name = "uint16 equal",
  852. .get = get_uint16_equal,
  853. .put = put_uint16,
  854. };
  855. /* timers */
  856. static int get_timer(QEMUFile *f, void *pv, size_t size)
  857. {
  858. QEMUTimer *v = pv;
  859. qemu_get_timer(f, v);
  860. return 0;
  861. }
  862. static void put_timer(QEMUFile *f, void *pv, size_t size)
  863. {
  864. QEMUTimer *v = pv;
  865. qemu_put_timer(f, v);
  866. }
  867. const VMStateInfo vmstate_info_timer = {
  868. .name = "timer",
  869. .get = get_timer,
  870. .put = put_timer,
  871. };
  872. /* uint8_t buffers */
  873. static int get_buffer(QEMUFile *f, void *pv, size_t size)
  874. {
  875. uint8_t *v = pv;
  876. qemu_get_buffer(f, v, size);
  877. return 0;
  878. }
  879. static void put_buffer(QEMUFile *f, void *pv, size_t size)
  880. {
  881. uint8_t *v = pv;
  882. qemu_put_buffer(f, v, size);
  883. }
  884. const VMStateInfo vmstate_info_buffer = {
  885. .name = "buffer",
  886. .get = get_buffer,
  887. .put = put_buffer,
  888. };
  889. /* unused buffers: space that was used for some fields that are
  890. not useful anymore */
  891. static int get_unused_buffer(QEMUFile *f, void *pv, size_t size)
  892. {
  893. uint8_t buf[1024];
  894. int block_len;
  895. while (size > 0) {
  896. block_len = MIN(sizeof(buf), size);
  897. size -= block_len;
  898. qemu_get_buffer(f, buf, block_len);
  899. }
  900. return 0;
  901. }
  902. static void put_unused_buffer(QEMUFile *f, void *pv, size_t size)
  903. {
  904. static const uint8_t buf[1024];
  905. int block_len;
  906. while (size > 0) {
  907. block_len = MIN(sizeof(buf), size);
  908. size -= block_len;
  909. qemu_put_buffer(f, buf, block_len);
  910. }
  911. }
  912. const VMStateInfo vmstate_info_unused_buffer = {
  913. .name = "unused_buffer",
  914. .get = get_unused_buffer,
  915. .put = put_unused_buffer,
  916. };
  917. typedef struct CompatEntry {
  918. char idstr[256];
  919. int instance_id;
  920. } CompatEntry;
  921. typedef struct SaveStateEntry {
  922. QTAILQ_ENTRY(SaveStateEntry) entry;
  923. char idstr[256];
  924. int instance_id;
  925. int alias_id;
  926. int version_id;
  927. int section_id;
  928. SaveSetParamsHandler *set_params;
  929. SaveLiveStateHandler *save_live_state;
  930. SaveStateHandler *save_state;
  931. LoadStateHandler *load_state;
  932. const VMStateDescription *vmsd;
  933. void *opaque;
  934. CompatEntry *compat;
  935. int no_migrate;
  936. } SaveStateEntry;
  937. static QTAILQ_HEAD(savevm_handlers, SaveStateEntry) savevm_handlers =
  938. QTAILQ_HEAD_INITIALIZER(savevm_handlers);
  939. static int global_section_id;
  940. static int calculate_new_instance_id(const char *idstr)
  941. {
  942. SaveStateEntry *se;
  943. int instance_id = 0;
  944. QTAILQ_FOREACH(se, &savevm_handlers, entry) {
  945. if (strcmp(idstr, se->idstr) == 0
  946. && instance_id <= se->instance_id) {
  947. instance_id = se->instance_id + 1;
  948. }
  949. }
  950. return instance_id;
  951. }
  952. static int calculate_compat_instance_id(const char *idstr)
  953. {
  954. SaveStateEntry *se;
  955. int instance_id = 0;
  956. QTAILQ_FOREACH(se, &savevm_handlers, entry) {
  957. if (!se->compat)
  958. continue;
  959. if (strcmp(idstr, se->compat->idstr) == 0
  960. && instance_id <= se->compat->instance_id) {
  961. instance_id = se->compat->instance_id + 1;
  962. }
  963. }
  964. return instance_id;
  965. }
  966. /* TODO: Individual devices generally have very little idea about the rest
  967. of the system, so instance_id should be removed/replaced.
  968. Meanwhile pass -1 as instance_id if you do not already have a clearly
  969. distinguishing id for all instances of your device class. */
  970. int register_savevm_live(DeviceState *dev,
  971. const char *idstr,
  972. int instance_id,
  973. int version_id,
  974. SaveSetParamsHandler *set_params,
  975. SaveLiveStateHandler *save_live_state,
  976. SaveStateHandler *save_state,
  977. LoadStateHandler *load_state,
  978. void *opaque)
  979. {
  980. SaveStateEntry *se;
  981. se = g_malloc0(sizeof(SaveStateEntry));
  982. se->version_id = version_id;
  983. se->section_id = global_section_id++;
  984. se->set_params = set_params;
  985. se->save_live_state = save_live_state;
  986. se->save_state = save_state;
  987. se->load_state = load_state;
  988. se->opaque = opaque;
  989. se->vmsd = NULL;
  990. se->no_migrate = 0;
  991. if (dev && dev->parent_bus && dev->parent_bus->info->get_dev_path) {
  992. char *id = dev->parent_bus->info->get_dev_path(dev);
  993. if (id) {
  994. pstrcpy(se->idstr, sizeof(se->idstr), id);
  995. pstrcat(se->idstr, sizeof(se->idstr), "/");
  996. g_free(id);
  997. se->compat = g_malloc0(sizeof(CompatEntry));
  998. pstrcpy(se->compat->idstr, sizeof(se->compat->idstr), idstr);
  999. se->compat->instance_id = instance_id == -1 ?
  1000. calculate_compat_instance_id(idstr) : instance_id;
  1001. instance_id = -1;
  1002. }
  1003. }
  1004. pstrcat(se->idstr, sizeof(se->idstr), idstr);
  1005. if (instance_id == -1) {
  1006. se->instance_id = calculate_new_instance_id(se->idstr);
  1007. } else {
  1008. se->instance_id = instance_id;
  1009. }
  1010. assert(!se->compat || se->instance_id == 0);
  1011. /* add at the end of list */
  1012. QTAILQ_INSERT_TAIL(&savevm_handlers, se, entry);
  1013. return 0;
  1014. }
  1015. int register_savevm(DeviceState *dev,
  1016. const char *idstr,
  1017. int instance_id,
  1018. int version_id,
  1019. SaveStateHandler *save_state,
  1020. LoadStateHandler *load_state,
  1021. void *opaque)
  1022. {
  1023. return register_savevm_live(dev, idstr, instance_id, version_id,
  1024. NULL, NULL, save_state, load_state, opaque);
  1025. }
  1026. void unregister_savevm(DeviceState *dev, const char *idstr, void *opaque)
  1027. {
  1028. SaveStateEntry *se, *new_se;
  1029. char id[256] = "";
  1030. if (dev && dev->parent_bus && dev->parent_bus->info->get_dev_path) {
  1031. char *path = dev->parent_bus->info->get_dev_path(dev);
  1032. if (path) {
  1033. pstrcpy(id, sizeof(id), path);
  1034. pstrcat(id, sizeof(id), "/");
  1035. g_free(path);
  1036. }
  1037. }
  1038. pstrcat(id, sizeof(id), idstr);
  1039. QTAILQ_FOREACH_SAFE(se, &savevm_handlers, entry, new_se) {
  1040. if (strcmp(se->idstr, id) == 0 && se->opaque == opaque) {
  1041. QTAILQ_REMOVE(&savevm_handlers, se, entry);
  1042. if (se->compat) {
  1043. g_free(se->compat);
  1044. }
  1045. g_free(se);
  1046. }
  1047. }
  1048. }
  1049. int vmstate_register_with_alias_id(DeviceState *dev, int instance_id,
  1050. const VMStateDescription *vmsd,
  1051. void *opaque, int alias_id,
  1052. int required_for_version)
  1053. {
  1054. SaveStateEntry *se;
  1055. /* If this triggers, alias support can be dropped for the vmsd. */
  1056. assert(alias_id == -1 || required_for_version >= vmsd->minimum_version_id);
  1057. se = g_malloc0(sizeof(SaveStateEntry));
  1058. se->version_id = vmsd->version_id;
  1059. se->section_id = global_section_id++;
  1060. se->save_live_state = NULL;
  1061. se->save_state = NULL;
  1062. se->load_state = NULL;
  1063. se->opaque = opaque;
  1064. se->vmsd = vmsd;
  1065. se->alias_id = alias_id;
  1066. se->no_migrate = vmsd->unmigratable;
  1067. if (dev && dev->parent_bus && dev->parent_bus->info->get_dev_path) {
  1068. char *id = dev->parent_bus->info->get_dev_path(dev);
  1069. if (id) {
  1070. pstrcpy(se->idstr, sizeof(se->idstr), id);
  1071. pstrcat(se->idstr, sizeof(se->idstr), "/");
  1072. g_free(id);
  1073. se->compat = g_malloc0(sizeof(CompatEntry));
  1074. pstrcpy(se->compat->idstr, sizeof(se->compat->idstr), vmsd->name);
  1075. se->compat->instance_id = instance_id == -1 ?
  1076. calculate_compat_instance_id(vmsd->name) : instance_id;
  1077. instance_id = -1;
  1078. }
  1079. }
  1080. pstrcat(se->idstr, sizeof(se->idstr), vmsd->name);
  1081. if (instance_id == -1) {
  1082. se->instance_id = calculate_new_instance_id(se->idstr);
  1083. } else {
  1084. se->instance_id = instance_id;
  1085. }
  1086. assert(!se->compat || se->instance_id == 0);
  1087. /* add at the end of list */
  1088. QTAILQ_INSERT_TAIL(&savevm_handlers, se, entry);
  1089. return 0;
  1090. }
  1091. int vmstate_register(DeviceState *dev, int instance_id,
  1092. const VMStateDescription *vmsd, void *opaque)
  1093. {
  1094. return vmstate_register_with_alias_id(dev, instance_id, vmsd,
  1095. opaque, -1, 0);
  1096. }
  1097. void vmstate_unregister(DeviceState *dev, const VMStateDescription *vmsd,
  1098. void *opaque)
  1099. {
  1100. SaveStateEntry *se, *new_se;
  1101. QTAILQ_FOREACH_SAFE(se, &savevm_handlers, entry, new_se) {
  1102. if (se->vmsd == vmsd && se->opaque == opaque) {
  1103. QTAILQ_REMOVE(&savevm_handlers, se, entry);
  1104. if (se->compat) {
  1105. g_free(se->compat);
  1106. }
  1107. g_free(se);
  1108. }
  1109. }
  1110. }
  1111. static void vmstate_subsection_save(QEMUFile *f, const VMStateDescription *vmsd,
  1112. void *opaque);
  1113. static int vmstate_subsection_load(QEMUFile *f, const VMStateDescription *vmsd,
  1114. void *opaque);
  1115. int vmstate_load_state(QEMUFile *f, const VMStateDescription *vmsd,
  1116. void *opaque, int version_id)
  1117. {
  1118. VMStateField *field = vmsd->fields;
  1119. int ret;
  1120. if (version_id > vmsd->version_id) {
  1121. return -EINVAL;
  1122. }
  1123. if (version_id < vmsd->minimum_version_id_old) {
  1124. return -EINVAL;
  1125. }
  1126. if (version_id < vmsd->minimum_version_id) {
  1127. return vmsd->load_state_old(f, opaque, version_id);
  1128. }
  1129. if (vmsd->pre_load) {
  1130. int ret = vmsd->pre_load(opaque);
  1131. if (ret)
  1132. return ret;
  1133. }
  1134. while(field->name) {
  1135. if ((field->field_exists &&
  1136. field->field_exists(opaque, version_id)) ||
  1137. (!field->field_exists &&
  1138. field->version_id <= version_id)) {
  1139. void *base_addr = opaque + field->offset;
  1140. int i, n_elems = 1;
  1141. int size = field->size;
  1142. if (field->flags & VMS_VBUFFER) {
  1143. size = *(int32_t *)(opaque+field->size_offset);
  1144. if (field->flags & VMS_MULTIPLY) {
  1145. size *= field->size;
  1146. }
  1147. }
  1148. if (field->flags & VMS_ARRAY) {
  1149. n_elems = field->num;
  1150. } else if (field->flags & VMS_VARRAY_INT32) {
  1151. n_elems = *(int32_t *)(opaque+field->num_offset);
  1152. } else if (field->flags & VMS_VARRAY_UINT32) {
  1153. n_elems = *(uint32_t *)(opaque+field->num_offset);
  1154. } else if (field->flags & VMS_VARRAY_UINT16) {
  1155. n_elems = *(uint16_t *)(opaque+field->num_offset);
  1156. } else if (field->flags & VMS_VARRAY_UINT8) {
  1157. n_elems = *(uint8_t *)(opaque+field->num_offset);
  1158. }
  1159. if (field->flags & VMS_POINTER) {
  1160. base_addr = *(void **)base_addr + field->start;
  1161. }
  1162. for (i = 0; i < n_elems; i++) {
  1163. void *addr = base_addr + size * i;
  1164. if (field->flags & VMS_ARRAY_OF_POINTER) {
  1165. addr = *(void **)addr;
  1166. }
  1167. if (field->flags & VMS_STRUCT) {
  1168. ret = vmstate_load_state(f, field->vmsd, addr, field->vmsd->version_id);
  1169. } else {
  1170. ret = field->info->get(f, addr, size);
  1171. }
  1172. if (ret < 0) {
  1173. return ret;
  1174. }
  1175. }
  1176. }
  1177. field++;
  1178. }
  1179. ret = vmstate_subsection_load(f, vmsd, opaque);
  1180. if (ret != 0) {
  1181. return ret;
  1182. }
  1183. if (vmsd->post_load) {
  1184. return vmsd->post_load(opaque, version_id);
  1185. }
  1186. return 0;
  1187. }
  1188. void vmstate_save_state(QEMUFile *f, const VMStateDescription *vmsd,
  1189. void *opaque)
  1190. {
  1191. VMStateField *field = vmsd->fields;
  1192. if (vmsd->pre_save) {
  1193. vmsd->pre_save(opaque);
  1194. }
  1195. while(field->name) {
  1196. if (!field->field_exists ||
  1197. field->field_exists(opaque, vmsd->version_id)) {
  1198. void *base_addr = opaque + field->offset;
  1199. int i, n_elems = 1;
  1200. int size = field->size;
  1201. if (field->flags & VMS_VBUFFER) {
  1202. size = *(int32_t *)(opaque+field->size_offset);
  1203. if (field->flags & VMS_MULTIPLY) {
  1204. size *= field->size;
  1205. }
  1206. }
  1207. if (field->flags & VMS_ARRAY) {
  1208. n_elems = field->num;
  1209. } else if (field->flags & VMS_VARRAY_INT32) {
  1210. n_elems = *(int32_t *)(opaque+field->num_offset);
  1211. } else if (field->flags & VMS_VARRAY_UINT16) {
  1212. n_elems = *(uint16_t *)(opaque+field->num_offset);
  1213. } else if (field->flags & VMS_VARRAY_UINT8) {
  1214. n_elems = *(uint8_t *)(opaque+field->num_offset);
  1215. }
  1216. if (field->flags & VMS_POINTER) {
  1217. base_addr = *(void **)base_addr + field->start;
  1218. }
  1219. for (i = 0; i < n_elems; i++) {
  1220. void *addr = base_addr + size * i;
  1221. if (field->flags & VMS_ARRAY_OF_POINTER) {
  1222. addr = *(void **)addr;
  1223. }
  1224. if (field->flags & VMS_STRUCT) {
  1225. vmstate_save_state(f, field->vmsd, addr);
  1226. } else {
  1227. field->info->put(f, addr, size);
  1228. }
  1229. }
  1230. }
  1231. field++;
  1232. }
  1233. vmstate_subsection_save(f, vmsd, opaque);
  1234. }
  1235. static int vmstate_load(QEMUFile *f, SaveStateEntry *se, int version_id)
  1236. {
  1237. if (!se->vmsd) { /* Old style */
  1238. return se->load_state(f, se->opaque, version_id);
  1239. }
  1240. return vmstate_load_state(f, se->vmsd, se->opaque, version_id);
  1241. }
  1242. static void vmstate_save(QEMUFile *f, SaveStateEntry *se)
  1243. {
  1244. if (!se->vmsd) { /* Old style */
  1245. se->save_state(f, se->opaque);
  1246. return;
  1247. }
  1248. vmstate_save_state(f,se->vmsd, se->opaque);
  1249. }
  1250. #define QEMU_VM_FILE_MAGIC 0x5145564d
  1251. #define QEMU_VM_FILE_VERSION_COMPAT 0x00000002
  1252. #define QEMU_VM_FILE_VERSION 0x00000003
  1253. #define QEMU_VM_EOF 0x00
  1254. #define QEMU_VM_SECTION_START 0x01
  1255. #define QEMU_VM_SECTION_PART 0x02
  1256. #define QEMU_VM_SECTION_END 0x03
  1257. #define QEMU_VM_SECTION_FULL 0x04
  1258. #define QEMU_VM_SUBSECTION 0x05
  1259. bool qemu_savevm_state_blocked(Monitor *mon)
  1260. {
  1261. SaveStateEntry *se;
  1262. QTAILQ_FOREACH(se, &savevm_handlers, entry) {
  1263. if (se->no_migrate) {
  1264. monitor_printf(mon, "state blocked by non-migratable device '%s'\n",
  1265. se->idstr);
  1266. return true;
  1267. }
  1268. }
  1269. return false;
  1270. }
  1271. int qemu_savevm_state_begin(Monitor *mon, QEMUFile *f, int blk_enable,
  1272. int shared)
  1273. {
  1274. SaveStateEntry *se;
  1275. int ret;
  1276. QTAILQ_FOREACH(se, &savevm_handlers, entry) {
  1277. if(se->set_params == NULL) {
  1278. continue;
  1279. }
  1280. se->set_params(blk_enable, shared, se->opaque);
  1281. }
  1282. qemu_put_be32(f, QEMU_VM_FILE_MAGIC);
  1283. qemu_put_be32(f, QEMU_VM_FILE_VERSION);
  1284. QTAILQ_FOREACH(se, &savevm_handlers, entry) {
  1285. int len;
  1286. if (se->save_live_state == NULL)
  1287. continue;
  1288. /* Section type */
  1289. qemu_put_byte(f, QEMU_VM_SECTION_START);
  1290. qemu_put_be32(f, se->section_id);
  1291. /* ID string */
  1292. len = strlen(se->idstr);
  1293. qemu_put_byte(f, len);
  1294. qemu_put_buffer(f, (uint8_t *)se->idstr, len);
  1295. qemu_put_be32(f, se->instance_id);
  1296. qemu_put_be32(f, se->version_id);
  1297. ret = se->save_live_state(mon, f, QEMU_VM_SECTION_START, se->opaque);
  1298. if (ret < 0) {
  1299. qemu_savevm_state_cancel(mon, f);
  1300. return ret;
  1301. }
  1302. }
  1303. ret = qemu_file_get_error(f);
  1304. if (ret != 0) {
  1305. qemu_savevm_state_cancel(mon, f);
  1306. }
  1307. return ret;
  1308. }
  1309. /*
  1310. * this funtion has three return values:
  1311. * negative: there was one error, and we have -errno.
  1312. * 0 : We haven't finished, caller have to go again
  1313. * 1 : We have finished, we can go to complete phase
  1314. */
  1315. int qemu_savevm_state_iterate(Monitor *mon, QEMUFile *f)
  1316. {
  1317. SaveStateEntry *se;
  1318. int ret = 1;
  1319. QTAILQ_FOREACH(se, &savevm_handlers, entry) {
  1320. if (se->save_live_state == NULL)
  1321. continue;
  1322. /* Section type */
  1323. qemu_put_byte(f, QEMU_VM_SECTION_PART);
  1324. qemu_put_be32(f, se->section_id);
  1325. ret = se->save_live_state(mon, f, QEMU_VM_SECTION_PART, se->opaque);
  1326. if (ret <= 0) {
  1327. /* Do not proceed to the next vmstate before this one reported
  1328. completion of the current stage. This serializes the migration
  1329. and reduces the probability that a faster changing state is
  1330. synchronized over and over again. */
  1331. break;
  1332. }
  1333. }
  1334. if (ret != 0) {
  1335. return ret;
  1336. }
  1337. ret = qemu_file_get_error(f);
  1338. if (ret != 0) {
  1339. qemu_savevm_state_cancel(mon, f);
  1340. }
  1341. return ret;
  1342. }
  1343. int qemu_savevm_state_complete(Monitor *mon, QEMUFile *f)
  1344. {
  1345. SaveStateEntry *se;
  1346. int ret;
  1347. cpu_synchronize_all_states();
  1348. QTAILQ_FOREACH(se, &savevm_handlers, entry) {
  1349. if (se->save_live_state == NULL)
  1350. continue;
  1351. /* Section type */
  1352. qemu_put_byte(f, QEMU_VM_SECTION_END);
  1353. qemu_put_be32(f, se->section_id);
  1354. ret = se->save_live_state(mon, f, QEMU_VM_SECTION_END, se->opaque);
  1355. if (ret < 0) {
  1356. return ret;
  1357. }
  1358. }
  1359. QTAILQ_FOREACH(se, &savevm_handlers, entry) {
  1360. int len;
  1361. if (se->save_state == NULL && se->vmsd == NULL)
  1362. continue;
  1363. /* Section type */
  1364. qemu_put_byte(f, QEMU_VM_SECTION_FULL);
  1365. qemu_put_be32(f, se->section_id);
  1366. /* ID string */
  1367. len = strlen(se->idstr);
  1368. qemu_put_byte(f, len);
  1369. qemu_put_buffer(f, (uint8_t *)se->idstr, len);
  1370. qemu_put_be32(f, se->instance_id);
  1371. qemu_put_be32(f, se->version_id);
  1372. vmstate_save(f, se);
  1373. }
  1374. qemu_put_byte(f, QEMU_VM_EOF);
  1375. return qemu_file_get_error(f);
  1376. }
  1377. void qemu_savevm_state_cancel(Monitor *mon, QEMUFile *f)
  1378. {
  1379. SaveStateEntry *se;
  1380. QTAILQ_FOREACH(se, &savevm_handlers, entry) {
  1381. if (se->save_live_state) {
  1382. se->save_live_state(mon, f, -1, se->opaque);
  1383. }
  1384. }
  1385. }
  1386. static int qemu_savevm_state(Monitor *mon, QEMUFile *f)
  1387. {
  1388. int ret;
  1389. if (qemu_savevm_state_blocked(mon)) {
  1390. ret = -EINVAL;
  1391. goto out;
  1392. }
  1393. ret = qemu_savevm_state_begin(mon, f, 0, 0);
  1394. if (ret < 0)
  1395. goto out;
  1396. do {
  1397. ret = qemu_savevm_state_iterate(mon, f);
  1398. if (ret < 0)
  1399. goto out;
  1400. } while (ret == 0);
  1401. ret = qemu_savevm_state_complete(mon, f);
  1402. out:
  1403. if (ret == 0) {
  1404. ret = qemu_file_get_error(f);
  1405. }
  1406. return ret;
  1407. }
  1408. static SaveStateEntry *find_se(const char *idstr, int instance_id)
  1409. {
  1410. SaveStateEntry *se;
  1411. QTAILQ_FOREACH(se, &savevm_handlers, entry) {
  1412. if (!strcmp(se->idstr, idstr) &&
  1413. (instance_id == se->instance_id ||
  1414. instance_id == se->alias_id))
  1415. return se;
  1416. /* Migrating from an older version? */
  1417. if (strstr(se->idstr, idstr) && se->compat) {
  1418. if (!strcmp(se->compat->idstr, idstr) &&
  1419. (instance_id == se->compat->instance_id ||
  1420. instance_id == se->alias_id))
  1421. return se;
  1422. }
  1423. }
  1424. return NULL;
  1425. }
  1426. static const VMStateDescription *vmstate_get_subsection(const VMStateSubsection *sub, char *idstr)
  1427. {
  1428. while(sub && sub->needed) {
  1429. if (strcmp(idstr, sub->vmsd->name) == 0) {
  1430. return sub->vmsd;
  1431. }
  1432. sub++;
  1433. }
  1434. return NULL;
  1435. }
  1436. static int vmstate_subsection_load(QEMUFile *f, const VMStateDescription *vmsd,
  1437. void *opaque)
  1438. {
  1439. while (qemu_peek_byte(f, 0) == QEMU_VM_SUBSECTION) {
  1440. char idstr[256];
  1441. int ret;
  1442. uint8_t version_id, len, size;
  1443. const VMStateDescription *sub_vmsd;
  1444. len = qemu_peek_byte(f, 1);
  1445. if (len < strlen(vmsd->name) + 1) {
  1446. /* subsection name has be be "section_name/a" */
  1447. return 0;
  1448. }
  1449. size = qemu_peek_buffer(f, (uint8_t *)idstr, len, 2);
  1450. if (size != len) {
  1451. return 0;
  1452. }
  1453. idstr[size] = 0;
  1454. if (strncmp(vmsd->name, idstr, strlen(vmsd->name)) != 0) {
  1455. /* it don't have a valid subsection name */
  1456. return 0;
  1457. }
  1458. sub_vmsd = vmstate_get_subsection(vmsd->subsections, idstr);
  1459. if (sub_vmsd == NULL) {
  1460. return -ENOENT;
  1461. }
  1462. qemu_file_skip(f, 1); /* subsection */
  1463. qemu_file_skip(f, 1); /* len */
  1464. qemu_file_skip(f, len); /* idstr */
  1465. version_id = qemu_get_be32(f);
  1466. ret = vmstate_load_state(f, sub_vmsd, opaque, version_id);
  1467. if (ret) {
  1468. return ret;
  1469. }
  1470. }
  1471. return 0;
  1472. }
  1473. static void vmstate_subsection_save(QEMUFile *f, const VMStateDescription *vmsd,
  1474. void *opaque)
  1475. {
  1476. const VMStateSubsection *sub = vmsd->subsections;
  1477. while (sub && sub->needed) {
  1478. if (sub->needed(opaque)) {
  1479. const VMStateDescription *vmsd = sub->vmsd;
  1480. uint8_t len;
  1481. qemu_put_byte(f, QEMU_VM_SUBSECTION);
  1482. len = strlen(vmsd->name);
  1483. qemu_put_byte(f, len);
  1484. qemu_put_buffer(f, (uint8_t *)vmsd->name, len);
  1485. qemu_put_be32(f, vmsd->version_id);
  1486. vmstate_save_state(f, vmsd, opaque);
  1487. }
  1488. sub++;
  1489. }
  1490. }
  1491. typedef struct LoadStateEntry {
  1492. QLIST_ENTRY(LoadStateEntry) entry;
  1493. SaveStateEntry *se;
  1494. int section_id;
  1495. int version_id;
  1496. } LoadStateEntry;
  1497. int qemu_loadvm_state(QEMUFile *f)
  1498. {
  1499. QLIST_HEAD(, LoadStateEntry) loadvm_handlers =
  1500. QLIST_HEAD_INITIALIZER(loadvm_handlers);
  1501. LoadStateEntry *le, *new_le;
  1502. uint8_t section_type;
  1503. unsigned int v;
  1504. int ret;
  1505. if (qemu_savevm_state_blocked(default_mon)) {
  1506. return -EINVAL;
  1507. }
  1508. v = qemu_get_be32(f);
  1509. if (v != QEMU_VM_FILE_MAGIC)
  1510. return -EINVAL;
  1511. v = qemu_get_be32(f);
  1512. if (v == QEMU_VM_FILE_VERSION_COMPAT) {
  1513. fprintf(stderr, "SaveVM v2 format is obsolete and don't work anymore\n");
  1514. return -ENOTSUP;
  1515. }
  1516. if (v != QEMU_VM_FILE_VERSION)
  1517. return -ENOTSUP;
  1518. while ((section_type = qemu_get_byte(f)) != QEMU_VM_EOF) {
  1519. uint32_t instance_id, version_id, section_id;
  1520. SaveStateEntry *se;
  1521. char idstr[257];
  1522. int len;
  1523. switch (section_type) {
  1524. case QEMU_VM_SECTION_START:
  1525. case QEMU_VM_SECTION_FULL:
  1526. /* Read section start */
  1527. section_id = qemu_get_be32(f);
  1528. len = qemu_get_byte(f);
  1529. qemu_get_buffer(f, (uint8_t *)idstr, len);
  1530. idstr[len] = 0;
  1531. instance_id = qemu_get_be32(f);
  1532. version_id = qemu_get_be32(f);
  1533. /* Find savevm section */
  1534. se = find_se(idstr, instance_id);
  1535. if (se == NULL) {
  1536. fprintf(stderr, "Unknown savevm section or instance '%s' %d\n", idstr, instance_id);
  1537. ret = -EINVAL;
  1538. goto out;
  1539. }
  1540. /* Validate version */
  1541. if (version_id > se->version_id) {
  1542. fprintf(stderr, "savevm: unsupported version %d for '%s' v%d\n",
  1543. version_id, idstr, se->version_id);
  1544. ret = -EINVAL;
  1545. goto out;
  1546. }
  1547. /* Add entry */
  1548. le = g_malloc0(sizeof(*le));
  1549. le->se = se;
  1550. le->section_id = section_id;
  1551. le->version_id = version_id;
  1552. QLIST_INSERT_HEAD(&loadvm_handlers, le, entry);
  1553. ret = vmstate_load(f, le->se, le->version_id);
  1554. if (ret < 0) {
  1555. fprintf(stderr, "qemu: warning: error while loading state for instance 0x%x of device '%s'\n",
  1556. instance_id, idstr);
  1557. goto out;
  1558. }
  1559. break;
  1560. case QEMU_VM_SECTION_PART:
  1561. case QEMU_VM_SECTION_END:
  1562. section_id = qemu_get_be32(f);
  1563. QLIST_FOREACH(le, &loadvm_handlers, entry) {
  1564. if (le->section_id == section_id) {
  1565. break;
  1566. }
  1567. }
  1568. if (le == NULL) {
  1569. fprintf(stderr, "Unknown savevm section %d\n", section_id);
  1570. ret = -EINVAL;
  1571. goto out;
  1572. }
  1573. ret = vmstate_load(f, le->se, le->version_id);
  1574. if (ret < 0) {
  1575. fprintf(stderr, "qemu: warning: error while loading state section id %d\n",
  1576. section_id);
  1577. goto out;
  1578. }
  1579. break;
  1580. default:
  1581. fprintf(stderr, "Unknown savevm section type %d\n", section_type);
  1582. ret = -EINVAL;
  1583. goto out;
  1584. }
  1585. }
  1586. cpu_synchronize_all_post_init();
  1587. ret = 0;
  1588. out:
  1589. QLIST_FOREACH_SAFE(le, &loadvm_handlers, entry, new_le) {
  1590. QLIST_REMOVE(le, entry);
  1591. g_free(le);
  1592. }
  1593. if (ret == 0) {
  1594. ret = qemu_file_get_error(f);
  1595. }
  1596. return ret;
  1597. }
  1598. static int bdrv_snapshot_find(BlockDriverState *bs, QEMUSnapshotInfo *sn_info,
  1599. const char *name)
  1600. {
  1601. QEMUSnapshotInfo *sn_tab, *sn;
  1602. int nb_sns, i, ret;
  1603. ret = -ENOENT;
  1604. nb_sns = bdrv_snapshot_list(bs, &sn_tab);
  1605. if (nb_sns < 0)
  1606. return ret;
  1607. for(i = 0; i < nb_sns; i++) {
  1608. sn = &sn_tab[i];
  1609. if (!strcmp(sn->id_str, name) || !strcmp(sn->name, name)) {
  1610. *sn_info = *sn;
  1611. ret = 0;
  1612. break;
  1613. }
  1614. }
  1615. g_free(sn_tab);
  1616. return ret;
  1617. }
  1618. /*
  1619. * Deletes snapshots of a given name in all opened images.
  1620. */
  1621. static int del_existing_snapshots(Monitor *mon, const char *name)
  1622. {
  1623. BlockDriverState *bs;
  1624. QEMUSnapshotInfo sn1, *snapshot = &sn1;
  1625. int ret;
  1626. bs = NULL;
  1627. while ((bs = bdrv_next(bs))) {
  1628. if (bdrv_can_snapshot(bs) &&
  1629. bdrv_snapshot_find(bs, snapshot, name) >= 0)
  1630. {
  1631. ret = bdrv_snapshot_delete(bs, name);
  1632. if (ret < 0) {
  1633. monitor_printf(mon,
  1634. "Error while deleting snapshot on '%s'\n",
  1635. bdrv_get_device_name(bs));
  1636. return -1;
  1637. }
  1638. }
  1639. }
  1640. return 0;
  1641. }
  1642. void do_savevm(Monitor *mon, const QDict *qdict)
  1643. {
  1644. BlockDriverState *bs, *bs1;
  1645. QEMUSnapshotInfo sn1, *sn = &sn1, old_sn1, *old_sn = &old_sn1;
  1646. int ret;
  1647. QEMUFile *f;
  1648. int saved_vm_running;
  1649. uint32_t vm_state_size;
  1650. #ifdef _WIN32
  1651. struct _timeb tb;
  1652. struct tm *ptm;
  1653. #else
  1654. struct timeval tv;
  1655. struct tm tm;
  1656. #endif
  1657. const char *name = qdict_get_try_str(qdict, "name");
  1658. /* Verify if there is a device that doesn't support snapshots and is writable */
  1659. bs = NULL;
  1660. while ((bs = bdrv_next(bs))) {
  1661. if (!bdrv_is_inserted(bs) || bdrv_is_read_only(bs)) {
  1662. continue;
  1663. }
  1664. if (!bdrv_can_snapshot(bs)) {
  1665. monitor_printf(mon, "Device '%s' is writable but does not support snapshots.\n",
  1666. bdrv_get_device_name(bs));
  1667. return;
  1668. }
  1669. }
  1670. bs = bdrv_snapshots();
  1671. if (!bs) {
  1672. monitor_printf(mon, "No block device can accept snapshots\n");
  1673. return;
  1674. }
  1675. saved_vm_running = runstate_is_running();
  1676. vm_stop(RUN_STATE_SAVE_VM);
  1677. memset(sn, 0, sizeof(*sn));
  1678. /* fill auxiliary fields */
  1679. #ifdef _WIN32
  1680. _ftime(&tb);
  1681. sn->date_sec = tb.time;
  1682. sn->date_nsec = tb.millitm * 1000000;
  1683. #else
  1684. gettimeofday(&tv, NULL);
  1685. sn->date_sec = tv.tv_sec;
  1686. sn->date_nsec = tv.tv_usec * 1000;
  1687. #endif
  1688. sn->vm_clock_nsec = qemu_get_clock_ns(vm_clock);
  1689. if (name) {
  1690. ret = bdrv_snapshot_find(bs, old_sn, name);
  1691. if (ret >= 0) {
  1692. pstrcpy(sn->name, sizeof(sn->name), old_sn->name);
  1693. pstrcpy(sn->id_str, sizeof(sn->id_str), old_sn->id_str);
  1694. } else {
  1695. pstrcpy(sn->name, sizeof(sn->name), name);
  1696. }
  1697. } else {
  1698. #ifdef _WIN32
  1699. ptm = localtime(&tb.time);
  1700. strftime(sn->name, sizeof(sn->name), "vm-%Y%m%d%H%M%S", ptm);
  1701. #else
  1702. /* cast below needed for OpenBSD where tv_sec is still 'long' */
  1703. localtime_r((const time_t *)&tv.tv_sec, &tm);
  1704. strftime(sn->name, sizeof(sn->name), "vm-%Y%m%d%H%M%S", &tm);
  1705. #endif
  1706. }
  1707. /* Delete old snapshots of the same name */
  1708. if (name && del_existing_snapshots(mon, name) < 0) {
  1709. goto the_end;
  1710. }
  1711. /* save the VM state */
  1712. f = qemu_fopen_bdrv(bs, 1);
  1713. if (!f) {
  1714. monitor_printf(mon, "Could not open VM state file\n");
  1715. goto the_end;
  1716. }
  1717. ret = qemu_savevm_state(mon, f);
  1718. vm_state_size = qemu_ftell(f);
  1719. qemu_fclose(f);
  1720. if (ret < 0) {
  1721. monitor_printf(mon, "Error %d while writing VM\n", ret);
  1722. goto the_end;
  1723. }
  1724. /* create the snapshots */
  1725. bs1 = NULL;
  1726. while ((bs1 = bdrv_next(bs1))) {
  1727. if (bdrv_can_snapshot(bs1)) {
  1728. /* Write VM state size only to the image that contains the state */
  1729. sn->vm_state_size = (bs == bs1 ? vm_state_size : 0);
  1730. ret = bdrv_snapshot_create(bs1, sn);
  1731. if (ret < 0) {
  1732. monitor_printf(mon, "Error while creating snapshot on '%s'\n",
  1733. bdrv_get_device_name(bs1));
  1734. }
  1735. }
  1736. }
  1737. the_end:
  1738. if (saved_vm_running)
  1739. vm_start();
  1740. }
  1741. int load_vmstate(const char *name)
  1742. {
  1743. BlockDriverState *bs, *bs_vm_state;
  1744. QEMUSnapshotInfo sn;
  1745. QEMUFile *f;
  1746. int ret;
  1747. bs_vm_state = bdrv_snapshots();
  1748. if (!bs_vm_state) {
  1749. error_report("No block device supports snapshots");
  1750. return -ENOTSUP;
  1751. }
  1752. /* Don't even try to load empty VM states */
  1753. ret = bdrv_snapshot_find(bs_vm_state, &sn, name);
  1754. if (ret < 0) {
  1755. return ret;
  1756. } else if (sn.vm_state_size == 0) {
  1757. error_report("This is a disk-only snapshot. Revert to it offline "
  1758. "using qemu-img.");
  1759. return -EINVAL;
  1760. }
  1761. /* Verify if there is any device that doesn't support snapshots and is
  1762. writable and check if the requested snapshot is available too. */
  1763. bs = NULL;
  1764. while ((bs = bdrv_next(bs))) {
  1765. if (!bdrv_is_inserted(bs) || bdrv_is_read_only(bs)) {
  1766. continue;
  1767. }
  1768. if (!bdrv_can_snapshot(bs)) {
  1769. error_report("Device '%s' is writable but does not support snapshots.",
  1770. bdrv_get_device_name(bs));
  1771. return -ENOTSUP;
  1772. }
  1773. ret = bdrv_snapshot_find(bs, &sn, name);
  1774. if (ret < 0) {
  1775. error_report("Device '%s' does not have the requested snapshot '%s'",
  1776. bdrv_get_device_name(bs), name);
  1777. return ret;
  1778. }
  1779. }
  1780. /* Flush all IO requests so they don't interfere with the new state. */
  1781. qemu_aio_flush();
  1782. bs = NULL;
  1783. while ((bs = bdrv_next(bs))) {
  1784. if (bdrv_can_snapshot(bs)) {
  1785. ret = bdrv_snapshot_goto(bs, name);
  1786. if (ret < 0) {
  1787. error_report("Error %d while activating snapshot '%s' on '%s'",
  1788. ret, name, bdrv_get_device_name(bs));
  1789. return ret;
  1790. }
  1791. }
  1792. }
  1793. /* restore the VM state */
  1794. f = qemu_fopen_bdrv(bs_vm_state, 0);
  1795. if (!f) {
  1796. error_report("Could not open VM state file");
  1797. return -EINVAL;
  1798. }
  1799. qemu_system_reset(VMRESET_SILENT);
  1800. ret = qemu_loadvm_state(f);
  1801. qemu_fclose(f);
  1802. if (ret < 0) {
  1803. error_report("Error %d while loading VM state", ret);
  1804. return ret;
  1805. }
  1806. return 0;
  1807. }
  1808. void do_delvm(Monitor *mon, const QDict *qdict)
  1809. {
  1810. BlockDriverState *bs, *bs1;
  1811. int ret;
  1812. const char *name = qdict_get_str(qdict, "name");
  1813. bs = bdrv_snapshots();
  1814. if (!bs) {
  1815. monitor_printf(mon, "No block device supports snapshots\n");
  1816. return;
  1817. }
  1818. bs1 = NULL;
  1819. while ((bs1 = bdrv_next(bs1))) {
  1820. if (bdrv_can_snapshot(bs1)) {
  1821. ret = bdrv_snapshot_delete(bs1, name);
  1822. if (ret < 0) {
  1823. if (ret == -ENOTSUP)
  1824. monitor_printf(mon,
  1825. "Snapshots not supported on device '%s'\n",
  1826. bdrv_get_device_name(bs1));
  1827. else
  1828. monitor_printf(mon, "Error %d while deleting snapshot on "
  1829. "'%s'\n", ret, bdrv_get_device_name(bs1));
  1830. }
  1831. }
  1832. }
  1833. }
  1834. void do_info_snapshots(Monitor *mon)
  1835. {
  1836. BlockDriverState *bs, *bs1;
  1837. QEMUSnapshotInfo *sn_tab, *sn, s, *sn_info = &s;
  1838. int nb_sns, i, ret, available;
  1839. int total;
  1840. int *available_snapshots;
  1841. char buf[256];
  1842. bs = bdrv_snapshots();
  1843. if (!bs) {
  1844. monitor_printf(mon, "No available block device supports snapshots\n");
  1845. return;
  1846. }
  1847. nb_sns = bdrv_snapshot_list(bs, &sn_tab);
  1848. if (nb_sns < 0) {
  1849. monitor_printf(mon, "bdrv_snapshot_list: error %d\n", nb_sns);
  1850. return;
  1851. }
  1852. if (nb_sns == 0) {
  1853. monitor_printf(mon, "There is no snapshot available.\n");
  1854. return;
  1855. }
  1856. available_snapshots = g_malloc0(sizeof(int) * nb_sns);
  1857. total = 0;
  1858. for (i = 0; i < nb_sns; i++) {
  1859. sn = &sn_tab[i];
  1860. available = 1;
  1861. bs1 = NULL;
  1862. while ((bs1 = bdrv_next(bs1))) {
  1863. if (bdrv_can_snapshot(bs1) && bs1 != bs) {
  1864. ret = bdrv_snapshot_find(bs1, sn_info, sn->id_str);
  1865. if (ret < 0) {
  1866. available = 0;
  1867. break;
  1868. }
  1869. }
  1870. }
  1871. if (available) {
  1872. available_snapshots[total] = i;
  1873. total++;
  1874. }
  1875. }
  1876. if (total > 0) {
  1877. monitor_printf(mon, "%s\n", bdrv_snapshot_dump(buf, sizeof(buf), NULL));
  1878. for (i = 0; i < total; i++) {
  1879. sn = &sn_tab[available_snapshots[i]];
  1880. monitor_printf(mon, "%s\n", bdrv_snapshot_dump(buf, sizeof(buf), sn));
  1881. }
  1882. } else {
  1883. monitor_printf(mon, "There is no suitable snapshot available\n");
  1884. }
  1885. g_free(sn_tab);
  1886. g_free(available_snapshots);
  1887. }