Merge branch 'master' of github.com:Minep/lunaix-os

[lunaix-os.git] / lunaix-os / kernel / sched.c

diff --git a/lunaix-os/kernel/sched.c b/lunaix-os/kernel/sched.c
index 758b157befb68a2b48656ab90f9887067c0f4997..8f65087f8253175f0a2dd2f4f26ab34afd718a4a 100644 (file)
--- a/lunaix-os/kernel/sched.c
+++ b/lunaix-os/kernel/sched.c
@@ -1,16 +1,16 @@
-#include <lunaix/process.h>
-#include <lunaix/sched.h>
-#include <lunaix/mm/vmm.h>
-#include <lunaix/mm/kalloc.h>
-#include <hal/cpu.h>

 #include <arch/x86/interrupts.h>
 #include <arch/x86/tss.h>
 #include <hal/apic.h>
 #include <arch/x86/interrupts.h>
 #include <arch/x86/tss.h>
 #include <hal/apic.h>

+#include <hal/cpu.h>
+#include <lunaix/mm/kalloc.h>
+#include <lunaix/mm/vmm.h>
+#include <lunaix/process.h>
+#include <lunaix/sched.h>

 
 #include <lunaix/spike.h>
 #include <lunaix/status.h>
 
 #include <lunaix/spike.h>
 #include <lunaix/status.h>

-#include <lunaix/syslog.h>

 #include <lunaix/syscall.h>
 #include <lunaix/syscall.h>

+#include <lunaix/syslog.h>

 
 #define MAX_PROCESS 512
 
 
 #define MAX_PROCESS 512
 


@@ -24,26 +24,27 @@ struct scheduler sched_ctx;
 
 LOG_MODULE("SCHED")
 
 
 LOG_MODULE("SCHED")
 

-void sched_init() {
+void
+sched_init()
+{

     size_t pg_size = ROUNDUP(sizeof(struct proc_info) * MAX_PROCESS, 0x1000);
     size_t pg_size = ROUNDUP(sizeof(struct proc_info) * MAX_PROCESS, 0x1000);

-    assert_msg(
-        vmm_alloc_pages(KERNEL_PID, &__proc_table, pg_size, PG_PREM_RW, PP_FGPERSIST), 
-        "Fail to allocate proc table"
-    );
-    
-    sched_ctx = (struct scheduler) {
-        ._procs = (struct proc_info*) &__proc_table,
-        .ptable_len = 0,
-        .procs_index = 0
-    };
+    assert_msg(vmm_alloc_pages(
+                 KERNEL_PID, &__proc_table, pg_size, PG_PREM_RW, PP_FGPERSIST),
+               "Fail to allocate proc table");
+
+    sched_ctx = (struct scheduler){ ._procs = (struct proc_info*)&__proc_table,
+                                    .ptable_len = 0,
+                                    .procs_index = 0 };

 }
 
 }
 

-void run(struct proc_info* proc) {
+void
+run(struct proc_info* proc)
+{

     if (!(__current->state & ~PROC_RUNNING)) {
         __current->state = PROC_STOPPED;
     }
     proc->state = PROC_RUNNING;
     if (!(__current->state & ~PROC_RUNNING)) {
         __current->state = PROC_STOPPED;
     }
     proc->state = PROC_RUNNING;

-    
+

     // FIXME: 这里还是得再考虑一下。
     // tss_update_esp(__current->intr_ctx.esp);
 
     // FIXME: 这里还是得再考虑一下。
     // tss_update_esp(__current->intr_ctx.esp);
 


@@ -51,19 +52,20 @@ void run(struct proc_info* proc) {
         __current = proc;
         cpu_lcr3(__current->page_table);
         // from now on, the we are in the kstack of another process
         __current = proc;
         cpu_lcr3(__current->page_table);
         // from now on, the we are in the kstack of another process

-    }
-    else {
+    } else {

         __current = proc;
     }
 
     apic_done_servicing();
 
         __current = proc;
     }
 
     apic_done_servicing();
 

-    asm volatile (
-        "pushl %0\n"
-        "jmp soft_iret\n"::"r"(&__current->intr_ctx): "memory");
+    asm volatile("pushl %0\n"
+                 "jmp soft_iret\n" ::"r"(&__current->intr_ctx)
+                 : "memory");

 }
 
 }
 

