2 * Commandline option parsing functions
4 * Copyright (c) 2003-2008 Fabrice Bellard
7 * Permission is hereby granted, free of charge, to any person obtaining a copy
8 * of this software and associated documentation files (the "Software"), to deal
9 * in the Software without restriction, including without limitation the rights
10 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
11 * copies of the Software, and to permit persons to whom the Software is
12 * furnished to do so, subject to the following conditions:
14 * The above copyright notice and this permission notice shall be included in
15 * all copies or substantial portions of the Software.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
18 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
21 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
22 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
26 #include "qemu/osdep.h"
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"
38 #include "qemu/help_option.h"
41 * Extracts the name of an option from the parameter string (p points at the
42 * first byte of the option name)
44 * The option name is delimited by delim (usually , or =) or the string end
45 * and is copied into option. The caller is responsible for free'ing option
46 * when no longer required.
48 * The return value is the position of the delimiter/zero byte after the option
51 static const char *get_opt_name(const char *p, char **option, char delim)
53 char *offset = strchr(p, delim);
56 *option = g_strndup(p, offset - p);
59 *option = g_strdup(p);
65 * Extracts the value of an option from the parameter string p (p points at the
66 * first byte of the option value)
68 * This function is comparable to get_opt_name with the difference that the
69 * delimiter is fixed to be comma which starts a new option. To specify an
70 * option value that contains commas, double each comma.
72 const char *get_opt_value(const char *p, char **value)
74 size_t capacity = 0, length;
79 offset = qemu_strchrnul(p, ',');
81 if (*offset != '\0' && *(offset + 1) == ',') {
84 *value = g_renew(char, *value, capacity + length + 1);
85 strncpy(*value + capacity, p, length);
86 (*value)[capacity + length] = '\0';
88 if (*offset == '\0' ||
89 *(offset + 1) != ',') {
93 p += (offset - p) + 2;
99 static void parse_option_bool(const char *name, const char *value, bool *ret,
102 if (!strcmp(value, "on")) {
104 } else if (!strcmp(value, "off")) {
107 error_setg(errp, QERR_INVALID_PARAMETER_VALUE,
108 name, "'on' or 'off'");
112 static void parse_option_number(const char *name, const char *value,
113 uint64_t *ret, Error **errp)
118 err = qemu_strtou64(value, NULL, 0, &number);
119 if (err == -ERANGE) {
120 error_setg(errp, "Value '%s' is too large for parameter '%s'",
125 error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name, "a number");
131 static const QemuOptDesc *find_desc_by_name(const QemuOptDesc *desc,
136 for (i = 0; desc[i].name != NULL; i++) {
137 if (strcmp(desc[i].name, name) == 0) {
145 void parse_option_size(const char *name, const char *value,
146 uint64_t *ret, Error **errp)
151 err = qemu_strtosz(value, NULL, &size);
152 if (err == -ERANGE) {
153 error_setg(errp, "Value '%s' is out of range for parameter '%s'",
158 error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name,
159 "a non-negative number below 2^64");
160 error_append_hint(errp, "Optional suffix k, M, G, T, P or E means"
161 " kilo-, mega-, giga-, tera-, peta-\n"
162 "and exabytes, respectively.\n");
168 bool has_help_option(const char *param)
170 const char *p = param;
173 while (*p && !result) {
176 p = get_opt_value(p, &value);
181 result = is_help_option(value);
188 bool is_valid_option_list(const char *p)
194 p = get_opt_value(p, &value);
196 (!*value || *value == ',')) {
210 static const char *opt_type_to_string(enum QemuOptType type)
213 case QEMU_OPT_STRING:
216 return "bool (on/off)";
217 case QEMU_OPT_NUMBER:
223 g_assert_not_reached();
227 * Print the list of options available in the given list. If
228 * @print_caption is true, a caption (including the list name, if it
229 * exists) is printed. The options itself will be indented, so
230 * @print_caption should only be set to false if the caller prints its
231 * own custom caption (so that the indentation makes sense).
233 void qemu_opts_print_help(QemuOptsList *list, bool print_caption)
237 GPtrArray *array = g_ptr_array_new();
241 while (desc && desc->name) {
242 GString *str = g_string_new(NULL);
243 g_string_append_printf(str, " %s=<%s>", desc->name,
244 opt_type_to_string(desc->type));
247 g_string_append_printf(str, "%*s", 24 - (int)str->len, "");
249 g_string_append_printf(str, " - %s", desc->help);
251 g_ptr_array_add(array, g_string_free(str, false));
255 g_ptr_array_sort(array, (GCompareFunc)qemu_pstrcmp0);
256 if (print_caption && array->len > 0) {
258 printf("%s options:\n", list->name);
260 printf("Options:\n");
262 } else if (array->len == 0) {
264 printf("There are no options for %s.\n", list->name);
266 printf("No options available.\n");
269 for (i = 0; i < array->len; i++) {
270 printf("%s\n", (char *)array->pdata[i]);
272 g_ptr_array_set_free_func(array, g_free);
273 g_ptr_array_free(array, true);
276 /* ------------------------------------------------------------------ */
278 QemuOpt *qemu_opt_find(QemuOpts *opts, const char *name)
282 QTAILQ_FOREACH_REVERSE(opt, &opts->head, next) {
283 if (strcmp(opt->name, name) != 0)
290 static void qemu_opt_del(QemuOpt *opt)
292 QTAILQ_REMOVE(&opt->opts->head, opt, next);
298 /* qemu_opt_set allows many settings for the same option.
299 * This function deletes all settings for an option.
301 static void qemu_opt_del_all(QemuOpts *opts, const char *name)
303 QemuOpt *opt, *next_opt;
305 QTAILQ_FOREACH_SAFE(opt, &opts->head, next, next_opt) {
306 if (!strcmp(opt->name, name)) {
312 const char *qemu_opt_get(QemuOpts *opts, const char *name)
320 opt = qemu_opt_find(opts, name);
322 const QemuOptDesc *desc = find_desc_by_name(opts->list->desc, name);
323 if (desc && desc->def_value_str) {
324 return desc->def_value_str;
327 return opt ? opt->str : NULL;
330 void qemu_opt_iter_init(QemuOptsIter *iter, QemuOpts *opts, const char *name)
333 iter->opt = QTAILQ_FIRST(&opts->head);
337 const char *qemu_opt_iter_next(QemuOptsIter *iter)
339 QemuOpt *ret = iter->opt;
341 while (ret && !g_str_equal(iter->name, ret->name)) {
342 ret = QTAILQ_NEXT(ret, next);
345 iter->opt = ret ? QTAILQ_NEXT(ret, next) : NULL;
346 return ret ? ret->str : NULL;
349 /* Get a known option (or its default) and remove it from the list
350 * all in one action. Return a malloced string of the option value.
351 * Result must be freed by caller with g_free().
353 char *qemu_opt_get_del(QemuOpts *opts, const char *name)
356 const QemuOptDesc *desc;
363 opt = qemu_opt_find(opts, name);
365 desc = find_desc_by_name(opts->list->desc, name);
366 if (desc && desc->def_value_str) {
367 str = g_strdup(desc->def_value_str);
373 qemu_opt_del_all(opts, name);
377 bool qemu_opt_has_help_opt(QemuOpts *opts)
381 QTAILQ_FOREACH_REVERSE(opt, &opts->head, next) {
382 if (is_help_option(opt->name)) {
389 static bool qemu_opt_get_bool_helper(QemuOpts *opts, const char *name,
390 bool defval, bool del)
399 opt = qemu_opt_find(opts, name);
401 const QemuOptDesc *desc = find_desc_by_name(opts->list->desc, name);
402 if (desc && desc->def_value_str) {
403 parse_option_bool(name, desc->def_value_str, &ret, &error_abort);
407 assert(opt->desc && opt->desc->type == QEMU_OPT_BOOL);
408 ret = opt->value.boolean;
410 qemu_opt_del_all(opts, name);
415 bool qemu_opt_get_bool(QemuOpts *opts, const char *name, bool defval)
417 return qemu_opt_get_bool_helper(opts, name, defval, false);
420 bool qemu_opt_get_bool_del(QemuOpts *opts, const char *name, bool defval)
422 return qemu_opt_get_bool_helper(opts, name, defval, true);
425 static uint64_t qemu_opt_get_number_helper(QemuOpts *opts, const char *name,
426 uint64_t defval, bool del)
429 uint64_t ret = defval;
435 opt = qemu_opt_find(opts, name);
437 const QemuOptDesc *desc = find_desc_by_name(opts->list->desc, name);
438 if (desc && desc->def_value_str) {
439 parse_option_number(name, desc->def_value_str, &ret, &error_abort);
443 assert(opt->desc && opt->desc->type == QEMU_OPT_NUMBER);
444 ret = opt->value.uint;
446 qemu_opt_del_all(opts, name);
451 uint64_t qemu_opt_get_number(QemuOpts *opts, const char *name, uint64_t defval)
453 return qemu_opt_get_number_helper(opts, name, defval, false);
456 uint64_t qemu_opt_get_number_del(QemuOpts *opts, const char *name,
459 return qemu_opt_get_number_helper(opts, name, defval, true);
462 static uint64_t qemu_opt_get_size_helper(QemuOpts *opts, const char *name,
463 uint64_t defval, bool del)
466 uint64_t ret = defval;
472 opt = qemu_opt_find(opts, name);
474 const QemuOptDesc *desc = find_desc_by_name(opts->list->desc, name);
475 if (desc && desc->def_value_str) {
476 parse_option_size(name, desc->def_value_str, &ret, &error_abort);
480 assert(opt->desc && opt->desc->type == QEMU_OPT_SIZE);
481 ret = opt->value.uint;
483 qemu_opt_del_all(opts, name);
488 uint64_t qemu_opt_get_size(QemuOpts *opts, const char *name, uint64_t defval)
490 return qemu_opt_get_size_helper(opts, name, defval, false);
493 uint64_t qemu_opt_get_size_del(QemuOpts *opts, const char *name,
496 return qemu_opt_get_size_helper(opts, name, defval, true);
499 static void qemu_opt_parse(QemuOpt *opt, Error **errp)
501 if (opt->desc == NULL)
504 switch (opt->desc->type) {
505 case QEMU_OPT_STRING:
509 parse_option_bool(opt->name, opt->str, &opt->value.boolean, errp);
511 case QEMU_OPT_NUMBER:
512 parse_option_number(opt->name, opt->str, &opt->value.uint, errp);
515 parse_option_size(opt->name, opt->str, &opt->value.uint, errp);
522 static bool opts_accepts_any(const QemuOpts *opts)
524 return opts->list->desc[0].name == NULL;
527 int qemu_opt_unset(QemuOpts *opts, const char *name)
529 QemuOpt *opt = qemu_opt_find(opts, name);
531 assert(opts_accepts_any(opts));
541 static void opt_set(QemuOpts *opts, const char *name, char *value,
542 bool prepend, bool *invalidp, Error **errp)
545 const QemuOptDesc *desc;
546 Error *local_err = NULL;
548 desc = find_desc_by_name(opts->list->desc, name);
549 if (!desc && !opts_accepts_any(opts)) {
551 error_setg(errp, QERR_INVALID_PARAMETER, name);
558 opt = g_malloc0(sizeof(*opt));
559 opt->name = g_strdup(name);
562 QTAILQ_INSERT_HEAD(&opts->head, opt, next);
564 QTAILQ_INSERT_TAIL(&opts->head, opt, next);
568 qemu_opt_parse(opt, &local_err);
570 error_propagate(errp, local_err);
575 void qemu_opt_set(QemuOpts *opts, const char *name, const char *value,
578 opt_set(opts, name, g_strdup(value), false, NULL, errp);
581 void qemu_opt_set_bool(QemuOpts *opts, const char *name, bool val,
585 const QemuOptDesc *desc = opts->list->desc;
587 opt = g_malloc0(sizeof(*opt));
588 opt->desc = find_desc_by_name(desc, name);
589 if (!opt->desc && !opts_accepts_any(opts)) {
590 error_setg(errp, QERR_INVALID_PARAMETER, name);
595 opt->name = g_strdup(name);
597 opt->value.boolean = !!val;
598 opt->str = g_strdup(val ? "on" : "off");
599 QTAILQ_INSERT_TAIL(&opts->head, opt, next);
602 void qemu_opt_set_number(QemuOpts *opts, const char *name, int64_t val,
606 const QemuOptDesc *desc = opts->list->desc;
608 opt = g_malloc0(sizeof(*opt));
609 opt->desc = find_desc_by_name(desc, name);
610 if (!opt->desc && !opts_accepts_any(opts)) {
611 error_setg(errp, QERR_INVALID_PARAMETER, name);
616 opt->name = g_strdup(name);
618 opt->value.uint = val;
619 opt->str = g_strdup_printf("%" PRId64, val);
620 QTAILQ_INSERT_TAIL(&opts->head, opt, next);
624 * For each member of @opts, call @func(@opaque, name, value, @errp).
625 * @func() may store an Error through @errp, but must return non-zero then.
626 * When @func() returns non-zero, break the loop and return that value.
627 * Return zero when the loop completes.
629 int qemu_opt_foreach(QemuOpts *opts, qemu_opt_loopfunc func, void *opaque,
635 QTAILQ_FOREACH(opt, &opts->head, next) {
636 rc = func(opaque, opt->name, opt->str, errp);
640 assert(!errp || !*errp);
645 QemuOpts *qemu_opts_find(QemuOptsList *list, const char *id)
649 QTAILQ_FOREACH(opts, &list->head, next) {
650 if (!opts->id && !id) {
653 if (opts->id && id && !strcmp(opts->id, id)) {
660 QemuOpts *qemu_opts_create(QemuOptsList *list, const char *id,
661 int fail_if_exists, Error **errp)
663 QemuOpts *opts = NULL;
666 if (!id_wellformed(id)) {
667 error_setg(errp, QERR_INVALID_PARAMETER_VALUE, "id",
669 error_append_hint(errp, "Identifiers consist of letters, digits, "
670 "'-', '.', '_', starting with a letter.\n");
673 opts = qemu_opts_find(list, id);
675 if (fail_if_exists && !list->merge_lists) {
676 error_setg(errp, "Duplicate ID '%s' for %s", id, list->name);
682 } else if (list->merge_lists) {
683 opts = qemu_opts_find(list, NULL);
688 opts = g_malloc0(sizeof(*opts));
689 opts->id = g_strdup(id);
691 loc_save(&opts->loc);
692 QTAILQ_INIT(&opts->head);
693 QTAILQ_INSERT_TAIL(&list->head, opts, next);
697 void qemu_opts_reset(QemuOptsList *list)
699 QemuOpts *opts, *next_opts;
701 QTAILQ_FOREACH_SAFE(opts, &list->head, next, next_opts) {
706 void qemu_opts_loc_restore(QemuOpts *opts)
708 loc_restore(&opts->loc);
711 void qemu_opts_set(QemuOptsList *list, const char *id,
712 const char *name, const char *value, Error **errp)
715 Error *local_err = NULL;
717 opts = qemu_opts_create(list, id, 1, &local_err);
719 error_propagate(errp, local_err);
722 qemu_opt_set(opts, name, value, errp);
725 const char *qemu_opts_id(QemuOpts *opts)
730 /* The id string will be g_free()d by qemu_opts_del */
731 void qemu_opts_set_id(QemuOpts *opts, char *id)
736 void qemu_opts_del(QemuOpts *opts)
745 opt = QTAILQ_FIRST(&opts->head);
750 QTAILQ_REMOVE(&opts->list->head, opts, next);
755 /* print value, escaping any commas in value */
756 static void escaped_print(const char *value)
760 for (ptr = value; *ptr; ++ptr) {
768 void qemu_opts_print(QemuOpts *opts, const char *separator)
771 QemuOptDesc *desc = opts->list->desc;
772 const char *sep = "";
775 printf("id=%s", opts->id); /* passed id_wellformed -> no commas */
779 if (desc[0].name == NULL) {
780 QTAILQ_FOREACH(opt, &opts->head, next) {
781 printf("%s%s=", sep, opt->name);
782 escaped_print(opt->str);
787 for (; desc && desc->name; desc++) {
789 opt = qemu_opt_find(opts, desc->name);
791 value = opt ? opt->str : desc->def_value_str;
795 if (desc->type == QEMU_OPT_STRING) {
796 printf("%s%s=", sep, desc->name);
797 escaped_print(value);
798 } else if ((desc->type == QEMU_OPT_SIZE ||
799 desc->type == QEMU_OPT_NUMBER) && opt) {
800 printf("%s%s=%" PRId64, sep, desc->name, opt->value.uint);
802 printf("%s%s=%s", sep, desc->name, value);
808 static void opts_do_parse(QemuOpts *opts, const char *params,
809 const char *firstname, bool prepend,
810 bool *invalidp, Error **errp)
814 const char *p,*pe,*pc;
815 Error *local_err = NULL;
817 for (p = params; *p != '\0'; p++) {
820 if (!pe || (pc && pc < pe)) {
821 /* found "foo,more" */
822 if (p == params && firstname) {
823 /* implicitly named first option */
824 option = g_strdup(firstname);
825 p = get_opt_value(p, &value);
827 /* option without value, probably a flag */
828 p = get_opt_name(p, &option, ',');
829 if (strncmp(option, "no", 2) == 0) {
830 memmove(option, option+2, strlen(option+2)+1);
831 value = g_strdup("off");
833 value = g_strdup("on");
837 /* found "foo=bar,more" */
838 p = get_opt_name(p, &option, '=');
841 p = get_opt_value(p, &value);
843 if (strcmp(option, "id") != 0) {
844 /* store and parse */
845 opt_set(opts, option, value, prepend, invalidp, &local_err);
848 error_propagate(errp, local_err);
857 option = value = NULL;
866 * Store options parsed from @params into @opts.
867 * If @firstname is non-null, the first key=value in @params may omit
868 * key=, and is treated as if key was @firstname.
869 * On error, store an error object through @errp if non-null.
871 void qemu_opts_do_parse(QemuOpts *opts, const char *params,
872 const char *firstname, Error **errp)
874 opts_do_parse(opts, params, firstname, false, NULL, errp);
877 static QemuOpts *opts_parse(QemuOptsList *list, const char *params,
878 bool permit_abbrev, bool defaults,
879 bool *invalidp, Error **errp)
881 const char *firstname;
885 Error *local_err = NULL;
887 assert(!permit_abbrev || list->implied_opt_name);
888 firstname = permit_abbrev ? list->implied_opt_name : NULL;
890 if (strncmp(params, "id=", 3) == 0) {
891 get_opt_value(params + 3, &id);
892 } else if ((p = strstr(params, ",id=")) != NULL) {
893 get_opt_value(p + 4, &id);
897 * This code doesn't work for defaults && !list->merge_lists: when
898 * params has no id=, and list has an element with !opts->id, it
899 * appends a new element instead of returning the existing opts.
900 * However, we got no use for this case. Guard against possible
901 * (if unlikely) future misuse:
903 assert(!defaults || list->merge_lists);
904 opts = qemu_opts_create(list, id, !defaults, &local_err);
907 error_propagate(errp, local_err);
911 opts_do_parse(opts, params, firstname, defaults, invalidp, &local_err);
913 error_propagate(errp, local_err);
922 * Create a QemuOpts in @list and with options parsed from @params.
923 * If @permit_abbrev, the first key=value in @params may omit key=,
924 * and is treated as if key was @list->implied_opt_name.
925 * On error, store an error object through @errp if non-null.
926 * Return the new QemuOpts on success, null pointer on error.
928 QemuOpts *qemu_opts_parse(QemuOptsList *list, const char *params,
929 bool permit_abbrev, Error **errp)
931 return opts_parse(list, params, permit_abbrev, false, NULL, errp);
935 * Create a QemuOpts in @list and with options parsed from @params.
936 * If @permit_abbrev, the first key=value in @params may omit key=,
937 * and is treated as if key was @list->implied_opt_name.
938 * Report errors with error_report_err(). This is inappropriate in
939 * QMP context. Do not use this function there!
940 * Return the new QemuOpts on success, null pointer on error.
942 QemuOpts *qemu_opts_parse_noisily(QemuOptsList *list, const char *params,
947 bool invalidp = false;
949 opts = opts_parse(list, params, permit_abbrev, false, &invalidp, &err);
951 if (invalidp && has_help_option(params)) {
952 qemu_opts_print_help(list, true);
955 error_report_err(err);
961 void qemu_opts_set_defaults(QemuOptsList *list, const char *params,
966 opts = opts_parse(list, params, permit_abbrev, true, NULL, NULL);
970 typedef struct OptsFromQDictState {
973 } OptsFromQDictState;
975 static void qemu_opts_from_qdict_1(const char *key, QObject *obj, void *opaque)
977 OptsFromQDictState *state = opaque;
978 char buf[32], *tmp = NULL;
981 if (!strcmp(key, "id") || *state->errp) {
985 switch (qobject_type(obj)) {
987 value = qstring_get_str(qobject_to(QString, obj));
990 tmp = qnum_to_string(qobject_to(QNum, obj));
994 pstrcpy(buf, sizeof(buf),
995 qbool_get_bool(qobject_to(QBool, obj)) ? "on" : "off");
1002 qemu_opt_set(state->opts, key, value, state->errp);
1007 * Create QemuOpts from a QDict.
1008 * Use value of key "id" as ID if it exists and is a QString. Only
1009 * QStrings, QNums and QBools are copied. Entries with other types
1010 * are silently ignored.
1012 QemuOpts *qemu_opts_from_qdict(QemuOptsList *list, const QDict *qdict,
1015 OptsFromQDictState state;
1016 Error *local_err = NULL;
1019 opts = qemu_opts_create(list, qdict_get_try_str(qdict, "id"), 1,
1022 error_propagate(errp, local_err);
1026 assert(opts != NULL);
1028 state.errp = &local_err;
1030 qdict_iter(qdict, qemu_opts_from_qdict_1, &state);
1032 error_propagate(errp, local_err);
1033 qemu_opts_del(opts);
1041 * Adds all QDict entries to the QemuOpts that can be added and removes them
1042 * from the QDict. When this function returns, the QDict contains only those
1043 * entries that couldn't be added to the QemuOpts.
1045 void qemu_opts_absorb_qdict(QemuOpts *opts, QDict *qdict, Error **errp)
1047 const QDictEntry *entry, *next;
1049 entry = qdict_first(qdict);
1051 while (entry != NULL) {
1052 Error *local_err = NULL;
1053 OptsFromQDictState state = {
1058 next = qdict_next(qdict, entry);
1060 if (find_desc_by_name(opts->list->desc, entry->key)) {
1061 qemu_opts_from_qdict_1(entry->key, entry->value, &state);
1063 error_propagate(errp, local_err);
1066 qdict_del(qdict, entry->key);
1075 * Convert from QemuOpts to QDict. The QDict values are of type QString.
1077 * If @list is given, only add those options to the QDict that are contained in
1078 * the list. If @del is true, any options added to the QDict are removed from
1079 * the QemuOpts, otherwise they remain there.
1081 * If two options in @opts have the same name, they are processed in order
1082 * so that the last one wins (consistent with the reverse iteration in
1083 * qemu_opt_find()), but all of them are deleted if @del is true.
1085 * TODO We'll want to use types appropriate for opt->desc->type, but
1086 * this is enough for now.
1088 QDict *qemu_opts_to_qdict_filtered(QemuOpts *opts, QDict *qdict,
1089 QemuOptsList *list, bool del)
1091 QemuOpt *opt, *next;
1094 qdict = qdict_new();
1097 qdict_put_str(qdict, "id", opts->id);
1099 QTAILQ_FOREACH_SAFE(opt, &opts->head, next, next) {
1103 for (desc = list->desc; desc->name; desc++) {
1104 if (!strcmp(desc->name, opt->name)) {
1113 qdict_put_str(qdict, opt->name, opt->str);
1121 /* Copy all options in a QemuOpts to the given QDict. See
1122 * qemu_opts_to_qdict_filtered() for details. */
1123 QDict *qemu_opts_to_qdict(QemuOpts *opts, QDict *qdict)
1125 return qemu_opts_to_qdict_filtered(opts, qdict, NULL, false);
1128 /* Validate parsed opts against descriptions where no
1129 * descriptions were provided in the QemuOptsList.
1131 void qemu_opts_validate(QemuOpts *opts, const QemuOptDesc *desc, Error **errp)
1134 Error *local_err = NULL;
1136 assert(opts_accepts_any(opts));
1138 QTAILQ_FOREACH(opt, &opts->head, next) {
1139 opt->desc = find_desc_by_name(desc, opt->name);
1141 error_setg(errp, QERR_INVALID_PARAMETER, opt->name);
1145 qemu_opt_parse(opt, &local_err);
1147 error_propagate(errp, local_err);
1154 * For each member of @list, call @func(@opaque, member, @errp).
1155 * Call it with the current location temporarily set to the member's.
1156 * @func() may store an Error through @errp, but must return non-zero then.
1157 * When @func() returns non-zero, break the loop and return that value.
1158 * Return zero when the loop completes.
1160 int qemu_opts_foreach(QemuOptsList *list, qemu_opts_loopfunc func,
1161 void *opaque, Error **errp)
1167 loc_push_none(&loc);
1168 QTAILQ_FOREACH(opts, &list->head, next) {
1169 loc_restore(&opts->loc);
1170 rc = func(opaque, opts, errp);
1174 assert(!errp || !*errp);
1180 static size_t count_opts_list(QemuOptsList *list)
1182 QemuOptDesc *desc = NULL;
1183 size_t num_opts = 0;
1190 while (desc && desc->name) {
1198 void qemu_opts_free(QemuOptsList *list)
1203 /* Realloc dst option list and append options from an option list (list)
1204 * to it. dst could be NULL or a malloced list.
1205 * The lifetime of dst must be shorter than the input list because the
1206 * QemuOptDesc->name, ->help, and ->def_value_str strings are shared.
1208 QemuOptsList *qemu_opts_append(QemuOptsList *dst,
1211 size_t num_opts, num_dst_opts;
1213 bool need_init = false;
1214 bool need_head_update;
1220 /* If dst is NULL, after realloc, some area of dst should be initialized
1221 * before adding options to it.
1225 need_head_update = true;
1227 /* Moreover, even if dst is not NULL, the realloc may move it to a
1228 * different address in which case we may get a stale tail pointer
1230 need_head_update = QTAILQ_EMPTY(&dst->head);
1233 num_opts = count_opts_list(dst);
1234 num_dst_opts = num_opts;
1235 num_opts += count_opts_list(list);
1236 dst = g_realloc(dst, sizeof(QemuOptsList) +
1237 (num_opts + 1) * sizeof(QemuOptDesc));
1240 dst->implied_opt_name = NULL;
1241 dst->merge_lists = false;
1243 if (need_head_update) {
1244 QTAILQ_INIT(&dst->head);
1246 dst->desc[num_dst_opts].name = NULL;
1248 /* append list->desc to dst->desc */
1251 while (desc && desc->name) {
1252 if (find_desc_by_name(dst->desc, desc->name) == NULL) {
1253 dst->desc[num_dst_opts++] = *desc;
1254 dst->desc[num_dst_opts].name = NULL;