json 2.7.5 → 2.8.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -1,5 +1,319 @@
1
+ #include "ruby.h"
1
2
  #include "../fbuffer/fbuffer.h"
2
- #include "parser.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_GC_MARK_LOCATIONS
30
+ // For TruffleRuby
31
+ void rb_gc_mark_locations(const VALUE *start, const VALUE *end)
32
+ {
33
+ VALUE *value = start;
34
+
35
+ while (value < end) {
36
+ rb_gc_mark(*value);
37
+ value++;
38
+ }
39
+ }
40
+ #endif
41
+
42
+ #ifndef HAVE_RB_HASH_BULK_INSERT
43
+ // For TruffleRuby
44
+ void rb_hash_bulk_insert(long count, const VALUE *pairs, VALUE hash)
45
+ {
46
+ long index = 0;
47
+ while (index < count) {
48
+ VALUE name = pairs[index++];
49
+ VALUE value = pairs[index++];
50
+ rb_hash_aset(hash, name, value);
51
+ }
52
+ RB_GC_GUARD(hash);
53
+ }
54
+ #endif
55
+
56
+ /* name cache */
57
+
58
+ #include <string.h>
59
+ #include <ctype.h>
60
+
61
+ // Object names are likely to be repeated, and are frozen.
62
+ // As such we can re-use them if we keep a cache of the ones we've seen so far,
63
+ // and save much more expensive lookups into the global fstring table.
64
+ // This cache implementation is deliberately simple, as we're optimizing for compactness,
65
+ // to be able to fit safely on the stack.
66
+ // As such, binary search into a sorted array gives a good tradeoff between compactness and
67
+ // performance.
68
+ #define JSON_RVALUE_CACHE_CAPA 63
69
+ typedef struct rvalue_cache_struct {
70
+ int length;
71
+ VALUE entries[JSON_RVALUE_CACHE_CAPA];
72
+ } rvalue_cache;
73
+
74
+ static rb_encoding *enc_utf8;
75
+
76
+ #define JSON_RVALUE_CACHE_MAX_ENTRY_LENGTH 55
77
+
78
+ static inline VALUE build_interned_string(const char *str, const long length)
79
+ {
80
+ # ifdef HAVE_RB_ENC_INTERNED_STR
81
+ return rb_enc_interned_str(str, length, enc_utf8);
82
+ # else
83
+ VALUE rstring = rb_utf8_str_new(str, length);
84
+ return rb_funcall(rb_str_freeze(rstring), i_uminus, 0);
85
+ # endif
86
+ }
87
+
88
+ static inline VALUE build_symbol(const char *str, const long length)
89
+ {
90
+ return rb_str_intern(build_interned_string(str, length));
91
+ }
92
+
93
+ static void rvalue_cache_insert_at(rvalue_cache *cache, int index, VALUE rstring)
94
+ {
95
+ MEMMOVE(&cache->entries[index + 1], &cache->entries[index], VALUE, cache->length - index);
96
+ cache->length++;
97
+ cache->entries[index] = rstring;
98
+ }
99
+
100
+ static inline int rstring_cache_cmp(const char *str, const long length, VALUE rstring)
101
+ {
102
+ long rstring_length = RSTRING_LEN(rstring);
103
+ if (length == rstring_length) {
104
+ return memcmp(str, RSTRING_PTR(rstring), length);
105
+ } else {
106
+ return (int)(length - rstring_length);
107
+ }
108
+ }
109
+
110
+ static VALUE rstring_cache_fetch(rvalue_cache *cache, const char *str, const long length)
111
+ {
112
+ if (RB_UNLIKELY(length > JSON_RVALUE_CACHE_MAX_ENTRY_LENGTH)) {
113
+ // Common names aren't likely to be very long. So we just don't
114
+ // cache names above an arbitrary threshold.
115
+ return Qfalse;
116
+ }
117
+
118
+ if (RB_UNLIKELY(!isalpha(str[0]))) {
119
+ // Simple heuristic, if the first character isn't a letter,
120
+ // we're much less likely to see this string again.
121
+ // We mostly want to cache strings that are likely to be repeated.
122
+ return Qfalse;
123
+ }
124
+
125
+ int low = 0;
126
+ int high = cache->length - 1;
127
+ int mid = 0;
128
+ int last_cmp = 0;
129
+
130
+ while (low <= high) {
131
+ mid = (high + low) >> 1;
132
+ VALUE entry = cache->entries[mid];
133
+ last_cmp = rstring_cache_cmp(str, length, entry);
134
+
135
+ if (last_cmp == 0) {
136
+ return entry;
137
+ } else if (last_cmp > 0) {
138
+ low = mid + 1;
139
+ } else {
140
+ high = mid - 1;
141
+ }
142
+ }
143
+
144
+ if (RB_UNLIKELY(memchr(str, '\\', length))) {
145
+ // We assume the overwhelming majority of names don't need to be escaped.
146
+ // But if they do, we have to fallback to the slow path.
147
+ return Qfalse;
148
+ }
149
+
150
+ VALUE rstring = build_interned_string(str, length);
151
+
152
+ if (cache->length < JSON_RVALUE_CACHE_CAPA) {
153
+ if (last_cmp > 0) {
154
+ mid += 1;
155
+ }
156
+
157
+ rvalue_cache_insert_at(cache, mid, rstring);
158
+ }
159
+ return rstring;
160
+ }
161
+
162
+ static VALUE rsymbol_cache_fetch(rvalue_cache *cache, const char *str, const long length)
163
+ {
164
+ if (RB_UNLIKELY(length > JSON_RVALUE_CACHE_MAX_ENTRY_LENGTH)) {
165
+ // Common names aren't likely to be very long. So we just don't
166
+ // cache names above an arbitrary threshold.
167
+ return Qfalse;
168
+ }
169
+
170
+ if (RB_UNLIKELY(!isalpha(str[0]))) {
171
+ // Simple heuristic, if the first character isn't a letter,
172
+ // we're much less likely to see this string again.
173
+ // We mostly want to cache strings that are likely to be repeated.
174
+ return Qfalse;
175
+ }
176
+
177
+ int low = 0;
178
+ int high = cache->length - 1;
179
+ int mid = 0;
180
+ int last_cmp = 0;
181
+
182
+ while (low <= high) {
183
+ mid = (high + low) >> 1;
184
+ VALUE entry = cache->entries[mid];
185
+ last_cmp = rstring_cache_cmp(str, length, rb_sym2str(entry));
186
+
187
+ if (last_cmp == 0) {
188
+ return entry;
189
+ } else if (last_cmp > 0) {
190
+ low = mid + 1;
191
+ } else {
192
+ high = mid - 1;
193
+ }
194
+ }
195
+
196
+ if (RB_UNLIKELY(memchr(str, '\\', length))) {
197
+ // We assume the overwhelming majority of names don't need to be escaped.
198
+ // But if they do, we have to fallback to the slow path.
199
+ return Qfalse;
200
+ }
201
+
202
+ VALUE rsymbol = build_symbol(str, length);
203
+
204
+ if (cache->length < JSON_RVALUE_CACHE_CAPA) {
205
+ if (last_cmp > 0) {
206
+ mid += 1;
207
+ }
208
+
209
+ rvalue_cache_insert_at(cache, mid, rsymbol);
210
+ }
211
+ return rsymbol;
212
+ }
213
+
214
+ /* rvalue stack */
215
+
216
+ #define RVALUE_STACK_INITIAL_CAPA 128
217
+
218
+ enum rvalue_stack_type {
219
+ RVALUE_STACK_HEAP_ALLOCATED = 0,
220
+ RVALUE_STACK_STACK_ALLOCATED = 1,
221
+ };
222
+
223
+ typedef struct rvalue_stack_struct {
224
+ enum rvalue_stack_type type;
225
+ long capa;
226
+ long head;
227
+ VALUE *ptr;
228
+ } rvalue_stack;
229
+
230
+ static rvalue_stack *rvalue_stack_spill(rvalue_stack *old_stack, VALUE *handle, rvalue_stack **stack_ref);
231
+
232
+ static rvalue_stack *rvalue_stack_grow(rvalue_stack *stack, VALUE *handle, rvalue_stack **stack_ref)
233
+ {
234
+ long required = stack->capa * 2;
235
+
236
+ if (stack->type == RVALUE_STACK_STACK_ALLOCATED) {
237
+ stack = rvalue_stack_spill(stack, handle, stack_ref);
238
+ } else {
239
+ REALLOC_N(stack->ptr, VALUE, required);
240
+ stack->capa = required;
241
+ }
242
+ return stack;
243
+ }
244
+
245
+ static void rvalue_stack_push(rvalue_stack *stack, VALUE value, VALUE *handle, rvalue_stack **stack_ref)
246
+ {
247
+ if (RB_UNLIKELY(stack->head >= stack->capa)) {
248
+ stack = rvalue_stack_grow(stack, handle, stack_ref);
249
+ }
250
+ stack->ptr[stack->head] = value;
251
+ stack->head++;
252
+ }
253
+
254
+ static inline VALUE *rvalue_stack_peek(rvalue_stack *stack, long count)
255
+ {
256
+ return stack->ptr + (stack->head - count);
257
+ }
258
+
259
+ static inline void rvalue_stack_pop(rvalue_stack *stack, long count)
260
+ {
261
+ stack->head -= count;
262
+ }
263
+
264
+ static void rvalue_stack_mark(void *ptr)
265
+ {
266
+ rvalue_stack *stack = (rvalue_stack *)ptr;
267
+ rb_gc_mark_locations(stack->ptr, stack->ptr + stack->head);
268
+ }
269
+
270
+ static void rvalue_stack_free(void *ptr)
271
+ {
272
+ rvalue_stack *stack = (rvalue_stack *)ptr;
273
+ if (stack) {
274
+ ruby_xfree(stack->ptr);
275
+ ruby_xfree(stack);
276
+ }
277
+ }
278
+
279
+ static size_t rvalue_stack_memsize(const void *ptr)
280
+ {
281
+ const rvalue_stack *stack = (const rvalue_stack *)ptr;
282
+ return sizeof(rvalue_stack) + sizeof(VALUE) * stack->capa;
283
+ }
284
+
285
+ static const rb_data_type_t JSON_Parser_rvalue_stack_type = {
286
+ "JSON::Ext::Parser/rvalue_stack",
287
+ {
288
+ .dmark = rvalue_stack_mark,
289
+ .dfree = rvalue_stack_free,
290
+ .dsize = rvalue_stack_memsize,
291
+ },
292
+ 0, 0,
293
+ RUBY_TYPED_FREE_IMMEDIATELY,
294
+ };
295
+
296
+ static rvalue_stack *rvalue_stack_spill(rvalue_stack *old_stack, VALUE *handle, rvalue_stack **stack_ref)
297
+ {
298
+ rvalue_stack *stack;
299
+ *handle = TypedData_Make_Struct(0, rvalue_stack, &JSON_Parser_rvalue_stack_type, stack);
300
+ *stack_ref = stack;
301
+ MEMCPY(stack, old_stack, rvalue_stack, 1);
302
+
303
+ stack->capa = old_stack->capa << 1;
304
+ stack->ptr = ALLOC_N(VALUE, stack->capa);
305
+ stack->type = RVALUE_STACK_HEAP_ALLOCATED;
306
+ MEMCPY(stack->ptr, old_stack->ptr, VALUE, old_stack->head);
307
+ return stack;
308
+ }
309
+
310
+ static void rvalue_stack_eagerly_release(VALUE handle)
311
+ {
312
+ rvalue_stack *stack;
313
+ TypedData_Get_Struct(handle, rvalue_stack, &JSON_Parser_rvalue_stack_type, stack);
314
+ RTYPEDDATA_DATA(handle) = NULL;
315
+ rvalue_stack_free(stack);
316
+ }
3
317
 
