-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.c
More file actions
629 lines (523 loc) · 12.5 KB
/
Copy pathmain.c
File metadata and controls
629 lines (523 loc) · 12.5 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
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
/*
Main program for the virtual memory project.
Make all of your modifications to this file.
You may add or rearrange any code or data as you need.
The header files page_table.h and disk.h explain
how to use the page table and disk interfaces.
*/
#include "page_table.h"
#include "disk.h"
#include "program.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#include <errno.h>
#include <pthread.h>
#include <signal.h>
#include <unistd.h>
#include <sys/time.h>
#define true 1
#define false 0
typedef int bool;
int npages, nframes;
int npageFaults, ndiskReads, ndiskWrites;
struct disk *disk;
struct page_table *pt;
char* physmem;
int FRAME_SIZE = PAGE_SIZE;
int pagesAssigned=0;
struct NODE{
int value;
struct NODE* next;
};
struct FIFO{
struct NODE* head;
struct NODE* tail;
int size;
};
struct FIFO fifo;
void FIFO_init(struct FIFO* fifo)
{
fifo->head = NULL;
fifo->tail = NULL;
fifo->size = 0;
}
int FIFO_pop(struct FIFO* fifo)
{
if(fifo->size > 0)
{
struct NODE* temp = fifo->head->next;
int old_v = fifo->head->value;
free(fifo->head);
fifo->head = temp;
fifo->size--;
return old_v;
}
return -1;
}
void FIFO_push(struct FIFO* fifo, int newVal)
{
struct NODE* newNode = malloc(sizeof(struct NODE));
newNode->value = newVal;
newNode->next = NULL;
if(fifo->size == 0)
{
fifo->head = newNode;
fifo->tail = newNode;
fifo->head->next = NULL;
fifo->tail->next = NULL;
}
else
{
fifo->tail->next = newNode;
fifo->tail = newNode;
}
fifo->size++;
}
///////////////////////////
struct RANDL{
int * list;
int size;
int assigned;
};
void RANDL_init(struct RANDL* rl, int size)
{
rl->list = malloc(size*sizeof(int));
rl->size = size;
rl->assigned = 0;
}
int RANDL_add(struct RANDL* rl, int npage)
{
if(rl->assigned < rl->size)
{
rl->list[rl->assigned] = npage;
rl->assigned++;
return -1;
}
else
{
int replace = rand()%nframes;
int opage = rl->list[replace];
rl->list[replace] = npage;
return opage;
}
}
struct RANDL randl;
struct LRU_E2{
int page;
int frame;
int bits;
};
struct LRU_E{
int page;
bool probed;
};
struct LRU{
//struct ENTRY* EArray;
struct LRU_E* pArray;
struct LRU_E2* pArray2;
//int cRank; // current rank we'll assign
int size;
int notFoundCount;
int assigned; // filled spots in EArray
};
struct LRU lru;
struct PROBER
{
struct LRU* lru;
int interval;
int index;
int nframes;
};
struct PROBER prober;
pthread_mutex_t alarmLock = PTHREAD_MUTEX_INITIALIZER;
pthread_mutex_t lruLock = PTHREAD_MUTEX_INITIALIZER;
pthread_cond_t alarmCond = PTHREAD_COND_INITIALIZER;
pthread_t alarm_thread;
void alarmHandler(int sig)
{
pthread_cond_signal(&alarmCond);
pthread_mutex_lock(&lruLock); // MODIFY LATER>>>>>>>>>
// BEHAVIOR GOES HERE
int page = lru.pArray[prober.index].page;
if(page > -1)
{
lru.pArray[prober.index].probed = true;
//printf("alarmHandler: page: %d frame: %d\n", page, prober.index);
page_table_set_entry(pt, page, prober.index, 0);
prober.index = (prober.index+1) % nframes;
}
/////
pthread_mutex_unlock(&lruLock);
}
void *timer_func(void *arg)
{
signal(SIGALRM, alarmHandler);
struct itimerval it_val; /* for setting itimer */
if (signal(SIGALRM, alarmHandler) == SIG_ERR) {
perror("Unable to catch SIGALRM");
exit(1);
}
it_val.it_value.tv_sec = prober.interval/1000000;
it_val.it_value.tv_usec = prober.interval % 1000000;
it_val.it_interval = it_val.it_value;
if (setitimer(ITIMER_REAL, &it_val, NULL) == -1) {
perror("error calling setitimer()");
exit(1);
}
return NULL;
}
void PROBER_init(struct PROBER* p, struct LRU* lru, int interval)
{
p->lru = lru;
p->interval = interval;
p->index = 0;
p->nframes = nframes; // Global
// alarmLock = PTHREAD_MUTEX_INITIALIZER;
// alarmCond = PTHREAD_COND_INITIALIZER;
pthread_create(&alarm_thread, NULL, timer_func, &lru);
//return;
}
void LRU_init(struct LRU *lru)
{
lru->pArray = malloc(nframes * sizeof(struct LRU_E));
lru->pArray2 = malloc(npages * sizeof(struct LRU_E2));
lru->assigned = 0;
lru->notFoundCount =0;
// lruLock = PTHREAD_MUTEX_INITIALIZER;
int i;
for(i = 0; i < nframes; i++)
{
lru->pArray[i].page = -1;
lru->pArray[i].probed = false;
}
for(i = 0; i < npages; i++)
{
lru->pArray2[i].page = i;
lru->pArray2[i].frame = -1;
lru->pArray2[i].bits = 0;
}
}
void LRU_unprobe(int frame)
{
lru.pArray[frame].probed = false;
}
struct LRU_add_ret
{
int opage;
int obits;
};
struct LRU_add_ret LRU_add(struct LRU *lru, int newPage)
{
//struct LRU_E newE;
//newE.page = newPage;
//newE.rank = lru->cRank;
pthread_mutex_lock(&lruLock);
int opage;
int obits;
struct LRU_add_ret lar;
if(lru->assigned < nframes)
{
lru->pArray2[newPage].frame = lru->assigned;
lru->pArray2[newPage].bits = PROT_READ;
lru->pArray[lru->assigned].probed = false;
lru->pArray[lru->assigned].page = newPage;
lru->assigned = lru->assigned + 1;
pthread_mutex_unlock(&lruLock);
lar.opage = -1;
lar.obits = 0;
return lar;
}
else
{
int i;
int evicted = -1;
int cIndex = -1;
for(i=0; i<nframes; i++)
{
cIndex = (prober.index + i) % nframes;
if(lru->pArray[cIndex].probed)
{
evicted = cIndex;
break;
}
}
if(evicted == -1) // no probed found
{
evicted = rand() % nframes;
lru->notFoundCount++;
}
opage = lru->pArray[evicted].page;
obits = lru->pArray2[opage].bits;
lru->pArray[evicted].page = newPage;
lru->pArray[evicted].probed = false;
lru->pArray2[newPage].frame = evicted;
lru->pArray2[newPage].bits = PROT_READ;
lru->pArray2[opage].frame = -1;
lru->pArray2[opage].bits = 0;
pthread_mutex_unlock(&lruLock);
lar.opage = opage;
lar.obits = obits;
return lar;
}
}
void LRU_setWrite(int page)
{
lru.pArray2[page].bits = (PROT_READ | PROT_WRITE);
}
//////////////////////////
void page_fault_handler_rand( struct page_table *pt, int page )
{
int frame, bits;
page_table_get_entry(pt, page, &frame, &bits);
if(pagesAssigned < nframes)
{
if(bits == 0)
{
npageFaults++;
page_table_set_entry(pt, page, pagesAssigned, PROT_READ);
disk_read(disk, page, &physmem[pagesAssigned * FRAME_SIZE]); //
ndiskReads++;
RANDL_add(&randl, pagesAssigned);
pagesAssigned++;
}
else if(bits == PROT_READ)
{
page_table_set_entry(pt, page, frame, PROT_READ | PROT_WRITE);
}
}
else
{
if(bits == 0)
{
npageFaults++;
int opage = RANDL_add(&randl, page);
int oframe;
int obits;
page_table_get_entry(pt, opage, &oframe, &obits);
if( obits == (PROT_READ | PROT_WRITE) )
{
disk_write(disk, opage, &physmem[FRAME_SIZE * oframe]);
ndiskWrites++;
}
disk_read(disk, page, &physmem[FRAME_SIZE * oframe]);
ndiskReads++;
page_table_set_entry(pt, page, oframe, PROT_READ);
page_table_set_entry(pt, opage, 0, 0);
}
else if (bits == PROT_READ)
{
page_table_set_entry(pt, page, frame, PROT_READ | PROT_WRITE);
}
}
}
void test_FIFO(void)
{
struct FIFO f;
int i;
for(i = 0; i < 10; i++)
{
FIFO_push(&f, i);
}
int d;
for(i = 20; i < 32; i++)
{
d = FIFO_pop(&f);
FIFO_push(&f, i);
}
}
void page_fault_handler_fifo( struct page_table *pt, int page )
{
int frame, bits;
page_table_get_entry(pt, page, &frame, &bits);
if(pagesAssigned < nframes)
{
if(bits == 0)
{
npageFaults++;
page_table_set_entry(pt, page, pagesAssigned, PROT_READ);
disk_read(disk, page, &physmem[pagesAssigned * FRAME_SIZE]);
ndiskReads++;
pagesAssigned++;
FIFO_push(&fifo, page);
}
else if(bits == PROT_READ)
{
page_table_set_entry(pt, page, frame, PROT_READ | PROT_WRITE);
}
}
else
{
if(bits == 0)
{
npageFaults++;
int opage = FIFO_pop(&fifo);
int oframe;
int obits;
page_table_get_entry(pt, opage, &oframe, &obits);
if( obits == (PROT_READ | PROT_WRITE) )
{
disk_write(disk, opage, &physmem[FRAME_SIZE * oframe]);
ndiskWrites++;
}
disk_read(disk, page, &physmem[FRAME_SIZE * oframe]);
ndiskReads++;
page_table_set_entry(pt, page, oframe, PROT_READ);
page_table_set_entry(pt, opage, 0, 0);
FIFO_push(&fifo, page);
}
else if (bits == PROT_READ)
{
page_table_set_entry(pt, page, frame, PROT_READ | PROT_WRITE);
}
}
//printf("page fault on page #%d\n",page);
//exit(1);
}
void page_fault_handler_lru ( struct page_table *pt, int page )
{
int frame, bits;
page_table_get_entry(pt, page, &frame, &bits);
if(pagesAssigned < nframes)
{
if(bits == 0)
{
if(lru.pArray2[page].bits == 0)
{
//printf("handler: pages assigned are %d\n", pagesAssigned);
npageFaults++;
//printf("page is being replaced");
page_table_set_entry(pt, page, pagesAssigned, PROT_READ);
//printf("Putting page %d into frame %d\n",page, pagesAssigned);
disk_read(disk, page, &physmem[pagesAssigned * FRAME_SIZE]);
ndiskReads++;
//printf("Reading data from page %d into frame%d\n", page, pagesAssigned);
LRU_add(&lru, page);
LRU_unprobe(pagesAssigned);
pagesAssigned++;
//printf("Adding page %d to lru\n",page);
}
else
{
//printf("Page unprobed\n");
LRU_unprobe(frame);
page_table_set_entry(pt, page, frame, PROT_READ);
}
}
else if(bits == PROT_READ)
{
LRU_setWrite(page);
LRU_unprobe(frame);
//printf("setting write rights to page %d at frame %d\n", page, frame);
page_table_set_entry(pt, page, frame, PROT_READ | PROT_WRITE);
}
}
else
{
if(bits == 0)
{
if(lru.pArray2[page].bits == 0)
{
//printf("Page is being replaced\n");
npageFaults++;
struct LRU_add_ret lar = LRU_add(&lru, page);
int oframe;
int obits;
page_table_get_entry(pt, lar.opage, &oframe, &obits);
//printf("Replacing page %d with bits %d at frame %d, with page %d \n",lar.opage, obits, oframe, page);
if( lar.obits == (PROT_READ | PROT_WRITE) )
{
disk_write(disk, lar.opage, &physmem[FRAME_SIZE * oframe]);
ndiskWrites++;
//printf("WRiting data from page %d at frame %d to disk\n", lar.opage, oframe);
}
LRU_unprobe(oframe);
disk_read(disk, page, &physmem[FRAME_SIZE * oframe]);
ndiskReads++;
//printf("Reading data from disk at page %d into frame %d\n", page, oframe);
page_table_set_entry(pt, page, oframe, PROT_READ);
//printf("Setting page table entry of page %d at frame %d\n", page, oframe);
page_table_set_entry(pt, lar.opage, 0, 0);
//printf("Setting page table entry of page %d to 0 and is now disabled\n",lar.opage);
}
else
{
//printf("Page unprobed\n");
page_table_set_entry(pt, page, frame, PROT_READ);
LRU_unprobe(frame);
}
}
else if (bits == PROT_READ)
{
LRU_setWrite(page);
LRU_unprobe(frame);
page_table_set_entry(pt, page, frame, PROT_READ | PROT_WRITE);
//printf("Setting protection bits to RW at page %d and frame %d\n", page, frame);
}
}
//printf("------------------------------\n");
}
///////////////////////////
int main( int argc, char *argv[] )
{
if(argc!=5) {
printf("use: virtmem <npages> <nframes> <rand|fifo|lru|custom> <sort|scan|focus>\n");
return 1;
}
npages = atoi(argv[1]);
nframes = atoi(argv[2]);
npageFaults = 0;
ndiskReads = 0;
ndiskWrites = 0;
const char *policy = argv[3];
const char *program = argv[4];
srand(time(NULL));
FIFO_init(&fifo);
LRU_init(&lru);
RANDL_init(&randl, nframes);
PROBER_init(&prober, &lru, 1000);
disk = disk_open("myvirtualdisk",npages);
if(!disk) {
fprintf(stderr,"couldn't create virtual disk: %s\n",strerror(errno));
return 1;
}
if(!strcmp(policy, "rand"))
{
pt = page_table_create( npages, nframes, page_fault_handler_rand );
}
else if(!strcmp(policy, "fifo"))
{
pt = page_table_create( npages, nframes, page_fault_handler_fifo );
}
else if(!strcmp(policy, "custom"))
{
pt = page_table_create( npages, nframes, page_fault_handler_lru );
}
else
{
fprintf(stderr, "unknown policy: %s\n", policy);
return 1;
}
if(!pt) {
fprintf(stderr,"couldn't create page table: %s\n",strerror(errno));
return 1;
}
char *virtmem = page_table_get_virtmem(pt);
physmem = page_table_get_physmem(pt);
if(!strcmp(program,"sort")) {
sort_program(virtmem,npages*PAGE_SIZE);
} else if(!strcmp(program,"scan")) {
scan_program(virtmem,npages*PAGE_SIZE);
} else if(!strcmp(program,"focus")) {
focus_program(virtmem,npages*PAGE_SIZE);
} else {
fprintf(stderr,"unknown program: %s\n",argv[4]);
return 1;
}
page_table_delete(pt);
disk_close(disk);
printf("PageFault %d DiskRead %d DiskWrite %d\n", npageFaults, ndiskReads, ndiskWrites);
//printf("There were %d page faults\n",npageFaults);
return 0;
}