cpu_impl.hh revision 2838
12315SN/A/* 22332SN/A * Copyright (c) 2006 The Regents of The University of Michigan 32315SN/A * All rights reserved. 42315SN/A * 52315SN/A * Redistribution and use in source and binary forms, with or without 62315SN/A * modification, are permitted provided that the following conditions are 72315SN/A * met: redistributions of source code must retain the above copyright 82315SN/A * notice, this list of conditions and the following disclaimer; 92315SN/A * redistributions in binary form must reproduce the above copyright 102315SN/A * notice, this list of conditions and the following disclaimer in the 112315SN/A * documentation and/or other materials provided with the distribution; 122315SN/A * neither the name of the copyright holders nor the names of its 132315SN/A * contributors may be used to endorse or promote products derived from 142315SN/A * this software without specific prior written permission. 152315SN/A * 162315SN/A * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 172315SN/A * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 182315SN/A * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 192315SN/A * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 202315SN/A * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 212315SN/A * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 222315SN/A * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 232315SN/A * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 242315SN/A * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 252315SN/A * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 262315SN/A * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 272689SN/A * 282689SN/A * Authors: Kevin Lim 292315SN/A */ 302315SN/A 312315SN/A#include <list> 322315SN/A#include <string> 332315SN/A 342315SN/A#include "base/refcnt.hh" 352315SN/A#include "cpu/base_dyn_inst.hh" 362315SN/A#include "cpu/checker/cpu.hh" 372683SN/A#include "cpu/simple_thread.hh" 382680SN/A#include "cpu/thread_context.hh" 392315SN/A#include "cpu/static_inst.hh" 402722SN/A#include "mem/packet_impl.hh" 412315SN/A#include "sim/byteswap.hh" 422315SN/A#include "sim/sim_object.hh" 432315SN/A#include "sim/stats.hh" 442315SN/A 452315SN/A#if FULL_SYSTEM 462315SN/A#include "arch/vtophys.hh" 472315SN/A#endif // FULL_SYSTEM 482315SN/A 492315SN/Ausing namespace std; 502315SN/A//The CheckerCPU does alpha only 512315SN/Ausing namespace AlphaISA; 522315SN/A 532315SN/Atemplate <class DynInstPtr> 542315SN/Avoid 552732SN/AChecker<DynInstPtr>::verify(DynInstPtr &completed_inst) 562315SN/A{ 572315SN/A DynInstPtr inst; 582315SN/A 592332SN/A // Either check this instruction, or add it to a list of 602332SN/A // instructions waiting to be checked. Instructions must be 612332SN/A // checked in program order, so if a store has committed yet not 622332SN/A // completed, there may be some instructions that are waiting 632332SN/A // behind it that have completed and must be checked. 642315SN/A if (!instList.empty()) { 652315SN/A if (youngestSN < completed_inst->seqNum) { 662315SN/A DPRINTF(Checker, "Adding instruction [sn:%lli] PC:%#x to list.\n", 672315SN/A completed_inst->seqNum, completed_inst->readPC()); 682315SN/A instList.push_back(completed_inst); 692315SN/A youngestSN = completed_inst->seqNum; 702315SN/A } 712315SN/A 722315SN/A if (!instList.front()->isCompleted()) { 732315SN/A return; 742315SN/A } else { 752315SN/A inst = instList.front(); 762315SN/A instList.pop_front(); 772315SN/A } 782315SN/A } else { 792315SN/A if (!completed_inst->isCompleted()) { 802315SN/A if (youngestSN < completed_inst->seqNum) { 812315SN/A DPRINTF(Checker, "Adding instruction [sn:%lli] PC:%#x to list.\n", 822315SN/A completed_inst->seqNum, completed_inst->readPC()); 832315SN/A instList.push_back(completed_inst); 842315SN/A youngestSN = completed_inst->seqNum; 852315SN/A } 862315SN/A return; 872315SN/A } else { 882315SN/A if (youngestSN < completed_inst->seqNum) { 892315SN/A inst = completed_inst; 902315SN/A youngestSN = completed_inst->seqNum; 912315SN/A } else { 922315SN/A return; 932315SN/A } 942315SN/A } 952315SN/A } 962315SN/A 972332SN/A // Try to check all instructions that are completed, ending if we 982332SN/A // run out of instructions to check or if an instruction is not 992332SN/A // yet completed. 1002315SN/A while (1) { 1012315SN/A DPRINTF(Checker, "Processing instruction [sn:%lli] PC:%#x.\n", 1022315SN/A inst->seqNum, inst->readPC()); 1032315SN/A unverifiedResult.integer = inst->readIntResult(); 1042315SN/A unverifiedReq = inst->req; 1052679SN/A unverifiedMemData = inst->memData; 1062315SN/A numCycles++; 1072315SN/A 1082315SN/A Fault fault = NoFault; 1092315SN/A 1102315SN/A // maintain $r0 semantics 1112683SN/A thread->setIntReg(ZeroReg, 0); 1122315SN/A#ifdef TARGET_ALPHA 1132683SN/A thread->setFloatRegDouble(ZeroReg, 0.0); 1142315SN/A#endif // TARGET_ALPHA 1152315SN/A 1162332SN/A // Check if any recent PC changes match up with anything we 1172332SN/A // expect to happen. This is mostly to check if traps or 1182332SN/A // PC-based events have occurred in both the checker and CPU. 1192315SN/A if (changedPC) { 1202315SN/A DPRINTF(Checker, "Changed PC recently to %#x\n", 1212683SN/A thread->readPC()); 1222315SN/A if (willChangePC) { 1232683SN/A if (newPC == thread->readPC()) { 1242315SN/A DPRINTF(Checker, "Changed PC matches expected PC\n"); 1252315SN/A } else { 1262332SN/A warn("%lli: Changed PC does not match expected PC, " 1272332SN/A "changed: %#x, expected: %#x", 1282683SN/A curTick, thread->readPC(), newPC); 1292732SN/A CheckerCPU::handleError(); 1302315SN/A } 1312315SN/A willChangePC = false; 1322315SN/A } 1332315SN/A changedPC = false; 1342315SN/A } 1352315SN/A if (changedNextPC) { 1362315SN/A DPRINTF(Checker, "Changed NextPC recently to %#x\n", 1372683SN/A thread->readNextPC()); 1382315SN/A changedNextPC = false; 1392315SN/A } 1402315SN/A 1412332SN/A // Try to fetch the instruction 1422332SN/A 1432332SN/A#if FULL_SYSTEM 1442332SN/A#define IFETCH_FLAGS(pc) ((pc) & 1) ? PHYSICAL : 0 1452332SN/A#else 1462332SN/A#define IFETCH_FLAGS(pc) 0 1472332SN/A#endif 1482332SN/A 1492683SN/A uint64_t fetch_PC = thread->readPC() & ~3; 1502679SN/A 1512332SN/A // set up memory request for instruction fetch 1522679SN/A memReq = new Request(inst->threadNumber, fetch_PC, 1532679SN/A sizeof(uint32_t), 1542683SN/A IFETCH_FLAGS(thread->readPC()), 1552683SN/A fetch_PC, thread->readCpuId(), inst->threadNumber); 1562315SN/A 1572315SN/A bool succeeded = translateInstReq(memReq); 1582315SN/A 1592315SN/A if (!succeeded) { 1602323SN/A if (inst->getFault() == NoFault) { 1612332SN/A // In this case the instruction was not a dummy 1622332SN/A // instruction carrying an ITB fault. In the single 1632332SN/A // threaded case the ITB should still be able to 1642332SN/A // translate this instruction; in the SMT case it's 1652332SN/A // possible that its ITB entry was kicked out. 1662332SN/A warn("%lli: Instruction PC %#x was not found in the ITB!", 1672683SN/A curTick, thread->readPC()); 1682732SN/A handleError(inst); 1692315SN/A 1702323SN/A // go to the next instruction 1712683SN/A thread->setPC(thread->readNextPC()); 1722683SN/A thread->setNextPC(thread->readNextPC() + sizeof(MachInst)); 1732315SN/A 1742323SN/A return; 1752323SN/A } else { 1762332SN/A // The instruction is carrying an ITB fault. Handle 1772332SN/A // the fault and see if our results match the CPU on 1782332SN/A // the next tick(). 1792323SN/A fault = inst->getFault(); 1802323SN/A } 1812315SN/A } 1822315SN/A 1832323SN/A if (fault == NoFault) { 1842679SN/A Packet *pkt = new Packet(memReq, Packet::ReadReq, 1852679SN/A Packet::Broadcast); 1862679SN/A 1872679SN/A pkt->dataStatic(&machInst); 1882679SN/A 1892679SN/A icachePort->sendFunctional(pkt); 1902679SN/A 1912679SN/A delete pkt; 1922315SN/A 1932332SN/A // keep an instruction count 1942323SN/A numInst++; 1952315SN/A 1962323SN/A // decode the instruction 1972323SN/A machInst = gtoh(machInst); 1982323SN/A // Checks that the instruction matches what we expected it to be. 1992323SN/A // Checks both the machine instruction and the PC. 2002323SN/A validateInst(inst); 2012315SN/A 2022332SN/A curStaticInst = StaticInst::decode(makeExtMI(machInst, 2032683SN/A thread->readPC())); 2042315SN/A 2052315SN/A#if FULL_SYSTEM 2062683SN/A thread->setInst(machInst); 2072315SN/A#endif // FULL_SYSTEM 2082315SN/A 2092323SN/A fault = inst->getFault(); 2102323SN/A } 2112315SN/A 2122679SN/A // Discard fetch's memReq. 2132679SN/A delete memReq; 2142679SN/A memReq = NULL; 2152679SN/A 2162315SN/A // Either the instruction was a fault and we should process the fault, 2172315SN/A // or we should just go ahead execute the instruction. This assumes 2182315SN/A // that the instruction is properly marked as a fault. 2192315SN/A if (fault == NoFault) { 2202315SN/A 2212683SN/A thread->funcExeInst++; 2222315SN/A 2232315SN/A fault = curStaticInst->execute(this, NULL); 2242315SN/A 2252315SN/A // Checks to make sure instrution results are correct. 2262315SN/A validateExecution(inst); 2272315SN/A 2282315SN/A if (curStaticInst->isLoad()) { 2292315SN/A ++numLoad; 2302315SN/A } 2312315SN/A } 2322315SN/A 2332315SN/A if (fault != NoFault) { 2342315SN/A#if FULL_SYSTEM 2352690SN/A fault->invoke(tc); 2362315SN/A willChangePC = true; 2372683SN/A newPC = thread->readPC(); 2382315SN/A DPRINTF(Checker, "Fault, PC is now %#x\n", newPC); 2392838Sktlim@umich.edu#endif 2402315SN/A } else { 2412315SN/A#if THE_ISA != MIPS_ISA 2422315SN/A // go to the next instruction 2432683SN/A thread->setPC(thread->readNextPC()); 2442683SN/A thread->setNextPC(thread->readNextPC() + sizeof(MachInst)); 2452315SN/A#else 2462315SN/A // go to the next instruction 2472683SN/A thread->setPC(thread->readNextPC()); 2482683SN/A thread->setNextPC(thread->readNextNPC()); 2492683SN/A thread->setNextNPC(thread->readNextNPC() + sizeof(MachInst)); 2502315SN/A#endif 2512315SN/A 2522315SN/A } 2532315SN/A 2542315SN/A#if FULL_SYSTEM 2552332SN/A // @todo: Determine if these should happen only if the 2562332SN/A // instruction hasn't faulted. In the SimpleCPU case this may 2572332SN/A // not be true, but in the O3 or Ozone case this may be true. 2582315SN/A Addr oldpc; 2592315SN/A int count = 0; 2602315SN/A do { 2612683SN/A oldpc = thread->readPC(); 2622690SN/A system->pcEventQueue.service(tc); 2632315SN/A count++; 2642683SN/A } while (oldpc != thread->readPC()); 2652315SN/A if (count > 1) { 2662315SN/A willChangePC = true; 2672683SN/A newPC = thread->readPC(); 2682315SN/A DPRINTF(Checker, "PC Event, PC is now %#x\n", newPC); 2692315SN/A } 2702315SN/A#endif 2712315SN/A 2722332SN/A // @todo: Optionally can check all registers. (Or just those 2732315SN/A // that have been modified). 2742315SN/A validateState(); 2752315SN/A 2762679SN/A if (memReq) { 2772679SN/A delete memReq; 2782679SN/A memReq = NULL; 2792679SN/A } 2802679SN/A 2812332SN/A // Continue verifying instructions if there's another completed 2822332SN/A // instruction waiting to be verified. 2832315SN/A if (instList.empty()) { 2842315SN/A break; 2852315SN/A } else if (instList.front()->isCompleted()) { 2862315SN/A inst = instList.front(); 2872315SN/A instList.pop_front(); 2882315SN/A } else { 2892315SN/A break; 2902315SN/A } 2912315SN/A } 2922315SN/A} 2932315SN/A 2942315SN/Atemplate <class DynInstPtr> 2952315SN/Avoid 2962315SN/AChecker<DynInstPtr>::switchOut(Sampler *s) 2972315SN/A{ 2982315SN/A instList.clear(); 2992315SN/A} 3002315SN/A 3012315SN/Atemplate <class DynInstPtr> 3022315SN/Avoid 3032315SN/AChecker<DynInstPtr>::takeOverFrom(BaseCPU *oldCPU) 3042315SN/A{ 3052315SN/A} 3062315SN/A 3072315SN/Atemplate <class DynInstPtr> 3082315SN/Avoid 3092315SN/AChecker<DynInstPtr>::validateInst(DynInstPtr &inst) 3102315SN/A{ 3112683SN/A if (inst->readPC() != thread->readPC()) { 3122332SN/A warn("%lli: PCs do not match! Inst: %#x, checker: %#x", 3132683SN/A curTick, inst->readPC(), thread->readPC()); 3142315SN/A if (changedPC) { 3152332SN/A warn("%lli: Changed PCs recently, may not be an error", 3162332SN/A curTick); 3172315SN/A } else { 3182732SN/A handleError(inst); 3192315SN/A } 3202315SN/A } 3212315SN/A 3222332SN/A MachInst mi = static_cast<MachInst>(inst->staticInst->machInst); 3232332SN/A 3242332SN/A if (mi != machInst) { 3252332SN/A warn("%lli: Binary instructions do not match! Inst: %#x, " 3262332SN/A "checker: %#x", 3272332SN/A curTick, mi, machInst); 3282732SN/A handleError(inst); 3292315SN/A } 3302315SN/A} 3312315SN/A 3322315SN/Atemplate <class DynInstPtr> 3332315SN/Avoid 3342315SN/AChecker<DynInstPtr>::validateExecution(DynInstPtr &inst) 3352315SN/A{ 3362732SN/A bool result_mismatch = false; 3372315SN/A if (inst->numDestRegs()) { 3382332SN/A // @todo: Support more destination registers. 3392315SN/A if (inst->isUnverifiable()) { 3402332SN/A // Unverifiable instructions assume they were executed 3412332SN/A // properly by the CPU. Grab the result from the 3422332SN/A // instruction and write it to the register. 3432732SN/A copyResult(inst); 3442315SN/A } else if (result.integer != inst->readIntResult()) { 3452732SN/A result_mismatch = true; 3462732SN/A } 3472732SN/A } 3482732SN/A 3492732SN/A if (result_mismatch) { 3502732SN/A warn("%lli: Instruction results do not match! (Values may not " 3512732SN/A "actually be integers) Inst: %#x, checker: %#x", 3522732SN/A curTick, inst->readIntResult(), result.integer); 3532732SN/A 3542732SN/A // It's useful to verify load values from memory, but in MP 3552732SN/A // systems the value obtained at execute may be different than 3562732SN/A // the value obtained at completion. Similarly DMA can 3572732SN/A // present the same problem on even UP systems. Thus there is 3582732SN/A // the option to only warn on loads having a result error. 3592732SN/A if (inst->isLoad() && warnOnlyOnLoadError) { 3602732SN/A copyResult(inst); 3612732SN/A } else { 3622732SN/A handleError(inst); 3632315SN/A } 3642315SN/A } 3652315SN/A 3662683SN/A if (inst->readNextPC() != thread->readNextPC()) { 3672332SN/A warn("%lli: Instruction next PCs do not match! Inst: %#x, " 3682332SN/A "checker: %#x", 3692683SN/A curTick, inst->readNextPC(), thread->readNextPC()); 3702732SN/A handleError(inst); 3712315SN/A } 3722315SN/A 3732315SN/A // Checking side effect registers can be difficult if they are not 3742315SN/A // checked simultaneously with the execution of the instruction. 3752315SN/A // This is because other valid instructions may have modified 3762315SN/A // these registers in the meantime, and their values are not 3772315SN/A // stored within the DynInst. 3782315SN/A while (!miscRegIdxs.empty()) { 3792315SN/A int misc_reg_idx = miscRegIdxs.front(); 3802315SN/A miscRegIdxs.pop(); 3812315SN/A 3822680SN/A if (inst->tcBase()->readMiscReg(misc_reg_idx) != 3832683SN/A thread->readMiscReg(misc_reg_idx)) { 3842332SN/A warn("%lli: Misc reg idx %i (side effect) does not match! " 3852332SN/A "Inst: %#x, checker: %#x", 3862332SN/A curTick, misc_reg_idx, 3872680SN/A inst->tcBase()->readMiscReg(misc_reg_idx), 3882683SN/A thread->readMiscReg(misc_reg_idx)); 3892732SN/A handleError(inst); 3902315SN/A } 3912315SN/A } 3922315SN/A} 3932315SN/A 3942315SN/Atemplate <class DynInstPtr> 3952315SN/Avoid 3962315SN/AChecker<DynInstPtr>::validateState() 3972315SN/A{ 3982315SN/A} 3992315SN/A 4002315SN/Atemplate <class DynInstPtr> 4012315SN/Avoid 4022732SN/AChecker<DynInstPtr>::copyResult(DynInstPtr &inst) 4032732SN/A{ 4042732SN/A RegIndex idx = inst->destRegIdx(0); 4052732SN/A if (idx < TheISA::FP_Base_DepTag) { 4062732SN/A thread->setIntReg(idx, inst->readIntResult()); 4072732SN/A } else if (idx < TheISA::Fpcr_DepTag) { 4082732SN/A thread->setFloatRegBits(idx, inst->readIntResult()); 4092732SN/A } else { 4102732SN/A thread->setMiscReg(idx, inst->readIntResult()); 4112732SN/A } 4122732SN/A} 4132732SN/A 4142732SN/Atemplate <class DynInstPtr> 4152732SN/Avoid 4162732SN/AChecker<DynInstPtr>::dumpAndExit(DynInstPtr &inst) 4172732SN/A{ 4182732SN/A cprintf("Error detected, instruction information:\n"); 4192732SN/A cprintf("PC:%#x, nextPC:%#x\n[sn:%lli]\n[tid:%i]\n" 4202732SN/A "Completed:%i\n", 4212732SN/A inst->readPC(), 4222732SN/A inst->readNextPC(), 4232732SN/A inst->seqNum, 4242732SN/A inst->threadNumber, 4252732SN/A inst->isCompleted()); 4262732SN/A inst->dump(); 4272732SN/A CheckerCPU::dumpAndExit(); 4282732SN/A} 4292732SN/A 4302732SN/Atemplate <class DynInstPtr> 4312732SN/Avoid 4322315SN/AChecker<DynInstPtr>::dumpInsts() 4332315SN/A{ 4342315SN/A int num = 0; 4352315SN/A 4362315SN/A InstListIt inst_list_it = --(instList.end()); 4372315SN/A 4382315SN/A cprintf("Inst list size: %i\n", instList.size()); 4392315SN/A 4402315SN/A while (inst_list_it != instList.end()) 4412315SN/A { 4422315SN/A cprintf("Instruction:%i\n", 4432315SN/A num); 4442315SN/A 4452315SN/A cprintf("PC:%#x\n[sn:%lli]\n[tid:%i]\n" 4462315SN/A "Completed:%i\n", 4472315SN/A (*inst_list_it)->readPC(), 4482315SN/A (*inst_list_it)->seqNum, 4492315SN/A (*inst_list_it)->threadNumber, 4502315SN/A (*inst_list_it)->isCompleted()); 4512315SN/A 4522315SN/A cprintf("\n"); 4532315SN/A 4542315SN/A inst_list_it--; 4552315SN/A ++num; 4562315SN/A } 4572315SN/A 4582315SN/A} 459