Searched refs:left (Results 1 - 25 of 35) sorted by relevance

12

/art/tools/ahat/etc/
H A Dstyle.css34 padding-left: 4px;
39 padding-left: 8px;
/art/test/550-checker-multiply-accumulate/src/
H A DMain.java82 public static int $opt$noinline$mulAdd(int acc, int left, int right) { argument
84 return acc + left * right;
124 public static long $opt$noinline$mulSub(long acc, long left, long right) { argument
126 return acc - left * right;
176 public static int $opt$noinline$multipleUses1(int acc, int left, int right) { argument
178 int temp = left * right;
234 public static long $opt$noinline$multipleUses2(long acc, long left, long right) { argument
236 long temp = left * right;
375 public static int $opt$noinline$mulNeg(int left, int right) { argument
377 return - (left * righ
422 $opt$noinline$mulNeg(long left, long right) argument
[all...]
/art/tools/ahat/src/test/com/android/ahat/
H A DDominatorsTest.java91 // \-> left --->/
92 // The child node can be reached either by right or by left.
95 Node left = new Node("left");
97 parent.depends = Arrays.asList(left, right);
99 left.depends = Arrays.asList(child);
102 assertEquals(parent, left.dominator);
176 // \--> left --->--------/
180 Node left = new Node("left");
[all...]
H A DInstanceTest.java230 AhatInstance left = base.getRefField("left");
232 AhatInstance target = left.getRefField("right");
251 // There are two possible paths. Either it can go through the 'left' node,
253 if (path.get(3).field.equals(".left")) {
254 assertEquals(".left", path.get(3).field);
256 assertEquals(left, path.get(4).instance);
264 assertEquals(".left", path.get(4).field);
/art/compiler/optimizing/
H A Dnodes_vector.h233 HInstruction* left,
245 SetRawInputAt(0, left);
518 HInstruction* left,
523 : HVecBinaryOperation(kVecAdd, allocator, left, right, packed_type, vector_length, dex_pc) {
524 DCHECK(HasConsistentPackedTypes(left, packed_type));
543 HInstruction* left,
550 kVecHalvingAdd, allocator, left, right, packed_type, vector_length, dex_pc) {
551 DCHECK(HasConsistentPackedTypes(left, packed_type));
583 HInstruction* left,
588 : HVecBinaryOperation(kVecSub, allocator, left, righ
231 HVecBinaryOperation(InstructionKind kind, ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
517 HVecAdd(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
542 HVecHalvingAdd(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, bool is_rounded, uint32_t dex_pc) argument
582 HVecSub(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
605 HVecMul(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
628 HVecDiv(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
652 HVecMin(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
676 HVecMax(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
699 HVecAnd(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
721 HVecAndNot(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
744 HVecOr(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
766 HVecXor(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
788 HVecShl(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
810 HVecShr(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
832 HVecUShr(ArenaAllocator* allocator, HInstruction* left, HInstruction* right, DataType::Type packed_type, size_t vector_length, uint32_t dex_pc) argument
[all...]
H A Dinstruction_simplifier_shared.cc167 // We prefer not applying the following transformations if the left and
175 HInstruction* left = mul->GetLeft(); local
178 TrySimpleMultiplyAccumulatePatterns(mul, right->AsBinaryOperation(), left)) {
181 if ((left->IsAdd() || left->IsSub()) &&
182 TrySimpleMultiplyAccumulatePatterns(mul, left->AsBinaryOperation(), right)) {
191 HInstruction* left = op->GetLeft(); local
196 if (left->IsNot() ^ right->IsNot()) {
197 HInstruction* hnot = (left->IsNot() ? left
[all...]
H A Ddead_code_elimination.cc125 static HConstant* Evaluate(HCondition* condition, HInstruction* left, HInstruction* right) { argument
126 if (left == right && !DataType::IsFloatingPointType(left->GetType())) {
131 if (!left->IsConstant() || !right->IsConstant()) {
135 if (left->IsIntConstant()) {
136 return condition->Evaluate(left->AsIntConstant(), right->AsIntConstant());
137 } else if (left->IsNullConstant()) {
138 return condition->Evaluate(left->AsNullConstant(), right->AsNullConstant());
139 } else if (left->IsLongConstant()) {
140 return condition->Evaluate(left
[all...]
H A Dinstruction_simplifier.cc208 HInstruction* left = op->GetLeft(); local
213 if (((left->IsNot() && right->IsNot()) ||
214 (left->IsBooleanNot() && right->IsBooleanNot())) &&
215 left->HasOnlyOneNonEnvironmentUse() &&
224 HInstruction* src_left = left->InputAt(0);
229 left->ReplaceWith(src_left);
231 left->GetBlock()->RemoveInstruction(left);
242 if (left->IsBooleanNot()) {
441 HInstruction* left local
1253 HInstruction* left = instruction->GetLeft(); local
1556 HInstruction* left = condition->GetLeft(); local
1919 HInstruction* left = instruction->GetLeft(); local
2046 HInstruction* left = instruction->GetLeft(); local
2265 HInstruction* left = invoke->InputAt(0); local
2550 HInstruction* left = instruction->GetLeft(); local
2628 HInstruction* left = instruction->GetLeft(); local
[all...]
H A Dbounds_check_elimination.cc51 // Return whether (left + right) overflows or underflows.
52 static bool WouldAddOverflowOrUnderflow(int32_t left, int32_t right) { argument
56 if ((right > 0) && (left <= (std::numeric_limits<int32_t>::max() - right))) {
60 if ((right < 0) && (left >= (std::numeric_limits<int32_t>::min() - right))) {
75 HInstruction* left = bin_op->GetLeft(); local
81 instruction = left;
82 left_so_far = left;
100 HInstruction *left; local
102 if (IsAddOrSubAConstant(instruction, &left, &right)) {
103 return ValueBound(left, righ
122 HInstruction *left; local
626 HandleIfBetweenTwoMonotonicValueRanges(HIf* instruction, HInstruction* left, HInstruction* right, IfCondition cond, MonotonicValueRange* left_range, MonotonicValueRange* right_range) argument
692 HandleIf(HIf* instruction, HInstruction* left, HInstruction* right, IfCondition cond) argument
953 HInstruction *left; variable
1017 HInstruction* left = sub->GetLeft(); variable
1092 HInstruction* left = instruction->GetLeft(); local
1146 HInstruction* left = instruction->GetLeft(); variable
1208 HInstruction *left; variable
[all...]
H A Dinstruction_simplifier_arm64.cc101 HInstruction* left; local
104 left = use->InputAt(0);
109 left = GetGraph()->GetConstant(right->GetType(), 0);
111 DCHECK(left == bitfield_op || right == bitfield_op);
113 if (left == right) {
123 other_input = left;
H A Dinstruction_simplifier_arm.cc95 HInstruction* left = use->InputAt(0); local
97 DCHECK(left == bitfield_op || right == bitfield_op);
99 if (left == right) {
109 other_input = left;
H A Dnodes_shared.h69 HInstruction* left,
74 left,
181 kLSL, // Logical shift left.
198 HInstruction* left,
211 SetRawInputAt(0, left);
67 HBitwiseNegatedRight(DataType::Type result_type, InstructionKind op, HInstruction* left, HInstruction* right, uint32_t dex_pc = kNoDexPc) argument
197 HDataProcWithShifterOp(HInstruction* instr, HInstruction* left, HInstruction* right, OpKind op, int shift = 0, uint32_t dex_pc = kNoDexPc) argument
H A Dconstant_folding.cc135 HInstruction* left = instruction->GetLeft(); local
136 if (left->IsConstant() && left->AsConstant()->IsArithmeticZero()) {
141 instruction->ReplaceWith(left);
H A Dcode_generator_vector_mips.cc1025 VectorRegister left = VectorRegisterFrom(locations->InAt(1)); local
1032 __ MaddvB(acc, left, right);
1034 __ MsubvB(acc, left, right);
1041 __ MaddvH(acc, left, right);
1043 __ MsubvH(acc, left, right);
1049 __ MaddvW(acc, left, right);
1051 __ MsubvW(acc, left, right);
1057 __ MaddvD(acc, left, right);
1059 __ MsubvD(acc, left, right);
1098 VectorRegister left local
[all...]
H A Dcode_generator_vector_mips64.cc1023 VectorRegister left = VectorRegisterFrom(locations->InAt(1)); local
1030 __ MaddvB(acc, left, right);
1032 __ MsubvB(acc, left, right);
1039 __ MaddvH(acc, left, right);
1041 __ MsubvH(acc, left, right);
1047 __ MaddvW(acc, left, right);
1049 __ MsubvW(acc, left, right);
1055 __ MaddvD(acc, left, right);
1057 __ MsubvD(acc, left, right);
1096 VectorRegister left local
[all...]
H A Dcode_generator_vector_arm64.cc996 VRegister left = VRegisterFrom(locations->InAt(1)); local
1006 __ Mla(acc.V16B(), left.V16B(), right.V16B());
1008 __ Mls(acc.V16B(), left.V16B(), right.V16B());
1015 __ Mla(acc.V8H(), left.V8H(), right.V8H());
1017 __ Mls(acc.V8H(), left.V8H(), right.V8H());
1023 __ Mla(acc.V4S(), left.V4S(), right.V4S());
1025 __ Mls(acc.V4S(), left.V4S(), right.V4S());
1079 VRegister left = VRegisterFrom(locations->InAt(1)); local
1096 __ Sabal(acc.V8H(), left.V8B(), right.V8B());
1097 __ Sabal2(acc.V8H(), left
[all...]
H A Dssa_builder.cc37 HInstruction* left = equality_instr->InputAt(0); local
41 if ((left->GetType() == DataType::Type::kReference) &&
45 (left->GetType() == DataType::Type::kInt32)) {
46 int_operand = left;
/art/tools/ahat/src/test-dump/
H A DDumpedStuff.java87 gcPathArray[2].right.left = gcPathArray[2].left.right;
91 public ObjectTree left; field in class:DumpedStuff.ObjectTree
94 public ObjectTree(ObjectTree left, ObjectTree right) { argument
95 this.left = left;
/art/tools/ahat/src/main/com/android/ahat/
H A DSizeTable.java26 * Two table formats are supported, one where a custom left column can be
28 * |left column|Java Size|Native Size|...|Total Size|custom columns...|
30 * The other without the custom left column:
35 * Start a size table with a custom left column.
37 * |left column|Java Size|Native Size|...|Total Size|custom columns...|
44 static void table(Doc doc, Column left, boolean showDiff, Column... columns) { argument
46 cols.add(left);
58 * Add a row to the currently active size table with custom left column.
62 static void row(Doc doc, DocString left, Size size, Size base, DocString... values) { argument
64 vals.add(left);
[all...]
/art/runtime/gc/space/
H A Dregion_space-inl.h262 size_t left = 0; local
263 while (left + num_regs - 1 < num_regions_) {
265 size_t right = left;
266 DCHECK_LT(right, left + num_regs)
268 while (right < left + num_regs) {
278 DCHECK_EQ(left + num_regs, right);
279 Region* first_reg = &regions_[left];
291 for (size_t p = left + 1; p < right; ++p) {
309 left = right + 1;
/art/cmdline/detail/
H A 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/libartbase/base/
H A Dbit_vector.cc308 uint32_t left = storage_size_ - size; local
310 if (left > 0) {
311 memset(storage_ + size, 0, kWordBytes * left);
H A Dbit_utils.h348 template <typename T, bool left>
351 int unsigned_right_shift = left ? (-distance & mask) : (distance & mask);
352 int signed_left_shift = left ? (distance & mask) : (-distance & mask);
/art/runtime/verifier/
H A Dreg_type_cache.cc380 const RegType& RegTypeCache::FromUnresolvedMerge(const RegType& left, argument
388 if (left.IsUnresolvedMergedReference()) {
389 const UnresolvedMergedType& left_merge = *down_cast<const UnresolvedMergedType*>(&left);
393 left_unresolved_is_array = left.IsArrayTypes();
394 } else if (left.IsUnresolvedTypes()) {
396 types.SetBit(left.GetId());
398 left_unresolved_is_array = left.IsArrayTypes();
401 left_resolved = &left;
442 if ((!left_unresolved_is_array && left_resolved != &left) ||
/art/sigchainlib/
H A Dsigchain.cc102 static int sigorset(SigsetType* dest, SigsetType* left, SigsetType* right) { argument
105 if (sigismember(left, i) == 1 || sigismember(right, i) == 1) {

Completed in 3612 milliseconds

12