216   HInstruction* right = op->GetRight();  in TryDeMorganNegationFactoring()  local
220   if (((left->IsNot() && right->IsNot()) ||  in TryDeMorganNegationFactoring()
221        (left->IsBooleanNot() && right->IsBooleanNot())) &&  in TryDeMorganNegationFactoring()
223       right->HasOnlyOneNonEnvironmentUse()) {  in TryDeMorganNegationFactoring()
232     HInstruction* src_right = right->InputAt(0);  in TryDeMorganNegationFactoring()
237     right->ReplaceWith(src_right);  in TryDeMorganNegationFactoring()
239     right->GetBlock()->RemoveInstruction(right);  in TryDeMorganNegationFactoring()
449   HInstruction* right = op->GetRight();  in TryReplaceWithRotate()  local
451   if ((left->IsUShr() && right->IsShl()) || (left->IsShl() && right->IsUShr())) {  in TryReplaceWithRotate()
452     HUShr* ushr = left->IsUShr() ? left->AsUShr() : right->AsUShr();  in TryReplaceWithRotate()
453     HShl* shl = left->IsShl() ? left->AsShl() : right->AsShl();  in TryReplaceWithRotate()
1296   HInstruction* right = instruction->GetRight();  in VisitAdd()  local
1298   bool right_is_neg = right->IsNeg();  in VisitAdd()
1306   HNeg* neg = left_is_neg ? left->AsNeg() : right->AsNeg();  in VisitAdd()
1317     HInstruction* other = left_is_neg ? right : left;  in VisitAdd()
1334   if ((left->IsSub() || right->IsSub()) &&  in VisitAdd()
1347     if (left->IsSub() && left->InputAt(1) == right) {  in VisitAdd()
1352     } else if (right->IsSub() && right->InputAt(1) == left) {  in VisitAdd()
1353       instruction->ReplaceWith(right->InputAt(0));  in VisitAdd()
1598   HInstruction* right = condition->GetRight();  in VisitCondition()  local
1605   if (!left->IsCompare() || !right->IsConstant() || right->AsIntConstant()->GetValue() != 0) {  in VisitCondition()
1961   HInstruction* right = instruction->GetRight();  in VisitSub()  local
1971       HNeg* neg = new (allocator) HNeg(type, right);  in VisitSub()
1978   if (left->IsNeg() && right->IsNeg()) {  in VisitSub()
1984   if (right->IsNeg() && right->HasOnlyOneNonEnvironmentUse()) {  in VisitSub()
1990     HAdd* add = new(GetGraph()->GetAllocator()) HAdd(type, left, right->AsNeg()->GetInput());  in VisitSub()
1993     right->GetBlock()->RemoveInstruction(right);  in VisitSub()
2006     HAdd* add = new(GetGraph()->GetAllocator()) HAdd(type, left->AsNeg()->GetInput(), right);  in VisitSub()
2031     if (left->InputAt(1) == right) {  in VisitSub()
2036     } else if (left->InputAt(0) == right) {  in VisitSub()
2088   HInstruction* right = instruction->GetRight();  in VisitXor()  local
2089   if (((left->IsNot() && right->IsNot()) ||  in VisitXor()
2090        (left->IsBooleanNot() && right->IsBooleanNot())) &&  in VisitXor()
2092       right->HasOnlyOneNonEnvironmentUse()) {  in VisitXor()
2100     instruction->ReplaceInput(right->InputAt(0), 1);  in VisitXor()
2102     right->GetBlock()->RemoveInstruction(right);  in VisitXor()
2291   HInstruction* right;  in SimplifyCompare()  local
2293     right = invoke->InputAt(1);  in SimplifyCompare()
2295     right = GetGraph()->GetLongConstant(0);  in SimplifyCompare()
2297     right = GetGraph()->GetIntConstant(0);  in SimplifyCompare()
2300       HCompare(type, left, right, ComparisonBias::kNoBias, dex_pc);  in SimplifyCompare()
2674   HInstruction* right = instruction->GetRight();  in TryHandleAssociativeAndCommutativeOperation()  local
2679   if (instruction->GetKind() == left->GetKind() && right->IsConstant()) {  in TryHandleAssociativeAndCommutativeOperation()
2680     const2 = right->AsConstant();  in TryHandleAssociativeAndCommutativeOperation()
2682   } else if (left->IsConstant() && instruction->GetKind() == right->GetKind()) {  in TryHandleAssociativeAndCommutativeOperation()
2684     y = right->AsBinaryOperation();  in TryHandleAssociativeAndCommutativeOperation()
2752   HInstruction* right = instruction->GetRight();  in TrySubtractionChainSimplification()  local
2754   HConstant* const2 = right->IsConstant() ? right->AsConstant() : left->AsConstant();  in TrySubtractionChainSimplification()
2761       : AsAddOrSub(right);  in TrySubtractionChainSimplification()
2781   bool is_const2_negated = (const2 == right) && instruction->IsSub();  in TrySubtractionChainSimplification()
2783   bool is_y_negated = (y == right) && instruction->IsSub();  in TrySubtractionChainSimplification()
2784   right = y->GetRight();  in TrySubtractionChainSimplification()
2785   bool is_const1_negated = is_y_negated ^ ((const1 == right) && y->IsSub());  in TrySubtractionChainSimplification()
2787   bool is_x_negated = is_y_negated ^ ((x == right) && y->IsSub());  in TrySubtractionChainSimplification()