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) && vm_cc_valid(cc)) {
330 if (reference_updating) {
333 if (!METHOD_ENTRY_INVALIDATED(cme)) {
342rb_iseq_mark_and_move(
rb_iseq_t *iseq,
bool reference_updating)
344 RUBY_MARK_ENTER(
"iseq");
346 rb_gc_mark_and_move(&iseq->wrapper);
348 if (ISEQ_BODY(iseq)) {
351 rb_iseq_mark_and_move_each_body_value(iseq, reference_updating ? ISEQ_ORIGINAL_ISEQ(iseq) : NULL);
353 rb_gc_mark_and_move(&body->variable.coverage);
354 rb_gc_mark_and_move(&body->variable.pc2branchindex);
355 rb_gc_mark_and_move(&body->variable.script_lines);
356 rb_gc_mark_and_move(&body->location.label);
357 rb_gc_mark_and_move(&body->location.base_label);
358 rb_gc_mark_and_move(&body->location.pathobj);
359 if (body->local_iseq) rb_gc_mark_and_move_ptr(&body->local_iseq);
360 if (body->parent_iseq) rb_gc_mark_and_move_ptr(&body->parent_iseq);
361 if (body->mandatory_only_iseq) rb_gc_mark_and_move_ptr(&body->mandatory_only_iseq);
363 if (body->call_data) {
364 for (
unsigned int i = 0; i < body->ci_size; i++) {
367 if (cds[i].ci) rb_gc_mark_and_move_ptr(&cds[i].ci);
369 if (cc_is_active(cds[i].cc, reference_updating)) {
370 rb_gc_mark_and_move_ptr(&cds[i].cc);
372 else if (cds[i].cc != rb_vm_empty_cc()) {
373 cds[i].cc = rb_vm_empty_cc();
378 if (body->
param.flags.has_kw && body->
param.keyword != NULL) {
379 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
381 if (keyword->default_values != NULL) {
382 for (
int j = 0, i = keyword->required_num; i < keyword->num; i++, j++) {
383 rb_gc_mark_and_move(&keyword->default_values[j]);
388 if (body->catch_table) {
391 for (
unsigned int i = 0; i < table->size; i++) {
393 entry = UNALIGNED_MEMBER_PTR(table, entries[i]);
395 rb_gc_mark_and_move_ptr(&entry->iseq);
400 if (reference_updating) {
402 rb_yjit_iseq_update_references(iseq);
405 rb_zjit_iseq_update_references(body->zjit_payload);
410 rb_yjit_iseq_mark(body->yjit_payload);
413 rb_zjit_iseq_mark(body->zjit_payload);
419 rb_gc_mark_and_move(&iseq->aux.loader.obj);
424 rb_iseq_mark_and_move_insn_storage(compile_data->insn.storage_head);
425 rb_iseq_mark_and_move_each_compile_data_value(iseq, reference_updating ? ISEQ_ORIGINAL_ISEQ(iseq) : NULL);
427 rb_gc_mark_and_move((
VALUE *)&compile_data->err_info);
428 rb_gc_mark_and_move((
VALUE *)&compile_data->catch_table_ary);
432 VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
434 if (iseq->aux.exec.local_hooks) {
435 rb_hook_list_mark_and_move(iseq->aux.exec.local_hooks);
439 RUBY_MARK_LEAVE(
"iseq");
443param_keyword_size(
const struct rb_iseq_param_keyword *pkw)
447 if (!pkw)
return size;
449 size +=
sizeof(
struct rb_iseq_param_keyword);
450 size +=
sizeof(
VALUE) * (pkw->num - pkw->required_num);
464 if (ISEQ_EXECUTABLE_P(iseq) && body) {
466 size += body->iseq_size *
sizeof(
VALUE);
468 size += body->local_table_size *
sizeof(
ID);
469 size += ISEQ_MBITS_BUFLEN(body->iseq_size) * ISEQ_MBITS_SIZE;
470 if (body->catch_table) {
471 size += iseq_catch_table_bytes(body->catch_table->size);
473 size += (body->
param.opt_num + 1) *
sizeof(
VALUE);
474 size += param_keyword_size(body->
param.keyword);
479 if (ISEQ_BODY(iseq)->is_entries) {
481 for (
unsigned int ic_idx = 0; ic_idx < body->ic_size; ic_idx++) {
482 IC ic = &ISEQ_IS_IC_ENTRY(body, ic_idx);
497 compile_data = ISEQ_COMPILE_DATA(iseq);
503 cur = compile_data->node.storage_head;
514rb_iseq_constant_body_alloc(
void)
525 ISEQ_BODY(iseq) = rb_iseq_constant_body_alloc();
530rb_iseq_pathobj_new(
VALUE path,
VALUE realpath)
536 if (path == realpath ||
538 pathobj = rb_fstring(path);
541 if (!
NIL_P(realpath)) realpath = rb_fstring(realpath);
542 pathobj = rb_ary_new_from_args(2, rb_fstring(path), realpath);
552 rb_iseq_pathobj_new(path, realpath));
557rb_iseq_alloc_with_dummy_path(
VALUE fname)
561 ISEQ_BODY(dummy_iseq)->type = ISEQ_TYPE_TOP;
562 RB_OBJ_WRITE(dummy_iseq, &ISEQ_BODY(dummy_iseq)->location.pathobj, fname);
563 RB_OBJ_WRITE(dummy_iseq, &ISEQ_BODY(dummy_iseq)->location.label, fname);
573 rb_iseq_pathobj_set(iseq, path, realpath);
576 loc->first_lineno = first_lineno;
578 if (ISEQ_BODY(iseq)->local_iseq == iseq && strcmp(RSTRING_PTR(name),
"initialize") == 0) {
579 ISEQ_BODY(iseq)->param.flags.use_block = 1;
583 loc->node_id = node_id;
584 loc->code_location = *code_location;
587 loc->code_location.beg_pos.lineno = 0;
588 loc->code_location.beg_pos.column = 0;
589 loc->code_location.end_pos.lineno = -1;
590 loc->code_location.end_pos.column = -1;
603 if (
type == ISEQ_TYPE_TOP) {
604 body->local_iseq = iseq;
606 else if (
type == ISEQ_TYPE_METHOD ||
type == ISEQ_TYPE_CLASS) {
607 body->local_iseq = iseq;
610 RB_OBJ_WRITE(iseq, &body->local_iseq, ISEQ_BODY(piseq)->local_iseq);
617 if (
type == ISEQ_TYPE_MAIN) {
618 body->local_iseq = iseq;
627 ALLOC_N(
char, INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE +
632 new_arena->size = INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE;
638prepare_node_id(
const NODE *node)
640 if (!node)
return -1;
642 if (nd_type(node) == NODE_SCOPE && RNODE_SCOPE(node)->nd_parent) {
643 return nd_node_id(RNODE_SCOPE(node)->nd_parent);
646 return nd_node_id(node);
652 const rb_iseq_t *parent,
int isolated_depth,
enum rb_iseq_type
type,
659 if (parent && (
type == ISEQ_TYPE_MAIN ||
type == ISEQ_TYPE_TOP))
663 set_relation(iseq, parent);
665 name = rb_fstring(name);
666 iseq_location_setup(iseq, name, path, realpath, first_lineno, code_location, node_id);
667 if (iseq != body->local_iseq) {
668 RB_OBJ_WRITE(iseq, &body->location.base_label, ISEQ_BODY(body->local_iseq)->location.label);
670 ISEQ_COVERAGE_SET(iseq,
Qnil);
671 ISEQ_ORIGINAL_ISEQ_CLEAR(iseq);
672 body->variable.flip_count = 0;
674 if (
NIL_P(script_lines)) {
681 ISEQ_COMPILE_DATA_ALLOC(iseq);
682 RB_OBJ_WRITE(iseq, &ISEQ_COMPILE_DATA(iseq)->err_info, err_info);
685 ISEQ_COMPILE_DATA(iseq)->node.storage_head = ISEQ_COMPILE_DATA(iseq)->node.storage_current = new_arena();
686 ISEQ_COMPILE_DATA(iseq)->insn.storage_head = ISEQ_COMPILE_DATA(iseq)->insn.storage_current = new_arena();
687 ISEQ_COMPILE_DATA(iseq)->isolated_depth = isolated_depth;
688 ISEQ_COMPILE_DATA(iseq)->option = option;
689 ISEQ_COMPILE_DATA(iseq)->ivar_cache_table = NULL;
690 ISEQ_COMPILE_DATA(iseq)->builtin_function_table = GET_VM()->builtin_function_table;
692 if (option->coverage_enabled) {
693 VALUE coverages = rb_get_coverages();
694 if (
RTEST(coverages)) {
695 coverage = rb_hash_lookup(coverages, rb_iseq_path(iseq));
699 ISEQ_COVERAGE_SET(iseq, coverage);
700 if (coverage && ISEQ_BRANCH_COVERAGE(iseq))
706#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
707static void validate_get_insn_info(
const rb_iseq_t *iseq);
711rb_iseq_insns_info_encode_positions(
const rb_iseq_t *iseq)
713#if VM_INSN_INFO_TABLE_IMPL == 2
716 int size = body->insns_info.size;
717 int max_pos = body->iseq_size;
718 int *data = (
int *)body->insns_info.positions;
719 if (body->insns_info.succ_index_table) ruby_xfree(body->insns_info.succ_index_table);
720 body->insns_info.succ_index_table = succ_index_table_create(max_pos, data, size);
721#if VM_CHECK_MODE == 0
722 ruby_xfree(body->insns_info.positions);
723 body->insns_info.positions = NULL;
728#if VM_INSN_INFO_TABLE_IMPL == 2
732 int size = body->insns_info.size;
733 int max_pos = body->iseq_size;
734 struct succ_index_table *sd = body->insns_info.succ_index_table;
735 return succ_index_table_invert(max_pos, sd, size);
742 iseq->aux.exec.global_trace_events = 0;
743 if (ruby_vm_event_enabled_global_flags & ISEQ_TRACE_EVENTS) {
744 rb_iseq_trace_set(iseq, ruby_vm_event_enabled_global_flags & ISEQ_TRACE_EVENTS);
753 VALUE err = data->err_info;
754 ISEQ_COMPILE_DATA_CLEAR(iseq);
755 compile_data_free(data);
757#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
758 validate_get_insn_info(iseq);
762 VALUE path = pathobj_path(body->location.pathobj);
764 rb_funcallv(err, rb_intern(
"set_backtrace"), 1, &path);
768 RB_DEBUG_COUNTER_INC(iseq_num);
769 RB_DEBUG_COUNTER_ADD(iseq_cd_num, ISEQ_BODY(iseq)->ci_size);
771 rb_iseq_init_trace(iseq);
776 .inline_const_cache = OPT_INLINE_CONST_CACHE,
777 .peephole_optimization = OPT_PEEPHOLE_OPTIMIZATION,
778 .tailcall_optimization = OPT_TAILCALL_OPTIMIZATION,
779 .specialized_instruction = OPT_SPECIALISED_INSTRUCTION,
780 .operands_unification = OPT_OPERANDS_UNIFICATION,
781 .instructions_unification = OPT_INSTRUCTIONS_UNIFICATION,
782 .frozen_string_literal = OPT_FROZEN_STRING_LITERAL,
783 .debug_frozen_string_literal = OPT_DEBUG_FROZEN_STRING_LITERAL,
784 .coverage_enabled = TRUE,
788 .frozen_string_literal = -1,
792rb_iseq_opt_frozen_string_literal(
void)
794 return COMPILE_OPTION_DEFAULT.frozen_string_literal;
800#define SET_COMPILE_OPTION(o, h, mem) \
801 { VALUE flag = rb_hash_aref((h), ID2SYM(rb_intern(#mem))); \
802 if (flag == Qtrue) { (o)->mem = 1; } \
803 else if (flag == Qfalse) { (o)->mem = 0; } \
805#define SET_COMPILE_OPTION_NUM(o, h, mem) \
806 { VALUE num = rb_hash_aref((h), ID2SYM(rb_intern(#mem))); \
807 if (!NIL_P(num)) (o)->mem = NUM2INT(num); \
809 SET_COMPILE_OPTION(option, opt, inline_const_cache);
810 SET_COMPILE_OPTION(option, opt, peephole_optimization);
811 SET_COMPILE_OPTION(option, opt, tailcall_optimization);
812 SET_COMPILE_OPTION(option, opt, specialized_instruction);
813 SET_COMPILE_OPTION(option, opt, operands_unification);
814 SET_COMPILE_OPTION(option, opt, instructions_unification);
815 SET_COMPILE_OPTION(option, opt, frozen_string_literal);
816 SET_COMPILE_OPTION(option, opt, debug_frozen_string_literal);
817 SET_COMPILE_OPTION(option, opt, coverage_enabled);
818 SET_COMPILE_OPTION_NUM(option, opt, debug_level);
819#undef SET_COMPILE_OPTION
820#undef SET_COMPILE_OPTION_NUM
826#define SET_COMPILE_OPTION(o, a, mem) \
827 ((a)->mem < 0 ? 0 : ((o)->mem = (a)->mem > 0))
828 SET_COMPILE_OPTION(option, ast, coverage_enabled);
829#undef SET_COMPILE_OPTION
830 if (ast->frozen_string_literal >= 0) {
831 option->frozen_string_literal = ast->frozen_string_literal;
840 *option = COMPILE_OPTION_DEFAULT;
843 *option = COMPILE_OPTION_FALSE;
845 else if (opt ==
Qtrue) {
848 ((
int *)option)[i] = 1;
851 *option = COMPILE_OPTION_DEFAULT;
852 set_compile_option_from_hash(option, opt);
855 rb_raise(
rb_eTypeError,
"Compile option must be Hash/true/false/nil");
862 VALUE opt = rb_hash_new_with_size(11);
863#define SET_COMPILE_OPTION(o, h, mem) \
864 rb_hash_aset((h), ID2SYM(rb_intern(#mem)), RBOOL((o)->mem))
865#define SET_COMPILE_OPTION_NUM(o, h, mem) \
866 rb_hash_aset((h), ID2SYM(rb_intern(#mem)), INT2NUM((o)->mem))
868 SET_COMPILE_OPTION(option, opt, inline_const_cache);
869 SET_COMPILE_OPTION(option, opt, peephole_optimization);
870 SET_COMPILE_OPTION(option, opt, tailcall_optimization);
871 SET_COMPILE_OPTION(option, opt, specialized_instruction);
872 SET_COMPILE_OPTION(option, opt, operands_unification);
873 SET_COMPILE_OPTION(option, opt, instructions_unification);
874 SET_COMPILE_OPTION(option, opt, debug_frozen_string_literal);
875 SET_COMPILE_OPTION(option, opt, coverage_enabled);
876 SET_COMPILE_OPTION_NUM(option, opt, debug_level);
878#undef SET_COMPILE_OPTION
879#undef SET_COMPILE_OPTION_NUM
880 VALUE frozen_string_literal = option->frozen_string_literal == -1 ?
Qnil : RBOOL(option->frozen_string_literal);
881 rb_hash_aset(opt,
ID2SYM(rb_intern(
"frozen_string_literal")), frozen_string_literal);
889 return rb_iseq_new_with_opt(ast_value, name, path, realpath, 0, parent,
890 0,
type, &COMPILE_OPTION_DEFAULT,
895ast_line_count(
const VALUE ast_value)
897 rb_ast_t *ast = rb_ruby_ast_data_get(ast_value);
898 return ast->body.line_count;
902iseq_setup_coverage(
VALUE coverages,
VALUE path,
int line_count)
904 if (line_count >= 0) {
905 int len = (rb_get_coverage_mode() & COVERAGE_TARGET_ONESHOT_LINES) ? 0 : line_count;
907 VALUE coverage = rb_default_coverage(
len);
908 rb_hash_aset(coverages, path, coverage);
917iseq_new_setup_coverage(
VALUE path,
int line_count)
919 VALUE coverages = rb_get_coverages();
921 if (
RTEST(coverages)) {
922 iseq_setup_coverage(coverages, path, line_count);
929 iseq_new_setup_coverage(path, ast_line_count(ast_value));
931 return rb_iseq_new_with_opt(ast_value, name, path, realpath, 0, parent, 0,
932 ISEQ_TYPE_TOP, &COMPILE_OPTION_DEFAULT,
944 return pm_iseq_new_with_opt(node, name, path, realpath, 0, parent, 0,
945 ISEQ_TYPE_TOP, &COMPILE_OPTION_DEFAULT, error_state);
951 iseq_new_setup_coverage(path, ast_line_count(ast_value));
953 return rb_iseq_new_with_opt(ast_value, rb_fstring_lit(
"<main>"),
955 parent, 0, ISEQ_TYPE_MAIN, opt ? &COMPILE_OPTION_DEFAULT : &COMPILE_OPTION_FALSE,
968 return pm_iseq_new_with_opt(node, rb_fstring_lit(
"<main>"),
970 parent, 0, ISEQ_TYPE_MAIN, opt ? &COMPILE_OPTION_DEFAULT : &COMPILE_OPTION_FALSE, error_state);
974rb_iseq_new_eval(
const VALUE ast_value,
VALUE name,
VALUE path,
VALUE realpath,
int first_lineno,
const rb_iseq_t *parent,
int isolated_depth)
976 if (rb_get_coverage_mode() & COVERAGE_TARGET_EVAL) {
977 VALUE coverages = rb_get_coverages();
978 if (
RTEST(coverages) &&
RTEST(path) && !
RTEST(rb_hash_has_key(coverages, path))) {
979 iseq_setup_coverage(coverages, path, ast_line_count(ast_value) + first_lineno - 1);
983 return rb_iseq_new_with_opt(ast_value, name, path, realpath, first_lineno,
984 parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT,
990 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
int *error_state)
992 if (rb_get_coverage_mode() & COVERAGE_TARGET_EVAL) {
993 VALUE coverages = rb_get_coverages();
994 if (
RTEST(coverages) &&
RTEST(path) && !
RTEST(rb_hash_has_key(coverages, path))) {
995 iseq_setup_coverage(coverages, path, ((
int) (node->parser->
newline_list.
size - 1)) + first_lineno - 1);
999 return pm_iseq_new_with_opt(node, name, path, realpath, first_lineno,
1000 parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT, error_state);
1007 VALUE v1 = iseqw_new(iseq);
1009 if (v1 != v2 &&
CLASS_OF(v2) == rb_cISeq) {
1019 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
1023 rb_ast_t *ast = rb_ruby_ast_data_get(ast_value);
1025 const NODE *node = body ? body->root : 0;
1030 if (!option) option = &COMPILE_OPTION_DEFAULT;
1033 option = set_compile_option_from_ast(&new_opt, body);
1036 if (!
NIL_P(script_lines)) {
1039 else if (body && body->script_lines) {
1040 script_lines = rb_parser_build_script_lines_from(body->script_lines);
1043 script_lines = ISEQ_BODY(parent)->variable.script_lines;
1046 prepare_iseq_build(iseq, name, path, realpath, first_lineno, node ? &node->nd_loc : NULL, prepare_node_id(node),
1047 parent, isolated_depth,
type, script_lines, option);
1049 rb_iseq_compile_node(iseq, node);
1050 finish_iseq_build(iseq);
1053 return iseq_translate(iseq);
1062pm_iseq_new_with_opt_try(
VALUE d)
1067 pm_iseq_compile_node(data->iseq, data->node);
1070 finish_iseq_build(data->iseq);
1089 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
1093 ISEQ_BODY(iseq)->prism =
true;
1096 if (!option) option = &COMPILE_OPTION_DEFAULT;
1098 next_option = *option;
1099 next_option.coverage_enabled = node->coverage_enabled < 0 ? 0 : node->coverage_enabled > 0;
1100 option = &next_option;
1103 int32_t start_line = node->parser->
start_line;
1109 .beg_pos = { .lineno = (int) start.
line, .column = (
int) start.
column },
1110 .end_pos = { .lineno = (int) end.
line, .column = (
int) end.
column }
1113 prepare_iseq_build(iseq, name, path, realpath, first_lineno, &code_location, node->ast_node->
node_id,
1114 parent, isolated_depth,
type, node->
script_lines == NULL ?
Qnil : *node->script_lines, option);
1120 rb_protect(pm_iseq_new_with_opt_try, (
VALUE)&data, error_state);
1122 if (*error_state)
return NULL;
1124 return iseq_translate(iseq);
1128rb_iseq_new_with_callback(
1131 int first_lineno,
const rb_iseq_t *parent,
1137 if (!option) option = &COMPILE_OPTION_DEFAULT;
1138 prepare_iseq_build(iseq, name, path, realpath, first_lineno, NULL, -1, parent, 0,
type,
Qnil, option);
1140 rb_iseq_compile_callback(iseq, ifunc);
1141 finish_iseq_build(iseq);
1147rb_iseq_load_iseq(
VALUE fname)
1152 return iseqw_check(iseqv);
1158#define CHECK_ARRAY(v) rb_to_array_type(v)
1159#define CHECK_HASH(v) rb_to_hash_type(v)
1160#define CHECK_STRING(v) rb_str_to_str(v)
1161#define CHECK_SYMBOL(v) rb_to_symbol_type(v)
1164static enum rb_iseq_type
1167 const ID id_top = rb_intern(
"top");
1168 const ID id_method = rb_intern(
"method");
1169 const ID id_block = rb_intern(
"block");
1170 const ID id_class = rb_intern(
"class");
1171 const ID id_rescue = rb_intern(
"rescue");
1172 const ID id_ensure = rb_intern(
"ensure");
1173 const ID id_eval = rb_intern(
"eval");
1174 const ID id_main = rb_intern(
"main");
1175 const ID id_plain = rb_intern(
"plain");
1179 if (
typeid == id_top)
return ISEQ_TYPE_TOP;
1180 if (
typeid == id_method)
return ISEQ_TYPE_METHOD;
1181 if (
typeid == id_block)
return ISEQ_TYPE_BLOCK;
1182 if (
typeid == id_class)
return ISEQ_TYPE_CLASS;
1183 if (
typeid == id_rescue)
return ISEQ_TYPE_RESCUE;
1184 if (
typeid == id_ensure)
return ISEQ_TYPE_ENSURE;
1185 if (
typeid == id_eval)
return ISEQ_TYPE_EVAL;
1186 if (
typeid == id_main)
return ISEQ_TYPE_MAIN;
1187 if (
typeid == id_plain)
return ISEQ_TYPE_PLAIN;
1188 return (
enum rb_iseq_type)-1;
1196 VALUE magic, version1, version2, format_type, misc;
1197 VALUE name, path, realpath, code_location, node_id;
1198 VALUE type, body, locals, params, exception;
1200 st_data_t iseq_type;
1210 data = CHECK_ARRAY(data);
1217 ((void)magic, (
void)version1, (void)version2, (
void)format_type);
1222 realpath =
NIL_P(realpath) ?
Qnil : CHECK_STRING(realpath);
1231 ISEQ_BODY(iseq)->local_iseq = iseq;
1233 iseq_type = iseq_type_from_sym(
type);
1234 if (iseq_type == (
enum rb_iseq_type)-1) {
1238 node_id = rb_hash_aref(misc,
ID2SYM(rb_intern(
"node_id")));
1240 code_location = rb_hash_aref(misc,
ID2SYM(rb_intern(
"code_location")));
1248 if (
SYM2ID(rb_hash_aref(misc,
ID2SYM(rb_intern(
"parser")))) == rb_intern(
"prism")) {
1249 ISEQ_BODY(iseq)->prism =
true;
1252 make_compile_option(&option, opt);
1253 option.peephole_optimization = FALSE;
1254 prepare_iseq_build(iseq, name, path, realpath, first_lineno, &tmp_loc,
NUM2INT(node_id),
1255 parent, 0, (
enum rb_iseq_type)iseq_type,
Qnil, &option);
1257 rb_iseq_build_from_ary(iseq, misc, locals, params, exception, body);
1259 finish_iseq_build(iseq);
1261 return iseqw_new(iseq);
1268iseq_s_load(
int argc,
VALUE *argv,
VALUE self)
1272 return iseq_load(data, NULL, opt);
1278 return iseq_load(data,
RTEST(parent) ? (
rb_iseq_t *)parent : NULL, opt);
1286#if !defined(__GNUC__) || (__GNUC__ == 4 && __GNUC_MINOR__ == 8)
1287# define INITIALIZED volatile
1293 VALUE INITIALIZED ast_value;
1295 VALUE name = rb_fstring_lit(
"<compiled>");
1298 make_compile_option(&option, opt);
1302 parse = rb_parser_compile_file_path;
1305 parse = rb_parser_compile_string_path;
1309 const VALUE parser = rb_parser_new();
1310 const rb_iseq_t *outer_scope = rb_iseq_new(
Qnil, name, name,
Qnil, 0, ISEQ_TYPE_TOP);
1312 rb_parser_set_context(parser, outer_scope, FALSE);
1313 if (ruby_vm_keep_script_lines) rb_parser_set_script_lines(parser);
1315 ast_value = (*parse)(parser, file, src, ln);
1318 ast = rb_ruby_ast_data_get(ast_value);
1320 if (!ast || !ast->body.root) {
1321 rb_ast_dispose(ast);
1325 iseq = rb_iseq_new_with_opt(ast_value, name, file, realpath, ln,
1326 NULL, 0, ISEQ_TYPE_TOP, &option,
1328 rb_ast_dispose(ast);
1340 VALUE name = rb_fstring_lit(
"<compiled>");
1343 make_compile_option(&option, opt);
1347 bool parse_file =
false;
1359 result.
node.coverage_enabled = 1;
1361 switch (option.frozen_string_literal) {
1362 case ISEQ_FROZEN_STRING_LITERAL_UNSET:
1364 case ISEQ_FROZEN_STRING_LITERAL_DISABLED:
1367 case ISEQ_FROZEN_STRING_LITERAL_ENABLED:
1371 rb_bug(
"pm_iseq_compile_with_option: invalid frozen_string_literal=%d", option.frozen_string_literal);
1379 error = pm_load_parse_file(&result, src, ruby_vm_keep_script_lines ? &script_lines : NULL);
1382 error = pm_parse_string(&result, src, file, ruby_vm_keep_script_lines ? &script_lines : NULL);
1387 if (error ==
Qnil) {
1389 iseq = pm_iseq_new_with_opt(&result.
node, name, file, realpath, ln, NULL, 0, ISEQ_TYPE_TOP, &option, &error_state);
1391 pm_parse_result_free(&result);
1395 rb_jump_tag(error_state);
1399 pm_parse_result_free(&result);
1409 return pathobj_path(ISEQ_BODY(iseq)->location.pathobj);
1415 return pathobj_realpath(ISEQ_BODY(iseq)->location.pathobj);
1419rb_iseq_absolute_path(
const rb_iseq_t *iseq)
1421 return rb_iseq_realpath(iseq);
1425rb_iseq_from_eval_p(
const rb_iseq_t *iseq)
1427 return NIL_P(rb_iseq_realpath(iseq));
1433 return ISEQ_BODY(iseq)->location.label;
1437rb_iseq_base_label(
const rb_iseq_t *iseq)
1439 return ISEQ_BODY(iseq)->location.base_label;
1443rb_iseq_first_lineno(
const rb_iseq_t *iseq)
1445 return RB_INT2NUM(ISEQ_BODY(iseq)->location.first_lineno);
1449rb_iseq_method_name(
const rb_iseq_t *iseq)
1453 if (body->type == ISEQ_TYPE_METHOD) {
1454 return body->location.base_label;
1462rb_iseq_code_location(
const rb_iseq_t *iseq,
int *beg_pos_lineno,
int *beg_pos_column,
int *end_pos_lineno,
int *end_pos_column)
1465 if (beg_pos_lineno) *beg_pos_lineno = loc->beg_pos.lineno;
1466 if (beg_pos_column) *beg_pos_column = loc->beg_pos.column;
1467 if (end_pos_lineno) *end_pos_lineno = loc->end_pos.lineno;
1468 if (end_pos_column) *end_pos_column = loc->end_pos.column;
1471static ID iseq_type_id(
enum rb_iseq_type
type);
1476 return ID2SYM(iseq_type_id(ISEQ_BODY(iseq)->
type));
1482 return ISEQ_COVERAGE(iseq);
1486remove_coverage_i(
void *vstart,
void *vend,
size_t stride,
void *data)
1489 for (; v != (
VALUE)vend; v += stride) {
1490 void *ptr = rb_asan_poisoned_object_p(v);
1491 rb_asan_unpoison_object(v,
false);
1493 if (rb_obj_is_iseq(v)) {
1495 ISEQ_COVERAGE_SET(iseq,
Qnil);
1498 asan_poison_object_if(ptr, v);
1504rb_iseq_remove_coverage_all(
void)
1506 rb_objspace_each_objects(remove_coverage_i, NULL);
1512iseqw_mark_and_move(
void *ptr)
1514 rb_gc_mark_and_move((
VALUE *)ptr);
1518iseqw_memsize(
const void *ptr)
1520 return rb_iseq_memsize(*(
const rb_iseq_t **)ptr);
1526 iseqw_mark_and_move,
1529 iseqw_mark_and_move,
1531 0, 0, RUBY_TYPED_FREE_IMMEDIATELY|RUBY_TYPED_WB_PROTECTED
1537 if (iseq->wrapper) {
1539 rb_raise(
rb_eTypeError,
"wrong iseq wrapper: %" PRIsVALUE
" for %p",
1540 iseq->wrapper, (
void *)iseq);
1542 return iseq->wrapper;
1559 return iseqw_new(iseq);
1568iseqw_s_compile_parser(
int argc,
VALUE *argv,
VALUE self,
bool prism)
1574 if (i > 4+
NIL_P(opt)) rb_error_arity(argc, 1, 5);
1576 case 5: opt = argv[--i];
1577 case 4: line = argv[--i];
1578 case 3: path = argv[--i];
1579 case 2: file = argv[--i];
1582 if (
NIL_P(file)) file = rb_fstring_lit(
"<compiled>");
1583 if (
NIL_P(path)) path = file;
1591 iseq = pm_iseq_compile_with_option(src, file, path, line, opt);
1594 iseq = rb_iseq_compile_with_option(src, file, path, line, opt);
1597 return iseqw_new(iseq);
1638iseqw_s_compile(
int argc,
VALUE *argv,
VALUE self)
1640 return iseqw_s_compile_parser(argc, argv, self, rb_ruby_prism_p());
1680iseqw_s_compile_parsey(
int argc,
VALUE *argv,
VALUE self)
1682 return iseqw_s_compile_parser(argc, argv, self,
false);
1722iseqw_s_compile_prism(
int argc,
VALUE *argv,
VALUE self)
1724 return iseqw_s_compile_parser(argc, argv, self,
true);
1748iseqw_s_compile_file(
int argc,
VALUE *argv,
VALUE self)
1757 i =
rb_scan_args(argc, argv,
"1*:", &file, NULL, &opt);
1758 if (i > 1+
NIL_P(opt)) rb_error_arity(argc, 1, 2);
1760 case 2: opt = argv[--i];
1763 file = rb_fstring(file);
1768 VALUE v = rb_vm_push_frame_fname(ec, file);
1770 parser = rb_parser_new();
1771 rb_parser_set_context(parser, NULL, FALSE);
1772 ast_value = rb_parser_load_file(parser, file);
1773 ast = rb_ruby_ast_data_get(ast_value);
1774 if (!ast->body.root) exc = GET_EC()->errinfo;
1777 if (!ast->body.root) {
1778 rb_ast_dispose(ast);
1782 make_compile_option(&option, opt);
1784 ret = iseqw_new(rb_iseq_new_with_opt(ast_value, rb_fstring_lit(
"<main>"),
1786 rb_realpath_internal(
Qnil, file, 1),
1787 1, NULL, 0, ISEQ_TYPE_TOP, &option,
1789 rb_ast_dispose(ast);
1792 rb_vm_pop_frame(ec);
1819iseqw_s_compile_file_prism(
int argc,
VALUE *argv,
VALUE self)
1825 i =
rb_scan_args(argc, argv,
"1*:", &file, NULL, &opt);
1826 if (i > 1+
NIL_P(opt)) rb_error_arity(argc, 1, 2);
1828 case 2: opt = argv[--i];
1831 file = rb_fstring(file);
1834 VALUE v = rb_vm_push_frame_fname(ec, file);
1838 result.
node.coverage_enabled = 1;
1841 VALUE error = pm_load_parse_file(&result, file, ruby_vm_keep_script_lines ? &script_lines : NULL);
1843 if (error ==
Qnil) {
1844 make_compile_option(&option, opt);
1847 rb_iseq_t *iseq = pm_iseq_new_with_opt(&result.
node, rb_fstring_lit(
"<main>"),
1849 rb_realpath_internal(
Qnil, file, 1),
1850 1, NULL, 0, ISEQ_TYPE_TOP, &option, &error_state);
1852 pm_parse_result_free(&result);
1856 rb_jump_tag(error_state);
1859 ret = iseqw_new(iseq);
1860 rb_vm_pop_frame(ec);
1865 pm_parse_result_free(&result);
1866 rb_vm_pop_frame(ec);
1903iseqw_s_compile_option_set(
VALUE self,
VALUE opt)
1906 make_compile_option(&option, opt);
1907 COMPILE_OPTION_DEFAULT = option;
1920iseqw_s_compile_option_get(
VALUE self)
1922 return make_compile_option_value(&COMPILE_OPTION_DEFAULT);
1926iseqw_check(
VALUE iseqw)
1932 if (!ISEQ_BODY(iseq)) {
1933 rb_ibf_load_iseq_complete(iseq);
1936 if (!ISEQ_BODY(iseq)->location.label) {
1937 rb_raise(
rb_eTypeError,
"uninitialized InstructionSequence");
1943rb_iseqw_to_iseq(
VALUE iseqw)
1945 return iseqw_check(iseqw);
1957iseqw_eval(
VALUE self)
1959 const rb_iseq_t *iseq = iseqw_check(self);
1960 if (0 == ISEQ_BODY(iseq)->iseq_size) {
1961 rb_raise(
rb_eTypeError,
"attempt to evaluate dummy InstructionSequence");
1963 return rb_iseq_eval(iseq);
1971iseqw_inspect(
VALUE self)
1973 const rb_iseq_t *iseq = iseqw_check(self);
1977 if (!body->location.label) {
1978 return rb_sprintf(
"#<%"PRIsVALUE
": uninitialized>", klass);
1981 return rb_sprintf(
"<%"PRIsVALUE
":%"PRIsVALUE
"@%"PRIsVALUE
":%d>",
1983 body->location.label, rb_iseq_path(iseq),
1984 FIX2INT(rb_iseq_first_lineno(iseq)));
2012iseqw_path(
VALUE self)
2014 return rb_iseq_path(iseqw_check(self));
2034iseqw_absolute_path(
VALUE self)
2036 return rb_iseq_realpath(iseqw_check(self));
2063iseqw_label(
VALUE self)
2065 return rb_iseq_label(iseqw_check(self));
2089iseqw_base_label(
VALUE self)
2091 return rb_iseq_base_label(iseqw_check(self));
2105iseqw_first_lineno(
VALUE self)
2107 return rb_iseq_first_lineno(iseqw_check(self));
2194iseqw_to_a(
VALUE self)
2196 const rb_iseq_t *iseq = iseqw_check(self);
2197 return iseq_data_to_ary(iseq);
2200#if VM_INSN_INFO_TABLE_IMPL == 1
2202get_insn_info_binary_search(
const rb_iseq_t *iseq,
size_t pos)
2205 size_t size = body->insns_info.size;
2207 const unsigned int *positions = body->insns_info.positions;
2208 const int debug = 0;
2211 printf(
"size: %"PRIuSIZE
"\n", size);
2212 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2213 (
size_t)0, positions[0], insns_info[0].line_no, pos);
2219 else if (size == 1) {
2220 return &insns_info[0];
2223 size_t l = 1, r = size - 1;
2225 size_t m = l + (r - l) / 2;
2226 if (positions[m] == pos) {
2227 return &insns_info[m];
2229 if (positions[m] < pos) {
2237 return &insns_info[size-1];
2239 if (positions[l] > pos) {
2240 return &insns_info[l-1];
2242 return &insns_info[l];
2247get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2249 return get_insn_info_binary_search(iseq, pos);
2253#if VM_INSN_INFO_TABLE_IMPL == 2
2255get_insn_info_succinct_bitvector(
const rb_iseq_t *iseq,
size_t pos)
2258 size_t size = body->insns_info.size;
2260 const int debug = 0;
2263#if VM_CHECK_MODE > 0
2264 const unsigned int *positions = body->insns_info.positions;
2265 printf(
"size: %"PRIuSIZE
"\n", size);
2266 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2267 (
size_t)0, positions[0], insns_info[0].line_no, pos);
2269 printf(
"size: %"PRIuSIZE
"\n", size);
2270 printf(
"insns_info[%"PRIuSIZE
"]: line: %d, pos: %"PRIuSIZE
"\n",
2271 (
size_t)0, insns_info[0].line_no, pos);
2278 else if (size == 1) {
2279 return &insns_info[0];
2283 VM_ASSERT(body->insns_info.succ_index_table != NULL);
2284 index = succ_index_lookup(body->insns_info.succ_index_table, (
int)pos);
2285 return &insns_info[index-1];
2290get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2292 return get_insn_info_succinct_bitvector(iseq, pos);
2296#if VM_CHECK_MODE > 0 || VM_INSN_INFO_TABLE_IMPL == 0
2298get_insn_info_linear_search(
const rb_iseq_t *iseq,
size_t pos)
2301 size_t i = 0, size = body->insns_info.size;
2303 const unsigned int *positions = body->insns_info.positions;
2304 const int debug = 0;
2307 printf(
"size: %"PRIuSIZE
"\n", size);
2308 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2309 i, positions[i], insns_info[i].line_no, pos);
2315 else if (size == 1) {
2316 return &insns_info[0];
2319 for (i=1; i<size; i++) {
2320 if (debug) printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2321 i, positions[i], insns_info[i].line_no, pos);
2323 if (positions[i] == pos) {
2324 return &insns_info[i];
2326 if (positions[i] > pos) {
2327 return &insns_info[i-1];
2331 return &insns_info[i-1];
2335#if VM_INSN_INFO_TABLE_IMPL == 0
2337get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2339 return get_insn_info_linear_search(iseq, pos);
2343#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
2345validate_get_insn_info(
const rb_iseq_t *iseq)
2349 for (i = 0; i < body->iseq_size; i++) {
2350 if (get_insn_info_linear_search(iseq, i) != get_insn_info(iseq, i)) {
2351 rb_bug(
"validate_get_insn_info: get_insn_info_linear_search(iseq, %"PRIuSIZE
") != get_insn_info(iseq, %"PRIuSIZE
")", i, i);
2358rb_iseq_line_no(
const rb_iseq_t *iseq,
size_t pos)
2363 return entry->line_no;
2370#ifdef USE_ISEQ_NODE_ID
2372rb_iseq_node_id(
const rb_iseq_t *iseq,
size_t pos)
2377 return entry->node_id;
2386rb_iseq_event_flags(
const rb_iseq_t *iseq,
size_t pos)
2390 return entry->events;
2404 entry->events &= ~reset;
2405 if (!(entry->events & iseq->aux.exec.global_trace_events)) {
2406 void rb_iseq_trace_flag_cleared(
const rb_iseq_t *iseq,
size_t pos);
2407 rb_iseq_trace_flag_cleared(iseq, pos);
2420 for (i = 0; i < level; i++) {
2421 diseq = ISEQ_BODY(diseq)->parent_iseq;
2423 idx = ISEQ_BODY(diseq)->local_table_size - (int)op - 1;
2424 lid = ISEQ_BODY(diseq)->local_table[idx];
2425 name = rb_id2str(lid);
2435 rb_str_catf(name,
"@%d", idx);
2439int rb_insn_unified_local_var_level(
VALUE);
2443rb_insn_operand_intern(
const rb_iseq_t *iseq,
2447 const char *types = insn_op_types(insn);
2448 char type = types[op_no];
2453 ret = rb_sprintf(
"%"PRIdVALUE, (
VALUE)(pos +
len + op));
2457 if (insn == BIN(defined) && op_no == 0) {
2458 enum defined_type deftype = (
enum defined_type)op;
2461 ret = rb_fstring_lit(
"func");
2464 ret = rb_fstring_lit(
"ref");
2466 case DEFINED_CONST_FROM:
2467 ret = rb_fstring_lit(
"constant-from");
2470 ret = rb_iseq_defined_string(deftype);
2475 else if (insn == BIN(checktype) && op_no == 0) {
2481 ret = rb_sprintf(
"%"PRIuVALUE, op);
2486 if (types[op_no+1] == TS_NUM && pnop) {
2487 ret = local_var_name(iseq, *pnop, op - VM_ENV_DATA_SIZE);
2489 else if ((level = rb_insn_unified_local_var_level(insn)) >= 0) {
2490 ret = local_var_name(iseq, (
VALUE)level, op - VM_ENV_DATA_SIZE);
2502 op = obj_resurrect(op);
2503 if (insn == BIN(defined) && op_no == 1 &&
FIXNUM_P(op)) {
2508 ret = rb_sprintf(
":$%c", (
type >> 1));
2511 ret = rb_sprintf(
":$%d", (
type >> 1));
2516 ret = rb_dump_literal(op);
2528 ret = ISEQ_BODY(iseq)->location.label;
2542 const ID *segments = ((
IC)op)->segments;
2545 rb_str_catf(ret,
"::%s", rb_id2name(*segments++));
2561 ID mid = vm_ci_mid(ci);
2564 rb_ary_push(ary, rb_sprintf(
"mid:%"PRIsVALUE, rb_id2str(mid)));
2567 rb_ary_push(ary, rb_sprintf(
"argc:%d", vm_ci_argc(ci)));
2569 if (vm_ci_flag(ci) & VM_CALL_KWARG) {
2575 if (vm_ci_flag(ci)) {
2577# define CALL_FLAG(n) if (vm_ci_flag(ci) & VM_CALL_##n) rb_ary_push(flags, rb_str_new2(#n))
2578 CALL_FLAG(ARGS_SPLAT);
2579 CALL_FLAG(ARGS_SPLAT_MUT);
2580 CALL_FLAG(ARGS_BLOCKARG);
2583 CALL_FLAG(ARGS_SIMPLE);
2584 CALL_FLAG(TAILCALL);
2588 CALL_FLAG(KW_SPLAT);
2589 CALL_FLAG(KW_SPLAT_MUT);
2590 CALL_FLAG(FORWARDING);
2591 CALL_FLAG(OPT_SEND);
2607 if (dladdr((
void *)op, &info) && info.dli_sname) {
2619 ret = rb_sprintf(
"<builtin!%s/%d>",
2620 bf->name, bf->argc);
2625 rb_bug(
"unknown operand type: %c",
type);
2631right_strip(
VALUE str)
2633 const char *beg = RSTRING_PTR(str), *end =
RSTRING_END(str);
2634 while (end-- > beg && *end ==
' ');
2644rb_iseq_disasm_insn(
VALUE ret,
const VALUE *code,
size_t pos,
2647 VALUE insn = code[pos];
2648 int len = insn_len(insn);
2650 const char *types = insn_op_types(insn);
2652 const char *insn_name_buff;
2654 insn_name_buff = insn_name(insn);
2656 extern const int rb_vm_max_insn_name_size;
2657 rb_str_catf(str,
"%04"PRIuSIZE
" %-*s ", pos, rb_vm_max_insn_name_size, insn_name_buff);
2660 rb_str_catf(str,
"%04"PRIuSIZE
" %-28.*s ", pos,
2661 (
int)strcspn(insn_name_buff,
"_"), insn_name_buff);
2664 for (j = 0; types[j]; j++) {
2665 VALUE opstr = rb_insn_operand_intern(iseq, insn, j, code[pos + j + 1],
2666 len, pos, &code[pos + j + 2],
2676 unsigned int line_no = rb_iseq_line_no(iseq, pos);
2677 unsigned int prev = pos == 0 ? 0 : rb_iseq_line_no(iseq, pos - 1);
2678 if (line_no && line_no != prev) {
2679 long slen = RSTRING_LEN(str);
2680 slen = (slen > 70) ? 0 : (70 - slen);
2681 str = rb_str_catf(str,
"%*s(%4d)", (
int)slen,
"", line_no);
2688 str = rb_str_catf(str,
"[%s%s%s%s%s%s%s%s%s%s%s%s]",
2699 events & RUBY_EVENT_COVERAGE_LINE ?
"Cli" :
"",
2700 events & RUBY_EVENT_COVERAGE_BRANCH ?
"Cbr" :
"");
2710 printf(
"%.*s\n", (
int)RSTRING_LEN(str), RSTRING_PTR(str));
2719 case CATCH_TYPE_RESCUE:
2721 case CATCH_TYPE_ENSURE:
2723 case CATCH_TYPE_RETRY:
2725 case CATCH_TYPE_BREAK:
2727 case CATCH_TYPE_REDO:
2729 case CATCH_TYPE_NEXT:
2732 rb_bug(
"unknown catch type: %d",
type);
2741 if (!body->location.label) {
2742 return rb_sprintf(
"#<ISeq: uninitialized>");
2746 return rb_sprintf(
"#<ISeq:%"PRIsVALUE
"@%"PRIsVALUE
":%d (%d,%d)-(%d,%d)>",
2747 body->location.label, rb_iseq_path(iseq),
2748 loc->beg_pos.lineno,
2749 loc->beg_pos.lineno,
2750 loc->beg_pos.column,
2751 loc->end_pos.lineno,
2752 loc->end_pos.column);
2758 {(void (*)(
void *))rb_mark_set, (void (*)(
void *))st_free_table, 0, 0,},
2759 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
2773 enum {header_minlen = 72};
2776 const char *indent_str;
2779 size = body->iseq_size;
2781 indent_len = RSTRING_LEN(indent);
2782 indent_str = RSTRING_PTR(indent);
2788 if ((l = RSTRING_LEN(str) - indent_len) < header_minlen) {
2792 if (iseq->body->builtin_attrs) {
2793#define disasm_builtin_attr(str, iseq, attr) \
2794 if (iseq->body->builtin_attrs & BUILTIN_ATTR_ ## attr) { \
2795 rb_str_cat2(str, " " #attr); \
2797 disasm_builtin_attr(str, iseq, LEAF);
2798 disasm_builtin_attr(str, iseq, SINGLE_NOARG_LEAF);
2799 disasm_builtin_attr(str, iseq, INLINE_BLOCK);
2800 disasm_builtin_attr(str, iseq, C_TRACE);
2805 if (body->catch_table) {
2809 if (body->catch_table) {
2811 indent_str = RSTRING_PTR(indent);
2812 for (i = 0; i < body->catch_table->size; i++) {
2814 UNALIGNED_MEMBER_PTR(body->catch_table, entries[i]);
2817 "| catch type: %-6s st: %04d ed: %04d sp: %04d cont: %04d\n",
2818 catch_type((
int)entry->type), (
int)entry->start,
2819 (
int)entry->end, (
int)entry->sp, (
int)entry->cont);
2820 if (entry->iseq && !(done_iseq && st_is_member(done_iseq, (st_data_t)entry->iseq))) {
2821 rb_str_concat(str, rb_iseq_disasm_recursive(rb_iseq_check(entry->iseq), indent));
2823 done_iseq = st_init_numtable();
2826 st_insert(done_iseq, (st_data_t)entry->iseq, (st_data_t)0);
2827 indent_str = RSTRING_PTR(indent);
2830 rb_str_resize(indent, indent_len);
2831 indent_str = RSTRING_PTR(indent);
2833 if (body->catch_table) {
2835 rb_str_cat2(str,
"|-------------------------------------"
2836 "-----------------------------------\n");
2840 if (body->local_table) {
2841 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
2844 "local table (size: %d, argc: %d "
2845 "[opts: %d, rest: %d, post: %d, block: %d, kw: %d@%d, kwrest: %d])\n",
2846 body->local_table_size,
2847 body->
param.lead_num,
2848 body->
param.opt_num,
2849 body->
param.flags.has_rest ? body->
param.rest_start : -1,
2850 body->param.post_num,
2851 body->param.flags.has_block ? body->param.block_start : -1,
2852 body->param.flags.has_kw ? keyword->num : -1,
2853 body->param.flags.has_kw ? keyword->required_num : -1,
2854 body->param.flags.has_kwrest ? keyword->rest_start : -1);
2856 for (i = body->local_table_size; i > 0;) {
2857 int li = body->local_table_size - --i - 1;
2859 VALUE name = local_var_name(iseq, 0, i);
2864 if (body->
param.flags.has_opt) {
2865 int argc = body->
param.lead_num;
2866 int opts = body->
param.opt_num;
2867 if (li >= argc && li < argc + opts) {
2868 snprintf(opti,
sizeof(opti),
"Opt=%"PRIdVALUE,
2869 body->
param.opt_table[li - argc]);
2873 snprintf(argi,
sizeof(argi),
"%s%s%s%s%s%s",
2874 (body->
param.lead_num > li) ? (body->
param.flags.ambiguous_param0 ?
"AmbiguousArg" :
"Arg") :
"",
2876 (body->param.flags.has_rest && body->param.rest_start == li) ? (body->param.flags.anon_rest ?
"AnonRest" :
"Rest") :
"",
2877 (body->param.flags.has_post && body->param.post_start <= li && li < body->param.post_start + body->param.post_num) ?
"Post" :
"",
2878 (body->param.flags.has_kwrest && keyword->rest_start == li) ? (body->param.flags.anon_kwrest ?
"AnonKwrest" :
"Kwrest") :
"",
2879 (body->param.flags.has_block && body->param.block_start == li) ?
"Block" :
"");
2882 rb_str_catf(str,
"[%2d] ", i + 1);
2883 width = RSTRING_LEN(str) + 11;
2885 if (*argi) rb_str_catf(str,
"<%s>", argi);
2886 if ((width -= RSTRING_LEN(str)) > 0) rb_str_catf(str,
"%*s", (
int)width,
"");
2892 code = rb_iseq_original_iseq(iseq);
2893 for (n = 0; n < size;) {
2895 n += rb_iseq_disasm_insn(str, code, n, iseq, child);
2900 if (done_iseq && st_is_member(done_iseq, (st_data_t)isv))
continue;
2903 indent_str = RSTRING_PTR(indent);
2914 rb_str_resize(str, RSTRING_LEN(str));
2924rb_estimate_iv_count(
VALUE klass,
const rb_iseq_t * initialize_iseq)
2926 struct rb_id_table * iv_names = rb_id_table_create(0);
2928 for (
unsigned int i = 0; i < ISEQ_BODY(initialize_iseq)->ivc_size; i++) {
2929 IVC cache = (
IVC)&ISEQ_BODY(initialize_iseq)->is_entries[i];
2931 if (cache->iv_set_name) {
2932 rb_id_table_insert(iv_names, cache->iv_set_name,
Qtrue);
2936 attr_index_t count = (attr_index_t)rb_id_table_size(iv_names);
2939 count += RCLASS_MAX_IV_COUNT(superclass);
2941 rb_id_table_free(iv_names);
2965iseqw_disasm(
VALUE self)
2967 return rb_iseq_disasm(iseqw_check(self));
2971iseq_iterate_children(
const rb_iseq_t *iseq,
void (*iter_func)(
const rb_iseq_t *child_iseq,
void *data),
void *data)
2974 VALUE *code = rb_iseq_original_iseq(iseq);
2979 if (body->catch_table) {
2980 for (i = 0; i < body->catch_table->size; i++) {
2982 UNALIGNED_MEMBER_PTR(body->catch_table, entries[i]);
2983 child = entry->iseq;
2985 if (
NIL_P(rb_hash_aref(all_children, (
VALUE)child))) {
2986 rb_hash_aset(all_children, (
VALUE)child,
Qtrue);
2987 (*iter_func)(child, data);
2993 for (i=0; i<body->iseq_size;) {
2994 VALUE insn = code[i];
2995 int len = insn_len(insn);
2996 const char *types = insn_op_types(insn);
2999 for (j=0; types[j]; j++) {
3004 if (
NIL_P(rb_hash_aref(all_children, (
VALUE)child))) {
3005 rb_hash_aset(all_children, (
VALUE)child,
Qtrue);
3006 (*iter_func)(child, data);
3021yield_each_children(
const rb_iseq_t *child_iseq,
void *data)
3035iseqw_each_child(
VALUE self)
3037 const rb_iseq_t *iseq = iseqw_check(self);
3038 iseq_iterate_children(iseq, yield_each_children, NULL);
3045#define C(ev, cstr, l) if (events & ev) rb_ary_push(ary, rb_ary_new_from_args(2, l, ID2SYM(rb_intern(cstr))));
3065iseqw_trace_points(
VALUE self)
3067 const rb_iseq_t *iseq = iseqw_check(self);
3072 for (i=0; i<body->insns_info.size; i++) {
3074 if (entry->events) {
3075 push_event_info(iseq, entry->events, entry->line_no, ary);
3121 if (rb_frame_info_p(body)) {
3122 iseq = rb_get_iseq_from_frame_info(body);
3125 iseq = vm_proc_iseq(body);
3127 if (!rb_obj_is_iseq((
VALUE)iseq)) {
3132 iseq = rb_method_iseq(body);
3134 else if (rb_typeddata_is_instance_of(body, &iseqw_data_type)) {
3138 return iseq ? iseqw_new(iseq) :
Qnil;
3196 VALUE iseqw = iseqw_s_of(klass, body);
3197 return NIL_P(iseqw) ?
Qnil : rb_iseq_disasm(iseqw_check(iseqw));
3201register_label(
struct st_table *table,
unsigned long idx)
3204 st_insert(table, idx, sym);
3213 case CATCH_TYPE_RESCUE:
CONST_ID(
id,
"rescue");
break;
3214 case CATCH_TYPE_ENSURE:
CONST_ID(
id,
"ensure");
break;
3215 case CATCH_TYPE_RETRY:
CONST_ID(
id,
"retry");
break;
3216 case CATCH_TYPE_BREAK:
CONST_ID(
id,
"break");
break;
3217 case CATCH_TYPE_REDO:
CONST_ID(
id,
"redo");
break;
3218 case CATCH_TYPE_NEXT:
CONST_ID(
id,
"next");
break;
3220 rb_bug(
"unknown exception type: %d", (
int)
type);
3235 {(void (*)(
void *))rb_mark_tbl, (void (*)(
void *))st_free_table, 0, 0,},
3236 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
3239#define DECL_ID(name) \
3242#define INIT_ID(name) \
3243 id_##name = rb_intern(#name)
3246iseq_type_id(
enum rb_iseq_type
type)
3271 case ISEQ_TYPE_TOP:
return id_top;
3272 case ISEQ_TYPE_METHOD:
return id_method;
3273 case ISEQ_TYPE_BLOCK:
return id_block;
3274 case ISEQ_TYPE_CLASS:
return id_class;
3275 case ISEQ_TYPE_RESCUE:
return id_rescue;
3276 case ISEQ_TYPE_ENSURE:
return id_ensure;
3277 case ISEQ_TYPE_EVAL:
return id_eval;
3278 case ISEQ_TYPE_MAIN:
return id_main;
3279 case ISEQ_TYPE_PLAIN:
return id_plain;
3282 rb_bug(
"unsupported iseq type: %d", (
int)
type);
3294 VALUE *seq, *iseq_original;
3299 VALUE params = rb_hash_new();
3303 VALUE misc = rb_hash_new();
3305 static ID insn_syms[VM_BARE_INSTRUCTION_SIZE];
3306 struct st_table *labels_table = st_init_numtable();
3309 if (insn_syms[0] == 0) {
3311 for (i=0; i<numberof(insn_syms); i++) {
3312 insn_syms[i] = rb_intern(insn_name(i));
3317 type = iseq_type_id(iseq_body->type);
3320 for (i=0; i<iseq_body->local_table_size; i++) {
3321 ID lid = iseq_body->local_table[i];
3323 if (rb_id2str(lid)) {
3337 const struct rb_iseq_param_keyword *
const keyword = iseq_body->
param.keyword;
3340 if (iseq_body->
param.flags.has_opt) {
3341 int len = iseq_body->
param.opt_num + 1;
3344 for (j = 0; j <
len; j++) {
3345 VALUE l = register_label(labels_table, iseq_body->
param.opt_table[j]);
3348 rb_hash_aset(params,
ID2SYM(rb_intern(
"opt")), arg_opt_labels);
3352 if (iseq_body->
param.flags.has_lead) rb_hash_aset(params,
ID2SYM(rb_intern(
"lead_num")),
INT2FIX(iseq_body->
param.lead_num));
3353 if (iseq_body->
param.flags.has_post) rb_hash_aset(params,
ID2SYM(rb_intern(
"post_num")),
INT2FIX(iseq_body->
param.post_num));
3354 if (iseq_body->
param.flags.has_post) rb_hash_aset(params,
ID2SYM(rb_intern(
"post_start")),
INT2FIX(iseq_body->
param.post_start));
3355 if (iseq_body->
param.flags.has_rest) rb_hash_aset(params,
ID2SYM(rb_intern(
"rest_start")),
INT2FIX(iseq_body->
param.rest_start));
3356 if (iseq_body->
param.flags.has_block) rb_hash_aset(params,
ID2SYM(rb_intern(
"block_start")),
INT2FIX(iseq_body->
param.block_start));
3357 if (iseq_body->
param.flags.has_kw) {
3360 for (i=0; i<keyword->required_num; i++) {
3363 for (j=0; i<keyword->num; i++, j++) {
3364 VALUE key = rb_ary_new_from_args(1,
ID2SYM(keyword->table[i]));
3365 if (!UNDEF_P(keyword->default_values[j])) {
3371 rb_hash_aset(params,
ID2SYM(rb_intern(
"kwbits")),
3372 INT2FIX(keyword->bits_start));
3373 rb_hash_aset(params,
ID2SYM(rb_intern(
"keyword")), keywords);
3375 if (iseq_body->
param.flags.has_kwrest) rb_hash_aset(params,
ID2SYM(rb_intern(
"kwrest")),
INT2FIX(keyword->rest_start));
3376 if (iseq_body->
param.flags.ambiguous_param0) rb_hash_aset(params,
ID2SYM(rb_intern(
"ambiguous_param0")),
Qtrue);
3377 if (iseq_body->
param.flags.use_block) rb_hash_aset(params,
ID2SYM(rb_intern(
"use_block")),
Qtrue);
3381 iseq_original = rb_iseq_original_iseq((
rb_iseq_t *)iseq);
3383 for (seq = iseq_original; seq < iseq_original + iseq_body->iseq_size; ) {
3384 VALUE insn = *seq++;
3385 int j,
len = insn_len(insn);
3390 for (j=0; j<
len-1; j++, seq++) {
3391 enum ruby_insn_type_chars op_type = insn_op_type(insn, j);
3395 unsigned long idx = nseq - iseq_original + *seq;
3396 rb_ary_push(ary, register_label(labels_table, idx));
3410 VALUE val = iseq_data_to_ary(rb_iseq_check(iseq));
3421 const ID *ids = ((
IC)*seq)->segments;
3440 VALUE e = rb_hash_new();
3441 int argc = vm_ci_argc(ci);
3443 ID mid = vm_ci_mid(ci);
3445 rb_hash_aset(e,
ID2SYM(rb_intern(
"flag")),
UINT2NUM(vm_ci_flag(ci)));
3447 if (vm_ci_flag(ci) & VM_CALL_KWARG) {
3452 argc -= kwarg->keyword_len;
3453 for (i = 0; i < kwarg->keyword_len; i++) {
3456 rb_hash_aset(e,
ID2SYM(rb_intern(
"kw_arg")), kw);
3459 rb_hash_aset(e,
ID2SYM(rb_intern(
"orig_argc")),
3477 unsigned long idx = nseq - iseq_original + pos;
3480 register_label(labels_table, idx));
3487#if SIZEOF_VALUE <= SIZEOF_LONG
3497 VALUE val = rb_hash_new();
3498#if SIZEOF_VALUE <= SIZEOF_LONG
3503 rb_hash_aset(val,
ID2SYM(rb_intern(
"func_ptr")), func_ptr);
3511 rb_bug(
"unknown operand: %c", insn_op_type(insn, j));
3520 if (iseq_body->catch_table)
for (i=0; i<iseq_body->catch_table->size; i++) {
3523 UNALIGNED_MEMBER_PTR(iseq_body->catch_table, entries[i]);
3524 rb_ary_push(ary, exception_type2symbol(entry->type));
3526 rb_ary_push(ary, iseq_data_to_ary(rb_iseq_check(entry->iseq)));
3531 rb_ary_push(ary, register_label(labels_table, entry->start));
3532 rb_ary_push(ary, register_label(labels_table, entry->end));
3533 rb_ary_push(ary, register_label(labels_table, entry->cont));
3540 prev_insn_info = NULL;
3541#ifdef USE_ISEQ_NODE_ID
3550 if (st_lookup(labels_table, pos, &label)) {
3554 info = get_insn_info(iseq, pos);
3555#ifdef USE_ISEQ_NODE_ID
3559 if (prev_insn_info != info) {
3560 int line = info->line_no;
3563 if (line > 0 && last_line != line) {
3567#define CHECK_EVENT(ev) if (events & ev) rb_ary_push(body, ID2SYM(rb_intern(#ev)));
3577 prev_insn_info = info;
3587 rb_hash_aset(misc,
ID2SYM(rb_intern(
"local_size")),
INT2FIX(iseq_body->local_table_size));
3588 rb_hash_aset(misc,
ID2SYM(rb_intern(
"stack_max")),
INT2FIX(iseq_body->stack_max));
3589 rb_hash_aset(misc,
ID2SYM(rb_intern(
"node_id")),
INT2FIX(iseq_body->location.node_id));
3590 rb_hash_aset(misc,
ID2SYM(rb_intern(
"code_location")),
3591 rb_ary_new_from_args(4,
3592 INT2FIX(iseq_body->location.code_location.beg_pos.lineno),
3593 INT2FIX(iseq_body->location.code_location.beg_pos.column),
3594 INT2FIX(iseq_body->location.code_location.end_pos.lineno),
3595 INT2FIX(iseq_body->location.code_location.end_pos.column)));
3596#ifdef USE_ISEQ_NODE_ID
3597 rb_hash_aset(misc,
ID2SYM(rb_intern(
"node_ids")), node_ids);
3599 rb_hash_aset(misc,
ID2SYM(rb_intern(
"parser")), iseq_body->prism ?
ID2SYM(rb_intern(
"prism")) :
ID2SYM(rb_intern(
"parse.y")));
3624rb_iseq_parameters(
const rb_iseq_t *iseq,
int is_proc)
3628 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
3630 ID req, opt, rest, block, key, keyrest;
3631#define PARAM_TYPE(type) rb_ary_push(a = rb_ary_new2(2), ID2SYM(type))
3632#define PARAM_ID(i) body->local_table[(i)]
3633#define PARAM(i, type) ( \
3635 rb_id2str(PARAM_ID(i)) ? \
3636 rb_ary_push(a, ID2SYM(PARAM_ID(i))) : \
3642 if (body->
param.flags.forwardable) {
3653 for (i = 0; i < body->
param.lead_num; i++) {
3655 if (rb_id2str(PARAM_ID(i))) {
3662 for (i = 0; i < body->
param.lead_num; i++) {
3666 r = body->
param.lead_num + body->
param.opt_num;
3667 for (; i < r; i++) {
3669 if (rb_id2str(PARAM_ID(i))) {
3674 if (body->
param.flags.has_rest) {
3678 r = body->
param.post_start + body->
param.post_num;
3680 for (i = body->
param.post_start; i < r; i++) {
3682 if (rb_id2str(PARAM_ID(i))) {
3689 for (i = body->
param.post_start; i < r; i++) {
3693 if (body->
param.flags.accepts_no_kwarg) {
3699 if (body->
param.flags.has_kw) {
3701 if (keyword->required_num > 0) {
3704 for (; i < keyword->required_num; i++) {
3706 if (rb_id2str(keyword->table[i])) {
3713 for (; i < keyword->num; i++) {
3715 if (rb_id2str(keyword->table[i])) {
3721 if (body->
param.flags.has_kwrest || body->
param.flags.ruby2_keywords) {
3724 PARAM_TYPE(keyrest);
3725 if (body->
param.flags.has_kwrest &&
3726 rb_id2str(param = PARAM_ID(keyword->rest_start))) {
3729 else if (body->
param.flags.ruby2_keywords) {
3734 if (body->
param.flags.has_block) {
3742rb_iseq_defined_string(
enum defined_type
type)
3744 static const char expr_names[][18] = {
3746 "instance-variable",
3762 if ((
unsigned)(
type - 1) >= (
unsigned)numberof(expr_names)) rb_bug(
"unknown defined type %d",
type);
3763 estr = expr_names[
type - 1];
3764 return rb_fstring_cstr(estr);
3774 void *notrace_encoded_insn;
3775 void *trace_encoded_insn;
3778 void *zjit_encoded_insn;
3781static insn_data_t insn_data[VM_BARE_INSTRUCTION_SIZE];
3784rb_free_encoded_insn_data(
void)
3786 st_free_table(encoded_insn_data);
3792rb_vm_encoded_insn_data_table_init(
void)
3794#if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
3795 const void *
const *table = rb_vm_get_insns_address_table();
3796#define INSN_CODE(insn) ((VALUE)table[insn])
3798#define INSN_CODE(insn) ((VALUE)(insn))
3800 encoded_insn_data = st_init_numtable_with_size(VM_BARE_INSTRUCTION_SIZE);
3802 for (
int insn = 0; insn < VM_BARE_INSTRUCTION_SIZE; insn++) {
3803 insn_data[insn].insn = insn;
3804 insn_data[insn].insn_len = insn_len(insn);
3809 int notrace_insn = (insn != BIN(opt_invokebuiltin_delegate_leave)) ? insn : BIN(opt_invokebuiltin_delegate);
3810 insn_data[insn].notrace_encoded_insn = (
void *)INSN_CODE(notrace_insn);
3811 insn_data[insn].trace_encoded_insn = (
void *)INSN_CODE(notrace_insn + VM_BARE_INSTRUCTION_SIZE);
3813 st_data_t key1 = (st_data_t)INSN_CODE(insn);
3814 st_data_t key2 = (st_data_t)INSN_CODE(insn + VM_BARE_INSTRUCTION_SIZE);
3815 st_add_direct(encoded_insn_data, key1, (st_data_t)&insn_data[insn]);
3816 st_add_direct(encoded_insn_data, key2, (st_data_t)&insn_data[insn]);
3819 int zjit_insn = vm_bare_insn_to_zjit_insn(insn);
3820 insn_data[insn].zjit_insn = zjit_insn;
3821 insn_data[insn].zjit_encoded_insn = (insn != zjit_insn) ? (
void *)INSN_CODE(zjit_insn) : 0;
3823 if (insn != zjit_insn) {
3824 st_data_t key3 = (st_data_t)INSN_CODE(zjit_insn);
3825 st_add_direct(encoded_insn_data, key3, (st_data_t)&insn_data[insn]);
3835rb_vm_insn_addr2insn(
const void *addr)
3837 st_data_t key = (st_data_t)addr;
3840 if (st_lookup(encoded_insn_data, key, &val)) {
3842 return (
int)e->insn;
3845 rb_bug(
"rb_vm_insn_addr2insn: invalid insn address: %p", addr);
3851rb_vm_insn_addr2opcode(
const void *addr)
3853 st_data_t key = (st_data_t)addr;
3856 if (st_lookup(encoded_insn_data, key, &val)) {
3858 int opcode = e->insn;
3859 if (addr == e->trace_encoded_insn) {
3860 opcode += VM_BARE_INSTRUCTION_SIZE;
3863 else if (addr == e->zjit_encoded_insn) {
3864 opcode = e->zjit_insn;
3870 rb_bug(
"rb_vm_insn_addr2opcode: invalid insn address: %p", addr);
3877rb_vm_insn_decode(
const VALUE encoded)
3879#if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
3880 int insn = rb_vm_insn_addr2insn((
void *)encoded);
3882 int insn = (int)encoded;
3889encoded_iseq_trace_instrument(
VALUE *iseq_encoded_insn,
rb_event_flag_t turnon,
bool remain_current_trace)
3891 st_data_t key = (st_data_t)*iseq_encoded_insn;
3894 if (st_lookup(encoded_insn_data, key, &val)) {
3896 if (remain_current_trace && key == (st_data_t)e->trace_encoded_insn) {
3899 *iseq_encoded_insn = (
VALUE) (turnon ? e->trace_encoded_insn : e->notrace_encoded_insn);
3903 rb_bug(
"trace_instrument: invalid insn address: %p", (
void *)*iseq_encoded_insn);
3908rb_iseq_trace_flag_cleared(
const rb_iseq_t *iseq,
size_t pos)
3911 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3912 encoded_iseq_trace_instrument(&iseq_encoded[pos], 0,
false);
3938 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3940 VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
3942 for (pc=0; pc<body->iseq_size;) {
3946 unsigned int line = (int)entry->line_no;
3948 if (target_line == 0 || target_line == line) {
3952 target_events &= ~RUBY_EVENT_LINE;
3955 if (pc_events & target_events) {
3958 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (target_events | iseq->aux.exec.global_trace_events),
true);
3962 if (iseq->aux.exec.local_hooks == NULL) {
3964 iseq->aux.exec.local_hooks->is_local =
true;
3966 rb_hook_list_connect_tracepoint((
VALUE)iseq, iseq->aux.exec.local_hooks, tpval, target_line);
3975 unsigned int target_line;
3980iseq_add_local_tracepoint_i(
const rb_iseq_t *iseq,
void *p)
3983 data->n += iseq_add_local_tracepoint(iseq, data->turnon_events, data->tpval, data->target_line);
3984 iseq_iterate_children(iseq, iseq_add_local_tracepoint_i, p);
3988rb_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)
3991 if (target_bmethod) {
3992 turnon_events = add_bmethod_events(turnon_events);
3994 data.turnon_events = turnon_events;
3996 data.target_line = target_line;
3999 iseq_add_local_tracepoint_i(iseq, (
void *)&data);
4000 if (0)
rb_funcall(
Qnil, rb_intern(
"puts"), 1, rb_iseq_disasm(iseq));
4009 if (iseq->aux.exec.local_hooks) {
4012 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
4015 rb_hook_list_remove_tracepoint(iseq->aux.exec.local_hooks, tpval);
4016 local_events = iseq->aux.exec.local_hooks->events;
4018 if (local_events == 0) {
4019 rb_hook_list_free(iseq->aux.exec.local_hooks);
4020 ((
rb_iseq_t *)iseq)->aux.exec.local_hooks = NULL;
4023 local_events = add_bmethod_events(local_events);
4024 for (pc = 0; pc<body->iseq_size;) {
4026 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (local_events | iseq->aux.exec.global_trace_events),
false);
4038iseq_remove_local_tracepoint_i(
const rb_iseq_t *iseq,
void *p)
4041 data->n += iseq_remove_local_tracepoint(iseq, data->tpval);
4042 iseq_iterate_children(iseq, iseq_remove_local_tracepoint_i, p);
4046rb_iseq_remove_local_tracepoint_recursively(
const rb_iseq_t *iseq,
VALUE tpval)
4052 iseq_remove_local_tracepoint_i(iseq, (
void *)&data);
4059 if (iseq->aux.exec.global_trace_events == turnon_events) {
4063 if (!ISEQ_EXECUTABLE_P(iseq)) {
4070 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
4072 rb_event_flag_t local_events = iseq->aux.exec.local_hooks ? iseq->aux.exec.local_hooks->events : 0;
4073 ((
rb_iseq_t *)iseq)->aux.exec.global_trace_events = turnon_events;
4074 enabled_events = add_bmethod_events(turnon_events | local_events);
4076 for (pc=0; pc<body->iseq_size;) {
4078 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & enabled_events,
true);
4086clear_attr_cc(
VALUE v)
4088 if (imemo_type_p(v, imemo_callcache) && vm_cc_ivar_p((
const struct rb_callcache *)v)) {
4100 if (imemo_type_p(v, imemo_callcache) && vm_cc_bf_p((
const struct rb_callcache *)v)) {
4110clear_attr_ccs_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4113 for (; v != (
VALUE)vend; v += stride) {
4114 void *ptr = rb_asan_poisoned_object_p(v);
4115 rb_asan_unpoison_object(v,
false);
4117 asan_poison_object_if(ptr, v);
4123rb_clear_attr_ccs(
void)
4125 rb_objspace_each_objects(clear_attr_ccs_i, NULL);
4129clear_bf_ccs_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4132 for (; v != (
VALUE)vend; v += stride) {
4133 void *ptr = rb_asan_poisoned_object_p(v);
4134 rb_asan_unpoison_object(v,
false);
4136 asan_poison_object_if(ptr, v);
4142rb_clear_bf_ccs(
void)
4144 rb_objspace_each_objects(clear_bf_ccs_i, NULL);
4148trace_set_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4153 for (; v != (
VALUE)vend; v += stride) {
4154 void *ptr = rb_asan_poisoned_object_p(v);
4155 rb_asan_unpoison_object(v,
false);
4157 if (rb_obj_is_iseq(v)) {
4158 rb_iseq_trace_set(rb_iseq_check((
rb_iseq_t *)v), turnon_events);
4160 else if (clear_attr_cc(v)) {
4162 else if (clear_bf_cc(v)) {
4165 asan_poison_object_if(ptr, v);
4173 rb_objspace_each_objects(trace_set_i, &turnon_events);
4177rb_iseqw_local_variables(
VALUE iseqval)
4179 return rb_iseq_local_variables(iseqw_check(iseqval));
4200iseqw_to_binary(
int argc,
VALUE *argv,
VALUE self)
4203 return rb_iseq_ibf_dump(iseqw_check(self), opt);
4220iseqw_s_load_from_binary(
VALUE self,
VALUE str)
4222 return iseqw_new(rb_iseq_ibf_load(str));
4232iseqw_s_load_from_binary_extra_data(
VALUE self,
VALUE str)
4234 return rb_iseq_ibf_load_extra_data(str);
4237#if VM_INSN_INFO_TABLE_IMPL == 2
4270#define IMMEDIATE_TABLE_SIZE 54
4272struct succ_index_table {
4273 uint64_t imm_part[IMMEDIATE_TABLE_SIZE / 9];
4274 struct succ_dict_block {
4276 uint64_t small_block_ranks;
4277 uint64_t bits[512/64];
4278 } succ_part[FLEX_ARY_LEN];
4281#define imm_block_rank_set(v, i, r) (v) |= (uint64_t)(r) << (7 * (i))
4282#define imm_block_rank_get(v, i) (((int)((v) >> ((i) * 7))) & 0x7f)
4283#define small_block_rank_set(v, i, r) (v) |= (uint64_t)(r) << (9 * ((i) - 1))
4284#define small_block_rank_get(v, i) ((i) == 0 ? 0 : (((int)((v) >> (((i) - 1) * 9))) & 0x1ff))
4286static struct succ_index_table *
4287succ_index_table_create(
int max_pos,
int *data,
int size)
4289 const int imm_size = (max_pos < IMMEDIATE_TABLE_SIZE ? max_pos + 8 : IMMEDIATE_TABLE_SIZE) / 9;
4290 const int succ_size = (max_pos < IMMEDIATE_TABLE_SIZE ? 0 : (max_pos - IMMEDIATE_TABLE_SIZE + 511)) / 512;
4291 struct succ_index_table *sd =
4292 rb_xcalloc_mul_add_mul(
4293 imm_size,
sizeof(uint64_t),
4294 succ_size,
sizeof(
struct succ_dict_block));
4298 for (j = 0; j < imm_size; j++) {
4299 for (i = 0; i < 9; i++) {
4300 if (r < size && data[r] == j * 9 + i) r++;
4301 imm_block_rank_set(sd->imm_part[j], i, r);
4304 for (k = 0; k < succ_size; k++) {
4305 struct succ_dict_block *sd_block = &sd->succ_part[k];
4308 for (j = 0; j < 8; j++) {
4310 if (j) small_block_rank_set(sd_block->small_block_ranks, j, small_rank);
4311 for (i = 0; i < 64; i++) {
4312 if (r < size && data[r] == k * 512 + j * 64 + i + IMMEDIATE_TABLE_SIZE) {
4313 bits |= ((uint64_t)1) << i;
4317 sd_block->bits[j] = bits;
4318 small_rank += rb_popcount64(bits);
4324static unsigned int *
4325succ_index_table_invert(
int max_pos,
struct succ_index_table *sd,
int size)
4327 const int imm_size = (max_pos < IMMEDIATE_TABLE_SIZE ? max_pos + 8 : IMMEDIATE_TABLE_SIZE) / 9;
4328 const int succ_size = (max_pos < IMMEDIATE_TABLE_SIZE ? 0 : (max_pos - IMMEDIATE_TABLE_SIZE + 511)) / 512;
4329 unsigned int *positions =
ALLOC_N(
unsigned int, size), *p;
4330 int i, j, k, r = -1;
4332 for (j = 0; j < imm_size; j++) {
4333 for (i = 0; i < 9; i++) {
4334 int nr = imm_block_rank_get(sd->imm_part[j], i);
4335 if (r != nr) *p++ = j * 9 + i;
4339 for (k = 0; k < succ_size; k++) {
4340 for (j = 0; j < 8; j++) {
4341 for (i = 0; i < 64; i++) {
4342 if (sd->succ_part[k].bits[j] & (((uint64_t)1) << i)) {
4343 *p++ = k * 512 + j * 64 + i + IMMEDIATE_TABLE_SIZE;
4352succ_index_lookup(
const struct succ_index_table *sd,
int x)
4354 if (x < IMMEDIATE_TABLE_SIZE) {
4355 const int i = x / 9;
4356 const int j = x % 9;
4357 return imm_block_rank_get(sd->imm_part[i], j);
4360 const int block_index = (x - IMMEDIATE_TABLE_SIZE) / 512;
4361 const struct succ_dict_block *block = &sd->succ_part[block_index];
4362 const int block_bit_index = (x - IMMEDIATE_TABLE_SIZE) % 512;
4363 const int small_block_index = block_bit_index / 64;
4364 const int small_block_popcount = small_block_rank_get(block->small_block_ranks, small_block_index);
4365 const int popcnt = rb_popcount64(block->bits[small_block_index] << (63 - block_bit_index % 64));
4367 return block->rank + small_block_popcount + popcnt;
4386iseqw_script_lines(
VALUE self)
4388 const rb_iseq_t *iseq = iseqw_check(self);
4389 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)
Like rb_str_dup(), but always create an instance of rb_cString regardless of the given object's class...
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.
PRISM_EXPORTED_FUNCTION void pm_options_line_set(pm_options_t *options, int32_t line)
Set the line option on the given options struct.
PRISM_EXPORTED_FUNCTION void pm_options_frozen_string_literal_set(pm_options_t *options, bool frozen_string_literal)
Set the frozen string literal option on the given options struct.
PRISM_EXPORTED_FUNCTION bool pm_options_scopes_init(pm_options_t *options, size_t scopes_count)
Allocate and zero out the scopes array on the given options struct.
#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.