/art/compiler/optimizing/ |
D | instruction_simplifier_x86_shared.cc | 31 HInstruction* left = instruction->GetLeft(); in TryCombineAndNot() local 36 if (left->IsNot() ^ right->IsNot()) { in TryCombineAndNot() 37 bool left_is_not = left->IsNot(); in TryCombineAndNot() 38 HInstruction* other_ins = (left_is_not ? right : left); in TryCombineAndNot() 39 HNot* not_ins = (left_is_not ? left : right)->AsNot(); in TryCombineAndNot() 69 HInstruction* left = instruction->GetLeft(); in TryGenerateResetLeastSetBit() local 71 if (AreLeastSetBitInputs(left, right)) { in TryGenerateResetLeastSetBit() 72 candidate = left; in TryGenerateResetLeastSetBit() 74 } else if (AreLeastSetBitInputs(right, left)) { in TryGenerateResetLeastSetBit() 76 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 | instruction_simplifier_shared.cc | 175 HInstruction* left = mul->GetLeft(); in TryCombineMultiplyAccumulate() local 178 TrySimpleMultiplyAccumulatePatterns(mul, right->AsBinaryOperation(), left)) { in TryCombineMultiplyAccumulate() 181 if ((left->IsAdd() || left->IsSub()) && in TryCombineMultiplyAccumulate() 182 TrySimpleMultiplyAccumulatePatterns(mul, left->AsBinaryOperation(), right)) { in TryCombineMultiplyAccumulate() 191 HInstruction* left = op->GetLeft(); in TryMergeNegatedInput() local 196 if (left->IsNot() ^ right->IsNot()) { in TryMergeNegatedInput() 197 HInstruction* hnot = (left->IsNot() ? left : right); in TryMergeNegatedInput() 198 HInstruction* hother = (left->IsNot() ? right : left); in TryMergeNegatedInput()
|
D | dead_code_elimination.cc | 125 static HConstant* Evaluate(HCondition* condition, HInstruction* left, HInstruction* right) { in Evaluate() argument 126 if (left == right && !DataType::IsFloatingPointType(left->GetType())) { in Evaluate() 131 if (!left->IsConstant() || !right->IsConstant()) { in Evaluate() 135 if (left->IsIntConstant()) { in Evaluate() 136 return condition->Evaluate(left->AsIntConstant(), right->AsIntConstant()); in Evaluate() 137 } else if (left->IsNullConstant()) { in Evaluate() 138 return condition->Evaluate(left->AsNullConstant(), right->AsNullConstant()); in Evaluate() 139 } else if (left->IsLongConstant()) { in Evaluate() 140 return condition->Evaluate(left->AsLongConstant(), right->AsLongConstant()); in Evaluate() 141 } else if (left->IsFloatConstant()) { in Evaluate() [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 | constant_folding.cc | 136 HInstruction* left = instruction->GetLeft(); in VisitShift() local 137 if (left->IsConstant() && left->AsConstant()->IsArithmeticZero()) { in VisitShift() 142 instruction->ReplaceWith(left); in VisitShift() 231 HInstruction* left = instruction->GetLeft(); in VisitAnd() local 234 if (left->IsNot() ^ right->IsNot()) { in VisitAnd() 240 HInstruction* hnot = (left->IsNot() ? left : right); in VisitAnd() 241 HInstruction* hother = (left->IsNot() ? right : left); in VisitAnd()
|
D | instruction_simplifier.cc | 224 HInstruction* left = op->GetLeft(); in TryDeMorganNegationFactoring() local 229 if (((left->IsNot() && right->IsNot()) || in TryDeMorganNegationFactoring() 230 (left->IsBooleanNot() && right->IsBooleanNot())) && in TryDeMorganNegationFactoring() 231 left->HasOnlyOneNonEnvironmentUse() && in TryDeMorganNegationFactoring() 240 HInstruction* src_left = left->InputAt(0); in TryDeMorganNegationFactoring() 245 left->ReplaceWith(src_left); in TryDeMorganNegationFactoring() 247 left->GetBlock()->RemoveInstruction(left); in TryDeMorganNegationFactoring() 258 if (left->IsBooleanNot()) { in TryDeMorganNegationFactoring() 462 HInstruction* left = op->GetLeft(); in TryReplaceWithRotate() local 465 if ((left->IsUShr() && right->IsShl()) || (left->IsShl() && right->IsUShr())) { in TryReplaceWithRotate() [all …]
|
D | instruction_simplifier_arm64.cc | 103 HInstruction* left; in TryMergeIntoShifterOperand() local 106 left = use->InputAt(0); in TryMergeIntoShifterOperand() 111 left = GetGraph()->GetConstant(right->GetType(), 0); in TryMergeIntoShifterOperand() 113 DCHECK(left == bitfield_op || right == bitfield_op); in TryMergeIntoShifterOperand() 115 if (left == right) { in TryMergeIntoShifterOperand() 125 other_input = left; in TryMergeIntoShifterOperand()
|
D | load_store_elimination_test.cc | 155 HBasicBlock* left = AddNewBlock(); in CreateDiamondShapedCFG() local 159 upper->AddSuccessor(left); in CreateDiamondShapedCFG() 161 left->AddSuccessor(return_block_); in CreateDiamondShapedCFG() 169 left->AddInstruction(new (GetAllocator()) HGoto()); in CreateDiamondShapedCFG() 172 return std::make_tuple(upper, left, right, return_block_); in CreateDiamondShapedCFG() 730 HBasicBlock* left; in TEST_F() local 733 std::tie(upper, left, right, down) = CreateDiamondShapedCFG(); in TEST_F() 740 HInstruction* vstore2 = AddVecStore(left, array_, i_, vdata); in TEST_F() 771 HBasicBlock* left; in TEST_F() local 774 std::tie(upper, left, right, down) = CreateDiamondShapedCFG(); in TEST_F() [all …]
|
D | code_generator_vector_arm64_neon.cc | 1099 VRegister left = VRegisterFrom(locations->InAt(1)); in VisitVecMultiplyAccumulate() local 1109 __ Mla(acc.V16B(), left.V16B(), right.V16B()); in VisitVecMultiplyAccumulate() 1111 __ Mls(acc.V16B(), left.V16B(), right.V16B()); in VisitVecMultiplyAccumulate() 1118 __ Mla(acc.V8H(), left.V8H(), right.V8H()); in VisitVecMultiplyAccumulate() 1120 __ Mls(acc.V8H(), left.V8H(), right.V8H()); in VisitVecMultiplyAccumulate() 1126 __ Mla(acc.V4S(), left.V4S(), right.V4S()); in VisitVecMultiplyAccumulate() 1128 __ Mls(acc.V4S(), left.V4S(), right.V4S()); in VisitVecMultiplyAccumulate() 1182 VRegister left = VRegisterFrom(locations->InAt(1)); in VisitVecSADAccumulate() local 1199 __ Sabal(acc.V8H(), left.V8B(), right.V8B()); in VisitVecSADAccumulate() 1200 __ Sabal2(acc.V8H(), left.V16B(), right.V16B()); in VisitVecSADAccumulate() [all …]
|
D | nodes_shared.h | 69 HInstruction* left, 74 left, in HBinaryOperation() argument 198 HInstruction* left, 211 SetRawInputAt(0, left);
|
D | instruction_simplifier_arm.cc | 97 HInstruction* left = use->InputAt(0); in TryMergeIntoShifterOperand() local 99 DCHECK(left == bitfield_op || right == bitfield_op); in TryMergeIntoShifterOperand() 101 if (left == right) { in TryMergeIntoShifterOperand() 111 other_input = left; in TryMergeIntoShifterOperand()
|
D | load_store_analysis_test.cc | 855 HBasicBlock* left = blks.Get("left"); in TEST_F() local 895 left->AddInstruction(call_left); in TEST_F() 896 left->AddInstruction(goto_left); in TEST_F() 964 HBasicBlock* left = blks.Get("left"); in TEST_F() local 1004 left->AddInstruction(call_left); in TEST_F() 1005 left->AddInstruction(goto_left); in TEST_F() 1074 HBasicBlock* left = blks.Get("left"); in TEST_F() local 1127 left->AddInstruction(call_left); in TEST_F() 1128 left->AddInstruction(goto_left); in TEST_F() 1199 HBasicBlock* left = blks.Get("left"); in TEST_F() local [all …]
|
D | instruction_simplifier_test.cc | 326 GET_BLOCK(left); in TEST_F() 343 left->AddInstruction(obj1); in TEST_F() 344 left->AddInstruction(goto_left); in TEST_F() 415 GET_BLOCK(left); in TEST_P() 418 EnsurePredecessorOrder(breturn, {left, right}); in TEST_P() 451 left->AddInstruction(goto_left); in TEST_P()
|
D | nodes_x86.h | 134 HInstruction* left, 137 : HBinaryOperation(kX86AndNot, result_type, left, right, SideEffects::None(), dex_pc) { in HBinaryOperation() argument
|
D | code_generator_vector_arm64_sve.cc | 970 const ZRegister left = ZRegisterFrom(locations->InAt(1)); in VisitVecMultiplyAccumulate() local 981 __ Mla(acc.VnB(), p_reg, acc.VnB(), left.VnB(), right.VnB()); in VisitVecMultiplyAccumulate() 983 __ Mls(acc.VnB(), p_reg, acc.VnB(), left.VnB(), right.VnB()); in VisitVecMultiplyAccumulate() 989 __ Mla(acc.VnH(), p_reg, acc.VnB(), left.VnH(), right.VnH()); in VisitVecMultiplyAccumulate() 991 __ Mls(acc.VnH(), p_reg, acc.VnB(), left.VnH(), right.VnH()); in VisitVecMultiplyAccumulate() 996 __ Mla(acc.VnS(), p_reg, acc.VnB(), left.VnS(), right.VnS()); in VisitVecMultiplyAccumulate() 998 __ Mls(acc.VnS(), p_reg, acc.VnB(), left.VnS(), right.VnS()); in VisitVecMultiplyAccumulate() 1033 const ZRegister left = ZRegisterFrom(locations->InAt(1)); in VisitVecDotProd() local 1051 __ Sel(tmp0.VnB(), p_reg, left.VnB(), tmp1.VnB()); in VisitVecDotProd() 1245 Register left = InputRegisterAt(instruction, 0); in VisitVecPredWhile() 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/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 | 87 gcPathArray[2].right.left = gcPathArray[2].left.right; in DumpedStuff() 91 public ObjectTree left; field in DumpedStuff.ObjectTree 94 public ObjectTree(ObjectTree left, ObjectTree right) { in ObjectTree() argument 95 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 | 391 size_t left = begin; in AllocLargeInRange() local 392 while (left + num_regs_in_large_region - 1 < end) { in AllocLargeInRange() 394 size_t right = left; in AllocLargeInRange() 395 DCHECK_LT(right, left + num_regs_in_large_region) in AllocLargeInRange() 397 while (right < left + num_regs_in_large_region) { in AllocLargeInRange() 409 DCHECK_EQ(left + num_regs_in_large_region, right); in AllocLargeInRange() 410 Region* first_reg = ®ions_[left]; in AllocLargeInRange() 426 for (size_t p = left + 1; p < right; ++p) { in AllocLargeInRange() 454 left = right + 1; in AllocLargeInRange()
|
/art/tools/ahat/etc/ |
D | style.css | 34 padding-left: 4px; 39 padding-left: 8px;
|
/art/runtime/verifier/ |
D | reg_type_cache.cc | 394 const RegType& RegTypeCache::FromUnresolvedMerge(const RegType& left, in FromUnresolvedMerge() argument 402 if (left.IsUnresolvedMergedReference()) { in FromUnresolvedMerge() 403 const UnresolvedMergedType& left_merge = *down_cast<const UnresolvedMergedType*>(&left); in FromUnresolvedMerge() 407 left_unresolved_is_array = left.IsArrayTypes(); in FromUnresolvedMerge() 408 } else if (left.IsUnresolvedTypes()) { in FromUnresolvedMerge() 410 types.SetBit(left.GetId()); in FromUnresolvedMerge() 412 left_unresolved_is_array = left.IsArrayTypes(); in FromUnresolvedMerge() 415 left_resolved = &left; in FromUnresolvedMerge() 456 if ((!left_unresolved_is_array && left_resolved != &left) || in FromUnresolvedMerge()
|
/art/libartbase/base/ |
D | bit_vector.cc | 312 uint32_t left = storage_size_ - size; in Copy() local 314 if (left > 0) { in Copy() 315 memset(storage_ + size, 0, kWordBytes * left); in Copy()
|
D | stats-inl.h | 44 << std::setw(name_width) << std::left << name << " " in Dump()
|