-
Notifications
You must be signed in to change notification settings - Fork 0
/
office.c
230 lines (203 loc) · 5.21 KB
/
office.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
#include <limits.h>
#include <pthread.h>
#include <errno.h>
#include <string.h>
#include <stdlib.h>
#include <stdio.h>
#include <unistd.h>
#include <fcntl.h>
#define QUEUE_LEN 65536
pthread_mutex_t queue_guard = PTHREAD_MUTEX_INITIALIZER;
pthread_cond_t doc_ready = PTHREAD_COND_INITIALIZER;
pthread_cond_t free_space = PTHREAD_COND_INITIALIZER;
int NC, ND, TD, NS, TS, L, queue_size = 0;
int queue[QUEUE_LEN];
void usage()
{
printf(
"\n\n##############################################################\n"
"\tOFFICE.\n"
"OFFICE is a model of clerks and scanners work in office.\n\n"
"##############################################################\n"
"\tDescription.\n"
"./office NC ND TD NS TS L\n"
"NC is number of clerks\n"
"ND is number of documents\n"
"TD is time for one document\n"
"NS is number of scanners\n"
"TS is time for one document to scan\n"
"L is the length of queue\n"
"All time should be in seconds. All numbers should be positive\n"
"#############################################################\n");
}
int take_doc()
{
pthread_mutex_lock(&queue_guard);
while (queue_size == 0)
{
pthread_cond_wait(&doc_ready, &queue_guard);
}
int ret = queue[0];
queue_size--;
memmove(queue, queue+1, sizeof(int)*queue_size);
pthread_cond_broadcast(&free_space);
pthread_mutex_unlock(&queue_guard);
return ret;
}
void put_doc(int num)
{
pthread_mutex_lock(&queue_guard);
while (queue_size == L)
{
pthread_cond_wait(&free_space, &queue_guard);
}
queue[queue_size] = num;
queue_size++;
pthread_cond_broadcast(&doc_ready);
pthread_mutex_unlock(&queue_guard);
}
void * take_document_from_clerk(int arg)
{
int doc = (arg+1)*256;
int documents_for_print = ND;
while (documents_for_print != 0)
{
doc++;
sleep(TD);
printf("Document %#.4x ready\n", doc);
put_doc(doc);
documents_for_print--;
}
}
void * for_scan()
{
int doc;
while (1)
{
doc = take_doc();
sleep(TS);
printf("Document %#.4x scanned\n", doc);
}
}
int check_args(int argc, char** argv, int* NC, int* ND, int* TD, int* NS, int* TS, int* L)
{
if (argc != 7)
{
usage();
return -1;
}
char* endptr;
*NC = strtol(argv[1], &endptr, 10);
if (strcmp(endptr, "\0") != 0)
{
fprintf(stderr, "Error in NC\n");
usage();
return -1;
}
*ND = strtol(argv[2], &endptr, 10);
if (strcmp(endptr, "\0") != 0)
{
fprintf(stderr, "Error in ND\n");
usage();
return -1;
}
*TD = strtol(argv[3], &endptr, 10);
if (strcmp(endptr, "\0") != 0)
{
fprintf(stderr, "Error in TD\n");
usage();
return -1;
}
*NS = strtol(argv[4], &endptr, 10);
if (strcmp(endptr, "\0") != 0)
{
fprintf(stderr, "Error in NS\n");
usage();
return -1;
}
*TS = strtol(argv[5], &endptr, 10);
if (strcmp(endptr, "\0") != 0)
{
fprintf(stderr, "Error in TS\n");
usage();
return -1;
}
*L = strtol(argv[6], &endptr, 10);
if (strcmp(endptr, "\0") != 0)
{
fprintf(stderr, "Error in L\n");
usage();
return -1;
}
if (*NC < 0 || *ND < 0 || *TD < 0 || *NS < 0 || *TS < 0 || *L < 0)
{
fprintf(stderr, "Negative number get as parameter\n");
usage();
return -1;
}
if (*L > QUEUE_LEN)
{
fprintf(stderr, " Too big size of queue. Max size = 65536\n");
return -1;
}
return 0;
}
int main(int argc, char ** argv) {
int right_input = check_args(argc, argv, &NC, &ND, &TD, &NS, &TS, &L);
if (right_input == -1)
{
exit(EXIT_FAILURE);
}
pthread_t* clerks;
clerks = malloc(NC * sizeof(pthread_t));
if (clerks == NULL)
{
fprintf(stderr, "Can't allocate memory\n");
fprintf(stderr, "%s\n", strerror(errno));
exit(EXIT_FAILURE);
}
int i;
for (i=0; i<NC; i++)
{
clerks[i] = 0;
}
pthread_t* scanners;
scanners = malloc(NS * sizeof(pthread_t));
if (scanners == NULL)
{
fprintf(stderr, "Can't allocare memory\n");
fprintf(stderr, "%s\n", strerror(errno));
exit(EXIT_FAILURE);
}
for (i=0; i<NS; i++)
{
scanners[i] = 0;
}
for (i = 0; i < NC; i++)
{
if (pthread_create( &clerks[i], 0, take_document_from_clerk, i) != 0)
{
fprintf(stderr, "Error with starting new thread for clerk. %s\n", strerror(errno));
exit(EXIT_FAILURE);
}
}
for (i = 0; i < NS; i++)
{
if (pthread_create( &scanners[i], 0, for_scan, 0) != 0)
{
fprintf(stderr, "Error with starting new thread for skanner. %s\n", strerror(errno));
exit(EXIT_FAILURE);
}
}
for (i = 0; i < NC; i++)
{
if (pthread_join( clerks[i], 0) != 0)
{
fprintf(stderr, "Error with waiting for thread. %s\n", strerror(errno));
exit(EXIT_FAILURE);
}
}
free(clerks);
free(scanners);
exit(EXIT_SUCCESS);
}