5.1内存分配管理

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX 640

struct node  //瀹氫箟鍒嗗尯
{
  int address, size;
  struct node *next;
};
typedef struct node RECT;

/*-----鍑芥暟瀹氫箟-------*/
RECT *assignment(RECT *head,int application); //鍒嗛厤鍒嗗尯
void firstfit(RECT *head,RECT *heada,RECT *back1); //閽堝棣栨閫傚簲鍒嗛厤绠楁硶鍥炴敹鍒嗗尯
void bestfit(RECT *head,RECT *heada,RECT *back1);  //閽堝鏈€浣抽€傚簲鍒嗛厤绠楁硶鍥炴敹鍒嗗尯
int backcheck(RECT *head,RECT *back1); //鍚堟硶鎬ф鏌?
void print(RECT *head);   //杈撳嚭宸插垎閰嶅垎鍖鸿〃鎴栫┖闂插垎鍖?
/*-----鍙橀噺瀹氫箟-------*/
RECT *head,*heada,*back,*assign1,*p;
int application1,maxblocknum;
char way;  //鐢ㄤ簬瀹氫箟鍒嗛厤鏂瑰紡锛氶鍏堥€傚簲銆佹渶浣抽€傚簲銆佹渶宸€傚簲绛夛紝鐩墠鏈娇鐢?
int main()
{
  char choose;
  int check;
  RECT *allocated;
  head=malloc(sizeof(RECT)); //寤虹珛绌洪棽鍒嗗尯琛ㄧ殑鍒濆鐘舵€?
  p=malloc(sizeof(RECT));
  head->size=MAX;
  head->address=0;
  head->next=p;
  maxblocknum=1;
  p->size=MAX;
  p->address=0;
  p->next=NULL;
  print(head);  //杈撳嚭绌洪棽鍒嗗尯琛ㄧ殑鍒濆鐘舵€?
  printf("Enter the way (best or first (b/f))\n");
  scanf("%c",&way);
  heada=malloc(sizeof(RECT)); //寤虹珛宸插垎閰嶅垎鍖鸿〃鐨勫垵濮嬬姸鎬?
  heada->size=0;
  heada->address=0;
  heada->next=NULL;
  //print(heada);  //杈撳嚭绌洪棽鍒嗗尯琛ㄧ殑鍒濆鐘舵€?
  //way='f';
  do
  {     
    printf("Enter the allocate or reclaim (a/r),or press other key to exit.\n"); 
    scanf(" %c",&choose);     //閫夋嫨鍒嗛厤鎴栧洖鏀?      
    if(tolower(choose)=='a')                 //a涓哄垎閰?
    {
      printf("Input application:\n");
      scanf("%d",&application1);              //杈撳叆鐢宠绌洪棿澶у皬
      assign1=assignment(head,application1);  //璋冪敤鍒嗛厤鍑芥暟鍒嗛厤鍐呭瓨
      if (assign1->address==-1)               //鍒嗛厤涓嶆垚鍔?
        printf("Too large application! Allocation fails! \n\n");
      else                                    //鍒嗛厤鎴愬姛
        printf("Allocation Success! ADDRESS=%5d\n",assign1->address);
      printf("\n*********Unallocated Table*************\n");
      print(head);  //杈撳嚭
      printf("\n*********Allocated Table***  **********\n");
      print(heada);
    }
    else if (tolower(choose)=='r')          //鍥炴敹鍐呭瓨
    {
      back=malloc(sizeof(RECT));
      printf("Input address and Size:\n");
      scanf("%d%d",&back->address,&back->size);//杈撳叆鍥炴敹鍦板潃鍜屽ぇ灏?
      check=backcheck(head,back);
      if (check==1)
      {
        if(tolower(way)=='f')
          firstfit(head,heada,back);    //棣栧厛閫傚簲绠楁硶鍥炴敹
        else
          bestfit(head,heada,back);
        printf("\n*********Unallocated Table*************\n");
        print(head);  //杈撳嚭
        printf("\n*********Allocated Table***  **********\n");
        print(heada);
       }
    }
  }while(tolower(choose)=='a'||tolower(choose)=='r');
  exit(0);
} //main() end.

