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.38 by root, Mon Jun 11 03:18:07 2007 UTC vs.
Revision 1.73 by root, Wed Mar 19 13:44:43 2008 UTC

1#include "EXTERN.h" 1#include "EXTERN.h"
2#include "perl.h" 2#include "perl.h"
3#include "XSUB.h" 3#include "XSUB.h"
4 4
5#include "assert.h" 5#include <assert.h>
6#include "string.h" 6#include <string.h>
7#include "stdlib.h" 7#include <stdlib.h>
8#include "stdio.h" 8#include <stdio.h>
9#include <float.h>
9 10
10#if defined(__BORLANDC__) || defined(_MSC_VER) 11#if defined(__BORLANDC__) || defined(_MSC_VER)
11# define snprintf _snprintf // C compilers have this in stdio.h 12# define snprintf _snprintf // C compilers have this in stdio.h
12#endif 13#endif
13 14
15// some old perls do not have this, try to make it work, no
16// guarentees, though. if it breaks, you get to keep the pieces.
17#ifndef UTF8_MAXBYTES
18# define UTF8_MAXBYTES 13
19#endif
20
14#define F_ASCII 0x00000001UL 21#define F_ASCII 0x00000001UL
15#define F_LATIN1 0x00000002UL 22#define F_LATIN1 0x00000002UL
16#define F_UTF8 0x00000004UL 23#define F_UTF8 0x00000004UL
17#define F_INDENT 0x00000008UL 24#define F_INDENT 0x00000008UL
18#define F_CANONICAL 0x00000010UL 25#define F_CANONICAL 0x00000010UL
19#define F_SPACE_BEFORE 0x00000020UL 26#define F_SPACE_BEFORE 0x00000020UL
20#define F_SPACE_AFTER 0x00000040UL 27#define F_SPACE_AFTER 0x00000040UL
21#define F_ALLOW_NONREF 0x00000100UL 28#define F_ALLOW_NONREF 0x00000100UL
22#define F_SHRINK 0x00000200UL 29#define F_SHRINK 0x00000200UL
30#define F_ALLOW_BLESSED 0x00000400UL
31#define F_CONV_BLESSED 0x00000800UL
32#define F_RELAXED 0x00001000UL
33
23#define F_MAXDEPTH 0xf8000000UL 34#define F_MAXDEPTH 0xf8000000UL
24#define S_MAXDEPTH 27 35#define S_MAXDEPTH 27
36#define F_MAXSIZE 0x01f00000UL
37#define S_MAXSIZE 20
38#define F_HOOK 0x00080000UL // some hooks exist, so slow-path processing
25 39
26#define DEC_DEPTH(flags) (1UL << ((flags & F_MAXDEPTH) >> S_MAXDEPTH)) 40#define DEC_DEPTH(flags) (1UL << ((flags & F_MAXDEPTH) >> S_MAXDEPTH))
27 41#define DEC_SIZE(flags) (1UL << ((flags & F_MAXSIZE ) >> S_MAXSIZE ))
28// F_SELFCONVERT? <=> to_json/toJson
29// F_BLESSED? <=> { $__class__$ => }
30 42
31#define F_PRETTY F_INDENT | F_SPACE_BEFORE | F_SPACE_AFTER 43#define F_PRETTY F_INDENT | F_SPACE_BEFORE | F_SPACE_AFTER
32#define F_DEFAULT (9UL << S_MAXDEPTH) 44#define F_DEFAULT (9UL << S_MAXDEPTH)
33 45
34#define INIT_SIZE 32 // initial scalar size to be allocated 46#define INIT_SIZE 32 // initial scalar size to be allocated
38 50
39#define SB do { 51#define SB do {
40#define SE } while (0) 52#define SE } while (0)
41 53
42#if __GNUC__ >= 3 54#if __GNUC__ >= 3
43# define expect(expr,value) __builtin_expect ((expr),(value)) 55# define expect(expr,value) __builtin_expect ((expr), (value))
44# define inline inline 56# define INLINE static inline
45#else 57#else
46# define expect(expr,value) (expr) 58# define expect(expr,value) (expr)
47# define inline static 59# define INLINE static
48#endif 60#endif
49 61
50#define expect_false(expr) expect ((expr) != 0, 0) 62#define expect_false(expr) expect ((expr) != 0, 0)
51#define expect_true(expr) expect ((expr) != 0, 1) 63#define expect_true(expr) expect ((expr) != 0, 1)
52 64
65#define IN_RANGE_INC(type,val,beg,end) \
66 ((unsigned type)((unsigned type)(val) - (unsigned type)(beg)) \
67 <= (unsigned type)((unsigned type)(end) - (unsigned type)(beg)))
68
69#ifdef USE_ITHREADS
70# define JSON_SLOW 1
71# define JSON_STASH (json_stash ? json_stash : gv_stashpv ("JSON::XS", 1))
72#else
73# define JSON_SLOW 0
74# define JSON_STASH json_stash
75#endif
76
53static HV *json_stash; // JSON::XS:: 77static HV *json_stash, *json_boolean_stash; // JSON::XS::
78static SV *json_true, *json_false;
79
80typedef struct {
81 U32 flags;
82 SV *cb_object;
83 HV *cb_sk_object;
84} JSON;
54 85
55///////////////////////////////////////////////////////////////////////////// 86/////////////////////////////////////////////////////////////////////////////
56// utility functions 87// utility functions
57 88
58static UV * 89INLINE void
59SvJSON (SV *sv)
60{
61 if (!(SvROK (sv) && SvOBJECT (SvRV (sv)) && SvSTASH (SvRV (sv)) == json_stash))
62 croak ("object is not of type JSON::XS");
63
64 return &SvUVX (SvRV (sv));
65}
66
67static void
68shrink (SV *sv) 90shrink (SV *sv)
69{ 91{
70 sv_utf8_downgrade (sv, 1); 92 sv_utf8_downgrade (sv, 1);
71 if (SvLEN (sv) > SvCUR (sv) + 1) 93 if (SvLEN (sv) > SvCUR (sv) + 1)
72 { 94 {
81// decode an utf-8 character and return it, or (UV)-1 in 103// decode an utf-8 character and return it, or (UV)-1 in
82// case of an error. 104// case of an error.
83// we special-case "safe" characters from U+80 .. U+7FF, 105// we special-case "safe" characters from U+80 .. U+7FF,
84// but use the very good perl function to parse anything else. 106// but use the very good perl function to parse anything else.
85// note that we never call this function for a ascii codepoints 107// note that we never call this function for a ascii codepoints
86inline UV 108INLINE UV
87decode_utf8 (unsigned char *s, STRLEN len, STRLEN *clen) 109decode_utf8 (unsigned char *s, STRLEN len, STRLEN *clen)
88{ 110{
89 if (expect_false (s[0] > 0xdf || s[0] < 0xc2)) 111 if (expect_true (len >= 2
90 return utf8n_to_uvuni (s, len, clen, UTF8_CHECK_ONLY); 112 && IN_RANGE_INC (char, s[0], 0xc2, 0xdf)
91 else if (len > 1 && s[1] >= 0x80 && s[1] <= 0xbf) 113 && IN_RANGE_INC (char, s[1], 0x80, 0xbf)))
92 { 114 {
93 *clen = 2; 115 *clen = 2;
94 return ((s[0] & 0x1f) << 6) | (s[1] & 0x3f); 116 return ((s[0] & 0x1f) << 6) | (s[1] & 0x3f);
95 } 117 }
96 else 118 else
97 { 119 return utf8n_to_uvuni (s, len, clen, UTF8_CHECK_ONLY);
98 *clen = (STRLEN)-1; 120}
99 return (UV)-1; 121
122// likewise for encoding, also never called for ascii codepoints
123// this function takes advantage of this fact, although current gccs
124// seem to optimise the check for >= 0x80 away anyways
125INLINE unsigned char *
126encode_utf8 (unsigned char *s, UV ch)
127{
128 if (ch <= 0x7FF)
100 } 129 {
130 *s++ = (ch >> 6) | 0xc0;
131 *s++ = (ch & 0x3f) | 0x80;
132 }
133 else
134 s = uvuni_to_utf8_flags (s, ch, 0);
135
136 return s;
101} 137}
102 138
103///////////////////////////////////////////////////////////////////////////// 139/////////////////////////////////////////////////////////////////////////////
104// encoder 140// encoder
105 141
107typedef struct 143typedef struct
108{ 144{
109 char *cur; // SvPVX (sv) + current output position 145 char *cur; // SvPVX (sv) + current output position
110 char *end; // SvEND (sv) 146 char *end; // SvEND (sv)
111 SV *sv; // result scalar 147 SV *sv; // result scalar
112 U32 flags; // F_* 148 JSON json;
113 U32 indent; // indentation level 149 U32 indent; // indentation level
114 U32 maxdepth; // max. indentation/recursion level 150 U32 maxdepth; // max. indentation/recursion level
151 UV limit; // escape character values >= this value when encoding
115} enc_t; 152} enc_t;
116 153
117inline void 154INLINE void
118need (enc_t *enc, STRLEN len) 155need (enc_t *enc, STRLEN len)
119{ 156{
120 if (expect_false (enc->cur + len >= enc->end)) 157 if (expect_false (enc->cur + len >= enc->end))
121 { 158 {
122 STRLEN cur = enc->cur - SvPVX (enc->sv); 159 STRLEN cur = enc->cur - SvPVX (enc->sv);
124 enc->cur = SvPVX (enc->sv) + cur; 161 enc->cur = SvPVX (enc->sv) + cur;
125 enc->end = SvPVX (enc->sv) + SvLEN (enc->sv) - 1; 162 enc->end = SvPVX (enc->sv) + SvLEN (enc->sv) - 1;
126 } 163 }
127} 164}
128 165
129inline void 166INLINE void
130encode_ch (enc_t *enc, char ch) 167encode_ch (enc_t *enc, char ch)
131{ 168{
132 need (enc, 1); 169 need (enc, 1);
133 *enc->cur++ = ch; 170 *enc->cur++ = ch;
134} 171}
178 STRLEN clen; 215 STRLEN clen;
179 UV uch; 216 UV uch;
180 217
181 if (is_utf8) 218 if (is_utf8)
182 { 219 {
183 //uch = utf8n_to_uvuni (str, end - str, &clen, UTF8_CHECK_ONLY);
184 uch = decode_utf8 (str, end - str, &clen); 220 uch = decode_utf8 (str, end - str, &clen);
185 if (clen == (STRLEN)-1) 221 if (clen == (STRLEN)-1)
186 croak ("malformed or illegal unicode character in string [%.11s], cannot convert to JSON", str); 222 croak ("malformed or illegal unicode character in string [%.11s], cannot convert to JSON", str);
187 } 223 }
188 else 224 else
189 { 225 {
190 uch = ch; 226 uch = ch;
191 clen = 1; 227 clen = 1;
192 } 228 }
193 229
194 if (uch > 0x10FFFFUL) 230 if (uch < 0x80/*0x20*/ || uch >= enc->limit)
195 croak ("out of range codepoint (0x%lx) encountered, unrepresentable in JSON", (unsigned long)uch);
196
197 if (uch < 0x80 || enc->flags & F_ASCII || (enc->flags & F_LATIN1 && uch > 0xFF))
198 { 231 {
199 if (uch > 0xFFFFUL) 232 if (uch > 0xFFFFUL)
200 { 233 {
234 if (uch > 0x10FFFFUL)
235 croak ("out of range codepoint (0x%lx) encountered, unrepresentable in JSON", (unsigned long)uch);
236
201 need (enc, len += 11); 237 need (enc, len += 11);
202 sprintf (enc->cur, "\\u%04x\\u%04x", 238 sprintf (enc->cur, "\\u%04x\\u%04x",
203 (int)((uch - 0x10000) / 0x400 + 0xD800), 239 (int)((uch - 0x10000) / 0x400 + 0xD800),
204 (int)((uch - 0x10000) % 0x400 + 0xDC00)); 240 (int)((uch - 0x10000) % 0x400 + 0xDC00));
205 enc->cur += 12; 241 enc->cur += 12;
216 *enc->cur++ = hexdigit [(uch >> 0) & 15]; 252 *enc->cur++ = hexdigit [(uch >> 0) & 15];
217 } 253 }
218 254
219 str += clen; 255 str += clen;
220 } 256 }
221 else if (enc->flags & F_LATIN1) 257 else if (enc->json.flags & F_LATIN1)
222 { 258 {
223 *enc->cur++ = uch; 259 *enc->cur++ = uch;
224 str += clen; 260 str += clen;
225 } 261 }
226 else if (is_utf8) 262 else if (is_utf8)
233 while (--clen); 269 while (--clen);
234 } 270 }
235 else 271 else
236 { 272 {
237 need (enc, len += UTF8_MAXBYTES - 1); // never more than 11 bytes needed 273 need (enc, len += UTF8_MAXBYTES - 1); // never more than 11 bytes needed
238 enc->cur = uvuni_to_utf8_flags (enc->cur, uch, 0); 274 enc->cur = encode_utf8 (enc->cur, uch);
239 ++str; 275 ++str;
240 } 276 }
241 } 277 }
242 } 278 }
243 } 279 }
244 280
245 --len; 281 --len;
246 } 282 }
247} 283}
248 284
249inline void 285INLINE void
250encode_indent (enc_t *enc) 286encode_indent (enc_t *enc)
251{ 287{
252 if (enc->flags & F_INDENT) 288 if (enc->json.flags & F_INDENT)
253 { 289 {
254 int spaces = enc->indent * INDENT_STEP; 290 int spaces = enc->indent * INDENT_STEP;
255 291
256 need (enc, spaces); 292 need (enc, spaces);
257 memset (enc->cur, ' ', spaces); 293 memset (enc->cur, ' ', spaces);
258 enc->cur += spaces; 294 enc->cur += spaces;
259 } 295 }
260} 296}
261 297
262inline void 298INLINE void
263encode_space (enc_t *enc) 299encode_space (enc_t *enc)
264{ 300{
265 need (enc, 1); 301 need (enc, 1);
266 encode_ch (enc, ' '); 302 encode_ch (enc, ' ');
267} 303}
268 304
269inline void 305INLINE void
270encode_nl (enc_t *enc) 306encode_nl (enc_t *enc)
271{ 307{
272 if (enc->flags & F_INDENT) 308 if (enc->json.flags & F_INDENT)
273 { 309 {
274 need (enc, 1); 310 need (enc, 1);
275 encode_ch (enc, '\n'); 311 encode_ch (enc, '\n');
276 } 312 }
277} 313}
278 314
279inline void 315INLINE void
280encode_comma (enc_t *enc) 316encode_comma (enc_t *enc)
281{ 317{
282 encode_ch (enc, ','); 318 encode_ch (enc, ',');
283 319
284 if (enc->flags & F_INDENT) 320 if (enc->json.flags & F_INDENT)
285 encode_nl (enc); 321 encode_nl (enc);
286 else if (enc->flags & F_SPACE_AFTER) 322 else if (enc->json.flags & F_SPACE_AFTER)
287 encode_space (enc); 323 encode_space (enc);
288} 324}
289 325
290static void encode_sv (enc_t *enc, SV *sv); 326static void encode_sv (enc_t *enc, SV *sv);
291 327
295 int i, len = av_len (av); 331 int i, len = av_len (av);
296 332
297 if (enc->indent >= enc->maxdepth) 333 if (enc->indent >= enc->maxdepth)
298 croak ("data structure too deep (hit recursion limit)"); 334 croak ("data structure too deep (hit recursion limit)");
299 335
300 encode_ch (enc, '['); encode_nl (enc); 336 encode_ch (enc, '[');
301 ++enc->indent; 337
338 if (len >= 0)
339 {
340 encode_nl (enc); ++enc->indent;
302 341
303 for (i = 0; i <= len; ++i) 342 for (i = 0; i <= len; ++i)
304 { 343 {
344 SV **svp = av_fetch (av, i, 0);
345
305 encode_indent (enc); 346 encode_indent (enc);
306 encode_sv (enc, *av_fetch (av, i, 0));
307 347
348 if (svp)
349 encode_sv (enc, *svp);
350 else
351 encode_str (enc, "null", 4, 0);
352
308 if (i < len) 353 if (i < len)
309 encode_comma (enc); 354 encode_comma (enc);
310 } 355 }
311 356
357 encode_nl (enc); --enc->indent; encode_indent (enc);
358 }
359
312 encode_nl (enc); 360 encode_ch (enc, ']');
313
314 --enc->indent;
315 encode_indent (enc); encode_ch (enc, ']');
316} 361}
317 362
318static void 363static void
319encode_he (enc_t *enc, HE *he) 364encode_hk (enc_t *enc, HE *he)
320{ 365{
321 encode_ch (enc, '"'); 366 encode_ch (enc, '"');
322 367
323 if (HeKLEN (he) == HEf_SVKEY) 368 if (HeKLEN (he) == HEf_SVKEY)
324 { 369 {
334 else 379 else
335 encode_str (enc, HeKEY (he), HeKLEN (he), HeKUTF8 (he)); 380 encode_str (enc, HeKEY (he), HeKLEN (he), HeKUTF8 (he));
336 381
337 encode_ch (enc, '"'); 382 encode_ch (enc, '"');
338 383
339 if (enc->flags & F_SPACE_BEFORE) encode_space (enc); 384 if (enc->json.flags & F_SPACE_BEFORE) encode_space (enc);
340 encode_ch (enc, ':'); 385 encode_ch (enc, ':');
341 if (enc->flags & F_SPACE_AFTER ) encode_space (enc); 386 if (enc->json.flags & F_SPACE_AFTER ) encode_space (enc);
342 encode_sv (enc, HeVAL (he));
343} 387}
344 388
345// compare hash entries, used when all keys are bytestrings 389// compare hash entries, used when all keys are bytestrings
346static int 390static int
347he_cmp_fast (const void *a_, const void *b_) 391he_cmp_fast (const void *a_, const void *b_)
352 HE *b = *(HE **)b_; 396 HE *b = *(HE **)b_;
353 397
354 STRLEN la = HeKLEN (a); 398 STRLEN la = HeKLEN (a);
355 STRLEN lb = HeKLEN (b); 399 STRLEN lb = HeKLEN (b);
356 400
357 if (!(cmp = memcmp (HeKEY (a), HeKEY (b), la < lb ? la : lb))) 401 if (!(cmp = memcmp (HeKEY (b), HeKEY (a), lb < la ? lb : la)))
358 cmp = la - lb; 402 cmp = lb - la;
359 403
360 return cmp; 404 return cmp;
361} 405}
362 406
363// compare hash entries, used when some keys are sv's or utf-x 407// compare hash entries, used when some keys are sv's or utf-x
364static int 408static int
365he_cmp_slow (const void *a, const void *b) 409he_cmp_slow (const void *a, const void *b)
366{ 410{
367 return sv_cmp (HeSVKEY_force (*(HE **)a), HeSVKEY_force (*(HE **)b)); 411 return sv_cmp (HeSVKEY_force (*(HE **)b), HeSVKEY_force (*(HE **)a));
368} 412}
369 413
370static void 414static void
371encode_hv (enc_t *enc, HV *hv) 415encode_hv (enc_t *enc, HV *hv)
372{ 416{
417 HE *he;
373 int count, i; 418 int count;
374 419
375 if (enc->indent >= enc->maxdepth) 420 if (enc->indent >= enc->maxdepth)
376 croak ("data structure too deep (hit recursion limit)"); 421 croak ("data structure too deep (hit recursion limit)");
377 422
378 encode_ch (enc, '{'); encode_nl (enc); ++enc->indent; 423 encode_ch (enc, '{');
379 424
380 if ((count = hv_iterinit (hv)))
381 {
382 // for canonical output we have to sort by keys first 425 // for canonical output we have to sort by keys first
383 // actually, this is mostly due to the stupid so-called 426 // actually, this is mostly due to the stupid so-called
384 // security workaround added somewhere in 5.8.x. 427 // security workaround added somewhere in 5.8.x.
385 // that randomises hash orderings 428 // that randomises hash orderings
386 if (enc->flags & F_CANONICAL) 429 if (enc->json.flags & F_CANONICAL)
430 {
431 int count = hv_iterinit (hv);
432
433 if (SvMAGICAL (hv))
387 { 434 {
435 // need to count by iterating. could improve by dynamically building the vector below
436 // but I don't care for the speed of this special case.
437 // note also that we will run into undefined behaviour when the two iterations
438 // do not result in the same count, something I might care for in some later release.
439
440 count = 0;
441 while (hv_iternext (hv))
442 ++count;
443
444 hv_iterinit (hv);
445 }
446
447 if (count)
448 {
388 int fast = 1; 449 int i, fast = 1;
389 HE *he;
390#if defined(__BORLANDC__) || defined(_MSC_VER) 450#if defined(__BORLANDC__) || defined(_MSC_VER)
391 HE **hes = _alloca (count * sizeof (HE)); 451 HE **hes = _alloca (count * sizeof (HE));
392#else 452#else
393 HE *hes [count]; // if your compiler dies here, you need to enable C99 mode 453 HE *hes [count]; // if your compiler dies here, you need to enable C99 mode
394#endif 454#endif
421 481
422 FREETMPS; 482 FREETMPS;
423 LEAVE; 483 LEAVE;
424 } 484 }
425 485
426 for (i = 0; i < count; ++i) 486 encode_nl (enc); ++enc->indent;
487
488 while (count--)
427 { 489 {
428 encode_indent (enc); 490 encode_indent (enc);
491 he = hes [count];
429 encode_he (enc, hes [i]); 492 encode_hk (enc, he);
493 encode_sv (enc, expect_false (SvMAGICAL (hv)) ? hv_iterval (hv, he) : HeVAL (he));
430 494
431 if (i < count - 1) 495 if (count)
432 encode_comma (enc); 496 encode_comma (enc);
433 } 497 }
434 498
499 encode_nl (enc); --enc->indent; encode_indent (enc);
500 }
501 }
502 else
503 {
504 if (hv_iterinit (hv) || SvMAGICAL (hv))
505 if ((he = hv_iternext (hv)))
506 {
507 encode_nl (enc); ++enc->indent;
508
509 for (;;)
510 {
435 encode_nl (enc); 511 encode_indent (enc);
512 encode_hk (enc, he);
513 encode_sv (enc, expect_false (SvMAGICAL (hv)) ? hv_iterval (hv, he) : HeVAL (he));
514
515 if (!(he = hv_iternext (hv)))
516 break;
517
518 encode_comma (enc);
519 }
520
521 encode_nl (enc); --enc->indent; encode_indent (enc);
522 }
523 }
524
525 encode_ch (enc, '}');
526}
527
528// encode objects, arrays and special \0=false and \1=true values.
529static void
530encode_rv (enc_t *enc, SV *sv)
531{
532 svtype svt;
533
534 SvGETMAGIC (sv);
535 svt = SvTYPE (sv);
536
537 if (expect_false (SvOBJECT (sv)))
538 {
539 HV *stash = !JSON_SLOW || json_boolean_stash
540 ? json_boolean_stash
541 : gv_stashpv ("JSON::XS::Boolean", 1);
542
543 if (SvSTASH (sv) == stash)
544 {
545 if (SvIV (sv))
546 encode_str (enc, "true", 4, 0);
547 else
548 encode_str (enc, "false", 5, 0);
436 } 549 }
437 else 550 else
438 { 551 {
439 HE *he = hv_iternext (hv); 552#if 0
440 553 if (0 && sv_derived_from (rv, "JSON::Literal"))
441 for (;;)
442 { 554 {
443 encode_indent (enc); 555 // not yet
444 encode_he (enc, he);
445
446 if (!(he = hv_iternext (hv)))
447 break;
448
449 encode_comma (enc);
450 } 556 }
557#endif
558 if (enc->json.flags & F_CONV_BLESSED)
559 {
560 // we re-bless the reference to get overload and other niceties right
561 GV *to_json = gv_fetchmethod_autoload (SvSTASH (sv), "TO_JSON", 0);
451 562
563 if (to_json)
564 {
565 dSP;
566
567 ENTER; SAVETMPS; PUSHMARK (SP);
568 XPUSHs (sv_bless (sv_2mortal (newRV_inc (sv)), SvSTASH (sv)));
569
570 // calling with G_SCALAR ensures that we always get a 1 return value
571 PUTBACK;
572 call_sv ((SV *)GvCV (to_json), G_SCALAR);
573 SPAGAIN;
574
575 // catch this surprisingly common error
576 if (SvROK (TOPs) && SvRV (TOPs) == sv)
577 croak ("%s::TO_JSON method returned same object as was passed instead of a new one", HvNAME (SvSTASH (sv)));
578
579 sv = POPs;
580 PUTBACK;
581
452 encode_nl (enc); 582 encode_sv (enc, sv);
583
584 FREETMPS; LEAVE;
585 }
586 else if (enc->json.flags & F_ALLOW_BLESSED)
587 encode_str (enc, "null", 4, 0);
588 else
589 croak ("encountered object '%s', but neither allow_blessed enabled nor TO_JSON method available on it",
590 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
591 }
592 else if (enc->json.flags & F_ALLOW_BLESSED)
593 encode_str (enc, "null", 4, 0);
594 else
595 croak ("encountered object '%s', but neither allow_blessed nor convert_blessed settings are enabled",
596 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
453 } 597 }
454 } 598 }
455
456 --enc->indent; encode_indent (enc); encode_ch (enc, '}');
457}
458
459// encode objects, arrays and special \0=false and \1=true values.
460static void
461encode_rv (enc_t *enc, SV *sv)
462{
463 svtype svt;
464
465 SvGETMAGIC (sv);
466 svt = SvTYPE (sv);
467
468 if (svt == SVt_PVHV) 599 else if (svt == SVt_PVHV)
469 encode_hv (enc, (HV *)sv); 600 encode_hv (enc, (HV *)sv);
470 else if (svt == SVt_PVAV) 601 else if (svt == SVt_PVAV)
471 encode_av (enc, (AV *)sv); 602 encode_av (enc, (AV *)sv);
472 else if (svt < SVt_PVAV) 603 else if (svt < SVt_PVAV)
473 { 604 {
474 if (SvNIOK (sv) && SvIV (sv) == 0) 605 STRLEN len = 0;
606 char *pv = svt ? SvPV (sv, len) : 0;
607
608 if (len == 1 && *pv == '1')
609 encode_str (enc, "true", 4, 0);
610 else if (len == 1 && *pv == '0')
475 encode_str (enc, "false", 5, 0); 611 encode_str (enc, "false", 5, 0);
476 else if (SvNIOK (sv) && SvIV (sv) == 1)
477 encode_str (enc, "true", 4, 0);
478 else 612 else
479 croak ("cannot encode reference to scalar '%s' unless the scalar is 0 or 1", 613 croak ("cannot encode reference to scalar '%s' unless the scalar is 0 or 1",
480 SvPV_nolen (sv_2mortal (newRV_inc (sv)))); 614 SvPV_nolen (sv_2mortal (newRV_inc (sv))));
481 } 615 }
482 else 616 else
497 encode_str (enc, str, len, SvUTF8 (sv)); 631 encode_str (enc, str, len, SvUTF8 (sv));
498 encode_ch (enc, '"'); 632 encode_ch (enc, '"');
499 } 633 }
500 else if (SvNOKp (sv)) 634 else if (SvNOKp (sv))
501 { 635 {
636 // trust that perl will do the right thing w.r.t. JSON syntax.
502 need (enc, NV_DIG + 32); 637 need (enc, NV_DIG + 32);
503 Gconvert (SvNVX (sv), NV_DIG, 0, enc->cur); 638 Gconvert (SvNVX (sv), NV_DIG, 0, enc->cur);
504 enc->cur += strlen (enc->cur); 639 enc->cur += strlen (enc->cur);
505 } 640 }
506 else if (SvIOKp (sv)) 641 else if (SvIOKp (sv))
507 { 642 {
508 // we assume we can always read an IV as a UV 643 // we assume we can always read an IV as a UV
509 if (SvUV (sv) & ~(UV)0x7fff) 644 if (SvUV (sv) & ~(UV)0x7fff)
510 { 645 {
646 // large integer, use the (rather slow) snprintf way.
511 need (enc, sizeof (UV) * 3); 647 need (enc, sizeof (UV) * 3);
512 enc->cur += 648 enc->cur +=
513 SvIsUV(sv) 649 SvIsUV(sv)
514 ? snprintf (enc->cur, sizeof (UV) * 3, "%"UVuf, (UV)SvUVX (sv)) 650 ? snprintf (enc->cur, sizeof (UV) * 3, "%"UVuf, (UV)SvUVX (sv))
515 : snprintf (enc->cur, sizeof (UV) * 3, "%"IVdf, (IV)SvIVX (sv)); 651 : snprintf (enc->cur, sizeof (UV) * 3, "%"IVdf, (IV)SvIVX (sv));
518 { 654 {
519 // optimise the "small number case" 655 // optimise the "small number case"
520 // code will likely be branchless and use only a single multiplication 656 // code will likely be branchless and use only a single multiplication
521 I32 i = SvIV (sv); 657 I32 i = SvIV (sv);
522 U32 u; 658 U32 u;
659 char digit, nz = 0;
523 660
524 need (enc, 6); 661 need (enc, 6);
525 662
526 *enc->cur = '-'; enc->cur += i < 0 ? 1 : 0; 663 *enc->cur = '-'; enc->cur += i < 0 ? 1 : 0;
527 u = i < 0 ? -i : i; 664 u = i < 0 ? -i : i;
528 665
529 // convert to 4.28 fixed-point representation 666 // convert to 4.28 fixed-point representation
530 u = u * ((0xfffffff + 10000) / 10000); // 10**5, 5 fractional digits 667 u = u * ((0xfffffff + 10000) / 10000); // 10**5, 5 fractional digits
531 668
532 char digit, nz = 0; 669 // now output digit by digit, each time masking out the integer part
533 670 // and multiplying by 5 while moving the decimal point one to the right,
671 // resulting in a net multiplication by 10.
672 // we always write the digit to memory but conditionally increment
673 // the pointer, to ease the usage of conditional move instructions.
534 digit = u >> 28; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0xfffffff) * 5; 674 digit = u >> 28; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0xfffffff) * 5;
535 digit = u >> 27; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x7ffffff) * 5; 675 digit = u >> 27; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x7ffffff) * 5;
536 digit = u >> 26; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x3ffffff) * 5; 676 digit = u >> 26; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x3ffffff) * 5;
537 digit = u >> 25; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x1ffffff) * 5; 677 digit = u >> 25; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x1ffffff) * 5;
538 digit = u >> 24; *enc->cur = digit + '0'; enc->cur += 1; 678 digit = u >> 24; *enc->cur = digit + '0'; enc->cur += 1; // correctly generate '0'
539 } 679 }
540 } 680 }
541 else if (SvROK (sv)) 681 else if (SvROK (sv))
542 encode_rv (enc, SvRV (sv)); 682 encode_rv (enc, SvRV (sv));
543 else if (!SvOK (sv)) 683 else if (!SvOK (sv))
546 croak ("encountered perl type (%s,0x%x) that JSON cannot handle, you might want to report this", 686 croak ("encountered perl type (%s,0x%x) that JSON cannot handle, you might want to report this",
547 SvPV_nolen (sv), SvFLAGS (sv)); 687 SvPV_nolen (sv), SvFLAGS (sv));
548} 688}
549 689
550static SV * 690static SV *
551encode_json (SV *scalar, U32 flags) 691encode_json (SV *scalar, JSON *json)
552{ 692{
553 enc_t enc; 693 enc_t enc;
554 694
555 if (!(flags & F_ALLOW_NONREF) && !SvROK (scalar)) 695 if (!(json->flags & F_ALLOW_NONREF) && !SvROK (scalar))
556 croak ("hash- or arrayref expected (not a simple scalar, use allow_nonref to allow this)"); 696 croak ("hash- or arrayref expected (not a simple scalar, use allow_nonref to allow this)");
557 697
558 enc.flags = flags; 698 enc.json = *json;
559 enc.sv = sv_2mortal (NEWSV (0, INIT_SIZE)); 699 enc.sv = sv_2mortal (NEWSV (0, INIT_SIZE));
560 enc.cur = SvPVX (enc.sv); 700 enc.cur = SvPVX (enc.sv);
561 enc.end = SvEND (enc.sv); 701 enc.end = SvEND (enc.sv);
562 enc.indent = 0; 702 enc.indent = 0;
563 enc.maxdepth = DEC_DEPTH (flags); 703 enc.maxdepth = DEC_DEPTH (enc.json.flags);
704 enc.limit = enc.json.flags & F_ASCII ? 0x000080UL
705 : enc.json.flags & F_LATIN1 ? 0x000100UL
706 : 0x10FFFFUL;
564 707
565 SvPOK_only (enc.sv); 708 SvPOK_only (enc.sv);
566 encode_sv (&enc, scalar); 709 encode_sv (&enc, scalar);
567 710
568 SvCUR_set (enc.sv, enc.cur - SvPVX (enc.sv)); 711 SvCUR_set (enc.sv, enc.cur - SvPVX (enc.sv));
569 *SvEND (enc.sv) = 0; // many xs functions expect a trailing 0 for text strings 712 *SvEND (enc.sv) = 0; // many xs functions expect a trailing 0 for text strings
570 713
571 if (!(flags & (F_ASCII | F_LATIN1 | F_UTF8))) 714 if (!(enc.json.flags & (F_ASCII | F_LATIN1 | F_UTF8)))
572 SvUTF8_on (enc.sv); 715 SvUTF8_on (enc.sv);
573 716
574 if (enc.flags & F_SHRINK) 717 if (enc.json.flags & F_SHRINK)
575 shrink (enc.sv); 718 shrink (enc.sv);
576 719
577 return enc.sv; 720 return enc.sv;
578} 721}
579 722
584typedef struct 727typedef struct
585{ 728{
586 char *cur; // current parser pointer 729 char *cur; // current parser pointer
587 char *end; // end of input string 730 char *end; // end of input string
588 const char *err; // parse error, if != 0 731 const char *err; // parse error, if != 0
589 U32 flags; // F_* 732 JSON json;
590 U32 depth; // recursion depth 733 U32 depth; // recursion depth
591 U32 maxdepth; // recursion depth limit 734 U32 maxdepth; // recursion depth limit
592} dec_t; 735} dec_t;
593 736
594inline void 737INLINE void
738decode_comment (dec_t *dec)
739{
740 // only '#'-style comments allowed a.t.m.
741
742 while (*dec->cur && *dec->cur != 0x0a && *dec->cur != 0x0d)
743 ++dec->cur;
744}
745
746INLINE void
595decode_ws (dec_t *dec) 747decode_ws (dec_t *dec)
596{ 748{
597 for (;;) 749 for (;;)
598 { 750 {
599 char ch = *dec->cur; 751 char ch = *dec->cur;
600 752
601 if (ch > 0x20 753 if (ch > 0x20)
754 {
755 if (expect_false (ch == '#'))
756 {
757 if (dec->json.flags & F_RELAXED)
758 decode_comment (dec);
759 else
760 break;
761 }
762 else
763 break;
764 }
602 || (ch != 0x20 && ch != 0x0a && ch != 0x0d && ch != 0x09)) 765 else if (ch != 0x20 && ch != 0x0a && ch != 0x0d && ch != 0x09)
603 break; 766 break; // parse error, but let higher level handle it, gives better error messages
604 767
605 ++dec->cur; 768 ++dec->cur;
606 } 769 }
607} 770}
608 771
625decode_4hex (dec_t *dec) 788decode_4hex (dec_t *dec)
626{ 789{
627 signed char d1, d2, d3, d4; 790 signed char d1, d2, d3, d4;
628 unsigned char *cur = (unsigned char *)dec->cur; 791 unsigned char *cur = (unsigned char *)dec->cur;
629 792
630 d1 = decode_hexdigit [cur [0]]; if (expect_false (d1 < 0)) ERR ("four hexadecimal digits expected"); 793 d1 = decode_hexdigit [cur [0]]; if (expect_false (d1 < 0)) ERR ("exactly four hexadecimal digits expected");
631 d2 = decode_hexdigit [cur [1]]; if (expect_false (d2 < 0)) ERR ("four hexadecimal digits expected"); 794 d2 = decode_hexdigit [cur [1]]; if (expect_false (d2 < 0)) ERR ("exactly four hexadecimal digits expected");
632 d3 = decode_hexdigit [cur [2]]; if (expect_false (d3 < 0)) ERR ("four hexadecimal digits expected"); 795 d3 = decode_hexdigit [cur [2]]; if (expect_false (d3 < 0)) ERR ("exactly four hexadecimal digits expected");
633 d4 = decode_hexdigit [cur [3]]; if (expect_false (d4 < 0)) ERR ("four hexadecimal digits expected"); 796 d4 = decode_hexdigit [cur [3]]; if (expect_false (d4 < 0)) ERR ("exactly four hexadecimal digits expected");
634 797
635 dec->cur += 4; 798 dec->cur += 4;
636 799
637 return ((UV)d1) << 12 800 return ((UV)d1) << 12
638 | ((UV)d2) << 8 801 | ((UV)d2) << 8
714 877
715 if (hi >= 0x80) 878 if (hi >= 0x80)
716 { 879 {
717 utf8 = 1; 880 utf8 = 1;
718 881
719 cur = (char *)uvuni_to_utf8_flags (cur, hi, 0); 882 cur = encode_utf8 (cur, hi);
720 } 883 }
721 else 884 else
722 *cur++ = hi; 885 *cur++ = hi;
723 } 886 }
724 break; 887 break;
857 is_nv = 1; 1020 is_nv = 1;
858 } 1021 }
859 1022
860 if (!is_nv) 1023 if (!is_nv)
861 { 1024 {
1025 int len = dec->cur - start;
1026
862 // special case the rather common 1..4-digit-int case, assumes 32 bit ints or so 1027 // special case the rather common 1..5-digit-int case
863 if (*start == '-') 1028 if (*start == '-')
864 switch (dec->cur - start) 1029 switch (len)
865 { 1030 {
866 case 2: return newSViv (-( start [1] - '0' )); 1031 case 2: return newSViv (-( start [1] - '0' * 1));
867 case 3: return newSViv (-( start [1] * 10 + start [2] - '0' * 11)); 1032 case 3: return newSViv (-( start [1] * 10 + start [2] - '0' * 11));
868 case 4: return newSViv (-( start [1] * 100 + start [2] * 10 + start [3] - '0' * 111)); 1033 case 4: return newSViv (-( start [1] * 100 + start [2] * 10 + start [3] - '0' * 111));
869 case 5: return newSViv (-(start [1] * 1000 + start [2] * 100 + start [3] * 10 + start [4] - '0' * 1111)); 1034 case 5: return newSViv (-( start [1] * 1000 + start [2] * 100 + start [3] * 10 + start [4] - '0' * 1111));
1035 case 6: return newSViv (-(start [1] * 10000 + start [2] * 1000 + start [3] * 100 + start [4] * 10 + start [5] - '0' * 11111));
870 } 1036 }
871 else 1037 else
872 switch (dec->cur - start) 1038 switch (len)
873 { 1039 {
874 case 1: return newSViv ( start [0] - '0' ); 1040 case 1: return newSViv ( start [0] - '0' * 1);
875 case 2: return newSViv ( start [0] * 10 + start [1] - '0' * 11); 1041 case 2: return newSViv ( start [0] * 10 + start [1] - '0' * 11);
876 case 3: return newSViv ( start [0] * 100 + start [1] * 10 + start [2] - '0' * 111); 1042 case 3: return newSViv ( start [0] * 100 + start [1] * 10 + start [2] - '0' * 111);
877 case 4: return newSViv ( start [0] * 1000 + start [1] * 100 + start [2] * 10 + start [3] - '0' * 1111); 1043 case 4: return newSViv ( start [0] * 1000 + start [1] * 100 + start [2] * 10 + start [3] - '0' * 1111);
1044 case 5: return newSViv ( start [0] * 10000 + start [1] * 1000 + start [2] * 100 + start [3] * 10 + start [4] - '0' * 11111);
878 } 1045 }
879 1046
880 { 1047 {
881 UV uv; 1048 UV uv;
882 int numtype = grok_number (start, dec->cur - start, &uv); 1049 int numtype = grok_number (start, len, &uv);
883 if (numtype & IS_NUMBER_IN_UV) 1050 if (numtype & IS_NUMBER_IN_UV)
884 if (numtype & IS_NUMBER_NEG) 1051 if (numtype & IS_NUMBER_NEG)
885 { 1052 {
886 if (uv < (UV)IV_MIN) 1053 if (uv < (UV)IV_MIN)
887 return newSViv (-(IV)uv); 1054 return newSViv (-(IV)uv);
888 } 1055 }
889 else 1056 else
890 return newSVuv (uv); 1057 return newSVuv (uv);
891 } 1058 }
892 }
893 1059
1060 len -= *start == '-' ? 1 : 0;
1061
1062 // does not fit into IV or UV, try NV
1063 if ((sizeof (NV) == sizeof (double) && DBL_DIG >= len)
1064 #if defined (LDBL_DIG)
1065 || (sizeof (NV) == sizeof (long double) && LDBL_DIG >= len)
1066 #endif
1067 )
1068 // fits into NV without loss of precision
1069 return newSVnv (Atof (start));
1070
1071 // everything else fails, convert it to a string
1072 return newSVpvn (start, dec->cur - start);
1073 }
1074
1075 // loss of precision here
894 return newSVnv (Atof (start)); 1076 return newSVnv (Atof (start));
895 1077
896fail: 1078fail:
897 return 0; 1079 return 0;
898} 1080}
928 1110
929 if (*dec->cur != ',') 1111 if (*dec->cur != ',')
930 ERR (", or ] expected while parsing array"); 1112 ERR (", or ] expected while parsing array");
931 1113
932 ++dec->cur; 1114 ++dec->cur;
1115
1116 decode_ws (dec);
1117
1118 if (*dec->cur == ']' && dec->json.flags & F_RELAXED)
1119 {
1120 ++dec->cur;
1121 break;
1122 }
933 } 1123 }
934 1124
935 DEC_DEC_DEPTH; 1125 DEC_DEC_DEPTH;
936 return newRV_noinc ((SV *)av); 1126 return newRV_noinc ((SV *)av);
937 1127
942} 1132}
943 1133
944static SV * 1134static SV *
945decode_hv (dec_t *dec) 1135decode_hv (dec_t *dec)
946{ 1136{
1137 SV *sv;
947 HV *hv = newHV (); 1138 HV *hv = newHV ();
948 1139
949 DEC_INC_DEPTH; 1140 DEC_INC_DEPTH;
950 decode_ws (dec); 1141 decode_ws (dec);
951 1142
952 if (*dec->cur == '}') 1143 if (*dec->cur == '}')
953 ++dec->cur; 1144 ++dec->cur;
954 else 1145 else
955 for (;;) 1146 for (;;)
956 { 1147 {
1148 EXPECT_CH ('"');
1149
1150 // heuristic: assume that
1151 // a) decode_str + hv_store_ent are abysmally slow.
1152 // b) most hash keys are short, simple ascii text.
1153 // => try to "fast-match" such strings to avoid
1154 // the overhead of decode_str + hv_store_ent.
1155 {
957 SV *key, *value; 1156 SV *value;
1157 char *p = dec->cur;
1158 char *e = p + 24; // only try up to 24 bytes
958 1159
959 decode_ws (dec); EXPECT_CH ('"'); 1160 for (;;)
960
961 key = decode_str (dec);
962 if (!key)
963 goto fail;
964
965 decode_ws (dec); EXPECT_CH (':');
966
967 value = decode_sv (dec);
968 if (!value)
969 { 1161 {
1162 // the >= 0x80 is true on most architectures
1163 if (p == e || *p < 0x20 || *p >= 0x80 || *p == '\\')
1164 {
1165 // slow path, back up and use decode_str
1166 SV *key = decode_str (dec);
1167 if (!key)
1168 goto fail;
1169
1170 decode_ws (dec); EXPECT_CH (':');
1171
1172 decode_ws (dec);
1173 value = decode_sv (dec);
1174 if (!value)
1175 {
1176 SvREFCNT_dec (key);
1177 goto fail;
1178 }
1179
1180 hv_store_ent (hv, key, value, 0);
970 SvREFCNT_dec (key); 1181 SvREFCNT_dec (key);
1182
1183 break;
1184 }
1185 else if (*p == '"')
1186 {
1187 // fast path, got a simple key
1188 char *key = dec->cur;
1189 int len = p - key;
1190 dec->cur = p + 1;
1191
1192 decode_ws (dec); EXPECT_CH (':');
1193
1194 decode_ws (dec);
1195 value = decode_sv (dec);
1196 if (!value)
971 goto fail; 1197 goto fail;
1198
1199 hv_store (hv, key, len, value, 0);
1200
1201 break;
1202 }
1203
1204 ++p;
972 } 1205 }
973 1206 }
974 hv_store_ent (hv, key, value, 0);
975 SvREFCNT_dec (key);
976 1207
977 decode_ws (dec); 1208 decode_ws (dec);
978 1209
979 if (*dec->cur == '}') 1210 if (*dec->cur == '}')
980 { 1211 {
984 1215
985 if (*dec->cur != ',') 1216 if (*dec->cur != ',')
986 ERR (", or } expected while parsing object/hash"); 1217 ERR (", or } expected while parsing object/hash");
987 1218
988 ++dec->cur; 1219 ++dec->cur;
1220
1221 decode_ws (dec);
1222
1223 if (*dec->cur == '}' && dec->json.flags & F_RELAXED)
1224 {
1225 ++dec->cur;
1226 break;
1227 }
989 } 1228 }
990 1229
991 DEC_DEC_DEPTH; 1230 DEC_DEC_DEPTH;
992 return newRV_noinc ((SV *)hv); 1231 sv = newRV_noinc ((SV *)hv);
1232
1233 // check filter callbacks
1234 if (dec->json.flags & F_HOOK)
1235 {
1236 if (dec->json.cb_sk_object && HvKEYS (hv) == 1)
1237 {
1238 HE *cb, *he;
1239
1240 hv_iterinit (hv);
1241 he = hv_iternext (hv);
1242 hv_iterinit (hv);
1243
1244 // the next line creates a mortal sv each time its called.
1245 // might want to optimise this for common cases.
1246 cb = hv_fetch_ent (dec->json.cb_sk_object, hv_iterkeysv (he), 0, 0);
1247
1248 if (cb)
1249 {
1250 dSP;
1251 int count;
1252
1253 ENTER; SAVETMPS; PUSHMARK (SP);
1254 XPUSHs (HeVAL (he));
1255
1256 PUTBACK; count = call_sv (HeVAL (cb), G_ARRAY); SPAGAIN;
1257
1258 if (count == 1)
1259 {
1260 sv = newSVsv (POPs);
1261 FREETMPS; LEAVE;
1262 return sv;
1263 }
1264
1265 FREETMPS; LEAVE;
1266 }
1267 }
1268
1269 if (dec->json.cb_object)
1270 {
1271 dSP;
1272 int count;
1273
1274 ENTER; SAVETMPS; PUSHMARK (SP);
1275 XPUSHs (sv_2mortal (sv));
1276
1277 PUTBACK; count = call_sv (dec->json.cb_object, G_ARRAY); SPAGAIN;
1278
1279 if (count == 1)
1280 {
1281 sv = newSVsv (POPs);
1282 FREETMPS; LEAVE;
1283 return sv;
1284 }
1285
1286 SvREFCNT_inc (sv);
1287 FREETMPS; LEAVE;
1288 }
1289 }
1290
1291 return sv;
993 1292
994fail: 1293fail:
995 SvREFCNT_dec (hv); 1294 SvREFCNT_dec (hv);
996 DEC_DEC_DEPTH; 1295 DEC_DEC_DEPTH;
997 return 0; 1296 return 0;
998} 1297}
999 1298
1000static SV * 1299static SV *
1001decode_sv (dec_t *dec) 1300decode_sv (dec_t *dec)
1002{ 1301{
1003 decode_ws (dec); 1302 // the beauty of JSON: you need exactly one character lookahead
1303 // to parse everything.
1004 switch (*dec->cur) 1304 switch (*dec->cur)
1005 { 1305 {
1006 case '"': ++dec->cur; return decode_str (dec); 1306 case '"': ++dec->cur; return decode_str (dec);
1007 case '[': ++dec->cur; return decode_av (dec); 1307 case '[': ++dec->cur; return decode_av (dec);
1008 case '{': ++dec->cur; return decode_hv (dec); 1308 case '{': ++dec->cur; return decode_hv (dec);
1009 1309
1010 case '-': 1310 case '-':
1011 case '0': case '1': case '2': case '3': case '4': 1311 case '0': case '1': case '2': case '3': case '4':
1012 case '5': case '6': case '7': case '8': case '9': 1312 case '5': case '6': case '7': case '8': case '9':
1013 return decode_num (dec); 1313 return decode_num (dec);
1014 1314
1015 case 't': 1315 case 't':
1016 if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "true", 4)) 1316 if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "true", 4))
1017 { 1317 {
1018 dec->cur += 4; 1318 dec->cur += 4;
1019 return newSViv (1); 1319#if JSON_SLOW
1320 json_true = get_sv ("JSON::XS::true", 1); SvREADONLY_on (json_true);
1321#endif
1322 return SvREFCNT_inc (json_true);
1020 } 1323 }
1021 else 1324 else
1022 ERR ("'true' expected"); 1325 ERR ("'true' expected");
1023 1326
1024 break; 1327 break;
1025 1328
1026 case 'f': 1329 case 'f':
1027 if (dec->end - dec->cur >= 5 && !memcmp (dec->cur, "false", 5)) 1330 if (dec->end - dec->cur >= 5 && !memcmp (dec->cur, "false", 5))
1028 { 1331 {
1029 dec->cur += 5; 1332 dec->cur += 5;
1030 return newSViv (0); 1333#if JSON_SLOW
1334 json_false = get_sv ("JSON::XS::false", 1); SvREADONLY_on (json_false);
1335#endif
1336 return SvREFCNT_inc (json_false);
1031 } 1337 }
1032 else 1338 else
1033 ERR ("'false' expected"); 1339 ERR ("'false' expected");
1034 1340
1035 break; 1341 break;
1053fail: 1359fail:
1054 return 0; 1360 return 0;
1055} 1361}
1056 1362
1057static SV * 1363static SV *
1058decode_json (SV *string, U32 flags, UV *offset_return) 1364decode_json (SV *string, JSON *json, UV *offset_return)
1059{ 1365{
1060 dec_t dec; 1366 dec_t dec;
1061 UV offset; 1367 UV offset;
1062 SV *sv; 1368 SV *sv;
1063 1369
1064 SvGETMAGIC (string); 1370 SvGETMAGIC (string);
1065 SvUPGRADE (string, SVt_PV); 1371 SvUPGRADE (string, SVt_PV);
1066 1372
1373 if (json->flags & F_MAXSIZE && SvCUR (string) > DEC_SIZE (json->flags))
1374 croak ("attempted decode of JSON text of %lu bytes size, but max_size is set to %lu",
1375 (unsigned long)SvCUR (string), (unsigned long)DEC_SIZE (json->flags));
1376
1067 if (flags & F_UTF8) 1377 if (json->flags & F_UTF8)
1068 sv_utf8_downgrade (string, 0); 1378 sv_utf8_downgrade (string, 0);
1069 else 1379 else
1070 sv_utf8_upgrade (string); 1380 sv_utf8_upgrade (string);
1071 1381
1072 SvGROW (string, SvCUR (string) + 1); // should basically be a NOP 1382 SvGROW (string, SvCUR (string) + 1); // should basically be a NOP
1073 1383
1074 dec.flags = flags; 1384 dec.json = *json;
1075 dec.cur = SvPVX (string); 1385 dec.cur = SvPVX (string);
1076 dec.end = SvEND (string); 1386 dec.end = SvEND (string);
1077 dec.err = 0; 1387 dec.err = 0;
1078 dec.depth = 0; 1388 dec.depth = 0;
1079 dec.maxdepth = DEC_DEPTH (dec.flags); 1389 dec.maxdepth = DEC_DEPTH (dec.json.flags);
1390
1391 if (dec.json.cb_object || dec.json.cb_sk_object)
1392 dec.json.flags |= F_HOOK;
1080 1393
1081 *dec.end = 0; // this should basically be a nop, too, but make sure it's there 1394 *dec.end = 0; // this should basically be a nop, too, but make sure it's there
1395
1396 decode_ws (&dec);
1082 sv = decode_sv (&dec); 1397 sv = decode_sv (&dec);
1083 1398
1084 if (!(offset_return || !sv)) 1399 if (!(offset_return || !sv))
1085 { 1400 {
1086 // check for trailing garbage 1401 // check for trailing garbage
1094 } 1409 }
1095 } 1410 }
1096 1411
1097 if (offset_return || !sv) 1412 if (offset_return || !sv)
1098 { 1413 {
1099 offset = dec.flags & F_UTF8 1414 offset = dec.json.flags & F_UTF8
1100 ? dec.cur - SvPVX (string) 1415 ? dec.cur - SvPVX (string)
1101 : utf8_distance (dec.cur, SvPVX (string)); 1416 : utf8_distance (dec.cur, SvPVX (string));
1102 1417
1103 if (offset_return) 1418 if (offset_return)
1104 *offset_return = offset; 1419 *offset_return = offset;
1123 dec.cur != dec.end ? SvPV_nolen (uni) : "(end of string)"); 1438 dec.cur != dec.end ? SvPV_nolen (uni) : "(end of string)");
1124 } 1439 }
1125 1440
1126 sv = sv_2mortal (sv); 1441 sv = sv_2mortal (sv);
1127 1442
1128 if (!(dec.flags & F_ALLOW_NONREF) && !SvROK (sv)) 1443 if (!(dec.json.flags & F_ALLOW_NONREF) && !SvROK (sv))
1129 croak ("JSON text must be an object or array (but found number, string, true, false or null, use allow_nonref to allow this)"); 1444 croak ("JSON text must be an object or array (but found number, string, true, false or null, use allow_nonref to allow this)");
1130 1445
1131 return sv; 1446 return sv;
1132} 1447}
1133 1448
1137MODULE = JSON::XS PACKAGE = JSON::XS 1452MODULE = JSON::XS PACKAGE = JSON::XS
1138 1453
1139BOOT: 1454BOOT:
1140{ 1455{
1141 int i; 1456 int i;
1142
1143 memset (decode_hexdigit, 0xff, 256);
1144 1457
1145 for (i = 0; i < 256; ++i) 1458 for (i = 0; i < 256; ++i)
1146 decode_hexdigit [i] = 1459 decode_hexdigit [i] =
1147 i >= '0' && i <= '9' ? i - '0' 1460 i >= '0' && i <= '9' ? i - '0'
1148 : i >= 'a' && i <= 'f' ? i - 'a' + 10 1461 : i >= 'a' && i <= 'f' ? i - 'a' + 10
1149 : i >= 'A' && i <= 'F' ? i - 'A' + 10 1462 : i >= 'A' && i <= 'F' ? i - 'A' + 10
1150 : -1; 1463 : -1;
1151 1464
1152 json_stash = gv_stashpv ("JSON::XS", 1); 1465 json_stash = gv_stashpv ("JSON::XS" , 1);
1466 json_boolean_stash = gv_stashpv ("JSON::XS::Boolean", 1);
1467
1468 json_true = get_sv ("JSON::XS::true" , 1); SvREADONLY_on (json_true );
1469 json_false = get_sv ("JSON::XS::false", 1); SvREADONLY_on (json_false);
1153} 1470}
1154 1471
1155PROTOTYPES: DISABLE 1472PROTOTYPES: DISABLE
1156 1473
1157SV *new (char *dummy) 1474void CLONE (...)
1158 CODE: 1475 CODE:
1159 RETVAL = sv_bless (newRV_noinc (newSVuv (F_DEFAULT)), json_stash); 1476 json_stash = 0;
1477 json_boolean_stash = 0;
1478
1479void new (char *klass)
1480 PPCODE:
1481{
1482 SV *pv = NEWSV (0, sizeof (JSON));
1483 SvPOK_only (pv);
1484 Zero (SvPVX (pv), 1, JSON);
1485 ((JSON *)SvPVX (pv))->flags = F_DEFAULT;
1486 XPUSHs (sv_2mortal (sv_bless (
1487 newRV_noinc (pv),
1488 strEQ (klass, "JSON::XS") ? JSON_STASH : gv_stashpv (klass, 1)
1489 )));
1490}
1491
1492void ascii (JSON *self, int enable = 1)
1493 ALIAS:
1494 ascii = F_ASCII
1495 latin1 = F_LATIN1
1496 utf8 = F_UTF8
1497 indent = F_INDENT
1498 canonical = F_CANONICAL
1499 space_before = F_SPACE_BEFORE
1500 space_after = F_SPACE_AFTER
1501 pretty = F_PRETTY
1502 allow_nonref = F_ALLOW_NONREF
1503 shrink = F_SHRINK
1504 allow_blessed = F_ALLOW_BLESSED
1505 convert_blessed = F_CONV_BLESSED
1506 relaxed = F_RELAXED
1507 PPCODE:
1508{
1509 if (enable)
1510 self->flags |= ix;
1511 else
1512 self->flags &= ~ix;
1513
1514 XPUSHs (ST (0));
1515}
1516
1517void get_ascii (JSON *self)
1518 ALIAS:
1519 get_ascii = F_ASCII
1520 get_latin1 = F_LATIN1
1521 get_utf8 = F_UTF8
1522 get_indent = F_INDENT
1523 get_canonical = F_CANONICAL
1524 get_space_before = F_SPACE_BEFORE
1525 get_space_after = F_SPACE_AFTER
1526 get_allow_nonref = F_ALLOW_NONREF
1527 get_shrink = F_SHRINK
1528 get_allow_blessed = F_ALLOW_BLESSED
1529 get_convert_blessed = F_CONV_BLESSED
1530 get_relaxed = F_RELAXED
1531 PPCODE:
1532 XPUSHs (boolSV (self->flags & ix));
1533
1534void max_depth (JSON *self, UV max_depth = 0x80000000UL)
1535 PPCODE:
1536{
1537 UV log2 = 0;
1538
1539 if (max_depth > 0x80000000UL) max_depth = 0x80000000UL;
1540
1541 while ((1UL << log2) < max_depth)
1542 ++log2;
1543
1544 self->flags = self->flags & ~F_MAXDEPTH | (log2 << S_MAXDEPTH);
1545
1546 XPUSHs (ST (0));
1547}
1548
1549U32 get_max_depth (JSON *self)
1550 CODE:
1551 RETVAL = DEC_DEPTH (self->flags);
1160 OUTPUT: 1552 OUTPUT:
1161 RETVAL 1553 RETVAL
1162 1554
1163SV *ascii (SV *self, int enable = 1) 1555void max_size (JSON *self, UV max_size = 0)
1164 ALIAS: 1556 PPCODE:
1165 ascii = F_ASCII 1557{
1166 latin1 = F_LATIN1 1558 UV log2 = 0;
1167 utf8 = F_UTF8 1559
1168 indent = F_INDENT 1560 if (max_size > 0x80000000UL) max_size = 0x80000000UL;
1169 canonical = F_CANONICAL 1561 if (max_size == 1) max_size = 2;
1170 space_before = F_SPACE_BEFORE 1562
1171 space_after = F_SPACE_AFTER 1563 while ((1UL << log2) < max_size)
1172 pretty = F_PRETTY 1564 ++log2;
1173 allow_nonref = F_ALLOW_NONREF 1565
1174 shrink = F_SHRINK 1566 self->flags = self->flags & ~F_MAXSIZE | (log2 << S_MAXSIZE);
1567
1568 XPUSHs (ST (0));
1569}
1570
1571int get_max_size (JSON *self)
1175 CODE: 1572 CODE:
1176{ 1573 RETVAL = DEC_SIZE (self->flags);
1177 UV *uv = SvJSON (self);
1178 if (enable)
1179 *uv |= ix;
1180 else
1181 *uv &= ~ix;
1182
1183 RETVAL = newSVsv (self);
1184}
1185 OUTPUT: 1574 OUTPUT:
1186 RETVAL 1575 RETVAL
1187 1576
1188SV *max_depth (SV *self, UV max_depth = 0x80000000UL) 1577void filter_json_object (JSON *self, SV *cb = &PL_sv_undef)
1189 CODE:
1190{
1191 UV *uv = SvJSON (self);
1192 UV log2 = 0;
1193
1194 if (max_depth > 0x80000000UL) max_depth = 0x80000000UL;
1195
1196 while ((1UL << log2) < max_depth)
1197 ++log2;
1198
1199 *uv = *uv & ~F_MAXDEPTH | (log2 << S_MAXDEPTH);
1200
1201 RETVAL = newSVsv (self);
1202}
1203 OUTPUT:
1204 RETVAL
1205
1206void encode (SV *self, SV *scalar)
1207 PPCODE: 1578 PPCODE:
1208 XPUSHs (encode_json (scalar, *SvJSON (self))); 1579{
1580 SvREFCNT_dec (self->cb_object);
1581 self->cb_object = SvOK (cb) ? newSVsv (cb) : 0;
1209 1582
1210void decode (SV *self, SV *jsonstr) 1583 XPUSHs (ST (0));
1584}
1585
1586void filter_json_single_key_object (JSON *self, SV *key, SV *cb = &PL_sv_undef)
1211 PPCODE: 1587 PPCODE:
1588{
1589 if (!self->cb_sk_object)
1590 self->cb_sk_object = newHV ();
1591
1592 if (SvOK (cb))
1593 hv_store_ent (self->cb_sk_object, key, newSVsv (cb), 0);
1594 else
1595 {
1596 hv_delete_ent (self->cb_sk_object, key, G_DISCARD, 0);
1597
1598 if (!HvKEYS (self->cb_sk_object))
1599 {
1600 SvREFCNT_dec (self->cb_sk_object);
1601 self->cb_sk_object = 0;
1602 }
1603 }
1604
1605 XPUSHs (ST (0));
1606}
1607
1608void encode (JSON *self, SV *scalar)
1609 PPCODE:
1610 XPUSHs (encode_json (scalar, self));
1611
1612void decode (JSON *self, SV *jsonstr)
1613 PPCODE:
1212 XPUSHs (decode_json (jsonstr, *SvJSON (self), 0)); 1614 XPUSHs (decode_json (jsonstr, self, 0));
1213 1615
1214void decode_prefix (SV *self, SV *jsonstr) 1616void decode_prefix (JSON *self, SV *jsonstr)
1215 PPCODE: 1617 PPCODE:
1216{ 1618{
1217 UV offset; 1619 UV offset;
1218 EXTEND (SP, 2); 1620 EXTEND (SP, 2);
1219 PUSHs (decode_json (jsonstr, *SvJSON (self), &offset)); 1621 PUSHs (decode_json (jsonstr, self, &offset));
1220 PUSHs (sv_2mortal (newSVuv (offset))); 1622 PUSHs (sv_2mortal (newSVuv (offset)));
1221} 1623}
1222 1624
1625void DESTROY (JSON *self)
1626 CODE:
1627 SvREFCNT_dec (self->cb_sk_object);
1628 SvREFCNT_dec (self->cb_object);
1629
1223PROTOTYPES: ENABLE 1630PROTOTYPES: ENABLE
1224 1631
1225void to_json (SV *scalar) 1632void encode_json (SV *scalar)
1226 ALIAS:
1227 objToJson = 0
1228 PPCODE: 1633 PPCODE:
1634{
1635 JSON json = { F_DEFAULT | F_UTF8 };
1229 XPUSHs (encode_json (scalar, F_DEFAULT | F_UTF8)); 1636 XPUSHs (encode_json (scalar, &json));
1637}
1230 1638
1231void from_json (SV *jsonstr) 1639void decode_json (SV *jsonstr)
1232 ALIAS:
1233 jsonToObj = 0
1234 PPCODE: 1640 PPCODE:
1641{
1642 JSON json = { F_DEFAULT | F_UTF8 };
1235 XPUSHs (decode_json (jsonstr, F_DEFAULT | F_UTF8, 0)); 1643 XPUSHs (decode_json (jsonstr, &json, 0));
1644}
1236 1645

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines