string-input-visitor.c 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352
  1. /*
  2. * String parsing visitor
  3. *
  4. * Copyright Red Hat, Inc. 2012
  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 *
  127. next_list(Visitor *v, GenericList **list, Error **errp)
  128. {
  129. StringInputVisitor *siv = to_siv(v);
  130. GenericList **link;
  131. Range *r;
  132. if (!siv->ranges || !siv->cur_range) {
  133. return NULL;
  134. }
  135. r = siv->cur_range->data;
  136. if (!r) {
  137. return NULL;
  138. }
  139. if (siv->cur < r->begin || siv->cur >= r->end) {
  140. siv->cur_range = g_list_next(siv->cur_range);
  141. if (!siv->cur_range) {
  142. return NULL;
  143. }
  144. r = siv->cur_range->data;
  145. if (!r) {
  146. return NULL;
  147. }
  148. siv->cur = r->begin;
  149. }
  150. if (siv->head) {
  151. link = list;
  152. siv->head = false;
  153. } else {
  154. link = &(*list)->next;
  155. }
  156. *link = g_malloc0(sizeof **link);
  157. return *link;
  158. }
  159. static void
  160. end_list(Visitor *v, Error **errp)
  161. {
  162. StringInputVisitor *siv = to_siv(v);
  163. siv->head = true;
  164. }
  165. static void parse_type_int64(Visitor *v, int64_t *obj, const char *name,
  166. Error **errp)
  167. {
  168. StringInputVisitor *siv = to_siv(v);
  169. if (!siv->string) {
  170. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  171. "integer");
  172. return;
  173. }
  174. parse_str(siv, errp);
  175. if (!siv->ranges) {
  176. goto error;
  177. }
  178. if (!siv->cur_range) {
  179. Range *r;
  180. siv->cur_range = g_list_first(siv->ranges);
  181. if (!siv->cur_range) {
  182. goto error;
  183. }
  184. r = siv->cur_range->data;
  185. if (!r) {
  186. goto error;
  187. }
  188. siv->cur = r->begin;
  189. }
  190. *obj = siv->cur;
  191. siv->cur++;
  192. return;
  193. error:
  194. error_setg(errp, QERR_INVALID_PARAMETER_VALUE, name,
  195. "an int64 value or range");
  196. }
  197. static void parse_type_size(Visitor *v, uint64_t *obj, const char *name,
  198. Error **errp)
  199. {
  200. StringInputVisitor *siv = to_siv(v);
  201. Error *err = NULL;
  202. uint64_t val;
  203. if (siv->string) {
  204. parse_option_size(name, siv->string, &val, &err);
  205. } else {
  206. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  207. "size");
  208. return;
  209. }
  210. if (err) {
  211. error_propagate(errp, err);
  212. return;
  213. }
  214. *obj = val;
  215. }
  216. static void parse_type_bool(Visitor *v, bool *obj, const char *name,
  217. Error **errp)
  218. {
  219. StringInputVisitor *siv = to_siv(v);
  220. if (siv->string) {
  221. if (!strcasecmp(siv->string, "on") ||
  222. !strcasecmp(siv->string, "yes") ||
  223. !strcasecmp(siv->string, "true")) {
  224. *obj = true;
  225. return;
  226. }
  227. if (!strcasecmp(siv->string, "off") ||
  228. !strcasecmp(siv->string, "no") ||
  229. !strcasecmp(siv->string, "false")) {
  230. *obj = false;
  231. return;
  232. }
  233. }
  234. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  235. "boolean");
  236. }
  237. static void parse_type_str(Visitor *v, char **obj, const char *name,
  238. Error **errp)
  239. {
  240. StringInputVisitor *siv = to_siv(v);
  241. if (siv->string) {
  242. *obj = g_strdup(siv->string);
  243. } else {
  244. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  245. "string");
  246. }
  247. }
  248. static void parse_type_number(Visitor *v, double *obj, const char *name,
  249. Error **errp)
  250. {
  251. StringInputVisitor *siv = to_siv(v);
  252. char *endp = (char *) siv->string;
  253. double val;
  254. errno = 0;
  255. if (siv->string) {
  256. val = strtod(siv->string, &endp);
  257. }
  258. if (!siv->string || errno || endp == siv->string || *endp) {
  259. error_setg(errp, QERR_INVALID_PARAMETER_TYPE, name ? name : "null",
  260. "number");
  261. return;
  262. }
  263. *obj = val;
  264. }
  265. static void parse_optional(Visitor *v, bool *present, const char *name)
  266. {
  267. StringInputVisitor *siv = to_siv(v);
  268. if (!siv->string) {
  269. *present = false;
  270. return;
  271. }
  272. *present = true;
  273. }
  274. Visitor *string_input_get_visitor(StringInputVisitor *v)
  275. {
  276. return &v->visitor;
  277. }
  278. void string_input_visitor_cleanup(StringInputVisitor *v)
  279. {
  280. g_list_foreach(v->ranges, free_range, NULL);
  281. g_list_free(v->ranges);
  282. g_free(v);
  283. }
  284. StringInputVisitor *string_input_visitor_new(const char *str)
  285. {
  286. StringInputVisitor *v;
  287. v = g_malloc0(sizeof(*v));
  288. v->visitor.type_enum = input_type_enum;
  289. v->visitor.type_int64 = parse_type_int64;
  290. v->visitor.type_size = parse_type_size;
  291. v->visitor.type_bool = parse_type_bool;
  292. v->visitor.type_str = parse_type_str;
  293. v->visitor.type_number = parse_type_number;
  294. v->visitor.start_list = start_list;
  295. v->visitor.next_list = next_list;
  296. v->visitor.end_list = end_list;
  297. v->visitor.optional = parse_optional;
  298. v->string = str;
  299. v->head = true;
  300. return v;
  301. }