2
0

qapi-dealloc-visitor.c 4.1 KB

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