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.3 by root, Thu Mar 22 18:10:29 2007 UTC vs.
Revision 1.132 by root, Tue Sep 5 13:07:09 2017 UTC

1#include "EXTERN.h" 1#include "EXTERN.h"
2#include "perl.h" 2#include "perl.h"
3#include "XSUB.h" 3#include "XSUB.h"
4 4
5#include "assert.h" 5#include <assert.h>
6#include "string.h" 6#include <string.h>
7#include "stdlib.h" 7#include <stdlib.h>
8#include <stdio.h>
9#include <limits.h>
10#include <float.h>
11#include <inttypes.h>
8 12
13#if defined(__BORLANDC__) || defined(_MSC_VER)
14# define snprintf _snprintf // C compilers have this in stdio.h
15#endif
16
17// some old perls do not have this, try to make it work, no
18// guarantees, though. if it breaks, you get to keep the pieces.
19#ifndef UTF8_MAXBYTES
20# define UTF8_MAXBYTES 13
21#endif
22
23// compatibility with perl <5.18
24#ifndef HvNAMELEN_get
25# define HvNAMELEN_get(hv) strlen (HvNAME (hv))
26#endif
27#ifndef HvNAMELEN
28# define HvNAMELEN(hv) HvNAMELEN_get (hv)
29#endif
30#ifndef HvNAMEUTF8
31# define HvNAMEUTF8(hv) 0
32#endif
33
34// three extra for rounding, sign, and end of string
35#define IVUV_MAXCHARS (sizeof (UV) * CHAR_BIT * 28 / 93 + 3)
36
9#define F_ASCII 0x00000001 37#define F_ASCII 0x00000001UL
38#define F_LATIN1 0x00000002UL
10#define F_UTF8 0x00000002 39#define F_UTF8 0x00000004UL
11#define F_INDENT 0x00000004 40#define F_INDENT 0x00000008UL
12#define F_CANONICAL 0x00000008 41#define F_CANONICAL 0x00000010UL
13#define F_SPACE_BEFORE 0x00000010 42#define F_SPACE_BEFORE 0x00000020UL
14#define F_SPACE_AFTER 0x00000020 43#define F_SPACE_AFTER 0x00000040UL
15#define F_JSON_RPC 0x00000040
16#define F_ALLOW_NONREF 0x00000080 44#define F_ALLOW_NONREF 0x00000100UL
45#define F_SHRINK 0x00000200UL
46#define F_ALLOW_BLESSED 0x00000400UL
47#define F_CONV_BLESSED 0x00000800UL
48#define F_RELAXED 0x00001000UL
49#define F_ALLOW_UNKNOWN 0x00002000UL
50#define F_ALLOW_TAGS 0x00004000UL
51#define F_HOOK 0x00080000UL // some hooks exist, so slow-path processing
17 52
18#define F_PRETTY F_INDENT | F_SPACE_BEFORE | F_SPACE_AFTER 53#define F_PRETTY F_INDENT | F_SPACE_BEFORE | F_SPACE_AFTER
19#define F_DEFAULT 0
20 54
21#define INIT_SIZE 32 // initial scalar size to be allocated 55#define INIT_SIZE 32 // initial scalar size to be allocated
56#define INDENT_STEP 3 // spaces per indentation level
57
58#define SHORT_STRING_LEN 16384 // special-case strings of up to this size
59
60#define DECODE_WANTS_OCTETS(json) ((json)->flags & F_UTF8)
22 61
23#define SB do { 62#define SB do {
24#define SE } while (0) 63#define SE } while (0)
25 64
26static HV *json_stash; 65#if __GNUC__ >= 3
66# define expect(expr,value) __builtin_expect ((expr), (value))
67# define INLINE static inline
68#else
69# define expect(expr,value) (expr)
70# define INLINE static
71#endif
72
73#define expect_false(expr) expect ((expr) != 0, 0)
74#define expect_true(expr) expect ((expr) != 0, 1)
75
76#define IN_RANGE_INC(type,val,beg,end) \
77 ((unsigned type)((unsigned type)(val) - (unsigned type)(beg)) \
78 <= (unsigned type)((unsigned type)(end) - (unsigned type)(beg)))
79
80#define ERR_NESTING_EXCEEDED "json text or perl structure exceeds maximum nesting level (max_depth set too low?)"
81
82#ifdef USE_ITHREADS
83# define JSON_SLOW 1
84# define JSON_STASH (json_stash ? json_stash : gv_stashpv ("JSON::XS", 1))
85# define BOOL_STASH (bool_stash ? bool_stash : gv_stashpv ("Types::Serialiser::Boolean", 1))
86#else
87# define JSON_SLOW 0
88# define JSON_STASH json_stash
89# define BOOL_STASH bool_stash
90#endif
91
92// the amount of HEs to allocate on the stack, when sorting keys
93#define STACK_HES 64
94
95static HV *json_stash, *bool_stash; // JSON::XS::, Types::Serialiser::Boolean::
96static SV *bool_true, *bool_false, *sv_json;
97
98enum {
99 INCR_M_WS = 0, // initial whitespace skipping, must be 0
100 INCR_M_STR, // inside string
101 INCR_M_BS, // inside backslash
102 INCR_M_C0, // inside comment in initial whitespace sequence
103 INCR_M_C1, // inside comment in other places
104 INCR_M_JSON // outside anything, count nesting
105};
106
107#define INCR_DONE(json) ((json)->incr_nest <= 0 && (json)->incr_mode == INCR_M_JSON)
108
109typedef struct {
110 U32 flags;
111 U32 max_depth;
112 STRLEN max_size;
113
114 SV *cb_object;
115 HV *cb_sk_object;
116
117 // for the incremental parser
118 SV *incr_text; // the source text so far
119 STRLEN incr_pos; // the current offset into the text
120 int incr_nest; // {[]}-nesting level
121 unsigned char incr_mode;
122} JSON;
123
124INLINE void
125json_init (JSON *json)
126{
127 Zero (json, 1, JSON);
128 json->max_depth = 512;
129}
130
131/////////////////////////////////////////////////////////////////////////////
132// utility functions
133
134INLINE SV *
135get_bool (const char *name)
136{
137 SV *sv = get_sv (name, 1);
138
139 SvREADONLY_on (sv);
140 SvREADONLY_on (SvRV (sv));
141
142 return sv;
143}
144
145INLINE void
146shrink (SV *sv)
147{
148 sv_utf8_downgrade (sv, 1);
149
150 if (SvLEN (sv) > SvCUR (sv) + 1)
151 {
152#ifdef SvPV_shrink_to_cur
153 SvPV_shrink_to_cur (sv);
154#elif defined (SvPV_renew)
155 SvPV_renew (sv, SvCUR (sv) + 1);
156#endif
157 }
158}
159
160/* adds two STRLENs together, slow, and with paranoia */
161STRLEN
162strlen_sum (STRLEN l1, STRLEN l2)
163{
164 size_t sum = l1 + l2;
165
166 if (sum < (size_t)l2 || sum != (size_t)(STRLEN)sum)
167 croak ("JSON::XS: string size overflow");
168
169 return sum;
170}
171
172/* similar to SvGROW, but somewhat safer and guarantees exponential realloc strategy */
173static char *
174json_sv_grow (SV *sv, size_t len1, size_t len2)
175{
176 len1 = strlen_sum (len1, len2);
177 len1 = strlen_sum (len1, len1 >> 1);
178
179 if (len1 > 4096 - 24)
180 len1 = (len1 | 4095) - 24;
181
182 return SvGROW (sv, len1);
183}
184
185// decode a utf-8 character and return it, or (UV)-1 in
186// case of an error.
187// we special-case "safe" characters from U+80 .. U+7FF,
188// but use the very good perl function to parse anything else.
189// note that we never call this function for a ascii codepoints
190INLINE UV
191decode_utf8 (unsigned char *s, STRLEN len, STRLEN *clen)
192{
193 if (expect_true (len >= 2
194 && IN_RANGE_INC (char, s[0], 0xc2, 0xdf)
195 && IN_RANGE_INC (char, s[1], 0x80, 0xbf)))
196 {
197 *clen = 2;
198 return ((s[0] & 0x1f) << 6) | (s[1] & 0x3f);
199 }
200 else
201 return utf8n_to_uvuni (s, len, clen, UTF8_CHECK_ONLY);
202}
203
204// likewise for encoding, also never called for ascii codepoints
205// this function takes advantage of this fact, although current gccs
206// seem to optimise the check for >= 0x80 away anyways
207INLINE unsigned char *
208encode_utf8 (unsigned char *s, UV ch)
209{
210 if (expect_false (ch < 0x000080))
211 *s++ = ch;
212 else if (expect_true (ch < 0x000800))
213 *s++ = 0xc0 | ( ch >> 6),
214 *s++ = 0x80 | ( ch & 0x3f);
215 else if ( ch < 0x010000)
216 *s++ = 0xe0 | ( ch >> 12),
217 *s++ = 0x80 | ((ch >> 6) & 0x3f),
218 *s++ = 0x80 | ( ch & 0x3f);
219 else if ( ch < 0x110000)
220 *s++ = 0xf0 | ( ch >> 18),
221 *s++ = 0x80 | ((ch >> 12) & 0x3f),
222 *s++ = 0x80 | ((ch >> 6) & 0x3f),
223 *s++ = 0x80 | ( ch & 0x3f);
224
225 return s;
226}
227
228// convert offset pointer to character index, sv must be string
229static STRLEN
230ptr_to_index (SV *sv, char *offset)
231{
232 return SvUTF8 (sv)
233 ? utf8_distance (offset, SvPVX (sv))
234 : offset - SvPVX (sv);
235}
236
237/////////////////////////////////////////////////////////////////////////////
238// fp hell
239
240// scan a group of digits, and a trailing exponent
241static void
242json_atof_scan1 (const char *s, NV *accum, int *expo, int postdp, int maxdepth)
243{
244 UV uaccum = 0;
245 int eaccum = 0;
246
247 // if we recurse too deep, skip all remaining digits
248 // to avoid a stack overflow attack
249 if (expect_false (--maxdepth <= 0))
250 while (((U8)*s - '0') < 10)
251 ++s;
252
253 for (;;)
254 {
255 U8 dig = (U8)*s - '0';
256
257 if (expect_false (dig >= 10))
258 {
259 if (dig == (U8)((U8)'.' - (U8)'0'))
260 {
261 ++s;
262 json_atof_scan1 (s, accum, expo, 1, maxdepth);
263 }
264 else if ((dig | ' ') == 'e' - '0')
265 {
266 int exp2 = 0;
267 int neg = 0;
268
269 ++s;
270
271 if (*s == '-')
272 {
273 ++s;
274 neg = 1;
275 }
276 else if (*s == '+')
277 ++s;
278
279 while ((dig = (U8)*s - '0') < 10)
280 exp2 = exp2 * 10 + *s++ - '0';
281
282 *expo += neg ? -exp2 : exp2;
283 }
284
285 break;
286 }
287
288 ++s;
289
290 uaccum = uaccum * 10 + dig;
291 ++eaccum;
292
293 // if we have too many digits, then recurse for more
294 // we actually do this for rather few digits
295 if (uaccum >= (UV_MAX - 9) / 10)
296 {
297 if (postdp) *expo -= eaccum;
298 json_atof_scan1 (s, accum, expo, postdp, maxdepth);
299 if (postdp) *expo += eaccum;
300
301 break;
302 }
303 }
304
305 // this relies greatly on the quality of the pow ()
306 // implementation of the platform, but a good
307 // implementation is hard to beat.
308 // (IEEE 754 conformant ones are required to be exact)
309 if (postdp) *expo -= eaccum;
310 *accum += uaccum * Perl_pow (10., *expo);
311 *expo += eaccum;
312}
313
314static NV
315json_atof (const char *s)
316{
317 NV accum = 0.;
318 int expo = 0;
319 int neg = 0;
320
321 if (*s == '-')
322 {
323 ++s;
324 neg = 1;
325 }
326
327 // a recursion depth of ten gives us >>500 bits
328 json_atof_scan1 (s, &accum, &expo, 0, 10);
329
330 return neg ? -accum : accum;
331}
332
333// target of scalar reference is bool? -1 == nope, 0 == false, 1 == true
334static int
335ref_bool_type (SV *sv)
336{
337 svtype svt = SvTYPE (sv);
338
339 if (svt < SVt_PVAV)
340 {
341 STRLEN len = 0;
342 char *pv = svt ? SvPV (sv, len) : 0;
343
344 if (len == 1)
345 if (*pv == '1')
346 return 1;
347 else if (*pv == '0')
348 return 0;
349 }
350
351 return -1;
352}
353
354// returns whether scalar is not a reference in the sense of allow_nonref
355static int
356json_nonref (SV *scalar)
357{
358 if (!SvROK (scalar))
359 return 1;
360
361 scalar = SvRV (scalar);
362
363 if (SvTYPE (scalar) >= SVt_PVMG)
364 {
365 if (SvSTASH (scalar) == bool_stash)
366 return 1;
367
368 if (!SvOBJECT (scalar) && ref_bool_type (scalar) >= 0)
369 return 1;
370 }
371
372 return 0;
373}
374
375/////////////////////////////////////////////////////////////////////////////
376// encoder
27 377
28// structure used for encoding JSON 378// structure used for encoding JSON
29typedef struct 379typedef struct
30{ 380{
31 char *cur; 381 char *cur; // SvPVX (sv) + current output position
32 STRLEN len; // SvLEN (sv)
33 char *end; // SvEND (sv) 382 char *end; // SvEND (sv)
34 SV *sv; 383 SV *sv; // result scalar
35 UV flags; 384 JSON json;
36 int max_recurse; 385 U32 indent; // indentation level
37 int indent; 386 UV limit; // escape character values >= this value when encoding
38} enc_t; 387} enc_t;
39 388
40// structure used for decoding JSON 389INLINE void
41typedef struct
42{
43 char *cur;
44 char *end;
45 char *err;
46 UV flags;
47} dec_t;
48
49static UV *
50SvJSON (SV *sv)
51{
52 if (!(SvROK (sv) && SvOBJECT (SvRV (sv)) && SvSTASH (SvRV (sv)) == json_stash))
53 croak ("object is not of type JSON::XS");
54
55 return &SvUVX (SvRV (sv));
56}
57
58/////////////////////////////////////////////////////////////////////////////
59
60static void
61need (enc_t *enc, STRLEN len) 390need (enc_t *enc, STRLEN len)
62{ 391{
63 if (enc->cur + len >= enc->end) 392 if (expect_false ((uintptr_t)(enc->end - enc->cur) < len))
64 { 393 {
65 STRLEN cur = enc->cur - SvPVX (enc->sv); 394 STRLEN cur = enc->cur - (char *)SvPVX (enc->sv);
66 SvGROW (enc->sv, cur + len + 1); 395 char *buf = json_sv_grow (enc->sv, cur, len);
67 enc->cur = SvPVX (enc->sv) + cur; 396 enc->cur = buf + cur;
68 enc->end = SvEND (enc->sv); 397 enc->end = buf + SvLEN (enc->sv) - 1;
69 } 398 }
70} 399}
71 400
72static void 401INLINE void
73encode_ch (enc_t *enc, char ch) 402encode_ch (enc_t *enc, char ch)
74{ 403{
75 need (enc, 1); 404 need (enc, 1);
76 *enc->cur++ = ch; 405 *enc->cur++ = ch;
77} 406}
79static void 408static void
80encode_str (enc_t *enc, char *str, STRLEN len, int is_utf8) 409encode_str (enc_t *enc, char *str, STRLEN len, int is_utf8)
81{ 410{
82 char *end = str + len; 411 char *end = str + len;
83 412
413 need (enc, len);
414
84 while (str < end) 415 while (str < end)
85 { 416 {
86 unsigned char ch = *(unsigned char *)str; 417 unsigned char ch = *(unsigned char *)str;
418
87 if (ch >= 0x20 && ch < 0x80) // most common case 419 if (expect_true (ch >= 0x20 && ch < 0x80)) // most common case
88 { 420 {
421 if (expect_false (ch == '"')) // but with slow exceptions
422 {
423 need (enc, len + 1);
424 *enc->cur++ = '\\';
425 *enc->cur++ = '"';
426 }
427 else if (expect_false (ch == '\\'))
428 {
429 need (enc, len + 1);
430 *enc->cur++ = '\\';
431 *enc->cur++ = '\\';
432 }
433 else
89 *enc->cur++ = ch; 434 *enc->cur++ = ch;
435
90 str++; 436 ++str;
91 } 437 }
92 else 438 else
93 { 439 {
94 STRLEN clen; 440 switch (ch)
95 UV uch;
96
97 if (is_utf8)
98 { 441 {
99 uch = utf8n_to_uvuni (str, end - str, &clen, UTF8_CHECK_ONLY); 442 case '\010': need (enc, len + 1); *enc->cur++ = '\\'; *enc->cur++ = 'b'; ++str; break;
100 if (clen < 0) 443 case '\011': need (enc, len + 1); *enc->cur++ = '\\'; *enc->cur++ = 't'; ++str; break;
101 croak ("malformed UTF-8 character in string, cannot convert to JSON"); 444 case '\012': need (enc, len + 1); *enc->cur++ = '\\'; *enc->cur++ = 'n'; ++str; break;
102 } 445 case '\014': need (enc, len + 1); *enc->cur++ = '\\'; *enc->cur++ = 'f'; ++str; break;
103 else 446 case '\015': need (enc, len + 1); *enc->cur++ = '\\'; *enc->cur++ = 'r'; ++str; break;
104 {
105 uch = ch;
106 clen = 1;
107 }
108 447
109 need (enc, len += 6); 448 default:
110
111 if (uch < 0xa0 || enc->flags & F_ASCII)
112 {
113 if (uch > 0xFFFFUL)
114 { 449 {
450 STRLEN clen;
451 UV uch;
452
453 if (is_utf8)
454 {
455 uch = decode_utf8 (str, end - str, &clen);
456 if (clen == (STRLEN)-1)
457 croak ("malformed or illegal unicode character in string [%.11s], cannot convert to JSON", str);
458 }
459 else
460 {
461 uch = ch;
115 len += 6; 462 clen = 1;
463 }
464
465 if (uch < 0x80/*0x20*/ || uch >= enc->limit)
466 {
467 if (uch >= 0x10000UL)
468 {
469 if (uch >= 0x110000UL)
470 croak ("out of range codepoint (0x%lx) encountered, unrepresentable in JSON", (unsigned long)uch);
471
116 need (enc, len += 6); 472 need (enc, len + 11);
117 sprintf (enc->cur, "\\u%04x\\u%04x", 473 sprintf (enc->cur, "\\u%04x\\u%04x",
118 (uch - 0x10000) / 0x400 + 0xD800, 474 (int)((uch - 0x10000) / 0x400 + 0xD800),
119 (uch - 0x10000) % 0x400 + 0xDC00); 475 (int)((uch - 0x10000) % 0x400 + 0xDC00));
120 enc->cur += 12; 476 enc->cur += 12;
477 }
478 else
479 {
480 need (enc, len + 5);
481 *enc->cur++ = '\\';
482 *enc->cur++ = 'u';
483 *enc->cur++ = PL_hexdigit [ uch >> 12 ];
484 *enc->cur++ = PL_hexdigit [(uch >> 8) & 15];
485 *enc->cur++ = PL_hexdigit [(uch >> 4) & 15];
486 *enc->cur++ = PL_hexdigit [(uch >> 0) & 15];
487 }
488
489 str += clen;
121 } 490 }
491 else if (enc->json.flags & F_LATIN1)
492 {
493 *enc->cur++ = uch;
494 str += clen;
495 }
496 else if (is_utf8)
497 {
498 need (enc, len + clen);
499 do
500 {
501 *enc->cur++ = *str++;
502 }
503 while (--clen);
504 }
122 else 505 else
123 { 506 {
124 sprintf (enc->cur, "\\u%04x", uch); 507 need (enc, len + UTF8_MAXBYTES - 1); // never more than 11 bytes needed
125 enc->cur += 6; 508 enc->cur = encode_utf8 (enc->cur, uch);
509 ++str;
510 }
126 } 511 }
127 } 512 }
128 else if (is_utf8)
129 {
130 memcpy (enc->cur, str, clen);
131 enc->cur += clen;
132 }
133 else
134 enc->cur = uvuni_to_utf8_flags (enc->cur, uch, 0);
135
136 str += clen;
137 } 513 }
138 514
139 --len; 515 --len;
140 } 516 }
141} 517}
142 518
143#define INDENT SB \ 519INLINE void
520encode_indent (enc_t *enc)
521{
144 if (enc->flags & F_INDENT) \ 522 if (enc->json.flags & F_INDENT)
145 { \ 523 {
146 int i_; \ 524 int spaces = enc->indent * INDENT_STEP;
147 need (enc, enc->indent); \ 525
148 for (i_ = enc->indent * 3; i_--; )\ 526 need (enc, spaces);
527 memset (enc->cur, ' ', spaces);
528 enc->cur += spaces;
529 }
530}
531
532INLINE void
533encode_space (enc_t *enc)
534{
535 need (enc, 1);
536 encode_ch (enc, ' ');
537}
538
539INLINE void
540encode_nl (enc_t *enc)
541{
542 if (enc->json.flags & F_INDENT)
543 {
544 need (enc, 1);
149 encode_ch (enc, ' '); \ 545 encode_ch (enc, '\n');
150 } \ 546 }
151 SE 547}
152 548
153#define SPACE SB need (enc, 1); encode_ch (enc, ' '); SE 549INLINE void
154#define NL SB if (enc->flags & F_INDENT) { need (enc, 1); encode_ch (enc, '\n'); } SE 550encode_comma (enc_t *enc)
155#define COMMA SB \ 551{
156 encode_ch (enc, ','); \ 552 encode_ch (enc, ',');
553
157 if (enc->flags & F_INDENT) \ 554 if (enc->json.flags & F_INDENT)
158 NL; \ 555 encode_nl (enc);
159 else if (enc->flags & F_SPACE_AFTER) \ 556 else if (enc->json.flags & F_SPACE_AFTER)
160 SPACE; \ 557 encode_space (enc);
161 SE 558}
162 559
163static void encode_sv (enc_t *enc, SV *sv); 560static void encode_sv (enc_t *enc, SV *sv);
164 561
165static void 562static void
166encode_av (enc_t *enc, AV *av) 563encode_av (enc_t *enc, AV *av)
167{ 564{
168 int i, len = av_len (av); 565 int i, len = av_len (av);
169 566
567 if (enc->indent >= enc->json.max_depth)
568 croak (ERR_NESTING_EXCEEDED);
569
170 encode_ch (enc, '['); NL; 570 encode_ch (enc, '[');
171 ++enc->indent;
172 571
572 if (len >= 0)
573 {
574 encode_nl (enc); ++enc->indent;
575
173 for (i = 0; i <= len; ++i) 576 for (i = 0; i <= len; ++i)
174 { 577 {
175 INDENT; 578 SV **svp = av_fetch (av, i, 0);
176 encode_sv (enc, *av_fetch (av, i, 0));
177 579
580 encode_indent (enc);
581
582 if (svp)
583 encode_sv (enc, *svp);
584 else
585 encode_str (enc, "null", 4, 0);
586
178 if (i < len) 587 if (i < len)
179 COMMA; 588 encode_comma (enc);
180 } 589 }
181 590
182 NL; 591 encode_nl (enc); --enc->indent; encode_indent (enc);
592 }
183 593
184 --enc->indent;
185 INDENT; encode_ch (enc, ']'); 594 encode_ch (enc, ']');
186} 595}
187 596
188static void 597static void
189encode_he (enc_t *enc, HE *he) 598encode_hk (enc_t *enc, HE *he)
190{ 599{
191 encode_ch (enc, '"'); 600 encode_ch (enc, '"');
192 601
193 if (HeKLEN (he) == HEf_SVKEY) 602 if (HeKLEN (he) == HEf_SVKEY)
194 { 603 {
195 SV *sv = HeSVKEY (he); 604 SV *sv = HeSVKEY (he);
196 STRLEN len; 605 STRLEN len;
606 char *str;
607
608 SvGETMAGIC (sv);
197 char *str = SvPV (sv, len); 609 str = SvPV (sv, len);
198 610
199 encode_str (enc, str, len, SvUTF8 (sv)); 611 encode_str (enc, str, len, SvUTF8 (sv));
200 } 612 }
201 else 613 else
202 encode_str (enc, HeKEY (he), HeKLEN (he), HeKUTF8 (he)); 614 encode_str (enc, HeKEY (he), HeKLEN (he), HeKUTF8 (he));
203 615
204 encode_ch (enc, '"'); 616 encode_ch (enc, '"');
205 617
206 if (enc->flags & F_SPACE_BEFORE) SPACE; 618 if (enc->json.flags & F_SPACE_BEFORE) encode_space (enc);
207 encode_ch (enc, ':'); 619 encode_ch (enc, ':');
208 if (enc->flags & F_SPACE_AFTER ) SPACE; 620 if (enc->json.flags & F_SPACE_AFTER ) encode_space (enc);
209 encode_sv (enc, HeVAL (he));
210} 621}
211 622
212// compare hash entries, used when all keys are bytestrings 623// compare hash entries, used when all keys are bytestrings
213static int 624static int
214he_cmp_fast (const void *a_, const void *b_) 625he_cmp_fast (const void *a_, const void *b_)
219 HE *b = *(HE **)b_; 630 HE *b = *(HE **)b_;
220 631
221 STRLEN la = HeKLEN (a); 632 STRLEN la = HeKLEN (a);
222 STRLEN lb = HeKLEN (b); 633 STRLEN lb = HeKLEN (b);
223 634
224 if (!(cmp == memcmp (HeKEY (a), HeKEY (b), la < lb ? la : lb))) 635 if (!(cmp = memcmp (HeKEY (b), HeKEY (a), lb < la ? lb : la)))
225 cmp = la < lb ? -1 : la == lb ? 0 : 1; 636 cmp = lb - la;
226 637
227 return cmp; 638 return cmp;
228} 639}
229 640
230// compare hash entries, used when some keys are sv's or utf-x 641// compare hash entries, used when some keys are sv's or utf-x
231static int 642static int
232he_cmp_slow (const void *a, const void *b) 643he_cmp_slow (const void *a, const void *b)
233{ 644{
234 return sv_cmp (HeSVKEY_force (*(HE **)a), HeSVKEY_force (*(HE **)b)); 645 return sv_cmp (HeSVKEY_force (*(HE **)b), HeSVKEY_force (*(HE **)a));
235} 646}
236 647
237static void 648static void
238encode_hv (enc_t *enc, HV *hv) 649encode_hv (enc_t *enc, HV *hv)
239{ 650{
240 int count, i; 651 HE *he;
241 652
242 encode_ch (enc, '{'); NL; ++enc->indent; 653 if (enc->indent >= enc->json.max_depth)
654 croak (ERR_NESTING_EXCEEDED);
243 655
244 if ((count = hv_iterinit (hv))) 656 encode_ch (enc, '{');
245 { 657
246 // for canonical output we have to sort by keys first 658 // for canonical output we have to sort by keys first
247 // actually, this is mostly due to the stupid so-called 659 // actually, this is mostly due to the stupid so-called
248 // security workaround added somewhere in 5.8.x. 660 // security workaround added somewhere in 5.8.x
249 // that randomises hash orderings 661 // that randomises hash orderings
250 if (enc->flags & F_CANONICAL) 662 if (enc->json.flags & F_CANONICAL && !SvRMAGICAL (hv))
663 {
664 int count = hv_iterinit (hv);
665
666 if (SvMAGICAL (hv))
251 { 667 {
252 HE *he, *hes [count]; 668 // need to count by iterating. could improve by dynamically building the vector below
669 // but I don't care for the speed of this special case.
670 // note also that we will run into undefined behaviour when the two iterations
671 // do not result in the same count, something I might care for in some later release.
672
673 count = 0;
674 while (hv_iternext (hv))
675 ++count;
676
677 hv_iterinit (hv);
678 }
679
680 if (count)
681 {
253 int fast = 1; 682 int i, fast = 1;
683 HE *hes_stack [STACK_HES];
684 HE **hes = hes_stack;
685
686 // allocate larger arrays on the heap
687 if (count > STACK_HES)
688 {
689 SV *sv = sv_2mortal (NEWSV (0, count * sizeof (*hes)));
690 hes = (HE **)SvPVX (sv);
691 }
254 692
255 i = 0; 693 i = 0;
256 while ((he = hv_iternext (hv))) 694 while ((he = hv_iternext (hv)))
257 { 695 {
258 hes [i++] = he; 696 hes [i++] = he;
264 702
265 if (fast) 703 if (fast)
266 qsort (hes, count, sizeof (HE *), he_cmp_fast); 704 qsort (hes, count, sizeof (HE *), he_cmp_fast);
267 else 705 else
268 { 706 {
269 // hack to disable "use bytes" 707 // hack to forcefully disable "use bytes"
270 COP *oldcop = PL_curcop, cop; 708 COP cop = *PL_curcop;
271 cop.op_private = 0; 709 cop.op_private = 0;
710
711 ENTER;
712 SAVETMPS;
713
714 SAVEVPTR (PL_curcop);
272 PL_curcop = &cop; 715 PL_curcop = &cop;
273 716
274 SAVETMPS;
275 qsort (hes, count, sizeof (HE *), he_cmp_slow); 717 qsort (hes, count, sizeof (HE *), he_cmp_slow);
718
276 FREETMPS; 719 FREETMPS;
277 720 LEAVE;
278 PL_curcop = oldcop;
279 } 721 }
280 722
281 for (i = 0; i < count; ++i) 723 encode_nl (enc); ++enc->indent;
724
725 while (count--)
282 { 726 {
283 INDENT; 727 encode_indent (enc);
728 he = hes [count];
284 encode_he (enc, hes [i]); 729 encode_hk (enc, he);
730 encode_sv (enc, expect_false (SvMAGICAL (hv)) ? hv_iterval (hv, he) : HeVAL (he));
285 731
286 if (i < count - 1) 732 if (count)
287 COMMA; 733 encode_comma (enc);
288 } 734 }
289 735
290 NL; 736 encode_nl (enc); --enc->indent; encode_indent (enc);
291 } 737 }
738 }
739 else
740 {
741 if (hv_iterinit (hv) || SvMAGICAL (hv))
742 if ((he = hv_iternext (hv)))
743 {
744 encode_nl (enc); ++enc->indent;
745
746 for (;;)
747 {
748 encode_indent (enc);
749 encode_hk (enc, he);
750 encode_sv (enc, expect_false (SvMAGICAL (hv)) ? hv_iterval (hv, he) : HeVAL (he));
751
752 if (!(he = hv_iternext (hv)))
753 break;
754
755 encode_comma (enc);
756 }
757
758 encode_nl (enc); --enc->indent; encode_indent (enc);
759 }
760 }
761
762 encode_ch (enc, '}');
763}
764
765// encode objects, arrays and special \0=false and \1=true values.
766static void
767encode_rv (enc_t *enc, SV *sv)
768{
769 svtype svt;
770 GV *method;
771
772 SvGETMAGIC (sv);
773 svt = SvTYPE (sv);
774
775 if (expect_false (SvOBJECT (sv)))
776 {
777 HV *stash = SvSTASH (sv);
778
779 if (stash == bool_stash)
780 {
781 if (SvIV (sv))
782 encode_str (enc, "true", 4, 0);
783 else
784 encode_str (enc, "false", 5, 0);
785 }
786 else if ((enc->json.flags & F_ALLOW_TAGS) && (method = gv_fetchmethod_autoload (stash, "FREEZE", 0)))
787 {
788 int count;
789 dSP;
790
791 ENTER; SAVETMPS;
792 SAVESTACK_POS ();
793 PUSHMARK (SP);
794 EXTEND (SP, 2);
795 // we re-bless the reference to get overload and other niceties right
796 PUSHs (sv_bless (sv_2mortal (newRV_inc (sv)), stash));
797 PUSHs (sv_json);
798
799 PUTBACK;
800 count = call_sv ((SV *)GvCV (method), G_ARRAY);
801 SPAGAIN;
802
803 // catch this surprisingly common error
804 if (SvROK (TOPs) && SvRV (TOPs) == sv)
805 croak ("%s::FREEZE method returned same object as was passed instead of a new one", HvNAME (SvSTASH (sv)));
806
807 encode_ch (enc, '(');
808 encode_ch (enc, '"');
809 encode_str (enc, HvNAME (stash), HvNAMELEN (stash), HvNAMEUTF8 (stash));
810 encode_ch (enc, '"');
811 encode_ch (enc, ')');
812 encode_ch (enc, '[');
813
814 while (count)
815 {
816 encode_sv (enc, SP[1 - count--]);
817
818 if (count)
819 encode_ch (enc, ',');
820 }
821
822 encode_ch (enc, ']');
823
824 FREETMPS; LEAVE;
825 }
826 else if ((enc->json.flags & F_CONV_BLESSED) && (method = gv_fetchmethod_autoload (stash, "TO_JSON", 0)))
827 {
828 dSP;
829
830 ENTER; SAVETMPS;
831 PUSHMARK (SP);
832 // we re-bless the reference to get overload and other niceties right
833 XPUSHs (sv_bless (sv_2mortal (newRV_inc (sv)), stash));
834
835 // calling with G_SCALAR ensures that we always get a 1 return value
836 PUTBACK;
837 call_sv ((SV *)GvCV (method), G_SCALAR);
838 SPAGAIN;
839
840 // catch this surprisingly common error
841 if (SvROK (TOPs) && SvRV (TOPs) == sv)
842 croak ("%s::TO_JSON method returned same object as was passed instead of a new one", HvNAME (SvSTASH (sv)));
843
844 sv = POPs;
845 PUTBACK;
846
847 encode_sv (enc, sv);
848
849 FREETMPS; LEAVE;
850 }
851 else if (enc->json.flags & F_ALLOW_BLESSED)
852 encode_str (enc, "null", 4, 0);
292 else 853 else
293 { 854 croak ("encountered object '%s', but neither allow_blessed, convert_blessed nor allow_tags settings are enabled (or TO_JSON/FREEZE method missing)",
294 SV *sv; 855 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
295 HE *he = hv_iternext (hv); 856 }
296 857 else if (svt == SVt_PVHV)
297 for (;;) 858 encode_hv (enc, (HV *)sv);
298 { 859 else if (svt == SVt_PVAV)
299 INDENT; 860 encode_av (enc, (AV *)sv);
300 encode_he (enc, he); 861 else if (svt < SVt_PVAV)
301
302 if (!(he = hv_iternext (hv)))
303 break;
304
305 COMMA;
306 }
307
308 NL;
309 }
310 } 862 {
863 int bool_type = ref_bool_type (sv);
311 864
312 --enc->indent; INDENT; encode_ch (enc, '}'); 865 if (bool_type == 1)
866 encode_str (enc, "true", 4, 0);
867 else if (bool_type == 0)
868 encode_str (enc, "false", 5, 0);
869 else if (enc->json.flags & F_ALLOW_UNKNOWN)
870 encode_str (enc, "null", 4, 0);
871 else
872 croak ("cannot encode reference to scalar '%s' unless the scalar is 0 or 1",
873 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
874 }
875 else if (enc->json.flags & F_ALLOW_UNKNOWN)
876 encode_str (enc, "null", 4, 0);
877 else
878 croak ("encountered %s, but JSON can only represent references to arrays or hashes",
879 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
313} 880}
314 881
315static void 882static void
316encode_sv (enc_t *enc, SV *sv) 883encode_sv (enc_t *enc, SV *sv)
317{ 884{
885 SvGETMAGIC (sv);
886
318 if (SvPOKp (sv)) 887 if (SvPOKp (sv))
319 { 888 {
320 STRLEN len; 889 STRLEN len;
321 char *str = SvPV (sv, len); 890 char *str = SvPV (sv, len);
322 encode_ch (enc, '"'); 891 encode_ch (enc, '"');
323 encode_str (enc, str, len, SvUTF8 (sv)); 892 encode_str (enc, str, len, SvUTF8 (sv));
324 encode_ch (enc, '"'); 893 encode_ch (enc, '"');
325 } 894 }
326 else if (SvNOKp (sv)) 895 else if (SvNOKp (sv))
327 { 896 {
897 // trust that perl will do the right thing w.r.t. JSON syntax.
328 need (enc, NV_DIG + 32); 898 need (enc, NV_DIG + 32);
329 Gconvert (SvNVX (sv), NV_DIG, 0, enc->cur); 899 Gconvert (SvNVX (sv), NV_DIG, 0, enc->cur);
330 enc->cur += strlen (enc->cur); 900 enc->cur += strlen (enc->cur);
331 } 901 }
332 else if (SvIOKp (sv)) 902 else if (SvIOKp (sv))
333 { 903 {
904 // we assume we can always read an IV as a UV and vice versa
905 // we assume two's complement
906 // we assume no aliasing issues in the union
907 if (SvIsUV (sv) ? SvUVX (sv) <= 59000
908 : SvIVX (sv) <= 59000 && SvIVX (sv) >= -59000)
909 {
910 // optimise the "small number case"
911 // code will likely be branchless and use only a single multiplication
912 // works for numbers up to 59074
913 I32 i = SvIVX (sv);
914 U32 u;
915 char digit, nz = 0;
916
334 need (enc, 64); 917 need (enc, 6);
918
919 *enc->cur = '-'; enc->cur += i < 0 ? 1 : 0;
920 u = i < 0 ? -i : i;
921
922 // convert to 4.28 fixed-point representation
923 u = u * ((0xfffffff + 10000) / 10000); // 10**5, 5 fractional digits
924
925 // now output digit by digit, each time masking out the integer part
926 // and multiplying by 5 while moving the decimal point one to the right,
927 // resulting in a net multiplication by 10.
928 // we always write the digit to memory but conditionally increment
929 // the pointer, to enable the use of conditional move instructions.
930 digit = u >> 28; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0xfffffffUL) * 5;
931 digit = u >> 27; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x7ffffffUL) * 5;
932 digit = u >> 26; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x3ffffffUL) * 5;
933 digit = u >> 25; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x1ffffffUL) * 5;
934 digit = u >> 24; *enc->cur = digit + '0'; enc->cur += 1; // correctly generate '0'
935 }
936 else
937 {
938 // large integer, use the (rather slow) snprintf way.
939 need (enc, IVUV_MAXCHARS);
335 enc->cur += 940 enc->cur +=
336 SvIsUV(sv) 941 SvIsUV(sv)
337 ? snprintf (enc->cur, 64, "%"UVuf, (UV)SvUVX (sv)) 942 ? snprintf (enc->cur, IVUV_MAXCHARS, "%"UVuf, (UV)SvUVX (sv))
338 : snprintf (enc->cur, 64, "%"IVdf, (IV)SvIVX (sv)); 943 : snprintf (enc->cur, IVUV_MAXCHARS, "%"IVdf, (IV)SvIVX (sv));
944 }
339 } 945 }
340 else if (SvROK (sv)) 946 else if (SvROK (sv))
341 { 947 encode_rv (enc, SvRV (sv));
342 if (!--enc->max_recurse) 948 else if (!SvOK (sv) || enc->json.flags & F_ALLOW_UNKNOWN)
343 croak ("data structure too deep (hit recursion limit)");
344
345 sv = SvRV (sv);
346
347 switch (SvTYPE (sv))
348 {
349 case SVt_PVAV: encode_av (enc, (AV *)sv); break;
350 case SVt_PVHV: encode_hv (enc, (HV *)sv); break;
351
352 default:
353 croak ("JSON can only represent references to arrays or hashes");
354 }
355 }
356 else if (!SvOK (sv))
357 encode_str (enc, "null", 4, 0); 949 encode_str (enc, "null", 4, 0);
358 else 950 else
359 croak ("encountered perl type that JSON cannot handle"); 951 croak ("encountered perl type (%s,0x%x) that JSON cannot handle, check your input data",
952 SvPV_nolen (sv), (unsigned int)SvFLAGS (sv));
360} 953}
361 954
362static SV * 955static SV *
363encode_json (SV *scalar, UV flags) 956encode_json (SV *scalar, JSON *json)
364{ 957{
365 if (!(flags & F_ALLOW_NONREF) && !SvROK (scalar))
366 croak ("hash- or arraref required (not a simple scalar, use allow_nonref to allow this)");
367
368 enc_t enc; 958 enc_t enc;
369 enc.flags = flags; 959
960 if (!(json->flags & F_ALLOW_NONREF) && json_nonref (scalar))
961 croak ("hash- or arrayref expected (not a simple scalar, use allow_nonref to allow this)");
962
963 enc.json = *json;
370 enc.sv = sv_2mortal (NEWSV (0, INIT_SIZE)); 964 enc.sv = sv_2mortal (NEWSV (0, INIT_SIZE));
371 enc.cur = SvPVX (enc.sv); 965 enc.cur = SvPVX (enc.sv);
372 enc.end = SvEND (enc.sv); 966 enc.end = SvEND (enc.sv);
373 enc.max_recurse = 0;
374 enc.indent = 0; 967 enc.indent = 0;
968 enc.limit = enc.json.flags & F_ASCII ? 0x000080UL
969 : enc.json.flags & F_LATIN1 ? 0x000100UL
970 : 0x110000UL;
375 971
376 SvPOK_only (enc.sv); 972 SvPOK_only (enc.sv);
377 encode_sv (&enc, scalar); 973 encode_sv (&enc, scalar);
974 encode_nl (&enc);
378 975
976 SvCUR_set (enc.sv, enc.cur - SvPVX (enc.sv));
977 *SvEND (enc.sv) = 0; // many xs functions expect a trailing 0 for text strings
978
379 if (!(flags & (F_ASCII | F_UTF8))) 979 if (!(enc.json.flags & (F_ASCII | F_LATIN1 | F_UTF8)))
380 SvUTF8_on (enc.sv); 980 SvUTF8_on (enc.sv);
381 981
382 SvCUR_set (enc.sv, enc.cur - SvPVX (enc.sv)); 982 if (enc.json.flags & F_SHRINK)
983 shrink (enc.sv);
984
383 return enc.sv; 985 return enc.sv;
384} 986}
385 987
386///////////////////////////////////////////////////////////////////////////// 988/////////////////////////////////////////////////////////////////////////////
989// decoder
387 990
388#define WS \ 991// structure used for decoding JSON
992typedef struct
993{
994 char *cur; // current parser pointer
995 char *end; // end of input string
996 const char *err; // parse error, if != 0
997 JSON json;
998 U32 depth; // recursion depth
999 U32 maxdepth; // recursion depth limit
1000} dec_t;
1001
1002INLINE void
1003decode_comment (dec_t *dec)
1004{
1005 // only '#'-style comments allowed a.t.m.
1006
1007 while (*dec->cur && *dec->cur != 0x0a && *dec->cur != 0x0d)
1008 ++dec->cur;
1009}
1010
1011INLINE void
1012decode_ws (dec_t *dec)
1013{
389 for (;;) \ 1014 for (;;)
390 { \ 1015 {
391 char ch = *dec->cur; \ 1016 char ch = *dec->cur;
1017
392 if (ch > 0x20 \ 1018 if (ch > 0x20)
1019 {
1020 if (expect_false (ch == '#'))
1021 {
1022 if (dec->json.flags & F_RELAXED)
1023 decode_comment (dec);
1024 else
1025 break;
1026 }
1027 else
1028 break;
1029 }
393 || (ch != 0x20 && ch != 0x0a && ch != 0x0d && ch != 0x09)) \ 1030 else if (ch != 0x20 && ch != 0x0a && ch != 0x0d && ch != 0x09)
394 break; \ 1031 break; // parse error, but let higher level handle it, gives better error messages
1032
395 ++dec->cur; \ 1033 ++dec->cur;
396 } 1034 }
1035}
397 1036
398#define ERR(reason) SB dec->err = reason; goto fail; SE 1037#define ERR(reason) SB dec->err = reason; goto fail; SE
1038
399#define EXPECT_CH(ch) SB \ 1039#define EXPECT_CH(ch) SB \
400 if (*dec->cur != ch) \ 1040 if (*dec->cur != ch) \
401 ERR (# ch " expected"); \ 1041 ERR (# ch " expected"); \
402 ++dec->cur; \ 1042 ++dec->cur; \
403 SE 1043 SE
404 1044
1045#define DEC_INC_DEPTH if (++dec->depth > dec->json.max_depth) ERR (ERR_NESTING_EXCEEDED)
1046#define DEC_DEC_DEPTH --dec->depth
1047
405static SV *decode_sv (dec_t *dec); 1048static SV *decode_sv (dec_t *dec);
406
407#define APPEND_CH(ch) SB \
408 SvGROW (sv, cur + 1 + 1); \
409 SvPVX (sv)[cur++] = (ch); \
410 SE
411 1049
412static signed char decode_hexdigit[256]; 1050static signed char decode_hexdigit[256];
413 1051
414static UV 1052static UV
415decode_4hex (dec_t *dec) 1053decode_4hex (dec_t *dec)
416{ 1054{
417 signed char d1, d2, d3, d4; 1055 signed char d1, d2, d3, d4;
1056 unsigned char *cur = (unsigned char *)dec->cur;
418 1057
419 d1 = decode_hexdigit [((unsigned char *)dec->cur) [0]]; 1058 d1 = decode_hexdigit [cur [0]]; if (expect_false (d1 < 0)) ERR ("exactly four hexadecimal digits expected");
420 if (d1 < 0) ERR ("four hexadecimal digits expected"); 1059 d2 = decode_hexdigit [cur [1]]; if (expect_false (d2 < 0)) ERR ("exactly four hexadecimal digits expected");
421 d2 = decode_hexdigit [((unsigned char *)dec->cur) [1]]; 1060 d3 = decode_hexdigit [cur [2]]; if (expect_false (d3 < 0)) ERR ("exactly four hexadecimal digits expected");
422 if (d2 < 0) ERR ("four hexadecimal digits expected"); 1061 d4 = decode_hexdigit [cur [3]]; if (expect_false (d4 < 0)) ERR ("exactly four hexadecimal digits expected");
423 d3 = decode_hexdigit [((unsigned char *)dec->cur) [2]];
424 if (d3 < 0) ERR ("four hexadecimal digits expected");
425 d4 = decode_hexdigit [((unsigned char *)dec->cur) [3]];
426 if (d4 < 0) ERR ("four hexadecimal digits expected");
427 1062
428 dec->cur += 4; 1063 dec->cur += 4;
429 1064
430 return ((UV)d1) << 12 1065 return ((UV)d1) << 12
431 | ((UV)d2) << 8 1066 | ((UV)d2) << 8
437} 1072}
438 1073
439static SV * 1074static SV *
440decode_str (dec_t *dec) 1075decode_str (dec_t *dec)
441{ 1076{
442 SV *sv = NEWSV (0,2); 1077 SV *sv = 0;
443 STRLEN cur = 0;
444 int utf8 = 0; 1078 int utf8 = 0;
1079 char *dec_cur = dec->cur;
445 1080
446 for (;;) 1081 do
447 { 1082 {
448 unsigned char ch = *(unsigned char *)dec->cur; 1083 char buf [SHORT_STRING_LEN + UTF8_MAXBYTES];
1084 char *cur = buf;
449 1085
450 if (ch == '"') 1086 do
451 break;
452 else if (ch == '\\')
453 { 1087 {
454 switch (*++dec->cur) 1088 unsigned char ch = *(unsigned char *)dec_cur++;
1089
1090 if (expect_false (ch == '"'))
455 { 1091 {
456 case '\\': 1092 --dec_cur;
457 case '/': 1093 break;
458 case '"': APPEND_CH (*dec->cur++); break; 1094 }
459 1095 else if (expect_false (ch == '\\'))
460 case 'b': APPEND_CH ('\010'); ++dec->cur; break; 1096 {
461 case 't': APPEND_CH ('\011'); ++dec->cur; break; 1097 switch (*dec_cur)
462 case 'n': APPEND_CH ('\012'); ++dec->cur; break;
463 case 'f': APPEND_CH ('\014'); ++dec->cur; break;
464 case 'r': APPEND_CH ('\015'); ++dec->cur; break;
465
466 case 'u':
467 { 1098 {
468 UV lo, hi; 1099 case '\\':
469 ++dec->cur; 1100 case '/':
1101 case '"': *cur++ = *dec_cur++; break;
470 1102
471 hi = decode_4hex (dec); 1103 case 'b': ++dec_cur; *cur++ = '\010'; break;
472 if (hi == (UV)-1) 1104 case 't': ++dec_cur; *cur++ = '\011'; break;
473 goto fail; 1105 case 'n': ++dec_cur; *cur++ = '\012'; break;
1106 case 'f': ++dec_cur; *cur++ = '\014'; break;
1107 case 'r': ++dec_cur; *cur++ = '\015'; break;
474 1108
475 // possibly a surrogate pair 1109 case 'u':
476 if (hi >= 0xd800 && hi < 0xdc00)
477 { 1110 {
478 if (dec->cur [0] != '\\' || dec->cur [1] != 'u') 1111 UV lo, hi;
479 ERR ("illegal surrogate character"); 1112 ++dec_cur;
480 1113
481 dec->cur += 2; 1114 dec->cur = dec_cur;
482
483 lo = decode_4hex (dec); 1115 hi = decode_4hex (dec);
1116 dec_cur = dec->cur;
484 if (lo == (UV)-1) 1117 if (hi == (UV)-1)
485 goto fail; 1118 goto fail;
486 1119
1120 // possibly a surrogate pair
1121 if (hi >= 0xd800)
1122 if (hi < 0xdc00)
1123 {
1124 if (dec_cur [0] != '\\' || dec_cur [1] != 'u')
1125 ERR ("missing low surrogate character in surrogate pair");
1126
1127 dec_cur += 2;
1128
1129 dec->cur = dec_cur;
1130 lo = decode_4hex (dec);
1131 dec_cur = dec->cur;
1132 if (lo == (UV)-1)
1133 goto fail;
1134
487 if (lo < 0xdc00 || lo >= 0xe000) 1135 if (lo < 0xdc00 || lo >= 0xe000)
488 ERR ("surrogate pair expected"); 1136 ERR ("surrogate pair expected");
489 1137
490 hi = (hi - 0xD800) * 0x400 + (lo - 0xDC00) + 0x10000; 1138 hi = (hi - 0xD800) * 0x400 + (lo - 0xDC00) + 0x10000;
1139 }
1140 else if (hi < 0xe000)
1141 ERR ("missing high surrogate character in surrogate pair");
1142
1143 if (hi >= 0x80)
1144 {
1145 utf8 = 1;
1146
1147 cur = encode_utf8 (cur, hi);
1148 }
1149 else
1150 *cur++ = hi;
491 } 1151 }
492 else if (lo >= 0xdc00 && lo < 0xe000)
493 ERR ("illegal surrogate character");
494
495 if (hi >= 0x80)
496 { 1152 break;
497 utf8 = 1;
498 1153
499 SvGROW (sv, cur + 4 + 1); // at most 4 bytes for 21 bits
500 cur = (char *)uvuni_to_utf8_flags (SvPVX (sv) + cur, hi, 0) - SvPVX (sv);
501 }
502 else 1154 default:
503 APPEND_CH (hi); 1155 --dec_cur;
1156 ERR ("illegal backslash escape sequence in string");
504 } 1157 }
1158 }
1159 else if (expect_true (ch >= 0x20 && ch < 0x80))
1160 *cur++ = ch;
1161 else if (ch >= 0x80)
1162 {
1163 STRLEN clen;
1164
1165 --dec_cur;
1166
1167 decode_utf8 (dec_cur, dec->end - dec_cur, &clen);
1168 if (clen == (STRLEN)-1)
1169 ERR ("malformed UTF-8 character in JSON string");
1170
1171 do
1172 *cur++ = *dec_cur++;
1173 while (--clen);
1174
1175 utf8 = 1;
1176 }
1177 else if (ch == '\t' && dec->json.flags & F_RELAXED)
1178 *cur++ = ch;
1179 else
1180 {
1181 --dec_cur;
1182
1183 if (!ch)
1184 ERR ("unexpected end of string while parsing JSON string");
505 break; 1185 else
1186 ERR ("invalid character encountered while parsing JSON string");
506 } 1187 }
507 } 1188 }
508 else if (ch >= 0x20 && ch <= 0x7f) 1189 while (cur < buf + SHORT_STRING_LEN);
509 APPEND_CH (*dec->cur++); 1190
510 else if (ch >= 0x80) 1191 {
1192 STRLEN len = cur - buf;
1193
1194 if (sv)
511 { 1195 {
512 STRLEN clen; 1196 STRLEN cur = SvCUR (sv);
513 UV uch = utf8n_to_uvuni (dec->cur, dec->end - dec->cur, &clen, UTF8_CHECK_ONLY);
514 if (clen < 0)
515 ERR ("malformed UTF-8 character in string, cannot convert to JSON");
516 1197
517 SvGROW (sv, cur + clen + 1); // at most 4 bytes for 21 bits 1198 if (SvLEN (sv) - cur <= len)
518 memcpy (SvPVX (sv) + cur, dec->cur, clen); 1199 json_sv_grow (sv, cur, len);
519 dec->cur += clen; 1200
1201 memcpy (SvPVX (sv) + SvCUR (sv), buf, len);
1202 SvCUR_set (sv, SvCUR (sv) + len);
520 } 1203 }
521 else 1204 else
522 ERR ("invalid character encountered"); 1205 sv = newSVpvn (buf, len);
523 } 1206 }
1207 }
1208 while (*dec_cur != '"');
524 1209
525 ++dec->cur; 1210 ++dec_cur;
526 1211
1212 if (sv)
1213 {
527 SvPOK_only (sv); 1214 SvPOK_only (sv);
528
529 SvCUR_set (sv, cur);
530 *SvEND (sv) = 0; 1215 *SvEND (sv) = 0;
531 1216
532 if (utf8) 1217 if (utf8)
533 SvUTF8_on (sv); 1218 SvUTF8_on (sv);
1219 }
1220 else
1221 sv = newSVpvn ("", 0);
534 1222
1223 dec->cur = dec_cur;
535 return sv; 1224 return sv;
536 1225
537fail: 1226fail:
538 SvREFCNT_dec (sv); 1227 dec->cur = dec_cur;
539 return 0; 1228 return 0;
540} 1229}
541 1230
542static SV * 1231static SV *
543decode_num (dec_t *dec) 1232decode_num (dec_t *dec)
553 { 1242 {
554 ++dec->cur; 1243 ++dec->cur;
555 if (*dec->cur >= '0' && *dec->cur <= '9') 1244 if (*dec->cur >= '0' && *dec->cur <= '9')
556 ERR ("malformed number (leading zero must not be followed by another digit)"); 1245 ERR ("malformed number (leading zero must not be followed by another digit)");
557 } 1246 }
558 1247 else if (*dec->cur < '0' || *dec->cur > '9')
559 // int 1248 ERR ("malformed number (no digits after initial minus)");
1249 else
1250 do
1251 {
1252 ++dec->cur;
1253 }
560 while (*dec->cur >= '0' && *dec->cur <= '9') 1254 while (*dec->cur >= '0' && *dec->cur <= '9');
561 ++dec->cur;
562 1255
563 // [frac] 1256 // [frac]
564 if (*dec->cur == '.') 1257 if (*dec->cur == '.')
565 { 1258 {
566 is_nv = 1; 1259 ++dec->cur;
1260
1261 if (*dec->cur < '0' || *dec->cur > '9')
1262 ERR ("malformed number (no digits after decimal point)");
567 1263
568 do 1264 do
569 { 1265 {
570 ++dec->cur; 1266 ++dec->cur;
571 } 1267 }
572 while (*dec->cur >= '0' && *dec->cur <= '9'); 1268 while (*dec->cur >= '0' && *dec->cur <= '9');
1269
1270 is_nv = 1;
573 } 1271 }
574 1272
575 // [exp] 1273 // [exp]
576 if (*dec->cur == 'e' || *dec->cur == 'E') 1274 if (*dec->cur == 'e' || *dec->cur == 'E')
577 { 1275 {
578 is_nv = 1;
579
580 ++dec->cur; 1276 ++dec->cur;
1277
581 if (*dec->cur == '-' || *dec->cur == '+') 1278 if (*dec->cur == '-' || *dec->cur == '+')
582 ++dec->cur; 1279 ++dec->cur;
583 1280
1281 if (*dec->cur < '0' || *dec->cur > '9')
1282 ERR ("malformed number (no digits after exp sign)");
1283
1284 do
1285 {
1286 ++dec->cur;
1287 }
584 while (*dec->cur >= '0' && *dec->cur <= '9') 1288 while (*dec->cur >= '0' && *dec->cur <= '9');
585 ++dec->cur; 1289
1290 is_nv = 1;
586 } 1291 }
587 1292
588 if (!is_nv) 1293 if (!is_nv)
589 { 1294 {
590 UV uv; 1295 int len = dec->cur - start;
591 int numtype = grok_number (start, dec->cur - start, &uv); 1296
592 if (numtype & IS_NUMBER_IN_UV) 1297 // special case the rather common 1..5-digit-int case
593 if (numtype & IS_NUMBER_NEG) 1298 if (*start == '-')
1299 switch (len)
594 { 1300 {
595 if (uv < (UV)IV_MIN) 1301 case 2: return newSViv (-(IV)( start [1] - '0' * 1));
596 return newSViv (-(IV)uv); 1302 case 3: return newSViv (-(IV)( start [1] * 10 + start [2] - '0' * 11));
1303 case 4: return newSViv (-(IV)( start [1] * 100 + start [2] * 10 + start [3] - '0' * 111));
1304 case 5: return newSViv (-(IV)( start [1] * 1000 + start [2] * 100 + start [3] * 10 + start [4] - '0' * 1111));
1305 case 6: return newSViv (-(IV)(start [1] * 10000 + start [2] * 1000 + start [3] * 100 + start [4] * 10 + start [5] - '0' * 11111));
597 } 1306 }
1307 else
1308 switch (len)
1309 {
1310 case 1: return newSViv ( start [0] - '0' * 1);
1311 case 2: return newSViv ( start [0] * 10 + start [1] - '0' * 11);
1312 case 3: return newSViv ( start [0] * 100 + start [1] * 10 + start [2] - '0' * 111);
1313 case 4: return newSViv ( start [0] * 1000 + start [1] * 100 + start [2] * 10 + start [3] - '0' * 1111);
1314 case 5: return newSViv ( start [0] * 10000 + start [1] * 1000 + start [2] * 100 + start [3] * 10 + start [4] - '0' * 11111);
1315 }
1316
1317 {
1318 UV uv;
1319 int numtype = grok_number (start, len, &uv);
1320 if (numtype & IS_NUMBER_IN_UV)
1321 if (numtype & IS_NUMBER_NEG)
1322 {
1323 if (uv < (UV)IV_MIN)
1324 return newSViv (-(IV)uv);
1325 }
598 else 1326 else
599 return newSVuv (uv); 1327 return newSVuv (uv);
600 } 1328 }
601 1329
1330 len -= *start == '-' ? 1 : 0;
1331
1332 // does not fit into IV or UV, try NV
1333 if (len <= NV_DIG)
1334 // fits into NV without loss of precision
1335 return newSVnv (json_atof (start));
1336
1337 // everything else fails, convert it to a string
1338 return newSVpvn (start, dec->cur - start);
1339 }
1340
1341 // loss of precision here
602 return newSVnv (Atof (start)); 1342 return newSVnv (json_atof (start));
603 1343
604fail: 1344fail:
605 return 0; 1345 return 0;
606} 1346}
607 1347
608static SV * 1348static SV *
609decode_av (dec_t *dec) 1349decode_av (dec_t *dec)
610{ 1350{
611 AV *av = newAV (); 1351 AV *av = newAV ();
612 1352
1353 DEC_INC_DEPTH;
1354 decode_ws (dec);
1355
1356 if (*dec->cur == ']')
1357 ++dec->cur;
1358 else
613 for (;;) 1359 for (;;)
614 { 1360 {
615 SV *value; 1361 SV *value;
616 1362
617 value = decode_sv (dec); 1363 value = decode_sv (dec);
618 if (!value) 1364 if (!value)
619 goto fail; 1365 goto fail;
620 1366
621 av_push (av, value); 1367 av_push (av, value);
622 1368
623 WS; 1369 decode_ws (dec);
624 1370
625 if (*dec->cur == ']') 1371 if (*dec->cur == ']')
626 { 1372 {
627 ++dec->cur; 1373 ++dec->cur;
628 break; 1374 break;
629 } 1375 }
630 1376
631 if (*dec->cur != ',') 1377 if (*dec->cur != ',')
632 ERR (", or ] expected while parsing array"); 1378 ERR (", or ] expected while parsing array");
633 1379
634 ++dec->cur; 1380 ++dec->cur;
1381
1382 decode_ws (dec);
1383
1384 if (*dec->cur == ']' && dec->json.flags & F_RELAXED)
1385 {
1386 ++dec->cur;
1387 break;
1388 }
635 } 1389 }
636 1390
1391 DEC_DEC_DEPTH;
637 return newRV_noinc ((SV *)av); 1392 return newRV_noinc ((SV *)av);
638 1393
639fail: 1394fail:
640 SvREFCNT_dec (av); 1395 SvREFCNT_dec (av);
1396 DEC_DEC_DEPTH;
641 return 0; 1397 return 0;
642} 1398}
643 1399
644static SV * 1400static SV *
645decode_hv (dec_t *dec) 1401decode_hv (dec_t *dec)
646{ 1402{
1403 SV *sv;
647 HV *hv = newHV (); 1404 HV *hv = newHV ();
648 1405
1406 DEC_INC_DEPTH;
1407 decode_ws (dec);
1408
1409 if (*dec->cur == '}')
1410 ++dec->cur;
1411 else
649 for (;;) 1412 for (;;)
650 { 1413 {
651 SV *key, *value;
652
653 WS; EXPECT_CH ('"'); 1414 EXPECT_CH ('"');
654 1415
655 key = decode_str (dec); 1416 // heuristic: assume that
656 if (!key) 1417 // a) decode_str + hv_store_ent are abysmally slow.
657 goto fail; 1418 // b) most hash keys are short, simple ascii text.
658 1419 // => try to "fast-match" such strings to avoid
659 WS; EXPECT_CH (':'); 1420 // the overhead of decode_str + hv_store_ent.
660
661 value = decode_sv (dec);
662 if (!value)
663 { 1421 {
1422 SV *value;
1423 char *p = dec->cur;
1424 char *e = p + 24; // only try up to 24 bytes
1425
1426 for (;;)
1427 {
1428 // the >= 0x80 is false on most architectures
1429 if (p == e || *p < 0x20 || *p >= 0x80 || *p == '\\')
1430 {
1431 // slow path, back up and use decode_str
1432 SV *key = decode_str (dec);
1433 if (!key)
1434 goto fail;
1435
1436 decode_ws (dec); EXPECT_CH (':');
1437
1438 decode_ws (dec);
1439 value = decode_sv (dec);
1440 if (!value)
1441 {
1442 SvREFCNT_dec (key);
1443 goto fail;
1444 }
1445
1446 hv_store_ent (hv, key, value, 0);
664 SvREFCNT_dec (key); 1447 SvREFCNT_dec (key);
1448
1449 break;
1450 }
1451 else if (*p == '"')
1452 {
1453 // fast path, got a simple key
1454 char *key = dec->cur;
1455 int len = p - key;
1456 dec->cur = p + 1;
1457
1458 decode_ws (dec); EXPECT_CH (':');
1459
1460 decode_ws (dec);
1461 value = decode_sv (dec);
1462 if (!value)
665 goto fail; 1463 goto fail;
1464
1465 hv_store (hv, key, len, value, 0);
1466
1467 break;
1468 }
1469
1470 ++p;
1471 }
666 } 1472 }
667 1473
668 //TODO: optimise 1474 decode_ws (dec);
669 hv_store_ent (hv, key, value, 0);
670 1475
671 WS;
672
673 if (*dec->cur == '}') 1476 if (*dec->cur == '}')
1477 {
1478 ++dec->cur;
1479 break;
1480 }
1481
1482 if (*dec->cur != ',')
1483 ERR (", or } expected while parsing object/hash");
1484
1485 ++dec->cur;
1486
1487 decode_ws (dec);
1488
1489 if (*dec->cur == '}' && dec->json.flags & F_RELAXED)
1490 {
1491 ++dec->cur;
1492 break;
1493 }
1494 }
1495
1496 DEC_DEC_DEPTH;
1497 sv = newRV_noinc ((SV *)hv);
1498
1499 // check filter callbacks
1500 if (dec->json.flags & F_HOOK)
1501 {
1502 if (dec->json.cb_sk_object && HvKEYS (hv) == 1)
674 { 1503 {
675 ++dec->cur; 1504 HE *cb, *he;
676 break; 1505
1506 hv_iterinit (hv);
1507 he = hv_iternext (hv);
1508 hv_iterinit (hv);
1509
1510 // the next line creates a mortal sv each time it's called.
1511 // might want to optimise this for common cases.
1512 cb = hv_fetch_ent (dec->json.cb_sk_object, hv_iterkeysv (he), 0, 0);
1513
1514 if (cb)
1515 {
1516 dSP;
1517 int count;
1518
1519 ENTER; SAVETMPS;
1520 SAVESTACK_POS ();
1521 PUSHMARK (SP);
1522 XPUSHs (HeVAL (he));
1523 sv_2mortal (sv);
1524
1525 PUTBACK; count = call_sv (HeVAL (cb), G_ARRAY); SPAGAIN;
1526
1527 if (count == 1)
1528 {
1529 sv = newSVsv (POPs);
1530 FREETMPS; LEAVE;
1531 return sv;
1532 }
1533
1534 SvREFCNT_inc (sv);
1535 FREETMPS; LEAVE;
1536 }
677 } 1537 }
678 1538
679 if (*dec->cur != ',') 1539 if (dec->json.cb_object)
680 ERR (", or } expected while parsing object/hash"); 1540 {
1541 dSP;
1542 int count;
681 1543
682 ++dec->cur; 1544 ENTER; SAVETMPS;
683 } 1545 SAVESTACK_POS ();
1546 PUSHMARK (SP);
1547 XPUSHs (sv_2mortal (sv));
684 1548
685 return newRV_noinc ((SV *)hv); 1549 PUTBACK; count = call_sv (dec->json.cb_object, G_ARRAY); SPAGAIN;
1550
1551 if (count == 1)
1552 {
1553 sv = newSVsv (POPs);
1554 FREETMPS; LEAVE;
1555 return sv;
1556 }
1557
1558 SvREFCNT_inc (sv);
1559 FREETMPS; LEAVE;
1560 }
1561 }
1562
1563 return sv;
686 1564
687fail: 1565fail:
688 SvREFCNT_dec (hv); 1566 SvREFCNT_dec (hv);
1567 DEC_DEC_DEPTH;
1568 return 0;
1569}
1570
1571static SV *
1572decode_tag (dec_t *dec)
1573{
1574 SV *tag = 0;
1575 SV *val = 0;
1576
1577 if (!(dec->json.flags & F_ALLOW_TAGS))
1578 ERR ("malformed JSON string, neither array, object, number, string or atom");
1579
1580 ++dec->cur;
1581
1582 decode_ws (dec);
1583
1584 tag = decode_sv (dec);
1585 if (!tag)
1586 goto fail;
1587
1588 if (!SvPOK (tag))
1589 ERR ("malformed JSON string, (tag) must be a string");
1590
1591 decode_ws (dec);
1592
1593 if (*dec->cur != ')')
1594 ERR (") expected after tag");
1595
1596 ++dec->cur;
1597
1598 decode_ws (dec);
1599
1600 val = decode_sv (dec);
1601 if (!val)
1602 goto fail;
1603
1604 if (!SvROK (val) || SvTYPE (SvRV (val)) != SVt_PVAV)
1605 ERR ("malformed JSON string, tag value must be an array");
1606
1607 {
1608 AV *av = (AV *)SvRV (val);
1609 int i, len = av_len (av) + 1;
1610 HV *stash = gv_stashsv (tag, 0);
1611 SV *sv;
1612
1613 if (!stash)
1614 ERR ("cannot decode perl-object (package does not exist)");
1615
1616 GV *method = gv_fetchmethod_autoload (stash, "THAW", 0);
1617
1618 if (!method)
1619 ERR ("cannot decode perl-object (package does not have a THAW method)");
1620
1621 dSP;
1622
1623 ENTER; SAVETMPS;
1624 PUSHMARK (SP);
1625 EXTEND (SP, len + 2);
1626 // we re-bless the reference to get overload and other niceties right
1627 PUSHs (tag);
1628 PUSHs (sv_json);
1629
1630 for (i = 0; i < len; ++i)
1631 PUSHs (*av_fetch (av, i, 1));
1632
1633 PUTBACK;
1634 call_sv ((SV *)GvCV (method), G_SCALAR);
1635 SPAGAIN;
1636
1637 SvREFCNT_dec (tag);
1638 SvREFCNT_dec (val);
1639 sv = SvREFCNT_inc (POPs);
1640
1641 PUTBACK;
1642
1643 FREETMPS; LEAVE;
1644
1645 return sv;
1646 }
1647
1648fail:
1649 SvREFCNT_dec (tag);
1650 SvREFCNT_dec (val);
689 return 0; 1651 return 0;
690} 1652}
691 1653
692static SV * 1654static SV *
693decode_sv (dec_t *dec) 1655decode_sv (dec_t *dec)
694{ 1656{
695 WS; 1657 // the beauty of JSON: you need exactly one character lookahead
1658 // to parse everything.
696 switch (*dec->cur) 1659 switch (*dec->cur)
697 { 1660 {
698 case '"': ++dec->cur; return decode_str (dec); 1661 case '"': ++dec->cur; return decode_str (dec);
699 case '[': ++dec->cur; return decode_av (dec); 1662 case '[': ++dec->cur; return decode_av (dec);
700 case '{': ++dec->cur; return decode_hv (dec); 1663 case '{': ++dec->cur; return decode_hv (dec);
1664 case '(': return decode_tag (dec);
701 1665
702 case '-': 1666 case '-':
703 case '0': case '1': case '2': case '3': case '4': 1667 case '0': case '1': case '2': case '3': case '4':
704 case '5': case '6': case '7': case '8': case '9': 1668 case '5': case '6': case '7': case '8': case '9':
705 return decode_num (dec); 1669 return decode_num (dec);
706 1670
707 case 't': 1671 case 't':
708 if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "true", 4)) 1672 if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "true", 4))
709 { 1673 {
710 dec->cur += 4; 1674 dec->cur += 4;
1675#if JSON_SLOW
1676 bool_true = get_bool ("Types::Serialiser::true");
1677#endif
711 return newSViv (1); 1678 return newSVsv (bool_true);
712 } 1679 }
713 else 1680 else
714 ERR ("'true' expected"); 1681 ERR ("'true' expected");
715 1682
716 break; 1683 break;
717 1684
718 case 'f': 1685 case 'f':
719 if (dec->end - dec->cur >= 5 && !memcmp (dec->cur, "false", 5)) 1686 if (dec->end - dec->cur >= 5 && !memcmp (dec->cur, "false", 5))
720 { 1687 {
721 dec->cur += 5; 1688 dec->cur += 5;
1689#if JSON_SLOW
1690 bool_false = get_bool ("Types::Serialiser::false");
1691#endif
722 return newSViv (0); 1692 return newSVsv (bool_false);
723 } 1693 }
724 else 1694 else
725 ERR ("'false' expected"); 1695 ERR ("'false' expected");
726 1696
727 break; 1697 break;
728 1698
729 case 'n': 1699 case 'n':
730 if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "null", 4)) 1700 if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "null", 4))
731 { 1701 {
732 dec->cur += 4; 1702 dec->cur += 4;
733 return newSViv (1); 1703 return newSVsv (&PL_sv_undef);
734 } 1704 }
735 else 1705 else
736 ERR ("'null' expected"); 1706 ERR ("'null' expected");
737 1707
738 break; 1708 break;
739 1709
740 default: 1710 default:
741 ERR ("malformed json string"); 1711 ERR ("malformed JSON string, neither tag, array, object, number, string or atom");
742 break; 1712 break;
743 } 1713 }
744 1714
745fail: 1715fail:
746 return 0; 1716 return 0;
747} 1717}
748 1718
749static SV * 1719static SV *
750decode_json (SV *string, UV flags) 1720decode_json (SV *string, JSON *json, STRLEN *offset_return)
751{ 1721{
1722 dec_t dec;
752 SV *sv; 1723 SV *sv;
753 1724
754 if (!(flags & F_UTF8)) 1725 /* work around bugs in 5.10 where manipulating magic values
1726 * makes perl ignore the magic in subsequent accesses.
1727 * also make a copy of non-PV values, to get them into a clean
1728 * state (SvPV should do that, but it's buggy, see below).
1729 *
1730 * SvIsCOW_shared_hash works around a bug in perl (possibly 5.16),
1731 * as reported by Reini Urban.
1732 */
1733 /*SvGETMAGIC (string);*/
1734 if (SvMAGICAL (string) || !SvPOK (string) || SvIsCOW_shared_hash (string))
1735 string = sv_2mortal (newSVsv (string));
1736
1737 SvUPGRADE (string, SVt_PV);
1738
1739 /* work around a bug in perl 5.10, which causes SvCUR to fail an
1740 * assertion with -DDEBUGGING, although SvCUR is documented to
1741 * return the xpv_cur field which certainly exists after upgrading.
1742 * according to nicholas clark, calling SvPOK fixes this.
1743 * But it doesn't fix it, so try another workaround, call SvPV_nolen
1744 * and hope for the best.
1745 * Damnit, SvPV_nolen still trips over yet another assertion. This
1746 * assertion business is seriously broken, try yet another workaround
1747 * for the broken -DDEBUGGING.
1748 */
1749 {
1750#ifdef DEBUGGING
1751 STRLEN offset = SvOK (string) ? sv_len (string) : 0;
1752#else
1753 STRLEN offset = SvCUR (string);
1754#endif
1755
1756 if (offset > json->max_size && json->max_size)
1757 croak ("attempted decode of JSON text of %lu bytes size, but max_size is set to %lu",
1758 (unsigned long)SvCUR (string), (unsigned long)json->max_size);
1759 }
1760
1761 if (DECODE_WANTS_OCTETS (json))
1762 sv_utf8_downgrade (string, 0);
1763 else
755 sv_utf8_upgrade (string); 1764 sv_utf8_upgrade (string);
756 1765
757 SvGROW (string, SvCUR (string) + 1); // should basically be a NOP 1766 SvGROW (string, SvCUR (string) + 1); // should basically be a NOP
758 1767
759 dec_t dec; 1768 dec.json = *json;
760 dec.flags = flags;
761 dec.cur = SvPVX (string); 1769 dec.cur = SvPVX (string);
762 dec.end = SvEND (string); 1770 dec.end = SvEND (string);
763 dec.err = 0; 1771 dec.err = 0;
1772 dec.depth = 0;
764 1773
765 *dec.end = 1; // invalid anywhere 1774 if (dec.json.cb_object || dec.json.cb_sk_object)
1775 dec.json.flags |= F_HOOK;
1776
1777 *dec.end = 0; // this should basically be a nop, too, but make sure it's there
1778
1779 decode_ws (&dec);
766 sv = decode_sv (&dec); 1780 sv = decode_sv (&dec);
767 *dec.end = 0; 1781
1782 if (offset_return)
1783 *offset_return = dec.cur - SvPVX (string);
1784 else if (sv)
1785 {
1786 // check for trailing garbage
1787 decode_ws (&dec);
1788
1789 if (*dec.cur)
1790 {
1791 dec.err = "garbage after JSON object";
1792 SvREFCNT_dec (sv);
1793 sv = 0;
1794 }
1795 }
768 1796
769 if (!sv) 1797 if (!sv)
770 { 1798 {
771 IV offset = utf8_distance (dec.cur, SvPVX (string));
772 SV *uni = sv_newmortal (); 1799 SV *uni = sv_newmortal ();
773 1800
1801 // horrible hack to silence warning inside pv_uni_display
1802 COP cop = *PL_curcop;
1803 cop.cop_warnings = pWARN_NONE;
1804 ENTER;
1805 SAVEVPTR (PL_curcop);
1806 PL_curcop = &cop;
774 pv_uni_display (uni, dec.cur, dec.end - dec.cur, 20, UNI_DISPLAY_QQ); 1807 pv_uni_display (uni, dec.cur, dec.end - dec.cur, 20, UNI_DISPLAY_QQ);
1808 LEAVE;
1809
775 croak ("%s, at character %d (%s)", 1810 croak ("%s, at character offset %d (before \"%s\")",
776 dec.err, 1811 dec.err,
777 (int)offset, 1812 (int)ptr_to_index (string, dec.cur),
778 dec.cur != dec.end ? SvPV_nolen (uni) : "(end of string)"); 1813 dec.cur != dec.end ? SvPV_nolen (uni) : "(end of string)");
779 } 1814 }
780 1815
781 sv = sv_2mortal (sv); 1816 sv = sv_2mortal (sv);
782 1817
783 if (!(dec.flags & F_ALLOW_NONREF) && !SvROK (sv)) 1818 if (!(dec.json.flags & F_ALLOW_NONREF) && json_nonref (sv))
784 croak ("JSON object or array expected (but number, string, true, false or null found, use allow_nonref to allow this)"); 1819 croak ("JSON text must be an object or array (but found number, string, true, false or null, use allow_nonref to allow this)");
785 1820
786 return sv; 1821 return sv;
787} 1822}
788 1823
1824/////////////////////////////////////////////////////////////////////////////
1825// incremental parser
1826
1827static void
1828incr_parse (JSON *self)
1829{
1830 const char *p = SvPVX (self->incr_text) + self->incr_pos;
1831
1832 // the state machine here is a bit convoluted and could be simplified a lot
1833 // but this would make it slower, so...
1834
1835 for (;;)
1836 {
1837 //printf ("loop pod %d *p<%c><%s>, mode %d nest %d\n", p - SvPVX (self->incr_text), *p, p, self->incr_mode, self->incr_nest);//D
1838 switch (self->incr_mode)
1839 {
1840 // only used for initial whitespace skipping
1841 case INCR_M_WS:
1842 for (;;)
1843 {
1844 if (*p > 0x20)
1845 {
1846 if (*p == '#')
1847 {
1848 self->incr_mode = INCR_M_C0;
1849 goto incr_m_c;
1850 }
1851 else
1852 {
1853 self->incr_mode = INCR_M_JSON;
1854 goto incr_m_json;
1855 }
1856 }
1857 else if (!*p)
1858 goto interrupt;
1859
1860 ++p;
1861 }
1862
1863 // skip a single char inside a string (for \\-processing)
1864 case INCR_M_BS:
1865 if (!*p)
1866 goto interrupt;
1867
1868 ++p;
1869 self->incr_mode = INCR_M_STR;
1870 goto incr_m_str;
1871
1872 // inside #-style comments
1873 case INCR_M_C0:
1874 case INCR_M_C1:
1875 incr_m_c:
1876 for (;;)
1877 {
1878 if (*p == '\n')
1879 {
1880 self->incr_mode = self->incr_mode == INCR_M_C0 ? INCR_M_WS : INCR_M_JSON;
1881 break;
1882 }
1883 else if (!*p)
1884 goto interrupt;
1885
1886 ++p;
1887 }
1888
1889 break;
1890
1891 // inside a string
1892 case INCR_M_STR:
1893 incr_m_str:
1894 for (;;)
1895 {
1896 if (*p == '"')
1897 {
1898 ++p;
1899 self->incr_mode = INCR_M_JSON;
1900
1901 if (!self->incr_nest)
1902 goto interrupt;
1903
1904 goto incr_m_json;
1905 }
1906 else if (*p == '\\')
1907 {
1908 ++p; // "virtually" consumes character after \
1909
1910 if (!*p) // if at end of string we have to switch modes
1911 {
1912 self->incr_mode = INCR_M_BS;
1913 goto interrupt;
1914 }
1915 }
1916 else if (!*p)
1917 goto interrupt;
1918
1919 ++p;
1920 }
1921
1922 // after initial ws, outside string
1923 case INCR_M_JSON:
1924 incr_m_json:
1925 for (;;)
1926 {
1927 switch (*p++)
1928 {
1929 case 0:
1930 --p;
1931 goto interrupt;
1932
1933 case 0x09:
1934 case 0x0a:
1935 case 0x0d:
1936 case 0x20:
1937 if (!self->incr_nest)
1938 {
1939 --p; // do not eat the whitespace, let the next round do it
1940 goto interrupt;
1941 }
1942 break;
1943
1944 case '"':
1945 self->incr_mode = INCR_M_STR;
1946 goto incr_m_str;
1947
1948 case '[':
1949 case '{':
1950 case '(':
1951 if (++self->incr_nest > self->max_depth)
1952 croak (ERR_NESTING_EXCEEDED);
1953 break;
1954
1955 case ']':
1956 case '}':
1957 if (--self->incr_nest <= 0)
1958 goto interrupt;
1959 break;
1960
1961 case ')':
1962 --self->incr_nest;
1963 break;
1964
1965 case '#':
1966 self->incr_mode = INCR_M_C1;
1967 goto incr_m_c;
1968 }
1969 }
1970 }
1971
1972 modechange:
1973 ;
1974 }
1975
1976interrupt:
1977 self->incr_pos = p - SvPVX (self->incr_text);
1978 //printf ("interrupt<%.*s>\n", self->incr_pos, SvPVX(self->incr_text));//D
1979 //printf ("return pos %d mode %d nest %d\n", self->incr_pos, self->incr_mode, self->incr_nest);//D
1980}
1981
1982/////////////////////////////////////////////////////////////////////////////
1983// XS interface functions
1984
789MODULE = JSON::XS PACKAGE = JSON::XS 1985MODULE = JSON::XS PACKAGE = JSON::XS
790 1986
791BOOT: 1987BOOT:
792{ 1988{
793 int i; 1989 int i;
794 1990
795 memset (decode_hexdigit, 0xff, 256);
796 for (i = 10; i--; ) 1991 for (i = 0; i < 256; ++i)
797 decode_hexdigit ['0' + i] = i; 1992 decode_hexdigit [i] =
1993 i >= '0' && i <= '9' ? i - '0'
1994 : i >= 'a' && i <= 'f' ? i - 'a' + 10
1995 : i >= 'A' && i <= 'F' ? i - 'A' + 10
1996 : -1;
798 1997
799 for (i = 6; --i; )
800 {
801 decode_hexdigit ['a' + i] = 10 + i;
802 decode_hexdigit ['A' + i] = 10 + i;
803 }
804
805 json_stash = gv_stashpv ("JSON::XS", 1); 1998 json_stash = gv_stashpv ("JSON::XS" , 1);
806} 1999 bool_stash = gv_stashpv ("Types::Serialiser::Boolean", 1);
2000 bool_true = get_bool ("Types::Serialiser::true");
2001 bool_false = get_bool ("Types::Serialiser::false");
807 2002
808SV *new (char *dummy) 2003 sv_json = newSVpv ("JSON", 0);
2004 SvREADONLY_on (sv_json);
2005
2006 CvNODEBUG_on (get_cv ("JSON::XS::incr_text", 0)); /* the debugger completely breaks lvalue subs */
2007}
2008
2009PROTOTYPES: DISABLE
2010
2011void CLONE (...)
809 CODE: 2012 CODE:
810 RETVAL = sv_bless (newRV_noinc (newSVuv (F_DEFAULT)), json_stash); 2013 json_stash = 0;
2014 bool_stash = 0;
2015
2016void new (char *klass)
2017 PPCODE:
2018{
2019 SV *pv = NEWSV (0, sizeof (JSON));
2020 SvPOK_only (pv);
2021 json_init ((JSON *)SvPVX (pv));
2022 XPUSHs (sv_2mortal (sv_bless (
2023 newRV_noinc (pv),
2024 strEQ (klass, "JSON::XS") ? JSON_STASH : gv_stashpv (klass, 1)
2025 )));
2026}
2027
2028void ascii (JSON *self, int enable = 1)
2029 ALIAS:
2030 ascii = F_ASCII
2031 latin1 = F_LATIN1
2032 utf8 = F_UTF8
2033 indent = F_INDENT
2034 canonical = F_CANONICAL
2035 space_before = F_SPACE_BEFORE
2036 space_after = F_SPACE_AFTER
2037 pretty = F_PRETTY
2038 allow_nonref = F_ALLOW_NONREF
2039 shrink = F_SHRINK
2040 allow_blessed = F_ALLOW_BLESSED
2041 convert_blessed = F_CONV_BLESSED
2042 relaxed = F_RELAXED
2043 allow_unknown = F_ALLOW_UNKNOWN
2044 allow_tags = F_ALLOW_TAGS
2045 PPCODE:
2046{
2047 if (enable)
2048 self->flags |= ix;
2049 else
2050 self->flags &= ~ix;
2051
2052 XPUSHs (ST (0));
2053}
2054
2055void get_ascii (JSON *self)
2056 ALIAS:
2057 get_ascii = F_ASCII
2058 get_latin1 = F_LATIN1
2059 get_utf8 = F_UTF8
2060 get_indent = F_INDENT
2061 get_canonical = F_CANONICAL
2062 get_space_before = F_SPACE_BEFORE
2063 get_space_after = F_SPACE_AFTER
2064 get_allow_nonref = F_ALLOW_NONREF
2065 get_shrink = F_SHRINK
2066 get_allow_blessed = F_ALLOW_BLESSED
2067 get_convert_blessed = F_CONV_BLESSED
2068 get_relaxed = F_RELAXED
2069 get_allow_unknown = F_ALLOW_UNKNOWN
2070 get_allow_tags = F_ALLOW_TAGS
2071 PPCODE:
2072 XPUSHs (boolSV (self->flags & ix));
2073
2074void max_depth (JSON *self, U32 max_depth = 0x80000000UL)
2075 PPCODE:
2076 self->max_depth = max_depth;
2077 XPUSHs (ST (0));
2078
2079U32 get_max_depth (JSON *self)
2080 CODE:
2081 RETVAL = self->max_depth;
811 OUTPUT: 2082 OUTPUT:
812 RETVAL 2083 RETVAL
813 2084
814SV *ascii (SV *self, int enable) 2085void max_size (JSON *self, U32 max_size = 0)
815 ALIAS: 2086 PPCODE:
816 ascii = F_ASCII 2087 self->max_size = max_size;
817 utf8 = F_UTF8 2088 XPUSHs (ST (0));
818 indent = F_INDENT 2089
819 canonical = F_CANONICAL 2090int get_max_size (JSON *self)
820 space_before = F_SPACE_BEFORE
821 space_after = F_SPACE_AFTER
822 json_rpc = F_JSON_RPC
823 pretty = F_PRETTY
824 allow_nonref = F_ALLOW_NONREF
825 CODE: 2091 CODE:
826{ 2092 RETVAL = self->max_size;
827 UV *uv = SvJSON (self);
828 if (enable)
829 *uv |= ix;
830 else
831 *uv &= ~ix;
832
833 RETVAL = newSVsv (self);
834}
835 OUTPUT: 2093 OUTPUT:
836 RETVAL 2094 RETVAL
837 2095
838void encode (SV *self, SV *scalar) 2096void filter_json_object (JSON *self, SV *cb = &PL_sv_undef)
839 PPCODE: 2097 PPCODE:
840 XPUSHs (encode_json (scalar, *SvJSON (self))); 2098{
2099 SvREFCNT_dec (self->cb_object);
2100 self->cb_object = SvOK (cb) ? newSVsv (cb) : 0;
841 2101
842void decode (SV *self, SV *jsonstr) 2102 XPUSHs (ST (0));
2103}
2104
2105void filter_json_single_key_object (JSON *self, SV *key, SV *cb = &PL_sv_undef)
843 PPCODE: 2106 PPCODE:
844 XPUSHs (decode_json (jsonstr, *SvJSON (self))); 2107{
2108 if (!self->cb_sk_object)
2109 self->cb_sk_object = newHV ();
845 2110
846void to_json (SV *scalar) 2111 if (SvOK (cb))
2112 hv_store_ent (self->cb_sk_object, key, newSVsv (cb), 0);
2113 else
2114 {
2115 hv_delete_ent (self->cb_sk_object, key, G_DISCARD, 0);
2116
2117 if (!HvKEYS (self->cb_sk_object))
2118 {
2119 SvREFCNT_dec (self->cb_sk_object);
2120 self->cb_sk_object = 0;
2121 }
2122 }
2123
2124 XPUSHs (ST (0));
2125}
2126
2127void encode (JSON *self, SV *scalar)
847 PPCODE: 2128 PPCODE:
848 XPUSHs (encode_json (scalar, F_UTF8)); 2129 PUTBACK; scalar = encode_json (scalar, self); SPAGAIN;
2130 XPUSHs (scalar);
849 2131
850void from_json (SV *jsonstr) 2132void decode (JSON *self, SV *jsonstr)
851 PPCODE: 2133 PPCODE:
852 XPUSHs (decode_json (jsonstr, F_UTF8)); 2134 PUTBACK; jsonstr = decode_json (jsonstr, self, 0); SPAGAIN;
2135 XPUSHs (jsonstr);
853 2136
2137void decode_prefix (JSON *self, SV *jsonstr)
2138 PPCODE:
2139{
2140 SV *sv;
2141 STRLEN offset;
2142 PUTBACK; sv = decode_json (jsonstr, self, &offset); SPAGAIN;
2143 EXTEND (SP, 2);
2144 PUSHs (sv);
2145 PUSHs (sv_2mortal (newSVuv (ptr_to_index (jsonstr, SvPV_nolen (jsonstr) + offset))));
2146}
2147
2148void incr_parse (JSON *self, SV *jsonstr = 0)
2149 PPCODE:
2150{
2151 if (!self->incr_text)
2152 self->incr_text = newSVpvn ("", 0);
2153
2154 /* if utf8-ness doesn't match the decoder, need to upgrade/downgrade */
2155 if (!DECODE_WANTS_OCTETS (self) == !SvUTF8 (self->incr_text))
2156 if (DECODE_WANTS_OCTETS (self))
2157 {
2158 if (self->incr_pos)
2159 self->incr_pos = utf8_length ((U8 *)SvPVX (self->incr_text),
2160 (U8 *)SvPVX (self->incr_text) + self->incr_pos);
2161
2162 sv_utf8_downgrade (self->incr_text, 0);
2163 }
2164 else
2165 {
2166 sv_utf8_upgrade (self->incr_text);
2167
2168 if (self->incr_pos)
2169 self->incr_pos = utf8_hop ((U8 *)SvPVX (self->incr_text), self->incr_pos)
2170 - (U8 *)SvPVX (self->incr_text);
2171 }
2172
2173 // append data, if any
2174 if (jsonstr)
2175 {
2176 /* make sure both strings have same encoding */
2177 if (SvUTF8 (jsonstr) != SvUTF8 (self->incr_text))
2178 if (SvUTF8 (jsonstr))
2179 sv_utf8_downgrade (jsonstr, 0);
2180 else
2181 sv_utf8_upgrade (jsonstr);
2182
2183 /* and then just blindly append */
2184 {
2185 STRLEN len;
2186 const char *str = SvPV (jsonstr, len);
2187 STRLEN cur = SvCUR (self->incr_text);
2188
2189 if (SvLEN (self->incr_text) - cur <= len)
2190 json_sv_grow (self->incr_text, cur, len);
2191
2192 Move (str, SvEND (self->incr_text), len, char);
2193 SvCUR_set (self->incr_text, SvCUR (self->incr_text) + len);
2194 *SvEND (self->incr_text) = 0; // this should basically be a nop, too, but make sure it's there
2195 }
2196 }
2197
2198 if (GIMME_V != G_VOID)
2199 do
2200 {
2201 SV *sv;
2202 STRLEN offset;
2203
2204 if (!INCR_DONE (self))
2205 {
2206 incr_parse (self);
2207
2208 if (self->incr_pos > self->max_size && self->max_size)
2209 croak ("attempted decode of JSON text of %lu bytes size, but max_size is set to %lu",
2210 (unsigned long)self->incr_pos, (unsigned long)self->max_size);
2211
2212 if (!INCR_DONE (self))
2213 {
2214 // as an optimisation, do not accumulate white space in the incr buffer
2215 if (self->incr_mode == INCR_M_WS && self->incr_pos)
2216 {
2217 self->incr_pos = 0;
2218 SvCUR_set (self->incr_text, 0);
2219 }
2220
2221 break;
2222 }
2223 }
2224
2225 PUTBACK; sv = decode_json (self->incr_text, self, &offset); SPAGAIN;
2226 XPUSHs (sv);
2227
2228 self->incr_pos -= offset;
2229 self->incr_nest = 0;
2230 self->incr_mode = 0;
2231
2232 sv_chop (self->incr_text, SvPVX (self->incr_text) + offset);
2233 }
2234 while (GIMME_V == G_ARRAY);
2235}
2236
2237SV *incr_text (JSON *self)
2238 ATTRS: lvalue
2239 CODE:
2240{
2241 if (self->incr_pos)
2242 croak ("incr_text can not be called when the incremental parser already started parsing");
2243
2244 RETVAL = self->incr_text ? SvREFCNT_inc (self->incr_text) : &PL_sv_undef;
2245}
2246 OUTPUT:
2247 RETVAL
2248
2249void incr_skip (JSON *self)
2250 CODE:
2251{
2252 if (self->incr_pos)
2253 {
2254 sv_chop (self->incr_text, SvPV_nolen (self->incr_text) + self->incr_pos);
2255 self->incr_pos = 0;
2256 self->incr_nest = 0;
2257 self->incr_mode = 0;
2258 }
2259}
2260
2261void incr_reset (JSON *self)
2262 CODE:
2263{
2264 SvREFCNT_dec (self->incr_text);
2265 self->incr_text = 0;
2266 self->incr_pos = 0;
2267 self->incr_nest = 0;
2268 self->incr_mode = 0;
2269}
2270
2271void DESTROY (JSON *self)
2272 CODE:
2273 SvREFCNT_dec (self->cb_sk_object);
2274 SvREFCNT_dec (self->cb_object);
2275 SvREFCNT_dec (self->incr_text);
2276
2277PROTOTYPES: ENABLE
2278
2279void encode_json (SV *scalar)
2280 PPCODE:
2281{
2282 JSON json;
2283 json_init (&json);
2284 json.flags |= F_UTF8;
2285 PUTBACK; scalar = encode_json (scalar, &json); SPAGAIN;
2286 XPUSHs (scalar);
2287}
2288
2289void decode_json (SV *jsonstr)
2290 PPCODE:
2291{
2292 JSON json;
2293 json_init (&json);
2294 json.flags |= F_UTF8;
2295 PUTBACK; jsonstr = decode_json (jsonstr, &json, 0); SPAGAIN;
2296 XPUSHs (jsonstr);
2297}
2298

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines