string-input-visitor.c 8.6 KB

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