c实现银行家算法(3)

操作系统课程里 用C语言实现银行家算法。

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;i<row;i++)

{

for (j=0;j<colum;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++;

}

百度搜索“70edu”或“70教育网”即可找到本站免费阅读全部范文。收藏本站方便下次阅读，70教育网，提供经典教育范文c实现银行家算法(3)在线全文阅读。