string-input-visitor.c 9.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365
  1. /*
  2. * String parsing visitor
  3. *
  4. * Copyright Red Hat, Inc. 2012-2016
  5. *
  6. * Author: Paolo Bonzini <pbonzini@redhat.com>
  7. *
  8. * This work is licensed under the terms of the GNU LGPL, version 2.1 or later.
  9. * See the COPYING.LIB file in the top-level directory.
  10. *
  11. */
  12. #include "qemu/osdep.h"
  13. #include "qemu-common.h"
  14. #include "qapi/string-input-visitor.h"
  15. #include "qapi/visitor-impl.h"
  16. #include "qapi/qmp/qerror.h"
  17. #include "qemu/option.h"
  18. #include "qemu/queue.h"
  19. #include "qemu/range.h"
  20. struct StringInputVisitor
  21. {
  22. Visitor visitor;
  23. bool head;
  24. GList *ranges;
  25. GList *cur_range;
  26. int64_t cur;
  27. const char *string;
  28. };
  29. static StringInputVisitor *to_siv(Visitor *v)
  30. {
  31. return container_of(v, StringInputVisitor, visitor);
  32. }
  33. static void free_range(void *range, void *dummy)
  34. {
  35. g_free(range);
  36. }
  37. static void parse_str(StringInputVisitor *siv, Error **errp)
  38. {
  39. char *str = (char *) siv->string;
  40. long long start, end;
  41. Range *cur;
  42. char *endptr;
  43. if (siv->ranges) {
  44. return;
  45. }
  46. do {
  47. errno = 0;
  48. start = strtoll(str, &endptr, 0);
  49. if (errno == 0 && endptr > str) {
  50. if (*endptr == '\0') {
  51. cur = g_malloc0(sizeof(*cur));
  52. cur->begin = start;
  53. cur->end = start + 1;
  54. siv->ranges = g_list_insert_sorted_merged(siv->ranges, cur,
  55. range_compare);
  56. cur = NULL;
  57. str = NULL;
  58. } else if (*endptr == '-') {
  59. str = endptr + 1;
  60. errno = 0;
  61. end = strtoll(str, &endptr, 0);
  62. if (errno == 0 && endptr > str && start <= end &&
  63. (start > INT64_MAX - 65536 ||
  64. end < start + 65536)) {
  65. if (*endptr == '\0') {
  66. cur = g_malloc0(sizeof(*cur));
  67. cur->begin = start;
  68. cur->end = end + 1;
  69. siv->ranges =
  70. g_list_insert_sorted_merged(siv->ranges,
  71. cur,
  72. range_compare);
  73. cur = NULL;
  74. str = NULL;
  75. } else if (*endptr == ',') {
  76. str = endptr + 1;
  77. cur = g_malloc0(sizeof(*cur));
  78. cur->begin = start;
  79. cur->end = end + 1;
  80. siv->ranges =
  81. g_list_insert_sorted_merged(siv->ranges,
  82. cur,
  83. range_compare);
  84. cur = NULL;
  85. } else {
  86. goto error;
  87. }
  88. } else {
  89. goto error;
  90. }
  91. } else if (*endptr == ',') {
  92. str = endptr + 1;
  93. cur = g_malloc0(sizeof(*cur));
  94. cur->begin = start;
  95. cur->end = start + 1;
  96. siv->ranges = g_list_insert_sorted_merged(siv->ranges,
  97. cur,
  98. range_compare);
  99. cur = NULL;
  100. } else {
  101. goto error;
  102. }
  103. } else {
  104. goto error;
  105. }
  106. } while (str);
  107. return;
  108. error:
  109. g_list_foreach(siv->ranges, free_range, NULL);
  110. g_list_free(siv->ranges);
  111. siv->ranges = NULL;
  112. }
  113. static void
  114. start_list(Visitor *v, const char *name, Error **errp)
  115. {
  116. StringInputVisitor *siv = to_siv(v);
  117. parse_str(siv, errp);
  118. siv->cur_range = g_list_first(siv->ranges);
  119. if (siv->cur_range) {
  120. Range *r = siv->cur_range->data;
  121. if (r) {
  122. siv->cur = r->begin;
  123. }
  124. }
  125. }
  126. static GenericList *next_list(Visitor *v, GenericList **list, size_t size)
  127. {
  128. StringInputVisitor *siv = to_siv(v);
  129. GenericList **link;
  130. Range *r;
  131. if (!siv->ranges || !siv->cur_range) {
  132. return NULL;
  133. }
  134. r = siv->cur_range->data;
  135. if (!r) {
  136. return NULL;
  137. }
  138. if (siv->cur < r->begin || siv->cur >= r->end) {
  139. siv->cur_range = g_list_next(siv->cur_range);
  140. if (!siv->cur_range) {
  141. return NULL;
  142. }
  143. r = siv->cur_range->data;
  144. if (!r) {
  145. return NULL;
  146. }
  147. siv->cur = r->begin;
  148. }
  149. if (siv->head) {
  150. link = list;
  151. siv->head = false;
  152. } else {
  153. link = &(*list)->next;
  154. }
  155. *link = g_malloc0(size);
  156. return *link;
  157. }
  158. static void end_list(Visitor *v)
  159. {
  160. StringInputVisitor *siv = to_siv(v);
  161. siv->head = true;
  162. }
  163. static void parse_type_int64(Visitor *v, const char *name, int64_t *obj,
  164. Error **errp)
  165. {
  166. StringInputVisitor *siv = to_siv(v);
  167. if (!siv->string) {
  168. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  169. "integer");
  170. return;
  171. }
  172. parse_str(siv, errp);
  173. if (!siv->ranges) {
  174. goto error;
  175. }
  176. if (!siv->cur_range) {
  177. Range *r;
  178. siv->cur_range = g_list_first(siv->ranges);
  179. if (!siv->cur_range) {
  180. goto error;
  181. }
  182. r = siv->cur_range->data;
  183. if (!r) {
  184. goto error;
  185. }
  186. siv->cur = r->begin;
  187. }
  188. *obj = siv->cur;
  189. siv->cur++;
  190. return;
  191. error:
  192. error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name,
  193. "an int64 value or range");
  194. }
  195. static void parse_type_uint64(Visitor *v, const char *name, uint64_t *obj,
  196. Error **errp)
  197. {
  198. /* FIXME: parse_type_int64 mishandles values over INT64_MAX */
  199. int64_t i;
  200. Error *err = NULL;
  201. parse_type_int64(v, name, &i, &err);
  202. if (err) {
  203. error_propagate(errp, err);
  204. } else {
  205. *obj = i;
  206. }
  207. }
  208. static void parse_type_size(Visitor *v, const char *name, uint64_t *obj,
  209. Error **errp)
  210. {
  211. StringInputVisitor *siv = to_siv(v);
  212. Error *err = NULL;
  213. uint64_t val;
  214. if (siv->string) {
  215. parse_option_size(name, siv->string, &val, &err);
  216. } else {
  217. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  218. "size");
  219. return;
  220. }
  221. if (err) {
  222. error_propagate(errp, err);
  223. return;
  224. }
  225. *obj = val;
  226. }
  227. static void parse_type_bool(Visitor *v, const char *name, bool *obj,
  228. Error **errp)
  229. {
  230. StringInputVisitor *siv = to_siv(v);
  231. if (siv->string) {
  232. if (!strcasecmp(siv->string, "on") ||
  233. !strcasecmp(siv->string, "yes") ||
  234. !strcasecmp(siv->string, "true")) {
  235. *obj = true;
  236. return;
  237. }
  238. if (!strcasecmp(siv->string, "off") ||
  239. !strcasecmp(siv->string, "no") ||
  240. !strcasecmp(siv->string, "false")) {
  241. *obj = false;
  242. return;
  243. }
  244. }
  245. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  246. "boolean");
  247. }
  248. static void parse_type_str(Visitor *v, const char *name, char **obj,
  249. Error **errp)
  250. {
  251. StringInputVisitor *siv = to_siv(v);
  252. if (siv->string) {
  253. *obj = g_strdup(siv->string);
  254. } else {
  255. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  256. "string");
  257. }
  258. }
  259. static void parse_type_number(Visitor *v, const char *name, double *obj,
  260. Error **errp)
  261. {
  262. StringInputVisitor *siv = to_siv(v);
  263. char *endp = (char *) siv->string;
  264. double val;
  265. errno = 0;
  266. if (siv->string) {
  267. val = strtod(siv->string, &endp);
  268. }
  269. if (!siv->string || errno || endp == siv->string || *endp) {
  270. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  271. "number");
  272. return;
  273. }
  274. *obj = val;
  275. }
  276. static void parse_optional(Visitor *v, const char *name, bool *present)
  277. {
  278. StringInputVisitor *siv = to_siv(v);
  279. if (!siv->string) {
  280. *present = false;
  281. return;
  282. }
  283. *present = true;
  284. }
  285. Visitor *string_input_get_visitor(StringInputVisitor *v)
  286. {
  287. return &v->visitor;
  288. }
  289. void string_input_visitor_cleanup(StringInputVisitor *v)
  290. {
  291. g_list_foreach(v->ranges, free_range, NULL);
  292. g_list_free(v->ranges);
  293. g_free(v);
  294. }
  295. StringInputVisitor *string_input_visitor_new(const char *str)
  296. {
  297. StringInputVisitor *v;
  298. v = g_malloc0(sizeof(*v));
  299. v->visitor.type_enum = input_type_enum;
  300. v->visitor.type_int64 = parse_type_int64;
  301. v->visitor.type_uint64 = parse_type_uint64;
  302. v->visitor.type_size = parse_type_size;
  303. v->visitor.type_bool = parse_type_bool;
  304. v->visitor.type_str = parse_type_str;
  305. v->visitor.type_number = parse_type_number;
  306. v->visitor.start_list = start_list;
  307. v->visitor.next_list = next_list;
  308. v->visitor.end_list = end_list;
  309. v->visitor.optional = parse_optional;
  310. v->string = str;
  311. v->head = true;
  312. return v;
  313. }