oj 3.7.4 → 3.13.21

Sign up to get free protection for your applications and to get access to all the features.
Files changed (142) hide show
  1. checksums.yaml +4 -4
  2. data/CHANGELOG.md +1352 -0
  3. data/README.md +29 -8
  4. data/RELEASE_NOTES.md +61 -0
  5. data/ext/oj/buf.h +53 -72
  6. data/ext/oj/cache.c +326 -0
  7. data/ext/oj/cache.h +21 -0
  8. data/ext/oj/cache8.c +61 -64
  9. data/ext/oj/cache8.h +12 -39
  10. data/ext/oj/circarray.c +37 -43
  11. data/ext/oj/circarray.h +16 -17
  12. data/ext/oj/code.c +165 -179
  13. data/ext/oj/code.h +27 -29
  14. data/ext/oj/compat.c +174 -194
  15. data/ext/oj/custom.c +809 -866
  16. data/ext/oj/debug.c +132 -0
  17. data/ext/oj/dump.c +848 -863
  18. data/ext/oj/dump.h +81 -67
  19. data/ext/oj/dump_compat.c +85 -123
  20. data/ext/oj/dump_leaf.c +100 -188
  21. data/ext/oj/dump_object.c +527 -656
  22. data/ext/oj/dump_strict.c +315 -338
  23. data/ext/oj/encode.h +7 -34
  24. data/ext/oj/encoder.c +43 -0
  25. data/ext/oj/err.c +40 -29
  26. data/ext/oj/err.h +48 -48
  27. data/ext/oj/extconf.rb +17 -4
  28. data/ext/oj/fast.c +1070 -1087
  29. data/ext/oj/intern.c +301 -0
  30. data/ext/oj/intern.h +26 -0
  31. data/ext/oj/mimic_json.c +469 -436
  32. data/ext/oj/object.c +525 -593
  33. data/ext/oj/odd.c +154 -138
  34. data/ext/oj/odd.h +37 -38
  35. data/ext/oj/oj.c +1325 -986
  36. data/ext/oj/oj.h +333 -316
  37. data/ext/oj/parse.c +1002 -846
  38. data/ext/oj/parse.h +92 -87
  39. data/ext/oj/parser.c +1557 -0
  40. data/ext/oj/parser.h +91 -0
  41. data/ext/oj/rails.c +888 -878
  42. data/ext/oj/rails.h +11 -14
  43. data/ext/oj/reader.c +141 -147
  44. data/ext/oj/reader.h +73 -89
  45. data/ext/oj/resolve.c +41 -62
  46. data/ext/oj/resolve.h +7 -9
  47. data/ext/oj/rxclass.c +71 -75
  48. data/ext/oj/rxclass.h +18 -19
  49. data/ext/oj/saj.c +443 -486
  50. data/ext/oj/saj2.c +602 -0
  51. data/ext/oj/scp.c +88 -113
  52. data/ext/oj/sparse.c +787 -709
  53. data/ext/oj/stream_writer.c +133 -159
  54. data/ext/oj/strict.c +127 -118
  55. data/ext/oj/string_writer.c +230 -249
  56. data/ext/oj/trace.c +34 -41
  57. data/ext/oj/trace.h +19 -19
  58. data/ext/oj/usual.c +1254 -0
  59. data/ext/oj/util.c +136 -0
  60. data/ext/oj/util.h +20 -0
  61. data/ext/oj/val_stack.c +59 -67
  62. data/ext/oj/val_stack.h +91 -129
  63. data/ext/oj/validate.c +46 -0
  64. data/ext/oj/wab.c +342 -353
  65. data/lib/oj/bag.rb +1 -0
  66. data/lib/oj/easy_hash.rb +5 -4
  67. data/lib/oj/error.rb +1 -1
  68. data/lib/oj/json.rb +1 -1
  69. data/lib/oj/mimic.rb +48 -14
  70. data/lib/oj/saj.rb +20 -6
  71. data/lib/oj/state.rb +8 -7
  72. data/lib/oj/version.rb +2 -2
  73. data/lib/oj.rb +0 -8
  74. data/pages/Compatibility.md +1 -1
  75. data/pages/JsonGem.md +15 -0
  76. data/pages/Modes.md +53 -46
  77. data/pages/Options.md +72 -11
  78. data/pages/Parser.md +309 -0
  79. data/pages/Rails.md +73 -22
  80. data/pages/Security.md +1 -1
  81. data/test/activerecord/result_test.rb +7 -2
  82. data/test/activesupport5/abstract_unit.rb +45 -0
  83. data/test/activesupport5/decoding_test.rb +68 -60
  84. data/test/activesupport5/encoding_test.rb +111 -96
  85. data/test/activesupport5/encoding_test_cases.rb +33 -25
  86. data/test/activesupport5/test_helper.rb +43 -21
  87. data/test/activesupport5/time_zone_test_helpers.rb +18 -3
  88. data/test/activesupport6/abstract_unit.rb +44 -0
  89. data/test/activesupport6/decoding_test.rb +133 -0
  90. data/test/activesupport6/encoding_test.rb +507 -0
  91. data/test/activesupport6/encoding_test_cases.rb +98 -0
  92. data/test/activesupport6/test_common.rb +17 -0
  93. data/test/activesupport6/test_helper.rb +163 -0
  94. data/test/activesupport6/time_zone_test_helpers.rb +39 -0
  95. data/test/activesupport7/abstract_unit.rb +49 -0
  96. data/test/activesupport7/decoding_test.rb +125 -0
  97. data/test/activesupport7/encoding_test.rb +486 -0
  98. data/test/activesupport7/encoding_test_cases.rb +104 -0
  99. data/test/activesupport7/time_zone_test_helpers.rb +47 -0
  100. data/test/bar.rb +6 -12
  101. data/test/baz.rb +16 -0
  102. data/test/bug.rb +16 -0
  103. data/test/foo.rb +69 -75
  104. data/test/helper.rb +16 -0
  105. data/test/json_gem/json_common_interface_test.rb +8 -3
  106. data/test/json_gem/json_generator_test.rb +18 -4
  107. data/test/json_gem/json_parser_test.rb +9 -0
  108. data/test/json_gem/test_helper.rb +12 -0
  109. data/test/mem.rb +33 -0
  110. data/test/perf.rb +1 -1
  111. data/test/perf_dump.rb +50 -0
  112. data/test/perf_once.rb +58 -0
  113. data/test/perf_parser.rb +189 -0
  114. data/test/perf_scp.rb +11 -10
  115. data/test/perf_strict.rb +17 -23
  116. data/test/prec.rb +23 -0
  117. data/test/sample_json.rb +1 -1
  118. data/test/test_compat.rb +46 -10
  119. data/test/test_custom.rb +147 -8
  120. data/test/test_fast.rb +62 -2
  121. data/test/test_file.rb +25 -2
  122. data/test/test_gc.rb +13 -0
  123. data/test/test_generate.rb +21 -0
  124. data/test/test_hash.rb +11 -1
  125. data/test/test_integer_range.rb +7 -2
  126. data/test/test_object.rb +85 -9
  127. data/test/test_parser.rb +27 -0
  128. data/test/test_parser_saj.rb +335 -0
  129. data/test/test_parser_usual.rb +217 -0
  130. data/test/test_rails.rb +35 -0
  131. data/test/test_saj.rb +1 -1
  132. data/test/test_scp.rb +5 -5
  133. data/test/test_strict.rb +26 -1
  134. data/test/test_various.rb +87 -65
  135. data/test/test_wab.rb +2 -0
  136. data/test/test_writer.rb +19 -2
  137. data/test/tests.rb +1 -1
  138. data/test/zoo.rb +13 -0
  139. metadata +60 -110
  140. data/ext/oj/hash.c +0 -163
  141. data/ext/oj/hash.h +0 -46
  142. data/ext/oj/hash_test.c +0 -512
data/ext/oj/object.c CHANGED
@@ -1,803 +1,735 @@
1
- /* object.c
2
- * Copyright (c) 2012, Peter Ohler
3
- * All rights reserved.
4
- */
1
+ // Copyright (c) 2012 Peter Ohler. All rights reserved.
2
+ // Licensed under the MIT License. See LICENSE file in the project root for license details.
5
3
 
4
+ #include <stdint.h>
6
5
  #include <stdio.h>
7
6
  #include <time.h>
8
7
 
9
- #include "oj.h"
8
+ #include "encode.h"
10
9
  #include "err.h"
10
+ #include "intern.h"
11
+ #include "odd.h"
12
+ #include "oj.h"
11
13
  #include "parse.h"
12
14
  #include "resolve.h"
13
- #include "hash.h"
14
- #include "odd.h"
15
- #include "encode.h"
16
15
  #include "trace.h"
16
+ #include "util.h"
17
17
 
18
- inline static long
19
- read_long(const char *str, size_t len) {
20
- long n = 0;
18
+ inline static long read_long(const char *str, size_t len) {
19
+ long n = 0;
21
20
 
22
21
  for (; 0 < len; str++, len--) {
23
- if ('0' <= *str && *str <= '9') {
24
- n = n * 10 + (*str - '0');
25
- } else {
26
- return -1;
27
- }
22
+ if ('0' <= *str && *str <= '9') {
23
+ n = n * 10 + (*str - '0');
24
+ } else {
25
+ return -1;
26
+ }
28
27
  }
29
28
  return n;
30
29
  }
31
30
 
32
- static VALUE
33
- calc_hash_key(ParseInfo pi, Val kval, char k1) {
34
- volatile VALUE rkey;
31
+ static VALUE calc_hash_key(ParseInfo pi, Val kval, char k1) {
32
+ volatile VALUE rkey;
35
33
 
36
34
  if (':' == k1) {
37
- rkey = rb_str_new(kval->key + 1, kval->klen - 1);
38
- rkey = oj_encode(rkey);
39
- rkey = rb_funcall(rkey, oj_to_sym_id, 0);
40
- } else {
41
- rkey = rb_str_new(kval->key, kval->klen);
42
- rkey = oj_encode(rkey);
43
- if (Yes == pi->options.sym_key) {
44
- rkey = rb_str_intern(rkey);
45
- }
35
+ return ID2SYM(rb_intern3(kval->key + 1, kval->klen - 1, oj_utf8_encoding));
46
36
  }
37
+ if (Yes == pi->options.sym_key) {
38
+ return ID2SYM(rb_intern3(kval->key, kval->klen, oj_utf8_encoding));
39
+ }
40
+ #if HAVE_RB_ENC_INTERNED_STR
41
+ rkey = rb_enc_interned_str(kval->key, kval->klen, oj_utf8_encoding);
42
+ #else
43
+ rkey = rb_utf8_str_new(kval->key, kval->klen);
44
+ OBJ_FREEZE(rkey);
45
+ #endif
47
46
  return rkey;
48
47
  }
49
48
 
50
- static VALUE
51
- str_to_value(ParseInfo pi, const char *str, size_t len, const char *orig) {
52
- volatile VALUE rstr = Qnil;
49
+ static VALUE str_to_value(ParseInfo pi, const char *str, size_t len, const char *orig) {
50
+ volatile VALUE rstr = Qnil;
53
51
 
54
52
  if (':' == *orig && 0 < len) {
55
- rstr = rb_str_new(str + 1, len - 1);
56
- rstr = oj_encode(rstr);
57
- rstr = rb_funcall(rstr, oj_to_sym_id, 0);
53
+ rstr = ID2SYM(rb_intern3(str + 1, len - 1, oj_utf8_encoding));
58
54
  } else if (pi->circ_array && 3 <= len && '^' == *orig && 'r' == orig[1]) {
59
- long i = read_long(str + 2, len - 2);
55
+ long i = read_long(str + 2, len - 2);
60
56
 
61
- if (0 > i) {
62
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "not a valid ID number");
63
- return Qnil;
64
- }
65
- rstr = oj_circ_array_get(pi->circ_array, i);
57
+ if (0 > i) {
58
+ oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "not a valid ID number");
59
+ return Qnil;
60
+ }
61
+ rstr = oj_circ_array_get(pi->circ_array, i);
66
62
  } else {
67
- rstr = rb_str_new(str, len);
68
- rstr = oj_encode(rstr);
63
+ rstr = rb_utf8_str_new(str, len);
69
64
  }
70
65
  return rstr;
71
66
  }
72
67
 
73
- #if (RUBY_VERSION_MAJOR == 1 && RUBY_VERSION_MINOR == 8)
74
- static VALUE
75
- oj_parse_xml_time(const char *str, int len) {
76
- return rb_funcall(rb_cTime, oj_parse_id, 1, rb_str_new(str, len));
77
- }
78
- #else
79
68
  // The much faster approach (4x faster)
80
- static int
81
- parse_num(const char *str, const char *end, int cnt) {
82
- int n = 0;
83
- char c;
84
- int i;
69
+ static int parse_num(const char *str, const char *end, int cnt) {
70
+ int n = 0;
71
+ char c;
72
+ int i;
85
73
 
86
74
  for (i = cnt; 0 < i; i--, str++) {
87
- c = *str;
88
- if (end <= str || c < '0' || '9' < c) {
89
- return -1;
90
- }
91
- n = n * 10 + (c - '0');
75
+ c = *str;
76
+ if (end <= str || c < '0' || '9' < c) {
77
+ return -1;
78
+ }
79
+ n = n * 10 + (c - '0');
92
80
  }
93
81
  return n;
94
82
  }
95
83
 
96
84
  VALUE
97
85
  oj_parse_xml_time(const char *str, int len) {
98
- VALUE args[8];
99
- const char *end = str + len;
100
- int n;
86
+ VALUE args[8];
87
+ const char *end = str + len;
88
+ int n;
101
89
 
102
90
  // year
103
91
  if (0 > (n = parse_num(str, end, 4))) {
104
- return Qnil;
92
+ return Qnil;
105
93
  }
106
94
  str += 4;
107
95
  args[0] = LONG2NUM(n);
108
96
  if ('-' != *str++) {
109
- return Qnil;
97
+ return Qnil;
110
98
  }
111
99
  // month
112
100
  if (0 > (n = parse_num(str, end, 2))) {
113
- return Qnil;
101
+ return Qnil;
114
102
  }
115
103
  str += 2;
116
104
  args[1] = LONG2NUM(n);
117
105
  if ('-' != *str++) {
118
- return Qnil;
106
+ return Qnil;
119
107
  }
120
108
  // day
121
109
  if (0 > (n = parse_num(str, end, 2))) {
122
- return Qnil;
110
+ return Qnil;
123
111
  }
124
112
  str += 2;
125
113
  args[2] = LONG2NUM(n);
126
114
  if ('T' != *str++) {
127
- return Qnil;
115
+ return Qnil;
128
116
  }
129
117
  // hour
130
118
  if (0 > (n = parse_num(str, end, 2))) {
131
- return Qnil;
119
+ return Qnil;
132
120
  }
133
121
  str += 2;
134
122
  args[3] = LONG2NUM(n);
135
123
  if (':' != *str++) {
136
- return Qnil;
124
+ return Qnil;
137
125
  }
138
126
  // minute
139
127
  if (0 > (n = parse_num(str, end, 2))) {
140
- return Qnil;
128
+ return Qnil;
141
129
  }
142
130
  str += 2;
143
131
  args[4] = LONG2NUM(n);
144
132
  if (':' != *str++) {
145
- return Qnil;
133
+ return Qnil;
146
134
  }
147
135
  // second
148
136
  if (0 > (n = parse_num(str, end, 2))) {
149
- return Qnil;
137
+ return Qnil;
150
138
  }
151
139
  str += 2;
152
140
  if (str == end) {
153
- args[5] = LONG2NUM(n);
154
- args[6] = LONG2NUM(0);
141
+ args[5] = LONG2NUM(n);
142
+ args[6] = LONG2NUM(0);
155
143
  } else {
156
- char c = *str++;
157
-
158
- if ('.' == c) {
159
- long long nsec = 0;
160
-
161
- for (; str < end; str++) {
162
- c = *str;
163
- if (c < '0' || '9' < c) {
164
- str++;
165
- break;
166
- }
167
- nsec = nsec * 10 + (c - '0');
168
- }
169
- args[5] = rb_float_new((double)n + ((double)nsec + 0.5) / 1000000000.0);
170
- } else {
171
- args[5] = rb_ll2inum(n);
172
- }
173
- if (end < str) {
174
- args[6] = LONG2NUM(0);
175
- } else {
176
- if ('Z' == c) {
177
- return rb_funcall2(rb_cTime, oj_utc_id, 6, args);
178
- } else if ('+' == c) {
179
- int hr = parse_num(str, end, 2);
180
- int min;
181
-
182
- str += 2;
183
- if (0 > hr || ':' != *str++) {
184
- return Qnil;
185
- }
186
- min = parse_num(str, end, 2);
187
- if (0 > min) {
188
- return Qnil;
189
- }
190
- args[6] = LONG2NUM(hr * 3600 + min * 60);
191
- } else if ('-' == c) {
192
- int hr = parse_num(str, end, 2);
193
- int min;
194
-
195
- str += 2;
196
- if (0 > hr || ':' != *str++) {
197
- return Qnil;
198
- }
199
- min = parse_num(str, end, 2);
200
- if (0 > min) {
201
- return Qnil;
202
- }
203
- args[6] = LONG2NUM(-(hr * 3600 + min * 60));
204
- } else {
205
- args[6] = LONG2NUM(0);
206
- }
207
- }
144
+ char c = *str++;
145
+
146
+ if ('.' == c) {
147
+ long long nsec = 0;
148
+
149
+ for (; str < end; str++) {
150
+ c = *str;
151
+ if (c < '0' || '9' < c) {
152
+ str++;
153
+ break;
154
+ }
155
+ nsec = nsec * 10 + (c - '0');
156
+ }
157
+ args[5] = rb_float_new((double)n + ((double)nsec + 0.5) / 1000000000.0);
158
+ } else {
159
+ args[5] = rb_ll2inum(n);
160
+ }
161
+ if (end < str) {
162
+ args[6] = LONG2NUM(0);
163
+ } else {
164
+ if ('Z' == c) {
165
+ return rb_funcall2(rb_cTime, oj_utc_id, 6, args);
166
+ } else if ('+' == c) {
167
+ int hr = parse_num(str, end, 2);
168
+ int min;
169
+
170
+ str += 2;
171
+ if (0 > hr || ':' != *str++) {
172
+ return Qnil;
173
+ }
174
+ min = parse_num(str, end, 2);
175
+ if (0 > min) {
176
+ return Qnil;
177
+ }
178
+ args[6] = LONG2NUM(hr * 3600 + min * 60);
179
+ } else if ('-' == c) {
180
+ int hr = parse_num(str, end, 2);
181
+ int min;
182
+
183
+ str += 2;
184
+ if (0 > hr || ':' != *str++) {
185
+ return Qnil;
186
+ }
187
+ min = parse_num(str, end, 2);
188
+ if (0 > min) {
189
+ return Qnil;
190
+ }
191
+ args[6] = LONG2NUM(-(hr * 3600 + min * 60));
192
+ } else {
193
+ args[6] = LONG2NUM(0);
194
+ }
195
+ }
208
196
  }
209
197
  return rb_funcall2(rb_cTime, oj_new_id, 7, args);
210
198
  }
211
- #endif
212
199
 
213
- static int
214
- hat_cstr(ParseInfo pi, Val parent, Val kval, const char *str, size_t len) {
215
- const char *key = kval->key;
216
- int klen = kval->klen;
200
+ static int hat_cstr(ParseInfo pi, Val parent, Val kval, const char *str, size_t len) {
201
+ const char *key = kval->key;
202
+ int klen = kval->klen;
217
203
 
218
204
  if (2 == klen) {
219
- switch (key[1]) {
220
- case 'o': // object
221
- { // name2class sets an error if the class is not found or created
222
- VALUE clas = oj_name2class(pi, str, len, Yes == pi->options.auto_define, rb_eArgError);
223
-
224
- if (Qundef != clas) {
225
- parent->val = rb_obj_alloc(clas);
226
- }
227
- }
228
- break;
229
- case 'O': // odd object
230
- {
231
- Odd odd = oj_get_oddc(str, len);
232
-
233
- if (0 == odd) {
234
- return 0;
235
- }
236
- parent->val = odd->clas;
237
- parent->odd_args = oj_odd_alloc_args(odd);
238
- }
239
- break;
240
- case 'm':
241
- parent->val = rb_str_new(str + 1, len - 1);
242
- parent->val = oj_encode(parent->val);
243
- parent->val = rb_funcall(parent->val, oj_to_sym_id, 0);
244
- break;
245
- case 's':
246
- parent->val = rb_str_new(str, len);
247
- parent->val = oj_encode(parent->val);
248
- break;
249
- case 'c': // class
250
- {
251
- VALUE clas = oj_name2class(pi, str, len, Yes == pi->options.auto_define, rb_eArgError);
252
-
253
- if (Qundef == clas) {
254
- return 0;
255
- } else {
256
- parent->val = clas;
257
- }
258
- }
259
- break;
260
- case 't': // time
261
- parent->val = oj_parse_xml_time(str, (int)len);
262
- break;
263
- default:
264
- return 0;
265
- break;
266
- }
267
- return 1; // handled
205
+ switch (key[1]) {
206
+ case 'o': // object
207
+ { // name2class sets an error if the class is not found or created
208
+ VALUE clas = oj_name2class(pi, str, len, Yes == pi->options.auto_define, rb_eArgError);
209
+
210
+ if (Qundef != clas) {
211
+ parent->val = rb_obj_alloc(clas);
212
+ }
213
+ } break;
214
+ case 'O': // odd object
215
+ {
216
+ Odd odd = oj_get_oddc(str, len);
217
+
218
+ if (0 == odd) {
219
+ return 0;
220
+ }
221
+ parent->val = odd->clas;
222
+ parent->odd_args = oj_odd_alloc_args(odd);
223
+ break;
224
+ }
225
+ case 'm': parent->val = ID2SYM(rb_intern3(str + 1, len - 1, oj_utf8_encoding)); break;
226
+ case 's': parent->val = rb_utf8_str_new(str, len); break;
227
+ case 'c': // class
228
+ {
229
+ VALUE clas = oj_name2class(pi, str, len, Yes == pi->options.auto_define, rb_eArgError);
230
+
231
+ if (Qundef == clas) {
232
+ return 0;
233
+ } else {
234
+ parent->val = clas;
235
+ }
236
+ break;
237
+ }
238
+ case 't': // time
239
+ parent->val = oj_parse_xml_time(str, (int)len);
240
+ break;
241
+ default: return 0; break;
242
+ }
243
+ return 1; // handled
268
244
  }
269
245
  return 0;
270
246
  }
271
247
 
272
- static int
273
- hat_num(ParseInfo pi, Val parent, Val kval, NumInfo ni) {
248
+ static int hat_num(ParseInfo pi, Val parent, Val kval, NumInfo ni) {
274
249
  if (2 == kval->klen) {
275
- switch (kval->key[1]) {
276
- case 't': // time as a float
277
- {
278
- int64_t nsec = ni->num * 1000000000LL / ni->div;
279
-
280
- if (ni->neg) {
281
- ni->i = -ni->i;
282
- if (0 < nsec) {
283
- ni->i--;
284
- nsec = 1000000000LL - nsec;
285
- }
286
- }
287
- if (86400 == ni->exp) { // UTC time
288
- parent->val = rb_time_nano_new(ni->i, (long)nsec);
289
- // Since the ruby C routines alway create local time, the
290
- // offset and then a conversion to UTC keeps makes the time
291
- // match the expected value.
292
- parent->val = rb_funcall2(parent->val, oj_utc_id, 0, 0);
293
- } else if (ni->hasExp) {
294
- time_t t = (time_t)(ni->i + ni->exp);
295
- struct tm *st = gmtime(&t);
296
- VALUE args[8];
297
-
298
- // Windows does not support dates before 1970 so ignore
299
- // the zone and do the best we can.
300
- if (NULL == st) {
301
- parent->val = rb_time_nano_new(ni->i, (long)nsec);
302
- } else {
303
- args[0] = LONG2NUM((long)(1900 + st->tm_year));
304
- args[1] = LONG2NUM(1 + st->tm_mon);
305
- args[2] = LONG2NUM(st->tm_mday);
306
- args[3] = LONG2NUM(st->tm_hour);
307
- args[4] = LONG2NUM(st->tm_min);
308
- args[5] = rb_float_new((double)st->tm_sec + ((double)nsec + 0.5) / 1000000000.0);
309
- args[6] = LONG2NUM(ni->exp);
310
- parent->val = rb_funcall2(rb_cTime, oj_new_id, 7, args);
311
- }
312
- } else {
313
- parent->val = rb_time_nano_new(ni->i, (long)nsec);
314
- }
315
- }
316
- break;
317
- case 'i': // circular index
318
- if (!ni->infinity && !ni->neg && 1 == ni->div && 0 == ni->exp && 0 != pi->circ_array) { // fixnum
319
- if (Qnil == parent->val) {
320
- parent->val = rb_hash_new();
321
- }
322
- oj_circ_array_set(pi->circ_array, parent->val, ni->i);
323
- } else {
324
- return 0;
325
- }
326
- break;
327
- default:
328
- return 0;
329
- break;
330
- }
331
- return 1; // handled
250
+ switch (kval->key[1]) {
251
+ case 't': // time as a float
252
+ if (0 == ni->div || 9 < ni->di) {
253
+ rb_raise(rb_eArgError, "Invalid time decimal representation.");
254
+ // parent->val = rb_time_nano_new(0, 0);
255
+ } else {
256
+ int64_t nsec = ni->num * 1000000000LL / ni->div;
257
+
258
+ if (ni->neg) {
259
+ ni->i = -ni->i;
260
+ if (0 < nsec) {
261
+ ni->i--;
262
+ nsec = 1000000000LL - nsec;
263
+ }
264
+ }
265
+ if (86400 == ni->exp) { // UTC time
266
+ parent->val = rb_time_nano_new(ni->i, (long)nsec);
267
+ // Since the ruby C routines always create local time, the
268
+ // offset and then a conversion to UTC keeps makes the time
269
+ // match the expected value.
270
+ parent->val = rb_funcall2(parent->val, oj_utc_id, 0, 0);
271
+ } else if (ni->has_exp) {
272
+ int64_t t = (int64_t)(ni->i + ni->exp);
273
+ struct _timeInfo ti;
274
+ VALUE args[8];
275
+
276
+ sec_as_time(t, &ti);
277
+ args[0] = LONG2NUM((long)(ti.year));
278
+ args[1] = LONG2NUM(ti.mon);
279
+ args[2] = LONG2NUM(ti.day);
280
+ args[3] = LONG2NUM(ti.hour);
281
+ args[4] = LONG2NUM(ti.min);
282
+ args[5] = rb_float_new((double)ti.sec + ((double)nsec + 0.5) / 1000000000.0);
283
+ args[6] = LONG2NUM(ni->exp);
284
+ parent->val = rb_funcall2(rb_cTime, oj_new_id, 7, args);
285
+ } else {
286
+ parent->val = rb_time_nano_new(ni->i, (long)nsec);
287
+ }
288
+ }
289
+ break;
290
+ case 'i': // circular index
291
+ if (!ni->infinity && !ni->neg && 1 == ni->div && 0 == ni->exp && 0 != pi->circ_array) { // fixnum
292
+ if (Qnil == parent->val) {
293
+ parent->val = rb_hash_new();
294
+ }
295
+ oj_circ_array_set(pi->circ_array, parent->val, ni->i);
296
+ } else {
297
+ return 0;
298
+ }
299
+ break;
300
+ default: return 0; break;
301
+ }
302
+ return 1; // handled
332
303
  }
333
304
  return 0;
334
305
  }
335
306
 
336
- static int
337
- hat_value(ParseInfo pi, Val parent, const char *key, size_t klen, volatile VALUE value) {
307
+ static int hat_value(ParseInfo pi, Val parent, const char *key, size_t klen, volatile VALUE value) {
338
308
  if (T_ARRAY == rb_type(value)) {
339
- int len = (int)RARRAY_LEN(value);
340
-
341
- if (2 == klen && 'u' == key[1]) {
342
- volatile VALUE sc;
343
- volatile VALUE e1;
344
- int slen;
345
-
346
- if (0 == len) {
347
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "Invalid struct data");
348
- return 1;
349
- }
350
- e1 = *RARRAY_PTR(value);
351
- // check for anonymous Struct
352
- if (T_ARRAY == rb_type(e1)) {
353
- VALUE args[1024];
354
- volatile VALUE rstr;
355
- int i, cnt = (int)RARRAY_LEN(e1);
356
-
357
- for (i = 0; i < cnt; i++) {
358
- rstr = rb_ary_entry(e1, i);
359
- args[i] = rb_funcall(rstr, oj_to_sym_id, 0);
360
- }
361
- sc = rb_funcall2(rb_cStruct, oj_new_id, cnt, args);
362
- } else {
363
- // If struct is not defined then we let this fail and raise an exception.
364
- sc = oj_name2struct(pi, *RARRAY_PTR(value), rb_eArgError);
365
- }
309
+ int len = (int)RARRAY_LEN(value);
310
+
311
+ if (2 == klen && 'u' == key[1]) {
312
+ volatile VALUE sc;
313
+ volatile VALUE e1;
314
+ int slen;
315
+
316
+ if (0 == len) {
317
+ oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "Invalid struct data");
318
+ return 1;
319
+ }
320
+ e1 = *RARRAY_PTR(value);
321
+ // check for anonymous Struct
322
+ if (T_ARRAY == rb_type(e1)) {
323
+ VALUE args[1024];
324
+ volatile VALUE rstr;
325
+ int i, cnt = (int)RARRAY_LEN(e1);
326
+
327
+ for (i = 0; i < cnt; i++) {
328
+ rstr = RARRAY_AREF(e1, i);
329
+ args[i] = rb_funcall(rstr, oj_to_sym_id, 0);
330
+ }
331
+ sc = rb_funcall2(rb_cStruct, oj_new_id, cnt, args);
332
+ } else {
333
+ // If struct is not defined then we let this fail and raise an exception.
334
+ sc = oj_name2struct(pi, *RARRAY_PTR(value), rb_eArgError);
335
+ }
366
336
  // Create a properly initialized struct instance without calling the initialize method.
367
337
  parent->val = rb_obj_alloc(sc);
368
338
  // If the JSON array has more entries than the struct class allows, we record an error.
369
339
  #ifdef RSTRUCT_LEN
370
340
  #if RSTRUCT_LEN_RETURNS_INTEGER_OBJECT
371
- slen = (int)NUM2LONG(RSTRUCT_LEN(parent->val));
372
- #else // RSTRUCT_LEN_RETURNS_INTEGER_OBJECT
373
- slen = (int)RSTRUCT_LEN(parent->val);
374
- #endif // RSTRUCT_LEN_RETURNS_INTEGER_OBJECT
341
+ slen = (int)NUM2LONG(RSTRUCT_LEN(parent->val));
342
+ #else // RSTRUCT_LEN_RETURNS_INTEGER_OBJECT
343
+ slen = (int)RSTRUCT_LEN(parent->val);
344
+ #endif // RSTRUCT_LEN_RETURNS_INTEGER_OBJECT
375
345
  #else
376
- slen = FIX2INT(rb_funcall2(parent->val, oj_length_id, 0, 0));
346
+ slen = FIX2INT(rb_funcall2(parent->val, oj_length_id, 0, 0));
377
347
  #endif
378
348
  // MRI >= 1.9
379
349
  if (len - 1 > slen) {
380
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "Invalid struct data");
350
+ oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "Invalid struct data");
381
351
  } else {
382
- int i;
352
+ int i;
383
353
 
384
- for (i = 0; i < len - 1; i++) {
385
- rb_struct_aset(parent->val, INT2FIX(i), RARRAY_PTR(value)[i + 1]);
386
- }
354
+ for (i = 0; i < len - 1; i++) {
355
+ rb_struct_aset(parent->val, INT2FIX(i), RARRAY_PTR(value)[i + 1]);
356
+ }
387
357
  }
388
- return 1;
389
- } else if (3 <= klen && '#' == key[1]) {
390
- volatile VALUE *a;
358
+ return 1;
359
+ } else if (3 <= klen && '#' == key[1]) {
360
+ volatile VALUE *a;
391
361
 
392
- if (2 != len) {
393
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "invalid hash pair");
394
- return 1;
395
- }
396
- parent->val = rb_hash_new();
397
- a = RARRAY_PTR(value);
398
- rb_hash_aset(parent->val, *a, a[1]);
362
+ if (2 != len) {
363
+ oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "invalid hash pair");
364
+ return 1;
365
+ }
366
+ parent->val = rb_hash_new();
367
+ a = RARRAY_PTR(value);
368
+ rb_hash_aset(parent->val, *a, a[1]);
399
369
 
400
- return 1;
401
- }
370
+ return 1;
371
+ }
402
372
  }
403
373
  return 0;
404
374
  }
405
375
 
406
- static void
407
- copy_ivars(VALUE target, VALUE src) {
408
- volatile VALUE vars = rb_funcall(src, oj_instance_variables_id, 0);
409
- volatile VALUE *np = RARRAY_PTR(vars);
410
- ID vid;
411
- int i, cnt = (int)RARRAY_LEN(vars);
412
- const char *attr;
413
-
414
- for (i = cnt; 0 < i; i--, np++) {
415
- vid = rb_to_id(*np);
416
- attr = rb_id2name(vid);
417
- if ('@' == *attr) {
418
- rb_ivar_set(target, vid, rb_ivar_get(src, vid));
419
- }
420
- }
376
+ void oj_set_obj_ivar(Val parent, Val kval, VALUE value) {
377
+ rb_ivar_set(parent->val, oj_attr_intern(kval->key, kval->klen), value);
421
378
  }
422
379
 
423
- void
424
- oj_set_obj_ivar(Val parent, Val kval, VALUE value) {
425
- const char *key = kval->key;
426
- int klen = kval->klen;
427
- ID var_id;
428
- ID *slot;
429
-
430
- if ('~' == *key && Qtrue == rb_obj_is_kind_of(parent->val, rb_eException)) {
431
- if (5 == klen && 0 == strncmp("~mesg", key, klen)) {
432
- VALUE args[1];
433
- volatile VALUE prev = parent->val;
434
-
435
- args[0] = value;
436
- parent->val = rb_class_new_instance(1, args, rb_class_of(parent->val));
437
- copy_ivars(parent->val, prev);
438
- } else if (3 == klen && 0 == strncmp("~bt", key, klen)) {
439
- rb_funcall(parent->val, rb_intern("set_backtrace"), 1, value);
440
- }
441
- }
442
- #if HAVE_LIBPTHREAD
443
- pthread_mutex_lock(&oj_cache_mutex);
444
- #else
445
- rb_mutex_lock(oj_cache_mutex);
446
- #endif
447
- if (0 == (var_id = oj_attr_hash_get(key, klen, &slot))) {
448
- char attr[256];
449
-
450
- if ((int)sizeof(attr) <= klen + 2) {
451
- char *buf = ALLOC_N(char, klen + 2);
452
-
453
- if ('~' == *key) {
454
- strncpy(buf, key + 1, klen - 1);
455
- buf[klen - 1] = '\0';
456
- } else {
457
- *buf = '@';
458
- strncpy(buf + 1, key, klen);
459
- buf[klen + 1] = '\0';
460
- }
461
- var_id = rb_intern(buf);
462
- xfree(buf);
463
- } else {
464
- if ('~' == *key) {
465
- strncpy(attr, key + 1, klen - 1);
466
- attr[klen - 1] = '\0';
467
- } else {
468
- *attr = '@';
469
- strncpy(attr + 1, key, klen);
470
- attr[klen + 1] = '\0';
471
- }
472
- var_id = rb_intern(attr);
473
- }
474
- *slot = var_id;
475
- }
476
- #if HAVE_LIBPTHREAD
477
- pthread_mutex_unlock(&oj_cache_mutex);
478
- #else
479
- rb_mutex_unlock(oj_cache_mutex);
480
- #endif
481
- rb_ivar_set(parent->val, var_id, value);
482
- }
380
+ static void hash_set_cstr(ParseInfo pi, Val kval, const char *str, size_t len, const char *orig) {
381
+ const char * key = kval->key;
382
+ int klen = kval->klen;
383
+ Val parent = stack_peek(&pi->stack);
384
+ volatile VALUE rval = Qnil;
483
385
 
484
- static void
485
- hash_set_cstr(ParseInfo pi, Val kval, const char *str, size_t len, const char *orig) {
486
- const char *key = kval->key;
487
- int klen = kval->klen;
488
- Val parent = stack_peek(&pi->stack);
489
- volatile VALUE rval = Qnil;
490
-
491
- WHICH_TYPE:
386
+ WHICH_TYPE:
492
387
  switch (rb_type(parent->val)) {
493
388
  case T_NIL:
494
- parent->odd_args = 0; // make sure it is 0 in case not odd
495
- if ('^' != *key || !hat_cstr(pi, parent, kval, str, len)) {
496
- parent->val = rb_hash_new();
497
- goto WHICH_TYPE;
498
- }
499
- break;
389
+ parent->odd_args = NULL; // make sure it is NULL in case not odd
390
+ if ('^' != *key || !hat_cstr(pi, parent, kval, str, len)) {
391
+ parent->val = rb_hash_new();
392
+ goto WHICH_TYPE;
393
+ }
394
+ break;
500
395
  case T_HASH:
501
- rb_hash_aset(parent->val, calc_hash_key(pi, kval, parent->k1), str_to_value(pi, str, len, orig));
502
- break;
396
+ rb_hash_aset(parent->val, calc_hash_key(pi, kval, parent->k1), str_to_value(pi, str, len, orig));
397
+ break;
503
398
  case T_STRING:
504
- rval = str_to_value(pi, str, len, orig);
505
- if (4 == klen && 's' == *key && 'e' == key[1] && 'l' == key[2] && 'f' == key[3]) {
506
- rb_funcall(parent->val, oj_replace_id, 1, rval);
507
- } else {
508
- oj_set_obj_ivar(parent, kval, rval);
509
- }
510
- break;
399
+ rval = str_to_value(pi, str, len, orig);
400
+ if (4 == klen && 's' == *key && 'e' == key[1] && 'l' == key[2] && 'f' == key[3]) {
401
+ rb_funcall(parent->val, oj_replace_id, 1, rval);
402
+ } else {
403
+ oj_set_obj_ivar(parent, kval, rval);
404
+ }
405
+ break;
511
406
  case T_OBJECT:
512
- rval = str_to_value(pi, str, len, orig);
513
- oj_set_obj_ivar(parent, kval, rval);
514
- break;
407
+ rval = str_to_value(pi, str, len, orig);
408
+ oj_set_obj_ivar(parent, kval, rval);
409
+ break;
515
410
  case T_CLASS:
516
- if (0 == parent->odd_args) {
517
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "%s is not an odd class", rb_class2name(rb_obj_class(parent->val)));
518
- return;
519
- } else {
520
- rval = str_to_value(pi, str, len, orig);
521
- if (0 != oj_odd_set_arg(parent->odd_args, kval->key, kval->klen, rval)) {
522
- char buf[256];
523
-
524
- if ((int)sizeof(buf) - 1 <= klen) {
525
- klen = sizeof(buf) - 2;
526
- }
527
- memcpy(buf, key, klen);
528
- buf[klen] = '\0';
529
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "%s is not an attribute of %s", buf, rb_class2name(rb_obj_class(parent->val)));
530
- }
531
- }
532
- break;
411
+ if (NULL == parent->odd_args) {
412
+ oj_set_error_at(pi,
413
+ oj_parse_error_class,
414
+ __FILE__,
415
+ __LINE__,
416
+ "%s is not an odd class",
417
+ rb_class2name(rb_obj_class(parent->val)));
418
+ return;
419
+ } else {
420
+ rval = str_to_value(pi, str, len, orig);
421
+ if (0 != oj_odd_set_arg(parent->odd_args, kval->key, kval->klen, rval)) {
422
+ char buf[256];
423
+
424
+ if ((int)sizeof(buf) - 1 <= klen) {
425
+ klen = sizeof(buf) - 2;
426
+ }
427
+ memcpy(buf, key, klen);
428
+ buf[klen] = '\0';
429
+ oj_set_error_at(pi,
430
+ oj_parse_error_class,
431
+ __FILE__,
432
+ __LINE__,
433
+ "%s is not an attribute of %s",
434
+ buf,
435
+ rb_class2name(rb_obj_class(parent->val)));
436
+ }
437
+ }
438
+ break;
533
439
  default:
534
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "can not add attributes to a %s", rb_class2name(rb_obj_class(parent->val)));
535
- return;
440
+ oj_set_error_at(pi,
441
+ oj_parse_error_class,
442
+ __FILE__,
443
+ __LINE__,
444
+ "can not add attributes to a %s",
445
+ rb_class2name(rb_obj_class(parent->val)));
446
+ return;
536
447
  }
537
- if (Yes == pi->options.trace) {
538
- oj_trace_parse_call("set_string", pi, __FILE__, __LINE__, rval);
448
+ if (RB_UNLIKELY(Yes == pi->options.trace)) {
449
+ oj_trace_parse_call("set_string", pi, __FILE__, __LINE__, rval);
539
450
  }
540
451
  }
541
452
 
542
- static void
543
- hash_set_num(ParseInfo pi, Val kval, NumInfo ni) {
544
- const char *key = kval->key;
545
- int klen = kval->klen;
546
- Val parent = stack_peek(&pi->stack);
547
- volatile VALUE rval = Qnil;
453
+ static void hash_set_num(ParseInfo pi, Val kval, NumInfo ni) {
454
+ const char * key = kval->key;
455
+ int klen = kval->klen;
456
+ Val parent = stack_peek(&pi->stack);
457
+ volatile VALUE rval = Qnil;
548
458
 
549
- WHICH_TYPE:
459
+ WHICH_TYPE:
550
460
  switch (rb_type(parent->val)) {
551
461
  case T_NIL:
552
- parent->odd_args = 0; // make sure it is 0 in case not odd
553
- if ('^' != *key || !hat_num(pi, parent, kval, ni)) {
554
- parent->val = rb_hash_new();
555
- goto WHICH_TYPE;
556
- }
557
- break;
462
+ parent->odd_args = NULL; // make sure it is NULL in case not odd
463
+ if ('^' != *key || !hat_num(pi, parent, kval, ni)) {
464
+ parent->val = rb_hash_new();
465
+ goto WHICH_TYPE;
466
+ }
467
+ break;
558
468
  case T_HASH:
559
- rval = oj_num_as_value(ni);
560
- rb_hash_aset(parent->val, calc_hash_key(pi, kval, parent->k1), rval);
561
- break;
469
+ rval = oj_num_as_value(ni);
470
+ rb_hash_aset(parent->val, calc_hash_key(pi, kval, parent->k1), rval);
471
+ break;
562
472
  case T_OBJECT:
563
- if (2 == klen && '^' == *key && 'i' == key[1] &&
564
- !ni->infinity && !ni->neg && 1 == ni->div && 0 == ni->exp && 0 != pi->circ_array) { // fixnum
565
- oj_circ_array_set(pi->circ_array, parent->val, ni->i);
566
- } else {
567
- rval = oj_num_as_value(ni);
568
- oj_set_obj_ivar(parent, kval, rval);
569
- }
570
- break;
473
+ if (2 == klen && '^' == *key && 'i' == key[1] && !ni->infinity && !ni->neg && 1 == ni->div && 0 == ni->exp &&
474
+ 0 != pi->circ_array) { // fixnum
475
+ oj_circ_array_set(pi->circ_array, parent->val, ni->i);
476
+ } else {
477
+ rval = oj_num_as_value(ni);
478
+ oj_set_obj_ivar(parent, kval, rval);
479
+ }
480
+ break;
571
481
  case T_CLASS:
572
- if (0 == parent->odd_args) {
573
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "%s is not an odd class", rb_class2name(rb_obj_class(parent->val)));
574
- return;
575
- } else {
576
- rval = oj_num_as_value(ni);
577
- if (0 != oj_odd_set_arg(parent->odd_args, key, klen, rval)) {
578
- char buf[256];
579
-
580
- if ((int)sizeof(buf) - 1 <= klen) {
581
- klen = sizeof(buf) - 2;
582
- }
583
- memcpy(buf, key, klen);
584
- buf[klen] = '\0';
585
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "%s is not an attribute of %s", buf, rb_class2name(rb_obj_class(parent->val)));
586
- }
587
- }
588
- break;
482
+ if (NULL == parent->odd_args) {
483
+ oj_set_error_at(pi,
484
+ oj_parse_error_class,
485
+ __FILE__,
486
+ __LINE__,
487
+ "%s is not an odd class",
488
+ rb_class2name(rb_obj_class(parent->val)));
489
+ return;
490
+ } else {
491
+ rval = oj_num_as_value(ni);
492
+ if (0 != oj_odd_set_arg(parent->odd_args, key, klen, rval)) {
493
+ char buf[256];
494
+
495
+ if ((int)sizeof(buf) - 1 <= klen) {
496
+ klen = sizeof(buf) - 2;
497
+ }
498
+ memcpy(buf, key, klen);
499
+ buf[klen] = '\0';
500
+ oj_set_error_at(pi,
501
+ oj_parse_error_class,
502
+ __FILE__,
503
+ __LINE__,
504
+ "%s is not an attribute of %s",
505
+ buf,
506
+ rb_class2name(rb_obj_class(parent->val)));
507
+ }
508
+ }
509
+ break;
589
510
  default:
590
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "can not add attributes to a %s", rb_class2name(rb_obj_class(parent->val)));
591
- return;
511
+ oj_set_error_at(pi,
512
+ oj_parse_error_class,
513
+ __FILE__,
514
+ __LINE__,
515
+ "can not add attributes to a %s",
516
+ rb_class2name(rb_obj_class(parent->val)));
517
+ return;
592
518
  }
