Searched refs:irhs (Results 1 - 3 of 3) sorted by relevance
/gem5/ext/googletest/googlemock/src/ |
H A D | gmock-matchers.cc | 233 size_t irhs = left_[ilhs]; local 234 if (irhs == kUnused) continue; 235 result.push_back(ElementMatcherPair(ilhs, irhs)); 260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { 261 if ((*seen)[irhs]) 263 if (!graph_->HasEdge(ilhs, irhs)) 265 // There's an available edge from ilhs to irhs. 266 (*seen)[irhs] [all...] |
/gem5/ext/googletest/googlemock/include/gmock/ |
H A D | gmock-matchers.h | 3267 bool HasEdge(size_t ilhs, size_t irhs) const { 3268 return matched_[SpaceIndex(ilhs, irhs)] == 1; 3270 void SetEdge(size_t ilhs, size_t irhs, bool b) { argument 3271 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0; 3284 size_t SpaceIndex(size_t ilhs, size_t irhs) const { 3285 return ilhs * num_matchers_ + irhs; 3293 // a (ilhs, irhs) matrix coordinate into an offset. 3419 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) { [all...] |
/gem5/ext/googletest/googlemock/test/ |
H A D | gmock-matchers_test.cc | 5024 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { 5026 RecurseInto(irhs); 5052 bool RecurseInto(size_t irhs) { argument 5053 if (rhs_used_[irhs] != kUnused) { 5060 if (!graph_->HasEdge(ilhs, irhs)) { 5063 PushMatch(ilhs, irhs); 5067 for (size_t mi = irhs + 1; mi < graph_->RhsSize(); ++mi) { 5117 size_t irhs local [all...] |
Completed in 42 milliseconds