gem5
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
VirtualChannel.cc
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2008 Princeton University
3  * Copyright (c) 2016 Georgia Institute of Technology
4  * All rights reserved.
5  *
6  * Redistribution and use in source and binary forms, with or without
7  * modification, are permitted provided that the following conditions are
8  * met: redistributions of source code must retain the above copyright
9  * notice, this list of conditions and the following disclaimer;
10  * redistributions in binary form must reproduce the above copyright
11  * notice, this list of conditions and the following disclaimer in the
12  * documentation and/or other materials provided with the distribution;
13  * neither the name of the copyright holders nor the names of its
14  * contributors may be used to endorse or promote products derived from
15  * this software without specific prior written permission.
16  *
17  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28  *
29  * Authors: Niket Agarwal
30  * Tushar Krishna
31  */
32 
33 
35 
37  : m_enqueue_time(INFINITE_)
38 {
39  m_id = id;
40  m_input_buffer = new flitBuffer();
41  m_vc_state.first = IDLE_;
42  m_vc_state.second = Cycles(0);
43  m_output_vc = -1;
44  m_output_port = -1;
45 }
46 
48 {
49  delete m_input_buffer;
50 }
51 
52 void
54 {
55  m_vc_state.first = IDLE_;
56  m_vc_state.second = curTime;
58  m_output_port = -1;
59  m_output_vc = -1;
60 }
61 
62 void
64 {
65  m_vc_state.first = ACTIVE_;
66  m_vc_state.second = curTime;
67  m_enqueue_time = curTime;
68 }
69 
70 bool
72 {
73  if (m_input_buffer->isReady(time)) {
74  assert(m_vc_state.first == ACTIVE_ && m_vc_state.second <= time);
75  flit *t_flit = m_input_buffer->peekTopFlit();
76  return(t_flit->is_stage(stage, time));
77  }
78  return false;
79 }
80 
81 uint32_t
83 {
84  return m_input_buffer->functionalWrite(pkt);
85 }
void set_active(Cycles curTime)
uint32_t functionalWrite(Packet *pkt)
Cycles is a wrapper class for representing cycle counts, i.e.
Definition: types.hh:83
flitBuffer * m_input_buffer
Definition: flit.hh:44
std::pair< VC_state_type, Cycles > m_vc_state
#define INFINITE_
Definition: CommonTypes.hh:63
VirtualChannel(int id)
bool isReady(Cycles curTime)
Definition: flitBuffer.cc:53
A Packet is used to encapsulate a transfer between two objects in the memory system (e...
Definition: packet.hh:245
bool is_stage(flit_stage stage, Cycles time)
Definition: flit.hh:76
flit * peekTopFlit()
Definition: flitBuffer.hh:67
void set_idle(Cycles curTime)
bool need_stage(flit_stage stage, Cycles time)
flit_stage
Definition: CommonTypes.hh:44
Bitfield< 11 > id
Definition: miscregs.hh:124
uint32_t functionalWrite(Packet *pkt)
Definition: flitBuffer.cc:82

Generated on Fri Jun 9 2017 13:03:50 for gem5 by doxygen 1.8.6