//fifo.cpp要寫的只有這個
#include <iostream>
using namespace std;
#include "fifo.h"
#include "job.h"

fifo::fifo( int seconds_per_page ) : simulator( seconds_per_page )
{
}

void fifo::simulate( string file )
{
    int aggregate_latency   = 0;
    int complete_jobs       = 0;
    /* 讀入文件 */
    loadworkload( file );

    /* 判斷棧是否為空 */
    if ( workload.empty() )
    {
        cout << "\n\tThe queue is  empty\n";
    } else {
        /* 開始工作了 */
        cout << "\n\nFIFO Simulaton\n\n";
        /*下一次可以工作的時間,是當(dāng)前時間加上打印的耗時 */
        int next_time = 0;

        /* 工作臺和等待隊列均不為空時執(zhí)行for循環(huán)*/
        for ( int time = 0; !(workload.empty() && waiting.empty() ); time++ )
        {
            /*
             * Look at the workload, enqueue job, if it is time
             * 如果工作臺列隊不為空而且當(dāng)前時間大于等于工作臺的第一個event到來時間业踏，就把它放入等待隊列
             */
            while ( !workload.empty() && time >= workload.front().arrival_time() )
            {
                /* 工作臺隊頭加入到等待隊列 */
                event e = workload.front();
                workload.pop();
                waiting.push( e );
                job j = e.getjob();
                /* 正在等待打印 */
                cout << "\tArriving: " << j << " at " << time << " seconds\n";
            }
            /* 當(dāng)前時間小于下一個到達(dá)的時繼續(xù)for循環(huán)*/
            if ( time < next_time )
            {
                continue;
            }
            /* 等待列隊不為空則打印 */
            if ( !waiting.empty() )
            {
                /* 打印waiting隊頭元素 */
                event   e   = waiting.front();
                job j   = e.getjob();
                /* 打印時間 */
                cout << "\tServicing: " << j << " at " << time << " seconds\n";
                /* waiting隊頭元素出列表示完成 */
                waiting.pop();
                /*下一次循環(huán)的時間*/
                next_time = time + (seconds_per_page * e.getjob().getnumpages() );
                /* 總延遲账胧，是當(dāng)前時間減去event到達(dá)的時間*/
                aggregate_latency += (time - e.arrival_time() );
                /* 工作計數(shù)*/
                complete_jobs++;
            }
        }
        /*總工作數(shù)*/
        cout << "\n\tTotal jobs: " << complete_jobs;
        /* 總延遲*/
        cout << "\n\tAggregate latency: " << aggregate_latency << " seconds";
        /* 平均延遲*/
        cout << "\n\tMean latency: "<< (float) aggregate_latency /(float) complete_jobs << " seconds\n";
    }
}