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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines