blob: d7bfb30e25c6ec32aeb5bb55d43ded44394ecd76 [file] [log] [blame]
Peter Lieven9e7dac72014-08-13 19:20:17 +02001/*
2 * QAPI util functions
3 *
4 * Copyright Fujitsu, Inc. 2014
5 *
6 * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
7 * See the COPYING.LIB file in the top-level directory.
8 *
9 */
10
11#ifndef QAPI_UTIL_H
12#define QAPI_UTIL_H
13
Marc-André Lureauf7abe0e2017-08-24 10:46:10 +020014typedef struct QEnumLookup {
15 const char *const *array;
16 int size;
17} QEnumLookup;
18
19const char *qapi_enum_lookup(const QEnumLookup *lookup, int val);
20int qapi_enum_parse(const QEnumLookup *lookup, const char *buf,
Markus Armbruster06c60b62017-08-24 10:45:57 +020021 int def, Error **errp);
Paolo Bonzini372bcb22020-11-03 11:13:39 -050022bool qapi_bool_parse(const char *name, const char *value, bool *obj,
23 Error **errp);
Peter Lieven9e7dac72014-08-13 19:20:17 +020024
Markus Armbruster069b64e2017-02-28 22:27:04 +010025int parse_qapi_name(const char *name, bool complete);
26
Eric Blake9812e712020-10-27 00:05:47 -050027/*
28 * For any GenericList @list, insert @element at the front.
29 *
30 * Note that this macro evaluates @element exactly once, so it is safe
31 * to have side-effects with that argument.
32 */
33#define QAPI_LIST_PREPEND(list, element) do { \
34 typeof(list) _tmp = g_malloc(sizeof(*(list))); \
35 _tmp->value = (element); \
36 _tmp->next = (list); \
37 (list) = _tmp; \
38} while (0)
39
Eric Blakedc13f402021-01-13 16:10:11 -060040/*
41 * For any pointer to a GenericList @tail (usually the 'next' member of a
42 * list element), insert @element at the back and update the tail.
43 *
44 * Note that this macro evaluates @element exactly once, so it is safe
45 * to have side-effects with that argument.
46 */
47#define QAPI_LIST_APPEND(tail, element) do { \
48 *(tail) = g_malloc0(sizeof(**(tail))); \
49 (*(tail))->value = (element); \
50 (tail) = &(*(tail))->next; \
51} while (0)
52
Peter Lieven9e7dac72014-08-13 19:20:17 +020053#endif