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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
/*
* 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
*/
#ifndef INPUT_UNIT_D_H
#define INPUT_UNIT_D_H
#include <iostream>
#include <vector>
#include "mem/ruby/network/garnet/NetworkHeader.hh"
#include "mem/ruby/network/garnet/fixed-pipeline/flitBuffer_d.hh"
#include "mem/ruby/common/Consumer.hh"
#include "mem/ruby/network/garnet/fixed-pipeline/VirtualChannel_d.hh"
#include "mem/ruby/network/garnet/fixed-pipeline/NetworkLink_d.hh"
#include "mem/ruby/network/garnet/fixed-pipeline/CreditLink_d.hh"
class Router_d;
class InputUnit_d : public Consumer {
public:
InputUnit_d(int id, Router_d *router);
~InputUnit_d();
void wakeup();
void printConfig(std::ostream& out);
flitBuffer_d* getCreditQueue() { return creditQueue; }
void print(std::ostream& out) const {};
inline int get_inlink_id()
{
return m_in_link->get_id();
}
inline void set_vc_state(VC_state_type state, int vc)
{
m_vcs[vc]->set_state(state);
}
inline void set_enqueue_time(int invc, Time time)
{
m_vcs[invc]->set_enqueue_time(time);
}
inline Time get_enqueue_time(int invc)
{
return m_vcs[invc]->get_enqueue_time();
}
inline void update_credit(int in_vc, int credit)
{
m_vcs[in_vc]->update_credit(credit);
}
inline bool has_credits(int vc)
{
return m_vcs[vc]->has_credits();
}
inline void increment_credit(int in_vc, bool free_signal)
{
flit_d *t_flit = new flit_d(in_vc, free_signal);
creditQueue->insert(t_flit);
g_eventQueue_ptr->scheduleEvent(m_credit_link, 1);
}
inline int get_outvc(int invc)
{
return m_vcs[invc]->get_outvc();
}
inline void updateRoute(int vc, int outport)
{
m_vcs[vc]->set_outport(outport);
m_vcs[vc]->set_state(VC_AB_);
}
inline void grant_vc(int in_vc, int out_vc)
{
m_vcs[in_vc]->grant_vc(out_vc);
}
inline flit_d* peekTopFlit(int vc)
{
return m_vcs[vc]->peekTopFlit();
}
inline flit_d* getTopFlit(int vc)
{
return m_vcs[vc]->getTopFlit();
}
inline bool need_stage(int vc, VC_state_type state, flit_stage stage)
{
return m_vcs[vc]->need_stage(state, stage);
}
inline bool need_stage_nextcycle(int vc, VC_state_type state, flit_stage stage)
{
return m_vcs[vc]->need_stage_nextcycle(state, stage);
}
inline bool isReady(int invc)
{
return m_vcs[invc]->isReady();
}
inline int get_route(int vc)
{
return m_vcs[vc]->get_route();
}
inline void set_in_link(NetworkLink_d *link)
{
m_in_link = link;
}
inline void set_credit_link(CreditLink_d *credit_link)
{
m_credit_link = credit_link;
}
inline double get_buf_read_count()
{
return m_num_buffer_reads;
}
inline double get_buf_write_count()
{
return m_num_buffer_writes;
}
private:
int m_id;
int m_num_vcs;
double m_num_buffer_writes, m_num_buffer_reads;
Router_d *m_router;
NetworkLink_d *m_in_link;
CreditLink_d *m_credit_link;
flitBuffer_d *creditQueue;
// Virtual channels
std::vector<VirtualChannel_d *> m_vcs; // [vc]
};
#endif
|
