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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines