60 #undef _FORTIFY_SOURCE
61 #undef __USE_FORTIFY_LEVEL
62 #define __USE_FORTIFY_LEVEL 0
66 #include "ruby/internal/config.h"
73 #define TH_SCHED(th) (&(th)->ractor->threads.sched)
75 #include "eval_intern.h"
78 #include "internal/class.h"
79 #include "internal/cont.h"
80 #include "internal/error.h"
81 #include "internal/gc.h"
82 #include "internal/hash.h"
83 #include "internal/io.h"
84 #include "internal/object.h"
85 #include "internal/proc.h"
87 #include "internal/signal.h"
88 #include "internal/thread.h"
89 #include "internal/time.h"
90 #include "internal/warnings.h"
99 #include "ractor_core.h"
100 #include "vm_debug.h"
103 #if USE_RJIT && defined(HAVE_SYS_WAIT_H)
104 #include <sys/wait.h>
107 #ifndef USE_NATIVE_THREAD_PRIORITY
108 #define USE_NATIVE_THREAD_PRIORITY 0
109 #define RUBY_THREAD_PRIORITY_MAX 3
110 #define RUBY_THREAD_PRIORITY_MIN -3
113 static VALUE rb_cThreadShield;
115 static VALUE sym_immediate;
116 static VALUE sym_on_blocking;
117 static VALUE sym_never;
119 #define THREAD_LOCAL_STORAGE_INITIALISED FL_USER13
120 #define THREAD_LOCAL_STORAGE_INITIALISED_P(th) RB_FL_TEST_RAW((th), THREAD_LOCAL_STORAGE_INITIALISED)
123 rb_thread_local_storage(
VALUE thread)
125 if (LIKELY(!THREAD_LOCAL_STORAGE_INITIALISED_P(thread))) {
133 SLEEP_DEADLOCKABLE = 0x01,
134 SLEEP_SPURIOUS_CHECK = 0x02,
135 SLEEP_ALLOW_SPURIOUS = 0x04,
136 SLEEP_NO_CHECKINTS = 0x08,
139 static void sleep_forever(
rb_thread_t *th,
unsigned int fl);
140 static int sleep_hrtime(
rb_thread_t *, rb_hrtime_t,
unsigned int fl);
142 static void rb_thread_sleep_deadly_allow_spurious_wakeup(
VALUE blocker,
VALUE timeout, rb_hrtime_t end);
145 static int rb_threadptr_pending_interrupt_empty_p(
const rb_thread_t *th);
146 static const char *thread_status_name(
rb_thread_t *th,
int detail);
147 static int hrtime_update_expire(rb_hrtime_t *,
const rb_hrtime_t);
148 NORETURN(
static void async_bug_fd(
const char *mesg,
int errno_arg,
int fd));
149 MAYBE_UNUSED(
static int consume_communication_pipe(
int fd));
151 static volatile int system_working = 1;
152 static rb_internal_thread_specific_key_t specific_key_count;
155 struct ccan_list_node wfd_node;
163 #define THREAD_SYSTEM_DEPENDENT_IMPLEMENTATION
166 enum rb_thread_status prev_status;
170 static void unblock_function_clear(
rb_thread_t *th);
176 #define THREAD_BLOCKING_BEGIN(th) do { \
177 struct rb_thread_sched * const sched = TH_SCHED(th); \
178 RB_VM_SAVE_MACHINE_CONTEXT(th); \
179 thread_sched_to_waiting((sched), (th));
181 #define THREAD_BLOCKING_END(th) \
182 thread_sched_to_running((sched), (th)); \
183 rb_ractor_thread_switch(th->ractor, th); \
187 #ifdef HAVE_BUILTIN___BUILTIN_CHOOSE_EXPR_CONSTANT_P
188 #define only_if_constant(expr, notconst) __builtin_choose_expr(__builtin_constant_p(expr), (expr), (notconst))
190 #define only_if_constant(expr, notconst) (__builtin_constant_p(expr) ? (expr) : (notconst))
193 #define only_if_constant(expr, notconst) notconst
195 #define BLOCKING_REGION(th, exec, ubf, ubfarg, fail_if_interrupted) do { \
196 struct rb_blocking_region_buffer __region; \
197 if (blocking_region_begin(th, &__region, (ubf), (ubfarg), fail_if_interrupted) || \
199 !only_if_constant(fail_if_interrupted, TRUE)) { \
202 RB_VM_SAVE_MACHINE_CONTEXT(th); \
203 thread_sched_to_waiting(TH_SCHED(th), th); \
205 blocking_region_end(th, &__region); \
213 #define RUBY_VM_CHECK_INTS_BLOCKING(ec) vm_check_ints_blocking(ec)
219 if (LIKELY(rb_threadptr_pending_interrupt_empty_p(th))) {
220 if (LIKELY(!RUBY_VM_INTERRUPTED_ANY(ec)))
return FALSE;
223 th->pending_interrupt_queue_checked = 0;
224 RUBY_VM_SET_INTERRUPT(ec);
226 return rb_threadptr_execute_interrupts(th, 1);
232 return vm_check_ints_blocking(ec);
240 #if defined(HAVE_POLL)
241 # if defined(__linux__)
244 # if defined(__FreeBSD_version) && __FreeBSD_version >= 1100000
247 # define POLLERR_SET (POLLHUP | POLLERR)
252 timeout_prepare(rb_hrtime_t **to, rb_hrtime_t *rel, rb_hrtime_t *end,
256 *rel = rb_timeval2hrtime(timeout);
257 *end = rb_hrtime_add(rb_hrtime_now(), *rel);
265 MAYBE_UNUSED(NOINLINE(
static int thread_start_func_2(
rb_thread_t *th,
VALUE *stack_start)));
266 MAYBE_UNUSED(
static bool th_has_dedicated_nt(
const rb_thread_t *th));
267 MAYBE_UNUSED(
static int waitfd_to_waiting_flag(
int wfd_event));
269 #include THREAD_IMPL_SRC
276 #ifndef BUSY_WAIT_SIGNALS
277 # define BUSY_WAIT_SIGNALS (0)
281 # define USE_EVENTFD (0)
284 #include "thread_sync.c"
314 if (fail_if_interrupted) {
315 if (RUBY_VM_INTERRUPTED_ANY(th->ec)) {
320 RUBY_VM_CHECK_INTS(th->ec);
324 }
while (!th->ec->raised_flag && RUBY_VM_INTERRUPTED_ANY(th->ec) &&
327 VM_ASSERT(th->unblock.func == NULL);
329 th->unblock.func = func;
330 th->unblock.arg = arg;
340 th->unblock.func = 0;
345 rb_threadptr_interrupt_common(
rb_thread_t *th,
int trap)
347 RUBY_DEBUG_LOG(
"th:%u trap:%d", rb_th_serial(th), trap);
352 RUBY_VM_SET_TRAP_INTERRUPT(th->ec);
355 RUBY_VM_SET_INTERRUPT(th->ec);
358 if (th->unblock.func != NULL) {
359 (th->unblock.func)(th->unblock.arg);
371 RUBY_DEBUG_LOG(
"th:%u", rb_th_serial(th));
372 rb_threadptr_interrupt_common(th, 0);
378 rb_threadptr_interrupt_common(th, 1);
386 ccan_list_for_each(&r->threads.set, th, lt_node) {
387 if (th != main_thread) {
388 RUBY_DEBUG_LOG(
"terminate start th:%u status:%s", rb_th_serial(th), thread_status_name(th, TRUE));
390 rb_threadptr_pending_interrupt_enque(th, RUBY_FATAL_THREAD_TERMINATED);
391 rb_threadptr_interrupt(th);
393 RUBY_DEBUG_LOG(
"terminate done th:%u status:%s", rb_th_serial(th), thread_status_name(th, TRUE));
396 RUBY_DEBUG_LOG(
"main thread th:%u", rb_th_serial(th));
404 while (thread->join_list) {
408 thread->join_list = join_list->next;
412 if (target_thread->scheduler !=
Qnil && join_list->fiber) {
416 rb_threadptr_interrupt(target_thread);
418 switch (target_thread->status) {
420 case THREAD_STOPPED_FOREVER:
421 target_thread->status = THREAD_RUNNABLE;
431 rb_threadptr_unlock_all_locking_mutexes(
rb_thread_t *th)
433 while (th->keeping_mutexes) {
435 th->keeping_mutexes = mutex->next_mutex;
439 const char *error_message = rb_mutex_unlock_th(mutex, th, mutex->fiber);
440 if (error_message)
rb_bug(
"invalid keeping_mutexes: %s", error_message);
449 volatile int sleeping = 0;
451 if (cr->threads.main != th) {
452 rb_bug(
"rb_thread_terminate_all: called by child thread (%p, %p)",
453 (
void *)cr->threads.main, (
void *)th);
457 rb_threadptr_unlock_all_locking_mutexes(th);
460 if (EC_EXEC_TAG() == TAG_NONE) {
462 RUBY_DEBUG_LOG(
"th:%u", rb_th_serial(th));
464 terminate_all(cr, th);
466 while (rb_ractor_living_thread_num(cr) > 1) {
467 rb_hrtime_t rel = RB_HRTIME_PER_SEC;
473 native_sleep(th, &rel);
474 RUBY_VM_CHECK_INTS_BLOCKING(ec);
492 void rb_threadptr_root_fiber_terminate(
rb_thread_t *th);
495 thread_cleanup_func_before_exec(
void *th_ptr)
498 th->status = THREAD_KILLED;
501 th->ec->machine.stack_start = th->ec->machine.stack_end = NULL;
503 rb_threadptr_root_fiber_terminate(th);
507 thread_cleanup_func(
void *th_ptr,
int atfork)
511 th->locking_mutex =
Qfalse;
512 thread_cleanup_func_before_exec(th_ptr);
531 ruby_thread_init_stack(
rb_thread_t *th,
void *local_in_parent_frame)
533 native_thread_init_stack(th, local_in_parent_frame);
537 rb_vm_proc_local_ep(
VALUE proc)
539 const VALUE *ep = vm_proc_ep(proc);
542 return rb_vm_ep_local_ep(ep);
551 int argc,
const VALUE *argv,
int kw_splat,
VALUE passed_block_handler);
556 VALUE args = th->invoke_arg.proc.args;
557 const VALUE *args_ptr;
559 VALUE procval = th->invoke_arg.proc.proc;
561 GetProcPtr(procval, proc);
563 th->ec->errinfo =
Qnil;
564 th->ec->root_lep = rb_vm_proc_local_ep(procval);
565 th->ec->root_svar =
Qfalse;
567 vm_check_ints_blocking(th->ec);
569 if (th->invoke_type == thread_invoke_type_ractor_proc) {
570 VALUE self = rb_ractor_self(th->ractor);
574 rb_ractor_receive_parameters(th->ec, th->ractor, args_len, (
VALUE *)args_ptr);
575 vm_check_ints_blocking(th->ec);
577 return rb_vm_invoke_proc_with_self(
580 th->invoke_arg.proc.kw_splat,
581 VM_BLOCK_HANDLER_NONE
590 th->invoke_arg.proc.args =
Qnil;
596 vm_check_ints_blocking(th->ec);
598 return rb_vm_invoke_proc(
601 th->invoke_arg.proc.kw_splat,
602 VM_BLOCK_HANDLER_NONE
610 native_set_thread_name(th);
613 switch (th->invoke_type) {
614 case thread_invoke_type_proc:
615 result = thread_do_start_proc(th);
618 case thread_invoke_type_ractor_proc:
619 result = thread_do_start_proc(th);
620 rb_ractor_atexit(th->ec, result);
623 case thread_invoke_type_func:
624 result = (*th->invoke_arg.func.func)(th->invoke_arg.func.arg);
627 case thread_invoke_type_none:
639 RUBY_DEBUG_LOG(
"th:%u", rb_th_serial(th));
640 VM_ASSERT(th != th->vm->ractor.main_thread);
642 enum ruby_tag_type state;
644 rb_thread_t *ractor_main_th = th->ractor->threads.main;
647 if (rb_ractor_status_p(th->ractor, ractor_blocking)) {
650 rb_vm_ractor_blocking_cnt_dec(th->vm, th->ractor, __FILE__, __LINE__);
652 r->r_stdin = rb_io_prep_stdin();
653 r->r_stdout = rb_io_prep_stdout();
654 r->r_stderr = rb_io_prep_stderr();
660 VM_ASSERT(UNDEF_P(th->value));
662 int fiber_scheduler_closed = 0, event_thread_end_hooked = 0;
667 if ((state = EC_EXEC_TAG()) == TAG_NONE) {
670 result = thread_do_start(th);
673 if (!fiber_scheduler_closed) {
674 fiber_scheduler_closed = 1;
678 if (!event_thread_end_hooked) {
679 event_thread_end_hooked = 1;
683 if (state == TAG_NONE) {
687 errinfo = th->ec->errinfo;
689 VALUE exc = rb_vm_make_jump_tag_but_local_jump(state,
Qundef);
690 if (!
NIL_P(exc)) errinfo = exc;
692 if (state == TAG_FATAL) {
693 if (th->invoke_type == thread_invoke_type_ractor_proc) {
694 rb_ractor_atexit(th->ec,
Qnil);
702 if (th->report_on_exception) {
703 VALUE mesg = rb_thread_to_s(th->self);
704 rb_str_cat_cstr(mesg,
" terminated with exception (report_on_exception is true):\n");
705 rb_write_error_str(mesg);
706 rb_ec_error_print(th->ec, errinfo);
709 if (th->invoke_type == thread_invoke_type_ractor_proc) {
710 rb_ractor_atexit_exception(th->ec);
713 if (th->vm->thread_abort_on_exception ||
725 VM_ASSERT(!UNDEF_P(th->value));
727 rb_threadptr_join_list_wakeup(th);
728 rb_threadptr_unlock_all_locking_mutexes(th);
730 if (th->invoke_type == thread_invoke_type_ractor_proc) {
731 rb_thread_terminate_all(th);
732 rb_ractor_teardown(th->ec);
735 th->status = THREAD_KILLED;
736 RUBY_DEBUG_LOG(
"killed th:%u", rb_th_serial(th));
738 if (th->vm->ractor.main_thread == th) {
744 rb_threadptr_raise(ractor_main_th, 1, &errinfo);
749 rb_ec_clear_current_thread_trace_func(th->ec);
752 if (th->locking_mutex !=
Qfalse) {
753 rb_bug(
"thread_start_func_2: locking_mutex must not be set (%p:%"PRIxVALUE
")",
754 (
void *)th, th->locking_mutex);
757 if (ractor_main_th->status == THREAD_KILLED &&
758 th->ractor->threads.cnt <= 2 ) {
760 rb_threadptr_interrupt(ractor_main_th);
763 rb_check_deadlock(th->ractor);
765 rb_fiber_close(th->ec->fiber_ptr);
767 thread_cleanup_func(th, FALSE);
768 VM_ASSERT(th->ec->vm_stack == NULL);
770 if (th->invoke_type == thread_invoke_type_ractor_proc) {
774 thread_sched_to_dead(TH_SCHED(th), th);
775 rb_ractor_living_threads_remove(th->ractor, th);
778 rb_ractor_living_threads_remove(th->ractor, th);
779 thread_sched_to_dead(TH_SCHED(th), th);
786 enum thread_invoke_type type;
799 static void thread_specific_storage_alloc(
rb_thread_t *th);
805 rb_thread_t *th = rb_thread_ptr(thval), *current_th = rb_ec_thread_ptr(ec);
808 thread_specific_storage_alloc(th);
812 "can't start a new thread (frozen ThreadGroup)");
815 rb_fiber_inherit_storage(ec, th->ec->fiber_ptr);
817 switch (params->type) {
818 case thread_invoke_type_proc:
819 th->invoke_type = thread_invoke_type_proc;
820 th->invoke_arg.proc.args = params->args;
821 th->invoke_arg.proc.proc = params->proc;
825 case thread_invoke_type_ractor_proc:
826 #if RACTOR_CHECK_MODE > 0
827 rb_ractor_setup_belonging_to(thval, rb_ractor_id(params->g));
829 th->invoke_type = thread_invoke_type_ractor_proc;
830 th->ractor = params->g;
831 th->ractor->threads.main = th;
832 th->invoke_arg.proc.proc = rb_proc_isolate_bang(params->proc);
835 rb_ractor_send_parameters(ec, params->g, params->args);
838 case thread_invoke_type_func:
839 th->invoke_type = thread_invoke_type_func;
840 th->invoke_arg.func.func = params->fn;
841 th->invoke_arg.func.arg = (
void *)params->args;
848 th->priority = current_th->priority;
849 th->thgroup = current_th->thgroup;
852 th->pending_interrupt_queue_checked = 0;
853 th->pending_interrupt_mask_stack =
rb_ary_dup(current_th->pending_interrupt_mask_stack);
854 RBASIC_CLEAR_CLASS(th->pending_interrupt_mask_stack);
858 RUBY_DEBUG_LOG(
"r:%u th:%u", rb_ractor_id(th->ractor), rb_th_serial(th));
860 rb_ractor_living_threads_insert(th->ractor, th);
863 err = native_thread_create(th);
865 th->status = THREAD_KILLED;
866 rb_ractor_living_threads_remove(th->ractor, th);
872 #define threadptr_initialized(th) ((th)->invoke_type != thread_invoke_type_none)
895 thread_s_new(
int argc,
VALUE *argv,
VALUE klass)
898 VALUE thread = rb_thread_alloc(klass);
900 if (GET_RACTOR()->threads.main->status == THREAD_KILLED) {
905 th = rb_thread_ptr(thread);
906 if (!threadptr_initialized(th)) {
927 .type = thread_invoke_type_proc,
931 return thread_create_core(rb_thread_alloc(klass), ¶ms);
937 if (th->invoke_type == thread_invoke_type_proc) {
938 return rb_proc_location(th->invoke_arg.proc.proc);
954 else if (th->invoke_type != thread_invoke_type_none) {
955 VALUE loc = threadptr_invoke_proc_location(th);
958 "already initialized thread - %"PRIsVALUE
":%"PRIsVALUE,
967 .type = thread_invoke_type_proc,
971 return thread_create_core(thread, ¶ms);
979 .type = thread_invoke_type_func,
983 return thread_create_core(rb_thread_alloc(
rb_cThread), ¶ms);
990 .type = thread_invoke_type_ractor_proc,
995 return thread_create_core(rb_thread_alloc(
rb_cThread), ¶ms);
1007 remove_from_join_list(
VALUE arg)
1012 if (target_thread->status != THREAD_KILLED) {
1015 while (*join_list) {
1016 if (*join_list == p->waiter) {
1017 *join_list = (*join_list)->next;
1021 join_list = &(*join_list)->next;
1031 return th->status == THREAD_KILLED || !UNDEF_P(th->value);
1035 thread_join_sleep(
VALUE arg)
1038 rb_thread_t *target_th = p->target, *th = p->waiter->thread;
1039 rb_hrtime_t end = 0, *limit = p->limit;
1042 end = rb_hrtime_add(*limit, rb_hrtime_now());
1045 while (!thread_finished(target_th)) {
1048 if (scheduler !=
Qnil) {
1051 if (thread_finished(target_th))
break;
1056 sleep_forever(th, SLEEP_DEADLOCKABLE | SLEEP_ALLOW_SPURIOUS | SLEEP_NO_CHECKINTS);
1059 if (hrtime_update_expire(limit, end)) {
1060 RUBY_DEBUG_LOG(
"timeout target_th:%u", rb_th_serial(target_th));
1063 th->status = THREAD_STOPPED;
1064 native_sleep(th, limit);
1066 RUBY_VM_CHECK_INTS_BLOCKING(th->ec);
1067 th->status = THREAD_RUNNABLE;
1069 RUBY_DEBUG_LOG(
"interrupted target_th:%u status:%s", rb_th_serial(target_th), thread_status_name(target_th, TRUE));
1082 if (th == target_th) {
1086 if (th->ractor->threads.main == target_th) {
1090 RUBY_DEBUG_LOG(
"target_th:%u status:%s", rb_th_serial(target_th), thread_status_name(target_th, TRUE));
1092 if (target_th->status != THREAD_KILLED) {
1094 waiter.next = target_th->join_list;
1096 waiter.fiber = rb_fiberptr_blocking(fiber) ? NULL : fiber;
1097 target_th->join_list = &waiter;
1100 arg.waiter = &waiter;
1101 arg.target = target_th;
1102 arg.timeout = timeout;
1110 RUBY_DEBUG_LOG(
"success target_th:%u status:%s", rb_th_serial(target_th), thread_status_name(target_th, TRUE));
1112 if (target_th->ec->errinfo !=
Qnil) {
1113 VALUE err = target_th->ec->errinfo;
1118 RUBY_DEBUG_LOG(
"terminated target_th:%u status:%s", rb_th_serial(target_th), thread_status_name(target_th, TRUE));
1123 rb_bug(
"thread_join: Fixnum (%d) should not reach here.",
FIX2INT(err));
1126 else if (THROW_DATA_P(target_th->ec->errinfo)) {
1127 rb_bug(
"thread_join: THROW_DATA should not reach here.");
1134 return target_th->self;
1177 thread_join_m(
int argc,
VALUE *argv,
VALUE self)
1180 rb_hrtime_t rel = 0, *limit = 0;
1191 if (
NIL_P(timeout)) {
1195 rel = rb_sec2hrtime(NUM2TIMET(timeout));
1199 limit = double2hrtime(&rel,
rb_num2dbl(timeout));
1202 return thread_join(rb_thread_ptr(
self), timeout, limit);
1220 thread_value(
VALUE self)
1223 thread_join(th,
Qnil, 0);
1224 if (UNDEF_P(th->value)) {
1238 #if defined(HAVE_CLOCK_GETTIME) && defined(CLOCK_MONOTONIC)
1239 if (clock_gettime(CLOCK_MONOTONIC, ts) == 0)
1249 NOINLINE(rb_hrtime_t rb_hrtime_now(
void));
1256 return rb_timespec2hrtime(&ts);
1263 COMPILER_WARNING_PUSH
1264 #if defined(__GNUC__) && __GNUC__ == 7 && __GNUC_MINOR__ <= 3
1265 COMPILER_WARNING_IGNORED(-Wmaybe-uninitialized)
1268 #define PRIu64 PRI_64_PREFIX "u"
1276 hrtime_update_expire(rb_hrtime_t *timeout,
const rb_hrtime_t end)
1278 rb_hrtime_t now = rb_hrtime_now();
1280 if (now > end)
return 1;
1282 RUBY_DEBUG_LOG(
"%"PRIu64
" > %"PRIu64
"", (uint64_t)end, (uint64_t)now);
1284 *timeout = end - now;
1287 COMPILER_WARNING_POP
1290 sleep_hrtime(
rb_thread_t *th, rb_hrtime_t rel,
unsigned int fl)
1292 enum rb_thread_status prev_status = th->status;
1294 rb_hrtime_t end = rb_hrtime_add(rb_hrtime_now(), rel);
1296 th->status = THREAD_STOPPED;
1297 RUBY_VM_CHECK_INTS_BLOCKING(th->ec);
1298 while (th->status == THREAD_STOPPED) {
1299 native_sleep(th, &rel);
1300 woke = vm_check_ints_blocking(th->ec);
1301 if (woke && !(fl & SLEEP_SPURIOUS_CHECK))
1303 if (hrtime_update_expire(&rel, end))
1307 th->status = prev_status;
1312 sleep_hrtime_until(
rb_thread_t *th, rb_hrtime_t end,
unsigned int fl)
1314 enum rb_thread_status prev_status = th->status;
1316 rb_hrtime_t rel = rb_hrtime_sub(end, rb_hrtime_now());
1318 th->status = THREAD_STOPPED;
1319 RUBY_VM_CHECK_INTS_BLOCKING(th->ec);
1320 while (th->status == THREAD_STOPPED) {
1321 native_sleep(th, &rel);
1322 woke = vm_check_ints_blocking(th->ec);
1323 if (woke && !(fl & SLEEP_SPURIOUS_CHECK))
1325 if (hrtime_update_expire(&rel, end))
1329 th->status = prev_status;
1336 enum rb_thread_status prev_status = th->status;
1337 enum rb_thread_status status;
1340 status = fl & SLEEP_DEADLOCKABLE ? THREAD_STOPPED_FOREVER : THREAD_STOPPED;
1341 th->status = status;
1343 if (!(fl & SLEEP_NO_CHECKINTS)) RUBY_VM_CHECK_INTS_BLOCKING(th->ec);
1345 while (th->status == status) {
1346 if (fl & SLEEP_DEADLOCKABLE) {
1347 rb_ractor_sleeper_threads_inc(th->ractor);
1348 rb_check_deadlock(th->ractor);
1351 native_sleep(th, 0);
1353 if (fl & SLEEP_DEADLOCKABLE) {
1354 rb_ractor_sleeper_threads_dec(th->ractor);
1356 if (fl & SLEEP_ALLOW_SPURIOUS) {
1360 woke = vm_check_ints_blocking(th->ec);
1362 if (woke && !(fl & SLEEP_SPURIOUS_CHECK)) {
1366 th->status = prev_status;
1372 RUBY_DEBUG_LOG(
"forever");
1373 sleep_forever(GET_THREAD(), SLEEP_SPURIOUS_CHECK);
1379 RUBY_DEBUG_LOG(
"deadly");
1380 sleep_forever(GET_THREAD(), SLEEP_DEADLOCKABLE|SLEEP_SPURIOUS_CHECK);
1384 rb_thread_sleep_deadly_allow_spurious_wakeup(
VALUE blocker,
VALUE timeout, rb_hrtime_t end)
1387 if (scheduler !=
Qnil) {
1391 RUBY_DEBUG_LOG(
"...");
1393 sleep_hrtime_until(GET_THREAD(), end, SLEEP_SPURIOUS_CHECK);
1396 sleep_forever(GET_THREAD(), SLEEP_DEADLOCKABLE);
1406 sleep_hrtime(th, rb_timeval2hrtime(&time), SLEEP_SPURIOUS_CHECK);
1419 RUBY_VM_CHECK_INTS_BLOCKING(GET_EC());
1427 rb_thread_check_trap_pending(
void)
1429 return rb_signal_buff_size() != 0;
1436 return (
int)RUBY_VM_INTERRUPTED(rb_thread_ptr(thval)->ec);
1446 rb_thread_schedule_limits(uint32_t limits_us)
1450 RUBY_DEBUG_LOG(
"us:%u", (
unsigned int)limits_us);
1452 if (th->running_time_us >= limits_us) {
1453 RUBY_DEBUG_LOG(
"switch %s",
"start");
1455 RB_VM_SAVE_MACHINE_CONTEXT(th);
1456 thread_sched_yield(TH_SCHED(th), th);
1457 rb_ractor_thread_switch(th->ractor, th);
1459 RUBY_DEBUG_LOG(
"switch %s",
"done");
1467 rb_thread_schedule_limits(0);
1468 RUBY_VM_CHECK_INTS(GET_EC());
1477 #ifdef RUBY_ASSERT_CRITICAL_SECTION
1478 VM_ASSERT(ruby_assert_critical_section_entered == 0);
1480 VM_ASSERT(th == GET_THREAD());
1482 region->prev_status = th->status;
1483 if (unblock_function_set(th, ubf, arg, fail_if_interrupted)) {
1484 th->blocking_region_buffer = region;
1485 th->status = THREAD_STOPPED;
1486 rb_ractor_blocking_threads_inc(th->ractor, __FILE__, __LINE__);
1488 RUBY_DEBUG_LOG(
"thread_id:%p", (
void *)th->nt->thread_id);
1500 unblock_function_clear(th);
1502 unregister_ubf_list(th);
1504 thread_sched_to_running(TH_SCHED(th), th);
1505 rb_ractor_thread_switch(th->ractor, th);
1507 th->blocking_region_buffer = 0;
1508 rb_ractor_blocking_threads_dec(th->ractor, __FILE__, __LINE__);
1509 if (th->status == THREAD_STOPPED) {
1510 th->status = region->prev_status;
1513 RUBY_DEBUG_LOG(
"end");
1517 VM_ASSERT(th == GET_THREAD());
1522 rb_nogvl(
void *(*func)(
void *),
void *data1,
1527 if (scheduler !=
Qnil) {
1532 if (!UNDEF_P(result)) {
1534 return state.result;
1541 rb_vm_t *vm = rb_ec_vm_ptr(ec);
1542 bool is_main_thread = vm->ractor.main_thread == th;
1543 int saved_errno = 0;
1550 else if (ubf && rb_ractor_living_thread_num(th->ractor) == 1 && is_main_thread) {
1552 vm->ubf_async_safe = 1;
1556 rb_vm_t *
volatile saved_vm = vm;
1557 BLOCKING_REGION(th, {
1563 if (is_main_thread) vm->ubf_async_safe = 0;
1566 RUBY_VM_CHECK_INTS_BLOCKING(ec);
1674 return rb_nogvl(func, data1, ubf, data2, 0);
1678 waitfd_to_waiting_flag(
int wfd_event)
1680 return wfd_event << 1;
1692 ccan_list_add(&th->vm->waiting_fds, &wfd->wfd_node);
1698 thread_io_wake_pending_closer(
struct waiting_fd *wfd)
1700 bool has_waiter = wfd->busy &&
RB_TEST(wfd->busy->wakeup_mutex);
1709 ccan_list_del(&wfd->wfd_node);
1713 rb_thread_t *th = rb_thread_ptr(wfd->busy->closing_thread);
1714 if (th->scheduler !=
Qnil) {
1726 #if defined(USE_MN_THREADS) && USE_MN_THREADS
1727 return !th_has_dedicated_nt(th) && (events || timeout) && th->blocking;
1735 thread_io_wait_events(
rb_thread_t *th,
int fd,
int events,
const struct timeval *timeout)
1737 #if defined(USE_MN_THREADS) && USE_MN_THREADS
1738 if (thread_io_mn_schedulable(th, events, timeout)) {
1739 rb_hrtime_t rel, *prel;
1742 rel = rb_timeval2hrtime(timeout);
1749 VM_ASSERT(prel || (events & (RB_WAITFD_IN | RB_WAITFD_OUT)));
1751 if (thread_sched_wait_events(TH_SCHED(th), th, fd, waitfd_to_waiting_flag(events), prel)) {
1765 blocking_call_retryable_p(
int r,
int eno)
1767 if (r != -1)
return false;
1771 #if defined(EWOULDBLOCK) && EWOULDBLOCK != EAGAIN
1781 rb_thread_mn_schedulable(
VALUE thval)
1784 return th->mn_schedulable;
1788 rb_thread_io_blocking_call(rb_blocking_function_t *func,
void *data1,
int fd,
int events)
1793 RUBY_DEBUG_LOG(
"th:%u fd:%d ev:%d", rb_th_serial(th), fd, events);
1797 volatile int saved_errno = 0;
1798 enum ruby_tag_type state;
1799 bool prev_mn_schedulable = th->mn_schedulable;
1800 th->mn_schedulable = thread_io_mn_schedulable(th, events, NULL);
1811 if ((state = EC_EXEC_TAG()) == TAG_NONE) {
1812 volatile enum ruby_tag_type saved_state = state;
1816 saved_errno = errno;
1819 th = rb_ec_thread_ptr(ec);
1821 blocking_call_retryable_p((
int)val, saved_errno) &&
1822 thread_io_wait_events(th, fd, events, NULL)) {
1823 RUBY_VM_CHECK_INTS_BLOCKING(ec);
1826 state = saved_state;
1830 th = rb_ec_thread_ptr(ec);
1831 th->mn_schedulable = prev_mn_schedulable;
1840 EC_JUMP_TAG(ec, state);
1843 RUBY_VM_CHECK_INTS_BLOCKING(ec);
1846 if (saved_errno == ETIMEDOUT) {
1850 errno = saved_errno;
1856 rb_thread_io_blocking_region(rb_blocking_function_t *func,
void *data1,
int fd)
1858 return rb_thread_io_blocking_call(func, data1, fd, 0);
1903 fprintf(stderr,
"[BUG] rb_thread_call_with_gvl() is called by non-ruby thread\n");
1908 prev_unblock = th->unblock;
1911 rb_bug(
"rb_thread_call_with_gvl: called by a thread which has GVL.");
1914 blocking_region_end(th, brb);
1918 int released = blocking_region_begin(th, brb, prev_unblock.func, prev_unblock.arg, FALSE);
1920 RB_VM_SAVE_MACHINE_CONTEXT(th);
1921 thread_sched_to_waiting(TH_SCHED(th), th);
1935 ruby_thread_has_gvl_p(
void)
1939 if (th && th->blocking_region_buffer == 0) {
1956 thread_s_pass(
VALUE klass)
1981 rb_threadptr_pending_interrupt_clear(
rb_thread_t *th)
1990 th->pending_interrupt_queue_checked = 0;
1994 threadptr_check_pending_interrupt_queue(
rb_thread_t *th)
1996 if (!th->pending_interrupt_queue) {
2001 enum handle_interrupt_timing {
2003 INTERRUPT_IMMEDIATE,
2004 INTERRUPT_ON_BLOCKING,
2008 static enum handle_interrupt_timing
2011 if (sym == sym_immediate) {
2012 return INTERRUPT_IMMEDIATE;
2014 else if (sym == sym_on_blocking) {
2015 return INTERRUPT_ON_BLOCKING;
2017 else if (sym == sym_never) {
2018 return INTERRUPT_NEVER;
2025 static enum handle_interrupt_timing
2029 long mask_stack_len =
RARRAY_LEN(th->pending_interrupt_mask_stack);
2034 for (i=0; i<mask_stack_len; i++) {
2035 mask = mask_stack[mask_stack_len-(i+1)];
2040 return rb_threadptr_pending_interrupt_from_symbol(th, mask);
2052 klass =
RBASIC(mod)->klass;
2054 else if (mod != RCLASS_ORIGIN(mod)) {
2059 return rb_threadptr_pending_interrupt_from_symbol(th, sym);
2064 return INTERRUPT_NONE;
2068 rb_threadptr_pending_interrupt_empty_p(
const rb_thread_t *th)
2070 return RARRAY_LEN(th->pending_interrupt_queue) == 0;
2077 for (i=0; i<
RARRAY_LEN(th->pending_interrupt_queue); i++) {
2087 rb_threadptr_pending_interrupt_deque(
rb_thread_t *th,
enum handle_interrupt_timing timing)
2092 for (i=0; i<
RARRAY_LEN(th->pending_interrupt_queue); i++) {
2095 enum handle_interrupt_timing mask_timing = rb_threadptr_pending_interrupt_check_mask(th,
CLASS_OF(err));
2097 switch (mask_timing) {
2098 case INTERRUPT_ON_BLOCKING:
2099 if (timing != INTERRUPT_ON_BLOCKING) {
2103 case INTERRUPT_NONE:
2104 case INTERRUPT_IMMEDIATE:
2107 case INTERRUPT_NEVER:
2112 th->pending_interrupt_queue_checked = 1;
2116 if (rb_threadptr_pending_interrupt_empty_p(th)) {
2117 th->pending_interrupt_queue_checked = 1;
2124 threadptr_pending_interrupt_active_p(
rb_thread_t *th)
2131 if (th->pending_interrupt_queue_checked) {
2135 if (rb_threadptr_pending_interrupt_empty_p(th)) {
2147 if (val != sym_immediate && val != sym_on_blocking && val != sym_never) {
2156 if (
RTEST(*maskp)) {
2158 VALUE prev = *maskp;
2159 *maskp = rb_ident_hash_new();
2258 rb_thread_s_handle_interrupt(
VALUE self,
VALUE mask_arg)
2264 enum ruby_tag_type state;
2270 mask_arg = rb_to_hash_type(mask_arg);
2272 if (
OBJ_FROZEN(mask_arg) && rb_hash_compare_by_id_p(mask_arg)) {
2278 if (UNDEF_P(mask)) {
2289 rb_ary_push(th->pending_interrupt_mask_stack, mask);
2290 if (!rb_threadptr_pending_interrupt_empty_p(th)) {
2291 th->pending_interrupt_queue_checked = 0;
2292 RUBY_VM_SET_INTERRUPT(th->ec);
2295 EC_PUSH_TAG(th->ec);
2296 if ((state = EC_EXEC_TAG()) == TAG_NONE) {
2301 rb_ary_pop(th->pending_interrupt_mask_stack);
2302 if (!rb_threadptr_pending_interrupt_empty_p(th)) {
2303 th->pending_interrupt_queue_checked = 0;
2304 RUBY_VM_SET_INTERRUPT(th->ec);
2307 RUBY_VM_CHECK_INTS(th->ec);
2310 EC_JUMP_TAG(th->ec, state);
2327 rb_thread_pending_interrupt_p(
int argc,
VALUE *argv,
VALUE target_thread)
2329 rb_thread_t *target_th = rb_thread_ptr(target_thread);
2331 if (!target_th->pending_interrupt_queue) {
2334 if (rb_threadptr_pending_interrupt_empty_p(target_th)) {
2338 VALUE err = argv[0];
2342 return RBOOL(rb_threadptr_pending_interrupt_include_p(target_th, err));
2407 rb_thread_s_pending_interrupt_p(
int argc,
VALUE *argv,
VALUE self)
2409 return rb_thread_pending_interrupt_p(argc, argv, GET_THREAD()->
self);
2412 NORETURN(
static void rb_threadptr_to_kill(
rb_thread_t *th));
2417 rb_threadptr_pending_interrupt_clear(th);
2418 th->status = THREAD_RUNNABLE;
2420 th->ec->errinfo =
INT2FIX(TAG_FATAL);
2421 EC_JUMP_TAG(th->ec, TAG_FATAL);
2432 interrupt = ec->interrupt_flag;
2433 old = ATOMIC_CAS(ec->interrupt_flag, interrupt, interrupt & ec->interrupt_mask);
2434 }
while (old != interrupt);
2435 return interrupt & (
rb_atomic_t)~ec->interrupt_mask;
2439 rb_threadptr_execute_interrupts(
rb_thread_t *th,
int blocking_timing)
2442 int postponed_job_interrupt = 0;
2445 if (th->ec->raised_flag)
return ret;
2447 while ((interrupt = threadptr_get_interrupts(th)) != 0) {
2449 int timer_interrupt;
2450 int pending_interrupt;
2452 int terminate_interrupt;
2454 timer_interrupt = interrupt & TIMER_INTERRUPT_MASK;
2455 pending_interrupt = interrupt & PENDING_INTERRUPT_MASK;
2456 postponed_job_interrupt = interrupt & POSTPONED_JOB_INTERRUPT_MASK;
2457 trap_interrupt = interrupt & TRAP_INTERRUPT_MASK;
2458 terminate_interrupt = interrupt & TERMINATE_INTERRUPT_MASK;
2460 if (interrupt & VM_BARRIER_INTERRUPT_MASK) {
2465 if (postponed_job_interrupt) {
2466 rb_postponed_job_flush(th->vm);
2470 if (trap_interrupt && (th == th->vm->ractor.main_thread)) {
2471 enum rb_thread_status prev_status = th->status;
2473 th->status = THREAD_RUNNABLE;
2475 while ((sig = rb_get_next_signal()) != 0) {
2476 ret |= rb_signal_exec(th, sig);
2479 th->status = prev_status;
2483 if (pending_interrupt && threadptr_pending_interrupt_active_p(th)) {
2484 VALUE err = rb_threadptr_pending_interrupt_deque(th, blocking_timing ? INTERRUPT_ON_BLOCKING : INTERRUPT_NONE);
2485 RUBY_DEBUG_LOG(
"err:%"PRIdVALUE, err);
2491 else if (err == RUBY_FATAL_THREAD_KILLED ||
2492 err == RUBY_FATAL_THREAD_TERMINATED ||
2494 terminate_interrupt = 1;
2497 if (err == th->vm->special_exceptions[ruby_error_stream_closed]) {
2499 err = ruby_vm_special_exception_copy(err);
2502 if (th->status == THREAD_STOPPED ||
2503 th->status == THREAD_STOPPED_FOREVER)
2504 th->status = THREAD_RUNNABLE;
2509 if (terminate_interrupt) {
2510 rb_threadptr_to_kill(th);
2513 if (timer_interrupt) {
2514 uint32_t limits_us = TIME_QUANTUM_USEC;
2516 if (th->priority > 0)
2517 limits_us <<= th->priority;
2519 limits_us >>= -th->priority;
2521 if (th->status == THREAD_RUNNABLE)
2522 th->running_time_us += 10 * 1000;
2524 VM_ASSERT(th->ec->cfp);
2528 rb_thread_schedule_limits(limits_us);
2535 rb_thread_execute_interrupts(
VALUE thval)
2537 rb_threadptr_execute_interrupts(rb_thread_ptr(thval), 1);
2543 rb_threadptr_interrupt(th);
2551 if (rb_threadptr_dead(target_th)) {
2564 if (rb_threadptr_dead(target_th)) {
2568 rb_ec_setup_exception(GET_EC(), exc,
Qundef);
2569 rb_threadptr_pending_interrupt_enque(target_th, exc);
2570 rb_threadptr_interrupt(target_th);
2575 rb_threadptr_signal_raise(
rb_thread_t *th,
int sig)
2581 rb_threadptr_raise(th->vm->ractor.main_thread, 2, argv);
2593 rb_threadptr_raise(th->vm->ractor.main_thread, 2, argv);
2599 if (ec->raised_flag & RAISED_EXCEPTION) {
2602 ec->raised_flag |= RAISED_EXCEPTION;
2609 if (!(ec->raised_flag & RAISED_EXCEPTION)) {
2612 ec->raised_flag &= ~RAISED_EXCEPTION;
2619 rb_vm_t *vm = GET_THREAD()->vm;
2621 ccan_list_head_init(&busy->pending_fd_users);
2627 ccan_list_for_each_safe(&vm->waiting_fds, wfd, next, wfd_node) {
2628 if (wfd->fd == fd) {
2632 ccan_list_del(&wfd->wfd_node);
2633 ccan_list_add(&busy->pending_fd_users, &wfd->wfd_node);
2636 err = th->vm->special_exceptions[ruby_error_stream_closed];
2637 rb_threadptr_pending_interrupt_enque(th, err);
2638 rb_threadptr_interrupt(th);
2643 has_any = !ccan_list_empty(&busy->pending_fd_users);
2646 wakeup_mutex =
Qnil;
2649 RBASIC_CLEAR_CLASS(wakeup_mutex);
2651 busy->wakeup_mutex = wakeup_mutex;
2665 if (!
RB_TEST(busy->wakeup_mutex)) {
2672 while (!ccan_list_empty(&busy->pending_fd_users)) {
2683 if (rb_notify_fd_close(fd, &busy)) {
2684 rb_notify_fd_close_wait(&busy);
2710 thread_raise_m(
int argc,
VALUE *argv,
VALUE self)
2715 threadptr_check_pending_interrupt_queue(target_th);
2716 rb_threadptr_raise(target_th, argc, argv);
2719 if (current_th == target_th) {
2720 RUBY_VM_CHECK_INTS(target_th->ec);
2742 if (target_th->to_kill || target_th->status == THREAD_KILLED) {
2745 if (target_th == target_th->vm->ractor.main_thread) {
2749 RUBY_DEBUG_LOG(
"target_th:%u", rb_th_serial(target_th));
2751 if (target_th == GET_THREAD()) {
2753 rb_threadptr_to_kill(target_th);
2756 threadptr_check_pending_interrupt_queue(target_th);
2757 rb_threadptr_pending_interrupt_enque(target_th, RUBY_FATAL_THREAD_KILLED);
2758 rb_threadptr_interrupt(target_th);
2765 rb_thread_to_be_killed(
VALUE thread)
2769 if (target_th->to_kill || target_th->status == THREAD_KILLED) {
2845 if (target_th->status == THREAD_KILLED)
return Qnil;
2847 rb_threadptr_ready(target_th);
2849 if (target_th->status == THREAD_STOPPED ||
2850 target_th->status == THREAD_STOPPED_FOREVER) {
2851 target_th->status = THREAD_RUNNABLE;
2893 "stopping only thread\n\tnote: use sleep to stop forever");
2923 rb_thread_list(
void)
2926 return rb_ractor_thread_list();
2952 return rb_thread_list();
2958 return GET_THREAD()->self;
2971 thread_s_current(
VALUE klass)
2979 return GET_RACTOR()->threads.main->self;
2990 rb_thread_s_main(
VALUE klass)
3017 rb_thread_s_abort_exc(
VALUE _)
3019 return RBOOL(GET_THREAD()->vm->thread_abort_on_exception);
3054 rb_thread_s_abort_exc_set(
VALUE self,
VALUE val)
3056 GET_THREAD()->vm->thread_abort_on_exception =
RTEST(val);
3077 rb_thread_abort_exc(
VALUE thread)
3079 return RBOOL(rb_thread_ptr(thread)->abort_on_exception);
3097 rb_thread_abort_exc_set(
VALUE thread,
VALUE val)
3099 rb_thread_ptr(thread)->abort_on_exception =
RTEST(val);
3147 rb_thread_s_report_exc(
VALUE _)
3149 return RBOOL(GET_THREAD()->vm->thread_report_on_exception);
3184 rb_thread_s_report_exc_set(
VALUE self,
VALUE val)
3186 GET_THREAD()->vm->thread_report_on_exception =
RTEST(val);
3203 rb_thread_s_ignore_deadlock(
VALUE _)
3205 return RBOOL(GET_THREAD()->vm->thread_ignore_deadlock);
3230 rb_thread_s_ignore_deadlock_set(
VALUE self,
VALUE val)
3232 GET_THREAD()->vm->thread_ignore_deadlock =
RTEST(val);
3254 rb_thread_report_exc(
VALUE thread)
3256 return RBOOL(rb_thread_ptr(thread)->report_on_exception);
3274 rb_thread_report_exc_set(
VALUE thread,
VALUE val)
3276 rb_thread_ptr(thread)->report_on_exception =
RTEST(val);
3291 rb_thread_group(
VALUE thread)
3293 return rb_thread_ptr(thread)->thgroup;
3299 switch (th->status) {
3300 case THREAD_RUNNABLE:
3301 return th->to_kill ?
"aborting" :
"run";
3302 case THREAD_STOPPED_FOREVER:
3303 if (detail)
return "sleep_forever";
3304 case THREAD_STOPPED:
3316 return th->status == THREAD_KILLED;
3352 rb_thread_status(
VALUE thread)
3356 if (rb_threadptr_dead(target_th)) {
3357 if (!
NIL_P(target_th->ec->errinfo) &&
3358 !
FIXNUM_P(target_th->ec->errinfo)) {
3366 return rb_str_new2(thread_status_name(target_th, FALSE));
3386 rb_thread_alive_p(
VALUE thread)
3388 return RBOOL(!thread_finished(rb_thread_ptr(thread)));
3406 rb_thread_stop_p(
VALUE thread)
3410 if (rb_threadptr_dead(th)) {
3413 return RBOOL(th->status == THREAD_STOPPED || th->status == THREAD_STOPPED_FOREVER);
3424 rb_thread_getname(
VALUE thread)
3426 return rb_thread_ptr(thread)->name;
3452 target_th->name = name;
3453 if (threadptr_initialized(target_th) && target_th->has_dedicated_nt) {
3454 native_set_another_thread_name(target_th->nt->thread_id, name);
3459 #if USE_NATIVE_THREAD_NATIVE_THREAD_ID
3483 rb_thread_native_thread_id(
VALUE thread)
3486 if (rb_threadptr_dead(target_th))
return Qnil;
3487 return native_thread_native_thread_id(target_th);
3490 # define rb_thread_native_thread_id rb_f_notimplement
3501 rb_thread_to_s(
VALUE thread)
3508 status = thread_status_name(target_th, TRUE);
3509 str =
rb_sprintf(
"#<%"PRIsVALUE
":%p", cname, (
void *)thread);
3510 if (!
NIL_P(target_th->name)) {
3513 if ((loc = threadptr_invoke_proc_location(target_th)) !=
Qnil) {
3523 #define recursive_key id__recursive_key__
3528 if (
id == recursive_key) {
3529 return th->ec->local_storage_recursive_hash;
3533 struct rb_id_table *local_storage = th->ec->local_storage;
3535 if (local_storage != NULL && rb_id_table_lookup(local_storage,
id, &val)) {
3547 return threadptr_local_aref(rb_thread_ptr(thread),
id);
3614 if (!
id)
return Qnil;
3632 rb_thread_fetch(
int argc,
VALUE *argv,
VALUE self)
3643 if (block_given && argc == 2) {
3644 rb_warn(
"block supersedes default value argument");
3649 if (
id == recursive_key) {
3650 return target_th->ec->local_storage_recursive_hash;
3652 else if (
id && target_th->ec->local_storage &&
3653 rb_id_table_lookup(target_th->ec->local_storage,
id, &val)) {
3656 else if (block_given) {
3659 else if (argc == 1) {
3660 rb_key_err_raise(
rb_sprintf(
"key not found: %+"PRIsVALUE, key),
self, key);
3670 if (
id == recursive_key) {
3671 th->ec->local_storage_recursive_hash = val;
3675 struct rb_id_table *local_storage = th->ec->local_storage;
3678 if (!local_storage)
return Qnil;
3679 rb_id_table_delete(local_storage,
id);
3683 if (local_storage == NULL) {
3684 th->ec->local_storage = local_storage = rb_id_table_create(0);
3686 rb_id_table_insert(local_storage,
id, val);
3699 return threadptr_local_aset(rb_thread_ptr(thread),
id, val);
3750 rb_thread_variable_get(
VALUE thread,
VALUE key)
3755 if (LIKELY(!THREAD_LOCAL_STORAGE_INITIALISED_P(thread))) {
3758 locals = rb_thread_local_storage(thread);
3780 locals = rb_thread_local_storage(thread);
3802 struct rb_id_table *local_storage = rb_thread_ptr(
self)->ec->local_storage;
3804 if (!
id || local_storage == NULL) {
3807 return RBOOL(rb_id_table_lookup(local_storage,
id, &val));
3810 static enum rb_id_table_iterator_result
3811 thread_keys_i(
ID key,
VALUE value,
void *ary)
3814 return ID_TABLE_CONTINUE;
3821 return rb_ractor_living_thread_num(GET_RACTOR()) == 1;
3839 rb_thread_keys(
VALUE self)
3841 struct rb_id_table *local_storage = rb_thread_ptr(
self)->ec->local_storage;
3844 if (local_storage) {
3845 rb_id_table_foreach(local_storage, thread_keys_i, (
void *)ary);
3875 rb_thread_variables(
VALUE thread)
3881 if (LIKELY(!THREAD_LOCAL_STORAGE_INITIALISED_P(thread))) {
3884 locals = rb_thread_local_storage(thread);
3907 rb_thread_variable_p(
VALUE thread,
VALUE key)
3912 if (LIKELY(!THREAD_LOCAL_STORAGE_INITIALISED_P(thread))) {
3915 locals = rb_thread_local_storage(thread);
3936 rb_thread_priority(
VALUE thread)
3938 return INT2NUM(rb_thread_ptr(thread)->priority);
3969 rb_thread_priority_set(
VALUE thread,
VALUE prio)
3974 #if USE_NATIVE_THREAD_PRIORITY
3975 target_th->priority =
NUM2INT(prio);
3976 native_thread_apply_priority(th);
3979 if (priority > RUBY_THREAD_PRIORITY_MAX) {
3980 priority = RUBY_THREAD_PRIORITY_MAX;
3982 else if (priority < RUBY_THREAD_PRIORITY_MIN) {
3983 priority = RUBY_THREAD_PRIORITY_MIN;
3985 target_th->priority = (int8_t)priority;
3987 return INT2NUM(target_th->priority);
3992 #if defined(NFDBITS) && defined(HAVE_RB_FD_INIT)
4028 FD_ZERO(fds->
fdset);
4034 size_t size = howmany(
rb_fd_max(src), NFDBITS) *
sizeof(fd_mask);
4036 if (size <
sizeof(fd_set))
4037 size =
sizeof(fd_set);
4061 size_t m = howmany(n + 1, NFDBITS) *
sizeof(fd_mask);
4062 size_t o = howmany(fds->
maxfd, NFDBITS) *
sizeof(fd_mask);
4064 if (m <
sizeof(fd_set)) m =
sizeof(fd_set);
4065 if (o <
sizeof(fd_set)) o =
sizeof(fd_set);
4069 memset((
char *)fds->
fdset + o, 0, m - o);
4078 FD_SET(n, fds->
fdset);
4084 if (n >= fds->
maxfd)
return;
4085 FD_CLR(n, fds->
fdset);
4091 if (n >= fds->
maxfd)
return 0;
4092 return FD_ISSET(n, fds->
fdset) != 0;
4098 size_t size = howmany(max, NFDBITS) *
sizeof(fd_mask);
4100 if (size <
sizeof(fd_set)) size =
sizeof(fd_set);
4103 memcpy(dst->
fdset, src, size);
4109 size_t size = howmany(
rb_fd_max(src), NFDBITS) *
sizeof(fd_mask);
4111 if (size <
sizeof(fd_set))
4112 size =
sizeof(fd_set);
4121 fd_set *r = NULL, *w = NULL, *e = NULL;
4134 return select(n, r, w, e, timeout);
4137 #define rb_fd_no_init(fds) ((void)((fds)->fdset = 0), (void)((fds)->maxfd = 0))
4144 #define FD_ZERO(f) rb_fd_zero(f)
4145 #define FD_SET(i, f) rb_fd_set((i), (f))
4146 #define FD_CLR(i, f) rb_fd_clr((i), (f))
4147 #define FD_ISSET(i, f) rb_fd_isset((i), (f))
4149 #elif defined(_WIN32)
4154 set->
capa = FD_SETSIZE;
4156 FD_ZERO(set->
fdset);
4178 SOCKET s = rb_w32_get_osfhandle(fd);
4180 for (i = 0; i < set->
fdset->fd_count; i++) {
4181 if (set->
fdset->fd_array[i] == s) {
4185 if (set->
fdset->fd_count >= (
unsigned)set->
capa) {
4186 set->
capa = (set->
fdset->fd_count / FD_SETSIZE + 1) * FD_SETSIZE;
4188 rb_xrealloc_mul_add(
4189 set->
fdset, set->
capa,
sizeof(SOCKET),
sizeof(
unsigned int));
4191 set->
fdset->fd_array[set->
fdset->fd_count++] = s;
4199 #define FD_ZERO(f) rb_fd_zero(f)
4200 #define FD_SET(i, f) rb_fd_set((i), (f))
4201 #define FD_CLR(i, f) rb_fd_clr((i), (f))
4202 #define FD_ISSET(i, f) rb_fd_isset((i), (f))
4204 #define rb_fd_no_init(fds) (void)((fds)->fdset = 0)
4208 #ifndef rb_fd_no_init
4209 #define rb_fd_no_init(fds) (void)(fds)
4213 wait_retryable(
volatile int *result,
int errnum, rb_hrtime_t *rel, rb_hrtime_t end)
4223 if (rel && hrtime_update_expire(rel, end)) {
4233 return !hrtime_update_expire(rel, end);
4253 select_set_free(
VALUE p)
4268 volatile int result = 0;
4270 rb_hrtime_t *to, rel, end = 0;
4272 timeout_prepare(&to, &rel, &end, set->timeout);
4273 volatile rb_hrtime_t endtime = end;
4274 #define restore_fdset(dst, src) \
4275 ((dst) ? rb_fd_dup(dst, src) : (void)0)
4276 #define do_select_update() \
4277 (restore_fdset(set->rset, &set->orig_rset), \
4278 restore_fdset(set->wset, &set->orig_wset), \
4279 restore_fdset(set->eset, &set->orig_eset), \
4285 BLOCKING_REGION(set->th, {
4288 if (!RUBY_VM_INTERRUPTED(set->th->ec)) {
4289 result = native_fd_select(set->max,
4290 set->rset, set->wset, set->eset,
4291 rb_hrtime2timeval(&tv, to), set->th);
4292 if (result < 0) lerrno = errno;
4294 }, ubf_select, set->th, TRUE);
4296 RUBY_VM_CHECK_INTS_BLOCKING(set->th->ec);
4297 }
while (wait_retryable(&result, lerrno, to, endtime) && do_select_update());
4303 return (
VALUE)result;
4312 set.th = GET_THREAD();
4313 RUBY_VM_CHECK_INTS_BLOCKING(set.th->ec);
4318 set.timeout = timeout;
4320 if (!set.rset && !set.wset && !set.eset) {
4329 #define fd_init_copy(f) do { \
4331 rb_fd_resize(set.max - 1, set.f); \
4332 if (&set.orig_##f != set.f) { \
4333 rb_fd_init_copy(&set.orig_##f, set.f); \
4337 rb_fd_no_init(&set.orig_##f); \
4351 #define POLLIN_SET (POLLRDNORM | POLLRDBAND | POLLIN | POLLHUP | POLLERR)
4352 #define POLLOUT_SET (POLLWRBAND | POLLWRNORM | POLLOUT | POLLERR)
4353 #define POLLEX_SET (POLLPRI)
4356 # define POLLERR_SET (0)
4360 wait_for_single_fd_blocking_region(
rb_thread_t *th,
struct pollfd *fds, nfds_t nfds,
4361 rb_hrtime_t *
const to,
volatile int *lerrno)
4364 volatile int result = 0;
4367 BLOCKING_REGION(th, {
4368 if (!RUBY_VM_INTERRUPTED(th->ec)) {
4369 result = ppoll(fds, nfds, rb_hrtime2timespec(&ts, to), 0);
4370 if (result < 0) *lerrno = errno;
4372 }, ubf_select, th, TRUE);
4380 rb_thread_wait_for_single_fd(
int fd,
int events,
struct timeval *timeout)
4382 struct pollfd fds[1] = {{
4384 .events = (short)events,
4387 volatile int result = 0;
4390 enum ruby_tag_type state;
4391 volatile int lerrno;
4396 thread_io_setup_wfd(th, fd, &wfd);
4398 if (timeout == NULL && thread_io_wait_events(th, fd, events, NULL)) {
4401 fds[0].revents = events;
4405 EC_PUSH_TAG(wfd.th->ec);
4406 if ((state = EC_EXEC_TAG()) == TAG_NONE) {
4407 rb_hrtime_t *to, rel, end = 0;
4408 RUBY_VM_CHECK_INTS_BLOCKING(wfd.th->ec);
4409 timeout_prepare(&to, &rel, &end, timeout);
4411 nfds = numberof(fds);
4412 result = wait_for_single_fd_blocking_region(wfd.th, fds, nfds, to, &lerrno);
4414 RUBY_VM_CHECK_INTS_BLOCKING(wfd.th->ec);
4415 }
while (wait_retryable(&result, lerrno, to, end));
4420 thread_io_wake_pending_closer(&wfd);
4423 EC_JUMP_TAG(wfd.th->ec, state);
4431 if (fds[0].revents & POLLNVAL) {
4441 if (fds[0].revents & POLLIN_SET)
4442 result |= RB_WAITFD_IN;
4443 if (fds[0].revents & POLLOUT_SET)
4444 result |= RB_WAITFD_OUT;
4445 if (fds[0].revents & POLLEX_SET)
4446 result |= RB_WAITFD_PRI;
4449 if (fds[0].revents & POLLERR_SET)
4474 args->read, args->write, args->except, args->tv);
4476 args->as.error =
errno;
4479 if (args->read &&
rb_fd_isset(args->as.fd, args->read))
4481 if (args->write &&
rb_fd_isset(args->as.fd, args->write))
4483 if (args->except &&
rb_fd_isset(args->as.fd, args->except))
4494 thread_io_wake_pending_closer(&args->wfd);
4515 rb_thread_wait_for_single_fd(
int fd,
int events,
struct timeval *timeout)
4525 args.read = (events & RB_WAITFD_IN) ? init_set_fd(fd, &rfds) : NULL;
4526 args.write = (events & RB_WAITFD_OUT) ? init_set_fd(fd, &wfds) : NULL;
4527 args.except = (events & RB_WAITFD_PRI) ? init_set_fd(fd, &efds) : NULL;
4529 thread_io_setup_wfd(th, fd, &args.wfd);
4533 errno = args.as.error;
4543 #ifdef USE_CONSERVATIVE_STACK_END
4545 rb_gc_set_stack_end(
VALUE **stack_end_p)
4548 COMPILER_WARNING_PUSH
4549 #if __has_warning("-Wdangling-pointer")
4550 COMPILER_WARNING_IGNORED(-Wdangling-pointer);
4552 *stack_end_p = &stack_end;
4553 COMPILER_WARNING_POP
4565 if (rb_signal_buff_size() > 0) {
4567 threadptr_trap_interrupt(mth);
4572 async_bug_fd(
const char *mesg,
int errno_arg,
int fd)
4575 size_t n = strlcpy(buff, mesg,
sizeof(buff));
4576 if (n <
sizeof(buff)-3) {
4579 rb_async_bug_errno(buff, errno_arg);
4584 consume_communication_pipe(
int fd)
4590 static char buff[1024];
4596 result = read(fd, buff,
sizeof(buff));
4598 RUBY_DEBUG_LOG(
"resultf:%d buff:%lu", (
int)result, (
unsigned long)buff[0]);
4600 RUBY_DEBUG_LOG(
"result:%d", (
int)result);
4604 if (USE_EVENTFD || result < (ssize_t)
sizeof(buff)) {
4608 else if (result == 0) {
4611 else if (result < 0) {
4617 #if defined(EWOULDBLOCK) && EWOULDBLOCK != EAGAIN
4622 async_bug_fd(
"consume_communication_pipe: read", e, fd);
4629 rb_thread_stop_timer_thread(
void)
4631 if (TIMER_THREAD_CREATED_P() && native_stop_timer_thread()) {
4632 native_reset_timer_thread();
4637 rb_thread_reset_timer_thread(
void)
4639 native_reset_timer_thread();
4643 rb_thread_start_timer_thread(
void)
4646 rb_thread_create_timer_thread();
4650 clear_coverage_i(st_data_t key, st_data_t val, st_data_t dummy)
4658 if (GET_VM()->coverage_mode & COVERAGE_TARGET_ONESHOT_LINES) {
4680 rb_clear_coverages(
void)
4682 VALUE coverages = rb_get_coverages();
4683 if (
RTEST(coverages)) {
4688 #if defined(HAVE_WORKING_FORK)
4696 vm->ractor.main_ractor = r;
4697 vm->ractor.main_thread = th;
4698 r->threads.main = th;
4699 r->status_ = ractor_created;
4701 thread_sched_atfork(TH_SCHED(th));
4705 ccan_list_for_each(&vm->ractor.set, r, vmlr_node) {
4706 ccan_list_for_each(&r->threads.set, i, lt_node) {
4710 rb_vm_living_threads_init(vm);
4712 rb_ractor_atfork(vm, th);
4713 rb_vm_postponed_job_atfork();
4722 rb_ractor_sleeper_threads_clear(th->ractor);
4723 rb_clear_coverages();
4726 rb_thread_reset_timer_thread();
4727 rb_thread_start_timer_thread();
4729 VM_ASSERT(vm->ractor.blocking_cnt == 0);
4730 VM_ASSERT(vm->ractor.cnt == 1);
4736 if (th != current_th) {
4737 rb_mutex_abandon_keeping_mutexes(th);
4738 rb_mutex_abandon_locking_mutex(th);
4739 thread_cleanup_func(th, TRUE);
4748 rb_threadptr_pending_interrupt_clear(th);
4749 rb_thread_atfork_internal(th, terminate_atfork_i);
4750 th->join_list = NULL;
4751 rb_fiber_atfork(th);
4760 if (th != current_th) {
4761 thread_cleanup_func_before_exec(th);
4769 rb_thread_atfork_internal(th, terminate_atfork_before_exec_i);
4794 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_EMBEDDABLE
4817 thgroup_s_alloc(
VALUE klass)
4838 thgroup_list(
VALUE group)
4844 ccan_list_for_each(&r->threads.set, th, lt_node) {
4845 if (th->thgroup == group) {
4870 thgroup_enclose(
VALUE group)
4889 thgroup_enclosed_p(
VALUE group)
4894 return RBOOL(data->enclosed);
4934 if (data->enclosed) {
4942 if (data->enclosed) {
4944 "can't move from the enclosed thread group");
4947 target_th->thgroup = group;
4955 thread_shield_mark(
void *
ptr)
4962 {thread_shield_mark, 0, 0,},
4963 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
4967 thread_shield_alloc(
VALUE klass)
4972 #define GetThreadShieldPtr(obj) ((VALUE)rb_check_typeddata((obj), &thread_shield_data_type))
4973 #define THREAD_SHIELD_WAITING_MASK (((FL_USER19-1)&~(FL_USER0-1))|FL_USER19)
4974 #define THREAD_SHIELD_WAITING_SHIFT (FL_USHIFT)
4975 #define THREAD_SHIELD_WAITING_MAX (THREAD_SHIELD_WAITING_MASK>>THREAD_SHIELD_WAITING_SHIFT)
4976 STATIC_ASSERT(THREAD_SHIELD_WAITING_MAX, THREAD_SHIELD_WAITING_MAX <= UINT_MAX);
4977 static inline unsigned int
4978 rb_thread_shield_waiting(
VALUE b)
4980 return ((
RBASIC(b)->flags&THREAD_SHIELD_WAITING_MASK)>>THREAD_SHIELD_WAITING_SHIFT);
4984 rb_thread_shield_waiting_inc(
VALUE b)
4986 unsigned int w = rb_thread_shield_waiting(b);
4988 if (w > THREAD_SHIELD_WAITING_MAX)
4990 RBASIC(b)->flags &= ~THREAD_SHIELD_WAITING_MASK;
4991 RBASIC(b)->flags |= ((
VALUE)w << THREAD_SHIELD_WAITING_SHIFT);
4995 rb_thread_shield_waiting_dec(
VALUE b)
4997 unsigned int w = rb_thread_shield_waiting(b);
5000 RBASIC(b)->flags &= ~THREAD_SHIELD_WAITING_MASK;
5001 RBASIC(b)->flags |= ((
VALUE)w << THREAD_SHIELD_WAITING_SHIFT);
5005 rb_thread_shield_new(
void)
5007 VALUE thread_shield = thread_shield_alloc(rb_cThreadShield);
5009 return thread_shield;
5013 rb_thread_shield_owned(
VALUE self)
5015 VALUE mutex = GetThreadShieldPtr(
self);
5016 if (!mutex)
return false;
5020 return m->fiber == GET_EC()->fiber_ptr;
5032 rb_thread_shield_wait(
VALUE self)
5034 VALUE mutex = GetThreadShieldPtr(
self);
5037 if (!mutex)
return Qfalse;
5038 m = mutex_ptr(mutex);
5039 if (m->fiber == GET_EC()->fiber_ptr)
return Qnil;
5040 rb_thread_shield_waiting_inc(
self);
5042 rb_thread_shield_waiting_dec(
self);
5045 return rb_thread_shield_waiting(
self) > 0 ?
Qnil :
Qfalse;
5049 thread_shield_get_mutex(
VALUE self)
5051 VALUE mutex = GetThreadShieldPtr(
self);
5061 rb_thread_shield_release(
VALUE self)
5063 VALUE mutex = thread_shield_get_mutex(
self);
5065 return RBOOL(rb_thread_shield_waiting(
self) > 0);
5072 rb_thread_shield_destroy(
VALUE self)
5074 VALUE mutex = thread_shield_get_mutex(
self);
5077 return RBOOL(rb_thread_shield_waiting(
self) > 0);
5083 return th->ec->local_storage_recursive_hash;
5089 th->ec->local_storage_recursive_hash = hash;
5101 recursive_list_access(
VALUE sym)
5104 VALUE hash = threadptr_recursive_hash(th);
5107 hash = rb_ident_hash_new();
5108 threadptr_recursive_hash_set(th, hash);
5115 list = rb_ident_hash_new();
5130 #if SIZEOF_LONG == SIZEOF_VOIDP
5131 #define OBJ_ID_EQL(obj_id, other) ((obj_id) == (other))
5132 #elif SIZEOF_LONG_LONG == SIZEOF_VOIDP
5133 #define OBJ_ID_EQL(obj_id, other) (RB_BIGNUM_TYPE_P((obj_id)) ? \
5134 rb_big_eql((obj_id), (other)) : ((obj_id) == (other)))
5138 if (UNDEF_P(pair_list))
5140 if (paired_obj_id) {
5142 if (!OBJ_ID_EQL(paired_obj_id, pair_list))
5175 VALUE other_paired_obj = pair_list;
5197 if (UNDEF_P(pair_list)) {
5201 rb_hash_delete_entry(pair_list, paired_obj);
5207 rb_hash_delete_entry(list, obj);
5223 return (*p->func)(p->obj, p->arg, FALSE);
5244 p.list = recursive_list_access(sym);
5248 outermost = outer && !recursive_check(p.list,
ID2SYM(recursive_key), 0);
5250 if (recursive_check(p.list, p.obj, pairid)) {
5251 if (outer && !outermost) {
5254 return (*func)(obj, arg, TRUE);
5257 enum ruby_tag_type state;
5262 recursive_push(p.list,
ID2SYM(recursive_key), 0);
5263 recursive_push(p.list, p.obj, p.pairid);
5264 result = rb_catch_protect(p.list, exec_recursive_i, (
VALUE)&p, &state);
5265 if (!recursive_pop(p.list, p.obj, p.pairid))
goto invalid;
5266 if (!recursive_pop(p.list,
ID2SYM(recursive_key), 0))
goto invalid;
5267 if (state != TAG_NONE) EC_JUMP_TAG(GET_EC(), state);
5268 if (result == p.list) {
5269 result = (*func)(obj, arg, TRUE);
5274 recursive_push(p.list, p.obj, p.pairid);
5275 EC_PUSH_TAG(GET_EC());
5276 if ((state = EC_EXEC_TAG()) == TAG_NONE) {
5277 ret = (*func)(obj, arg, FALSE);
5280 if (!recursive_pop(p.list, p.obj, p.pairid)) {
5283 if (state != TAG_NONE) EC_JUMP_TAG(GET_EC(), state);
5292 "for %+"PRIsVALUE
" in %+"PRIsVALUE,
5334 return exec_recursive(func, obj, 0, arg, 1, mid);
5358 rb_thread_backtrace_m(
int argc,
VALUE *argv,
VALUE thval)
5360 return rb_vm_thread_backtrace(argc, argv, thval);
5375 rb_thread_backtrace_locations_m(
int argc,
VALUE *argv,
VALUE thval)
5377 return rb_vm_thread_backtrace_locations(argc, argv, thval);
5381 Init_Thread_Mutex(
void)
5471 rb_vm_register_special_exception(ruby_error_stream_closed,
rb_eIOError,
5472 "stream closed in another thread");
5482 th->thgroup = th->ractor->thgroup_default =
rb_obj_alloc(cThGroup);
5493 #ifdef HAVE_PTHREAD_NP_H
5494 VM_ASSERT(TH_SCHED(th)->running == th);
5501 th->pending_interrupt_queue_checked = 0;
5506 rb_thread_create_timer_thread();
5522 #ifdef NON_SCALAR_THREAD_ID
5523 #define thread_id_str(th) (NULL)
5525 #define thread_id_str(th) ((void *)(uintptr_t)(th)->nt->thread_id)
5534 rb_str_catf(msg,
"\n%d threads, %d sleeps current:%p main thread:%p\n",
5535 rb_ractor_living_thread_num(r), rb_ractor_sleeper_thread_num(r),
5536 (
void *)GET_THREAD(), (
void *)r->threads.main);
5538 ccan_list_for_each(&r->threads.set, th, lt_node) {
5539 rb_str_catf(msg,
"* %+"PRIsVALUE
"\n rb_thread_t:%p "
5541 th->self, (
void *)th, th->nt ? thread_id_str(th) :
"N/A", th->ec->interrupt_flag);
5543 if (th->locking_mutex) {
5544 rb_mutex_t *mutex = mutex_ptr(th->locking_mutex);
5546 (
void *)mutex->fiber, rb_mutex_num_waiting(mutex));
5552 rb_str_catf(msg,
"\n depended by: tb_thread_id:%p", (
void *)list->thread);
5565 if (GET_THREAD()->vm->thread_ignore_deadlock)
return;
5567 #ifdef RUBY_THREAD_PTHREAD_H
5568 if (r->threads.sched.readyq_cnt > 0)
return;
5571 int sleeper_num = rb_ractor_sleeper_thread_num(r);
5572 int ltnum = rb_ractor_living_thread_num(r);
5574 if (ltnum > sleeper_num)
return;
5575 if (ltnum < sleeper_num)
rb_bug(
"sleeper must not be more than vm_living_thread_num(vm)");
5580 ccan_list_for_each(&r->threads.set, th, lt_node) {
5581 if (th->status != THREAD_STOPPED_FOREVER || RUBY_VM_INTERRUPTED(th->ec)) {
5584 else if (th->locking_mutex) {
5585 rb_mutex_t *mutex = mutex_ptr(th->locking_mutex);
5586 if (mutex->fiber == th->ec->fiber_ptr || (!mutex->fiber && !ccan_list_empty(&mutex->waitq))) {
5597 argv[1] =
rb_str_new2(
"No live threads left. Deadlock?");
5598 debug_deadlock_check(r, argv[1]);
5599 rb_ractor_sleeper_threads_dec(GET_RACTOR());
5600 rb_threadptr_raise(r->threads.main, 2, argv);
5607 rb_vm_memsize_waiting_fds(
struct ccan_list_head *waiting_fds)
5612 ccan_list_for_each(waiting_fds, waitfd, wfd_node) {
5623 VALUE coverage = rb_iseq_coverage(cfp->iseq);
5631 if (GET_VM()->coverage_mode & COVERAGE_TARGET_ONESHOT_LINES) {
5632 rb_iseq_clear_event_flags(cfp->iseq, cfp->pc - ISEQ_BODY(cfp->iseq)->iseq_encoded - 1, RUBY_EVENT_COVERAGE_LINE);
5653 VALUE coverage = rb_iseq_coverage(cfp->iseq);
5657 long pc = cfp->pc - ISEQ_BODY(cfp->iseq)->iseq_encoded - 1;
5672 VALUE path, beg_pos_lineno, beg_pos_column, end_pos_lineno, end_pos_column;
5674 if (!me->def)
return NULL;
5677 switch (me->def->type) {
5678 case VM_METHOD_TYPE_ISEQ: {
5681 path = rb_iseq_path(iseq);
5682 beg_pos_lineno =
INT2FIX(loc->code_location.beg_pos.lineno);
5683 beg_pos_column =
INT2FIX(loc->code_location.beg_pos.column);
5684 end_pos_lineno =
INT2FIX(loc->code_location.end_pos.lineno);
5685 end_pos_column =
INT2FIX(loc->code_location.end_pos.column);
5688 case VM_METHOD_TYPE_BMETHOD: {
5689 const rb_iseq_t *iseq = rb_proc_get_iseq(me->def->body.bmethod.proc, 0);
5692 rb_iseq_check(iseq);
5693 path = rb_iseq_path(iseq);
5694 loc = &ISEQ_BODY(iseq)->location;
5695 beg_pos_lineno =
INT2FIX(loc->code_location.beg_pos.lineno);
5696 beg_pos_column =
INT2FIX(loc->code_location.beg_pos.column);
5697 end_pos_lineno =
INT2FIX(loc->code_location.end_pos.lineno);
5698 end_pos_column =
INT2FIX(loc->code_location.end_pos.column);
5703 case VM_METHOD_TYPE_ALIAS:
5704 me = me->def->body.alias.original_me;
5706 case VM_METHOD_TYPE_REFINED:
5707 me = me->def->body.refined.orig_me;
5708 if (!me)
return NULL;
5719 if (resolved_location) {
5720 resolved_location[0] = path;
5721 resolved_location[1] = beg_pos_lineno;
5722 resolved_location[2] = beg_pos_column;
5723 resolved_location[3] = end_pos_lineno;
5724 resolved_location[4] = end_pos_column;
5738 me = rb_resolve_me_location(me, 0);
5749 rb_get_coverages(
void)
5751 return GET_VM()->coverages;
5755 rb_get_coverage_mode(
void)
5757 return GET_VM()->coverage_mode;
5761 rb_set_coverages(
VALUE coverages,
int mode,
VALUE me2counter)
5763 GET_VM()->coverages = coverages;
5764 GET_VM()->me2counter = me2counter;
5765 GET_VM()->coverage_mode = mode;
5769 rb_resume_coverages(
void)
5771 int mode = GET_VM()->coverage_mode;
5772 VALUE me2counter = GET_VM()->me2counter;
5773 rb_add_event_hook2((
rb_event_hook_func_t) update_line_coverage, RUBY_EVENT_COVERAGE_LINE,
Qnil, RUBY_EVENT_HOOK_FLAG_SAFE | RUBY_EVENT_HOOK_FLAG_RAW_ARG);
5774 if (mode & COVERAGE_TARGET_BRANCHES) {
5775 rb_add_event_hook2((
rb_event_hook_func_t) update_branch_coverage, RUBY_EVENT_COVERAGE_BRANCH,
Qnil, RUBY_EVENT_HOOK_FLAG_SAFE | RUBY_EVENT_HOOK_FLAG_RAW_ARG);
5777 if (mode & COVERAGE_TARGET_METHODS) {
5783 rb_suspend_coverages(
void)
5786 if (GET_VM()->coverage_mode & COVERAGE_TARGET_BRANCHES) {
5789 if (GET_VM()->coverage_mode & COVERAGE_TARGET_METHODS) {
5796 rb_reset_coverages(
void)
5798 rb_clear_coverages();
5799 rb_iseq_remove_coverage_all();
5800 GET_VM()->coverages =
Qfalse;
5804 rb_default_coverage(
int n)
5806 VALUE coverage = rb_ary_hidden_new_fill(3);
5808 int mode = GET_VM()->coverage_mode;
5810 if (mode & COVERAGE_TARGET_LINES) {
5813 RARRAY_ASET(coverage, COVERAGE_INDEX_LINES, lines);
5815 if (mode & COVERAGE_TARGET_BRANCHES) {
5816 branches = rb_ary_hidden_new_fill(2);
5844 RARRAY_ASET(coverage, COVERAGE_INDEX_BRANCHES, branches);
5850 uninterruptible_exit(
VALUE v)
5853 rb_ary_pop(cur_th->pending_interrupt_mask_stack);
5855 cur_th->pending_interrupt_queue_checked = 0;
5856 if (!rb_threadptr_pending_interrupt_empty_p(cur_th)) {
5857 RUBY_VM_SET_INTERRUPT(cur_th->ec);
5865 VALUE interrupt_mask = rb_ident_hash_new();
5870 rb_ary_push(cur_th->pending_interrupt_mask_stack, interrupt_mask);
5874 RUBY_VM_CHECK_INTS(cur_th->ec);
5881 VM_ASSERT(th->specific_storage == NULL);
5883 if (UNLIKELY(specific_key_count > 0)) {
5884 th->specific_storage =
ZALLOC_N(
void *, RB_INTERNAL_THREAD_SPECIFIC_KEY_MAX);
5888 rb_internal_thread_specific_key_t
5893 if (specific_key_count == 0 && vm->ractor.cnt > 1) {
5894 rb_raise(
rb_eThreadError,
"The first rb_internal_thread_specific_key_create() is called with multiple ractors");
5896 else if (specific_key_count > RB_INTERNAL_THREAD_SPECIFIC_KEY_MAX) {
5897 rb_raise(
rb_eThreadError,
"rb_internal_thread_specific_key_create() is called more than %d times", RB_INTERNAL_THREAD_SPECIFIC_KEY_MAX);
5900 rb_internal_thread_specific_key_t key = specific_key_count++;
5907 ccan_list_for_each(&cr->threads.set, th, lt_node) {
5908 thread_specific_storage_alloc(th);
5921 VM_ASSERT(rb_thread_ptr(thread_val) == th);
5922 VM_ASSERT(key < RB_INTERNAL_THREAD_SPECIFIC_KEY_MAX);
5923 VM_ASSERT(th->specific_storage);
5925 return th->specific_storage[key];
5934 VM_ASSERT(rb_thread_ptr(thread_val) == th);
5935 VM_ASSERT(key < RB_INTERNAL_THREAD_SPECIFIC_KEY_MAX);
5936 VM_ASSERT(th->specific_storage);
5938 th->specific_storage[key] = data;
#define RUBY_ASSERT_ALWAYS(expr,...)
A variant of RUBY_ASSERT that does not interface with RUBY_DEBUG.
std::atomic< unsigned > rb_atomic_t
Type that is eligible for atomic operations.
#define rb_define_singleton_method(klass, mid, func, arity)
Defines klass.mid.
#define RUBY_INTERNAL_EVENT_SWITCH
Thread switched.
int rb_remove_event_hook(rb_event_hook_func_t func)
Removes the passed function from the list of event hooks.
#define RUBY_EVENT_THREAD_BEGIN
Encountered a new thread.
void(* rb_event_hook_func_t)(rb_event_flag_t evflag, VALUE data, VALUE self, ID mid, VALUE klass)
Type of event hooks.
uint32_t rb_event_flag_t
Represents event(s).
#define RUBY_EVENT_CALL
A method, written in Ruby, is called.
#define RUBY_EVENT_THREAD_END
Encountered an end of a thread.
static void RB_FL_SET_RAW(VALUE obj, VALUE flags)
This is an implementation detail of RB_FL_SET().
VALUE rb_define_class(const char *name, VALUE super)
Defines a top-level class.
void rb_define_alias(VALUE klass, const char *name1, const char *name2)
Defines an alias of a method.
ID rb_frame_last_func(void)
Returns the ID of the last method in the call stack.
void rb_define_method(VALUE klass, const char *name, VALUE(*func)(ANYARGS), int argc)
Defines a method.
int rb_keyword_given_p(void)
Determines if the current method is given a keyword argument.
int rb_block_given_p(void)
Determines if the current method is given a block.
#define rb_str_new2
Old name of rb_str_new_cstr.
#define ALLOC
Old name of RB_ALLOC.
#define T_STRING
Old name of RUBY_T_STRING.
#define xfree
Old name of ruby_xfree.
#define Qundef
Old name of RUBY_Qundef.
#define INT2FIX
Old name of RB_INT2FIX.
#define OBJ_FROZEN
Old name of RB_OBJ_FROZEN.
#define xrealloc
Old name of ruby_xrealloc.
#define ID2SYM
Old name of RB_ID2SYM.
#define OBJ_FREEZE
Old name of RB_OBJ_FREEZE.
#define UNREACHABLE_RETURN
Old name of RBIMPL_UNREACHABLE_RETURN.
#define CLASS_OF
Old name of rb_class_of.
#define xmalloc
Old name of ruby_xmalloc.
#define LONG2FIX
Old name of RB_INT2FIX.
#define FIX2INT
Old name of RB_FIX2INT.
#define ZALLOC_N
Old name of RB_ZALLOC_N.
#define T_ICLASS
Old name of RUBY_T_ICLASS.
#define T_HASH
Old name of RUBY_T_HASH.
#define Qtrue
Old name of RUBY_Qtrue.
#define NUM2INT
Old name of RB_NUM2INT.
#define INT2NUM
Old name of RB_INT2NUM.
#define Qnil
Old name of RUBY_Qnil.
#define Qfalse
Old name of RUBY_Qfalse.
#define FIX2LONG
Old name of RB_FIX2LONG.
#define T_ARRAY
Old name of RUBY_T_ARRAY.
#define T_OBJECT
Old name of RUBY_T_OBJECT.
#define NIL_P
Old name of RB_NIL_P.
#define POSFIXABLE
Old name of RB_POSFIXABLE.
#define BUILTIN_TYPE
Old name of RB_BUILTIN_TYPE.
#define FIXNUM_P
Old name of RB_FIXNUM_P.
#define SYMBOL_P
Old name of RB_SYMBOL_P.
void ruby_stop(int ex)
Calls ruby_cleanup() and exits the process.
#define ruby_debug
This variable controls whether the interpreter is in debug mode.
void rb_raise(VALUE exc, const char *fmt,...)
Exception entry point.
void rb_exc_raise(VALUE mesg)
Raises an exception in the current thread.
void rb_bug(const char *fmt,...)
Interpreter panic switch.
VALUE rb_eSystemExit
SystemExit exception.
VALUE rb_eIOError
IOError exception.
VALUE rb_eStandardError
StandardError exception.
VALUE rb_eTypeError
TypeError exception.
void rb_frozen_error_raise(VALUE frozen_obj, const char *fmt,...)
Raises an instance of rb_eFrozenError.
VALUE rb_eFatal
fatal exception.
VALUE rb_eRuntimeError
RuntimeError exception.
void rb_warn(const char *fmt,...)
Identical to rb_warning(), except it reports unless $VERBOSE is nil.
VALUE rb_exc_new(VALUE etype, const char *ptr, long len)
Creates an instance of the passed exception class.
VALUE rb_eArgError
ArgumentError exception.
VALUE rb_eException
Mother of all exceptions.
VALUE rb_ensure(VALUE(*b_proc)(VALUE), VALUE data1, VALUE(*e_proc)(VALUE), VALUE data2)
An equivalent to ensure clause.
VALUE rb_eThreadError
ThreadError exception.
void rb_exit(int status)
Terminates the current execution context.
VALUE rb_eSignal
SignalException exception.
VALUE rb_obj_alloc(VALUE klass)
Allocates an instance of the given class.
VALUE rb_cInteger
Module class.
VALUE rb_obj_hide(VALUE obj)
Make the object invisible from Ruby code.
VALUE rb_obj_class(VALUE obj)
Queries the class of an object.
VALUE rb_cThread
Thread class.
VALUE rb_cModule
Module class.
double rb_num2dbl(VALUE num)
Converts an instance of rb_cNumeric into C's double.
VALUE rb_obj_is_kind_of(VALUE obj, VALUE klass)
Queries if the given object is an instance (of possibly descendants) of the given class.
static bool rb_enc_asciicompat(rb_encoding *enc)
Queries if the passed encoding is in some sense compatible with ASCII.
rb_encoding * rb_enc_get(VALUE obj)
Identical to rb_enc_get_index(), except the return type.
static const char * rb_enc_name(rb_encoding *enc)
Queries the (canonical) name of the passed encoding.
void rb_gc_mark(VALUE obj)
Marks an object.
VALUE rb_ary_shift(VALUE ary)
Destructively deletes an element from the beginning of the passed array and returns what was deleted.
VALUE rb_ary_dup(VALUE ary)
Duplicates an array.
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_pop(VALUE ary)
Destructively deletes an element from the end of the passed array and returns what was deleted.
VALUE rb_ary_hidden_new(long capa)
Allocates a hidden (no class) empty array.
VALUE rb_ary_clear(VALUE ary)
Destructively removes everything form an array.
VALUE rb_ary_push(VALUE ary, VALUE elem)
Special case of rb_ary_cat() that it adds only one element.
VALUE rb_ary_entry(VALUE ary, long off)
Queries an element of an array.
VALUE rb_ary_join(VALUE ary, VALUE sep)
Recursively stringises the elements of the passed array, flattens that result, then joins the sequenc...
VALUE rb_fiber_current(void)
Queries the fiber which is calling this function.
static int rb_check_arity(int argc, int min, int max)
Ensures that the passed integer is in the passed range.
VALUE rb_make_exception(int argc, const VALUE *argv)
Constructs an exception object from the list of arguments, in a manner similar to Ruby's raise.
void rb_obj_call_init_kw(VALUE, int, const VALUE *, int)
Identical to rb_obj_call_init(), except you can specify how to handle the last element of the given a...
void rb_hash_foreach(VALUE hash, int(*func)(VALUE key, VALUE val, VALUE arg), VALUE arg)
Iterates over a hash.
VALUE rb_hash_lookup2(VALUE hash, VALUE key, VALUE def)
Identical to rb_hash_lookup(), except you can specify what to return on misshits.
VALUE rb_hash_aref(VALUE hash, VALUE key)
Queries the given key in the given hash table.
VALUE rb_hash_aset(VALUE hash, VALUE key, VALUE val)
Inserts or replaces ("upsert"s) the objects into the given hash table.
VALUE rb_hash_lookup(VALUE hash, VALUE key)
Identical to rb_hash_aref(), except it always returns RUBY_Qnil for misshits.
VALUE rb_hash_new(void)
Creates a new, empty hash object.
VALUE rb_memory_id(VALUE obj)
Identical to rb_obj_id(), except it hesitates from allocating a new instance of rb_cInteger.
VALUE rb_block_proc(void)
Constructs a Proc object from implicitly passed components.
void rb_reset_random_seed(void)
Resets the RNG behind rb_genrand_int32()/rb_genrand_real().
VALUE rb_str_new_frozen(VALUE str)
Creates a frozen copy of the string, if necessary.
VALUE rb_str_concat(VALUE dst, VALUE src)
Identical to rb_str_append(), except it also accepts an integer as a codepoint.
VALUE rb_str_new_cstr(const char *ptr)
Identical to rb_str_new(), except it assumes the passed pointer is a pointer to a C string.
VALUE rb_str_cat_cstr(VALUE dst, const char *src)
Identical to rb_str_cat(), except it assumes the passed pointer is a pointer to a C string.
int rb_thread_interrupted(VALUE thval)
Checks if the thread's execution was recently interrupted.
VALUE rb_thread_local_aref(VALUE thread, ID key)
This badly named function reads from a Fiber local storage.
VALUE rb_mutex_new(void)
Creates a mutex.
VALUE rb_thread_kill(VALUE thread)
Terminates the given thread.
#define RUBY_UBF_IO
A special UBF for blocking IO operations.
VALUE rb_thread_main(void)
Obtains the "main" thread.
VALUE rb_exec_recursive(VALUE(*f)(VALUE g, VALUE h, int r), VALUE g, VALUE h)
"Recursion" API entry point.
void rb_thread_sleep_forever(void)
Blocks indefinitely.
void rb_thread_fd_close(int fd)
Notifies a closing of a file descriptor to other threads.
void rb_thread_wait_for(struct timeval time)
Identical to rb_thread_sleep(), except it takes struct timeval instead.
VALUE rb_thread_stop(void)
Stops the current thread.
VALUE rb_mutex_sleep(VALUE self, VALUE timeout)
Releases the lock held in the mutex and waits for the period of time; reacquires the lock on wakeup.
VALUE rb_exec_recursive_paired(VALUE(*f)(VALUE g, VALUE h, int r), VALUE g, VALUE p, VALUE h)
Identical to rb_exec_recursive(), except it checks for the recursion on the ordered pair of { g,...
void rb_unblock_function_t(void *)
This is the type of UBFs.
void rb_thread_atfork_before_exec(void)
:FIXME: situation of this function is unclear.
VALUE rb_thread_create(VALUE(*f)(void *g), void *g)
Creates a Ruby thread that is backended by a C function.
void rb_thread_check_ints(void)
Checks for interrupts.
VALUE rb_thread_run(VALUE thread)
This is a rb_thread_wakeup() + rb_thread_schedule() combo.
VALUE rb_thread_wakeup(VALUE thread)
Marks a given thread as eligible for scheduling.
VALUE rb_mutex_unlock(VALUE mutex)
Releases the mutex.
VALUE rb_exec_recursive_paired_outer(VALUE(*f)(VALUE g, VALUE h, int r), VALUE g, VALUE p, VALUE h)
Identical to rb_exec_recursive_outer(), except it checks for the recursion on the ordered pair of { g...
void rb_thread_sleep_deadly(void)
Identical to rb_thread_sleep_forever(), except the thread calling this function is considered "dead" ...
void rb_thread_atfork(void)
A pthread_atfork(3posix)-like API.
VALUE rb_thread_current(void)
Obtains the "current" thread.
int rb_thread_alone(void)
Checks if the thread this function is running is the only thread that is currently alive.
VALUE rb_thread_local_aset(VALUE thread, ID key, VALUE val)
This badly named function writes to a Fiber local storage.
void rb_thread_schedule(void)
Tries to switch to another thread.
#define RUBY_UBF_PROCESS
A special UBF for blocking process operations.
VALUE rb_exec_recursive_outer(VALUE(*f)(VALUE g, VALUE h, int r), VALUE g, VALUE h)
Identical to rb_exec_recursive(), except it calls f for outermost recursion only.
VALUE rb_thread_wakeup_alive(VALUE thread)
Identical to rb_thread_wakeup(), except it doesn't raise on an already killed thread.
VALUE rb_mutex_lock(VALUE mutex)
Attempts to lock the mutex.
void rb_thread_sleep(int sec)
Blocks for the given period of time.
void rb_timespec_now(struct timespec *ts)
Fills the current time into the given struct.
struct timeval rb_time_timeval(VALUE time)
Converts an instance of rb_cTime to a struct timeval that represents the identical point of time.
VALUE rb_ivar_set(VALUE obj, ID name, VALUE val)
Identical to rb_iv_set(), except it accepts the name as an ID instead of a C string.
VALUE rb_ivar_get(VALUE obj, ID name)
Identical to rb_iv_get(), except it accepts the name as an ID instead of a C string.
VALUE rb_class_path(VALUE mod)
Identical to rb_mod_name(), except it returns #<Class: ...> style inspection for anonymous modules.
void rb_define_alloc_func(VALUE klass, rb_alloc_func_t func)
Sets the allocator function of a class.
int rb_sourceline(void)
Resembles __LINE__.
static ID rb_intern_const(const char *str)
This is a "tiny optimisation" over rb_intern().
ID rb_check_id(volatile VALUE *namep)
Detects if the given name is already interned or not.
VALUE rb_to_symbol(VALUE name)
Identical to rb_intern_str(), except it generates a dynamic symbol if necessary.
ID rb_to_id(VALUE str)
Identical to rb_intern(), except it takes an instance of rb_cString.
void rb_define_const(VALUE klass, const char *name, VALUE val)
Defines a Ruby level constant under a namespace.
VALUE rb_eIOTimeoutError
Indicates that a timeout has occurred while performing an IO operation.
char * ptr
Pointer to the underlying memory region, of at least capa bytes.
void * rb_thread_call_without_gvl2(void *(*func)(void *), void *data1, rb_unblock_function_t *ubf, void *data2)
Identical to rb_thread_call_without_gvl(), except it does not interface with signals etc.
#define RB_NOGVL_UBF_ASYNC_SAFE
Passing this flag to rb_nogvl() indicates that the passed UBF is async-signal-safe.
void * rb_internal_thread_specific_get(VALUE thread_val, rb_internal_thread_specific_key_t key)
Get thread and tool specific data.
#define RB_NOGVL_INTR_FAIL
Passing this flag to rb_nogvl() prevents it from checking interrupts.
void rb_internal_thread_specific_set(VALUE thread_val, rb_internal_thread_specific_key_t key, void *data)
Set thread and tool specific data.
rb_internal_thread_specific_key_t rb_internal_thread_specific_key_create(void)
Create a key to store thread specific data.
void * rb_thread_call_with_gvl(void *(*func)(void *), void *data1)
(Re-)acquires the GVL.
void * rb_nogvl(void *(*func)(void *), void *data1, rb_unblock_function_t *ubf, void *data2, int flags)
Identical to rb_thread_call_without_gvl(), except it additionally takes "flags" that change the behav...
void * rb_thread_call_without_gvl(void *(*func)(void *), void *data1, rb_unblock_function_t *ubf, void *data2)
Allows the passed function to run in parallel with other Ruby threads.
VALUE rb_sprintf(const char *fmt,...)
Ruby's extended sprintf(3).
VALUE rb_str_catf(VALUE dst, const char *fmt,...)
Identical to rb_sprintf(), except it renders the output to the specified object rather than creating ...
#define RB_BLOCK_CALL_FUNC_ARGLIST(yielded_arg, callback_arg)
Shim for block function parameters.
VALUE rb_yield(VALUE val)
Yields the block.
void rb_throw_obj(VALUE tag, VALUE val)
Identical to rb_throw(), except it allows arbitrary Ruby object to become a tag.
static int rb_fd_max(const rb_fdset_t *f)
It seems this function has no use.
static fd_set * rb_fd_ptr(const rb_fdset_t *f)
Raw pointer to fd_set.
int rb_fd_select(int nfds, rb_fdset_t *rfds, rb_fdset_t *wfds, rb_fdset_t *efds, struct timeval *timeout)
Waits for multiple file descriptors at once.
int rb_fd_isset(int fd, const rb_fdset_t *f)
Queries if the given FD is in the given set.
void rb_fd_clr(int fd, rb_fdset_t *f)
Releases a specific FD from the given fdset.
void rb_fd_copy(rb_fdset_t *dst, const fd_set *src, int max)
Destructively overwrites an fdset with another.
void rb_fd_dup(rb_fdset_t *dst, const rb_fdset_t *src)
Identical to rb_fd_copy(), except it copies unlimited number of file descriptors.
void rb_fd_term(rb_fdset_t *f)
Destroys the rb_fdset_t, releasing any memory and resources it used.
void rb_fd_zero(rb_fdset_t *f)
Wipes out the current set of FDs.
#define MEMCPY(p1, p2, type, n)
Handy macro to call memcpy.
#define ALLOCA_N(type, n)
#define MEMZERO(p, type, n)
Handy macro to erase a region of memory.
#define RB_GC_GUARD(v)
Prevents premature destruction of local objects.
#define rb_fd_init
Initialises the :given :rb_fdset_t.
#define rb_fd_set
Sets the given fd to the rb_fdset_t.
#define RARRAY_LEN
Just another name of rb_array_len.
static int RARRAY_LENINT(VALUE ary)
Identical to rb_array_len(), except it differs for the return type.
static void RARRAY_ASET(VALUE ary, long i, VALUE v)
Assigns an object in an array.
#define RARRAY_AREF(a, i)
#define RARRAY_CONST_PTR
Just another name of rb_array_const_ptr.
static VALUE RBASIC_CLASS(VALUE obj)
Queries the class of an object.
#define RBASIC(obj)
Convenient casting macro.
#define RCLASS_SUPER
Just another name of rb_class_get_superclass.
#define DATA_PTR(obj)
Convenient getter macro.
#define RHASH_EMPTY_P(h)
Checks if the hash is empty.
#define StringValueCStr(v)
Identical to StringValuePtr, except it additionally checks for the contents for viability as a C stri...
#define RUBY_TYPED_DEFAULT_FREE
This is a value you can set to rb_data_type_struct::dfree.
#define TypedData_Get_Struct(obj, type, data_type, sval)
Obtains a C struct from inside of a wrapper Ruby object.
#define TypedData_Wrap_Struct(klass, data_type, sval)
Converts sval, a pointer to your struct, into a Ruby object.
#define TypedData_Make_Struct(klass, type, data_type, sval)
Identical to TypedData_Wrap_Struct, except it allocates a new data region internally instead of takin...
int rb_errno(void)
Identical to system errno.
void rb_errno_set(int err)
Set the errno.
#define errno
Ractor-aware version of errno.
int ruby_native_thread_p(void)
Queries if the thread which calls this function is a ruby's thread.
int ruby_snprintf(char *str, size_t n, char const *fmt,...)
Our own locale-insensitive version of snprintf(3).
#define RB_PASS_CALLED_KEYWORDS
Pass keywords if current method is called with keywords, useful for argument delegation.
VALUE rb_fiber_scheduler_current(void)
Identical to rb_fiber_scheduler_get(), except it also returns RUBY_Qnil in case of a blocking fiber.
VALUE rb_fiber_scheduler_block(VALUE scheduler, VALUE blocker, VALUE timeout)
Non-blocking wait for the passed "blocker", which is for instance Thread.join or Mutex....
VALUE rb_fiber_scheduler_blocking_region(VALUE scheduler, void *(*function)(void *), void *data, rb_unblock_function_t *unblock_function, void *data2, int flags, struct rb_fiber_scheduler_blocking_region_state *state)
Defer the execution of the passed function to the scheduler.
VALUE rb_fiber_scheduler_set(VALUE scheduler)
Destructively assigns the passed scheduler to that of the current thread that is calling this functio...
VALUE rb_fiber_scheduler_unblock(VALUE scheduler, VALUE blocker, VALUE fiber)
Wakes up a fiber previously blocked using rb_fiber_scheduler_block().
int rb_thread_fd_select(int nfds, rb_fdset_t *rfds, rb_fdset_t *wfds, rb_fdset_t *efds, struct timeval *timeout)
Waits for multiple file descriptors at once.
#define rb_fd_resize(n, f)
Does nothing (defined for compatibility).
static bool RB_TEST(VALUE obj)
Emulates Ruby's "if" statement.
#define RTEST
This is an old name of RB_TEST.
#define _(args)
This was a transition path from K&R to ANSI.
This is the struct that holds necessary info for a struct.
The data structure which wraps the fd_set bitmap used by select(2).
int maxfd
Maximum allowed number of FDs.
fd_set * fdset
File descriptors buffer.
int capa
Maximum allowed number of FDs.
const rb_iseq_t * iseqptr
iseq pointer, should be separated from iseqval
void rb_nativethread_lock_lock(rb_nativethread_lock_t *lock)
Blocks until the current thread obtains a lock.
void rb_native_mutex_lock(rb_nativethread_lock_t *lock)
Just another name of rb_nativethread_lock_lock.
void rb_native_mutex_initialize(rb_nativethread_lock_t *lock)
Just another name of rb_nativethread_lock_initialize.
void rb_native_mutex_unlock(rb_nativethread_lock_t *lock)
Just another name of rb_nativethread_lock_unlock.
void rb_nativethread_lock_unlock(rb_nativethread_lock_t *lock)
Releases a lock.
void rb_native_mutex_destroy(rb_nativethread_lock_t *lock)
Just another name of rb_nativethread_lock_destroy.
void rb_nativethread_lock_initialize(rb_nativethread_lock_t *lock)
Fills the passed lock with an initial value.
void rb_nativethread_lock_destroy(rb_nativethread_lock_t *lock)
Destroys the passed mutex.
uintptr_t ID
Type that represents a Ruby identifier such as a variable name.
uintptr_t VALUE
Type that represents a Ruby object.
static bool RB_TYPE_P(VALUE obj, enum ruby_value_type t)
Queries if the given object is of given type.