string-input-visitor.c 8.5 KB

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