1、分配模块ffallocation,回收模块ffcollection,搬家模块coalesce及命令处理模块menu,menu用以模拟系统的输入,通过键盘命令选择进行分配模块、回收模块、内存查询以及退出的操作。程序运行的流程如下图:6实验程序#include dos.hstdlib.hconio.hio.h#include string.h#define TOTALSPACE 5000 /*起始空闲空间大小#define INITADDRESS 2000 /*起始地址#define MINSPACE 100#define MAXJOBCNT 10 /* 内存中作业数量最大值struct JobM
2、at char name10; int address; int length; struct JobMat * next; struct JobMat * back;struct FreeArea int size; struct FreeArea * next; struct FreeArea * back;struct JobMat *p_JobMat;struct FreeArea *p_FreeArea;int UnusedSpace; /*未分配的空闲空间大小int CurrentJobCnt; /*目前内存中的作业数量int JobSize; /*目前要分配的作业的大小char
3、JobName10;int JobAddress; void initiation() p_FreeArea=(struct FreeArea *)malloc(sizeof(struct FreeArea); p_FreeArea-size=TOTALSPACE;address=INITADDRESS;next=NULL;back=NULL; UnusedSpace=TOTALSPACE; p_JobMat=NULL; CurrentJobCnt=0; JobSize=0; memset(JobName, 0, 10); JobAddress=0;void ffallocation() st
4、ruct FreeArea * fp; struct JobMat *jp; struct JobMat *jp1; struct JobMat *jp2; JobAddress=-1; if (UnusedSpacesize) next; else CurrentJobCnt=CurrentJobCnt+1; UnusedSpace=UnusedSpace-JobSize; jp2=(struct JobMat *)malloc(sizeof(struct JobMat); strcpy(jp2-name,JobName); jp2-length=JobSize;address=fp-add
5、ress; JobAddress=jp2- if (p_JobMat=NULL) jp2- p_JobMat=jp2; else jp=p_JobMat; while(jp!=NULL)&(jp2-addressaddress) jp1=jp; jp=jp- next=jp; if (jp=NULL) jp2-back=jp1; jp1-next=jp2;back=jp-back; if (jp-back!=NULL) jp1- else p_JobMat=jp2; jp-back=jp2; if (fp-size-JobSizenext!=NULL) fp-next-back=fp-back
6、-next=fp- else p_FreeArea=fp- fp-size=fp-size-JobSize;address+JobSize; /*exit(1);void ffcollection() struct FreeArea *fp; struct FreeArea *fp1; struct FreeArea *fp2; int f; jp=p_JobMat; f=0; while(jp!=NULL) & strcmp(jp-name, JobName) != 0) jp=jp- if (jp! CurrentJobCnt=CurrentJobCnt-1; UnusedSpace=Un
7、usedSpace+jp-length; if (p_FreeArea=NULL) p_FreeArea=(struct FreeArea *)malloc(sizeof(struct FreeArea); p_FreeArea-address=jp-size=jp- fp=p_FreeArea; while(fp!(fp- fp1=fp; fp=fp- if (fp! if (fp-address=jp-address+jp-length) f=f+1;(jp-address=fp1-address+fp1-size) f=f+2; else if (jp-address) = (fp1-a
8、ddress+(fp1-size) f=f+2; switch (f) case 0: fp2=(struct FreeArea *)malloc(sizeof(struct FreeArea); fp2-next=fp; if (fp! fp2- if (fp-=NULL) fp1-next=fp2; else p_FreeArea=fp2; fp-back=fp2; elseback=fp1; fp1- break; case 1: fp-size+jp- case 2: fp1-size=fp1- case 3:length+fp-size; if (fp- free (fp); if
9、(jp=p_JobMat) p_JobMat=jp- if (jp-=NULL) jp-=NULL) jp-next=jp- free(jp);void showyou() /*clrscr(); if (CurrentJobCntname, jp-length,jp-address); jp=jp- printf(The total left is %d bytesn,UnusedSpace);void coalesce() int bottom; if (CurrentJobCnt0) bottom=TOTALSPACE+INITADDRESS; jp-address=bottom-jp-
10、 bottom=bottom-jp- fp=p_FreeArea; while(fp! fp1=fp; free(fp1); p_FreeArea=(struct FreeArea *)malloc(sizeof(struct FreeArea); p_FreeArea-size=UnusedSpace;void menu() int select;nnn*MENU*nYou can select one of the following:n(1)Require to be allocate.n(2)Require to collecte the size.n(3)Check the memo
11、ry.n(4)Quit.n*n scanf(%d,&select); switch(select) case 1: if( CurrentJobCnt=MAXJOBCNT) printf(The job is too manyEnter your job name: scanf(%s,JobName);Enter your job length:JobSize); ffallocation(); switch (JobAddress) case -1: printf(the memory is full coalesce(); ffallocation(); default: break; case 2:Enter the name of job: ffcollection(); case 3: case 4: exit(1); default:You input a wrong number!void main() initiation(); while (1) menu(); showyou();7、实验结果截图并分析结果分析:1、超出分配单元总容量做出提示;2、对于碎片,在单个碎片不足分配而所有空闲碎片总和可以分配时作出合并再分配。8、实验心得 在本次实验中,熟悉了存储器管理的方法,加深了我对所学存储器管理方案的了解。
copyright@ 2008-2022 冰豆网网站版权所有
经营许可证编号:鄂ICP备2022015515号-1