2018-11-07 21:15:02 +00:00
|
|
|
#include "Scheduler.h"
|
|
|
|
#include "Process.h"
|
|
|
|
#include "system.h"
|
|
|
|
|
2018-11-07 21:24:20 +00:00
|
|
|
//#define LOG_EVERY_CONTEXT_SWITCH
|
2018-11-07 21:15:02 +00:00
|
|
|
//#define SCHEDULER_DEBUG
|
|
|
|
|
|
|
|
static const dword time_slice = 5; // *10 = 50ms
|
|
|
|
|
|
|
|
Process* current;
|
2019-01-25 06:52:44 +00:00
|
|
|
Process* g_last_fpu_process;
|
2018-11-07 21:15:02 +00:00
|
|
|
static Process* s_colonel_process;
|
2019-01-14 13:21:51 +00:00
|
|
|
static bool s_in_yield;
|
2018-11-07 21:15:02 +00:00
|
|
|
|
2018-11-07 22:13:38 +00:00
|
|
|
struct TaskRedirectionData {
|
|
|
|
word selector;
|
|
|
|
TSS32 tss;
|
|
|
|
};
|
|
|
|
static TaskRedirectionData s_redirection;
|
|
|
|
|
2018-11-07 21:15:02 +00:00
|
|
|
bool Scheduler::pick_next()
|
|
|
|
{
|
|
|
|
ASSERT_INTERRUPTS_DISABLED();
|
|
|
|
|
|
|
|
if (!current) {
|
|
|
|
// XXX: The first ever context_switch() goes to the idle process.
|
|
|
|
// This to setup a reliable place we can return to.
|
|
|
|
return context_switch(*s_colonel_process);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check and unblock processes whose wait conditions have been met.
|
|
|
|
Process::for_each([] (auto& process) {
|
|
|
|
if (process.state() == Process::BlockedSleep) {
|
|
|
|
if (process.wakeupTime() <= system.uptime)
|
|
|
|
process.unblock();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (process.state() == Process::BlockedWait) {
|
2018-11-11 14:36:40 +00:00
|
|
|
process.for_each_child([&process] (Process& child) {
|
|
|
|
if (child.state() != Process::Dead)
|
|
|
|
return true;
|
2018-11-28 22:30:06 +00:00
|
|
|
if (process.waitee_pid() == -1 || process.waitee_pid() == child.pid()) {
|
|
|
|
process.m_waitee_pid = child.pid();
|
2018-11-11 14:36:40 +00:00
|
|
|
process.unblock();
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
});
|
2018-11-07 21:15:02 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (process.state() == Process::BlockedRead) {
|
2018-12-02 23:42:48 +00:00
|
|
|
ASSERT(process.m_blocked_fd != -1);
|
2018-11-07 21:15:02 +00:00
|
|
|
// FIXME: Block until the amount of data wanted is available.
|
2019-01-15 23:47:00 +00:00
|
|
|
if (process.m_fds[process.m_blocked_fd].descriptor->can_read(process))
|
2018-11-07 21:15:02 +00:00
|
|
|
process.unblock();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-11-12 00:28:46 +00:00
|
|
|
if (process.state() == Process::BlockedWrite) {
|
|
|
|
ASSERT(process.m_blocked_fd != -1);
|
2019-01-15 08:17:22 +00:00
|
|
|
if (process.m_fds[process.m_blocked_fd].descriptor->can_write(process))
|
2018-11-12 00:28:46 +00:00
|
|
|
process.unblock();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2019-01-15 22:12:20 +00:00
|
|
|
if (process.state() == Process::BlockedSelect) {
|
2019-01-16 16:20:58 +00:00
|
|
|
if (process.wakeup_requested()) {
|
|
|
|
process.m_wakeup_requested = false;
|
|
|
|
process.unblock();
|
|
|
|
return true;
|
|
|
|
}
|
2019-01-15 22:12:20 +00:00
|
|
|
for (int fd : process.m_select_read_fds) {
|
2019-01-15 23:47:00 +00:00
|
|
|
if (process.m_fds[fd].descriptor->can_read(process)) {
|
2019-01-15 22:12:20 +00:00
|
|
|
process.unblock();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (int fd : process.m_select_write_fds) {
|
|
|
|
if (process.m_fds[fd].descriptor->can_write(process)) {
|
|
|
|
process.unblock();
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-11-07 22:21:32 +00:00
|
|
|
if (process.state() == Process::Skip1SchedulerPass) {
|
|
|
|
process.set_state(Process::Skip0SchedulerPasses);
|
2018-11-07 22:13:38 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-11-07 22:21:32 +00:00
|
|
|
if (process.state() == Process::Skip0SchedulerPasses) {
|
2018-11-07 22:13:38 +00:00
|
|
|
process.set_state(Process::Runnable);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2018-11-07 21:24:20 +00:00
|
|
|
if (process.state() == Process::Dead) {
|
2018-11-28 21:01:24 +00:00
|
|
|
if (current != &process && !Process::from_pid(process.ppid())) {
|
|
|
|
auto name = process.name();
|
|
|
|
auto pid = process.pid();
|
|
|
|
auto exit_status = Process::reap(process);
|
2019-01-01 02:56:39 +00:00
|
|
|
dbgprintf("reaped unparented process %s(%u), exit status: %u\n", name.characters(), pid, exit_status);
|
2018-11-28 21:01:24 +00:00
|
|
|
}
|
2018-11-07 21:24:20 +00:00
|
|
|
return true;
|
2018-11-07 22:59:49 +00:00
|
|
|
}
|
2018-11-07 21:15:02 +00:00
|
|
|
|
|
|
|
return true;
|
|
|
|
});
|
|
|
|
|
|
|
|
// Dispatch any pending signals.
|
|
|
|
// FIXME: Do we really need this to be a separate pass over the process list?
|
|
|
|
Process::for_each_not_in_state(Process::Dead, [] (auto& process) {
|
|
|
|
if (!process.has_unmasked_pending_signals())
|
|
|
|
return true;
|
|
|
|
// We know how to interrupt blocked processes, but if they are just executing
|
|
|
|
// at some random point in the kernel, let them continue. They'll be in userspace
|
|
|
|
// sooner or later and we can deliver the signal then.
|
|
|
|
// FIXME: Maybe we could check when returning from a syscall if there's a pending
|
|
|
|
// signal and dispatch it then and there? Would that be doable without the
|
|
|
|
// syscall effectively being "interrupted" despite having completed?
|
|
|
|
if (process.in_kernel() && !process.is_blocked())
|
|
|
|
return true;
|
2018-11-28 22:30:06 +00:00
|
|
|
// NOTE: dispatch_one_pending_signal() may unblock the process.
|
|
|
|
bool was_blocked = process.is_blocked();
|
2018-11-16 20:14:25 +00:00
|
|
|
if (!process.dispatch_one_pending_signal())
|
|
|
|
return true;
|
2018-11-28 22:30:06 +00:00
|
|
|
if (was_blocked) {
|
|
|
|
dbgprintf("Unblock %s(%u) due to signal\n", process.name().characters(), process.pid());
|
2018-11-07 21:15:02 +00:00
|
|
|
process.m_was_interrupted_while_blocked = true;
|
|
|
|
process.unblock();
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
});
|
|
|
|
|
|
|
|
#ifdef SCHEDULER_DEBUG
|
|
|
|
dbgprintf("Scheduler choices:\n");
|
|
|
|
for (auto* process = g_processes->head(); process; process = process->next()) {
|
|
|
|
//if (process->state() == Process::BlockedWait || process->state() == Process::BlockedSleep)
|
|
|
|
// continue;
|
2019-01-16 15:03:50 +00:00
|
|
|
dbgprintf("[K%x] % 12s %s(%u) @ %w:%x\n", process, toString(process->state()), process->name().characters(), process->pid(), process->tss().cs, process->tss().eip);
|
2018-11-07 21:15:02 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
auto* prevHead = g_processes->head();
|
|
|
|
for (;;) {
|
|
|
|
// Move head to tail.
|
2018-12-21 01:10:45 +00:00
|
|
|
g_processes->append(g_processes->remove_head());
|
2018-11-07 21:15:02 +00:00
|
|
|
auto* process = g_processes->head();
|
|
|
|
|
|
|
|
if (process->state() == Process::Runnable || process->state() == Process::Running) {
|
|
|
|
#ifdef SCHEDULER_DEBUG
|
2018-11-07 22:13:38 +00:00
|
|
|
dbgprintf("switch to %s(%u) @ %w:%x\n", process->name().characters(), process->pid(), process->tss().cs, process->tss().eip);
|
2018-11-07 21:15:02 +00:00
|
|
|
#endif
|
|
|
|
return context_switch(*process);
|
|
|
|
}
|
|
|
|
|
|
|
|
if (process == prevHead) {
|
2018-11-07 22:13:38 +00:00
|
|
|
// Back at process_head, nothing wants to run. Send in the colonel!
|
2018-11-07 21:15:02 +00:00
|
|
|
return context_switch(*s_colonel_process);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Scheduler::yield()
|
|
|
|
{
|
2019-01-23 04:05:45 +00:00
|
|
|
InterruptDisabler disabler;
|
2019-01-14 13:21:51 +00:00
|
|
|
ASSERT(!s_in_yield);
|
|
|
|
s_in_yield = true;
|
|
|
|
|
2018-11-07 21:15:02 +00:00
|
|
|
if (!current) {
|
|
|
|
kprintf("PANIC: sched_yield() with !current");
|
|
|
|
HANG;
|
|
|
|
}
|
|
|
|
|
|
|
|
//dbgprintf("%s<%u> yield()\n", current->name().characters(), current->pid());
|
|
|
|
|
2019-01-14 13:21:51 +00:00
|
|
|
if (!pick_next()) {
|
|
|
|
s_in_yield = false;
|
2018-11-07 21:15:02 +00:00
|
|
|
return 1;
|
2019-01-14 13:21:51 +00:00
|
|
|
}
|
2018-11-07 21:15:02 +00:00
|
|
|
|
2019-01-14 13:21:51 +00:00
|
|
|
s_in_yield = false;
|
2018-11-07 21:15:02 +00:00
|
|
|
//dbgprintf("yield() jumping to new process: %x (%s)\n", current->farPtr().selector, current->name().characters());
|
|
|
|
switch_now();
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::pick_next_and_switch_now()
|
|
|
|
{
|
|
|
|
bool someone_wants_to_run = pick_next();
|
|
|
|
ASSERT(someone_wants_to_run);
|
|
|
|
switch_now();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::switch_now()
|
|
|
|
{
|
2018-12-02 23:39:25 +00:00
|
|
|
Descriptor& descriptor = get_gdt_entry(current->selector());
|
2018-11-07 21:15:02 +00:00
|
|
|
descriptor.type = 9;
|
2018-12-02 23:39:25 +00:00
|
|
|
flush_gdt();
|
2018-11-07 21:15:02 +00:00
|
|
|
asm("sti\n"
|
|
|
|
"ljmp *(%%eax)\n"
|
|
|
|
::"a"(¤t->farPtr())
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Scheduler::context_switch(Process& process)
|
|
|
|
{
|
|
|
|
process.set_ticks_left(time_slice);
|
|
|
|
process.did_schedule();
|
|
|
|
|
2018-12-03 00:12:26 +00:00
|
|
|
if (process.tss().cs & 3) {
|
|
|
|
++process.m_ticks_in_user;
|
|
|
|
} else {
|
|
|
|
++process.m_ticks_in_kernel;
|
|
|
|
}
|
|
|
|
|
2018-11-07 21:15:02 +00:00
|
|
|
if (current == &process)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
if (current) {
|
|
|
|
// If the last process hasn't blocked (still marked as running),
|
|
|
|
// mark it as runnable for the next round.
|
|
|
|
if (current->state() == Process::Running)
|
|
|
|
current->set_state(Process::Runnable);
|
2018-11-07 21:24:20 +00:00
|
|
|
|
|
|
|
#ifdef LOG_EVERY_CONTEXT_SWITCH
|
|
|
|
dbgprintf("Scheduler: %s(%u) -> %s(%u)\n", current->name().characters(), current->pid(), process.name().characters(), process.pid());
|
|
|
|
#endif
|
2018-11-07 21:15:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
current = &process;
|
|
|
|
process.set_state(Process::Running);
|
|
|
|
|
|
|
|
#ifdef COOL_GLOBALS
|
|
|
|
g_cool_globals->current_pid = process.pid();
|
|
|
|
#endif
|
|
|
|
|
|
|
|
if (!process.selector()) {
|
|
|
|
process.setSelector(gdt_alloc_entry());
|
2018-12-02 23:39:25 +00:00
|
|
|
auto& descriptor = get_gdt_entry(process.selector());
|
2018-11-07 21:15:02 +00:00
|
|
|
descriptor.setBase(&process.tss());
|
|
|
|
descriptor.setLimit(0xffff);
|
|
|
|
descriptor.dpl = 0;
|
|
|
|
descriptor.segment_present = 1;
|
|
|
|
descriptor.granularity = 1;
|
|
|
|
descriptor.zero = 0;
|
|
|
|
descriptor.operation_size = 1;
|
|
|
|
descriptor.descriptor_type = 0;
|
|
|
|
}
|
|
|
|
|
2018-12-02 23:39:25 +00:00
|
|
|
auto& descriptor = get_gdt_entry(process.selector());
|
2018-11-07 21:15:02 +00:00
|
|
|
descriptor.type = 11; // Busy TSS
|
2018-12-02 23:39:25 +00:00
|
|
|
flush_gdt();
|
2018-11-07 21:15:02 +00:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
int sched_yield()
|
|
|
|
{
|
|
|
|
return Scheduler::yield();
|
|
|
|
}
|
|
|
|
|
2018-11-07 22:13:38 +00:00
|
|
|
static void initialize_redirection()
|
2018-11-07 21:15:02 +00:00
|
|
|
{
|
2018-12-02 23:39:25 +00:00
|
|
|
auto& descriptor = get_gdt_entry(s_redirection.selector);
|
2018-11-07 22:13:38 +00:00
|
|
|
descriptor.setBase(&s_redirection.tss);
|
|
|
|
descriptor.setLimit(0xffff);
|
|
|
|
descriptor.dpl = 0;
|
|
|
|
descriptor.segment_present = 1;
|
|
|
|
descriptor.granularity = 1;
|
|
|
|
descriptor.zero = 0;
|
|
|
|
descriptor.operation_size = 1;
|
|
|
|
descriptor.descriptor_type = 0;
|
|
|
|
descriptor.type = 9;
|
2018-12-02 23:39:25 +00:00
|
|
|
flush_gdt();
|
2018-11-07 21:15:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::prepare_for_iret_to_new_process()
|
|
|
|
{
|
2018-12-02 23:39:25 +00:00
|
|
|
auto& descriptor = get_gdt_entry(s_redirection.selector);
|
2018-11-07 22:13:38 +00:00
|
|
|
descriptor.type = 9;
|
|
|
|
s_redirection.tss.backlink = current->selector();
|
|
|
|
load_task_register(s_redirection.selector);
|
2018-11-07 21:15:02 +00:00
|
|
|
}
|
|
|
|
|
2018-11-07 22:59:49 +00:00
|
|
|
void Scheduler::prepare_to_modify_tss(Process& process)
|
2018-11-07 21:15:02 +00:00
|
|
|
{
|
2018-11-07 22:59:49 +00:00
|
|
|
// This ensures that a currently running process modifying its own TSS
|
|
|
|
// in order to yield() and end up somewhere else doesn't just end up
|
|
|
|
// right after the yield().
|
|
|
|
if (current == &process)
|
|
|
|
load_task_register(s_redirection.selector);
|
2018-11-07 21:15:02 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void Scheduler::initialize()
|
|
|
|
{
|
2018-11-07 22:13:38 +00:00
|
|
|
memset(&s_redirection, 0, sizeof(s_redirection));
|
|
|
|
s_redirection.selector = gdt_alloc_entry();
|
|
|
|
initialize_redirection();
|
2018-12-24 22:10:48 +00:00
|
|
|
s_colonel_process = Process::create_kernel_process("colonel", nullptr);
|
2018-11-07 21:15:02 +00:00
|
|
|
current = nullptr;
|
2019-01-25 06:52:44 +00:00
|
|
|
g_last_fpu_process = nullptr;
|
2019-01-14 13:21:51 +00:00
|
|
|
s_in_yield = false;
|
2018-11-07 22:13:38 +00:00
|
|
|
load_task_register(s_redirection.selector);
|
2018-11-07 21:15:02 +00:00
|
|
|
}
|
2018-11-07 23:24:59 +00:00
|
|
|
|
|
|
|
void Scheduler::timer_tick(RegisterDump& regs)
|
|
|
|
{
|
|
|
|
if (!current)
|
|
|
|
return;
|
|
|
|
|
|
|
|
system.uptime++;
|
|
|
|
|
|
|
|
if (current->tick())
|
|
|
|
return;
|
|
|
|
|
|
|
|
current->tss().gs = regs.gs;
|
|
|
|
current->tss().fs = regs.fs;
|
|
|
|
current->tss().es = regs.es;
|
|
|
|
current->tss().ds = regs.ds;
|
|
|
|
current->tss().edi = regs.edi;
|
|
|
|
current->tss().esi = regs.esi;
|
|
|
|
current->tss().ebp = regs.ebp;
|
|
|
|
current->tss().ebx = regs.ebx;
|
|
|
|
current->tss().edx = regs.edx;
|
|
|
|
current->tss().ecx = regs.ecx;
|
|
|
|
current->tss().eax = regs.eax;
|
|
|
|
current->tss().eip = regs.eip;
|
|
|
|
current->tss().cs = regs.cs;
|
|
|
|
current->tss().eflags = regs.eflags;
|
|
|
|
|
|
|
|
// Compute process stack pointer.
|
|
|
|
// Add 12 for CS, EIP, EFLAGS (interrupt mechanic)
|
|
|
|
current->tss().esp = regs.esp + 12;
|
|
|
|
current->tss().ss = regs.ss;
|
|
|
|
|
|
|
|
if ((current->tss().cs & 3) != 0) {
|
|
|
|
current->tss().ss = regs.ss_if_crossRing;
|
|
|
|
current->tss().esp = regs.esp_if_crossRing;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (!pick_next())
|
|
|
|
return;
|
|
|
|
prepare_for_iret_to_new_process();
|
|
|
|
|
|
|
|
// Set the NT (nested task) flag.
|
|
|
|
asm(
|
|
|
|
"pushf\n"
|
|
|
|
"orl $0x00004000, (%esp)\n"
|
|
|
|
"popf\n"
|
|
|
|
);
|
|
|
|
}
|