jsmn.cpp 5.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255
  1. #include <stdlib.h>
  2. #include "jsmn.h"
  3. /**
  4. * Allocates a fresh unused token from the token pull.
  5. */
  6. static jsmntok_t *jsmn_alloc_token(jsmn_parser *parser,
  7. jsmntok_t *tokens, size_t num_tokens) {
  8. jsmntok_t *tok;
  9. if (parser->toknext >= num_tokens) {
  10. return NULL;
  11. }
  12. tok = &tokens[parser->toknext++];
  13. tok->start = tok->end = -1;
  14. tok->size = 0;
  15. #ifdef JSMN_PARENT_LINKS
  16. tok->parent = -1;
  17. #endif
  18. return tok;
  19. }
  20. /**
  21. * Fills token type and boundaries.
  22. */
  23. static void jsmn_fill_token(jsmntok_t *token, jsmntype_t type,
  24. int start, int end) {
  25. token->type = type;
  26. token->start = start;
  27. token->end = end;
  28. token->size = 0;
  29. }
  30. /**
  31. * Fills next available token with JSON primitive.
  32. */
  33. static jsmnerr_t jsmn_parse_primitive(jsmn_parser *parser, const char *js,
  34. jsmntok_t *tokens, size_t num_tokens) {
  35. jsmntok_t *token;
  36. int start;
  37. start = parser->pos;
  38. for (; js[parser->pos] != '\0'; parser->pos++) {
  39. switch (js[parser->pos]) {
  40. #ifndef JSMN_STRICT
  41. /* In strict mode primitive must be followed by "," or "}" or "]" */
  42. case ':':
  43. #endif
  44. case '\t' : case '\r' : case '\n' : case ' ' :
  45. case ',' : case ']' : case '}' :
  46. goto found;
  47. }
  48. if (js[parser->pos] < 32 || js[parser->pos] >= 127) {
  49. parser->pos = start;
  50. return JSMN_ERROR_INVAL;
  51. }
  52. }
  53. #ifdef JSMN_STRICT
  54. /* In strict mode primitive must be followed by a comma/object/array */
  55. parser->pos = start;
  56. return JSMN_ERROR_PART;
  57. #endif
  58. found:
  59. token = jsmn_alloc_token(parser, tokens, num_tokens);
  60. if (token == NULL) {
  61. parser->pos = start;
  62. return JSMN_ERROR_NOMEM;
  63. }
  64. jsmn_fill_token(token, JSMN_PRIMITIVE, start, parser->pos);
  65. #ifdef JSMN_PARENT_LINKS
  66. token->parent = parser->toksuper;
  67. #endif
  68. parser->pos--;
  69. return JSMN_SUCCESS;
  70. }
  71. /**
  72. * Filsl next token with JSON string.
  73. */
  74. static jsmnerr_t jsmn_parse_string(jsmn_parser *parser, const char *js,
  75. jsmntok_t *tokens, size_t num_tokens) {
  76. jsmntok_t *token;
  77. int start = parser->pos;
  78. parser->pos++;
  79. /* Skip starting quote */
  80. for (; js[parser->pos] != '\0'; parser->pos++) {
  81. char c = js[parser->pos];
  82. /* Quote: end of string */
  83. if (c == '\"') {
  84. token = jsmn_alloc_token(parser, tokens, num_tokens);
  85. if (token == NULL) {
  86. parser->pos = start;
  87. return JSMN_ERROR_NOMEM;
  88. }
  89. jsmn_fill_token(token, JSMN_STRING, start+1, parser->pos);
  90. #ifdef JSMN_PARENT_LINKS
  91. token->parent = parser->toksuper;
  92. #endif
  93. return JSMN_SUCCESS;
  94. }
  95. /* Backslash: Quoted symbol expected */
  96. if (c == '\\') {
  97. parser->pos++;
  98. switch (js[parser->pos]) {
  99. /* Allowed escaped symbols */
  100. case '\"': case '/' : case '\\' : case 'b' :
  101. case 'f' : case 'r' : case 'n' : case 't' :
  102. break;
  103. /* Allows escaped symbol \uXXXX */
  104. case 'u':
  105. /* TODO */
  106. break;
  107. /* Unexpected symbol */
  108. default:
  109. parser->pos = start;
  110. return JSMN_ERROR_INVAL;
  111. }
  112. }
  113. }
  114. parser->pos = start;
  115. return JSMN_ERROR_PART;
  116. }
  117. /**
  118. * Parse JSON string and fill tokens.
  119. */
  120. jsmnerr_t jsmn_parse(jsmn_parser *parser, const char *js, jsmntok_t *tokens,
  121. unsigned int num_tokens) {
  122. jsmnerr_t r;
  123. int i;
  124. jsmntok_t *token;
  125. for (; js[parser->pos] != '\0'; parser->pos++) {
  126. char c;
  127. jsmntype_t type;
  128. c = js[parser->pos];
  129. switch (c) {
  130. case '{': case '[':
  131. token = jsmn_alloc_token(parser, tokens, num_tokens);
  132. if (token == NULL)
  133. return JSMN_ERROR_NOMEM;
  134. if (parser->toksuper != -1) {
  135. tokens[parser->toksuper].size++;
  136. #ifdef JSMN_PARENT_LINKS
  137. token->parent = parser->toksuper;
  138. #endif
  139. }
  140. token->type = (c == '{' ? JSMN_OBJECT : JSMN_ARRAY);
  141. token->start = parser->pos;
  142. parser->toksuper = parser->toknext - 1;
  143. break;
  144. case '}': case ']':
  145. type = (c == '}' ? JSMN_OBJECT : JSMN_ARRAY);
  146. #ifdef JSMN_PARENT_LINKS
  147. if (parser->toknext < 1) {
  148. return JSMN_ERROR_INVAL;
  149. }
  150. token = &tokens[parser->toknext - 1];
  151. for (;;) {
  152. if (token->start != -1 && token->end == -1) {
  153. if (token->type != type) {
  154. return JSMN_ERROR_INVAL;
  155. }
  156. token->end = parser->pos + 1;
  157. parser->toksuper = token->parent;
  158. break;
  159. }
  160. if (token->parent == -1) {
  161. break;
  162. }
  163. token = &tokens[token->parent];
  164. }
  165. #else
  166. for (i = parser->toknext - 1; i >= 0; i--) {
  167. token = &tokens[i];
  168. if (token->start != -1 && token->end == -1) {
  169. if (token->type != type) {
  170. return JSMN_ERROR_INVAL;
  171. }
  172. parser->toksuper = -1;
  173. token->end = parser->pos + 1;
  174. break;
  175. }
  176. }
  177. /* Error if unmatched closing bracket */
  178. if (i == -1) return JSMN_ERROR_INVAL;
  179. for (; i >= 0; i--) {
  180. token = &tokens[i];
  181. if (token->start != -1 && token->end == -1) {
  182. parser->toksuper = i;
  183. break;
  184. }
  185. }
  186. #endif
  187. break;
  188. case '\"':
  189. r = jsmn_parse_string(parser, js, tokens, num_tokens);
  190. if (r < 0) return r;
  191. if (parser->toksuper != -1)
  192. tokens[parser->toksuper].size++;
  193. break;
  194. case '\t' : case '\r' : case '\n' : case ':' : case ',': case ' ':
  195. break;
  196. #ifdef JSMN_STRICT
  197. /* In strict mode primitives are: numbers and booleans */
  198. case '-': case '0': case '1' : case '2': case '3' : case '4':
  199. case '5': case '6': case '7' : case '8': case '9':
  200. case 't': case 'f': case 'n' :
  201. #else
  202. /* In non-strict mode every unquoted value is a primitive */
  203. default:
  204. #endif
  205. r = jsmn_parse_primitive(parser, js, tokens, num_tokens);
  206. if (r < 0) return r;
  207. if (parser->toksuper != -1)
  208. tokens[parser->toksuper].size++;
  209. break;
  210. #ifdef JSMN_STRICT
  211. /* Unexpected char in strict mode */
  212. default:
  213. return JSMN_ERROR_INVAL;
  214. #endif
  215. }
  216. }
  217. for (i = parser->toknext - 1; i >= 0; i--) {
  218. /* Unmatched opened object or array */
  219. if (tokens[i].start != -1 && tokens[i].end == -1) {
  220. return JSMN_ERROR_PART;
  221. }
  222. }
  223. return JSMN_SUCCESS;
  224. }
  225. /**
  226. * Creates a new parser based over a given buffer with an array of tokens
  227. * available.
  228. */
  229. void jsmn_init(jsmn_parser *parser) {
  230. parser->pos = 0;
  231. parser->toknext = 0;
  232. parser->toksuper = -1;
  233. }