/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 | 229 HInstruction* left, in HVecBinaryOperation() argument 241 SetRawInputAt(0, left); in HVecBinaryOperation() 512 HInstruction* left, in HVecAdd() argument 517 : HVecBinaryOperation(kVecAdd, allocator, left, right, packed_type, vector_length, dex_pc) { in HVecAdd() 518 DCHECK(HasConsistentPackedTypes(left, packed_type)); in HVecAdd() 536 HInstruction* left, in HVecSaturationAdd() argument 542 kVecSaturationAdd, allocator, left, right, packed_type, vector_length, dex_pc) { in HVecSaturationAdd() 543 DCHECK(HasConsistentPackedTypes(left, packed_type)); in HVecSaturationAdd() 562 HInstruction* left, in HVecHalvingAdd() argument 569 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 | instruction_simplifier.cc | 215 HInstruction* left = op->GetLeft(); in TryDeMorganNegationFactoring() local 220 if (((left->IsNot() && right->IsNot()) || in TryDeMorganNegationFactoring() 221 (left->IsBooleanNot() && right->IsBooleanNot())) && in TryDeMorganNegationFactoring() 222 left->HasOnlyOneNonEnvironmentUse() && in TryDeMorganNegationFactoring() 231 HInstruction* src_left = left->InputAt(0); in TryDeMorganNegationFactoring() 236 left->ReplaceWith(src_left); in TryDeMorganNegationFactoring() 238 left->GetBlock()->RemoveInstruction(left); in TryDeMorganNegationFactoring() 249 if (left->IsBooleanNot()) { in TryDeMorganNegationFactoring() 448 HInstruction* left = op->GetLeft(); in TryReplaceWithRotate() local 451 if ((left->IsUShr() && right->IsShl()) || (left->IsShl() && right->IsUShr())) { in TryReplaceWithRotate() [all …]
|
D | instruction_simplifier_arm64.cc | 101 HInstruction* left; in TryMergeIntoShifterOperand() local 104 left = use->InputAt(0); in TryMergeIntoShifterOperand() 109 left = GetGraph()->GetConstant(right->GetType(), 0); in TryMergeIntoShifterOperand() 111 DCHECK(left == bitfield_op || right == bitfield_op); in TryMergeIntoShifterOperand() 113 if (left == right) { in TryMergeIntoShifterOperand() 123 other_input = left; in TryMergeIntoShifterOperand()
|
D | code_generator_vector_arm64.cc | 1070 VRegister left = VRegisterFrom(locations->InAt(1)); in VisitVecMultiplyAccumulate() local 1080 __ Mla(acc.V16B(), left.V16B(), right.V16B()); in VisitVecMultiplyAccumulate() 1082 __ Mls(acc.V16B(), left.V16B(), right.V16B()); in VisitVecMultiplyAccumulate() 1089 __ Mla(acc.V8H(), left.V8H(), right.V8H()); in VisitVecMultiplyAccumulate() 1091 __ Mls(acc.V8H(), left.V8H(), right.V8H()); in VisitVecMultiplyAccumulate() 1097 __ Mla(acc.V4S(), left.V4S(), right.V4S()); in VisitVecMultiplyAccumulate() 1099 __ Mls(acc.V4S(), left.V4S(), right.V4S()); in VisitVecMultiplyAccumulate() 1153 VRegister left = VRegisterFrom(locations->InAt(1)); in VisitVecSADAccumulate() local 1170 __ Sabal(acc.V8H(), left.V8B(), right.V8B()); in VisitVecSADAccumulate() 1171 __ 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 | 95 HInstruction* left = use->InputAt(0); in TryMergeIntoShifterOperand() local 97 DCHECK(left == bitfield_op || right == bitfield_op); in TryMergeIntoShifterOperand() 99 if (left == right) { in TryMergeIntoShifterOperand() 109 other_input = left; in TryMergeIntoShifterOperand()
|
D | code_generator_vector_mips64.cc | 1039 VectorRegister left = VectorRegisterFrom(locations->InAt(1)); in VisitVecMultiplyAccumulate() local 1046 __ MaddvB(acc, left, right); in VisitVecMultiplyAccumulate() 1048 __ MsubvB(acc, left, right); in VisitVecMultiplyAccumulate() 1055 __ MaddvH(acc, left, right); in VisitVecMultiplyAccumulate() 1057 __ MsubvH(acc, left, right); in VisitVecMultiplyAccumulate() 1063 __ MaddvW(acc, left, right); in VisitVecMultiplyAccumulate() 1065 __ MsubvW(acc, left, right); in VisitVecMultiplyAccumulate() 1071 __ MaddvD(acc, left, right); in VisitVecMultiplyAccumulate() 1073 __ MsubvD(acc, left, right); in VisitVecMultiplyAccumulate() 1112 VectorRegister left = VectorRegisterFrom(locations->InAt(1)); in VisitVecSADAccumulate() local [all …]
|
D | code_generator_vector_mips.cc | 1041 VectorRegister left = VectorRegisterFrom(locations->InAt(1)); in VisitVecMultiplyAccumulate() local 1048 __ MaddvB(acc, left, right); in VisitVecMultiplyAccumulate() 1050 __ MsubvB(acc, left, right); in VisitVecMultiplyAccumulate() 1057 __ MaddvH(acc, left, right); in VisitVecMultiplyAccumulate() 1059 __ MsubvH(acc, left, right); in VisitVecMultiplyAccumulate() 1065 __ MaddvW(acc, left, right); in VisitVecMultiplyAccumulate() 1067 __ MsubvW(acc, left, right); in VisitVecMultiplyAccumulate() 1073 __ MaddvD(acc, left, right); in VisitVecMultiplyAccumulate() 1075 __ MsubvD(acc, left, right); in VisitVecMultiplyAccumulate() 1114 VectorRegister left = VectorRegisterFrom(locations->InAt(1)); in VisitVecSADAccumulate() 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()
|
D | nodes_x86.h | 134 HInstruction* left, 137 : HBinaryOperation(kX86AndNot, result_type, left, right, SideEffects::None(), dex_pc) { in HBinaryOperation() argument
|
D | ssa_builder.cc | 40 HInstruction* left = equality_instr->InputAt(0); in FixNullConstantType() local 44 if ((left->GetType() == DataType::Type::kReference) && in FixNullConstantType() 48 (left->GetType() == DataType::Type::kInt32)) { in FixNullConstantType() 49 int_operand = left; in FixNullConstantType()
|
/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/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 | 396 size_t left = begin; in AllocLargeInRange() local 397 while (left + num_regs_in_large_region - 1 < end) { in AllocLargeInRange() 399 size_t right = left; in AllocLargeInRange() 400 DCHECK_LT(right, left + num_regs_in_large_region) in AllocLargeInRange() 402 while (right < left + num_regs_in_large_region) { in AllocLargeInRange() 414 DCHECK_EQ(left + num_regs_in_large_region, right); in AllocLargeInRange() 415 Region* first_reg = ®ions_[left]; in AllocLargeInRange() 431 for (size_t p = left + 1; p < right; ++p) { in AllocLargeInRange() 459 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 | 383 const RegType& RegTypeCache::FromUnresolvedMerge(const RegType& left, in FromUnresolvedMerge() argument 391 if (left.IsUnresolvedMergedReference()) { in FromUnresolvedMerge() 392 const UnresolvedMergedType& left_merge = *down_cast<const UnresolvedMergedType*>(&left); in FromUnresolvedMerge() 396 left_unresolved_is_array = left.IsArrayTypes(); in FromUnresolvedMerge() 397 } else if (left.IsUnresolvedTypes()) { in FromUnresolvedMerge() 399 types.SetBit(left.GetId()); in FromUnresolvedMerge() 401 left_unresolved_is_array = left.IsArrayTypes(); in FromUnresolvedMerge() 404 left_resolved = &left; in FromUnresolvedMerge() 445 if ((!left_unresolved_is_array && left_resolved != &left) || in FromUnresolvedMerge()
|
/art/libartbase/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 | 349 template <typename T, bool left> 352 int unsigned_right_shift = left ? (-distance & mask) : (distance & mask); in Rot() 353 int signed_left_shift = left ? (distance & mask) : (-distance & mask); in Rot()
|
/art/sigchainlib/ |
D | sigchain.cc | 81 static int sigorset(SigsetType* dest, SigsetType* left, SigsetType* right) { in sigorset() argument 84 if (sigismember(left, i) == 1 || sigismember(right, i) == 1) { in sigorset()
|