实验四

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
typedef struct process
{
    int number;
    char name[20];
    int begin;
    int size;
    char status;
}Pro;
main()
{
    int sys=1024;
    char s;
    int i=0;
    int choice;
    int count1=0;
    int count2=0;
    int flag=1;
    char j[10];
    Pro a[10];
    strcpy(a[0].name,"system");//a[0]是系统进程
    a[0].begin=0;
    a[0].size=100;
    a[0].status=‘f‘;
    
    printf("初始化,设内存总容量为%dK\n",sys);
    printf("系统从低地址部分开始使用,占用%dK\n\n",a[0].size);
    
    printf("空闲区表Free:\n");
    printf("\tNO.\t proname\tbegin\t size\t status\n");
    printf("\tNO.1\t -----\t\t %d\t %d\t  f\n\n",a[0].size,sys-a[0].size);
    
    printf("==============================================\n");
    printf("已分配分区表::\n");
    printf("\tNO.\t proname\tbegin\t size\t status\n");
    printf("\tNO.1\t %s\t\t %d\t %d\t  %c\n",a[0].name,a[0].begin,a[0].size,a[0].status);
    printf("\n\n");
    
    printf("内存使用情况,按起始增长的排序:\n");
    printf("printf sorted by address::\n");
    printf("\tNO.\t proname\tbegin\t size\t status\n");
    printf("\t---------------------------------------------\n");
    printf("\tNO.1\t %s\t\t %d\t %d\t  u\n",a[0].name,a[0].begin,a[0].size);
    printf("\tNO.2\t -----\t\t %d\t %d\t  f\n\n",a[0].size,sys-a[0].size);
    
    printf("\n\n");
    i=1;
    while (1)
    {
        printf("请选择:分配a 回收r 退出e\n");
        scanf("%s",&s);
        switch (s)
        {
        case ‘a‘:
            printf("请输入进程名:");
            scanf("%s",&a[i].name);
            printf("请输入进程大小:");
            scanf("%d",&a[i].size);
            a[1].begin=100;
            a[i].status=‘u‘;
            flag++;   //当前的进程数
            
            printf("插入完成!\n");
            printf("空闲区表Free:\n");
            printf("\tNO.\t proname\tbegin\t size\t status\n");
            for (i=0;i<flag;i++)
            { 
                a[i+1].begin=a[i].begin+a[i].size;
                count1=a[i+1].begin;
                count2=sys-count1;
            }
            printf("\tNO.1\t -----\t\t %d\t %d\t  f\n\n",count1,count2);
            a[0].status=‘u‘;
            printf("==============================================\n");
            printf("已分配分区表:\n");
            printf("\tNO.\t proname\tbegin\t size\t status\n");
            for(i=0;i<flag;i++)
            {
                a[i+1].begin=a[i].begin+a[i].size;
                printf("\tNO.%d\t %s\t\t %d\t %d\t  %c\n",i+1,a[i].name,a[i].begin,a[i].size,a[i].status);
            }
            printf("\n\n");
            
            printf("内存使用情况,按起始增长的排序:\n");
            printf("printf sorted by address:\n");
            printf("\tNO.\t proname\tbegin\t size\t status\n");
            printf("\t--------------------------------------------\n");
            for (i=0;i<flag;i++)
            {
                printf("\tNO.%d\t %s\t\t %d\t %d\t  %c\n",i+1,a[i].name,a[i].begin,a[i].size,a[i].status);
            }
            printf("\tNO.%d\t -----\t\t %d\t %d\t  f\n\n",flag+1,count1,count2);
            break;
        case ‘r‘:
            printf("输入进程名:");
            scanf("%s",&j);
            printf("回收成功!\n");
            for (i=0;i<flag;i++)
            {
                if (strcmp(j,a[i].name)==0)
                {
                    strcpy(a[i].name,"-----");
                    a[i].status=‘f‘;
                }
            }
            printf("空闲区表Free:\n");
            printf("\tNO.\t proname\tbegin\t size\t status\n");
            for (i=0;i<flag;i++)
            {
                if (a[i].status==‘f‘){
                    printf("\tNO.%d\t %s\t\t %d\t %d\t  %c\n",i,a[i].name,a[i].begin,a[i].size,a[i].status);}
            }
            printf("\tNO.%d\t -----\t\t %d\t %d\t  f\n\n",flag-1,count1,count2);
            
            printf("==============================================\n");
            printf("已分配分区表::\n");
            printf("\tNO.\t proname\tbegin\t size\t status\n");
            for(i=0;i<flag;i++)
            {
                if (a[i].status==‘u‘){
                    printf("\tNO.%d\t %s\t\t %d\t %d\t  %c\n",i,a[i].name,a[i].begin,a[i].size,a[i].status);}
            }
            printf("\n\n");
            
            printf("内存使用情况,按起始增长的排序:\n");
            printf("printf sorted by address:\n");
            printf("\tNO.\t proname\tbegin\t size\t status\n");
            printf("\t--------------------------------------------\n");
            for (i=0;i<flag;i++)
            {
                printf("\tNO.%d\t %s\t\t %d\t %d\t  %c\n",i+1,a[i].name,a[i].begin,a[i].size,a[i].status);
            }
            printf("\tNO.%d\t -----\t\t %d\t %d\t  f\n\n",flag+1,count1,count2);
            break;
        case ‘e‘:
            exit(0);
            break;
        }
        if(sys-a[0].size<a[i].size)
        {
            printf("找不到空闲区域放置该作业，请重新输入：\n");
            
            
        }
    }
    printf("\n\n请选择以下其中一种分配算法：1/2/3/4  \n");
    printf("1、首次适应算法\n");
    printf("2、循环首次适应算法\n");
    printf("3、最佳适应算法\n");
    printf("4、最坏适应算法\n");
    scanf("%d",&choice);
    switch(choice)
    {
    case 1:
        
        break;
        
    }
    
}