2006-03-26 00:31:20 +01:00
|
|
|
/*
|
|
|
|
* Copyright (c) 2006 The Regents of The University of Michigan
|
|
|
|
* 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;
|
|
|
|
* neither the name of the copyright holders nor the names of its
|
|
|
|
* contributors may be used to endorse or promote products derived from
|
|
|
|
* this software without specific prior written permission.
|
|
|
|
*
|
|
|
|
* 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.
|
2006-06-01 01:26:56 +02:00
|
|
|
*
|
|
|
|
* Authors: Ali Saidi
|
2006-03-26 00:31:20 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
2006-08-15 01:25:07 +02:00
|
|
|
* @file
|
|
|
|
* Definition of a bus object.
|
2006-03-26 00:31:20 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
|
2006-07-06 20:41:01 +02:00
|
|
|
#include "base/misc.hh"
|
2006-04-12 01:35:30 +02:00
|
|
|
#include "base/trace.hh"
|
|
|
|
#include "mem/bus.hh"
|
2006-03-26 00:31:20 +01:00
|
|
|
#include "sim/builder.hh"
|
|
|
|
|
2006-05-26 19:48:35 +02:00
|
|
|
Port *
|
2006-06-14 05:19:28 +02:00
|
|
|
Bus::getPort(const std::string &if_name, int idx)
|
2006-05-26 19:48:35 +02:00
|
|
|
{
|
2006-07-06 20:41:01 +02:00
|
|
|
if (if_name == "default")
|
|
|
|
if (defaultPort == NULL) {
|
|
|
|
defaultPort = new BusPort(csprintf("%s-default",name()), this,
|
|
|
|
defaultId);
|
|
|
|
return defaultPort;
|
|
|
|
} else
|
|
|
|
fatal("Default port already set\n");
|
|
|
|
|
2006-05-26 19:48:35 +02:00
|
|
|
// if_name ignored? forced to be empty?
|
|
|
|
int id = interfaces.size();
|
|
|
|
BusPort *bp = new BusPort(csprintf("%s-p%d", name(), id), this, id);
|
|
|
|
interfaces.push_back(bp);
|
|
|
|
return bp;
|
|
|
|
}
|
|
|
|
|
2006-07-06 20:41:01 +02:00
|
|
|
/** Get the ranges of anyone other buses that we are connected to. */
|
2006-04-28 21:37:48 +02:00
|
|
|
void
|
|
|
|
Bus::init()
|
|
|
|
{
|
|
|
|
std::vector<Port*>::iterator intIter;
|
2006-07-06 20:41:01 +02:00
|
|
|
|
2006-04-28 21:37:48 +02:00
|
|
|
for (intIter = interfaces.begin(); intIter != interfaces.end(); intIter++)
|
|
|
|
(*intIter)->sendStatusChange(Port::RangeChange);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-05-26 20:17:33 +02:00
|
|
|
/** Function called by the port when the bus is receiving a Timing
|
2006-03-26 00:31:20 +01:00
|
|
|
* transaction.*/
|
|
|
|
bool
|
2006-05-19 04:32:21 +02:00
|
|
|
Bus::recvTiming(Packet *pkt)
|
2006-03-26 00:31:20 +01:00
|
|
|
{
|
2006-05-16 23:36:50 +02:00
|
|
|
Port *port;
|
2006-05-26 20:17:33 +02:00
|
|
|
DPRINTF(Bus, "recvTiming: packet src %d dest %d addr 0x%x cmd %s\n",
|
|
|
|
pkt->getSrc(), pkt->getDest(), pkt->getAddr(), pkt->cmdString());
|
|
|
|
|
|
|
|
short dest = pkt->getDest();
|
2006-10-05 22:26:16 +02:00
|
|
|
//if (pkt->isRequest() && curTick < tickAddrLastUsed ||
|
|
|
|
// (pkt->isResponse() || pkt->hasData()) && curTick < tickDataLastUsed) {
|
|
|
|
//We're going to need resources that have already been committed
|
|
|
|
//Send this guy to the back of the line
|
|
|
|
//We don't need to worry about scheduling an event to deal with when the
|
|
|
|
//bus is freed because that's handled when tick*LastUsed is incremented.
|
|
|
|
// retryList.push_back(interfaces[pkt->getSrc()]);
|
|
|
|
// return false;
|
|
|
|
//}
|
|
|
|
|
2006-05-26 20:17:33 +02:00
|
|
|
if (dest == Packet::Broadcast) {
|
2006-08-22 22:08:18 +02:00
|
|
|
if ( timingSnoopPhase1(pkt) )
|
|
|
|
{
|
|
|
|
timingSnoopPhase2(pkt);
|
|
|
|
port = findPort(pkt->getAddr(), pkt->getSrc());
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
//Snoop didn't succeed
|
|
|
|
retryList.push_back(interfaces[pkt->getSrc()]);
|
|
|
|
return false;
|
|
|
|
}
|
2006-05-16 23:36:50 +02:00
|
|
|
} else {
|
2006-05-26 20:17:33 +02:00
|
|
|
assert(dest >= 0 && dest < interfaces.size());
|
|
|
|
assert(dest != pkt->getSrc()); // catch infinite loops
|
|
|
|
port = interfaces[dest];
|
2006-05-16 23:36:50 +02:00
|
|
|
}
|
2006-10-05 22:26:16 +02:00
|
|
|
|
|
|
|
|
2006-05-31 00:57:42 +02:00
|
|
|
if (port->sendTiming(pkt)) {
|
2006-10-05 22:26:16 +02:00
|
|
|
// Packet was successfully sent.
|
|
|
|
// Figure out what resources were used, and then return true.
|
|
|
|
//if (pkt->isRequest()) {
|
|
|
|
// The address bus will be used for one cycle
|
|
|
|
// while (tickAddrLastUsed <= curTick)
|
|
|
|
// tickAddrLastUsed += clock;
|
|
|
|
//}
|
|
|
|
//if (pkt->isResponse() || pkt->hasData()) {
|
|
|
|
// Use up the data bus for at least one bus cycle
|
|
|
|
// while (tickDataLastUsed <= curTick)
|
|
|
|
// tickDataLastUsed += clock;
|
|
|
|
// Use up the data bus for however many cycles remain
|
|
|
|
// if (pkt->hasData()) {
|
|
|
|
// int dataSize = pkt->getSize();
|
|
|
|
// for (int transmitted = width; transmitted < dataSize;
|
|
|
|
// transmitted += width) {
|
|
|
|
// tickDataLastUsed += clock;
|
|
|
|
// }
|
|
|
|
// }
|
|
|
|
//}
|
2006-05-31 00:57:42 +02:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// packet not successfully sent
|
|
|
|
retryList.push_back(interfaces[pkt->getSrc()]);
|
|
|
|
return false;
|
2006-03-26 00:31:20 +01:00
|
|
|
}
|
|
|
|
|
2006-05-31 00:57:42 +02:00
|
|
|
void
|
|
|
|
Bus::recvRetry(int id)
|
|
|
|
{
|
|
|
|
// Go through all the elements on the list calling sendRetry on each
|
|
|
|
// This is not very efficient at all but it works. Ultimately we should end
|
|
|
|
// up with something that is more intelligent.
|
|
|
|
int initialSize = retryList.size();
|
|
|
|
int i;
|
|
|
|
Port *p;
|
|
|
|
|
|
|
|
for (i = 0; i < initialSize; i++) {
|
|
|
|
assert(retryList.size() > 0);
|
|
|
|
p = retryList.front();
|
|
|
|
retryList.pop_front();
|
|
|
|
p->sendRetry();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2006-03-26 00:31:20 +01:00
|
|
|
Port *
|
|
|
|
Bus::findPort(Addr addr, int id)
|
|
|
|
{
|
|
|
|
/* An interval tree would be a better way to do this. --ali. */
|
|
|
|
int dest_id = -1;
|
|
|
|
int i = 0;
|
|
|
|
bool found = false;
|
2006-07-06 20:41:01 +02:00
|
|
|
AddrRangeIter iter;
|
2006-03-26 00:31:20 +01:00
|
|
|
|
|
|
|
while (i < portList.size() && !found)
|
|
|
|
{
|
|
|
|
if (portList[i].range == addr) {
|
|
|
|
dest_id = portList[i].portId;
|
|
|
|
found = true;
|
2006-08-28 18:55:13 +02:00
|
|
|
DPRINTF(Bus, " found addr %#llx on device %d\n", addr, dest_id);
|
2006-03-26 00:31:20 +01:00
|
|
|
}
|
2006-04-12 01:35:30 +02:00
|
|
|
i++;
|
2006-03-26 00:31:20 +01:00
|
|
|
}
|
2006-07-06 20:41:01 +02:00
|
|
|
|
|
|
|
// Check if this matches the default range
|
|
|
|
if (dest_id == -1) {
|
|
|
|
for (iter = defaultRange.begin(); iter != defaultRange.end(); iter++) {
|
|
|
|
if (*iter == addr) {
|
2006-08-28 18:55:13 +02:00
|
|
|
DPRINTF(Bus, " found addr %#llx on default\n", addr);
|
2006-07-06 20:41:01 +02:00
|
|
|
return defaultPort;
|
|
|
|
}
|
|
|
|
}
|
2006-08-28 18:55:13 +02:00
|
|
|
panic("Unable to find destination for addr: %#llx", addr);
|
2006-07-06 20:41:01 +02:00
|
|
|
}
|
|
|
|
|
2006-04-12 01:35:30 +02:00
|
|
|
|
2006-03-26 00:31:20 +01:00
|
|
|
// we shouldn't be sending this back to where it came from
|
|
|
|
assert(dest_id != id);
|
|
|
|
|
|
|
|
return interfaces[dest_id];
|
|
|
|
}
|
|
|
|
|
2006-08-22 22:08:18 +02:00
|
|
|
std::vector<int>
|
|
|
|
Bus::findSnoopPorts(Addr addr, int id)
|
|
|
|
{
|
|
|
|
int i = 0;
|
|
|
|
AddrRangeIter iter;
|
|
|
|
std::vector<int> ports;
|
|
|
|
|
|
|
|
while (i < portSnoopList.size())
|
|
|
|
{
|
|
|
|
if (portSnoopList[i].range == addr && portSnoopList[i].portId != id) {
|
|
|
|
//Careful to not overlap ranges
|
|
|
|
//or snoop will be called more than once on the port
|
|
|
|
ports.push_back(portSnoopList[i].portId);
|
2006-08-28 18:55:13 +02:00
|
|
|
DPRINTF(Bus, " found snoop addr %#llx on device%d\n", addr,
|
2006-08-22 22:08:18 +02:00
|
|
|
portSnoopList[i].portId);
|
|
|
|
}
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
return ports;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
Bus::atomicSnoop(Packet *pkt)
|
|
|
|
{
|
|
|
|
std::vector<int> ports = findSnoopPorts(pkt->getAddr(), pkt->getSrc());
|
|
|
|
|
|
|
|
while (!ports.empty())
|
|
|
|
{
|
|
|
|
interfaces[ports.back()]->sendAtomic(pkt);
|
|
|
|
ports.pop_back();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool
|
|
|
|
Bus::timingSnoopPhase1(Packet *pkt)
|
|
|
|
{
|
|
|
|
std::vector<int> ports = findSnoopPorts(pkt->getAddr(), pkt->getSrc());
|
|
|
|
bool success = true;
|
|
|
|
|
|
|
|
while (!ports.empty() && success)
|
|
|
|
{
|
|
|
|
snoopCallbacks.push_back(ports.back());
|
|
|
|
success = interfaces[ports.back()]->sendTiming(pkt);
|
|
|
|
ports.pop_back();
|
|
|
|
}
|
|
|
|
if (!success)
|
|
|
|
{
|
|
|
|
while (!snoopCallbacks.empty())
|
|
|
|
{
|
|
|
|
interfaces[snoopCallbacks.back()]->sendStatusChange(Port::SnoopSquash);
|
|
|
|
snoopCallbacks.pop_back();
|
|
|
|
}
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
void
|
|
|
|
Bus::timingSnoopPhase2(Packet *pkt)
|
|
|
|
{
|
|
|
|
bool success;
|
|
|
|
pkt->flags |= SNOOP_COMMIT;
|
|
|
|
while (!snoopCallbacks.empty())
|
|
|
|
{
|
|
|
|
success = interfaces[snoopCallbacks.back()]->sendTiming(pkt);
|
|
|
|
//We should not fail on snoop callbacks
|
|
|
|
assert(success);
|
|
|
|
snoopCallbacks.pop_back();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-05-26 20:17:33 +02:00
|
|
|
/** Function called by the port when the bus is receiving a Atomic
|
2006-03-26 00:31:20 +01:00
|
|
|
* transaction.*/
|
|
|
|
Tick
|
2006-05-19 04:32:21 +02:00
|
|
|
Bus::recvAtomic(Packet *pkt)
|
2006-03-26 00:31:20 +01:00
|
|
|
{
|
2006-05-26 20:17:33 +02:00
|
|
|
DPRINTF(Bus, "recvAtomic: packet src %d dest %d addr 0x%x cmd %s\n",
|
|
|
|
pkt->getSrc(), pkt->getDest(), pkt->getAddr(), pkt->cmdString());
|
|
|
|
assert(pkt->getDest() == Packet::Broadcast);
|
2006-08-22 22:08:18 +02:00
|
|
|
atomicSnoop(pkt);
|
2006-05-26 20:17:33 +02:00
|
|
|
return findPort(pkt->getAddr(), pkt->getSrc())->sendAtomic(pkt);
|
2006-03-26 00:31:20 +01:00
|
|
|
}
|
|
|
|
|
2006-05-26 20:17:33 +02:00
|
|
|
/** Function called by the port when the bus is receiving a Functional
|
2006-03-26 00:31:20 +01:00
|
|
|
* transaction.*/
|
|
|
|
void
|
2006-05-19 04:32:21 +02:00
|
|
|
Bus::recvFunctional(Packet *pkt)
|
2006-03-26 00:31:20 +01:00
|
|
|
{
|
2006-05-26 20:17:33 +02:00
|
|
|
DPRINTF(Bus, "recvFunctional: packet src %d dest %d addr 0x%x cmd %s\n",
|
|
|
|
pkt->getSrc(), pkt->getDest(), pkt->getAddr(), pkt->cmdString());
|
|
|
|
assert(pkt->getDest() == Packet::Broadcast);
|
|
|
|
findPort(pkt->getAddr(), pkt->getSrc())->sendFunctional(pkt);
|
2006-03-26 00:31:20 +01:00
|
|
|
}
|
|
|
|
|
2006-05-26 20:17:33 +02:00
|
|
|
/** Function called by the port when the bus is receiving a status change.*/
|
2006-03-26 00:31:20 +01:00
|
|
|
void
|
|
|
|
Bus::recvStatusChange(Port::Status status, int id)
|
|
|
|
{
|
2006-07-06 20:41:01 +02:00
|
|
|
AddrRangeList ranges;
|
|
|
|
AddrRangeList snoops;
|
|
|
|
int x;
|
|
|
|
AddrRangeIter iter;
|
|
|
|
|
2006-04-07 22:26:22 +02:00
|
|
|
assert(status == Port::RangeChange &&
|
2006-03-26 00:31:20 +01:00
|
|
|
"The other statuses need to be implemented.");
|
2006-04-07 22:26:22 +02:00
|
|
|
|
2006-05-26 20:24:46 +02:00
|
|
|
DPRINTF(BusAddrRanges, "received RangeChange from device id %d\n", id);
|
2006-05-26 20:17:33 +02:00
|
|
|
|
2006-07-06 20:41:01 +02:00
|
|
|
if (id == defaultId) {
|
|
|
|
defaultRange.clear();
|
|
|
|
defaultPort->getPeerAddressRanges(ranges, snoops);
|
|
|
|
assert(snoops.size() == 0);
|
|
|
|
for(iter = ranges.begin(); iter != ranges.end(); iter++) {
|
|
|
|
defaultRange.push_back(*iter);
|
2006-08-28 18:55:13 +02:00
|
|
|
DPRINTF(BusAddrRanges, "Adding range %#llx - %#llx for default range\n",
|
2006-07-06 20:41:01 +02:00
|
|
|
iter->start, iter->end);
|
|
|
|
}
|
|
|
|
} else {
|
2006-04-20 23:14:30 +02:00
|
|
|
|
2006-07-06 20:41:01 +02:00
|
|
|
assert((id < interfaces.size() && id >= 0) || id == -1);
|
|
|
|
Port *port = interfaces[id];
|
|
|
|
std::vector<DevMap>::iterator portIter;
|
2006-08-22 22:08:18 +02:00
|
|
|
std::vector<DevMap>::iterator snoopIter;
|
2006-07-06 20:41:01 +02:00
|
|
|
|
|
|
|
// Clean out any previously existent ids
|
|
|
|
for (portIter = portList.begin(); portIter != portList.end(); ) {
|
|
|
|
if (portIter->portId == id)
|
|
|
|
portIter = portList.erase(portIter);
|
|
|
|
else
|
|
|
|
portIter++;
|
|
|
|
}
|
2006-04-06 06:51:46 +02:00
|
|
|
|
2006-08-22 22:08:18 +02:00
|
|
|
for (snoopIter = portSnoopList.begin(); snoopIter != portSnoopList.end(); ) {
|
|
|
|
if (snoopIter->portId == id)
|
|
|
|
snoopIter = portSnoopList.erase(snoopIter);
|
|
|
|
else
|
|
|
|
snoopIter++;
|
|
|
|
}
|
|
|
|
|
2006-07-06 20:41:01 +02:00
|
|
|
port->getPeerAddressRanges(ranges, snoops);
|
2006-03-26 00:31:20 +01:00
|
|
|
|
2006-08-22 22:08:18 +02:00
|
|
|
for(iter = snoops.begin(); iter != snoops.end(); iter++) {
|
|
|
|
DevMap dm;
|
|
|
|
dm.portId = id;
|
|
|
|
dm.range = *iter;
|
|
|
|
|
2006-08-28 18:55:13 +02:00
|
|
|
DPRINTF(BusAddrRanges, "Adding snoop range %#llx - %#llx for id %d\n",
|
2006-08-22 22:08:18 +02:00
|
|
|
dm.range.start, dm.range.end, id);
|
|
|
|
portSnoopList.push_back(dm);
|
|
|
|
}
|
|
|
|
|
2006-07-06 20:41:01 +02:00
|
|
|
for(iter = ranges.begin(); iter != ranges.end(); iter++) {
|
|
|
|
DevMap dm;
|
|
|
|
dm.portId = id;
|
|
|
|
dm.range = *iter;
|
2006-04-20 23:14:30 +02:00
|
|
|
|
2006-08-28 18:55:13 +02:00
|
|
|
DPRINTF(BusAddrRanges, "Adding range %#llx - %#llx for id %d\n",
|
2006-07-06 20:41:01 +02:00
|
|
|
dm.range.start, dm.range.end, id);
|
|
|
|
portList.push_back(dm);
|
|
|
|
}
|
2006-04-20 23:14:30 +02:00
|
|
|
}
|
2006-04-12 01:35:30 +02:00
|
|
|
DPRINTF(MMU, "port list has %d entries\n", portList.size());
|
2006-04-28 21:37:48 +02:00
|
|
|
|
|
|
|
// tell all our peers that our address range has changed.
|
|
|
|
// Don't tell the device that caused this change, it already knows
|
|
|
|
for (x = 0; x < interfaces.size(); x++)
|
|
|
|
if (x != id)
|
|
|
|
interfaces[x]->sendStatusChange(Port::RangeChange);
|
2006-07-06 20:41:01 +02:00
|
|
|
|
|
|
|
if (id != defaultId && defaultPort)
|
|
|
|
defaultPort->sendStatusChange(Port::RangeChange);
|
2006-03-26 00:31:20 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
void
|
2006-04-28 21:37:48 +02:00
|
|
|
Bus::addressRanges(AddrRangeList &resp, AddrRangeList &snoop, int id)
|
2006-03-26 00:31:20 +01:00
|
|
|
{
|
2006-04-28 21:37:48 +02:00
|
|
|
std::vector<DevMap>::iterator portIter;
|
2006-07-06 20:41:01 +02:00
|
|
|
AddrRangeIter dflt_iter;
|
|
|
|
bool subset;
|
2006-04-28 21:37:48 +02:00
|
|
|
|
|
|
|
resp.clear();
|
|
|
|
snoop.clear();
|
|
|
|
|
2006-05-26 20:24:46 +02:00
|
|
|
DPRINTF(BusAddrRanges, "received address range request, returning:\n");
|
2006-07-06 20:41:01 +02:00
|
|
|
|
|
|
|
for (dflt_iter = defaultRange.begin(); dflt_iter != defaultRange.end();
|
|
|
|
dflt_iter++) {
|
|
|
|
resp.push_back(*dflt_iter);
|
2006-08-28 18:55:13 +02:00
|
|
|
DPRINTF(BusAddrRanges, " -- %#llx : %#llx\n",dflt_iter->start,
|
2006-07-06 20:41:01 +02:00
|
|
|
dflt_iter->end);
|
|
|
|
}
|
2006-04-28 21:37:48 +02:00
|
|
|
for (portIter = portList.begin(); portIter != portList.end(); portIter++) {
|
2006-07-06 20:41:01 +02:00
|
|
|
subset = false;
|
|
|
|
for (dflt_iter = defaultRange.begin(); dflt_iter != defaultRange.end();
|
|
|
|
dflt_iter++) {
|
|
|
|
if ((portIter->range.start < dflt_iter->start &&
|
|
|
|
portIter->range.end >= dflt_iter->start) ||
|
|
|
|
(portIter->range.start < dflt_iter->end &&
|
|
|
|
portIter->range.end >= dflt_iter->end))
|
|
|
|
fatal("Devices can not set ranges that itersect the default set\
|
|
|
|
but are not a subset of the default set.\n");
|
|
|
|
if (portIter->range.start >= dflt_iter->start &&
|
|
|
|
portIter->range.end <= dflt_iter->end) {
|
|
|
|
subset = true;
|
2006-08-28 18:55:13 +02:00
|
|
|
DPRINTF(BusAddrRanges, " -- %#llx : %#llx is a SUBSET\n",
|
2006-07-06 20:41:01 +02:00
|
|
|
portIter->range.start, portIter->range.end);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if (portIter->portId != id && !subset) {
|
2006-04-28 21:37:48 +02:00
|
|
|
resp.push_back(portIter->range);
|
2006-08-28 18:55:13 +02:00
|
|
|
DPRINTF(BusAddrRanges, " -- %#llx : %#llx\n",
|
2006-05-26 20:17:33 +02:00
|
|
|
portIter->range.start, portIter->range.end);
|
2006-04-28 21:37:48 +02:00
|
|
|
}
|
|
|
|
}
|
2006-03-26 00:31:20 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
BEGIN_DECLARE_SIM_OBJECT_PARAMS(Bus)
|
|
|
|
|
|
|
|
Param<int> bus_id;
|
2006-10-05 22:26:16 +02:00
|
|
|
Param<int> clock;
|
|
|
|
Param<int> width;
|
2006-03-26 00:31:20 +01:00
|
|
|
|
|
|
|
END_DECLARE_SIM_OBJECT_PARAMS(Bus)
|
|
|
|
|
|
|
|
BEGIN_INIT_SIM_OBJECT_PARAMS(Bus)
|
2006-10-05 22:26:16 +02:00
|
|
|
INIT_PARAM(bus_id, "a globally unique bus id"),
|
|
|
|
INIT_PARAM(clock, "bus clock speed"),
|
|
|
|
INIT_PARAM(width, "width of the bus (bits)")
|
2006-04-28 21:37:48 +02:00
|
|
|
END_INIT_SIM_OBJECT_PARAMS(Bus)
|
2006-03-26 00:31:20 +01:00
|
|
|
|
|
|
|
CREATE_SIM_OBJECT(Bus)
|
|
|
|
{
|
2006-10-05 22:26:16 +02:00
|
|
|
return new Bus(getInstanceName(), bus_id, clock, width);
|
2006-03-26 00:31:20 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
REGISTER_SIM_OBJECT("Bus", Bus)
|