12#define RUBY_VM_INSNS_INFO 1
15#include "ruby/internal/config.h"
21#include "eval_intern.h"
24#include "internal/bits.h"
25#include "internal/class.h"
26#include "internal/compile.h"
27#include "internal/error.h"
28#include "internal/file.h"
29#include "internal/gc.h"
30#include "internal/hash.h"
31#include "internal/ruby_parser.h"
32#include "internal/sanitizers.h"
33#include "internal/symbol.h"
34#include "internal/thread.h"
35#include "internal/variable.h"
40#include "vm_callinfo.h"
45#include "insns_info.inc"
51#if VM_INSN_INFO_TABLE_IMPL == 2
52static struct succ_index_table *succ_index_table_create(
int max_pos,
int *data,
int size);
53static unsigned int *succ_index_table_invert(
int max_pos,
struct succ_index_table *sd,
int size);
54static int succ_index_lookup(
const struct succ_index_table *sd,
int x);
57#define hidden_obj_p(obj) (!SPECIAL_CONST_P(obj) && !RBASIC(obj)->klass)
60obj_resurrect(
VALUE obj)
62 if (hidden_obj_p(obj)) {
68 obj = rb_ary_resurrect(obj);
71 obj = rb_hash_resurrect(obj);
96 free_arena(compile_data->node.storage_head);
97 free_arena(compile_data->insn.storage_head);
98 if (compile_data->ivar_cache_table) {
99 rb_id_table_free(compile_data->ivar_cache_table);
101 ruby_xfree(compile_data);
106remove_from_constant_cache(
ID id,
IC ic)
110 st_data_t ic_data = (st_data_t)ic;
112 if (rb_id_table_lookup(vm->constant_cache,
id, &lookup_result)) {
114 st_delete(ics, &ic_data, NULL);
116 if (ics->num_entries == 0) {
117 rb_id_table_delete(vm->constant_cache,
id);
127iseq_clear_ic_references(
const rb_iseq_t *iseq)
133 if (!ISEQ_BODY(iseq)->is_entries) {
137 for (
unsigned int ic_idx = 0; ic_idx < ISEQ_BODY(iseq)->ic_size; ic_idx++) {
138 IC ic = &ISEQ_IS_IC_ENTRY(ISEQ_BODY(iseq), ic_idx);
146 if (segments == NULL)
149 for (
int i = 0; segments[i]; i++) {
151 if (
id == idNULL)
continue;
152 remove_from_constant_cache(
id, ic);
155 ruby_xfree((
void *)segments);
162 RUBY_FREE_ENTER(
"iseq");
164 if (iseq && ISEQ_BODY(iseq)) {
165 iseq_clear_ic_references(iseq);
167 rb_rjit_free_iseq(iseq);
169 rb_yjit_iseq_free(body->yjit_payload);
172 rb_yjit_live_iseq_count--;
175 ruby_xfree((
void *)body->iseq_encoded);
176 ruby_xfree((
void *)body->insns_info.body);
177 ruby_xfree((
void *)body->insns_info.positions);
178#if VM_INSN_INFO_TABLE_IMPL == 2
179 ruby_xfree(body->insns_info.succ_index_table);
181 if (LIKELY(body->local_table != rb_iseq_shared_exc_local_tbl))
182 ruby_xfree((
void *)body->local_table);
183 ruby_xfree((
void *)body->is_entries);
185 if (body->call_data) {
186 ruby_xfree(body->call_data);
188 ruby_xfree((
void *)body->catch_table);
189 ruby_xfree((
void *)body->
param.opt_table);
190 if (ISEQ_MBITS_BUFLEN(body->iseq_size) > 1 && body->mark_bits.list) {
191 ruby_xfree((
void *)body->mark_bits.list);
194 ruby_xfree(body->variable.original_iseq);
196 if (body->
param.keyword != NULL) {
197 if (body->
param.keyword->table != &body->local_table[body->
param.keyword->bits_start - body->
param.keyword->num])
198 ruby_xfree((
void *)body->
param.keyword->table);
199 ruby_xfree((
void *)body->
param.keyword->default_values);
200 ruby_xfree((
void *)body->
param.keyword);
202 compile_data_free(ISEQ_COMPILE_DATA(iseq));
203 if (body->outer_variables) rb_id_table_free(body->outer_variables);
207 if (iseq && ISEQ_EXECUTABLE_P(iseq) && iseq->aux.exec.local_hooks) {
208 rb_hook_list_free(iseq->aux.exec.local_hooks);
211 RUBY_FREE_LEAVE(
"iseq");
214typedef VALUE iseq_value_itr_t(
void *ctx,
VALUE obj);
217iseq_scan_bits(
unsigned int page, iseq_bits_t bits,
VALUE *code,
VALUE *original_iseq)
220 unsigned int page_offset = (page * ISEQ_MBITS_BITLENGTH);
223 offset = ntz_intptr(bits);
224 VALUE op = code[page_offset + offset];
225 rb_gc_mark_and_move(&code[page_offset + offset]);
226 VALUE newop = code[page_offset + offset];
227 if (original_iseq && newop != op) {
228 original_iseq[page_offset + offset] = newop;
235rb_iseq_mark_and_move_each_value(
const rb_iseq_t *iseq,
VALUE *original_iseq)
241 size = body->iseq_size;
242 code = body->iseq_encoded;
246 if (body->is_entries) {
248 is_entries += body->ivc_size;
251 for (
unsigned int i = 0; i < body->icvarc_size; i++, is_entries++) {
256 rb_gc_mark_and_move(&icvarc->entry->class_value);
261 for (
unsigned int i = 0; i < body->ise_size; i++, is_entries++) {
263 if (is->once.value) {
264 rb_gc_mark_and_move(&is->once.value);
269 for (
unsigned int i = 0; i < body->ic_size; i++, is_entries++) {
270 IC ic = (
IC)is_entries;
272 rb_gc_mark_and_move_ptr(&ic->entry);
278 if (body->mark_bits.list) {
279 if (ISEQ_MBITS_BUFLEN(size) == 1) {
280 iseq_scan_bits(0, body->mark_bits.single, code, original_iseq);
283 if (body->mark_bits.list) {
284 for (
unsigned int i = 0; i < ISEQ_MBITS_BUFLEN(size); i++) {
285 iseq_bits_t bits = body->mark_bits.list[i];
286 iseq_scan_bits(i, bits, code, original_iseq);
294cc_is_active(
const struct rb_callcache *cc,
bool reference_updating)
297 if (reference_updating) {
301 if (vm_cc_markable(cc)) {
304 if (reference_updating) {
307 if (!METHOD_ENTRY_INVALIDATED(cme)) {
317rb_iseq_mark_and_move(
rb_iseq_t *iseq,
bool reference_updating)
319 RUBY_MARK_ENTER(
"iseq");
321 rb_gc_mark_and_move(&iseq->wrapper);
323 if (ISEQ_BODY(iseq)) {
326 rb_iseq_mark_and_move_each_value(iseq, reference_updating ? ISEQ_ORIGINAL_ISEQ(iseq) : NULL);
328 rb_gc_mark_and_move(&body->variable.coverage);
329 rb_gc_mark_and_move(&body->variable.pc2branchindex);
330 rb_gc_mark_and_move(&body->variable.script_lines);
331 rb_gc_mark_and_move(&body->location.label);
332 rb_gc_mark_and_move(&body->location.base_label);
333 rb_gc_mark_and_move(&body->location.pathobj);
334 if (body->local_iseq) rb_gc_mark_and_move_ptr(&body->local_iseq);
335 if (body->parent_iseq) rb_gc_mark_and_move_ptr(&body->parent_iseq);
336 if (body->mandatory_only_iseq) rb_gc_mark_and_move_ptr(&body->mandatory_only_iseq);
338 if (body->call_data) {
339 for (
unsigned int i = 0; i < body->ci_size; i++) {
342 if (cds[i].ci) rb_gc_mark_and_move_ptr(&cds[i].ci);
344 if (cc_is_active(cds[i].cc, reference_updating)) {
345 rb_gc_mark_and_move_ptr(&cds[i].cc);
348 cds[i].cc = rb_vm_empty_cc();
353 if (body->
param.flags.has_kw && ISEQ_COMPILE_DATA(iseq) == NULL) {
354 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
356 for (
int j = 0, i = keyword->required_num; i < keyword->num; i++, j++) {
357 rb_gc_mark_and_move(&keyword->default_values[j]);
361 if (body->catch_table) {
364 for (
unsigned int i = 0; i < table->size; i++) {
366 entry = UNALIGNED_MEMBER_PTR(table, entries[i]);
368 rb_gc_mark_and_move_ptr(&entry->iseq);
373 if (reference_updating) {
375 rb_rjit_iseq_update_references(body);
378 rb_yjit_iseq_update_references(body->yjit_payload);
383 rb_rjit_iseq_mark(body->rjit_blocks);
386 rb_yjit_iseq_mark(body->yjit_payload);
392 rb_gc_mark_and_move(&iseq->aux.loader.obj);
397 if (!reference_updating) {
403 rb_iseq_mark_and_pin_insn_storage(compile_data->insn.storage_head);
406 rb_gc_mark_and_move((
VALUE *)&compile_data->err_info);
407 rb_gc_mark_and_move((
VALUE *)&compile_data->catch_table_ary);
411 VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
413 if (iseq->aux.exec.local_hooks) {
414 rb_hook_list_mark_and_update(iseq->aux.exec.local_hooks);
418 RUBY_MARK_LEAVE(
"iseq");
422param_keyword_size(
const struct rb_iseq_param_keyword *pkw)
426 if (!pkw)
return size;
428 size +=
sizeof(
struct rb_iseq_param_keyword);
429 size +=
sizeof(
VALUE) * (pkw->num - pkw->required_num);
443 if (ISEQ_EXECUTABLE_P(iseq) && body) {
445 size += body->iseq_size *
sizeof(
VALUE);
447 size += body->local_table_size *
sizeof(
ID);
448 size += ISEQ_MBITS_BUFLEN(body->iseq_size) * ISEQ_MBITS_SIZE;
449 if (body->catch_table) {
450 size += iseq_catch_table_bytes(body->catch_table->size);
452 size += (body->
param.opt_num + 1) *
sizeof(
VALUE);
453 size += param_keyword_size(body->
param.keyword);
458 if (ISEQ_BODY(iseq)->is_entries) {
460 for (
unsigned int ic_idx = 0; ic_idx < body->ic_size; ic_idx++) {
461 IC ic = &ISEQ_IS_IC_ENTRY(body, ic_idx);
476 compile_data = ISEQ_COMPILE_DATA(iseq);
482 cur = compile_data->node.storage_head;
493rb_iseq_constant_body_alloc(
void)
504 ISEQ_BODY(iseq) = rb_iseq_constant_body_alloc();
509rb_iseq_pathobj_new(
VALUE path,
VALUE realpath)
512 VM_ASSERT(RB_TYPE_P(path,
T_STRING));
515 if (path == realpath ||
517 pathobj = rb_fstring(path);
520 if (!
NIL_P(realpath)) realpath = rb_fstring(realpath);
521 pathobj = rb_ary_new_from_args(2, rb_fstring(path), realpath);
522 rb_obj_freeze(pathobj);
531 rb_iseq_pathobj_new(path, realpath));
539 rb_iseq_pathobj_set(iseq, path, realpath);
542 loc->first_lineno = first_lineno;
544 loc->node_id = node_id;
545 loc->code_location = *code_location;
548 loc->code_location.beg_pos.lineno = 0;
549 loc->code_location.beg_pos.column = 0;
550 loc->code_location.end_pos.lineno = -1;
551 loc->code_location.end_pos.column = -1;
564 if (
type == ISEQ_TYPE_TOP) {
565 body->local_iseq = iseq;
567 else if (
type == ISEQ_TYPE_METHOD ||
type == ISEQ_TYPE_CLASS) {
568 body->local_iseq = iseq;
571 body->local_iseq = ISEQ_BODY(piseq)->local_iseq;
575 body->parent_iseq = piseq;
578 if (
type == ISEQ_TYPE_MAIN) {
579 body->local_iseq = iseq;
588 ALLOC_N(
char, INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE +
593 new_arena->size = INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE;
601 const rb_iseq_t *parent,
int isolated_depth,
enum rb_iseq_type
type,
608 if (parent && (
type == ISEQ_TYPE_MAIN ||
type == ISEQ_TYPE_TOP))
612 set_relation(iseq, parent);
614 name = rb_fstring(name);
615 iseq_location_setup(iseq, name, path, realpath, first_lineno, code_location, node_id);
616 if (iseq != body->local_iseq) {
617 RB_OBJ_WRITE(iseq, &body->location.base_label, ISEQ_BODY(body->local_iseq)->location.label);
619 ISEQ_COVERAGE_SET(iseq,
Qnil);
620 ISEQ_ORIGINAL_ISEQ_CLEAR(iseq);
621 body->variable.flip_count = 0;
623 if (
NIL_P(script_lines)) {
627 RB_OBJ_WRITE(iseq, &body->variable.script_lines, rb_ractor_make_shareable(script_lines));
630 ISEQ_COMPILE_DATA_ALLOC(iseq);
631 RB_OBJ_WRITE(iseq, &ISEQ_COMPILE_DATA(iseq)->err_info, err_info);
634 ISEQ_COMPILE_DATA(iseq)->node.storage_head = ISEQ_COMPILE_DATA(iseq)->node.storage_current = new_arena();
635 ISEQ_COMPILE_DATA(iseq)->insn.storage_head = ISEQ_COMPILE_DATA(iseq)->insn.storage_current = new_arena();
636 ISEQ_COMPILE_DATA(iseq)->isolated_depth = isolated_depth;
637 ISEQ_COMPILE_DATA(iseq)->option = option;
638 ISEQ_COMPILE_DATA(iseq)->ivar_cache_table = NULL;
639 ISEQ_COMPILE_DATA(iseq)->builtin_function_table = GET_VM()->builtin_function_table;
641 if (option->coverage_enabled) {
642 VALUE coverages = rb_get_coverages();
643 if (
RTEST(coverages)) {
644 coverage = rb_hash_lookup(coverages, rb_iseq_path(iseq));
648 ISEQ_COVERAGE_SET(iseq, coverage);
649 if (coverage && ISEQ_BRANCH_COVERAGE(iseq))
650 ISEQ_PC2BRANCHINDEX_SET(iseq, rb_ary_hidden_new(0));
655#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
656static void validate_get_insn_info(
const rb_iseq_t *iseq);
660rb_iseq_insns_info_encode_positions(
const rb_iseq_t *iseq)
662#if VM_INSN_INFO_TABLE_IMPL == 2
665 int size = body->insns_info.size;
666 int max_pos = body->iseq_size;
667 int *data = (
int *)body->insns_info.positions;
668 if (body->insns_info.succ_index_table) ruby_xfree(body->insns_info.succ_index_table);
669 body->insns_info.succ_index_table = succ_index_table_create(max_pos, data, size);
670#if VM_CHECK_MODE == 0
671 ruby_xfree(body->insns_info.positions);
672 body->insns_info.positions = NULL;
677#if VM_INSN_INFO_TABLE_IMPL == 2
681 int size = body->insns_info.size;
682 int max_pos = body->iseq_size;
683 struct succ_index_table *sd = body->insns_info.succ_index_table;
684 return succ_index_table_invert(max_pos, sd, size);
691 iseq->aux.exec.global_trace_events = 0;
692 if (ruby_vm_event_enabled_global_flags & ISEQ_TRACE_EVENTS) {
693 rb_iseq_trace_set(iseq, ruby_vm_event_enabled_global_flags & ISEQ_TRACE_EVENTS);
702 VALUE err = data->err_info;
703 ISEQ_COMPILE_DATA_CLEAR(iseq);
704 compile_data_free(data);
706#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
707 validate_get_insn_info(iseq);
711 VALUE path = pathobj_path(body->location.pathobj);
713 rb_funcallv(err, rb_intern(
"set_backtrace"), 1, &path);
717 RB_DEBUG_COUNTER_INC(iseq_num);
718 RB_DEBUG_COUNTER_ADD(iseq_cd_num, ISEQ_BODY(iseq)->ci_size);
720 rb_iseq_init_trace(iseq);
725 OPT_INLINE_CONST_CACHE,
726 OPT_PEEPHOLE_OPTIMIZATION,
727 OPT_TAILCALL_OPTIMIZATION,
728 OPT_SPECIALISED_INSTRUCTION,
729 OPT_OPERANDS_UNIFICATION,
730 OPT_INSTRUCTIONS_UNIFICATION,
731 OPT_FROZEN_STRING_LITERAL,
732 OPT_DEBUG_FROZEN_STRING_LITERAL,
741#define SET_COMPILE_OPTION(o, h, mem) \
742 { VALUE flag = rb_hash_aref((h), ID2SYM(rb_intern(#mem))); \
743 if (flag == Qtrue) { (o)->mem = 1; } \
744 else if (flag == Qfalse) { (o)->mem = 0; } \
746#define SET_COMPILE_OPTION_NUM(o, h, mem) \
747 { VALUE num = rb_hash_aref((h), ID2SYM(rb_intern(#mem))); \
748 if (!NIL_P(num)) (o)->mem = NUM2INT(num); \
750 SET_COMPILE_OPTION(option, opt, inline_const_cache);
751 SET_COMPILE_OPTION(option, opt, peephole_optimization);
752 SET_COMPILE_OPTION(option, opt, tailcall_optimization);
753 SET_COMPILE_OPTION(option, opt, specialized_instruction);
754 SET_COMPILE_OPTION(option, opt, operands_unification);
755 SET_COMPILE_OPTION(option, opt, instructions_unification);
756 SET_COMPILE_OPTION(option, opt, frozen_string_literal);
757 SET_COMPILE_OPTION(option, opt, debug_frozen_string_literal);
758 SET_COMPILE_OPTION(option, opt, coverage_enabled);
759 SET_COMPILE_OPTION_NUM(option, opt, debug_level);
760#undef SET_COMPILE_OPTION
761#undef SET_COMPILE_OPTION_NUM
767#define SET_COMPILE_OPTION(o, a, mem) \
768 ((a)->mem < 0 ? 0 : ((o)->mem = (a)->mem > 0))
769 SET_COMPILE_OPTION(option, ast, frozen_string_literal);
770 SET_COMPILE_OPTION(option, ast, coverage_enabled);
771#undef SET_COMPILE_OPTION
779 *option = COMPILE_OPTION_DEFAULT;
782 *option = COMPILE_OPTION_FALSE;
784 else if (opt ==
Qtrue) {
787 ((
int *)option)[i] = 1;
789 else if (RB_TYPE_P(opt,
T_HASH)) {
790 *option = COMPILE_OPTION_DEFAULT;
791 set_compile_option_from_hash(option, opt);
794 rb_raise(
rb_eTypeError,
"Compile option must be Hash/true/false/nil");
801 VALUE opt = rb_hash_new_with_size(11);
802#define SET_COMPILE_OPTION(o, h, mem) \
803 rb_hash_aset((h), ID2SYM(rb_intern(#mem)), RBOOL((o)->mem))
804#define SET_COMPILE_OPTION_NUM(o, h, mem) \
805 rb_hash_aset((h), ID2SYM(rb_intern(#mem)), INT2NUM((o)->mem))
807 SET_COMPILE_OPTION(option, opt, inline_const_cache);
808 SET_COMPILE_OPTION(option, opt, peephole_optimization);
809 SET_COMPILE_OPTION(option, opt, tailcall_optimization);
810 SET_COMPILE_OPTION(option, opt, specialized_instruction);
811 SET_COMPILE_OPTION(option, opt, operands_unification);
812 SET_COMPILE_OPTION(option, opt, instructions_unification);
813 SET_COMPILE_OPTION(option, opt, frozen_string_literal);
814 SET_COMPILE_OPTION(option, opt, debug_frozen_string_literal);
815 SET_COMPILE_OPTION(option, opt, coverage_enabled);
816 SET_COMPILE_OPTION_NUM(option, opt, debug_level);
818#undef SET_COMPILE_OPTION
819#undef SET_COMPILE_OPTION_NUM
827 return rb_iseq_new_with_opt(ast, name, path, realpath, 0, parent,
828 0,
type, &COMPILE_OPTION_DEFAULT);
834 if (ast->script_lines ==
Qfalse) {
838 if (RB_TYPE_P(ast->script_lines,
T_ARRAY)){
841 return FIX2INT(ast->script_lines);
847 int line_count = line_offset + ast_line_count(ast);
849 if (line_count >= 0) {
850 int len = (rb_get_coverage_mode() & COVERAGE_TARGET_ONESHOT_LINES) ? 0 : line_count;
852 VALUE coverage = rb_default_coverage(
len);
853 rb_hash_aset(coverages, path, coverage);
864 VALUE coverages = rb_get_coverages();
866 if (
RTEST(coverages)) {
867 iseq_setup_coverage(coverages, path, ast, line_offset);
874 iseq_new_setup_coverage(path, ast, 0);
876 return rb_iseq_new_with_opt(ast, name, path, realpath, 0, parent, 0,
877 ISEQ_TYPE_TOP, &COMPILE_OPTION_DEFAULT);
883 iseq_new_setup_coverage(path, ast, 0);
885 return rb_iseq_new_with_opt(ast, rb_fstring_lit(
"<main>"),
887 parent, 0, ISEQ_TYPE_MAIN, opt ? &COMPILE_OPTION_DEFAULT : &COMPILE_OPTION_FALSE);
893 if (rb_get_coverage_mode() & COVERAGE_TARGET_EVAL) {
894 VALUE coverages = rb_get_coverages();
895 if (
RTEST(coverages) &&
RTEST(path) && !
RTEST(rb_hash_has_key(coverages, path))) {
896 iseq_setup_coverage(coverages, path, ast, first_lineno - 1);
900 return rb_iseq_new_with_opt(ast, name, path, realpath, first_lineno,
901 parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT);
908 VALUE v1 = iseqw_new(iseq);
910 if (v1 != v2 &&
CLASS_OF(v2) == rb_cISeq) {
920 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
923 const NODE *node = ast ? ast->root : 0;
928 if (!option) option = &COMPILE_OPTION_DEFAULT;
931 option = set_compile_option_from_ast(&new_opt, ast);
936 if (ast && !
FIXNUM_P(ast->script_lines) && ast->script_lines) {
937 script_lines = ast->script_lines;
940 script_lines = ISEQ_BODY(parent)->variable.script_lines;
943 prepare_iseq_build(iseq, name, path, realpath, first_lineno, node ? &node->nd_loc : NULL, node ? nd_node_id(node) : -1,
944 parent, isolated_depth,
type, script_lines, option);
946 rb_iseq_compile_node(iseq, node);
947 finish_iseq_build(iseq);
949 return iseq_translate(iseq);
964 .beg_pos = { .lineno = (int) start.
line, .column = (
int) start.
column },
965 .end_pos = { .lineno = (int) end.
line, .column = (
int) end.
column }
971 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
976 if (!option) option = &COMPILE_OPTION_DEFAULT;
983 prepare_iseq_build(iseq, name, path, realpath, first_lineno, &code_location, node_id,
984 parent, isolated_depth,
type, script_lines, option);
986 rb_iseq_compile_prism_node(iseq, scope_node, parser);
987 finish_iseq_build(iseq);
989 return iseq_translate(iseq);
993rb_iseq_new_with_callback(
996 int first_lineno,
const rb_iseq_t *parent,
1002 if (!option) option = &COMPILE_OPTION_DEFAULT;
1003 prepare_iseq_build(iseq, name, path, realpath, first_lineno, NULL, -1, parent, 0,
type,
Qnil, option);
1005 rb_iseq_compile_callback(iseq, ifunc);
1006 finish_iseq_build(iseq);
1012rb_iseq_load_iseq(
VALUE fname)
1017 return iseqw_check(iseqv);
1023#define CHECK_ARRAY(v) rb_to_array_type(v)
1024#define CHECK_HASH(v) rb_to_hash_type(v)
1025#define CHECK_STRING(v) rb_str_to_str(v)
1026#define CHECK_SYMBOL(v) rb_to_symbol_type(v)
1029static enum rb_iseq_type
1032 const ID id_top = rb_intern(
"top");
1033 const ID id_method = rb_intern(
"method");
1034 const ID id_block = rb_intern(
"block");
1035 const ID id_class = rb_intern(
"class");
1036 const ID id_rescue = rb_intern(
"rescue");
1037 const ID id_ensure = rb_intern(
"ensure");
1038 const ID id_eval = rb_intern(
"eval");
1039 const ID id_main = rb_intern(
"main");
1040 const ID id_plain = rb_intern(
"plain");
1044 if (
typeid == id_top)
return ISEQ_TYPE_TOP;
1045 if (
typeid == id_method)
return ISEQ_TYPE_METHOD;
1046 if (
typeid == id_block)
return ISEQ_TYPE_BLOCK;
1047 if (
typeid == id_class)
return ISEQ_TYPE_CLASS;
1048 if (
typeid == id_rescue)
return ISEQ_TYPE_RESCUE;
1049 if (
typeid == id_ensure)
return ISEQ_TYPE_ENSURE;
1050 if (
typeid == id_eval)
return ISEQ_TYPE_EVAL;
1051 if (
typeid == id_main)
return ISEQ_TYPE_MAIN;
1052 if (
typeid == id_plain)
return ISEQ_TYPE_PLAIN;
1053 return (
enum rb_iseq_type)-1;
1061 VALUE magic, version1, version2, format_type, misc;
1062 VALUE name, path, realpath, code_location, node_id;
1063 VALUE type, body, locals, params, exception;
1065 st_data_t iseq_type;
1075 data = CHECK_ARRAY(data);
1077 magic = CHECK_STRING(rb_ary_entry(data, i++));
1078 version1 = CHECK_INTEGER(rb_ary_entry(data, i++));
1079 version2 = CHECK_INTEGER(rb_ary_entry(data, i++));
1080 format_type = CHECK_INTEGER(rb_ary_entry(data, i++));
1081 misc = CHECK_HASH(rb_ary_entry(data, i++));
1082 ((void)magic, (void)version1, (void)version2, (void)format_type);
1084 name = CHECK_STRING(rb_ary_entry(data, i++));
1085 path = CHECK_STRING(rb_ary_entry(data, i++));
1086 realpath = rb_ary_entry(data, i++);
1087 realpath =
NIL_P(realpath) ?
Qnil : CHECK_STRING(realpath);
1088 int first_lineno =
RB_NUM2INT(rb_ary_entry(data, i++));
1090 type = CHECK_SYMBOL(rb_ary_entry(data, i++));
1091 locals = CHECK_ARRAY(rb_ary_entry(data, i++));
1092 params = CHECK_HASH(rb_ary_entry(data, i++));
1093 exception = CHECK_ARRAY(rb_ary_entry(data, i++));
1094 body = CHECK_ARRAY(rb_ary_entry(data, i++));
1096 ISEQ_BODY(iseq)->local_iseq = iseq;
1098 iseq_type = iseq_type_from_sym(
type);
1099 if (iseq_type == (
enum rb_iseq_type)-1) {
1103 node_id = rb_hash_aref(misc,
ID2SYM(rb_intern(
"node_id")));
1105 code_location = rb_hash_aref(misc,
ID2SYM(rb_intern(
"code_location")));
1107 tmp_loc.beg_pos.lineno =
NUM2INT(rb_ary_entry(code_location, 0));
1108 tmp_loc.beg_pos.column =
NUM2INT(rb_ary_entry(code_location, 1));
1109 tmp_loc.end_pos.lineno =
NUM2INT(rb_ary_entry(code_location, 2));
1110 tmp_loc.end_pos.column =
NUM2INT(rb_ary_entry(code_location, 3));
1113 make_compile_option(&option, opt);
1114 option.peephole_optimization = FALSE;
1115 prepare_iseq_build(iseq, name, path, realpath, first_lineno, &tmp_loc,
NUM2INT(node_id),
1116 parent, 0, (
enum rb_iseq_type)iseq_type,
Qnil, &option);
1118 rb_iseq_build_from_ary(iseq, misc, locals, params, exception, body);
1120 finish_iseq_build(iseq);
1122 return iseqw_new(iseq);
1129iseq_s_load(
int argc,
VALUE *argv,
VALUE self)
1133 return iseq_load(data, NULL, opt);
1139 return iseq_load(data,
RTEST(parent) ? (
rb_iseq_t *)parent : NULL, opt);
1147#if !defined(__GNUC__) || (__GNUC__ == 4 && __GNUC_MINOR__ == 8)
1148# define INITIALIZED volatile
1155 VALUE name = rb_fstring_lit(
"<compiled>");
1158 make_compile_option(&option, opt);
1161 if (RB_TYPE_P(src,
T_FILE)) {
1162 parse = rb_parser_compile_file_path;
1165 parse = rb_parser_compile_string_path;
1169 const VALUE parser = rb_parser_new();
1170 const rb_iseq_t *outer_scope = rb_iseq_new(NULL, name, name,
Qnil, 0, ISEQ_TYPE_TOP);
1172 rb_parser_set_context(parser, outer_scope, FALSE);
1173 rb_parser_set_script_lines(parser, RBOOL(ruby_vm_keep_script_lines));
1175 ast = (*parse)(parser, file, src, ln);
1178 if (!ast->body.root) {
1179 rb_ast_dispose(ast);
1180 rb_exc_raise(GET_EC()->errinfo);
1183 iseq = rb_iseq_new_with_opt(&ast->body, name, file, realpath, ln,
1184 NULL, 0, ISEQ_TYPE_TOP, &option);
1185 rb_ast_dispose(ast);
1194 return pathobj_path(ISEQ_BODY(iseq)->location.pathobj);
1200 return pathobj_realpath(ISEQ_BODY(iseq)->location.pathobj);
1204rb_iseq_absolute_path(
const rb_iseq_t *iseq)
1206 return rb_iseq_realpath(iseq);
1210rb_iseq_from_eval_p(
const rb_iseq_t *iseq)
1212 return NIL_P(rb_iseq_realpath(iseq));
1218 return ISEQ_BODY(iseq)->location.label;
1222rb_iseq_base_label(
const rb_iseq_t *iseq)
1224 return ISEQ_BODY(iseq)->location.base_label;
1228rb_iseq_first_lineno(
const rb_iseq_t *iseq)
1230 return RB_INT2NUM(ISEQ_BODY(iseq)->location.first_lineno);
1234rb_iseq_method_name(
const rb_iseq_t *iseq)
1238 if (body->type == ISEQ_TYPE_METHOD) {
1239 return body->location.base_label;
1247rb_iseq_code_location(
const rb_iseq_t *iseq,
int *beg_pos_lineno,
int *beg_pos_column,
int *end_pos_lineno,
int *end_pos_column)
1250 if (beg_pos_lineno) *beg_pos_lineno = loc->beg_pos.lineno;
1251 if (beg_pos_column) *beg_pos_column = loc->beg_pos.column;
1252 if (end_pos_lineno) *end_pos_lineno = loc->end_pos.lineno;
1253 if (end_pos_column) *end_pos_column = loc->end_pos.column;
1256static ID iseq_type_id(
enum rb_iseq_type
type);
1261 return ID2SYM(iseq_type_id(ISEQ_BODY(iseq)->
type));
1267 return ISEQ_COVERAGE(iseq);
1271remove_coverage_i(
void *vstart,
void *vend,
size_t stride,
void *data)
1274 for (; v != (
VALUE)vend; v += stride) {
1275 void *ptr = asan_poisoned_object_p(v);
1276 asan_unpoison_object(v,
false);
1278 if (rb_obj_is_iseq(v)) {
1280 ISEQ_COVERAGE_SET(iseq,
Qnil);
1283 asan_poison_object_if(ptr, v);
1289rb_iseq_remove_coverage_all(
void)
1291 rb_objspace_each_objects(remove_coverage_i, NULL);
1297iseqw_mark(
void *ptr)
1299 rb_gc_mark((
VALUE)ptr);
1303iseqw_memsize(
const void *ptr)
1305 return rb_iseq_memsize((
const rb_iseq_t *)ptr);
1310 {iseqw_mark, NULL, iseqw_memsize,},
1311 0, 0, RUBY_TYPED_FREE_IMMEDIATELY|RUBY_TYPED_WB_PROTECTED
1317 if (iseq->wrapper) {
1318 return iseq->wrapper;
1321 union {
const rb_iseq_t *in;
void *out; } deconst;
1338 return iseqw_new(iseq);
1379iseqw_s_compile(
int argc,
VALUE *argv,
VALUE self)
1385 if (i > 4+
NIL_P(opt)) rb_error_arity(argc, 1, 5);
1387 case 5: opt = argv[--i];
1388 case 4: line = argv[--i];
1389 case 3: path = argv[--i];
1390 case 2: file = argv[--i];
1393 if (
NIL_P(file)) file = rb_fstring_lit(
"<compiled>");
1394 if (
NIL_P(path)) path = file;
1400 return iseqw_new(rb_iseq_compile_with_option(src, file, path, line, opt));
1411 make_compile_option(&option, opt);
1412 prepare_iseq_build(iseq, rb_fstring_lit(
"<compiled>"), file, path, first_lineno, &code_location, -1, NULL, 0, ISEQ_TYPE_TOP,
Qnil, &option);
1415 pm_scope_node_init(node, &scope_node, NULL, parser);
1416 rb_iseq_compile_prism_node(iseq, &scope_node, parser);
1418 finish_iseq_build(iseq);
1419 pm_node_destroy(parser, node);
1423iseqw_s_compile_prism(
int argc,
VALUE *argv,
VALUE self)
1429 if (i > 4+
NIL_P(opt)) rb_error_arity(argc, 1, 5);
1431 case 5: opt = argv[--i];
1432 case 4: line = argv[--i];
1433 case 3: path = argv[--i];
1434 case 2: file = argv[--i];
1437 if (
NIL_P(file)) file = rb_fstring_lit(
"<compiled>");
1438 if (
NIL_P(path)) path = file;
1445 pm_options_filepath_set(&options, RSTRING_PTR(file));
1447 int start_line =
NUM2INT(line);
1448 pm_options_line_set(&options, start_line);
1452 if (RB_TYPE_P(src,
T_FILE)) {
1454 file = rb_fstring(src);
1457 pm_string_mapped_init(&input, RSTRING_PTR(file));
1459 pm_parser_init(&parser, pm_string_source(&input), pm_string_length(&input), &options);
1462 pm_parser_init(&parser, (
const uint8_t *) RSTRING_PTR(src), RSTRING_LEN(src), &options);
1466 iseqw_s_compile_prism_compile(&parser, opt, iseq, file, path, start_line);
1467 pm_parser_free(&parser);
1468 pm_options_free(&options);
1470 return iseqw_new(iseq);
1474iseqw_s_compile_file_prism(
int argc,
VALUE *argv,
VALUE self)
1479 i =
rb_scan_args(argc, argv,
"1*:", &file, NULL, &opt);
1480 if (i > 1+
NIL_P(opt)) rb_error_arity(argc, 1, 5);
1482 case 2: opt = argv[--i];
1485 file = rb_fstring(file);
1488 pm_string_mapped_init(&input, RSTRING_PTR(file));
1491 pm_options_filepath_set(&options, RSTRING_PTR(file));
1494 pm_parser_init(&parser, pm_string_source(&input), pm_string_length(&input), &options);
1497 iseqw_s_compile_prism_compile(&parser, opt, iseq, file, rb_realpath_internal(
Qnil, file, 1), 1);
1498 pm_parser_free(&parser);
1499 pm_string_free(&input);
1500 pm_options_free(&options);
1502 return iseqw_new(iseq);
1509 pm_parser_init(&parser, pm_string_source(input), pm_string_length(input), options);
1511 if (
NIL_P(path)) path = rb_fstring_lit(
"<compiled>");
1513 pm_options_line_set(options, start_line);
1516 iseqw_s_compile_prism_compile(&parser,
Qnil, iseq, path, path, start_line);
1518 pm_parser_free(&parser);
1543iseqw_s_compile_file(
int argc,
VALUE *argv,
VALUE self)
1551 i =
rb_scan_args(argc, argv,
"1*:", &file, NULL, &opt);
1552 if (i > 1+
NIL_P(opt)) rb_error_arity(argc, 1, 2);
1554 case 2: opt = argv[--i];
1557 file = rb_fstring(file);
1562 VALUE v = rb_vm_push_frame_fname(ec, file);
1564 parser = rb_parser_new();
1565 rb_parser_set_context(parser, NULL, FALSE);
1566 ast = (
rb_ast_t *)rb_parser_load_file(parser, file);
1567 if (!ast->body.root) exc = GET_EC()->errinfo;
1570 if (!ast->body.root) {
1571 rb_ast_dispose(ast);
1575 make_compile_option(&option, opt);
1577 ret = iseqw_new(rb_iseq_new_with_opt(&ast->body, rb_fstring_lit(
"<main>"),
1579 rb_realpath_internal(
Qnil, file, 1),
1580 1, NULL, 0, ISEQ_TYPE_TOP, &option));
1581 rb_ast_dispose(ast);
1583 rb_vm_pop_frame(ec);
1619iseqw_s_compile_option_set(
VALUE self,
VALUE opt)
1622 make_compile_option(&option, opt);
1623 COMPILE_OPTION_DEFAULT = option;
1636iseqw_s_compile_option_get(
VALUE self)
1638 return make_compile_option_value(&COMPILE_OPTION_DEFAULT);
1642iseqw_check(
VALUE iseqw)
1646 if (!ISEQ_BODY(iseq)) {
1647 rb_ibf_load_iseq_complete(iseq);
1650 if (!ISEQ_BODY(iseq)->location.label) {
1651 rb_raise(
rb_eTypeError,
"uninitialized InstructionSequence");
1657rb_iseqw_to_iseq(
VALUE iseqw)
1659 return iseqw_check(iseqw);
1671iseqw_eval(
VALUE self)
1673 return rb_iseq_eval(iseqw_check(self));
1681iseqw_inspect(
VALUE self)
1683 const rb_iseq_t *iseq = iseqw_check(self);
1687 if (!body->location.label) {
1688 return rb_sprintf(
"#<%"PRIsVALUE
": uninitialized>", klass);
1691 return rb_sprintf(
"<%"PRIsVALUE
":%"PRIsVALUE
"@%"PRIsVALUE
":%d>",
1693 body->location.label, rb_iseq_path(iseq),
1694 FIX2INT(rb_iseq_first_lineno(iseq)));
1722iseqw_path(
VALUE self)
1724 return rb_iseq_path(iseqw_check(self));
1744iseqw_absolute_path(
VALUE self)
1746 return rb_iseq_realpath(iseqw_check(self));
1773iseqw_label(
VALUE self)
1775 return rb_iseq_label(iseqw_check(self));
1799iseqw_base_label(
VALUE self)
1801 return rb_iseq_base_label(iseqw_check(self));
1815iseqw_first_lineno(
VALUE self)
1817 return rb_iseq_first_lineno(iseqw_check(self));
1904iseqw_to_a(
VALUE self)
1906 const rb_iseq_t *iseq = iseqw_check(self);
1907 return iseq_data_to_ary(iseq);
1910#if VM_INSN_INFO_TABLE_IMPL == 1
1912get_insn_info_binary_search(
const rb_iseq_t *iseq,
size_t pos)
1915 size_t size = body->insns_info.size;
1917 const unsigned int *positions = body->insns_info.positions;
1918 const int debug = 0;
1921 printf(
"size: %"PRIuSIZE
"\n", size);
1922 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
1923 (
size_t)0, positions[0], insns_info[0].line_no, pos);
1929 else if (size == 1) {
1930 return &insns_info[0];
1933 size_t l = 1, r = size - 1;
1935 size_t m = l + (r - l) / 2;
1936 if (positions[m] == pos) {
1937 return &insns_info[m];
1939 if (positions[m] < pos) {
1947 return &insns_info[size-1];
1949 if (positions[l] > pos) {
1950 return &insns_info[l-1];
1952 return &insns_info[l];
1957get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
1959 return get_insn_info_binary_search(iseq, pos);
1963#if VM_INSN_INFO_TABLE_IMPL == 2
1965get_insn_info_succinct_bitvector(
const rb_iseq_t *iseq,
size_t pos)
1968 size_t size = body->insns_info.size;
1970 const int debug = 0;
1973#if VM_CHECK_MODE > 0
1974 const unsigned int *positions = body->insns_info.positions;
1975 printf(
"size: %"PRIuSIZE
"\n", size);
1976 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
1977 (
size_t)0, positions[0], insns_info[0].line_no, pos);
1979 printf(
"size: %"PRIuSIZE
"\n", size);
1980 printf(
"insns_info[%"PRIuSIZE
"]: line: %d, pos: %"PRIuSIZE
"\n",
1981 (
size_t)0, insns_info[0].line_no, pos);
1988 else if (size == 1) {
1989 return &insns_info[0];
1993 VM_ASSERT(body->insns_info.succ_index_table != NULL);
1994 index = succ_index_lookup(body->insns_info.succ_index_table, (
int)pos);
1995 return &insns_info[index-1];
2000get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2002 return get_insn_info_succinct_bitvector(iseq, pos);
2006#if VM_CHECK_MODE > 0 || VM_INSN_INFO_TABLE_IMPL == 0
2008get_insn_info_linear_search(
const rb_iseq_t *iseq,
size_t pos)
2011 size_t i = 0, size = body->insns_info.size;
2013 const unsigned int *positions = body->insns_info.positions;
2014 const int debug = 0;
2017 printf(
"size: %"PRIuSIZE
"\n", size);
2018 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2019 i, positions[i], insns_info[i].line_no, pos);
2025 else if (size == 1) {
2026 return &insns_info[0];
2029 for (i=1; i<size; i++) {
2030 if (debug) printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2031 i, positions[i], insns_info[i].line_no, pos);
2033 if (positions[i] == pos) {
2034 return &insns_info[i];
2036 if (positions[i] > pos) {
2037 return &insns_info[i-1];
2041 return &insns_info[i-1];
2045#if VM_INSN_INFO_TABLE_IMPL == 0
2047get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2049 return get_insn_info_linear_search(iseq, pos);
2053#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
2055validate_get_insn_info(
const rb_iseq_t *iseq)
2059 for (i = 0; i < body->iseq_size; i++) {
2060 if (get_insn_info_linear_search(iseq, i) != get_insn_info(iseq, i)) {
2061 rb_bug(
"validate_get_insn_info: get_insn_info_linear_search(iseq, %"PRIuSIZE
") != get_insn_info(iseq, %"PRIuSIZE
")", i, i);
2068rb_iseq_line_no(
const rb_iseq_t *iseq,
size_t pos)
2073 return entry->line_no;
2080#ifdef USE_ISEQ_NODE_ID
2082rb_iseq_node_id(
const rb_iseq_t *iseq,
size_t pos)
2087 return entry->node_id;
2096rb_iseq_event_flags(
const rb_iseq_t *iseq,
size_t pos)
2100 return entry->events;
2112 entry->events &= ~reset;
2113 if (!(entry->events & iseq->aux.exec.global_trace_events)) {
2114 void rb_iseq_trace_flag_cleared(
const rb_iseq_t *iseq,
size_t pos);
2115 rb_iseq_trace_flag_cleared(iseq, pos);
2128 for (i = 0; i < level; i++) {
2129 diseq = ISEQ_BODY(diseq)->parent_iseq;
2131 idx = ISEQ_BODY(diseq)->local_table_size - (int)op - 1;
2132 lid = ISEQ_BODY(diseq)->local_table[idx];
2133 name = rb_id2str(lid);
2141 name = rb_str_dup(name);
2143 rb_str_catf(name,
"@%d", idx);
2147int rb_insn_unified_local_var_level(
VALUE);
2151rb_insn_operand_intern(
const rb_iseq_t *iseq,
2155 const char *types = insn_op_types(insn);
2156 char type = types[op_no];
2161 ret = rb_sprintf(
"%"PRIdVALUE, (
VALUE)(pos +
len + op));
2165 if (insn == BIN(defined) && op_no == 0) {
2166 enum defined_type deftype = (
enum defined_type)op;
2169 ret = rb_fstring_lit(
"func");
2172 ret = rb_fstring_lit(
"ref");
2174 case DEFINED_CONST_FROM:
2175 ret = rb_fstring_lit(
"constant-from");
2178 ret = rb_iseq_defined_string(deftype);
2183 else if (insn == BIN(checktype) && op_no == 0) {
2189 ret = rb_sprintf(
"%"PRIuVALUE, op);
2194 if (types[op_no+1] == TS_NUM && pnop) {
2195 ret = local_var_name(iseq, *pnop, op - VM_ENV_DATA_SIZE);
2197 else if ((level = rb_insn_unified_local_var_level(insn)) >= 0) {
2198 ret = local_var_name(iseq, (
VALUE)level, op - VM_ENV_DATA_SIZE);
2210 op = obj_resurrect(op);
2211 if (insn == BIN(defined) && op_no == 1 &&
FIXNUM_P(op)) {
2216 ret = rb_sprintf(
":$%c", (
type >> 1));
2219 ret = rb_sprintf(
":$%d", (
type >> 1));
2224 ret = rb_dump_literal(op);
2227 rb_ary_push(child, op);
2236 ret = ISEQ_BODY(iseq)->location.label;
2238 rb_ary_push(child, (
VALUE)iseq);
2250 const ID *segments = ((
IC)op)->segments;
2253 rb_str_catf(ret,
"::%s", rb_id2name(*segments++));
2268 VALUE ary = rb_ary_new();
2269 ID mid = vm_ci_mid(ci);
2272 rb_ary_push(ary, rb_sprintf(
"mid:%"PRIsVALUE, rb_id2str(mid)));
2275 rb_ary_push(ary, rb_sprintf(
"argc:%d", vm_ci_argc(ci)));
2277 if (vm_ci_flag(ci) & VM_CALL_KWARG) {
2279 VALUE kw_ary = rb_ary_new_from_values(kw_args->keyword_len, kw_args->keywords);
2280 rb_ary_push(ary, rb_sprintf(
"kw:[%"PRIsVALUE
"]", rb_ary_join(kw_ary,
rb_str_new2(
","))));
2283 if (vm_ci_flag(ci)) {
2284 VALUE flags = rb_ary_new();
2285# define CALL_FLAG(n) if (vm_ci_flag(ci) & VM_CALL_##n) rb_ary_push(flags, rb_str_new2(#n))
2286 CALL_FLAG(ARGS_SPLAT);
2287 CALL_FLAG(ARGS_BLOCKARG);
2290 CALL_FLAG(ARGS_SIMPLE);
2291 CALL_FLAG(TAILCALL);
2295 CALL_FLAG(KW_SPLAT);
2296 CALL_FLAG(KW_SPLAT_MUT);
2297 CALL_FLAG(OPT_SEND);
2298 rb_ary_push(ary, rb_ary_join(flags,
rb_str_new2(
"|")));
2301 ret = rb_sprintf(
"<calldata!%"PRIsVALUE
">", rb_ary_join(ary,
rb_str_new2(
", ")));
2313 if (dladdr((
void *)op, &info) && info.dli_sname) {
2325 ret = rb_sprintf(
"<builtin!%s/%d>",
2326 bf->name, bf->argc);
2331 rb_bug(
"unknown operand type: %c",
type);
2337right_strip(
VALUE str)
2339 const char *beg = RSTRING_PTR(str), *end = RSTRING_END(str);
2340 while (end-- > beg && *end ==
' ');
2341 rb_str_set_len(str, end - beg + 1);
2350rb_iseq_disasm_insn(
VALUE ret,
const VALUE *code,
size_t pos,
2353 VALUE insn = code[pos];
2354 int len = insn_len(insn);
2356 const char *types = insn_op_types(insn);
2358 const char *insn_name_buff;
2360 insn_name_buff = insn_name(insn);
2362 extern const int rb_vm_max_insn_name_size;
2363 rb_str_catf(str,
"%04"PRIuSIZE
" %-*s ", pos, rb_vm_max_insn_name_size, insn_name_buff);
2366 rb_str_catf(str,
"%04"PRIuSIZE
" %-28.*s ", pos,
2367 (
int)strcspn(insn_name_buff,
"_"), insn_name_buff);
2370 for (j = 0; types[j]; j++) {
2371 VALUE opstr = rb_insn_operand_intern(iseq, insn, j, code[pos + j + 1],
2372 len, pos, &code[pos + j + 2],
2382 unsigned int line_no = rb_iseq_line_no(iseq, pos);
2383 unsigned int prev = pos == 0 ? 0 : rb_iseq_line_no(iseq, pos - 1);
2384 if (line_no && line_no != prev) {
2385 long slen = RSTRING_LEN(str);
2386 slen = (slen > 70) ? 0 : (70 - slen);
2387 str = rb_str_catf(str,
"%*s(%4d)", (
int)slen,
"", line_no);
2394 str = rb_str_catf(str,
"[%s%s%s%s%s%s%s%s%s%s%s%s]",
2405 events & RUBY_EVENT_COVERAGE_LINE ?
"Cli" :
"",
2406 events & RUBY_EVENT_COVERAGE_BRANCH ?
"Cbr" :
"");
2416 printf(
"%.*s\n", (
int)RSTRING_LEN(str), RSTRING_PTR(str));
2425 case CATCH_TYPE_RESCUE:
2427 case CATCH_TYPE_ENSURE:
2429 case CATCH_TYPE_RETRY:
2431 case CATCH_TYPE_BREAK:
2433 case CATCH_TYPE_REDO:
2435 case CATCH_TYPE_NEXT:
2438 rb_bug(
"unknown catch type: %d",
type);
2447 if (!body->location.label) {
2448 return rb_sprintf(
"#<ISeq: uninitialized>");
2452 return rb_sprintf(
"#<ISeq:%"PRIsVALUE
"@%"PRIsVALUE
":%d (%d,%d)-(%d,%d)>",
2453 body->location.label, rb_iseq_path(iseq),
2454 loc->beg_pos.lineno,
2455 loc->beg_pos.lineno,
2456 loc->beg_pos.column,
2457 loc->end_pos.lineno,
2458 loc->end_pos.column);
2464 {(void (*)(
void *))rb_mark_set, (void (*)(
void *))st_free_table, 0, 0,},
2465 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
2474 VALUE child = rb_ary_hidden_new(3);
2479 enum {header_minlen = 72};
2482 const char *indent_str;
2485 size = body->iseq_size;
2487 indent_len = RSTRING_LEN(indent);
2488 indent_str = RSTRING_PTR(indent);
2490 rb_str_cat(str, indent_str, indent_len);
2494 if ((l = RSTRING_LEN(str) - indent_len) < header_minlen) {
2496 memset(RSTRING_END(str),
'=', header_minlen - l);
2501 if (body->catch_table) {
2502 rb_str_cat(str, indent_str, indent_len);
2505 if (body->catch_table) {
2507 indent_str = RSTRING_PTR(indent);
2508 for (i = 0; i < body->catch_table->size; i++) {
2510 UNALIGNED_MEMBER_PTR(body->catch_table, entries[i]);
2511 rb_str_cat(str, indent_str, indent_len);
2513 "| catch type: %-6s st: %04d ed: %04d sp: %04d cont: %04d\n",
2514 catch_type((
int)entry->type), (
int)entry->start,
2515 (
int)entry->end, (
int)entry->sp, (
int)entry->cont);
2516 if (entry->iseq && !(done_iseq && st_is_member(done_iseq, (st_data_t)entry->iseq))) {
2517 rb_str_concat(str, rb_iseq_disasm_recursive(rb_iseq_check(entry->iseq), indent));
2519 done_iseq = st_init_numtable();
2522 st_insert(done_iseq, (st_data_t)entry->iseq, (st_data_t)0);
2523 indent_str = RSTRING_PTR(indent);
2526 rb_str_resize(indent, indent_len);
2527 indent_str = RSTRING_PTR(indent);
2529 if (body->catch_table) {
2530 rb_str_cat(str, indent_str, indent_len);
2531 rb_str_cat2(str,
"|-------------------------------------"
2532 "-----------------------------------\n");
2536 if (body->local_table) {
2537 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
2538 rb_str_cat(str, indent_str, indent_len);
2540 "local table (size: %d, argc: %d "
2541 "[opts: %d, rest: %d, post: %d, block: %d, kw: %d@%d, kwrest: %d])\n",
2542 body->local_table_size,
2543 body->
param.lead_num,
2544 body->
param.opt_num,
2545 body->
param.flags.has_rest ? body->
param.rest_start : -1,
2546 body->
param.post_num,
2547 body->
param.flags.has_block ? body->
param.block_start : -1,
2548 body->
param.flags.has_kw ? keyword->num : -1,
2549 body->
param.flags.has_kw ? keyword->required_num : -1,
2550 body->
param.flags.has_kwrest ? keyword->rest_start : -1);
2552 for (i = body->local_table_size; i > 0;) {
2553 int li = body->local_table_size - --i - 1;
2555 VALUE name = local_var_name(iseq, 0, i);
2560 if (body->
param.flags.has_opt) {
2561 int argc = body->
param.lead_num;
2562 int opts = body->
param.opt_num;
2563 if (li >= argc && li < argc + opts) {
2564 snprintf(opti,
sizeof(opti),
"Opt=%"PRIdVALUE,
2565 body->
param.opt_table[li - argc]);
2569 snprintf(argi,
sizeof(argi),
"%s%s%s%s%s%s",
2570 body->
param.lead_num > li ?
"Arg" :
"",
2572 (body->
param.flags.has_rest && body->
param.rest_start == li) ?
"Rest" :
"",
2573 (body->
param.flags.has_post && body->
param.post_start <= li && li < body->param.post_start + body->
param.post_num) ?
"Post" :
"",
2574 (body->
param.flags.has_kwrest && keyword->rest_start == li) ?
"Kwrest" :
"",
2575 (body->
param.flags.has_block && body->
param.block_start == li) ?
"Block" :
"");
2577 rb_str_cat(str, indent_str, indent_len);
2578 rb_str_catf(str,
"[%2d] ", i + 1);
2579 width = RSTRING_LEN(str) + 11;
2581 if (*argi) rb_str_catf(str,
"<%s>", argi);
2582 if ((width -= RSTRING_LEN(str)) > 0) rb_str_catf(str,
"%*s", (
int)width,
"");
2588 code = rb_iseq_original_iseq(iseq);
2589 for (n = 0; n < size;) {
2590 rb_str_cat(str, indent_str, indent_len);
2591 n += rb_iseq_disasm_insn(str, code, n, iseq, child);
2595 VALUE isv = rb_ary_entry(child, l);
2596 if (done_iseq && st_is_member(done_iseq, (st_data_t)isv))
continue;
2599 indent_str = RSTRING_PTR(indent);
2610 rb_str_resize(str, RSTRING_LEN(str));
2620rb_estimate_iv_count(
VALUE klass,
const rb_iseq_t * initialize_iseq)
2622 struct rb_id_table * iv_names = rb_id_table_create(0);
2624 for (
unsigned int i = 0; i < ISEQ_BODY(initialize_iseq)->ivc_size; i++) {
2625 IVC cache = (
IVC)&ISEQ_BODY(initialize_iseq)->is_entries[i];
2627 if (cache->iv_set_name) {
2628 rb_id_table_insert(iv_names, cache->iv_set_name,
Qtrue);
2632 attr_index_t count = (attr_index_t)rb_id_table_size(iv_names);
2635 count += RCLASS_EXT(superclass)->max_iv_count;
2637 rb_id_table_free(iv_names);
2661iseqw_disasm(
VALUE self)
2663 return rb_iseq_disasm(iseqw_check(self));
2667iseq_iterate_children(
const rb_iseq_t *iseq,
void (*iter_func)(
const rb_iseq_t *child_iseq,
void *data),
void *data)
2670 VALUE *code = rb_iseq_original_iseq(iseq);
2673 VALUE all_children = rb_obj_hide(rb_ident_hash_new());
2675 if (body->catch_table) {
2676 for (i = 0; i < body->catch_table->size; i++) {
2678 UNALIGNED_MEMBER_PTR(body->catch_table, entries[i]);
2679 child = entry->iseq;
2681 if (
NIL_P(rb_hash_aref(all_children, (
VALUE)child))) {
2682 rb_hash_aset(all_children, (
VALUE)child,
Qtrue);
2683 (*iter_func)(child, data);
2689 for (i=0; i<body->iseq_size;) {
2690 VALUE insn = code[i];
2691 int len = insn_len(insn);
2692 const char *types = insn_op_types(insn);
2695 for (j=0; types[j]; j++) {
2700 if (
NIL_P(rb_hash_aref(all_children, (
VALUE)child))) {
2701 rb_hash_aset(all_children, (
VALUE)child,
Qtrue);
2702 (*iter_func)(child, data);
2717yield_each_children(
const rb_iseq_t *child_iseq,
void *data)
2731iseqw_each_child(
VALUE self)
2733 const rb_iseq_t *iseq = iseqw_check(self);
2734 iseq_iterate_children(iseq, yield_each_children, NULL);
2741#define C(ev, cstr, l) if (events & ev) rb_ary_push(ary, rb_ary_new_from_args(2, l, ID2SYM(rb_intern(cstr))));
2761iseqw_trace_points(
VALUE self)
2763 const rb_iseq_t *iseq = iseqw_check(self);
2766 VALUE ary = rb_ary_new();
2768 for (i=0; i<body->insns_info.size; i++) {
2770 if (entry->events) {
2771 push_event_info(iseq, entry->events, entry->line_no, ary);
2818 iseq = vm_proc_iseq(body);
2820 if (!rb_obj_is_iseq((
VALUE)iseq)) {
2825 iseq = rb_method_iseq(body);
2827 else if (rb_typeddata_is_instance_of(body, &iseqw_data_type)) {
2831 return iseq ? iseqw_new(iseq) :
Qnil;
2889 VALUE iseqw = iseqw_s_of(klass, body);
2890 return NIL_P(iseqw) ?
Qnil : rb_iseq_disasm(iseqw_check(iseqw));
2894register_label(
struct st_table *table,
unsigned long idx)
2896 VALUE sym = rb_str_intern(rb_sprintf(
"label_%lu", idx));
2897 st_insert(table, idx, sym);
2906 case CATCH_TYPE_RESCUE:
CONST_ID(
id,
"rescue");
break;
2907 case CATCH_TYPE_ENSURE:
CONST_ID(
id,
"ensure");
break;
2908 case CATCH_TYPE_RETRY:
CONST_ID(
id,
"retry");
break;
2909 case CATCH_TYPE_BREAK:
CONST_ID(
id,
"break");
break;
2910 case CATCH_TYPE_REDO:
CONST_ID(
id,
"redo");
break;
2911 case CATCH_TYPE_NEXT:
CONST_ID(
id,
"next");
break;
2913 rb_bug(
"unknown exception type: %d", (
int)
type);
2921 rb_ary_push(ary, obj_resurrect(key));
2922 rb_ary_push(ary, value);
2928 {(void (*)(
void *))rb_mark_tbl, (void (*)(
void *))st_free_table, 0, 0,},
2929 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
2932#define DECL_ID(name) \
2935#define INIT_ID(name) \
2936 id_##name = rb_intern(#name)
2939iseq_type_id(
enum rb_iseq_type
type)
2964 case ISEQ_TYPE_TOP:
return id_top;
2965 case ISEQ_TYPE_METHOD:
return id_method;
2966 case ISEQ_TYPE_BLOCK:
return id_block;
2967 case ISEQ_TYPE_CLASS:
return id_class;
2968 case ISEQ_TYPE_RESCUE:
return id_rescue;
2969 case ISEQ_TYPE_ENSURE:
return id_ensure;
2970 case ISEQ_TYPE_EVAL:
return id_eval;
2971 case ISEQ_TYPE_MAIN:
return id_main;
2972 case ISEQ_TYPE_PLAIN:
return id_plain;
2975 rb_bug(
"unsupported iseq type: %d", (
int)
type);
2987 VALUE *seq, *iseq_original;
2989 VALUE val = rb_ary_new();
2991 VALUE locals = rb_ary_new();
2992 VALUE params = rb_hash_new();
2993 VALUE body = rb_ary_new();
2995 VALUE exception = rb_ary_new();
2996 VALUE misc = rb_hash_new();
2998 static ID insn_syms[VM_INSTRUCTION_SIZE/2];
2999 struct st_table *labels_table = st_init_numtable();
3002 if (insn_syms[0] == 0) {
3004 for (i=0; i<numberof(insn_syms); i++) {
3005 insn_syms[i] = rb_intern(insn_name(i));
3010 type = iseq_type_id(iseq_body->type);
3013 for (i=0; i<iseq_body->local_table_size; i++) {
3014 ID lid = iseq_body->local_table[i];
3016 if (rb_id2str(lid)) {
3017 rb_ary_push(locals,
ID2SYM(lid));
3020 rb_ary_push(locals,
ULONG2NUM(iseq_body->local_table_size-i+1));
3024 rb_ary_push(locals,
ID2SYM(rb_intern(
"#arg_rest")));
3030 const struct rb_iseq_param_keyword *
const keyword = iseq_body->
param.keyword;
3033 if (iseq_body->
param.flags.has_opt) {
3034 int len = iseq_body->
param.opt_num + 1;
3037 for (j = 0; j <
len; j++) {
3038 VALUE l = register_label(labels_table, iseq_body->
param.opt_table[j]);
3039 rb_ary_push(arg_opt_labels, l);
3041 rb_hash_aset(params,
ID2SYM(rb_intern(
"opt")), arg_opt_labels);
3045 if (iseq_body->
param.flags.has_lead) rb_hash_aset(params,
ID2SYM(rb_intern(
"lead_num")),
INT2FIX(iseq_body->
param.lead_num));
3046 if (iseq_body->
param.flags.has_post) rb_hash_aset(params,
ID2SYM(rb_intern(
"post_num")),
INT2FIX(iseq_body->
param.post_num));
3047 if (iseq_body->
param.flags.has_post) rb_hash_aset(params,
ID2SYM(rb_intern(
"post_start")),
INT2FIX(iseq_body->
param.post_start));
3048 if (iseq_body->
param.flags.has_rest) rb_hash_aset(params,
ID2SYM(rb_intern(
"rest_start")),
INT2FIX(iseq_body->
param.rest_start));
3049 if (iseq_body->
param.flags.has_block) rb_hash_aset(params,
ID2SYM(rb_intern(
"block_start")),
INT2FIX(iseq_body->
param.block_start));
3050 if (iseq_body->
param.flags.has_kw) {
3051 VALUE keywords = rb_ary_new();
3053 for (i=0; i<keyword->required_num; i++) {
3054 rb_ary_push(keywords,
ID2SYM(keyword->table[i]));
3056 for (j=0; i<keyword->num; i++, j++) {
3057 VALUE key = rb_ary_new_from_args(1,
ID2SYM(keyword->table[i]));
3058 if (!UNDEF_P(keyword->default_values[j])) {
3059 rb_ary_push(key, keyword->default_values[j]);
3061 rb_ary_push(keywords, key);
3064 rb_hash_aset(params,
ID2SYM(rb_intern(
"kwbits")),
3065 INT2FIX(keyword->bits_start));
3066 rb_hash_aset(params,
ID2SYM(rb_intern(
"keyword")), keywords);
3068 if (iseq_body->
param.flags.has_kwrest) rb_hash_aset(params,
ID2SYM(rb_intern(
"kwrest")),
INT2FIX(keyword->rest_start));
3069 if (iseq_body->
param.flags.ambiguous_param0) rb_hash_aset(params,
ID2SYM(rb_intern(
"ambiguous_param0")),
Qtrue);
3073 iseq_original = rb_iseq_original_iseq((
rb_iseq_t *)iseq);
3075 for (seq = iseq_original; seq < iseq_original + iseq_body->iseq_size; ) {
3076 VALUE insn = *seq++;
3077 int j,
len = insn_len(insn);
3081 rb_ary_push(ary,
ID2SYM(insn_syms[insn%numberof(insn_syms)]));
3082 for (j=0; j<
len-1; j++, seq++) {
3083 enum ruby_insn_type_chars op_type = insn_op_type(insn, j);
3087 unsigned long idx = nseq - iseq_original + *seq;
3088 rb_ary_push(ary, register_label(labels_table, idx));
3093 rb_ary_push(ary,
INT2FIX(*seq));
3096 rb_ary_push(ary, obj_resurrect(*seq));
3102 VALUE val = iseq_data_to_ary(rb_iseq_check(iseq));
3103 rb_ary_push(ary, val);
3106 rb_ary_push(ary,
Qnil);
3112 VALUE list = rb_ary_new();
3113 const ID *ids = ((
IC)*seq)->segments;
3115 rb_ary_push(list,
ID2SYM(*ids++));
3117 rb_ary_push(ary, list);
3125 rb_ary_push(ary,
INT2FIX(is - ISEQ_IS_ENTRY_START(ISEQ_BODY(iseq), op_type)));
3132 VALUE e = rb_hash_new();
3133 int argc = vm_ci_argc(ci);
3135 ID mid = vm_ci_mid(ci);
3137 rb_hash_aset(e,
ID2SYM(rb_intern(
"flag")),
UINT2NUM(vm_ci_flag(ci)));
3139 if (vm_ci_flag(ci) & VM_CALL_KWARG) {
3144 argc -= kwarg->keyword_len;
3145 for (i = 0; i < kwarg->keyword_len; i++) {
3146 rb_ary_push(kw, kwarg->keywords[i]);
3148 rb_hash_aset(e,
ID2SYM(rb_intern(
"kw_arg")), kw);
3151 rb_hash_aset(e,
ID2SYM(rb_intern(
"orig_argc")),
3153 rb_ary_push(ary, e);
3157 rb_ary_push(ary,
ID2SYM(*seq));
3162 VALUE val = rb_ary_new();
3169 unsigned long idx = nseq - iseq_original + pos;
3171 rb_ary_store(val, i+1,
3172 register_label(labels_table, idx));
3174 rb_ary_push(ary, val);
3179#if SIZEOF_VALUE <= SIZEOF_LONG
3184 rb_ary_push(ary, val);
3189 VALUE val = rb_hash_new();
3190#if SIZEOF_VALUE <= SIZEOF_LONG
3195 rb_hash_aset(val,
ID2SYM(rb_intern(
"func_ptr")), func_ptr);
3199 rb_ary_push(ary, val);
3203 rb_bug(
"unknown operand: %c", insn_op_type(insn, j));
3206 rb_ary_push(body, ary);
3212 if (iseq_body->catch_table)
for (i=0; i<iseq_body->catch_table->size; i++) {
3213 VALUE ary = rb_ary_new();
3215 UNALIGNED_MEMBER_PTR(iseq_body->catch_table, entries[i]);
3216 rb_ary_push(ary, exception_type2symbol(entry->type));
3218 rb_ary_push(ary, iseq_data_to_ary(rb_iseq_check(entry->iseq)));
3221 rb_ary_push(ary,
Qnil);
3223 rb_ary_push(ary, register_label(labels_table, entry->start));
3224 rb_ary_push(ary, register_label(labels_table, entry->end));
3225 rb_ary_push(ary, register_label(labels_table, entry->cont));
3226 rb_ary_push(ary,
UINT2NUM(entry->sp));
3227 rb_ary_push(exception, ary);
3231 body = rb_ary_new();
3232 prev_insn_info = NULL;
3233#ifdef USE_ISEQ_NODE_ID
3234 VALUE node_ids = rb_ary_new();
3242 if (st_lookup(labels_table, pos, &label)) {
3243 rb_ary_push(body, (
VALUE)label);
3246 info = get_insn_info(iseq, pos);
3247#ifdef USE_ISEQ_NODE_ID
3248 rb_ary_push(node_ids,
INT2FIX(info->node_id));
3251 if (prev_insn_info != info) {
3252 int line = info->line_no;
3255 if (line > 0 && last_line != line) {
3256 rb_ary_push(body,
INT2FIX(line));
3259#define CHECK_EVENT(ev) if (events & ev) rb_ary_push(body, ID2SYM(rb_intern(#ev)));
3269 prev_insn_info = info;
3272 rb_ary_push(body, ary);
3279 rb_hash_aset(misc,
ID2SYM(rb_intern(
"local_size")),
INT2FIX(iseq_body->local_table_size));
3280 rb_hash_aset(misc,
ID2SYM(rb_intern(
"stack_max")),
INT2FIX(iseq_body->stack_max));
3281 rb_hash_aset(misc,
ID2SYM(rb_intern(
"node_id")),
INT2FIX(iseq_body->location.node_id));
3282 rb_hash_aset(misc,
ID2SYM(rb_intern(
"code_location")),
3283 rb_ary_new_from_args(4,
3284 INT2FIX(iseq_body->location.code_location.beg_pos.lineno),
3285 INT2FIX(iseq_body->location.code_location.beg_pos.column),
3286 INT2FIX(iseq_body->location.code_location.end_pos.lineno),
3287 INT2FIX(iseq_body->location.code_location.end_pos.column)));
3288#ifdef USE_ISEQ_NODE_ID
3289 rb_hash_aset(misc,
ID2SYM(rb_intern(
"node_ids")), node_ids);
3297 rb_ary_push(val,
rb_str_new2(
"YARVInstructionSequence/SimpleDataFormat"));
3298 rb_ary_push(val,
INT2FIX(ISEQ_MAJOR_VERSION));
3299 rb_ary_push(val,
INT2FIX(ISEQ_MINOR_VERSION));
3301 rb_ary_push(val, misc);
3302 rb_ary_push(val, iseq_body->location.label);
3303 rb_ary_push(val, rb_iseq_path(iseq));
3304 rb_ary_push(val, rb_iseq_realpath(iseq));
3305 rb_ary_push(val,
RB_INT2NUM(iseq_body->location.first_lineno));
3307 rb_ary_push(val, locals);
3308 rb_ary_push(val, params);
3309 rb_ary_push(val, exception);
3310 rb_ary_push(val, body);
3315rb_iseq_parameters(
const rb_iseq_t *iseq,
int is_proc)
3319 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
3321 ID req, opt, rest, block, key, keyrest;
3322#define PARAM_TYPE(type) rb_ary_push(a = rb_ary_new2(2), ID2SYM(type))
3323#define PARAM_ID(i) body->local_table[(i)]
3324#define PARAM(i, type) ( \
3326 rb_id2str(PARAM_ID(i)) ? \
3327 rb_ary_push(a, ID2SYM(PARAM_ID(i))) : \
3333 for (i = 0; i < body->
param.lead_num; i++) {
3335 rb_ary_push(a, rb_id2str(PARAM_ID(i)) ?
ID2SYM(PARAM_ID(i)) :
Qnil);
3336 rb_ary_push(args, a);
3340 for (i = 0; i < body->
param.lead_num; i++) {
3341 rb_ary_push(args, PARAM(i, req));
3344 r = body->
param.lead_num + body->
param.opt_num;
3345 for (; i < r; i++) {
3347 if (rb_id2str(PARAM_ID(i))) {
3348 rb_ary_push(a,
ID2SYM(PARAM_ID(i)));
3350 rb_ary_push(args, a);
3352 if (body->
param.flags.has_rest) {
3354 rb_ary_push(args, PARAM(body->
param.rest_start, rest));
3356 r = body->
param.post_start + body->
param.post_num;
3358 for (i = body->
param.post_start; i < r; i++) {
3360 rb_ary_push(a, rb_id2str(PARAM_ID(i)) ?
ID2SYM(PARAM_ID(i)) :
Qnil);
3361 rb_ary_push(args, a);
3365 for (i = body->
param.post_start; i < r; i++) {
3366 rb_ary_push(args, PARAM(i, req));
3369 if (body->
param.flags.accepts_no_kwarg) {
3373 rb_ary_push(args, a);
3375 if (body->
param.flags.has_kw) {
3377 if (keyword->required_num > 0) {
3380 for (; i < keyword->required_num; i++) {
3382 if (rb_id2str(keyword->table[i])) {
3383 rb_ary_push(a,
ID2SYM(keyword->table[i]));
3385 rb_ary_push(args, a);
3389 for (; i < keyword->num; i++) {
3391 if (rb_id2str(keyword->table[i])) {
3392 rb_ary_push(a,
ID2SYM(keyword->table[i]));
3394 rb_ary_push(args, a);
3397 if (body->
param.flags.has_kwrest || body->
param.flags.ruby2_keywords) {
3400 PARAM_TYPE(keyrest);
3401 if (body->
param.flags.has_kwrest &&
3402 rb_id2str(param = PARAM_ID(keyword->rest_start))) {
3403 rb_ary_push(a,
ID2SYM(param));
3405 else if (body->
param.flags.ruby2_keywords) {
3406 rb_ary_push(a,
ID2SYM(idPow));
3408 rb_ary_push(args, a);
3410 if (body->
param.flags.has_block) {
3412 rb_ary_push(args, PARAM(body->
param.block_start, block));
3418rb_iseq_defined_string(
enum defined_type
type)
3420 static const char expr_names[][18] = {
3422 "instance-variable",
3438 if ((
unsigned)(
type - 1) >= (
unsigned)numberof(expr_names)) rb_bug(
"unknown defined type %d",
type);
3439 estr = expr_names[
type - 1];
3440 return rb_fstring_cstr(estr);
3450 void *notrace_encoded_insn;
3451 void *trace_encoded_insn;
3453static insn_data_t insn_data[VM_INSTRUCTION_SIZE/2];
3456rb_free_encoded_insn_data(
void)
3458 st_free_table(encoded_insn_data);
3462rb_vm_encoded_insn_data_table_init(
void)
3464#if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
3465 const void *
const *table = rb_vm_get_insns_address_table();
3466#define INSN_CODE(insn) ((VALUE)table[insn])
3468#define INSN_CODE(insn) (insn)
3471 encoded_insn_data = st_init_numtable_with_size(VM_INSTRUCTION_SIZE / 2);
3473 for (insn = 0; insn < VM_INSTRUCTION_SIZE/2; insn++) {
3474 st_data_t key1 = (st_data_t)INSN_CODE(insn);
3475 st_data_t key2 = (st_data_t)INSN_CODE(insn + VM_INSTRUCTION_SIZE/2);
3477 insn_data[insn].insn = (int)insn;
3478 insn_data[insn].insn_len = insn_len(insn);
3480 if (insn != BIN(opt_invokebuiltin_delegate_leave)) {
3481 insn_data[insn].notrace_encoded_insn = (
void *) key1;
3482 insn_data[insn].trace_encoded_insn = (
void *) key2;
3485 insn_data[insn].notrace_encoded_insn = (
void *) INSN_CODE(BIN(opt_invokebuiltin_delegate));
3486 insn_data[insn].trace_encoded_insn = (
void *) INSN_CODE(BIN(opt_invokebuiltin_delegate) + VM_INSTRUCTION_SIZE/2);
3489 st_add_direct(encoded_insn_data, key1, (st_data_t)&insn_data[insn]);
3490 st_add_direct(encoded_insn_data, key2, (st_data_t)&insn_data[insn]);
3495rb_vm_insn_addr2insn(
const void *addr)
3497 st_data_t key = (st_data_t)addr;
3500 if (st_lookup(encoded_insn_data, key, &val)) {
3502 return (
int)e->insn;
3505 rb_bug(
"rb_vm_insn_addr2insn: invalid insn address: %p", addr);
3510rb_vm_insn_addr2opcode(
const void *addr)
3512 st_data_t key = (st_data_t)addr;
3515 if (st_lookup(encoded_insn_data, key, &val)) {
3517 int opcode = e->insn;
3518 if (addr == e->trace_encoded_insn) {
3519 opcode += VM_INSTRUCTION_SIZE/2;
3524 rb_bug(
"rb_vm_insn_addr2opcode: invalid insn address: %p", addr);
3529rb_vm_insn_decode(
const VALUE encoded)
3531#if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
3532 int insn = rb_vm_insn_addr2insn((
void *)encoded);
3534 int insn = (int)encoded;
3540encoded_iseq_trace_instrument(
VALUE *iseq_encoded_insn,
rb_event_flag_t turnon,
bool remain_current_trace)
3542 st_data_t key = (st_data_t)*iseq_encoded_insn;
3545 if (st_lookup(encoded_insn_data, key, &val)) {
3547 if (remain_current_trace && key == (st_data_t)e->trace_encoded_insn) {
3550 *iseq_encoded_insn = (
VALUE) (turnon ? e->trace_encoded_insn : e->notrace_encoded_insn);
3554 rb_bug(
"trace_instrument: invalid insn address: %p", (
void *)*iseq_encoded_insn);
3558rb_iseq_trace_flag_cleared(
const rb_iseq_t *iseq,
size_t pos)
3561 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3562 encoded_iseq_trace_instrument(&iseq_encoded[pos], 0,
false);
3588 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3590 VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
3592 for (pc=0; pc<body->iseq_size;) {
3596 unsigned int line = (int)entry->line_no;
3598 if (target_line == 0 || target_line == line) {
3602 target_events &= ~RUBY_EVENT_LINE;
3605 if (pc_events & target_events) {
3608 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (target_events | iseq->aux.exec.global_trace_events),
true);
3612 if (iseq->aux.exec.local_hooks == NULL) {
3614 iseq->aux.exec.local_hooks->is_local =
true;
3616 rb_hook_list_connect_tracepoint((
VALUE)iseq, iseq->aux.exec.local_hooks, tpval, target_line);
3625 unsigned int target_line;
3630iseq_add_local_tracepoint_i(
const rb_iseq_t *iseq,
void *p)
3633 data->n += iseq_add_local_tracepoint(iseq, data->turnon_events, data->tpval, data->target_line);
3634 iseq_iterate_children(iseq, iseq_add_local_tracepoint_i, p);
3638rb_iseq_add_local_tracepoint_recursively(
const rb_iseq_t *iseq,
rb_event_flag_t turnon_events,
VALUE tpval,
unsigned int target_line,
bool target_bmethod)
3641 if (target_bmethod) {
3642 turnon_events = add_bmethod_events(turnon_events);
3644 data.turnon_events = turnon_events;
3646 data.target_line = target_line;
3649 iseq_add_local_tracepoint_i(iseq, (
void *)&data);
3650 if (0)
rb_funcall(
Qnil, rb_intern(
"puts"), 1, rb_iseq_disasm(iseq));
3659 if (iseq->aux.exec.local_hooks) {
3662 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3665 rb_hook_list_remove_tracepoint(iseq->aux.exec.local_hooks, tpval);
3666 local_events = iseq->aux.exec.local_hooks->events;
3668 if (local_events == 0) {
3669 rb_hook_list_free(iseq->aux.exec.local_hooks);
3670 ((
rb_iseq_t *)iseq)->aux.exec.local_hooks = NULL;
3673 local_events = add_bmethod_events(local_events);
3674 for (pc = 0; pc<body->iseq_size;) {
3676 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (local_events | iseq->aux.exec.global_trace_events),
false);
3688iseq_remove_local_tracepoint_i(
const rb_iseq_t *iseq,
void *p)
3691 data->n += iseq_remove_local_tracepoint(iseq, data->tpval);
3692 iseq_iterate_children(iseq, iseq_remove_local_tracepoint_i, p);
3696rb_iseq_remove_local_tracepoint_recursively(
const rb_iseq_t *iseq,
VALUE tpval)
3702 iseq_remove_local_tracepoint_i(iseq, (
void *)&data);
3709 if (iseq->aux.exec.global_trace_events == turnon_events) {
3713 if (!ISEQ_EXECUTABLE_P(iseq)) {
3720 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3722 rb_event_flag_t local_events = iseq->aux.exec.local_hooks ? iseq->aux.exec.local_hooks->events : 0;
3723 ((
rb_iseq_t *)iseq)->aux.exec.global_trace_events = turnon_events;
3724 enabled_events = add_bmethod_events(turnon_events | local_events);
3726 for (pc=0; pc<body->iseq_size;) {
3728 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & enabled_events,
true);
3736clear_attr_cc(
VALUE v)
3738 if (imemo_type_p(v, imemo_callcache) && vm_cc_ivar_p((
const struct rb_callcache *)v)) {
3750 if (imemo_type_p(v, imemo_callcache) && vm_cc_bf_p((
const struct rb_callcache *)v)) {
3760clear_attr_ccs_i(
void *vstart,
void *vend,
size_t stride,
void *data)
3763 for (; v != (
VALUE)vend; v += stride) {
3764 void *ptr = asan_poisoned_object_p(v);
3765 asan_unpoison_object(v,
false);
3767 asan_poison_object_if(ptr, v);
3773rb_clear_attr_ccs(
void)
3775 rb_objspace_each_objects(clear_attr_ccs_i, NULL);
3779clear_bf_ccs_i(
void *vstart,
void *vend,
size_t stride,
void *data)
3782 for (; v != (
VALUE)vend; v += stride) {
3783 void *ptr = asan_poisoned_object_p(v);
3784 asan_unpoison_object(v,
false);
3786 asan_poison_object_if(ptr, v);
3792rb_clear_bf_ccs(
void)
3794 rb_objspace_each_objects(clear_bf_ccs_i, NULL);
3798trace_set_i(
void *vstart,
void *vend,
size_t stride,
void *data)
3803 for (; v != (
VALUE)vend; v += stride) {
3804 void *ptr = asan_poisoned_object_p(v);
3805 asan_unpoison_object(v,
false);
3807 if (rb_obj_is_iseq(v)) {
3808 rb_iseq_trace_set(rb_iseq_check((
rb_iseq_t *)v), turnon_events);
3810 else if (clear_attr_cc(v)) {
3812 else if (clear_bf_cc(v)) {
3815 asan_poison_object_if(ptr, v);
3823 rb_objspace_each_objects(trace_set_i, &turnon_events);
3827rb_iseqw_local_variables(
VALUE iseqval)
3829 return rb_iseq_local_variables(iseqw_check(iseqval));
3850iseqw_to_binary(
int argc,
VALUE *argv,
VALUE self)
3853 return rb_iseq_ibf_dump(iseqw_check(self), opt);
3870iseqw_s_load_from_binary(
VALUE self,
VALUE str)
3872 return iseqw_new(rb_iseq_ibf_load(str));
3882iseqw_s_load_from_binary_extra_data(
VALUE self,
VALUE str)
3884 return rb_iseq_ibf_load_extra_data(str);
3887#if VM_INSN_INFO_TABLE_IMPL == 2
3920#define IMMEDIATE_TABLE_SIZE 54
3922struct succ_index_table {
3923 uint64_t imm_part[IMMEDIATE_TABLE_SIZE / 9];
3924 struct succ_dict_block {
3926 uint64_t small_block_ranks;
3927 uint64_t bits[512/64];
3928 } succ_part[FLEX_ARY_LEN];
3931#define imm_block_rank_set(v, i, r) (v) |= (uint64_t)(r) << (7 * (i))
3932#define imm_block_rank_get(v, i) (((int)((v) >> ((i) * 7))) & 0x7f)
3933#define small_block_rank_set(v, i, r) (v) |= (uint64_t)(r) << (9 * ((i) - 1))
3934#define small_block_rank_get(v, i) ((i) == 0 ? 0 : (((int)((v) >> (((i) - 1) * 9))) & 0x1ff))
3936static struct succ_index_table *
3937succ_index_table_create(
int max_pos,
int *data,
int size)
3939 const int imm_size = (max_pos < IMMEDIATE_TABLE_SIZE ? max_pos + 8 : IMMEDIATE_TABLE_SIZE) / 9;
3940 const int succ_size = (max_pos < IMMEDIATE_TABLE_SIZE ? 0 : (max_pos - IMMEDIATE_TABLE_SIZE + 511)) / 512;
3941 struct succ_index_table *sd =
3942 rb_xcalloc_mul_add_mul(
3943 imm_size,
sizeof(uint64_t),
3944 succ_size,
sizeof(
struct succ_dict_block));
3948 for (j = 0; j < imm_size; j++) {
3949 for (i = 0; i < 9; i++) {
3950 if (r < size && data[r] == j * 9 + i) r++;
3951 imm_block_rank_set(sd->imm_part[j], i, r);
3954 for (k = 0; k < succ_size; k++) {
3955 struct succ_dict_block *sd_block = &sd->succ_part[k];
3958 for (j = 0; j < 8; j++) {
3960 if (j) small_block_rank_set(sd_block->small_block_ranks, j, small_rank);
3961 for (i = 0; i < 64; i++) {
3962 if (r < size && data[r] == k * 512 + j * 64 + i + IMMEDIATE_TABLE_SIZE) {
3963 bits |= ((uint64_t)1) << i;
3967 sd_block->bits[j] = bits;
3968 small_rank += rb_popcount64(bits);
3974static unsigned int *
3975succ_index_table_invert(
int max_pos,
struct succ_index_table *sd,
int size)
3977 const int imm_size = (max_pos < IMMEDIATE_TABLE_SIZE ? max_pos + 8 : IMMEDIATE_TABLE_SIZE) / 9;
3978 const int succ_size = (max_pos < IMMEDIATE_TABLE_SIZE ? 0 : (max_pos - IMMEDIATE_TABLE_SIZE + 511)) / 512;
3979 unsigned int *positions =
ALLOC_N(
unsigned int, size), *p;
3980 int i, j, k, r = -1;
3982 for (j = 0; j < imm_size; j++) {
3983 for (i = 0; i < 9; i++) {
3984 int nr = imm_block_rank_get(sd->imm_part[j], i);
3985 if (r != nr) *p++ = j * 9 + i;
3989 for (k = 0; k < succ_size; k++) {
3990 for (j = 0; j < 8; j++) {
3991 for (i = 0; i < 64; i++) {
3992 if (sd->succ_part[k].bits[j] & (((uint64_t)1) << i)) {
3993 *p++ = k * 512 + j * 64 + i + IMMEDIATE_TABLE_SIZE;
4002succ_index_lookup(
const struct succ_index_table *sd,
int x)
4004 if (x < IMMEDIATE_TABLE_SIZE) {
4005 const int i = x / 9;
4006 const int j = x % 9;
4007 return imm_block_rank_get(sd->imm_part[i], j);
4010 const int block_index = (x - IMMEDIATE_TABLE_SIZE) / 512;
4011 const struct succ_dict_block *block = &sd->succ_part[block_index];
4012 const int block_bit_index = (x - IMMEDIATE_TABLE_SIZE) % 512;
4013 const int small_block_index = block_bit_index / 64;
4014 const int small_block_popcount = small_block_rank_get(block->small_block_ranks, small_block_index);
4015 const int popcnt = rb_popcount64(block->bits[small_block_index] << (63 - block_bit_index % 64));
4017 return block->rank + small_block_popcount + popcnt;
4036iseqw_script_lines(
VALUE self)
4038 const rb_iseq_t *iseq = iseqw_check(self);
4039 return ISEQ_BODY(iseq)->variable.script_lines;
#define RUBY_ASSERT(expr)
Asserts that the given expression is truthy if and only if RUBY_DEBUG is truthy.
#define rb_define_method(klass, mid, func, arity)
Defines klass#mid.
#define rb_define_singleton_method(klass, mid, func, arity)
Defines klass.mid.
#define rb_define_private_method(klass, mid, func, arity)
Defines klass#mid and makes it private.
#define RUBY_EVENT_END
Encountered an end of a class clause.
#define RUBY_EVENT_C_CALL
A method, written in C, is called.
#define RUBY_EVENT_B_RETURN
Encountered a next statement.
#define RUBY_EVENT_CLASS
Encountered a new class.
#define RUBY_EVENT_LINE
Encountered a new line.
#define RUBY_EVENT_RETURN
Encountered a return statement.
#define RUBY_EVENT_C_RETURN
Return from a method, written in C.
#define RUBY_EVENT_B_CALL
Encountered an yield statement.
uint32_t rb_event_flag_t
Represents event(s).
#define RUBY_EVENT_CALL
A method, written in Ruby, is called.
#define RUBY_EVENT_RESCUE
Encountered a rescue statement.
#define RB_OBJ_FREEZE
Just another name of rb_obj_freeze_inline.
VALUE rb_define_class_under(VALUE outer, const char *name, VALUE super)
Defines a class under the namespace of outer.
void rb_undef_method(VALUE klass, const char *name)
Defines an undef of a method.
int rb_scan_args(int argc, const VALUE *argv, const char *fmt,...)
Retrieves argument from argc and argv to given VALUE references according to the format string.
#define rb_str_new2
Old name of rb_str_new_cstr.
#define T_FILE
Old name of RUBY_T_FILE.
#define T_STRING
Old name of RUBY_T_STRING.
#define Qundef
Old name of RUBY_Qundef.
#define INT2FIX
Old name of RB_INT2FIX.
#define rb_str_cat2
Old name of rb_str_cat_cstr.
#define ID2SYM
Old name of RB_ID2SYM.
#define SPECIAL_CONST_P
Old name of RB_SPECIAL_CONST_P.
#define ULONG2NUM
Old name of RB_ULONG2NUM.
#define ZALLOC
Old name of RB_ZALLOC.
#define LL2NUM
Old name of RB_LL2NUM.
#define CLASS_OF
Old name of rb_class_of.
#define T_NONE
Old name of RUBY_T_NONE.
#define FIX2INT
Old name of RB_FIX2INT.
#define T_HASH
Old name of RUBY_T_HASH.
#define ALLOC_N
Old name of RB_ALLOC_N.
#define FL_TEST_RAW
Old name of RB_FL_TEST_RAW.
#define LONG2NUM
Old name of RB_LONG2NUM.
#define Qtrue
Old name of RUBY_Qtrue.
#define NUM2INT
Old name of RB_NUM2INT.
#define INT2NUM
Old name of RB_INT2NUM.
#define Qnil
Old name of RUBY_Qnil.
#define Qfalse
Old name of RUBY_Qfalse.
#define T_ARRAY
Old name of RUBY_T_ARRAY.
#define NIL_P
Old name of RB_NIL_P.
#define BUILTIN_TYPE
Old name of RB_BUILTIN_TYPE.
#define NUM2LONG
Old name of RB_NUM2LONG.
#define UINT2NUM
Old name of RB_UINT2NUM.
#define FIXNUM_P
Old name of RB_FIXNUM_P.
#define CONST_ID
Old name of RUBY_CONST_ID.
#define rb_ary_new2
Old name of rb_ary_new_capa.
VALUE rb_eTypeError
TypeError exception.
VALUE rb_eSyntaxError
SyntaxError exception.
VALUE rb_class_superclass(VALUE klass)
Queries the parent of the given class.
VALUE rb_obj_class(VALUE obj)
Queries the class of an object.
VALUE rb_inspect(VALUE obj)
Generates a human-readable textual representation of the given object.
#define RB_OBJ_WRITTEN(old, oldv, young)
Identical to RB_OBJ_WRITE(), except it doesn't write any values, but only a WB declaration.
#define RB_OBJ_WRITE(old, slot, young)
Declaration of a "back" pointer.
VALUE rb_funcall(VALUE recv, ID mid, int n,...)
Calls a method.
static int rb_check_arity(int argc, int min, int max)
Ensures that the passed integer is in the passed range.
VALUE rb_file_open_str(VALUE fname, const char *fmode)
Identical to rb_file_open(), except it takes the pathname as a Ruby's string instead of C's.
VALUE rb_io_close(VALUE io)
Closes the IO.
int rb_is_local_id(ID id)
Classifies the given ID, then sees if it is a local variable.
VALUE rb_obj_is_method(VALUE recv)
Queries if the given object is a method.
VALUE rb_obj_is_proc(VALUE recv)
Queries if the given object is a proc.
VALUE rb_str_append(VALUE dst, VALUE src)
Identical to rb_str_buf_append(), except it converts the right hand side before concatenating.
#define rb_str_new(str, len)
Allocates an instance of rb_cString.
#define rb_exc_new_cstr(exc, str)
Identical to rb_exc_new(), except it assumes the passed pointer is a pointer to a C string.
VALUE rb_str_resurrect(VALUE str)
I guess there is no use case of this function in extension libraries, but this is a routine identical...
VALUE rb_str_inspect(VALUE str)
Generates a "readable" version of the receiver.
int rb_str_cmp(VALUE lhs, VALUE rhs)
Compares two strings, as in strcmp(3).
VALUE rb_str_concat(VALUE dst, VALUE src)
Identical to rb_str_append(), except it also accepts an integer as a codepoint.
#define rb_str_cat_cstr(buf, str)
Identical to rb_str_cat(), except it assumes the passed pointer is a pointer to a C string.
void rb_str_modify_expand(VALUE str, long capa)
Identical to rb_str_modify(), except it additionally expands the capacity of the receiver.
#define rb_str_new_cstr(str)
Identical to rb_str_new, except it assumes the passed pointer is a pointer to a C string.
VALUE rb_class_name(VALUE obj)
Queries the name of the given object's class.
int rb_respond_to(VALUE obj, ID mid)
Queries if the object responds to the method.
void rb_undef_alloc_func(VALUE klass)
Deletes the allocator function of a class.
VALUE rb_check_funcall(VALUE recv, ID mid, int argc, const VALUE *argv)
Identical to rb_funcallv(), except it returns RUBY_Qundef instead of raising rb_eNoMethodError.
ID rb_check_id(volatile VALUE *namep)
Detects if the given name is already interned or not.
VALUE rb_sym2str(VALUE id)
Identical to rb_id2str(), except it takes an instance of rb_cSymbol rather than an ID.
int len
Length of the buffer.
#define RB_NUM2INT
Just another name of rb_num2int_inline.
#define RB_INT2NUM
Just another name of rb_int2num_inline.
VALUE rb_yield(VALUE val)
Yields the block.
#define RB_GC_GUARD(v)
Prevents premature destruction of local objects.
#define RB_ZALLOC(type)
Shorthand of RB_ZALLOC_N with n=1.
VALUE type(ANYARGS)
ANYARGS-ed function type.
void rb_hash_foreach(VALUE q, int_type *w, VALUE e)
Iteration over the given hash.
#define RARRAY_LEN
Just another name of rb_array_len.
static int RARRAY_LENINT(VALUE ary)
Identical to rb_array_len(), except it differs for the return type.
#define RARRAY_AREF(a, i)
static VALUE RBASIC_CLASS(VALUE obj)
Queries the class of an object.
#define DATA_PTR(obj)
Convenient getter macro.
#define RHASH_SIZE(h)
Queries the size of the hash.
#define StringValue(v)
Ensures that the parameter object is a String.
#define StringValueCStr(v)
Identical to StringValuePtr, except it additionally checks for the contents for viability as a C stri...
#define TypedData_Wrap_Struct(klass, data_type, sval)
Converts sval, a pointer to your struct, into a Ruby object.
#define FilePathValue(v)
Ensures that the parameter object is a path.
#define RTEST
This is an old name of RB_TEST.
const ID * segments
A null-terminated list of ids, used to represent a constant's path idNULL is used to represent the ::...
A line and column in a string.
size_t column
The column number.
size_t line
The line number.
This represents a range of bytes in the source string to which a node or token corresponds.
const uint8_t * start
A pointer to the start location of the range in the source.
const uint8_t * end
A pointer to the end location of the range in the source.
A list of offsets of newlines in a string.
This is the base structure that represents a node in the syntax tree.
pm_location_t location
This is the location of the node in the source.
The options that can be passed to the parser.
This struct represents the overall parser.
pm_newline_list_t newline_list
This is the list of newline offsets in the source file.
A generic string type that can have various ownership semantics.
This is the struct that holds necessary info for a struct.
struct rb_iseq_constant_body::@151 param
parameter information
intptr_t SIGNED_VALUE
A signed integer type that has the same width with VALUE.
uintptr_t ID
Type that represents a Ruby identifier such as a variable name.
uintptr_t VALUE
Type that represents a Ruby object.
static void Check_Type(VALUE v, enum ruby_value_type t)
Identical to RB_TYPE_P(), except it raises exceptions on predication failure.
ruby_value_type
C-level type of an object.