1/*
2 * Copyright (c) 2011 Mark D. Hill and David A. Wood
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#include "mem/ruby/slicc_interface/AbstractController.hh"
30#include "mem/ruby/system/Sequencer.hh"
31#include "mem/ruby/system/System.hh"
32
33AbstractController::AbstractController(const Params *p)
34 : ClockedObject(p), Consumer(this), m_fully_busy_cycles(0),
35 m_request_count(0)
36{
37 m_version = p->version;
38 m_transitions_per_cycle = p->transitions_per_cycle;
39 m_buffer_size = p->buffer_size;
40 m_recycle_latency = p->recycle_latency;
41 m_number_of_TBEs = p->number_of_TBEs;
42 m_is_blocking = false;
| 1/*
2 * Copyright (c) 2011 Mark D. Hill and David A. Wood
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
15 *
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 */
28
29#include "mem/ruby/slicc_interface/AbstractController.hh"
30#include "mem/ruby/system/Sequencer.hh"
31#include "mem/ruby/system/System.hh"
32
33AbstractController::AbstractController(const Params *p)
34 : ClockedObject(p), Consumer(this), m_fully_busy_cycles(0),
35 m_request_count(0)
36{
37 m_version = p->version;
38 m_transitions_per_cycle = p->transitions_per_cycle;
39 m_buffer_size = p->buffer_size;
40 m_recycle_latency = p->recycle_latency;
41 m_number_of_TBEs = p->number_of_TBEs;
42 m_is_blocking = false;
|
43}
44
45void
46AbstractController::init()
47{
48 params()->ruby_system->registerAbstractController(this);
49}
50
51void
52AbstractController::clearStats()
53{
54 m_requestProfileMap.clear();
55 m_request_count = 0;
56
57 m_delayHistogram.clear();
58
59 uint32_t size = Network::getNumberOfVirtualNetworks();
60 m_delayVCHistogram.resize(size);
61 for (uint32_t i = 0; i < size; i++) {
62 m_delayVCHistogram[i].clear();
63 }
64
65 Sequencer *seq = getSequencer();
66 if (seq != NULL) {
67 seq->clearStats();
68 }
69}
70
71void
72AbstractController::profileRequest(const std::string &request)
73{
74 m_request_count++;
75
76 // if it doesn't exist, conveniently, it will be created with the
77 // default value which is 0
78 m_requestProfileMap[request]++;
79}
80
81void
82AbstractController::profileMsgDelay(uint32_t virtualNetwork, Cycles delay)
83{
84 assert(virtualNetwork < m_delayVCHistogram.size());
85 m_delayHistogram.add(delay);
86 m_delayVCHistogram[virtualNetwork].add(delay);
87}
88
89void
90AbstractController::connectWithPeer(AbstractController *c)
91{
92 getQueuesFromPeer(c);
93 c->getQueuesFromPeer(this);
94}
95
96void
97AbstractController::stallBuffer(MessageBuffer* buf, Address addr)
98{
99 if (m_waiting_buffers.count(addr) == 0) {
100 MsgVecType* msgVec = new MsgVecType;
101 msgVec->resize(m_max_in_port_rank, NULL);
102 m_waiting_buffers[addr] = msgVec;
103 }
104 (*(m_waiting_buffers[addr]))[m_cur_in_port_rank] = buf;
105}
106
107void
108AbstractController::wakeUpBuffers(Address addr)
109{
110 if (m_waiting_buffers.count(addr) > 0) {
111 //
112 // Wake up all possible lower rank (i.e. lower priority) buffers that could
113 // be waiting on this message.
114 //
115 for (int in_port_rank = m_cur_in_port_rank - 1;
116 in_port_rank >= 0;
117 in_port_rank--) {
118 if ((*(m_waiting_buffers[addr]))[in_port_rank] != NULL) {
119 (*(m_waiting_buffers[addr]))[in_port_rank]->reanalyzeMessages(addr);
120 }
121 }
122 delete m_waiting_buffers[addr];
123 m_waiting_buffers.erase(addr);
124 }
125}
126
127void
128AbstractController::wakeUpAllBuffers(Address addr)
129{
130 if (m_waiting_buffers.count(addr) > 0) {
131 //
132 // Wake up all possible lower rank (i.e. lower priority) buffers that could
133 // be waiting on this message.
134 //
135 for (int in_port_rank = m_max_in_port_rank - 1;
136 in_port_rank >= 0;
137 in_port_rank--) {
138 if ((*(m_waiting_buffers[addr]))[in_port_rank] != NULL) {
139 (*(m_waiting_buffers[addr]))[in_port_rank]->reanalyzeMessages(addr);
140 }
141 }
142 delete m_waiting_buffers[addr];
143 m_waiting_buffers.erase(addr);
144 }
145}
146
147void
148AbstractController::wakeUpAllBuffers()
149{
150 //
151 // Wake up all possible buffers that could be waiting on any message.
152 //
153
154 std::vector<MsgVecType*> wokeUpMsgVecs;
155
156 if(m_waiting_buffers.size() > 0) {
157 for (WaitingBufType::iterator buf_iter = m_waiting_buffers.begin();
158 buf_iter != m_waiting_buffers.end();
159 ++buf_iter) {
160 for (MsgVecType::iterator vec_iter = buf_iter->second->begin();
161 vec_iter != buf_iter->second->end();
162 ++vec_iter) {
163 if (*vec_iter != NULL) {
164 (*vec_iter)->reanalyzeAllMessages();
165 }
166 }
167 wokeUpMsgVecs.push_back(buf_iter->second);
168 }
169
170 for (std::vector<MsgVecType*>::iterator wb_iter = wokeUpMsgVecs.begin();
171 wb_iter != wokeUpMsgVecs.end();
172 ++wb_iter) {
173 delete (*wb_iter);
174 }
175
176 m_waiting_buffers.clear();
177 }
178}
| 49}
50
51void
52AbstractController::init()
53{
54 params()->ruby_system->registerAbstractController(this);
55}
56
57void
58AbstractController::clearStats()
59{
60 m_requestProfileMap.clear();
61 m_request_count = 0;
62
63 m_delayHistogram.clear();
64
65 uint32_t size = Network::getNumberOfVirtualNetworks();
66 m_delayVCHistogram.resize(size);
67 for (uint32_t i = 0; i < size; i++) {
68 m_delayVCHistogram[i].clear();
69 }
70
71 Sequencer *seq = getSequencer();
72 if (seq != NULL) {
73 seq->clearStats();
74 }
75}
76
77void
78AbstractController::profileRequest(const std::string &request)
79{
80 m_request_count++;
81
82 // if it doesn't exist, conveniently, it will be created with the
83 // default value which is 0
84 m_requestProfileMap[request]++;
85}
86
87void
88AbstractController::profileMsgDelay(uint32_t virtualNetwork, Cycles delay)
89{
90 assert(virtualNetwork < m_delayVCHistogram.size());
91 m_delayHistogram.add(delay);
92 m_delayVCHistogram[virtualNetwork].add(delay);
93}
94
95void
96AbstractController::connectWithPeer(AbstractController *c)
97{
98 getQueuesFromPeer(c);
99 c->getQueuesFromPeer(this);
100}
101
102void
103AbstractController::stallBuffer(MessageBuffer* buf, Address addr)
104{
105 if (m_waiting_buffers.count(addr) == 0) {
106 MsgVecType* msgVec = new MsgVecType;
107 msgVec->resize(m_max_in_port_rank, NULL);
108 m_waiting_buffers[addr] = msgVec;
109 }
110 (*(m_waiting_buffers[addr]))[m_cur_in_port_rank] = buf;
111}
112
113void
114AbstractController::wakeUpBuffers(Address addr)
115{
116 if (m_waiting_buffers.count(addr) > 0) {
117 //
118 // Wake up all possible lower rank (i.e. lower priority) buffers that could
119 // be waiting on this message.
120 //
121 for (int in_port_rank = m_cur_in_port_rank - 1;
122 in_port_rank >= 0;
123 in_port_rank--) {
124 if ((*(m_waiting_buffers[addr]))[in_port_rank] != NULL) {
125 (*(m_waiting_buffers[addr]))[in_port_rank]->reanalyzeMessages(addr);
126 }
127 }
128 delete m_waiting_buffers[addr];
129 m_waiting_buffers.erase(addr);
130 }
131}
132
133void
134AbstractController::wakeUpAllBuffers(Address addr)
135{
136 if (m_waiting_buffers.count(addr) > 0) {
137 //
138 // Wake up all possible lower rank (i.e. lower priority) buffers that could
139 // be waiting on this message.
140 //
141 for (int in_port_rank = m_max_in_port_rank - 1;
142 in_port_rank >= 0;
143 in_port_rank--) {
144 if ((*(m_waiting_buffers[addr]))[in_port_rank] != NULL) {
145 (*(m_waiting_buffers[addr]))[in_port_rank]->reanalyzeMessages(addr);
146 }
147 }
148 delete m_waiting_buffers[addr];
149 m_waiting_buffers.erase(addr);
150 }
151}
152
153void
154AbstractController::wakeUpAllBuffers()
155{
156 //
157 // Wake up all possible buffers that could be waiting on any message.
158 //
159
160 std::vector<MsgVecType*> wokeUpMsgVecs;
161
162 if(m_waiting_buffers.size() > 0) {
163 for (WaitingBufType::iterator buf_iter = m_waiting_buffers.begin();
164 buf_iter != m_waiting_buffers.end();
165 ++buf_iter) {
166 for (MsgVecType::iterator vec_iter = buf_iter->second->begin();
167 vec_iter != buf_iter->second->end();
168 ++vec_iter) {
169 if (*vec_iter != NULL) {
170 (*vec_iter)->reanalyzeAllMessages();
171 }
172 }
173 wokeUpMsgVecs.push_back(buf_iter->second);
174 }
175
176 for (std::vector<MsgVecType*>::iterator wb_iter = wokeUpMsgVecs.begin();
177 wb_iter != wokeUpMsgVecs.end();
178 ++wb_iter) {
179 delete (*wb_iter);
180 }
181
182 m_waiting_buffers.clear();
183 }
184}
|