-
Notifications
You must be signed in to change notification settings - Fork 1
/
cJSON_BSON.c
853 lines (793 loc) · 25.1 KB
/
cJSON_BSON.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
/*
Copyright (c) 2009 Dave Gamble
2015 Kitware, Inc.
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.
*/
/* cJSON */
/* JSON parser in C. */
#include <string.h>
#include <stdio.h>
#include <math.h>
#include <stdlib.h>
#include <inttypes.h>
#include <float.h>
#include <limits.h>
#include <ctype.h>
#include "cJSON.h"
#include "cJSON_BSON.h"
#include <assert.h>
#define cBSON_LinkSibling(prev, cur) \
if (!**prev) \
{ \
**prev = cur; \
} \
else \
{ \
(**prev)->next = cur; \
cur->prev = **prev; \
*prev = &cur->next; \
}
static void *(*cJSON_malloc)(size_t sz) = malloc;
static void (*cJSON_free)(void *ptr) = free;
static int shouldDetectUUIDsInStrings = 0; /* do not try this by default; it adds overhead. */
static int shouldUseExtendedTypes = 0; /* do not do this by default; it is incompatible. */
/* Duplicate the string using cJSON's malloc.
* May return null if nullOK and given an empty \a str.
* The length of the string is returned in len (including null terminator!).
*/
static char* cJSON_strdup(const char* str, size_t* len, int nullOK)
{
char* copy;
*len = str && str[0] ? (strlen(str) + 1) : 1;
if (nullOK && *len == 1)
return NULL;
if (!(copy = (char*)cJSON_malloc(*len))) return 0;
if (str)
memcpy(copy,str,*len);
copy[(*len) - 1] = '\0';
return copy;
}
/**\brief Create a buffer holding a BSON enconding of \a item.
*
* You are responsible for calling cJSON_DeleteBSON() on the result.
* Because the buffer includes null terminators, this function
* returns the size of the allocated buffer in \a bufSizeOut,
* a pointer to a size_t variable.
*/
char* cJSON_PrintBSON(cJSON *item, size_t* bufSizeOut)
{
char* bsonVal;
if (item->type != cJSON_Array)
{
*bufSizeOut = bson_get_doc_size(item);
bsonVal = (char*) cJSON_malloc(*bufSizeOut);
bson_doc_value(item->child, bsonVal, *bufSizeOut, NULL);
}
else
{
*bufSizeOut = bson_get_array_size(item) - 8;
bsonVal = (char*) cJSON_malloc(*bufSizeOut);
ptrdiff_t idx = 0;
bson_doc_value(item->child, bsonVal, *bufSizeOut, &idx);
}
return bsonVal;
}
/**\brief Deallocate a BSON buffer created by cJSON_PrintBSON.
*/
void cJSON_DeleteBSON(char* bson)
{
cJSON_free(bson);
}
/**\brief Call this with a positive integer to enable UUID detection.
*
* If set to a positive value, then cJSON_String entries being
* processed by cJSON_PrintBSON will be examined and exported as
* UUIDs if in the proper 37-character format (including null
* terminator). Otherwise, cJSON_String entries will always appear
* in BSON as cBSON_String entries.
*/
void cJSON_BSON_SetDetectUUIDs(int yes)
{
shouldDetectUUIDsInStrings = yes ? 1 : 0;
}
/**\brief Return whether or not UUID detection is enabled.
*/
int cJSON_BSON_WillDetectUUIDs()
{
return shouldDetectUUIDsInStrings;
}
/* Detect whether the given string encodes a UUID.
*
* This tests that the length of the string is correct
* and that digits are all hexadecimal with hypens
* in the correct places (i.e., of the form
* "xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx").
*/
int bson_is_string_uuid(const char* val)
{
int i;
if (!val || strlen(val) != 36)
return 0;
if (val[8] != '-' || val[13] != '-' || val[18] != '-' || val[23] != '-')
return 0;
for (i = 0; i < 4; ++i)
if (
!isxdigit(val[ 0 + i]) ||
!isxdigit(val[ 4 + i]) ||
!isxdigit(val[ 9 + i]) ||
!isxdigit(val[14 + i]) ||
!isxdigit(val[19 + i]) ||
!isxdigit(val[24 + i]) ||
!isxdigit(val[28 + i]) ||
!isxdigit(val[32 + i]))
return 0;
return 1;
}
static void decode_hex_string(const char* in, size_t len, uint8_t* out)
{
unsigned int i, t, hi, lo;
for (t = 0, i = 0; i < len; i += 2, ++t)
{
int inhi = toupper(in[i]);
int inlo = toupper(in[i + 1]);
hi = inhi > '9' ? inhi - 'A' + 10 : inhi - '0';
lo = inlo > '9' ? inlo - 'A' + 10 : inlo - '0';
out[t] = (hi << 4 ) | lo;
}
}
static void encode_hex_string(const uint8_t* in, size_t len, char* out)
{
static const char convert[16] = "0123456789abcdef";
size_t i;
for (i = 0; i < len; ++i)
{
*(out++) = convert[((*in) & 0xf0) >> 4];
*(out++) = convert[(*(in++)) & 0x0f];
}
}
/* Write the UUID data (not including the type byte or name) to the output buffer.
*
* This writes the size, subtype, and UUID data to \a buf.
* It presumes that \a src is of the correct form (i.e.,
* "xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx").
*/
char* bson_uuid_value_from_string(char* buf, const char* src)
{
*((int32_t*)buf) = 16;
char* loc = buf + 4;
*(loc++) = cBSON_UUID;
decode_hex_string(src + 0, 8, (uint8_t*)loc );
decode_hex_string(src + 9, 4, (uint8_t*)loc + 4);
decode_hex_string(src + 14, 4, (uint8_t*)loc + 6);
decode_hex_string(src + 19, 4, (uint8_t*)loc + 8);
decode_hex_string(src + 24, 12, (uint8_t*)loc + 10);
return buf + 21;
}
/**\brief Call with non-zero value to force the BSON parser to produce cJSON nodes with extended item->type values.
*/
void cJSON_BSON_SetUseExtendedTypes(int yes)
{
shouldUseExtendedTypes = yes ? 1 : 0;
}
/**\brief Returns non-zero when the BSON parser will produce cJSON nodes with extended item->type values.
*/
int cJSON_BSON_WillUseExtendedTypes()
{
return shouldUseExtendedTypes;
}
/* Return the size of the item treating it as the top-level
* entry in a BSON document.
*/
size_t bson_get_doc_size(cJSON* item)
{
/* 5 = 4 byte length + item size + 1-byte null terminator */
size_t result = 5;
cJSON* kid;
for (kid = item->child; kid; kid = kid->next)
result += bson_get_size(kid);
return result;
}
/* Return the size of an item's contents (not including
* its type byte or name.
*/
size_t bson_get_array_item_size(cJSON* item)
{
size_t result = 0;
if (!item) return result;
switch ((item->type)&255)
{
case cJSON_NULL:
return 0; break; /* nothing */
case cJSON_False:
case cJSON_True:
return 1; break; /* bool(char) */
case cJSON_Number:
return 8; break; /* double */
case cJSON_String:
return item->valuestring ?
(shouldDetectUUIDsInStrings && bson_is_string_uuid(item->valuestring) ?
21 : /* size(4) + subtype(1) + UUID(16 bytes) */
5 + strlen(item->valuestring)) : /* size + value + terminator */
5; /* size + terminator */
break;
case cJSON_Array:
return bson_get_array_size(item->child); break;
case cJSON_Object: return bson_get_object_size(item->child); break;
}
/* TODO: Generate error of some sort. */
return result;
}
/* Return the size of the arrays's contents (not including
* its type byte or name.
*/
size_t bson_get_array_size(cJSON* item)
{
/* arrays are tricky because BSON requires the keys to
* be null-terminated, integer-valued strings (e.g., "0",
* "1", ..., "42", ...), which vary in length depending
* on the size of the array.
*/
size_t numentries = 0;
size_t valsize = 5; /* document size + terminator = 5 bytes */
cJSON* kid;
/* count the number of child items in the array and
* calculate the size of the items' values without looking
* at their item->string values. This is different than
* dictionaries which use item->string as a key.
*/
for (kid = item; kid; kid = kid->next, ++numentries)
valsize += bson_get_array_item_size(kid);
/* calculate the number of digits in all the keys.
* The first 10 (or fewer) have 1 digit (0-9).
* second 90 (or fewer) have 2 digits (10-99).
* third 900 (or fewer) have 3 digits (100-999).
*/
/* every item has a type-byte plus a null terminator: */
size_t keysize = 2 * numentries;
size_t ndig = 10;
size_t digitc = numentries;
do
{
keysize += digitc;
digitc -= (digitc > ndig ? ndig : digitc);
ndig *= (ndig == 10 ? 9 : 10);
} while (digitc > 0);
return keysize + valsize;
}
/* Return the size of the object's contents (not including
* its type byte or name.
*/
size_t bson_get_object_size(cJSON* item)
{
size_t numentries = 0;
size_t valsize = 4; /* 4 bytes for int32 record size */
cJSON* kid;
for (kid = item; kid; kid = kid->next, ++numentries)
{
/* TODO: Generate error when kid->string is NULL */
valsize += bson_get_size(kid);
}
++valsize; /* null terminator */
return valsize;
}
/* Return the size of an item, including its type byte
* and "C"-string name.
*/
size_t bson_get_size(cJSON* item)
{
size_t result = 0;
if (!item) return result;
/* All elements have a type byte plus an optional name
* string (which is always terminated): */
result = 2 + (item->string ? strlen(item->string) : 0);
switch ((item->type)&255)
{
case cJSON_NULL: break;
case cJSON_False: ++result; break;
case cJSON_True: ++result; break;
case cJSON_Number: result += sizeof(double); break;
case cJSON_String:
if (shouldDetectUUIDsInStrings && bson_is_string_uuid(item->valuestring))
/* UUIDs are encoded as "binary" data with a subtype.
* size(4) + subtype(1) + UUID(16 bytes) */
result += 21;
else
/* UTF-8 strings are preceded by 4 bytes specifying length and
* followed by a null-terminator. The length does not include
* the item type or itself in the count, but does include the
* null terminator. */
result += item->valuestring ?
strlen(item->valuestring) + 5 : 5;
break;
case cJSON_Array: result += bson_get_array_size(item->child); break;
case cJSON_Object: result += bson_get_object_size(item->child); break;
}
return result;
}
/* Given an adequately sized buffer, encode the JSON \a item
* in \a buf as a BSON document.
*/
char* bson_doc_value(cJSON* item, char* buf, size_t bufsize, ptrdiff_t* idxName)
{
char* loc = buf;
cJSON* cur;
if (bufsize < 5)
return NULL;
/* set aside space for the byte count */
loc += 4;
for (cur = item; cur; cur = cur->next)
{
size_t delta = loc - buf + 1;
if (delta > bufsize)
{ /* FIXME: error, not enough space. should do something more than this. */
continue;
}
loc += bson_item_value(cur, loc, bufsize - (loc - buf) - 1, idxName);
}
/* add null terminator */
*loc = 0x00;
++loc;
/* go back and record the total size */
((int32_t*)buf)[0] = (int32_t)(loc - buf);
/* unlike other XXX_value() methods, return the end pointer */
return loc;
}
/* Print the item's name into the buffer at \a buf
* and return the number of characters used (including
* the null terminator.
* If \a idxName is non-NULL, then it is used to generate
* the name. Otherwise, the item's name is used.
* A return value of 1 indicates that the item had no name.
*/
size_t bson_item_name(cJSON* item, char* buf, size_t bufsize, ptrdiff_t* idxName)
{
size_t result = 0;
if (idxName)
{
result = snprintf(buf, bufsize, "%" PRIuPTR, *idxName);
if (result > bufsize)
result = bufsize - 1; /* Prevent overruns */
(*idxName) ++; /* increment the index for the next item. */
}
if (item->string)
{
result = snprintf(buf, bufsize, "%s", item->string);
if (result > bufsize)
result = bufsize - 1; /* Prevent overruns */
}
/* always null terminate */
buf[result++] = 0x00;
return result;
}
int countkids(cJSON* item)
{
int c;
for (c = 0; item; item = item->next)
++c;
return c;
}
/* Given an adequately sized buffer, encode the JSON \a item
* in \a buf as a BSON subitem.
* This returns the number of bytes used from the start of
* \a buf to encode the item.
*/
size_t bson_item_value(cJSON* item, char* buf, size_t bufsize, ptrdiff_t* idxName)
{
size_t result = 0;
if (!item || bufsize < 2)
return result;
char* loc = buf;
switch ((item->type)&0xff)
{
case cJSON_NULL:
{
*(loc++) = cBSON_NULL;
loc += bson_item_name(item, loc, bufsize - 1, idxName);
}
break;
case cJSON_False:
{
*(loc++) = cBSON_Bool;
loc += bson_item_name(item, loc, bufsize - 1, idxName);
*(loc++) = 0x00;
}
break;
case cJSON_True:
{
*(loc++) = cBSON_Bool;
loc += bson_item_name(item, loc, bufsize - 1, idxName);
*(loc++) = 0x01;
}
break;
case cJSON_Number:
{
int isInt = (fmod(item->valuedouble, 1.0) == 0);
*(loc++) = isInt ? cBSON_Int : cBSON_Float;
loc += bson_item_name(item, loc, bufsize - 1, idxName);
if (isInt)
{ /* item->valueint may only be a 32-bit integer. Promote it. */
int64_t tmpVal = item->valueint;
*((int64_t*)loc) = tmpVal;
}
else
{
*((double*)loc) = item->valuedouble;
}
loc += sizeof(double);
}
break;
case cJSON_String:
if (shouldDetectUUIDsInStrings && bson_is_string_uuid(item->valuestring))
{
*(loc++) = cBSON_Binary;
loc += bson_item_name(item, loc, bufsize - 1, idxName);
loc = bson_uuid_value_from_string(loc, item->valuestring);
}
else
{
char* lenptr;
*(loc++) = cBSON_String;
loc += bson_item_name(item, loc, bufsize - 1, idxName);
lenptr = loc;
loc += 4; /* skip the string length entry */
loc = stpncpy(loc, item->valuestring, bufsize - 1);
*(loc++) = 0x00;
*((int32_t*)lenptr) = loc - (lenptr + 4); /* fill in the string length (inc. terminator) */
}
break;
case cJSON_Array:
{
ptrdiff_t idx = 0;
*(loc++) = cBSON_Array;
loc += bson_item_name(item, loc, bufsize - 1, idxName);
loc = bson_doc_value(item->child, loc, bufsize - (loc - buf) - 1, &idx);
}
break;
case cJSON_Object:
{
/*no gen name*/ *(loc++) = cBSON_Document;
loc += bson_item_name(item, loc, bufsize - 1, idxName);
loc = bson_doc_value(item->child, loc, bufsize - (loc - buf) - 1, NULL);
}
break;
}
result = loc - buf;
return result;
}
/* allocate and copy the null-terminated name into \a name_out. */
char* bson_parse_name(const char* bson, size_t* len)
{
return cJSON_strdup(bson, len, 1);
}
void bson_prepare_uuid(cJSON* node, const char* loc)
{
node->type = cJSON_UUID;
node->valuestring = cJSON_malloc(16);
memcpy(node->valuestring, loc, 16);
}
void bson_encode_uuid(cJSON* node, const char* loc)
{
node->type = cJSON_String;
node->valuestring = cJSON_malloc(37);
encode_hex_string((const uint8_t*)loc , 4, node->valuestring + 0);
encode_hex_string((const uint8_t*)loc + 4, 2, node->valuestring + 9);
encode_hex_string((const uint8_t*)loc + 6, 2, node->valuestring + 14);
encode_hex_string((const uint8_t*)loc + 8, 2, node->valuestring + 19);
encode_hex_string((const uint8_t*)loc + 10, 6, node->valuestring + 24);
node->valuestring[ 8] = '-';
node->valuestring[13] = '-';
node->valuestring[18] = '-';
node->valuestring[23] = '-';
node->valuestring[36] = '\0';
}
void bson_prepare_binary(cJSON* node, const char* loc, size_t bloblen, uint8_t subtype)
{
node->type = cJSON_Binary;
node->valueint = subtype;
node->valuestring = cJSON_malloc(bloblen);
memcpy(node->valuestring, loc, bloblen);
}
void bson_encode_binary(cJSON* node, const char* loc, size_t bloblen, uint8_t subtype)
{
node->type = cJSON_String;
node->valuestring = cJSON_malloc(2 * bloblen + 1);
node->valueint = subtype;
encode_hex_string((const uint8_t*)loc, bloblen, node->valuestring);
node->valuestring[2 * bloblen] = '\0';
}
size_t bson_parse_float(const char* bson, size_t remaining, cJSON*** prev)
{
(void) remaining;
size_t len;
char* key = bson_parse_name(bson, &len);
const char* loc = bson + len;
cJSON* node = cJSON_CreateNumber(*(double*)loc);
node->string = key;
node->valueint = (int)node->valuedouble;
cBSON_LinkSibling(prev, node);
return sizeof(double) + loc - bson;
}
size_t bson_parse_string(const char* bson, size_t remaining, cJSON*** prev)
{
(void) remaining;
size_t len;
char* key = bson_parse_name(bson, &len);
const char* loc = bson + len;
int32_t slen = *(const int32_t*)loc;
loc += 4;
/* note that we only handle ASCII, not full UTF-8 strings,
* while loc may contain embedded NULLs that are not meant
* to be terminators.
*/
cJSON* node = cJSON_CreateString(loc);
node->string = key;
cBSON_LinkSibling(prev, node);
return slen + loc - bson;
}
size_t bson_parse_document(const char* bson, size_t remaining, cJSON*** prev, int tag)
{
(void) remaining;
size_t len;
char* key = bson_parse_name(bson, &len);
const char* loc = bson + len;
// peek at the size:
int32_t dlen = *(const int32_t*)loc;
cJSON* node = bson_parse_doc(
loc, (size_t)dlen, tag == cBSON_Array ? cJSON_Array : cJSON_Object);
if (node)
{
node->string = key;
cBSON_LinkSibling(prev, node);
}
return dlen + (loc - bson); /* skip proper length even if we couldn't read it. */
}
size_t bson_parse_blob(const char* bson, size_t remaining, cJSON*** prev)
{
(void) remaining;
size_t len;
char* key = bson_parse_name(bson, &len);
/* we will change the node type and contents manually: */
cJSON* node = cJSON_CreateNull();
node->string = key;
cBSON_LinkSibling(prev, node);
const char* loc = bson + len;
int32_t bloblen = *(const int32_t*)loc;
loc += 4;
int subtype = (*(loc++)) & 0xff;
switch (subtype)
{
case cBSON_UUID: // yay
if (shouldUseExtendedTypes)
bson_prepare_uuid(node, loc);
else
bson_encode_uuid(node, loc);
break;
case cBSON_Generic:
case cBSON_Function:
case cBSON_Old:
case cBSON_OldUUID:
case cBSON_MD5:
case cBSON_User:
default:
if (shouldUseExtendedTypes)
bson_prepare_binary(node, loc, bloblen, subtype);
else
bson_encode_binary(node, loc, bloblen, subtype);
break;
}
return bloblen + loc - bson;
}
size_t bson_parse_object_id(const char* bson, size_t remaining, cJSON*** prev)
{
(void) bson;
(void) remaining;
(void) prev;
return 0;
}
size_t bson_parse_bool(const char* bson, size_t remaining, cJSON*** prev)
{
(void) remaining;
size_t len;
char* key = bson_parse_name(bson, &len);
const char* loc = bson + len;
cJSON* node = (*(loc++) ? cJSON_CreateTrue() : cJSON_CreateFalse());
node->string = key;
cBSON_LinkSibling(prev, node);
return loc - bson;
}
size_t bson_parse_int(const char* bson, size_t remaining, cJSON*** prev)
{
(void) remaining;
size_t len;
char* key = bson_parse_name(bson, &len);
const char* loc = bson + len;
int64_t val = *(int64_t*)loc;
cJSON* node = cJSON_CreateNumber((double)val);
node->string = key;
node->valueint = (int)val; /* overwrite cJSON-double-cast with exact value */
cBSON_LinkSibling(prev, node);
return sizeof(int64_t) + loc - bson;
}
size_t bson_parse_int32(const char* bson, size_t remaining, cJSON*** prev)
{
(void) remaining;
size_t len;
char* key = bson_parse_name(bson, &len);
const char* loc = bson + len;
int32_t val = *(int32_t*)loc;
cJSON* node = cJSON_CreateNumber((double)val);
node->string = key;
node->valueint = (int)val; /* overwrite cJSON-double-cast with exact value */
cBSON_LinkSibling(prev, node);
return sizeof(int32_t) + loc - bson;
}
size_t bson_parse_null(const char* bson, size_t remaining, cJSON*** prev)
{
(void) remaining;
size_t len;
char* key = bson_parse_name(bson, &len);
cJSON* node = cJSON_CreateNull();
node->string = key;
cBSON_LinkSibling(prev, node);
return len;
}
size_t bson_parse_regex(const char* bson, size_t remaining, cJSON*** prev)
{
(void) remaining;
size_t tot;
size_t len;
char* key = bson_parse_name(bson, &tot);
cJSON* node = cJSON_CreateArray();
char* regex = bson_parse_name(bson, &len);
tot += len;
char* opts = bson_parse_name(bson, &len);
tot += len;
cJSON_AddItemToArray(node, cJSON_CreateString(regex));
cJSON_AddItemToArray(node, cJSON_CreateString(opts));
node->string = key;
cBSON_LinkSibling(prev, node);
return tot;
}
size_t bson_parse_db_pointer(const char* bson, size_t remaining, cJSON*** prev)
{
(void) bson;
(void) remaining;
(void) prev;
return 0;
}
size_t bson_parse_code_ws(const char* bson, size_t remaining, cJSON*** prev)
{
(void) bson;
(void) remaining;
(void) prev;
return 0;
}
cJSON* bson_parse_doc(const char* bson, size_t bson_size, int doc_type)
{
cJSON* result =
(doc_type != cJSON_Array ?
cJSON_CreateObject() :
cJSON_CreateArray());
cJSON** next_child = &result->child;
cJSON* prev = NULL;
const char* loc = bson;
/* read size for comparison */
int32_t actual_size = *(uint32_t*)loc;
loc += 4;
int itype;
int allIndicesAreInts = 1;
long lastKey = -1;
size_t remaining = bson_size - (loc - bson);
assert(bson_size == (size_t)actual_size && "BSON size mismatch");
while (remaining > 0)
{
itype = (*(loc++) & 0xff);
switch (itype)
{
case 0: /* null terminator marking end of document */
if (doc_type < cJSON_Array && allIndicesAreInts)
result->type = cJSON_Array;
return result;
case cBSON_Float:
loc += bson_parse_float(loc, remaining, &next_child); break;
case cBSON_String:
case cBSON_JS_Code:
case cBSON_Deprecated:
loc += bson_parse_string(loc, remaining, &next_child); break;
case cBSON_Document:
case cBSON_Array:
loc += bson_parse_document(loc, remaining, &next_child, itype); break;
case cBSON_Binary:
loc += bson_parse_blob(loc, remaining, &next_child); break;
case cBSON_ObjectId:
loc += bson_parse_object_id(loc, remaining, &next_child); break;
case cBSON_Bool:
loc += bson_parse_bool(loc, remaining, &next_child); break;
case cBSON_UTC_Time:
case cBSON_Timestamp:
case cBSON_Int:
loc += bson_parse_int(loc, remaining, &next_child); break;
case cBSON_Int32:
loc += bson_parse_int32(loc, remaining, &next_child); break;
case cBSON_Undefined:
case cBSON_NULL:
case cBSON_Min_Key:
case cBSON_Max_Key:
loc += bson_parse_null(loc, remaining, &next_child); break;
case cBSON_Regex:
loc += bson_parse_regex(loc, remaining, &next_child); break;
case cBSON_DBPointer:
loc += bson_parse_db_pointer(loc, remaining, &next_child); break;
case cBSON_JS_Code_WS:
loc += bson_parse_code_ws(loc, remaining, &next_child); break;
default:
cJSON_Delete(result);
return NULL;
}
remaining = bson_size - (loc - bson);
/* If the document type is unspecified (doc_type == cJSON_NULL),
* then we should be checking to see whether it can be an array
* or (because the keys are not increasing integers) must be
* an object.
*/
if (doc_type < cJSON_Array && allIndicesAreInts)
{
if (!prev)
prev = result->child;
else
prev = prev->next;
if (prev && prev->string)
{
char* dummy;
long idx = strtol(prev->string, &dummy, 10);
if (!dummy || *dummy || idx <= lastKey)
allIndicesAreInts = 0;
else
lastKey = idx;
}
else
{
allIndicesAreInts = 0;
}
}
}
/* If we were not told the document type, set it: */
if (doc_type < cJSON_Array && allIndicesAreInts)
result->type = cJSON_Array;
return result;
}
/**\brief Parse a BSON buffer into a tree of cJSON records.
*
* The first two arguments are the buffer and size.
* The third argument allows you to specify a preference
* for the top-level object type.
* The following values are accepted:
*
* + cJSON_Array, indicating that an array should contain
* all the top-level entries (even if their key values
* are not all integers);
* + cJSON_Object, indicating that a dictionary should
* contain all the top-level entries (even if their
* key values are all integers); or
* + cJSON_NULL, indicating that you have no preference
* and the key values should be used to decide whether
* to create a cJSON_Array or cJSON_Object.
*/
cJSON* cJSON_ParseBSON(const char* bson, size_t bson_size, int doc_type)
{
return bson_parse_doc(bson, bson_size, doc_type);
}