string-input-visitor.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426
  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 "qapi/qmp/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 void 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. }
  73. static GenericList *next_list(Visitor *v, GenericList *tail, size_t size)
  74. {
  75. StringInputVisitor *siv = to_siv(v);
  76. switch (siv->lm) {
  77. case LM_END:
  78. return NULL;
  79. case LM_INT64_RANGE:
  80. case LM_UINT64_RANGE:
  81. case LM_UNPARSED:
  82. /* we have an unparsed string or something left in a range */
  83. break;
  84. default:
  85. abort();
  86. }
  87. tail->next = g_malloc0(size);
  88. return tail->next;
  89. }
  90. static void check_list(Visitor *v, Error **errp)
  91. {
  92. const StringInputVisitor *siv = to_siv(v);
  93. switch (siv->lm) {
  94. case LM_INT64_RANGE:
  95. case LM_UINT64_RANGE:
  96. case LM_UNPARSED:
  97. error_setg(errp, "Fewer list elements expected");
  98. return;
  99. case LM_END:
  100. return;
  101. default:
  102. abort();
  103. }
  104. }
  105. static void end_list(Visitor *v, void **obj)
  106. {
  107. StringInputVisitor *siv = to_siv(v);
  108. assert(siv->lm != LM_NONE);
  109. assert(siv->list == obj);
  110. siv->list = NULL;
  111. siv->unparsed_string = NULL;
  112. siv->lm = LM_NONE;
  113. }
  114. static int try_parse_int64_list_entry(StringInputVisitor *siv, int64_t *obj)
  115. {
  116. const char *endptr;
  117. int64_t start, end;
  118. /* parse a simple int64 or range */
  119. if (qemu_strtoi64(siv->unparsed_string, &endptr, 0, &start)) {
  120. return -EINVAL;
  121. }
  122. end = start;
  123. switch (endptr[0]) {
  124. case '\0':
  125. siv->unparsed_string = endptr;
  126. break;
  127. case ',':
  128. siv->unparsed_string = endptr + 1;
  129. break;
  130. case '-':
  131. /* parse the end of the range */
  132. if (qemu_strtoi64(endptr + 1, &endptr, 0, &end)) {
  133. return -EINVAL;
  134. }
  135. if (start > end || end - start >= RANGE_MAX_ELEMENTS) {
  136. return -EINVAL;
  137. }
  138. switch (endptr[0]) {
  139. case '\0':
  140. siv->unparsed_string = endptr;
  141. break;
  142. case ',':
  143. siv->unparsed_string = endptr + 1;
  144. break;
  145. default:
  146. return -EINVAL;
  147. }
  148. break;
  149. default:
  150. return -EINVAL;
  151. }
  152. /* we have a proper range (with maybe only one element) */
  153. siv->lm = LM_INT64_RANGE;
  154. siv->rangeNext.i64 = start;
  155. siv->rangeEnd.i64 = end;
  156. return 0;
  157. }
  158. static void parse_type_int64(Visitor *v, const char *name, int64_t *obj,
  159. Error **errp)
  160. {
  161. StringInputVisitor *siv = to_siv(v);
  162. int64_t val;
  163. switch (siv->lm) {
  164. case LM_NONE:
  165. /* just parse a simple int64, bail out if not completely consumed */
  166. if (qemu_strtoi64(siv->string, NULL, 0, &val)) {
  167. error_setg(errp, QERR_INVALID_PARAMETER_VALUE,
  168. name ? name : "null", "int64");
  169. return;
  170. }
  171. *obj = val;
  172. return;
  173. case LM_UNPARSED:
  174. if (try_parse_int64_list_entry(siv, obj)) {
  175. error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name ? name : "null",
  176. "list of int64 values or ranges");
  177. return;
  178. }
  179. assert(siv->lm == LM_INT64_RANGE);
  180. /* fall through */
  181. case LM_INT64_RANGE:
  182. /* return the next element in the range */
  183. assert(siv->rangeNext.i64 <= siv->rangeEnd.i64);
  184. *obj = siv->rangeNext.i64++;
  185. if (siv->rangeNext.i64 > siv->rangeEnd.i64 || *obj == INT64_MAX) {
  186. /* end of range, check if there is more to parse */
  187. siv->lm = siv->unparsed_string[0] ? LM_UNPARSED : LM_END;
  188. }
  189. return;
  190. case LM_END:
  191. error_setg(errp, "Fewer list elements expected");
  192. return;
  193. default:
  194. abort();
  195. }
  196. }
  197. static int try_parse_uint64_list_entry(StringInputVisitor *siv, uint64_t *obj)
  198. {
  199. const char *endptr;
  200. uint64_t start, end;
  201. /* parse a simple uint64 or range */
  202. if (qemu_strtou64(siv->unparsed_string, &endptr, 0, &start)) {
  203. return -EINVAL;
  204. }
  205. end = start;
  206. switch (endptr[0]) {
  207. case '\0':
  208. siv->unparsed_string = endptr;
  209. break;
  210. case ',':
  211. siv->unparsed_string = endptr + 1;
  212. break;
  213. case '-':
  214. /* parse the end of the range */
  215. if (qemu_strtou64(endptr + 1, &endptr, 0, &end)) {
  216. return -EINVAL;
  217. }
  218. if (start > end || end - start >= RANGE_MAX_ELEMENTS) {
  219. return -EINVAL;
  220. }
  221. switch (endptr[0]) {
  222. case '\0':
  223. siv->unparsed_string = endptr;
  224. break;
  225. case ',':
  226. siv->unparsed_string = endptr + 1;
  227. break;
  228. default:
  229. return -EINVAL;
  230. }
  231. break;
  232. default:
  233. return -EINVAL;
  234. }
  235. /* we have a proper range (with maybe only one element) */
  236. siv->lm = LM_UINT64_RANGE;
  237. siv->rangeNext.u64 = start;
  238. siv->rangeEnd.u64 = end;
  239. return 0;
  240. }
  241. static void parse_type_uint64(Visitor *v, const char *name, uint64_t *obj,
  242. Error **errp)
  243. {
  244. StringInputVisitor *siv = to_siv(v);
  245. uint64_t val;
  246. switch (siv->lm) {
  247. case LM_NONE:
  248. /* just parse a simple uint64, bail out if not completely consumed */
  249. if (qemu_strtou64(siv->string, NULL, 0, &val)) {
  250. error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name ? name : "null",
  251. "uint64");
  252. return;
  253. }
  254. *obj = val;
  255. return;
  256. case LM_UNPARSED:
  257. if (try_parse_uint64_list_entry(siv, obj)) {
  258. error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name ? name : "null",
  259. "list of uint64 values or ranges");
  260. return;
  261. }
  262. assert(siv->lm == LM_UINT64_RANGE);
  263. /* fall through */
  264. case LM_UINT64_RANGE:
  265. /* return the next element in the range */
  266. assert(siv->rangeNext.u64 <= siv->rangeEnd.u64);
  267. *obj = siv->rangeNext.u64++;
  268. if (siv->rangeNext.u64 > siv->rangeEnd.u64 || *obj == UINT64_MAX) {
  269. /* end of range, check if there is more to parse */
  270. siv->lm = siv->unparsed_string[0] ? LM_UNPARSED : LM_END;
  271. }
  272. return;
  273. case LM_END:
  274. error_setg(errp, "Fewer list elements expected");
  275. return;
  276. default:
  277. abort();
  278. }
  279. }
  280. static void parse_type_size(Visitor *v, const char *name, uint64_t *obj,
  281. Error **errp)
  282. {
  283. StringInputVisitor *siv = to_siv(v);
  284. Error *err = NULL;
  285. uint64_t val;
  286. assert(siv->lm == LM_NONE);
  287. parse_option_size(name, siv->string, &val, &err);
  288. if (err) {
  289. error_propagate(errp, err);
  290. return;
  291. }
  292. *obj = val;
  293. }
  294. static void parse_type_bool(Visitor *v, const char *name, bool *obj,
  295. Error **errp)
  296. {
  297. StringInputVisitor *siv = to_siv(v);
  298. assert(siv->lm == LM_NONE);
  299. if (!strcasecmp(siv->string, "on") ||
  300. !strcasecmp(siv->string, "yes") ||
  301. !strcasecmp(siv->string, "true")) {
  302. *obj = true;
  303. return;
  304. }
  305. if (!strcasecmp(siv->string, "off") ||
  306. !strcasecmp(siv->string, "no") ||
  307. !strcasecmp(siv->string, "false")) {
  308. *obj = false;
  309. return;
  310. }
  311. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  312. "boolean");
  313. }
  314. static void parse_type_str(Visitor *v, const char *name, char **obj,
  315. Error **errp)
  316. {
  317. StringInputVisitor *siv = to_siv(v);
  318. assert(siv->lm == LM_NONE);
  319. *obj = g_strdup(siv->string);
  320. }
  321. static void parse_type_number(Visitor *v, const char *name, double *obj,
  322. Error **errp)
  323. {
  324. StringInputVisitor *siv = to_siv(v);
  325. double val;
  326. assert(siv->lm == LM_NONE);
  327. if (qemu_strtod_finite(siv->string, NULL, &val)) {
  328. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  329. "number");
  330. return;
  331. }
  332. *obj = val;
  333. }
  334. static void parse_type_null(Visitor *v, const char *name, QNull **obj,
  335. Error **errp)
  336. {
  337. StringInputVisitor *siv = to_siv(v);
  338. assert(siv->lm == LM_NONE);
  339. *obj = NULL;
  340. if (siv->string[0]) {
  341. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  342. "null");
  343. return;
  344. }
  345. *obj = qnull();
  346. }
  347. static void string_input_free(Visitor *v)
  348. {
  349. StringInputVisitor *siv = to_siv(v);
  350. g_free(siv);
  351. }
  352. Visitor *string_input_visitor_new(const char *str)
  353. {
  354. StringInputVisitor *v;
  355. assert(str);
  356. v = g_malloc0(sizeof(*v));
  357. v->visitor.type = VISITOR_INPUT;
  358. v->visitor.type_int64 = parse_type_int64;
  359. v->visitor.type_uint64 = parse_type_uint64;
  360. v->visitor.type_size = parse_type_size;
  361. v->visitor.type_bool = parse_type_bool;
  362. v->visitor.type_str = parse_type_str;
  363. v->visitor.type_number = parse_type_number;
  364. v->visitor.type_null = parse_type_null;
  365. v->visitor.start_list = start_list;
  366. v->visitor.next_list = next_list;
  367. v->visitor.check_list = check_list;
  368. v->visitor.end_list = end_list;
  369. v->visitor.free = string_input_free;
  370. v->string = str;
  371. v->lm = LM_NONE;
  372. return &v->visitor;
  373. }