Repository navigation
Expand file tree
/
Copy pathinit.c
More file actions
391 lines (356 loc) · 11.6 KB
/
Copy pathinit.c
File metadata and controls
391 lines (356 loc) · 11.6 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
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
#include "rtx.h"
//creates and initialises free envelope queue
void init_free_env_Q()
{
//msg_env_Q *Free_Env_Queue; declared in header file
Free_Env_Queue = (msg_env_Q*)malloc(sizeof(msg_env_Q));
if(timeout_Q == NULL)
{
printf("Error allocating memory for timeout_Q\n");
free(timeout_Q);
}
Free_Env_Queue->free_msg_counter = 0;
Free_Env_Queue->head = NULL;
Free_Env_Queue->tail = NULL;
}
//creates and initialises timeout queue
void init_timeout_Q()
{
//msg_env_Q *timeout_Q; declared in header file
timeout_Q = (msg_env_Q*)malloc(sizeof(msg_env_Q));
if(timeout_Q == NULL)
{
printf("Error allocating memory for timeout_Q\n");
free(timeout_Q);
}
timeout_Q->free_msg_counter = 0;
timeout_Q->head = NULL;
timeout_Q->tail = NULL;
}
//following functions allocates memory for message envelopes and initialises them
void init_env()
{
Envelope *env_ptr;
init_free_env_Q(); //creates and initializes free envelope queue
int i;
for(i = 0; i < NUM_OF_ENVELOPES; i++)
{
env_ptr = (Envelope *) malloc(sizeof(Envelope));
if(env_ptr == NULL)
{
printf("error allocating memory for envelope!\n");
goto cleanup;
}
int j;
for (j=0;j<MSG_DATA;j++)
env_ptr->Data[j] = NULL; //need to check
env_ptr->DestinationID = 0;
env_ptr->Msg_Type = INITIAL;
env_ptr->Next = NULL;
env_ptr->Previous = NULL;
env_ptr->SenderID = 0;
env_ptr->clockticks = 0;
env_ptr->kernelpt_next = NULL;
env_ptr->kernelpt_previous = NULL;
K_Enqueue_MsgEnv (env_ptr, Free_Env_Queue);
}
printf("memory allocated\n");
cleanup:
free(env_ptr);
}
void init_rpq()
{
//QueuePCB *ReadyQueue [NUM_OF_PRIORITY]; declared in header file
int i,j;
for(i = 0; i < NUM_OF_PRIORITY; i++)
{
ReadyQueue[i] = (QueuePCB*) malloc(sizeof(QueuePCB));
if(ReadyQueue[i] == NULL)
{
printf("error allocating memory for ready Queue!\n");
for(j = i-1; j >= 0; j--)
free(ReadyQueue[j]);
break;
}
ReadyQueue[i]->Head = NULL;
ReadyQueue[i]->Tail = NULL;
}
printf("Ready Process Queue Created and Initialized!\n");
}
//creates and initialises Blocked_On_Resource queue
void init_blkOnRsc_Q()
{
//QueuePCB *Blocked_On_Resources [NUM_OF_PRIORITY]; declared in header file
int i,j;
for(i = 0; i < NUM_OF_PRIORITY; i++)
{
Blocked_On_Resources[i] = (QueuePCB*) malloc(sizeof(QueuePCB));
if(Blocked_On_Resources[i] == NULL)
{
printf("error allocating memory for Blocked_On_Resources Queue!\n");
for(j = i-1; j >= 0; j--)
free(Blocked_On_Resources[j]);
break;
}
Blocked_On_Resources[i]->Head = NULL;
Blocked_On_Resources[i]->Tail = NULL;
}
printf("Blocked_On_Resources Queue Created and Initialized!\n");
}
//creates and initialises Blocked_On_Envelope queue
void init_blkOnEnv_Q()
{
//QueuePCB *Blocked_On_Envelope [NUM_OF_PRIORITY]; declared in header file
int i,j;
for(i = 0; i < NUM_OF_PRIORITY; i++)
{
Blocked_On_Envelope[i] = (QueuePCB*) malloc(sizeof(QueuePCB));
if(Blocked_On_Envelope[i] == NULL)
{
printf("error allocating memory for Blocked_On_Resources Queue!\n");
for(j = i-1; j >= 0; j--)
free(Blocked_On_Envelope[j]);
break;
}
Blocked_On_Envelope[i]->Head = NULL;
Blocked_On_Envelope[i]->Tail = NULL;
}
printf("Blocked_On_Envelope Queue Created and Initialized!\n");
}
//following function allocates memory for the pcb
void init_processes()
{
int i, size;
//QueuePCB *PCBList; declared in header file
jmp_buf kernel_buf;
PCBList = (QueuePCB*) malloc(sizeof(QueuePCB));
init_rpq();
NewPCB *pcb_ptr;(NewPCB*)malloc(sizeof(NewPCB));
for(i=0; i < NUM_OF_PROC; i++)
{
pcb_ptr = (NewPCB*)malloc(sizeof(NewPCB));
if(pcb_ptr == NULL)
{
printf("Error allocating memory for PCB\n");
free(pcb_ptr);
}
pcb_ptr->Kernelpt_Next = NULL;
pcb_ptr->Kernelpt_Previous = NULL;
pcb_ptr->Next = NULL;
pcb_ptr->Previous = NULL;
pcb_ptr->Own = (msg_env_Q*)malloc(sizeof(msg_env_Q));
// pcb_ptr->jbContext = NULL;
pcb_ptr->recievelist = (msg_env_Q*)malloc(sizeof(msg_env_Q));
pcb_ptr->Priority = init_table[i].priority;
pcb_ptr->ProcID = init_table[i].process_id;
pcb_ptr->State = init_table[i].proc_status;
pcb_ptr->address = init_table[i].proc_address;
size = init_table[i].stack_size;
// pcb_ptr->Stack = ((char *) malloc(size))+ size - STK_OFFSET; //stacks grow down
//head and tail of 'Own' which is a msg_env_Q struct
pcb_ptr->Own->head = NULL;
pcb_ptr->Own->tail = NULL;
//head and tail of 'recievelist' which is a msg_env_Q struct
pcb_ptr->recievelist->head = NULL;
pcb_ptr->recievelist->tail = NULL;
K_Enqueue_PCB(pcb_ptr, PCBList);
//setup buffers and choose first process to run
if(pcb_ptr->State == READY)
{
//enqueue on ready process queue
}
else if(pcb_ptr->State == BLK_ON_ENV)
{
//enqueue on blocked on envelope queue
}
}
}
//creates the initialization table
void initialize_table()
{
int i;
for(i = 0; i < NUM_OF_PROC; i++)
{
switch(i)
{
case 0:
init_table[i].process_id = PROC_A;
init_table[i].priority = P_P1;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = BLK_ON_ENV;
init_table[i].proc_address= add_procA; //(void*)(&add_procA);
break;
case 1:
init_table[i].process_id = PROC_B;
init_table[i].priority = P_P1;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
init_table[i].proc_address= add_procB; //(void*)(&add_procB);
break;
case 2:
init_table[i].process_id = PROC_C;
init_table[i].priority = P_P1;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
init_table[i].proc_address= add_procC; //(void*)(&add_procC);
break;
case 3:
init_table[i].process_id = NULL_PROC;
init_table[i].priority = P_P3;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
init_table[i].proc_address= add_pNull; //(void*)(&add_pNull);
break;
case 4:
init_table[i].process_id = PROC_TST1;
init_table[i].priority = P_P2;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
init_table[i].proc_address= add_ptst1; //(void*)(&add_ptst1);
break;
case 5:
init_table[i].process_id = PROC_TST2;
init_table[i].priority = P_P2;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
init_table[i].proc_address= add_ptst2; //(void*)(&add_ptst2);
break;
case 6:
init_table[i].process_id = PROC_TST3;
init_table[i].priority = P_P2;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
// init_table[i].proc_address= add_ptst3; //(void*)(&add_ptst3);
break;
case 7:
init_table[i].process_id = PROC_TST4;
init_table[i].priority = P_P2;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
init_table[i].proc_address= add_ptst4; //(void*)(&add_ptst4);
break;
case 8:
// init_table[i].process_id = PROC_TST5;
init_table[i].priority = P_P2;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
init_table[i].proc_address= add_ptst5; //(void*)(&add_ptst5);
break;
case 9:
init_table[i].process_id = PROC_TST6;
init_table[i].priority = P_P2;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
init_table[i].proc_address= add_ptst6; //(void*)(&add_ptst6);
break;
case 10:
init_table[i].process_id = KBD_I;
init_table[i].priority = P_IPROCESS;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = IPROCESS;
init_table[i].proc_address= add_KBD; //(void*)(&add_KBD);
break;
case 11:
init_table[i].process_id = CRT_I;
init_table[i].priority = P_IPROCESS;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = IPROCESS;
init_table[i].proc_address= add_CRT; //(void*)(&add_CRT);
break;
case 12:
init_table[i].process_id = TIMER_I;
init_table[i].priority = P_IPROCESS;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = IPROCESS;
init_table[i].proc_address= add_TIMER; //(void*)(&add_TIMER);
break;
case 13:
init_table[i].process_id = PROC_CCI;
init_table[i].priority = P_P0;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
init_table[i].proc_address= add_CCI; //(void*)(&add_CCI);
break;
case 14:
init_table[i].process_id = PROC_SET_PRIORITY;
init_table[i].priority = P_P0;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
init_table[i].proc_address= add_PRTY; //(void*)(&add_PRTY);
break;
case 15:
init_table[i].process_id = PROC_WALL_CLK;
init_table[i].priority = P_P0;
init_table[i].stack_size = MAX_STACKSIZE;
init_table[i].proc_status = READY;
init_table[i].proc_address= add_CLK; //(void*)(&add_CLK);
}
}
printf("initialization table created!\n");
}
//creating and initialising Trace Arrays
void init_TraceArrays()
{
int i,j;
for(i = 0; i < TRACE_ARRAY; i++)
{
Recieve_Trace_Array[i] = (TraceArray*) malloc(sizeof(TraceArray));
Send_Trace_Array[i] = (TraceArray*) malloc(sizeof(TraceArray));
if(Recieve_Trace_Array[i] == NULL)
{
printf("error allocating memory for Receive Trace array!\n");
for(j = i-1; j >= 0; j--)
free(Recieve_Trace_Array[j]);
break;
}
Recieve_Trace_Array[i]->DestintionID = 0;
Recieve_Trace_Array[i]->Msg_Type = 0;
Recieve_Trace_Array[i]->SenderID = 0;
Recieve_Trace_Array[i]->timestamp = 0;
if(Send_Trace_Array[i] == NULL)
{
printf("error allocating memory for Send Trace array!\n");
for(j = i-1; j >= 0; j--)
free(Recieve_Trace_Array[j]);
break;
}
Send_Trace_Array[i]->DestintionID = 0;
Send_Trace_Array[i]->Msg_Type = 0;
Send_Trace_Array[i]->SenderID = 0;
Send_Trace_Array[i]->timestamp = 0;
}
printf("Trace Arrays Created and Initialized!\n");
}
//creating and initialising I/O Buffers
void init_ioBuffers()
{
int i,j;
//io_buffer *output_buffer; //declared in header file
//io_buffer *input_buffer; //declared in header file
output_buffer = (io_buffer*) malloc(sizeof(io_buffer));
input_buffer = (io_buffer*) malloc(sizeof(io_buffer));
if(output_buffer == NULL)
{
printf("Error allocating memory for output buffer\n");
free(output_buffer);
}
//output_buffer->buffer = '0';
output_buffer->Length = 0;
if(input_buffer == NULL)
{
printf("Error allocating memory for input buffer\n");
free(input_buffer);
}
//input_buffer->buffer = '0';
input_buffer->Length = 0;
}
//CONTEXT SWITCH
void context_switch(NewPCB *current, NewPCB * next_proc)
{
int return_val = setjmp(current->jbContext);
if(return_val == 0)
{
current_process = next_proc;
longjmp(next_proc->jbContext, 1);
}
}