操作系统源代码.docVIP

#includestdio.h #includetime.h #includestdlib.h int memoryStartAddress = -1; int memorySize = -1; struct jobList { int id; /* 作业ID */ int size; /* 作业大小（需要的存储空间大小） */ int status; /* 作业状态 0 : new job ,1 : in the memory , 2 : finished . */ struct jobList *next; /* 作业链表指针 */ }; struct freeList { int startAddress; /* 分区起始地址 */ int size; /* 分区大小 */ struct freeList *next; /* 分区链表指针 */ }; struct usedList { int startAddress; /* 分区起始地址 */ int jobID; /* 分区中存放作业ID */ struct usedList *next; /* 分区链表指针 */ }; void errorMessage(void) /*出现严重错误时显示信息并结束程序*/ { printf(\n\tError !\a); printf(\nPress any key to exit !); getch(); exit(1); } void openFile(FILE **fp,char *filename,char *mode) /*以要求的方式打开文件*/ { if((*fp = fopen(filename,mode)) == NULL) { printf(\nCant open %s in mode %s.,filename,mode); errorMessage(); } } void makeFreeNode(struct freeList **empty,int startAddress,int size) /*根据参数startAddress、size创建空闲节点，由empty指针返回*/ { if((*empty = malloc(sizeof(struct freeList))) == NULL) { printf(\nNot enough to allocate for the free node .); errorMessage(); } (*empty)-startAddress = startAddress; (*empty)-size = size; (*empty)-next = NULL; } void iniMemory(void) /*初始化存储空间起始地址、大小*/ { char MSA[10],MS[10]; printf(\nPlease input the start address of the memory !); scanf(%s,MSA); memoryStartAddress = atoi(MSA); printf(\nPlease input the size of the memory !); scanf(%s,MS); memorySize = atoi(MS); } char selectFitMethod(void) /*选择适应算法*/ { FILE *fp; char fitMethod; do{ printf(\n\nPlease input a char as fallow to select the fit method !\ \n 1 (Best fit) \ \n 2 (Worst fit) \ \n 3 (First fit) \ \n 4 (Last fit)\n); fitMethod = getche(); }while(fitMethod 1 || fitMethod 4); openFile(fp,d:\\result.cl,a); switch(fitMethod) { case 1: fprintf(fp,\n\n\n\n\tBest fit); fprintf(