没有合适的资源?快使用搜索试试~ 我知道了~
操作系统实验 首次适应算法 运行无误
资源推荐
资源详情
资源评论
#include "stdio.h"
#define N 5
struct freearea
{
int startaddress;
int size;
int state;
}freeblock[N]={{20,20,1},{80,50,1},{150,100,1},{300,30,0},{600,60,1}};
int alloc(int applyarea)
{
int i,tag=0;
for(i=0;i<N;i++)
if(freeblock[i].state==1&&freeblock[i].size>applyarea)
{
freeblock[i].startaddress=freeblock[i].startaddress+applyarea;
freeblock[i].size=freeblock[i].size-applyarea;
tag=1;
return freeblock[i].startaddress-applyarea;
}
else
if(freeblock[i].state==1&&freeblock[i].size==applyarea)
{
freeblock[i].state=0;
tag=1;
return freeblock[i].startaddress;
}
if(tag==0)
return -1;
}
#define N 5
struct freearea
{
int startaddress;
int size;
int state;
}freeblock[N]={{20,20,1},{80,50,1},{150,100,1},{300,30,0},{600,60,1}};
int alloc(int applyarea)
{
int i,tag=0;
for(i=0;i<N;i++)
if(freeblock[i].state==1&&freeblock[i].size>applyarea)
{
freeblock[i].startaddress=freeblock[i].startaddress+applyarea;
freeblock[i].size=freeblock[i].size-applyarea;
tag=1;
return freeblock[i].startaddress-applyarea;
}
else
if(freeblock[i].state==1&&freeblock[i].size==applyarea)
{
freeblock[i].state=0;
tag=1;
return freeblock[i].startaddress;
}
if(tag==0)
return -1;
}
void setfree()
{
int s,l,tag1=0,tag2=0,tag3=0,i,j;
printf("input free area startaddress: \n");
scanf("%d",&s);
for(i=0;i<N;i++)
{
if(freeblock[i].startaddress==s+1&&freeblock[i].state==1)
{
l=l+freeblock[i].size;
tag1=1;
for(j=0;j<N;j++)
if(freeblock[j].startaddress+freeblock[j].size==s&&freeblock[j].state==1)
{
freeblock[i].state=0;
freeblock[j].size=freeblock[j].size+l;
tag2=1;
break;
}
if(tag2==0)
{
freeblock[i].startaddress=s;
freeblock[i].size=l;
break;
}
}
}
if(tag1==0)
{
剩余5页未读,继续阅读
资源评论
yaoxinyu123
- 粉丝: 0
- 资源: 2
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功