2
0

string-input-visitor.c 9.0 KB

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