qapi-dealloc-visitor.c 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178
  1. /*
  2. * Dealloc Visitor
  3. *
  4. * Copyright IBM, Corp. 2011
  5. *
  6. * Authors:
  7. * Michael Roth <mdroth@linux.vnet.ibm.com>
  8. *
  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.
  11. *
  12. */
  13. #include "qapi/dealloc-visitor.h"
  14. #include "qemu/queue.h"
  15. #include "qemu-common.h"
  16. #include "qapi/qmp/types.h"
  17. #include "qapi/visitor-impl.h"
  18. typedef struct StackEntry
  19. {
  20. void *value;
  21. bool is_list_head;
  22. QTAILQ_ENTRY(StackEntry) node;
  23. } StackEntry;
  24. struct QapiDeallocVisitor
  25. {
  26. Visitor visitor;
  27. QTAILQ_HEAD(, StackEntry) stack;
  28. bool is_list_head;
  29. };
  30. static QapiDeallocVisitor *to_qov(Visitor *v)
  31. {
  32. return container_of(v, QapiDeallocVisitor, visitor);
  33. }
  34. static void qapi_dealloc_push(QapiDeallocVisitor *qov, void *value)
  35. {
  36. StackEntry *e = g_malloc0(sizeof(*e));
  37. e->value = value;
  38. /* see if we're just pushing a list head tracker */
  39. if (value == NULL) {
  40. e->is_list_head = true;
  41. }
  42. QTAILQ_INSERT_HEAD(&qov->stack, e, node);
  43. }
  44. static void *qapi_dealloc_pop(QapiDeallocVisitor *qov)
  45. {
  46. StackEntry *e = QTAILQ_FIRST(&qov->stack);
  47. QObject *value;
  48. QTAILQ_REMOVE(&qov->stack, e, node);
  49. value = e->value;
  50. g_free(e);
  51. return value;
  52. }
  53. static void qapi_dealloc_start_struct(Visitor *v, void **obj, const char *kind,
  54. const char *name, size_t unused,
  55. Error **errp)
  56. {
  57. QapiDeallocVisitor *qov = to_qov(v);
  58. qapi_dealloc_push(qov, obj);
  59. }
  60. static void qapi_dealloc_end_struct(Visitor *v, Error **errp)
  61. {
  62. QapiDeallocVisitor *qov = to_qov(v);
  63. void **obj = qapi_dealloc_pop(qov);
  64. if (obj) {
  65. g_free(*obj);
  66. }
  67. }
  68. static void qapi_dealloc_start_list(Visitor *v, const char *name, Error **errp)
  69. {
  70. QapiDeallocVisitor *qov = to_qov(v);
  71. qapi_dealloc_push(qov, NULL);
  72. }
  73. static GenericList *qapi_dealloc_next_list(Visitor *v, GenericList **listp,
  74. Error **errp)
  75. {
  76. GenericList *list = *listp;
  77. QapiDeallocVisitor *qov = to_qov(v);
  78. StackEntry *e = QTAILQ_FIRST(&qov->stack);
  79. if (e && e->is_list_head) {
  80. e->is_list_head = false;
  81. return list;
  82. }
  83. if (list) {
  84. list = list->next;
  85. g_free(*listp);
  86. return list;
  87. }
  88. return NULL;
  89. }
  90. static void qapi_dealloc_end_list(Visitor *v, Error **errp)
  91. {
  92. QapiDeallocVisitor *qov = to_qov(v);
  93. void *obj = qapi_dealloc_pop(qov);
  94. assert(obj == NULL); /* should've been list head tracker with no payload */
  95. }
  96. static void qapi_dealloc_type_str(Visitor *v, char **obj, const char *name,
  97. Error **errp)
  98. {
  99. if (obj) {
  100. g_free(*obj);
  101. }
  102. }
  103. static void qapi_dealloc_type_int(Visitor *v, int64_t *obj, const char *name,
  104. Error **errp)
  105. {
  106. }
  107. static void qapi_dealloc_type_bool(Visitor *v, bool *obj, const char *name,
  108. Error **errp)
  109. {
  110. }
  111. static void qapi_dealloc_type_number(Visitor *v, double *obj, const char *name,
  112. Error **errp)
  113. {
  114. }
  115. static void qapi_dealloc_type_size(Visitor *v, uint64_t *obj, const char *name,
  116. Error **errp)
  117. {
  118. }
  119. static void qapi_dealloc_type_enum(Visitor *v, int *obj, const char *strings[],
  120. const char *kind, const char *name,
  121. Error **errp)
  122. {
  123. }
  124. Visitor *qapi_dealloc_get_visitor(QapiDeallocVisitor *v)
  125. {
  126. return &v->visitor;
  127. }
  128. void qapi_dealloc_visitor_cleanup(QapiDeallocVisitor *v)
  129. {
  130. g_free(v);
  131. }
  132. QapiDeallocVisitor *qapi_dealloc_visitor_new(void)
  133. {
  134. QapiDeallocVisitor *v;
  135. v = g_malloc0(sizeof(*v));
  136. v->visitor.start_struct = qapi_dealloc_start_struct;
  137. v->visitor.end_struct = qapi_dealloc_end_struct;
  138. v->visitor.start_list = qapi_dealloc_start_list;
  139. v->visitor.next_list = qapi_dealloc_next_list;
  140. v->visitor.end_list = qapi_dealloc_end_list;
  141. v->visitor.type_enum = qapi_dealloc_type_enum;
  142. v->visitor.type_int = qapi_dealloc_type_int;
  143. v->visitor.type_bool = qapi_dealloc_type_bool;
  144. v->visitor.type_str = qapi_dealloc_type_str;
  145. v->visitor.type_number = qapi_dealloc_type_number;
  146. v->visitor.type_size = qapi_dealloc_type_size;
  147. QTAILQ_INIT(&v->stack);
  148. return v;
  149. }