1/* 2 * Copyright (c) 2003-2006 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 --- 69 unchanged lines hidden (view full) --- 78 workItemsEnd(0), 79 _params(p), 80 totalNumInsts(0), 81 instEventQueue("system instruction-based event queue") 82{ 83 // add self to global system list 84 systemList.push_back(this); 85 |
86 /** Keep track of all memories we can execute code out of 87 * in our system 88 */ 89 for (int x = 0; x < p->memories.size(); x++) { 90 if (!p->memories[x]) 91 continue; 92 memRanges.push_back(RangeSize(p->memories[x]->start(), 93 p->memories[x]->size())); 94 } 95 |
96#if FULL_SYSTEM 97 kernelSymtab = new SymbolTable; 98 if (!debugSymbolTable) 99 debugSymbolTable = new SymbolTable; 100 101 102 /** 103 * Get a functional port to memory --- 189 unchanged lines hidden (view full) --- 293Addr 294System::freeMemSize() 295{ 296 return physmem->size() - (pagePtr << LogVMPageSize); 297} 298 299#endif 300 |
301bool 302System::isMemory(const Addr addr) const 303{ 304 std::list<Range<Addr> >::const_iterator i; 305 for (i = memRanges.begin(); i != memRanges.end(); i++) { 306 if (*i == addr) 307 return true; 308 } 309 return false; 310} 311 |
312void 313System::resume() 314{ 315 SimObject::resume(); 316 totalNumInsts = 0; 317} 318 319void --- 51 unchanged lines hidden --- |