可变式分区的分配与回收主程序.docVIP

/*可变式分区的分配与回收主程序——首次适应算法*/ #include stdio.h #define N 5 struct freearea /*定义一个空闲区说明表结构,并初始化变量*/ { int startaddress;/*空闲区地址*/ int size;/*空闲区大小*/ int state;/*空闲区状态:0为空表目,1为可用空闲块*/ }freeblock[N]={{20,20,1},{80,50,1},{150,100,1},{300,30,0},{600,100,1}}; /*定义为作业分配主存空间的函数alloc()*/ int alloc(int applyarea) /*applyarea为作业申请量*/ { int i,tag=0;/*tag为检查是否有满足作业若需要的空闲区的标志*/ for(i=0;iN;i++)/*检查空闲区说明表是否有满足作业要求的空闲区*/ if(freeblock[i].state==1freeblock[i].sizeapplyarea) { freeblock[i].startaddress=freeblock[i].startaddress+applyarea; freeblock[i].size=freeblock[i].size-applyarea; tag=1;/*有满足条件的空闲区时,tag置1*/ return freeblock[i].startaddress-applyarea; } else if(freeblock[i].state==1freeblock[i].size==applyarea) { freeblock[i].state=0; tag=1;/*有满足条件的空闲区时,tag置1*/ return freeblock[i].startaddress;/*返回为作业分配的主存地址*/ } if(tag==0) return -1;/*没有满足条件的空闲区,分配不成功,返回-1*/ } /*定义主存回收函数:setfree()*/ /*tag1代表释放区的高地址是否邻接一个空闲区,tag2代表释放区的高低地址是否都邻接一个空闲区,tag3代表释放区的低地址是否邻接一个空闲区*/ setfree() { int s,l,tag1=0,tag2=0,tag3=0,i,j; printf(input free area startaddress:\n); scanf(%d,s);/*输入释放区的开始地址*/ printf(input free area size:\n); scanf(%d,l);/*输入释放区的大小*/ for(i=0;iN;i++) { if(freeblock[i].startaddress==s+1freeblock[i].state==1) { l=1+freeblock[i].size; tag1=1;/*有与释放区的高地址邻接的空闲区,tag1置1*/ for(j=0;jN;j++) if(freeblock[j].startaddress+freeblock[j].size==sfreeblock[j].state==1) { freeblock[i].state=0; freeblock[j].size=freeblock[j].size+1; tag2=1;/*有与释放区上下都邻接的空闲区,tag2置1*/ break; } if(tag2==0)/*无与释放区高地址邻接的空闲区*/ { freeblock[i].startaddress=s; freeblock[i].size=1; break; } } } if(tag1=0)/*无与释放区高地址邻接的空闲区,检查是否低地址有邻接空闲区*/ { for(i=0;iN;i++) if(freeblock[i].startaddress+freeblock[i].size==sfreeblock[i].state==1) { freeblock[i].size=freeblock[i].size+1; tag3=1;/*有与释放区低地址邻接的空闲区,tag3置1*/ break; } if(tag3==0)/*无与释放区高低地址邻接的空闲区*/ for(j=0;jN;j++) if(freeblock[j].state==0)/