-
Notifications
You must be signed in to change notification settings - Fork 0
/
proj2.c
602 lines (494 loc) · 16.1 KB
/
proj2.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
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
/****************************************************************************
* @file proj2.c
* @brief IOS - Operating Systems - 2nd project - Santa Claus Problem
* @author Tadeáš Kachyňa <xkachy00@stud.fit.vutbr.cz>
* @date 4/2/2021
* @version 1.0
****************************************************************************/
#include <stdio.h>
#include <stdlib.h>
#include <semaphore.h>
#include <string.h>
#include <sys/types.h>
#include <unistd.h>
#include <stdint.h>
#include <sys/wait.h>
#include <sys/mman.h>
#include <time.h>
#include <fcntl.h>
#include <errno.h>
/********** Constants **********/
#define NUM_OF_ARGS 5 /// expected number of program arguments
#define ARGS_FAIL 1
#define MAX_REINDEERS 19 /// maximum number of reindeers that can be entered
#define MIN_REINDEERS 1 /// minimum number of reindeers that can be entered
#define MAX_ELVES 999 /// maximum number of elves that can be entered
#define MIN_ELVES 1 /// minimum number of elves that can be entered
#define MIN_TIME 0 /// min. time
#define MAX_TIME 1000 /// max.time
/********** Semaphores **********/
#define SEM_SANTASEM "/xkachy00-ios2-santaSem"
#define SEM_MUTEX "/xkachy00-ios2-mutex"
#define SEM_REINDEERSEM "/xkachy00-ios2-reindeerSem"
#define SEM_ELVESSEM "/xkachy00-ios2-elvesSem"
#define SEM_ELVESHELP "/xkachy00-ios2-elvesHelp"
#define SEM_ALL "/xkachy00-ios2-all"
#define SEM_GETHITCHED "/xkachy00-ios2-getHitched"
#define SEM_SANTAHELPED "/xkachy00-ios2-santaHelped"
sem_t *santaSem = NULL;
sem_t *mutex = NULL;
sem_t *reindeerSem = NULL;
sem_t *elvesSem = NULL;
sem_t *elvesHelp = NULL;
sem_t *allProcesses = NULL;
sem_t *getHitched = NULL;
sem_t *santaHelped = NULL;
/********** Shared memories **********/
static int *actionCounter;
static int *reindeerCounter;
static int *elvesCounter;
static int *elvesHolidays;
FILE *file;
/** @struct args users arguments
*
* @var NE number of elves
* @var NR number of reeinders
* @var TE max. time in milliseconds for which the elf works independently
* @var TR max. time in milliseconds for which the reindeer is on its vacation
*/
typedef struct {
int NE;
int NR;
int TE;
int TR;
} args;
/**
* @brief generates reindeer processes
*
* @param NR number of reeindeers
* @param TR max. time in milliseconds for which the reindeer works independently
* @param i index of process
*/
void processReindeer(int NR, int TR, int i) {
int lower = TR / 2; // lower border
int upper = TR; // upper border
int ran;
srand(time(NULL) * getpid());
ran = (rand() % (upper - lower + 1) + lower); // gives you a random value from interval <TR/2,TR>
ran = ran * 1000;
sem_wait(mutex);
fprintf(file, "%d: RD %d: rstarted\n", *actionCounter, i);
fflush(file);
(*actionCounter)++;
sem_post(mutex);
usleep(ran);
sem_wait(mutex);
fprintf(file, "%d: RD %d: return home\n", *actionCounter, i);
fflush(file);
(*actionCounter)++;
(*reindeerCounter)++;
sem_post(mutex);
if(*reindeerCounter == NR) {
sem_post(santaSem);
}
sem_wait(reindeerSem);
sem_wait(mutex);
fprintf(file, "%d: RD %d: get hitched\n", *actionCounter, i);
fflush(file);
sem_post(getHitched);
(*actionCounter)++;
(*reindeerCounter)--;
sem_post(mutex);
sem_post(allProcesses);
exit(0);
}
/**
* @brief function generating elf processes
*
* @param NE number of elves
* @param i index of process
*/
void processElves(int TE, int i){
int ran;
sem_wait(mutex);
fprintf(file, "%d: Elf %d: started\n", *actionCounter, i);
fflush(file);
(*actionCounter)++;
sem_post(mutex);
for(;;) {
if(TE != 0) {
srand(time(NULL) * getpid());
ran = (rand() % TE);
ran = ran * 1000;
usleep(ran);
}
sem_wait(elvesSem);
sem_wait(mutex);
fprintf(file, "%d: Elf %d: need help\n", *actionCounter, i);
(*actionCounter)++;
(*elvesCounter)++;
fflush(file);
sem_post(mutex);
// elves are waiting in front of santa's workshop, a third one gives Santa a signal to let them inside
if (*elvesCounter == 3 && *elvesHolidays == 0) {
sem_post(santaSem);
} else {
sem_post(elvesSem);
}
sem_wait(elvesHelp);
sem_wait(mutex);
// when the workshop is closed, elves are taking holidays
if (*elvesHolidays == 1) {
fprintf(file, "%d: Elf %d: taking holidays\n", *actionCounter, i);
(*actionCounter)++;
fflush(file);
sem_post(elvesSem);
sem_post(mutex);
sem_post(allProcesses);
exit(0);
}
sem_post(mutex);
sem_wait(mutex);
fprintf(file, "%d: Elf %d: get help\n", *actionCounter, i);
fflush(file);
(*actionCounter)++;
sem_post(santaHelped);
(*elvesCounter)--;
if (*elvesCounter == 0) {
sem_post(elvesSem);
}
sem_post(mutex);
}
}
/**
* @name Elves function
*
* @brief elves process
*
* @param NE number of reeindeers
* @param TE max. time in milliseconds for which the reindeer works independently
*/
void processSanta(args a)
{
sem_wait(mutex);
fprintf(file, "%d: Santa: going to sleep\n", *actionCounter);
fflush(file);
(*actionCounter)++;
sem_post(mutex);
for(;;) {
sem_wait(santaSem);
if(*elvesCounter== 3 && *elvesHolidays == 0 && *reindeerCounter != a.NR) {
sem_wait(mutex);
fprintf(file, "%d: Santa: helping elves\n", *actionCounter);
fflush(file);
(*actionCounter)++;
sem_post(mutex);
// Santa lets elves into the workshop
for(int i = 0; i < 3; i++) {
sem_post(elvesHelp);
}
// Santa helping all 3 elves and then goes sleep
for(int i = 0; i < 3; i++) {
sem_wait(santaHelped);
}
sem_wait(mutex);
fprintf(file, "%d: Santa: going to sleep\n", *actionCounter);
(*actionCounter)++;
fflush(file);
sem_post(mutex);
} else if (*reindeerCounter == a.NR) {
sem_wait(mutex);
fprintf(file, "%d: Santa: closing workshop\n", *actionCounter);
fflush(file);
(*actionCounter)++;
// gives signal to elves to take holidays
for(int i = 0; i < a.NE; i++) {
sem_post(elvesHelp);
}
*elvesHolidays = 1;
// gives signal to reindeers
for (int i = 0; i < a.NR; i++) {
sem_post(reindeerSem);
}
sem_post(mutex);
// waits for reindeers to get hitched
for(int i = 0; i < a.NR; i++) {
sem_wait(getHitched);
}
sem_wait(mutex);
fprintf(file, "%d: Santa: Christmas started\n", *actionCounter);
fflush(file);
(*actionCounter)++;
sem_post(mutex);
sem_post(allProcesses);
exit(0);
}
}
}
/**
* @brief destroys semaphores and shared memories
*/
void clean()
{
sem_unlink(SEM_SANTAHELPED);
sem_close(santaHelped);
sem_unlink(SEM_GETHITCHED);
sem_close(getHitched);
sem_unlink(SEM_ALL);
sem_close(allProcesses);
sem_unlink(SEM_ELVESHELP);
sem_close(elvesHelp);
sem_unlink(SEM_ELVESSEM);
sem_close(elvesSem);
sem_unlink(SEM_MUTEX);
sem_close(mutex);
sem_unlink(SEM_REINDEERSEM);
sem_close(reindeerSem);
sem_unlink(SEM_SANTASEM);
sem_close(santaSem);
munmap(elvesHolidays, sizeof *elvesHolidays);
munmap(actionCounter, sizeof *actionCounter);
munmap(reindeerCounter, sizeof *reindeerCounter);
munmap(elvesCounter, sizeof *elvesCounter);
}
/**
* @brief does initialization of shared memories and semaphores
*/
void init()
{
/* Initializations of shared memories */
actionCounter = mmap(NULL, sizeof *actionCounter, PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS, -1, 0);
if (actionCounter == MAP_FAILED) {
fprintf(stderr, "ERROR > Allocation of shared memory [actionCounter] failed.\n");
clean();
fclose(file);
exit(EXIT_FAILURE);
}
*actionCounter = 1;
reindeerCounter = mmap(NULL, sizeof *reindeerCounter, PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS, -1, 0);
if (reindeerCounter == MAP_FAILED) {
fprintf(stderr, "ERROR > Allocation of shared memory [reindeerCounter] failed.\n");
clean();
fclose(file);
exit(EXIT_FAILURE);
}
*reindeerCounter = 0;
elvesCounter = mmap(NULL, sizeof *elvesCounter, PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS, -1, 0);
if (elvesCounter == MAP_FAILED){
fprintf(stderr, "ERROR > Allocation of shared memory [elvesCounter] failed.\n");
clean();
fclose(file);
exit(EXIT_FAILURE);
}
*elvesCounter = 0;
elvesHolidays = mmap(NULL, sizeof *elvesHolidays, PROT_READ | PROT_WRITE, MAP_SHARED | MAP_ANONYMOUS, -1, 0);
if (elvesHolidays == MAP_FAILED) {
fprintf(stderr, "ERROR > Allocation of shared memory [elvesHolidays] failed.\n");
clean();
fclose(file);
exit(EXIT_FAILURE);
}
*elvesHolidays = 0;
/* Initializations of semaphores */
santaSem = sem_open(SEM_SANTASEM, O_CREAT | O_EXCL, 0666, 0);
if (santaSem == SEM_FAILED) {
fprintf(stderr, "ERROR > Semaphore [santaSem] not initialized.\n");
clean();
fclose(file);
exit(1);
}
mutex = sem_open(SEM_MUTEX, O_CREAT | O_EXCL, 0666, 1);
if (mutex == SEM_FAILED) {
fprintf(stderr, "ERROR > Semaphore [mutex] not initialized.\n");
clean();
fclose(file);
exit(1);
}
reindeerSem = sem_open(SEM_REINDEERSEM, O_CREAT | O_EXCL, 0666, 0);
if (reindeerSem == SEM_FAILED) {
fprintf(stderr, "ERROR > Semaphore [reindeerSem] not initialized.\n");
clean();
fclose(file);
exit(1);
}
elvesSem = sem_open(SEM_ELVESSEM, O_CREAT | O_EXCL, 0666, 1);
if ( elvesSem == SEM_FAILED) {
fprintf(stderr, "ERROR > Semaphore [elvesSem] not initialized.\n");
clean();
fclose(file);
exit(1);
}
elvesHelp = sem_open(SEM_ELVESHELP, O_CREAT | O_EXCL, 0666, 0);
if ( elvesHelp == SEM_FAILED) {
fprintf(stderr, "ERROR > Semaphore [elvesHelp] not initialized.\n");
clean();
fclose(file);
exit(1);
}
allProcesses = sem_open(SEM_ALL, O_CREAT | O_EXCL, 0666, 0);
if ( allProcesses == SEM_FAILED) {
fprintf(stderr, "ERROR > Semaphore [allProcesses] not initialized.\n");
clean();
fclose(file);
exit(1);
}
getHitched = sem_open(SEM_GETHITCHED, O_CREAT | O_EXCL, 0666, 0);
if ( getHitched == SEM_FAILED) {
fprintf(stderr, "ERROR > Semaphore [getHitched] not initialized.\n");
clean();
fclose(file);
exit(EXIT_FAILURE);
}
santaHelped = sem_open(SEM_SANTAHELPED, O_CREAT | O_EXCL, 0666, 0);
if ( santaHelped == SEM_FAILED) {
fprintf(stderr, "ERROR > Semaphore [santaHelped] not initialized.\n");
clean();
fclose(file);
exit(1);
}
file = fopen("proj2.out", "w");
if (file == NULL){
fprintf(stderr, "ERROR > Opening file.\n");
clean();
fclose(file);
exit(1);
}
}
/**
* @brief loads arguments, check them and gives errors
*
* @param argc number of arguments
* @param argv argument vectors
* @param a structure
*/
args argumentsFunc(int argc, char **argv, args a)
{
char *ptr;
/* small number of entered arguments */
if (argc != NUM_OF_ARGS) {
fprintf(stderr, "ERROR > Enter more arguments.\n");
exit(ARGS_FAIL);
}
/* checking entered arguments */
a.NE = strtol(argv[1], &ptr, 10); // number of elves
if (*ptr != '\0' || ptr == argv[1]) {
printf("ERROR > '%s' is not a number.\n", argv[1]);
exit(ARGS_FAIL);
}
a.NR = strtol(argv[2], &ptr, 10); // number of reeinders
if (*ptr != '\0' || ptr == argv[2]) {
printf("ERROR > '%s' is not a number.\n", argv[2]);
exit(ARGS_FAIL);
}
a.TE = strtol(argv[3], &ptr, 10); // max. time in milliseconds for which the elf works independently
if (*ptr != '\0' || ptr == argv[3]) {
printf("ERROR > '%s' is not a number.\n", argv[3]);
exit(ARGS_FAIL);
}
a.TR = strtol(argv[4], &ptr, 10); // max. time in milliseconds for which the reindeer works ind ependently
if (*ptr != '\0' || ptr == argv[4]) {
printf("ERROR > '%s' is not a number.\n", argv[4]);
exit(ARGS_FAIL);
}
/****** Checking if the number is in the range *****/
if (a.NE < MIN_ELVES || a.NE > MAX_ELVES) {
fprintf(stderr, "ERROR > Number has to be from 1 to 999.\n");
exit(ARGS_FAIL);
}
if (a.NR < MIN_REINDEERS || a.NR > MAX_REINDEERS) {
fprintf(stderr, "ERROR > Number has to be from 1 to 19.\n");
exit(ARGS_FAIL);
}
if (a.TE < MIN_TIME || a.TE > MAX_TIME) {
fprintf(stderr, "ERROR > Number has to be from 1 to 999.\n");
exit(ARGS_FAIL);
}
if (a.TR < MIN_TIME || a.TR > MAX_TIME) {
fprintf(stderr, "ERROR > Number has to be from 1 to 999.\n");
exit(ARGS_FAIL);
}
return a;
}
/**
* @brief terminates currently all running processes
*
* @param arguments arguments entered by user
*/
void terminateAll(args arguments)
{
*reindeerCounter = arguments.NE;
for(int i = 0; i < arguments.NE; i++) {
sem_post(mutex);
sem_post(santaSem);
sem_post(elvesSem);
sem_post(elvesHelp);
sem_post(allProcesses);
}
for(int i = 0; i < arguments.NR; i++) {
sem_post(mutex);
sem_post(santaSem);
sem_post(getHitched);
sem_post(elvesSem);
sem_post(santaSem);
sem_post(allProcesses);
}
sem_post(santaSem);
sem_post(allProcesses);
while(wait(NULL) > -1);
fclose(file);
clean();
}
/**
* Main function
*
* @param argc number of arguments
* @param argv argument values
* @return 0 returns success
*/
int main(int argc, char **argv)
{
/********** Inicialization **********/
args arguments = argumentsFunc(argc, argv, arguments); // processes arguments
init(); // initalizes shared memories and semaphores
/********** Process generating **********/
pid_t process = fork();
// generates santa process
if (process == 0) {
processSanta(arguments);
} else {
// generator of elf processes
for(int i = 0; i < arguments.NE; i++){
int j = arguments.NE;
pid_t genElves[j];
genElves[j] = fork();
if (genElves[j] == 0){
processElves(arguments.TE, i+1);
} else if (genElves[j] < 0) {
fprintf(stderr, "ERROR > Fork failed %d (genElves).\n", getpid());
terminateAll(arguments);
exit(1);
}
}
// generator of reindeer processes
for(int i = 0; i < arguments.NR; i++){
int j = arguments.NR;
pid_t genReindeers[j];
genReindeers[j] = fork();
if (genReindeers[j] == 0) {
processReindeer(arguments.NR, arguments.TR, i+1);
} else if (genReindeers[j] < 0) {
fprintf(stderr, "ERROR > Fork failed %d (genReindeers).\n", getpid());
terminateAll(arguments);
exit(1);
}
}
}
/* Main process waits untill all other processes are finished */
for(int i = 0; i < (arguments.NE + arguments.NR + 1); i++) {
sem_wait(allProcesses);
}
/*************** Cleaning ***************/
clean();
fclose(file);
return 0;
}