Repository navigation
Expand file tree
/
Copy pathRequest_parser.c
More file actions
59 lines (49 loc) · 1.67 KB
/
Copy pathRequest_parser.c
File metadata and controls
59 lines (49 loc) · 1.67 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
#include "data_structure.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
// Function to parse the specific request file for a process [cite: 59, 61]
void parse_memory_requests(Process* p) {
char filename[50];
// Files are named per process: requests_1.txt, requests_2.txt
sprintf(filename, "requests_%d.txt", p->processID);
FILE* file = fopen(filename, "r");
if (!file) {
// If file doesn't exist, process has no memory requests
p->requests_head = NULL;
p->current_request = NULL;
return;
}
MemRequest* tail = NULL;
p->requests_head = NULL;
char buffer[100];
// Read line by line
while (fgets(buffer, sizeof(buffer), file)) {
// Skip comments (#) or empty lines [cite: 76]
if (buffer[0] == '#' || buffer[0] == '\n') continue;
MemRequest* new_node = (MemRequest*) malloc(sizeof(MemRequest));
char type_str[5];
// Parse: Time, Address, Type
int count = sscanf(buffer, "%d %d %s",
&new_node->request_time,
&new_node->virtual_addr,
type_str);
if (count < 3) {
free(new_node);
continue;
}
new_node->type = type_str[0]; // 'r' or 'w'
new_node->next = NULL;
// Append to Linked List
if (p->requests_head == NULL) {
p->requests_head = new_node;
tail = new_node;
} else {
tail->next = new_node;
tail = new_node;
}
}
// Set current pointer to start of list
p->current_request = p->requests_head;
fclose(file);
}