操作系统-存储管理动态分区分配及回收算法.docx

存储管理动态分区分配及回收算法
课程名称：计算机操作系统
实验者姓名：李琛
评分：
、实验目的
班级：信1501-2
实验日期：2018年5月20日
教师签名：
分区管理是应用较广泛的一种存储req;
ass->adr=after->adr;
after->adr+=req;
}
}
returnass;
}
rd)
voidacceptment1(intaddress,intsiz,int
{
Node*before,*after;
intinsert=0;
{
back1=(Node*)malloc(sizeof(Node));
before=head1;
after=head1->next;
back1->adr=address;
back1->size=siz;
back1->id=rd;
back1->next=NULL;
while(!insert&&after)
{//将要被回收的分区插入空闲区(按首址大小从小到大插入)
if((after==NULL)||((back1->adr<=after->adr)&&(back1->adr>=before->adr))){
before->next=back1;
back1->next=after;
insert=1;
}
else
{
before=before->next;
after=after->next;
}
}
if(insert)
{
if(back1->adr==before->adr+before->size)
{//和前边分区合并
before->size+=back1->size;
before->next=back1->next;
free(back1);
}
elseif(after&&back1->adr+back1->size==after->adr)
{//和后边分区合并
back1->size+=after->size;
back1->next=after->next;
back1->id=after->id;
free(after);
after=back1;
}
printf("\t首先分配算法回收内存成功！\n");
}
else
printf("\t首先分配算法回收内存失败！\n");
}
Node*assignment2(intnum,intreq)
Node*before,*after,*ass,*q;
{
ass=(Node*)malloc(sizeof(Node));
q=(Node*)malloc(sizeof(Node));
before=head2;
after=head2->next;
ass->id=num;
ass->size=req;
while(after->size<req)
{
before=before->next;
after=after->next;
}
if(after==NULL)
{
ass->adr=-1;
}
else
{
if(after->size==req)
{
before->next=after->next;
ass->adr=after->adr;
}
else
{
q=after;
before->next=after->next;
ass->adr=q->adr;
q->size-=req;
q->adr+=req;
before=head2;
after=head2->next;
if(after==NULL)
{
before->next=q;
q->next=NULL;
}
else
{
while((after->size)<(q->size))
{
before=before->next;
after=after->next;
{
{
before->next=q;
q->next=after;
}
}
}
return(ass);
}
voidacceptment2(intaddress,intsiz,intrd)
{
Node*before,*after;
intinsert=0;
back2=(Node*)malloc(sizeof(Node));
before=head2;
after=head2->next;
back2->adr=address;
back2->size=siz;
back2->id=rd;
back2->next=NULL;