C語(yǔ)言課程設(shè)計(jì)_存儲(chǔ)管理分區(qū)分配算法.doc

C語(yǔ)言課程設(shè)計(jì)_存儲(chǔ)管理分區(qū)分配算法/*pcb.c*/#include stdio.h#include stdlib.h#include string.h#define MAX 32767typedef struct node /*設(shè)置分區(qū)描述器*/ int address,size; struct node *next;RECT;/*函數(shù)原型*/RECT *assignment(RECT *head,int application);void acceptment1(RECT *head,RECT *back1);void acceptment2(RECT *head,RECT *back1) ;int backcheck(RECT *head,RECT *back1);void print(RECT *head);/*變量聲明*/RECT *head,*back,*assign1,*p;int application1,maxblocknum;char way;/*主函數(shù)*/main() char choose10; int check; head=malloc(sizeof(RECT); /*建立可利用區(qū)表的初始狀態(tài)*/ 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);/*輸出可利用表初始狀態(tài)*/ printf(Enter the way(best or first(b/f)n);/*選擇適應(yīng)策略*/ scanf(%c,&way); do printf(Enter the assign or accept(as/ac)n); scanf(%s,choose); /*選擇分配或回收*/ if(strcmp(choose,as)=0) /*as為分配*/ printf(Input application:n); scanf(%d,&application1);/*輸入申請(qǐng)空間大小*/ assign1=assignment(head,application1);/*調(diào)用分配函數(shù)*/ if(assign1-address=-1)/*分配不成功*/ printf(Too large application!,assign fails!nn); else printf(Success!ADDRESS=%5dn,assign1-address); /*分配成功*/ print(head); /*輸出*/ else if(strcmp(choose,ac)=0) /*回收*/ back=malloc(sizeof(RECT); printf(Input Adress and Size!n); scanf(%d%d,&back-address,&back-size);/*輸入回收地址和大小*/ check=backcheck(head,back); /*檢查*/ if(check=1) if(tolower(way)=f)/*首先適應(yīng)算法*/ acceptment1(head,back); /*首先適應(yīng)*/ else acceptment2(head,back);/*最佳適應(yīng)*/ print(head); while(!strcmp(choose,as)|!strcmp(choose,ac);/*分配函數(shù)*/RECT *assignment(RECT *head,int application) RECT *after,*before,*assign; assign=malloc(sizeof(RECT); /*分配申請(qǐng)空間*/ assign-size=application; assign-next=NULL; if(applicationhead-size|applicationaddress=-1; /*申請(qǐng)無(wú)效*/ else before=head; after=head-next; while(after-sizenext; after=after-next; if(after-size=application) /*結(jié)點(diǎn)大小等于申請(qǐng)大小則完全分配*/ 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; /*大于申請(qǐng)空間則截取相應(yīng)大小分配*/ assign-address=after-address+after-size; if(tolower(way)=b)/*如果是最佳適應(yīng)，將截取后剩余結(jié)點(diǎn)重新回收到合適位置*/ before-next=after-next; back=after; acceptment2(head,back); if(maxblocknum=0) /*修改最大數(shù)和頭結(jié)點(diǎn)值*/ before=head; head-size=0; maxblocknum=1; while(before!=NULL) if(before-sizehead-size) head-size=before-size; maxblocknum=1; else if(before-size=head-size) maxblocknum+; before=before-next; assign1=assign; return assign1; /*返回分配給用戶的地址*/void acceptment1(RECT *head,RECT *back1)/*首先適應(yīng)*/ RECT *before,*after; int insert; 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; 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-sizesize) /*修改最大塊值和最大塊個(gè)數(shù)*/ head-size=back1-size; maxblocknum=1; else if(head-size=back1-size) maxblocknum+;/*最佳適應(yīng)，back1為回收結(jié)點(diǎn)的地址*/void acceptment2(RECT *head,RECT *back1) RECT *before,*after; int insert ; insert=0; before=head; after=head-next; if(head-next=NULL) /*如果可利用區(qū)表為空*/ 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;/*將回收結(jié)點(diǎn)插入到合適的位置*/ after=head-next; do if(after=NULL|(after-sizeback1-size) before-next=back1; back1-next=after; insert=1; else before=before-next; after=after-next; while(!insert); if(head-sizesize) /*修改最大塊值和最大塊數(shù)*/ head-size=back1-size; maxblocknum+; else if(head-size=back1-size) maxblocknum+; void print(RECT *head) /*輸出鏈表*/ RECT *before,*after; int index,k; before=head-next; index=1; if(head-next=NULL) printf(NO part for assignment!n); else printf(*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為要回收的結(jié)點(diǎn)地址*/int backcheck(RECT *head,RECT *back1) RECT *before,*after; int check=1; if(back1-addresssizenext; while(before!=NULL)&check)/*地址不