gem5
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Groups Pages
tagged.cc
Go to the documentation of this file.
1 /*
2  * Copyright (c) 2005 The Regents of The University of Michigan
3  * All rights reserved.
4  *
5  * Redistribution and use in source and binary forms, with or without
6  * modification, are permitted provided that the following conditions are
7  * met: redistributions of source code must retain the above copyright
8  * notice, this list of conditions and the following disclaimer;
9  * redistributions in binary form must reproduce the above copyright
10  * notice, this list of conditions and the following disclaimer in the
11  * documentation and/or other materials provided with the distribution;
12  * neither the name of the copyright holders nor the names of its
13  * contributors may be used to endorse or promote products derived from
14  * this software without specific prior written permission.
15  *
16  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27  *
28  * Authors: Ron Dreslinski
29  */
30 
37 
38 TaggedPrefetcher::TaggedPrefetcher(const TaggedPrefetcherParams *p)
39  : QueuedPrefetcher(p), degree(p->degree)
40 {
41 
42 }
43 
44 void
46  std::vector<AddrPriority> &addresses)
47 {
48  Addr blkAddr = pkt->getAddr() & ~(Addr)(blkSize-1);
49 
50  for (int d = 1; d <= degree; d++) {
51  Addr newAddr = blkAddr + d*(blkSize);
52  if (!samePage(blkAddr, newAddr)) {
53  // Count number of unissued prefetches due to page crossing
54  pfSpanPage += degree - d + 1;
55  return;
56  } else {
57  addresses.push_back(AddrPriority(newAddr,0));
58  }
59  }
60 }
61 
63 TaggedPrefetcherParams::create()
64 {
65  return new TaggedPrefetcher(this);
66 }
TaggedPrefetcher(const TaggedPrefetcherParams *p)
Definition: tagged.cc:38
Describes a tagged prefetcher.
STL vector class.
Definition: stl.hh:40
std::pair< Addr, int32_t > AddrPriority
Definition: queued.hh:70
Bitfield< 9 > d
Definition: miscregs.hh:1375
uint64_t Addr
Address type This will probably be moved somewhere else in the near future.
Definition: types.hh:142
A Packet is used to encapsulate a transfer between two objects in the memory system (e...
Definition: packet.hh:245
Stats::Scalar pfSpanPage
Definition: queued.hh:106
void calculatePrefetch(const PacketPtr &pkt, std::vector< AddrPriority > &addresses)
Definition: tagged.cc:45
unsigned blkSize
The block size of the parent cache.
Definition: base.hh:69
Bitfield< 0 > p
bool samePage(Addr a, Addr b) const
Determine if addresses are on the same page.
Definition: base.cc:131
Addr getAddr() const
Definition: packet.hh:639

Generated on Fri Jun 9 2017 13:03:48 for gem5 by doxygen 1.8.6