时间片算法 编译原理.doc

/夏国峰 E01014130 时间片算法#include #include #define getpch(type) (type*)malloc(sizeof(type)struct pcbchar name10; char state; int ntime; int rtime; struct pcb* link; *ready=NULL, *p;/结构体typedef struct pcb PCB;int start; void sort() PCB *end, *recent;int inlist=0; if(ready=NULL)ready=p; else recent=ready;end=recent-link; while(end!=NULL) recent=recent-link; end=end-link;if(end=NULL) recent-link=p; void input() /进程输入函数int i,num;printf(nPlease input the number of processes:);scanf(%d,&num); /定义进程个数 numfor(i=0;iname);printf(nInput the running time of the process:);scanf(%d,&p-ntime);printf(n); p-rtime=0; p-state=w; /进程就绪状态 p-link=NULL; sort(); int space() /统计链表中的进程数int l=0;PCB *pr=ready;while(pr!=NULL)l+; /用于记录链表中的进程数pr=pr-link;return(l);void disp(PCB *pr) /打印显示当前正在执行的进程的相关信息printf(nqnametstatetndtimetruntimen);printf(|%st,pr-name);printf(|%ct,pr-state);printf(|%dt,pr-ntime);printf(|%dt,pr-rtime);printf(n);void check()PCB *pr;printf(n *The current running process is: %sn,p-name);disp(p);pr=ready; /记住表头进程printf(n *The state of the Waiting List:n);while(pr!=NULL) /打印出剩余的所有进程的相关信息disp(pr);pr=pr-link;if(pr=NULL)printf(nNo waiting process!n);void destroy() /打印进程执行信息提示printf(nProcess %s has finished.n,p-name);free(p); /释放临时变量p的内存空间 void running()(p-rtime)+; if(p-rtime=p-ntime)destroy();elsep-state=w;sort(); /重新插入链表void Menu() char menu;printf( * 菜单选择 *n);printf( * 1: ENTER SIMULATE *n);printf( * 2: QUIT PROCESS *n); printf(Please input your choice!n); scanf(%c,&menu);switch(menu) /菜单选项case 1:start=1;system(cls);printf(n* MODE OF SIMILATE! *n*时间片进程调度*n);break; case 2:exit(0); break;default:exit(0);break;void main()int len, h=0;char ch;Menu();if(start=1)input();len=space();while(len!=0)&(ready!=NULL) ch=getchar();h+;printf(n The execute number: %d n,h);p=ready;ready=p-link;p-link=NULL;p-state=R;check();running();printf(nProcess A