2 * Copyright (c) 2004-2006 The Regents of The University of Michigan
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions are
7 * met: redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer;
9 * redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution;
12 * neither the name of the copyright holders nor the names of its
13 * contributors may be used to endorse or promote products derived from
14 * this software without specific prior written permission.
16 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 #include "base/cprintf.hh"
37 #include "base/trace.hh"
38 #include "config/the_isa.hh"
39 #include "cpu/base_dyn_inst.hh"
40 #include "cpu/exetrace.hh"
41 #include "mem/request.hh"
42 #include "sim/faults.hh"
47 #include "base/hashmap.hh"
49 unsigned int MyHashFunc(const BaseDynInst *addr)
51 unsigned a = (unsigned)addr;
52 unsigned hash = (((a >> 14) ^ ((a >> 2) & 0xffff))) & 0x7FFFFFFF;
57 typedef m5::hash_map<const BaseDynInst *, const BaseDynInst *, MyHashFunc>
64 BaseDynInst<Impl>::BaseDynInst(StaticInstPtr _staticInst,
65 TheISA::PCState _pc, TheISA::PCState _predPC,
66 InstSeqNum seq_num, ImplCPU *cpu)
67 : staticInst(_staticInst), traceData(NULL), cpu(cpu)
79 BaseDynInst<Impl>::BaseDynInst(TheISA::ExtMachInst inst,
80 TheISA::PCState _pc, TheISA::PCState _predPC,
81 InstSeqNum seq_num, ImplCPU *cpu)
82 : staticInst(inst, _pc.instAddr()), traceData(NULL), cpu(cpu)
94 BaseDynInst<Impl>::BaseDynInst(StaticInstPtr &_staticInst)
95 : staticInst(_staticInst), traceData(NULL)
101 template <class Impl>
103 BaseDynInst<Impl>::initVars()
107 effAddrValid = false;
110 isUncacheable = false;
114 instResult.integer = 0;
126 // Eventually make this a parameter.
129 // Also make this a parameter, or perhaps get it from xc or cpu.
132 // Initialize the fault to be NoFault.
138 if (cpu->instcount > 1500) {
143 assert(cpu->instcount <= 1500);
147 "DynInst: [sn:%lli] Instruction created. Instcount for %s = %i\n",
148 seqNum, cpu->name(), cpu->instcount);
152 cpu->snList.insert(seqNum);
156 template <class Impl>
157 BaseDynInst<Impl>::~BaseDynInst()
173 "DynInst: [sn:%lli] Instruction destroyed. Instcount for %s = %i\n",
174 seqNum, cpu->name(), cpu->instcount);
177 cpu->snList.erase(seqNum);
182 template <class Impl>
184 BaseDynInst<Impl>::dumpSNList()
186 std::set<InstSeqNum>::iterator sn_it = cpu->snList.begin();
189 while (sn_it != cpu->snList.end()) {
190 cprintf("%i: [sn:%lli] not destroyed\n", count, (*sn_it));
197 template <class Impl>
199 BaseDynInst<Impl>::prefetch(Addr addr, unsigned flags)
201 // This is the "functional" implementation of prefetch. Not much
202 // happens here since prefetches don't affect the architectural
205 // Generate a MemReq so we can translate the effective address.
206 MemReqPtr req = new MemReq(addr, thread->getXCProxy(), 1, flags);
209 // Prefetches never cause faults.
212 // note this is a local, not BaseDynInst::fault
213 Fault trans_fault = cpu->translateDataReadReq(req);
215 if (trans_fault == NoFault && !(req->isUncacheable())) {
216 // It's a valid address to cacheable space. Record key MemReq
217 // parameters so we can generate another one just like it for
218 // the timing access without calling translate() again (which
219 // might mess up the TLB).
220 effAddr = req->vaddr;
221 physEffAddr = req->paddr;
222 memReqFlags = req->flags;
224 // Bogus address (invalid or uncacheable space). Mark it by
225 // setting the eff_addr to InvalidAddr.
226 effAddr = physEffAddr = MemReq::inval_addr;
230 traceData->setAddr(addr);
235 template <class Impl>
237 BaseDynInst<Impl>::writeHint(Addr addr, int size, unsigned flags)
239 // Not currently supported.
243 * @todo Need to find a way to get the cache block size here.
245 template <class Impl>
247 BaseDynInst<Impl>::copySrcTranslate(Addr src)
249 // Not currently supported.
254 * @todo Need to find a way to get the cache block size here.
256 template <class Impl>
258 BaseDynInst<Impl>::copy(Addr dest)
260 // Not currently supported.
264 template <class Impl>
266 BaseDynInst<Impl>::dump()
268 cprintf("T%d : %#08d `", threadNumber, pc.instAddr());
269 std::cout << staticInst->disassemble(pc.instAddr());
273 template <class Impl>
275 BaseDynInst<Impl>::dump(std::string &outstring)
277 std::ostringstream s;
278 s << "T" << threadNumber << " : 0x" << pc.instAddr() << " "
279 << staticInst->disassemble(pc.instAddr());
284 template <class Impl>
286 BaseDynInst<Impl>::markSrcRegReady()
288 DPRINTF(IQ, "[sn:%lli] has %d ready out of %d sources. RTI %d)\n",
289 seqNum, readyRegs+1, numSrcRegs(), readyToIssue());
290 if (++readyRegs == numSrcRegs()) {
295 template <class Impl>
297 BaseDynInst<Impl>::markSrcRegReady(RegIndex src_idx)
299 _readySrcRegIdx[src_idx] = true;
304 template <class Impl>
306 BaseDynInst<Impl>::eaSrcsReady()
308 // For now I am assuming that src registers 1..n-1 are the ones that the
309 // EA calc depends on. (i.e. src reg 0 is the source of the data to be
312 for (int i = 1; i < numSrcRegs(); ++i) {
313 if (!_readySrcRegIdx[i])