qobject-input-visitor.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455
  1. /*
  2. * Input Visitor
  3. *
  4. * Copyright (C) 2012-2016 Red Hat, Inc.
  5. * Copyright IBM, Corp. 2011
  6. *
  7. * Authors:
  8. * Anthony Liguori <aliguori@us.ibm.com>
  9. *
  10. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  11. * See the COPYING.LIB file in the top-level directory.
  12. *
  13. */
  14. #include "qemu/osdep.h"
  15. #include "qapi/error.h"
  16. #include "qapi/qobject-input-visitor.h"
  17. #include "qapi/visitor-impl.h"
  18. #include "qemu/queue.h"
  19. #include "qemu-common.h"
  20. #include "qapi/qmp/types.h"
  21. #include "qapi/qmp/qerror.h"
  22. #define QIV_STACK_SIZE 1024
  23. typedef struct StackObject
  24. {
  25. QObject *obj; /* Object being visited */
  26. void *qapi; /* sanity check that caller uses same pointer */
  27. GHashTable *h; /* If obj is dict: unvisited keys */
  28. const QListEntry *entry; /* If obj is list: unvisited tail */
  29. QSLIST_ENTRY(StackObject) node;
  30. } StackObject;
  31. struct QmpInputVisitor
  32. {
  33. Visitor visitor;
  34. /* Root of visit at visitor creation. */
  35. QObject *root;
  36. /* Stack of objects being visited (all entries will be either
  37. * QDict or QList). */
  38. QSLIST_HEAD(, StackObject) stack;
  39. /* True to reject parse in visit_end_struct() if unvisited keys remain. */
  40. bool strict;
  41. };
  42. static QmpInputVisitor *to_qiv(Visitor *v)
  43. {
  44. return container_of(v, QmpInputVisitor, visitor);
  45. }
  46. static QObject *qmp_input_get_object(QmpInputVisitor *qiv,
  47. const char *name,
  48. bool consume, Error **errp)
  49. {
  50. StackObject *tos;
  51. QObject *qobj;
  52. QObject *ret;
  53. if (QSLIST_EMPTY(&qiv->stack)) {
  54. /* Starting at root, name is ignored. */
  55. assert(qiv->root);
  56. return qiv->root;
  57. }
  58. /* We are in a container; find the next element. */
  59. tos = QSLIST_FIRST(&qiv->stack);
  60. qobj = tos->obj;
  61. assert(qobj);
  62. if (qobject_type(qobj) == QTYPE_QDICT) {
  63. assert(name);
  64. ret = qdict_get(qobject_to_qdict(qobj), name);
  65. if (tos->h && consume && ret) {
  66. bool removed = g_hash_table_remove(tos->h, name);
  67. assert(removed);
  68. }
  69. if (!ret) {
  70. error_setg(errp, QERR_MISSING_PARAMETER, name);
  71. }
  72. } else {
  73. assert(qobject_type(qobj) == QTYPE_QLIST);
  74. assert(!name);
  75. ret = qlist_entry_obj(tos->entry);
  76. assert(ret);
  77. if (consume) {
  78. tos->entry = qlist_next(tos->entry);
  79. }
  80. }
  81. return ret;
  82. }
  83. static void qdict_add_key(const char *key, QObject *obj, void *opaque)
  84. {
  85. GHashTable *h = opaque;
  86. g_hash_table_insert(h, (gpointer) key, NULL);
  87. }
  88. static const QListEntry *qmp_input_push(QmpInputVisitor *qiv, QObject *obj,
  89. void *qapi, Error **errp)
  90. {
  91. GHashTable *h;
  92. StackObject *tos = g_new0(StackObject, 1);
  93. assert(obj);
  94. tos->obj = obj;
  95. tos->qapi = qapi;
  96. if (qiv->strict && qobject_type(obj) == QTYPE_QDICT) {
  97. h = g_hash_table_new(g_str_hash, g_str_equal);
  98. qdict_iter(qobject_to_qdict(obj), qdict_add_key, h);
  99. tos->h = h;
  100. } else if (qobject_type(obj) == QTYPE_QLIST) {
  101. tos->entry = qlist_first(qobject_to_qlist(obj));
  102. }
  103. QSLIST_INSERT_HEAD(&qiv->stack, tos, node);
  104. return tos->entry;
  105. }
  106. static void qmp_input_check_struct(Visitor *v, Error **errp)
  107. {
  108. QmpInputVisitor *qiv = to_qiv(v);
  109. StackObject *tos = QSLIST_FIRST(&qiv->stack);
  110. assert(tos && !tos->entry);
  111. if (qiv->strict) {
  112. GHashTable *const top_ht = tos->h;
  113. if (top_ht) {
  114. GHashTableIter iter;
  115. const char *key;
  116. g_hash_table_iter_init(&iter, top_ht);
  117. if (g_hash_table_iter_next(&iter, (void **)&key, NULL)) {
  118. error_setg(errp, QERR_QMP_EXTRA_MEMBER, key);
  119. }
  120. }
  121. }
  122. }
  123. static void qmp_input_stack_object_free(StackObject *tos)
  124. {
  125. if (tos->h) {
  126. g_hash_table_unref(tos->h);
  127. }
  128. g_free(tos);
  129. }
  130. static void qmp_input_pop(Visitor *v, void **obj)
  131. {
  132. QmpInputVisitor *qiv = to_qiv(v);
  133. StackObject *tos = QSLIST_FIRST(&qiv->stack);
  134. assert(tos && tos->qapi == obj);
  135. QSLIST_REMOVE_HEAD(&qiv->stack, node);
  136. qmp_input_stack_object_free(tos);
  137. }
  138. static void qmp_input_start_struct(Visitor *v, const char *name, void **obj,
  139. size_t size, Error **errp)
  140. {
  141. QmpInputVisitor *qiv = to_qiv(v);
  142. QObject *qobj = qmp_input_get_object(qiv, name, true, errp);
  143. Error *err = NULL;
  144. if (obj) {
  145. *obj = NULL;
  146. }
  147. if (!qobj) {
  148. return;
  149. }
  150. if (qobject_type(qobj) != QTYPE_QDICT) {
  151. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  152. "QDict");
  153. return;
  154. }
  155. qmp_input_push(qiv, qobj, obj, &err);
  156. if (err) {
  157. error_propagate(errp, err);
  158. return;
  159. }
  160. if (obj) {
  161. *obj = g_malloc0(size);
  162. }
  163. }
  164. static void qmp_input_start_list(Visitor *v, const char *name,
  165. GenericList **list, size_t size, Error **errp)
  166. {
  167. QmpInputVisitor *qiv = to_qiv(v);
  168. QObject *qobj = qmp_input_get_object(qiv, name, true, errp);
  169. const QListEntry *entry;
  170. if (!qobj) {
  171. return;
  172. }
  173. if (qobject_type(qobj) != QTYPE_QLIST) {
  174. if (list) {
  175. *list = NULL;
  176. }
  177. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  178. "list");
  179. return;
  180. }
  181. entry = qmp_input_push(qiv, qobj, list, errp);
  182. if (list) {
  183. if (entry) {
  184. *list = g_malloc0(size);
  185. } else {
  186. *list = NULL;
  187. }
  188. }
  189. }
  190. static GenericList *qmp_input_next_list(Visitor *v, GenericList *tail,
  191. size_t size)
  192. {
  193. QmpInputVisitor *qiv = to_qiv(v);
  194. StackObject *so = QSLIST_FIRST(&qiv->stack);
  195. if (!so->entry) {
  196. return NULL;
  197. }
  198. tail->next = g_malloc0(size);
  199. return tail->next;
  200. }
  201. static void qmp_input_start_alternate(Visitor *v, const char *name,
  202. GenericAlternate **obj, size_t size,
  203. bool promote_int, Error **errp)
  204. {
  205. QmpInputVisitor *qiv = to_qiv(v);
  206. QObject *qobj = qmp_input_get_object(qiv, name, false, errp);
  207. if (!qobj) {
  208. *obj = NULL;
  209. return;
  210. }
  211. *obj = g_malloc0(size);
  212. (*obj)->type = qobject_type(qobj);
  213. if (promote_int && (*obj)->type == QTYPE_QINT) {
  214. (*obj)->type = QTYPE_QFLOAT;
  215. }
  216. }
  217. static void qmp_input_type_int64(Visitor *v, const char *name, int64_t *obj,
  218. Error **errp)
  219. {
  220. QmpInputVisitor *qiv = to_qiv(v);
  221. QObject *qobj = qmp_input_get_object(qiv, name, true, errp);
  222. QInt *qint;
  223. if (!qobj) {
  224. return;
  225. }
  226. qint = qobject_to_qint(qobj);
  227. if (!qint) {
  228. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  229. "integer");
  230. return;
  231. }
  232. *obj = qint_get_int(qint);
  233. }
  234. static void qmp_input_type_uint64(Visitor *v, const char *name, uint64_t *obj,
  235. Error **errp)
  236. {
  237. /* FIXME: qobject_to_qint mishandles values over INT64_MAX */
  238. QmpInputVisitor *qiv = to_qiv(v);
  239. QObject *qobj = qmp_input_get_object(qiv, name, true, errp);
  240. QInt *qint;
  241. if (!qobj) {
  242. return;
  243. }
  244. qint = qobject_to_qint(qobj);
  245. if (!qint) {
  246. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  247. "integer");
  248. return;
  249. }
  250. *obj = qint_get_int(qint);
  251. }
  252. static void qmp_input_type_bool(Visitor *v, const char *name, bool *obj,
  253. Error **errp)
  254. {
  255. QmpInputVisitor *qiv = to_qiv(v);
  256. QObject *qobj = qmp_input_get_object(qiv, name, true, errp);
  257. QBool *qbool;
  258. if (!qobj) {
  259. return;
  260. }
  261. qbool = qobject_to_qbool(qobj);
  262. if (!qbool) {
  263. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  264. "boolean");
  265. return;
  266. }
  267. *obj = qbool_get_bool(qbool);
  268. }
  269. static void qmp_input_type_str(Visitor *v, const char *name, char **obj,
  270. Error **errp)
  271. {
  272. QmpInputVisitor *qiv = to_qiv(v);
  273. QObject *qobj = qmp_input_get_object(qiv, name, true, errp);
  274. QString *qstr;
  275. *obj = NULL;
  276. if (!qobj) {
  277. return;
  278. }
  279. qstr = qobject_to_qstring(qobj);
  280. if (!qstr) {
  281. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  282. "string");
  283. return;
  284. }
  285. *obj = g_strdup(qstring_get_str(qstr));
  286. }
  287. static void qmp_input_type_number(Visitor *v, const char *name, double *obj,
  288. Error **errp)
  289. {
  290. QmpInputVisitor *qiv = to_qiv(v);
  291. QObject *qobj = qmp_input_get_object(qiv, name, true, errp);
  292. QInt *qint;
  293. QFloat *qfloat;
  294. if (!qobj) {
  295. return;
  296. }
  297. qint = qobject_to_qint(qobj);
  298. if (qint) {
  299. *obj = qint_get_int(qobject_to_qint(qobj));
  300. return;
  301. }
  302. qfloat = qobject_to_qfloat(qobj);
  303. if (qfloat) {
  304. *obj = qfloat_get_double(qobject_to_qfloat(qobj));
  305. return;
  306. }
  307. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  308. "number");
  309. }
  310. static void qmp_input_type_any(Visitor *v, const char *name, QObject **obj,
  311. Error **errp)
  312. {
  313. QmpInputVisitor *qiv = to_qiv(v);
  314. QObject *qobj = qmp_input_get_object(qiv, name, true, errp);
  315. *obj = NULL;
  316. if (!qobj) {
  317. return;
  318. }
  319. qobject_incref(qobj);
  320. *obj = qobj;
  321. }
  322. static void qmp_input_type_null(Visitor *v, const char *name, Error **errp)
  323. {
  324. QmpInputVisitor *qiv = to_qiv(v);
  325. QObject *qobj = qmp_input_get_object(qiv, name, true, errp);
  326. if (!qobj) {
  327. return;
  328. }
  329. if (qobject_type(qobj) != QTYPE_QNULL) {
  330. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  331. "null");
  332. }
  333. }
  334. static void qmp_input_optional(Visitor *v, const char *name, bool *present)
  335. {
  336. QmpInputVisitor *qiv = to_qiv(v);
  337. QObject *qobj = qmp_input_get_object(qiv, name, false, NULL);
  338. if (!qobj) {
  339. *present = false;
  340. return;
  341. }
  342. *present = true;
  343. }
  344. static void qmp_input_free(Visitor *v)
  345. {
  346. QmpInputVisitor *qiv = to_qiv(v);
  347. while (!QSLIST_EMPTY(&qiv->stack)) {
  348. StackObject *tos = QSLIST_FIRST(&qiv->stack);
  349. QSLIST_REMOVE_HEAD(&qiv->stack, node);
  350. qmp_input_stack_object_free(tos);
  351. }
  352. qobject_decref(qiv->root);
  353. g_free(qiv);
  354. }
  355. Visitor *qmp_input_visitor_new(QObject *obj, bool strict)
  356. {
  357. QmpInputVisitor *v;
  358. assert(obj);
  359. v = g_malloc0(sizeof(*v));
  360. v->visitor.type = VISITOR_INPUT;
  361. v->visitor.start_struct = qmp_input_start_struct;
  362. v->visitor.check_struct = qmp_input_check_struct;
  363. v->visitor.end_struct = qmp_input_pop;
  364. v->visitor.start_list = qmp_input_start_list;
  365. v->visitor.next_list = qmp_input_next_list;
  366. v->visitor.end_list = qmp_input_pop;
  367. v->visitor.start_alternate = qmp_input_start_alternate;
  368. v->visitor.type_int64 = qmp_input_type_int64;
  369. v->visitor.type_uint64 = qmp_input_type_uint64;
  370. v->visitor.type_bool = qmp_input_type_bool;
  371. v->visitor.type_str = qmp_input_type_str;
  372. v->visitor.type_number = qmp_input_type_number;
  373. v->visitor.type_any = qmp_input_type_any;
  374. v->visitor.type_null = qmp_input_type_null;
  375. v->visitor.optional = qmp_input_optional;
  376. v->visitor.free = qmp_input_free;
  377. v->strict = strict;
  378. v->root = obj;
  379. qobject_incref(obj);
  380. return &v->visitor;
  381. }