1/*
2 * Copyright (c) 2002-2005 The Regents of The University of Michigan
3 * All rights reserved.
4 *
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;

--- 46 unchanged lines hidden (view full) ---

55
56vector<BaseCPU *> BaseCPU::cpuList;
57
58// This variable reflects the max number of threads in any CPU. Be
59// careful to only use it once all the CPUs that you care about have
60// been initialized
61int maxThreadsPerCPU = 1;
62
63CPUProgressEvent::CPUProgressEvent(EventQueue *q, Tick ival,
64 BaseCPU *_cpu)
65 : Event(q, Event::Progress_Event_Pri), interval(ival),
66 lastNumInst(0), cpu(_cpu)
67{
68 if (interval)
69 schedule(curTick + interval);
70}
71
72void
73CPUProgressEvent::process()
74{
75 Counter temp = cpu->totalInstructions();
76#ifndef NDEBUG
77 double ipc = double(temp - lastNumInst) / (interval / cpu->ticks(1));
78
79 DPRINTFN("%s progress event, instructions committed: %lli, IPC: %0.8d\n",
80 cpu->name(), temp - lastNumInst, ipc);
81 ipc = 0.0;
82#else
83 cprintf("%lli: %s progress event, instructions committed: %lli\n",
84 curTick, cpu->name(), temp - lastNumInst);
85#endif
86 lastNumInst = temp;
87 schedule(curTick + interval);
88}
89
90const char *
91CPUProgressEvent::description() const
92{
93 return "CPU Progress";
94}
95

--- 20 unchanged lines hidden (view full) ---

116 // allocate per-thread instruction-based event queues
117 comInstEventQueue = new EventQueue *[number_of_threads];
118 for (int i = 0; i < number_of_threads; ++i)
119 comInstEventQueue[i] = new EventQueue("instruction-based event queue");
120
121 //
122 // set up instruction-count-based termination events, if any
123 //
124 if (p->max_insts_any_thread != 0)
125 for (int i = 0; i < number_of_threads; ++i)
126 schedExitSimLoop("a thread reached the max instruction count",
127 p->max_insts_any_thread, 0,
128 comInstEventQueue[i]);
129
130 if (p->max_insts_all_threads != 0) {
131 // allocate & initialize shared downcounter: each event will
132 // decrement this when triggered; simulation will terminate
133 // when counter reaches 0
134 int *counter = new int;
135 *counter = number_of_threads;
136 for (int i = 0; i < number_of_threads; ++i)
137 new CountedExitEvent(comInstEventQueue[i],
138 "all threads reached the max instruction count",
139 p->max_insts_all_threads, *counter);
140 }
141
142 // allocate per-thread load-based event queues
143 comLoadEventQueue = new EventQueue *[number_of_threads];
144 for (int i = 0; i < number_of_threads; ++i)
145 comLoadEventQueue[i] = new EventQueue("load-based event queue");
146
147 //
148 // set up instruction-count-based termination events, if any
149 //
150 if (p->max_loads_any_thread != 0)
151 for (int i = 0; i < number_of_threads; ++i)
152 schedExitSimLoop("a thread reached the max load count",
153 p->max_loads_any_thread, 0,
154 comLoadEventQueue[i]);
155
156 if (p->max_loads_all_threads != 0) {
157 // allocate & initialize shared downcounter: each event will
158 // decrement this when triggered; simulation will terminate
159 // when counter reaches 0
160 int *counter = new int;
161 *counter = number_of_threads;
162 for (int i = 0; i < number_of_threads; ++i)
163 new CountedExitEvent(comLoadEventQueue[i],
164 "all threads reached the max load count",
165 p->max_loads_all_threads, *counter);
166 }
167
168 functionTracingEnabled = false;
169 if (p->function_trace) {
170 functionTraceStream = simout.find(csprintf("ftrace.%s", name()));
171 currentFunctionStart = currentFunctionEnd = 0;
172 functionEntryTick = p->function_trace_start;
173
174 if (p->function_trace_start == 0) {
175 functionTracingEnabled = true;
176 } else {
177 new EventWrapper<BaseCPU,
178 &BaseCPU::enableFunctionTrace>(
179 this, p->function_trace_start, true);
180 }
181 }
182#if FULL_SYSTEM
183 profileEvent = NULL;
184 if (params()->profile)
185 profileEvent = new ProfileEvent(this, params()->profile);
186#endif
187 tracer = params()->tracer;

--- 16 unchanged lines hidden (view full) ---

204 registerThreadContexts();
205}
206
207void
208BaseCPU::startup()
209{
210#if FULL_SYSTEM
211 if (!params()->defer_registration && profileEvent)
212 profileEvent->schedule(curTick);
213#endif
214
215 if (params()->progress_interval) {
216 new CPUProgressEvent(&mainEventQueue,
217 ticks(params()->progress_interval),
218 this);
219 }
220}
221
222
223void
224BaseCPU::regStats()
225{
226 using namespace Stats;

--- 68 unchanged lines hidden (view full) ---

295}
296
297void
298BaseCPU::switchOut()
299{
300// panic("This CPU doesn't support sampling!");
301#if FULL_SYSTEM
302 if (profileEvent && profileEvent->scheduled())
303 profileEvent->deschedule();
304#endif
305}
306
307void
308BaseCPU::takeOverFrom(BaseCPU *oldCPU, Port *ic, Port *dc)
309{
310 assert(threadContexts.size() == oldCPU->threadContexts.size());
311

--- 19 unchanged lines hidden (view full) ---

331
332#if FULL_SYSTEM
333 interrupts = oldCPU->interrupts;
334
335 for (int i = 0; i < threadContexts.size(); ++i)
336 threadContexts[i]->profileClear();
337
338 if (profileEvent)
339 profileEvent->schedule(curTick);
340#endif
341
342 // Connect new CPU to old CPU's memory only if new CPU isn't
343 // connected to anything. Also connect old CPU's memory to new
344 // CPU.
345 if (!ic->isConnected()) {
346 Port *peer = oldCPU->getPort("icache_port")->getPeer();
347 ic->setPeer(peer);

--- 5 unchanged lines hidden (view full) ---

353 dc->setPeer(peer);
354 peer->setPeer(dc);
355 }
356}
357
358
359#if FULL_SYSTEM
360BaseCPU::ProfileEvent::ProfileEvent(BaseCPU *_cpu, Tick _interval)
361 : Event(&mainEventQueue), cpu(_cpu), interval(_interval)
362{ }
363
364void
365BaseCPU::ProfileEvent::process()
366{
367 for (int i = 0, size = cpu->threadContexts.size(); i < size; ++i) {
368 ThreadContext *tc = cpu->threadContexts[i];
369 tc->profileSample();
370 }
371
372 schedule(curTick + interval);
373}
374
375void
376BaseCPU::post_interrupt(int int_num, int index)
377{
378 interrupts.post(int_num, index);
379}
380

--- 60 unchanged lines hidden ---