#include "attribute.h" #include #include "task.h" #include "thread.h" #define VALID_MANAGER(m) ((m) != NULL && \ (m)->magic == TASK_MANAGER_MAGIC) #define VALID_TASK(t) ((t) != NULL && \ (t)->magic == TASK_MAGIC) #define LOCK(lp) os_mutex_lock((lp)) #define UNLOCK(lp) os_mutex_unlock((lp)) #define WAIT(cvp, lp) os_condition_wait((cvp), (lp)) #define BROADCAST(cvp) os_condition_broadcast((cvp)) #define DEFAULT_DEFAULT_QUANTUM 5 #define FINISHED(m) ((m)->exiting && EMPTY((m)->tasks)) #ifdef DEBUGTRACE #define XTRACE(m) printf("%s %p\n", (m), pthread_self()) #else #define XTRACE(m) #endif /*** *** Tasks. ***/ void * event_get(mem_context_t mctx, event_type_t type, event_action_t action, size_t size) { generic_event_t event; if (size < sizeof *event) return (NULL); event = mem_get(mctx, size); if (event == NULL) return (NULL); event->mctx = mctx; event->size = size; event->type = type; event->action = action; return (event); } void event_put(void *target) { generic_event_t event = target; mem_put(event->mctx, event, event->size); } /*** *** Tasks. ***/ static void task_free(task_t task) { task_manager_t manager = task->manager; XTRACE("free task"); REQUIRE(EMPTY(task->events)); LOCK(&manager->lock); UNLINK(manager->tasks, task, link); if (FINISHED(manager)) { /* * All tasks have completed and the * task manager is exiting. Wake up * any idle worker threads so they * can exit. */ BROADCAST(&manager->work_available); } UNLOCK(&manager->lock); os_mutex_destroy(&task->lock); task->magic = 0; mem_put(manager->mctx, task, sizeof *task); } boolean_t task_create(task_manager_t manager, void *arg, event_action_t shutdown_action, unsigned int quantum, task_t *taskp) { task_t task; REQUIRE(VALID_MANAGER(manager)); REQUIRE(taskp != NULL && *taskp == NULL); task = mem_get(manager->mctx, sizeof *task); if (task == NULL) return (FALSE); task->magic = TASK_MAGIC; task->manager = manager; os_mutex_init(&task->lock); task->state = task_state_idle; task->references = 1; INIT_LIST(task->events); task->quantum = quantum; task->shutdown_pending = FALSE; task->arg = arg; task->shutdown_action = shutdown_action; INIT_LINK(task, link); INIT_LINK(task, ready_link); LOCK(&manager->lock); if (task->quantum == 0) task->quantum = manager->default_quantum; APPEND(manager->tasks, task, link); UNLOCK(&manager->lock); *taskp = task; return (TRUE); } boolean_t task_attach(task_t task, task_t *taskp) { REQUIRE(VALID_TASK(task)); REQUIRE(taskp != NULL && *taskp == NULL); LOCK(&task->lock); task->references++; UNLOCK(&task->lock); *taskp = task; return (TRUE); } void task_detach(task_t *taskp) { boolean_t free_task = FALSE; task_manager_t manager; task_t task; XTRACE("task_detach"); REQUIRE(taskp != NULL); task = *taskp; REQUIRE(VALID_TASK(task)); LOCK(&task->lock); REQUIRE(task->references > 0); task->references--; if (task->state == task_state_shutdown && task->references == 0) { manager = task->manager; INSIST(VALID_MANAGER(manager)); free_task = TRUE; } UNLOCK(&task->lock); if (free_task) task_free(task); *taskp = NULL; } boolean_t task_send_event(task_t task, generic_event_t event) { boolean_t was_idle = FALSE; boolean_t discard = FALSE; REQUIRE(VALID_TASK(task)); REQUIRE(event != NULL); XTRACE("sending"); /* * We're trying hard to hold locks for as short a time as possible. * We're also trying to hold as few locks as possible. This is why * some processing is deferred until after a lock is released. */ LOCK(&task->lock); if (task->state != task_state_shutdown && !task->shutdown_pending) { if (task->state == task_state_idle) { was_idle = TRUE; INSIST(EMPTY(task->events)); task->state = task_state_ready; } INSIST(task->state == task_state_ready || task->state == task_state_running); ENQUEUE(task->events, event, link); } else discard = TRUE; UNLOCK(&task->lock); if (discard) { event_put(event); return (TRUE); } if (was_idle) { boolean_t need_wakeup = FALSE; task_manager_t manager; /* * We need to add this task to the ready queue. * * We've waited until now to do it, rather than doing it * while holding the task lock, because we don't want to * block while holding the task lock. * * We've changed the state to ready, so no one else will * be trying to add this task to the ready queue. It * thus doesn't matter if more events have been added to * the queue after we gave up the task lock. * * Shutting down a task requires posting a shutdown event * to the task's queue and then executing it, so there's * no way the task can disappear. A task is always on the * task manager's 'tasks' list, so the task manager can * always post a shutdown event to all tasks if it is * requested to shutdown. */ manager = task->manager; INSIST(VALID_MANAGER(manager)); LOCK(&manager->lock); if (EMPTY(manager->ready_tasks)) need_wakeup = TRUE; ENQUEUE(manager->ready_tasks, task, ready_link); UNLOCK(&manager->lock); /* * If the runnable queue is empty, the worker threads could * either be executing tasks or waiting for something to do. * We wakeup anyone who is sleeping. */ if (need_wakeup) BROADCAST(&manager->work_available); } XTRACE("sent"); return (TRUE); } void task_shutdown(task_t task) { boolean_t was_idle = FALSE; boolean_t discard = FALSE; REQUIRE(VALID_TASK(task)); /* * This routine is very similar to task_send_event() above. */ LOCK(&task->lock); if (task->state != task_state_shutdown && !task->shutdown_pending) { if (task->state == task_state_idle) { was_idle = TRUE; INSIST(EMPTY(task->events)); task->state = task_state_ready; } INSIST(task->state == task_state_ready || task->state == task_state_running); task->shutdown_pending = TRUE; } else discard = TRUE; UNLOCK(&task->lock); if (discard) return; if (was_idle) { boolean_t need_wakeup = FALSE; task_manager_t manager; manager = task->manager; INSIST(VALID_MANAGER(manager)); LOCK(&manager->lock); if (EMPTY(manager->ready_tasks)) need_wakeup = TRUE; ENQUEUE(manager->ready_tasks, task, ready_link); UNLOCK(&manager->lock); if (need_wakeup) BROADCAST(&manager->work_available); } } void task_destroy(task_t *taskp) { REQUIRE(taskp != NULL); task_shutdown(*taskp); task_detach(taskp); } /*** *** Task Manager. ***/ static void *task_manager_run(void *uap) { task_manager_t manager = uap; task_t task; boolean_t no_workers = FALSE; XTRACE("start"); REQUIRE(VALID_MANAGER(manager)); /* * Again we're trying to hold the lock for as short a time as possible * and to do as little locking and unlocking as possible. * * In both while loops, the appropriate lock must be held before the * while body starts. Code which acquired the lock at the top of * the loop would be more readable, but would result in a lot of * extra locking. Compare: * * Straightforward: * * LOCK(); * ... * UNLOCK(); * while (expression) { * LOCK(); * ... * UNLOCK(); * * Unlocked part here... * * LOCK(); * ... * UNLOCK(); * } * * Note how if the loop continues we unlock and then immediately lock. * For N iterations of the loop, this code does 2N+1 locks and 2N+1 * unlocks. Also note that the lock is not held when the while * condition is tested, which may or may not be important, depending * on the expression. * * As written: * * LOCK(); * while (expression) { * ... * UNLOCK(); * * Unlocked part here... * * LOCK(); * ... * } * UNLOCK(); * * For N iterations of the loop, this code does N+1 locks and N+1 * unlocks. The while expression is always protected by the lock. */ LOCK(&manager->lock); while (!FINISHED(manager)) { /* * For reasons similar to those given in the comment in * task_send_event() above, it is safe for us to dequeue * the task while only holding the manager lock, and then * change the task to running state while only holding the * task lock. */ while (EMPTY(manager->ready_tasks) && !FINISHED(manager)) { XTRACE("wait"); WAIT(&manager->work_available, &manager->lock); XTRACE("awake"); } XTRACE("working"); task = HEAD(manager->ready_tasks); if (task != NULL) { unsigned int dispatch_count = 0; boolean_t done = FALSE; boolean_t requeue = FALSE; boolean_t wants_shutdown; boolean_t free_task = FALSE; void *arg; event_action_t action; generic_event_t event; event_list_t remaining_events; boolean_t discard_remaining = FALSE; INSIST(VALID_TASK(task)); /* * Note we only unlock the manager lock if we actually * have a task to do. We must reacquire the manager * lock before exiting the 'if (task != NULL)' block. */ DEQUEUE(manager->ready_tasks, task, ready_link); UNLOCK(&manager->lock); LOCK(&task->lock); task->state = task_state_running; while (!done) { INSIST(task->shutdown_pending || !EMPTY(task->events)); if (task->shutdown_pending && EMPTY(task->events)) { event = NULL; action = task->shutdown_action; } else { event = HEAD(task->events); action = event->action; DEQUEUE(task->events, event, link); } arg = task->arg; UNLOCK(&task->lock); /* * Execute the event action. */ XTRACE("execute action"); if (action != NULL) wants_shutdown = (*action)(task, arg, event); else wants_shutdown = FALSE; dispatch_count++; /* * If this wasn't a shutdown event, we * need to free it. * * Also, if we've delivered the shutdown * event to the task, then we are going * to shut it down no matter what the task * callback returned. */ if (event != NULL) event_put(event); else wants_shutdown = TRUE; LOCK(&task->lock); if (wants_shutdown) { /* * The task has either had the * shutdown event sent to it, or * an event action requested shutdown. * * Since no more events can be * delivered to the task, we purge * any remaining events (but defer * freeing them until we've released * the lock). */ XTRACE("wants shutdown"); if (!EMPTY(task->events)) { remaining_events = task->events; INIT_LIST(task->events); discard_remaining = TRUE; } if (task->references == 0) free_task = TRUE; task->state = task_state_shutdown; done = TRUE; } else if (EMPTY(task->events) && !task->shutdown_pending) { /* * Nothing else to do for this task. * Put it to sleep. */ task->state = task_state_idle; done = TRUE; } else if (dispatch_count >= task->quantum) { /* * Our quantum has expired, but * there is more work to be done. * We'll requeue it to the ready * queue later. * * We don't check quantum until * dispatching at least one event, * so the minimum quantum is one. */ task->state = task_state_ready; requeue = TRUE; done = TRUE; } } UNLOCK(&task->lock); if (discard_remaining) { generic_event_t next_event; for (event = HEAD(remaining_events); event != NULL; event = next_event) { next_event = NEXT(event, link); event_put(event); } } if (free_task) task_free(task); LOCK(&manager->lock); if (requeue) { /* * We know we're awake, so we don't have * to wakeup any sleeping threads if the * ready queue is empty before we requeue. * * A possible optimization if the queue is * empty is to 'goto' the 'if (task != NULL)' * block, avoiding the ENQUEUE of the task * and the subsequent immediate DEQUEUE * (since it is the only executable task). * We don't do this because then we'd be * skipping the exit_requested check. The * cost of ENQUEUE is low anyway, especially * when you consider that we'd have to do * an extra EMPTY check to see if we could * do the optimization. If the ready queue * were usually nonempty, the 'optimization' * might even hurt rather than help. */ ENQUEUE(manager->ready_tasks, task, ready_link); } } } INSIST(manager->workers > 0); manager->workers--; if (manager->workers == 0) no_workers = TRUE; UNLOCK(&manager->lock); if (no_workers) BROADCAST(&manager->no_workers); XTRACE("exit"); return (NULL); } static void manager_free(task_manager_t manager) { os_condition_destroy(&manager->work_available); os_condition_destroy(&manager->no_workers); os_mutex_destroy(&manager->lock); manager->magic = 0; mem_put(manager->mctx, manager, sizeof *manager); } unsigned int task_manager_create(mem_context_t mctx, unsigned int workers, unsigned int default_quantum, task_manager_t *managerp) { unsigned int i, started = 0; task_manager_t manager; os_thread_t thread; manager = mem_get(mctx, sizeof *manager); if (manager == NULL) return (0); manager->magic = TASK_MANAGER_MAGIC; manager->mctx = mctx; os_mutex_init(&manager->lock); if (default_quantum == 0) default_quantum = DEFAULT_DEFAULT_QUANTUM; manager->default_quantum = default_quantum; INIT_LIST(manager->tasks); INIT_LIST(manager->ready_tasks); os_condition_init(&manager->work_available); manager->exiting = FALSE; manager->workers = 0; os_condition_init(&manager->no_workers); LOCK(&manager->lock); /* * Start workers. */ for (i = 0; i < workers; i++) { if (os_thread_create(task_manager_run, manager, &thread)) { manager->workers++; started++; os_thread_detach(thread); } } UNLOCK(&manager->lock); if (started == 0) { manager_free(manager); return (0); } *managerp = manager; return (started); } boolean_t task_manager_destroy(task_manager_t *managerp) { task_manager_t manager; task_t task; REQUIRE(managerp != NULL); manager = *managerp; REQUIRE(VALID_MANAGER(manager)); XTRACE("task_manager_destroy"); /* * Only one non-worker thread may ever call this routine. * If a worker thread wants to initiate shutdown of the * task manager, it should ask some non-worker thread to call * task_manager_destroy(), e.g. by signalling a condition variable * that the startup thread is sleeping on. */ /* * Unlike elsewhere, we're going to hold this lock a long time. * We need to do so, because otherwise the list of tasks could * change while we were traversing it. * * This is also the only function where we will hold both the * task manager lock and a task lock at the same time. */ LOCK(&manager->lock); /* * Make sure we only get called once. */ INSIST(!manager->exiting); manager->exiting = TRUE; /* * Post a shutdown event to every task. */ for (task = HEAD(manager->tasks); task != NULL; task = NEXT(task, link)) { LOCK(&task->lock); task->shutdown_pending = TRUE; if (task->state == task_state_idle) { task->state = task_state_ready; ENQUEUE(manager->ready_tasks, task, ready_link); } UNLOCK(&task->lock); } /* * Wake up any sleeping workers. This ensures we get work done if * there's work left to do, and if there are already no tasks left * it will cause the workers to see manager->exiting. */ BROADCAST(&manager->work_available); /* * Wait for all the worker threads to exit. */ while (manager->workers > 0) WAIT(&manager->no_workers, &manager->lock); UNLOCK(&manager->lock); manager_free(manager); *managerp = NULL; return (TRUE); }