/art/compiler/optimizing/ |
D | instruction_simplifier_x86_shared.cc | 32 HInstruction* left = instruction->GetLeft(); in TryCombineAndNot() local 37 if (left->IsNot() ^ right->IsNot()) { in TryCombineAndNot() 38 bool left_is_not = left->IsNot(); in TryCombineAndNot() 39 HInstruction* other_ins = (left_is_not ? right : left); in TryCombineAndNot() 40 HNot* not_ins = (left_is_not ? left : right)->AsNot(); in TryCombineAndNot() 70 HInstruction* left = instruction->GetLeft(); in TryGenerateResetLeastSetBit() local 72 if (AreLeastSetBitInputs(left, right)) { in TryGenerateResetLeastSetBit() 73 candidate = left; in TryGenerateResetLeastSetBit() 75 } else if (AreLeastSetBitInputs(right, left)) { in TryGenerateResetLeastSetBit() 77 other = left; in TryGenerateResetLeastSetBit() [all …]
|
D | nodes_vector.h | 297 HInstruction* left, in HVecBinaryOperation() argument 309 SetRawInputAt(0, left); in HVecBinaryOperation() 580 HInstruction* left, in HVecAdd() argument 585 : HVecBinaryOperation(kVecAdd, allocator, left, right, packed_type, vector_length, dex_pc) { in HVecAdd() 586 DCHECK(HasConsistentPackedTypes(left, packed_type)); in HVecAdd() 604 HInstruction* left, in HVecSaturationAdd() argument 610 kVecSaturationAdd, allocator, left, right, packed_type, vector_length, dex_pc) { in HVecSaturationAdd() 611 DCHECK(HasConsistentPackedTypes(left, packed_type)); in HVecSaturationAdd() 630 HInstruction* left, in HVecHalvingAdd() argument 637 kVecHalvingAdd, allocator, left, right, packed_type, vector_length, dex_pc) { in HVecHalvingAdd() [all …]
|
D | constant_folding.cc | 273 HInstruction* left = condition->GetLeft(); in VisitIf() local 277 if (left->IsConstant() == right->IsConstant()) { in VisitIf() 289 HConstant* constant = left->IsConstant() ? left->AsConstant() : right->AsConstant(); in VisitIf() 290 HInstruction* variable = left->IsConstant() ? right : left; in VisitIf() 310 left = variable->AsCompare()->GetLeft(); in VisitIf() 314 if (left->IsConstant() == right->IsConstant()) { in VisitIf() 318 constant = left->IsConstant() ? left->AsConstant() : right->AsConstant(); in VisitIf() 319 variable = left->IsConstant() ? right : left; in VisitIf() 635 HInstruction* left = instruction->GetLeft(); in VisitShift() local 636 if (left->IsConstant() && left->AsConstant()->IsArithmeticZero()) { in VisitShift() [all …]
|
D | instruction_simplifier.cc | 230 HInstruction* left = op->GetLeft(); in TryDeMorganNegationFactoring() local 235 if (((left->IsNot() && right->IsNot()) || in TryDeMorganNegationFactoring() 236 (left->IsBooleanNot() && right->IsBooleanNot())) && in TryDeMorganNegationFactoring() 237 left->HasOnlyOneNonEnvironmentUse() && in TryDeMorganNegationFactoring() 246 HInstruction* src_left = left->InputAt(0); in TryDeMorganNegationFactoring() 251 left->ReplaceWith(src_left); in TryDeMorganNegationFactoring() 253 left->GetBlock()->RemoveInstruction(left); in TryDeMorganNegationFactoring() 264 if (left->IsBooleanNot()) { in TryDeMorganNegationFactoring() 581 HInstruction* left = op->GetLeft(); in TryReplaceWithRotate() local 584 if ((left->IsUShr() && right->IsShl()) || (left->IsShl() && right->IsUShr())) { in TryReplaceWithRotate() [all …]
|
D | bounds_check_elimination.cc | 52 static bool WouldAddOverflowOrUnderflow(int32_t left, int32_t right) { in WouldAddOverflowOrUnderflow() argument 56 if ((right > 0) && (left <= (std::numeric_limits<int32_t>::max() - right))) { in WouldAddOverflowOrUnderflow() 60 if ((right < 0) && (left >= (std::numeric_limits<int32_t>::min() - right))) { in WouldAddOverflowOrUnderflow() 75 HInstruction* left = bin_op->GetLeft(); in IsAddOrSubAConstant() local 81 instruction = left; in IsAddOrSubAConstant() 82 left_so_far = left; in IsAddOrSubAConstant() 100 HInstruction *left; in AsValueBound() local 102 if (IsAddOrSubAConstant(instruction, &left, &right)) { in AsValueBound() 103 return ValueBound(left, right); in AsValueBound() 122 HInstruction *left; in DetectValueBoundFromValue() local [all …]
|
D | instruction_simplifier_riscv64.cc | 82 auto* const left = add->GetLeft(); in VisitAdd() local 84 if (left->IsShl() && TryReplaceShiftAddWithOneInstruction(left->AsShl(), add)) { in VisitAdd()
|
D | instruction_simplifier_arm64.cc | 106 HInstruction* left; in TryMergeIntoShifterOperand() local 109 left = use->InputAt(0); in TryMergeIntoShifterOperand() 114 left = GetGraph()->GetConstant(right->GetType(), 0); in TryMergeIntoShifterOperand() 116 DCHECK(left == bitfield_op || right == bitfield_op); in TryMergeIntoShifterOperand() 118 if (left == right) { in TryMergeIntoShifterOperand() 128 other_input = left; in TryMergeIntoShifterOperand()
|
D | nodes_riscv64.h | 24 HRiscv64ShiftAdd(HInstruction* left, 29 kRiscv64ShiftAdd, DataType::Type::kInt64, left, right, SideEffects::None(), dex_pc) { in HBinaryOperation() argument
|
D | dead_code_elimination.cc | 129 static HConstant* Evaluate(HCondition* condition, HInstruction* left, HInstruction* right) { in Evaluate() argument 130 if (left == right && !DataType::IsFloatingPointType(left->GetType())) { in Evaluate() 135 if (!left->IsConstant() || !right->IsConstant()) { in Evaluate() 139 if (left->IsIntConstant()) { in Evaluate() 140 return condition->Evaluate(left->AsIntConstant(), right->AsIntConstant()); in Evaluate() 141 } else if (left->IsNullConstant()) { in Evaluate() 142 return condition->Evaluate(left->AsNullConstant(), right->AsNullConstant()); in Evaluate() 143 } else if (left->IsLongConstant()) { in Evaluate() 144 return condition->Evaluate(left->AsLongConstant(), right->AsLongConstant()); in Evaluate() 145 } else if (left->IsFloatConstant()) { in Evaluate() [all …]
|
D | instruction_simplifier_shared.cc | 177 HInstruction* left = mul->GetLeft(); in TryCombineMultiplyAccumulate() local 180 TrySimpleMultiplyAccumulatePatterns(mul, right->AsBinaryOperation(), left)) { in TryCombineMultiplyAccumulate() 183 if ((left->IsAdd() || left->IsSub()) && in TryCombineMultiplyAccumulate() 184 TrySimpleMultiplyAccumulatePatterns(mul, left->AsBinaryOperation(), right)) { in TryCombineMultiplyAccumulate()
|
D | load_store_elimination_test.cc | 170 HBasicBlock* left = AddNewBlock(); in CreateDiamondShapedCFG() local 174 upper->AddSuccessor(left); in CreateDiamondShapedCFG() 176 left->AddSuccessor(return_block_); in CreateDiamondShapedCFG() 184 left->AddInstruction(new (GetAllocator()) HGoto()); in CreateDiamondShapedCFG() 187 return std::make_tuple(upper, left, right, return_block_); in CreateDiamondShapedCFG() 573 HBasicBlock* left; in TEST_F() local 576 std::tie(upper, left, right, down) = CreateDiamondShapedCFG(); in TEST_F() 583 HInstruction* vstore2 = AddVecStore(left, array_, i_, vdata); in TEST_F() 616 HBasicBlock* left; in TEST_F() local 619 std::tie(upper, left, right, down) = CreateDiamondShapedCFG(); in TEST_F() [all …]
|
D | code_generator_vector_arm64_neon.cc | 1097 VRegister left = VRegisterFrom(locations->InAt(1)); in VisitVecMultiplyAccumulate() local 1107 __ Mla(acc.V16B(), left.V16B(), right.V16B()); in VisitVecMultiplyAccumulate() 1109 __ Mls(acc.V16B(), left.V16B(), right.V16B()); in VisitVecMultiplyAccumulate() 1116 __ Mla(acc.V8H(), left.V8H(), right.V8H()); in VisitVecMultiplyAccumulate() 1118 __ Mls(acc.V8H(), left.V8H(), right.V8H()); in VisitVecMultiplyAccumulate() 1124 __ Mla(acc.V4S(), left.V4S(), right.V4S()); in VisitVecMultiplyAccumulate() 1126 __ Mls(acc.V4S(), left.V4S(), right.V4S()); in VisitVecMultiplyAccumulate() 1180 VRegister left = VRegisterFrom(locations->InAt(1)); in VisitVecSADAccumulate() local 1197 __ Sabal(acc.V8H(), left.V8B(), right.V8B()); in VisitVecSADAccumulate() 1198 __ Sabal2(acc.V8H(), left.V16B(), right.V16B()); in VisitVecSADAccumulate() [all …]
|
D | instruction_simplifier_arm.cc | 100 HInstruction* left = use->InputAt(0); in TryMergeIntoShifterOperand() local 102 DCHECK(left == bitfield_op || right == bitfield_op); in TryMergeIntoShifterOperand() 104 if (left == right) { in TryMergeIntoShifterOperand() 114 other_input = left; in TryMergeIntoShifterOperand()
|
D | instruction_simplifier_test.cc | 162 GET_BLOCK(left); in TEST_P() 165 EnsurePredecessorOrder(breturn, {left, right}); in TEST_P() 198 left->AddInstruction(goto_left); in TEST_P()
|
D | nodes_shared.h | 132 HInstruction* left, 145 SetRawInputAt(0, left);
|
D | code_generator_vector_arm64_sve.cc | 966 const ZRegister left = ZRegisterFrom(locations->InAt(1)); in VisitVecMultiplyAccumulate() local 977 __ Mla(acc.VnB(), p_reg, acc.VnB(), left.VnB(), right.VnB()); in VisitVecMultiplyAccumulate() 979 __ Mls(acc.VnB(), p_reg, acc.VnB(), left.VnB(), right.VnB()); in VisitVecMultiplyAccumulate() 985 __ Mla(acc.VnH(), p_reg, acc.VnB(), left.VnH(), right.VnH()); in VisitVecMultiplyAccumulate() 987 __ Mls(acc.VnH(), p_reg, acc.VnB(), left.VnH(), right.VnH()); in VisitVecMultiplyAccumulate() 992 __ Mla(acc.VnS(), p_reg, acc.VnB(), left.VnS(), right.VnS()); in VisitVecMultiplyAccumulate() 994 __ Mls(acc.VnS(), p_reg, acc.VnB(), left.VnS(), right.VnS()); in VisitVecMultiplyAccumulate() 1029 const ZRegister left = ZRegisterFrom(locations->InAt(1)); in VisitVecDotProd() local 1047 __ Sel(tmp0.VnB(), p_reg, left.VnB(), tmp1.VnB()); in VisitVecDotProd() 1220 const ZRegister left = ZRegisterFrom(locations->InAt(0)); in VisitVecCondition() local [all …]
|
/art/test/550-checker-multiply-accumulate/src/ |
D | Main.java | 79 public static int $opt$noinline$mulAdd(int acc, int left, int right) { in $opt$noinline$mulAdd() argument 80 return acc + left * right; in $opt$noinline$mulAdd() 120 public static long $opt$noinline$mulSub(long acc, long left, long right) { in $opt$noinline$mulSub() argument 121 return acc - left * right; in $opt$noinline$mulSub() 171 public static int $opt$noinline$multipleUses1(int acc, int left, int right) { in $opt$noinline$multipleUses1() argument 172 int temp = left * right; in $opt$noinline$multipleUses1() 228 public static long $opt$noinline$multipleUses2(long acc, long left, long right) { in $opt$noinline$multipleUses2() argument 229 long temp = left * right; in $opt$noinline$multipleUses2() 366 public static int $opt$noinline$mulNeg(int left, int right) { in $opt$noinline$mulNeg() argument 367 return - (left * right); in $opt$noinline$mulNeg() [all …]
|
/art/tools/ahat/etc/ |
D | style.css | 39 padding-left: 4px; 44 padding-left: 8px; 52 padding-left: 12px; 55 border-left: 4px solid #dcedc8;
|
/art/tools/ahat/src/main/com/android/ahat/ |
D | SizeTable.java | 44 static void table(Doc doc, Column left, boolean showDiff, Column... columns) { in table() argument 46 cols.add(left); in table() 62 static void row(Doc doc, DocString left, Size size, Size base, DocString... values) { in row() argument 64 vals.add(left); in row()
|
/art/tools/ahat/src/test-dump/ |
D | DumpedStuff.java | 88 gcPathArray[2].right.left = gcPathArray[2].left.right; in DumpedStuff() 95 public ObjectTree left; field in DumpedStuff.ObjectTree 98 public ObjectTree(ObjectTree left, ObjectTree right) { in ObjectTree() argument 99 this.left = left; in ObjectTree()
|
/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/runtime/gc/space/ |
D | region_space-inl.h | 389 size_t left = begin; in AllocLargeInRange() local 390 while (left + num_regs_in_large_region - 1 < end) { in AllocLargeInRange() 392 size_t right = left; in AllocLargeInRange() 393 DCHECK_LT(right, left + num_regs_in_large_region) in AllocLargeInRange() 395 while (right < left + num_regs_in_large_region) { in AllocLargeInRange() 407 DCHECK_EQ(left + num_regs_in_large_region, right); in AllocLargeInRange() 408 Region* first_reg = ®ions_[left]; in AllocLargeInRange() 424 for (size_t p = left + 1; p < right; ++p) { in AllocLargeInRange() 452 left = right + 1; in AllocLargeInRange()
|
/art/runtime/verifier/ |
D | reg_type_cache.cc | 308 const RegType& RegTypeCache::FromUnresolvedMerge(const RegType& left, in FromUnresolvedMerge() argument 316 if (left.IsUnresolvedMergedReference()) { in FromUnresolvedMerge() 317 const UnresolvedMergedType& left_merge = *down_cast<const UnresolvedMergedType*>(&left); in FromUnresolvedMerge() 321 left_unresolved_is_array = left.IsArrayTypes(); in FromUnresolvedMerge() 322 } else if (left.IsUnresolvedTypes()) { in FromUnresolvedMerge() 323 types.SetBit(left.GetId()); in FromUnresolvedMerge() 325 left_unresolved_is_array = left.IsArrayTypes(); in FromUnresolvedMerge() 327 left_resolved = &left; in FromUnresolvedMerge() 368 if ((!left_unresolved_is_array && left_resolved != &left) || in FromUnresolvedMerge()
|
/art/test/2043-reference-pauses/src/ |
D | Main.java | 54 CBT left; field in Main.CBT 57 left = l; in CBT() 74 current = current.left; in check()
|
/art/libartbase/base/ |
D | bit_vector.cc | 307 uint32_t left = storage_size_ - size; in Copy() local 309 if (left > 0) { in Copy() 310 memset(storage_ + size, 0, kWordBytes * left); in Copy()
|