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
|
// $Id: event_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 _EVENT_ROUTER_HPP_
#define _EVENT_ROUTER_HPP_
#include <string>
#include <queue>
#include <vector>
#include "module.hpp"
#include "router.hpp"
#include "buffer.hpp"
#include "vc.hpp"
#include "prio_arb.hpp"
#include "routefunc.hpp"
#include "outputset.hpp"
#include "pipefifo.hpp"
class EventNextVCState : public Module {
public:
enum eNextVCState { idle, busy, tail_pending };
struct tWaiting {
int input;
int vc;
int id;
int pres;
bool watch;
};
private:
int _buf_size;
int _vcs;
vector<int> _credits;
vector<int> _presence;
vector<int> _input;
vector<int> _inputVC;
vector<list<tWaiting *> > _waiting;
vector<eNextVCState> _state;
public:
EventNextVCState( const Configuration& config,
Module *parent, const string& name );
eNextVCState GetState( int vc ) const;
int GetPresence( int vc ) const;
int GetCredits( int vc ) const;
int GetInput( int vc ) const;
int GetInputVC( int vc ) const;
bool IsWaiting( int vc ) const;
bool IsInputWaiting( int vc, int w_input, int w_vc ) const;
void PushWaiting( int vc, tWaiting *w );
void IncrWaiting( int vc, int w_input, int w_vc );
tWaiting *PopWaiting( int vc );
void SetState( int vc, eNextVCState state );
void SetCredits( int vc, int value );
void SetPresence( int vc, int value );
void SetInput( int vc, int input );
void SetInputVC( int vc, int in_vc );
};
class EventRouter : public Router {
int _vcs;
int _vct;
vector<Buffer *> _buf;
vector<vector<bool> > _active;
tRoutingFunction _rf;
vector<EventNextVCState *> _output_state;
PipelineFIFO<Flit> *_crossbar_pipe;
PipelineFIFO<Credit> *_credit_pipe;
vector<queue<Flit *> > _input_buffer;
vector<queue<Flit *> > _output_buffer;
vector<queue<Credit *> > _in_cred_buffer;
vector<queue<Credit *> > _out_cred_buffer;
struct tArrivalEvent {
int input;
int output;
int src_vc;
int dst_vc;
bool head;
bool tail;
int id; // debug
bool watch; // debug
};
PipelineFIFO<tArrivalEvent> *_arrival_pipe;
vector<queue<tArrivalEvent *> > _arrival_queue;
vector<PriorityArbiter*> _arrival_arbiter;
struct tTransportEvent {
int input;
int src_vc;
int dst_vc;
int id; // debug
bool watch; // debug
};
vector<queue<tTransportEvent *> > _transport_queue;
vector<PriorityArbiter*> _transport_arbiter;
vector<bool> _transport_free;
vector<int> _transport_match;
void _ReceiveFlits( );
void _ReceiveCredits( );
void _IncomingFlits( );
void _ArrivalRequests( int input );
void _ArrivalArb( int output );
void _SendTransport( int input, int output, tArrivalEvent *aevt );
void _ProcessWaiting( int output, int out_vc );
void _TransportRequests( int output );
void _TransportArb( int input );
void _OutputQueuing( );
void _SendFlits( );
void _SendCredits( );
virtual void _InternalStep( );
public:
EventRouter( const Configuration& config,
Module *parent, const string & name, int id,
int inputs, int outputs );
virtual ~EventRouter( );
virtual void ReadInputs( );
virtual void WriteOutputs( );
virtual int GetUsedCredit(int o) const {return 0;}
virtual int GetBufferOccupancy(int i) const {return 0;}
#ifdef TRACK_BUFFERS
virtual int GetUsedCreditForClass(int output, int cl) const {return 0;}
virtual int GetBufferOccupancyForClass(int input, int cl) const {return 0;}
#endif
virtual vector<int> UsedCredits() const { return vector<int>(); }
virtual vector<int> FreeCredits() const { return vector<int>(); }
virtual vector<int> MaxCredits() const { return vector<int>(); }
void Display( ostream & os = cout ) const;
};
#endif
|
