Lines Matching refs:right
225 HInstruction* right = op->GetRight(); in TryDeMorganNegationFactoring() local
229 if (((left->IsNot() && right->IsNot()) || in TryDeMorganNegationFactoring()
230 (left->IsBooleanNot() && right->IsBooleanNot())) && in TryDeMorganNegationFactoring()
232 right->HasOnlyOneNonEnvironmentUse()) { in TryDeMorganNegationFactoring()
241 HInstruction* src_right = right->InputAt(0); in TryDeMorganNegationFactoring()
246 right->ReplaceWith(src_right); in TryDeMorganNegationFactoring()
248 right->GetBlock()->RemoveInstruction(right); in TryDeMorganNegationFactoring()
463 HInstruction* right = op->GetRight(); in TryReplaceWithRotate() local
465 if ((left->IsUShr() && right->IsShl()) || (left->IsShl() && right->IsUShr())) { in TryReplaceWithRotate()
466 HUShr* ushr = left->IsUShr() ? left->AsUShr() : right->AsUShr(); in TryReplaceWithRotate()
467 HShl* shl = left->IsShl() ? left->AsShl() : right->AsShl(); in TryReplaceWithRotate()
1384 HInstruction* right = instruction->GetRight(); in VisitAdd() local
1386 bool right_is_neg = right->IsNeg(); in VisitAdd()
1394 HNeg* neg = left_is_neg ? left->AsNeg() : right->AsNeg(); in VisitAdd()
1405 HInstruction* other = left_is_neg ? right : left; in VisitAdd()
1422 if ((left->IsSub() || right->IsSub()) && in VisitAdd()
1435 if (left->IsSub() && left->InputAt(1) == right) { in VisitAdd()
1440 } else if (right->IsSub() && right->InputAt(1) == left) { in VisitAdd()
1441 instruction->ReplaceWith(right->InputAt(0)); in VisitAdd()
1686 HInstruction* right = condition->GetRight(); in VisitCondition() local
1693 if (!left->IsCompare() || !right->IsConstant() || right->AsIntConstant()->GetValue() != 0) { in VisitCondition()
2114 HInstruction* right = instruction->GetRight(); in VisitSub() local
2124 HNeg* neg = new (allocator) HNeg(type, right); in VisitSub()
2131 if (left->IsNeg() && right->IsNeg()) { in VisitSub()
2137 if (right->IsNeg() && right->HasOnlyOneNonEnvironmentUse()) { in VisitSub()
2143 HAdd* add = new(GetGraph()->GetAllocator()) HAdd(type, left, right->AsNeg()->GetInput()); in VisitSub()
2146 right->GetBlock()->RemoveInstruction(right); in VisitSub()
2159 HAdd* add = new(GetGraph()->GetAllocator()) HAdd(type, left->AsNeg()->GetInput(), right); in VisitSub()
2184 if (left->InputAt(1) == right) { in VisitSub()
2189 } else if (left->InputAt(0) == right) { in VisitSub()
2241 HInstruction* right = instruction->GetRight(); in VisitXor() local
2242 if (((left->IsNot() && right->IsNot()) || in VisitXor()
2243 (left->IsBooleanNot() && right->IsBooleanNot())) && in VisitXor()
2245 right->HasOnlyOneNonEnvironmentUse()) { in VisitXor()
2253 instruction->ReplaceInput(right->InputAt(0), 1); in VisitXor()
2255 right->GetBlock()->RemoveInstruction(right); in VisitXor()
2881 HInstruction* right = instruction->GetRight(); in TryHandleAssociativeAndCommutativeOperation() local
2886 if (instruction->GetKind() == left->GetKind() && right->IsConstant()) { in TryHandleAssociativeAndCommutativeOperation()
2887 const2 = right->AsConstant(); in TryHandleAssociativeAndCommutativeOperation()
2889 } else if (left->IsConstant() && instruction->GetKind() == right->GetKind()) { in TryHandleAssociativeAndCommutativeOperation()
2891 y = right->AsBinaryOperation(); in TryHandleAssociativeAndCommutativeOperation()
2959 HInstruction* right = instruction->GetRight(); in TrySubtractionChainSimplification() local
2961 HConstant* const2 = right->IsConstant() ? right->AsConstant() : left->AsConstant(); in TrySubtractionChainSimplification()
2968 : AsAddOrSub(right); in TrySubtractionChainSimplification()
2988 bool is_const2_negated = (const2 == right) && instruction->IsSub(); in TrySubtractionChainSimplification()
2990 bool is_y_negated = (y == right) && instruction->IsSub(); in TrySubtractionChainSimplification()
2991 right = y->GetRight(); in TrySubtractionChainSimplification()
2992 bool is_const1_negated = is_y_negated ^ ((const1 == right) && y->IsSub()); in TrySubtractionChainSimplification()
2994 bool is_x_negated = is_y_negated ^ ((x == right) && y->IsSub()); in TrySubtractionChainSimplification()