操作系统实验(金虎)实验二页面置换源代码.doc

操作系统实验(金虎)实验二页面置换源代码 #includestdio.h #includemalloc.h #includeiostream.h #define L 10 typedef struct FixedList { int Pagenomber;//页号=(逻辑地址/块长) int PBnumber;//物理块号，根据找到位示图的空白而定 bool flag; int OuterAddress[L];//物理地址=块号*块长+余数 FixedList *next; FixedList *linkTo; }FixedList; typedef struct Static { int Pagenomber;//页号 Static *next; }Static; int AddressPhoto[8][8]={1,1,1,1,0,1,1,0,1,1,1,0,1,0,1,0,1,1,0,1,0,1,1,0,1,1,1,0,1,0,1,0, 1,1,0,1,0,1,1,0,1,1,1,0,1,0,1,0,1,1,0,1,0,1,1,0,1,1,1,0,1,0,1,0};//位示图 int IsMemoryFull(Static*queue,int memory) { Static*q=queue; int i=0; while(q-next){i=i+1;q=q-next;} if(i==memory)return 1; if(imemory)return 0; } void PreDeal(FixedList *head,int pageLength) { head-next=NULL; FixedList *tmp=head; for(int i=0;ipageLength;i++) { FixedList *p=(FixedList*)malloc(sizeof(FixedList)); p-next=NULL; p-Pagenomber=i; p-flag=0; for(int j=0;jL;j++) { p-OuterAddress[j]=-1; } tmp-next=p; tmp=tmp-next; } } /* 页 块 状态 物理地址 0 0 -1,-1,-1,-1 1 0 -1 2 0 -1 3 0 -1 4 0 5 0 M9 */ void Push(FixedList *h,Static *queue) { Static *q=(Static *)malloc(sizeof(Static)); q-Pagenomber=h-Pagenomber; q-next=NULL; Static *n=queue; while(n-next){n=n-next;} n-next=q; } void FIFO(FixedList *head,FixedList *h,Static *queue) { FixedList *tok=head-next; Static *q=queue-next; while(tok-Pagenomber!=q-Pagenomber){tok=tok-next;} //weishitu //q-Pagenomber=tok-Pagenomber; h-PBnumber=tok-PBnumber; h-flag=1; // h-OuterAddress=h-PBnumber*; tok-flag=0; for(int i=0;iL;i++){tok-OuterAddress[i]=-1;} queue-next=q-next;//free(q) Static *n=(Static *)malloc(sizeof(Static)); n-Pagenomber=h-Pagenomber; n-next=NULL; Static *m=queue; while(m-next){m=m-next;} m-next=n; //h- } void Init(FixedList *head,int blocklength,Static *queue,int k,int pageLength,int memory) { int logicAddress,Page,remain; cout输入逻辑地址:endl; cinlogicAddress; Page=logicAddress/blocklength;//页号=(逻辑地址/块长),根据页号找到对应的块