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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
|
// $Id: router.hpp 5188 2012-08-30 00:31:31Z dub $
/*
Copyright (c) 2007-2012, Trustees of The Leland Stanford Junior 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.
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.
*/
#ifndef _ROUTER_HPP_
#define _ROUTER_HPP_
#include <string>
#include <vector>
#include "timed_module.hpp"
#include "flit.hpp"
#include "credit.hpp"
#include "flitchannel.hpp"
#include "channel.hpp"
#include "config_utils.hpp"
typedef Channel<Credit> CreditChannel;
class Router : public TimedModule {
protected:
static int const STALL_BUFFER_BUSY;
static int const STALL_BUFFER_CONFLICT;
static int const STALL_BUFFER_FULL;
static int const STALL_BUFFER_RESERVED;
static int const STALL_CROSSBAR_CONFLICT;
int _id;
int _inputs;
int _outputs;
int _classes;
int _input_speedup;
int _output_speedup;
double _internal_speedup;
double _partial_internal_cycles;
int _crossbar_delay;
int _credit_delay;
vector<FlitChannel *> _input_channels;
vector<CreditChannel *> _input_credits;
vector<FlitChannel *> _output_channels;
vector<CreditChannel *> _output_credits;
vector<bool> _channel_faults;
#ifdef TRACK_FLOWS
vector<vector<int> > _received_flits;
vector<vector<int> > _stored_flits;
vector<vector<int> > _sent_flits;
vector<vector<int> > _outstanding_credits;
vector<vector<int> > _active_packets;
#endif
#ifdef TRACK_STALLS
vector<int> _buffer_busy_stalls;
vector<int> _buffer_conflict_stalls;
vector<int> _buffer_full_stalls;
vector<int> _buffer_reserved_stalls;
vector<int> _crossbar_conflict_stalls;
#endif
virtual void _InternalStep() = 0;
public:
Router( const Configuration& config,
Module *parent, const string & name, int id,
int inputs, int outputs );
static Router *NewRouter( const Configuration& config,
Module *parent, const string & name, int id,
int inputs, int outputs );
virtual void AddInputChannel( FlitChannel *channel, CreditChannel *backchannel );
virtual void AddOutputChannel( FlitChannel *channel, CreditChannel *backchannel );
inline FlitChannel * GetInputChannel( int input ) const {
assert((input >= 0) && (input < _inputs));
return _input_channels[input];
}
inline FlitChannel * GetOutputChannel( int output ) const {
assert((output >= 0) && (output < _outputs));
return _output_channels[output];
}
virtual void ReadInputs( ) = 0;
virtual void Evaluate( );
virtual void WriteOutputs( ) = 0;
void OutChannelFault( int c, bool fault = true );
bool IsFaultyOutput( int c ) const;
inline int GetID( ) const {return _id;}
virtual int GetUsedCredit(int o) const = 0;
virtual int GetBufferOccupancy(int i) const = 0;
#ifdef TRACK_BUFFERS
virtual int GetUsedCreditForClass(int output, int cl) const = 0;
virtual int GetBufferOccupancyForClass(int input, int cl) const = 0;
#endif
#ifdef TRACK_FLOWS
inline vector<int> const & GetReceivedFlits(int c) const {
assert((c >= 0) && (c < _classes));
return _received_flits[c];
}
inline vector<int> const & GetStoredFlits(int c) const {
assert((c >= 0) && (c < _classes));
return _stored_flits[c];
}
inline vector<int> const & GetSentFlits(int c) const {
assert((c >= 0) && (c < _classes));
return _sent_flits[c];
}
inline vector<int> const & GetOutstandingCredits(int c) const {
assert((c >= 0) && (c < _classes));
return _outstanding_credits[c];
}
inline vector<int> const & GetActivePackets(int c) const {
assert((c >= 0) && (c < _classes));
return _active_packets[c];
}
inline void ResetFlowStats(int c) {
assert((c >= 0) && (c < _classes));
_received_flits[c].assign(_received_flits[c].size(), 0);
_sent_flits[c].assign(_sent_flits[c].size(), 0);
}
#endif
virtual vector<int> UsedCredits() const = 0;
virtual vector<int> FreeCredits() const = 0;
virtual vector<int> MaxCredits() const = 0;
#ifdef TRACK_STALLS
inline int GetBufferBusyStalls(int c) const {
assert((c >= 0) && (c < _classes));
return _buffer_busy_stalls[c];
}
inline int GetBufferConflictStalls(int c) const {
assert((c >= 0) && (c < _classes));
return _buffer_conflict_stalls[c];
}
inline int GetBufferFullStalls(int c) const {
assert((c >= 0) && (c < _classes));
return _buffer_full_stalls[c];
}
inline int GetBufferReservedStalls(int c) const {
assert((c >= 0) && (c < _classes));
return _buffer_reserved_stalls[c];
}
inline int GetCrossbarConflictStalls(int c) const {
assert((c >= 0) && (c < _classes));
return _crossbar_conflict_stalls[c];
}
inline void ResetStallStats(int c) {
assert((c >= 0) && (c < _classes));
_buffer_busy_stalls[c] = 0;
_buffer_conflict_stalls[c] = 0;
_buffer_full_stalls[c] = 0;
_buffer_reserved_stalls[c] = 0;
_crossbar_conflict_stalls[c] = 0;
}
#endif
inline int NumInputs() const {return _inputs;}
inline int NumOutputs() const {return _outputs;}
};
#endif
|
