gem5  v19.0.0.0
All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Modules Pages
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  * Authors: Erik Hallnor
41  * Andreas Hansson
42  */
43 
49 #ifndef __MEM_CACHE_WRITE_QUEUE_ENTRY_HH__
50 #define __MEM_CACHE_WRITE_QUEUE_ENTRY_HH__
51 
52 #include <cassert>
53 #include <iosfwd>
54 #include <list>
55 #include <string>
56 
57 #include "base/printable.hh"
58 #include "base/types.hh"
59 #include "mem/cache/queue_entry.hh"
60 #include "mem/packet.hh"
61 #include "sim/core.hh"
62 
63 class BaseCache;
64 
68 class WriteQueueEntry : public QueueEntry, public Printable
69 {
70 
74  template<typename Entry>
75  friend class Queue;
76  friend class WriteQueue;
77 
78  public:
79  class TargetList : public std::list<Target> {
80 
81  public:
82 
86  void print(std::ostream &os, int verbosity,
87  const std::string &prefix) const;
88  };
89 
93  typedef List::iterator Iterator;
94 
95  bool sendPacket(BaseCache &cache) override;
96 
97  private:
98 
103  Iterator readyIter;
104 
109  Iterator allocIter;
110 
113 
114  public:
115 
118 
127  void allocate(Addr blk_addr, unsigned blk_size, PacketPtr pkt,
128  Tick when_ready, Counter _order);
129 
130 
134  void deallocate();
135 
140  int getNumTargets() const
141  { return targets.size(); }
142 
147  bool hasTargets() const { return !targets.empty(); }
148 
153  Target *getTarget() override
154  {
155  assert(hasTargets());
156  return &targets.front();
157  }
158 
162  void popTarget()
163  {
164  targets.pop_front();
165  }
166 
168 
172  void print(std::ostream &os,
173  int verbosity = 0,
174  const std::string &prefix = "") const override;
181  std::string print() const;
182 
183  bool matchBlockAddr(const Addr addr, const bool is_secure) const override;
184  bool matchBlockAddr(const PacketPtr pkt) const override;
185  bool conflictAddr(const QueueEntry* entry) const override;
186 };
187 
188 #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:59
WriteQueueEntry()
A simple constructor.
ip6_addr_t addr
Definition: inet.hh:335
List::iterator Iterator
WriteQueueEntry list iterator.
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
Bitfield< 17 > os
Definition: misc.hh:805
void deallocate()
Mark this entry as free.
Generic queue entry.
uint64_t Tick
Tick count type.
Definition: types.hh:63
Target * getTarget() override
Returns a reference to the first target.
A basic cache interface.
Definition: base.hh:93
STL list class.
Definition: stl.hh:54
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
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
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:86
A queue entry base class, to be used by both the MSHRs and write-queue entries.
Definition: queue_entry.hh:61
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 Feb 28 2020 16:27:02 for gem5 by doxygen 1.8.13