2 * Copyright (c) 2012 ARM Limited
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
14 * Copyright (c) 2001-2005 The Regents of The University of Michigan
15 * All rights reserved.
17 * Redistribution and use in source and binary forms, with or without
18 * modification, are permitted provided that the following conditions are
19 * met: redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer;
21 * redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution;
24 * neither the name of the copyright holders nor the names of its
25 * contributors may be used to endorse or promote products derived from
26 * this software without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
29 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
30 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
31 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
32 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
33 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
34 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
35 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
36 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
37 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
38 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
40 * Authors: Ron Dreslinski
46 * SimpleMemory declaration
49 #ifndef __SIMPLE_MEMORY_HH__
50 #define __SIMPLE_MEMORY_HH__
52 #include "mem/abstract_mem.hh"
53 #include "mem/tport.hh"
54 #include "params/SimpleMemory.hh"
57 * The simple memory is a basic single-ported memory controller with
58 * an configurable throughput and latency, potentially with a variance
59 * added to the latter. It uses a QueueSlavePort to avoid dealing with
60 * the flow control of sending responses.
62 class SimpleMemory : public AbstractMemory
67 class MemoryPort : public QueuedSlavePort
72 /// Queue holding the response packets
73 SlavePacketQueue queueImpl;
78 MemoryPort(const std::string& _name, SimpleMemory& _memory);
82 Tick recvAtomic(PacketPtr pkt);
84 void recvFunctional(PacketPtr pkt);
86 bool recvTimingReq(PacketPtr pkt);
88 AddrRangeList getAddrRanges() const;
97 /// Bandwidth in ticks per byte
98 const double bandwidth;
101 * Track the state of the memory as either idle or busy, no need
102 * for an enum with only two states.
107 * Remember if we have to retry an outstanding request that
108 * arrived while we were busy.
113 * Release the memory after being busy and send a retry if a
114 * request was rejected in the meanwhile.
118 EventWrapper<SimpleMemory, &SimpleMemory::release> releaseEvent;
122 SimpleMemory(const SimpleMemoryParams *p);
123 virtual ~SimpleMemory() { }
125 unsigned int drain(Event* de);
127 virtual SlavePort& getSlavePort(const std::string& if_name, int idx = -1);
132 Tick doAtomicAccess(PacketPtr pkt);
133 void doFunctionalAccess(PacketPtr pkt);
134 bool recvTimingReq(PacketPtr pkt);
135 Tick calculateLatency(PacketPtr pkt);
139 #endif //__SIMPLE_MEMORY_HH__