Home
last modified time | relevance | path

Searched refs:ilhs (Results 1 – 2 of 2) sorted by relevance

/llvm-project-15.0.7/llvm/utils/unittest/googlemock/src/
H A Dgmock-matchers.cc145 for (size_t ilhs = 0; ilhs < graph_->LhsSize(); ++ilhs) { in Compute() local
149 << "ilhs: " << ilhs << ", left_[ilhs]: " << left_[ilhs]; in Compute()
152 TryAugment(ilhs, &seen); in Compute()
155 for (size_t ilhs = 0; ilhs < left_.size(); ++ilhs) { in Compute() local
156 size_t irhs = left_[ilhs]; in Compute()
200 left_[ilhs] = irhs; in TryAugment()
201 right_[irhs] = ilhs; in TryAugment()
248 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) { in NextGraph() local
262 for (size_t ilhs = 0; ilhs < LhsSize(); ++ilhs) { in Randomize() local
377 for (size_t ilhs = 0; ilhs < matrix.LhsSize(); ilhs++) { in VerifyMatchMatrix() local
[all …]
/llvm-project-15.0.7/llvm/utils/unittest/googlemock/include/gmock/
H A Dgmock-matchers.h2869 bool HasEdge(size_t ilhs, size_t irhs) const {
2870 return matched_[SpaceIndex(ilhs, irhs)] == 1;
2872 void SetEdge(size_t ilhs, size_t irhs, bool b) {
2873 matched_[SpaceIndex(ilhs, irhs)] = b ? 1 : 0;
2886 size_t SpaceIndex(size_t ilhs, size_t irhs) const {
2887 return ilhs * num_matchers_ + irhs;
3043 for (size_t ilhs = 0; ilhs != num_elements; ++ilhs) {
3045 matrix.SetEdge(ilhs, irhs, *did_match_iter++ != 0);