实验四 动态分区分配方式的模拟 答案(6)

实验四 动态分区分配方式的模拟 答案

Status free(int ID)

{

DuLNode *p=block_first;

while(p)

{

}

return OK;

}

//--------------- 显示主存分配情况 ------------------ void show()

{

cout<<"+++++++++++++++++++++++++++++++++++++++\n";

cout<<"+++ 主 存 分 配 情 况 +++\n";

cout<<"+++++++++++++++++++++++++++++++++++++++\n";

DuLNode *p=block_first->next;

while(p)

{

cout<<"分 区 号："; if(p->data.ID==Free) cout<<"Free"<<endl; else cout<<p->data.ID<<endl; cout<<"起始地址："<<p->data.address<<endl; cout<<"分区大小："<<p->data.size<<" KB"<<endl; cout<<"状 态："; if(p->data.state==Free) cout<<"空 闲"<<endl; if(p->data.ID==ID) { } p=p->next; p->data.state=Free; p->data.ID=Free; if(p->prior->data.state==Free)//与前面的空闲块相连 { } if(p->next->data.state==Free)//与后面的空闲块相连 { } break; p->data.size+=p->next->data.size; p->next->next->prior=p; p->next=p->next->next; p->prior->data.size+=p->data.size; p->prior->next=p->next; p->next->prior=p->prior;