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

}

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];