1/* 2 * Copyright (c) 2004-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: Kevin Lim 29 */ 30 31#include "base/trace.hh" 32 33#include "cpu/o3/free_list.hh" 34
|
35SimpleFreeList::SimpleFreeList(unsigned _numLogicalIntRegs,
|
35SimpleFreeList::SimpleFreeList(unsigned activeThreads, 36 unsigned _numLogicalIntRegs, |
37 unsigned _numPhysicalIntRegs, 38 unsigned _numLogicalFloatRegs, 39 unsigned _numPhysicalFloatRegs) 40 : numLogicalIntRegs(_numLogicalIntRegs), 41 numPhysicalIntRegs(_numPhysicalIntRegs), 42 numLogicalFloatRegs(_numLogicalFloatRegs), 43 numPhysicalFloatRegs(_numPhysicalFloatRegs), 44 numPhysicalRegs(numPhysicalIntRegs + numPhysicalFloatRegs) 45{
|
45 DPRINTF(FreeList, "FreeList: Creating new free list object.\n");
|
46 DPRINTF(FreeList, "Creating new free list object.\n"); |
47
|
47 // DEBUG stuff.
48 freeIntRegsScoreboard.resize(numPhysicalIntRegs);
49
50 freeFloatRegsScoreboard.resize(numPhysicalRegs);
51
52 for (PhysRegIndex i = 0; i < numLogicalIntRegs; ++i) {
53 freeIntRegsScoreboard[i] = 0;
54 }
55
|
48 // Put all of the extra physical registers onto the free list. This 49 // means excluding all of the base logical registers.
|
58 for (PhysRegIndex i = numLogicalIntRegs;
|
50 for (PhysRegIndex i = numLogicalIntRegs * activeThreads; |
51 i < numPhysicalIntRegs; ++i) 52 { 53 freeIntRegs.push(i);
|
62
63 freeIntRegsScoreboard[i] = 1;
|
54 } 55
|
66 for (PhysRegIndex i = 0; i < numPhysicalIntRegs + numLogicalFloatRegs;
67 ++i)
68 {
69 freeFloatRegsScoreboard[i] = 0;
70 }
71
|
56 // Put all of the extra physical registers onto the free list. This 57 // means excluding all of the base logical registers. Because the 58 // float registers' indices start where the physical registers end, 59 // some math must be done to determine where the free registers start.
|
76 for (PhysRegIndex i = numPhysicalIntRegs + numLogicalFloatRegs;
77 i < numPhysicalRegs; ++i)
|
60 PhysRegIndex i = numPhysicalIntRegs + (numLogicalFloatRegs * activeThreads); 61 62 for ( ; i < numPhysicalRegs; ++i) |
63 { 64 freeFloatRegs.push(i);
|
80
81 freeFloatRegsScoreboard[i] = 1;
|
65 } 66} 67
|
68std::string 69SimpleFreeList::name() const 70{ 71 return "cpu.freelist"; 72} |
|