[银行家算法原代码.docVIP

实验代码 #include malloc.h #include stdio.h #include stdlib.h #define alloclen sizeof(struct allocation) #define maxlen sizeof(struct max) #define avalen sizeof(struct available) #define needlen sizeof(struct need) #define finilen sizeof(struct finish) #define pathlen sizeof(struct path) struct allocation { int value; struct allocation *next; }; struct max { int value; struct max *next; }; struct available /*可用资源数*/ { int value; struct available *next; }; struct need /*需求资源数*/ { int value; struct need *next; }; struct path { int value; struct path *next; }; struct finish { int stat; struct finish *next; }; int main() { int row,colum,status=0,i,j,t,temp,processtest; struct allocation *allochead,*alloc1,*alloc2,*alloctemp; struct max *maxhead,*maxium1,*maxium2,*maxtemp; struct available *avahead,*available1,*available2,*workhead,*work1,*work2,*worktemp,*worktemp1; struct need *needhead,*need1,*need2,*needtemp; struct finish *finihead,*finish1,*finish2,*finishtemp; struct path *pathhead,*path1,*path2; printf(\n请输入系统资源的种类数:); scanf(%d,colum); printf(请输入现时内存中的进程数:); scanf(%d,row); printf(请输入已分配资源矩阵:\n); for(i=0;irow;i++) { for (j=0;jcolum;j++) { printf(请输入已分配给进程 p%d 的 %c 种系统资源:,i,A+j); if(status==0) { allochead=alloc1=alloc2=(struct allocation*)malloc(alloclen); alloc1-next=alloc2-next=NULL; scanf(%d,allochead-value); status++; } else { alloc2=(struct allocation *)malloc(alloclen); scanf(%d,%d,alloc2-value); if(status==1) { allochead-next=alloc2; status++; } alloc1-next=alloc2; alloc1=alloc2; } } } alloc2-next=NULL; status=0; printf(请输入最大需求矩阵:\n); for(i=0;irow;i++) { for (j=0;jcolum;j++) { printf(请输入进程 p%d 种类 %c 系统资源最大需求:,i,A+j); if(status==0) { maxhead=maxium1=maxium2=(struct max*)malloc(maxlen); maxium1-next=maxium2-next=NULL; scanf(%d,maxium1-value); status++; } else { maxium2=(struc