存储管理流程图及其代码精要.docVIP

1 2 实验程序 产生指令流文件produce_addstream.h #ifndef PRODUCE_ADDSTREAM_H #define PRODUCE_ADDSTREAM_H #includestdio.h #includestdlib.h #includetime.h #includeiomanip.h #includevector using namespace std; #define random(x) (rand()%x) #define MAX_LENGTH 320 struct produce { int num; //指令序号 int zhiling; //指令地址 int virtualpage; //指令虚页号 produce *next; }; struct produce*creatlist(); void insert(struct produce *first,struct produce *s); //插入一个节点（尾插法） void print(struct produce *first); //打印函数 int max(vectorvectorint ,int ); struct produce*creatlist() { srand((int)time(0)); struct produce*first=new produce; first-next=NULL; int m=0,m1=0; /* int yanzheng[20]={7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1}; for (int i=0;i(MAX_LENGTH/4);i++) { struct produce *s0; s0=new produce; s0-num=i*4+0; s0-zhiling=yanzheng[i*4+0]; s0-virtualpage=s0-zhiling; insert(first,s0); struct produce *s1; s1=new produce; s1-num=i*4+1; s1-zhiling=yanzheng[i*4+1]; s1-virtualpage=s1-zhiling; insert(first,s1); struct produce *s2; s2=new produce; s2-num=i*4+2; s2-zhiling=yanzheng[i*4+2]; s2-virtualpage=s2-zhiling; insert(first,s2); struct produce *s3; s3=new produce; s3-num=i*4+3; s3-zhiling=yanzheng[i*4+3]; s3-virtualpage=s3-zhiling; insert(first,s3); } //*/ //* for (int i=0;i(MAX_LENGTH/4);i++) { struct produce *s0; s0=new produce; m=random(MAX_LENGTH); s0-num=i*4+0; s0-zhiling=m+1; s0-virtualpage=s0-zhiling/10; insert(first,s0); m1=random(m+1); struct produce *s1; s1=new produce; s1-num=i*4+1; s1-zhiling=m1; s1-virtualpage=s1-zhiling/10; insert(first,s1); struct produce *s2; s2=new produce; s2-num=i*4+2; s2-zhiling=m1+1; s2-virtualpage=s2-zhiling/10; insert(first,s2); struct produce *s3; s3=new produce; s3-num=i*4+3; s3-zhiling=random(MAX_LENGTH-m1-2)+m1+2; s3-virtualpage=s3-zhiling/10; insert(first,s3); }//*/ return first; } void insert(struct produce *first,struct produce