4
318
  /* unicode */
5
319
 
@@ -67,6 +381,50 @@ static int convert_UTF32_to_UTF8(char *buf, uint32_t ch)
67
381
  return len;
68
382
  }
69
383
 
384
+ typedef struct JSON_ParserStruct {
385
+ VALUE Vsource;
386
+ char *source;
387
+ long len;
388
+ char *memo;
389
+ VALUE create_id;
390
+ VALUE object_class;
391
+ VALUE array_class;
392
+ VALUE decimal_class;
393
+ VALUE match_string;
394
+ FBuffer fbuffer;
395
+ int in_array;
396
+ int max_nesting;
397
+ bool allow_nan;
398
+ bool allow_trailing_comma;
399
+ bool parsing_name;
400
+ bool symbolize_names;
401
+ bool freeze;
402
+ bool create_additions;
403
+ bool deprecated_create_additions;
404
+ rvalue_cache name_cache;
405
+ rvalue_stack *stack;
406
+ VALUE stack_handle;
407
+ } JSON_Parser;
408
+
409
+ #define GET_PARSER \
410
+ GET_PARSER_INIT; \
411
+ if (!json->Vsource) rb_raise(rb_eTypeError, "uninitialized instance")
412
+
413
+ #define GET_PARSER_INIT \
414
+ JSON_Parser *json; \
415
+ TypedData_Get_Struct(self, JSON_Parser, &JSON_Parser_type, json)
416
+
417
+ #define MinusInfinity "-Infinity"
418
+ #define EVIL 0x666
419
+
420
+ static const rb_data_type_t JSON_Parser_type;
421
+ static char *JSON_parse_string(JSON_Parser *json, char *p, char *pe, VALUE *result);
422
+ static char *JSON_parse_object(JSON_Parser *json, char *p, char *pe, VALUE *result, int current_nesting);
423
+ static char *JSON_parse_value(JSON_Parser *json, char *p, char *pe, VALUE *result, int current_nesting);
424
+ static char *JSON_parse_number(JSON_Parser *json, char *p, char *pe, VALUE *result);
425
+ static char *JSON_parse_array(JSON_Parser *json, char *p, char *pe, VALUE *result, int current_nesting);
426
+
427
+
70
428
  #define PARSE_ERROR_FRAGMENT_LEN 32
