2018-10-16 09:01:38 +00:00
|
|
|
#include "types.h"
|
|
|
|
#include "Task.h"
|
|
|
|
#include "kmalloc.h"
|
|
|
|
#include "VGA.h"
|
|
|
|
#include "StdLib.h"
|
|
|
|
#include "i386.h"
|
|
|
|
#include "system.h"
|
2018-10-18 08:28:09 +00:00
|
|
|
#include <VirtualFileSystem/FileHandle.h>
|
|
|
|
#include <VirtualFileSystem/VirtualFileSystem.h>
|
2018-10-22 13:42:39 +00:00
|
|
|
#include <ELFLoader/ExecSpace.h>
|
2018-10-17 21:13:55 +00:00
|
|
|
#include "MemoryManager.h"
|
2018-10-16 09:01:38 +00:00
|
|
|
|
2018-10-23 08:12:50 +00:00
|
|
|
//#define DEBUG_IO
|
2018-10-23 22:20:34 +00:00
|
|
|
//#define TASK_DEBUG
|
|
|
|
|
|
|
|
static const DWORD defaultStackSize = 16384;
|
2018-10-23 08:12:50 +00:00
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
Task* current;
|
2018-10-16 09:06:35 +00:00
|
|
|
Task* s_kernelTask;
|
2018-10-16 09:01:38 +00:00
|
|
|
|
|
|
|
static pid_t next_pid;
|
2018-10-17 08:55:43 +00:00
|
|
|
static InlineLinkedList<Task>* s_tasks;
|
2018-10-23 13:41:55 +00:00
|
|
|
static InlineLinkedList<Task>* s_deadTasks;
|
2018-10-16 09:01:38 +00:00
|
|
|
|
2018-10-16 09:06:35 +00:00
|
|
|
static bool contextSwitch(Task*);
|
2018-10-16 09:01:38 +00:00
|
|
|
|
2018-10-16 09:06:35 +00:00
|
|
|
static void redoKernelTaskTSS()
|
2018-10-16 09:01:38 +00:00
|
|
|
{
|
2018-10-16 09:06:35 +00:00
|
|
|
if (!s_kernelTask->selector())
|
|
|
|
s_kernelTask->setSelector(allocateGDTEntry());
|
|
|
|
|
|
|
|
auto& tssDescriptor = getGDTEntry(s_kernelTask->selector());
|
|
|
|
|
|
|
|
tssDescriptor.setBase(&s_kernelTask->tss());
|
|
|
|
tssDescriptor.setLimit(0xffff);
|
|
|
|
tssDescriptor.dpl = 0;
|
|
|
|
tssDescriptor.segment_present = 1;
|
|
|
|
tssDescriptor.granularity = 1;
|
|
|
|
tssDescriptor.zero = 0;
|
|
|
|
tssDescriptor.operation_size = 1;
|
|
|
|
tssDescriptor.descriptor_type = 0;
|
|
|
|
tssDescriptor.type = 9;
|
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
flushGDT();
|
|
|
|
}
|
|
|
|
|
2018-10-16 09:06:35 +00:00
|
|
|
void Task::prepForIRETToNewTask()
|
|
|
|
{
|
|
|
|
redoKernelTaskTSS();
|
|
|
|
s_kernelTask->tss().backlink = current->selector();
|
|
|
|
loadTaskRegister(s_kernelTask->selector());
|
|
|
|
}
|
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
void Task::initialize()
|
|
|
|
{
|
|
|
|
current = nullptr;
|
|
|
|
next_pid = 0;
|
2018-10-17 08:55:43 +00:00
|
|
|
s_tasks = new InlineLinkedList<Task>;
|
2018-10-23 13:41:55 +00:00
|
|
|
s_deadTasks = new InlineLinkedList<Task>;
|
2018-10-22 09:15:16 +00:00
|
|
|
s_kernelTask = new Task(0, "colonel", IPC::Handle::Any, Task::Ring0);
|
2018-10-16 09:06:35 +00:00
|
|
|
redoKernelTaskTSS();
|
|
|
|
loadTaskRegister(s_kernelTask->selector());
|
2018-10-16 09:01:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef TASK_SANITY_CHECKS
|
|
|
|
void Task::checkSanity(const char* msg)
|
|
|
|
{
|
|
|
|
char ch = current->name()[0];
|
|
|
|
kprintf("<%p> %s{%u}%b [%d] :%b: sanity check <%s>\n",
|
|
|
|
current->name().characters(),
|
|
|
|
current->name().characters(),
|
|
|
|
current->name().length(),
|
|
|
|
current->name()[current->name().length() - 1],
|
|
|
|
current->pid(), ch, msg ? msg : "");
|
|
|
|
ASSERT((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z'));
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
void Task::allocateLDT()
|
|
|
|
{
|
|
|
|
ASSERT(!m_tss.ldt);
|
|
|
|
static const WORD numLDTEntries = 4;
|
|
|
|
WORD newLDTSelector = allocateGDTEntry();
|
|
|
|
m_ldtEntries = new Descriptor[numLDTEntries];
|
2018-10-18 12:53:00 +00:00
|
|
|
#if 0
|
2018-10-16 09:01:38 +00:00
|
|
|
kprintf("new ldt selector = %x\n", newLDTSelector);
|
|
|
|
kprintf("new ldt table at = %p\n", m_ldtEntries);
|
|
|
|
kprintf("new ldt table size = %u\n", (numLDTEntries * 8) - 1);
|
|
|
|
#endif
|
|
|
|
Descriptor& ldt = getGDTEntry(newLDTSelector);
|
|
|
|
ldt.setBase(m_ldtEntries);
|
|
|
|
ldt.setLimit(numLDTEntries * 8 - 1);
|
|
|
|
ldt.dpl = 0;
|
|
|
|
ldt.segment_present = 1;
|
|
|
|
ldt.granularity = 0;
|
|
|
|
ldt.zero = 0;
|
|
|
|
ldt.operation_size = 1;
|
|
|
|
ldt.descriptor_type = 0;
|
|
|
|
ldt.type = Descriptor::LDT;
|
|
|
|
m_tss.ldt = newLDTSelector;
|
|
|
|
}
|
|
|
|
|
2018-10-23 10:44:46 +00:00
|
|
|
Vector<Task*> Task::allTasks()
|
|
|
|
{
|
|
|
|
Vector<Task*> tasks;
|
|
|
|
tasks.ensureCapacity(s_tasks->sizeSlow());
|
|
|
|
for (auto* task = s_tasks->head(); task; task = task->next())
|
|
|
|
tasks.append(task);
|
|
|
|
return tasks;
|
|
|
|
}
|
|
|
|
|
2018-10-18 12:53:00 +00:00
|
|
|
Task::Region* Task::allocateRegion(size_t size, String&& name)
|
2018-10-18 11:05:00 +00:00
|
|
|
{
|
2018-10-18 12:53:00 +00:00
|
|
|
// FIXME: This needs sanity checks. What if this overlaps existing regions?
|
|
|
|
|
2018-10-22 09:15:16 +00:00
|
|
|
auto zone = MemoryManager::the().createZone(size);
|
2018-10-18 12:53:00 +00:00
|
|
|
ASSERT(zone);
|
|
|
|
m_regions.append(make<Region>(m_nextRegion, size, move(zone), move(name)));
|
|
|
|
m_nextRegion = m_nextRegion.offset(size).offset(16384);
|
|
|
|
return m_regions.last().ptr();
|
2018-10-18 11:05:00 +00:00
|
|
|
}
|
|
|
|
|
2018-10-24 07:48:24 +00:00
|
|
|
bool Task::deallocateRegion(Region& region)
|
|
|
|
{
|
|
|
|
for (size_t i = 0; i < m_regions.size(); ++i) {
|
|
|
|
if (m_regions[i].ptr() == ®ion) {
|
|
|
|
// FIXME: This seems racy.
|
|
|
|
MemoryManager::the().unmapRegion(*this, region);
|
|
|
|
m_regions.remove(i);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
Task::Region* Task::regionFromRange(LinearAddress laddr, size_t size)
|
|
|
|
{
|
|
|
|
for (auto& region : m_regions) {
|
|
|
|
if (region->linearAddress == laddr && region->size == size)
|
|
|
|
return region.ptr();
|
|
|
|
}
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
void* Task::sys$mmap(void* addr, size_t size)
|
|
|
|
{
|
|
|
|
// FIXME: Implement mapping at a client-preferred address.
|
|
|
|
ASSERT(addr == nullptr);
|
|
|
|
auto* region = allocateRegion(size, "mmap");
|
|
|
|
if (!region)
|
|
|
|
return (void*)-1;
|
|
|
|
MemoryManager::the().mapRegion(*this, *region);
|
|
|
|
return (void*)region->linearAddress.get();
|
|
|
|
}
|
|
|
|
|
|
|
|
int Task::sys$munmap(void* addr, size_t size)
|
|
|
|
{
|
|
|
|
auto* region = regionFromRange(LinearAddress((dword)addr), size);
|
|
|
|
if (!region)
|
|
|
|
return -1;
|
|
|
|
if (!deallocateRegion(*region))
|
|
|
|
return -1;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2018-10-23 08:12:50 +00:00
|
|
|
int Task::sys$spawn(const char* path)
|
|
|
|
{
|
|
|
|
auto* child = Task::create(path, m_uid, m_gid);
|
|
|
|
if (child)
|
|
|
|
return child->pid();
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2018-10-22 13:42:39 +00:00
|
|
|
Task* Task::create(const String& path, uid_t uid, gid_t gid)
|
|
|
|
{
|
|
|
|
auto parts = path.split('/');
|
|
|
|
if (parts.isEmpty())
|
|
|
|
return nullptr;
|
|
|
|
|
|
|
|
auto handle = VirtualFileSystem::the().open(path);
|
|
|
|
if (!handle)
|
|
|
|
return nullptr;
|
|
|
|
|
|
|
|
auto elfData = handle->readEntireFile();
|
|
|
|
if (!elfData)
|
|
|
|
return nullptr;
|
|
|
|
|
2018-10-24 09:07:53 +00:00
|
|
|
InterruptDisabler disabler; // FIXME: Get rid of this, jesus christ. This "critical" section is HUGE.
|
2018-10-22 13:42:39 +00:00
|
|
|
Task* t = new Task(parts.takeLast(), uid, gid);
|
|
|
|
|
|
|
|
ExecSpace space;
|
|
|
|
space.hookableAlloc = [&] (const String& name, size_t size) {
|
|
|
|
if (!size)
|
|
|
|
return (void*)nullptr;
|
|
|
|
size = ((size / 4096) + 1) * 4096;
|
|
|
|
Region* region = t->allocateRegion(size, String(name));
|
|
|
|
ASSERT(region);
|
|
|
|
MemoryManager::the().mapRegion(*t, *region);
|
|
|
|
return (void*)region->linearAddress.asPtr();
|
|
|
|
};
|
|
|
|
bool success = space.loadELF(move(elfData));
|
|
|
|
if (!success) {
|
|
|
|
delete t;
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
t->m_tss.eip = (dword)space.symbolPtr("_start");
|
2018-10-23 08:12:50 +00:00
|
|
|
if (!t->m_tss.eip) {
|
|
|
|
delete t;
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
MemoryManager::the().unmapRegionsForTask(*t);
|
|
|
|
MemoryManager::the().mapRegionsForTask(*current);
|
2018-10-22 13:42:39 +00:00
|
|
|
|
|
|
|
s_tasks->prepend(t);
|
|
|
|
system.nprocess++;
|
2018-10-23 22:20:34 +00:00
|
|
|
#ifdef TASK_DEBUG
|
2018-10-22 13:42:39 +00:00
|
|
|
kprintf("Task %u (%s) spawned @ %p\n", t->pid(), t->name().characters(), t->m_tss.eip);
|
2018-10-23 22:20:34 +00:00
|
|
|
#endif
|
2018-10-22 13:42:39 +00:00
|
|
|
|
|
|
|
return t;
|
|
|
|
}
|
|
|
|
|
|
|
|
Task::Task(String&& name, uid_t uid, gid_t gid)
|
|
|
|
: m_name(move(name))
|
|
|
|
, m_pid(next_pid++)
|
|
|
|
, m_uid(uid)
|
|
|
|
, m_gid(gid)
|
|
|
|
, m_state(Runnable)
|
|
|
|
, m_ring(Ring3)
|
|
|
|
{
|
2018-10-24 10:43:52 +00:00
|
|
|
m_fileHandles.append(nullptr);
|
|
|
|
m_fileHandles.append(nullptr);
|
|
|
|
m_fileHandles.append(nullptr);
|
|
|
|
|
2018-10-22 13:42:39 +00:00
|
|
|
m_nextRegion = LinearAddress(0x600000);
|
|
|
|
|
|
|
|
memset(&m_tss, 0, sizeof(m_tss));
|
|
|
|
memset(&m_ldtEntries, 0, sizeof(m_ldtEntries));
|
|
|
|
|
|
|
|
allocateLDT();
|
|
|
|
|
|
|
|
// Only IF is set when a task boots.
|
|
|
|
m_tss.eflags = 0x0202;
|
|
|
|
|
|
|
|
WORD codeSegment = 0x1b;
|
|
|
|
WORD dataSegment = 0x23;
|
|
|
|
WORD stackSegment = dataSegment;
|
|
|
|
|
|
|
|
m_tss.ds = dataSegment;
|
|
|
|
m_tss.es = dataSegment;
|
|
|
|
m_tss.fs = dataSegment;
|
|
|
|
m_tss.gs = dataSegment;
|
|
|
|
m_tss.ss = stackSegment;
|
|
|
|
m_tss.cs = codeSegment;
|
|
|
|
|
|
|
|
m_tss.cr3 = MemoryManager::the().pageDirectoryBase().get();
|
|
|
|
|
|
|
|
auto* region = allocateRegion(defaultStackSize, "stack");
|
|
|
|
ASSERT(region);
|
|
|
|
m_stackTop = region->linearAddress.offset(defaultStackSize).get() & 0xfffffff8;
|
|
|
|
m_tss.esp = m_stackTop;
|
|
|
|
|
|
|
|
// Set up a separate stack for Ring0.
|
|
|
|
m_kernelStack = kmalloc(defaultStackSize);
|
|
|
|
DWORD ring0StackTop = ((DWORD)m_kernelStack + defaultStackSize) & 0xffffff8;
|
|
|
|
m_tss.ss0 = 0x10;
|
|
|
|
m_tss.esp0 = ring0StackTop;
|
|
|
|
|
|
|
|
// HACK: Ring2 SS in the TSS is the current PID.
|
|
|
|
m_tss.ss2 = m_pid;
|
|
|
|
|
|
|
|
m_farPtr.offset = 0x98765432;
|
|
|
|
|
|
|
|
ASSERT(m_pid);
|
|
|
|
}
|
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
Task::Task(void (*e)(), const char* n, IPC::Handle h, RingLevel ring)
|
|
|
|
: m_name(n)
|
|
|
|
, m_entry(e)
|
|
|
|
, m_pid(next_pid++)
|
|
|
|
, m_handle(h)
|
|
|
|
, m_state(Runnable)
|
|
|
|
, m_ring(ring)
|
|
|
|
{
|
2018-10-24 10:43:52 +00:00
|
|
|
m_fileHandles.append(nullptr);
|
|
|
|
m_fileHandles.append(nullptr);
|
|
|
|
m_fileHandles.append(nullptr);
|
|
|
|
|
2018-10-18 12:53:00 +00:00
|
|
|
m_nextRegion = LinearAddress(0x600000);
|
2018-10-18 11:05:00 +00:00
|
|
|
|
2018-10-18 12:53:00 +00:00
|
|
|
Region* codeRegion = nullptr;
|
|
|
|
if (!isRing0()) {
|
|
|
|
codeRegion = allocateRegion(4096, "code");
|
|
|
|
ASSERT(codeRegion);
|
|
|
|
bool success = copyToZone(*codeRegion->zone, (void*)e, PAGE_SIZE);
|
2018-10-18 11:05:00 +00:00
|
|
|
ASSERT(success);
|
|
|
|
}
|
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
memset(&m_tss, 0, sizeof(m_tss));
|
|
|
|
memset(&m_ldtEntries, 0, sizeof(m_ldtEntries));
|
|
|
|
|
|
|
|
if (ring == Ring3) {
|
|
|
|
allocateLDT();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Only IF is set when a task boots.
|
|
|
|
m_tss.eflags = 0x0202;
|
|
|
|
|
|
|
|
WORD dataSegment;
|
|
|
|
WORD stackSegment;
|
|
|
|
WORD codeSegment;
|
|
|
|
|
|
|
|
if (ring == Ring0) {
|
|
|
|
codeSegment = 0x08;
|
|
|
|
dataSegment = 0x10;
|
|
|
|
stackSegment = dataSegment;
|
|
|
|
} else {
|
|
|
|
codeSegment = 0x1b;
|
|
|
|
dataSegment = 0x23;
|
|
|
|
stackSegment = dataSegment;
|
|
|
|
}
|
|
|
|
|
|
|
|
m_tss.ds = dataSegment;
|
|
|
|
m_tss.es = dataSegment;
|
|
|
|
m_tss.fs = dataSegment;
|
|
|
|
m_tss.gs = dataSegment;
|
|
|
|
m_tss.ss = stackSegment;
|
|
|
|
m_tss.cs = codeSegment;
|
|
|
|
|
2018-10-22 09:15:16 +00:00
|
|
|
ASSERT((codeSegment & 3) == (stackSegment & 3));
|
|
|
|
|
2018-10-17 21:13:55 +00:00
|
|
|
m_tss.cr3 = MemoryManager::the().pageDirectoryBase().get();
|
|
|
|
|
2018-10-18 11:05:00 +00:00
|
|
|
if (isRing0()) {
|
|
|
|
m_tss.eip = (DWORD)m_entry;
|
|
|
|
} else {
|
2018-10-18 12:53:00 +00:00
|
|
|
m_tss.eip = codeRegion->linearAddress.get();
|
2018-10-18 11:05:00 +00:00
|
|
|
}
|
|
|
|
|
2018-10-18 12:53:00 +00:00
|
|
|
if (isRing0()) {
|
|
|
|
// FIXME: This memory is leaked.
|
|
|
|
// But uh, there's also no kernel task termination, so I guess it's not technically leaked...
|
2018-10-22 09:15:16 +00:00
|
|
|
|
2018-10-19 09:28:43 +00:00
|
|
|
dword stackBottom = (dword)kmalloc(defaultStackSize);
|
|
|
|
m_stackTop = (stackBottom + defaultStackSize) & 0xffffff8;
|
2018-10-18 12:53:00 +00:00
|
|
|
m_tss.esp = m_stackTop;
|
|
|
|
} else {
|
|
|
|
auto* region = allocateRegion(defaultStackSize, "stack");
|
|
|
|
ASSERT(region);
|
|
|
|
m_stackTop = region->linearAddress.offset(defaultStackSize).get() & 0xfffffff8;
|
|
|
|
m_tss.esp = m_stackTop;
|
|
|
|
}
|
2018-10-16 09:01:38 +00:00
|
|
|
|
|
|
|
if (ring == Ring3) {
|
|
|
|
// Set up a separate stack for Ring0.
|
|
|
|
// FIXME: Don't leak this stack either.
|
2018-10-18 12:53:00 +00:00
|
|
|
m_kernelStack = kmalloc(defaultStackSize);
|
|
|
|
DWORD ring0StackTop = ((DWORD)m_kernelStack + defaultStackSize) & 0xffffff8;
|
2018-10-16 09:01:38 +00:00
|
|
|
m_tss.ss0 = 0x10;
|
|
|
|
m_tss.esp0 = ring0StackTop;
|
|
|
|
}
|
|
|
|
|
|
|
|
// HACK: Ring2 SS in the TSS is the current PID.
|
|
|
|
m_tss.ss2 = m_pid;
|
|
|
|
|
2018-10-16 09:06:35 +00:00
|
|
|
m_farPtr.offset = 0x12345678;
|
2018-10-16 09:01:38 +00:00
|
|
|
|
|
|
|
// Don't add task 0 (kernel dummy task) to task list.
|
|
|
|
// FIXME: This doesn't belong in the constructor.
|
|
|
|
if (m_pid == 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
// Add it to head of task list (meaning it's next to run too, ATM.)
|
|
|
|
s_tasks->prepend(this);
|
|
|
|
|
|
|
|
system.nprocess++;
|
2018-10-23 22:20:34 +00:00
|
|
|
#ifdef TASK_DEBUG
|
2018-10-18 11:05:00 +00:00
|
|
|
kprintf("Task %u (%s) spawned @ %p\n", m_pid, m_name.characters(), m_tss.eip);
|
2018-10-23 22:20:34 +00:00
|
|
|
#endif
|
2018-10-16 09:01:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Task::~Task()
|
|
|
|
{
|
2018-10-17 22:26:30 +00:00
|
|
|
system.nprocess--;
|
2018-10-16 09:01:38 +00:00
|
|
|
delete [] m_ldtEntries;
|
|
|
|
m_ldtEntries = nullptr;
|
2018-10-18 12:53:00 +00:00
|
|
|
|
|
|
|
if (m_kernelStack) {
|
|
|
|
kfree(m_kernelStack);
|
|
|
|
m_kernelStack = nullptr;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
void Task::dumpRegions()
|
|
|
|
{
|
|
|
|
kprintf("Task %s(%u) regions:\n", name().characters(), pid());
|
|
|
|
kprintf("BEGIN END SIZE NAME\n");
|
|
|
|
for (auto& region : m_regions) {
|
|
|
|
kprintf("%x -- %x %x %s\n",
|
|
|
|
region->linearAddress.get(),
|
|
|
|
region->linearAddress.offset(region->size - 1).get(),
|
|
|
|
region->size,
|
|
|
|
region->name.characters());
|
|
|
|
}
|
2018-10-16 09:01:38 +00:00
|
|
|
}
|
|
|
|
|
2018-10-22 09:43:55 +00:00
|
|
|
void Task::sys$exit(int status)
|
|
|
|
{
|
|
|
|
cli();
|
2018-10-23 22:20:34 +00:00
|
|
|
#ifdef TASK_DEBUG
|
2018-10-22 09:43:55 +00:00
|
|
|
kprintf("sys$exit: %s(%u) exit with status %d\n", name().characters(), pid(), status);
|
2018-10-23 22:20:34 +00:00
|
|
|
#endif
|
2018-10-22 09:43:55 +00:00
|
|
|
|
|
|
|
setState(Exiting);
|
|
|
|
|
2018-10-23 13:19:02 +00:00
|
|
|
MemoryManager::the().unmapRegionsForTask(*this);
|
|
|
|
|
2018-10-22 09:43:55 +00:00
|
|
|
s_tasks->remove(this);
|
|
|
|
|
|
|
|
if (!scheduleNewTask()) {
|
|
|
|
kprintf("Task::taskDidCrash: Failed to schedule a new task :(\n");
|
|
|
|
HANG;
|
|
|
|
}
|
|
|
|
|
2018-10-23 13:41:55 +00:00
|
|
|
s_deadTasks->append(this);
|
2018-10-22 09:43:55 +00:00
|
|
|
|
|
|
|
switchNow();
|
|
|
|
}
|
|
|
|
|
2018-10-17 22:26:30 +00:00
|
|
|
void Task::taskDidCrash(Task* crashedTask)
|
|
|
|
{
|
2018-10-19 09:28:43 +00:00
|
|
|
// NOTE: This is called from an excepton handler, so interrupts are disabled.
|
2018-10-17 22:26:30 +00:00
|
|
|
crashedTask->setState(Crashing);
|
2018-10-23 13:19:02 +00:00
|
|
|
crashedTask->dumpRegions();
|
2018-10-18 12:53:00 +00:00
|
|
|
|
2018-10-17 22:26:30 +00:00
|
|
|
s_tasks->remove(crashedTask);
|
|
|
|
|
2018-10-23 08:12:50 +00:00
|
|
|
MemoryManager::the().unmapRegionsForTask(*crashedTask);
|
|
|
|
|
2018-10-17 22:26:30 +00:00
|
|
|
if (!scheduleNewTask()) {
|
|
|
|
kprintf("Task::taskDidCrash: Failed to schedule a new task :(\n");
|
|
|
|
HANG;
|
|
|
|
}
|
|
|
|
|
2018-10-23 13:41:55 +00:00
|
|
|
s_deadTasks->append(crashedTask);
|
2018-10-17 22:26:30 +00:00
|
|
|
|
|
|
|
switchNow();
|
|
|
|
}
|
|
|
|
|
2018-10-23 13:41:55 +00:00
|
|
|
void Task::doHouseKeeping()
|
|
|
|
{
|
|
|
|
Task* next = nullptr;
|
|
|
|
for (auto* deadTask = s_deadTasks->head(); deadTask; deadTask = next) {
|
|
|
|
next = deadTask->next();
|
|
|
|
delete deadTask;
|
|
|
|
}
|
|
|
|
s_deadTasks->clear();
|
|
|
|
}
|
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
void yield()
|
|
|
|
{
|
|
|
|
if (!current) {
|
|
|
|
kprintf( "PANIC: yield() with !current" );
|
|
|
|
HANG;
|
|
|
|
}
|
|
|
|
|
2018-10-16 09:06:35 +00:00
|
|
|
//kprintf("%s<%u> yield()\n", current->name().characters(), current->pid());
|
|
|
|
|
2018-10-24 09:07:53 +00:00
|
|
|
InterruptDisabler disabler;
|
|
|
|
if (!scheduleNewTask())
|
2018-10-16 09:06:35 +00:00
|
|
|
return;
|
|
|
|
|
2018-10-17 21:49:32 +00:00
|
|
|
//kprintf("yield() jumping to new task: %x (%s)\n", current->farPtr().selector, current->name().characters());
|
|
|
|
switchNow();
|
|
|
|
}
|
|
|
|
|
|
|
|
void switchNow()
|
|
|
|
{
|
2018-10-16 09:06:35 +00:00
|
|
|
Descriptor& descriptor = getGDTEntry(current->selector());
|
|
|
|
descriptor.type = 9;
|
|
|
|
flushGDT();
|
2018-10-19 09:28:43 +00:00
|
|
|
asm("sti\n"
|
2018-10-16 09:06:35 +00:00
|
|
|
"ljmp *(%%eax)\n"
|
|
|
|
::"a"(¤t->farPtr())
|
|
|
|
);
|
2018-10-16 09:01:38 +00:00
|
|
|
}
|
|
|
|
|
2018-10-16 09:06:35 +00:00
|
|
|
bool scheduleNewTask()
|
2018-10-16 09:01:38 +00:00
|
|
|
{
|
|
|
|
if (!current) {
|
|
|
|
// XXX: The first ever context_switch() goes to the idle task.
|
|
|
|
// This to setup a reliable place we can return to.
|
2018-10-16 09:06:35 +00:00
|
|
|
return contextSwitch(Task::kernelTask());
|
2018-10-16 09:01:38 +00:00
|
|
|
}
|
|
|
|
|
2018-10-22 09:15:16 +00:00
|
|
|
#if 0
|
|
|
|
kprintf("Scheduler choices:\n");
|
|
|
|
for (auto* task = s_tasks->head(); task; task = task->next()) {
|
|
|
|
kprintf("%p %u %s\n", task, task->pid(), task->name().characters());
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
// Check and unblock tasks whose wait conditions have been met.
|
|
|
|
for (auto* task = s_tasks->head(); task; task = task->next()) {
|
|
|
|
if (task->state() == Task::BlockedReceive && (task->ipc.msg.isValid() || task->ipc.notifies)) {
|
|
|
|
task->unblock();
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (task->state() == Task::BlockedSend) {
|
|
|
|
Task* peer = Task::fromIPCHandle(task->ipc.dst);
|
|
|
|
if (peer && peer->state() == Task::BlockedReceive && peer->acceptsMessageFrom(*task)) {
|
|
|
|
task->unblock();
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (task->state() == Task::BlockedSleep) {
|
|
|
|
if (task->wakeupTime() <= system.uptime) {
|
|
|
|
task->unblock();
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
2018-10-23 22:20:34 +00:00
|
|
|
|
|
|
|
if (task->state() == Task::BlockedWait) {
|
|
|
|
if (!Task::fromPID(task->waitee())) {
|
|
|
|
task->unblock();
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
2018-10-16 09:01:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
auto* prevHead = s_tasks->head();
|
|
|
|
for (;;) {
|
|
|
|
// Move head to tail.
|
|
|
|
s_tasks->append(s_tasks->removeHead());
|
|
|
|
auto* task = s_tasks->head();
|
|
|
|
|
|
|
|
if (task->state() == Task::Runnable || task->state() == Task::Running) {
|
2018-10-22 09:15:16 +00:00
|
|
|
//kprintf("switch to %s (%p vs %p)\n", task->name().characters(), task, current);
|
2018-10-16 09:06:35 +00:00
|
|
|
return contextSwitch(task);
|
2018-10-16 09:01:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
if (task == prevHead) {
|
|
|
|
// Back at task_head, nothing wants to run.
|
2018-10-23 23:02:55 +00:00
|
|
|
kprintf("Nothing wants to run!\n");
|
|
|
|
kprintf("PID OWNER STATE NSCHED NAME\n");
|
|
|
|
for (auto* task = s_tasks->head(); task; task = task->next()) {
|
|
|
|
kprintf("%w %w:%w %b %w %s\n",
|
|
|
|
task->pid(),
|
|
|
|
task->uid(),
|
|
|
|
task->gid(),
|
|
|
|
task->state(),
|
|
|
|
task->timesScheduled(),
|
|
|
|
task->name().characters());
|
|
|
|
}
|
2018-10-22 09:15:16 +00:00
|
|
|
kprintf("Switch to kernel task\n");
|
2018-10-16 09:06:35 +00:00
|
|
|
return contextSwitch(Task::kernelTask());
|
2018-10-16 09:01:38 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-10-16 09:06:35 +00:00
|
|
|
static bool contextSwitch(Task* t)
|
2018-10-16 09:01:38 +00:00
|
|
|
{
|
2018-10-16 09:06:35 +00:00
|
|
|
//kprintf("c_s to %s (same:%u)\n", t->name().characters(), current == t);
|
2018-10-16 09:01:38 +00:00
|
|
|
t->setTicksLeft(5);
|
|
|
|
|
2018-10-16 09:06:35 +00:00
|
|
|
if (current == t)
|
|
|
|
return false;
|
|
|
|
|
2018-10-22 09:15:16 +00:00
|
|
|
// Some sanity checking to force a crash earlier.
|
|
|
|
auto csRPL = t->tss().cs & 3;
|
|
|
|
auto ssRPL = t->tss().ss & 3;
|
2018-10-23 08:12:50 +00:00
|
|
|
|
|
|
|
if (csRPL != ssRPL) {
|
|
|
|
kprintf("Fuckup! Switching from %s(%u) to %s(%u) has RPL mismatch\n",
|
|
|
|
current->name().characters(), current->pid(),
|
|
|
|
t->name().characters(), t->pid()
|
|
|
|
);
|
|
|
|
kprintf("code: %w:%x\n", t->tss().cs, t->tss().eip);
|
|
|
|
kprintf(" stk: %w:%x\n", t->tss().ss, t->tss().esp);
|
|
|
|
ASSERT(csRPL == ssRPL);
|
|
|
|
}
|
2018-10-22 09:15:16 +00:00
|
|
|
|
2018-10-21 19:57:43 +00:00
|
|
|
if (current) {
|
|
|
|
// If the last task hasn't blocked (still marked as running),
|
|
|
|
// mark it as runnable for the next round.
|
|
|
|
if (current->state() == Task::Running)
|
|
|
|
current->setState(Task::Runnable);
|
2018-10-16 09:01:38 +00:00
|
|
|
|
2018-10-21 19:57:43 +00:00
|
|
|
bool success = MemoryManager::the().unmapRegionsForTask(*current);
|
|
|
|
ASSERT(success);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool success = MemoryManager::the().mapRegionsForTask(*t);
|
2018-10-18 11:05:00 +00:00
|
|
|
ASSERT(success);
|
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
current = t;
|
|
|
|
t->setState(Task::Running);
|
|
|
|
|
2018-10-16 09:06:35 +00:00
|
|
|
if (!t->selector())
|
2018-10-16 09:01:38 +00:00
|
|
|
t->setSelector(allocateGDTEntry());
|
|
|
|
|
2018-10-16 09:06:35 +00:00
|
|
|
auto& tssDescriptor = getGDTEntry(t->selector());
|
|
|
|
|
|
|
|
tssDescriptor.limit_hi = 0;
|
|
|
|
tssDescriptor.limit_lo = 0xFFFF;
|
|
|
|
tssDescriptor.base_lo = (DWORD)(&t->tss()) & 0xFFFF;
|
|
|
|
tssDescriptor.base_hi = ((DWORD)(&t->tss()) >> 16) & 0xFF;
|
|
|
|
tssDescriptor.base_hi2 = ((DWORD)(&t->tss()) >> 24) & 0xFF;
|
|
|
|
tssDescriptor.dpl = 0;
|
|
|
|
tssDescriptor.segment_present = 1;
|
|
|
|
tssDescriptor.granularity = 1;
|
|
|
|
tssDescriptor.zero = 0;
|
|
|
|
tssDescriptor.operation_size = 1;
|
|
|
|
tssDescriptor.descriptor_type = 0;
|
|
|
|
tssDescriptor.type = 11; // Busy TSS
|
2018-10-16 09:01:38 +00:00
|
|
|
|
2018-10-16 09:06:35 +00:00
|
|
|
flushGDT();
|
2018-10-22 09:15:16 +00:00
|
|
|
|
|
|
|
t->didSchedule();
|
2018-10-16 09:06:35 +00:00
|
|
|
return true;
|
2018-10-16 09:01:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
Task* Task::fromPID(pid_t pid)
|
|
|
|
{
|
|
|
|
for (auto* task = s_tasks->head(); task; task = task->next()) {
|
|
|
|
if (task->pid() == pid)
|
|
|
|
return task;
|
|
|
|
}
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
Task* Task::fromIPCHandle(IPC::Handle handle)
|
|
|
|
{
|
|
|
|
for (auto* task = s_tasks->head(); task; task = task->next()) {
|
|
|
|
if (task->handle() == handle)
|
|
|
|
return task;
|
|
|
|
}
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
|
|
|
FileHandle* Task::fileHandleIfExists(int fd)
|
|
|
|
{
|
|
|
|
if (fd < 0)
|
|
|
|
return nullptr;
|
|
|
|
if ((unsigned)fd < m_fileHandles.size())
|
2018-10-18 08:28:09 +00:00
|
|
|
return m_fileHandles[fd].ptr();
|
2018-10-16 09:01:38 +00:00
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
|
2018-10-24 10:43:52 +00:00
|
|
|
ssize_t Task::sys$get_dir_entries(int fd, void* buffer, size_t size)
|
|
|
|
{
|
|
|
|
auto* handle = fileHandleIfExists(fd);
|
|
|
|
if (!handle)
|
|
|
|
return -1;
|
|
|
|
return handle->get_dir_entries((byte*)buffer, size);
|
|
|
|
}
|
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
int Task::sys$seek(int fd, int offset)
|
|
|
|
{
|
2018-10-18 08:28:09 +00:00
|
|
|
auto* handle = fileHandleIfExists(fd);
|
2018-10-16 09:01:38 +00:00
|
|
|
if (!handle)
|
|
|
|
return -1;
|
2018-10-18 08:28:09 +00:00
|
|
|
return handle->seek(offset, SEEK_SET);
|
2018-10-16 09:01:38 +00:00
|
|
|
}
|
|
|
|
|
2018-10-18 08:28:09 +00:00
|
|
|
ssize_t Task::sys$read(int fd, void* outbuf, size_t nread)
|
2018-10-16 09:01:38 +00:00
|
|
|
{
|
|
|
|
Task::checkSanity("Task::sys$read");
|
2018-10-23 08:12:50 +00:00
|
|
|
#ifdef DEBUG_IO
|
2018-10-16 09:01:38 +00:00
|
|
|
kprintf("Task::sys$read: called(%d, %p, %u)\n", fd, outbuf, nread);
|
2018-10-23 08:12:50 +00:00
|
|
|
#endif
|
2018-10-18 08:28:09 +00:00
|
|
|
auto* handle = fileHandleIfExists(fd);
|
2018-10-23 08:12:50 +00:00
|
|
|
#ifdef DEBUG_IO
|
2018-10-16 09:01:38 +00:00
|
|
|
kprintf("Task::sys$read: handle=%p\n", handle);
|
2018-10-23 08:12:50 +00:00
|
|
|
#endif
|
2018-10-16 09:01:38 +00:00
|
|
|
if (!handle) {
|
|
|
|
kprintf("Task::sys$read: handle not found :(\n");
|
|
|
|
return -1;
|
|
|
|
}
|
2018-10-23 08:12:50 +00:00
|
|
|
#ifdef DEBUG_IO
|
2018-10-16 09:01:38 +00:00
|
|
|
kprintf("call read on handle=%p\n", handle);
|
2018-10-23 08:12:50 +00:00
|
|
|
#endif
|
2018-10-18 08:28:09 +00:00
|
|
|
nread = handle->read((byte*)outbuf, nread);
|
2018-10-23 08:12:50 +00:00
|
|
|
#ifdef DEBUG_IO
|
2018-10-16 09:01:38 +00:00
|
|
|
kprintf("Task::sys$read: nread=%u\n", nread);
|
2018-10-23 08:12:50 +00:00
|
|
|
#endif
|
2018-10-16 09:01:38 +00:00
|
|
|
return nread;
|
|
|
|
}
|
|
|
|
|
|
|
|
int Task::sys$close(int fd)
|
|
|
|
{
|
2018-10-18 08:28:09 +00:00
|
|
|
auto* handle = fileHandleIfExists(fd);
|
2018-10-16 09:01:38 +00:00
|
|
|
if (!handle)
|
|
|
|
return -1;
|
2018-10-18 08:28:09 +00:00
|
|
|
// FIXME: Implement.
|
2018-10-16 09:01:38 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
int Task::sys$open(const char* path, size_t pathLength)
|
|
|
|
{
|
|
|
|
Task::checkSanity("sys$open");
|
2018-10-23 08:12:50 +00:00
|
|
|
#ifdef DEBUG_IO
|
2018-10-16 09:01:38 +00:00
|
|
|
kprintf("Task::sys$open(): PID=%u, path=%s {%u}\n", m_pid, path, pathLength);
|
2018-10-23 08:12:50 +00:00
|
|
|
#endif
|
2018-10-16 09:01:38 +00:00
|
|
|
auto* handle = current->openFile(String(path, pathLength));
|
|
|
|
if (handle)
|
|
|
|
return handle->fd();
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
FileHandle* Task::openFile(String&& path)
|
|
|
|
{
|
2018-10-18 08:28:09 +00:00
|
|
|
auto handle = VirtualFileSystem::the().open(move(path));
|
|
|
|
if (!handle) {
|
2018-10-23 09:57:38 +00:00
|
|
|
#ifdef DEBUG_IO
|
2018-10-18 08:28:09 +00:00
|
|
|
kprintf("vfs::open() failed\n");
|
2018-10-23 09:57:38 +00:00
|
|
|
#endif
|
2018-10-16 09:01:38 +00:00
|
|
|
return nullptr;
|
|
|
|
}
|
2018-10-18 08:28:09 +00:00
|
|
|
handle->setFD(m_fileHandles.size());
|
2018-10-23 08:12:50 +00:00
|
|
|
#ifdef DEBUG_IO
|
2018-10-18 08:28:09 +00:00
|
|
|
kprintf("vfs::open() worked! handle=%p, fd=%d\n", handle.ptr(), handle->fd());
|
2018-10-23 08:12:50 +00:00
|
|
|
#endif
|
2018-10-18 08:28:09 +00:00
|
|
|
m_fileHandles.append(move(handle)); // FIXME: allow non-move Vector::append
|
|
|
|
return m_fileHandles.last().ptr();
|
2018-10-16 09:01:38 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
int Task::sys$kill(pid_t pid, int sig)
|
|
|
|
{
|
|
|
|
(void) sig;
|
|
|
|
if (pid == 0) {
|
|
|
|
// FIXME: Send to same-group processes.
|
|
|
|
ASSERT(pid != 0);
|
|
|
|
}
|
|
|
|
if (pid == -1) {
|
|
|
|
// FIXME: Send to all processes.
|
|
|
|
ASSERT(pid != -1);
|
|
|
|
}
|
|
|
|
ASSERT_NOT_REACHED();
|
|
|
|
Task* peer = Task::fromPID(pid);
|
|
|
|
if (!peer) {
|
|
|
|
// errno = ESRCH;
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
#if 0
|
|
|
|
send(peer->handle(), IPC::Message(SYS_KILL, DataBuffer::copy((BYTE*)&sig, sizeof(sig))));
|
|
|
|
IPC::Message response = receive(peer->handle());
|
|
|
|
return *(int*)response.data();
|
|
|
|
#endif
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
uid_t Task::sys$getuid()
|
|
|
|
{
|
|
|
|
return m_uid;
|
|
|
|
}
|
|
|
|
|
2018-10-22 11:55:11 +00:00
|
|
|
gid_t Task::sys$getgid()
|
|
|
|
{
|
|
|
|
return m_gid;
|
|
|
|
}
|
|
|
|
|
|
|
|
pid_t Task::sys$getpid()
|
|
|
|
{
|
|
|
|
return m_pid;
|
|
|
|
}
|
|
|
|
|
2018-10-23 22:20:34 +00:00
|
|
|
pid_t Task::sys$waitpid(pid_t waitee)
|
|
|
|
{
|
|
|
|
if (!Task::fromPID(waitee))
|
|
|
|
return -1;
|
|
|
|
m_waitee = waitee;
|
|
|
|
block(BlockedWait);
|
|
|
|
yield();
|
|
|
|
return m_waitee;
|
|
|
|
}
|
|
|
|
|
2018-10-16 09:01:38 +00:00
|
|
|
bool Task::acceptsMessageFrom(Task& peer)
|
|
|
|
{
|
|
|
|
return !ipc.msg.isValid() && (ipc.src == IPC::Handle::Any || ipc.src == peer.handle());
|
|
|
|
}
|
|
|
|
|
|
|
|
void Task::unblock()
|
|
|
|
{
|
|
|
|
ASSERT(m_state != Task::Runnable && m_state != Task::Running);
|
|
|
|
system.nblocked--;
|
|
|
|
m_state = Task::Runnable;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Task::block(Task::State state)
|
|
|
|
{
|
|
|
|
ASSERT(current->state() == Task::Running);
|
|
|
|
system.nblocked++;
|
|
|
|
current->setState(state);
|
|
|
|
}
|
|
|
|
|
|
|
|
void block(Task::State state)
|
|
|
|
{
|
|
|
|
current->block(state);
|
|
|
|
yield();
|
|
|
|
}
|
|
|
|
|
|
|
|
void sleep(DWORD ticks)
|
|
|
|
{
|
|
|
|
ASSERT(current->state() == Task::Running);
|
|
|
|
current->setWakeupTime(system.uptime + ticks);
|
|
|
|
current->block(Task::BlockedSleep);
|
|
|
|
yield();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Task::sys$sleep(DWORD ticks)
|
|
|
|
{
|
|
|
|
ASSERT(this == current);
|
|
|
|
sleep(ticks);
|
|
|
|
}
|
|
|
|
|
|
|
|
Task* Task::kernelTask()
|
|
|
|
{
|
|
|
|
ASSERT(s_kernelTask);
|
|
|
|
return s_kernelTask;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Task::setError(int error)
|
|
|
|
{
|
|
|
|
m_error = error;
|
|
|
|
}
|
2018-10-18 12:53:00 +00:00
|
|
|
|
|
|
|
Task::Region::Region(LinearAddress a, size_t s, RetainPtr<Zone>&& z, String&& n)
|
|
|
|
: linearAddress(a)
|
|
|
|
, size(s)
|
|
|
|
, zone(move(z))
|
|
|
|
, name(move(n))
|
|
|
|
{
|
|
|
|
}
|
|
|
|
|
|
|
|
Task::Region::~Region()
|
|
|
|
{
|
|
|
|
}
|