/gem5/src/mem/ruby/profiler/ |
H A D | Profiler.cc | 359 for (map<uint32_t, AbstractController*>::iterator it = 361 it != m_ruby_system->m_abstract_controls[i].end(); ++it) { 363 AbstractController *ctr = (*it).second; 373 for (map<uint32_t, AbstractController*>::iterator it = 375 it != m_ruby_system->m_abstract_controls[i].end(); ++it) { 377 AbstractController *ctr = (*it).second; 392 for (map<uint32_t, AbstractController*>::iterator it = 394 it ! [all...] |
/gem5/src/dev/arm/ |
H A D | smmu_v3_transl.cc | 138 // The coroutine starts running as soon as it's created. 1046 for (auto it = ifc.duplicateReqs.begin(); 1047 it != ifc.duplicateReqs.end(); 1048 ++it) 1050 Addr other4k = (*it)->request.addr & ~0xfffULL; 1077 for (auto it = ifc.duplicateReqs.begin(); 1078 it!=ifc.duplicateReqs.end() && *it!=this; 1079 ++it) 1081 Addr other4k = (*it) 1111 std::list<SMMUTranslationProcess *>::iterator it; local [all...] |
H A D | smmu_v3_proc.cc | 183 for (auto it : sig.waiting) { 187 it->scheduleWakeup(curTick());
|
/gem5/ext/dsent/tech/ |
H A D | TechModel.cc | 64 for (const auto &it : params) 66 const String& key = it.first; 69 const String& include_filename = it.second; 251 //Remove the transistors in triode region as it does not exist 278 std::set<String>::const_iterator it; local 279 it = m_available_wire_layers_->find(layer_name_); 280 return (it != m_available_wire_layers_->end());
|
/gem5/ext/googletest/googlemock/include/gmock/ |
H A D | gmock-spec-builders.h | 111 // mock function Foo() is called, it needs to consult its expectations 114 // time, it could affect the "retired" attributes of Foo()'s 141 // In all of the following Untyped* functions, it's the caller's 230 // ON_CALL/EXPECT_CALL has been invoked on it. 259 // syntax checking relies on it. 297 // we cannot initialize it with _ as that triggers a compiler 445 // Registers a mock object and a mock method it owns. 453 // information helps the user identify which object it is. 459 // the registry when the last mock method associated with it has 480 // object it reference [all...] |
/gem5/ext/pybind11/include/pybind11/detail/ |
H A D | internals.h | 293 /// Constructs a std::string with the given arguments, stores it in `internals`, and returns its 311 auto it = internals.shared_data.find(name); local 312 return it != internals.shared_data.end() ? it->second : nullptr; 323 /// added to the shared data under the given name and a reference to it is returned. 327 auto it = internals.shared_data.find(name); local 328 T *ptr = (T *) (it != internals.shared_data.end() ? it->second : nullptr);
|
/gem5/ext/dsent/model/ |
H A D | Model.cc | 627 //for(Map<SubModel*>::ConstIterator it = m_sub_instances_->begin(); it != m_sub_instances_->end(); ++it) 629 //const Model* sub_model = (it->second)->getModel(); 660 for(Map<Result*>::ConstIterator it = result_map->begin(); it != result_map->end(); ++it) 662 const Result* result = it->second; 681 for(Map<SubModel*>::ConstIterator it = m_sub_instances_->begin(); it ! [all...] |
/gem5/src/mem/ruby/slicc_interface/ |
H A D | RubySlicc_Util.hh | 96 * and, if it finds one, checks to see if it is holding the address the access 178 for (const auto &it: bVec) { 179 if (it) {
|
/gem5/src/mem/ruby/system/ |
H A D | RubyPort.cc | 119 // pass it along to our super class 181 // and it must forward these responses back to the particular CPU. 199 for (auto it = l.begin(); it != l.end(); ++it) { 200 if (it->contains(pkt->getAddr())) { 201 // generally it is not safe to assume success here as 224 for (auto it = l.begin(); it != l.end(); ++it) { [all...] |
/gem5/ext/pybind11/include/pybind11/ |
H A D | stl_bind.h | 110 // (Technically, some of these (pop and __delitem__) don't actually require copyability, but it seems 131 cl.def(init([](iterable it) { 133 v->reserve(len_hint(it)); 134 for (handle h : it) 148 [](Vector &v, iterable it) { 150 v.reserve(old_size + len_hint(it)); 152 for (handle h : it) { 364 // Provide the buffer interface for vectors if we have data() and we have a format for it 365 // GCC seems to have "void std::vector<bool>::data()" - doing SFINAE on the existence of data() is insufficient, we need to check it returns an appropriate pointer 379 // numpy.h declares this for arbitrary types, but it ma [all...] |
/gem5/src/gpu-compute/ |
H A D | gpu_dyn_inst.cc | 519 for (auto it : cu->pagesTouched) { 523 .insert(ComputeUnit::pageDataStruct::value_type(it.first, 524 std::make_pair(1, it.second))); 529 ret.first->second.second += it.second;
|
/gem5/src/arch/arm/ |
H A D | utility.hh | 168 * at the current EL status: it hence returns a pair of boolean values: 175 * is not EL0 and EL1 is using AArch64, since it cannot 218 ITSTATE it = 0; local 219 it.top6 = psr.it2; 220 it.bottom2 = psr.it1; 222 return (uint8_t)it; 257 * Differs from inSecureState in that it ignores the current EL 265 * MPIDR_EL1 (by calling getMPIDR), or it is issuing a read 266 * to VMPIDR_EL2 (as it happens in virtualized systems) */
|
H A D | types.hh | 58 * But it is more convenient for simulation. The condition 397 ITSTATE it = _itstate; local 398 uint8_t cond_mask = it.mask; 399 uint8_t thumb_cond = it.cond; 411 it.mask = cond_mask; 412 it.cond = thumb_cond; 413 _itstate = it;
|
/gem5/ext/googletest/googlemock/src/ |
H A D | gmock-matchers.cc | 155 // When the TryAugment() method adds a flow, it sets left_[l] = r for some 173 // does not provide any new information. Instead, it enables more 256 // left_ element holding kUnused before TryAugment will be holding it 318 for (Iter it = pairs.begin(); it != pairs.end(); ++it) { 320 << "element #" << it->first << ", " 321 << "matcher #" << it->second << ")";
|
/gem5/ext/systemc/src/sysc/qt/md/ |
H A D | ksr1.s | 116 # use nested procedures, we ignore it (leaving a gap, though) 157 # block is passed in, so we must derefence it to get the helper's text 193 # The helper funtion will return here. Any result it has placed in 213 # use nested procedures, we ignore it (leaving a gap, though) 255 # because we don't use it, and we load the return address specially 333 # A new thread is set up to "appear" as if it were executing code at 334 # the beginning of qt_start and then it called a blocking routine 335 # (qt_blocki). So when a new thread starts to run, it gets unblocked 358 # If we ever return, it's an error. 419 # If we ever return, it' [all...] |
/gem5/src/systemc/ext/utils/ |
H A D | sc_vector.hh | 310 sc_vector_iter(RawIterator it, Policy acc=Policy()) : argument 311 Policy(acc), it_(it) 327 sc_vector_iter(const It &it, argument 332 ) : Policy(it.get_policy()), it_(it.it_) 657 for (const_iterator it = begin(); it != end(); it++) { 658 sc_object *obj_ptr = vec_->objectCast(const_cast<MT *>(&*it));
|
/gem5/src/mem/ruby/network/garnet2.0/ |
H A D | NetworkInterface.cc | 125 for (auto& it : in) { 126 if (it != nullptr) { 127 it->setConsumer(this); 170 * buffer. If yes, it picks that up, flitisizes it into a number of flits and 171 * puts it into an output buffer and schedules the output link. On a wakeup 172 * it also checks whether there are flits in the input link. If yes, it picks 310 // callback on it's MessageBuffer is not needed. 385 // so that the first router increments it t [all...] |
/gem5/src/mem/ |
H A D | snoop_filter.hh | 64 * of lines "above" it through a map from cache line address to 104 * Init a new snoop filter and tell it about all the slave ports 114 // no need to track this port if it is not snooping 132 * call finishRequest once it is known if the request needs to 273 SnoopFilterCache::iterator it; member in struct:SnoopFilter::ReqLookupResult 284 * iterator, so do not allow the compiler to implictly define it. 289 : it(end_it), retryItem{0, 0}
|
H A D | stack_dist_calc.cc | 119 // maximum possible value given by the leaves below it 160 // Delete the node if it is not required anymore 258 // new tree layer above and create a new Root node in it. 351 // added. This is useful if it is required to see the reuse 380 // encountered before and update it to the current index value 573 for (auto it = tree[0].rbegin(); (count < n) && (it != tree[0].rend()); 574 ++it, ++count) { 575 node = it->second;
|
/gem5/tests/test-progs/asmtest/src/riscv/isa/rv64mi/ |
H A D | ma_addr.S | 21 # indicate it's a load test 57 # indicate it's a store test
|
/gem5/src/cpu/kvm/ |
H A D | x86_cpu.cc | 373 // space, instead it uses signed 48 bit addresses that are 700 * mistaken. We need to reconstruct it from a bunch of ucode 701 * registers and wave a dead chicken over it (aka mask out and set 702 * reserved bits) to get it to work. 728 // is a attr.unusable flag in gem5, but it seems unused. qemu 748 // gem5 did set the access bits correctly, so we force it to one 784 // marked as busy. This is illegal in VMX, so we force it to busy. 922 for (auto it = indices.cbegin(); it != indices.cend(); ++it) { [all...] |
/gem5/src/mem/ruby/network/ |
H A D | MessageBuffer.cc | 256 // if a dequeue callback was requested, call it now 460 for (std::list<MsgPtr>::iterator it = (map_iter->second).begin(); 461 it != (map_iter->second).end(); ++it) { 463 Message *msg = (*it).get();
|
/gem5/src/learning_gem5/part2/ |
H A D | simple_cache.cc | 66 // pass it along to our super class 78 // If we can't send the packet across the port, store it for later. 144 // Try to resend it. It's possible that it fails again. 158 // If we can't send the packet across the port, store it for later. 181 // Try to resend it. It's possible that it fails again. 240 } // else, pkt contains the data it needs 254 // The packet is now done. We're about to put it in the port, no need for 264 // For each of the cpu ports, if it need 343 auto it = cacheStore.find(block_addr); local [all...] |
/gem5/src/arch/x86/regs/ |
H A D | msr.cc | 151 MsrMap::const_iterator it(msrMap.find(addr)); 152 if (it == msrMap.end()) { 155 regNum = it->second;
|
/gem5/src/systemc/core/ |
H A D | sc_event.cc | 414 ::sc_gem5::EventsIt it = ::sc_gem5::findEvent(str); local 415 return it == ::sc_gem5::allEvents.end() ? nullptr : *it;
|