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

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines