kanayago 0.2.0 → 0.4.0

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.
Files changed (81) hide show
  1. checksums.yaml +4 -4
  2. data/CHANGELOG.md +261 -0
  3. data/README.md +1 -1
  4. data/Rakefile +5 -48
  5. data/ext/kanayago/extconf.rb +8 -0
  6. data/ext/kanayago/kanayago.c +30 -185
  7. data/ext/kanayago/scope_node.c +2 -16
  8. data/ext/kanayago/variable_node.c +2 -1
  9. data/lib/kanayago/call_node.rb +19 -0
  10. data/lib/kanayago/constant_node.rb +15 -0
  11. data/lib/kanayago/literal_node.rb +4 -0
  12. data/lib/kanayago/scope_node.rb +14 -0
  13. data/lib/kanayago/statement_node.rb +16 -0
  14. data/lib/kanayago/variable_node.rb +4 -0
  15. data/lib/kanayago/version.rb +1 -1
  16. data/lib/kanayago.rb +3 -16
  17. data/script/setup_parser.rb +136 -0
  18. metadata +6 -64
  19. data/ext/kanayago/ccan/check_type/check_type.h +0 -63
  20. data/ext/kanayago/ccan/container_of/container_of.h +0 -142
  21. data/ext/kanayago/ccan/list/list.h +0 -791
  22. data/ext/kanayago/ccan/str/str.h +0 -17
  23. data/ext/kanayago/constant.h +0 -53
  24. data/ext/kanayago/id.h +0 -354
  25. data/ext/kanayago/id_table.h +0 -54
  26. data/ext/kanayago/include/ruby/st.h +0 -199
  27. data/ext/kanayago/internal/array.h +0 -154
  28. data/ext/kanayago/internal/basic_operators.h +0 -65
  29. data/ext/kanayago/internal/bignum.h +0 -245
  30. data/ext/kanayago/internal/bits.h +0 -650
  31. data/ext/kanayago/internal/compile.h +0 -34
  32. data/ext/kanayago/internal/compilers.h +0 -107
  33. data/ext/kanayago/internal/complex.h +0 -29
  34. data/ext/kanayago/internal/encoding.h +0 -39
  35. data/ext/kanayago/internal/error.h +0 -251
  36. data/ext/kanayago/internal/fixnum.h +0 -185
  37. data/ext/kanayago/internal/gc.h +0 -358
  38. data/ext/kanayago/internal/hash.h +0 -194
  39. data/ext/kanayago/internal/imemo.h +0 -322
  40. data/ext/kanayago/internal/io.h +0 -163
  41. data/ext/kanayago/internal/namespace.h +0 -81
  42. data/ext/kanayago/internal/numeric.h +0 -275
  43. data/ext/kanayago/internal/parse.h +0 -131
  44. data/ext/kanayago/internal/rational.h +0 -71
  45. data/ext/kanayago/internal/re.h +0 -33
  46. data/ext/kanayago/internal/ruby_parser.h +0 -125
  47. data/ext/kanayago/internal/sanitizers.h +0 -346
  48. data/ext/kanayago/internal/serial.h +0 -23
  49. data/ext/kanayago/internal/set_table.h +0 -70
  50. data/ext/kanayago/internal/static_assert.h +0 -16
  51. data/ext/kanayago/internal/string.h +0 -203
  52. data/ext/kanayago/internal/symbol.h +0 -46
  53. data/ext/kanayago/internal/thread.h +0 -112
  54. data/ext/kanayago/internal/variable.h +0 -74
  55. data/ext/kanayago/internal/vm.h +0 -136
  56. data/ext/kanayago/internal/warnings.h +0 -16
  57. data/ext/kanayago/internal.h +0 -105
  58. data/ext/kanayago/lex.c +0 -302
  59. data/ext/kanayago/method.h +0 -271
  60. data/ext/kanayago/node.c +0 -446
  61. data/ext/kanayago/node.h +0 -122
  62. data/ext/kanayago/node_name.inc +0 -224
  63. data/ext/kanayago/parse.c +0 -27377
  64. data/ext/kanayago/parse.h +0 -244
  65. data/ext/kanayago/parser_bits.h +0 -564
  66. data/ext/kanayago/parser_node.h +0 -32
  67. data/ext/kanayago/parser_st.c +0 -165
  68. data/ext/kanayago/parser_st.h +0 -162
  69. data/ext/kanayago/parser_value.h +0 -106
  70. data/ext/kanayago/probes.h +0 -4
  71. data/ext/kanayago/ruby_assert.h +0 -14
  72. data/ext/kanayago/ruby_atomic.h +0 -66
  73. data/ext/kanayago/ruby_parser.c +0 -1137
  74. data/ext/kanayago/rubyparser.h +0 -1394
  75. data/ext/kanayago/shape.h +0 -444
  76. data/ext/kanayago/st.c +0 -3223
  77. data/ext/kanayago/symbol.h +0 -116
  78. data/ext/kanayago/thread_pthread.h +0 -175
  79. data/ext/kanayago/universal_parser.c +0 -211
  80. data/ext/kanayago/vm_core.h +0 -2349
  81. data/ext/kanayago/vm_opts.h +0 -67
