dyn_inst.hh

Go to the documentation of this file.

/*
 * Copyright (c) 2010, 2016, 2021, 2025 Arm Limited
 * Copyright (c) 2013 Advanced Micro Devices, Inc.
 * All rights reserved
 *
 * The license below extends only to copyright in the software and shall
 * not be construed as granting a license to any other intellectual
 * property including but not limited to intellectual property relating
 * to a hardware implementation of the functionality of the software
 * licensed hereunder.  You may use the software subject to the license
 * terms below provided that you ensure that this notice is replicated
 * unmodified and in its entirety in all distributions of the software,
 * modified or unmodified, in source code or in binary form.
 *
 * Copyright (c) 2004-2006 The Regents of The University of Michigan
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are
 * met: redistributions of source code must retain the above copyright
 * notice, this list of conditions and the following disclaimer;
 * redistributions in binary form must reproduce the above copyright
 * notice, this list of conditions and the following disclaimer in the
 * documentation and/or other materials provided with the distribution;
 * neither the name of the copyright holders nor the names of its
 * contributors may be used to endorse or promote products derived from
 * this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
 
#ifndef __CPU_O3_DYN_INST_HH__
#define __CPU_O3_DYN_INST_HH__
 
#include <algorithm>
#include <array>
#include <deque>
#include <list>
#include <string>
 
#include "base/refcnt.hh"
#include "base/trace.hh"
#include "cpu/checker/cpu.hh"
#include "cpu/exec_context.hh"
#include "cpu/exetrace.hh"
#include "cpu/inst_res.hh"
#include "cpu/inst_seq.hh"
#include "cpu/o3/cpu.hh"
#include "cpu/o3/dyn_inst_ptr.hh"
#include "cpu/o3/lsq_unit.hh"
#include "cpu/op_class.hh"
#include "cpu/reg_class.hh"
#include "cpu/static_inst.hh"
#include "cpu/translation.hh"
#include "debug/HtmCpu.hh"
 
namespace gem5
{
 
class Packet;
 
namespace o3
{
 
class DynInst : public ExecContext, public RefCounted
{
  private:
    DynInst(const StaticInstPtr &staticInst, const StaticInstPtr &macroop,
            InstSeqNum seq_num, CPU *cpu);
 
  public:
    // The list of instructions iterator type.
    typedef typename std::list<DynInstPtr>::iterator ListIt;
 
    struct Arrays
    {
        size_t numSrcs;
        size_t numDests;
 
        RegId *flatDestIdx;
        PhysRegIdPtr *destIdx;
        PhysRegIdPtr *prevDestIdx;
        PhysRegIdPtr *srcIdx;
        uint8_t *readySrcIdx;
    };
 
    static void *operator new(size_t count, Arrays &arrays);
    static void  operator delete(void* ptr);

    DynInst(const Arrays &arrays, const StaticInstPtr &staticInst,
            const StaticInstPtr &macroop, InstSeqNum seq_num, CPU *cpu);
 
    DynInst(const Arrays &arrays, const StaticInstPtr &staticInst,
            const StaticInstPtr &macroop, const PCStateBase &pc,
            const PCStateBase &pred_pc, InstSeqNum seq_num, CPU *cpu);

    DynInst(const Arrays &arrays, const StaticInstPtr &_staticInst,
            const StaticInstPtr &_macroop);
 
    ~DynInst();

    Fault execute();

    Fault initiateAcc();

    Fault completeAcc(PacketPtr pkt);

    InstSeqNum seqNum = 0;

    const StaticInstPtr staticInst;

    CPU *cpu = nullptr;
 
    BaseCPU *getCpuPtr() { return cpu; }

    ThreadState *thread = nullptr;

    Fault fault = NoFault;

    trace::InstRecord *traceData = nullptr;
 
  protected:
    enum Status
    {
        IqEntry,                 
        RobEntry,                
        LsqEntry,                
        Completed,               
        ResultReady,             
        CanIssue,                
        Issued,                  
        Executed,                
        CanCommit,               
        AtCommit,                
        Committed,               
        Squashed,                
        SquashedInIQ,            
        SquashedInLSQ,           
        SquashedInROB,           
        PinnedRegsRenamed,       
        PinnedRegsWritten,       
        PinnedRegsSquashDone,    
        RecoverInst,             
        BlockingInst,            
        ThreadsyncWait,          
        SerializeBefore,         
        SerializeAfter,          
        SerializeHandled,        
        NumStatus
    };
 
    enum Flags
    {
        NotAnInst,
        TranslationStarted,
        TranslationCompleted,
        PossibleLoadViolation,
        HitExternalSnoop,
        EffAddrValid,
        RecordResult,
        Predicate,
        MemAccPredicate,
        PredTaken,
        IsStrictlyOrdered,
        ReqMade,
        MemOpDone,
        HtmFromTransaction,
        NoCapableFU,           
        MaxFlags
    };
 
  private:
    /* An amalgamation of a lot of boolean values into one */
    std::bitset<MaxFlags> instFlags;

    std::bitset<NumStatus> status;
 
  protected:
    std::queue<InstResult> instResult;

    std::unique_ptr<PCStateBase> pc;

    std::vector<RegVal> _destMiscRegVal;

    std::vector<short> _destMiscRegIdx;
 
    size_t _numSrcs;
    size_t _numDests;
 
    // Flattened register index of the destination registers of this
    // instruction.
    RegId *_flatDestIdx;
 
    // Physical register index of the destination registers of this
    // instruction.
    PhysRegIdPtr *_destIdx;
 
    // Physical register index of the previous producers of the
    // architected destinations.
    PhysRegIdPtr *_prevDestIdx;
 
    // Physical register index of the source registers of this instruction.
    PhysRegIdPtr *_srcIdx;
 
    // Whether or not the source register is ready, one bit per register.
    uint8_t *_readySrcIdx;
 
  public:
    size_t numSrcs() const { return _numSrcs; }
    size_t numDests() const { return _numDests; }
 
    // Returns the flattened register index of the idx'th destination
    // register.
    const RegId &
    flattenedDestIdx(int idx) const
    {
        return _flatDestIdx[idx];
    }
 
    // Flattens a destination architectural register index into a logical
    // index.
    void
    flattenedDestIdx(int idx, const RegId &reg_id)
    {
        _flatDestIdx[idx] = reg_id;
    }
 
    // Returns the physical register index of the idx'th destination
    // register.
    PhysRegIdPtr
    renamedDestIdx(int idx) const
    {
        return _destIdx[idx];
    }
 
    // Set the renamed dest register id.
    void
    renamedDestIdx(int idx, PhysRegIdPtr phys_reg_id)
    {
        _destIdx[idx] = phys_reg_id;
    }
 
    // Returns the physical register index of the previous physical
    // register that remapped to the same logical register index.
    PhysRegIdPtr
    prevDestIdx(int idx) const
    {
        return _prevDestIdx[idx];
    }
 
    // Set the previous renamed dest register id.
    void
    prevDestIdx(int idx, PhysRegIdPtr phys_reg_id)
    {
        _prevDestIdx[idx] = phys_reg_id;
    }
 
    // Returns the physical register index of the i'th source register.
    PhysRegIdPtr
    renamedSrcIdx(int idx) const
    {
        return _srcIdx[idx];
    }
 
    void
    renamedSrcIdx(int idx, PhysRegIdPtr phys_reg_id)
    {
        _srcIdx[idx] = phys_reg_id;
    }
 
    bool
    readySrcIdx(int idx) const
    {
        uint8_t &byte = _readySrcIdx[idx / 8];
        return bits(byte, idx % 8);
    }
 
    void
    readySrcIdx(int idx, bool ready)
    {
        uint8_t &byte = _readySrcIdx[idx / 8];
        replaceBits(byte, idx % 8, ready ? 1 : 0);
    }

    ThreadID threadNumber = 0;

    ListIt instListIt;


    std::unique_ptr<PCStateBase> predPC;

    const StaticInstPtr macroop;

    uint8_t readyRegs = 0;
 
  public:

    Addr effAddr = 0;

    Addr physEffAddr = 0;

    unsigned memReqFlags = 0;

    unsigned effSize;

    uint8_t *memData = nullptr;

    ssize_t lqIdx = -1;
    typename LSQUnit::LQIterator lqIt;

    ssize_t sqIdx = -1;
    typename LSQUnit::SQIterator sqIt;
 


    LSQ::LSQRequest *savedRequest;

    // Need a copy of main request pointer to verify on writes.
    RequestPtr reqToVerify;
 
  public:
    void recordResult(bool f) { instFlags[RecordResult] = f; }

    bool effAddrValid() const { return instFlags[EffAddrValid]; }
    void effAddrValid(bool b) { instFlags[EffAddrValid] = b; }

    bool memOpDone() const { return instFlags[MemOpDone]; }
    void memOpDone(bool f) { instFlags[MemOpDone] = f; }
 
    bool notAnInst() const { return instFlags[NotAnInst]; }
    void setNotAnInst() { instFlags[NotAnInst] = true; }
 

    //
    // INSTRUCTION EXECUTION
    //
 
    void
    demapPage(Addr vaddr, uint64_t asn) override
    {
        cpu->demapPage(vaddr, asn);
    }
 
    Fault initiateMemRead(Addr addr, unsigned size, Request::Flags flags,
            const std::vector<bool> &byte_enable) override;
 
    Fault initiateMemMgmtCmd(Request::Flags flags) override;
 
    Fault writeMem(uint8_t *data, unsigned size, Addr addr,
                   Request::Flags flags, uint64_t *res,
                   const std::vector<bool> &byte_enable) override;
 
    Fault initiateMemAMO(Addr addr, unsigned size, Request::Flags flags,
                         AtomicOpFunctorPtr amo_op) override;

    bool translationStarted() const { return instFlags[TranslationStarted]; }
    void translationStarted(bool f) { instFlags[TranslationStarted] = f; }

    bool
    translationCompleted() const
    {
        return instFlags[TranslationCompleted];
    }
    void translationCompleted(bool f) { instFlags[TranslationCompleted] = f; }

    bool
    possibleLoadViolation() const
    {
        return instFlags[PossibleLoadViolation];
    }
    void
    possibleLoadViolation(bool f)
    {
        instFlags[PossibleLoadViolation] = f;
    }

    bool hitExternalSnoop() const { return instFlags[HitExternalSnoop]; }
    void hitExternalSnoop(bool f) { instFlags[HitExternalSnoop] = f; }

    bool
    isTranslationDelayed() const
    {
        return (translationStarted() && !translationCompleted());
    }
 
  public:
