2 * Copyright (c) 2002-2005 The Regents of The University of Michigan
3 * Copyright (c) 2011 Regents of the University of California
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions are
8 * met: redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer;
10 * redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution;
13 * neither the name of the copyright holders nor the names of its
14 * contributors may be used to endorse or promote products derived from
15 * this software without specific prior written permission.
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
18 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
19 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
20 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
21 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
22 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
23 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
27 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
29 * Authors: Steve Reinhardt
38 #include "arch/tlb.hh"
39 #include "base/loader/symtab.hh"
40 #include "base/cprintf.hh"
41 #include "base/misc.hh"
42 #include "base/output.hh"
43 #include "base/trace.hh"
44 #include "cpu/base.hh"
45 #include "cpu/cpuevent.hh"
46 #include "cpu/profile.hh"
47 #include "cpu/thread_context.hh"
48 #include "debug/SyscallVerbose.hh"
49 #include "params/BaseCPU.hh"
50 #include "sim/full_system.hh"
51 #include "sim/process.hh"
52 #include "sim/sim_events.hh"
53 #include "sim/sim_exit.hh"
54 #include "sim/system.hh"
57 #include "sim/stat_control.hh"
61 vector
<BaseCPU
*> BaseCPU::cpuList
;
63 // This variable reflects the max number of threads in any CPU. Be
64 // careful to only use it once all the CPUs that you care about have
66 int maxThreadsPerCPU
= 1;
68 CPUProgressEvent::CPUProgressEvent(BaseCPU
*_cpu
, Tick ival
)
69 : Event(Event::Progress_Event_Pri
), _interval(ival
), lastNumInst(0),
70 cpu(_cpu
), _repeatEvent(true)
73 cpu
->schedule(this, curTick() + _interval
);
77 CPUProgressEvent::process()
79 Counter temp
= cpu
->totalInstructions();
81 double ipc
= double(temp
- lastNumInst
) / (_interval
/ cpu
->ticks(1));
83 DPRINTFN("%s progress event, total committed:%i, progress insts committed: "
84 "%lli, IPC: %0.8d\n", cpu
->name(), temp
, temp
- lastNumInst
,
88 cprintf("%lli: %s progress event, total committed:%i, progress insts "
89 "committed: %lli\n", curTick(), cpu
->name(), temp
,
95 cpu
->schedule(this, curTick() + _interval
);
99 CPUProgressEvent::description() const
101 return "CPU Progress";
104 BaseCPU::BaseCPU(Params
*p
)
105 : MemObject(p
), clock(p
->clock
), instCnt(0), _cpuId(p
->cpu_id
),
106 interrupts(p
->interrupts
),
107 numThreads(p
->numThreads
), system(p
->system
),
110 // currentTick = curTick();
112 // if Python did not provide a valid ID, do it here
114 _cpuId
= cpuList
.size();
117 // add self to global list of CPUs
118 cpuList
.push_back(this);
120 DPRINTF(SyscallVerbose
, "Constructing CPU with id %d\n", _cpuId
);
122 if (numThreads
> maxThreadsPerCPU
)
123 maxThreadsPerCPU
= numThreads
;
125 // allocate per-thread instruction-based event queues
126 comInstEventQueue
= new EventQueue
*[numThreads
];
127 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
)
128 comInstEventQueue
[tid
] =
129 new EventQueue("instruction-based event queue");
132 // set up instruction-count-based termination events, if any
134 if (p
->max_insts_any_thread
!= 0) {
135 const char *cause
= "a thread reached the max instruction count";
136 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
) {
137 Event
*event
= new SimLoopExitEvent(cause
, 0);
138 comInstEventQueue
[tid
]->schedule(event
, p
->max_insts_any_thread
);
142 if (p
->max_insts_all_threads
!= 0) {
143 const char *cause
= "all threads reached the max instruction count";
145 // allocate & initialize shared downcounter: each event will
146 // decrement this when triggered; simulation will terminate
147 // when counter reaches 0
148 int *counter
= new int;
149 *counter
= numThreads
;
150 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
) {
151 Event
*event
= new CountedExitEvent(cause
, *counter
);
152 comInstEventQueue
[tid
]->schedule(event
, p
->max_insts_all_threads
);
156 // allocate per-thread load-based event queues
157 comLoadEventQueue
= new EventQueue
*[numThreads
];
158 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
)
159 comLoadEventQueue
[tid
] = new EventQueue("load-based event queue");
162 // set up instruction-count-based termination events, if any
164 if (p
->max_loads_any_thread
!= 0) {
165 const char *cause
= "a thread reached the max load count";
166 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
) {
167 Event
*event
= new SimLoopExitEvent(cause
, 0);
168 comLoadEventQueue
[tid
]->schedule(event
, p
->max_loads_any_thread
);
172 if (p
->max_loads_all_threads
!= 0) {
173 const char *cause
= "all threads reached the max load count";
174 // allocate & initialize shared downcounter: each event will
175 // decrement this when triggered; simulation will terminate
176 // when counter reaches 0
177 int *counter
= new int;
178 *counter
= numThreads
;
179 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
) {
180 Event
*event
= new CountedExitEvent(cause
, *counter
);
181 comLoadEventQueue
[tid
]->schedule(event
, p
->max_loads_all_threads
);
185 functionTracingEnabled
= false;
186 if (p
->function_trace
) {
187 functionTraceStream
= simout
.find(csprintf("ftrace.%s", name()));
188 currentFunctionStart
= currentFunctionEnd
= 0;
189 functionEntryTick
= p
->function_trace_start
;
191 if (p
->function_trace_start
== 0) {
192 functionTracingEnabled
= true;
194 typedef EventWrapper
<BaseCPU
, &BaseCPU::enableFunctionTrace
> wrap
;
195 Event
*event
= new wrap(this, true);
196 schedule(event
, p
->function_trace_start
);
199 interrupts
->setCPU(this);
203 if (params()->profile
)
204 profileEvent
= new ProfileEvent(this, params()->profile
);
206 tracer
= params()->tracer
;
210 BaseCPU::enableFunctionTrace()
212 functionTracingEnabled
= true;
222 if (!params()->defer_registration
)
223 registerThreadContexts();
230 if (!params()->defer_registration
&& profileEvent
)
231 schedule(profileEvent
, curTick());
234 if (params()->progress_interval
) {
235 Tick num_ticks
= ticks(params()->progress_interval
);
237 new CPUProgressEvent(this, num_ticks
);
245 using namespace Stats
;
248 .name(name() + ".numCycles")
249 .desc("number of cpu cycles simulated")
253 .name(name() + ".numWorkItemsStarted")
254 .desc("number of work items this cpu started")
257 numWorkItemsCompleted
258 .name(name() + ".numWorkItemsCompleted")
259 .desc("number of work items this cpu completed")
262 int size
= threadContexts
.size();
264 for (int i
= 0; i
< size
; ++i
) {
265 stringstream namestr
;
266 ccprintf(namestr
, "%s.ctx%d", name(), i
);
267 threadContexts
[i
]->regStats(namestr
.str());
269 } else if (size
== 1)
270 threadContexts
[0]->regStats(name());
276 Tick next_tick
= curTick() - phase
+ clock
- 1;
277 next_tick
-= (next_tick
% clock
);
283 BaseCPU::nextCycle(Tick begin_tick
)
285 Tick next_tick
= begin_tick
;
286 if (next_tick
% clock
!= 0)
287 next_tick
= next_tick
- (next_tick
% clock
) + clock
;
290 assert(next_tick
>= curTick());
295 BaseCPU::registerThreadContexts()
297 ThreadID size
= threadContexts
.size();
298 for (ThreadID tid
= 0; tid
< size
; ++tid
) {
299 ThreadContext
*tc
= threadContexts
[tid
];
301 /** This is so that contextId and cpuId match where there is a
302 * 1cpu:1context relationship. Otherwise, the order of registration
303 * could affect the assignment and cpu 1 could have context id 3, for
304 * example. We may even want to do something like this for SMT so that
305 * cpu 0 has the lowest thread contexts and cpu N has the highest, but
306 * I'll just do this for now
309 tc
->setContextId(system
->registerThreadContext(tc
, _cpuId
));
311 tc
->setContextId(system
->registerThreadContext(tc
));
314 tc
->getProcessPtr()->assignThreadContext(tc
->contextId());
320 BaseCPU::findContext(ThreadContext
*tc
)
322 ThreadID size
= threadContexts
.size();
323 for (ThreadID tid
= 0; tid
< size
; ++tid
) {
324 if (tc
== threadContexts
[tid
])
333 if (profileEvent
&& profileEvent
->scheduled())
334 deschedule(profileEvent
);
338 BaseCPU::takeOverFrom(BaseCPU
*oldCPU
, Port
*ic
, Port
*dc
)
340 assert(threadContexts
.size() == oldCPU
->threadContexts
.size());
342 _cpuId
= oldCPU
->cpuId();
344 ThreadID size
= threadContexts
.size();
345 for (ThreadID i
= 0; i
< size
; ++i
) {
346 ThreadContext
*newTC
= threadContexts
[i
];
347 ThreadContext
*oldTC
= oldCPU
->threadContexts
[i
];
349 newTC
->takeOverFrom(oldTC
);
351 CpuEvent::replaceThreadContext(oldTC
, newTC
);
353 assert(newTC
->contextId() == oldTC
->contextId());
354 assert(newTC
->threadId() == oldTC
->threadId());
355 system
->replaceThreadContext(newTC
, newTC
->contextId());
357 /* This code no longer works since the zero register (e.g.,
358 * r31 on Alpha) doesn't necessarily contain zero at this
361 ThreadContext::compare(oldTC, newTC);
364 Port
*old_itb_port
, *old_dtb_port
, *new_itb_port
, *new_dtb_port
;
365 old_itb_port
= oldTC
->getITBPtr()->getPort();
366 old_dtb_port
= oldTC
->getDTBPtr()->getPort();
367 new_itb_port
= newTC
->getITBPtr()->getPort();
368 new_dtb_port
= newTC
->getDTBPtr()->getPort();
370 // Move over any table walker ports if they exist
371 if (new_itb_port
&& !new_itb_port
->isConnected()) {
372 assert(old_itb_port
);
373 Port
*peer
= old_itb_port
->getPeer();;
374 new_itb_port
->setPeer(peer
);
375 peer
->setPeer(new_itb_port
);
377 if (new_dtb_port
&& !new_dtb_port
->isConnected()) {
378 assert(old_dtb_port
);
379 Port
*peer
= old_dtb_port
->getPeer();;
380 new_dtb_port
->setPeer(peer
);
381 peer
->setPeer(new_dtb_port
);
385 interrupts
= oldCPU
->interrupts
;
386 interrupts
->setCPU(this);
389 for (ThreadID i
= 0; i
< size
; ++i
)
390 threadContexts
[i
]->profileClear();
393 schedule(profileEvent
, curTick());
396 // Connect new CPU to old CPU's memory only if new CPU isn't
397 // connected to anything. Also connect old CPU's memory to new
399 if (!ic
->isConnected()) {
400 Port
*peer
= oldCPU
->getPort("icache_port")->getPeer();
405 if (!dc
->isConnected()) {
406 Port
*peer
= oldCPU
->getPort("dcache_port")->getPeer();
413 BaseCPU::ProfileEvent::ProfileEvent(BaseCPU
*_cpu
, Tick _interval
)
414 : cpu(_cpu
), interval(_interval
)
418 BaseCPU::ProfileEvent::process()
420 ThreadID size
= cpu
->threadContexts
.size();
421 for (ThreadID i
= 0; i
< size
; ++i
) {
422 ThreadContext
*tc
= cpu
->threadContexts
[i
];
426 cpu
->schedule(this, curTick() + interval
);
430 BaseCPU::serialize(std::ostream
&os
)
432 SERIALIZE_SCALAR(instCnt
);
433 interrupts
->serialize(os
);
437 BaseCPU::unserialize(Checkpoint
*cp
, const std::string
§ion
)
439 UNSERIALIZE_SCALAR(instCnt
);
440 interrupts
->unserialize(cp
, section
);
444 BaseCPU::traceFunctionsInternal(Addr pc
)
446 if (!debugSymbolTable
)
449 // if pc enters different function, print new function symbol and
450 // update saved range. Otherwise do nothing.
451 if (pc
< currentFunctionStart
|| pc
>= currentFunctionEnd
) {
453 bool found
= debugSymbolTable
->findNearestSymbol(pc
, sym_str
,
454 currentFunctionStart
,
458 // no symbol found: use addr as label
459 sym_str
= csprintf("0x%x", pc
);
460 currentFunctionStart
= pc
;
461 currentFunctionEnd
= pc
+ 1;
464 ccprintf(*functionTraceStream
, " (%d)\n%d: %s",
465 curTick() - functionEntryTick
, curTick(), sym_str
);
466 functionEntryTick
= curTick();