分頁管理方式下採用位示圖表示實現主存分配和回收

struct bitGraph
{
	int a[8][8];//位示圖
	int freebit;//空閑塊數
}BG;
 
//進程的數據結構
struct proc
{
	char name[10];//進程名
	int *PT;//頁表
	int size;//進程所需要的空間
	struct proc *next;
	struct proc *front;
};

//分配內存
int getMalloc()
{
	int i = 0,j = 0,p = 0,k = 0,flag = 0;
	struct proc *process;
	process = (struct proc *)malloc(sizeof(struct proc));
	printf("請輸入進程名：\n");
	scanf("%10s",process->name);
	process->next = head->next;
	if(head->next != NULL)
		head->next->front = process;
	head->next = process;
	process->front = head;
	printf("請輸入進程所需內存大小：\n");
	scanf("%d",&process->size);
	if(process->size > BG.freebit)
	{
		printf("對不起，空閑空間不足以分配如此多內存給該進程。\n");
		return 0;
	}
	else
	{
		process->PT = new int [process->size];
		for(i=0;i<8 && flag==0;i++)
			for(j=0;j<8 && flag==0;j++)
			{
				if(!BG.a[i][j])
				{
					BG.a[i][j] = 1;
					BG.freebit--;
					process->PT[k] = 8*i + j;
					k++;
					if(k == process->size)
						flag = 1;
				}
			}
	}
	printf("\n位示圖：\n");
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
			printf("%d",BG.a[i][j]);
		printf("\n");
	}
}
 
//回收內存
int setFree()
{
	char name[10];
	int flag = 0,i = 0,j = 0;
	struct proc *p = head;
	printf("請輸入需要回收的進程名：");
	scanf("%10s",&name);
	for(p = head;p != NULL;p = p->next)
	{
		if(strcmp(p->name , name)==0)//找到該進程，將其從進程鏈表中刪除，並改寫位示圖
		{
			flag = 1;
			for(i=0;i < p->size;i++)
			{
				int m = p->PT[i]/8;
				int n = p->PT[i]%8;
				BG.a[m][n]= 0;
				BG.freebit++;
			}
			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);
			}
		}
	}
	if(flag == 0)
		printf("沒有該進程！\n");
	else
		printf("回收成功！\n");
	printf("\n位示圖：\n");
	for(i=0;i<8;i++)
	{
		for(j=0;j<8;j++)
			printf("%d",BG.a[i][j]);
		printf("\n");
	}
}
 
//顯示進程頁表
int showMemo()
{
	char name[10];
	int flag = 0,i = 0;
	struct proc *p = head;
 
	printf("請輸入進程名：");
	scanf("%10s",&name);
	for(p = head;p != NULL;p = p->next)
	{
		if(strcmp(p->name , name)==0)
		{
			printf("	進程名  頁號    塊號\n");
			for(i=0;i<p->size;i++)
			{
				printf("%10s	%d	%d\n",p->name,i,p->PT[i]);
				flag = 1;
			}
		}
	}
	if(flag == 0)
		printf("沒有該進程！\n");
}
 
int main()
{
	char choose;
	BG.a[8][8] = 0;
	BG.freebit = 64;
 
	head = (struct proc *)malloc(sizeof(struct proc));
	if(head==NULL)
	{
		printf("error in allocating...\n");
	}
	else
		printf("successed\n");
	head->next = head->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':
				showMemo();
				gets(buf);break;
			case '4':
				exit(1);gets(buf);break;
			default:
				gets(buf);
				printf("輸入錯誤！請重新輸入。\n");break;
		}
		printf("\n");
		getchar();
	}while(choose != '4');
}