2006-01-31 18:12:49 +01:00
|
|
|
/*
|
2012-01-17 19:55:09 +01:00
|
|
|
* Copyright (c) 2011 ARM Limited
|
|
|
|
* All rights reserved
|
|
|
|
*
|
|
|
|
* The license below extends only to copyright in the software and shall
|
|
|
|
* not be construed as granting a license to any other intellectual
|
|
|
|
* property including but not limited to intellectual property relating
|
|
|
|
* to a hardware implementation of the functionality of the software
|
|
|
|
* licensed hereunder. You may use the software subject to the license
|
|
|
|
* terms below provided that you ensure that this notice is replicated
|
|
|
|
* unmodified and in its entirety in all distributions of the software,
|
|
|
|
* modified or unmodified, in source code or in binary form.
|
|
|
|
*
|
2006-01-31 18:12:49 +01:00
|
|
|
* Copyright (c) 2002-2005 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: Ron Dreslinski
|
2006-06-18 00:40:40 +02:00
|
|
|
* Ali Saidi
|
2012-01-17 19:55:09 +01:00
|
|
|
* Andreas Hansson
|
MEM: Introduce the master/slave port sub-classes in C++
This patch introduces the notion of a master and slave port in the C++
code, thus bringing the previous classification from the Python
classes into the corresponding simulation objects and memory objects.
The patch enables us to classify behaviours into the two bins and add
assumptions and enfore compliance, also simplifying the two
interfaces. As a starting point, isSnooping is confined to a master
port, and getAddrRanges to slave ports. More of these specilisations
are to come in later patches.
The getPort function is not getMasterPort and getSlavePort, and
returns a port reference rather than a pointer as NULL would never be
a valid return value. The default implementation of these two
functions is placed in MemObject, and calls fatal.
The one drawback with this specific patch is that it requires some
code duplication, e.g. QueuedPort becomes QueuedMasterPort and
QueuedSlavePort, and BusPort becomes BusMasterPort and BusSlavePort
(avoiding multiple inheritance). With the later introduction of the
port interfaces, moving the functionality outside the port itself, a
lot of the duplicated code will disappear again.
2012-03-30 15:40:11 +02:00
|
|
|
* William Wang
|
2006-01-31 18:12:49 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
2006-08-15 01:25:07 +02:00
|
|
|
* @file
|
|
|
|
* Declaration of a bus object.
|
2006-01-31 18:12:49 +01:00
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __MEM_BUS_HH__
|
|
|
|
#define __MEM_BUS_HH__
|
|
|
|
|
|
|
|
#include <list>
|
2011-04-15 19:44:06 +02:00
|
|
|
#include <set>
|
|
|
|
#include <string>
|
2006-01-31 18:12:49 +01:00
|
|
|
|
2009-05-17 23:34:52 +02:00
|
|
|
#include "base/range.hh"
|
2006-12-15 07:49:41 +01:00
|
|
|
#include "base/range_map.hh"
|
2009-05-17 23:34:51 +02:00
|
|
|
#include "base/types.hh"
|
2006-01-31 18:12:49 +01:00
|
|
|
#include "mem/mem_object.hh"
|
|
|
|
#include "mem/packet.hh"
|
2006-01-31 20:15:33 +01:00
|
|
|
#include "mem/port.hh"
|
2007-08-30 21:16:59 +02:00
|
|
|
#include "params/Bus.hh"
|
2009-05-17 23:34:52 +02:00
|
|
|
#include "sim/eventq.hh"
|
2006-01-31 18:12:49 +01:00
|
|
|
|
|
|
|
class Bus : public MemObject
|
|
|
|
{
|
MEM: Introduce the master/slave port sub-classes in C++
This patch introduces the notion of a master and slave port in the C++
code, thus bringing the previous classification from the Python
classes into the corresponding simulation objects and memory objects.
The patch enables us to classify behaviours into the two bins and add
assumptions and enfore compliance, also simplifying the two
interfaces. As a starting point, isSnooping is confined to a master
port, and getAddrRanges to slave ports. More of these specilisations
are to come in later patches.
The getPort function is not getMasterPort and getSlavePort, and
returns a port reference rather than a pointer as NULL would never be
a valid return value. The default implementation of these two
functions is placed in MemObject, and calls fatal.
The one drawback with this specific patch is that it requires some
code duplication, e.g. QueuedPort becomes QueuedMasterPort and
QueuedSlavePort, and BusPort becomes BusMasterPort and BusSlavePort
(avoiding multiple inheritance). With the later introduction of the
port interfaces, moving the functionality outside the port itself, a
lot of the duplicated code will disappear again.
2012-03-30 15:40:11 +02:00
|
|
|
/**
|
|
|
|
* Declaration of the bus slave port type, one will be
|
|
|
|
* instantiated for each of the master interfaces connecting to
|
|
|
|
* the bus.
|
|
|
|
*/
|
|
|
|
class BusSlavePort : public SlavePort
|
|
|
|
{
|
|
|
|
private:
|
|
|
|
/** A pointer to the bus to which this port belongs. */
|
|
|
|
Bus *bus;
|
|
|
|
|
|
|
|
/** A id to keep track of the interface ID of this port. */
|
|
|
|
int id;
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
|
|
/** Constructor for the BusSlavePort.*/
|
|
|
|
BusSlavePort(const std::string &_name, Bus *_bus, int _id)
|
|
|
|
: SlavePort(_name, _bus), bus(_bus), id(_id)
|
|
|
|
{ }
|
|
|
|
|
|
|
|
int getId() const { return id; }
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
|
|
|
/** When reciving a timing request from the peer port (at id),
|
|
|
|
pass it to the bus. */
|
|
|
|
virtual bool recvTiming(PacketPtr pkt)
|
|
|
|
{ pkt->setSrc(id); return bus->recvTiming(pkt); }
|
|
|
|
|
|
|
|
/** When reciving a Atomic requestfrom the peer port (at id),
|
|
|
|
pass it to the bus. */
|
|
|
|
virtual Tick recvAtomic(PacketPtr pkt)
|
|
|
|
{ pkt->setSrc(id); return bus->recvAtomic(pkt); }
|
|
|
|
|
|
|
|
/** When reciving a Functional requestfrom the peer port (at id),
|
|
|
|
pass it to the bus. */
|
|
|
|
virtual void recvFunctional(PacketPtr pkt)
|
|
|
|
{ pkt->setSrc(id); bus->recvFunctional(pkt); }
|
|
|
|
|
|
|
|
/** When reciving a retry from the peer port (at id),
|
|
|
|
pass it to the bus. */
|
|
|
|
virtual void recvRetry()
|
|
|
|
{ bus->recvRetry(id); }
|
|
|
|
|
|
|
|
// This should return all the 'owned' addresses that are
|
|
|
|
// downstream from this bus, yes? That is, the union of all
|
|
|
|
// the 'owned' address ranges of all the other interfaces on
|
|
|
|
// this bus...
|
|
|
|
virtual AddrRangeList getAddrRanges()
|
|
|
|
{ return bus->getAddrRanges(id); }
|
|
|
|
|
|
|
|
// Ask the bus to ask everyone on the bus what their block size is and
|
|
|
|
// take the max of it. This might need to be changed a bit if we ever
|
|
|
|
// support multiple block sizes.
|
|
|
|
virtual unsigned deviceBlockSize() const
|
|
|
|
{ return bus->findBlockSize(id); }
|
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Declaration of the bus master port type, one will be
|
|
|
|
* instantiated for each of the slave interfaces connecting to the
|
|
|
|
* bus.
|
|
|
|
*/
|
|
|
|
class BusMasterPort : public MasterPort
|
2006-01-31 18:12:49 +01:00
|
|
|
{
|
MEM: Introduce the master/slave port sub-classes in C++
This patch introduces the notion of a master and slave port in the C++
code, thus bringing the previous classification from the Python
classes into the corresponding simulation objects and memory objects.
The patch enables us to classify behaviours into the two bins and add
assumptions and enfore compliance, also simplifying the two
interfaces. As a starting point, isSnooping is confined to a master
port, and getAddrRanges to slave ports. More of these specilisations
are to come in later patches.
The getPort function is not getMasterPort and getSlavePort, and
returns a port reference rather than a pointer as NULL would never be
a valid return value. The default implementation of these two
functions is placed in MemObject, and calls fatal.
The one drawback with this specific patch is that it requires some
code duplication, e.g. QueuedPort becomes QueuedMasterPort and
QueuedSlavePort, and BusPort becomes BusMasterPort and BusSlavePort
(avoiding multiple inheritance). With the later introduction of the
port interfaces, moving the functionality outside the port itself, a
lot of the duplicated code will disappear again.
2012-03-30 15:40:11 +02:00
|
|
|
private:
|
2006-01-31 18:12:49 +01:00
|
|
|
/** A pointer to the bus to which this port belongs. */
|
|
|
|
Bus *bus;
|
|
|
|
|
MEM: Introduce the master/slave port sub-classes in C++
This patch introduces the notion of a master and slave port in the C++
code, thus bringing the previous classification from the Python
classes into the corresponding simulation objects and memory objects.
The patch enables us to classify behaviours into the two bins and add
assumptions and enfore compliance, also simplifying the two
interfaces. As a starting point, isSnooping is confined to a master
port, and getAddrRanges to slave ports. More of these specilisations
are to come in later patches.
The getPort function is not getMasterPort and getSlavePort, and
returns a port reference rather than a pointer as NULL would never be
a valid return value. The default implementation of these two
functions is placed in MemObject, and calls fatal.
The one drawback with this specific patch is that it requires some
code duplication, e.g. QueuedPort becomes QueuedMasterPort and
QueuedSlavePort, and BusPort becomes BusMasterPort and BusSlavePort
(avoiding multiple inheritance). With the later introduction of the
port interfaces, moving the functionality outside the port itself, a
lot of the duplicated code will disappear again.
2012-03-30 15:40:11 +02:00
|
|
|
/** A id to keep track of the interface ID of this port. */
|
2006-01-31 18:12:49 +01:00
|
|
|
int id;
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
MEM: Introduce the master/slave port sub-classes in C++
This patch introduces the notion of a master and slave port in the C++
code, thus bringing the previous classification from the Python
classes into the corresponding simulation objects and memory objects.
The patch enables us to classify behaviours into the two bins and add
assumptions and enfore compliance, also simplifying the two
interfaces. As a starting point, isSnooping is confined to a master
port, and getAddrRanges to slave ports. More of these specilisations
are to come in later patches.
The getPort function is not getMasterPort and getSlavePort, and
returns a port reference rather than a pointer as NULL would never be
a valid return value. The default implementation of these two
functions is placed in MemObject, and calls fatal.
The one drawback with this specific patch is that it requires some
code duplication, e.g. QueuedPort becomes QueuedMasterPort and
QueuedSlavePort, and BusPort becomes BusMasterPort and BusSlavePort
(avoiding multiple inheritance). With the later introduction of the
port interfaces, moving the functionality outside the port itself, a
lot of the duplicated code will disappear again.
2012-03-30 15:40:11 +02:00
|
|
|
/** Constructor for the BusMasterPort.*/
|
|
|
|
BusMasterPort(const std::string &_name, Bus *_bus, int _id)
|
|
|
|
: MasterPort(_name, _bus), bus(_bus), id(_id)
|
2006-01-31 18:12:49 +01:00
|
|
|
{ }
|
|
|
|
|
2012-01-17 19:55:09 +01:00
|
|
|
int getId() const { return id; }
|
2007-02-07 06:53:05 +01:00
|
|
|
|
2012-01-17 19:55:09 +01:00
|
|
|
/**
|
|
|
|
* Determine if this port should be considered a snooper. This
|
|
|
|
* is determined by the bus.
|
|
|
|
*
|
|
|
|
* @return a boolean that is true if this port is snooping
|
|
|
|
*/
|
MEM: Introduce the master/slave port sub-classes in C++
This patch introduces the notion of a master and slave port in the C++
code, thus bringing the previous classification from the Python
classes into the corresponding simulation objects and memory objects.
The patch enables us to classify behaviours into the two bins and add
assumptions and enfore compliance, also simplifying the two
interfaces. As a starting point, isSnooping is confined to a master
port, and getAddrRanges to slave ports. More of these specilisations
are to come in later patches.
The getPort function is not getMasterPort and getSlavePort, and
returns a port reference rather than a pointer as NULL would never be
a valid return value. The default implementation of these two
functions is placed in MemObject, and calls fatal.
The one drawback with this specific patch is that it requires some
code duplication, e.g. QueuedPort becomes QueuedMasterPort and
QueuedSlavePort, and BusPort becomes BusMasterPort and BusSlavePort
(avoiding multiple inheritance). With the later introduction of the
port interfaces, moving the functionality outside the port itself, a
lot of the duplicated code will disappear again.
2012-03-30 15:40:11 +02:00
|
|
|
virtual bool isSnooping() const
|
2012-01-17 19:55:09 +01:00
|
|
|
{ return bus->isSnooping(id); }
|
|
|
|
|
2006-01-31 18:12:49 +01:00
|
|
|
protected:
|
|
|
|
|
|
|
|
/** When reciving a timing request from the peer port (at id),
|
|
|
|
pass it to the bus. */
|
2006-10-20 09:10:12 +02:00
|
|
|
virtual bool recvTiming(PacketPtr pkt)
|
2006-05-26 20:17:33 +02:00
|
|
|
{ pkt->setSrc(id); return bus->recvTiming(pkt); }
|
2006-01-31 18:12:49 +01:00
|
|
|
|
|
|
|
/** When reciving a Atomic requestfrom the peer port (at id),
|
|
|
|
pass it to the bus. */
|
2006-10-20 09:10:12 +02:00
|
|
|
virtual Tick recvAtomic(PacketPtr pkt)
|
2006-05-26 20:17:33 +02:00
|
|
|
{ pkt->setSrc(id); return bus->recvAtomic(pkt); }
|
2006-01-31 18:12:49 +01:00
|
|
|
|
|
|
|
/** When reciving a Functional requestfrom the peer port (at id),
|
|
|
|
pass it to the bus. */
|
2006-10-20 09:10:12 +02:00
|
|
|
virtual void recvFunctional(PacketPtr pkt)
|
2006-05-26 20:17:33 +02:00
|
|
|
{ pkt->setSrc(id); bus->recvFunctional(pkt); }
|
2006-01-31 18:12:49 +01:00
|
|
|
|
2012-01-17 19:55:09 +01:00
|
|
|
/** When reciving a range change from the peer port (at id),
|
2006-01-31 18:12:49 +01:00
|
|
|
pass it to the bus. */
|
2012-01-17 19:55:09 +01:00
|
|
|
virtual void recvRangeChange()
|
|
|
|
{ bus->recvRangeChange(id); }
|
2006-01-31 18:12:49 +01:00
|
|
|
|
2006-05-31 00:57:42 +02:00
|
|
|
/** When reciving a retry from the peer port (at id),
|
|
|
|
pass it to the bus. */
|
|
|
|
virtual void recvRetry()
|
|
|
|
{ bus->recvRetry(id); }
|
|
|
|
|
2007-05-07 20:42:03 +02:00
|
|
|
// Ask the bus to ask everyone on the bus what their block size is and
|
|
|
|
// take the max of it. This might need to be changed a bit if we ever
|
|
|
|
// support multiple block sizes.
|
2009-06-05 08:21:12 +02:00
|
|
|
virtual unsigned deviceBlockSize() const
|
2007-05-07 20:42:03 +02:00
|
|
|
{ return bus->findBlockSize(id); }
|
2006-03-26 00:31:20 +01:00
|
|
|
|
2006-01-31 18:12:49 +01:00
|
|
|
};
|
|
|
|
|
2007-05-22 08:36:09 +02:00
|
|
|
/** the clock speed for the bus */
|
|
|
|
int clock;
|
2008-02-26 08:20:08 +01:00
|
|
|
/** cycles of overhead per transaction */
|
|
|
|
int headerCycles;
|
2007-05-22 08:36:09 +02:00
|
|
|
/** the width of the bus in bytes */
|
|
|
|
int width;
|
|
|
|
/** the next tick at which the bus will be idle */
|
|
|
|
Tick tickNextIdle;
|
|
|
|
|
|
|
|
Event * drainEvent;
|
|
|
|
|
|
|
|
typedef range_map<Addr,int>::iterator PortIter;
|
|
|
|
range_map<Addr, int> portMap;
|
|
|
|
|
|
|
|
AddrRangeList defaultRange;
|
|
|
|
|
MEM: Introduce the master/slave port sub-classes in C++
This patch introduces the notion of a master and slave port in the C++
code, thus bringing the previous classification from the Python
classes into the corresponding simulation objects and memory objects.
The patch enables us to classify behaviours into the two bins and add
assumptions and enfore compliance, also simplifying the two
interfaces. As a starting point, isSnooping is confined to a master
port, and getAddrRanges to slave ports. More of these specilisations
are to come in later patches.
The getPort function is not getMasterPort and getSlavePort, and
returns a port reference rather than a pointer as NULL would never be
a valid return value. The default implementation of these two
functions is placed in MemObject, and calls fatal.
The one drawback with this specific patch is that it requires some
code duplication, e.g. QueuedPort becomes QueuedMasterPort and
QueuedSlavePort, and BusPort becomes BusMasterPort and BusSlavePort
(avoiding multiple inheritance). With the later introduction of the
port interfaces, moving the functionality outside the port itself, a
lot of the duplicated code will disappear again.
2012-03-30 15:40:11 +02:00
|
|
|
typedef std::vector<BusSlavePort*>::iterator SnoopIter;
|
|
|
|
std::vector<BusSlavePort*> snoopPorts;
|
2007-05-22 08:36:09 +02:00
|
|
|
|
|
|
|
/** Function called by the port when the bus is recieving a Timing
|
|
|
|
transaction.*/
|
|
|
|
bool recvTiming(PacketPtr pkt);
|
|
|
|
|
|
|
|
/** Function called by the port when the bus is recieving a Atomic
|
|
|
|
transaction.*/
|
|
|
|
Tick recvAtomic(PacketPtr pkt);
|
|
|
|
|
|
|
|
/** Function called by the port when the bus is recieving a Functional
|
|
|
|
transaction.*/
|
|
|
|
void recvFunctional(PacketPtr pkt);
|
|
|
|
|
|
|
|
/** Timing function called by port when it is once again able to process
|
|
|
|
* requests. */
|
|
|
|
void recvRetry(int id);
|
|
|
|
|
2012-01-17 19:55:09 +01:00
|
|
|
/** Function called by the port when the bus is recieving a range change.*/
|
|
|
|
void recvRangeChange(int id);
|
2007-05-22 08:36:09 +02:00
|
|
|
|
|
|
|
/** Find which port connected to this bus (if any) should be given a packet
|
|
|
|
* with this address.
|
|
|
|
* @param addr Address to find port for.
|
2007-07-16 05:09:03 +02:00
|
|
|
* @return id of port that the packet should be sent out of.
|
2007-05-22 08:36:09 +02:00
|
|
|
*/
|
2007-07-16 05:09:03 +02:00
|
|
|
int findPort(Addr addr);
|
2007-05-22 08:36:09 +02:00
|
|
|
|
2007-08-04 22:05:55 +02:00
|
|
|
// Cache for the findPort function storing recently used ports from portMap
|
|
|
|
struct PortCache {
|
|
|
|
bool valid;
|
|
|
|
int id;
|
|
|
|
Addr start;
|
|
|
|
Addr end;
|
|
|
|
};
|
|
|
|
|
|
|
|
PortCache portCache[3];
|
|
|
|
|
|
|
|
// Checks the cache and returns the id of the port that has the requested
|
|
|
|
// address within its range
|
|
|
|
inline int checkPortCache(Addr addr) {
|
2007-08-08 20:54:02 +02:00
|
|
|
if (portCache[0].valid && addr >= portCache[0].start &&
|
|
|
|
addr < portCache[0].end) {
|
|
|
|
return portCache[0].id;
|
|
|
|
}
|
|
|
|
if (portCache[1].valid && addr >= portCache[1].start &&
|
|
|
|
addr < portCache[1].end) {
|
|
|
|
return portCache[1].id;
|
|
|
|
}
|
|
|
|
if (portCache[2].valid && addr >= portCache[2].start &&
|
|
|
|
addr < portCache[2].end) {
|
|
|
|
return portCache[2].id;
|
2007-08-04 22:05:55 +02:00
|
|
|
}
|
|
|
|
|
2012-02-24 17:40:29 +01:00
|
|
|
return INVALID_PORT_ID;
|
2007-08-04 22:05:55 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Clears the earliest entry of the cache and inserts a new port entry
|
|
|
|
inline void updatePortCache(short id, Addr start, Addr end) {
|
|
|
|
portCache[2].valid = portCache[1].valid;
|
|
|
|
portCache[2].id = portCache[1].id;
|
|
|
|
portCache[2].start = portCache[1].start;
|
|
|
|
portCache[2].end = portCache[1].end;
|
|
|
|
|
|
|
|
portCache[1].valid = portCache[0].valid;
|
|
|
|
portCache[1].id = portCache[0].id;
|
|
|
|
portCache[1].start = portCache[0].start;
|
|
|
|
portCache[1].end = portCache[0].end;
|
|
|
|
|
|
|
|
portCache[0].valid = true;
|
|
|
|
portCache[0].id = id;
|
|
|
|
portCache[0].start = start;
|
|
|
|
portCache[0].end = end;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Clears the cache. Needs to be called in constructor.
|
|
|
|
inline void clearPortCache() {
|
|
|
|
portCache[2].valid = false;
|
|
|
|
portCache[1].valid = false;
|
|
|
|
portCache[0].valid = false;
|
|
|
|
}
|
|
|
|
|
2012-01-17 19:55:09 +01:00
|
|
|
/**
|
|
|
|
* Return the address ranges this port is responsible for.
|
|
|
|
*
|
|
|
|
* @param id id of the bus port that made the request
|
|
|
|
*
|
|
|
|
* @return a list of non-overlapping address ranges
|
|
|
|
*/
|
|
|
|
AddrRangeList getAddrRanges(int id);
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Determine if the bus port is snooping or not.
|
|
|
|
*
|
|
|
|
* @param id id of the bus port that made the request
|
|
|
|
*
|
|
|
|
* @return a boolean indicating if this port is snooping or not
|
2007-05-22 08:36:09 +02:00
|
|
|
*/
|
MEM: Introduce the master/slave port sub-classes in C++
This patch introduces the notion of a master and slave port in the C++
code, thus bringing the previous classification from the Python
classes into the corresponding simulation objects and memory objects.
The patch enables us to classify behaviours into the two bins and add
assumptions and enfore compliance, also simplifying the two
interfaces. As a starting point, isSnooping is confined to a master
port, and getAddrRanges to slave ports. More of these specilisations
are to come in later patches.
The getPort function is not getMasterPort and getSlavePort, and
returns a port reference rather than a pointer as NULL would never be
a valid return value. The default implementation of these two
functions is placed in MemObject, and calls fatal.
The one drawback with this specific patch is that it requires some
code duplication, e.g. QueuedPort becomes QueuedMasterPort and
QueuedSlavePort, and BusPort becomes BusMasterPort and BusSlavePort
(avoiding multiple inheritance). With the later introduction of the
port interfaces, moving the functionality outside the port itself, a
lot of the duplicated code will disappear again.
2012-03-30 15:40:11 +02:00
|
|
|
bool isSnooping(int id) const;
|
2007-05-22 08:36:09 +02:00
|
|
|
|
2008-03-17 08:07:38 +01:00
|
|
|
/** Calculate the timing parameters for the packet. Updates the
|
|
|
|
* firstWordTime and finishTime fields of the packet object.
|
|
|
|
* Returns the tick at which the packet header is completed (which
|
|
|
|
* will be all that is sent if the target rejects the packet).
|
2008-02-26 08:20:08 +01:00
|
|
|
*/
|
2008-03-17 08:07:38 +01:00
|
|
|
Tick calcPacketTiming(PacketPtr pkt);
|
2008-02-26 08:20:08 +01:00
|
|
|
|
|
|
|
/** Occupy the bus until until */
|
|
|
|
void occupyBus(Tick until);
|
2007-05-22 08:36:09 +02:00
|
|
|
|
2012-03-22 11:37:21 +01:00
|
|
|
/**
|
|
|
|
* Release the bus after being occupied and return to an idle
|
|
|
|
* state where we proceed to send a retry to any potential waiting
|
|
|
|
* port, or drain if asked to do so.
|
|
|
|
*/
|
|
|
|
void releaseBus();
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Send a retry to the port at the head of the retryList. The
|
|
|
|
* caller must ensure that the list is not empty.
|
|
|
|
*/
|
|
|
|
void retryWaiting();
|
|
|
|
|
2007-05-22 08:36:09 +02:00
|
|
|
/** Ask everyone on the bus what their size is
|
|
|
|
* @param id id of the busport that made the request
|
|
|
|
* @return the max of all the sizes
|
|
|
|
*/
|
2009-06-05 08:21:12 +02:00
|
|
|
unsigned findBlockSize(int id);
|
2007-05-22 08:36:09 +02:00
|
|
|
|
2012-03-22 11:37:21 +01:00
|
|
|
// event used to schedule a release of the bus
|
|
|
|
EventWrapper<Bus, &Bus::releaseBus> busIdleEvent;
|
2006-10-08 20:08:58 +02:00
|
|
|
|
2006-10-10 23:24:03 +02:00
|
|
|
bool inRetry;
|
2012-01-17 19:55:09 +01:00
|
|
|
std::set<int> inRecvRangeChange;
|
2006-10-08 20:08:58 +02:00
|
|
|
|
2012-02-24 17:43:53 +01:00
|
|
|
// keep track of the number of master ports (not counting the
|
|
|
|
// default master) since we need this as an offset into the
|
|
|
|
// interfaces vector
|
|
|
|
unsigned int nbrMasterPorts;
|
|
|
|
|
MEM: Introduce the master/slave port sub-classes in C++
This patch introduces the notion of a master and slave port in the C++
code, thus bringing the previous classification from the Python
classes into the corresponding simulation objects and memory objects.
The patch enables us to classify behaviours into the two bins and add
assumptions and enfore compliance, also simplifying the two
interfaces. As a starting point, isSnooping is confined to a master
port, and getAddrRanges to slave ports. More of these specilisations
are to come in later patches.
The getPort function is not getMasterPort and getSlavePort, and
returns a port reference rather than a pointer as NULL would never be
a valid return value. The default implementation of these two
functions is placed in MemObject, and calls fatal.
The one drawback with this specific patch is that it requires some
code duplication, e.g. QueuedPort becomes QueuedMasterPort and
QueuedSlavePort, and BusPort becomes BusMasterPort and BusSlavePort
(avoiding multiple inheritance). With the later introduction of the
port interfaces, moving the functionality outside the port itself, a
lot of the duplicated code will disappear again.
2012-03-30 15:40:11 +02:00
|
|
|
/** The master and slave ports of the bus */
|
|
|
|
std::vector<BusSlavePort*> slavePorts;
|
|
|
|
std::vector<BusMasterPort*> masterPorts;
|
2006-01-31 18:12:49 +01:00
|
|
|
|
2006-05-31 00:57:42 +02:00
|
|
|
/** An array of pointers to ports that retry should be called on because the
|
|
|
|
* original send failed for whatever reason.*/
|
2012-02-09 19:06:27 +01:00
|
|
|
std::list<Port*> retryList;
|
2006-05-31 00:57:42 +02:00
|
|
|
|
2012-02-09 19:06:27 +01:00
|
|
|
void addToRetryList(Port* port)
|
2006-10-08 20:08:58 +02:00
|
|
|
{
|
2006-10-10 23:24:03 +02:00
|
|
|
if (!inRetry) {
|
2012-02-09 19:06:27 +01:00
|
|
|
// The device wasn't retrying a packet, or wasn't at an
|
|
|
|
// appropriate time.
|
2006-10-08 20:08:58 +02:00
|
|
|
retryList.push_back(port);
|
|
|
|
} else {
|
2012-02-09 19:06:27 +01:00
|
|
|
if (!retryList.empty() && port == retryList.front()) {
|
|
|
|
// The device was retrying a packet. It didn't work,
|
|
|
|
// so we'll leave it at the head of the retry list.
|
2006-10-12 01:25:48 +02:00
|
|
|
inRetry = false;
|
2012-02-09 19:06:27 +01:00
|
|
|
} else {
|
|
|
|
// We are in retry, but not for this port, put it at
|
|
|
|
// the end.
|
2006-10-12 01:25:48 +02:00
|
|
|
retryList.push_back(port);
|
|
|
|
}
|
2006-10-08 20:08:58 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2006-07-06 20:41:01 +02:00
|
|
|
/** Port that handles requests that don't match any of the interfaces.*/
|
2012-01-17 19:55:09 +01:00
|
|
|
short defaultPortId;
|
2006-07-06 20:41:01 +02:00
|
|
|
|
2012-02-24 17:40:29 +01:00
|
|
|
/** A symbolic name for a port id that denotes no port. */
|
|
|
|
static const short INVALID_PORT_ID = -1;
|
|
|
|
|
2010-08-17 14:06:21 +02:00
|
|
|
/** If true, use address range provided by default device. Any
|
|
|
|
address not handled by another port and not in default device's
|
|
|
|
range will cause a fatal error. If false, just send all
|
|
|
|
addresses not handled by another port to default device. */
|
|
|
|
bool useDefaultRange;
|
2006-11-02 21:20:37 +01:00
|
|
|
|
2009-06-05 08:21:12 +02:00
|
|
|
unsigned defaultBlockSize;
|
|
|
|
unsigned cachedBlockSize;
|
2007-05-07 20:42:03 +02:00
|
|
|
bool cachedBlockSizeValid;
|
|
|
|
|
2006-01-31 18:12:49 +01:00
|
|
|
public:
|
|
|
|
|
|
|
|
/** A function used to return the port associated with this bus object. */
|
MEM: Introduce the master/slave port sub-classes in C++
This patch introduces the notion of a master and slave port in the C++
code, thus bringing the previous classification from the Python
classes into the corresponding simulation objects and memory objects.
The patch enables us to classify behaviours into the two bins and add
assumptions and enfore compliance, also simplifying the two
interfaces. As a starting point, isSnooping is confined to a master
port, and getAddrRanges to slave ports. More of these specilisations
are to come in later patches.
The getPort function is not getMasterPort and getSlavePort, and
returns a port reference rather than a pointer as NULL would never be
a valid return value. The default implementation of these two
functions is placed in MemObject, and calls fatal.
The one drawback with this specific patch is that it requires some
code duplication, e.g. QueuedPort becomes QueuedMasterPort and
QueuedSlavePort, and BusPort becomes BusMasterPort and BusSlavePort
(avoiding multiple inheritance). With the later introduction of the
port interfaces, moving the functionality outside the port itself, a
lot of the duplicated code will disappear again.
2012-03-30 15:40:11 +02:00
|
|
|
virtual MasterPort& getMasterPort(const std::string& if_name, int idx = -1);
|
|
|
|
virtual SlavePort& getSlavePort(const std::string& if_name, int idx = -1);
|
2006-04-28 21:37:48 +02:00
|
|
|
|
|
|
|
virtual void init();
|
2007-06-10 08:01:47 +02:00
|
|
|
virtual void startup();
|
2006-04-28 21:37:48 +02:00
|
|
|
|
2006-11-02 01:00:49 +01:00
|
|
|
unsigned int drain(Event *de);
|
|
|
|
|
2010-08-17 14:06:21 +02:00
|
|
|
Bus(const BusParams *p);
|
2006-01-31 18:12:49 +01:00
|
|
|
};
|
|
|
|
|
|
|
|
#endif //__MEM_BUS_HH__
|