操作系统源代码.docx

1、操作系统源代码#include#include#includeint memoryStartAddress = -1;int memorySize = -1;struct jobListint id; /* 作业ID */int size; /* 作业大小（需要的存储空间大小） */int status; /* 作业状态 0 : new job ,1 : in the memory , 2 : finished . */struct jobList *next; /* 作业链表指针 */;struct freeList int startAddress; /* 分区起始地址 */ int si

2、ze; /* 分区大小 */ struct freeList *next; /* 分区链表指针 */;struct usedList int startAddress; /* 分区起始地址 */int jobID; /* 分区中存放作业ID */struct usedList *next; /* 分区链表指针 */;void errorMessage(void) /*出现严重错误时显示信息并结束程序*/ printf(ntError !a); printf(nPress any key to exit !); getch(); exit(1);void openFile(FILE *fp,ch

3、ar *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) = N

4、ULL) printf(nNot enough to allocate for the free node .); errorMessage(); (*empty)-startAddress = startAddress; (*empty)-size = size; (*empty)-next = NULL;void iniMemory(void) /*初始化存储空间起始地址、大小*/ char MSA10,MS10; printf(nPlease input the start address of the memory !); scanf(%s,MSA); memoryStartAddre

5、ss = 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(nnPlease 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); fi

6、tMethod = getche(); while(fitMethod 4); openFile(&fp,d:result.cl,a); switch(fitMethod) case 1: fprintf(fp,nnnntBest fit); fprintf(fp,n*); break; case 2: fprintf(fp,nnnntWorst fit); fprintf(fp,n*); break; case 3: fprintf(fp,nnnntFirst fit); fprintf(fp,n*); break; case 4: fprintf(fp,nnnntLast fit); fp

7、rintf(fp,n*); break; fclose(fp); return fitMethod;void inputJob(void) /*从键盘输入作业到D盘的JOB文件*/ int /*id,size, */status = 0,jobnum = 0; FILE *fp; char id10,size10; openFile(&fp,d:job.cl,w); fprintf(fp,job_IDtsizetstatus); printf(nnnnPlease input the jobs as fallow ! nEnter a integer smaller than 1 to qui

8、t .njob_IDtsizen); do /* scanf(%d%d,&id,&size); */ scanf(%st%s,id,size); if(atoi(id) 0 & atoi(size) 0) fprintf(fp,n%st%st%d,id,size,status); /* fprintf(fp,n%dt%dt%d,id,size,status); */ jobnum+; else break; while(1); if(jobnum) printf(nFinished to input the jobs !); else printf(nNo job was given .);

