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"
103#if USE_RJIT && defined(HAVE_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
113static VALUE rb_cThreadShield;
115static VALUE sym_immediate;
116static VALUE sym_on_blocking;
117static 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)
123rb_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,
139static void sleep_forever(
rb_thread_t *th,
unsigned int fl);
140static int sleep_hrtime(
rb_thread_t *, rb_hrtime_t,
unsigned int fl);
142static void rb_thread_sleep_deadly_allow_spurious_wakeup(
VALUE blocker,
VALUE timeout, rb_hrtime_t end);
145static int rb_threadptr_pending_interrupt_empty_p(
const rb_thread_t *th);
146static const char *thread_status_name(
rb_thread_t *th,
int detail);
147static int hrtime_update_expire(rb_hrtime_t *,
const rb_hrtime_t);
148NORETURN(
static void async_bug_fd(
const char *mesg,
int errno_arg,
int fd));
149MAYBE_UNUSED(
static int consume_communication_pipe(
int fd));
151static volatile int system_working = 1;
152static 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;
170static 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)
252timeout_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);
265MAYBE_UNUSED(NOINLINE(
static int thread_start_func_2(
rb_thread_t *th,
VALUE *stack_start)));
266MAYBE_UNUSED(
static bool th_has_dedicated_nt(
const rb_thread_t *th));
267MAYBE_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;
345rb_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;
431rb_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);
492void rb_threadptr_root_fiber_terminate(
rb_thread_t *th);
495thread_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);
507thread_cleanup_func(
void *th_ptr,
int atfork)
511 th->locking_mutex =
Qfalse;
512 thread_cleanup_func_before_exec(th_ptr);
533 native_thread_init_stack(th);
537rb_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:
628 rb_bug(
"unreachable");
639 STACK_GROW_DIR_DETECTION;
641 RUBY_DEBUG_LOG(
"th:%u", rb_th_serial(th));
642 VM_ASSERT(th != th->vm->ractor.main_thread);
644 enum ruby_tag_type state;
646 rb_thread_t *ractor_main_th = th->ractor->threads.main;
649 if (rb_ractor_status_p(th->ractor, ractor_blocking)) {
652 rb_vm_ractor_blocking_cnt_dec(th->vm, th->ractor, __FILE__, __LINE__);
654 r->r_stdin = rb_io_prep_stdin();
655 r->r_stdout = rb_io_prep_stdout();
656 r->r_stderr = rb_io_prep_stderr();
662 VM_ASSERT(UNDEF_P(th->value));
664 int fiber_scheduler_closed = 0, event_thread_end_hooked = 0;
669 if ((state = EC_EXEC_TAG()) == TAG_NONE) {
672 SAVE_ROOT_JMPBUF(th, result = thread_do_start(th));
675 if (!fiber_scheduler_closed) {
676 fiber_scheduler_closed = 1;
680 if (!event_thread_end_hooked) {
681 event_thread_end_hooked = 1;
685 if (state == TAG_NONE) {
689 errinfo = th->ec->errinfo;
691 VALUE exc = rb_vm_make_jump_tag_but_local_jump(state,
Qundef);
692 if (!
NIL_P(exc)) errinfo = exc;
694 if (state == TAG_FATAL) {
695 if (th->invoke_type == thread_invoke_type_ractor_proc) {
696 rb_ractor_atexit(th->ec,
Qnil);
704 if (th->report_on_exception) {
705 VALUE mesg = rb_thread_to_s(th->self);
706 rb_str_cat_cstr(mesg,
" terminated with exception (report_on_exception is true):\n");
707 rb_write_error_str(mesg);
708 rb_ec_error_print(th->ec, errinfo);
711 if (th->invoke_type == thread_invoke_type_ractor_proc) {
712 rb_ractor_atexit_exception(th->ec);
715 if (th->vm->thread_abort_on_exception ||
727 VM_ASSERT(!UNDEF_P(th->value));
729 rb_threadptr_join_list_wakeup(th);
730 rb_threadptr_unlock_all_locking_mutexes(th);
732 if (th->invoke_type == thread_invoke_type_ractor_proc) {
733 rb_thread_terminate_all(th);
734 rb_ractor_teardown(th->ec);
737 th->status = THREAD_KILLED;
738 RUBY_DEBUG_LOG(
"killed th:%u", rb_th_serial(th));
740 if (th->vm->ractor.main_thread == th) {
746 rb_threadptr_raise(ractor_main_th, 1, &errinfo);
751 rb_ec_clear_current_thread_trace_func(th->ec);
754 if (th->locking_mutex !=
Qfalse) {
755 rb_bug(
"thread_start_func_2: locking_mutex must not be set (%p:%"PRIxVALUE
")",
756 (
void *)th, th->locking_mutex);
759 if (ractor_main_th->status == THREAD_KILLED &&
760 th->ractor->threads.cnt <= 2 ) {
762 rb_threadptr_interrupt(ractor_main_th);
765 rb_check_deadlock(th->ractor);
767 rb_fiber_close(th->ec->fiber_ptr);
769 thread_cleanup_func(th, FALSE);
770 VM_ASSERT(th->ec->vm_stack == NULL);
772 if (th->invoke_type == thread_invoke_type_ractor_proc) {
776 thread_sched_to_dead(TH_SCHED(th), th);
777 rb_ractor_living_threads_remove(th->ractor, th);
780 rb_ractor_living_threads_remove(th->ractor, th);
781 thread_sched_to_dead(TH_SCHED(th), th);
788 enum thread_invoke_type type;
801static void thread_specific_storage_alloc(
rb_thread_t *th);
807 rb_thread_t *th = rb_thread_ptr(thval), *current_th = rb_ec_thread_ptr(ec);
810 thread_specific_storage_alloc(th);
814 "can't start a new thread (frozen ThreadGroup)");
817 rb_fiber_inherit_storage(ec, th->ec->fiber_ptr);
819 switch (params->type) {
820 case thread_invoke_type_proc:
821 th->invoke_type = thread_invoke_type_proc;
822 th->invoke_arg.proc.args = params->args;
823 th->invoke_arg.proc.proc = params->proc;
827 case thread_invoke_type_ractor_proc:
828#if RACTOR_CHECK_MODE > 0
829 rb_ractor_setup_belonging_to(thval, rb_ractor_id(params->g));
831 th->invoke_type = thread_invoke_type_ractor_proc;
832 th->ractor = params->g;
833 th->ractor->threads.main = th;
834 th->invoke_arg.proc.proc = rb_proc_isolate_bang(params->proc);
837 rb_ractor_send_parameters(ec, params->g, params->args);
840 case thread_invoke_type_func:
841 th->invoke_type = thread_invoke_type_func;
842 th->invoke_arg.func.func = params->fn;
843 th->invoke_arg.func.arg = (
void *)params->args;
847 rb_bug(
"unreachable");
850 th->priority = current_th->priority;
851 th->thgroup = current_th->thgroup;
853 th->pending_interrupt_queue = rb_ary_hidden_new(0);
854 th->pending_interrupt_queue_checked = 0;
855 th->pending_interrupt_mask_stack = rb_ary_dup(current_th->pending_interrupt_mask_stack);
856 RBASIC_CLEAR_CLASS(th->pending_interrupt_mask_stack);
860 RUBY_DEBUG_LOG(
"r:%u th:%u", rb_ractor_id(th->ractor), rb_th_serial(th));
862 rb_ractor_living_threads_insert(th->ractor, th);
865 err = native_thread_create(th);
867 th->status = THREAD_KILLED;
868 rb_ractor_living_threads_remove(th->ractor, th);
874#define threadptr_initialized(th) ((th)->invoke_type != thread_invoke_type_none)
897thread_s_new(
int argc,
VALUE *argv,
VALUE klass)
900 VALUE thread = rb_thread_alloc(klass);
902 if (GET_RACTOR()->threads.main->status == THREAD_KILLED) {
907 th = rb_thread_ptr(thread);
908 if (!threadptr_initialized(th)) {
909 rb_raise(
rb_eThreadError,
"uninitialized thread - check `%"PRIsVALUE
"#initialize'",
929 .type = thread_invoke_type_proc,
933 return thread_create_core(rb_thread_alloc(klass), ¶ms);
939 if (th->invoke_type == thread_invoke_type_proc) {
940 return rb_proc_location(th->invoke_arg.proc.proc);
956 else if (th->invoke_type != thread_invoke_type_none) {
957 VALUE loc = threadptr_invoke_proc_location(th);
960 "already initialized thread - %"PRIsVALUE
":%"PRIsVALUE,
969 .type = thread_invoke_type_proc,
973 return thread_create_core(thread, ¶ms);
981 .type = thread_invoke_type_func,
985 return thread_create_core(rb_thread_alloc(
rb_cThread), ¶ms);
992 .type = thread_invoke_type_ractor_proc,
997 return thread_create_core(rb_thread_alloc(
rb_cThread), ¶ms);
1009remove_from_join_list(
VALUE arg)
1014 if (target_thread->status != THREAD_KILLED) {
1017 while (*join_list) {
1018 if (*join_list == p->waiter) {
1019 *join_list = (*join_list)->next;
1023 join_list = &(*join_list)->next;
1033 return th->status == THREAD_KILLED || !UNDEF_P(th->value);
1037thread_join_sleep(
VALUE arg)
1040 rb_thread_t *target_th = p->target, *th = p->waiter->thread;
1041 rb_hrtime_t end = 0, *limit = p->limit;
1044 end = rb_hrtime_add(*limit, rb_hrtime_now());
1047 while (!thread_finished(target_th)) {
1050 if (scheduler !=
Qnil) {
1053 if (thread_finished(target_th))
break;
1058 sleep_forever(th, SLEEP_DEADLOCKABLE | SLEEP_ALLOW_SPURIOUS | SLEEP_NO_CHECKINTS);
1061 if (hrtime_update_expire(limit, end)) {
1062 RUBY_DEBUG_LOG(
"timeout target_th:%u", rb_th_serial(target_th));
1065 th->status = THREAD_STOPPED;
1066 native_sleep(th, limit);
1068 RUBY_VM_CHECK_INTS_BLOCKING(th->ec);
1069 th->status = THREAD_RUNNABLE;
1071 RUBY_DEBUG_LOG(
"interrupted target_th:%u status:%s", rb_th_serial(target_th), thread_status_name(target_th, TRUE));
1084 if (th == target_th) {
1085 rb_raise(
rb_eThreadError,
"Target thread must not be current thread");
1088 if (th->ractor->threads.main == target_th) {
1092 RUBY_DEBUG_LOG(
"target_th:%u status:%s", rb_th_serial(target_th), thread_status_name(target_th, TRUE));
1094 if (target_th->status != THREAD_KILLED) {
1096 waiter.next = target_th->join_list;
1098 waiter.fiber = rb_fiberptr_blocking(fiber) ? NULL : fiber;
1099 target_th->join_list = &waiter;
1102 arg.waiter = &waiter;
1103 arg.target = target_th;
1104 arg.timeout = timeout;
1112 RUBY_DEBUG_LOG(
"success target_th:%u status:%s", rb_th_serial(target_th), thread_status_name(target_th, TRUE));
1114 if (target_th->ec->errinfo !=
Qnil) {
1115 VALUE err = target_th->ec->errinfo;
1120 RUBY_DEBUG_LOG(
"terminated target_th:%u status:%s", rb_th_serial(target_th), thread_status_name(target_th, TRUE));
1125 rb_bug(
"thread_join: Fixnum (%d) should not reach here.",
FIX2INT(err));
1128 else if (THROW_DATA_P(target_th->ec->errinfo)) {
1129 rb_bug(
"thread_join: THROW_DATA should not reach here.");
1136 return target_th->self;
1179thread_join_m(
int argc,
VALUE *argv,
VALUE self)
1182 rb_hrtime_t rel = 0, *limit = 0;
1193 if (
NIL_P(timeout)) {
1197 rel = rb_sec2hrtime(NUM2TIMET(timeout));
1201 limit = double2hrtime(&rel,
rb_num2dbl(timeout));
1204 return thread_join(rb_thread_ptr(self), timeout, limit);
1222thread_value(
VALUE self)
1225 thread_join(th,
Qnil, 0);
1226 if (UNDEF_P(th->value)) {
1240#if defined(HAVE_CLOCK_GETTIME) && defined(CLOCK_MONOTONIC)
1241 if (clock_gettime(CLOCK_MONOTONIC, ts) == 0)
1251NOINLINE(rb_hrtime_t rb_hrtime_now(
void));
1258 return rb_timespec2hrtime(&ts);
1265COMPILER_WARNING_PUSH
1266#if defined(__GNUC__) && __GNUC__ == 7 && __GNUC_MINOR__ <= 3
1267COMPILER_WARNING_IGNORED(-Wmaybe-uninitialized)
1270#define PRIu64 PRI_64_PREFIX "u"
1278hrtime_update_expire(rb_hrtime_t *timeout,
const rb_hrtime_t end)
1280 rb_hrtime_t now = rb_hrtime_now();
1282 if (now > end)
return 1;
1284 RUBY_DEBUG_LOG(
"%"PRIu64
" > %"PRIu64
"", (uint64_t)end, (uint64_t)now);
1286 *timeout = end - now;
1292sleep_hrtime(
rb_thread_t *th, rb_hrtime_t rel,
unsigned int fl)
1294 enum rb_thread_status prev_status = th->status;
1296 rb_hrtime_t end = rb_hrtime_add(rb_hrtime_now(), rel);
1298 th->status = THREAD_STOPPED;
1299 RUBY_VM_CHECK_INTS_BLOCKING(th->ec);
1300 while (th->status == THREAD_STOPPED) {
1301 native_sleep(th, &rel);
1302 woke = vm_check_ints_blocking(th->ec);
1303 if (woke && !(fl & SLEEP_SPURIOUS_CHECK))
1305 if (hrtime_update_expire(&rel, end))
1309 th->status = prev_status;
1314sleep_hrtime_until(
rb_thread_t *th, rb_hrtime_t end,
unsigned int fl)
1316 enum rb_thread_status prev_status = th->status;
1318 rb_hrtime_t rel = rb_hrtime_sub(end, rb_hrtime_now());
1320 th->status = THREAD_STOPPED;
1321 RUBY_VM_CHECK_INTS_BLOCKING(th->ec);
1322 while (th->status == THREAD_STOPPED) {
1323 native_sleep(th, &rel);
1324 woke = vm_check_ints_blocking(th->ec);
1325 if (woke && !(fl & SLEEP_SPURIOUS_CHECK))
1327 if (hrtime_update_expire(&rel, end))
1331 th->status = prev_status;
1338 enum rb_thread_status prev_status = th->status;
1339 enum rb_thread_status status;
1342 status = fl & SLEEP_DEADLOCKABLE ? THREAD_STOPPED_FOREVER : THREAD_STOPPED;
1343 th->status = status;
1345 if (!(fl & SLEEP_NO_CHECKINTS)) RUBY_VM_CHECK_INTS_BLOCKING(th->ec);
1347 while (th->status == status) {
1348 if (fl & SLEEP_DEADLOCKABLE) {
1349 rb_ractor_sleeper_threads_inc(th->ractor);
1350 rb_check_deadlock(th->ractor);
1353 native_sleep(th, 0);
1355 if (fl & SLEEP_DEADLOCKABLE) {
1356 rb_ractor_sleeper_threads_dec(th->ractor);
1358 if (fl & SLEEP_ALLOW_SPURIOUS) {
1362 woke = vm_check_ints_blocking(th->ec);
1364 if (woke && !(fl & SLEEP_SPURIOUS_CHECK)) {
1368 th->status = prev_status;
1374 RUBY_DEBUG_LOG(
"forever");
1375 sleep_forever(GET_THREAD(), SLEEP_SPURIOUS_CHECK);
1381 RUBY_DEBUG_LOG(
"deadly");
1382 sleep_forever(GET_THREAD(), SLEEP_DEADLOCKABLE|SLEEP_SPURIOUS_CHECK);
1386rb_thread_sleep_deadly_allow_spurious_wakeup(
VALUE blocker,
VALUE timeout, rb_hrtime_t end)
1389 if (scheduler !=
Qnil) {
1393 RUBY_DEBUG_LOG(
"...");
1395 sleep_hrtime_until(GET_THREAD(), end, SLEEP_SPURIOUS_CHECK);
1398 sleep_forever(GET_THREAD(), SLEEP_DEADLOCKABLE);
1408 sleep_hrtime(th, rb_timeval2hrtime(&time), SLEEP_SPURIOUS_CHECK);
1421 RUBY_VM_CHECK_INTS_BLOCKING(GET_EC());
1429rb_thread_check_trap_pending(
void)
1431 return rb_signal_buff_size() != 0;
1438 return (
int)RUBY_VM_INTERRUPTED(rb_thread_ptr(thval)->ec);
1448rb_thread_schedule_limits(uint32_t limits_us)
1452 RUBY_DEBUG_LOG(
"us:%u", (
unsigned int)limits_us);
1454 if (th->running_time_us >= limits_us) {
1455 RUBY_DEBUG_LOG(
"switch %s",
"start");
1457 RB_VM_SAVE_MACHINE_CONTEXT(th);
1458 thread_sched_yield(TH_SCHED(th), th);
1459 rb_ractor_thread_switch(th->ractor, th);
1461 RUBY_DEBUG_LOG(
"switch %s",
"done");
1469 rb_thread_schedule_limits(0);
1470 RUBY_VM_CHECK_INTS(GET_EC());
1479#ifdef RUBY_VM_CRITICAL_SECTION
1480 VM_ASSERT(ruby_assert_critical_section_entered == 0);
1482 VM_ASSERT(th == GET_THREAD());
1484 region->prev_status = th->status;
1485 if (unblock_function_set(th, ubf, arg, fail_if_interrupted)) {
1486 th->blocking_region_buffer = region;
1487 th->status = THREAD_STOPPED;
1488 rb_ractor_blocking_threads_inc(th->ractor, __FILE__, __LINE__);
1490 RUBY_DEBUG_LOG(
"thread_id:%p", (
void *)th->nt->thread_id);
1502 unblock_function_clear(th);
1504 unregister_ubf_list(th);
1506 thread_sched_to_running(TH_SCHED(th), th);
1507 rb_ractor_thread_switch(th->ractor, th);
1509 th->blocking_region_buffer = 0;
1510 rb_ractor_blocking_threads_dec(th->ractor, __FILE__, __LINE__);
1511 if (th->status == THREAD_STOPPED) {
1512 th->status = region->prev_status;
1515 RUBY_DEBUG_LOG(
"end");
1519 VM_ASSERT(th == GET_THREAD());
1524rb_nogvl(
void *(*func)(
void *),
void *data1,
1531 rb_vm_t *vm = rb_ec_vm_ptr(ec);
1532 bool is_main_thread = vm->ractor.main_thread == th;
1533 int saved_errno = 0;
1540 else if (ubf && rb_ractor_living_thread_num(th->ractor) == 1 && is_main_thread) {
1542 vm->ubf_async_safe = 1;
1546 BLOCKING_REGION(th, {
1548 saved_errno = rb_errno();
1551 if (is_main_thread) vm->ubf_async_safe = 0;
1554 RUBY_VM_CHECK_INTS_BLOCKING(ec);
1561 rb_errno_set(saved_errno);
1662 return rb_nogvl(func, data1, ubf, data2, 0);
1666waitfd_to_waiting_flag(
int wfd_event)
1668 return wfd_event << 1;
1680 ccan_list_add(&th->vm->waiting_fds, &wfd->wfd_node);
1686thread_io_wake_pending_closer(
struct waiting_fd *wfd)
1688 bool has_waiter = wfd->busy &&
RB_TEST(wfd->busy->wakeup_mutex);
1697 ccan_list_del(&wfd->wfd_node);
1709#if defined(USE_MN_THREADS) && USE_MN_THREADS
1710 if (!th_has_dedicated_nt(th) &&
1711 (events || timeout) &&
1715 rb_hrtime_t rel, *prel;
1718 rel = rb_timeval2hrtime(timeout);
1725 VM_ASSERT(prel || (events & (RB_WAITFD_IN | RB_WAITFD_OUT)));
1727 thread_io_setup_wfd(th, fd, wfd);
1730 r = thread_sched_wait_events(TH_SCHED(th), th, fd, waitfd_to_waiting_flag(events), prel);
1732 thread_io_wake_pending_closer(wfd);
1734 RUBY_VM_CHECK_INTS_BLOCKING(ec);
1744rb_thread_io_blocking_call(rb_blocking_function_t *func,
void *data1,
int fd,
int events)
1749 RUBY_DEBUG_LOG(
"th:%u fd:%d ev:%d", rb_th_serial(th), fd, events);
1753 thread_io_wait_events(th, ec, fd, events, NULL, &
waiting_fd);
1756 volatile int saved_errno = 0;
1757 enum ruby_tag_type state;
1768 if ((state = EC_EXEC_TAG()) == TAG_NONE) {
1771 saved_errno = errno;
1783 EC_JUMP_TAG(ec, state);
1786 RUBY_VM_CHECK_INTS_BLOCKING(ec);
1789 if (saved_errno == ETIMEDOUT) {
1793 errno = saved_errno;
1799rb_thread_io_blocking_region(rb_blocking_function_t *func,
void *data1,
int fd)
1801 return rb_thread_io_blocking_call(func, data1, fd, 0);
1846 fprintf(stderr,
"[BUG] rb_thread_call_with_gvl() is called by non-ruby thread\n");
1851 prev_unblock = th->unblock;
1854 rb_bug(
"rb_thread_call_with_gvl: called by a thread which has GVL.");
1857 blocking_region_end(th, brb);
1861 int released = blocking_region_begin(th, brb, prev_unblock.func, prev_unblock.arg, FALSE);
1863 RB_VM_SAVE_MACHINE_CONTEXT(th);
1864 thread_sched_to_waiting(TH_SCHED(th), th);
1878ruby_thread_has_gvl_p(
void)
1882 if (th && th->blocking_region_buffer == 0) {
1899thread_s_pass(
VALUE klass)
1924rb_threadptr_pending_interrupt_clear(
rb_thread_t *th)
1926 rb_ary_clear(th->pending_interrupt_queue);
1932 rb_ary_push(th->pending_interrupt_queue, v);
1933 th->pending_interrupt_queue_checked = 0;
1937threadptr_check_pending_interrupt_queue(
rb_thread_t *th)
1939 if (!th->pending_interrupt_queue) {
1944enum handle_interrupt_timing {
1946 INTERRUPT_IMMEDIATE,
1947 INTERRUPT_ON_BLOCKING,
1951static enum handle_interrupt_timing
1954 if (sym == sym_immediate) {
1955 return INTERRUPT_IMMEDIATE;
1957 else if (sym == sym_on_blocking) {
1958 return INTERRUPT_ON_BLOCKING;
1960 else if (sym == sym_never) {
1961 return INTERRUPT_NEVER;
1968static enum handle_interrupt_timing
1972 long mask_stack_len =
RARRAY_LEN(th->pending_interrupt_mask_stack);
1977 for (i=0; i<mask_stack_len; i++) {
1978 mask = mask_stack[mask_stack_len-(i+1)];
1983 return rb_threadptr_pending_interrupt_from_symbol(th, mask);
1995 klass =
RBASIC(mod)->klass;
1997 else if (mod != RCLASS_ORIGIN(mod)) {
2001 if ((sym = rb_hash_aref(mask, klass)) !=
Qnil) {
2002 return rb_threadptr_pending_interrupt_from_symbol(th, sym);
2007 return INTERRUPT_NONE;
2011rb_threadptr_pending_interrupt_empty_p(
const rb_thread_t *th)
2013 return RARRAY_LEN(th->pending_interrupt_queue) == 0;
2020 for (i=0; i<
RARRAY_LEN(th->pending_interrupt_queue); i++) {
2030rb_threadptr_pending_interrupt_deque(
rb_thread_t *th,
enum handle_interrupt_timing timing)
2035 for (i=0; i<
RARRAY_LEN(th->pending_interrupt_queue); i++) {
2038 enum handle_interrupt_timing mask_timing = rb_threadptr_pending_interrupt_check_mask(th,
CLASS_OF(err));
2040 switch (mask_timing) {
2041 case INTERRUPT_ON_BLOCKING:
2042 if (timing != INTERRUPT_ON_BLOCKING) {
2046 case INTERRUPT_NONE:
2047 case INTERRUPT_IMMEDIATE:
2048 rb_ary_delete_at(th->pending_interrupt_queue, i);
2050 case INTERRUPT_NEVER:
2055 th->pending_interrupt_queue_checked = 1;
2058 VALUE err = rb_ary_shift(th->pending_interrupt_queue);
2059 if (rb_threadptr_pending_interrupt_empty_p(th)) {
2060 th->pending_interrupt_queue_checked = 1;
2067threadptr_pending_interrupt_active_p(
rb_thread_t *th)
2074 if (th->pending_interrupt_queue_checked) {
2078 if (rb_threadptr_pending_interrupt_empty_p(th)) {
2090 if (val != sym_immediate && val != sym_on_blocking && val != sym_never) {
2091 rb_raise(rb_eArgError,
"unknown mask signature");
2099 if (
RTEST(*maskp)) {
2100 if (!RB_TYPE_P(*maskp,
T_HASH)) {
2101 VALUE prev = *maskp;
2102 *maskp = rb_ident_hash_new();
2107 rb_hash_aset(*maskp, key, val);
2225rb_thread_s_handle_interrupt(
VALUE self,
VALUE mask_arg)
2231 enum ruby_tag_type state;
2234 rb_raise(rb_eArgError,
"block is needed.");
2237 mask_arg = rb_to_hash_type(mask_arg);
2239 if (
OBJ_FROZEN(mask_arg) && rb_hash_compare_by_id_p(mask_arg)) {
2245 if (UNDEF_P(mask)) {
2252 else if (RB_TYPE_P(mask,
T_HASH)) {
2256 rb_ary_push(th->pending_interrupt_mask_stack, mask);
2257 if (!rb_threadptr_pending_interrupt_empty_p(th)) {
2258 th->pending_interrupt_queue_checked = 0;
2259 RUBY_VM_SET_INTERRUPT(th->ec);
2262 EC_PUSH_TAG(th->ec);
2263 if ((state = EC_EXEC_TAG()) == TAG_NONE) {
2268 rb_ary_pop(th->pending_interrupt_mask_stack);
2269 if (!rb_threadptr_pending_interrupt_empty_p(th)) {
2270 th->pending_interrupt_queue_checked = 0;
2271 RUBY_VM_SET_INTERRUPT(th->ec);
2274 RUBY_VM_CHECK_INTS(th->ec);
2277 EC_JUMP_TAG(th->ec, state);
2294rb_thread_pending_interrupt_p(
int argc,
VALUE *argv,
VALUE target_thread)
2296 rb_thread_t *target_th = rb_thread_ptr(target_thread);
2298 if (!target_th->pending_interrupt_queue) {
2301 if (rb_threadptr_pending_interrupt_empty_p(target_th)) {
2305 VALUE err = argv[0];
2307 rb_raise(
rb_eTypeError,
"class or module required for rescue clause");
2309 return RBOOL(rb_threadptr_pending_interrupt_include_p(target_th, err));
2374rb_thread_s_pending_interrupt_p(
int argc,
VALUE *argv,
VALUE self)
2376 return rb_thread_pending_interrupt_p(argc, argv, GET_THREAD()->self);
2379NORETURN(
static void rb_threadptr_to_kill(
rb_thread_t *th));
2384 rb_threadptr_pending_interrupt_clear(th);
2385 th->status = THREAD_RUNNABLE;
2387 th->ec->errinfo =
INT2FIX(TAG_FATAL);
2388 EC_JUMP_TAG(th->ec, TAG_FATAL);
2399 interrupt = ec->interrupt_flag;
2400 old = ATOMIC_CAS(ec->interrupt_flag, interrupt, interrupt & ec->interrupt_mask);
2401 }
while (old != interrupt);
2402 return interrupt & (
rb_atomic_t)~ec->interrupt_mask;
2406rb_threadptr_execute_interrupts(
rb_thread_t *th,
int blocking_timing)
2409 int postponed_job_interrupt = 0;
2412 if (th->ec->raised_flag)
return ret;
2414 while ((interrupt = threadptr_get_interrupts(th)) != 0) {
2416 int timer_interrupt;
2417 int pending_interrupt;
2419 int terminate_interrupt;
2421 timer_interrupt = interrupt & TIMER_INTERRUPT_MASK;
2422 pending_interrupt = interrupt & PENDING_INTERRUPT_MASK;
2423 postponed_job_interrupt = interrupt & POSTPONED_JOB_INTERRUPT_MASK;
2424 trap_interrupt = interrupt & TRAP_INTERRUPT_MASK;
2425 terminate_interrupt = interrupt & TERMINATE_INTERRUPT_MASK;
2427 if (interrupt & VM_BARRIER_INTERRUPT_MASK) {
2432 if (postponed_job_interrupt) {
2433 rb_postponed_job_flush(th->vm);
2437 if (trap_interrupt && (th == th->vm->ractor.main_thread)) {
2438 enum rb_thread_status prev_status = th->status;
2440 th->status = THREAD_RUNNABLE;
2442 while ((sig = rb_get_next_signal()) != 0) {
2443 ret |= rb_signal_exec(th, sig);
2446 th->status = prev_status;
2450 if (pending_interrupt && threadptr_pending_interrupt_active_p(th)) {
2451 VALUE err = rb_threadptr_pending_interrupt_deque(th, blocking_timing ? INTERRUPT_ON_BLOCKING : INTERRUPT_NONE);
2452 RUBY_DEBUG_LOG(
"err:%"PRIdVALUE, err);
2458 else if (err == RUBY_FATAL_THREAD_KILLED ||
2459 err == RUBY_FATAL_THREAD_TERMINATED ||
2461 terminate_interrupt = 1;
2464 if (err == th->vm->special_exceptions[ruby_error_stream_closed]) {
2466 err = ruby_vm_special_exception_copy(err);
2469 if (th->status == THREAD_STOPPED ||
2470 th->status == THREAD_STOPPED_FOREVER)
2471 th->status = THREAD_RUNNABLE;
2476 if (terminate_interrupt) {
2477 rb_threadptr_to_kill(th);
2480 if (timer_interrupt) {
2481 uint32_t limits_us = TIME_QUANTUM_USEC;
2483 if (th->priority > 0)
2484 limits_us <<= th->priority;
2486 limits_us >>= -th->priority;
2488 if (th->status == THREAD_RUNNABLE)
2489 th->running_time_us += 10 * 1000;
2491 VM_ASSERT(th->ec->cfp);
2495 rb_thread_schedule_limits(limits_us);
2502rb_thread_execute_interrupts(
VALUE thval)
2504 rb_threadptr_execute_interrupts(rb_thread_ptr(thval), 1);
2510 rb_threadptr_interrupt(th);
2518 if (rb_threadptr_dead(target_th)) {
2526 exc = rb_make_exception(argc, argv);
2531 if (rb_threadptr_dead(target_th)) {
2535 rb_ec_setup_exception(GET_EC(), exc,
Qundef);
2536 rb_threadptr_pending_interrupt_enque(target_th, exc);
2537 rb_threadptr_interrupt(target_th);
2542rb_threadptr_signal_raise(
rb_thread_t *th,
int sig)
2548 rb_threadptr_raise(th->vm->ractor.main_thread, 2, argv);
2560 rb_threadptr_raise(th->vm->ractor.main_thread, 2, argv);
2566 if (ec->raised_flag & RAISED_EXCEPTION) {
2569 ec->raised_flag |= RAISED_EXCEPTION;
2576 if (!(ec->raised_flag & RAISED_EXCEPTION)) {
2579 ec->raised_flag &= ~RAISED_EXCEPTION;
2586 rb_vm_t *vm = GET_THREAD()->vm;
2588 ccan_list_head_init(&busy->pending_fd_users);
2594 ccan_list_for_each_safe(&vm->waiting_fds, wfd, next, wfd_node) {
2595 if (wfd->fd == fd) {
2599 ccan_list_del(&wfd->wfd_node);
2600 ccan_list_add(&busy->pending_fd_users, &wfd->wfd_node);
2603 err = th->vm->special_exceptions[ruby_error_stream_closed];
2604 rb_threadptr_pending_interrupt_enque(th, err);
2605 rb_threadptr_interrupt(th);
2610 has_any = !ccan_list_empty(&busy->pending_fd_users);
2612 wakeup_mutex =
Qnil;
2615 RBASIC_CLEAR_CLASS(wakeup_mutex);
2617 busy->wakeup_mutex = wakeup_mutex;
2631 if (!
RB_TEST(busy->wakeup_mutex)) {
2638 while (!ccan_list_empty(&busy->pending_fd_users)) {
2649 if (rb_notify_fd_close(fd, &busy)) {
2650 rb_notify_fd_close_wait(&busy);
2676thread_raise_m(
int argc,
VALUE *argv,
VALUE self)
2681 threadptr_check_pending_interrupt_queue(target_th);
2682 rb_threadptr_raise(target_th, argc, argv);
2685 if (current_th == target_th) {
2686 RUBY_VM_CHECK_INTS(target_th->ec);
2708 if (target_th->to_kill || target_th->status == THREAD_KILLED) {
2711 if (target_th == target_th->vm->ractor.main_thread) {
2715 RUBY_DEBUG_LOG(
"target_th:%u", rb_th_serial(target_th));
2717 if (target_th == GET_THREAD()) {
2719 rb_threadptr_to_kill(target_th);
2722 threadptr_check_pending_interrupt_queue(target_th);
2723 rb_threadptr_pending_interrupt_enque(target_th, RUBY_FATAL_THREAD_KILLED);
2724 rb_threadptr_interrupt(target_th);
2731rb_thread_to_be_killed(
VALUE thread)
2735 if (target_th->to_kill || target_th->status == THREAD_KILLED) {
2811 if (target_th->status == THREAD_KILLED)
return Qnil;
2813 rb_threadptr_ready(target_th);
2815 if (target_th->status == THREAD_STOPPED ||
2816 target_th->status == THREAD_STOPPED_FOREVER) {
2817 target_th->status = THREAD_RUNNABLE;
2859 "stopping only thread\n\tnote: use sleep to stop forever");
2892 return rb_ractor_thread_list();
2918 return rb_thread_list();
2924 return GET_THREAD()->self;
2937thread_s_current(
VALUE klass)
2945 return GET_RACTOR()->threads.main->self;
2956rb_thread_s_main(
VALUE klass)
2983rb_thread_s_abort_exc(
VALUE _)
2985 return RBOOL(GET_THREAD()->vm->thread_abort_on_exception);
3020rb_thread_s_abort_exc_set(
VALUE self,
VALUE val)
3022 GET_THREAD()->vm->thread_abort_on_exception =
RTEST(val);
3043rb_thread_abort_exc(
VALUE thread)
3045 return RBOOL(rb_thread_ptr(thread)->abort_on_exception);
3063rb_thread_abort_exc_set(
VALUE thread,
VALUE val)
3065 rb_thread_ptr(thread)->abort_on_exception =
RTEST(val);
3113rb_thread_s_report_exc(
VALUE _)
3115 return RBOOL(GET_THREAD()->vm->thread_report_on_exception);
3150rb_thread_s_report_exc_set(
VALUE self,
VALUE val)
3152 GET_THREAD()->vm->thread_report_on_exception =
RTEST(val);
3169rb_thread_s_ignore_deadlock(
VALUE _)
3171 return RBOOL(GET_THREAD()->vm->thread_ignore_deadlock);
3196rb_thread_s_ignore_deadlock_set(
VALUE self,
VALUE val)
3198 GET_THREAD()->vm->thread_ignore_deadlock =
RTEST(val);
3220rb_thread_report_exc(
VALUE thread)
3222 return RBOOL(rb_thread_ptr(thread)->report_on_exception);
3240rb_thread_report_exc_set(
VALUE thread,
VALUE val)
3242 rb_thread_ptr(thread)->report_on_exception =
RTEST(val);
3257rb_thread_group(
VALUE thread)
3259 return rb_thread_ptr(thread)->thgroup;
3265 switch (th->status) {
3266 case THREAD_RUNNABLE:
3267 return th->to_kill ?
"aborting" :
"run";
3268 case THREAD_STOPPED_FOREVER:
3269 if (detail)
return "sleep_forever";
3270 case THREAD_STOPPED:
3282 return th->status == THREAD_KILLED;
3318rb_thread_status(
VALUE thread)
3322 if (rb_threadptr_dead(target_th)) {
3323 if (!
NIL_P(target_th->ec->errinfo) &&
3324 !
FIXNUM_P(target_th->ec->errinfo)) {
3332 return rb_str_new2(thread_status_name(target_th, FALSE));
3352rb_thread_alive_p(
VALUE thread)
3354 return RBOOL(!thread_finished(rb_thread_ptr(thread)));
3372rb_thread_stop_p(
VALUE thread)
3376 if (rb_threadptr_dead(th)) {
3379 return RBOOL(th->status == THREAD_STOPPED || th->status == THREAD_STOPPED_FOREVER);
3390rb_thread_getname(
VALUE thread)
3392 return rb_thread_ptr(thread)->name;
3411 enc = rb_enc_get(name);
3412 if (!rb_enc_asciicompat(enc)) {
3413 rb_raise(rb_eArgError,
"ASCII incompatible encoding (%s)",
3416 name = rb_str_new_frozen(name);
3418 target_th->name = name;
3419 if (threadptr_initialized(target_th) && target_th->has_dedicated_nt) {
3420 native_set_another_thread_name(target_th->nt->thread_id, name);
3425#if USE_NATIVE_THREAD_NATIVE_THREAD_ID
3449rb_thread_native_thread_id(
VALUE thread)
3452 if (rb_threadptr_dead(target_th))
return Qnil;
3453 return native_thread_native_thread_id(target_th);
3456# define rb_thread_native_thread_id rb_f_notimplement
3467rb_thread_to_s(
VALUE thread)
3474 status = thread_status_name(target_th, TRUE);
3475 str = rb_sprintf(
"#<%"PRIsVALUE
":%p", cname, (
void *)thread);
3476 if (!
NIL_P(target_th->name)) {
3477 rb_str_catf(str,
"@%"PRIsVALUE, target_th->name);
3479 if ((loc = threadptr_invoke_proc_location(target_th)) !=
Qnil) {
3480 rb_str_catf(str,
" %"PRIsVALUE
":%"PRIsVALUE,
3483 rb_str_catf(str,
" %s>", status);
3489#define recursive_key id__recursive_key__
3494 if (
id == recursive_key) {
3495 return th->ec->local_storage_recursive_hash;
3499 struct rb_id_table *local_storage = th->ec->local_storage;
3501 if (local_storage != NULL && rb_id_table_lookup(local_storage,
id, &val)) {
3513 return threadptr_local_aref(rb_thread_ptr(thread),
id);
3580 if (!
id)
return Qnil;
3598rb_thread_fetch(
int argc,
VALUE *argv,
VALUE self)
3609 if (block_given && argc == 2) {
3610 rb_warn(
"block supersedes default value argument");
3615 if (
id == recursive_key) {
3616 return target_th->ec->local_storage_recursive_hash;
3618 else if (
id && target_th->ec->local_storage &&
3619 rb_id_table_lookup(target_th->ec->local_storage,
id, &val)) {
3622 else if (block_given) {
3625 else if (argc == 1) {
3626 rb_key_err_raise(rb_sprintf(
"key not found: %+"PRIsVALUE, key), self, key);
3636 if (
id == recursive_key) {
3637 th->ec->local_storage_recursive_hash = val;
3641 struct rb_id_table *local_storage = th->ec->local_storage;
3644 if (!local_storage)
return Qnil;
3645 rb_id_table_delete(local_storage,
id);
3649 if (local_storage == NULL) {
3650 th->ec->local_storage = local_storage = rb_id_table_create(0);
3652 rb_id_table_insert(local_storage,
id, val);
3665 return threadptr_local_aset(rb_thread_ptr(thread),
id, val);
3716rb_thread_variable_get(
VALUE thread,
VALUE key)
3720 if (LIKELY(!THREAD_LOCAL_STORAGE_INITIALISED_P(thread))) {
3723 locals = rb_thread_local_storage(thread);
3745 locals = rb_thread_local_storage(thread);
3767 struct rb_id_table *local_storage = rb_thread_ptr(self)->ec->local_storage;
3769 if (!
id || local_storage == NULL) {
3772 return RBOOL(rb_id_table_lookup(local_storage,
id, &val));
3775static enum rb_id_table_iterator_result
3776thread_keys_i(
ID key,
VALUE value,
void *ary)
3779 return ID_TABLE_CONTINUE;
3786 return rb_ractor_living_thread_num(GET_RACTOR()) == 1;
3804rb_thread_keys(
VALUE self)
3806 struct rb_id_table *local_storage = rb_thread_ptr(self)->ec->local_storage;
3807 VALUE ary = rb_ary_new();
3809 if (local_storage) {
3810 rb_id_table_foreach(local_storage, thread_keys_i, (
void *)ary);
3818 rb_ary_push(ary, key);
3840rb_thread_variables(
VALUE thread)
3846 if (LIKELY(!THREAD_LOCAL_STORAGE_INITIALISED_P(thread))) {
3849 locals = rb_thread_local_storage(thread);
3876 if (LIKELY(!THREAD_LOCAL_STORAGE_INITIALISED_P(thread))) {
3879 locals = rb_thread_local_storage(thread);
3900rb_thread_priority(
VALUE thread)
3902 return INT2NUM(rb_thread_ptr(thread)->priority);
3933rb_thread_priority_set(
VALUE thread,
VALUE prio)
3938#if USE_NATIVE_THREAD_PRIORITY
3939 target_th->priority =
NUM2INT(prio);
3940 native_thread_apply_priority(th);
3943 if (priority > RUBY_THREAD_PRIORITY_MAX) {
3944 priority = RUBY_THREAD_PRIORITY_MAX;
3946 else if (priority < RUBY_THREAD_PRIORITY_MIN) {
3947 priority = RUBY_THREAD_PRIORITY_MIN;
3949 target_th->priority = (int8_t)priority;
3951 return INT2NUM(target_th->priority);
3956#if defined(NFDBITS) && defined(HAVE_RB_FD_INIT)
3992 FD_ZERO(fds->
fdset);
3998 size_t size = howmany(
rb_fd_max(src), NFDBITS) *
sizeof(fd_mask);
4000 if (size <
sizeof(fd_set))
4001 size =
sizeof(fd_set);
4025 size_t m = howmany(n + 1, NFDBITS) *
sizeof(fd_mask);
4026 size_t o = howmany(fds->
maxfd, NFDBITS) *
sizeof(fd_mask);
4028 if (m <
sizeof(fd_set)) m =
sizeof(fd_set);
4029 if (o <
sizeof(fd_set)) o =
sizeof(fd_set);
4033 memset((
char *)fds->
fdset + o, 0, m - o);
4042 FD_SET(n, fds->
fdset);
4048 if (n >= fds->
maxfd)
return;
4049 FD_CLR(n, fds->
fdset);
4055 if (n >= fds->
maxfd)
return 0;
4056 return FD_ISSET(n, fds->
fdset) != 0;
4062 size_t size = howmany(max, NFDBITS) *
sizeof(fd_mask);
4064 if (size <
sizeof(fd_set)) size =
sizeof(fd_set);
4067 memcpy(dst->
fdset, src, size);
4073 size_t size = howmany(
rb_fd_max(src), NFDBITS) *
sizeof(fd_mask);
4075 if (size <
sizeof(fd_set))
4076 size =
sizeof(fd_set);
4085 fd_set *r = NULL, *w = NULL, *e = NULL;
4098 return select(n, r, w, e, timeout);
4101#define rb_fd_no_init(fds) ((void)((fds)->fdset = 0), (void)((fds)->maxfd = 0))
4108#define FD_ZERO(f) rb_fd_zero(f)
4109#define FD_SET(i, f) rb_fd_set((i), (f))
4110#define FD_CLR(i, f) rb_fd_clr((i), (f))
4111#define FD_ISSET(i, f) rb_fd_isset((i), (f))
4113#elif defined(_WIN32)
4118 set->
capa = FD_SETSIZE;
4120 FD_ZERO(set->
fdset);
4142 SOCKET s = rb_w32_get_osfhandle(fd);
4144 for (i = 0; i < set->
fdset->fd_count; i++) {
4145 if (set->
fdset->fd_array[i] == s) {
4149 if (set->
fdset->fd_count >= (
unsigned)set->
capa) {
4150 set->
capa = (set->
fdset->fd_count / FD_SETSIZE + 1) * FD_SETSIZE;
4152 rb_xrealloc_mul_add(
4153 set->
fdset, set->
capa,
sizeof(SOCKET),
sizeof(
unsigned int));
4155 set->
fdset->fd_array[set->
fdset->fd_count++] = s;
4163#define FD_ZERO(f) rb_fd_zero(f)
4164#define FD_SET(i, f) rb_fd_set((i), (f))
4165#define FD_CLR(i, f) rb_fd_clr((i), (f))
4166#define FD_ISSET(i, f) rb_fd_isset((i), (f))
4168#define rb_fd_no_init(fds) (void)((fds)->fdset = 0)
4172#ifndef rb_fd_no_init
4173#define rb_fd_no_init(fds) (void)(fds)
4177wait_retryable(
volatile int *result,
int errnum, rb_hrtime_t *rel, rb_hrtime_t end)
4186 if (rel && hrtime_update_expire(rel, end)) {
4193 else if (*result == 0) {
4196 return !hrtime_update_expire(rel, end);
4216select_set_free(
VALUE p)
4231 volatile int result = 0;
4233 rb_hrtime_t *to, rel, end = 0;
4235 timeout_prepare(&to, &rel, &end, set->timeout);
4236 volatile rb_hrtime_t endtime = end;
4237#define restore_fdset(dst, src) \
4238 ((dst) ? rb_fd_dup(dst, src) : (void)0)
4239#define do_select_update() \
4240 (restore_fdset(set->rset, &set->orig_rset), \
4241 restore_fdset(set->wset, &set->orig_wset), \
4242 restore_fdset(set->eset, &set->orig_eset), \
4248 BLOCKING_REGION(set->th, {
4251 if (!RUBY_VM_INTERRUPTED(set->th->ec)) {
4252 result = native_fd_select(set->max,
4253 set->rset, set->wset, set->eset,
4254 rb_hrtime2timeval(&tv, to), set->th);
4255 if (result < 0) lerrno = errno;
4257 }, ubf_select, set->th, TRUE);
4259 RUBY_VM_CHECK_INTS_BLOCKING(set->th->ec);
4260 }
while (wait_retryable(&result, lerrno, to, endtime) && do_select_update());
4266 return (
VALUE)result;
4275 set.th = GET_THREAD();
4276 RUBY_VM_CHECK_INTS_BLOCKING(set.th->ec);
4281 set.timeout = timeout;
4283 if (!set.rset && !set.wset && !set.eset) {
4292#define fd_init_copy(f) do { \
4294 rb_fd_resize(set.max - 1, set.f); \
4295 if (&set.orig_##f != set.f) { \
4296 rb_fd_init_copy(&set.orig_##f, set.f); \
4300 rb_fd_no_init(&set.orig_##f); \
4314#define POLLIN_SET (POLLRDNORM | POLLRDBAND | POLLIN | POLLHUP | POLLERR)
4315#define POLLOUT_SET (POLLWRBAND | POLLWRNORM | POLLOUT | POLLERR)
4316#define POLLEX_SET (POLLPRI)
4319# define POLLERR_SET (0)
4326rb_thread_wait_for_single_fd(
int fd,
int events,
struct timeval *timeout)
4328 struct pollfd fds[1];
4329 volatile int result = 0;
4333 volatile int lerrno;
4338 if (thread_io_wait_events(th, ec, fd, events, timeout, &wfd)) {
4342 thread_io_setup_wfd(th, fd, &wfd);
4344 EC_PUSH_TAG(wfd.th->ec);
4345 if ((state = EC_EXEC_TAG()) == TAG_NONE) {
4346 rb_hrtime_t *to, rel, end = 0;
4347 RUBY_VM_CHECK_INTS_BLOCKING(wfd.th->ec);
4348 timeout_prepare(&to, &rel, &end, timeout);
4349 volatile rb_hrtime_t endtime = end;
4351 fds[0].events = (short)events;
4357 BLOCKING_REGION(wfd.th, {
4360 if (!RUBY_VM_INTERRUPTED(wfd.th->ec)) {
4361 result = ppoll(fds, nfds, rb_hrtime2timespec(&ts, to), 0);
4362 if (result < 0) lerrno = errno;
4364 }, ubf_select, wfd.th, TRUE);
4366 RUBY_VM_CHECK_INTS_BLOCKING(wfd.th->ec);
4367 }
while (wait_retryable(&result, lerrno, to, endtime));
4371 thread_io_wake_pending_closer(&wfd);
4374 EC_JUMP_TAG(wfd.th->ec, state);
4382 if (fds[0].revents & POLLNVAL) {
4392 if (fds[0].revents & POLLIN_SET)
4393 result |= RB_WAITFD_IN;
4394 if (fds[0].revents & POLLOUT_SET)
4395 result |= RB_WAITFD_OUT;
4396 if (fds[0].revents & POLLEX_SET)
4397 result |= RB_WAITFD_PRI;
4400 if (fds[0].revents & POLLERR_SET)
4419select_single(
VALUE ptr)
4425 args->read, args->write, args->except, args->tv);
4427 args->as.error =
errno;
4430 if (args->read &&
rb_fd_isset(args->as.fd, args->read))
4432 if (args->write &&
rb_fd_isset(args->as.fd, args->write))
4434 if (args->except &&
rb_fd_isset(args->as.fd, args->except))
4441select_single_cleanup(
VALUE ptr)
4445 thread_io_wake_pending_closer(&args->wfd);
4466rb_thread_wait_for_single_fd(
int fd,
int events,
struct timeval *timeout)
4475 if (thread_io_wait_events(th, ec, fd, events, timeout, &args.wfd)) {
4480 args.read = (events & RB_WAITFD_IN) ? init_set_fd(fd, &rfds) : NULL;
4481 args.write = (events & RB_WAITFD_OUT) ? init_set_fd(fd, &wfds) : NULL;
4482 args.except = (events & RB_WAITFD_PRI) ? init_set_fd(fd, &efds) : NULL;
4486 args.wfd.busy = NULL;
4490 ccan_list_add(&args.wfd.th->vm->waiting_fds, &args.wfd.wfd_node);
4494 r = (int)
rb_ensure(select_single, ptr, select_single_cleanup, ptr);
4496 errno = args.as.error;
4506#ifdef USE_CONSERVATIVE_STACK_END
4508rb_gc_set_stack_end(
VALUE **stack_end_p)
4511 *stack_end_p = &stack_end;
4523 if (rb_signal_buff_size() > 0) {
4525 threadptr_trap_interrupt(mth);
4530async_bug_fd(
const char *mesg,
int errno_arg,
int fd)
4533 size_t n = strlcpy(buff, mesg,
sizeof(buff));
4534 if (n <
sizeof(buff)-3) {
4535 ruby_snprintf(buff+n,
sizeof(buff)-n,
"(%d)", fd);
4537 rb_async_bug_errno(buff, errno_arg);
4542consume_communication_pipe(
int fd)
4548 static char buff[1024];
4554 result = read(fd, buff,
sizeof(buff));
4556 RUBY_DEBUG_LOG(
"resultf:%d buff:%lu", (
int)result, (
unsigned long)buff[0]);
4558 RUBY_DEBUG_LOG(
"result:%d", (
int)result);
4562 if (USE_EVENTFD || result < (ssize_t)
sizeof(buff)) {
4566 else if (result == 0) {
4569 else if (result < 0) {
4575#if defined(EWOULDBLOCK) && EWOULDBLOCK != EAGAIN
4580 async_bug_fd(
"consume_communication_pipe: read", e, fd);
4587rb_thread_stop_timer_thread(
void)
4589 if (TIMER_THREAD_CREATED_P() && native_stop_timer_thread()) {
4590 native_reset_timer_thread();
4595rb_thread_reset_timer_thread(
void)
4597 native_reset_timer_thread();
4601rb_thread_start_timer_thread(
void)
4604 rb_thread_create_timer_thread();
4608clear_coverage_i(st_data_t key, st_data_t val, st_data_t dummy)
4616 if (GET_VM()->coverage_mode & COVERAGE_TARGET_ONESHOT_LINES) {
4617 rb_ary_clear(lines);
4638rb_clear_coverages(
void)
4640 VALUE coverages = rb_get_coverages();
4641 if (
RTEST(coverages)) {
4646#if defined(HAVE_WORKING_FORK)
4654 vm->ractor.main_ractor = r;
4655 vm->ractor.main_thread = th;
4656 r->threads.main = th;
4657 r->status_ = ractor_created;
4659 thread_sched_atfork(TH_SCHED(th));
4663 ccan_list_for_each(&vm->ractor.set, r, vmlr_node) {
4664 ccan_list_for_each(&r->threads.set, i, lt_node) {
4668 rb_vm_living_threads_init(vm);
4670 rb_ractor_atfork(vm, th);
4671 rb_vm_postponed_job_atfork();
4680 rb_ractor_sleeper_threads_clear(th->ractor);
4681 rb_clear_coverages();
4684 rb_thread_reset_timer_thread();
4685 rb_thread_start_timer_thread();
4687 VM_ASSERT(vm->ractor.blocking_cnt == 0);
4688 VM_ASSERT(vm->ractor.cnt == 1);
4694 if (th != current_th) {
4695 rb_mutex_abandon_keeping_mutexes(th);
4696 rb_mutex_abandon_locking_mutex(th);
4697 thread_cleanup_func(th, TRUE);
4706 rb_threadptr_pending_interrupt_clear(th);
4707 rb_thread_atfork_internal(th, terminate_atfork_i);
4708 th->join_list = NULL;
4709 rb_fiber_atfork(th);
4718 if (th != current_th) {
4719 thread_cleanup_func_before_exec(th);
4727 rb_thread_atfork_internal(th, terminate_atfork_before_exec_i);
4752 0, 0, RUBY_TYPED_FREE_IMMEDIATELY | RUBY_TYPED_WB_PROTECTED | RUBY_TYPED_EMBEDDABLE
4775thgroup_s_alloc(
VALUE klass)
4796thgroup_list(
VALUE group)
4798 VALUE ary = rb_ary_new();
4802 ccan_list_for_each(&r->threads.set, th, lt_node) {
4803 if (th->thgroup == group) {
4804 rb_ary_push(ary, th->self);
4828thgroup_enclose(
VALUE group)
4847thgroup_enclosed_p(
VALUE group)
4852 return RBOOL(data->enclosed);
4892 if (data->enclosed) {
4900 if (data->enclosed) {
4902 "can't move from the enclosed thread group");
4905 target_th->thgroup = group;
4913thread_shield_mark(
void *ptr)
4915 rb_gc_mark((
VALUE)ptr);
4920 {thread_shield_mark, 0, 0,},
4921 0, 0, RUBY_TYPED_FREE_IMMEDIATELY
4925thread_shield_alloc(
VALUE klass)
4930#define GetThreadShieldPtr(obj) ((VALUE)rb_check_typeddata((obj), &thread_shield_data_type))
4931#define THREAD_SHIELD_WAITING_MASK (((FL_USER19-1)&~(FL_USER0-1))|FL_USER19)
4932#define THREAD_SHIELD_WAITING_SHIFT (FL_USHIFT)
4933#define THREAD_SHIELD_WAITING_MAX (THREAD_SHIELD_WAITING_MASK>>THREAD_SHIELD_WAITING_SHIFT)
4934STATIC_ASSERT(THREAD_SHIELD_WAITING_MAX, THREAD_SHIELD_WAITING_MAX <= UINT_MAX);
4935static inline unsigned int
4936rb_thread_shield_waiting(
VALUE b)
4938 return ((
RBASIC(b)->flags&THREAD_SHIELD_WAITING_MASK)>>THREAD_SHIELD_WAITING_SHIFT);
4942rb_thread_shield_waiting_inc(
VALUE b)
4944 unsigned int w = rb_thread_shield_waiting(b);
4946 if (w > THREAD_SHIELD_WAITING_MAX)
4948 RBASIC(b)->flags &= ~THREAD_SHIELD_WAITING_MASK;
4949 RBASIC(b)->flags |= ((
VALUE)w << THREAD_SHIELD_WAITING_SHIFT);
4953rb_thread_shield_waiting_dec(
VALUE b)
4955 unsigned int w = rb_thread_shield_waiting(b);
4958 RBASIC(b)->flags &= ~THREAD_SHIELD_WAITING_MASK;
4959 RBASIC(b)->flags |= ((
VALUE)w << THREAD_SHIELD_WAITING_SHIFT);
4963rb_thread_shield_new(
void)
4965 VALUE thread_shield = thread_shield_alloc(rb_cThreadShield);
4967 return thread_shield;
4971rb_thread_shield_owned(
VALUE self)
4973 VALUE mutex = GetThreadShieldPtr(self);
4974 if (!mutex)
return false;
4978 return m->fiber == GET_EC()->fiber_ptr;
4990rb_thread_shield_wait(
VALUE self)
4992 VALUE mutex = GetThreadShieldPtr(self);
4995 if (!mutex)
return Qfalse;
4996 m = mutex_ptr(mutex);
4997 if (m->fiber == GET_EC()->fiber_ptr)
return Qnil;
4998 rb_thread_shield_waiting_inc(self);
5000 rb_thread_shield_waiting_dec(self);
5003 return rb_thread_shield_waiting(self) > 0 ?
Qnil :
Qfalse;
5007thread_shield_get_mutex(
VALUE self)
5009 VALUE mutex = GetThreadShieldPtr(self);
5011 rb_raise(
rb_eThreadError,
"destroyed thread shield - %p", (
void *)self);
5019rb_thread_shield_release(
VALUE self)
5021 VALUE mutex = thread_shield_get_mutex(self);
5023 return RBOOL(rb_thread_shield_waiting(self) > 0);
5030rb_thread_shield_destroy(
VALUE self)
5032 VALUE mutex = thread_shield_get_mutex(self);
5035 return RBOOL(rb_thread_shield_waiting(self) > 0);
5041 return th->ec->local_storage_recursive_hash;
5047 th->ec->local_storage_recursive_hash = hash;
5059recursive_list_access(
VALUE sym)
5062 VALUE hash = threadptr_recursive_hash(th);
5065 hash = rb_ident_hash_new();
5066 threadptr_recursive_hash_set(th, hash);
5070 list = rb_hash_aref(hash, sym);
5073 list = rb_ident_hash_new();
5074 rb_hash_aset(hash, sym, list);
5088#if SIZEOF_LONG == SIZEOF_VOIDP
5089 #define OBJ_ID_EQL(obj_id, other) ((obj_id) == (other))
5090#elif SIZEOF_LONG_LONG == SIZEOF_VOIDP
5091 #define OBJ_ID_EQL(obj_id, other) (RB_BIGNUM_TYPE_P((obj_id)) ? \
5092 rb_big_eql((obj_id), (other)) : ((obj_id) == (other)))
5095 VALUE pair_list = rb_hash_lookup2(list, obj,
Qundef);
5096 if (UNDEF_P(pair_list))
5098 if (paired_obj_id) {
5099 if (!RB_TYPE_P(pair_list,
T_HASH)) {
5100 if (!OBJ_ID_EQL(paired_obj_id, pair_list))
5104 if (
NIL_P(rb_hash_lookup(pair_list, paired_obj_id)))
5126 rb_hash_aset(list, obj,
Qtrue);
5128 else if (UNDEF_P(pair_list = rb_hash_lookup2(list, obj,
Qundef))) {
5129 rb_hash_aset(list, obj, paired_obj);
5132 if (!RB_TYPE_P(pair_list,
T_HASH)){
5133 VALUE other_paired_obj = pair_list;
5134 pair_list = rb_hash_new();
5135 rb_hash_aset(pair_list, other_paired_obj,
Qtrue);
5136 rb_hash_aset(list, obj, pair_list);
5138 rb_hash_aset(pair_list, paired_obj,
Qtrue);
5154 VALUE pair_list = rb_hash_lookup2(list, obj,
Qundef);
5155 if (UNDEF_P(pair_list)) {
5158 if (RB_TYPE_P(pair_list,
T_HASH)) {
5159 rb_hash_delete_entry(pair_list, paired_obj);
5165 rb_hash_delete_entry(list, obj);
5181 return (*p->func)(p->obj, p->arg, FALSE);
5202 p.list = recursive_list_access(sym);
5206 outermost = outer && !recursive_check(p.list,
ID2SYM(recursive_key), 0);
5208 if (recursive_check(p.list, p.obj, pairid)) {
5209 if (outer && !outermost) {
5212 return (*func)(obj, arg, TRUE);
5215 enum ruby_tag_type state;
5220 recursive_push(p.list,
ID2SYM(recursive_key), 0);
5221 recursive_push(p.list, p.obj, p.pairid);
5222 result = rb_catch_protect(p.list, exec_recursive_i, (
VALUE)&p, &state);
5223 if (!recursive_pop(p.list, p.obj, p.pairid))
goto invalid;
5224 if (!recursive_pop(p.list,
ID2SYM(recursive_key), 0))
goto invalid;
5225 if (state != TAG_NONE) EC_JUMP_TAG(GET_EC(), state);
5226 if (result == p.list) {
5227 result = (*func)(obj, arg, TRUE);
5232 recursive_push(p.list, p.obj, p.pairid);
5233 EC_PUSH_TAG(GET_EC());
5234 if ((state = EC_EXEC_TAG()) == TAG_NONE) {
5235 ret = (*func)(obj, arg, FALSE);
5238 if (!recursive_pop(p.list, p.obj, p.pairid)) {
5241 if (state != TAG_NONE) EC_JUMP_TAG(GET_EC(), state);
5250 "for %+"PRIsVALUE
" in %+"PRIsVALUE,
5274 return exec_recursive(func, obj, rb_memory_id(paired_obj), arg, 0,
rb_frame_last_func());
5292 return exec_recursive(func, obj, 0, arg, 1, mid);
5304 return exec_recursive(func, obj, rb_memory_id(paired_obj), arg, 1,
rb_frame_last_func());
5316rb_thread_backtrace_m(
int argc,
VALUE *argv,
VALUE thval)
5318 return rb_vm_thread_backtrace(argc, argv, thval);
5333rb_thread_backtrace_locations_m(
int argc,
VALUE *argv,
VALUE thval)
5335 return rb_vm_thread_backtrace_locations(argc, argv, thval);
5339Init_Thread_Mutex(
void)
5429 rb_vm_register_special_exception(ruby_error_stream_closed,
rb_eIOError,
5430 "stream closed in another thread");
5440 th->thgroup = th->ractor->thgroup_default =
rb_obj_alloc(cThGroup);
5451#ifdef HAVE_PTHREAD_NP_H
5452 VM_ASSERT(TH_SCHED(th)->running == th);
5458 th->pending_interrupt_queue = rb_ary_hidden_new(0);
5459 th->pending_interrupt_queue_checked = 0;
5460 th->pending_interrupt_mask_stack = rb_ary_hidden_new(0);
5464 rb_thread_create_timer_thread();
5480#ifdef NON_SCALAR_THREAD_ID
5481 #define thread_id_str(th) (NULL)
5483 #define thread_id_str(th) ((void *)(uintptr_t)(th)->nt->thread_id)
5492 rb_str_catf(msg,
"\n%d threads, %d sleeps current:%p main thread:%p\n",
5493 rb_ractor_living_thread_num(r), rb_ractor_sleeper_thread_num(r),
5494 (
void *)GET_THREAD(), (
void *)r->threads.main);
5496 ccan_list_for_each(&r->threads.set, th, lt_node) {
5497 rb_str_catf(msg,
"* %+"PRIsVALUE
"\n rb_thread_t:%p "
5499 th->self, (
void *)th, th->nt ? thread_id_str(th) :
"N/A", th->ec->interrupt_flag);
5501 if (th->locking_mutex) {
5502 rb_mutex_t *mutex = mutex_ptr(th->locking_mutex);
5503 rb_str_catf(msg,
" mutex:%p cond:%"PRIuSIZE,
5504 (
void *)mutex->fiber, rb_mutex_num_waiting(mutex));
5510 rb_str_catf(msg,
"\n depended by: tb_thread_id:%p", (
void *)list->thread);
5514 rb_str_catf(msg,
"\n ");
5515 rb_str_concat(msg, rb_ary_join(rb_ec_backtrace_str_ary(th->ec, 0, 0), sep));
5516 rb_str_catf(msg,
"\n");
5523 if (GET_THREAD()->vm->thread_ignore_deadlock)
return;
5525#ifdef RUBY_THREAD_PTHREAD_H
5526 if (r->threads.sched.readyq_cnt > 0)
return;
5529 int sleeper_num = rb_ractor_sleeper_thread_num(r);
5530 int ltnum = rb_ractor_living_thread_num(r);
5532 if (ltnum > sleeper_num)
return;
5533 if (ltnum < sleeper_num) rb_bug(
"sleeper must not be more than vm_living_thread_num(vm)");
5538 ccan_list_for_each(&r->threads.set, th, lt_node) {
5539 if (th->status != THREAD_STOPPED_FOREVER || RUBY_VM_INTERRUPTED(th->ec)) {
5542 else if (th->locking_mutex) {
5543 rb_mutex_t *mutex = mutex_ptr(th->locking_mutex);
5544 if (mutex->fiber == th->ec->fiber_ptr || (!mutex->fiber && !ccan_list_empty(&mutex->waitq))) {
5555 argv[1] =
rb_str_new2(
"No live threads left. Deadlock?");
5556 debug_deadlock_check(r, argv[1]);
5557 rb_ractor_sleeper_threads_dec(GET_RACTOR());
5558 rb_threadptr_raise(r->threads.main, 2, argv);
5565rb_vm_memsize_waiting_fds(
struct ccan_list_head *waiting_fds)
5570 ccan_list_for_each(waiting_fds, waitfd, wfd_node) {
5581 VALUE coverage = rb_iseq_coverage(cfp->iseq);
5589 if (GET_VM()->coverage_mode & COVERAGE_TARGET_ONESHOT_LINES) {
5590 rb_iseq_clear_event_flags(cfp->iseq, cfp->pc - ISEQ_BODY(cfp->iseq)->iseq_encoded - 1, RUBY_EVENT_COVERAGE_LINE);
5591 rb_ary_push(lines,
LONG2FIX(line + 1));
5611 VALUE coverage = rb_iseq_coverage(cfp->iseq);
5615 long pc = cfp->pc - ISEQ_BODY(cfp->iseq)->iseq_encoded - 1;
5630 VALUE path, beg_pos_lineno, beg_pos_column, end_pos_lineno, end_pos_column;
5632 if (!me->def)
return NULL;
5635 switch (me->def->type) {
5636 case VM_METHOD_TYPE_ISEQ: {
5639 path = rb_iseq_path(iseq);
5640 beg_pos_lineno =
INT2FIX(loc->code_location.beg_pos.lineno);
5641 beg_pos_column =
INT2FIX(loc->code_location.beg_pos.column);
5642 end_pos_lineno =
INT2FIX(loc->code_location.end_pos.lineno);
5643 end_pos_column =
INT2FIX(loc->code_location.end_pos.column);
5646 case VM_METHOD_TYPE_BMETHOD: {
5647 const rb_iseq_t *iseq = rb_proc_get_iseq(me->def->body.bmethod.proc, 0);
5650 rb_iseq_check(iseq);
5651 path = rb_iseq_path(iseq);
5652 loc = &ISEQ_BODY(iseq)->location;
5653 beg_pos_lineno =
INT2FIX(loc->code_location.beg_pos.lineno);
5654 beg_pos_column =
INT2FIX(loc->code_location.beg_pos.column);
5655 end_pos_lineno =
INT2FIX(loc->code_location.end_pos.lineno);
5656 end_pos_column =
INT2FIX(loc->code_location.end_pos.column);
5661 case VM_METHOD_TYPE_ALIAS:
5662 me = me->def->body.alias.original_me;
5664 case VM_METHOD_TYPE_REFINED:
5665 me = me->def->body.refined.orig_me;
5666 if (!me)
return NULL;
5673 if (RB_TYPE_P(path,
T_ARRAY)) {
5674 path = rb_ary_entry(path, 1);
5675 if (!RB_TYPE_P(path,
T_STRING))
return NULL;
5677 if (resolved_location) {
5678 resolved_location[0] = path;
5679 resolved_location[1] = beg_pos_lineno;
5680 resolved_location[2] = beg_pos_column;
5681 resolved_location[3] = end_pos_lineno;
5682 resolved_location[4] = end_pos_column;
5696 me = rb_resolve_me_location(me, 0);
5699 rcount = rb_hash_aref(me2counter, (
VALUE) me);
5707rb_get_coverages(
void)
5709 return GET_VM()->coverages;
5713rb_get_coverage_mode(
void)
5715 return GET_VM()->coverage_mode;
5719rb_set_coverages(
VALUE coverages,
int mode,
VALUE me2counter)
5721 GET_VM()->coverages = coverages;
5722 GET_VM()->me2counter = me2counter;
5723 GET_VM()->coverage_mode = mode;
5727rb_resume_coverages(
void)
5729 int mode = GET_VM()->coverage_mode;
5730 VALUE me2counter = GET_VM()->me2counter;
5731 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);
5732 if (mode & COVERAGE_TARGET_BRANCHES) {
5733 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);
5735 if (mode & COVERAGE_TARGET_METHODS) {
5741rb_suspend_coverages(
void)
5744 if (GET_VM()->coverage_mode & COVERAGE_TARGET_BRANCHES) {
5747 if (GET_VM()->coverage_mode & COVERAGE_TARGET_METHODS) {
5754rb_reset_coverages(
void)
5756 rb_clear_coverages();
5757 rb_iseq_remove_coverage_all();
5758 GET_VM()->coverages =
Qfalse;
5762rb_default_coverage(
int n)
5764 VALUE coverage = rb_ary_hidden_new_fill(3);
5766 int mode = GET_VM()->coverage_mode;
5768 if (mode & COVERAGE_TARGET_LINES) {
5769 lines = n > 0 ? rb_ary_hidden_new_fill(n) : rb_ary_hidden_new(0);
5771 RARRAY_ASET(coverage, COVERAGE_INDEX_LINES, lines);
5773 if (mode & COVERAGE_TARGET_BRANCHES) {
5774 branches = rb_ary_hidden_new_fill(2);
5796 VALUE structure = rb_hash_new();
5797 rb_obj_hide(structure);
5802 RARRAY_ASET(coverage, COVERAGE_INDEX_BRANCHES, branches);
5808uninterruptible_exit(
VALUE v)
5811 rb_ary_pop(cur_th->pending_interrupt_mask_stack);
5813 cur_th->pending_interrupt_queue_checked = 0;
5814 if (!rb_threadptr_pending_interrupt_empty_p(cur_th)) {
5815 RUBY_VM_SET_INTERRUPT(cur_th->ec);
5823 VALUE interrupt_mask = rb_ident_hash_new();
5826 rb_hash_aset(interrupt_mask, rb_cObject, sym_never);
5828 rb_ary_push(cur_th->pending_interrupt_mask_stack, interrupt_mask);
5832 RUBY_VM_CHECK_INTS(cur_th->ec);
5839 VM_ASSERT(th->specific_storage == NULL);
5841 if (UNLIKELY(specific_key_count > 0)) {
5842 th->specific_storage =
ZALLOC_N(
void *, RB_INTERNAL_THREAD_SPECIFIC_KEY_MAX);
5846rb_internal_thread_specific_key_t
5851 if (specific_key_count == 0 && vm->ractor.cnt > 1) {
5852 rb_raise(
rb_eThreadError,
"The first rb_internal_thread_specific_key_create() is called with multiple ractors");
5854 else if (specific_key_count > RB_INTERNAL_THREAD_SPECIFIC_KEY_MAX) {
5855 rb_raise(
rb_eThreadError,
"rb_internal_thread_specific_key_create() is called more than %d times", RB_INTERNAL_THREAD_SPECIFIC_KEY_MAX);
5858 rb_internal_thread_specific_key_t key = specific_key_count++;
5865 ccan_list_for_each(&cr->threads.set, th, lt_node) {
5866 thread_specific_storage_alloc(th);
5879 VM_ASSERT(rb_thread_ptr(thread_val) == th);
5880 VM_ASSERT(key < RB_INTERNAL_THREAD_SPECIFIC_KEY_MAX);
5881 VM_ASSERT(th->specific_storage);
5883 return th->specific_storage[key];
5892 VM_ASSERT(rb_thread_ptr(thread_val) == th);
5893 VM_ASSERT(key < RB_INTERNAL_THREAD_SPECIFIC_KEY_MAX);
5894 VM_ASSERT(th->specific_storage);
5896 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_method(klass, mid, func, arity)
Defines klass#mid.
#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.
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_RAW
Old name of RB_OBJ_FREEZE_RAW.
#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.
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_eException
Mother of all exceptions.
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_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 int rb_check_arity(int argc, int min, int max)
Ensures that the passed integer is in the passed range.
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_concat(VALUE dst, VALUE src)
Identical to rb_str_append(), except it also accepts an integer as a codepoint.
#define rb_str_cat_cstr(buf, str)
Identical to rb_str_cat(), except it assumes the passed pointer is a pointer to a C string.
#define rb_str_new_cstr(str)
Identical to rb_str_new, 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.
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.
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.
#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_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_with_gvl(void *(*func)(void *), void *data1)
(Re-)acquires the GVL.
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.
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.
#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.
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.
static fd_set * rb_fd_ptr(const rb_fdset_t *f)
Raw pointer to fd_set.
#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.
VALUE rb_thread_create(type *q, void *w)
Creates a rb_cThread instance.
void rb_hash_foreach(VALUE q, int_type *w, VALUE e)
Iteration over the given hash.
VALUE rb_ensure(type *q, VALUE w, type *e, VALUE r)
An equivalent of ensure clause.
#define rb_fd_isset
Queries if the given fd is in the rb_fdset_t.
#define rb_fd_select
Waits for multiple file descriptors at once.
#define rb_fd_init
Initialises the :given :rb_fdset_t.
#define rb_fd_set
Sets the given fd to the rb_fdset_t.
#define rb_fd_zero
Clears the given rb_fdset_t.
#define rb_fd_clr
Unsets the given fd from 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...
#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.
#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_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.