Home
last modified time | relevance | path

Searched refs:irhs (Results 1 – 6 of 6) sorted by relevance

/external/googletest/googlemock/src/
Dgmock-matchers.cc156 size_t irhs = left_[ilhs]; in Compute() local
157 if (irhs == kUnused) continue; in Compute()
158 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
183 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment() local
184 if ((*seen)[irhs]) continue; in TryAugment()
185 if (!graph_->HasEdge(ilhs, irhs)) continue; in TryAugment()
187 (*seen)[irhs] = 1; in TryAugment()
198 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) { in TryAugment()
200 left_[ilhs] = irhs; in TryAugment()
201 right_[irhs] = ilhs; in TryAugment()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/utils/unittest/googlemock/src/
Dgmock-matchers.cc233 size_t irhs = left_[ilhs]; in Compute() local
234 if (irhs == kUnused) continue; in Compute()
235 result.push_back(ElementMatcherPair(ilhs, irhs)); in Compute()
260 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in TryAugment() local
261 if ((*seen)[irhs]) in TryAugment()
263 if (!graph_->HasEdge(ilhs, irhs)) in TryAugment()
266 (*seen)[irhs] = 1; in TryAugment()
277 if (right_[irhs] == kUnused || TryAugment(right_[irhs], seen)) { in TryAugment()
279 left_[ilhs] = irhs; in TryAugment()
280 right_[irhs] = ilhs; in TryAugment()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/utils/unittest/googlemock/include/gmock/
Dgmock-matchers.h3273 bool HasEdge(size_t ilhs, size_t irhs) const {
3274 return matched_[SpaceIndex(ilhs, irhs)] == 1;
3276 void SetEdge(size_t ilhs, size_t irhs, bool b) {
3277 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
3290 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
3291 return ilhs * num_matchers_ + irhs;
3427 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3428 did_match.push_back(Matches(matchers_[irhs])(*elem_first));
3435 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3436 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
/external/googletest/googlemock/include/gmock/
Dgmock-matchers.h2849 bool HasEdge(size_t ilhs, size_t irhs) const {
2850 return matched_[SpaceIndex(ilhs, irhs)] == 1;
2852 void SetEdge(size_t ilhs, size_t irhs, bool b) {
2853 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
2866 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
2867 return ilhs * num_matchers_ + irhs;
3014 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3015 did_match.push_back(Matches(matchers_[irhs])(*elem_first));
3022 for (size_t irhs = 0; irhs != matchers_.size(); ++irhs) {
3023 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);
/external/googletest/googlemock/test/
Dgmock-matchers_test.cc6006 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) { in Compute() local
6008 RecurseInto(irhs); in Compute()
6034 bool RecurseInto(size_t irhs) { in RecurseInto() argument
6035 if (rhs_used_[irhs] != kUnused) { in RecurseInto()
6042 if (!graph_->HasEdge(ilhs, irhs)) { in RecurseInto()
6045 PushMatch(ilhs, irhs); in RecurseInto()
6049 for (size_t mi = irhs + 1; mi < graph_->RhsSize(); ++mi) { in RecurseInto()
6099 size_t irhs = matches[i].second; in TEST_P() local
6100 EXPECT_TRUE(graph.HasEdge(ilhs, irhs)); in TEST_P()
6102 EXPECT_FALSE(seen_matcher[irhs]); in TEST_P()
[all …]
/external/icu/icu4c/source/i18n/
DdecNumber.cpp4917 Int ilhs, irhs, iacc; /* item counts in the arrays */ in decMultiplyOp() local
4989 irhs=(rhs->digits+FASTDIGS-1)/FASTDIGS; /* .. */ in decMultiplyOp()
4990 iacc=ilhs+irhs; in decMultiplyOp()
4997 needbytes=irhs*sizeof(uInt); in decMultiplyOp()