More DPRINTF cleanup.
[gem5.git] / src / mem / bus.cc
1 /*
2 * Copyright (c) 2006 The Regents of The University of Michigan
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 * Authors: Ali Saidi
29 */
30
31 /**
32 * @file
33 * Definition of a bus object.
34 */
35
36
37 #include "base/misc.hh"
38 #include "base/trace.hh"
39 #include "mem/bus.hh"
40 #include "sim/builder.hh"
41
42 Port *
43 Bus::getPort(const std::string &if_name, int idx)
44 {
45 if (if_name == "default") {
46 if (defaultPort == NULL) {
47 defaultPort = new BusPort(csprintf("%s-default",name()), this,
48 defaultId);
49 return defaultPort;
50 } else
51 fatal("Default port already set\n");
52 }
53
54 // if_name ignored? forced to be empty?
55 int id = interfaces.size();
56 BusPort *bp = new BusPort(csprintf("%s-p%d", name(), id), this, id);
57 interfaces.push_back(bp);
58 return bp;
59 }
60
61 /** Get the ranges of anyone other buses that we are connected to. */
62 void
63 Bus::init()
64 {
65 std::vector<BusPort*>::iterator intIter;
66
67 for (intIter = interfaces.begin(); intIter != interfaces.end(); intIter++)
68 (*intIter)->sendStatusChange(Port::RangeChange);
69 }
70
71 Bus::BusFreeEvent::BusFreeEvent(Bus *_bus) : Event(&mainEventQueue), bus(_bus)
72 {}
73
74 void Bus::BusFreeEvent::process()
75 {
76 bus->recvRetry(-1);
77 }
78
79 const char * Bus::BusFreeEvent::description()
80 {
81 return "bus became available";
82 }
83
84 void Bus::occupyBus(PacketPtr pkt)
85 {
86 //Bring tickNextIdle up to the present tick
87 //There is some potential ambiguity where a cycle starts, which might make
88 //a difference when devices are acting right around a cycle boundary. Using
89 //a < allows things which happen exactly on a cycle boundary to take up only
90 //the following cycle. Anthing that happens later will have to "wait" for
91 //the end of that cycle, and then start using the bus after that.
92 while (tickNextIdle < curTick)
93 tickNextIdle += clock;
94
95 // The packet will be sent. Figure out how long it occupies the bus, and
96 // how much of that time is for the first "word", aka bus width.
97 int numCycles = 0;
98 // Requests need one cycle to send an address
99 if (pkt->isRequest())
100 numCycles++;
101 else if (pkt->isResponse() || pkt->hasData()) {
102 // If a packet has data, it needs ceil(size/width) cycles to send it
103 // We're using the "adding instead of dividing" trick again here
104 if (pkt->hasData()) {
105 int dataSize = pkt->getSize();
106 for (int transmitted = 0; transmitted < dataSize;
107 transmitted += width) {
108 numCycles++;
109 }
110 } else {
111 // If the packet didn't have data, it must have been a response.
112 // Those use the bus for one cycle to send their data.
113 numCycles++;
114 }
115 }
116
117 // The first word will be delivered after the current tick, the delivery
118 // of the address if any, and one bus cycle to deliver the data
119 pkt->firstWordTime =
120 tickNextIdle +
121 pkt->isRequest() ? clock : 0 +
122 clock;
123
124 //Advance it numCycles bus cycles.
125 //XXX Should this use the repeated addition trick as well?
126 tickNextIdle += (numCycles * clock);
127 if (!busIdle.scheduled()) {
128 busIdle.schedule(tickNextIdle);
129 } else {
130 busIdle.reschedule(tickNextIdle);
131 }
132 DPRINTF(Bus, "The bus is now occupied from tick %d to %d\n",
133 curTick, tickNextIdle);
134
135 // The bus will become idle once the current packet is delivered.
136 pkt->finishTime = tickNextIdle;
137 }
138
139 /** Function called by the port when the bus is receiving a Timing
140 * transaction.*/
141 bool
142 Bus::recvTiming(PacketPtr pkt)
143 {
144 Port *port;
145 DPRINTF(Bus, "recvTiming: packet src %d dest %d addr 0x%x cmd %s\n",
146 pkt->getSrc(), pkt->getDest(), pkt->getAddr(), pkt->cmdString());
147
148 BusPort *pktPort;
149 if (pkt->getSrc() == defaultId)
150 pktPort = defaultPort;
151 else pktPort = interfaces[pkt->getSrc()];
152
153 // If the bus is busy, or other devices are in line ahead of the current
154 // one, put this device on the retry list.
155 if (tickNextIdle > curTick ||
156 (retryList.size() && (!inRetry || pktPort != retryList.front()))) {
157 addToRetryList(pktPort);
158 return false;
159 }
160
161 short dest = pkt->getDest();
162 if (dest == Packet::Broadcast) {
163 port = findPort(pkt->getAddr(), pkt->getSrc());
164 if (timingSnoop(pkt, port ? port : interfaces[pkt->getSrc()])) {
165 bool success;
166
167 pkt->flags |= SNOOP_COMMIT;
168 success = timingSnoop(pkt, port ? port : interfaces[pkt->getSrc()]);
169 assert(success);
170
171 if (pkt->flags & SATISFIED) {
172 //Cache-Cache transfer occuring
173 if (inRetry) {
174 retryList.front()->onRetryList(false);
175 retryList.pop_front();
176 inRetry = false;
177 }
178 occupyBus(pkt);
179 return true;
180 }
181 } else {
182 //Snoop didn't succeed
183 DPRINTF(Bus, "Adding a retry to RETRY list %d\n",
184 pktPort->getId());
185 addToRetryList(pktPort);
186 return false;
187 }
188 } else {
189 assert(dest >= 0 && dest < interfaces.size());
190 assert(dest != pkt->getSrc()); // catch infinite loops
191 port = interfaces[dest];
192 }
193
194 occupyBus(pkt);
195
196 if (port) {
197 if (port->sendTiming(pkt)) {
198 // Packet was successfully sent. Return true.
199 // Also take care of retries
200 if (inRetry) {
201 DPRINTF(Bus, "Remove retry from list %d\n",
202 retryList.front()->getId());
203 retryList.front()->onRetryList(false);
204 retryList.pop_front();
205 inRetry = false;
206 }
207 return true;
208 }
209
210 // Packet not successfully sent. Leave or put it on the retry list.
211 DPRINTF(Bus, "Adding a retry to RETRY list %d\n",
212 pktPort->getId());
213 addToRetryList(pktPort);
214 return false;
215 }
216 else {
217 //Forwarding up from responder, just return true;
218 return true;
219 }
220 }
221
222 void
223 Bus::recvRetry(int id)
224 {
225 DPRINTF(Bus, "Received a retry\n");
226 // If there's anything waiting, and the bus isn't busy...
227 if (retryList.size() && curTick >= tickNextIdle) {
228 //retryingPort = retryList.front();
229 inRetry = true;
230 DPRINTF(Bus, "Sending a retry\n");
231 retryList.front()->sendRetry();
232 // If inRetry is still true, sendTiming wasn't called
233 if (inRetry)
234 {
235 retryList.front()->onRetryList(false);
236 retryList.pop_front();
237 inRetry = false;
238
239 //Bring tickNextIdle up to the present
240 while (tickNextIdle < curTick)
241 tickNextIdle += clock;
242
243 //Burn a cycle for the missed grant.
244 tickNextIdle += clock;
245
246 if (!busIdle.scheduled()) {
247 busIdle.schedule(tickNextIdle);
248 } else {
249 busIdle.reschedule(tickNextIdle);
250 }
251 }
252 }
253 //If we weren't able to drain before, we might be able to now.
254 if (drainEvent && retryList.size() == 0 && curTick >= tickNextIdle) {
255 drainEvent->process();
256 // Clear the drain event once we're done with it.
257 drainEvent = NULL;
258 }
259 }
260
261 Port *
262 Bus::findPort(Addr addr, int id)
263 {
264 /* An interval tree would be a better way to do this. --ali. */
265 int dest_id = -1;
266 AddrRangeIter iter;
267 range_map<Addr,int>::iterator i;
268
269 i = portMap.find(RangeSize(addr,1));
270 if (i != portMap.end())
271 dest_id = i->second;
272
273 // Check if this matches the default range
274 if (dest_id == -1) {
275 for (iter = defaultRange.begin(); iter != defaultRange.end(); iter++) {
276 if (*iter == addr) {
277 DPRINTF(Bus, " found addr %#llx on default\n", addr);
278 return defaultPort;
279 }
280 }
281
282 if (responderSet) {
283 panic("Unable to find destination for addr (user set default "
284 "responder): %#llx", addr);
285 } else {
286 DPRINTF(Bus, "Unable to find destination for addr: %#llx, will use "
287 "default port", addr);
288
289 return defaultPort;
290 }
291 }
292
293
294 // we shouldn't be sending this back to where it came from
295 // do the snoop access and then we should terminate
296 // the cyclical call.
297 if (dest_id == id)
298 return 0;
299
300 return interfaces[dest_id];
301 }
302
303 std::vector<int>
304 Bus::findSnoopPorts(Addr addr, int id)
305 {
306 int i = 0;
307 AddrRangeIter iter;
308 std::vector<int> ports;
309
310 while (i < portSnoopList.size())
311 {
312 if (portSnoopList[i].range == addr && portSnoopList[i].portId != id) {
313 //Careful to not overlap ranges
314 //or snoop will be called more than once on the port
315
316 //@todo Fix this hack because ranges are overlapping
317 //need to make sure we dont't create overlapping ranges
318 bool hack_overlap = false;
319 int size = ports.size();
320 for (int j=0; j < size; j++) {
321 if (ports[j] == portSnoopList[i].portId)
322 hack_overlap = true;
323 }
324
325 if (!hack_overlap)
326 ports.push_back(portSnoopList[i].portId);
327 // DPRINTF(Bus, " found snoop addr %#llx on device%d\n", addr,
328 // portSnoopList[i].portId);
329 }
330 i++;
331 }
332 return ports;
333 }
334
335 Tick
336 Bus::atomicSnoop(PacketPtr pkt, Port *responder)
337 {
338 std::vector<int> ports = findSnoopPorts(pkt->getAddr(), pkt->getSrc());
339 Tick response_time = 0;
340
341 while (!ports.empty())
342 {
343 if (interfaces[ports.back()] != responder) {
344 Tick response = interfaces[ports.back()]->sendAtomic(pkt);
345 if (response) {
346 assert(!response_time); //Multiple responders
347 response_time = response;
348 }
349 }
350 ports.pop_back();
351 }
352 return response_time;
353 }
354
355 void
356 Bus::functionalSnoop(PacketPtr pkt, Port *responder)
357 {
358 std::vector<int> ports = findSnoopPorts(pkt->getAddr(), pkt->getSrc());
359
360 //The packet may be changed by another bus on snoops, restore the id after each
361 int id = pkt->getSrc();
362 while (!ports.empty() && pkt->result != Packet::Success)
363 {
364 if (interfaces[ports.back()] != responder)
365 interfaces[ports.back()]->sendFunctional(pkt);
366 ports.pop_back();
367 pkt->setSrc(id);
368 }
369 }
370
371 bool
372 Bus::timingSnoop(PacketPtr pkt, Port* responder)
373 {
374 std::vector<int> ports = findSnoopPorts(pkt->getAddr(), pkt->getSrc());
375 bool success = true;
376
377 while (!ports.empty() && success)
378 {
379 if (interfaces[ports.back()] != responder) //Don't call if responder also, once will do
380 success = interfaces[ports.back()]->sendTiming(pkt);
381 ports.pop_back();
382 }
383
384 return success;
385 }
386
387
388 /** Function called by the port when the bus is receiving a Atomic
389 * transaction.*/
390 Tick
391 Bus::recvAtomic(PacketPtr pkt)
392 {
393 DPRINTF(Bus, "recvAtomic: packet src %d dest %d addr 0x%x cmd %s\n",
394 pkt->getSrc(), pkt->getDest(), pkt->getAddr(), pkt->cmdString());
395 assert(pkt->getDest() == Packet::Broadcast);
396 pkt->flags |= SNOOP_COMMIT;
397
398 // Assume one bus cycle in order to get through. This may have
399 // some clock skew issues yet again...
400 pkt->finishTime = curTick + clock;
401
402 Port *port = findPort(pkt->getAddr(), pkt->getSrc());
403 Tick snoopTime = atomicSnoop(pkt, port ? port : interfaces[pkt->getSrc()]);
404
405 if (snoopTime)
406 return snoopTime; //Snoop satisfies it
407 else if (port)
408 return port->sendAtomic(pkt);
409 else
410 return 0;
411 }
412
413 /** Function called by the port when the bus is receiving a Functional
414 * transaction.*/
415 void
416 Bus::recvFunctional(PacketPtr pkt)
417 {
418 DPRINTF(Bus, "recvFunctional: packet src %d dest %d addr 0x%x cmd %s\n",
419 pkt->getSrc(), pkt->getDest(), pkt->getAddr(), pkt->cmdString());
420 assert(pkt->getDest() == Packet::Broadcast);
421 pkt->flags |= SNOOP_COMMIT;
422
423 Port* port = findPort(pkt->getAddr(), pkt->getSrc());
424 functionalSnoop(pkt, port ? port : interfaces[pkt->getSrc()]);
425
426 // If the snooping found what we were looking for, we're done.
427 if (pkt->result != Packet::Success && port) {
428 port->sendFunctional(pkt);
429 }
430 }
431
432 /** Function called by the port when the bus is receiving a status change.*/
433 void
434 Bus::recvStatusChange(Port::Status status, int id)
435 {
436 AddrRangeList ranges;
437 AddrRangeList snoops;
438 int x;
439 AddrRangeIter iter;
440
441 assert(status == Port::RangeChange &&
442 "The other statuses need to be implemented.");
443
444 DPRINTF(BusAddrRanges, "received RangeChange from device id %d\n", id);
445
446 if (id == defaultId) {
447 defaultRange.clear();
448 // Only try to update these ranges if the user set a default responder.
449 if (responderSet) {
450 defaultPort->getPeerAddressRanges(ranges, snoops);
451 assert(snoops.size() == 0);
452 for(iter = ranges.begin(); iter != ranges.end(); iter++) {
453 defaultRange.push_back(*iter);
454 DPRINTF(BusAddrRanges, "Adding range %#llx - %#llx for default range\n",
455 iter->start, iter->end);
456 }
457 }
458 } else {
459
460 assert((id < interfaces.size() && id >= 0) || id == defaultId);
461 Port *port = interfaces[id];
462 range_map<Addr,int>::iterator portIter;
463 std::vector<DevMap>::iterator snoopIter;
464
465 // Clean out any previously existent ids
466 for (portIter = portMap.begin(); portIter != portMap.end(); ) {
467 if (portIter->second == id)
468 portMap.erase(portIter++);
469 else
470 portIter++;
471 }
472
473 for (snoopIter = portSnoopList.begin(); snoopIter != portSnoopList.end(); ) {
474 if (snoopIter->portId == id)
475 snoopIter = portSnoopList.erase(snoopIter);
476 else
477 snoopIter++;
478 }
479
480 port->getPeerAddressRanges(ranges, snoops);
481
482 for(iter = snoops.begin(); iter != snoops.end(); iter++) {
483 DevMap dm;
484 dm.portId = id;
485 dm.range = *iter;
486
487 //@todo, make sure we don't overlap ranges
488 DPRINTF(BusAddrRanges, "Adding snoop range %#llx - %#llx for id %d\n",
489 dm.range.start, dm.range.end, id);
490 portSnoopList.push_back(dm);
491 }
492
493 for(iter = ranges.begin(); iter != ranges.end(); iter++) {
494 DPRINTF(BusAddrRanges, "Adding range %#llx - %#llx for id %d\n",
495 iter->start, iter->end, id);
496 if (portMap.insert(*iter, id) == portMap.end())
497 panic("Two devices with same range\n");
498
499 }
500 }
501 DPRINTF(MMU, "port list has %d entries\n", portMap.size());
502
503 // tell all our peers that our address range has changed.
504 // Don't tell the device that caused this change, it already knows
505 for (x = 0; x < interfaces.size(); x++)
506 if (x != id)
507 interfaces[x]->sendStatusChange(Port::RangeChange);
508
509 if (id != defaultId && defaultPort)
510 defaultPort->sendStatusChange(Port::RangeChange);
511 }
512
513 void
514 Bus::addressRanges(AddrRangeList &resp, AddrRangeList &snoop, int id)
515 {
516 std::vector<DevMap>::iterator snoopIter;
517 range_map<Addr,int>::iterator portIter;
518 AddrRangeIter dflt_iter;
519 bool subset;
520
521 resp.clear();
522 snoop.clear();
523
524 DPRINTF(BusAddrRanges, "received address range request, returning:\n");
525
526 for (dflt_iter = defaultRange.begin(); dflt_iter != defaultRange.end();
527 dflt_iter++) {
528 resp.push_back(*dflt_iter);
529 DPRINTF(BusAddrRanges, " -- Dflt: %#llx : %#llx\n",dflt_iter->start,
530 dflt_iter->end);
531 }
532 for (portIter = portMap.begin(); portIter != portMap.end(); portIter++) {
533 subset = false;
534 for (dflt_iter = defaultRange.begin(); dflt_iter != defaultRange.end();
535 dflt_iter++) {
536 if ((portIter->first.start < dflt_iter->start &&
537 portIter->first.end >= dflt_iter->start) ||
538 (portIter->first.start < dflt_iter->end &&
539 portIter->first.end >= dflt_iter->end))
540 fatal("Devices can not set ranges that itersect the default set\
541 but are not a subset of the default set.\n");
542 if (portIter->first.start >= dflt_iter->start &&
543 portIter->first.end <= dflt_iter->end) {
544 subset = true;
545 DPRINTF(BusAddrRanges, " -- %#llx : %#llx is a SUBSET\n",
546 portIter->first.start, portIter->first.end);
547 }
548 }
549 if (portIter->second != id && !subset) {
550 resp.push_back(portIter->first);
551 DPRINTF(BusAddrRanges, " -- %#llx : %#llx\n",
552 portIter->first.start, portIter->first.end);
553 }
554 }
555
556 for (snoopIter = portSnoopList.begin();
557 snoopIter != portSnoopList.end(); snoopIter++)
558 {
559 if (snoopIter->portId != id) {
560 snoop.push_back(snoopIter->range);
561 DPRINTF(BusAddrRanges, " -- Snoop: %#llx : %#llx\n",
562 snoopIter->range.start, snoopIter->range.end);
563 //@todo We need to properly insert snoop ranges
564 //not overlapping the ranges (multiple)
565 }
566 }
567 }
568
569 unsigned int
570 Bus::drain(Event * de)
571 {
572 //We should check that we're not "doing" anything, and that noone is
573 //waiting. We might be idle but have someone waiting if the device we
574 //contacted for a retry didn't actually retry.
575 if (curTick >= tickNextIdle && retryList.size() == 0) {
576 return 0;
577 } else {
578 drainEvent = de;
579 return 1;
580 }
581 }
582
583 BEGIN_DECLARE_SIM_OBJECT_PARAMS(Bus)
584
585 Param<int> bus_id;
586 Param<int> clock;
587 Param<int> width;
588 Param<bool> responder_set;
589
590 END_DECLARE_SIM_OBJECT_PARAMS(Bus)
591
592 BEGIN_INIT_SIM_OBJECT_PARAMS(Bus)
593 INIT_PARAM(bus_id, "a globally unique bus id"),
594 INIT_PARAM(clock, "bus clock speed"),
595 INIT_PARAM(width, "width of the bus (bits)"),
596 INIT_PARAM(responder_set, "Is a default responder set by the user")
597 END_INIT_SIM_OBJECT_PARAMS(Bus)
598
599 CREATE_SIM_OBJECT(Bus)
600 {
601 return new Bus(getInstanceName(), bus_id, clock, width, responder_set);
602 }
603
604 REGISTER_SIM_OBJECT("Bus", Bus)