#include "oshag.h"
void fb()
{
p = 0;
for (cpu_time = 0; cpu_time <22; cpu_time++) {
printf("---------------------------------------\n");
printf("Current Cpu time is %d\n", cpu_time);
if (p <= 4) if (cpu_time >= pth[p].time_set) {
pri[0][pri_head[0] % 5] = p;
pri_head[0]++;
pth[p].rtn();
pth[p].time_proc--;
printf("###Task %c still has %d cpu_time\n",
p+'A',
pth[p].time_proc);
p++;
printf("\nPriority queues:\n");
for (i = 0; i < 20; i++) {
if (!pri_head[i])
break;
if (pri_head[i] > pri_tail[i]) {
printf("pri %d: ", i);
for (j = pri_tail[i]; j < pri_head[i]; j++)
printf("%d ",pri[i][j % 5]);
printf("\n");
}
}
continue;
}
for (i=0; i<20; i++)
if (pri_head[i] > pri_tail[i]) {
crt_proc = pri[i][pri_tail[i] % 5];
pth[crt_proc].rtn();
pth[crt_proc].time_proc--;
printf("###Task %c still has %d cpu_time\n",
crt_proc+'A',
pth[crt_proc].time_proc);
if (cpu_time == 1) {
printf("\nPriority queues:\n");
for (i = 0; i < 20; i++) {
if (!pri_head[i])
break;
if (pri_head[i] > pri_tail[i]) {
printf("pri %d: ", i);
for (j = pri_tail[i]; j < pri_head[i]; j++)
printf("%d ",pri[i][j % 5]);
printf("\n");
}
}
break;
}
pri_tail[i]++;
if (pth[crt_proc].time_proc) {
pri[i+1][pri_head[i+1] % 5] = crt_proc;
pri_head[i+1]++;
}
printf("\nPriority queues:\n");
for (i = 0; i < 20; i++) {
if (!pri_head[i])
break;
if (pri_head[i] > pri_tail[i]) {
printf("pri %d: ", i);
for (j = pri_tail[i]; j < pri_head[i]; j++)
printf("%d ",pri[i][j % 5]);
printf("\n");
}
}
break;
}
if (i == 20)
printf("No task is running now\n");
}
}
