ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/JSON-XS/XS.xs
(Generate patch)

Comparing JSON-XS/XS.xs (file contents):
Revision 1.14 by root, Sat Mar 24 22:55:43 2007 UTC vs.
Revision 1.46 by root, Mon Jun 25 22:11:39 2007 UTC

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 9
10#if defined(__BORLANDC__) || defined(_MSC_VER)
11# define snprintf _snprintf // C compilers have this in stdio.h
12#endif
13
14// some old perls do not have this, try to make it work, no
15// guarentees, though. if it breaks, you get to keep the pieces.
16#ifndef UTF8_MAXBYTES
17# define UTF8_MAXBYTES 13
18#endif
19
9#define F_ASCII 0x00000001 20#define F_ASCII 0x00000001UL
21#define F_LATIN1 0x00000002UL
10#define F_UTF8 0x00000002 22#define F_UTF8 0x00000004UL
11#define F_INDENT 0x00000004 23#define F_INDENT 0x00000008UL
12#define F_CANONICAL 0x00000008 24#define F_CANONICAL 0x00000010UL
13#define F_SPACE_BEFORE 0x00000010 25#define F_SPACE_BEFORE 0x00000020UL
14#define F_SPACE_AFTER 0x00000020 26#define F_SPACE_AFTER 0x00000040UL
15#define F_ALLOW_NONREF 0x00000080 27#define F_ALLOW_NONREF 0x00000100UL
16#define F_SHRINK 0x00000100 28#define F_SHRINK 0x00000200UL
29#define F_ALLOW_BLESSED 0x00000400UL
30#define F_CONV_BLESSED 0x00000800UL // NYI
31#define F_MAXDEPTH 0xf8000000UL
32#define S_MAXDEPTH 27
33#define F_MAXSIZE 0x01f00000UL
34#define S_MAXSIZE 20
35
36#define DEC_DEPTH(flags) (1UL << ((flags & F_MAXDEPTH) >> S_MAXDEPTH))
37#define DEC_SIZE(flags) (1UL << ((flags & F_MAXSIZE ) >> S_MAXSIZE ))
17 38
18#define F_PRETTY F_INDENT | F_SPACE_BEFORE | F_SPACE_AFTER 39#define F_PRETTY F_INDENT | F_SPACE_BEFORE | F_SPACE_AFTER
19#define F_DEFAULT 0 40#define F_DEFAULT (9UL << S_MAXDEPTH)
20 41
21#define INIT_SIZE 32 // initial scalar size to be allocated 42#define INIT_SIZE 32 // initial scalar size to be allocated
22#define INDENT_STEP 3 // spaces per indentation level 43#define INDENT_STEP 3 // spaces per indentation level
23 44
24#define UTF8_MAX_LEN 11 // for perls UTF-X: max. number of octets per character
25#define SHORT_STRING_LEN 512 // special-case strings of up to this size 45#define SHORT_STRING_LEN 16384 // special-case strings of up to this size
26 46
27#define SB do { 47#define SB do {
28#define SE } while (0) 48#define SE } while (0)
29 49
50#if __GNUC__ >= 3
51# define expect(expr,value) __builtin_expect ((expr),(value))
52# define inline inline
53#else
54# define expect(expr,value) (expr)
55# define inline static
56#endif
57
58#define expect_false(expr) expect ((expr) != 0, 0)
59#define expect_true(expr) expect ((expr) != 0, 1)
60
30static HV *json_stash; // JSON::XS:: 61static HV *json_stash, *json_boolean_stash; // JSON::XS::
62static SV *json_true, *json_false;
31 63
32///////////////////////////////////////////////////////////////////////////// 64/////////////////////////////////////////////////////////////////////////////
33// utility functions 65// utility functions
34 66
35static UV * 67static UV *
58// decode an utf-8 character and return it, or (UV)-1 in 90// decode an utf-8 character and return it, or (UV)-1 in
59// case of an error. 91// case of an error.
60// we special-case "safe" characters from U+80 .. U+7FF, 92// we special-case "safe" characters from U+80 .. U+7FF,
61// but use the very good perl function to parse anything else. 93// but use the very good perl function to parse anything else.
62// note that we never call this function for a ascii codepoints 94// note that we never call this function for a ascii codepoints
63static UV 95inline UV
64decode_utf8 (unsigned char *s, STRLEN len, STRLEN *clen) 96decode_utf8 (unsigned char *s, STRLEN len, STRLEN *clen)
65{ 97{
66 if (s[0] > 0xdf || s[0] < 0xc2) 98 if (expect_false (s[0] > 0xdf || s[0] < 0xc2))
67 return utf8n_to_uvuni (s, len, clen, UTF8_CHECK_ONLY); 99 return utf8n_to_uvuni (s, len, clen, UTF8_CHECK_ONLY);
68 else if (len > 1 && s[1] >= 0x80 && s[1] <= 0xbf) 100 else if (len > 1 && s[1] >= 0x80 && s[1] <= 0xbf)
69 { 101 {
70 *clen = 2; 102 *clen = 2;
71 return ((s[0] & 0x1f) << 6) | (s[1] & 0x3f); 103 return ((s[0] & 0x1f) << 6) | (s[1] & 0x3f);
72 } 104 }
73 else 105 else
106 {
107 *clen = (STRLEN)-1;
74 return (UV)-1; 108 return (UV)-1;
109 }
75} 110}
76 111
77///////////////////////////////////////////////////////////////////////////// 112/////////////////////////////////////////////////////////////////////////////
78// encoder 113// encoder
79 114
81typedef struct 116typedef struct
82{ 117{
83 char *cur; // SvPVX (sv) + current output position 118 char *cur; // SvPVX (sv) + current output position
84 char *end; // SvEND (sv) 119 char *end; // SvEND (sv)
85 SV *sv; // result scalar 120 SV *sv; // result scalar
86 UV flags; // F_* 121 U32 flags; // F_*
87 int indent; // indentation level 122 U32 indent; // indentation level
88 int max_depth; // max. recursion level 123 U32 maxdepth; // max. indentation/recursion level
89} enc_t; 124} enc_t;
90 125
91static void 126inline void
92need (enc_t *enc, STRLEN len) 127need (enc_t *enc, STRLEN len)
93{ 128{
94 if (enc->cur + len >= enc->end) 129 if (expect_false (enc->cur + len >= enc->end))
95 { 130 {
96 STRLEN cur = enc->cur - SvPVX (enc->sv); 131 STRLEN cur = enc->cur - SvPVX (enc->sv);
97 SvGROW (enc->sv, cur + len + 1); 132 SvGROW (enc->sv, cur + len + 1);
98 enc->cur = SvPVX (enc->sv) + cur; 133 enc->cur = SvPVX (enc->sv) + cur;
99 enc->end = SvPVX (enc->sv) + SvLEN (enc->sv); 134 enc->end = SvPVX (enc->sv) + SvLEN (enc->sv) - 1;
100 } 135 }
101} 136}
102 137
103static void 138inline void
104encode_ch (enc_t *enc, char ch) 139encode_ch (enc_t *enc, char ch)
105{ 140{
106 need (enc, 1); 141 need (enc, 1);
107 *enc->cur++ = ch; 142 *enc->cur++ = ch;
108} 143}
116 151
117 while (str < end) 152 while (str < end)
118 { 153 {
119 unsigned char ch = *(unsigned char *)str; 154 unsigned char ch = *(unsigned char *)str;
120 155
121 if (ch >= 0x20 && ch < 0x80) // most common case 156 if (expect_true (ch >= 0x20 && ch < 0x80)) // most common case
122 { 157 {
123 if (ch == '"') // but with slow exceptions 158 if (expect_false (ch == '"')) // but with slow exceptions
124 { 159 {
125 need (enc, len += 1); 160 need (enc, len += 1);
126 *enc->cur++ = '\\'; 161 *enc->cur++ = '\\';
127 *enc->cur++ = '"'; 162 *enc->cur++ = '"';
128 } 163 }
129 else if (ch == '\\') 164 else if (expect_false (ch == '\\'))
130 { 165 {
131 need (enc, len += 1); 166 need (enc, len += 1);
132 *enc->cur++ = '\\'; 167 *enc->cur++ = '\\';
133 *enc->cur++ = '\\'; 168 *enc->cur++ = '\\';
134 } 169 }
152 STRLEN clen; 187 STRLEN clen;
153 UV uch; 188 UV uch;
154 189
155 if (is_utf8) 190 if (is_utf8)
156 { 191 {
157 //uch = utf8n_to_uvuni (str, end - str, &clen, UTF8_CHECK_ONLY);
158 uch = decode_utf8 (str, end - str, &clen); 192 uch = decode_utf8 (str, end - str, &clen);
159 if (clen == (STRLEN)-1) 193 if (clen == (STRLEN)-1)
160 croak ("malformed or illegal unicode character in string [%.11s], cannot convert to JSON", str); 194 croak ("malformed or illegal unicode character in string [%.11s], cannot convert to JSON", str);
161 } 195 }
162 else 196 else
166 } 200 }
167 201
168 if (uch > 0x10FFFFUL) 202 if (uch > 0x10FFFFUL)
169 croak ("out of range codepoint (0x%lx) encountered, unrepresentable in JSON", (unsigned long)uch); 203 croak ("out of range codepoint (0x%lx) encountered, unrepresentable in JSON", (unsigned long)uch);
170 204
171 if (uch < 0x80 || enc->flags & F_ASCII) 205 if (uch < 0x80 || enc->flags & F_ASCII || (enc->flags & F_LATIN1 && uch > 0xFF))
172 { 206 {
173 if (uch > 0xFFFFUL) 207 if (uch > 0xFFFFUL)
174 { 208 {
175 need (enc, len += 11); 209 need (enc, len += 11);
176 sprintf (enc->cur, "\\u%04x\\u%04x", 210 sprintf (enc->cur, "\\u%04x\\u%04x",
190 *enc->cur++ = hexdigit [(uch >> 0) & 15]; 224 *enc->cur++ = hexdigit [(uch >> 0) & 15];
191 } 225 }
192 226
193 str += clen; 227 str += clen;
194 } 228 }
229 else if (enc->flags & F_LATIN1)
230 {
231 *enc->cur++ = uch;
232 str += clen;
233 }
195 else if (is_utf8) 234 else if (is_utf8)
196 { 235 {
197 need (enc, len += clen); 236 need (enc, len += clen);
198 do 237 do
199 { 238 {
201 } 240 }
202 while (--clen); 241 while (--clen);
203 } 242 }
204 else 243 else
205 { 244 {
206 need (enc, len += UTF8_MAX_LEN - 1); // never more than 11 bytes needed 245 need (enc, len += UTF8_MAXBYTES - 1); // never more than 11 bytes needed
207 enc->cur = uvuni_to_utf8_flags (enc->cur, uch, 0); 246 enc->cur = uvuni_to_utf8_flags (enc->cur, uch, 0);
208 ++str; 247 ++str;
209 } 248 }
210 } 249 }
211 } 250 }
213 252
214 --len; 253 --len;
215 } 254 }
216} 255}
217 256
218static void 257inline void
219encode_indent (enc_t *enc) 258encode_indent (enc_t *enc)
220{ 259{
221 if (enc->flags & F_INDENT) 260 if (enc->flags & F_INDENT)
222 { 261 {
223 int spaces = enc->indent * INDENT_STEP; 262 int spaces = enc->indent * INDENT_STEP;
226 memset (enc->cur, ' ', spaces); 265 memset (enc->cur, ' ', spaces);
227 enc->cur += spaces; 266 enc->cur += spaces;
228 } 267 }
229} 268}
230 269
231static void 270inline void
232encode_space (enc_t *enc) 271encode_space (enc_t *enc)
233{ 272{
234 need (enc, 1); 273 need (enc, 1);
235 encode_ch (enc, ' '); 274 encode_ch (enc, ' ');
236} 275}
237 276
238static void 277inline void
239encode_nl (enc_t *enc) 278encode_nl (enc_t *enc)
240{ 279{
241 if (enc->flags & F_INDENT) 280 if (enc->flags & F_INDENT)
242 { 281 {
243 need (enc, 1); 282 need (enc, 1);
244 encode_ch (enc, '\n'); 283 encode_ch (enc, '\n');
245 } 284 }
246} 285}
247 286
248static void 287inline void
249encode_comma (enc_t *enc) 288encode_comma (enc_t *enc)
250{ 289{
251 encode_ch (enc, ','); 290 encode_ch (enc, ',');
252 291
253 if (enc->flags & F_INDENT) 292 if (enc->flags & F_INDENT)
260 299
261static void 300static void
262encode_av (enc_t *enc, AV *av) 301encode_av (enc_t *enc, AV *av)
263{ 302{
264 int i, len = av_len (av); 303 int i, len = av_len (av);
304
305 if (enc->indent >= enc->maxdepth)
306 croak ("data structure too deep (hit recursion limit)");
265 307
266 encode_ch (enc, '['); encode_nl (enc); 308 encode_ch (enc, '['); encode_nl (enc);
267 ++enc->indent; 309 ++enc->indent;
268 310
269 for (i = 0; i <= len; ++i) 311 for (i = 0; i <= len; ++i)
336static void 378static void
337encode_hv (enc_t *enc, HV *hv) 379encode_hv (enc_t *enc, HV *hv)
338{ 380{
339 int count, i; 381 int count, i;
340 382
383 if (enc->indent >= enc->maxdepth)
384 croak ("data structure too deep (hit recursion limit)");
385
341 encode_ch (enc, '{'); encode_nl (enc); ++enc->indent; 386 encode_ch (enc, '{'); encode_nl (enc); ++enc->indent;
342 387
343 if ((count = hv_iterinit (hv))) 388 if ((count = hv_iterinit (hv)))
344 { 389 {
345 // for canonical output we have to sort by keys first 390 // for canonical output we have to sort by keys first
346 // actually, this is mostly due to the stupid so-called 391 // actually, this is mostly due to the stupid so-called
347 // security workaround added somewhere in 5.8.x. 392 // security workaround added somewhere in 5.8.x.
348 // that randomises hash orderings 393 // that randomises hash orderings
349 if (enc->flags & F_CANONICAL) 394 if (enc->flags & F_CANONICAL)
350 { 395 {
351 HE *he, *hes [count]; // if your compiler dies here, you need to enable C99 mode
352 int fast = 1; 396 int fast = 1;
397 HE *he;
398#if defined(__BORLANDC__) || defined(_MSC_VER)
399 HE **hes = _alloca (count * sizeof (HE));
400#else
401 HE *hes [count]; // if your compiler dies here, you need to enable C99 mode
402#endif
353 403
354 i = 0; 404 i = 0;
355 while ((he = hv_iternext (hv))) 405 while ((he = hv_iternext (hv)))
356 { 406 {
357 hes [i++] = he; 407 hes [i++] = he;
392 442
393 encode_nl (enc); 443 encode_nl (enc);
394 } 444 }
395 else 445 else
396 { 446 {
397 SV *sv;
398 HE *he = hv_iternext (hv); 447 HE *he = hv_iternext (hv);
399 448
400 for (;;) 449 for (;;)
401 { 450 {
402 encode_indent (enc); 451 encode_indent (enc);
411 encode_nl (enc); 460 encode_nl (enc);
412 } 461 }
413 } 462 }
414 463
415 --enc->indent; encode_indent (enc); encode_ch (enc, '}'); 464 --enc->indent; encode_indent (enc); encode_ch (enc, '}');
465}
466
467// encode objects, arrays and special \0=false and \1=true values.
468static void
469encode_rv (enc_t *enc, SV *sv)
470{
471 svtype svt;
472
473 SvGETMAGIC (sv);
474 svt = SvTYPE (sv);
475
476 if (expect_false (SvOBJECT (sv)))
477 {
478 if (SvSTASH (sv) == json_boolean_stash)
479 {
480 if (SvIV (sv) == 0)
481 encode_str (enc, "false", 5, 0);
482 else
483 encode_str (enc, "true", 4, 0);
484 }
485 else
486 {
487#if 0
488 if (0 && sv_derived_from (rv, "JSON::Literal"))
489 {
490 // not yet
491 }
492#endif
493 if (enc->flags & F_CONV_BLESSED)
494 {
495 // we re-bless the reference to get overload and other niceties right
496 GV *to_json = gv_fetchmethod_autoload (SvSTASH (sv), "TO_JSON", 1);
497
498 if (to_json)
499 {
500 dSP;
501 ENTER;
502 SAVETMPS;
503 PUSHMARK (SP);
504 XPUSHs (sv_bless (sv_2mortal (newRV_inc (sv)), SvSTASH (sv)));
505
506 // calling with G_SCALAR ensures that we always get a 1 reutrn value
507 // check anyways.
508 PUTBACK;
509 assert (1 == call_sv ((SV *)GvCV (to_json), G_SCALAR));
510 SPAGAIN;
511
512 encode_sv (enc, POPs);
513
514 FREETMPS;
515 LEAVE;
516 }
517 else if (enc->flags & F_ALLOW_BLESSED)
518 encode_str (enc, "null", 4, 0);
519 else
520 croak ("encountered object '%s', but neither allow_blessed enabled nor TO_JSON method available on it",
521 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
522 }
523 else if (enc->flags & F_ALLOW_BLESSED)
524 encode_str (enc, "null", 4, 0);
525 else
526 croak ("encountered object '%s', but neither allow_blessed nor convert_blessed settings are enabled",
527 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
528 }
529 }
530 else if (svt == SVt_PVHV)
531 encode_hv (enc, (HV *)sv);
532 else if (svt == SVt_PVAV)
533 encode_av (enc, (AV *)sv);
534 else if (svt < SVt_PVAV)
535 {
536 if (SvNIOK (sv) && SvIV (sv) == 0)
537 encode_str (enc, "false", 5, 0);
538 else if (SvNIOK (sv) && SvIV (sv) == 1)
539 encode_str (enc, "true", 4, 0);
540 else
541 croak ("cannot encode reference to scalar '%s' unless the scalar is 0 or 1",
542 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
543 }
544 else
545 croak ("encountered %s, but JSON can only represent references to arrays or hashes",
546 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
416} 547}
417 548
418static void 549static void
419encode_sv (enc_t *enc, SV *sv) 550encode_sv (enc_t *enc, SV *sv)
420{ 551{
428 encode_str (enc, str, len, SvUTF8 (sv)); 559 encode_str (enc, str, len, SvUTF8 (sv));
429 encode_ch (enc, '"'); 560 encode_ch (enc, '"');
430 } 561 }
431 else if (SvNOKp (sv)) 562 else if (SvNOKp (sv))
432 { 563 {
564 // trust that perl will do the right thing w.r.t. JSON syntax.
433 need (enc, NV_DIG + 32); 565 need (enc, NV_DIG + 32);
434 Gconvert (SvNVX (sv), NV_DIG, 0, enc->cur); 566 Gconvert (SvNVX (sv), NV_DIG, 0, enc->cur);
435 enc->cur += strlen (enc->cur); 567 enc->cur += strlen (enc->cur);
436 } 568 }
437 else if (SvIOKp (sv)) 569 else if (SvIOKp (sv))
438 { 570 {
439 need (enc, 64); 571 // we assume we can always read an IV as a UV
572 if (SvUV (sv) & ~(UV)0x7fff)
573 {
574 // large integer, use the (rather slow) snprintf way.
575 need (enc, sizeof (UV) * 3);
440 enc->cur += 576 enc->cur +=
441 SvIsUV(sv) 577 SvIsUV(sv)
442 ? snprintf (enc->cur, 64, "%"UVuf, (UV)SvUVX (sv)) 578 ? snprintf (enc->cur, sizeof (UV) * 3, "%"UVuf, (UV)SvUVX (sv))
443 : snprintf (enc->cur, 64, "%"IVdf, (IV)SvIVX (sv)); 579 : snprintf (enc->cur, sizeof (UV) * 3, "%"IVdf, (IV)SvIVX (sv));
580 }
581 else
582 {
583 // optimise the "small number case"
584 // code will likely be branchless and use only a single multiplication
585 I32 i = SvIV (sv);
586 U32 u;
587 char digit, nz = 0;
588
589 need (enc, 6);
590
591 *enc->cur = '-'; enc->cur += i < 0 ? 1 : 0;
592 u = i < 0 ? -i : i;
593
594 // convert to 4.28 fixed-point representation
595 u = u * ((0xfffffff + 10000) / 10000); // 10**5, 5 fractional digits
596
597 // now output digit by digit, each time masking out the integer part
598 // and multiplying by 5 while moving the decimal point one to the right,
599 // resulting in a net multiplication by 10.
600 // we always write the digit to memory but conditionally increment
601 // the pointer, to ease the usage of conditional move instructions.
602 digit = u >> 28; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0xfffffff) * 5;
603 digit = u >> 27; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x7ffffff) * 5;
604 digit = u >> 26; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x3ffffff) * 5;
605 digit = u >> 25; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x1ffffff) * 5;
606 digit = u >> 24; *enc->cur = digit + '0'; enc->cur += 1; // correctly generate '0'
607 }
444 } 608 }
445 else if (SvROK (sv)) 609 else if (SvROK (sv))
446 { 610 encode_rv (enc, SvRV (sv));
447 SV *rv = SvRV (sv);
448
449 if (enc->indent >= enc->max_depth)
450 croak ("data structure too deep (hit recursion limit)");
451
452 switch (SvTYPE (rv))
453 {
454 case SVt_PVAV: encode_av (enc, (AV *)rv); break;
455 case SVt_PVHV: encode_hv (enc, (HV *)rv); break;
456
457 default:
458 croak ("encountered %s, but JSON can only represent references to arrays or hashes",
459 SvPV_nolen (sv));
460 }
461 }
462 else if (!SvOK (sv)) 611 else if (!SvOK (sv))
463 encode_str (enc, "null", 4, 0); 612 encode_str (enc, "null", 4, 0);
464 else 613 else
465 croak ("encountered perl type (%s,0x%x) that JSON cannot handle, you might want to report this", 614 croak ("encountered perl type (%s,0x%x) that JSON cannot handle, you might want to report this",
466 SvPV_nolen (sv), SvFLAGS (sv)); 615 SvPV_nolen (sv), SvFLAGS (sv));
467} 616}
468 617
469static SV * 618static SV *
470encode_json (SV *scalar, UV flags) 619encode_json (SV *scalar, U32 flags)
471{ 620{
621 enc_t enc;
622
472 if (!(flags & F_ALLOW_NONREF) && !SvROK (scalar)) 623 if (!(flags & F_ALLOW_NONREF) && !SvROK (scalar))
473 croak ("hash- or arrayref expected (not a simple scalar, use allow_nonref to allow this)"); 624 croak ("hash- or arrayref expected (not a simple scalar, use allow_nonref to allow this)");
474 625
475 enc_t enc;
476 enc.flags = flags; 626 enc.flags = flags;
477 enc.sv = sv_2mortal (NEWSV (0, INIT_SIZE)); 627 enc.sv = sv_2mortal (NEWSV (0, INIT_SIZE));
478 enc.cur = SvPVX (enc.sv); 628 enc.cur = SvPVX (enc.sv);
479 enc.end = SvEND (enc.sv); 629 enc.end = SvEND (enc.sv);
480 enc.indent = 0; 630 enc.indent = 0;
481 enc.max_depth = 0x7fffffffUL; 631 enc.maxdepth = DEC_DEPTH (flags);
482 632
483 SvPOK_only (enc.sv); 633 SvPOK_only (enc.sv);
484 encode_sv (&enc, scalar); 634 encode_sv (&enc, scalar);
485 635
636 SvCUR_set (enc.sv, enc.cur - SvPVX (enc.sv));
637 *SvEND (enc.sv) = 0; // many xs functions expect a trailing 0 for text strings
638
486 if (!(flags & (F_ASCII | F_UTF8))) 639 if (!(flags & (F_ASCII | F_LATIN1 | F_UTF8)))
487 SvUTF8_on (enc.sv); 640 SvUTF8_on (enc.sv);
488
489 SvCUR_set (enc.sv, enc.cur - SvPVX (enc.sv));
490 641
491 if (enc.flags & F_SHRINK) 642 if (enc.flags & F_SHRINK)
492 shrink (enc.sv); 643 shrink (enc.sv);
493 644
494 return enc.sv; 645 return enc.sv;
501typedef struct 652typedef struct
502{ 653{
503 char *cur; // current parser pointer 654 char *cur; // current parser pointer
504 char *end; // end of input string 655 char *end; // end of input string
505 const char *err; // parse error, if != 0 656 const char *err; // parse error, if != 0
506 UV flags; // F_* 657 U32 flags; // F_*
658 U32 depth; // recursion depth
659 U32 maxdepth; // recursion depth limit
507} dec_t; 660} dec_t;
508 661
509static void 662inline void
510decode_ws (dec_t *dec) 663decode_ws (dec_t *dec)
511{ 664{
512 for (;;) 665 for (;;)
513 { 666 {
514 char ch = *dec->cur; 667 char ch = *dec->cur;
520 ++dec->cur; 673 ++dec->cur;
521 } 674 }
522} 675}
523 676
524#define ERR(reason) SB dec->err = reason; goto fail; SE 677#define ERR(reason) SB dec->err = reason; goto fail; SE
678
525#define EXPECT_CH(ch) SB \ 679#define EXPECT_CH(ch) SB \
526 if (*dec->cur != ch) \ 680 if (*dec->cur != ch) \
527 ERR (# ch " expected"); \ 681 ERR (# ch " expected"); \
528 ++dec->cur; \ 682 ++dec->cur; \
529 SE 683 SE
530 684
685#define DEC_INC_DEPTH if (++dec->depth > dec->maxdepth) ERR ("json datastructure exceeds maximum nesting level (set a higher max_depth)")
686#define DEC_DEC_DEPTH --dec->depth
687
531static SV *decode_sv (dec_t *dec); 688static SV *decode_sv (dec_t *dec);
532 689
533static signed char decode_hexdigit[256]; 690static signed char decode_hexdigit[256];
534 691
535static UV 692static UV
536decode_4hex (dec_t *dec) 693decode_4hex (dec_t *dec)
537{ 694{
538 signed char d1, d2, d3, d4; 695 signed char d1, d2, d3, d4;
539 unsigned char *cur = (unsigned char *)dec->cur; 696 unsigned char *cur = (unsigned char *)dec->cur;
540 697
541 d1 = decode_hexdigit [cur [0]]; if (d1 < 0) ERR ("four hexadecimal digits expected"); 698 d1 = decode_hexdigit [cur [0]]; if (expect_false (d1 < 0)) ERR ("exactly four hexadecimal digits expected");
542 d2 = decode_hexdigit [cur [1]]; if (d2 < 0) ERR ("four hexadecimal digits expected"); 699 d2 = decode_hexdigit [cur [1]]; if (expect_false (d2 < 0)) ERR ("exactly four hexadecimal digits expected");
543 d3 = decode_hexdigit [cur [2]]; if (d3 < 0) ERR ("four hexadecimal digits expected"); 700 d3 = decode_hexdigit [cur [2]]; if (expect_false (d3 < 0)) ERR ("exactly four hexadecimal digits expected");
544 d4 = decode_hexdigit [cur [3]]; if (d4 < 0) ERR ("four hexadecimal digits expected"); 701 d4 = decode_hexdigit [cur [3]]; if (expect_false (d4 < 0)) ERR ("exactly four hexadecimal digits expected");
545 702
546 dec->cur += 4; 703 dec->cur += 4;
547 704
548 return ((UV)d1) << 12 705 return ((UV)d1) << 12
549 | ((UV)d2) << 8 706 | ((UV)d2) << 8
557static SV * 714static SV *
558decode_str (dec_t *dec) 715decode_str (dec_t *dec)
559{ 716{
560 SV *sv = 0; 717 SV *sv = 0;
561 int utf8 = 0; 718 int utf8 = 0;
719 char *dec_cur = dec->cur;
562 720
563 do 721 do
564 { 722 {
565 char buf [SHORT_STRING_LEN + UTF8_MAX_LEN]; 723 char buf [SHORT_STRING_LEN + UTF8_MAXBYTES];
566 char *cur = buf; 724 char *cur = buf;
567 725
568 do 726 do
569 { 727 {
570 unsigned char ch = *(unsigned char *)dec->cur++; 728 unsigned char ch = *(unsigned char *)dec_cur++;
571 729
572 if (ch == '"') 730 if (expect_false (ch == '"'))
573 { 731 {
574 --dec->cur; 732 --dec_cur;
575 break; 733 break;
576 } 734 }
577 else if (ch == '\\') 735 else if (expect_false (ch == '\\'))
578 { 736 {
579 switch (*dec->cur) 737 switch (*dec_cur)
580 { 738 {
581 case '\\': 739 case '\\':
582 case '/': 740 case '/':
583 case '"': *cur++ = *dec->cur++; break; 741 case '"': *cur++ = *dec_cur++; break;
584 742
585 case 'b': ++dec->cur; *cur++ = '\010'; break; 743 case 'b': ++dec_cur; *cur++ = '\010'; break;
586 case 't': ++dec->cur; *cur++ = '\011'; break; 744 case 't': ++dec_cur; *cur++ = '\011'; break;
587 case 'n': ++dec->cur; *cur++ = '\012'; break; 745 case 'n': ++dec_cur; *cur++ = '\012'; break;
588 case 'f': ++dec->cur; *cur++ = '\014'; break; 746 case 'f': ++dec_cur; *cur++ = '\014'; break;
589 case 'r': ++dec->cur; *cur++ = '\015'; break; 747 case 'r': ++dec_cur; *cur++ = '\015'; break;
590 748
591 case 'u': 749 case 'u':
592 { 750 {
593 UV lo, hi; 751 UV lo, hi;
594 ++dec->cur; 752 ++dec_cur;
595 753
754 dec->cur = dec_cur;
596 hi = decode_4hex (dec); 755 hi = decode_4hex (dec);
756 dec_cur = dec->cur;
597 if (hi == (UV)-1) 757 if (hi == (UV)-1)
598 goto fail; 758 goto fail;
599 759
600 // possibly a surrogate pair 760 // possibly a surrogate pair
601 if (hi >= 0xd800) 761 if (hi >= 0xd800)
602 if (hi < 0xdc00) 762 if (hi < 0xdc00)
603 { 763 {
604 if (dec->cur [0] != '\\' || dec->cur [1] != 'u') 764 if (dec_cur [0] != '\\' || dec_cur [1] != 'u')
605 ERR ("missing low surrogate character in surrogate pair"); 765 ERR ("missing low surrogate character in surrogate pair");
606 766
607 dec->cur += 2; 767 dec_cur += 2;
608 768
769 dec->cur = dec_cur;
609 lo = decode_4hex (dec); 770 lo = decode_4hex (dec);
771 dec_cur = dec->cur;
610 if (lo == (UV)-1) 772 if (lo == (UV)-1)
611 goto fail; 773 goto fail;
612 774
613 if (lo < 0xdc00 || lo >= 0xe000) 775 if (lo < 0xdc00 || lo >= 0xe000)
614 ERR ("surrogate pair expected"); 776 ERR ("surrogate pair expected");
628 *cur++ = hi; 790 *cur++ = hi;
629 } 791 }
630 break; 792 break;
631 793
632 default: 794 default:
633 --dec->cur; 795 --dec_cur;
634 ERR ("illegal backslash escape sequence in string"); 796 ERR ("illegal backslash escape sequence in string");
635 } 797 }
636 } 798 }
637 else if (ch >= 0x20 && ch <= 0x7f) 799 else if (expect_true (ch >= 0x20 && ch <= 0x7f))
638 *cur++ = ch; 800 *cur++ = ch;
639 else if (ch >= 0x80) 801 else if (ch >= 0x80)
640 { 802 {
641 --dec->cur;
642
643 STRLEN clen; 803 STRLEN clen;
804 UV uch;
805
806 --dec_cur;
807
644 UV uch = decode_utf8 (dec->cur, dec->end - dec->cur, &clen); 808 uch = decode_utf8 (dec_cur, dec->end - dec_cur, &clen);
645 if (clen == (STRLEN)-1) 809 if (clen == (STRLEN)-1)
646 ERR ("malformed UTF-8 character in JSON string"); 810 ERR ("malformed UTF-8 character in JSON string");
647 811
648 do 812 do
649 {
650 *cur++ = *dec->cur++; 813 *cur++ = *dec_cur++;
651 }
652 while (--clen); 814 while (--clen);
653 815
654 utf8 = 1; 816 utf8 = 1;
655 } 817 }
656 else if (!ch)
657 ERR ("unexpected end of string while parsing json string");
658 else 818 else
819 {
820 --dec_cur;
821
822 if (!ch)
823 ERR ("unexpected end of string while parsing JSON string");
824 else
659 ERR ("invalid character encountered"); 825 ERR ("invalid character encountered while parsing JSON string");
660 826 }
661 } 827 }
662 while (cur < buf + SHORT_STRING_LEN); 828 while (cur < buf + SHORT_STRING_LEN);
663 829
830 {
664 STRLEN len = cur - buf; 831 STRLEN len = cur - buf;
665 832
666 if (sv) 833 if (sv)
667 { 834 {
668 SvGROW (sv, SvCUR (sv) + len + 1); 835 SvGROW (sv, SvCUR (sv) + len + 1);
669 memcpy (SvPVX (sv) + SvCUR (sv), buf, len); 836 memcpy (SvPVX (sv) + SvCUR (sv), buf, len);
670 SvCUR_set (sv, SvCUR (sv) + len); 837 SvCUR_set (sv, SvCUR (sv) + len);
671 } 838 }
672 else 839 else
673 sv = newSVpvn (buf, len); 840 sv = newSVpvn (buf, len);
674 } 841 }
842 }
675 while (*dec->cur != '"'); 843 while (*dec_cur != '"');
676 844
677 ++dec->cur; 845 ++dec_cur;
678 846
679 if (sv) 847 if (sv)
680 { 848 {
681 SvPOK_only (sv); 849 SvPOK_only (sv);
682 *SvEND (sv) = 0; 850 *SvEND (sv) = 0;
685 SvUTF8_on (sv); 853 SvUTF8_on (sv);
686 } 854 }
687 else 855 else
688 sv = newSVpvn ("", 0); 856 sv = newSVpvn ("", 0);
689 857
858 dec->cur = dec_cur;
690 return sv; 859 return sv;
691 860
692fail: 861fail:
862 dec->cur = dec_cur;
693 return 0; 863 return 0;
694} 864}
695 865
696static SV * 866static SV *
697decode_num (dec_t *dec) 867decode_num (dec_t *dec)
755 is_nv = 1; 925 is_nv = 1;
756 } 926 }
757 927
758 if (!is_nv) 928 if (!is_nv)
759 { 929 {
760 UV uv; 930 // special case the rather common 1..4-digit-int case, assumes 32 bit ints or so
761 int numtype = grok_number (start, dec->cur - start, &uv); 931 if (*start == '-')
762 if (numtype & IS_NUMBER_IN_UV) 932 switch (dec->cur - start)
763 if (numtype & IS_NUMBER_NEG)
764 { 933 {
765 if (uv < (UV)IV_MIN) 934 case 2: return newSViv (-( start [1] - '0' * 1));
766 return newSViv (-(IV)uv); 935 case 3: return newSViv (-( start [1] * 10 + start [2] - '0' * 11));
936 case 4: return newSViv (-( start [1] * 100 + start [2] * 10 + start [3] - '0' * 111));
937 case 5: return newSViv (-(start [1] * 1000 + start [2] * 100 + start [3] * 10 + start [4] - '0' * 1111));
767 } 938 }
939 else
940 switch (dec->cur - start)
941 {
942 case 1: return newSViv ( start [0] - '0' * 1);
943 case 2: return newSViv ( start [0] * 10 + start [1] - '0' * 11);
944 case 3: return newSViv ( start [0] * 100 + start [1] * 10 + start [2] - '0' * 111);
945 case 4: return newSViv ( start [0] * 1000 + start [1] * 100 + start [2] * 10 + start [3] - '0' * 1111);
946 }
947
948 {
949 UV uv;
950 int numtype = grok_number (start, dec->cur - start, &uv);
951 if (numtype & IS_NUMBER_IN_UV)
952 if (numtype & IS_NUMBER_NEG)
953 {
954 if (uv < (UV)IV_MIN)
955 return newSViv (-(IV)uv);
956 }
768 else 957 else
769 return newSVuv (uv); 958 return newSVuv (uv);
959
960 // here would likely be the place for bigint support
770 } 961 }
962 }
771 963
964 // if we ever support bigint or bigfloat, this is the place for bigfloat
772 return newSVnv (Atof (start)); 965 return newSVnv (Atof (start));
773 966
774fail: 967fail:
775 return 0; 968 return 0;
776} 969}
778static SV * 971static SV *
779decode_av (dec_t *dec) 972decode_av (dec_t *dec)
780{ 973{
781 AV *av = newAV (); 974 AV *av = newAV ();
782 975
976 DEC_INC_DEPTH;
783 decode_ws (dec); 977 decode_ws (dec);
978
784 if (*dec->cur == ']') 979 if (*dec->cur == ']')
785 ++dec->cur; 980 ++dec->cur;
786 else 981 else
787 for (;;) 982 for (;;)
788 { 983 {
806 ERR (", or ] expected while parsing array"); 1001 ERR (", or ] expected while parsing array");
807 1002
808 ++dec->cur; 1003 ++dec->cur;
809 } 1004 }
810 1005
1006 DEC_DEC_DEPTH;
811 return newRV_noinc ((SV *)av); 1007 return newRV_noinc ((SV *)av);
812 1008
813fail: 1009fail:
814 SvREFCNT_dec (av); 1010 SvREFCNT_dec (av);
1011 DEC_DEC_DEPTH;
815 return 0; 1012 return 0;
816} 1013}
817 1014
818static SV * 1015static SV *
819decode_hv (dec_t *dec) 1016decode_hv (dec_t *dec)
820{ 1017{
821 HV *hv = newHV (); 1018 HV *hv = newHV ();
822 1019
1020 DEC_INC_DEPTH;
823 decode_ws (dec); 1021 decode_ws (dec);
1022
824 if (*dec->cur == '}') 1023 if (*dec->cur == '}')
825 ++dec->cur; 1024 ++dec->cur;
826 else 1025 else
827 for (;;) 1026 for (;;)
828 { 1027 {
829 SV *key, *value;
830
831 decode_ws (dec); EXPECT_CH ('"'); 1028 decode_ws (dec); EXPECT_CH ('"');
832 1029
833 key = decode_str (dec); 1030 // heuristic: assume that
834 if (!key) 1031 // a) decode_str + hv_store_ent are abysmally slow
835 goto fail; 1032 // b) most hash keys are short, simple ascii text
1033 // so try to "fast-match" such strings to avoid
1034 // the overhead of hv_store_ent.
1035 {
1036 SV *value;
1037 char *p = dec->cur;
1038 char *e = p + 24; // only try up to 24 bytes
836 1039
837 decode_ws (dec); EXPECT_CH (':'); 1040 for (;;)
838
839 value = decode_sv (dec);
840 if (!value)
841 { 1041 {
1042 if (p == e || *p < 0x20 || *p >= 0x80 || *p == '\\')
1043 {
1044 // slow path, back up and use decode_str
1045 SV *key = decode_str (dec);
1046 if (!key)
1047 goto fail;
1048
1049 decode_ws (dec); EXPECT_CH (':');
1050
1051 value = decode_sv (dec);
1052 if (!value)
1053 {
1054 SvREFCNT_dec (key);
1055 goto fail;
1056 }
1057
1058 hv_store_ent (hv, key, value, 0);
842 SvREFCNT_dec (key); 1059 SvREFCNT_dec (key);
1060
1061 break;
1062 }
1063 else if (*p == '"')
1064 {
1065 // fast path, got a simple key
1066 char *key = dec->cur;
1067 int len = p - key;
1068 dec->cur = p + 1;
1069
1070 decode_ws (dec); EXPECT_CH (':');
1071
1072 value = decode_sv (dec);
1073 if (!value)
843 goto fail; 1074 goto fail;
1075
1076 hv_store (hv, key, len, value, 0);
1077
1078 break;
1079 }
1080
1081 ++p;
844 } 1082 }
845 1083 }
846 //TODO: optimise
847 hv_store_ent (hv, key, value, 0);
848 1084
849 decode_ws (dec); 1085 decode_ws (dec);
850 1086
851 if (*dec->cur == '}') 1087 if (*dec->cur == '}')
852 { 1088 {
858 ERR (", or } expected while parsing object/hash"); 1094 ERR (", or } expected while parsing object/hash");
859 1095
860 ++dec->cur; 1096 ++dec->cur;
861 } 1097 }
862 1098
1099 DEC_DEC_DEPTH;
863 return newRV_noinc ((SV *)hv); 1100 return newRV_noinc ((SV *)hv);
864 1101
865fail: 1102fail:
866 SvREFCNT_dec (hv); 1103 SvREFCNT_dec (hv);
1104 DEC_DEC_DEPTH;
867 return 0; 1105 return 0;
868} 1106}
869 1107
870static SV * 1108static SV *
871decode_sv (dec_t *dec) 1109decode_sv (dec_t *dec)
872{ 1110{
873 decode_ws (dec); 1111 decode_ws (dec);
1112
1113 // the beauty of JSON: you need exactly one character lookahead
1114 // to parse anything.
874 switch (*dec->cur) 1115 switch (*dec->cur)
875 { 1116 {
876 case '"': ++dec->cur; return decode_str (dec); 1117 case '"': ++dec->cur; return decode_str (dec);
877 case '[': ++dec->cur; return decode_av (dec); 1118 case '[': ++dec->cur; return decode_av (dec);
878 case '{': ++dec->cur; return decode_hv (dec); 1119 case '{': ++dec->cur; return decode_hv (dec);
884 1125
885 case 't': 1126 case 't':
886 if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "true", 4)) 1127 if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "true", 4))
887 { 1128 {
888 dec->cur += 4; 1129 dec->cur += 4;
889 return newSViv (1); 1130 return SvREFCNT_inc (json_true);
890 } 1131 }
891 else 1132 else
892 ERR ("'true' expected"); 1133 ERR ("'true' expected");
893 1134
894 break; 1135 break;
895 1136
896 case 'f': 1137 case 'f':
897 if (dec->end - dec->cur >= 5 && !memcmp (dec->cur, "false", 5)) 1138 if (dec->end - dec->cur >= 5 && !memcmp (dec->cur, "false", 5))
898 { 1139 {
899 dec->cur += 5; 1140 dec->cur += 5;
900 return newSViv (0); 1141 return SvREFCNT_inc (json_false);
901 } 1142 }
902 else 1143 else
903 ERR ("'false' expected"); 1144 ERR ("'false' expected");
904 1145
905 break; 1146 break;
914 ERR ("'null' expected"); 1155 ERR ("'null' expected");
915 1156
916 break; 1157 break;
917 1158
918 default: 1159 default:
919 ERR ("malformed json string, neither array, object, number, string or atom"); 1160 ERR ("malformed JSON string, neither array, object, number, string or atom");
920 break; 1161 break;
921 } 1162 }
922 1163
923fail: 1164fail:
924 return 0; 1165 return 0;
925} 1166}
926 1167
927static SV * 1168static SV *
928decode_json (SV *string, UV flags) 1169decode_json (SV *string, U32 flags, UV *offset_return)
929{ 1170{
1171 dec_t dec;
1172 UV offset;
930 SV *sv; 1173 SV *sv;
1174
1175 SvGETMAGIC (string);
1176 SvUPGRADE (string, SVt_PV);
1177
1178 if (flags & F_MAXSIZE && SvCUR (string) > DEC_SIZE (flags))
1179 croak ("attempted decode of JSON text of %lu bytes size, but max_size is set to %lu",
1180 (unsigned long)SvCUR (string), (unsigned long)DEC_SIZE (flags));
931 1181
932 if (flags & F_UTF8) 1182 if (flags & F_UTF8)
933 sv_utf8_downgrade (string, 0); 1183 sv_utf8_downgrade (string, 0);
934 else 1184 else
935 sv_utf8_upgrade (string); 1185 sv_utf8_upgrade (string);
936 1186
937 SvGROW (string, SvCUR (string) + 1); // should basically be a NOP 1187 SvGROW (string, SvCUR (string) + 1); // should basically be a NOP
938 1188
939 dec_t dec;
940 dec.flags = flags; 1189 dec.flags = flags;
941 dec.cur = SvPVX (string); 1190 dec.cur = SvPVX (string);
942 dec.end = SvEND (string); 1191 dec.end = SvEND (string);
943 dec.err = 0; 1192 dec.err = 0;
1193 dec.depth = 0;
1194 dec.maxdepth = DEC_DEPTH (dec.flags);
944 1195
1196 *dec.end = 0; // this should basically be a nop, too, but make sure it's there
945 sv = decode_sv (&dec); 1197 sv = decode_sv (&dec);
946 1198
1199 if (!(offset_return || !sv))
1200 {
1201 // check for trailing garbage
1202 decode_ws (&dec);
1203
1204 if (*dec.cur)
1205 {
1206 dec.err = "garbage after JSON object";
1207 SvREFCNT_dec (sv);
1208 sv = 0;
1209 }
1210 }
1211
1212 if (offset_return || !sv)
1213 {
1214 offset = dec.flags & F_UTF8
1215 ? dec.cur - SvPVX (string)
1216 : utf8_distance (dec.cur, SvPVX (string));
1217
1218 if (offset_return)
1219 *offset_return = offset;
1220 }
1221
947 if (!sv) 1222 if (!sv)
948 { 1223 {
949 IV offset = dec.flags & F_UTF8
950 ? dec.cur - SvPVX (string)
951 : utf8_distance (dec.cur, SvPVX (string));
952 SV *uni = sv_newmortal (); 1224 SV *uni = sv_newmortal ();
953 1225
954 // horrible hack to silence warning inside pv_uni_display 1226 // horrible hack to silence warning inside pv_uni_display
955 COP cop = *PL_curcop; 1227 COP cop = *PL_curcop;
956 cop.cop_warnings = pWARN_NONE; 1228 cop.cop_warnings = pWARN_NONE;
958 SAVEVPTR (PL_curcop); 1230 SAVEVPTR (PL_curcop);
959 PL_curcop = &cop; 1231 PL_curcop = &cop;
960 pv_uni_display (uni, dec.cur, dec.end - dec.cur, 20, UNI_DISPLAY_QQ); 1232 pv_uni_display (uni, dec.cur, dec.end - dec.cur, 20, UNI_DISPLAY_QQ);
961 LEAVE; 1233 LEAVE;
962 1234
963 croak ("%s, at character offset %d (%s)", 1235 croak ("%s, at character offset %d [\"%s\"]",
964 dec.err, 1236 dec.err,
965 (int)offset, 1237 (int)offset,
966 dec.cur != dec.end ? SvPV_nolen (uni) : "(end of string)"); 1238 dec.cur != dec.end ? SvPV_nolen (uni) : "(end of string)");
967 } 1239 }
968 1240
981 1253
982BOOT: 1254BOOT:
983{ 1255{
984 int i; 1256 int i;
985 1257
986 memset (decode_hexdigit, 0xff, 256);
987 for (i = 10; i--; ) 1258 for (i = 0; i < 256; ++i)
988 decode_hexdigit ['0' + i] = i; 1259 decode_hexdigit [i] =
1260 i >= '0' && i <= '9' ? i - '0'
1261 : i >= 'a' && i <= 'f' ? i - 'a' + 10
1262 : i >= 'A' && i <= 'F' ? i - 'A' + 10
1263 : -1;
989 1264
990 for (i = 7; i--; )
991 {
992 decode_hexdigit ['a' + i] = 10 + i;
993 decode_hexdigit ['A' + i] = 10 + i;
994 }
995
996 json_stash = gv_stashpv ("JSON::XS", 1); 1265 json_stash = gv_stashpv ("JSON::XS" , 1);
1266 json_boolean_stash = gv_stashpv ("JSON::XS::Boolean", 1);
1267
1268 json_true = get_sv ("JSON::XS::true" , 1); SvREADONLY_on (json_true );
1269 json_false = get_sv ("JSON::XS::false", 1); SvREADONLY_on (json_false);
997} 1270}
998 1271
999PROTOTYPES: DISABLE 1272PROTOTYPES: DISABLE
1000 1273
1001SV *new (char *dummy) 1274SV *new (char *dummy)
1004 OUTPUT: 1277 OUTPUT:
1005 RETVAL 1278 RETVAL
1006 1279
1007SV *ascii (SV *self, int enable = 1) 1280SV *ascii (SV *self, int enable = 1)
1008 ALIAS: 1281 ALIAS:
1009 ascii = F_ASCII 1282 ascii = F_ASCII
1283 latin1 = F_LATIN1
1010 utf8 = F_UTF8 1284 utf8 = F_UTF8
1011 indent = F_INDENT 1285 indent = F_INDENT
1012 canonical = F_CANONICAL 1286 canonical = F_CANONICAL
1013 space_before = F_SPACE_BEFORE 1287 space_before = F_SPACE_BEFORE
1014 space_after = F_SPACE_AFTER 1288 space_after = F_SPACE_AFTER
1015 pretty = F_PRETTY 1289 pretty = F_PRETTY
1016 allow_nonref = F_ALLOW_NONREF 1290 allow_nonref = F_ALLOW_NONREF
1017 shrink = F_SHRINK 1291 shrink = F_SHRINK
1292 allow_blessed = F_ALLOW_BLESSED
1293 convert_blessed = F_CONV_BLESSED
1018 CODE: 1294 CODE:
1019{ 1295{
1020 UV *uv = SvJSON (self); 1296 UV *uv = SvJSON (self);
1021 if (enable) 1297 if (enable)
1022 *uv |= ix; 1298 *uv |= ix;
1026 RETVAL = newSVsv (self); 1302 RETVAL = newSVsv (self);
1027} 1303}
1028 OUTPUT: 1304 OUTPUT:
1029 RETVAL 1305 RETVAL
1030 1306
1307SV *max_depth (SV *self, UV max_depth = 0x80000000UL)
1308 CODE:
1309{
1310 UV *uv = SvJSON (self);
1311 UV log2 = 0;
1312
1313 if (max_depth > 0x80000000UL) max_depth = 0x80000000UL;
1314
1315 while ((1UL << log2) < max_depth)
1316 ++log2;
1317
1318 *uv = *uv & ~F_MAXDEPTH | (log2 << S_MAXDEPTH);
1319
1320 RETVAL = newSVsv (self);
1321}
1322 OUTPUT:
1323 RETVAL
1324
1325SV *max_size (SV *self, UV max_size = 0)
1326 CODE:
1327{
1328 UV *uv = SvJSON (self);
1329 UV log2 = 0;
1330
1331 if (max_size > 0x80000000UL) max_size = 0x80000000UL;
1332 if (max_size == 1) max_size = 2;
1333
1334 while ((1UL << log2) < max_size)
1335 ++log2;
1336
1337 *uv = *uv & ~F_MAXSIZE | (log2 << S_MAXSIZE);
1338
1339 RETVAL = newSVsv (self);
1340}
1341 OUTPUT:
1342 RETVAL
1343
1031void encode (SV *self, SV *scalar) 1344void encode (SV *self, SV *scalar)
1032 PPCODE: 1345 PPCODE:
1033 XPUSHs (encode_json (scalar, *SvJSON (self))); 1346 XPUSHs (encode_json (scalar, *SvJSON (self)));
1034 1347
1035void decode (SV *self, SV *jsonstr) 1348void decode (SV *self, SV *jsonstr)
1036 PPCODE: 1349 PPCODE:
1037 XPUSHs (decode_json (jsonstr, *SvJSON (self))); 1350 XPUSHs (decode_json (jsonstr, *SvJSON (self), 0));
1351
1352void decode_prefix (SV *self, SV *jsonstr)
1353 PPCODE:
1354{
1355 UV offset;
1356 EXTEND (SP, 2);
1357 PUSHs (decode_json (jsonstr, *SvJSON (self), &offset));
1358 PUSHs (sv_2mortal (newSVuv (offset)));
1359}
1038 1360
1039PROTOTYPES: ENABLE 1361PROTOTYPES: ENABLE
1040 1362
1041void to_json (SV *scalar) 1363void to_json (SV *scalar)
1364 ALIAS:
1365 objToJson = 0
1042 PPCODE: 1366 PPCODE:
1043 XPUSHs (encode_json (scalar, F_UTF8)); 1367 XPUSHs (encode_json (scalar, F_DEFAULT | F_UTF8));
1044 1368
1045void from_json (SV *jsonstr) 1369void from_json (SV *jsonstr)
1370 ALIAS:
1371 jsonToObj = 0
1046 PPCODE: 1372 PPCODE:
1047 XPUSHs (decode_json (jsonstr, F_UTF8)); 1373 XPUSHs (decode_json (jsonstr, F_DEFAULT | F_UTF8, 0));
1048 1374

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines