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 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) 2003-2005,2014 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 */ 42 43/** 44 * @file 45 * Definitions of a base set associative tag store. 46 */ 47 48#include "mem/cache/tags/base_set_assoc.hh" 49 50#include <string> 51 52#include "base/intmath.hh" 53#include "sim/core.hh" 54 55using namespace std; 56 57BaseSetAssoc::BaseSetAssoc(const Params *p) 58 :BaseTags(p), assoc(p->assoc), allocAssoc(p->assoc), 59 blks(p->size / p->block_size), |
60 numSets(p->size / (p->block_size * p->assoc)), 61 sequentialAccess(p->sequential_access), 62 sets(p->size / (p->block_size * p->assoc)), 63 replacementPolicy(p->replacement_policy) 64{ 65 // Check parameters 66 if (blkSize < 4 || !isPowerOf2(blkSize)) { 67 fatal("Block size must be at least 4 and a power of 2"); 68 } 69 if (!isPowerOf2(numSets)) { 70 fatal("# of sets must be non-zero and a power of 2"); 71 } 72 if (assoc <= 0) { 73 fatal("associativity must be greater than zero"); 74 } 75 76 setShift = floorLog2(blkSize); 77 setMask = numSets - 1; 78 tagShift = setShift + floorLog2(numSets); 79 80 unsigned blkIndex = 0; // index into blks array 81 for (unsigned i = 0; i < numSets; ++i) { 82 sets[i].assoc = assoc; 83 84 sets[i].blks.resize(assoc); 85 86 // link in the data blocks 87 for (unsigned j = 0; j < assoc; ++j) { 88 // Select block within the set to be linked 89 BlkType*& blk = sets[i].blks[j]; 90 91 // Locate next cache block 92 blk = &blks[blkIndex]; 93 94 // Associate a data chunk to the block 95 blk->data = &dataBlks[blkSize*blkIndex]; 96 97 // Setting the tag to j is just to prevent long chains in the 98 // hash table; won't matter because the block is invalid 99 blk->tag = j; 100 101 // Set its set and way 102 blk->set = i; 103 blk->way = j; 104 105 // Update block index 106 ++blkIndex; 107 } 108 } 109} 110 111CacheBlk* 112BaseSetAssoc::findBlock(Addr addr, bool is_secure) const 113{ 114 Addr tag = extractTag(addr); 115 unsigned set = extractSet(addr); 116 BlkType *blk = sets[set].findBlk(tag, is_secure); 117 return blk; 118} 119 120CacheBlk* 121BaseSetAssoc::findBlockBySetAndWay(int set, int way) const 122{ 123 return sets[set].blks[way]; 124} 125 126std::string 127BaseSetAssoc::print() const { 128 std::string cache_state; 129 for (unsigned i = 0; i < numSets; ++i) { 130 // link in the data blocks 131 for (unsigned j = 0; j < assoc; ++j) { 132 BlkType *blk = sets[i].blks[j]; 133 if (blk->isValid()) 134 cache_state += csprintf("\tset: %d block: %d %s\n", i, j, 135 blk->print()); 136 } 137 } 138 if (cache_state.empty()) 139 cache_state = "no valid tags\n"; 140 return cache_state; 141} 142 143void 144BaseSetAssoc::cleanupRefs() 145{ 146 for (unsigned i = 0; i < numSets*assoc; ++i) { 147 if (blks[i].isValid()) { 148 totalRefs += blks[i].refCount; 149 ++sampledRefs; 150 } 151 } 152} 153 154void 155BaseSetAssoc::computeStats() 156{ 157 for (unsigned i = 0; i < ContextSwitchTaskId::NumTaskId; ++i) { 158 occupanciesTaskId[i] = 0; 159 for (unsigned j = 0; j < 5; ++j) { 160 ageTaskId[i][j] = 0; 161 } 162 } 163 164 for (unsigned i = 0; i < numSets * assoc; ++i) { 165 if (blks[i].isValid()) { 166 assert(blks[i].task_id < ContextSwitchTaskId::NumTaskId); 167 occupanciesTaskId[blks[i].task_id]++; 168 assert(blks[i].tickInserted <= curTick()); 169 Tick age = curTick() - blks[i].tickInserted; 170 171 int age_index; 172 if (age / SimClock::Int::us < 10) { // <10us 173 age_index = 0; 174 } else if (age / SimClock::Int::us < 100) { // <100us 175 age_index = 1; 176 } else if (age / SimClock::Int::ms < 1) { // <1ms 177 age_index = 2; 178 } else if (age / SimClock::Int::ms < 10) { // <10ms 179 age_index = 3; 180 } else 181 age_index = 4; // >10ms 182 183 ageTaskId[blks[i].task_id][age_index]++; 184 } 185 } 186} 187 188BaseSetAssoc * 189BaseSetAssocParams::create() 190{ 191 return new BaseSetAssoc(this); 192} |