data/ext/kanayago/shape.h DELETED
@@ -1,444 +0,0 @@
1
- #ifndef RUBY_SHAPE_H
2
- #define RUBY_SHAPE_H
3
-
4
- #include "internal/gc.h"
5
-
6
- typedef uint16_t attr_index_t;
7
- typedef uint32_t shape_id_t;
8
- #define SHAPE_ID_NUM_BITS 32
9
- #define SHAPE_ID_OFFSET_NUM_BITS 19
10
-
11
- STATIC_ASSERT(shape_id_num_bits, SHAPE_ID_NUM_BITS == sizeof(shape_id_t) * CHAR_BIT);
12
-
13
- #define SHAPE_BUFFER_SIZE (1 << SHAPE_ID_OFFSET_NUM_BITS)
14
- #define SHAPE_ID_OFFSET_MASK (SHAPE_BUFFER_SIZE - 1)
15
-
16
- #define SHAPE_ID_HEAP_INDEX_BITS 3
17
- #define SHAPE_ID_HEAP_INDEX_MAX ((1 << SHAPE_ID_HEAP_INDEX_BITS) - 1)
18
-
19
- #define SHAPE_ID_FL_USHIFT (SHAPE_ID_OFFSET_NUM_BITS + SHAPE_ID_HEAP_INDEX_BITS)
20
- #define SHAPE_ID_HEAP_INDEX_OFFSET SHAPE_ID_FL_USHIFT
21
-
22
- // shape_id_t bits:
23
- // 0-18 SHAPE_ID_OFFSET_MASK
24
- // index in rb_shape_tree.shape_list. Allow to access `rb_shape_t *`.
25
- // 19-21 SHAPE_ID_HEAP_INDEX_MASK
26
- // index in rb_shape_tree.capacities. Allow to access slot size.
27
- // Always 0 except for T_OBJECT.
28
- // 22 SHAPE_ID_FL_FROZEN
29
- // Whether the object is frozen or not.
30
- // 23 SHAPE_ID_FL_HAS_OBJECT_ID
31
- // Whether the object has an `SHAPE_OBJ_ID` transition.
32
- // 24 SHAPE_ID_FL_TOO_COMPLEX
33
- // The object is backed by a `st_table`.
34
-
35
- enum shape_id_fl_type {
36
- #define RBIMPL_SHAPE_ID_FL(n) (1<<(SHAPE_ID_FL_USHIFT+n))
37
-
38
- SHAPE_ID_HEAP_INDEX_MASK = RBIMPL_SHAPE_ID_FL(0) | RBIMPL_SHAPE_ID_FL(1) | RBIMPL_SHAPE_ID_FL(2),
39
-
40
- SHAPE_ID_FL_FROZEN = RBIMPL_SHAPE_ID_FL(3),
41
- SHAPE_ID_FL_HAS_OBJECT_ID = RBIMPL_SHAPE_ID_FL(4),
42
- SHAPE_ID_FL_TOO_COMPLEX = RBIMPL_SHAPE_ID_FL(5),
43
-
44
- SHAPE_ID_FL_NON_CANONICAL_MASK = SHAPE_ID_FL_FROZEN | SHAPE_ID_FL_HAS_OBJECT_ID,
45
- SHAPE_ID_FLAGS_MASK = SHAPE_ID_HEAP_INDEX_MASK | SHAPE_ID_FL_NON_CANONICAL_MASK | SHAPE_ID_FL_TOO_COMPLEX,
46
-
47
- #undef RBIMPL_SHAPE_ID_FL
48
- };
49
-
50
- // This mask allows to check if a shape_id contains any ivar.
51
- // It relies on ROOT_SHAPE_WITH_OBJ_ID==1.
52
- enum shape_id_mask {
53
- SHAPE_ID_HAS_IVAR_MASK = SHAPE_ID_FL_TOO_COMPLEX | (SHAPE_ID_OFFSET_MASK - 1),
54
- };
55
-
56
- // The interpreter doesn't care about frozen status or slot size when reading ivars.
57
- // So we normalize shape_id by clearing these bits to improve cache hits.
58
- // JITs however might care about it.
59
- #define SHAPE_ID_READ_ONLY_MASK (~(SHAPE_ID_FL_FROZEN | SHAPE_ID_HEAP_INDEX_MASK))
60
-
61
- typedef uint32_t redblack_id_t;
62
-
63
- #define SHAPE_MAX_FIELDS (attr_index_t)(-1)
64
- #define SHAPE_FLAG_SHIFT ((SIZEOF_VALUE * CHAR_BIT) - SHAPE_ID_NUM_BITS)
65
- #define SHAPE_FLAG_MASK (((VALUE)-1) >> SHAPE_ID_NUM_BITS)
66
-
67
- #define SHAPE_MAX_VARIATIONS 8
68
-
69
- #define INVALID_SHAPE_ID ((shape_id_t)-1)
70
- #define ATTR_INDEX_NOT_SET ((attr_index_t)-1)
71
-
72
- #define ROOT_SHAPE_ID 0x0
73
- #define ROOT_SHAPE_WITH_OBJ_ID 0x1
74
- #define ROOT_TOO_COMPLEX_SHAPE_ID (ROOT_SHAPE_ID | SHAPE_ID_FL_TOO_COMPLEX)
75
- #define ROOT_TOO_COMPLEX_WITH_OBJ_ID (ROOT_SHAPE_WITH_OBJ_ID | SHAPE_ID_FL_TOO_COMPLEX | SHAPE_ID_FL_HAS_OBJECT_ID)
76
-
77
- typedef struct redblack_node redblack_node_t;
78
-
79
- struct rb_shape {
80
- VALUE edges; // id_table from ID (ivar) to next shape
81
- ID edge_name; // ID (ivar) for transition from parent to rb_shape
82
- redblack_node_t *ancestor_index;
83
- shape_id_t parent_id;
84
- attr_index_t next_field_index; // Fields are either ivars or internal properties like `object_id`
85
- attr_index_t capacity; // Total capacity of the object with this shape
86
- uint8_t type;
87
- };
88
-
89
- typedef struct rb_shape rb_shape_t;
90
-
91
- struct redblack_node {
92
- ID key;
93
- rb_shape_t *value;
94
- redblack_id_t l;
95
- redblack_id_t r;
96
- };
97
-
98
- enum shape_type {
99
- SHAPE_ROOT,
100
- SHAPE_IVAR,
101
- SHAPE_OBJ_ID,
102
- };
103
-
104
- enum shape_flags {
105
- SHAPE_FL_FROZEN = 1 << 0,
106
- SHAPE_FL_HAS_OBJECT_ID = 1 << 1,
107
- SHAPE_FL_TOO_COMPLEX = 1 << 2,
108
-
109
- SHAPE_FL_NON_CANONICAL_MASK = SHAPE_FL_FROZEN | SHAPE_FL_HAS_OBJECT_ID,
110
- };
111
-
112
- typedef struct {
113
- /* object shapes */
114
- rb_shape_t *shape_list;
115
- rb_shape_t *root_shape;
116
- const attr_index_t *capacities;
117
- rb_atomic_t next_shape_id;
118
-
119
- redblack_node_t *shape_cache;
120
- unsigned int cache_size;
121
- } rb_shape_tree_t;
122
-
123
- RUBY_SYMBOL_EXPORT_BEGIN
124
- RUBY_EXTERN rb_shape_tree_t rb_shape_tree;
125
- RUBY_SYMBOL_EXPORT_END
126
-
127
- static inline shape_id_t
128
- rb_shapes_count(void)
129
- {
130
- return (shape_id_t)RUBY_ATOMIC_LOAD(rb_shape_tree.next_shape_id);
131
- }
132
-
133
- union rb_attr_index_cache {
134
- uint64_t pack;
135
- struct {
136
- shape_id_t shape_id;
137
- attr_index_t index;
138
- } unpack;
139
- };
140
-
141
- static inline shape_id_t
142
- RBASIC_SHAPE_ID(VALUE obj)
143
- {
144
- RUBY_ASSERT(!RB_SPECIAL_CONST_P(obj));
145
- RUBY_ASSERT(!RB_TYPE_P(obj, T_IMEMO) || IMEMO_TYPE_P(obj, imemo_fields));
146
- #if RBASIC_SHAPE_ID_FIELD
147
- return (shape_id_t)((RBASIC(obj)->shape_id));
148
- #else
149
- return (shape_id_t)((RBASIC(obj)->flags) >> SHAPE_FLAG_SHIFT);
150
- #endif
151
- }
152
-
153
- // Same as RBASIC_SHAPE_ID but with flags that have no impact
154
- // on reads removed. e.g. Remove FL_FROZEN.
155
- static inline shape_id_t
156
- RBASIC_SHAPE_ID_FOR_READ(VALUE obj)
157
- {
158
- return RBASIC_SHAPE_ID(obj) & SHAPE_ID_READ_ONLY_MASK;
159
- }
160
-
161
- #if RUBY_DEBUG
162
- bool rb_shape_verify_consistency(VALUE obj, shape_id_t shape_id);
163
- #endif
164
-
165
- static inline void
166
- RBASIC_SET_SHAPE_ID(VALUE obj, shape_id_t shape_id)
167
- {
168
- RUBY_ASSERT(!RB_SPECIAL_CONST_P(obj));
169
- RUBY_ASSERT(!RB_TYPE_P(obj, T_IMEMO) || IMEMO_TYPE_P(obj, imemo_fields));
170
- #if RBASIC_SHAPE_ID_FIELD
171
- RBASIC(obj)->shape_id = (VALUE)shape_id;
172
- #else
173
- // Object shapes are occupying top bits
174
- RBASIC(obj)->flags &= SHAPE_FLAG_MASK;
175
- RBASIC(obj)->flags |= ((VALUE)(shape_id) << SHAPE_FLAG_SHIFT);
176
- #endif
177
- RUBY_ASSERT(rb_shape_verify_consistency(obj, shape_id));
178
- }
179
-
180
- void rb_set_namespaced_class_shape_id(VALUE obj, shape_id_t shape_id);
181
-
182
- static inline void
183
- RB_SET_SHAPE_ID(VALUE obj, shape_id_t shape_id)
184
- {
185
- switch (BUILTIN_TYPE(obj)) {
186
- case T_CLASS:
187
- case T_MODULE:
188
- rb_set_namespaced_class_shape_id(obj, shape_id);
189
- break;
190
- default:
191
- RBASIC_SET_SHAPE_ID(obj, shape_id);
192
- break;
193
- }
194
- }
195
-
196
- static inline rb_shape_t *
197
- RSHAPE(shape_id_t shape_id)
198
- {
199
- uint32_t offset = (shape_id & SHAPE_ID_OFFSET_MASK);
200
- RUBY_ASSERT(offset != INVALID_SHAPE_ID);
201
-
202
- return &rb_shape_tree.shape_list[offset];
203
- }
204
-
205
- int32_t rb_shape_id_offset(void);
206
-
207
- RUBY_FUNC_EXPORTED shape_id_t rb_obj_shape_id(VALUE obj);
208
- shape_id_t rb_shape_get_next_iv_shape(shape_id_t shape_id, ID id);
209
- bool rb_shape_get_iv_index(shape_id_t shape_id, ID id, attr_index_t *value);
210
- bool rb_shape_get_iv_index_with_hint(shape_id_t shape_id, ID id, attr_index_t *value, shape_id_t *shape_id_hint);
211
- bool rb_shape_find_ivar(shape_id_t shape_id, ID id, shape_id_t *ivar_shape);
212
-
213
- typedef int rb_shape_foreach_transition_callback(shape_id_t shape_id, void *data);
214
- bool rb_shape_foreach_field(shape_id_t shape_id, rb_shape_foreach_transition_callback func, void *data);
215
-
216
- shape_id_t rb_shape_transition_frozen(VALUE obj);
217
- shape_id_t rb_shape_transition_complex(VALUE obj);
218
- shape_id_t rb_shape_transition_remove_ivar(VALUE obj, ID id, shape_id_t *removed_shape_id);
219
- shape_id_t rb_shape_transition_add_ivar(VALUE obj, ID id);
220
- shape_id_t rb_shape_transition_add_ivar_no_warnings(VALUE obj, ID id);
221
- shape_id_t rb_shape_transition_object_id(VALUE obj);
222
- shape_id_t rb_shape_transition_heap(VALUE obj, size_t heap_index);
223
- shape_id_t rb_shape_object_id(shape_id_t original_shape_id);
224
-
225
- void rb_shape_free_all(void);
226
-
227
- shape_id_t rb_shape_rebuild(shape_id_t initial_shape_id, shape_id_t dest_shape_id);
228
- void rb_shape_copy_fields(VALUE dest, VALUE *dest_buf, shape_id_t dest_shape_id, VALUE *src_buf, shape_id_t src_shape_id);
229
- void rb_shape_copy_complex_ivars(VALUE dest, VALUE obj, shape_id_t src_shape_id, st_table *fields_table);
230
-
231
- static inline bool
232
- rb_shape_too_complex_p(shape_id_t shape_id)
233
- {
234
- return shape_id & SHAPE_ID_FL_TOO_COMPLEX;
235
- }
236
-
237
- static inline bool
238
- rb_shape_obj_too_complex_p(VALUE obj)
239
- {
240
- return !RB_SPECIAL_CONST_P(obj) && rb_shape_too_complex_p(RBASIC_SHAPE_ID(obj));
241
- }
242
-
243
- static inline bool
244
- rb_shape_has_object_id(shape_id_t shape_id)
245
- {
246
- return shape_id & SHAPE_ID_FL_HAS_OBJECT_ID;
247
- }
248
-
249
- static inline bool
250
- rb_shape_canonical_p(shape_id_t shape_id)
251
- {
252
- return !(shape_id & SHAPE_ID_FL_NON_CANONICAL_MASK);
253
- }
254
-
255
- static inline uint8_t
256
- rb_shape_heap_index(shape_id_t shape_id)
257
- {
258
- return (uint8_t)((shape_id & SHAPE_ID_HEAP_INDEX_MASK) >> SHAPE_ID_HEAP_INDEX_OFFSET);
259
- }
260
-
261
- static inline shape_id_t
262
- rb_shape_root(size_t heap_id)
263
- {
264
- shape_id_t heap_index = (shape_id_t)(heap_id + 1);
265
- shape_id_t heap_flags = heap_index << SHAPE_ID_HEAP_INDEX_OFFSET;
266
-
267
- RUBY_ASSERT((heap_flags & SHAPE_ID_HEAP_INDEX_MASK) == heap_flags);
268
- RUBY_ASSERT(rb_shape_heap_index(heap_flags) == heap_index);
269
-
270
- return ROOT_SHAPE_ID | heap_flags;
271
- }
272
-
273
- static inline shape_id_t
274
- RSHAPE_PARENT_RAW_ID(shape_id_t shape_id)
275
- {
276
- return RSHAPE(shape_id)->parent_id;
277
- }
278
-
279
- static inline bool
280
- RSHAPE_DIRECT_CHILD_P(shape_id_t parent_id, shape_id_t child_id)
281
- {
282
- return (parent_id & SHAPE_ID_FLAGS_MASK) == (child_id & SHAPE_ID_FLAGS_MASK) &&
283
- RSHAPE(child_id)->parent_id == (parent_id & SHAPE_ID_OFFSET_MASK);
284
- }
285
-
286
- static inline enum shape_type
287
- RSHAPE_TYPE(shape_id_t shape_id)
288
- {
289
- return RSHAPE(shape_id)->type;
290
- }
291
-
292
- static inline bool
293
- RSHAPE_TYPE_P(shape_id_t shape_id, enum shape_type type)
294
- {
295
- return RSHAPE_TYPE(shape_id) == type;
296
- }
297
-
298
- static inline attr_index_t
299
- RSHAPE_EMBEDDED_CAPACITY(shape_id_t shape_id)
300
- {
301
- uint8_t heap_index = rb_shape_heap_index(shape_id);
302
- if (heap_index) {
303
- return rb_shape_tree.capacities[heap_index - 1];
304
- }
305
- return 0;
306
- }
307
-
308
- static inline attr_index_t
309
- RSHAPE_CAPACITY(shape_id_t shape_id)
310
- {
311
- attr_index_t embedded_capacity = RSHAPE_EMBEDDED_CAPACITY(shape_id);
312
-
313
- if (embedded_capacity > RSHAPE(shape_id)->capacity) {
314
- return embedded_capacity;
315
- }
316
- else {
317
- return RSHAPE(shape_id)->capacity;
318
- }
319
- }
320
-
321
- static inline attr_index_t
322
- RSHAPE_LEN(shape_id_t shape_id)
323
- {
324
- return RSHAPE(shape_id)->next_field_index;
325
- }
326
-
327
- static inline attr_index_t
328
- RSHAPE_INDEX(shape_id_t shape_id)
329
- {
330
- RUBY_ASSERT(RSHAPE_LEN(shape_id) > 0);
331
- return RSHAPE_LEN(shape_id) - 1;
332
- }
333
-
334
- static inline ID
335
- RSHAPE_EDGE_NAME(shape_id_t shape_id)
336
- {
337
- return RSHAPE(shape_id)->edge_name;
338
- }
339
-
340
- static inline uint32_t
341
- ROBJECT_FIELDS_CAPACITY(VALUE obj)
342
- {
343
- RBIMPL_ASSERT_TYPE(obj, RUBY_T_OBJECT);
344
- // Asking for capacity doesn't make sense when the object is using
345
- // a hash table for storing instance variables
346
- RUBY_ASSERT(!rb_shape_obj_too_complex_p(obj));
347
- return RSHAPE_CAPACITY(RBASIC_SHAPE_ID(obj));
348
- }
349
-
350
- static inline st_table *
351
- ROBJECT_FIELDS_HASH(VALUE obj)
352
- {
353
- RBIMPL_ASSERT_TYPE(obj, RUBY_T_OBJECT);
354
- RUBY_ASSERT(rb_shape_obj_too_complex_p(obj));
355
- RUBY_ASSERT(FL_TEST_RAW(obj, ROBJECT_HEAP));
356
-
357
- return (st_table *)ROBJECT(obj)->as.heap.fields;
358
- }
359
-
360
- static inline void
361
- ROBJECT_SET_FIELDS_HASH(VALUE obj, const st_table *tbl)
362
- {
363
- RBIMPL_ASSERT_TYPE(obj, RUBY_T_OBJECT);
364
- RUBY_ASSERT(rb_shape_obj_too_complex_p(obj));
365
- RUBY_ASSERT(FL_TEST_RAW(obj, ROBJECT_HEAP));
366
-
367
- ROBJECT(obj)->as.heap.fields = (VALUE *)tbl;
368
- }
369
-
370
- static inline uint32_t
371
- ROBJECT_FIELDS_COUNT(VALUE obj)
372
- {
373
- if (rb_shape_obj_too_complex_p(obj)) {
374
- return (uint32_t)rb_st_table_size(ROBJECT_FIELDS_HASH(obj));
375
- }
376
- else {
377
- RBIMPL_ASSERT_TYPE(obj, RUBY_T_OBJECT);
378
- RUBY_ASSERT(!rb_shape_obj_too_complex_p(obj));
379
- return RSHAPE(RBASIC_SHAPE_ID(obj))->next_field_index;
380
- }
381
- }
382
-
383
- static inline uint32_t
384
- RBASIC_FIELDS_COUNT(VALUE obj)
385
- {
386
- return RSHAPE(rb_obj_shape_id(obj))->next_field_index;
387
- }
388
-
389
- static inline bool
390
- rb_shape_obj_has_id(VALUE obj)
391
- {
392
- return rb_shape_has_object_id(RBASIC_SHAPE_ID(obj));
393
- }
394
-
395
- static inline bool
396
- rb_shape_has_ivars(shape_id_t shape_id)
397
- {
398
- return shape_id & SHAPE_ID_HAS_IVAR_MASK;
399
- }
400
-
401
- static inline bool
402
- rb_shape_obj_has_ivars(VALUE obj)
403
- {
404
- return rb_shape_has_ivars(RBASIC_SHAPE_ID(obj));
405
- }
406
-
407
- static inline bool
408
- rb_shape_has_fields(shape_id_t shape_id)
409
- {
410
- return shape_id & (SHAPE_ID_OFFSET_MASK | SHAPE_ID_FL_TOO_COMPLEX);
411
- }
412
-
413
- static inline bool
414
- rb_shape_obj_has_fields(VALUE obj)
415
- {
416
- return rb_shape_has_fields(RBASIC_SHAPE_ID(obj));
417
- }
418
-
419
- static inline bool
420
- rb_obj_exivar_p(VALUE obj)
421
- {
422
- switch (TYPE(obj)) {
423
- case T_NONE:
424
- case T_OBJECT:
425
- case T_CLASS:
426
- case T_MODULE:
427
- case T_IMEMO:
428
- return false;
429
- default:
430
- break;
431
- }
432
- return rb_shape_obj_has_fields(obj);
433
- }
434
-
435
- // For ext/objspace
436
- RUBY_SYMBOL_EXPORT_BEGIN
437
- typedef void each_shape_callback(shape_id_t shape_id, void *data);
438
- void rb_shape_each_shape_id(each_shape_callback callback, void *data);
439
- size_t rb_shape_memsize(shape_id_t shape);
440
- size_t rb_shape_edges_count(shape_id_t shape_id);
441
- size_t rb_shape_depth(shape_id_t shape_id);
442
- RUBY_SYMBOL_EXPORT_END
443
-
444
- #endif