模擬操作系統動態內存管理（c實現）

操作系統對內存申請與釋放（對連續的區域合並）的模擬

#include <stdio.h>
#include <stdlib.h>
#define N 10      //預設的內碎片的最小值
#define M_set 1024//預設的內存大小

struct mem_block
{
    int num;
    int addr;
    int length;
    mem_block *next;
};
typedef mem_block* point;

int numcal_M=1;//內存id
int numcal_P=1;//進程id

void create(point &pHead);
void init_get_size(point pHead);
void insert_P(point pHead,int addr,int siz);
void sort_size(point &pHead);//small to big
void sort_addr(point &pHead);
void apply(point M_pHead,point P_pHead);
void chick_conn(point pHead);
void insert_M(point pHead,int addr,int siz);
void free(point P_pHead,point M_pHead);
void print(point pHead);
void destory(point pHead);
int main()
{
    printf("                    *********************************************\n");
    printf("                    **         內存管理系統 (最佳適應算法)     **\n");
    printf("                    *********************************************\n");
    point mem;
    create(mem);
    init_get_size(mem);

    point prog;
    create(prog);

    int op=-1;
    while(1)
    {
        printf("\n\n請輸入要進行的操作：\n1.申請內存 2.釋放內存 3.顯示當前內存情況 4.顯示被申請走的內存塊 0.退出操作\n");
        scanf("%d",&op);
        switch(op)
        {
        case 1:
            apply(mem,prog);
            break;
        case 2:
            free(prog,mem);
            break;
        case 3:
            sort_addr(prog);
            printf("內存號     起始地址       內存大小\n");
            print(mem);
            break;
        case 4:
            printf("進程號     起始地址       內存大小\n");
            print(prog);
            break;
        case 0:
            destory(mem);
            destory(prog);
            exit(0);
        default:
            printf("非法操作\n");
            break;
        }
    }
    return 0;
}
void create(point &pHead)
{
    pHead = (point)malloc(sizeof(mem_block));
    pHead ->num=0;
    pHead->addr=0;
    pHead->length = 0;
    pHead->next=NULL;
    return;
}

void insert_P(point pHead,int addr,int siz)
{
    point pPro=(point)malloc(sizeof(mem_block));
    pPro->length=siz;
    pPro->addr=addr;
    pPro->next=NULL;
    pPro->num=numcal_P;
    numcal_P++;

    point pCur = pHead;
    while(pCur->next!=NULL)
        pCur=pCur->next;
    pCur->next=pPro;
    return;
}
void sort_size(point &pHead)//small to big
{
    point pCur_i=pHead,pCur_j;
    int num,addr,siz;
    while(pCur_i->next!=NULL)
    {
        pCur_i=pCur_i->next;
        pCur_j=pCur_i;
        while(pCur_j->next!=NULL)
        {
            pCur_j=pCur_j->next;
            if(pCur_j->length  < pCur_i->length)
            {
                num=pCur_i->num;
                addr=pCur_i->addr;
                siz=pCur_i->length;

                pCur_i->num=pCur_j->num;
                pCur_i->addr=pCur_j->addr;
                pCur_i->length=pCur_j->length;

                pCur_j->num=num;
                pCur_j->addr=addr;
                pCur_j->length=siz;
            }
        }
    }
}
void sort_addr(point &pHead)
{
    point pCur_i=pHead,pCur_j;
    int num,addr,siz;
    while(pCur_i->next!=NULL)
    {
        pCur_i=pCur_i->next;
        pCur_j=pCur_i;
        while(pCur_j->next!=NULL)
        {
            pCur_j=pCur_j->next;
            if(pCur_j->addr  < pCur_i->addr)
            {
                num=pCur_i->num;
                addr=pCur_i->addr;
                siz=pCur_i->length;

                pCur_i->num=pCur_j->num;
                pCur_i->addr=pCur_j->addr;
                pCur_i->length=pCur_j->length;

                pCur_j->num=num;
                pCur_j->addr=addr;
                pCur_j->length=siz;
            }
        }
    }
}
void apply(point M_pHead,point P_pHead)
{
    sort_size(M_pHead);
    int siz;
    printf("請輸入要申請內存的大小\n");
    scanf("%d",&siz);
    point pCur=M_pHead;
    int flag=1;
    while(pCur->next!=NULL)
    {

        if(pCur->next->length-siz<=N&&pCur->next->length>=siz)
        {
            insert_P(P_pHead,pCur->next->addr,pCur->next->length);
            pCur->next=pCur->next->next;

            flag=0;
            break;
        }
        else if(pCur->next->length-siz>N)
        {

            insert_P(P_pHead,pCur->next->addr,siz);
            pCur->next->length-=siz;
            pCur->next->addr+=siz;
            flag=0;
            break;
        }
        pCur=pCur->next;
    }
    if(flag)  printf("哪有那么大的空間呀，插不進去\n");
    else      printf("分配成功\n");
    return;

}

void init_get_size(point pHead)
{
    point pPro=(point)malloc(sizeof(mem_block));

    pPro->length=M_set;
    pPro->addr=0;
    pPro->next=NULL;
    pPro->num=numcal_M;

    numcal_M++;
    pHead->next=pPro;
    return;
}
void chick_conn(point pHead)
{
   point i,j;
   for(i=pHead;i->next!=NULL;i=i->next)
        for(j=pHead;j->next!=NULL;j=j->next)
   {
       if( (j->next->addr) == (i->next->addr) + (i->next->length) )
       {
           i->next->length+=j->next->length;
           j->next=j->next->next;
           break;
       }
   }
   return;
}

void insert_M(point pHead,int addr,int siz)
{

    point pCur=pHead;
    int flag=0;
    while(pCur->next!=NULL)
    {
        if(pCur->next->addr+pCur->next->length==addr)
        {
            flag=1;
            pCur->next->length+=siz;
            break;
        }
        pCur=pCur->next;
    }
    if(!flag)
    {
        point pPro=(point)malloc(sizeof(mem_block));
        pPro->length=siz;
        pPro->addr=addr;
        pPro->next=NULL;
        pPro->num=numcal_M;
        numcal_M++;

        pCur->next=pPro;

    }

   chick_conn(pHead);
    printf("釋放成功\n");
    return;
}
void free(point P_pHead,point M_pHead)
{
    int prog_num =0;
    printf("請輸入要釋放的內存塊號\n");
    scanf("%d",&prog_num);
    point pCur = P_pHead;
    int flag=1;
    while(pCur->next!=NULL)
    {
        if(pCur->next->num==prog_num)
        {
            flag=0;
            insert_M(M_pHead,pCur->next->addr,pCur->next->length);
            pCur->next=pCur->next->next;
            break;
        }
        pCur=pCur->next;
    }
    if(flag)
        printf("親，這個內存號不存在呀，要不你先按4，看看情況？\n");
}
void print(point pHead)
{
    int flg=0;
    point pCur=pHead;
    while(pCur->next!=NULL)
    {
        pCur=pCur->next;
        printf("%3d%12d%15d\n",pCur->num,pCur->addr,pCur->length);
        flg=1;
    }
    if(!flg)
        printf("\n\n         空鏈表，沒有數據    \n");
    printf("\n");
    return;
}
void destory(point pHead)
{
    point pNext=pHead->next;
    while(pHead->next!=NULL)
    {
        free(pHead);
        pHead=pNext;
        pNext=pHead->next;
    }
    free(pHead);
    pHead = NULL;
    printf("撤銷成功\n");
}