60 lines
1.8 KiB
C
60 lines
1.8 KiB
C
#include "kernel/kernel.h"
|
|
#include <kernel/task.h>
|
|
#include <kernel/mem.h>
|
|
|
|
extern uint32_t boot_page_tab[1024];
|
|
extern kernel_ctx_t ctx;
|
|
|
|
//int task_init(task_t *task, uint32_t *img) {
|
|
int task_init(task_t *task, elf_t *elf) {
|
|
|
|
if (!elf) return 0;
|
|
uint8_t *s = (uint8_t *)mmap_find_first_free_block();
|
|
memcpy(s, elf, 0x1000);
|
|
|
|
task->eip = elf->e_entry;
|
|
// Allocate a page for a stack
|
|
task->esp = (uint32_t)mmap_find_first_free_block() + 0x1000;
|
|
// Allocate a page for stdin
|
|
// LATER: Allow for allocating more on demand
|
|
task->stdin = (uint8_t *)mmap_find_first_free_block();
|
|
task->stdin_len = 0;
|
|
|
|
uint32_t *page_dir = mmap_find_first_free_block();
|
|
task->cr3 = (uint32_t)page_dir - KERNEL_VMA;
|
|
uint32_t *page_tab = mmap_find_first_free_block();
|
|
for (int i = 0; i < 1024; i++) {
|
|
// Map kernel to 3GiB
|
|
if (i == 768) page_dir[i] = ((uint32_t)boot_page_tab - KERNEL_VMA) | 7;
|
|
// Map 3.4GiB-4GiB as non-present kernel entries
|
|
else if (i > 768) page_dir[i] = 4;
|
|
// Map remaining entries as non-present u/s
|
|
else page_dir[i] = 6;
|
|
}
|
|
// Map the ELF image to its specified entry
|
|
page_dir[PAGE_DIR_INDEX(elf->e_entry)] = ((uint32_t)page_tab - KERNEL_VMA) | 7;
|
|
page_tab[PAGE_TAB_INDEX(elf->e_entry)] = ((uint32_t)s - KERNEL_VMA) | 7;
|
|
|
|
return 1;
|
|
}
|
|
|
|
void task_sort() {
|
|
if (!ctx.current_task || !ctx.current_task->next) return; // If the list is empty or has only one node
|
|
|
|
task_t* new_head = (task_t *)ctx.current_task->next;
|
|
task_t* temp = new_head;
|
|
|
|
while (temp->next) {
|
|
temp = (task_t *)temp->next;
|
|
}
|
|
|
|
temp->next = (uint32_t *)ctx.current_task;
|
|
ctx.current_task->next = 0;
|
|
ctx.current_task = new_head;
|
|
}
|
|
|
|
void schedule(void) {
|
|
// If there's only one task running
|
|
if (!ctx.current_task->next) return;
|
|
}
|