53 lines
1015 B
C
53 lines
1015 B
C
|
#include <stddef.h>
|
||
|
|
#include <stdlib.h>
|
||
|
|
|
||
|
|
#include "kernel.h"
|
||
|
|
#include "process.h"
|
||
|
|
|
||
|
|
struct RunQ *
|
||
|
|
RunQ(size_t max_procs)
|
||
|
|
{
|
||
|
|
struct RunQ *runq = malloc(sizeof(struct RunQ));
|
||
|
|
runq->current_proc = NULL;
|
||
|
|
runq->max_procs = max_procs;
|
||
|
|
runq->proc_amount = 0;
|
||
|
|
runq->next_proc_id = 1;
|
||
|
|
|
||
|
|
return runq;
|
||
|
|
}
|
||
|
|
|
||
|
|
void
|
||
|
|
RUNQ_add_process(size_t max_page_accesses,
|
||
|
|
size_t total_pages_owned)
|
||
|
|
{
|
||
|
|
if (runq->proc_amount >= runq->max_procs)
|
||
|
|
return;
|
||
|
|
|
||
|
|
struct Process *new_p = Process(runq->next_proc_id, max_page_accesses, total_pages_owned);
|
||
|
|
|
||
|
|
if (!runq->current_proc) {
|
||
|
|
runq->current_proc = new_p;
|
||
|
|
new_p->next = new_p;
|
||
|
|
new_p->prev = new_p;
|
||
|
|
} else {
|
||
|
|
new_p->next = runq->current_proc;
|
||
|
|
new_p->prev = runq->current_proc->prev;
|
||
|
|
new_p->next->prev = new_p;
|
||
|
|
new_p->prev->next = new_p;
|
||
|
|
runq->current_proc = new_p;
|
||
|
|
}
|
||
|
|
|
||
|
|
runq->proc_amount++;
|
||
|
|
runq->next_proc_id++;
|
||
|
|
}
|
||
|
|
|
||
|
|
|
||
|
|
void
|
||
|
|
KERNEL_page_fault(struct PageTableEntry *pt, size_t page_no)
|
||
|
|
{
|
||
|
|
if (first_free_page) {
|
||
|
|
pt[page_no].ppn = first_free_page->ppn;
|
||
|
|
pt[page_no].p = 1;
|
||
|
|
}
|
||
|
|
}
|