Update VERSION for release
[qemu/pbrook.git] / qapi / qapi-dealloc-visitor.c
blob1334de33cc690057ffc80f766f604dd3f4e8e98c
1 /*
2 * Dealloc Visitor
4 * Copyright IBM, Corp. 2011
6 * Authors:
7 * Michael Roth <mdroth@linux.vnet.ibm.com>
9 * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
10 * See the COPYING.LIB file in the top-level directory.
14 #include "qapi/dealloc-visitor.h"
15 #include "qemu/queue.h"
16 #include "qemu-common.h"
17 #include "qapi/qmp/types.h"
18 #include "qapi/visitor-impl.h"
20 typedef struct StackEntry
22 void *value;
23 bool is_list_head;
24 QTAILQ_ENTRY(StackEntry) node;
25 } StackEntry;
27 struct QapiDeallocVisitor
29 Visitor visitor;
30 QTAILQ_HEAD(, StackEntry) stack;
31 bool is_list_head;
34 static QapiDeallocVisitor *to_qov(Visitor *v)
36 return container_of(v, QapiDeallocVisitor, visitor);
39 static void qapi_dealloc_push(QapiDeallocVisitor *qov, void *value)
41 StackEntry *e = g_malloc0(sizeof(*e));
43 e->value = value;
45 /* see if we're just pushing a list head tracker */
46 if (value == NULL) {
47 e->is_list_head = true;
49 QTAILQ_INSERT_HEAD(&qov->stack, e, node);
52 static void *qapi_dealloc_pop(QapiDeallocVisitor *qov)
54 StackEntry *e = QTAILQ_FIRST(&qov->stack);
55 QObject *value;
56 QTAILQ_REMOVE(&qov->stack, e, node);
57 value = e->value;
58 g_free(e);
59 return value;
62 static void qapi_dealloc_start_struct(Visitor *v, void **obj, const char *kind,
63 const char *name, size_t unused,
64 Error **errp)
66 QapiDeallocVisitor *qov = to_qov(v);
67 qapi_dealloc_push(qov, obj);
70 static void qapi_dealloc_end_struct(Visitor *v, Error **errp)
72 QapiDeallocVisitor *qov = to_qov(v);
73 void **obj = qapi_dealloc_pop(qov);
74 if (obj) {
75 g_free(*obj);
79 static void qapi_dealloc_start_list(Visitor *v, const char *name, Error **errp)
81 QapiDeallocVisitor *qov = to_qov(v);
82 qapi_dealloc_push(qov, NULL);
85 static GenericList *qapi_dealloc_next_list(Visitor *v, GenericList **listp,
86 Error **errp)
88 GenericList *list = *listp;
89 QapiDeallocVisitor *qov = to_qov(v);
90 StackEntry *e = QTAILQ_FIRST(&qov->stack);
92 if (e && e->is_list_head) {
93 e->is_list_head = false;
94 return list;
97 if (list) {
98 list = list->next;
99 g_free(*listp);
100 return list;
103 return NULL;
106 static void qapi_dealloc_end_list(Visitor *v, Error **errp)
108 QapiDeallocVisitor *qov = to_qov(v);
109 void *obj = qapi_dealloc_pop(qov);
110 assert(obj == NULL); /* should've been list head tracker with no payload */
113 static void qapi_dealloc_type_str(Visitor *v, char **obj, const char *name,
114 Error **errp)
116 if (obj) {
117 g_free(*obj);
121 static void qapi_dealloc_type_int(Visitor *v, int64_t *obj, const char *name,
122 Error **errp)
126 static void qapi_dealloc_type_bool(Visitor *v, bool *obj, const char *name,
127 Error **errp)
131 static void qapi_dealloc_type_number(Visitor *v, double *obj, const char *name,
132 Error **errp)
136 static void qapi_dealloc_type_size(Visitor *v, uint64_t *obj, const char *name,
137 Error **errp)
141 static void qapi_dealloc_type_enum(Visitor *v, int *obj, const char *strings[],
142 const char *kind, const char *name,
143 Error **errp)
147 Visitor *qapi_dealloc_get_visitor(QapiDeallocVisitor *v)
149 return &v->visitor;
152 void qapi_dealloc_visitor_cleanup(QapiDeallocVisitor *v)
154 g_free(v);
157 QapiDeallocVisitor *qapi_dealloc_visitor_new(void)
159 QapiDeallocVisitor *v;
161 v = g_malloc0(sizeof(*v));
163 v->visitor.start_struct = qapi_dealloc_start_struct;
164 v->visitor.end_struct = qapi_dealloc_end_struct;
165 v->visitor.start_list = qapi_dealloc_start_list;
166 v->visitor.next_list = qapi_dealloc_next_list;
167 v->visitor.end_list = qapi_dealloc_end_list;
168 v->visitor.type_enum = qapi_dealloc_type_enum;
169 v->visitor.type_int = qapi_dealloc_type_int;
170 v->visitor.type_bool = qapi_dealloc_type_bool;
171 v->visitor.type_str = qapi_dealloc_type_str;
172 v->visitor.type_number = qapi_dealloc_type_number;
173 v->visitor.type_size = qapi_dealloc_type_size;
175 QTAILQ_INIT(&v->stack);
177 return v;