操作系统课程设计 - 动态分区分配存储管理(5)

}

21

}

}

if((ary1[recycle-2][3]==2)&&(ary1[recycle][3]==2))//空闲区上下邻接的都是已分配盘块 { }

ary1[recycle-1][3]=0; k=0;

for(j=0;j

//cout<<\if(ary1[j][3]!=2) { }

ary2[k][0]=ary1[j][0]; ary2[k][1]=ary1[j][1]; ary2[k][2]=ary1[j][2]; k++;

cout<<\回收区上下连接的都是空闲盘块\cout<

for(j=0;j

//cout<<\if(ary1[j][3]!=2) { }

ary2[k][0]=ary1[j][0]; ary2[k][1]=ary1[j][1]; ary2[k][2]=ary1[j][2]; k++;

ary1[recycle-1][0]=ary1[recycle+1][0]-2; ary1[recycle-1][1]=ary1[recycle+1][1]; ary1[recycle-1][2]=ary1[recycle+1][2]; ary1[recycle-1][3]=ary1[recycle+1][3];

n=k;

n=k;

}

//紧凑算法 void compact(){

num_avl=0;

for(id2=0;id2

if(ary1[id2][3]!=2) {

22

int id1=0;//记录已经分配的内存数量 int id2;//循环量

int num_avl;//记录空闲盘块数量 int sum_avl=0;//总共空闲区大小 int num_apl=0; //统计总共空闲区有多大 vision();

for(id2=0;id2

for(id2=0;id2

//最后一块空闲块

ary1[num_apl][0]=num_apl+1; ary1[num_apl][1]=sum_avl;

ary1[num_apl][2]=ary1[num_apl-1][1]+ary1[num_apl-1][2]; ary1[num_apl][3]=0;

m=num_apl+1;//包括最后一个空闲区

if(ary1[id2][3]==2) { }

ary1[num_apl][0]=num_apl+1; ary1[num_apl][1]=ary1[id2][1]; if(num_apl==0) { }

ary1[num_apl][3]=2; num_apl++;

//cout<<\

ary1[num_apl][2]=0;

ary1[num_apl][2]=ary1[num_apl-1][1]+ary1[num_apl-1][2]; }else{

sum_avl=sum_avl+ary2[id2][1];

}

//主函数入口

void main() {

if(choice1==1) { }

num=rand()&10; q=num;

int id3=2+rand()%8; m=id3;//内存区数量 create_apply(); create_pro();

int i; int j; int num;

int choice1; //操作选择标记 int choice2;

int flag=1; //标记是否再执行 while(flag==1){

cout<<\cout<<\信息产生方式 ******\cout<<\自动生成 2: 手动输入 ******\cout<<\cout<<\请选择产生内存分区和作业信息的方式！ \cin>>choice1;

}

n=num_avl; vision();

}

ary2[num_avl][0]=ary1[id2][0]; ary2[num_avl][1]=ary1[id2][1]; ary2[num_avl][2]=ary1[id2][2]; num_avl++;

if(choice1==2) { }

vision();

cout<<\请选择处理算法----------------------**\

23

create_zuoye(); create_fenqu();

}

24

}

cout<<\cout<<\是否继续演示别的算法！\cout<<\是 0--否 \cout<<\int o; cin>>o; flag=o;

cout<<\首次适应算法-----2循环首次适应算法-----3最佳适应算法 **\cout<<\最坏适应算法----------5紧凑算法------------6回收算法 **\cout<<\cin>>id1; if(id1==1) if(id1==2) if(id1==3) if(id1==4) if(id1==5) }

{first_fit();} {next_fit();} {best_fit();} {worst_fit();} { compact();}

if(id1==6) {

cout<<\生成内存状态******************\int id3=rand(); m=5;//内存区数量 create_apply(); vision();

cout<<\请您从空闲列表中选出需要回收的内存块（必须是已分配）：\cin>>recycle;

if((recycle>m)||(recycle<1)) { }

cout<<\错误:内存中不存在此块！\int id2=-9999; for(i=0;i

if(id2==-9999){

apply_recycle();} if(ary2[i][0]==recycle) { }

cout<<\错误：输入的为空闲盘块！\id2=1; break;

}else{

25