json 2.9.1 → 2.10.0

Sign up to get free protection for your applications and to get access to all the features.
@@ -1,1465 +0,0 @@
1
- #include "ruby.h"
2
- #include "../fbuffer/fbuffer.h"
3
-
4
- static VALUE mJSON, mExt, cParser, eNestingError, Encoding_UTF_8;
5
- static VALUE CNaN, CInfinity, CMinusInfinity;
6
-
7
- static ID i_json_creatable_p, i_json_create, i_create_id,
8
- i_chr, i_deep_const_get, i_match, i_aset, i_aref,
9
- i_leftshift, i_new, i_try_convert, i_uminus, i_encode;
10
-
11
- static VALUE sym_max_nesting, sym_allow_nan, sym_allow_trailing_comma, sym_symbolize_names, sym_freeze,
12
- sym_create_additions, sym_create_id, sym_object_class, sym_array_class,
13
- sym_decimal_class, sym_match_string;
14
-
15
- static int binary_encindex;
16
- static int utf8_encindex;
17
-
18
- #ifdef HAVE_RB_CATEGORY_WARN
19
- # define json_deprecated(message) rb_category_warn(RB_WARN_CATEGORY_DEPRECATED, message)
20
- #else
21
- # define json_deprecated(message) rb_warn(message)
22
- #endif
23
-
24
- static const char deprecated_create_additions_warning[] =
25
- "JSON.load implicit support for `create_additions: true` is deprecated "
26
- "and will be removed in 3.0, use JSON.unsafe_load or explicitly "
27
- "pass `create_additions: true`";
28
-
29
- #ifndef HAVE_RB_HASH_BULK_INSERT
30
- // For TruffleRuby
31
- void rb_hash_bulk_insert(long count, const VALUE *pairs, VALUE hash)
32
- {
33
- long index = 0;
34
- while (index < count) {
35
- VALUE name = pairs[index++];
36
- VALUE value = pairs[index++];
37
- rb_hash_aset(hash, name, value);
38
- }
39
- RB_GC_GUARD(hash);
40
- }
41
- #endif
42
-
43
- /* name cache */
44
-
45
- #include <string.h>
46
- #include <ctype.h>
47
-
48
- // Object names are likely to be repeated, and are frozen.
49
- // As such we can re-use them if we keep a cache of the ones we've seen so far,
50
- // and save much more expensive lookups into the global fstring table.
51
- // This cache implementation is deliberately simple, as we're optimizing for compactness,
52
- // to be able to fit safely on the stack.
53
- // As such, binary search into a sorted array gives a good tradeoff between compactness and
54
- // performance.
55
- #define JSON_RVALUE_CACHE_CAPA 63
56
- typedef struct rvalue_cache_struct {
57
- int length;
58
- VALUE entries[JSON_RVALUE_CACHE_CAPA];
59
- } rvalue_cache;
60
-
61
- static rb_encoding *enc_utf8;
62
-
63
- #define JSON_RVALUE_CACHE_MAX_ENTRY_LENGTH 55
64
-
65
- static inline VALUE build_interned_string(const char *str, const long length)
66
- {
67
- # ifdef HAVE_RB_ENC_INTERNED_STR
68
- return rb_enc_interned_str(str, length, enc_utf8);
69
- # else
70
- VALUE rstring = rb_utf8_str_new(str, length);
71
- return rb_funcall(rb_str_freeze(rstring), i_uminus, 0);
72
- # endif
73
- }
74
-
75
- static inline VALUE build_symbol(const char *str, const long length)
76
- {
77
- return rb_str_intern(build_interned_string(str, length));
78
- }
79
-
80
- static void rvalue_cache_insert_at(rvalue_cache *cache, int index, VALUE rstring)
81
- {
82
- MEMMOVE(&cache->entries[index + 1], &cache->entries[index], VALUE, cache->length - index);
83
- cache->length++;
84
- cache->entries[index] = rstring;
85
- }
86
-
87
- static inline int rstring_cache_cmp(const char *str, const long length, VALUE rstring)
88
- {
89
- long rstring_length = RSTRING_LEN(rstring);
90
- if (length == rstring_length) {
91
- return memcmp(str, RSTRING_PTR(rstring), length);
92
- } else {
93
- return (int)(length - rstring_length);
94
- }
95
- }
96
-
97
- static VALUE rstring_cache_fetch(rvalue_cache *cache, const char *str, const long length)
98
- {
99
- if (RB_UNLIKELY(length > JSON_RVALUE_CACHE_MAX_ENTRY_LENGTH)) {
100
- // Common names aren't likely to be very long. So we just don't
101
- // cache names above an arbitrary threshold.
102
- return Qfalse;
103
- }
104
-
105
- if (RB_UNLIKELY(!isalpha(str[0]))) {
106
- // Simple heuristic, if the first character isn't a letter,
107
- // we're much less likely to see this string again.
108
- // We mostly want to cache strings that are likely to be repeated.
109
- return Qfalse;
110
- }
111
-
112
- int low = 0;
113
- int high = cache->length - 1;
114
- int mid = 0;
115
- int last_cmp = 0;
116
-
117
- while (low <= high) {
118
- mid = (high + low) >> 1;
119
- VALUE entry = cache->entries[mid];
120
- last_cmp = rstring_cache_cmp(str, length, entry);
121
-
122
- if (last_cmp == 0) {
123
- return entry;
124
- } else if (last_cmp > 0) {
125
- low = mid + 1;
126
- } else {
127
- high = mid - 1;
128
- }
129
- }
130
-
131
- if (RB_UNLIKELY(memchr(str, '\\', length))) {
132
- // We assume the overwhelming majority of names don't need to be escaped.
133
- // But if they do, we have to fallback to the slow path.
134
- return Qfalse;
135
- }
136
-
137
- VALUE rstring = build_interned_string(str, length);
138
-
139
- if (cache->length < JSON_RVALUE_CACHE_CAPA) {
140
- if (last_cmp > 0) {
141
- mid += 1;
142
- }
143
-
144
- rvalue_cache_insert_at(cache, mid, rstring);
145
- }
146
- return rstring;
147
- }
148
-
149
- static VALUE rsymbol_cache_fetch(rvalue_cache *cache, const char *str, const long length)
150
- {
151
- if (RB_UNLIKELY(length > JSON_RVALUE_CACHE_MAX_ENTRY_LENGTH)) {
152
- // Common names aren't likely to be very long. So we just don't
153
- // cache names above an arbitrary threshold.
154
- return Qfalse;
155
- }
156
-
157
- if (RB_UNLIKELY(!isalpha(str[0]))) {
158
- // Simple heuristic, if the first character isn't a letter,
159
- // we're much less likely to see this string again.
160
- // We mostly want to cache strings that are likely to be repeated.
161
- return Qfalse;
162
- }
163
-
164
- int low = 0;
165
- int high = cache->length - 1;
166
- int mid = 0;
167
- int last_cmp = 0;
168
-
169
- while (low <= high) {
170
- mid = (high + low) >> 1;
171
- VALUE entry = cache->entries[mid];
172
- last_cmp = rstring_cache_cmp(str, length, rb_sym2str(entry));
173
-
174
- if (last_cmp == 0) {
175
- return entry;
176
- } else if (last_cmp > 0) {
177
- low = mid + 1;
178
- } else {
179
- high = mid - 1;
180
- }
181
- }
182
-
183
- if (RB_UNLIKELY(memchr(str, '\\', length))) {
184
- // We assume the overwhelming majority of names don't need to be escaped.
185
- // But if they do, we have to fallback to the slow path.
186
- return Qfalse;
187
- }
188
-
189
- VALUE rsymbol = build_symbol(str, length);
190
-
191
- if (cache->length < JSON_RVALUE_CACHE_CAPA) {
192
- if (last_cmp > 0) {
193
- mid += 1;
194
- }
195
-
196
- rvalue_cache_insert_at(cache, mid, rsymbol);
197
- }
198
- return rsymbol;
199
- }
200
-
201
- /* rvalue stack */
202
-
203
- #define RVALUE_STACK_INITIAL_CAPA 128
204
-
205
- enum rvalue_stack_type {
206
- RVALUE_STACK_HEAP_ALLOCATED = 0,
207
- RVALUE_STACK_STACK_ALLOCATED = 1,
208
- };
209
-
210
- typedef struct rvalue_stack_struct {
211
- enum rvalue_stack_type type;
212
- long capa;
213
- long head;
214
- VALUE *ptr;
215
- } rvalue_stack;
216
-
217
- static rvalue_stack *rvalue_stack_spill(rvalue_stack *old_stack, VALUE *handle, rvalue_stack **stack_ref);
218
-
219
- static rvalue_stack *rvalue_stack_grow(rvalue_stack *stack, VALUE *handle, rvalue_stack **stack_ref)
220
- {
221
- long required = stack->capa * 2;
222
-
223
- if (stack->type == RVALUE_STACK_STACK_ALLOCATED) {
224
- stack = rvalue_stack_spill(stack, handle, stack_ref);
225
- } else {
226
- REALLOC_N(stack->ptr, VALUE, required);
227
- stack->capa = required;
228
- }
229
- return stack;
230
- }
231
-
232
- static void rvalue_stack_push(rvalue_stack *stack, VALUE value, VALUE *handle, rvalue_stack **stack_ref)
233
- {
234
- if (RB_UNLIKELY(stack->head >= stack->capa)) {
235
- stack = rvalue_stack_grow(stack, handle, stack_ref);
236
- }
237
- stack->ptr[stack->head] = value;
238
- stack->head++;
239
- }
240
-
241
- static inline VALUE *rvalue_stack_peek(rvalue_stack *stack, long count)
242
- {
243
- return stack->ptr + (stack->head - count);
244
- }
245
-
246
- static inline void rvalue_stack_pop(rvalue_stack *stack, long count)
247
- {
248
- stack->head -= count;
249
- }
250
-
251
- static void rvalue_stack_mark(void *ptr)
252
- {
253
- rvalue_stack *stack = (rvalue_stack *)ptr;
254
- long index;
255
- for (index = 0; index < stack->head; index++) {
256
- rb_gc_mark(stack->ptr[index]);
257
- }
258
- }
259
-
260
- static void rvalue_stack_free(void *ptr)
261
- {
262
- rvalue_stack *stack = (rvalue_stack *)ptr;
263
- if (stack) {
264
- ruby_xfree(stack->ptr);
265
- ruby_xfree(stack);
266
- }
267
- }
268
-
269
- static size_t rvalue_stack_memsize(const void *ptr)
270
- {
271
- const rvalue_stack *stack = (const rvalue_stack *)ptr;
272
- return sizeof(rvalue_stack) + sizeof(VALUE) * stack->capa;
273
- }
274
-
275
- static const rb_data_type_t JSON_Parser_rvalue_stack_type = {
276
- "JSON::Ext::Parser/rvalue_stack",
277
- {
278
- .dmark = rvalue_stack_mark,
279
- .dfree = rvalue_stack_free,
280
- .dsize = rvalue_stack_memsize,
281
- },
282
- 0, 0,
283
- RUBY_TYPED_FREE_IMMEDIATELY,
284
- };
285
-
286
- static rvalue_stack *rvalue_stack_spill(rvalue_stack *old_stack, VALUE *handle, rvalue_stack **stack_ref)
287
- {
288
- rvalue_stack *stack;
289
- *handle = TypedData_Make_Struct(0, rvalue_stack, &JSON_Parser_rvalue_stack_type, stack);
290
- *stack_ref = stack;
291
- MEMCPY(stack, old_stack, rvalue_stack, 1);
292
-
293
- stack->capa = old_stack->capa << 1;
294
- stack->ptr = ALLOC_N(VALUE, stack->capa);
295
- stack->type = RVALUE_STACK_HEAP_ALLOCATED;
296
- MEMCPY(stack->ptr, old_stack->ptr, VALUE, old_stack->head);
297
- return stack;
298
- }
299
-
300
- static void rvalue_stack_eagerly_release(VALUE handle)
301
- {
302
- rvalue_stack *stack;
303
- TypedData_Get_Struct(handle, rvalue_stack, &JSON_Parser_rvalue_stack_type, stack);
304
- RTYPEDDATA_DATA(handle) = NULL;
305
- rvalue_stack_free(stack);
306
- }
307
-
308
- /* unicode */
309
-
310
- static const signed char digit_values[256] = {
311
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
312
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
313
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, -1,
314
- -1, -1, -1, -1, -1, -1, 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1,
315
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
316
- 10, 11, 12, 13, 14, 15, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
317
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
318
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
319
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
320
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
321
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
322
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
323
- -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1, -1,
324
- -1, -1, -1, -1, -1, -1, -1
325
- };
326
-
327
- static uint32_t unescape_unicode(const unsigned char *p)
328
- {
329
- const uint32_t replacement_char = 0xFFFD;
330
-
331
- signed char b;
332
- uint32_t result = 0;
333
- b = digit_values[p[0]];
334
- if (b < 0) return replacement_char;
335
- result = (result << 4) | (unsigned char)b;
336
- b = digit_values[p[1]];
337
- if (b < 0) return replacement_char;
338
- result = (result << 4) | (unsigned char)b;
339
- b = digit_values[p[2]];
340
- if (b < 0) return replacement_char;
341
- result = (result << 4) | (unsigned char)b;
342
- b = digit_values[p[3]];
343
- if (b < 0) return replacement_char;
344
- result = (result << 4) | (unsigned char)b;
345
- return result;
346
- }
347
-
348
- static int convert_UTF32_to_UTF8(char *buf, uint32_t ch)
349
- {
350
- int len = 1;
351
- if (ch <= 0x7F) {
352
- buf[0] = (char) ch;
353
- } else if (ch <= 0x07FF) {
354
- buf[0] = (char) ((ch >> 6) | 0xC0);
355
- buf[1] = (char) ((ch & 0x3F) | 0x80);
356
- len++;
357
- } else if (ch <= 0xFFFF) {
358
- buf[0] = (char) ((ch >> 12) | 0xE0);
359
- buf[1] = (char) (((ch >> 6) & 0x3F) | 0x80);
360
- buf[2] = (char) ((ch & 0x3F) | 0x80);
361
- len += 2;
362
- } else if (ch <= 0x1fffff) {
363
- buf[0] =(char) ((ch >> 18) | 0xF0);
364
- buf[1] =(char) (((ch >> 12) & 0x3F) | 0x80);
365
- buf[2] =(char) (((ch >> 6) & 0x3F) | 0x80);
366
- buf[3] =(char) ((ch & 0x3F) | 0x80);
367
- len += 3;
368
- } else {
369
- buf[0] = '?';
370
- }
371
- return len;
372
- }
373
-
374
- typedef struct JSON_ParserStruct {
375
- VALUE Vsource;
376
- char *source;
377
- long len;
378
- char *memo;
379
- VALUE create_id;
380
- VALUE object_class;
381
- VALUE array_class;
382
- VALUE decimal_class;
383
- VALUE match_string;
384
- FBuffer fbuffer;
385
- int in_array;
386
- int max_nesting;
387
- bool allow_nan;
388
- bool allow_trailing_comma;
389
- bool parsing_name;
390
- bool symbolize_names;
391
- bool freeze;
392
- bool create_additions;
393
- bool deprecated_create_additions;
394
- rvalue_cache name_cache;
395
- rvalue_stack *stack;
396
- VALUE stack_handle;
397
- } JSON_Parser;
398
-
399
- #define GET_PARSER \
400
- GET_PARSER_INIT; \
401
- if (!json->Vsource) rb_raise(rb_eTypeError, "uninitialized instance")
402
-
403
- #define GET_PARSER_INIT \
404
- JSON_Parser *json; \
405
- TypedData_Get_Struct(self, JSON_Parser, &JSON_Parser_type, json)
406
-
407
- #define MinusInfinity "-Infinity"
408
- #define EVIL 0x666
409
-
410
- static const rb_data_type_t JSON_Parser_type;
411
- static char *JSON_parse_string(JSON_Parser *json, char *p, char *pe, VALUE *result);
412
- static char *JSON_parse_object(JSON_Parser *json, char *p, char *pe, VALUE *result, int current_nesting);
413
- static char *JSON_parse_value(JSON_Parser *json, char *p, char *pe, VALUE *result, int current_nesting);
414
- static char *JSON_parse_number(JSON_Parser *json, char *p, char *pe, VALUE *result);
415
- static char *JSON_parse_array(JSON_Parser *json, char *p, char *pe, VALUE *result, int current_nesting);
416
-
417
-
418
- #ifndef HAVE_STRNLEN
419
- static size_t strnlen(const char *s, size_t maxlen)
420
- {
421
- char *p;
422
- return ((p = memchr(s, '\0', maxlen)) ? p - s : maxlen);
423
- }
424
- #endif
425
-
426
- #define PARSE_ERROR_FRAGMENT_LEN 32
427
- #ifdef RBIMPL_ATTR_NORETURN
428
- RBIMPL_ATTR_NORETURN()
429
- #endif
430
- static void raise_parse_error(const char *format, const char *start)
431
- {
432
- char buffer[PARSE_ERROR_FRAGMENT_LEN + 1];
433
-
434
- size_t len = strnlen(start, PARSE_ERROR_FRAGMENT_LEN);
435
- const char *ptr = start;
436
-
437
- if (len == PARSE_ERROR_FRAGMENT_LEN) {
438
- MEMCPY(buffer, start, char, PARSE_ERROR_FRAGMENT_LEN);
439
- buffer[PARSE_ERROR_FRAGMENT_LEN] = '\0';
440
- ptr = buffer;
441
- }
442
-
443
- rb_enc_raise(enc_utf8, rb_path2class("JSON::ParserError"), format, ptr);
444
- }
445
-
446
-
447
- %%{
448
- machine JSON_common;
449
-
450
- cr = '\n';
451
- cr_neg = [^\n];
452
- ws = [ \t\r\n];
453
- c_comment = '/*' ( any* - (any* '*/' any* ) ) '*/';
454
- cpp_comment = '//' cr_neg* cr;
455
- comment = c_comment | cpp_comment;
456
- ignore = ws | comment;
457
- name_separator = ':';
458
- value_separator = ',';
459
- Vnull = 'null';
460
- Vfalse = 'false';
461
- Vtrue = 'true';
462
- VNaN = 'NaN';
463
- VInfinity = 'Infinity';
464
- VMinusInfinity = '-Infinity';
465
- begin_value = [nft\"\-\[\{NI] | digit;
466
- begin_object = '{';
467
- end_object = '}';
468
- begin_array = '[';
469
- end_array = ']';
470
- begin_string = '"';
471
- begin_name = begin_string;
472
- begin_number = digit | '-';
473
- }%%
474
-
475
- %%{
476
- machine JSON_object;
477
- include JSON_common;
478
-
479
- write data;
480
-
481
- action parse_value {
482
- char *np = JSON_parse_value(json, fpc, pe, result, current_nesting);
483
- if (np == NULL) {
484
- fhold; fbreak;
485
- } else {
486
- fexec np;
487
- }
488
- }
489
-
490
- action allow_trailing_comma { json->allow_trailing_comma }
491
-
492
- action parse_name {
493
- char *np;
494
- json->parsing_name = true;
495
- np = JSON_parse_string(json, fpc, pe, result);
496
- json->parsing_name = false;
497
- if (np == NULL) { fhold; fbreak; } else {
498
- PUSH(*result);
499
- fexec np;
500
- }
501
- }
502
-
503
- action exit { fhold; fbreak; }
504
-
505
- pair = ignore* begin_name >parse_name ignore* name_separator ignore* begin_value >parse_value;
506
- next_pair = ignore* value_separator pair;
507
-
508
- main := (
509
- begin_object
510
- (pair (next_pair)*((ignore* value_separator) when allow_trailing_comma)?)? ignore*
511
- end_object
512
- ) @exit;
513
- }%%
514
-
515
- #define PUSH(result) rvalue_stack_push(json->stack, result, &json->stack_handle, &json->stack)
516
-
517
- static char *JSON_parse_object(JSON_Parser *json, char *p, char *pe, VALUE *result, int current_nesting)
518
- {
519
- int cs = EVIL;
520
-
521
- if (json->max_nesting && current_nesting > json->max_nesting) {
522
- rb_raise(eNestingError, "nesting of %d is too deep", current_nesting);
523
- }
524
-
525
- long stack_head = json->stack->head;
526
-
527
- %% write init;
528
- %% write exec;
529
-
530
- if (cs >= JSON_object_first_final) {
531
- long count = json->stack->head - stack_head;
532
-
533
- if (RB_UNLIKELY(json->object_class)) {
534
- VALUE object = rb_class_new_instance(0, 0, json->object_class);
535
- long index = 0;
536
- VALUE *items = rvalue_stack_peek(json->stack, count);
537
- while (index < count) {
538
- VALUE name = items[index++];
539
- VALUE value = items[index++];
540
- rb_funcall(object, i_aset, 2, name, value);
541
- }
542
- *result = object;
543
- } else {
544
- VALUE hash;
545
- #ifdef HAVE_RB_HASH_NEW_CAPA
546
- hash = rb_hash_new_capa(count >> 1);
547
- #else
548
- hash = rb_hash_new();
549
- #endif
550
- rb_hash_bulk_insert(count, rvalue_stack_peek(json->stack, count), hash);
551
- *result = hash;
552
- }
553
- rvalue_stack_pop(json->stack, count);
554
-
555
- if (RB_UNLIKELY(json->create_additions)) {
556
- VALUE klassname;
557
- if (json->object_class) {
558
- klassname = rb_funcall(*result, i_aref, 1, json->create_id);
559
- } else {
560
- klassname = rb_hash_aref(*result, json->create_id);
561
- }
562
- if (!NIL_P(klassname)) {
563
- VALUE klass = rb_funcall(mJSON, i_deep_const_get, 1, klassname);
564
- if (RTEST(rb_funcall(klass, i_json_creatable_p, 0))) {
565
- if (json->deprecated_create_additions) {
566
- json_deprecated(deprecated_create_additions_warning);
567
- }
568
- *result = rb_funcall(klass, i_json_create, 1, *result);
569
- }
570
- }
571
- }
572
- return p + 1;
573
- } else {
574
- return NULL;
575
- }
576
- }
577
-
578
- %%{
579
- machine JSON_value;
580
- include JSON_common;
581
-
582
- write data;
583
-
584
- action parse_null {
585
- *result = Qnil;
586
- }
587
- action parse_false {
588
- *result = Qfalse;
589
- }
590
- action parse_true {
591
- *result = Qtrue;
592
- }
593
- action parse_nan {
594
- if (json->allow_nan) {
595
- *result = CNaN;
596
- } else {
597
- raise_parse_error("unexpected token at '%s'", p - 2);
598
- }
599
- }
600
- action parse_infinity {
601
- if (json->allow_nan) {
602
- *result = CInfinity;
603
- } else {
604
- raise_parse_error("unexpected token at '%s'", p - 7);
605
- }
606
- }
607
- action parse_string {
608
- char *np = JSON_parse_string(json, fpc, pe, result);
609
- if (np == NULL) {
610
- fhold;
611
- fbreak;
612
- } else {
613
- fexec np;
614
- }
615
- }
616
-
617
- action parse_number {
618
- char *np;
619
- if(pe > fpc + 8 && !strncmp(MinusInfinity, fpc, 9)) {
620
- if (json->allow_nan) {
621
- *result = CMinusInfinity;
622
- fexec p + 10;
623
- fhold; fbreak;
624
- } else {
625
- raise_parse_error("unexpected token at '%s'", p);
626
- }
627
- }
628
- np = JSON_parse_number(json, fpc, pe, result);
629
- if (np != NULL) {
630
- fexec np;
631
- }
632
- fhold; fbreak;
633
- }
634
-
635
- action parse_array {
636
- char *np;
637
- json->in_array++;
638
- np = JSON_parse_array(json, fpc, pe, result, current_nesting + 1);
639
- json->in_array--;
640
- if (np == NULL) { fhold; fbreak; } else fexec np;
641
- }
642
-
643
- action parse_object {
644
- char *np;
645
- np = JSON_parse_object(json, fpc, pe, result, current_nesting + 1);
646
- if (np == NULL) { fhold; fbreak; } else fexec np;
647
- }
648
-
649
- action exit { fhold; fbreak; }
650
-
651
- main := ignore* (
652
- Vnull @parse_null |
653
- Vfalse @parse_false |
654
- Vtrue @parse_true |
655
- VNaN @parse_nan |
656
- VInfinity @parse_infinity |
657
- begin_number @parse_number |
658
- begin_string @parse_string |
659
- begin_array @parse_array |
660
- begin_object @parse_object
661
- ) ignore* %*exit;
662
- }%%
663
-
664
- static char *JSON_parse_value(JSON_Parser *json, char *p, char *pe, VALUE *result, int current_nesting)
665
- {
666
- int cs = EVIL;
667
-
668
- %% write init;
669
- %% write exec;
670
-
671
- if (json->freeze) {
672
- OBJ_FREEZE(*result);
673
- }
674
-
675
- if (cs >= JSON_value_first_final) {
676
- PUSH(*result);
677
- return p;
678
- } else {
679
- return NULL;
680
- }
681
- }
682
-
683
- %%{
684
- machine JSON_integer;
685
-
686
- write data;
687
-
688
- action exit { fhold; fbreak; }
689
-
690
- main := '-'? ('0' | [1-9][0-9]*) (^[0-9]? @exit);
691
- }%%
692
-
693
- #define MAX_FAST_INTEGER_SIZE 18
694
- static inline VALUE fast_parse_integer(char *p, char *pe)
695
- {
696
- bool negative = false;
697
- if (*p == '-') {
698
- negative = true;
699
- p++;
700
- }
701
-
702
- long long memo = 0;
703
- while (p < pe) {
704
- memo *= 10;
705
- memo += *p - '0';
706
- p++;
707
- }
708
-
709
- if (negative) {
710
- memo = -memo;
711
- }
712
- return LL2NUM(memo);
713
- }
714
-
715
- static char *JSON_decode_integer(JSON_Parser *json, char *p, VALUE *result)
716
- {
717
- long len = p - json->memo;
718
- if (RB_LIKELY(len < MAX_FAST_INTEGER_SIZE)) {
719
- *result = fast_parse_integer(json->memo, p);
720
- } else {
721
- fbuffer_clear(&json->fbuffer);
722
- fbuffer_append(&json->fbuffer, json->memo, len);
723
- fbuffer_append_char(&json->fbuffer, '\0');
724
- *result = rb_cstr2inum(FBUFFER_PTR(&json->fbuffer), 10);
725
- }
726
- return p + 1;
727
- }
728
-
729
- %%{
730
- machine JSON_float;
731
- include JSON_common;
732
-
733
- write data;
734
-
735
- action exit { fhold; fbreak; }
736
- action isFloat { is_float = true; }
737
-
738
- main := '-'? (
739
- (('0' | [1-9][0-9]*)
740
- ((('.' [0-9]+ ([Ee] [+\-]?[0-9]+)?) |
741
- ([Ee] [+\-]?[0-9]+)) > isFloat)?
742
- ) (^[0-9Ee.\-]? @exit ));
743
- }%%
744
-
745
- static char *JSON_parse_number(JSON_Parser *json, char *p, char *pe, VALUE *result)
746
- {
747
- int cs = EVIL;
748
- bool is_float = false;
749
-
750
- %% write init;
751
- json->memo = p;
752
- %% write exec;
753
-
754
- if (cs >= JSON_float_first_final) {
755
- if (!is_float) {
756
- return JSON_decode_integer(json, p, result);
757
- }
758
- VALUE mod = Qnil;
759
- ID method_id = 0;
760
- if (json->decimal_class) {
761
- if (rb_respond_to(json->decimal_class, i_try_convert)) {
762
- mod = json->decimal_class;
763
- method_id = i_try_convert;
764
- } else if (rb_respond_to(json->decimal_class, i_new)) {
765
- mod = json->decimal_class;
766
- method_id = i_new;
767
- } else if (RB_TYPE_P(json->decimal_class, T_CLASS)) {
768
- VALUE name = rb_class_name(json->decimal_class);
769
- const char *name_cstr = RSTRING_PTR(name);
770
- const char *last_colon = strrchr(name_cstr, ':');
771
- if (last_colon) {
772
- const char *mod_path_end = last_colon - 1;
773
- VALUE mod_path = rb_str_substr(name, 0, mod_path_end - name_cstr);
774
- mod = rb_path_to_class(mod_path);
775
-
776
- const char *method_name_beg = last_colon + 1;
777
- long before_len = method_name_beg - name_cstr;
778
- long len = RSTRING_LEN(name) - before_len;
779
- VALUE method_name = rb_str_substr(name, before_len, len);
780
- method_id = SYM2ID(rb_str_intern(method_name));
781
- } else {
782
- mod = rb_mKernel;
783
- method_id = SYM2ID(rb_str_intern(name));
784
- }
785
- }
786
- }
787
-
788
- long len = p - json->memo;
789
- fbuffer_clear(&json->fbuffer);
790
- fbuffer_append(&json->fbuffer, json->memo, len);
791
- fbuffer_append_char(&json->fbuffer, '\0');
792
-
793
- if (method_id) {
794
- VALUE text = rb_str_new2(FBUFFER_PTR(&json->fbuffer));
795
- *result = rb_funcallv(mod, method_id, 1, &text);
796
- } else {
797
- *result = DBL2NUM(rb_cstr_to_dbl(FBUFFER_PTR(&json->fbuffer), 1));
798
- }
799
-
800
- return p + 1;
801
- } else {
802
- return NULL;
803
- }
804
- }
805
-
806
-
807
- %%{
808
- machine JSON_array;
809
- include JSON_common;
810
-
811
- write data;
812
-
813
- action parse_value {
814
- VALUE v = Qnil;
815
- char *np = JSON_parse_value(json, fpc, pe, &v, current_nesting);
816
- if (np == NULL) {
817
- fhold; fbreak;
818
- } else {
819
- fexec np;
820
- }
821
- }
822
-
823
- action allow_trailing_comma { json->allow_trailing_comma }
824
-
825
- action exit { fhold; fbreak; }
826
-
827
- next_element = value_separator ignore* begin_value >parse_value;
828
-
829
- main := begin_array ignore*
830
- ((begin_value >parse_value ignore*)
831
- (ignore* next_element ignore*)*((value_separator ignore*) when allow_trailing_comma)?)?
832
- end_array @exit;
833
- }%%
834
-
835
- static char *JSON_parse_array(JSON_Parser *json, char *p, char *pe, VALUE *result, int current_nesting)
836
- {
837
- int cs = EVIL;
838
-
839
- if (json->max_nesting && current_nesting > json->max_nesting) {
840
- rb_raise(eNestingError, "nesting of %d is too deep", current_nesting);
841
- }
842
- long stack_head = json->stack->head;
843
-
844
- %% write init;
845
- %% write exec;
846
-
847
- if(cs >= JSON_array_first_final) {
848
- long count = json->stack->head - stack_head;
849
-
850
- if (RB_UNLIKELY(json->array_class)) {
851
- VALUE array = rb_class_new_instance(0, 0, json->array_class);
852
- VALUE *items = rvalue_stack_peek(json->stack, count);
853
- long index;
854
- for (index = 0; index < count; index++) {
855
- rb_funcall(array, i_leftshift, 1, items[index]);
856
- }
857
- *result = array;
858
- } else {
859
- VALUE array = rb_ary_new_from_values(count, rvalue_stack_peek(json->stack, count));
860
- *result = array;
861
- }
862
- rvalue_stack_pop(json->stack, count);
863
-
864
- return p + 1;
865
- } else {
866
- raise_parse_error("unexpected token at '%s'", p);
867
- return NULL;
868
- }
869
- }
870
-
871
- static inline VALUE build_string(const char *start, const char *end, bool intern, bool symbolize)
872
- {
873
- if (symbolize) {
874
- intern = true;
875
- }
876
- VALUE result;
877
- # ifdef HAVE_RB_ENC_INTERNED_STR
878
- if (intern) {
879
- result = rb_enc_interned_str(start, (long)(end - start), enc_utf8);
880
- } else {
881
- result = rb_utf8_str_new(start, (long)(end - start));
882
- }
883
- # else
884
- result = rb_utf8_str_new(start, (long)(end - start));
885
- if (intern) {
886
- result = rb_funcall(rb_str_freeze(result), i_uminus, 0);
887
- }
888
- # endif
889
-
890
- if (symbolize) {
891
- result = rb_str_intern(result);
892
- }
893
-
894
- return result;
895
- }
896
-
897
- static VALUE json_string_fastpath(JSON_Parser *json, char *string, char *stringEnd, bool is_name, bool intern, bool symbolize)
898
- {
899
- size_t bufferSize = stringEnd - string;
900
-
901
- if (is_name && json->in_array) {
902
- VALUE cached_key;
903
- if (RB_UNLIKELY(symbolize)) {
904
- cached_key = rsymbol_cache_fetch(&json->name_cache, string, bufferSize);
905
- } else {
906
- cached_key = rstring_cache_fetch(&json->name_cache, string, bufferSize);
907
- }
908
-
909
- if (RB_LIKELY(cached_key)) {
910
- return cached_key;
911
- }
912
- }
913
-
914
- return build_string(string, stringEnd, intern, symbolize);
915
- }
916
-
917
- static VALUE json_string_unescape(JSON_Parser *json, char *string, char *stringEnd, bool is_name, bool intern, bool symbolize)
918
- {
919
- size_t bufferSize = stringEnd - string;
920
- char *p = string, *pe = string, *unescape, *bufferStart, *buffer;
921
- int unescape_len;
922
- char buf[4];
923
-
924
- if (is_name && json->in_array) {
925
- VALUE cached_key;
926
- if (RB_UNLIKELY(symbolize)) {
927
- cached_key = rsymbol_cache_fetch(&json->name_cache, string, bufferSize);
928
- } else {
929
- cached_key = rstring_cache_fetch(&json->name_cache, string, bufferSize);
930
- }
931
-
932
- if (RB_LIKELY(cached_key)) {
933
- return cached_key;
934
- }
935
- }
936
-
937
- pe = memchr(p, '\\', bufferSize);
938
- if (RB_UNLIKELY(pe == NULL)) {
939
- return build_string(string, stringEnd, intern, symbolize);
940
- }
941
-
942
- VALUE result = rb_str_buf_new(bufferSize);
943
- rb_enc_associate_index(result, utf8_encindex);
944
- buffer = bufferStart = RSTRING_PTR(result);
945
-
946
- while (pe < stringEnd) {
947
- if (*pe == '\\') {
948
- unescape = (char *) "?";
949
- unescape_len = 1;
950
- if (pe > p) {
951
- MEMCPY(buffer, p, char, pe - p);
952
- buffer += pe - p;
953
- }
954
- switch (*++pe) {
955
- case 'n':
956
- unescape = (char *) "\n";
957
- break;
958
- case 'r':
959
- unescape = (char *) "\r";
960
- break;
961
- case 't':
962
- unescape = (char *) "\t";
963
- break;
964
- case '"':
965
- unescape = (char *) "\"";
966
- break;
967
- case '\\':
968
- unescape = (char *) "\\";
969
- break;
970
- case 'b':
971
- unescape = (char *) "\b";
972
- break;
973
- case 'f':
974
- unescape = (char *) "\f";
975
- break;
976
- case 'u':
977
- if (pe > stringEnd - 4) {
978
- raise_parse_error("incomplete unicode character escape sequence at '%s'", p);
979
- } else {
980
- uint32_t ch = unescape_unicode((unsigned char *) ++pe);
981
- pe += 3;
982
- /* To handle values above U+FFFF, we take a sequence of
983
- * \uXXXX escapes in the U+D800..U+DBFF then
984
- * U+DC00..U+DFFF ranges, take the low 10 bits from each
985
- * to make a 20-bit number, then add 0x10000 to get the
986
- * final codepoint.
987
- *
988
- * See Unicode 15: 3.8 "Surrogates", 5.3 "Handling
989
- * Surrogate Pairs in UTF-16", and 23.6 "Surrogates
990
- * Area".
991
- */
992
- if ((ch & 0xFC00) == 0xD800) {
993
- pe++;
994
- if (pe > stringEnd - 6) {
995
- raise_parse_error("incomplete surrogate pair at '%s'", p);
996
- }
997
- if (pe[0] == '\\' && pe[1] == 'u') {
998
- uint32_t sur = unescape_unicode((unsigned char *) pe + 2);
999
- ch = (((ch & 0x3F) << 10) | ((((ch >> 6) & 0xF) + 1) << 16)
1000
- | (sur & 0x3FF));
1001
- pe += 5;
1002
- } else {
1003
- unescape = (char *) "?";
1004
- break;
1005
- }
1006
- }
1007
- unescape_len = convert_UTF32_to_UTF8(buf, ch);
1008
- unescape = buf;
1009
- }
1010
- break;
1011
- default:
1012
- p = pe;
1013
- continue;
1014
- }
1015
- MEMCPY(buffer, unescape, char, unescape_len);
1016
- buffer += unescape_len;
1017
- p = ++pe;
1018
- } else {
1019
- pe++;
1020
- }
1021
- }
1022
-
1023
- if (pe > p) {
1024
- MEMCPY(buffer, p, char, pe - p);
1025
- buffer += pe - p;
1026
- }
1027
- rb_str_set_len(result, buffer - bufferStart);
1028
-
1029
- if (symbolize) {
1030
- result = rb_str_intern(result);
1031
- } else if (intern) {
1032
- result = rb_funcall(rb_str_freeze(result), i_uminus, 0);
1033
- }
1034
-
1035
- return result;
1036
- }
1037
-
1038
- %%{
1039
- machine JSON_string;
1040
- include JSON_common;
1041
-
1042
- write data;
1043
-
1044
- action parse_complex_string {
1045
- *result = json_string_unescape(json, json->memo + 1, p, json->parsing_name, json->parsing_name || json-> freeze, json->parsing_name && json->symbolize_names);
1046
- fexec p + 1;
1047
- fhold;
1048
- fbreak;
1049
- }
1050
-
1051
- action parse_simple_string {
1052
- *result = json_string_fastpath(json, json->memo + 1, p, json->parsing_name, json->parsing_name || json-> freeze, json->parsing_name && json->symbolize_names);
1053
- fexec p + 1;
1054
- fhold;
1055
- fbreak;
1056
- }
1057
-
1058
- double_quote = '"';
1059
- escape = '\\';
1060
- control = 0..0x1f;
1061
- simple = any - escape - double_quote - control;
1062
-
1063
- main := double_quote (
1064
- (simple*)(
1065
- (double_quote) @parse_simple_string |
1066
- ((^([\"\\] | control) | escape[\"\\/bfnrt] | '\\u'[0-9a-fA-F]{4} | escape^([\"\\/bfnrtu]|0..0x1f))* double_quote) @parse_complex_string
1067
- )
1068
- );
1069
- }%%
1070
-
1071
- static int
1072
- match_i(VALUE regexp, VALUE klass, VALUE memo)
1073
- {
1074
- if (regexp == Qundef) return ST_STOP;
1075
- if (RTEST(rb_funcall(klass, i_json_creatable_p, 0)) &&
1076
- RTEST(rb_funcall(regexp, i_match, 1, rb_ary_entry(memo, 0)))) {
1077
- rb_ary_push(memo, klass);
1078
- return ST_STOP;
1079
- }
1080
- return ST_CONTINUE;
1081
- }
1082
-
1083
- static char *JSON_parse_string(JSON_Parser *json, char *p, char *pe, VALUE *result)
1084
- {
1085
- int cs = EVIL;
1086
- VALUE match_string;
1087
-
1088
- %% write init;
1089
- json->memo = p;
1090
- %% write exec;
1091
-
1092
- if (json->create_additions && RTEST(match_string = json->match_string)) {
1093
- VALUE klass;
1094
- VALUE memo = rb_ary_new2(2);
1095
- rb_ary_push(memo, *result);
1096
- rb_hash_foreach(match_string, match_i, memo);
1097
- klass = rb_ary_entry(memo, 1);
1098
- if (RTEST(klass)) {
1099
- *result = rb_funcall(klass, i_json_create, 1, *result);
1100
- }
1101
- }
1102
-
1103
- if (cs >= JSON_string_first_final) {
1104
- return p + 1;
1105
- } else {
1106
- return NULL;
1107
- }
1108
- }
1109
-
1110
- /*
1111
- * Document-class: JSON::Ext::Parser
1112
- *
1113
- * This is the JSON parser implemented as a C extension. It can be configured
1114
- * to be used by setting
1115
- *
1116
- * JSON.parser = JSON::Ext::Parser
1117
- *
1118
- * with the method parser= in JSON.
1119
- *
1120
- */
1121
-
1122
- static VALUE convert_encoding(VALUE source)
1123
- {
1124
- int encindex = RB_ENCODING_GET(source);
1125
-
1126
- if (RB_LIKELY(encindex == utf8_encindex)) {
1127
- return source;
1128
- }
1129
-
1130
- if (encindex == binary_encindex) {
1131
- // For historical reason, we silently reinterpret binary strings as UTF-8
1132
- return rb_enc_associate_index(rb_str_dup(source), utf8_encindex);
1133
- }
1134
-
1135
- return rb_funcall(source, i_encode, 1, Encoding_UTF_8);
1136
- }
1137
-
1138
- static int configure_parser_i(VALUE key, VALUE val, VALUE data)
1139
- {
1140
- JSON_Parser *json = (JSON_Parser *)data;
1141
-
1142
- if (key == sym_max_nesting) { json->max_nesting = RTEST(val) ? FIX2INT(val) : 0; }
1143
- else if (key == sym_allow_nan) { json->allow_nan = RTEST(val); }
1144
- else if (key == sym_allow_trailing_comma) { json->allow_trailing_comma = RTEST(val); }
1145
- else if (key == sym_symbolize_names) { json->symbolize_names = RTEST(val); }
1146
- else if (key == sym_freeze) { json->freeze = RTEST(val); }
1147
- else if (key == sym_create_id) { json->create_id = RTEST(val) ? val : Qfalse; }
1148
- else if (key == sym_object_class) { json->object_class = RTEST(val) ? val : Qfalse; }
1149
- else if (key == sym_array_class) { json->array_class = RTEST(val) ? val : Qfalse; }
1150
- else if (key == sym_decimal_class) { json->decimal_class = RTEST(val) ? val : Qfalse; }
1151
- else if (key == sym_match_string) { json->match_string = RTEST(val) ? val : Qfalse; }
1152
- else if (key == sym_create_additions) {
1153
- if (NIL_P(val)) {
1154
- json->create_additions = true;
1155
- json->deprecated_create_additions = true;
1156
- } else {
1157
- json->create_additions = RTEST(val);
1158
- json->deprecated_create_additions = false;
1159
- }
1160
- }
1161
-
1162
- return ST_CONTINUE;
1163
- }
1164
-
1165
- static void parser_init(JSON_Parser *json, VALUE source, VALUE opts)
1166
- {
1167
- if (json->Vsource) {
1168
- rb_raise(rb_eTypeError, "already initialized instance");
1169
- }
1170
-
1171
- json->fbuffer.initial_length = FBUFFER_INITIAL_LENGTH_DEFAULT;
1172
- json->max_nesting = 100;
1173
-
1174
- if (!NIL_P(opts)) {
1175
- Check_Type(opts, T_HASH);
1176
- if (RHASH_SIZE(opts) > 0) {
1177
- // We assume in most cases few keys are set so it's faster to go over
1178
- // the provided keys than to check all possible keys.
1179
- rb_hash_foreach(opts, configure_parser_i, (VALUE)json);
1180
-
1181
- if (json->symbolize_names && json->create_additions) {
1182
- rb_raise(rb_eArgError,
1183
- "options :symbolize_names and :create_additions cannot be "
1184
- " used in conjunction");
1185
- }
1186
-
1187
- if (json->create_additions && !json->create_id) {
1188
- json->create_id = rb_funcall(mJSON, i_create_id, 0);
1189
- }
1190
- }
1191
-
1192
- }
1193
- source = convert_encoding(StringValue(source));
1194
- StringValue(source);
1195
- json->len = RSTRING_LEN(source);
1196
- json->source = RSTRING_PTR(source);
1197
- json->Vsource = source;
1198
- }
1199
-
1200
- /*
1201
- * call-seq: new(source, opts => {})
1202
- *
1203
- * Creates a new JSON::Ext::Parser instance for the string _source_.
1204
- *
1205
- * It will be configured by the _opts_ hash. _opts_ can have the following
1206
- * keys:
1207
- *
1208
- * _opts_ can have the following keys:
1209
- * * *max_nesting*: The maximum depth of nesting allowed in the parsed data
1210
- * structures. Disable depth checking with :max_nesting => false|nil|0, it
1211
- * defaults to 100.
1212
- * * *allow_nan*: If set to true, allow NaN, Infinity and -Infinity in
1213
- * defiance of RFC 4627 to be parsed by the Parser. This option defaults to
1214
- * false.
1215
- * * *symbolize_names*: If set to true, returns symbols for the names
1216
- * (keys) in a JSON object. Otherwise strings are returned, which is
1217
- * also the default. It's not possible to use this option in
1218
- * conjunction with the *create_additions* option.
1219
- * * *create_additions*: If set to false, the Parser doesn't create
1220
- * additions even if a matching class and create_id was found. This option
1221
- * defaults to false.
1222
- * * *object_class*: Defaults to Hash. If another type is provided, it will be used
1223
- * instead of Hash to represent JSON objects. The type must respond to
1224
- * +new+ without arguments, and return an object that respond to +[]=+.
1225
- * * *array_class*: Defaults to Array If another type is provided, it will be used
1226
- * instead of Hash to represent JSON arrays. The type must respond to
1227
- * +new+ without arguments, and return an object that respond to +<<+.
1228
- * * *decimal_class*: Specifies which class to use instead of the default
1229
- * (Float) when parsing decimal numbers. This class must accept a single
1230
- * string argument in its constructor.
1231
- */
1232
- static VALUE cParser_initialize(int argc, VALUE *argv, VALUE self)
1233
- {
1234
- GET_PARSER_INIT;
1235
-
1236
- rb_check_arity(argc, 1, 2);
1237
-
1238
- parser_init(json, argv[0], argc == 2 ? argv[1] : Qnil);
1239
- return self;
1240
- }
1241
-
1242
- %%{
1243
- machine JSON;
1244
-
1245
- write data;
1246
-
1247
- include JSON_common;
1248
-
1249
- action parse_value {
1250
- char *np = JSON_parse_value(json, fpc, pe, &result, 0);
1251
- if (np == NULL) { fhold; fbreak; } else fexec np;
1252
- }
1253
-
1254
- main := ignore* (
1255
- begin_value >parse_value
1256
- ) ignore*;
1257
- }%%
1258
-
1259
- /*
1260
- * call-seq: parse()
1261
- *
1262
- * Parses the current JSON text _source_ and returns the complete data
1263
- * structure as a result.
1264
- * It raises JSON::ParserError if fail to parse.
1265
- */
1266
- static VALUE cParser_parse(VALUE self)
1267
- {
1268
- char *p, *pe;
1269
- int cs = EVIL;
1270
- VALUE result = Qnil;
1271
- GET_PARSER;
1272
-
1273
- char stack_buffer[FBUFFER_STACK_SIZE];
1274
- fbuffer_stack_init(&json->fbuffer, FBUFFER_INITIAL_LENGTH_DEFAULT, stack_buffer, FBUFFER_STACK_SIZE);
1275
-
1276
- VALUE rvalue_stack_buffer[RVALUE_STACK_INITIAL_CAPA];
1277
- rvalue_stack stack = {
1278
- .type = RVALUE_STACK_STACK_ALLOCATED,
1279
- .ptr = rvalue_stack_buffer,
1280
- .capa = RVALUE_STACK_INITIAL_CAPA,
1281
- };
1282
- json->stack = &stack;
1283
-
1284
- %% write init;
1285
- p = json->source;
1286
- pe = p + json->len;
1287
- %% write exec;
1288
-
1289
- if (json->stack_handle) {
1290
- rvalue_stack_eagerly_release(json->stack_handle);
1291
- }
1292
-
1293
- if (cs >= JSON_first_final && p == pe) {
1294
- return result;
1295
- } else {
1296
- raise_parse_error("unexpected token at '%s'", p);
1297
- return Qnil;
1298
- }
1299
- }
1300
-
1301
- static VALUE cParser_m_parse(VALUE klass, VALUE source, VALUE opts)
1302
- {
1303
- char *p, *pe;
1304
- int cs = EVIL;
1305
- VALUE result = Qnil;
1306
-
1307
- JSON_Parser _parser = {0};
1308
- JSON_Parser *json = &_parser;
1309
- parser_init(json, source, opts);
1310
-
1311
- char stack_buffer[FBUFFER_STACK_SIZE];
1312
- fbuffer_stack_init(&json->fbuffer, FBUFFER_INITIAL_LENGTH_DEFAULT, stack_buffer, FBUFFER_STACK_SIZE);
1313
-
1314
- VALUE rvalue_stack_buffer[RVALUE_STACK_INITIAL_CAPA];
1315
- rvalue_stack stack = {
1316
- .type = RVALUE_STACK_STACK_ALLOCATED,
1317
- .ptr = rvalue_stack_buffer,
1318
- .capa = RVALUE_STACK_INITIAL_CAPA,
1319
- };
1320
- json->stack = &stack;
1321
-
1322
- %% write init;
1323
- p = json->source;
1324
- pe = p + json->len;
1325
- %% write exec;
1326
-
1327
- if (json->stack_handle) {
1328
- rvalue_stack_eagerly_release(json->stack_handle);
1329
- }
1330
-
1331
- if (cs >= JSON_first_final && p == pe) {
1332
- return result;
1333
- } else {
1334
- raise_parse_error("unexpected token at '%s'", p);
1335
- return Qnil;
1336
- }
1337
- }
1338
-
1339
- static void JSON_mark(void *ptr)
1340
- {
1341
- JSON_Parser *json = ptr;
1342
- rb_gc_mark(json->Vsource);
1343
- rb_gc_mark(json->create_id);
1344
- rb_gc_mark(json->object_class);
1345
- rb_gc_mark(json->array_class);
1346
- rb_gc_mark(json->decimal_class);
1347
- rb_gc_mark(json->match_string);
1348
- rb_gc_mark(json->stack_handle);
1349
-
1350
- long index;
1351
- for (index = 0; index < json->name_cache.length; index++) {
1352
- rb_gc_mark(json->name_cache.entries[index]);
1353
- }
1354
- }
1355
-
1356
- static void JSON_free(void *ptr)
1357
- {
1358
- JSON_Parser *json = ptr;
1359
- fbuffer_free(&json->fbuffer);
1360
- ruby_xfree(json);
1361
- }
1362
-
1363
- static size_t JSON_memsize(const void *ptr)
1364
- {
1365
- const JSON_Parser *json = ptr;
1366
- return sizeof(*json) + FBUFFER_CAPA(&json->fbuffer);
1367
- }
1368
-
1369
- static const rb_data_type_t JSON_Parser_type = {
1370
- "JSON/Parser",
1371
- {JSON_mark, JSON_free, JSON_memsize,},
1372
- 0, 0,
1373
- RUBY_TYPED_FREE_IMMEDIATELY,
1374
- };
1375
-
1376
- static VALUE cJSON_parser_s_allocate(VALUE klass)
1377
- {
1378
- JSON_Parser *json;
1379
- VALUE obj = TypedData_Make_Struct(klass, JSON_Parser, &JSON_Parser_type, json);
1380
- fbuffer_stack_init(&json->fbuffer, 0, NULL, 0);
1381
- return obj;
1382
- }
1383
-
1384
- /*
1385
- * call-seq: source()
1386
- *
1387
- * Returns a copy of the current _source_ string, that was used to construct
1388
- * this Parser.
1389
- */
1390
- static VALUE cParser_source(VALUE self)
1391
- {
1392
- GET_PARSER;
1393
- return rb_str_dup(json->Vsource);
1394
- }
1395
-
1396
- void Init_parser(void)
1397
- {
1398
- #ifdef HAVE_RB_EXT_RACTOR_SAFE
1399
- rb_ext_ractor_safe(true);
1400
- #endif
1401
-
1402
- #undef rb_intern
1403
- rb_require("json/common");
1404
- mJSON = rb_define_module("JSON");
1405
- mExt = rb_define_module_under(mJSON, "Ext");
1406
- cParser = rb_define_class_under(mExt, "Parser", rb_cObject);
1407
- eNestingError = rb_path2class("JSON::NestingError");
1408
- rb_gc_register_mark_object(eNestingError);
1409
- rb_define_alloc_func(cParser, cJSON_parser_s_allocate);
1410
- rb_define_method(cParser, "initialize", cParser_initialize, -1);
1411
- rb_define_method(cParser, "parse", cParser_parse, 0);
1412
- rb_define_method(cParser, "source", cParser_source, 0);
1413
-
1414
- rb_define_singleton_method(cParser, "parse", cParser_m_parse, 2);
1415
-
1416
- CNaN = rb_const_get(mJSON, rb_intern("NaN"));
1417
- rb_gc_register_mark_object(CNaN);
1418
-
1419
- CInfinity = rb_const_get(mJSON, rb_intern("Infinity"));
1420
- rb_gc_register_mark_object(CInfinity);
1421
-
1422
- CMinusInfinity = rb_const_get(mJSON, rb_intern("MinusInfinity"));
1423
- rb_gc_register_mark_object(CMinusInfinity);
1424
-
1425
- rb_global_variable(&Encoding_UTF_8);
1426
- Encoding_UTF_8 = rb_const_get(rb_path2class("Encoding"), rb_intern("UTF_8"));
1427
-
1428
- sym_max_nesting = ID2SYM(rb_intern("max_nesting"));
1429
- sym_allow_nan = ID2SYM(rb_intern("allow_nan"));
1430
- sym_allow_trailing_comma = ID2SYM(rb_intern("allow_trailing_comma"));
1431
- sym_symbolize_names = ID2SYM(rb_intern("symbolize_names"));
1432
- sym_freeze = ID2SYM(rb_intern("freeze"));
1433
- sym_create_additions = ID2SYM(rb_intern("create_additions"));
1434
- sym_create_id = ID2SYM(rb_intern("create_id"));
1435
- sym_object_class = ID2SYM(rb_intern("object_class"));
1436
- sym_array_class = ID2SYM(rb_intern("array_class"));
1437
- sym_decimal_class = ID2SYM(rb_intern("decimal_class"));
1438
- sym_match_string = ID2SYM(rb_intern("match_string"));
1439
-
1440
- i_create_id = rb_intern("create_id");
1441
- i_json_creatable_p = rb_intern("json_creatable?");
1442
- i_json_create = rb_intern("json_create");
1443
- i_chr = rb_intern("chr");
1444
- i_match = rb_intern("match");
1445
- i_deep_const_get = rb_intern("deep_const_get");
1446
- i_aset = rb_intern("[]=");
1447
- i_aref = rb_intern("[]");
1448
- i_leftshift = rb_intern("<<");
1449
- i_new = rb_intern("new");
1450
- i_try_convert = rb_intern("try_convert");
1451
- i_uminus = rb_intern("-@");
1452
- i_encode = rb_intern("encode");
1453
-
1454
- binary_encindex = rb_ascii8bit_encindex();
1455
- utf8_encindex = rb_utf8_encindex();
1456
- enc_utf8 = rb_utf8_encoding();
1457
- }
1458
-
1459
- /*
1460
- * Local variables:
1461
- * mode: c
1462
- * c-file-style: ruby
1463
- * indent-tabs-mode: nil
1464
- * End:
1465
- */