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 "arch/faults.hh"
40 #include "cpu/exetrace.hh"
41 #include "mem/request.hh"
43 #include "cpu/base_dyn_inst.hh"
46 using namespace TheISA;
51 #include "base/hashmap.hh"
53 unsigned int MyHashFunc(const BaseDynInst *addr)
55 unsigned a = (unsigned)addr;
56 unsigned hash = (((a >> 14) ^ ((a >> 2) & 0xffff))) & 0x7FFFFFFF;
61 typedef m5::hash_map<const BaseDynInst *, const BaseDynInst *, MyHashFunc>
68 BaseDynInst<Impl>::BaseDynInst(ExtMachInst machInst, Addr inst_PC,
69 Addr pred_PC, InstSeqNum seq_num,
71 : staticInst(machInst), traceData(NULL), cpu(cpu)
76 nextPC = PC + sizeof(MachInst);
77 nextNPC = nextPC + sizeof(MachInst);
84 BaseDynInst<Impl>::BaseDynInst(StaticInstPtr &_staticInst)
85 : staticInst(_staticInst), traceData(NULL)
93 BaseDynInst<Impl>::initVars()
102 instResult.integer = 0;
112 // Eventually make this a parameter.
115 // Also make this a parameter, or perhaps get it from xc or cpu.
118 // Initialize the fault to be NoFault.
123 if (instcount > 1500) {
128 assert(instcount <= 1500);
131 DPRINTF(DynInst, "DynInst: [sn:%lli] Instruction created. Instcount=%i\n",
135 cpu->snList.insert(seqNum);
139 template <class Impl>
140 BaseDynInst<Impl>::~BaseDynInst()
158 DPRINTF(DynInst, "DynInst: [sn:%lli] Instruction destroyed. Instcount=%i\n",
161 cpu->snList.erase(seqNum);
166 template <class Impl>
168 BaseDynInst<Impl>::dumpSNList()
170 std::set<InstSeqNum>::iterator sn_it = cpu->snList.begin();
173 while (sn_it != cpu->snList.end()) {
174 cprintf("%i: [sn:%lli] not destroyed\n", count, (*sn_it));
181 template <class Impl>
183 BaseDynInst<Impl>::prefetch(Addr addr, unsigned flags)
185 // This is the "functional" implementation of prefetch. Not much
186 // happens here since prefetches don't affect the architectural
189 // Generate a MemReq so we can translate the effective address.
190 MemReqPtr req = new MemReq(addr, thread->getXCProxy(), 1, flags);
193 // Prefetches never cause faults.
196 // note this is a local, not BaseDynInst::fault
197 Fault trans_fault = cpu->translateDataReadReq(req);
199 if (trans_fault == NoFault && !(req->flags & UNCACHEABLE)) {
200 // It's a valid address to cacheable space. Record key MemReq
201 // parameters so we can generate another one just like it for
202 // the timing access without calling translate() again (which
203 // might mess up the TLB).
204 effAddr = req->vaddr;
205 physEffAddr = req->paddr;
206 memReqFlags = req->flags;
208 // Bogus address (invalid or uncacheable space). Mark it by
209 // setting the eff_addr to InvalidAddr.
210 effAddr = physEffAddr = MemReq::inval_addr;
214 traceData->setAddr(addr);
219 template <class Impl>
221 BaseDynInst<Impl>::writeHint(Addr addr, int size, unsigned flags)
223 // Not currently supported.
227 * @todo Need to find a way to get the cache block size here.
229 template <class Impl>
231 BaseDynInst<Impl>::copySrcTranslate(Addr src)
233 // Not currently supported.
238 * @todo Need to find a way to get the cache block size here.
240 template <class Impl>
242 BaseDynInst<Impl>::copy(Addr dest)
244 // Not currently supported.
248 template <class Impl>
250 BaseDynInst<Impl>::dump()
252 cprintf("T%d : %#08d `", threadNumber, PC);
253 cout << staticInst->disassemble(PC);
257 template <class Impl>
259 BaseDynInst<Impl>::dump(std::string &outstring)
261 std::ostringstream s;
262 s << "T" << threadNumber << " : 0x" << PC << " "
263 << staticInst->disassemble(PC);
268 template <class Impl>
270 BaseDynInst<Impl>::markSrcRegReady()
272 if (++readyRegs == numSrcRegs()) {
273 status.set(CanIssue);
277 template <class Impl>
279 BaseDynInst<Impl>::markSrcRegReady(RegIndex src_idx)
281 _readySrcRegIdx[src_idx] = true;
286 template <class Impl>
288 BaseDynInst<Impl>::eaSrcsReady()
290 // For now I am assuming that src registers 1..n-1 are the ones that the
291 // EA calc depends on. (i.e. src reg 0 is the source of the data to be
294 for (int i = 1; i < numSrcRegs(); ++i) {
295 if (!_readySrcRegIdx[i])