base_set_assoc.cc (13218:5e7df60c6cab) | base_set_assoc.cc (13219:454ecc63338d) |
---|---|
1/* 2 * Copyright (c) 2012-2014 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 --- 28 unchanged lines hidden (view full) --- 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 */ 42 43/** 44 * @file | 1/* 2 * Copyright (c) 2012-2014 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 --- 28 unchanged lines hidden (view full) --- 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 */ 42 43/** 44 * @file |
45 * Definitions of a base set associative tag store. | 45 * Definitions of a conventional tag store. |
46 */ 47 48#include "mem/cache/tags/base_set_assoc.hh" 49 50#include <string> 51 52#include "base/intmath.hh" 53 54BaseSetAssoc::BaseSetAssoc(const Params *p) | 46 */ 47 48#include "mem/cache/tags/base_set_assoc.hh" 49 50#include <string> 51 52#include "base/intmath.hh" 53 54BaseSetAssoc::BaseSetAssoc(const Params *p) |
55 :BaseTags(p), assoc(p->assoc), allocAssoc(p->assoc), 56 blks(p->size / p->block_size), 57 numSets(p->size / (p->block_size * p->assoc)), | 55 :BaseTags(p), allocAssoc(p->assoc), blks(p->size / p->block_size), |
58 sequentialAccess(p->sequential_access), | 56 sequentialAccess(p->sequential_access), |
59 sets(p->size / (p->block_size * p->assoc)), | |
60 replacementPolicy(p->replacement_policy) 61{ 62 // Check parameters 63 if (blkSize < 4 || !isPowerOf2(blkSize)) { 64 fatal("Block size must be at least 4 and a power of 2"); 65 } | 57 replacementPolicy(p->replacement_policy) 58{ 59 // Check parameters 60 if (blkSize < 4 || !isPowerOf2(blkSize)) { 61 fatal("Block size must be at least 4 and a power of 2"); 62 } |
66 if (!isPowerOf2(numSets)) { 67 fatal("# of sets must be non-zero and a power of 2"); 68 } 69 if (assoc <= 0) { 70 fatal("associativity must be greater than zero"); 71 } 72 73 setShift = floorLog2(blkSize); 74 setMask = numSets - 1; 75 tagShift = setShift + floorLog2(numSets); | |
76} 77 78void 79BaseSetAssoc::init(BaseCache* cache) 80{ 81 // Set parent cache 82 setCache(cache); 83 | 63} 64 65void 66BaseSetAssoc::init(BaseCache* cache) 67{ 68 // Set parent cache 69 setCache(cache); 70 |
84 // Initialize blocks 85 unsigned blkIndex = 0; // index into blks array 86 for (unsigned i = 0; i < numSets; ++i) { 87 sets[i].resize(assoc); | 71 // Initialize all blocks 72 for (unsigned blk_index = 0; blk_index < numBlocks; blk_index++) { 73 // Locate next cache block 74 BlkType* blk = &blks[blk_index]; |
88 | 75 |
89 // link in the data blocks 90 for (unsigned j = 0; j < assoc; ++j) { 91 // Select block within the set to be linked 92 BlkType*& blk = sets[i][j]; | 76 // Link block to indexing policy 77 indexingPolicy->setEntry(blk, blk_index); |
93 | 78 |
94 // Locate next cache block 95 blk = &blks[blkIndex]; | 79 // Associate a data chunk to the block 80 blk->data = &dataBlks[blkSize*blk_index]; |
96 | 81 |
97 // Associate a data chunk to the block 98 blk->data = &dataBlks[blkSize*blkIndex]; 99 100 // Associate a replacement data entry to the block 101 blk->replacementData = replacementPolicy->instantiateEntry(); 102 103 // Setting the tag to j is just to prevent long chains in the 104 // hash table; won't matter because the block is invalid 105 blk->tag = j; 106 107 // Set its index 108 blk->setPosition(i, j); 109 110 // Update block index 111 ++blkIndex; 112 } | 82 // Associate a replacement data entry to the block 83 blk->replacementData = replacementPolicy->instantiateEntry(); |
113 } 114} 115 116void 117BaseSetAssoc::invalidate(CacheBlk *blk) 118{ 119 BaseTags::invalidate(blk); 120 121 // Decrease the number of tags in use 122 tagsInUse--; 123 124 // Invalidate replacement data 125 replacementPolicy->invalidate(blk->replacementData); 126} 127 | 84 } 85} 86 87void 88BaseSetAssoc::invalidate(CacheBlk *blk) 89{ 90 BaseTags::invalidate(blk); 91 92 // Decrease the number of tags in use 93 tagsInUse--; 94 95 // Invalidate replacement data 96 replacementPolicy->invalidate(blk->replacementData); 97} 98 |
128ReplaceableEntry* 129BaseSetAssoc::findBlockBySetAndWay(int set, int way) const 130{ 131 return sets[set][way]; 132} 133 | |
134BaseSetAssoc * 135BaseSetAssocParams::create() 136{ | 99BaseSetAssoc * 100BaseSetAssocParams::create() 101{ |
102 // There must be a indexing policy 103 fatal_if(!indexing_policy, "An indexing policy is required"); 104 |
|
137 return new BaseSetAssoc(this); 138} | 105 return new BaseSetAssoc(this); 106} |