首次适应法-FF和最佳适应法-BF实现内存分配.docxVIP

首次适应法和最佳适应法实现内存分配#includestdio.h#includestring.h#includestdlib.h#define memory_size 2000;typedef struct Lnode {int state;int fist_adr;//首地址int size; //作业或空闲区大小char name[10];//作业名称struct Lnode *next;} *LinkList;char re_name[10];void Insert_Free(LinkList p,LinkList Free)//将作业分配给空闲内存{LinkList L1;L1=(LinkList)malloc (sizeof (Lnode));//生成新节点L1=Free ;if(! L1-next)printf(内存已满，无法分配\n);while(L1-next ){if(p-size =L1-next-size ) //顺序查找合适的内存空间{if(p-size L1-next-size ) //作业小于空闲区{L1-next-size=L1-next-size - p-size ;//重置空闲大小p-fist_adr =L1-next-fist_adr; //确地作业的首地址L1-next-fist_adr =L1-next-fist_adr + p-size ;//重置空闲首地址}else //作业等于空闲区,将此空闲区删去{ p-fist_adr =L1-next-fist_adr; //确地作业的首地址L1-next =L1-next-next;}break;}elseL1 =L1-next;}}void InsertBusy(LinkList p,LinkList Busy)//插入忙队列{LinkList L;L=Busy-next ;if(L==NULL) //忙队列为空时,即第一次插入作业时{Busy-next=p;p-next=NULL;}else if(p-fist_adr==0){p-next =Busy-next;Busy-next=p;}else {while(L){if(p-fist_adr ==L-fist_adr +L-size ){p-next=L-next;//插入作业L-next=p;}L=L-next;}}}void MLook(LinkList Free,LinkList Busy)//查看内存分配{LinkList F;LinkList B;B=Busy-next ;F=Free-next ;while(B F){if(B-fist_adr F-fist_adr ){printf(首地址：%d 大小%d 状态：已分配作业名：%s\n,B-fist_adr ,B-size,B-name );B=B-next;}else{printf(首地址：%d 大小%d 状态：空闲\n,F-fist_adr ,F-size );F=F-next;}}while(B){printf(首地址：%d 大小%d 状态：已分配作业名：%s\n,B-fist_adr ,B-size,B-name );B=B-next;}while(F){printf(始地址：%d 大小 %d 状态：空闲\n,F-fist_adr ,F-size );F=F-next;}}void recycle(char re_name[],LinkList Busy,LinkList Free)//作业回收{LinkList B;B=Busy;LinkList rey;LinkList F=Free;int k=0;while(B-next){if(!strcmp(re_name,B-next-name))//作业名相等，删去{rey=B-next;//获取删掉作业B-next=B-next-next;break;}else B=B-next;}while(F-next){if(rey-fist_adr F-next-fist_adr ) //插入空闲区{k=1;if(F-next-fist_adr ==rey-fist_adr +rey-size rey-fist_adr !=F-fist_adr +F-size )//合并下空闲区{F-next-fist_adr =F-next-fist_adr -rey-size ;F-next-size =F-next-size +rey-size;}else if(F-fist_adr+F-size == rey-fist_adr F-next-fist_adr !=rey-fist_adr +rey-size )//合并上空闲区{F-