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"
40#include "vm_callinfo.h"
45#include "insns_info.inc"
51#if VM_INSN_INFO_TABLE_IMPL == 2
52static struct succ_index_table *succ_index_table_create(
int max_pos,
int *data,
int size);
53static unsigned int *succ_index_table_invert(
int max_pos,
struct succ_index_table *sd,
int size);
54static int succ_index_lookup(
const struct succ_index_table *sd,
int x);
57#define hidden_obj_p(obj) (!SPECIAL_CONST_P(obj) && !RBASIC(obj)->klass)
60obj_resurrect(
VALUE obj)
62 if (hidden_obj_p(obj)) {
68 obj = rb_ary_resurrect(obj);
71 obj = rb_hash_resurrect(obj);
96 free_arena(compile_data->node.storage_head);
97 free_arena(compile_data->insn.storage_head);
98 if (compile_data->ivar_cache_table) {
99 rb_id_table_free(compile_data->ivar_cache_table);
101 ruby_xfree(compile_data);
106remove_from_constant_cache(
ID id,
IC ic)
110 st_data_t ic_data = (st_data_t)ic;
112 if (rb_id_table_lookup(vm->constant_cache,
id, &lookup_result)) {
114 st_delete(ics, &ic_data, NULL);
116 if (ics->num_entries == 0 &&
118 id != vm->inserting_constant_cache_id) {
119 rb_id_table_delete(vm->constant_cache,
id);
129iseq_clear_ic_references(
const rb_iseq_t *iseq)
135 if (!ISEQ_BODY(iseq)->is_entries) {
139 for (
unsigned int ic_idx = 0; ic_idx < ISEQ_BODY(iseq)->ic_size; ic_idx++) {
140 IC ic = &ISEQ_IS_IC_ENTRY(ISEQ_BODY(iseq), ic_idx);
148 if (segments == NULL)
151 for (
int i = 0; segments[i]; i++) {
153 if (
id == idNULL)
continue;
154 remove_from_constant_cache(
id, ic);
157 ruby_xfree((
void *)segments);
164 RUBY_FREE_ENTER(
"iseq");
166 if (iseq && ISEQ_BODY(iseq)) {
167 iseq_clear_ic_references(iseq);
170 rb_yjit_iseq_free(iseq);
173 rb_yjit_live_iseq_count--;
176 ruby_xfree((
void *)body->iseq_encoded);
177 ruby_xfree((
void *)body->insns_info.body);
178 ruby_xfree((
void *)body->insns_info.positions);
179#if VM_INSN_INFO_TABLE_IMPL == 2
180 ruby_xfree(body->insns_info.succ_index_table);
182 ruby_xfree((
void *)body->is_entries);
183 ruby_xfree(body->call_data);
184 ruby_xfree((
void *)body->catch_table);
185 ruby_xfree((
void *)body->
param.opt_table);
186 if (ISEQ_MBITS_BUFLEN(body->iseq_size) > 1 && body->mark_bits.list) {
187 ruby_xfree((
void *)body->mark_bits.list);
190 ruby_xfree(body->variable.original_iseq);
192 if (body->
param.keyword != NULL) {
193 if (body->
param.keyword->table != &body->local_table[body->
param.keyword->bits_start - body->
param.keyword->num])
194 ruby_xfree((
void *)body->
param.keyword->table);
195 if (body->
param.keyword->default_values) {
196 ruby_xfree((
void *)body->
param.keyword->default_values);
198 ruby_xfree((
void *)body->
param.keyword);
200 if (LIKELY(body->local_table != rb_iseq_shared_exc_local_tbl))
201 ruby_xfree((
void *)body->local_table);
202 compile_data_free(ISEQ_COMPILE_DATA(iseq));
203 if (body->outer_variables) rb_id_table_free(body->outer_variables);
207 if (iseq && ISEQ_EXECUTABLE_P(iseq) && iseq->aux.exec.local_hooks) {
208 rb_hook_list_free(iseq->aux.exec.local_hooks);
211 RUBY_FREE_LEAVE(
"iseq");
214typedef VALUE iseq_value_itr_t(
void *ctx,
VALUE obj);
217iseq_scan_bits(
unsigned int page, iseq_bits_t bits,
VALUE *code,
VALUE *original_iseq)
220 unsigned int page_offset = (page * ISEQ_MBITS_BITLENGTH);
223 offset = ntz_intptr(bits);
224 VALUE op = code[page_offset + offset];
225 rb_gc_mark_and_move(&code[page_offset + offset]);
226 VALUE newop = code[page_offset + offset];
227 if (original_iseq && newop != op) {
228 original_iseq[page_offset + offset] = newop;
235rb_iseq_mark_and_move_each_value(
const rb_iseq_t *iseq,
VALUE *original_iseq)
241 size = body->iseq_size;
242 code = body->iseq_encoded;
246 if (body->is_entries) {
248 is_entries += body->ivc_size;
251 for (
unsigned int i = 0; i < body->icvarc_size; i++, is_entries++) {
256 rb_gc_mark_and_move(&icvarc->entry->class_value);
261 for (
unsigned int i = 0; i < body->ise_size; i++, is_entries++) {
263 if (is->once.value) {
264 rb_gc_mark_and_move(&is->once.value);
269 for (
unsigned int i = 0; i < body->ic_size; i++, is_entries++) {
270 IC ic = (
IC)is_entries;
272 rb_gc_mark_and_move_ptr(&ic->entry);
278 if (body->mark_bits.list) {
279 if (ISEQ_MBITS_BUFLEN(size) == 1) {
280 iseq_scan_bits(0, body->mark_bits.single, code, original_iseq);
283 if (body->mark_bits.list) {
284 for (
unsigned int i = 0; i < ISEQ_MBITS_BUFLEN(size); i++) {
285 iseq_bits_t bits = body->mark_bits.list[i];
286 iseq_scan_bits(i, bits, code, original_iseq);
294cc_is_active(
const struct rb_callcache *cc,
bool reference_updating)
297 if (cc == rb_vm_empty_cc() || rb_vm_empty_cc_for_super()) {
301 if (reference_updating) {
305 if (vm_cc_markable(cc)) {
308 if (reference_updating) {
311 if (!METHOD_ENTRY_INVALIDATED(cme)) {
321rb_iseq_mark_and_move(
rb_iseq_t *iseq,
bool reference_updating)
323 RUBY_MARK_ENTER(
"iseq");
325 rb_gc_mark_and_move(&iseq->wrapper);
327 if (ISEQ_BODY(iseq)) {
330 rb_iseq_mark_and_move_each_value(iseq, reference_updating ? ISEQ_ORIGINAL_ISEQ(iseq) : NULL);
332 rb_gc_mark_and_move(&body->variable.coverage);
333 rb_gc_mark_and_move(&body->variable.pc2branchindex);
334 rb_gc_mark_and_move(&body->variable.script_lines);
335 rb_gc_mark_and_move(&body->location.label);
336 rb_gc_mark_and_move(&body->location.base_label);
337 rb_gc_mark_and_move(&body->location.pathobj);
338 if (body->local_iseq) rb_gc_mark_and_move_ptr(&body->local_iseq);
339 if (body->parent_iseq) rb_gc_mark_and_move_ptr(&body->parent_iseq);
340 if (body->mandatory_only_iseq) rb_gc_mark_and_move_ptr(&body->mandatory_only_iseq);
342 if (body->call_data) {
343 for (
unsigned int i = 0; i < body->ci_size; i++) {
346 if (cds[i].ci) rb_gc_mark_and_move_ptr(&cds[i].ci);
348 if (cc_is_active(cds[i].cc, reference_updating)) {
349 rb_gc_mark_and_move_ptr(&cds[i].cc);
351 else if (cds[i].cc != rb_vm_empty_cc()) {
352 cds[i].cc = rb_vm_empty_cc();
357 if (body->
param.flags.has_kw && body->
param.keyword != NULL) {
358 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
360 if (keyword->default_values != NULL) {
361 for (
int j = 0, i = keyword->required_num; i < keyword->num; i++, j++) {
362 rb_gc_mark_and_move(&keyword->default_values[j]);
367 if (body->catch_table) {
370 for (
unsigned int i = 0; i < table->size; i++) {
372 entry = UNALIGNED_MEMBER_PTR(table, entries[i]);
374 rb_gc_mark_and_move_ptr(&entry->iseq);
379 if (reference_updating) {
381 rb_yjit_iseq_update_references(iseq);
386 rb_yjit_iseq_mark(body->yjit_payload);
392 rb_gc_mark_and_move(&iseq->aux.loader.obj);
397 if (!reference_updating) {
403 rb_iseq_mark_and_pin_insn_storage(compile_data->insn.storage_head);
406 rb_gc_mark_and_move((
VALUE *)&compile_data->err_info);
407 rb_gc_mark_and_move((
VALUE *)&compile_data->catch_table_ary);
411 VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
413 if (iseq->aux.exec.local_hooks) {
414 rb_hook_list_mark_and_update(iseq->aux.exec.local_hooks);
418 RUBY_MARK_LEAVE(
"iseq");
422param_keyword_size(
const struct rb_iseq_param_keyword *pkw)
426 if (!pkw)
return size;
428 size +=
sizeof(
struct rb_iseq_param_keyword);
429 size +=
sizeof(
VALUE) * (pkw->num - pkw->required_num);
443 if (ISEQ_EXECUTABLE_P(iseq) && body) {
445 size += body->iseq_size *
sizeof(
VALUE);
447 size += body->local_table_size *
sizeof(
ID);
448 size += ISEQ_MBITS_BUFLEN(body->iseq_size) * ISEQ_MBITS_SIZE;
449 if (body->catch_table) {
450 size += iseq_catch_table_bytes(body->catch_table->size);
452 size += (body->
param.opt_num + 1) *
sizeof(
VALUE);
453 size += param_keyword_size(body->
param.keyword);
458 if (ISEQ_BODY(iseq)->is_entries) {
460 for (
unsigned int ic_idx = 0; ic_idx < body->ic_size; ic_idx++) {
461 IC ic = &ISEQ_IS_IC_ENTRY(body, ic_idx);
476 compile_data = ISEQ_COMPILE_DATA(iseq);
482 cur = compile_data->node.storage_head;
493rb_iseq_constant_body_alloc(
void)
504 ISEQ_BODY(iseq) = rb_iseq_constant_body_alloc();
509rb_iseq_pathobj_new(
VALUE path,
VALUE realpath)
515 if (path == realpath ||
517 pathobj = rb_fstring(path);
520 if (!
NIL_P(realpath)) realpath = rb_fstring(realpath);
521 pathobj = rb_ary_new_from_args(2, rb_fstring(path), realpath);
522 rb_ary_freeze(pathobj);
531 rb_iseq_pathobj_new(path, realpath));
539 rb_iseq_pathobj_set(iseq, path, realpath);
542 loc->first_lineno = first_lineno;
544 if (ISEQ_BODY(iseq)->local_iseq == iseq && strcmp(RSTRING_PTR(name),
"initialize") == 0) {
545 ISEQ_BODY(iseq)->param.flags.use_block = 1;
549 loc->node_id = node_id;
550 loc->code_location = *code_location;
553 loc->code_location.beg_pos.lineno = 0;
554 loc->code_location.beg_pos.column = 0;
555 loc->code_location.end_pos.lineno = -1;
556 loc->code_location.end_pos.column = -1;
569 if (
type == ISEQ_TYPE_TOP) {
570 body->local_iseq = iseq;
572 else if (
type == ISEQ_TYPE_METHOD ||
type == ISEQ_TYPE_CLASS) {
573 body->local_iseq = iseq;
576 body->local_iseq = ISEQ_BODY(piseq)->local_iseq;
580 body->parent_iseq = piseq;
583 if (
type == ISEQ_TYPE_MAIN) {
584 body->local_iseq = iseq;
593 ALLOC_N(
char, INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE +
598 new_arena->size = INITIAL_ISEQ_COMPILE_DATA_STORAGE_BUFF_SIZE;
606 const rb_iseq_t *parent,
int isolated_depth,
enum rb_iseq_type
type,
613 if (parent && (
type == ISEQ_TYPE_MAIN ||
type == ISEQ_TYPE_TOP))
617 set_relation(iseq, parent);
619 name = rb_fstring(name);
620 iseq_location_setup(iseq, name, path, realpath, first_lineno, code_location, node_id);
621 if (iseq != body->local_iseq) {
622 RB_OBJ_WRITE(iseq, &body->location.base_label, ISEQ_BODY(body->local_iseq)->location.label);
624 ISEQ_COVERAGE_SET(iseq,
Qnil);
625 ISEQ_ORIGINAL_ISEQ_CLEAR(iseq);
626 body->variable.flip_count = 0;
628 if (
NIL_P(script_lines)) {
635 ISEQ_COMPILE_DATA_ALLOC(iseq);
636 RB_OBJ_WRITE(iseq, &ISEQ_COMPILE_DATA(iseq)->err_info, err_info);
639 ISEQ_COMPILE_DATA(iseq)->node.storage_head = ISEQ_COMPILE_DATA(iseq)->node.storage_current = new_arena();
640 ISEQ_COMPILE_DATA(iseq)->insn.storage_head = ISEQ_COMPILE_DATA(iseq)->insn.storage_current = new_arena();
641 ISEQ_COMPILE_DATA(iseq)->isolated_depth = isolated_depth;
642 ISEQ_COMPILE_DATA(iseq)->option = option;
643 ISEQ_COMPILE_DATA(iseq)->ivar_cache_table = NULL;
644 ISEQ_COMPILE_DATA(iseq)->builtin_function_table = GET_VM()->builtin_function_table;
646 if (option->coverage_enabled) {
647 VALUE coverages = rb_get_coverages();
648 if (
RTEST(coverages)) {
649 coverage = rb_hash_lookup(coverages, rb_iseq_path(iseq));
653 ISEQ_COVERAGE_SET(iseq, coverage);
654 if (coverage && ISEQ_BRANCH_COVERAGE(iseq))
655 ISEQ_PC2BRANCHINDEX_SET(iseq, rb_ary_hidden_new(0));
660#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
661static void validate_get_insn_info(
const rb_iseq_t *iseq);
665rb_iseq_insns_info_encode_positions(
const rb_iseq_t *iseq)
667#if VM_INSN_INFO_TABLE_IMPL == 2
670 int size = body->insns_info.size;
671 int max_pos = body->iseq_size;
672 int *data = (
int *)body->insns_info.positions;
673 if (body->insns_info.succ_index_table) ruby_xfree(body->insns_info.succ_index_table);
674 body->insns_info.succ_index_table = succ_index_table_create(max_pos, data, size);
675#if VM_CHECK_MODE == 0
676 ruby_xfree(body->insns_info.positions);
677 body->insns_info.positions = NULL;
682#if VM_INSN_INFO_TABLE_IMPL == 2
686 int size = body->insns_info.size;
687 int max_pos = body->iseq_size;
688 struct succ_index_table *sd = body->insns_info.succ_index_table;
689 return succ_index_table_invert(max_pos, sd, size);
696 iseq->aux.exec.global_trace_events = 0;
697 if (ruby_vm_event_enabled_global_flags & ISEQ_TRACE_EVENTS) {
698 rb_iseq_trace_set(iseq, ruby_vm_event_enabled_global_flags & ISEQ_TRACE_EVENTS);
707 VALUE err = data->err_info;
708 ISEQ_COMPILE_DATA_CLEAR(iseq);
709 compile_data_free(data);
711#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
712 validate_get_insn_info(iseq);
716 VALUE path = pathobj_path(body->location.pathobj);
718 rb_funcallv(err, rb_intern(
"set_backtrace"), 1, &path);
722 RB_DEBUG_COUNTER_INC(iseq_num);
723 RB_DEBUG_COUNTER_ADD(iseq_cd_num, ISEQ_BODY(iseq)->ci_size);
725 rb_iseq_init_trace(iseq);
730 .inline_const_cache = OPT_INLINE_CONST_CACHE,
731 .peephole_optimization = OPT_PEEPHOLE_OPTIMIZATION,
732 .tailcall_optimization = OPT_TAILCALL_OPTIMIZATION,
733 .specialized_instruction = OPT_SPECIALISED_INSTRUCTION,
734 .operands_unification = OPT_OPERANDS_UNIFICATION,
735 .instructions_unification = OPT_INSTRUCTIONS_UNIFICATION,
736 .frozen_string_literal = OPT_FROZEN_STRING_LITERAL,
737 .debug_frozen_string_literal = OPT_DEBUG_FROZEN_STRING_LITERAL,
738 .coverage_enabled = TRUE,
742 .frozen_string_literal = -1,
746rb_iseq_opt_frozen_string_literal(
void)
748 return COMPILE_OPTION_DEFAULT.frozen_string_literal;
754#define SET_COMPILE_OPTION(o, h, mem) \
755 { VALUE flag = rb_hash_aref((h), ID2SYM(rb_intern(#mem))); \
756 if (flag == Qtrue) { (o)->mem = 1; } \
757 else if (flag == Qfalse) { (o)->mem = 0; } \
759#define SET_COMPILE_OPTION_NUM(o, h, mem) \
760 { VALUE num = rb_hash_aref((h), ID2SYM(rb_intern(#mem))); \
761 if (!NIL_P(num)) (o)->mem = NUM2INT(num); \
763 SET_COMPILE_OPTION(option, opt, inline_const_cache);
764 SET_COMPILE_OPTION(option, opt, peephole_optimization);
765 SET_COMPILE_OPTION(option, opt, tailcall_optimization);
766 SET_COMPILE_OPTION(option, opt, specialized_instruction);
767 SET_COMPILE_OPTION(option, opt, operands_unification);
768 SET_COMPILE_OPTION(option, opt, instructions_unification);
769 SET_COMPILE_OPTION(option, opt, frozen_string_literal);
770 SET_COMPILE_OPTION(option, opt, debug_frozen_string_literal);
771 SET_COMPILE_OPTION(option, opt, coverage_enabled);
772 SET_COMPILE_OPTION_NUM(option, opt, debug_level);
773#undef SET_COMPILE_OPTION
774#undef SET_COMPILE_OPTION_NUM
780#define SET_COMPILE_OPTION(o, a, mem) \
781 ((a)->mem < 0 ? 0 : ((o)->mem = (a)->mem > 0))
782 SET_COMPILE_OPTION(option, ast, coverage_enabled);
783#undef SET_COMPILE_OPTION
784 if (ast->frozen_string_literal >= 0) {
785 option->frozen_string_literal = ast->frozen_string_literal;
794 *option = COMPILE_OPTION_DEFAULT;
797 *option = COMPILE_OPTION_FALSE;
799 else if (opt ==
Qtrue) {
802 ((
int *)option)[i] = 1;
805 *option = COMPILE_OPTION_DEFAULT;
806 set_compile_option_from_hash(option, opt);
809 rb_raise(
rb_eTypeError,
"Compile option must be Hash/true/false/nil");
816 VALUE opt = rb_hash_new_with_size(11);
817#define SET_COMPILE_OPTION(o, h, mem) \
818 rb_hash_aset((h), ID2SYM(rb_intern(#mem)), RBOOL((o)->mem))
819#define SET_COMPILE_OPTION_NUM(o, h, mem) \
820 rb_hash_aset((h), ID2SYM(rb_intern(#mem)), INT2NUM((o)->mem))
822 SET_COMPILE_OPTION(option, opt, inline_const_cache);
823 SET_COMPILE_OPTION(option, opt, peephole_optimization);
824 SET_COMPILE_OPTION(option, opt, tailcall_optimization);
825 SET_COMPILE_OPTION(option, opt, specialized_instruction);
826 SET_COMPILE_OPTION(option, opt, operands_unification);
827 SET_COMPILE_OPTION(option, opt, instructions_unification);
828 SET_COMPILE_OPTION(option, opt, debug_frozen_string_literal);
829 SET_COMPILE_OPTION(option, opt, coverage_enabled);
830 SET_COMPILE_OPTION_NUM(option, opt, debug_level);
832#undef SET_COMPILE_OPTION
833#undef SET_COMPILE_OPTION_NUM
834 VALUE frozen_string_literal = option->frozen_string_literal == -1 ?
Qnil : RBOOL(option->frozen_string_literal);
835 rb_hash_aset(opt,
ID2SYM(rb_intern(
"frozen_string_literal")), frozen_string_literal);
843 return rb_iseq_new_with_opt(ast_value, name, path, realpath, 0, parent,
844 0,
type, &COMPILE_OPTION_DEFAULT,
849ast_line_count(
const VALUE ast_value)
851 rb_ast_t *ast = rb_ruby_ast_data_get(ast_value);
852 return ast->body.line_count;
856iseq_setup_coverage(
VALUE coverages,
VALUE path,
int line_count)
858 if (line_count >= 0) {
859 int len = (rb_get_coverage_mode() & COVERAGE_TARGET_ONESHOT_LINES) ? 0 : line_count;
861 VALUE coverage = rb_default_coverage(
len);
862 rb_hash_aset(coverages, path, coverage);
871iseq_new_setup_coverage(
VALUE path,
int line_count)
873 VALUE coverages = rb_get_coverages();
875 if (
RTEST(coverages)) {
876 iseq_setup_coverage(coverages, path, line_count);
883 iseq_new_setup_coverage(path, ast_line_count(ast_value));
885 return rb_iseq_new_with_opt(ast_value, name, path, realpath, 0, parent, 0,
886 ISEQ_TYPE_TOP, &COMPILE_OPTION_DEFAULT,
898 return pm_iseq_new_with_opt(node, name, path, realpath, 0, parent, 0,
899 ISEQ_TYPE_TOP, &COMPILE_OPTION_DEFAULT, error_state);
905 iseq_new_setup_coverage(path, ast_line_count(ast_value));
907 return rb_iseq_new_with_opt(ast_value, rb_fstring_lit(
"<main>"),
909 parent, 0, ISEQ_TYPE_MAIN, opt ? &COMPILE_OPTION_DEFAULT : &COMPILE_OPTION_FALSE,
922 return pm_iseq_new_with_opt(node, rb_fstring_lit(
"<main>"),
924 parent, 0, ISEQ_TYPE_MAIN, opt ? &COMPILE_OPTION_DEFAULT : &COMPILE_OPTION_FALSE, error_state);
928rb_iseq_new_eval(
const VALUE ast_value,
VALUE name,
VALUE path,
VALUE realpath,
int first_lineno,
const rb_iseq_t *parent,
int isolated_depth)
930 if (rb_get_coverage_mode() & COVERAGE_TARGET_EVAL) {
931 VALUE coverages = rb_get_coverages();
932 if (
RTEST(coverages) &&
RTEST(path) && !
RTEST(rb_hash_has_key(coverages, path))) {
933 iseq_setup_coverage(coverages, path, ast_line_count(ast_value) + first_lineno - 1);
937 return rb_iseq_new_with_opt(ast_value, name, path, realpath, first_lineno,
938 parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT,
944 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
int *error_state)
946 if (rb_get_coverage_mode() & COVERAGE_TARGET_EVAL) {
947 VALUE coverages = rb_get_coverages();
948 if (
RTEST(coverages) &&
RTEST(path) && !
RTEST(rb_hash_has_key(coverages, path))) {
949 iseq_setup_coverage(coverages, path, ((
int) (node->parser->
newline_list.
size - 1)) + first_lineno - 1);
953 return pm_iseq_new_with_opt(node, name, path, realpath, first_lineno,
954 parent, isolated_depth, ISEQ_TYPE_EVAL, &COMPILE_OPTION_DEFAULT, error_state);
961 VALUE v1 = iseqw_new(iseq);
963 if (v1 != v2 &&
CLASS_OF(v2) == rb_cISeq) {
973 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
977 rb_ast_t *ast = rb_ruby_ast_data_get(ast_value);
979 const NODE *node = body ? body->root : 0;
984 if (!option) option = &COMPILE_OPTION_DEFAULT;
987 option = set_compile_option_from_ast(&new_opt, body);
990 if (!
NIL_P(script_lines)) {
993 else if (body && body->script_lines) {
994 script_lines = rb_parser_build_script_lines_from(body->script_lines);
997 script_lines = ISEQ_BODY(parent)->variable.script_lines;
1000 prepare_iseq_build(iseq, name, path, realpath, first_lineno, node ? &node->nd_loc : NULL, node ? nd_node_id(node) : -1,
1001 parent, isolated_depth,
type, script_lines, option);
1003 rb_iseq_compile_node(iseq, node);
1004 finish_iseq_build(iseq);
1007 return iseq_translate(iseq);
1016pm_iseq_new_with_opt_try(
VALUE d)
1021 pm_iseq_compile_node(data->iseq, data->node);
1024 finish_iseq_build(data->iseq);
1043 int first_lineno,
const rb_iseq_t *parent,
int isolated_depth,
1047 ISEQ_BODY(iseq)->prism =
true;
1050 if (!option) option = &COMPILE_OPTION_DEFAULT;
1052 next_option = *option;
1053 next_option.coverage_enabled = node->coverage_enabled < 0 ? 0 : node->coverage_enabled > 0;
1054 option = &next_option;
1057 int32_t start_line = node->parser->
start_line;
1063 .beg_pos = { .lineno = (int) start.
line, .column = (
int) start.
column },
1064 .end_pos = { .lineno = (int) end.
line, .column = (
int) end.
column }
1067 prepare_iseq_build(iseq, name, path, realpath, first_lineno, &code_location, node->ast_node->
node_id,
1068 parent, isolated_depth,
type, node->
script_lines == NULL ?
Qnil : *node->script_lines, option);
1074 rb_protect(pm_iseq_new_with_opt_try, (
VALUE)&data, error_state);
1076 if (*error_state)
return NULL;
1078 return iseq_translate(iseq);
1082rb_iseq_new_with_callback(
1085 int first_lineno,
const rb_iseq_t *parent,
1091 if (!option) option = &COMPILE_OPTION_DEFAULT;
1092 prepare_iseq_build(iseq, name, path, realpath, first_lineno, NULL, -1, parent, 0,
type,
Qnil, option);
1094 rb_iseq_compile_callback(iseq, ifunc);
1095 finish_iseq_build(iseq);
1101rb_iseq_load_iseq(
VALUE fname)
1106 return iseqw_check(iseqv);
1112#define CHECK_ARRAY(v) rb_to_array_type(v)
1113#define CHECK_HASH(v) rb_to_hash_type(v)
1114#define CHECK_STRING(v) rb_str_to_str(v)
1115#define CHECK_SYMBOL(v) rb_to_symbol_type(v)
1118static enum rb_iseq_type
1121 const ID id_top = rb_intern(
"top");
1122 const ID id_method = rb_intern(
"method");
1123 const ID id_block = rb_intern(
"block");
1124 const ID id_class = rb_intern(
"class");
1125 const ID id_rescue = rb_intern(
"rescue");
1126 const ID id_ensure = rb_intern(
"ensure");
1127 const ID id_eval = rb_intern(
"eval");
1128 const ID id_main = rb_intern(
"main");
1129 const ID id_plain = rb_intern(
"plain");
1133 if (
typeid == id_top)
return ISEQ_TYPE_TOP;
1134 if (
typeid == id_method)
return ISEQ_TYPE_METHOD;
1135 if (
typeid == id_block)
return ISEQ_TYPE_BLOCK;
1136 if (
typeid == id_class)
return ISEQ_TYPE_CLASS;
1137 if (
typeid == id_rescue)
return ISEQ_TYPE_RESCUE;
1138 if (
typeid == id_ensure)
return ISEQ_TYPE_ENSURE;
1139 if (
typeid == id_eval)
return ISEQ_TYPE_EVAL;
1140 if (
typeid == id_main)
return ISEQ_TYPE_MAIN;
1141 if (
typeid == id_plain)
return ISEQ_TYPE_PLAIN;
1142 return (
enum rb_iseq_type)-1;
1150 VALUE magic, version1, version2, format_type, misc;
1151 VALUE name, path, realpath, code_location, node_id;
1152 VALUE type, body, locals, params, exception;
1154 st_data_t iseq_type;
1164 data = CHECK_ARRAY(data);
1166 magic = CHECK_STRING(rb_ary_entry(data, i++));
1167 version1 = CHECK_INTEGER(rb_ary_entry(data, i++));
1168 version2 = CHECK_INTEGER(rb_ary_entry(data, i++));
1169 format_type = CHECK_INTEGER(rb_ary_entry(data, i++));
1170 misc = CHECK_HASH(rb_ary_entry(data, i++));
1171 ((void)magic, (
void)version1, (void)version2, (
void)format_type);
1173 name = CHECK_STRING(rb_ary_entry(data, i++));
1174 path = CHECK_STRING(rb_ary_entry(data, i++));
1175 realpath = rb_ary_entry(data, i++);
1176 realpath =
NIL_P(realpath) ?
Qnil : CHECK_STRING(realpath);
1177 int first_lineno =
RB_NUM2INT(rb_ary_entry(data, i++));
1179 type = CHECK_SYMBOL(rb_ary_entry(data, i++));
1180 locals = CHECK_ARRAY(rb_ary_entry(data, i++));
1181 params = CHECK_HASH(rb_ary_entry(data, i++));
1182 exception = CHECK_ARRAY(rb_ary_entry(data, i++));
1183 body = CHECK_ARRAY(rb_ary_entry(data, i++));
1185 ISEQ_BODY(iseq)->local_iseq = iseq;
1187 iseq_type = iseq_type_from_sym(
type);
1188 if (iseq_type == (
enum rb_iseq_type)-1) {
1192 node_id = rb_hash_aref(misc,
ID2SYM(rb_intern(
"node_id")));
1194 code_location = rb_hash_aref(misc,
ID2SYM(rb_intern(
"code_location")));
1196 tmp_loc.beg_pos.lineno =
NUM2INT(rb_ary_entry(code_location, 0));
1197 tmp_loc.beg_pos.column =
NUM2INT(rb_ary_entry(code_location, 1));
1198 tmp_loc.end_pos.lineno =
NUM2INT(rb_ary_entry(code_location, 2));
1199 tmp_loc.end_pos.column =
NUM2INT(rb_ary_entry(code_location, 3));
1202 if (
SYM2ID(rb_hash_aref(misc,
ID2SYM(rb_intern(
"parser")))) == rb_intern(
"prism")) {
1203 ISEQ_BODY(iseq)->prism =
true;
1206 make_compile_option(&option, opt);
1207 option.peephole_optimization = FALSE;
1208 prepare_iseq_build(iseq, name, path, realpath, first_lineno, &tmp_loc,
NUM2INT(node_id),
1209 parent, 0, (
enum rb_iseq_type)iseq_type,
Qnil, &option);
1211 rb_iseq_build_from_ary(iseq, misc, locals, params, exception, body);
1213 finish_iseq_build(iseq);
1215 return iseqw_new(iseq);
1222iseq_s_load(
int argc,
VALUE *argv,
VALUE self)
1226 return iseq_load(data, NULL, opt);
1232 return iseq_load(data,
RTEST(parent) ? (
rb_iseq_t *)parent : NULL, opt);
1240#if !defined(__GNUC__) || (__GNUC__ == 4 && __GNUC_MINOR__ == 8)
1241# define INITIALIZED volatile
1247 VALUE INITIALIZED ast_value;
1249 VALUE name = rb_fstring_lit(
"<compiled>");
1252 make_compile_option(&option, opt);
1256 parse = rb_parser_compile_file_path;
1259 parse = rb_parser_compile_string_path;
1263 const VALUE parser = rb_parser_new();
1264 const rb_iseq_t *outer_scope = rb_iseq_new(
Qnil, name, name,
Qnil, 0, ISEQ_TYPE_TOP);
1266 rb_parser_set_context(parser, outer_scope, FALSE);
1267 if (ruby_vm_keep_script_lines) rb_parser_set_script_lines(parser);
1269 ast_value = (*parse)(parser, file, src, ln);
1272 ast = rb_ruby_ast_data_get(ast_value);
1274 if (!ast || !ast->body.root) {
1275 rb_ast_dispose(ast);
1279 iseq = rb_iseq_new_with_opt(ast_value, name, file, realpath, ln,
1280 NULL, 0, ISEQ_TYPE_TOP, &option,
1282 rb_ast_dispose(ast);
1294 VALUE name = rb_fstring_lit(
"<compiled>");
1297 make_compile_option(&option, opt);
1303 pm_options_scopes_init(&result.
options, 1);
1304 result.
node.coverage_enabled = 1;
1306 switch (option.frozen_string_literal) {
1307 case ISEQ_FROZEN_STRING_LITERAL_UNSET:
1309 case ISEQ_FROZEN_STRING_LITERAL_DISABLED:
1310 pm_options_frozen_string_literal_set(&result.
options,
false);
1312 case ISEQ_FROZEN_STRING_LITERAL_ENABLED:
1313 pm_options_frozen_string_literal_set(&result.
options,
true);
1316 rb_bug(
"pm_iseq_compile_with_option: invalid frozen_string_literal=%d", option.frozen_string_literal);
1325 error = pm_load_parse_file(&result, filepath, ruby_vm_keep_script_lines ? &script_lines : NULL);
1330 error = pm_parse_string(&result, src, file, ruby_vm_keep_script_lines ? &script_lines : NULL);
1333 if (error ==
Qnil) {
1335 iseq = pm_iseq_new_with_opt(&result.
node, name, file, realpath, ln, NULL, 0, ISEQ_TYPE_TOP, &option, &error_state);
1337 pm_parse_result_free(&result);
1341 rb_jump_tag(error_state);
1345 pm_parse_result_free(&result);
1355 return pathobj_path(ISEQ_BODY(iseq)->location.pathobj);
1361 return pathobj_realpath(ISEQ_BODY(iseq)->location.pathobj);
1365rb_iseq_absolute_path(
const rb_iseq_t *iseq)
1367 return rb_iseq_realpath(iseq);
1371rb_iseq_from_eval_p(
const rb_iseq_t *iseq)
1373 return NIL_P(rb_iseq_realpath(iseq));
1379 return ISEQ_BODY(iseq)->location.label;
1383rb_iseq_base_label(
const rb_iseq_t *iseq)
1385 return ISEQ_BODY(iseq)->location.base_label;
1389rb_iseq_first_lineno(
const rb_iseq_t *iseq)
1391 return RB_INT2NUM(ISEQ_BODY(iseq)->location.first_lineno);
1395rb_iseq_method_name(
const rb_iseq_t *iseq)
1399 if (body->type == ISEQ_TYPE_METHOD) {
1400 return body->location.base_label;
1408rb_iseq_code_location(
const rb_iseq_t *iseq,
int *beg_pos_lineno,
int *beg_pos_column,
int *end_pos_lineno,
int *end_pos_column)
1411 if (beg_pos_lineno) *beg_pos_lineno = loc->beg_pos.lineno;
1412 if (beg_pos_column) *beg_pos_column = loc->beg_pos.column;
1413 if (end_pos_lineno) *end_pos_lineno = loc->end_pos.lineno;
1414 if (end_pos_column) *end_pos_column = loc->end_pos.column;
1417static ID iseq_type_id(
enum rb_iseq_type
type);
1422 return ID2SYM(iseq_type_id(ISEQ_BODY(iseq)->
type));
1428 return ISEQ_COVERAGE(iseq);
1432remove_coverage_i(
void *vstart,
void *vend,
size_t stride,
void *data)
1435 for (; v != (
VALUE)vend; v += stride) {
1436 void *ptr = rb_asan_poisoned_object_p(v);
1437 rb_asan_unpoison_object(v,
false);
1439 if (rb_obj_is_iseq(v)) {
1441 ISEQ_COVERAGE_SET(iseq,
Qnil);
1444 asan_poison_object_if(ptr, v);
1450rb_iseq_remove_coverage_all(
void)
1452 rb_objspace_each_objects(remove_coverage_i, NULL);
1458iseqw_mark(
void *ptr)
1460 rb_gc_mark_movable(*(
VALUE *)ptr);
1464iseqw_memsize(
const void *ptr)
1466 return rb_iseq_memsize(*(
const rb_iseq_t **)ptr);
1470iseqw_ref_update(
void *ptr)
1473 *vptr = rb_gc_location(*vptr);
1484 0, 0, RUBY_TYPED_FREE_IMMEDIATELY|RUBY_TYPED_WB_PROTECTED
1490 if (iseq->wrapper) {
1492 rb_raise(
rb_eTypeError,
"wrong iseq wrapper: %" PRIsVALUE
" for %p",
1493 iseq->wrapper, (
void *)iseq);
1495 return iseq->wrapper;
1513 return iseqw_new(iseq);
1522iseqw_s_compile_parser(
int argc,
VALUE *argv,
VALUE self,
bool prism)
1528 if (i > 4+
NIL_P(opt)) rb_error_arity(argc, 1, 5);
1530 case 5: opt = argv[--i];
1531 case 4: line = argv[--i];
1532 case 3: path = argv[--i];
1533 case 2: file = argv[--i];
1536 if (
NIL_P(file)) file = rb_fstring_lit(
"<compiled>");
1537 if (
NIL_P(path)) path = file;
1545 iseq = pm_iseq_compile_with_option(src, file, path, line, opt);
1548 iseq = rb_iseq_compile_with_option(src, file, path, line, opt);
1551 return iseqw_new(iseq);
1592iseqw_s_compile(
int argc,
VALUE *argv,
VALUE self)
1594 return iseqw_s_compile_parser(argc, argv, self, rb_ruby_prism_p());
1634iseqw_s_compile_parsey(
int argc,
VALUE *argv,
VALUE self)
1636 return iseqw_s_compile_parser(argc, argv, self,
false);
1676iseqw_s_compile_prism(
int argc,
VALUE *argv,
VALUE self)
1678 return iseqw_s_compile_parser(argc, argv, self,
true);
1702iseqw_s_compile_file(
int argc,
VALUE *argv,
VALUE self)
1711 i =
rb_scan_args(argc, argv,
"1*:", &file, NULL, &opt);
1712 if (i > 1+
NIL_P(opt)) rb_error_arity(argc, 1, 2);
1714 case 2: opt = argv[--i];
1717 file = rb_fstring(file);
1722 VALUE v = rb_vm_push_frame_fname(ec, file);
1724 parser = rb_parser_new();
1725 rb_parser_set_context(parser, NULL, FALSE);
1726 ast_value = rb_parser_load_file(parser, file);
1727 ast = rb_ruby_ast_data_get(ast_value);
1728 if (!ast->body.root) exc = GET_EC()->errinfo;
1731 if (!ast->body.root) {
1732 rb_ast_dispose(ast);
1736 make_compile_option(&option, opt);
1738 ret = iseqw_new(rb_iseq_new_with_opt(ast_value, rb_fstring_lit(
"<main>"),
1740 rb_realpath_internal(
Qnil, file, 1),
1741 1, NULL, 0, ISEQ_TYPE_TOP, &option,
1743 rb_ast_dispose(ast);
1745 rb_vm_pop_frame(ec);
1772iseqw_s_compile_file_prism(
int argc,
VALUE *argv,
VALUE self)
1778 i =
rb_scan_args(argc, argv,
"1*:", &file, NULL, &opt);
1779 if (i > 1+
NIL_P(opt)) rb_error_arity(argc, 1, 2);
1781 case 2: opt = argv[--i];
1784 file = rb_fstring(file);
1787 VALUE v = rb_vm_push_frame_fname(ec, file);
1791 result.
node.coverage_enabled = 1;
1794 VALUE error = pm_load_parse_file(&result, file, ruby_vm_keep_script_lines ? &script_lines : NULL);
1796 if (error ==
Qnil) {
1797 make_compile_option(&option, opt);
1800 rb_iseq_t *iseq = pm_iseq_new_with_opt(&result.
node, rb_fstring_lit(
"<main>"),
1802 rb_realpath_internal(
Qnil, file, 1),
1803 1, NULL, 0, ISEQ_TYPE_TOP, &option, &error_state);
1805 pm_parse_result_free(&result);
1809 rb_jump_tag(error_state);
1812 ret = iseqw_new(iseq);
1813 rb_vm_pop_frame(ec);
1817 pm_parse_result_free(&result);
1818 rb_vm_pop_frame(ec);
1855iseqw_s_compile_option_set(
VALUE self,
VALUE opt)
1858 make_compile_option(&option, opt);
1859 COMPILE_OPTION_DEFAULT = option;
1872iseqw_s_compile_option_get(
VALUE self)
1874 return make_compile_option_value(&COMPILE_OPTION_DEFAULT);
1878iseqw_check(
VALUE iseqw)
1884 if (!ISEQ_BODY(iseq)) {
1885 rb_ibf_load_iseq_complete(iseq);
1888 if (!ISEQ_BODY(iseq)->location.label) {
1889 rb_raise(
rb_eTypeError,
"uninitialized InstructionSequence");
1895rb_iseqw_to_iseq(
VALUE iseqw)
1897 return iseqw_check(iseqw);
1909iseqw_eval(
VALUE self)
1911 return rb_iseq_eval(iseqw_check(self));
1919iseqw_inspect(
VALUE self)
1921 const rb_iseq_t *iseq = iseqw_check(self);
1925 if (!body->location.label) {
1926 return rb_sprintf(
"#<%"PRIsVALUE
": uninitialized>", klass);
1929 return rb_sprintf(
"<%"PRIsVALUE
":%"PRIsVALUE
"@%"PRIsVALUE
":%d>",
1931 body->location.label, rb_iseq_path(iseq),
1932 FIX2INT(rb_iseq_first_lineno(iseq)));
1960iseqw_path(
VALUE self)
1962 return rb_iseq_path(iseqw_check(self));
1982iseqw_absolute_path(
VALUE self)
1984 return rb_iseq_realpath(iseqw_check(self));
2011iseqw_label(
VALUE self)
2013 return rb_iseq_label(iseqw_check(self));
2037iseqw_base_label(
VALUE self)
2039 return rb_iseq_base_label(iseqw_check(self));
2053iseqw_first_lineno(
VALUE self)
2055 return rb_iseq_first_lineno(iseqw_check(self));
2142iseqw_to_a(
VALUE self)
2144 const rb_iseq_t *iseq = iseqw_check(self);
2145 return iseq_data_to_ary(iseq);
2148#if VM_INSN_INFO_TABLE_IMPL == 1
2150get_insn_info_binary_search(
const rb_iseq_t *iseq,
size_t pos)
2153 size_t size = body->insns_info.size;
2155 const unsigned int *positions = body->insns_info.positions;
2156 const int debug = 0;
2159 printf(
"size: %"PRIuSIZE
"\n", size);
2160 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2161 (
size_t)0, positions[0], insns_info[0].line_no, pos);
2167 else if (size == 1) {
2168 return &insns_info[0];
2171 size_t l = 1, r = size - 1;
2173 size_t m = l + (r - l) / 2;
2174 if (positions[m] == pos) {
2175 return &insns_info[m];
2177 if (positions[m] < pos) {
2185 return &insns_info[size-1];
2187 if (positions[l] > pos) {
2188 return &insns_info[l-1];
2190 return &insns_info[l];
2195get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2197 return get_insn_info_binary_search(iseq, pos);
2201#if VM_INSN_INFO_TABLE_IMPL == 2
2203get_insn_info_succinct_bitvector(
const rb_iseq_t *iseq,
size_t pos)
2206 size_t size = body->insns_info.size;
2208 const int debug = 0;
2211#if VM_CHECK_MODE > 0
2212 const unsigned int *positions = body->insns_info.positions;
2213 printf(
"size: %"PRIuSIZE
"\n", size);
2214 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2215 (
size_t)0, positions[0], insns_info[0].line_no, pos);
2217 printf(
"size: %"PRIuSIZE
"\n", size);
2218 printf(
"insns_info[%"PRIuSIZE
"]: line: %d, pos: %"PRIuSIZE
"\n",
2219 (
size_t)0, insns_info[0].line_no, pos);
2226 else if (size == 1) {
2227 return &insns_info[0];
2231 VM_ASSERT(body->insns_info.succ_index_table != NULL);
2232 index = succ_index_lookup(body->insns_info.succ_index_table, (
int)pos);
2233 return &insns_info[index-1];
2238get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2240 return get_insn_info_succinct_bitvector(iseq, pos);
2244#if VM_CHECK_MODE > 0 || VM_INSN_INFO_TABLE_IMPL == 0
2246get_insn_info_linear_search(
const rb_iseq_t *iseq,
size_t pos)
2249 size_t i = 0, size = body->insns_info.size;
2251 const unsigned int *positions = body->insns_info.positions;
2252 const int debug = 0;
2255 printf(
"size: %"PRIuSIZE
"\n", size);
2256 printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2257 i, positions[i], insns_info[i].line_no, pos);
2263 else if (size == 1) {
2264 return &insns_info[0];
2267 for (i=1; i<size; i++) {
2268 if (debug) printf(
"insns_info[%"PRIuSIZE
"]: position: %d, line: %d, pos: %"PRIuSIZE
"\n",
2269 i, positions[i], insns_info[i].line_no, pos);
2271 if (positions[i] == pos) {
2272 return &insns_info[i];
2274 if (positions[i] > pos) {
2275 return &insns_info[i-1];
2279 return &insns_info[i-1];
2283#if VM_INSN_INFO_TABLE_IMPL == 0
2285get_insn_info(
const rb_iseq_t *iseq,
size_t pos)
2287 return get_insn_info_linear_search(iseq, pos);
2291#if VM_CHECK_MODE > 0 && VM_INSN_INFO_TABLE_IMPL > 0
2293validate_get_insn_info(
const rb_iseq_t *iseq)
2297 for (i = 0; i < body->iseq_size; i++) {
2298 if (get_insn_info_linear_search(iseq, i) != get_insn_info(iseq, i)) {
2299 rb_bug(
"validate_get_insn_info: get_insn_info_linear_search(iseq, %"PRIuSIZE
") != get_insn_info(iseq, %"PRIuSIZE
")", i, i);
2306rb_iseq_line_no(
const rb_iseq_t *iseq,
size_t pos)
2311 return entry->line_no;
2318#ifdef USE_ISEQ_NODE_ID
2320rb_iseq_node_id(
const rb_iseq_t *iseq,
size_t pos)
2325 return entry->node_id;
2334rb_iseq_event_flags(
const rb_iseq_t *iseq,
size_t pos)
2338 return entry->events;
2350 entry->events &= ~reset;
2351 if (!(entry->events & iseq->aux.exec.global_trace_events)) {
2352 void rb_iseq_trace_flag_cleared(
const rb_iseq_t *iseq,
size_t pos);
2353 rb_iseq_trace_flag_cleared(iseq, pos);
2366 for (i = 0; i < level; i++) {
2367 diseq = ISEQ_BODY(diseq)->parent_iseq;
2369 idx = ISEQ_BODY(diseq)->local_table_size - (int)op - 1;
2370 lid = ISEQ_BODY(diseq)->local_table[idx];
2371 name = rb_id2str(lid);
2381 rb_str_catf(name,
"@%d", idx);
2385int rb_insn_unified_local_var_level(
VALUE);
2389rb_insn_operand_intern(
const rb_iseq_t *iseq,
2393 const char *types = insn_op_types(insn);
2394 char type = types[op_no];
2399 ret = rb_sprintf(
"%"PRIdVALUE, (
VALUE)(pos +
len + op));
2403 if (insn == BIN(defined) && op_no == 0) {
2404 enum defined_type deftype = (
enum defined_type)op;
2407 ret = rb_fstring_lit(
"func");
2410 ret = rb_fstring_lit(
"ref");
2412 case DEFINED_CONST_FROM:
2413 ret = rb_fstring_lit(
"constant-from");
2416 ret = rb_iseq_defined_string(deftype);
2421 else if (insn == BIN(checktype) && op_no == 0) {
2427 ret = rb_sprintf(
"%"PRIuVALUE, op);
2432 if (types[op_no+1] == TS_NUM && pnop) {
2433 ret = local_var_name(iseq, *pnop, op - VM_ENV_DATA_SIZE);
2435 else if ((level = rb_insn_unified_local_var_level(insn)) >= 0) {
2436 ret = local_var_name(iseq, (
VALUE)level, op - VM_ENV_DATA_SIZE);
2448 op = obj_resurrect(op);
2449 if (insn == BIN(defined) && op_no == 1 &&
FIXNUM_P(op)) {
2454 ret = rb_sprintf(
":$%c", (
type >> 1));
2457 ret = rb_sprintf(
":$%d", (
type >> 1));
2462 ret = rb_dump_literal(op);
2465 rb_ary_push(child, op);
2474 ret = ISEQ_BODY(iseq)->location.label;
2476 rb_ary_push(child, (
VALUE)iseq);
2488 const ID *segments = ((
IC)op)->segments;
2491 rb_str_catf(ret,
"::%s", rb_id2name(*segments++));
2506 VALUE ary = rb_ary_new();
2507 ID mid = vm_ci_mid(ci);
2510 rb_ary_push(ary, rb_sprintf(
"mid:%"PRIsVALUE, rb_id2str(mid)));
2513 rb_ary_push(ary, rb_sprintf(
"argc:%d", vm_ci_argc(ci)));
2515 if (vm_ci_flag(ci) & VM_CALL_KWARG) {
2517 VALUE kw_ary = rb_ary_new_from_values(kw_args->keyword_len, kw_args->keywords);
2518 rb_ary_push(ary, rb_sprintf(
"kw:[%"PRIsVALUE
"]", rb_ary_join(kw_ary,
rb_str_new2(
","))));
2521 if (vm_ci_flag(ci)) {
2522 VALUE flags = rb_ary_new();
2523# define CALL_FLAG(n) if (vm_ci_flag(ci) & VM_CALL_##n) rb_ary_push(flags, rb_str_new2(#n))
2524 CALL_FLAG(ARGS_SPLAT);
2525 CALL_FLAG(ARGS_SPLAT_MUT);
2526 CALL_FLAG(ARGS_BLOCKARG);
2529 CALL_FLAG(ARGS_SIMPLE);
2530 CALL_FLAG(TAILCALL);
2534 CALL_FLAG(KW_SPLAT);
2535 CALL_FLAG(KW_SPLAT_MUT);
2536 CALL_FLAG(FORWARDING);
2537 CALL_FLAG(OPT_SEND);
2538 rb_ary_push(ary, rb_ary_join(flags,
rb_str_new2(
"|")));
2541 ret = rb_sprintf(
"<calldata!%"PRIsVALUE
">", rb_ary_join(ary,
rb_str_new2(
", ")));
2553 if (dladdr((
void *)op, &info) && info.dli_sname) {
2565 ret = rb_sprintf(
"<builtin!%s/%d>",
2566 bf->name, bf->argc);
2571 rb_bug(
"unknown operand type: %c",
type);
2577right_strip(
VALUE str)
2579 const char *beg = RSTRING_PTR(str), *end =
RSTRING_END(str);
2580 while (end-- > beg && *end ==
' ');
2590rb_iseq_disasm_insn(
VALUE ret,
const VALUE *code,
size_t pos,
2593 VALUE insn = code[pos];
2594 int len = insn_len(insn);
2596 const char *types = insn_op_types(insn);
2598 const char *insn_name_buff;
2600 insn_name_buff = insn_name(insn);
2602 extern const int rb_vm_max_insn_name_size;
2603 rb_str_catf(str,
"%04"PRIuSIZE
" %-*s ", pos, rb_vm_max_insn_name_size, insn_name_buff);
2606 rb_str_catf(str,
"%04"PRIuSIZE
" %-28.*s ", pos,
2607 (
int)strcspn(insn_name_buff,
"_"), insn_name_buff);
2610 for (j = 0; types[j]; j++) {
2611 VALUE opstr = rb_insn_operand_intern(iseq, insn, j, code[pos + j + 1],
2612 len, pos, &code[pos + j + 2],
2622 unsigned int line_no = rb_iseq_line_no(iseq, pos);
2623 unsigned int prev = pos == 0 ? 0 : rb_iseq_line_no(iseq, pos - 1);
2624 if (line_no && line_no != prev) {
2625 long slen = RSTRING_LEN(str);
2626 slen = (slen > 70) ? 0 : (70 - slen);
2627 str = rb_str_catf(str,
"%*s(%4d)", (
int)slen,
"", line_no);
2634 str = rb_str_catf(str,
"[%s%s%s%s%s%s%s%s%s%s%s%s]",
2645 events & RUBY_EVENT_COVERAGE_LINE ?
"Cli" :
"",
2646 events & RUBY_EVENT_COVERAGE_BRANCH ?
"Cbr" :
"");
2656 printf(
"%.*s\n", (
int)RSTRING_LEN(str), RSTRING_PTR(str));
2665 case CATCH_TYPE_RESCUE:
2667 case CATCH_TYPE_ENSURE:
2669 case CATCH_TYPE_RETRY:
2671 case CATCH_TYPE_BREAK:
2673 case CATCH_TYPE_REDO:
2675 case CATCH_TYPE_NEXT:
2678 rb_bug(
"unknown catch type: %d",
type);
2687 if (!body->location.label) {
2688 return rb_sprintf(
"#<ISeq: uninitialized>");
2692 return rb_sprintf(
"#<ISeq:%"PRIsVALUE
"@%"PRIsVALUE
":%d (%d,%d)-(%d,%d)>",
2693 body->location.label, rb_iseq_path(iseq),
2694 loc->beg_pos.lineno,
2695 loc->beg_pos.lineno,
2696 loc->beg_pos.column,
2697 loc->end_pos.lineno,
2698 loc->end_pos.column);
2704 {(void (*)(
void *))rb_mark_set, (void (*)(
void *))st_free_table, 0, 0,},
2705 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
2714 VALUE child = rb_ary_hidden_new(3);
2719 enum {header_minlen = 72};
2722 const char *indent_str;
2725 size = body->iseq_size;
2727 indent_len = RSTRING_LEN(indent);
2728 indent_str = RSTRING_PTR(indent);
2734 if ((l = RSTRING_LEN(str) - indent_len) < header_minlen) {
2738 if (iseq->body->builtin_attrs) {
2739#define disasm_builtin_attr(str, iseq, attr) \
2740 if (iseq->body->builtin_attrs & BUILTIN_ATTR_ ## attr) { \
2741 rb_str_cat2(str, " " #attr); \
2743 disasm_builtin_attr(str, iseq, LEAF);
2744 disasm_builtin_attr(str, iseq, SINGLE_NOARG_LEAF);
2745 disasm_builtin_attr(str, iseq, INLINE_BLOCK);
2746 disasm_builtin_attr(str, iseq, C_TRACE);
2751 if (body->catch_table) {
2755 if (body->catch_table) {
2757 indent_str = RSTRING_PTR(indent);
2758 for (i = 0; i < body->catch_table->size; i++) {
2760 UNALIGNED_MEMBER_PTR(body->catch_table, entries[i]);
2763 "| catch type: %-6s st: %04d ed: %04d sp: %04d cont: %04d\n",
2764 catch_type((
int)entry->type), (
int)entry->start,
2765 (
int)entry->end, (
int)entry->sp, (
int)entry->cont);
2766 if (entry->iseq && !(done_iseq && st_is_member(done_iseq, (st_data_t)entry->iseq))) {
2767 rb_str_concat(str, rb_iseq_disasm_recursive(rb_iseq_check(entry->iseq), indent));
2769 done_iseq = st_init_numtable();
2772 st_insert(done_iseq, (st_data_t)entry->iseq, (st_data_t)0);
2773 indent_str = RSTRING_PTR(indent);
2776 rb_str_resize(indent, indent_len);
2777 indent_str = RSTRING_PTR(indent);
2779 if (body->catch_table) {
2781 rb_str_cat2(str,
"|-------------------------------------"
2782 "-----------------------------------\n");
2786 if (body->local_table) {
2787 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
2790 "local table (size: %d, argc: %d "
2791 "[opts: %d, rest: %d, post: %d, block: %d, kw: %d@%d, kwrest: %d])\n",
2792 body->local_table_size,
2793 body->
param.lead_num,
2794 body->
param.opt_num,
2795 body->
param.flags.has_rest ? body->
param.rest_start : -1,
2796 body->param.post_num,
2797 body->param.flags.has_block ? body->param.block_start : -1,
2798 body->param.flags.has_kw ? keyword->num : -1,
2799 body->param.flags.has_kw ? keyword->required_num : -1,
2800 body->param.flags.has_kwrest ? keyword->rest_start : -1);
2802 for (i = body->local_table_size; i > 0;) {
2803 int li = body->local_table_size - --i - 1;
2805 VALUE name = local_var_name(iseq, 0, i);
2810 if (body->
param.flags.has_opt) {
2811 int argc = body->
param.lead_num;
2812 int opts = body->
param.opt_num;
2813 if (li >= argc && li < argc + opts) {
2814 snprintf(opti,
sizeof(opti),
"Opt=%"PRIdVALUE,
2815 body->
param.opt_table[li - argc]);
2819 snprintf(argi,
sizeof(argi),
"%s%s%s%s%s%s",
2820 (body->
param.lead_num > li) ? (body->
param.flags.ambiguous_param0 ?
"AmbiguousArg" :
"Arg") :
"",
2822 (body->param.flags.has_rest && body->param.rest_start == li) ? (body->param.flags.anon_rest ?
"AnonRest" :
"Rest") :
"",
2823 (body->param.flags.has_post && body->param.post_start <= li && li < body->param.post_start + body->param.post_num) ?
"Post" :
"",
2824 (body->param.flags.has_kwrest && keyword->rest_start == li) ? (body->param.flags.anon_kwrest ?
"AnonKwrest" :
"Kwrest") :
"",
2825 (body->param.flags.has_block && body->param.block_start == li) ?
"Block" :
"");
2828 rb_str_catf(str,
"[%2d] ", i + 1);
2829 width = RSTRING_LEN(str) + 11;
2831 if (*argi) rb_str_catf(str,
"<%s>", argi);
2832 if ((width -= RSTRING_LEN(str)) > 0) rb_str_catf(str,
"%*s", (
int)width,
"");
2838 code = rb_iseq_original_iseq(iseq);
2839 for (n = 0; n < size;) {
2841 n += rb_iseq_disasm_insn(str, code, n, iseq, child);
2845 VALUE isv = rb_ary_entry(child, l);
2846 if (done_iseq && st_is_member(done_iseq, (st_data_t)isv))
continue;
2849 indent_str = RSTRING_PTR(indent);
2860 rb_str_resize(str, RSTRING_LEN(str));
2870rb_estimate_iv_count(
VALUE klass,
const rb_iseq_t * initialize_iseq)
2872 struct rb_id_table * iv_names = rb_id_table_create(0);
2874 for (
unsigned int i = 0; i < ISEQ_BODY(initialize_iseq)->ivc_size; i++) {
2875 IVC cache = (
IVC)&ISEQ_BODY(initialize_iseq)->is_entries[i];
2877 if (cache->iv_set_name) {
2878 rb_id_table_insert(iv_names, cache->iv_set_name,
Qtrue);
2882 attr_index_t count = (attr_index_t)rb_id_table_size(iv_names);
2885 count += RCLASS_EXT(superclass)->max_iv_count;
2887 rb_id_table_free(iv_names);
2911iseqw_disasm(
VALUE self)
2913 return rb_iseq_disasm(iseqw_check(self));
2917iseq_iterate_children(
const rb_iseq_t *iseq,
void (*iter_func)(
const rb_iseq_t *child_iseq,
void *data),
void *data)
2920 VALUE *code = rb_iseq_original_iseq(iseq);
2925 if (body->catch_table) {
2926 for (i = 0; i < body->catch_table->size; i++) {
2928 UNALIGNED_MEMBER_PTR(body->catch_table, entries[i]);
2929 child = entry->iseq;
2931 if (
NIL_P(rb_hash_aref(all_children, (
VALUE)child))) {
2932 rb_hash_aset(all_children, (
VALUE)child,
Qtrue);
2933 (*iter_func)(child, data);
2939 for (i=0; i<body->iseq_size;) {
2940 VALUE insn = code[i];
2941 int len = insn_len(insn);
2942 const char *types = insn_op_types(insn);
2945 for (j=0; types[j]; j++) {
2950 if (
NIL_P(rb_hash_aref(all_children, (
VALUE)child))) {
2951 rb_hash_aset(all_children, (
VALUE)child,
Qtrue);
2952 (*iter_func)(child, data);
2967yield_each_children(
const rb_iseq_t *child_iseq,
void *data)
2981iseqw_each_child(
VALUE self)
2983 const rb_iseq_t *iseq = iseqw_check(self);
2984 iseq_iterate_children(iseq, yield_each_children, NULL);
2991#define C(ev, cstr, l) if (events & ev) rb_ary_push(ary, rb_ary_new_from_args(2, l, ID2SYM(rb_intern(cstr))));
3011iseqw_trace_points(
VALUE self)
3013 const rb_iseq_t *iseq = iseqw_check(self);
3016 VALUE ary = rb_ary_new();
3018 for (i=0; i<body->insns_info.size; i++) {
3020 if (entry->events) {
3021 push_event_info(iseq, entry->events, entry->line_no, ary);
3067 if (rb_frame_info_p(body)) {
3068 iseq = rb_get_iseq_from_frame_info(body);
3071 iseq = vm_proc_iseq(body);
3073 if (!rb_obj_is_iseq((
VALUE)iseq)) {
3078 iseq = rb_method_iseq(body);
3080 else if (rb_typeddata_is_instance_of(body, &iseqw_data_type)) {
3084 return iseq ? iseqw_new(iseq) :
Qnil;
3142 VALUE iseqw = iseqw_s_of(klass, body);
3143 return NIL_P(iseqw) ?
Qnil : rb_iseq_disasm(iseqw_check(iseqw));
3147register_label(
struct st_table *table,
unsigned long idx)
3150 st_insert(table, idx, sym);
3159 case CATCH_TYPE_RESCUE:
CONST_ID(
id,
"rescue");
break;
3160 case CATCH_TYPE_ENSURE:
CONST_ID(
id,
"ensure");
break;
3161 case CATCH_TYPE_RETRY:
CONST_ID(
id,
"retry");
break;
3162 case CATCH_TYPE_BREAK:
CONST_ID(
id,
"break");
break;
3163 case CATCH_TYPE_REDO:
CONST_ID(
id,
"redo");
break;
3164 case CATCH_TYPE_NEXT:
CONST_ID(
id,
"next");
break;
3166 rb_bug(
"unknown exception type: %d", (
int)
type);
3174 rb_ary_push(ary, obj_resurrect(key));
3175 rb_ary_push(ary, value);
3181 {(void (*)(
void *))rb_mark_tbl, (void (*)(
void *))st_free_table, 0, 0,},
3182 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
3185#define DECL_ID(name) \
3188#define INIT_ID(name) \
3189 id_##name = rb_intern(#name)
3192iseq_type_id(
enum rb_iseq_type
type)
3217 case ISEQ_TYPE_TOP:
return id_top;
3218 case ISEQ_TYPE_METHOD:
return id_method;
3219 case ISEQ_TYPE_BLOCK:
return id_block;
3220 case ISEQ_TYPE_CLASS:
return id_class;
3221 case ISEQ_TYPE_RESCUE:
return id_rescue;
3222 case ISEQ_TYPE_ENSURE:
return id_ensure;
3223 case ISEQ_TYPE_EVAL:
return id_eval;
3224 case ISEQ_TYPE_MAIN:
return id_main;
3225 case ISEQ_TYPE_PLAIN:
return id_plain;
3228 rb_bug(
"unsupported iseq type: %d", (
int)
type);
3240 VALUE *seq, *iseq_original;
3242 VALUE val = rb_ary_new();
3244 VALUE locals = rb_ary_new();
3245 VALUE params = rb_hash_new();
3246 VALUE body = rb_ary_new();
3248 VALUE exception = rb_ary_new();
3249 VALUE misc = rb_hash_new();
3251 static ID insn_syms[VM_INSTRUCTION_SIZE/2];
3252 struct st_table *labels_table = st_init_numtable();
3255 if (insn_syms[0] == 0) {
3257 for (i=0; i<numberof(insn_syms); i++) {
3258 insn_syms[i] = rb_intern(insn_name(i));
3263 type = iseq_type_id(iseq_body->type);
3266 for (i=0; i<iseq_body->local_table_size; i++) {
3267 ID lid = iseq_body->local_table[i];
3269 if (rb_id2str(lid)) {
3270 rb_ary_push(locals,
ID2SYM(lid));
3273 rb_ary_push(locals,
ULONG2NUM(iseq_body->local_table_size-i+1));
3277 rb_ary_push(locals,
ID2SYM(rb_intern(
"#arg_rest")));
3283 const struct rb_iseq_param_keyword *
const keyword = iseq_body->
param.keyword;
3286 if (iseq_body->
param.flags.has_opt) {
3287 int len = iseq_body->
param.opt_num + 1;
3290 for (j = 0; j <
len; j++) {
3291 VALUE l = register_label(labels_table, iseq_body->
param.opt_table[j]);
3292 rb_ary_push(arg_opt_labels, l);
3294 rb_hash_aset(params,
ID2SYM(rb_intern(
"opt")), arg_opt_labels);
3298 if (iseq_body->
param.flags.has_lead) rb_hash_aset(params,
ID2SYM(rb_intern(
"lead_num")),
INT2FIX(iseq_body->
param.lead_num));
3299 if (iseq_body->
param.flags.has_post) rb_hash_aset(params,
ID2SYM(rb_intern(
"post_num")),
INT2FIX(iseq_body->
param.post_num));
3300 if (iseq_body->
param.flags.has_post) rb_hash_aset(params,
ID2SYM(rb_intern(
"post_start")),
INT2FIX(iseq_body->
param.post_start));
3301 if (iseq_body->
param.flags.has_rest) rb_hash_aset(params,
ID2SYM(rb_intern(
"rest_start")),
INT2FIX(iseq_body->
param.rest_start));
3302 if (iseq_body->
param.flags.has_block) rb_hash_aset(params,
ID2SYM(rb_intern(
"block_start")),
INT2FIX(iseq_body->
param.block_start));
3303 if (iseq_body->
param.flags.has_kw) {
3304 VALUE keywords = rb_ary_new();
3306 for (i=0; i<keyword->required_num; i++) {
3307 rb_ary_push(keywords,
ID2SYM(keyword->table[i]));
3309 for (j=0; i<keyword->num; i++, j++) {
3310 VALUE key = rb_ary_new_from_args(1,
ID2SYM(keyword->table[i]));
3311 if (!UNDEF_P(keyword->default_values[j])) {
3312 rb_ary_push(key, keyword->default_values[j]);
3314 rb_ary_push(keywords, key);
3317 rb_hash_aset(params,
ID2SYM(rb_intern(
"kwbits")),
3318 INT2FIX(keyword->bits_start));
3319 rb_hash_aset(params,
ID2SYM(rb_intern(
"keyword")), keywords);
3321 if (iseq_body->
param.flags.has_kwrest) rb_hash_aset(params,
ID2SYM(rb_intern(
"kwrest")),
INT2FIX(keyword->rest_start));
3322 if (iseq_body->
param.flags.ambiguous_param0) rb_hash_aset(params,
ID2SYM(rb_intern(
"ambiguous_param0")),
Qtrue);
3323 if (iseq_body->
param.flags.use_block) rb_hash_aset(params,
ID2SYM(rb_intern(
"use_block")),
Qtrue);
3327 iseq_original = rb_iseq_original_iseq((
rb_iseq_t *)iseq);
3329 for (seq = iseq_original; seq < iseq_original + iseq_body->iseq_size; ) {
3330 VALUE insn = *seq++;
3331 int j,
len = insn_len(insn);
3335 rb_ary_push(ary,
ID2SYM(insn_syms[insn%numberof(insn_syms)]));
3336 for (j=0; j<
len-1; j++, seq++) {
3337 enum ruby_insn_type_chars op_type = insn_op_type(insn, j);
3341 unsigned long idx = nseq - iseq_original + *seq;
3342 rb_ary_push(ary, register_label(labels_table, idx));
3347 rb_ary_push(ary,
INT2FIX(*seq));
3350 rb_ary_push(ary, obj_resurrect(*seq));
3356 VALUE val = iseq_data_to_ary(rb_iseq_check(iseq));
3357 rb_ary_push(ary, val);
3360 rb_ary_push(ary,
Qnil);
3366 VALUE list = rb_ary_new();
3367 const ID *ids = ((
IC)*seq)->segments;
3369 rb_ary_push(list,
ID2SYM(*ids++));
3371 rb_ary_push(ary, list);
3379 rb_ary_push(ary,
INT2FIX(is - ISEQ_IS_ENTRY_START(ISEQ_BODY(iseq), op_type)));
3386 VALUE e = rb_hash_new();
3387 int argc = vm_ci_argc(ci);
3389 ID mid = vm_ci_mid(ci);
3391 rb_hash_aset(e,
ID2SYM(rb_intern(
"flag")),
UINT2NUM(vm_ci_flag(ci)));
3393 if (vm_ci_flag(ci) & VM_CALL_KWARG) {
3398 argc -= kwarg->keyword_len;
3399 for (i = 0; i < kwarg->keyword_len; i++) {
3400 rb_ary_push(kw, kwarg->keywords[i]);
3402 rb_hash_aset(e,
ID2SYM(rb_intern(
"kw_arg")), kw);
3405 rb_hash_aset(e,
ID2SYM(rb_intern(
"orig_argc")),
3407 rb_ary_push(ary, e);
3411 rb_ary_push(ary,
ID2SYM(*seq));
3416 VALUE val = rb_ary_new();
3423 unsigned long idx = nseq - iseq_original + pos;
3425 rb_ary_store(val, i+1,
3426 register_label(labels_table, idx));
3428 rb_ary_push(ary, val);
3433#if SIZEOF_VALUE <= SIZEOF_LONG
3438 rb_ary_push(ary, val);
3443 VALUE val = rb_hash_new();
3444#if SIZEOF_VALUE <= SIZEOF_LONG
3449 rb_hash_aset(val,
ID2SYM(rb_intern(
"func_ptr")), func_ptr);
3453 rb_ary_push(ary, val);
3457 rb_bug(
"unknown operand: %c", insn_op_type(insn, j));
3460 rb_ary_push(body, ary);
3466 if (iseq_body->catch_table)
for (i=0; i<iseq_body->catch_table->size; i++) {
3467 VALUE ary = rb_ary_new();
3469 UNALIGNED_MEMBER_PTR(iseq_body->catch_table, entries[i]);
3470 rb_ary_push(ary, exception_type2symbol(entry->type));
3472 rb_ary_push(ary, iseq_data_to_ary(rb_iseq_check(entry->iseq)));
3475 rb_ary_push(ary,
Qnil);
3477 rb_ary_push(ary, register_label(labels_table, entry->start));
3478 rb_ary_push(ary, register_label(labels_table, entry->end));
3479 rb_ary_push(ary, register_label(labels_table, entry->cont));
3480 rb_ary_push(ary,
UINT2NUM(entry->sp));
3481 rb_ary_push(exception, ary);
3485 body = rb_ary_new();
3486 prev_insn_info = NULL;
3487#ifdef USE_ISEQ_NODE_ID
3488 VALUE node_ids = rb_ary_new();
3496 if (st_lookup(labels_table, pos, &label)) {
3497 rb_ary_push(body, (
VALUE)label);
3500 info = get_insn_info(iseq, pos);
3501#ifdef USE_ISEQ_NODE_ID
3502 rb_ary_push(node_ids,
INT2FIX(info->node_id));
3505 if (prev_insn_info != info) {
3506 int line = info->line_no;
3509 if (line > 0 && last_line != line) {
3510 rb_ary_push(body,
INT2FIX(line));
3513#define CHECK_EVENT(ev) if (events & ev) rb_ary_push(body, ID2SYM(rb_intern(#ev)));
3523 prev_insn_info = info;
3526 rb_ary_push(body, ary);
3533 rb_hash_aset(misc,
ID2SYM(rb_intern(
"local_size")),
INT2FIX(iseq_body->local_table_size));
3534 rb_hash_aset(misc,
ID2SYM(rb_intern(
"stack_max")),
INT2FIX(iseq_body->stack_max));
3535 rb_hash_aset(misc,
ID2SYM(rb_intern(
"node_id")),
INT2FIX(iseq_body->location.node_id));
3536 rb_hash_aset(misc,
ID2SYM(rb_intern(
"code_location")),
3537 rb_ary_new_from_args(4,
3538 INT2FIX(iseq_body->location.code_location.beg_pos.lineno),
3539 INT2FIX(iseq_body->location.code_location.beg_pos.column),
3540 INT2FIX(iseq_body->location.code_location.end_pos.lineno),
3541 INT2FIX(iseq_body->location.code_location.end_pos.column)));
3542#ifdef USE_ISEQ_NODE_ID
3543 rb_hash_aset(misc,
ID2SYM(rb_intern(
"node_ids")), node_ids);
3545 rb_hash_aset(misc,
ID2SYM(rb_intern(
"parser")), iseq_body->prism ?
ID2SYM(rb_intern(
"prism")) :
ID2SYM(rb_intern(
"parse.y")));
3552 rb_ary_push(val,
rb_str_new2(
"YARVInstructionSequence/SimpleDataFormat"));
3553 rb_ary_push(val,
INT2FIX(ISEQ_MAJOR_VERSION));
3554 rb_ary_push(val,
INT2FIX(ISEQ_MINOR_VERSION));
3556 rb_ary_push(val, misc);
3557 rb_ary_push(val, iseq_body->location.label);
3558 rb_ary_push(val, rb_iseq_path(iseq));
3559 rb_ary_push(val, rb_iseq_realpath(iseq));
3560 rb_ary_push(val,
RB_INT2NUM(iseq_body->location.first_lineno));
3562 rb_ary_push(val, locals);
3563 rb_ary_push(val, params);
3564 rb_ary_push(val, exception);
3565 rb_ary_push(val, body);
3570rb_iseq_parameters(
const rb_iseq_t *iseq,
int is_proc)
3574 const struct rb_iseq_param_keyword *
const keyword = body->
param.keyword;
3576 ID req, opt, rest, block, key, keyrest;
3577#define PARAM_TYPE(type) rb_ary_push(a = rb_ary_new2(2), ID2SYM(type))
3578#define PARAM_ID(i) body->local_table[(i)]
3579#define PARAM(i, type) ( \
3581 rb_id2str(PARAM_ID(i)) ? \
3582 rb_ary_push(a, ID2SYM(PARAM_ID(i))) : \
3588 if (body->
param.flags.forwardable) {
3593 rb_ary_push(args, rb_ary_new_from_args(2,
ID2SYM(rest),
ID2SYM(idMULT)));
3594 rb_ary_push(args, rb_ary_new_from_args(2,
ID2SYM(keyrest),
ID2SYM(idPow)));
3595 rb_ary_push(args, rb_ary_new_from_args(2,
ID2SYM(block),
ID2SYM(idAnd)));
3599 for (i = 0; i < body->
param.lead_num; i++) {
3601 if (rb_id2str(PARAM_ID(i))) {
3602 rb_ary_push(a,
ID2SYM(PARAM_ID(i)));
3604 rb_ary_push(args, a);
3608 for (i = 0; i < body->
param.lead_num; i++) {
3609 rb_ary_push(args, PARAM(i, req));
3612 r = body->
param.lead_num + body->
param.opt_num;
3613 for (; i < r; i++) {
3615 if (rb_id2str(PARAM_ID(i))) {
3616 rb_ary_push(a,
ID2SYM(PARAM_ID(i)));
3618 rb_ary_push(args, a);
3620 if (body->
param.flags.has_rest) {
3622 rb_ary_push(args, PARAM(body->
param.rest_start, rest));
3624 r = body->
param.post_start + body->
param.post_num;
3626 for (i = body->
param.post_start; i < r; i++) {
3628 if (rb_id2str(PARAM_ID(i))) {
3629 rb_ary_push(a,
ID2SYM(PARAM_ID(i)));
3631 rb_ary_push(args, a);
3635 for (i = body->
param.post_start; i < r; i++) {
3636 rb_ary_push(args, PARAM(i, req));
3639 if (body->
param.flags.accepts_no_kwarg) {
3643 rb_ary_push(args, a);
3645 if (body->
param.flags.has_kw) {
3647 if (keyword->required_num > 0) {
3650 for (; i < keyword->required_num; i++) {
3652 if (rb_id2str(keyword->table[i])) {
3653 rb_ary_push(a,
ID2SYM(keyword->table[i]));
3655 rb_ary_push(args, a);
3659 for (; i < keyword->num; i++) {
3661 if (rb_id2str(keyword->table[i])) {
3662 rb_ary_push(a,
ID2SYM(keyword->table[i]));
3664 rb_ary_push(args, a);
3667 if (body->
param.flags.has_kwrest || body->
param.flags.ruby2_keywords) {
3670 PARAM_TYPE(keyrest);
3671 if (body->
param.flags.has_kwrest &&
3672 rb_id2str(param = PARAM_ID(keyword->rest_start))) {
3673 rb_ary_push(a,
ID2SYM(param));
3675 else if (body->
param.flags.ruby2_keywords) {
3676 rb_ary_push(a,
ID2SYM(idPow));
3678 rb_ary_push(args, a);
3680 if (body->
param.flags.has_block) {
3682 rb_ary_push(args, PARAM(body->
param.block_start, block));
3688rb_iseq_defined_string(
enum defined_type
type)
3690 static const char expr_names[][18] = {
3692 "instance-variable",
3708 if ((
unsigned)(
type - 1) >= (
unsigned)numberof(expr_names)) rb_bug(
"unknown defined type %d",
type);
3709 estr = expr_names[
type - 1];
3710 return rb_fstring_cstr(estr);
3720 void *notrace_encoded_insn;
3721 void *trace_encoded_insn;
3723static insn_data_t insn_data[VM_INSTRUCTION_SIZE/2];
3726rb_free_encoded_insn_data(
void)
3728 st_free_table(encoded_insn_data);
3732rb_vm_encoded_insn_data_table_init(
void)
3734#if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
3735 const void *
const *table = rb_vm_get_insns_address_table();
3736#define INSN_CODE(insn) ((VALUE)table[insn])
3738#define INSN_CODE(insn) (insn)
3741 encoded_insn_data = st_init_numtable_with_size(VM_INSTRUCTION_SIZE / 2);
3743 for (insn = 0; insn < VM_INSTRUCTION_SIZE/2; insn++) {
3744 st_data_t key1 = (st_data_t)INSN_CODE(insn);
3745 st_data_t key2 = (st_data_t)INSN_CODE(insn + VM_INSTRUCTION_SIZE/2);
3747 insn_data[insn].insn = (int)insn;
3748 insn_data[insn].insn_len = insn_len(insn);
3750 if (insn != BIN(opt_invokebuiltin_delegate_leave)) {
3751 insn_data[insn].notrace_encoded_insn = (
void *) key1;
3752 insn_data[insn].trace_encoded_insn = (
void *) key2;
3755 insn_data[insn].notrace_encoded_insn = (
void *) INSN_CODE(BIN(opt_invokebuiltin_delegate));
3756 insn_data[insn].trace_encoded_insn = (
void *) INSN_CODE(BIN(opt_invokebuiltin_delegate) + VM_INSTRUCTION_SIZE/2);
3759 st_add_direct(encoded_insn_data, key1, (st_data_t)&insn_data[insn]);
3760 st_add_direct(encoded_insn_data, key2, (st_data_t)&insn_data[insn]);
3765rb_vm_insn_addr2insn(
const void *addr)
3767 st_data_t key = (st_data_t)addr;
3770 if (st_lookup(encoded_insn_data, key, &val)) {
3772 return (
int)e->insn;
3775 rb_bug(
"rb_vm_insn_addr2insn: invalid insn address: %p", addr);
3780rb_vm_insn_addr2opcode(
const void *addr)
3782 st_data_t key = (st_data_t)addr;
3785 if (st_lookup(encoded_insn_data, key, &val)) {
3787 int opcode = e->insn;
3788 if (addr == e->trace_encoded_insn) {
3789 opcode += VM_INSTRUCTION_SIZE/2;
3794 rb_bug(
"rb_vm_insn_addr2opcode: invalid insn address: %p", addr);
3799rb_vm_insn_decode(
const VALUE encoded)
3801#if OPT_DIRECT_THREADED_CODE || OPT_CALL_THREADED_CODE
3802 int insn = rb_vm_insn_addr2insn((
void *)encoded);
3804 int insn = (int)encoded;
3810encoded_iseq_trace_instrument(
VALUE *iseq_encoded_insn,
rb_event_flag_t turnon,
bool remain_current_trace)
3812 st_data_t key = (st_data_t)*iseq_encoded_insn;
3815 if (st_lookup(encoded_insn_data, key, &val)) {
3817 if (remain_current_trace && key == (st_data_t)e->trace_encoded_insn) {
3820 *iseq_encoded_insn = (
VALUE) (turnon ? e->trace_encoded_insn : e->notrace_encoded_insn);
3824 rb_bug(
"trace_instrument: invalid insn address: %p", (
void *)*iseq_encoded_insn);
3828rb_iseq_trace_flag_cleared(
const rb_iseq_t *iseq,
size_t pos)
3831 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3832 encoded_iseq_trace_instrument(&iseq_encoded[pos], 0,
false);
3858 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3860 VM_ASSERT(ISEQ_EXECUTABLE_P(iseq));
3862 for (pc=0; pc<body->iseq_size;) {
3866 unsigned int line = (int)entry->line_no;
3868 if (target_line == 0 || target_line == line) {
3872 target_events &= ~RUBY_EVENT_LINE;
3875 if (pc_events & target_events) {
3878 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (target_events | iseq->aux.exec.global_trace_events),
true);
3882 if (iseq->aux.exec.local_hooks == NULL) {
3884 iseq->aux.exec.local_hooks->is_local =
true;
3886 rb_hook_list_connect_tracepoint((
VALUE)iseq, iseq->aux.exec.local_hooks, tpval, target_line);
3895 unsigned int target_line;
3900iseq_add_local_tracepoint_i(
const rb_iseq_t *iseq,
void *p)
3903 data->n += iseq_add_local_tracepoint(iseq, data->turnon_events, data->tpval, data->target_line);
3904 iseq_iterate_children(iseq, iseq_add_local_tracepoint_i, p);
3908rb_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)
3911 if (target_bmethod) {
3912 turnon_events = add_bmethod_events(turnon_events);
3914 data.turnon_events = turnon_events;
3916 data.target_line = target_line;
3919 iseq_add_local_tracepoint_i(iseq, (
void *)&data);
3920 if (0)
rb_funcall(
Qnil, rb_intern(
"puts"), 1, rb_iseq_disasm(iseq));
3929 if (iseq->aux.exec.local_hooks) {
3932 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3935 rb_hook_list_remove_tracepoint(iseq->aux.exec.local_hooks, tpval);
3936 local_events = iseq->aux.exec.local_hooks->events;
3938 if (local_events == 0) {
3939 rb_hook_list_free(iseq->aux.exec.local_hooks);
3940 ((
rb_iseq_t *)iseq)->aux.exec.local_hooks = NULL;
3943 local_events = add_bmethod_events(local_events);
3944 for (pc = 0; pc<body->iseq_size;) {
3946 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & (local_events | iseq->aux.exec.global_trace_events),
false);
3958iseq_remove_local_tracepoint_i(
const rb_iseq_t *iseq,
void *p)
3961 data->n += iseq_remove_local_tracepoint(iseq, data->tpval);
3962 iseq_iterate_children(iseq, iseq_remove_local_tracepoint_i, p);
3966rb_iseq_remove_local_tracepoint_recursively(
const rb_iseq_t *iseq,
VALUE tpval)
3972 iseq_remove_local_tracepoint_i(iseq, (
void *)&data);
3979 if (iseq->aux.exec.global_trace_events == turnon_events) {
3983 if (!ISEQ_EXECUTABLE_P(iseq)) {
3990 VALUE *iseq_encoded = (
VALUE *)body->iseq_encoded;
3992 rb_event_flag_t local_events = iseq->aux.exec.local_hooks ? iseq->aux.exec.local_hooks->events : 0;
3993 ((
rb_iseq_t *)iseq)->aux.exec.global_trace_events = turnon_events;
3994 enabled_events = add_bmethod_events(turnon_events | local_events);
3996 for (pc=0; pc<body->iseq_size;) {
3998 pc += encoded_iseq_trace_instrument(&iseq_encoded[pc], pc_events & enabled_events,
true);
4006clear_attr_cc(
VALUE v)
4008 if (imemo_type_p(v, imemo_callcache) && vm_cc_ivar_p((
const struct rb_callcache *)v)) {
4020 if (imemo_type_p(v, imemo_callcache) && vm_cc_bf_p((
const struct rb_callcache *)v)) {
4030clear_attr_ccs_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4033 for (; v != (
VALUE)vend; v += stride) {
4034 void *ptr = rb_asan_poisoned_object_p(v);
4035 rb_asan_unpoison_object(v,
false);
4037 asan_poison_object_if(ptr, v);
4043rb_clear_attr_ccs(
void)
4045 rb_objspace_each_objects(clear_attr_ccs_i, NULL);
4049clear_bf_ccs_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4052 for (; v != (
VALUE)vend; v += stride) {
4053 void *ptr = rb_asan_poisoned_object_p(v);
4054 rb_asan_unpoison_object(v,
false);
4056 asan_poison_object_if(ptr, v);
4062rb_clear_bf_ccs(
void)
4064 rb_objspace_each_objects(clear_bf_ccs_i, NULL);
4068trace_set_i(
void *vstart,
void *vend,
size_t stride,
void *data)
4073 for (; v != (
VALUE)vend; v += stride) {
4074 void *ptr = rb_asan_poisoned_object_p(v);
4075 rb_asan_unpoison_object(v,
false);
4077 if (rb_obj_is_iseq(v)) {
4078 rb_iseq_trace_set(rb_iseq_check((
rb_iseq_t *)v), turnon_events);
4080 else if (clear_attr_cc(v)) {
4082 else if (clear_bf_cc(v)) {
4085 asan_poison_object_if(ptr, v);
4093 rb_objspace_each_objects(trace_set_i, &turnon_events);
4097rb_iseqw_local_variables(
VALUE iseqval)
4099 return rb_iseq_local_variables(iseqw_check(iseqval));
4120iseqw_to_binary(
int argc,
VALUE *argv,
VALUE self)
4123 return rb_iseq_ibf_dump(iseqw_check(self), opt);
4140iseqw_s_load_from_binary(
VALUE self,
VALUE str)
4142 return iseqw_new(rb_iseq_ibf_load(str));
4152iseqw_s_load_from_binary_extra_data(
VALUE self,
VALUE str)
4154 return rb_iseq_ibf_load_extra_data(str);
4157#if VM_INSN_INFO_TABLE_IMPL == 2
4190#define IMMEDIATE_TABLE_SIZE 54
4192struct succ_index_table {
4193 uint64_t imm_part[IMMEDIATE_TABLE_SIZE / 9];
4194 struct succ_dict_block {
4196 uint64_t small_block_ranks;
4197 uint64_t bits[512/64];
4198 } succ_part[FLEX_ARY_LEN];
4201#define imm_block_rank_set(v, i, r) (v) |= (uint64_t)(r) << (7 * (i))
4202#define imm_block_rank_get(v, i) (((int)((v) >> ((i) * 7))) & 0x7f)
4203#define small_block_rank_set(v, i, r) (v) |= (uint64_t)(r) << (9 * ((i) - 1))
4204#define small_block_rank_get(v, i) ((i) == 0 ? 0 : (((int)((v) >> (((i) - 1) * 9))) & 0x1ff))
4206static struct succ_index_table *
4207succ_index_table_create(
int max_pos,
int *data,
int size)
4209 const int imm_size = (max_pos < IMMEDIATE_TABLE_SIZE ? max_pos + 8 : IMMEDIATE_TABLE_SIZE) / 9;
4210 const int succ_size = (max_pos < IMMEDIATE_TABLE_SIZE ? 0 : (max_pos - IMMEDIATE_TABLE_SIZE + 511)) / 512;
4211 struct succ_index_table *sd =
4212 rb_xcalloc_mul_add_mul(
4213 imm_size,
sizeof(uint64_t),
4214 succ_size,
sizeof(
struct succ_dict_block));
4218 for (j = 0; j < imm_size; j++) {
4219 for (i = 0; i < 9; i++) {
4220 if (r < size && data[r] == j * 9 + i) r++;
4221 imm_block_rank_set(sd->imm_part[j], i, r);
4224 for (k = 0; k < succ_size; k++) {
4225 struct succ_dict_block *sd_block = &sd->succ_part[k];
4228 for (j = 0; j < 8; j++) {
4230 if (j) small_block_rank_set(sd_block->small_block_ranks, j, small_rank);
4231 for (i = 0; i < 64; i++) {
4232 if (r < size && data[r] == k * 512 + j * 64 + i + IMMEDIATE_TABLE_SIZE) {
4233 bits |= ((uint64_t)1) << i;
4237 sd_block->bits[j] = bits;
4238 small_rank += rb_popcount64(bits);
4244static unsigned int *
4245succ_index_table_invert(
int max_pos,
struct succ_index_table *sd,
int size)
4247 const int imm_size = (max_pos < IMMEDIATE_TABLE_SIZE ? max_pos + 8 : IMMEDIATE_TABLE_SIZE) / 9;
4248 const int succ_size = (max_pos < IMMEDIATE_TABLE_SIZE ? 0 : (max_pos - IMMEDIATE_TABLE_SIZE + 511)) / 512;
4249 unsigned int *positions =
ALLOC_N(
unsigned int, size), *p;
4250 int i, j, k, r = -1;
4252 for (j = 0; j < imm_size; j++) {
4253 for (i = 0; i < 9; i++) {
4254 int nr = imm_block_rank_get(sd->imm_part[j], i);
4255 if (r != nr) *p++ = j * 9 + i;
4259 for (k = 0; k < succ_size; k++) {
4260 for (j = 0; j < 8; j++) {
4261 for (i = 0; i < 64; i++) {
4262 if (sd->succ_part[k].bits[j] & (((uint64_t)1) << i)) {
4263 *p++ = k * 512 + j * 64 + i + IMMEDIATE_TABLE_SIZE;
4272succ_index_lookup(
const struct succ_index_table *sd,
int x)
4274 if (x < IMMEDIATE_TABLE_SIZE) {
4275 const int i = x / 9;
4276 const int j = x % 9;
4277 return imm_block_rank_get(sd->imm_part[i], j);
4280 const int block_index = (x - IMMEDIATE_TABLE_SIZE) / 512;
4281 const struct succ_dict_block *block = &sd->succ_part[block_index];
4282 const int block_bit_index = (x - IMMEDIATE_TABLE_SIZE) % 512;
4283 const int small_block_index = block_bit_index / 64;
4284 const int small_block_popcount = small_block_rank_get(block->small_block_ranks, small_block_index);
4285 const int popcnt = rb_popcount64(block->bits[small_block_index] << (63 - block_bit_index % 64));
4287 return block->rank + small_block_popcount + popcnt;
4306iseqw_script_lines(
VALUE self)
4308 const rb_iseq_t *iseq = iseqw_check(self);
4309 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.
#define RB_OBJ_FREEZE
Just another name of rb_obj_freeze_inline.
VALUE rb_define_class_under(VALUE outer, const char *name, VALUE super)
Defines a class under the namespace of outer.
void rb_undef_method(VALUE klass, const char *name)
Defines an undef of a method.
int rb_scan_args(int argc, const VALUE *argv, const char *fmt,...)
Retrieves argument from argc and argv to given VALUE references according to the format string.
#define rb_str_new2
Old name of rb_str_new_cstr.
#define T_FILE
Old name of RUBY_T_FILE.
#define T_STRING
Old name of RUBY_T_STRING.
#define Qundef
Old name of RUBY_Qundef.
#define INT2FIX
Old name of RB_INT2FIX.
#define rb_str_cat2
Old name of rb_str_cat_cstr.
#define ID2SYM
Old name of RB_ID2SYM.
#define SPECIAL_CONST_P
Old name of RB_SPECIAL_CONST_P.
#define ULONG2NUM
Old name of RB_ULONG2NUM.
#define 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.
static int rb_check_arity(int argc, int min, int max)
Ensures that the passed integer is in the passed range.
VALUE rb_file_open_str(VALUE fname, const char *fmode)
Identical to rb_file_open(), except it takes the pathname as a Ruby's string instead of C's.
VALUE rb_io_close(VALUE io)
Closes the IO.
int rb_is_local_id(ID id)
Classifies the given ID, then sees if it is a local variable.
VALUE rb_obj_is_method(VALUE recv)
Queries if the given object is a method.
VALUE rb_obj_is_proc(VALUE recv)
Queries if the given object is a proc.
VALUE rb_str_append(VALUE dst, VALUE src)
Identical to rb_str_buf_append(), except it converts the right hand side before concatenating.
#define rb_str_new(str, len)
Allocates an instance of rb_cString.
#define rb_exc_new_cstr(exc, str)
Identical to rb_exc_new(), except it assumes the passed pointer is a pointer to a C string.
VALUE rb_str_dup(VALUE str)
Duplicates a string.
VALUE rb_str_cat(VALUE dst, const char *src, long srclen)
Destructively appends the passed contents to the string.
VALUE rb_str_resurrect(VALUE str)
I guess there is no use case of this function in extension libraries, but this is a routine identical...
void rb_str_set_len(VALUE str, long len)
Overwrites the length of the string.
VALUE rb_str_inspect(VALUE str)
Generates a "readable" version of the receiver.
int rb_str_cmp(VALUE lhs, VALUE rhs)
Compares two strings, as in strcmp(3).
VALUE rb_str_concat(VALUE dst, VALUE src)
Identical to rb_str_append(), except it also accepts an integer as a codepoint.
#define rb_str_cat_cstr(buf, str)
Identical to rb_str_cat(), except it assumes the passed pointer is a pointer to a C string.
void rb_str_modify_expand(VALUE str, long capa)
Identical to rb_str_modify(), except it additionally expands the capacity of the receiver.
#define rb_str_new_cstr(str)
Identical to rb_str_new, except it assumes the passed pointer is a pointer to a C string.
VALUE rb_str_intern(VALUE str)
Identical to rb_to_symbol(), except it assumes the receiver being an instance of RString.
VALUE rb_class_name(VALUE obj)
Queries the name of the given object's class.
int rb_respond_to(VALUE obj, ID mid)
Queries if the object responds to the method.
void rb_undef_alloc_func(VALUE klass)
Deletes the allocator function of a class.
VALUE rb_check_funcall(VALUE recv, ID mid, int argc, const VALUE *argv)
Identical to rb_funcallv(), except it returns RUBY_Qundef instead of raising rb_eNoMethodError.
ID rb_check_id(volatile VALUE *namep)
Detects if the given name is already interned or not.
VALUE rb_sym2str(VALUE symbol)
Obtain a frozen string representation of a symbol (not including the leading colon).
VALUE rb_io_path(VALUE io)
Returns the path for the given IO.
int len
Length of the buffer.
VALUE rb_ractor_make_shareable(VALUE obj)
Destructively transforms the passed object so that multiple Ractors can share it.
#define RB_NUM2INT
Just another name of rb_num2int_inline.
#define RB_INT2NUM
Just another name of rb_int2num_inline.
VALUE rb_yield(VALUE val)
Yields the block.
#define RB_GC_GUARD(v)
Prevents premature destruction of local objects.
#define RB_ZALLOC(type)
Shorthand of RB_ZALLOC_N with n=1.
VALUE type(ANYARGS)
ANYARGS-ed function type.
void rb_hash_foreach(VALUE q, int_type *w, VALUE e)
Iteration over the given hash.
#define RARRAY_LEN
Just another name of rb_array_len.
static int RARRAY_LENINT(VALUE ary)
Identical to rb_array_len(), except it differs for the return type.
#define RARRAY_AREF(a, i)
static VALUE RBASIC_CLASS(VALUE obj)
Queries the class of an object.
#define RHASH_SIZE(h)
Queries the size of the hash.
#define StringValue(v)
Ensures that the parameter object is a String.
static char * RSTRING_END(VALUE str)
Queries the end of the contents pointer of the string.
#define StringValueCStr(v)
Identical to StringValuePtr, except it additionally checks for the contents for viability as a C stri...
#define RUBY_TYPED_DEFAULT_FREE
This is a value you can set to rb_data_type_struct::dfree.
#define TypedData_Get_Struct(obj, type, data_type, sval)
Obtains a C struct from inside of a wrapper Ruby object.
#define TypedData_Wrap_Struct(klass, data_type, sval)
Converts sval, a pointer to your struct, into a Ruby object.
#define TypedData_Make_Struct(klass, type, data_type, sval)
Identical to TypedData_Wrap_Struct, except it allocates a new data region internally instead of takin...
#define FilePathValue(v)
Ensures that the parameter object is a path.
#define RTEST
This is an old name of RB_TEST.
const ID * segments
A null-terminated list of ids, used to represent a constant's path idNULL is used to represent the ::...
A line and column in a string.
uint32_t column
The column number.
int32_t line
The line number.
This represents a range of bytes in the source string to which a node or token corresponds.
const uint8_t * start
A pointer to the start location of the range in the source.
const uint8_t * end
A pointer to the end location of the range in the source.
size_t size
The number of offsets in the list.
uint32_t node_id
The unique identifier for this node, which is deterministic based on the source.
pm_location_t location
This is the location of the node in the source.
int32_t line
The line within the file that the parse starts on.
pm_scope_node_t node
The resulting scope node that will hold the generated AST.
pm_options_t options
The options that will be passed to the parser.
int32_t start_line
The line number at the start of the parse.
pm_newline_list_t newline_list
This is the list of newline offsets in the source file.
VALUE * script_lines
This is a pointer to the list of script lines for the ISEQs that will be associated with this scope n...
This is the struct that holds necessary info for a struct.
struct rb_iseq_constant_body::@154 param
parameter information
intptr_t SIGNED_VALUE
A signed integer type that has the same width with VALUE.
uintptr_t ID
Type that represents a Ruby identifier such as a variable name.
uintptr_t VALUE
Type that represents a Ruby object.
static void Check_Type(VALUE v, enum ruby_value_type t)
Identical to RB_TYPE_P(), except it raises exceptions on predication failure.
static bool RB_TYPE_P(VALUE obj, enum ruby_value_type t)
Queries if the given object is of given type.
ruby_value_type
C-level type of an object.