/art/compiler/optimizing/ |
D | induction_var_range.cc | 168 bool UseFullTripCount(const HBasicBlock* context, const HLoopInformation* loop, bool is_min) { in UseFullTripCount() argument 179 return !is_min && context == loop->GetHeader(); in UseFullTripCount() 595 bool is_min) const { in GetLinear() 607 if (!is_min && stride_value == 1) { in GetLinear() 618 return GetVal(context, loop, &cancelled_trip, trip, is_min); in GetLinear() 620 } else if (is_min && stride_value == -1) { in GetLinear() 633 return SubValue(Value(0), GetVal(context, loop, &cancelled_trip, trip, !is_min)); in GetLinear() 640 return AddValue(GetMul(context, loop, info->op_a, trip, trip, is_min), in GetLinear() 641 GetVal(context, loop, info->op_b, trip, is_min)); in GetLinear() 649 bool is_min) const { in GetPolynomial() [all …]
|
D | induction_var_range.h | 243 bool is_min) const; 248 bool is_min) const; 253 bool is_min) const; 258 bool is_min) const; 263 bool is_min) const; 269 bool is_min) const; 275 bool is_min) const; 290 bool is_min) const; 296 bool is_min) const; 302 Value MergeVal(Value v1, Value v2, bool is_min) const; [all …]
|
D | code_generator_arm_vixl.h | 464 void GenerateMinMaxInt(LocationSummary* locations, bool is_min); 465 void GenerateMinMaxLong(LocationSummary* locations, bool is_min); 466 void GenerateMinMaxFloat(HInstruction* minmax, bool is_min); 467 void GenerateMinMaxDouble(HInstruction* minmax, bool is_min); 468 void GenerateMinMax(HBinaryOperation* minmax, bool is_min);
|
D | code_generator_x86_64.h | 322 void GenerateMinMaxInt(LocationSummary* locations, bool is_min, DataType::Type type); 323 void GenerateMinMaxFP(LocationSummary* locations, bool is_min, DataType::Type type); 324 void GenerateMinMax(HBinaryOperation* minmax, bool is_min);
|
D | code_generator_x86.h | 326 void GenerateMinMaxInt(LocationSummary* locations, bool is_min, DataType::Type type); 327 void GenerateMinMaxFP(LocationSummary* locations, bool is_min, DataType::Type type); 328 void GenerateMinMax(HBinaryOperation* minmax, bool is_min);
|
D | induction_var_range_test.cc | 292 bool is_min) { in GetMul() argument 296 return range_.GetMul(context, &loop, info1, info2, nullptr, is_min); in GetMul() 301 bool is_min) { in GetDiv() argument 305 return range_.GetDiv(context, &loop, info1, info2, nullptr, is_min); in GetDiv()
|
D | code_generator_arm_vixl.cc | 4970 void InstructionCodeGeneratorARMVIXL::GenerateMinMaxInt(LocationSummary* locations, bool is_min) { in GenerateMinMaxInt() argument 4986 __ ite(is_min ? lt : gt); in GenerateMinMaxInt() 4987 __ mov(is_min ? lt : gt, out, op1); in GenerateMinMaxInt() 4988 __ mov(is_min ? ge : le, out, op2); in GenerateMinMaxInt() 4992 void InstructionCodeGeneratorARMVIXL::GenerateMinMaxLong(LocationSummary* locations, bool is_min) { in GenerateMinMaxLong() argument 5021 vixl32::ConditionType cond = is_min ? ge : lt; in GenerateMinMaxLong() 5031 void InstructionCodeGeneratorARMVIXL::GenerateMinMaxFloat(HInstruction* minmax, bool is_min) { in GenerateMinMaxFloat() argument 5060 vixl32::ConditionType cond = is_min ? gt : lt; in GenerateMinMaxFloat() 5074 if (is_min) { in GenerateMinMaxFloat() 5092 void InstructionCodeGeneratorARMVIXL::GenerateMinMaxDouble(HInstruction* minmax, bool is_min) { in GenerateMinMaxDouble() argument [all …]
|
D | instruction_simplifier.cc | 1021 bool is_min) { in NewIntegralMinMax() argument 1025 if (is_min) { in NewIntegralMinMax() 1145 bool is_min = (cmp == kCondLT || cmp == kCondLE) == (a == true_value); in VisitSelect() local 1146 replace_with = NewIntegralMinMax(GetGraph()->GetAllocator(), a, b, select, is_min); in VisitSelect()
|
D | code_generator_x86_64.cc | 4684 bool is_min, in GenerateMinMaxInt() argument 4709 __ cmov(is_min ? Condition::kGreater : Condition::kLess, out, op2, /*is64bit*/ true); in GenerateMinMaxInt() 4713 __ cmov(is_min ? Condition::kGreater : Condition::kLess, out, op2, /*is64bit*/ false); in GenerateMinMaxInt() 4718 bool is_min, in GenerateMinMaxFP() argument 4760 __ j(is_min ? Condition::kAbove : Condition::kBelow, &op2_label); in GenerateMinMaxFP() 4761 __ j(is_min ? Condition::kBelow : Condition::kAbove, &done); in GenerateMinMaxFP() 4764 if (is_min) { in GenerateMinMaxFP() 4800 void InstructionCodeGeneratorX86_64::GenerateMinMax(HBinaryOperation* minmax, bool is_min) { in GenerateMinMax() argument 4805 GenerateMinMaxInt(minmax->GetLocations(), is_min, type); in GenerateMinMax() 4809 GenerateMinMaxFP(minmax->GetLocations(), is_min, type); in GenerateMinMax()
|
D | code_generator_x86.cc | 4526 bool is_min, in GenerateMinMaxInt() argument 4561 Condition cond = is_min ? Condition::kGreaterEqual : Condition::kLess; in GenerateMinMaxInt() 4576 Condition cond = is_min ? Condition::kGreater : Condition::kLess; in GenerateMinMaxInt() 4582 bool is_min, in GenerateMinMaxFP() argument 4624 __ j(is_min ? Condition::kAbove : Condition::kBelow, &op2_label); in GenerateMinMaxFP() 4625 __ j(is_min ? Condition::kBelow : Condition::kAbove, &done); in GenerateMinMaxFP() 4628 if (is_min) { in GenerateMinMaxFP() 4667 void InstructionCodeGeneratorX86::GenerateMinMax(HBinaryOperation* minmax, bool is_min) { in GenerateMinMax() argument 4672 GenerateMinMaxInt(minmax->GetLocations(), is_min, type); in GenerateMinMax() 4676 GenerateMinMaxFP(minmax->GetLocations(), is_min, type); in GenerateMinMax()
|