Ruby 3.5.0dev (2025-11-03 revision 4a3d8346a6d0e068508631541f6bc43e8b154ea1)
vm.c (4a3d8346a6d0e068508631541f6bc43e8b154ea1)
1/**********************************************************************
2
3 Vm.c -
4
5 $Author$
6
7 Copyright (C) 2004-2007 Koichi Sasada
8
9**********************************************************************/
10
11#define vm_exec rb_vm_exec
12
13#include "eval_intern.h"
14#include "internal.h"
15#include "internal/class.h"
16#include "internal/compile.h"
17#include "internal/cont.h"
18#include "internal/error.h"
19#include "internal/encoding.h"
20#include "internal/eval.h"
21#include "internal/gc.h"
22#include "internal/inits.h"
23#include "internal/missing.h"
24#include "internal/namespace.h"
25#include "internal/object.h"
26#include "internal/proc.h"
27#include "internal/re.h"
28#include "internal/ruby_parser.h"
29#include "internal/symbol.h"
30#include "internal/thread.h"
31#include "internal/transcode.h"
32#include "internal/vm.h"
33#include "internal/sanitizers.h"
34#include "internal/variable.h"
35#include "iseq.h"
36#include "symbol.h" // This includes a macro for a more performant rb_id2sym.
37#include "yjit.h"
38#include "insns.inc"
39#include "zjit.h"
40#include "ruby/st.h"
41#include "ruby/vm.h"
42#include "vm_core.h"
43#include "vm_callinfo.h"
44#include "vm_debug.h"
45#include "vm_exec.h"
46#include "vm_insnhelper.h"
47#include "ractor_core.h"
48#include "vm_sync.h"
49#include "shape.h"
50
51#include "builtin.h"
52
53#include "probes.h"
54#include "probes_helper.h"
55
56#ifdef RUBY_ASSERT_CRITICAL_SECTION
57int ruby_assert_critical_section_entered = 0;
58#endif
59
60static void *native_main_thread_stack_top;
61
62bool ruby_vm_during_cleanup = false;
63
64VALUE rb_str_concat_literals(size_t, const VALUE*);
65
67
68extern const char *const rb_debug_counter_names[];
69
70PUREFUNC(static inline const VALUE *VM_EP_LEP(const VALUE *));
71static inline const VALUE *
72VM_EP_LEP(const VALUE *ep)
73{
74 while (!VM_ENV_LOCAL_P(ep)) {
75 ep = VM_ENV_PREV_EP(ep);
76 }
77 return ep;
78}
79
80static inline const rb_control_frame_t *
81rb_vm_search_cf_from_ep(const rb_execution_context_t *ec, const rb_control_frame_t *cfp, const VALUE * const ep)
82{
83 if (!ep) {
84 return NULL;
85 }
86 else {
87 const rb_control_frame_t * const eocfp = RUBY_VM_END_CONTROL_FRAME(ec); /* end of control frame pointer */
88
89 while (cfp < eocfp) {
90 if (cfp->ep == ep) {
91 return cfp;
92 }
93 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
94 }
95
96 return NULL;
97 }
98}
99
100#if VM_CHECK_MODE > 0
101// ruby_namespace_crashed defined in internal/namespace.h
102#define VM_NAMESPACE_CRASHED() {ruby_namespace_crashed = true;}
103#define VM_NAMESPACE_ASSERT(expr, msg) \
104 if (!(expr)) { ruby_namespace_crashed = true; rb_bug(msg); }
105#else
106#define VM_NAMESPACE_CRASHED() {}
107#define VM_NAMESPACE_ASSERT(expr, msg) ((void)0)
108#endif
109
110static const VALUE *
111VM_EP_RUBY_LEP(const rb_execution_context_t *ec, const rb_control_frame_t *current_cfp)
112{
113 // rb_vmdebug_namespace_env_dump_raw() simulates this function
114 const VALUE *ep = current_cfp->ep;
115 const rb_control_frame_t * const eocfp = RUBY_VM_END_CONTROL_FRAME(ec); /* end of control frame pointer */
116 const rb_control_frame_t *cfp = current_cfp;
117
118 if (VM_ENV_FRAME_TYPE_P(ep, VM_FRAME_MAGIC_IFUNC)) {
119 ep = VM_EP_LEP(current_cfp->ep);
148 VM_ASSERT(VM_ENV_FRAME_TYPE_P(ep, VM_FRAME_MAGIC_CFUNC));
149 return ep;
150 }
151
152 while (VM_ENV_FRAME_TYPE_P(ep, VM_FRAME_MAGIC_CFUNC)) {
153 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
154
155 VM_NAMESPACE_ASSERT(cfp, "CFUNC should have a valid previous control frame");
156 VM_NAMESPACE_ASSERT(cfp < eocfp, "CFUNC should have a valid caller frame");
157 if (!cfp || cfp >= eocfp) {
158 return NULL;
159 }
160
161 VM_NAMESPACE_ASSERT(cfp->ep, "CFUNC should have a valid caller frame with env");
162 ep = cfp->ep;
163 if (!ep) {
164 return NULL;
165 }
166 }
167
168 while (!VM_ENV_LOCAL_P(ep)) {
169 ep = VM_ENV_PREV_EP(ep);
170 }
171
172 return ep;
173}
174
175const VALUE *
176rb_vm_ep_local_ep(const VALUE *ep)
177{
178 return VM_EP_LEP(ep);
179}
180
181PUREFUNC(static inline const VALUE *VM_CF_LEP(const rb_control_frame_t * const cfp));
182static inline const VALUE *
183VM_CF_LEP(const rb_control_frame_t * const cfp)
184{
185 return VM_EP_LEP(cfp->ep);
186}
187
188static inline const VALUE *
189VM_CF_PREV_EP(const rb_control_frame_t * const cfp)
190{
191 return VM_ENV_PREV_EP(cfp->ep);
192}
193
194PUREFUNC(static inline VALUE VM_CF_BLOCK_HANDLER(const rb_control_frame_t * const cfp));
195static inline VALUE
196VM_CF_BLOCK_HANDLER(const rb_control_frame_t * const cfp)
197{
198 const VALUE *ep;
199 if (VM_ENV_NAMESPACED_P(cfp->ep)) {
200 VM_ASSERT(VM_ENV_LOCAL_P(cfp->ep));
201 /* Never set black_handler for VM_FRAME_MAGIC_TOP or VM_FRAME_MAGIC_CLASS
202 * and the specval is used for namespace (rb_namespace_t) in these case
203 */
204 return VM_BLOCK_HANDLER_NONE;
205 }
206 ep = VM_CF_LEP(cfp);
207 return VM_ENV_BLOCK_HANDLER(ep);
208}
209
210int
211rb_vm_cframe_keyword_p(const rb_control_frame_t *cfp)
212{
213 return VM_FRAME_CFRAME_KW_P(cfp);
214}
215
216VALUE
217rb_vm_frame_block_handler(const rb_control_frame_t *cfp)
218{
219 return VM_CF_BLOCK_HANDLER(cfp);
220}
221
222#if VM_CHECK_MODE > 0
223static int
224VM_CFP_IN_HEAP_P(const rb_execution_context_t *ec, const rb_control_frame_t *cfp)
225{
226 const VALUE *start = ec->vm_stack;
227 const VALUE *end = (VALUE *)ec->vm_stack + ec->vm_stack_size;
228 VM_ASSERT(start != NULL);
229
230 if (start <= (VALUE *)cfp && (VALUE *)cfp < end) {
231 return FALSE;
232 }
233 else {
234 return TRUE;
235 }
236}
237
238static int
239VM_EP_IN_HEAP_P(const rb_execution_context_t *ec, const VALUE *ep)
240{
241 const VALUE *start = ec->vm_stack;
242 const VALUE *end = (VALUE *)ec->cfp;
243 VM_ASSERT(start != NULL);
244
245 if (start <= ep && ep < end) {
246 return FALSE;
247 }
248 else {
249 return TRUE;
250 }
251}
252
253static int
254vm_ep_in_heap_p_(const rb_execution_context_t *ec, const VALUE *ep)
255{
256 if (VM_EP_IN_HEAP_P(ec, ep)) {
257 VALUE envval = ep[VM_ENV_DATA_INDEX_ENV]; /* VM_ENV_ENVVAL(ep); */
258
259 if (!UNDEF_P(envval)) {
260 const rb_env_t *env = (const rb_env_t *)envval;
261
262 VM_ASSERT(imemo_type_p(envval, imemo_env));
263 VM_ASSERT(VM_ENV_FLAGS(ep, VM_ENV_FLAG_ESCAPED));
264 VM_ASSERT(env->ep == ep);
265 }
266 return TRUE;
267 }
268 else {
269 return FALSE;
270 }
271}
272
273int
274rb_vm_ep_in_heap_p(const VALUE *ep)
275{
276 const rb_execution_context_t *ec = GET_EC();
277 if (ec->vm_stack == NULL) return TRUE;
278 return vm_ep_in_heap_p_(ec, ep);
279}
280#endif
281
282static struct rb_captured_block *
283VM_CFP_TO_CAPTURED_BLOCK(const rb_control_frame_t *cfp)
284{
285 VM_ASSERT(!VM_CFP_IN_HEAP_P(GET_EC(), cfp));
286 return (struct rb_captured_block *)&cfp->self;
287}
288
289static rb_control_frame_t *
290VM_CAPTURED_BLOCK_TO_CFP(const struct rb_captured_block *captured)
291{
292 rb_control_frame_t *cfp = ((rb_control_frame_t *)((VALUE *)(captured) - 3));
293 VM_ASSERT(!VM_CFP_IN_HEAP_P(GET_EC(), cfp));
294 VM_ASSERT(sizeof(rb_control_frame_t)/sizeof(VALUE) == 7 + VM_DEBUG_BP_CHECK ? 1 : 0);
295 return cfp;
296}
297
298static int
299VM_BH_FROM_CFP_P(VALUE block_handler, const rb_control_frame_t *cfp)
300{
301 const struct rb_captured_block *captured = VM_CFP_TO_CAPTURED_BLOCK(cfp);
302 return VM_TAGGED_PTR_REF(block_handler, 0x03) == captured;
303}
304
305static VALUE
306vm_passed_block_handler(rb_execution_context_t *ec)
307{
308 VALUE block_handler = ec->passed_block_handler;
309 ec->passed_block_handler = VM_BLOCK_HANDLER_NONE;
310 vm_block_handler_verify(block_handler);
311 return block_handler;
312}
313
314static rb_cref_t *
315vm_cref_new0(VALUE klass, rb_method_visibility_t visi, int module_func, rb_cref_t *prev_cref, int pushed_by_eval, int use_prev_prev, int singleton)
316{
317 VALUE refinements = Qnil;
318 int omod_shared = FALSE;
319
320 /* scope */
321 rb_scope_visibility_t scope_visi;
322 scope_visi.method_visi = visi;
323 scope_visi.module_func = module_func;
324
325 /* refinements */
326 if (prev_cref != NULL && prev_cref != (void *)1 /* TODO: why CREF_NEXT(cref) is 1? */) {
327 refinements = CREF_REFINEMENTS(prev_cref);
328
329 if (!NIL_P(refinements)) {
330 omod_shared = TRUE;
331 CREF_OMOD_SHARED_SET(prev_cref);
332 }
333 }
334
335 VM_ASSERT(singleton || klass);
336
337 rb_cref_t *cref = SHAREABLE_IMEMO_NEW(rb_cref_t, imemo_cref, refinements);
338 cref->klass_or_self = klass;
339 cref->next = use_prev_prev ? CREF_NEXT(prev_cref) : prev_cref;
340 *((rb_scope_visibility_t *)&cref->scope_visi) = scope_visi;
341
342 if (pushed_by_eval) CREF_PUSHED_BY_EVAL_SET(cref);
343 if (omod_shared) CREF_OMOD_SHARED_SET(cref);
344 if (singleton) CREF_SINGLETON_SET(cref);
345
346 return cref;
347}
348
349static rb_cref_t *
350vm_cref_new(VALUE klass, rb_method_visibility_t visi, int module_func, rb_cref_t *prev_cref, int pushed_by_eval, int singleton)
351{
352 return vm_cref_new0(klass, visi, module_func, prev_cref, pushed_by_eval, FALSE, singleton);
353}
354
355static rb_cref_t *
356vm_cref_new_use_prev(VALUE klass, rb_method_visibility_t visi, int module_func, rb_cref_t *prev_cref, int pushed_by_eval)
357{
358 return vm_cref_new0(klass, visi, module_func, prev_cref, pushed_by_eval, TRUE, FALSE);
359}
360
361static int
362ref_delete_symkey(VALUE key, VALUE value, VALUE unused)
363{
364 return SYMBOL_P(key) ? ST_DELETE : ST_CONTINUE;
365}
366
367static rb_cref_t *
368vm_cref_dup(const rb_cref_t *cref)
369{
370 const rb_scope_visibility_t *visi = CREF_SCOPE_VISI(cref);
371 rb_cref_t *next_cref = CREF_NEXT(cref), *new_cref;
372 int pushed_by_eval = CREF_PUSHED_BY_EVAL(cref);
373 int singleton = CREF_SINGLETON(cref);
374
375 new_cref = vm_cref_new(cref->klass_or_self, visi->method_visi, visi->module_func, next_cref, pushed_by_eval, singleton);
376
377 if (!NIL_P(CREF_REFINEMENTS(cref))) {
378 VALUE ref = rb_hash_dup(CREF_REFINEMENTS(cref));
379 rb_hash_foreach(ref, ref_delete_symkey, Qnil);
380 CREF_REFINEMENTS_SET(new_cref, ref);
381 CREF_OMOD_SHARED_UNSET(new_cref);
382 }
383
384 return new_cref;
385}
386
387
388rb_cref_t *
389rb_vm_cref_dup_without_refinements(const rb_cref_t *cref)
390{
391 const rb_scope_visibility_t *visi = CREF_SCOPE_VISI(cref);
392 rb_cref_t *next_cref = CREF_NEXT(cref), *new_cref;
393 int pushed_by_eval = CREF_PUSHED_BY_EVAL(cref);
394 int singleton = CREF_SINGLETON(cref);
395
396 new_cref = vm_cref_new(cref->klass_or_self, visi->method_visi, visi->module_func, next_cref, pushed_by_eval, singleton);
397
398 if (!NIL_P(CREF_REFINEMENTS(cref))) {
399 CREF_REFINEMENTS_SET(new_cref, Qnil);
400 CREF_OMOD_SHARED_UNSET(new_cref);
401 }
402
403 return new_cref;
404}
405
406static rb_cref_t *
407vm_cref_new_toplevel(rb_execution_context_t *ec)
408{
409 rb_cref_t *cref = vm_cref_new(rb_cObject, METHOD_VISI_PRIVATE /* toplevel visibility is private */, FALSE, NULL, FALSE, FALSE);
410 VALUE top_wrapper = rb_ec_thread_ptr(ec)->top_wrapper;
411
412 if (top_wrapper) {
413 cref = vm_cref_new(top_wrapper, METHOD_VISI_PRIVATE, FALSE, cref, FALSE, FALSE);
414 }
415
416 return cref;
417}
418
419rb_cref_t *
420rb_vm_cref_new_toplevel(void)
421{
422 return vm_cref_new_toplevel(GET_EC());
423}
424
425static void
426vm_cref_dump(const char *mesg, const rb_cref_t *cref)
427{
428 ruby_debug_printf("vm_cref_dump: %s (%p)\n", mesg, (void *)cref);
429
430 while (cref) {
431 ruby_debug_printf("= cref| klass: %s\n", RSTRING_PTR(rb_class_path(CREF_CLASS(cref))));
432 cref = CREF_NEXT(cref);
433 }
434}
435
436void
437rb_vm_block_ep_update(VALUE obj, const struct rb_block *dst, const VALUE *ep)
438{
439 *((const VALUE **)&dst->as.captured.ep) = ep;
440 RB_OBJ_WRITTEN(obj, Qundef, VM_ENV_ENVVAL(ep));
441}
442
443static void
444vm_bind_update_env(VALUE bindval, rb_binding_t *bind, VALUE envval)
445{
446 const rb_env_t *env = (rb_env_t *)envval;
447 RB_OBJ_WRITE(bindval, &bind->block.as.captured.code.iseq, env->iseq);
448 rb_vm_block_ep_update(bindval, &bind->block, env->ep);
449}
450
451#if VM_COLLECT_USAGE_DETAILS
452static void vm_collect_usage_operand(int insn, int n, VALUE op);
453static void vm_collect_usage_insn(int insn);
454static void vm_collect_usage_register(int reg, int isset);
455#endif
456
457static VALUE vm_make_env_object(const rb_execution_context_t *ec, rb_control_frame_t *cfp);
458static VALUE vm_invoke_bmethod(rb_execution_context_t *ec, rb_proc_t *proc, VALUE self,
459 int argc, const VALUE *argv, int kw_splat, VALUE block_handler,
461static VALUE vm_invoke_proc(rb_execution_context_t *ec, rb_proc_t *proc, VALUE self, int argc, const VALUE *argv, int kw_splat, VALUE block_handler);
462
463#if USE_YJIT
464// Counter to serve as a proxy for execution time, total number of calls
465static uint64_t yjit_total_entry_hits = 0;
466
467// Number of calls used to estimate how hot an ISEQ is
468#define YJIT_CALL_COUNT_INTERV 20u
469
471static inline bool
472rb_yjit_threshold_hit(const rb_iseq_t *iseq, uint64_t entry_calls)
473{
474 yjit_total_entry_hits += 1;
475
476 // Record the number of calls at the beginning of the interval
477 if (entry_calls + YJIT_CALL_COUNT_INTERV == rb_yjit_call_threshold) {
478 iseq->body->yjit_calls_at_interv = yjit_total_entry_hits;
479 }
480
481 // Try to estimate the total time taken (total number of calls) to reach 20 calls to this ISEQ
482 // This give us a ratio of how hot/cold this ISEQ is
483 if (entry_calls == rb_yjit_call_threshold) {
484 // We expect threshold 1 to compile everything immediately
485 if (rb_yjit_call_threshold < YJIT_CALL_COUNT_INTERV) {
486 return true;
487 }
488
489 uint64_t num_calls = yjit_total_entry_hits - iseq->body->yjit_calls_at_interv;
490
491 // Reject ISEQs that don't get called often enough
492 if (num_calls > rb_yjit_cold_threshold) {
493 rb_yjit_incr_counter("cold_iseq_entry");
494 return false;
495 }
496
497 return true;
498 }
499
500 return false;
501}
502#else
503#define rb_yjit_threshold_hit(iseq, entry_calls) false
504#endif
505
506#if USE_YJIT || USE_ZJIT
507// Generate JIT code that supports the following kinds of ISEQ entries:
508// * The first ISEQ on vm_exec (e.g. <main>, or Ruby methods/blocks
509// called by a C method). The current frame has VM_FRAME_FLAG_FINISH.
510// The current vm_exec stops if JIT code returns a non-Qundef value.
511// * ISEQs called by the interpreter on vm_sendish (e.g. Ruby methods or
512// blocks called by a Ruby frame that isn't compiled or side-exited).
513// The current frame doesn't have VM_FRAME_FLAG_FINISH. The current
514// vm_exec does NOT stop whether JIT code returns Qundef or not.
515static inline rb_jit_func_t
516jit_compile(rb_execution_context_t *ec)
517{
518 const rb_iseq_t *iseq = ec->cfp->iseq;
519 struct rb_iseq_constant_body *body = ISEQ_BODY(iseq);
520
521#if USE_ZJIT
522 if (body->jit_entry == NULL && rb_zjit_enabled_p) {
523 body->jit_entry_calls++;
524
525 // At profile-threshold, rewrite some of the YARV instructions
526 // to zjit_* instructions to profile these instructions.
527 if (body->jit_entry_calls == rb_zjit_profile_threshold) {
528 rb_zjit_profile_enable(iseq);
529 }
530
531 // At call-threshold, compile the ISEQ with ZJIT.
532 if (body->jit_entry_calls == rb_zjit_call_threshold) {
533 rb_zjit_compile_iseq(iseq, false);
534 }
535 }
536#endif
537
538#if USE_YJIT
539 // Increment the ISEQ's call counter and trigger JIT compilation if not compiled
540 if (body->jit_entry == NULL && rb_yjit_enabled_p) {
541 body->jit_entry_calls++;
542 if (rb_yjit_threshold_hit(iseq, body->jit_entry_calls)) {
543 rb_yjit_compile_iseq(iseq, ec, false);
544 }
545 }
546#endif
547 return body->jit_entry;
548}
549
550// Execute JIT code compiled by jit_compile()
551static inline VALUE
552jit_exec(rb_execution_context_t *ec)
553{
554 rb_jit_func_t func = jit_compile(ec);
555 if (func) {
556 // Call the JIT code
557 return func(ec, ec->cfp);
558 }
559 else {
560 return Qundef;
561 }
562}
563#else
564# define jit_compile(ec) ((rb_jit_func_t)0)
565# define jit_exec(ec) Qundef
566#endif
567
568#if USE_YJIT
569// Generate JIT code that supports the following kind of ISEQ entry:
570// * The first ISEQ pushed by vm_exec_handle_exception. The frame would
571// point to a location specified by a catch table, and it doesn't have
572// VM_FRAME_FLAG_FINISH. The current vm_exec stops if JIT code returns
573// a non-Qundef value. So you should not return a non-Qundef value
574// until ec->cfp is changed to a frame with VM_FRAME_FLAG_FINISH.
575static inline rb_jit_func_t
576jit_compile_exception(rb_execution_context_t *ec)
577{
578 const rb_iseq_t *iseq = ec->cfp->iseq;
579 struct rb_iseq_constant_body *body = ISEQ_BODY(iseq);
580
581#if USE_ZJIT
582 if (body->jit_exception == NULL && rb_zjit_enabled_p) {
583 body->jit_exception_calls++;
584
585 // At profile-threshold, rewrite some of the YARV instructions
586 // to zjit_* instructions to profile these instructions.
587 if (body->jit_exception_calls == rb_zjit_profile_threshold) {
588 rb_zjit_profile_enable(iseq);
589 }
590
591 // At call-threshold, compile the ISEQ with ZJIT.
592 if (body->jit_exception_calls == rb_zjit_call_threshold) {
593 rb_zjit_compile_iseq(iseq, true);
594 }
595 }
596#endif
597
598#if USE_YJIT
599 // Increment the ISEQ's call counter and trigger JIT compilation if not compiled
600 if (body->jit_exception == NULL && rb_yjit_enabled_p) {
601 body->jit_exception_calls++;
602 if (body->jit_exception_calls == rb_yjit_call_threshold) {
603 rb_yjit_compile_iseq(iseq, ec, true);
604 }
605 }
606#endif
607 return body->jit_exception;
608}
609
610// Execute JIT code compiled by jit_compile_exception()
611static inline VALUE
612jit_exec_exception(rb_execution_context_t *ec)
613{
614 rb_jit_func_t func = jit_compile_exception(ec);
615 if (func) {
616 // Call the JIT code
617 return func(ec, ec->cfp);
618 }
619 else {
620 return Qundef;
621 }
622}
623#else
624# define jit_compile_exception(ec) ((rb_jit_func_t)0)
625# define jit_exec_exception(ec) Qundef
626#endif
627
628static void add_opt_method_entry(const rb_method_entry_t *me);
629
630#define RB_TYPE_2_P(obj, type1, type2) \
631 (RB_TYPE_P(obj, type1) || RB_TYPE_P(obj, type2))
632#define RB_TYPE_3_P(obj, type1, type2, type3) \
633 (RB_TYPE_P(obj, type1) || RB_TYPE_P(obj, type2) || RB_TYPE_P(obj, type3))
634
635#define VM_ASSERT_TYPE(obj, type) \
636 VM_ASSERT(RB_TYPE_P(obj, type), #obj ": %s", rb_obj_info(obj))
637#define VM_ASSERT_TYPE2(obj, type1, type2) \
638 VM_ASSERT(RB_TYPE_2_P(obj, type1, type2), #obj ": %s", rb_obj_info(obj))
639#define VM_ASSERT_TYPE3(obj, type1, type2, type3) \
640 VM_ASSERT(RB_TYPE_3_P(obj, type1, type2, type3), #obj ": %s", rb_obj_info(obj))
641
642#include "vm_insnhelper.c"
643
644#include "vm_exec.c"
645
646#include "vm_method.c"
647#include "vm_eval.c"
648
649#define PROCDEBUG 0
650
651VALUE rb_cRubyVM;
653VALUE rb_mRubyVMFrozenCore;
654VALUE rb_block_param_proxy;
655
656VALUE ruby_vm_const_missing_count = 0;
657rb_vm_t *ruby_current_vm_ptr = NULL;
658rb_ractor_t *ruby_single_main_ractor;
659bool ruby_vm_keep_script_lines;
660
661#ifdef RB_THREAD_LOCAL_SPECIFIER
662RB_THREAD_LOCAL_SPECIFIER rb_execution_context_t *ruby_current_ec;
663
664#ifdef RUBY_NT_SERIAL
665RB_THREAD_LOCAL_SPECIFIER rb_atomic_t ruby_nt_serial;
666#endif
667
668// no-inline decl on vm_core.h
670rb_current_ec_noinline(void)
671{
672 return ruby_current_ec;
673}
674
675void
676rb_current_ec_set(rb_execution_context_t *ec)
677{
678 ruby_current_ec = ec;
679}
680
681
682#ifdef RB_THREAD_CURRENT_EC_NOINLINE
684rb_current_ec(void)
685{
686 return ruby_current_ec;
687}
688
689#endif
690#else
691native_tls_key_t ruby_current_ec_key;
692
693// no-inline decl on vm_core.h
695rb_current_ec_noinline(void)
696{
697 return native_tls_get(ruby_current_ec_key);
698}
699
700#endif
701
702rb_event_flag_t ruby_vm_event_flags;
703rb_event_flag_t ruby_vm_event_enabled_global_flags;
704unsigned int ruby_vm_event_local_num;
705
706rb_serial_t ruby_vm_constant_cache_invalidations = 0;
707rb_serial_t ruby_vm_constant_cache_misses = 0;
708rb_serial_t ruby_vm_global_cvar_state = 1;
709
710static const struct rb_callcache vm_empty_cc = {
711 .flags = T_IMEMO | (imemo_callcache << FL_USHIFT) | VM_CALLCACHE_UNMARKABLE,
712 .klass = Qundef,
713 .cme_ = NULL,
714 .call_ = vm_call_general,
715 .aux_ = {
716 .v = Qfalse,
717 }
718};
719
720static const struct rb_callcache vm_empty_cc_for_super = {
721 .flags = T_IMEMO | (imemo_callcache << FL_USHIFT) | VM_CALLCACHE_UNMARKABLE,
722 .klass = Qundef,
723 .cme_ = NULL,
724 .call_ = vm_call_super_method,
725 .aux_ = {
726 .v = Qfalse,
727 }
728};
729
730static void thread_free(void *ptr);
731
732void
733rb_vm_inc_const_missing_count(void)
734{
735 ruby_vm_const_missing_count +=1;
736}
737
738int
739rb_dtrace_setup(rb_execution_context_t *ec, VALUE klass, ID id,
740 struct ruby_dtrace_method_hook_args *args)
741{
743 if (!klass) {
744 if (!ec) ec = GET_EC();
745 if (!rb_ec_frame_method_id_and_class(ec, &id, 0, &klass) || !klass)
746 return FALSE;
747 }
748 if (RB_TYPE_P(klass, T_ICLASS)) {
749 klass = RBASIC(klass)->klass;
750 }
751 else if (RCLASS_SINGLETON_P(klass)) {
752 klass = RCLASS_ATTACHED_OBJECT(klass);
753 if (NIL_P(klass)) return FALSE;
754 }
755 type = BUILTIN_TYPE(klass);
756 if (type == T_CLASS || type == T_ICLASS || type == T_MODULE) {
757 VALUE name = rb_class_path(klass);
758 const char *classname, *filename;
759 const char *methodname = rb_id2name(id);
760 if (methodname && (filename = rb_source_location_cstr(&args->line_no)) != 0) {
761 if (NIL_P(name) || !(classname = StringValuePtr(name)))
762 classname = "<unknown>";
763 args->classname = classname;
764 args->methodname = methodname;
765 args->filename = filename;
766 args->klass = klass;
767 args->name = name;
768 return TRUE;
769 }
770 }
771 return FALSE;
772}
773
774extern unsigned int redblack_buffer_size;
775
776/*
777 * call-seq:
778 * RubyVM.stat -> Hash
779 * RubyVM.stat(hsh) -> hsh
780 * RubyVM.stat(Symbol) -> Numeric
781 *
782 * Returns a Hash containing implementation-dependent counters inside the VM.
783 *
784 * This hash includes information about method/constant caches:
785 *
786 * {
787 * :constant_cache_invalidations=>2,
788 * :constant_cache_misses=>14,
789 * :global_cvar_state=>27
790 * }
791 *
792 * If <tt>USE_DEBUG_COUNTER</tt> is enabled, debug counters will be included.
793 *
794 * The contents of the hash are implementation specific and may be changed in
795 * the future.
796 *
797 * This method is only expected to work on C Ruby.
798 */
799static VALUE
800vm_stat(int argc, VALUE *argv, VALUE self)
801{
802 static VALUE sym_constant_cache_invalidations, sym_constant_cache_misses, sym_global_cvar_state, sym_next_shape_id;
803 static VALUE sym_shape_cache_size;
804 VALUE arg = Qnil;
805 VALUE hash = Qnil, key = Qnil;
806
807 if (rb_check_arity(argc, 0, 1) == 1) {
808 arg = argv[0];
809 if (SYMBOL_P(arg))
810 key = arg;
811 else if (RB_TYPE_P(arg, T_HASH))
812 hash = arg;
813 else
814 rb_raise(rb_eTypeError, "non-hash or symbol given");
815 }
816 else {
817 hash = rb_hash_new();
818 }
819
820#define S(s) sym_##s = ID2SYM(rb_intern_const(#s))
821 S(constant_cache_invalidations);
822 S(constant_cache_misses);
823 S(global_cvar_state);
824 S(next_shape_id);
825 S(shape_cache_size);
826#undef S
827
828#define SET(name, attr) \
829 if (key == sym_##name) \
830 return SERIALT2NUM(attr); \
831 else if (hash != Qnil) \
832 rb_hash_aset(hash, sym_##name, SERIALT2NUM(attr));
833
834 SET(constant_cache_invalidations, ruby_vm_constant_cache_invalidations);
835 SET(constant_cache_misses, ruby_vm_constant_cache_misses);
836 SET(global_cvar_state, ruby_vm_global_cvar_state);
837 SET(next_shape_id, (rb_serial_t)rb_shapes_count());
838 SET(shape_cache_size, (rb_serial_t)rb_shape_tree.cache_size);
839#undef SET
840
841#if USE_DEBUG_COUNTER
842 ruby_debug_counter_show_at_exit(FALSE);
843 for (size_t i = 0; i < RB_DEBUG_COUNTER_MAX; i++) {
844 const VALUE name = rb_sym_intern_ascii_cstr(rb_debug_counter_names[i]);
845 const VALUE boxed_value = SIZET2NUM(rb_debug_counter[i]);
846
847 if (key == name) {
848 return boxed_value;
849 }
850 else if (hash != Qnil) {
851 rb_hash_aset(hash, name, boxed_value);
852 }
853 }
854#endif
855
856 if (!NIL_P(key)) { /* matched key should return above */
857 rb_raise(rb_eArgError, "unknown key: %"PRIsVALUE, rb_sym2str(key));
858 }
859
860 return hash;
861}
862
863/* control stack frame */
864
865static void
866vm_set_top_stack(rb_execution_context_t *ec, const rb_iseq_t *iseq, const rb_namespace_t *ns)
867{
868 if (ISEQ_BODY(iseq)->type != ISEQ_TYPE_TOP) {
869 rb_raise(rb_eTypeError, "Not a toplevel InstructionSequence");
870 }
871
872 /* for return */
873 vm_push_frame(ec, iseq, VM_FRAME_MAGIC_TOP | VM_ENV_FLAG_LOCAL | VM_FRAME_FLAG_FINISH,
874 rb_ec_thread_ptr(ec)->top_self,
875 GC_GUARDED_PTR(ns),
876 (VALUE)vm_cref_new_toplevel(ec), /* cref or me */
877 ISEQ_BODY(iseq)->iseq_encoded, ec->cfp->sp,
878 ISEQ_BODY(iseq)->local_table_size, ISEQ_BODY(iseq)->stack_max);
879}
880
881static void
882vm_set_eval_stack(rb_execution_context_t *ec, const rb_iseq_t *iseq, const rb_cref_t *cref, const struct rb_block *base_block)
883{
884 vm_push_frame(ec, iseq, VM_FRAME_MAGIC_EVAL | VM_FRAME_FLAG_FINISH,
885 vm_block_self(base_block), VM_GUARDED_PREV_EP(vm_block_ep(base_block)),
886 (VALUE)cref, /* cref or me */
887 ISEQ_BODY(iseq)->iseq_encoded,
888 ec->cfp->sp, ISEQ_BODY(iseq)->local_table_size,
889 ISEQ_BODY(iseq)->stack_max);
890}
891
892static void
893vm_set_main_stack(rb_execution_context_t *ec, const rb_iseq_t *iseq)
894{
895 VALUE toplevel_binding = rb_const_get(rb_cObject, rb_intern("TOPLEVEL_BINDING"));
896 rb_binding_t *bind;
897
898 GetBindingPtr(toplevel_binding, bind);
899 RUBY_ASSERT_MESG(bind, "TOPLEVEL_BINDING is not built");
900
901 vm_set_eval_stack(ec, iseq, 0, &bind->block);
902
903 /* save binding */
904 if (ISEQ_BODY(iseq)->local_table_size > 0) {
905 vm_bind_update_env(toplevel_binding, bind, vm_make_env_object(ec, ec->cfp));
906 }
907}
908
910rb_vm_get_binding_creatable_next_cfp(const rb_execution_context_t *ec, const rb_control_frame_t *cfp)
911{
912 while (!RUBY_VM_CONTROL_FRAME_STACK_OVERFLOW_P(ec, cfp)) {
913 if (cfp->iseq) {
914 return (rb_control_frame_t *)cfp;
915 }
916 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
917 }
918 return 0;
919}
920
922rb_vm_get_ruby_level_next_cfp(const rb_execution_context_t *ec, const rb_control_frame_t *cfp)
923{
924 while (!RUBY_VM_CONTROL_FRAME_STACK_OVERFLOW_P(ec, cfp)) {
925 if (VM_FRAME_RUBYFRAME_P(cfp)) {
926 return (rb_control_frame_t *)cfp;
927 }
928 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
929 }
930 return 0;
931}
932
933static rb_control_frame_t *
934vm_get_ruby_level_caller_cfp(const rb_execution_context_t *ec, const rb_control_frame_t *cfp)
935{
936 if (VM_FRAME_RUBYFRAME_P(cfp)) {
937 return (rb_control_frame_t *)cfp;
938 }
939
940 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
941
942 while (!RUBY_VM_CONTROL_FRAME_STACK_OVERFLOW_P(ec, cfp)) {
943 if (VM_FRAME_RUBYFRAME_P(cfp)) {
944 return (rb_control_frame_t *)cfp;
945 }
946
947 if (VM_ENV_FLAGS(cfp->ep, VM_FRAME_FLAG_PASSED) == FALSE) {
948 break;
949 }
950 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
951 }
952 return 0;
953}
954
955void
956rb_vm_pop_cfunc_frame(void)
957{
958 rb_execution_context_t *ec = GET_EC();
959 rb_control_frame_t *cfp = ec->cfp;
960 const rb_callable_method_entry_t *me = rb_vm_frame_method_entry(cfp);
961
962 EXEC_EVENT_HOOK(ec, RUBY_EVENT_C_RETURN, cfp->self, me->def->original_id, me->called_id, me->owner, Qnil);
963 RUBY_DTRACE_CMETHOD_RETURN_HOOK(ec, me->owner, me->def->original_id);
964 vm_pop_frame(ec, cfp, cfp->ep);
965}
966
967void
968rb_vm_rewind_cfp(rb_execution_context_t *ec, rb_control_frame_t *cfp)
969{
970 /* check skipped frame */
971 while (ec->cfp != cfp) {
972#if VMDEBUG
973 printf("skipped frame: %s\n", vm_frametype_name(ec->cfp));
974#endif
975 if (VM_FRAME_TYPE(ec->cfp) != VM_FRAME_MAGIC_CFUNC) {
976 rb_vm_pop_frame(ec);
977 }
978 else { /* unlikely path */
979 rb_vm_pop_cfunc_frame();
980 }
981 }
982}
983
984/* at exit */
985
986void
987ruby_vm_at_exit(void (*func)(rb_vm_t *))
988{
989 rb_vm_t *vm = GET_VM();
991 nl->func = func;
992 nl->next = vm->at_exit;
993 vm->at_exit = nl;
994}
995
996static void
997ruby_vm_run_at_exit_hooks(rb_vm_t *vm)
998{
999 rb_at_exit_list *l = vm->at_exit;
1000
1001 while (l) {
1002 rb_at_exit_list* t = l->next;
1003 rb_vm_at_exit_func *func = l->func;
1004 ruby_xfree(l);
1005 l = t;
1006 (*func)(vm);
1007 }
1008}
1009
1010/* Env */
1011
1012static VALUE check_env_value(const rb_env_t *env);
1013
1014static int
1015check_env(const rb_env_t *env)
1016{
1017 fputs("---\n", stderr);
1018 ruby_debug_printf("envptr: %p\n", (void *)&env->ep[0]);
1019 ruby_debug_printf("envval: %10p ", (void *)env->ep[1]);
1020 dp(env->ep[1]);
1021 ruby_debug_printf("ep: %10p\n", (void *)env->ep);
1022 if (rb_vm_env_prev_env(env)) {
1023 fputs(">>\n", stderr);
1024 check_env_value(rb_vm_env_prev_env(env));
1025 fputs("<<\n", stderr);
1026 }
1027 return 1;
1028}
1029
1030static VALUE
1031check_env_value(const rb_env_t *env)
1032{
1033 if (check_env(env)) {
1034 return (VALUE)env;
1035 }
1036 rb_bug("invalid env");
1037 return Qnil; /* unreachable */
1038}
1039
1040static VALUE
1041vm_block_handler_escape(const rb_execution_context_t *ec, VALUE block_handler)
1042{
1043 switch (vm_block_handler_type(block_handler)) {
1044 case block_handler_type_ifunc:
1045 case block_handler_type_iseq:
1046 return rb_vm_make_proc(ec, VM_BH_TO_CAPT_BLOCK(block_handler), rb_cProc);
1047
1048 case block_handler_type_symbol:
1049 case block_handler_type_proc:
1050 return block_handler;
1051 }
1052 VM_UNREACHABLE(vm_block_handler_escape);
1053 return Qnil;
1054}
1055
1056static VALUE
1057vm_make_env_each(const rb_execution_context_t * const ec, rb_control_frame_t *const cfp)
1058{
1059 const VALUE * const ep = cfp->ep;
1060 VALUE *env_body, *env_ep;
1061 int local_size, env_size;
1062
1063 if (VM_ENV_ESCAPED_P(ep)) {
1064 return VM_ENV_ENVVAL(ep);
1065 }
1066
1067 if (!VM_ENV_LOCAL_P(ep)) {
1068 const VALUE *prev_ep = VM_ENV_PREV_EP(ep);
1069 if (!VM_ENV_ESCAPED_P(prev_ep)) {
1070 rb_control_frame_t *prev_cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
1071
1072 while (prev_cfp->ep != prev_ep) {
1073 prev_cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(prev_cfp);
1074 VM_ASSERT(prev_cfp->ep != NULL);
1075 }
1076
1077 vm_make_env_each(ec, prev_cfp);
1078 VM_FORCE_WRITE_SPECIAL_CONST(&ep[VM_ENV_DATA_INDEX_SPECVAL], VM_GUARDED_PREV_EP(prev_cfp->ep));
1079 }
1080 }
1081 else {
1082 VM_ASSERT(VM_ENV_LOCAL_P(ep));
1083 VALUE block_handler = VM_ENV_BLOCK_HANDLER(ep);
1084
1085 if (block_handler != VM_BLOCK_HANDLER_NONE) {
1086 VALUE blockprocval = vm_block_handler_escape(ec, block_handler);
1087 VM_STACK_ENV_WRITE(ep, VM_ENV_DATA_INDEX_SPECVAL, blockprocval);
1088 }
1089 }
1090
1091 if (!VM_FRAME_RUBYFRAME_P(cfp)) {
1092 local_size = VM_ENV_DATA_SIZE;
1093 }
1094 else {
1095 local_size = ISEQ_BODY(cfp->iseq)->local_table_size;
1096 if (ISEQ_BODY(cfp->iseq)->param.flags.forwardable && VM_ENV_LOCAL_P(cfp->ep)) {
1097 int ci_offset = local_size - ISEQ_BODY(cfp->iseq)->param.size + VM_ENV_DATA_SIZE;
1098
1099 CALL_INFO ci = (CALL_INFO)VM_CF_LEP(cfp)[-ci_offset];
1100 local_size += vm_ci_argc(ci);
1101 }
1102 local_size += VM_ENV_DATA_SIZE;
1103 }
1104
1105 /*
1106 * # local variables on a stack frame (N == local_size)
1107 * [lvar1, lvar2, ..., lvarN, SPECVAL]
1108 * ^
1109 * ep[0]
1110 *
1111 * # moved local variables
1112 * [lvar1, lvar2, ..., lvarN, SPECVAL, Envval, BlockProcval (if needed)]
1113 * ^ ^
1114 * env->env[0] ep[0]
1115 */
1116
1117 env_size = local_size +
1118 1 /* envval */;
1119
1120 // Careful with order in the following sequence. Each allocation can move objects.
1121 env_body = ALLOC_N(VALUE, env_size);
1122 rb_env_t *env = IMEMO_NEW(rb_env_t, imemo_env, 0);
1123
1124 // Set up env without WB since it's brand new (similar to newobj_init(), newobj_fill())
1125 MEMCPY(env_body, ep - (local_size - 1 /* specval */), VALUE, local_size);
1126
1127 env_ep = &env_body[local_size - 1 /* specval */];
1128 env_ep[VM_ENV_DATA_INDEX_ENV] = (VALUE)env;
1129
1130 env->iseq = (rb_iseq_t *)(VM_FRAME_RUBYFRAME_P(cfp) ? cfp->iseq : NULL);
1131 env->ep = env_ep;
1132 env->env = env_body;
1133 env->env_size = env_size;
1134
1135 cfp->ep = env_ep;
1136 VM_ENV_FLAGS_SET(env_ep, VM_ENV_FLAG_ESCAPED | VM_ENV_FLAG_WB_REQUIRED);
1137 VM_STACK_ENV_WRITE(ep, 0, (VALUE)env); /* GC mark */
1138
1139#if 0
1140 for (i = 0; i < local_size; i++) {
1141 if (VM_FRAME_RUBYFRAME_P(cfp)) {
1142 /* clear value stack for GC */
1143 ep[-local_size + i] = 0;
1144 }
1145 }
1146#endif
1147
1148 // Invalidate JIT code that assumes cfp->ep == vm_base_ptr(cfp).
1149 if (env->iseq) {
1150 rb_yjit_invalidate_ep_is_bp(env->iseq);
1151 rb_zjit_invalidate_no_ep_escape(env->iseq);
1152 }
1153
1154 return (VALUE)env;
1155}
1156
1157static VALUE
1158vm_make_env_object(const rb_execution_context_t *ec, rb_control_frame_t *cfp)
1159{
1160 VALUE envval = vm_make_env_each(ec, cfp);
1161
1162 if (PROCDEBUG) {
1163 check_env_value((const rb_env_t *)envval);
1164 }
1165
1166 return envval;
1167}
1168
1169void
1170rb_vm_stack_to_heap(rb_execution_context_t *ec)
1171{
1172 rb_control_frame_t *cfp = ec->cfp;
1173 while ((cfp = rb_vm_get_binding_creatable_next_cfp(ec, cfp)) != 0) {
1174 vm_make_env_object(ec, cfp);
1175 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
1176 }
1177}
1178
1179const rb_env_t *
1180rb_vm_env_prev_env(const rb_env_t *env)
1181{
1182 const VALUE *ep = env->ep;
1183
1184 if (VM_ENV_LOCAL_P(ep)) {
1185 return NULL;
1186 }
1187 else {
1188 const VALUE *prev_ep = VM_ENV_PREV_EP(ep);
1189 return VM_ENV_ENVVAL_PTR(prev_ep);
1190 }
1191}
1192
1193static int
1194collect_local_variables_in_iseq(const rb_iseq_t *iseq, const struct local_var_list *vars)
1195{
1196 unsigned int i;
1197 if (!iseq) return 0;
1198 for (i = 0; i < ISEQ_BODY(iseq)->local_table_size; i++) {
1199 local_var_list_add(vars, ISEQ_BODY(iseq)->local_table[i]);
1200 }
1201 return 1;
1202}
1203
1204static void
1205collect_local_variables_in_env(const rb_env_t *env, const struct local_var_list *vars)
1206{
1207 do {
1208 if (VM_ENV_FLAGS(env->ep, VM_ENV_FLAG_ISOLATED)) break;
1209 collect_local_variables_in_iseq(env->iseq, vars);
1210 } while ((env = rb_vm_env_prev_env(env)) != NULL);
1211}
1212
1213static int
1214vm_collect_local_variables_in_heap(const VALUE *ep, const struct local_var_list *vars)
1215{
1216 if (VM_ENV_ESCAPED_P(ep)) {
1217 collect_local_variables_in_env(VM_ENV_ENVVAL_PTR(ep), vars);
1218 return 1;
1219 }
1220 else {
1221 return 0;
1222 }
1223}
1224
1225VALUE
1226rb_vm_env_local_variables(const rb_env_t *env)
1227{
1228 struct local_var_list vars;
1229 local_var_list_init(&vars);
1230 collect_local_variables_in_env(env, &vars);
1231 return local_var_list_finish(&vars);
1232}
1233
1234VALUE
1235rb_vm_env_numbered_parameters(const rb_env_t *env)
1236{
1237 struct local_var_list vars;
1238 local_var_list_init(&vars);
1239 // if (VM_ENV_FLAGS(env->ep, VM_ENV_FLAG_ISOLATED)) break; // TODO: is this needed?
1240 const rb_iseq_t *iseq = env->iseq;
1241 unsigned int i;
1242 if (!iseq) return 0;
1243 for (i = 0; i < ISEQ_BODY(iseq)->local_table_size; i++) {
1244 numparam_list_add(&vars, ISEQ_BODY(iseq)->local_table[i]);
1245 }
1246 return local_var_list_finish(&vars);
1247}
1248
1249VALUE
1250rb_iseq_local_variables(const rb_iseq_t *iseq)
1251{
1252 struct local_var_list vars;
1253 local_var_list_init(&vars);
1254 while (collect_local_variables_in_iseq(iseq, &vars)) {
1255 iseq = ISEQ_BODY(iseq)->parent_iseq;
1256 }
1257 return local_var_list_finish(&vars);
1258}
1259
1260/* Proc */
1261
1262static VALUE
1263vm_proc_create_from_captured(VALUE klass,
1264 const struct rb_captured_block *captured,
1265 enum rb_block_type block_type,
1266 int8_t is_from_method, int8_t is_lambda)
1267{
1268 VALUE procval = rb_proc_alloc(klass);
1269 rb_proc_t *proc = RTYPEDDATA_DATA(procval);
1270
1271 VM_ASSERT(VM_EP_IN_HEAP_P(GET_EC(), captured->ep));
1272
1273 /* copy block */
1274 RB_OBJ_WRITE(procval, &proc->block.as.captured.code.val, captured->code.val);
1275 RB_OBJ_WRITE(procval, &proc->block.as.captured.self, captured->self);
1276 rb_vm_block_ep_update(procval, &proc->block, captured->ep);
1277
1278 vm_block_type_set(&proc->block, block_type);
1279 proc->is_from_method = is_from_method;
1280 proc->is_lambda = is_lambda;
1281
1282 return procval;
1283}
1284
1285void
1286rb_vm_block_copy(VALUE obj, const struct rb_block *dst, const struct rb_block *src)
1287{
1288 /* copy block */
1289 switch (vm_block_type(src)) {
1290 case block_type_iseq:
1291 case block_type_ifunc:
1292 RB_OBJ_WRITE(obj, &dst->as.captured.self, src->as.captured.self);
1293 RB_OBJ_WRITE(obj, &dst->as.captured.code.val, src->as.captured.code.val);
1294 rb_vm_block_ep_update(obj, dst, src->as.captured.ep);
1295 break;
1296 case block_type_symbol:
1297 RB_OBJ_WRITE(obj, &dst->as.symbol, src->as.symbol);
1298 break;
1299 case block_type_proc:
1300 RB_OBJ_WRITE(obj, &dst->as.proc, src->as.proc);
1301 break;
1302 }
1303}
1304
1305static VALUE
1306proc_create(VALUE klass, const struct rb_block *block, int8_t is_from_method, int8_t is_lambda)
1307{
1308 VALUE procval = rb_proc_alloc(klass);
1309 rb_proc_t *proc = RTYPEDDATA_DATA(procval);
1310
1311 VM_ASSERT(VM_EP_IN_HEAP_P(GET_EC(), vm_block_ep(block)));
1312 rb_vm_block_copy(procval, &proc->block, block);
1313 vm_block_type_set(&proc->block, block->type);
1314 proc->is_from_method = is_from_method;
1315 proc->is_lambda = is_lambda;
1316
1317 return procval;
1318}
1319
1320VALUE
1321rb_proc_dup(VALUE self)
1322{
1323 VALUE procval;
1324 rb_proc_t *src;
1325
1326 GetProcPtr(self, src);
1327
1328 switch (vm_block_type(&src->block)) {
1329 case block_type_ifunc:
1330 procval = rb_func_proc_dup(self);
1331 break;
1332 default:
1333 procval = proc_create(rb_obj_class(self), &src->block, src->is_from_method, src->is_lambda);
1334 break;
1335 }
1336
1337 if (RB_OBJ_SHAREABLE_P(self)) RB_OBJ_SET_SHAREABLE(procval);
1338 RB_GC_GUARD(self); /* for: body = rb_proc_dup(body) */
1339 return procval;
1340}
1341
1343 VALUE ary;
1344 VALUE read_only;
1345 bool yield;
1346 bool isolate;
1347};
1348
1349static VALUE
1350ID2NUM(ID id)
1351{
1352 if (SIZEOF_VOIDP > SIZEOF_LONG)
1353 return ULL2NUM(id);
1354 else
1355 return ULONG2NUM(id);
1356}
1357
1358static ID
1359NUM2ID(VALUE num)
1360{
1361 if (SIZEOF_VOIDP > SIZEOF_LONG)
1362 return (ID)NUM2ULL(num);
1363 else
1364 return (ID)NUM2ULONG(num);
1365}
1366
1367static enum rb_id_table_iterator_result
1368collect_outer_variable_names(ID id, VALUE val, void *ptr)
1369{
1371
1372 if (id == rb_intern("yield")) {
1373 data->yield = true;
1374 }
1375 else {
1376 VALUE *store;
1377 if (data->isolate ||
1378 val == Qtrue /* write */) {
1379 store = &data->ary;
1380 }
1381 else {
1382 store = &data->read_only;
1383 }
1384 if (*store == Qfalse) *store = rb_ary_new();
1385 rb_ary_push(*store, ID2NUM(id));
1386 }
1387 return ID_TABLE_CONTINUE;
1388}
1389
1390static const rb_env_t *
1391env_copy(const VALUE *src_ep, VALUE read_only_variables)
1392{
1393 const rb_env_t *src_env = (rb_env_t *)VM_ENV_ENVVAL(src_ep);
1394 VM_ASSERT(src_env->ep == src_ep);
1395
1396 VALUE *env_body = ZALLOC_N(VALUE, src_env->env_size); // fill with Qfalse
1397 VALUE *ep = &env_body[src_env->env_size - 2];
1398 const rb_env_t *copied_env = vm_env_new(ep, env_body, src_env->env_size, src_env->iseq);
1399
1400 // Copy after allocations above, since they can move objects in src_ep.
1401 VALUE svar_val = src_ep[VM_ENV_DATA_INDEX_ME_CREF];
1402 if (imemo_type_p(svar_val, imemo_svar)) {
1403 const struct vm_svar *svar = (struct vm_svar *)svar_val;
1404
1405 if (svar->cref_or_me) {
1406 svar_val = svar->cref_or_me;
1407 }
1408 else {
1409 svar_val = Qfalse;
1410 }
1411 }
1412 RB_OBJ_WRITE(copied_env, &ep[VM_ENV_DATA_INDEX_ME_CREF], svar_val);
1413
1414 ep[VM_ENV_DATA_INDEX_FLAGS] = src_ep[VM_ENV_DATA_INDEX_FLAGS] | VM_ENV_FLAG_ISOLATED;
1415 if (!VM_ENV_LOCAL_P(src_ep)) {
1416 VM_ENV_FLAGS_SET(ep, VM_ENV_FLAG_LOCAL);
1417 }
1418
1419 if (read_only_variables) {
1420 for (int i=RARRAY_LENINT(read_only_variables)-1; i>=0; i--) {
1421 ID id = NUM2ID(RARRAY_AREF(read_only_variables, i));
1422
1423 const struct rb_iseq_constant_body *body = ISEQ_BODY(src_env->iseq);
1424 for (unsigned int j=0; j<body->local_table_size; j++) {
1425 if (id == body->local_table[j]) {
1426 // check reassignment
1427 if (body->lvar_states[j] == lvar_reassigned) {
1428 VALUE name = rb_id2str(id);
1429 VALUE msg = rb_sprintf("cannot make a shareable Proc because "
1430 "the outer variable '%" PRIsVALUE "' may be reassigned.", name);
1431 rb_exc_raise(rb_exc_new_str(rb_eRactorIsolationError, msg));
1432 }
1433
1434 // check shareable
1435 VALUE v = src_env->env[j];
1436 if (!rb_ractor_shareable_p(v)) {
1437 VALUE name = rb_id2str(id);
1438 VALUE msg = rb_sprintf("cannot make a shareable Proc because it can refer"
1439 " unshareable object %+" PRIsVALUE " from ", v);
1440 if (name)
1441 rb_str_catf(msg, "variable '%" PRIsVALUE "'", name);
1442 else
1443 rb_str_cat_cstr(msg, "a hidden variable");
1444 rb_exc_raise(rb_exc_new_str(rb_eRactorIsolationError, msg));
1445 }
1446 RB_OBJ_WRITE((VALUE)copied_env, &env_body[j], v);
1447 rb_ary_delete_at(read_only_variables, i);
1448 break;
1449 }
1450 }
1451 }
1452 }
1453
1454 if (!VM_ENV_LOCAL_P(src_ep)) {
1455 const VALUE *prev_ep = VM_ENV_PREV_EP(src_env->ep);
1456 const rb_env_t *new_prev_env = env_copy(prev_ep, read_only_variables);
1457 ep[VM_ENV_DATA_INDEX_SPECVAL] = VM_GUARDED_PREV_EP(new_prev_env->ep);
1458 RB_OBJ_WRITTEN(copied_env, Qundef, new_prev_env);
1459 VM_ENV_FLAGS_UNSET(ep, VM_ENV_FLAG_LOCAL);
1460 }
1461 else {
1462 ep[VM_ENV_DATA_INDEX_SPECVAL] = VM_BLOCK_HANDLER_NONE;
1463 }
1464
1465 RB_OBJ_SET_SHAREABLE((VALUE)copied_env);
1466 return copied_env;
1467}
1468
1469static void
1470proc_isolate_env(VALUE self, rb_proc_t *proc, VALUE read_only_variables)
1471{
1472 const struct rb_captured_block *captured = &proc->block.as.captured;
1473 const rb_env_t *env = env_copy(captured->ep, read_only_variables);
1474 *((const VALUE **)&proc->block.as.captured.ep) = env->ep;
1475 RB_OBJ_WRITTEN(self, Qundef, env);
1476}
1477
1478static VALUE
1479proc_shared_outer_variables(struct rb_id_table *outer_variables, bool isolate, const char *message)
1480{
1481 struct collect_outer_variable_name_data data = {
1482 .isolate = isolate,
1483 .ary = Qfalse,
1484 .read_only = Qfalse,
1485 .yield = false,
1486 };
1487 rb_id_table_foreach(outer_variables, collect_outer_variable_names, (void *)&data);
1488
1489 if (data.ary != Qfalse) {
1490 VALUE str = rb_sprintf("can not %s because it accesses outer variables", message);
1491 VALUE ary = data.ary;
1492 const char *sep = " (";
1493 for (long i = 0; i < RARRAY_LEN(ary); i++) {
1494 VALUE name = rb_id2str(NUM2ID(RARRAY_AREF(ary, i)));
1495 if (!name) continue;
1496 rb_str_cat_cstr(str, sep);
1497 sep = ", ";
1498 rb_str_append(str, name);
1499 }
1500 if (*sep == ',') rb_str_cat_cstr(str, ")");
1501 rb_str_cat_cstr(str, data.yield ? " and uses 'yield'." : ".");
1502 rb_exc_raise(rb_exc_new_str(rb_eArgError, str));
1503 }
1504 else if (data.yield) {
1505 rb_raise(rb_eArgError, "can not %s because it uses 'yield'.", message);
1506 }
1507
1508 return data.read_only;
1509}
1510
1511VALUE
1512rb_proc_isolate_bang(VALUE self, VALUE replace_self)
1513{
1514 const rb_iseq_t *iseq = vm_proc_iseq(self);
1515
1516 if (iseq) {
1517 rb_proc_t *proc = (rb_proc_t *)RTYPEDDATA_DATA(self);
1518
1519 if (!UNDEF_P(replace_self)) {
1520 VM_ASSERT(rb_ractor_shareable_p(replace_self));
1521 RB_OBJ_WRITE(self, &proc->block.as.captured.self, replace_self);
1522 }
1523
1524 if (proc->block.type != block_type_iseq) rb_raise(rb_eRuntimeError, "not supported yet");
1525
1526 if (ISEQ_BODY(iseq)->outer_variables) {
1527 proc_shared_outer_variables(ISEQ_BODY(iseq)->outer_variables, true, "isolate a Proc");
1528 }
1529
1530 proc_isolate_env(self, proc, Qfalse);
1531 proc->is_isolated = TRUE;
1532 RB_OBJ_WRITE(self, &proc->block.as.captured.self, Qnil);
1533 }
1534
1535 RB_OBJ_SET_SHAREABLE(self);
1536 return self;
1537}
1538
1539VALUE
1540rb_proc_isolate(VALUE self)
1541{
1542 VALUE dst = rb_proc_dup(self);
1543 rb_proc_isolate_bang(dst, Qundef);
1544 return dst;
1545}
1546
1547VALUE
1548rb_proc_ractor_make_shareable(VALUE self, VALUE replace_self)
1549{
1550 const rb_iseq_t *iseq = vm_proc_iseq(self);
1551
1552 if (iseq) {
1553 rb_proc_t *proc = (rb_proc_t *)RTYPEDDATA_DATA(self);
1554
1555 if (!UNDEF_P(replace_self)) {
1556 RB_OBJ_WRITE(self, &proc->block.as.captured.self, replace_self);
1557 }
1558
1559 if (proc->block.type != block_type_iseq) rb_raise(rb_eRuntimeError, "not supported yet");
1560
1561 if (!rb_ractor_shareable_p(vm_block_self(&proc->block))) {
1562 rb_raise(rb_eRactorIsolationError,
1563 "Proc's self is not shareable: %" PRIsVALUE,
1564 self);
1565 }
1566
1567 VALUE read_only_variables = Qfalse;
1568
1569 if (ISEQ_BODY(iseq)->outer_variables) {
1570 read_only_variables =
1571 proc_shared_outer_variables(ISEQ_BODY(iseq)->outer_variables, false, "make a Proc shareable");
1572 }
1573
1574 proc_isolate_env(self, proc, read_only_variables);
1575 proc->is_isolated = TRUE;
1576 }
1577 else {
1578 VALUE proc_self = vm_block_self(vm_proc_block(self));
1579 if (!rb_ractor_shareable_p(proc_self)) {
1580 rb_raise(rb_eRactorIsolationError,
1581 "Proc's self is not shareable: %" PRIsVALUE,
1582 self);
1583 }
1584 }
1585
1586 RB_OBJ_SET_FROZEN_SHAREABLE(self);
1587 return self;
1588}
1589
1590VALUE
1591rb_vm_make_proc_lambda(const rb_execution_context_t *ec, const struct rb_captured_block *captured, VALUE klass, int8_t is_lambda)
1592{
1593 VALUE procval;
1594 enum imemo_type code_type = imemo_type(captured->code.val);
1595
1596 if (!VM_ENV_ESCAPED_P(captured->ep)) {
1597 rb_control_frame_t *cfp = VM_CAPTURED_BLOCK_TO_CFP(captured);
1598 vm_make_env_object(ec, cfp);
1599 }
1600
1601 VM_ASSERT(VM_EP_IN_HEAP_P(ec, captured->ep));
1602 VM_ASSERT(code_type == imemo_iseq || code_type == imemo_ifunc);
1603
1604 procval = vm_proc_create_from_captured(klass, captured,
1605 code_type == imemo_iseq ? block_type_iseq : block_type_ifunc,
1606 FALSE, is_lambda);
1607
1608 if (code_type == imemo_ifunc) {
1609 struct vm_ifunc *ifunc = (struct vm_ifunc *)captured->code.val;
1610 if (ifunc->svar_lep) {
1611 VALUE ep0 = ifunc->svar_lep[0];
1612 if (RB_TYPE_P(ep0, T_IMEMO) && imemo_type_p(ep0, imemo_env)) {
1613 // `ep0 == imemo_env` means this ep is escaped to heap (in env object).
1614 const rb_env_t *env = (const rb_env_t *)ep0;
1615 ifunc->svar_lep = (VALUE *)env->ep;
1616 }
1617 else {
1618 VM_ASSERT(FIXNUM_P(ep0));
1619 if (ep0 & VM_ENV_FLAG_ESCAPED) {
1620 // ok. do nothing
1621 }
1622 else {
1623 ifunc->svar_lep = NULL;
1624 }
1625 }
1626 }
1627 }
1628
1629 return procval;
1630}
1631
1632/* Binding */
1633
1634VALUE
1635rb_vm_make_binding(const rb_execution_context_t *ec, const rb_control_frame_t *src_cfp)
1636{
1637 rb_control_frame_t *cfp = rb_vm_get_binding_creatable_next_cfp(ec, src_cfp);
1638 rb_control_frame_t *ruby_level_cfp = rb_vm_get_ruby_level_next_cfp(ec, src_cfp);
1639 VALUE bindval, envval;
1640 rb_binding_t *bind;
1641
1642 if (cfp == 0 || ruby_level_cfp == 0) {
1643 rb_raise(rb_eRuntimeError, "Can't create Binding Object on top of Fiber.");
1644 }
1645 if (!VM_FRAME_RUBYFRAME_P(src_cfp) &&
1646 !VM_FRAME_RUBYFRAME_P(RUBY_VM_PREVIOUS_CONTROL_FRAME(src_cfp))) {
1647 rb_raise(rb_eRuntimeError, "Cannot create Binding object for non-Ruby caller");
1648 }
1649
1650 envval = vm_make_env_object(ec, cfp);
1651 bindval = rb_binding_alloc(rb_cBinding);
1652 GetBindingPtr(bindval, bind);
1653 vm_bind_update_env(bindval, bind, envval);
1654 RB_OBJ_WRITE(bindval, &bind->block.as.captured.self, cfp->self);
1655 RB_OBJ_WRITE(bindval, &bind->block.as.captured.code.iseq, cfp->iseq);
1656 RB_OBJ_WRITE(bindval, &bind->pathobj, ISEQ_BODY(ruby_level_cfp->iseq)->location.pathobj);
1657 bind->first_lineno = rb_vm_get_sourceline(ruby_level_cfp);
1658
1659 return bindval;
1660}
1661
1662const VALUE *
1663rb_binding_add_dynavars(VALUE bindval, rb_binding_t *bind, int dyncount, const ID *dynvars)
1664{
1665 VALUE envval, pathobj = bind->pathobj;
1666 VALUE path = pathobj_path(pathobj);
1667 VALUE realpath = pathobj_realpath(pathobj);
1668 const struct rb_block *base_block;
1669 const rb_env_t *env;
1670 rb_execution_context_t *ec = GET_EC();
1671 const rb_iseq_t *base_iseq, *iseq;
1672 rb_node_scope_t tmp_node;
1673
1674 if (dyncount < 0) return 0;
1675
1676 base_block = &bind->block;
1677 base_iseq = vm_block_iseq(base_block);
1678
1679 VALUE idtmp = 0;
1680 rb_ast_id_table_t *dyns = ALLOCV(idtmp, sizeof(rb_ast_id_table_t) + dyncount * sizeof(ID));
1681 dyns->size = dyncount;
1682 MEMCPY(dyns->ids, dynvars, ID, dyncount);
1683
1684 rb_node_init(RNODE(&tmp_node), NODE_SCOPE);
1685 tmp_node.nd_tbl = dyns;
1686 tmp_node.nd_body = 0;
1687 tmp_node.nd_parent = NULL;
1688 tmp_node.nd_args = 0;
1689
1690 VALUE ast_value = rb_ruby_ast_new(RNODE(&tmp_node));
1691
1692 if (base_iseq) {
1693 iseq = rb_iseq_new(ast_value, ISEQ_BODY(base_iseq)->location.label, path, realpath, base_iseq, ISEQ_TYPE_EVAL);
1694 }
1695 else {
1696 VALUE tempstr = rb_fstring_lit("<temp>");
1697 iseq = rb_iseq_new_top(ast_value, tempstr, tempstr, tempstr, NULL);
1698 }
1699 tmp_node.nd_tbl = 0; /* reset table */
1700 ALLOCV_END(idtmp);
1701
1702 vm_set_eval_stack(ec, iseq, 0, base_block);
1703 vm_bind_update_env(bindval, bind, envval = vm_make_env_object(ec, ec->cfp));
1704 rb_vm_pop_frame(ec);
1705
1706 env = (const rb_env_t *)envval;
1707 return env->env;
1708}
1709
1710/* C -> Ruby: block */
1711
1712static inline void
1713invoke_block(rb_execution_context_t *ec, const rb_iseq_t *iseq, VALUE self, const struct rb_captured_block *captured, const rb_cref_t *cref, VALUE type, int opt_pc)
1714{
1715 int arg_size = ISEQ_BODY(iseq)->param.size;
1716
1717 vm_push_frame(ec, iseq, type | VM_FRAME_FLAG_FINISH, self,
1718 VM_GUARDED_PREV_EP(captured->ep),
1719 (VALUE)cref, /* cref or method */
1720 ISEQ_BODY(iseq)->iseq_encoded + opt_pc,
1721 ec->cfp->sp + arg_size,
1722 ISEQ_BODY(iseq)->local_table_size - arg_size,
1723 ISEQ_BODY(iseq)->stack_max);
1724}
1725
1726static inline void
1727invoke_bmethod(rb_execution_context_t *ec, const rb_iseq_t *iseq, VALUE self, const struct rb_captured_block *captured, const rb_callable_method_entry_t *me, VALUE type, int opt_pc)
1728{
1729 /* bmethod call from outside the VM */
1730 int arg_size = ISEQ_BODY(iseq)->param.size;
1731
1732 VM_ASSERT(me->def->type == VM_METHOD_TYPE_BMETHOD);
1733
1734 vm_push_frame(ec, iseq, type | VM_FRAME_FLAG_BMETHOD, self,
1735 VM_GUARDED_PREV_EP(captured->ep),
1736 (VALUE)me,
1737 ISEQ_BODY(iseq)->iseq_encoded + opt_pc,
1738 ec->cfp->sp + 1 /* self */ + arg_size,
1739 ISEQ_BODY(iseq)->local_table_size - arg_size,
1740 ISEQ_BODY(iseq)->stack_max);
1741
1742 VM_ENV_FLAGS_SET(ec->cfp->ep, VM_FRAME_FLAG_FINISH);
1743}
1744
1745ALWAYS_INLINE(static VALUE
1746 invoke_iseq_block_from_c(rb_execution_context_t *ec, const struct rb_captured_block *captured,
1747 VALUE self, int argc, const VALUE *argv, int kw_splat, VALUE passed_block_handler,
1748 const rb_cref_t *cref, int is_lambda, const rb_callable_method_entry_t *me));
1749
1750static inline VALUE
1751invoke_iseq_block_from_c(rb_execution_context_t *ec, const struct rb_captured_block *captured,
1752 VALUE self, int argc, const VALUE *argv, int kw_splat, VALUE passed_block_handler,
1753 const rb_cref_t *cref, int is_lambda, const rb_callable_method_entry_t *me)
1754{
1755 const rb_iseq_t *iseq = rb_iseq_check(captured->code.iseq);
1756 int opt_pc;
1757 VALUE type = VM_FRAME_MAGIC_BLOCK | (is_lambda ? VM_FRAME_FLAG_LAMBDA : 0);
1758 rb_control_frame_t *cfp = ec->cfp;
1759 VALUE *sp = cfp->sp;
1760 int flags = (kw_splat ? VM_CALL_KW_SPLAT : 0);
1761 VALUE *use_argv = (VALUE *)argv;
1762 VALUE av[2];
1763
1764 stack_check(ec);
1765
1766 if (UNLIKELY(argc > VM_ARGC_STACK_MAX) &&
1767 (VM_ARGC_STACK_MAX >= 1 ||
1768 /* Skip ruby array for potential autosplat case */
1769 (argc != 1 || is_lambda))) {
1770 use_argv = vm_argv_ruby_array(av, argv, &flags, &argc, kw_splat);
1771 }
1772
1773 CHECK_VM_STACK_OVERFLOW(cfp, argc + 1);
1774 vm_check_canary(ec, sp);
1775
1776 VALUE *stack_argv = sp;
1777 if (me) {
1778 *sp = self; // bemthods need `self` on the VM stack
1779 stack_argv++;
1780 }
1781 cfp->sp = stack_argv + argc;
1782 MEMCPY(stack_argv, use_argv, VALUE, argc); // restrict: new stack space
1783
1784 opt_pc = vm_yield_setup_args(ec, iseq, argc, stack_argv, flags, passed_block_handler,
1785 (is_lambda ? arg_setup_method : arg_setup_block));
1786 cfp->sp = sp;
1787
1788 if (me == NULL) {
1789 invoke_block(ec, iseq, self, captured, cref, type, opt_pc);
1790 }
1791 else {
1792 invoke_bmethod(ec, iseq, self, captured, me, type, opt_pc);
1793 }
1794
1795 return vm_exec(ec);
1796}
1797
1798static VALUE
1799invoke_block_from_c_bh(rb_execution_context_t *ec, VALUE block_handler,
1800 int argc, const VALUE *argv,
1801 int kw_splat, VALUE passed_block_handler, const rb_cref_t *cref,
1802 int is_lambda, int force_blockarg)
1803{
1804 again:
1805 switch (vm_block_handler_type(block_handler)) {
1806 case block_handler_type_iseq:
1807 {
1808 const struct rb_captured_block *captured = VM_BH_TO_ISEQ_BLOCK(block_handler);
1809 return invoke_iseq_block_from_c(ec, captured, captured->self,
1810 argc, argv, kw_splat, passed_block_handler,
1811 cref, is_lambda, NULL);
1812 }
1813 case block_handler_type_ifunc:
1814 return vm_yield_with_cfunc(ec, VM_BH_TO_IFUNC_BLOCK(block_handler),
1815 VM_BH_TO_IFUNC_BLOCK(block_handler)->self,
1816 argc, argv, kw_splat, passed_block_handler, NULL);
1817 case block_handler_type_symbol:
1818 return vm_yield_with_symbol(ec, VM_BH_TO_SYMBOL(block_handler),
1819 argc, argv, kw_splat, passed_block_handler);
1820 case block_handler_type_proc:
1821 if (force_blockarg == FALSE) {
1822 is_lambda = block_proc_is_lambda(VM_BH_TO_PROC(block_handler));
1823 }
1824 block_handler = vm_proc_to_block_handler(VM_BH_TO_PROC(block_handler));
1825 goto again;
1826 }
1827 VM_UNREACHABLE(invoke_block_from_c_splattable);
1828 return Qundef;
1829}
1830
1831static inline VALUE
1832check_block_handler(rb_execution_context_t *ec)
1833{
1834 VALUE block_handler = VM_CF_BLOCK_HANDLER(ec->cfp);
1835 vm_block_handler_verify(block_handler);
1836 if (UNLIKELY(block_handler == VM_BLOCK_HANDLER_NONE)) {
1837 rb_vm_localjump_error("no block given", Qnil, 0);
1838 }
1839
1840 return block_handler;
1841}
1842
1843static VALUE
1844vm_yield_with_cref(rb_execution_context_t *ec, int argc, const VALUE *argv, int kw_splat, const rb_cref_t *cref, int is_lambda)
1845{
1846 return invoke_block_from_c_bh(ec, check_block_handler(ec),
1847 argc, argv, kw_splat, VM_BLOCK_HANDLER_NONE,
1848 cref, is_lambda, FALSE);
1849}
1850
1851static VALUE
1852vm_yield(rb_execution_context_t *ec, int argc, const VALUE *argv, int kw_splat)
1853{
1854 return vm_yield_with_cref(ec, argc, argv, kw_splat, NULL, FALSE);
1855}
1856
1857static VALUE
1858vm_yield_with_block(rb_execution_context_t *ec, int argc, const VALUE *argv, VALUE block_handler, int kw_splat)
1859{
1860 return invoke_block_from_c_bh(ec, check_block_handler(ec),
1861 argc, argv, kw_splat, block_handler,
1862 NULL, FALSE, FALSE);
1863}
1864
1865static VALUE
1866vm_yield_force_blockarg(rb_execution_context_t *ec, VALUE args)
1867{
1868 return invoke_block_from_c_bh(ec, check_block_handler(ec), 1, &args,
1869 RB_NO_KEYWORDS, VM_BLOCK_HANDLER_NONE, NULL, FALSE, TRUE);
1870}
1871
1872ALWAYS_INLINE(static VALUE
1873 invoke_block_from_c_proc(rb_execution_context_t *ec, const rb_proc_t *proc,
1874 VALUE self, int argc, const VALUE *argv,
1875 int kw_splat, VALUE passed_block_handler, int is_lambda,
1876 const rb_callable_method_entry_t *me));
1877
1878static inline VALUE
1879invoke_block_from_c_proc(rb_execution_context_t *ec, const rb_proc_t *proc,
1880 VALUE self, int argc, const VALUE *argv,
1881 int kw_splat, VALUE passed_block_handler, int is_lambda,
1883{
1884 const struct rb_block *block = &proc->block;
1885
1886 again:
1887 switch (vm_block_type(block)) {
1888 case block_type_iseq:
1889 return invoke_iseq_block_from_c(ec, &block->as.captured, self, argc, argv, kw_splat, passed_block_handler, NULL, is_lambda, me);
1890 case block_type_ifunc:
1891 if (kw_splat == 1) {
1892 VALUE keyword_hash = argv[argc-1];
1893 if (!RB_TYPE_P(keyword_hash, T_HASH)) {
1894 keyword_hash = rb_to_hash_type(keyword_hash);
1895 }
1896 if (RHASH_EMPTY_P(keyword_hash)) {
1897 argc--;
1898 }
1899 else {
1900 ((VALUE *)argv)[argc-1] = rb_hash_dup(keyword_hash);
1901 }
1902 }
1903 return vm_yield_with_cfunc(ec, &block->as.captured, self, argc, argv, kw_splat, passed_block_handler, me);
1904 case block_type_symbol:
1905 return vm_yield_with_symbol(ec, block->as.symbol, argc, argv, kw_splat, passed_block_handler);
1906 case block_type_proc:
1907 is_lambda = block_proc_is_lambda(block->as.proc);
1908 block = vm_proc_block(block->as.proc);
1909 goto again;
1910 }
1911 VM_UNREACHABLE(invoke_block_from_c_proc);
1912 return Qundef;
1913}
1914
1915static VALUE
1916vm_invoke_proc(rb_execution_context_t *ec, rb_proc_t *proc, VALUE self,
1917 int argc, const VALUE *argv, int kw_splat, VALUE passed_block_handler)
1918{
1919 return invoke_block_from_c_proc(ec, proc, self, argc, argv, kw_splat, passed_block_handler, proc->is_lambda, NULL);
1920}
1921
1922static VALUE
1923vm_invoke_bmethod(rb_execution_context_t *ec, rb_proc_t *proc, VALUE self,
1924 int argc, const VALUE *argv, int kw_splat, VALUE block_handler, const rb_callable_method_entry_t *me)
1925{
1926 return invoke_block_from_c_proc(ec, proc, self, argc, argv, kw_splat, block_handler, TRUE, me);
1927}
1928
1929VALUE
1930rb_vm_invoke_proc(rb_execution_context_t *ec, rb_proc_t *proc,
1931 int argc, const VALUE *argv, int kw_splat, VALUE passed_block_handler)
1932{
1933 VALUE self = vm_block_self(&proc->block);
1934 vm_block_handler_verify(passed_block_handler);
1935
1936 if (proc->is_from_method) {
1937 return vm_invoke_bmethod(ec, proc, self, argc, argv, kw_splat, passed_block_handler, NULL);
1938 }
1939 else {
1940 return vm_invoke_proc(ec, proc, self, argc, argv, kw_splat, passed_block_handler);
1941 }
1942}
1943
1944VALUE
1945rb_vm_invoke_proc_with_self(rb_execution_context_t *ec, rb_proc_t *proc, VALUE self,
1946 int argc, const VALUE *argv, int kw_splat, VALUE passed_block_handler)
1947{
1948 vm_block_handler_verify(passed_block_handler);
1949
1950 if (proc->is_from_method) {
1951 return vm_invoke_bmethod(ec, proc, self, argc, argv, kw_splat, passed_block_handler, NULL);
1952 }
1953 else {
1954 return vm_invoke_proc(ec, proc, self, argc, argv, kw_splat, passed_block_handler);
1955 }
1956}
1957
1958/* special variable */
1959
1960VALUE *
1961rb_vm_svar_lep(const rb_execution_context_t *ec, const rb_control_frame_t *cfp)
1962{
1963 while (cfp->pc == 0 || cfp->iseq == 0) {
1964 if (VM_FRAME_TYPE(cfp) == VM_FRAME_MAGIC_IFUNC) {
1965 struct vm_ifunc *ifunc = (struct vm_ifunc *)cfp->iseq;
1966 return ifunc->svar_lep;
1967 }
1968 else {
1969 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
1970 }
1971
1972 if (RUBY_VM_CONTROL_FRAME_STACK_OVERFLOW_P(ec, cfp)) {
1973 return NULL;
1974 }
1975 }
1976
1977 return (VALUE *)VM_CF_LEP(cfp);
1978}
1979
1980static VALUE
1981vm_cfp_svar_get(const rb_execution_context_t *ec, rb_control_frame_t *cfp, VALUE key)
1982{
1983 return lep_svar_get(ec, rb_vm_svar_lep(ec, cfp), key);
1984}
1985
1986static void
1987vm_cfp_svar_set(const rb_execution_context_t *ec, rb_control_frame_t *cfp, VALUE key, const VALUE val)
1988{
1989 lep_svar_set(ec, rb_vm_svar_lep(ec, cfp), key, val);
1990}
1991
1992static VALUE
1993vm_svar_get(const rb_execution_context_t *ec, VALUE key)
1994{
1995 return vm_cfp_svar_get(ec, ec->cfp, key);
1996}
1997
1998static void
1999vm_svar_set(const rb_execution_context_t *ec, VALUE key, VALUE val)
2000{
2001 vm_cfp_svar_set(ec, ec->cfp, key, val);
2002}
2003
2004VALUE
2006{
2007 return vm_svar_get(GET_EC(), VM_SVAR_BACKREF);
2008}
2009
2010void
2012{
2013 vm_svar_set(GET_EC(), VM_SVAR_BACKREF, val);
2014}
2015
2016VALUE
2018{
2019 return vm_svar_get(GET_EC(), VM_SVAR_LASTLINE);
2020}
2021
2022void
2024{
2025 vm_svar_set(GET_EC(), VM_SVAR_LASTLINE, val);
2026}
2027
2028void
2029rb_lastline_set_up(VALUE val, unsigned int up)
2030{
2031 rb_control_frame_t * cfp = GET_EC()->cfp;
2032
2033 for(unsigned int i = 0; i < up; i++) {
2034 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
2035 }
2036 vm_cfp_svar_set(GET_EC(), cfp, VM_SVAR_LASTLINE, val);
2037}
2038
2039/* misc */
2040
2041const char *
2043{
2044 const rb_execution_context_t *ec = GET_EC();
2045 const rb_control_frame_t *cfp = rb_vm_get_ruby_level_next_cfp(ec, ec->cfp);
2046
2047 if (cfp) {
2048 return RSTRING_PTR(rb_iseq_path(cfp->iseq));
2049 }
2050 else {
2051 return 0;
2052 }
2053}
2054
2055int
2057{
2058 const rb_execution_context_t *ec = GET_EC();
2059 const rb_control_frame_t *cfp = rb_vm_get_ruby_level_next_cfp(ec, ec->cfp);
2060
2061 if (cfp) {
2062 return rb_vm_get_sourceline(cfp);
2063 }
2064 else {
2065 return 0;
2066 }
2067}
2068
2069VALUE
2070rb_source_location(int *pline)
2071{
2072 const rb_execution_context_t *ec = GET_EC();
2073 const rb_control_frame_t *cfp = rb_vm_get_ruby_level_next_cfp(ec, ec->cfp);
2074
2075 if (cfp && VM_FRAME_RUBYFRAME_P(cfp)) {
2076 if (pline) *pline = rb_vm_get_sourceline(cfp);
2077 return rb_iseq_path(cfp->iseq);
2078 }
2079 else {
2080 if (pline) *pline = 0;
2081 return Qnil;
2082 }
2083}
2084
2085const char *
2086rb_source_location_cstr(int *pline)
2087{
2088 VALUE path = rb_source_location(pline);
2089 if (NIL_P(path)) return NULL;
2090 return RSTRING_PTR(path);
2091}
2092
2093rb_cref_t *
2094rb_vm_cref(void)
2095{
2096 const rb_execution_context_t *ec = GET_EC();
2097 return vm_ec_cref(ec);
2098}
2099
2100rb_cref_t *
2101rb_vm_cref_replace_with_duplicated_cref(void)
2102{
2103 const rb_execution_context_t *ec = GET_EC();
2104 const rb_control_frame_t *cfp = rb_vm_get_ruby_level_next_cfp(ec, ec->cfp);
2105 rb_cref_t *cref = vm_cref_replace_with_duplicated_cref(cfp->ep);
2106 ASSUME(cref);
2107 return cref;
2108}
2109
2110const rb_cref_t *
2111rb_vm_cref_in_context(VALUE self, VALUE cbase)
2112{
2113 const rb_execution_context_t *ec = GET_EC();
2114 const rb_control_frame_t *cfp = rb_vm_get_ruby_level_next_cfp(ec, ec->cfp);
2115 const rb_cref_t *cref;
2116 if (!cfp || cfp->self != self) return NULL;
2117 if (!vm_env_cref_by_cref(cfp->ep)) return NULL;
2118 cref = vm_get_cref(cfp->ep);
2119 if (CREF_CLASS(cref) != cbase) return NULL;
2120 return cref;
2121}
2122
2123#if 0
2124void
2125debug_cref(rb_cref_t *cref)
2126{
2127 while (cref) {
2128 dp(CREF_CLASS(cref));
2129 printf("%ld\n", CREF_VISI(cref));
2130 cref = CREF_NEXT(cref);
2131 }
2132}
2133#endif
2134
2135VALUE
2136rb_vm_cbase(void)
2137{
2138 const rb_execution_context_t *ec = GET_EC();
2139 const rb_control_frame_t *cfp = rb_vm_get_ruby_level_next_cfp(ec, ec->cfp);
2140
2141 if (cfp == 0) {
2142 rb_raise(rb_eRuntimeError, "Can't call on top of Fiber or Thread");
2143 }
2144 return vm_get_cbase(cfp->ep);
2145}
2146
2147/* jump */
2148
2149static VALUE
2150make_localjump_error(const char *mesg, VALUE value, int reason)
2151{
2154 ID id;
2155
2156 switch (reason) {
2157 case TAG_BREAK:
2158 CONST_ID(id, "break");
2159 break;
2160 case TAG_REDO:
2161 CONST_ID(id, "redo");
2162 break;
2163 case TAG_RETRY:
2164 CONST_ID(id, "retry");
2165 break;
2166 case TAG_NEXT:
2167 CONST_ID(id, "next");
2168 break;
2169 case TAG_RETURN:
2170 CONST_ID(id, "return");
2171 break;
2172 default:
2173 CONST_ID(id, "noreason");
2174 break;
2175 }
2176 rb_iv_set(exc, "@exit_value", value);
2177 rb_iv_set(exc, "@reason", ID2SYM(id));
2178 return exc;
2179}
2180
2181void
2182rb_vm_localjump_error(const char *mesg, VALUE value, int reason)
2183{
2184 VALUE exc = make_localjump_error(mesg, value, reason);
2185 rb_exc_raise(exc);
2186}
2187
2188VALUE
2189rb_vm_make_jump_tag_but_local_jump(enum ruby_tag_type state, VALUE val)
2190{
2191 const char *mesg;
2192
2193 switch (state) {
2194 case TAG_RETURN:
2195 mesg = "unexpected return";
2196 break;
2197 case TAG_BREAK:
2198 mesg = "unexpected break";
2199 break;
2200 case TAG_NEXT:
2201 mesg = "unexpected next";
2202 break;
2203 case TAG_REDO:
2204 mesg = "unexpected redo";
2205 val = Qnil;
2206 break;
2207 case TAG_RETRY:
2208 mesg = "retry outside of rescue clause";
2209 val = Qnil;
2210 break;
2211 default:
2212 return Qnil;
2213 }
2214 if (UNDEF_P(val)) {
2215 val = GET_EC()->tag->retval;
2216 }
2217 return make_localjump_error(mesg, val, state);
2218}
2219
2220void
2221rb_vm_jump_tag_but_local_jump(enum ruby_tag_type state)
2222{
2223 VALUE exc = rb_vm_make_jump_tag_but_local_jump(state, Qundef);
2224 if (!NIL_P(exc)) rb_exc_raise(exc);
2225 EC_JUMP_TAG(GET_EC(), state);
2226}
2227
2228static rb_control_frame_t *
2229next_not_local_frame(rb_control_frame_t *cfp)
2230{
2231 while (VM_ENV_LOCAL_P(cfp->ep)) {
2232 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
2233 }
2234 return cfp;
2235}
2236
2237NORETURN(static void vm_iter_break(rb_execution_context_t *ec, VALUE val));
2238
2239static void
2240vm_iter_break(rb_execution_context_t *ec, VALUE val)
2241{
2242 rb_control_frame_t *cfp = next_not_local_frame(ec->cfp);
2243 const VALUE *ep = VM_CF_PREV_EP(cfp);
2244 const rb_control_frame_t *target_cfp = rb_vm_search_cf_from_ep(ec, cfp, ep);
2245
2246 if (!target_cfp) {
2247 rb_vm_localjump_error("unexpected break", val, TAG_BREAK);
2248 }
2249
2250 ec->errinfo = (VALUE)THROW_DATA_NEW(val, target_cfp, TAG_BREAK);
2251 EC_JUMP_TAG(ec, TAG_BREAK);
2252}
2253
2254void
2256{
2257 vm_iter_break(GET_EC(), Qnil);
2258}
2259
2260void
2262{
2263 vm_iter_break(GET_EC(), val);
2264}
2265
2266/* optimization: redefine management */
2267
2268short ruby_vm_redefined_flag[BOP_LAST_];
2269static st_table *vm_opt_method_def_table = 0;
2270static st_table *vm_opt_mid_table = 0;
2271
2272void
2273rb_free_vm_opt_tables(void)
2274{
2275 st_free_table(vm_opt_method_def_table);
2276 st_free_table(vm_opt_mid_table);
2277}
2278
2279static int
2280vm_redefinition_check_flag(VALUE klass)
2281{
2282 if (klass == rb_cInteger) return INTEGER_REDEFINED_OP_FLAG;
2283 if (klass == rb_cFloat) return FLOAT_REDEFINED_OP_FLAG;
2284 if (klass == rb_cString) return STRING_REDEFINED_OP_FLAG;
2285 if (klass == rb_cArray) return ARRAY_REDEFINED_OP_FLAG;
2286 if (klass == rb_cHash) return HASH_REDEFINED_OP_FLAG;
2287 if (klass == rb_cSymbol) return SYMBOL_REDEFINED_OP_FLAG;
2288#if 0
2289 if (klass == rb_cTime) return TIME_REDEFINED_OP_FLAG;
2290#endif
2291 if (klass == rb_cRegexp) return REGEXP_REDEFINED_OP_FLAG;
2292 if (klass == rb_cNilClass) return NIL_REDEFINED_OP_FLAG;
2293 if (klass == rb_cTrueClass) return TRUE_REDEFINED_OP_FLAG;
2294 if (klass == rb_cFalseClass) return FALSE_REDEFINED_OP_FLAG;
2295 if (klass == rb_cProc) return PROC_REDEFINED_OP_FLAG;
2296 return 0;
2297}
2298
2299int
2300rb_vm_check_optimizable_mid(VALUE mid)
2301{
2302 if (!vm_opt_mid_table) {
2303 return FALSE;
2304 }
2305
2306 return st_lookup(vm_opt_mid_table, mid, NULL);
2307}
2308
2309static int
2310vm_redefinition_check_method_type(const rb_method_entry_t *me)
2311{
2312 if (me->called_id != me->def->original_id) {
2313 return FALSE;
2314 }
2315
2316 if (METHOD_ENTRY_BASIC(me)) return TRUE;
2317
2318 const rb_method_definition_t *def = me->def;
2319 switch (def->type) {
2320 case VM_METHOD_TYPE_CFUNC:
2321 case VM_METHOD_TYPE_OPTIMIZED:
2322 return TRUE;
2323 default:
2324 return FALSE;
2325 }
2326}
2327
2328static void
2329rb_vm_check_redefinition_opt_method(const rb_method_entry_t *me, VALUE klass)
2330{
2331 st_data_t bop;
2332 if (RB_TYPE_P(klass, T_ICLASS) && RICLASS_IS_ORIGIN_P(klass) &&
2333 RB_TYPE_P(RBASIC_CLASS(klass), T_CLASS)) {
2334 klass = RBASIC_CLASS(klass);
2335 }
2336 if (vm_redefinition_check_method_type(me)) {
2337 if (st_lookup(vm_opt_method_def_table, (st_data_t)me->def, &bop)) {
2338 int flag = vm_redefinition_check_flag(klass);
2339 if (flag != 0) {
2342 "Redefining '%s#%s' disables interpreter and JIT optimizations",
2343 rb_class2name(me->owner),
2344 rb_id2name(me->called_id)
2345 );
2346 rb_yjit_bop_redefined(flag, (enum ruby_basic_operators)bop);
2347 rb_zjit_bop_redefined(flag, (enum ruby_basic_operators)bop);
2348 ruby_vm_redefined_flag[bop] |= flag;
2349 }
2350 }
2351 }
2352}
2353
2354static enum rb_id_table_iterator_result
2355check_redefined_method(ID mid, VALUE value, void *data)
2356{
2357 VALUE klass = (VALUE)data;
2358 const rb_method_entry_t *me = (rb_method_entry_t *)value;
2359 const rb_method_entry_t *newme = rb_method_entry(klass, mid);
2360
2361 if (newme != me) rb_vm_check_redefinition_opt_method(me, me->owner);
2362
2363 return ID_TABLE_CONTINUE;
2364}
2365
2366void
2367rb_vm_check_redefinition_by_prepend(VALUE klass)
2368{
2369 if (!vm_redefinition_check_flag(klass)) return;
2370 rb_id_table_foreach(RCLASS_M_TBL(RCLASS_ORIGIN(klass)), check_redefined_method, (void *)klass);
2371}
2372
2373static void
2374add_opt_method_entry_bop(const rb_method_entry_t *me, ID mid, enum ruby_basic_operators bop)
2375{
2376 st_insert(vm_opt_method_def_table, (st_data_t)me->def, (st_data_t)bop);
2377 st_insert(vm_opt_mid_table, (st_data_t)mid, (st_data_t)Qtrue);
2378}
2379
2380static void
2381add_opt_method(VALUE klass, ID mid, enum ruby_basic_operators bop)
2382{
2383 const rb_method_entry_t *me = rb_method_entry_at(klass, mid);
2384
2385 if (me && vm_redefinition_check_method_type(me)) {
2386 add_opt_method_entry_bop(me, mid, bop);
2387 }
2388 else {
2389 rb_bug("undefined optimized method: %s", rb_id2name(mid));
2390 }
2391}
2392
2393static enum ruby_basic_operators vm_redefinition_bop_for_id(ID mid);
2394
2395static void
2396add_opt_method_entry(const rb_method_entry_t *me)
2397{
2398 if (me && vm_redefinition_check_method_type(me)) {
2399 ID mid = me->called_id;
2400 enum ruby_basic_operators bop = vm_redefinition_bop_for_id(mid);
2401 if ((int)bop >= 0) {
2402 add_opt_method_entry_bop(me, mid, bop);
2403 }
2404 }
2405}
2406
2407static void
2408vm_init_redefined_flag(void)
2409{
2410 ID mid;
2411 enum ruby_basic_operators bop;
2412
2413#define OP(mid_, bop_) (mid = id##mid_, bop = BOP_##bop_, ruby_vm_redefined_flag[bop] = 0)
2414#define C(k) add_opt_method(rb_c##k, mid, bop)
2415 OP(PLUS, PLUS), (C(Integer), C(Float), C(String), C(Array));
2416 OP(MINUS, MINUS), (C(Integer), C(Float));
2417 OP(MULT, MULT), (C(Integer), C(Float));
2418 OP(DIV, DIV), (C(Integer), C(Float));
2419 OP(MOD, MOD), (C(Integer), C(Float));
2420 OP(Eq, EQ), (C(Integer), C(Float), C(String), C(Symbol));
2421 OP(Eqq, EQQ), (C(Integer), C(Float), C(Symbol), C(String),
2422 C(NilClass), C(TrueClass), C(FalseClass));
2423 OP(LT, LT), (C(Integer), C(Float));
2424 OP(LE, LE), (C(Integer), C(Float));
2425 OP(GT, GT), (C(Integer), C(Float));
2426 OP(GE, GE), (C(Integer), C(Float));
2427 OP(LTLT, LTLT), (C(String), C(Array));
2428 OP(AREF, AREF), (C(Array), C(Hash), C(Integer));
2429 OP(ASET, ASET), (C(Array), C(Hash));
2430 OP(Length, LENGTH), (C(Array), C(String), C(Hash));
2431 OP(Size, SIZE), (C(Array), C(String), C(Hash));
2432 OP(EmptyP, EMPTY_P), (C(Array), C(String), C(Hash));
2433 OP(Succ, SUCC), (C(Integer), C(String));
2434 OP(EqTilde, MATCH), (C(Regexp), C(String));
2435 OP(Freeze, FREEZE), (C(String), C(Array), C(Hash));
2436 OP(UMinus, UMINUS), (C(String));
2437 OP(Max, MAX), (C(Array));
2438 OP(Min, MIN), (C(Array));
2439 OP(Hash, HASH), (C(Array));
2440 OP(Call, CALL), (C(Proc));
2441 OP(And, AND), (C(Integer));
2442 OP(Or, OR), (C(Integer));
2443 OP(NilP, NIL_P), (C(NilClass));
2444 OP(Cmp, CMP), (C(Integer), C(Float), C(String));
2445 OP(Default, DEFAULT), (C(Hash));
2446 OP(IncludeP, INCLUDE_P), (C(Array));
2447#undef C
2448#undef OP
2449}
2450
2451static enum ruby_basic_operators
2452vm_redefinition_bop_for_id(ID mid)
2453{
2454 switch (mid) {
2455#define OP(mid_, bop_) case id##mid_: return BOP_##bop_
2456 OP(PLUS, PLUS);
2457 OP(MINUS, MINUS);
2458 OP(MULT, MULT);
2459 OP(DIV, DIV);
2460 OP(MOD, MOD);
2461 OP(Eq, EQ);
2462 OP(Eqq, EQQ);
2463 OP(LT, LT);
2464 OP(LE, LE);
2465 OP(GT, GT);
2466 OP(GE, GE);
2467 OP(LTLT, LTLT);
2468 OP(AREF, AREF);
2469 OP(ASET, ASET);
2470 OP(Length, LENGTH);
2471 OP(Size, SIZE);
2472 OP(EmptyP, EMPTY_P);
2473 OP(Succ, SUCC);
2474 OP(EqTilde, MATCH);
2475 OP(Freeze, FREEZE);
2476 OP(UMinus, UMINUS);
2477 OP(Max, MAX);
2478 OP(Min, MIN);
2479 OP(Hash, HASH);
2480 OP(Call, CALL);
2481 OP(And, AND);
2482 OP(Or, OR);
2483 OP(NilP, NIL_P);
2484 OP(Cmp, CMP);
2485 OP(Default, DEFAULT);
2486 OP(Pack, PACK);
2487#undef OP
2488 }
2489 return -1;
2490}
2491
2492/* for vm development */
2493
2494#if VMDEBUG
2495static const char *
2496vm_frametype_name(const rb_control_frame_t *cfp)
2497{
2498 switch (VM_FRAME_TYPE(cfp)) {
2499 case VM_FRAME_MAGIC_METHOD: return "method";
2500 case VM_FRAME_MAGIC_BLOCK: return "block";
2501 case VM_FRAME_MAGIC_CLASS: return "class";
2502 case VM_FRAME_MAGIC_TOP: return "top";
2503 case VM_FRAME_MAGIC_CFUNC: return "cfunc";
2504 case VM_FRAME_MAGIC_IFUNC: return "ifunc";
2505 case VM_FRAME_MAGIC_EVAL: return "eval";
2506 case VM_FRAME_MAGIC_RESCUE: return "rescue";
2507 default:
2508 rb_bug("unknown frame");
2509 }
2510}
2511#endif
2512
2513static VALUE
2514frame_return_value(const struct vm_throw_data *err)
2515{
2516 if (THROW_DATA_P(err) &&
2517 THROW_DATA_STATE(err) == TAG_BREAK &&
2518 THROW_DATA_CONSUMED_P(err) == FALSE) {
2519 return THROW_DATA_VAL(err);
2520 }
2521 else {
2522 return Qnil;
2523 }
2524}
2525
2526#if 0
2527/* for debug */
2528static const char *
2529frame_name(const rb_control_frame_t *cfp)
2530{
2531 unsigned long type = VM_FRAME_TYPE(cfp);
2532#define C(t) if (type == VM_FRAME_MAGIC_##t) return #t
2533 C(METHOD);
2534 C(BLOCK);
2535 C(CLASS);
2536 C(TOP);
2537 C(CFUNC);
2538 C(PROC);
2539 C(IFUNC);
2540 C(EVAL);
2541 C(LAMBDA);
2542 C(RESCUE);
2543 C(DUMMY);
2544#undef C
2545 return "unknown";
2546}
2547#endif
2548
2549// cfp_returning_with_value:
2550// Whether cfp is the last frame in the unwinding process for a non-local return.
2551static void
2552hook_before_rewind(rb_execution_context_t *ec, bool cfp_returning_with_value, int state, struct vm_throw_data *err)
2553{
2554 if (state == TAG_RAISE && RBASIC(err)->klass == rb_eSysStackError) {
2555 return;
2556 }
2557 else {
2558 const rb_iseq_t *iseq = ec->cfp->iseq;
2559 rb_hook_list_t *local_hooks = iseq->aux.exec.local_hooks;
2560
2561 switch (VM_FRAME_TYPE(ec->cfp)) {
2562 case VM_FRAME_MAGIC_METHOD:
2563 RUBY_DTRACE_METHOD_RETURN_HOOK(ec, 0, 0);
2564 EXEC_EVENT_HOOK_AND_POP_FRAME(ec, RUBY_EVENT_RETURN, ec->cfp->self, 0, 0, 0, frame_return_value(err));
2565
2566 if (UNLIKELY(local_hooks && local_hooks->events & RUBY_EVENT_RETURN)) {
2567 rb_exec_event_hook_orig(ec, local_hooks, RUBY_EVENT_RETURN,
2568 ec->cfp->self, 0, 0, 0, frame_return_value(err), TRUE);
2569 }
2570
2571 THROW_DATA_CONSUMED_SET(err);
2572 break;
2573 case VM_FRAME_MAGIC_BLOCK:
2574 if (VM_FRAME_BMETHOD_P(ec->cfp)) {
2575 VALUE bmethod_return_value = frame_return_value(err);
2576 if (cfp_returning_with_value) {
2577 // Non-local return terminating at a BMETHOD control frame.
2578 bmethod_return_value = THROW_DATA_VAL(err);
2579 }
2580
2581
2582 EXEC_EVENT_HOOK_AND_POP_FRAME(ec, RUBY_EVENT_B_RETURN, ec->cfp->self, 0, 0, 0, bmethod_return_value);
2583 if (UNLIKELY(local_hooks && local_hooks->events & RUBY_EVENT_B_RETURN)) {
2584 rb_exec_event_hook_orig(ec, local_hooks, RUBY_EVENT_B_RETURN,
2585 ec->cfp->self, 0, 0, 0, bmethod_return_value, TRUE);
2586 }
2587
2588 const rb_callable_method_entry_t *me = rb_vm_frame_method_entry(ec->cfp);
2589
2590 EXEC_EVENT_HOOK_AND_POP_FRAME(ec, RUBY_EVENT_RETURN, ec->cfp->self,
2591 rb_vm_frame_method_entry(ec->cfp)->def->original_id,
2592 rb_vm_frame_method_entry(ec->cfp)->called_id,
2593 rb_vm_frame_method_entry(ec->cfp)->owner,
2594 bmethod_return_value);
2595
2596 VM_ASSERT(me->def->type == VM_METHOD_TYPE_BMETHOD);
2597 local_hooks = me->def->body.bmethod.hooks;
2598
2599 if (UNLIKELY(local_hooks && local_hooks->events & RUBY_EVENT_RETURN)) {
2600 rb_exec_event_hook_orig(ec, local_hooks, RUBY_EVENT_RETURN, ec->cfp->self,
2601 rb_vm_frame_method_entry(ec->cfp)->def->original_id,
2602 rb_vm_frame_method_entry(ec->cfp)->called_id,
2603 rb_vm_frame_method_entry(ec->cfp)->owner,
2604 bmethod_return_value, TRUE);
2605 }
2606 THROW_DATA_CONSUMED_SET(err);
2607 }
2608 else {
2609 EXEC_EVENT_HOOK_AND_POP_FRAME(ec, RUBY_EVENT_B_RETURN, ec->cfp->self, 0, 0, 0, frame_return_value(err));
2610 if (UNLIKELY(local_hooks && local_hooks->events & RUBY_EVENT_B_RETURN)) {
2611 rb_exec_event_hook_orig(ec, local_hooks, RUBY_EVENT_B_RETURN,
2612 ec->cfp->self, 0, 0, 0, frame_return_value(err), TRUE);
2613 }
2614 THROW_DATA_CONSUMED_SET(err);
2615 }
2616 break;
2617 case VM_FRAME_MAGIC_CLASS:
2618 EXEC_EVENT_HOOK_AND_POP_FRAME(ec, RUBY_EVENT_END, ec->cfp->self, 0, 0, 0, Qnil);
2619 break;
2620 }
2621 }
2622}
2623
2624/* evaluator body */
2625
2626/* finish
2627 VMe (h1) finish
2628 VM finish F1 F2
2629 cfunc finish F1 F2 C1
2630 rb_funcall finish F1 F2 C1
2631 VMe finish F1 F2 C1
2632 VM finish F1 F2 C1 F3
2633
2634 F1 - F3 : pushed by VM
2635 C1 : pushed by send insn (CFUNC)
2636
2637 struct CONTROL_FRAME {
2638 VALUE *pc; // cfp[0], program counter
2639 VALUE *sp; // cfp[1], stack pointer
2640 rb_iseq_t *iseq; // cfp[2], iseq
2641 VALUE self; // cfp[3], self
2642 const VALUE *ep; // cfp[4], env pointer
2643 const void *block_code; // cfp[5], block code
2644 };
2645
2646 struct rb_captured_block {
2647 VALUE self;
2648 VALUE *ep;
2649 union code;
2650 };
2651
2652 struct METHOD_ENV {
2653 VALUE param0;
2654 ...
2655 VALUE paramN;
2656 VALUE lvar1;
2657 ...
2658 VALUE lvarM;
2659 VALUE cref; // ep[-2]
2660 VALUE special; // ep[-1]
2661 VALUE flags; // ep[ 0] == lep[0]
2662 };
2663
2664 struct BLOCK_ENV {
2665 VALUE block_param0;
2666 ...
2667 VALUE block_paramN;
2668 VALUE block_lvar1;
2669 ...
2670 VALUE block_lvarM;
2671 VALUE cref; // ep[-2]
2672 VALUE special; // ep[-1]
2673 VALUE flags; // ep[ 0]
2674 };
2675
2676 struct CLASS_ENV {
2677 VALUE class_lvar0;
2678 ...
2679 VALUE class_lvarN;
2680 VALUE cref;
2681 VALUE prev_ep; // for frame jump
2682 VALUE flags;
2683 };
2684
2685 struct C_METHOD_CONTROL_FRAME {
2686 VALUE *pc; // 0
2687 VALUE *sp; // stack pointer
2688 rb_iseq_t *iseq; // cmi
2689 VALUE self; // ?
2690 VALUE *ep; // ep == lep
2691 void *code; //
2692 };
2693
2694 struct C_BLOCK_CONTROL_FRAME {
2695 VALUE *pc; // point only "finish" insn
2696 VALUE *sp; // sp
2697 rb_iseq_t *iseq; // ?
2698 VALUE self; //
2699 VALUE *ep; // ep
2700 void *code; //
2701 };
2702 */
2703
2704static inline VALUE
2705vm_exec_handle_exception(rb_execution_context_t *ec, enum ruby_tag_type state, VALUE errinfo);
2706static inline VALUE
2707vm_exec_loop(rb_execution_context_t *ec, enum ruby_tag_type state, struct rb_vm_tag *tag, VALUE result);
2708
2709// for non-Emscripten Wasm build, use vm_exec with optimized setjmp for runtime performance
2710#if defined(__wasm__) && !defined(__EMSCRIPTEN__)
2711
2712struct rb_vm_exec_context {
2713 rb_execution_context_t *const ec;
2714 struct rb_vm_tag *const tag;
2715
2716 VALUE result;
2717};
2718
2719static void
2720vm_exec_bottom_main(void *context)
2721{
2722 struct rb_vm_exec_context *ctx = context;
2723 rb_execution_context_t *ec = ctx->ec;
2724
2725 ctx->result = vm_exec_loop(ec, TAG_NONE, ctx->tag, vm_exec_core(ec));
2726}
2727
2728static void
2729vm_exec_bottom_rescue(void *context)
2730{
2731 struct rb_vm_exec_context *ctx = context;
2732 rb_execution_context_t *ec = ctx->ec;
2733
2734 ctx->result = vm_exec_loop(ec, rb_ec_tag_state(ec), ctx->tag, ec->errinfo);
2735}
2736#endif
2737
2738VALUE
2739vm_exec(rb_execution_context_t *ec)
2740{
2741 VALUE result = Qundef;
2742
2743 EC_PUSH_TAG(ec);
2744
2745 _tag.retval = Qnil;
2746
2747#if defined(__wasm__) && !defined(__EMSCRIPTEN__)
2748 struct rb_vm_exec_context ctx = {
2749 .ec = ec,
2750 .tag = &_tag,
2751 };
2752 struct rb_wasm_try_catch try_catch;
2753
2754 EC_REPUSH_TAG();
2755
2756 rb_wasm_try_catch_init(&try_catch, vm_exec_bottom_main, vm_exec_bottom_rescue, &ctx);
2757
2758 rb_wasm_try_catch_loop_run(&try_catch, &RB_VM_TAG_JMPBUF_GET(_tag.buf));
2759
2760 result = ctx.result;
2761#else
2762 enum ruby_tag_type state;
2763 if ((state = EC_EXEC_TAG()) == TAG_NONE) {
2764 if (UNDEF_P(result = jit_exec(ec))) {
2765 result = vm_exec_core(ec);
2766 }
2767 /* fallback to the VM */
2768 result = vm_exec_loop(ec, TAG_NONE, &_tag, result);
2769 }
2770 else {
2771 result = vm_exec_loop(ec, state, &_tag, ec->errinfo);
2772 }
2773#endif
2774
2775 EC_POP_TAG();
2776 return result;
2777}
2778
2779static inline VALUE
2780vm_exec_loop(rb_execution_context_t *ec, enum ruby_tag_type state,
2781 struct rb_vm_tag *tag, VALUE result)
2782{
2783 if (state == TAG_NONE) { /* no jumps, result is discarded */
2784 goto vm_loop_start;
2785 }
2786
2787 rb_ec_raised_reset(ec, RAISED_STACKOVERFLOW | RAISED_NOMEMORY);
2788 while (UNDEF_P(result = vm_exec_handle_exception(ec, state, result))) {
2789 // caught a jump, exec the handler. JIT code in jit_exec_exception()
2790 // may return Qundef to run remaining frames with vm_exec_core().
2791 if (UNDEF_P(result = jit_exec_exception(ec))) {
2792 result = vm_exec_core(ec);
2793 }
2794 vm_loop_start:
2795 VM_ASSERT(ec->tag == tag);
2796 /* when caught `throw`, `tag.state` is set. */
2797 if ((state = tag->state) == TAG_NONE) break;
2798 tag->state = TAG_NONE;
2799 }
2800
2801 return result;
2802}
2803
2804static inline VALUE
2805vm_exec_handle_exception(rb_execution_context_t *ec, enum ruby_tag_type state, VALUE errinfo)
2806{
2807 struct vm_throw_data *err = (struct vm_throw_data *)errinfo;
2808
2809 for (;;) {
2810 unsigned int i;
2811 const struct iseq_catch_table_entry *entry;
2812 const struct iseq_catch_table *ct;
2813 unsigned long epc, cont_pc, cont_sp;
2814 const rb_iseq_t *catch_iseq;
2815 VALUE type;
2816 const rb_control_frame_t *escape_cfp;
2817
2818 cont_pc = cont_sp = 0;
2819 catch_iseq = NULL;
2820
2821 while (ec->cfp->pc == 0 || ec->cfp->iseq == 0) {
2822 if (UNLIKELY(VM_FRAME_TYPE(ec->cfp) == VM_FRAME_MAGIC_CFUNC)) {
2823 EXEC_EVENT_HOOK_AND_POP_FRAME(ec, RUBY_EVENT_C_RETURN, ec->cfp->self,
2824 rb_vm_frame_method_entry(ec->cfp)->def->original_id,
2825 rb_vm_frame_method_entry(ec->cfp)->called_id,
2826 rb_vm_frame_method_entry(ec->cfp)->owner, Qnil);
2827 RUBY_DTRACE_CMETHOD_RETURN_HOOK(ec,
2828 rb_vm_frame_method_entry(ec->cfp)->owner,
2829 rb_vm_frame_method_entry(ec->cfp)->def->original_id);
2830 }
2831 rb_vm_pop_frame(ec);
2832 }
2833
2834 rb_control_frame_t *const cfp = ec->cfp;
2835 epc = cfp->pc - ISEQ_BODY(cfp->iseq)->iseq_encoded;
2836
2837 escape_cfp = NULL;
2838 if (state == TAG_BREAK || state == TAG_RETURN) {
2839 escape_cfp = THROW_DATA_CATCH_FRAME(err);
2840
2841 if (cfp == escape_cfp) {
2842 if (state == TAG_RETURN) {
2843 if (!VM_FRAME_FINISHED_P(cfp)) {
2844 THROW_DATA_CATCH_FRAME_SET(err, cfp + 1);
2845 THROW_DATA_STATE_SET(err, state = TAG_BREAK);
2846 }
2847 else {
2848 ct = ISEQ_BODY(cfp->iseq)->catch_table;
2849 if (ct) for (i = 0; i < ct->size; i++) {
2850 entry = UNALIGNED_MEMBER_PTR(ct, entries[i]);
2851 if (entry->start < epc && entry->end >= epc) {
2852 if (entry->type == CATCH_TYPE_ENSURE) {
2853 catch_iseq = entry->iseq;
2854 cont_pc = entry->cont;
2855 cont_sp = entry->sp;
2856 break;
2857 }
2858 }
2859 }
2860 if (catch_iseq == NULL) {
2861 ec->errinfo = Qnil;
2862 THROW_DATA_CATCH_FRAME_SET(err, cfp + 1);
2863 // cfp == escape_cfp here so calling with cfp_returning_with_value = true
2864 hook_before_rewind(ec, true, state, err);
2865 rb_vm_pop_frame(ec);
2866 return THROW_DATA_VAL(err);
2867 }
2868 }
2869 /* through */
2870 }
2871 else {
2872 /* TAG_BREAK */
2873 *cfp->sp++ = THROW_DATA_VAL(err);
2874 ec->errinfo = Qnil;
2875 return Qundef;
2876 }
2877 }
2878 }
2879
2880 if (state == TAG_RAISE) {
2881 ct = ISEQ_BODY(cfp->iseq)->catch_table;
2882 if (ct) for (i = 0; i < ct->size; i++) {
2883 entry = UNALIGNED_MEMBER_PTR(ct, entries[i]);
2884 if (entry->start < epc && entry->end >= epc) {
2885
2886 if (entry->type == CATCH_TYPE_RESCUE ||
2887 entry->type == CATCH_TYPE_ENSURE) {
2888 catch_iseq = entry->iseq;
2889 cont_pc = entry->cont;
2890 cont_sp = entry->sp;
2891 break;
2892 }
2893 }
2894 }
2895 }
2896 else if (state == TAG_RETRY) {
2897 ct = ISEQ_BODY(cfp->iseq)->catch_table;
2898 if (ct) for (i = 0; i < ct->size; i++) {
2899 entry = UNALIGNED_MEMBER_PTR(ct, entries[i]);
2900 if (entry->start < epc && entry->end >= epc) {
2901
2902 if (entry->type == CATCH_TYPE_ENSURE) {
2903 catch_iseq = entry->iseq;
2904 cont_pc = entry->cont;
2905 cont_sp = entry->sp;
2906 break;
2907 }
2908 else if (entry->type == CATCH_TYPE_RETRY) {
2909 const rb_control_frame_t *escape_cfp;
2910 escape_cfp = THROW_DATA_CATCH_FRAME(err);
2911 if (cfp == escape_cfp) {
2912 cfp->pc = ISEQ_BODY(cfp->iseq)->iseq_encoded + entry->cont;
2913 ec->errinfo = Qnil;
2914 return Qundef;
2915 }
2916 }
2917 }
2918 }
2919 }
2920 else if ((state == TAG_BREAK && !escape_cfp) ||
2921 (state == TAG_REDO) ||
2922 (state == TAG_NEXT)) {
2923 type = (const enum rb_catch_type[TAG_MASK]) {
2924 [TAG_BREAK] = CATCH_TYPE_BREAK,
2925 [TAG_NEXT] = CATCH_TYPE_NEXT,
2926 [TAG_REDO] = CATCH_TYPE_REDO,
2927 /* otherwise = dontcare */
2928 }[state];
2929
2930 ct = ISEQ_BODY(cfp->iseq)->catch_table;
2931 if (ct) for (i = 0; i < ct->size; i++) {
2932 entry = UNALIGNED_MEMBER_PTR(ct, entries[i]);
2933
2934 if (entry->start < epc && entry->end >= epc) {
2935 if (entry->type == CATCH_TYPE_ENSURE) {
2936 catch_iseq = entry->iseq;
2937 cont_pc = entry->cont;
2938 cont_sp = entry->sp;
2939 break;
2940 }
2941 else if (entry->type == type) {
2942 cfp->pc = ISEQ_BODY(cfp->iseq)->iseq_encoded + entry->cont;
2943 cfp->sp = vm_base_ptr(cfp) + entry->sp;
2944
2945 if (state != TAG_REDO) {
2946 *cfp->sp++ = THROW_DATA_VAL(err);
2947 }
2948 ec->errinfo = Qnil;
2949 VM_ASSERT(ec->tag->state == TAG_NONE);
2950 return Qundef;
2951 }
2952 }
2953 }
2954 }
2955 else {
2956 ct = ISEQ_BODY(cfp->iseq)->catch_table;
2957 if (ct) for (i = 0; i < ct->size; i++) {
2958 entry = UNALIGNED_MEMBER_PTR(ct, entries[i]);
2959 if (entry->start < epc && entry->end >= epc) {
2960
2961 if (entry->type == CATCH_TYPE_ENSURE) {
2962 catch_iseq = entry->iseq;
2963 cont_pc = entry->cont;
2964 cont_sp = entry->sp;
2965 break;
2966 }
2967 }
2968 }
2969 }
2970
2971 if (catch_iseq != NULL) { /* found catch table */
2972 /* enter catch scope */
2973 const int arg_size = 1;
2974
2975 rb_iseq_check(catch_iseq);
2976 cfp->sp = vm_base_ptr(cfp) + cont_sp;
2977 cfp->pc = ISEQ_BODY(cfp->iseq)->iseq_encoded + cont_pc;
2978
2979 /* push block frame */
2980 cfp->sp[0] = (VALUE)err;
2981 vm_push_frame(ec, catch_iseq, VM_FRAME_MAGIC_RESCUE,
2982 cfp->self,
2983 VM_GUARDED_PREV_EP(cfp->ep),
2984 0, /* cref or me */
2985 ISEQ_BODY(catch_iseq)->iseq_encoded,
2986 cfp->sp + arg_size /* push value */,
2987 ISEQ_BODY(catch_iseq)->local_table_size - arg_size,
2988 ISEQ_BODY(catch_iseq)->stack_max);
2989
2990 state = 0;
2991 ec->tag->state = TAG_NONE;
2992 ec->errinfo = Qnil;
2993
2994 return Qundef;
2995 }
2996 else {
2997 hook_before_rewind(ec, (cfp == escape_cfp), state, err);
2998
2999 if (VM_FRAME_FINISHED_P(ec->cfp)) {
3000 rb_vm_pop_frame(ec);
3001 ec->errinfo = (VALUE)err;
3002 rb_vm_tag_jmpbuf_deinit(&ec->tag->buf);
3003 ec->tag = ec->tag->prev;
3004 EC_JUMP_TAG(ec, state);
3005 }
3006 else {
3007 rb_vm_pop_frame(ec);
3008 }
3009 }
3010 }
3011}
3012
3013/* misc */
3014
3015VALUE
3016rb_iseq_eval(const rb_iseq_t *iseq, const rb_namespace_t *ns)
3017{
3018 rb_execution_context_t *ec = GET_EC();
3019 VALUE val;
3020 vm_set_top_stack(ec, iseq, ns);
3021 val = vm_exec(ec);
3022 return val;
3023}
3024
3025VALUE
3026rb_iseq_eval_main(const rb_iseq_t *iseq)
3027{
3028 rb_execution_context_t *ec = GET_EC();
3029 VALUE val;
3030 vm_set_main_stack(ec, iseq);
3031 val = vm_exec(ec);
3032 return val;
3033}
3034
3035int
3036rb_vm_control_frame_id_and_class(const rb_control_frame_t *cfp, ID *idp, ID *called_idp, VALUE *klassp)
3037{
3038 const rb_callable_method_entry_t *me = rb_vm_frame_method_entry(cfp);
3039
3040 if (me) {
3041 if (idp) *idp = me->def->original_id;
3042 if (called_idp) *called_idp = me->called_id;
3043 if (klassp) *klassp = me->owner;
3044 return TRUE;
3045 }
3046 else {
3047 return FALSE;
3048 }
3049}
3050
3051int
3052rb_ec_frame_method_id_and_class(const rb_execution_context_t *ec, ID *idp, ID *called_idp, VALUE *klassp)
3053{
3054 return rb_vm_control_frame_id_and_class(ec->cfp, idp, called_idp, klassp);
3055}
3056
3057int
3059{
3060 return rb_ec_frame_method_id_and_class(GET_EC(), idp, 0, klassp);
3061}
3062
3063VALUE
3064rb_vm_call_cfunc(VALUE recv, VALUE (*func)(VALUE), VALUE arg,
3065 VALUE block_handler, VALUE filename)
3066{
3067 rb_execution_context_t *ec = GET_EC();
3068 const rb_control_frame_t *reg_cfp = ec->cfp;
3069 const rb_iseq_t *iseq = rb_iseq_new(Qnil, filename, filename, Qnil, 0, ISEQ_TYPE_TOP);
3070 const rb_namespace_t *ns = rb_current_namespace();
3071 VALUE val;
3072
3073 vm_push_frame(ec, iseq, VM_FRAME_MAGIC_TOP | VM_ENV_FLAG_LOCAL | VM_FRAME_FLAG_FINISH,
3074 recv, GC_GUARDED_PTR(ns),
3075 (VALUE)vm_cref_new_toplevel(ec), /* cref or me */
3076 0, reg_cfp->sp, 0, 0);
3077
3078 val = (*func)(arg);
3079
3080 rb_vm_pop_frame(ec);
3081 return val;
3082}
3083
3084/* namespace */
3085
3086VALUE
3087rb_vm_call_cfunc_in_namespace(VALUE recv, VALUE (*func)(VALUE, VALUE), VALUE arg1, VALUE arg2,
3088 VALUE filename, const rb_namespace_t *ns)
3089{
3090 rb_execution_context_t *ec = GET_EC();
3091 const rb_control_frame_t *reg_cfp = ec->cfp;
3092 const rb_iseq_t *iseq = rb_iseq_new(Qnil, filename, filename, Qnil, 0, ISEQ_TYPE_TOP);
3093 VALUE val;
3094
3095 vm_push_frame(ec, iseq, VM_FRAME_MAGIC_TOP | VM_ENV_FLAG_LOCAL | VM_FRAME_FLAG_FINISH,
3096 recv, GC_GUARDED_PTR(ns),
3097 (VALUE)vm_cref_new_toplevel(ec), /* cref or me */
3098 0, reg_cfp->sp, 0, 0);
3099
3100 val = (*func)(arg1, arg2);
3101
3102 rb_vm_pop_frame(ec);
3103 return val;
3104}
3105
3106void
3107rb_vm_frame_flag_set_ns_require(const rb_execution_context_t *ec)
3108{
3109 VM_ASSERT(rb_namespace_available());
3110 VM_ENV_FLAGS_SET(ec->cfp->ep, VM_FRAME_FLAG_NS_REQUIRE);
3111}
3112
3113static const rb_namespace_t *
3114current_namespace_on_cfp(const rb_execution_context_t *ec, const rb_control_frame_t *cfp)
3115{
3117 const rb_namespace_t *ns;
3118 const VALUE *lep = VM_EP_RUBY_LEP(ec, cfp);
3119 VM_NAMESPACE_ASSERT(lep, "lep should be valid");
3120 VM_NAMESPACE_ASSERT(rb_namespace_available(), "namespace should be available here");
3121
3122 if (VM_ENV_FRAME_TYPE_P(lep, VM_FRAME_MAGIC_METHOD) || VM_ENV_FRAME_TYPE_P(lep, VM_FRAME_MAGIC_CFUNC)) {
3123 cme = check_method_entry(lep[VM_ENV_DATA_INDEX_ME_CREF], TRUE);
3124 VM_NAMESPACE_ASSERT(cme, "cme should be valid");
3125 VM_NAMESPACE_ASSERT(cme->def, "cme->def shold be valid");
3126 return cme->def->ns;
3127 }
3128 else if (VM_ENV_FRAME_TYPE_P(lep, VM_FRAME_MAGIC_TOP) || VM_ENV_FRAME_TYPE_P(lep, VM_FRAME_MAGIC_CLASS)) {
3129 VM_NAMESPACE_ASSERT(VM_ENV_LOCAL_P(lep), "lep should be local on MAGIC_TOP or MAGIC_CLASS frames");
3130 return VM_ENV_NAMESPACE(lep);
3131 }
3132 else if (VM_ENV_FRAME_TYPE_P(lep, VM_FRAME_MAGIC_DUMMY)) {
3133 // No valid local ep found (just after process boot?)
3134 // return the root namespace (the only valid namespace) until the main is initialized
3135 ns = rb_main_namespace();
3136 if (ns)
3137 return ns;
3138 return rb_root_namespace();
3139 }
3140 else {
3141 VM_NAMESPACE_CRASHED();
3142 rb_bug("BUG: Local ep without cme/namespace, flags: %08lX", (unsigned long)lep[VM_ENV_DATA_INDEX_FLAGS]);
3143 }
3145}
3146
3147const rb_namespace_t *
3148rb_vm_current_namespace(const rb_execution_context_t *ec)
3149{
3150 return current_namespace_on_cfp(ec, ec->cfp);
3151}
3152
3153static const rb_control_frame_t *
3154find_loader_control_frame(const rb_execution_context_t *ec, const rb_control_frame_t *cfp, const rb_control_frame_t *end_cfp)
3155{
3156 while (RUBY_VM_VALID_CONTROL_FRAME_P(cfp, end_cfp)) {
3157 if (!VM_ENV_FRAME_TYPE_P(cfp->ep, VM_FRAME_MAGIC_CFUNC))
3158 break;
3159 if (!NAMESPACE_ROOT_P(current_namespace_on_cfp(ec, cfp)))
3160 break;
3161 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
3162 }
3163 VM_ASSERT(RUBY_VM_VALID_CONTROL_FRAME_P(cfp, end_cfp));
3164 return cfp;
3165}
3166
3167const rb_namespace_t *
3168rb_vm_loading_namespace(const rb_execution_context_t *ec)
3169{
3170 const rb_control_frame_t *cfp, *current_cfp, *end_cfp;
3171
3172 if (!rb_namespace_available() || !ec)
3173 return rb_root_namespace();
3174
3175 cfp = ec->cfp;
3176 current_cfp = cfp;
3177 end_cfp = RUBY_VM_END_CONTROL_FRAME(ec);
3178
3179 while (RUBY_VM_VALID_CONTROL_FRAME_P(cfp, end_cfp)) {
3180 if (VM_ENV_FLAGS(cfp->ep, VM_FRAME_FLAG_NS_REQUIRE)) {
3181 if (RTEST(cfp->self) && NAMESPACE_OBJ_P(cfp->self)) {
3182 // Namespace#require, #require_relative, #load
3183 return rb_get_namespace_t(cfp->self);
3184 }
3185 // Kernel#require, #require_relative, #load
3186 cfp = find_loader_control_frame(ec, cfp, end_cfp);
3187 return current_namespace_on_cfp(ec, cfp);
3188 }
3189 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
3190 }
3191 // no require/load with explicit namespaces.
3192 return current_namespace_on_cfp(ec, current_cfp);
3193}
3194
3195/* vm */
3196
3197void
3198rb_vm_update_references(void *ptr)
3199{
3200 if (ptr) {
3201 rb_vm_t *vm = ptr;
3202
3203 vm->self = rb_gc_location(vm->self);
3204 vm->mark_object_ary = rb_gc_location(vm->mark_object_ary);
3205 vm->orig_progname = rb_gc_location(vm->orig_progname);
3206
3207 if (vm->root_namespace)
3208 rb_namespace_gc_update_references(vm->root_namespace);
3209 if (vm->main_namespace)
3210 rb_namespace_gc_update_references(vm->main_namespace);
3211
3212 rb_gc_update_values(RUBY_NSIG, vm->trap_list.cmd);
3213
3214 if (vm->coverages) {
3215 vm->coverages = rb_gc_location(vm->coverages);
3216 vm->me2counter = rb_gc_location(vm->me2counter);
3217 }
3218 }
3219}
3220
3221void
3222rb_vm_each_stack_value(void *ptr, void (*cb)(VALUE, void*), void *ctx)
3223{
3224 if (ptr) {
3225 rb_vm_t *vm = ptr;
3226 rb_ractor_t *r = 0;
3227 ccan_list_for_each(&vm->ractor.set, r, vmlr_node) {
3228 VM_ASSERT(rb_ractor_status_p(r, ractor_blocking) ||
3229 rb_ractor_status_p(r, ractor_running));
3230 if (r->threads.cnt > 0) {
3231 rb_thread_t *th = 0;
3232 ccan_list_for_each(&r->threads.set, th, lt_node) {
3233 VM_ASSERT(th != NULL);
3234 rb_execution_context_t * ec = th->ec;
3235 if (ec->vm_stack) {
3236 VALUE *p = ec->vm_stack;
3237 VALUE *sp = ec->cfp->sp;
3238 while (p < sp) {
3239 if (!RB_SPECIAL_CONST_P(*p)) {
3240 cb(*p, ctx);
3241 }
3242 p++;
3243 }
3244 }
3245 }
3246 }
3247 }
3248 }
3249}
3250
3251static enum rb_id_table_iterator_result
3252vm_mark_negative_cme(VALUE val, void *dmy)
3253{
3254 rb_gc_mark(val);
3255 return ID_TABLE_CONTINUE;
3256}
3257
3258void rb_thread_sched_mark_zombies(rb_vm_t *vm);
3259
3260void
3261rb_vm_mark(void *ptr)
3262{
3263 RUBY_MARK_ENTER("vm");
3264 RUBY_GC_INFO("-------------------------------------------------\n");
3265 if (ptr) {
3266 rb_vm_t *vm = ptr;
3267 rb_ractor_t *r = 0;
3268 long i;
3269
3270 ccan_list_for_each(&vm->ractor.set, r, vmlr_node) {
3271 // ractor.set only contains blocking or running ractors
3272 VM_ASSERT(rb_ractor_status_p(r, ractor_blocking) ||
3273 rb_ractor_status_p(r, ractor_running));
3274 rb_gc_mark(rb_ractor_self(r));
3275 }
3276
3277 for (struct global_object_list *list = vm->global_object_list; list; list = list->next) {
3278 rb_gc_mark_maybe(*list->varptr);
3279 }
3280
3281 rb_gc_mark_movable(vm->self);
3282
3283 if (vm->root_namespace) {
3284 rb_namespace_entry_mark(vm->root_namespace);
3285 }
3286 if (vm->main_namespace) {
3287 rb_namespace_entry_mark(vm->main_namespace);
3288 }
3289
3290 rb_gc_mark_movable(vm->mark_object_ary);
3291 rb_gc_mark_movable(vm->orig_progname);
3292 rb_gc_mark_movable(vm->coverages);
3293 rb_gc_mark_movable(vm->me2counter);
3294
3295 rb_gc_mark_values(RUBY_NSIG, vm->trap_list.cmd);
3296
3297 rb_id_table_foreach_values(vm->negative_cme_table, vm_mark_negative_cme, NULL);
3298 rb_mark_tbl_no_pin(vm->overloaded_cme_table);
3299 for (i=0; i<VM_GLOBAL_CC_CACHE_TABLE_SIZE; i++) {
3300 const struct rb_callcache *cc = vm->global_cc_cache_table[i];
3301
3302 if (cc != NULL) {
3303 if (!vm_cc_invalidated_p(cc)) {
3304 rb_gc_mark((VALUE)cc);
3305 }
3306 else {
3307 vm->global_cc_cache_table[i] = NULL;
3308 }
3309 }
3310 }
3311
3312 rb_thread_sched_mark_zombies(vm);
3313 }
3314
3315 RUBY_MARK_LEAVE("vm");
3316}
3317
3318#undef rb_vm_register_special_exception
3319void
3320rb_vm_register_special_exception_str(enum ruby_special_exceptions sp, VALUE cls, VALUE mesg)
3321{
3322 rb_vm_t *vm = GET_VM();
3323 VALUE exc = rb_exc_new3(cls, rb_obj_freeze(mesg));
3324 OBJ_FREEZE(exc);
3325 ((VALUE *)vm->special_exceptions)[sp] = exc;
3326 rb_vm_register_global_object(exc);
3327}
3328
3329void rb_objspace_free_objects(void *objspace);
3330
3331int
3333{
3334 RUBY_FREE_ENTER("vm");
3335 ruby_vm_during_cleanup = true;
3336
3337 if (vm) {
3338 rb_thread_t *th = vm->ractor.main_thread;
3339
3340 if (rb_free_at_exit) {
3341 rb_free_encoded_insn_data();
3342 rb_free_global_enc_table();
3343 rb_free_loaded_builtin_table();
3344 rb_free_global_symbol_table();
3345
3346 rb_free_shared_fiber_pool();
3347 rb_free_transcoder_table();
3348 rb_free_vm_opt_tables();
3349 rb_free_warning();
3350 rb_free_rb_global_tbl();
3351
3352 rb_id_table_free(vm->negative_cme_table);
3353 st_free_table(vm->overloaded_cme_table);
3354
3355 // TODO: Is this ignorable for classext->m_tbl ?
3356 // rb_id_table_free(RCLASS(rb_mRubyVMFrozenCore)->m_tbl);
3357
3358 st_free_table(vm->static_ext_inits);
3359
3360 rb_vm_postponed_job_free();
3361
3362 rb_id_table_free(vm->constant_cache);
3363 set_free_table(vm->unused_block_warning_table);
3364
3365 rb_thread_free_native_thread(th);
3366
3367#ifndef HAVE_SETPROCTITLE
3368 ruby_free_proctitle();
3369#endif
3370 }
3371 else {
3372 rb_fiber_reset_root_local_storage(th);
3373 thread_free(th);
3374 }
3375
3376 struct rb_objspace *objspace = vm->gc.objspace;
3377
3378 rb_vm_living_threads_init(vm);
3379 ruby_vm_run_at_exit_hooks(vm);
3380 if (vm->ci_table) {
3381 st_free_table(vm->ci_table);
3382 vm->ci_table = NULL;
3383 }
3384 if (vm->cc_refinement_table) {
3385 rb_set_free_table(vm->cc_refinement_table);
3386 vm->cc_refinement_table = NULL;
3387 }
3388 RB_ALTSTACK_FREE(vm->main_altstack);
3389
3390 struct global_object_list *next;
3391 for (struct global_object_list *list = vm->global_object_list; list; list = next) {
3392 next = list->next;
3393 xfree(list);
3394 }
3395
3396 if (objspace) {
3397 if (rb_free_at_exit) {
3398 rb_objspace_free_objects(objspace);
3399 rb_free_generic_fields_tbl_();
3400 rb_free_default_rand_key();
3401
3402 ruby_mimfree(th);
3403 }
3404 rb_objspace_free(objspace);
3405 }
3406 rb_native_mutex_destroy(&vm->workqueue_lock);
3407 /* after freeing objspace, you *can't* use ruby_xfree() */
3408 ruby_mimfree(vm);
3409 ruby_current_vm_ptr = NULL;
3410
3411 if (rb_free_at_exit) {
3412 rb_shape_free_all();
3413#if USE_YJIT
3414 rb_yjit_free_at_exit();
3415#endif
3416 }
3417 }
3418 RUBY_FREE_LEAVE("vm");
3419 return 0;
3420}
3421
3422size_t rb_vm_memsize_workqueue(struct ccan_list_head *workqueue); // vm_trace.c
3423
3424// Used for VM memsize reporting. Returns the size of the at_exit list by
3425// looping through the linked list and adding up the size of the structs.
3426static enum rb_id_table_iterator_result
3427vm_memsize_constant_cache_i(ID id, VALUE ics, void *size)
3428{
3429 *((size_t *) size) += rb_st_memsize((st_table *) ics);
3430 return ID_TABLE_CONTINUE;
3431}
3432
3433// Returns a size_t representing the memory footprint of the VM's constant
3434// cache, which is the memsize of the table as well as the memsize of all of the
3435// nested tables.
3436static size_t
3437vm_memsize_constant_cache(void)
3438{
3439 rb_vm_t *vm = GET_VM();
3440 size_t size = rb_id_table_memsize(vm->constant_cache);
3441
3442 rb_id_table_foreach(vm->constant_cache, vm_memsize_constant_cache_i, &size);
3443 return size;
3444}
3445
3446static size_t
3447vm_memsize_at_exit_list(rb_at_exit_list *at_exit)
3448{
3449 size_t size = 0;
3450
3451 while (at_exit) {
3452 size += sizeof(rb_at_exit_list);
3453 at_exit = at_exit->next;
3454 }
3455
3456 return size;
3457}
3458
3459// Used for VM memsize reporting. Returns the size of the builtin function
3460// table if it has been defined.
3461static size_t
3462vm_memsize_builtin_function_table(const struct rb_builtin_function *builtin_function_table)
3463{
3464 return builtin_function_table == NULL ? 0 : sizeof(struct rb_builtin_function);
3465}
3466
3467// Reports the memsize of the VM struct object and the structs that are
3468// associated with it.
3469static size_t
3470vm_memsize(const void *ptr)
3471{
3472 rb_vm_t *vm = GET_VM();
3473
3474 return (
3475 sizeof(rb_vm_t) +
3476 rb_vm_memsize_postponed_job_queue() +
3477 rb_vm_memsize_workqueue(&vm->workqueue) +
3478 vm_memsize_at_exit_list(vm->at_exit) +
3479 rb_st_memsize(vm->ci_table) +
3480 vm_memsize_builtin_function_table(vm->builtin_function_table) +
3481 rb_id_table_memsize(vm->negative_cme_table) +
3482 rb_st_memsize(vm->overloaded_cme_table) +
3483 rb_set_memsize(vm->cc_refinement_table) +
3484 vm_memsize_constant_cache()
3485 );
3486
3487 // TODO
3488 // struct { struct ccan_list_head set; } ractor;
3489 // void *main_altstack; #ifdef USE_SIGALTSTACK
3490 // struct rb_objspace *objspace;
3491}
3492
3493static const rb_data_type_t vm_data_type = {
3494 "VM",
3495 {0, 0, vm_memsize,},
3496 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
3497};
3498
3499
3500static VALUE
3501vm_default_params(void)
3502{
3503 rb_vm_t *vm = GET_VM();
3504 VALUE result = rb_hash_new_with_size(4);
3505#define SET(name) rb_hash_aset(result, ID2SYM(rb_intern(#name)), SIZET2NUM(vm->default_params.name));
3506 SET(thread_vm_stack_size);
3507 SET(thread_machine_stack_size);
3508 SET(fiber_vm_stack_size);
3509 SET(fiber_machine_stack_size);
3510#undef SET
3511 rb_obj_freeze(result);
3512 return result;
3513}
3514
3515static size_t
3516get_param(const char *name, size_t default_value, size_t min_value)
3517{
3518 const char *envval;
3519 size_t result = default_value;
3520 if ((envval = getenv(name)) != 0) {
3521 long val = atol(envval);
3522 if (val < (long)min_value) {
3523 val = (long)min_value;
3524 }
3525 result = (size_t)(((val -1 + RUBY_VM_SIZE_ALIGN) / RUBY_VM_SIZE_ALIGN) * RUBY_VM_SIZE_ALIGN);
3526 }
3527 if (0) ruby_debug_printf("%s: %"PRIuSIZE"\n", name, result); /* debug print */
3528
3529 return result;
3530}
3531
3532static void
3533check_machine_stack_size(size_t *sizep)
3534{
3535#ifdef PTHREAD_STACK_MIN
3536 size_t size = *sizep;
3537#endif
3538
3539#ifdef PTHREAD_STACK_MIN
3540 if (size < (size_t)PTHREAD_STACK_MIN) {
3541 *sizep = (size_t)PTHREAD_STACK_MIN * 2;
3542 }
3543#endif
3544}
3545
3546static void
3547vm_default_params_setup(rb_vm_t *vm)
3548{
3549 vm->default_params.thread_vm_stack_size =
3550 get_param("RUBY_THREAD_VM_STACK_SIZE",
3551 RUBY_VM_THREAD_VM_STACK_SIZE,
3552 RUBY_VM_THREAD_VM_STACK_SIZE_MIN);
3553
3554 vm->default_params.thread_machine_stack_size =
3555 get_param("RUBY_THREAD_MACHINE_STACK_SIZE",
3556 RUBY_VM_THREAD_MACHINE_STACK_SIZE,
3557 RUBY_VM_THREAD_MACHINE_STACK_SIZE_MIN);
3558
3559 vm->default_params.fiber_vm_stack_size =
3560 get_param("RUBY_FIBER_VM_STACK_SIZE",
3561 RUBY_VM_FIBER_VM_STACK_SIZE,
3562 RUBY_VM_FIBER_VM_STACK_SIZE_MIN);
3563
3564 vm->default_params.fiber_machine_stack_size =
3565 get_param("RUBY_FIBER_MACHINE_STACK_SIZE",
3566 RUBY_VM_FIBER_MACHINE_STACK_SIZE,
3567 RUBY_VM_FIBER_MACHINE_STACK_SIZE_MIN);
3568
3569 /* environment dependent check */
3570 check_machine_stack_size(&vm->default_params.thread_machine_stack_size);
3571 check_machine_stack_size(&vm->default_params.fiber_machine_stack_size);
3572}
3573
3574static void
3575vm_init2(rb_vm_t *vm)
3576{
3577 rb_vm_living_threads_init(vm);
3578 vm->thread_report_on_exception = 1;
3579 vm->src_encoding_index = -1;
3580
3581 vm_default_params_setup(vm);
3582}
3583
3584void
3585rb_execution_context_update(rb_execution_context_t *ec)
3586{
3587 /* update VM stack */
3588 if (ec->vm_stack) {
3589 long i;
3590 VM_ASSERT(ec->cfp);
3591 VALUE *p = ec->vm_stack;
3592 VALUE *sp = ec->cfp->sp;
3593 rb_control_frame_t *cfp = ec->cfp;
3594 rb_control_frame_t *limit_cfp = (void *)(ec->vm_stack + ec->vm_stack_size);
3595
3596 for (i = 0; i < (long)(sp - p); i++) {
3597 VALUE ref = p[i];
3598 VALUE update = rb_gc_location(ref);
3599 if (ref != update) {
3600 p[i] = update;
3601 }
3602 }
3603
3604 while (cfp != limit_cfp) {
3605 const VALUE *ep = cfp->ep;
3606 cfp->self = rb_gc_location(cfp->self);
3607 cfp->iseq = (rb_iseq_t *)rb_gc_location((VALUE)cfp->iseq);
3608 cfp->block_code = (void *)rb_gc_location((VALUE)cfp->block_code);
3609
3610 if (!VM_ENV_LOCAL_P(ep)) {
3611 const VALUE *prev_ep = VM_ENV_PREV_EP(ep);
3612 if (VM_ENV_FLAGS(prev_ep, VM_ENV_FLAG_ESCAPED)) {
3613 VM_FORCE_WRITE(&prev_ep[VM_ENV_DATA_INDEX_ENV], rb_gc_location(prev_ep[VM_ENV_DATA_INDEX_ENV]));
3614 }
3615
3616 if (VM_ENV_FLAGS(ep, VM_ENV_FLAG_ESCAPED)) {
3617 VM_FORCE_WRITE(&ep[VM_ENV_DATA_INDEX_ENV], rb_gc_location(ep[VM_ENV_DATA_INDEX_ENV]));
3618 VM_FORCE_WRITE(&ep[VM_ENV_DATA_INDEX_ME_CREF], rb_gc_location(ep[VM_ENV_DATA_INDEX_ME_CREF]));
3619 }
3620 }
3621
3622 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
3623 }
3624 }
3625
3626 ec->storage = rb_gc_location(ec->storage);
3627
3628 ec->gen_fields_cache.obj = rb_gc_location(ec->gen_fields_cache.obj);
3629 ec->gen_fields_cache.fields_obj = rb_gc_location(ec->gen_fields_cache.fields_obj);
3630}
3631
3632static enum rb_id_table_iterator_result
3633mark_local_storage_i(VALUE local, void *data)
3634{
3635 rb_gc_mark(local);
3636 return ID_TABLE_CONTINUE;
3637}
3638
3639void
3640rb_execution_context_mark(const rb_execution_context_t *ec)
3641{
3642 /* mark VM stack */
3643 if (ec->vm_stack) {
3644 VM_ASSERT(ec->cfp);
3645 VALUE *p = ec->vm_stack;
3646 VALUE *sp = ec->cfp->sp;
3647 rb_control_frame_t *cfp = ec->cfp;
3648 rb_control_frame_t *limit_cfp = (void *)(ec->vm_stack + ec->vm_stack_size);
3649
3650 VM_ASSERT(sp == ec->cfp->sp);
3651 rb_gc_mark_vm_stack_values((long)(sp - p), p);
3652
3653 while (cfp != limit_cfp) {
3654 const VALUE *ep = cfp->ep;
3655 VM_ASSERT(!!VM_ENV_FLAGS(ep, VM_ENV_FLAG_ESCAPED) == vm_ep_in_heap_p_(ec, ep));
3656
3657 rb_gc_mark_movable(cfp->self);
3658 rb_gc_mark_movable((VALUE)cfp->iseq);
3659 rb_gc_mark_movable((VALUE)cfp->block_code);
3660
3661 if (!VM_ENV_LOCAL_P(ep)) {
3662 const VALUE *prev_ep = VM_ENV_PREV_EP(ep);
3663 if (VM_ENV_FLAGS(prev_ep, VM_ENV_FLAG_ESCAPED)) {
3664 rb_gc_mark_movable(prev_ep[VM_ENV_DATA_INDEX_ENV]);
3665 }
3666
3667 if (VM_ENV_FLAGS(ep, VM_ENV_FLAG_ESCAPED)) {
3668 rb_gc_mark_movable(ep[VM_ENV_DATA_INDEX_ENV]);
3669 rb_gc_mark(ep[VM_ENV_DATA_INDEX_ME_CREF]);
3670 }
3671 }
3672
3673 cfp = RUBY_VM_PREVIOUS_CONTROL_FRAME(cfp);
3674 }
3675 }
3676
3677 /* mark machine stack */
3678 if (ec->machine.stack_start && ec->machine.stack_end &&
3679 ec != GET_EC() /* marked for current ec at the first stage of marking */
3680 ) {
3681 rb_gc_mark_machine_context(ec);
3682 }
3683
3684 rb_gc_mark(ec->errinfo);
3685 rb_gc_mark(ec->root_svar);
3686 if (ec->local_storage) {
3687 rb_id_table_foreach_values(ec->local_storage, mark_local_storage_i, NULL);
3688 }
3689 rb_gc_mark(ec->local_storage_recursive_hash);
3690 rb_gc_mark(ec->local_storage_recursive_hash_for_trace);
3691 rb_gc_mark(ec->private_const_reference);
3692
3693 rb_gc_mark_movable(ec->storage);
3694
3695 rb_gc_mark_weak((VALUE *)&ec->gen_fields_cache.obj);
3696 rb_gc_mark_weak((VALUE *)&ec->gen_fields_cache.fields_obj);
3697}
3698
3699void rb_fiber_mark_self(rb_fiber_t *fib);
3700void rb_fiber_update_self(rb_fiber_t *fib);
3701void rb_threadptr_root_fiber_setup(rb_thread_t *th);
3702void rb_threadptr_root_fiber_release(rb_thread_t *th);
3703
3704static void
3705thread_compact(void *ptr)
3706{
3707 rb_thread_t *th = ptr;
3708
3709 th->self = rb_gc_location(th->self);
3710
3711 if (!th->root_fiber) {
3712 rb_execution_context_update(th->ec);
3713 }
3714}
3715
3716static void
3717thread_mark(void *ptr)
3718{
3719 rb_thread_t *th = ptr;
3720 RUBY_MARK_ENTER("thread");
3721 rb_fiber_mark_self(th->ec->fiber_ptr);
3722
3723 /* mark ruby objects */
3724 switch (th->invoke_type) {
3725 case thread_invoke_type_proc:
3726 case thread_invoke_type_ractor_proc:
3727 rb_gc_mark(th->invoke_arg.proc.proc);
3728 rb_gc_mark(th->invoke_arg.proc.args);
3729 break;
3730 case thread_invoke_type_func:
3731 rb_gc_mark_maybe((VALUE)th->invoke_arg.func.arg);
3732 break;
3733 default:
3734 break;
3735 }
3736
3737 rb_gc_mark(rb_ractor_self(th->ractor));
3738 rb_gc_mark(th->thgroup);
3739 rb_gc_mark(th->value);
3740 rb_gc_mark(th->pending_interrupt_queue);
3741 rb_gc_mark(th->pending_interrupt_mask_stack);
3742 rb_gc_mark(th->top_self);
3743 rb_gc_mark(th->top_wrapper);
3744 if (th->root_fiber) rb_fiber_mark_self(th->root_fiber);
3745
3746 RUBY_ASSERT(th->ec == rb_fiberptr_get_ec(th->ec->fiber_ptr));
3747 rb_gc_mark(th->last_status);
3748 rb_gc_mark(th->locking_mutex);
3749 rb_gc_mark(th->name);
3750
3751 rb_gc_mark(th->scheduler);
3752
3753 rb_threadptr_interrupt_exec_task_mark(th);
3754
3755 RUBY_MARK_LEAVE("thread");
3756}
3757
3758void rb_threadptr_sched_free(rb_thread_t *th); // thread_*.c
3759
3760static void
3761thread_free(void *ptr)
3762{
3763 rb_thread_t *th = ptr;
3764 RUBY_FREE_ENTER("thread");
3765
3766 rb_threadptr_sched_free(th);
3767
3768 if (th->locking_mutex != Qfalse) {
3769 rb_bug("thread_free: locking_mutex must be NULL (%p:%p)", (void *)th, (void *)th->locking_mutex);
3770 }
3771 if (th->keeping_mutexes != NULL) {
3772 rb_bug("thread_free: keeping_mutexes must be NULL (%p:%p)", (void *)th, (void *)th->keeping_mutexes);
3773 }
3774
3775 ruby_xfree(th->specific_storage);
3776
3777 rb_threadptr_root_fiber_release(th);
3778
3779 if (th->vm && th->vm->ractor.main_thread == th) {
3780 RUBY_GC_INFO("MRI main thread\n");
3781 }
3782 else {
3783 // ruby_xfree(th->nt);
3784 // TODO: MN system collect nt, but without MN system it should be freed here.
3785 ruby_xfree(th);
3786 }
3787
3788 RUBY_FREE_LEAVE("thread");
3789}
3790
3791static size_t
3792thread_memsize(const void *ptr)
3793{
3794 const rb_thread_t *th = ptr;
3795 size_t size = sizeof(rb_thread_t);
3796
3797 if (!th->root_fiber) {
3798 size += th->ec->vm_stack_size * sizeof(VALUE);
3799 }
3800 if (th->ec->local_storage) {
3801 size += rb_id_table_memsize(th->ec->local_storage);
3802 }
3803 return size;
3804}
3805
3806#define thread_data_type ruby_threadptr_data_type
3807const rb_data_type_t ruby_threadptr_data_type = {
3808 "VM/thread",
3809 {
3810 thread_mark,
3811 thread_free,
3812 thread_memsize,
3813 thread_compact,
3814 },
3815 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
3816};
3817
3818VALUE
3819rb_obj_is_thread(VALUE obj)
3820{
3821 return RBOOL(rb_typeddata_is_kind_of(obj, &thread_data_type));
3822}
3823
3824static VALUE
3825thread_alloc(VALUE klass)
3826{
3827 rb_thread_t *th;
3828 return TypedData_Make_Struct(klass, rb_thread_t, &thread_data_type, th);
3829}
3830
3831void
3832rb_ec_set_vm_stack(rb_execution_context_t *ec, VALUE *stack, size_t size)
3833{
3834 ec->vm_stack = stack;
3835 ec->vm_stack_size = size;
3836}
3837
3838void
3839rb_ec_initialize_vm_stack(rb_execution_context_t *ec, VALUE *stack, size_t size)
3840{
3841 rb_ec_set_vm_stack(ec, stack, size);
3842
3843#if VM_CHECK_MODE > 0
3844 MEMZERO(stack, VALUE, size); // malloc memory could have the VM canary in it
3845#endif
3846
3847 ec->cfp = (void *)(ec->vm_stack + ec->vm_stack_size);
3848
3849 vm_push_frame(ec,
3850 NULL /* dummy iseq */,
3851 VM_FRAME_MAGIC_DUMMY | VM_ENV_FLAG_LOCAL | VM_FRAME_FLAG_FINISH | VM_FRAME_FLAG_CFRAME /* dummy frame */,
3852 Qnil /* dummy self */, VM_BLOCK_HANDLER_NONE /* dummy block ptr */,
3853 0 /* dummy cref/me */,
3854 0 /* dummy pc */, ec->vm_stack, 0, 0
3855 );
3856}
3857
3858void
3859rb_ec_clear_vm_stack(rb_execution_context_t *ec)
3860{
3861 // set cfp to NULL before clearing the stack in case `thread_profile_frames`
3862 // gets called in this middle of `rb_ec_set_vm_stack` via signal handler.
3863 ec->cfp = NULL;
3864 rb_ec_set_vm_stack(ec, NULL, 0);
3865}
3866
3867static void
3868th_init(rb_thread_t *th, VALUE self, rb_vm_t *vm)
3869{
3870 const rb_namespace_t *ns = rb_current_namespace();
3871
3872 th->self = self;
3873
3874 rb_threadptr_root_fiber_setup(th);
3875
3876 /* All threads are blocking until a non-blocking fiber is scheduled */
3877 th->blocking = 1;
3878 th->scheduler = Qnil;
3879
3880 if (self == 0) {
3881 size_t size = vm->default_params.thread_vm_stack_size / sizeof(VALUE);
3882 VALUE *stack = ALLOC_N(VALUE, size);
3883 rb_ec_initialize_vm_stack(th->ec, stack, size);
3884 rb_thread_malloc_stack_set(th, stack);
3885 }
3886 else {
3887 VM_ASSERT(th->ec->cfp == NULL);
3888 VM_ASSERT(th->ec->vm_stack == NULL);
3889 VM_ASSERT(th->ec->vm_stack_size == 0);
3890 }
3891
3892 th->status = THREAD_RUNNABLE;
3893 th->last_status = Qnil;
3894 th->top_wrapper = 0;
3895 if (ns->top_self) {
3896 th->top_self = ns->top_self;
3897 }
3898 else {
3899 th->top_self = 0;
3900 }
3901 th->value = Qundef;
3902
3903 th->ec->errinfo = Qnil;
3904 th->ec->root_svar = Qfalse;
3905 th->ec->local_storage_recursive_hash = Qnil;
3906 th->ec->local_storage_recursive_hash_for_trace = Qnil;
3907
3908 th->ec->storage = Qnil;
3909
3910#if OPT_CALL_THREADED_CODE
3911 th->retval = Qundef;
3912#endif
3913 th->name = Qnil;
3914 th->report_on_exception = vm->thread_report_on_exception;
3915 th->ext_config.ractor_safe = true;
3916
3917 ccan_list_head_init(&th->interrupt_exec_tasks);
3918
3919#if USE_RUBY_DEBUG_LOG
3920 static rb_atomic_t thread_serial = 1;
3921 th->serial = RUBY_ATOMIC_FETCH_ADD(thread_serial, 1);
3922
3923 RUBY_DEBUG_LOG("th:%u", th->serial);
3924#endif
3925}
3926
3927VALUE
3928rb_thread_alloc(VALUE klass)
3929{
3930 VALUE self = thread_alloc(klass);
3931 rb_thread_t *target_th = rb_thread_ptr(self);
3932 target_th->ractor = GET_RACTOR();
3933 th_init(target_th, self, target_th->vm = GET_VM());
3934 return self;
3935}
3936
3937#define REWIND_CFP(expr) do { \
3938 rb_execution_context_t *ec__ = GET_EC(); \
3939 VALUE *const curr_sp = (ec__->cfp++)->sp; \
3940 VALUE *const saved_sp = ec__->cfp->sp; \
3941 ec__->cfp->sp = curr_sp; \
3942 expr; \
3943 (ec__->cfp--)->sp = saved_sp; \
3944} while (0)
3945
3946static VALUE
3947m_core_set_method_alias(VALUE self, VALUE cbase, VALUE sym1, VALUE sym2)
3948{
3949 REWIND_CFP({
3950 rb_alias(cbase, SYM2ID(sym1), SYM2ID(sym2));
3951 });
3952 return Qnil;
3953}
3954
3955static VALUE
3956m_core_set_variable_alias(VALUE self, VALUE sym1, VALUE sym2)
3957{
3958 REWIND_CFP({
3959 rb_alias_variable(SYM2ID(sym1), SYM2ID(sym2));
3960 });
3961 return Qnil;
3962}
3963
3964static VALUE
3965m_core_undef_method(VALUE self, VALUE cbase, VALUE sym)
3966{
3967 REWIND_CFP({
3968 ID mid = SYM2ID(sym);
3969 rb_undef(cbase, mid);
3970 rb_clear_method_cache(self, mid);
3971 });
3972 return Qnil;
3973}
3974
3975static VALUE
3976m_core_set_postexe(VALUE self)
3977{
3978 rb_set_end_proc(rb_call_end_proc, rb_block_proc());
3979 return Qnil;
3980}
3981
3982static VALUE core_hash_merge_kwd(VALUE hash, VALUE kw);
3983
3984static VALUE
3985core_hash_merge(VALUE hash, long argc, const VALUE *argv)
3986{
3987 Check_Type(hash, T_HASH);
3988 VM_ASSERT(argc % 2 == 0);
3989 rb_hash_bulk_insert(argc, argv, hash);
3990 return hash;
3991}
3992
3993static VALUE
3994m_core_hash_merge_ptr(int argc, VALUE *argv, VALUE recv)
3995{
3996 VALUE hash = argv[0];
3997
3998 REWIND_CFP(hash = core_hash_merge(hash, argc-1, argv+1));
3999
4000 return hash;
4001}
4002
4003static int
4004kwmerge_i(VALUE key, VALUE value, VALUE hash)
4005{
4006 rb_hash_aset(hash, key, value);
4007 return ST_CONTINUE;
4008}
4009
4010static VALUE
4011m_core_hash_merge_kwd(VALUE recv, VALUE hash, VALUE kw)
4012{
4013 if (!NIL_P(kw)) {
4014 REWIND_CFP(hash = core_hash_merge_kwd(hash, kw));
4015 }
4016 return hash;
4017}
4018
4019static VALUE
4020m_core_make_shareable(VALUE recv, VALUE obj)
4021{
4022 return rb_ractor_make_shareable(obj);
4023}
4024
4025static VALUE
4026m_core_make_shareable_copy(VALUE recv, VALUE obj)
4027{
4029}
4030
4031static VALUE
4032m_core_ensure_shareable(VALUE recv, VALUE obj, VALUE name)
4033{
4034 return rb_ractor_ensure_shareable(obj, name);
4035}
4036
4037static VALUE
4038core_hash_merge_kwd(VALUE hash, VALUE kw)
4039{
4040 rb_hash_foreach(rb_to_hash_type(kw), kwmerge_i, hash);
4041 return hash;
4042}
4043
4044extern VALUE *rb_gc_stack_start;
4045extern size_t rb_gc_stack_maxsize;
4046
4047/* debug functions */
4048
4049/* :nodoc: */
4050static VALUE
4051sdr(VALUE self)
4052{
4053 rb_vm_bugreport(NULL, stderr);
4054 return Qnil;
4055}
4056
4057/* :nodoc: */
4058static VALUE
4059nsdr(VALUE self)
4060{
4061 VALUE ary = rb_ary_new();
4062#ifdef HAVE_BACKTRACE
4063#include <execinfo.h>
4064#define MAX_NATIVE_TRACE 1024
4065 static void *trace[MAX_NATIVE_TRACE];
4066 int n = (int)backtrace(trace, MAX_NATIVE_TRACE);
4067 char **syms = backtrace_symbols(trace, n);
4068 int i;
4069
4070 if (syms == 0) {
4071 rb_memerror();
4072 }
4073
4074 for (i=0; i<n; i++) {
4075 rb_ary_push(ary, rb_str_new2(syms[i]));
4076 }
4077 free(syms); /* OK */
4078#endif
4079 return ary;
4080}
4081
4082#if VM_COLLECT_USAGE_DETAILS
4083static VALUE usage_analysis_insn_start(VALUE self);
4084static VALUE usage_analysis_operand_start(VALUE self);
4085static VALUE usage_analysis_register_start(VALUE self);
4086static VALUE usage_analysis_insn_stop(VALUE self);
4087static VALUE usage_analysis_operand_stop(VALUE self);
4088static VALUE usage_analysis_register_stop(VALUE self);
4089static VALUE usage_analysis_insn_running(VALUE self);
4090static VALUE usage_analysis_operand_running(VALUE self);
4091static VALUE usage_analysis_register_running(VALUE self);
4092static VALUE usage_analysis_insn_clear(VALUE self);
4093static VALUE usage_analysis_operand_clear(VALUE self);
4094static VALUE usage_analysis_register_clear(VALUE self);
4095#endif
4096
4097static VALUE
4098f_raise(int c, VALUE *v, VALUE _)
4099{
4100 return rb_f_raise(c, v);
4101}
4102
4103static VALUE
4104f_proc(VALUE _)
4105{
4106 return rb_block_proc();
4107}
4108
4109static VALUE
4110f_lambda(VALUE _)
4111{
4112 return rb_block_lambda();
4113}
4114
4115static VALUE
4116f_sprintf(int c, const VALUE *v, VALUE _)
4117{
4118 return rb_f_sprintf(c, v);
4119}
4120
4121/* :nodoc: */
4122static VALUE
4123vm_mtbl(VALUE self, VALUE obj, VALUE sym)
4124{
4125 vm_mtbl_dump(CLASS_OF(obj), RTEST(sym) ? SYM2ID(sym) : 0);
4126 return Qnil;
4127}
4128
4129/* :nodoc: */
4130static VALUE
4131vm_mtbl2(VALUE self, VALUE obj, VALUE sym)
4132{
4133 vm_mtbl_dump(obj, RTEST(sym) ? SYM2ID(sym) : 0);
4134 return Qnil;
4135}
4136
4137/*
4138 * call-seq:
4139 * RubyVM.keep_script_lines -> true or false
4140 *
4141 * Return current +keep_script_lines+ status. Now it only returns
4142 * +true+ of +false+, but it can return other objects in future.
4143 *
4144 * Note that this is an API for ruby internal use, debugging,
4145 * and research. Do not use this for any other purpose.
4146 * The compatibility is not guaranteed.
4147 */
4148static VALUE
4149vm_keep_script_lines(VALUE self)
4150{
4151 return RBOOL(ruby_vm_keep_script_lines);
4152}
4153
4154/*
4155 * call-seq:
4156 * RubyVM.keep_script_lines = true / false
4157 *
4158 * It set +keep_script_lines+ flag. If the flag is set, all
4159 * loaded scripts are recorded in a interpreter process.
4160 *
4161 * Note that this is an API for ruby internal use, debugging,
4162 * and research. Do not use this for any other purpose.
4163 * The compatibility is not guaranteed.
4164 */
4165static VALUE
4166vm_keep_script_lines_set(VALUE self, VALUE flags)
4167{
4168 ruby_vm_keep_script_lines = RTEST(flags);
4169 return flags;
4170}
4171
4172void
4173Init_VM(void)
4174{
4175 VALUE opts;
4176 VALUE klass;
4177 VALUE fcore;
4178
4179 /*
4180 * Document-class: RubyVM
4181 *
4182 * The RubyVM module only exists on MRI. +RubyVM+ is not defined in
4183 * other Ruby implementations such as JRuby and TruffleRuby.
4184 *
4185 * The RubyVM module provides some access to MRI internals.
4186 * This module is for very limited purposes, such as debugging,
4187 * prototyping, and research. Normal users must not use it.
4188 * This module is not portable between Ruby implementations.
4189 */
4190 rb_cRubyVM = rb_define_class("RubyVM", rb_cObject);
4191 rb_undef_alloc_func(rb_cRubyVM);
4192 rb_undef_method(CLASS_OF(rb_cRubyVM), "new");
4193 rb_define_singleton_method(rb_cRubyVM, "stat", vm_stat, -1);
4194 rb_define_singleton_method(rb_cRubyVM, "keep_script_lines", vm_keep_script_lines, 0);
4195 rb_define_singleton_method(rb_cRubyVM, "keep_script_lines=", vm_keep_script_lines_set, 1);
4196
4197#if USE_DEBUG_COUNTER
4198 rb_define_singleton_method(rb_cRubyVM, "reset_debug_counters", rb_debug_counter_reset, 0);
4199 rb_define_singleton_method(rb_cRubyVM, "show_debug_counters", rb_debug_counter_show, 0);
4200#endif
4201
4202 /* FrozenCore (hidden) */
4204 rb_set_class_path(fcore, rb_cRubyVM, "FrozenCore");
4205 rb_vm_register_global_object(rb_class_path_cached(fcore));
4206 klass = rb_singleton_class(fcore);
4207 rb_define_method_id(klass, id_core_set_method_alias, m_core_set_method_alias, 3);
4208 rb_define_method_id(klass, id_core_set_variable_alias, m_core_set_variable_alias, 2);
4209 rb_define_method_id(klass, id_core_undef_method, m_core_undef_method, 2);
4210 rb_define_method_id(klass, id_core_set_postexe, m_core_set_postexe, 0);
4211 rb_define_method_id(klass, id_core_hash_merge_ptr, m_core_hash_merge_ptr, -1);
4212 rb_define_method_id(klass, id_core_hash_merge_kwd, m_core_hash_merge_kwd, 2);
4213 rb_define_method_id(klass, id_core_raise, f_raise, -1);
4214 rb_define_method_id(klass, id_core_sprintf, f_sprintf, -1);
4215 rb_define_method_id(klass, idProc, f_proc, 0);
4216 rb_define_method_id(klass, idLambda, f_lambda, 0);
4217 rb_define_method(klass, "make_shareable", m_core_make_shareable, 1);
4218 rb_define_method(klass, "make_shareable_copy", m_core_make_shareable_copy, 1);
4219 rb_define_method(klass, "ensure_shareable", m_core_ensure_shareable, 2);
4220 rb_obj_freeze(fcore);
4221 RBASIC_CLEAR_CLASS(klass);
4222 rb_obj_freeze(klass);
4223 rb_vm_register_global_object(fcore);
4224 rb_mRubyVMFrozenCore = fcore;
4225
4226 /*
4227 * Document-class: Thread
4228 *
4229 * Threads are the Ruby implementation for a concurrent programming model.
4230 *
4231 * Programs that require multiple threads of execution are a perfect
4232 * candidate for Ruby's Thread class.
4233 *
4234 * For example, we can create a new thread separate from the main thread's
4235 * execution using ::new.
4236 *
4237 * thr = Thread.new { puts "What's the big deal" }
4238 *
4239 * Then we are able to pause the execution of the main thread and allow
4240 * our new thread to finish, using #join:
4241 *
4242 * thr.join #=> "What's the big deal"
4243 *
4244 * If we don't call +thr.join+ before the main thread terminates, then all
4245 * other threads including +thr+ will be killed.
4246 *
4247 * Alternatively, you can use an array for handling multiple threads at
4248 * once, like in the following example:
4249 *
4250 * threads = []
4251 * threads << Thread.new { puts "What's the big deal" }
4252 * threads << Thread.new { 3.times { puts "Threads are fun!" } }
4253 *
4254 * After creating a few threads we wait for them all to finish
4255 * consecutively.
4256 *
4257 * threads.each { |thr| thr.join }
4258 *
4259 * To retrieve the last value of a thread, use #value
4260 *
4261 * thr = Thread.new { sleep 1; "Useful value" }
4262 * thr.value #=> "Useful value"
4263 *
4264 * === Thread initialization
4265 *
4266 * In order to create new threads, Ruby provides ::new, ::start, and
4267 * ::fork. A block must be provided with each of these methods, otherwise
4268 * a ThreadError will be raised.
4269 *
4270 * When subclassing the Thread class, the +initialize+ method of your
4271 * subclass will be ignored by ::start and ::fork. Otherwise, be sure to
4272 * call super in your +initialize+ method.
4273 *
4274 * === Thread termination
4275 *
4276 * For terminating threads, Ruby provides a variety of ways to do this.
4277 *
4278 * The class method ::kill, is meant to exit a given thread:
4279 *
4280 * thr = Thread.new { sleep }
4281 * Thread.kill(thr) # sends exit() to thr
4282 *
4283 * Alternatively, you can use the instance method #exit, or any of its
4284 * aliases #kill or #terminate.
4285 *
4286 * thr.exit
4287 *
4288 * === Thread status
4289 *
4290 * Ruby provides a few instance methods for querying the state of a given
4291 * thread. To get a string with the current thread's state use #status
4292 *
4293 * thr = Thread.new { sleep }
4294 * thr.status # => "sleep"
4295 * thr.exit
4296 * thr.status # => false
4297 *
4298 * You can also use #alive? to tell if the thread is running or sleeping,
4299 * and #stop? if the thread is dead or sleeping.
4300 *
4301 * === Thread variables and scope
4302 *
4303 * Since threads are created with blocks, the same rules apply to other
4304 * Ruby blocks for variable scope. Any local variables created within this
4305 * block are accessible to only this thread.
4306 *
4307 * ==== Fiber-local vs. Thread-local
4308 *
4309 * Each fiber has its own bucket for Thread#[] storage. When you set a
4310 * new fiber-local it is only accessible within this Fiber. To illustrate:
4311 *
4312 * Thread.new {
4313 * Thread.current[:foo] = "bar"
4314 * Fiber.new {
4315 * p Thread.current[:foo] # => nil
4316 * }.resume
4317 * }.join
4318 *
4319 * This example uses #[] for getting and #[]= for setting fiber-locals,
4320 * you can also use #keys to list the fiber-locals for a given
4321 * thread and #key? to check if a fiber-local exists.
4322 *
4323 * When it comes to thread-locals, they are accessible within the entire
4324 * scope of the thread. Given the following example:
4325 *
4326 * Thread.new{
4327 * Thread.current.thread_variable_set(:foo, 1)
4328 * p Thread.current.thread_variable_get(:foo) # => 1
4329 * Fiber.new{
4330 * Thread.current.thread_variable_set(:foo, 2)
4331 * p Thread.current.thread_variable_get(:foo) # => 2
4332 * }.resume
4333 * p Thread.current.thread_variable_get(:foo) # => 2
4334 * }.join
4335 *
4336 * You can see that the thread-local +:foo+ carried over into the fiber
4337 * and was changed to +2+ by the end of the thread.
4338 *
4339 * This example makes use of #thread_variable_set to create new
4340 * thread-locals, and #thread_variable_get to reference them.
4341 *
4342 * There is also #thread_variables to list all thread-locals, and
4343 * #thread_variable? to check if a given thread-local exists.
4344 *
4345 * === Exception handling
4346 *
4347 * When an unhandled exception is raised inside a thread, it will
4348 * terminate. By default, this exception will not propagate to other
4349 * threads. The exception is stored and when another thread calls #value
4350 * or #join, the exception will be re-raised in that thread.
4351 *
4352 * t = Thread.new{ raise 'something went wrong' }
4353 * t.value #=> RuntimeError: something went wrong
4354 *
4355 * An exception can be raised from outside the thread using the
4356 * Thread#raise instance method, which takes the same parameters as
4357 * Kernel#raise.
4358 *
4359 * Setting Thread.abort_on_exception = true, Thread#abort_on_exception =
4360 * true, or $DEBUG = true will cause a subsequent unhandled exception
4361 * raised in a thread to be automatically re-raised in the main thread.
4362 *
4363 * With the addition of the class method ::handle_interrupt, you can now
4364 * handle exceptions asynchronously with threads.
4365 *
4366 * === Scheduling
4367 *
4368 * Ruby provides a few ways to support scheduling threads in your program.
4369 *
4370 * The first way is by using the class method ::stop, to put the current
4371 * running thread to sleep and schedule the execution of another thread.
4372 *
4373 * Once a thread is asleep, you can use the instance method #wakeup to
4374 * mark your thread as eligible for scheduling.
4375 *
4376 * You can also try ::pass, which attempts to pass execution to another
4377 * thread but is dependent on the OS whether a running thread will switch
4378 * or not. The same goes for #priority, which lets you hint to the thread
4379 * scheduler which threads you want to take precedence when passing
4380 * execution. This method is also dependent on the OS and may be ignored
4381 * on some platforms.
4382 *
4383 */
4384 rb_cThread = rb_define_class("Thread", rb_cObject);
4386
4387#if VM_COLLECT_USAGE_DETAILS
4388 /* ::RubyVM::USAGE_ANALYSIS_* */
4389#define define_usage_analysis_hash(name) /* shut up rdoc -C */ \
4390 rb_define_const(rb_cRubyVM, "USAGE_ANALYSIS_" #name, rb_hash_new())
4391 define_usage_analysis_hash(INSN);
4392 define_usage_analysis_hash(REGS);
4393 define_usage_analysis_hash(INSN_BIGRAM);
4394
4395 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_INSN_START", usage_analysis_insn_start, 0);
4396 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_OPERAND_START", usage_analysis_operand_start, 0);
4397 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_REGISTER_START", usage_analysis_register_start, 0);
4398 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_INSN_STOP", usage_analysis_insn_stop, 0);
4399 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_OPERAND_STOP", usage_analysis_operand_stop, 0);
4400 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_REGISTER_STOP", usage_analysis_register_stop, 0);
4401 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_INSN_RUNNING", usage_analysis_insn_running, 0);
4402 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_OPERAND_RUNNING", usage_analysis_operand_running, 0);
4403 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_REGISTER_RUNNING", usage_analysis_register_running, 0);
4404 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_INSN_CLEAR", usage_analysis_insn_clear, 0);
4405 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_OPERAND_CLEAR", usage_analysis_operand_clear, 0);
4406 rb_define_singleton_method(rb_cRubyVM, "USAGE_ANALYSIS_REGISTER_CLEAR", usage_analysis_register_clear, 0);
4407#endif
4408
4409 /* ::RubyVM::OPTS
4410 * An Array of VM build options.
4411 * This constant is MRI specific.
4412 */
4413 rb_define_const(rb_cRubyVM, "OPTS", opts = rb_ary_new());
4414
4415#if OPT_DIRECT_THREADED_CODE
4416 rb_ary_push(opts, rb_str_new2("direct threaded code"));
4417#elif OPT_TOKEN_THREADED_CODE
4418 rb_ary_push(opts, rb_str_new2("token threaded code"));
4419#elif OPT_CALL_THREADED_CODE
4420 rb_ary_push(opts, rb_str_new2("call threaded code"));
4421#endif
4422
4423#if OPT_OPERANDS_UNIFICATION
4424 rb_ary_push(opts, rb_str_new2("operands unification"));
4425#endif
4426#if OPT_INSTRUCTIONS_UNIFICATION
4427 rb_ary_push(opts, rb_str_new2("instructions unification"));
4428#endif
4429#if OPT_INLINE_METHOD_CACHE
4430 rb_ary_push(opts, rb_str_new2("inline method cache"));
4431#endif
4432
4433 /* ::RubyVM::INSTRUCTION_NAMES
4434 * A list of bytecode instruction names in MRI.
4435 * This constant is MRI specific.
4436 */
4437 rb_define_const(rb_cRubyVM, "INSTRUCTION_NAMES", rb_insns_name_array());
4438
4439 /* ::RubyVM::DEFAULT_PARAMS
4440 * This constant exposes the VM's default parameters.
4441 * Note that changing these values does not affect VM execution.
4442 * Specification is not stable and you should not depend on this value.
4443 * Of course, this constant is MRI specific.
4444 */
4445 rb_define_const(rb_cRubyVM, "DEFAULT_PARAMS", vm_default_params());
4446
4447 /* debug functions ::RubyVM::SDR(), ::RubyVM::NSDR() */
4448#if VMDEBUG
4449 rb_define_singleton_method(rb_cRubyVM, "SDR", sdr, 0);
4450 rb_define_singleton_method(rb_cRubyVM, "NSDR", nsdr, 0);
4451 rb_define_singleton_method(rb_cRubyVM, "mtbl", vm_mtbl, 2);
4452 rb_define_singleton_method(rb_cRubyVM, "mtbl2", vm_mtbl2, 2);
4453#else
4454 (void)sdr;
4455 (void)nsdr;
4456 (void)vm_mtbl;
4457 (void)vm_mtbl2;
4458#endif
4459
4460 /* VM bootstrap: phase 2 */
4461 {
4462 rb_vm_t *vm = ruby_current_vm_ptr;
4463 rb_thread_t *th = GET_THREAD();
4464 VALUE filename = rb_fstring_lit("<main>");
4465 const rb_iseq_t *iseq = rb_iseq_new(Qnil, filename, filename, Qnil, 0, ISEQ_TYPE_TOP);
4466
4467 // Ractor setup
4468 rb_ractor_main_setup(vm, th->ractor, th);
4469
4470 /* create vm object */
4471 vm->self = TypedData_Wrap_Struct(rb_cRubyVM, &vm_data_type, vm);
4472
4473 /* create main thread */
4474 th->self = TypedData_Wrap_Struct(rb_cThread, &thread_data_type, th);
4475 vm->ractor.main_thread = th;
4476 vm->ractor.main_ractor = th->ractor;
4477 th->vm = vm;
4478 th->top_wrapper = 0;
4479 th->top_self = rb_vm_top_self();
4480
4481 rb_vm_register_global_object((VALUE)iseq);
4482 th->ec->cfp->iseq = iseq;
4483 th->ec->cfp->pc = ISEQ_BODY(iseq)->iseq_encoded;
4484 th->ec->cfp->self = th->top_self;
4485
4486 VM_ENV_FLAGS_UNSET(th->ec->cfp->ep, VM_FRAME_FLAG_CFRAME);
4487 VM_STACK_ENV_WRITE(th->ec->cfp->ep, VM_ENV_DATA_INDEX_ME_CREF, (VALUE)vm_cref_new(rb_cObject, METHOD_VISI_PRIVATE, FALSE, NULL, FALSE, FALSE));
4488
4489 /*
4490 * The Binding of the top level scope
4491 */
4492 rb_define_global_const("TOPLEVEL_BINDING", rb_binding_new());
4493
4494#ifdef _WIN32
4495 rb_objspace_gc_enable(vm->gc.objspace);
4496#endif
4497 }
4498 vm_init_redefined_flag();
4499
4500 rb_block_param_proxy = rb_obj_alloc(rb_cObject);
4501 rb_add_method_optimized(rb_singleton_class(rb_block_param_proxy), idCall,
4502 OPTIMIZED_METHOD_TYPE_BLOCK_CALL, 0, METHOD_VISI_PUBLIC);
4503 rb_obj_freeze(rb_block_param_proxy);
4504 rb_vm_register_global_object(rb_block_param_proxy);
4505
4506 /* vm_backtrace.c */
4507 Init_vm_backtrace();
4508}
4509
4510void
4511rb_vm_set_progname(VALUE filename)
4512{
4513 rb_thread_t *th = GET_VM()->ractor.main_thread;
4514 rb_control_frame_t *cfp = (void *)(th->ec->vm_stack + th->ec->vm_stack_size);
4515 --cfp;
4516
4517 filename = rb_str_new_frozen(filename);
4518 rb_iseq_pathobj_set(cfp->iseq, filename, rb_iseq_realpath(cfp->iseq));
4519}
4520
4521extern const struct st_hash_type rb_fstring_hash_type;
4522
4523void
4524Init_BareVM(void)
4525{
4526 /* VM bootstrap: phase 1 */
4527 rb_vm_t *vm = ruby_mimcalloc(1, sizeof(*vm));
4528 rb_thread_t *th = ruby_mimcalloc(1, sizeof(*th));
4529 if (!vm || !th) {
4530 fputs("[FATAL] failed to allocate memory\n", stderr);
4531 exit(EXIT_FAILURE);
4532 }
4533
4534 // setup the VM
4535 vm_init2(vm);
4536
4537 rb_vm_postponed_job_queue_init(vm);
4538 ruby_current_vm_ptr = vm;
4539 rb_objspace_alloc();
4540 vm->negative_cme_table = rb_id_table_create(16);
4541 vm->overloaded_cme_table = st_init_numtable();
4542 vm->constant_cache = rb_id_table_create(0);
4543 vm->unused_block_warning_table = set_init_numtable();
4544
4545 // setup main thread
4546 th->nt = ZALLOC(struct rb_native_thread);
4547 th->vm = vm;
4548 th->ractor = vm->ractor.main_ractor = rb_ractor_main_alloc();
4549 Init_native_thread(th);
4550 rb_jit_cont_init();
4551 th_init(th, 0, vm);
4552
4553 rb_ractor_set_current_ec(th->ractor, th->ec);
4554 /* n.b. native_main_thread_stack_top is set by the INIT_STACK macro */
4555 ruby_thread_init_stack(th, native_main_thread_stack_top);
4556
4557 // setup ractor system
4558 rb_native_mutex_initialize(&vm->ractor.sync.lock);
4559 rb_native_cond_initialize(&vm->ractor.sync.terminate_cond);
4560
4561 vm_opt_method_def_table = st_init_numtable();
4562 vm_opt_mid_table = st_init_numtable();
4563
4564#ifdef RUBY_THREAD_WIN32_H
4565 rb_native_cond_initialize(&vm->ractor.sync.barrier_complete_cond);
4566 rb_native_cond_initialize(&vm->ractor.sync.barrier_release_cond);
4567#endif
4568}
4569
4570void
4572{
4573 native_main_thread_stack_top = addr;
4574}
4575
4576#ifndef _WIN32
4577#include <unistd.h>
4578#include <sys/mman.h>
4579#endif
4580
4581
4582#ifndef MARK_OBJECT_ARY_BUCKET_SIZE
4583#define MARK_OBJECT_ARY_BUCKET_SIZE 1024
4584#endif
4585
4587 VALUE next;
4588 long len;
4589 VALUE *array;
4590};
4591
4592static void
4593pin_array_list_mark(void *data)
4594{
4595 struct pin_array_list *array = (struct pin_array_list *)data;
4596 rb_gc_mark_movable(array->next);
4597
4598 rb_gc_mark_vm_stack_values(array->len, array->array);
4599}
4600
4601static void
4602pin_array_list_free(void *data)
4603{
4604 struct pin_array_list *array = (struct pin_array_list *)data;
4605 xfree(array->array);
4606}
4607
4608static size_t
4609pin_array_list_memsize(const void *data)
4610{
4611 return sizeof(struct pin_array_list) + (MARK_OBJECT_ARY_BUCKET_SIZE * sizeof(VALUE));
4612}
4613
4614static void
4615pin_array_list_update_references(void *data)
4616{
4617 struct pin_array_list *array = (struct pin_array_list *)data;
4618 array->next = rb_gc_location(array->next);
4619}
4620
4621static const rb_data_type_t pin_array_list_type = {
4622 .wrap_struct_name = "VM/pin_array_list",
4623 .function = {
4624 .dmark = pin_array_list_mark,
4625 .dfree = pin_array_list_free,
4626 .dsize = pin_array_list_memsize,
4627 .dcompact = pin_array_list_update_references,
4628 },
4629 .flags = RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_EMBEDDABLE,
4630};
4631
4632static VALUE
4633pin_array_list_new(VALUE next)
4634{
4635 struct pin_array_list *array_list;
4636 VALUE obj = TypedData_Make_Struct(0, struct pin_array_list, &pin_array_list_type, array_list);
4637 RB_OBJ_WRITE(obj, &array_list->next, next);
4638 array_list->array = ALLOC_N(VALUE, MARK_OBJECT_ARY_BUCKET_SIZE);
4639 return obj;
4640}
4641
4642static VALUE
4643pin_array_list_append(VALUE obj, VALUE item)
4644{
4645 struct pin_array_list *array_list;
4646 TypedData_Get_Struct(obj, struct pin_array_list, &pin_array_list_type, array_list);
4647
4648 if (array_list->len >= MARK_OBJECT_ARY_BUCKET_SIZE) {
4649 obj = pin_array_list_new(obj);
4650 TypedData_Get_Struct(obj, struct pin_array_list, &pin_array_list_type, array_list);
4651 }
4652
4653 RB_OBJ_WRITE(obj, &array_list->array[array_list->len], item);
4654 array_list->len++;
4655 return obj;
4656}
4657
4658void
4659rb_vm_register_global_object(VALUE obj)
4660{
4662 if (RB_SPECIAL_CONST_P(obj)) {
4663 return;
4664 }
4665
4666 switch (RB_BUILTIN_TYPE(obj)) {
4667 case T_CLASS:
4668 case T_MODULE:
4669 if (FL_TEST(obj, RCLASS_IS_ROOT)) {
4670 return;
4671 }
4672 FL_SET(obj, RCLASS_IS_ROOT);
4673 break;
4674 default:
4675 break;
4676 }
4677 RB_VM_LOCKING() {
4678 VALUE list = GET_VM()->mark_object_ary;
4679 VALUE head = pin_array_list_append(list, obj);
4680 if (head != list) {
4681 GET_VM()->mark_object_ary = head;
4682 }
4683 RB_GC_GUARD(obj);
4684 }
4685}
4686
4687void
4688Init_vm_objects(void)
4689{
4690 rb_vm_t *vm = GET_VM();
4691
4692 /* initialize mark object array, hash */
4693 vm->mark_object_ary = pin_array_list_new(Qnil);
4694 vm->ci_table = st_init_table(&vm_ci_hashtype);
4695 vm->cc_refinement_table = rb_set_init_numtable();
4696}
4697
4698#if USE_ZJIT
4699extern VALUE rb_zjit_option_enabled_p(rb_execution_context_t *ec, VALUE self);
4700#else
4701static VALUE rb_zjit_option_enabled_p(rb_execution_context_t *ec, VALUE self) { return Qfalse; }
4702#endif
4703
4704// Whether JIT is enabled or not, we need to load/undef `#with_jit` for other builtins.
4705#include "jit_hook.rbinc"
4706#include "jit_undef.rbinc"
4707
4708// Stub for builtin function when not building YJIT units
4709#if !USE_YJIT
4710void Init_builtin_yjit(void) {}
4711#endif
4712
4713// Stub for builtin function when not building ZJIT units
4714#if !USE_ZJIT
4715void Init_builtin_zjit(void) {}
4716#endif
4717
4718/* top self */
4719
4720static VALUE
4721main_to_s(VALUE obj)
4722{
4723 return rb_str_new2("main");
4724}
4725
4726VALUE
4727rb_vm_top_self(void)
4728{
4729 const rb_namespace_t *ns = rb_current_namespace();
4730 VM_ASSERT(ns);
4731 VM_ASSERT(ns->top_self);
4732 return ns->top_self;
4733}
4734
4735void
4736Init_top_self(void)
4737{
4738 rb_vm_t *vm = GET_VM();
4739 vm->root_namespace = (rb_namespace_t *)rb_root_namespace();
4740 vm->root_namespace->top_self = rb_obj_alloc(rb_cObject);
4741 rb_define_singleton_method(vm->root_namespace->top_self, "to_s", main_to_s, 0);
4742 rb_define_alias(rb_singleton_class(vm->root_namespace->top_self), "inspect", "to_s");
4743}
4744
4745VALUE *
4747{
4748 rb_ractor_t *cr = GET_RACTOR();
4749 return &cr->verbose;
4750}
4751
4752VALUE *
4754{
4755 rb_ractor_t *cr = GET_RACTOR();
4756 return &cr->debug;
4757}
4758
4759bool rb_free_at_exit = false;
4760
4761bool
4762ruby_free_at_exit_p(void)
4763{
4764 return rb_free_at_exit;
4765}
4766
4767/* iseq.c */
4768VALUE rb_insn_operand_intern(const rb_iseq_t *iseq,
4769 VALUE insn, int op_no, VALUE op,
4770 int len, size_t pos, VALUE *pnop, VALUE child);
4771
4772#if VM_COLLECT_USAGE_DETAILS
4773
4774#define HASH_ASET(h, k, v) rb_hash_aset((h), (st_data_t)(k), (st_data_t)(v))
4775
4776/* uh = {
4777 * insn(Fixnum) => ihash(Hash)
4778 * }
4779 * ihash = {
4780 * -1(Fixnum) => count, # insn usage
4781 * 0(Fixnum) => ophash, # operand usage
4782 * }
4783 * ophash = {
4784 * val(interned string) => count(Fixnum)
4785 * }
4786 */
4787static void
4788vm_analysis_insn(int insn)
4789{
4790 ID usage_hash;
4791 ID bigram_hash;
4792 static int prev_insn = -1;
4793
4794 VALUE uh;
4795 VALUE ihash;
4796 VALUE cv;
4797
4798 CONST_ID(usage_hash, "USAGE_ANALYSIS_INSN");
4799 CONST_ID(bigram_hash, "USAGE_ANALYSIS_INSN_BIGRAM");
4800 uh = rb_const_get(rb_cRubyVM, usage_hash);
4801 if (NIL_P(ihash = rb_hash_aref(uh, INT2FIX(insn)))) {
4802 ihash = rb_hash_new();
4803 HASH_ASET(uh, INT2FIX(insn), ihash);
4804 }
4805 if (NIL_P(cv = rb_hash_aref(ihash, INT2FIX(-1)))) {
4806 cv = INT2FIX(0);
4807 }
4808 HASH_ASET(ihash, INT2FIX(-1), INT2FIX(FIX2INT(cv) + 1));
4809
4810 /* calc bigram */
4811 if (prev_insn != -1) {
4812 VALUE bi;
4813 VALUE ary[2];
4814 VALUE cv;
4815
4816 ary[0] = INT2FIX(prev_insn);
4817 ary[1] = INT2FIX(insn);
4818 bi = rb_ary_new4(2, &ary[0]);
4819
4820 uh = rb_const_get(rb_cRubyVM, bigram_hash);
4821 if (NIL_P(cv = rb_hash_aref(uh, bi))) {
4822 cv = INT2FIX(0);
4823 }
4824 HASH_ASET(uh, bi, INT2FIX(FIX2INT(cv) + 1));
4825 }
4826 prev_insn = insn;
4827}
4828
4829static void
4830vm_analysis_operand(int insn, int n, VALUE op)
4831{
4832 ID usage_hash;
4833
4834 VALUE uh;
4835 VALUE ihash;
4836 VALUE ophash;
4837 VALUE valstr;
4838 VALUE cv;
4839
4840 CONST_ID(usage_hash, "USAGE_ANALYSIS_INSN");
4841
4842 uh = rb_const_get(rb_cRubyVM, usage_hash);
4843 if (NIL_P(ihash = rb_hash_aref(uh, INT2FIX(insn)))) {
4844 ihash = rb_hash_new();
4845 HASH_ASET(uh, INT2FIX(insn), ihash);
4846 }
4847 if (NIL_P(ophash = rb_hash_aref(ihash, INT2FIX(n)))) {
4848 ophash = rb_hash_new();
4849 HASH_ASET(ihash, INT2FIX(n), ophash);
4850 }
4851 /* intern */
4852 valstr = rb_insn_operand_intern(GET_EC()->cfp->iseq, insn, n, op, 0, 0, 0, 0);
4853
4854 /* set count */
4855 if (NIL_P(cv = rb_hash_aref(ophash, valstr))) {
4856 cv = INT2FIX(0);
4857 }
4858 HASH_ASET(ophash, valstr, INT2FIX(FIX2INT(cv) + 1));
4859}
4860
4861static void
4862vm_analysis_register(int reg, int isset)
4863{
4864 ID usage_hash;
4865 VALUE uh;
4866 VALUE valstr;
4867 static const char regstrs[][5] = {
4868 "pc", /* 0 */
4869 "sp", /* 1 */
4870 "ep", /* 2 */
4871 "cfp", /* 3 */
4872 "self", /* 4 */
4873 "iseq", /* 5 */
4874 };
4875 static const char getsetstr[][4] = {
4876 "get",
4877 "set",
4878 };
4879 static VALUE syms[sizeof(regstrs) / sizeof(regstrs[0])][2];
4880
4881 VALUE cv;
4882
4883 CONST_ID(usage_hash, "USAGE_ANALYSIS_REGS");
4884 if (syms[0] == 0) {
4885 char buff[0x10];
4886 int i;
4887
4888 for (i = 0; i < (int)(sizeof(regstrs) / sizeof(regstrs[0])); i++) {
4889 int j;
4890 for (j = 0; j < 2; j++) {
4891 snprintf(buff, 0x10, "%d %s %-4s", i, getsetstr[j], regstrs[i]);
4892 syms[i][j] = ID2SYM(rb_intern(buff));
4893 }
4894 }
4895 }
4896 valstr = syms[reg][isset];
4897
4898 uh = rb_const_get(rb_cRubyVM, usage_hash);
4899 if (NIL_P(cv = rb_hash_aref(uh, valstr))) {
4900 cv = INT2FIX(0);
4901 }
4902 HASH_ASET(uh, valstr, INT2FIX(FIX2INT(cv) + 1));
4903}
4904
4905#undef HASH_ASET
4906
4907static void (*ruby_vm_collect_usage_func_insn)(int insn) = NULL;
4908static void (*ruby_vm_collect_usage_func_operand)(int insn, int n, VALUE op) = NULL;
4909static void (*ruby_vm_collect_usage_func_register)(int reg, int isset) = NULL;
4910
4911/* :nodoc: */
4912static VALUE
4913usage_analysis_insn_start(VALUE self)
4914{
4915 ruby_vm_collect_usage_func_insn = vm_analysis_insn;
4916 return Qnil;
4917}
4918
4919/* :nodoc: */
4920static VALUE
4921usage_analysis_operand_start(VALUE self)
4922{
4923 ruby_vm_collect_usage_func_operand = vm_analysis_operand;
4924 return Qnil;
4925}
4926
4927/* :nodoc: */
4928static VALUE
4929usage_analysis_register_start(VALUE self)
4930{
4931 ruby_vm_collect_usage_func_register = vm_analysis_register;
4932 return Qnil;
4933}
4934
4935/* :nodoc: */
4936static VALUE
4937usage_analysis_insn_stop(VALUE self)
4938{
4939 ruby_vm_collect_usage_func_insn = 0;
4940 return Qnil;
4941}
4942
4943/* :nodoc: */
4944static VALUE
4945usage_analysis_operand_stop(VALUE self)
4946{
4947 ruby_vm_collect_usage_func_operand = 0;
4948 return Qnil;
4949}
4950
4951/* :nodoc: */
4952static VALUE
4953usage_analysis_register_stop(VALUE self)
4954{
4955 ruby_vm_collect_usage_func_register = 0;
4956 return Qnil;
4957}
4958
4959/* :nodoc: */
4960static VALUE
4961usage_analysis_insn_running(VALUE self)
4962{
4963 return RBOOL(ruby_vm_collect_usage_func_insn != 0);
4964}
4965
4966/* :nodoc: */
4967static VALUE
4968usage_analysis_operand_running(VALUE self)
4969{
4970 return RBOOL(ruby_vm_collect_usage_func_operand != 0);
4971}
4972
4973/* :nodoc: */
4974static VALUE
4975usage_analysis_register_running(VALUE self)
4976{
4977 return RBOOL(ruby_vm_collect_usage_func_register != 0);
4978}
4979
4980static VALUE
4981usage_analysis_clear(VALUE self, ID usage_hash)
4982{
4983 VALUE uh;
4984 uh = rb_const_get(self, usage_hash);
4985 rb_hash_clear(uh);
4986
4987 return Qtrue;
4988}
4989
4990
4991/* :nodoc: */
4992static VALUE
4993usage_analysis_insn_clear(VALUE self)
4994{
4995 ID usage_hash;
4996 ID bigram_hash;
4997
4998 CONST_ID(usage_hash, "USAGE_ANALYSIS_INSN");
4999 CONST_ID(bigram_hash, "USAGE_ANALYSIS_INSN_BIGRAM");
5000 usage_analysis_clear(rb_cRubyVM, usage_hash);
5001 return usage_analysis_clear(rb_cRubyVM, bigram_hash);
5002}
5003
5004/* :nodoc: */
5005static VALUE
5006usage_analysis_operand_clear(VALUE self)
5007{
5008 ID usage_hash;
5009
5010 CONST_ID(usage_hash, "USAGE_ANALYSIS_INSN");
5011 return usage_analysis_clear(self, usage_hash);
5012}
5013
5014/* :nodoc: */
5015static VALUE
5016usage_analysis_register_clear(VALUE self)
5017{
5018 ID usage_hash;
5019
5020 CONST_ID(usage_hash, "USAGE_ANALYSIS_REGS");
5021 return usage_analysis_clear(self, usage_hash);
5022}
5023
5024#else
5025
5026MAYBE_UNUSED(static void (*ruby_vm_collect_usage_func_insn)(int insn)) = 0;
5027MAYBE_UNUSED(static void (*ruby_vm_collect_usage_func_operand)(int insn, int n, VALUE op)) = 0;
5028MAYBE_UNUSED(static void (*ruby_vm_collect_usage_func_register)(int reg, int isset)) = 0;
5029
5030#endif
5031
5032#if VM_COLLECT_USAGE_DETAILS
5033/* @param insn instruction number */
5034static void
5035vm_collect_usage_insn(int insn)
5036{
5037 if (RUBY_DTRACE_INSN_ENABLED()) {
5038 RUBY_DTRACE_INSN(rb_insns_name(insn));
5039 }
5040 if (ruby_vm_collect_usage_func_insn)
5041 (*ruby_vm_collect_usage_func_insn)(insn);
5042}
5043
5044/* @param insn instruction number
5045 * @param n n-th operand
5046 * @param op operand value
5047 */
5048static void
5049vm_collect_usage_operand(int insn, int n, VALUE op)
5050{
5051 if (RUBY_DTRACE_INSN_OPERAND_ENABLED()) {
5052 VALUE valstr;
5053
5054 valstr = rb_insn_operand_intern(GET_EC()->cfp->iseq, insn, n, op, 0, 0, 0, 0);
5055
5056 RUBY_DTRACE_INSN_OPERAND(RSTRING_PTR(valstr), rb_insns_name(insn));
5057 RB_GC_GUARD(valstr);
5058 }
5059 if (ruby_vm_collect_usage_func_operand)
5060 (*ruby_vm_collect_usage_func_operand)(insn, n, op);
5061}
5062
5063/* @param reg register id. see code of vm_analysis_register() */
5064/* @param isset 0: read, 1: write */
5065static void
5066vm_collect_usage_register(int reg, int isset)
5067{
5068 if (ruby_vm_collect_usage_func_register)
5069 (*ruby_vm_collect_usage_func_register)(reg, isset);
5070}
5071#endif
5072
5073const struct rb_callcache *
5074rb_vm_empty_cc(void)
5075{
5076 return &vm_empty_cc;
5077}
5078
5079const struct rb_callcache *
5080rb_vm_empty_cc_for_super(void)
5081{
5082 return &vm_empty_cc_for_super;
5083}
5084
5085#include "vm_call_iseq_optimized.inc" /* required from vm_insnhelper.c */
#define RUBY_ASSERT_MESG(expr,...)
Asserts that the expression is truthy.
Definition assert.h:186
#define RUBY_ASSERT(...)
Asserts that the given expression is truthy if and only if RUBY_DEBUG is truthy.
Definition assert.h:219
std::atomic< unsigned > rb_atomic_t
Type that is eligible for atomic operations.
Definition atomic.h:69
#define RUBY_ATOMIC_FETCH_ADD(var, val)
Atomically replaces the value pointed by var with the result of addition of val to the old value of v...
Definition atomic.h:118
#define rb_define_method(klass, mid, func, arity)
Defines klass#mid.
#define rb_define_method_id(klass, mid, func, arity)
Defines klass#mid.
#define rb_define_singleton_method(klass, mid, func, arity)
Defines klass.mid.
#define RUBY_EVENT_END
Encountered an end of a class clause.
Definition event.h:40
#define RUBY_EVENT_B_RETURN
Encountered a next statement.
Definition event.h:56
#define RUBY_EVENT_RETURN
Encountered a return statement.
Definition event.h:42
#define RUBY_EVENT_C_RETURN
Return from a method, written in C.
Definition event.h:44
uint32_t rb_event_flag_t
Represents event(s).
Definition event.h:108
VALUE rb_define_class(const char *name, VALUE super)
Defines a top-level class.
Definition class.c:1603
VALUE rb_class_new(VALUE super)
Creates a new, anonymous class.
Definition class.c:983
VALUE rb_singleton_class(VALUE obj)
Finds or creates the singleton class of the passed object.
Definition class.c:2914
void rb_define_alias(VALUE klass, const char *name1, const char *name2)
Defines an alias of a method.
Definition class.c:2962
void rb_undef_method(VALUE klass, const char *name)
Defines an undef of a method.
Definition class.c:2782
#define rb_str_new2
Old name of rb_str_new_cstr.
Definition string.h:1674
#define NUM2ULONG
Old name of RB_NUM2ULONG.
Definition long.h:52
#define ALLOCV
Old name of RB_ALLOCV.
Definition memory.h:404
#define ALLOC
Old name of RB_ALLOC.
Definition memory.h:400
#define xfree
Old name of ruby_xfree.
Definition xmalloc.h:58
#define Qundef
Old name of RUBY_Qundef.
#define INT2FIX
Old name of RB_INT2FIX.
Definition long.h:48
#define T_IMEMO
Old name of RUBY_T_IMEMO.
Definition value_type.h:67
#define ID2SYM
Old name of RB_ID2SYM.
Definition symbol.h:44
#define OBJ_FREEZE
Old name of RB_OBJ_FREEZE.
Definition fl_type.h:134
#define ULONG2NUM
Old name of RB_ULONG2NUM.
Definition long.h:60
#define UNREACHABLE_RETURN
Old name of RBIMPL_UNREACHABLE_RETURN.
Definition assume.h:29
#define SYM2ID
Old name of RB_SYM2ID.
Definition symbol.h:45
#define ZALLOC
Old name of RB_ZALLOC.
Definition memory.h:402
#define CLASS_OF
Old name of rb_class_of.
Definition globals.h:206
#define rb_ary_new4
Old name of rb_ary_new_from_values.
Definition array.h:659
#define SIZET2NUM
Old name of RB_SIZE2NUM.
Definition size_t.h:62
#define rb_exc_new2
Old name of rb_exc_new_cstr.
Definition error.h:37
#define FIX2INT
Old name of RB_FIX2INT.
Definition int.h:41
#define T_MODULE
Old name of RUBY_T_MODULE.
Definition value_type.h:70
#define ZALLOC_N
Old name of RB_ZALLOC_N.
Definition memory.h:401
#define ASSUME
Old name of RBIMPL_ASSUME.
Definition assume.h:27
#define T_ICLASS
Old name of RUBY_T_ICLASS.
Definition value_type.h:66
#define T_HASH
Old name of RUBY_T_HASH.
Definition value_type.h:65
#define ALLOC_N
Old name of RB_ALLOC_N.
Definition memory.h:399
#define FL_SET
Old name of RB_FL_SET.
Definition fl_type.h:128
#define rb_exc_new3
Old name of rb_exc_new_str.
Definition error.h:38
#define ULL2NUM
Old name of RB_ULL2NUM.
Definition long_long.h:31
#define Qtrue
Old name of RUBY_Qtrue.
#define Qnil
Old name of RUBY_Qnil.
#define Qfalse
Old name of RUBY_Qfalse.
#define NIL_P
Old name of RB_NIL_P.
#define NUM2ULL
Old name of RB_NUM2ULL.
Definition long_long.h:35
#define T_CLASS
Old name of RUBY_T_CLASS.
Definition value_type.h:58
#define BUILTIN_TYPE
Old name of RB_BUILTIN_TYPE.
Definition value_type.h:85
#define FL_TEST
Old name of RB_FL_TEST.
Definition fl_type.h:130
#define FIXNUM_P
Old name of RB_FIXNUM_P.
#define FL_USHIFT
Old name of RUBY_FL_USHIFT.
Definition fl_type.h:68
#define CONST_ID
Old name of RUBY_CONST_ID.
Definition symbol.h:47
#define ALLOCV_END
Old name of RB_ALLOCV_END.
Definition memory.h:406
#define SYMBOL_P
Old name of RB_SYMBOL_P.
Definition value_type.h:88
void ruby_init_stack(void *addr)
Set stack bottom of Ruby implementation.
Definition vm.c:4571
VALUE rb_eLocalJumpError
LocalJumpError exception.
Definition eval.c:48
void rb_category_warn(rb_warning_category_t category, const char *fmt,...)
Identical to rb_category_warning(), except it reports unless $VERBOSE is nil.
Definition error.c:476
void rb_exc_raise(VALUE mesg)
Raises an exception in the current thread.
Definition eval.c:683
int rb_typeddata_is_kind_of(VALUE obj, const rb_data_type_t *data_type)
Checks if the given object is of given kind.
Definition error.c:1380
void rb_iter_break(void)
Breaks from a block.
Definition vm.c:2255
VALUE rb_eTypeError
TypeError exception.
Definition error.c:1430
void rb_iter_break_value(VALUE val)
Identical to rb_iter_break(), except it additionally takes the "value" of this breakage.
Definition vm.c:2261
VALUE rb_eRuntimeError
RuntimeError exception.
Definition error.c:1428
VALUE * rb_ruby_verbose_ptr(void)
This is an implementation detail of ruby_verbose.
Definition vm.c:4746
VALUE rb_exc_new_str(VALUE etype, VALUE str)
Identical to rb_exc_new_cstr(), except it takes a Ruby's string instead of C's.
Definition error.c:1481
VALUE * rb_ruby_debug_ptr(void)
This is an implementation detail of ruby_debug.
Definition vm.c:4753
VALUE rb_eSysStackError
SystemStackError exception.
Definition eval.c:49
@ RB_WARN_CATEGORY_PERFORMANCE
Warning is for performance issues (not enabled by -w).
Definition error.h:54
VALUE rb_cTime
Time class.
Definition time.c:679
VALUE rb_cArray
Array class.
VALUE rb_obj_alloc(VALUE klass)
Allocates an instance of the given class.
Definition object.c:2164
VALUE rb_cInteger
Module class.
Definition numeric.c:198
VALUE rb_cNilClass
NilClass class.
Definition object.c:66
VALUE rb_cBinding
Binding class.
Definition proc.c:44
VALUE rb_cRegexp
Regexp class.
Definition re.c:2657
VALUE rb_cHash
Hash class.
Definition hash.c:109
VALUE rb_cFalseClass
FalseClass class.
Definition object.c:68
VALUE rb_obj_class(VALUE obj)
Queries the class of an object.
Definition object.c:265
VALUE rb_cSymbol
Symbol class.
Definition string.c:85
VALUE rb_cBasicObject
BasicObject class.
Definition object.c:59
VALUE rb_cThread
Thread class.
Definition vm.c:652
VALUE rb_obj_freeze(VALUE obj)
Just calls rb_obj_freeze_inline() inside.
Definition object.c:1329
VALUE rb_cFloat
Float class.
Definition numeric.c:197
VALUE rb_cProc
Proc class.
Definition proc.c:45
VALUE rb_cTrueClass
TrueClass class.
Definition object.c:67
VALUE rb_cString
String class.
Definition string.c:84
#define RB_OBJ_WRITTEN(old, oldv, young)
Identical to RB_OBJ_WRITE(), except it doesn't write any values, but only a WB declaration.
Definition gc.h:615
#define RB_OBJ_WRITE(old, slot, young)
Declaration of a "back" pointer.
Definition gc.h:603
Defines RBIMPL_HAS_BUILTIN.
VALUE rb_ary_delete_at(VALUE ary, long pos)
Destructively removes an element which resides at the specific index of the passed array.
VALUE rb_ary_new(void)
Allocates a new, empty array.
VALUE rb_ary_push(VALUE ary, VALUE elem)
Special case of rb_ary_cat() that it adds only one element.
void rb_undef(VALUE mod, ID mid)
Inserts a method entry that hides previous method definition of the given name.
Definition vm_method.c:2273
static int rb_check_arity(int argc, int min, int max)
Ensures that the passed integer is in the passed range.
Definition error.h:284
VALUE rb_backref_get(void)
Queries the last match, or Regexp.last_match, or the $~.
Definition vm.c:2005
void rb_lastline_set(VALUE str)
Updates $_.
Definition vm.c:2023
VALUE rb_lastline_get(void)
Queries the last line, or the $_.
Definition vm.c:2017
void rb_backref_set(VALUE md)
Updates $~.
Definition vm.c:2011
VALUE rb_block_proc(void)
Constructs a Proc object from implicitly passed components.
Definition proc.c:848
VALUE rb_block_lambda(void)
Identical to rb_proc_new(), except it returns a lambda.
Definition proc.c:867
VALUE rb_binding_new(void)
Snapshots the current execution context and turn it into an instance of rb_cBinding.
Definition proc.c:329
VALUE rb_str_append(VALUE dst, VALUE src)
Identical to rb_str_buf_append(), except it converts the right hand side before concatenating.
Definition string.c:3791
VALUE rb_str_new_frozen(VALUE str)
Creates a frozen copy of the string, if necessary.
Definition string.c:1512
#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.
Definition string.h:1655
VALUE rb_const_get(VALUE space, ID name)
Identical to rb_const_defined(), except it returns the actual defined value.
Definition variable.c:3412
void rb_set_class_path(VALUE klass, VALUE space, const char *name)
Names a class.
Definition variable.c:441
VALUE rb_class_path_cached(VALUE mod)
Just another name of rb_mod_name.
Definition variable.c:389
void rb_alias_variable(ID dst, ID src)
Aliases a global variable.
Definition variable.c:1142
VALUE rb_class_path(VALUE mod)
Identical to rb_mod_name(), except it returns #<Class: ...> style inspection for anonymous modules.
Definition variable.c:380
void rb_undef_alloc_func(VALUE klass)
Deletes the allocator function of a class.
Definition vm_method.c:1624
const char * rb_sourcefile(void)
Resembles __FILE__.
Definition vm.c:2042
void rb_alias(VALUE klass, ID dst, ID src)
Resembles alias.
Definition vm_method.c:2656
int rb_frame_method_id_and_class(ID *idp, VALUE *klassp)
Resembles __method__.
Definition vm.c:3058
int rb_sourceline(void)
Resembles __LINE__.
Definition vm.c:2056
VALUE rb_sym2str(VALUE symbol)
Obtain a frozen string representation of a symbol (not including the leading colon).
Definition symbol.c:993
void rb_define_global_const(const char *name, VALUE val)
Identical to rb_define_const(), except it defines that of "global", i.e.
Definition variable.c:3999
VALUE rb_iv_set(VALUE obj, const char *name, VALUE val)
Assigns to an instance variable.
Definition variable.c:4484
int len
Length of the buffer.
Definition io.h:8
VALUE rb_ractor_make_shareable_copy(VALUE obj)
Identical to rb_ractor_make_shareable(), except it returns a (deep) copy of the passed one instead of...
Definition ractor.c:1494
static bool rb_ractor_shareable_p(VALUE obj)
Queries if multiple Ractors can share the passed object or not.
Definition ractor.h:249
#define RB_OBJ_SHAREABLE_P(obj)
Queries if the passed object has previously classified as shareable or not.
Definition ractor.h:235
VALUE rb_ractor_make_shareable(VALUE obj)
Destructively transforms the passed object so that multiple Ractors can share it.
Definition ractor.c:1485
void ruby_vm_at_exit(void(*func)(ruby_vm_t *))
ruby_vm_at_exit registers a function func to be invoked when a VM passed away.
Definition vm.c:987
int ruby_vm_destruct(ruby_vm_t *vm)
Destructs the passed VM.
Definition vm.c:3332
VALUE rb_f_sprintf(int argc, const VALUE *argv)
Identical to rb_str_format(), except how the arguments are arranged.
Definition sprintf.c:209
#define MEMCPY(p1, p2, type, n)
Handy macro to call memcpy.
Definition memory.h:372
#define MEMZERO(p, type, n)
Handy macro to erase a region of memory.
Definition memory.h:360
#define RB_GC_GUARD(v)
Prevents premature destruction of local objects.
Definition memory.h:167
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.
Definition rarray.h:51
static int RARRAY_LENINT(VALUE ary)
Identical to rb_array_len(), except it differs for the return type.
Definition rarray.h:281
#define RARRAY_AREF(a, i)
Definition rarray.h:403
static VALUE RBASIC_CLASS(VALUE obj)
Queries the class of an object.
Definition rbasic.h:166
#define RBASIC(obj)
Convenient casting macro.
Definition rbasic.h:40
#define RHASH_EMPTY_P(h)
Checks if the hash is empty.
Definition rhash.h:79
#define StringValuePtr(v)
Identical to StringValue, except it returns a char*.
Definition rstring.h:76
#define RTYPEDDATA_DATA(v)
Convenient getter macro.
Definition rtypeddata.h:103
#define TypedData_Get_Struct(obj, type, data_type, sval)
Obtains a C struct from inside of a wrapper Ruby object.
Definition rtypeddata.h:520
#define TypedData_Wrap_Struct(klass, data_type, sval)
Converts sval, a pointer to your struct, into a Ruby object.
Definition rtypeddata.h:455
#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...
Definition rtypeddata.h:502
const char * rb_class2name(VALUE klass)
Queries the name of the passed class.
Definition variable.c:506
#define RB_NO_KEYWORDS
Do not pass keywords.
Definition scan_args.h:69
static bool RB_SPECIAL_CONST_P(VALUE obj)
Checks if the given object is of enum ruby_special_consts.
#define RTEST
This is an old name of RB_TEST.
#define _(args)
This was a transition path from K&R to ANSI.
Definition stdarg.h:35
Definition proc.c:30
Definition iseq.h:286
Definition method.h:63
CREF (Class REFerence)
Definition method.h:45
This is the struct that holds necessary info for a struct.
Definition rtypeddata.h:202
const char * wrap_struct_name
Name of structs of this kind.
Definition rtypeddata.h:209
Definition method.h:55
Internal header for Namespace.
Definition namespace.h:14
Definition st.h:79
IFUNC (Internal FUNCtion)
Definition imemo.h:85
SVAR (Special VARiable)
Definition imemo.h:49
const VALUE cref_or_me
class reference or rb_method_entry_t
Definition imemo.h:51
THROW_DATA.
Definition imemo.h:58
void rb_native_cond_initialize(rb_nativethread_cond_t *cond)
Fills the passed condition variable with an initial value.
void rb_native_mutex_initialize(rb_nativethread_lock_t *lock)
Just another name of rb_nativethread_lock_initialize.
void rb_native_mutex_destroy(rb_nativethread_lock_t *lock)
Just another name of rb_nativethread_lock_destroy.
uintptr_t ID
Type that represents a Ruby identifier such as a variable name.
Definition value.h:52
uintptr_t VALUE
Type that represents a Ruby object.
Definition value.h:40
static enum ruby_value_type RB_BUILTIN_TYPE(VALUE obj)
Queries the type of the object.
Definition value_type.h:182
static void Check_Type(VALUE v, enum ruby_value_type t)
Identical to RB_TYPE_P(), except it raises exceptions on predication failure.
Definition value_type.h:433
static bool RB_TYPE_P(VALUE obj, enum ruby_value_type t)
Queries if the given object is of given type.
Definition value_type.h:376
ruby_value_type
C-level type of an object.
Definition value_type.h:113