/*-------鍐呭瓨鍒嗛厤鍑芥暟-------*/
RECT *assignment(RECT *head,int application)
{
  RECT *after,*before,*assign;
  assign=malloc(sizeof(RECT));     //鐢宠鍒嗛厤绌洪棿
  assign->size=application;
  assign->next=NULL;
  if(application>head->size || application<0)
    assign->address=-1;            //鐢宠鏃犳晥
  else
  {
    before=head;
    after=head->next;
    while(after->size < application)//閬嶅巻閾捐〃锛屾煡鎵惧悎閫傚埌鑺傜偣
    {
      before=before->next;
      after=after->next;
    }
    if(after->size==application)    //鑻ヨ妭鐐瑰ぇ灏忕瓑浜庣敵璇峰ぇ灏忓垯瀹屽叏鍒嗛厤
    {
      if(after->size==head->size) maxblocknum--;
      before->next=after->next;
      assign->address=after->address;
      free(after);
    }
    else
    {
      if(after->size==head->size) maxblocknum--;
      after->size=after->size-application; //澶т簬鐢宠绌洪棿鍒欐埅鍙栫浉搴斿ぇ灏忓垎閰?
      assign->address=after->address+after->size;
    }
    if (maxblocknum==0)    //淇敼鏈€澶ф暟鍜屽ご鑺傜偣
    {
      before=head;
      head->size=0;
      maxblocknum=1;
      while(before!=NULL)
      {
        if(before->size > head->size)
        {
          head->size=before->size;
          maxblocknum=1;
        }
        else if(before->size==head->size)
          maxblocknum++;
        before=before->next;
      }
    }
  }
  assign1=assign;
  
  //淇敼宸插垎閰嶅垎鍖鸿〃锛屾坊鍔犺妭鐐?
  after=heada;
  while(after->next!=NULL)
    after=after->next;
  after->next=assign;
  heada->size++;

  return assign1;    //杩斿洖鍒嗛厤缁欑敤鎴峰埌鍦板潃
}

/*------------------棣栧厛閫傚簲鍒嗛厤绠楁硶------------*/
void firstfit(RECT *head,RECT *heada,RECT *back1)
{
  RECT *before,*after,*back2;
  int insert,del;
  back2=malloc(sizeof(RECT));
  back2->address=back1->address;
  back2->size=back1->size;
  back2->next=back1->next;
  before=head;
  after=head->next;
  insert=0;
  while(!insert)      //灏嗗洖鏀跺尯鎻掑叆绌洪棽鍖鸿〃
  {
    if((after==NULL)||((back1->address<=after->address)&&(back1->address>=before->address)))
    {
      before->next=back1;
      back1->next=after;
      insert=1;
    }
    else
    {
      before=before->next;
      after=after->next;
    }
  } 

  if(back1->address==before->address+before->size) //涓庝笂涓€鍧楀悎骞?
  {
    before->size=before->size+back1->size;
    before->next=back1->next;
    free(back1);
    back1=before;
  }

  if((after!=NULL) &&(after->address==back1->address+back1->size))//涓庝笅涓€鍧楀悎骞?
  {
    back1->size=back1->size+after->size;
    back1->next=after->next;
    free(after);
  }

  if(head->size<back1->size) //淇敼鏈€澶у潡鍊煎拰鏈€澶у潡涓暟
  {
    head->size=back1->size;
    maxblocknum=1;
  }
  else 
    if(head->size==back1->size) maxblocknum++;

  //淇敼宸插垎閰嶅垎鍖鸿〃锛屽垹闄ょ浉搴旇妭鐐?
  before=heada;
  after=heada->next;
  del=0;
  while(!del||after!=NULL)  //灏嗗洖鏀跺尯浠庡凡鍒嗛厤鍒嗗尯琛ㄤ腑鍒犻櫎
  {
    if((after->address==back2->address)&&(after->size==back2->size))
    {
      before->next=after->next;
      free(after);
      del=1;
    }
    else
    {
      before=before->next;
      after=after->next;
    }
  }
  heada->size--;
}

