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