-void schedule() {
+void
+schedule()
+{

     if (!sched_ctx.ptable_len) {
         return;
     }
     if (!sched_ctx.ptable_len) {
         return;
     }


@@ -75,20 +77,22 @@ void schedule() {
     do {
         ptr = (ptr + 1) % sched_ctx.ptable_len;
         next = &sched_ctx._procs[ptr];
     do {
         ptr = (ptr + 1) % sched_ctx.ptable_len;
         next = &sched_ctx._procs[ptr];

-    } while(next->state != PROC_STOPPED && ptr != prev_ptr);
-    
-    sched_ctx.procs_index = ptr;
+    } while (next->state != PROC_STOPPED && ptr != prev_ptr);

 
 

+    sched_ctx.procs_index = ptr;

 
     run(next);
 }
 
 
     run(next);
 }
 

-static void proc_timer_callback(struct proc_info* proc) {
+static void
+proc_timer_callback(struct proc_info* proc)
+{

     proc->timer = NULL;
     proc->state = PROC_STOPPED;
 }
 
     proc->timer = NULL;
     proc->state = PROC_STOPPED;
 }
 

-__DEFINE_LXSYSCALL1(unsigned int, sleep, unsigned int, seconds) {
+__DEFINE_LXSYSCALL1(unsigned int, sleep, unsigned int, seconds)
+{

     // FIXME: sleep的实现或许需要改一下。专门绑一个计时器好像没有必要……
     if (!seconds) {
         return 0;
     // FIXME: sleep的实现或许需要改一下。专门绑一个计时器好像没有必要……
     if (!seconds) {
         return 0;


@@ -97,34 +101,40 @@ __DEFINE_LXSYSCALL1(unsigned int, sleep, unsigned int, seconds) {
         return __current->timer->counter / timer_context()->running_frequency;
     }
 
         return __current->timer->counter / timer_context()->running_frequency;
     }
 

-    struct lx_timer* timer = timer_run_second(seconds, proc_timer_callback, __current, 0);
+    struct lx_timer* timer =
+      timer_run_second(seconds, proc_timer_callback, __current, 0);

     __current->timer = timer;
     __current->intr_ctx.registers.eax = seconds;
     __current->state = PROC_BLOCKED;
     schedule();
 }
 
     __current->timer = timer;
     __current->intr_ctx.registers.eax = seconds;
     __current->state = PROC_BLOCKED;
     schedule();
 }
 

-__DEFINE_LXSYSCALL1(void, exit, int, status) {
+__DEFINE_LXSYSCALL1(void, exit, int, status)
+{

     terminate_proc(status);
 }
 
     terminate_proc(status);
 }
 

-__DEFINE_LXSYSCALL(void, yield) {
+__DEFINE_LXSYSCALL(void, yield)
+{

     schedule();
 }
 
     schedule();
 }
 

-__DEFINE_LXSYSCALL1(pid_t, wait, int*, status) {
+__DEFINE_LXSYSCALL1(pid_t, wait, int*, status)
+{

     pid_t cur = __current->pid;
     struct proc_info *proc, *n;
     if (llist_empty(&__current->children)) {
         return -1;
     }
 repeat:
     pid_t cur = __current->pid;
     struct proc_info *proc, *n;
     if (llist_empty(&__current->children)) {
         return -1;
     }
 repeat:

-    llist_for_each(proc, n, &__current->children, siblings) {
+    llist_for_each(proc, n, &__current->children, siblings)
+    {

         if (proc->state == PROC_TERMNAT) {
             goto done;
         }
     }
         if (proc->state == PROC_TERMNAT) {
             goto done;
         }
     }

-    // FIXME: 除了循环，也许有更高效的办法…… (在这里进行schedule，需要重写context switch!)
+    // FIXME: 除了循环，也许有更高效的办法……
+    // (在这里进行schedule，需要重写context switch!)

     goto repeat;
 
 done:
     goto repeat;
 
 done:


@@ -132,27 +142,34 @@ done:
     return destroy_process(proc->pid);
 }
 
     return destroy_process(proc->pid);
 }
 

-pid_t alloc_pid() {
+pid_t
+alloc_pid()
+{

     pid_t i = 0;
     pid_t i = 0;

-    for (; i < sched_ctx.ptable_len && sched_ctx._procs[i].state != PROC_DESTROY; i++);
+    for (;
+         i < sched_ctx.ptable_len && sched_ctx._procs[i].state != PROC_DESTROY;
+         i++)
+        ;

 
     if (i == MAX_PROCESS) {
 
     if (i == MAX_PROCESS) {

-        panick("Process table is full");
+        panick("Panic in Ponyville shimmer!");

     }
     }

-    return i + 1;
+    return i;

 }
 
 }
 

-void push_process(struct proc_info* process) {
-    int index = process->pid - 1;
+void
+push_process(struct proc_info* process)
+{
+    int index = process->pid;

     if (index < 0 || index > sched_ctx.ptable_len) {
         __current->k_status = LXINVLDPID;
         return;
     }
     if (index < 0 || index > sched_ctx.ptable_len) {
         __current->k_status = LXINVLDPID;
         return;
     }

-    
+

     if (index == sched_ctx.ptable_len) {
         sched_ctx.ptable_len++;
     }
     if (index == sched_ctx.ptable_len) {
         sched_ctx.ptable_len++;
     }

-    
+

     sched_ctx._procs[index] = *process;
 
     process = &sched_ctx._procs[index];
     sched_ctx._procs[index] = *process;
 
     process = &sched_ctx._procs[index];


@@ -162,30 +179,33 @@ void push_process(struct proc_info* process) {
     // every process is the child of first process (pid=1)
     if (process->parent) {
         llist_append(&process->parent->children, &process->siblings);
     // every process is the child of first process (pid=1)
     if (process->parent) {
         llist_append(&process->parent->children, &process->siblings);

-    }
-    else {
+    } else {

         process->parent = &sched_ctx._procs[0];
     }
 
         process->parent = &sched_ctx._procs[0];
     }
 

-    process->state = PROC_STOPPED;    
+    process->state = PROC_STOPPED;

 }
 
 // from <kernel/process.c>
 }
 
 // from <kernel/process.c>

-extern void __del_pagetable(pid_t pid, uintptr_t mount_point);
+extern void
+__del_pagetable(pid_t pid, uintptr_t mount_point);

 
 

-pid_t destroy_process(pid_t pid) {
-    int index = pid - 1;
+pid_t
+destroy_process(pid_t pid)
+{
+    int index = pid;

     if (index <= 0 || index > sched_ctx.ptable_len) {
         __current->k_status = LXINVLDPID;
         return;
     }
     if (index <= 0 || index > sched_ctx.ptable_len) {
         __current->k_status = LXINVLDPID;
         return;
     }

-    struct proc_info *proc = &sched_ctx._procs[index];
+    struct proc_info* proc = &sched_ctx._procs[index];

     proc->state = PROC_DESTROY;
     llist_delete(&proc->siblings);
 
     if (proc->mm.regions) {
         struct mm_region *pos, *n;
     proc->state = PROC_DESTROY;
     llist_delete(&proc->siblings);
 
     if (proc->mm.regions) {
         struct mm_region *pos, *n;

-        llist_for_each(pos, n, &proc->mm.regions->head, head) {
+        llist_for_each(pos, n, &proc->mm.regions->head, head)
+        {

             lxfree(pos);
         }
     }
             lxfree(pos);
         }
     }


@@ -199,27 +219,35 @@ pid_t destroy_process(pid_t pid) {
     return pid;
 }
 
     return pid;
 }
 

-void terminate_proc(int exit_code) {
+void
+terminate_proc(int exit_code)
+{

     __current->state = PROC_TERMNAT;
     __current->exit_code = exit_code;
 
     schedule();
 }
 
     __current->state = PROC_TERMNAT;
     __current->exit_code = exit_code;
 
     schedule();
 }
 

-struct proc_info* get_process(pid_t pid) {
-    int index = pid - 1;
+struct proc_info*
+get_process(pid_t pid)
+{
+    int index = pid;

     if (index < 0 || index > sched_ctx.ptable_len) {
         return NULL;
     }
     return &sched_ctx._procs[index];
 }
 
     if (index < 0 || index > sched_ctx.ptable_len) {
         return NULL;
     }
     return &sched_ctx._procs[index];
 }
 

-int orphaned_proc(pid_t pid) {
-    if(!pid) return 0;
-    if(pid >= sched_ctx.ptable_len) return 0;
-    struct proc_info* proc = &sched_ctx._procs[pid-1];
+int
+orphaned_proc(pid_t pid)
+{
+    if (!pid)
+        return 0;
+    if (pid >= sched_ctx.ptable_len)
+        return 0;
+    struct proc_info* proc = &sched_ctx._procs[pid];

     struct proc_info* parent = proc->parent;
     struct proc_info* parent = proc->parent;

-    
+

     // 如果其父进程的状态是terminated 或 destroy中的一种
     // 或者其父进程是在该进程之后创建的，那么该进程为孤儿进程
     return (parent->state & PROC_TERMMASK) || parent->created > proc->created;
     // 如果其父进程的状态是terminated 或 destroy中的一种
     // 或者其父进程是在该进程之后创建的，那么该进程为孤儿进程
     return (parent->state & PROC_TERMMASK) || parent->created > proc->created;