Lines Matching defs:irhs
417 for (size_t irhs = 0; irhs < graph_->RhsSize(); ++irhs) {
419 RecurseInto(irhs);
444 bool RecurseInto(size_t irhs) {
445 if (rhs_used_[irhs] != kUnused) {
452 if (!graph_->HasEdge(ilhs, irhs)) {
455 PushMatch(ilhs, irhs);
459 for (size_t mi = irhs + 1; mi < graph_->RhsSize(); ++mi) {
507 size_t irhs = matches[i].second;
508 EXPECT_TRUE(graph.HasEdge(ilhs, irhs));
510 EXPECT_FALSE(seen_matcher[irhs]);
512 seen_matcher[irhs] = true;