2 * Copyright (c) 2011 ARM Limited
5 * The license below extends only to copyright in the software and shall
6 * not be construed as granting a license to any other intellectual
7 * property including but not limited to intellectual property relating
8 * to a hardware implementation of the functionality of the software
9 * licensed hereunder. You may use the software subject to the license
10 * terms below provided that you ensure that this notice is replicated
11 * unmodified and in its entirety in all distributions of the software,
12 * modified or unmodified, in source code or in binary form.
14 * Copyright (c) 2004-2006 The Regents of The University of Michigan
15 * All rights reserved.
17 * Redistribution and use in source and binary forms, with or without
18 * modification, are permitted provided that the following conditions are
19 * met: redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer;
21 * redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution;
24 * neither the name of the copyright holders nor the names of its
25 * contributors may be used to endorse or promote products derived from
26 * this software without specific prior written permission.
28 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
29 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
30 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
31 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
32 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
33 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
34 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
35 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
36 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
37 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
38 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
48 #include "base/cprintf.hh"
49 #include "base/trace.hh"
50 #include "config/the_isa.hh"
51 #include "cpu/base_dyn_inst.hh"
52 #include "cpu/exetrace.hh"
53 #include "debug/DynInst.hh"
54 #include "debug/IQ.hh"
55 #include "mem/request.hh"
56 #include "sim/faults.hh"
61 #include "base/hashmap.hh"
63 unsigned int MyHashFunc(const BaseDynInst *addr)
65 unsigned a = (unsigned)addr;
66 unsigned hash = (((a >> 14) ^ ((a >> 2) & 0xffff))) & 0x7FFFFFFF;
71 typedef m5::hash_map<const BaseDynInst *, const BaseDynInst *, MyHashFunc>
78 BaseDynInst<Impl>::BaseDynInst(StaticInstPtr _staticInst,
79 StaticInstPtr _macroop,
80 TheISA::PCState _pc, TheISA::PCState _predPC,
81 InstSeqNum seq_num, ImplCPU *cpu)
82 : staticInst(_staticInst), macroop(_macroop), traceData(NULL), cpu(cpu)
94 BaseDynInst<Impl>::BaseDynInst(StaticInstPtr _staticInst,
95 StaticInstPtr _macroop)
96 : staticInst(_staticInst), macroop(_macroop), traceData(NULL)
102 template <class Impl>
104 BaseDynInst<Impl>::initVars()
108 effAddrValid = false;
111 translationStarted = false;
112 translationCompleted = false;
113 possibleLoadViolation = false;
114 hitExternalSnoop = false;
116 isUncacheable = false;
120 instResult.integer = 0;
132 // Eventually make this a parameter.
135 // Also make this a parameter, or perhaps get it from xc or cpu.
138 // Initialize the fault to be NoFault.
144 if (cpu->instcount > 1500) {
149 assert(cpu->instcount <= 1500);
153 "DynInst: [sn:%lli] Instruction created. Instcount for %s = %i\n",
154 seqNum, cpu->name(), cpu->instcount);
158 cpu->snList.insert(seqNum);
162 template <class Impl>
163 BaseDynInst<Impl>::~BaseDynInst()
179 "DynInst: [sn:%lli] Instruction destroyed. Instcount for %s = %i\n",
180 seqNum, cpu->name(), cpu->instcount);
183 cpu->snList.erase(seqNum);
188 template <class Impl>
190 BaseDynInst<Impl>::dumpSNList()
192 std::set<InstSeqNum>::iterator sn_it = cpu->snList.begin();
195 while (sn_it != cpu->snList.end()) {
196 cprintf("%i: [sn:%lli] not destroyed\n", count, (*sn_it));
203 template <class Impl>
205 BaseDynInst<Impl>::dump()
207 cprintf("T%d : %#08d `", threadNumber, pc.instAddr());
208 std::cout << staticInst->disassemble(pc.instAddr());
212 template <class Impl>
214 BaseDynInst<Impl>::dump(std::string &outstring)
216 std::ostringstream s;
217 s << "T" << threadNumber << " : 0x" << pc.instAddr() << " "
218 << staticInst->disassemble(pc.instAddr());
223 template <class Impl>
225 BaseDynInst<Impl>::markSrcRegReady()
227 DPRINTF(IQ, "[sn:%lli] has %d ready out of %d sources. RTI %d)\n",
228 seqNum, readyRegs+1, numSrcRegs(), readyToIssue());
229 if (++readyRegs == numSrcRegs()) {
234 template <class Impl>
236 BaseDynInst<Impl>::markSrcRegReady(RegIndex src_idx)
238 _readySrcRegIdx[src_idx] = true;
243 template <class Impl>
245 BaseDynInst<Impl>::eaSrcsReady()
247 // For now I am assuming that src registers 1..n-1 are the ones that the
248 // EA calc depends on. (i.e. src reg 0 is the source of the data to be
251 for (int i = 1; i < numSrcRegs(); ++i) {
252 if (!_readySrcRegIdx[i])