You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

ucl_sexp.c 5.5KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226
  1. /*
  2. * Copyright (c) 2015, Vsevolod Stakhov
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions are met:
  7. * * Redistributions of source code must retain the above copyright
  8. * notice, this list of conditions and the following disclaimer.
  9. * * Redistributions in binary form must reproduce the above copyright
  10. * notice, this list of conditions and the following disclaimer in the
  11. * documentation and/or other materials provided with the distribution.
  12. *
  13. * THIS SOFTWARE IS PROVIDED BY AUTHOR ''AS IS'' AND ANY
  14. * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
  15. * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
  16. * DISCLAIMED. IN NO EVENT SHALL AUTHOR BE LIABLE FOR ANY
  17. * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
  18. * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  19. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
  20. * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  21. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  22. * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  23. */
  24. #ifdef HAVE_CONFIG_H
  25. #include "config.h"
  26. #endif
  27. #include <ucl.h>
  28. #include "ucl.h"
  29. #include "ucl_internal.h"
  30. #include "utlist.h"
  31. #define NEXT_STATE do { \
  32. if (p >= end) { \
  33. if (state != read_ebrace) { \
  34. ucl_create_err (&parser->err,\
  35. "extra data");\
  36. state = parse_err; \
  37. } \
  38. } \
  39. else { \
  40. switch (*p) { \
  41. case '(': \
  42. state = read_obrace; \
  43. break; \
  44. case ')': \
  45. state = read_ebrace; \
  46. break; \
  47. default: \
  48. len = 0; \
  49. mult = 1; \
  50. state = read_length; \
  51. break; \
  52. } \
  53. } \
  54. } while(0)
  55. bool
  56. ucl_parse_csexp (struct ucl_parser *parser)
  57. {
  58. const unsigned char *p, *end;
  59. ucl_object_t *obj;
  60. struct ucl_stack *st;
  61. uint64_t len = 0, mult = 1;
  62. enum {
  63. start_parse,
  64. read_obrace,
  65. read_length,
  66. read_value,
  67. read_ebrace,
  68. parse_err
  69. } state = start_parse;
  70. assert (parser != NULL);
  71. assert (parser->chunks != NULL);
  72. assert (parser->chunks->begin != NULL);
  73. assert (parser->chunks->remain != 0);
  74. p = parser->chunks->begin;
  75. end = p + parser->chunks->remain;
  76. while (p < end) {
  77. switch (state) {
  78. case start_parse:
  79. /* At this point we expect open brace */
  80. if (*p == '(') {
  81. state = read_obrace;
  82. }
  83. else {
  84. ucl_create_err (&parser->err, "bad starting character for "
  85. "sexp block: %x", (int)*p);
  86. state = parse_err;
  87. }
  88. break;
  89. case read_obrace:
  90. st = calloc (1, sizeof (*st));
  91. if (st == NULL) {
  92. ucl_create_err (&parser->err, "no memory");
  93. state = parse_err;
  94. continue;
  95. }
  96. st->obj = ucl_object_typed_new (UCL_ARRAY);
  97. if (st->obj == NULL) {
  98. ucl_create_err (&parser->err, "no memory");
  99. state = parse_err;
  100. free (st);
  101. continue;
  102. }
  103. if (parser->stack == NULL) {
  104. /* We have no stack */
  105. parser->stack = st;
  106. if (parser->top_obj == NULL) {
  107. parser->top_obj = st->obj;
  108. }
  109. }
  110. else {
  111. /* Prepend new element to the stack */
  112. LL_PREPEND (parser->stack, st);
  113. }
  114. p ++;
  115. NEXT_STATE;
  116. break;
  117. case read_length:
  118. if (*p == ':') {
  119. if (len == 0) {
  120. ucl_create_err (&parser->err, "zero length element");
  121. state = parse_err;
  122. continue;
  123. }
  124. state = read_value;
  125. }
  126. else if (*p >= '0' && *p <= '9') {
  127. len += (*p - '0') * mult;
  128. mult *= 10;
  129. if (len > UINT32_MAX) {
  130. ucl_create_err (&parser->err, "too big length of an "
  131. "element");
  132. state = parse_err;
  133. continue;
  134. }
  135. }
  136. else {
  137. ucl_create_err (&parser->err, "bad length character: %x",
  138. (int)*p);
  139. state = parse_err;
  140. continue;
  141. }
  142. p ++;
  143. break;
  144. case read_value:
  145. if ((uint64_t)(end - p) > len || len == 0) {
  146. ucl_create_err (&parser->err, "invalid length: %llu, %ld "
  147. "remain", (long long unsigned)len, (long)(end - p));
  148. state = parse_err;
  149. continue;
  150. }
  151. obj = ucl_object_typed_new (UCL_STRING);
  152. obj->value.sv = (const char*)p;
  153. obj->len = len;
  154. obj->flags |= UCL_OBJECT_BINARY;
  155. if (!(parser->flags & UCL_PARSER_ZEROCOPY)) {
  156. ucl_copy_value_trash (obj);
  157. }
  158. ucl_array_append (parser->stack->obj, obj);
  159. p += len;
  160. NEXT_STATE;
  161. break;
  162. case read_ebrace:
  163. if (parser->stack == NULL) {
  164. /* We have an extra end brace */
  165. ucl_create_err (&parser->err, "invalid length: %llu, %ld "
  166. "remain", (long long unsigned)len, (long)(end - p));
  167. state = parse_err;
  168. continue;
  169. }
  170. /* Pop the container */
  171. st = parser->stack;
  172. parser->stack = st->next;
  173. if (parser->stack->obj->type == UCL_ARRAY) {
  174. ucl_array_append (parser->stack->obj, st->obj);
  175. }
  176. else {
  177. ucl_create_err (&parser->err, "bad container object, array "
  178. "expected");
  179. state = parse_err;
  180. continue;
  181. }
  182. free (st);
  183. st = NULL;
  184. p++;
  185. NEXT_STATE;
  186. break;
  187. case parse_err:
  188. default:
  189. return false;
  190. }
  191. }
  192. if (state != read_ebrace) {
  193. ucl_create_err (&parser->err, "invalid finishing state: %d", state);
  194. return false;
  195. }
  196. return true;
  197. }