2 * Copyright (c) 2003-2005 The Regents of The University of Michigan
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.
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.
28 * Authors: Erik Hallnor
33 * Definitions of LRU tag store.
38 #include "mem/cache/base_cache.hh"
39 #include "base/intmath.hh"
40 #include "mem/cache/tags/lru.hh"
41 #include "sim/root.hh"
46 CacheSet::findBlk(Addr tag
) const
48 for (int i
= 0; i
< assoc
; ++i
) {
49 if (blks
[i
]->tag
== tag
&& blks
[i
]->isValid()) {
58 CacheSet::moveToHead(LRUBlk
*blk
)
60 // nothing to do if blk is already head
64 // write 'next' block into blks[i], moving up from MRU toward LRU
65 // until we overwrite the block we moved to head.
67 // start by setting up to write 'blk' into blks[0]
73 // swap blks[i] and next
74 LRUBlk
*tmp
= blks
[i
];
78 } while (next
!= blk
);
82 // create and initialize a LRU/MRU cache structure
83 LRU::LRU(int _numSets
, int _blkSize
, int _assoc
, int _hit_latency
) :
84 numSets(_numSets
), blkSize(_blkSize
), assoc(_assoc
), hitLatency(_hit_latency
)
87 if (blkSize
< 4 || !isPowerOf2(blkSize
)) {
88 fatal("Block size must be at least 4 and a power of 2");
90 if (numSets
<= 0 || !isPowerOf2(numSets
)) {
91 fatal("# of sets must be non-zero and a power of 2");
94 fatal("associativity must be greater than zero");
96 if (hitLatency
<= 0) {
97 fatal("access latency must be greater than zero");
103 blkMask
= blkSize
- 1;
104 setShift
= floorLog2(blkSize
);
105 setMask
= numSets
- 1;
106 tagShift
= setShift
+ floorLog2(numSets
);
108 /** @todo Make warmup percentage a parameter. */
109 warmupBound
= numSets
* assoc
;
111 sets
= new CacheSet
[numSets
];
112 blks
= new LRUBlk
[numSets
* assoc
];
113 // allocate data storage in one big chunk
114 dataBlks
= new uint8_t[numSets
*assoc
*blkSize
];
116 blkIndex
= 0; // index into blks array
117 for (i
= 0; i
< numSets
; ++i
) {
118 sets
[i
].assoc
= assoc
;
120 sets
[i
].blks
= new LRUBlk
*[assoc
];
122 // link in the data blocks
123 for (j
= 0; j
< assoc
; ++j
) {
124 // locate next cache block
125 blk
= &blks
[blkIndex
];
126 blk
->data
= &dataBlks
[blkSize
*blkIndex
];
129 // invalidate new cache block
132 //EGH Fix Me : do we need to initialize blk?
134 // Setting the tag to j is just to prevent long chains in the hash
135 // table; won't matter because the block is invalid
138 blk
->isTouched
= false;
153 // probe cache for presence of given block.
155 LRU::probe(Addr addr
) const
157 // return(findBlock(Read, addr, asid) != 0);
158 Addr tag
= extractTag(addr
);
159 unsigned myset
= extractSet(addr
);
161 LRUBlk
*blk
= sets
[myset
].findBlk(tag
);
163 return (blk
!= NULL
); // true if in cache
167 LRU::findBlock(Addr addr
, int &lat
)
169 Addr tag
= extractTag(addr
);
170 unsigned set
= extractSet(addr
);
171 LRUBlk
*blk
= sets
[set
].findBlk(tag
);
174 // move this block to head of the MRU list
175 sets
[set
].moveToHead(blk
);
176 if (blk
->whenReady
> curTick
177 && blk
->whenReady
- curTick
> hitLatency
) {
178 lat
= blk
->whenReady
- curTick
;
187 LRU::findBlock(PacketPtr
&pkt
, int &lat
)
189 Addr addr
= pkt
->getAddr();
191 Addr tag
= extractTag(addr
);
192 unsigned set
= extractSet(addr
);
193 LRUBlk
*blk
= sets
[set
].findBlk(tag
);
196 // move this block to head of the MRU list
197 sets
[set
].moveToHead(blk
);
198 if (blk
->whenReady
> curTick
199 && blk
->whenReady
- curTick
> hitLatency
) {
200 lat
= blk
->whenReady
- curTick
;
209 LRU::findBlock(Addr addr
) const
211 Addr tag
= extractTag(addr
);
212 unsigned set
= extractSet(addr
);
213 LRUBlk
*blk
= sets
[set
].findBlk(tag
);
218 LRU::findReplacement(PacketPtr
&pkt
, PacketList
&writebacks
,
219 BlkList
&compress_blocks
)
221 unsigned set
= extractSet(pkt
->getAddr());
222 // grab a replacement candidate
223 LRUBlk
*blk
= sets
[set
].blks
[assoc
-1];
224 sets
[set
].moveToHead(blk
);
225 if (blk
->isValid()) {
227 totalRefs
+= blk
->refCount
;
230 } else if (!blk
->isTouched
) {
232 blk
->isTouched
= true;
233 if (!warmedUp
&& tagsInUse
.value() >= warmupBound
) {
235 warmupCycle
= curTick
;
243 LRU::invalidateBlk(Addr addr
)
245 LRUBlk
*blk
= findBlock(addr
);
248 blk
->isTouched
= false;
249 blk
->clearLoadLocks();
257 for (int i
= 0; i
< numSets
*assoc
; ++i
) {
258 if (blks
[i
].isValid()) {
259 totalRefs
+= blks
[i
].refCount
;