Searched refs:first (Results 101 - 125 of 175) sorted by relevance

1234567

/gem5/src/cpu/o3/
H A Dstore_set.cc323 if ((*store_list_it).first <= squashed_num) {
364 num, (*store_list_it).first, (*store_list_it).second);
H A Drename_impl.hh646 //For all kind of instructions, check ROB and IQ first
1151 scoreboard->unsetReg(rename_result.first);
1157 rename_result.first->index(),
1158 rename_result.first->flatIndex());
1162 rename_result.first,
1174 // (rename_result.first), and record the previous physical
1178 rename_result.first,
/gem5/src/arch/mips/
H A Dtlb.cc85 while (i->first == vpn) {
123 while (i->first == vpn) {
/gem5/src/arch/power/
H A Dtlb.cc89 while (i->first == vpn) {
126 while (i->first == vpn) {
/gem5/src/gpu-compute/
H A Dlds_state.cc282 while (!returnQueue.empty() && returnQueue.front().first <= now) {
309 Tick next = returnQueue.front().first;
H A Dscoreboard_check_stage.cc144 Wavefront *curWave = waveStatusList[unitId]->at(wvId).first;
H A Dgpu_tlb.cc846 // the first place. We'll assume the reserved bits are
1141 // the first place. We'll assume the reserved bits are
1286 * We actually send the very first packet of all the
1687 accessed_before = curTick() - ret.first->second.lastTimeAccessed;
1688 ret.first->second.totalReuseDistance += accessed_before;
1691 ret.first->second.accessesPerPage++;
1692 ret.first->second.lastTimeAccessed = curTick();
1695 ret.first->second.localTLBAccesses
1771 *page_stat_file << std::hex << iter->first << ",";
/gem5/src/systemc/core/
H A Dscheduler.hh82 * priority events in front of it. When it runs, it will start the first
83 * evaluate phase of the first delta cycle.
92 * The readyEvent runs all three steps of the delta cycle. It first goes
124 * first, since those are part of the current delta cycle. Then the pause
210 // Schedule p to run first.
322 // Return how many ticks there are until the first pending event, if any.
329 return timeSlots.begin()->first - getCurTick();
439 (timeSlots.empty() || timeSlots.begin()->first > maxTick) &&
/gem5/ext/pybind11/include/pybind11/detail/
H A Dcommon.h58 // Apple changes clang version macros to its Xcode version; the first Xcode release based on
213 #define PYBIND11_CONCAT(first, second) first##second
430 /// Returns the value_and_holder wrapper for the given type (or the first, if `find_type`
533 constexpr int first(int i) { return i; } function
535 constexpr int first(int i, T v, Ts... vs) { return v ? i : first(i + 1, vs...); } function
542 /// Return the index of the first type in Ts which satisfies Predicate<T>. Returns sizeof...(Ts) if
545 constexpr int constexpr_first() { return constexpr_impl::first(0, Predicate<Ts>::value...); }
778 any_container(It first, I argument
[all...]
/gem5/ext/systemc/src/sysc/utils/
H A Dsc_string.h78 sc_string_old( const char* s, int n ); // get first n chars from the string
103 // returns substring [first,last]
105 sc_string_old substr( int first, int last ) const;
/gem5/src/mem/ruby/network/
H A DNetwork.cc204 for (auto it = matching_ranges.first; it != matching_ranges.second; it++) {
/gem5/src/sim/
H A Ddvfs_handler.cc213 DomainID id = ev_pair.first;
/gem5/src/mem/ruby/structures/
H A DPersistentTable.cc53 AddressMap::iterator i = r.first;
/gem5/src/mem/cache/tags/
H A Dfa_lru.hh130 return std::hash<T1>()(p.first) ^ std::hash<T2>()(p.second);
/gem5/ext/dsent/
H A DDSENT.cc65 const String& net_name = it->first;
74 const String& net_name = it->first;
/gem5/src/arch/riscv/
H A Dtlb.cc87 while (i->first == vpn) {
125 while (i->first == vpn) {
/gem5/ext/googletest/googlemock/src/
H A Dgmock-matchers.cc243 // Perform a depth-first search from left node ilhs to the sink. If a
320 << "element #" << it->first << ", "
350 *listener << sep << " - element #" << matches[mi].first
/gem5/src/mem/
H A Dsnoop_filter.cc91 cachedLocations.emplace(line_addr, SnoopItem()).first;
167 assert(reqLookupResult.it->first == line_addr);
/gem5/ext/pybind11/tests/
H A Dconstructor_stats.h49 Note that `.alive()` should usually be the first thing you call as it invokes Python's garbage
176 t2 = &p.first;
179 t1 = &p.first;
/gem5/ext/pybind11/include/pybind11/
H A Dpybind11.h375 // need to append a newline first:
455 // We do this in two passes: in the first pass, we load arguments with `convert=false`;
614 // We're in the first no-convert pass, so swap out the conversion flags for a
660 // if we'd encountered this failure in the first-pass loop.
759 bool first = true;
761 if (first) first = false;
763 msg += pybind11::str("{}={!r}").format(kwarg.first, kwarg.second);
1380 /// Dual-argument factory function: the first function is called when no alias is needed, the second
1411 return pybind11::str("{}.{}").format(type_name, kv.first);
1673 make_iterator(Iterator first, Sentinel last, Extra &&... extra) argument
1702 make_key_iterator(Iterator first, Sentinel last, Extra &&... extra) argument
[all...]
H A Dcast.h150 all_type_info_populate(type, ins.first->second);
152 return ins.first->second;
281 0, /* vpos: (non-simple types only): the first vptr comes first */
316 * `find_type` is omitted (or explicitly specified as nullptr) the first value/holder are returned,
456 for (auto it = range.first; it != range.second; ++it) {
508 for (auto it_i = it_instances.first; it_i != it_instances.second; ++it_i) {
590 type_caster_generic sub_caster(*cast.first);
722 // with .second = nullptr. (p.first = nullptr is not an error: it becomes None).
872 st.first, polic
[all...]
/gem5/ext/googletest/googlemock/include/gmock/
H A Dgmock-matchers.h173 // can talk to 'listener' without checking its validity first.
554 // (first to create T from M and then to create Matcher<T> from T).
729 // iff the first N fields of matcher_tuple matches the first N
739 // describes failures in matching the first N fields of matchers
740 // against the first N fields of values. If there is no failure,
746 // First, describes failures in the first N - 1 fields.
1424 static const char* Desc() { return "a pair where the first < the second"; }
1428 static const char* Desc() { return "a pair where the first > the second"; }
1432 static const char* Desc() { return "a pair where the first <
3119 ElementsAreMatcherImpl(InputIter first, InputIter last) argument
3359 UnorderedElementsAreMatcherImpl(InputIter first, InputIter last) argument
3507 UnorderedElementsAreArrayMatcher(Iter first, Iter last) argument
3528 ElementsAreArrayMatcher(Iter first, Iter last) argument
3646 ElementsAreArray(Iter first, Iter last) argument
3688 UnorderedElementsAreArray(Iter first, Iter last) argument
[all...]
/gem5/src/mem/ruby/system/
H A DSequencer.cc208 RequestTable::iterator i = r.first;
228 RequestTable::iterator i = r.first;
397 // blockOnQueue blocks all first-level cache controller queues
400 // the mandatory_q before unblocking the first-level controller.
575 // To support SwapReq, we need to check isWrite() first: a SwapReq
577 // both isWrite() and isRead() are true, check isWrite() first here.
666 out << " " << i->first << "=" << i->second;
/gem5/src/dev/storage/
H A Ddisk_image.cc368 SafeWriteSwap(stream, (uint64_t)(*iter).first);
383 child->write((*i).second->data, (*i).first);
/gem5/ext/dsent/model/
H A DElectricalModel.h61 return "[" + String(net_index_.second) + ":" + String(net_index_.first) + "]";

Completed in 75 milliseconds

1234567