string-input-visitor.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414
  1. /*
  2. * String parsing visitor
  3. *
  4. * Copyright Red Hat, Inc. 2012-2016
  5. *
  6. * Author: Paolo Bonzini <pbonzini@redhat.com>
  7. * David Hildenbrand <david@redhat.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. #include "qemu/osdep.h"
  13. #include "qapi/error.h"
  14. #include "qapi/string-input-visitor.h"
  15. #include "qapi/visitor-impl.h"
  16. #include "qapi/qmp/qerror.h"
  17. #include "qobject/qnull.h"
  18. #include "qemu/option.h"
  19. #include "qemu/cutils.h"
  20. typedef enum ListMode {
  21. /* no list parsing active / no list expected */
  22. LM_NONE,
  23. /* we have an unparsed string remaining */
  24. LM_UNPARSED,
  25. /* we have an unfinished int64 range */
  26. LM_INT64_RANGE,
  27. /* we have an unfinished uint64 range */
  28. LM_UINT64_RANGE,
  29. /* we have parsed the string completely and no range is remaining */
  30. LM_END,
  31. } ListMode;
  32. /* protect against DOS attacks, limit the amount of elements per range */
  33. #define RANGE_MAX_ELEMENTS 65536
  34. typedef union RangeElement {
  35. int64_t i64;
  36. uint64_t u64;
  37. } RangeElement;
  38. struct StringInputVisitor
  39. {
  40. Visitor visitor;
  41. /* List parsing state */
  42. ListMode lm;
  43. RangeElement rangeNext;
  44. RangeElement rangeEnd;
  45. const char *unparsed_string;
  46. void *list;
  47. /* The original string to parse */
  48. const char *string;
  49. };
  50. static StringInputVisitor *to_siv(Visitor *v)
  51. {
  52. return container_of(v, StringInputVisitor, visitor);
  53. }
  54. static bool start_list(Visitor *v, const char *name, GenericList **list,
  55. size_t size, Error **errp)
  56. {
  57. StringInputVisitor *siv = to_siv(v);
  58. assert(siv->lm == LM_NONE);
  59. siv->list = list;
  60. siv->unparsed_string = siv->string;
  61. if (!siv->string[0]) {
  62. if (list) {
  63. *list = NULL;
  64. }
  65. siv->lm = LM_END;
  66. } else {
  67. if (list) {
  68. *list = g_malloc0(size);
  69. }
  70. siv->lm = LM_UNPARSED;
  71. }
  72. return true;
  73. }
  74. static GenericList *next_list(Visitor *v, GenericList *tail, size_t size)
  75. {
  76. StringInputVisitor *siv = to_siv(v);
  77. switch (siv->lm) {
  78. case LM_END:
  79. return NULL;
  80. case LM_INT64_RANGE:
  81. case LM_UINT64_RANGE:
  82. case LM_UNPARSED:
  83. /* we have an unparsed string or something left in a range */
  84. break;
  85. default:
  86. abort();
  87. }
  88. tail->next = g_malloc0(size);
  89. return tail->next;
  90. }
  91. static bool check_list(Visitor *v, Error **errp)
  92. {
  93. const StringInputVisitor *siv = to_siv(v);
  94. switch (siv->lm) {
  95. case LM_INT64_RANGE:
  96. case LM_UINT64_RANGE:
  97. case LM_UNPARSED:
  98. error_setg(errp, "Fewer list elements expected");
  99. return false;
  100. case LM_END:
  101. return true;
  102. default:
  103. abort();
  104. }
  105. }
  106. static void end_list(Visitor *v, void **obj)
  107. {
  108. StringInputVisitor *siv = to_siv(v);
  109. assert(siv->lm != LM_NONE);
  110. assert(siv->list == obj);
  111. siv->list = NULL;
  112. siv->unparsed_string = NULL;
  113. siv->lm = LM_NONE;
  114. }
  115. static int try_parse_int64_list_entry(StringInputVisitor *siv, int64_t *obj)
  116. {
  117. const char *endptr;
  118. int64_t start, end;
  119. /* parse a simple int64 or range */
  120. if (qemu_strtoi64(siv->unparsed_string, &endptr, 0, &start)) {
  121. return -EINVAL;
  122. }
  123. end = start;
  124. switch (endptr[0]) {
  125. case '\0':
  126. siv->unparsed_string = endptr;
  127. break;
  128. case ',':
  129. siv->unparsed_string = endptr + 1;
  130. break;
  131. case '-':
  132. /* parse the end of the range */
  133. if (qemu_strtoi64(endptr + 1, &endptr, 0, &end)) {
  134. return -EINVAL;
  135. }
  136. if (start > end || end - start >= RANGE_MAX_ELEMENTS) {
  137. return -EINVAL;
  138. }
  139. switch (endptr[0]) {
  140. case '\0':
  141. siv->unparsed_string = endptr;
  142. break;
  143. case ',':
  144. siv->unparsed_string = endptr + 1;
  145. break;
  146. default:
  147. return -EINVAL;
  148. }
  149. break;
  150. default:
  151. return -EINVAL;
  152. }
  153. /* we have a proper range (with maybe only one element) */
  154. siv->lm = LM_INT64_RANGE;
  155. siv->rangeNext.i64 = start;
  156. siv->rangeEnd.i64 = end;
  157. return 0;
  158. }
  159. static bool parse_type_int64(Visitor *v, const char *name, int64_t *obj,
  160. Error **errp)
  161. {
  162. StringInputVisitor *siv = to_siv(v);
  163. int64_t val;
  164. switch (siv->lm) {
  165. case LM_NONE:
  166. /* just parse a simple int64, bail out if not completely consumed */
  167. if (qemu_strtoi64(siv->string, NULL, 0, &val)) {
  168. error_setg(errp, QERR_INVALID_PARAMETER_VALUE,
  169. name ? name : "null", "int64");
  170. return false;
  171. }
  172. *obj = val;
  173. return true;
  174. case LM_UNPARSED:
  175. if (try_parse_int64_list_entry(siv, obj)) {
  176. error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name ? name : "null",
  177. "list of int64 values or ranges");
  178. return false;
  179. }
  180. assert(siv->lm == LM_INT64_RANGE);
  181. /* fall through */
  182. case LM_INT64_RANGE:
  183. /* return the next element in the range */
  184. assert(siv->rangeNext.i64 <= siv->rangeEnd.i64);
  185. *obj = siv->rangeNext.i64++;
  186. if (siv->rangeNext.i64 > siv->rangeEnd.i64 || *obj == INT64_MAX) {
  187. /* end of range, check if there is more to parse */
  188. siv->lm = siv->unparsed_string[0] ? LM_UNPARSED : LM_END;
  189. }
  190. return true;
  191. case LM_END:
  192. error_setg(errp, "Fewer list elements expected");
  193. return false;
  194. default:
  195. abort();
  196. }
  197. }
  198. static int try_parse_uint64_list_entry(StringInputVisitor *siv, uint64_t *obj)
  199. {
  200. const char *endptr;
  201. uint64_t start, end;
  202. /* parse a simple uint64 or range */
  203. if (qemu_strtou64(siv->unparsed_string, &endptr, 0, &start)) {
  204. return -EINVAL;
  205. }
  206. end = start;
  207. switch (endptr[0]) {
  208. case '\0':
  209. siv->unparsed_string = endptr;
  210. break;
  211. case ',':
  212. siv->unparsed_string = endptr + 1;
  213. break;
  214. case '-':
  215. /* parse the end of the range */
  216. if (qemu_strtou64(endptr + 1, &endptr, 0, &end)) {
  217. return -EINVAL;
  218. }
  219. if (start > end || end - start >= RANGE_MAX_ELEMENTS) {
  220. return -EINVAL;
  221. }
  222. switch (endptr[0]) {
  223. case '\0':
  224. siv->unparsed_string = endptr;
  225. break;
  226. case ',':
  227. siv->unparsed_string = endptr + 1;
  228. break;
  229. default:
  230. return -EINVAL;
  231. }
  232. break;
  233. default:
  234. return -EINVAL;
  235. }
  236. /* we have a proper range (with maybe only one element) */
  237. siv->lm = LM_UINT64_RANGE;
  238. siv->rangeNext.u64 = start;
  239. siv->rangeEnd.u64 = end;
  240. return 0;
  241. }
  242. static bool parse_type_uint64(Visitor *v, const char *name, uint64_t *obj,
  243. Error **errp)
  244. {
  245. StringInputVisitor *siv = to_siv(v);
  246. uint64_t val;
  247. switch (siv->lm) {
  248. case LM_NONE:
  249. /* just parse a simple uint64, bail out if not completely consumed */
  250. if (qemu_strtou64(siv->string, NULL, 0, &val)) {
  251. error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name ? name : "null",
  252. "uint64");
  253. return false;
  254. }
  255. *obj = val;
  256. return true;
  257. case LM_UNPARSED:
  258. if (try_parse_uint64_list_entry(siv, obj)) {
  259. error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name ? name : "null",
  260. "list of uint64 values or ranges");
  261. return false;
  262. }
  263. assert(siv->lm == LM_UINT64_RANGE);
  264. /* fall through */
  265. case LM_UINT64_RANGE:
  266. /* return the next element in the range */
  267. assert(siv->rangeNext.u64 <= siv->rangeEnd.u64);
  268. *obj = siv->rangeNext.u64++;
  269. if (siv->rangeNext.u64 > siv->rangeEnd.u64 || *obj == UINT64_MAX) {
  270. /* end of range, check if there is more to parse */
  271. siv->lm = siv->unparsed_string[0] ? LM_UNPARSED : LM_END;
  272. }
  273. return true;
  274. case LM_END:
  275. error_setg(errp, "Fewer list elements expected");
  276. return false;
  277. default:
  278. abort();
  279. }
  280. }
  281. static bool parse_type_size(Visitor *v, const char *name, uint64_t *obj,
  282. Error **errp)
  283. {
  284. StringInputVisitor *siv = to_siv(v);
  285. uint64_t val;
  286. assert(siv->lm == LM_NONE);
  287. if (!parse_option_size(name, siv->string, &val, errp)) {
  288. return false;
  289. }
  290. *obj = val;
  291. return true;
  292. }
  293. static bool parse_type_bool(Visitor *v, const char *name, bool *obj,
  294. Error **errp)
  295. {
  296. StringInputVisitor *siv = to_siv(v);
  297. assert(siv->lm == LM_NONE);
  298. return qapi_bool_parse(name ? name : "null", siv->string, obj, errp);
  299. }
  300. static bool parse_type_str(Visitor *v, const char *name, char **obj,
  301. Error **errp)
  302. {
  303. StringInputVisitor *siv = to_siv(v);
  304. assert(siv->lm == LM_NONE);
  305. *obj = g_strdup(siv->string);
  306. return true;
  307. }
  308. static bool parse_type_number(Visitor *v, const char *name, double *obj,
  309. Error **errp)
  310. {
  311. StringInputVisitor *siv = to_siv(v);
  312. double val;
  313. assert(siv->lm == LM_NONE);
  314. if (qemu_strtod_finite(siv->string, NULL, &val)) {
  315. error_setg(errp, "Invalid parameter type for '%s', expected: number",
  316. name ? name : "null");
  317. return false;
  318. }
  319. *obj = val;
  320. return true;
  321. }
  322. static bool parse_type_null(Visitor *v, const char *name, QNull **obj,
  323. Error **errp)
  324. {
  325. StringInputVisitor *siv = to_siv(v);
  326. assert(siv->lm == LM_NONE);
  327. *obj = NULL;
  328. if (siv->string[0]) {
  329. error_setg(errp, "Invalid parameter type for '%s', expected: null",
  330. name ? name : "null");
  331. return false;
  332. }
  333. *obj = qnull();
  334. return true;
  335. }
  336. static void string_input_free(Visitor *v)
  337. {
  338. StringInputVisitor *siv = to_siv(v);
  339. g_free(siv);
  340. }
  341. Visitor *string_input_visitor_new(const char *str)
  342. {
  343. StringInputVisitor *v;
  344. assert(str);
  345. v = g_malloc0(sizeof(*v));
  346. v->visitor.type = VISITOR_INPUT;
  347. v->visitor.type_int64 = parse_type_int64;
  348. v->visitor.type_uint64 = parse_type_uint64;
  349. v->visitor.type_size = parse_type_size;
  350. v->visitor.type_bool = parse_type_bool;
  351. v->visitor.type_str = parse_type_str;
  352. v->visitor.type_number = parse_type_number;
  353. v->visitor.type_null = parse_type_null;
  354. v->visitor.start_list = start_list;
  355. v->visitor.next_list = next_list;
  356. v->visitor.check_list = check_list;
  357. v->visitor.end_list = end_list;
  358. v->visitor.free = string_input_free;
  359. v->string = str;
  360. v->lm = LM_NONE;
  361. return &v->visitor;
  362. }