Your program is required to read in a text le which contains a description of a reference string that will be

simulated. The rst line gives the number of pages for the system, the second gives the number of frames,

and the third line lists the number of page requests $($aka entries$)$ in the reference string. After that, reference

string entries are listed in sequence from $0$ to the number indicated. All numbers are positive integers. A

sample data le is attached to this assignment $($not the one we will grade with$)$ and an annotated version is

shown below. You may assume that a reference string contains at most $512$ entries.

$4$; number of pages $.$ see canvas for the version of this file you need to support

$3$; number of frames

$7$; number of entries in reference string

$0$;$0$ th page in reference string

$1$;$1$ th page in reference string

$2$;$...$

$3$

$3$

$1$

$0$;$6$ th page in reference string

$//$ PageTable.h

#ifndef PAGETABLE$\_$H

#define PAGETABLE$\_$H

#include

#include

$//$enumeration to represent replacement algorithms.

enum replacement$\_$algorithm $\{$

FIFO$=0,$

LRU,

MFU

$\}$;

$//$forward declarations for structs

struct page$\_$table$\_$entry;

struct page$\_$table;

$/**$

$*$ Creates a new page table object. Returns a pointer to created page table.

$*$

$*$ @param page$\_$count Number of pages.

$*$ @param frame$\_$count Numbers of frames.

$*$ @param algorithm Page replacement algorithm

$*$ @param verbose Enables showing verbose table contents.

$*$ @return A page table object.

$*/$

struct page$\_$table$*$ page$\_$table$\_$create$($int page$\_$count, int frame$\_$count, enum replacement$\_$algorithm algorithm, int verbose$)$;

$/**$

$*$ Destorys an existing page table object. Sets outside variable to NULL.

$*$

$*$ @param pt A page table object.

$*/$

void page$\_$table$\_$destroy$($struct page$\_$table$**$ pt$)$;

$/**$

$*$ Simulates an instruction accessing a particular page in the page table.

$*$

$*$ @param pt A page table object.

$*$ @param page The page being accessed.

$*/$

void page$\_$table$\_$access$\_$page$($struct page$\_$table $*$pt$,$ int page$)$;

$/**$

$*$ Displays page table replacement algorithm, number of page faults, and the

$*$ current contents of the page table.

$*$

$*$ @param pt A page table object.

$*/$

void page$\_$table$\_$display$($struct page$\_$table$*$ pt$)$;

$/**$

$*$ Displays the current contents of the page table.

$*$

$*$ @param pt A page table object.

$*/$

void page$\_$table$\_$display$\_$contents$($struct page$\_$table $*$pt$)$;

#endif

$//$ DataLoader.h

#ifndef FILELOADER$\_$H

#define FILELOADER$\_$H

#include

#include

$//$structs

struct test$\_$scenario $\{$

int refstr$\_$len;

int refstr$[512]$;

int page$\_$count;

int frame$\_$count;

$\}$;

$/**$

$*$ Loads a test$\_$scenario strut from a textfile.

$*$

$*$ @param filename The name of the file to load.

$*$ @return A struct containing the loaded file.

$*/$

struct test$\_$scenario$*$ load$\_$test$\_$data$($char$*$ filename$)$;

#endif

$//$simulator$.$c

#include

#include

#include "DataLoader.h$"$

#include "PageTable.h$"$

int main$($int argc, char$*$ argv$[])\{$

char$*$ filename $=$ argv$[2]$;

struct test$\_$scenario$*$ data $=$ load$\_$test$\_$data$($filename$)$;

struct page$\_$table$*$ pt$\_$fifo $=$ page$\_$table$\_$create$($data$->$page$\_$count, data$->$frame$\_$count, FIFO, $0)$;

struct page$\_$table$*$ pt$\_$lru $=$ page$\_$table$\_$create$($data$->$page$\_$count, data$->$frame$\_$count, LRU, $0)$;

struct page$\_$table$*$ pt$\_$mfu $=$ page$\_$table$\_$create$($data$->$page$\_$count, data$->$frame$\_$count, MFU, $0)$;

$//$simulate page requests: fifo

for $($int i $=0$; i $<$ data$->$refstr$\_$len; i$++)\{$

page$\_$table$\_$access$\_$page$($pt$\_$fifo, data$->$refstr$[$i$])$;

$//$page$\_$table$\_$display$\_$contents$($pt$\_$fifo$)$;

$\}$

page$\_$table$\_$display$($pt$\_$fifo$)$;

$//$simulate page requests: lru

for $($int i $=0$; i $<$ data$->$refstr$\_$len; i$++)\{$

page$\_$table$\_$access$\_$page$($pt$\_$lru, data$->$refstr$[$i$])$;

$//$page$\_$table$\_$display$\_$contents$($pt$\_$lru$)$;

$\}$

page$\_$table$\_$display$($pt$\_$lru$)$;

$//$simulate page requests: mfu

for $($int i $=0$; i $<$ data$->$refstr$\_$len; i$++)\{$

page$\_$table$\_$access$\_$page$($pt$\_$mfu, data$->$refstr$[$i$])$;

$//$page$\_$table$\_$display$\_$contents$($pt$\_$mfu$)$;

$\}$

page$\_$table$\_$display$($pt$\_$mfu$)$;

page$\_$table$\_$destroy$($&pt$\_$fifo$)$;

page$\_$table$\_$destroy$($&pt$\_$lru$)$;

page$\_$table$\_$destroy$($&pt$\_$mfu$)$;

free$($data$)$;

$\}$