6dc3b2fa39
SConscript: compile ide devices base/chunk_generator.hh: add another parameter to the chuck generator called complete() which returns the number of bytes transfered so far. Very useful for adding to a pointer. configs/test/fs.py: Add ide disk to fs test configuration dev/ide_ctrl.cc: dev/ide_ctrl.hh: dev/ide_disk.cc: dev/ide_disk.hh: dev/io_device.cc: dev/io_device.hh: dev/pciconfigall.cc: dev/pciconfigall.hh: dev/pcidev.cc: dev/pcidev.hh: update for new memory system mem/bus.cc: support devices that return multiple ranges remove old ranges before using new info mem/packet.hh: make senderstate void* per steve's request that we use every construct possible in C++ mem/physical.cc: have memory stamp the packet with the time. mem/physical.hh: actually set the memory latency variable python/m5/objects/Device.py: Add DmaDevice python/m5/objects/Ide.py: Ide disk no longer has a physmem pointer python/m5/objects/Pci.py: update pci device for newmem python/m5/objects/PhysicalMemory.py: add latency parameter for physical memory sim/byteswap.hh: use fast architecture dependent byteswap calls if they exist --HG-- extra : convert_revision : e3cf2e8f61064ad302d94bc22010a00c59f3f793
148 lines
4.4 KiB
C++
148 lines
4.4 KiB
C++
/*
|
|
* 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.
|
|
*/
|
|
|
|
/**
|
|
* @file Definition of a bus object.
|
|
*/
|
|
|
|
|
|
#include "base/trace.hh"
|
|
#include "mem/bus.hh"
|
|
#include "sim/builder.hh"
|
|
|
|
/** Function called by the port when the bus is recieving a Timing
|
|
* transaction.*/
|
|
bool
|
|
Bus::recvTiming(Packet &pkt, int id)
|
|
{
|
|
|
|
panic("I need to be implemented, but not right now.");
|
|
}
|
|
|
|
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;
|
|
|
|
while (i < portList.size() && !found)
|
|
{
|
|
if (portList[i].range == addr) {
|
|
dest_id = portList[i].portId;
|
|
found = true;
|
|
DPRINTF(Bus, "Found Addr: %llx on device %d\n", addr, dest_id);
|
|
}
|
|
i++;
|
|
}
|
|
if (dest_id == -1)
|
|
panic("Unable to find destination for addr: %llx", addr);
|
|
|
|
// we shouldn't be sending this back to where it came from
|
|
assert(dest_id != id);
|
|
|
|
return interfaces[dest_id];
|
|
}
|
|
|
|
/** Function called by the port when the bus is recieving a Atomic
|
|
* transaction.*/
|
|
Tick
|
|
Bus::recvAtomic(Packet &pkt, int id)
|
|
{
|
|
return findPort(pkt.addr, id)->sendAtomic(pkt);
|
|
}
|
|
|
|
/** Function called by the port when the bus is recieving a Functional
|
|
* transaction.*/
|
|
void
|
|
Bus::recvFunctional(Packet &pkt, int id)
|
|
{
|
|
findPort(pkt.addr, id)->sendFunctional(pkt);
|
|
}
|
|
|
|
/** Function called by the port when the bus is recieving a status change.*/
|
|
void
|
|
Bus::recvStatusChange(Port::Status status, int id)
|
|
{
|
|
assert(status == Port::RangeChange &&
|
|
"The other statuses need to be implemented.");
|
|
|
|
assert(id < interfaces.size() && id >= 0);
|
|
Port *port = interfaces[id];
|
|
AddrRangeList ranges;
|
|
AddrRangeList snoops;
|
|
AddrRangeIter iter;
|
|
std::vector<DevMap>::iterator portIter;
|
|
|
|
// Clean out any previously existent ids
|
|
for (portIter = portList.begin(); portIter != portList.end(); ) {
|
|
if (portIter->portId == id)
|
|
portIter = portList.erase(portIter);
|
|
else
|
|
portIter++;
|
|
}
|
|
|
|
port->getPeerAddressRanges(ranges, snoops);
|
|
|
|
// not dealing with snooping yet either
|
|
assert(snoops.size() == 0);
|
|
for(iter = ranges.begin(); iter != ranges.end(); iter++) {
|
|
DevMap dm;
|
|
dm.portId = id;
|
|
dm.range = *iter;
|
|
|
|
DPRINTF(MMU, "Adding range %llx - %llx for id %d\n", dm.range.start,
|
|
dm.range.end, id);
|
|
portList.push_back(dm);
|
|
}
|
|
DPRINTF(MMU, "port list has %d entries\n", portList.size());
|
|
}
|
|
|
|
void
|
|
Bus::BusPort::addressRanges(AddrRangeList &resp, AddrRangeList &snoop)
|
|
{
|
|
panic("I'm not implemented.\n");
|
|
}
|
|
|
|
BEGIN_DECLARE_SIM_OBJECT_PARAMS(Bus)
|
|
|
|
Param<int> bus_id;
|
|
|
|
END_DECLARE_SIM_OBJECT_PARAMS(Bus)
|
|
|
|
BEGIN_INIT_SIM_OBJECT_PARAMS(Bus)
|
|
INIT_PARAM(bus_id, "junk bus id")
|
|
END_INIT_SIM_OBJECT_PARAMS(PhysicalMemory)
|
|
|
|
CREATE_SIM_OBJECT(Bus)
|
|
{
|
|
return new Bus(getInstanceName());
|
|
}
|
|
|
|
REGISTER_SIM_OBJECT("Bus", Bus)
|