2012-04-06 19:46:31 +02:00
|
|
|
/*
|
2013-08-19 09:52:25 +02:00
|
|
|
* Copyright (c) 2012-2013 ARM Limited
|
2012-04-06 19:46:31 +02:00
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* Copyright (c) 2001-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.
|
|
|
|
*
|
|
|
|
* Authors: Ron Dreslinski
|
|
|
|
* Andreas Hansson
|
|
|
|
*/
|
|
|
|
|
|
|
|
/**
|
|
|
|
* @file
|
|
|
|
* SimpleMemory declaration
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __SIMPLE_MEMORY_HH__
|
|
|
|
#define __SIMPLE_MEMORY_HH__
|
|
|
|
|
2015-11-06 09:26:36 +01:00
|
|
|
#include <list>
|
2013-08-19 09:52:25 +02:00
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
#include "mem/abstract_mem.hh"
|
2013-08-19 09:52:25 +02:00
|
|
|
#include "mem/port.hh"
|
2012-04-06 19:46:31 +02:00
|
|
|
#include "params/SimpleMemory.hh"
|
|
|
|
|
|
|
|
/**
|
2012-07-12 18:56:13 +02:00
|
|
|
* The simple memory is a basic single-ported memory controller with
|
2013-08-19 09:52:25 +02:00
|
|
|
* a configurable throughput and latency.
|
|
|
|
*
|
2012-09-25 18:49:41 +02:00
|
|
|
* @sa \ref gem5MemorySystem "gem5 Memory System"
|
2012-04-06 19:46:31 +02:00
|
|
|
*/
|
|
|
|
class SimpleMemory : public AbstractMemory
|
|
|
|
{
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
2013-08-19 09:52:25 +02:00
|
|
|
/**
|
|
|
|
* A deferred packet stores a packet along with its scheduled
|
|
|
|
* transmission time
|
|
|
|
*/
|
|
|
|
class DeferredPacket
|
|
|
|
{
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
|
|
const Tick tick;
|
|
|
|
const PacketPtr pkt;
|
|
|
|
|
|
|
|
DeferredPacket(PacketPtr _pkt, Tick _tick) : tick(_tick), pkt(_pkt)
|
|
|
|
{ }
|
|
|
|
};
|
|
|
|
|
|
|
|
class MemoryPort : public SlavePort
|
2012-04-06 19:46:31 +02:00
|
|
|
{
|
2012-09-18 16:30:02 +02:00
|
|
|
|
|
|
|
private:
|
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
SimpleMemory& memory;
|
|
|
|
|
|
|
|
public:
|
|
|
|
|
|
|
|
MemoryPort(const std::string& _name, SimpleMemory& _memory);
|
|
|
|
|
|
|
|
protected:
|
|
|
|
|
2012-09-18 16:30:02 +02:00
|
|
|
Tick recvAtomic(PacketPtr pkt);
|
|
|
|
|
|
|
|
void recvFunctional(PacketPtr pkt);
|
2012-04-06 19:46:31 +02:00
|
|
|
|
2012-09-18 16:30:02 +02:00
|
|
|
bool recvTimingReq(PacketPtr pkt);
|
2012-04-06 19:46:31 +02:00
|
|
|
|
2015-03-02 10:00:35 +01:00
|
|
|
void recvRespRetry();
|
2013-08-19 09:52:25 +02:00
|
|
|
|
2012-09-18 16:30:02 +02:00
|
|
|
AddrRangeList getAddrRanges() const;
|
2012-04-06 19:46:31 +02:00
|
|
|
|
|
|
|
};
|
|
|
|
|
2012-07-12 18:56:13 +02:00
|
|
|
MemoryPort port;
|
2012-04-06 19:46:31 +02:00
|
|
|
|
2013-08-19 09:52:25 +02:00
|
|
|
/**
|
|
|
|
* Latency from that a request is accepted until the response is
|
|
|
|
* ready to be sent.
|
|
|
|
*/
|
|
|
|
const Tick latency;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Fudge factor added to the latency.
|
|
|
|
*/
|
|
|
|
const Tick latency_var;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Internal (unbounded) storage to mimic the delay caused by the
|
|
|
|
* actual memory access. Note that this is where the packet spends
|
|
|
|
* the memory latency.
|
|
|
|
*/
|
2015-11-06 09:26:36 +01:00
|
|
|
std::list<DeferredPacket> packetQueue;
|
2012-04-06 19:46:31 +02:00
|
|
|
|
2013-08-19 09:52:25 +02:00
|
|
|
/**
|
|
|
|
* Bandwidth in ticks per byte. The regulation affects the
|
|
|
|
* acceptance rate of requests and the queueing takes place after
|
|
|
|
* the regulation.
|
|
|
|
*/
|
2012-09-18 16:30:02 +02:00
|
|
|
const double bandwidth;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Track the state of the memory as either idle or busy, no need
|
|
|
|
* for an enum with only two states.
|
|
|
|
*/
|
|
|
|
bool isBusy;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Remember if we have to retry an outstanding request that
|
|
|
|
* arrived while we were busy.
|
|
|
|
*/
|
|
|
|
bool retryReq;
|
|
|
|
|
2013-08-19 09:52:25 +02:00
|
|
|
/**
|
|
|
|
* Remember if we failed to send a response and are awaiting a
|
|
|
|
* retry. This is only used as a check.
|
|
|
|
*/
|
|
|
|
bool retryResp;
|
|
|
|
|
2012-09-18 16:30:02 +02:00
|
|
|
/**
|
|
|
|
* Release the memory after being busy and send a retry if a
|
|
|
|
* request was rejected in the meanwhile.
|
|
|
|
*/
|
|
|
|
void release();
|
|
|
|
|
|
|
|
EventWrapper<SimpleMemory, &SimpleMemory::release> releaseEvent;
|
|
|
|
|
2013-08-19 09:52:25 +02:00
|
|
|
/**
|
|
|
|
* Dequeue a packet from our internal packet queue and move it to
|
|
|
|
* the port where it will be sent as soon as possible.
|
|
|
|
*/
|
|
|
|
void dequeue();
|
|
|
|
|
|
|
|
EventWrapper<SimpleMemory, &SimpleMemory::dequeue> dequeueEvent;
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Detemine the latency.
|
|
|
|
*
|
|
|
|
* @return the latency seen by the current packet
|
|
|
|
*/
|
|
|
|
Tick getLatency() const;
|
|
|
|
|
2015-11-06 09:26:21 +01:00
|
|
|
/**
|
|
|
|
* Upstream caches need this packet until true is returned, so
|
|
|
|
* hold it for deletion until a subsequent call
|
2012-11-02 17:50:16 +01:00
|
|
|
*/
|
2015-11-06 09:26:21 +01:00
|
|
|
std::unique_ptr<Packet> pendingDelete;
|
2012-11-02 17:50:16 +01:00
|
|
|
|
2012-04-06 19:46:31 +02:00
|
|
|
public:
|
|
|
|
|
2012-09-18 16:30:02 +02:00
|
|
|
SimpleMemory(const SimpleMemoryParams *p);
|
2012-04-06 19:46:31 +02:00
|
|
|
|
2015-10-12 10:07:59 +02:00
|
|
|
DrainState drain() override;
|
2012-04-06 19:46:31 +02:00
|
|
|
|
2013-08-19 09:52:25 +02:00
|
|
|
BaseSlavePort& getSlavePort(const std::string& if_name,
|
2015-10-12 10:08:01 +02:00
|
|
|
PortID idx = InvalidPortID) override;
|
|
|
|
void init() override;
|
2012-04-06 19:46:31 +02:00
|
|
|
|
|
|
|
protected:
|
|
|
|
|
2013-08-19 09:52:25 +02:00
|
|
|
Tick recvAtomic(PacketPtr pkt);
|
|
|
|
|
|
|
|
void recvFunctional(PacketPtr pkt);
|
|
|
|
|
2012-09-18 16:30:02 +02:00
|
|
|
bool recvTimingReq(PacketPtr pkt);
|
2013-08-19 09:52:25 +02:00
|
|
|
|
2015-03-02 10:00:35 +01:00
|
|
|
void recvRespRetry();
|
2012-04-06 19:46:31 +02:00
|
|
|
|
|
|
|
};
|
|
|
|
|
|
|
|
#endif //__SIMPLE_MEMORY_HH__
|