593
- if (Yes == pi->options.trace) {
594
- oj_trace_parse_call("add_number", pi, __FILE__, __LINE__, rval);
519
+ if (RB_UNLIKELY(Yes == pi->options.trace)) {
520
+ oj_trace_parse_call("add_number", pi, __FILE__, __LINE__, rval);
595
521
  }
596
522
  }
597
523
 
598
- static void
599
- hash_set_value(ParseInfo pi, Val kval, VALUE value) {
600
- const char *key = kval->key;
601
- int klen = kval->klen;
602
- Val parent = stack_peek(&pi->stack);
524
+ static void hash_set_value(ParseInfo pi, Val kval, VALUE value) {
525
+ const char *key = kval->key;
526
+ int klen = kval->klen;
527
+ Val parent = stack_peek(&pi->stack);
603
528
 
604
- WHICH_TYPE:
529
+ WHICH_TYPE:
605
530
  switch (rb_type(parent->val)) {
606
531
  case T_NIL:
607
- parent->odd_args = 0; // make sure it is 0 in case not odd
608
- if ('^' != *key || !hat_value(pi, parent, key, klen, value)) {
609
- parent->val = rb_hash_new();
610
- goto WHICH_TYPE;
611
- }
612
- break;
532
+ parent->odd_args = NULL; // make sure it is NULL in case not odd
533
+ if ('^' != *key || !hat_value(pi, parent, key, klen, value)) {
534
+ parent->val = rb_hash_new();
535
+ goto WHICH_TYPE;
536
+ }
537
+ break;
613
538
  case T_HASH:
614
- if (rb_cHash != rb_obj_class(parent->val)) {
615
- if (4 == klen && 's' == *key && 'e' == key[1] && 'l' == key[2] && 'f' == key[3]) {
616
- rb_funcall(parent->val, oj_replace_id, 1, value);
617
- } else {
618
- oj_set_obj_ivar(parent, kval, value);
619
- }
620
- } else {
621
- if (3 <= klen && '^' == *key && '#' == key[1] && T_ARRAY == rb_type(value)) {
622
- long len = RARRAY_LEN(value);
623
- volatile VALUE *a = RARRAY_PTR(value);
624
-
625
- if (2 != len) {
626
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "invalid hash pair");
627
- return;
628
- }
629
- rb_hash_aset(parent->val, *a, a[1]);
630
- } else {
631
- rb_hash_aset(parent->val, calc_hash_key(pi, kval, parent->k1), value);
632
- }
633
- }
634
- break;
539
+ if (rb_cHash != rb_obj_class(parent->val)) {
540
+ if (4 == klen && 's' == *key && 'e' == key[1] && 'l' == key[2] && 'f' == key[3]) {
541
+ rb_funcall(parent->val, oj_replace_id, 1, value);
542
+ } else {
543
+ oj_set_obj_ivar(parent, kval, value);
544
+ }
545
+ } else {
546
+ if (3 <= klen && '^' == *key && '#' == key[1] && T_ARRAY == rb_type(value)) {
547
+ long len = RARRAY_LEN(value);
548
+ volatile VALUE *a = RARRAY_PTR(value);
549
+
550
+ if (2 != len) {
551
+ oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "invalid hash pair");
552
+ return;
553
+ }
554
+ rb_hash_aset(parent->val, *a, a[1]);
555
+ } else {
556
+ rb_hash_aset(parent->val, calc_hash_key(pi, kval, parent->k1), value);
557
+ }
558
+ }
559
+ break;
635
560
  case T_ARRAY:
636
- if (4 == klen && 's' == *key && 'e' == key[1] && 'l' == key[2] && 'f' == key[3]) {
637
- rb_funcall(parent->val, oj_replace_id, 1, value);
638
- } else {
639
- oj_set_obj_ivar(parent, kval, value);
640
- }
641
- break;
642
- case T_STRING: // for subclassed strings
643
- case T_OBJECT:
644
- oj_set_obj_ivar(parent, kval, value);
645
- break;
561
+ if (4 == klen && 's' == *key && 'e' == key[1] && 'l' == key[2] && 'f' == key[3]) {
562
+ rb_funcall(parent->val, oj_replace_id, 1, value);
563
+ } else {
564
+ oj_set_obj_ivar(parent, kval, value);
565
+ }
566
+ break;
567
+ case T_STRING: // for subclassed strings
568
+ case T_OBJECT: oj_set_obj_ivar(parent, kval, value); break;
646
569
  case T_MODULE:
647
570
  case T_CLASS:
648
- if (0 == parent->odd_args) {
649
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "%s is not an odd class", rb_class2name(rb_obj_class(parent->val)));
650
- return;
651
- } else if (0 != oj_odd_set_arg(parent->odd_args, key, klen, value)) {
652
- char buf[256];
653
-
654
- if ((int)sizeof(buf) - 1 <= klen) {
655
- klen = sizeof(buf) - 2;
656
- }
657
- memcpy(buf, key, klen);
658
- buf[klen] = '\0';
659
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "%s is not an attribute of %s", buf, rb_class2name(rb_obj_class(parent->val)));
660
- }
661
- break;
571
+ if (NULL == parent->odd_args) {
572
+ oj_set_error_at(pi,
573
+ oj_parse_error_class,
574
+ __FILE__,
575
+ __LINE__,
576
+ "%s is not an odd class",
577
+ rb_class2name(rb_obj_class(parent->val)));
578
+ return;
579
+ } else if (0 != oj_odd_set_arg(parent->odd_args, key, klen, value)) {
580
+ char buf[256];
581
+
582
+ if ((int)sizeof(buf) - 1 <= klen) {
583
+ klen = sizeof(buf) - 2;
584
+ }
585
+ memcpy(buf, key, klen);
586
+ buf[klen] = '\0';
587
+ oj_set_error_at(pi,
588
+ oj_parse_error_class,
589
+ __FILE__,
590
+ __LINE__,
591
+ "%s is not an attribute of %s",
592
+ buf,
593
+ rb_class2name(rb_obj_class(parent->val)));
594
+ }
595
+ break;
662
596
  default:
