gem5  v20.0.0.3
write_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 
46 #ifndef __MEM_CACHE_WRITE_QUEUE_ENTRY_HH__
47 #define __MEM_CACHE_WRITE_QUEUE_ENTRY_HH__
48 
49 #include <cassert>
50 #include <iosfwd>
51 #include <list>
52 #include <string>
53 
54 #include "base/printable.hh"
55 #include "base/types.hh"
56 #include "mem/cache/queue_entry.hh"
57 #include "mem/packet.hh"
58 #include "sim/core.hh"
59 
60 class BaseCache;
61 
65 class WriteQueueEntry : public QueueEntry, public Printable
66 {
67 
71  template<typename Entry>
72  friend class Queue;
73  friend class WriteQueue;
74 
75  public:
76  class TargetList : public std::list<Target> {
77 
78  public:
79 
83  void print(std::ostream &os, int verbosity,
84  const std::string &prefix) const;
85  };
86 
90  typedef List::iterator Iterator;
91 
92  bool sendPacket(BaseCache &cache) override;
93 
94  private:
95 
100  Iterator readyIter;
101 
106  Iterator allocIter;
107 
110 
111  public:
112 
115 
124  void allocate(Addr blk_addr, unsigned blk_size, PacketPtr pkt,
125  Tick when_ready, Counter _order);
126 
127 
131  void deallocate();
132 
137  int getNumTargets() const
138  { return targets.size(); }
139 
144  bool hasTargets() const { return !targets.empty(); }
145 
150  Target *getTarget() override
151  {
152  assert(hasTargets());
153  return &targets.front();
154  }
155 
159  void popTarget()
160  {
161  targets.pop_front();
162  }
163 
165 
169  void print(std::ostream &os,
170  int verbosity = 0,
171  const std::string &prefix = "") const override;
178  std::string print() const;
179 
180  bool matchBlockAddr(const Addr addr, const bool is_secure) const override;
181  bool matchBlockAddr(const PacketPtr pkt) const override;
182  bool conflictAddr(const QueueEntry* entry) const override;
183 };
184 
185 #endif // __MEM_CACHE_WRITE_QUEUE_ENTRY_HH__
TargetList targets
List of all requests that match the address.
void print(std::ostream &os, int verbosity, const std::string &prefix) const
A write queue for all eviction packets, i.e.
Definition: write_queue.hh:57
WriteQueueEntry()
A simple constructor.
ip6_addr_t addr
Definition: inet.hh:330
List::iterator Iterator
WriteQueueEntry list iterator.
Tick readyTime
Tick when ready to issue.
Definition: queue_entry.hh:70
Counter order
Order number assigned to disambiguate writes and misses.
Definition: queue_entry.hh:108
A high-level queue interface, to be used by both the MSHR queue and the write buffer.
Definition: queue.hh:66
Bitfield< 17 > os
Definition: misc.hh:803
void deallocate()
Mark this entry as free.
Generic queue entry.
uint64_t Tick
Tick count type.
Definition: types.hh:61
Target * getTarget() override
Returns a reference to the first target.
A basic cache interface.
Definition: base.hh:89
STL list class.
Definition: stl.hh:51
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:140
int64_t Counter
Statistics counter type.
Definition: types.hh:56
A Packet is used to encapsulate a transfer between two objects in the memory system (e...
Definition: packet.hh:249
Abstract base class for objects which support being printed to a stream for debugging.
Definition: printable.hh:44
std::list< WriteQueueEntry * > List
A list of write queue entriess.
A queue entry is holding packets that will be serviced as soon as resources are available.
Definition: queue_entry.hh:83
A queue entry base class, to be used by both the MSHRs and write-queue entries.
Definition: queue_entry.hh:58
bool hasTargets() const
Returns true if there are targets left.
Declaration of the Packet class.
Iterator readyIter
Pointer to this entry on the ready list.
int getNumTargets() const
Returns the current number of allocated targets.
bool matchBlockAddr(const Addr addr, const bool is_secure) const override
Check if entry corresponds to the one being looked for.
void popTarget()
Pop first target.
Iterator allocIter
Pointer to this entry on the allocated list.
bool trySatisfyFunctional(PacketPtr pkt)
bool conflictAddr(const QueueEntry *entry) const override
Check if given entry&#39;s packets conflict with this&#39; entries packets.
Write queue entry.
bool sendPacket(BaseCache &cache) override
Send this queue entry as a downstream packet, with the exact behaviour depending on the specific entr...
void allocate(Addr blk_addr, unsigned blk_size, PacketPtr pkt, Tick when_ready, Counter _order)
Allocate a miss to this entry.
void add(PacketPtr pkt, Tick readyTime, Counter order)

Generated on Fri Jul 3 2020 15:53:03 for gem5 by doxygen 1.8.13