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
|
// $Id: iq_router.hpp 5263 2012-09-20 23:40:33Z 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 _IQ_ROUTER_HPP_
#define _IQ_ROUTER_HPP_
#include <string>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include "router.hpp"
#include "routefunc.hpp"
using namespace std;
class VC;
class Flit;
class Credit;
class Buffer;
class BufferState;
class Allocator;
class SwitchMonitor;
class BufferMonitor;
class IQRouter : public Router {
int _vcs;
bool _vc_busy_when_full;
bool _vc_prioritize_empty;
bool _vc_shuffle_requests;
bool _speculative;
bool _spec_check_elig;
bool _spec_check_cred;
bool _spec_mask_by_reqs;
bool _active;
int _routing_delay;
int _vc_alloc_delay;
int _sw_alloc_delay;
map<int, Flit *> _in_queue_flits;
deque<pair<int, pair<Credit *, int> > > _proc_credits;
deque<pair<int, pair<int, int> > > _route_vcs;
deque<pair<int, pair<pair<int, int>, int> > > _vc_alloc_vcs;
deque<pair<int, pair<pair<int, int>, int> > > _sw_hold_vcs;
deque<pair<int, pair<pair<int, int>, int> > > _sw_alloc_vcs;
deque<pair<int, pair<Flit *, pair<int, int> > > > _crossbar_flits;
map<int, Credit *> _out_queue_credits;
vector<Buffer *> _buf;
vector<BufferState *> _next_buf;
Allocator *_vc_allocator;
Allocator *_sw_allocator;
Allocator *_spec_sw_allocator;
vector<int> _vc_rr_offset;
vector<int> _sw_rr_offset;
tRoutingFunction _rf;
int _output_buffer_size;
vector<queue<Flit *> > _output_buffer;
vector<queue<Credit *> > _credit_buffer;
bool _hold_switch_for_packet;
vector<int> _switch_hold_in;
vector<int> _switch_hold_out;
vector<int> _switch_hold_vc;
bool _noq;
vector<vector<int> > _noq_next_output_port;
vector<vector<int> > _noq_next_vc_start;
vector<vector<int> > _noq_next_vc_end;
#ifdef TRACK_FLOWS
vector<vector<queue<int> > > _outstanding_classes;
#endif
bool _ReceiveFlits( );
bool _ReceiveCredits( );
virtual void _InternalStep( );
bool _SWAllocAddReq(int input, int vc, int output);
void _InputQueuing( );
void _RouteEvaluate( );
void _VCAllocEvaluate( );
void _SWHoldEvaluate( );
void _SWAllocEvaluate( );
void _SwitchEvaluate( );
void _RouteUpdate( );
void _VCAllocUpdate( );
void _SWHoldUpdate( );
void _SWAllocUpdate( );
void _SwitchUpdate( );
void _OutputQueuing( );
void _SendFlits( );
void _SendCredits( );
void _UpdateNOQ(int input, int vc, Flit const * f);
// ----------------------------------------
//
// Router Power Modellingyes
//
// ----------------------------------------
SwitchMonitor * _switchMonitor ;
BufferMonitor * _bufferMonitor ;
public:
IQRouter( Configuration const & config,
Module *parent, string const & name, int id,
int inputs, int outputs );
virtual ~IQRouter( );
virtual void AddOutputChannel(FlitChannel * channel, CreditChannel * backchannel);
virtual void ReadInputs( );
virtual void WriteOutputs( );
void Display( ostream & os = cout ) const;
virtual int GetUsedCredit(int o) const;
virtual int GetBufferOccupancy(int i) const;
#ifdef TRACK_BUFFERS
virtual int GetUsedCreditForClass(int output, int cl) const;
virtual int GetBufferOccupancyForClass(int input, int cl) const;
#endif
virtual vector<int> UsedCredits() const;
virtual vector<int> FreeCredits() const;
virtual vector<int> MaxCredits() const;
SwitchMonitor const * const GetSwitchMonitor() const {return _switchMonitor;}
BufferMonitor const * const GetBufferMonitor() const {return _bufferMonitor;}
};
#endif
|