663
- oj_set_error_at(pi, oj_parse_error_class, __FILE__, __LINE__, "can not add attributes to a %s", rb_class2name(rb_obj_class(parent->val)));
664
- return;
597
+ oj_set_error_at(pi,
598
+ oj_parse_error_class,
599
+ __FILE__,
600
+ __LINE__,
601
+ "can not add attributes to a %s",
602
+ rb_class2name(rb_obj_class(parent->val)));
603
+ return;
665
604
  }
666
- if (Yes == pi->options.trace) {
667
- oj_trace_parse_call("add_value", pi, __FILE__, __LINE__, value);
605
+ if (RB_UNLIKELY(Yes == pi->options.trace)) {
606
+ oj_trace_parse_call("add_value", pi, __FILE__, __LINE__, value);
668
607
  }
669
608
  }
670
609
 
671
- static VALUE
672
- start_hash(ParseInfo pi) {
673
- if (Yes == pi->options.trace) {
674
- oj_trace_parse_in("start_hash", pi, __FILE__, __LINE__);
610
+ static VALUE start_hash(ParseInfo pi) {
611
+ if (RB_UNLIKELY(Yes == pi->options.trace)) {
612
+ oj_trace_parse_in("start_hash", pi, __FILE__, __LINE__);
675
613
  }
676
614
  return Qnil;
677
615
  }
678
616
 
679
- static void
680
- end_hash(struct _ParseInfo *pi) {
681
- Val parent = stack_peek(&pi->stack);
617
+ static void end_hash(ParseInfo pi) {
618
+ Val parent = stack_peek(&pi->stack);
682
619
 
683
620
  if (Qnil == parent->val) {
684
- parent->val = rb_hash_new();
685
- } else if (0 != parent->odd_args) {
686
- OddArgs oa = parent->odd_args;
621
+ parent->val = rb_hash_new();
622
+ } else if (NULL != parent->odd_args) {
623
+ OddArgs oa = parent->odd_args;
687
624
 
688
- parent->val = rb_funcall2(oa->odd->create_obj, oa->odd->create_op, oa->odd->attr_cnt, oa->args);
689
- oj_odd_free(oa);
690
- parent->odd_args = 0;
625
+ parent->val = rb_funcall2(oa->odd->create_obj, oa->odd->create_op, oa->odd->attr_cnt, oa->args);
626
+ oj_odd_free(oa);
627
+ parent->odd_args = NULL;
691
628
  }
692
- if (Yes == pi->options.trace) {
693
- oj_trace_parse_hash_end(pi, __FILE__, __LINE__);
629
+ if (RB_UNLIKELY(Yes == pi->options.trace)) {
630
+ oj_trace_parse_hash_end(pi, __FILE__, __LINE__);
694
631
  }
695
632
  }
696
633
 
697
- static void
698
- array_append_cstr(ParseInfo pi, const char *str, size_t len, const char *orig) {
699
- volatile VALUE rval = Qnil;
700
-
701
- if (3 <= len && 0 != pi->circ_array) {
702
- if ('i' == str[1]) {
703
- long i = read_long(str + 2, len - 2);
634
+ static void array_append_cstr(ParseInfo pi, const char *str, size_t len, const char *orig) {
635
+ volatile VALUE rval = Qnil;
704
636
 
705
- if (0 < i) {
706
- oj_circ_array_set(pi->circ_array, stack_peek(&pi->stack)->val, i);
707
- return;
708
- }
709
- } else if ('r' == str[1]) {
710
- long i = read_long(str + 2, len - 2);
637
+ // orig lets us know whether the string was ^r1 or \u005er1
638
+ if (3 <= len && 0 != pi->circ_array && '^' == orig[0] && 0 == rb_array_len(stack_peek(&pi->stack)->val)) {
639
+ if ('i' == str[1]) {
640
+ long i = read_long(str + 2, len - 2);
711
641
 
712
- if (0 < i) {
713
- rb_ary_push(stack_peek(&pi->stack)->val, oj_circ_array_get(pi->circ_array, i));
714
- return;
715
- }
642
+ if (0 < i) {
643
+ oj_circ_array_set(pi->circ_array, stack_peek(&pi->stack)->val, i);
644
+ return;
645
+ }
646
+ } else if ('r' == str[1]) {
647
+ long i = read_long(str + 2, len - 2);
716
648
 
717
- }
649
+ if (0 < i) {
650
+ rb_ary_push(stack_peek(&pi->stack)->val, oj_circ_array_get(pi->circ_array, i));
651
+ return;
652
+ }
653
+ }
718
654
  }
719
655
  rval = str_to_value(pi, str, len, orig);
720
656
  rb_ary_push(stack_peek(&pi->stack)->val, rval);
721
- if (Yes == pi->options.trace) {
722
- oj_trace_parse_call("append_string", pi, __FILE__, __LINE__, rval);
657
+ if (RB_UNLIKELY(Yes == pi->options.trace)) {
658
+ oj_trace_parse_call("append_string", pi, __FILE__, __LINE__, rval);
723
659
  }
724
660
  }
725
661
 
726
- static void
727
- array_append_num(ParseInfo pi, NumInfo ni) {
728
- volatile VALUE rval = oj_num_as_value(ni);
729
-
662
+ static void array_append_num(ParseInfo pi, NumInfo ni) {
663
+ volatile VALUE rval = oj_num_as_value(ni);
664
+
730
665
  rb_ary_push(stack_peek(&pi->stack)->val, rval);
731
- if (Yes == pi->options.trace) {
732
- oj_trace_parse_call("append_number", pi, __FILE__, __LINE__, rval);
666
+ if (RB_UNLIKELY(Yes == pi->options.trace)) {
667
+ oj_trace_parse_call("append_number", pi, __FILE__, __LINE__, rval);
733
668
  }
734
669
  }
735
670
 
736
- static void
737
- add_cstr(ParseInfo pi, const char *str, size_t len, const char *orig) {
671
+ static void add_cstr(ParseInfo pi, const char *str, size_t len, const char *orig) {
738
672
  pi->stack.head->val = str_to_value(pi, str, len, orig);
739
- if (Yes == pi->options.trace) {
740
- oj_trace_parse_call("add_string", pi, __FILE__, __LINE__, pi->stack.head->val);
673
+ if (RB_UNLIKELY(Yes == pi->options.trace)) {
674
+ oj_trace_parse_call("add_string", pi, __FILE__, __LINE__, pi->stack.head->val);
741
675
  }
742
676
  }
743
677
 
744
- static void
745
- add_num(ParseInfo pi, NumInfo ni) {
678
+ static void add_num(ParseInfo pi, NumInfo ni) {
746
679
  pi->stack.head->val = oj_num_as_value(ni);
747
- if (Yes == pi->options.trace) {
748
- oj_trace_parse_call("add_num", pi, __FILE__, __LINE__, pi->stack.head->val);
680
+ if (RB_UNLIKELY(Yes == pi->options.trace)) {
681
+ oj_trace_parse_call("add_num", pi, __FILE__, __LINE__, pi->stack.head->val);
749
682
  }
750
683
  }
751
684
 
752
- void
753
- oj_set_object_callbacks(ParseInfo pi) {
685
+ void oj_set_object_callbacks(ParseInfo pi) {
754
686
  oj_set_strict_callbacks(pi);
755
- pi->end_hash = end_hash;
756
- pi->start_hash = start_hash;
757
- pi->hash_set_cstr = hash_set_cstr;
758
- pi->hash_set_num = hash_set_num;
759
- pi->hash_set_value = hash_set_value;
760
- pi->add_cstr = add_cstr;
761
- pi->add_num = add_num;
687
+ pi->end_hash = end_hash;
688
+ pi->start_hash = start_hash;
689
+ pi->hash_set_cstr = hash_set_cstr;
690
+ pi->hash_set_num = hash_set_num;
691
+ pi->hash_set_value = hash_set_value;
692
+ pi->add_cstr = add_cstr;
693
+ pi->add_num = add_num;
762
694
  pi->array_append_cstr = array_append_cstr;
763
- pi->array_append_num = array_append_num;
695
+ pi->array_append_num = array_append_num;
764
696
  }
765
697
 
766
698
  VALUE
767
699
  oj_object_parse(int argc, VALUE *argv, VALUE self) {
768
- struct _ParseInfo pi;
700
+ struct _parseInfo pi;
769
701
 
770
702
  parse_info_init(&pi);
771
- pi.options = oj_default_options;
772
- pi.handler = Qnil;
703
+ pi.options = oj_default_options;
704
+ pi.handler = Qnil;
773
705
  pi.err_class = Qnil;
774
706
  oj_set_object_callbacks(&pi);
775
707
 
776
708
  if (T_STRING == rb_type(*argv)) {
777
- return oj_pi_parse(argc, argv, &pi, 0, 0, 1);
709
+ return oj_pi_parse(argc, argv, &pi, 0, 0, 1);
778
710
  } else {
779
- return oj_pi_sparse(argc, argv, &pi, 0);
711
+ return oj_pi_sparse(argc, argv, &pi, 0);
780
712
  }
781
713
  }
782
714
 
783
715
  VALUE
784
716
  oj_object_parse_cstr(int argc, VALUE *argv, char *json, size_t len) {
785
- struct _ParseInfo pi;
717
+ struct _parseInfo pi;
786
718
 
787
719
  parse_info_init(&pi);
788
- pi.options = oj_default_options;
789
- pi.handler = Qnil;
720
+ pi.options = oj_default_options;
721
+ pi.handler = Qnil;
790
722
  pi.err_class = Qnil;
791
723
  oj_set_strict_callbacks(&pi);
792
- pi.end_hash = end_hash;
793
- pi.start_hash = start_hash;
794
- pi.hash_set_cstr = hash_set_cstr;
795
- pi.hash_set_num = hash_set_num;
796
- pi.hash_set_value = hash_set_value;
797
- pi.add_cstr = add_cstr;
798
- pi.add_num = add_num;
724
+ pi.end_hash = end_hash;
725
+ pi.start_hash = start_hash;
726
+ pi.hash_set_cstr = hash_set_cstr;
727
+ pi.hash_set_num = hash_set_num;
728
+ pi.hash_set_value = hash_set_value;
729
+ pi.add_cstr = add_cstr;
730
+ pi.add_num = add_num;
799
731
  pi.array_append_cstr = array_append_cstr;
800
- pi.array_append_num = array_append_num;
732
+ pi.array_append_num = array_append_num;
801
733
 
802
734
  return oj_pi_parse(argc, argv, &pi, json, len, 1);
803
735
  }