ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/JSON-XS/XS.xs
Revision: 1.63
Committed: Mon Aug 27 01:49:01 2007 UTC (16 years, 8 months ago) by root
Branch: MAIN
Changes since 1.62: +27 -3 lines
Log Message:
*** empty log message ***

File Contents

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