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()
|
|
|
|
{
|
2006-10-11 04:10:08 +02:00
|
|
|
std::vector<BusPort*>::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-10-08 20:08:58 +02:00
|
|
|
Bus::BusFreeEvent::BusFreeEvent(Bus *_bus) : Event(&mainEventQueue), bus(_bus)
|
2006-10-10 23:24:03 +02:00
|
|
|
{}
|
2006-10-08 20:08:58 +02:00
|
|
|
|
|
|
|
void Bus::BusFreeEvent::process()
|
|
|
|
{
|
2006-10-10 23:24:03 +02:00
|
|
|
bus->recvRetry(-1);
|
2006-10-08 20:08:58 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
const char * Bus::BusFreeEvent::description()
|
|
|
|
{
|
|
|
|
return "bus became available";
|
|
|
|
}
|
|
|
|
|
2006-10-11 05:28:33 +02:00
|
|
|
void Bus::occupyBus(PacketPtr pkt)
|
2006-03-26 00:31:20 +01:00
|
|
|
{
|
2006-10-10 05:24:21 +02:00
|
|
|
//Bring tickNextIdle up to the present tick
|
|
|
|
//There is some potential ambiguity where a cycle starts, which might make
|
|
|
|
//a difference when devices are acting right around a cycle boundary. Using
|
|
|
|
//a < allows things which happen exactly on a cycle boundary to take up only
|
|
|
|
//the following cycle. Anthing that happens later will have to "wait" for
|
|
|
|
//the end of that cycle, and then start using the bus after that.
|
|
|
|
while (tickNextIdle < curTick)
|
|
|
|
tickNextIdle += clock;
|
|
|
|
|
|
|
|
// The packet will be sent. Figure out how long it occupies the bus, and
|
|
|
|
// how much of that time is for the first "word", aka bus width.
|
2006-10-10 00:12:45 +02:00
|
|
|
int numCycles = 0;
|
|
|
|
// Requests need one cycle to send an address
|
|
|
|
if (pkt->isRequest())
|
|
|
|
numCycles++;
|
|
|
|
else if (pkt->isResponse() || pkt->hasData()) {
|
|
|
|
// If a packet has data, it needs ceil(size/width) cycles to send it
|
|
|
|
// We're using the "adding instead of dividing" trick again here
|
|
|
|
if (pkt->hasData()) {
|
|
|
|
int dataSize = pkt->getSize();
|
|
|
|
for (int transmitted = 0; transmitted < dataSize;
|
|
|
|
transmitted += width) {
|
|
|
|
numCycles++;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// If the packet didn't have data, it must have been a response.
|
|
|
|
// Those use the bus for one cycle to send their data.
|
|
|
|
numCycles++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-10-10 05:24:21 +02:00
|
|
|
// The first word will be delivered after the current tick, the delivery
|
|
|
|
// of the address if any, and one bus cycle to deliver the data
|
|
|
|
pkt->firstWordTime =
|
|
|
|
tickNextIdle +
|
|
|
|
pkt->isRequest() ? clock : 0 +
|
|
|
|
clock;
|
|
|
|
|
|
|
|
//Advance it numCycles bus cycles.
|
|
|
|
//XXX Should this use the repeated addition trick as well?
|
|
|
|
tickNextIdle += (numCycles * clock);
|
|
|
|
if (!busIdle.scheduled()) {
|
|
|
|
busIdle.schedule(tickNextIdle);
|
|
|
|
} else {
|
|
|
|
busIdle.reschedule(tickNextIdle);
|
|
|
|
}
|
|
|
|
DPRINTF(Bus, "The bus is now occupied from tick %d to %d\n",
|
|
|
|
curTick, tickNextIdle);
|
|
|
|
|
|
|
|
// The bus will become idle once the current packet is delivered.
|
|
|
|
pkt->finishTime = tickNextIdle;
|
2006-10-11 05:28:33 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
/** Function called by the port when the bus is receiving a Timing
|
|
|
|
* transaction.*/
|
|
|
|
bool
|
|
|
|
Bus::recvTiming(Packet *pkt)
|
|
|
|
{
|
|
|
|
Port *port;
|
|
|
|
DPRINTF(Bus, "recvTiming: packet src %d dest %d addr 0x%x cmd %s\n",
|
|
|
|
pkt->getSrc(), pkt->getDest(), pkt->getAddr(), pkt->cmdString());
|
|
|
|
|
|
|
|
BusPort *pktPort = interfaces[pkt->getSrc()];
|
|
|
|
|
|
|
|
// If the bus is busy, or other devices are in line ahead of the current
|
|
|
|
// one, put this device on the retry list.
|
|
|
|
if (tickNextIdle > curTick ||
|
|
|
|
(retryList.size() && (!inRetry || pktPort != retryList.front()))) {
|
|
|
|
addToRetryList(pktPort);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
short dest = pkt->getDest();
|
|
|
|
if (dest == Packet::Broadcast) {
|
|
|
|
if (timingSnoop(pkt)) {
|
|
|
|
pkt->flags |= SNOOP_COMMIT;
|
|
|
|
bool success = timingSnoop(pkt);
|
|
|
|
assert(success);
|
|
|
|
if (pkt->flags & SATISFIED) {
|
|
|
|
//Cache-Cache transfer occuring
|
|
|
|
if (inRetry) {
|
|
|
|
retryList.front()->onRetryList(false);
|
|
|
|
retryList.pop_front();
|
|
|
|
inRetry = false;
|
|
|
|
}
|
|
|
|
occupyBus(pkt);
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
port = findPort(pkt->getAddr(), pkt->getSrc());
|
|
|
|
} else {
|
|
|
|
//Snoop didn't succeed
|
|
|
|
addToRetryList(pktPort);
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
assert(dest >= 0 && dest < interfaces.size());
|
|
|
|
assert(dest != pkt->getSrc()); // catch infinite loops
|
|
|
|
port = interfaces[dest];
|
|
|
|
}
|
|
|
|
|
|
|
|
occupyBus(pkt);
|
2006-10-10 00:12:45 +02:00
|
|
|
|
2006-05-31 00:57:42 +02:00
|
|
|
if (port->sendTiming(pkt)) {
|
2006-10-08 20:08:58 +02:00
|
|
|
// Packet was successfully sent. Return true.
|
2006-10-09 00:44:49 +02:00
|
|
|
// Also take care of retries
|
2006-10-10 23:24:03 +02:00
|
|
|
if (inRetry) {
|
2006-10-11 04:50:36 +02:00
|
|
|
DPRINTF(Bus, "Remove retry from list %i\n", retryList.front());
|
2006-10-11 04:10:08 +02:00
|
|
|
retryList.front()->onRetryList(false);
|
2006-10-09 00:44:49 +02:00
|
|
|
retryList.pop_front();
|
2006-10-10 23:24:03 +02:00
|
|
|
inRetry = false;
|
2006-10-09 00:44:49 +02:00
|
|
|
}
|
2006-05-31 00:57:42 +02:00
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2006-10-08 20:08:58 +02:00
|
|
|
// Packet not successfully sent. Leave or put it on the retry list.
|
2006-10-11 04:50:36 +02:00
|
|
|
DPRINTF(Bus, "Adding a retry to RETRY list %i\n", pktPort);
|
2006-10-08 20:08:58 +02:00
|
|
|
addToRetryList(pktPort);
|
2006-05-31 00:57:42 +02:00
|
|
|
return false;
|
2006-03-26 00:31:20 +01:00
|
|
|
}
|
|
|
|
|
2006-05-31 00:57:42 +02:00
|
|
|
void
|
|
|
|
Bus::recvRetry(int id)
|
|
|
|
{
|
2006-10-11 04:50:36 +02:00
|
|
|
DPRINTF(Bus, "Received a retry\n");
|
2006-10-11 06:54:47 +02:00
|
|
|
// If there's anything waiting, and the bus isn't busy...
|
|
|
|
if (retryList.size() && curTick >= tickNextIdle) {
|
2006-10-10 23:24:03 +02:00
|
|
|
//retryingPort = retryList.front();
|
|
|
|
inRetry = true;
|
2006-10-11 04:50:36 +02:00
|
|
|
DPRINTF(Bus, "Sending a retry\n");
|
2006-10-10 23:24:03 +02:00
|
|
|
retryList.front()->sendRetry();
|
|
|
|
// If inRetry is still true, sendTiming wasn't called
|
|
|
|
if (inRetry)
|
2006-10-11 06:26:21 +02:00
|
|
|
{
|
|
|
|
retryList.front()->onRetryList(false);
|
|
|
|
retryList.pop_front();
|
|
|
|
inRetry = false;
|
|
|
|
|
|
|
|
//Bring tickNextIdle up to the present
|
|
|
|
while (tickNextIdle < curTick)
|
|
|
|
tickNextIdle += clock;
|
|
|
|
|
|
|
|
//Burn a cycle for the missed grant.
|
|
|
|
tickNextIdle += clock;
|
|
|
|
|
|
|
|
if (!busIdle.scheduled()) {
|
|
|
|
busIdle.schedule(tickNextIdle);
|
|
|
|
} else {
|
|
|
|
busIdle.reschedule(tickNextIdle);
|
|
|
|
}
|
|
|
|
}
|
2006-05-31 00:57:42 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
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-10-11 04:50:36 +02:00
|
|
|
// DPRINTF(Bus, " found snoop addr %#llx on device%d\n", addr,
|
|
|
|
// portSnoopList[i].portId);
|
2006-08-22 22:08:18 +02:00
|
|
|
}
|
|
|
|
i++;
|
|
|
|
}
|
|
|
|
return ports;
|
|
|
|
}
|
|
|
|
|
2006-10-12 00:28:33 +02:00
|
|
|
Tick
|
2006-08-22 22:08:18 +02:00
|
|
|
Bus::atomicSnoop(Packet *pkt)
|
|
|
|
{
|
|
|
|
std::vector<int> ports = findSnoopPorts(pkt->getAddr(), pkt->getSrc());
|
2006-10-12 00:28:33 +02:00
|
|
|
Tick response_time = 0;
|
2006-08-22 22:08:18 +02:00
|
|
|
|
|
|
|
while (!ports.empty())
|
|
|
|
{
|
2006-10-12 00:28:33 +02:00
|
|
|
Tick response = interfaces[ports.back()]->sendAtomic(pkt);
|
|
|
|
if (response) {
|
|
|
|
assert(!response_time); //Multiple responders
|
|
|
|
response_time = response;
|
|
|
|
}
|
2006-08-22 22:08:18 +02:00
|
|
|
ports.pop_back();
|
|
|
|
}
|
2006-10-12 00:28:33 +02:00
|
|
|
return response_time;
|
2006-08-22 22:08:18 +02:00
|
|
|
}
|
|
|
|
|
2006-10-09 02:30:42 +02:00
|
|
|
void
|
|
|
|
Bus::functionalSnoop(Packet *pkt)
|
|
|
|
{
|
|
|
|
std::vector<int> ports = findSnoopPorts(pkt->getAddr(), pkt->getSrc());
|
|
|
|
|
|
|
|
while (!ports.empty())
|
|
|
|
{
|
|
|
|
interfaces[ports.back()]->sendFunctional(pkt);
|
|
|
|
ports.pop_back();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-08-22 22:08:18 +02:00
|
|
|
bool
|
2006-10-09 00:48:03 +02:00
|
|
|
Bus::timingSnoop(Packet *pkt)
|
2006-08-22 22:08:18 +02:00
|
|
|
{
|
|
|
|
std::vector<int> ports = findSnoopPorts(pkt->getAddr(), pkt->getSrc());
|
|
|
|
bool success = true;
|
|
|
|
|
|
|
|
while (!ports.empty() && success)
|
|
|
|
{
|
|
|
|
success = interfaces[ports.back()]->sendTiming(pkt);
|
|
|
|
ports.pop_back();
|
|
|
|
}
|
|
|
|
|
2006-10-09 00:48:03 +02:00
|
|
|
return success;
|
2006-08-22 22:08:18 +02:00
|
|
|
}
|
|
|
|
|
2006-10-09 00:48:03 +02:00
|
|
|
|
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-10-12 00:28:33 +02:00
|
|
|
Tick snoopTime = atomicSnoop(pkt);
|
|
|
|
if (snoopTime)
|
|
|
|
return snoopTime; //Snoop satisfies it
|
|
|
|
else
|
|
|
|
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);
|
2006-10-09 02:30:42 +02:00
|
|
|
functionalSnoop(pkt);
|
2006-05-26 20:17:33 +02:00
|
|
|
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)
|