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.1 by root, Thu Mar 22 16:40:16 2007 UTC vs.
Revision 1.41 by root, Sat Jun 23 22:53:16 2007 UTC

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

Diff Legend

Removed lines
+ Added lines
< Changed lines
> Changed lines