2 * Copyright (c) 2011-2012 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) 2002-2005 The Regents of The University of Michigan
15 * Copyright (c) 2011 Regents of the University of California
16 * Copyright (c) 2013 Advanced Micro Devices, Inc.
17 * Copyright (c) 2013 Mark D. Hill and David A. Wood
18 * All rights reserved.
20 * Redistribution and use in source and binary forms, with or without
21 * modification, are permitted provided that the following conditions are
22 * met: redistributions of source code must retain the above copyright
23 * notice, this list of conditions and the following disclaimer;
24 * redistributions in binary form must reproduce the above copyright
25 * notice, this list of conditions and the following disclaimer in the
26 * documentation and/or other materials provided with the distribution;
27 * neither the name of the copyright holders nor the names of its
28 * contributors may be used to endorse or promote products derived from
29 * this software without specific prior written permission.
31 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
32 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
33 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
34 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
35 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
36 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
37 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
38 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
39 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
40 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
41 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
43 * Authors: Steve Reinhardt
52 #include "arch/tlb.hh"
53 #include "base/loader/symtab.hh"
54 #include "base/cprintf.hh"
55 #include "base/misc.hh"
56 #include "base/output.hh"
57 #include "base/trace.hh"
58 #include "cpu/checker/cpu.hh"
59 #include "cpu/base.hh"
60 #include "cpu/cpuevent.hh"
61 #include "cpu/profile.hh"
62 #include "cpu/thread_context.hh"
63 #include "debug/Mwait.hh"
64 #include "debug/SyscallVerbose.hh"
65 #include "mem/page_table.hh"
66 #include "params/BaseCPU.hh"
67 #include "sim/full_system.hh"
68 #include "sim/process.hh"
69 #include "sim/sim_events.hh"
70 #include "sim/sim_exit.hh"
71 #include "sim/system.hh"
74 #include "sim/stat_control.hh"
78 vector
<BaseCPU
*> BaseCPU::cpuList
;
80 // This variable reflects the max number of threads in any CPU. Be
81 // careful to only use it once all the CPUs that you care about have
83 int maxThreadsPerCPU
= 1;
85 CPUProgressEvent::CPUProgressEvent(BaseCPU
*_cpu
, Tick ival
)
86 : Event(Event::Progress_Event_Pri
), _interval(ival
), lastNumInst(0),
87 cpu(_cpu
), _repeatEvent(true)
90 cpu
->schedule(this, curTick() + _interval
);
94 CPUProgressEvent::process()
96 Counter temp
= cpu
->totalOps();
99 cpu
->schedule(this, curTick() + _interval
);
101 if(cpu
->switchedOut()) {
106 double ipc
= double(temp
- lastNumInst
) / (_interval
/ cpu
->clockPeriod());
108 DPRINTFN("%s progress event, total committed:%i, progress insts committed: "
109 "%lli, IPC: %0.8d\n", cpu
->name(), temp
, temp
- lastNumInst
,
113 cprintf("%lli: %s progress event, total committed:%i, progress insts "
114 "committed: %lli\n", curTick(), cpu
->name(), temp
,
121 CPUProgressEvent::description() const
123 return "CPU Progress";
126 BaseCPU::BaseCPU(Params
*p
, bool is_checker
)
127 : MemObject(p
), instCnt(0), _cpuId(p
->cpu_id
), _socketId(p
->socket_id
),
128 _instMasterId(p
->system
->getMasterId(name() + ".inst")),
129 _dataMasterId(p
->system
->getMasterId(name() + ".data")),
130 _taskId(ContextSwitchTaskId::Unknown
), _pid(invldPid
),
131 _switchedOut(p
->switched_out
), _cacheLineSize(p
->system
->cacheLineSize()),
132 interrupts(p
->interrupts
), profileEvent(NULL
),
133 numThreads(p
->numThreads
), system(p
->system
),
134 functionTraceStream(nullptr), currentFunctionStart(0),
135 currentFunctionEnd(0), functionEntryTick(0),
136 addressMonitor(p
->numThreads
)
138 // if Python did not provide a valid ID, do it here
140 _cpuId
= cpuList
.size();
143 // add self to global list of CPUs
144 cpuList
.push_back(this);
146 DPRINTF(SyscallVerbose
, "Constructing CPU with id %d, socket id %d\n",
149 if (numThreads
> maxThreadsPerCPU
)
150 maxThreadsPerCPU
= numThreads
;
152 // allocate per-thread instruction-based event queues
153 comInstEventQueue
= new EventQueue
*[numThreads
];
154 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
)
155 comInstEventQueue
[tid
] =
156 new EventQueue("instruction-based event queue");
159 // set up instruction-count-based termination events, if any
161 if (p
->max_insts_any_thread
!= 0) {
162 const char *cause
= "a thread reached the max instruction count";
163 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
)
164 scheduleInstStop(tid
, p
->max_insts_any_thread
, cause
);
167 // Set up instruction-count-based termination events for SimPoints
168 // Typically, there are more than one action points.
169 // Simulation.py is responsible to take the necessary actions upon
170 // exitting the simulation loop.
171 if (!p
->simpoint_start_insts
.empty()) {
172 const char *cause
= "simpoint starting point found";
173 for (size_t i
= 0; i
< p
->simpoint_start_insts
.size(); ++i
)
174 scheduleInstStop(0, p
->simpoint_start_insts
[i
], cause
);
177 if (p
->max_insts_all_threads
!= 0) {
178 const char *cause
= "all threads reached the max instruction count";
180 // allocate & initialize shared downcounter: each event will
181 // decrement this when triggered; simulation will terminate
182 // when counter reaches 0
183 int *counter
= new int;
184 *counter
= numThreads
;
185 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
) {
186 Event
*event
= new CountedExitEvent(cause
, *counter
);
187 comInstEventQueue
[tid
]->schedule(event
, p
->max_insts_all_threads
);
191 // allocate per-thread load-based event queues
192 comLoadEventQueue
= new EventQueue
*[numThreads
];
193 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
)
194 comLoadEventQueue
[tid
] = new EventQueue("load-based event queue");
197 // set up instruction-count-based termination events, if any
199 if (p
->max_loads_any_thread
!= 0) {
200 const char *cause
= "a thread reached the max load count";
201 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
)
202 scheduleLoadStop(tid
, p
->max_loads_any_thread
, cause
);
205 if (p
->max_loads_all_threads
!= 0) {
206 const char *cause
= "all threads reached the max load count";
207 // allocate & initialize shared downcounter: each event will
208 // decrement this when triggered; simulation will terminate
209 // when counter reaches 0
210 int *counter
= new int;
211 *counter
= numThreads
;
212 for (ThreadID tid
= 0; tid
< numThreads
; ++tid
) {
213 Event
*event
= new CountedExitEvent(cause
, *counter
);
214 comLoadEventQueue
[tid
]->schedule(event
, p
->max_loads_all_threads
);
218 functionTracingEnabled
= false;
219 if (p
->function_trace
) {
220 const string fname
= csprintf("ftrace.%s", name());
221 functionTraceStream
= simout
.find(fname
);
222 if (!functionTraceStream
)
223 functionTraceStream
= simout
.create(fname
);
225 currentFunctionStart
= currentFunctionEnd
= 0;
226 functionEntryTick
= p
->function_trace_start
;
228 if (p
->function_trace_start
== 0) {
229 functionTracingEnabled
= true;
231 typedef EventWrapper
<BaseCPU
, &BaseCPU::enableFunctionTrace
> wrap
;
232 Event
*event
= new wrap(this, true);
233 schedule(event
, p
->function_trace_start
);
237 // The interrupts should always be present unless this CPU is
238 // switched in later or in case it is a checker CPU
239 if (!params()->switched_out
&& !is_checker
) {
240 fatal_if(interrupts
.size() != numThreads
,
241 "CPU %s has %i interrupt controllers, but is expecting one "
243 name(), interrupts
.size(), numThreads
);
244 for (ThreadID tid
= 0; tid
< numThreads
; tid
++)
245 interrupts
[tid
]->setCPU(this);
249 if (params()->profile
)
250 profileEvent
= new ProfileEvent(this, params()->profile
);
252 tracer
= params()->tracer
;
254 if (params()->isa
.size() != numThreads
) {
255 fatal("Number of ISAs (%i) assigned to the CPU does not equal number "
256 "of threads (%i).\n", params()->isa
.size(), numThreads
);
261 BaseCPU::enableFunctionTrace()
263 functionTracingEnabled
= true;
269 delete[] comLoadEventQueue
;
270 delete[] comInstEventQueue
;
274 BaseCPU::armMonitor(ThreadID tid
, Addr address
)
276 assert(tid
< numThreads
);
277 AddressMonitor
&monitor
= addressMonitor
[tid
];
279 monitor
.armed
= true;
280 monitor
.vAddr
= address
;
282 DPRINTF(Mwait
,"[tid:%d] Armed monitor (vAddr=0x%lx)\n", tid
, address
);
286 BaseCPU::mwait(ThreadID tid
, PacketPtr pkt
)
288 assert(tid
< numThreads
);
289 AddressMonitor
&monitor
= addressMonitor
[tid
];
291 if(monitor
.gotWakeup
== false) {
292 int block_size
= cacheLineSize();
293 uint64_t mask
= ~((uint64_t)(block_size
- 1));
295 assert(pkt
->req
->hasPaddr());
296 monitor
.pAddr
= pkt
->getAddr() & mask
;
297 monitor
.waiting
= true;
299 DPRINTF(Mwait
,"[tid:%d] mwait called (vAddr=0x%lx, "
300 "line's paddr=0x%lx)\n", tid
, monitor
.vAddr
, monitor
.pAddr
);
303 monitor
.gotWakeup
= false;
309 BaseCPU::mwaitAtomic(ThreadID tid
, ThreadContext
*tc
, TheISA::TLB
*dtb
)
311 assert(tid
< numThreads
);
312 AddressMonitor
&monitor
= addressMonitor
[tid
];
315 Addr addr
= monitor
.vAddr
;
316 int block_size
= cacheLineSize();
317 uint64_t mask
= ~((uint64_t)(block_size
- 1));
318 int size
= block_size
;
320 //The address of the next line if it crosses a cache line boundary.
321 Addr secondAddr
= roundDown(addr
+ size
- 1, block_size
);
323 if (secondAddr
> addr
)
324 size
= secondAddr
- addr
;
326 req
.setVirt(0, addr
, size
, 0x0, dataMasterId(), tc
->instAddr());
328 // translate to physical address
329 Fault fault
= dtb
->translateAtomic(&req
, tc
, BaseTLB::Read
);
330 assert(fault
== NoFault
);
332 monitor
.pAddr
= req
.getPaddr() & mask
;
333 monitor
.waiting
= true;
335 DPRINTF(Mwait
,"[tid:%d] mwait called (vAddr=0x%lx, line's paddr=0x%lx)\n",
336 tid
, monitor
.vAddr
, monitor
.pAddr
);
342 if (!params()->switched_out
) {
343 registerThreadContexts();
353 if (!params()->switched_out
&& profileEvent
)
354 schedule(profileEvent
, curTick());
357 if (params()->progress_interval
) {
358 new CPUProgressEvent(this, params()->progress_interval
);
363 BaseCPU::pmuProbePoint(const char *name
)
365 ProbePoints::PMUUPtr ptr
;
366 ptr
.reset(new ProbePoints::PMU(getProbeManager(), name
));
372 BaseCPU::regProbePoints()
374 ppCycles
= pmuProbePoint("Cycles");
376 ppRetiredInsts
= pmuProbePoint("RetiredInsts");
377 ppRetiredLoads
= pmuProbePoint("RetiredLoads");
378 ppRetiredStores
= pmuProbePoint("RetiredStores");
379 ppRetiredBranches
= pmuProbePoint("RetiredBranches");
383 BaseCPU::probeInstCommit(const StaticInstPtr
&inst
)
385 if (!inst
->isMicroop() || inst
->isLastMicroop())
386 ppRetiredInsts
->notify(1);
390 ppRetiredLoads
->notify(1);
393 ppRetiredStores
->notify(1);
395 if (inst
->isControl())
396 ppRetiredBranches
->notify(1);
402 using namespace Stats
;
405 .name(name() + ".numCycles")
406 .desc("number of cpu cycles simulated")
410 .name(name() + ".numWorkItemsStarted")
411 .desc("number of work items this cpu started")
414 numWorkItemsCompleted
415 .name(name() + ".numWorkItemsCompleted")
416 .desc("number of work items this cpu completed")
419 int size
= threadContexts
.size();
421 for (int i
= 0; i
< size
; ++i
) {
422 stringstream namestr
;
423 ccprintf(namestr
, "%s.ctx%d", name(), i
);
424 threadContexts
[i
]->regStats(namestr
.str());
426 } else if (size
== 1)
427 threadContexts
[0]->regStats(name());
431 BaseCPU::getMasterPort(const string
&if_name
, PortID idx
)
433 // Get the right port based on name. This applies to all the
434 // subclasses of the base CPU and relies on their implementation
435 // of getDataPort and getInstPort. In all cases there methods
436 // return a MasterPort pointer.
437 if (if_name
== "dcache_port")
438 return getDataPort();
439 else if (if_name
== "icache_port")
440 return getInstPort();
442 return MemObject::getMasterPort(if_name
, idx
);
446 BaseCPU::registerThreadContexts()
448 assert(system
->multiThread
|| numThreads
== 1);
450 ThreadID size
= threadContexts
.size();
451 for (ThreadID tid
= 0; tid
< size
; ++tid
) {
452 ThreadContext
*tc
= threadContexts
[tid
];
454 if (system
->multiThread
) {
455 tc
->setContextId(system
->registerThreadContext(tc
));
457 tc
->setContextId(system
->registerThreadContext(tc
, _cpuId
));
461 tc
->getProcessPtr()->assignThreadContext(tc
->contextId());
467 BaseCPU::findContext(ThreadContext
*tc
)
469 ThreadID size
= threadContexts
.size();
470 for (ThreadID tid
= 0; tid
< size
; ++tid
) {
471 if (tc
== threadContexts
[tid
])
480 assert(!_switchedOut
);
482 if (profileEvent
&& profileEvent
->scheduled())
483 deschedule(profileEvent
);
485 // Flush all TLBs in the CPU to avoid having stale translations if
486 // it gets switched in later.
491 BaseCPU::takeOverFrom(BaseCPU
*oldCPU
)
493 assert(threadContexts
.size() == oldCPU
->threadContexts
.size());
494 assert(_cpuId
== oldCPU
->cpuId());
495 assert(_switchedOut
);
496 assert(oldCPU
!= this);
497 _pid
= oldCPU
->getPid();
498 _taskId
= oldCPU
->taskId();
499 _switchedOut
= false;
501 ThreadID size
= threadContexts
.size();
502 for (ThreadID i
= 0; i
< size
; ++i
) {
503 ThreadContext
*newTC
= threadContexts
[i
];
504 ThreadContext
*oldTC
= oldCPU
->threadContexts
[i
];
506 newTC
->takeOverFrom(oldTC
);
508 CpuEvent::replaceThreadContext(oldTC
, newTC
);
510 assert(newTC
->contextId() == oldTC
->contextId());
511 assert(newTC
->threadId() == oldTC
->threadId());
512 system
->replaceThreadContext(newTC
, newTC
->contextId());
514 /* This code no longer works since the zero register (e.g.,
515 * r31 on Alpha) doesn't necessarily contain zero at this
518 ThreadContext::compare(oldTC, newTC);
521 BaseMasterPort
*old_itb_port
= oldTC
->getITBPtr()->getMasterPort();
522 BaseMasterPort
*old_dtb_port
= oldTC
->getDTBPtr()->getMasterPort();
523 BaseMasterPort
*new_itb_port
= newTC
->getITBPtr()->getMasterPort();
524 BaseMasterPort
*new_dtb_port
= newTC
->getDTBPtr()->getMasterPort();
526 // Move over any table walker ports if they exist
528 assert(!new_itb_port
->isConnected());
529 assert(old_itb_port
);
530 assert(old_itb_port
->isConnected());
531 BaseSlavePort
&slavePort
= old_itb_port
->getSlavePort();
532 old_itb_port
->unbind();
533 new_itb_port
->bind(slavePort
);
536 assert(!new_dtb_port
->isConnected());
537 assert(old_dtb_port
);
538 assert(old_dtb_port
->isConnected());
539 BaseSlavePort
&slavePort
= old_dtb_port
->getSlavePort();
540 old_dtb_port
->unbind();
541 new_dtb_port
->bind(slavePort
);
543 newTC
->getITBPtr()->takeOverFrom(oldTC
->getITBPtr());
544 newTC
->getDTBPtr()->takeOverFrom(oldTC
->getDTBPtr());
546 // Checker whether or not we have to transfer CheckerCPU
547 // objects over in the switch
548 CheckerCPU
*oldChecker
= oldTC
->getCheckerCpuPtr();
549 CheckerCPU
*newChecker
= newTC
->getCheckerCpuPtr();
550 if (oldChecker
&& newChecker
) {
551 BaseMasterPort
*old_checker_itb_port
=
552 oldChecker
->getITBPtr()->getMasterPort();
553 BaseMasterPort
*old_checker_dtb_port
=
554 oldChecker
->getDTBPtr()->getMasterPort();
555 BaseMasterPort
*new_checker_itb_port
=
556 newChecker
->getITBPtr()->getMasterPort();
557 BaseMasterPort
*new_checker_dtb_port
=
558 newChecker
->getDTBPtr()->getMasterPort();
560 newChecker
->getITBPtr()->takeOverFrom(oldChecker
->getITBPtr());
561 newChecker
->getDTBPtr()->takeOverFrom(oldChecker
->getDTBPtr());
563 // Move over any table walker ports if they exist for checker
564 if (new_checker_itb_port
) {
565 assert(!new_checker_itb_port
->isConnected());
566 assert(old_checker_itb_port
);
567 assert(old_checker_itb_port
->isConnected());
568 BaseSlavePort
&slavePort
=
569 old_checker_itb_port
->getSlavePort();
570 old_checker_itb_port
->unbind();
571 new_checker_itb_port
->bind(slavePort
);
573 if (new_checker_dtb_port
) {
574 assert(!new_checker_dtb_port
->isConnected());
575 assert(old_checker_dtb_port
);
576 assert(old_checker_dtb_port
->isConnected());
577 BaseSlavePort
&slavePort
=
578 old_checker_dtb_port
->getSlavePort();
579 old_checker_dtb_port
->unbind();
580 new_checker_dtb_port
->bind(slavePort
);
585 interrupts
= oldCPU
->interrupts
;
586 for (ThreadID tid
= 0; tid
< numThreads
; tid
++) {
587 interrupts
[tid
]->setCPU(this);
589 oldCPU
->interrupts
.clear();
592 for (ThreadID i
= 0; i
< size
; ++i
)
593 threadContexts
[i
]->profileClear();
596 schedule(profileEvent
, curTick());
599 // All CPUs have an instruction and a data port, and the new CPU's
600 // ports are dangling while the old CPU has its ports connected
601 // already. Unbind the old CPU and then bind the ports of the one
602 // we are switching to.
603 assert(!getInstPort().isConnected());
604 assert(oldCPU
->getInstPort().isConnected());
605 BaseSlavePort
&inst_peer_port
= oldCPU
->getInstPort().getSlavePort();
606 oldCPU
->getInstPort().unbind();
607 getInstPort().bind(inst_peer_port
);
609 assert(!getDataPort().isConnected());
610 assert(oldCPU
->getDataPort().isConnected());
611 BaseSlavePort
&data_peer_port
= oldCPU
->getDataPort().getSlavePort();
612 oldCPU
->getDataPort().unbind();
613 getDataPort().bind(data_peer_port
);
619 for (ThreadID i
= 0; i
< threadContexts
.size(); ++i
) {
620 ThreadContext
&tc(*threadContexts
[i
]);
621 CheckerCPU
*checker(tc
.getCheckerCpuPtr());
623 tc
.getITBPtr()->flushAll();
624 tc
.getDTBPtr()->flushAll();
626 checker
->getITBPtr()->flushAll();
627 checker
->getDTBPtr()->flushAll();
633 BaseCPU::ProfileEvent::ProfileEvent(BaseCPU
*_cpu
, Tick _interval
)
634 : cpu(_cpu
), interval(_interval
)
638 BaseCPU::ProfileEvent::process()
640 ThreadID size
= cpu
->threadContexts
.size();
641 for (ThreadID i
= 0; i
< size
; ++i
) {
642 ThreadContext
*tc
= cpu
->threadContexts
[i
];
646 cpu
->schedule(this, curTick() + interval
);
650 BaseCPU::serialize(CheckpointOut
&cp
) const
652 SERIALIZE_SCALAR(instCnt
);
655 /* Unlike _pid, _taskId is not serialized, as they are dynamically
656 * assigned unique ids that are only meaningful for the duration of
657 * a specific run. We will need to serialize the entire taskMap in
659 SERIALIZE_SCALAR(_pid
);
661 // Serialize the threads, this is done by the CPU implementation.
662 for (ThreadID i
= 0; i
< numThreads
; ++i
) {
663 ScopedCheckpointSection
sec(cp
, csprintf("xc.%i", i
));
664 interrupts
[i
]->serialize(cp
);
665 serializeThread(cp
, i
);
671 BaseCPU::unserialize(CheckpointIn
&cp
)
673 UNSERIALIZE_SCALAR(instCnt
);
676 UNSERIALIZE_SCALAR(_pid
);
678 // Unserialize the threads, this is done by the CPU implementation.
679 for (ThreadID i
= 0; i
< numThreads
; ++i
) {
680 ScopedCheckpointSection
sec(cp
, csprintf("xc.%i", i
));
681 interrupts
[i
]->unserialize(cp
);
682 unserializeThread(cp
, i
);
688 BaseCPU::scheduleInstStop(ThreadID tid
, Counter insts
, const char *cause
)
690 const Tick
now(comInstEventQueue
[tid
]->getCurTick());
691 Event
*event(new LocalSimLoopExitEvent(cause
, 0));
693 comInstEventQueue
[tid
]->schedule(event
, now
+ insts
);
696 AddressMonitor::AddressMonitor() {
702 bool AddressMonitor::doMonitor(PacketPtr pkt
) {
703 assert(pkt
->req
->hasPaddr());
704 if(armed
&& waiting
) {
705 if(pAddr
== pkt
->getAddr()) {
706 DPRINTF(Mwait
,"pAddr=0x%lx invalidated: waking up core\n",
716 BaseCPU::scheduleLoadStop(ThreadID tid
, Counter loads
, const char *cause
)
718 const Tick
now(comLoadEventQueue
[tid
]->getCurTick());
719 Event
*event(new LocalSimLoopExitEvent(cause
, 0));
721 comLoadEventQueue
[tid
]->schedule(event
, now
+ loads
);
726 BaseCPU::traceFunctionsInternal(Addr pc
)
728 if (!debugSymbolTable
)
731 // if pc enters different function, print new function symbol and
732 // update saved range. Otherwise do nothing.
733 if (pc
< currentFunctionStart
|| pc
>= currentFunctionEnd
) {
735 bool found
= debugSymbolTable
->findNearestSymbol(pc
, sym_str
,
736 currentFunctionStart
,
740 // no symbol found: use addr as label
741 sym_str
= csprintf("0x%x", pc
);
742 currentFunctionStart
= pc
;
743 currentFunctionEnd
= pc
+ 1;
746 ccprintf(*functionTraceStream
, " (%d)\n%d: %s",
747 curTick() - functionEntryTick
, curTick(), sym_str
);
748 functionEntryTick
= curTick();