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"
39 #include "sim/faults.hh"
40 #include "cpu/exetrace.hh"
41 #include "mem/request.hh"
43 #include "cpu/base_dyn_inst.hh"
48 #include "base/hashmap.hh"
50 unsigned int MyHashFunc(const BaseDynInst *addr)
52 unsigned a = (unsigned)addr;
53 unsigned hash = (((a >> 14) ^ ((a >> 2) & 0xffff))) & 0x7FFFFFFF;
58 typedef m5::hash_map<const BaseDynInst *, const BaseDynInst *, MyHashFunc>
65 BaseDynInst<Impl>::BaseDynInst(TheISA::ExtMachInst machInst,
66 Addr inst_PC, Addr inst_NPC,
67 Addr pred_PC, Addr pred_NPC,
68 InstSeqNum seq_num, ImplCPU *cpu)
69 : staticInst(machInst), traceData(NULL), cpu(cpu)
75 nextNPC = nextPC + sizeof(TheISA::MachInst);
84 BaseDynInst<Impl>::BaseDynInst(StaticInstPtr &_staticInst)
85 : staticInst(_staticInst), traceData(NULL)
93 BaseDynInst<Impl>::initVars()
102 instResult.integer = 0;
113 // Eventually make this a parameter.
116 // Also make this a parameter, or perhaps get it from xc or cpu.
119 // Initialize the fault to be NoFault.
124 if (instcount > 1500) {
129 assert(instcount <= 1500);
132 DPRINTF(DynInst, "DynInst: [sn:%lli] Instruction created. Instcount=%i\n",
136 cpu->snList.insert(seqNum);
140 template <class Impl>
141 BaseDynInst<Impl>::~BaseDynInst()
159 DPRINTF(DynInst, "DynInst: [sn:%lli] Instruction destroyed. Instcount=%i\n",
162 cpu->snList.erase(seqNum);
167 template <class Impl>
169 BaseDynInst<Impl>::dumpSNList()
171 std::set<InstSeqNum>::iterator sn_it = cpu->snList.begin();
174 while (sn_it != cpu->snList.end()) {
175 cprintf("%i: [sn:%lli] not destroyed\n", count, (*sn_it));
182 template <class Impl>
184 BaseDynInst<Impl>::prefetch(Addr addr, unsigned flags)
186 // This is the "functional" implementation of prefetch. Not much
187 // happens here since prefetches don't affect the architectural
190 // Generate a MemReq so we can translate the effective address.
191 MemReqPtr req = new MemReq(addr, thread->getXCProxy(), 1, flags);
194 // Prefetches never cause faults.
197 // note this is a local, not BaseDynInst::fault
198 Fault trans_fault = cpu->translateDataReadReq(req);
200 if (trans_fault == NoFault && !(req->isUncacheable())) {
201 // It's a valid address to cacheable space. Record key MemReq
202 // parameters so we can generate another one just like it for
203 // the timing access without calling translate() again (which
204 // might mess up the TLB).
205 effAddr = req->vaddr;
206 physEffAddr = req->paddr;
207 memReqFlags = req->flags;
209 // Bogus address (invalid or uncacheable space). Mark it by
210 // setting the eff_addr to InvalidAddr.
211 effAddr = physEffAddr = MemReq::inval_addr;
215 traceData->setAddr(addr);
220 template <class Impl>
222 BaseDynInst<Impl>::writeHint(Addr addr, int size, unsigned flags)
224 // Not currently supported.
228 * @todo Need to find a way to get the cache block size here.
230 template <class Impl>
232 BaseDynInst<Impl>::copySrcTranslate(Addr src)
234 // Not currently supported.
239 * @todo Need to find a way to get the cache block size here.
241 template <class Impl>
243 BaseDynInst<Impl>::copy(Addr dest)
245 // Not currently supported.
249 template <class Impl>
251 BaseDynInst<Impl>::dump()
253 cprintf("T%d : %#08d `", threadNumber, PC);
254 std::cout << staticInst->disassemble(PC);
258 template <class Impl>
260 BaseDynInst<Impl>::dump(std::string &outstring)
262 std::ostringstream s;
263 s << "T" << threadNumber << " : 0x" << PC << " "
264 << staticInst->disassemble(PC);
269 template <class Impl>
271 BaseDynInst<Impl>::markSrcRegReady()
273 if (++readyRegs == numSrcRegs()) {
274 status.set(CanIssue);
278 template <class Impl>
280 BaseDynInst<Impl>::markSrcRegReady(RegIndex src_idx)
282 _readySrcRegIdx[src_idx] = true;
287 template <class Impl>
289 BaseDynInst<Impl>::eaSrcsReady()
291 // For now I am assuming that src registers 1..n-1 are the ones that the
292 // EA calc depends on. (i.e. src reg 0 is the source of the data to be
295 for (int i = 1; i < numSrcRegs(); ++i) {
296 if (!_readySrcRegIdx[i])