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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
|
#include <worker.h>
#include <btree.h>
#include <mutex.h>
#include <malloc.h>
#include <prng.h>
static uint64_t time = 0;
static uint64_t next_task_time = UINT64_MAX;
static thread_t **workers = 0;
static int nworkers = 0;
static btree_t *tasks = 0;
STATIC_MUTEX(tasks_mutex);
static void worker_thread(void*);
typedef struct {
uint64_t time;
entry_t fun;
void* data;
} worker_task_t;
int uint64_key_cmp_fun(const void* a, const void* b) {
uint64_t *x = (uint64_t*)a, *y = (uint64_t*)b;
return (*x == *y ? 0 : (*x > *y ? 1 : -1));
}
void start_workers(int n) {
ASSERT(n > 0);
workers = (thread_t**)malloc(n * sizeof(thread_t*));
ASSERT(workers != 0);
tasks = create_btree(uint64_key_cmp_fun, 0);
ASSERT(tasks != 0);
nworkers = n;
for (int i = 0; i < n; i++) {
workers[i] = new_thread(worker_thread, 0);
if (workers[i] != 0) {
dbg_printf("New worker thread: 0x%p\n", workers[i]);
start_thread(workers[i]);
}
}
}
void worker_thread(void* x) {
uint64_t zero64 = 0;
while (true) {
mutex_lock(&tasks_mutex);
worker_task_t *next_task = btree_upper(tasks, &zero64, 0);
next_task_time = (next_task == 0 ? UINT64_MAX : next_task->time);
if (next_task != 0 && next_task->time <= time) {
btree_remove_v(tasks, &next_task->time, next_task);
} else {
next_task = 0;
}
mutex_unlock(&tasks_mutex);
if (next_task != 0) {
prng_add_entropy((uint8_t*)&next_task, sizeof(next_task));
// do task :-)
next_task->fun(next_task->data);
free(next_task);
} else {
ASSERT(wait_on(current_thread));
}
}
}
bool worker_push_in(int usecs, entry_t fun, void* data) {
worker_task_t *t = (worker_task_t*)malloc(sizeof(worker_task_t));
if (t == 0) return false;
t->time = time + usecs;
t->fun = fun;
t->data = data;
mutex_lock(&tasks_mutex);
btree_add(tasks, &t->time, t);
if (t->time < next_task_time) next_task_time = t->time;
mutex_unlock(&tasks_mutex);
return true;
}
bool worker_push(entry_t fun, void* data) {
return worker_push_in(0, fun, data);
}
void notify_time_pass(int usecs) {
time += usecs;
if (next_task_time <= time) {
for (int i = 0; i < nworkers; i++) {
if (workers[i] == 0) continue;
if (resume_on(workers[i])) break;
}
}
}
uint64_t get_kernel_time() {
return time;
}
/* vim: set ts=4 sw=4 tw=0 noet :*/
|
