操作系统 内存管理代码.docVIP

程序代码： #includeiostream #includefstream #define MAXMSIZE 99 using namespace std; struct Node{ int startAddress; char name; int size; int endAddress; struct Node *prior; struct Node *next; }; struct Blocklist { Node* head; }; Blocklist* freelist=new Blocklist; Blocklist* busylist=new Blocklist; void initial(); void allocateBlock(); void print(); void reclaimBlock(); void main() { int slct; initial(); print(); coutselect allocetion (1) or reclaim (2):endl; slct=1; while(slct) { cinslct; switch( slct ) { case 1: allocateBlock(); print(); break; case 2: reclaimBlock(); print(); break; default: break; } } } void allocateBlock() //分配分区 { char nm; int strtadd,sz; Node *ftemp,*delt,*btemp; ftemp=freelist-head ; btemp=busylist-head ; coutplseae input a new block information: endl; cout --name--startAdd--size-- endl; cinnmstrtaddsz; bool bfinish=false; bool ffinish=false; Node* p=new Node; p-name =nm; p-startAddress =strtadd; p-size =sz; p-endAddress =p-startAddress +p-size-1 ; if( busylist-head ==NULL bfinish ==false){ //分配使用链表的头结点 btemp =p; btemp-prior =NULL; btemp-next =NULL; bfinish =true; busylist-head =btemp; } else{ while( btemp !=NULL bfinish==false) //查找使用链表的可分配点 { if( btemp-endAddress p-startAddress btemp-next ==NULL){ //加入使用链表链尾 p-next =NULL; p-prior =btemp; btemp-next =p; bfinish =true; } else if(btemp-endAddress p-startAddress btemp-next-startAddress p-endAddress ){ //加入使用链表链中 p-next = btemp-next ; p-prior =btemp; btemp-next-prior =p; btemp-next =p; bfinish =true; } else if( btemp-prior ==NULL btemp-startAddress p-endAddress p-startAddress =0){ //加入使用链表链头 p-next =btemp; p-prior =NULL; btemp-prior =p; busylist-head =p; bfinish =true; } btemp=btemp-next ; } } while( ftemp!=NULL ffinish==false bfinish ==true ) //增加结点修改空闲