| … | |
… | |
| 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 <limits.h> |
9 | #include <limits.h> |
| 10 | #include <float.h> |
10 | #include <float.h> |
|
|
11 | #include <inttypes.h> |
| 11 | |
12 | |
| 12 | #define ECB_NO_THREADS 1 |
13 | #define ECB_NO_THREADS 1 |
| 13 | #include "ecb.h" |
14 | #include "ecb.h" |
| 14 | |
15 | |
| 15 | // compatibility with perl <5.18 |
16 | // compatibility with perl <5.18 |
| … | |
… | |
| 99 | |
100 | |
| 100 | #define F_SHRINK 0x00000001UL |
101 | #define F_SHRINK 0x00000001UL |
| 101 | #define F_ALLOW_UNKNOWN 0x00000002UL |
102 | #define F_ALLOW_UNKNOWN 0x00000002UL |
| 102 | #define F_ALLOW_SHARING 0x00000004UL |
103 | #define F_ALLOW_SHARING 0x00000004UL |
| 103 | #define F_ALLOW_CYCLES 0x00000008UL |
104 | #define F_ALLOW_CYCLES 0x00000008UL |
|
|
105 | #define F_FORBID_OBJECTS 0x00000010UL |
| 104 | #define F_PACK_STRINGS 0x00000010UL |
106 | #define F_PACK_STRINGS 0x00000020UL |
|
|
107 | #define F_TEXT_KEYS 0x00000040UL |
| 105 | #define F_UTF8_STRINGS 0x00000020UL |
108 | #define F_TEXT_STRINGS 0x00000080UL |
| 106 | #define F_VALIDATE_UTF8 0x00000040UL |
109 | #define F_VALIDATE_UTF8 0x00000100UL |
| 107 | |
110 | |
| 108 | #define INIT_SIZE 32 // initial scalar size to be allocated |
111 | #define INIT_SIZE 32 // initial scalar size to be allocated |
| 109 | |
112 | |
| 110 | #define SB do { |
113 | #define SB do { |
| 111 | #define SE } while (0) |
114 | #define SE } while (0) |
| … | |
… | |
| 184 | |
187 | |
| 185 | // minimum length of a string to be registered for stringref |
188 | // minimum length of a string to be registered for stringref |
| 186 | ecb_inline int |
189 | ecb_inline int |
| 187 | minimum_string_length (UV idx) |
190 | minimum_string_length (UV idx) |
| 188 | { |
191 | { |
| 189 | return idx > 23 |
192 | |
| 190 | ? idx > 0xffU |
193 | return idx <= 23 ? 3 |
| 191 | ? idx > 0xffffU |
194 | : idx <= 0xffU ? 4 |
|
|
195 | : idx <= 0xffffU ? 5 |
| 192 | ? idx > 0xffffffffU |
196 | : idx <= 0xffffffffU ? 7 |
| 193 | ? 11 |
197 | : 11; |
| 194 | : 7 |
|
|
| 195 | : 5 |
|
|
| 196 | : 4 |
|
|
| 197 | : 3; |
|
|
| 198 | } |
198 | } |
| 199 | |
199 | |
| 200 | ///////////////////////////////////////////////////////////////////////////// |
200 | ///////////////////////////////////////////////////////////////////////////// |
| 201 | // encoder |
201 | // encoder |
| 202 | |
202 | |
| … | |
… | |
| 215 | } enc_t; |
215 | } enc_t; |
| 216 | |
216 | |
| 217 | ecb_inline void |
217 | ecb_inline void |
| 218 | need (enc_t *enc, STRLEN len) |
218 | need (enc_t *enc, STRLEN len) |
| 219 | { |
219 | { |
| 220 | if (ecb_expect_false (enc->cur + len >= enc->end)) |
220 | if (ecb_expect_false ((uintptr_t)(enc->end - enc->cur) < len)) |
| 221 | { |
221 | { |
| 222 | STRLEN cur = enc->cur - (char *)SvPVX (enc->sv); |
222 | STRLEN cur = enc->cur - (char *)SvPVX (enc->sv); |
| 223 | SvGROW (enc->sv, cur + (len < (cur >> 2) ? cur >> 2 : len) + 1); |
223 | SvGROW (enc->sv, cur + (len < (cur >> 2) ? cur >> 2 : len) + 1); |
| 224 | enc->cur = SvPVX (enc->sv) + cur; |
224 | enc->cur = SvPVX (enc->sv) + cur; |
| 225 | enc->end = SvPVX (enc->sv) + SvLEN (enc->sv) - 1; |
225 | enc->end = SvPVX (enc->sv) + SvLEN (enc->sv) - 1; |
| … | |
… | |
| 277 | encode_tag (enc_t *enc, UV tag) |
277 | encode_tag (enc_t *enc, UV tag) |
| 278 | { |
278 | { |
| 279 | encode_uint (enc, MAJOR_TAG, tag); |
279 | encode_uint (enc, MAJOR_TAG, tag); |
| 280 | } |
280 | } |
| 281 | |
281 | |
|
|
282 | // exceptional (hopefully) slow path for byte strings that need to be utf8-encoded |
|
|
283 | ecb_noinline static void |
|
|
284 | encode_str_utf8 (enc_t *enc, int utf8, char *str, STRLEN len) |
|
|
285 | { |
|
|
286 | STRLEN ulen = len; |
|
|
287 | U8 *p, *pend = (U8 *)str + len; |
|
|
288 | |
|
|
289 | for (p = (U8 *)str; p < pend; ++p) |
|
|
290 | ulen += *p >> 7; // count set high bits |
|
|
291 | |
|
|
292 | encode_uint (enc, MAJOR_TEXT, ulen); |
|
|
293 | |
|
|
294 | need (enc, ulen); |
|
|
295 | for (p = (U8 *)str; p < pend; ++p) |
|
|
296 | if (*p < 0x80) |
|
|
297 | *enc->cur++ = *p; |
|
|
298 | else |
|
|
299 | { |
|
|
300 | *enc->cur++ = 0xc0 + (*p >> 6); |
|
|
301 | *enc->cur++ = 0x80 + (*p & 63); |
|
|
302 | } |
|
|
303 | } |
|
|
304 | |
| 282 | ecb_inline void |
305 | ecb_inline void |
| 283 | encode_str (enc_t *enc, int utf8, char *str, STRLEN len) |
306 | encode_str (enc_t *enc, int upgrade_utf8, int utf8, char *str, STRLEN len) |
| 284 | { |
307 | { |
| 285 | if (ecb_expect_false (enc->cbor.flags & F_UTF8_STRINGS)) |
308 | if (ecb_expect_false (upgrade_utf8)) |
| 286 | if (!utf8) |
309 | if (!utf8) |
| 287 | { |
310 | { |
| 288 | // exceptional path for bytze strings that need to be utf8-encoded |
311 | encode_str_utf8 (enc, utf8, str, len); |
| 289 | STRLEN ulen = len; |
|
|
| 290 | U8 *p, *pend = (U8 *)str + len; |
|
|
| 291 | |
|
|
| 292 | for (p = (U8 *)str; p < pend; ++p) |
|
|
| 293 | ulen += *p >> 7; // count set high bits |
|
|
| 294 | |
|
|
| 295 | encode_uint (enc, MAJOR_TEXT, ulen); |
|
|
| 296 | |
|
|
| 297 | need (enc, ulen); |
|
|
| 298 | for (p = (U8 *)str; p < pend; ++p) |
|
|
| 299 | if (*p < 0x80) |
|
|
| 300 | *enc->cur++ = *p; |
|
|
| 301 | else |
|
|
| 302 | { |
|
|
| 303 | *enc->cur++ = 0xc0 + (*p >> 6); |
|
|
| 304 | *enc->cur++ = 0x80 + (*p & 63); |
|
|
| 305 | } |
|
|
| 306 | |
|
|
| 307 | return; |
312 | return; |
| 308 | } |
313 | } |
| 309 | |
314 | |
| 310 | encode_uint (enc, utf8 ? MAJOR_TEXT : MAJOR_BYTES, len); |
315 | encode_uint (enc, utf8 ? MAJOR_TEXT : MAJOR_BYTES, len); |
| 311 | need (enc, len); |
316 | need (enc, len); |
| 312 | memcpy (enc->cur, str, len); |
317 | memcpy (enc->cur, str, len); |
| 313 | enc->cur += len; |
318 | enc->cur += len; |
| 314 | } |
319 | } |
| 315 | |
320 | |
| 316 | static void |
321 | ecb_inline void |
| 317 | encode_strref (enc_t *enc, int utf8, char *str, STRLEN len) |
322 | encode_strref (enc_t *enc, int upgrade_utf8, int utf8, char *str, STRLEN len) |
| 318 | { |
323 | { |
| 319 | if (ecb_expect_false (enc->cbor.flags & F_PACK_STRINGS)) |
324 | if (ecb_expect_false (enc->cbor.flags & F_PACK_STRINGS)) |
| 320 | { |
325 | { |
| 321 | SV **svp = hv_fetch (enc->stringref[!!utf8], str, len, 1); |
326 | SV **svp = hv_fetch (enc->stringref[!!utf8], str, len, 1); |
| 322 | |
327 | |
| … | |
… | |
| 333 | sv_setuv (*svp, enc->stringref_idx); |
338 | sv_setuv (*svp, enc->stringref_idx); |
| 334 | ++enc->stringref_idx; |
339 | ++enc->stringref_idx; |
| 335 | } |
340 | } |
| 336 | } |
341 | } |
| 337 | |
342 | |
| 338 | encode_str (enc, utf8, str, len); |
343 | encode_str (enc, upgrade_utf8, utf8, str, len); |
| 339 | } |
344 | } |
| 340 | |
345 | |
| 341 | static void encode_sv (enc_t *enc, SV *sv); |
346 | static void encode_sv (enc_t *enc, SV *sv); |
| 342 | |
347 | |
| 343 | static void |
348 | static void |
| … | |
… | |
| 389 | while ((he = hv_iternext (hv))) |
394 | while ((he = hv_iternext (hv))) |
| 390 | { |
395 | { |
| 391 | if (HeKLEN (he) == HEf_SVKEY) |
396 | if (HeKLEN (he) == HEf_SVKEY) |
| 392 | encode_sv (enc, HeSVKEY (he)); |
397 | encode_sv (enc, HeSVKEY (he)); |
| 393 | else |
398 | else |
| 394 | encode_strref (enc, HeKUTF8 (he), HeKEY (he), HeKLEN (he)); |
399 | encode_strref (enc, enc->cbor.flags & (F_TEXT_KEYS | F_TEXT_STRINGS), HeKUTF8 (he), HeKEY (he), HeKLEN (he)); |
| 395 | |
400 | |
| 396 | encode_sv (enc, ecb_expect_false (mg) ? hv_iterval (hv, he) : HeVAL (he)); |
401 | encode_sv (enc, ecb_expect_false (mg) ? hv_iterval (hv, he) : HeVAL (he)); |
| 397 | } |
402 | } |
| 398 | |
403 | |
| 399 | if (mg) |
404 | if (mg) |
| … | |
… | |
| 471 | if (ecb_expect_false (SvOBJECT (sv))) |
476 | if (ecb_expect_false (SvOBJECT (sv))) |
| 472 | { |
477 | { |
| 473 | HV *stash = SvSTASH (sv); |
478 | HV *stash = SvSTASH (sv); |
| 474 | GV *method; |
479 | GV *method; |
| 475 | |
480 | |
|
|
481 | if (enc->cbor.flags & F_FORBID_OBJECTS) |
|
|
482 | croak ("encountered object '%s', but forbid_objects is enabled", |
|
|
483 | SvPV_nolen (sv_2mortal (newRV_inc (sv)))); |
| 476 | if ((method = gv_fetchmethod_autoload (stash, "TO_CBOR", 0))) |
484 | else if ((method = gv_fetchmethod_autoload (stash, "TO_CBOR", 0))) |
| 477 | { |
485 | { |
| 478 | dSP; |
486 | dSP; |
| 479 | |
487 | |
| 480 | ENTER; SAVETMPS; |
488 | ENTER; SAVETMPS; |
| 481 | PUSHMARK (SP); |
489 | PUSHMARK (SP); |
| … | |
… | |
| 517 | if (count == 1 && SvROK (TOPs) && SvRV (TOPs) == sv) |
525 | if (count == 1 && SvROK (TOPs) && SvRV (TOPs) == sv) |
| 518 | croak ("%s::FREEZE(CBOR) method returned same object as was passed instead of a new one", HvNAME (stash)); |
526 | croak ("%s::FREEZE(CBOR) method returned same object as was passed instead of a new one", HvNAME (stash)); |
| 519 | |
527 | |
| 520 | encode_tag (enc, CBOR_TAG_PERL_OBJECT); |
528 | encode_tag (enc, CBOR_TAG_PERL_OBJECT); |
| 521 | encode_uint (enc, MAJOR_ARRAY, count + 1); |
529 | encode_uint (enc, MAJOR_ARRAY, count + 1); |
| 522 | encode_strref (enc, HvNAMEUTF8 (stash), HvNAME (stash), HvNAMELEN (stash)); |
530 | encode_strref (enc, 0, HvNAMEUTF8 (stash), HvNAME (stash), HvNAMELEN (stash)); |
| 523 | |
531 | |
| 524 | while (count) |
532 | while (count) |
| 525 | encode_sv (enc, SP[1 - count--]); |
533 | encode_sv (enc, SP[1 - count--]); |
| 526 | |
534 | |
| 527 | PUTBACK; |
535 | PUTBACK; |
| … | |
… | |
| 586 | |
594 | |
| 587 | if (SvPOKp (sv)) |
595 | if (SvPOKp (sv)) |
| 588 | { |
596 | { |
| 589 | STRLEN len; |
597 | STRLEN len; |
| 590 | char *str = SvPV (sv, len); |
598 | char *str = SvPV (sv, len); |
| 591 | encode_strref (enc, SvUTF8 (sv), str, len); |
599 | encode_strref (enc, enc->cbor.flags & F_TEXT_STRINGS, SvUTF8 (sv), str, len); |
| 592 | } |
600 | } |
| 593 | else if (SvNOKp (sv)) |
601 | else if (SvNOKp (sv)) |
| 594 | encode_nv (enc, sv); |
602 | encode_nv (enc, sv); |
| 595 | else if (SvIOKp (sv)) |
603 | else if (SvIOKp (sv)) |
| 596 | { |
604 | { |
| … | |
… | |
| 655 | U32 depth; // recursion depth |
663 | U32 depth; // recursion depth |
| 656 | U32 maxdepth; // recursion depth limit |
664 | U32 maxdepth; // recursion depth limit |
| 657 | AV *shareable; |
665 | AV *shareable; |
| 658 | AV *stringref; |
666 | AV *stringref; |
| 659 | SV *decode_tagged; |
667 | SV *decode_tagged; |
|
|
668 | SV *err_sv; // optional sv for error, needs to be freed |
| 660 | } dec_t; |
669 | } dec_t; |
| 661 | |
670 | |
| 662 | #define ERR(reason) SB if (!dec->err) dec->err = reason; goto fail; SE |
671 | // set dec->err to ERRSV |
|
|
672 | ecb_cold static void |
|
|
673 | err_errsv (dec_t *dec) |
|
|
674 | { |
|
|
675 | if (!dec->err) |
|
|
676 | { |
|
|
677 | dec->err_sv = newSVsv (ERRSV); |
| 663 | |
678 | |
| 664 | #define WANT(len) if (ecb_expect_false (dec->cur + len > dec->end)) ERR ("unexpected end of CBOR data") |
679 | // chop off the trailing \n |
|
|
680 | SvCUR_set (dec->err_sv, SvCUR (dec->err_sv) - 1); |
|
|
681 | *SvEND (dec->err_sv) = 0; |
| 665 | |
682 | |
|
|
683 | dec->err = SvPVutf8_nolen (dec->err_sv); |
|
|
684 | } |
|
|
685 | } |
|
|
686 | |
|
|
687 | // the following functions are used to reduce code size and help the compiler to optimise |
|
|
688 | ecb_cold static void |
|
|
689 | err_set (dec_t *dec, const char *reason) |
|
|
690 | { |
|
|
691 | if (!dec->err) |
|
|
692 | dec->err = reason; |
|
|
693 | } |
|
|
694 | |
|
|
695 | ecb_cold static void |
|
|
696 | err_unexpected_end (dec_t *dec) |
|
|
697 | { |
|
|
698 | err_set (dec, "unexpected end of CBOR data"); |
|
|
699 | } |
|
|
700 | |
|
|
701 | ecb_cold static void |
|
|
702 | err_nesting_exceeded (dec_t *dec) |
|
|
703 | { |
|
|
704 | err_set (dec, ERR_NESTING_EXCEEDED); |
|
|
705 | } |
|
|
706 | |
|
|
707 | #define ERR_DO(do) SB do; goto fail; SE |
|
|
708 | #define ERR(reason) ERR_DO (err_set (dec, reason)) |
|
|
709 | #define ERR_ERRSV ERR_DO (err_errsv (dec)) |
|
|
710 | |
|
|
711 | #define WANT(len) if (ecb_expect_false ((uintptr_t)(dec->end - dec->cur) < (STRLEN)len)) ERR_DO (err_unexpected_end (dec)) |
|
|
712 | |
| 666 | #define DEC_INC_DEPTH if (++dec->depth > dec->cbor.max_depth) ERR (ERR_NESTING_EXCEEDED) |
713 | #define DEC_INC_DEPTH if (ecb_expect_false (++dec->depth > dec->cbor.max_depth)) ERR (ERR_NESTING_EXCEEDED) |
| 667 | #define DEC_DEC_DEPTH --dec->depth |
714 | #define DEC_DEC_DEPTH --dec->depth |
| 668 | |
715 | |
| 669 | static UV |
716 | static UV |
| 670 | decode_uint (dec_t *dec) |
717 | decode_uint (dec_t *dec) |
| 671 | { |
718 | { |
| … | |
… | |
| 748 | av_push (av, decode_sv (dec)); |
795 | av_push (av, decode_sv (dec)); |
| 749 | } |
796 | } |
| 750 | } |
797 | } |
| 751 | else |
798 | else |
| 752 | { |
799 | { |
| 753 | int i, len = decode_uint (dec); |
800 | UV i, len = decode_uint (dec); |
| 754 | |
801 | |
| 755 | WANT (len); // complexity check for av_fill - need at least one byte per value, do not allow supersize arrays |
802 | WANT (len); // complexity check for av_fill - need at least one byte per value, do not allow supersize arrays |
| 756 | av_fill (av, len - 1); |
803 | av_fill (av, len - 1); |
| 757 | |
804 | |
| 758 | for (i = 0; i < len; ++i) |
805 | for (i = 0; i < len; ++i) |
| … | |
… | |
| 775 | // byte or utf-8 strings as keys, but only when !stringref |
822 | // byte or utf-8 strings as keys, but only when !stringref |
| 776 | |
823 | |
| 777 | if (ecb_expect_true (!dec->stringref)) |
824 | if (ecb_expect_true (!dec->stringref)) |
| 778 | if (ecb_expect_true ((U8)(*dec->cur - MAJOR_BYTES) <= LENGTH_EXT8)) |
825 | if (ecb_expect_true ((U8)(*dec->cur - MAJOR_BYTES) <= LENGTH_EXT8)) |
| 779 | { |
826 | { |
| 780 | I32 len = decode_uint (dec); |
827 | STRLEN len = decode_uint (dec); |
| 781 | char *key = (char *)dec->cur; |
828 | char *key = (char *)dec->cur; |
| 782 | |
829 | |
| 783 | WANT (len); |
830 | WANT (len); |
| 784 | dec->cur += len; |
831 | dec->cur += len; |
| 785 | |
832 | |
| … | |
… | |
| 787 | |
834 | |
| 788 | return; |
835 | return; |
| 789 | } |
836 | } |
| 790 | else if (ecb_expect_true ((U8)(*dec->cur - MAJOR_TEXT) <= LENGTH_EXT8)) |
837 | else if (ecb_expect_true ((U8)(*dec->cur - MAJOR_TEXT) <= LENGTH_EXT8)) |
| 791 | { |
838 | { |
| 792 | I32 len = decode_uint (dec); |
839 | STRLEN len = decode_uint (dec); |
| 793 | char *key = (char *)dec->cur; |
840 | char *key = (char *)dec->cur; |
| 794 | |
841 | |
| 795 | WANT (len); |
842 | WANT (len); |
| 796 | dec->cur += len; |
843 | dec->cur += len; |
| 797 | |
844 | |
| … | |
… | |
| 804 | return; |
851 | return; |
| 805 | } |
852 | } |
| 806 | |
853 | |
| 807 | SV *k = decode_sv (dec); |
854 | SV *k = decode_sv (dec); |
| 808 | SV *v = decode_sv (dec); |
855 | SV *v = decode_sv (dec); |
|
|
856 | |
|
|
857 | // we leak memory if uncaught exceptions are thrown by random magical |
|
|
858 | // methods, and this is hopefully the only place where it can happen, |
|
|
859 | // so if there is a chance of an exception, take the very slow path. |
|
|
860 | // since catching exceptions is "undocumented/internal/forbidden" by |
|
|
861 | // the new p5p powers, we need to call out to a perl function :/ |
|
|
862 | if (ecb_expect_false (SvAMAGIC (k))) |
|
|
863 | { |
|
|
864 | dSP; |
|
|
865 | |
|
|
866 | ENTER; SAVETMPS; |
|
|
867 | PUSHMARK (SP); |
|
|
868 | EXTEND (SP, 3); |
|
|
869 | PUSHs (sv_2mortal (newRV_inc ((SV *)hv))); |
|
|
870 | PUSHs (sv_2mortal (k)); |
|
|
871 | PUSHs (sv_2mortal (v)); |
|
|
872 | |
|
|
873 | PUTBACK; |
|
|
874 | call_pv ("CBOR::XS::_hv_store", G_VOID | G_DISCARD | G_EVAL); |
|
|
875 | SPAGAIN; |
|
|
876 | |
|
|
877 | FREETMPS; LEAVE; |
|
|
878 | |
|
|
879 | if (SvTRUE (ERRSV)) |
|
|
880 | ERR_ERRSV; |
|
|
881 | |
|
|
882 | return; |
|
|
883 | } |
| 809 | |
884 | |
| 810 | hv_store_ent (hv, k, v, 0); |
885 | hv_store_ent (hv, k, v, 0); |
| 811 | SvREFCNT_dec (k); |
886 | SvREFCNT_dec (k); |
| 812 | |
887 | |
| 813 | fail: |
888 | fail: |
| … | |
… | |
| 838 | decode_he (dec, hv); |
913 | decode_he (dec, hv); |
| 839 | } |
914 | } |
| 840 | } |
915 | } |
| 841 | else |
916 | else |
| 842 | { |
917 | { |
| 843 | int pairs = decode_uint (dec); |
918 | UV pairs = decode_uint (dec); |
|
|
919 | |
|
|
920 | WANT (pairs); // complexity check - need at least one byte per value, do not allow supersize hashes |
| 844 | |
921 | |
| 845 | while (pairs--) |
922 | while (pairs--) |
| 846 | decode_he (dec, hv); |
923 | decode_he (dec, hv); |
| 847 | } |
924 | } |
| 848 | |
925 | |
| … | |
… | |
| 936 | sv = newRV_noinc (decode_sv (dec)); |
1013 | sv = newRV_noinc (decode_sv (dec)); |
| 937 | break; |
1014 | break; |
| 938 | |
1015 | |
| 939 | case CBOR_TAG_STRINGREF_NAMESPACE: |
1016 | case CBOR_TAG_STRINGREF_NAMESPACE: |
| 940 | { |
1017 | { |
|
|
1018 | // do nmot use SAVETMPS/FREETMPS, as these will |
|
|
1019 | // erase mortalised caches, e.g. "shareable" |
| 941 | ENTER; SAVETMPS; |
1020 | ENTER; |
| 942 | |
1021 | |
| 943 | SAVESPTR (dec->stringref); |
1022 | SAVESPTR (dec->stringref); |
| 944 | dec->stringref = (AV *)sv_2mortal ((SV *)newAV ()); |
1023 | dec->stringref = (AV *)sv_2mortal ((SV *)newAV ()); |
| 945 | |
1024 | |
| 946 | sv = decode_sv (dec); |
1025 | sv = decode_sv (dec); |
| 947 | |
1026 | |
| 948 | FREETMPS; LEAVE; |
1027 | LEAVE; |
| 949 | } |
1028 | } |
| 950 | break; |
1029 | break; |
| 951 | |
1030 | |
| 952 | case CBOR_TAG_STRINGREF: |
1031 | case CBOR_TAG_STRINGREF: |
| 953 | { |
1032 | { |
| … | |
… | |
| 1004 | } |
1083 | } |
| 1005 | break; |
1084 | break; |
| 1006 | |
1085 | |
| 1007 | case CBOR_TAG_PERL_OBJECT: |
1086 | case CBOR_TAG_PERL_OBJECT: |
| 1008 | { |
1087 | { |
|
|
1088 | if (dec->cbor.flags & F_FORBID_OBJECTS) |
|
|
1089 | goto filter; |
|
|
1090 | |
| 1009 | sv = decode_sv (dec); |
1091 | sv = decode_sv (dec); |
| 1010 | |
1092 | |
| 1011 | if (!SvROK (sv) || SvTYPE (SvRV (sv)) != SVt_PVAV) |
1093 | if (!SvROK (sv) || SvTYPE (SvRV (sv)) != SVt_PVAV) |
| 1012 | ERR ("corrupted CBOR data (non-array perl object)"); |
1094 | ERR ("corrupted CBOR data (non-array perl object)"); |
| 1013 | |
1095 | |
| … | |
… | |
| 1042 | SPAGAIN; |
1124 | SPAGAIN; |
| 1043 | |
1125 | |
| 1044 | if (SvTRUE (ERRSV)) |
1126 | if (SvTRUE (ERRSV)) |
| 1045 | { |
1127 | { |
| 1046 | FREETMPS; LEAVE; |
1128 | FREETMPS; LEAVE; |
| 1047 | ERR (SvPVutf8_nolen (sv_2mortal (SvREFCNT_inc (ERRSV)))); |
1129 | ERR_ERRSV; |
| 1048 | } |
1130 | } |
| 1049 | |
1131 | |
| 1050 | SvREFCNT_dec (sv); |
1132 | SvREFCNT_dec (sv); |
| 1051 | sv = SvREFCNT_inc (POPs); |
1133 | sv = SvREFCNT_inc (POPs); |
| 1052 | |
1134 | |
| … | |
… | |
| 1055 | FREETMPS; LEAVE; |
1137 | FREETMPS; LEAVE; |
| 1056 | } |
1138 | } |
| 1057 | break; |
1139 | break; |
| 1058 | |
1140 | |
| 1059 | default: |
1141 | default: |
|
|
1142 | filter: |
| 1060 | { |
1143 | { |
|
|
1144 | SV *tag_sv = newSVuv (tag); |
|
|
1145 | |
| 1061 | sv = decode_sv (dec); |
1146 | sv = decode_sv (dec); |
| 1062 | |
1147 | |
| 1063 | dSP; |
1148 | dSP; |
| 1064 | ENTER; SAVETMPS; |
1149 | ENTER; SAVETMPS; |
| 1065 | SAVESTACK_POS (); |
1150 | SAVESTACK_POS (); |
| 1066 | PUSHMARK (SP); |
1151 | PUSHMARK (SP); |
| 1067 | EXTEND (SP, 2); |
1152 | EXTEND (SP, 2); |
| 1068 | PUSHs (newSVuv (tag)); |
1153 | PUSHs (tag_sv); |
| 1069 | PUSHs (sv); |
1154 | PUSHs (sv); |
| 1070 | |
1155 | |
| 1071 | PUTBACK; |
1156 | PUTBACK; |
| 1072 | int count = call_sv (dec->cbor.filter ? dec->cbor.filter : default_filter, G_ARRAY | G_EVAL); |
1157 | int count = call_sv (dec->cbor.filter ? dec->cbor.filter : default_filter, G_ARRAY | G_EVAL); |
| 1073 | SPAGAIN; |
1158 | SPAGAIN; |
| 1074 | |
1159 | |
| 1075 | if (SvTRUE (ERRSV)) |
1160 | if (SvTRUE (ERRSV)) |
| 1076 | { |
1161 | { |
|
|
1162 | SvREFCNT_dec (tag_sv); |
| 1077 | FREETMPS; LEAVE; |
1163 | FREETMPS; LEAVE; |
| 1078 | ERR (SvPVutf8_nolen (sv_2mortal (SvREFCNT_inc (ERRSV)))); |
1164 | ERR_ERRSV; |
| 1079 | } |
1165 | } |
| 1080 | |
1166 | |
| 1081 | if (count) |
1167 | if (count) |
| 1082 | { |
1168 | { |
|
|
1169 | SvREFCNT_dec (tag_sv); |
| 1083 | SvREFCNT_dec (sv); |
1170 | SvREFCNT_dec (sv); |
| 1084 | sv = SvREFCNT_inc (POPs); |
1171 | sv = SvREFCNT_inc (POPs); |
| 1085 | } |
1172 | } |
| 1086 | else |
1173 | else |
| 1087 | { |
1174 | { |
| 1088 | AV *av = newAV (); |
1175 | AV *av = newAV (); |
| 1089 | av_push (av, newSVuv (tag)); |
1176 | av_push (av, tag_sv); |
| 1090 | av_push (av, sv); |
1177 | av_push (av, sv); |
| 1091 | |
1178 | |
| 1092 | HV *tagged_stash = !CBOR_SLOW || cbor_tagged_stash |
1179 | HV *tagged_stash = !CBOR_SLOW || cbor_tagged_stash |
| 1093 | ? cbor_tagged_stash |
1180 | ? cbor_tagged_stash |
| 1094 | : gv_stashpv ("CBOR::XS::Tagged" , 1); |
1181 | : gv_stashpv ("CBOR::XS::Tagged" , 1); |
| … | |
… | |
| 1223 | |
1310 | |
| 1224 | if (dec.err) |
1311 | if (dec.err) |
| 1225 | { |
1312 | { |
| 1226 | if (dec.shareable) |
1313 | if (dec.shareable) |
| 1227 | { |
1314 | { |
| 1228 | // need to break cyclic links, which whould all be in shareable |
1315 | // need to break cyclic links, which would all be in shareable |
| 1229 | int i; |
1316 | int i; |
| 1230 | SV **svp; |
1317 | SV **svp; |
| 1231 | |
1318 | |
| 1232 | for (i = av_len (dec.shareable) + 1; i--; ) |
1319 | for (i = av_len (dec.shareable) + 1; i--; ) |
| 1233 | if ((svp = av_fetch (dec.shareable, i, 0))) |
1320 | if ((svp = av_fetch (dec.shareable, i, 0))) |
| 1234 | sv_setsv (*svp, &PL_sv_undef); |
1321 | sv_setsv (*svp, &PL_sv_undef); |
| 1235 | } |
1322 | } |
| 1236 | |
1323 | |
| 1237 | SvREFCNT_dec (sv); |
1324 | SvREFCNT_dec (sv); |
|
|
1325 | |
|
|
1326 | if (dec.err_sv) |
|
|
1327 | sv_2mortal (dec.err_sv); |
|
|
1328 | |
| 1238 | croak ("%s, at offset %d (octet 0x%02x)", dec.err, dec.cur - (U8 *)data, (int)(uint8_t)*dec.cur); |
1329 | croak ("%s, at offset %d (octet 0x%02x)", dec.err, dec.cur - (U8 *)data, (int)(uint8_t)*dec.cur); |
| 1239 | } |
1330 | } |
| 1240 | |
1331 | |
| 1241 | sv = sv_2mortal (sv); |
1332 | sv = sv_2mortal (sv); |
| 1242 | |
1333 | |
| … | |
… | |
| 1386 | |
1477 | |
| 1387 | default_filter = newSVpv ("CBOR::XS::default_filter", 0); |
1478 | default_filter = newSVpv ("CBOR::XS::default_filter", 0); |
| 1388 | |
1479 | |
| 1389 | sv_cbor = newSVpv ("CBOR", 0); |
1480 | sv_cbor = newSVpv ("CBOR", 0); |
| 1390 | SvREADONLY_on (sv_cbor); |
1481 | SvREADONLY_on (sv_cbor); |
|
|
1482 | |
|
|
1483 | assert (("STRLEN must be an unsigned type", 0 <= (STRLEN)-1)); |
| 1391 | } |
1484 | } |
| 1392 | |
1485 | |
| 1393 | PROTOTYPES: DISABLE |
1486 | PROTOTYPES: DISABLE |
| 1394 | |
1487 | |
| 1395 | void CLONE (...) |
1488 | void CLONE (...) |
| … | |
… | |
| 1415 | ALIAS: |
1508 | ALIAS: |
| 1416 | shrink = F_SHRINK |
1509 | shrink = F_SHRINK |
| 1417 | allow_unknown = F_ALLOW_UNKNOWN |
1510 | allow_unknown = F_ALLOW_UNKNOWN |
| 1418 | allow_sharing = F_ALLOW_SHARING |
1511 | allow_sharing = F_ALLOW_SHARING |
| 1419 | allow_cycles = F_ALLOW_CYCLES |
1512 | allow_cycles = F_ALLOW_CYCLES |
|
|
1513 | forbid_objects = F_FORBID_OBJECTS |
| 1420 | pack_strings = F_PACK_STRINGS |
1514 | pack_strings = F_PACK_STRINGS |
|
|
1515 | text_keys = F_TEXT_KEYS |
| 1421 | utf8_strings = F_UTF8_STRINGS |
1516 | text_strings = F_TEXT_STRINGS |
| 1422 | validate_utf8 = F_VALIDATE_UTF8 |
1517 | validate_utf8 = F_VALIDATE_UTF8 |
| 1423 | PPCODE: |
1518 | PPCODE: |
| 1424 | { |
1519 | { |
| 1425 | if (enable) |
1520 | if (enable) |
| 1426 | self->flags |= ix; |
1521 | self->flags |= ix; |
| … | |
… | |
| 1434 | ALIAS: |
1529 | ALIAS: |
| 1435 | get_shrink = F_SHRINK |
1530 | get_shrink = F_SHRINK |
| 1436 | get_allow_unknown = F_ALLOW_UNKNOWN |
1531 | get_allow_unknown = F_ALLOW_UNKNOWN |
| 1437 | get_allow_sharing = F_ALLOW_SHARING |
1532 | get_allow_sharing = F_ALLOW_SHARING |
| 1438 | get_allow_cycles = F_ALLOW_CYCLES |
1533 | get_allow_cycles = F_ALLOW_CYCLES |
|
|
1534 | get_forbid_objects = F_FORBID_OBJECTS |
| 1439 | get_pack_strings = F_PACK_STRINGS |
1535 | get_pack_strings = F_PACK_STRINGS |
|
|
1536 | get_text_keys = F_TEXT_KEYS |
|
|
1537 | get_text_strings = F_TEXT_STRINGS |
| 1440 | get_validate_utf8 = F_VALIDATE_UTF8 |
1538 | get_validate_utf8 = F_VALIDATE_UTF8 |
| 1441 | PPCODE: |
1539 | PPCODE: |
| 1442 | XPUSHs (boolSV (self->flags & ix)); |
1540 | XPUSHs (boolSV (self->flags & ix)); |
| 1443 | |
1541 | |
| 1444 | void max_depth (CBOR *self, U32 max_depth = 0x80000000UL) |
1542 | void max_depth (CBOR *self, U32 max_depth = 0x80000000UL) |
