/art/test/550-checker-multiply-accumulate/src/ |
D | Main.java | 82 public static int $opt$noinline$mulAdd(int acc, int left, int right) { in $opt$noinline$mulAdd() argument 84 return acc + left * right; in $opt$noinline$mulAdd() 124 public static long $opt$noinline$mulSub(long acc, long left, long right) { in $opt$noinline$mulSub() argument 126 return acc - left * right; in $opt$noinline$mulSub() 176 public static int $opt$noinline$multipleUses1(int acc, int left, int right) { in $opt$noinline$multipleUses1() argument 178 int temp = left * right; in $opt$noinline$multipleUses1() 234 public static long $opt$noinline$multipleUses2(long acc, long left, long right) { in $opt$noinline$multipleUses2() argument 236 long temp = left * right; in $opt$noinline$multipleUses2() 375 public static int $opt$noinline$mulNeg(int left, int right) { in $opt$noinline$mulNeg() argument 377 return - (left * right); in $opt$noinline$mulNeg() [all …]
|
/art/compiler/optimizing/ |
D | nodes_vector.h | 145 HInstruction* left, in HVecBinaryOperation() argument 156 SetRawInputAt(0, left); in HVecBinaryOperation() 338 HInstruction* left, 343 : HVecBinaryOperation(arena, left, right, packed_type, vector_length, dex_pc) { in HVecBinaryOperation() argument 344 DCHECK(HasConsistentPackedTypes(left, packed_type)); in HVecBinaryOperation() 359 HInstruction* left, 366 : HVecBinaryOperation(arena, left, right, packed_type, vector_length, dex_pc) { in HVecBinaryOperation() argument 367 DCHECK(HasConsistentPackedTypes(left, packed_type)); in HVecBinaryOperation() 393 HInstruction* left, 398 : HVecBinaryOperation(arena, left, right, packed_type, vector_length, dex_pc) { in HVecBinaryOperation() argument [all …]
|
D | dead_code_elimination.cc | 120 static HConstant* Evaluate(HCondition* condition, HInstruction* left, HInstruction* right) { in Evaluate() argument 121 if (left == right && !Primitive::IsFloatingPointType(left->GetType())) { in Evaluate() 126 if (!left->IsConstant() || !right->IsConstant()) { in Evaluate() 130 if (left->IsIntConstant()) { in Evaluate() 131 return condition->Evaluate(left->AsIntConstant(), right->AsIntConstant()); in Evaluate() 132 } else if (left->IsNullConstant()) { in Evaluate() 133 return condition->Evaluate(left->AsNullConstant(), right->AsNullConstant()); in Evaluate() 134 } else if (left->IsLongConstant()) { in Evaluate() 135 return condition->Evaluate(left->AsLongConstant(), right->AsLongConstant()); in Evaluate() 136 } else if (left->IsFloatConstant()) { in Evaluate() [all …]
|
D | instruction_simplifier_shared.cc | 173 HInstruction* left = mul->GetLeft(); in TryCombineMultiplyAccumulate() local 176 TrySimpleMultiplyAccumulatePatterns(mul, right->AsBinaryOperation(), left)) { in TryCombineMultiplyAccumulate() 179 if ((left->IsAdd() || left->IsSub()) && in TryCombineMultiplyAccumulate() 180 TrySimpleMultiplyAccumulatePatterns(mul, left->AsBinaryOperation(), right)) { in TryCombineMultiplyAccumulate() 189 HInstruction* left = op->GetLeft(); in TryMergeNegatedInput() local 194 if (left->IsNot() ^ right->IsNot()) { in TryMergeNegatedInput() 195 HInstruction* hnot = (left->IsNot() ? left : right); in TryMergeNegatedInput() 196 HInstruction* hother = (left->IsNot() ? right : left); in TryMergeNegatedInput()
|
D | instruction_simplifier.cc | 199 HInstruction* left = op->GetLeft(); in TryDeMorganNegationFactoring() local 204 if (((left->IsNot() && right->IsNot()) || in TryDeMorganNegationFactoring() 205 (left->IsBooleanNot() && right->IsBooleanNot())) && in TryDeMorganNegationFactoring() 206 left->HasOnlyOneNonEnvironmentUse() && in TryDeMorganNegationFactoring() 215 HInstruction* src_left = left->InputAt(0); in TryDeMorganNegationFactoring() 220 left->ReplaceWith(src_left); in TryDeMorganNegationFactoring() 222 left->GetBlock()->RemoveInstruction(left); in TryDeMorganNegationFactoring() 233 if (left->IsBooleanNot()) { in TryDeMorganNegationFactoring() 320 HInstruction* left = op->GetLeft(); in TryReplaceWithRotate() local 323 if ((left->IsUShr() && right->IsShl()) || (left->IsShl() && right->IsUShr())) { in TryReplaceWithRotate() [all …]
|
D | instruction_simplifier_arm64.cc | 46 HInstruction* left; in TryMergeIntoShifterOperand() local 49 left = use->InputAt(0); in TryMergeIntoShifterOperand() 54 left = GetGraph()->GetConstant(right->GetType(), 0); in TryMergeIntoShifterOperand() 56 DCHECK(left == bitfield_op || right == bitfield_op); in TryMergeIntoShifterOperand() 58 if (left == right) { in TryMergeIntoShifterOperand() 68 other_input = left; in TryMergeIntoShifterOperand()
|
D | bounds_check_elimination.cc | 51 static bool WouldAddOverflowOrUnderflow(int32_t left, int32_t right) { in WouldAddOverflowOrUnderflow() argument 55 if ((right > 0) && (left <= (std::numeric_limits<int32_t>::max() - right))) { in WouldAddOverflowOrUnderflow() 59 if ((right < 0) && (left >= (std::numeric_limits<int32_t>::min() - right))) { in WouldAddOverflowOrUnderflow() 74 HInstruction* left = bin_op->GetLeft(); in IsAddOrSubAConstant() local 80 instruction = left; in IsAddOrSubAConstant() 81 left_so_far = left; in IsAddOrSubAConstant() 99 HInstruction *left; in AsValueBound() local 101 if (IsAddOrSubAConstant(instruction, &left, &right)) { in AsValueBound() 102 return ValueBound(left, right); in AsValueBound() 121 HInstruction *left; in DetectValueBoundFromValue() local [all …]
|
D | instruction_simplifier_arm.cc | 47 HInstruction* left = use->InputAt(0); in TryMergeIntoShifterOperand() local 49 DCHECK(left == bitfield_op || right == bitfield_op); in TryMergeIntoShifterOperand() 51 if (left == right) { in TryMergeIntoShifterOperand() 61 other_input = left; in TryMergeIntoShifterOperand()
|
D | nodes_shared.h | 65 HInstruction* left, 68 : HBinaryOperation(result_type, left, right, SideEffects::None(), dex_pc), in HBinaryOperation() argument 173 HInstruction* left, 186 SetRawInputAt(0, left);
|
D | constant_folding.cc | 135 HInstruction* left = instruction->GetLeft(); in VisitShift() local 136 if (left->IsConstant() && left->AsConstant()->IsArithmeticZero()) { in VisitShift() 141 instruction->ReplaceWith(left); in VisitShift()
|
D | ssa_builder.cc | 36 HInstruction* left = equality_instr->InputAt(0); in FixNullConstantType() local 40 if ((left->GetType() == Primitive::kPrimNot) && (right->GetType() == Primitive::kPrimInt)) { in FixNullConstantType() 43 && (left->GetType() == Primitive::kPrimInt)) { in FixNullConstantType() 44 int_operand = left; in FixNullConstantType()
|
D | code_generator_vector_arm64.cc | 713 VRegister left = VRegisterFrom(locations->InAt(HVecMultiplyAccumulate::kInputMulLeftIndex)); in VisitVecMultiplyAccumulate() local 719 __ Mla(acc.V16B(), left.V16B(), right.V16B()); in VisitVecMultiplyAccumulate() 721 __ Mls(acc.V16B(), left.V16B(), right.V16B()); in VisitVecMultiplyAccumulate() 728 __ Mla(acc.V8H(), left.V8H(), right.V8H()); in VisitVecMultiplyAccumulate() 730 __ Mls(acc.V8H(), left.V8H(), right.V8H()); in VisitVecMultiplyAccumulate() 736 __ Mla(acc.V4S(), left.V4S(), right.V4S()); in VisitVecMultiplyAccumulate() 738 __ Mls(acc.V4S(), left.V4S(), right.V4S()); in VisitVecMultiplyAccumulate()
|
D | nodes.h | 3215 HInstruction* left, 3220 SetRawInputAt(0, left); in HExpression() 3233 HInstruction* left = InputAt(0); in OrderInputsWithConstantOnTheRight() local 3235 if (left->IsConstant() && !right->IsConstant()) { in OrderInputsWithConstantOnTheRight() 3237 ReplaceInput(left, 1); in OrderInputsWithConstantOnTheRight() 3247 HInstruction* left = InputAt(0); in OrderInputs() local 3249 if (left == right || (!left->IsConstant() && right->IsConstant())) { in OrderInputs() 3256 if (left->GetId() > right->GetId()) { in OrderInputs() 3258 ReplaceInput(left, 1); in OrderInputs() 4524 HInstruction* left, [all …]
|
D | code_generator_arm.cc | 1624 const Location left = locations->InAt(0); in GenerateLongTestConstant() local 1629 const Register left_high = left.AsRegisterPairHigh<Register>(); in GenerateLongTestConstant() 1630 const Register left_low = left.AsRegisterPairLow<Register>(); in GenerateLongTestConstant() 1695 Location left = locations->InAt(0); in GenerateLongTest() local 1707 __ cmp(left.AsRegisterPairHigh<Register>(), in GenerateLongTest() 1710 __ cmp(left.AsRegisterPairLow<Register>(), in GenerateLongTest() 1728 std::swap(left, right); in GenerateLongTest() 1732 __ cmp(left.AsRegisterPairLow<Register>(), in GenerateLongTest() 1735 left.AsRegisterPairHigh<Register>(), in GenerateLongTest() 1773 const Register left = locations->InAt(0).AsRegister<Register>(); in GenerateTest() local [all …]
|
/art/tools/ahat/test-dump/ |
D | Main.java | 34 public ObjectTree left; field in Main.ObjectTree 37 public ObjectTree(ObjectTree left, ObjectTree right) { in ObjectTree() argument 38 this.left = left; in ObjectTree() 124 gcPathArray[2].right.left = gcPathArray[2].left.right; in DumpedStuff()
|
/art/runtime/gc/space/ |
D | region_space-inl.h | 297 size_t left = 0; in AllocLarge() local 298 while (left + num_regs - 1 < num_regions_) { in AllocLarge() 300 size_t right = left; in AllocLarge() 301 DCHECK_LT(right, left + num_regs) in AllocLarge() 303 while (right < left + num_regs) { in AllocLarge() 313 DCHECK_EQ(left + num_regs, right); in AllocLarge() 314 Region* first_reg = ®ions_[left]; in AllocLarge() 319 for (size_t p = left + 1; p < right; ++p) { in AllocLarge() 333 left = right + 1; in AllocLarge()
|
/art/cmdline/detail/ |
D | cmdline_parser_detail.h | 55 static std::true_type EqualityOperatorTest(const TL& left, const TR& right, 56 … std::remove_reference<decltype(left == right)>* = 0); // NOLINT [whitespace/operators] [3] 59 static std::false_type EqualityOperatorTest(const TL& left, const T& ... args);
|
/art/tools/ahat/src/ |
D | style.css | 34 padding-left: 4px; 39 padding-left: 8px;
|
/art/runtime/verifier/ |
D | reg_type_cache.cc | 344 const RegType& RegTypeCache::FromUnresolvedMerge(const RegType& left, in FromUnresolvedMerge() argument 352 if (left.IsUnresolvedMergedReference()) { in FromUnresolvedMerge() 353 const UnresolvedMergedType& left_merge = *down_cast<const UnresolvedMergedType*>(&left); in FromUnresolvedMerge() 357 left_unresolved_is_array = left.IsArrayTypes(); in FromUnresolvedMerge() 358 } else if (left.IsUnresolvedTypes()) { in FromUnresolvedMerge() 360 types.SetBit(left.GetId()); in FromUnresolvedMerge() 362 left_unresolved_is_array = left.IsArrayTypes(); in FromUnresolvedMerge() 365 left_resolved = &left; in FromUnresolvedMerge() 403 if ((!left_unresolved_is_array && left_resolved != &left) || in FromUnresolvedMerge()
|
D | reg_type_cache.h | 78 const RegType& FromUnresolvedMerge(const RegType& left,
|
/art/runtime/base/ |
D | bit_vector.cc | 308 uint32_t left = storage_size_ - size; in Copy() local 310 if (left > 0) { in Copy() 311 memset(storage_ + size, 0, kWordBytes * left); in Copy()
|
D | bit_utils.h | 416 template <typename T, bool left> 419 int unsigned_right_shift = left ? (-distance & mask) : (distance & mask); in Rot() 420 int signed_left_shift = left ? (distance & mask) : (-distance & mask); in Rot()
|
/art/sigchainlib/ |
D | sigchain.cc | 81 static int sigorset(sigset_t* dest, sigset_t* left, sigset_t* right) { in sigorset() argument 84 if (sigismember(left, i) == 1 || sigismember(right, i) == 1) { in sigorset()
|
/art/tools/ahat/test/ |
D | InstanceTest.java | 243 AhatInstance left = base.getRefField("left"); in gcRootPath() local 245 AhatInstance target = left.getRefField("right"); in gcRootPath() 269 assertEquals(left, path.get(4).instance); in gcRootPath()
|
/art/test/531-regression-debugphi/smali/ |
D | TestCase.smali | 26 # - left with two PrimNot equivalents of PhiA
|