2011-07-20 03:50:35 +08:00
|
|
|
/*
|
|
|
|
* Dealloc Visitor
|
|
|
|
*
|
|
|
|
* Copyright IBM, Corp. 2011
|
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
* Michael Roth <mdroth@linux.vnet.ibm.com>
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "qapi-dealloc-visitor.h"
|
|
|
|
#include "qemu-queue.h"
|
|
|
|
#include "qemu-common.h"
|
|
|
|
#include "qemu-objects.h"
|
2012-12-06 18:51:59 +08:00
|
|
|
#include "qapi-visit-impl.h"
|
2011-07-20 03:50:35 +08:00
|
|
|
|
|
|
|
typedef struct StackEntry
|
|
|
|
{
|
|
|
|
void *value;
|
2011-09-20 08:03:10 +08:00
|
|
|
bool is_list_head;
|
2011-07-20 03:50:35 +08:00
|
|
|
QTAILQ_ENTRY(StackEntry) node;
|
|
|
|
} StackEntry;
|
|
|
|
|
|
|
|
struct QapiDeallocVisitor
|
|
|
|
{
|
|
|
|
Visitor visitor;
|
|
|
|
QTAILQ_HEAD(, StackEntry) stack;
|
2011-09-16 03:39:52 +08:00
|
|
|
bool is_list_head;
|
2011-07-20 03:50:35 +08:00
|
|
|
};
|
|
|
|
|
|
|
|
static QapiDeallocVisitor *to_qov(Visitor *v)
|
|
|
|
{
|
|
|
|
return container_of(v, QapiDeallocVisitor, visitor);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void qapi_dealloc_push(QapiDeallocVisitor *qov, void *value)
|
|
|
|
{
|
2011-08-21 11:09:37 +08:00
|
|
|
StackEntry *e = g_malloc0(sizeof(*e));
|
2011-07-20 03:50:35 +08:00
|
|
|
|
|
|
|
e->value = value;
|
2011-09-20 08:03:10 +08:00
|
|
|
|
|
|
|
/* see if we're just pushing a list head tracker */
|
|
|
|
if (value == NULL) {
|
|
|
|
e->is_list_head = true;
|
|
|
|
}
|
2011-07-20 03:50:35 +08:00
|
|
|
QTAILQ_INSERT_HEAD(&qov->stack, e, node);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *qapi_dealloc_pop(QapiDeallocVisitor *qov)
|
|
|
|
{
|
|
|
|
StackEntry *e = QTAILQ_FIRST(&qov->stack);
|
|
|
|
QObject *value;
|
|
|
|
QTAILQ_REMOVE(&qov->stack, e, node);
|
|
|
|
value = e->value;
|
2011-08-21 11:09:37 +08:00
|
|
|
g_free(e);
|
2011-07-20 03:50:35 +08:00
|
|
|
return value;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void qapi_dealloc_start_struct(Visitor *v, void **obj, const char *kind,
|
|
|
|
const char *name, size_t unused,
|
|
|
|
Error **errp)
|
|
|
|
{
|
|
|
|
QapiDeallocVisitor *qov = to_qov(v);
|
|
|
|
qapi_dealloc_push(qov, obj);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void qapi_dealloc_end_struct(Visitor *v, Error **errp)
|
|
|
|
{
|
|
|
|
QapiDeallocVisitor *qov = to_qov(v);
|
|
|
|
void **obj = qapi_dealloc_pop(qov);
|
|
|
|
if (obj) {
|
2011-08-21 11:09:37 +08:00
|
|
|
g_free(*obj);
|
2011-07-20 03:50:35 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void qapi_dealloc_start_list(Visitor *v, const char *name, Error **errp)
|
|
|
|
{
|
2011-09-16 03:39:52 +08:00
|
|
|
QapiDeallocVisitor *qov = to_qov(v);
|
2011-09-20 08:03:10 +08:00
|
|
|
qapi_dealloc_push(qov, NULL);
|
2011-07-20 03:50:35 +08:00
|
|
|
}
|
|
|
|
|
2011-09-16 03:39:52 +08:00
|
|
|
static GenericList *qapi_dealloc_next_list(Visitor *v, GenericList **listp,
|
2011-07-20 03:50:35 +08:00
|
|
|
Error **errp)
|
|
|
|
{
|
2011-09-16 03:39:52 +08:00
|
|
|
GenericList *list = *listp;
|
|
|
|
QapiDeallocVisitor *qov = to_qov(v);
|
2011-09-20 08:03:10 +08:00
|
|
|
StackEntry *e = QTAILQ_FIRST(&qov->stack);
|
2011-09-16 03:39:52 +08:00
|
|
|
|
2011-09-20 08:03:10 +08:00
|
|
|
if (e && e->is_list_head) {
|
|
|
|
e->is_list_head = false;
|
|
|
|
return list;
|
2011-09-16 03:39:52 +08:00
|
|
|
}
|
|
|
|
|
2011-09-20 08:03:10 +08:00
|
|
|
if (list) {
|
|
|
|
list = list->next;
|
|
|
|
g_free(*listp);
|
|
|
|
return list;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
2011-07-20 03:50:35 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void qapi_dealloc_end_list(Visitor *v, Error **errp)
|
|
|
|
{
|
2011-09-20 08:03:10 +08:00
|
|
|
QapiDeallocVisitor *qov = to_qov(v);
|
|
|
|
void *obj = qapi_dealloc_pop(qov);
|
|
|
|
assert(obj == NULL); /* should've been list head tracker with no payload */
|
2011-07-20 03:50:35 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void qapi_dealloc_type_str(Visitor *v, char **obj, const char *name,
|
|
|
|
Error **errp)
|
|
|
|
{
|
|
|
|
if (obj) {
|
2011-08-21 11:09:37 +08:00
|
|
|
g_free(*obj);
|
2011-07-20 03:50:35 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void qapi_dealloc_type_int(Visitor *v, int64_t *obj, const char *name,
|
|
|
|
Error **errp)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
static void qapi_dealloc_type_bool(Visitor *v, bool *obj, const char *name,
|
|
|
|
Error **errp)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
static void qapi_dealloc_type_number(Visitor *v, double *obj, const char *name,
|
|
|
|
Error **errp)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2012-11-28 04:11:25 +08:00
|
|
|
static void qapi_dealloc_type_size(Visitor *v, uint64_t *obj, const char *name,
|
2012-11-26 20:10:12 +08:00
|
|
|
Error **errp)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
2011-07-20 03:50:35 +08:00
|
|
|
static void qapi_dealloc_type_enum(Visitor *v, int *obj, const char *strings[],
|
|
|
|
const char *kind, const char *name,
|
|
|
|
Error **errp)
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
Visitor *qapi_dealloc_get_visitor(QapiDeallocVisitor *v)
|
|
|
|
{
|
|
|
|
return &v->visitor;
|
|
|
|
}
|
|
|
|
|
|
|
|
void qapi_dealloc_visitor_cleanup(QapiDeallocVisitor *v)
|
|
|
|
{
|
2011-08-21 11:09:37 +08:00
|
|
|
g_free(v);
|
2011-07-20 03:50:35 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
QapiDeallocVisitor *qapi_dealloc_visitor_new(void)
|
|
|
|
{
|
|
|
|
QapiDeallocVisitor *v;
|
|
|
|
|
2011-08-21 11:09:37 +08:00
|
|
|
v = g_malloc0(sizeof(*v));
|
2011-07-20 03:50:35 +08:00
|
|
|
|
|
|
|
v->visitor.start_struct = qapi_dealloc_start_struct;
|
|
|
|
v->visitor.end_struct = qapi_dealloc_end_struct;
|
|
|
|
v->visitor.start_list = qapi_dealloc_start_list;
|
|
|
|
v->visitor.next_list = qapi_dealloc_next_list;
|
|
|
|
v->visitor.end_list = qapi_dealloc_end_list;
|
|
|
|
v->visitor.type_enum = qapi_dealloc_type_enum;
|
|
|
|
v->visitor.type_int = qapi_dealloc_type_int;
|
|
|
|
v->visitor.type_bool = qapi_dealloc_type_bool;
|
|
|
|
v->visitor.type_str = qapi_dealloc_type_str;
|
|
|
|
v->visitor.type_number = qapi_dealloc_type_number;
|
2012-11-26 20:10:12 +08:00
|
|
|
v->visitor.type_size = qapi_dealloc_type_size;
|
2011-07-20 03:50:35 +08:00
|
|
|
|
|
|
|
QTAILQ_INIT(&v->stack);
|
|
|
|
|
|
|
|
return v;
|
|
|
|
}
|