1 |
root |
1.1 |
#include "EXTERN.h" |
2 |
|
|
#include "perl.h" |
3 |
|
|
#include "XSUB.h" |
4 |
|
|
|
5 |
root |
1.56 |
#include <assert.h> |
6 |
|
|
#include <string.h> |
7 |
|
|
#include <stdlib.h> |
8 |
|
|
#include <stdio.h> |
9 |
root |
1.75 |
#include <limits.h> |
10 |
root |
1.56 |
#include <float.h> |
11 |
root |
1.26 |
|
12 |
|
|
#if defined(__BORLANDC__) || defined(_MSC_VER) |
13 |
|
|
# define snprintf _snprintf // C compilers have this in stdio.h |
14 |
|
|
#endif |
15 |
root |
1.1 |
|
16 |
root |
1.41 |
// some old perls do not have this, try to make it work, no |
17 |
root |
1.99 |
// guarantees, though. if it breaks, you get to keep the pieces. |
18 |
root |
1.41 |
#ifndef UTF8_MAXBYTES |
19 |
|
|
# define UTF8_MAXBYTES 13 |
20 |
|
|
#endif |
21 |
|
|
|
22 |
root |
1.122 |
// compatibility with perl <5.18 |
23 |
|
|
#ifndef HvNAMELEN_get |
24 |
|
|
# define HvNAMELEN_get(hv) strlen (HvNAME (hv)) |
25 |
|
|
#endif |
26 |
|
|
#ifndef HvNAMELEN |
27 |
|
|
# define HvNAMELEN(hv) HvNAMELEN_get (hv) |
28 |
|
|
#endif |
29 |
|
|
#ifndef HvNAMEUTF8 |
30 |
|
|
# define HvNAMEUTF8(hv) 0 |
31 |
|
|
#endif |
32 |
|
|
|
33 |
root |
1.102 |
// three extra for rounding, sign, and end of string |
34 |
|
|
#define IVUV_MAXCHARS (sizeof (UV) * CHAR_BIT * 28 / 93 + 3) |
35 |
root |
1.75 |
|
36 |
root |
1.44 |
#define F_ASCII 0x00000001UL |
37 |
|
|
#define F_LATIN1 0x00000002UL |
38 |
|
|
#define F_UTF8 0x00000004UL |
39 |
|
|
#define F_INDENT 0x00000008UL |
40 |
|
|
#define F_CANONICAL 0x00000010UL |
41 |
|
|
#define F_SPACE_BEFORE 0x00000020UL |
42 |
|
|
#define F_SPACE_AFTER 0x00000040UL |
43 |
|
|
#define F_ALLOW_NONREF 0x00000100UL |
44 |
|
|
#define F_SHRINK 0x00000200UL |
45 |
|
|
#define F_ALLOW_BLESSED 0x00000400UL |
46 |
root |
1.49 |
#define F_CONV_BLESSED 0x00000800UL |
47 |
root |
1.63 |
#define F_RELAXED 0x00001000UL |
48 |
root |
1.84 |
#define F_ALLOW_UNKNOWN 0x00002000UL |
49 |
root |
1.119 |
#define F_ALLOW_TAGS 0x00004000UL |
50 |
root |
1.49 |
#define F_HOOK 0x00080000UL // some hooks exist, so slow-path processing |
51 |
root |
1.18 |
|
52 |
root |
1.2 |
#define F_PRETTY F_INDENT | F_SPACE_BEFORE | F_SPACE_AFTER |
53 |
root |
1.1 |
|
54 |
|
|
#define INIT_SIZE 32 // initial scalar size to be allocated |
55 |
root |
1.12 |
#define INDENT_STEP 3 // spaces per indentation level |
56 |
|
|
|
57 |
root |
1.38 |
#define SHORT_STRING_LEN 16384 // special-case strings of up to this size |
58 |
root |
1.1 |
|
59 |
root |
1.108 |
#define DECODE_WANTS_OCTETS(json) ((json)->flags & F_UTF8) |
60 |
|
|
|
61 |
root |
1.1 |
#define SB do { |
62 |
|
|
#define SE } while (0) |
63 |
|
|
|
64 |
root |
1.35 |
#if __GNUC__ >= 3 |
65 |
root |
1.71 |
# define expect(expr,value) __builtin_expect ((expr), (value)) |
66 |
|
|
# define INLINE static inline |
67 |
root |
1.35 |
#else |
68 |
|
|
# define expect(expr,value) (expr) |
69 |
root |
1.71 |
# define INLINE static |
70 |
root |
1.35 |
#endif |
71 |
|
|
|
72 |
|
|
#define expect_false(expr) expect ((expr) != 0, 0) |
73 |
|
|
#define expect_true(expr) expect ((expr) != 0, 1) |
74 |
|
|
|
75 |
root |
1.72 |
#define IN_RANGE_INC(type,val,beg,end) \ |
76 |
|
|
((unsigned type)((unsigned type)(val) - (unsigned type)(beg)) \ |
77 |
|
|
<= (unsigned type)((unsigned type)(end) - (unsigned type)(beg))) |
78 |
|
|
|
79 |
root |
1.85 |
#define ERR_NESTING_EXCEEDED "json text or perl structure exceeds maximum nesting level (max_depth set too low?)" |
80 |
|
|
|
81 |
root |
1.57 |
#ifdef USE_ITHREADS |
82 |
|
|
# define JSON_SLOW 1 |
83 |
root |
1.59 |
# define JSON_STASH (json_stash ? json_stash : gv_stashpv ("JSON::XS", 1)) |
84 |
root |
1.126 |
# define BOOL_STASH (bool_stash ? bool_stash : gv_stashpv ("Types::Serialiser::Boolean", 1)) |
85 |
root |
1.57 |
#else |
86 |
root |
1.58 |
# define JSON_SLOW 0 |
87 |
root |
1.59 |
# define JSON_STASH json_stash |
88 |
root |
1.126 |
# define BOOL_STASH bool_stash |
89 |
root |
1.57 |
#endif |
90 |
|
|
|
91 |
root |
1.115 |
// the amount of HEs to allocate on the stack, when sorting keys |
92 |
|
|
#define STACK_HES 64 |
93 |
|
|
|
94 |
root |
1.126 |
static HV *json_stash, *bool_stash; // JSON::XS::, Types::Serialiser::Boolean:: |
95 |
|
|
static SV *bool_true, *bool_false, *sv_json; |
96 |
root |
1.1 |
|
97 |
root |
1.77 |
enum { |
98 |
|
|
INCR_M_WS = 0, // initial whitespace skipping, must be 0 |
99 |
|
|
INCR_M_STR, // inside string |
100 |
|
|
INCR_M_BS, // inside backslash |
101 |
root |
1.103 |
INCR_M_C0, // inside comment in initial whitespace sequence |
102 |
|
|
INCR_M_C1, // inside comment in other places |
103 |
root |
1.77 |
INCR_M_JSON // outside anything, count nesting |
104 |
|
|
}; |
105 |
|
|
|
106 |
root |
1.88 |
#define INCR_DONE(json) ((json)->incr_nest <= 0 && (json)->incr_mode == INCR_M_JSON) |
107 |
root |
1.77 |
|
108 |
root |
1.48 |
typedef struct { |
109 |
root |
1.47 |
U32 flags; |
110 |
root |
1.85 |
U32 max_depth; |
111 |
|
|
STRLEN max_size; |
112 |
|
|
|
113 |
root |
1.52 |
SV *cb_object; |
114 |
|
|
HV *cb_sk_object; |
115 |
root |
1.77 |
|
116 |
|
|
// for the incremental parser |
117 |
|
|
SV *incr_text; // the source text so far |
118 |
|
|
STRLEN incr_pos; // the current offset into the text |
119 |
root |
1.88 |
int incr_nest; // {[]}-nesting level |
120 |
root |
1.85 |
unsigned char incr_mode; |
121 |
root |
1.48 |
} JSON; |
122 |
root |
1.47 |
|
123 |
root |
1.85 |
INLINE void |
124 |
|
|
json_init (JSON *json) |
125 |
|
|
{ |
126 |
|
|
Zero (json, 1, JSON); |
127 |
|
|
json->max_depth = 512; |
128 |
|
|
} |
129 |
|
|
|
130 |
root |
1.12 |
///////////////////////////////////////////////////////////////////////////// |
131 |
|
|
// utility functions |
132 |
root |
1.1 |
|
133 |
root |
1.83 |
INLINE SV * |
134 |
|
|
get_bool (const char *name) |
135 |
|
|
{ |
136 |
|
|
SV *sv = get_sv (name, 1); |
137 |
|
|
|
138 |
|
|
SvREADONLY_on (sv); |
139 |
|
|
SvREADONLY_on (SvRV (sv)); |
140 |
|
|
|
141 |
|
|
return sv; |
142 |
|
|
} |
143 |
|
|
|
144 |
root |
1.71 |
INLINE void |
145 |
root |
1.7 |
shrink (SV *sv) |
146 |
|
|
{ |
147 |
|
|
sv_utf8_downgrade (sv, 1); |
148 |
root |
1.87 |
|
149 |
root |
1.12 |
if (SvLEN (sv) > SvCUR (sv) + 1) |
150 |
|
|
{ |
151 |
root |
1.7 |
#ifdef SvPV_shrink_to_cur |
152 |
root |
1.12 |
SvPV_shrink_to_cur (sv); |
153 |
|
|
#elif defined (SvPV_renew) |
154 |
|
|
SvPV_renew (sv, SvCUR (sv) + 1); |
155 |
root |
1.7 |
#endif |
156 |
root |
1.12 |
} |
157 |
root |
1.7 |
} |
158 |
|
|
|
159 |
root |
1.13 |
// decode an utf-8 character and return it, or (UV)-1 in |
160 |
|
|
// case of an error. |
161 |
|
|
// we special-case "safe" characters from U+80 .. U+7FF, |
162 |
|
|
// but use the very good perl function to parse anything else. |
163 |
|
|
// note that we never call this function for a ascii codepoints |
164 |
root |
1.71 |
INLINE UV |
165 |
root |
1.13 |
decode_utf8 (unsigned char *s, STRLEN len, STRLEN *clen) |
166 |
|
|
{ |
167 |
root |
1.72 |
if (expect_true (len >= 2 |
168 |
|
|
&& IN_RANGE_INC (char, s[0], 0xc2, 0xdf) |
169 |
|
|
&& IN_RANGE_INC (char, s[1], 0x80, 0xbf))) |
170 |
root |
1.13 |
{ |
171 |
|
|
*clen = 2; |
172 |
|
|
return ((s[0] & 0x1f) << 6) | (s[1] & 0x3f); |
173 |
|
|
} |
174 |
|
|
else |
175 |
root |
1.72 |
return utf8n_to_uvuni (s, len, clen, UTF8_CHECK_ONLY); |
176 |
|
|
} |
177 |
|
|
|
178 |
|
|
// likewise for encoding, also never called for ascii codepoints |
179 |
|
|
// this function takes advantage of this fact, although current gccs |
180 |
|
|
// seem to optimise the check for >= 0x80 away anyways |
181 |
|
|
INLINE unsigned char * |
182 |
|
|
encode_utf8 (unsigned char *s, UV ch) |
183 |
|
|
{ |
184 |
root |
1.74 |
if (expect_false (ch < 0x000080)) |
185 |
|
|
*s++ = ch; |
186 |
|
|
else if (expect_true (ch < 0x000800)) |
187 |
|
|
*s++ = 0xc0 | ( ch >> 6), |
188 |
|
|
*s++ = 0x80 | ( ch & 0x3f); |
189 |
|
|
else if ( ch < 0x010000) |
190 |
|
|
*s++ = 0xe0 | ( ch >> 12), |
191 |
|
|
*s++ = 0x80 | ((ch >> 6) & 0x3f), |
192 |
|
|
*s++ = 0x80 | ( ch & 0x3f); |
193 |
|
|
else if ( ch < 0x110000) |
194 |
|
|
*s++ = 0xf0 | ( ch >> 18), |
195 |
|
|
*s++ = 0x80 | ((ch >> 12) & 0x3f), |
196 |
|
|
*s++ = 0x80 | ((ch >> 6) & 0x3f), |
197 |
|
|
*s++ = 0x80 | ( ch & 0x3f); |
198 |
root |
1.72 |
|
199 |
|
|
return s; |
200 |
root |
1.13 |
} |
201 |
|
|
|
202 |
root |
1.96 |
// convert offset pointer to character index, sv must be string |
203 |
|
|
static STRLEN |
204 |
|
|
ptr_to_index (SV *sv, char *offset) |
205 |
|
|
{ |
206 |
|
|
return SvUTF8 (sv) |
207 |
|
|
? utf8_distance (offset, SvPVX (sv)) |
208 |
|
|
: offset - SvPVX (sv); |
209 |
|
|
} |
210 |
|
|
|
211 |
root |
1.1 |
///////////////////////////////////////////////////////////////////////////// |
212 |
root |
1.104 |
// fp hell |
213 |
|
|
|
214 |
|
|
// scan a group of digits, and a trailing exponent |
215 |
|
|
static void |
216 |
root |
1.106 |
json_atof_scan1 (const char *s, NV *accum, int *expo, int postdp, int maxdepth) |
217 |
root |
1.104 |
{ |
218 |
|
|
UV uaccum = 0; |
219 |
|
|
int eaccum = 0; |
220 |
|
|
|
221 |
root |
1.106 |
// if we recurse too deep, skip all remaining digits |
222 |
|
|
// to avoid a stack overflow attack |
223 |
|
|
if (expect_false (--maxdepth <= 0)) |
224 |
|
|
while (((U8)*s - '0') < 10) |
225 |
|
|
++s; |
226 |
|
|
|
227 |
root |
1.104 |
for (;;) |
228 |
|
|
{ |
229 |
|
|
U8 dig = (U8)*s - '0'; |
230 |
|
|
|
231 |
|
|
if (expect_false (dig >= 10)) |
232 |
|
|
{ |
233 |
|
|
if (dig == (U8)((U8)'.' - (U8)'0')) |
234 |
|
|
{ |
235 |
|
|
++s; |
236 |
root |
1.106 |
json_atof_scan1 (s, accum, expo, 1, maxdepth); |
237 |
root |
1.104 |
} |
238 |
|
|
else if ((dig | ' ') == 'e' - '0') |
239 |
|
|
{ |
240 |
|
|
int exp2 = 0; |
241 |
|
|
int neg = 0; |
242 |
|
|
|
243 |
|
|
++s; |
244 |
|
|
|
245 |
|
|
if (*s == '-') |
246 |
|
|
{ |
247 |
|
|
++s; |
248 |
|
|
neg = 1; |
249 |
|
|
} |
250 |
|
|
else if (*s == '+') |
251 |
|
|
++s; |
252 |
|
|
|
253 |
|
|
while ((dig = (U8)*s - '0') < 10) |
254 |
|
|
exp2 = exp2 * 10 + *s++ - '0'; |
255 |
|
|
|
256 |
|
|
*expo += neg ? -exp2 : exp2; |
257 |
|
|
} |
258 |
|
|
|
259 |
|
|
break; |
260 |
|
|
} |
261 |
|
|
|
262 |
|
|
++s; |
263 |
|
|
|
264 |
|
|
uaccum = uaccum * 10 + dig; |
265 |
|
|
++eaccum; |
266 |
|
|
|
267 |
|
|
// if we have too many digits, then recurse for more |
268 |
|
|
// we actually do this for rather few digits |
269 |
|
|
if (uaccum >= (UV_MAX - 9) / 10) |
270 |
|
|
{ |
271 |
|
|
if (postdp) *expo -= eaccum; |
272 |
root |
1.106 |
json_atof_scan1 (s, accum, expo, postdp, maxdepth); |
273 |
root |
1.104 |
if (postdp) *expo += eaccum; |
274 |
|
|
|
275 |
|
|
break; |
276 |
|
|
} |
277 |
|
|
} |
278 |
|
|
|
279 |
root |
1.105 |
// this relies greatly on the quality of the pow () |
280 |
|
|
// implementation of the platform, but a good |
281 |
|
|
// implementation is hard to beat. |
282 |
root |
1.110 |
// (IEEE 754 conformant ones are required to be exact) |
283 |
root |
1.104 |
if (postdp) *expo -= eaccum; |
284 |
root |
1.105 |
*accum += uaccum * Perl_pow (10., *expo); |
285 |
root |
1.104 |
*expo += eaccum; |
286 |
|
|
} |
287 |
|
|
|
288 |
|
|
static NV |
289 |
|
|
json_atof (const char *s) |
290 |
|
|
{ |
291 |
|
|
NV accum = 0.; |
292 |
|
|
int expo = 0; |
293 |
|
|
int neg = 0; |
294 |
|
|
|
295 |
|
|
if (*s == '-') |
296 |
|
|
{ |
297 |
|
|
++s; |
298 |
|
|
neg = 1; |
299 |
|
|
} |
300 |
|
|
|
301 |
root |
1.106 |
// a recursion depth of ten gives us >>500 bits |
302 |
|
|
json_atof_scan1 (s, &accum, &expo, 0, 10); |
303 |
root |
1.104 |
|
304 |
|
|
return neg ? -accum : accum; |
305 |
|
|
} |
306 |
root |
1.126 |
|
307 |
|
|
// target of scalar reference is bool? -1 == nope, 0 == false, 1 == true |
308 |
|
|
static int |
309 |
|
|
ref_bool_type (SV *sv) |
310 |
|
|
{ |
311 |
|
|
svtype svt = SvTYPE (sv); |
312 |
|
|
|
313 |
|
|
if (svt < SVt_PVAV) |
314 |
|
|
{ |
315 |
|
|
STRLEN len = 0; |
316 |
|
|
char *pv = svt ? SvPV (sv, len) : 0; |
317 |
|
|
|
318 |
|
|
if (len == 1) |
319 |
|
|
if (*pv == '1') |
320 |
|
|
return 1; |
321 |
|
|
else if (*pv == '0') |
322 |
|
|
return 0; |
323 |
|
|
|
324 |
|
|
} |
325 |
|
|
|
326 |
|
|
return -1; |
327 |
|
|
} |
328 |
|
|
|
329 |
|
|
// returns whether scalar is not a reference in the sense of allow_nonref |
330 |
|
|
static int |
331 |
|
|
json_nonref (SV *scalar) |
332 |
|
|
{ |
333 |
|
|
if (!SvROK (scalar)) |
334 |
|
|
return 1; |
335 |
|
|
|
336 |
|
|
scalar = SvRV (scalar); |
337 |
|
|
|
338 |
|
|
if (SvSTASH (scalar) == bool_stash) |
339 |
|
|
return 1; |
340 |
|
|
|
341 |
|
|
if (!SvOBJECT (scalar) && ref_bool_type (scalar) >= 0) |
342 |
|
|
return 1; |
343 |
|
|
|
344 |
|
|
return 0; |
345 |
|
|
} |
346 |
|
|
|
347 |
root |
1.104 |
///////////////////////////////////////////////////////////////////////////// |
348 |
root |
1.12 |
// encoder |
349 |
|
|
|
350 |
|
|
// structure used for encoding JSON |
351 |
|
|
typedef struct |
352 |
|
|
{ |
353 |
|
|
char *cur; // SvPVX (sv) + current output position |
354 |
|
|
char *end; // SvEND (sv) |
355 |
|
|
SV *sv; // result scalar |
356 |
root |
1.48 |
JSON json; |
357 |
root |
1.18 |
U32 indent; // indentation level |
358 |
root |
1.71 |
UV limit; // escape character values >= this value when encoding |
359 |
root |
1.12 |
} enc_t; |
360 |
root |
1.1 |
|
361 |
root |
1.71 |
INLINE void |
362 |
root |
1.1 |
need (enc_t *enc, STRLEN len) |
363 |
|
|
{ |
364 |
root |
1.35 |
if (expect_false (enc->cur + len >= enc->end)) |
365 |
root |
1.1 |
{ |
366 |
root |
1.93 |
STRLEN cur = enc->cur - (char *)SvPVX (enc->sv); |
367 |
root |
1.95 |
SvGROW (enc->sv, cur + (len < (cur >> 2) ? cur >> 2 : len) + 1); |
368 |
root |
1.1 |
enc->cur = SvPVX (enc->sv) + cur; |
369 |
root |
1.27 |
enc->end = SvPVX (enc->sv) + SvLEN (enc->sv) - 1; |
370 |
root |
1.1 |
} |
371 |
|
|
} |
372 |
|
|
|
373 |
root |
1.71 |
INLINE void |
374 |
root |
1.1 |
encode_ch (enc_t *enc, char ch) |
375 |
|
|
{ |
376 |
|
|
need (enc, 1); |
377 |
|
|
*enc->cur++ = ch; |
378 |
|
|
} |
379 |
|
|
|
380 |
|
|
static void |
381 |
|
|
encode_str (enc_t *enc, char *str, STRLEN len, int is_utf8) |
382 |
|
|
{ |
383 |
|
|
char *end = str + len; |
384 |
|
|
|
385 |
root |
1.4 |
need (enc, len); |
386 |
|
|
|
387 |
root |
1.1 |
while (str < end) |
388 |
|
|
{ |
389 |
|
|
unsigned char ch = *(unsigned char *)str; |
390 |
root |
1.4 |
|
391 |
root |
1.35 |
if (expect_true (ch >= 0x20 && ch < 0x80)) // most common case |
392 |
root |
1.4 |
{ |
393 |
root |
1.35 |
if (expect_false (ch == '"')) // but with slow exceptions |
394 |
root |
1.6 |
{ |
395 |
|
|
need (enc, len += 1); |
396 |
|
|
*enc->cur++ = '\\'; |
397 |
|
|
*enc->cur++ = '"'; |
398 |
|
|
} |
399 |
root |
1.35 |
else if (expect_false (ch == '\\')) |
400 |
root |
1.6 |
{ |
401 |
|
|
need (enc, len += 1); |
402 |
|
|
*enc->cur++ = '\\'; |
403 |
|
|
*enc->cur++ = '\\'; |
404 |
|
|
} |
405 |
|
|
else |
406 |
|
|
*enc->cur++ = ch; |
407 |
|
|
|
408 |
root |
1.4 |
++str; |
409 |
root |
1.1 |
} |
410 |
|
|
else |
411 |
|
|
{ |
412 |
root |
1.6 |
switch (ch) |
413 |
root |
1.1 |
{ |
414 |
root |
1.6 |
case '\010': need (enc, len += 1); *enc->cur++ = '\\'; *enc->cur++ = 'b'; ++str; break; |
415 |
|
|
case '\011': need (enc, len += 1); *enc->cur++ = '\\'; *enc->cur++ = 't'; ++str; break; |
416 |
|
|
case '\012': need (enc, len += 1); *enc->cur++ = '\\'; *enc->cur++ = 'n'; ++str; break; |
417 |
|
|
case '\014': need (enc, len += 1); *enc->cur++ = '\\'; *enc->cur++ = 'f'; ++str; break; |
418 |
|
|
case '\015': need (enc, len += 1); *enc->cur++ = '\\'; *enc->cur++ = 'r'; ++str; break; |
419 |
root |
1.1 |
|
420 |
root |
1.6 |
default: |
421 |
root |
1.1 |
{ |
422 |
root |
1.6 |
STRLEN clen; |
423 |
|
|
UV uch; |
424 |
|
|
|
425 |
|
|
if (is_utf8) |
426 |
|
|
{ |
427 |
root |
1.13 |
uch = decode_utf8 (str, end - str, &clen); |
428 |
root |
1.6 |
if (clen == (STRLEN)-1) |
429 |
root |
1.9 |
croak ("malformed or illegal unicode character in string [%.11s], cannot convert to JSON", str); |
430 |
root |
1.6 |
} |
431 |
|
|
else |
432 |
|
|
{ |
433 |
|
|
uch = ch; |
434 |
|
|
clen = 1; |
435 |
|
|
} |
436 |
|
|
|
437 |
root |
1.72 |
if (uch < 0x80/*0x20*/ || uch >= enc->limit) |
438 |
root |
1.6 |
{ |
439 |
root |
1.74 |
if (uch >= 0x10000UL) |
440 |
root |
1.6 |
{ |
441 |
root |
1.74 |
if (uch >= 0x110000UL) |
442 |
root |
1.71 |
croak ("out of range codepoint (0x%lx) encountered, unrepresentable in JSON", (unsigned long)uch); |
443 |
|
|
|
444 |
root |
1.6 |
need (enc, len += 11); |
445 |
|
|
sprintf (enc->cur, "\\u%04x\\u%04x", |
446 |
root |
1.10 |
(int)((uch - 0x10000) / 0x400 + 0xD800), |
447 |
|
|
(int)((uch - 0x10000) % 0x400 + 0xDC00)); |
448 |
root |
1.6 |
enc->cur += 12; |
449 |
|
|
} |
450 |
|
|
else |
451 |
|
|
{ |
452 |
|
|
need (enc, len += 5); |
453 |
|
|
*enc->cur++ = '\\'; |
454 |
|
|
*enc->cur++ = 'u'; |
455 |
root |
1.91 |
*enc->cur++ = PL_hexdigit [ uch >> 12 ]; |
456 |
|
|
*enc->cur++ = PL_hexdigit [(uch >> 8) & 15]; |
457 |
|
|
*enc->cur++ = PL_hexdigit [(uch >> 4) & 15]; |
458 |
|
|
*enc->cur++ = PL_hexdigit [(uch >> 0) & 15]; |
459 |
root |
1.6 |
} |
460 |
root |
1.4 |
|
461 |
root |
1.6 |
str += clen; |
462 |
|
|
} |
463 |
root |
1.47 |
else if (enc->json.flags & F_LATIN1) |
464 |
root |
1.30 |
{ |
465 |
|
|
*enc->cur++ = uch; |
466 |
|
|
str += clen; |
467 |
|
|
} |
468 |
root |
1.6 |
else if (is_utf8) |
469 |
|
|
{ |
470 |
|
|
need (enc, len += clen); |
471 |
|
|
do |
472 |
|
|
{ |
473 |
|
|
*enc->cur++ = *str++; |
474 |
|
|
} |
475 |
|
|
while (--clen); |
476 |
|
|
} |
477 |
|
|
else |
478 |
|
|
{ |
479 |
root |
1.28 |
need (enc, len += UTF8_MAXBYTES - 1); // never more than 11 bytes needed |
480 |
root |
1.72 |
enc->cur = encode_utf8 (enc->cur, uch); |
481 |
root |
1.6 |
++str; |
482 |
|
|
} |
483 |
root |
1.5 |
} |
484 |
root |
1.4 |
} |
485 |
root |
1.1 |
} |
486 |
|
|
|
487 |
|
|
--len; |
488 |
|
|
} |
489 |
|
|
} |
490 |
|
|
|
491 |
root |
1.71 |
INLINE void |
492 |
root |
1.12 |
encode_indent (enc_t *enc) |
493 |
|
|
{ |
494 |
root |
1.47 |
if (enc->json.flags & F_INDENT) |
495 |
root |
1.12 |
{ |
496 |
|
|
int spaces = enc->indent * INDENT_STEP; |
497 |
|
|
|
498 |
|
|
need (enc, spaces); |
499 |
|
|
memset (enc->cur, ' ', spaces); |
500 |
|
|
enc->cur += spaces; |
501 |
|
|
} |
502 |
|
|
} |
503 |
|
|
|
504 |
root |
1.71 |
INLINE void |
505 |
root |
1.12 |
encode_space (enc_t *enc) |
506 |
|
|
{ |
507 |
|
|
need (enc, 1); |
508 |
|
|
encode_ch (enc, ' '); |
509 |
|
|
} |
510 |
|
|
|
511 |
root |
1.71 |
INLINE void |
512 |
root |
1.12 |
encode_nl (enc_t *enc) |
513 |
|
|
{ |
514 |
root |
1.47 |
if (enc->json.flags & F_INDENT) |
515 |
root |
1.12 |
{ |
516 |
|
|
need (enc, 1); |
517 |
|
|
encode_ch (enc, '\n'); |
518 |
|
|
} |
519 |
|
|
} |
520 |
|
|
|
521 |
root |
1.71 |
INLINE void |
522 |
root |
1.12 |
encode_comma (enc_t *enc) |
523 |
|
|
{ |
524 |
|
|
encode_ch (enc, ','); |
525 |
root |
1.1 |
|
526 |
root |
1.47 |
if (enc->json.flags & F_INDENT) |
527 |
root |
1.12 |
encode_nl (enc); |
528 |
root |
1.47 |
else if (enc->json.flags & F_SPACE_AFTER) |
529 |
root |
1.12 |
encode_space (enc); |
530 |
|
|
} |
531 |
root |
1.1 |
|
532 |
|
|
static void encode_sv (enc_t *enc, SV *sv); |
533 |
|
|
|
534 |
|
|
static void |
535 |
|
|
encode_av (enc_t *enc, AV *av) |
536 |
|
|
{ |
537 |
|
|
int i, len = av_len (av); |
538 |
|
|
|
539 |
root |
1.85 |
if (enc->indent >= enc->json.max_depth) |
540 |
|
|
croak (ERR_NESTING_EXCEEDED); |
541 |
root |
1.21 |
|
542 |
root |
1.65 |
encode_ch (enc, '['); |
543 |
root |
1.117 |
|
544 |
root |
1.65 |
if (len >= 0) |
545 |
root |
1.1 |
{ |
546 |
root |
1.65 |
encode_nl (enc); ++enc->indent; |
547 |
root |
1.55 |
|
548 |
root |
1.65 |
for (i = 0; i <= len; ++i) |
549 |
|
|
{ |
550 |
|
|
SV **svp = av_fetch (av, i, 0); |
551 |
root |
1.55 |
|
552 |
root |
1.65 |
encode_indent (enc); |
553 |
root |
1.1 |
|
554 |
root |
1.65 |
if (svp) |
555 |
|
|
encode_sv (enc, *svp); |
556 |
|
|
else |
557 |
|
|
encode_str (enc, "null", 4, 0); |
558 |
root |
1.1 |
|
559 |
root |
1.65 |
if (i < len) |
560 |
|
|
encode_comma (enc); |
561 |
|
|
} |
562 |
root |
1.1 |
|
563 |
root |
1.65 |
encode_nl (enc); --enc->indent; encode_indent (enc); |
564 |
|
|
} |
565 |
root |
1.117 |
|
566 |
root |
1.65 |
encode_ch (enc, ']'); |
567 |
root |
1.1 |
} |
568 |
|
|
|
569 |
|
|
static void |
570 |
root |
1.61 |
encode_hk (enc_t *enc, HE *he) |
571 |
root |
1.1 |
{ |
572 |
|
|
encode_ch (enc, '"'); |
573 |
|
|
|
574 |
|
|
if (HeKLEN (he) == HEf_SVKEY) |
575 |
|
|
{ |
576 |
|
|
SV *sv = HeSVKEY (he); |
577 |
|
|
STRLEN len; |
578 |
root |
1.4 |
char *str; |
579 |
root |
1.117 |
|
580 |
root |
1.4 |
SvGETMAGIC (sv); |
581 |
|
|
str = SvPV (sv, len); |
582 |
root |
1.1 |
|
583 |
|
|
encode_str (enc, str, len, SvUTF8 (sv)); |
584 |
|
|
} |
585 |
|
|
else |
586 |
|
|
encode_str (enc, HeKEY (he), HeKLEN (he), HeKUTF8 (he)); |
587 |
|
|
|
588 |
|
|
encode_ch (enc, '"'); |
589 |
|
|
|
590 |
root |
1.47 |
if (enc->json.flags & F_SPACE_BEFORE) encode_space (enc); |
591 |
root |
1.1 |
encode_ch (enc, ':'); |
592 |
root |
1.47 |
if (enc->json.flags & F_SPACE_AFTER ) encode_space (enc); |
593 |
root |
1.1 |
} |
594 |
|
|
|
595 |
|
|
// compare hash entries, used when all keys are bytestrings |
596 |
|
|
static int |
597 |
|
|
he_cmp_fast (const void *a_, const void *b_) |
598 |
|
|
{ |
599 |
|
|
int cmp; |
600 |
|
|
|
601 |
|
|
HE *a = *(HE **)a_; |
602 |
|
|
HE *b = *(HE **)b_; |
603 |
|
|
|
604 |
|
|
STRLEN la = HeKLEN (a); |
605 |
|
|
STRLEN lb = HeKLEN (b); |
606 |
|
|
|
607 |
root |
1.61 |
if (!(cmp = memcmp (HeKEY (b), HeKEY (a), lb < la ? lb : la))) |
608 |
|
|
cmp = lb - la; |
609 |
root |
1.1 |
|
610 |
|
|
return cmp; |
611 |
|
|
} |
612 |
|
|
|
613 |
|
|
// compare hash entries, used when some keys are sv's or utf-x |
614 |
|
|
static int |
615 |
|
|
he_cmp_slow (const void *a, const void *b) |
616 |
|
|
{ |
617 |
root |
1.61 |
return sv_cmp (HeSVKEY_force (*(HE **)b), HeSVKEY_force (*(HE **)a)); |
618 |
root |
1.1 |
} |
619 |
|
|
|
620 |
|
|
static void |
621 |
|
|
encode_hv (enc_t *enc, HV *hv) |
622 |
|
|
{ |
623 |
root |
1.61 |
HE *he; |
624 |
root |
1.1 |
|
625 |
root |
1.85 |
if (enc->indent >= enc->json.max_depth) |
626 |
|
|
croak (ERR_NESTING_EXCEEDED); |
627 |
root |
1.21 |
|
628 |
root |
1.65 |
encode_ch (enc, '{'); |
629 |
root |
1.1 |
|
630 |
root |
1.61 |
// for canonical output we have to sort by keys first |
631 |
|
|
// actually, this is mostly due to the stupid so-called |
632 |
root |
1.92 |
// security workaround added somewhere in 5.8.x |
633 |
root |
1.61 |
// that randomises hash orderings |
634 |
root |
1.98 |
if (enc->json.flags & F_CANONICAL && !SvRMAGICAL (hv)) |
635 |
root |
1.1 |
{ |
636 |
root |
1.61 |
int count = hv_iterinit (hv); |
637 |
|
|
|
638 |
|
|
if (SvMAGICAL (hv)) |
639 |
|
|
{ |
640 |
|
|
// need to count by iterating. could improve by dynamically building the vector below |
641 |
|
|
// but I don't care for the speed of this special case. |
642 |
|
|
// note also that we will run into undefined behaviour when the two iterations |
643 |
|
|
// do not result in the same count, something I might care for in some later release. |
644 |
|
|
|
645 |
|
|
count = 0; |
646 |
|
|
while (hv_iternext (hv)) |
647 |
|
|
++count; |
648 |
|
|
|
649 |
|
|
hv_iterinit (hv); |
650 |
|
|
} |
651 |
|
|
|
652 |
|
|
if (count) |
653 |
root |
1.1 |
{ |
654 |
root |
1.61 |
int i, fast = 1; |
655 |
root |
1.115 |
HE *hes_stack [STACK_HES]; |
656 |
|
|
HE **hes = hes_stack; |
657 |
root |
1.117 |
|
658 |
root |
1.115 |
// allocate larger arrays on the heap |
659 |
|
|
if (count > STACK_HES) |
660 |
|
|
{ |
661 |
|
|
SV *sv = sv_2mortal (NEWSV (0, count * sizeof (*hes))); |
662 |
|
|
hes = (HE **)SvPVX (sv); |
663 |
|
|
} |
664 |
root |
1.1 |
|
665 |
|
|
i = 0; |
666 |
|
|
while ((he = hv_iternext (hv))) |
667 |
|
|
{ |
668 |
|
|
hes [i++] = he; |
669 |
|
|
if (HeKLEN (he) < 0 || HeKUTF8 (he)) |
670 |
|
|
fast = 0; |
671 |
|
|
} |
672 |
|
|
|
673 |
|
|
assert (i == count); |
674 |
|
|
|
675 |
|
|
if (fast) |
676 |
|
|
qsort (hes, count, sizeof (HE *), he_cmp_fast); |
677 |
|
|
else |
678 |
|
|
{ |
679 |
root |
1.8 |
// hack to forcefully disable "use bytes" |
680 |
|
|
COP cop = *PL_curcop; |
681 |
root |
1.1 |
cop.op_private = 0; |
682 |
root |
1.8 |
|
683 |
|
|
ENTER; |
684 |
|
|
SAVETMPS; |
685 |
|
|
|
686 |
|
|
SAVEVPTR (PL_curcop); |
687 |
root |
1.1 |
PL_curcop = &cop; |
688 |
|
|
|
689 |
|
|
qsort (hes, count, sizeof (HE *), he_cmp_slow); |
690 |
root |
1.8 |
|
691 |
root |
1.1 |
FREETMPS; |
692 |
root |
1.8 |
LEAVE; |
693 |
root |
1.1 |
} |
694 |
|
|
|
695 |
root |
1.65 |
encode_nl (enc); ++enc->indent; |
696 |
|
|
|
697 |
root |
1.61 |
while (count--) |
698 |
root |
1.1 |
{ |
699 |
root |
1.12 |
encode_indent (enc); |
700 |
root |
1.61 |
he = hes [count]; |
701 |
|
|
encode_hk (enc, he); |
702 |
root |
1.62 |
encode_sv (enc, expect_false (SvMAGICAL (hv)) ? hv_iterval (hv, he) : HeVAL (he)); |
703 |
root |
1.1 |
|
704 |
root |
1.61 |
if (count) |
705 |
root |
1.12 |
encode_comma (enc); |
706 |
root |
1.1 |
} |
707 |
root |
1.65 |
|
708 |
|
|
encode_nl (enc); --enc->indent; encode_indent (enc); |
709 |
root |
1.1 |
} |
710 |
root |
1.61 |
} |
711 |
|
|
else |
712 |
|
|
{ |
713 |
|
|
if (hv_iterinit (hv) || SvMAGICAL (hv)) |
714 |
|
|
if ((he = hv_iternext (hv))) |
715 |
root |
1.65 |
{ |
716 |
|
|
encode_nl (enc); ++enc->indent; |
717 |
|
|
|
718 |
|
|
for (;;) |
719 |
|
|
{ |
720 |
|
|
encode_indent (enc); |
721 |
|
|
encode_hk (enc, he); |
722 |
|
|
encode_sv (enc, expect_false (SvMAGICAL (hv)) ? hv_iterval (hv, he) : HeVAL (he)); |
723 |
|
|
|
724 |
|
|
if (!(he = hv_iternext (hv))) |
725 |
|
|
break; |
726 |
root |
1.1 |
|
727 |
root |
1.65 |
encode_comma (enc); |
728 |
|
|
} |
729 |
root |
1.1 |
|
730 |
root |
1.65 |
encode_nl (enc); --enc->indent; encode_indent (enc); |
731 |
|
|
} |
732 |
root |
1.61 |
} |
733 |
root |
1.1 |
|
734 |
root |
1.65 |
encode_ch (enc, '}'); |
735 |
root |
1.1 |
} |
736 |
|
|
|
737 |
root |
1.21 |
// encode objects, arrays and special \0=false and \1=true values. |
738 |
|
|
static void |
739 |
|
|
encode_rv (enc_t *enc, SV *sv) |
740 |
|
|
{ |
741 |
root |
1.25 |
svtype svt; |
742 |
root |
1.120 |
GV *method; |
743 |
root |
1.25 |
|
744 |
root |
1.21 |
SvGETMAGIC (sv); |
745 |
root |
1.25 |
svt = SvTYPE (sv); |
746 |
root |
1.21 |
|
747 |
root |
1.44 |
if (expect_false (SvOBJECT (sv))) |
748 |
|
|
{ |
749 |
root |
1.119 |
HV *stash = SvSTASH (sv); |
750 |
root |
1.57 |
|
751 |
root |
1.126 |
if (stash == bool_stash) |
752 |
root |
1.44 |
{ |
753 |
root |
1.51 |
if (SvIV (sv)) |
754 |
|
|
encode_str (enc, "true", 4, 0); |
755 |
|
|
else |
756 |
root |
1.44 |
encode_str (enc, "false", 5, 0); |
757 |
|
|
} |
758 |
root |
1.120 |
else if ((enc->json.flags & F_ALLOW_TAGS) && (method = gv_fetchmethod_autoload (stash, "FREEZE", 0))) |
759 |
root |
1.44 |
{ |
760 |
root |
1.120 |
int count; |
761 |
|
|
dSP; |
762 |
|
|
|
763 |
root |
1.125 |
ENTER; SAVETMPS; |
764 |
|
|
SAVESTACK_POS (); |
765 |
|
|
PUSHMARK (SP); |
766 |
root |
1.120 |
EXTEND (SP, 2); |
767 |
|
|
// we re-bless the reference to get overload and other niceties right |
768 |
|
|
PUSHs (sv_bless (sv_2mortal (newRV_inc (sv)), stash)); |
769 |
|
|
PUSHs (sv_json); |
770 |
|
|
|
771 |
|
|
PUTBACK; |
772 |
|
|
count = call_sv ((SV *)GvCV (method), G_ARRAY); |
773 |
|
|
SPAGAIN; |
774 |
|
|
|
775 |
|
|
// catch this surprisingly common error |
776 |
|
|
if (SvROK (TOPs) && SvRV (TOPs) == sv) |
777 |
root |
1.123 |
croak ("%s::FREEZE method returned same object as was passed instead of a new one", HvNAME (SvSTASH (sv))); |
778 |
root |
1.120 |
|
779 |
|
|
encode_ch (enc, '('); |
780 |
|
|
encode_ch (enc, '"'); |
781 |
|
|
encode_str (enc, HvNAME (stash), HvNAMELEN (stash), HvNAMEUTF8 (stash)); |
782 |
|
|
encode_ch (enc, '"'); |
783 |
|
|
encode_ch (enc, ')'); |
784 |
|
|
encode_ch (enc, '['); |
785 |
root |
1.119 |
|
786 |
root |
1.120 |
while (count) |
787 |
root |
1.44 |
{ |
788 |
root |
1.120 |
encode_sv (enc, SP[1 - count--]); |
789 |
root |
1.119 |
|
790 |
root |
1.120 |
if (count) |
791 |
|
|
encode_ch (enc, ','); |
792 |
|
|
} |
793 |
root |
1.119 |
|
794 |
root |
1.120 |
encode_ch (enc, ']'); |
795 |
root |
1.119 |
|
796 |
root |
1.120 |
FREETMPS; LEAVE; |
797 |
root |
1.119 |
} |
798 |
root |
1.120 |
else if ((enc->json.flags & F_CONV_BLESSED) && (method = gv_fetchmethod_autoload (stash, "TO_JSON", 0))) |
799 |
root |
1.119 |
{ |
800 |
root |
1.120 |
dSP; |
801 |
root |
1.119 |
|
802 |
root |
1.125 |
ENTER; SAVETMPS; |
803 |
|
|
PUSHMARK (SP); |
804 |
root |
1.120 |
// we re-bless the reference to get overload and other niceties right |
805 |
|
|
XPUSHs (sv_bless (sv_2mortal (newRV_inc (sv)), stash)); |
806 |
root |
1.119 |
|
807 |
root |
1.120 |
// calling with G_SCALAR ensures that we always get a 1 return value |
808 |
|
|
PUTBACK; |
809 |
|
|
call_sv ((SV *)GvCV (method), G_SCALAR); |
810 |
|
|
SPAGAIN; |
811 |
|
|
|
812 |
|
|
// catch this surprisingly common error |
813 |
|
|
if (SvROK (TOPs) && SvRV (TOPs) == sv) |
814 |
|
|
croak ("%s::TO_JSON method returned same object as was passed instead of a new one", HvNAME (SvSTASH (sv))); |
815 |
root |
1.44 |
|
816 |
root |
1.120 |
sv = POPs; |
817 |
|
|
PUTBACK; |
818 |
root |
1.53 |
|
819 |
root |
1.120 |
encode_sv (enc, sv); |
820 |
root |
1.44 |
|
821 |
root |
1.120 |
FREETMPS; LEAVE; |
822 |
root |
1.44 |
} |
823 |
root |
1.119 |
else if (enc->json.flags & F_ALLOW_BLESSED) |
824 |
|
|
encode_str (enc, "null", 4, 0); |
825 |
|
|
else |
826 |
root |
1.120 |
croak ("encountered object '%s', but neither allow_blessed, convert_blessed nor allow_tags settings are enabled (or TO_JSON/FREEZE method missing)", |
827 |
root |
1.119 |
SvPV_nolen (sv_2mortal (newRV_inc (sv)))); |
828 |
root |
1.44 |
} |
829 |
|
|
else if (svt == SVt_PVHV) |
830 |
root |
1.21 |
encode_hv (enc, (HV *)sv); |
831 |
|
|
else if (svt == SVt_PVAV) |
832 |
|
|
encode_av (enc, (AV *)sv); |
833 |
|
|
else if (svt < SVt_PVAV) |
834 |
|
|
{ |
835 |
root |
1.126 |
int bool_type = ref_bool_type (sv); |
836 |
root |
1.50 |
|
837 |
root |
1.126 |
if (bool_type == 1) |
838 |
root |
1.51 |
encode_str (enc, "true", 4, 0); |
839 |
root |
1.126 |
else if (bool_type == 0) |
840 |
root |
1.21 |
encode_str (enc, "false", 5, 0); |
841 |
root |
1.84 |
else if (enc->json.flags & F_ALLOW_UNKNOWN) |
842 |
|
|
encode_str (enc, "null", 4, 0); |
843 |
root |
1.21 |
else |
844 |
|
|
croak ("cannot encode reference to scalar '%s' unless the scalar is 0 or 1", |
845 |
|
|
SvPV_nolen (sv_2mortal (newRV_inc (sv)))); |
846 |
|
|
} |
847 |
root |
1.84 |
else if (enc->json.flags & F_ALLOW_UNKNOWN) |
848 |
|
|
encode_str (enc, "null", 4, 0); |
849 |
root |
1.21 |
else |
850 |
|
|
croak ("encountered %s, but JSON can only represent references to arrays or hashes", |
851 |
|
|
SvPV_nolen (sv_2mortal (newRV_inc (sv)))); |
852 |
|
|
} |
853 |
|
|
|
854 |
root |
1.1 |
static void |
855 |
|
|
encode_sv (enc_t *enc, SV *sv) |
856 |
|
|
{ |
857 |
root |
1.4 |
SvGETMAGIC (sv); |
858 |
|
|
|
859 |
root |
1.1 |
if (SvPOKp (sv)) |
860 |
|
|
{ |
861 |
|
|
STRLEN len; |
862 |
|
|
char *str = SvPV (sv, len); |
863 |
|
|
encode_ch (enc, '"'); |
864 |
|
|
encode_str (enc, str, len, SvUTF8 (sv)); |
865 |
|
|
encode_ch (enc, '"'); |
866 |
|
|
} |
867 |
|
|
else if (SvNOKp (sv)) |
868 |
|
|
{ |
869 |
root |
1.39 |
// trust that perl will do the right thing w.r.t. JSON syntax. |
870 |
root |
1.1 |
need (enc, NV_DIG + 32); |
871 |
|
|
Gconvert (SvNVX (sv), NV_DIG, 0, enc->cur); |
872 |
|
|
enc->cur += strlen (enc->cur); |
873 |
|
|
} |
874 |
|
|
else if (SvIOKp (sv)) |
875 |
|
|
{ |
876 |
root |
1.74 |
// we assume we can always read an IV as a UV and vice versa |
877 |
|
|
// we assume two's complement |
878 |
|
|
// we assume no aliasing issues in the union |
879 |
root |
1.75 |
if (SvIsUV (sv) ? SvUVX (sv) <= 59000 |
880 |
|
|
: SvIVX (sv) <= 59000 && SvIVX (sv) >= -59000) |
881 |
root |
1.35 |
{ |
882 |
|
|
// optimise the "small number case" |
883 |
|
|
// code will likely be branchless and use only a single multiplication |
884 |
root |
1.74 |
// works for numbers up to 59074 |
885 |
|
|
I32 i = SvIVX (sv); |
886 |
root |
1.35 |
U32 u; |
887 |
root |
1.39 |
char digit, nz = 0; |
888 |
root |
1.35 |
|
889 |
|
|
need (enc, 6); |
890 |
|
|
|
891 |
|
|
*enc->cur = '-'; enc->cur += i < 0 ? 1 : 0; |
892 |
|
|
u = i < 0 ? -i : i; |
893 |
|
|
|
894 |
|
|
// convert to 4.28 fixed-point representation |
895 |
|
|
u = u * ((0xfffffff + 10000) / 10000); // 10**5, 5 fractional digits |
896 |
|
|
|
897 |
root |
1.39 |
// now output digit by digit, each time masking out the integer part |
898 |
|
|
// and multiplying by 5 while moving the decimal point one to the right, |
899 |
|
|
// resulting in a net multiplication by 10. |
900 |
|
|
// we always write the digit to memory but conditionally increment |
901 |
root |
1.75 |
// the pointer, to enable the use of conditional move instructions. |
902 |
|
|
digit = u >> 28; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0xfffffffUL) * 5; |
903 |
|
|
digit = u >> 27; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x7ffffffUL) * 5; |
904 |
|
|
digit = u >> 26; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x3ffffffUL) * 5; |
905 |
|
|
digit = u >> 25; *enc->cur = digit + '0'; enc->cur += (nz = nz || digit); u = (u & 0x1ffffffUL) * 5; |
906 |
root |
1.39 |
digit = u >> 24; *enc->cur = digit + '0'; enc->cur += 1; // correctly generate '0' |
907 |
root |
1.35 |
} |
908 |
root |
1.75 |
else |
909 |
|
|
{ |
910 |
|
|
// large integer, use the (rather slow) snprintf way. |
911 |
|
|
need (enc, IVUV_MAXCHARS); |
912 |
root |
1.114 |
enc->cur += |
913 |
root |
1.75 |
SvIsUV(sv) |
914 |
|
|
? snprintf (enc->cur, IVUV_MAXCHARS, "%"UVuf, (UV)SvUVX (sv)) |
915 |
|
|
: snprintf (enc->cur, IVUV_MAXCHARS, "%"IVdf, (IV)SvIVX (sv)); |
916 |
|
|
} |
917 |
root |
1.1 |
} |
918 |
|
|
else if (SvROK (sv)) |
919 |
root |
1.21 |
encode_rv (enc, SvRV (sv)); |
920 |
root |
1.84 |
else if (!SvOK (sv) || enc->json.flags & F_ALLOW_UNKNOWN) |
921 |
root |
1.1 |
encode_str (enc, "null", 4, 0); |
922 |
|
|
else |
923 |
root |
1.117 |
croak ("encountered perl type (%s,0x%x) that JSON cannot handle, check your input data", |
924 |
root |
1.113 |
SvPV_nolen (sv), (unsigned int)SvFLAGS (sv)); |
925 |
root |
1.1 |
} |
926 |
|
|
|
927 |
|
|
static SV * |
928 |
root |
1.48 |
encode_json (SV *scalar, JSON *json) |
929 |
root |
1.1 |
{ |
930 |
root |
1.25 |
enc_t enc; |
931 |
|
|
|
932 |
root |
1.126 |
if (!(json->flags & F_ALLOW_NONREF) && json_nonref (scalar)) |
933 |
root |
1.9 |
croak ("hash- or arrayref expected (not a simple scalar, use allow_nonref to allow this)"); |
934 |
root |
1.3 |
|
935 |
root |
1.47 |
enc.json = *json; |
936 |
root |
1.12 |
enc.sv = sv_2mortal (NEWSV (0, INIT_SIZE)); |
937 |
|
|
enc.cur = SvPVX (enc.sv); |
938 |
|
|
enc.end = SvEND (enc.sv); |
939 |
|
|
enc.indent = 0; |
940 |
root |
1.71 |
enc.limit = enc.json.flags & F_ASCII ? 0x000080UL |
941 |
|
|
: enc.json.flags & F_LATIN1 ? 0x000100UL |
942 |
root |
1.74 |
: 0x110000UL; |
943 |
root |
1.1 |
|
944 |
|
|
SvPOK_only (enc.sv); |
945 |
|
|
encode_sv (&enc, scalar); |
946 |
root |
1.100 |
encode_nl (&enc); |
947 |
root |
1.1 |
|
948 |
|
|
SvCUR_set (enc.sv, enc.cur - SvPVX (enc.sv)); |
949 |
root |
1.27 |
*SvEND (enc.sv) = 0; // many xs functions expect a trailing 0 for text strings |
950 |
root |
1.6 |
|
951 |
root |
1.47 |
if (!(enc.json.flags & (F_ASCII | F_LATIN1 | F_UTF8))) |
952 |
root |
1.30 |
SvUTF8_on (enc.sv); |
953 |
|
|
|
954 |
root |
1.47 |
if (enc.json.flags & F_SHRINK) |
955 |
root |
1.7 |
shrink (enc.sv); |
956 |
|
|
|
957 |
root |
1.1 |
return enc.sv; |
958 |
|
|
} |
959 |
|
|
|
960 |
|
|
///////////////////////////////////////////////////////////////////////////// |
961 |
root |
1.12 |
// decoder |
962 |
root |
1.1 |
|
963 |
root |
1.12 |
// structure used for decoding JSON |
964 |
|
|
typedef struct |
965 |
|
|
{ |
966 |
|
|
char *cur; // current parser pointer |
967 |
|
|
char *end; // end of input string |
968 |
|
|
const char *err; // parse error, if != 0 |
969 |
root |
1.48 |
JSON json; |
970 |
root |
1.18 |
U32 depth; // recursion depth |
971 |
|
|
U32 maxdepth; // recursion depth limit |
972 |
root |
1.12 |
} dec_t; |
973 |
|
|
|
974 |
root |
1.71 |
INLINE void |
975 |
root |
1.64 |
decode_comment (dec_t *dec) |
976 |
|
|
{ |
977 |
|
|
// only '#'-style comments allowed a.t.m. |
978 |
|
|
|
979 |
|
|
while (*dec->cur && *dec->cur != 0x0a && *dec->cur != 0x0d) |
980 |
|
|
++dec->cur; |
981 |
|
|
} |
982 |
|
|
|
983 |
root |
1.71 |
INLINE void |
984 |
root |
1.12 |
decode_ws (dec_t *dec) |
985 |
|
|
{ |
986 |
|
|
for (;;) |
987 |
|
|
{ |
988 |
|
|
char ch = *dec->cur; |
989 |
|
|
|
990 |
root |
1.64 |
if (ch > 0x20) |
991 |
|
|
{ |
992 |
|
|
if (expect_false (ch == '#')) |
993 |
|
|
{ |
994 |
|
|
if (dec->json.flags & F_RELAXED) |
995 |
|
|
decode_comment (dec); |
996 |
|
|
else |
997 |
|
|
break; |
998 |
|
|
} |
999 |
|
|
else |
1000 |
|
|
break; |
1001 |
|
|
} |
1002 |
|
|
else if (ch != 0x20 && ch != 0x0a && ch != 0x0d && ch != 0x09) |
1003 |
|
|
break; // parse error, but let higher level handle it, gives better error messages |
1004 |
root |
1.63 |
|
1005 |
root |
1.12 |
++dec->cur; |
1006 |
root |
1.1 |
} |
1007 |
root |
1.12 |
} |
1008 |
root |
1.1 |
|
1009 |
|
|
#define ERR(reason) SB dec->err = reason; goto fail; SE |
1010 |
root |
1.18 |
|
1011 |
root |
1.1 |
#define EXPECT_CH(ch) SB \ |
1012 |
|
|
if (*dec->cur != ch) \ |
1013 |
|
|
ERR (# ch " expected"); \ |
1014 |
|
|
++dec->cur; \ |
1015 |
|
|
SE |
1016 |
|
|
|
1017 |
root |
1.85 |
#define DEC_INC_DEPTH if (++dec->depth > dec->json.max_depth) ERR (ERR_NESTING_EXCEEDED) |
1018 |
root |
1.18 |
#define DEC_DEC_DEPTH --dec->depth |
1019 |
|
|
|
1020 |
root |
1.1 |
static SV *decode_sv (dec_t *dec); |
1021 |
|
|
|
1022 |
|
|
static signed char decode_hexdigit[256]; |
1023 |
|
|
|
1024 |
|
|
static UV |
1025 |
|
|
decode_4hex (dec_t *dec) |
1026 |
|
|
{ |
1027 |
|
|
signed char d1, d2, d3, d4; |
1028 |
root |
1.12 |
unsigned char *cur = (unsigned char *)dec->cur; |
1029 |
root |
1.1 |
|
1030 |
root |
1.40 |
d1 = decode_hexdigit [cur [0]]; if (expect_false (d1 < 0)) ERR ("exactly four hexadecimal digits expected"); |
1031 |
|
|
d2 = decode_hexdigit [cur [1]]; if (expect_false (d2 < 0)) ERR ("exactly four hexadecimal digits expected"); |
1032 |
|
|
d3 = decode_hexdigit [cur [2]]; if (expect_false (d3 < 0)) ERR ("exactly four hexadecimal digits expected"); |
1033 |
|
|
d4 = decode_hexdigit [cur [3]]; if (expect_false (d4 < 0)) ERR ("exactly four hexadecimal digits expected"); |
1034 |
root |
1.1 |
|
1035 |
|
|
dec->cur += 4; |
1036 |
|
|
|
1037 |
|
|
return ((UV)d1) << 12 |
1038 |
|
|
| ((UV)d2) << 8 |
1039 |
|
|
| ((UV)d3) << 4 |
1040 |
|
|
| ((UV)d4); |
1041 |
|
|
|
1042 |
|
|
fail: |
1043 |
|
|
return (UV)-1; |
1044 |
|
|
} |
1045 |
|
|
|
1046 |
|
|
static SV * |
1047 |
|
|
decode_str (dec_t *dec) |
1048 |
|
|
{ |
1049 |
root |
1.12 |
SV *sv = 0; |
1050 |
root |
1.1 |
int utf8 = 0; |
1051 |
root |
1.38 |
char *dec_cur = dec->cur; |
1052 |
root |
1.1 |
|
1053 |
root |
1.12 |
do |
1054 |
root |
1.1 |
{ |
1055 |
root |
1.28 |
char buf [SHORT_STRING_LEN + UTF8_MAXBYTES]; |
1056 |
root |
1.12 |
char *cur = buf; |
1057 |
root |
1.1 |
|
1058 |
root |
1.12 |
do |
1059 |
root |
1.1 |
{ |
1060 |
root |
1.38 |
unsigned char ch = *(unsigned char *)dec_cur++; |
1061 |
root |
1.12 |
|
1062 |
root |
1.35 |
if (expect_false (ch == '"')) |
1063 |
root |
1.12 |
{ |
1064 |
root |
1.38 |
--dec_cur; |
1065 |
root |
1.12 |
break; |
1066 |
|
|
} |
1067 |
root |
1.35 |
else if (expect_false (ch == '\\')) |
1068 |
root |
1.1 |
{ |
1069 |
root |
1.38 |
switch (*dec_cur) |
1070 |
root |
1.1 |
{ |
1071 |
root |
1.12 |
case '\\': |
1072 |
|
|
case '/': |
1073 |
root |
1.38 |
case '"': *cur++ = *dec_cur++; break; |
1074 |
root |
1.12 |
|
1075 |
root |
1.38 |
case 'b': ++dec_cur; *cur++ = '\010'; break; |
1076 |
|
|
case 't': ++dec_cur; *cur++ = '\011'; break; |
1077 |
|
|
case 'n': ++dec_cur; *cur++ = '\012'; break; |
1078 |
|
|
case 'f': ++dec_cur; *cur++ = '\014'; break; |
1079 |
|
|
case 'r': ++dec_cur; *cur++ = '\015'; break; |
1080 |
root |
1.1 |
|
1081 |
root |
1.12 |
case 'u': |
1082 |
root |
1.1 |
{ |
1083 |
root |
1.12 |
UV lo, hi; |
1084 |
root |
1.38 |
++dec_cur; |
1085 |
root |
1.1 |
|
1086 |
root |
1.38 |
dec->cur = dec_cur; |
1087 |
root |
1.12 |
hi = decode_4hex (dec); |
1088 |
root |
1.38 |
dec_cur = dec->cur; |
1089 |
root |
1.12 |
if (hi == (UV)-1) |
1090 |
|
|
goto fail; |
1091 |
root |
1.1 |
|
1092 |
root |
1.12 |
// possibly a surrogate pair |
1093 |
|
|
if (hi >= 0xd800) |
1094 |
|
|
if (hi < 0xdc00) |
1095 |
|
|
{ |
1096 |
root |
1.38 |
if (dec_cur [0] != '\\' || dec_cur [1] != 'u') |
1097 |
root |
1.12 |
ERR ("missing low surrogate character in surrogate pair"); |
1098 |
|
|
|
1099 |
root |
1.38 |
dec_cur += 2; |
1100 |
root |
1.12 |
|
1101 |
root |
1.38 |
dec->cur = dec_cur; |
1102 |
root |
1.12 |
lo = decode_4hex (dec); |
1103 |
root |
1.38 |
dec_cur = dec->cur; |
1104 |
root |
1.12 |
if (lo == (UV)-1) |
1105 |
|
|
goto fail; |
1106 |
|
|
|
1107 |
|
|
if (lo < 0xdc00 || lo >= 0xe000) |
1108 |
|
|
ERR ("surrogate pair expected"); |
1109 |
|
|
|
1110 |
|
|
hi = (hi - 0xD800) * 0x400 + (lo - 0xDC00) + 0x10000; |
1111 |
|
|
} |
1112 |
|
|
else if (hi < 0xe000) |
1113 |
|
|
ERR ("missing high surrogate character in surrogate pair"); |
1114 |
root |
1.1 |
|
1115 |
root |
1.12 |
if (hi >= 0x80) |
1116 |
|
|
{ |
1117 |
|
|
utf8 = 1; |
1118 |
root |
1.1 |
|
1119 |
root |
1.72 |
cur = encode_utf8 (cur, hi); |
1120 |
root |
1.12 |
} |
1121 |
|
|
else |
1122 |
|
|
*cur++ = hi; |
1123 |
root |
1.1 |
} |
1124 |
root |
1.12 |
break; |
1125 |
|
|
|
1126 |
|
|
default: |
1127 |
root |
1.38 |
--dec_cur; |
1128 |
root |
1.12 |
ERR ("illegal backslash escape sequence in string"); |
1129 |
|
|
} |
1130 |
|
|
} |
1131 |
root |
1.74 |
else if (expect_true (ch >= 0x20 && ch < 0x80)) |
1132 |
root |
1.12 |
*cur++ = ch; |
1133 |
|
|
else if (ch >= 0x80) |
1134 |
|
|
{ |
1135 |
root |
1.25 |
STRLEN clen; |
1136 |
|
|
|
1137 |
root |
1.38 |
--dec_cur; |
1138 |
root |
1.1 |
|
1139 |
root |
1.101 |
decode_utf8 (dec_cur, dec->end - dec_cur, &clen); |
1140 |
root |
1.12 |
if (clen == (STRLEN)-1) |
1141 |
|
|
ERR ("malformed UTF-8 character in JSON string"); |
1142 |
root |
1.1 |
|
1143 |
root |
1.12 |
do |
1144 |
root |
1.38 |
*cur++ = *dec_cur++; |
1145 |
root |
1.12 |
while (--clen); |
1146 |
root |
1.5 |
|
1147 |
root |
1.12 |
utf8 = 1; |
1148 |
root |
1.1 |
} |
1149 |
root |
1.124 |
else if (ch == '\t' && dec->json.flags & F_RELAXED) |
1150 |
|
|
*cur++ = ch; |
1151 |
root |
1.12 |
else |
1152 |
root |
1.23 |
{ |
1153 |
root |
1.38 |
--dec_cur; |
1154 |
root |
1.12 |
|
1155 |
root |
1.23 |
if (!ch) |
1156 |
root |
1.24 |
ERR ("unexpected end of string while parsing JSON string"); |
1157 |
root |
1.23 |
else |
1158 |
root |
1.24 |
ERR ("invalid character encountered while parsing JSON string"); |
1159 |
root |
1.23 |
} |
1160 |
root |
1.1 |
} |
1161 |
root |
1.12 |
while (cur < buf + SHORT_STRING_LEN); |
1162 |
root |
1.1 |
|
1163 |
root |
1.25 |
{ |
1164 |
|
|
STRLEN len = cur - buf; |
1165 |
root |
1.5 |
|
1166 |
root |
1.25 |
if (sv) |
1167 |
|
|
{ |
1168 |
root |
1.95 |
STRLEN cur = SvCUR (sv); |
1169 |
|
|
|
1170 |
|
|
if (SvLEN (sv) <= cur + len) |
1171 |
|
|
SvGROW (sv, cur + (len < (cur >> 2) ? cur >> 2 : len) + 1); |
1172 |
|
|
|
1173 |
root |
1.25 |
memcpy (SvPVX (sv) + SvCUR (sv), buf, len); |
1174 |
|
|
SvCUR_set (sv, SvCUR (sv) + len); |
1175 |
|
|
} |
1176 |
|
|
else |
1177 |
|
|
sv = newSVpvn (buf, len); |
1178 |
|
|
} |
1179 |
root |
1.1 |
} |
1180 |
root |
1.38 |
while (*dec_cur != '"'); |
1181 |
root |
1.1 |
|
1182 |
root |
1.38 |
++dec_cur; |
1183 |
root |
1.1 |
|
1184 |
root |
1.12 |
if (sv) |
1185 |
|
|
{ |
1186 |
|
|
SvPOK_only (sv); |
1187 |
|
|
*SvEND (sv) = 0; |
1188 |
root |
1.4 |
|
1189 |
root |
1.12 |
if (utf8) |
1190 |
|
|
SvUTF8_on (sv); |
1191 |
|
|
} |
1192 |
|
|
else |
1193 |
|
|
sv = newSVpvn ("", 0); |
1194 |
root |
1.6 |
|
1195 |
root |
1.38 |
dec->cur = dec_cur; |
1196 |
root |
1.1 |
return sv; |
1197 |
|
|
|
1198 |
|
|
fail: |
1199 |
root |
1.38 |
dec->cur = dec_cur; |
1200 |
root |
1.1 |
return 0; |
1201 |
|
|
} |
1202 |
|
|
|
1203 |
|
|
static SV * |
1204 |
|
|
decode_num (dec_t *dec) |
1205 |
|
|
{ |
1206 |
|
|
int is_nv = 0; |
1207 |
|
|
char *start = dec->cur; |
1208 |
|
|
|
1209 |
|
|
// [minus] |
1210 |
|
|
if (*dec->cur == '-') |
1211 |
|
|
++dec->cur; |
1212 |
|
|
|
1213 |
|
|
if (*dec->cur == '0') |
1214 |
|
|
{ |
1215 |
|
|
++dec->cur; |
1216 |
|
|
if (*dec->cur >= '0' && *dec->cur <= '9') |
1217 |
|
|
ERR ("malformed number (leading zero must not be followed by another digit)"); |
1218 |
|
|
} |
1219 |
root |
1.5 |
else if (*dec->cur < '0' || *dec->cur > '9') |
1220 |
|
|
ERR ("malformed number (no digits after initial minus)"); |
1221 |
|
|
else |
1222 |
|
|
do |
1223 |
|
|
{ |
1224 |
|
|
++dec->cur; |
1225 |
|
|
} |
1226 |
|
|
while (*dec->cur >= '0' && *dec->cur <= '9'); |
1227 |
root |
1.1 |
|
1228 |
|
|
// [frac] |
1229 |
|
|
if (*dec->cur == '.') |
1230 |
|
|
{ |
1231 |
root |
1.5 |
++dec->cur; |
1232 |
|
|
|
1233 |
|
|
if (*dec->cur < '0' || *dec->cur > '9') |
1234 |
|
|
ERR ("malformed number (no digits after decimal point)"); |
1235 |
root |
1.1 |
|
1236 |
|
|
do |
1237 |
|
|
{ |
1238 |
|
|
++dec->cur; |
1239 |
|
|
} |
1240 |
|
|
while (*dec->cur >= '0' && *dec->cur <= '9'); |
1241 |
root |
1.5 |
|
1242 |
|
|
is_nv = 1; |
1243 |
root |
1.1 |
} |
1244 |
|
|
|
1245 |
|
|
// [exp] |
1246 |
|
|
if (*dec->cur == 'e' || *dec->cur == 'E') |
1247 |
|
|
{ |
1248 |
root |
1.5 |
++dec->cur; |
1249 |
root |
1.1 |
|
1250 |
|
|
if (*dec->cur == '-' || *dec->cur == '+') |
1251 |
|
|
++dec->cur; |
1252 |
|
|
|
1253 |
root |
1.5 |
if (*dec->cur < '0' || *dec->cur > '9') |
1254 |
|
|
ERR ("malformed number (no digits after exp sign)"); |
1255 |
|
|
|
1256 |
|
|
do |
1257 |
|
|
{ |
1258 |
|
|
++dec->cur; |
1259 |
|
|
} |
1260 |
|
|
while (*dec->cur >= '0' && *dec->cur <= '9'); |
1261 |
|
|
|
1262 |
|
|
is_nv = 1; |
1263 |
root |
1.1 |
} |
1264 |
|
|
|
1265 |
|
|
if (!is_nv) |
1266 |
|
|
{ |
1267 |
root |
1.56 |
int len = dec->cur - start; |
1268 |
|
|
|
1269 |
root |
1.70 |
// special case the rather common 1..5-digit-int case |
1270 |
root |
1.35 |
if (*start == '-') |
1271 |
root |
1.56 |
switch (len) |
1272 |
root |
1.1 |
{ |
1273 |
root |
1.97 |
case 2: return newSViv (-(IV)( start [1] - '0' * 1)); |
1274 |
|
|
case 3: return newSViv (-(IV)( start [1] * 10 + start [2] - '0' * 11)); |
1275 |
|
|
case 4: return newSViv (-(IV)( start [1] * 100 + start [2] * 10 + start [3] - '0' * 111)); |
1276 |
|
|
case 5: return newSViv (-(IV)( start [1] * 1000 + start [2] * 100 + start [3] * 10 + start [4] - '0' * 1111)); |
1277 |
|
|
case 6: return newSViv (-(IV)(start [1] * 10000 + start [2] * 1000 + start [3] * 100 + start [4] * 10 + start [5] - '0' * 11111)); |
1278 |
root |
1.1 |
} |
1279 |
root |
1.35 |
else |
1280 |
root |
1.56 |
switch (len) |
1281 |
root |
1.35 |
{ |
1282 |
root |
1.97 |
case 1: return newSViv ( start [0] - '0' * 1); |
1283 |
|
|
case 2: return newSViv ( start [0] * 10 + start [1] - '0' * 11); |
1284 |
|
|
case 3: return newSViv ( start [0] * 100 + start [1] * 10 + start [2] - '0' * 111); |
1285 |
|
|
case 4: return newSViv ( start [0] * 1000 + start [1] * 100 + start [2] * 10 + start [3] - '0' * 1111); |
1286 |
|
|
case 5: return newSViv ( start [0] * 10000 + start [1] * 1000 + start [2] * 100 + start [3] * 10 + start [4] - '0' * 11111); |
1287 |
root |
1.35 |
} |
1288 |
|
|
|
1289 |
|
|
{ |
1290 |
|
|
UV uv; |
1291 |
root |
1.56 |
int numtype = grok_number (start, len, &uv); |
1292 |
root |
1.35 |
if (numtype & IS_NUMBER_IN_UV) |
1293 |
|
|
if (numtype & IS_NUMBER_NEG) |
1294 |
|
|
{ |
1295 |
|
|
if (uv < (UV)IV_MIN) |
1296 |
|
|
return newSViv (-(IV)uv); |
1297 |
|
|
} |
1298 |
|
|
else |
1299 |
|
|
return newSVuv (uv); |
1300 |
root |
1.56 |
} |
1301 |
|
|
|
1302 |
|
|
len -= *start == '-' ? 1 : 0; |
1303 |
root |
1.40 |
|
1304 |
root |
1.56 |
// does not fit into IV or UV, try NV |
1305 |
root |
1.104 |
if (len <= NV_DIG) |
1306 |
root |
1.56 |
// fits into NV without loss of precision |
1307 |
root |
1.104 |
return newSVnv (json_atof (start)); |
1308 |
root |
1.56 |
|
1309 |
|
|
// everything else fails, convert it to a string |
1310 |
|
|
return newSVpvn (start, dec->cur - start); |
1311 |
root |
1.1 |
} |
1312 |
|
|
|
1313 |
root |
1.56 |
// loss of precision here |
1314 |
root |
1.104 |
return newSVnv (json_atof (start)); |
1315 |
root |
1.1 |
|
1316 |
|
|
fail: |
1317 |
|
|
return 0; |
1318 |
|
|
} |
1319 |
|
|
|
1320 |
|
|
static SV * |
1321 |
|
|
decode_av (dec_t *dec) |
1322 |
|
|
{ |
1323 |
|
|
AV *av = newAV (); |
1324 |
|
|
|
1325 |
root |
1.18 |
DEC_INC_DEPTH; |
1326 |
root |
1.12 |
decode_ws (dec); |
1327 |
root |
1.18 |
|
1328 |
root |
1.5 |
if (*dec->cur == ']') |
1329 |
|
|
++dec->cur; |
1330 |
|
|
else |
1331 |
|
|
for (;;) |
1332 |
|
|
{ |
1333 |
|
|
SV *value; |
1334 |
root |
1.1 |
|
1335 |
root |
1.5 |
value = decode_sv (dec); |
1336 |
|
|
if (!value) |
1337 |
|
|
goto fail; |
1338 |
root |
1.1 |
|
1339 |
root |
1.5 |
av_push (av, value); |
1340 |
root |
1.1 |
|
1341 |
root |
1.12 |
decode_ws (dec); |
1342 |
root |
1.1 |
|
1343 |
root |
1.5 |
if (*dec->cur == ']') |
1344 |
|
|
{ |
1345 |
|
|
++dec->cur; |
1346 |
|
|
break; |
1347 |
|
|
} |
1348 |
root |
1.117 |
|
1349 |
root |
1.5 |
if (*dec->cur != ',') |
1350 |
|
|
ERR (", or ] expected while parsing array"); |
1351 |
root |
1.1 |
|
1352 |
root |
1.5 |
++dec->cur; |
1353 |
root |
1.63 |
|
1354 |
|
|
decode_ws (dec); |
1355 |
|
|
|
1356 |
|
|
if (*dec->cur == ']' && dec->json.flags & F_RELAXED) |
1357 |
|
|
{ |
1358 |
|
|
++dec->cur; |
1359 |
|
|
break; |
1360 |
|
|
} |
1361 |
root |
1.5 |
} |
1362 |
root |
1.1 |
|
1363 |
root |
1.18 |
DEC_DEC_DEPTH; |
1364 |
root |
1.1 |
return newRV_noinc ((SV *)av); |
1365 |
|
|
|
1366 |
|
|
fail: |
1367 |
|
|
SvREFCNT_dec (av); |
1368 |
root |
1.18 |
DEC_DEC_DEPTH; |
1369 |
root |
1.1 |
return 0; |
1370 |
|
|
} |
1371 |
|
|
|
1372 |
|
|
static SV * |
1373 |
|
|
decode_hv (dec_t *dec) |
1374 |
|
|
{ |
1375 |
root |
1.49 |
SV *sv; |
1376 |
root |
1.1 |
HV *hv = newHV (); |
1377 |
|
|
|
1378 |
root |
1.18 |
DEC_INC_DEPTH; |
1379 |
root |
1.12 |
decode_ws (dec); |
1380 |
root |
1.18 |
|
1381 |
root |
1.5 |
if (*dec->cur == '}') |
1382 |
|
|
++dec->cur; |
1383 |
|
|
else |
1384 |
|
|
for (;;) |
1385 |
|
|
{ |
1386 |
root |
1.63 |
EXPECT_CH ('"'); |
1387 |
root |
1.1 |
|
1388 |
root |
1.46 |
// heuristic: assume that |
1389 |
root |
1.47 |
// a) decode_str + hv_store_ent are abysmally slow. |
1390 |
|
|
// b) most hash keys are short, simple ascii text. |
1391 |
|
|
// => try to "fast-match" such strings to avoid |
1392 |
|
|
// the overhead of decode_str + hv_store_ent. |
1393 |
root |
1.46 |
{ |
1394 |
|
|
SV *value; |
1395 |
|
|
char *p = dec->cur; |
1396 |
|
|
char *e = p + 24; // only try up to 24 bytes |
1397 |
|
|
|
1398 |
|
|
for (;;) |
1399 |
|
|
{ |
1400 |
root |
1.77 |
// the >= 0x80 is false on most architectures |
1401 |
root |
1.46 |
if (p == e || *p < 0x20 || *p >= 0x80 || *p == '\\') |
1402 |
|
|
{ |
1403 |
|
|
// slow path, back up and use decode_str |
1404 |
|
|
SV *key = decode_str (dec); |
1405 |
|
|
if (!key) |
1406 |
|
|
goto fail; |
1407 |
|
|
|
1408 |
|
|
decode_ws (dec); EXPECT_CH (':'); |
1409 |
|
|
|
1410 |
root |
1.63 |
decode_ws (dec); |
1411 |
root |
1.46 |
value = decode_sv (dec); |
1412 |
|
|
if (!value) |
1413 |
|
|
{ |
1414 |
|
|
SvREFCNT_dec (key); |
1415 |
|
|
goto fail; |
1416 |
|
|
} |
1417 |
|
|
|
1418 |
|
|
hv_store_ent (hv, key, value, 0); |
1419 |
|
|
SvREFCNT_dec (key); |
1420 |
|
|
|
1421 |
|
|
break; |
1422 |
|
|
} |
1423 |
|
|
else if (*p == '"') |
1424 |
|
|
{ |
1425 |
|
|
// fast path, got a simple key |
1426 |
|
|
char *key = dec->cur; |
1427 |
|
|
int len = p - key; |
1428 |
|
|
dec->cur = p + 1; |
1429 |
|
|
|
1430 |
|
|
decode_ws (dec); EXPECT_CH (':'); |
1431 |
|
|
|
1432 |
root |
1.63 |
decode_ws (dec); |
1433 |
root |
1.46 |
value = decode_sv (dec); |
1434 |
|
|
if (!value) |
1435 |
|
|
goto fail; |
1436 |
root |
1.1 |
|
1437 |
root |
1.46 |
hv_store (hv, key, len, value, 0); |
1438 |
root |
1.1 |
|
1439 |
root |
1.46 |
break; |
1440 |
|
|
} |
1441 |
root |
1.1 |
|
1442 |
root |
1.46 |
++p; |
1443 |
|
|
} |
1444 |
|
|
} |
1445 |
root |
1.1 |
|
1446 |
root |
1.12 |
decode_ws (dec); |
1447 |
root |
1.1 |
|
1448 |
root |
1.5 |
if (*dec->cur == '}') |
1449 |
|
|
{ |
1450 |
|
|
++dec->cur; |
1451 |
|
|
break; |
1452 |
|
|
} |
1453 |
root |
1.1 |
|
1454 |
root |
1.5 |
if (*dec->cur != ',') |
1455 |
|
|
ERR (", or } expected while parsing object/hash"); |
1456 |
root |
1.1 |
|
1457 |
root |
1.5 |
++dec->cur; |
1458 |
root |
1.63 |
|
1459 |
|
|
decode_ws (dec); |
1460 |
|
|
|
1461 |
|
|
if (*dec->cur == '}' && dec->json.flags & F_RELAXED) |
1462 |
|
|
{ |
1463 |
|
|
++dec->cur; |
1464 |
|
|
break; |
1465 |
|
|
} |
1466 |
root |
1.5 |
} |
1467 |
root |
1.1 |
|
1468 |
root |
1.18 |
DEC_DEC_DEPTH; |
1469 |
root |
1.49 |
sv = newRV_noinc ((SV *)hv); |
1470 |
|
|
|
1471 |
|
|
// check filter callbacks |
1472 |
|
|
if (dec->json.flags & F_HOOK) |
1473 |
|
|
{ |
1474 |
root |
1.51 |
if (dec->json.cb_sk_object && HvKEYS (hv) == 1) |
1475 |
root |
1.49 |
{ |
1476 |
root |
1.52 |
HE *cb, *he; |
1477 |
root |
1.49 |
|
1478 |
root |
1.52 |
hv_iterinit (hv); |
1479 |
|
|
he = hv_iternext (hv); |
1480 |
|
|
hv_iterinit (hv); |
1481 |
root |
1.49 |
|
1482 |
root |
1.125 |
// the next line creates a mortal sv each time it's called. |
1483 |
root |
1.52 |
// might want to optimise this for common cases. |
1484 |
|
|
cb = hv_fetch_ent (dec->json.cb_sk_object, hv_iterkeysv (he), 0, 0); |
1485 |
root |
1.49 |
|
1486 |
root |
1.52 |
if (cb) |
1487 |
root |
1.51 |
{ |
1488 |
root |
1.53 |
dSP; |
1489 |
root |
1.52 |
int count; |
1490 |
|
|
|
1491 |
root |
1.125 |
ENTER; SAVETMPS; |
1492 |
|
|
SAVESTACK_POS (); |
1493 |
|
|
PUSHMARK (SP); |
1494 |
root |
1.52 |
XPUSHs (HeVAL (he)); |
1495 |
root |
1.107 |
sv_2mortal (sv); |
1496 |
root |
1.52 |
|
1497 |
|
|
PUTBACK; count = call_sv (HeVAL (cb), G_ARRAY); SPAGAIN; |
1498 |
|
|
|
1499 |
|
|
if (count == 1) |
1500 |
|
|
{ |
1501 |
|
|
sv = newSVsv (POPs); |
1502 |
|
|
FREETMPS; LEAVE; |
1503 |
|
|
return sv; |
1504 |
|
|
} |
1505 |
|
|
|
1506 |
root |
1.107 |
SvREFCNT_inc (sv); |
1507 |
root |
1.52 |
FREETMPS; LEAVE; |
1508 |
root |
1.51 |
} |
1509 |
root |
1.49 |
} |
1510 |
|
|
|
1511 |
|
|
if (dec->json.cb_object) |
1512 |
|
|
{ |
1513 |
root |
1.53 |
dSP; |
1514 |
root |
1.49 |
int count; |
1515 |
|
|
|
1516 |
root |
1.125 |
ENTER; SAVETMPS; |
1517 |
|
|
SAVESTACK_POS (); |
1518 |
|
|
PUSHMARK (SP); |
1519 |
root |
1.49 |
XPUSHs (sv_2mortal (sv)); |
1520 |
|
|
|
1521 |
|
|
PUTBACK; count = call_sv (dec->json.cb_object, G_ARRAY); SPAGAIN; |
1522 |
|
|
|
1523 |
|
|
if (count == 1) |
1524 |
root |
1.51 |
{ |
1525 |
|
|
sv = newSVsv (POPs); |
1526 |
root |
1.52 |
FREETMPS; LEAVE; |
1527 |
|
|
return sv; |
1528 |
root |
1.51 |
} |
1529 |
|
|
|
1530 |
|
|
SvREFCNT_inc (sv); |
1531 |
root |
1.52 |
FREETMPS; LEAVE; |
1532 |
root |
1.49 |
} |
1533 |
|
|
} |
1534 |
|
|
|
1535 |
root |
1.51 |
return sv; |
1536 |
root |
1.1 |
|
1537 |
|
|
fail: |
1538 |
|
|
SvREFCNT_dec (hv); |
1539 |
root |
1.18 |
DEC_DEC_DEPTH; |
1540 |
root |
1.1 |
return 0; |
1541 |
|
|
} |
1542 |
|
|
|
1543 |
|
|
static SV * |
1544 |
root |
1.119 |
decode_tag (dec_t *dec) |
1545 |
|
|
{ |
1546 |
|
|
SV *tag = 0; |
1547 |
|
|
SV *val = 0; |
1548 |
|
|
|
1549 |
|
|
if (!(dec->json.flags & F_ALLOW_TAGS)) |
1550 |
|
|
ERR ("malformed JSON string, neither array, object, number, string or atom"); |
1551 |
|
|
|
1552 |
|
|
++dec->cur; |
1553 |
|
|
|
1554 |
root |
1.121 |
decode_ws (dec); |
1555 |
|
|
|
1556 |
root |
1.119 |
tag = decode_sv (dec); |
1557 |
|
|
if (!tag) |
1558 |
|
|
goto fail; |
1559 |
|
|
|
1560 |
|
|
if (!SvPOK (tag)) |
1561 |
|
|
ERR ("malformed JSON string, (tag) must be a string"); |
1562 |
|
|
|
1563 |
root |
1.121 |
decode_ws (dec); |
1564 |
|
|
|
1565 |
root |
1.119 |
if (*dec->cur != ')') |
1566 |
|
|
ERR (") expected after tag"); |
1567 |
|
|
|
1568 |
|
|
++dec->cur; |
1569 |
|
|
|
1570 |
root |
1.121 |
decode_ws (dec); |
1571 |
|
|
|
1572 |
root |
1.119 |
val = decode_sv (dec); |
1573 |
|
|
if (!val) |
1574 |
|
|
goto fail; |
1575 |
|
|
|
1576 |
|
|
if (!SvROK (val) || SvTYPE (SvRV (val)) != SVt_PVAV) |
1577 |
|
|
ERR ("malformed JSON string, tag value must be an array"); |
1578 |
|
|
|
1579 |
|
|
{ |
1580 |
|
|
AV *av = (AV *)SvRV (val); |
1581 |
|
|
int i, len = av_len (av) + 1; |
1582 |
|
|
HV *stash = gv_stashsv (tag, 0); |
1583 |
|
|
SV *sv; |
1584 |
|
|
|
1585 |
|
|
if (!stash) |
1586 |
|
|
ERR ("cannot decode perl-object (package does not exist)"); |
1587 |
|
|
|
1588 |
|
|
GV *method = gv_fetchmethod_autoload (stash, "THAW", 0); |
1589 |
|
|
|
1590 |
|
|
if (!method) |
1591 |
|
|
ERR ("cannot decode perl-object (package does not have a THAW method)"); |
1592 |
|
|
|
1593 |
|
|
dSP; |
1594 |
|
|
|
1595 |
root |
1.125 |
ENTER; SAVETMPS; |
1596 |
|
|
PUSHMARK (SP); |
1597 |
root |
1.119 |
EXTEND (SP, len + 2); |
1598 |
|
|
// we re-bless the reference to get overload and other niceties right |
1599 |
|
|
PUSHs (tag); |
1600 |
|
|
PUSHs (sv_json); |
1601 |
|
|
|
1602 |
|
|
for (i = 0; i < len; ++i) |
1603 |
|
|
PUSHs (*av_fetch (av, i, 1)); |
1604 |
|
|
|
1605 |
|
|
PUTBACK; |
1606 |
|
|
call_sv ((SV *)GvCV (method), G_SCALAR); |
1607 |
|
|
SPAGAIN; |
1608 |
|
|
|
1609 |
|
|
SvREFCNT_dec (tag); |
1610 |
|
|
SvREFCNT_dec (val); |
1611 |
|
|
sv = SvREFCNT_inc (POPs); |
1612 |
|
|
|
1613 |
|
|
PUTBACK; |
1614 |
|
|
|
1615 |
|
|
FREETMPS; LEAVE; |
1616 |
|
|
|
1617 |
|
|
return sv; |
1618 |
|
|
} |
1619 |
|
|
|
1620 |
|
|
fail: |
1621 |
|
|
SvREFCNT_dec (tag); |
1622 |
|
|
SvREFCNT_dec (val); |
1623 |
|
|
return 0; |
1624 |
|
|
} |
1625 |
|
|
|
1626 |
|
|
static SV * |
1627 |
root |
1.1 |
decode_sv (dec_t *dec) |
1628 |
|
|
{ |
1629 |
root |
1.40 |
// the beauty of JSON: you need exactly one character lookahead |
1630 |
root |
1.73 |
// to parse everything. |
1631 |
root |
1.1 |
switch (*dec->cur) |
1632 |
|
|
{ |
1633 |
root |
1.117 |
case '"': ++dec->cur; return decode_str (dec); |
1634 |
|
|
case '[': ++dec->cur; return decode_av (dec); |
1635 |
root |
1.73 |
case '{': ++dec->cur; return decode_hv (dec); |
1636 |
root |
1.119 |
case '(': return decode_tag (dec); |
1637 |
root |
1.1 |
|
1638 |
|
|
case '-': |
1639 |
|
|
case '0': case '1': case '2': case '3': case '4': |
1640 |
|
|
case '5': case '6': case '7': case '8': case '9': |
1641 |
|
|
return decode_num (dec); |
1642 |
|
|
|
1643 |
|
|
case 't': |
1644 |
|
|
if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "true", 4)) |
1645 |
|
|
{ |
1646 |
|
|
dec->cur += 4; |
1647 |
root |
1.60 |
#if JSON_SLOW |
1648 |
root |
1.126 |
bool_true = get_bool ("Types::Serialiser::true"); |
1649 |
root |
1.60 |
#endif |
1650 |
root |
1.126 |
return newSVsv (bool_true); |
1651 |
root |
1.1 |
} |
1652 |
|
|
else |
1653 |
|
|
ERR ("'true' expected"); |
1654 |
|
|
|
1655 |
|
|
break; |
1656 |
|
|
|
1657 |
|
|
case 'f': |
1658 |
|
|
if (dec->end - dec->cur >= 5 && !memcmp (dec->cur, "false", 5)) |
1659 |
|
|
{ |
1660 |
|
|
dec->cur += 5; |
1661 |
root |
1.60 |
#if JSON_SLOW |
1662 |
root |
1.126 |
bool_false = get_bool ("Types::Serialiser::false"); |
1663 |
root |
1.60 |
#endif |
1664 |
root |
1.126 |
return newSVsv (bool_false); |
1665 |
root |
1.1 |
} |
1666 |
|
|
else |
1667 |
|
|
ERR ("'false' expected"); |
1668 |
|
|
|
1669 |
|
|
break; |
1670 |
|
|
|
1671 |
|
|
case 'n': |
1672 |
|
|
if (dec->end - dec->cur >= 4 && !memcmp (dec->cur, "null", 4)) |
1673 |
|
|
{ |
1674 |
|
|
dec->cur += 4; |
1675 |
root |
1.5 |
return newSVsv (&PL_sv_undef); |
1676 |
root |
1.1 |
} |
1677 |
|
|
else |
1678 |
|
|
ERR ("'null' expected"); |
1679 |
|
|
|
1680 |
|
|
break; |
1681 |
|
|
|
1682 |
|
|
default: |
1683 |
root |
1.119 |
ERR ("malformed JSON string, neither tag, array, object, number, string or atom"); |
1684 |
root |
1.1 |
break; |
1685 |
|
|
} |
1686 |
|
|
|
1687 |
|
|
fail: |
1688 |
|
|
return 0; |
1689 |
|
|
} |
1690 |
|
|
|
1691 |
|
|
static SV * |
1692 |
root |
1.96 |
decode_json (SV *string, JSON *json, char **offset_return) |
1693 |
root |
1.1 |
{ |
1694 |
root |
1.25 |
dec_t dec; |
1695 |
root |
1.1 |
SV *sv; |
1696 |
|
|
|
1697 |
root |
1.94 |
/* work around bugs in 5.10 where manipulating magic values |
1698 |
root |
1.116 |
* makes perl ignore the magic in subsequent accesses. |
1699 |
root |
1.109 |
* also make a copy of non-PV values, to get them into a clean |
1700 |
|
|
* state (SvPV should do that, but it's buggy, see below). |
1701 |
root |
1.127 |
* |
1702 |
|
|
* SvIsCOW_shared_hash works around a bug in perl (possibly 5.16), |
1703 |
|
|
* as reported by Reini Urban. |
1704 |
root |
1.94 |
*/ |
1705 |
|
|
/*SvGETMAGIC (string);*/ |
1706 |
root |
1.127 |
if (SvMAGICAL (string) || !SvPOK (string) || SvIsCOW_shared_hash (string)) |
1707 |
root |
1.94 |
string = sv_2mortal (newSVsv (string)); |
1708 |
|
|
|
1709 |
root |
1.22 |
SvUPGRADE (string, SVt_PV); |
1710 |
|
|
|
1711 |
root |
1.87 |
/* work around a bug in perl 5.10, which causes SvCUR to fail an |
1712 |
|
|
* assertion with -DDEBUGGING, although SvCUR is documented to |
1713 |
|
|
* return the xpv_cur field which certainly exists after upgrading. |
1714 |
|
|
* according to nicholas clark, calling SvPOK fixes this. |
1715 |
root |
1.89 |
* But it doesn't fix it, so try another workaround, call SvPV_nolen |
1716 |
|
|
* and hope for the best. |
1717 |
root |
1.90 |
* Damnit, SvPV_nolen still trips over yet another assertion. This |
1718 |
|
|
* assertion business is seriously broken, try yet another workaround |
1719 |
|
|
* for the broken -DDEBUGGING. |
1720 |
root |
1.87 |
*/ |
1721 |
root |
1.96 |
{ |
1722 |
root |
1.89 |
#ifdef DEBUGGING |
1723 |
root |
1.96 |
STRLEN offset = SvOK (string) ? sv_len (string) : 0; |
1724 |
root |
1.90 |
#else |
1725 |
root |
1.96 |
STRLEN offset = SvCUR (string); |
1726 |
root |
1.89 |
#endif |
1727 |
root |
1.87 |
|
1728 |
root |
1.96 |
if (offset > json->max_size && json->max_size) |
1729 |
|
|
croak ("attempted decode of JSON text of %lu bytes size, but max_size is set to %lu", |
1730 |
|
|
(unsigned long)SvCUR (string), (unsigned long)json->max_size); |
1731 |
|
|
} |
1732 |
root |
1.45 |
|
1733 |
root |
1.108 |
if (DECODE_WANTS_OCTETS (json)) |
1734 |
root |
1.5 |
sv_utf8_downgrade (string, 0); |
1735 |
|
|
else |
1736 |
root |
1.1 |
sv_utf8_upgrade (string); |
1737 |
|
|
|
1738 |
|
|
SvGROW (string, SvCUR (string) + 1); // should basically be a NOP |
1739 |
|
|
|
1740 |
root |
1.85 |
dec.json = *json; |
1741 |
|
|
dec.cur = SvPVX (string); |
1742 |
|
|
dec.end = SvEND (string); |
1743 |
|
|
dec.err = 0; |
1744 |
|
|
dec.depth = 0; |
1745 |
root |
1.1 |
|
1746 |
root |
1.49 |
if (dec.json.cb_object || dec.json.cb_sk_object) |
1747 |
|
|
dec.json.flags |= F_HOOK; |
1748 |
|
|
|
1749 |
root |
1.31 |
*dec.end = 0; // this should basically be a nop, too, but make sure it's there |
1750 |
root |
1.63 |
|
1751 |
|
|
decode_ws (&dec); |
1752 |
root |
1.1 |
sv = decode_sv (&dec); |
1753 |
|
|
|
1754 |
root |
1.96 |
if (offset_return) |
1755 |
|
|
*offset_return = dec.cur; |
1756 |
|
|
|
1757 |
root |
1.32 |
if (!(offset_return || !sv)) |
1758 |
root |
1.31 |
{ |
1759 |
|
|
// check for trailing garbage |
1760 |
|
|
decode_ws (&dec); |
1761 |
|
|
|
1762 |
|
|
if (*dec.cur) |
1763 |
|
|
{ |
1764 |
|
|
dec.err = "garbage after JSON object"; |
1765 |
|
|
SvREFCNT_dec (sv); |
1766 |
|
|
sv = 0; |
1767 |
|
|
} |
1768 |
|
|
} |
1769 |
|
|
|
1770 |
root |
1.1 |
if (!sv) |
1771 |
|
|
{ |
1772 |
|
|
SV *uni = sv_newmortal (); |
1773 |
root |
1.8 |
|
1774 |
root |
1.5 |
// horrible hack to silence warning inside pv_uni_display |
1775 |
root |
1.8 |
COP cop = *PL_curcop; |
1776 |
root |
1.5 |
cop.cop_warnings = pWARN_NONE; |
1777 |
root |
1.8 |
ENTER; |
1778 |
root |
1.5 |
SAVEVPTR (PL_curcop); |
1779 |
|
|
PL_curcop = &cop; |
1780 |
root |
1.8 |
pv_uni_display (uni, dec.cur, dec.end - dec.cur, 20, UNI_DISPLAY_QQ); |
1781 |
|
|
LEAVE; |
1782 |
root |
1.1 |
|
1783 |
root |
1.96 |
croak ("%s, at character offset %d (before \"%s\")", |
1784 |
root |
1.1 |
dec.err, |
1785 |
root |
1.113 |
(int)ptr_to_index (string, dec.cur), |
1786 |
root |
1.1 |
dec.cur != dec.end ? SvPV_nolen (uni) : "(end of string)"); |
1787 |
|
|
} |
1788 |
|
|
|
1789 |
root |
1.3 |
sv = sv_2mortal (sv); |
1790 |
|
|
|
1791 |
root |
1.126 |
if (!(dec.json.flags & F_ALLOW_NONREF) && json_nonref (sv)) |
1792 |
root |
1.9 |
croak ("JSON text must be an object or array (but found number, string, true, false or null, use allow_nonref to allow this)"); |
1793 |
root |
1.3 |
|
1794 |
|
|
return sv; |
1795 |
root |
1.1 |
} |
1796 |
|
|
|
1797 |
root |
1.12 |
///////////////////////////////////////////////////////////////////////////// |
1798 |
root |
1.77 |
// incremental parser |
1799 |
|
|
|
1800 |
|
|
static void |
1801 |
|
|
incr_parse (JSON *self) |
1802 |
|
|
{ |
1803 |
|
|
const char *p = SvPVX (self->incr_text) + self->incr_pos; |
1804 |
|
|
|
1805 |
root |
1.103 |
// the state machine here is a bit convoluted and could be simplified a lot |
1806 |
|
|
// but this would make it slower, so... |
1807 |
|
|
|
1808 |
root |
1.77 |
for (;;) |
1809 |
|
|
{ |
1810 |
|
|
//printf ("loop pod %d *p<%c><%s>, mode %d nest %d\n", p - SvPVX (self->incr_text), *p, p, self->incr_mode, self->incr_nest);//D |
1811 |
|
|
switch (self->incr_mode) |
1812 |
|
|
{ |
1813 |
root |
1.103 |
// only used for initial whitespace skipping |
1814 |
root |
1.77 |
case INCR_M_WS: |
1815 |
|
|
for (;;) |
1816 |
|
|
{ |
1817 |
|
|
if (*p > 0x20) |
1818 |
|
|
{ |
1819 |
root |
1.103 |
if (*p == '#') |
1820 |
|
|
{ |
1821 |
|
|
self->incr_mode = INCR_M_C0; |
1822 |
|
|
goto incr_m_c; |
1823 |
|
|
} |
1824 |
|
|
else |
1825 |
|
|
{ |
1826 |
|
|
self->incr_mode = INCR_M_JSON; |
1827 |
|
|
goto incr_m_json; |
1828 |
|
|
} |
1829 |
root |
1.77 |
} |
1830 |
|
|
else if (!*p) |
1831 |
|
|
goto interrupt; |
1832 |
|
|
|
1833 |
|
|
++p; |
1834 |
|
|
} |
1835 |
|
|
|
1836 |
|
|
// skip a single char inside a string (for \\-processing) |
1837 |
|
|
case INCR_M_BS: |
1838 |
|
|
if (!*p) |
1839 |
|
|
goto interrupt; |
1840 |
|
|
|
1841 |
|
|
++p; |
1842 |
|
|
self->incr_mode = INCR_M_STR; |
1843 |
|
|
goto incr_m_str; |
1844 |
|
|
|
1845 |
root |
1.103 |
// inside #-style comments |
1846 |
|
|
case INCR_M_C0: |
1847 |
|
|
case INCR_M_C1: |
1848 |
|
|
incr_m_c: |
1849 |
|
|
for (;;) |
1850 |
|
|
{ |
1851 |
|
|
if (*p == '\n') |
1852 |
|
|
{ |
1853 |
|
|
self->incr_mode = self->incr_mode == INCR_M_C0 ? INCR_M_WS : INCR_M_JSON; |
1854 |
|
|
break; |
1855 |
|
|
} |
1856 |
|
|
else if (!*p) |
1857 |
|
|
goto interrupt; |
1858 |
|
|
|
1859 |
|
|
++p; |
1860 |
|
|
} |
1861 |
|
|
|
1862 |
|
|
break; |
1863 |
|
|
|
1864 |
root |
1.77 |
// inside a string |
1865 |
|
|
case INCR_M_STR: |
1866 |
|
|
incr_m_str: |
1867 |
|
|
for (;;) |
1868 |
|
|
{ |
1869 |
|
|
if (*p == '"') |
1870 |
|
|
{ |
1871 |
|
|
++p; |
1872 |
|
|
self->incr_mode = INCR_M_JSON; |
1873 |
|
|
|
1874 |
|
|
if (!self->incr_nest) |
1875 |
|
|
goto interrupt; |
1876 |
|
|
|
1877 |
|
|
goto incr_m_json; |
1878 |
|
|
} |
1879 |
|
|
else if (*p == '\\') |
1880 |
|
|
{ |
1881 |
|
|
++p; // "virtually" consumes character after \ |
1882 |
|
|
|
1883 |
|
|
if (!*p) // if at end of string we have to switch modes |
1884 |
|
|
{ |
1885 |
|
|
self->incr_mode = INCR_M_BS; |
1886 |
|
|
goto interrupt; |
1887 |
|
|
} |
1888 |
|
|
} |
1889 |
|
|
else if (!*p) |
1890 |
|
|
goto interrupt; |
1891 |
|
|
|
1892 |
|
|
++p; |
1893 |
|
|
} |
1894 |
|
|
|
1895 |
|
|
// after initial ws, outside string |
1896 |
|
|
case INCR_M_JSON: |
1897 |
|
|
incr_m_json: |
1898 |
|
|
for (;;) |
1899 |
|
|
{ |
1900 |
|
|
switch (*p++) |
1901 |
|
|
{ |
1902 |
|
|
case 0: |
1903 |
|
|
--p; |
1904 |
|
|
goto interrupt; |
1905 |
|
|
|
1906 |
|
|
case 0x09: |
1907 |
|
|
case 0x0a: |
1908 |
|
|
case 0x0d: |
1909 |
|
|
case 0x20: |
1910 |
|
|
if (!self->incr_nest) |
1911 |
|
|
{ |
1912 |
|
|
--p; // do not eat the whitespace, let the next round do it |
1913 |
|
|
goto interrupt; |
1914 |
|
|
} |
1915 |
|
|
break; |
1916 |
|
|
|
1917 |
|
|
case '"': |
1918 |
|
|
self->incr_mode = INCR_M_STR; |
1919 |
|
|
goto incr_m_str; |
1920 |
|
|
|
1921 |
|
|
case '[': |
1922 |
|
|
case '{': |
1923 |
root |
1.119 |
case '(': |
1924 |
root |
1.85 |
if (++self->incr_nest > self->max_depth) |
1925 |
|
|
croak (ERR_NESTING_EXCEEDED); |
1926 |
root |
1.77 |
break; |
1927 |
|
|
|
1928 |
|
|
case ']': |
1929 |
|
|
case '}': |
1930 |
root |
1.88 |
if (--self->incr_nest <= 0) |
1931 |
root |
1.77 |
goto interrupt; |
1932 |
root |
1.103 |
break; |
1933 |
|
|
|
1934 |
root |
1.119 |
case ')': |
1935 |
|
|
--self->incr_nest; |
1936 |
|
|
break; |
1937 |
|
|
|
1938 |
root |
1.103 |
case '#': |
1939 |
|
|
self->incr_mode = INCR_M_C1; |
1940 |
|
|
goto incr_m_c; |
1941 |
root |
1.77 |
} |
1942 |
|
|
} |
1943 |
|
|
} |
1944 |
|
|
|
1945 |
|
|
modechange: |
1946 |
|
|
; |
1947 |
|
|
} |
1948 |
|
|
|
1949 |
|
|
interrupt: |
1950 |
|
|
self->incr_pos = p - SvPVX (self->incr_text); |
1951 |
root |
1.103 |
//printf ("interrupt<%.*s>\n", self->incr_pos, SvPVX(self->incr_text));//D |
1952 |
root |
1.77 |
//printf ("return pos %d mode %d nest %d\n", self->incr_pos, self->incr_mode, self->incr_nest);//D |
1953 |
|
|
} |
1954 |
|
|
|
1955 |
|
|
///////////////////////////////////////////////////////////////////////////// |
1956 |
root |
1.12 |
// XS interface functions |
1957 |
|
|
|
1958 |
root |
1.1 |
MODULE = JSON::XS PACKAGE = JSON::XS |
1959 |
|
|
|
1960 |
|
|
BOOT: |
1961 |
|
|
{ |
1962 |
|
|
int i; |
1963 |
|
|
|
1964 |
root |
1.18 |
for (i = 0; i < 256; ++i) |
1965 |
|
|
decode_hexdigit [i] = |
1966 |
|
|
i >= '0' && i <= '9' ? i - '0' |
1967 |
|
|
: i >= 'a' && i <= 'f' ? i - 'a' + 10 |
1968 |
|
|
: i >= 'A' && i <= 'F' ? i - 'A' + 10 |
1969 |
|
|
: -1; |
1970 |
root |
1.1 |
|
1971 |
root |
1.126 |
json_stash = gv_stashpv ("JSON::XS" , 1); |
1972 |
|
|
bool_stash = gv_stashpv ("Types::Serialiser::Boolean", 1); |
1973 |
|
|
bool_true = get_bool ("Types::Serialiser::true"); |
1974 |
|
|
bool_false = get_bool ("Types::Serialiser::false"); |
1975 |
root |
1.43 |
|
1976 |
root |
1.119 |
sv_json = newSVpv ("JSON", 0); |
1977 |
|
|
SvREADONLY_on (sv_json); |
1978 |
root |
1.99 |
|
1979 |
|
|
CvNODEBUG_on (get_cv ("JSON::XS::incr_text", 0)); /* the debugger completely breaks lvalue subs */ |
1980 |
root |
1.1 |
} |
1981 |
|
|
|
1982 |
root |
1.4 |
PROTOTYPES: DISABLE |
1983 |
|
|
|
1984 |
root |
1.57 |
void CLONE (...) |
1985 |
|
|
CODE: |
1986 |
root |
1.126 |
json_stash = 0; |
1987 |
|
|
bool_stash = 0; |
1988 |
root |
1.57 |
|
1989 |
root |
1.48 |
void new (char *klass) |
1990 |
|
|
PPCODE: |
1991 |
|
|
{ |
1992 |
root |
1.115 |
SV *pv = NEWSV (0, sizeof (JSON)); |
1993 |
root |
1.48 |
SvPOK_only (pv); |
1994 |
root |
1.85 |
json_init ((JSON *)SvPVX (pv)); |
1995 |
root |
1.68 |
XPUSHs (sv_2mortal (sv_bless ( |
1996 |
|
|
newRV_noinc (pv), |
1997 |
|
|
strEQ (klass, "JSON::XS") ? JSON_STASH : gv_stashpv (klass, 1) |
1998 |
|
|
))); |
1999 |
root |
1.48 |
} |
2000 |
root |
1.1 |
|
2001 |
root |
1.48 |
void ascii (JSON *self, int enable = 1) |
2002 |
root |
1.1 |
ALIAS: |
2003 |
root |
1.44 |
ascii = F_ASCII |
2004 |
|
|
latin1 = F_LATIN1 |
2005 |
|
|
utf8 = F_UTF8 |
2006 |
|
|
indent = F_INDENT |
2007 |
|
|
canonical = F_CANONICAL |
2008 |
|
|
space_before = F_SPACE_BEFORE |
2009 |
|
|
space_after = F_SPACE_AFTER |
2010 |
|
|
pretty = F_PRETTY |
2011 |
|
|
allow_nonref = F_ALLOW_NONREF |
2012 |
|
|
shrink = F_SHRINK |
2013 |
|
|
allow_blessed = F_ALLOW_BLESSED |
2014 |
|
|
convert_blessed = F_CONV_BLESSED |
2015 |
root |
1.63 |
relaxed = F_RELAXED |
2016 |
root |
1.84 |
allow_unknown = F_ALLOW_UNKNOWN |
2017 |
root |
1.119 |
allow_tags = F_ALLOW_TAGS |
2018 |
root |
1.48 |
PPCODE: |
2019 |
root |
1.1 |
{ |
2020 |
|
|
if (enable) |
2021 |
root |
1.48 |
self->flags |= ix; |
2022 |
root |
1.1 |
else |
2023 |
root |
1.48 |
self->flags &= ~ix; |
2024 |
root |
1.1 |
|
2025 |
root |
1.48 |
XPUSHs (ST (0)); |
2026 |
root |
1.1 |
} |
2027 |
|
|
|
2028 |
root |
1.66 |
void get_ascii (JSON *self) |
2029 |
|
|
ALIAS: |
2030 |
|
|
get_ascii = F_ASCII |
2031 |
|
|
get_latin1 = F_LATIN1 |
2032 |
|
|
get_utf8 = F_UTF8 |
2033 |
|
|
get_indent = F_INDENT |
2034 |
|
|
get_canonical = F_CANONICAL |
2035 |
|
|
get_space_before = F_SPACE_BEFORE |
2036 |
|
|
get_space_after = F_SPACE_AFTER |
2037 |
|
|
get_allow_nonref = F_ALLOW_NONREF |
2038 |
|
|
get_shrink = F_SHRINK |
2039 |
|
|
get_allow_blessed = F_ALLOW_BLESSED |
2040 |
|
|
get_convert_blessed = F_CONV_BLESSED |
2041 |
|
|
get_relaxed = F_RELAXED |
2042 |
root |
1.84 |
get_allow_unknown = F_ALLOW_UNKNOWN |
2043 |
root |
1.119 |
get_allow_tags = F_ALLOW_TAGS |
2044 |
root |
1.66 |
PPCODE: |
2045 |
|
|
XPUSHs (boolSV (self->flags & ix)); |
2046 |
|
|
|
2047 |
root |
1.85 |
void max_depth (JSON *self, U32 max_depth = 0x80000000UL) |
2048 |
root |
1.48 |
PPCODE: |
2049 |
root |
1.85 |
self->max_depth = max_depth; |
2050 |
root |
1.48 |
XPUSHs (ST (0)); |
2051 |
root |
1.18 |
|
2052 |
root |
1.67 |
U32 get_max_depth (JSON *self) |
2053 |
root |
1.66 |
CODE: |
2054 |
root |
1.85 |
RETVAL = self->max_depth; |
2055 |
root |
1.66 |
OUTPUT: |
2056 |
|
|
RETVAL |
2057 |
|
|
|
2058 |
root |
1.85 |
void max_size (JSON *self, U32 max_size = 0) |
2059 |
root |
1.48 |
PPCODE: |
2060 |
root |
1.85 |
self->max_size = max_size; |
2061 |
root |
1.48 |
XPUSHs (ST (0)); |
2062 |
root |
1.45 |
|
2063 |
root |
1.66 |
int get_max_size (JSON *self) |
2064 |
|
|
CODE: |
2065 |
root |
1.85 |
RETVAL = self->max_size; |
2066 |
root |
1.66 |
OUTPUT: |
2067 |
|
|
RETVAL |
2068 |
|
|
|
2069 |
root |
1.51 |
void filter_json_object (JSON *self, SV *cb = &PL_sv_undef) |
2070 |
root |
1.49 |
PPCODE: |
2071 |
|
|
{ |
2072 |
root |
1.52 |
SvREFCNT_dec (self->cb_object); |
2073 |
|
|
self->cb_object = SvOK (cb) ? newSVsv (cb) : 0; |
2074 |
|
|
|
2075 |
|
|
XPUSHs (ST (0)); |
2076 |
|
|
} |
2077 |
|
|
|
2078 |
|
|
void filter_json_single_key_object (JSON *self, SV *key, SV *cb = &PL_sv_undef) |
2079 |
|
|
PPCODE: |
2080 |
|
|
{ |
2081 |
root |
1.114 |
if (!self->cb_sk_object) |
2082 |
root |
1.52 |
self->cb_sk_object = newHV (); |
2083 |
root |
1.51 |
|
2084 |
root |
1.52 |
if (SvOK (cb)) |
2085 |
|
|
hv_store_ent (self->cb_sk_object, key, newSVsv (cb), 0); |
2086 |
root |
1.51 |
else |
2087 |
root |
1.52 |
{ |
2088 |
|
|
hv_delete_ent (self->cb_sk_object, key, G_DISCARD, 0); |
2089 |
root |
1.49 |
|
2090 |
root |
1.52 |
if (!HvKEYS (self->cb_sk_object)) |
2091 |
|
|
{ |
2092 |
|
|
SvREFCNT_dec (self->cb_sk_object); |
2093 |
|
|
self->cb_sk_object = 0; |
2094 |
|
|
} |
2095 |
root |
1.49 |
} |
2096 |
|
|
|
2097 |
|
|
XPUSHs (ST (0)); |
2098 |
|
|
} |
2099 |
|
|
|
2100 |
root |
1.48 |
void encode (JSON *self, SV *scalar) |
2101 |
root |
1.1 |
PPCODE: |
2102 |
root |
1.114 |
PUTBACK; scalar = encode_json (scalar, self); SPAGAIN; |
2103 |
|
|
XPUSHs (scalar); |
2104 |
root |
1.1 |
|
2105 |
root |
1.48 |
void decode (JSON *self, SV *jsonstr) |
2106 |
root |
1.1 |
PPCODE: |
2107 |
root |
1.114 |
PUTBACK; jsonstr = decode_json (jsonstr, self, 0); SPAGAIN; |
2108 |
|
|
XPUSHs (jsonstr); |
2109 |
root |
1.31 |
|
2110 |
root |
1.48 |
void decode_prefix (JSON *self, SV *jsonstr) |
2111 |
root |
1.31 |
PPCODE: |
2112 |
|
|
{ |
2113 |
root |
1.114 |
SV *sv; |
2114 |
root |
1.96 |
char *offset; |
2115 |
root |
1.114 |
PUTBACK; sv = decode_json (jsonstr, self, &offset); SPAGAIN; |
2116 |
root |
1.31 |
EXTEND (SP, 2); |
2117 |
root |
1.114 |
PUSHs (sv); |
2118 |
root |
1.96 |
PUSHs (sv_2mortal (newSVuv (ptr_to_index (jsonstr, offset)))); |
2119 |
root |
1.31 |
} |
2120 |
root |
1.2 |
|
2121 |
root |
1.77 |
void incr_parse (JSON *self, SV *jsonstr = 0) |
2122 |
|
|
PPCODE: |
2123 |
|
|
{ |
2124 |
|
|
if (!self->incr_text) |
2125 |
|
|
self->incr_text = newSVpvn ("", 0); |
2126 |
|
|
|
2127 |
root |
1.108 |
/* if utf8-ness doesn't match the decoder, need to upgrade/downgrade */ |
2128 |
|
|
if (!DECODE_WANTS_OCTETS (self) == !SvUTF8 (self->incr_text)) |
2129 |
|
|
if (DECODE_WANTS_OCTETS (self)) |
2130 |
|
|
{ |
2131 |
|
|
if (self->incr_pos) |
2132 |
|
|
self->incr_pos = utf8_length ((U8 *)SvPVX (self->incr_text), |
2133 |
|
|
(U8 *)SvPVX (self->incr_text) + self->incr_pos); |
2134 |
|
|
|
2135 |
|
|
sv_utf8_downgrade (self->incr_text, 0); |
2136 |
|
|
} |
2137 |
|
|
else |
2138 |
|
|
{ |
2139 |
|
|
sv_utf8_upgrade (self->incr_text); |
2140 |
|
|
|
2141 |
|
|
if (self->incr_pos) |
2142 |
|
|
self->incr_pos = utf8_hop ((U8 *)SvPVX (self->incr_text), self->incr_pos) |
2143 |
|
|
- (U8 *)SvPVX (self->incr_text); |
2144 |
|
|
} |
2145 |
|
|
|
2146 |
root |
1.77 |
// append data, if any |
2147 |
|
|
if (jsonstr) |
2148 |
|
|
{ |
2149 |
root |
1.108 |
/* make sure both strings have same encoding */ |
2150 |
|
|
if (SvUTF8 (jsonstr) != SvUTF8 (self->incr_text)) |
2151 |
|
|
if (SvUTF8 (jsonstr)) |
2152 |
|
|
sv_utf8_downgrade (jsonstr, 0); |
2153 |
|
|
else |
2154 |
|
|
sv_utf8_upgrade (jsonstr); |
2155 |
root |
1.77 |
|
2156 |
root |
1.108 |
/* and then just blindly append */ |
2157 |
root |
1.77 |
{ |
2158 |
|
|
STRLEN len; |
2159 |
|
|
const char *str = SvPV (jsonstr, len); |
2160 |
root |
1.95 |
STRLEN cur = SvCUR (self->incr_text); |
2161 |
|
|
|
2162 |
|
|
if (SvLEN (self->incr_text) <= cur + len) |
2163 |
|
|
SvGROW (self->incr_text, cur + (len < (cur >> 2) ? cur >> 2 : len) + 1); |
2164 |
|
|
|
2165 |
root |
1.77 |
Move (str, SvEND (self->incr_text), len, char); |
2166 |
|
|
SvCUR_set (self->incr_text, SvCUR (self->incr_text) + len); |
2167 |
|
|
*SvEND (self->incr_text) = 0; // this should basically be a nop, too, but make sure it's there |
2168 |
|
|
} |
2169 |
|
|
} |
2170 |
|
|
|
2171 |
|
|
if (GIMME_V != G_VOID) |
2172 |
|
|
do |
2173 |
|
|
{ |
2174 |
root |
1.114 |
SV *sv; |
2175 |
root |
1.96 |
char *offset; |
2176 |
root |
1.77 |
|
2177 |
|
|
if (!INCR_DONE (self)) |
2178 |
root |
1.82 |
{ |
2179 |
|
|
incr_parse (self); |
2180 |
root |
1.85 |
|
2181 |
|
|
if (self->incr_pos > self->max_size && self->max_size) |
2182 |
|
|
croak ("attempted decode of JSON text of %lu bytes size, but max_size is set to %lu", |
2183 |
|
|
(unsigned long)self->incr_pos, (unsigned long)self->max_size); |
2184 |
|
|
|
2185 |
root |
1.82 |
if (!INCR_DONE (self)) |
2186 |
root |
1.111 |
{ |
2187 |
|
|
// as an optimisation, do not accumulate white space in the incr buffer |
2188 |
root |
1.112 |
if (self->incr_mode == INCR_M_WS && self->incr_pos) |
2189 |
|
|
{ |
2190 |
|
|
self->incr_pos = 0; |
2191 |
|
|
SvCUR_set (self->incr_text, 0); |
2192 |
|
|
} |
2193 |
root |
1.111 |
|
2194 |
|
|
break; |
2195 |
|
|
} |
2196 |
root |
1.82 |
} |
2197 |
root |
1.77 |
|
2198 |
root |
1.114 |
PUTBACK; sv = decode_json (self->incr_text, self, &offset); SPAGAIN; |
2199 |
|
|
XPUSHs (sv); |
2200 |
root |
1.77 |
|
2201 |
root |
1.96 |
self->incr_pos -= offset - SvPVX (self->incr_text); |
2202 |
root |
1.77 |
self->incr_nest = 0; |
2203 |
|
|
self->incr_mode = 0; |
2204 |
root |
1.96 |
|
2205 |
|
|
sv_chop (self->incr_text, offset); |
2206 |
root |
1.77 |
} |
2207 |
|
|
while (GIMME_V == G_ARRAY); |
2208 |
|
|
} |
2209 |
|
|
|
2210 |
|
|
SV *incr_text (JSON *self) |
2211 |
|
|
ATTRS: lvalue |
2212 |
|
|
CODE: |
2213 |
|
|
{ |
2214 |
|
|
if (self->incr_pos) |
2215 |
root |
1.82 |
croak ("incr_text can not be called when the incremental parser already started parsing"); |
2216 |
root |
1.77 |
|
2217 |
|
|
RETVAL = self->incr_text ? SvREFCNT_inc (self->incr_text) : &PL_sv_undef; |
2218 |
|
|
} |
2219 |
|
|
OUTPUT: |
2220 |
|
|
RETVAL |
2221 |
|
|
|
2222 |
root |
1.79 |
void incr_skip (JSON *self) |
2223 |
|
|
CODE: |
2224 |
|
|
{ |
2225 |
root |
1.81 |
if (self->incr_pos) |
2226 |
|
|
{ |
2227 |
|
|
sv_chop (self->incr_text, SvPV_nolen (self->incr_text) + self->incr_pos); |
2228 |
|
|
self->incr_pos = 0; |
2229 |
|
|
self->incr_nest = 0; |
2230 |
|
|
self->incr_mode = 0; |
2231 |
|
|
} |
2232 |
root |
1.79 |
} |
2233 |
|
|
|
2234 |
root |
1.86 |
void incr_reset (JSON *self) |
2235 |
|
|
CODE: |
2236 |
|
|
{ |
2237 |
|
|
SvREFCNT_dec (self->incr_text); |
2238 |
|
|
self->incr_text = 0; |
2239 |
|
|
self->incr_pos = 0; |
2240 |
|
|
self->incr_nest = 0; |
2241 |
|
|
self->incr_mode = 0; |
2242 |
|
|
} |
2243 |
|
|
|
2244 |
root |
1.52 |
void DESTROY (JSON *self) |
2245 |
|
|
CODE: |
2246 |
|
|
SvREFCNT_dec (self->cb_sk_object); |
2247 |
|
|
SvREFCNT_dec (self->cb_object); |
2248 |
root |
1.77 |
SvREFCNT_dec (self->incr_text); |
2249 |
root |
1.52 |
|
2250 |
root |
1.4 |
PROTOTYPES: ENABLE |
2251 |
|
|
|
2252 |
root |
1.69 |
void encode_json (SV *scalar) |
2253 |
root |
1.2 |
PPCODE: |
2254 |
root |
1.47 |
{ |
2255 |
root |
1.85 |
JSON json; |
2256 |
|
|
json_init (&json); |
2257 |
root |
1.118 |
json.flags |= F_UTF8; |
2258 |
root |
1.114 |
PUTBACK; scalar = encode_json (scalar, &json); SPAGAIN; |
2259 |
|
|
XPUSHs (scalar); |
2260 |
root |
1.47 |
} |
2261 |
root |
1.2 |
|
2262 |
root |
1.69 |
void decode_json (SV *jsonstr) |
2263 |
root |
1.2 |
PPCODE: |
2264 |
root |
1.47 |
{ |
2265 |
root |
1.85 |
JSON json; |
2266 |
|
|
json_init (&json); |
2267 |
root |
1.118 |
json.flags |= F_UTF8; |
2268 |
root |
1.114 |
PUTBACK; jsonstr = decode_json (jsonstr, &json, 0); SPAGAIN; |
2269 |
|
|
XPUSHs (jsonstr); |
2270 |
root |
1.47 |
} |
2271 |
root |
1.1 |
|