dc13f40c6b
Similar to the existing QAPI_LIST_PREPEND, but designed for use where we want to preserve insertion order. Callers will be added in upcoming patches. Note the difference in signature: PREPEND takes List*, APPEND takes List**. Signed-off-by: Eric Blake <eblake@redhat.com> Reviewed-by: Vladimir Sementsov-Ogievskiy <vsementsov@virtuozzo.com> Message-Id: <20210113221013.390592-4-eblake@redhat.com> Reviewed-by: Markus Armbruster <armbru@redhat.com> Signed-off-by: Markus Armbruster <armbru@redhat.com>
54 lines
1.5 KiB
C
54 lines
1.5 KiB
C
/*
|
|
* QAPI util functions
|
|
*
|
|
* Copyright Fujitsu, Inc. 2014
|
|
*
|
|
* This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
|
|
* See the COPYING.LIB file in the top-level directory.
|
|
*
|
|
*/
|
|
|
|
#ifndef QAPI_UTIL_H
|
|
#define QAPI_UTIL_H
|
|
|
|
typedef struct QEnumLookup {
|
|
const char *const *array;
|
|
int size;
|
|
} QEnumLookup;
|
|
|
|
const char *qapi_enum_lookup(const QEnumLookup *lookup, int val);
|
|
int qapi_enum_parse(const QEnumLookup *lookup, const char *buf,
|
|
int def, Error **errp);
|
|
bool qapi_bool_parse(const char *name, const char *value, bool *obj,
|
|
Error **errp);
|
|
|
|
int parse_qapi_name(const char *name, bool complete);
|
|
|
|
/*
|
|
* For any GenericList @list, insert @element at the front.
|
|
*
|
|
* Note that this macro evaluates @element exactly once, so it is safe
|
|
* to have side-effects with that argument.
|
|
*/
|
|
#define QAPI_LIST_PREPEND(list, element) do { \
|
|
typeof(list) _tmp = g_malloc(sizeof(*(list))); \
|
|
_tmp->value = (element); \
|
|
_tmp->next = (list); \
|
|
(list) = _tmp; \
|
|
} while (0)
|
|
|
|
/*
|
|
* For any pointer to a GenericList @tail (usually the 'next' member of a
|
|
* list element), insert @element at the back and update the tail.
|
|
*
|
|
* Note that this macro evaluates @element exactly once, so it is safe
|
|
* to have side-effects with that argument.
|
|
*/
|
|
#define QAPI_LIST_APPEND(tail, element) do { \
|
|
*(tail) = g_malloc0(sizeof(**(tail))); \
|
|
(*(tail))->value = (element); \
|
|
(tail) = &(*(tail))->next; \
|
|
} while (0)
|
|
|
|
#endif
|