页面置换算法(FIFO算法,LRU算法).doc

实验四 页面置换算法 实验流程图 实验程序 #include stdio.h #include stdlib.h #include malloc.h #define null 0 #define len sizeof(struct page) struct page { int num; int tag; struct page *next; }; struct page *create(int n) /*建立分配的内存空间，并初始化，返回头结点*/ {int count=1; struct page *p1,*p2,*head; head=p2=p1=(struct page *)malloc(len); //开辟一个新的单元,并将malloc返回的指针转换为结构体类型的指针 p1-tag=-1;p1-num=-1; while(countn) {count++; p1=(struct page *)malloc(len); p1-tag=-1;p1-num=-1; p2-next=p1; p2=p1; } p2-next=null; return(head); } void FIFO(int array[],int n) {int *p; struct page *cp,*dp,*head,*new1; int count=0; head=create(n); p=array; while(*p!=-1) { cp=dp=head; for(;cp-num!=*pcp-next!=null;) cp=cp-next; if (cp-num==*p) printf( ! ); else { count++; cp=head; for(;cp-tag!=-1cp-next!=null;) cp=cp-next; if(cp-tag==-1) {cp-num=*p; cp-tag=0; printf( * ); } else {new1=(struct page*)malloc(len); new1-num=*p; new1-tag=0; new1-next=null; cp-next=new1; head=head-next; printf( %d ,dp-num); free(dp); } } p++; } printf(\nQueye Zongshu : %d \n,count); } void LRU(int array[],int n) {int count=0,*p=array; struct page *head,*cp,*dp,*rp,*new1,*endp; head=create(n); while(*p!=-1) {cp=dp=rp=endp=head; for(;endp-next!=null;) endp=endp-next; for(;cp-num!=*pcp-next!=null;) {rp=cp;cp=cp-next;} if(cp-num==*p) {printf( ! ); if(cp-next!=null) {if(cp!=head) rp-next=cp-next; else head=head-next; } endp-next=cp; cp-next=null; } else {count++; cp=rp=head; for(;cp-tag!=-1cp-next!=null;) cp=cp-next; if(cp-tag==-1) {printf( * ); cp-num=*p; cp-tag=0; } else {new1=(struct page *)malloc(len); new1-num=*p; new1-tag=0; new1-next=null; cp-next=new1; dp=head; head=head-n