toaruos/kernel/sys/syscall.c

291 lines
6.4 KiB
C

/* vim: tabstop=4 shiftwidth=4 noexpandtab
*
* Syscall Tables
*
*/
#include <system.h>
#include <syscall.h>
#include <process.h>
#include <logging.h>
#define SPECIAL_CASE_STDIO
/*
* System calls themselves
*/
void validate(void * ptr) {
if (ptr && (uintptr_t)ptr < current_process->image.entry) {
kprintf("SEGFAULT: Invalid pointer passed to syscall. (0x%x < 0x%x)\n", (uintptr_t)ptr, current_process->image.entry);
HALT_AND_CATCH_FIRE("Segmentation fault", NULL);
}
}
/*
* print something to the core terminal
*/
static int print(char * s) {
validate((void *)s);
ansi_print(s);
return 0;
}
/*
* Exit the current task.
* DOES NOT RETURN!
*/
static int exit(int retval) {
/* Deschedule the current task */
task_exit(retval);
while (1) { };
return retval;
}
static int read(int fd, char * ptr, int len) {
#ifdef SPECIAL_CASE_STDIO
if (fd == 0) {
IRQ_ON;
kgets(ptr, len);
IRQ_OFF;
if (strlen(ptr) < (uint32_t)len) {
int j = strlen(ptr);
ptr[j] = '\n';
ptr[j+1] = '\0';
}
return strlen(ptr);
}
#endif
if (fd >= (int)current_process->fds.length || fd < 0) {
return -1;
}
validate(ptr);
fs_node_t * node = current_process->fds.entries[fd];
uint32_t out = read_fs(node, node->offset, len, (uint8_t *)ptr);
node->offset += out;
return out;
}
static int write(int fd, char * ptr, int len) {
#ifdef SPECIAL_CASE_STDIO
if (fd == 1 || fd == 2) {
for (int i = 0; i < len; ++i) {
ansi_put(ptr[i]);
serial_send(ptr[i]);
}
return len;
}
#endif
if (fd >= (int)current_process->fds.length || fd < 0) {
return -1;
}
validate(ptr);
fs_node_t * node = current_process->fds.entries[fd];
uint32_t out = write_fs(node, node->offset, len, (uint8_t *)ptr);
node->offset += out;
return out;
}
static int wait(int child) {
if (child < 1) {
kprintf("lol nope\n");
return 0;
}
process_t * volatile child_task = process_from_pid(child);
/* If the child task doesn't exist, bail */
if (!child_task) return -1;
/* Wait until it finishes (this is stupidly memory intensive,
* but we haven't actually implemented wait() yet, so there's
* not all that much we can do right now. */
while (child_task->finished == 0) {
if (child_task->finished != 0) break;
switch_task();
}
/* Grab the child's return value */
int ret = child_task->status;
delete_process(child_task);
return ret;
}
static int open(const char * file, int flags, int mode) {
validate((void *)file);
fs_node_t * node = kopen((char *)file, 0);
if (!node) {
return -1;
}
node->offset = 0;
return process_append_fd((process_t *)current_process, node);
}
static int close(int fd) {
if (fd <= (int)current_process->fds.length || fd < 0) {
return -1;
}
close_fs(current_process->fds.entries[fd]);
return 0;
}
static int sys_sbrk(int size) {
uintptr_t ret = current_process->image.heap;
current_process->image.heap += size;
while (current_process->image.heap > current_process->image.heap_actual) {
current_process->image.heap_actual += 0x1000;
alloc_frame(get_page(current_process->image.heap_actual, 1, current_directory), 0, 1);
}
return ret;
}
static int execve(const char * filename, char *const argv[], char *const envp[]) {
validate((void *)argv);
validate((void *)filename);
validate((void *)envp);
int i = 0;
while (argv[i]) {
++i;
}
char ** argv_ = malloc(sizeof(char *) * i);
for (int j = 0; j < i; ++j) {
argv_[j] = malloc((strlen(argv[j]) + 1) * sizeof(char));
memcpy(argv_[j], argv[j], strlen(argv[j]) + 1);
}
/* Discard envp */
exec((char *)filename, i, (char **)argv_);
return -1;
}
static int sys_fork() {
uint32_t f = fork();
return f;
}
static int getgraphicsaddress() {
return (int)bochs_get_address();
}
static volatile char kbd_last = 0;
static void kbd_direct_handler(char ch) {
kbd_last = ch;
}
static int kbd_mode(int mode) {
if (mode == 0) {
if (keyboard_direct_handler) {
keyboard_direct_handler = NULL;
}
} else {
keyboard_direct_handler = kbd_direct_handler;
}
return 0;
}
static int kbd_get() {
/* If we're requesting keyboard input, we better damn well be getting it */
IRQ_ON;
char x = kbd_last;
kbd_last = 0;
return (int)x;
}
static int seek(int fd, int offset, int whence) {
if (fd >= (int)current_process->fds.length || fd < 0) {
return -1;
}
if (fd < 3) {
return 0;
}
if (whence == 0) {
current_process->fds.entries[fd]->offset = offset;
} else if (whence == 1) {
current_process->fds.entries[fd]->offset += offset;
} else if (whence == 2) {
current_process->fds.entries[fd]->offset = current_process->fds.entries[fd]->length + offset;
}
return current_process->fds.entries[fd]->offset;
}
static int stat(int fd, uint32_t * st) {
return 0;
}
static int setgraphicsoffset(int rows) {
bochs_set_y_offset(rows);
return 0;
}
static int getgraphicswidth() {
return bochs_resolution_x;
}
static int getgraphicsheight() {
return bochs_resolution_y;
}
/*
* System Call Internals
*/
static void syscall_handler(struct regs * r);
static uintptr_t syscalls[] = {
/* System Call Table */
(uintptr_t)&exit, /* 0 */
(uintptr_t)&print,
(uintptr_t)&open,
(uintptr_t)&read,
(uintptr_t)&write, /* 4 */
(uintptr_t)&close,
(uintptr_t)&gettimeofday,
(uintptr_t)&execve,
(uintptr_t)&sys_fork, /* 8 */
(uintptr_t)&getpid,
(uintptr_t)&sys_sbrk,
(uintptr_t)&getgraphicsaddress,
(uintptr_t)&kbd_mode, /* 12 */
(uintptr_t)&kbd_get,
(uintptr_t)&seek,
(uintptr_t)&stat,
(uintptr_t)&setgraphicsoffset, /* 16 */
(uintptr_t)&wait,
(uintptr_t)&getgraphicswidth,
(uintptr_t)&getgraphicsheight,
};
uint32_t num_syscalls = 20;
void
syscalls_install() {
LOG(INFO, "Initializing syscall table with %d functions", num_syscalls);
isrs_install_handler(0x7F, &syscall_handler);
}
void
syscall_handler(
struct regs * r
) {
if (r->eax >= num_syscalls) {
return;
}
uintptr_t location = syscalls[r->eax];
/* In case of a fork, we need to return the PID to the correct place */
volatile uintptr_t stack = current_process->image.stack - KERNEL_STACK_SIZE;
uint32_t ret;
asm volatile (
"push %1\n"
"push %2\n"
"push %3\n"
"push %4\n"
"push %5\n"
"call *%6\n"
"pop %%ebx\n"
"pop %%ebx\n"
"pop %%ebx\n"
"pop %%ebx\n"
"pop %%ebx\n"
: "=a" (ret) : "r" (r->edi), "r" (r->esi), "r" (r->edx), "r" (r->ecx), "r" (r->ebx), "r" (location));
volatile uintptr_t n_stack = current_process->image.stack - KERNEL_STACK_SIZE;
if (n_stack != stack) {
uintptr_t temp = ((uintptr_t)r - stack);
r = (struct regs *)(n_stack + temp);
}
r->eax = ret;
}