Lines Matching defs:irhs
5024 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
5026 RecurseInto(irhs);
5052 bool RecurseInto(size_t irhs) {
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 = matches[i].second;
5118 EXPECT_TRUE(graph.HasEdge(ilhs, irhs));
5120 EXPECT_FALSE(seen_matcher[irhs]);
5122 seen_matcher[irhs] = true;