inst_queue_impl.hh revision 10510
11689SN/A/* 210333Smitch.hayenga@arm.com * Copyright (c) 2011-2014 ARM Limited 39920Syasuko.eckert@amd.com * Copyright (c) 2013 Advanced Micro Devices, Inc. 47944SGiacomo.Gabrielli@arm.com * All rights reserved. 57944SGiacomo.Gabrielli@arm.com * 67944SGiacomo.Gabrielli@arm.com * The license below extends only to copyright in the software and shall 77944SGiacomo.Gabrielli@arm.com * not be construed as granting a license to any other intellectual 87944SGiacomo.Gabrielli@arm.com * property including but not limited to intellectual property relating 97944SGiacomo.Gabrielli@arm.com * to a hardware implementation of the functionality of the software 107944SGiacomo.Gabrielli@arm.com * licensed hereunder. You may use the software subject to the license 117944SGiacomo.Gabrielli@arm.com * terms below provided that you ensure that this notice is replicated 127944SGiacomo.Gabrielli@arm.com * unmodified and in its entirety in all distributions of the software, 137944SGiacomo.Gabrielli@arm.com * modified or unmodified, in source code or in binary form. 147944SGiacomo.Gabrielli@arm.com * 152326SN/A * Copyright (c) 2004-2006 The Regents of The University of Michigan 161689SN/A * All rights reserved. 171689SN/A * 181689SN/A * Redistribution and use in source and binary forms, with or without 191689SN/A * modification, are permitted provided that the following conditions are 201689SN/A * met: redistributions of source code must retain the above copyright 211689SN/A * notice, this list of conditions and the following disclaimer; 221689SN/A * redistributions in binary form must reproduce the above copyright 231689SN/A * notice, this list of conditions and the following disclaimer in the 241689SN/A * documentation and/or other materials provided with the distribution; 251689SN/A * neither the name of the copyright holders nor the names of its 261689SN/A * contributors may be used to endorse or promote products derived from 271689SN/A * this software without specific prior written permission. 281689SN/A * 291689SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 301689SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 311689SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 321689SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 331689SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 341689SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 351689SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 361689SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 371689SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 381689SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 391689SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 402665Ssaidi@eecs.umich.edu * 412665Ssaidi@eecs.umich.edu * Authors: Kevin Lim 422831Sksewell@umich.edu * Korey Sewell 431689SN/A */ 441689SN/A 459944Smatt.horsnell@ARM.com#ifndef __CPU_O3_INST_QUEUE_IMPL_HH__ 469944Smatt.horsnell@ARM.com#define __CPU_O3_INST_QUEUE_IMPL_HH__ 479944Smatt.horsnell@ARM.com 482064SN/A#include <limits> 491060SN/A#include <vector> 501060SN/A 512292SN/A#include "cpu/o3/fu_pool.hh" 521717SN/A#include "cpu/o3/inst_queue.hh" 538232Snate@binkert.org#include "debug/IQ.hh" 544762Snate@binkert.org#include "enums/OpClass.hh" 556221Snate@binkert.org#include "params/DerivO3CPU.hh" 564762Snate@binkert.org#include "sim/core.hh" 571060SN/A 588737Skoansin.tan@gmail.com// clang complains about std::set being overloaded with Packet::set if 598737Skoansin.tan@gmail.com// we open up the entire namespace std 608737Skoansin.tan@gmail.comusing std::list; 615529Snate@binkert.org 621061SN/Atemplate <class Impl> 632292SN/AInstructionQueue<Impl>::FUCompletion::FUCompletion(DynInstPtr &_inst, 645606Snate@binkert.org int fu_idx, InstructionQueue<Impl> *iq_ptr) 658581Ssteve.reinhardt@amd.com : Event(Stat_Event_Pri, AutoDelete), 668581Ssteve.reinhardt@amd.com inst(_inst), fuIdx(fu_idx), iqPtr(iq_ptr), freeFU(false) 671060SN/A{ 682292SN/A} 692292SN/A 702292SN/Atemplate <class Impl> 712292SN/Avoid 722292SN/AInstructionQueue<Impl>::FUCompletion::process() 732292SN/A{ 742326SN/A iqPtr->processFUCompletion(inst, freeFU ? fuIdx : -1); 752292SN/A inst = NULL; 762292SN/A} 772292SN/A 782292SN/A 792292SN/Atemplate <class Impl> 802292SN/Aconst char * 815336Shines@cs.fsu.eduInstructionQueue<Impl>::FUCompletion::description() const 822292SN/A{ 834873Sstever@eecs.umich.edu return "Functional unit completion"; 842292SN/A} 852292SN/A 862292SN/Atemplate <class Impl> 874329Sktlim@umich.eduInstructionQueue<Impl>::InstructionQueue(O3CPU *cpu_ptr, IEW *iew_ptr, 885529Snate@binkert.org DerivO3CPUParams *params) 894329Sktlim@umich.edu : cpu(cpu_ptr), 904329Sktlim@umich.edu iewStage(iew_ptr), 914329Sktlim@umich.edu fuPool(params->fuPool), 922292SN/A numEntries(params->numIQEntries), 932292SN/A totalWidth(params->issueWidth), 942292SN/A commitToIEWDelay(params->commitToIEWDelay) 952292SN/A{ 962292SN/A assert(fuPool); 972292SN/A 985529Snate@binkert.org numThreads = params->numThreads; 991060SN/A 1009920Syasuko.eckert@amd.com // Set the number of total physical registers 1019920Syasuko.eckert@amd.com numPhysRegs = params->numPhysIntRegs + params->numPhysFloatRegs + 1029920Syasuko.eckert@amd.com params->numPhysCCRegs; 1031060SN/A 1041060SN/A //Create an entry for each physical register within the 1051060SN/A //dependency graph. 1062326SN/A dependGraph.resize(numPhysRegs); 1071060SN/A 1081060SN/A // Resize the register scoreboard. 1091060SN/A regScoreboard.resize(numPhysRegs); 1101060SN/A 1112292SN/A //Initialize Mem Dependence Units 1126221Snate@binkert.org for (ThreadID tid = 0; tid < numThreads; tid++) { 1136221Snate@binkert.org memDepUnit[tid].init(params, tid); 1146221Snate@binkert.org memDepUnit[tid].setIQ(this); 1151060SN/A } 1161060SN/A 1172307SN/A resetState(); 1182292SN/A 1192980Sgblack@eecs.umich.edu std::string policy = params->smtIQPolicy; 1202292SN/A 1212292SN/A //Convert string to lowercase 1222292SN/A std::transform(policy.begin(), policy.end(), policy.begin(), 1232292SN/A (int(*)(int)) tolower); 1242292SN/A 1252292SN/A //Figure out resource sharing policy 1262292SN/A if (policy == "dynamic") { 1272292SN/A iqPolicy = Dynamic; 1282292SN/A 1292292SN/A //Set Max Entries to Total ROB Capacity 1306221Snate@binkert.org for (ThreadID tid = 0; tid < numThreads; tid++) { 1316221Snate@binkert.org maxEntries[tid] = numEntries; 1322292SN/A } 1332292SN/A 1342292SN/A } else if (policy == "partitioned") { 1352292SN/A iqPolicy = Partitioned; 1362292SN/A 1372292SN/A //@todo:make work if part_amt doesnt divide evenly. 1382292SN/A int part_amt = numEntries / numThreads; 1392292SN/A 1402292SN/A //Divide ROB up evenly 1416221Snate@binkert.org for (ThreadID tid = 0; tid < numThreads; tid++) { 1426221Snate@binkert.org maxEntries[tid] = part_amt; 1432292SN/A } 1442292SN/A 1452831Sksewell@umich.edu DPRINTF(IQ, "IQ sharing policy set to Partitioned:" 1462292SN/A "%i entries per thread.\n",part_amt); 1472292SN/A } else if (policy == "threshold") { 1482292SN/A iqPolicy = Threshold; 1492292SN/A 1502292SN/A double threshold = (double)params->smtIQThreshold / 100; 1512292SN/A 1522292SN/A int thresholdIQ = (int)((double)threshold * numEntries); 1532292SN/A 1542292SN/A //Divide up by threshold amount 1556221Snate@binkert.org for (ThreadID tid = 0; tid < numThreads; tid++) { 1566221Snate@binkert.org maxEntries[tid] = thresholdIQ; 1572292SN/A } 1582292SN/A 1592831Sksewell@umich.edu DPRINTF(IQ, "IQ sharing policy set to Threshold:" 1602292SN/A "%i entries per thread.\n",thresholdIQ); 1612292SN/A } else { 1622292SN/A assert(0 && "Invalid IQ Sharing Policy.Options Are:{Dynamic," 1632292SN/A "Partitioned, Threshold}"); 1642292SN/A } 1652292SN/A} 1662292SN/A 1672292SN/Atemplate <class Impl> 1682292SN/AInstructionQueue<Impl>::~InstructionQueue() 1692292SN/A{ 1702326SN/A dependGraph.reset(); 1712348SN/A#ifdef DEBUG 1722326SN/A cprintf("Nodes traversed: %i, removed: %i\n", 1732326SN/A dependGraph.nodesTraversed, dependGraph.nodesRemoved); 1742348SN/A#endif 1752292SN/A} 1762292SN/A 1772292SN/Atemplate <class Impl> 1782292SN/Astd::string 1792292SN/AInstructionQueue<Impl>::name() const 1802292SN/A{ 1812292SN/A return cpu->name() + ".iq"; 1821060SN/A} 1831060SN/A 1841061SN/Atemplate <class Impl> 1851060SN/Avoid 1861062SN/AInstructionQueue<Impl>::regStats() 1871062SN/A{ 1882301SN/A using namespace Stats; 1891062SN/A iqInstsAdded 1901062SN/A .name(name() + ".iqInstsAdded") 1911062SN/A .desc("Number of instructions added to the IQ (excludes non-spec)") 1921062SN/A .prereq(iqInstsAdded); 1931062SN/A 1941062SN/A iqNonSpecInstsAdded 1951062SN/A .name(name() + ".iqNonSpecInstsAdded") 1961062SN/A .desc("Number of non-speculative instructions added to the IQ") 1971062SN/A .prereq(iqNonSpecInstsAdded); 1981062SN/A 1992301SN/A iqInstsIssued 2002301SN/A .name(name() + ".iqInstsIssued") 2012301SN/A .desc("Number of instructions issued") 2022301SN/A .prereq(iqInstsIssued); 2031062SN/A 2041062SN/A iqIntInstsIssued 2051062SN/A .name(name() + ".iqIntInstsIssued") 2061062SN/A .desc("Number of integer instructions issued") 2071062SN/A .prereq(iqIntInstsIssued); 2081062SN/A 2091062SN/A iqFloatInstsIssued 2101062SN/A .name(name() + ".iqFloatInstsIssued") 2111062SN/A .desc("Number of float instructions issued") 2121062SN/A .prereq(iqFloatInstsIssued); 2131062SN/A 2141062SN/A iqBranchInstsIssued 2151062SN/A .name(name() + ".iqBranchInstsIssued") 2161062SN/A .desc("Number of branch instructions issued") 2171062SN/A .prereq(iqBranchInstsIssued); 2181062SN/A 2191062SN/A iqMemInstsIssued 2201062SN/A .name(name() + ".iqMemInstsIssued") 2211062SN/A .desc("Number of memory instructions issued") 2221062SN/A .prereq(iqMemInstsIssued); 2231062SN/A 2241062SN/A iqMiscInstsIssued 2251062SN/A .name(name() + ".iqMiscInstsIssued") 2261062SN/A .desc("Number of miscellaneous instructions issued") 2271062SN/A .prereq(iqMiscInstsIssued); 2281062SN/A 2291062SN/A iqSquashedInstsIssued 2301062SN/A .name(name() + ".iqSquashedInstsIssued") 2311062SN/A .desc("Number of squashed instructions issued") 2321062SN/A .prereq(iqSquashedInstsIssued); 2331062SN/A 2341062SN/A iqSquashedInstsExamined 2351062SN/A .name(name() + ".iqSquashedInstsExamined") 2361062SN/A .desc("Number of squashed instructions iterated over during squash;" 2371062SN/A " mainly for profiling") 2381062SN/A .prereq(iqSquashedInstsExamined); 2391062SN/A 2401062SN/A iqSquashedOperandsExamined 2411062SN/A .name(name() + ".iqSquashedOperandsExamined") 2421062SN/A .desc("Number of squashed operands that are examined and possibly " 2431062SN/A "removed from graph") 2441062SN/A .prereq(iqSquashedOperandsExamined); 2451062SN/A 2461062SN/A iqSquashedNonSpecRemoved 2471062SN/A .name(name() + ".iqSquashedNonSpecRemoved") 2481062SN/A .desc("Number of squashed non-spec instructions that were removed") 2491062SN/A .prereq(iqSquashedNonSpecRemoved); 2502361SN/A/* 2512326SN/A queueResDist 2522301SN/A .init(Num_OpClasses, 0, 99, 2) 2532301SN/A .name(name() + ".IQ:residence:") 2542301SN/A .desc("cycles from dispatch to issue") 2552301SN/A .flags(total | pdf | cdf ) 2562301SN/A ; 2572301SN/A for (int i = 0; i < Num_OpClasses; ++i) { 2582326SN/A queueResDist.subname(i, opClassStrings[i]); 2592301SN/A } 2602361SN/A*/ 2612326SN/A numIssuedDist 2622307SN/A .init(0,totalWidth,1) 2638240Snate@binkert.org .name(name() + ".issued_per_cycle") 2642301SN/A .desc("Number of insts issued each cycle") 2652307SN/A .flags(pdf) 2662301SN/A ; 2672301SN/A/* 2682301SN/A dist_unissued 2692301SN/A .init(Num_OpClasses+2) 2708240Snate@binkert.org .name(name() + ".unissued_cause") 2712301SN/A .desc("Reason ready instruction not issued") 2722301SN/A .flags(pdf | dist) 2732301SN/A ; 2742301SN/A for (int i=0; i < (Num_OpClasses + 2); ++i) { 2752301SN/A dist_unissued.subname(i, unissued_names[i]); 2762301SN/A } 2772301SN/A*/ 2782326SN/A statIssuedInstType 2794762Snate@binkert.org .init(numThreads,Enums::Num_OpClass) 2808240Snate@binkert.org .name(name() + ".FU_type") 2812301SN/A .desc("Type of FU issued") 2822301SN/A .flags(total | pdf | dist) 2832301SN/A ; 2844762Snate@binkert.org statIssuedInstType.ysubnames(Enums::OpClassStrings); 2852301SN/A 2862301SN/A // 2872301SN/A // How long did instructions for a particular FU type wait prior to issue 2882301SN/A // 2892361SN/A/* 2902326SN/A issueDelayDist 2912301SN/A .init(Num_OpClasses,0,99,2) 2928240Snate@binkert.org .name(name() + ".") 2932301SN/A .desc("cycles from operands ready to issue") 2942301SN/A .flags(pdf | cdf) 2952301SN/A ; 2962301SN/A 2972301SN/A for (int i=0; i<Num_OpClasses; ++i) { 2982980Sgblack@eecs.umich.edu std::stringstream subname; 2992301SN/A subname << opClassStrings[i] << "_delay"; 3002326SN/A issueDelayDist.subname(i, subname.str()); 3012301SN/A } 3022361SN/A*/ 3032326SN/A issueRate 3048240Snate@binkert.org .name(name() + ".rate") 3052301SN/A .desc("Inst issue rate") 3062301SN/A .flags(total) 3072301SN/A ; 3082326SN/A issueRate = iqInstsIssued / cpu->numCycles; 3092727Sktlim@umich.edu 3102326SN/A statFuBusy 3112301SN/A .init(Num_OpClasses) 3128240Snate@binkert.org .name(name() + ".fu_full") 3132301SN/A .desc("attempts to use FU when none available") 3142301SN/A .flags(pdf | dist) 3152301SN/A ; 3162301SN/A for (int i=0; i < Num_OpClasses; ++i) { 3174762Snate@binkert.org statFuBusy.subname(i, Enums::OpClassStrings[i]); 3182301SN/A } 3192301SN/A 3202326SN/A fuBusy 3212301SN/A .init(numThreads) 3228240Snate@binkert.org .name(name() + ".fu_busy_cnt") 3232301SN/A .desc("FU busy when requested") 3242301SN/A .flags(total) 3252301SN/A ; 3262301SN/A 3272326SN/A fuBusyRate 3288240Snate@binkert.org .name(name() + ".fu_busy_rate") 3292301SN/A .desc("FU busy rate (busy events/executed inst)") 3302301SN/A .flags(total) 3312301SN/A ; 3322326SN/A fuBusyRate = fuBusy / iqInstsIssued; 3332301SN/A 3346221Snate@binkert.org for (ThreadID tid = 0; tid < numThreads; tid++) { 3352292SN/A // Tell mem dependence unit to reg stats as well. 3366221Snate@binkert.org memDepUnit[tid].regStats(); 3372292SN/A } 3387897Shestness@cs.utexas.edu 3397897Shestness@cs.utexas.edu intInstQueueReads 3407897Shestness@cs.utexas.edu .name(name() + ".int_inst_queue_reads") 3417897Shestness@cs.utexas.edu .desc("Number of integer instruction queue reads") 3427897Shestness@cs.utexas.edu .flags(total); 3437897Shestness@cs.utexas.edu 3447897Shestness@cs.utexas.edu intInstQueueWrites 3457897Shestness@cs.utexas.edu .name(name() + ".int_inst_queue_writes") 3467897Shestness@cs.utexas.edu .desc("Number of integer instruction queue writes") 3477897Shestness@cs.utexas.edu .flags(total); 3487897Shestness@cs.utexas.edu 3497897Shestness@cs.utexas.edu intInstQueueWakeupAccesses 3507897Shestness@cs.utexas.edu .name(name() + ".int_inst_queue_wakeup_accesses") 3517897Shestness@cs.utexas.edu .desc("Number of integer instruction queue wakeup accesses") 3527897Shestness@cs.utexas.edu .flags(total); 3537897Shestness@cs.utexas.edu 3547897Shestness@cs.utexas.edu fpInstQueueReads 3557897Shestness@cs.utexas.edu .name(name() + ".fp_inst_queue_reads") 3567897Shestness@cs.utexas.edu .desc("Number of floating instruction queue reads") 3577897Shestness@cs.utexas.edu .flags(total); 3587897Shestness@cs.utexas.edu 3597897Shestness@cs.utexas.edu fpInstQueueWrites 3607897Shestness@cs.utexas.edu .name(name() + ".fp_inst_queue_writes") 3617897Shestness@cs.utexas.edu .desc("Number of floating instruction queue writes") 3627897Shestness@cs.utexas.edu .flags(total); 3637897Shestness@cs.utexas.edu 3647897Shestness@cs.utexas.edu fpInstQueueWakeupQccesses 3657897Shestness@cs.utexas.edu .name(name() + ".fp_inst_queue_wakeup_accesses") 3667897Shestness@cs.utexas.edu .desc("Number of floating instruction queue wakeup accesses") 3677897Shestness@cs.utexas.edu .flags(total); 3687897Shestness@cs.utexas.edu 3697897Shestness@cs.utexas.edu intAluAccesses 3707897Shestness@cs.utexas.edu .name(name() + ".int_alu_accesses") 3717897Shestness@cs.utexas.edu .desc("Number of integer alu accesses") 3727897Shestness@cs.utexas.edu .flags(total); 3737897Shestness@cs.utexas.edu 3747897Shestness@cs.utexas.edu fpAluAccesses 3757897Shestness@cs.utexas.edu .name(name() + ".fp_alu_accesses") 3767897Shestness@cs.utexas.edu .desc("Number of floating point alu accesses") 3777897Shestness@cs.utexas.edu .flags(total); 3787897Shestness@cs.utexas.edu 3791062SN/A} 3801062SN/A 3811062SN/Atemplate <class Impl> 3821062SN/Avoid 3832307SN/AInstructionQueue<Impl>::resetState() 3841060SN/A{ 3852307SN/A //Initialize thread IQ counts 3866221Snate@binkert.org for (ThreadID tid = 0; tid <numThreads; tid++) { 3876221Snate@binkert.org count[tid] = 0; 3886221Snate@binkert.org instList[tid].clear(); 3892307SN/A } 3901060SN/A 3912307SN/A // Initialize the number of free IQ entries. 3922307SN/A freeEntries = numEntries; 3932307SN/A 3942307SN/A // Note that in actuality, the registers corresponding to the logical 3952307SN/A // registers start off as ready. However this doesn't matter for the 3962307SN/A // IQ as the instruction should have been correctly told if those 3972307SN/A // registers are ready in rename. Thus it can all be initialized as 3982307SN/A // unready. 3992307SN/A for (int i = 0; i < numPhysRegs; ++i) { 4002307SN/A regScoreboard[i] = false; 4012307SN/A } 4022307SN/A 4036221Snate@binkert.org for (ThreadID tid = 0; tid < numThreads; ++tid) { 4046221Snate@binkert.org squashedSeqNum[tid] = 0; 4052307SN/A } 4062307SN/A 4072307SN/A for (int i = 0; i < Num_OpClasses; ++i) { 4082307SN/A while (!readyInsts[i].empty()) 4092307SN/A readyInsts[i].pop(); 4102307SN/A queueOnList[i] = false; 4112307SN/A readyIt[i] = listOrder.end(); 4122307SN/A } 4132307SN/A nonSpecInsts.clear(); 4142307SN/A listOrder.clear(); 4157944SGiacomo.Gabrielli@arm.com deferredMemInsts.clear(); 41610333Smitch.hayenga@arm.com blockedMemInsts.clear(); 41710333Smitch.hayenga@arm.com retryMemInsts.clear(); 4181060SN/A} 4191060SN/A 4201061SN/Atemplate <class Impl> 4211060SN/Avoid 4226221Snate@binkert.orgInstructionQueue<Impl>::setActiveThreads(list<ThreadID> *at_ptr) 4231060SN/A{ 4242292SN/A activeThreads = at_ptr; 4252064SN/A} 4262064SN/A 4272064SN/Atemplate <class Impl> 4282064SN/Avoid 4292292SN/AInstructionQueue<Impl>::setIssueToExecuteQueue(TimeBuffer<IssueStruct> *i2e_ptr) 4302064SN/A{ 4314318Sktlim@umich.edu issueToExecuteQueue = i2e_ptr; 4321060SN/A} 4331060SN/A 4341061SN/Atemplate <class Impl> 4351060SN/Avoid 4361060SN/AInstructionQueue<Impl>::setTimeBuffer(TimeBuffer<TimeStruct> *tb_ptr) 4371060SN/A{ 4381060SN/A timeBuffer = tb_ptr; 4391060SN/A 4401060SN/A fromCommit = timeBuffer->getWire(-commitToIEWDelay); 4411060SN/A} 4421060SN/A 4431684SN/Atemplate <class Impl> 44410510Smitch.hayenga@arm.combool 44510510Smitch.hayenga@arm.comInstructionQueue<Impl>::isDrained() const 44610510Smitch.hayenga@arm.com{ 44710510Smitch.hayenga@arm.com bool drained = dependGraph.empty() && instsToExecute.empty(); 44810510Smitch.hayenga@arm.com for (ThreadID tid = 0; tid < numThreads; ++tid) 44910510Smitch.hayenga@arm.com drained = drained && memDepUnit[tid].isDrained(); 45010510Smitch.hayenga@arm.com 45110510Smitch.hayenga@arm.com return drained; 45210510Smitch.hayenga@arm.com} 45310510Smitch.hayenga@arm.com 45410510Smitch.hayenga@arm.comtemplate <class Impl> 4552307SN/Avoid 4569444SAndreas.Sandberg@ARM.comInstructionQueue<Impl>::drainSanityCheck() const 4572307SN/A{ 4589444SAndreas.Sandberg@ARM.com assert(dependGraph.empty()); 4599444SAndreas.Sandberg@ARM.com assert(instsToExecute.empty()); 4609444SAndreas.Sandberg@ARM.com for (ThreadID tid = 0; tid < numThreads; ++tid) 4619444SAndreas.Sandberg@ARM.com memDepUnit[tid].drainSanityCheck(); 4622307SN/A} 4632307SN/A 4642307SN/Atemplate <class Impl> 4652307SN/Avoid 4662307SN/AInstructionQueue<Impl>::takeOverFrom() 4672307SN/A{ 4689444SAndreas.Sandberg@ARM.com resetState(); 4692307SN/A} 4702307SN/A 4712307SN/Atemplate <class Impl> 4722292SN/Aint 4736221Snate@binkert.orgInstructionQueue<Impl>::entryAmount(ThreadID num_threads) 4742292SN/A{ 4752292SN/A if (iqPolicy == Partitioned) { 4762292SN/A return numEntries / num_threads; 4772292SN/A } else { 4782292SN/A return 0; 4792292SN/A } 4802292SN/A} 4812292SN/A 4822292SN/A 4832292SN/Atemplate <class Impl> 4842292SN/Avoid 4852292SN/AInstructionQueue<Impl>::resetEntries() 4862292SN/A{ 4872292SN/A if (iqPolicy != Dynamic || numThreads > 1) { 4883867Sbinkertn@umich.edu int active_threads = activeThreads->size(); 4892292SN/A 4906221Snate@binkert.org list<ThreadID>::iterator threads = activeThreads->begin(); 4916221Snate@binkert.org list<ThreadID>::iterator end = activeThreads->end(); 4922292SN/A 4933867Sbinkertn@umich.edu while (threads != end) { 4946221Snate@binkert.org ThreadID tid = *threads++; 4953867Sbinkertn@umich.edu 4962292SN/A if (iqPolicy == Partitioned) { 4973867Sbinkertn@umich.edu maxEntries[tid] = numEntries / active_threads; 4982292SN/A } else if(iqPolicy == Threshold && active_threads == 1) { 4993867Sbinkertn@umich.edu maxEntries[tid] = numEntries; 5002292SN/A } 5012292SN/A } 5022292SN/A } 5032292SN/A} 5042292SN/A 5052292SN/Atemplate <class Impl> 5061684SN/Aunsigned 5071684SN/AInstructionQueue<Impl>::numFreeEntries() 5081684SN/A{ 5091684SN/A return freeEntries; 5101684SN/A} 5111684SN/A 5122292SN/Atemplate <class Impl> 5132292SN/Aunsigned 5146221Snate@binkert.orgInstructionQueue<Impl>::numFreeEntries(ThreadID tid) 5152292SN/A{ 5162292SN/A return maxEntries[tid] - count[tid]; 5172292SN/A} 5182292SN/A 5191060SN/A// Might want to do something more complex if it knows how many instructions 5201060SN/A// will be issued this cycle. 5211061SN/Atemplate <class Impl> 5221060SN/Abool 5231060SN/AInstructionQueue<Impl>::isFull() 5241060SN/A{ 5251060SN/A if (freeEntries == 0) { 5261060SN/A return(true); 5271060SN/A } else { 5281060SN/A return(false); 5291060SN/A } 5301060SN/A} 5311060SN/A 5321061SN/Atemplate <class Impl> 5332292SN/Abool 5346221Snate@binkert.orgInstructionQueue<Impl>::isFull(ThreadID tid) 5352292SN/A{ 5362292SN/A if (numFreeEntries(tid) == 0) { 5372292SN/A return(true); 5382292SN/A } else { 5392292SN/A return(false); 5402292SN/A } 5412292SN/A} 5422292SN/A 5432292SN/Atemplate <class Impl> 5442292SN/Abool 5452292SN/AInstructionQueue<Impl>::hasReadyInsts() 5462292SN/A{ 5472292SN/A if (!listOrder.empty()) { 5482292SN/A return true; 5492292SN/A } 5502292SN/A 5512292SN/A for (int i = 0; i < Num_OpClasses; ++i) { 5522292SN/A if (!readyInsts[i].empty()) { 5532292SN/A return true; 5542292SN/A } 5552292SN/A } 5562292SN/A 5572292SN/A return false; 5582292SN/A} 5592292SN/A 5602292SN/Atemplate <class Impl> 5611060SN/Avoid 5621061SN/AInstructionQueue<Impl>::insert(DynInstPtr &new_inst) 5631060SN/A{ 5647897Shestness@cs.utexas.edu new_inst->isFloating() ? fpInstQueueWrites++ : intInstQueueWrites++; 5651060SN/A // Make sure the instruction is valid 5661060SN/A assert(new_inst); 5671060SN/A 5687720Sgblack@eecs.umich.edu DPRINTF(IQ, "Adding instruction [sn:%lli] PC %s to the IQ.\n", 5697720Sgblack@eecs.umich.edu new_inst->seqNum, new_inst->pcState()); 5701060SN/A 5711060SN/A assert(freeEntries != 0); 5721060SN/A 5732292SN/A instList[new_inst->threadNumber].push_back(new_inst); 5741060SN/A 5752064SN/A --freeEntries; 5761060SN/A 5772292SN/A new_inst->setInIQ(); 5781060SN/A 5791060SN/A // Look through its source registers (physical regs), and mark any 5801060SN/A // dependencies. 5811060SN/A addToDependents(new_inst); 5821060SN/A 5831060SN/A // Have this instruction set itself as the producer of its destination 5841060SN/A // register(s). 5852326SN/A addToProducers(new_inst); 5861060SN/A 5871061SN/A if (new_inst->isMemRef()) { 5882292SN/A memDepUnit[new_inst->threadNumber].insert(new_inst); 5891062SN/A } else { 5901062SN/A addIfReady(new_inst); 5911061SN/A } 5921061SN/A 5931062SN/A ++iqInstsAdded; 5941060SN/A 5952292SN/A count[new_inst->threadNumber]++; 5962292SN/A 5971060SN/A assert(freeEntries == (numEntries - countInsts())); 5981060SN/A} 5991060SN/A 6001061SN/Atemplate <class Impl> 6011061SN/Avoid 6022292SN/AInstructionQueue<Impl>::insertNonSpec(DynInstPtr &new_inst) 6031061SN/A{ 6041061SN/A // @todo: Clean up this code; can do it by setting inst as unable 6051061SN/A // to issue, then calling normal insert on the inst. 6067897Shestness@cs.utexas.edu new_inst->isFloating() ? fpInstQueueWrites++ : intInstQueueWrites++; 6071061SN/A 6082292SN/A assert(new_inst); 6091061SN/A 6102292SN/A nonSpecInsts[new_inst->seqNum] = new_inst; 6111061SN/A 6127720Sgblack@eecs.umich.edu DPRINTF(IQ, "Adding non-speculative instruction [sn:%lli] PC %s " 6132326SN/A "to the IQ.\n", 6147720Sgblack@eecs.umich.edu new_inst->seqNum, new_inst->pcState()); 6152064SN/A 6161061SN/A assert(freeEntries != 0); 6171061SN/A 6182292SN/A instList[new_inst->threadNumber].push_back(new_inst); 6191061SN/A 6202064SN/A --freeEntries; 6211061SN/A 6222292SN/A new_inst->setInIQ(); 6231061SN/A 6241061SN/A // Have this instruction set itself as the producer of its destination 6251061SN/A // register(s). 6262326SN/A addToProducers(new_inst); 6271061SN/A 6281061SN/A // If it's a memory instruction, add it to the memory dependency 6291061SN/A // unit. 6302292SN/A if (new_inst->isMemRef()) { 6312292SN/A memDepUnit[new_inst->threadNumber].insertNonSpec(new_inst); 6321061SN/A } 6331062SN/A 6341062SN/A ++iqNonSpecInstsAdded; 6352292SN/A 6362292SN/A count[new_inst->threadNumber]++; 6372292SN/A 6382292SN/A assert(freeEntries == (numEntries - countInsts())); 6391061SN/A} 6401061SN/A 6411061SN/Atemplate <class Impl> 6421060SN/Avoid 6432292SN/AInstructionQueue<Impl>::insertBarrier(DynInstPtr &barr_inst) 6441060SN/A{ 6452292SN/A memDepUnit[barr_inst->threadNumber].insertBarrier(barr_inst); 6461060SN/A 6472292SN/A insertNonSpec(barr_inst); 6482292SN/A} 6491060SN/A 6502064SN/Atemplate <class Impl> 6512333SN/Atypename Impl::DynInstPtr 6522333SN/AInstructionQueue<Impl>::getInstToExecute() 6532333SN/A{ 6542333SN/A assert(!instsToExecute.empty()); 6552333SN/A DynInstPtr inst = instsToExecute.front(); 6562333SN/A instsToExecute.pop_front(); 6577897Shestness@cs.utexas.edu if (inst->isFloating()){ 6587897Shestness@cs.utexas.edu fpInstQueueReads++; 6597897Shestness@cs.utexas.edu } else { 6607897Shestness@cs.utexas.edu intInstQueueReads++; 6617897Shestness@cs.utexas.edu } 6622333SN/A return inst; 6632333SN/A} 6641060SN/A 6652333SN/Atemplate <class Impl> 6662064SN/Avoid 6672292SN/AInstructionQueue<Impl>::addToOrderList(OpClass op_class) 6682292SN/A{ 6692292SN/A assert(!readyInsts[op_class].empty()); 6702292SN/A 6712292SN/A ListOrderEntry queue_entry; 6722292SN/A 6732292SN/A queue_entry.queueType = op_class; 6742292SN/A 6752292SN/A queue_entry.oldestInst = readyInsts[op_class].top()->seqNum; 6762292SN/A 6772292SN/A ListOrderIt list_it = listOrder.begin(); 6782292SN/A ListOrderIt list_end_it = listOrder.end(); 6792292SN/A 6802292SN/A while (list_it != list_end_it) { 6812292SN/A if ((*list_it).oldestInst > queue_entry.oldestInst) { 6822292SN/A break; 6832292SN/A } 6842292SN/A 6852292SN/A list_it++; 6861060SN/A } 6871060SN/A 6882292SN/A readyIt[op_class] = listOrder.insert(list_it, queue_entry); 6892292SN/A queueOnList[op_class] = true; 6902292SN/A} 6911060SN/A 6922292SN/Atemplate <class Impl> 6932292SN/Avoid 6942292SN/AInstructionQueue<Impl>::moveToYoungerInst(ListOrderIt list_order_it) 6952292SN/A{ 6962292SN/A // Get iterator of next item on the list 6972292SN/A // Delete the original iterator 6982292SN/A // Determine if the next item is either the end of the list or younger 6992292SN/A // than the new instruction. If so, then add in a new iterator right here. 7002292SN/A // If not, then move along. 7012292SN/A ListOrderEntry queue_entry; 7022292SN/A OpClass op_class = (*list_order_it).queueType; 7032292SN/A ListOrderIt next_it = list_order_it; 7042292SN/A 7052292SN/A ++next_it; 7062292SN/A 7072292SN/A queue_entry.queueType = op_class; 7082292SN/A queue_entry.oldestInst = readyInsts[op_class].top()->seqNum; 7092292SN/A 7102292SN/A while (next_it != listOrder.end() && 7112292SN/A (*next_it).oldestInst < queue_entry.oldestInst) { 7122292SN/A ++next_it; 7131060SN/A } 7141060SN/A 7152292SN/A readyIt[op_class] = listOrder.insert(next_it, queue_entry); 7161060SN/A} 7171060SN/A 7182292SN/Atemplate <class Impl> 7192292SN/Avoid 7202292SN/AInstructionQueue<Impl>::processFUCompletion(DynInstPtr &inst, int fu_idx) 7212292SN/A{ 7222367SN/A DPRINTF(IQ, "Processing FU completion [sn:%lli]\n", inst->seqNum); 7239444SAndreas.Sandberg@ARM.com assert(!cpu->switchedOut()); 7242292SN/A // The CPU could have been sleeping until this op completed (*extremely* 7252292SN/A // long latency op). Wake it if it was. This may be overkill. 7262292SN/A iewStage->wakeCPU(); 7272292SN/A 7282326SN/A if (fu_idx > -1) 7292326SN/A fuPool->freeUnitNextCycle(fu_idx); 7302292SN/A 7312326SN/A // @todo: Ensure that these FU Completions happen at the beginning 7322326SN/A // of a cycle, otherwise they could add too many instructions to 7332326SN/A // the queue. 7345327Smengke97@hotmail.com issueToExecuteQueue->access(-1)->size++; 7352333SN/A instsToExecute.push_back(inst); 7362292SN/A} 7372292SN/A 7381061SN/A// @todo: Figure out a better way to remove the squashed items from the 7391061SN/A// lists. Checking the top item of each list to see if it's squashed 7401061SN/A// wastes time and forces jumps. 7411061SN/Atemplate <class Impl> 7421060SN/Avoid 7431060SN/AInstructionQueue<Impl>::scheduleReadyInsts() 7441060SN/A{ 7452292SN/A DPRINTF(IQ, "Attempting to schedule ready instructions from " 7462292SN/A "the IQ.\n"); 7471060SN/A 7481060SN/A IssueStruct *i2e_info = issueToExecuteQueue->access(0); 7491060SN/A 75010333Smitch.hayenga@arm.com DynInstPtr mem_inst; 75110333Smitch.hayenga@arm.com while (mem_inst = getDeferredMemInstToExecute()) { 75210333Smitch.hayenga@arm.com addReadyMemInst(mem_inst); 75310333Smitch.hayenga@arm.com } 75410333Smitch.hayenga@arm.com 75510333Smitch.hayenga@arm.com // See if any cache blocked instructions are able to be executed 75610333Smitch.hayenga@arm.com while (mem_inst = getBlockedMemInstToExecute()) { 75710333Smitch.hayenga@arm.com addReadyMemInst(mem_inst); 7587944SGiacomo.Gabrielli@arm.com } 7597944SGiacomo.Gabrielli@arm.com 7602292SN/A // Have iterator to head of the list 7612292SN/A // While I haven't exceeded bandwidth or reached the end of the list, 7622292SN/A // Try to get a FU that can do what this op needs. 7632292SN/A // If successful, change the oldestInst to the new top of the list, put 7642292SN/A // the queue in the proper place in the list. 7652292SN/A // Increment the iterator. 7662292SN/A // This will avoid trying to schedule a certain op class if there are no 7672292SN/A // FUs that handle it. 76810333Smitch.hayenga@arm.com int total_issued = 0; 7692292SN/A ListOrderIt order_it = listOrder.begin(); 7702292SN/A ListOrderIt order_end_it = listOrder.end(); 7711060SN/A 77210333Smitch.hayenga@arm.com while (total_issued < totalWidth && order_it != order_end_it) { 7732292SN/A OpClass op_class = (*order_it).queueType; 7741060SN/A 7752292SN/A assert(!readyInsts[op_class].empty()); 7761060SN/A 7772292SN/A DynInstPtr issuing_inst = readyInsts[op_class].top(); 7781060SN/A 7797897Shestness@cs.utexas.edu issuing_inst->isFloating() ? fpInstQueueReads++ : intInstQueueReads++; 7807897Shestness@cs.utexas.edu 7812292SN/A assert(issuing_inst->seqNum == (*order_it).oldestInst); 7821060SN/A 7832292SN/A if (issuing_inst->isSquashed()) { 7842292SN/A readyInsts[op_class].pop(); 7851060SN/A 7862292SN/A if (!readyInsts[op_class].empty()) { 7872292SN/A moveToYoungerInst(order_it); 7882292SN/A } else { 7892292SN/A readyIt[op_class] = listOrder.end(); 7902292SN/A queueOnList[op_class] = false; 7911060SN/A } 7921060SN/A 7932292SN/A listOrder.erase(order_it++); 7941060SN/A 7952292SN/A ++iqSquashedInstsIssued; 7962292SN/A 7972292SN/A continue; 7981060SN/A } 7991060SN/A 8002326SN/A int idx = -2; 8019184Sandreas.hansson@arm.com Cycles op_latency = Cycles(1); 8026221Snate@binkert.org ThreadID tid = issuing_inst->threadNumber; 8031060SN/A 8042326SN/A if (op_class != No_OpClass) { 8052326SN/A idx = fuPool->getUnit(op_class); 8067897Shestness@cs.utexas.edu issuing_inst->isFloating() ? fpAluAccesses++ : intAluAccesses++; 8072326SN/A if (idx > -1) { 8082326SN/A op_latency = fuPool->getOpLatency(op_class); 8091060SN/A } 8101060SN/A } 8111060SN/A 8122348SN/A // If we have an instruction that doesn't require a FU, or a 8132348SN/A // valid FU, then schedule for execution. 8142326SN/A if (idx == -2 || idx != -1) { 8159184Sandreas.hansson@arm.com if (op_latency == Cycles(1)) { 8162292SN/A i2e_info->size++; 8172333SN/A instsToExecute.push_back(issuing_inst); 8181060SN/A 8192326SN/A // Add the FU onto the list of FU's to be freed next 8202326SN/A // cycle if we used one. 8212326SN/A if (idx >= 0) 8222326SN/A fuPool->freeUnitNextCycle(idx); 8232292SN/A } else { 8249184Sandreas.hansson@arm.com Cycles issue_latency = fuPool->getIssueLatency(op_class); 8252326SN/A // Generate completion event for the FU 8262326SN/A FUCompletion *execution = new FUCompletion(issuing_inst, 8272326SN/A idx, this); 8281060SN/A 8299180Sandreas.hansson@arm.com cpu->schedule(execution, 8309180Sandreas.hansson@arm.com cpu->clockEdge(Cycles(op_latency - 1))); 8311060SN/A 8322326SN/A // @todo: Enforce that issue_latency == 1 or op_latency 8339184Sandreas.hansson@arm.com if (issue_latency > Cycles(1)) { 8342348SN/A // If FU isn't pipelined, then it must be freed 8352348SN/A // upon the execution completing. 8362326SN/A execution->setFreeFU(); 8372292SN/A } else { 8382292SN/A // Add the FU onto the list of FU's to be freed next cycle. 8392326SN/A fuPool->freeUnitNextCycle(idx); 8402292SN/A } 8411060SN/A } 8421060SN/A 8437720Sgblack@eecs.umich.edu DPRINTF(IQ, "Thread %i: Issuing instruction PC %s " 8442292SN/A "[sn:%lli]\n", 8457720Sgblack@eecs.umich.edu tid, issuing_inst->pcState(), 8462292SN/A issuing_inst->seqNum); 8471060SN/A 8482292SN/A readyInsts[op_class].pop(); 8491061SN/A 8502292SN/A if (!readyInsts[op_class].empty()) { 8512292SN/A moveToYoungerInst(order_it); 8522292SN/A } else { 8532292SN/A readyIt[op_class] = listOrder.end(); 8542292SN/A queueOnList[op_class] = false; 8551060SN/A } 8561060SN/A 8572064SN/A issuing_inst->setIssued(); 8582292SN/A ++total_issued; 8592064SN/A 8608471SGiacomo.Gabrielli@arm.com#if TRACING_ON 8619046SAli.Saidi@ARM.com issuing_inst->issueTick = curTick() - issuing_inst->fetchTick; 8628471SGiacomo.Gabrielli@arm.com#endif 8638471SGiacomo.Gabrielli@arm.com 8642292SN/A if (!issuing_inst->isMemRef()) { 8652292SN/A // Memory instructions can not be freed from the IQ until they 8662292SN/A // complete. 8672292SN/A ++freeEntries; 8682301SN/A count[tid]--; 8692731Sktlim@umich.edu issuing_inst->clearInIQ(); 8702292SN/A } else { 8712301SN/A memDepUnit[tid].issue(issuing_inst); 8722292SN/A } 8732292SN/A 8742292SN/A listOrder.erase(order_it++); 8752326SN/A statIssuedInstType[tid][op_class]++; 8762292SN/A } else { 8772326SN/A statFuBusy[op_class]++; 8782326SN/A fuBusy[tid]++; 8792292SN/A ++order_it; 8801060SN/A } 8811060SN/A } 8821062SN/A 8832326SN/A numIssuedDist.sample(total_issued); 8842326SN/A iqInstsIssued+= total_issued; 8852307SN/A 8862348SN/A // If we issued any instructions, tell the CPU we had activity. 8878071SAli.Saidi@ARM.com // @todo If the way deferred memory instructions are handeled due to 8888071SAli.Saidi@ARM.com // translation changes then the deferredMemInsts condition should be removed 8898071SAli.Saidi@ARM.com // from the code below. 89010333Smitch.hayenga@arm.com if (total_issued || !retryMemInsts.empty() || !deferredMemInsts.empty()) { 8912292SN/A cpu->activityThisCycle(); 8922292SN/A } else { 8932292SN/A DPRINTF(IQ, "Not able to schedule any instructions.\n"); 8942292SN/A } 8951060SN/A} 8961060SN/A 8971061SN/Atemplate <class Impl> 8981060SN/Avoid 8991061SN/AInstructionQueue<Impl>::scheduleNonSpec(const InstSeqNum &inst) 9001060SN/A{ 9012292SN/A DPRINTF(IQ, "Marking nonspeculative instruction [sn:%lli] as ready " 9022292SN/A "to execute.\n", inst); 9031062SN/A 9042292SN/A NonSpecMapIt inst_it = nonSpecInsts.find(inst); 9051060SN/A 9061061SN/A assert(inst_it != nonSpecInsts.end()); 9071060SN/A 9086221Snate@binkert.org ThreadID tid = (*inst_it).second->threadNumber; 9092292SN/A 9104033Sktlim@umich.edu (*inst_it).second->setAtCommit(); 9114033Sktlim@umich.edu 9121061SN/A (*inst_it).second->setCanIssue(); 9131060SN/A 9141062SN/A if (!(*inst_it).second->isMemRef()) { 9151062SN/A addIfReady((*inst_it).second); 9161062SN/A } else { 9172292SN/A memDepUnit[tid].nonSpecInstReady((*inst_it).second); 9181062SN/A } 9191060SN/A 9202292SN/A (*inst_it).second = NULL; 9212292SN/A 9221061SN/A nonSpecInsts.erase(inst_it); 9231060SN/A} 9241060SN/A 9251061SN/Atemplate <class Impl> 9261061SN/Avoid 9276221Snate@binkert.orgInstructionQueue<Impl>::commit(const InstSeqNum &inst, ThreadID tid) 9282292SN/A{ 9292292SN/A DPRINTF(IQ, "[tid:%i]: Committing instructions older than [sn:%i]\n", 9302292SN/A tid,inst); 9312292SN/A 9322292SN/A ListIt iq_it = instList[tid].begin(); 9332292SN/A 9342292SN/A while (iq_it != instList[tid].end() && 9352292SN/A (*iq_it)->seqNum <= inst) { 9362292SN/A ++iq_it; 9372292SN/A instList[tid].pop_front(); 9382292SN/A } 9392292SN/A 9402292SN/A assert(freeEntries == (numEntries - countInsts())); 9412292SN/A} 9422292SN/A 9432292SN/Atemplate <class Impl> 9442301SN/Aint 9451684SN/AInstructionQueue<Impl>::wakeDependents(DynInstPtr &completed_inst) 9461684SN/A{ 9472301SN/A int dependents = 0; 9482301SN/A 9497897Shestness@cs.utexas.edu // The instruction queue here takes care of both floating and int ops 9507897Shestness@cs.utexas.edu if (completed_inst->isFloating()) { 9517897Shestness@cs.utexas.edu fpInstQueueWakeupQccesses++; 9527897Shestness@cs.utexas.edu } else { 9537897Shestness@cs.utexas.edu intInstQueueWakeupAccesses++; 9547897Shestness@cs.utexas.edu } 9557897Shestness@cs.utexas.edu 9562292SN/A DPRINTF(IQ, "Waking dependents of completed instruction.\n"); 9572292SN/A 9582292SN/A assert(!completed_inst->isSquashed()); 9591684SN/A 9601684SN/A // Tell the memory dependence unit to wake any dependents on this 9612292SN/A // instruction if it is a memory instruction. Also complete the memory 9622326SN/A // instruction at this point since we know it executed without issues. 9632326SN/A // @todo: Might want to rename "completeMemInst" to something that 9642326SN/A // indicates that it won't need to be replayed, and call this 9652326SN/A // earlier. Might not be a big deal. 9661684SN/A if (completed_inst->isMemRef()) { 9672292SN/A memDepUnit[completed_inst->threadNumber].wakeDependents(completed_inst); 9682292SN/A completeMemInst(completed_inst); 9692292SN/A } else if (completed_inst->isMemBarrier() || 9702292SN/A completed_inst->isWriteBarrier()) { 9712292SN/A memDepUnit[completed_inst->threadNumber].completeBarrier(completed_inst); 9721684SN/A } 9731684SN/A 9741684SN/A for (int dest_reg_idx = 0; 9751684SN/A dest_reg_idx < completed_inst->numDestRegs(); 9761684SN/A dest_reg_idx++) 9771684SN/A { 9781684SN/A PhysRegIndex dest_reg = 9791684SN/A completed_inst->renamedDestRegIdx(dest_reg_idx); 9801684SN/A 9811684SN/A // Special case of uniq or control registers. They are not 9821684SN/A // handled by the IQ and thus have no dependency graph entry. 9831684SN/A // @todo Figure out a cleaner way to handle this. 9841684SN/A if (dest_reg >= numPhysRegs) { 9857599Sminkyu.jeong@arm.com DPRINTF(IQ, "dest_reg :%d, numPhysRegs: %d\n", dest_reg, 9867599Sminkyu.jeong@arm.com numPhysRegs); 9871684SN/A continue; 9881684SN/A } 9891684SN/A 9902292SN/A DPRINTF(IQ, "Waking any dependents on register %i.\n", 9911684SN/A (int) dest_reg); 9921684SN/A 9932326SN/A //Go through the dependency chain, marking the registers as 9942326SN/A //ready within the waiting instructions. 9952326SN/A DynInstPtr dep_inst = dependGraph.pop(dest_reg); 9961684SN/A 9972326SN/A while (dep_inst) { 9987599Sminkyu.jeong@arm.com DPRINTF(IQ, "Waking up a dependent instruction, [sn:%lli] " 9997720Sgblack@eecs.umich.edu "PC %s.\n", dep_inst->seqNum, dep_inst->pcState()); 10001684SN/A 10011684SN/A // Might want to give more information to the instruction 10022326SN/A // so that it knows which of its source registers is 10032326SN/A // ready. However that would mean that the dependency 10042326SN/A // graph entries would need to hold the src_reg_idx. 10052326SN/A dep_inst->markSrcRegReady(); 10061684SN/A 10072326SN/A addIfReady(dep_inst); 10081684SN/A 10092326SN/A dep_inst = dependGraph.pop(dest_reg); 10101684SN/A 10112301SN/A ++dependents; 10121684SN/A } 10131684SN/A 10142326SN/A // Reset the head node now that all of its dependents have 10152326SN/A // been woken up. 10162326SN/A assert(dependGraph.empty(dest_reg)); 10172326SN/A dependGraph.clearInst(dest_reg); 10181684SN/A 10191684SN/A // Mark the scoreboard as having that register ready. 10201684SN/A regScoreboard[dest_reg] = true; 10211684SN/A } 10222301SN/A return dependents; 10232064SN/A} 10242064SN/A 10252064SN/Atemplate <class Impl> 10262064SN/Avoid 10272292SN/AInstructionQueue<Impl>::addReadyMemInst(DynInstPtr &ready_inst) 10282064SN/A{ 10292292SN/A OpClass op_class = ready_inst->opClass(); 10302292SN/A 10312292SN/A readyInsts[op_class].push(ready_inst); 10322292SN/A 10332326SN/A // Will need to reorder the list if either a queue is not on the list, 10342326SN/A // or it has an older instruction than last time. 10352326SN/A if (!queueOnList[op_class]) { 10362326SN/A addToOrderList(op_class); 10372326SN/A } else if (readyInsts[op_class].top()->seqNum < 10382326SN/A (*readyIt[op_class]).oldestInst) { 10392326SN/A listOrder.erase(readyIt[op_class]); 10402326SN/A addToOrderList(op_class); 10412326SN/A } 10422326SN/A 10432292SN/A DPRINTF(IQ, "Instruction is ready to issue, putting it onto " 10447720Sgblack@eecs.umich.edu "the ready list, PC %s opclass:%i [sn:%lli].\n", 10457720Sgblack@eecs.umich.edu ready_inst->pcState(), op_class, ready_inst->seqNum); 10462064SN/A} 10472064SN/A 10482064SN/Atemplate <class Impl> 10492064SN/Avoid 10502292SN/AInstructionQueue<Impl>::rescheduleMemInst(DynInstPtr &resched_inst) 10512064SN/A{ 10524033Sktlim@umich.edu DPRINTF(IQ, "Rescheduling mem inst [sn:%lli]\n", resched_inst->seqNum); 10537944SGiacomo.Gabrielli@arm.com 10547944SGiacomo.Gabrielli@arm.com // Reset DTB translation state 10559046SAli.Saidi@ARM.com resched_inst->translationStarted(false); 10569046SAli.Saidi@ARM.com resched_inst->translationCompleted(false); 10577944SGiacomo.Gabrielli@arm.com 10584033Sktlim@umich.edu resched_inst->clearCanIssue(); 10592292SN/A memDepUnit[resched_inst->threadNumber].reschedule(resched_inst); 10602064SN/A} 10612064SN/A 10622064SN/Atemplate <class Impl> 10632064SN/Avoid 10642292SN/AInstructionQueue<Impl>::replayMemInst(DynInstPtr &replay_inst) 10652064SN/A{ 106610333Smitch.hayenga@arm.com memDepUnit[replay_inst->threadNumber].replay(); 10672292SN/A} 10682292SN/A 10692292SN/Atemplate <class Impl> 10702292SN/Avoid 10712292SN/AInstructionQueue<Impl>::completeMemInst(DynInstPtr &completed_inst) 10722292SN/A{ 10736221Snate@binkert.org ThreadID tid = completed_inst->threadNumber; 10742292SN/A 10757720Sgblack@eecs.umich.edu DPRINTF(IQ, "Completing mem instruction PC: %s [sn:%lli]\n", 10767720Sgblack@eecs.umich.edu completed_inst->pcState(), completed_inst->seqNum); 10772292SN/A 10782292SN/A ++freeEntries; 10792292SN/A 10809046SAli.Saidi@ARM.com completed_inst->memOpDone(true); 10812292SN/A 10822292SN/A memDepUnit[tid].completed(completed_inst); 10832292SN/A count[tid]--; 10841684SN/A} 10851684SN/A 10861684SN/Atemplate <class Impl> 10871684SN/Avoid 10887944SGiacomo.Gabrielli@arm.comInstructionQueue<Impl>::deferMemInst(DynInstPtr &deferred_inst) 10897944SGiacomo.Gabrielli@arm.com{ 10907944SGiacomo.Gabrielli@arm.com deferredMemInsts.push_back(deferred_inst); 10917944SGiacomo.Gabrielli@arm.com} 10927944SGiacomo.Gabrielli@arm.com 10937944SGiacomo.Gabrielli@arm.comtemplate <class Impl> 109410333Smitch.hayenga@arm.comvoid 109510333Smitch.hayenga@arm.comInstructionQueue<Impl>::blockMemInst(DynInstPtr &blocked_inst) 109610333Smitch.hayenga@arm.com{ 109710333Smitch.hayenga@arm.com blocked_inst->translationStarted(false); 109810333Smitch.hayenga@arm.com blocked_inst->translationCompleted(false); 109910333Smitch.hayenga@arm.com 110010333Smitch.hayenga@arm.com blocked_inst->clearIssued(); 110110333Smitch.hayenga@arm.com blocked_inst->clearCanIssue(); 110210333Smitch.hayenga@arm.com blockedMemInsts.push_back(blocked_inst); 110310333Smitch.hayenga@arm.com} 110410333Smitch.hayenga@arm.com 110510333Smitch.hayenga@arm.comtemplate <class Impl> 110610333Smitch.hayenga@arm.comvoid 110710333Smitch.hayenga@arm.comInstructionQueue<Impl>::cacheUnblocked() 110810333Smitch.hayenga@arm.com{ 110910333Smitch.hayenga@arm.com retryMemInsts.splice(retryMemInsts.end(), blockedMemInsts); 111010333Smitch.hayenga@arm.com // Get the CPU ticking again 111110333Smitch.hayenga@arm.com cpu->wakeCPU(); 111210333Smitch.hayenga@arm.com} 111310333Smitch.hayenga@arm.com 111410333Smitch.hayenga@arm.comtemplate <class Impl> 11157944SGiacomo.Gabrielli@arm.comtypename Impl::DynInstPtr 11167944SGiacomo.Gabrielli@arm.comInstructionQueue<Impl>::getDeferredMemInstToExecute() 11177944SGiacomo.Gabrielli@arm.com{ 11187944SGiacomo.Gabrielli@arm.com for (ListIt it = deferredMemInsts.begin(); it != deferredMemInsts.end(); 11197944SGiacomo.Gabrielli@arm.com ++it) { 11209046SAli.Saidi@ARM.com if ((*it)->translationCompleted() || (*it)->isSquashed()) { 112110333Smitch.hayenga@arm.com DynInstPtr mem_inst = *it; 11227944SGiacomo.Gabrielli@arm.com deferredMemInsts.erase(it); 112310333Smitch.hayenga@arm.com return mem_inst; 11247944SGiacomo.Gabrielli@arm.com } 11257944SGiacomo.Gabrielli@arm.com } 112610333Smitch.hayenga@arm.com return nullptr; 112710333Smitch.hayenga@arm.com} 112810333Smitch.hayenga@arm.com 112910333Smitch.hayenga@arm.comtemplate <class Impl> 113010333Smitch.hayenga@arm.comtypename Impl::DynInstPtr 113110333Smitch.hayenga@arm.comInstructionQueue<Impl>::getBlockedMemInstToExecute() 113210333Smitch.hayenga@arm.com{ 113310333Smitch.hayenga@arm.com if (retryMemInsts.empty()) { 113410333Smitch.hayenga@arm.com return nullptr; 113510333Smitch.hayenga@arm.com } else { 113610333Smitch.hayenga@arm.com DynInstPtr mem_inst = retryMemInsts.front(); 113710333Smitch.hayenga@arm.com retryMemInsts.pop_front(); 113810333Smitch.hayenga@arm.com return mem_inst; 113910333Smitch.hayenga@arm.com } 11407944SGiacomo.Gabrielli@arm.com} 11417944SGiacomo.Gabrielli@arm.com 11427944SGiacomo.Gabrielli@arm.comtemplate <class Impl> 11437944SGiacomo.Gabrielli@arm.comvoid 11441061SN/AInstructionQueue<Impl>::violation(DynInstPtr &store, 11451061SN/A DynInstPtr &faulting_load) 11461061SN/A{ 11477897Shestness@cs.utexas.edu intInstQueueWrites++; 11482292SN/A memDepUnit[store->threadNumber].violation(store, faulting_load); 11491061SN/A} 11501061SN/A 11511061SN/Atemplate <class Impl> 11521060SN/Avoid 11536221Snate@binkert.orgInstructionQueue<Impl>::squash(ThreadID tid) 11541060SN/A{ 11552292SN/A DPRINTF(IQ, "[tid:%i]: Starting to squash instructions in " 11562292SN/A "the IQ.\n", tid); 11571060SN/A 11581060SN/A // Read instruction sequence number of last instruction out of the 11591060SN/A // time buffer. 11602292SN/A squashedSeqNum[tid] = fromCommit->commitInfo[tid].doneSeqNum; 11611060SN/A 11621681SN/A // Call doSquash if there are insts in the IQ 11632292SN/A if (count[tid] > 0) { 11642292SN/A doSquash(tid); 11651681SN/A } 11661061SN/A 11671061SN/A // Also tell the memory dependence unit to squash. 11682292SN/A memDepUnit[tid].squash(squashedSeqNum[tid], tid); 11691060SN/A} 11701060SN/A 11711061SN/Atemplate <class Impl> 11721061SN/Avoid 11736221Snate@binkert.orgInstructionQueue<Impl>::doSquash(ThreadID tid) 11741061SN/A{ 11752326SN/A // Start at the tail. 11762326SN/A ListIt squash_it = instList[tid].end(); 11772326SN/A --squash_it; 11781061SN/A 11792292SN/A DPRINTF(IQ, "[tid:%i]: Squashing until sequence number %i!\n", 11802292SN/A tid, squashedSeqNum[tid]); 11811061SN/A 11821061SN/A // Squash any instructions younger than the squashed sequence number 11831061SN/A // given. 11842326SN/A while (squash_it != instList[tid].end() && 11852326SN/A (*squash_it)->seqNum > squashedSeqNum[tid]) { 11862292SN/A 11872326SN/A DynInstPtr squashed_inst = (*squash_it); 11887897Shestness@cs.utexas.edu squashed_inst->isFloating() ? fpInstQueueWrites++ : intInstQueueWrites++; 11891061SN/A 11901061SN/A // Only handle the instruction if it actually is in the IQ and 11911061SN/A // hasn't already been squashed in the IQ. 11922292SN/A if (squashed_inst->threadNumber != tid || 11932292SN/A squashed_inst->isSquashedInIQ()) { 11942326SN/A --squash_it; 11952292SN/A continue; 11962292SN/A } 11972292SN/A 11982292SN/A if (!squashed_inst->isIssued() || 11992292SN/A (squashed_inst->isMemRef() && 12009046SAli.Saidi@ARM.com !squashed_inst->memOpDone())) { 12011062SN/A 12027720Sgblack@eecs.umich.edu DPRINTF(IQ, "[tid:%i]: Instruction [sn:%lli] PC %s squashed.\n", 12037720Sgblack@eecs.umich.edu tid, squashed_inst->seqNum, squashed_inst->pcState()); 12042367SN/A 120510032SGiacomo.Gabrielli@arm.com bool is_acq_rel = squashed_inst->isMemBarrier() && 120610032SGiacomo.Gabrielli@arm.com (squashed_inst->isLoad() || 120710032SGiacomo.Gabrielli@arm.com (squashed_inst->isStore() && 120810032SGiacomo.Gabrielli@arm.com !squashed_inst->isStoreConditional())); 120910032SGiacomo.Gabrielli@arm.com 12101061SN/A // Remove the instruction from the dependency list. 121110032SGiacomo.Gabrielli@arm.com if (is_acq_rel || 121210032SGiacomo.Gabrielli@arm.com (!squashed_inst->isNonSpeculative() && 121310032SGiacomo.Gabrielli@arm.com !squashed_inst->isStoreConditional() && 121410032SGiacomo.Gabrielli@arm.com !squashed_inst->isMemBarrier() && 121510032SGiacomo.Gabrielli@arm.com !squashed_inst->isWriteBarrier())) { 12161061SN/A 12171061SN/A for (int src_reg_idx = 0; 12181681SN/A src_reg_idx < squashed_inst->numSrcRegs(); 12191061SN/A src_reg_idx++) 12201061SN/A { 12211061SN/A PhysRegIndex src_reg = 12221061SN/A squashed_inst->renamedSrcRegIdx(src_reg_idx); 12231061SN/A 12242326SN/A // Only remove it from the dependency graph if it 12252326SN/A // was placed there in the first place. 12262326SN/A 12272326SN/A // Instead of doing a linked list traversal, we 12282326SN/A // can just remove these squashed instructions 12292326SN/A // either at issue time, or when the register is 12302326SN/A // overwritten. The only downside to this is it 12312326SN/A // leaves more room for error. 12322292SN/A 12331061SN/A if (!squashed_inst->isReadySrcRegIdx(src_reg_idx) && 12341061SN/A src_reg < numPhysRegs) { 12352326SN/A dependGraph.remove(src_reg, squashed_inst); 12361061SN/A } 12371062SN/A 12382292SN/A 12391062SN/A ++iqSquashedOperandsExamined; 12401061SN/A } 12414033Sktlim@umich.edu } else if (!squashed_inst->isStoreConditional() || 12424033Sktlim@umich.edu !squashed_inst->isCompleted()) { 12432292SN/A NonSpecMapIt ns_inst_it = 12442292SN/A nonSpecInsts.find(squashed_inst->seqNum); 12458275SAli.Saidi@ARM.com 124610017Sandreas.hansson@arm.com // we remove non-speculative instructions from 124710017Sandreas.hansson@arm.com // nonSpecInsts already when they are ready, and so we 124810017Sandreas.hansson@arm.com // cannot always expect to find them 12494033Sktlim@umich.edu if (ns_inst_it == nonSpecInsts.end()) { 125010017Sandreas.hansson@arm.com // loads that became ready but stalled on a 125110017Sandreas.hansson@arm.com // blocked cache are alreayd removed from 125210017Sandreas.hansson@arm.com // nonSpecInsts, and have not faulted 125310017Sandreas.hansson@arm.com assert(squashed_inst->getFault() != NoFault || 125410017Sandreas.hansson@arm.com squashed_inst->isMemRef()); 12554033Sktlim@umich.edu } else { 12561062SN/A 12574033Sktlim@umich.edu (*ns_inst_it).second = NULL; 12581681SN/A 12594033Sktlim@umich.edu nonSpecInsts.erase(ns_inst_it); 12601062SN/A 12614033Sktlim@umich.edu ++iqSquashedNonSpecRemoved; 12624033Sktlim@umich.edu } 12631061SN/A } 12641061SN/A 12651061SN/A // Might want to also clear out the head of the dependency graph. 12661061SN/A 12671061SN/A // Mark it as squashed within the IQ. 12681061SN/A squashed_inst->setSquashedInIQ(); 12691061SN/A 12702292SN/A // @todo: Remove this hack where several statuses are set so the 12712292SN/A // inst will flow through the rest of the pipeline. 12721681SN/A squashed_inst->setIssued(); 12731681SN/A squashed_inst->setCanCommit(); 12742731Sktlim@umich.edu squashed_inst->clearInIQ(); 12752292SN/A 12762292SN/A //Update Thread IQ Count 12772292SN/A count[squashed_inst->threadNumber]--; 12781681SN/A 12791681SN/A ++freeEntries; 12801061SN/A } 12811061SN/A 12822326SN/A instList[tid].erase(squash_it--); 12831062SN/A ++iqSquashedInstsExamined; 12841061SN/A } 12851060SN/A} 12861060SN/A 12871061SN/Atemplate <class Impl> 12881060SN/Abool 12891061SN/AInstructionQueue<Impl>::addToDependents(DynInstPtr &new_inst) 12901060SN/A{ 12911060SN/A // Loop through the instruction's source registers, adding 12921060SN/A // them to the dependency list if they are not ready. 12931060SN/A int8_t total_src_regs = new_inst->numSrcRegs(); 12941060SN/A bool return_val = false; 12951060SN/A 12961060SN/A for (int src_reg_idx = 0; 12971060SN/A src_reg_idx < total_src_regs; 12981060SN/A src_reg_idx++) 12991060SN/A { 13001060SN/A // Only add it to the dependency graph if it's not ready. 13011060SN/A if (!new_inst->isReadySrcRegIdx(src_reg_idx)) { 13021060SN/A PhysRegIndex src_reg = new_inst->renamedSrcRegIdx(src_reg_idx); 13031060SN/A 13041060SN/A // Check the IQ's scoreboard to make sure the register 13051060SN/A // hasn't become ready while the instruction was in flight 13061060SN/A // between stages. Only if it really isn't ready should 13071060SN/A // it be added to the dependency graph. 13081061SN/A if (src_reg >= numPhysRegs) { 13091061SN/A continue; 131010231Ssteve.reinhardt@amd.com } else if (!regScoreboard[src_reg]) { 13117720Sgblack@eecs.umich.edu DPRINTF(IQ, "Instruction PC %s has src reg %i that " 13121060SN/A "is being added to the dependency chain.\n", 13137720Sgblack@eecs.umich.edu new_inst->pcState(), src_reg); 13141060SN/A 13152326SN/A dependGraph.insert(src_reg, new_inst); 13161060SN/A 13171060SN/A // Change the return value to indicate that something 13181060SN/A // was added to the dependency graph. 13191060SN/A return_val = true; 13201060SN/A } else { 13217720Sgblack@eecs.umich.edu DPRINTF(IQ, "Instruction PC %s has src reg %i that " 13221060SN/A "became ready before it reached the IQ.\n", 13237720Sgblack@eecs.umich.edu new_inst->pcState(), src_reg); 13241060SN/A // Mark a register ready within the instruction. 13252326SN/A new_inst->markSrcRegReady(src_reg_idx); 13261060SN/A } 13271060SN/A } 13281060SN/A } 13291060SN/A 13301060SN/A return return_val; 13311060SN/A} 13321060SN/A 13331061SN/Atemplate <class Impl> 13341060SN/Avoid 13352326SN/AInstructionQueue<Impl>::addToProducers(DynInstPtr &new_inst) 13361060SN/A{ 13372326SN/A // Nothing really needs to be marked when an instruction becomes 13382326SN/A // the producer of a register's value, but for convenience a ptr 13392326SN/A // to the producing instruction will be placed in the head node of 13402326SN/A // the dependency links. 13411060SN/A int8_t total_dest_regs = new_inst->numDestRegs(); 13421060SN/A 13431060SN/A for (int dest_reg_idx = 0; 13441060SN/A dest_reg_idx < total_dest_regs; 13451060SN/A dest_reg_idx++) 13461060SN/A { 13471061SN/A PhysRegIndex dest_reg = new_inst->renamedDestRegIdx(dest_reg_idx); 13481061SN/A 13491061SN/A // Instructions that use the misc regs will have a reg number 13501061SN/A // higher than the normal physical registers. In this case these 13511061SN/A // registers are not renamed, and there is no need to track 13521061SN/A // dependencies as these instructions must be executed at commit. 13531061SN/A if (dest_reg >= numPhysRegs) { 13541061SN/A continue; 13551060SN/A } 13561060SN/A 13572326SN/A if (!dependGraph.empty(dest_reg)) { 13582326SN/A dependGraph.dump(); 13592292SN/A panic("Dependency graph %i not empty!", dest_reg); 13602064SN/A } 13611062SN/A 13622326SN/A dependGraph.setInst(dest_reg, new_inst); 13631062SN/A 13641060SN/A // Mark the scoreboard to say it's not yet ready. 13651060SN/A regScoreboard[dest_reg] = false; 13661060SN/A } 13671060SN/A} 13681060SN/A 13691061SN/Atemplate <class Impl> 13701060SN/Avoid 13711061SN/AInstructionQueue<Impl>::addIfReady(DynInstPtr &inst) 13721060SN/A{ 13732326SN/A // If the instruction now has all of its source registers 13741060SN/A // available, then add it to the list of ready instructions. 13751060SN/A if (inst->readyToIssue()) { 13761061SN/A 13771060SN/A //Add the instruction to the proper ready list. 13782292SN/A if (inst->isMemRef()) { 13791061SN/A 13802292SN/A DPRINTF(IQ, "Checking if memory instruction can issue.\n"); 13811061SN/A 13821062SN/A // Message to the mem dependence unit that this instruction has 13831062SN/A // its registers ready. 13842292SN/A memDepUnit[inst->threadNumber].regsReady(inst); 13851062SN/A 13862292SN/A return; 13872292SN/A } 13881062SN/A 13892292SN/A OpClass op_class = inst->opClass(); 13901061SN/A 13912292SN/A DPRINTF(IQ, "Instruction is ready to issue, putting it onto " 13927720Sgblack@eecs.umich.edu "the ready list, PC %s opclass:%i [sn:%lli].\n", 13937720Sgblack@eecs.umich.edu inst->pcState(), op_class, inst->seqNum); 13941061SN/A 13952292SN/A readyInsts[op_class].push(inst); 13961061SN/A 13972326SN/A // Will need to reorder the list if either a queue is not on the list, 13982326SN/A // or it has an older instruction than last time. 13992326SN/A if (!queueOnList[op_class]) { 14002326SN/A addToOrderList(op_class); 14012326SN/A } else if (readyInsts[op_class].top()->seqNum < 14022326SN/A (*readyIt[op_class]).oldestInst) { 14032326SN/A listOrder.erase(readyIt[op_class]); 14042326SN/A addToOrderList(op_class); 14051060SN/A } 14061060SN/A } 14071060SN/A} 14081060SN/A 14091061SN/Atemplate <class Impl> 14101061SN/Aint 14111061SN/AInstructionQueue<Impl>::countInsts() 14121061SN/A{ 14132698Sktlim@umich.edu#if 0 14142292SN/A //ksewell:This works but definitely could use a cleaner write 14152292SN/A //with a more intuitive way of counting. Right now it's 14162292SN/A //just brute force .... 14172698Sktlim@umich.edu // Change the #if if you want to use this method. 14181061SN/A int total_insts = 0; 14191061SN/A 14206221Snate@binkert.org for (ThreadID tid = 0; tid < numThreads; ++tid) { 14216221Snate@binkert.org ListIt count_it = instList[tid].begin(); 14221681SN/A 14236221Snate@binkert.org while (count_it != instList[tid].end()) { 14242292SN/A if (!(*count_it)->isSquashed() && !(*count_it)->isSquashedInIQ()) { 14252292SN/A if (!(*count_it)->isIssued()) { 14262292SN/A ++total_insts; 14272292SN/A } else if ((*count_it)->isMemRef() && 14282292SN/A !(*count_it)->memOpDone) { 14292292SN/A // Loads that have not been marked as executed still count 14302292SN/A // towards the total instructions. 14312292SN/A ++total_insts; 14322292SN/A } 14332292SN/A } 14342292SN/A 14352292SN/A ++count_it; 14361061SN/A } 14371061SN/A } 14381061SN/A 14391061SN/A return total_insts; 14402292SN/A#else 14412292SN/A return numEntries - freeEntries; 14422292SN/A#endif 14431681SN/A} 14441681SN/A 14451681SN/Atemplate <class Impl> 14461681SN/Avoid 14471061SN/AInstructionQueue<Impl>::dumpLists() 14481061SN/A{ 14492292SN/A for (int i = 0; i < Num_OpClasses; ++i) { 14502292SN/A cprintf("Ready list %i size: %i\n", i, readyInsts[i].size()); 14511061SN/A 14522292SN/A cprintf("\n"); 14532292SN/A } 14541061SN/A 14551061SN/A cprintf("Non speculative list size: %i\n", nonSpecInsts.size()); 14561061SN/A 14572292SN/A NonSpecMapIt non_spec_it = nonSpecInsts.begin(); 14582292SN/A NonSpecMapIt non_spec_end_it = nonSpecInsts.end(); 14591061SN/A 14601061SN/A cprintf("Non speculative list: "); 14611061SN/A 14622292SN/A while (non_spec_it != non_spec_end_it) { 14637720Sgblack@eecs.umich.edu cprintf("%s [sn:%lli]", (*non_spec_it).second->pcState(), 14642292SN/A (*non_spec_it).second->seqNum); 14651061SN/A ++non_spec_it; 14661061SN/A } 14671061SN/A 14681061SN/A cprintf("\n"); 14691061SN/A 14702292SN/A ListOrderIt list_order_it = listOrder.begin(); 14712292SN/A ListOrderIt list_order_end_it = listOrder.end(); 14722292SN/A int i = 1; 14732292SN/A 14742292SN/A cprintf("List order: "); 14752292SN/A 14762292SN/A while (list_order_it != list_order_end_it) { 14772292SN/A cprintf("%i OpClass:%i [sn:%lli] ", i, (*list_order_it).queueType, 14782292SN/A (*list_order_it).oldestInst); 14792292SN/A 14802292SN/A ++list_order_it; 14812292SN/A ++i; 14822292SN/A } 14832292SN/A 14842292SN/A cprintf("\n"); 14851061SN/A} 14862292SN/A 14872292SN/A 14882292SN/Atemplate <class Impl> 14892292SN/Avoid 14902292SN/AInstructionQueue<Impl>::dumpInsts() 14912292SN/A{ 14926221Snate@binkert.org for (ThreadID tid = 0; tid < numThreads; ++tid) { 14932292SN/A int num = 0; 14942292SN/A int valid_num = 0; 14956221Snate@binkert.org ListIt inst_list_it = instList[tid].begin(); 14962292SN/A 14976221Snate@binkert.org while (inst_list_it != instList[tid].end()) { 14986221Snate@binkert.org cprintf("Instruction:%i\n", num); 14992292SN/A if (!(*inst_list_it)->isSquashed()) { 15002292SN/A if (!(*inst_list_it)->isIssued()) { 15012292SN/A ++valid_num; 15022292SN/A cprintf("Count:%i\n", valid_num); 15032292SN/A } else if ((*inst_list_it)->isMemRef() && 15049046SAli.Saidi@ARM.com !(*inst_list_it)->memOpDone()) { 15052326SN/A // Loads that have not been marked as executed 15062326SN/A // still count towards the total instructions. 15072292SN/A ++valid_num; 15082292SN/A cprintf("Count:%i\n", valid_num); 15092292SN/A } 15102292SN/A } 15112292SN/A 15127720Sgblack@eecs.umich.edu cprintf("PC: %s\n[sn:%lli]\n[tid:%i]\n" 15132292SN/A "Issued:%i\nSquashed:%i\n", 15147720Sgblack@eecs.umich.edu (*inst_list_it)->pcState(), 15152292SN/A (*inst_list_it)->seqNum, 15162292SN/A (*inst_list_it)->threadNumber, 15172292SN/A (*inst_list_it)->isIssued(), 15182292SN/A (*inst_list_it)->isSquashed()); 15192292SN/A 15202292SN/A if ((*inst_list_it)->isMemRef()) { 15219046SAli.Saidi@ARM.com cprintf("MemOpDone:%i\n", (*inst_list_it)->memOpDone()); 15222292SN/A } 15232292SN/A 15242292SN/A cprintf("\n"); 15252292SN/A 15262292SN/A inst_list_it++; 15272292SN/A ++num; 15282292SN/A } 15292292SN/A } 15302348SN/A 15312348SN/A cprintf("Insts to Execute list:\n"); 15322348SN/A 15332348SN/A int num = 0; 15342348SN/A int valid_num = 0; 15352348SN/A ListIt inst_list_it = instsToExecute.begin(); 15362348SN/A 15372348SN/A while (inst_list_it != instsToExecute.end()) 15382348SN/A { 15392348SN/A cprintf("Instruction:%i\n", 15402348SN/A num); 15412348SN/A if (!(*inst_list_it)->isSquashed()) { 15422348SN/A if (!(*inst_list_it)->isIssued()) { 15432348SN/A ++valid_num; 15442348SN/A cprintf("Count:%i\n", valid_num); 15452348SN/A } else if ((*inst_list_it)->isMemRef() && 15469046SAli.Saidi@ARM.com !(*inst_list_it)->memOpDone()) { 15472348SN/A // Loads that have not been marked as executed 15482348SN/A // still count towards the total instructions. 15492348SN/A ++valid_num; 15502348SN/A cprintf("Count:%i\n", valid_num); 15512348SN/A } 15522348SN/A } 15532348SN/A 15547720Sgblack@eecs.umich.edu cprintf("PC: %s\n[sn:%lli]\n[tid:%i]\n" 15552348SN/A "Issued:%i\nSquashed:%i\n", 15567720Sgblack@eecs.umich.edu (*inst_list_it)->pcState(), 15572348SN/A (*inst_list_it)->seqNum, 15582348SN/A (*inst_list_it)->threadNumber, 15592348SN/A (*inst_list_it)->isIssued(), 15602348SN/A (*inst_list_it)->isSquashed()); 15612348SN/A 15622348SN/A if ((*inst_list_it)->isMemRef()) { 15639046SAli.Saidi@ARM.com cprintf("MemOpDone:%i\n", (*inst_list_it)->memOpDone()); 15642348SN/A } 15652348SN/A 15662348SN/A cprintf("\n"); 15672348SN/A 15682348SN/A inst_list_it++; 15692348SN/A ++num; 15702348SN/A } 15712292SN/A} 15729944Smatt.horsnell@ARM.com 15739944Smatt.horsnell@ARM.com#endif//__CPU_O3_INST_QUEUE_IMPL_HH__ 1574