9、errorMessage(); fclose(fp);int makeJobList(struct jobList *jobs) /*从JOB文件中读出作业并创建作业链表*/ char jobID10,size10,status10; struct jobList *rear; FILE *fp; openFile(&fp,d:job.cl,r); fscanf(fp,%s%s%s,jobID,size,status); if(*jobs = malloc(sizeof(struct jobList) = NULL) printf(nNot enough to allocate for the

10、 job .); fclose(fp); errorMessage(); rear = *jobs; (*jobs)-next = NULL; while(!feof(fp) struct jobList *p; fscanf(fp,%s%s%s,jobID,size,status); if(p = malloc(sizeof(struct jobList) = NULL) printf(nNot enough to allocate for the job .); fclose(fp); errorMessage(); p - next = rear - next; rear - next

11、= p; rear = rear - next; rear - id = atoi(jobID); rear - size = atoi(size); rear - status = atoi(status); fclose(fp); return 0;int updateJobFile(struct jobList *jobs) /*更新作业链表中作业的状态*/ FILE *fp; struct jobList *p; openFile(&fp,d:job.cl,w); fprintf(fp,job_IDtsizetstatus); for(p = jobs - next;p;p = p -

12、 next) fprintf(fp,n%dt%dt%d,p-id,p-size,p-status); fclose(fp); return 0;int showFreeList(struct freeList *empty) /*空闲分区队列显示*/ FILE *fp; struct freeList *p = empty - next; int count = 0; openFile(&fp,d:result.cl,a); fprintf(fp,nnNow show the free list.); printf(nnNow show the free list.); if(p) fprin

13、tf(fp,nnumbertsizetstartAddress); printf(nnumbertsizetstartAddress); for(;p;p = p - next) fprintf(fp,n%dt%dt%d,+count,p - size,p - startAddress); printf(n%dt%dt%d,count,p - size,p - startAddress); fclose(fp); return 1; else fprintf(fp,nThe memory was used out !); printf(nThe memory was used out !);

14、fclose(fp); return 0; void getJobInfo(struct jobList *jobs,int id,int *size,int *status) /*获取作业的信息*/ struct jobList *p = jobs-next; while(p & p-id != id) p = p-next; if(p = NULL) printf(nCant find the job which id is : %d .,id); errorMessage(); else *size = p - size; *status = p - status; void updat

15、eJobStatus(struct jobList *jobs,int id,int status) struct jobList *p = (*jobs)-next; while(p & p-id != id) p = p-next; if(p = NULL) printf(nCant find the job which id is : %d .,id); errorMessage(); else p - status = status;int showUsedList(struct jobList *jobs,struct usedList *used) /*作业占用链表显示*/ FIL

16、E *fp; struct usedList *p = used - next; int count = 0,size,status; openFile(&fp,d:result.cl,a); fprintf(fp,nnNow show the used list.); printf(nnNow show the used list.); if(p) fprintf(fp,nnumbertjobIDtsizetstartAddress); printf(nnumbertjobIDtsizetstartAddress); for(;p;p = p - next) getJobInfo(jobs,

17、p - jobID,&size,&status); fprintf(fp,n%dt%dt%dt%d,+count,p-jobID,size,p- startAddress); printf(n%dt%dt%dt%d,count,p-jobID,size,p- startAddress); fclose(fp); return 1; else fprintf(fp,nNo job in the memory ! You should input some jobs to it.); printf(nNo job in the memory ! You should input some jobs

18、 to it.); fclose(fp); return 0; int showJobList(struct jobList *jobs) /*显示作业链表*/ struct jobList *p; p = jobs-next; if(p = NULL) printf(nNo job in the list ! Try again next time.); return 0; printf(nnThe job list is as fallow :njob_IDtsizetstatus); while(p) printf(n%dt%dt%d,p-id,p-size,p-status); p =

19、 p-next; return 1;void moveFragment(struct jobList *jobs,struct freeList *empty,struct usedList *used)int size,status;struct usedList *p;int address = memoryStartAddress; /*全局变量，初始化时分配存储空间始址*/ if(*empty)-next = NULL) /* 空闲分区链表为空，提示并返回 */ printf(nThe memory was used out at all.nMay be you should fini

20、sh some jobs first or press any key to try again !); getch(); return; for(p = (*used) - next;p;p = p- next) /* 循环的修改占用分区的始址 */ p - startAddress = address; getJobInfo(jobs,p - jobID,&size,&status); /* 由作业ID获得作业大小 */ address += size; (*empty)-next-startAddress = address;/*修改空闲分区的首节点始址、大小*/ (*empty) -

21、next - size = memorySize - (address - memoryStartAddress); (*empty) - next - next = NULL; /* 删除首节点后的所有节点 */void order(struct freeList *empty,int bySize,int inc)struct freeList *p,*q,*temp; int startAddress,size; for(p = (*empty) - next;p;p = p - next) /* 按bySize和inc两个参数寻找合适的节点，用temp指向它 */ for(temp =

22、 q = p;q;q = q - next) switch(bySize) case 0 : switch(inc) case 0:if(q-size size) temp = q;break; default:if(q-size temp-size) temp = q;break; break; default: switch(inc) case 0:if(q-startAddress startAddress) temp = q;break; default:if(q-startAddress temp-startAddress) temp = q;break; break; /* 交换节

23、点的成员值 */ if(temp != p) startAddress = p-startAddress; size = p-size; p-startAddress = temp-startAddress; p-size = temp-size; temp-startAddress = startAddress; temp-size = size; int allocate(struct freeList *empty,int size) /*为作业分配存储空间、状态必须为0*/ struct freeList *p,*prep; int startAddress = -1; p = (*e

24、mpty) - next; while(p & p-size next; if(p != NULL) if(p - size size) startAddress = p - startAddress; p - startAddress += size; p - size -= size; else startAddress = p - startAddress; prep = *empty; while(prep - next != p) prep = prep - next; prep - next = p - next; free(p); else printf(nMay be you

25、should move the fragment together .); /* Unsuccessful ! */ return startAddress;void insertUsedNode(struct usedList *used,int id,int startAddress) /*插入释放的空间到used链表中（作业号为id，startAddress由函数13返回）*/ struct usedList *q,*r,*prer; if(q = malloc(sizeof(struct usedList) = NULL) printf(nNot enough to allocate

26、for the used node .); errorMessage(); q - startAddress = startAddress; q - jobID = id; prer = *used; r = (*used) - next; while(r & r-startAddress next; q - next = prer - next; prer - next = q;int finishJob(struct usedList *used,int id,int *startAddress) /*结束一个作业号为id的作业，释放存储空间（由*startAddress返回空间的起始地址）*/ struct usedList *p,*prep; prep = *used; p = prep - next; while(p & p - jobID != id) prep = p; p = p - next; if(p = NULL) printf(nThe job which id is : %d is not in the memory !,id); return 0; els