71
429
  #ifdef RBIMPL_ATTR_NORETURN
72
430
  RBIMPL_ATTR_NORETURN()
@@ -84,21 +442,9 @@ static void raise_parse_error(const char *format, const char *start)
84
442
  ptr = buffer;
85
443
  }
86
444
 
87
- rb_enc_raise(rb_utf8_encoding(), rb_path2class("JSON::ParserError"), format, ptr);
445
+ rb_enc_raise(enc_utf8, rb_path2class("JSON::ParserError"), format, ptr);
88
446
  }
89
447
 
90
- static VALUE mJSON, mExt, cParser, eNestingError;
91
- static VALUE CNaN, CInfinity, CMinusInfinity;
92
-
93
- static ID i_json_creatable_p, i_json_create, i_create_id, i_create_additions,
94
- i_chr, i_max_nesting, i_allow_nan, i_symbolize_names,
95
- i_object_class, i_array_class, i_decimal_class,
96
- i_deep_const_get, i_match, i_match_string, i_aset, i_aref,
97
- i_leftshift, i_new, i_try_convert, i_freeze, i_uminus;
98
-
99
- static int binary_encindex;
100
- static int utf8_encindex;
101
-
102
448
 
103
449
  %%{
104
450
  machine JSON_common;
@@ -135,27 +481,25 @@ static int utf8_encindex;
135
481
  write data;
136
482
 
137
483
  action parse_value {
138
- VALUE v = Qnil;
139
- char *np = JSON_parse_value(json, fpc, pe, &v, current_nesting);
484
+ char *np = JSON_parse_value(json, fpc, pe, result, current_nesting);
140
485
  if (np == NULL) {
141
486
  fhold; fbreak;
142
487
  } else {
143
- if (NIL_P(json->object_class)) {
144
- OBJ_FREEZE(last_name);
145
- rb_hash_aset(*result, last_name, v);
146
- } else {
147
- rb_funcall(*result, i_aset, 2, last_name, v);
148
- }
149
488
  fexec np;
150
489
  }
151
490
  }
152
491
 
492
+ action allow_trailing_comma { json->allow_trailing_comma }
493
+
153
494
  action parse_name {
154
495
  char *np;
155
- json->parsing_name = 1;
156
- np = JSON_parse_string(json, fpc, pe, &last_name);
157
- json->parsing_name = 0;
158
- if (np == NULL) { fhold; fbreak; } else fexec np;
496
+ json->parsing_name = true;
497
+ np = JSON_parse_string(json, fpc, pe, result);
498
+ json->parsing_name = false;
499
+ if (np == NULL) { fhold; fbreak; } else {
500
+ PUSH(*result);
501
+ fexec np;
502
+ }
159
503
  }
160
504
 
161
505
  action exit { fhold; fbreak; }
@@ -165,37 +509,64 @@ static int utf8_encindex;
165
509
 
166
510
  main := (
167
511
  begin_object
168
- (pair (next_pair)*)? ignore*
512
+ (pair (next_pair)*((ignore* value_separator) when allow_trailing_comma)?)? ignore*
169
513
  end_object
170
514
  ) @exit;
171
515
  }%%
172
516
 
517
+ #define PUSH(result) rvalue_stack_push(json->stack, result, &json->stack_handle, &json->stack)
518
+
173
519
  static char *JSON_parse_object(JSON_Parser *json, char *p, char *pe, VALUE *result, int current_nesting)
