Searched refs:end (Results 276 - 300 of 399) sorted by relevance

<<111213141516

/gem5/src/systemc/tlm_utils/
H A Dinstance_specific_extensions.cc60 if (it == ids_.end()) {
/gem5/src/arch/riscv/
H A Disa.cc62 std::fill(miscRegFile.begin(), miscRegFile.end(), 0);
H A Dtlb.cc86 if (i != lookupTable.end()) {
124 if (i != lookupTable.end()) {
347 // executed along a branch that will end up not being taken where the
351 // length is long enough to wrap around from the end of the memory to
/gem5/src/cpu/
H A Dbase_dyn_inst_impl.hh176 while (sn_it != cpu->snList.end()) {
/gem5/src/mem/
H A Daddr_mapper.cc244 AddrRangeList ranges(originalRanges.begin(), originalRanges.end());
H A Dsnoop_filter.hh97 SimObject(p), reqLookupResult(cachedLocations.end()),
283 * The constructor must be informed of the internal cache's end
286 * @param end_it Iterator to the end of the internal cache.
H A Dstack_dist_calc.cc377 if (ai != aiMap.end() && !(aiMap.key_comp()(r_address, ai->first))) {
449 // The index counter is updated at the end of each transaction
475 if (ai != aiMap.end() && !(aiMap.key_comp()(r_address, ai->first))) {
H A Ddram_ctrl.cc442 if (isInWriteQueue.find(burst_addr) != isInWriteQueue.end()) {
537 isInWriteQueue.end();
579 // different front end latency
735 // @todo we probably want to have a different front end and back
736 // end latency for split packets
776 DRAMCtrl::DRAMPacketQueue::iterator ret = queue.end();
790 for (auto i = queue.begin(); i != queue.end(); ++i) {
832 auto selected_pkt_it = queue.end();
837 for (auto i = queue.begin(); i != queue.end() ; ++i) {
909 if (selected_pkt_it == queue.end()) {
[all...]
/gem5/src/mem/cache/compressors/
H A Dcpack.cc68 std::fill(dictionary.begin(), dictionary.end(), zero_word);
/gem5/src/cpu/testers/traffic_gen/
H A Dbase.hh181 assert(waitingResp.find(pkt->req) == waitingResp.end());
/gem5/src/mem/ruby/network/
H A DMessageBuffer.hh72 std::pop_heap(m_prio_heap.begin(), m_prio_heap.end(),
/gem5/src/gpu-compute/
H A Dbrig_object.cc85 // allow offs == size for dummy end pointers
230 std::copy(str.begin(), str.end() , temp);
234 std::copy(str.begin(), str.end() - 1 , temp);
H A Dhsail_code.cc338 if (se == elements_by_addr.end()) {
352 if (se == elements_by_brigptr.end()) {
/gem5/src/dev/arm/
H A Dgpu_nomali.cc75 if (it_gpu == gpuTypeMap.end()) {
276 if (it_int == interruptMap.end())
/gem5/ext/testlib/
H A Dresult.py174 self.end(file_)
192 def end(self, file_): member in class:XMLElement
/gem5/src/learning_gem5/part2/
H A Dsimple_cache.cc344 if (it != cacheStore.end()) {
365 assert(cacheStore.find(pkt->getAddr()) == cacheStore.end());
/gem5/ext/pybind11/include/pybind11/detail/
H A Dinternals.h312 return it != internals.shared_data.end() ? it->second : nullptr;
328 T *ptr = (T *) (it != internals.shared_data.end() ? it->second : nullptr);
/gem5/ext/googletest/googlemock/include/gmock/
H A Dgmock-matchers.h1113 // Are we at the end of either s1 or s2?
1313 *os << "doesn't end with ";
2449 // Implements a matcher that checks the begin()..end() distance of an STL-style
2474 *os << "distance between begin() and end() ";
2478 *os << "distance between begin() and end() ";
2486 using std::end;
2487 DistanceType distance = std::distance(begin(container), end(container));
2489 DistanceType distance = std::distance(container.begin(), container.end());
2494 *listener << "whose distance between begin() and end() " << distance
2519 // begin(), and end()
[all...]
/gem5/ext/googletest/googletest/src/
H A Dgtest-death-test.cc248 // code; LIVED means that process lived beyond the end of the test code;
422 // Descriptor to the read end of the pipe to the child process. It is
423 // always -1 in the child process. The child keeps its write end of the
426 // Descriptor to the child's write end of the pipe to the parent process.
427 // It is always -1 in the parent process. The parent keeps its end of the
604 // necessary to acquire the handle to the write end of the pipe.
605 // 3. The child acquires the write end of the pipe and signals the parent
607 // 4. Now the parent can release the write end of the pipe on its side. If
610 // parent now has to release it, or read operations on the read end of
636 // Handle to the write end o
[all...]
/gem5/ext/pybind11/include/pybind11/
H A Dnumpy.h89 if (it != registered_dtypes.end())
396 return std::accumulate(shape_.begin(), shape_.end(), (ssize_t) 1, std::multiplies<ssize_t>());
523 std::sort(field_descriptors.begin(), field_descriptors.end(),
1101 std::sort(ordered_fields.begin(), ordered_fields.end(),
1393 ndim = std::accumulate(buffers.begin(), buffers.end(), ssize_t(0), [](ssize_t res, const buffer_info &buf) {
1404 auto end = buffers[i].shape.rend();
1405 for (auto shape_iter = buffers[i].shape.rbegin(); shape_iter != end; ++shape_iter, ++res_iter) {
1434 auto end = buffers[i].shape.crend();
1436 trivial_broadcast_c && shape_iter != end; ++shape_iter, ++stride_iter) {
1447 auto end
[all...]
H A Dpybind11.h334 /* Append at the end of the overload chain */
478 extra tuple or dict at the end of the positional arguments.
730 size_t end = sig.find(", "), next = end + 2;
733 if (end >= sig.size()) next = end = sig.find(')');
734 if (start < end && next < sig.size()) {
735 msg.append(sig, start, end - start);
1661 Sentinel end; member in struct:iterator_state
1667 /// Makes a python iterator from a first and past-the-end
[all...]
/gem5/ext/googletest/googletest/include/gtest/internal/
H A Dgtest-internal.h575 GTEST_CHECK_(it != registered_tests_.end());
980 // Finds the first element in the iterator range [begin, end) that
983 Iter ArrayAwareFind(Iter begin, Iter end, const Element& elem) { argument
984 for (Iter it = begin; it != end; ++it) {
988 return end;
1064 const_iterator end() const { return array_ + size_; } function in class:testing::internal::NativeArray
/gem5/src/cpu/o3/
H A Dlsq_unit_impl.hh304 load_inst->sqIt = storeQueue.end();
328 store_inst->lqIt = loadQueue.end();
405 while (++iter != loadQueue.end()) {
462 while (loadIt != loadQueue.end()) {
814 storeWBIt = storeQueue.end();
/gem5/src/cpu/checker/
H A Dcpu_impl.hh103 for (itr = instList.begin(); itr != instList.end(); itr++) {
576 // Change this back to warn if divergences end up being false positives
695 InstListIt inst_list_it = --(instList.end());
699 while (inst_list_it != instList.end())
/gem5/src/mem/ruby/profiler/
H A DProfiler.cc361 it != m_ruby_system->m_abstract_controls[i].end(); ++it) {
375 it != m_ruby_system->m_abstract_controls[i].end(); ++it) {
394 it != m_ruby_system->m_abstract_controls[i].end(); ++it) {

Completed in 75 milliseconds

<<111213141516