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;

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

139 int vnet)
140{
141 MsgPtr msg_ptr;
142 Message *net_msg_ptr = NULL;
143
144 // temporary vectors to store the routing results
145 vector<LinkID> output_links;
146 vector<NetDest> output_link_destinations;
147
148 while (buffer->isReady()) {
149 DPRINTF(RubyNetwork, "incoming: %d\n", incoming);
150
151 // Peek at message
152 msg_ptr = buffer->peekMsgPtr();
153 net_msg_ptr = msg_ptr.get();
154 DPRINTF(RubyNetwork, "Message: %s\n", (*net_msg_ptr));
155
156 output_links.clear();

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

171 m_link_order[out].m_link = out;
172 m_link_order[out].m_value = 0;
173 }
174 } else {
175 // Find how clogged each link is
176 for (int out = 0; out < m_out.size(); out++) {
177 int out_queue_length = 0;
178 for (int v = 0; v < m_virtual_networks; v++) {
179 out_queue_length += m_out[out][v]->getSize();
180 }
181 int value =
182 (out_queue_length << 8) |
183 random_mt.random(0, 0xff);
184 m_link_order[out].m_link = out;
185 m_link_order[out].m_value = value;
186 }
187

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

215
216 assert(msg_dsts.count() == 0);
217
218 // Check for resources - for all outgoing queues
219 bool enough = true;
220 for (int i = 0; i < output_links.size(); i++) {
221 int outgoing = output_links[i];
222
223 if (!m_out[outgoing][vnet]->areNSlotsAvailable(1))
224 enough = false;
225
226 DPRINTF(RubyNetwork, "Checking if node is blocked ..."
227 "outgoing: %d, vnet: %d, enough: %d\n",
228 outgoing, vnet, enough);
229 }
230
231 // There were not enough resources

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

246 // to create an unmodified MsgPtr because the MessageBuffer
247 // enqueue func will modify the message
248
249 // This magic line creates a private copy of the message
250 unmodified_msg_ptr = msg_ptr->clone();
251 }
252
253 // Dequeue msg
254 buffer->dequeue();
255 m_pending_message_count[vnet]--;
256
257 // Enqueue it - for all outgoing queues
258 for (int i=0; i<output_links.size(); i++) {
259 int outgoing = output_links[i];
260
261 if (i > 0) {
262 // create a private copy of the unmodified message

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

268 net_msg_ptr = msg_ptr.get();
269 net_msg_ptr->getDestination() = output_link_destinations[i];
270
271 // Enqeue msg
272 DPRINTF(RubyNetwork, "Enqueuing net msg from "
273 "inport[%d][%d] to outport [%d][%d].\n",
274 incoming, vnet, outgoing, vnet);
275
276 m_out[outgoing][vnet]->enqueue(msg_ptr);
277 }
278 }
279}
280
281void
282PerfectSwitch::wakeup()
283{
284 // Give the highest numbered link priority most of the time

--- 42 unchanged lines hidden ---