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