string-output-visitor.c 9.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354
  1. /*
  2. * String printing 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-output-visitor.h"
  14. #include "qapi/visitor-impl.h"
  15. #include "qapi/qmp/qerror.h"
  16. #include "qemu/host-utils.h"
  17. #include <math.h>
  18. #include "qemu/range.h"
  19. enum ListMode {
  20. LM_NONE, /* not traversing a list of repeated options */
  21. LM_STARTED, /* start_list() succeeded */
  22. LM_IN_PROGRESS, /* next_list() has been called.
  23. *
  24. * Generating the next list link will consume the most
  25. * recently parsed QemuOpt instance of the repeated
  26. * option.
  27. *
  28. * Parsing a value into the list link will examine the
  29. * next QemuOpt instance of the repeated option, and
  30. * possibly enter LM_SIGNED_INTERVAL or
  31. * LM_UNSIGNED_INTERVAL.
  32. */
  33. LM_SIGNED_INTERVAL, /* next_list() has been called.
  34. *
  35. * Generating the next list link will consume the most
  36. * recently stored element from the signed interval,
  37. * parsed from the most recent QemuOpt instance of the
  38. * repeated option. This may consume QemuOpt itself
  39. * and return to LM_IN_PROGRESS.
  40. *
  41. * Parsing a value into the list link will store the
  42. * next element of the signed interval.
  43. */
  44. LM_UNSIGNED_INTERVAL,/* Same as above, only for an unsigned interval. */
  45. LM_END
  46. };
  47. typedef enum ListMode ListMode;
  48. struct StringOutputVisitor
  49. {
  50. Visitor visitor;
  51. bool human;
  52. GString *string;
  53. bool head;
  54. ListMode list_mode;
  55. union {
  56. int64_t s;
  57. uint64_t u;
  58. } range_start, range_end;
  59. GList *ranges;
  60. };
  61. static void string_output_set(StringOutputVisitor *sov, char *string)
  62. {
  63. if (sov->string) {
  64. g_string_free(sov->string, true);
  65. }
  66. sov->string = g_string_new(string);
  67. g_free(string);
  68. }
  69. static void string_output_append(StringOutputVisitor *sov, int64_t a)
  70. {
  71. Range *r = g_malloc0(sizeof(*r));
  72. r->begin = a;
  73. r->end = a + 1;
  74. sov->ranges = g_list_insert_sorted_merged(sov->ranges, r, range_compare);
  75. }
  76. static void string_output_append_range(StringOutputVisitor *sov,
  77. int64_t s, int64_t e)
  78. {
  79. Range *r = g_malloc0(sizeof(*r));
  80. r->begin = s;
  81. r->end = e + 1;
  82. sov->ranges = g_list_insert_sorted_merged(sov->ranges, r, range_compare);
  83. }
  84. static void format_string(StringOutputVisitor *sov, Range *r, bool next,
  85. bool human)
  86. {
  87. if (r->end - r->begin > 1) {
  88. if (human) {
  89. g_string_append_printf(sov->string, "0x%" PRIx64 "-0x%" PRIx64,
  90. r->begin, r->end - 1);
  91. } else {
  92. g_string_append_printf(sov->string, "%" PRId64 "-%" PRId64,
  93. r->begin, r->end - 1);
  94. }
  95. } else {
  96. if (human) {
  97. g_string_append_printf(sov->string, "0x%" PRIx64, r->begin);
  98. } else {
  99. g_string_append_printf(sov->string, "%" PRId64, r->begin);
  100. }
  101. }
  102. if (next) {
  103. g_string_append(sov->string, ",");
  104. }
  105. }
  106. static void print_type_int(Visitor *v, int64_t *obj, const char *name,
  107. Error **errp)
  108. {
  109. StringOutputVisitor *sov = DO_UPCAST(StringOutputVisitor, visitor, v);
  110. GList *l;
  111. switch (sov->list_mode) {
  112. case LM_NONE:
  113. string_output_append(sov, *obj);
  114. break;
  115. case LM_STARTED:
  116. sov->range_start.s = *obj;
  117. sov->range_end.s = *obj;
  118. sov->list_mode = LM_IN_PROGRESS;
  119. return;
  120. case LM_IN_PROGRESS:
  121. if (sov->range_end.s + 1 == *obj) {
  122. sov->range_end.s++;
  123. } else {
  124. if (sov->range_start.s == sov->range_end.s) {
  125. string_output_append(sov, sov->range_end.s);
  126. } else {
  127. assert(sov->range_start.s < sov->range_end.s);
  128. string_output_append_range(sov, sov->range_start.s,
  129. sov->range_end.s);
  130. }
  131. sov->range_start.s = *obj;
  132. sov->range_end.s = *obj;
  133. }
  134. return;
  135. case LM_END:
  136. if (sov->range_end.s + 1 == *obj) {
  137. sov->range_end.s++;
  138. assert(sov->range_start.s < sov->range_end.s);
  139. string_output_append_range(sov, sov->range_start.s,
  140. sov->range_end.s);
  141. } else {
  142. if (sov->range_start.s == sov->range_end.s) {
  143. string_output_append(sov, sov->range_end.s);
  144. } else {
  145. assert(sov->range_start.s < sov->range_end.s);
  146. string_output_append_range(sov, sov->range_start.s,
  147. sov->range_end.s);
  148. }
  149. string_output_append(sov, *obj);
  150. }
  151. break;
  152. default:
  153. abort();
  154. }
  155. l = sov->ranges;
  156. while (l) {
  157. Range *r = l->data;
  158. format_string(sov, r, l->next != NULL, false);
  159. l = l->next;
  160. }
  161. if (sov->human) {
  162. l = sov->ranges;
  163. g_string_append(sov->string, " (");
  164. while (l) {
  165. Range *r = l->data;
  166. format_string(sov, r, l->next != NULL, true);
  167. l = l->next;
  168. }
  169. g_string_append(sov->string, ")");
  170. }
  171. }
  172. static void print_type_size(Visitor *v, uint64_t *obj, const char *name,
  173. Error **errp)
  174. {
  175. StringOutputVisitor *sov = DO_UPCAST(StringOutputVisitor, visitor, v);
  176. static const char suffixes[] = { 'B', 'K', 'M', 'G', 'T', 'P', 'E' };
  177. uint64_t div, val;
  178. char *out;
  179. int i;
  180. if (!sov->human) {
  181. out = g_strdup_printf("%"PRIu64, *obj);
  182. string_output_set(sov, out);
  183. return;
  184. }
  185. val = *obj;
  186. /* The exponent (returned in i) minus one gives us
  187. * floor(log2(val * 1024 / 1000). The correction makes us
  188. * switch to the higher power when the integer part is >= 1000.
  189. */
  190. frexp(val / (1000.0 / 1024.0), &i);
  191. i = (i - 1) / 10;
  192. assert(i < ARRAY_SIZE(suffixes));
  193. div = 1ULL << (i * 10);
  194. out = g_strdup_printf("%"PRIu64" (%0.3g %c%s)", val,
  195. (double)val/div, suffixes[i], i ? "iB" : "");
  196. string_output_set(sov, out);
  197. }
  198. static void print_type_bool(Visitor *v, bool *obj, const char *name,
  199. Error **errp)
  200. {
  201. StringOutputVisitor *sov = DO_UPCAST(StringOutputVisitor, visitor, v);
  202. string_output_set(sov, g_strdup(*obj ? "true" : "false"));
  203. }
  204. static void print_type_str(Visitor *v, char **obj, const char *name,
  205. Error **errp)
  206. {
  207. StringOutputVisitor *sov = DO_UPCAST(StringOutputVisitor, visitor, v);
  208. char *out;
  209. if (sov->human) {
  210. out = *obj ? g_strdup_printf("\"%s\"", *obj) : g_strdup("<null>");
  211. } else {
  212. out = g_strdup(*obj ? *obj : "");
  213. }
  214. string_output_set(sov, out);
  215. }
  216. static void print_type_number(Visitor *v, double *obj, const char *name,
  217. Error **errp)
  218. {
  219. StringOutputVisitor *sov = DO_UPCAST(StringOutputVisitor, visitor, v);
  220. string_output_set(sov, g_strdup_printf("%f", *obj));
  221. }
  222. static void
  223. start_list(Visitor *v, const char *name, Error **errp)
  224. {
  225. StringOutputVisitor *sov = DO_UPCAST(StringOutputVisitor, visitor, v);
  226. /* we can't traverse a list in a list */
  227. assert(sov->list_mode == LM_NONE);
  228. sov->list_mode = LM_STARTED;
  229. sov->head = true;
  230. }
  231. static GenericList *
  232. next_list(Visitor *v, GenericList **list, Error **errp)
  233. {
  234. StringOutputVisitor *sov = DO_UPCAST(StringOutputVisitor, visitor, v);
  235. GenericList *ret = NULL;
  236. if (*list) {
  237. if (sov->head) {
  238. ret = *list;
  239. } else {
  240. ret = (*list)->next;
  241. }
  242. if (sov->head) {
  243. if (ret && ret->next == NULL) {
  244. sov->list_mode = LM_NONE;
  245. }
  246. sov->head = false;
  247. } else {
  248. if (ret && ret->next == NULL) {
  249. sov->list_mode = LM_END;
  250. }
  251. }
  252. }
  253. return ret;
  254. }
  255. static void
  256. end_list(Visitor *v, Error **errp)
  257. {
  258. StringOutputVisitor *sov = DO_UPCAST(StringOutputVisitor, visitor, v);
  259. assert(sov->list_mode == LM_STARTED ||
  260. sov->list_mode == LM_END ||
  261. sov->list_mode == LM_NONE ||
  262. sov->list_mode == LM_IN_PROGRESS);
  263. sov->list_mode = LM_NONE;
  264. sov->head = true;
  265. }
  266. char *string_output_get_string(StringOutputVisitor *sov)
  267. {
  268. char *string = g_string_free(sov->string, false);
  269. sov->string = NULL;
  270. return string;
  271. }
  272. Visitor *string_output_get_visitor(StringOutputVisitor *sov)
  273. {
  274. return &sov->visitor;
  275. }
  276. static void free_range(void *range, void *dummy)
  277. {
  278. g_free(range);
  279. }
  280. void string_output_visitor_cleanup(StringOutputVisitor *sov)
  281. {
  282. if (sov->string) {
  283. g_string_free(sov->string, true);
  284. }
  285. g_list_foreach(sov->ranges, free_range, NULL);
  286. g_list_free(sov->ranges);
  287. g_free(sov);
  288. }
  289. StringOutputVisitor *string_output_visitor_new(bool human)
  290. {
  291. StringOutputVisitor *v;
  292. v = g_malloc0(sizeof(*v));
  293. v->string = g_string_new(NULL);
  294. v->human = human;
  295. v->visitor.type_enum = output_type_enum;
  296. v->visitor.type_int = print_type_int;
  297. v->visitor.type_size = print_type_size;
  298. v->visitor.type_bool = print_type_bool;
  299. v->visitor.type_str = print_type_str;
  300. v->visitor.type_number = print_type_number;
  301. v->visitor.start_list = start_list;
  302. v->visitor.next_list = next_list;
  303. v->visitor.end_list = end_list;
  304. return v;
  305. }