1/*
2 * Copyright (c) 1999-2008 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;

--- 89 unchanged lines hidden (view full) ---

98
99PerfectSwitch::~PerfectSwitch()
100{
101}
102
103void
104PerfectSwitch::operateVnet(int vnet)
105{
106 MsgPtr msg_ptr;
107 Message *net_msg_ptr = NULL;
108
109 // This is for round-robin scheduling
110 int incoming = m_round_robin_start;
111 m_round_robin_start++;
112 if (m_round_robin_start >= m_in.size()) {
113 m_round_robin_start = 0;
114 }
115
116 if(m_pending_message_count[vnet] > 0) {
117 // for all input ports, use round robin scheduling
118 for (int counter = 0; counter < m_in.size(); counter++) {
119 // Round robin scheduling
120 incoming++;
121 if (incoming >= m_in.size()) {
122 incoming = 0;
123 }
124
125 // temporary vectors to store the routing results
126 vector<LinkID> output_links;
127 vector<NetDest> output_link_destinations;
128
129 // Is there a message waiting?
130 if (m_in[incoming].size() <= vnet) {
131 continue;
132 }
133
134 MessageBuffer *buffer = m_in[incoming][vnet];
135 if (buffer == nullptr) {
136 continue;
137 }
138
139 while (buffer->isReady()) {
140 DPRINTF(RubyNetwork, "incoming: %d\n", incoming);
141
142 // Peek at message
143 msg_ptr = buffer->peekMsgPtr();
144 net_msg_ptr = msg_ptr.get();
145 DPRINTF(RubyNetwork, "Message: %s\n", (*net_msg_ptr));
146
147 output_links.clear();
148 output_link_destinations.clear();
149 NetDest msg_dsts = net_msg_ptr->getDestination();
150
151 // Unfortunately, the token-protocol sends some
152 // zero-destination messages, so this assert isn't valid
153 // assert(msg_dsts.count() > 0);
154
155 assert(m_link_order.size() == m_routing_table.size());
156 assert(m_link_order.size() == m_out.size());
157
158 if (m_network_ptr->getAdaptiveRouting()) {
159 if (m_network_ptr->isVNetOrdered(vnet)) {
160 // Don't adaptively route
161 for (int out = 0; out < m_out.size(); out++) {
162 m_link_order[out].m_link = out;
163 m_link_order[out].m_value = 0;
164 }
165 } else {
166 // Find how clogged each link is
167 for (int out = 0; out < m_out.size(); out++) {
168 int out_queue_length = 0;
169 for (int v = 0; v < m_virtual_networks; v++) {
170 out_queue_length += m_out[out][v]->getSize();
171 }
172 int value =
173 (out_queue_length << 8) |
174 random_mt.random(0, 0xff);
175 m_link_order[out].m_link = out;
176 m_link_order[out].m_value = value;
177 }
178
179 // Look at the most empty link first
180 sort(m_link_order.begin(), m_link_order.end());
181 }
182 }
183
184 for (int i = 0; i < m_routing_table.size(); i++) {
185 // pick the next link to look at
186 int link = m_link_order[i].m_link;
187 NetDest dst = m_routing_table[link];
188 DPRINTF(RubyNetwork, "dst: %s\n", dst);
189
190 if (!msg_dsts.intersectionIsNotEmpty(dst))
191 continue;
192
193 // Remember what link we're using
194 output_links.push_back(link);
195
196 // Need to remember which destinations need this message in
197 // another vector. This Set is the intersection of the
198 // routing_table entry and the current destination set. The
199 // intersection must not be empty, since we are inside "if"
200 output_link_destinations.push_back(msg_dsts.AND(dst));
201
202 // Next, we update the msg_destination not to include
203 // those nodes that were already handled by this link
204 msg_dsts.removeNetDest(dst);
205 }
206
207 assert(msg_dsts.count() == 0);
208
209 // Check for resources - for all outgoing queues
210 bool enough = true;
211 for (int i = 0; i < output_links.size(); i++) {
212 int outgoing = output_links[i];
213
214 if (!m_out[outgoing][vnet]->areNSlotsAvailable(1))
215 enough = false;
216
217 DPRINTF(RubyNetwork, "Checking if node is blocked ..."
218 "outgoing: %d, vnet: %d, enough: %d\n",
219 outgoing, vnet, enough);
220 }
221
222 // There were not enough resources
223 if (!enough) {
224 scheduleEvent(Cycles(1));
225 DPRINTF(RubyNetwork, "Can't deliver message since a node "
226 "is blocked\n");
227 DPRINTF(RubyNetwork, "Message: %s\n", (*net_msg_ptr));
228 break; // go to next incoming port
229 }
230
231 MsgPtr unmodified_msg_ptr;
232
233 if (output_links.size() > 1) {
234 // If we are sending this message down more than one link
235 // (size>1), we need to make a copy of the message so each
236 // branch can have a different internal destination we need
237 // to create an unmodified MsgPtr because the MessageBuffer
238 // enqueue func will modify the message
239
240 // This magic line creates a private copy of the message
241 unmodified_msg_ptr = msg_ptr->clone();
242 }
243
244 // Dequeue msg
245 buffer->dequeue();
246 m_pending_message_count[vnet]--;
247
248 // Enqueue it - for all outgoing queues
249 for (int i=0; i<output_links.size(); i++) {
250 int outgoing = output_links[i];
251
252 if (i > 0) {
253 // create a private copy of the unmodified message
254 msg_ptr = unmodified_msg_ptr->clone();
255 }
256
257 // Change the internal destination set of the message so it
258 // knows which destinations this link is responsible for.
259 net_msg_ptr = msg_ptr.get();
260 net_msg_ptr->getDestination() =
261 output_link_destinations[i];
262
263 // Enqeue msg
264 DPRINTF(RubyNetwork, "Enqueuing net msg from "
265 "inport[%d][%d] to outport [%d][%d].\n",
266 incoming, vnet, outgoing, vnet);
267
268 m_out[outgoing][vnet]->enqueue(msg_ptr);
269 }
270 }
271 }
272 }
273}
274
275void
276PerfectSwitch::wakeup()
277{
278 // Give the highest numbered link priority most of the time

--- 42 unchanged lines hidden ---