/gem5/ext/googletest/googletest/samples/ |
H A D | sample3_unittest.cc | 105 for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head(); 106 n1 != NULL; n1 = n1->next(), n2 = n2->next() ) { 107 EXPECT_EQ(2 * n1->element(), n2->element());
|
/gem5/src/mem/ruby/profiler/ |
H A D | StoreTrace.hh | 77 node_less_then_eq(const StoreTrace* n1, const StoreTrace* n2) argument 79 return n1->getTotal() > n2->getTotal();
|
H A D | AccessTraceForAddress.hh | 63 const AccessTraceForAddress* n2) 65 return n1->getTotal() <= n2->getTotal(); 62 less_equal(const AccessTraceForAddress* n1, const AccessTraceForAddress* n2) argument
|
/gem5/src/mem/ruby/network/garnet2.0/ |
H A D | flit.hh | 90 greater(flit* n1, flit* n2) argument 92 if (n1->get_time() == n2->get_time()) { 93 //assert(n1->flit_id != n2->flit_id); 94 return (n1->get_id() > n2->get_id()); 96 return (n1->get_time() > n2->get_time());
|
/gem5/util/ |
H A D | rundiff | 137 # n2 lines of file2 (where either n1 or n2 could be zero). 140 my ($n1, $n2)= @_; 162 printlines(\@lines2, $n2, '+'); 164 $lineno2 += $n2; 231 my ($n1, $n2) = @_; 237 if ($lines1[$n1] eq $lines2[$n2] && $lines1[$n1+1] eq $lines2[$n2+1]) { 238 printdiff($n1, $n2);
|
/gem5/src/sim/power/ |
H A D | thermal_model.hh | 70 void setNodes(ThermalNode * n1, ThermalNode * n2) { argument 72 node2 = n2; 102 void setNodes(ThermalNode * n1, ThermalNode * n2) { argument 104 node2 = n2;
|
/gem5/src/mem/ruby/system/ |
H A D | CacheRecorder.hh | 116 compareTraceRecords(const TraceRecord* n1, const TraceRecord* n2) argument 118 return n1->m_time > n2->m_time;
|
/gem5/ext/pybind11/docs/ |
H A D | benchmark.py | 84 n2 = dt.datetime.now() variable 85 elapsed = (n2 - n1).total_seconds()
|
/gem5/src/python/m5/util/ |
H A D | __init__.py | 135 for n1,n2 in zip(v1, v2): 136 if n1 < n2: return -1 137 if n1 > n2: return 1
|
/gem5/src/mem/ruby/common/ |
H A D | Histogram.hh | 76 bool node_less_then_eq(const Histogram* n1, const Histogram* n2);
|
H A D | Histogram.cc | 234 node_less_then_eq(const Histogram* n1, const Histogram* n2) 236 return (n1->size() > n2->size());
|
/gem5/ext/googletest/googletest/test/ |
H A D | gtest_output_test_.cc | 264 // SCOPED_TRACE("Trace A"); | waits for n2 266 // notifies n2 | 281 Notification n2; member in struct:CheckPoints 291 check_points->n2.WaitForNotification(); 314 check_points.n2.Notify();
|
H A D | gtest_unittest.cc | 2160 bool SumIsEven2(int n1, int n2) { argument 2161 return IsEven(n1 + n2); 2167 bool operator()(int n1, int n2, int n3) { argument 2168 return IsEven(n1 + n2 + n3); 2176 int n1, int n2, int n3, int n4) { 2177 const int sum = n1 + n2 + n3 + n4; 2184 << " (" << n1 << " + " << n2 << " + " << n3 << " + " << n4 2194 const char* e5, int n1, int n2, int n3, int n4, int n5) { 2195 const int sum = n1 + n2 + n3 + n4 + n5; 2203 << n1 << " + " << n2 << " 2174 AssertSumIsEven4( const char* e1, const char* e2, const char* e3, const char* e4, int n1, int n2, int n3, int n4) argument 2192 operator ()( const char* e1, const char* e2, const char* e3, const char* e4, const char* e5, int n1, int n2, int n3, int n4, int n5) argument 2269 const int n2 = 2; local 2287 const int n2 = 2; local 2304 int n2 = 0; local 2315 n1++, n2++, n3++, n4++, n5++) local [all...] |
/gem5/src/systemc/ext/dt/bit/ |
H A D | sc_bit_proxies.hh | 2241 int n2 = 0; local 2246 n2 = sc_max(n1 - SC_DIGIT_SIZE, m_hi - 1); 2247 for (int n = n1; n > n2; n--) { 2252 n2 = sc_min(n1 + SC_DIGIT_SIZE, m_hi + 1); 2253 for (int n = n1; n < n2; n++) { 2265 int n2 = 0; local 2269 n2 = sc_max(n1 - SC_DIGIT_SIZE, m_hi - 1); 2270 for (int n = n1; n > n2; n--) { 2277 n2 = sc_min(n1 + SC_DIGIT_SIZE, m_hi + 1); 2278 for (int n = n1; n < n2; 2292 int n2 = 0; local 2316 int n2 = 0; local [all...] |
/gem5/ext/systemc/src/sysc/datatypes/bit/ |
H A D | sc_bit_proxies.h | 2530 int n2 = 0; local 2535 n2 = sc_max( n1 - SC_DIGIT_SIZE, m_hi - 1 ); 2536 for( int n = n1; n > n2; n -- ) { 2541 n2 = sc_min( n1 + SC_DIGIT_SIZE, m_hi + 1 ); 2542 for( int n = n1; n < n2; n ++ ) { 2555 int n2 = 0; local 2559 n2 = sc_max( n1 - SC_DIGIT_SIZE, m_hi - 1 ); 2560 for( int n = n1; n > n2; n -- ) { 2567 n2 = sc_min( n1 + SC_DIGIT_SIZE, m_hi + 1 ); 2568 for( int n = n1; n < n2; 2583 int n2 = 0; local 2608 int n2 = 0; local [all...] |
/gem5/ext/googletest/googlemock/test/ |
H A D | gmock-matchers_test.cc | 3953 const int n2 = 1; local 3956 EXPECT_FALSE(matcher2.Matches(n2)); 3960 EXPECT_FALSE(matcher3.Matches(n2)); 4059 const NotCopyable n1(1), n2(2); 4061 EXPECT_FALSE(m.Matches(n2)); 4068 NotCopyable n1(1), n2(2); 4070 EXPECT_TRUE(m.Matches(n2));
|