split out src/ directory into categorized subdirectories.

1 files changed, 0 insertions, 209 deletions

diff --git a/src/task.c b/src/task.c
deleted file mode 100644
index 7bd2b5937..000000000
--- a/src/task.c
+++ /dev/null
@@ -1,209 +0,0 @@
-#include "global.h"
-#include "task.h"
-
-#define ACTIVE_SENTINEL 0x10
-#define HEAD_SENTINEL 0xFE
-#define TAIL_SENTINEL 0xFF
-
-// gTasks is a queue of the active 16 tasks
-struct Task gTasks[ACTIVE_SENTINEL];
-
-static void InsertTask(u8 newTaskId);
-static u8 FindFirstActiveTask();
-
-// Unused string
-const u8 sTaskOverString[] = _("TASK OVER\nタスクがオーバーしました");
-
-void ResetTasks()
-{
-    u8 taskId;
-
-    for (taskId = 0; taskId < ACTIVE_SENTINEL; taskId++)
-    {
-        gTasks[taskId].isActive = FALSE;
-        gTasks[taskId].func = TaskDummy;
-        gTasks[taskId].prev = taskId;
-        gTasks[taskId].next = taskId + 1;
-        gTasks[taskId].priority = -1;
-        memset(gTasks[taskId].data, 0, sizeof(gTasks[taskId].data));
-    }
-
-    gTasks[0].prev = HEAD_SENTINEL;
-    gTasks[ACTIVE_SENTINEL - 1].next = TAIL_SENTINEL;
-}
-
-u8 CreateTask(TaskFunc func, u8 priority)
-{
-    u8 taskId;
-
-    for (taskId = 0; taskId < ACTIVE_SENTINEL; taskId++)
-    {
-        if (!gTasks[taskId].isActive)
-        {
-            gTasks[taskId].func = func;
-            gTasks[taskId].priority = priority;
-            InsertTask(taskId);
-            memset(gTasks[taskId].data, 0, sizeof(gTasks[taskId].data));
-            gTasks[taskId].isActive = TRUE;
-            return taskId;
-        }
-    }
-
-    return 0;
-}
-
-static void InsertTask(u8 newTaskId)
-{
-    u8 taskId = FindFirstActiveTask();
-
-    if (taskId == ACTIVE_SENTINEL)
-    {
-        // The task system inserts from the top downwards starting from the end (0xFF) to 0. If FindFirstActiveTask returned the value equivalent to ACTIVE_SENTINEL, it means it is the only task because it searched the entire queue.
-        gTasks[newTaskId].prev = HEAD_SENTINEL;
-        gTasks[newTaskId].next = TAIL_SENTINEL;
-        return;
-    }
-
-    while (1)
-    {
-        if (gTasks[newTaskId].priority < gTasks[taskId].priority)
-        {
-            // We've found a task with a higher priority value,
-            // so we insert the new task before it.
-            gTasks[newTaskId].prev = gTasks[taskId].prev;
-            gTasks[newTaskId].next = taskId;
-
-            if (gTasks[taskId].prev != HEAD_SENTINEL)
-                gTasks[gTasks[taskId].prev].next = newTaskId; // as long as we are not at the end, insert the newTask appropriately.
-
-            gTasks[taskId].prev = newTaskId;
-            return;
-        }
-        if (gTasks[taskId].next == TAIL_SENTINEL) // we did not find a space for the task, so overwrite the last task as it is the lowest priority.
-        {
-            // We've reached the end.
-            gTasks[newTaskId].prev = taskId;
-            gTasks[newTaskId].next = gTasks[taskId].next;
-            gTasks[taskId].next = newTaskId;
-            return;
-        }
-        taskId = gTasks[taskId].next; // neither the priority was lower, nor the end. check the next task.
-    }
-}
-
-void DestroyTask(u8 taskId)
-{
-    if (gTasks[taskId].isActive)
-    {
-        gTasks[taskId].isActive = FALSE;
-
-        if (gTasks[taskId].prev == HEAD_SENTINEL)
-        {
-            if (gTasks[taskId].next != TAIL_SENTINEL)
-                gTasks[gTasks[taskId].next].prev = HEAD_SENTINEL;
-        }
-        else
-        {
-            if (gTasks[taskId].next == TAIL_SENTINEL)
-            {
-                gTasks[gTasks[taskId].prev].next = TAIL_SENTINEL;
-            }
-            else
-            {
-                gTasks[gTasks[taskId].prev].next = gTasks[taskId].next;
-                gTasks[gTasks[taskId].next].prev = gTasks[taskId].prev;
-            }
-        }
-    }
-}
-
-void RunTasks(void)
-{
-    u8 taskId = FindFirstActiveTask();
-
-    if (taskId != ACTIVE_SENTINEL)
-    {
-        do
-        {
-            gTasks[taskId].func(taskId);
-            taskId = gTasks[taskId].next;
-        } while (taskId != TAIL_SENTINEL);
-    }
-}
-
-static u8 FindFirstActiveTask(void)
-{
-    u8 taskId;
-
-    for (taskId = 0; taskId < ACTIVE_SENTINEL; taskId++)
-        if (gTasks[taskId].isActive == TRUE && gTasks[taskId].prev == HEAD_SENTINEL)
-            break;
-
-    return taskId;
-}
-
-void TaskDummy(u8 taskId)
-{
-}
-
-#define TASK_DATA_OP(taskId, offset, op)                    \
-{                                                           \
-    u32 tasksAddr = (u32)gTasks;                            \
-    u32 addr = taskId * sizeof(struct Task) + offset;       \
-    u32 dataAddr = tasksAddr + offsetof(struct Task, data); \
-    addr += dataAddr;                                       \
-    op;                                                     \
-}
-
-void SetTaskFuncWithFollowupFunc(u8 taskId, TaskFunc func, TaskFunc followupFunc)
-{
-    TASK_DATA_OP(taskId, 28, *((u16 *)addr) = (u32)followupFunc)
-    TASK_DATA_OP(taskId, 30, *((u16 *)addr) = (u32)followupFunc >> 16)
-    gTasks[taskId].func = func;
-}
-
-void SwitchTaskToFollowupFunc(u8 taskId)
-{
-    s32 func;
-
-    gTasks[taskId].func = NULL;
-
-    TASK_DATA_OP(taskId, 28, func = *((u16 *)addr))
-    TASK_DATA_OP(taskId, 30, func |= *((s16 *)addr) << 16)
-
-    gTasks[taskId].func = (TaskFunc)func;
-}
-
-bool8 FuncIsActiveTask(TaskFunc func)
-{
-    u8 i;
-
-    for (i = 0; i < ACTIVE_SENTINEL; i++)
-        if (gTasks[i].isActive == TRUE && gTasks[i].func == func)
-            return TRUE;
-
-    return FALSE;
-}
-
-u8 FindTaskIdByFunc(TaskFunc func)
-{
-    s32 i;
-
-    for (i = 0; i < ACTIVE_SENTINEL; i++)
-        if (gTasks[i].isActive == TRUE && gTasks[i].func == func)
-            return (u8)i;
-
-    return -1;
-}
-
-u8 GetTaskCount(void)
-{
-    u8 i;
-    u8 count = 0;
-
-    for (i = 0; i < ACTIVE_SENTINEL; i++)
-        if (gTasks[i].isActive == TRUE)
-            count++;
-
-    return count;
-}