mirror of
https://github.com/ruby/ruby.git
synced 2022-11-09 12:17:21 -05:00
b91b3bc771
Redo of34a2acdac7
and931138b006
which were reverted. GitHub PR #4340. This change implements a cache for class variables. Previously there was no cache for cvars. Cvar access is slow due to needing to travel all the way up th ancestor tree before returning the cvar value. The deeper the ancestor tree the slower cvar access will be. The benefits of the cache are more visible with a higher number of included modules due to the way Ruby looks up class variables. The benchmark here includes 26 modules and shows with the cache, this branch is 6.5x faster when accessing class variables. ``` compare-ruby: ruby 3.1.0dev (2021-03-15T06:22:34Z master9e5105c
) [x86_64-darwin19] built-ruby: ruby 3.1.0dev (2021-03-15T12:12:44Z add-cache-for-clas.. c6be009) [x86_64-darwin19] | |compare-ruby|built-ruby| |:--------|-----------:|---------:| |vm_cvar | 5.681M| 36.980M| | | -| 6.51x| ``` Benchmark.ips calling `ActiveRecord::Base.logger` from within a Rails application. ActiveRecord::Base.logger has 71 ancestors. The more ancestors a tree has, the more clear the speed increase. IE if Base had only one ancestor we'd see no improvement. This benchmark is run on a vanilla Rails application. Benchmark code: ```ruby require "benchmark/ips" require_relative "config/environment" Benchmark.ips do |x| x.report "logger" do ActiveRecord::Base.logger end end ``` Ruby 3.0 master / Rails 6.1: ``` Warming up -------------------------------------- logger 155.251k i/100ms Calculating ------------------------------------- ``` Ruby 3.0 with cvar cache / Rails 6.1: ``` Warming up -------------------------------------- logger 1.546M i/100ms Calculating ------------------------------------- logger 14.857M (± 4.8%) i/s - 74.198M in 5.006202s ``` Lastly we ran a benchmark to demonstate the difference between master and our cache when the number of modules increases. This benchmark measures 1 ancestor, 30 ancestors, and 100 ancestors. Ruby 3.0 master: ``` Warming up -------------------------------------- 1 module 1.231M i/100ms 30 modules 432.020k i/100ms 100 modules 145.399k i/100ms Calculating ------------------------------------- 1 module 12.210M (± 2.1%) i/s - 61.553M in 5.043400s 30 modules 4.354M (± 2.7%) i/s - 22.033M in 5.063839s 100 modules 1.434M (± 2.9%) i/s - 7.270M in 5.072531s Comparison: 1 module: 12209958.3 i/s 30 modules: 4354217.8 i/s - 2.80x (± 0.00) slower 100 modules: 1434447.3 i/s - 8.51x (± 0.00) slower ``` Ruby 3.0 with cvar cache: ``` Warming up -------------------------------------- 1 module 1.641M i/100ms 30 modules 1.655M i/100ms 100 modules 1.620M i/100ms Calculating ------------------------------------- 1 module 16.279M (± 3.8%) i/s - 82.038M in 5.046923s 30 modules 15.891M (± 3.9%) i/s - 79.459M in 5.007958s 100 modules 16.087M (± 3.6%) i/s - 81.005M in 5.041931s Comparison: 1 module: 16279458.0 i/s 100 modules: 16087484.6 i/s - same-ish: difference falls within error 30 modules: 15891406.2 i/s - same-ish: difference falls within error ``` Co-authored-by: Aaron Patterson <tenderlove@ruby-lang.org>
186 lines
6.2 KiB
C
186 lines
6.2 KiB
C
#ifndef INTERNAL_CLASS_H /*-*-C-*-vi:se ft=c:*/
|
|
#define INTERNAL_CLASS_H
|
|
/**
|
|
* @file
|
|
* @author Ruby developers <ruby-core@ruby-lang.org>
|
|
* @copyright This file is a part of the programming language Ruby.
|
|
* Permission is hereby granted, to either redistribute and/or
|
|
* modify this file, provided that the conditions mentioned in the
|
|
* file COPYING are met. Consult the file for details.
|
|
* @brief Internal header for Class.
|
|
*/
|
|
#include "id_table.h" /* for struct rb_id_table */
|
|
#include "internal/gc.h" /* for RB_OBJ_WRITE */
|
|
#include "internal/serial.h" /* for rb_serial_t */
|
|
#include "ruby/internal/stdbool.h" /* for bool */
|
|
#include "ruby/intern.h" /* for rb_alloc_func_t */
|
|
#include "ruby/ruby.h" /* for struct RBasic */
|
|
|
|
#ifdef RCLASS_SUPER
|
|
# undef RCLASS_SUPER
|
|
#endif
|
|
|
|
struct rb_subclass_entry {
|
|
VALUE klass;
|
|
struct rb_subclass_entry *next;
|
|
};
|
|
|
|
struct rb_iv_index_tbl_entry {
|
|
uint32_t index;
|
|
rb_serial_t class_serial;
|
|
VALUE class_value;
|
|
};
|
|
|
|
struct rb_cvar_class_tbl_entry {
|
|
uint32_t index;
|
|
rb_serial_t global_cvar_state;
|
|
VALUE class_value;
|
|
};
|
|
|
|
struct rb_classext_struct {
|
|
struct st_table *iv_index_tbl; // ID -> struct rb_iv_index_tbl_entry
|
|
struct st_table *iv_tbl;
|
|
#if SIZEOF_SERIAL_T == SIZEOF_VALUE /* otherwise m_tbl is in struct RClass */
|
|
struct rb_id_table *m_tbl;
|
|
#endif
|
|
struct rb_id_table *const_tbl;
|
|
struct rb_id_table *callable_m_tbl;
|
|
struct rb_id_table *cc_tbl; /* ID -> [[ci, cc1], cc2, ...] */
|
|
struct rb_id_table *cvc_tbl;
|
|
struct rb_subclass_entry *subclasses;
|
|
struct rb_subclass_entry **parent_subclasses;
|
|
/**
|
|
* In the case that this is an `ICLASS`, `module_subclasses` points to the link
|
|
* in the module's `subclasses` list that indicates that the klass has been
|
|
* included. Hopefully that makes sense.
|
|
*/
|
|
struct rb_subclass_entry **module_subclasses;
|
|
#if SIZEOF_SERIAL_T != SIZEOF_VALUE /* otherwise class_serial is in struct RClass */
|
|
rb_serial_t class_serial;
|
|
#endif
|
|
const VALUE origin_;
|
|
const VALUE refined_class;
|
|
rb_alloc_func_t allocator;
|
|
const VALUE includer;
|
|
};
|
|
|
|
struct RClass {
|
|
struct RBasic basic;
|
|
VALUE super;
|
|
struct rb_classext_struct *ptr;
|
|
#if SIZEOF_SERIAL_T == SIZEOF_VALUE
|
|
/* Class serial is as wide as VALUE. Place it here. */
|
|
rb_serial_t class_serial;
|
|
#else
|
|
/* Class serial does not fit into struct RClass. Place m_tbl instead. */
|
|
struct rb_id_table *m_tbl;
|
|
#endif
|
|
};
|
|
|
|
typedef struct rb_subclass_entry rb_subclass_entry_t;
|
|
typedef struct rb_classext_struct rb_classext_t;
|
|
|
|
#define RCLASS_EXT(c) (RCLASS(c)->ptr)
|
|
#define RCLASS_IV_TBL(c) (RCLASS_EXT(c)->iv_tbl)
|
|
#define RCLASS_CONST_TBL(c) (RCLASS_EXT(c)->const_tbl)
|
|
#if SIZEOF_SERIAL_T == SIZEOF_VALUE
|
|
# define RCLASS_M_TBL(c) (RCLASS_EXT(c)->m_tbl)
|
|
#else
|
|
# define RCLASS_M_TBL(c) (RCLASS(c)->m_tbl)
|
|
#endif
|
|
#define RCLASS_CALLABLE_M_TBL(c) (RCLASS_EXT(c)->callable_m_tbl)
|
|
#define RCLASS_CC_TBL(c) (RCLASS_EXT(c)->cc_tbl)
|
|
#define RCLASS_CVC_TBL(c) (RCLASS_EXT(c)->cvc_tbl)
|
|
#define RCLASS_IV_INDEX_TBL(c) (RCLASS_EXT(c)->iv_index_tbl)
|
|
#define RCLASS_ORIGIN(c) (RCLASS_EXT(c)->origin_)
|
|
#define RCLASS_REFINED_CLASS(c) (RCLASS_EXT(c)->refined_class)
|
|
#if SIZEOF_SERIAL_T == SIZEOF_VALUE
|
|
# define RCLASS_SERIAL(c) (RCLASS(c)->class_serial)
|
|
#else
|
|
# define RCLASS_SERIAL(c) (RCLASS_EXT(c)->class_serial)
|
|
#endif
|
|
#define RCLASS_INCLUDER(c) (RCLASS_EXT(c)->includer)
|
|
#define RCLASS_PARENT_SUBCLASSES(c) (RCLASS_EXT(c)->parent_subclasses)
|
|
#define RCLASS_MODULE_SUBCLASSES(c) (RCLASS_EXT(c)->module_subclasses)
|
|
#define RCLASS_ALLOCATOR(c) (RCLASS_EXT(c)->allocator)
|
|
#define RCLASS_SUBCLASSES(c) (RCLASS_EXT(c)->subclasses)
|
|
|
|
#define RICLASS_IS_ORIGIN FL_USER5
|
|
#define RCLASS_CLONED FL_USER6
|
|
#define RICLASS_ORIGIN_SHARED_MTBL FL_USER8
|
|
|
|
/* class.c */
|
|
void rb_class_subclass_add(VALUE super, VALUE klass);
|
|
void rb_class_remove_from_super_subclasses(VALUE);
|
|
int rb_singleton_class_internal_p(VALUE sklass);
|
|
VALUE rb_class_boot(VALUE);
|
|
VALUE rb_make_metaclass(VALUE, VALUE);
|
|
VALUE rb_include_class_new(VALUE, VALUE);
|
|
void rb_class_foreach_subclass(VALUE klass, void (*f)(VALUE, VALUE), VALUE);
|
|
void rb_class_detach_subclasses(VALUE);
|
|
void rb_class_detach_module_subclasses(VALUE);
|
|
void rb_class_remove_from_module_subclasses(VALUE);
|
|
VALUE rb_obj_methods(int argc, const VALUE *argv, VALUE obj);
|
|
VALUE rb_obj_protected_methods(int argc, const VALUE *argv, VALUE obj);
|
|
VALUE rb_obj_private_methods(int argc, const VALUE *argv, VALUE obj);
|
|
VALUE rb_obj_public_methods(int argc, const VALUE *argv, VALUE obj);
|
|
VALUE rb_special_singleton_class(VALUE);
|
|
VALUE rb_singleton_class_clone_and_attach(VALUE obj, VALUE attach);
|
|
VALUE rb_singleton_class_get(VALUE obj);
|
|
int rb_class_has_methods(VALUE c);
|
|
void rb_undef_methods_from(VALUE klass, VALUE super);
|
|
|
|
static inline void RCLASS_SET_ORIGIN(VALUE klass, VALUE origin);
|
|
static inline void RICLASS_SET_ORIGIN_SHARED_MTBL(VALUE iclass);
|
|
static inline VALUE RCLASS_SUPER(VALUE klass);
|
|
static inline VALUE RCLASS_SET_SUPER(VALUE klass, VALUE super);
|
|
static inline void RCLASS_SET_INCLUDER(VALUE iclass, VALUE klass);
|
|
|
|
MJIT_SYMBOL_EXPORT_BEGIN
|
|
VALUE rb_class_inherited(VALUE, VALUE);
|
|
VALUE rb_keyword_error_new(const char *, VALUE);
|
|
MJIT_SYMBOL_EXPORT_END
|
|
|
|
static inline void
|
|
RCLASS_SET_ORIGIN(VALUE klass, VALUE origin)
|
|
{
|
|
RB_OBJ_WRITE(klass, &RCLASS_ORIGIN(klass), origin);
|
|
if (klass != origin) FL_SET(origin, RICLASS_IS_ORIGIN);
|
|
}
|
|
|
|
static inline void
|
|
RICLASS_SET_ORIGIN_SHARED_MTBL(VALUE iclass)
|
|
{
|
|
FL_SET(iclass, RICLASS_ORIGIN_SHARED_MTBL);
|
|
}
|
|
|
|
static inline bool
|
|
RICLASS_OWNS_M_TBL_P(VALUE iclass)
|
|
{
|
|
return FL_TEST_RAW(iclass, RICLASS_IS_ORIGIN | RICLASS_ORIGIN_SHARED_MTBL) == RICLASS_IS_ORIGIN;
|
|
}
|
|
|
|
static inline void
|
|
RCLASS_SET_INCLUDER(VALUE iclass, VALUE klass)
|
|
{
|
|
RB_OBJ_WRITE(iclass, &RCLASS_INCLUDER(iclass), klass);
|
|
}
|
|
|
|
static inline VALUE
|
|
RCLASS_SUPER(VALUE klass)
|
|
{
|
|
return RCLASS(klass)->super;
|
|
}
|
|
|
|
static inline VALUE
|
|
RCLASS_SET_SUPER(VALUE klass, VALUE super)
|
|
{
|
|
if (super) {
|
|
rb_class_remove_from_super_subclasses(klass);
|
|
rb_class_subclass_add(super, klass);
|
|
}
|
|
RB_OBJ_WRITE(klass, &RCLASS(klass)->super, super);
|
|
return super;
|
|
}
|
|
|
|
#endif /* INTERNAL_CLASS_H */
|