【正文】 emp1。struct need *needhead,*need1,*need2,*needtemp。struct finish *finihead,*finish1,*finish2,*finishtemp。struct path *pathhead,*path1,*path2,*pathtemp。char c。printf(\nPlease enter the type of sources the system has:\n)。scanf(%d,amp。colum)。printf(Please enter the number of processes now in the memory:\n)。scanf(%d,amp。row)。printf(Please enter the allocation array:\n)。for(i=0。irow。i++){ printf(The allocation for process p%d:\n,i)。for (j=0。jcolum。j++){ printf(The type %c system resource allocated:\n,39。A39。+j)。if(status==0){ allochead=alloc1=alloc2=(struct allocation*)malloc(alloclen)。alloc1next=alloc2next=NULL。scanf(%d,amp。allocheadvalue)。status++。}else{ alloc2=(struct allocation *)malloc(alloclen)。scanf(%d,%d,amp。alloc2value)。if(status==1){ allocheadnext=alloc2。status++。}alloc1next=alloc2。alloc1=alloc2。}}}alloc2next=NULL。status=0。printf(Please enter the max array:\n)。for(i=0。irow。i++){ printf(The max needed from process p%d:\n,i)。for (j=0。jcolum。j++){ printf(The type %c maxium system resource may needed:\n,39。A39。+j)。if(status==0){ maxhead=maxium1=maxium2=(struct max*)malloc(maxlen)。maxium1next=maxium2next=NULL。scanf(%d,amp。maxium1value)。status++。}else{ maxium2=(struct max *)malloc(maxlen)。scanf(%d,%d,amp。maxium2value)。if(status==1){ maxheadnext=maxium2。status++。}maxium1next=maxium2。maxium1=maxium2。}}}maxium2next=NULL。status=0。printf(Please enter the available array now exists in the system:\n)。for (j=0。jcolum。j++){printf(The type %c available system resource number:\n,39。A39。+j)。if(status==0){ avahead=available1=available2=(struct available*)malloc(avalen)。workhead=work1=work2=(struct available*)malloc(avalen)。available1next=available2next=NULL。work1next=work2next=NULL。scanf(%d,amp。available1value)。work1value=available1value。status++。}else{ available2=(struct available*)malloc(avalen)。work2=(struct available*)malloc(avalen)。scanf(%d,%d,amp。available2value)。work2value=available2value。if(status==1){ avaheadnext=available2。workheadnext=work2。status++。}available1next=available2。available1=available2。work1next=work2。work1=work2。}}available2next=NULL。work2next=NULL。status=0。alloctemp=allochead。maxtemp=maxhead。for(i=0。irow。i++)for (j=0。jcolum。j++){ if(status==0){ needhead=need1=need2=(struct need*)malloc(needlen)。need1next=need2next=NULL。need1value=maxtempvaluealloctempvalue。status++。}else{ need2=(struct need *)malloc(needlen)。 need2value=(maxtempvalue)(alloctempvalue)。if(status==1){ needheadnext=need2。status++。}need1next=need2。need1=need2。}maxtemp=maxtempnext。alloctemp=alloctempnext。}need2next=NULL。status=0。for(i=0。irow。i++){if(status==0){ finihead=finish1=finish2=(struct finish*)malloc(finilen)。 finish1next=finish2next=NULL。finish1stat=0。status++。}else{ finish2=(struct finish*)malloc(finilen)。finish2stat=0。if(status==1){finiheadnext=finish2。status++。}finish1next=finish2。finish1=finish2。}}finish2next=NULL。 /*Initialization pleated*/status=0。processtest=0。for(temp=0。temprow。temp++){alloctemp=allochead。needtemp=needhead。finishtemp=finihead。worktemp=workhead。for(i=0。irow。i++){worktemp1=worktemp。if(finishtempstat==0){for(j=0。jcolum。j++,needtemp=needtempnext,worktemp=worktempnext)if(needtempvalue=worktempvalue)processtest++。if(processtest==colum){for(j=0。jcolum。j++){worktemp1value+=alloctempvalue。worktemp1=worktemp1next。alloctemp=alloctempnext。}if(status==0){pathhead=path1=path2=(struct path*)malloc(pathlen)。path1next=path2next=NULL。path1value=i。status++。}else{path2=(struct path*)malloc(pathlen)。path2value=i。if(status==1){pathheadnext=path2。status++。}path1next=path2。path1=path2。}finishtempstat=1。}else{for(t=0。tcolum。t++)alloctemp=alloctempnext。finishtempstat=0。}}elsefor(t=0。tcolum。t++){needtemp=needtempnext。alloctemp=alloctempnext。}processtest=0。worktemp=workhead。finishtemp=finishtempnext。}}path2next=NULL。finishtemp=finihead。for(temp=0。temprow。temp++){if(finishtempvalue==0){printf(\nWARNING,the system is in nonsafe status!\n)。exit(0)。}finishtemp=finishtempnext。}printf(\nThe system is in safe status!\n)。printf(\nThe safe sequence is: \n)。do{printf(p%d ,pathheadvalue)。}while(pathhead=pathheadnext)。}附錄五、可變分區(qū)存儲管理模擬includeincludeincludeint memoryStartAddress = 1。int memorySize = 1。struct jobList{ int 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。 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(\nCan39。t open %s in mode %s.,filename,mode)。 errorMessage()。 }}void makeFreeNode(struct freeList **empty,int startAddress,int size){ 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 i