Searched refs:pair (Results 1 - 25 of 115) sorted by relevance

12345

/gem5/tests/test-progs/insttest/src/riscv/
H A Drv64a.cpp43 expect<pair<int64_t, int64_t>>({-1, 256}, []{
47 pair<int64_t, uint64_t> result;
52 return pair<int64_t, uint64_t>(rd, result.first);
54 expect<pair<bool, int64_t>>({true, 200}, []{
56 pair<int64_t, uint64_t> result = A::sc_w(50, mem);
57 return pair<bool, int64_t>(result.second == 1, mem);
61 expect<pair<int64_t, int64_t>>({65535, 255},
63 expect<pair<int64_t, int64_t>>({0xFFFFFFFF, -1},
66 expect<pair<int64_t, int64_t>>({0x0000000180000000LL, -1},
72 expect<pair<int64_
[all...]
H A Drv64a.h50 inline std::pair<int64_t, uint64_t>
62 inline std::pair<int64_t, int64_t>
74 inline std::pair<int64_t, int64_t>
86 inline std::pair<uint64_t, uint64_t>
98 inline std::pair<uint64_t, uint64_t>
110 inline std::pair<uint64_t, uint64_t>
122 inline std::pair<int64_t, int64_t>
134 inline std::pair<int64_t, int64_t>
146 inline std::pair<uint64_t, uint64_t>
158 inline std::pair<uint64_
[all...]
/gem5/src/mem/qos/
H A Dpolicy.hh77 * Builds a MasterID/value pair given a master input.
85 * @return A MasterID/Value pair.
88 std::pair<MasterID, T> pair(M master, T value);
114 std::pair<MasterID, T>
115 Policy::pair(M master, T value) function in class:QoS::Policy
126 return std::pair<MasterID, T>(id, value);
H A Dpolicy_fixed_prio.cc65 this->pair<std::string, uint8_t>(master, priority));
72 this->pair<const SimObject*, uint8_t>(master, priority));
H A Dpolicy_pf.hh111 using MasterHistory = std::pair<MasterID, double>;
/gem5/src/doxygen/
H A Dstl.hh60 /** STL pair class */
61 template <class X, class Y> class pair { class in namespace:std
/gem5/util/
H A Dtracediff95 @pair = split('\|', $subarg, -1); # -1 enables null trailing fields
96 if (@pair == 1) {
99 } elsif (@pair == 2) {
100 $a1 .= $pair[0];
101 $a2 .= $pair[1];
/gem5/util/minorview/
H A Dparse.py84 for pair in pairs:
85 name, rest, value = pair.groups()
99 for pair in pairs:
100 if len(pair) == 2:
101 index, value = pair
/gem5/src/gpu-compute/
H A Dschedule_stage.hh81 std::vector<std::vector<std::pair<Wavefront*, WAVE_STATUS>>*>
91 std::vector<std::pair<Wavefront*, DISPATCH_STATUS>> *dispatchList;
H A Dfetch_unit.hh85 std::vector<std::pair<Wavefront*, bool>> fetchStatusQueue;
H A Dpool_manager.hh50 virtual uint32_t regionSize(std::pair<uint32_t,uint32_t> &region) = 0;
H A Dsimple_pool_manager.hh60 uint32_t regionSize(std::pair<uint32_t,uint32_t> &region);
H A Dscoreboard_check_stage.hh100 std::vector<std::vector<std::pair<Wavefront*, WAVE_STATUS>>*>
/gem5/ext/mcpat/cacti/
H A Ddecoder.h130 pair<double, double> compute_delays(pair<double, double> inrisetime); // <nand2, nand3>
177 pair<double, double> compute_delays(
214 pair<double, double> get_max_delay_before_decoder(
215 pair<double, double> input_pair1,
216 pair<double, double> input_pair2);
/gem5/src/cpu/simple/probes/
H A Dsimpoint.hh61 typedef std::pair<Addr, Addr> BasicBlockRange;
90 void profile(const std::pair<SimpleThread*, StaticInstPtr>&);
H A Dsimpoint.cc71 typedef ProbeListenerArg<SimPoint, std::pair<SimpleThread*,StaticInstPtr>>
78 SimPoint::profile(const std::pair<SimpleThread*, StaticInstPtr>& p)
118 std::vector<std::pair<uint64_t, uint64_t> > counts;
/gem5/src/arch/arm/
H A Dvtophys.cc67 static std::pair<bool, Addr>
99 const std::pair<bool, Addr> translation(try_translate(tc, addr));
110 const std::pair<bool, Addr> translation(try_translate(tc, vaddr));
/gem5/src/mem/
H A Dsnoop_filter.hh139 std::pair<SnoopList, Cycles> lookupRequest(const Packet* cpkt,
162 std::pair<SnoopList, Cycles> lookupSnoop(const Packet* cpkt);
227 std::pair<SnoopList, Cycles> snoopAll(Cycles latency) const
231 std::pair<SnoopList, Cycles> snoopSelected(const SnoopList& slave_ports,
236 std::pair<SnoopList, Cycles> snoopDown(Cycles latency) const
H A Dstack_dist_calc.hh81 * 1. pair<uint64_t, bool> calcStackDistAndUpdate(Addr r_address,
99 * The return value of this function is a pair representing the
102 * 2. pair<uint64_t , bool> calcStackDist(Addr r_address, bool mark)
119 * The return value of this function is a pair representing the stack
123 * pair<uint64_t Stack_dist, bool isMarked> calcStackDistAndUpdate
125 * pair<uint64_t Stack_dist, bool isMarked> calcStackDist
328 std::pair<uint64_t, bool> calcStackDist(const Addr r_address,
343 std::pair<uint64_t, bool> calcStackDistAndUpdate(const Addr r_address,
/gem5/src/base/
H A Dstatistics.cc98 pair<MapType::iterator, bool> result =
360 int pair = size - 1; local
362 cvec[i] = cvec[pair];
363 if (pair - 1 >= 0)
364 cvec[i] += cvec[pair - 1];
365 pair -= 2;
381 int pair = 0; local
383 cvec[i] = cvec[pair];
384 if (pair + 1 < size)
385 cvec[i] += cvec[pair
[all...]
/gem5/ext/dsent/model/optical_graph/
H A DOpticalNode.h33 typedef std::pair<OpticalNode*, double> DetectorEntry;
/gem5/src/mem/ruby/network/garnet2.0/
H A Dflit.hh62 std::pair<flit_stage, Cycles> get_stage() { return m_stage; }
113 std::pair<flit_stage, Cycles> m_stage;
/gem5/src/cpu/
H A Dpc_event.hh89 typedef std::pair<iterator, iterator> range_t;
90 typedef std::pair<const_iterator, const_iterator> const_range_t;
/gem5/ext/pybind11/tests/
H A Dtest_sequences_and_iterators.cpp28 bool operator==(const NonZeroIterator<std::pair<A, B>>& it, const NonZeroSentinel&) {
261 IntPairs(std::vector<std::pair<int, int>> data) : data_(std::move(data)) {}
262 const std::pair<int, int>* begin() const { return data_.data(); }
264 std::vector<std::pair<int, int>> data_;
267 .def(py::init<std::vector<std::pair<int, int>>>())
269 return py::make_iterator(NonZeroIterator<std::pair<int, int>>(s.begin()), NonZeroSentinel());
272 return py::make_key_iterator(NonZeroIterator<std::pair<int, int>>(s.begin()), NonZeroSentinel());
333 return std::count_if(d.begin(), d.end(), [](std::pair<py::handle, py::handle> p) {
/gem5/src/dev/net/
H A Dtcp_iface.hh89 static std::vector<std::pair<NodeInfo, int> > nodes;

Completed in 27 milliseconds

12345