174
520
  {
175
521
  int cs = EVIL;
176
- VALUE last_name = Qnil;
177
- VALUE object_class = json->object_class;
178
522
 
179
523
  if (json->max_nesting && current_nesting > json->max_nesting) {
180
524
  rb_raise(eNestingError, "nesting of %d is too deep", current_nesting);
181
525
  }
182
526
 
183
- *result = NIL_P(object_class) ? rb_hash_new() : rb_class_new_instance(0, 0, object_class);
527
+ long stack_head = json->stack->head;
184
528
 
185
529
  %% write init;
186
530
  %% write exec;
187
531
 
188
532
  if (cs >= JSON_object_first_final) {
189
- if (json->create_additions) {
533
+ long count = json->stack->head - stack_head;
534
+
535
+ if (RB_UNLIKELY(json->object_class)) {
536
+ VALUE object = rb_class_new_instance(0, 0, json->object_class);
537
+ long index = 0;
538
+ VALUE *items = rvalue_stack_peek(json->stack, count);
539
+ while (index < count) {
540
+ VALUE name = items[index++];
541
+ VALUE value = items[index++];
542
+ rb_funcall(object, i_aset, 2, name, value);
543
+ }
544
+ *result = object;
545
+ } else {
546
+ VALUE hash;
547
+ #ifdef HAVE_RB_HASH_NEW_CAPA
548
+ hash = rb_hash_new_capa(count >> 1);
549
+ #else
550
+ hash = rb_hash_new();
551
+ #endif
552
+ rb_hash_bulk_insert(count, rvalue_stack_peek(json->stack, count), hash);
553
+ *result = hash;
554
+ }
555
+ rvalue_stack_pop(json->stack, count);
556
+
557
+ if (RB_UNLIKELY(json->create_additions)) {
190
558
  VALUE klassname;
191
- if (NIL_P(json->object_class)) {
192
- klassname = rb_hash_aref(*result, json->create_id);
559
+ if (json->object_class) {
560
+ klassname = rb_funcall(*result, i_aref, 1, json->create_id);
193
561
  } else {
194
- klassname = rb_funcall(*result, i_aref, 1, json->create_id);
562
+ klassname = rb_hash_aref(*result, json->create_id);
195
563
  }
196
564
  if (!NIL_P(klassname)) {
197
565
  VALUE klass = rb_funcall(mJSON, i_deep_const_get, 1, klassname);
198
566
  if (RTEST(rb_funcall(klass, i_json_creatable_p, 0))) {
567
+ if (json->deprecated_create_additions) {
568
+ json_deprecated(deprecated_create_additions_warning);
569
+ }
199
570
  *result = rb_funcall(klass, i_json_create, 1, *result);
200
571
  }
201
572
  }
@@ -206,7 +577,6 @@ static char *JSON_parse_object(JSON_Parser *json, char *p, char *pe, VALUE *resu
206
577
  }
207
578
  }
208
579
 
209
-
210
580
  %%{
211
581
  machine JSON_value;
212
582
  include JSON_common;
@@ -238,7 +608,12 @@ static char *JSON_parse_object(JSON_Parser *json, char *p, char *pe, VALUE *resu
238
608
  }
239
609
  action parse_string {
240
610
  char *np = JSON_parse_string(json, fpc, pe, result);
241
- if (np == NULL) { fhold; fbreak; } else fexec np;
611
+ if (np == NULL) {
612
+ fhold;
613
+ fbreak;
614
+ } else {
615
+ fexec np;
616
+ }
242
617
  }
243
618
 
244
619
  action parse_number {
@@ -252,16 +627,18 @@ static char *JSON_parse_object(JSON_Parser *json, char *p, char *pe, VALUE *resu
252
627
  raise_parse_error("unexpected token at '%s'", p);
253
628
  }
254
629
  }
255
- np = JSON_parse_float(json, fpc, pe, result);
256
- if (np != NULL) fexec np;
257
- np = JSON_parse_integer(json, fpc, pe, result);
258
- if (np != NULL) fexec np;
630
+ np = JSON_parse_number(json, fpc, pe, result);
631
+ if (np != NULL) {
632
+ fexec np;
633
+ }
259
634
  fhold; fbreak;
260
635
  }
261
636
 
262
637
  action parse_array {
263
638
  char *np;
639
+ json->in_array++;
264
640
  np = JSON_parse_array(json, fpc, pe, result, current_nesting + 1);
641
+ json->in_array--;
265
642
  if (np == NULL) { fhold; fbreak; } else fexec np;
266
643
  }
267
644
 
@@ -279,10 +656,10 @@ main := ignore* (
279
656
  Vtrue @parse_true |
280
657
  VNaN @parse_nan |
281
658
  VInfinity @parse_infinity |
282
- begin_number >parse_number |
283
- begin_string >parse_string |
284
- begin_array >parse_array |
285
- begin_object >parse_object
659
+ begin_number @parse_number |
660
+ begin_string @parse_string |
661
+ begin_array @parse_array |
662
+ begin_object @parse_object
286
663
  ) ignore* %*exit;
287
664
  }%%
288
665
 
@@ -298,6 +675,7 @@ static char *JSON_parse_value(JSON_Parser *json, char *p, char *pe, VALUE *resul
298
675
  }
299
676
 
300
677
  if (cs >= JSON_value_first_final) {
678
+ PUSH(*result);
301
679
  return p;
302
680
  } else {
303
681
  return NULL;
@@ -314,24 +692,40 @@ static char *JSON_parse_value(JSON_Parser *json, char *p, char *pe, VALUE *resul
314
692
  main := '-'? ('0' | [1-9][0-9]*) (^[0-9]? @exit);
315
693
  }%%
316
694
 
317
- static char *JSON_parse_integer(JSON_Parser *json, char *p, char *pe, VALUE *result)
695
+ #define MAX_FAST_INTEGER_SIZE 18
696
+ static inline VALUE fast_parse_integer(char *p, char *pe)
318
697
  {
319
- int cs = EVIL;
698
+ bool negative = false;
699
+ if (*p == '-') {
700
+ negative = true;
701
+ p++;
702
+ }
320
703
 
321
- %% write init;
322
- json->memo = p;
323
- %% write exec;
704
+ long long memo = 0;
705
+ while (p < pe) {
706
+ memo *= 10;
707
+ memo += *p - '0';
708
+ p++;
709
+ }
324
710
 
325
- if (cs >= JSON_integer_first_final) {
711
+ if (negative) {
712
+ memo = -memo;
713
+ }
714
+ return LL2NUM(memo);
715
+ }
716
+
717
+ static char *JSON_decode_integer(JSON_Parser *json, char *p, VALUE *result)
718
+ {
326
719
  long len = p - json->memo;
327
- fbuffer_clear(json->fbuffer);
328
- fbuffer_append(json->fbuffer, json->memo, len);
329
- fbuffer_append_char(json->fbuffer, '\0');
330
- *result = rb_cstr2inum(FBUFFER_PTR(json->fbuffer), 10);
720
+ if (RB_LIKELY(len < MAX_FAST_INTEGER_SIZE)) {
721
+ *result = fast_parse_integer(json->memo, p);
722
+ } else {
723
+ fbuffer_clear(&json->fbuffer);
724
+ fbuffer_append(&json->fbuffer, json->memo, len);
725
+ fbuffer_append_char(&json->fbuffer, '\0');
726
+ *result = rb_cstr2inum(FBUFFER_PTR(&json->fbuffer), 10);
727
+ }
331
728
  return p + 1;
332
- } else {
333
- return NULL;
334
- }
335
729
  }
336
730
 
337
731
  %%{
@@ -341,25 +735,31 @@ static char *JSON_parse_integer(JSON_Parser *json, char *p, char *pe, VALUE *res
341
735
  write data;
342
736
 
343
737
  action exit { fhold; fbreak; }
738
+ action isFloat { is_float = true; }
344
739
 
345
740
  main := '-'? (
346
- (('0' | [1-9][0-9]*) '.' [0-9]+ ([Ee] [+\-]?[0-9]+)?)
347
- | (('0' | [1-9][0-9]*) ([Ee] [+\-]?[0-9]+))
348
- ) (^[0-9Ee.\-]? @exit );
741
+ (('0' | [1-9][0-9]*)
742
+ ((('.' [0-9]+ ([Ee] [+\-]?[0-9]+)?) |
743
+ ([Ee] [+\-]?[0-9]+)) > isFloat)?
744
+ ) (^[0-9Ee.\-]? @exit ));
349
745
  }%%
350
746
 
351
- static char *JSON_parse_float(JSON_Parser *json, char *p, char *pe, VALUE *result)
747
+ static char *JSON_parse_number(JSON_Parser *json, char *p, char *pe, VALUE *result)
352
748
  {
353
749
  int cs = EVIL;
750
+ bool is_float = false;
354
751
 
355
752
  %% write init;
356
753
  json->memo = p;
357
754
  %% write exec;
358
755
 
359
756
  if (cs >= JSON_float_first_final) {
757
+ if (!is_float) {
758
+ return JSON_decode_integer(json, p, result);
759
+ }
360
760
  VALUE mod = Qnil;
361
761
  ID method_id = 0;
362
- if (!NIL_P(json->decimal_class)) {
762
+ if (json->decimal_class) {
363
763
  if (rb_respond_to(json->decimal_class, i_try_convert)) {
364
764
  mod = json->decimal_class;
365
765
  method_id = i_try_convert;
@@ -388,15 +788,15 @@ static char *JSON_parse_float(JSON_Parser *json, char *p, char *pe, VALUE *resul
388
788
  }
389
789
 
390
790
  long len = p - json->memo;
391
- fbuffer_clear(json->fbuffer);
392
- fbuffer_append(json->fbuffer, json->memo, len);
393
- fbuffer_append_char(json->fbuffer, '\0');
791
+ fbuffer_clear(&json->fbuffer);
792
+ fbuffer_append(&json->fbuffer, json->memo, len);
793
+ fbuffer_append_char(&json->fbuffer, '\0');
394
794
 
395
795
  if (method_id) {
396
- VALUE text = rb_str_new2(FBUFFER_PTR(json->fbuffer));
796
+ VALUE text = rb_str_new2(FBUFFER_PTR(&json->fbuffer));
397
797
  *result = rb_funcallv(mod, method_id, 1, &text);
398
798
  } else {
399
- *result = DBL2NUM(rb_cstr_to_dbl(FBUFFER_PTR(json->fbuffer), 1));
799
+ *result = DBL2NUM(rb_cstr_to_dbl(FBUFFER_PTR(&json->fbuffer), 1));
400
800
  }
401
801
 
402
802
  return p + 1;
@@ -418,39 +818,51 @@ static char *JSON_parse_float(JSON_Parser *json, char *p, char *pe, VALUE *resul
418
818
  if (np == NULL) {
419
819
  fhold; fbreak;
420
820
  } else {
421
- if (NIL_P(json->array_class)) {
422
- rb_ary_push(*result, v);
423
- } else {
424
- rb_funcall(*result, i_leftshift, 1, v);
425
- }
426
821
  fexec np;
427
822
  }
428
823
  }
429
824
 
825
+ action allow_trailing_comma { json->allow_trailing_comma }
826
+
430
827
  action exit { fhold; fbreak; }
431
828
 
432
829
  next_element = value_separator ignore* begin_value >parse_value;
433
830
 
434
831
  main := begin_array ignore*
435
832
  ((begin_value >parse_value ignore*)
436
- (ignore* next_element ignore*)*)?
833
+ (ignore* next_element ignore*)*((value_separator ignore*) when allow_trailing_comma)?)?
437
834
  end_array @exit;
438
835
  }%%
439
836
 
440
837
  static char *JSON_parse_array(JSON_Parser *json, char *p, char *pe, VALUE *result, int current_nesting)
441
838
  {
442
839
  int cs = EVIL;
443
- VALUE array_class = json->array_class;
444
840
 
445
841
  if (json->max_nesting && current_nesting > json->max_nesting) {
446
842
  rb_raise(eNestingError, "nesting of %d is too deep", current_nesting);
447
843
  }
448
- *result = NIL_P(array_class) ? rb_ary_new() : rb_class_new_instance(0, 0, array_class);
844
+ long stack_head = json->stack->head;
449
845
 
450
846
  %% write init;
451
847
  %% write exec;
452
848
 
453
849
  if(cs >= JSON_array_first_final) {
850
+ long count = json->stack->head - stack_head;
851
+
852
+ if (RB_UNLIKELY(json->array_class)) {
853
+ VALUE array = rb_class_new_instance(0, 0, json->array_class);
854
+ VALUE *items = rvalue_stack_peek(json->stack, count);
855
+ long index;
856
+ for (index = 0; index < count; index++) {
857
+ rb_funcall(array, i_leftshift, 1, items[index]);
858
+ }
859
+ *result = array;
860
+ } else {
861
+ VALUE array = rb_ary_new_from_values(count, rvalue_stack_peek(json->stack, count));
862
+ *result = array;
863
+ }
864
+ rvalue_stack_pop(json->stack, count);
865
+
454
866
  return p + 1;
455
867
  } else {
456
868
  raise_parse_error("unexpected token at '%s'", p);
@@ -458,29 +870,81 @@ static char *JSON_parse_array(JSON_Parser *json, char *p, char *pe, VALUE *resul
458
870
  }
459
871
  }
460
872
 
461
- static const size_t MAX_STACK_BUFFER_SIZE = 128;
462
- static VALUE json_string_unescape(char *string, char *stringEnd, int intern, int symbolize)
873
+ static inline VALUE build_string(const char *start, const char *end, bool intern, bool symbolize)
874
+ {
875
+ if (symbolize) {
876
+ intern = true;
877
+ }
878
+ VALUE result;
879
+ # ifdef HAVE_RB_ENC_INTERNED_STR
880
+ if (intern) {
881
+ result = rb_enc_interned_str(start, (long)(end - start), enc_utf8);
882
+ } else {
883
+ result = rb_utf8_str_new(start, (long)(end - start));
884
+ }
885
+ # else
886
+ result = rb_utf8_str_new(start, (long)(end - start));
887
+ if (intern) {
888
+ result = rb_funcall(rb_str_freeze(result), i_uminus, 0);
889
+ }
890
+ # endif
891
+
892
+ if (symbolize) {
893
+ result = rb_str_intern(result);
894
+ }
895
+
896
+ return result;
897
+ }
898
+
899
+ static VALUE json_string_fastpath(JSON_Parser *json, char *string, char *stringEnd, bool is_name, bool intern, bool symbolize)
900
+ {
901
+ size_t bufferSize = stringEnd - string;
902
+
903
+ if (is_name && json->in_array) {
904
+ VALUE cached_key;
905
+ if (RB_UNLIKELY(symbolize)) {
906
+ cached_key = rsymbol_cache_fetch(&json->name_cache, string, bufferSize);
907
+ } else {
908
+ cached_key = rstring_cache_fetch(&json->name_cache, string, bufferSize);
909
+ }
910
+
911
+ if (RB_LIKELY(cached_key)) {
912
+ return cached_key;
913
+ }
914
+ }
915
+
916
+ return build_string(string, stringEnd, intern, symbolize);
917
+ }
918
+
919
+ static VALUE json_string_unescape(JSON_Parser *json, char *string, char *stringEnd, bool is_name, bool intern, bool symbolize)
463
920
  {
464
- VALUE result = Qnil;
465
921
  size_t bufferSize = stringEnd - string;
466
922
  char *p = string, *pe = string, *unescape, *bufferStart, *buffer;
467
923
  int unescape_len;
468
924
  char buf[4];
469
925
 
470
- if (bufferSize > MAX_STACK_BUFFER_SIZE) {
471
- # ifdef HAVE_RB_ENC_INTERNED_STR
472
- bufferStart = buffer = ALLOC_N(char, bufferSize ? bufferSize : 1);
473
- # else
474
- bufferStart = buffer = ALLOC_N(char, bufferSize);
475
- # endif
476
- } else {
477
- # ifdef HAVE_RB_ENC_INTERNED_STR
478
- bufferStart = buffer = ALLOCA_N(char, bufferSize ? bufferSize : 1);
479
- # else
480
- bufferStart = buffer = ALLOCA_N(char, bufferSize);
481
- # endif
926
+ if (is_name && json->in_array) {
927
+ VALUE cached_key;
928
+ if (RB_UNLIKELY(symbolize)) {
929
+ cached_key = rsymbol_cache_fetch(&json->name_cache, string, bufferSize);
930
+ } else {
931
+ cached_key = rstring_cache_fetch(&json->name_cache, string, bufferSize);
932
+ }
933
+
934
+ if (RB_LIKELY(cached_key)) {
935
+ return cached_key;
936
+ }
482
937
  }
483
938
 
939
+ pe = memchr(p, '\\', bufferSize);
940
+ if (RB_UNLIKELY(pe == NULL)) {
941
+ return build_string(string, stringEnd, intern, symbolize);
942
+ }
943
+
944
+ VALUE result = rb_str_buf_new(bufferSize);
945
+ rb_enc_associate_index(result, utf8_encindex);
946
+ buffer = bufferStart = RSTRING_PTR(result);
947
+
484
948
  while (pe < stringEnd) {
485
949
  if (*pe == '\\') {
486
950
  unescape = (char *) "?";
@@ -513,9 +977,6 @@ static VALUE json_string_unescape(char *string, char *stringEnd, int intern, int
513
977
  break;
514
978
  case 'u':
515
979
  if (pe > stringEnd - 4) {
516
- if (bufferSize > MAX_STACK_BUFFER_SIZE) {
517
- ruby_xfree(bufferStart);
518
- }
519
980
  raise_parse_error("incomplete unicode character escape sequence at '%s'", p);
520
981
  } else {
521
982
  uint32_t ch = unescape_unicode((unsigned char *) ++pe);
@@ -533,9 +994,6 @@ static VALUE json_string_unescape(char *string, char *stringEnd, int intern, int
533
994
  if ((ch & 0xFC00) == 0xD800) {
534
995
  pe++;
535
996
  if (pe > stringEnd - 6) {
536
- if (bufferSize > MAX_STACK_BUFFER_SIZE) {
537
- ruby_xfree(bufferStart);
538
- }
539
997
  raise_parse_error("incomplete surrogate pair at '%s'", p);
540
998
  }
541
999
  if (pe[0] == '\\' && pe[1] == 'u') {
@@ -568,41 +1026,12 @@ static VALUE json_string_unescape(char *string, char *stringEnd, int intern, int
568
1026
  MEMCPY(buffer, p, char, pe - p);
569
1027
  buffer += pe - p;
570
1028
  }
571
-
572
- # ifdef HAVE_RB_ENC_INTERNED_STR
573
- if (intern) {
574
- result = rb_enc_interned_str(bufferStart, (long)(buffer - bufferStart), rb_utf8_encoding());
575
- } else {
576
- result = rb_utf8_str_new(bufferStart, (long)(buffer - bufferStart));
577
- }
578
- if (bufferSize > MAX_STACK_BUFFER_SIZE) {
579
- ruby_xfree(bufferStart);
580
- }
581
- # else
582
- result = rb_utf8_str_new(bufferStart, (long)(buffer - bufferStart));
583
-
584
- if (bufferSize > MAX_STACK_BUFFER_SIZE) {
585
- ruby_xfree(bufferStart);
586
- }
587
-
588
- if (intern) {
589
- # if STR_UMINUS_DEDUPE_FROZEN
590
- // Starting from MRI 2.8 it is preferable to freeze the string
591
- // before deduplication so that it can be interned directly
592
- // otherwise it would be duplicated first which is wasteful.
593
- result = rb_funcall(rb_str_freeze(result), i_uminus, 0);
594
- # elif STR_UMINUS_DEDUPE
595
- // MRI 2.5 and older do not deduplicate strings that are already
596
- // frozen.
597
- result = rb_funcall(result, i_uminus, 0);
598
- # else
599
- result = rb_str_freeze(result);
600
- # endif
601
- }
602
- # endif
1029
+ rb_str_set_len(result, buffer - bufferStart);
603
1030
 
604
1031
  if (symbolize) {
605
- result = rb_str_intern(result);
1032
+ result = rb_str_intern(result);
1033
+ } else if (intern) {
1034
+ result = rb_funcall(rb_str_freeze(result), i_uminus, 0);
606
1035
  }
607
1036
 
608
1037
  return result;
@@ -614,19 +1043,31 @@ static VALUE json_string_unescape(char *string, char *stringEnd, int intern, int
614
1043
 
615
1044
  write data;
616
1045
 
617
- action parse_string {
618
- *result = json_string_unescape(json->memo + 1, p, json->parsing_name || json-> freeze, json->parsing_name && json->symbolize_names);
619
- if (NIL_P(*result)) {
620
- fhold;
621
- fbreak;
622
- } else {
623
- fexec p + 1;
624
- }
1046
+ action parse_complex_string {
1047
+ *result = json_string_unescape(json, json->memo + 1, p, json->parsing_name, json->parsing_name || json-> freeze, json->parsing_name && json->symbolize_names);
1048
+ fexec p + 1;
1049
+ fhold;
1050
+ fbreak;
625
1051
  }
626
1052
 
627
- action exit { fhold; fbreak; }
1053
+ action parse_simple_string {
1054
+ *result = json_string_fastpath(json, json->memo + 1, p, json->parsing_name, json->parsing_name || json-> freeze, json->parsing_name && json->symbolize_names);
1055
+ fexec p + 1;
1056
+ fhold;
1057
+ fbreak;
1058
+ }
628
1059
 
629
- main := '"' ((^([\"\\] | 0..0x1f) | '\\'[\"\\/bfnrt] | '\\u'[0-9a-fA-F]{4} | '\\'^([\"\\/bfnrtu]|0..0x1f))* %parse_string) '"' @exit;
1060
+ double_quote = '"';
1061
+ escape = '\\';
1062
+ control = 0..0x1f;
1063
+ simple = any - escape - double_quote - control;
1064
+
1065
+ main := double_quote (
1066
+ (simple*)(
1067
+ (double_quote) @parse_simple_string |
1068
+ ((^([\"\\] | control) | escape[\"\\/bfnrt] | '\\u'[0-9a-fA-F]{4} | escape^([\"\\/bfnrtu]|0..0x1f))* double_quote) @parse_complex_string
1069
+ )
1070
+ );
630
1071
  }%%
631
1072
 
632
1073
  static int
@@ -684,18 +1125,78 @@ static VALUE convert_encoding(VALUE source)
684
1125
  {
685
1126
  int encindex = RB_ENCODING_GET(source);
686
1127
 
687
- if (encindex == utf8_encindex) {
1128
+ if (RB_LIKELY(encindex == utf8_encindex)) {
688
1129
  return source;
689
1130
  }
690
1131
 
691
1132
  if (encindex == binary_encindex) {
692
- // For historical reason, we silently reinterpret binary strings as UTF-8 if it would work.
693
- // TODO: Deprecate in 2.8.0
694
- // TODO: Remove in 3.0.0
1133
+ // For historical reason, we silently reinterpret binary strings as UTF-8
695
1134
  return rb_enc_associate_index(rb_str_dup(source), utf8_encindex);
696
1135
  }
697
1136
 
698
- return rb_str_conv_enc(source, rb_enc_from_index(encindex), rb_utf8_encoding());
1137
+ return rb_funcall(source, i_encode, 1, Encoding_UTF_8);
1138
+ }
1139
+
1140
+ static int configure_parser_i(VALUE key, VALUE val, VALUE data)
1141
+ {
1142
+ JSON_Parser *json = (JSON_Parser *)data;
1143
+
1144
+ if (key == sym_max_nesting) { json->max_nesting = RTEST(val) ? FIX2INT(val) : 0; }
1145
+ else if (key == sym_allow_nan) { json->allow_nan = RTEST(val); }
1146
+ else if (key == sym_allow_trailing_comma) { json->allow_trailing_comma = RTEST(val); }
1147
+ else if (key == sym_symbolize_names) { json->symbolize_names = RTEST(val); }
1148
+ else if (key == sym_freeze) { json->freeze = RTEST(val); }
1149
+ else if (key == sym_create_id) { json->create_id = RTEST(val) ? val : Qfalse; }
1150
+ else if (key == sym_object_class) { json->object_class = RTEST(val) ? val : Qfalse; }
1151
+ else if (key == sym_array_class) { json->array_class = RTEST(val) ? val : Qfalse; }
1152
+ else if (key == sym_decimal_class) { json->decimal_class = RTEST(val) ? val : Qfalse; }
1153
+ else if (key == sym_match_string) { json->match_string = RTEST(val) ? val : Qfalse; }
1154
+ else if (key == sym_create_additions) {
1155
+ if (NIL_P(val)) {
1156
+ json->create_additions = true;
1157
+ json->deprecated_create_additions = true;
1158
+ } else {
1159
+ json->create_additions = RTEST(val);
1160
+ json->deprecated_create_additions = false;
1161
+ }
1162
+ }
1163
+
1164
+ return ST_CONTINUE;
1165
+ }
1166
+
1167
+ static void parser_init(JSON_Parser *json, VALUE source, VALUE opts)
1168
+ {
1169
+ if (json->Vsource) {
1170
+ rb_raise(rb_eTypeError, "already initialized instance");
1171
+ }
1172
+
1173
+ json->fbuffer.initial_length = FBUFFER_INITIAL_LENGTH_DEFAULT;
1174
+ json->max_nesting = 100;
1175
+
1176
+ if (!NIL_P(opts)) {
1177
+ Check_Type(opts, T_HASH);
1178
+ if (RHASH_SIZE(opts) > 0) {
1179
+ // We assume in most cases few keys are set so it's faster to go over
1180
+ // the provided keys than to check all possible keys.
1181
+ rb_hash_foreach(opts, configure_parser_i, (VALUE)json);
1182
+
1183
+ if (json->symbolize_names && json->create_additions) {
1184
+ rb_raise(rb_eArgError,
1185
+ "options :symbolize_names and :create_additions cannot be "
1186
+ " used in conjunction");
1187
+ }
1188
+
1189
+ if (json->create_additions && !json->create_id) {
1190
+ json->create_id = rb_funcall(mJSON, i_create_id, 0);
1191
+ }
1192
+ }
1193
+
1194
+ }
1195
+ source = convert_encoding(StringValue(source));
1196
+ StringValue(source);
1197
+ json->len = RSTRING_LEN(source);
1198
+ json->source = RSTRING_PTR(source);
1199
+ json->Vsource = source;
699
1200
  }
700
1201
 
701
1202
  /*
@@ -732,111 +1233,11 @@ static VALUE convert_encoding(VALUE source)
732
1233
  */
733
1234
  static VALUE cParser_initialize(int argc, VALUE *argv, VALUE self)
734
1235
  {
735
- VALUE source, opts;
736
1236
  GET_PARSER_INIT;
737
1237
 
738
- if (json->Vsource) {
739
- rb_raise(rb_eTypeError, "already initialized instance");
740
- }
741
-
742
1238
  rb_check_arity(argc, 1, 2);
743
- source = argv[0];
744
- opts = Qnil;
745
- if (argc == 2) {
746
- opts = argv[1];
747
- Check_Type(argv[1], T_HASH);
748
- if (RHASH_SIZE(argv[1]) > 0) {
749
- opts = argv[1];
750
- }
751
- }
752
1239
 
753
- if (!NIL_P(opts)) {
754
- VALUE tmp = ID2SYM(i_max_nesting);
755
- if (option_given_p(opts, tmp)) {
756
- VALUE max_nesting = rb_hash_aref(opts, tmp);
757
- if (RTEST(max_nesting)) {
758
- Check_Type(max_nesting, T_FIXNUM);
759
- json->max_nesting = FIX2INT(max_nesting);
760
- } else {
761
- json->max_nesting = 0;
762
- }
763
- } else {
764
- json->max_nesting = 100;
765
- }
766
- tmp = ID2SYM(i_allow_nan);
767
- if (option_given_p(opts, tmp)) {
768
- json->allow_nan = RTEST(rb_hash_aref(opts, tmp)) ? 1 : 0;
769
- } else {
770
- json->allow_nan = 0;
771
- }
772
- tmp = ID2SYM(i_symbolize_names);
773
- if (option_given_p(opts, tmp)) {
774
- json->symbolize_names = RTEST(rb_hash_aref(opts, tmp)) ? 1 : 0;
775
- } else {
776
- json->symbolize_names = 0;
777
- }
778
- tmp = ID2SYM(i_freeze);
779
- if (option_given_p(opts, tmp)) {
780
- json->freeze = RTEST(rb_hash_aref(opts, tmp)) ? 1 : 0;
781
- } else {
782
- json->freeze = 0;
783
- }
784
- tmp = ID2SYM(i_create_additions);
785
- if (option_given_p(opts, tmp)) {
786
- json->create_additions = RTEST(rb_hash_aref(opts, tmp));
787
- } else {
788
- json->create_additions = 0;
789
- }
790
- if (json->symbolize_names && json->create_additions) {
791
- rb_raise(rb_eArgError,
792
- "options :symbolize_names and :create_additions cannot be "
793
- " used in conjunction");
794
- }
795
- tmp = ID2SYM(i_create_id);
796
- if (option_given_p(opts, tmp)) {
797
- json->create_id = rb_hash_aref(opts, tmp);
798
- } else {
799
- json->create_id = rb_funcall(mJSON, i_create_id, 0);
800
- }
801
- tmp = ID2SYM(i_object_class);
802
- if (option_given_p(opts, tmp)) {
803
- json->object_class = rb_hash_aref(opts, tmp);
804
- } else {
805
- json->object_class = Qnil;
806
- }
807
- tmp = ID2SYM(i_array_class);
808
- if (option_given_p(opts, tmp)) {
809
- json->array_class = rb_hash_aref(opts, tmp);
810
- } else {
811
- json->array_class = Qnil;
812
- }
813
- tmp = ID2SYM(i_decimal_class);
814
- if (option_given_p(opts, tmp)) {
815
- json->decimal_class = rb_hash_aref(opts, tmp);
816
- } else {
817
- json->decimal_class = Qnil;
818
- }
819
- tmp = ID2SYM(i_match_string);
820
- if (option_given_p(opts, tmp)) {
821
- VALUE match_string = rb_hash_aref(opts, tmp);
822
- json->match_string = RTEST(match_string) ? match_string : Qnil;
823
- } else {
824
- json->match_string = Qnil;
825
- }
826
- } else {
827
- json->max_nesting = 100;
828
- json->allow_nan = 0;
829
- json->create_additions = 0;
830
- json->create_id = Qnil;
831
- json->object_class = Qnil;
832
- json->array_class = Qnil;
833
- json->decimal_class = Qnil;
834
- }
835
- source = convert_encoding(StringValue(source));
836
- StringValue(source);
837
- json->len = RSTRING_LEN(source);
838
- json->source = RSTRING_PTR(source);;
839
- json->Vsource = source;
1240
+ parser_init(json, argv[0], argc == 2 ? argv[1] : Qnil);
840
1241
  return self;
841
1242
  }
842
1243
 
@@ -871,11 +1272,64 @@ static VALUE cParser_parse(VALUE self)
871
1272
  VALUE result = Qnil;
872
1273
  GET_PARSER;
873
1274
 
1275
+ char stack_buffer[FBUFFER_STACK_SIZE];
1276
+ fbuffer_stack_init(&json->fbuffer, FBUFFER_INITIAL_LENGTH_DEFAULT, stack_buffer, FBUFFER_STACK_SIZE);
1277
+
1278
+ VALUE rvalue_stack_buffer[RVALUE_STACK_INITIAL_CAPA];
1279
+ rvalue_stack stack = {
1280
+ .type = RVALUE_STACK_STACK_ALLOCATED,
1281
+ .ptr = rvalue_stack_buffer,
1282
+ .capa = RVALUE_STACK_INITIAL_CAPA,
1283
+ };
1284
+ json->stack = &stack;
1285
+
874
1286
  %% write init;
875
1287
  p = json->source;
876
1288
  pe = p + json->len;
877
1289
  %% write exec;
878
1290
 
1291
+ if (json->stack_handle) {
1292
+ rvalue_stack_eagerly_release(json->stack_handle);
1293
+ }
1294
+
1295
+ if (cs >= JSON_first_final && p == pe) {
1296
+ return result;
1297
+ } else {
1298
+ raise_parse_error("unexpected token at '%s'", p);
1299
+ return Qnil;
1300
+ }
1301
+ }
1302
+
1303
+ static VALUE cParser_m_parse(VALUE klass, VALUE source, VALUE opts)
1304
+ {
1305
+ char *p, *pe;
1306
+ int cs = EVIL;
1307
+ VALUE result = Qnil;
1308
+
1309
+ JSON_Parser _parser = {0};
1310
+ JSON_Parser *json = &_parser;
1311
+ parser_init(json, source, opts);
1312
+
1313
+ char stack_buffer[FBUFFER_STACK_SIZE];
1314
+ fbuffer_stack_init(&json->fbuffer, FBUFFER_INITIAL_LENGTH_DEFAULT, stack_buffer, FBUFFER_STACK_SIZE);
1315
+
1316
+ VALUE rvalue_stack_buffer[RVALUE_STACK_INITIAL_CAPA];
1317
+ rvalue_stack stack = {
1318
+ .type = RVALUE_STACK_STACK_ALLOCATED,
1319
+ .ptr = rvalue_stack_buffer,
1320
+ .capa = RVALUE_STACK_INITIAL_CAPA,
1321
+ };
1322
+ json->stack = &stack;
1323
+
1324
+ %% write init;
1325
+ p = json->source;
1326
+ pe = p + json->len;
1327
+ %% write exec;
1328
+
1329
+ if (json->stack_handle) {
1330
+ rvalue_stack_eagerly_release(json->stack_handle);
1331
+ }
1332
+
879
1333
  if (cs >= JSON_first_final && p == pe) {
880
1334
  return result;
881
1335
  } else {
@@ -893,19 +1347,23 @@ static void JSON_mark(void *ptr)
893
1347
  rb_gc_mark(json->array_class);
894
1348
  rb_gc_mark(json->decimal_class);
895
1349
  rb_gc_mark(json->match_string);
1350
+ rb_gc_mark(json->stack_handle);
1351
+
1352
+ const VALUE *name_cache_entries = &json->name_cache.entries[0];
1353
+ rb_gc_mark_locations(name_cache_entries, name_cache_entries + json->name_cache.length);
896
1354
  }
897
1355
 
898
1356
  static void JSON_free(void *ptr)
899
1357
  {
900
1358
  JSON_Parser *json = ptr;
901
- fbuffer_free(json->fbuffer);
1359
+ fbuffer_free(&json->fbuffer);
902
1360
  ruby_xfree(json);
903
1361
  }
904
1362
 
905
1363
  static size_t JSON_memsize(const void *ptr)
906
1364
  {
907
1365
  const JSON_Parser *json = ptr;
908
- return sizeof(*json) + FBUFFER_CAPA(json->fbuffer);
1366
+ return sizeof(*json) + FBUFFER_CAPA(&json->fbuffer);
909
1367
  }
910
1368
 
911
1369
  static const rb_data_type_t JSON_Parser_type = {
@@ -919,7 +1377,7 @@ static VALUE cJSON_parser_s_allocate(VALUE klass)
919
1377
  {
920
1378
  JSON_Parser *json;
921
1379
  VALUE obj = TypedData_Make_Struct(klass, JSON_Parser, &JSON_Parser_type, json);
922
- json->fbuffer = fbuffer_alloc(0);
1380
+ fbuffer_stack_init(&json->fbuffer, 0, NULL, 0);
923
1381
  return obj;
924
1382
  }
925
1383
 
@@ -953,6 +1411,8 @@ void Init_parser(void)
953
1411
  rb_define_method(cParser, "parse", cParser_parse, 0);
954
1412
  rb_define_method(cParser, "source", cParser_source, 0);
955
1413
 
1414
+ rb_define_singleton_method(cParser, "parse", cParser_m_parse, 2);
1415
+
956
1416
  CNaN = rb_const_get(mJSON, rb_intern("NaN"));
957
1417
  rb_gc_register_mark_object(CNaN);
958
1418
 
@@ -962,30 +1422,38 @@ void Init_parser(void)
962
1422
  CMinusInfinity = rb_const_get(mJSON, rb_intern("MinusInfinity"));
963
1423
  rb_gc_register_mark_object(CMinusInfinity);
964
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");
965
1441
  i_json_creatable_p = rb_intern("json_creatable?");
966
1442
  i_json_create = rb_intern("json_create");
967
- i_create_id = rb_intern("create_id");
968
- i_create_additions = rb_intern("create_additions");
969
1443
  i_chr = rb_intern("chr");
970
- i_max_nesting = rb_intern("max_nesting");
971
- i_allow_nan = rb_intern("allow_nan");
972
- i_symbolize_names = rb_intern("symbolize_names");
973
- i_object_class = rb_intern("object_class");
974
- i_array_class = rb_intern("array_class");
975
- i_decimal_class = rb_intern("decimal_class");
976
1444
  i_match = rb_intern("match");
977
- i_match_string = rb_intern("match_string");
978
1445
  i_deep_const_get = rb_intern("deep_const_get");
979
1446
  i_aset = rb_intern("[]=");
980
1447
  i_aref = rb_intern("[]");
981
1448
  i_leftshift = rb_intern("<<");
982
1449
  i_new = rb_intern("new");
983
1450
  i_try_convert = rb_intern("try_convert");
984
- i_freeze = rb_intern("freeze");
985
1451
  i_uminus = rb_intern("-@");
1452
+ i_encode = rb_intern("encode");
986
1453
 
987
1454
  binary_encindex = rb_ascii8bit_encindex();
988
1455
  utf8_encindex = rb_utf8_encindex();
1456
+ enc_utf8 = rb_utf8_encoding();
989
1457
  }
990
1458
 
991
1459
  /*