FIFO.c

#include "FIFO.h"

// int cmp_FIFO(const void *a, const void *b) {
//     int rt_a = ((process *)a) -> t_re; 
//     int rt_b = ((process *)b) -> t_re; 
// 	return (rt_a - rt_b);
// }

void FIFO(process* pros, int process_num){
    long long clock = 0;
    increase_priority(getpid());
    queue q;  
    q.len = 0;
    q.head = 0;
    q.tail = 0;  
    // qsort(pros, process_num, sizeof(process), cmp_FIFO);
    bool running = false;
    int pro_running = -1;
    int finish_num = 0; //num of process that finish 

    while (finish_num < process_num){
        /* check whether to finish a process */
        if(running && pros[pro_running].t_ex == 0){
            waitpid(pros[pro_running].pid, NULL, 0);
            pros[pro_running].pid = -1;
            running = false;
            finish_num++;
            if(finish_num == process_num)   break;
        }
        /* create new process when it's ready*/
        for(int i = 0 ; i < process_num ; i++){
            if(pros[i].t_re == clock){
                syscall(GETTIME, &(pros[i].t_start));
                pros[i].pid = create_pro(pros[i]);
                q_append(&q, i);
            }
        }
        /* check whether to choose a new process to run */
        if(!running && finish_num < process_num && q.len > 0){
            pro_running = q_pop(&q);
            running = true;
            increase_priority(pros[pro_running].pid);
        }
        UNIT_TIME();
        if(running){
            pros[pro_running].t_ex--;
        }
        clock++;
    }
    return;
}