base.cc revision 9179
1/* 2 * Copyright (c) 2011-2012 ARM Limited 3 * All rights reserved 4 * 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. 13 * 14 * Copyright (c) 2002-2005 The Regents of The University of Michigan 15 * Copyright (c) 2011 Regents of the University of California 16 * All rights reserved. 17 * 18 * Redistribution and use in source and binary forms, with or without 19 * modification, are permitted provided that the following conditions are 20 * met: redistributions of source code must retain the above copyright 21 * notice, this list of conditions and the following disclaimer; 22 * redistributions in binary form must reproduce the above copyright 23 * notice, this list of conditions and the following disclaimer in the 24 * documentation and/or other materials provided with the distribution; 25 * neither the name of the copyright holders nor the names of its 26 * contributors may be used to endorse or promote products derived from 27 * this software without specific prior written permission. 28 * 29 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 30 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 31 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 32 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 33 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 34 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 35 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 36 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 37 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 38 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 39 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 40 * 41 * Authors: Steve Reinhardt 42 * Nathan Binkert 43 * Rick Strong 44 */ 45 46#include <iostream> 47#include <sstream> 48#include <string> 49 50#include "arch/tlb.hh" 51#include "base/loader/symtab.hh" 52#include "base/cprintf.hh" 53#include "base/misc.hh" 54#include "base/output.hh" 55#include "base/trace.hh" 56#include "cpu/base.hh" 57#include "cpu/checker/cpu.hh" 58#include "cpu/cpuevent.hh" 59#include "cpu/profile.hh" 60#include "cpu/thread_context.hh" 61#include "debug/SyscallVerbose.hh" 62#include "params/BaseCPU.hh" 63#include "sim/full_system.hh" 64#include "sim/process.hh" 65#include "sim/sim_events.hh" 66#include "sim/sim_exit.hh" 67#include "sim/system.hh" 68 69// Hack 70#include "sim/stat_control.hh" 71 72using namespace std; 73 74vector<BaseCPU *> BaseCPU::cpuList; 75 76// This variable reflects the max number of threads in any CPU. Be 77// careful to only use it once all the CPUs that you care about have 78// been initialized 79int maxThreadsPerCPU = 1; 80 81CPUProgressEvent::CPUProgressEvent(BaseCPU *_cpu, Tick ival) 82 : Event(Event::Progress_Event_Pri), _interval(ival), lastNumInst(0), 83 cpu(_cpu), _repeatEvent(true) 84{ 85 if (_interval) 86 cpu->schedule(this, curTick() + _interval); 87} 88 89void 90CPUProgressEvent::process() 91{ 92 Counter temp = cpu->totalOps(); 93#ifndef NDEBUG 94 double ipc = double(temp - lastNumInst) / (_interval / cpu->clockPeriod()); 95 96 DPRINTFN("%s progress event, total committed:%i, progress insts committed: " 97 "%lli, IPC: %0.8d\n", cpu->name(), temp, temp - lastNumInst, 98 ipc); 99 ipc = 0.0; 100#else 101 cprintf("%lli: %s progress event, total committed:%i, progress insts " 102 "committed: %lli\n", curTick(), cpu->name(), temp, 103 temp - lastNumInst); 104#endif 105 lastNumInst = temp; 106 107 if (_repeatEvent) 108 cpu->schedule(this, curTick() + _interval); 109} 110 111const char * 112CPUProgressEvent::description() const 113{ 114 return "CPU Progress"; 115} 116 117BaseCPU::BaseCPU(Params *p, bool is_checker) 118 : MemObject(p), instCnt(0), _cpuId(p->cpu_id), 119 _instMasterId(p->system->getMasterId(name() + ".inst")), 120 _dataMasterId(p->system->getMasterId(name() + ".data")), 121 interrupts(p->interrupts), 122 numThreads(p->numThreads), system(p->system) 123{ 124 // if Python did not provide a valid ID, do it here 125 if (_cpuId == -1 ) { 126 _cpuId = cpuList.size(); 127 } 128 129 // add self to global list of CPUs 130 cpuList.push_back(this); 131 132 DPRINTF(SyscallVerbose, "Constructing CPU with id %d\n", _cpuId); 133 134 if (numThreads > maxThreadsPerCPU) 135 maxThreadsPerCPU = numThreads; 136 137 // allocate per-thread instruction-based event queues 138 comInstEventQueue = new EventQueue *[numThreads]; 139 for (ThreadID tid = 0; tid < numThreads; ++tid) 140 comInstEventQueue[tid] = 141 new EventQueue("instruction-based event queue"); 142 143 // 144 // set up instruction-count-based termination events, if any 145 // 146 if (p->max_insts_any_thread != 0) { 147 const char *cause = "a thread reached the max instruction count"; 148 for (ThreadID tid = 0; tid < numThreads; ++tid) { 149 Event *event = new SimLoopExitEvent(cause, 0); 150 comInstEventQueue[tid]->schedule(event, p->max_insts_any_thread); 151 } 152 } 153 154 if (p->max_insts_all_threads != 0) { 155 const char *cause = "all threads reached the max instruction count"; 156 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 = numThreads; 162 for (ThreadID tid = 0; tid < numThreads; ++tid) { 163 Event *event = new CountedExitEvent(cause, *counter); 164 comInstEventQueue[tid]->schedule(event, p->max_insts_all_threads); 165 } 166 } 167 168 // allocate per-thread load-based event queues 169 comLoadEventQueue = new EventQueue *[numThreads]; 170 for (ThreadID tid = 0; tid < numThreads; ++tid) 171 comLoadEventQueue[tid] = new EventQueue("load-based event queue"); 172 173 // 174 // set up instruction-count-based termination events, if any 175 // 176 if (p->max_loads_any_thread != 0) { 177 const char *cause = "a thread reached the max load count"; 178 for (ThreadID tid = 0; tid < numThreads; ++tid) { 179 Event *event = new SimLoopExitEvent(cause, 0); 180 comLoadEventQueue[tid]->schedule(event, p->max_loads_any_thread); 181 } 182 } 183 184 if (p->max_loads_all_threads != 0) { 185 const char *cause = "all threads reached the max load count"; 186 // allocate & initialize shared downcounter: each event will 187 // decrement this when triggered; simulation will terminate 188 // when counter reaches 0 189 int *counter = new int; 190 *counter = numThreads; 191 for (ThreadID tid = 0; tid < numThreads; ++tid) { 192 Event *event = new CountedExitEvent(cause, *counter); 193 comLoadEventQueue[tid]->schedule(event, p->max_loads_all_threads); 194 } 195 } 196 197 functionTracingEnabled = false; 198 if (p->function_trace) { 199 const string fname = csprintf("ftrace.%s", name()); 200 functionTraceStream = simout.find(fname); 201 if (!functionTraceStream) 202 functionTraceStream = simout.create(fname); 203 204 currentFunctionStart = currentFunctionEnd = 0; 205 functionEntryTick = p->function_trace_start; 206 207 if (p->function_trace_start == 0) { 208 functionTracingEnabled = true; 209 } else { 210 typedef EventWrapper<BaseCPU, &BaseCPU::enableFunctionTrace> wrap; 211 Event *event = new wrap(this, true); 212 schedule(event, p->function_trace_start); 213 } 214 } 215 216 // The interrupts should always be present unless this CPU is 217 // switched in later or in case it is a checker CPU 218 if (!params()->defer_registration && !is_checker) { 219 if (interrupts) { 220 interrupts->setCPU(this); 221 } else { 222 fatal("CPU %s has no interrupt controller.\n" 223 "Ensure createInterruptController() is called.\n", name()); 224 } 225 } 226 227 if (FullSystem) { 228 profileEvent = NULL; 229 if (params()->profile) 230 profileEvent = new ProfileEvent(this, params()->profile); 231 } 232 tracer = params()->tracer; 233} 234 235void 236BaseCPU::enableFunctionTrace() 237{ 238 functionTracingEnabled = true; 239} 240 241BaseCPU::~BaseCPU() 242{ 243 delete profileEvent; 244 delete[] comLoadEventQueue; 245 delete[] comInstEventQueue; 246} 247 248void 249BaseCPU::init() 250{ 251 if (!params()->defer_registration) 252 registerThreadContexts(); 253} 254 255void 256BaseCPU::startup() 257{ 258 if (FullSystem) { 259 if (!params()->defer_registration && profileEvent) 260 schedule(profileEvent, curTick()); 261 } 262 263 if (params()->progress_interval) { 264 new CPUProgressEvent(this, params()->progress_interval); 265 } 266} 267 268 269void 270BaseCPU::regStats() 271{ 272 using namespace Stats; 273 274 numCycles 275 .name(name() + ".numCycles") 276 .desc("number of cpu cycles simulated") 277 ; 278 279 numWorkItemsStarted 280 .name(name() + ".numWorkItemsStarted") 281 .desc("number of work items this cpu started") 282 ; 283 284 numWorkItemsCompleted 285 .name(name() + ".numWorkItemsCompleted") 286 .desc("number of work items this cpu completed") 287 ; 288 289 int size = threadContexts.size(); 290 if (size > 1) { 291 for (int i = 0; i < size; ++i) { 292 stringstream namestr; 293 ccprintf(namestr, "%s.ctx%d", name(), i); 294 threadContexts[i]->regStats(namestr.str()); 295 } 296 } else if (size == 1) 297 threadContexts[0]->regStats(name()); 298} 299 300MasterPort & 301BaseCPU::getMasterPort(const string &if_name, int idx) 302{ 303 // Get the right port based on name. This applies to all the 304 // subclasses of the base CPU and relies on their implementation 305 // of getDataPort and getInstPort. In all cases there methods 306 // return a CpuPort pointer. 307 if (if_name == "dcache_port") 308 return getDataPort(); 309 else if (if_name == "icache_port") 310 return getInstPort(); 311 else 312 return MemObject::getMasterPort(if_name, idx); 313} 314 315void 316BaseCPU::registerThreadContexts() 317{ 318 ThreadID size = threadContexts.size(); 319 for (ThreadID tid = 0; tid < size; ++tid) { 320 ThreadContext *tc = threadContexts[tid]; 321 322 /** This is so that contextId and cpuId match where there is a 323 * 1cpu:1context relationship. Otherwise, the order of registration 324 * could affect the assignment and cpu 1 could have context id 3, for 325 * example. We may even want to do something like this for SMT so that 326 * cpu 0 has the lowest thread contexts and cpu N has the highest, but 327 * I'll just do this for now 328 */ 329 if (numThreads == 1) 330 tc->setContextId(system->registerThreadContext(tc, _cpuId)); 331 else 332 tc->setContextId(system->registerThreadContext(tc)); 333 334 if (!FullSystem) 335 tc->getProcessPtr()->assignThreadContext(tc->contextId()); 336 } 337} 338 339 340int 341BaseCPU::findContext(ThreadContext *tc) 342{ 343 ThreadID size = threadContexts.size(); 344 for (ThreadID tid = 0; tid < size; ++tid) { 345 if (tc == threadContexts[tid]) 346 return tid; 347 } 348 return 0; 349} 350 351void 352BaseCPU::switchOut() 353{ 354 if (profileEvent && profileEvent->scheduled()) 355 deschedule(profileEvent); 356} 357 358void 359BaseCPU::takeOverFrom(BaseCPU *oldCPU) 360{ 361 assert(threadContexts.size() == oldCPU->threadContexts.size()); 362 assert(_cpuId == oldCPU->cpuId()); 363 364 ThreadID size = threadContexts.size(); 365 for (ThreadID i = 0; i < size; ++i) { 366 ThreadContext *newTC = threadContexts[i]; 367 ThreadContext *oldTC = oldCPU->threadContexts[i]; 368 369 newTC->takeOverFrom(oldTC); 370 371 CpuEvent::replaceThreadContext(oldTC, newTC); 372 373 assert(newTC->contextId() == oldTC->contextId()); 374 assert(newTC->threadId() == oldTC->threadId()); 375 system->replaceThreadContext(newTC, newTC->contextId()); 376 377 /* This code no longer works since the zero register (e.g., 378 * r31 on Alpha) doesn't necessarily contain zero at this 379 * point. 380 if (DTRACE(Context)) 381 ThreadContext::compare(oldTC, newTC); 382 */ 383 384 MasterPort *old_itb_port = oldTC->getITBPtr()->getMasterPort(); 385 MasterPort *old_dtb_port = oldTC->getDTBPtr()->getMasterPort(); 386 MasterPort *new_itb_port = newTC->getITBPtr()->getMasterPort(); 387 MasterPort *new_dtb_port = newTC->getDTBPtr()->getMasterPort(); 388 389 // Move over any table walker ports if they exist 390 if (new_itb_port) { 391 assert(!new_itb_port->isConnected()); 392 assert(old_itb_port); 393 assert(old_itb_port->isConnected()); 394 SlavePort &slavePort = old_itb_port->getSlavePort(); 395 old_itb_port->unbind(); 396 new_itb_port->bind(slavePort); 397 } 398 if (new_dtb_port) { 399 assert(!new_dtb_port->isConnected()); 400 assert(old_dtb_port); 401 assert(old_dtb_port->isConnected()); 402 SlavePort &slavePort = old_dtb_port->getSlavePort(); 403 old_dtb_port->unbind(); 404 new_dtb_port->bind(slavePort); 405 } 406 407 // Checker whether or not we have to transfer CheckerCPU 408 // objects over in the switch 409 CheckerCPU *oldChecker = oldTC->getCheckerCpuPtr(); 410 CheckerCPU *newChecker = newTC->getCheckerCpuPtr(); 411 if (oldChecker && newChecker) { 412 MasterPort *old_checker_itb_port = 413 oldChecker->getITBPtr()->getMasterPort(); 414 MasterPort *old_checker_dtb_port = 415 oldChecker->getDTBPtr()->getMasterPort(); 416 MasterPort *new_checker_itb_port = 417 newChecker->getITBPtr()->getMasterPort(); 418 MasterPort *new_checker_dtb_port = 419 newChecker->getDTBPtr()->getMasterPort(); 420 421 // Move over any table walker ports if they exist for checker 422 if (new_checker_itb_port) { 423 assert(!new_checker_itb_port->isConnected()); 424 assert(old_checker_itb_port); 425 assert(old_checker_itb_port->isConnected()); 426 SlavePort &slavePort = old_checker_itb_port->getSlavePort(); 427 old_checker_itb_port->unbind(); 428 new_checker_itb_port->bind(slavePort); 429 } 430 if (new_checker_dtb_port) { 431 assert(!new_checker_dtb_port->isConnected()); 432 assert(old_checker_dtb_port); 433 assert(old_checker_dtb_port->isConnected()); 434 SlavePort &slavePort = old_checker_dtb_port->getSlavePort(); 435 old_checker_dtb_port->unbind(); 436 new_checker_dtb_port->bind(slavePort); 437 } 438 } 439 } 440 441 interrupts = oldCPU->interrupts; 442 interrupts->setCPU(this); 443 oldCPU->interrupts = NULL; 444 445 if (FullSystem) { 446 for (ThreadID i = 0; i < size; ++i) 447 threadContexts[i]->profileClear(); 448 449 if (profileEvent) 450 schedule(profileEvent, curTick()); 451 } 452 453 // All CPUs have an instruction and a data port, and the new CPU's 454 // ports are dangling while the old CPU has its ports connected 455 // already. Unbind the old CPU and then bind the ports of the one 456 // we are switching to. 457 assert(!getInstPort().isConnected()); 458 assert(oldCPU->getInstPort().isConnected()); 459 SlavePort &inst_peer_port = oldCPU->getInstPort().getSlavePort(); 460 oldCPU->getInstPort().unbind(); 461 getInstPort().bind(inst_peer_port); 462 463 assert(!getDataPort().isConnected()); 464 assert(oldCPU->getDataPort().isConnected()); 465 SlavePort &data_peer_port = oldCPU->getDataPort().getSlavePort(); 466 oldCPU->getDataPort().unbind(); 467 getDataPort().bind(data_peer_port); 468} 469 470 471BaseCPU::ProfileEvent::ProfileEvent(BaseCPU *_cpu, Tick _interval) 472 : cpu(_cpu), interval(_interval) 473{ } 474 475void 476BaseCPU::ProfileEvent::process() 477{ 478 ThreadID size = cpu->threadContexts.size(); 479 for (ThreadID i = 0; i < size; ++i) { 480 ThreadContext *tc = cpu->threadContexts[i]; 481 tc->profileSample(); 482 } 483 484 cpu->schedule(this, curTick() + interval); 485} 486 487void 488BaseCPU::serialize(std::ostream &os) 489{ 490 SERIALIZE_SCALAR(instCnt); 491 interrupts->serialize(os); 492} 493 494void 495BaseCPU::unserialize(Checkpoint *cp, const std::string §ion) 496{ 497 UNSERIALIZE_SCALAR(instCnt); 498 interrupts->unserialize(cp, section); 499} 500 501void 502BaseCPU::traceFunctionsInternal(Addr pc) 503{ 504 if (!debugSymbolTable) 505 return; 506 507 // if pc enters different function, print new function symbol and 508 // update saved range. Otherwise do nothing. 509 if (pc < currentFunctionStart || pc >= currentFunctionEnd) { 510 string sym_str; 511 bool found = debugSymbolTable->findNearestSymbol(pc, sym_str, 512 currentFunctionStart, 513 currentFunctionEnd); 514 515 if (!found) { 516 // no symbol found: use addr as label 517 sym_str = csprintf("0x%x", pc); 518 currentFunctionStart = pc; 519 currentFunctionEnd = pc + 1; 520 } 521 522 ccprintf(*functionTraceStream, " (%d)\n%d: %s", 523 curTick() - functionEntryTick, curTick(), sym_str); 524 functionEntryTick = curTick(); 525 } 526} 527 528bool 529BaseCPU::CpuPort::recvTimingResp(PacketPtr pkt) 530{ 531 panic("BaseCPU doesn't expect recvTiming!\n"); 532 return true; 533} 534 535void 536BaseCPU::CpuPort::recvRetry() 537{ 538 panic("BaseCPU doesn't expect recvRetry!\n"); 539} 540 541void 542BaseCPU::CpuPort::recvFunctionalSnoop(PacketPtr pkt) 543{ 544 // No internal storage to update (in the general case). A CPU with 545 // internal storage, e.g. an LSQ that should be part of the 546 // coherent memory has to check against stored data. 547} 548