base.cc revision 8607:5fb918115c07 
1/*
2 * Copyright (c) 2002-2005 The Regents of The University of Michigan
3 * Copyright (c) 2011 Regents of the University of California
4 * All rights reserved.
5 *
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.
16 *
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.
28 *
29 * Authors: Steve Reinhardt
30 *          Nathan Binkert
31 *          Rick Strong
32 */
33
34#include <iostream>
35#include <sstream>
36#include <string>
37
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/process.hh"
51#include "sim/sim_events.hh"
52#include "sim/sim_exit.hh"
53#include "sim/system.hh"
54
55// Hack
56#include "sim/stat_control.hh"
57
58using namespace std;
59
60vector<BaseCPU *> BaseCPU::cpuList;
61
62// This variable reflects the max number of threads in any CPU.  Be
63// careful to only use it once all the CPUs that you care about have
64// been initialized
65int maxThreadsPerCPU = 1;
66
67CPUProgressEvent::CPUProgressEvent(BaseCPU *_cpu, Tick ival)
68    : Event(Event::Progress_Event_Pri), _interval(ival), lastNumInst(0),
69      cpu(_cpu), _repeatEvent(true)
70{
71    if (_interval)
72        cpu->schedule(this, curTick() + _interval);
73}
74
75void
76CPUProgressEvent::process()
77{
78    Counter temp = cpu->totalInstructions();
79#ifndef NDEBUG
80    double ipc = double(temp - lastNumInst) / (_interval / cpu->ticks(1));
81
82    DPRINTFN("%s progress event, total committed:%i, progress insts committed: "
83             "%lli, IPC: %0.8d\n", cpu->name(), temp, temp - lastNumInst,
84             ipc);
85    ipc = 0.0;
86#else
87    cprintf("%lli: %s progress event, total committed:%i, progress insts "
88            "committed: %lli\n", curTick(), cpu->name(), temp,
89            temp - lastNumInst);
90#endif
91    lastNumInst = temp;
92
93    if (_repeatEvent)
94        cpu->schedule(this, curTick() + _interval);
95}
96
97const char *
98CPUProgressEvent::description() const
99{
100    return "CPU Progress";
101}
102
103#if FULL_SYSTEM
104BaseCPU::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),
108      phase(p->phase)
109#else
110BaseCPU::BaseCPU(Params *p)
111    : MemObject(p), clock(p->clock), _cpuId(p->cpu_id),
112      numThreads(p->numThreads), system(p->system),
113      phase(p->phase)
114#endif
115{
116//    currentTick = curTick();
117
118    // if Python did not provide a valid ID, do it here
119    if (_cpuId == -1 ) {
120        _cpuId = cpuList.size();
121    }
122
123    // add self to global list of CPUs
124    cpuList.push_back(this);
125
126    DPRINTF(SyscallVerbose, "Constructing CPU with id %d\n", _cpuId);
127
128    if (numThreads > maxThreadsPerCPU)
129        maxThreadsPerCPU = numThreads;
130
131    // allocate per-thread instruction-based event queues
132    comInstEventQueue = new EventQueue *[numThreads];
133    for (ThreadID tid = 0; tid < numThreads; ++tid)
134        comInstEventQueue[tid] =
135            new EventQueue("instruction-based event queue");
136
137    //
138    // set up instruction-count-based termination events, if any
139    //
140    if (p->max_insts_any_thread != 0) {
141        const char *cause = "a thread reached the max instruction count";
142        for (ThreadID tid = 0; tid < numThreads; ++tid) {
143            Event *event = new SimLoopExitEvent(cause, 0);
144            comInstEventQueue[tid]->schedule(event, p->max_insts_any_thread);
145        }
146    }
147
148    if (p->max_insts_all_threads != 0) {
149        const char *cause = "all threads reached the max instruction count";
150
151        // allocate & initialize shared downcounter: each event will
152        // decrement this when triggered; simulation will terminate
153        // when counter reaches 0
154        int *counter = new int;
155        *counter = numThreads;
156        for (ThreadID tid = 0; tid < numThreads; ++tid) {
157            Event *event = new CountedExitEvent(cause, *counter);
158            comInstEventQueue[tid]->schedule(event, p->max_insts_all_threads);
159        }
160    }
161
162    // allocate per-thread load-based event queues
163    comLoadEventQueue = new EventQueue *[numThreads];
164    for (ThreadID tid = 0; tid < numThreads; ++tid)
165        comLoadEventQueue[tid] = new EventQueue("load-based event queue");
166
167    //
168    // set up instruction-count-based termination events, if any
169    //
170    if (p->max_loads_any_thread != 0) {
171        const char *cause = "a thread reached the max load count";
172        for (ThreadID tid = 0; tid < numThreads; ++tid) {
173            Event *event = new SimLoopExitEvent(cause, 0);
174            comLoadEventQueue[tid]->schedule(event, p->max_loads_any_thread);
175        }
176    }
177
178    if (p->max_loads_all_threads != 0) {
179        const char *cause = "all threads reached the max load 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            comLoadEventQueue[tid]->schedule(event, p->max_loads_all_threads);
188        }
189    }
190
191    functionTracingEnabled = false;
192    if (p->function_trace) {
193        functionTraceStream = simout.find(csprintf("ftrace.%s", name()));
194        currentFunctionStart = currentFunctionEnd = 0;
195        functionEntryTick = p->function_trace_start;
196
197        if (p->function_trace_start == 0) {
198            functionTracingEnabled = true;
199        } else {
200            typedef EventWrapper<BaseCPU, &BaseCPU::enableFunctionTrace> wrap;
201            Event *event = new wrap(this, true);
202            schedule(event, p->function_trace_start);
203        }
204    }
205#if FULL_SYSTEM
206    interrupts->setCPU(this);
207
208    profileEvent = NULL;
209    if (params()->profile)
210        profileEvent = new ProfileEvent(this, params()->profile);
211#endif
212    tracer = params()->tracer;
213}
214
215void
216BaseCPU::enableFunctionTrace()
217{
218    functionTracingEnabled = true;
219}
220
221BaseCPU::~BaseCPU()
222{
223}
224
225void
226BaseCPU::init()
227{
228    if (!params()->defer_registration)
229        registerThreadContexts();
230}
231
232void
233BaseCPU::startup()
234{
235#if FULL_SYSTEM
236    if (!params()->defer_registration && profileEvent)
237        schedule(profileEvent, curTick());
238#endif
239
240    if (params()->progress_interval) {
241        Tick num_ticks = ticks(params()->progress_interval);
242
243        new CPUProgressEvent(this, num_ticks);
244    }
245}
246
247
248void
249BaseCPU::regStats()
250{
251    using namespace Stats;
252
253    numCycles
254        .name(name() + ".numCycles")
255        .desc("number of cpu cycles simulated")
256        ;
257
258    numWorkItemsStarted
259        .name(name() + ".numWorkItemsStarted")
260        .desc("number of work items this cpu started")
261        ;
262
263    numWorkItemsCompleted
264        .name(name() + ".numWorkItemsCompleted")
265        .desc("number of work items this cpu completed")
266        ;
267
268    int size = threadContexts.size();
269    if (size > 1) {
270        for (int i = 0; i < size; ++i) {
271            stringstream namestr;
272            ccprintf(namestr, "%s.ctx%d", name(), i);
273            threadContexts[i]->regStats(namestr.str());
274        }
275    } else if (size == 1)
276        threadContexts[0]->regStats(name());
277
278#if FULL_SYSTEM
279#endif
280}
281
282Tick
283BaseCPU::nextCycle()
284{
285    Tick next_tick = curTick() - phase + clock - 1;
286    next_tick -= (next_tick % clock);
287    next_tick += phase;
288    return next_tick;
289}
290
291Tick
292BaseCPU::nextCycle(Tick begin_tick)
293{
294    Tick next_tick = begin_tick;
295    if (next_tick % clock != 0)
296        next_tick = next_tick - (next_tick % clock) + clock;
297    next_tick += phase;
298
299    assert(next_tick >= curTick());
300    return next_tick;
301}
302
303void
304BaseCPU::registerThreadContexts()
305{
306    ThreadID size = threadContexts.size();
307    for (ThreadID tid = 0; tid < size; ++tid) {
308        ThreadContext *tc = threadContexts[tid];
309
310        /** This is so that contextId and cpuId match where there is a
311         * 1cpu:1context relationship.  Otherwise, the order of registration
312         * could affect the assignment and cpu 1 could have context id 3, for
313         * example.  We may even want to do something like this for SMT so that
314         * cpu 0 has the lowest thread contexts and cpu N has the highest, but
315         * I'll just do this for now
316         */
317        if (numThreads == 1)
318            tc->setContextId(system->registerThreadContext(tc, _cpuId));
319        else
320            tc->setContextId(system->registerThreadContext(tc));
321#if !FULL_SYSTEM
322        tc->getProcessPtr()->assignThreadContext(tc->contextId());
323#endif
324    }
325}
326
327
328int
329BaseCPU::findContext(ThreadContext *tc)
330{
331    ThreadID size = threadContexts.size();
332    for (ThreadID tid = 0; tid < size; ++tid) {
333        if (tc == threadContexts[tid])
334            return tid;
335    }
336    return 0;
337}
338
339void
340BaseCPU::switchOut()
341{
342//    panic("This CPU doesn't support sampling!");
343#if FULL_SYSTEM
344    if (profileEvent && profileEvent->scheduled())
345        deschedule(profileEvent);
346#endif
347}
348
349void
350BaseCPU::takeOverFrom(BaseCPU *oldCPU, Port *ic, Port *dc)
351{
352    assert(threadContexts.size() == oldCPU->threadContexts.size());
353
354    _cpuId = oldCPU->cpuId();
355
356    ThreadID size = threadContexts.size();
357    for (ThreadID i = 0; i < size; ++i) {
358        ThreadContext *newTC = threadContexts[i];
359        ThreadContext *oldTC = oldCPU->threadContexts[i];
360
361        newTC->takeOverFrom(oldTC);
362
363        CpuEvent::replaceThreadContext(oldTC, newTC);
364
365        assert(newTC->contextId() == oldTC->contextId());
366        assert(newTC->threadId() == oldTC->threadId());
367        system->replaceThreadContext(newTC, newTC->contextId());
368
369        /* This code no longer works since the zero register (e.g.,
370         * r31 on Alpha) doesn't necessarily contain zero at this
371         * point.
372           if (DTRACE(Context))
373            ThreadContext::compare(oldTC, newTC);
374        */
375
376        Port  *old_itb_port, *old_dtb_port, *new_itb_port, *new_dtb_port;
377        old_itb_port = oldTC->getITBPtr()->getPort();
378        old_dtb_port = oldTC->getDTBPtr()->getPort();
379        new_itb_port = newTC->getITBPtr()->getPort();
380        new_dtb_port = newTC->getDTBPtr()->getPort();
381
382        // Move over any table walker ports if they exist
383        if (new_itb_port && !new_itb_port->isConnected()) {
384            assert(old_itb_port);
385            Port *peer = old_itb_port->getPeer();;
386            new_itb_port->setPeer(peer);
387            peer->setPeer(new_itb_port);
388        }
389        if (new_dtb_port && !new_dtb_port->isConnected()) {
390            assert(old_dtb_port);
391            Port *peer = old_dtb_port->getPeer();;
392            new_dtb_port->setPeer(peer);
393            peer->setPeer(new_dtb_port);
394        }
395    }
396
397#if FULL_SYSTEM
398    interrupts = oldCPU->interrupts;
399    interrupts->setCPU(this);
400
401    for (ThreadID i = 0; i < size; ++i)
402        threadContexts[i]->profileClear();
403
404    if (profileEvent)
405        schedule(profileEvent, curTick());
406#endif
407
408    // Connect new CPU to old CPU's memory only if new CPU isn't
409    // connected to anything.  Also connect old CPU's memory to new
410    // CPU.
411    if (!ic->isConnected()) {
412        Port *peer = oldCPU->getPort("icache_port")->getPeer();
413        ic->setPeer(peer);
414        peer->setPeer(ic);
415    }
416
417    if (!dc->isConnected()) {
418        Port *peer = oldCPU->getPort("dcache_port")->getPeer();
419        dc->setPeer(peer);
420        peer->setPeer(dc);
421    }
422}
423
424
425#if FULL_SYSTEM
426BaseCPU::ProfileEvent::ProfileEvent(BaseCPU *_cpu, Tick _interval)
427    : cpu(_cpu), interval(_interval)
428{ }
429
430void
431BaseCPU::ProfileEvent::process()
432{
433    ThreadID size = cpu->threadContexts.size();
434    for (ThreadID i = 0; i < size; ++i) {
435        ThreadContext *tc = cpu->threadContexts[i];
436        tc->profileSample();
437    }
438
439    cpu->schedule(this, curTick() + interval);
440}
441
442void
443BaseCPU::serialize(std::ostream &os)
444{
445    SERIALIZE_SCALAR(instCnt);
446    interrupts->serialize(os);
447}
448
449void
450BaseCPU::unserialize(Checkpoint *cp, const std::string &section)
451{
452    UNSERIALIZE_SCALAR(instCnt);
453    interrupts->unserialize(cp, section);
454}
455
456#endif // FULL_SYSTEM
457
458void
459BaseCPU::traceFunctionsInternal(Addr pc)
460{
461    if (!debugSymbolTable)
462        return;
463
464    // if pc enters different function, print new function symbol and
465    // update saved range.  Otherwise do nothing.
466    if (pc < currentFunctionStart || pc >= currentFunctionEnd) {
467        string sym_str;
468        bool found = debugSymbolTable->findNearestSymbol(pc, sym_str,
469                                                         currentFunctionStart,
470                                                         currentFunctionEnd);
471
472        if (!found) {
473            // no symbol found: use addr as label
474            sym_str = csprintf("0x%x", pc);
475            currentFunctionStart = pc;
476            currentFunctionEnd = pc + 1;
477        }
478
479        ccprintf(*functionTraceStream, " (%d)\n%d: %s",
480                 curTick() - functionEntryTick, curTick(), sym_str);
481        functionEntryTick = curTick();
482    }
483}
484