1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
#ifndef SCHEDULER_H
#define SCHEDULER_H
#include <fs/ext2.h>
#include <fs/vfs.h>
#include <halts.h>
#include <ipc.h>
#include <mmu.h>
#include <signal.h>
#include <stdbool.h>
#define MAX_PATH 256
#define KEYBOARD_HALT 0
#define WAIT_CHILD_HALT 1
int fork(void);
int exec(const char *filename, char **argv);
void switch_task();
void tasking_init(void);
void exit(int status);
void *mmap(void *addr, size_t length, int prot, int flags, int fd,
size_t offset);
int munmap(void *addr, size_t length);
int msync(void *addr, size_t length, int flags);
int kill(pid_t pid, int sig);
void set_signal_handler(int sig, void (*handler)(int));
typedef struct {
void *u_address;
void *k_address;
u32 length;
int fd;
} MemoryMap;
typedef struct Process process_t;
struct Process {
u32 pid;
char program_name[100];
char current_working_directory[MAX_PATH];
u32 eip, esp, ebp;
u8 incoming_signal;
u32 signal_handler_stack;
void *signal_handlers[20];
PageDirectory *cr3;
struct IpcMailbox ipc_mailbox;
vfs_fd_t *file_descriptors[100];
vfs_inode_t *read_halt_inode[100];
vfs_inode_t *write_halt_inode[100];
vfs_inode_t *disconnect_halt_inode[100];
u32 halts[2];
struct Halt *halt_list;
void *data_segment_end;
process_t *next;
process_t *parent;
// TODO: Create a linkedlist of childs so that the parent process
// can do stuff such as reap zombies and get status.
process_t *child;
MemoryMap *maps[100];
u32 sleep_until;
int child_rc;
int dead;
};
bool get_task_from_pid(u32 pid, process_t **out);
process_t *get_current_task(void);
int get_free_fd(process_t *p, int allocate);
void free_process(void);
#endif
|
