C語言課程設計-存儲管理分區(qū)分配算法-課程設計

1、C語言課程設計-存儲管理分區(qū)分配算法-課程設計C語言課程設計-存儲管理分區(qū)分配算法|c語言程序代碼編程小程序設計|c語言課程設計報告課程案例/*pcb.c*/#includestdio.h#includestdlib.h#includestring.h#defineMAX32767typedefstructnode/*設置分區(qū)描述器*/intaddress,size;structnode*next;RECT;/*函數(shù)原型*/RECT*assignment(RECT*head,intapplication);voidacceptment1(RECT*head,RECT*back1);voidac

2、ceptment2(RECT*head,RECT*back1);intbackcheck(RECT*head,RECT*back1);voidprint(RECT*head);/*變量聲明*/RECT*head,*back,*assign1,*p;intapplication1,maxblocknum;charway;/*主函數(shù)*/main()charchoose10;intcheck;head=malloc(sizeof(RECT);/*建立可利用區(qū)表的初始狀態(tài)*/p=malloc(sizeof(RECT);head-size=MAX;head-address=0;head-next=p;m

3、axblocknum=1;p-size=MAX;p-address=0;p-next=NULL;print(head);/*輸出可利用表初始狀態(tài)*/printf(Entertheway(bestorfirst(b/f)n);/*選擇適應策略*/scanf(%c,&way);doprintf(Entertheassignoraccept(as/ac)n);scanf(%s,choose);/*選擇分配或回收*/if(strcmp(choose,as)=0)/*as為分酉己*/printf(Inputapplication:n);scanf(%d,&application1);/*輸入申請空間大小

4、*/assign1=assignment(head,application1);/*l用分酉己函數(shù)*/if(assign1-address=-1)/吩酉己不成功*/printf(Toolargeapplication!,assignfails!nn);elseprintf(Success!ADDRESS=%5dn,assign1-address);/*分配成功*/print(head);/*輸出*/elseif(strcmp(choose,ac)=0)/*回收*/back=malloc(sizeof(RECT);printf(InputAdressandSize!n);scanf(%d%d,&

5、back-address,&back-size);/*輸入回收地址和大小*/check=backcheck(head,back);/檢查*/if(check=1)if(tolower(way)=f)/*首先適應算法*/acceptment1(head,back);/首先適*應*/elseacceptment2(head,back);服佳適應*/print(head);while(!strcmp(choose,as)|!strcmp(choose,ac);/*分配函數(shù)*/RECT*assignment(RECT*head,intapplication)RECT*after,*before,*as

6、sign;assign=malloc(sizeof(RECT);/*分配申請空間*/assign-size=application;assign-next=NULL;if(applicationhead-size|applicationaddress=-1;/申*請無效*/elsebefore=head;after=head-next;while(after-sizenext;after=after-next;if(after-size=application)/*結點大小等于申請大小則完全分配*/if(after-size=head-size)maxblocknum-;before-next

7、=after-next;assign-address=after-address;free(after);elseif(after-size=head-size)maxblocknum-;after-size=after-size-application;/*大于申請空間則截取相應大小分配*/assign-address=after-address+after-size;if(tolower(way)=b)/*如果是最佳適應，將截取后剩余結點重新回收到合適位置*/before-next=after-next;back=after;acceptment2(head,back);if(maxblo

8、cknum=0)/*修改最大數(shù)和頭結點值*/before=head;head-size=0;maxblocknum=1;while(before!=NULL)if(before-sizehead-size)head-size=before-size;maxblocknum=1;elseif(before-size=head-size)maxblocknum+;before=before-next;assign1=assign;returnassign1;/*返回分配給用戶的地址*/voidacceptment1(RECT*head,RECT*back1)/*首先適應*/RECT*before,

9、*after;intinsert;before=head;after=head-next;insert=0;while(!insert)/*將回收區(qū)插入空閑區(qū)表*/if(after=NULL)|(back1-addressaddress)&(back1-address=before-address)before-next=back1;back1-next=after;insert=1;elsebefore=before-next;after=after-next;if(back1-address=before-address+before-size)由上一塊合并*/before-size=be

10、fore-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-sizesize)/*修改最大塊值和最大塊個數(shù)*/head-size=back1-size;maxblocknum=1;elseif(head-size=back1-size)max

11、blocknum+;/*最佳適應，back1為回收結點的地址*/voidacceptment2(RECT*head,RECT*back1)RECT*before,*after;intinsert;insert=0;before=head;after=head-next;if(head-next=NULL)/*如果可利用區(qū)表為空*/head-size=back1-size;head-next=back1;maxblocknum+;back1-next=NULL;elsewhile(after!=NULL)/*與上一塊合并*/if(back1-address=after-size+after-ad

12、dress)before-next=after-next;back-size=after-size+back1-size;free(after);after=NULL;elseafter=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

13、;elsebefore=before-next;after=after-next;before=head;/*|等回收結點插入到合適的位置*/after=head-next;doif(after=NULL|(after-sizeback1-size)before-next=back1;back1-next=after;insert=1;elsebefore=before-next;after=after-next;while(!insert);if(head-sizesize)/*修改最大塊值和最大塊數(shù)*/head-size=back1-size;maxblocknum+;elseif(hea

14、d-size=back1-size)maxblocknum+;voidprint(RECT*head)/*輸出鏈表*/RECT*before,*after;intindex,k;before=head-next;index=1;if(head-next=NULL)printf(NOpartforassignment!n);elseprintf(I*index*address*end*size*n);while(before!=NULL)printf(n);printf(%-13d%-13d%-13d%-13dn,index,before-address,before-address+before-size-1,before-size);printf(n);index+;before=before-next;/*檢查回收塊的合法性，back1為要回收的結點地址*/intbackcheck(RECT*head,RECT*back1)RECT*before,*after;intcheck=1;if(back1-addresssizenext;while(before!=NULL)&check)/*地址不