mirror of
https://github.com/ruby/ruby.git
synced 2022-11-09 12:17:21 -05:00
d594a5a8bd
Object Shapes is used for accessing instance variables and representing the
"frozenness" of objects. Object instances have a "shape" and the shape
represents some attributes of the object (currently which instance variables are
set and the "frozenness"). Shapes form a tree data structure, and when a new
instance variable is set on an object, that object "transitions" to a new shape
in the shape tree. Each shape has an ID that is used for caching. The shape
structure is independent of class, so objects of different types can have the
same shape.
For example:
```ruby
class Foo
def initialize
# Starts with shape id 0
@a = 1 # transitions to shape id 1
@b = 1 # transitions to shape id 2
end
end
class Bar
def initialize
# Starts with shape id 0
@a = 1 # transitions to shape id 1
@b = 1 # transitions to shape id 2
end
end
foo = Foo.new # `foo` has shape id 2
bar = Bar.new # `bar` has shape id 2
```
Both `foo` and `bar` instances have the same shape because they both set
instance variables of the same name in the same order.
This technique can help to improve inline cache hits as well as generate more
efficient machine code in JIT compilers.
This commit also adds some methods for debugging shapes on objects. See
`RubyVM::Shape` for more details.
For more context on Object Shapes, see [Feature: #18776]
Co-Authored-By: Aaron Patterson <tenderlove@ruby-lang.org>
Co-Authored-By: Eileen M. Uchitelle <eileencodes@gmail.com>
Co-Authored-By: John Hawthorn <john@hawthorn.email>
113 lines
2.1 KiB
C
113 lines
2.1 KiB
C
/**********************************************************************
|
|
|
|
inits.c -
|
|
|
|
$Author$
|
|
created at: Tue Dec 28 16:01:58 JST 1993
|
|
|
|
Copyright (C) 1993-2007 Yukihiro Matsumoto
|
|
|
|
**********************************************************************/
|
|
|
|
#include "internal/inits.h"
|
|
#include "ruby.h"
|
|
#include "builtin.h"
|
|
static void Init_builtin_prelude(void);
|
|
#include "prelude.rbinc"
|
|
|
|
#define CALL(n) {void Init_##n(void); Init_##n();}
|
|
|
|
void
|
|
rb_call_inits(void)
|
|
{
|
|
CALL(Thread_Mutex);
|
|
#if USE_TRANSIENT_HEAP
|
|
CALL(TransientHeap);
|
|
#endif
|
|
CALL(vm_postponed_job);
|
|
CALL(Method);
|
|
CALL(RandomSeedCore);
|
|
CALL(encodings);
|
|
CALL(sym);
|
|
CALL(var_tables);
|
|
CALL(Object);
|
|
CALL(top_self);
|
|
CALL(Encoding);
|
|
CALL(Comparable);
|
|
CALL(Enumerable);
|
|
CALL(String);
|
|
CALL(Exception);
|
|
CALL(eval);
|
|
CALL(jump);
|
|
CALL(Numeric);
|
|
CALL(Bignum);
|
|
CALL(syserr);
|
|
CALL(Array);
|
|
CALL(Hash);
|
|
CALL(Struct);
|
|
CALL(Regexp);
|
|
CALL(pack);
|
|
CALL(transcode);
|
|
CALL(marshal);
|
|
CALL(Range);
|
|
CALL(IO);
|
|
CALL(IO_Buffer)
|
|
CALL(Dir);
|
|
CALL(Time);
|
|
CALL(Random);
|
|
CALL(signal);
|
|
CALL(load);
|
|
CALL(Proc);
|
|
CALL(Binding);
|
|
CALL(Math);
|
|
CALL(GC);
|
|
CALL(Enumerator);
|
|
CALL(Ractor);
|
|
CALL(VM);
|
|
CALL(ISeq);
|
|
CALL(Thread);
|
|
CALL(Fiber_Scheduler);
|
|
CALL(process);
|
|
CALL(Cont);
|
|
CALL(Rational);
|
|
CALL(Complex);
|
|
CALL(MemoryView);
|
|
CALL(version);
|
|
CALL(vm_trace);
|
|
CALL(vm_stack_canary);
|
|
CALL(ast);
|
|
CALL(gc_stress);
|
|
CALL(shape);
|
|
|
|
// enable builtin loading
|
|
CALL(builtin);
|
|
}
|
|
|
|
void
|
|
rb_call_builtin_inits(void)
|
|
{
|
|
#define BUILTIN(n) CALL(builtin_##n)
|
|
BUILTIN(gc);
|
|
BUILTIN(ractor);
|
|
BUILTIN(numeric);
|
|
BUILTIN(io);
|
|
BUILTIN(dir);
|
|
BUILTIN(ast);
|
|
BUILTIN(trace_point);
|
|
BUILTIN(pack);
|
|
BUILTIN(warning);
|
|
BUILTIN(array);
|
|
BUILTIN(kernel);
|
|
BUILTIN(timev);
|
|
BUILTIN(thread_sync);
|
|
BUILTIN(yjit);
|
|
BUILTIN(nilclass);
|
|
BUILTIN(marshal);
|
|
#if USE_MJIT
|
|
BUILTIN(mjit);
|
|
BUILTIN(mjit_c);
|
|
BUILTIN(mjit_compiler);
|
|
#endif
|
|
Init_builtin_prelude();
|
|
}
|
|
#undef CALL
|