string-input-visitor.c 8.8 KB

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