-
-
Notifications
You must be signed in to change notification settings - Fork 121
/
json.c
1381 lines (1177 loc) · 28.6 KB
/
json.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
Copyright (C) 2011 Joseph A. Adams ([email protected])
All rights reserved.
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in
all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
THE SOFTWARE.
*/
#include "json.h"
#include <assert.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define out_of_memory() do { \
fprintf(stderr, "Out of memory.\n"); \
exit(EXIT_FAILURE); \
} while (0)
/* Sadly, strdup is not portable. */
static char *json_strdup(const char *str)
{
char *ret = (char*) malloc(strlen(str) + 1);
if (ret == NULL)
out_of_memory();
strcpy(ret, str);
return ret;
}
/* String buffer */
typedef struct
{
char *cur;
char *end;
char *start;
} SB;
static void sb_init(SB *sb)
{
sb->start = (char*) malloc(17);
if (sb->start == NULL)
out_of_memory();
sb->cur = sb->start;
sb->end = sb->start + 16;
}
/* sb and need may be evaluated multiple times. */
#define sb_need(sb, need) do { \
if ((sb)->end - (sb)->cur < (need)) \
sb_grow(sb, need); \
} while (0)
static void sb_grow(SB *sb, int need)
{
size_t length = sb->cur - sb->start;
size_t alloc = sb->end - sb->start;
do {
alloc *= 2;
} while (alloc < length + need);
sb->start = (char*) realloc(sb->start, alloc + 1);
if (sb->start == NULL)
out_of_memory();
sb->cur = sb->start + length;
sb->end = sb->start + alloc;
}
static void sb_put(SB *sb, const char *bytes, int count)
{
sb_need(sb, count);
memcpy(sb->cur, bytes, count);
sb->cur += count;
}
#define sb_putc(sb, c) do { \
if ((sb)->cur >= (sb)->end) \
sb_grow(sb, 1); \
*(sb)->cur++ = (c); \
} while (0)
static void sb_puts(SB *sb, const char *str)
{
sb_put(sb, str, strlen(str));
}
static char *sb_finish(SB *sb)
{
*sb->cur = 0;
assert(sb->start <= sb->cur && strlen(sb->start) == (size_t)(sb->cur - sb->start));
return sb->start;
}
static void sb_free(SB *sb)
{
free(sb->start);
}
/*
* Unicode helper functions
*
* These are taken from the ccan/charset module and customized a bit.
* Putting them here means the compiler can (choose to) inline them,
* and it keeps ccan/json from having a dependency.
*/
/*
* Type for Unicode codepoints.
* We need our own because wchar_t might be 16 bits.
*/
typedef uint32_t uchar_t;
/*
* Validate a single UTF-8 character starting at @s.
* The string must be null-terminated.
*
* If it's valid, return its length (1 thru 4).
* If it's invalid or clipped, return 0.
*
* This function implements the syntax given in RFC3629, which is
* the same as that given in The Unicode Standard, Version 6.0.
*
* It has the following properties:
*
* * All codepoints U+0000..U+10FFFF may be encoded,
* except for U+D800..U+DFFF, which are reserved
* for UTF-16 surrogate pair encoding.
* * UTF-8 byte sequences longer than 4 bytes are not permitted,
* as they exceed the range of Unicode.
* * The sixty-six Unicode "non-characters" are permitted
* (namely, U+FDD0..U+FDEF, U+xxFFFE, and U+xxFFFF).
*/
static int utf8_validate_cz(const char *s)
{
unsigned char c = *s++;
if (c <= 0x7F) { /* 00..7F */
return 1;
} else if (c <= 0xC1) { /* 80..C1 */
/* Disallow overlong 2-byte sequence. */
return 0;
} else if (c <= 0xDF) { /* C2..DF */
/* Make sure subsequent byte is in the range 0x80..0xBF. */
if (((unsigned char)*s++ & 0xC0) != 0x80)
return 0;
return 2;
} else if (c <= 0xEF) { /* E0..EF */
/* Disallow overlong 3-byte sequence. */
if (c == 0xE0 && (unsigned char)*s < 0xA0)
return 0;
/* Disallow U+D800..U+DFFF. */
if (c == 0xED && (unsigned char)*s > 0x9F)
return 0;
/* Make sure subsequent bytes are in the range 0x80..0xBF. */
if (((unsigned char)*s++ & 0xC0) != 0x80)
return 0;
if (((unsigned char)*s++ & 0xC0) != 0x80)
return 0;
return 3;
} else if (c <= 0xF4) { /* F0..F4 */
/* Disallow overlong 4-byte sequence. */
if (c == 0xF0 && (unsigned char)*s < 0x90)
return 0;
/* Disallow codepoints beyond U+10FFFF. */
if (c == 0xF4 && (unsigned char)*s > 0x8F)
return 0;
/* Make sure subsequent bytes are in the range 0x80..0xBF. */
if (((unsigned char)*s++ & 0xC0) != 0x80)
return 0;
if (((unsigned char)*s++ & 0xC0) != 0x80)
return 0;
if (((unsigned char)*s++ & 0xC0) != 0x80)
return 0;
return 4;
} else { /* F5..FF */
return 0;
}
}
/* Validate a null-terminated UTF-8 string. */
static bool utf8_validate(const char *s)
{
int len;
for (; *s != 0; s += len) {
len = utf8_validate_cz(s);
if (len == 0)
return false;
}
return true;
}
/*
* Read a single UTF-8 character starting at @s,
* returning the length, in bytes, of the character read.
*
* This function assumes input is valid UTF-8,
* and that there are enough characters in front of @s.
*/
static int utf8_read_char(const char *s, uchar_t *out)
{
const unsigned char *c = (const unsigned char*) s;
assert(utf8_validate_cz(s));
if (c[0] <= 0x7F) {
/* 00..7F */
*out = c[0];
return 1;
} else if (c[0] <= 0xDF) {
/* C2..DF (unless input is invalid) */
*out = ((uchar_t)c[0] & 0x1F) << 6 |
((uchar_t)c[1] & 0x3F);
return 2;
} else if (c[0] <= 0xEF) {
/* E0..EF */
*out = ((uchar_t)c[0] & 0xF) << 12 |
((uchar_t)c[1] & 0x3F) << 6 |
((uchar_t)c[2] & 0x3F);
return 3;
} else {
/* F0..F4 (unless input is invalid) */
*out = ((uchar_t)c[0] & 0x7) << 18 |
((uchar_t)c[1] & 0x3F) << 12 |
((uchar_t)c[2] & 0x3F) << 6 |
((uchar_t)c[3] & 0x3F);
return 4;
}
}
/*
* Write a single UTF-8 character to @s,
* returning the length, in bytes, of the character written.
*
* @unicode must be U+0000..U+10FFFF, but not U+D800..U+DFFF.
*
* This function will write up to 4 bytes to @out.
*/
static int utf8_write_char(uchar_t unicode, char *out)
{
unsigned char *o = (unsigned char*) out;
assert(unicode <= 0x10FFFF && !(unicode >= 0xD800 && unicode <= 0xDFFF));
if (unicode <= 0x7F) {
/* U+0000..U+007F */
*o++ = unicode;
return 1;
} else if (unicode <= 0x7FF) {
/* U+0080..U+07FF */
*o++ = 0xC0 | unicode >> 6;
*o++ = 0x80 | (unicode & 0x3F);
return 2;
} else if (unicode <= 0xFFFF) {
/* U+0800..U+FFFF */
*o++ = 0xE0 | unicode >> 12;
*o++ = 0x80 | (unicode >> 6 & 0x3F);
*o++ = 0x80 | (unicode & 0x3F);
return 3;
} else {
/* U+10000..U+10FFFF */
*o++ = 0xF0 | unicode >> 18;
*o++ = 0x80 | (unicode >> 12 & 0x3F);
*o++ = 0x80 | (unicode >> 6 & 0x3F);
*o++ = 0x80 | (unicode & 0x3F);
return 4;
}
}
/*
* Compute the Unicode codepoint of a UTF-16 surrogate pair.
*
* @uc should be 0xD800..0xDBFF, and @lc should be 0xDC00..0xDFFF.
* If they aren't, this function returns false.
*/
static bool from_surrogate_pair(uint16_t uc, uint16_t lc, uchar_t *unicode)
{
if (uc >= 0xD800 && uc <= 0xDBFF && lc >= 0xDC00 && lc <= 0xDFFF) {
*unicode = 0x10000 + ((((uchar_t)uc & 0x3FF) << 10) | (lc & 0x3FF));
return true;
} else {
return false;
}
}
/*
* Construct a UTF-16 surrogate pair given a Unicode codepoint.
*
* @unicode must be U+10000..U+10FFFF.
*/
static void to_surrogate_pair(uchar_t unicode, uint16_t *uc, uint16_t *lc)
{
uchar_t n;
assert(unicode >= 0x10000 && unicode <= 0x10FFFF);
n = unicode - 0x10000;
*uc = ((n >> 10) & 0x3FF) | 0xD800;
*lc = (n & 0x3FF) | 0xDC00;
}
#define is_space(c) ((c) == '\t' || (c) == '\n' || (c) == '\r' || (c) == ' ')
#define is_digit(c) ((c) >= '0' && (c) <= '9')
static bool parse_value (const char **sp, JsonNode **out);
static bool parse_string (const char **sp, char **out);
static bool parse_number (const char **sp, double *out);
static bool parse_array (const char **sp, JsonNode **out);
static bool parse_object (const char **sp, JsonNode **out);
static bool parse_hex16 (const char **sp, uint16_t *out);
static bool expect_literal (const char **sp, const char *str);
static void skip_space (const char **sp);
static void emit_value (SB *out, const JsonNode *node);
static void emit_value_indented (SB *out, const JsonNode *node, const char *space, int indent_level);
static void emit_string (SB *out, const char *str);
static void emit_number (SB *out, double num);
static void emit_array (SB *out, const JsonNode *array);
static void emit_array_indented (SB *out, const JsonNode *array, const char *space, int indent_level);
static void emit_object (SB *out, const JsonNode *object);
static void emit_object_indented (SB *out, const JsonNode *object, const char *space, int indent_level);
static int write_hex16(char *out, uint16_t val);
static JsonNode *mknode(JsonTag tag);
static void append_node(JsonNode *parent, JsonNode *child);
static void prepend_node(JsonNode *parent, JsonNode *child);
static void append_member(JsonNode *object, char *key, JsonNode *value);
/* Assertion-friendly validity checks */
static bool tag_is_valid(unsigned int tag);
static bool number_is_valid(const char *num);
JsonNode *json_decode(const char *json)
{
const char *s = json;
JsonNode *ret;
skip_space(&s);
if (!parse_value(&s, &ret))
return NULL;
skip_space(&s);
if (*s != 0) {
json_delete(ret);
return NULL;
}
return ret;
}
char *json_encode(const JsonNode *node)
{
return json_stringify(node, NULL);
}
char *json_encode_string(const char *str)
{
SB sb;
sb_init(&sb);
emit_string(&sb, str);
return sb_finish(&sb);
}
char *json_stringify(const JsonNode *node, const char *space)
{
SB sb;
sb_init(&sb);
if (space != NULL)
emit_value_indented(&sb, node, space, 0);
else
emit_value(&sb, node);
return sb_finish(&sb);
}
void json_delete(JsonNode *node)
{
if (node != NULL) {
json_remove_from_parent(node);
switch (node->tag) {
case JSON_STRING:
free(node->string_);
break;
case JSON_ARRAY:
case JSON_OBJECT:
{
JsonNode *child, *next;
for (child = node->children.head; child != NULL; child = next) {
next = child->next;
json_delete(child);
}
break;
}
default:;
}
free(node);
}
}
bool json_validate(const char *json)
{
const char *s = json;
skip_space(&s);
if (!parse_value(&s, NULL))
return false;
skip_space(&s);
if (*s != 0)
return false;
return true;
}
JsonNode *json_find_element(JsonNode *array, int index)
{
JsonNode *element;
int i = 0;
if (array == NULL || array->tag != JSON_ARRAY)
return NULL;
json_foreach(element, array) {
if (i == index)
return element;
i++;
}
return NULL;
}
JsonNode *json_find_member(JsonNode *object, const char *name)
{
JsonNode *member;
if (object == NULL || object->tag != JSON_OBJECT)
return NULL;
json_foreach(member, object)
if (strcmp(member->key, name) == 0)
return member;
return NULL;
}
JsonNode *json_first_child(const JsonNode *node)
{
if (node != NULL && (node->tag == JSON_ARRAY || node->tag == JSON_OBJECT))
return node->children.head;
return NULL;
}
static JsonNode *mknode(JsonTag tag)
{
JsonNode *ret = (JsonNode*) calloc(1, sizeof(JsonNode));
if (ret == NULL)
out_of_memory();
ret->tag = tag;
return ret;
}
JsonNode *json_mknull(void)
{
return mknode(JSON_NULL);
}
JsonNode *json_mkbool(bool b)
{
JsonNode *ret = mknode(JSON_BOOL);
ret->bool_ = b;
return ret;
}
static JsonNode *mkstring(char *s)
{
JsonNode *ret = mknode(JSON_STRING);
ret->string_ = s;
return ret;
}
JsonNode *json_mkstring(const char *s)
{
return mkstring(json_strdup(s));
}
JsonNode *json_mknumber(double n)
{
JsonNode *node = mknode(JSON_NUMBER);
node->number_ = n;
return node;
}
JsonNode *json_mkarray(void)
{
return mknode(JSON_ARRAY);
}
JsonNode *json_mkobject(void)
{
return mknode(JSON_OBJECT);
}
static void append_node(JsonNode *parent, JsonNode *child)
{
child->parent = parent;
child->prev = parent->children.tail;
child->next = NULL;
if (parent->children.tail != NULL)
parent->children.tail->next = child;
else
parent->children.head = child;
parent->children.tail = child;
}
static void prepend_node(JsonNode *parent, JsonNode *child)
{
child->parent = parent;
child->prev = NULL;
child->next = parent->children.head;
if (parent->children.head != NULL)
parent->children.head->prev = child;
else
parent->children.tail = child;
parent->children.head = child;
}
static void append_member(JsonNode *object, char *key, JsonNode *value)
{
value->key = key;
append_node(object, value);
}
void json_append_element(JsonNode *array, JsonNode *element)
{
assert(array->tag == JSON_ARRAY);
assert(element->parent == NULL);
append_node(array, element);
}
void json_prepend_element(JsonNode *array, JsonNode *element)
{
assert(array->tag == JSON_ARRAY);
assert(element->parent == NULL);
prepend_node(array, element);
}
void json_append_member(JsonNode *object, const char *key, JsonNode *value)
{
assert(object->tag == JSON_OBJECT);
assert(value->parent == NULL);
append_member(object, json_strdup(key), value);
}
void json_prepend_member(JsonNode *object, const char *key, JsonNode *value)
{
assert(object->tag == JSON_OBJECT);
assert(value->parent == NULL);
value->key = json_strdup(key);
prepend_node(object, value);
}
void json_remove_from_parent(JsonNode *node)
{
JsonNode *parent = node->parent;
if (parent != NULL) {
if (node->prev != NULL)
node->prev->next = node->next;
else
parent->children.head = node->next;
if (node->next != NULL)
node->next->prev = node->prev;
else
parent->children.tail = node->prev;
free(node->key);
node->parent = NULL;
node->prev = node->next = NULL;
node->key = NULL;
}
}
static bool parse_value(const char **sp, JsonNode **out)
{
const char *s = *sp;
switch (*s) {
case 'n':
if (expect_literal(&s, "null")) {
if (out)
*out = json_mknull();
*sp = s;
return true;
}
return false;
case 'f':
if (expect_literal(&s, "false")) {
if (out)
*out = json_mkbool(false);
*sp = s;
return true;
}
return false;
case 't':
if (expect_literal(&s, "true")) {
if (out)
*out = json_mkbool(true);
*sp = s;
return true;
}
return false;
case '"': {
char *str;
if (parse_string(&s, out ? &str : NULL)) {
if (out)
*out = mkstring(str);
*sp = s;
return true;
}
return false;
}
case '[':
if (parse_array(&s, out)) {
*sp = s;
return true;
}
return false;
case '{':
if (parse_object(&s, out)) {
*sp = s;
return true;
}
return false;
default: {
double num;
if (parse_number(&s, out ? &num : NULL)) {
if (out)
*out = json_mknumber(num);
*sp = s;
return true;
}
return false;
}
}
}
static bool parse_array(const char **sp, JsonNode **out)
{
const char *s = *sp;
JsonNode *ret = out ? json_mkarray() : NULL;
JsonNode *element;
if (*s++ != '[')
goto failure;
skip_space(&s);
if (*s == ']') {
s++;
goto success;
}
for (;;) {
if (!parse_value(&s, out ? &element : NULL))
goto failure;
skip_space(&s);
if (out)
json_append_element(ret, element);
if (*s == ']') {
s++;
goto success;
}
if (*s++ != ',')
goto failure;
skip_space(&s);
}
success:
*sp = s;
if (out)
*out = ret;
return true;
failure:
json_delete(ret);
return false;
}
static bool parse_object(const char **sp, JsonNode **out)
{
const char *s = *sp;
JsonNode *ret = out ? json_mkobject() : NULL;
char *key;
JsonNode *value;
if (*s++ != '{')
goto failure;
skip_space(&s);
if (*s == '}') {
s++;
goto success;
}
for (;;) {
if (!parse_string(&s, out ? &key : NULL))
goto failure;
skip_space(&s);
if (*s++ != ':')
goto failure_free_key;
skip_space(&s);
if (!parse_value(&s, out ? &value : NULL))
goto failure_free_key;
skip_space(&s);
if (out)
append_member(ret, key, value);
if (*s == '}') {
s++;
goto success;
}
if (*s++ != ',')
goto failure;
skip_space(&s);
}
success:
*sp = s;
if (out)
*out = ret;
return true;
failure_free_key:
if (out)
free(key);
failure:
json_delete(ret);
return false;
}
bool parse_string(const char **sp, char **out)
{
const char *s = *sp;
SB sb;
char throwaway_buffer[4];
/* enough space for a UTF-8 character */
char *b;
if (*s++ != '"')
return false;
if (out) {
sb_init(&sb);
sb_need(&sb, 4);
b = sb.cur;
} else {
b = throwaway_buffer;
}
while (*s != '"') {
unsigned char c = *s++;
/* Parse next character, and write it to b. */
if (c == '\\') {
c = *s++;
switch (c) {
case '"':
case '\\':
case '/':
*b++ = c;
break;
case 'b':
*b++ = '\b';
break;
case 'f':
*b++ = '\f';
break;
case 'n':
*b++ = '\n';
break;
case 'r':
*b++ = '\r';
break;
case 't':
*b++ = '\t';
break;
case 'u':
{
uint16_t uc, lc;
uchar_t unicode;
if (!parse_hex16(&s, &uc))
goto failed;
if (uc >= 0xD800 && uc <= 0xDFFF) {
/* Handle UTF-16 surrogate pair. */
if (*s++ != '\\' || *s++ != 'u' || !parse_hex16(&s, &lc))
goto failed; /* Incomplete surrogate pair. */
if (!from_surrogate_pair(uc, lc, &unicode))
goto failed; /* Invalid surrogate pair. */
} else if (uc == 0) {
/* Disallow "\u0000". */
goto failed;
} else {
unicode = uc;
}
b += utf8_write_char(unicode, b);
break;
}
default:
/* Invalid escape */
goto failed;
}
} else if (c <= 0x1F) {
/* Control characters are not allowed in string literals. */
goto failed;
} else {
/* Validate and echo a UTF-8 character. */
int len;
s--;
len = utf8_validate_cz(s);
if (len == 0)
goto failed; /* Invalid UTF-8 character. */
while (len--)
*b++ = *s++;
}
/*
* Update sb to know about the new bytes,
* and set up b to write another character.
*/
if (out) {
sb.cur = b;
sb_need(&sb, 4);
b = sb.cur;
} else {
b = throwaway_buffer;
}
}
s++;
if (out)
*out = sb_finish(&sb);
*sp = s;
return true;
failed:
if (out)
sb_free(&sb);
return false;
}
/*
* The JSON spec says that a number shall follow this precise pattern
* (spaces and quotes added for readability):
* '-'? (0 | [1-9][0-9]*) ('.' [0-9]+)? ([Ee] [+-]? [0-9]+)?
*
* However, some JSON parsers are more liberal. For instance, PHP accepts
* '.5' and '1.'. JSON.parse accepts '+3'.
*
* This function takes the strict approach.
*/
bool parse_number(const char **sp, double *out)
{
const char *s = *sp;
/* '-'? */
if (*s == '-')
s++;
/* (0 | [1-9][0-9]*) */
if (*s == '0') {
s++;
} else {
if (!is_digit(*s))
return false;
do {
s++;
} while (is_digit(*s));
}
/* ('.' [0-9]+)? */
if (*s == '.') {
s++;
if (!is_digit(*s))
return false;
do {
s++;
} while (is_digit(*s));
}
/* ([Ee] [+-]? [0-9]+)? */
if (*s == 'E' || *s == 'e') {
s++;
if (*s == '+' || *s == '-')
s++;
if (!is_digit(*s))
return false;
do {
s++;
} while (is_digit(*s));
}
if (out)
*out = strtod(*sp, NULL);
*sp = s;
return true;
}
static void skip_space(const char **sp)
{
const char *s = *sp;
while (is_space(*s))
s++;
*sp = s;
}
static void emit_value(SB *out, const JsonNode *node)
{
assert(tag_is_valid(node->tag));
switch (node->tag) {
case JSON_NULL:
sb_puts(out, "null");
break;
case JSON_BOOL:
sb_puts(out, node->bool_ ? "true" : "false");
break;
case JSON_STRING:
emit_string(out, node->string_);
break;
case JSON_NUMBER:
emit_number(out, node->number_);
break;
case JSON_ARRAY:
emit_array(out, node);
break;
case JSON_OBJECT:
emit_object(out, node);
break;
default:
assert(false);
}
}