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.11 by root, Sat Mar 24 19:42:14 2007 UTC vs.
Revision 1.44 by root, Mon Jun 25 04:08:17 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines