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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines