1 | #include "EXTERN.h" |
1 | #include "EXTERN.h" |
2 | #include "perl.h" |
2 | #include "perl.h" |
3 | #include "XSUB.h" |
3 | #include "XSUB.h" |
4 | |
4 | |
5 | #include "assert.h" |
5 | #include <assert.h> |
6 | #include "string.h" |
6 | #include <string.h> |
7 | #include "stdlib.h" |
7 | #include <stdlib.h> |
8 | #include "stdio.h" |
8 | #include <stdio.h> |
|
|
9 | #include <float.h> |
9 | |
10 | |
10 | #if defined(__BORLANDC__) || defined(_MSC_VER) |
11 | #if defined(__BORLANDC__) || defined(_MSC_VER) |
11 | # define snprintf _snprintf // C compilers have this in stdio.h |
12 | # define snprintf _snprintf // C compilers have this in stdio.h |
12 | #endif |
13 | #endif |
13 | |
14 | |
… | |
… | |
26 | #define F_SPACE_AFTER 0x00000040UL |
27 | #define F_SPACE_AFTER 0x00000040UL |
27 | #define F_ALLOW_NONREF 0x00000100UL |
28 | #define F_ALLOW_NONREF 0x00000100UL |
28 | #define F_SHRINK 0x00000200UL |
29 | #define F_SHRINK 0x00000200UL |
29 | #define F_ALLOW_BLESSED 0x00000400UL |
30 | #define F_ALLOW_BLESSED 0x00000400UL |
30 | #define F_CONV_BLESSED 0x00000800UL |
31 | #define F_CONV_BLESSED 0x00000800UL |
|
|
32 | #define F_RELAXED 0x00001000UL |
|
|
33 | |
31 | #define F_MAXDEPTH 0xf8000000UL |
34 | #define F_MAXDEPTH 0xf8000000UL |
32 | #define S_MAXDEPTH 27 |
35 | #define S_MAXDEPTH 27 |
33 | #define F_MAXSIZE 0x01f00000UL |
36 | #define F_MAXSIZE 0x01f00000UL |
34 | #define S_MAXSIZE 20 |
37 | #define S_MAXSIZE 20 |
35 | #define F_HOOK 0x00080000UL // some hooks exist, so slow-path processing |
38 | #define F_HOOK 0x00080000UL // some hooks exist, so slow-path processing |
… | |
… | |
56 | # define inline static |
59 | # define inline static |
57 | #endif |
60 | #endif |
58 | |
61 | |
59 | #define expect_false(expr) expect ((expr) != 0, 0) |
62 | #define expect_false(expr) expect ((expr) != 0, 0) |
60 | #define expect_true(expr) expect ((expr) != 0, 1) |
63 | #define expect_true(expr) expect ((expr) != 0, 1) |
|
|
64 | |
|
|
65 | #ifdef USE_ITHREADS |
|
|
66 | # define JSON_SLOW 1 |
|
|
67 | # define JSON_STASH (json_stash ? json_stash : gv_stashpv ("JSON::XS", 1)) |
|
|
68 | #else |
|
|
69 | # define JSON_SLOW 0 |
|
|
70 | # define JSON_STASH json_stash |
|
|
71 | #endif |
61 | |
72 | |
62 | static HV *json_stash, *json_boolean_stash; // JSON::XS:: |
73 | static HV *json_stash, *json_boolean_stash; // JSON::XS:: |
63 | static SV *json_true, *json_false; |
74 | static SV *json_true, *json_false; |
64 | |
75 | |
65 | typedef struct { |
76 | typedef struct { |
… | |
… | |
306 | encode_ch (enc, '['); encode_nl (enc); |
317 | encode_ch (enc, '['); encode_nl (enc); |
307 | ++enc->indent; |
318 | ++enc->indent; |
308 | |
319 | |
309 | for (i = 0; i <= len; ++i) |
320 | for (i = 0; i <= len; ++i) |
310 | { |
321 | { |
|
|
322 | SV **svp = av_fetch (av, i, 0); |
|
|
323 | |
311 | encode_indent (enc); |
324 | encode_indent (enc); |
312 | encode_sv (enc, *av_fetch (av, i, 0)); |
325 | |
|
|
326 | if (svp) |
|
|
327 | encode_sv (enc, *svp); |
|
|
328 | else |
|
|
329 | encode_str (enc, "null", 4, 0); |
313 | |
330 | |
314 | if (i < len) |
331 | if (i < len) |
315 | encode_comma (enc); |
332 | encode_comma (enc); |
316 | } |
333 | } |
317 | |
334 | |
… | |
… | |
320 | --enc->indent; |
337 | --enc->indent; |
321 | encode_indent (enc); encode_ch (enc, ']'); |
338 | encode_indent (enc); encode_ch (enc, ']'); |
322 | } |
339 | } |
323 | |
340 | |
324 | static void |
341 | static void |
325 | encode_he (enc_t *enc, HE *he) |
342 | encode_hk (enc_t *enc, HE *he) |
326 | { |
343 | { |
327 | encode_ch (enc, '"'); |
344 | encode_ch (enc, '"'); |
328 | |
345 | |
329 | if (HeKLEN (he) == HEf_SVKEY) |
346 | if (HeKLEN (he) == HEf_SVKEY) |
330 | { |
347 | { |
… | |
… | |
343 | encode_ch (enc, '"'); |
360 | encode_ch (enc, '"'); |
344 | |
361 | |
345 | if (enc->json.flags & F_SPACE_BEFORE) encode_space (enc); |
362 | if (enc->json.flags & F_SPACE_BEFORE) encode_space (enc); |
346 | encode_ch (enc, ':'); |
363 | encode_ch (enc, ':'); |
347 | if (enc->json.flags & F_SPACE_AFTER ) encode_space (enc); |
364 | if (enc->json.flags & F_SPACE_AFTER ) encode_space (enc); |
348 | encode_sv (enc, HeVAL (he)); |
|
|
349 | } |
365 | } |
350 | |
366 | |
351 | // compare hash entries, used when all keys are bytestrings |
367 | // compare hash entries, used when all keys are bytestrings |
352 | static int |
368 | static int |
353 | he_cmp_fast (const void *a_, const void *b_) |
369 | he_cmp_fast (const void *a_, const void *b_) |
… | |
… | |
358 | HE *b = *(HE **)b_; |
374 | HE *b = *(HE **)b_; |
359 | |
375 | |
360 | STRLEN la = HeKLEN (a); |
376 | STRLEN la = HeKLEN (a); |
361 | STRLEN lb = HeKLEN (b); |
377 | STRLEN lb = HeKLEN (b); |
362 | |
378 | |
363 | if (!(cmp = memcmp (HeKEY (a), HeKEY (b), la < lb ? la : lb))) |
379 | if (!(cmp = memcmp (HeKEY (b), HeKEY (a), lb < la ? lb : la))) |
364 | cmp = la - lb; |
380 | cmp = lb - la; |
365 | |
381 | |
366 | return cmp; |
382 | return cmp; |
367 | } |
383 | } |
368 | |
384 | |
369 | // compare hash entries, used when some keys are sv's or utf-x |
385 | // compare hash entries, used when some keys are sv's or utf-x |
370 | static int |
386 | static int |
371 | he_cmp_slow (const void *a, const void *b) |
387 | he_cmp_slow (const void *a, const void *b) |
372 | { |
388 | { |
373 | return sv_cmp (HeSVKEY_force (*(HE **)a), HeSVKEY_force (*(HE **)b)); |
389 | return sv_cmp (HeSVKEY_force (*(HE **)b), HeSVKEY_force (*(HE **)a)); |
374 | } |
390 | } |
375 | |
391 | |
376 | static void |
392 | static void |
377 | encode_hv (enc_t *enc, HV *hv) |
393 | encode_hv (enc_t *enc, HV *hv) |
378 | { |
394 | { |
|
|
395 | HE *he; |
379 | int count, i; |
396 | int count; |
380 | |
397 | |
381 | if (enc->indent >= enc->maxdepth) |
398 | if (enc->indent >= enc->maxdepth) |
382 | croak ("data structure too deep (hit recursion limit)"); |
399 | croak ("data structure too deep (hit recursion limit)"); |
383 | |
400 | |
384 | encode_ch (enc, '{'); encode_nl (enc); ++enc->indent; |
401 | encode_ch (enc, '{'); encode_nl (enc); ++enc->indent; |
385 | |
402 | |
386 | if ((count = hv_iterinit (hv))) |
|
|
387 | { |
|
|
388 | // for canonical output we have to sort by keys first |
403 | // for canonical output we have to sort by keys first |
389 | // actually, this is mostly due to the stupid so-called |
404 | // actually, this is mostly due to the stupid so-called |
390 | // security workaround added somewhere in 5.8.x. |
405 | // security workaround added somewhere in 5.8.x. |
391 | // that randomises hash orderings |
406 | // that randomises hash orderings |
392 | if (enc->json.flags & F_CANONICAL) |
407 | if (enc->json.flags & F_CANONICAL) |
|
|
408 | { |
|
|
409 | int count = hv_iterinit (hv); |
|
|
410 | |
|
|
411 | if (SvMAGICAL (hv)) |
393 | { |
412 | { |
|
|
413 | // need to count by iterating. could improve by dynamically building the vector below |
|
|
414 | // but I don't care for the speed of this special case. |
|
|
415 | // note also that we will run into undefined behaviour when the two iterations |
|
|
416 | // do not result in the same count, something I might care for in some later release. |
|
|
417 | |
|
|
418 | count = 0; |
|
|
419 | while (hv_iternext (hv)) |
|
|
420 | ++count; |
|
|
421 | |
|
|
422 | hv_iterinit (hv); |
|
|
423 | } |
|
|
424 | |
|
|
425 | if (count) |
|
|
426 | { |
394 | int fast = 1; |
427 | int i, fast = 1; |
395 | HE *he; |
|
|
396 | #if defined(__BORLANDC__) || defined(_MSC_VER) |
428 | #if defined(__BORLANDC__) || defined(_MSC_VER) |
397 | HE **hes = _alloca (count * sizeof (HE)); |
429 | HE **hes = _alloca (count * sizeof (HE)); |
398 | #else |
430 | #else |
399 | HE *hes [count]; // if your compiler dies here, you need to enable C99 mode |
431 | HE *hes [count]; // if your compiler dies here, you need to enable C99 mode |
400 | #endif |
432 | #endif |
… | |
… | |
427 | |
459 | |
428 | FREETMPS; |
460 | FREETMPS; |
429 | LEAVE; |
461 | LEAVE; |
430 | } |
462 | } |
431 | |
463 | |
432 | for (i = 0; i < count; ++i) |
464 | while (count--) |
433 | { |
465 | { |
434 | encode_indent (enc); |
466 | encode_indent (enc); |
|
|
467 | he = hes [count]; |
435 | encode_he (enc, hes [i]); |
468 | encode_hk (enc, he); |
|
|
469 | encode_sv (enc, expect_false (SvMAGICAL (hv)) ? hv_iterval (hv, he) : HeVAL (he)); |
436 | |
470 | |
437 | if (i < count - 1) |
471 | if (count) |
438 | encode_comma (enc); |
472 | encode_comma (enc); |
439 | } |
473 | } |
440 | |
|
|
441 | encode_nl (enc); |
|
|
442 | } |
474 | } |
|
|
475 | } |
443 | else |
476 | else |
444 | { |
477 | { |
|
|
478 | if (hv_iterinit (hv) || SvMAGICAL (hv)) |
445 | HE *he = hv_iternext (hv); |
479 | if ((he = hv_iternext (hv))) |
446 | |
|
|
447 | for (;;) |
480 | for (;;) |
448 | { |
481 | { |
449 | encode_indent (enc); |
482 | encode_indent (enc); |
450 | encode_he (enc, he); |
483 | encode_hk (enc, he); |
|
|
484 | encode_sv (enc, expect_false (SvMAGICAL (hv)) ? hv_iterval (hv, he) : HeVAL (he)); |
451 | |
485 | |
452 | if (!(he = hv_iternext (hv))) |
486 | if (!(he = hv_iternext (hv))) |
453 | break; |
487 | break; |
454 | |
488 | |
455 | encode_comma (enc); |
489 | encode_comma (enc); |
456 | } |
490 | } |
|
|
491 | } |
457 | |
492 | |
458 | encode_nl (enc); |
493 | encode_nl (enc); |
459 | } |
|
|
460 | } |
|
|
461 | |
494 | |
462 | --enc->indent; encode_indent (enc); encode_ch (enc, '}'); |
495 | --enc->indent; encode_indent (enc); encode_ch (enc, '}'); |
463 | } |
496 | } |
464 | |
497 | |
465 | // encode objects, arrays and special \0=false and \1=true values. |
498 | // encode objects, arrays and special \0=false and \1=true values. |
… | |
… | |
471 | SvGETMAGIC (sv); |
504 | SvGETMAGIC (sv); |
472 | svt = SvTYPE (sv); |
505 | svt = SvTYPE (sv); |
473 | |
506 | |
474 | if (expect_false (SvOBJECT (sv))) |
507 | if (expect_false (SvOBJECT (sv))) |
475 | { |
508 | { |
|
|
509 | HV *stash = !JSON_SLOW || json_boolean_stash |
|
|
510 | ? json_boolean_stash |
|
|
511 | : gv_stashpv ("JSON::XS::Boolean", 1); |
|
|
512 | |
476 | if (SvSTASH (sv) == json_boolean_stash) |
513 | if (SvSTASH (sv) == stash) |
477 | { |
514 | { |
478 | if (SvIV (sv)) |
515 | if (SvIV (sv)) |
479 | encode_str (enc, "true", 4, 0); |
516 | encode_str (enc, "true", 4, 0); |
480 | else |
517 | else |
481 | encode_str (enc, "false", 5, 0); |
518 | encode_str (enc, "false", 5, 0); |
… | |
… | |
499 | |
536 | |
500 | ENTER; SAVETMPS; PUSHMARK (SP); |
537 | ENTER; SAVETMPS; PUSHMARK (SP); |
501 | XPUSHs (sv_bless (sv_2mortal (newRV_inc (sv)), SvSTASH (sv))); |
538 | XPUSHs (sv_bless (sv_2mortal (newRV_inc (sv)), SvSTASH (sv))); |
502 | |
539 | |
503 | // calling with G_SCALAR ensures that we always get a 1 return value |
540 | // calling with G_SCALAR ensures that we always get a 1 return value |
504 | // check anyways. |
|
|
505 | PUTBACK; |
541 | PUTBACK; |
506 | assert (1 == call_sv ((SV *)GvCV (to_json), G_SCALAR)); |
542 | call_sv ((SV *)GvCV (to_json), G_SCALAR); |
507 | SPAGAIN; |
543 | SPAGAIN; |
508 | |
544 | |
509 | // catch this surprisingly common error |
545 | // catch this surprisingly common error |
510 | if (SvROK (TOPs) && SvRV (TOPs) == sv) |
546 | if (SvROK (TOPs) && SvRV (TOPs) == sv) |
511 | croak ("%s::TO_JSON method returned same object as was passed instead of a new one", HvNAME (SvSTASH (sv))); |
547 | croak ("%s::TO_JSON method returned same object as was passed instead of a new one", HvNAME (SvSTASH (sv))); |
… | |
… | |
664 | U32 depth; // recursion depth |
700 | U32 depth; // recursion depth |
665 | U32 maxdepth; // recursion depth limit |
701 | U32 maxdepth; // recursion depth limit |
666 | } dec_t; |
702 | } dec_t; |
667 | |
703 | |
668 | inline void |
704 | inline void |
|
|
705 | decode_comment (dec_t *dec) |
|
|
706 | { |
|
|
707 | // only '#'-style comments allowed a.t.m. |
|
|
708 | |
|
|
709 | while (*dec->cur && *dec->cur != 0x0a && *dec->cur != 0x0d) |
|
|
710 | ++dec->cur; |
|
|
711 | } |
|
|
712 | |
|
|
713 | inline void |
669 | decode_ws (dec_t *dec) |
714 | decode_ws (dec_t *dec) |
670 | { |
715 | { |
671 | for (;;) |
716 | for (;;) |
672 | { |
717 | { |
673 | char ch = *dec->cur; |
718 | char ch = *dec->cur; |
674 | |
719 | |
675 | if (ch > 0x20 |
720 | if (ch > 0x20) |
|
|
721 | { |
|
|
722 | if (expect_false (ch == '#')) |
|
|
723 | { |
|
|
724 | if (dec->json.flags & F_RELAXED) |
|
|
725 | decode_comment (dec); |
|
|
726 | else |
|
|
727 | break; |
|
|
728 | } |
|
|
729 | else |
|
|
730 | break; |
|
|
731 | } |
676 | || (ch != 0x20 && ch != 0x0a && ch != 0x0d && ch != 0x09)) |
732 | else if (ch != 0x20 && ch != 0x0a && ch != 0x0d && ch != 0x09) |
677 | break; |
733 | break; // parse error, but let higher level handle it, gives better error messages |
678 | |
734 | |
679 | ++dec->cur; |
735 | ++dec->cur; |
680 | } |
736 | } |
681 | } |
737 | } |
682 | |
738 | |
… | |
… | |
931 | is_nv = 1; |
987 | is_nv = 1; |
932 | } |
988 | } |
933 | |
989 | |
934 | if (!is_nv) |
990 | if (!is_nv) |
935 | { |
991 | { |
|
|
992 | int len = dec->cur - start; |
|
|
993 | |
936 | // special case the rather common 1..4-digit-int case, assumes 32 bit ints or so |
994 | // special case the rather common 1..4-digit-int case, assumes 32 bit ints or so |
937 | if (*start == '-') |
995 | if (*start == '-') |
938 | switch (dec->cur - start) |
996 | switch (len) |
939 | { |
997 | { |
940 | case 2: return newSViv (-( start [1] - '0' * 1)); |
998 | case 2: return newSViv (-( start [1] - '0' * 1)); |
941 | case 3: return newSViv (-( start [1] * 10 + start [2] - '0' * 11)); |
999 | case 3: return newSViv (-( start [1] * 10 + start [2] - '0' * 11)); |
942 | case 4: return newSViv (-( start [1] * 100 + start [2] * 10 + start [3] - '0' * 111)); |
1000 | case 4: return newSViv (-( start [1] * 100 + start [2] * 10 + start [3] - '0' * 111)); |
943 | case 5: return newSViv (-(start [1] * 1000 + start [2] * 100 + start [3] * 10 + start [4] - '0' * 1111)); |
1001 | case 5: return newSViv (-(start [1] * 1000 + start [2] * 100 + start [3] * 10 + start [4] - '0' * 1111)); |
944 | } |
1002 | } |
945 | else |
1003 | else |
946 | switch (dec->cur - start) |
1004 | switch (len) |
947 | { |
1005 | { |
948 | case 1: return newSViv ( start [0] - '0' * 1); |
1006 | case 1: return newSViv ( start [0] - '0' * 1); |
949 | case 2: return newSViv ( start [0] * 10 + start [1] - '0' * 11); |
1007 | case 2: return newSViv ( start [0] * 10 + start [1] - '0' * 11); |
950 | case 3: return newSViv ( start [0] * 100 + start [1] * 10 + start [2] - '0' * 111); |
1008 | case 3: return newSViv ( start [0] * 100 + start [1] * 10 + start [2] - '0' * 111); |
951 | case 4: return newSViv ( start [0] * 1000 + start [1] * 100 + start [2] * 10 + start [3] - '0' * 1111); |
1009 | case 4: return newSViv ( start [0] * 1000 + start [1] * 100 + start [2] * 10 + start [3] - '0' * 1111); |
952 | } |
1010 | } |
953 | |
1011 | |
954 | { |
1012 | { |
955 | UV uv; |
1013 | UV uv; |
956 | int numtype = grok_number (start, dec->cur - start, &uv); |
1014 | int numtype = grok_number (start, len, &uv); |
957 | if (numtype & IS_NUMBER_IN_UV) |
1015 | if (numtype & IS_NUMBER_IN_UV) |
958 | if (numtype & IS_NUMBER_NEG) |
1016 | if (numtype & IS_NUMBER_NEG) |
959 | { |
1017 | { |
960 | if (uv < (UV)IV_MIN) |
1018 | if (uv < (UV)IV_MIN) |
961 | return newSViv (-(IV)uv); |
1019 | return newSViv (-(IV)uv); |
962 | } |
1020 | } |
963 | else |
1021 | else |
964 | return newSVuv (uv); |
1022 | return newSVuv (uv); |
965 | |
|
|
966 | // here would likely be the place for bigint support |
|
|
967 | } |
1023 | } |
968 | } |
|
|
969 | |
1024 | |
970 | // if we ever support bigint or bigfloat, this is the place for bigfloat |
1025 | len -= *start == '-' ? 1 : 0; |
|
|
1026 | |
|
|
1027 | // does not fit into IV or UV, try NV |
|
|
1028 | if ((sizeof (NV) == sizeof (double) && DBL_DIG >= len) |
|
|
1029 | #if defined (LDBL_DIG) |
|
|
1030 | || (sizeof (NV) == sizeof (long double) && LDBL_DIG >= len) |
|
|
1031 | #endif |
|
|
1032 | ) |
|
|
1033 | // fits into NV without loss of precision |
|
|
1034 | return newSVnv (Atof (start)); |
|
|
1035 | |
|
|
1036 | // everything else fails, convert it to a string |
|
|
1037 | return newSVpvn (start, dec->cur - start); |
|
|
1038 | } |
|
|
1039 | |
|
|
1040 | // loss of precision here |
971 | return newSVnv (Atof (start)); |
1041 | return newSVnv (Atof (start)); |
972 | |
1042 | |
973 | fail: |
1043 | fail: |
974 | return 0; |
1044 | return 0; |
975 | } |
1045 | } |
… | |
… | |
1005 | |
1075 | |
1006 | if (*dec->cur != ',') |
1076 | if (*dec->cur != ',') |
1007 | ERR (", or ] expected while parsing array"); |
1077 | ERR (", or ] expected while parsing array"); |
1008 | |
1078 | |
1009 | ++dec->cur; |
1079 | ++dec->cur; |
|
|
1080 | |
|
|
1081 | decode_ws (dec); |
|
|
1082 | |
|
|
1083 | if (*dec->cur == ']' && dec->json.flags & F_RELAXED) |
|
|
1084 | { |
|
|
1085 | ++dec->cur; |
|
|
1086 | break; |
|
|
1087 | } |
1010 | } |
1088 | } |
1011 | |
1089 | |
1012 | DEC_DEC_DEPTH; |
1090 | DEC_DEC_DEPTH; |
1013 | return newRV_noinc ((SV *)av); |
1091 | return newRV_noinc ((SV *)av); |
1014 | |
1092 | |
… | |
… | |
1030 | if (*dec->cur == '}') |
1108 | if (*dec->cur == '}') |
1031 | ++dec->cur; |
1109 | ++dec->cur; |
1032 | else |
1110 | else |
1033 | for (;;) |
1111 | for (;;) |
1034 | { |
1112 | { |
1035 | decode_ws (dec); EXPECT_CH ('"'); |
1113 | EXPECT_CH ('"'); |
1036 | |
1114 | |
1037 | // heuristic: assume that |
1115 | // heuristic: assume that |
1038 | // a) decode_str + hv_store_ent are abysmally slow. |
1116 | // a) decode_str + hv_store_ent are abysmally slow. |
1039 | // b) most hash keys are short, simple ascii text. |
1117 | // b) most hash keys are short, simple ascii text. |
1040 | // => try to "fast-match" such strings to avoid |
1118 | // => try to "fast-match" such strings to avoid |
… | |
… | |
1054 | if (!key) |
1132 | if (!key) |
1055 | goto fail; |
1133 | goto fail; |
1056 | |
1134 | |
1057 | decode_ws (dec); EXPECT_CH (':'); |
1135 | decode_ws (dec); EXPECT_CH (':'); |
1058 | |
1136 | |
|
|
1137 | decode_ws (dec); |
1059 | value = decode_sv (dec); |
1138 | value = decode_sv (dec); |
1060 | if (!value) |
1139 | if (!value) |
1061 | { |
1140 | { |
1062 | SvREFCNT_dec (key); |
1141 | SvREFCNT_dec (key); |
1063 | goto fail; |
1142 | goto fail; |
… | |
… | |
1075 | int len = p - key; |
1154 | int len = p - key; |
1076 | dec->cur = p + 1; |
1155 | dec->cur = p + 1; |
1077 | |
1156 | |
1078 | decode_ws (dec); EXPECT_CH (':'); |
1157 | decode_ws (dec); EXPECT_CH (':'); |
1079 | |
1158 | |
|
|
1159 | decode_ws (dec); |
1080 | value = decode_sv (dec); |
1160 | value = decode_sv (dec); |
1081 | if (!value) |
1161 | if (!value) |
1082 | goto fail; |
1162 | goto fail; |
1083 | |
1163 | |
1084 | hv_store (hv, key, len, value, 0); |
1164 | hv_store (hv, key, len, value, 0); |
… | |
… | |
1100 | |
1180 | |
1101 | if (*dec->cur != ',') |
1181 | if (*dec->cur != ',') |
1102 | ERR (", or } expected while parsing object/hash"); |
1182 | ERR (", or } expected while parsing object/hash"); |
1103 | |
1183 | |
1104 | ++dec->cur; |
1184 | ++dec->cur; |
|
|
1185 | |
|
|
1186 | decode_ws (dec); |
|
|
1187 | |
|
|
1188 | if (*dec->cur == '}' && dec->json.flags & F_RELAXED) |
|
|
1189 | { |
|
|
1190 | ++dec->cur; |
|
|
1191 | break; |
|
|
1192 | } |
1105 | } |
1193 | } |
1106 | |
1194 | |
1107 | DEC_DEC_DEPTH; |
1195 | DEC_DEC_DEPTH; |
1108 | sv = newRV_noinc ((SV *)hv); |
1196 | sv = newRV_noinc ((SV *)hv); |
1109 | |
1197 | |
… | |
… | |
1174 | } |
1262 | } |
1175 | |
1263 | |
1176 | static SV * |
1264 | static SV * |
1177 | decode_sv (dec_t *dec) |
1265 | decode_sv (dec_t *dec) |
1178 | { |
1266 | { |
1179 | decode_ws (dec); |
|
|
1180 | |
|
|
1181 | // the beauty of JSON: you need exactly one character lookahead |
1267 | // the beauty of JSON: you need exactly one character lookahead |
1182 | // to parse anything. |
1268 | // to parse anything. |
1183 | switch (*dec->cur) |
1269 | switch (*dec->cur) |
1184 | { |
1270 | { |
1185 | case '"': ++dec->cur; return decode_str (dec); |
1271 | case '"': ++dec->cur; return decode_str (dec); |
… | |
… | |
1193 | |
1279 | |
1194 | case 't': |
1280 | case 't': |
1195 | if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "true", 4)) |
1281 | if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "true", 4)) |
1196 | { |
1282 | { |
1197 | dec->cur += 4; |
1283 | dec->cur += 4; |
|
|
1284 | #if JSON_SLOW |
|
|
1285 | json_true = get_sv ("JSON::XS::true", 1); SvREADONLY_on (json_true); |
|
|
1286 | #endif |
1198 | return SvREFCNT_inc (json_true); |
1287 | return SvREFCNT_inc (json_true); |
1199 | } |
1288 | } |
1200 | else |
1289 | else |
1201 | ERR ("'true' expected"); |
1290 | ERR ("'true' expected"); |
1202 | |
1291 | |
… | |
… | |
1204 | |
1293 | |
1205 | case 'f': |
1294 | case 'f': |
1206 | if (dec->end - dec->cur >= 5 && !memcmp (dec->cur, "false", 5)) |
1295 | if (dec->end - dec->cur >= 5 && !memcmp (dec->cur, "false", 5)) |
1207 | { |
1296 | { |
1208 | dec->cur += 5; |
1297 | dec->cur += 5; |
|
|
1298 | #if JSON_SLOW |
|
|
1299 | json_false = get_sv ("JSON::XS::false", 1); SvREADONLY_on (json_false); |
|
|
1300 | #endif |
1209 | return SvREFCNT_inc (json_false); |
1301 | return SvREFCNT_inc (json_false); |
1210 | } |
1302 | } |
1211 | else |
1303 | else |
1212 | ERR ("'false' expected"); |
1304 | ERR ("'false' expected"); |
1213 | |
1305 | |
… | |
… | |
1263 | |
1355 | |
1264 | if (dec.json.cb_object || dec.json.cb_sk_object) |
1356 | if (dec.json.cb_object || dec.json.cb_sk_object) |
1265 | dec.json.flags |= F_HOOK; |
1357 | dec.json.flags |= F_HOOK; |
1266 | |
1358 | |
1267 | *dec.end = 0; // this should basically be a nop, too, but make sure it's there |
1359 | *dec.end = 0; // this should basically be a nop, too, but make sure it's there |
|
|
1360 | |
|
|
1361 | decode_ws (&dec); |
1268 | sv = decode_sv (&dec); |
1362 | sv = decode_sv (&dec); |
1269 | |
1363 | |
1270 | if (!(offset_return || !sv)) |
1364 | if (!(offset_return || !sv)) |
1271 | { |
1365 | { |
1272 | // check for trailing garbage |
1366 | // check for trailing garbage |
… | |
… | |
1340 | json_false = get_sv ("JSON::XS::false", 1); SvREADONLY_on (json_false); |
1434 | json_false = get_sv ("JSON::XS::false", 1); SvREADONLY_on (json_false); |
1341 | } |
1435 | } |
1342 | |
1436 | |
1343 | PROTOTYPES: DISABLE |
1437 | PROTOTYPES: DISABLE |
1344 | |
1438 | |
|
|
1439 | void CLONE (...) |
|
|
1440 | CODE: |
|
|
1441 | json_stash = 0; |
|
|
1442 | json_boolean_stash = 0; |
|
|
1443 | |
1345 | void new (char *klass) |
1444 | void new (char *klass) |
1346 | PPCODE: |
1445 | PPCODE: |
1347 | { |
1446 | { |
1348 | SV *pv = NEWSV (0, sizeof (JSON)); |
1447 | SV *pv = NEWSV (0, sizeof (JSON)); |
1349 | SvPOK_only (pv); |
1448 | SvPOK_only (pv); |
1350 | Zero (SvPVX (pv), 1, JSON); |
1449 | Zero (SvPVX (pv), 1, JSON); |
1351 | ((JSON *)SvPVX (pv))->flags = F_DEFAULT; |
1450 | ((JSON *)SvPVX (pv))->flags = F_DEFAULT; |
1352 | XPUSHs (sv_2mortal (sv_bless (newRV_noinc (pv), json_stash))); |
1451 | XPUSHs (sv_2mortal (sv_bless (newRV_noinc (pv), JSON_STASH))); |
1353 | } |
1452 | } |
1354 | |
1453 | |
1355 | void ascii (JSON *self, int enable = 1) |
1454 | void ascii (JSON *self, int enable = 1) |
1356 | ALIAS: |
1455 | ALIAS: |
1357 | ascii = F_ASCII |
1456 | ascii = F_ASCII |
… | |
… | |
1364 | pretty = F_PRETTY |
1463 | pretty = F_PRETTY |
1365 | allow_nonref = F_ALLOW_NONREF |
1464 | allow_nonref = F_ALLOW_NONREF |
1366 | shrink = F_SHRINK |
1465 | shrink = F_SHRINK |
1367 | allow_blessed = F_ALLOW_BLESSED |
1466 | allow_blessed = F_ALLOW_BLESSED |
1368 | convert_blessed = F_CONV_BLESSED |
1467 | convert_blessed = F_CONV_BLESSED |
|
|
1468 | relaxed = F_RELAXED |
1369 | PPCODE: |
1469 | PPCODE: |
1370 | { |
1470 | { |
1371 | if (enable) |
1471 | if (enable) |
1372 | self->flags |= ix; |
1472 | self->flags |= ix; |
1373 | else |
1473 | else |