【操作系统】实验四 主存空间的分配和回收

#include<stdio.h>
#include<conio.h>
#include<string.h>
#define MAX 24
void showmenu(int num);

struct partition{
    
    char pn[10];
    int begin;
    int size;
    int end;   
    char status;  
    };
typedef struct partition PART;

PART Total[MAX] ;
PART userjob ;

void init(){

strcpy(Total[0].pn,"No.1");
Total[0].begin=0;
Total[0].size=100;
Total[0].end=100;
Total[0].status='u';
}


void input(int num){

    int i=0;
    for(i=0;i<num;i++){
    //内存名
    printf("内存名:
");
    scanf("%s" ,&Total[i+1].pn);
    //开始内存大小
    printf("内存大小:
");
    scanf("%d",&Total[i+1].size);
    //内存状态
    printf("内存状态:
");
    scanf("%s",&Total[i+1].status);
    //作业开始大小
    Total[i+1].begin=Total[i].end;
//    printf("%d
",Total[i+1].begin);
    //作业结束大小
    Total[i+1].end=Total[i+1].begin+Total[i+1].size;
//    printf("%d
",Total[i+1].end);

    }

}


void output(int num){
int i=0;
printf("内存名	开始	大小	结束	状态
");    
    for(i=0;i<MAX;i++)
    {
        if(Total[i].size!=0){
        printf("%s 	 %d 	 %d 	 %d 	 %c 
" ,Total[i].pn,Total[i].begin,Total[i].size,Total[i].end,Total[i].status);
        }
    }


}

void inputjob(){
printf("=================================");
printf("


");
printf("			用户输入作业
");
printf("内存名:
");
    scanf("%s" ,&userjob.pn);
    //开始内存大小
    printf("内存大小:
");
    scanf("%d",&userjob.size);
    //作业状态
    userjob.status='u';
    //作业开始大小
    userjob.begin=0;
    //作业结束大小
    userjob.end=0;


}

void firstadapt(int num){        //首次适应算法
int i=0;
    for(i=0;i<=num;i++)
    {
            
        if(Total[i].status=='f')
        {
            if(Total[i].size==userjob.size)
            {
                strcpy(Total[i].pn,userjob.pn);
                Total[i].status='u';
                printf("%d
",userjob.size);
                output(num);
            }
            else if(Total[i].size>userjob.size){
                strcpy(Total[num+1].pn,Total[i].pn);
                Total[num+1].size=Total[i].size-userjob.size;
                strcpy(Total[i].pn,userjob.pn);
                Total[i].end=Total[i].begin+userjob.size;
                Total[i].size=userjob.size;
                Total[i].status='u';
                Total[num+1].begin=Total[i].end;
                Total[num+1].end=Total[num+1].begin=+Total[num+1].size;
                Total[num+1].status='f';
                output(num);
                
            }
            else
                break;
    
        }
    
    
    }



}

//最佳适应算法

void bestfit(int num){
    int i,j; int flag; int now;
    j=0;
    for(i=0;i<=num;i++)
    {
        if(Total[i].status=='f'&&Total[i].size>=userjob.size)
        {            now=i;
                    flag=Total[i].size;
                    printf("%d
",flag);
                for(j=i+1;j<=num;j++)
                {
                    if(Total[j].status=='f'&&Total[j].size>=userjob.size&&Total[j].size<flag)
                    {
                        
                        flag=Total[j].size;
                        now=j;    
                    }
            
                }
        
                break;    
        }
    
    }
            
                strcpy(Total[now].pn,userjob.pn);
                Total[now].status='u';
                printf("%d
",userjob.size);
                Total[now].end=Total[now].begin+userjob.size;
                Total[now].size=userjob.size;
                output(num);


}

//最坏适应算法
void badlyfit(int num){
    int i,j; int flag; int now;
    j=0;
    for(i=0;i<=num;i++)
    {
        if(Total[i].status=='f'&&Total[i].size>=userjob.size)
        {        now=i;
                flag=Total[i].size;
                    printf("%d
",flag);
                for(j=i+1;j<=num;j++)
                {
                    if(Total[j].status=='f'&&Total[j].size>=userjob.size&&Total[j].size>flag)
                    {    
                        flag=Total[j].size;
                        now=j;    
                    }
            
                }
        
                break;    
        }
    
    }
            
                strcpy(Total[now].pn,userjob.pn);
                Total[now].status='u';
                printf("%d
",userjob.size);
                Total[now].end=Total[now].begin+userjob.size;
                Total[now].size=userjob.size;
                output(num);


}





void selecttypr(int num){
    int select;int end=0;
printf("=================================");
printf("


");
printf("			用户选择分配算法
");
printf("			 1.首次适应算法
");
printf("			 2.循环首次适应算法
");
printf("			 3.最佳适应算法
");
printf("			 4.最坏适应算法
");
scanf("%d",&select);
    switch(select){
    case 1 : 
        printf("首次适应算法
");
        firstadapt(num);    
        break;
    case 2 : 
        printf("循环首次适应算法
");
        break;
    case 3 : 
        printf("最佳适应算法
");
        bestfit(num);
        break;
    case 4 : 
        printf("最坏适应算法
");
        badlyfit(num);
        break;
    default :
        printf("输入错误
");
        break;

    }

}


void conback(int id,int num){
    int i;
    if(id>num){
        printf("			输入的id大于总的");
    }
    if(Total[id-1].status=='f'&&Total[id+1].status=='f'&&Total[id-1].end==Total[id].begin&&Total[id].end==Total[id+1].begin){
        for(i=id-1;i<=num-id+1;i++){
                Total[id-1].size=Total[id+1].end-Total[id-1].begin;
                Total[id-1].end=Total[id+1].end;
                Total[id-1].status='f';
                
        }    
                
    }

    else if(Total[id-1].status=='f'&&Total[id+1].status=='u'){
                
        
    
    }

}






void select(int flag,int num){
    int id;
    switch(flag){
    case 1 : 
            inputjob();
            selecttypr(num);
        break;
    case 2 : 
            printf("			请输入需要收回内存id
");
            scanf("%d",&id);
//            conback(id,num);
        break;
    default :
        printf("输入错误");
        break;


    }

}


void showmenu(int num){
int flas;
printf("=================================");
printf("


");
printf("			用户选择分配算法
");
printf("			 1.插入内存
");
printf("			 2.回收内存
");
scanf("%d",&flas);
select(flas,num);

}


void main(){
int num;
printf("初始化，设内存的总量为512k
");
printf("系统从低地址开始分配，占用100k
");
init();

printf("=================================");
printf("


");
printf("模拟内存
");
scanf("%d",&num);
input(num);

printf("=================================");
printf("


");
output(num);



showmenu(num);

}