summaryrefslogtreecommitdiff
path: root/src/mem/ruby/network/garnet/fixed-pipeline/VirtualChannel_d.cc
blob: 94e78196c98cf26e828f1a6c99fcb30746bd3ffa (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
/*
 * Copyright (c) 2008 Princeton University
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met: redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer;
 * redistributions in binary form must reproduce the above copyright
 * notice, this list of conditions and the following disclaimer in the
 * documentation and/or other materials provided with the distribution;
 * neither the name of the copyright holders nor the names of its
 * contributors may be used to endorse or promote products derived from
 * this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 *
 * Authors: Niket Agarwal
 */

#include "mem/ruby/network/garnet/fixed-pipeline/VirtualChannel_d.hh"

VirtualChannel_d::VirtualChannel_d(int id)
{
        m_id = id;
        m_input_buffer = new flitBuffer_d();
        m_vc_state.first = IDLE_;
        m_vc_state.second = g_eventQueue_ptr->getTime();
        m_enqueue_time = INFINITE_;
}

VirtualChannel_d::~VirtualChannel_d()
{
        delete m_input_buffer;
}

void VirtualChannel_d::set_outport(int outport)
{
        route = outport;
}

void VirtualChannel_d::grant_vc(int out_vc)
{
        m_output_vc = out_vc;
        m_vc_state.first = ACTIVE_;
        m_vc_state.second = g_eventQueue_ptr->getTime() + 1;
        flit_d *t_flit = m_input_buffer->peekTopFlit();
        t_flit->advance_stage(SA_);
}

bool VirtualChannel_d::need_stage(VC_state_type state, flit_stage stage)
{
        if((m_vc_state.first == state) && (g_eventQueue_ptr->getTime() >= m_vc_state.second))
        {
                if(m_input_buffer->isReady())
                {
                        flit_d *t_flit = m_input_buffer->peekTopFlit();
                        return(t_flit->is_stage(stage)) ;
                }
        }
        return false;

}

bool VirtualChannel_d::need_stage_nextcycle(VC_state_type state, flit_stage stage)
{
        if((m_vc_state.first == state) && ((g_eventQueue_ptr->getTime()+1) >= m_vc_state.second))
        {
                if(m_input_buffer->isReadyForNext())
                {
                        flit_d *t_flit = m_input_buffer->peekTopFlit();
                        return(t_flit->is_next_stage(stage)) ;
                }
        }
        return false;
}