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/io.h"
32#include "internal/ruby_parser.h"
33#include "internal/sanitizers.h"
34#include "internal/set_table.h"
35#include "internal/symbol.h"
36#include "internal/thread.h"
37#include "internal/variable.h"
41#include "vm_callinfo.h"
46#include "insns_info.inc"
53#if VM_INSN_INFO_TABLE_IMPL == 2
54static struct succ_index_table *succ_index_table_create(
int max_pos,
int *data,
int size);
55static unsigned int *succ_index_table_invert(
int max_pos,
struct succ_index_table *sd,
int size);
56static int succ_index_lookup(
const struct succ_index_table *sd,
int x);
59#define hidden_obj_p(obj) (!SPECIAL_CONST_P(obj) && !RBASIC(obj)->klass)
62obj_resurrect(
VALUE obj)
64 if (hidden_obj_p(obj)) {
73 obj = rb_hash_resurrect(obj);
98 free_arena(compile_data->node.storage_head);
99 free_arena(compile_data->insn.storage_head);
100 if (compile_data->ivar_cache_table) {
101 rb_id_table_free(compile_data->ivar_cache_table);
103 ruby_xfree(compile_data);
108remove_from_constant_cache(
ID id,
IC ic)
112 st_data_t ic_data = (st_data_t)ic;
114 if (rb_id_table_lookup(vm->constant_cache,
id, &lookup_result)) {
116 set_table_delete(ics, &ic_data);
118 if (ics->num_entries == 0 &&
120 id != vm->inserting_constant_cache_id) {
121 rb_id_table_delete(vm->constant_cache,
id);
131iseq_clear_ic_references(
const rb_iseq_t *iseq)
137 if (!ISEQ_BODY(iseq)->is_entries) {
141 for (
unsigned int ic_idx = 0; ic_idx < ISEQ_BODY(iseq)->ic_size; ic_idx++) {
142 IC ic = &ISEQ_IS_IC_ENTRY(ISEQ_BODY(iseq), ic_idx);
150 if (segments == NULL)
153 for (
int i = 0; segments[i]; i++) {
155 if (
id == idNULL)
continue;
156 remove_from_constant_cache(
id, ic);
159 ruby_xfree((
void *)segments);
166 RUBY_FREE_ENTER(
"iseq");
168 if (iseq && ISEQ_BODY(iseq)) {
169 iseq_clear_ic_references(iseq);
172 rb_yjit_iseq_free(iseq);
175 rb_yjit_live_iseq_count--;
178 ruby_xfree((
void *)body->iseq_encoded);
179 ruby_xfree((
void *)body->insns_info.body);
180 ruby_xfree((
void *)body->insns_info.positions);
181#if VM_INSN_INFO_TABLE_IMPL == 2
182 ruby_xfree(body->insns_info.succ_index_table);
184 ruby_xfree((
void *)body->is_entries);
185 ruby_xfree(body->call_data);
186 ruby_xfree((
void *)body->catch_table);
187 ruby_xfree((
void *)body->
param.opt_table);
188 if (ISEQ_MBITS_BUFLEN(body->iseq_size) > 1 && body->mark_bits.list) {
189 ruby_xfree((
void *)body->mark_bits.list);
192 ruby_xfree(body->variable.original_iseq);
194 if (body->
param.keyword != NULL) {
195 if (body->
param.keyword->table != &body->local_table[body->
param.keyword->bits_start - body->
param.keyword->num])
196 ruby_xfree((
void *)body->
param.keyword->table);
197 if (body->
param.keyword->default_values) {
198 ruby_xfree((
void *)body->
param.keyword->default_values);
200 ruby_xfree((
void *)body->
param.keyword);
202 if (LIKELY(body->local_table != rb_iseq_shared_exc_local_tbl))
203 ruby_xfree((
void *)body->local_table);
204 compile_data_free(ISEQ_COMPILE_DATA(iseq));
205 if (body->outer_variables) rb_id_table_free(body->outer_variables);
209 if (iseq && ISEQ_EXECUTABLE_P(iseq) && iseq->aux.exec.local_hooks) {
210 rb_hook_list_free(iseq->aux.exec.local_hooks);
213 RUBY_FREE_LEAVE(
"iseq");
216typedef VALUE iseq_value_itr_t(
void *ctx,
VALUE obj);
219iseq_scan_bits(
unsigned int page, iseq_bits_t bits,
VALUE *code,
VALUE *original_iseq)
222 unsigned int page_offset = (page * ISEQ_MBITS_BITLENGTH);
225 offset = ntz_intptr(bits);
226 VALUE op = code[page_offset + offset];
227 rb_gc_mark_and_move(&code[page_offset + offset]);
228 VALUE newop = code[page_offset + offset];
229 if (original_iseq && newop != op) {
230 original_iseq[page_offset + offset] = newop;
237rb_iseq_mark_and_move_each_compile_data_value(
const rb_iseq_t *iseq,
VALUE *original_iseq)
243 size = compile_data->iseq_size;
244 code = compile_data->iseq_encoded;
247 if (compile_data->mark_bits.list) {
248 if(compile_data->is_single_mark_bit) {
249 iseq_scan_bits(0, compile_data->mark_bits.single, code, original_iseq);
252 for (
unsigned int i = 0; i < ISEQ_MBITS_BUFLEN(size); i++) {
253 iseq_bits_t bits = compile_data->mark_bits.list[i];
254 iseq_scan_bits(i, bits, code, original_iseq);
260rb_iseq_mark_and_move_each_body_value(
const rb_iseq_t *iseq,
VALUE *original_iseq)
266 size = body->iseq_size;
267 code = body->iseq_encoded;
271 if (body->is_entries) {
273 is_entries += body->ivc_size;
276 for (
unsigned int i = 0; i < body->icvarc_size; i++, is_entries++) {
281 rb_gc_mark_and_move(&icvarc->entry->class_value);
286 for (
unsigned int i = 0; i < body->ise_size; i++, is_entries++) {
288 if (is->once.value) {
289 rb_gc_mark_and_move(&is->once.value);
294 for (
unsigned int i = 0; i < body->ic_size; i++, is_entries++) {
295 IC ic = (
IC)is_entries;
297 rb_gc_mark_and_move_ptr(&ic->entry);
303 if (body->mark_bits.list) {
304 if (ISEQ_MBITS_BUFLEN(size) == 1) {
305 iseq_scan_bits(0, body->mark_bits.single, code, original_iseq);
308 for (
unsigned int i = 0; i < ISEQ_MBITS_BUFLEN(size); i++) {
309 iseq_bits_t bits = body->mark_bits.list[i];
310 iseq_scan_bits(i, bits, code, original_iseq);
317cc_is_active(
const struct rb_callcache *cc,
bool reference_updating)
320 if (cc == rb_vm_empty_cc() || rb_vm_empty_cc_for_super()) {
324 if (reference_updating) {
328 if (vm_cc_markable(cc)) {
331 if (reference_updating) {
334 if (!METHOD_ENTRY_INVALIDATED(cme)) {
344rb_iseq_mark_and_move(
rb_iseq_t *iseq,
bool reference_updating)
346 RUBY_MARK_ENTER(
"iseq");
348 rb_gc_mark_and_move(&iseq->wrapper);
350 if (ISEQ_BODY(iseq)) {
353 rb_iseq_mark_and_move_each_body_value(iseq, reference_updating ? ISEQ_ORIGINAL_ISEQ(iseq) : NULL);
355 rb_gc_mark_and_move(&body->variable.coverage);
356 rb_gc_mark_and_move(&body->variable.pc2branchindex);
357 rb_gc_mark_and_move(&body->variable.script_lines);
358 rb_gc_mark_and_move(&body->location.label);
359 rb_gc_mark_and_move(&body->location.base_label);
360 rb_gc_mark_and_move(&body->location.pathobj);
361 if (body->local_iseq) rb_gc_mark_and_move_ptr(&body->local_iseq);
362 if (body->parent_iseq) rb_gc_mark_and_move_ptr(&body->parent_iseq);
363 if (body->mandatory_only_iseq) rb_gc_mark_and_move_ptr(&body->mandatory_only_iseq);
365 if (body->call_data) {
366 for (
unsigned int i = 0; i < body->ci_size; i++) {
369 if (cds[i].ci) rb_gc_mark_and_move_ptr(&cds[i].ci);
371 if (cc_is_active(cds[i].cc, reference_updating)) {
372 rb_gc_mark_and_move_ptr(&cds[i].cc);
374 else if (cds[i].cc != rb_vm_empty_cc()) {
375 cds[i].cc = rb_vm_empty_cc();
380 if (body->
param.flags.has_kw && body->
param.keyword != NULL) {
381 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
383 if (keyword->default_values != NULL) {
384 for (
int j = 0, i = keyword->required_num; i < keyword->num; i++, j++) {
385 rb_gc_mark_and_move(&keyword->default_values[j]);
390 if (body->catch_table) {
393 for (
unsigned int i = 0; i < table->size; i++) {
395 entry = UNALIGNED_MEMBER_PTR(table, entries[i]);
397 rb_gc_mark_and_move_ptr(&entry->iseq);
402 if (reference_updating) {
404 rb_yjit_iseq_update_references(iseq);
407 rb_zjit_iseq_update_references(body->zjit_payload);
412 rb_yjit_iseq_mark(body->yjit_payload);
415 rb_zjit_iseq_mark(body->zjit_payload);
421 rb_gc_mark_and_move(&iseq->aux.loader.obj);
426 rb_iseq_mark_and_move_insn_storage(compile_data->insn.storage_head);
427 rb_iseq_mark_and_move_each_compile_data_value(iseq, reference_updating ? ISEQ_ORIGINAL_ISEQ(iseq) : NULL);
429 rb_gc_mark_and_move((
VALUE *)&compile_data->err_info);
430 rb_gc_mark_and_move((
VALUE *)&compile_data->catch_table_ary);
434 VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
436 if (iseq->aux.exec.local_hooks) {
437 rb_hook_list_mark_and_update(iseq->aux.exec.local_hooks);
441 RUBY_MARK_LEAVE(
"iseq");
445param_keyword_size(
const struct rb_iseq_param_keyword *pkw)
449 if (!pkw)
return size;
451 size +=
sizeof(
struct rb_iseq_param_keyword);
452 size +=
sizeof(
VALUE) * (pkw->num - pkw->required_num);
466 if (ISEQ_EXECUTABLE_P(iseq) && body) {
468 size += body->iseq_size *
sizeof(
VALUE);
470 size += body->local_table_size *
sizeof(
ID);
471 size += ISEQ_MBITS_BUFLEN(body->iseq_size) * ISEQ_MBITS_SIZE;
472 if (body->catch_table) {
473 size += iseq_catch_table_bytes(body->catch_table->size);
475 size += (body->
param.opt_num + 1) *
sizeof(
VALUE);
476 size += param_keyword_size(body->
param.keyword);
481 if (ISEQ_BODY(iseq)->is_entries) {
483 for (
unsigned int ic_idx = 0; ic_idx < body->ic_size; ic_idx++) {
484 IC ic = &ISEQ_IS_IC_ENTRY(body, ic_idx);
499 compile_data = ISEQ_COMPILE_DATA(iseq);
505 cur = compile_data->node.storage_head;
516rb_iseq_constant_body_alloc(
void)
527 ISEQ_BODY(iseq) = rb_iseq_constant_body_alloc();
532rb_iseq_pathobj_new(
VALUE path,
VALUE realpath)
538 if (path == realpath ||
540 pathobj = rb_fstring(path);
543 if (!
NIL_P(realpath)) realpath = rb_fstring(realpath);
544 pathobj = rb_ary_new_from_args(2, rb_fstring(path), realpath);
554 rb_iseq_pathobj_new(path, realpath));
559rb_iseq_alloc_with_dummy_path(
VALUE fname)
563 ISEQ_BODY(dummy_iseq)->type = ISEQ_TYPE_TOP;
564 RB_OBJ_WRITE(dummy_iseq, &ISEQ_BODY(dummy_iseq)->location.pathobj, fname);
565 RB_OBJ_WRITE(dummy_iseq, &ISEQ_BODY(dummy_iseq)->location.label, fname);
575 rb_iseq_pathobj_set(iseq, path, realpath);
578 loc->first_lineno = first_lineno;
580 if (ISEQ_BODY(iseq)->local_iseq == iseq && strcmp(RSTRING_PTR(name),
"initialize") == 0) {
581 ISEQ_BODY(iseq)->param.flags.use_block = 1;
585 loc->node_id = node_id;
586 loc->code_location = *code_location;
589 loc->code_location.beg_pos.lineno = 0;
590 loc->code_location.beg_pos.column = 0;
591 loc->code_location.end_pos.lineno = -1;
592 loc->code_location.end_pos.column = -1;
605 if (
type == ISEQ_TYPE_TOP) {
606 body->local_iseq = iseq;
608 else if (
type == ISEQ_TYPE_METHOD ||
type == ISEQ_TYPE_CLASS) {
609 body->local_iseq = iseq;
612 RB_OBJ_WRITE(iseq, &body->local_iseq, ISEQ_BODY(piseq)->local_iseq);
619 if (
type == ISEQ_TYPE_MAIN) {
620 body->local_iseq = iseq;
629 ALLOC_N(
char, INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE +
634 new_arena->size = INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE;
642 const rb_iseq_t *parent,
int isolated_depth,
enum rb_iseq_type
type,
649 if (parent && (
type == ISEQ_TYPE_MAIN ||
type == ISEQ_TYPE_TOP))
653 set_relation(iseq, parent);
655 name = rb_fstring(name);
656 iseq_location_setup(iseq, name, path, realpath, first_lineno, code_location, node_id);
657 if (iseq != body->local_iseq) {
658 RB_OBJ_WRITE(iseq, &body->location.base_label, ISEQ_BODY(body->local_iseq)->location.label);
660 ISEQ_COVERAGE_SET(iseq,
Qnil);
661 ISEQ_ORIGINAL_ISEQ_CLEAR(iseq);
662 body->variable.flip_count = 0;
664 if (
NIL_P(script_lines)) {
671 ISEQ_COMPILE_DATA_ALLOC(iseq);
672 RB_OBJ_WRITE(iseq, &ISEQ_COMPILE_DATA(iseq)->err_info, err_info);
675 ISEQ_COMPILE_DATA(iseq)->node.storage_head = ISEQ_COMPILE_DATA(iseq)->node.storage_current = new_arena();
676 ISEQ_COMPILE_DATA(iseq)->insn.storage_head = ISEQ_COMPILE_DATA(iseq)->insn.storage_current = new_arena();
677 ISEQ_COMPILE_DATA(iseq)->isolated_depth = isolated_depth;
678 ISEQ_COMPILE_DATA(iseq)->option = option;
679 ISEQ_COMPILE_DATA(iseq)->ivar_cache_table = NULL;
680 ISEQ_COMPILE_DATA(iseq)->builtin_function_table = GET_VM()->builtin_function_table;
682 if (option->coverage_enabled) {
683 VALUE coverages = rb_get_coverages();
684 if (
RTEST(coverages)) {
685 coverage = rb_hash_lookup(coverages, rb_iseq_path(iseq));
689 ISEQ_COVERAGE_SET(iseq, coverage);
690 if (coverage && ISEQ_BRANCH_COVERAGE(iseq))
696#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
697static void validate_get_insn_info(
const rb_iseq_t *iseq);
701rb_iseq_insns_info_encode_positions(
const rb_iseq_t *iseq)
703#if VM_INSN_INFO_TABLE_IMPL == 2
706 int size = body->insns_info.size;
707 int max_pos = body->iseq_size;
708 int *data = (
int *)body->insns_info.positions;
709 if (body->insns_info.succ_index_table) ruby_xfree(body->insns_info.succ_index_table);
710 body->insns_info.succ_index_table = succ_index_table_create(max_pos, data, size);
711#if VM_CHECK_MODE == 0
712 ruby_xfree(body->insns_info.positions);
713 body->insns_info.positions = NULL;
718#if VM_INSN_INFO_TABLE_IMPL == 2
722 int size = body->insns_info.size;
723 int max_pos = body->iseq_size;
724 struct succ_index_table *sd = body->insns_info.succ_index_table;
725 return succ_index_table_invert(max_pos, sd, size);
732 iseq->aux.exec.global_trace_events = 0;
733 if (ruby_vm_event_enabled_global_flags & ISEQ_TRACE_EVENTS) {
734 rb_iseq_trace_set(iseq, ruby_vm_event_enabled_global_flags & ISEQ_TRACE_EVENTS);
743 VALUE err = data->err_info;
744 ISEQ_COMPILE_DATA_CLEAR(iseq);
745 compile_data_free(data);
747#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
748 validate_get_insn_info(iseq);
752 VALUE path = pathobj_path(body->location.pathobj);
754 rb_funcallv(err, rb_intern(
"set_backtrace"), 1, &path);
758 RB_DEBUG_COUNTER_INC(iseq_num);
759 RB_DEBUG_COUNTER_ADD(iseq_cd_num, ISEQ_BODY(iseq)->ci_size);
761 rb_iseq_init_trace(iseq);
766 .inline_const_cache = OPT_INLINE_CONST_CACHE,
767 .peephole_optimization = OPT_PEEPHOLE_OPTIMIZATION,
768 .tailcall_optimization = OPT_TAILCALL_OPTIMIZATION,
769 .specialized_instruction = OPT_SPECIALISED_INSTRUCTION,
770 .operands_unification = OPT_OPERANDS_UNIFICATION,
771 .instructions_unification = OPT_INSTRUCTIONS_UNIFICATION,
772 .frozen_string_literal = OPT_FROZEN_STRING_LITERAL,
773 .debug_frozen_string_literal = OPT_DEBUG_FROZEN_STRING_LITERAL,
774 .coverage_enabled = TRUE,
778 .frozen_string_literal = -1,
782rb_iseq_opt_frozen_string_literal(
void)
784 return COMPILE_OPTION_DEFAULT.frozen_string_literal;
790#define SET_COMPILE_OPTION(o, h, mem) \
791 { VALUE flag = rb_hash_aref((h), ID2SYM(rb_intern(#mem))); \
792 if (flag == Qtrue) { (o)->mem = 1; } \
793 else if (flag == Qfalse) { (o)->mem = 0; } \
795#define SET_COMPILE_OPTION_NUM(o, h, mem) \
796 { VALUE num = rb_hash_aref((h), ID2SYM(rb_intern(#mem))); \
797 if (!NIL_P(num)) (o)->mem = NUM2INT(num); \
799 SET_COMPILE_OPTION(option, opt, inline_const_cache);
800 SET_COMPILE_OPTION(option, opt, peephole_optimization);
801 SET_COMPILE_OPTION(option, opt, tailcall_optimization);
802 SET_COMPILE_OPTION(option, opt, specialized_instruction);
803 SET_COMPILE_OPTION(option, opt, operands_unification);
804 SET_COMPILE_OPTION(option, opt, instructions_unification);
805 SET_COMPILE_OPTION(option, opt, frozen_string_literal);
806 SET_COMPILE_OPTION(option, opt, debug_frozen_string_literal);
807 SET_COMPILE_OPTION(option, opt, coverage_enabled);
808 SET_COMPILE_OPTION_NUM(option, opt, debug_level);
809#undef SET_COMPILE_OPTION
810#undef SET_COMPILE_OPTION_NUM
816#define SET_COMPILE_OPTION(o, a, mem) \
817 ((a)->mem < 0 ? 0 : ((o)->mem = (a)->mem > 0))
818 SET_COMPILE_OPTION(option, ast, coverage_enabled);
819#undef SET_COMPILE_OPTION
820 if (ast->frozen_string_literal >= 0) {
821 option->frozen_string_literal = ast->frozen_string_literal;
830 *option = COMPILE_OPTION_DEFAULT;
833 *option = COMPILE_OPTION_FALSE;
835 else if (opt ==
Qtrue) {
838 ((
int *)option)[i] = 1;
841 *option = COMPILE_OPTION_DEFAULT;
842 set_compile_option_from_hash(option, opt);
845 rb_raise(
rb_eTypeError,
"Compile option must be Hash/true/false/nil");
852 VALUE opt = rb_hash_new_with_size(11);
853#define SET_COMPILE_OPTION(o, h, mem) \
854 rb_hash_aset((h), ID2SYM(rb_intern(#mem)), RBOOL((o)->mem))
855#define SET_COMPILE_OPTION_NUM(o, h, mem) \
856 rb_hash_aset((h), ID2SYM(rb_intern(#mem)), INT2NUM((o)->mem))
858 SET_COMPILE_OPTION(option, opt, inline_const_cache);
859 SET_COMPILE_OPTION(option, opt, peephole_optimization);
860 SET_COMPILE_OPTION(option, opt, tailcall_optimization);
861 SET_COMPILE_OPTION(option, opt, specialized_instruction);
862 SET_COMPILE_OPTION(option, opt, operands_unification);
863 SET_COMPILE_OPTION(option, opt, instructions_unification);
864 SET_COMPILE_OPTION(option, opt, debug_frozen_string_literal);
865 SET_COMPILE_OPTION(option, opt, coverage_enabled);
866 SET_COMPILE_OPTION_NUM(option, opt, debug_level);
868#undef SET_COMPILE_OPTION
869#undef SET_COMPILE_OPTION_NUM
870 VALUE frozen_string_literal = option->frozen_string_literal == -1 ?
Qnil : RBOOL(option->frozen_string_literal);
871 rb_hash_aset(opt,
ID2SYM(rb_intern(
"frozen_string_literal")), frozen_string_literal);
879 return rb_iseq_new_with_opt(ast_value, name, path, realpath, 0, parent,
880 0,
type, &COMPILE_OPTION_DEFAULT,
885ast_line_count(
const VALUE ast_value)
887 rb_ast_t *ast = rb_ruby_ast_data_get(ast_value);
888 return ast->body.line_count;
892iseq_setup_coverage(
VALUE coverages,
VALUE path,
int line_count)
894 if (line_count >= 0) {
895 int len = (rb_get_coverage_mode() & COVERAGE_TARGET_ONESHOT_LINES) ? 0 : line_count;
897 VALUE coverage = rb_default_coverage(
len);
898 rb_hash_aset(coverages, path, coverage);
907iseq_new_setup_coverage(
VALUE path,
int line_count)
909 VALUE coverages = rb_get_coverages();
911 if (
RTEST(coverages)) {
912 iseq_setup_coverage(coverages, path, line_count);
919 iseq_new_setup_coverage(path, ast_line_count(ast_value));
921 return rb_iseq_new_with_opt(ast_value, name, path, realpath, 0, parent, 0,
922 ISEQ_TYPE_TOP, &COMPILE_OPTION_DEFAULT,
934 return pm_iseq_new_with_opt(node, name, path, realpath, 0, parent, 0,
935 ISEQ_TYPE_TOP, &COMPILE_OPTION_DEFAULT, error_state);
941 iseq_new_setup_coverage(path, ast_line_count(ast_value));
943 return rb_iseq_new_with_opt(ast_value, rb_fstring_lit(
"<main>"),
945 parent, 0, ISEQ_TYPE_MAIN, opt ? &COMPILE_OPTION_DEFAULT : &COMPILE_OPTION_FALSE,
958 return pm_iseq_new_with_opt(node, rb_fstring_lit(
"<main>"),
960 parent, 0, ISEQ_TYPE_MAIN, opt ? &COMPILE_OPTION_DEFAULT : &COMPILE_OPTION_FALSE, error_state);
964rb_iseq_new_eval(
const VALUE ast_value,
VALUE name,
VALUE path,
VALUE realpath,
int first_lineno,
const rb_iseq_t *parent,
int isolated_depth)
966 if (rb_get_coverage_mode() & COVERAGE_TARGET_EVAL) {
967 VALUE coverages = rb_get_coverages();
968 if (
RTEST(coverages) &&
RTEST(path) && !
RTEST(rb_hash_has_key(coverages, path))) {
969 iseq_setup_coverage(coverages, path, ast_line_count(ast_value) + first_lineno - 1);
973 return rb_iseq_new_with_opt(ast_value, name, path, realpath, first_lineno,
974 parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT,
980 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
int *error_state)
982 if (rb_get_coverage_mode() & COVERAGE_TARGET_EVAL) {
983 VALUE coverages = rb_get_coverages();
984 if (
RTEST(coverages) &&
RTEST(path) && !
RTEST(rb_hash_has_key(coverages, path))) {
985 iseq_setup_coverage(coverages, path, ((
int) (node->parser->
newline_list.
size - 1)) + first_lineno - 1);
989 return pm_iseq_new_with_opt(node, name, path, realpath, first_lineno,
990 parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT, error_state);
997 VALUE v1 = iseqw_new(iseq);
999 if (v1 != v2 &&
CLASS_OF(v2) == rb_cISeq) {
1009 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
1013 rb_ast_t *ast = rb_ruby_ast_data_get(ast_value);
1015 const NODE *node = body ? body->root : 0;
1020 if (!option) option = &COMPILE_OPTION_DEFAULT;
1023 option = set_compile_option_from_ast(&new_opt, body);
1026 if (!
NIL_P(script_lines)) {
1029 else if (body && body->script_lines) {
1030 script_lines = rb_parser_build_script_lines_from(body->script_lines);
1033 script_lines = ISEQ_BODY(parent)->variable.script_lines;
1036 prepare_iseq_build(iseq, name, path, realpath, first_lineno, node ? &node->nd_loc : NULL, node ? nd_node_id(node) : -1,
1037 parent, isolated_depth,
type, script_lines, option);
1039 rb_iseq_compile_node(iseq, node);
1040 finish_iseq_build(iseq);
1043 return iseq_translate(iseq);
1052pm_iseq_new_with_opt_try(
VALUE d)
1057 pm_iseq_compile_node(data->iseq, data->node);
1060 finish_iseq_build(data->iseq);
1079 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
1083 ISEQ_BODY(iseq)->prism =
true;
1086 if (!option) option = &COMPILE_OPTION_DEFAULT;
1088 next_option = *option;
1089 next_option.coverage_enabled = node->coverage_enabled < 0 ? 0 : node->coverage_enabled > 0;
1090 option = &next_option;
1093 int32_t start_line = node->parser->
start_line;
1099 .beg_pos = { .lineno = (int) start.
line, .column = (
int) start.
column },
1100 .end_pos = { .lineno = (int) end.
line, .column = (
int) end.
column }
1103 prepare_iseq_build(iseq, name, path, realpath, first_lineno, &code_location, node->ast_node->
node_id,
1104 parent, isolated_depth,
type, node->
script_lines == NULL ?
Qnil : *node->script_lines, option);
1110 rb_protect(pm_iseq_new_with_opt_try, (
VALUE)&data, error_state);
1112 if (*error_state)
return NULL;
1114 return iseq_translate(iseq);
1118rb_iseq_new_with_callback(
1121 int first_lineno,
const rb_iseq_t *parent,
1127 if (!option) option = &COMPILE_OPTION_DEFAULT;
1128 prepare_iseq_build(iseq, name, path, realpath, first_lineno, NULL, -1, parent, 0,
type,
Qnil, option);
1130 rb_iseq_compile_callback(iseq, ifunc);
1131 finish_iseq_build(iseq);
1137rb_iseq_load_iseq(
VALUE fname)
1142 return iseqw_check(iseqv);
1148#define CHECK_ARRAY(v) rb_to_array_type(v)
1149#define CHECK_HASH(v) rb_to_hash_type(v)
1150#define CHECK_STRING(v) rb_str_to_str(v)
1151#define CHECK_SYMBOL(v) rb_to_symbol_type(v)
1154static enum rb_iseq_type
1157 const ID id_top = rb_intern(
"top");
1158 const ID id_method = rb_intern(
"method");
1159 const ID id_block = rb_intern(
"block");
1160 const ID id_class = rb_intern(
"class");
1161 const ID id_rescue = rb_intern(
"rescue");
1162 const ID id_ensure = rb_intern(
"ensure");
1163 const ID id_eval = rb_intern(
"eval");
1164 const ID id_main = rb_intern(
"main");
1165 const ID id_plain = rb_intern(
"plain");
1169 if (
typeid == id_top)
return ISEQ_TYPE_TOP;
1170 if (
typeid == id_method)
return ISEQ_TYPE_METHOD;
1171 if (
typeid == id_block)
return ISEQ_TYPE_BLOCK;
1172 if (
typeid == id_class)
return ISEQ_TYPE_CLASS;
1173 if (
typeid == id_rescue)
return ISEQ_TYPE_RESCUE;
1174 if (
typeid == id_ensure)
return ISEQ_TYPE_ENSURE;
1175 if (
typeid == id_eval)
return ISEQ_TYPE_EVAL;
1176 if (
typeid == id_main)
return ISEQ_TYPE_MAIN;
1177 if (
typeid == id_plain)
return ISEQ_TYPE_PLAIN;
1178 return (
enum rb_iseq_type)-1;
1186 VALUE magic, version1, version2, format_type, misc;
1187 VALUE name, path, realpath, code_location, node_id;
1188 VALUE type, body, locals, params, exception;
1190 st_data_t iseq_type;
1200 data = CHECK_ARRAY(data);
1207 ((void)magic, (
void)version1, (void)version2, (
void)format_type);
1212 realpath =
NIL_P(realpath) ?
Qnil : CHECK_STRING(realpath);
1221 ISEQ_BODY(iseq)->local_iseq = iseq;
1223 iseq_type = iseq_type_from_sym(
type);
1224 if (iseq_type == (
enum rb_iseq_type)-1) {
1228 node_id = rb_hash_aref(misc,
ID2SYM(rb_intern(
"node_id")));
1230 code_location = rb_hash_aref(misc,
ID2SYM(rb_intern(
"code_location")));
1238 if (
SYM2ID(rb_hash_aref(misc,
ID2SYM(rb_intern(
"parser")))) == rb_intern(
"prism")) {
1239 ISEQ_BODY(iseq)->prism =
true;
1242 make_compile_option(&option, opt);
1243 option.peephole_optimization = FALSE;
1244 prepare_iseq_build(iseq, name, path, realpath, first_lineno, &tmp_loc,
NUM2INT(node_id),
1245 parent, 0, (
enum rb_iseq_type)iseq_type,
Qnil, &option);
1247 rb_iseq_build_from_ary(iseq, misc, locals, params, exception, body);
1249 finish_iseq_build(iseq);
1251 return iseqw_new(iseq);
1258iseq_s_load(
int argc,
VALUE *argv,
VALUE self)
1262 return iseq_load(data, NULL, opt);
1268 return iseq_load(data,
RTEST(parent) ? (
rb_iseq_t *)parent : NULL, opt);
1276#if !defined(__GNUC__) || (__GNUC__ == 4 && __GNUC_MINOR__ == 8)
1277# define INITIALIZED volatile
1283 VALUE INITIALIZED ast_value;
1285 VALUE name = rb_fstring_lit(
"<compiled>");
1288 make_compile_option(&option, opt);
1292 parse = rb_parser_compile_file_path;
1295 parse = rb_parser_compile_string_path;
1299 const VALUE parser = rb_parser_new();
1300 const rb_iseq_t *outer_scope = rb_iseq_new(
Qnil, name, name,
Qnil, 0, ISEQ_TYPE_TOP);
1302 rb_parser_set_context(parser, outer_scope, FALSE);
1303 if (ruby_vm_keep_script_lines) rb_parser_set_script_lines(parser);
1305 ast_value = (*parse)(parser, file, src, ln);
1308 ast = rb_ruby_ast_data_get(ast_value);
1310 if (!ast || !ast->body.root) {
1311 rb_ast_dispose(ast);
1315 iseq = rb_iseq_new_with_opt(ast_value, name, file, realpath, ln,
1316 NULL, 0, ISEQ_TYPE_TOP, &option,
1318 rb_ast_dispose(ast);
1330 VALUE name = rb_fstring_lit(
"<compiled>");
1333 make_compile_option(&option, opt);
1337 bool parse_file =
false;
1348 pm_options_scopes_init(&result.
options, 1);
1349 result.
node.coverage_enabled = 1;
1351 switch (option.frozen_string_literal) {
1352 case ISEQ_FROZEN_STRING_LITERAL_UNSET:
1354 case ISEQ_FROZEN_STRING_LITERAL_DISABLED:
1355 pm_options_frozen_string_literal_set(&result.
options,
false);
1357 case ISEQ_FROZEN_STRING_LITERAL_ENABLED:
1358 pm_options_frozen_string_literal_set(&result.
options,
true);
1361 rb_bug(
"pm_iseq_compile_with_option: invalid frozen_string_literal=%d", option.frozen_string_literal);
1369 error = pm_load_parse_file(&result, src, ruby_vm_keep_script_lines ? &script_lines : NULL);
1372 error = pm_parse_string(&result, src, file, ruby_vm_keep_script_lines ? &script_lines : NULL);
1377 if (error ==
Qnil) {
1379 iseq = pm_iseq_new_with_opt(&result.
node, name, file, realpath, ln, NULL, 0, ISEQ_TYPE_TOP, &option, &error_state);
1381 pm_parse_result_free(&result);
1385 rb_jump_tag(error_state);
1389 pm_parse_result_free(&result);
1399 return pathobj_path(ISEQ_BODY(iseq)->location.pathobj);
1405 return pathobj_realpath(ISEQ_BODY(iseq)->location.pathobj);
1409rb_iseq_absolute_path(
const rb_iseq_t *iseq)
1411 return rb_iseq_realpath(iseq);
1415rb_iseq_from_eval_p(
const rb_iseq_t *iseq)
1417 return NIL_P(rb_iseq_realpath(iseq));
1423 return ISEQ_BODY(iseq)->location.label;
1427rb_iseq_base_label(
const rb_iseq_t *iseq)
1429 return ISEQ_BODY(iseq)->location.base_label;
1433rb_iseq_first_lineno(
const rb_iseq_t *iseq)
1435 return RB_INT2NUM(ISEQ_BODY(iseq)->location.first_lineno);
1439rb_iseq_method_name(
const rb_iseq_t *iseq)
1443 if (body->type == ISEQ_TYPE_METHOD) {
1444 return body->location.base_label;
1452rb_iseq_code_location(
const rb_iseq_t *iseq,
int *beg_pos_lineno,
int *beg_pos_column,
int *end_pos_lineno,
int *end_pos_column)
1455 if (beg_pos_lineno) *beg_pos_lineno = loc->beg_pos.lineno;
1456 if (beg_pos_column) *beg_pos_column = loc->beg_pos.column;
1457 if (end_pos_lineno) *end_pos_lineno = loc->end_pos.lineno;
1458 if (end_pos_column) *end_pos_column = loc->end_pos.column;
1461static ID iseq_type_id(
enum rb_iseq_type
type);
1466 return ID2SYM(iseq_type_id(ISEQ_BODY(iseq)->
type));
1472 return ISEQ_COVERAGE(iseq);
1476remove_coverage_i(
void *vstart,
void *vend,
size_t stride,
void *data)
1479 for (; v != (
VALUE)vend; v += stride) {
1480 void *ptr = rb_asan_poisoned_object_p(v);
1481 rb_asan_unpoison_object(v,
false);
1483 if (rb_obj_is_iseq(v)) {
1485 ISEQ_COVERAGE_SET(iseq,
Qnil);
1488 asan_poison_object_if(ptr, v);
1494rb_iseq_remove_coverage_all(
void)
1496 rb_objspace_each_objects(remove_coverage_i, NULL);
1502iseqw_mark(
void *ptr)
1504 rb_gc_mark_movable(*(
VALUE *)ptr);
1508iseqw_memsize(
const void *ptr)
1510 return rb_iseq_memsize(*(
const rb_iseq_t **)ptr);
1514iseqw_ref_update(
void *ptr)
1517 *vptr = rb_gc_location(*vptr);
1528 0, 0, RUBY_TYPED_FREE_IMMEDIATELY|RUBY_TYPED_WB_PROTECTED
1534 if (iseq->wrapper) {
1536 rb_raise(
rb_eTypeError,
"wrong iseq wrapper: %" PRIsVALUE
" for %p",
1537 iseq->wrapper, (
void *)iseq);
1539 return iseq->wrapper;
1556 return iseqw_new(iseq);
1565iseqw_s_compile_parser(
int argc,
VALUE *argv,
VALUE self,
bool prism)
1571 if (i > 4+
NIL_P(opt)) rb_error_arity(argc, 1, 5);
1573 case 5: opt = argv[--i];
1574 case 4: line = argv[--i];
1575 case 3: path = argv[--i];
1576 case 2: file = argv[--i];
1579 if (
NIL_P(file)) file = rb_fstring_lit(
"<compiled>");
1580 if (
NIL_P(path)) path = file;
1588 iseq = pm_iseq_compile_with_option(src, file, path, line, opt);
1591 iseq = rb_iseq_compile_with_option(src, file, path, line, opt);
1594 return iseqw_new(iseq);
1635iseqw_s_compile(
int argc,
VALUE *argv,
VALUE self)
1637 return iseqw_s_compile_parser(argc, argv, self, rb_ruby_prism_p());
1677iseqw_s_compile_parsey(
int argc,
VALUE *argv,
VALUE self)
1679 return iseqw_s_compile_parser(argc, argv, self,
false);
1719iseqw_s_compile_prism(
int argc,
VALUE *argv,
VALUE self)
1721 return iseqw_s_compile_parser(argc, argv, self,
true);
1745iseqw_s_compile_file(
int argc,
VALUE *argv,
VALUE self)
1754 i =
rb_scan_args(argc, argv,
"1*:", &file, NULL, &opt);
1755 if (i > 1+
NIL_P(opt)) rb_error_arity(argc, 1, 2);
1757 case 2: opt = argv[--i];
1760 file = rb_fstring(file);
1765 VALUE v = rb_vm_push_frame_fname(ec, file);
1767 parser = rb_parser_new();
1768 rb_parser_set_context(parser, NULL, FALSE);
1769 ast_value = rb_parser_load_file(parser, file);
1770 ast = rb_ruby_ast_data_get(ast_value);
1771 if (!ast->body.root) exc = GET_EC()->errinfo;
1774 if (!ast->body.root) {
1775 rb_ast_dispose(ast);
1779 make_compile_option(&option, opt);
1781 ret = iseqw_new(rb_iseq_new_with_opt(ast_value, rb_fstring_lit(
"<main>"),
1783 rb_realpath_internal(
Qnil, file, 1),
1784 1, NULL, 0, ISEQ_TYPE_TOP, &option,
1786 rb_ast_dispose(ast);
1789 rb_vm_pop_frame(ec);
1816iseqw_s_compile_file_prism(
int argc,
VALUE *argv,
VALUE self)
1822 i =
rb_scan_args(argc, argv,
"1*:", &file, NULL, &opt);
1823 if (i > 1+
NIL_P(opt)) rb_error_arity(argc, 1, 2);
1825 case 2: opt = argv[--i];
1828 file = rb_fstring(file);
1831 VALUE v = rb_vm_push_frame_fname(ec, file);
1835 result.
node.coverage_enabled = 1;
1838 VALUE error = pm_load_parse_file(&result, file, ruby_vm_keep_script_lines ? &script_lines : NULL);
1840 if (error ==
Qnil) {
1841 make_compile_option(&option, opt);
1844 rb_iseq_t *iseq = pm_iseq_new_with_opt(&result.
node, rb_fstring_lit(
"<main>"),
1846 rb_realpath_internal(
Qnil, file, 1),
1847 1, NULL, 0, ISEQ_TYPE_TOP, &option, &error_state);
1849 pm_parse_result_free(&result);
1853 rb_jump_tag(error_state);
1856 ret = iseqw_new(iseq);
1857 rb_vm_pop_frame(ec);
1862 pm_parse_result_free(&result);
1863 rb_vm_pop_frame(ec);
1900iseqw_s_compile_option_set(
VALUE self,
VALUE opt)
1903 make_compile_option(&option, opt);
1904 COMPILE_OPTION_DEFAULT = option;
1917iseqw_s_compile_option_get(
VALUE self)
1919 return make_compile_option_value(&COMPILE_OPTION_DEFAULT);
1923iseqw_check(
VALUE iseqw)
1929 if (!ISEQ_BODY(iseq)) {
1930 rb_ibf_load_iseq_complete(iseq);
1933 if (!ISEQ_BODY(iseq)->location.label) {
1934 rb_raise(
rb_eTypeError,
"uninitialized InstructionSequence");
1940rb_iseqw_to_iseq(
VALUE iseqw)
1942 return iseqw_check(iseqw);
1954iseqw_eval(
VALUE self)
1956 const rb_iseq_t *iseq = iseqw_check(self);
1957 if (0 == ISEQ_BODY(iseq)->iseq_size) {
1958 rb_raise(
rb_eTypeError,
"attempt to evaluate dummy InstructionSequence");
1960 return rb_iseq_eval(iseq);
1968iseqw_inspect(
VALUE self)
1970 const rb_iseq_t *iseq = iseqw_check(self);
1974 if (!body->location.label) {
1975 return rb_sprintf(
"#<%"PRIsVALUE
": uninitialized>", klass);
1978 return rb_sprintf(
"<%"PRIsVALUE
":%"PRIsVALUE
"@%"PRIsVALUE
":%d>",
1980 body->location.label, rb_iseq_path(iseq),
1981 FIX2INT(rb_iseq_first_lineno(iseq)));
2009iseqw_path(
VALUE self)
2011 return rb_iseq_path(iseqw_check(self));
2031iseqw_absolute_path(
VALUE self)
2033 return rb_iseq_realpath(iseqw_check(self));
2060iseqw_label(
VALUE self)
2062 return rb_iseq_label(iseqw_check(self));
2086iseqw_base_label(
VALUE self)
2088 return rb_iseq_base_label(iseqw_check(self));
2102iseqw_first_lineno(
VALUE self)
2104 return rb_iseq_first_lineno(iseqw_check(self));
2191iseqw_to_a(
VALUE self)
2193 const rb_iseq_t *iseq = iseqw_check(self);
2194 return iseq_data_to_ary(iseq);
2197#if VM_INSN_INFO_TABLE_IMPL == 1
2199get_insn_info_binary_search(
const rb_iseq_t *iseq,
size_t pos)
2202 size_t size = body->insns_info.size;
2204 const unsigned int *positions = body->insns_info.positions;
2205 const int debug = 0;
2208 printf(
"size: %"PRIuSIZE
"\n", size);
2209 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2210 (
size_t)0, positions[0], insns_info[0].line_no, pos);
2216 else if (size == 1) {
2217 return &insns_info[0];
2220 size_t l = 1, r = size - 1;
2222 size_t m = l + (r - l) / 2;
2223 if (positions[m] == pos) {
2224 return &insns_info[m];
2226 if (positions[m] < pos) {
2234 return &insns_info[size-1];
2236 if (positions[l] > pos) {
2237 return &insns_info[l-1];
2239 return &insns_info[l];
2244get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2246 return get_insn_info_binary_search(iseq, pos);
2250#if VM_INSN_INFO_TABLE_IMPL == 2
2252get_insn_info_succinct_bitvector(
const rb_iseq_t *iseq,
size_t pos)
2255 size_t size = body->insns_info.size;
2257 const int debug = 0;
2260#if VM_CHECK_MODE > 0
2261 const unsigned int *positions = body->insns_info.positions;
2262 printf(
"size: %"PRIuSIZE
"\n", size);
2263 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2264 (
size_t)0, positions[0], insns_info[0].line_no, pos);
2266 printf(
"size: %"PRIuSIZE
"\n", size);
2267 printf(
"insns_info[%"PRIuSIZE
"]: line: %d, pos: %"PRIuSIZE
"\n",
2268 (
size_t)0, insns_info[0].line_no, pos);
2275 else if (size == 1) {
2276 return &insns_info[0];
2280 VM_ASSERT(body->insns_info.succ_index_table != NULL);
2281 index = succ_index_lookup(body->insns_info.succ_index_table, (
int)pos);
2282 return &insns_info[index-1];
2287get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2289 return get_insn_info_succinct_bitvector(iseq, pos);
2293#if VM_CHECK_MODE > 0 || VM_INSN_INFO_TABLE_IMPL == 0
2295get_insn_info_linear_search(
const rb_iseq_t *iseq,
size_t pos)
2298 size_t i = 0, size = body->insns_info.size;
2300 const unsigned int *positions = body->insns_info.positions;
2301 const int debug = 0;
2304 printf(
"size: %"PRIuSIZE
"\n", size);
2305 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2306 i, positions[i], insns_info[i].line_no, pos);
2312 else if (size == 1) {
2313 return &insns_info[0];
2316 for (i=1; i<size; i++) {
2317 if (debug) printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2318 i, positions[i], insns_info[i].line_no, pos);
2320 if (positions[i] == pos) {
2321 return &insns_info[i];
2323 if (positions[i] > pos) {
2324 return &insns_info[i-1];
2328 return &insns_info[i-1];
2332#if VM_INSN_INFO_TABLE_IMPL == 0
2334get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2336 return get_insn_info_linear_search(iseq, pos);
2340#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
2342validate_get_insn_info(
const rb_iseq_t *iseq)
2346 for (i = 0; i < body->iseq_size; i++) {
2347 if (get_insn_info_linear_search(iseq, i) != get_insn_info(iseq, i)) {
2348 rb_bug(
"validate_get_insn_info: get_insn_info_linear_search(iseq, %"PRIuSIZE
") != get_insn_info(iseq, %"PRIuSIZE
")", i, i);
2355rb_iseq_line_no(
const rb_iseq_t *iseq,
size_t pos)
2360 return entry->line_no;
2367#ifdef USE_ISEQ_NODE_ID
2369rb_iseq_node_id(
const rb_iseq_t *iseq,
size_t pos)
2374 return entry->node_id;
2383rb_iseq_event_flags(
const rb_iseq_t *iseq,
size_t pos)
2387 return entry->events;
2401 entry->events &= ~reset;
2402 if (!(entry->events & iseq->aux.exec.global_trace_events)) {
2403 void rb_iseq_trace_flag_cleared(
const rb_iseq_t *iseq,
size_t pos);
2404 rb_iseq_trace_flag_cleared(iseq, pos);
2417 for (i = 0; i < level; i++) {
2418 diseq = ISEQ_BODY(diseq)->parent_iseq;
2420 idx = ISEQ_BODY(diseq)->local_table_size - (int)op - 1;
2421 lid = ISEQ_BODY(diseq)->local_table[idx];
2422 name = rb_id2str(lid);
2432 rb_str_catf(name,
"@%d", idx);
2436int rb_insn_unified_local_var_level(
VALUE);
2440rb_insn_operand_intern(
const rb_iseq_t *iseq,
2444 const char *types = insn_op_types(insn);
2445 char type = types[op_no];
2450 ret = rb_sprintf(
"%"PRIdVALUE, (
VALUE)(pos +
len + op));
2454 if (insn == BIN(defined) && op_no == 0) {
2455 enum defined_type deftype = (
enum defined_type)op;
2458 ret = rb_fstring_lit(
"func");
2461 ret = rb_fstring_lit(
"ref");
2463 case DEFINED_CONST_FROM:
2464 ret = rb_fstring_lit(
"constant-from");
2467 ret = rb_iseq_defined_string(deftype);
2472 else if (insn == BIN(checktype) && op_no == 0) {
2478 ret = rb_sprintf(
"%"PRIuVALUE, op);
2483 if (types[op_no+1] == TS_NUM && pnop) {
2484 ret = local_var_name(iseq, *pnop, op - VM_ENV_DATA_SIZE);
2486 else if ((level = rb_insn_unified_local_var_level(insn)) >= 0) {
2487 ret = local_var_name(iseq, (
VALUE)level, op - VM_ENV_DATA_SIZE);
2499 op = obj_resurrect(op);
2500 if (insn == BIN(defined) && op_no == 1 &&
FIXNUM_P(op)) {
2505 ret = rb_sprintf(
":$%c", (
type >> 1));
2508 ret = rb_sprintf(
":$%d", (
type >> 1));
2513 ret = rb_dump_literal(op);
2525 ret = ISEQ_BODY(iseq)->location.label;
2539 const ID *segments = ((
IC)op)->segments;
2542 rb_str_catf(ret,
"::%s", rb_id2name(*segments++));
2558 ID mid = vm_ci_mid(ci);
2561 rb_ary_push(ary, rb_sprintf(
"mid:%"PRIsVALUE, rb_id2str(mid)));
2564 rb_ary_push(ary, rb_sprintf(
"argc:%d", vm_ci_argc(ci)));
2566 if (vm_ci_flag(ci) & VM_CALL_KWARG) {
2572 if (vm_ci_flag(ci)) {
2574# define CALL_FLAG(n) if (vm_ci_flag(ci) & VM_CALL_##n) rb_ary_push(flags, rb_str_new2(#n))
2575 CALL_FLAG(ARGS_SPLAT);
2576 CALL_FLAG(ARGS_SPLAT_MUT);
2577 CALL_FLAG(ARGS_BLOCKARG);
2580 CALL_FLAG(ARGS_SIMPLE);
2581 CALL_FLAG(TAILCALL);
2585 CALL_FLAG(KW_SPLAT);
2586 CALL_FLAG(KW_SPLAT_MUT);
2587 CALL_FLAG(FORWARDING);
2588 CALL_FLAG(OPT_SEND);
2604 if (dladdr((
void *)op, &info) && info.dli_sname) {
2616 ret = rb_sprintf(
"<builtin!%s/%d>",
2617 bf->name, bf->argc);
2622 rb_bug(
"unknown operand type: %c",
type);
2628right_strip(
VALUE str)
2630 const char *beg = RSTRING_PTR(str), *end =
RSTRING_END(str);
2631 while (end-- > beg && *end ==
' ');
2641rb_iseq_disasm_insn(
VALUE ret,
const VALUE *code,
size_t pos,
2644 VALUE insn = code[pos];
2645 int len = insn_len(insn);
2647 const char *types = insn_op_types(insn);
2649 const char *insn_name_buff;
2651 insn_name_buff = insn_name(insn);
2653 extern const int rb_vm_max_insn_name_size;
2654 rb_str_catf(str,
"%04"PRIuSIZE
" %-*s ", pos, rb_vm_max_insn_name_size, insn_name_buff);
2657 rb_str_catf(str,
"%04"PRIuSIZE
" %-28.*s ", pos,
2658 (
int)strcspn(insn_name_buff,
"_"), insn_name_buff);
2661 for (j = 0; types[j]; j++) {
2662 VALUE opstr = rb_insn_operand_intern(iseq, insn, j, code[pos + j + 1],
2663 len, pos, &code[pos + j + 2],
2673 unsigned int line_no = rb_iseq_line_no(iseq, pos);
2674 unsigned int prev = pos == 0 ? 0 : rb_iseq_line_no(iseq, pos - 1);
2675 if (line_no && line_no != prev) {
2676 long slen = RSTRING_LEN(str);
2677 slen = (slen > 70) ? 0 : (70 - slen);
2678 str = rb_str_catf(str,
"%*s(%4d)", (
int)slen,
"", line_no);
2685 str = rb_str_catf(str,
"[%s%s%s%s%s%s%s%s%s%s%s%s]",
2696 events & RUBY_EVENT_COVERAGE_LINE ?
"Cli" :
"",
2697 events & RUBY_EVENT_COVERAGE_BRANCH ?
"Cbr" :
"");
2707 printf(
"%.*s\n", (
int)RSTRING_LEN(str), RSTRING_PTR(str));
2716 case CATCH_TYPE_RESCUE:
2718 case CATCH_TYPE_ENSURE:
2720 case CATCH_TYPE_RETRY:
2722 case CATCH_TYPE_BREAK:
2724 case CATCH_TYPE_REDO:
2726 case CATCH_TYPE_NEXT:
2729 rb_bug(
"unknown catch type: %d",
type);
2738 if (!body->location.label) {
2739 return rb_sprintf(
"#<ISeq: uninitialized>");
2743 return rb_sprintf(
"#<ISeq:%"PRIsVALUE
"@%"PRIsVALUE
":%d (%d,%d)-(%d,%d)>",
2744 body->location.label, rb_iseq_path(iseq),
2745 loc->beg_pos.lineno,
2746 loc->beg_pos.lineno,
2747 loc->beg_pos.column,
2748 loc->end_pos.lineno,
2749 loc->end_pos.column);
2755 {(void (*)(
void *))rb_mark_set, (void (*)(
void *))st_free_table, 0, 0,},
2756 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
2770 enum {header_minlen = 72};
2773 const char *indent_str;
2776 size = body->iseq_size;
2778 indent_len = RSTRING_LEN(indent);
2779 indent_str = RSTRING_PTR(indent);
2785 if ((l = RSTRING_LEN(str) - indent_len) < header_minlen) {
2789 if (iseq->body->builtin_attrs) {
2790#define disasm_builtin_attr(str, iseq, attr) \
2791 if (iseq->body->builtin_attrs & BUILTIN_ATTR_ ## attr) { \
2792 rb_str_cat2(str, " " #attr); \
2794 disasm_builtin_attr(str, iseq, LEAF);
2795 disasm_builtin_attr(str, iseq, SINGLE_NOARG_LEAF);
2796 disasm_builtin_attr(str, iseq, INLINE_BLOCK);
2797 disasm_builtin_attr(str, iseq, C_TRACE);
2802 if (body->catch_table) {
2806 if (body->catch_table) {
2808 indent_str = RSTRING_PTR(indent);
2809 for (i = 0; i < body->catch_table->size; i++) {
2811 UNALIGNED_MEMBER_PTR(body->catch_table, entries[i]);
2814 "| catch type: %-6s st: %04d ed: %04d sp: %04d cont: %04d\n",
2815 catch_type((
int)entry->type), (
int)entry->start,
2816 (
int)entry->end, (
int)entry->sp, (
int)entry->cont);
2817 if (entry->iseq && !(done_iseq && st_is_member(done_iseq, (st_data_t)entry->iseq))) {
2818 rb_str_concat(str, rb_iseq_disasm_recursive(rb_iseq_check(entry->iseq), indent));
2820 done_iseq = st_init_numtable();
2823 st_insert(done_iseq, (st_data_t)entry->iseq, (st_data_t)0);
2824 indent_str = RSTRING_PTR(indent);
2827 rb_str_resize(indent, indent_len);
2828 indent_str = RSTRING_PTR(indent);
2830 if (body->catch_table) {
2832 rb_str_cat2(str,
"|-------------------------------------"
2833 "-----------------------------------\n");
2837 if (body->local_table) {
2838 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
2841 "local table (size: %d, argc: %d "
2842 "[opts: %d, rest: %d, post: %d, block: %d, kw: %d@%d, kwrest: %d])\n",
2843 body->local_table_size,
2844 body->
param.lead_num,
2845 body->
param.opt_num,
2846 body->
param.flags.has_rest ? body->
param.rest_start : -1,
2847 body->param.post_num,
2848 body->param.flags.has_block ? body->param.block_start : -1,
2849 body->param.flags.has_kw ? keyword->num : -1,
2850 body->param.flags.has_kw ? keyword->required_num : -1,
2851 body->param.flags.has_kwrest ? keyword->rest_start : -1);
2853 for (i = body->local_table_size; i > 0;) {
2854 int li = body->local_table_size - --i - 1;
2856 VALUE name = local_var_name(iseq, 0, i);
2861 if (body->
param.flags.has_opt) {
2862 int argc = body->
param.lead_num;
2863 int opts = body->
param.opt_num;
2864 if (li >= argc && li < argc + opts) {
2865 snprintf(opti,
sizeof(opti),
"Opt=%"PRIdVALUE,
2866 body->
param.opt_table[li - argc]);
2870 snprintf(argi,
sizeof(argi),
"%s%s%s%s%s%s",
2871 (body->
param.lead_num > li) ? (body->
param.flags.ambiguous_param0 ?
"AmbiguousArg" :
"Arg") :
"",
2873 (body->param.flags.has_rest && body->param.rest_start == li) ? (body->param.flags.anon_rest ?
"AnonRest" :
"Rest") :
"",
2874 (body->param.flags.has_post && body->param.post_start <= li && li < body->param.post_start + body->param.post_num) ?
"Post" :
"",
2875 (body->param.flags.has_kwrest && keyword->rest_start == li) ? (body->param.flags.anon_kwrest ?
"AnonKwrest" :
"Kwrest") :
"",
2876 (body->param.flags.has_block && body->param.block_start == li) ?
"Block" :
"");
2879 rb_str_catf(str,
"[%2d] ", i + 1);
2880 width = RSTRING_LEN(str) + 11;
2882 if (*argi) rb_str_catf(str,
"<%s>", argi);
2883 if ((width -= RSTRING_LEN(str)) > 0) rb_str_catf(str,
"%*s", (
int)width,
"");
2889 code = rb_iseq_original_iseq(iseq);
2890 for (n = 0; n < size;) {
2892 n += rb_iseq_disasm_insn(str, code, n, iseq, child);
2897 if (done_iseq && st_is_member(done_iseq, (st_data_t)isv))
continue;
2900 indent_str = RSTRING_PTR(indent);
2911 rb_str_resize(str, RSTRING_LEN(str));
2921rb_estimate_iv_count(
VALUE klass,
const rb_iseq_t * initialize_iseq)
2923 struct rb_id_table * iv_names = rb_id_table_create(0);
2925 for (
unsigned int i = 0; i < ISEQ_BODY(initialize_iseq)->ivc_size; i++) {
2926 IVC cache = (
IVC)&ISEQ_BODY(initialize_iseq)->is_entries[i];
2928 if (cache->iv_set_name) {
2929 rb_id_table_insert(iv_names, cache->iv_set_name,
Qtrue);
2933 attr_index_t count = (attr_index_t)rb_id_table_size(iv_names);
2936 count += RCLASS_MAX_IV_COUNT(superclass);
2938 rb_id_table_free(iv_names);
2962iseqw_disasm(
VALUE self)
2964 return rb_iseq_disasm(iseqw_check(self));
2968iseq_iterate_children(
const rb_iseq_t *iseq,
void (*iter_func)(
const rb_iseq_t *child_iseq,
void *data),
void *data)
2971 VALUE *code = rb_iseq_original_iseq(iseq);
2976 if (body->catch_table) {
2977 for (i = 0; i < body->catch_table->size; i++) {
2979 UNALIGNED_MEMBER_PTR(body->catch_table, entries[i]);
2980 child = entry->iseq;
2982 if (
NIL_P(rb_hash_aref(all_children, (
VALUE)child))) {
2983 rb_hash_aset(all_children, (
VALUE)child,
Qtrue);
2984 (*iter_func)(child, data);
2990 for (i=0; i<body->iseq_size;) {
2991 VALUE insn = code[i];
2992 int len = insn_len(insn);
2993 const char *types = insn_op_types(insn);
2996 for (j=0; types[j]; j++) {
3001 if (
NIL_P(rb_hash_aref(all_children, (
VALUE)child))) {
3002 rb_hash_aset(all_children, (
VALUE)child,
Qtrue);
3003 (*iter_func)(child, data);
3018yield_each_children(
const rb_iseq_t *child_iseq,
void *data)
3032iseqw_each_child(
VALUE self)
3034 const rb_iseq_t *iseq = iseqw_check(self);
3035 iseq_iterate_children(iseq, yield_each_children, NULL);
3042#define C(ev, cstr, l) if (events & ev) rb_ary_push(ary, rb_ary_new_from_args(2, l, ID2SYM(rb_intern(cstr))));
3062iseqw_trace_points(
VALUE self)
3064 const rb_iseq_t *iseq = iseqw_check(self);
3069 for (i=0; i<body->insns_info.size; i++) {
3071 if (entry->events) {
3072 push_event_info(iseq, entry->events, entry->line_no, ary);
3118 if (rb_frame_info_p(body)) {
3119 iseq = rb_get_iseq_from_frame_info(body);
3122 iseq = vm_proc_iseq(body);
3124 if (!rb_obj_is_iseq((
VALUE)iseq)) {
3129 iseq = rb_method_iseq(body);
3131 else if (rb_typeddata_is_instance_of(body, &iseqw_data_type)) {
3135 return iseq ? iseqw_new(iseq) :
Qnil;
3193 VALUE iseqw = iseqw_s_of(klass, body);
3194 return NIL_P(iseqw) ?
Qnil : rb_iseq_disasm(iseqw_check(iseqw));
3198register_label(
struct st_table *table,
unsigned long idx)
3201 st_insert(table, idx, sym);
3210 case CATCH_TYPE_RESCUE:
CONST_ID(
id,
"rescue");
break;
3211 case CATCH_TYPE_ENSURE:
CONST_ID(
id,
"ensure");
break;
3212 case CATCH_TYPE_RETRY:
CONST_ID(
id,
"retry");
break;
3213 case CATCH_TYPE_BREAK:
CONST_ID(
id,
"break");
break;
3214 case CATCH_TYPE_REDO:
CONST_ID(
id,
"redo");
break;
3215 case CATCH_TYPE_NEXT:
CONST_ID(
id,
"next");
break;
3217 rb_bug(
"unknown exception type: %d", (
int)
type);
3232 {(void (*)(
void *))rb_mark_tbl, (void (*)(
void *))st_free_table, 0, 0,},
3233 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
3236#define DECL_ID(name) \
3239#define INIT_ID(name) \
3240 id_##name = rb_intern(#name)
3243iseq_type_id(
enum rb_iseq_type
type)
3268 case ISEQ_TYPE_TOP:
return id_top;
3269 case ISEQ_TYPE_METHOD:
return id_method;
3270 case ISEQ_TYPE_BLOCK:
return id_block;
3271 case ISEQ_TYPE_CLASS:
return id_class;
3272 case ISEQ_TYPE_RESCUE:
return id_rescue;
3273 case ISEQ_TYPE_ENSURE:
return id_ensure;
3274 case ISEQ_TYPE_EVAL:
return id_eval;
3275 case ISEQ_TYPE_MAIN:
return id_main;
3276 case ISEQ_TYPE_PLAIN:
return id_plain;
3279 rb_bug(
"unsupported iseq type: %d", (
int)
type);
3291 VALUE *seq, *iseq_original;
3296 VALUE params = rb_hash_new();
3300 VALUE misc = rb_hash_new();
3302 static ID insn_syms[VM_BARE_INSTRUCTION_SIZE];
3303 struct st_table *labels_table = st_init_numtable();
3306 if (insn_syms[0] == 0) {
3308 for (i=0; i<numberof(insn_syms); i++) {
3309 insn_syms[i] = rb_intern(insn_name(i));
3314 type = iseq_type_id(iseq_body->type);
3317 for (i=0; i<iseq_body->local_table_size; i++) {
3318 ID lid = iseq_body->local_table[i];
3320 if (rb_id2str(lid)) {
3334 const struct rb_iseq_param_keyword *
const keyword = iseq_body->
param.keyword;
3337 if (iseq_body->
param.flags.has_opt) {
3338 int len = iseq_body->
param.opt_num + 1;
3341 for (j = 0; j <
len; j++) {
3342 VALUE l = register_label(labels_table, iseq_body->
param.opt_table[j]);
3345 rb_hash_aset(params,
ID2SYM(rb_intern(
"opt")), arg_opt_labels);
3349 if (iseq_body->
param.flags.has_lead) rb_hash_aset(params,
ID2SYM(rb_intern(
"lead_num")),
INT2FIX(iseq_body->
param.lead_num));
3350 if (iseq_body->
param.flags.has_post) rb_hash_aset(params,
ID2SYM(rb_intern(
"post_num")),
INT2FIX(iseq_body->
param.post_num));
3351 if (iseq_body->
param.flags.has_post) rb_hash_aset(params,
ID2SYM(rb_intern(
"post_start")),
INT2FIX(iseq_body->
param.post_start));
3352 if (iseq_body->
param.flags.has_rest) rb_hash_aset(params,
ID2SYM(rb_intern(
"rest_start")),
INT2FIX(iseq_body->
param.rest_start));
3353 if (iseq_body->
param.flags.has_block) rb_hash_aset(params,
ID2SYM(rb_intern(
"block_start")),
INT2FIX(iseq_body->
param.block_start));
3354 if (iseq_body->
param.flags.has_kw) {
3357 for (i=0; i<keyword->required_num; i++) {
3360 for (j=0; i<keyword->num; i++, j++) {
3361 VALUE key = rb_ary_new_from_args(1,
ID2SYM(keyword->table[i]));
3362 if (!UNDEF_P(keyword->default_values[j])) {
3368 rb_hash_aset(params,
ID2SYM(rb_intern(
"kwbits")),
3369 INT2FIX(keyword->bits_start));
3370 rb_hash_aset(params,
ID2SYM(rb_intern(
"keyword")), keywords);
3372 if (iseq_body->
param.flags.has_kwrest) rb_hash_aset(params,
ID2SYM(rb_intern(
"kwrest")),
INT2FIX(keyword->rest_start));
3373 if (iseq_body->
param.flags.ambiguous_param0) rb_hash_aset(params,
ID2SYM(rb_intern(
"ambiguous_param0")),
Qtrue);
3374 if (iseq_body->
param.flags.use_block) rb_hash_aset(params,
ID2SYM(rb_intern(
"use_block")),
Qtrue);
3378 iseq_original = rb_iseq_original_iseq((
rb_iseq_t *)iseq);
3380 for (seq = iseq_original; seq < iseq_original + iseq_body->iseq_size; ) {
3381 VALUE insn = *seq++;
3382 int j,
len = insn_len(insn);
3387 for (j=0; j<
len-1; j++, seq++) {
3388 enum ruby_insn_type_chars op_type = insn_op_type(insn, j);
3392 unsigned long idx = nseq - iseq_original + *seq;
3393 rb_ary_push(ary, register_label(labels_table, idx));
3407 VALUE val = iseq_data_to_ary(rb_iseq_check(iseq));
3418 const ID *ids = ((
IC)*seq)->segments;
3437 VALUE e = rb_hash_new();
3438 int argc = vm_ci_argc(ci);
3440 ID mid = vm_ci_mid(ci);
3442 rb_hash_aset(e,
ID2SYM(rb_intern(
"flag")),
UINT2NUM(vm_ci_flag(ci)));
3444 if (vm_ci_flag(ci) & VM_CALL_KWARG) {
3449 argc -= kwarg->keyword_len;
3450 for (i = 0; i < kwarg->keyword_len; i++) {
3453 rb_hash_aset(e,
ID2SYM(rb_intern(
"kw_arg")), kw);
3456 rb_hash_aset(e,
ID2SYM(rb_intern(
"orig_argc")),
3474 unsigned long idx = nseq - iseq_original + pos;
3477 register_label(labels_table, idx));
3484#if SIZEOF_VALUE <= SIZEOF_LONG
3494 VALUE val = rb_hash_new();
3495#if SIZEOF_VALUE <= SIZEOF_LONG
3500 rb_hash_aset(val,
ID2SYM(rb_intern(
"func_ptr")), func_ptr);
3508 rb_bug(
"unknown operand: %c", insn_op_type(insn, j));
3517 if (iseq_body->catch_table)
for (i=0; i<iseq_body->catch_table->size; i++) {
3520 UNALIGNED_MEMBER_PTR(iseq_body->catch_table, entries[i]);
3521 rb_ary_push(ary, exception_type2symbol(entry->type));
3523 rb_ary_push(ary, iseq_data_to_ary(rb_iseq_check(entry->iseq)));
3528 rb_ary_push(ary, register_label(labels_table, entry->start));
3529 rb_ary_push(ary, register_label(labels_table, entry->end));
3530 rb_ary_push(ary, register_label(labels_table, entry->cont));
3537 prev_insn_info = NULL;
3538#ifdef USE_ISEQ_NODE_ID
3547 if (st_lookup(labels_table, pos, &label)) {
3551 info = get_insn_info(iseq, pos);
3552#ifdef USE_ISEQ_NODE_ID
3556 if (prev_insn_info != info) {
3557 int line = info->line_no;
3560 if (line > 0 && last_line != line) {
3564#define CHECK_EVENT(ev) if (events & ev) rb_ary_push(body, ID2SYM(rb_intern(#ev)));
3574 prev_insn_info = info;
3584 rb_hash_aset(misc,
ID2SYM(rb_intern(
"local_size")),
INT2FIX(iseq_body->local_table_size));
3585 rb_hash_aset(misc,
ID2SYM(rb_intern(
"stack_max")),
INT2FIX(iseq_body->stack_max));
3586 rb_hash_aset(misc,
ID2SYM(rb_intern(
"node_id")),
INT2FIX(iseq_body->location.node_id));
3587 rb_hash_aset(misc,
ID2SYM(rb_intern(
"code_location")),
3588 rb_ary_new_from_args(4,
3589 INT2FIX(iseq_body->location.code_location.beg_pos.lineno),
3590 INT2FIX(iseq_body->location.code_location.beg_pos.column),
3591 INT2FIX(iseq_body->location.code_location.end_pos.lineno),
3592 INT2FIX(iseq_body->location.code_location.end_pos.column)));
3593#ifdef USE_ISEQ_NODE_ID
3594 rb_hash_aset(misc,
ID2SYM(rb_intern(
"node_ids")), node_ids);
3596 rb_hash_aset(misc,
ID2SYM(rb_intern(
"parser")), iseq_body->prism ?
ID2SYM(rb_intern(
"prism")) :
ID2SYM(rb_intern(
"parse.y")));
3621rb_iseq_parameters(
const rb_iseq_t *iseq,
int is_proc)
3625 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
3627 ID req, opt, rest, block, key, keyrest;
3628#define PARAM_TYPE(type) rb_ary_push(a = rb_ary_new2(2), ID2SYM(type))
3629#define PARAM_ID(i) body->local_table[(i)]
3630#define PARAM(i, type) ( \
3632 rb_id2str(PARAM_ID(i)) ? \
3633 rb_ary_push(a, ID2SYM(PARAM_ID(i))) : \
3639 if (body->
param.flags.forwardable) {
3650 for (i = 0; i < body->
param.lead_num; i++) {
3652 if (rb_id2str(PARAM_ID(i))) {
3659 for (i = 0; i < body->
param.lead_num; i++) {
3663 r = body->
param.lead_num + body->
param.opt_num;
3664 for (; i < r; i++) {
3666 if (rb_id2str(PARAM_ID(i))) {
3671 if (body->
param.flags.has_rest) {
3675 r = body->
param.post_start + body->
param.post_num;
3677 for (i = body->
param.post_start; i < r; i++) {
3679 if (rb_id2str(PARAM_ID(i))) {
3686 for (i = body->
param.post_start; i < r; i++) {
3690 if (body->
param.flags.accepts_no_kwarg) {
3696 if (body->
param.flags.has_kw) {
3698 if (keyword->required_num > 0) {
3701 for (; i < keyword->required_num; i++) {
3703 if (rb_id2str(keyword->table[i])) {
3710 for (; i < keyword->num; i++) {
3712 if (rb_id2str(keyword->table[i])) {
3718 if (body->
param.flags.has_kwrest || body->
param.flags.ruby2_keywords) {
3721 PARAM_TYPE(keyrest);
3722 if (body->
param.flags.has_kwrest &&
3723 rb_id2str(param = PARAM_ID(keyword->rest_start))) {
3726 else if (body->
param.flags.ruby2_keywords) {
3731 if (body->
param.flags.has_block) {
3739rb_iseq_defined_string(
enum defined_type
type)
3741 static const char expr_names[][18] = {
3743 "instance-variable",
3759 if ((
unsigned)(
type - 1) >= (
unsigned)numberof(expr_names)) rb_bug(
"unknown defined type %d",
type);
3760 estr = expr_names[
type - 1];
3761 return rb_fstring_cstr(estr);
3771 void *notrace_encoded_insn;
3772 void *trace_encoded_insn;
3775 void *zjit_encoded_insn;
3778static insn_data_t insn_data[VM_BARE_INSTRUCTION_SIZE];
3781rb_free_encoded_insn_data(
void)
3783 st_free_table(encoded_insn_data);
3789rb_vm_encoded_insn_data_table_init(
void)
3791#if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
3792 const void *
const *table = rb_vm_get_insns_address_table();
3793#define INSN_CODE(insn) ((VALUE)table[insn])
3795#define INSN_CODE(insn) ((VALUE)(insn))
3797 encoded_insn_data = st_init_numtable_with_size(VM_BARE_INSTRUCTION_SIZE);
3799 for (
int insn = 0; insn < VM_BARE_INSTRUCTION_SIZE; insn++) {
3800 insn_data[insn].insn = insn;
3801 insn_data[insn].insn_len = insn_len(insn);
3806 int notrace_insn = (insn != BIN(opt_invokebuiltin_delegate_leave)) ? insn : BIN(opt_invokebuiltin_delegate);
3807 insn_data[insn].notrace_encoded_insn = (
void *)INSN_CODE(notrace_insn);
3808 insn_data[insn].trace_encoded_insn = (
void *)INSN_CODE(notrace_insn + VM_BARE_INSTRUCTION_SIZE);
3810 st_data_t key1 = (st_data_t)INSN_CODE(insn);
3811 st_data_t key2 = (st_data_t)INSN_CODE(insn + VM_BARE_INSTRUCTION_SIZE);
3812 st_add_direct(encoded_insn_data, key1, (st_data_t)&insn_data[insn]);
3813 st_add_direct(encoded_insn_data, key2, (st_data_t)&insn_data[insn]);
3816 int zjit_insn = vm_bare_insn_to_zjit_insn(insn);
3817 insn_data[insn].zjit_insn = zjit_insn;
3818 insn_data[insn].zjit_encoded_insn = (insn != zjit_insn) ? (
void *)INSN_CODE(zjit_insn) : 0;
3820 if (insn != zjit_insn) {
3821 st_data_t key3 = (st_data_t)INSN_CODE(zjit_insn);
3822 st_add_direct(encoded_insn_data, key3, (st_data_t)&insn_data[insn]);
3832rb_vm_insn_addr2insn(
const void *addr)
3834 st_data_t key = (st_data_t)addr;
3837 if (st_lookup(encoded_insn_data, key, &val)) {
3839 return (
int)e->insn;
3842 rb_bug(
"rb_vm_insn_addr2insn: invalid insn address: %p", addr);
3848rb_vm_insn_addr2opcode(
const void *addr)
3850 st_data_t key = (st_data_t)addr;
3853 if (st_lookup(encoded_insn_data, key, &val)) {
3855 int opcode = e->insn;
3856 if (addr == e->trace_encoded_insn) {
3857 opcode += VM_BARE_INSTRUCTION_SIZE;
3860 else if (addr == e->zjit_encoded_insn) {
3861 opcode = e->zjit_insn;
3867 rb_bug(
"rb_vm_insn_addr2opcode: invalid insn address: %p", addr);
3874rb_vm_insn_decode(
const VALUE encoded)
3876#if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
3877 int insn = rb_vm_insn_addr2insn((
void *)encoded);
3879 int insn = (int)encoded;
3886encoded_iseq_trace_instrument(
VALUE *iseq_encoded_insn,
rb_event_flag_t turnon,
bool remain_current_trace)
3888 st_data_t key = (st_data_t)*iseq_encoded_insn;
3891 if (st_lookup(encoded_insn_data, key, &val)) {
3893 if (remain_current_trace && key == (st_data_t)e->trace_encoded_insn) {
3896 *iseq_encoded_insn = (
VALUE) (turnon ? e->trace_encoded_insn : e->notrace_encoded_insn);
3900 rb_bug(
"trace_instrument: invalid insn address: %p", (
void *)*iseq_encoded_insn);
3905rb_iseq_trace_flag_cleared(
const rb_iseq_t *iseq,
size_t pos)
3908 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3909 encoded_iseq_trace_instrument(&iseq_encoded[pos], 0,
false);
3935 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3937 VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
3939 for (pc=0; pc<body->iseq_size;) {
3943 unsigned int line = (int)entry->line_no;
3945 if (target_line == 0 || target_line == line) {
3949 target_events &= ~RUBY_EVENT_LINE;
3952 if (pc_events & target_events) {
3955 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (target_events | iseq->aux.exec.global_trace_events),
true);
3959 if (iseq->aux.exec.local_hooks == NULL) {
3961 iseq->aux.exec.local_hooks->is_local =
true;
3963 rb_hook_list_connect_tracepoint((
VALUE)iseq, iseq->aux.exec.local_hooks, tpval, target_line);
3972 unsigned int target_line;
3977iseq_add_local_tracepoint_i(
const rb_iseq_t *iseq,
void *p)
3980 data->n += iseq_add_local_tracepoint(iseq, data->turnon_events, data->tpval, data->target_line);
3981 iseq_iterate_children(iseq, iseq_add_local_tracepoint_i, p);
3985rb_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)
3988 if (target_bmethod) {
3989 turnon_events = add_bmethod_events(turnon_events);
3991 data.turnon_events = turnon_events;
3993 data.target_line = target_line;
3996 iseq_add_local_tracepoint_i(iseq, (
void *)&data);
3997 if (0)
rb_funcall(
Qnil, rb_intern(
"puts"), 1, rb_iseq_disasm(iseq));
4006 if (iseq->aux.exec.local_hooks) {
4009 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
4012 rb_hook_list_remove_tracepoint(iseq->aux.exec.local_hooks, tpval);
4013 local_events = iseq->aux.exec.local_hooks->events;
4015 if (local_events == 0) {
4016 rb_hook_list_free(iseq->aux.exec.local_hooks);
4017 ((
rb_iseq_t *)iseq)->aux.exec.local_hooks = NULL;
4020 local_events = add_bmethod_events(local_events);
4021 for (pc = 0; pc<body->iseq_size;) {
4023 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (local_events | iseq->aux.exec.global_trace_events),
false);
4035iseq_remove_local_tracepoint_i(
const rb_iseq_t *iseq,
void *p)
4038 data->n += iseq_remove_local_tracepoint(iseq, data->tpval);
4039 iseq_iterate_children(iseq, iseq_remove_local_tracepoint_i, p);
4043rb_iseq_remove_local_tracepoint_recursively(
const rb_iseq_t *iseq,
VALUE tpval)
4049 iseq_remove_local_tracepoint_i(iseq, (
void *)&data);
4056 if (iseq->aux.exec.global_trace_events == turnon_events) {
4060 if (!ISEQ_EXECUTABLE_P(iseq)) {
4067 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
4069 rb_event_flag_t local_events = iseq->aux.exec.local_hooks ? iseq->aux.exec.local_hooks->events : 0;
4070 ((
rb_iseq_t *)iseq)->aux.exec.global_trace_events = turnon_events;
4071 enabled_events = add_bmethod_events(turnon_events | local_events);
4073 for (pc=0; pc<body->iseq_size;) {
4075 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & enabled_events,
true);
4083clear_attr_cc(
VALUE v)
4085 if (imemo_type_p(v, imemo_callcache) && vm_cc_ivar_p((
const struct rb_callcache *)v)) {
4097 if (imemo_type_p(v, imemo_callcache) && vm_cc_bf_p((
const struct rb_callcache *)v)) {
4107clear_attr_ccs_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4110 for (; v != (
VALUE)vend; v += stride) {
4111 void *ptr = rb_asan_poisoned_object_p(v);
4112 rb_asan_unpoison_object(v,
false);
4114 asan_poison_object_if(ptr, v);
4120rb_clear_attr_ccs(
void)
4122 rb_objspace_each_objects(clear_attr_ccs_i, NULL);
4126clear_bf_ccs_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4129 for (; v != (
VALUE)vend; v += stride) {
4130 void *ptr = rb_asan_poisoned_object_p(v);
4131 rb_asan_unpoison_object(v,
false);
4133 asan_poison_object_if(ptr, v);
4139rb_clear_bf_ccs(
void)
4141 rb_objspace_each_objects(clear_bf_ccs_i, NULL);
4145trace_set_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4150 for (; v != (
VALUE)vend; v += stride) {
4151 void *ptr = rb_asan_poisoned_object_p(v);
4152 rb_asan_unpoison_object(v,
false);
4154 if (rb_obj_is_iseq(v)) {
4155 rb_iseq_trace_set(rb_iseq_check((
rb_iseq_t *)v), turnon_events);
4157 else if (clear_attr_cc(v)) {
4159 else if (clear_bf_cc(v)) {
4162 asan_poison_object_if(ptr, v);
4170 rb_objspace_each_objects(trace_set_i, &turnon_events);
4174rb_iseqw_local_variables(
VALUE iseqval)
4176 return rb_iseq_local_variables(iseqw_check(iseqval));
4197iseqw_to_binary(
int argc,
VALUE *argv,
VALUE self)
4200 return rb_iseq_ibf_dump(iseqw_check(self), opt);
4217iseqw_s_load_from_binary(
VALUE self,
VALUE str)
4219 return iseqw_new(rb_iseq_ibf_load(str));
4229iseqw_s_load_from_binary_extra_data(
VALUE self,
VALUE str)
4231 return rb_iseq_ibf_load_extra_data(str);
4234#if VM_INSN_INFO_TABLE_IMPL == 2
4267#define IMMEDIATE_TABLE_SIZE 54
4269struct succ_index_table {
4270 uint64_t imm_part[IMMEDIATE_TABLE_SIZE / 9];
4271 struct succ_dict_block {
4273 uint64_t small_block_ranks;
4274 uint64_t bits[512/64];
4275 } succ_part[FLEX_ARY_LEN];
4278#define imm_block_rank_set(v, i, r) (v) |= (uint64_t)(r) << (7 * (i))
4279#define imm_block_rank_get(v, i) (((int)((v) >> ((i) * 7))) & 0x7f)
4280#define small_block_rank_set(v, i, r) (v) |= (uint64_t)(r) << (9 * ((i) - 1))
4281#define small_block_rank_get(v, i) ((i) == 0 ? 0 : (((int)((v) >> (((i) - 1) * 9))) & 0x1ff))
4283static struct succ_index_table *
4284succ_index_table_create(
int max_pos,
int *data,
int size)
4286 const int imm_size = (max_pos < IMMEDIATE_TABLE_SIZE ? max_pos + 8 : IMMEDIATE_TABLE_SIZE) / 9;
4287 const int succ_size = (max_pos < IMMEDIATE_TABLE_SIZE ? 0 : (max_pos - IMMEDIATE_TABLE_SIZE + 511)) / 512;
4288 struct succ_index_table *sd =
4289 rb_xcalloc_mul_add_mul(
4290 imm_size,
sizeof(uint64_t),
4291 succ_size,
sizeof(
struct succ_dict_block));
4295 for (j = 0; j < imm_size; j++) {
4296 for (i = 0; i < 9; i++) {
4297 if (r < size && data[r] == j * 9 + i) r++;
4298 imm_block_rank_set(sd->imm_part[j], i, r);
4301 for (k = 0; k < succ_size; k++) {
4302 struct succ_dict_block *sd_block = &sd->succ_part[k];
4305 for (j = 0; j < 8; j++) {
4307 if (j) small_block_rank_set(sd_block->small_block_ranks, j, small_rank);
4308 for (i = 0; i < 64; i++) {
4309 if (r < size && data[r] == k * 512 + j * 64 + i + IMMEDIATE_TABLE_SIZE) {
4310 bits |= ((uint64_t)1) << i;
4314 sd_block->bits[j] = bits;
4315 small_rank += rb_popcount64(bits);
4321static unsigned int *
4322succ_index_table_invert(
int max_pos,
struct succ_index_table *sd,
int size)
4324 const int imm_size = (max_pos < IMMEDIATE_TABLE_SIZE ? max_pos + 8 : IMMEDIATE_TABLE_SIZE) / 9;
4325 const int succ_size = (max_pos < IMMEDIATE_TABLE_SIZE ? 0 : (max_pos - IMMEDIATE_TABLE_SIZE + 511)) / 512;
4326 unsigned int *positions =
ALLOC_N(
unsigned int, size), *p;
4327 int i, j, k, r = -1;
4329 for (j = 0; j < imm_size; j++) {
4330 for (i = 0; i < 9; i++) {
4331 int nr = imm_block_rank_get(sd->imm_part[j], i);
4332 if (r != nr) *p++ = j * 9 + i;
4336 for (k = 0; k < succ_size; k++) {
4337 for (j = 0; j < 8; j++) {
4338 for (i = 0; i < 64; i++) {
4339 if (sd->succ_part[k].bits[j] & (((uint64_t)1) << i)) {
4340 *p++ = k * 512 + j * 64 + i + IMMEDIATE_TABLE_SIZE;
4349succ_index_lookup(
const struct succ_index_table *sd,
int x)
4351 if (x < IMMEDIATE_TABLE_SIZE) {
4352 const int i = x / 9;
4353 const int j = x % 9;
4354 return imm_block_rank_get(sd->imm_part[i], j);
4357 const int block_index = (x - IMMEDIATE_TABLE_SIZE) / 512;
4358 const struct succ_dict_block *block = &sd->succ_part[block_index];
4359 const int block_bit_index = (x - IMMEDIATE_TABLE_SIZE) % 512;
4360 const int small_block_index = block_bit_index / 64;
4361 const int small_block_popcount = small_block_rank_get(block->small_block_ranks, small_block_index);
4362 const int popcnt = rb_popcount64(block->bits[small_block_index] << (63 - block_bit_index % 64));
4364 return block->rank + small_block_popcount + popcnt;
4383iseqw_script_lines(
VALUE self)
4385 const rb_iseq_t *iseq = iseqw_check(self);
4386 return ISEQ_BODY(iseq)->variable.script_lines;
#define RUBY_ASSERT(...)
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.
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 SYM2ID
Old name of RB_SYM2ID.
#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.
void rb_exc_raise(VALUE mesg)
Raises an exception in the current thread.
VALUE rb_eTypeError
TypeError exception.
void * rb_check_typeddata(VALUE obj, const rb_data_type_t *data_type)
Identical to rb_typeddata_is_kind_of(), except it raises exceptions instead of returning false.
VALUE rb_eSyntaxError
SyntaxError exception.
VALUE rb_class_superclass(VALUE klass)
Queries the parent of the given class.
VALUE rb_obj_hide(VALUE obj)
Make the object invisible from Ruby code.
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_WRITE(old, slot, young)
Declaration of a "back" pointer.
VALUE rb_funcall(VALUE recv, ID mid, int n,...)
Calls a method.
Defines RBIMPL_HAS_BUILTIN.
VALUE rb_ary_new_from_values(long n, const VALUE *elts)
Identical to rb_ary_new_from_args(), except how objects are passed.
VALUE rb_ary_resurrect(VALUE ary)
I guess there is no use case of this function in extension libraries, but this is a routine identical...
VALUE rb_ary_new(void)
Allocates a new, empty array.
VALUE rb_ary_hidden_new(long capa)
Allocates a hidden (no class) empty array.
VALUE rb_ary_push(VALUE ary, VALUE elem)
Special case of rb_ary_cat() that it adds only one element.
VALUE rb_ary_freeze(VALUE obj)
Freeze an array, preventing further modifications.
VALUE rb_ary_entry(VALUE ary, long off)
Queries an element of an array.
VALUE rb_ary_join(VALUE ary, VALUE sep)
Recursively stringises the elements of the passed array, flattens that result, then joins the sequenc...
void rb_ary_store(VALUE ary, long key, VALUE val)
Destructively stores the passed value to the passed array's passed index.
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_dup(VALUE str)
Duplicates a string.
VALUE rb_str_cat(VALUE dst, const char *src, long srclen)
Destructively appends the passed contents to the 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...
void rb_str_set_len(VALUE str, long len)
Overwrites the length of the string.
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_str_intern(VALUE str)
Identical to rb_to_symbol(), except it assumes the receiver being an instance of RString.
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 symbol)
Obtain a frozen string representation of a symbol (not including the leading colon).
VALUE rb_io_path(VALUE io)
Returns the path for the given IO.
int len
Length of the buffer.
VALUE rb_ractor_make_shareable(VALUE obj)
Destructively transforms the passed object so that multiple Ractors can share it.
#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 RHASH_SIZE(h)
Queries the size of the hash.
#define StringValue(v)
Ensures that the parameter object is a String.
static char * RSTRING_END(VALUE str)
Queries the end of the contents pointer of the string.
#define StringValueCStr(v)
Identical to StringValuePtr, except it additionally checks for the contents for viability as a C stri...
#define RUBY_TYPED_DEFAULT_FREE
This is a value you can set to rb_data_type_struct::dfree.
#define TypedData_Get_Struct(obj, type, data_type, sval)
Obtains a C struct from inside of a wrapper Ruby object.
#define TypedData_Wrap_Struct(klass, data_type, sval)
Converts sval, a pointer to your struct, into a Ruby object.
#define TypedData_Make_Struct(klass, type, data_type, sval)
Identical to TypedData_Wrap_Struct, except it allocates a new data region internally instead of takin...
#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.
uint32_t column
The column number.
int32_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.
size_t size
The number of offsets in the list.
uint32_t node_id
The unique identifier for this node, which is deterministic based on the source.
pm_location_t location
This is the location of the node in the source.
int32_t line
The line within the file that the parse starts on.
pm_scope_node_t node
The resulting scope node that will hold the generated AST.
pm_options_t options
The options that will be passed to the parser.
int32_t start_line
The line number at the start of the parse.
pm_newline_list_t newline_list
This is the list of newline offsets in the source file.
VALUE * script_lines
This is a pointer to the list of script lines for the ISEQs that will be associated with this scope n...
This is the struct that holds necessary info for a struct.
struct rb_iseq_constant_body::@154 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.
static bool RB_TYPE_P(VALUE obj, enum ruby_value_type t)
Queries if the given object is of given type.
ruby_value_type
C-level type of an object.