… | |
… | |
9 | |
9 | |
10 | #if defined(__BORLANDC__) || defined(_MSC_VER) |
10 | #if defined(__BORLANDC__) || defined(_MSC_VER) |
11 | # define snprintf _snprintf // C compilers have this in stdio.h |
11 | # define snprintf _snprintf // C compilers have this in stdio.h |
12 | #endif |
12 | #endif |
13 | |
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 | |
14 | #define F_ASCII 0x00000001UL |
20 | #define F_ASCII 0x00000001UL |
|
|
21 | #define F_LATIN1 0x00000002UL |
15 | #define F_UTF8 0x00000002UL |
22 | #define F_UTF8 0x00000004UL |
16 | #define F_INDENT 0x00000004UL |
23 | #define F_INDENT 0x00000008UL |
17 | #define F_CANONICAL 0x00000008UL |
24 | #define F_CANONICAL 0x00000010UL |
18 | #define F_SPACE_BEFORE 0x00000010UL |
25 | #define F_SPACE_BEFORE 0x00000020UL |
19 | #define F_SPACE_AFTER 0x00000020UL |
26 | #define F_SPACE_AFTER 0x00000040UL |
20 | #define F_ALLOW_NONREF 0x00000080UL |
27 | #define F_ALLOW_NONREF 0x00000100UL |
21 | #define F_SHRINK 0x00000100UL |
28 | #define F_SHRINK 0x00000200UL |
|
|
29 | #define F_ALLOW_BLESSED 0x00000400UL |
|
|
30 | #define F_CONV_BLESSED 0x00000800UL // NYI |
22 | #define F_MAXDEPTH 0xf8000000UL |
31 | #define F_MAXDEPTH 0xf8000000UL |
23 | #define S_MAXDEPTH 27 |
32 | #define S_MAXDEPTH 27 |
|
|
33 | #define F_MAXSIZE 0x01f00000UL |
|
|
34 | #define S_MAXSIZE 20 |
24 | |
35 | |
25 | #define DEC_DEPTH(flags) (1UL << ((flags & F_MAXDEPTH) >> S_MAXDEPTH)) |
36 | #define DEC_DEPTH(flags) (1UL << ((flags & F_MAXDEPTH) >> S_MAXDEPTH)) |
26 | |
37 | #define DEC_SIZE(flags) (1UL << ((flags & F_MAXSIZE ) >> S_MAXSIZE )) |
27 | // F_SELFCONVERT? <=> to_json/toJson |
|
|
28 | // F_BLESSED? <=> { $__class__$ => } |
|
|
29 | |
38 | |
30 | #define F_PRETTY F_INDENT | F_SPACE_BEFORE | F_SPACE_AFTER |
39 | #define F_PRETTY F_INDENT | F_SPACE_BEFORE | F_SPACE_AFTER |
31 | #define F_DEFAULT (9UL << S_MAXDEPTH) |
40 | #define F_DEFAULT (9UL << S_MAXDEPTH) |
32 | |
41 | |
33 | #define INIT_SIZE 32 // initial scalar size to be allocated |
42 | #define INIT_SIZE 32 // initial scalar size to be allocated |
34 | #define INDENT_STEP 3 // spaces per indentation level |
43 | #define INDENT_STEP 3 // spaces per indentation level |
35 | |
44 | |
36 | #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 |
37 | |
46 | |
38 | #define SB do { |
47 | #define SB do { |
39 | #define SE } while (0) |
48 | #define SE } while (0) |
40 | |
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 | |
41 | static HV *json_stash; // JSON::XS:: |
61 | static HV *json_stash, *json_boolean_stash; // JSON::XS:: |
|
|
62 | static SV *json_true, *json_false; |
42 | |
63 | |
43 | ///////////////////////////////////////////////////////////////////////////// |
64 | ///////////////////////////////////////////////////////////////////////////// |
44 | // utility functions |
65 | // utility functions |
45 | |
66 | |
46 | static UV * |
67 | static UV * |
… | |
… | |
69 | // 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 |
70 | // case of an error. |
91 | // case of an error. |
71 | // we special-case "safe" characters from U+80 .. U+7FF, |
92 | // we special-case "safe" characters from U+80 .. U+7FF, |
72 | // but use the very good perl function to parse anything else. |
93 | // but use the very good perl function to parse anything else. |
73 | // note that we never call this function for a ascii codepoints |
94 | // note that we never call this function for a ascii codepoints |
74 | static UV |
95 | inline UV |
75 | decode_utf8 (unsigned char *s, STRLEN len, STRLEN *clen) |
96 | decode_utf8 (unsigned char *s, STRLEN len, STRLEN *clen) |
76 | { |
97 | { |
77 | if (s[0] > 0xdf || s[0] < 0xc2) |
98 | if (expect_false (s[0] > 0xdf || s[0] < 0xc2)) |
78 | return utf8n_to_uvuni (s, len, clen, UTF8_CHECK_ONLY); |
99 | return utf8n_to_uvuni (s, len, clen, UTF8_CHECK_ONLY); |
79 | else if (len > 1 && s[1] >= 0x80 && s[1] <= 0xbf) |
100 | else if (len > 1 && s[1] >= 0x80 && s[1] <= 0xbf) |
80 | { |
101 | { |
81 | *clen = 2; |
102 | *clen = 2; |
82 | return ((s[0] & 0x1f) << 6) | (s[1] & 0x3f); |
103 | return ((s[0] & 0x1f) << 6) | (s[1] & 0x3f); |
… | |
… | |
100 | U32 flags; // F_* |
121 | U32 flags; // F_* |
101 | U32 indent; // indentation level |
122 | U32 indent; // indentation level |
102 | U32 maxdepth; // max. indentation/recursion level |
123 | U32 maxdepth; // max. indentation/recursion level |
103 | } enc_t; |
124 | } enc_t; |
104 | |
125 | |
105 | static void |
126 | inline void |
106 | need (enc_t *enc, STRLEN len) |
127 | need (enc_t *enc, STRLEN len) |
107 | { |
128 | { |
108 | if (enc->cur + len >= enc->end) |
129 | if (expect_false (enc->cur + len >= enc->end)) |
109 | { |
130 | { |
110 | STRLEN cur = enc->cur - SvPVX (enc->sv); |
131 | STRLEN cur = enc->cur - SvPVX (enc->sv); |
111 | SvGROW (enc->sv, cur + len + 1); |
132 | SvGROW (enc->sv, cur + len + 1); |
112 | enc->cur = SvPVX (enc->sv) + cur; |
133 | enc->cur = SvPVX (enc->sv) + cur; |
113 | enc->end = SvPVX (enc->sv) + SvLEN (enc->sv) - 1; |
134 | enc->end = SvPVX (enc->sv) + SvLEN (enc->sv) - 1; |
114 | } |
135 | } |
115 | } |
136 | } |
116 | |
137 | |
117 | static void |
138 | inline void |
118 | encode_ch (enc_t *enc, char ch) |
139 | encode_ch (enc_t *enc, char ch) |
119 | { |
140 | { |
120 | need (enc, 1); |
141 | need (enc, 1); |
121 | *enc->cur++ = ch; |
142 | *enc->cur++ = ch; |
122 | } |
143 | } |
… | |
… | |
130 | |
151 | |
131 | while (str < end) |
152 | while (str < end) |
132 | { |
153 | { |
133 | unsigned char ch = *(unsigned char *)str; |
154 | unsigned char ch = *(unsigned char *)str; |
134 | |
155 | |
135 | if (ch >= 0x20 && ch < 0x80) // most common case |
156 | if (expect_true (ch >= 0x20 && ch < 0x80)) // most common case |
136 | { |
157 | { |
137 | if (ch == '"') // but with slow exceptions |
158 | if (expect_false (ch == '"')) // but with slow exceptions |
138 | { |
159 | { |
139 | need (enc, len += 1); |
160 | need (enc, len += 1); |
140 | *enc->cur++ = '\\'; |
161 | *enc->cur++ = '\\'; |
141 | *enc->cur++ = '"'; |
162 | *enc->cur++ = '"'; |
142 | } |
163 | } |
143 | else if (ch == '\\') |
164 | else if (expect_false (ch == '\\')) |
144 | { |
165 | { |
145 | need (enc, len += 1); |
166 | need (enc, len += 1); |
146 | *enc->cur++ = '\\'; |
167 | *enc->cur++ = '\\'; |
147 | *enc->cur++ = '\\'; |
168 | *enc->cur++ = '\\'; |
148 | } |
169 | } |
… | |
… | |
166 | STRLEN clen; |
187 | STRLEN clen; |
167 | UV uch; |
188 | UV uch; |
168 | |
189 | |
169 | if (is_utf8) |
190 | if (is_utf8) |
170 | { |
191 | { |
171 | //uch = utf8n_to_uvuni (str, end - str, &clen, UTF8_CHECK_ONLY); |
|
|
172 | uch = decode_utf8 (str, end - str, &clen); |
192 | uch = decode_utf8 (str, end - str, &clen); |
173 | if (clen == (STRLEN)-1) |
193 | if (clen == (STRLEN)-1) |
174 | 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); |
175 | } |
195 | } |
176 | else |
196 | else |
… | |
… | |
180 | } |
200 | } |
181 | |
201 | |
182 | if (uch > 0x10FFFFUL) |
202 | if (uch > 0x10FFFFUL) |
183 | 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); |
184 | |
204 | |
185 | if (uch < 0x80 || enc->flags & F_ASCII) |
205 | if (uch < 0x80 || enc->flags & F_ASCII || (enc->flags & F_LATIN1 && uch > 0xFF)) |
186 | { |
206 | { |
187 | if (uch > 0xFFFFUL) |
207 | if (uch > 0xFFFFUL) |
188 | { |
208 | { |
189 | need (enc, len += 11); |
209 | need (enc, len += 11); |
190 | sprintf (enc->cur, "\\u%04x\\u%04x", |
210 | sprintf (enc->cur, "\\u%04x\\u%04x", |
… | |
… | |
204 | *enc->cur++ = hexdigit [(uch >> 0) & 15]; |
224 | *enc->cur++ = hexdigit [(uch >> 0) & 15]; |
205 | } |
225 | } |
206 | |
226 | |
207 | str += clen; |
227 | str += clen; |
208 | } |
228 | } |
|
|
229 | else if (enc->flags & F_LATIN1) |
|
|
230 | { |
|
|
231 | *enc->cur++ = uch; |
|
|
232 | str += clen; |
|
|
233 | } |
209 | else if (is_utf8) |
234 | else if (is_utf8) |
210 | { |
235 | { |
211 | need (enc, len += clen); |
236 | need (enc, len += clen); |
212 | do |
237 | do |
213 | { |
238 | { |
… | |
… | |
227 | |
252 | |
228 | --len; |
253 | --len; |
229 | } |
254 | } |
230 | } |
255 | } |
231 | |
256 | |
232 | static void |
257 | inline void |
233 | encode_indent (enc_t *enc) |
258 | encode_indent (enc_t *enc) |
234 | { |
259 | { |
235 | if (enc->flags & F_INDENT) |
260 | if (enc->flags & F_INDENT) |
236 | { |
261 | { |
237 | int spaces = enc->indent * INDENT_STEP; |
262 | int spaces = enc->indent * INDENT_STEP; |
… | |
… | |
240 | memset (enc->cur, ' ', spaces); |
265 | memset (enc->cur, ' ', spaces); |
241 | enc->cur += spaces; |
266 | enc->cur += spaces; |
242 | } |
267 | } |
243 | } |
268 | } |
244 | |
269 | |
245 | static void |
270 | inline void |
246 | encode_space (enc_t *enc) |
271 | encode_space (enc_t *enc) |
247 | { |
272 | { |
248 | need (enc, 1); |
273 | need (enc, 1); |
249 | encode_ch (enc, ' '); |
274 | encode_ch (enc, ' '); |
250 | } |
275 | } |
251 | |
276 | |
252 | static void |
277 | inline void |
253 | encode_nl (enc_t *enc) |
278 | encode_nl (enc_t *enc) |
254 | { |
279 | { |
255 | if (enc->flags & F_INDENT) |
280 | if (enc->flags & F_INDENT) |
256 | { |
281 | { |
257 | need (enc, 1); |
282 | need (enc, 1); |
258 | encode_ch (enc, '\n'); |
283 | encode_ch (enc, '\n'); |
259 | } |
284 | } |
260 | } |
285 | } |
261 | |
286 | |
262 | static void |
287 | inline void |
263 | encode_comma (enc_t *enc) |
288 | encode_comma (enc_t *enc) |
264 | { |
289 | { |
265 | encode_ch (enc, ','); |
290 | encode_ch (enc, ','); |
266 | |
291 | |
267 | if (enc->flags & F_INDENT) |
292 | if (enc->flags & F_INDENT) |
… | |
… | |
366 | // actually, this is mostly due to the stupid so-called |
391 | // actually, this is mostly due to the stupid so-called |
367 | // security workaround added somewhere in 5.8.x. |
392 | // security workaround added somewhere in 5.8.x. |
368 | // that randomises hash orderings |
393 | // that randomises hash orderings |
369 | if (enc->flags & F_CANONICAL) |
394 | if (enc->flags & F_CANONICAL) |
370 | { |
395 | { |
371 | HE *he, *hes [count]; // if your compiler dies here, you need to enable C99 mode |
|
|
372 | 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 |
373 | |
403 | |
374 | i = 0; |
404 | i = 0; |
375 | while ((he = hv_iternext (hv))) |
405 | while ((he = hv_iternext (hv))) |
376 | { |
406 | { |
377 | hes [i++] = he; |
407 | hes [i++] = he; |
… | |
… | |
441 | svtype svt; |
471 | svtype svt; |
442 | |
472 | |
443 | SvGETMAGIC (sv); |
473 | SvGETMAGIC (sv); |
444 | svt = SvTYPE (sv); |
474 | svt = SvTYPE (sv); |
445 | |
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 | } |
446 | if (svt == SVt_PVHV) |
530 | else if (svt == SVt_PVHV) |
447 | encode_hv (enc, (HV *)sv); |
531 | encode_hv (enc, (HV *)sv); |
448 | else if (svt == SVt_PVAV) |
532 | else if (svt == SVt_PVAV) |
449 | encode_av (enc, (AV *)sv); |
533 | encode_av (enc, (AV *)sv); |
450 | else if (svt < SVt_PVAV) |
534 | else if (svt < SVt_PVAV) |
451 | { |
535 | { |
… | |
… | |
475 | encode_str (enc, str, len, SvUTF8 (sv)); |
559 | encode_str (enc, str, len, SvUTF8 (sv)); |
476 | encode_ch (enc, '"'); |
560 | encode_ch (enc, '"'); |
477 | } |
561 | } |
478 | else if (SvNOKp (sv)) |
562 | else if (SvNOKp (sv)) |
479 | { |
563 | { |
|
|
564 | // trust that perl will do the right thing w.r.t. JSON syntax. |
480 | need (enc, NV_DIG + 32); |
565 | need (enc, NV_DIG + 32); |
481 | Gconvert (SvNVX (sv), NV_DIG, 0, enc->cur); |
566 | Gconvert (SvNVX (sv), NV_DIG, 0, enc->cur); |
482 | enc->cur += strlen (enc->cur); |
567 | enc->cur += strlen (enc->cur); |
483 | } |
568 | } |
484 | else if (SvIOKp (sv)) |
569 | else if (SvIOKp (sv)) |
485 | { |
570 | { |
486 | 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); |
487 | enc->cur += |
576 | enc->cur += |
488 | SvIsUV(sv) |
577 | SvIsUV(sv) |
489 | ? snprintf (enc->cur, 64, "%"UVuf, (UV)SvUVX (sv)) |
578 | ? snprintf (enc->cur, sizeof (UV) * 3, "%"UVuf, (UV)SvUVX (sv)) |
490 | : 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 | } |
491 | } |
608 | } |
492 | else if (SvROK (sv)) |
609 | else if (SvROK (sv)) |
493 | encode_rv (enc, SvRV (sv)); |
610 | encode_rv (enc, SvRV (sv)); |
494 | else if (!SvOK (sv)) |
611 | else if (!SvOK (sv)) |
495 | encode_str (enc, "null", 4, 0); |
612 | encode_str (enc, "null", 4, 0); |
… | |
… | |
514 | enc.maxdepth = DEC_DEPTH (flags); |
631 | enc.maxdepth = DEC_DEPTH (flags); |
515 | |
632 | |
516 | SvPOK_only (enc.sv); |
633 | SvPOK_only (enc.sv); |
517 | encode_sv (&enc, scalar); |
634 | encode_sv (&enc, scalar); |
518 | |
635 | |
519 | if (!(flags & (F_ASCII | F_UTF8))) |
|
|
520 | SvUTF8_on (enc.sv); |
|
|
521 | |
|
|
522 | SvCUR_set (enc.sv, enc.cur - SvPVX (enc.sv)); |
636 | SvCUR_set (enc.sv, enc.cur - SvPVX (enc.sv)); |
523 | *SvEND (enc.sv) = 0; // many xs functions expect a trailing 0 for text strings |
637 | *SvEND (enc.sv) = 0; // many xs functions expect a trailing 0 for text strings |
|
|
638 | |
|
|
639 | if (!(flags & (F_ASCII | F_LATIN1 | F_UTF8))) |
|
|
640 | SvUTF8_on (enc.sv); |
524 | |
641 | |
525 | if (enc.flags & F_SHRINK) |
642 | if (enc.flags & F_SHRINK) |
526 | shrink (enc.sv); |
643 | shrink (enc.sv); |
527 | |
644 | |
528 | return enc.sv; |
645 | return enc.sv; |
… | |
… | |
540 | U32 flags; // F_* |
657 | U32 flags; // F_* |
541 | U32 depth; // recursion depth |
658 | U32 depth; // recursion depth |
542 | U32 maxdepth; // recursion depth limit |
659 | U32 maxdepth; // recursion depth limit |
543 | } dec_t; |
660 | } dec_t; |
544 | |
661 | |
545 | static void |
662 | inline void |
546 | decode_ws (dec_t *dec) |
663 | decode_ws (dec_t *dec) |
547 | { |
664 | { |
548 | for (;;) |
665 | for (;;) |
549 | { |
666 | { |
550 | char ch = *dec->cur; |
667 | char ch = *dec->cur; |
… | |
… | |
576 | decode_4hex (dec_t *dec) |
693 | decode_4hex (dec_t *dec) |
577 | { |
694 | { |
578 | signed char d1, d2, d3, d4; |
695 | signed char d1, d2, d3, d4; |
579 | unsigned char *cur = (unsigned char *)dec->cur; |
696 | unsigned char *cur = (unsigned char *)dec->cur; |
580 | |
697 | |
581 | 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"); |
582 | 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"); |
583 | 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"); |
584 | 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"); |
585 | |
702 | |
586 | dec->cur += 4; |
703 | dec->cur += 4; |
587 | |
704 | |
588 | return ((UV)d1) << 12 |
705 | return ((UV)d1) << 12 |
589 | | ((UV)d2) << 8 |
706 | | ((UV)d2) << 8 |
… | |
… | |
597 | static SV * |
714 | static SV * |
598 | decode_str (dec_t *dec) |
715 | decode_str (dec_t *dec) |
599 | { |
716 | { |
600 | SV *sv = 0; |
717 | SV *sv = 0; |
601 | int utf8 = 0; |
718 | int utf8 = 0; |
|
|
719 | char *dec_cur = dec->cur; |
602 | |
720 | |
603 | do |
721 | do |
604 | { |
722 | { |
605 | char buf [SHORT_STRING_LEN + UTF8_MAXBYTES]; |
723 | char buf [SHORT_STRING_LEN + UTF8_MAXBYTES]; |
606 | char *cur = buf; |
724 | char *cur = buf; |
607 | |
725 | |
608 | do |
726 | do |
609 | { |
727 | { |
610 | unsigned char ch = *(unsigned char *)dec->cur++; |
728 | unsigned char ch = *(unsigned char *)dec_cur++; |
611 | |
729 | |
612 | if (ch == '"') |
730 | if (expect_false (ch == '"')) |
613 | { |
731 | { |
614 | --dec->cur; |
732 | --dec_cur; |
615 | break; |
733 | break; |
616 | } |
734 | } |
617 | else if (ch == '\\') |
735 | else if (expect_false (ch == '\\')) |
618 | { |
736 | { |
619 | switch (*dec->cur) |
737 | switch (*dec_cur) |
620 | { |
738 | { |
621 | case '\\': |
739 | case '\\': |
622 | case '/': |
740 | case '/': |
623 | case '"': *cur++ = *dec->cur++; break; |
741 | case '"': *cur++ = *dec_cur++; break; |
624 | |
742 | |
625 | case 'b': ++dec->cur; *cur++ = '\010'; break; |
743 | case 'b': ++dec_cur; *cur++ = '\010'; break; |
626 | case 't': ++dec->cur; *cur++ = '\011'; break; |
744 | case 't': ++dec_cur; *cur++ = '\011'; break; |
627 | case 'n': ++dec->cur; *cur++ = '\012'; break; |
745 | case 'n': ++dec_cur; *cur++ = '\012'; break; |
628 | case 'f': ++dec->cur; *cur++ = '\014'; break; |
746 | case 'f': ++dec_cur; *cur++ = '\014'; break; |
629 | case 'r': ++dec->cur; *cur++ = '\015'; break; |
747 | case 'r': ++dec_cur; *cur++ = '\015'; break; |
630 | |
748 | |
631 | case 'u': |
749 | case 'u': |
632 | { |
750 | { |
633 | UV lo, hi; |
751 | UV lo, hi; |
634 | ++dec->cur; |
752 | ++dec_cur; |
635 | |
753 | |
|
|
754 | dec->cur = dec_cur; |
636 | hi = decode_4hex (dec); |
755 | hi = decode_4hex (dec); |
|
|
756 | dec_cur = dec->cur; |
637 | if (hi == (UV)-1) |
757 | if (hi == (UV)-1) |
638 | goto fail; |
758 | goto fail; |
639 | |
759 | |
640 | // possibly a surrogate pair |
760 | // possibly a surrogate pair |
641 | if (hi >= 0xd800) |
761 | if (hi >= 0xd800) |
642 | if (hi < 0xdc00) |
762 | if (hi < 0xdc00) |
643 | { |
763 | { |
644 | if (dec->cur [0] != '\\' || dec->cur [1] != 'u') |
764 | if (dec_cur [0] != '\\' || dec_cur [1] != 'u') |
645 | ERR ("missing low surrogate character in surrogate pair"); |
765 | ERR ("missing low surrogate character in surrogate pair"); |
646 | |
766 | |
647 | dec->cur += 2; |
767 | dec_cur += 2; |
648 | |
768 | |
|
|
769 | dec->cur = dec_cur; |
649 | lo = decode_4hex (dec); |
770 | lo = decode_4hex (dec); |
|
|
771 | dec_cur = dec->cur; |
650 | if (lo == (UV)-1) |
772 | if (lo == (UV)-1) |
651 | goto fail; |
773 | goto fail; |
652 | |
774 | |
653 | if (lo < 0xdc00 || lo >= 0xe000) |
775 | if (lo < 0xdc00 || lo >= 0xe000) |
654 | ERR ("surrogate pair expected"); |
776 | ERR ("surrogate pair expected"); |
… | |
… | |
668 | *cur++ = hi; |
790 | *cur++ = hi; |
669 | } |
791 | } |
670 | break; |
792 | break; |
671 | |
793 | |
672 | default: |
794 | default: |
673 | --dec->cur; |
795 | --dec_cur; |
674 | ERR ("illegal backslash escape sequence in string"); |
796 | ERR ("illegal backslash escape sequence in string"); |
675 | } |
797 | } |
676 | } |
798 | } |
677 | else if (ch >= 0x20 && ch <= 0x7f) |
799 | else if (expect_true (ch >= 0x20 && ch <= 0x7f)) |
678 | *cur++ = ch; |
800 | *cur++ = ch; |
679 | else if (ch >= 0x80) |
801 | else if (ch >= 0x80) |
680 | { |
802 | { |
681 | STRLEN clen; |
803 | STRLEN clen; |
682 | UV uch; |
804 | UV uch; |
683 | |
805 | |
684 | --dec->cur; |
806 | --dec_cur; |
685 | |
807 | |
686 | uch = decode_utf8 (dec->cur, dec->end - dec->cur, &clen); |
808 | uch = decode_utf8 (dec_cur, dec->end - dec_cur, &clen); |
687 | if (clen == (STRLEN)-1) |
809 | if (clen == (STRLEN)-1) |
688 | ERR ("malformed UTF-8 character in JSON string"); |
810 | ERR ("malformed UTF-8 character in JSON string"); |
689 | |
811 | |
690 | do |
812 | do |
691 | *cur++ = *dec->cur++; |
813 | *cur++ = *dec_cur++; |
692 | while (--clen); |
814 | while (--clen); |
693 | |
815 | |
694 | utf8 = 1; |
816 | utf8 = 1; |
695 | } |
817 | } |
696 | else |
818 | else |
697 | { |
819 | { |
698 | --dec->cur; |
820 | --dec_cur; |
699 | |
821 | |
700 | if (!ch) |
822 | if (!ch) |
701 | ERR ("unexpected end of string while parsing JSON string"); |
823 | ERR ("unexpected end of string while parsing JSON string"); |
702 | else |
824 | else |
703 | ERR ("invalid character encountered while parsing JSON string"); |
825 | ERR ("invalid character encountered while parsing JSON string"); |
… | |
… | |
716 | } |
838 | } |
717 | else |
839 | else |
718 | sv = newSVpvn (buf, len); |
840 | sv = newSVpvn (buf, len); |
719 | } |
841 | } |
720 | } |
842 | } |
721 | while (*dec->cur != '"'); |
843 | while (*dec_cur != '"'); |
722 | |
844 | |
723 | ++dec->cur; |
845 | ++dec_cur; |
724 | |
846 | |
725 | if (sv) |
847 | if (sv) |
726 | { |
848 | { |
727 | SvPOK_only (sv); |
849 | SvPOK_only (sv); |
728 | *SvEND (sv) = 0; |
850 | *SvEND (sv) = 0; |
… | |
… | |
731 | SvUTF8_on (sv); |
853 | SvUTF8_on (sv); |
732 | } |
854 | } |
733 | else |
855 | else |
734 | sv = newSVpvn ("", 0); |
856 | sv = newSVpvn ("", 0); |
735 | |
857 | |
|
|
858 | dec->cur = dec_cur; |
736 | return sv; |
859 | return sv; |
737 | |
860 | |
738 | fail: |
861 | fail: |
|
|
862 | dec->cur = dec_cur; |
739 | return 0; |
863 | return 0; |
740 | } |
864 | } |
741 | |
865 | |
742 | static SV * |
866 | static SV * |
743 | decode_num (dec_t *dec) |
867 | decode_num (dec_t *dec) |
… | |
… | |
801 | is_nv = 1; |
925 | is_nv = 1; |
802 | } |
926 | } |
803 | |
927 | |
804 | if (!is_nv) |
928 | if (!is_nv) |
805 | { |
929 | { |
806 | UV uv; |
930 | // special case the rather common 1..4-digit-int case, assumes 32 bit ints or so |
807 | int numtype = grok_number (start, dec->cur - start, &uv); |
931 | if (*start == '-') |
808 | if (numtype & IS_NUMBER_IN_UV) |
932 | switch (dec->cur - start) |
809 | if (numtype & IS_NUMBER_NEG) |
|
|
810 | { |
933 | { |
811 | if (uv < (UV)IV_MIN) |
934 | case 2: return newSViv (-( start [1] - '0' * 1)); |
812 | 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)); |
813 | } |
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 | } |
814 | else |
957 | else |
815 | return newSVuv (uv); |
958 | return newSVuv (uv); |
|
|
959 | |
|
|
960 | // here would likely be the place for bigint support |
816 | } |
961 | } |
|
|
962 | } |
817 | |
963 | |
|
|
964 | // if we ever support bigint or bigfloat, this is the place for bigfloat |
818 | return newSVnv (Atof (start)); |
965 | return newSVnv (Atof (start)); |
819 | |
966 | |
820 | fail: |
967 | fail: |
821 | return 0; |
968 | return 0; |
822 | } |
969 | } |
… | |
… | |
923 | |
1070 | |
924 | static SV * |
1071 | static SV * |
925 | decode_sv (dec_t *dec) |
1072 | decode_sv (dec_t *dec) |
926 | { |
1073 | { |
927 | decode_ws (dec); |
1074 | decode_ws (dec); |
|
|
1075 | |
|
|
1076 | // the beauty of JSON: you need exactly one character lookahead |
|
|
1077 | // to parse anything. |
928 | switch (*dec->cur) |
1078 | switch (*dec->cur) |
929 | { |
1079 | { |
930 | case '"': ++dec->cur; return decode_str (dec); |
1080 | case '"': ++dec->cur; return decode_str (dec); |
931 | case '[': ++dec->cur; return decode_av (dec); |
1081 | case '[': ++dec->cur; return decode_av (dec); |
932 | case '{': ++dec->cur; return decode_hv (dec); |
1082 | case '{': ++dec->cur; return decode_hv (dec); |
… | |
… | |
938 | |
1088 | |
939 | case 't': |
1089 | case 't': |
940 | if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "true", 4)) |
1090 | if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "true", 4)) |
941 | { |
1091 | { |
942 | dec->cur += 4; |
1092 | dec->cur += 4; |
943 | return newSViv (1); |
1093 | return SvREFCNT_inc (json_true); |
944 | } |
1094 | } |
945 | else |
1095 | else |
946 | ERR ("'true' expected"); |
1096 | ERR ("'true' expected"); |
947 | |
1097 | |
948 | break; |
1098 | break; |
949 | |
1099 | |
950 | case 'f': |
1100 | case 'f': |
951 | if (dec->end - dec->cur >= 5 && !memcmp (dec->cur, "false", 5)) |
1101 | if (dec->end - dec->cur >= 5 && !memcmp (dec->cur, "false", 5)) |
952 | { |
1102 | { |
953 | dec->cur += 5; |
1103 | dec->cur += 5; |
954 | return newSViv (0); |
1104 | return SvREFCNT_inc (json_false); |
955 | } |
1105 | } |
956 | else |
1106 | else |
957 | ERR ("'false' expected"); |
1107 | ERR ("'false' expected"); |
958 | |
1108 | |
959 | break; |
1109 | break; |
… | |
… | |
977 | fail: |
1127 | fail: |
978 | return 0; |
1128 | return 0; |
979 | } |
1129 | } |
980 | |
1130 | |
981 | static SV * |
1131 | static SV * |
982 | decode_json (SV *string, U32 flags) |
1132 | decode_json (SV *string, U32 flags, UV *offset_return) |
983 | { |
1133 | { |
984 | dec_t dec; |
1134 | dec_t dec; |
|
|
1135 | UV offset; |
985 | SV *sv; |
1136 | SV *sv; |
986 | |
1137 | |
|
|
1138 | SvGETMAGIC (string); |
987 | SvUPGRADE (string, SVt_PV); |
1139 | SvUPGRADE (string, SVt_PV); |
|
|
1140 | |
|
|
1141 | if (flags & F_MAXSIZE && SvCUR (string) > DEC_SIZE (flags)) |
|
|
1142 | croak ("attempted decode of JSON text of %lu bytes size, but max_size is set to %lu", |
|
|
1143 | (unsigned long)SvCUR (string), (unsigned long)DEC_SIZE (flags)); |
988 | |
1144 | |
989 | if (flags & F_UTF8) |
1145 | if (flags & F_UTF8) |
990 | sv_utf8_downgrade (string, 0); |
1146 | sv_utf8_downgrade (string, 0); |
991 | else |
1147 | else |
992 | sv_utf8_upgrade (string); |
1148 | sv_utf8_upgrade (string); |
… | |
… | |
998 | dec.end = SvEND (string); |
1154 | dec.end = SvEND (string); |
999 | dec.err = 0; |
1155 | dec.err = 0; |
1000 | dec.depth = 0; |
1156 | dec.depth = 0; |
1001 | dec.maxdepth = DEC_DEPTH (dec.flags); |
1157 | dec.maxdepth = DEC_DEPTH (dec.flags); |
1002 | |
1158 | |
1003 | *dec.end = 0; // this should basically be a nop, too, but make sure its there |
1159 | *dec.end = 0; // this should basically be a nop, too, but make sure it's there |
1004 | sv = decode_sv (&dec); |
1160 | sv = decode_sv (&dec); |
1005 | |
1161 | |
|
|
1162 | if (!(offset_return || !sv)) |
|
|
1163 | { |
|
|
1164 | // check for trailing garbage |
|
|
1165 | decode_ws (&dec); |
|
|
1166 | |
|
|
1167 | if (*dec.cur) |
|
|
1168 | { |
|
|
1169 | dec.err = "garbage after JSON object"; |
|
|
1170 | SvREFCNT_dec (sv); |
|
|
1171 | sv = 0; |
|
|
1172 | } |
|
|
1173 | } |
|
|
1174 | |
|
|
1175 | if (offset_return || !sv) |
|
|
1176 | { |
|
|
1177 | offset = dec.flags & F_UTF8 |
|
|
1178 | ? dec.cur - SvPVX (string) |
|
|
1179 | : utf8_distance (dec.cur, SvPVX (string)); |
|
|
1180 | |
|
|
1181 | if (offset_return) |
|
|
1182 | *offset_return = offset; |
|
|
1183 | } |
|
|
1184 | |
1006 | if (!sv) |
1185 | if (!sv) |
1007 | { |
1186 | { |
1008 | IV offset = dec.flags & F_UTF8 |
|
|
1009 | ? dec.cur - SvPVX (string) |
|
|
1010 | : utf8_distance (dec.cur, SvPVX (string)); |
|
|
1011 | SV *uni = sv_newmortal (); |
1187 | SV *uni = sv_newmortal (); |
1012 | |
1188 | |
1013 | // horrible hack to silence warning inside pv_uni_display |
1189 | // horrible hack to silence warning inside pv_uni_display |
1014 | COP cop = *PL_curcop; |
1190 | COP cop = *PL_curcop; |
1015 | cop.cop_warnings = pWARN_NONE; |
1191 | cop.cop_warnings = pWARN_NONE; |
… | |
… | |
1040 | |
1216 | |
1041 | BOOT: |
1217 | BOOT: |
1042 | { |
1218 | { |
1043 | int i; |
1219 | int i; |
1044 | |
1220 | |
1045 | memset (decode_hexdigit, 0xff, 256); |
|
|
1046 | |
|
|
1047 | for (i = 0; i < 256; ++i) |
1221 | for (i = 0; i < 256; ++i) |
1048 | decode_hexdigit [i] = |
1222 | decode_hexdigit [i] = |
1049 | i >= '0' && i <= '9' ? i - '0' |
1223 | i >= '0' && i <= '9' ? i - '0' |
1050 | : i >= 'a' && i <= 'f' ? i - 'a' + 10 |
1224 | : i >= 'a' && i <= 'f' ? i - 'a' + 10 |
1051 | : i >= 'A' && i <= 'F' ? i - 'A' + 10 |
1225 | : i >= 'A' && i <= 'F' ? i - 'A' + 10 |
1052 | : -1; |
1226 | : -1; |
1053 | |
1227 | |
1054 | json_stash = gv_stashpv ("JSON::XS", 1); |
1228 | json_stash = gv_stashpv ("JSON::XS" , 1); |
|
|
1229 | json_boolean_stash = gv_stashpv ("JSON::XS::Boolean", 1); |
|
|
1230 | |
|
|
1231 | json_true = get_sv ("JSON::XS::true" , 1); SvREADONLY_on (json_true ); |
|
|
1232 | json_false = get_sv ("JSON::XS::false", 1); SvREADONLY_on (json_false); |
1055 | } |
1233 | } |
1056 | |
1234 | |
1057 | PROTOTYPES: DISABLE |
1235 | PROTOTYPES: DISABLE |
1058 | |
1236 | |
1059 | SV *new (char *dummy) |
1237 | SV *new (char *dummy) |
… | |
… | |
1062 | OUTPUT: |
1240 | OUTPUT: |
1063 | RETVAL |
1241 | RETVAL |
1064 | |
1242 | |
1065 | SV *ascii (SV *self, int enable = 1) |
1243 | SV *ascii (SV *self, int enable = 1) |
1066 | ALIAS: |
1244 | ALIAS: |
1067 | ascii = F_ASCII |
1245 | ascii = F_ASCII |
|
|
1246 | latin1 = F_LATIN1 |
1068 | utf8 = F_UTF8 |
1247 | utf8 = F_UTF8 |
1069 | indent = F_INDENT |
1248 | indent = F_INDENT |
1070 | canonical = F_CANONICAL |
1249 | canonical = F_CANONICAL |
1071 | space_before = F_SPACE_BEFORE |
1250 | space_before = F_SPACE_BEFORE |
1072 | space_after = F_SPACE_AFTER |
1251 | space_after = F_SPACE_AFTER |
1073 | pretty = F_PRETTY |
1252 | pretty = F_PRETTY |
1074 | allow_nonref = F_ALLOW_NONREF |
1253 | allow_nonref = F_ALLOW_NONREF |
1075 | shrink = F_SHRINK |
1254 | shrink = F_SHRINK |
|
|
1255 | allow_blessed = F_ALLOW_BLESSED |
|
|
1256 | convert_blessed = F_CONV_BLESSED |
1076 | CODE: |
1257 | CODE: |
1077 | { |
1258 | { |
1078 | UV *uv = SvJSON (self); |
1259 | UV *uv = SvJSON (self); |
1079 | if (enable) |
1260 | if (enable) |
1080 | *uv |= ix; |
1261 | *uv |= ix; |
… | |
… | |
1102 | RETVAL = newSVsv (self); |
1283 | RETVAL = newSVsv (self); |
1103 | } |
1284 | } |
1104 | OUTPUT: |
1285 | OUTPUT: |
1105 | RETVAL |
1286 | RETVAL |
1106 | |
1287 | |
|
|
1288 | SV *max_size (SV *self, UV max_size = 0) |
|
|
1289 | CODE: |
|
|
1290 | { |
|
|
1291 | UV *uv = SvJSON (self); |
|
|
1292 | UV log2 = 0; |
|
|
1293 | |
|
|
1294 | if (max_size > 0x80000000UL) max_size = 0x80000000UL; |
|
|
1295 | if (max_size == 1) max_size = 2; |
|
|
1296 | |
|
|
1297 | while ((1UL << log2) < max_size) |
|
|
1298 | ++log2; |
|
|
1299 | |
|
|
1300 | *uv = *uv & ~F_MAXSIZE | (log2 << S_MAXSIZE); |
|
|
1301 | |
|
|
1302 | RETVAL = newSVsv (self); |
|
|
1303 | } |
|
|
1304 | OUTPUT: |
|
|
1305 | RETVAL |
|
|
1306 | |
1107 | void encode (SV *self, SV *scalar) |
1307 | void encode (SV *self, SV *scalar) |
1108 | PPCODE: |
1308 | PPCODE: |
1109 | XPUSHs (encode_json (scalar, *SvJSON (self))); |
1309 | XPUSHs (encode_json (scalar, *SvJSON (self))); |
1110 | |
1310 | |
1111 | void decode (SV *self, SV *jsonstr) |
1311 | void decode (SV *self, SV *jsonstr) |
1112 | PPCODE: |
1312 | PPCODE: |
1113 | XPUSHs (decode_json (jsonstr, *SvJSON (self))); |
1313 | XPUSHs (decode_json (jsonstr, *SvJSON (self), 0)); |
|
|
1314 | |
|
|
1315 | void decode_prefix (SV *self, SV *jsonstr) |
|
|
1316 | PPCODE: |
|
|
1317 | { |
|
|
1318 | UV offset; |
|
|
1319 | EXTEND (SP, 2); |
|
|
1320 | PUSHs (decode_json (jsonstr, *SvJSON (self), &offset)); |
|
|
1321 | PUSHs (sv_2mortal (newSVuv (offset))); |
|
|
1322 | } |
1114 | |
1323 | |
1115 | PROTOTYPES: ENABLE |
1324 | PROTOTYPES: ENABLE |
1116 | |
1325 | |
1117 | void to_json (SV *scalar) |
1326 | void to_json (SV *scalar) |
1118 | ALIAS: |
1327 | ALIAS: |
… | |
… | |
1122 | |
1331 | |
1123 | void from_json (SV *jsonstr) |
1332 | void from_json (SV *jsonstr) |
1124 | ALIAS: |
1333 | ALIAS: |
1125 | jsonToObj = 0 |
1334 | jsonToObj = 0 |
1126 | PPCODE: |
1335 | PPCODE: |
1127 | XPUSHs (decode_json (jsonstr, F_DEFAULT | F_UTF8)); |
1336 | XPUSHs (decode_json (jsonstr, F_DEFAULT | F_UTF8, 0)); |
1128 | |
1337 | |