Home
last modified time | relevance | path

Searched refs:left (Results 1 – 25 of 38) sorted by relevance

12

/art/test/550-checker-multiply-accumulate/src/
DMain.java82 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/test/com/android/ahat/
DDominatorsTest.java95 Node left = new Node("left"); in reachableTwoWays() local
97 parent.depends = Arrays.asList(left, right); in reachableTwoWays()
99 left.depends = Arrays.asList(child); in reachableTwoWays()
102 assertEquals(parent, left.dominator); in reachableTwoWays()
180 Node left = new Node("left"); in multiEntryLoop() local
185 parent.depends = Arrays.asList(left, right); in multiEntryLoop()
187 left.depends = Arrays.asList(c); in multiEntryLoop()
194 assertEquals(parent, left.dominator); in multiEntryLoop()
211 Node left = new Node("left"); in dominatorOverwrite() local
213 parent.depends = Arrays.asList(left, child, right); in dominatorOverwrite()
[all …]
DInstanceTest.java230 AhatInstance left = base.getRefField("left"); in gcRootPath() local
232 AhatInstance target = left.getRefField("right"); in gcRootPath()
256 assertEquals(left, path.get(4).instance); in gcRootPath()
/art/compiler/optimizing/
Dnodes_vector.h233 HInstruction* left, in HVecBinaryOperation() argument
245 SetRawInputAt(0, left); in HVecBinaryOperation()
518 HInstruction* left, in HVecAdd() argument
523 : HVecBinaryOperation(kVecAdd, allocator, left, right, packed_type, vector_length, dex_pc) { in HVecAdd()
524 DCHECK(HasConsistentPackedTypes(left, packed_type)); in HVecAdd()
543 HInstruction* left, in HVecHalvingAdd() argument
550 kVecHalvingAdd, allocator, left, right, packed_type, vector_length, dex_pc) { in HVecHalvingAdd()
551 DCHECK(HasConsistentPackedTypes(left, packed_type)); in HVecHalvingAdd()
583 HInstruction* left, in HVecSub() argument
588 : HVecBinaryOperation(kVecSub, allocator, left, right, packed_type, vector_length, dex_pc) { in HVecSub()
[all …]
Dinstruction_simplifier_shared.cc175 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()
Ddead_code_elimination.cc125 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 …]
Dinstruction_simplifier.cc208 HInstruction* left = op->GetLeft(); in TryDeMorganNegationFactoring() local
213 if (((left->IsNot() && right->IsNot()) || in TryDeMorganNegationFactoring()
214 (left->IsBooleanNot() && right->IsBooleanNot())) && in TryDeMorganNegationFactoring()
215 left->HasOnlyOneNonEnvironmentUse() && in TryDeMorganNegationFactoring()
224 HInstruction* src_left = left->InputAt(0); in TryDeMorganNegationFactoring()
229 left->ReplaceWith(src_left); in TryDeMorganNegationFactoring()
231 left->GetBlock()->RemoveInstruction(left); in TryDeMorganNegationFactoring()
242 if (left->IsBooleanNot()) { in TryDeMorganNegationFactoring()
441 HInstruction* left = op->GetLeft(); in TryReplaceWithRotate() local
444 if ((left->IsUShr() && right->IsShl()) || (left->IsShl() && right->IsUShr())) { in TryReplaceWithRotate()
[all …]
Dbounds_check_elimination.cc52 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 …]
Dinstruction_simplifier_arm64.cc101 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()
Dnodes_shared.h69 HInstruction* left,
74 left, in HBinaryOperation() argument
198 HInstruction* left,
211 SetRawInputAt(0, left);
Dinstruction_simplifier_arm.cc95 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()
Dcode_generator_vector_mips64.cc1023 VectorRegister left = VectorRegisterFrom(locations->InAt(1)); in VisitVecMultiplyAccumulate() local
1030 __ MaddvB(acc, left, right); in VisitVecMultiplyAccumulate()
1032 __ MsubvB(acc, left, right); in VisitVecMultiplyAccumulate()
1039 __ MaddvH(acc, left, right); in VisitVecMultiplyAccumulate()
1041 __ MsubvH(acc, left, right); in VisitVecMultiplyAccumulate()
1047 __ MaddvW(acc, left, right); in VisitVecMultiplyAccumulate()
1049 __ MsubvW(acc, left, right); in VisitVecMultiplyAccumulate()
1055 __ MaddvD(acc, left, right); in VisitVecMultiplyAccumulate()
1057 __ MsubvD(acc, left, right); in VisitVecMultiplyAccumulate()
1096 VectorRegister left = VectorRegisterFrom(locations->InAt(1)); in VisitVecSADAccumulate() local
[all …]
Dcode_generator_vector_mips.cc1025 VectorRegister left = VectorRegisterFrom(locations->InAt(1)); in VisitVecMultiplyAccumulate() local
1032 __ MaddvB(acc, left, right); in VisitVecMultiplyAccumulate()
1034 __ MsubvB(acc, left, right); in VisitVecMultiplyAccumulate()
1041 __ MaddvH(acc, left, right); in VisitVecMultiplyAccumulate()
1043 __ MsubvH(acc, left, right); in VisitVecMultiplyAccumulate()
1049 __ MaddvW(acc, left, right); in VisitVecMultiplyAccumulate()
1051 __ MsubvW(acc, left, right); in VisitVecMultiplyAccumulate()
1057 __ MaddvD(acc, left, right); in VisitVecMultiplyAccumulate()
1059 __ MsubvD(acc, left, right); in VisitVecMultiplyAccumulate()
1098 VectorRegister left = VectorRegisterFrom(locations->InAt(1)); in VisitVecSADAccumulate() local
[all …]
Dcode_generator_vector_arm64.cc996 VRegister left = VRegisterFrom(locations->InAt(1)); in VisitVecMultiplyAccumulate() local
1006 __ Mla(acc.V16B(), left.V16B(), right.V16B()); in VisitVecMultiplyAccumulate()
1008 __ Mls(acc.V16B(), left.V16B(), right.V16B()); in VisitVecMultiplyAccumulate()
1015 __ Mla(acc.V8H(), left.V8H(), right.V8H()); in VisitVecMultiplyAccumulate()
1017 __ Mls(acc.V8H(), left.V8H(), right.V8H()); in VisitVecMultiplyAccumulate()
1023 __ Mla(acc.V4S(), left.V4S(), right.V4S()); in VisitVecMultiplyAccumulate()
1025 __ Mls(acc.V4S(), left.V4S(), right.V4S()); in VisitVecMultiplyAccumulate()
1079 VRegister left = VRegisterFrom(locations->InAt(1)); in VisitVecSADAccumulate() local
1096 __ Sabal(acc.V8H(), left.V8B(), right.V8B()); in VisitVecSADAccumulate()
1097 __ Sabal2(acc.V8H(), left.V16B(), right.V16B()); in VisitVecSADAccumulate()
[all …]
Dconstant_folding.cc135 HInstruction* left = instruction->GetLeft(); in VisitShift() local
136 if (left->IsConstant() && left->AsConstant()->IsArithmeticZero()) { in VisitShift()
141 instruction->ReplaceWith(left); in VisitShift()
Dssa_builder.cc37 HInstruction* left = equality_instr->InputAt(0); in FixNullConstantType() local
41 if ((left->GetType() == DataType::Type::kReference) && in FixNullConstantType()
45 (left->GetType() == DataType::Type::kInt32)) { in FixNullConstantType()
46 int_operand = left; in FixNullConstantType()
/art/tools/ahat/src/test-dump/
DDumpedStuff.java87 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/tools/ahat/src/main/com/android/ahat/
DSizeTable.java44 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/runtime/gc/space/
Dregion_space-inl.h262 size_t left = 0; in AllocLarge() local
263 while (left + num_regs - 1 < num_regions_) { in AllocLarge()
265 size_t right = left; in AllocLarge()
266 DCHECK_LT(right, left + num_regs) in AllocLarge()
268 while (right < left + num_regs) { in AllocLarge()
278 DCHECK_EQ(left + num_regs, right); in AllocLarge()
279 Region* first_reg = &regions_[left]; in AllocLarge()
291 for (size_t p = left + 1; p < right; ++p) { in AllocLarge()
309 left = right + 1; in AllocLarge()
/art/cmdline/detail/
Dcmdline_parser_detail.h55 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/etc/
Dstyle.css34 padding-left: 4px;
39 padding-left: 8px;
/art/runtime/verifier/
Dreg_type_cache.cc380 const RegType& RegTypeCache::FromUnresolvedMerge(const RegType& left, in FromUnresolvedMerge() argument
388 if (left.IsUnresolvedMergedReference()) { in FromUnresolvedMerge()
389 const UnresolvedMergedType& left_merge = *down_cast<const UnresolvedMergedType*>(&left); in FromUnresolvedMerge()
393 left_unresolved_is_array = left.IsArrayTypes(); in FromUnresolvedMerge()
394 } else if (left.IsUnresolvedTypes()) { in FromUnresolvedMerge()
396 types.SetBit(left.GetId()); in FromUnresolvedMerge()
398 left_unresolved_is_array = left.IsArrayTypes(); in FromUnresolvedMerge()
401 left_resolved = &left; in FromUnresolvedMerge()
442 if ((!left_unresolved_is_array && left_resolved != &left) || in FromUnresolvedMerge()
/art/libartbase/base/
Dbit_vector.cc308 uint32_t left = storage_size_ - size; in Copy() local
310 if (left > 0) { in Copy()
311 memset(storage_ + size, 0, kWordBytes * left); in Copy()
Dbit_utils.h348 template <typename T, bool left>
351 int unsigned_right_shift = left ? (-distance & mask) : (distance & mask); in Rot()
352 int signed_left_shift = left ? (distance & mask) : (-distance & mask); in Rot()
/art/sigchainlib/
Dsigchain.cc102 static int sigorset(SigsetType* dest, SigsetType* left, SigsetType* right) { in sigorset() argument
105 if (sigismember(left, i) == 1 || sigismember(right, i) == 1) { in sigorset()

12