4
* Copyright Red Hat, Inc. 2012-2016
6
* Author: Laszlo Ersek <lersek@redhat.com>
8
* This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
9
* See the COPYING.LIB file in the top-level directory.
13
#include "qemu/osdep.h"
14
#include "qapi/error.h"
15
#include "qemu/cutils.h"
16
#include "qapi/qmp/qerror.h"
17
#include "qapi/opts-visitor.h"
18
#include "qemu/queue.h"
19
#include "qemu/option_int.h"
20
#include "qapi/visitor-impl.h"
25
LM_NONE, /* not traversing a list of repeated options */
27
LM_IN_PROGRESS, /* opts_next_list() ready to be called.
29
* Generating the next list link will consume the most
30
* recently parsed QemuOpt instance of the repeated
33
* Parsing a value into the list link will examine the
34
* next QemuOpt instance of the repeated option, and
35
* possibly enter LM_SIGNED_INTERVAL or
36
* LM_UNSIGNED_INTERVAL.
39
LM_SIGNED_INTERVAL, /* opts_next_list() has been called.
41
* Generating the next list link will consume the most
42
* recently stored element from the signed interval,
43
* parsed from the most recent QemuOpt instance of the
44
* repeated option. This may consume QemuOpt itself
45
* and return to LM_IN_PROGRESS.
47
* Parsing a value into the list link will store the
48
* next element of the signed interval.
51
LM_UNSIGNED_INTERVAL /* Same as above, only for an unsigned interval. */
54
typedef enum ListMode ListMode;
60
/* Ownership remains with opts_visitor_new()'s caller. */
61
const QemuOpts *opts_root;
65
/* Non-null iff depth is positive. Each key is a QemuOpt name. Each value
66
* is a non-empty GQueue, enumerating all QemuOpt occurrences with that
68
GHashTable *unprocessed_opts;
70
/* The list currently being traversed with opts_start_list() /
71
* opts_next_list(). The list must have a struct element type in the
72
* schema, with a single mandatory scalar member. */
74
GQueue *repeated_opts;
76
/* When parsing a list of repeating options as integers, values of the form
77
* "a-b", representing a closed interval, are allowed. Elements in the
78
* range are generated individually.
83
} range_next, range_limit;
85
/* If "opts_root->id" is set, reinstantiate it as a fake QemuOpt for
86
* uniformity. Only its "name" and "str" fields are set. "fake_id_opt" does
87
* not survive or escape the OptsVisitor object.
93
static OptsVisitor *to_ov(Visitor *v)
95
return container_of(v, OptsVisitor, visitor);
100
destroy_list(gpointer list)
107
opts_visitor_insert(GHashTable *unprocessed_opts, const QemuOpt *opt)
111
list = g_hash_table_lookup(unprocessed_opts, opt->name);
113
list = g_queue_new();
115
/* GHashTable will never try to free the keys -- we supply NULL as
116
* "key_destroy_func" in opts_start_struct(). Thus cast away key
117
* const-ness in order to suppress gcc's warning.
119
g_hash_table_insert(unprocessed_opts, (gpointer)opt->name, list);
122
/* Similarly, destroy_list() doesn't call g_queue_free_full(). */
123
g_queue_push_tail(list, (gpointer)opt);
128
opts_start_struct(Visitor *v, const char *name, void **obj,
129
size_t size, Error **errp)
131
OptsVisitor *ov = to_ov(v);
135
*obj = g_malloc0(size);
137
if (ov->depth++ > 0) {
141
ov->unprocessed_opts = g_hash_table_new_full(&g_str_hash, &g_str_equal,
142
NULL, &destroy_list);
143
QTAILQ_FOREACH(opt, &ov->opts_root->head, next) {
144
/* ensured by qemu-option.c::opts_do_parse() */
145
assert(strcmp(opt->name, "id") != 0);
147
opts_visitor_insert(ov->unprocessed_opts, opt);
150
if (ov->opts_root->id != NULL) {
151
ov->fake_id_opt = g_malloc0(sizeof *ov->fake_id_opt);
153
ov->fake_id_opt->name = g_strdup("id");
154
ov->fake_id_opt->str = g_strdup(ov->opts_root->id);
155
opts_visitor_insert(ov->unprocessed_opts, ov->fake_id_opt);
161
opts_check_struct(Visitor *v, Error **errp)
163
OptsVisitor *ov = to_ov(v);
171
/* we should have processed all (distinct) QemuOpt instances */
172
g_hash_table_iter_init(&iter, ov->unprocessed_opts);
173
if (g_hash_table_iter_next(&iter, NULL, (void **)&any)) {
174
const QemuOpt *first;
176
first = g_queue_peek_head(any);
177
error_setg(errp, QERR_INVALID_PARAMETER, first->name);
183
opts_end_struct(Visitor *v, void **obj)
185
OptsVisitor *ov = to_ov(v);
187
if (--ov->depth > 0) {
191
g_hash_table_destroy(ov->unprocessed_opts);
192
ov->unprocessed_opts = NULL;
193
if (ov->fake_id_opt) {
194
g_free(ov->fake_id_opt->name);
195
g_free(ov->fake_id_opt->str);
196
g_free(ov->fake_id_opt);
198
ov->fake_id_opt = NULL;
203
lookup_distinct(const OptsVisitor *ov, const char *name, Error **errp)
207
list = g_hash_table_lookup(ov->unprocessed_opts, name);
209
error_setg(errp, QERR_MISSING_PARAMETER, name);
216
opts_start_list(Visitor *v, const char *name, GenericList **list, size_t size,
219
OptsVisitor *ov = to_ov(v);
221
/* we can't traverse a list in a list */
222
assert(ov->list_mode == LM_NONE);
223
/* we don't support visits without a list */
225
ov->repeated_opts = lookup_distinct(ov, name, errp);
226
if (ov->repeated_opts) {
227
ov->list_mode = LM_IN_PROGRESS;
228
*list = g_malloc0(size);
236
opts_next_list(Visitor *v, GenericList *tail, size_t size)
238
OptsVisitor *ov = to_ov(v);
240
switch (ov->list_mode) {
241
case LM_SIGNED_INTERVAL:
242
case LM_UNSIGNED_INTERVAL:
243
if (ov->list_mode == LM_SIGNED_INTERVAL) {
244
if (ov->range_next.s < ov->range_limit.s) {
248
} else if (ov->range_next.u < ov->range_limit.u) {
252
ov->list_mode = LM_IN_PROGRESS;
253
/* range has been completed, fall through in order to pop option */
255
case LM_IN_PROGRESS: {
258
opt = g_queue_pop_head(ov->repeated_opts);
259
if (g_queue_is_empty(ov->repeated_opts)) {
260
g_hash_table_remove(ov->unprocessed_opts, opt->name);
270
tail->next = g_malloc0(size);
276
opts_end_list(Visitor *v, void **obj)
278
OptsVisitor *ov = to_ov(v);
280
assert(ov->list_mode == LM_IN_PROGRESS ||
281
ov->list_mode == LM_SIGNED_INTERVAL ||
282
ov->list_mode == LM_UNSIGNED_INTERVAL);
283
ov->repeated_opts = NULL;
284
ov->list_mode = LM_NONE;
288
static const QemuOpt *
289
lookup_scalar(const OptsVisitor *ov, const char *name, Error **errp)
291
if (ov->list_mode == LM_NONE) {
294
/* the last occurrence of any QemuOpt takes effect when queried by name
296
list = lookup_distinct(ov, name, errp);
297
return list ? g_queue_peek_tail(list) : NULL;
299
assert(ov->list_mode == LM_IN_PROGRESS);
300
return g_queue_peek_head(ov->repeated_opts);
305
processed(OptsVisitor *ov, const char *name)
307
if (ov->list_mode == LM_NONE) {
308
g_hash_table_remove(ov->unprocessed_opts, name);
311
assert(ov->list_mode == LM_IN_PROGRESS);
317
opts_type_str(Visitor *v, const char *name, char **obj, Error **errp)
319
OptsVisitor *ov = to_ov(v);
322
opt = lookup_scalar(ov, name, errp);
327
*obj = g_strdup(opt->str ? opt->str : "");
328
/* Note that we consume a string even if this is called as part of
329
* an enum visit that later fails because the string is not a
330
* valid enum value; this is harmless because tracking what gets
331
* consumed only matters to visit_end_struct() as the final error
332
* check if there were no other failures during the visit. */
337
/* mimics qemu-option.c::parse_option_bool() */
339
opts_type_bool(Visitor *v, const char *name, bool *obj, Error **errp)
341
OptsVisitor *ov = to_ov(v);
344
opt = lookup_scalar(ov, name, errp);
350
if (strcmp(opt->str, "on") == 0 ||
351
strcmp(opt->str, "yes") == 0 ||
352
strcmp(opt->str, "y") == 0) {
354
} else if (strcmp(opt->str, "off") == 0 ||
355
strcmp(opt->str, "no") == 0 ||
356
strcmp(opt->str, "n") == 0) {
359
error_setg(errp, QERR_INVALID_PARAMETER_VALUE, opt->name,
360
"on|yes|y|off|no|n");
372
opts_type_int64(Visitor *v, const char *name, int64_t *obj, Error **errp)
374
OptsVisitor *ov = to_ov(v);
380
if (ov->list_mode == LM_SIGNED_INTERVAL) {
381
*obj = ov->range_next.s;
385
opt = lookup_scalar(ov, name, errp);
389
str = opt->str ? opt->str : "";
391
/* we've gotten past lookup_scalar() */
392
assert(ov->list_mode == LM_NONE || ov->list_mode == LM_IN_PROGRESS);
395
val = strtoll(str, &endptr, 0);
396
if (errno == 0 && endptr > str && INT64_MIN <= val && val <= INT64_MAX) {
397
if (*endptr == '\0') {
402
if (*endptr == '-' && ov->list_mode == LM_IN_PROGRESS) {
406
val2 = strtoll(str, &endptr, 0);
407
if (errno == 0 && endptr > str && *endptr == '\0' &&
408
INT64_MIN <= val2 && val2 <= INT64_MAX && val <= val2 &&
409
(val > INT64_MAX - OPTS_VISITOR_RANGE_MAX ||
410
val2 < val + OPTS_VISITOR_RANGE_MAX)) {
411
ov->range_next.s = val;
412
ov->range_limit.s = val2;
413
ov->list_mode = LM_SIGNED_INTERVAL;
415
/* as if entering on the top */
416
*obj = ov->range_next.s;
421
error_setg(errp, QERR_INVALID_PARAMETER_VALUE, opt->name,
422
(ov->list_mode == LM_NONE) ? "an int64 value" :
423
"an int64 value or range");
428
opts_type_uint64(Visitor *v, const char *name, uint64_t *obj, Error **errp)
430
OptsVisitor *ov = to_ov(v);
433
unsigned long long val;
436
if (ov->list_mode == LM_UNSIGNED_INTERVAL) {
437
*obj = ov->range_next.u;
441
opt = lookup_scalar(ov, name, errp);
447
/* we've gotten past lookup_scalar() */
448
assert(ov->list_mode == LM_NONE || ov->list_mode == LM_IN_PROGRESS);
450
if (parse_uint(str, &val, &endptr, 0) == 0 && val <= UINT64_MAX) {
451
if (*endptr == '\0') {
456
if (*endptr == '-' && ov->list_mode == LM_IN_PROGRESS) {
457
unsigned long long val2;
460
if (parse_uint_full(str, &val2, 0) == 0 &&
461
val2 <= UINT64_MAX && val <= val2 &&
462
val2 - val < OPTS_VISITOR_RANGE_MAX) {
463
ov->range_next.u = val;
464
ov->range_limit.u = val2;
465
ov->list_mode = LM_UNSIGNED_INTERVAL;
467
/* as if entering on the top */
468
*obj = ov->range_next.u;
473
error_setg(errp, QERR_INVALID_PARAMETER_VALUE, opt->name,
474
(ov->list_mode == LM_NONE) ? "a uint64 value" :
475
"a uint64 value or range");
480
opts_type_size(Visitor *v, const char *name, uint64_t *obj, Error **errp)
482
OptsVisitor *ov = to_ov(v);
487
opt = lookup_scalar(ov, name, errp);
492
val = qemu_strtosz_suffix(opt->str ? opt->str : "", &endptr,
493
QEMU_STRTOSZ_DEFSUFFIX_B);
494
if (val < 0 || *endptr) {
495
error_setg(errp, QERR_INVALID_PARAMETER_VALUE, opt->name,
496
"a size value representible as a non-negative int64");
506
opts_optional(Visitor *v, const char *name, bool *present)
508
OptsVisitor *ov = to_ov(v);
510
/* we only support a single mandatory scalar field in a list node */
511
assert(ov->list_mode == LM_NONE);
512
*present = (lookup_distinct(ov, name, NULL) != NULL);
517
opts_free(Visitor *v)
519
OptsVisitor *ov = to_ov(v);
521
if (ov->unprocessed_opts != NULL) {
522
g_hash_table_destroy(ov->unprocessed_opts);
524
g_free(ov->fake_id_opt);
530
opts_visitor_new(const QemuOpts *opts)
534
ov = g_malloc0(sizeof *ov);
536
ov->visitor.type = VISITOR_INPUT;
538
ov->visitor.start_struct = &opts_start_struct;
539
ov->visitor.check_struct = &opts_check_struct;
540
ov->visitor.end_struct = &opts_end_struct;
542
ov->visitor.start_list = &opts_start_list;
543
ov->visitor.next_list = &opts_next_list;
544
ov->visitor.end_list = &opts_end_list;
546
ov->visitor.type_int64 = &opts_type_int64;
547
ov->visitor.type_uint64 = &opts_type_uint64;
548
ov->visitor.type_size = &opts_type_size;
549
ov->visitor.type_bool = &opts_type_bool;
550
ov->visitor.type_str = &opts_type_str;
552
/* type_number() is not filled in, but this is not the first visitor to
553
* skip some mandatory methods... */
555
ov->visitor.optional = &opts_optional;
556
ov->visitor.free = opts_free;
558
ov->opts_root = opts;