1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
|
/*
* Copyright (c) 2013-2014 ARM Limited
* 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) 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
* Mitch Hayenga
*/
/**
* @file
* Miss and writeback queue declarations.
*/
#ifndef __MEM_CACHE_PREFETCH_BASE_HH__
#define __MEM_CACHE_PREFETCH_BASE_HH__
#include <cstdint>
#include "arch/isa_traits.hh"
#include "arch/generic/tlb.hh"
#include "base/statistics.hh"
#include "base/types.hh"
#include "mem/packet.hh"
#include "mem/request.hh"
#include "sim/byteswap.hh"
#include "sim/clocked_object.hh"
#include "sim/probe/probe.hh"
class BaseCache;
struct BasePrefetcherParams;
class BasePrefetcher : public ClockedObject
{
class PrefetchListener : public ProbeListenerArgBase<PacketPtr>
{
public:
PrefetchListener(BasePrefetcher &_parent, ProbeManager *pm,
const std::string &name, bool _isFill = false,
bool _miss = false)
: ProbeListenerArgBase(pm, name),
parent(_parent), isFill(_isFill), miss(_miss) {}
void notify(const PacketPtr &pkt) override;
protected:
BasePrefetcher &parent;
const bool isFill;
const bool miss;
};
std::vector<PrefetchListener *> listeners;
public:
/**
* Class containing the information needed by the prefetch to train and
* generate new prefetch requests.
*/
class PrefetchInfo {
/** The address used to train and generate prefetches */
Addr address;
/** The program counter that generated this address. */
Addr pc;
/** The requestor ID that generated this address. */
MasterID masterId;
/** Validity bit for the PC of this address. */
bool validPC;
/** Whether this address targets the secure memory space. */
bool secure;
/** Size in bytes of the request triggering this event */
unsigned int size;
/** Whether this event comes from a write request */
bool write;
/** Physical address, needed because address can be virtual */
Addr paddress;
/** Whether this event comes from a cache miss */
bool cacheMiss;
/** Pointer to the associated request data */
uint8_t *data;
public:
/**
* Obtains the address value of this Prefetcher address.
* @return the addres value.
*/
Addr getAddr() const
{
return address;
}
/**
* Returns true if the address targets the secure memory space.
* @return true if the address targets the secure memory space.
*/
bool isSecure() const
{
return secure;
}
/**
* Returns the program counter that generated this request.
* @return the pc value
*/
Addr getPC() const
{
assert(hasPC());
return pc;
}
/**
* Returns true if the associated program counter is valid
* @return true if the program counter has a valid value
*/
bool hasPC() const
{
return validPC;
}
/**
* Gets the requestor ID that generated this address
* @return the requestor ID that generated this address
*/
MasterID getMasterId() const
{
return masterId;
}
/**
* Gets the size of the request triggering this event
* @return the size in bytes of the request triggering this event
*/
unsigned int getSize() const
{
return size;
}
/**
* Checks if the request that caused this prefetch event was a write
* request
* @return true if the request causing this event is a write request
*/
bool isWrite() const
{
return write;
}
/**
* Gets the physical address of the request
* @return physical address of the request
*/
Addr getPaddr() const
{
return paddress;
}
/**
* Check if this event comes from a cache miss
* @result true if this event comes from a cache miss
*/
bool isCacheMiss() const
{
return cacheMiss;
}
/**
* Gets the associated data of the request triggering the event
* @param Byte ordering of the stored data
* @return the data
*/
template <typename T>
inline T
get(ByteOrder endian) const
{
if (data == nullptr) {
panic("PrefetchInfo::get called with a request with no data.");
}
switch (endian) {
case BigEndianByteOrder:
return betoh(*(T*)data);
case LittleEndianByteOrder:
return letoh(*(T*)data);
default:
panic("Illegal byte order in PrefetchInfo::get()\n");
};
}
/**
* Check for equality
* @param pfi PrefetchInfo to compare against
* @return True if this object and the provided one are equal
*/
bool sameAddr(PrefetchInfo const &pfi) const
{
return this->getAddr() == pfi.getAddr() &&
this->isSecure() == pfi.isSecure();
}
/**
* Constructs a PrefetchInfo using a PacketPtr.
* @param pkt PacketPtr used to generate the PrefetchInfo
* @param addr the address value of the new object, this address is
* used to train the prefetcher
* @param miss whether this event comes from a cache miss
*/
PrefetchInfo(PacketPtr pkt, Addr addr, bool miss);
/**
* Constructs a PrefetchInfo using a new address value and
* another PrefetchInfo as a reference.
* @param pfi PrefetchInfo used to generate this new object
* @param addr the address value of the new object
*/
PrefetchInfo(PrefetchInfo const &pfi, Addr addr);
~PrefetchInfo()
{
delete[] data;
}
};
protected:
// PARAMETERS
/** Pointr to the parent cache. */
BaseCache* cache;
/** The block size of the parent cache. */
unsigned blkSize;
/** log_2(block size of the parent cache). */
unsigned lBlkSize;
/** Only consult prefetcher on cache misses? */
const bool onMiss;
/** Consult prefetcher on reads? */
const bool onRead;
/** Consult prefetcher on reads? */
const bool onWrite;
/** Consult prefetcher on data accesses? */
const bool onData;
/** Consult prefetcher on instruction accesses? */
const bool onInst;
/** Request id for prefetches */
const MasterID masterId;
const Addr pageBytes;
/** Prefetch on every access, not just misses */
const bool prefetchOnAccess;
/** Use Virtual Addresses for prefetching */
const bool useVirtualAddresses;
/**
* Determine if this access should be observed
* @param pkt The memory request causing the event
* @param miss whether this event comes from a cache miss
*/
bool observeAccess(const PacketPtr &pkt, bool miss) const;
/** Determine if address is in cache */
bool inCache(Addr addr, bool is_secure) const;
/** Determine if address is in cache miss queue */
bool inMissQueue(Addr addr, bool is_secure) const;
bool hasBeenPrefetched(Addr addr, bool is_secure) const;
/** Determine if addresses are on the same page */
bool samePage(Addr a, Addr b) const;
/** Determine the address of the block in which a lays */
Addr blockAddress(Addr a) const;
/** Determine the address of a at block granularity */
Addr blockIndex(Addr a) const;
/** Determine the address of the page in which a lays */
Addr pageAddress(Addr a) const;
/** Determine the page-offset of a */
Addr pageOffset(Addr a) const;
/** Build the address of the i-th block inside the page */
Addr pageIthBlockAddress(Addr page, uint32_t i) const;
Stats::Scalar pfIssued;
/** Total prefetches issued */
uint64_t issuedPrefetches;
/** Total prefetches that has been useful */
uint64_t usefulPrefetches;
/** Registered tlb for address translations */
BaseTLB * tlb;
public:
BasePrefetcher(const BasePrefetcherParams *p);
virtual ~BasePrefetcher() {}
virtual void setCache(BaseCache *_cache);
/**
* Notify prefetcher of cache access (may be any access or just
* misses, depending on cache parameters.)
*/
virtual void notify(const PacketPtr &pkt, const PrefetchInfo &pfi) = 0;
/** Notify prefetcher of cache fill */
virtual void notifyFill(const PacketPtr &pkt)
{}
virtual PacketPtr getPacket() = 0;
virtual Tick nextPrefetchReadyTime() const = 0;
/**
* Register local statistics.
*/
void regStats() override;
/**
* Register probe points for this object.
*/
void regProbeListeners() override;
/**
* Process a notification event from the ProbeListener.
* @param pkt The memory request causing the event
* @param miss whether this event comes from a cache miss
*/
void probeNotify(const PacketPtr &pkt, bool miss);
/**
* Add a SimObject and a probe name to listen events from
* @param obj The SimObject pointer to listen from
* @param name The probe name
*/
void addEventProbe(SimObject *obj, const char *name);
/**
* Add a BaseTLB object to be used whenever a translation is needed.
* This is generally required when the prefetcher is allowed to generate
* page crossing references and/or uses virtual addresses for training.
* @param tlb pointer to the BaseTLB object to add
*/
void addTLB(BaseTLB *tlb);
};
#endif //__MEM_CACHE_PREFETCH_BASE_HH__
|