Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with HTTPS or Subversion.

Download ZIP
branch: rurban/fix-gc-…
Fetching contributors…

Cannot retrieve contributors at this time

778 lines (563 sloc) 21.232 kb
/*
Copyright (C) 2007-2011, Parrot Foundation.
=head1 NAME
src/scheduler.c - The core routines for the concurrency scheduler
=head1 DESCRIPTION
Each interpreter has a concurrency scheduler element in its core struct. The
scheduler is responsible for receiving, dispatching, and monitoring events,
exceptions, async I/O, and concurrent tasks (threads).
=cut
*/
#include "parrot/parrot.h"
#include "parrot/extend.h"
#include "parrot/scheduler_private.h"
#include "parrot/runcore_api.h"
#include "parrot/alarm.h"
#include "parrot/scheduler.h"
#include "parrot/thread.h"
#include "pmc/pmc_scheduler.h"
#include "pmc/pmc_task.h"
#include "pmc/pmc_timer.h"
#include "pmc/pmc_alarm.h"
#include "pmc/pmc_pmclist.h"
#include "pmc/pmc_continuation.h"
#include "scheduler.str"
/* HEADERIZER HFILE: include/parrot/scheduler.h */
/* HEADERIZER BEGIN: static */
/* Don't modify between HEADERIZER BEGIN / HEADERIZER END. Your changes will be lost. */
static int Parrot_cx_preemption_enabled(PARROT_INTERP)
__attribute__nonnull__(1);
#define ASSERT_ARGS_Parrot_cx_preemption_enabled __attribute__unused__ int _ASSERT_ARGS_CHECK = (\
PARROT_ASSERT_ARG(interp))
/* Don't modify between HEADERIZER BEGIN / HEADERIZER END. Your changes will be lost. */
/* HEADERIZER END: static */
/*
=head2 Scheduler Interface Functions
Functions to interface with the concurrency scheduler.
=over 4
=item C<void Parrot_cx_init_scheduler(PARROT_INTERP)>
Initialize the concurrency scheduler for the interpreter.
=cut
*/
void
Parrot_cx_init_scheduler(PARROT_INTERP)
{
ASSERT_ARGS(Parrot_cx_init_scheduler)
interp->quantum_done = Parrot_floatval_time() + PARROT_TASK_SWITCH_QUANTUM;
interp->scheduler = Parrot_pmc_new(interp, enum_class_Scheduler);
if (!interp->parent_interpreter) { /* only run once, for the master interp */
Parrot_alarm_init();
Parrot_thread_init_threads_array(interp);
Parrot_thread_insert_thread(interp, interp, 0);
}
}
/*
=item C<void Parrot_cx_begin_execution(PARROT_INTERP, PMC *main, PMC *argv)>
Construct the main task, add it to the task queue, and then execute tasks
until the task queue becomes empty.
=cut
*/
PARROT_EXPORT
void
Parrot_cx_begin_execution(PARROT_INTERP, ARGIN(PMC *main), ARGIN(PMC *argv))
{
ASSERT_ARGS(Parrot_cx_begin_execution)
PMC * const scheduler = interp->scheduler;
Parrot_Scheduler_attributes * const sched = PARROT_SCHEDULER(scheduler);
PMC * const main_task = Parrot_pmc_new(interp, enum_class_Task);
Parrot_Task_attributes * const tdata = PARROT_TASK(main_task);
INTVAL task_count;
tdata->code = main;
tdata->data = argv;
PARROT_GC_WRITE_BARRIER(interp, main_task);
SCHEDULER_enable_scheduler_SET(scheduler);
Parrot_cx_schedule_immediate(interp, main_task);
Parrot_cx_outer_runloop(interp);
task_count = VTABLE_get_integer(interp, sched->all_tasks);
if (task_count > 0)
Parrot_warn(interp, PARROT_WARNINGS_ALL_FLAG,
"Exiting with %d active tasks.\n", task_count);
}
/*
=item C<void Parrot_cx_outer_runloop(PARROT_INTERP)>
This is the core loop performed by each active OS thread. If it's the
thread that needs to be running, it invokes the Scheduler to pick a
task.
=cut
*/
void
Parrot_cx_outer_runloop(PARROT_INTERP)
{
ASSERT_ARGS(Parrot_cx_outer_runloop)
PMC * const scheduler = interp->scheduler;
Parrot_Scheduler_attributes * const sched = PARROT_SCHEDULER(scheduler);
INTVAL alarm_count, foreign_count, i;
/* Main loop. Continue to loop so long as we have any tasks, any alarms,
or any foreign tasks to execute. If we have none of these things, exit. */
do {
/* If we have tasks in the scheduler, run them in a loop until there
are no more. */
while (VTABLE_get_integer(interp, scheduler) > 0) {
/* there can be no active runloops at this point, so it should be save
* to start counting at 0 again. This way the continuation in the next
* task will find a runloop with id 1 when encountering an exception */
interp->current_runloop_level = 0;
reset_runloop_id_counter(interp);
Parrot_cx_next_task(interp, scheduler);
/* add expired alarms to the task queue */
Parrot_cx_check_alarms(interp, interp->scheduler);
}
/* Loop over all foreign tasks in the scheduler. If the foreign task
is killed, remove it from the scheduler. */
foreign_count = VTABLE_get_integer(interp, sched->foreign_tasks);
for (i = 0; i < foreign_count; i++) {
PMC * const task = VTABLE_get_pmc_keyed_int(interp, sched->foreign_tasks, i);
LOCK(PARROT_TASK(task)->waiters_lock);
if (PARROT_TASK(task)->killed) {
VTABLE_delete_keyed_int(interp, sched->foreign_tasks, i);
i--;
foreign_count--;
}
UNLOCK(PARROT_TASK(task)->waiters_lock);
}
/* If we have no scheduled tasks, but we do have an alarm or foreign
task, we can wait for one of those before we start executing things
again. */
alarm_count = VTABLE_get_integer(interp, sched->alarms);
if (VTABLE_get_integer(interp, scheduler) == 0 && (alarm_count > 0 || foreign_count > 0)) {
/* Nothing to do except to wait for the next alarm to expire */
Parrot_thread_wait_for_notification(interp);
Parrot_cx_check_alarms(interp, interp->scheduler);
}
} while (alarm_count || foreign_count || VTABLE_get_integer(interp, scheduler) > 0);
}
/*
=item C<void Parrot_cx_set_scheduler_alarm(PARROT_INTERP)>
Set the task switch alarm for the scheduler.
=cut
*/
void
Parrot_cx_set_scheduler_alarm(PARROT_INTERP)
{
ASSERT_ARGS(Parrot_cx_set_scheduler_alarm)
const FLOATVAL time_now = Parrot_floatval_time();
interp->quantum_done = time_now + PARROT_TASK_SWITCH_QUANTUM;
Parrot_alarm_set(interp->quantum_done);
}
/*
=item C<void Parrot_cx_next_task(PARROT_INTERP, PMC *scheduler)>
Run the task at the head of the task queue until it ends or is
pre-empted.
=cut
*/
void
Parrot_cx_next_task(PARROT_INTERP, ARGIN(PMC *scheduler))
{
ASSERT_ARGS(Parrot_cx_next_task)
PMC * const task = VTABLE_shift_pmc(interp, scheduler);
interp->cur_task = task;
if (!VTABLE_isa(interp, task, CONST_STRING(interp, "Task")))
Parrot_ex_throw_from_c_noargs(interp, EXCEPTION_INVALID_OPERATION,
"Found a non-Task in the task queue");
/* If we have no tasks in the queue, we can disable task preemption and
save ourselves a few cycles. */
if (VTABLE_get_integer(interp, scheduler) > 0)
Parrot_cx_enable_preemption(interp);
else
Parrot_cx_disable_preemption(interp);
Parrot_ext_call(interp, task, "->");
}
/*
=item C<opcode_t* Parrot_cx_check_scheduler(PARROT_INTERP, opcode_t *next)>
Does the scheduler need to wake up and do anything? If so, do that now.
=cut
*/
PARROT_CANNOT_RETURN_NULL
opcode_t*
Parrot_cx_check_scheduler(PARROT_INTERP, ARGIN(opcode_t *next))
{
ASSERT_ARGS(Parrot_cx_check_scheduler)
PMC * const scheduler = interp->scheduler;
/* If we have any outstanding alarms, or if we have been requested to
wake up, run the scheduler. */
if (Parrot_alarm_check(&(interp->last_alarm))
|| SCHEDULER_wake_requested_TEST(scheduler)) {
SCHEDULER_wake_requested_CLEAR(scheduler);
return Parrot_cx_run_scheduler(interp, scheduler, next);
}
return next;
}
/*
=item C<opcode_t* Parrot_cx_run_scheduler(PARROT_INTERP, PMC *scheduler,
opcode_t *next)>
Checks to see if any tasks need to be scheduled or if the current task
needs to be pre-empted.
=cut
*/
PARROT_CANNOT_RETURN_NULL
PARROT_EXPORT
opcode_t*
Parrot_cx_run_scheduler(PARROT_INTERP, ARGIN(PMC *scheduler), ARGIN(opcode_t *next))
{
ASSERT_ARGS(Parrot_cx_run_scheduler)
Parrot_cx_check_alarms(interp, scheduler);
Parrot_cx_check_quantum(interp, scheduler);
if (SCHEDULER_resched_requested_TEST(scheduler)) {
SCHEDULER_resched_requested_CLEAR(scheduler);
/* A task switch will only work in the outer runloop of a fully
booted Parrot. In a Parrot that hasn't called begin_execution,
or in a nested runloop, we silently ignore task switches. */
if (SCHEDULER_enable_scheduler_TEST(scheduler) && interp->current_runloop_level <= 1)
return Parrot_cx_preempt_task(interp, scheduler, next);
}
/* Some alarm seems to have fired, but not the scheduler's.
* Re-set the scheduler alarm */
if (Parrot_cx_preemption_enabled(interp))
Parrot_alarm_set(interp->quantum_done);
return next;
}
/*
=item C<void Parrot_cx_check_quantum(PARROT_INTERP, PMC *scheduler)>
If the quantum has expired, schedule the next task.
=cut
*/
void
Parrot_cx_check_quantum(PARROT_INTERP, ARGIN(PMC *scheduler))
{
ASSERT_ARGS(Parrot_cx_check_quantum)
/* If we are using preemption, check the current time and possibly
schedule the next preemption */
if (Parrot_cx_preemption_enabled(interp)) {
const FLOATVAL time_now = Parrot_floatval_time();
if (time_now >= interp->quantum_done)
SCHEDULER_resched_requested_SET(scheduler);
}
}
/*
=item C<PMC* Parrot_cx_stop_task(PARROT_INTERP, opcode_t *next)>
Stop the current task and pack it up into a PMC what can be used to resume later.
=cut
*/
PARROT_EXPORT
PARROT_CANNOT_RETURN_NULL
PMC*
Parrot_cx_stop_task(PARROT_INTERP, ARGIN(opcode_t *next))
{
ASSERT_ARGS(Parrot_cx_stop_task)
PMC * const task = Parrot_cx_current_task(interp);
Parrot_Task_attributes * const tdata = PARROT_TASK(task);
PMC * const cont = Parrot_pmc_new(interp, enum_class_Continuation);
VTABLE_set_pointer(interp, cont, next);
/* TODO: This check seems expensive. Do we need to have this active at all
times, or can we make this conditional on NDEBUG? */
if (PMC_IS_NULL(task) || !VTABLE_isa(interp, task, CONST_STRING(interp, "Task")))
Parrot_ex_throw_from_c_noargs(interp, EXCEPTION_INVALID_OPERATION,
"Attempt to stop invalid interp->current_task");
tdata->code = cont;
PARROT_GC_WRITE_BARRIER(interp, task);
TASK_in_preempt_SET(task);
return task;
}
/*
=item C<opcode_t* Parrot_cx_preempt_task(PARROT_INTERP, PMC *scheduler, opcode_t
*next)>
Pre-empt the current task. It goes on the foot of the task queue,
and then we jump all the way back to the task scheduling loop.
=cut
*/
PARROT_CAN_RETURN_NULL
opcode_t*
Parrot_cx_preempt_task(PARROT_INTERP, ARGIN(PMC *scheduler), ARGIN(opcode_t *next))
{
ASSERT_ARGS(Parrot_cx_preempt_task)
PMC * const task = Parrot_cx_stop_task(interp, next);
VTABLE_push_pmc(interp, scheduler, task);
return (opcode_t*)NULL;
}
/*
=item C<void Parrot_cx_runloop_wake(PARROT_INTERP, PMC *scheduler)>
Wake a sleeping scheduler runloop (generally called when new tasks are added to
the scheduler's task list).
=cut
*/
void
Parrot_cx_runloop_wake(PARROT_INTERP, ARGIN(PMC *scheduler))
{
ASSERT_ARGS(Parrot_cx_runloop_wake)
Parrot_runcore_enable_event_checking(interp);
SCHEDULER_wake_requested_SET(scheduler);
}
/*
=item C<void Parrot_cx_schedule_task(PARROT_INTERP, PMC *task_or_sub)>
Add a task to to the task queue for execution.
Probably cannot be called across interpreters/threads, must instead be
called from within the interpreter's runloop.
=cut
*/
PARROT_EXPORT
void
Parrot_cx_schedule_task(PARROT_INTERP, ARGIN(PMC *task_or_sub))
{
ASSERT_ARGS(Parrot_cx_schedule_task)
PMC * task = PMCNULL;
int index;
if (!interp->scheduler)
Parrot_ex_throw_from_c_noargs(interp, EXCEPTION_INVALID_OPERATION,
"Scheduler was not initialized for this interpreter");
/* TODO: Can we do anything less expensive than an ISA check here? */
if (VTABLE_isa(interp, task_or_sub, CONST_STRING(interp, "Task")))
task = task_or_sub;
else if (VTABLE_isa(interp, task_or_sub, CONST_STRING(interp, "Sub"))) {
Parrot_Task_attributes *tdata;
task = Parrot_pmc_new(interp, enum_class_Task);
tdata = PARROT_TASK(task);
tdata->code = task_or_sub;
PARROT_GC_WRITE_BARRIER(interp, task);
}
else
Parrot_ex_throw_from_c_noargs(interp, EXCEPTION_INVALID_OPERATION,
"Can only schedule Tasks and Subs");
#ifdef PARROT_HAS_THREADS
/* Search for a thread that is free. If we have a free thread, schedule
the task there. Otherwise, find the thread with the fewest tasks in its
queue and schedule it there. */
index = Parrot_thread_get_free_threads_array_index(NULL);
if (index > -1) { /* start a new thread */
PMC * const thread = Parrot_thread_create(interp,
enum_class_ParrotInterpreter,
PARROT_CLONE_DEFAULT);
Interp * const thread_interp = (Interp *)VTABLE_get_pointer(interp, thread);
Parrot_thread_schedule_task(interp, thread_interp, task);
Parrot_thread_insert_thread(interp, thread_interp, index);
Parrot_thread_run(interp, thread, task, NULL);
}
else {
/* find the thread with the fewest tasks */
Interp ** const threads_array = Parrot_thread_get_threads_array(interp);
int numthreads = Parrot_get_num_threads(interp);
Interp * candidate = NULL;
int i, min_tasks = INT_MAX;
for (i = 1; i < numthreads; i++)
if (threads_array[i]) {
int const tasks = VTABLE_get_integer(threads_array[i], threads_array[i]->scheduler);
if (tasks < min_tasks) {
min_tasks = tasks;
candidate = threads_array[i];
}
}
if (candidate == NULL)
Parrot_ex_throw_from_c_noargs(interp, EXCEPTION_INVALID_OPERATION,
"Could not find a free thread");
Parrot_thread_schedule_task(interp, candidate, task);
Parrot_thread_notify_thread(candidate);
/* going from single to multi tasking? */
if (VTABLE_get_integer(interp, interp->scheduler) == 1)
Parrot_cx_enable_preemption(interp);
}
#else
/* If we don't have threads, we still have tasks and basic preemption. Add
the task to the queue. */
VTABLE_push_pmc(interp, interp->scheduler, task);
/* going from single to multi tasking? */
if (VTABLE_get_integer(interp, interp->scheduler) == 1)
Parrot_cx_enable_preemption(interp);
#endif
}
/*
=item C<void Parrot_cx_schedule_immediate(PARROT_INTERP, PMC *task_or_sub)>
Add a task to the task queue for immediate execution.
=cut
*/
PARROT_EXPORT
void
Parrot_cx_schedule_immediate(PARROT_INTERP, ARGIN(PMC *task_or_sub))
{
ASSERT_ARGS(Parrot_cx_schedule_immediate)
PMC *task;
/* TODO: Can we do something less expensive than ISA? */
if (VTABLE_isa(interp, task_or_sub, CONST_STRING(interp, "Task")))
task = task_or_sub;
else if (VTABLE_isa(interp, task_or_sub, CONST_STRING(interp, "Sub"))) {
Parrot_Task_attributes *tdata;
task = Parrot_pmc_new(interp, enum_class_Task);
tdata = PARROT_TASK(task);
tdata->code = task_or_sub;
PARROT_GC_WRITE_BARRIER(interp, task);
}
else
Parrot_ex_throw_from_c_noargs(interp, EXCEPTION_INVALID_OPERATION,
"Can only schedule Tasks and Subs");
VTABLE_unshift_pmc(interp, interp->scheduler, task);
SCHEDULER_wake_requested_SET(interp->scheduler);
SCHEDULER_resched_requested_SET(interp->scheduler);
Parrot_thread_notify_thread(interp);
}
/*
=item C<PMC* Parrot_cx_current_task(PARROT_INTERP)>
Returns the task that is currently running.
=cut
*/
PARROT_CANNOT_RETURN_NULL
PARROT_PURE_FUNCTION
PMC*
Parrot_cx_current_task(PARROT_INTERP)
{
ASSERT_ARGS(Parrot_cx_current_task)
return interp->cur_task;
}
/*
=back
=head2 Scheduler Message Interface Functions
Functions that are used to interface with the message queue in the concurrency
scheduler.
=over 4
=item C<void Parrot_cx_send_message(PARROT_INTERP, STRING *messagetype, PMC
*payload)>
Send a message to a scheduler in a different interpreter/thread.
=cut
*/
PARROT_EXPORT
void
Parrot_cx_send_message(PARROT_INTERP, ARGIN(STRING *messagetype), ARGIN(SHIM(PMC *payload)))
{
ASSERT_ARGS(Parrot_cx_send_message)
if (interp->scheduler) {
Parrot_Scheduler_attributes * const sched_struct =
PARROT_SCHEDULER(interp->scheduler);
PMC * const message = Parrot_pmc_new(interp, enum_class_SchedulerMessage);
VTABLE_set_string_native(interp, message, messagetype);
VTABLE_push_pmc(interp, sched_struct->messages, message);
Parrot_cx_runloop_wake(interp, interp->scheduler);
}
}
/*
=item C<void Parrot_cx_schedule_alarm(PARROT_INTERP, PMC *alarm)>
Schedule an alarm.
=cut
*/
void
Parrot_cx_schedule_alarm(PARROT_INTERP, ARGIN(PMC *alarm))
{
ASSERT_ARGS(Parrot_cx_schedule_alarm)
Parrot_Scheduler_attributes * const sched = PARROT_SCHEDULER(interp->scheduler);
FLOATVAL alarm_time = VTABLE_get_number(interp, alarm);
Parrot_alarm_set(alarm_time);
/* Insert new alarm at correct (ordered by time) position in array. */
Parrot_pmc_list_insert_by_number(interp, sched->alarms, alarm);
}
/*
=item C<void Parrot_cx_check_alarms(PARROT_INTERP, PMC *scheduler)>
Add the subs attached to any expired alarms to the task queue.
=cut
*/
PARROT_EXPORT
void
Parrot_cx_check_alarms(PARROT_INTERP, ARGIN(PMC *scheduler))
{
ASSERT_ARGS(Parrot_cx_check_alarms)
Parrot_Scheduler_attributes * const sched = PARROT_SCHEDULER(scheduler);
INTVAL alarm_count = VTABLE_get_integer(interp, sched->alarms);
const FLOATVAL now_time = Parrot_floatval_time();
/* Loop over all alarms, searching for expired ones. Since they are ordered
by execution time, as soon as we find one that is not expired we can
exit the loop. For each alarm that is expired, add the associated
Sub/Task to the queue. */
while (alarm_count) {
PMC * const alarm = VTABLE_shift_pmc(interp, sched->alarms);
const FLOATVAL alarm_time = VTABLE_get_number(interp, alarm);
if (alarm_time < now_time) {
Parrot_Alarm_attributes * const data = PARROT_ALARM(alarm);
Parrot_cx_schedule_immediate(interp, data->alarm_task);
}
else {
Parrot_alarm_set(alarm_time);
VTABLE_unshift_pmc(interp, sched->alarms, alarm);
break;
}
alarm_count--;
}
}
/*
=back
=head2 Opcode Functions
Functions that are called from within opcodes, that take and return an
opcode_t* to allow for changing the code flow.
=over 4
=item C<opcode_t * Parrot_cx_schedule_sleep(PARROT_INTERP, FLOATVAL time,
opcode_t *next)>
Add a sleep timer to the scheduler. This function is called by the C<sleep>
opcode.
=cut
*/
PARROT_EXPORT
PARROT_WARN_UNUSED_RESULT
PARROT_CAN_RETURN_NULL
opcode_t *
Parrot_cx_schedule_sleep(PARROT_INTERP, FLOATVAL time, ARGIN_NULLOK(opcode_t *next))
{
ASSERT_ARGS(Parrot_cx_schedule_sleep)
const FLOATVAL now_time = Parrot_floatval_time();
const FLOATVAL done_time = now_time + time;
PMC * const alarm = Parrot_pmc_new(interp, enum_class_Alarm);
Parrot_Alarm_attributes * const adata = PARROT_ALARM(alarm);
PMC * const task = Parrot_cx_stop_task(interp, next);
adata->alarm_time = done_time;
PARROT_ASSERT_INTERP(task, interp);
adata->alarm_task = task;
PARROT_GC_WRITE_BARRIER(interp, alarm);
(void) VTABLE_invoke(interp, alarm, NULL);
return (opcode_t*) NULL;
}
/*
=back
=head2 Internal functions
Functions that are used by the scheduler itself.
=over 4
=item C<void Parrot_cx_enable_preemption(PARROT_INTERP)>
Enable preemption. Used when more than one task is runnable.
=cut
*/
void
Parrot_cx_enable_preemption(PARROT_INTERP)
{
ASSERT_ARGS(Parrot_cx_enable_preemption)
PMC * const scheduler = interp->scheduler;
SCHEDULER_enable_preemption_SET(scheduler);
Parrot_cx_set_scheduler_alarm(interp);
}
/*
=item C<void Parrot_cx_disable_preemption(PARROT_INTERP)>
Disable preemption. Used when only one task is runnable.
=cut
*/
void
Parrot_cx_disable_preemption(PARROT_INTERP)
{
ASSERT_ARGS(Parrot_cx_disable_preemption)
PMC * const scheduler = interp->scheduler;
SCHEDULER_enable_preemption_CLEAR(scheduler);
}
/*
=item C<static int Parrot_cx_preemption_enabled(PARROT_INTERP)>
Checks wether preemption is enabled or not.
=cut
*/
static int
Parrot_cx_preemption_enabled(PARROT_INTERP)
{
ASSERT_ARGS(Parrot_cx_preemption_enabled)
PMC * const scheduler = interp->scheduler;
return SCHEDULER_enable_preemption_TEST(scheduler);
}
/*
=back
=head1 SEE ALSO
F<include/parrot/scheduler.h>
=cut
*/
/*
* Local variables:
* c-file-style: "parrot"
* End:
* vim: expandtab shiftwidth=4 cinoptions='\:2=2' :
*/
Jump to Line
Something went wrong with that request. Please try again.