.
ch=p->data.length-request; }
else if(q->data.length < p->data.length) { q=p;
ch=p->data.length-request; } }
p=p->next; }
if(q==NULL) return ERROR;//没有找到空闲块 else if(q->data.length==request) {
q->data.length=1; return OK; } else {
temp->prior=q->prior; temp->next=q;
temp->data.address=q->data.address; temp->data.num=q->data.num; q->prior->next=temp; q->prior=temp;
q->data.address+=request; q->data.length=ch; q->data.num+=1; return OK; }
return OK; }
//分配主存
Status allocation(int a) {
int request;//申请内存大小
printf(\请输入申请分配的主存大小(单位:KB):\ scanf(\
if(request<0 ||request==0) {
printf(\分配大小不合适，请重试！\ return ERROR; }
精品
.
switch(a) {
case 1: //默认首次适应算法
if(First_fit(request)==OK) printf(\分配成功！****\ else printf(\内存不足，分配失败！****\ return OK; break;
case 2: //选择最佳适应算法
if(Best_fit(request)==OK) printf(\分配成功！****\ else printf(\内存不足，分配失败！****\ return OK; break; case 3: //选择最差适应算法
if(Worst_fit(request)==OK) printf(\分配成功！****\ else printf(\内存不足，分配失败！****\ return OK; break; } }
Status deal1(Node *p)//处理回收空间 {
Node *q=first;
for(;q!=NULL;q=q->next) {
if(q==p) { if(q->prior->data.state==0&&q->next->data.state!=0) { q->prior->data.length+=q->data.length; q->prior->next=q->next; q->next->prior=q->prior; q=q->prior; q->data.state=0;
q->data.num=flag-1; }
if(q->prior->data.state!=0&&q->next->data.state==0) {
q->data.length+=q->next->data.length; q->next=q->next->next; q->next->next->prior=q; q->data.state=0;
q->data.num=flag; }
精品
.
if(q->prior->data.state==0&&q->next->data.state==0) { q->prior->data.length+=q->data.length; q->prior->next=q->next; q->next->prior=q->prior; q=q->prior; q->data.state=0; q->data.num=flag-1; }
if(q->prior->data.state!=0&&q->next->data.state!=0) { q->data.state=0; } } }
return OK; }
Status deal2(Node *p)//处理回收空间 {
Node *q=first;
for(;q!=NULL;q=q->next) {
if(q==p) { if(q->prior->data.state==0&&q->next->data.state!=0) { q->prior->data.length+=q->data.length; q->prior->next=q->next; q->next->prior=q->prior; q=p->prior; q->data.state=0;
q->data.num=flag-1; }
if(q->prior->data.state!=0&&q->next->data.state==0) {
q->data.state=0; }
if(q->prior->data.state==0&&q->next->data.state==0) { q->prior->data.length+=q->data.length; q->prior->next=q->next; q->next->prior=q->prior; q=q->prior;
精品
.
q->data.state=0; q->data.num=flag-1; }
if(q->prior->data.state!=0&&q->next->data.state!=0) { q->data.state=0; } } }
return OK; }
//主存回收
Status recovery(int flag) {
Node *p=first;
for(;p!=NULL;p=p->next) {
if(p->data.num==flag) { if(p->prior==first) { if(p->next!=end)//当前P指向的下一个不是最后一个时 { if(p->next->data.state==0) //与后面的空闲块相连 {
p->data.length+=p->next->data.length; p->next->next->prior=p; p->next=p->next->next; p->data.state=0; p->data.num=flag; } else p->data.state=0; } if(p->next==end)//当前P指向的下一个是最后一个时 {
p->data.state=0; } }//结束if(p->prior==block_first)的情况 else if(p->prior!=first) { if(p->next!=end) { deal1(p);
精品