Searched refs:ilhs (Results 1 - 3 of 3) sorted by relevance

/gem5/ext/googletest/googlemock/src/
H A Dgmock-matchers.cc222 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
224 // source to sink starting at the left_[ilhs] node.
225 GTEST_CHECK_(left_[ilhs] == kUnused)
226 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs];
229 TryAugment(ilhs,
259 TryAugment(size_t ilhs, ::std::vector<char>* seen) argument
[all...]
/gem5/ext/googletest/googlemock/include/gmock/
H A Dgmock-matchers.h3267 bool HasEdge(size_t ilhs, size_t irhs) const { argument
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 { argument
3285 return ilhs * num_matchers_ + irhs;
3293 // a (ilhs, irhs) matrix coordinate into an offset.
3426 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
[all...]
/gem5/ext/googletest/googlemock/test/
H A Dgmock-matchers_test.cc5056 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) {
5057 if (lhs_used_[ilhs] != kUnused) {
5060 if (!graph_->HasEdge(ilhs, irhs)) {
5063 PushMatch(ilhs, irhs);
5116 size_t ilhs = matches[i].first; local
5118 EXPECT_TRUE(graph.HasEdge(ilhs, irhs));
5119 EXPECT_FALSE(seen_element[ilhs]);
5121 seen_element[ilhs]
[all...]

Completed in 44 milliseconds