操作系统课设 两道批处理 二级调度

if(p->kstime.shi==0&&p->kstime.fen==0)
{ p->kstime.shi=xttime.shi;
p->kstime.fen=xttime.fen;
}
p->yxtime=p->yxtime+10;
printf("\t\t** **\n");
printf("\t\t** 作业调度采用先来先服务算法 **\n");
printf("\t\t** 进程调度采用可抢占的优先级调度算法 **\n");
printf("\t\t********************************************\n");
p->link=second;
first->link=p;
second=NULL;
insert=1;
}
else
{
first=first->link;
second=second->link;
}
int insert=0;
if((ready==NULL)||time_cmp(p->tjtime,ready->tjtime)==-1) //提交时间最短的插到队首
{
p->link=ready;
ready=p;
}
else
{
first=ready;
printf("进程名\t 提交时间 需要运行时间 优先数\n");
for(i=1;i<=num2;i++)
{
if(b->state=='W')
printf("%s\t %d:%d\t %d %d \n",b->name,b->tjtime,b->xytime,b->pri,b->state);
{
if(a.shi<b.shi) return -1;
else if(a.shi==b.shi&&a.fen<b.fen) return -1;
else if(a.shi==b.shi&&a.fen==b.fen) return 0;
return 1;
for(i=1;i<=num;i++)
{
printf("\n 进程No.%d:\ntf("\n 请输入进程名:");
scanf("%s",p->name);
p->tjtime.shi=0,p->tjtime.fen=0;
{ if(c->state=='S'||c->state=='W')
printf(" %s \t %d:%d \t %d %d %d \n",d->name,d->tjtime.shi,d->tjtime.fen,d->xytime,d->yxtime,d->pri);
if(d->link==NULL)break;
if(p->yxtime==p->xytime)
shunxu1();
}
else
{ printf("%s\n",p->name);
if(p->kstime.shi==0&&p->kstime.fen==0)
{ p->kstime.shi=xttime.shi;
if(p->link->kstime.shi==0&&p->link->kstime.fen==0)
{ p->link->kstime.shi=xttime.shi;
p->link->kstime.fen=xttime.fen;
}
second=first->link;
while(second!=NULL)
{
if(time_cmp(p->tjtime,second->tjtime)==-1) /*若插入进程比当前进程提交时间小,*/
{ /*插入到当前进程前面*/
scanf("%d",&p->pri);
printf("\n");
p->state='S';
p->yxtime=0;
p->kstime.shi=0,p->kstime.fen=0;
p->link=0;
fcfs();
}
else
{ printf("\n 您的输入有误！！请重新输入\n");
float s1=0,s2=0;
printf("\t\t********************************************\n");
printf("\t\t** 题目：两道道批处理系统的两级调度-2 **\n");
printf("\t\t** 计算机学院 级计算机科学与技术班 **\n");
}
int time_j(struct time c,struct time d)
{ int s;
s=c.shi*60+c.fen-d.shi*60-d.fen;
return s;
}
void fcfs() /* 先来先服务调度函数*/
{
PCB *first, *second;
shuru();
getchar();
p=ready;
while(1)
{ c=p;
for(i=1;i<=num2;i++)
{ if(time_cmp(c->tjtime,xttime)==0||time_cmp(c->tjtime,xttime)==-1)
{
int shi; //时
int fen; //分
};
struct time xttime; //系统时间
int flag=0; //记录内存作业数
struct pcb /* 定义进程控制块PCB */
{
char name[10]; //进程名
q->wctime.fen=xttime.fen;
flag--;
num2--;
q->state='F';//把作业状态置为已完成
}
void shunxu2()
{ if(one==NULL) {one=p->link;q=one;}
else
{ q->link=p->link;
if(b->link==NULL)break;
b=b->link;
}
getchar();
}
void main() /*主函数*/
{
xttime.shi=10;
xttime.fen=00;
PCB *second,*c;
int i,x,y;
d=d->link;
}
if(flag==0)printf("内存内作业为空");
else yunxing();
}
void jiuxuzy()
{ int i;
PCB *b;
b=p;
printf("**就绪的作业\n");
p->link->yxtime=p->link->yxtime+10;
if(p->link->yxtime==p->link->xytime)
shunxu2();
}
else
{ printf("%s\n",p->name);
}*ready=NULL,*one=NULL,*p,*q=NULL;
typedef struct pcb PCB;
int num,num2;
int time_cmp(struct time a,struct time b) //时间比较函数 a<b返回-1 ;a==b返回0; a>b返回1;
p->kstime.fen=xttime.fen;
}
p->yxtime=p->yxtime+10;
if(p->yxtime==p->xytime)
shunxu1();
}
}
void neicunzy()
#include "stdio.h"
#include <stdlib.h>
#include <conio.h>
#define getpch(type) (type*)malloc(sizeof(type))
#define NULL 0
struct time //定义时间结构体
q=p->link;
}
p->link=q->link;
q->link=NULL;
q->wctime.shi=xttime.shi;