qmp-output-visitor.c 5.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240
  1. /*
  2. * Core Definitions for QAPI/QMP Command Registry
  3. *
  4. * Copyright IBM, Corp. 2011
  5. *
  6. * Authors:
  7. * Anthony Liguori <aliguori@us.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/qmp-output-visitor.h"
  14. #include "qapi/visitor-impl.h"
  15. #include "qemu/queue.h"
  16. #include "qemu-common.h"
  17. #include "qapi/qmp/types.h"
  18. typedef struct QStackEntry
  19. {
  20. QObject *value;
  21. bool is_list_head;
  22. QTAILQ_ENTRY(QStackEntry) node;
  23. } QStackEntry;
  24. typedef QTAILQ_HEAD(QStack, QStackEntry) QStack;
  25. struct QmpOutputVisitor
  26. {
  27. Visitor visitor;
  28. QStack stack;
  29. };
  30. #define qmp_output_add(qov, name, value) \
  31. qmp_output_add_obj(qov, name, QOBJECT(value))
  32. #define qmp_output_push(qov, value) qmp_output_push_obj(qov, QOBJECT(value))
  33. static QmpOutputVisitor *to_qov(Visitor *v)
  34. {
  35. return container_of(v, QmpOutputVisitor, visitor);
  36. }
  37. static void qmp_output_push_obj(QmpOutputVisitor *qov, QObject *value)
  38. {
  39. QStackEntry *e = g_malloc0(sizeof(*e));
  40. e->value = value;
  41. if (qobject_type(e->value) == QTYPE_QLIST) {
  42. e->is_list_head = true;
  43. }
  44. QTAILQ_INSERT_HEAD(&qov->stack, e, node);
  45. }
  46. static QObject *qmp_output_pop(QmpOutputVisitor *qov)
  47. {
  48. QStackEntry *e = QTAILQ_FIRST(&qov->stack);
  49. QObject *value;
  50. QTAILQ_REMOVE(&qov->stack, e, node);
  51. value = e->value;
  52. g_free(e);
  53. return value;
  54. }
  55. static QObject *qmp_output_first(QmpOutputVisitor *qov)
  56. {
  57. QStackEntry *e = QTAILQ_LAST(&qov->stack, QStack);
  58. /* FIXME - find a better way to deal with NULL values */
  59. if (!e) {
  60. return NULL;
  61. }
  62. return e->value;
  63. }
  64. static QObject *qmp_output_last(QmpOutputVisitor *qov)
  65. {
  66. QStackEntry *e = QTAILQ_FIRST(&qov->stack);
  67. return e->value;
  68. }
  69. static void qmp_output_add_obj(QmpOutputVisitor *qov, const char *name,
  70. QObject *value)
  71. {
  72. QObject *cur;
  73. if (QTAILQ_EMPTY(&qov->stack)) {
  74. qmp_output_push_obj(qov, value);
  75. return;
  76. }
  77. cur = qmp_output_last(qov);
  78. switch (qobject_type(cur)) {
  79. case QTYPE_QDICT:
  80. qdict_put_obj(qobject_to_qdict(cur), name, value);
  81. break;
  82. case QTYPE_QLIST:
  83. qlist_append_obj(qobject_to_qlist(cur), value);
  84. break;
  85. default:
  86. qobject_decref(qmp_output_pop(qov));
  87. qmp_output_push_obj(qov, value);
  88. break;
  89. }
  90. }
  91. static void qmp_output_start_struct(Visitor *v, void **obj, const char *kind,
  92. const char *name, size_t unused,
  93. Error **errp)
  94. {
  95. QmpOutputVisitor *qov = to_qov(v);
  96. QDict *dict = qdict_new();
  97. qmp_output_add(qov, name, dict);
  98. qmp_output_push(qov, dict);
  99. }
  100. static void qmp_output_end_struct(Visitor *v, Error **errp)
  101. {
  102. QmpOutputVisitor *qov = to_qov(v);
  103. qmp_output_pop(qov);
  104. }
  105. static void qmp_output_start_list(Visitor *v, const char *name, Error **errp)
  106. {
  107. QmpOutputVisitor *qov = to_qov(v);
  108. QList *list = qlist_new();
  109. qmp_output_add(qov, name, list);
  110. qmp_output_push(qov, list);
  111. }
  112. static GenericList *qmp_output_next_list(Visitor *v, GenericList **listp,
  113. Error **errp)
  114. {
  115. GenericList *list = *listp;
  116. QmpOutputVisitor *qov = to_qov(v);
  117. QStackEntry *e = QTAILQ_FIRST(&qov->stack);
  118. assert(e);
  119. if (e->is_list_head) {
  120. e->is_list_head = false;
  121. return list;
  122. }
  123. return list ? list->next : NULL;
  124. }
  125. static void qmp_output_end_list(Visitor *v, Error **errp)
  126. {
  127. QmpOutputVisitor *qov = to_qov(v);
  128. qmp_output_pop(qov);
  129. }
  130. static void qmp_output_type_int(Visitor *v, int64_t *obj, const char *name,
  131. Error **errp)
  132. {
  133. QmpOutputVisitor *qov = to_qov(v);
  134. qmp_output_add(qov, name, qint_from_int(*obj));
  135. }
  136. static void qmp_output_type_bool(Visitor *v, bool *obj, const char *name,
  137. Error **errp)
  138. {
  139. QmpOutputVisitor *qov = to_qov(v);
  140. qmp_output_add(qov, name, qbool_from_bool(*obj));
  141. }
  142. static void qmp_output_type_str(Visitor *v, char **obj, const char *name,
  143. Error **errp)
  144. {
  145. QmpOutputVisitor *qov = to_qov(v);
  146. if (*obj) {
  147. qmp_output_add(qov, name, qstring_from_str(*obj));
  148. } else {
  149. qmp_output_add(qov, name, qstring_from_str(""));
  150. }
  151. }
  152. static void qmp_output_type_number(Visitor *v, double *obj, const char *name,
  153. Error **errp)
  154. {
  155. QmpOutputVisitor *qov = to_qov(v);
  156. qmp_output_add(qov, name, qfloat_from_double(*obj));
  157. }
  158. QObject *qmp_output_get_qobject(QmpOutputVisitor *qov)
  159. {
  160. QObject *obj = qmp_output_first(qov);
  161. if (obj) {
  162. qobject_incref(obj);
  163. }
  164. return obj;
  165. }
  166. Visitor *qmp_output_get_visitor(QmpOutputVisitor *v)
  167. {
  168. return &v->visitor;
  169. }
  170. void qmp_output_visitor_cleanup(QmpOutputVisitor *v)
  171. {
  172. QStackEntry *e, *tmp;
  173. /* The bottom QStackEntry, if any, owns the root QObject. See the
  174. * qmp_output_push_obj() invocations in qmp_output_add_obj(). */
  175. QObject *root = QTAILQ_EMPTY(&v->stack) ? NULL : qmp_output_first(v);
  176. QTAILQ_FOREACH_SAFE(e, &v->stack, node, tmp) {
  177. QTAILQ_REMOVE(&v->stack, e, node);
  178. g_free(e);
  179. }
  180. qobject_decref(root);
  181. g_free(v);
  182. }
  183. QmpOutputVisitor *qmp_output_visitor_new(void)
  184. {
  185. QmpOutputVisitor *v;
  186. v = g_malloc0(sizeof(*v));
  187. v->visitor.start_struct = qmp_output_start_struct;
  188. v->visitor.end_struct = qmp_output_end_struct;
  189. v->visitor.start_list = qmp_output_start_list;
  190. v->visitor.next_list = qmp_output_next_list;
  191. v->visitor.end_list = qmp_output_end_list;
  192. v->visitor.type_enum = output_type_enum;
  193. v->visitor.type_int = qmp_output_type_int;
  194. v->visitor.type_bool = qmp_output_type_bool;
  195. v->visitor.type_str = qmp_output_type_str;
  196. v->visitor.type_number = qmp_output_type_number;
  197. QTAILQ_INIT(&v->stack);
  198. return v;
  199. }