山东建筑大学版操作系统 实验四

1、实验四、文件系统原理与模拟实现实验目的:了解操作系统中文件系统的结构和管理过程，掌握经典的算法：混合索 引与成组链接法等方法。实验内容：编程模拟实现混合索引和成组链接法算法;实验步骤：模拟混合索引的原理；模拟成组链接法的原理；实验代码：#include#include int MA100;/*空闲块数组*/intA94 = 3,1,2,3,3,4,5,6,0,0,0,0,0,0,0,0,3,0,7,8,0,0,0,0, 0,0,0,0,0,0,0,0,0,0,0,0; /* 磁盘空间*/ int mark100;/*存放已分配的块*/int No=0;/*已分配的块数*/void displa

2、y1() ( int i,j,temp,count; No=0; if(MA!=0) (i=MA0;printf(ngroup1:)； for(j=1;j=i;j+)( printf(%d ,MAj);mark+No=MAj; temp=MAj; count=2; while(Atemp!=0)( printf(ngroup%d:,count);i=Atemp0;for(j=1;j=i;j+)( printf(%d ,Atempj);mark+No=Atempj;count+;temp=Atempj;printf(ngroup%d:，count);i=Atemp0;for(j=2;j0)( p

3、rintf(%d ,Atempj);mark+No=Atempj;else(i=MA0;if(i=1)printf(nThe blocks are all assigned); else( printf(ngroup1:);for(j=2;j=i;j+)( printf(%d ”,MAj);mark+No=MAj;void display() /*显示分组情况*/( int i,j;if(MA0!=0)display1();else(i=MA0;for(j=0;j1)/*若该组不止一个空闲块*/(i=MA0;s=MAi;MA0-;printf(nnumber of the block:%d”,

4、s);else if(MA0=1)/* 只剩一个空闲块*/(if(MA0!=0)/*还有其它空闲块组*/(s=MA0;for(i=0;i=3;i+)A0i=Asi;MA0-;printf(nnumber of the block:%d”,s);else/*没有其它空闲块组*/( printf(nThere isnt any space);return;else/*当前组已分配完*/(for(i=0;i=3;i+)MAi=A0i;assign();display();/*显示分组情况*/void callback()/* 回收空闲块 */( int i,j,temp;printf(ninput

5、the No. of the block you want to callback:);scanf(%d”,&j);getchar();/*得到待回收的空闲块号*/for(temp=1;temp=No;temp+)( if(marktemp=j) break;if(tempNo+1)/*若该空闲块已在，退出*/( printf(nThe block is in the disk);return;if(MA03)/*当前组不满3块*/(i=MA0;MAi+1=j;MA0+;else/*已有3块*/(for(i=0;i=3;i+)Aji=MAi;MA0 = 1;MAj=j;display(); /

6、* 显示 */void menu()/*功能选择函数*/( int choice;char judge;printf(ninput your choice:(1-assign,2-callback):);scanf(d,&choice);getchar();if(choice=1)assign();else if(choice=2)callback();elseprintf(ninvalid command!);printf(ncontinue or not?(y-Yes,n-Not):);scanf(%c,&judge);getchar();if(judge=y)menu();else( printf(nNow the graph is:);display();prin