/* * Copyright ( C ) 2015 The Android Open Source Project * * Licensed under the Apache License , Version 2 . 0 ( the " License " ) ; * you may not use this file except in compliance with the License . * You may obtain a copy of the License at * * http : //www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing , software * distributed under the License is distributed on an " AS IS " BASIS , * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND , either express or implied . * See the License for the specific language governing permissions and * limitations under the License . #include "induction_var_range.h" #include "base/arena_allocator.h" #include "base/macros.h" #include "builder.h" #include "induction_var_analysis.h" #include "nodes.h" #include "optimizing_unit_test.h" namespace art HIDDEN {using Value = InductionVarRange::Value;/** * Fixture class for the InductionVarRange tests . class InductionVarRangeTest : public OptimizingUnitTest {public :new (GetAllocator()) HInductionVarAnalysis(BuildGraph())),// Set arbitrary range analysis hint while testing private methods. void ExpectEqual(Value v1, Value v2) {void ExpectInt(int32_t value, HInstruction* i) {// // Construction methods. // /** Constructs bare minimum graph. */ 1 );// Two parameters. return graph_;/** Constructs loop with given upper bound. */ void BuildLoop(int32_t lower, HInstruction* upper, int32_t stride) {// Control flow. ;// Move the loop exit to the "else" successor. // Instructions. ;0 ) ? kCondLT : kCondGT;// i < u or i > u /** Constructs SSA and performs induction variable analysis. */ void PerformInductionVarAnalysis() {/** Sets hint. */ void SetHint(HInstruction* hint) {/** Constructs an invariant. */ char opc,switch (opc) {case '+' : op = HInductionVarAnalysis::kAdd; break ;case '-' : op = HInductionVarAnalysis::kSub; break ;case 'n' : op = HInductionVarAnalysis::kNeg; break ;case '*' : op = HInductionVarAnalysis::kMul; break ;case '/' : op = HInductionVarAnalysis::kDiv; break ;case '%' : op = HInductionVarAnalysis::kRem; break ;case '^' : op = HInductionVarAnalysis::kXor; break ;case '<' : op = HInductionVarAnalysis::kLT; break ;default : op = HInductionVarAnalysis::kNop; break ;// Use bogus loop information and context out of the bogus loop. return iva_->CreateInvariantOp(context, &loop, op, a, b);/** Constructs a fetch. */ return iva_->CreateInvariantFetch(fetch);/** Constructs a constant. */ return CreateFetch(graph_->GetIntConstant(c));/** Constructs a constant trip-count. */ bool in_loop, bool safe) {fe;if (in_loop && safe) {else if (in_loop) {else if (safe) {// Return TC with taken-test 0 < TC. return iva_->CreateTripCount(op,'<' , CreateConst(0 ), CreateConst(tc)),/** Constructs a linear a * i + b induction. */ return iva_->CreateInduction(HInductionVarAnalysis::kLinear,/** Constructs a polynomial sum(a * i + b) + c induction. */ ) {return iva_->CreateInduction(HInductionVarAnalysis::kPolynomial,/** Constructs a geometric a * f^i + b induction. */ char return iva_->CreateInduction(HInductionVarAnalysis::kGeometric,'*' ? HInductionVarAnalysis::kMul/** Constructs a range [lo, hi] using a periodic induction. */ return iva_->CreateInduction(HInductionVarAnalysis::kPeriodic,/** Constructs a wrap-around induction consisting of a constant, followed by info. */ return iva_->CreateInduction(HInductionVarAnalysis::kWrapAround,/** Constructs a wrap-around induction consisting of a constant, followed by a range. */ nt32_t hi) {return CreateWrapAround(initial, CreateRange(lo, hi));// // Relay methods. // bool NeedsTripCount(HInductionVarAnalysis::InductionInfo* info) {// Use bogus loop information and context out of the bogus loop. 0 ;return range_.NeedsTripCount(context, &loop, info, &s);bool IsBodyTripCount(HInductionVarAnalysis::InductionInfo* trip) {return range_.IsBodyTripCount(trip);bool IsUnsafeTripCount(HInductionVarAnalysis::InductionInfo* trip) {return range_.IsUnsafeTripCount(trip);// Use bogus loop information and context out of the bogus loop. return GetMin(context, &loop, info, trip);return range_.GetVal(context, loop, info, trip, /*is_min=*/ true); // Use bogus loop information and context out of the bogus loop. return GetMax(context, &loop, info, trip);return range_.GetVal(context, loop, info, trip, /*is_min=*/ false); bool is_min) {// Use bogus loop information and context out of the bogus loop. return range_.GetMul(context, &loop, info1, info2, nullptr, is_min);bool is_min) {// Use bogus loop information and context out of the bogus loop. return range_.GetDiv(context, &loop, info1, info2, nullptr, is_min);// Use bogus loop information and context out of the bogus loop. return range_.GetRem(context, &loop, info1, info2);// Use bogus loop information and context out of the bogus loop. return range_.GetXor(context, &loop, info1, info2);bool IsExact(HInductionVarAnalysis::InductionInfo* info, int64_t* value) {// Use bogus loop information and context out of the bogus loop. return range_.IsConstant(context, &loop, info, InductionVarRange::kExact, value);bool IsAtMost(HInductionVarAnalysis::InductionInfo* info, int64_t* value) {// Use bogus loop information and context out of the bogus loop. return range_.IsConstant(context, &loop, info, InductionVarRange::kAtMost, value);bool IsAtLeast(HInductionVarAnalysis::InductionInfo* info, int64_t* value) {// Use bogus loop information and context out of the bogus loop. return range_.IsConstant(context, &loop, info, InductionVarRange::kAtLeast, value);return range_.AddValue(v1, v2); }return range_.SubValue(v1, v2); }return range_.MulValue(v1, v2); }return range_.DivValue(v1, v2); }return range_.MergeVal(v1, v2, true ); }return range_.MergeVal(v1, v2, false ); }// General building fields. // Instructions. // // Tests on private methods. // // Constant. 12345 ), &value));12345 , value);12345 ), &value));12345 , value);12345 ), &value));12345 , value);// Constant trivial range. 111 , 111 ), &value));111 , value);111 , 111 ), &value));111 , value);111 , 111 ), &value));111 , value);// Constant non-trivial range. 11 , 22 ), &value));11 , 22 ), &value));22 , value);11 , 22 ), &value));11 , value);// Symbolic. 1 )));1 , 1 )));1 , 2 , 3 )));1 , CreateLinear(1 , 1 ))));100 , true , true )));100 , true , false )));100 , false , true )));100 , false , false )));100 , true , true )));100 , true , false )));100 , false , true )));100 , false , false )));12 ),'+' , CreateConst(2 ), CreateRange(10 , 20 )), nullptr));22 ),'+' , CreateConst(2 ), CreateRange(10 , 20 )), nullptr));1 , -20 ),'+' , CreateFetch(x_), CreateRange(-20 , -10 )), nullptr));1 , -10 ),'+' , CreateFetch(x_), CreateRange(-20 , -10 )), nullptr));1 , 10 ),'+' , CreateRange(10 , 20 ), CreateFetch(x_)), nullptr));1 , 20 ),'+' , CreateRange(10 , 20 ), CreateFetch(x_)), nullptr));5 ),'+' , CreateRange(-5 , -1 ), CreateRange(10 , 20 )), nullptr));19 ),'+' , CreateRange(-5 , -1 ), CreateRange(10 , 20 )), nullptr));18 ),'-' , CreateConst(2 ), CreateRange(10 , 20 )), nullptr));8 ),'-' , CreateConst(2 ), CreateRange(10 , 20 )), nullptr));1 , 10 ),'-' , CreateFetch(x_), CreateRange(-20 , -10 )), nullptr));1 , 20 ),'-' , CreateFetch(x_), CreateRange(-20 , -10 )), nullptr));1 , 10 ),'-' , CreateRange(10 , 20 ), CreateFetch(x_)), nullptr));1 , 20 ),'-' , CreateRange(10 , 20 ), CreateFetch(x_)), nullptr));25 ),'-' , CreateRange(-5 , -1 ), CreateRange(10 , 20 )), nullptr));11 ),'-' , CreateRange(-5 , -1 ), CreateRange(10 , 20 )), nullptr));20 ), GetMin(CreateInvariant('n' , nullptr, CreateRange(10 , 20 )), nullptr));10 ), GetMax(CreateInvariant('n' , nullptr, CreateRange(10 , 20 )), nullptr));10 ), GetMin(CreateInvariant('n' , nullptr, CreateRange(-20 , -10 )), nullptr));20 ), GetMax(CreateInvariant('n' , nullptr, CreateRange(-20 , -10 )), nullptr));1 , 0 ), GetMin(CreateInvariant('n' , nullptr, CreateFetch(x_)), nullptr));1 , 0 ), GetMax(CreateInvariant('n' , nullptr, CreateFetch(x_)), nullptr));20 ),'*' , CreateConst(2 ), CreateRange(10 , 20 )), nullptr));40 ),'*' , CreateConst(2 ), CreateRange(10 , 20 )), nullptr));3 ),'/' , CreateRange(12 , 20 ), CreateConst(4 )), nullptr));5 ),'/' , CreateRange(12 , 20 ), CreateConst(4 )), nullptr));12345 ), GetMin(CreateConst(12345 ), nullptr));12345 ), GetMax(CreateConst(12345 ), nullptr));1 , 0 ), GetMin(CreateFetch(x_), nullptr));1 , 0 ), GetMax(CreateFetch(x_), nullptr));0 , graph_->GetIntConstant(100 ), 1 );20 ),10 , 20 ), CreateTripCount(100 , true , true )));1020 ),10 , 20 ), CreateTripCount(100 , true , true )));20 ),10 , 20 ), CreateTripCount(100 , true , true )));1010 ),10 , 20 ), CreateTripCount(100 , true , true )));1020 ),10 , 20 ), CreateTripCount(100 , true , true )));1020 ),10 , 20 ), CreateTripCount(100 , true , true )));20 ),10 , 20 ), CreateTripCount(100 , true , true )));10 , 20 ), CreateTripCount(100 , true , true )));980 ),10 , 20 ), CreateTripCount(100 , true , true )));20 ),10 , 20 ), CreateTripCount(100 , true , true )));970 ),10 , 20 ), CreateTripCount(100 , true , true )));20 ),10 , 20 ), CreateTripCount(100 , true , true )));980 ),10 , 20 ), CreateTripCount(100 , true , true )));980 ),10 , 20 ), CreateTripCount(100 , true , true )));10 , 20 ), CreateTripCount(100 , true , true )));20 ),10 , 20 ), CreateTripCount(100 , true , true )));5 ), GetMin(CreateWrapAround(-5 , -1 , 10 ), nullptr));10 ), GetMax(CreateWrapAround(-5 , -1 , 10 ), nullptr));1 ), GetMin(CreateWrapAround(2 , -1 , 10 ), nullptr));10 ), GetMax(CreateWrapAround(2 , -1 , 10 ), nullptr));1 ), GetMin(CreateWrapAround(20 , -1 , 10 ), nullptr));20 ), GetMax(CreateWrapAround(20 , -1 , 10 ), nullptr));0 , graph_->GetIntConstant(100 ), 1 );3 , 5 , 7 ), nullptr));3 , 5 , 7 ), nullptr));7 ),3 , 5 , 7 ), CreateTripCount(5 , true , true )));62 ),3 , 5 , 7 ), CreateTripCount(5 , true , true )));7 ),3 , 5 , 7 ), CreateTripCount(5 , true , true )));45 ),3 , 5 , 7 ), CreateTripCount(5 , true , true )));62 ),3 , 5 , 7 ), CreateTripCount(5 , true , true )));62 ),3 , 5 , 7 ), CreateTripCount(5 , true , true )));7 ),3 , 5 , 7 ), CreateTripCount(5 , true , true )));3 , 5 , 7 ), CreateTripCount(5 , true , true )));7 ),3 , 5 , 7 ), CreateTripCount(10 , true , true )));192 ),3 , 5 , 7 ), CreateTripCount(10 , true , true )));7 ),3 , 5 , 7 ), CreateTripCount(10 , true , true )));160 ),3 , 5 , 7 ), CreateTripCount(10 , true , true )));192 ),3 , 5 , 7 ), CreateTripCount(10 , true , true )));192 ),3 , 5 , 7 ), CreateTripCount(10 , true , true )));7 ),3 , 5 , 7 ), CreateTripCount(10 , true , true )));3 , 5 , 7 ), CreateTripCount(10 , true , true )));7 ),11 , 13 , -7 ), CreateTripCount(5 , true , true )));168 ),11 , 13 , -7 ), CreateTripCount(5 , true , true )));7 ),11 , 13 , -7 ), CreateTripCount(5 , true , true )));111 ),11 , 13 , -7 ), CreateTripCount(5 , true , true )));168 ),11 , 13 , -7 ), CreateTripCount(5 , true , true )));168 ),11 , 13 , -7 ), CreateTripCount(5 , true , true )));7 ),11 , 13 , -7 ), CreateTripCount(5 , true , true )));11 , 13 , -7 ), CreateTripCount(5 , true , true )));7 ),11 , 13 , -7 ), CreateTripCount(10 , true , true )));618 ),11 , 13 , -7 ), CreateTripCount(10 , true , true )));7 ),11 , 13 , -7 ), CreateTripCount(10 , true , true )));506 ),11 , 13 , -7 ), CreateTripCount(10 , true , true )));618 ),11 , 13 , -7 ), CreateTripCount(10 , true , true )));618 ),11 , 13 , -7 ), CreateTripCount(10 , true , true )));7 ),11 , 13 , -7 ), CreateTripCount(10 , true , true )));11 , 13 , -7 ), CreateTripCount(10 , true , true )));3 , 5 , 7 ), CreateTripCount(10 , true , true )));3 , 5 , 7 ), CreateTripCount(10 , true , true )));3 , 5 , 7 ), CreateTripCount(10 , true , true )));3 , 5 , 7 ), CreateTripCount(10 , true , true )));3 , 5 , 7 ), CreateTripCount(10 , true , true )));3 , 5 , 7 ), CreateTripCount(10 , true , true )));3 , 5 , 7 ), CreateTripCount(10 , true , true )));3 , 5 , 7 ), CreateTripCount(10 , true , true )));3 , -5 , 7 ), CreateTripCount(10 , true , true )));3 , -5 , 7 ), CreateTripCount(10 , true , true )));3 , -5 , 7 ), CreateTripCount(10 , true , true )));3 , -5 , 7 ), CreateTripCount(10 , true , true )));3 , -5 , 7 ), CreateTripCount(10 , true , true )));3 , -5 , 7 ), CreateTripCount(10 , true , true )));3 , -5 , 7 ), CreateTripCount(10 , true , true )));3 , -5 , 7 ), CreateTripCount(10 , true , true )));1 , 1 , 1 , '*' ), nullptr));1 , 1 , 1 , '*' ), nullptr));5 ), GetMin(CreateGeometric(11 , 5 , 3 , '/' ), nullptr));16 ), GetMax(CreateGeometric(11 , 5 , 3 , '/' ), nullptr));5 ), GetMin(CreateGeometric(11 , -5 , 3 , '/' ), nullptr));6 ), GetMax(CreateGeometric(11 , -5 , 3 , '/' ), nullptr));6 ), GetMin(CreateGeometric(-11 , 5 , 3 , '/' ), nullptr));5 ), GetMax(CreateGeometric(-11 , 5 , 3 , '/' ), nullptr));16 ), GetMin(CreateGeometric(-11 , -5 , 3 , '/' ), nullptr));5 ), GetMax(CreateGeometric(-11 , -5 , 3 , '/' ), nullptr));2 ), GetMin(CreateRange(-2 , 99 ), nullptr));99 ), GetMax(CreateRange(-2 , 99 ), nullptr));14 ), GetMul(CreateConst(2 ), CreateRange(-7 , 8 ), true ));16 ), GetMul(CreateConst(-2 ), CreateRange(-7 , 8 ), true ));14 ), GetMul(CreateRange(-7 , 8 ), CreateConst(2 ), true ));16 ), GetMul(CreateRange(-7 , 8 ), CreateConst(-2 ), true ));6 ), GetMul(CreateRange(2 , 10 ), CreateRange(3 , 5 ), true ));50 ), GetMul(CreateRange(2 , 10 ), CreateRange(-5 , -3 ), true ));2 , 10 ), CreateRange(-1 , 1 ), true ));50 ), GetMul(CreateRange(-10 , -2 ), CreateRange(3 , 5 ), true ));6 ), GetMul(CreateRange(-10 , -2 ), CreateRange(-5 , -3 ), true ));10 , -2 ), CreateRange(-1 , 1 ), true ));1 , 1 ), CreateRange(2 , 10 ), true ));1 , 1 ), CreateRange(-10 , -2 ), true ));1 , 1 ), CreateRange(-1 , 1 ), true ));16 ), GetMul(CreateConst(2 ), CreateRange(-7 , 8 ), false ));14 ), GetMul(CreateConst(-2 ), CreateRange(-7 , 8 ), false ));16 ), GetMul(CreateRange(-7 , 8 ), CreateConst(2 ), false ));14 ), GetMul(CreateRange(-7 , 8 ), CreateConst(-2 ), false ));50 ), GetMul(CreateRange(2 , 10 ), CreateRange(3 , 5 ), false ));6 ), GetMul(CreateRange(2 , 10 ), CreateRange(-5 , -3 ), false ));2 , 10 ), CreateRange(-1 , 1 ), false ));6 ), GetMul(CreateRange(-10 , -2 ), CreateRange(3 , 5 ), false ));50 ), GetMul(CreateRange(-10 , -2 ), CreateRange(-5 , -3 ), false ));10 , -2 ), CreateRange(-1 , 1 ), false ));1 , 1 ), CreateRange(2 , 10 ), false ));1 , 1 ), CreateRange(-10 , -2 ), false ));1 , 1 ), CreateRange(-1 , 1 ), false ));5 ), GetDiv(CreateRange(-10 , 20 ), CreateConst(2 ), true ));10 ), GetDiv(CreateRange(-10 , 20 ), CreateConst(-2 ), true ));10 ), GetDiv(CreateRange(40 , 1000 ), CreateRange(2 , 4 ), true ));500 ), GetDiv(CreateRange(40 , 1000 ), CreateRange(-4 , -2 ), true ));40 , 1000 ), CreateRange(-1 , 1 ), true ));500 ), GetDiv(CreateRange(-1000 , -40 ), CreateRange(2 , 4 ), true ));10 ), GetDiv(CreateRange(-1000 , -40 ), CreateRange(-4 , -2 ), true ));1000 , -40 ), CreateRange(-1 , 1 ), true ));1 , 1 ), CreateRange(40 , 1000 ), true ));1 , 1 ), CreateRange(-1000 , -40 ), true ));1 , 1 ), CreateRange(-1 , 1 ), true ));10 ), GetDiv(CreateRange(-10 , 20 ), CreateConst(2 ), false ));5 ), GetDiv(CreateRange(-10 , 20 ), CreateConst(-2 ), false ));500 ), GetDiv(CreateRange(40 , 1000 ), CreateRange(2 , 4 ), false ));10 ), GetDiv(CreateRange(40 , 1000 ), CreateRange(-4 , -2 ), false ));40 , 1000 ), CreateRange(-1 , 1 ), false ));10 ), GetDiv(CreateRange(-1000 , -40 ), CreateRange(2 , 4 ), false ));500 ), GetDiv(CreateRange(-1000 , -40 ), CreateRange(-4 , -2 ), false ));1000 , -40 ), CreateRange(-1 , 1 ), false ));1 , 1 ), CreateRange(40 , 1000 ), false ));1 , 1 ), CreateRange(-1000 , 40 ), false ));1 , 1 ), CreateRange(-1 , 1 ), false ));'%' , CreateConst(2 ), CreateRange(10 , 20 )), nullptr));'%' , CreateConst(2 ), CreateRange(10 , 20 )), nullptr));'%' , CreateRange(10 , 20 ), CreateConst(2 )), nullptr));'%' , CreateRange(10 , 20 ), CreateConst(2 )), nullptr));2 ), GetMin(CreateInvariant('%' , CreateConst(2 ), CreateConst(5 )), nullptr));2 ), GetMax(CreateInvariant('%' , CreateConst(2 ), CreateConst(5 )), nullptr));1 ), GetMin(CreateInvariant('%' , CreateConst(11 ), CreateConst(5 )), nullptr));1 ), GetMax(CreateInvariant('%' , CreateConst(11 ), CreateConst(5 )), nullptr));0 ), GetRem(CreateConst(1 ), CreateConst(1 )));2 ), GetRem(CreateConst(2 ), CreateConst(5 )));1 ), GetRem(CreateConst(11 ), CreateConst(5 )));2 ), GetRem(CreateConst(-2 ), CreateConst(5 )));1 ), GetRem(CreateConst(-11 ), CreateConst(5 )));2 ), GetRem(CreateConst(2 ), CreateConst(-5 )));1 ), GetRem(CreateConst(11 ), CreateConst(-5 )));2 ), GetRem(CreateConst(-2 ), CreateConst(-5 )));1 ), GetRem(CreateConst(-11 ), CreateConst(-5 )));1 ), CreateConst(0 )));'^' , CreateConst(2 ), CreateRange(10 , 20 )), nullptr));'^' , CreateConst(2 ), CreateRange(10 , 20 )), nullptr));'^' , CreateRange(10 , 20 ), CreateConst(2 )), nullptr));'^' , CreateRange(10 , 20 ), CreateConst(2 )), nullptr));3 ), GetMin(CreateInvariant('^' , CreateConst(1 ), CreateConst(2 )), nullptr));3 ), GetMax(CreateInvariant('^' , CreateConst(1 ), CreateConst(2 )), nullptr));0 ), GetXor(CreateConst(1 ), CreateConst(1 )));3 ), GetXor(CreateConst(1 ), CreateConst(2 )));2 ), GetXor(CreateConst(1 ), CreateConst(-1 )));0 ), GetXor(CreateConst(-1 ), CreateConst(-1 )));110 ), AddValue(Value(10 ), Value(100 )));5 ), AddValue(Value(x_, 1 , -4 ), Value(x_, -1 , -1 )));3 , -5 ), AddValue(Value(x_, 2 , -4 ), Value(x_, 1 , -1 )));1 , 5 ), Value(y_, 1 , -7 )));1 , 23 ), AddValue(Value(x_, 1 , 20 ), Value(3 )));1 , 5 ), AddValue(Value(55 ), Value(y_, 1 , -50 )));const int32_t max_value = std::numeric_limits<int32_t>::max();5 ), Value(5 )));5 ), Value(6 ))); // unsafe 90 ), SubValue(Value(10 ), Value(100 )));3 ), SubValue(Value(x_, 1 , -4 ), Value(x_, 1 , -1 )));2 , -3 ), SubValue(Value(x_, 3 , -4 ), Value(x_, 1 , -1 )));1 , 5 ), Value(y_, 1 , -7 )));1 , 17 ), SubValue(Value(x_, 1 , 20 ), Value(3 )));4 , 105 ), SubValue(Value(55 ), Value(y_, 4 , -50 )));const int32_t min_value = std::numeric_limits<int32_t>::min();5 ), Value(5 )));5 ), Value(6 ))); // unsafe 1000 ), MulValue(Value(10 ), Value(100 )));1 , -4 ), Value(x_, 1 , -1 )));1 , 5 ), Value(y_, 1 , -7 )));9 , 60 ), MulValue(Value(x_, 3 , 20 ), Value(3 )));55 , -110 ), MulValue(Value(55 ), Value(y_, 1 , -2 )));90000 ), Value(-90000 ))); // unsafe const int32_t min_value = std::numeric_limits<int32_t>::min();const int32_t max_value = std::numeric_limits<int32_t>::max();// Unsafe. 1 )));// Safe. 1 )));1 )));1 )));1 ), MulValue(Value(1 ), Value(-1 )));1 ), MulValue(Value(-1 ), Value(-1 )));25 ), DivValue(Value(100 ), Value(4 )));1 , -4 ), Value(x_, 1 , -1 )));1 , 5 ), Value(y_, 1 , -7 )));12 , 24 ), Value(3 )));55 ), Value(y_, 1 , -50 )));1 ), Value(0 ))); // unsafe const int32_t min_value = std::numeric_limits<int32_t>::min();const int32_t max_value = std::numeric_limits<int32_t>::max();// Unsafe. 1 )));// Safe. 1 ), DivValue(Value(min_value), Value(min_value)));1 ), DivValue(Value(max_value), Value(max_value)));1 )));1 )));1 )));1 ), DivValue(Value(1 ), Value(-1 )));1 ), DivValue(Value(-1 ), Value(-1 )));10 ), MinValue(Value(10 ), Value(100 )));1 , -4 ), MinValue(Value(x_, 1 , -4 ), Value(x_, 1 , -1 )));4 , -4 ), MinValue(Value(x_, 4 , -4 ), Value(x_, 4 , -1 )));1 , 5 ), Value(y_, 1 , -7 )));1 , 20 ), Value(3 )));55 ), Value(y_, 1 , -50 )));100 ), MaxValue(Value(10 ), Value(100 )));1 , -1 ), MaxValue(Value(x_, 1 , -4 ), Value(x_, 1 , -1 )));4 , -1 ), MaxValue(Value(x_, 4 , -4 ), Value(x_, 4 , -1 )));1 , 5 ), Value(y_, 1 , -7 )));1 , 20 ), Value(3 )));55 ), Value(y_, 1 , -50 )));// We pass a bogus constant for the class to avoid mocking one. /* cls= */ x_, /* length= */ x_); // With null hint: yields extreme constants. const int32_t max_value = std::numeric_limits<int32_t>::max();0 ), GetMin(CreateFetch(array_length), nullptr));// With explicit hint: yields the length instruction. 1 , 0 ), GetMin(CreateFetch(array_length), nullptr));1 , 0 ), GetMax(CreateFetch(array_length), nullptr));// With any non-null hint: chases beyond the length instruction. 1 , 0 ), GetMin(CreateFetch(array_length), nullptr));1 , 0 ), GetMax(CreateFetch(array_length), nullptr));1 );1 );1 , -1 ), GetMin(CreateFetch(add), nullptr));1 , -1 ), GetMax(CreateFetch(add), nullptr));1 , -1 ), GetMin(CreateFetch(alt), nullptr));1 , -1 ), GetMax(CreateFetch(alt), nullptr));1 , -1 ), GetMin(CreateFetch(sub), nullptr));1 , -1 ), GetMax(CreateFetch(sub), nullptr));1 , 1 ), GetMin(CreateFetch(rev), nullptr));1 , 1 ), GetMax(CreateFetch(rev), nullptr));// // Tests on public methods. // 0 , graph_->GetIntConstant(1000 ), 1 );bool needs_finite_test = true ;bool needs_taken_test = true ;0 );exit = exit_block_->GetLastInstruction();// In context of header: known. 0 ), v1);1000 ), v2);// In context of loop-body: known. 0 ), v1);999 ), v2);1 ), v1);1000 ), v2);// Induction vs. no-induction. exit ->GetBlock(), exit , &needs_finite_test, &needs_taken_test));exit ));// Last value (unsimplified). 1000 , last->InputAt(0 ));0 , last->InputAt(1 ));// Loop logic. 0 ;1000 , tc);0 , offset);1000 , tce);1000 , graph_->GetIntConstant(0 ), -1 );bool needs_finite_test = true ;bool needs_taken_test = true ;0 );exit = exit_block_->GetLastInstruction();// In context of header: known. 0 ), v1);1000 ), v2);// In context of loop-body: known. 1 ), v1);1000 ), v2);0 ), v1);999 ), v2);// Induction vs. no-induction. exit ->GetBlock(), exit , &needs_finite_test, &needs_taken_test));exit ));// Last value (unsimplified). We expect Sub(1000, Neg(-1000)) which is equivalent to Sub(1000, // 1000) aka 0. 1000 , last->InputAt(0 ));1 )->IsNeg());1000 , last->InputAt(1 )->AsNeg()->InputAt(0 ));// Loop logic. 0 ;1000 , tc);0 );0 , last->InputAt(0 ));1000 , last->InputAt(1 ));0 , x_, 1 );bool needs_finite_test = true ;bool needs_taken_test = true ;0 );// In context of header: upper unknown. 0 ), v1);// In context of loop-body: known. 0 ), v1);1 , -1 ), v2);1 ), v1);1 , 0 ), v2);// Can generate code in context of loop-body only. // Generates code (unsimplified). // Verify lower is 0+0. 0 , lower->InputAt(0 ));0 , lower->InputAt(1 ));// Verify upper is (V-1)+0. 0 )->IsSub());0 )->InputAt(0 )->IsParameterValue());1 , upper->InputAt(0 )->InputAt(1 ));0 , upper->InputAt(1 ));// Verify taken-test is 0<V. 0 , taken->InputAt(0 ));1 )->IsParameterValue());// Replacement. 1 ), v1);1 , 0 ), v2);// Loop logic. 0 ;0 , tc); // unknown 0 , offset);// guarded by taken-test 0 , tce->InputAt(0 ));1 )->IsParameterValue());2 )->IsLessThan());1000 , x_, -1 );bool needs_finite_test = true ;bool needs_taken_test = true ;0 );// In context of header: lower unknown. 1000 ), v2);// In context of loop-body: known. 1 , 1 ), v1);1000 ), v2);1 , 0 ), v1);999 ), v2);// Can generate code in context of loop-body only. // Generates code (unsimplified). // Verify lower is 1000-((1000-V)-1). 1000 , lower->InputAt(0 ));1 );1 , lower->InputAt(1 ));0 );1000 , lower->InputAt(0 ));1 )->IsParameterValue());// Verify upper is 1000-0. 1000 , upper->InputAt(0 ));0 , upper->InputAt(1 ));// Verify taken-test is 1000>V. 1000 , taken->InputAt(0 ));1 )->IsParameterValue());// Replacement. 1 , 0 ), v1);999 ), v2);// Loop logic. 0 ;0 , tc); // unknown // guarded by taken-test 0 , tce->InputAt(0 ));1 )->IsSub());2 )->IsGreaterThan());1 );1000 , taken->InputAt(0 ));1 )->IsParameterValue());// namespace art
Messung V0.5 in Prozent C=89 H=87 G=87
¤ Dauer der Verarbeitung: 0.8 Sekunden
(vorverarbeitet am 2026-06-29)
¤ *© Formatika GbR, Deutschland
