-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathso_scheduler.c
422 lines (354 loc) · 6.72 KB
/
so_scheduler.c
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
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
/*
* Ciupitu Andrei Valentin
* 332CC
*/
#include <stdio.h>
#include <pthread.h>
#include <semaphore.h>
#include <stdlib.h>
#include "_test/so_scheduler.h"
#include "utils.h"
#define CAPACITY 1000
typedef enum {
BLOCKED,
READY,
RUNNING,
NEW,
TERMINATED
} thread_status;
/**
* Thread struct
*/
typedef struct {
/*
* Thread parameters
*/
tid_t tid;
thread_status status;
unsigned int time_left;
unsigned int priority;
so_handler *handler;
unsigned int device;
/*
* Synchronization stuff
*/
sem_t run;
} thread;
/**
* Scheduler struct
*/
typedef struct {
int initialized;
unsigned int events;
unsigned int quantum;
thread *running;
/*
* Thread queue
*/
unsigned int num_threads;
unsigned int queue_size;
sem_t end;
thread *queue[CAPACITY];
thread *threads[CAPACITY];
} scheduler;
static scheduler s;
static void *thread_routine(void *args);
static void update_scheduler(void);
static void init_thread(thread *t, so_handler *f, unsigned int priority);
static void destroy_thread(thread *t);
static void start_thread(thread *t);
static void register_thread(thread *t);
int so_init(unsigned int time_quantum, unsigned int io)
{
int ret;
/*
* Initialized be zero first cause its global
*/
if (s.initialized)
return -1;
/*
* Parameter check
*/
if (time_quantum <= 0 || io > SO_MAX_NUM_EVENTS)
return -2;
s.initialized = 1;
s.events = io;
s.quantum = time_quantum;
s.num_threads = 0;
s.queue_size = 0;
s.running = NULL;
/*
* Init end sem
*/
ret = sem_init(&s.end, 0, 1);
DIE(ret != 0, "end sem init");
return 0;
}
tid_t so_fork(so_handler *func, unsigned int priority)
{
int ret;
thread *t;
if (func == NULL || priority > SO_MAX_PRIO)
return INVALID_TID;
t = malloc(sizeof(thread));
DIE(t == NULL, "malloc error");
if (s.num_threads == 0) {
ret = sem_wait(&s.end);
DIE(ret != 0, "sem wait");
}
/*
* Init the thread struct
*/
init_thread(t, func, priority);
/*
* Register the new thread
*/
s.threads[s.num_threads++] = t;
register_thread(t);
/*
* Call the scheduler
*/
if (s.running != NULL)
so_exec();
else
update_scheduler();
return t->tid;
}
void so_exec(void)
{
int ret;
thread *t;
t = s.running;
t->time_left--;
/*
* Call the scheduler
*/
update_scheduler();
/*
* Wait if the thread gets preeempted
*/
ret = sem_wait(&t->run);
DIE(ret != 0, "sem_wait");
}
int so_wait(unsigned int io)
{
if (io < 0 || io >= s.events)
return -1;
s.running->status = BLOCKED;
s.running->device = io;
so_exec();
return 0;
}
int so_signal(unsigned int io)
{
int i;
int count;
if (io < 0 || io >= s.events)
return -1;
count = 0;
for (i = 0; i < s.num_threads; i++)
if (s.threads[i]->device == io
&& s.threads[i]->status == BLOCKED) {
s.threads[i]->device = SO_MAX_NUM_EVENTS;
s.threads[i]->status = READY;
register_thread(s.threads[i]);
count++;
}
so_exec();
return count;
}
void so_end(void)
{
int i;
int ret;
if (!s.initialized)
return;
ret = sem_wait(&s.end);
DIE(ret != 0, "sem wait");
/*
* Wait for threads to finish then destroy them
*/
for (i = 0; i < s.num_threads; i++) {
ret = pthread_join(s.threads[i]->tid, NULL);
DIE(ret != 0, "thread join");
}
for (i = 0; i < s.num_threads; i++)
destroy_thread(s.threads[i]);
/*
* Destroy scheduler
*/
s.initialized = 0;
ret = sem_destroy(&s.end);
DIE(ret != 0, "end sem destroy");
}
/**
* @brief Funtion that initializes new threads
*
* @param [in] t Pointer to a thread struct
* @param [in] f Handler executed by the new thread
* @param [in] priority Priority of the new thread
*/
static void init_thread(thread *t, so_handler *f, unsigned int priority)
{
int ret;
t->tid = INVALID_TID;
t->status = NEW;
t->time_left = s.quantum;
t->priority = priority;
t->handler = f;
t->device = SO_MAX_NUM_EVENTS;
/*
* Init semaphore
*/
ret = sem_init(&t->run, 0, 0);
DIE(ret != 0, "sem init");
/*
* Start thread
*/
ret = pthread_create(&t->tid, NULL, &thread_routine, (void *)t);
DIE(ret != 0, "thread create");
}
/**
* @brief Destroys a thread struct and frees memory
*
* @param [in] t Pointer to a thread struct
*/
static void destroy_thread(thread *t)
{
int ret;
ret = sem_destroy(&t->run);
DIE(ret != 0, "sem destroy");
free(t);
}
/**
* @brief Signals a thread to run
*
* @param [in] t Pointer to the thread struct
*/
static void start_thread(thread *t)
{
int ret;
s.queue[--s.queue_size] = NULL;
t->status = RUNNING;
t->time_left = s.quantum;
ret = sem_post(&t->run);
DIE(ret != 0, "sem_post");
}
/**
* @brief Adds a thread to the thread queue
*
* @param [in] t Pointer to a thread structure
*/
static void register_thread(thread *t)
{
int i, j;
/*
* Search for the correct position to insert the thread
*/
i = 0;
while (i < s.queue_size && s.queue[i]->priority < t->priority)
i++;
/*
* Make space to insert
*/
for (j = s.queue_size; j > i; j--)
s.queue[j] = s.queue[j - 1];
s.queue_size++;
s.queue[i] = t;
s.queue[i]->status = READY;
}
/**
* @brief Updates the scheduler, and makes it plan the next thread
*/
static void update_scheduler(void)
{
int ret;
thread *next;
thread *current;
current = s.running;
if (s.queue_size == 0) {
/*
* Can stop scheduler if the last thread finished
*/
if (current->status == TERMINATED) {
ret = sem_post(&s.end);
DIE(ret != 0, "sem post");
}
/*
* No other thread to run
*/
sem_post(¤t->run);
return;
}
/*
* Get first thread in queue
*/
next = s.queue[s.queue_size - 1];
/*
* If no thread is running
*/
if (s.running == NULL) {
s.running = next;
start_thread(next);
return;
}
/*
* Check if thread is blocked or finished
*/
if (current->status == BLOCKED || current->status == TERMINATED) {
s.running = next;
start_thread(next);
return;
}
/*
* Check if there is a higher priority thread available
*/
if (current->priority < next->priority) {
register_thread(current);
s.running = next;
start_thread(next);
return;
}
/*
* Check if the thread's quantum has expired
*/
if (current->time_left <= 0) {
/*
* Round robin
*/
if (current->priority == next->priority) {
register_thread(current);
s.running = next;
start_thread(next);
return;
}
current->time_left = s.quantum;
}
sem_post(¤t->run);
}
/**
* @brief Routine used by every new thread
*
* @param [in] args Void pointer to a thread struct
*/
static void *thread_routine(void *args)
{
int ret;
thread *t;
t = (thread *)args;
/*
* Wait for scheduler
*/
ret = sem_wait(&t->run);
DIE(ret != 0, "sem wait");
/*
* Run handler
*/
t->handler(t->priority);
/*
* Announce scheduler that the thread is finished
*/
t->status = TERMINATED;
update_scheduler();
return NULL;
}