-
Notifications
You must be signed in to change notification settings - Fork 0
/
proc.c
165 lines (149 loc) · 3.49 KB
/
proc.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
/*
* \file proc.c
* \author Nathan Eloe
* \brief implements functionality to create and modify process information structures
* Modified by:
*/
#include "proc.h"
#include <stdlib.h>
#include <stdio.h>
repnode_t new_node(char action)
{
repnode_t val = {action, NULL};
return val;
}
void free_nodes(repnode_t * start)
{
if (start)
{
free_nodes(start->next);
free(start);
}
}
void add_action(proc_t * proc, char act)
{
repnode_t * newnode = malloc(sizeof(repnode_t));
*newnode = new_node(act);
if (proc->tail)
{
proc->tail->next = newnode;
}
else
proc->head = newnode;
proc->tail = newnode;
}
void burst(proc_t * proc)
{
proc->m_timeburst += 1;
add_action(proc, 'B');
}
void wait_p(proc_t * proc)
{
proc->m_totalwait += 1;
add_action(proc, 'W');
}
void nop(proc_t * proc)
{
add_action(proc, ' ');
}
int isdone(proc_t * proc)
{
return proc->m_timeburst == proc->m_burst;
}
int running(proc_t * proc, int ts)
{
return ts >= proc->m_arrive && !isdone(proc);
}
void reset(proc_t * proc)
{
proc->m_timeburst = 0;
proc->m_totalwait = 0;
free_nodes(proc->head);
proc->head = NULL;
proc->tail = NULL;
}
void reset_all(proc_t * procs, int numprocs)
{
int i;
for (i=0; i<numprocs; i++)
reset(&(procs[i]));
}
void print_process(proc_t * proc)
{
printf("Process %c: arrive: %d required: %d time spent: %d wait: %d\n", proc->m_procname, proc->m_arrive, proc->m_burst,
proc->m_timeburst, proc->m_totalwait);
}
void print_rungraph(proc_t * procs, int numprocs)
{
int i, count=0;
repnode_t * curr;
printf(" == RUN GRAPH ==\n");
for (i=0; i<numprocs; i++)
{
count = 0;
printf("%c |", procs[i].m_procname);
curr = procs[i].head;
while (curr)
{
if (count == procs[i].m_arrive)
printf(">%c ", curr->action);
else if (count == procs[i].m_arrive + procs[i].m_timeburst + procs[i].m_totalwait -1)
printf(" %c< ", curr->action);
else
printf(" %c ", curr->action);
curr = curr->next;
count ++;
}
printf("\n");
}
printf("---");
for (i=0; i<count; i++)
{
printf("----");
}
printf("\n |");
for (i=0; i<count; i++)
{
printf("%.3d|", i);
}
printf("\n");
return;
}
void print_stats(proc_t * procs, int numprocs)
{
int i = 0;\
double t_wait = 0, t_turnaround = 0;
for (; i<numprocs; i++)
{
t_wait += procs[i].m_totalwait;
t_turnaround += procs[i].m_totalwait + procs[i].m_timeburst;
}
printf("-- Stats --\n");
printf(" Avg. Response Time (Avg. Wait): %f\n", t_wait / numprocs);
printf(" Avg. Turnaround Time : %f\n", t_turnaround / numprocs);
return;
}
int time_remaining(proc_t * proc)
{
return proc->m_burst - proc->m_timeburst;
}
proc_t * read_file(const char* fname, int * numprocs)
{
proc_t * processes;
int i;
FILE * procfile = fopen(fname, "r");
if (!procfile)
{
printf("Cannot open file %s for reading; exiting", fname);
exit(1);
}
fscanf(procfile, "%d\n", numprocs);
processes = calloc(*numprocs, sizeof(proc_t));
for (i=0; i<*numprocs; i++)
{
fscanf(procfile, "%c %d %d\n", &(processes[i].m_procname), &(processes[i].m_burst),
&(processes[i].m_arrive));
}
fclose(procfile);
return processes;
}