forked from huoyang11/userpro
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathtask.c
More file actions
executable file
·351 lines (285 loc) · 9.34 KB
/
task.c
File metadata and controls
executable file
·351 lines (285 loc) · 9.34 KB
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
#include "task.h"
#include <pthread.h>
#include <signal.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include "timer.h"
// 这个结构体应该是协程的调度器
static struct {
struct task *current; //当前运行的协程
// 执行集合{就绪、睡眠、等待}
rbtree pid_set; // 使用红黑树
queue task_end; // 死亡集合，使用队列
queue task_ready; // 就绪集合，使用队列
struct timer_struct time_run; //定时器
pthread_mutex_t mutex; //当前线程的互斥锁
pthread_t pid; //当前线程的id
} task_context;
static int find_cmp(void *arg, int size) {
rbtree_node *pnode = (rbtree_node *)*((unsigned long *)arg);
struct task *p = GET_STRUCT_START_ADDR(struct task, pid_node, pnode);
int pid = *((int *)(arg + sizeof(pnode)));
if (p->pid > pid) {
return 1;
} else if (p->pid < pid) {
return -1;
}
return 0;
}
static int pid_cmp(rbtree_node *p1, rbtree_node *p2) {
struct task *t1 = GET_STRUCT_START_ADDR(struct task, pid_node, p1);
struct task *t2 = GET_STRUCT_START_ADDR(struct task, pid_node, p2);
if (t1->pid > t2->pid) {
return 1;
} else if (t1->pid < t2->pid) {
return -1;
}
return 0;
}
static void Switch(struct task_ctx *src, struct task_ctx *obj) {
asm volatile(
"movq %%rax,0(%%rdi)\n\t"
"movq %%rbx,8(%%rdi)\n\t"
"movq %%rcx,16(%%rdi)\n\t"
"movq %%rdx,24(%%rdi)\n\t"
"movq %%rdi,32(%%rdi)\n\t"
"movq %%rsi,40(%%rdi)\n\t"
"movq %%rbp,%%rbx\n\t"
"add $16,%%rbx\n\t"
"movq %%rbx,48(%%rdi)\n\t" // save esp
"movq 0(%%rbp),%%rbx\n\t"
"movq %%rbx,56(%%rdi)\n\t" // save ebp
"movq 8(%%rbp),%%rbx\n\t"
"movq %%rbx,64(%%rdi)\n\t" // save eip
"movq 0(%%rsi),%%rax\n\t"
"movq 16(%%rsi),%%rcx\n\t"
"movq 24(%%rsi),%%rdx\n\t"
"movq 48(%%rsi),%%rsp\n\t"
"movq 56(%%rsi),%%rbp\n\t"
"movq 64(%%rsi),%%rbx\n\t"
"pushq %%rbx\n\t" // push eip
"movq 8(%%rsi),%%rbx\n\t"
"movq 32(%%rsi),%%rdi\n\t"
"movq 40(%%rsi),%%rsi\n\t"
"ret\n\t" // pop eip
:
:);
}
// 取消信号
static void cancel_signel() {
sigset_t set;
sigemptyset(&set);
pthread_sigmask(SIG_SETMASK, &set, NULL);
}
//屏蔽信号
//猜测是不关心SIGUSR1信号
static void shield_signel(int sig) {
sigset_t set;
sigemptyset(&set);
sigaddset(&set, sig);
pthread_sigmask(SIG_SETMASK, &set, NULL);
}
static void send_message(void *arg) {
kill(getpid(), SIGUSR1);
pthread_mutex_lock(&task_context.mutex); //调度线程上锁
//回收协程空间
// TODO2 如果有死亡的就释放掉
while (!queue_isempty(&task_context.task_end)) {
struct queue_node *p;
queue_pop(&task_context.task_end, &p);
struct task *pt = GET_STRUCT_START_ADDR(struct task, end_node, p);
// printf("free pid:%d\n",pt->pid);
free(pt->start_addr);
free(pt);
}
pthread_mutex_unlock(&task_context.mutex); //调度线程解锁
}
static void *thread_callback(void *arg) {
shield_signel(SIGUSR1);
run_timer(&task_context.time_run);
}
static void sigusr_schedul(int signum) {
if (signum != SIGUSR1) {
return;
}
// 添加当前的就绪节点到就绪队列
if (task_context.current != NULL) {
queue_push(&task_context.task_ready, &task_context.current->ready_node);
}
//从就绪队列中取节点
struct queue_node *rp = NULL;
queue_pop(&task_context.task_ready, &rp);
struct task *p = GET_STRUCT_START_ADDR(struct task, ready_node, rp);
if (p == task_context.current) {
cancel_signel();
return;
}
struct task *current = task_context.current;
task_context.current = p;
cancel_signel();
//进行协程切换
if (current == NULL) {
struct task tem;
task_switch(&tem, p);
} else {
task_switch(current, p);
}
}
int task_switch(struct task *src, struct task *obj) {
if (src == NULL || obj == NULL) {
return -1;
}
Switch(&(src->ctx), &(obj->ctx));
return 0;
}
void task_exit() {
shield_signel(SIGUSR1);
struct task *current = task_context.current;
current->state = TASK_END;
pthread_mutex_lock(&task_context.mutex);
//协程退出，就放进死亡节点中
queue_push(&task_context.task_end, ¤t->end_node);
pthread_mutex_unlock(&task_context.mutex); // TODO1， 上下文锁在这里释放了
// 删除红黑树节点
rbtree_delete(&task_context.pid_set, ¤t->pid_node);
task_context.current = NULL;
cancel_signel();
while (1)
;
}
int task_init() {
// TODO1 ， 猜测这个锁会伴随这线程整个生命周期
pthread_mutex_init(&task_context.mutex, NULL);
//<< 这里创建，并初始化一个task
struct task *p = (struct task *)malloc(sizeof(struct task));
if (p == NULL) {
return -1;
}
p->pid = 0;
p->state = TASK_RUN;
//>> 之后加入到task_context中
task_context.current = p;
//三大集合初始化
rbtree_init(&task_context.pid_set, pid_cmp); //红黑树
queue_init(&task_context.task_ready); //就绪队列
queue_init(&task_context.task_end); //死亡队列
// 先插入到红黑树集合中
rbtree_insert(&task_context.pid_set, &p->pid_node);
//设置信号，当收到SIGUSR1信号时，就会运行sigusr_schedul
signal(SIGUSR1, sigusr_schedul);
//启动定时器
init_timer(&task_context.time_run, TIME_CYCLE);
add_timer(&task_context.time_run, TASK_TIME, send_message, NULL);
pthread_create(&task_context.pid, NULL, thread_callback, NULL);
return 0;
}
int task_create(void (*start_routine)(void *), void *arg) {
// 这里最主要的两个结构体
// 一个是task
// 另一个是task_context
if (start_routine == NULL) {
return -1;
}
if (task_context.pid_set.cmp != pid_cmp) {
// 如果是第一次，那么先初始化下协程
task_init();
}
static int index = 1;
struct task *p = (struct task *)calloc(1, sizeof(struct task));
if (p == NULL) {
return -2;
}
p->pid = index++;
p->start_routine = start_routine;
p->arg = arg;
p->state = TASK_RUN;
p->ctx.eip = (unsigned long)start_routine;
p->ctx.edi = (unsigned long)arg;
p->start_addr = calloc(1, 10240);
if (p->start_addr == 0) {
return -3;
}
p->ctx.esp = (unsigned long)p->start_addr + 10232;
*((unsigned long *)p->ctx.esp) = (unsigned long)task_exit;
p->ctx.ebp = p->ctx.esp;
shield_signel(SIGUSR1);
rbtree_insert(&task_context.pid_set, &p->pid_node);
//加入到就绪队列中
queue_push(&task_context.task_ready, &p->ready_node);
cancel_signel();
return 0;
}
int task_kill(int pid) {
shield_signel(SIGUSR1);
rbtree_node *pnode =
rbtree_find(&task_context.pid_set, find_cmp, &pid, sizeof(int));
if (pnode == NULL) {
return -1;
}
struct task *p = GET_STRUCT_START_ADDR(struct task, pid_node, pnode);
p->ctx.eip = (unsigned long)task_exit;
p->ctx.esp = p->ctx.ebp;
struct task *current = task_context.current;
cancel_signel();
if (current == p) {
while (1)
;
}
return 0;
}
int task_uninit() {
shield_signel(SIGUSR1);
stop_timer(&task_context.time_run);
pthread_join(task_context.pid, NULL);
uninit_timer(&task_context.time_run);
rbtree_destroy(&task_context.pid_set);
int isfree = 0;
if (task_context.current != NULL) {
struct task *current = task_context.current;
printf("pid:%d\n", current->pid);
if (current->pid != 0) {
free(current->start_addr);
free(current);
} else {
isfree = 1;
free(current);
}
}
//释放死亡节点
while (!queue_isempty(&task_context.task_end)) {
struct queue_node *p;
queue_pop(&task_context.task_end, &p);
struct task *pt = GET_STRUCT_START_ADDR(struct task, end_node, p);
printf("pid:%d\n", pt->pid);
if (pt->pid != 0) {
free(pt->start_addr);
free(pt);
} else {
if (!isfree) {
isfree = 1;
free(pt);
}
}
}
while (!queue_isempty(&task_context.task_ready)) {
struct queue_node *p;
queue_pop(&task_context.task_ready, &p);
struct task *pt = GET_STRUCT_START_ADDR(struct task, ready_node, p);
printf("pid:%d\n", pt->pid);
if (pt->pid != 0) {
free(pt->start_addr);
free(pt);
} else {
if (!isfree) {
isfree = 1;
free(pt);
}
}
}
queue_uninit(&task_context.task_ready);
queue_uninit(&task_context.task_end);
cancel_signel();
return 0;
}