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.9 by root, Fri Mar 23 17:40:29 2007 UTC vs.
Revision 1.22 by root, Sat Mar 31 14:20:06 2007 UTC

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 8
9#define F_ASCII 0x00000001 9#define F_ASCII 0x00000001UL
10#define F_UTF8 0x00000002 10#define F_UTF8 0x00000002UL
11#define F_INDENT 0x00000004 11#define F_INDENT 0x00000004UL
12#define F_CANONICAL 0x00000008 12#define F_CANONICAL 0x00000008UL
13#define F_SPACE_BEFORE 0x00000010 13#define F_SPACE_BEFORE 0x00000010UL
14#define F_SPACE_AFTER 0x00000020 14#define F_SPACE_AFTER 0x00000020UL
15#define F_JSON_RPC 0x00000040
16#define F_ALLOW_NONREF 0x00000080 15#define F_ALLOW_NONREF 0x00000080UL
17#define F_SHRINK 0x00000100 16#define F_SHRINK 0x00000100UL
17#define F_MAXDEPTH 0xf8000000UL
18#define S_MAXDEPTH 27
19
20#define DEC_DEPTH(flags) (1UL << ((flags & F_MAXDEPTH) >> S_MAXDEPTH))
21
22// F_SELFCONVERT? <=> to_json/toJson
23// F_BLESSED? <=> { $__class__$ => }
18 24
19#define F_PRETTY F_INDENT | F_SPACE_BEFORE | F_SPACE_AFTER 25#define F_PRETTY F_INDENT | F_SPACE_BEFORE | F_SPACE_AFTER
20#define F_DEFAULT 0 26#define F_DEFAULT (12UL << S_MAXDEPTH)
21 27
22#define INIT_SIZE 32 // initial scalar size to be allocated 28#define INIT_SIZE 32 // initial scalar size to be allocated
29#define INDENT_STEP 3 // spaces per indentation level
30
31#define UTF8_MAX_LEN 11 // for perls UTF-X: max. number of octets per character
32#define SHORT_STRING_LEN 512 // special-case strings of up to this size
23 33
24#define SB do { 34#define SB do {
25#define SE } while (0) 35#define SE } while (0)
26 36
27static HV *json_stash; 37static HV *json_stash; // JSON::XS::
38
39/////////////////////////////////////////////////////////////////////////////
40// utility functions
41
42static UV *
43SvJSON (SV *sv)
44{
45 if (!(SvROK (sv) && SvOBJECT (SvRV (sv)) && SvSTASH (SvRV (sv)) == json_stash))
46 croak ("object is not of type JSON::XS");
47
48 return &SvUVX (SvRV (sv));
49}
50
51static void
52shrink (SV *sv)
53{
54 sv_utf8_downgrade (sv, 1);
55 if (SvLEN (sv) > SvCUR (sv) + 1)
56 {
57#ifdef SvPV_shrink_to_cur
58 SvPV_shrink_to_cur (sv);
59#elif defined (SvPV_renew)
60 SvPV_renew (sv, SvCUR (sv) + 1);
61#endif
62 }
63}
64
65// decode an utf-8 character and return it, or (UV)-1 in
66// case of an error.
67// we special-case "safe" characters from U+80 .. U+7FF,
68// but use the very good perl function to parse anything else.
69// note that we never call this function for a ascii codepoints
70static UV
71decode_utf8 (unsigned char *s, STRLEN len, STRLEN *clen)
72{
73 if (s[0] > 0xdf || s[0] < 0xc2)
74 return utf8n_to_uvuni (s, len, clen, UTF8_CHECK_ONLY);
75 else if (len > 1 && s[1] >= 0x80 && s[1] <= 0xbf)
76 {
77 *clen = 2;
78 return ((s[0] & 0x1f) << 6) | (s[1] & 0x3f);
79 }
80 else
81 return (UV)-1;
82}
83
84/////////////////////////////////////////////////////////////////////////////
85// encoder
28 86
29// structure used for encoding JSON 87// structure used for encoding JSON
30typedef struct 88typedef struct
31{ 89{
32 char *cur; 90 char *cur; // SvPVX (sv) + current output position
33 STRLEN len; // SvLEN (sv)
34 char *end; // SvEND (sv) 91 char *end; // SvEND (sv)
35 SV *sv; 92 SV *sv; // result scalar
36 UV flags; 93 U32 flags; // F_*
37 int max_recurse; 94 U32 indent; // indentation level
38 int indent; 95 U32 maxdepth; // max. indentation/recursion level
39} enc_t; 96} enc_t;
40
41// structure used for decoding JSON
42typedef struct
43{
44 char *cur;
45 char *end;
46 const char *err;
47 UV flags;
48} dec_t;
49
50static UV *
51SvJSON (SV *sv)
52{
53 if (!(SvROK (sv) && SvOBJECT (SvRV (sv)) && SvSTASH (SvRV (sv)) == json_stash))
54 croak ("object is not of type JSON::XS");
55
56 return &SvUVX (SvRV (sv));
57}
58
59static void
60shrink (SV *sv)
61{
62 sv_utf8_downgrade (sv, 1);
63#ifdef SvPV_shrink_to_cur
64 SvPV_shrink_to_cur (sv);
65#endif
66}
67
68/////////////////////////////////////////////////////////////////////////////
69 97
70static void 98static void
71need (enc_t *enc, STRLEN len) 99need (enc_t *enc, STRLEN len)
72{ 100{
73 if (enc->cur + len >= enc->end) 101 if (enc->cur + len >= enc->end)
131 STRLEN clen; 159 STRLEN clen;
132 UV uch; 160 UV uch;
133 161
134 if (is_utf8) 162 if (is_utf8)
135 { 163 {
136 uch = utf8n_to_uvuni (str, end - str, &clen, UTF8_CHECK_ONLY); 164 //uch = utf8n_to_uvuni (str, end - str, &clen, UTF8_CHECK_ONLY);
165 uch = decode_utf8 (str, end - str, &clen);
137 if (clen == (STRLEN)-1) 166 if (clen == (STRLEN)-1)
138 croak ("malformed or illegal unicode character in string [%.11s], cannot convert to JSON", str); 167 croak ("malformed or illegal unicode character in string [%.11s], cannot convert to JSON", str);
139 } 168 }
140 else 169 else
141 { 170 {
150 { 179 {
151 if (uch > 0xFFFFUL) 180 if (uch > 0xFFFFUL)
152 { 181 {
153 need (enc, len += 11); 182 need (enc, len += 11);
154 sprintf (enc->cur, "\\u%04x\\u%04x", 183 sprintf (enc->cur, "\\u%04x\\u%04x",
155 (uch - 0x10000) / 0x400 + 0xD800, 184 (int)((uch - 0x10000) / 0x400 + 0xD800),
156 (uch - 0x10000) % 0x400 + 0xDC00); 185 (int)((uch - 0x10000) % 0x400 + 0xDC00));
157 enc->cur += 12; 186 enc->cur += 12;
158 } 187 }
159 else 188 else
160 { 189 {
161 static char hexdigit [16] = "0123456789abcdef"; 190 static char hexdigit [16] = "0123456789abcdef";
179 } 208 }
180 while (--clen); 209 while (--clen);
181 } 210 }
182 else 211 else
183 { 212 {
184 need (enc, len += 10); // never more than 11 bytes needed 213 need (enc, len += UTF8_MAX_LEN - 1); // never more than 11 bytes needed
185 enc->cur = uvuni_to_utf8_flags (enc->cur, uch, 0); 214 enc->cur = uvuni_to_utf8_flags (enc->cur, uch, 0);
186 ++str; 215 ++str;
187 } 216 }
188 } 217 }
189 } 218 }
191 220
192 --len; 221 --len;
193 } 222 }
194} 223}
195 224
196#define INDENT SB \ 225static void
226encode_indent (enc_t *enc)
227{
197 if (enc->flags & F_INDENT) \ 228 if (enc->flags & F_INDENT)
198 { \ 229 {
199 int i_; \ 230 int spaces = enc->indent * INDENT_STEP;
200 need (enc, enc->indent); \
201 for (i_ = enc->indent * 3; i_--; )\
202 encode_ch (enc, ' '); \
203 } \
204 SE
205 231
206#define SPACE SB need (enc, 1); encode_ch (enc, ' '); SE 232 need (enc, spaces);
207#define NL SB if (enc->flags & F_INDENT) { need (enc, 1); encode_ch (enc, '\n'); } SE 233 memset (enc->cur, ' ', spaces);
208#define COMMA SB \ 234 enc->cur += spaces;
235 }
236}
237
238static void
239encode_space (enc_t *enc)
240{
241 need (enc, 1);
209 encode_ch (enc, ','); \ 242 encode_ch (enc, ' ');
243}
244
245static void
246encode_nl (enc_t *enc)
247{
210 if (enc->flags & F_INDENT) \ 248 if (enc->flags & F_INDENT)
211 NL; \ 249 {
250 need (enc, 1);
251 encode_ch (enc, '\n');
252 }
253}
254
255static void
256encode_comma (enc_t *enc)
257{
258 encode_ch (enc, ',');
259
260 if (enc->flags & F_INDENT)
261 encode_nl (enc);
212 else if (enc->flags & F_SPACE_AFTER) \ 262 else if (enc->flags & F_SPACE_AFTER)
213 SPACE; \ 263 encode_space (enc);
214 SE 264}
215 265
216static void encode_sv (enc_t *enc, SV *sv); 266static void encode_sv (enc_t *enc, SV *sv);
217 267
218static void 268static void
219encode_av (enc_t *enc, AV *av) 269encode_av (enc_t *enc, AV *av)
220{ 270{
221 int i, len = av_len (av); 271 int i, len = av_len (av);
222 272
223 encode_ch (enc, '['); NL; 273 if (enc->indent >= enc->maxdepth)
274 croak ("data structure too deep (hit recursion limit)");
275
276 encode_ch (enc, '['); encode_nl (enc);
224 ++enc->indent; 277 ++enc->indent;
225 278
226 for (i = 0; i <= len; ++i) 279 for (i = 0; i <= len; ++i)
227 { 280 {
228 INDENT; 281 encode_indent (enc);
229 encode_sv (enc, *av_fetch (av, i, 0)); 282 encode_sv (enc, *av_fetch (av, i, 0));
230 283
231 if (i < len) 284 if (i < len)
232 COMMA; 285 encode_comma (enc);
233 } 286 }
234 287
235 NL; 288 encode_nl (enc);
236 289
237 --enc->indent; 290 --enc->indent;
238 INDENT; encode_ch (enc, ']'); 291 encode_indent (enc); encode_ch (enc, ']');
239} 292}
240 293
241static void 294static void
242encode_he (enc_t *enc, HE *he) 295encode_he (enc_t *enc, HE *he)
243{ 296{
257 else 310 else
258 encode_str (enc, HeKEY (he), HeKLEN (he), HeKUTF8 (he)); 311 encode_str (enc, HeKEY (he), HeKLEN (he), HeKUTF8 (he));
259 312
260 encode_ch (enc, '"'); 313 encode_ch (enc, '"');
261 314
262 if (enc->flags & F_SPACE_BEFORE) SPACE; 315 if (enc->flags & F_SPACE_BEFORE) encode_space (enc);
263 encode_ch (enc, ':'); 316 encode_ch (enc, ':');
264 if (enc->flags & F_SPACE_AFTER ) SPACE; 317 if (enc->flags & F_SPACE_AFTER ) encode_space (enc);
265 encode_sv (enc, HeVAL (he)); 318 encode_sv (enc, HeVAL (he));
266} 319}
267 320
268// compare hash entries, used when all keys are bytestrings 321// compare hash entries, used when all keys are bytestrings
269static int 322static int
275 HE *b = *(HE **)b_; 328 HE *b = *(HE **)b_;
276 329
277 STRLEN la = HeKLEN (a); 330 STRLEN la = HeKLEN (a);
278 STRLEN lb = HeKLEN (b); 331 STRLEN lb = HeKLEN (b);
279 332
280 if (!(cmp == memcmp (HeKEY (a), HeKEY (b), la < lb ? la : lb))) 333 if (!(cmp = memcmp (HeKEY (a), HeKEY (b), la < lb ? la : lb)))
281 cmp = la < lb ? -1 : la == lb ? 0 : 1; 334 cmp = la - lb;
282 335
283 return cmp; 336 return cmp;
284} 337}
285 338
286// compare hash entries, used when some keys are sv's or utf-x 339// compare hash entries, used when some keys are sv's or utf-x
293static void 346static void
294encode_hv (enc_t *enc, HV *hv) 347encode_hv (enc_t *enc, HV *hv)
295{ 348{
296 int count, i; 349 int count, i;
297 350
351 if (enc->indent >= enc->maxdepth)
352 croak ("data structure too deep (hit recursion limit)");
353
298 encode_ch (enc, '{'); NL; ++enc->indent; 354 encode_ch (enc, '{'); encode_nl (enc); ++enc->indent;
299 355
300 if ((count = hv_iterinit (hv))) 356 if ((count = hv_iterinit (hv)))
301 { 357 {
302 // for canonical output we have to sort by keys first 358 // for canonical output we have to sort by keys first
303 // actually, this is mostly due to the stupid so-called 359 // actually, this is mostly due to the stupid so-called
304 // security workaround added somewhere in 5.8.x. 360 // security workaround added somewhere in 5.8.x.
305 // that randomises hash orderings 361 // that randomises hash orderings
306 if (enc->flags & F_CANONICAL) 362 if (enc->flags & F_CANONICAL)
307 { 363 {
308 HE *he, *hes [count]; 364 HE *he, *hes [count]; // if your compiler dies here, you need to enable C99 mode
309 int fast = 1; 365 int fast = 1;
310 366
311 i = 0; 367 i = 0;
312 while ((he = hv_iternext (hv))) 368 while ((he = hv_iternext (hv)))
313 { 369 {
338 LEAVE; 394 LEAVE;
339 } 395 }
340 396
341 for (i = 0; i < count; ++i) 397 for (i = 0; i < count; ++i)
342 { 398 {
343 INDENT; 399 encode_indent (enc);
344 encode_he (enc, hes [i]); 400 encode_he (enc, hes [i]);
345 401
346 if (i < count - 1) 402 if (i < count - 1)
347 COMMA; 403 encode_comma (enc);
348 } 404 }
349 405
350 NL; 406 encode_nl (enc);
351 } 407 }
352 else 408 else
353 { 409 {
354 SV *sv; 410 SV *sv;
355 HE *he = hv_iternext (hv); 411 HE *he = hv_iternext (hv);
356 412
357 for (;;) 413 for (;;)
358 { 414 {
359 INDENT; 415 encode_indent (enc);
360 encode_he (enc, he); 416 encode_he (enc, he);
361 417
362 if (!(he = hv_iternext (hv))) 418 if (!(he = hv_iternext (hv)))
363 break; 419 break;
364 420
365 COMMA; 421 encode_comma (enc);
366 } 422 }
367 423
368 NL; 424 encode_nl (enc);
369 } 425 }
370 } 426 }
371 427
372 --enc->indent; INDENT; encode_ch (enc, '}'); 428 --enc->indent; encode_indent (enc); encode_ch (enc, '}');
429}
430
431// encode objects, arrays and special \0=false and \1=true values.
432static void
433encode_rv (enc_t *enc, SV *sv)
434{
435 SvGETMAGIC (sv);
436
437 svtype svt = SvTYPE (sv);
438
439 if (svt == SVt_PVHV)
440 encode_hv (enc, (HV *)sv);
441 else if (svt == SVt_PVAV)
442 encode_av (enc, (AV *)sv);
443 else if (svt < SVt_PVAV)
444 {
445 if (SvNIOK (sv) && SvIV (sv) == 0)
446 encode_str (enc, "false", 5, 0);
447 else if (SvNIOK (sv) && SvIV (sv) == 1)
448 encode_str (enc, "true", 4, 0);
449 else
450 croak ("cannot encode reference to scalar '%s' unless the scalar is 0 or 1",
451 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
452 }
453 else
454 croak ("encountered %s, but JSON can only represent references to arrays or hashes",
455 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
373} 456}
374 457
375static void 458static void
376encode_sv (enc_t *enc, SV *sv) 459encode_sv (enc_t *enc, SV *sv)
377{ 460{
398 SvIsUV(sv) 481 SvIsUV(sv)
399 ? snprintf (enc->cur, 64, "%"UVuf, (UV)SvUVX (sv)) 482 ? snprintf (enc->cur, 64, "%"UVuf, (UV)SvUVX (sv))
400 : snprintf (enc->cur, 64, "%"IVdf, (IV)SvIVX (sv)); 483 : snprintf (enc->cur, 64, "%"IVdf, (IV)SvIVX (sv));
401 } 484 }
402 else if (SvROK (sv)) 485 else if (SvROK (sv))
403 { 486 encode_rv (enc, SvRV (sv));
404 SV *rv = SvRV (sv);
405
406 if (!--enc->max_recurse)
407 croak ("data structure too deep (hit recursion limit)");
408
409 switch (SvTYPE (rv))
410 {
411 case SVt_PVAV: encode_av (enc, (AV *)rv); break;
412 case SVt_PVHV: encode_hv (enc, (HV *)rv); break;
413
414 default:
415 croak ("encountered %s, but JSON can only represent references to arrays or hashes",
416 SvPV_nolen (sv));
417 }
418 }
419 else if (!SvOK (sv)) 487 else if (!SvOK (sv))
420 encode_str (enc, "null", 4, 0); 488 encode_str (enc, "null", 4, 0);
421 else 489 else
422 croak ("encountered perl type (%s,0x%x) that JSON cannot handle, you might want to report this", 490 croak ("encountered perl type (%s,0x%x) that JSON cannot handle, you might want to report this",
423 SvPV_nolen (sv), SvFLAGS (sv)); 491 SvPV_nolen (sv), SvFLAGS (sv));
424} 492}
425 493
426static SV * 494static SV *
427encode_json (SV *scalar, UV flags) 495encode_json (SV *scalar, U32 flags)
428{ 496{
429 if (!(flags & F_ALLOW_NONREF) && !SvROK (scalar)) 497 if (!(flags & F_ALLOW_NONREF) && !SvROK (scalar))
430 croak ("hash- or arrayref expected (not a simple scalar, use allow_nonref to allow this)"); 498 croak ("hash- or arrayref expected (not a simple scalar, use allow_nonref to allow this)");
431 499
432 enc_t enc; 500 enc_t enc;
433 enc.flags = flags; 501 enc.flags = flags;
434 enc.sv = sv_2mortal (NEWSV (0, INIT_SIZE)); 502 enc.sv = sv_2mortal (NEWSV (0, INIT_SIZE));
435 enc.cur = SvPVX (enc.sv); 503 enc.cur = SvPVX (enc.sv);
436 enc.end = SvEND (enc.sv); 504 enc.end = SvEND (enc.sv);
437 enc.max_recurse = 0;
438 enc.indent = 0; 505 enc.indent = 0;
506 enc.maxdepth = DEC_DEPTH (flags);
439 507
440 SvPOK_only (enc.sv); 508 SvPOK_only (enc.sv);
441 encode_sv (&enc, scalar); 509 encode_sv (&enc, scalar);
442 510
443 if (!(flags & (F_ASCII | F_UTF8))) 511 if (!(flags & (F_ASCII | F_UTF8)))
450 518
451 return enc.sv; 519 return enc.sv;
452} 520}
453 521
454///////////////////////////////////////////////////////////////////////////// 522/////////////////////////////////////////////////////////////////////////////
523// decoder
455 524
456#define WS \ 525// structure used for decoding JSON
526typedef struct
527{
528 char *cur; // current parser pointer
529 char *end; // end of input string
530 const char *err; // parse error, if != 0
531 U32 flags; // F_*
532 U32 depth; // recursion depth
533 U32 maxdepth; // recursion depth limit
534} dec_t;
535
536static void
537decode_ws (dec_t *dec)
538{
457 for (;;) \ 539 for (;;)
458 { \ 540 {
459 char ch = *dec->cur; \ 541 char ch = *dec->cur;
542
460 if (ch > 0x20 \ 543 if (ch > 0x20
461 || (ch != 0x20 && ch != 0x0a && ch != 0x0d && ch != 0x09)) \ 544 || (ch != 0x20 && ch != 0x0a && ch != 0x0d && ch != 0x09))
462 break; \ 545 break;
546
463 ++dec->cur; \ 547 ++dec->cur;
464 } 548 }
549}
465 550
466#define ERR(reason) SB dec->err = reason; goto fail; SE 551#define ERR(reason) SB dec->err = reason; goto fail; SE
552
467#define EXPECT_CH(ch) SB \ 553#define EXPECT_CH(ch) SB \
468 if (*dec->cur != ch) \ 554 if (*dec->cur != ch) \
469 ERR (# ch " expected"); \ 555 ERR (# ch " expected"); \
470 ++dec->cur; \ 556 ++dec->cur; \
471 SE 557 SE
472 558
559#define DEC_INC_DEPTH if (++dec->depth > dec->maxdepth) ERR ("json datastructure exceeds maximum nesting level (set a higher max_depth)")
560#define DEC_DEC_DEPTH --dec->depth
561
473static SV *decode_sv (dec_t *dec); 562static SV *decode_sv (dec_t *dec);
474 563
475static signed char decode_hexdigit[256]; 564static signed char decode_hexdigit[256];
476 565
477static UV 566static UV
478decode_4hex (dec_t *dec) 567decode_4hex (dec_t *dec)
479{ 568{
480 signed char d1, d2, d3, d4; 569 signed char d1, d2, d3, d4;
570 unsigned char *cur = (unsigned char *)dec->cur;
481 571
482 d1 = decode_hexdigit [((unsigned char *)dec->cur) [0]];
483 if (d1 < 0) ERR ("four hexadecimal digits expected"); 572 d1 = decode_hexdigit [cur [0]]; if (d1 < 0) ERR ("four hexadecimal digits expected");
484 d2 = decode_hexdigit [((unsigned char *)dec->cur) [1]];
485 if (d2 < 0) ERR ("four hexadecimal digits expected"); 573 d2 = decode_hexdigit [cur [1]]; if (d2 < 0) ERR ("four hexadecimal digits expected");
486 d3 = decode_hexdigit [((unsigned char *)dec->cur) [2]];
487 if (d3 < 0) ERR ("four hexadecimal digits expected"); 574 d3 = decode_hexdigit [cur [2]]; if (d3 < 0) ERR ("four hexadecimal digits expected");
488 d4 = decode_hexdigit [((unsigned char *)dec->cur) [3]];
489 if (d4 < 0) ERR ("four hexadecimal digits expected"); 575 d4 = decode_hexdigit [cur [3]]; if (d4 < 0) ERR ("four hexadecimal digits expected");
490 576
491 dec->cur += 4; 577 dec->cur += 4;
492 578
493 return ((UV)d1) << 12 579 return ((UV)d1) << 12
494 | ((UV)d2) << 8 580 | ((UV)d2) << 8
497 583
498fail: 584fail:
499 return (UV)-1; 585 return (UV)-1;
500} 586}
501 587
502#define APPEND_GROW(n) SB \
503 if (cur + (n) >= end) \
504 { \
505 STRLEN ofs = cur - SvPVX (sv); \
506 SvGROW (sv, ofs + (n) + 1); \
507 cur = SvPVX (sv) + ofs; \
508 end = SvEND (sv); \
509 } \
510 SE
511
512#define APPEND_CH(ch) SB \
513 APPEND_GROW (1); \
514 *cur++ = (ch); \
515 SE
516
517static SV * 588static SV *
518decode_str (dec_t *dec) 589decode_str (dec_t *dec)
519{ 590{
520 SV *sv = NEWSV (0,2); 591 SV *sv = 0;
521 int utf8 = 0; 592 int utf8 = 0;
522 char *cur = SvPVX (sv);
523 char *end = SvEND (sv);
524 593
525 for (;;) 594 do
526 { 595 {
527 unsigned char ch = *(unsigned char *)dec->cur; 596 char buf [SHORT_STRING_LEN + UTF8_MAX_LEN];
597 char *cur = buf;
528 598
529 if (ch == '"') 599 do
530 break;
531 else if (ch == '\\')
532 { 600 {
533 switch (*++dec->cur) 601 unsigned char ch = *(unsigned char *)dec->cur++;
602
603 if (ch == '"')
534 { 604 {
535 case '\\': 605 --dec->cur;
536 case '/': 606 break;
537 case '"': APPEND_CH (*dec->cur++); break; 607 }
538 608 else if (ch == '\\')
539 case 'b': APPEND_CH ('\010'); ++dec->cur; break; 609 {
540 case 't': APPEND_CH ('\011'); ++dec->cur; break; 610 switch (*dec->cur)
541 case 'n': APPEND_CH ('\012'); ++dec->cur; break;
542 case 'f': APPEND_CH ('\014'); ++dec->cur; break;
543 case 'r': APPEND_CH ('\015'); ++dec->cur; break;
544
545 case 'u':
546 { 611 {
547 UV lo, hi; 612 case '\\':
548 ++dec->cur; 613 case '/':
614 case '"': *cur++ = *dec->cur++; break;
549 615
550 hi = decode_4hex (dec); 616 case 'b': ++dec->cur; *cur++ = '\010'; break;
551 if (hi == (UV)-1) 617 case 't': ++dec->cur; *cur++ = '\011'; break;
552 goto fail; 618 case 'n': ++dec->cur; *cur++ = '\012'; break;
619 case 'f': ++dec->cur; *cur++ = '\014'; break;
620 case 'r': ++dec->cur; *cur++ = '\015'; break;
553 621
554 // possibly a surrogate pair 622 case 'u':
555 if (hi >= 0xd800 && hi < 0xdc00)
556 { 623 {
557 if (dec->cur [0] != '\\' || dec->cur [1] != 'u') 624 UV lo, hi;
558 ERR ("missing low surrogate character in surrogate pair");
559
560 dec->cur += 2; 625 ++dec->cur;
561 626
562 lo = decode_4hex (dec); 627 hi = decode_4hex (dec);
563 if (lo == (UV)-1) 628 if (hi == (UV)-1)
564 goto fail; 629 goto fail;
565 630
631 // possibly a surrogate pair
632 if (hi >= 0xd800)
633 if (hi < 0xdc00)
634 {
635 if (dec->cur [0] != '\\' || dec->cur [1] != 'u')
636 ERR ("missing low surrogate character in surrogate pair");
637
638 dec->cur += 2;
639
640 lo = decode_4hex (dec);
641 if (lo == (UV)-1)
642 goto fail;
643
566 if (lo < 0xdc00 || lo >= 0xe000) 644 if (lo < 0xdc00 || lo >= 0xe000)
567 ERR ("surrogate pair expected"); 645 ERR ("surrogate pair expected");
568 646
569 hi = (hi - 0xD800) * 0x400 + (lo - 0xDC00) + 0x10000; 647 hi = (hi - 0xD800) * 0x400 + (lo - 0xDC00) + 0x10000;
648 }
649 else if (hi < 0xe000)
650 ERR ("missing high surrogate character in surrogate pair");
651
652 if (hi >= 0x80)
653 {
654 utf8 = 1;
655
656 cur = (char *)uvuni_to_utf8_flags (cur, hi, 0);
657 }
658 else
659 *cur++ = hi;
570 } 660 }
571 else if (hi >= 0xdc00 && hi < 0xe000)
572 ERR ("missing high surrogate character in surrogate pair");
573
574 if (hi >= 0x80)
575 { 661 break;
576 utf8 = 1;
577 662
578 APPEND_GROW (4); // at most 4 bytes for 21 bits
579 cur = (char *)uvuni_to_utf8_flags (cur, hi, 0);
580 }
581 else 663 default:
582 APPEND_CH (hi); 664 --dec->cur;
665 ERR ("illegal backslash escape sequence in string");
583 } 666 }
584 break;
585
586 default:
587 --dec->cur;
588 ERR ("illegal backslash escape sequence in string");
589 } 667 }
668 else if (ch >= 0x20 && ch <= 0x7f)
669 *cur++ = ch;
670 else if (ch >= 0x80)
671 {
672 --dec->cur;
673
674 STRLEN clen;
675 UV uch = decode_utf8 (dec->cur, dec->end - dec->cur, &clen);
676 if (clen == (STRLEN)-1)
677 ERR ("malformed UTF-8 character in JSON string");
678
679 do
680 {
681 *cur++ = *dec->cur++;
682 }
683 while (--clen);
684
685 utf8 = 1;
686 }
687 else if (!ch)
688 ERR ("unexpected end of string while parsing json string");
689 else
690 ERR ("invalid character encountered");
691
590 } 692 }
591 else if (ch >= 0x20 && ch <= 0x7f) 693 while (cur < buf + SHORT_STRING_LEN);
592 APPEND_CH (*dec->cur++); 694
593 else if (ch >= 0x80) 695 STRLEN len = cur - buf;
696
697 if (sv)
594 { 698 {
595 STRLEN clen; 699 SvGROW (sv, SvCUR (sv) + len + 1);
596 UV uch = utf8n_to_uvuni (dec->cur, dec->end - dec->cur, &clen, UTF8_CHECK_ONLY); 700 memcpy (SvPVX (sv) + SvCUR (sv), buf, len);
597 if (clen == (STRLEN)-1) 701 SvCUR_set (sv, SvCUR (sv) + len);
598 ERR ("malformed UTF-8 character in JSON string");
599
600 APPEND_GROW (clen);
601 do
602 {
603 *cur++ = *dec->cur++;
604 }
605 while (--clen);
606
607 utf8 = 1;
608 } 702 }
609 else if (dec->cur == dec->end)
610 ERR ("unexpected end of string while parsing json string");
611 else 703 else
612 ERR ("invalid character encountered"); 704 sv = newSVpvn (buf, len);
613 } 705 }
706 while (*dec->cur != '"');
614 707
615 ++dec->cur; 708 ++dec->cur;
616 709
617 SvCUR_set (sv, cur - SvPVX (sv)); 710 if (sv)
618 711 {
619 SvPOK_only (sv); 712 SvPOK_only (sv);
620 *SvEND (sv) = 0; 713 *SvEND (sv) = 0;
621 714
622 if (utf8) 715 if (utf8)
623 SvUTF8_on (sv); 716 SvUTF8_on (sv);
624 717 }
625 if (dec->flags & F_SHRINK) 718 else
626 shrink (sv); 719 sv = newSVpvn ("", 0);
627 720
628 return sv; 721 return sv;
629 722
630fail: 723fail:
631 SvREFCNT_dec (sv);
632 return 0; 724 return 0;
633} 725}
634 726
635static SV * 727static SV *
636decode_num (dec_t *dec) 728decode_num (dec_t *dec)
717static SV * 809static SV *
718decode_av (dec_t *dec) 810decode_av (dec_t *dec)
719{ 811{
720 AV *av = newAV (); 812 AV *av = newAV ();
721 813
722 WS; 814 DEC_INC_DEPTH;
815 decode_ws (dec);
816
723 if (*dec->cur == ']') 817 if (*dec->cur == ']')
724 ++dec->cur; 818 ++dec->cur;
725 else 819 else
726 for (;;) 820 for (;;)
727 { 821 {
731 if (!value) 825 if (!value)
732 goto fail; 826 goto fail;
733 827
734 av_push (av, value); 828 av_push (av, value);
735 829
736 WS; 830 decode_ws (dec);
737 831
738 if (*dec->cur == ']') 832 if (*dec->cur == ']')
739 { 833 {
740 ++dec->cur; 834 ++dec->cur;
741 break; 835 break;
745 ERR (", or ] expected while parsing array"); 839 ERR (", or ] expected while parsing array");
746 840
747 ++dec->cur; 841 ++dec->cur;
748 } 842 }
749 843
844 DEC_DEC_DEPTH;
750 return newRV_noinc ((SV *)av); 845 return newRV_noinc ((SV *)av);
751 846
752fail: 847fail:
753 SvREFCNT_dec (av); 848 SvREFCNT_dec (av);
849 DEC_DEC_DEPTH;
754 return 0; 850 return 0;
755} 851}
756 852
757static SV * 853static SV *
758decode_hv (dec_t *dec) 854decode_hv (dec_t *dec)
759{ 855{
760 HV *hv = newHV (); 856 HV *hv = newHV ();
761 857
762 WS; 858 DEC_INC_DEPTH;
859 decode_ws (dec);
860
763 if (*dec->cur == '}') 861 if (*dec->cur == '}')
764 ++dec->cur; 862 ++dec->cur;
765 else 863 else
766 for (;;) 864 for (;;)
767 { 865 {
768 SV *key, *value; 866 SV *key, *value;
769 867
770 WS; EXPECT_CH ('"'); 868 decode_ws (dec); EXPECT_CH ('"');
771 869
772 key = decode_str (dec); 870 key = decode_str (dec);
773 if (!key) 871 if (!key)
774 goto fail; 872 goto fail;
775 873
776 WS; EXPECT_CH (':'); 874 decode_ws (dec); EXPECT_CH (':');
777 875
778 value = decode_sv (dec); 876 value = decode_sv (dec);
779 if (!value) 877 if (!value)
780 { 878 {
781 SvREFCNT_dec (key); 879 SvREFCNT_dec (key);
782 goto fail; 880 goto fail;
783 } 881 }
784 882
785 //TODO: optimise
786 hv_store_ent (hv, key, value, 0); 883 hv_store_ent (hv, key, value, 0);
884 SvREFCNT_dec (key);
787 885
788 WS; 886 decode_ws (dec);
789 887
790 if (*dec->cur == '}') 888 if (*dec->cur == '}')
791 { 889 {
792 ++dec->cur; 890 ++dec->cur;
793 break; 891 break;
797 ERR (", or } expected while parsing object/hash"); 895 ERR (", or } expected while parsing object/hash");
798 896
799 ++dec->cur; 897 ++dec->cur;
800 } 898 }
801 899
900 DEC_DEC_DEPTH;
802 return newRV_noinc ((SV *)hv); 901 return newRV_noinc ((SV *)hv);
803 902
804fail: 903fail:
805 SvREFCNT_dec (hv); 904 SvREFCNT_dec (hv);
905 DEC_DEC_DEPTH;
806 return 0; 906 return 0;
807} 907}
808 908
809static SV * 909static SV *
810decode_sv (dec_t *dec) 910decode_sv (dec_t *dec)
811{ 911{
812 WS; 912 decode_ws (dec);
813 switch (*dec->cur) 913 switch (*dec->cur)
814 { 914 {
815 case '"': ++dec->cur; return decode_str (dec); 915 case '"': ++dec->cur; return decode_str (dec);
816 case '[': ++dec->cur; return decode_av (dec); 916 case '[': ++dec->cur; return decode_av (dec);
817 case '{': ++dec->cur; return decode_hv (dec); 917 case '{': ++dec->cur; return decode_hv (dec);
862fail: 962fail:
863 return 0; 963 return 0;
864} 964}
865 965
866static SV * 966static SV *
867decode_json (SV *string, UV flags) 967decode_json (SV *string, U32 flags)
868{ 968{
869 SV *sv; 969 SV *sv;
970
971 SvUPGRADE (string, SVt_PV);
870 972
871 if (flags & F_UTF8) 973 if (flags & F_UTF8)
872 sv_utf8_downgrade (string, 0); 974 sv_utf8_downgrade (string, 0);
873 else 975 else
874 sv_utf8_upgrade (string); 976 sv_utf8_upgrade (string);
875 977
876 SvGROW (string, SvCUR (string) + 1); // should basically be a NOP 978 SvGROW (string, SvCUR (string) + 1); // should basically be a NOP
877 979
878 dec_t dec; 980 dec_t dec;
879 dec.flags = flags; 981 dec.flags = flags;
880 dec.cur = SvPVX (string); 982 dec.cur = SvPVX (string);
881 dec.end = SvEND (string); 983 dec.end = SvEND (string);
882 dec.err = 0; 984 dec.err = 0;
985 dec.depth = 0;
986 dec.maxdepth = DEC_DEPTH (dec.flags);
883 987
988 *dec.end = 0; // this should basically be a nop, too, but make sure its there
884 sv = decode_sv (&dec); 989 sv = decode_sv (&dec);
885 990
886 if (!sv) 991 if (!sv)
887 { 992 {
888 IV offset = dec.flags & F_UTF8 993 IV offset = dec.flags & F_UTF8
911 croak ("JSON text must be an object or array (but found number, string, true, false or null, use allow_nonref to allow this)"); 1016 croak ("JSON text must be an object or array (but found number, string, true, false or null, use allow_nonref to allow this)");
912 1017
913 return sv; 1018 return sv;
914} 1019}
915 1020
1021/////////////////////////////////////////////////////////////////////////////
1022// XS interface functions
1023
916MODULE = JSON::XS PACKAGE = JSON::XS 1024MODULE = JSON::XS PACKAGE = JSON::XS
917 1025
918BOOT: 1026BOOT:
919{ 1027{
920 int i; 1028 int i;
921 1029
922 memset (decode_hexdigit, 0xff, 256); 1030 memset (decode_hexdigit, 0xff, 256);
1031
923 for (i = 10; i--; ) 1032 for (i = 0; i < 256; ++i)
924 decode_hexdigit ['0' + i] = i; 1033 decode_hexdigit [i] =
925 1034 i >= '0' && i <= '9' ? i - '0'
926 for (i = 7; i--; ) 1035 : i >= 'a' && i <= 'f' ? i - 'a' + 10
927 { 1036 : i >= 'A' && i <= 'F' ? i - 'A' + 10
928 decode_hexdigit ['a' + i] = 10 + i; 1037 : -1;
929 decode_hexdigit ['A' + i] = 10 + i;
930 }
931 1038
932 json_stash = gv_stashpv ("JSON::XS", 1); 1039 json_stash = gv_stashpv ("JSON::XS", 1);
933} 1040}
934 1041
935PROTOTYPES: DISABLE 1042PROTOTYPES: DISABLE
946 utf8 = F_UTF8 1053 utf8 = F_UTF8
947 indent = F_INDENT 1054 indent = F_INDENT
948 canonical = F_CANONICAL 1055 canonical = F_CANONICAL
949 space_before = F_SPACE_BEFORE 1056 space_before = F_SPACE_BEFORE
950 space_after = F_SPACE_AFTER 1057 space_after = F_SPACE_AFTER
951 json_rpc = F_JSON_RPC
952 pretty = F_PRETTY 1058 pretty = F_PRETTY
953 allow_nonref = F_ALLOW_NONREF 1059 allow_nonref = F_ALLOW_NONREF
954 shrink = F_SHRINK 1060 shrink = F_SHRINK
955 CODE: 1061 CODE:
956{ 1062{
963 RETVAL = newSVsv (self); 1069 RETVAL = newSVsv (self);
964} 1070}
965 OUTPUT: 1071 OUTPUT:
966 RETVAL 1072 RETVAL
967 1073
1074SV *max_depth (SV *self, int max_depth = 0x80000000UL)
1075 CODE:
1076{
1077 UV *uv = SvJSON (self);
1078 UV log2 = 0;
1079
1080 if (max_depth > 0x80000000UL) max_depth = 0x80000000UL;
1081
1082 while ((1UL << log2) < max_depth)
1083 ++log2;
1084
1085 *uv = *uv & ~F_MAXDEPTH | (log2 << S_MAXDEPTH);
1086
1087 RETVAL = newSVsv (self);
1088}
1089 OUTPUT:
1090 RETVAL
1091
968void encode (SV *self, SV *scalar) 1092void encode (SV *self, SV *scalar)
969 PPCODE: 1093 PPCODE:
970 XPUSHs (encode_json (scalar, *SvJSON (self))); 1094 XPUSHs (encode_json (scalar, *SvJSON (self)));
971 1095
972void decode (SV *self, SV *jsonstr) 1096void decode (SV *self, SV *jsonstr)
974 XPUSHs (decode_json (jsonstr, *SvJSON (self))); 1098 XPUSHs (decode_json (jsonstr, *SvJSON (self)));
975 1099
976PROTOTYPES: ENABLE 1100PROTOTYPES: ENABLE
977 1101
978void to_json (SV *scalar) 1102void to_json (SV *scalar)
1103 ALIAS:
1104 objToJson = 0
979 PPCODE: 1105 PPCODE:
980 XPUSHs (encode_json (scalar, F_UTF8)); 1106 XPUSHs (encode_json (scalar, F_DEFAULT | F_UTF8));
981 1107
982void from_json (SV *jsonstr) 1108void from_json (SV *jsonstr)
1109 ALIAS:
1110 jsonToObj = 0
983 PPCODE: 1111 PPCODE:
984 XPUSHs (decode_json (jsonstr, F_UTF8)); 1112 XPUSHs (decode_json (jsonstr, F_DEFAULT | F_UTF8));
985 1113

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines