219                           LookupInfo(loop, instruction->InputAt(1)), kSub);  in ClassifyTrivial()
287           loop, phi, instruction, instruction->InputAt(0), instruction->InputAt(1), kSub, true);  in ClassifyNonTrivial()
376       } else if (op == kSub) {  // Negation required.  in TransferAddSub()
541   } else if (op == kSub) {  in SolveAddSub()
548         return CreateInduction(kPeriodic, CreateInvariantOp(kSub, a, initial), initial, type_);  in SolveAddSub()
690       trip_count = CreateInvariantOp(kSub, trip_count, CreateConstant(1, type));  in VisitTripCount()
698       kDiv, CreateInvariantOp(kSub, trip_count, lower_expr), stride_expr);  in VisitTripCount()
869       if (op == kAdd || op == kSub) {  in CreateSimplifiedInvariant()
885       return CreateSimplifiedInvariant(kSub, a, b->op_b);  in CreateSimplifiedInvariant()
886     } else if (op == kSub) {  in CreateSimplifiedInvariant()
891   } else if (b->operation == kSub) {  in CreateSimplifiedInvariant()
894       return CreateSimplifiedInvariant(kSub, b->op_b, b->op_a);  in CreateSimplifiedInvariant()
936         case kSub:  in InductionToString()