ruby--ruby/benchmark/vm_ivar_embedded_obj_init.yml

prelude: |
  class C
    def initialize
      @a = nil
      @b = nil
      @c = nil
    end
  end
benchmark:
  vm_ivar_embedded_obj_init: |
    C.new
loop_count: 30000000
eagerly initialize ivar table when index is small enough When the inline cache is written, the iv table will contain an entry for the instance variable. If we get an inline cache hit, then we know the iv table must contain a value for the index written to the inline cache. If the index in the inline cache is larger than the list on the object, but smaller than the iv index table on the class, then we can just eagerly allocate the iv list to be the same size as the iv index table. This avoids duplicate work of checking frozen as well as looking up the index for the particular instance variable name. 2020-11-06 13:11:20 -05:00			`prelude: \|`
			`class C`
			`def initialize`
			`@a = nil`
			`@b = nil`
			`@c = nil`
			`end`
			`end`
			`benchmark:`
Added vm_ivar benchmark for initializing an embedded obj 2022-06-16 11:01:22 -04:00			`vm_ivar_embedded_obj_init: \|`
eagerly initialize ivar table when index is small enough When the inline cache is written, the iv table will contain an entry for the instance variable. If we get an inline cache hit, then we know the iv table must contain a value for the index written to the inline cache. If the index in the inline cache is larger than the list on the object, but smaller than the iv index table on the class, then we can just eagerly allocate the iv list to be the same size as the iv index table. This avoids duplicate work of checking frozen as well as looking up the index for the particular instance variable name. 2020-11-06 13:11:20 -05:00			`C.new`
			`loop_count: 30000000`