/*-----------------鏈€浣抽€傚簲鍒嗛厤绠楁硶,back1涓哄洖鏀惰妭鐐瑰埌鍦板潃--------------*/
void bestfit(RECT *head,RECT *heada,RECT *back1)
{
  RECT *before,*after,*back2;
  int insert=0,del;
  back2=malloc(sizeof(RECT));
  back2->address=back1->address;
  back2->size=back1->size;
  back2->next=back1->next;
  before=head;
  after=head->next;
  if(head->next==NULL)
  {
    head->size=back1->size;
    head->next=back1;
    maxblocknum++;
    back1->next=NULL;
  }
  else
  {
    while(after!=NULL)
     if(back1->address==after->size+after->address) /*涓庝笂涓€鍧楀悎骞?/
     {
       before->next=after->next;
       back->size=after->size+back1->size;
       free(after);
       after=NULL;
     }
     else
     {
       after=after->next;
       before=before->next;
     }
     before=head;
     after=head->next;
     while(after!=NULL)
      if(after->address==back1->size+back1->address)   /*涓庝笅涓€鍧楀悎骞?/
      {
        back1->size=back1->size+after->size;
        before->next= after->next;
        free(after);
        after=NULL;
      }
      else
      {
        before=before->next;
        after=after->next;
      }
      before=head;                 /*灏嗗洖鏀惰妭鐐规彃鍏ュ埌鍚堥€傚埌浣嶇疆*/
      after=head->next;
      do{
        if(after==NULL||(after->size>back1->size))
        {
          before->next=back1;
          back1->next=after;
          insert=1;
        }
        else
        {
          before=before->next;
          after=after->next;
        }
      }while(!insert);
      if(head->size<back1->size)    /*淇敼鏈€澶у潡鍊煎拰鏈€澶у潡鏁?/
      {
        head->size=back1->size;
        maxblocknum++;
      }
      else
      {
        if(head->size==back1->size)
          maxblocknum++;
       }
  }

  //淇敼宸插垎閰嶅垎鍖鸿〃锛屽垹闄ょ浉搴旇妭鐐?
  before=heada;
  after=heada->next;
  del=0;
  while(!del||after!=NULL)  //灏嗗洖鏀跺尯浠庡凡鍒嗛厤鍒嗗尯琛ㄤ腑鍒犻櫎
  {
    if((after->address==back2->address)&&(after->size==back2->size))
    {
      before->next=after->next;
      free(after);
      del=1;
    }
    else
    {
      before=before->next;
      after=after->next;
    }
  }
  heada->size--;
}

        
/*-----------------鎵撳嵃杈撳嚭閾捐〃--------------*/
void print(RECT *output)
{
  RECT *before;
  int index;
  before=output->next;
  index=0;
  if(output->next==NULL)
    printf("NO part for print!\n");
  else
  {
    printf("index****address****end*****size**** \n");
    while(before!=NULL)
    {
      printf("------------------------------------\n");
      printf(" %-9d%- 9d%- 9d%- 9d\n",index,before->address,before->address+before->size-1,before->size);
      printf("-------------------------------------\n");
      index++;
      before=before->next;
    }
  }
}

/*妫€鏌ュ洖鏀跺潡鍒板悎娉曟€э紝back1涓鸿鍥炴敹鍒拌妭鐐瑰湴鍧€*/
int backcheck(RECT *head,RECT *back1)
{
  RECT *before;
  int check=1;
  if(back1->address<0 || back1->size<0) check=0;  //鍦板潃鍜屽ぇ灏忎笉鑳戒负璐熸暟
  before=head->next;
  while((before!=NULL)&&check) //鍦板潃涓嶈兘鍜岀┖闂插尯琛ㄤ腑鑺傜偣鍑虹幇閲嶅彔
  if(((back1->address<before->address)&&(back1->address+back1->size>before->address))||((back1->address>=before->address)&&(back1->address<before->address+before->size)))
    check=0;
  else
    before=before->next;
  if(check==0) printf("Error input!\n");
  return check;     
}