#ifdef GEM5_DEBUG
    void dumpSNList();
#endif

    void
    renameDestReg(int idx, PhysRegIdPtr renamed_dest,
                  PhysRegIdPtr previous_rename)
    {
        renamedDestIdx(idx, renamed_dest);
        prevDestIdx(idx, previous_rename);
        if (renamed_dest->isPinned())
            setPinnedRegsRenamed();
    }

    void
    renameSrcReg(int idx, PhysRegIdPtr renamed_src)
    {
        renamedSrcIdx(idx, renamed_src);
    }

    void dump();

    void dump(std::string &outstring);

    int cpuId() const { return cpu->cpuId(); }

    uint32_t socketId() const { return cpu->socketId(); }

    RequestorID requestorId() const { return cpu->dataRequestorId(); }

    ContextID contextId() const { return thread->contextId(); }

    Fault getFault() const { return fault; }
    Fault& getFault() { return fault; }

    bool doneTargCalc() { return false; }

    void setPredTarg(const PCStateBase &pred_pc) { set(predPC, pred_pc); }
 
    const PCStateBase &readPredTarg() { return *predPC; }

    bool
    readPredTaken() const
    {
        return instFlags[PredTaken];
    }
 
    void
    setPredTaken(bool predicted_taken)
    {
        instFlags[PredTaken] = predicted_taken;
    }

    bool
    mispredicted() const
    {
        std::unique_ptr<PCStateBase> next_pc(pc->clone());
        staticInst->advancePC(*next_pc);
        return *next_pc != *predPC;
    }
 
    //
    //  Instruction types.  Forward checks to StaticInst object.
    //
    bool isNop()          const { return staticInst->isNop(); }
    bool isMemRef()       const { return staticInst->isMemRef(); }
    bool isLoad()         const { return staticInst->isLoad(); }
    bool isStore()        const { return staticInst->isStore(); }
    bool isAtomic()       const { return staticInst->isAtomic(); }
    bool isStoreConditional() const
    { return staticInst->isStoreConditional(); }
    bool isInstPrefetch() const { return staticInst->isInstPrefetch(); }
    bool isDataPrefetch() const { return staticInst->isDataPrefetch(); }
    bool isInteger()      const { return staticInst->isInteger(); }
    bool isFloating()     const { return staticInst->isFloating(); }
    bool isVector()       const { return staticInst->isVector(); }
    bool isControl()      const { return staticInst->isControl(); }
    bool isCall()         const { return staticInst->isCall(); }
    bool isReturn()       const { return staticInst->isReturn(); }
    bool isDirectCtrl()   const { return staticInst->isDirectCtrl(); }
    bool isIndirectCtrl() const { return staticInst->isIndirectCtrl(); }
    bool isCondCtrl()     const { return staticInst->isCondCtrl(); }
    bool isUncondCtrl()   const { return staticInst->isUncondCtrl(); }
    bool isSerializing()  const { return staticInst->isSerializing(); }
    bool
    isSerializeBefore() const
    {
        return staticInst->isSerializeBefore() || status[SerializeBefore];
    }
    bool
    isSerializeAfter() const
    {
        return staticInst->isSerializeAfter() || status[SerializeAfter];
    }
    bool isSquashAfter() const { return staticInst->isSquashAfter(); }
    bool isFullMemBarrier()   const { return staticInst->isFullMemBarrier(); }
    bool isReadBarrier() const { return staticInst->isReadBarrier(); }
    bool isWriteBarrier() const { return staticInst->isWriteBarrier(); }
    bool isNonSpeculative() const { return staticInst->isNonSpeculative(); }
    bool isQuiesce() const { return staticInst->isQuiesce(); }
    bool isUnverifiable() const { return staticInst->isUnverifiable(); }
    bool isSyscall() const { return staticInst->isSyscall(); }
    bool isMacroop() const { return staticInst->isMacroop(); }
    bool isMicroop() const { return staticInst->isMicroop(); }
    bool isDelayedCommit() const { return staticInst->isDelayedCommit(); }
    bool isLastMicroop() const { return staticInst->isLastMicroop(); }
    bool isFirstMicroop() const { return staticInst->isFirstMicroop(); }
    // hardware transactional memory
    bool isHtmStart() const { return staticInst->isHtmStart(); }
    bool isHtmStop() const { return staticInst->isHtmStop(); }
    bool isHtmCancel() const { return staticInst->isHtmCancel(); }
    bool isHtmCmd() const { return staticInst->isHtmCmd(); }
 
    uint64_t
    getHtmTransactionUid() const override
    {
        assert(instFlags[HtmFromTransaction]);
        return htmUid;
    }
 
    uint64_t
    newHtmTransactionUid() const override
    {
        panic("Not yet implemented\n");
        return 0;
    }
 
    bool
    inHtmTransactionalState() const override
    {
        return instFlags[HtmFromTransaction];
    }
 
    uint64_t
    getHtmTransactionalDepth() const override
    {
        if (inHtmTransactionalState())
            return htmDepth;
        else
            return 0;
    }
 
    void
    setHtmTransactionalState(uint64_t htm_uid, uint64_t htm_depth)
    {
        instFlags.set(HtmFromTransaction);
        htmUid = htm_uid;
        htmDepth = htm_depth;
    }
 
    void
    clearHtmTransactionalState()
    {
        if (inHtmTransactionalState()) {
            DPRINTF(HtmCpu,
                "clearing instuction's transactional state htmUid=%u\n",
                getHtmTransactionUid());
 
            instFlags.reset(HtmFromTransaction);
            htmUid = -1;
            htmDepth = 0;
        }
    }

    void setSerializeBefore() { status.set(SerializeBefore); }

    void clearSerializeBefore() { status.reset(SerializeBefore); }

    bool isTempSerializeBefore() { return status[SerializeBefore]; }

    void setSerializeAfter() { status.set(SerializeAfter); }

    void clearSerializeAfter() { status.reset(SerializeAfter); }

    bool isTempSerializeAfter() { return status[SerializeAfter]; }

    void setSerializeHandled() { status.set(SerializeHandled); }

    bool isSerializeHandled() { return status[SerializeHandled]; }

    OpClass opClass() const { return staticInst->opClass(); }

    std::unique_ptr<PCStateBase>
    branchTarget() const
    {
        return staticInst->branchTarget(*pc);
    }

    size_t numSrcRegs() const { return numSrcs(); }

    size_t numDestRegs() const { return numDests(); }
 
    size_t
    numDestRegs(RegClassType type) const
    {
        return staticInst->numDestRegs(type);
    }

    const RegId& destRegIdx(int i) const { return staticInst->destRegIdx(i); }

    const RegId& srcRegIdx(int i) const { return staticInst->srcRegIdx(i); }

    uint8_t resultSize() { return instResult.size(); }

    InstResult
    popResult(InstResult dflt=InstResult())
    {
        if (!instResult.empty()) {
            InstResult t = instResult.front();
            instResult.pop();
            return t;
        }
        return dflt;
    }

    template<typename T>
    void
    setResult(const RegClass &reg_class, T &&t)
    {
        if (instFlags[RecordResult]) {
            instResult.emplace(reg_class, std::forward<T>(t));
        }
    }


    void markSrcRegReady();

    void markSrcRegReady(RegIndex src_idx);

    void setCompleted() { status.set(Completed); }

    bool isCompleted() const { return status[Completed]; }

    void setResultReady() { status.set(ResultReady); }

    bool isResultReady() const { return status[ResultReady]; }

    void setCanIssue() { status.set(CanIssue); }

    bool readyToIssue() const { return status[CanIssue]; }

    void clearCanIssue() { status.reset(CanIssue); }

    void setIssued() { status.set(Issued); }

    bool isIssued() const { return status[Issued]; }

    void clearIssued() { status.reset(Issued); }

    void setExecuted() { status.set(Executed); }

    bool isExecuted() const { return status[Executed]; }

    void setCanCommit() { status.set(CanCommit); }

    void clearCanCommit() { status.reset(CanCommit); }

    bool readyToCommit() const { return status[CanCommit]; }
 
    void setAtCommit() { status.set(AtCommit); }
 
    bool isAtCommit() { return status[AtCommit]; }

    void setCommitted() { status.set(Committed); }

    bool isCommitted() const { return status[Committed]; }

    void setSquashed();

    bool isSquashed() const { return status[Squashed]; }
 
    //Instruction Queue Entry
    //-----------------------
    void setInIQ() { status.set(IqEntry); }

    void clearInIQ() { status.reset(IqEntry); }

    bool isInIQ() const { return status[IqEntry]; }

    void setSquashedInIQ() { status.set(SquashedInIQ); status.set(Squashed);}

    bool isSquashedInIQ() const { return status[SquashedInIQ]; }
 
 
    //Load / Store Queue Functions
    //-----------------------
    void setInLSQ() { status.set(LsqEntry); }

    void removeInLSQ() { status.reset(LsqEntry); }

    bool isInLSQ() const { return status[LsqEntry]; }

    void setSquashedInLSQ() { status.set(SquashedInLSQ); status.set(Squashed);}

    bool isSquashedInLSQ() const { return status[SquashedInLSQ]; }
 
 
    //Reorder Buffer Functions
    //-----------------------
    void setInROB() { status.set(RobEntry); }

    void clearInROB() { status.reset(RobEntry); }

    bool isInROB() const { return status[RobEntry]; }

    void setSquashedInROB() { status.set(SquashedInROB); }

    bool isSquashedInROB() const { return status[SquashedInROB]; }

    void setNoCapableFU() { instFlags.set(NoCapableFU); }

    bool noCapableFU() const { return instFlags[NoCapableFU]; }

    bool isPinnedRegsRenamed() const { return status[PinnedRegsRenamed]; }

    void
    setPinnedRegsRenamed()
    {
        assert(!status[PinnedRegsSquashDone]);
        assert(!status[PinnedRegsWritten]);
        status.set(PinnedRegsRenamed);
    }

    bool isPinnedRegsWritten() const { return status[PinnedRegsWritten]; }

    void
    setPinnedRegsWritten()
    {
        assert(!status[PinnedRegsSquashDone]);
        assert(status[PinnedRegsRenamed]);
        status.set(PinnedRegsWritten);
    }

    bool
    isPinnedRegsSquashDone() const
    {
        return status[PinnedRegsSquashDone];
    }

    void
    setPinnedRegsSquashDone()
    {
        assert(!status[PinnedRegsSquashDone]);
        status.set(PinnedRegsSquashDone);
    }

    const PCStateBase &
    pcState() const override
    {
        return *pc;
    }

    void pcState(const PCStateBase &val) override { set(pc, val); }
 
    bool readPredicate() const override { return instFlags[Predicate]; }
 
    void
    setPredicate(bool val) override
    {
        instFlags[Predicate] = val;
 
        if (traceData) {
            traceData->setPredicate(val);
        }
    }
 
    bool
    readMemAccPredicate() const override
    {
        return instFlags[MemAccPredicate];
    }
 
    void
    setMemAccPredicate(bool val) override
    {
        instFlags[MemAccPredicate] = val;
    }

    void setTid(ThreadID tid) { threadNumber = tid; }

    void setThreadState(ThreadState *state) { thread = state; }

    gem5::ThreadContext *tcBase() const override { return thread->getTC(); }
 
  public:
    bool strictlyOrdered() const { return instFlags[IsStrictlyOrdered]; }
    void strictlyOrdered(bool so) { instFlags[IsStrictlyOrdered] = so; }

    bool hasRequest() const { return instFlags[ReqMade]; }
    void setRequest() { instFlags[ReqMade] = true; }

    ListIt &getInstListIt() { return instListIt; }

    void setInstListIt(ListIt _instListIt) { instListIt = _instListIt; }
 
  public:
    unsigned int
    readStCondFailures() const override
    {
        return thread->storeCondFailures;
    }

    void
    setStCondFailures(unsigned int sc_failures) override
    {
        thread->storeCondFailures = sc_failures;
    }
 
  public:
    // monitor/mwait funtions
    void
    armMonitor(Addr address) override
    {
        cpu->armMonitor(threadNumber, address);
    }
    bool
    mwait(PacketPtr pkt) override
    {
        return cpu->mwait(threadNumber, pkt);
    }
    void
    mwaitAtomic(gem5::ThreadContext *tc) override
    {
        return cpu->mwaitAtomic(threadNumber, tc, cpu->mmu);
    }
    AddressMonitor *
    getAddrMonitor() override
    {
        return cpu->getCpuAddrMonitor(threadNumber);
    }
 
  private:
    // hardware transactional memory
    uint64_t htmUid = -1;
    uint64_t htmDepth = 0;
 
  public:
    // Value -1 indicates that particular phase
    // hasn't happened (yet).
    Tick fetchTick = -1;      // instruction fetch is completed.
    int32_t decodeTick = -1;  // instruction enters decode phase
    int32_t renameTick = -1;  // instruction enters rename phase
    int32_t renameEndTick = -1; // instruction exits rename phase
    int32_t dispatchTick = -1;
    int32_t issueTick = -1;
    int32_t completeTick = -1;
    int32_t commitTick = -1;
    int32_t storeTick = -1;
 
    /* Values used by LoadToUse stat */
    Tick firstIssue = -1;
    Tick lastWakeDependents = -1;

    RegVal
    readMiscReg(int misc_reg) override
    {
        return cpu->readMiscReg(misc_reg, threadNumber);
    }

    void
    setMiscReg(int misc_reg, RegVal val) override
    {
        for (auto &idx: _destMiscRegIdx) {
            if (idx == misc_reg)
                return;
        }
 
        _destMiscRegIdx.push_back(misc_reg);
        _destMiscRegVal.push_back(val);
    }

    RegVal
    readMiscRegOperand(const StaticInst *si, int idx) override
    {
        const RegId& reg = si->srcRegIdx(idx);
        assert(reg.is(MiscRegClass));
        return cpu->readMiscReg(reg.index(), threadNumber);
    }

    void
    setMiscRegOperand(const StaticInst *si, int idx, RegVal val) override
    {
        const RegId& reg = si->destRegIdx(idx);
        assert(reg.is(MiscRegClass));
        setMiscReg(reg.index(), val);
    }

    void
    updateMiscRegs()
    {
        // @todo: Pretty convoluted way to avoid squashing from happening when
        // using the TC during an instruction's execution (specifically for
        // instructions that have side-effects that use the TC).  Fix this.
        // See cpu/o3/dyn_inst_impl.hh.
        bool no_squash_from_TC = thread->noSquashFromTC;
        thread->noSquashFromTC = true;
 
        for (int i = 0; i < _destMiscRegIdx.size(); i++)
            cpu->setMiscReg(
                _destMiscRegIdx[i], _destMiscRegVal[i], threadNumber);
 
        thread->noSquashFromTC = no_squash_from_TC;
    }
 
    void
    forwardOldRegs()
    {
 
        for (int idx = 0; idx < numDestRegs(); idx++) {
            PhysRegIdPtr prev_phys_reg = prevDestIdx(idx);
            const RegId& original_dest_reg = staticInst->destRegIdx(idx);
            const auto bytes = original_dest_reg.regClass().regBytes();
 
            // Registers which aren't renamed don't need to be forwarded.
            if (!original_dest_reg.isRenameable())
                continue;
 
            if (bytes == sizeof(RegVal)) {
                setRegOperand(staticInst.get(), idx,
                        cpu->getReg(prev_phys_reg, threadNumber));
            } else {
                const size_t size = original_dest_reg.regClass().regBytes();
                auto val = std::make_unique<uint8_t[]>(size);
                cpu->getReg(prev_phys_reg, val.get(), threadNumber);
                setRegOperand(staticInst.get(), idx, val.get());
            }
        }
    }

    void trap(const Fault &fault);
 
  public:
 
    // The register accessor methods provide the index of the
    // instruction's operand (e.g., 0 or 1), not the architectural
    // register index, to simplify the implementation of register
    // renaming.  We find the architectural register index by indexing
    // into the instruction's own operand index table.  Note that a
    // raw pointer to the StaticInst is provided instead of a
    // ref-counted StaticInstPtr to redice overhead.  This is fine as
    // long as these methods don't copy the pointer into any long-term
    // storage (which is pretty hard to imagine they would have reason
    // to do).
 
    RegVal
    getRegOperand(const StaticInst *si, int idx) override
    {
        const PhysRegIdPtr reg = renamedSrcIdx(idx);
        if (reg->is(InvalidRegClass))
            return 0;
        return cpu->getReg(reg, threadNumber);
    }
 
    void
    getRegOperand(const StaticInst *si, int idx, void *val) override
    {
        const PhysRegIdPtr reg = renamedSrcIdx(idx);
        if (reg->is(InvalidRegClass))
            return;
        cpu->getReg(reg, val, threadNumber);
    }
 
    void *
    getWritableRegOperand(const StaticInst *si, int idx) override
    {
        return cpu->getWritableReg(renamedDestIdx(idx), threadNumber);
    }

    void
    setRegOperand(const StaticInst *si, int idx, RegVal val) override
    {
        const PhysRegIdPtr reg = renamedDestIdx(idx);
        if (reg->is(InvalidRegClass))
            return;
        cpu->setReg(reg, val, threadNumber);
        setResult(reg->regClass(), val);
    }
 
    void
    setRegOperand(const StaticInst *si, int idx, const void *val) override
    {
        const PhysRegIdPtr reg = renamedDestIdx(idx);
        if (reg->is(InvalidRegClass))
            return;
        cpu->setReg(reg, val, threadNumber);
        setResult(reg->regClass(), val);
    }
};
 
} // namespace o3
} // namespace gem5
 
#endif // __CPU_O3_DYN_INST_HH__