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