操作系统作业和练习的代码

#include<stdio.h> #include<stdlib.h> typedef struct CPB{ int id; int priority; int chip; int cputime; int alltime; char status; struct CPB *next; }CPB; CPB *p[5]; CPB *head,*P,*te,*tc; int n,m=1; void print(int t){ te=head->next; if(t==1)puts("当前状态："); else puts("运行状态："); for(int i=0;i<n;i++){ printf("\nid=%d priority=%d alltime=%d cputime=%d status=%c\n",te->id,te->priority,te->alltime,te->cputime,te->status); te=te->next; } } void prio(){ int count=0; while(count<n){ print(1); P=head->next; while(P->status!='R')P=P->next; P->priority--; P->alltime--; P->cputime++; P->status='E'; print(2); P->status='R'; if(P->alltime==0){P->status='F';count++;} int tem=P->id; tc=head; te=head->next; for(int i=0;i<n;i++){ if(te->id==tem){ tc->next=te->next;break;} tc=te; te=te->next; } tc=head; te=head->next; tem=P->priority; int y=0; for(int i=0;i<n-1;i++){ if(te->priority<=tem){ tc->next=P; P->next=te; y=1; break; } tc=te; te=te->next; } if(y==0){tc->next=P;P->next=NULL;} } print(1); } void time(){ int count=0; P=head->next; while(count<n){ print(1); if(P==NULL)P=head->next; if(P->status=='R'){ P->cputime++; P->status='E'; print(2); P->status='R'; if(P->alltime==P->cputime){P->status='F';count++;} } P=P->next; } print(1); } int main(){ head=(CPB*)malloc(sizeof(CPB)); P=(CPB*)malloc(sizeof(CPB)); te=(CPB*)malloc(sizeof(CPB)); tc=(CPB*)malloc(sizeof(CPB)); P=head; puts("输入进程数目和调度方式，1为优先权，2为时间片轮转"); scanf("%d%d",&n,&m); for(int i=0;i<5;i++){ int pri,t; p[i]=(CPB*)malloc(sizeof(CPB)); scanf("%d%d",&pri,&t); p[i]->alltime=t; p[i]->id=i+1; p[i]->status='t'; p[i]->priority=pri; p[i]->cputime=0; p[i]->next=NULL; } if(m==1){ for(int i=0;i<n;i++) { int max=0; int j=0; for(int k=0;k<n;k++){ if(p[k]->status=='t'&&p[k]->priority>max){ max=p[k]->priority; j=k; } } p[j]->status='R'; P->next=p[j]; P=p[j]; } prio(); } else{ for(int i=0;i<n;i++) { p[i]->status='R'; P->next=p[i]; P=p[i]; } time(); } return 0; }