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/symbol.h"
35 #include "internal/thread.h"
36 #include "internal/variable.h"
41 #include "vm_callinfo.h"
46 #include "insns_info.inc"
52 #if VM_INSN_INFO_TABLE_IMPL == 2
53 static struct succ_index_table *succ_index_table_create(
int max_pos,
int *data,
int size);
54 static unsigned int *succ_index_table_invert(
int max_pos,
struct succ_index_table *sd,
int size);
58 #define hidden_obj_p(obj) (!SPECIAL_CONST_P(obj) && !RBASIC(obj)->klass)
61 obj_resurrect(
VALUE obj)
63 if (hidden_obj_p(obj)) {
72 obj = rb_hash_resurrect(obj);
97 free_arena(compile_data->node.storage_head);
98 free_arena(compile_data->insn.storage_head);
99 if (compile_data->ivar_cache_table) {
100 rb_id_table_free(compile_data->ivar_cache_table);
107 remove_from_constant_cache(
ID id,
IC ic)
111 st_data_t ic_data = (st_data_t)ic;
113 if (rb_id_table_lookup(vm->constant_cache,
id, &lookup_result)) {
115 st_delete(ics, &ic_data, NULL);
117 if (ics->num_entries == 0 &&
119 id != vm->inserting_constant_cache_id) {
120 rb_id_table_delete(vm->constant_cache,
id);
130 iseq_clear_ic_references(
const rb_iseq_t *iseq)
136 if (!ISEQ_BODY(iseq)->is_entries) {
140 for (
unsigned int ic_idx = 0; ic_idx < ISEQ_BODY(iseq)->ic_size; ic_idx++) {
141 IC ic = &ISEQ_IS_IC_ENTRY(ISEQ_BODY(iseq), ic_idx);
149 if (segments == NULL)
152 for (
int i = 0; segments[i]; i++) {
154 if (
id == idNULL)
continue;
155 remove_from_constant_cache(
id, ic);
165 RUBY_FREE_ENTER(
"iseq");
167 if (iseq && ISEQ_BODY(iseq)) {
168 iseq_clear_ic_references(iseq);
170 rb_rjit_free_iseq(iseq);
172 rb_yjit_iseq_free(iseq);
175 rb_yjit_live_iseq_count--;
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);
188 if (ISEQ_MBITS_BUFLEN(body->iseq_size) > 1 && body->mark_bits.list) {
194 if (body->
param.keyword != NULL) {
195 if (body->
param.keyword->table != &body->local_table[body->
param.keyword->bits_start - body->
param.keyword->num])
197 if (body->
param.keyword->default_values) {
202 if (LIKELY(body->local_table != rb_iseq_shared_exc_local_tbl))
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");
216 typedef VALUE iseq_value_itr_t(
void *ctx,
VALUE obj);
219 iseq_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;
237 rb_iseq_mark_and_move_each_value(
const rb_iseq_t *iseq,
VALUE *original_iseq)
243 size = body->iseq_size;
244 code = body->iseq_encoded;
248 if (body->is_entries) {
250 is_entries += body->ivc_size;
253 for (
unsigned int i = 0; i < body->icvarc_size; i++, is_entries++) {
258 rb_gc_mark_and_move(&icvarc->entry->class_value);
263 for (
unsigned int i = 0; i < body->ise_size; i++, is_entries++) {
265 if (is->once.value) {
266 rb_gc_mark_and_move(&is->once.value);
271 for (
unsigned int i = 0; i < body->ic_size; i++, is_entries++) {
272 IC ic = (
IC)is_entries;
274 rb_gc_mark_and_move_ptr(&ic->entry);
280 if (body->mark_bits.list) {
281 if (ISEQ_MBITS_BUFLEN(size) == 1) {
282 iseq_scan_bits(0, body->mark_bits.single, code, original_iseq);
285 if (body->mark_bits.list) {
286 for (
unsigned int i = 0; i < ISEQ_MBITS_BUFLEN(size); i++) {
287 iseq_bits_t bits = body->mark_bits.list[i];
288 iseq_scan_bits(i, bits, code, original_iseq);
296 cc_is_active(
const struct rb_callcache *cc,
bool reference_updating)
299 if (cc == rb_vm_empty_cc() || rb_vm_empty_cc_for_super()) {
303 if (reference_updating) {
307 if (vm_cc_markable(cc)) {
310 if (reference_updating) {
313 if (!METHOD_ENTRY_INVALIDATED(cme)) {
323 rb_iseq_mark_and_move(
rb_iseq_t *iseq,
bool reference_updating)
325 RUBY_MARK_ENTER(
"iseq");
327 rb_gc_mark_and_move(&iseq->wrapper);
329 if (ISEQ_BODY(iseq)) {
332 rb_iseq_mark_and_move_each_value(iseq, reference_updating ? ISEQ_ORIGINAL_ISEQ(iseq) : NULL);
334 rb_gc_mark_and_move(&body->variable.coverage);
335 rb_gc_mark_and_move(&body->variable.pc2branchindex);
336 rb_gc_mark_and_move(&body->variable.script_lines);
337 rb_gc_mark_and_move(&body->location.label);
338 rb_gc_mark_and_move(&body->location.base_label);
339 rb_gc_mark_and_move(&body->location.pathobj);
340 if (body->local_iseq) rb_gc_mark_and_move_ptr(&body->local_iseq);
341 if (body->parent_iseq) rb_gc_mark_and_move_ptr(&body->parent_iseq);
342 if (body->mandatory_only_iseq) rb_gc_mark_and_move_ptr(&body->mandatory_only_iseq);
344 if (body->call_data) {
345 for (
unsigned int i = 0; i < body->ci_size; i++) {
348 if (cds[i].ci) rb_gc_mark_and_move_ptr(&cds[i].ci);
350 if (cc_is_active(cds[i].cc, reference_updating)) {
351 rb_gc_mark_and_move_ptr(&cds[i].cc);
353 else if (cds[i].cc != rb_vm_empty_cc()) {
354 cds[i].cc = rb_vm_empty_cc();
359 if (body->
param.flags.has_kw && body->
param.keyword != NULL) {
360 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
362 if (keyword->default_values != NULL) {
363 for (
int j = 0, i = keyword->required_num; i < keyword->num; i++, j++) {
364 rb_gc_mark_and_move(&keyword->default_values[j]);
369 if (body->catch_table) {
372 for (
unsigned int i = 0; i < table->size; i++) {
374 entry = UNALIGNED_MEMBER_PTR(table, entries[i]);
376 rb_gc_mark_and_move_ptr(&entry->iseq);
381 if (reference_updating) {
383 rb_rjit_iseq_update_references(body);
386 rb_yjit_iseq_update_references(iseq);
391 rb_rjit_iseq_mark(body->rjit_blocks);
394 rb_yjit_iseq_mark(body->yjit_payload);
400 rb_gc_mark_and_move(&iseq->aux.loader.obj);
405 if (!reference_updating) {
411 rb_iseq_mark_and_pin_insn_storage(compile_data->insn.storage_head);
414 rb_gc_mark_and_move((
VALUE *)&compile_data->err_info);
415 rb_gc_mark_and_move((
VALUE *)&compile_data->catch_table_ary);
419 VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
421 if (iseq->aux.exec.local_hooks) {
422 rb_hook_list_mark_and_update(iseq->aux.exec.local_hooks);
426 RUBY_MARK_LEAVE(
"iseq");
430 param_keyword_size(
const struct rb_iseq_param_keyword *pkw)
434 if (!pkw)
return size;
436 size +=
sizeof(
struct rb_iseq_param_keyword);
437 size +=
sizeof(
VALUE) * (pkw->num - pkw->required_num);
451 if (ISEQ_EXECUTABLE_P(iseq) && body) {
453 size += body->iseq_size *
sizeof(
VALUE);
455 size += body->local_table_size *
sizeof(
ID);
456 size += ISEQ_MBITS_BUFLEN(body->iseq_size) * ISEQ_MBITS_SIZE;
457 if (body->catch_table) {
458 size += iseq_catch_table_bytes(body->catch_table->size);
460 size += (body->
param.opt_num + 1) *
sizeof(
VALUE);
461 size += param_keyword_size(body->
param.keyword);
466 if (ISEQ_BODY(iseq)->is_entries) {
468 for (
unsigned int ic_idx = 0; ic_idx < body->ic_size; ic_idx++) {
469 IC ic = &ISEQ_IS_IC_ENTRY(body, ic_idx);
484 compile_data = ISEQ_COMPILE_DATA(iseq);
490 cur = compile_data->node.storage_head;
501 rb_iseq_constant_body_alloc(
void)
512 ISEQ_BODY(iseq) = rb_iseq_constant_body_alloc();
517 rb_iseq_pathobj_new(
VALUE path,
VALUE realpath)
523 if (path == realpath ||
525 pathobj = rb_fstring(path);
528 if (!
NIL_P(realpath)) realpath = rb_fstring(realpath);
539 rb_iseq_pathobj_new(path, realpath));
547 rb_iseq_pathobj_set(iseq, path, realpath);
550 loc->first_lineno = first_lineno;
552 if (ISEQ_BODY(iseq)->local_iseq == iseq && strcmp(
RSTRING_PTR(name),
"initialize") == 0) {
553 ISEQ_BODY(iseq)->param.flags.use_block = 1;
557 loc->node_id = node_id;
558 loc->code_location = *code_location;
561 loc->code_location.beg_pos.lineno = 0;
562 loc->code_location.beg_pos.column = 0;
563 loc->code_location.end_pos.lineno = -1;
564 loc->code_location.end_pos.column = -1;
577 if (
type == ISEQ_TYPE_TOP) {
578 body->local_iseq = iseq;
580 else if (
type == ISEQ_TYPE_METHOD ||
type == ISEQ_TYPE_CLASS) {
581 body->local_iseq = iseq;
584 body->local_iseq = ISEQ_BODY(piseq)->local_iseq;
588 body->parent_iseq = piseq;
591 if (
type == ISEQ_TYPE_MAIN) {
592 body->local_iseq = iseq;
601 ALLOC_N(
char, INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE +
606 new_arena->size = INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE;
614 const rb_iseq_t *parent,
int isolated_depth,
enum rb_iseq_type
type,
621 if (parent && (
type == ISEQ_TYPE_MAIN ||
type == ISEQ_TYPE_TOP))
625 set_relation(iseq, parent);
627 name = rb_fstring(name);
628 iseq_location_setup(iseq, name, path, realpath, first_lineno, code_location, node_id);
629 if (iseq != body->local_iseq) {
630 RB_OBJ_WRITE(iseq, &body->location.base_label, ISEQ_BODY(body->local_iseq)->location.label);
632 ISEQ_COVERAGE_SET(iseq,
Qnil);
633 ISEQ_ORIGINAL_ISEQ_CLEAR(iseq);
634 body->variable.flip_count = 0;
636 if (
NIL_P(script_lines)) {
643 ISEQ_COMPILE_DATA_ALLOC(iseq);
644 RB_OBJ_WRITE(iseq, &ISEQ_COMPILE_DATA(iseq)->err_info, err_info);
647 ISEQ_COMPILE_DATA(iseq)->node.storage_head = ISEQ_COMPILE_DATA(iseq)->node.storage_current = new_arena();
648 ISEQ_COMPILE_DATA(iseq)->insn.storage_head = ISEQ_COMPILE_DATA(iseq)->insn.storage_current = new_arena();
649 ISEQ_COMPILE_DATA(iseq)->isolated_depth = isolated_depth;
650 ISEQ_COMPILE_DATA(iseq)->option = option;
651 ISEQ_COMPILE_DATA(iseq)->ivar_cache_table = NULL;
652 ISEQ_COMPILE_DATA(iseq)->builtin_function_table = GET_VM()->builtin_function_table;
654 if (option->coverage_enabled) {
655 VALUE coverages = rb_get_coverages();
656 if (
RTEST(coverages)) {
661 ISEQ_COVERAGE_SET(iseq, coverage);
662 if (coverage && ISEQ_BRANCH_COVERAGE(iseq))
668 #if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
669 static void validate_get_insn_info(
const rb_iseq_t *iseq);
673 rb_iseq_insns_info_encode_positions(
const rb_iseq_t *iseq)
675 #if VM_INSN_INFO_TABLE_IMPL == 2
678 int size = body->insns_info.size;
679 int max_pos = body->iseq_size;
680 int *data = (
int *)body->insns_info.positions;
681 if (body->insns_info.succ_index_table)
ruby_xfree(body->insns_info.succ_index_table);
682 body->insns_info.succ_index_table = succ_index_table_create(max_pos, data, size);
683 #if VM_CHECK_MODE == 0
685 body->insns_info.positions = NULL;
690 #if VM_INSN_INFO_TABLE_IMPL == 2
694 int size = body->insns_info.size;
695 int max_pos = body->iseq_size;
697 return succ_index_table_invert(max_pos, sd, size);
704 iseq->aux.exec.global_trace_events = 0;
705 if (ruby_vm_event_enabled_global_flags & ISEQ_TRACE_EVENTS) {
706 rb_iseq_trace_set(iseq, ruby_vm_event_enabled_global_flags & ISEQ_TRACE_EVENTS);
715 VALUE err = data->err_info;
716 ISEQ_COMPILE_DATA_CLEAR(iseq);
717 compile_data_free(data);
719 #if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
720 validate_get_insn_info(iseq);
724 VALUE path = pathobj_path(body->location.pathobj);
730 RB_DEBUG_COUNTER_INC(iseq_num);
731 RB_DEBUG_COUNTER_ADD(iseq_cd_num, ISEQ_BODY(iseq)->ci_size);
733 rb_iseq_init_trace(iseq);
738 .inline_const_cache = OPT_INLINE_CONST_CACHE,
739 .peephole_optimization = OPT_PEEPHOLE_OPTIMIZATION,
740 .tailcall_optimization = OPT_TAILCALL_OPTIMIZATION,
741 .specialized_instruction = OPT_SPECIALISED_INSTRUCTION,
742 .operands_unification = OPT_OPERANDS_UNIFICATION,
743 .instructions_unification = OPT_INSTRUCTIONS_UNIFICATION,
744 .frozen_string_literal = OPT_FROZEN_STRING_LITERAL,
745 .debug_frozen_string_literal = OPT_DEBUG_FROZEN_STRING_LITERAL,
746 .coverage_enabled = TRUE,
750 .frozen_string_literal = -1,
754 rb_iseq_opt_frozen_string_literal(
void)
756 return COMPILE_OPTION_DEFAULT.frozen_string_literal;
762 #define SET_COMPILE_OPTION(o, h, mem) \
763 { VALUE flag = rb_hash_aref((h), ID2SYM(rb_intern(#mem))); \
764 if (flag == Qtrue) { (o)->mem = 1; } \
765 else if (flag == Qfalse) { (o)->mem = 0; } \
767 #define SET_COMPILE_OPTION_NUM(o, h, mem) \
768 { VALUE num = rb_hash_aref((h), ID2SYM(rb_intern(#mem))); \
769 if (!NIL_P(num)) (o)->mem = NUM2INT(num); \
771 SET_COMPILE_OPTION(option, opt, inline_const_cache);
772 SET_COMPILE_OPTION(option, opt, peephole_optimization);
773 SET_COMPILE_OPTION(option, opt, tailcall_optimization);
774 SET_COMPILE_OPTION(option, opt, specialized_instruction);
775 SET_COMPILE_OPTION(option, opt, operands_unification);
776 SET_COMPILE_OPTION(option, opt, instructions_unification);
777 SET_COMPILE_OPTION(option, opt, frozen_string_literal);
778 SET_COMPILE_OPTION(option, opt, debug_frozen_string_literal);
779 SET_COMPILE_OPTION(option, opt, coverage_enabled);
780 SET_COMPILE_OPTION_NUM(option, opt, debug_level);
781 #undef SET_COMPILE_OPTION
782 #undef SET_COMPILE_OPTION_NUM
788 #define SET_COMPILE_OPTION(o, a, mem) \
789 ((a)->mem < 0 ? 0 : ((o)->mem = (a)->mem > 0))
790 SET_COMPILE_OPTION(option, ast, coverage_enabled);
791 #undef SET_COMPILE_OPTION
792 if (ast->frozen_string_literal >= 0) {
793 option->frozen_string_literal = ast->frozen_string_literal;
802 *option = COMPILE_OPTION_DEFAULT;
805 *option = COMPILE_OPTION_FALSE;
807 else if (opt ==
Qtrue) {
810 ((
int *)option)[i] = 1;
813 *option = COMPILE_OPTION_DEFAULT;
814 set_compile_option_from_hash(option, opt);
824 VALUE opt = rb_hash_new_with_size(11);
825 #define SET_COMPILE_OPTION(o, h, mem) \
826 rb_hash_aset((h), ID2SYM(rb_intern(#mem)), RBOOL((o)->mem))
827 #define SET_COMPILE_OPTION_NUM(o, h, mem) \
828 rb_hash_aset((h), ID2SYM(rb_intern(#mem)), INT2NUM((o)->mem))
830 SET_COMPILE_OPTION(option, opt, inline_const_cache);
831 SET_COMPILE_OPTION(option, opt, peephole_optimization);
832 SET_COMPILE_OPTION(option, opt, tailcall_optimization);
833 SET_COMPILE_OPTION(option, opt, specialized_instruction);
834 SET_COMPILE_OPTION(option, opt, operands_unification);
835 SET_COMPILE_OPTION(option, opt, instructions_unification);
836 SET_COMPILE_OPTION(option, opt, debug_frozen_string_literal);
837 SET_COMPILE_OPTION(option, opt, coverage_enabled);
838 SET_COMPILE_OPTION_NUM(option, opt, debug_level);
840 #undef SET_COMPILE_OPTION
841 #undef SET_COMPILE_OPTION_NUM
842 VALUE frozen_string_literal = option->frozen_string_literal == -1 ?
Qnil : RBOOL(option->frozen_string_literal);
851 return rb_iseq_new_with_opt(ast_value, name, path, realpath, 0, parent,
852 0,
type, &COMPILE_OPTION_DEFAULT,
857 ast_line_count(
const VALUE ast_value)
859 rb_ast_t *ast = rb_ruby_ast_data_get(ast_value);
860 return ast->body.line_count;
864 iseq_setup_coverage(
VALUE coverages,
VALUE path,
int line_count)
866 if (line_count >= 0) {
867 int len = (rb_get_coverage_mode() & COVERAGE_TARGET_ONESHOT_LINES) ? 0 : line_count;
869 VALUE coverage = rb_default_coverage(
len);
879 iseq_new_setup_coverage(
VALUE path,
int line_count)
881 VALUE coverages = rb_get_coverages();
883 if (
RTEST(coverages)) {
884 iseq_setup_coverage(coverages, path, line_count);
891 iseq_new_setup_coverage(path, ast_line_count(ast_value));
893 return rb_iseq_new_with_opt(ast_value, name, path, realpath, 0, parent, 0,
894 ISEQ_TYPE_TOP, &COMPILE_OPTION_DEFAULT,
906 return pm_iseq_new_with_opt(node, name, path, realpath, 0, parent, 0,
907 ISEQ_TYPE_TOP, &COMPILE_OPTION_DEFAULT, error_state);
913 iseq_new_setup_coverage(path, ast_line_count(ast_value));
915 return rb_iseq_new_with_opt(ast_value, rb_fstring_lit(
"<main>"),
917 parent, 0, ISEQ_TYPE_MAIN, opt ? &COMPILE_OPTION_DEFAULT : &COMPILE_OPTION_FALSE,
930 return pm_iseq_new_with_opt(node, rb_fstring_lit(
"<main>"),
932 parent, 0, ISEQ_TYPE_MAIN, opt ? &COMPILE_OPTION_DEFAULT : &COMPILE_OPTION_FALSE, error_state);
936 rb_iseq_new_eval(
const VALUE ast_value,
VALUE name,
VALUE path,
VALUE realpath,
int first_lineno,
const rb_iseq_t *parent,
int isolated_depth)
938 if (rb_get_coverage_mode() & COVERAGE_TARGET_EVAL) {
939 VALUE coverages = rb_get_coverages();
940 if (
RTEST(coverages) &&
RTEST(path) && !
RTEST(rb_hash_has_key(coverages, path))) {
941 iseq_setup_coverage(coverages, path, ast_line_count(ast_value) + first_lineno - 1);
945 return rb_iseq_new_with_opt(ast_value, name, path, realpath, first_lineno,
946 parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT,
952 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
int *error_state)
954 if (rb_get_coverage_mode() & COVERAGE_TARGET_EVAL) {
955 VALUE coverages = rb_get_coverages();
956 if (
RTEST(coverages) &&
RTEST(path) && !
RTEST(rb_hash_has_key(coverages, path))) {
957 iseq_setup_coverage(coverages, path, ((
int) (node->parser->
newline_list.
size - 1)) + first_lineno - 1);
961 return pm_iseq_new_with_opt(node, name, path, realpath, first_lineno,
962 parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT, error_state);
969 VALUE v1 = iseqw_new(iseq);
971 if (v1 != v2 &&
CLASS_OF(v2) == rb_cISeq) {
981 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
985 rb_ast_t *ast = rb_ruby_ast_data_get(ast_value);
987 const NODE *node = body ? body->root : 0;
992 if (!option) option = &COMPILE_OPTION_DEFAULT;
995 option = set_compile_option_from_ast(&new_opt, body);
998 if (!
NIL_P(script_lines)) {
1001 else if (body && body->script_lines) {
1002 script_lines = rb_parser_build_script_lines_from(body->script_lines);
1005 script_lines = ISEQ_BODY(parent)->variable.script_lines;
1008 prepare_iseq_build(iseq, name, path, realpath, first_lineno, node ? &node->nd_loc : NULL, node ? nd_node_id(node) : -1,
1009 parent, isolated_depth,
type, script_lines, option);
1011 rb_iseq_compile_node(iseq, node);
1012 finish_iseq_build(iseq);
1015 return iseq_translate(iseq);
1024 pm_iseq_new_with_opt_try(
VALUE d)
1029 pm_iseq_compile_node(data->iseq, data->node);
1032 finish_iseq_build(data->iseq);
1051 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
1055 ISEQ_BODY(iseq)->prism =
true;
1058 if (!option) option = &COMPILE_OPTION_DEFAULT;
1060 next_option = *option;
1061 next_option.coverage_enabled = node->coverage_enabled < 0 ? 0 : node->coverage_enabled > 0;
1062 option = &next_option;
1065 int32_t start_line = node->parser->
start_line;
1071 .beg_pos = { .lineno = (int) start.
line, .column = (
int) start.
column },
1072 .end_pos = { .lineno = (int) end.
line, .column = (
int) end.
column }
1075 prepare_iseq_build(iseq, name, path, realpath, first_lineno, &code_location, -1,
1084 if (*error_state)
return NULL;
1086 return iseq_translate(iseq);
1090 rb_iseq_new_with_callback(
1093 int first_lineno,
const rb_iseq_t *parent,
1099 if (!option) option = &COMPILE_OPTION_DEFAULT;
1100 prepare_iseq_build(iseq, name, path, realpath, first_lineno, NULL, -1, parent, 0,
type,
Qnil, option);
1102 rb_iseq_compile_callback(iseq, ifunc);
1103 finish_iseq_build(iseq);
1109 rb_iseq_load_iseq(
VALUE fname)
1114 return iseqw_check(iseqv);
1120 #define CHECK_ARRAY(v) rb_to_array_type(v)
1121 #define CHECK_HASH(v) rb_to_hash_type(v)
1122 #define CHECK_STRING(v) rb_str_to_str(v)
1123 #define CHECK_SYMBOL(v) rb_to_symbol_type(v)
1126 static enum rb_iseq_type
1141 if (
typeid == id_top)
return ISEQ_TYPE_TOP;
1142 if (
typeid == id_method)
return ISEQ_TYPE_METHOD;
1143 if (
typeid == id_block)
return ISEQ_TYPE_BLOCK;
1144 if (
typeid == id_class)
return ISEQ_TYPE_CLASS;
1145 if (
typeid == id_rescue)
return ISEQ_TYPE_RESCUE;
1146 if (
typeid == id_ensure)
return ISEQ_TYPE_ENSURE;
1147 if (
typeid == id_eval)
return ISEQ_TYPE_EVAL;
1148 if (
typeid == id_main)
return ISEQ_TYPE_MAIN;
1149 if (
typeid == id_plain)
return ISEQ_TYPE_PLAIN;
1150 return (
enum rb_iseq_type)-1;
1158 VALUE magic, version1, version2, format_type, misc;
1159 VALUE name, path, realpath, code_location, node_id;
1160 VALUE type, body, locals, params, exception;
1162 st_data_t iseq_type;
1172 data = CHECK_ARRAY(data);
1179 ((void)magic, (
void)version1, (void)version2, (
void)format_type);
1184 realpath =
NIL_P(realpath) ?
Qnil : CHECK_STRING(realpath);
1193 ISEQ_BODY(iseq)->local_iseq = iseq;
1195 iseq_type = iseq_type_from_sym(
type);
1196 if (iseq_type == (
enum rb_iseq_type)-1) {
1211 ISEQ_BODY(iseq)->prism =
true;
1214 make_compile_option(&option, opt);
1215 option.peephole_optimization = FALSE;
1216 prepare_iseq_build(iseq, name, path, realpath, first_lineno, &tmp_loc,
NUM2INT(node_id),
1217 parent, 0, (
enum rb_iseq_type)iseq_type,
Qnil, &option);
1219 rb_iseq_build_from_ary(iseq, misc, locals, params, exception, body);
1221 finish_iseq_build(iseq);
1223 return iseqw_new(iseq);
1230 iseq_s_load(
int argc,
VALUE *argv,
VALUE self)
1234 return iseq_load(data, NULL, opt);
1240 return iseq_load(data,
RTEST(parent) ? (
rb_iseq_t *)parent : NULL, opt);
1248 #if !defined(__GNUC__) || (__GNUC__ == 4 && __GNUC_MINOR__ == 8)
1249 # define INITIALIZED volatile
1251 # define INITIALIZED
1255 VALUE INITIALIZED ast_value;
1257 VALUE name = rb_fstring_lit(
"<compiled>");
1260 make_compile_option(&option, opt);
1264 parse = rb_parser_compile_file_path;
1267 parse = rb_parser_compile_string_path;
1271 const VALUE parser = rb_parser_new();
1272 const rb_iseq_t *outer_scope = rb_iseq_new(
Qnil, name, name,
Qnil, 0, ISEQ_TYPE_TOP);
1274 rb_parser_set_context(parser, outer_scope, FALSE);
1275 if (ruby_vm_keep_script_lines) rb_parser_set_script_lines(parser);
1277 ast_value = (*parse)(parser, file, src, ln);
1280 ast = rb_ruby_ast_data_get(ast_value);
1282 if (!ast || !ast->body.root) {
1283 rb_ast_dispose(ast);
1287 iseq = rb_iseq_new_with_opt(ast_value, name, file, realpath, ln,
1288 NULL, 0, ISEQ_TYPE_TOP, &option,
1290 rb_ast_dispose(ast);
1302 VALUE name = rb_fstring_lit(
"<compiled>");
1305 make_compile_option(&option, opt);
1312 result.
node.coverage_enabled = 1;
1314 switch (option.frozen_string_literal) {
1315 case ISEQ_FROZEN_STRING_LITERAL_UNSET:
1317 case ISEQ_FROZEN_STRING_LITERAL_DISABLED:
1320 case ISEQ_FROZEN_STRING_LITERAL_ENABLED:
1324 rb_bug(
"pm_iseq_compile_with_option: invalid frozen_string_literal=%d", option.frozen_string_literal);
1333 error = pm_load_parse_file(&result, filepath, ruby_vm_keep_script_lines ? &script_lines : NULL);
1338 error = pm_parse_string(&result, src, file, ruby_vm_keep_script_lines ? &script_lines : NULL);
1341 if (error ==
Qnil) {
1343 iseq = pm_iseq_new_with_opt(&result.
node, name, file, realpath, ln, NULL, 0, ISEQ_TYPE_TOP, &option, &error_state);
1345 pm_parse_result_free(&result);
1353 pm_parse_result_free(&result);
1363 return pathobj_path(ISEQ_BODY(iseq)->location.pathobj);
1369 return pathobj_realpath(ISEQ_BODY(iseq)->location.pathobj);
1373 rb_iseq_absolute_path(
const rb_iseq_t *iseq)
1375 return rb_iseq_realpath(iseq);
1379 rb_iseq_from_eval_p(
const rb_iseq_t *iseq)
1381 return NIL_P(rb_iseq_realpath(iseq));
1387 return ISEQ_BODY(iseq)->location.label;
1391 rb_iseq_base_label(
const rb_iseq_t *iseq)
1393 return ISEQ_BODY(iseq)->location.base_label;
1397 rb_iseq_first_lineno(
const rb_iseq_t *iseq)
1399 return RB_INT2NUM(ISEQ_BODY(iseq)->location.first_lineno);
1403 rb_iseq_method_name(
const rb_iseq_t *iseq)
1407 if (body->type == ISEQ_TYPE_METHOD) {
1408 return body->location.base_label;
1416 rb_iseq_code_location(
const rb_iseq_t *iseq,
int *beg_pos_lineno,
int *beg_pos_column,
int *end_pos_lineno,
int *end_pos_column)
1419 if (beg_pos_lineno) *beg_pos_lineno = loc->beg_pos.lineno;
1420 if (beg_pos_column) *beg_pos_column = loc->beg_pos.column;
1421 if (end_pos_lineno) *end_pos_lineno = loc->end_pos.lineno;
1422 if (end_pos_column) *end_pos_column = loc->end_pos.column;
1425 static ID iseq_type_id(
enum rb_iseq_type
type);
1430 return ID2SYM(iseq_type_id(ISEQ_BODY(iseq)->
type));
1436 return ISEQ_COVERAGE(iseq);
1440 remove_coverage_i(
void *vstart,
void *vend,
size_t stride,
void *data)
1443 for (; v != (
VALUE)vend; v += stride) {
1444 void *
ptr = asan_poisoned_object_p(v);
1445 asan_unpoison_object(v,
false);
1447 if (rb_obj_is_iseq(v)) {
1449 ISEQ_COVERAGE_SET(iseq,
Qnil);
1452 asan_poison_object_if(
ptr, v);
1458 rb_iseq_remove_coverage_all(
void)
1460 rb_objspace_each_objects(remove_coverage_i, NULL);
1466 iseqw_mark(
void *
ptr)
1472 iseqw_memsize(
const void *
ptr)
1478 iseqw_ref_update(
void *
ptr)
1492 0, 0, RUBY_TYPED_FREE_IMMEDIATELY|RUBY_TYPED_WB_PROTECTED
1498 if (iseq->wrapper) {
1501 iseq->wrapper, (
void *)iseq);
1503 return iseq->wrapper;
1521 return iseqw_new(iseq);
1530 iseqw_s_compile_parser(
int argc,
VALUE *argv,
VALUE self,
bool prism)
1536 if (i > 4+
NIL_P(opt)) rb_error_arity(argc, 1, 5);
1538 case 5: opt = argv[--i];
1539 case 4: line = argv[--i];
1540 case 3: path = argv[--i];
1541 case 2: file = argv[--i];
1544 if (
NIL_P(file)) file = rb_fstring_lit(
"<compiled>");
1545 if (
NIL_P(path)) path = file;
1553 iseq = pm_iseq_compile_with_option(src, file, path, line, opt);
1556 iseq = rb_iseq_compile_with_option(src, file, path, line, opt);
1559 return iseqw_new(iseq);
1600 iseqw_s_compile(
int argc,
VALUE *argv,
VALUE self)
1602 return iseqw_s_compile_parser(argc, argv,
self, rb_ruby_prism_p());
1642 iseqw_s_compile_parsey(
int argc,
VALUE *argv,
VALUE self)
1644 return iseqw_s_compile_parser(argc, argv,
self,
false);
1684 iseqw_s_compile_prism(
int argc,
VALUE *argv,
VALUE self)
1686 return iseqw_s_compile_parser(argc, argv,
self,
true);
1710 iseqw_s_compile_file(
int argc,
VALUE *argv,
VALUE self)
1719 i =
rb_scan_args(argc, argv,
"1*:", &file, NULL, &opt);
1720 if (i > 1+
NIL_P(opt)) rb_error_arity(argc, 1, 2);
1722 case 2: opt = argv[--i];
1725 file = rb_fstring(file);
1730 VALUE v = rb_vm_push_frame_fname(ec, file);
1732 parser = rb_parser_new();
1733 rb_parser_set_context(parser, NULL, FALSE);
1734 ast_value = rb_parser_load_file(parser, file);
1735 ast = rb_ruby_ast_data_get(ast_value);
1736 if (!ast->body.root) exc = GET_EC()->errinfo;
1739 if (!ast->body.root) {
1740 rb_ast_dispose(ast);
1744 make_compile_option(&option, opt);
1746 ret = iseqw_new(rb_iseq_new_with_opt(ast_value, rb_fstring_lit(
"<main>"),
1748 rb_realpath_internal(
Qnil, file, 1),
1749 1, NULL, 0, ISEQ_TYPE_TOP, &option,
1751 rb_ast_dispose(ast);
1753 rb_vm_pop_frame(ec);
1780 iseqw_s_compile_file_prism(
int argc,
VALUE *argv,
VALUE self)
1786 i =
rb_scan_args(argc, argv,
"1*:", &file, NULL, &opt);
1787 if (i > 1+
NIL_P(opt)) rb_error_arity(argc, 1, 2);
1789 case 2: opt = argv[--i];
1792 file = rb_fstring(file);
1795 VALUE v = rb_vm_push_frame_fname(ec, file);
1799 result.
node.coverage_enabled = 1;
1802 VALUE error = pm_load_parse_file(&result, file, ruby_vm_keep_script_lines ? &script_lines : NULL);
1804 if (error ==
Qnil) {
1805 make_compile_option(&option, opt);
1808 rb_iseq_t *iseq = pm_iseq_new_with_opt(&result.
node, rb_fstring_lit(
"<main>"),
1810 rb_realpath_internal(
Qnil, file, 1),
1811 1, NULL, 0, ISEQ_TYPE_TOP, &option, &error_state);
1813 pm_parse_result_free(&result);
1820 ret = iseqw_new(iseq);
1821 rb_vm_pop_frame(ec);
1825 pm_parse_result_free(&result);
1826 rb_vm_pop_frame(ec);
1863 iseqw_s_compile_option_set(
VALUE self,
VALUE opt)
1866 make_compile_option(&option, opt);
1867 COMPILE_OPTION_DEFAULT = option;
1880 iseqw_s_compile_option_get(
VALUE self)
1882 return make_compile_option_value(&COMPILE_OPTION_DEFAULT);
1886 iseqw_check(
VALUE iseqw)
1892 if (!ISEQ_BODY(iseq)) {
1893 rb_ibf_load_iseq_complete(iseq);
1896 if (!ISEQ_BODY(iseq)->location.label) {
1903 rb_iseqw_to_iseq(
VALUE iseqw)
1905 return iseqw_check(iseqw);
1917 iseqw_eval(
VALUE self)
1919 return rb_iseq_eval(iseqw_check(
self));
1927 iseqw_inspect(
VALUE self)
1929 const rb_iseq_t *iseq = iseqw_check(
self);
1933 if (!body->location.label) {
1934 return rb_sprintf(
"#<%"PRIsVALUE
": uninitialized>", klass);
1937 return rb_sprintf(
"<%"PRIsVALUE
":%"PRIsVALUE
"@%"PRIsVALUE
":%d>",
1939 body->location.label, rb_iseq_path(iseq),
1940 FIX2INT(rb_iseq_first_lineno(iseq)));
1968 iseqw_path(
VALUE self)
1970 return rb_iseq_path(iseqw_check(
self));
1990 iseqw_absolute_path(
VALUE self)
1992 return rb_iseq_realpath(iseqw_check(
self));
2019 iseqw_label(
VALUE self)
2021 return rb_iseq_label(iseqw_check(
self));
2045 iseqw_base_label(
VALUE self)
2047 return rb_iseq_base_label(iseqw_check(
self));
2061 iseqw_first_lineno(
VALUE self)
2063 return rb_iseq_first_lineno(iseqw_check(
self));
2150 iseqw_to_a(
VALUE self)
2152 const rb_iseq_t *iseq = iseqw_check(
self);
2153 return iseq_data_to_ary(iseq);
2156 #if VM_INSN_INFO_TABLE_IMPL == 1
2158 get_insn_info_binary_search(
const rb_iseq_t *iseq,
size_t pos)
2161 size_t size = body->insns_info.size;
2163 const unsigned int *positions = body->insns_info.positions;
2164 const int debug = 0;
2167 printf(
"size: %"PRIuSIZE
"\n", size);
2168 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2169 (
size_t)0, positions[0], insns_info[0].line_no, pos);
2175 else if (size == 1) {
2176 return &insns_info[0];
2179 size_t l = 1, r = size - 1;
2181 size_t m = l + (r - l) / 2;
2182 if (positions[m] == pos) {
2183 return &insns_info[m];
2185 if (positions[m] < pos) {
2193 return &insns_info[size-1];
2195 if (positions[l] > pos) {
2196 return &insns_info[l-1];
2198 return &insns_info[l];
2203 get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2205 return get_insn_info_binary_search(iseq, pos);
2209 #if VM_INSN_INFO_TABLE_IMPL == 2
2211 get_insn_info_succinct_bitvector(
const rb_iseq_t *iseq,
size_t pos)
2214 size_t size = body->insns_info.size;
2216 const int debug = 0;
2219 #if VM_CHECK_MODE > 0
2220 const unsigned int *positions = body->insns_info.positions;
2221 printf(
"size: %"PRIuSIZE
"\n", size);
2222 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2223 (
size_t)0, positions[0], insns_info[0].line_no, pos);
2225 printf(
"size: %"PRIuSIZE
"\n", size);
2226 printf(
"insns_info[%"PRIuSIZE
"]: line: %d, pos: %"PRIuSIZE
"\n",
2227 (
size_t)0, insns_info[0].line_no, pos);
2234 else if (size == 1) {
2235 return &insns_info[0];
2239 VM_ASSERT(body->insns_info.succ_index_table != NULL);
2240 index = succ_index_lookup(body->insns_info.succ_index_table, (
int)pos);
2241 return &insns_info[index-1];
2246 get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2248 return get_insn_info_succinct_bitvector(iseq, pos);
2252 #if VM_CHECK_MODE > 0 || VM_INSN_INFO_TABLE_IMPL == 0
2254 get_insn_info_linear_search(
const rb_iseq_t *iseq,
size_t pos)
2257 size_t i = 0, size = body->insns_info.size;
2259 const unsigned int *positions = body->insns_info.positions;
2260 const int debug = 0;
2263 printf(
"size: %"PRIuSIZE
"\n", size);
2264 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2265 i, positions[i], insns_info[i].line_no, pos);
2271 else if (size == 1) {
2272 return &insns_info[0];
2275 for (i=1; i<size; i++) {
2276 if (debug) printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2277 i, positions[i], insns_info[i].line_no, pos);
2279 if (positions[i] == pos) {
2280 return &insns_info[i];
2282 if (positions[i] > pos) {
2283 return &insns_info[i-1];
2287 return &insns_info[i-1];
2291 #if VM_INSN_INFO_TABLE_IMPL == 0
2293 get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2295 return get_insn_info_linear_search(iseq, pos);
2299 #if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
2301 validate_get_insn_info(
const rb_iseq_t *iseq)
2305 for (i = 0; i < body->iseq_size; i++) {
2306 if (get_insn_info_linear_search(iseq, i) != get_insn_info(iseq, i)) {
2307 rb_bug(
"validate_get_insn_info: get_insn_info_linear_search(iseq, %"PRIuSIZE
") != get_insn_info(iseq, %"PRIuSIZE
")", i, i);
2314 rb_iseq_line_no(
const rb_iseq_t *iseq,
size_t pos)
2319 return entry->line_no;
2326 #ifdef USE_ISEQ_NODE_ID
2328 rb_iseq_node_id(
const rb_iseq_t *iseq,
size_t pos)
2333 return entry->node_id;
2342 rb_iseq_event_flags(
const rb_iseq_t *iseq,
size_t pos)
2346 return entry->events;
2358 entry->events &= ~reset;
2359 if (!(entry->events & iseq->aux.exec.global_trace_events)) {
2360 void rb_iseq_trace_flag_cleared(
const rb_iseq_t *iseq,
size_t pos);
2361 rb_iseq_trace_flag_cleared(iseq, pos);
2374 for (i = 0; i < level; i++) {
2375 diseq = ISEQ_BODY(diseq)->parent_iseq;
2377 idx = ISEQ_BODY(diseq)->local_table_size - (int)op - 1;
2378 lid = ISEQ_BODY(diseq)->local_table[idx];
2393 int rb_insn_unified_local_var_level(
VALUE);
2397 rb_insn_operand_intern(
const rb_iseq_t *iseq,
2401 const char *types = insn_op_types(insn);
2402 char type = types[op_no];
2411 if (insn == BIN(defined) && op_no == 0) {
2412 enum defined_type deftype = (
enum defined_type)op;
2415 ret = rb_fstring_lit(
"func");
2418 ret = rb_fstring_lit(
"ref");
2420 case DEFINED_CONST_FROM:
2421 ret = rb_fstring_lit(
"constant-from");
2424 ret = rb_iseq_defined_string(deftype);
2429 else if (insn == BIN(checktype) && op_no == 0) {
2440 if (types[op_no+1] == TS_NUM && pnop) {
2441 ret = local_var_name(iseq, *pnop, op - VM_ENV_DATA_SIZE);
2443 else if ((level = rb_insn_unified_local_var_level(insn)) >= 0) {
2444 ret = local_var_name(iseq, (
VALUE)level, op - VM_ENV_DATA_SIZE);
2456 op = obj_resurrect(op);
2457 if (insn == BIN(defined) && op_no == 1 &&
FIXNUM_P(op)) {
2470 ret = rb_dump_literal(op);
2482 ret = ISEQ_BODY(iseq)->location.label;
2496 const ID *segments = ((
IC)op)->segments;
2515 ID mid = vm_ci_mid(ci);
2523 if (vm_ci_flag(ci) & VM_CALL_KWARG) {
2529 if (vm_ci_flag(ci)) {
2531 # define CALL_FLAG(n) if (vm_ci_flag(ci) & VM_CALL_##n) rb_ary_push(flags, rb_str_new2(#n))
2532 CALL_FLAG(ARGS_SPLAT);
2533 CALL_FLAG(ARGS_SPLAT_MUT);
2534 CALL_FLAG(ARGS_BLOCKARG);
2537 CALL_FLAG(ARGS_SIMPLE);
2538 CALL_FLAG(TAILCALL);
2542 CALL_FLAG(KW_SPLAT);
2543 CALL_FLAG(KW_SPLAT_MUT);
2544 CALL_FLAG(FORWARDING);
2545 CALL_FLAG(OPT_SEND);
2561 if (dladdr((
void *)op, &info) && info.dli_sname) {
2574 bf->name, bf->argc);
2585 right_strip(
VALUE str)
2588 while (end-- > beg && *end ==
' ');
2598 rb_iseq_disasm_insn(
VALUE ret,
const VALUE *code,
size_t pos,
2601 VALUE insn = code[pos];
2602 int len = insn_len(insn);
2604 const char *types = insn_op_types(insn);
2606 const char *insn_name_buff;
2608 insn_name_buff = insn_name(insn);
2610 extern const int rb_vm_max_insn_name_size;
2611 rb_str_catf(str,
"%04"PRIuSIZE
" %-*s ", pos, rb_vm_max_insn_name_size, insn_name_buff);
2615 (
int)strcspn(insn_name_buff,
"_"), insn_name_buff);
2618 for (j = 0; types[j]; j++) {
2619 VALUE opstr = rb_insn_operand_intern(iseq, insn, j, code[pos + j + 1],
2620 len, pos, &code[pos + j + 2],
2630 unsigned int line_no = rb_iseq_line_no(iseq, pos);
2631 unsigned int prev = pos == 0 ? 0 : rb_iseq_line_no(iseq, pos - 1);
2632 if (line_no && line_no != prev) {
2634 slen = (slen > 70) ? 0 : (70 - slen);
2635 str =
rb_str_catf(str,
"%*s(%4d)", (
int)slen,
"", line_no);
2642 str =
rb_str_catf(str,
"[%s%s%s%s%s%s%s%s%s%s%s%s]",
2653 events & RUBY_EVENT_COVERAGE_LINE ?
"Cli" :
"",
2654 events & RUBY_EVENT_COVERAGE_BRANCH ?
"Cbr" :
"");
2670 catch_type(
int type)
2673 case CATCH_TYPE_RESCUE:
2675 case CATCH_TYPE_ENSURE:
2677 case CATCH_TYPE_RETRY:
2679 case CATCH_TYPE_BREAK:
2681 case CATCH_TYPE_REDO:
2683 case CATCH_TYPE_NEXT:
2695 if (!body->location.label) {
2700 return rb_sprintf(
"#<ISeq:%"PRIsVALUE
"@%"PRIsVALUE
":%d (%d,%d)-(%d,%d)>",
2701 body->location.label, rb_iseq_path(iseq),
2702 loc->beg_pos.lineno,
2703 loc->beg_pos.lineno,
2704 loc->beg_pos.column,
2705 loc->end_pos.lineno,
2706 loc->end_pos.column);
2712 {(void (*)(
void *))
rb_mark_set, (void (*)(
void *))st_free_table, 0, 0,},
2713 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
2727 enum {header_minlen = 72};
2730 const char *indent_str;
2733 size = body->iseq_size;
2742 if ((l =
RSTRING_LEN(str) - indent_len) < header_minlen) {
2746 if (iseq->body->builtin_attrs) {
2747 #define disasm_builtin_attr(str, iseq, attr) \
2748 if (iseq->body->builtin_attrs & BUILTIN_ATTR_ ## attr) { \
2749 rb_str_cat2(str, " " #attr); \
2751 disasm_builtin_attr(str, iseq, LEAF);
2752 disasm_builtin_attr(str, iseq, SINGLE_NOARG_LEAF);
2753 disasm_builtin_attr(str, iseq, INLINE_BLOCK);
2754 disasm_builtin_attr(str, iseq, C_TRACE);
2759 if (body->catch_table) {
2763 if (body->catch_table) {
2766 for (i = 0; i < body->catch_table->size; i++) {
2768 UNALIGNED_MEMBER_PTR(body->catch_table, entries[i]);
2771 "| catch type: %-6s st: %04d ed: %04d sp: %04d cont: %04d\n",
2772 catch_type((
int)entry->type), (
int)entry->start,
2773 (
int)entry->end, (
int)entry->sp, (
int)entry->cont);
2774 if (entry->iseq && !(done_iseq && st_is_member(done_iseq, (st_data_t)entry->iseq))) {
2775 rb_str_concat(str, rb_iseq_disasm_recursive(rb_iseq_check(entry->iseq), indent));
2777 done_iseq = st_init_numtable();
2780 st_insert(done_iseq, (st_data_t)entry->iseq, (st_data_t)0);
2787 if (body->catch_table) {
2789 rb_str_cat2(str,
"|-------------------------------------"
2790 "-----------------------------------\n");
2794 if (body->local_table) {
2795 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
2798 "local table (size: %d, argc: %d "
2799 "[opts: %d, rest: %d, post: %d, block: %d, kw: %d@%d, kwrest: %d])\n",
2800 body->local_table_size,
2801 body->
param.lead_num,
2802 body->
param.opt_num,
2803 body->
param.flags.has_rest ? body->
param.rest_start : -1,
2804 body->
param.post_num,
2805 body->
param.flags.has_block ? body->
param.block_start : -1,
2806 body->
param.flags.has_kw ? keyword->num : -1,
2807 body->
param.flags.has_kw ? keyword->required_num : -1,
2808 body->
param.flags.has_kwrest ? keyword->rest_start : -1);
2810 for (i = body->local_table_size; i > 0;) {
2811 int li = body->local_table_size - --i - 1;
2813 VALUE name = local_var_name(iseq, 0, i);
2818 if (body->
param.flags.has_opt) {
2819 int argc = body->
param.lead_num;
2820 int opts = body->
param.opt_num;
2821 if (li >= argc && li < argc + opts) {
2822 snprintf(opti,
sizeof(opti),
"Opt=%"PRIdVALUE,
2823 body->
param.opt_table[li - argc]);
2827 snprintf(argi,
sizeof(argi),
"%s%s%s%s%s%s",
2828 (body->
param.lead_num > li) ? (body->
param.flags.ambiguous_param0 ?
"AmbiguousArg" :
"Arg") :
"",
2830 (body->
param.flags.has_rest && body->
param.rest_start == li) ? (body->
param.flags.anon_rest ?
"AnonRest" :
"Rest") :
"",
2831 (body->
param.flags.has_post && body->
param.post_start <= li && li < body->param.post_start + body->
param.post_num) ?
"Post" :
"",
2832 (body->
param.flags.has_kwrest && keyword->rest_start == li) ? (body->
param.flags.anon_kwrest ?
"AnonKwrest" :
"Kwrest") :
"",
2833 (body->
param.flags.has_block && body->
param.block_start == li) ?
"Block" :
"");
2846 code = rb_iseq_original_iseq(iseq);
2847 for (n = 0; n < size;) {
2849 n += rb_iseq_disasm_insn(str, code, n, iseq, child);
2854 if (done_iseq && st_is_member(done_iseq, (st_data_t)isv))
continue;
2878 rb_estimate_iv_count(
VALUE klass,
const rb_iseq_t * initialize_iseq)
2880 struct rb_id_table * iv_names = rb_id_table_create(0);
2882 for (
unsigned int i = 0; i < ISEQ_BODY(initialize_iseq)->ivc_size; i++) {
2883 IVC cache = (
IVC)&ISEQ_BODY(initialize_iseq)->is_entries[i];
2885 if (cache->iv_set_name) {
2886 rb_id_table_insert(iv_names, cache->iv_set_name,
Qtrue);
2890 attr_index_t count = (attr_index_t)rb_id_table_size(iv_names);
2893 count += RCLASS_EXT(superclass)->max_iv_count;
2895 rb_id_table_free(iv_names);
2919 iseqw_disasm(
VALUE self)
2921 return rb_iseq_disasm(iseqw_check(
self));
2925 iseq_iterate_children(
const rb_iseq_t *iseq,
void (*iter_func)(
const rb_iseq_t *child_iseq,
void *data),
void *data)
2928 VALUE *code = rb_iseq_original_iseq(iseq);
2933 if (body->catch_table) {
2934 for (i = 0; i < body->catch_table->size; i++) {
2936 UNALIGNED_MEMBER_PTR(body->catch_table, entries[i]);
2937 child = entry->iseq;
2941 (*iter_func)(child, data);
2947 for (i=0; i<body->iseq_size;) {
2948 VALUE insn = code[i];
2949 int len = insn_len(insn);
2950 const char *types = insn_op_types(insn);
2953 for (j=0; types[j]; j++) {
2960 (*iter_func)(child, data);
2975 yield_each_children(
const rb_iseq_t *child_iseq,
void *data)
2989 iseqw_each_child(
VALUE self)
2991 const rb_iseq_t *iseq = iseqw_check(
self);
2992 iseq_iterate_children(iseq, yield_each_children, NULL);
2999 #define C(ev, cstr, l) if (events & ev) rb_ary_push(ary, rb_ary_new_from_args(2, l, ID2SYM(rb_intern(cstr))));
3019 iseqw_trace_points(
VALUE self)
3021 const rb_iseq_t *iseq = iseqw_check(
self);
3026 for (i=0; i<body->insns_info.size; i++) {
3028 if (entry->events) {
3029 push_event_info(iseq, entry->events, entry->line_no, ary);
3075 if (rb_frame_info_p(body)) {
3076 iseq = rb_get_iseq_from_frame_info(body);
3079 iseq = vm_proc_iseq(body);
3081 if (!rb_obj_is_iseq((
VALUE)iseq)) {
3086 iseq = rb_method_iseq(body);
3088 else if (rb_typeddata_is_instance_of(body, &iseqw_data_type)) {
3092 return iseq ? iseqw_new(iseq) :
Qnil;
3150 VALUE iseqw = iseqw_s_of(klass, body);
3151 return NIL_P(iseqw) ?
Qnil : rb_iseq_disasm(iseqw_check(iseqw));
3155 register_label(
struct st_table *table,
unsigned long idx)
3158 st_insert(table, idx, sym);
3167 case CATCH_TYPE_RESCUE:
CONST_ID(
id,
"rescue");
break;
3168 case CATCH_TYPE_ENSURE:
CONST_ID(
id,
"ensure");
break;
3169 case CATCH_TYPE_RETRY:
CONST_ID(
id,
"retry");
break;
3170 case CATCH_TYPE_BREAK:
CONST_ID(
id,
"break");
break;
3171 case CATCH_TYPE_REDO:
CONST_ID(
id,
"redo");
break;
3172 case CATCH_TYPE_NEXT:
CONST_ID(
id,
"next");
break;
3174 rb_bug(
"unknown exception type: %d", (
int)
type);
3189 {(void (*)(
void *))
rb_mark_tbl, (void (*)(
void *))st_free_table, 0, 0,},
3190 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
3193 #define DECL_ID(name) \
3196 #define INIT_ID(name) \
3197 id_##name = rb_intern(#name)
3200 iseq_type_id(
enum rb_iseq_type
type)
3225 case ISEQ_TYPE_TOP:
return id_top;
3226 case ISEQ_TYPE_METHOD:
return id_method;
3227 case ISEQ_TYPE_BLOCK:
return id_block;
3228 case ISEQ_TYPE_CLASS:
return id_class;
3229 case ISEQ_TYPE_RESCUE:
return id_rescue;
3230 case ISEQ_TYPE_ENSURE:
return id_ensure;
3231 case ISEQ_TYPE_EVAL:
return id_eval;
3232 case ISEQ_TYPE_MAIN:
return id_main;
3233 case ISEQ_TYPE_PLAIN:
return id_plain;
3236 rb_bug(
"unsupported iseq type: %d", (
int)
type);
3248 VALUE *seq, *iseq_original;
3259 static ID insn_syms[VM_INSTRUCTION_SIZE/2];
3260 struct st_table *labels_table = st_init_numtable();
3263 if (insn_syms[0] == 0) {
3265 for (i=0; i<numberof(insn_syms); i++) {
3271 type = iseq_type_id(iseq_body->type);
3274 for (i=0; i<iseq_body->local_table_size; i++) {
3275 ID lid = iseq_body->local_table[i];
3291 const struct rb_iseq_param_keyword *
const keyword = iseq_body->
param.keyword;
3294 if (iseq_body->
param.flags.has_opt) {
3295 int len = iseq_body->
param.opt_num + 1;
3298 for (j = 0; j <
len; j++) {
3299 VALUE l = register_label(labels_table, iseq_body->
param.opt_table[j]);
3311 if (iseq_body->
param.flags.has_kw) {
3314 for (i=0; i<keyword->required_num; i++) {
3317 for (j=0; i<keyword->num; i++, j++) {
3319 if (!UNDEF_P(keyword->default_values[j])) {
3326 INT2FIX(keyword->bits_start));
3335 iseq_original = rb_iseq_original_iseq((
rb_iseq_t *)iseq);
3337 for (seq = iseq_original; seq < iseq_original + iseq_body->iseq_size; ) {
3338 VALUE insn = *seq++;
3339 int j,
len = insn_len(insn);
3344 for (j=0; j<
len-1; j++, seq++) {
3345 enum ruby_insn_type_chars op_type = insn_op_type(insn, j);
3349 unsigned long idx = nseq - iseq_original + *seq;
3350 rb_ary_push(ary, register_label(labels_table, idx));
3364 VALUE val = iseq_data_to_ary(rb_iseq_check(iseq));
3375 const ID *ids = ((
IC)*seq)->segments;
3395 int argc = vm_ci_argc(ci);
3397 ID mid = vm_ci_mid(ci);
3401 if (vm_ci_flag(ci) & VM_CALL_KWARG) {
3406 argc -= kwarg->keyword_len;
3407 for (i = 0; i < kwarg->keyword_len; i++) {
3431 unsigned long idx = nseq - iseq_original + pos;
3434 register_label(labels_table, idx));
3441 #if SIZEOF_VALUE <= SIZEOF_LONG
3452 #if SIZEOF_VALUE <= SIZEOF_LONG
3465 rb_bug(
"unknown operand: %c", insn_op_type(insn, j));
3474 if (iseq_body->catch_table)
for (i=0; i<iseq_body->catch_table->size; i++) {
3477 UNALIGNED_MEMBER_PTR(iseq_body->catch_table, entries[i]);
3478 rb_ary_push(ary, exception_type2symbol(entry->type));
3480 rb_ary_push(ary, iseq_data_to_ary(rb_iseq_check(entry->iseq)));
3485 rb_ary_push(ary, register_label(labels_table, entry->start));
3486 rb_ary_push(ary, register_label(labels_table, entry->end));
3487 rb_ary_push(ary, register_label(labels_table, entry->cont));
3494 prev_insn_info = NULL;
3495 #ifdef USE_ISEQ_NODE_ID
3504 if (st_lookup(labels_table, pos, &label)) {
3508 info = get_insn_info(iseq, pos);
3509 #ifdef USE_ISEQ_NODE_ID
3513 if (prev_insn_info != info) {
3514 int line = info->line_no;
3517 if (line > 0 && last_line != line) {
3521 #define CHECK_EVENT(ev) if (events & ev) rb_ary_push(body, ID2SYM(rb_intern(#ev)));
3531 prev_insn_info = info;
3546 INT2FIX(iseq_body->location.code_location.beg_pos.lineno),
3547 INT2FIX(iseq_body->location.code_location.beg_pos.column),
3548 INT2FIX(iseq_body->location.code_location.end_pos.lineno),
3549 INT2FIX(iseq_body->location.code_location.end_pos.column)));
3550 #ifdef USE_ISEQ_NODE_ID
3578 rb_iseq_parameters(
const rb_iseq_t *iseq,
int is_proc)
3582 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
3584 ID req, opt, rest, block, key, keyrest;
3585 #define PARAM_TYPE(type) rb_ary_push(a = rb_ary_new2(2), ID2SYM(type))
3586 #define PARAM_ID(i) body->local_table[(i)]
3587 #define PARAM(i, type) ( \
3589 rb_id2str(PARAM_ID(i)) ? \
3590 rb_ary_push(a, ID2SYM(PARAM_ID(i))) : \
3596 if (body->
param.flags.forwardable) {
3607 for (i = 0; i < body->
param.lead_num; i++) {
3614 for (i = 0; i < body->
param.lead_num; i++) {
3618 r = body->
param.lead_num + body->
param.opt_num;
3619 for (; i < r; i++) {
3626 if (body->
param.flags.has_rest) {
3630 r = body->
param.post_start + body->
param.post_num;
3632 for (i = body->
param.post_start; i < r; i++) {
3639 for (i = body->
param.post_start; i < r; i++) {
3643 if (body->
param.flags.accepts_no_kwarg) {
3649 if (body->
param.flags.has_kw) {
3651 if (keyword->required_num > 0) {
3654 for (; i < keyword->required_num; i++) {
3663 for (; i < keyword->num; i++) {
3671 if (body->
param.flags.has_kwrest || body->
param.flags.ruby2_keywords) {
3674 PARAM_TYPE(keyrest);
3675 if (body->
param.flags.has_kwrest &&
3676 rb_id2str(param = PARAM_ID(keyword->rest_start))) {
3679 else if (body->
param.flags.ruby2_keywords) {
3684 if (body->
param.flags.has_block) {
3692 rb_iseq_defined_string(
enum defined_type
type)
3694 static const char expr_names[][18] = {
3696 "instance-variable",
3712 if ((
unsigned)(
type - 1) >= (
unsigned)numberof(expr_names))
rb_bug(
"unknown defined type %d",
type);
3713 estr = expr_names[
type - 1];
3714 return rb_fstring_cstr(estr);
3720 static st_table *encoded_insn_data;
3724 void *notrace_encoded_insn;
3725 void *trace_encoded_insn;
3727 static insn_data_t insn_data[VM_INSTRUCTION_SIZE/2];
3730 rb_free_encoded_insn_data(
void)
3732 st_free_table(encoded_insn_data);
3736 rb_vm_encoded_insn_data_table_init(
void)
3738 #if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
3739 const void *
const *table = rb_vm_get_insns_address_table();
3740 #define INSN_CODE(insn) ((VALUE)table[insn])
3742 #define INSN_CODE(insn) (insn)
3745 encoded_insn_data = st_init_numtable_with_size(VM_INSTRUCTION_SIZE / 2);
3747 for (insn = 0; insn < VM_INSTRUCTION_SIZE/2; insn++) {
3748 st_data_t key1 = (st_data_t)INSN_CODE(insn);
3749 st_data_t key2 = (st_data_t)INSN_CODE(insn + VM_INSTRUCTION_SIZE/2);
3751 insn_data[insn].insn = (int)insn;
3752 insn_data[insn].insn_len = insn_len(insn);
3754 if (insn != BIN(opt_invokebuiltin_delegate_leave)) {
3755 insn_data[insn].notrace_encoded_insn = (
void *) key1;
3756 insn_data[insn].trace_encoded_insn = (
void *) key2;
3759 insn_data[insn].notrace_encoded_insn = (
void *) INSN_CODE(BIN(opt_invokebuiltin_delegate));
3760 insn_data[insn].trace_encoded_insn = (
void *) INSN_CODE(BIN(opt_invokebuiltin_delegate) + VM_INSTRUCTION_SIZE/2);
3763 st_add_direct(encoded_insn_data, key1, (st_data_t)&insn_data[insn]);
3764 st_add_direct(encoded_insn_data, key2, (st_data_t)&insn_data[insn]);
3769 rb_vm_insn_addr2insn(
const void *addr)
3771 st_data_t key = (st_data_t)addr;
3774 if (st_lookup(encoded_insn_data, key, &val)) {
3776 return (
int)e->insn;
3779 rb_bug(
"rb_vm_insn_addr2insn: invalid insn address: %p", addr);
3784 rb_vm_insn_addr2opcode(
const void *addr)
3786 st_data_t key = (st_data_t)addr;
3789 if (st_lookup(encoded_insn_data, key, &val)) {
3791 int opcode = e->insn;
3792 if (addr == e->trace_encoded_insn) {
3793 opcode += VM_INSTRUCTION_SIZE/2;
3798 rb_bug(
"rb_vm_insn_addr2opcode: invalid insn address: %p", addr);
3803 rb_vm_insn_decode(
const VALUE encoded)
3805 #if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
3806 int insn = rb_vm_insn_addr2insn((
void *)encoded);
3808 int insn = (int)encoded;
3814 encoded_iseq_trace_instrument(
VALUE *iseq_encoded_insn,
rb_event_flag_t turnon,
bool remain_current_trace)
3816 st_data_t key = (st_data_t)*iseq_encoded_insn;
3819 if (st_lookup(encoded_insn_data, key, &val)) {
3821 if (remain_current_trace && key == (st_data_t)e->trace_encoded_insn) {
3824 *iseq_encoded_insn = (
VALUE) (turnon ? e->trace_encoded_insn : e->notrace_encoded_insn);
3828 rb_bug(
"trace_instrument: invalid insn address: %p", (
void *)*iseq_encoded_insn);
3832 rb_iseq_trace_flag_cleared(
const rb_iseq_t *iseq,
size_t pos)
3835 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3836 encoded_iseq_trace_instrument(&iseq_encoded[pos], 0,
false);
3862 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3864 VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
3866 for (pc=0; pc<body->iseq_size;) {
3870 unsigned int line = (int)entry->line_no;
3872 if (target_line == 0 || target_line == line) {
3879 if (pc_events & target_events) {
3882 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (target_events | iseq->aux.exec.global_trace_events),
true);
3886 if (iseq->aux.exec.local_hooks == NULL) {
3888 iseq->aux.exec.local_hooks->is_local =
true;
3890 rb_hook_list_connect_tracepoint((
VALUE)iseq, iseq->aux.exec.local_hooks, tpval, target_line);
3899 unsigned int target_line;
3904 iseq_add_local_tracepoint_i(
const rb_iseq_t *iseq,
void *p)
3907 data->n += iseq_add_local_tracepoint(iseq, data->turnon_events, data->tpval, data->target_line);
3908 iseq_iterate_children(iseq, iseq_add_local_tracepoint_i, p);
3912 rb_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)
3915 if (target_bmethod) {
3916 turnon_events = add_bmethod_events(turnon_events);
3918 data.turnon_events = turnon_events;
3920 data.target_line = target_line;
3923 iseq_add_local_tracepoint_i(iseq, (
void *)&data);
3933 if (iseq->aux.exec.local_hooks) {
3936 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3939 rb_hook_list_remove_tracepoint(iseq->aux.exec.local_hooks, tpval);
3940 local_events = iseq->aux.exec.local_hooks->events;
3942 if (local_events == 0) {
3943 rb_hook_list_free(iseq->aux.exec.local_hooks);
3944 ((
rb_iseq_t *)iseq)->aux.exec.local_hooks = NULL;
3947 local_events = add_bmethod_events(local_events);
3948 for (pc = 0; pc<body->iseq_size;) {
3950 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (local_events | iseq->aux.exec.global_trace_events),
false);
3962 iseq_remove_local_tracepoint_i(
const rb_iseq_t *iseq,
void *p)
3965 data->n += iseq_remove_local_tracepoint(iseq, data->tpval);
3966 iseq_iterate_children(iseq, iseq_remove_local_tracepoint_i, p);
3970 rb_iseq_remove_local_tracepoint_recursively(
const rb_iseq_t *iseq,
VALUE tpval)
3976 iseq_remove_local_tracepoint_i(iseq, (
void *)&data);
3983 if (iseq->aux.exec.global_trace_events == turnon_events) {
3987 if (!ISEQ_EXECUTABLE_P(iseq)) {
3994 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3996 rb_event_flag_t local_events = iseq->aux.exec.local_hooks ? iseq->aux.exec.local_hooks->events : 0;
3997 ((
rb_iseq_t *)iseq)->aux.exec.global_trace_events = turnon_events;
3998 enabled_events = add_bmethod_events(turnon_events | local_events);
4000 for (pc=0; pc<body->iseq_size;) {
4002 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & enabled_events,
true);
4010 clear_attr_cc(
VALUE v)
4012 if (imemo_type_p(v, imemo_callcache) && vm_cc_ivar_p((
const struct rb_callcache *)v)) {
4022 clear_bf_cc(
VALUE v)
4024 if (imemo_type_p(v, imemo_callcache) && vm_cc_bf_p((
const struct rb_callcache *)v)) {
4034 clear_attr_ccs_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4037 for (; v != (
VALUE)vend; v += stride) {
4038 void *
ptr = asan_poisoned_object_p(v);
4039 asan_unpoison_object(v,
false);
4041 asan_poison_object_if(
ptr, v);
4047 rb_clear_attr_ccs(
void)
4049 rb_objspace_each_objects(clear_attr_ccs_i, NULL);
4053 clear_bf_ccs_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4056 for (; v != (
VALUE)vend; v += stride) {
4057 void *
ptr = asan_poisoned_object_p(v);
4058 asan_unpoison_object(v,
false);
4060 asan_poison_object_if(
ptr, v);
4066 rb_clear_bf_ccs(
void)
4068 rb_objspace_each_objects(clear_bf_ccs_i, NULL);
4072 trace_set_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4077 for (; v != (
VALUE)vend; v += stride) {
4078 void *
ptr = asan_poisoned_object_p(v);
4079 asan_unpoison_object(v,
false);
4081 if (rb_obj_is_iseq(v)) {
4082 rb_iseq_trace_set(rb_iseq_check((
rb_iseq_t *)v), turnon_events);
4084 else if (clear_attr_cc(v)) {
4086 else if (clear_bf_cc(v)) {
4089 asan_poison_object_if(
ptr, v);
4097 rb_objspace_each_objects(trace_set_i, &turnon_events);
4101 rb_iseqw_local_variables(
VALUE iseqval)
4103 return rb_iseq_local_variables(iseqw_check(iseqval));
4124 iseqw_to_binary(
int argc,
VALUE *argv,
VALUE self)
4127 return rb_iseq_ibf_dump(iseqw_check(
self), opt);
4144 iseqw_s_load_from_binary(
VALUE self,
VALUE str)
4146 return iseqw_new(rb_iseq_ibf_load(str));
4156 iseqw_s_load_from_binary_extra_data(
VALUE self,
VALUE str)
4158 return rb_iseq_ibf_load_extra_data(str);
4161 #if VM_INSN_INFO_TABLE_IMPL == 2
4194 #define IMMEDIATE_TABLE_SIZE 54
4197 uint64_t imm_part[IMMEDIATE_TABLE_SIZE / 9];
4200 uint64_t small_block_ranks;
4201 uint64_t bits[512/64];
4202 } succ_part[FLEX_ARY_LEN];
4205 #define imm_block_rank_set(v, i, r) (v) |= (uint64_t)(r) << (7 * (i))
4206 #define imm_block_rank_get(v, i) (((int)((v) >> ((i) * 7))) & 0x7f)
4207 #define small_block_rank_set(v, i, r) (v) |= (uint64_t)(r) << (9 * ((i) - 1))
4208 #define small_block_rank_get(v, i) ((i) == 0 ? 0 : (((int)((v) >> (((i) - 1) * 9))) & 0x1ff))
4211 succ_index_table_create(
int max_pos,
int *data,
int size)
4213 const int imm_size = (max_pos < IMMEDIATE_TABLE_SIZE ? max_pos + 8 : IMMEDIATE_TABLE_SIZE) / 9;
4214 const int succ_size = (max_pos < IMMEDIATE_TABLE_SIZE ? 0 : (max_pos - IMMEDIATE_TABLE_SIZE + 511)) / 512;
4216 rb_xcalloc_mul_add_mul(
4217 imm_size,
sizeof(uint64_t),
4218 succ_size,
sizeof(
struct succ_dict_block));
4222 for (j = 0; j < imm_size; j++) {
4223 for (i = 0; i < 9; i++) {
4224 if (r < size && data[r] == j * 9 + i) r++;
4225 imm_block_rank_set(sd->imm_part[j], i, r);
4228 for (k = 0; k < succ_size; k++) {
4229 struct succ_dict_block *sd_block = &sd->succ_part[k];
4232 for (j = 0; j < 8; j++) {
4234 if (j) small_block_rank_set(sd_block->small_block_ranks, j, small_rank);
4235 for (i = 0; i < 64; i++) {
4236 if (r < size && data[r] == k * 512 + j * 64 + i + IMMEDIATE_TABLE_SIZE) {
4237 bits |= ((uint64_t)1) << i;
4241 sd_block->bits[j] = bits;
4242 small_rank += rb_popcount64(bits);
4248 static unsigned int *
4249 succ_index_table_invert(
int max_pos,
struct succ_index_table *sd,
int size)
4251 const int imm_size = (max_pos < IMMEDIATE_TABLE_SIZE ? max_pos + 8 : IMMEDIATE_TABLE_SIZE) / 9;
4252 const int succ_size = (max_pos < IMMEDIATE_TABLE_SIZE ? 0 : (max_pos - IMMEDIATE_TABLE_SIZE + 511)) / 512;
4253 unsigned int *positions =
ALLOC_N(
unsigned int, size), *p;
4254 int i, j, k, r = -1;
4256 for (j = 0; j < imm_size; j++) {
4257 for (i = 0; i < 9; i++) {
4258 int nr = imm_block_rank_get(sd->imm_part[j], i);
4259 if (r != nr) *p++ = j * 9 + i;
4263 for (k = 0; k < succ_size; k++) {
4264 for (j = 0; j < 8; j++) {
4265 for (i = 0; i < 64; i++) {
4266 if (sd->succ_part[k].bits[j] & (((uint64_t)1) << i)) {
4267 *p++ = k * 512 + j * 64 + i + IMMEDIATE_TABLE_SIZE;
4278 if (x < IMMEDIATE_TABLE_SIZE) {
4279 const int i = x / 9;
4280 const int j = x % 9;
4281 return imm_block_rank_get(sd->imm_part[i], j);
4284 const int block_index = (x - IMMEDIATE_TABLE_SIZE) / 512;
4285 const struct succ_dict_block *block = &sd->succ_part[block_index];
4286 const int block_bit_index = (x - IMMEDIATE_TABLE_SIZE) % 512;
4287 const int small_block_index = block_bit_index / 64;
4288 const int small_block_popcount = small_block_rank_get(block->small_block_ranks, small_block_index);
4289 const int popcnt = rb_popcount64(block->bits[small_block_index] << (63 - block_bit_index % 64));
4291 return block->rank + small_block_popcount + popcnt;
4310 iseqw_script_lines(
VALUE self)
4312 const rb_iseq_t *iseq = iseqw_check(
self);
4313 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_singleton_method(klass, mid, func, arity)
Defines klass.mid.
#define rb_define_private_method(klass, mid, func, arity)
Defines klass#mid and makes it private.
#define RUBY_EVENT_END
Encountered an end of a class clause.
#define RUBY_EVENT_C_CALL
A method, written in C, is called.
#define RUBY_EVENT_B_RETURN
Encountered a next statement.
#define RUBY_EVENT_CLASS
Encountered a new class.
#define RUBY_EVENT_LINE
Encountered a new line.
#define RUBY_EVENT_RETURN
Encountered a return statement.
#define RUBY_EVENT_C_RETURN
Return from a method, written in C.
#define RUBY_EVENT_B_CALL
Encountered an yield statement.
uint32_t rb_event_flag_t
Represents event(s).
#define RUBY_EVENT_CALL
A method, written in Ruby, is called.
#define RUBY_EVENT_RESCUE
Encountered a rescue statement.
#define RB_OBJ_FREEZE
Just another name of rb_obj_freeze_inline.
VALUE rb_define_class_under(VALUE outer, const char *name, VALUE super)
Defines a class under the namespace of outer.
void rb_undef_method(VALUE klass, const char *name)
Defines an undef of a method.
int rb_scan_args(int argc, const VALUE *argv, const char *fmt,...)
Retrieves argument from argc and argv to given VALUE references according to the format string.
void rb_define_method(VALUE klass, const char *name, VALUE(*func)(ANYARGS), int argc)
Defines a method.
#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 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_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.
void rb_raise(VALUE exc_class, const char *fmt,...)
Exception entry point.
void rb_exc_raise(VALUE mesg)
Raises an exception in the current thread.
void rb_bug(const char *fmt,...)
Interpreter panic switch.
VALUE rb_eTypeError
TypeError exception.
VALUE rb_eSyntaxError
SyntaxError exception.
VALUE rb_class_superclass(VALUE klass)
Queries the parent of the given class.
VALUE rb_obj_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.
VALUE rb_funcallv(VALUE recv, ID mid, int argc, const VALUE *argv)
Identical to rb_funcall(), except it takes the method arguments as a C array.
void rb_gc_mark_movable(VALUE obj)
Maybe this is the only function provided for C extensions to control the pinning of objects,...
void rb_mark_tbl(struct st_table *tbl)
Identical to rb_mark_hash(), except it marks only values of the table and leave their associated keys...
VALUE rb_gc_location(VALUE obj)
Finds a new "location" of an object.
void rb_mark_set(struct st_table *tbl)
Identical to rb_mark_hash(), except it marks only keys of the table and leave their associated values...
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_new_from_args(long n,...)
Constructs an array from the passed objects.
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.
void rb_jump_tag(int state)
This function is to re-throw global escapes.
void rb_hash_foreach(VALUE hash, int(*func)(VALUE key, VALUE val, VALUE arg), VALUE arg)
Iterates over a hash.
VALUE rb_hash_aref(VALUE hash, VALUE key)
Queries the given key in the given hash table.
VALUE rb_hash_aset(VALUE hash, VALUE key, VALUE val)
Inserts or replaces ("upsert"s) the objects into the given hash table.
VALUE rb_hash_lookup(VALUE hash, VALUE key)
Identical to rb_hash_aref(), except it always returns RUBY_Qnil for misshits.
VALUE rb_hash_new(void)
Creates a new, empty hash object.
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_protect(VALUE(*func)(VALUE args), VALUE args, int *state)
Protects a function call from potential global escapes from the function.
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_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_cat2(VALUE, const char *)
Just another name of rb_str_cat_cstr.
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.
VALUE rb_str_new(const char *ptr, long len)
Allocates an instance of rb_cString.
VALUE rb_str_new_cstr(const char *ptr)
Identical to rb_str_new(), except it assumes the passed pointer is a pointer to a C string.
VALUE rb_str_resize(VALUE str, long len)
Overwrites the length of the string.
void rb_str_modify_expand(VALUE str, long capa)
Identical to rb_str_modify(), except it additionally expands the capacity of the receiver.
VALUE rb_str_cat_cstr(VALUE dst, const char *src)
Identical to rb_str_cat(), 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.
const char * rb_id2name(ID id)
Retrieves the name mapped to the given id.
ID rb_intern(const char *name)
Finds or creates a symbol of the given name.
VALUE rb_sym2str(VALUE symbol)
Obtain a frozen string representation of a symbol (not including the leading colon).
VALUE rb_id2str(ID id)
Identical to rb_id2name(), except it returns a frozen Ruby String instead of a C String.
char * ptr
Pointer to the underlying memory region, of at least capa bytes.
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_sprintf(const char *fmt,...)
Ruby's extended sprintf(3).
VALUE rb_str_catf(VALUE dst, const char *fmt,...)
Identical to rb_sprintf(), except it renders the output to the specified object rather than creating ...
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.
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.
pm_line_column_t pm_newline_list_line_column(const pm_newline_list_t *list, const uint8_t *cursor, int32_t start_line)
Returns the line and column of the given offset.
#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.
static char * RSTRING_PTR(VALUE str)
Queries the contents pointer of the string.
static long RSTRING_LEN(VALUE str)
Queries the length 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.
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.
void ruby_xfree(void *ptr)
Deallocates a storage instance.