365                           LookupInfo(loop, instruction->InputAt(1)), kSub);  in ClassifyTrivial()
449           loop, phi, instruction, instruction->InputAt(0), instruction->InputAt(1), kSub, true);  in ClassifyNonTrivial()
587       } else if (op == kSub) {  // Negation required.  in TransferAddSub()
766   } else if (op == kSub) {  in SolveAddSub()
775                                CreateInvariantOp(kSub, a, initial),  in SolveAddSub()
1018       trip_count = CreateInvariantOp(kSub, trip_count, CreateConstant(1, type));  in VisitTripCount()
1026       kDiv, CreateInvariantOp(kSub, trip_count, lower_expr), stride_expr);  in VisitTripCount()
1263       if (op == kAdd || op == kSub || op == kXor) {  in CreateSimplifiedInvariant()
1279       return CreateSimplifiedInvariant(kSub, a, b->op_b);  in CreateSimplifiedInvariant()
1280     } else if (op == kSub) {  in CreateSimplifiedInvariant()
1285   } else if (b->operation == kSub) {  in CreateSimplifiedInvariant()
1288       return CreateSimplifiedInvariant(kSub, b->op_b, b->op_a);  in CreateSimplifiedInvariant()
1399         case kSub:  in InductionToString()