-
Notifications
You must be signed in to change notification settings - Fork 0
/
utils.c
222 lines (176 loc) · 4.81 KB
/
utils.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
#include "utils.h"
void findRanges(statistics** stat,BucketRecord* record){
searchTree(record->root,stat);
}
int findNum(int id,workerInfo ** array,int numWorkers){ // find the number of the worker from the pid
for(int i=0; i<numWorkers ;i++){
if(array[i]->pid == id)
return i;
}
}
int findWorkerFromCountry(char* country, workerInfo ** array,int numWorkers,int *counter){ // find the number of the worker from the country
for(int i=0; i<numWorkers ;i++){
for (int j = 0; j < counter[i]; j++){
if(!strcmp(country,array[i]->countries[j]))
return i;
}
}
return -1;
}
void readBytes(int rfd,char* buffer,int bufferSize,int message_size){
int num;
char readBuffer[256];
strcpy(buffer,"");
if(bufferSize>message_size)
bufferSize = message_size + 1;
int countBytes=0;
while(countBytes<message_size){
if((num = read(rfd,readBuffer,bufferSize))<0)
err("Problem in reading!");
strncat(buffer,readBuffer,num);
countBytes = strlen(buffer);
}
}
void writeBytes(char * data,int wfd, int bufferSize){
char *strPointer = &data[0];
int size = bufferSize;
int count = 0;
int message_size = strlen(data);
char tempstr[256];
if(bufferSize>message_size)
size = message_size + 1;
if(write(wfd,&message_size,sizeof(int))<0)
err("Problem in writing");
while(count < message_size){
strPointer = &data[0];
strPointer+=count;
if(((strlen(data)+1)-count)<size){
size = (strlen(data)+1)-count;
}
strncpy(tempstr,strPointer,size);
if(write(wfd,tempstr,size)<0)
err("Problem in writing");
count+=size;
}
}
void sendStat(char* data,int bufferSize,int wfd){
int count=0;
char tempstr[256];
char* strPointer = data;
int size = bufferSize;
int message_size = strlen(data);
if(bufferSize>message_size)
size = message_size + 1;
if(write(wfd,&message_size,sizeof(int))<0)
printf("Problem in writing");
while(count < message_size){
if(((strlen(data)+1)-count)<size){
size = (strlen(data)+1)-count;
}
strncpy(tempstr,strPointer,size);
if(write(wfd,tempstr,size)<0)
err("Problem in writing");
count+=size;
strPointer+=size;
}
}
void savestat(int readFd,int bufferSize,char* data,int sizeOfdata){
int count=0;
int message_size;
int num;
char readBuffer[256];
char* buffer = malloc(sizeOfdata);
strcpy(buffer,"");
if(read(readFd,&message_size,sizeof(int))<0)
err("Problem in writing");
if(bufferSize>message_size)
bufferSize = message_size + 1;
while(count < message_size){
if((num = read(readFd,readBuffer,bufferSize))<0)
err("Problem in reading!");
strncat(buffer,readBuffer,num);
count += bufferSize;
}
strcpy(data,buffer);
free(buffer);
}
void searchTree(Treenode* root,statistics** stat){ // find the ranges in the tree
if(root==guard)
return;
searchTree(root->left,stat);
searchTree(root->right,stat);
Patient* pat = (Patient*) root->data;
int age = pat->age;
if(age>=0 && age<= 20)
(*stat)->ranges[0]++;
else if(age>=21 && age<= 40)
(*stat)->ranges[1]++;
else if(age>=41 && age<= 60)
(*stat)->ranges[2]++;
else if(age>=60)
(*stat)->ranges[3]++;
}
void printStat(statistics * stat){
printf("\n%s\n",stat->date);
printf("%s\n",stat->country);
printf("%s\n",stat->disease );
for (int i = 0; i < 4; i++){
switch(i){
case 0:
printf("Age range 0-20 years: ");
break;
case 1:
printf("Age range 21-40 years: ");
break;
case 2:
printf("Age range 41-60 years: ");
break;
case 3:
printf("Age range 60+ years: ");
}
printf("%d cases\n",stat->ranges[i]);
}
}
int CheckDate(char entryDate[strlen(DATE)+1],char exitDate[strlen(DATE)+1]){ // check if exit date is sooner than the entry date
char temp[sizeof(DATE)];
char day1[3],day2[3],month1[3],month2[3],year1[5],year2[5];
const char s[2] = "-";
char *token;
strcpy(temp,entryDate);
token = strtok(temp, s);
if(!strcmp(exitDate,"–") || !strcmp(exitDate,"-")){ // if there's no exit date do not make the check;
return TRUE;
}else{
for(int i=0;i<3;i++){ // split the entry date
if(i==0)
strcpy(day1,token);
if(i==1)
strcpy(month1,token);
if(i==2)
strcpy(year1,token);
token = strtok(NULL, s);
}
strcpy(temp,exitDate);
token = strtok(temp, s);
for(int i=0;i<3;i++){ // split the exit date
if(i==0)
strcpy(day2,token);
if(i==1)
strcpy(month2,token);
if(i==2)
strcpy(year2,token);
token = strtok(NULL, s);
}
}
if(atoi(month2)>12 || atoi(month1)>12)
return FALSE;
if(atoi(day2)>31 || atoi(day1)>31)
return FALSE;
if(atoi(year2)<atoi(year1))
return FALSE;
else if(atoi(year2)==atoi(year1) && atoi(month2)<atoi(month1))
return FALSE;
else if(atoi(year2)==atoi(year1) && atoi(month2)==atoi(month1) && atoi(day2)<atoi(day1))
return FALSE;
else return TRUE;
}