Searched refs:GetLeft (Results 1 – 8 of 8) sorted by relevance
/art/compiler/optimizing/ |
D | constant_folding.cc | 136 HInstruction* left = instruction->GetLeft(); in VisitShift() 148 if ((instruction->GetLeft()->IsNullConstant() && !instruction->GetRight()->CanBeNull()) || in VisitEqual() 149 (instruction->GetRight()->IsNullConstant() && !instruction->GetLeft()->CanBeNull())) { in VisitEqual() 160 if ((instruction->GetLeft()->IsNullConstant() && !instruction->GetRight()->CanBeNull()) || in VisitNotEqual() 161 (instruction->GetRight()->IsNullConstant() && !instruction->GetLeft()->CanBeNull())) { in VisitNotEqual() 172 if (instruction->GetLeft()->IsConstant() && in VisitAbove() 173 instruction->GetLeft()->AsConstant()->IsArithmeticZero()) { in VisitAbove() 208 if (instruction->GetLeft()->IsConstant() && in VisitBelowOrEqual() 209 instruction->GetLeft()->AsConstant()->IsArithmeticZero()) { in VisitBelowOrEqual() 231 HInstruction* left = instruction->GetLeft(); in VisitAnd() [all …]
|
D | instruction_simplifier_shared.cc | 60 input_b = input_binop->GetLeft(); in TrySimpleMultiplyAccumulatePatterns() 62 } else if (input_binop->GetLeft()->IsConstant() && in TrySimpleMultiplyAccumulatePatterns() 63 input_binop->GetLeft()->AsConstant()->IsOne()) { in TrySimpleMultiplyAccumulatePatterns() 126 HInstruction* binop_left = binop->GetLeft(); in TryCombineMultiplyAccumulate() 143 mul->GetLeft(), in TryCombineMultiplyAccumulate() 156 mul->GetLeft(), in TryCombineMultiplyAccumulate() 171 if (mul->GetLeft() == mul->GetRight()) { in TryCombineMultiplyAccumulate() 175 HInstruction* left = mul->GetLeft(); in TryCombineMultiplyAccumulate() 191 HInstruction* left = op->GetLeft(); in TryMergeNegatedInput()
|
D | instruction_simplifier_x86_shared.cc | 31 HInstruction* left = instruction->GetLeft(); in TryCombineAndNot() 69 HInstruction* left = instruction->GetLeft(); in TryGenerateResetLeastSetBit() 100 HInstruction* left = instruction->GetLeft(); in TryGenerateMaskUptoLeastSetBit()
|
D | scheduler_arm.cc | 207 DCHECK_EQ(condition->GetLeft()->GetType(), DataType::Type::kInt64); in HandleGenerateLongTestConstant() 273 DCHECK_EQ(condition->GetLeft()->GetType(), DataType::Type::kInt64); in HandleGenerateLongTest() 304 const DataType::Type type = condition->GetLeft()->GetType(); in HandleGenerateTest() 320 if (condition->GetLeft()->GetType() == DataType::Type::kInt64) { in CanGenerateTest() 358 DCHECK_EQ(cond->GetLeft()->GetType(), DataType::Type::kInt64); in HandleGenerateEqualLong() 379 DCHECK_EQ(cond->GetLeft()->GetType(), DataType::Type::kInt64); in HandleGenerateConditionLong() 429 const DataType::Type type = cond->GetLeft()->GetType(); in HandleGenerateConditionIntegralOrNonPrimitive() 487 const DataType::Type type = cond->GetLeft()->GetType(); in HandleCondition()
|
D | instruction_simplifier.cc | 182 DCHECK(binop->GetLeft()->IsNeg() && binop->GetRight()->IsNeg()); in TryMoveNegOnInputsAfterBinop() 183 HNeg* left_neg = binop->GetLeft()->AsNeg(); in TryMoveNegOnInputsAfterBinop() 216 HInstruction* left = op->GetLeft(); in TryDeMorganNegationFactoring() 301 HInstruction* binop_left = binop->GetLeft(); in TryCombineVecMultiplyAccumulate() 319 mul->GetLeft(), in TryCombineVecMultiplyAccumulate() 339 HInstruction* value = instruction->GetLeft(); in VisitShift() 408 sub->GetLeft()->IsConstant() && in IsSubRegBitsMinusOther() 409 (Int64FromConstant(sub->GetLeft()->AsConstant()) & (reg_bits - 1)) == 0); in IsSubRegBitsMinusOther() 417 new (GetGraph()->GetAllocator()) HRor(ushr->GetType(), ushr->GetLeft(), ushr->GetRight()); in ReplaceRotateWithRor() 438 HInstruction* left = op->GetLeft(); in TryReplaceWithRotate() [all …]
|
D | nodes.cc | 1659 if (GetLeft()->IsIntConstant() && GetRight()->IsIntConstant()) { in TryStaticEvaluation() 1660 return Evaluate(GetLeft()->AsIntConstant(), GetRight()->AsIntConstant()); in TryStaticEvaluation() 1661 } else if (GetLeft()->IsLongConstant()) { in TryStaticEvaluation() 1665 return Evaluate(GetLeft()->AsLongConstant(), GetRight()->AsIntConstant()); in TryStaticEvaluation() 1667 return Evaluate(GetLeft()->AsLongConstant(), GetRight()->AsLongConstant()); in TryStaticEvaluation() 1669 } else if (GetLeft()->IsNullConstant() && GetRight()->IsNullConstant()) { in TryStaticEvaluation() 1672 return Evaluate(GetLeft()->AsNullConstant(), GetRight()->AsNullConstant()); in TryStaticEvaluation() 1674 if (GetLeft()->IsFloatConstant() && GetRight()->IsFloatConstant()) { in TryStaticEvaluation() 1675 return Evaluate(GetLeft()->AsFloatConstant(), GetRight()->AsFloatConstant()); in TryStaticEvaluation() 1676 } else if (GetLeft()->IsDoubleConstant() && GetRight()->IsDoubleConstant()) { in TryStaticEvaluation() [all …]
|
D | bounds_check_elimination.cc | 75 HInstruction* left = bin_op->GetLeft(); in IsAddOrSubAConstant() 1000 HandleIf(instruction, cond->GetLeft(), cond->GetRight(), cond->GetCondition()); in VisitIf() 1007 ValueRange* left_range = LookupValueRange(add->GetLeft(), add->GetBlock()); in VisitAdd() 1019 HInstruction* left = sub->GetLeft(); in VisitSub() 1094 HInstruction* left = instruction->GetLeft(); in FindAndHandlePartialArrayLength() 1148 HInstruction* left = instruction->GetLeft(); in VisitRem()
|
D | nodes_vector.h | 245 HInstruction* GetLeft() const { return InputAt(0); } in GetLeft() function
|