1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26#include "qemu/osdep.h"
27
28#include "qapi/error.h"
29#include "qemu/error-report.h"
30#include "qapi/qmp/qbool.h"
31#include "qapi/qmp/qdict.h"
32#include "qapi/qmp/qnum.h"
33#include "qapi/qmp/qstring.h"
34#include "qapi/qmp/qerror.h"
35#include "qemu/option_int.h"
36#include "qemu/cutils.h"
37#include "qemu/id.h"
38#include "qemu/help_option.h"
39
40
41
42
43
44
45
46
47
48
49
50static const char *get_opt_name(const char *p, char **option, size_t len)
51{
52 *option = g_strndup(p, len);
53 return p + len;
54}
55
56
57
58
59
60
61
62
63
64const char *get_opt_value(const char *p, char **value)
65{
66 size_t capacity = 0, length;
67 const char *offset;
68
69 *value = NULL;
70 while (1) {
71 offset = qemu_strchrnul(p, ',');
72 length = offset - p;
73 if (*offset != '\0' && *(offset + 1) == ',') {
74 length++;
75 }
76 *value = g_renew(char, *value, capacity + length + 1);
77 strncpy(*value + capacity, p, length);
78 (*value)[capacity + length] = '\0';
79 capacity += length;
80 if (*offset == '\0' ||
81 *(offset + 1) != ',') {
82 break;
83 }
84
85 p += (offset - p) + 2;
86 }
87
88 return offset;
89}
90
91static bool parse_option_number(const char *name, const char *value,
92 uint64_t *ret, Error **errp)
93{
94 uint64_t number;
95 int err;
96
97 err = qemu_strtou64(value, NULL, 0, &number);
98 if (err == -ERANGE) {
99 error_setg(errp, "Value '%s' is too large for parameter '%s'",
100 value, name);
101 return false;
102 }
103 if (err) {
104 error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name, "a number");
105 return false;
106 }
107 *ret = number;
108 return true;
109}
110
111static const QemuOptDesc *find_desc_by_name(const QemuOptDesc *desc,
112 const char *name)
113{
114 int i;
115
116 for (i = 0; desc[i].name != NULL; i++) {
117 if (strcmp(desc[i].name, name) == 0) {
118 return &desc[i];
119 }
120 }
121
122 return NULL;
123}
124
125static const char *find_default_by_name(QemuOpts *opts, const char *name)
126{
127 const QemuOptDesc *desc = find_desc_by_name(opts->list->desc, name);
128
129 return desc ? desc->def_value_str : NULL;
130}
131
132bool parse_option_size(const char *name, const char *value,
133 uint64_t *ret, Error **errp)
134{
135 uint64_t size;
136 int err;
137
138 err = qemu_strtosz(value, NULL, &size);
139 if (err == -ERANGE) {
140 error_setg(errp, "Value '%s' is out of range for parameter '%s'",
141 value, name);
142 return false;
143 }
144 if (err) {
145 error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name,
146 "a non-negative number below 2^64");
147 error_append_hint(errp, "Optional suffix k, M, G, T, P or E means"
148 " kilo-, mega-, giga-, tera-, peta-\n"
149 "and exabytes, respectively.\n");
150 return false;
151 }
152 *ret = size;
153 return true;
154}
155
156static const char *opt_type_to_string(enum QemuOptType type)
157{
158 switch (type) {
159 case QEMU_OPT_STRING:
160 return "str";
161 case QEMU_OPT_BOOL:
162 return "bool (on/off)";
163 case QEMU_OPT_NUMBER:
164 return "num";
165 case QEMU_OPT_SIZE:
166 return "size";
167 }
168
169 g_assert_not_reached();
170}
171
172
173
174
175
176
177
178
179void qemu_opts_print_help(QemuOptsList *list, bool print_caption)
180{
181 QemuOptDesc *desc;
182 int i;
183 GPtrArray *array = g_ptr_array_new();
184
185 assert(list);
186 desc = list->desc;
187 while (desc && desc->name) {
188 GString *str = g_string_new(NULL);
189 g_string_append_printf(str, " %s=<%s>", desc->name,
190 opt_type_to_string(desc->type));
191 if (desc->help) {
192 if (str->len < 24) {
193 g_string_append_printf(str, "%*s", 24 - (int)str->len, "");
194 }
195 g_string_append_printf(str, " - %s", desc->help);
196 }
197 g_ptr_array_add(array, g_string_free(str, false));
198 desc++;
199 }
200
201 g_ptr_array_sort(array, (GCompareFunc)qemu_pstrcmp0);
202 if (print_caption && array->len > 0) {
203 if (list->name) {
204 printf("%s options:\n", list->name);
205 } else {
206 printf("Options:\n");
207 }
208 } else if (array->len == 0) {
209 if (list->name) {
210 printf("There are no options for %s.\n", list->name);
211 } else {
212 printf("No options available.\n");
213 }
214 }
215 for (i = 0; i < array->len; i++) {
216 printf("%s\n", (char *)array->pdata[i]);
217 }
218 g_ptr_array_set_free_func(array, g_free);
219 g_ptr_array_free(array, true);
220
221}
222
223
224QemuOpt *qemu_opt_find(QemuOpts *opts, const char *name)
225{
226 QemuOpt *opt;
227
228 QTAILQ_FOREACH_REVERSE(opt, &opts->head, next) {
229 if (strcmp(opt->name, name) != 0)
230 continue;
231 return opt;
232 }
233 return NULL;
234}
235
236static void qemu_opt_del(QemuOpt *opt)
237{
238 QTAILQ_REMOVE(&opt->opts->head, opt, next);
239 g_free(opt->name);
240 g_free(opt->str);
241 g_free(opt);
242}
243
244
245
246
247static void qemu_opt_del_all(QemuOpts *opts, const char *name)
248{
249 QemuOpt *opt, *next_opt;
250
251 QTAILQ_FOREACH_SAFE(opt, &opts->head, next, next_opt) {
252 if (!strcmp(opt->name, name)) {
253 qemu_opt_del(opt);
254 }
255 }
256}
257
258const char *qemu_opt_get(QemuOpts *opts, const char *name)
259{
260 QemuOpt *opt;
261
262 if (opts == NULL) {
263 return NULL;
264 }
265
266 opt = qemu_opt_find(opts, name);
267 if (!opt) {
268 return find_default_by_name(opts, name);
269 }
270
271 return opt->str;
272}
273
274void qemu_opt_iter_init(QemuOptsIter *iter, QemuOpts *opts, const char *name)
275{
276 iter->opts = opts;
277 iter->opt = QTAILQ_FIRST(&opts->head);
278 iter->name = name;
279}
280
281const char *qemu_opt_iter_next(QemuOptsIter *iter)
282{
283 QemuOpt *ret = iter->opt;
284 if (iter->name) {
285 while (ret && !g_str_equal(iter->name, ret->name)) {
286 ret = QTAILQ_NEXT(ret, next);
287 }
288 }
289 iter->opt = ret ? QTAILQ_NEXT(ret, next) : NULL;
290 return ret ? ret->str : NULL;
291}
292
293
294
295
296
297char *qemu_opt_get_del(QemuOpts *opts, const char *name)
298{
299 QemuOpt *opt;
300 char *str;
301
302 if (opts == NULL) {
303 return NULL;
304 }
305
306 opt = qemu_opt_find(opts, name);
307 if (!opt) {
308 return g_strdup(find_default_by_name(opts, name));
309 }
310 str = opt->str;
311 opt->str = NULL;
312 qemu_opt_del_all(opts, name);
313 return str;
314}
315
316bool qemu_opt_has_help_opt(QemuOpts *opts)
317{
318 QemuOpt *opt;
319
320 QTAILQ_FOREACH_REVERSE(opt, &opts->head, next) {
321 if (is_help_option(opt->name)) {
322 return true;
323 }
324 }
325 return false;
326}
327
328static bool qemu_opt_get_bool_helper(QemuOpts *opts, const char *name,
329 bool defval, bool del)
330{
331 QemuOpt *opt;
332 const char *def_val;
333 bool ret = defval;
334
335 if (opts == NULL) {
336 return ret;
337 }
338
339 opt = qemu_opt_find(opts, name);
340 if (opt == NULL) {
341 def_val = find_default_by_name(opts, name);
342 if (def_val) {
343 qapi_bool_parse(name, def_val, &ret, &error_abort);
344 }
345 return ret;
346 }
347 assert(opt->desc && opt->desc->type == QEMU_OPT_BOOL);
348 ret = opt->value.boolean;
349 if (del) {
350 qemu_opt_del_all(opts, name);
351 }
352 return ret;
353}
354
355bool qemu_opt_get_bool(QemuOpts *opts, const char *name, bool defval)
356{
357 return qemu_opt_get_bool_helper(opts, name, defval, false);
358}
359
360bool qemu_opt_get_bool_del(QemuOpts *opts, const char *name, bool defval)
361{
362 return qemu_opt_get_bool_helper(opts, name, defval, true);
363}
364
365static uint64_t qemu_opt_get_number_helper(QemuOpts *opts, const char *name,
366 uint64_t defval, bool del)
367{
368 QemuOpt *opt;
369 const char *def_val;
370 uint64_t ret = defval;
371
372 if (opts == NULL) {
373 return ret;
374 }
375
376 opt = qemu_opt_find(opts, name);
377 if (opt == NULL) {
378 def_val = find_default_by_name(opts, name);
379 if (def_val) {
380 parse_option_number(name, def_val, &ret, &error_abort);
381 }
382 return ret;
383 }
384 assert(opt->desc && opt->desc->type == QEMU_OPT_NUMBER);
385 ret = opt->value.uint;
386 if (del) {
387 qemu_opt_del_all(opts, name);
388 }
389 return ret;
390}
391
392uint64_t qemu_opt_get_number(QemuOpts *opts, const char *name, uint64_t defval)
393{
394 return qemu_opt_get_number_helper(opts, name, defval, false);
395}
396
397uint64_t qemu_opt_get_number_del(QemuOpts *opts, const char *name,
398 uint64_t defval)
399{
400 return qemu_opt_get_number_helper(opts, name, defval, true);
401}
402
403static uint64_t qemu_opt_get_size_helper(QemuOpts *opts, const char *name,
404 uint64_t defval, bool del)
405{
406 QemuOpt *opt;
407 const char *def_val;
408 uint64_t ret = defval;
409
410 if (opts == NULL) {
411 return ret;
412 }
413
414 opt = qemu_opt_find(opts, name);
415 if (opt == NULL) {
416 def_val = find_default_by_name(opts, name);
417 if (def_val) {
418 parse_option_size(name, def_val, &ret, &error_abort);
419 }
420 return ret;
421 }
422 assert(opt->desc && opt->desc->type == QEMU_OPT_SIZE);
423 ret = opt->value.uint;
424 if (del) {
425 qemu_opt_del_all(opts, name);
426 }
427 return ret;
428}
429
430uint64_t qemu_opt_get_size(QemuOpts *opts, const char *name, uint64_t defval)
431{
432 return qemu_opt_get_size_helper(opts, name, defval, false);
433}
434
435uint64_t qemu_opt_get_size_del(QemuOpts *opts, const char *name,
436 uint64_t defval)
437{
438 return qemu_opt_get_size_helper(opts, name, defval, true);
439}
440
441static bool qemu_opt_parse(QemuOpt *opt, Error **errp)
442{
443 if (opt->desc == NULL)
444 return true;
445
446 switch (opt->desc->type) {
447 case QEMU_OPT_STRING:
448
449 return true;
450 case QEMU_OPT_BOOL:
451 return qapi_bool_parse(opt->name, opt->str, &opt->value.boolean, errp);
452 case QEMU_OPT_NUMBER:
453 return parse_option_number(opt->name, opt->str, &opt->value.uint,
454 errp);
455 case QEMU_OPT_SIZE:
456 return parse_option_size(opt->name, opt->str, &opt->value.uint,
457 errp);
458 default:
459 abort();
460 }
461}
462
463static bool opts_accepts_any(const QemuOptsList *list)
464{
465 return list->desc[0].name == NULL;
466}
467
468int qemu_opt_unset(QemuOpts *opts, const char *name)
469{
470 QemuOpt *opt = qemu_opt_find(opts, name);
471
472 assert(opts_accepts_any(opts->list));
473
474 if (opt == NULL) {
475 return -1;
476 } else {
477 qemu_opt_del(opt);
478 return 0;
479 }
480}
481
482static QemuOpt *opt_create(QemuOpts *opts, const char *name, char *value,
483 bool prepend)
484{
485 QemuOpt *opt = g_malloc0(sizeof(*opt));
486
487 opt->name = g_strdup(name);
488 opt->str = value;
489 opt->opts = opts;
490 if (prepend) {
491 QTAILQ_INSERT_HEAD(&opts->head, opt, next);
492 } else {
493 QTAILQ_INSERT_TAIL(&opts->head, opt, next);
494 }
495
496 return opt;
497}
498
499static bool opt_validate(QemuOpt *opt, Error **errp)
500{
501 const QemuOptDesc *desc;
502 const QemuOptsList *list = opt->opts->list;
503
504 desc = find_desc_by_name(list->desc, opt->name);
505 if (!desc && !opts_accepts_any(list)) {
506 error_setg(errp, QERR_INVALID_PARAMETER, opt->name);
507 return false;
508 }
509
510 opt->desc = desc;
511 if (!qemu_opt_parse(opt, errp)) {
512 return false;
513 }
514
515 return true;
516}
517
518bool qemu_opt_set(QemuOpts *opts, const char *name, const char *value,
519 Error **errp)
520{
521 QemuOpt *opt = opt_create(opts, name, g_strdup(value), false);
522
523 if (!opt_validate(opt, errp)) {
524 qemu_opt_del(opt);
525 return false;
526 }
527 return true;
528}
529
530bool qemu_opt_set_bool(QemuOpts *opts, const char *name, bool val,
531 Error **errp)
532{
533 QemuOpt *opt;
534 const QemuOptDesc *desc;
535 const QemuOptsList *list = opts->list;
536
537 desc = find_desc_by_name(list->desc, name);
538 if (!desc && !opts_accepts_any(list)) {
539 error_setg(errp, QERR_INVALID_PARAMETER, name);
540 return false;
541 }
542
543 opt = g_malloc0(sizeof(*opt));
544 opt->name = g_strdup(name);
545 opt->opts = opts;
546 opt->desc = desc;
547 opt->value.boolean = !!val;
548 opt->str = g_strdup(val ? "on" : "off");
549 QTAILQ_INSERT_TAIL(&opts->head, opt, next);
550 return true;
551}
552
553bool qemu_opt_set_number(QemuOpts *opts, const char *name, int64_t val,
554 Error **errp)
555{
556 QemuOpt *opt;
557 const QemuOptDesc *desc;
558 const QemuOptsList *list = opts->list;
559
560 desc = find_desc_by_name(list->desc, name);
561 if (!desc && !opts_accepts_any(list)) {
562 error_setg(errp, QERR_INVALID_PARAMETER, name);
563 return false;
564 }
565
566 opt = g_malloc0(sizeof(*opt));
567 opt->name = g_strdup(name);
568 opt->opts = opts;
569 opt->desc = desc;
570 opt->value.uint = val;
571 opt->str = g_strdup_printf("%" PRId64, val);
572 QTAILQ_INSERT_TAIL(&opts->head, opt, next);
573 return true;
574}
575
576
577
578
579
580
581
582int qemu_opt_foreach(QemuOpts *opts, qemu_opt_loopfunc func, void *opaque,
583 Error **errp)
584{
585 QemuOpt *opt;
586 int rc;
587
588 QTAILQ_FOREACH(opt, &opts->head, next) {
589 rc = func(opaque, opt->name, opt->str, errp);
590 if (rc) {
591 return rc;
592 }
593 assert(!errp || !*errp);
594 }
595 return 0;
596}
597
598QemuOpts *qemu_opts_find(QemuOptsList *list, const char *id)
599{
600 QemuOpts *opts;
601
602 QTAILQ_FOREACH(opts, &list->head, next) {
603 if (!opts->id && !id) {
604 return opts;
605 }
606 if (opts->id && id && !strcmp(opts->id, id)) {
607 return opts;
608 }
609 }
610 return NULL;
611}
612
613QemuOpts *qemu_opts_create(QemuOptsList *list, const char *id,
614 int fail_if_exists, Error **errp)
615{
616 QemuOpts *opts = NULL;
617
618 if (list->merge_lists) {
619 if (id) {
620 error_setg(errp, QERR_INVALID_PARAMETER, "id");
621 return NULL;
622 }
623 opts = qemu_opts_find(list, NULL);
624 if (opts) {
625 return opts;
626 }
627 } else if (id) {
628 assert(fail_if_exists);
629 if (!id_wellformed(id)) {
630 error_setg(errp, QERR_INVALID_PARAMETER_VALUE, "id",
631 "an identifier");
632 error_append_hint(errp, "Identifiers consist of letters, digits, "
633 "'-', '.', '_', starting with a letter.\n");
634 return NULL;
635 }
636 opts = qemu_opts_find(list, id);
637 if (opts != NULL) {
638 error_setg(errp, "Duplicate ID '%s' for %s", id, list->name);
639 return NULL;
640 }
641 }
642 opts = g_malloc0(sizeof(*opts));
643 opts->id = g_strdup(id);
644 opts->list = list;
645 loc_save(&opts->loc);
646 QTAILQ_INIT(&opts->head);
647 QTAILQ_INSERT_TAIL(&list->head, opts, next);
648 return opts;
649}
650
651void qemu_opts_reset(QemuOptsList *list)
652{
653 QemuOpts *opts, *next_opts;
654
655 QTAILQ_FOREACH_SAFE(opts, &list->head, next, next_opts) {
656 qemu_opts_del(opts);
657 }
658}
659
660void qemu_opts_loc_restore(QemuOpts *opts)
661{
662 loc_restore(&opts->loc);
663}
664
665bool qemu_opts_set(QemuOptsList *list, const char *name, const char *value, Error **errp)
666{
667 QemuOpts *opts;
668
669 assert(list->merge_lists);
670 opts = qemu_opts_create(list, NULL, 0, &error_abort);
671 return qemu_opt_set(opts, name, value, errp);
672}
673
674const char *qemu_opts_id(QemuOpts *opts)
675{
676 return opts->id;
677}
678
679
680void qemu_opts_set_id(QemuOpts *opts, char *id)
681{
682 opts->id = id;
683}
684
685void qemu_opts_del(QemuOpts *opts)
686{
687 QemuOpt *opt;
688
689 if (opts == NULL) {
690 return;
691 }
692
693 for (;;) {
694 opt = QTAILQ_FIRST(&opts->head);
695 if (opt == NULL)
696 break;
697 qemu_opt_del(opt);
698 }
699 QTAILQ_REMOVE(&opts->list->head, opts, next);
700 g_free(opts->id);
701 g_free(opts);
702}
703
704
705static void escaped_print(const char *value)
706{
707 const char *ptr;
708
709 for (ptr = value; *ptr; ++ptr) {
710 if (*ptr == ',') {
711 putchar(',');
712 }
713 putchar(*ptr);
714 }
715}
716
717void qemu_opts_print(QemuOpts *opts, const char *separator)
718{
719 QemuOpt *opt;
720 QemuOptDesc *desc = opts->list->desc;
721 const char *sep = "";
722
723 if (opts->id) {
724 printf("id=%s", opts->id);
725 sep = separator;
726 }
727
728 if (desc[0].name == NULL) {
729 QTAILQ_FOREACH(opt, &opts->head, next) {
730 printf("%s%s=", sep, opt->name);
731 escaped_print(opt->str);
732 sep = separator;
733 }
734 return;
735 }
736 for (; desc && desc->name; desc++) {
737 const char *value;
738 opt = qemu_opt_find(opts, desc->name);
739
740 value = opt ? opt->str : desc->def_value_str;
741 if (!value) {
742 continue;
743 }
744 if (desc->type == QEMU_OPT_STRING) {
745 printf("%s%s=", sep, desc->name);
746 escaped_print(value);
747 } else if ((desc->type == QEMU_OPT_SIZE ||
748 desc->type == QEMU_OPT_NUMBER) && opt) {
749 printf("%s%s=%" PRId64, sep, desc->name, opt->value.uint);
750 } else {
751 printf("%s%s=%s", sep, desc->name, value);
752 }
753 sep = separator;
754 }
755}
756
757static const char *get_opt_name_value(const char *params,
758 const char *firstname,
759 bool warn_on_flag,
760 bool *help_wanted,
761 char **name, char **value)
762{
763 const char *p;
764 const char *prefix = "";
765 size_t len;
766 bool is_help = false;
767
768 len = strcspn(params, "=,");
769 if (params[len] != '=') {
770
771 if (firstname) {
772
773 *name = g_strdup(firstname);
774 p = get_opt_value(params, value);
775 } else {
776
777 p = get_opt_name(params, name, len);
778 if (strncmp(*name, "no", 2) == 0) {
779 memmove(*name, *name + 2, strlen(*name + 2) + 1);
780 *value = g_strdup("off");
781 prefix = "no";
782 } else {
783 *value = g_strdup("on");
784 is_help = is_help_option(*name);
785 }
786 if (!is_help && warn_on_flag) {
787 warn_report("short-form boolean option '%s%s' deprecated", prefix, *name);
788 if (g_str_equal(*name, "delay")) {
789 error_printf("Please use nodelay=%s instead\n", prefix[0] ? "on" : "off");
790 } else {
791 error_printf("Please use %s=%s instead\n", *name, *value);
792 }
793 }
794 }
795 } else {
796
797 p = get_opt_name(params, name, len);
798 assert(*p == '=');
799 p++;
800 p = get_opt_value(p, value);
801 }
802
803 assert(!*p || *p == ',');
804 if (help_wanted && is_help) {
805 *help_wanted = true;
806 }
807 if (*p == ',') {
808 p++;
809 }
810 return p;
811}
812
813static bool opts_do_parse(QemuOpts *opts, const char *params,
814 const char *firstname, bool prepend,
815 bool warn_on_flag, bool *help_wanted, Error **errp)
816{
817 char *option, *value;
818 const char *p;
819 QemuOpt *opt;
820
821 for (p = params; *p;) {
822 p = get_opt_name_value(p, firstname, warn_on_flag, help_wanted, &option, &value);
823 if (help_wanted && *help_wanted) {
824 g_free(option);
825 g_free(value);
826 return false;
827 }
828 firstname = NULL;
829
830 if (!strcmp(option, "id")) {
831 g_free(option);
832 g_free(value);
833 continue;
834 }
835
836 opt = opt_create(opts, option, value, prepend);
837 g_free(option);
838 if (!opt_validate(opt, errp)) {
839 qemu_opt_del(opt);
840 return false;
841 }
842 }
843
844 return true;
845}
846
847static char *opts_parse_id(const char *params)
848{
849 const char *p;
850 char *name, *value;
851
852 for (p = params; *p;) {
853 p = get_opt_name_value(p, NULL, false, NULL, &name, &value);
854 if (!strcmp(name, "id")) {
855 g_free(name);
856 return value;
857 }
858 g_free(name);
859 g_free(value);
860 }
861
862 return NULL;
863}
864
865bool has_help_option(const char *params)
866{
867 const char *p;
868 char *name, *value;
869 bool ret = false;
870
871 for (p = params; *p;) {
872 p = get_opt_name_value(p, NULL, false, &ret, &name, &value);
873 g_free(name);
874 g_free(value);
875 if (ret) {
876 return true;
877 }
878 }
879
880 return false;
881}
882
883
884
885
886
887
888
889bool qemu_opts_do_parse(QemuOpts *opts, const char *params,
890 const char *firstname, Error **errp)
891{
892 return opts_do_parse(opts, params, firstname, false, false, NULL, errp);
893}
894
895static QemuOpts *opts_parse(QemuOptsList *list, const char *params,
896 bool permit_abbrev, bool defaults,
897 bool warn_on_flag, bool *help_wanted, Error **errp)
898{
899 const char *firstname;
900 char *id = opts_parse_id(params);
901 QemuOpts *opts;
902
903 assert(!permit_abbrev || list->implied_opt_name);
904 firstname = permit_abbrev ? list->implied_opt_name : NULL;
905
906
907
908
909
910
911
912
913 assert(!defaults || list->merge_lists);
914 opts = qemu_opts_create(list, id, !list->merge_lists, errp);
915 g_free(id);
916 if (opts == NULL) {
917 return NULL;
918 }
919
920 if (!opts_do_parse(opts, params, firstname, defaults,
921 warn_on_flag, help_wanted, errp)) {
922 qemu_opts_del(opts);
923 return NULL;
924 }
925
926 return opts;
927}
928
929
930
931
932
933
934
935
936QemuOpts *qemu_opts_parse(QemuOptsList *list, const char *params,
937 bool permit_abbrev, Error **errp)
938{
939 return opts_parse(list, params, permit_abbrev, false, false, NULL, errp);
940}
941
942
943
944
945
946
947
948
949
950QemuOpts *qemu_opts_parse_noisily(QemuOptsList *list, const char *params,
951 bool permit_abbrev)
952{
953 Error *err = NULL;
954 QemuOpts *opts;
955 bool help_wanted = false;
956
957 opts = opts_parse(list, params, permit_abbrev, false, true,
958 opts_accepts_any(list) ? NULL : &help_wanted,
959 &err);
960 if (!opts) {
961 assert(!!err + !!help_wanted == 1);
962 if (help_wanted) {
963 qemu_opts_print_help(list, true);
964 } else {
965 error_report_err(err);
966 }
967 }
968 return opts;
969}
970
971void qemu_opts_set_defaults(QemuOptsList *list, const char *params,
972 int permit_abbrev)
973{
974 QemuOpts *opts;
975
976 opts = opts_parse(list, params, permit_abbrev, true, false, NULL, NULL);
977 assert(opts);
978}
979
980static bool qemu_opts_from_qdict_entry(QemuOpts *opts,
981 const QDictEntry *entry,
982 Error **errp)
983{
984 const char *key = qdict_entry_key(entry);
985 QObject *obj = qdict_entry_value(entry);
986 char buf[32];
987 g_autofree char *tmp = NULL;
988 const char *value;
989
990 if (!strcmp(key, "id")) {
991 return true;
992 }
993
994 switch (qobject_type(obj)) {
995 case QTYPE_QSTRING:
996 value = qstring_get_str(qobject_to(QString, obj));
997 break;
998 case QTYPE_QNUM:
999 tmp = qnum_to_string(qobject_to(QNum, obj));
1000 value = tmp;
1001 break;
1002 case QTYPE_QBOOL:
1003 pstrcpy(buf, sizeof(buf),
1004 qbool_get_bool(qobject_to(QBool, obj)) ? "on" : "off");
1005 value = buf;
1006 break;
1007 default:
1008 return true;
1009 }
1010
1011 return qemu_opt_set(opts, key, value, errp);
1012}
1013
1014
1015
1016
1017
1018
1019
1020QemuOpts *qemu_opts_from_qdict(QemuOptsList *list, const QDict *qdict,
1021 Error **errp)
1022{
1023 QemuOpts *opts;
1024 const QDictEntry *entry;
1025
1026 opts = qemu_opts_create(list, qdict_get_try_str(qdict, "id"), 1, errp);
1027 if (!opts) {
1028 return NULL;
1029 }
1030
1031 assert(opts != NULL);
1032
1033 for (entry = qdict_first(qdict);
1034 entry;
1035 entry = qdict_next(qdict, entry)) {
1036 if (!qemu_opts_from_qdict_entry(opts, entry, errp)) {
1037 qemu_opts_del(opts);
1038 return NULL;
1039 }
1040 }
1041
1042 return opts;
1043}
1044
1045
1046
1047
1048
1049
1050bool qemu_opts_absorb_qdict(QemuOpts *opts, QDict *qdict, Error **errp)
1051{
1052 const QDictEntry *entry, *next;
1053
1054 entry = qdict_first(qdict);
1055
1056 while (entry != NULL) {
1057 next = qdict_next(qdict, entry);
1058
1059 if (find_desc_by_name(opts->list->desc, entry->key)) {
1060 if (!qemu_opts_from_qdict_entry(opts, entry, errp)) {
1061 return false;
1062 }
1063 qdict_del(qdict, entry->key);
1064 }
1065
1066 entry = next;
1067 }
1068
1069 return true;
1070}
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086QDict *qemu_opts_to_qdict_filtered(QemuOpts *opts, QDict *qdict,
1087 QemuOptsList *list, bool del)
1088{
1089 QemuOpt *opt, *next;
1090
1091 if (!qdict) {
1092 qdict = qdict_new();
1093 }
1094 if (opts->id) {
1095 qdict_put_str(qdict, "id", opts->id);
1096 }
1097 QTAILQ_FOREACH_SAFE(opt, &opts->head, next, next) {
1098 if (list) {
1099 QemuOptDesc *desc;
1100 bool found = false;
1101 for (desc = list->desc; desc->name; desc++) {
1102 if (!strcmp(desc->name, opt->name)) {
1103 found = true;
1104 break;
1105 }
1106 }
1107 if (!found) {
1108 continue;
1109 }
1110 }
1111 qdict_put_str(qdict, opt->name, opt->str);
1112 if (del) {
1113 qemu_opt_del(opt);
1114 }
1115 }
1116 return qdict;
1117}
1118
1119
1120
1121QDict *qemu_opts_to_qdict(QemuOpts *opts, QDict *qdict)
1122{
1123 return qemu_opts_to_qdict_filtered(opts, qdict, NULL, false);
1124}
1125
1126
1127
1128
1129bool qemu_opts_validate(QemuOpts *opts, const QemuOptDesc *desc, Error **errp)
1130{
1131 QemuOpt *opt;
1132
1133 assert(opts_accepts_any(opts->list));
1134
1135 QTAILQ_FOREACH(opt, &opts->head, next) {
1136 opt->desc = find_desc_by_name(desc, opt->name);
1137 if (!opt->desc) {
1138 error_setg(errp, QERR_INVALID_PARAMETER, opt->name);
1139 return false;
1140 }
1141
1142 if (!qemu_opt_parse(opt, errp)) {
1143 return false;
1144 }
1145 }
1146
1147 return true;
1148}
1149
1150
1151
1152
1153
1154
1155
1156
1157int qemu_opts_foreach(QemuOptsList *list, qemu_opts_loopfunc func,
1158 void *opaque, Error **errp)
1159{
1160 Location loc;
1161 QemuOpts *opts;
1162 int rc = 0;
1163
1164 loc_push_none(&loc);
1165 QTAILQ_FOREACH(opts, &list->head, next) {
1166 loc_restore(&opts->loc);
1167 rc = func(opaque, opts, errp);
1168 if (rc) {
1169 break;
1170 }
1171 assert(!errp || !*errp);
1172 }
1173 loc_pop(&loc);
1174 return rc;
1175}
1176
1177static size_t count_opts_list(QemuOptsList *list)
1178{
1179 QemuOptDesc *desc = NULL;
1180 size_t num_opts = 0;
1181
1182 if (!list) {
1183 return 0;
1184 }
1185
1186 desc = list->desc;
1187 while (desc && desc->name) {
1188 num_opts++;
1189 desc++;
1190 }
1191
1192 return num_opts;
1193}
1194
1195void qemu_opts_free(QemuOptsList *list)
1196{
1197 g_free(list);
1198}
1199
1200
1201
1202
1203
1204
1205QemuOptsList *qemu_opts_append(QemuOptsList *dst,
1206 QemuOptsList *list)
1207{
1208 size_t num_opts, num_dst_opts;
1209 QemuOptDesc *desc;
1210 bool need_init = false;
1211 bool need_head_update;
1212
1213 if (!list) {
1214 return dst;
1215 }
1216
1217
1218
1219
1220 if (!dst) {
1221 need_init = true;
1222 need_head_update = true;
1223 } else {
1224
1225
1226
1227 need_head_update = QTAILQ_EMPTY(&dst->head);
1228 }
1229
1230 num_opts = count_opts_list(dst);
1231 num_dst_opts = num_opts;
1232 num_opts += count_opts_list(list);
1233 dst = g_realloc(dst, sizeof(QemuOptsList) +
1234 (num_opts + 1) * sizeof(QemuOptDesc));
1235 if (need_init) {
1236 dst->name = NULL;
1237 dst->implied_opt_name = NULL;
1238 dst->merge_lists = false;
1239 }
1240 if (need_head_update) {
1241 QTAILQ_INIT(&dst->head);
1242 }
1243 dst->desc[num_dst_opts].name = NULL;
1244
1245
1246 if (list) {
1247 desc = list->desc;
1248 while (desc && desc->name) {
1249 if (find_desc_by_name(dst->desc, desc->name) == NULL) {
1250 dst->desc[num_dst_opts++] = *desc;
1251 dst->desc[num_dst_opts].name = NULL;
1252 }
1253 desc++;
1254 }
1255 }
1256
1257 return dst;
1258}
1259