-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathrequestparse.c
More file actions
370 lines (321 loc) · 10.9 KB
/
requestparse.c
File metadata and controls
370 lines (321 loc) · 10.9 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
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
//
// requestparse.c
// 595_project1
//
// Created by David Milewicz on 2/14/17.
// Copyright © 2017 David Milewicz. All rights reserved.
//
#include "requestparse.h"
#include "parse.h"
#include "arraylist.h"
#include "sort.h"
#include <unistd.h>
/*
* Parses the incoming request.
*/
parsed_request* parse_request(char* request_str) {
parsed_request* incoming_request = malloc(sizeof(parsed_request));
// parse request
int idx = 0;
incoming_request->request_type = request_str;
while (request_str[idx] != ' ') idx++;
request_str[idx] = '\0';
incoming_request->resource = request_str + idx + 1;
while (request_str[idx] != ' ') idx++;
request_str[idx] = '\0';
incoming_request->HTTP_version = request_str + idx + 1;
while (request_str[idx] != '\n') idx++;
request_str[idx] = '\0';
incoming_request->host = request_str + (idx += 7);
while (request_str[idx] != '\n') idx++;
request_str[idx] = '\0';
incoming_request->rest = request_str + idx + 1;
incoming_request->postdata = NULL;
return incoming_request;
}
/*
* Determine if request is a POST response.
*/
int isPost(parsed_request* p) {
return strcmp(p->request_type, "POST") == 0;
}
/*
* Get the post request.
*/
char* get_post(char* pr){
char* search = "search";
char* post = strstr(pr, search);
printf("Post Gotten: %s\n\n", post);
return post;
}
/*
* Parse post request.
*/
post_request* parse_post(post_request* pr, char* string){
// get post request
char* post_string = get_post(string);
char* delim = "&";
char* tokens[3];
int index = 0;
// get the key-value pairs
char* temp = strtok(post_string, delim);
while(temp != NULL){
tokens[index] = temp;
index++;
temp = strtok(NULL, delim);
}
// set all fields to null
init_post_request(pr);
// update post request values
char* val;
for (int i = 0; i < index; i++) {
val = strtok(tokens[i], "=");
val = strtok(NULL, "=");
if (strcmp(tokens[i], "sortfield") == 0) pr->sort_field = val;
else if (strcmp(tokens[i], "searchfield") == 0) pr->filter_field = val;
else if (strcmp(tokens[i], "search") == 0) pr->filter_parameters = val;
}
return pr;
}
/*
* Initialize post request.
*/
void init_post_request(post_request* pr) {
pr->filter_parameters = NULL;
pr->filter_field = NULL;
pr->sort_field = NULL;
}
/*
* Create new data set using array list
*/
data_container* array_to_data(void* list, course_data** courses){
arraylist* course_indices = (arraylist*) list;
course_data** fc = malloc(sizeof(course_data*)*course_indices->size);
if (fc == NULL) return NULL;
int* indices = course_indices->values;
for(int i = 0; i < course_indices->size; i++){
fc[i] = courses[indices[i]];
}
// create new data container for filtered courses
data_container* data_filtered = malloc(sizeof(data_container));
data_filtered->length = course_indices->size;
data_filtered->data = fc;
al_free(course_indices);
return data_filtered;
}
/*
* Filter enrollment paraneter.
*/
data_container* filter_enrollment(post_request* pr, data_container* data){
course_data** courses = data->data; // courses
arraylist* course_indices = al_initialize(2); // array list of course indices
// check to see if enrollment number matches
int request = atoi(pr->filter_parameters);
for(int i = 0; i < data->length; i++){
if(request <= courses[i]->enrollment){
al_add(course_indices, i);
}
}
return array_to_data(course_indices, courses);
}
/*
* Filter instructor paraneter.
*/
data_container* filter_instructor(post_request* pr, data_container* data){
course_data** courses = data->data; // courses
arraylist* course_indices = al_initialize(2); // array list of course indices
// check to see if string contains any spaces (+ in html)
char* check;
check = strstr(pr->filter_parameters, "+");
if(check!=NULL){
char* s;
for(s = pr->filter_parameters;(s = strchr(s, 43)); s++){
*s = ' ';
}
}
// handle case sensitivity
for (int j = 0; j < strlen(pr->filter_parameters); j++) {
pr->filter_parameters[j] = toupper(pr->filter_parameters[j]);
}
// store course indices of matched strings
for(int i = 0; i < data->length; i++){
check = strstr(courses[i]->prof, pr->filter_parameters);
if(check != NULL){
al_add(course_indices, i);
}
}
return array_to_data(course_indices, courses);
}
/*
* Filter the course number parameter.
*/
data_container* filter_course_number(post_request* pr, data_container* data){
course_data** courses = data->data; // courses
arraylist* course_indices = al_initialize(2); // array list of course indices
// store course indices of matched strings
for(int i = 0; i < data->length; i++){
char* check = strstr(courses[i]->course_id, pr->filter_parameters);
if(check != NULL){
al_add(course_indices, i);
}
}
return array_to_data(course_indices, courses);
}
/*
* Filter course_quailty parameter from above a certain value.
*/
data_container* filter_course_quality(post_request* pr, data_container* data){
course_data** courses = data->data; // courses
arraylist* course_indices = al_initialize(2); // array list of course indices
// check to see if enrollment number matches
double request = strtod(pr->filter_parameters, NULL);
for(int i = 0; i < data->length; i++){
if(request <= courses[i]->quality){
al_add(course_indices, i);
}
}
return array_to_data(course_indices, courses);
}
/*
* . Filter course_quality parameter from below a certain value.
*/
data_container* filter_course_quality_low(post_request* pr, data_container* data){
course_data** courses = data->data; // courses
arraylist* course_indices = al_initialize(2); // array list of course indices
// check to see if enrollment number matches
double request = strtod(pr->filter_parameters, NULL);
for(int i = 0; i < data->length; i++){
if(request >= courses[i]->quality){
al_add(course_indices, i);
}
}
return array_to_data(course_indices, courses);
}
/*
* Filter course difficulty from above a certain value.
*/
data_container* filter_course_difficulty(post_request* pr, data_container* data){
course_data** courses = data->data; // courses
arraylist* course_indices = al_initialize(2); // array list of course indices
// check to see if enrollment number matches
double request = strtod(pr->filter_parameters, NULL);
for(int i = 0; i < data->length; i++){
if(request <= courses[i]->difficulty){
al_add(course_indices, i);
}
}
return array_to_data(course_indices, courses);
}
/*
* Filter course difficulty from below a certain value.
*/
data_container* filter_course_difficulty_low(post_request* pr, data_container* data){
course_data** courses = data->data; // courses
arraylist* course_indices = al_initialize(2); // array list of course indices
// check to see if enrollment number matches
double request = strtod(pr->filter_parameters, NULL);
for(int i = 0; i < data->length; i++){
if(request >= courses[i]->difficulty){
al_add(course_indices, i);
}
}
return array_to_data(course_indices, courses);
}
/*
* Choose the appropriate filter based on post request.
*/
data_container* choose_filter(data_container* data, post_request* pr){
if (pr->filter_field == NULL || pr->filter_parameters == NULL) return data;
char* field = pr->filter_field; // field for filtering
// filter by course number
if (strcmp(field, "coursenumber") == 0)
return filter_course_number(pr, data);
// filter by instructor
if (strcmp(field, "instructorname") == 0)
return filter_instructor(pr, data);
// filter by enrollment
if (strcmp(field, "enrollment") == 0)
return filter_enrollment(pr, data);
// filter by course quality above
if (strcmp(field, "coursequalityhigh") == 0)
return filter_course_quality(pr, data);
// filter by course quality below
if (strcmp(field, "coursequalitylow") == 0)
return filter_course_quality_low(pr, data);
// filter by course difficulty above
if (strcmp(field, "coursedifficultyhigh") == 0)
return filter_course_difficulty(pr, data);
// filter by course difficulty below
if (strcmp(field, "coursedifficultylow") == 0)
return filter_course_difficulty_low(pr, data);
return data;
}
/*
* Copy data into new container
*/
data_container* copy_data(data_container* d) {
data_container* new_container = malloc(sizeof(data_container));
if (new_container == NULL) return NULL;
new_container->data = malloc(sizeof(course_data*) * d->length);
if (new_container->data == NULL) return NULL;
for (int i = 0; i < d->length; i++) {
new_container->data[i] = d->data[i];
}
new_container->length = d->length;
return new_container;
}
/*
* Free shallow data.
*/
void free_shallow_data(data_container* d) {
// free course data
// free(d->data);
// free container
free(d);
}
/*
* Choose sorting appropriately.
*/
void* choose_sort(post_request* pr){
if (pr->sort_field == NULL) return NULL;
// filter by course number
if(strcmp(pr->sort_field, "coursenumber") == 0)
return compare_course_id;
// filter by instructor
if(strcmp(pr->sort_field, "instructorname") == 0)
return compare_professors;
// filter by enrollment
if(strcmp(pr->sort_field, "enrollment") == 0)
return compare_enrollment;
// sort by course quality high
if(strcmp(pr->sort_field, "coursequalityhigh") == 0)
return compare_quality_high;
// sort by course quality low
if(strcmp(pr->sort_field, "coursequalitylow") == 0)
return compare_quality_low;
// sort by course difficulty high
if(strcmp(pr->sort_field, "coursedifficultyhigh") == 0)
return compare_difficulty_high;
// sort by course difficulty low
if(strcmp(pr->sort_field, "coursedifficultylow") == 0)
return compare_difficulty_low;
return NULL;
}
/*
* Print post request.
*/
void print_post_request(post_request* pr){
printf("sort_field: %s\n", pr->sort_field);
printf("filter_field: %s\n", pr->filter_field);
printf("filter_parameters: %s\n\n", pr->filter_parameters);
}
/*
* Print request from the user.
*/
void print_request(parsed_request pr) {
printf("Request Type: %s\n", pr.request_type);
printf("Requested resource: %s\n", pr.resource);
printf("HTTP Version: %s\n", pr.HTTP_version);
printf("Host: %s\n", pr.host);
printf("Rest:\n%s\n\n", pr.rest);
}