gem5  v19.0.0.0
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
queue_entry.hh
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2012-2013, 2015-2016 ARM Limited
3  * All rights reserved.
4  *
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.
13  *
14  * Copyright (c) 2002-2005 The Regents of The University of Michigan
15  * All rights reserved.
16  *
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.
27  *
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.
39  *
40  * Authors: Erik Hallnor
41  * Andreas Hansson
42  */
43 
49 #ifndef __MEM_CACHE_QUEUE_ENTRY_HH__
50 #define __MEM_CACHE_QUEUE_ENTRY_HH__
51 
52 #include "base/types.hh"
53 #include "mem/packet.hh"
54 
55 class BaseCache;
56 
62 {
63 
67  template <class Entry>
68  friend class Queue;
69 
70  protected:
71 
74 
77 
78  public:
86  class Target {
87  public:
88  const Tick recvTime;
89  const Tick readyTime;
90  const Counter order;
91  const PacketPtr pkt;
92 
101  Target(PacketPtr _pkt, Tick ready_time, Counter _order)
102  : recvTime(curTick()), readyTime(ready_time), order(_order),
103  pkt(_pkt)
104  {}
105  };
106 
108  bool inService;
109 
112 
115 
117  unsigned blkSize;
118 
120  bool isSecure;
121 
123  : readyTime(0), _isUncacheable(false),
124  inService(false), order(0), blkAddr(0), blkSize(0), isSecure(false)
125  {}
126 
127  bool isUncacheable() const { return _isUncacheable; }
128 
136  virtual bool matchBlockAddr(const Addr addr, const bool is_secure)
137  const = 0;
138 
146  virtual bool matchBlockAddr(const PacketPtr pkt) const = 0;
147 
154  virtual bool conflictAddr(const QueueEntry* entry) const = 0;
155 
160  virtual bool sendPacket(BaseCache &cache) = 0;
161 
167  virtual Target* getTarget() = 0;
168 };
169 
170 #endif // __MEM_CACHE_QUEUE_ENTRY_HH__
bool isSecure
True if the entry targets the secure memory space.
Definition: queue_entry.hh:120
bool inService
True if the entry has been sent downstream.
Definition: queue_entry.hh:108
ip6_addr_t addr
Definition: inet.hh:335
Tick readyTime
Tick when ready to issue.
Definition: queue_entry.hh:73
Counter order
Order number assigned to disambiguate writes and misses.
Definition: queue_entry.hh:111
A high-level queue interface, to be used by both the MSHR queue and the write buffer.
Definition: queue.hh:70
bool isUncacheable() const
Definition: queue_entry.hh:127
Tick curTick()
The current simulated tick.
Definition: core.hh:47
uint64_t Tick
Tick count type.
Definition: types.hh:63
A basic cache interface.
Definition: base.hh:93
Defines global host-dependent types: Counter, Tick, and (indirectly) {int,uint}{8,16,32,64}_t.
uint64_t Addr
Address type This will probably be moved somewhere else in the near future.
Definition: types.hh:142
const Tick readyTime
Time when request is ready to be serviced.
Definition: queue_entry.hh:89
int64_t Counter
Statistics counter type.
Definition: types.hh:58
A Packet is used to encapsulate a transfer between two objects in the memory system (e...
Definition: packet.hh:255
A virtual base opaque structure used to hold state associated with the packet (e.g., an MSHR), specific to a SimObject that sees the packet.
Definition: packet.hh:403
A queue entry is holding packets that will be serviced as soon as resources are available.
Definition: queue_entry.hh:86
Target(PacketPtr _pkt, Tick ready_time, Counter _order)
Default constructor.
Definition: queue_entry.hh:101
A queue entry base class, to be used by both the MSHRs and write-queue entries.
Definition: queue_entry.hh:61
virtual bool matchBlockAddr(const Addr addr, const bool is_secure) const =0
Check if entry corresponds to the one being looked for.
Addr blkAddr
Block aligned address.
Definition: queue_entry.hh:114
Declaration of the Packet class.
const PacketPtr pkt
Pending request packet.
Definition: queue_entry.hh:91
const Tick recvTime
Time when request was received (for stats)
Definition: queue_entry.hh:88
virtual bool sendPacket(BaseCache &cache)=0
Send this queue entry as a downstream packet, with the exact behaviour depending on the specific entr...
const Counter order
Global order (for memory consistency mgmt)
Definition: queue_entry.hh:90
virtual bool conflictAddr(const QueueEntry *entry) const =0
Check if given entry&#39;s packets conflict with this&#39; entries packets.
unsigned blkSize
Block size of the cache.
Definition: queue_entry.hh:117
virtual Target * getTarget()=0
Returns a pointer to the first target.
bool _isUncacheable
True if the entry is uncacheable.
Definition: queue_entry.hh:76

Generated on Fri Feb 28 2020 16:27:01 for gem5 by doxygen 1.8.13