連續磁盤存儲空間的分配和回收

struct FreeBlockMenu
{
	long FBbegin;//起始空閑塊號
	long num;//空閑塊個數
	struct FreeBlockMenu *next;
	struct FreeBlockMenu *front;
};
 
struct FiletoWrite
{
	char name[10];//裝入的文件名，供回收磁盤空間時查找
	long size;//文件大小
	long addr_zhumian;//裝入磁盤的首地址_柱面號
	long addr_cidao;//裝入磁盤的首地址_磁道號
	long addr_jilu;//裝入磁盤的首地址_物理記錄號
	struct FiletoWrite *next;
	struct FiletoWrite *front;
};

//分配磁盤空間
int getMalloc()
{
	int flag = 0;
	struct FreeBlockMenu *p = FBhead;
	struct FiletoWrite *File;
	File = (struct FiletoWrite *)malloc(sizeof(struct FiletoWrite));
	printf("請輸入裝入的文件名：\n");
	scanf("%10s",File->name);
	printf("請輸入所需要的磁盤空間大小：\n");
	scanf("%d",&File->size);
	for(p = FBhead->next;p != NULL;p = p->next)
	{
		flag = 1;
		if(p->num >= File->size )
		{
			//分配空間，塊號轉化為物理地址
			File->addr_zhumian = (p->FBbegin/6)/20;
			File->addr_cidao = (p->FBbegin/6)%20;
			File->addr_jilu = p->FBbegin%6;
			//加入文件鏈表中
			File->next = Filehead->next;
			if(Filehead->next != NULL)
			Filehead->next->front = File;
			Filehead->next = File;
			File->front = Filehead;
 
			if(p->num > File->size)
			{
				//修改該塊的起始地址和塊數
				p->FBbegin = p->FBbegin + File->size;
				p->num = p->num - File->size;
			}
			else if(p->num == File->size)
			{
				//從空閑塊表中刪除該結點
				if(p->front != NULL)
				{
					if(p->next != NULL)
					{
						p->front->next = p->next;
						p->next->front = p->front;
						free(p);
					}
					else
					{
						p->front->next = p->next;
						free(p);
					}
				}
				else
				{
					p->next->front = p->front;
					free(p);
				}
			}
			printf("\n分配磁盤成功！\n該文件的物理地址為：(柱面號	磁道號	物理塊號)\n");
			printf("			%d	%d	%d\n",File->addr_zhumian,File->addr_cidao,File->addr_jilu);
		}
	}
	if(flag == 0)
	{
		printf("對不起，目前沒有足夠的磁盤空間分配給該文件。");
		return 0;
	}
}
int showDisk();
 
//回收磁盤空間
int setFree()
{
	char name[10];
	int flag = 0;
	struct FiletoWrite *p = Filehead;
	printf("請輸入要刪除的文件名：\n");
	scanf("%10s",&name);
	for(p = Filehead;p != NULL;p = p->next)
	{
		if(strcmp(p->name , name)==0)//找到該文件
		{
			flag = 1;
			int houhebing=0,qianhebing=0;
			long m = p->addr_zhumian;
			long n = p->addr_cidao;
			long k = p->addr_jilu;
			long addr =120*m + 6*n + k;//塊號
 
			//先考慮和後面的部分或許會有合併的情況
			long int tail=addr+p->size;
			struct FreeBlockMenu *pNode,*qNode;
 
			pNode=FBhead->next;
 
			while(pNode!=NULL)
			{
				if(pNode->FBbegin==tail)
				{
					pNode->FBbegin=addr;
					pNode->num=pNode->num+p->size;
					houhebing=1;
					qNode=pNode;
					break;
				}
				pNode=pNode->next;
			}
 
			//再考慮是否可以和前面的進行合併
			pNode=FBhead->next;
			while(pNode!=NULL)
			{
				if(pNode->FBbegin+pNode->num==addr)
				{
					if(houhebing==0)
					{
						pNode->num=pNode->num+p->size;
						qianhebing=1;
						break;
					}
					else if(houhebing==1)
					{
						pNode->num+=qNode->num;
						pNode=FBhead;
						while(pNode->next!=qNode)
							pNode=pNode->next;
						pNode->next=qNode->next;
						free(qNode);
						qianhebing=1;
						break;
					}
				}
				pNode=pNode->next;
			}
 
			//如果沒有和前面的或者後面的進行合併，則新建一個表目
			if(qianhebing==0 && houhebing==0)
			{
		        	pNode=(struct FreeBlockMenu*)malloc(sizeof(struct FreeBlockMenu));
		         	pNode->FBbegin=addr;
		        	pNode->num=p->size;
				if(FBhead->next==NULL)
				{
					FBhead->next=pNode;
					pNode->front=FBhead;
					pNode->next=NULL;
					FBhead->front=NULL;
				}
				else
				{
					pNode->next=FBhead->next;
					FBhead->next->front=pNode;
					FBhead->next=pNode;
					pNode->front=FBhead;
				}
			}
 
			//在文件鏈表中刪除該文件
			struct FiletoWrite *pPrev=p->front;
			if(p->next==NULL)
			{
				pPrev->next=NULL;
				free(p);
			}
			else
			{
				pPrev->next=p->next;
				p->next->front=pPrev;
			}
		}
	}
	if(flag == 0)
		printf("沒有該文件！\n");
	else
		printf("刪除文件成功！\n");
}
 
//顯示磁盤空閑區表
int showDisk()
{
	struct FreeBlockMenu *p = FBhead;
	printf("\n磁盤空閑塊表\n");
	printf("起始地址	空閑塊大小\n");
	for(p = FBhead->next;p != NULL;p = p->next)
		printf("	%ld	%ld\n",p->FBbegin,p->num);
}
 
int main()
{
	char choose;	
	FBhead = (struct FreeBlockMenu *)malloc(sizeof(struct FreeBlockMenu));
	if(FBhead == NULL)
	{
		printf("error in allocating...\n");
	}
	else
		printf("successed\n");
	struct FreeBlockMenu *pNew=(struct FreeBlockMenu*)malloc(sizeof(struct FreeBlockMenu));
 
	pNew->FBbegin = 0;
	pNew->num = 24000;
	pNew->next = pNew->front = NULL;
 
	FBhead->next=pNew;
	FBhead->front=NULL;
	pNew->front=FBhead;
	pNew->next=NULL;
	Filehead = (struct FiletoWrite *)malloc(sizeof(struct FiletoWrite));
	Filehead->next = Filehead->front = NULL;
	char buf[128];
	do
	{
	system("clear");
	printf("---------------------------\n");
	printf("1.請求磁盤空間\n");
	printf("2.回收磁盤空間\n");
	printf("3.顯示磁盤空閑區表\n");
	printf("4.退出\n");
	printf("---------------------------\n");
		printf("請選擇：");
		scanf("%c",&choose);
		switch(choose)
		{
			case '1':
				getMalloc();
				gets(buf);break;
			case '2':
				setFree();
				gets(buf);break;
			case '3':
				showDisk();
				gets(buf);break;
			case '4':
				exit(1);break;
			default:
				gets(buf);
				printf("輸入錯誤！請重新輸入。\n");
				break;
		}
		printf("\n");
		getchar();
	}while(choose != '4');
}