1/* 2 * Copyright (c) 2015-2017 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) 2004-2005 The Regents of The University of Michigan 15 * Copyright (c) 2013 Advanced Micro Devices, Inc. 16 * All rights reserved. 17 * 18 * Redistribution and use in source and binary forms, with or without 19 * modification, are permitted provided that the following conditions are 20 * met: redistributions of source code must retain the above copyright 21 * notice, this list of conditions and the following disclaimer; 22 * redistributions in binary form must reproduce the above copyright 23 * notice, this list of conditions and the following disclaimer in the 24 * documentation and/or other materials provided with the distribution; 25 * neither the name of the copyright holders nor the names of its 26 * contributors may be used to endorse or promote products derived from 27 * this software without specific prior written permission. 28 * 29 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 30 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 31 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 32 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 33 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 34 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 35 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 36 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 37 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 38 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 39 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 40 * 41 * Authors: Kevin Lim 42 * Steve Reinhardt 43 */ 44 45#ifndef __CPU_O3_RENAME_MAP_HH__ 46#define __CPU_O3_RENAME_MAP_HH__ 47 48#include <iostream> 49#include <utility> 50#include <vector> 51 52#include "arch/types.hh" 53#include "config/the_isa.hh" 54#include "cpu/o3/free_list.hh" 55#include "cpu/o3/regfile.hh" 56#include "cpu/reg_class.hh" 57#include "enums/VecRegRenameMode.hh" 58 59/** 60 * Register rename map for a single class of registers (e.g., integer 61 * or floating point). Because the register class is implicitly 62 * determined by the rename map instance being accessed, all 63 * architectural register index parameters and values in this class 64 * are relative (e.g., %fp2 is just index 2). 65 */ 66class SimpleRenameMap 67{ 68 private: 69 using Arch2PhysMap = std::vector<PhysRegIdPtr>; 70 /** The acutal arch-to-phys register map */ 71 Arch2PhysMap map; 72 public: 73 using iterator = Arch2PhysMap::iterator; 74 using const_iterator = Arch2PhysMap::const_iterator; 75 private: 76 77 /** 78 * Pointer to the free list from which new physical registers 79 * should be allocated in rename() 80 */ 81 SimpleFreeList *freeList; 82 83 /** 84 * The architectural index of the zero register. This register is 85 * mapped but read-only, so we ignore attempts to rename it via 86 * the rename() method. If there is no such register for this map 87 * table, it should be set to an invalid index so that it never 88 * matches. 89 */ 90 RegId zeroReg; 91 92 public: 93 94 SimpleRenameMap(); 95 96 ~SimpleRenameMap() {}; 97 98 /** 99 * Because we have an array of rename maps (one per thread) in the CPU, 100 * it's awkward to initialize this object via the constructor. 101 * Instead, this method is used for initialization. 102 */ 103 void init(unsigned size, SimpleFreeList *_freeList, RegIndex _zeroReg); 104 105 /** 106 * Pair of a physical register and a physical register. Used to 107 * return the physical register that a logical register has been 108 * renamed to, and the previous physical register that the same 109 * logical register was previously mapped to. 110 */ 111 typedef std::pair<PhysRegIdPtr, PhysRegIdPtr> RenameInfo; 112 113 /** 114 * Tell rename map to get a new free physical register to remap 115 * the specified architectural register. 116 * @param arch_reg The architectural register to remap. 117 * @return A RenameInfo pair indicating both the new and previous 118 * physical registers. 119 */ 120 RenameInfo rename(const RegId& arch_reg); 121 122 /** 123 * Look up the physical register mapped to an architectural register. 124 * @param arch_reg The architectural register to look up. 125 * @return The physical register it is currently mapped to. 126 */ 127 PhysRegIdPtr lookup(const RegId& arch_reg) const 128 { 129 assert(arch_reg.flatIndex() <= map.size()); 130 return map[arch_reg.flatIndex()]; 131 } 132 133 /** 134 * Update rename map with a specific mapping. Generally used to 135 * roll back to old mappings on a squash. 136 * @param arch_reg The architectural register to remap. 137 * @param phys_reg The physical register to remap it to. 138 */ 139 void setEntry(const RegId& arch_reg, PhysRegIdPtr phys_reg) 140 { 141 assert(arch_reg.flatIndex() <= map.size()); 142 map[arch_reg.flatIndex()] = phys_reg; 143 } 144 145 /** Return the number of free entries on the associated free list. */ 146 unsigned numFreeEntries() const { return freeList->numFreeRegs(); } 147 148 /** Forward begin/cbegin to the map. */ 149 /** @{ */ 150 iterator begin() { return map.begin(); } 151 const_iterator begin() const { return map.begin(); } 152 const_iterator cbegin() const { return map.cbegin(); } 153 /** @} */ 154 155 /** Forward end/cend to the map. */ 156 /** @{ */ 157 iterator end() { return map.end(); } 158 const_iterator end() const { return map.end(); } 159 const_iterator cend() const { return map.cend(); } 160 /** @} */ 161}; 162 163/** 164 * Unified register rename map for all classes of registers. Wraps a 165 * set of class-specific rename maps. Methods that do not specify a 166 * register class (e.g., rename()) take register ids, 167 * while methods that do specify a register class (e.g., renameInt()) 168 * take register indices. 169 */ 170class UnifiedRenameMap 171{ 172 private: 173 static constexpr uint32_t NVecElems = TheISA::NumVecElemPerVecReg; 174 using VecReg = TheISA::VecReg; 175 using VecPredReg = TheISA::VecPredReg; 176 177 /** The integer register rename map */ 178 SimpleRenameMap intMap; 179 180 /** The floating-point register rename map */ 181 SimpleRenameMap floatMap; 182 183 /** The condition-code register rename map */ 184 SimpleRenameMap ccMap; 185 186 /** The vector register rename map */ 187 SimpleRenameMap vecMap; 188 189 /** The vector element register rename map */ 190 SimpleRenameMap vecElemMap; 191 192 /** The predicate register rename map */ 193 SimpleRenameMap predMap; 194 195 using VecMode = Enums::VecRegRenameMode; 196 VecMode vecMode; 197 198 /** 199 * The register file object is used only to get PhysRegIdPtr 200 * on MiscRegs, as they are stored in it. 201 */ 202 PhysRegFile *regFile; 203 204 public: 205 206 typedef SimpleRenameMap::RenameInfo RenameInfo; 207 208 /** Default constructor. init() must be called prior to use. */ 209 UnifiedRenameMap() : regFile(nullptr) {}; 210 211 /** Destructor. */ 212 ~UnifiedRenameMap() {}; 213 214 /** Initializes rename map with given parameters. */ 215 void init(PhysRegFile *_regFile, 216 RegIndex _intZeroReg, 217 RegIndex _floatZeroReg, 218 UnifiedFreeList *freeList, 219 VecMode _mode); 220 221 /** 222 * Tell rename map to get a new free physical register to remap 223 * the specified architectural register. This version takes a 224 * RegId and reads the appropriate class-specific rename table. 225 * @param arch_reg The architectural register id to remap. 226 * @return A RenameInfo pair indicating both the new and previous 227 * physical registers. 228 */ 229 RenameInfo rename(const RegId& arch_reg) 230 { 231 switch (arch_reg.classValue()) { 232 case IntRegClass: 233 return intMap.rename(arch_reg); 234 case FloatRegClass: 235 return floatMap.rename(arch_reg); 236 case VecRegClass: 237 assert(vecMode == Enums::Full); 238 return vecMap.rename(arch_reg); 239 case VecElemClass: 240 assert(vecMode == Enums::Elem); 241 return vecElemMap.rename(arch_reg); 242 case VecPredRegClass: 243 return predMap.rename(arch_reg); 244 case CCRegClass: 245 return ccMap.rename(arch_reg); 246 case MiscRegClass: 247 { 248 // misc regs aren't really renamed, just remapped 249 PhysRegIdPtr phys_reg = lookup(arch_reg); 250 // Set the new register to the previous one to keep the same 251 // mapping throughout the execution. 252 return RenameInfo(phys_reg, phys_reg); 253 } 254 255 default: 256 panic("rename rename(): unknown reg class %s\n", 257 arch_reg.className()); 258 } 259 } 260 261 /** 262 * Look up the physical register mapped to an architectural register. 263 * This version takes a flattened architectural register id 264 * and calls the appropriate class-specific rename table. 265 * @param arch_reg The architectural register to look up. 266 * @return The physical register it is currently mapped to. 267 */ 268 PhysRegIdPtr lookup(const RegId& arch_reg) const 269 { 270 switch (arch_reg.classValue()) { 271 case IntRegClass: 272 return intMap.lookup(arch_reg); 273 274 case FloatRegClass: 275 return floatMap.lookup(arch_reg); 276 277 case VecRegClass: 278 assert(vecMode == Enums::Full); 279 return vecMap.lookup(arch_reg); 280 281 case VecElemClass: 282 assert(vecMode == Enums::Elem); 283 return vecElemMap.lookup(arch_reg); 284 285 case VecPredRegClass: 286 return predMap.lookup(arch_reg); 287 288 case CCRegClass: 289 return ccMap.lookup(arch_reg); 290 291 case MiscRegClass: 292 // misc regs aren't really renamed, they keep the same 293 // mapping throughout the execution. 294 return regFile->getMiscRegId(arch_reg.flatIndex()); 295 296 default: 297 panic("rename lookup(): unknown reg class %s\n", 298 arch_reg.className()); 299 } 300 } 301 302 /** 303 * Update rename map with a specific mapping. Generally used to 304 * roll back to old mappings on a squash. This version takes a 305 * flattened architectural register id and calls the 306 * appropriate class-specific rename table. 307 * @param arch_reg The architectural register to remap. 308 * @param phys_reg The physical register to remap it to. 309 */ 310 void setEntry(const RegId& arch_reg, PhysRegIdPtr phys_reg) 311 { 312 switch (arch_reg.classValue()) { 313 case IntRegClass: 314 assert(phys_reg->isIntPhysReg()); 315 return intMap.setEntry(arch_reg, phys_reg); 316 317 case FloatRegClass: 318 assert(phys_reg->isFloatPhysReg()); 319 return floatMap.setEntry(arch_reg, phys_reg); 320 321 case VecRegClass: 322 assert(phys_reg->isVectorPhysReg()); 323 assert(vecMode == Enums::Full); 324 return vecMap.setEntry(arch_reg, phys_reg); 325 326 case VecElemClass: 327 assert(phys_reg->isVectorPhysElem()); 328 assert(vecMode == Enums::Elem); 329 return vecElemMap.setEntry(arch_reg, phys_reg); 330 331 case VecPredRegClass: 332 assert(phys_reg->isVecPredPhysReg()); 333 return predMap.setEntry(arch_reg, phys_reg); 334 335 case CCRegClass: 336 assert(phys_reg->isCCPhysReg()); 337 return ccMap.setEntry(arch_reg, phys_reg); 338 339 case MiscRegClass: 340 // Misc registers do not actually rename, so don't change 341 // their mappings. We end up here when a commit or squash 342 // tries to update or undo a hardwired misc reg nmapping, 343 // which should always be setting it to what it already is. 344 assert(phys_reg == lookup(arch_reg)); 345 return; 346 347 default: 348 panic("rename setEntry(): unknown reg class %s\n", 349 arch_reg.className()); 350 } 351 } 352 353 /** 354 * Return the minimum number of free entries across all of the 355 * register classes. The minimum is used so we guarantee that 356 * this number of entries is available regardless of which class 357 * of registers is requested. 358 */ 359 unsigned numFreeEntries() const 360 { 361 return std::min(std::min( 362 std::min(intMap.numFreeEntries(), floatMap.numFreeEntries()), 363 vecMode == Enums::Full ? vecMap.numFreeEntries() 364 : vecElemMap.numFreeEntries()), 365 predMap.numFreeEntries()); 366 } 367 368 unsigned numFreeIntEntries() const { return intMap.numFreeEntries(); } 369 unsigned numFreeFloatEntries() const { return floatMap.numFreeEntries(); } 370 unsigned numFreeVecEntries() const 371 { 372 return vecMode == Enums::Full 373 ? vecMap.numFreeEntries() 374 : vecElemMap.numFreeEntries(); 375 } 376 unsigned numFreePredEntries() const { return predMap.numFreeEntries(); } 377 unsigned numFreeCCEntries() const { return ccMap.numFreeEntries(); } 378 379 /** 380 * Return whether there are enough registers to serve the request. 381 */ 382 bool canRename(uint32_t intRegs, uint32_t floatRegs, uint32_t vectorRegs, 383 uint32_t vecElemRegs, uint32_t vecPredRegs, 384 uint32_t ccRegs) const 385 { 386 return intRegs <= intMap.numFreeEntries() && 387 floatRegs <= floatMap.numFreeEntries() && 388 vectorRegs <= vecMap.numFreeEntries() && 389 vecElemRegs <= vecElemMap.numFreeEntries() && 390 vecPredRegs <= predMap.numFreeEntries() && 391 ccRegs <= ccMap.numFreeEntries(); 392 } 393 /** 394 * Set vector mode to Full or Elem. 395 * Ignore 'silent' modifications. 396 * 397 * @param newVecMode new vector renaming mode 398 */ 399 void switchMode(VecMode newVecMode); 400 401 /** 402 * Switch freeList of registers from Full to Elem or vicevers 403 * depending on vecMode (vector renaming mode). 404 */ 405 void switchFreeList(UnifiedFreeList* freeList); 406 407}; 408 409#endif //__CPU_O3_RENAME_MAP_HH__ 410