blob: 4ea170f6593efd1d7f106779803ae3df2fca9315 [file] [log] [blame]
Aart Bikd14c5952015-09-08 15:25:15 -07001/*
2 * Copyright (C) 2015 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
Aart Bikd14c5952015-09-08 15:25:15 -070017#include "base/arena_allocator.h"
18#include "builder.h"
Aart Bikd14c5952015-09-08 15:25:15 -070019#include "induction_var_analysis.h"
20#include "induction_var_range.h"
21#include "nodes.h"
22#include "optimizing_unit_test.h"
23
24namespace art {
25
26using Value = InductionVarRange::Value;
27
28/**
29 * Fixture class for the InductionVarRange tests.
30 */
David Brazdil4833f5a2015-12-16 10:37:39 +000031class InductionVarRangeTest : public CommonCompilerTest {
Aart Bikd14c5952015-09-08 15:25:15 -070032 public:
Aart Bik7d57d7f2015-12-09 14:39:48 -080033 InductionVarRangeTest()
34 : pool_(),
35 allocator_(&pool_),
36 graph_(CreateGraph(&allocator_)),
37 iva_(new (&allocator_) HInductionVarAnalysis(graph_)),
38 range_(iva_) {
Aart Bikd14c5952015-09-08 15:25:15 -070039 BuildGraph();
40 }
41
42 ~InductionVarRangeTest() { }
43
44 void ExpectEqual(Value v1, Value v2) {
45 EXPECT_EQ(v1.instruction, v2.instruction);
46 EXPECT_EQ(v1.a_constant, v2.a_constant);
47 EXPECT_EQ(v1.b_constant, v2.b_constant);
Aart Bikb3365e02015-09-21 14:45:05 -070048 EXPECT_EQ(v1.is_known, v2.is_known);
Aart Bikd14c5952015-09-08 15:25:15 -070049 }
50
Aart Bik389b3db2015-10-28 14:23:40 -070051 //
52 // Construction methods.
53 //
54
Aart Bikd14c5952015-09-08 15:25:15 -070055 /** Constructs bare minimum graph. */
56 void BuildGraph() {
57 graph_->SetNumberOfVRegs(1);
Aart Bikaec3cce2015-10-14 17:44:55 -070058 entry_block_ = new (&allocator_) HBasicBlock(graph_);
59 exit_block_ = new (&allocator_) HBasicBlock(graph_);
60 graph_->AddBlock(entry_block_);
61 graph_->AddBlock(exit_block_);
62 graph_->SetEntryBlock(entry_block_);
63 graph_->SetExitBlock(exit_block_);
Aart Bik7d57d7f2015-12-09 14:39:48 -080064 // Two parameters.
65 x_ = new (&allocator_) HParameterValue(graph_->GetDexFile(), 0, 0, Primitive::kPrimInt);
66 entry_block_->AddInstruction(x_);
67 y_ = new (&allocator_) HParameterValue(graph_->GetDexFile(), 0, 0, Primitive::kPrimInt);
68 entry_block_->AddInstruction(y_);
Aart Bik52be7e72016-06-23 11:20:41 -070069 // Set arbitrary range analysis hint while testing private methods.
70 SetHint(x_);
Aart Bikaec3cce2015-10-14 17:44:55 -070071 }
72
73 /** Constructs loop with given upper bound. */
Aart Bik389b3db2015-10-28 14:23:40 -070074 void BuildLoop(int32_t lower, HInstruction* upper, int32_t stride) {
Aart Bikaec3cce2015-10-14 17:44:55 -070075 // Control flow.
76 loop_preheader_ = new (&allocator_) HBasicBlock(graph_);
77 graph_->AddBlock(loop_preheader_);
78 HBasicBlock* loop_header = new (&allocator_) HBasicBlock(graph_);
79 graph_->AddBlock(loop_header);
80 HBasicBlock* loop_body = new (&allocator_) HBasicBlock(graph_);
81 graph_->AddBlock(loop_body);
David Brazdildb51efb2015-11-06 01:36:20 +000082 HBasicBlock* return_block = new (&allocator_) HBasicBlock(graph_);
83 graph_->AddBlock(return_block);
Aart Bikaec3cce2015-10-14 17:44:55 -070084 entry_block_->AddSuccessor(loop_preheader_);
85 loop_preheader_->AddSuccessor(loop_header);
86 loop_header->AddSuccessor(loop_body);
David Brazdildb51efb2015-11-06 01:36:20 +000087 loop_header->AddSuccessor(return_block);
Aart Bikaec3cce2015-10-14 17:44:55 -070088 loop_body->AddSuccessor(loop_header);
David Brazdildb51efb2015-11-06 01:36:20 +000089 return_block->AddSuccessor(exit_block_);
Aart Bikaec3cce2015-10-14 17:44:55 -070090 // Instructions.
Aart Bikaec3cce2015-10-14 17:44:55 -070091 loop_preheader_->AddInstruction(new (&allocator_) HGoto());
David Brazdilbadd8262016-02-02 16:28:56 +000092 HPhi* phi = new (&allocator_) HPhi(&allocator_, 0, 0, Primitive::kPrimInt);
93 loop_header->AddPhi(phi);
94 phi->AddInput(graph_->GetIntConstant(lower)); // i = l
Aart Bik389b3db2015-10-28 14:23:40 -070095 if (stride > 0) {
David Brazdilbadd8262016-02-02 16:28:56 +000096 condition_ = new (&allocator_) HLessThan(phi, upper); // i < u
Aart Bik389b3db2015-10-28 14:23:40 -070097 } else {
David Brazdilbadd8262016-02-02 16:28:56 +000098 condition_ = new (&allocator_) HGreaterThan(phi, upper); // i > u
Aart Bik389b3db2015-10-28 14:23:40 -070099 }
Aart Bikaec3cce2015-10-14 17:44:55 -0700100 loop_header->AddInstruction(condition_);
Aart Bik389b3db2015-10-28 14:23:40 -0700101 loop_header->AddInstruction(new (&allocator_) HIf(condition_));
David Brazdilbadd8262016-02-02 16:28:56 +0000102 increment_ = new (&allocator_) HAdd(Primitive::kPrimInt, phi, graph_->GetIntConstant(stride));
103 loop_body->AddInstruction(increment_); // i += s
104 phi->AddInput(increment_);
Aart Bikaec3cce2015-10-14 17:44:55 -0700105 loop_body->AddInstruction(new (&allocator_) HGoto());
David Brazdildb51efb2015-11-06 01:36:20 +0000106 return_block->AddInstruction(new (&allocator_) HReturnVoid());
107 exit_block_->AddInstruction(new (&allocator_) HExit());
Aart Bikaec3cce2015-10-14 17:44:55 -0700108 }
109
Aart Bik7d57d7f2015-12-09 14:39:48 -0800110 /** Constructs SSA and performs induction variable analysis. */
Aart Bikaec3cce2015-10-14 17:44:55 -0700111 void PerformInductionVarAnalysis() {
David Brazdilbadd8262016-02-02 16:28:56 +0000112 graph_->BuildDominatorTree();
Aart Bikaec3cce2015-10-14 17:44:55 -0700113 iva_->Run();
Aart Bikd14c5952015-09-08 15:25:15 -0700114 }
115
Aart Bik52be7e72016-06-23 11:20:41 -0700116 /** Sets hint. */
117 void SetHint(HInstruction* hint) {
118 range_.chase_hint_ = hint;
119 }
120
Aart Bikd14c5952015-09-08 15:25:15 -0700121 /** Constructs an invariant. */
122 HInductionVarAnalysis::InductionInfo* CreateInvariant(char opc,
123 HInductionVarAnalysis::InductionInfo* a,
124 HInductionVarAnalysis::InductionInfo* b) {
125 HInductionVarAnalysis::InductionOp op;
126 switch (opc) {
127 case '+': op = HInductionVarAnalysis::kAdd; break;
128 case '-': op = HInductionVarAnalysis::kSub; break;
129 case 'n': op = HInductionVarAnalysis::kNeg; break;
130 case '*': op = HInductionVarAnalysis::kMul; break;
131 case '/': op = HInductionVarAnalysis::kDiv; break;
Aart Bik52be7e72016-06-23 11:20:41 -0700132 case '<': op = HInductionVarAnalysis::kLT; break;
Aart Bikd14c5952015-09-08 15:25:15 -0700133 default: op = HInductionVarAnalysis::kNop; break;
134 }
135 return iva_->CreateInvariantOp(op, a, b);
136 }
137
138 /** Constructs a fetch. */
139 HInductionVarAnalysis::InductionInfo* CreateFetch(HInstruction* fetch) {
140 return iva_->CreateInvariantFetch(fetch);
141 }
142
143 /** Constructs a constant. */
144 HInductionVarAnalysis::InductionInfo* CreateConst(int32_t c) {
145 return CreateFetch(graph_->GetIntConstant(c));
146 }
147
Aart Bik52be7e72016-06-23 11:20:41 -0700148 /** Constructs a constant trip-count. */
Aart Bik389b3db2015-10-28 14:23:40 -0700149 HInductionVarAnalysis::InductionInfo* CreateTripCount(int32_t tc, bool in_loop, bool safe) {
Aart Bik52be7e72016-06-23 11:20:41 -0700150 HInductionVarAnalysis::InductionOp op = HInductionVarAnalysis::kTripCountInBodyUnsafe;
Aart Bik389b3db2015-10-28 14:23:40 -0700151 if (in_loop && safe) {
Aart Bik52be7e72016-06-23 11:20:41 -0700152 op = HInductionVarAnalysis::kTripCountInLoop;
Aart Bik389b3db2015-10-28 14:23:40 -0700153 } else if (in_loop) {
Aart Bik52be7e72016-06-23 11:20:41 -0700154 op = HInductionVarAnalysis::kTripCountInLoopUnsafe;
Aart Bik389b3db2015-10-28 14:23:40 -0700155 } else if (safe) {
Aart Bik52be7e72016-06-23 11:20:41 -0700156 op = HInductionVarAnalysis::kTripCountInBody;
Aart Bik389b3db2015-10-28 14:23:40 -0700157 }
Aart Bik52be7e72016-06-23 11:20:41 -0700158 // Return TC with taken-test 0 < TC.
159 return iva_->CreateTripCount(op,
160 CreateConst(tc),
161 CreateInvariant('<', CreateConst(0), CreateConst(tc)),
162 Primitive::kPrimInt);
Aart Bikd14c5952015-09-08 15:25:15 -0700163 }
164
165 /** Constructs a linear a * i + b induction. */
166 HInductionVarAnalysis::InductionInfo* CreateLinear(int32_t a, int32_t b) {
Aart Bik0d345cf2016-03-16 10:49:38 -0700167 return iva_->CreateInduction(
168 HInductionVarAnalysis::kLinear, CreateConst(a), CreateConst(b), Primitive::kPrimInt);
Aart Bikd14c5952015-09-08 15:25:15 -0700169 }
170
171 /** Constructs a range [lo, hi] using a periodic induction. */
172 HInductionVarAnalysis::InductionInfo* CreateRange(int32_t lo, int32_t hi) {
173 return iva_->CreateInduction(
Aart Bik0d345cf2016-03-16 10:49:38 -0700174 HInductionVarAnalysis::kPeriodic, CreateConst(lo), CreateConst(hi), Primitive::kPrimInt);
Aart Bikd14c5952015-09-08 15:25:15 -0700175 }
176
Aart Bik389b3db2015-10-28 14:23:40 -0700177 /** Constructs a wrap-around induction consisting of a constant, followed info */
178 HInductionVarAnalysis::InductionInfo* CreateWrapAround(
179 int32_t initial,
180 HInductionVarAnalysis::InductionInfo* info) {
Aart Bik0d345cf2016-03-16 10:49:38 -0700181 return iva_->CreateInduction(
182 HInductionVarAnalysis::kWrapAround, CreateConst(initial), info, Primitive::kPrimInt);
Aart Bik389b3db2015-10-28 14:23:40 -0700183 }
184
Aart Bikd14c5952015-09-08 15:25:15 -0700185 /** Constructs a wrap-around induction consisting of a constant, followed by a range. */
186 HInductionVarAnalysis::InductionInfo* CreateWrapAround(int32_t initial, int32_t lo, int32_t hi) {
Aart Bik389b3db2015-10-28 14:23:40 -0700187 return CreateWrapAround(initial, CreateRange(lo, hi));
Aart Bikd14c5952015-09-08 15:25:15 -0700188 }
189
190 //
191 // Relay methods.
192 //
193
Aart Bik389b3db2015-10-28 14:23:40 -0700194 bool NeedsTripCount(HInductionVarAnalysis::InductionInfo* info) {
Aart Bik7d57d7f2015-12-09 14:39:48 -0800195 return range_.NeedsTripCount(info);
Aart Bik389b3db2015-10-28 14:23:40 -0700196 }
197
198 bool IsBodyTripCount(HInductionVarAnalysis::InductionInfo* trip) {
Aart Bik7d57d7f2015-12-09 14:39:48 -0800199 return range_.IsBodyTripCount(trip);
Aart Bik389b3db2015-10-28 14:23:40 -0700200 }
201
202 bool IsUnsafeTripCount(HInductionVarAnalysis::InductionInfo* trip) {
Aart Bik7d57d7f2015-12-09 14:39:48 -0800203 return range_.IsUnsafeTripCount(trip);
Aart Bik389b3db2015-10-28 14:23:40 -0700204 }
205
Aart Bikd14c5952015-09-08 15:25:15 -0700206 Value GetMin(HInductionVarAnalysis::InductionInfo* info,
Aart Bik52be7e72016-06-23 11:20:41 -0700207 HInductionVarAnalysis::InductionInfo* trip) {
208 return range_.GetVal(info, trip, /* in_body */ true, /* is_min */ true);
Aart Bikd14c5952015-09-08 15:25:15 -0700209 }
210
211 Value GetMax(HInductionVarAnalysis::InductionInfo* info,
Aart Bik52be7e72016-06-23 11:20:41 -0700212 HInductionVarAnalysis::InductionInfo* trip) {
213 return range_.GetVal(info, trip, /* in_body */ true, /* is_min */ false);
Aart Bikd14c5952015-09-08 15:25:15 -0700214 }
215
216 Value GetMul(HInductionVarAnalysis::InductionInfo* info1,
Aart Bikb3365e02015-09-21 14:45:05 -0700217 HInductionVarAnalysis::InductionInfo* info2,
218 bool is_min) {
Aart Bik7d57d7f2015-12-09 14:39:48 -0800219 return range_.GetMul(info1, info2, nullptr, /* in_body */ true, is_min);
Aart Bikd14c5952015-09-08 15:25:15 -0700220 }
221
222 Value GetDiv(HInductionVarAnalysis::InductionInfo* info1,
Aart Bikb3365e02015-09-21 14:45:05 -0700223 HInductionVarAnalysis::InductionInfo* info2,
224 bool is_min) {
Aart Bik7d57d7f2015-12-09 14:39:48 -0800225 return range_.GetDiv(info1, info2, nullptr, /* in_body */ true, is_min);
Aart Bik9401f532015-09-28 16:25:56 -0700226 }
227
Aart Bik97412c922016-02-19 20:14:38 -0800228 bool IsExact(HInductionVarAnalysis::InductionInfo* info, int64_t* value) {
229 return range_.IsConstant(info, InductionVarRange::kExact, value);
230 }
231
232 bool IsAtMost(HInductionVarAnalysis::InductionInfo* info, int64_t* value) {
233 return range_.IsConstant(info, InductionVarRange::kAtMost, value);
234 }
235
236 bool IsAtLeast(HInductionVarAnalysis::InductionInfo* info, int64_t* value) {
237 return range_.IsConstant(info, InductionVarRange::kAtLeast, value);
Aart Bikd14c5952015-09-08 15:25:15 -0700238 }
239
Aart Bik7d57d7f2015-12-09 14:39:48 -0800240 Value AddValue(Value v1, Value v2) { return range_.AddValue(v1, v2); }
241 Value SubValue(Value v1, Value v2) { return range_.SubValue(v1, v2); }
242 Value MulValue(Value v1, Value v2) { return range_.MulValue(v1, v2); }
243 Value DivValue(Value v1, Value v2) { return range_.DivValue(v1, v2); }
244 Value MinValue(Value v1, Value v2) { return range_.MergeVal(v1, v2, true); }
245 Value MaxValue(Value v1, Value v2) { return range_.MergeVal(v1, v2, false); }
Aart Bikd14c5952015-09-08 15:25:15 -0700246
247 // General building fields.
248 ArenaPool pool_;
249 ArenaAllocator allocator_;
250 HGraph* graph_;
Aart Bikaec3cce2015-10-14 17:44:55 -0700251 HBasicBlock* entry_block_;
252 HBasicBlock* exit_block_;
253 HBasicBlock* loop_preheader_;
Aart Bikd14c5952015-09-08 15:25:15 -0700254 HInductionVarAnalysis* iva_;
Aart Bik7d57d7f2015-12-09 14:39:48 -0800255 InductionVarRange range_;
Aart Bikd14c5952015-09-08 15:25:15 -0700256
Aart Bikaec3cce2015-10-14 17:44:55 -0700257 // Instructions.
258 HInstruction* condition_;
259 HInstruction* increment_;
Aart Bik7d57d7f2015-12-09 14:39:48 -0800260 HInstruction* x_;
261 HInstruction* y_;
Aart Bikd14c5952015-09-08 15:25:15 -0700262};
263
264//
Aart Bik7d57d7f2015-12-09 14:39:48 -0800265// Tests on private methods.
Aart Bikd14c5952015-09-08 15:25:15 -0700266//
267
Aart Bik97412c922016-02-19 20:14:38 -0800268TEST_F(InductionVarRangeTest, IsConstant) {
269 int64_t value;
270 // Constant.
271 EXPECT_TRUE(IsExact(CreateConst(12345), &value));
272 EXPECT_EQ(12345, value);
273 EXPECT_TRUE(IsAtMost(CreateConst(12345), &value));
274 EXPECT_EQ(12345, value);
275 EXPECT_TRUE(IsAtLeast(CreateConst(12345), &value));
276 EXPECT_EQ(12345, value);
277 // Constant trivial range.
278 EXPECT_TRUE(IsExact(CreateRange(111, 111), &value));
279 EXPECT_EQ(111, value);
280 EXPECT_TRUE(IsAtMost(CreateRange(111, 111), &value));
281 EXPECT_EQ(111, value);
282 EXPECT_TRUE(IsAtLeast(CreateRange(111, 111), &value));
283 EXPECT_EQ(111, value);
284 // Constant non-trivial range.
285 EXPECT_FALSE(IsExact(CreateRange(11, 22), &value));
286 EXPECT_TRUE(IsAtMost(CreateRange(11, 22), &value));
287 EXPECT_EQ(22, value);
288 EXPECT_TRUE(IsAtLeast(CreateRange(11, 22), &value));
289 EXPECT_EQ(11, value);
290 // Symbolic.
291 EXPECT_FALSE(IsExact(CreateFetch(x_), &value));
292 EXPECT_FALSE(IsAtMost(CreateFetch(x_), &value));
293 EXPECT_FALSE(IsAtLeast(CreateFetch(x_), &value));
294}
295
Aart Bik389b3db2015-10-28 14:23:40 -0700296TEST_F(InductionVarRangeTest, TripCountProperties) {
297 EXPECT_FALSE(NeedsTripCount(nullptr));
298 EXPECT_FALSE(NeedsTripCount(CreateConst(1)));
299 EXPECT_TRUE(NeedsTripCount(CreateLinear(1, 1)));
300 EXPECT_FALSE(NeedsTripCount(CreateWrapAround(1, 2, 3)));
301 EXPECT_TRUE(NeedsTripCount(CreateWrapAround(1, CreateLinear(1, 1))));
302
303 EXPECT_FALSE(IsBodyTripCount(nullptr));
304 EXPECT_FALSE(IsBodyTripCount(CreateTripCount(100, true, true)));
305 EXPECT_FALSE(IsBodyTripCount(CreateTripCount(100, true, false)));
306 EXPECT_TRUE(IsBodyTripCount(CreateTripCount(100, false, true)));
307 EXPECT_TRUE(IsBodyTripCount(CreateTripCount(100, false, false)));
308
309 EXPECT_FALSE(IsUnsafeTripCount(nullptr));
310 EXPECT_FALSE(IsUnsafeTripCount(CreateTripCount(100, true, true)));
311 EXPECT_TRUE(IsUnsafeTripCount(CreateTripCount(100, true, false)));
312 EXPECT_FALSE(IsUnsafeTripCount(CreateTripCount(100, false, true)));
313 EXPECT_TRUE(IsUnsafeTripCount(CreateTripCount(100, false, false)));
314}
315
Aart Bikd14c5952015-09-08 15:25:15 -0700316TEST_F(InductionVarRangeTest, GetMinMaxNull) {
Aart Bikb3365e02015-09-21 14:45:05 -0700317 ExpectEqual(Value(), GetMin(nullptr, nullptr));
318 ExpectEqual(Value(), GetMax(nullptr, nullptr));
Aart Bikd14c5952015-09-08 15:25:15 -0700319}
320
321TEST_F(InductionVarRangeTest, GetMinMaxAdd) {
322 ExpectEqual(Value(12),
323 GetMin(CreateInvariant('+', CreateConst(2), CreateRange(10, 20)), nullptr));
324 ExpectEqual(Value(22),
325 GetMax(CreateInvariant('+', CreateConst(2), CreateRange(10, 20)), nullptr));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800326 ExpectEqual(Value(x_, 1, -20),
327 GetMin(CreateInvariant('+', CreateFetch(x_), CreateRange(-20, -10)), nullptr));
328 ExpectEqual(Value(x_, 1, -10),
329 GetMax(CreateInvariant('+', CreateFetch(x_), CreateRange(-20, -10)), nullptr));
330 ExpectEqual(Value(x_, 1, 10),
331 GetMin(CreateInvariant('+', CreateRange(10, 20), CreateFetch(x_)), nullptr));
332 ExpectEqual(Value(x_, 1, 20),
333 GetMax(CreateInvariant('+', CreateRange(10, 20), CreateFetch(x_)), nullptr));
Aart Bikd14c5952015-09-08 15:25:15 -0700334 ExpectEqual(Value(5),
335 GetMin(CreateInvariant('+', CreateRange(-5, -1), CreateRange(10, 20)), nullptr));
336 ExpectEqual(Value(19),
337 GetMax(CreateInvariant('+', CreateRange(-5, -1), CreateRange(10, 20)), nullptr));
338}
339
340TEST_F(InductionVarRangeTest, GetMinMaxSub) {
341 ExpectEqual(Value(-18),
342 GetMin(CreateInvariant('-', CreateConst(2), CreateRange(10, 20)), nullptr));
343 ExpectEqual(Value(-8),
344 GetMax(CreateInvariant('-', CreateConst(2), CreateRange(10, 20)), nullptr));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800345 ExpectEqual(Value(x_, 1, 10),
346 GetMin(CreateInvariant('-', CreateFetch(x_), CreateRange(-20, -10)), nullptr));
347 ExpectEqual(Value(x_, 1, 20),
348 GetMax(CreateInvariant('-', CreateFetch(x_), CreateRange(-20, -10)), nullptr));
349 ExpectEqual(Value(x_, -1, 10),
350 GetMin(CreateInvariant('-', CreateRange(10, 20), CreateFetch(x_)), nullptr));
351 ExpectEqual(Value(x_, -1, 20),
352 GetMax(CreateInvariant('-', CreateRange(10, 20), CreateFetch(x_)), nullptr));
Aart Bikd14c5952015-09-08 15:25:15 -0700353 ExpectEqual(Value(-25),
354 GetMin(CreateInvariant('-', CreateRange(-5, -1), CreateRange(10, 20)), nullptr));
355 ExpectEqual(Value(-11),
356 GetMax(CreateInvariant('-', CreateRange(-5, -1), CreateRange(10, 20)), nullptr));
357}
358
359TEST_F(InductionVarRangeTest, GetMinMaxNeg) {
360 ExpectEqual(Value(-20), GetMin(CreateInvariant('n', nullptr, CreateRange(10, 20)), nullptr));
361 ExpectEqual(Value(-10), GetMax(CreateInvariant('n', nullptr, CreateRange(10, 20)), nullptr));
362 ExpectEqual(Value(10), GetMin(CreateInvariant('n', nullptr, CreateRange(-20, -10)), nullptr));
363 ExpectEqual(Value(20), GetMax(CreateInvariant('n', nullptr, CreateRange(-20, -10)), nullptr));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800364 ExpectEqual(Value(x_, -1, 0), GetMin(CreateInvariant('n', nullptr, CreateFetch(x_)), nullptr));
365 ExpectEqual(Value(x_, -1, 0), GetMax(CreateInvariant('n', nullptr, CreateFetch(x_)), nullptr));
Aart Bikd14c5952015-09-08 15:25:15 -0700366}
367
368TEST_F(InductionVarRangeTest, GetMinMaxMul) {
369 ExpectEqual(Value(20),
370 GetMin(CreateInvariant('*', CreateConst(2), CreateRange(10, 20)), nullptr));
371 ExpectEqual(Value(40),
372 GetMax(CreateInvariant('*', CreateConst(2), CreateRange(10, 20)), nullptr));
373}
374
375TEST_F(InductionVarRangeTest, GetMinMaxDiv) {
376 ExpectEqual(Value(3),
377 GetMin(CreateInvariant('/', CreateRange(12, 20), CreateConst(4)), nullptr));
378 ExpectEqual(Value(5),
379 GetMax(CreateInvariant('/', CreateRange(12, 20), CreateConst(4)), nullptr));
380}
381
382TEST_F(InductionVarRangeTest, GetMinMaxConstant) {
383 ExpectEqual(Value(12345), GetMin(CreateConst(12345), nullptr));
384 ExpectEqual(Value(12345), GetMax(CreateConst(12345), nullptr));
385}
386
387TEST_F(InductionVarRangeTest, GetMinMaxFetch) {
Aart Bik7d57d7f2015-12-09 14:39:48 -0800388 ExpectEqual(Value(x_, 1, 0), GetMin(CreateFetch(x_), nullptr));
389 ExpectEqual(Value(x_, 1, 0), GetMax(CreateFetch(x_), nullptr));
Aart Bikd14c5952015-09-08 15:25:15 -0700390}
391
392TEST_F(InductionVarRangeTest, GetMinMaxLinear) {
Aart Bik389b3db2015-10-28 14:23:40 -0700393 ExpectEqual(Value(20), GetMin(CreateLinear(10, 20), CreateTripCount(100, true, true)));
394 ExpectEqual(Value(1010), GetMax(CreateLinear(10, 20), CreateTripCount(100, true, true)));
395 ExpectEqual(Value(-970), GetMin(CreateLinear(-10, 20), CreateTripCount(100, true, true)));
396 ExpectEqual(Value(20), GetMax(CreateLinear(-10, 20), CreateTripCount(100, true, true)));
Aart Bikd14c5952015-09-08 15:25:15 -0700397}
398
399TEST_F(InductionVarRangeTest, GetMinMaxWrapAround) {
400 ExpectEqual(Value(-5), GetMin(CreateWrapAround(-5, -1, 10), nullptr));
401 ExpectEqual(Value(10), GetMax(CreateWrapAround(-5, -1, 10), nullptr));
402 ExpectEqual(Value(-1), GetMin(CreateWrapAround(2, -1, 10), nullptr));
403 ExpectEqual(Value(10), GetMax(CreateWrapAround(2, -1, 10), nullptr));
404 ExpectEqual(Value(-1), GetMin(CreateWrapAround(20, -1, 10), nullptr));
405 ExpectEqual(Value(20), GetMax(CreateWrapAround(20, -1, 10), nullptr));
406}
407
408TEST_F(InductionVarRangeTest, GetMinMaxPeriodic) {
409 ExpectEqual(Value(-2), GetMin(CreateRange(-2, 99), nullptr));
410 ExpectEqual(Value(99), GetMax(CreateRange(-2, 99), nullptr));
411}
412
413TEST_F(InductionVarRangeTest, GetMulMin) {
Aart Bik97412c922016-02-19 20:14:38 -0800414 ExpectEqual(Value(-14), GetMul(CreateConst(2), CreateRange(-7, 8), true));
415 ExpectEqual(Value(-16), GetMul(CreateConst(-2), CreateRange(-7, 8), true));
416 ExpectEqual(Value(-14), GetMul(CreateRange(-7, 8), CreateConst(2), true));
417 ExpectEqual(Value(-16), GetMul(CreateRange(-7, 8), CreateConst(-2), true));
Aart Bikb3365e02015-09-21 14:45:05 -0700418 ExpectEqual(Value(6), GetMul(CreateRange(2, 10), CreateRange(3, 5), true));
419 ExpectEqual(Value(-50), GetMul(CreateRange(2, 10), CreateRange(-5, -3), true));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800420 ExpectEqual(Value(), GetMul(CreateRange(2, 10), CreateRange(-1, 1), true));
Aart Bikb3365e02015-09-21 14:45:05 -0700421 ExpectEqual(Value(-50), GetMul(CreateRange(-10, -2), CreateRange(3, 5), true));
422 ExpectEqual(Value(6), GetMul(CreateRange(-10, -2), CreateRange(-5, -3), true));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800423 ExpectEqual(Value(), GetMul(CreateRange(-10, -2), CreateRange(-1, 1), true));
424 ExpectEqual(Value(), GetMul(CreateRange(-1, 1), CreateRange(2, 10), true));
425 ExpectEqual(Value(), GetMul(CreateRange(-1, 1), CreateRange(-10, -2), true));
426 ExpectEqual(Value(), GetMul(CreateRange(-1, 1), CreateRange(-1, 1), true));
Aart Bikd14c5952015-09-08 15:25:15 -0700427}
428
429TEST_F(InductionVarRangeTest, GetMulMax) {
Aart Bik97412c922016-02-19 20:14:38 -0800430 ExpectEqual(Value(16), GetMul(CreateConst(2), CreateRange(-7, 8), false));
431 ExpectEqual(Value(14), GetMul(CreateConst(-2), CreateRange(-7, 8), false));
432 ExpectEqual(Value(16), GetMul(CreateRange(-7, 8), CreateConst(2), false));
433 ExpectEqual(Value(14), GetMul(CreateRange(-7, 8), CreateConst(-2), false));
Aart Bikb3365e02015-09-21 14:45:05 -0700434 ExpectEqual(Value(50), GetMul(CreateRange(2, 10), CreateRange(3, 5), false));
435 ExpectEqual(Value(-6), GetMul(CreateRange(2, 10), CreateRange(-5, -3), false));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800436 ExpectEqual(Value(), GetMul(CreateRange(2, 10), CreateRange(-1, 1), false));
Aart Bikb3365e02015-09-21 14:45:05 -0700437 ExpectEqual(Value(-6), GetMul(CreateRange(-10, -2), CreateRange(3, 5), false));
438 ExpectEqual(Value(50), GetMul(CreateRange(-10, -2), CreateRange(-5, -3), false));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800439 ExpectEqual(Value(), GetMul(CreateRange(-10, -2), CreateRange(-1, 1), false));
440 ExpectEqual(Value(), GetMul(CreateRange(-1, 1), CreateRange(2, 10), false));
441 ExpectEqual(Value(), GetMul(CreateRange(-1, 1), CreateRange(-10, -2), false));
442 ExpectEqual(Value(), GetMul(CreateRange(-1, 1), CreateRange(-1, 1), false));
Aart Bikd14c5952015-09-08 15:25:15 -0700443}
444
445TEST_F(InductionVarRangeTest, GetDivMin) {
Aart Bik97412c922016-02-19 20:14:38 -0800446 ExpectEqual(Value(-5), GetDiv(CreateRange(-10, 20), CreateConst(2), true));
447 ExpectEqual(Value(-10), GetDiv(CreateRange(-10, 20), CreateConst(-2), true));
Aart Bikb3365e02015-09-21 14:45:05 -0700448 ExpectEqual(Value(10), GetDiv(CreateRange(40, 1000), CreateRange(2, 4), true));
449 ExpectEqual(Value(-500), GetDiv(CreateRange(40, 1000), CreateRange(-4, -2), true));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800450 ExpectEqual(Value(), GetDiv(CreateRange(40, 1000), CreateRange(-1, 1), true));
Aart Bikb3365e02015-09-21 14:45:05 -0700451 ExpectEqual(Value(-500), GetDiv(CreateRange(-1000, -40), CreateRange(2, 4), true));
452 ExpectEqual(Value(10), GetDiv(CreateRange(-1000, -40), CreateRange(-4, -2), true));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800453 ExpectEqual(Value(), GetDiv(CreateRange(-1000, -40), CreateRange(-1, 1), true));
454 ExpectEqual(Value(), GetDiv(CreateRange(-1, 1), CreateRange(40, 1000), true));
455 ExpectEqual(Value(), GetDiv(CreateRange(-1, 1), CreateRange(-1000, -40), true));
456 ExpectEqual(Value(), GetDiv(CreateRange(-1, 1), CreateRange(-1, 1), true));
Aart Bikd14c5952015-09-08 15:25:15 -0700457}
458
459TEST_F(InductionVarRangeTest, GetDivMax) {
Aart Bik97412c922016-02-19 20:14:38 -0800460 ExpectEqual(Value(10), GetDiv(CreateRange(-10, 20), CreateConst(2), false));
461 ExpectEqual(Value(5), GetDiv(CreateRange(-10, 20), CreateConst(-2), false));
Aart Bikb3365e02015-09-21 14:45:05 -0700462 ExpectEqual(Value(500), GetDiv(CreateRange(40, 1000), CreateRange(2, 4), false));
463 ExpectEqual(Value(-10), GetDiv(CreateRange(40, 1000), CreateRange(-4, -2), false));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800464 ExpectEqual(Value(), GetDiv(CreateRange(40, 1000), CreateRange(-1, 1), false));
Aart Bikb3365e02015-09-21 14:45:05 -0700465 ExpectEqual(Value(-10), GetDiv(CreateRange(-1000, -40), CreateRange(2, 4), false));
466 ExpectEqual(Value(500), GetDiv(CreateRange(-1000, -40), CreateRange(-4, -2), false));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800467 ExpectEqual(Value(), GetDiv(CreateRange(-1000, -40), CreateRange(-1, 1), false));
468 ExpectEqual(Value(), GetDiv(CreateRange(-1, 1), CreateRange(40, 1000), false));
469 ExpectEqual(Value(), GetDiv(CreateRange(-1, 1), CreateRange(-1000, 40), false));
470 ExpectEqual(Value(), GetDiv(CreateRange(-1, 1), CreateRange(-1, 1), false));
Aart Bikd14c5952015-09-08 15:25:15 -0700471}
472
473TEST_F(InductionVarRangeTest, AddValue) {
474 ExpectEqual(Value(110), AddValue(Value(10), Value(100)));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800475 ExpectEqual(Value(-5), AddValue(Value(x_, 1, -4), Value(x_, -1, -1)));
476 ExpectEqual(Value(x_, 3, -5), AddValue(Value(x_, 2, -4), Value(x_, 1, -1)));
477 ExpectEqual(Value(), AddValue(Value(x_, 1, 5), Value(y_, 1, -7)));
478 ExpectEqual(Value(x_, 1, 23), AddValue(Value(x_, 1, 20), Value(3)));
479 ExpectEqual(Value(y_, 1, 5), AddValue(Value(55), Value(y_, 1, -50)));
Aart Bikcd26feb2015-09-23 17:50:50 -0700480 const int32_t max_value = std::numeric_limits<int32_t>::max();
481 ExpectEqual(Value(max_value), AddValue(Value(max_value - 5), Value(5)));
482 ExpectEqual(Value(), AddValue(Value(max_value - 5), Value(6))); // unsafe
Aart Bikd14c5952015-09-08 15:25:15 -0700483}
484
485TEST_F(InductionVarRangeTest, SubValue) {
486 ExpectEqual(Value(-90), SubValue(Value(10), Value(100)));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800487 ExpectEqual(Value(-3), SubValue(Value(x_, 1, -4), Value(x_, 1, -1)));
488 ExpectEqual(Value(x_, 2, -3), SubValue(Value(x_, 3, -4), Value(x_, 1, -1)));
489 ExpectEqual(Value(), SubValue(Value(x_, 1, 5), Value(y_, 1, -7)));
490 ExpectEqual(Value(x_, 1, 17), SubValue(Value(x_, 1, 20), Value(3)));
491 ExpectEqual(Value(y_, -4, 105), SubValue(Value(55), Value(y_, 4, -50)));
Aart Bikcd26feb2015-09-23 17:50:50 -0700492 const int32_t min_value = std::numeric_limits<int32_t>::min();
493 ExpectEqual(Value(min_value), SubValue(Value(min_value + 5), Value(5)));
494 ExpectEqual(Value(), SubValue(Value(min_value + 5), Value(6))); // unsafe
Aart Bikd14c5952015-09-08 15:25:15 -0700495}
496
497TEST_F(InductionVarRangeTest, MulValue) {
498 ExpectEqual(Value(1000), MulValue(Value(10), Value(100)));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800499 ExpectEqual(Value(), MulValue(Value(x_, 1, -4), Value(x_, 1, -1)));
500 ExpectEqual(Value(), MulValue(Value(x_, 1, 5), Value(y_, 1, -7)));
501 ExpectEqual(Value(x_, 9, 60), MulValue(Value(x_, 3, 20), Value(3)));
502 ExpectEqual(Value(y_, 55, -110), MulValue(Value(55), Value(y_, 1, -2)));
Aart Bikb3365e02015-09-21 14:45:05 -0700503 ExpectEqual(Value(), MulValue(Value(90000), Value(-90000))); // unsafe
Aart Bikd14c5952015-09-08 15:25:15 -0700504}
505
Aart Bik97412c922016-02-19 20:14:38 -0800506TEST_F(InductionVarRangeTest, MulValueSpecial) {
507 const int32_t min_value = std::numeric_limits<int32_t>::min();
508 const int32_t max_value = std::numeric_limits<int32_t>::max();
509
510 // Unsafe.
511 ExpectEqual(Value(), MulValue(Value(min_value), Value(min_value)));
512 ExpectEqual(Value(), MulValue(Value(min_value), Value(-1)));
513 ExpectEqual(Value(), MulValue(Value(min_value), Value(max_value)));
514 ExpectEqual(Value(), MulValue(Value(max_value), Value(max_value)));
515
516 // Safe.
517 ExpectEqual(Value(min_value), MulValue(Value(min_value), Value(1)));
518 ExpectEqual(Value(max_value), MulValue(Value(max_value), Value(1)));
519 ExpectEqual(Value(-max_value), MulValue(Value(max_value), Value(-1)));
520 ExpectEqual(Value(-1), MulValue(Value(1), Value(-1)));
521 ExpectEqual(Value(1), MulValue(Value(-1), Value(-1)));
522}
523
Aart Bikd14c5952015-09-08 15:25:15 -0700524TEST_F(InductionVarRangeTest, DivValue) {
525 ExpectEqual(Value(25), DivValue(Value(100), Value(4)));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800526 ExpectEqual(Value(), DivValue(Value(x_, 1, -4), Value(x_, 1, -1)));
527 ExpectEqual(Value(), DivValue(Value(x_, 1, 5), Value(y_, 1, -7)));
528 ExpectEqual(Value(), DivValue(Value(x_, 12, 24), Value(3)));
529 ExpectEqual(Value(), DivValue(Value(55), Value(y_, 1, -50)));
Aart Bikb3365e02015-09-21 14:45:05 -0700530 ExpectEqual(Value(), DivValue(Value(1), Value(0))); // unsafe
Aart Bikd14c5952015-09-08 15:25:15 -0700531}
532
Aart Bik97412c922016-02-19 20:14:38 -0800533TEST_F(InductionVarRangeTest, DivValueSpecial) {
534 const int32_t min_value = std::numeric_limits<int32_t>::min();
535 const int32_t max_value = std::numeric_limits<int32_t>::max();
536
537 // Unsafe.
538 ExpectEqual(Value(), DivValue(Value(min_value), Value(-1)));
539
540 // Safe.
541 ExpectEqual(Value(1), DivValue(Value(min_value), Value(min_value)));
542 ExpectEqual(Value(1), DivValue(Value(max_value), Value(max_value)));
543 ExpectEqual(Value(min_value), DivValue(Value(min_value), Value(1)));
544 ExpectEqual(Value(max_value), DivValue(Value(max_value), Value(1)));
545 ExpectEqual(Value(-max_value), DivValue(Value(max_value), Value(-1)));
546 ExpectEqual(Value(-1), DivValue(Value(1), Value(-1)));
547 ExpectEqual(Value(1), DivValue(Value(-1), Value(-1)));
548}
549
Aart Bikd14c5952015-09-08 15:25:15 -0700550TEST_F(InductionVarRangeTest, MinValue) {
551 ExpectEqual(Value(10), MinValue(Value(10), Value(100)));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800552 ExpectEqual(Value(x_, 1, -4), MinValue(Value(x_, 1, -4), Value(x_, 1, -1)));
553 ExpectEqual(Value(x_, 4, -4), MinValue(Value(x_, 4, -4), Value(x_, 4, -1)));
554 ExpectEqual(Value(), MinValue(Value(x_, 1, 5), Value(y_, 1, -7)));
555 ExpectEqual(Value(), MinValue(Value(x_, 1, 20), Value(3)));
556 ExpectEqual(Value(), MinValue(Value(55), Value(y_, 1, -50)));
Aart Bikd14c5952015-09-08 15:25:15 -0700557}
558
559TEST_F(InductionVarRangeTest, MaxValue) {
560 ExpectEqual(Value(100), MaxValue(Value(10), Value(100)));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800561 ExpectEqual(Value(x_, 1, -1), MaxValue(Value(x_, 1, -4), Value(x_, 1, -1)));
562 ExpectEqual(Value(x_, 4, -1), MaxValue(Value(x_, 4, -4), Value(x_, 4, -1)));
563 ExpectEqual(Value(), MaxValue(Value(x_, 1, 5), Value(y_, 1, -7)));
564 ExpectEqual(Value(), MaxValue(Value(x_, 1, 20), Value(3)));
565 ExpectEqual(Value(), MaxValue(Value(55), Value(y_, 1, -50)));
Aart Bikd14c5952015-09-08 15:25:15 -0700566}
567
Aart Bik52be7e72016-06-23 11:20:41 -0700568TEST_F(InductionVarRangeTest, ArrayLengthAndHints) {
569 HInstruction* new_array = new (&allocator_)
570 HNewArray(x_,
571 graph_->GetCurrentMethod(),
572 0, Primitive::kPrimInt,
573 graph_->GetDexFile(),
574 kQuickAllocArray);
575 entry_block_->AddInstruction(new_array);
576 HInstruction* array_length = new (&allocator_) HArrayLength(new_array, 0);
577 entry_block_->AddInstruction(array_length);
578 // With null hint: yields extreme constants.
579 const int32_t max_value = std::numeric_limits<int32_t>::max();
580 SetHint(nullptr);
581 ExpectEqual(Value(0), GetMin(CreateFetch(array_length), nullptr));
582 ExpectEqual(Value(max_value), GetMax(CreateFetch(array_length), nullptr));
583 // With explicit hint: yields the length instruction.
584 SetHint(array_length);
585 ExpectEqual(Value(array_length, 1, 0), GetMin(CreateFetch(array_length), nullptr));
586 ExpectEqual(Value(array_length, 1, 0), GetMax(CreateFetch(array_length), nullptr));
587 // With any non-null hint: chases beyond the length instruction.
588 SetHint(x_);
589 ExpectEqual(Value(x_, 1, 0), GetMin(CreateFetch(array_length), nullptr));
590 ExpectEqual(Value(x_, 1, 0), GetMax(CreateFetch(array_length), nullptr));
591}
592
Aart Bikaec3cce2015-10-14 17:44:55 -0700593//
Aart Bik7d57d7f2015-12-09 14:39:48 -0800594// Tests on public methods.
Aart Bikaec3cce2015-10-14 17:44:55 -0700595//
596
Aart Bik389b3db2015-10-28 14:23:40 -0700597TEST_F(InductionVarRangeTest, ConstantTripCountUp) {
598 BuildLoop(0, graph_->GetIntConstant(1000), 1);
Aart Bikaec3cce2015-10-14 17:44:55 -0700599 PerformInductionVarAnalysis();
Aart Bikaec3cce2015-10-14 17:44:55 -0700600
Aart Bik389b3db2015-10-28 14:23:40 -0700601 Value v1, v2;
602 bool needs_finite_test = true;
603
Aart Bikaec3cce2015-10-14 17:44:55 -0700604 // In context of header: known.
Aart Bik52be7e72016-06-23 11:20:41 -0700605 range_.GetInductionRange(condition_, condition_->InputAt(0), x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700606 EXPECT_FALSE(needs_finite_test);
607 ExpectEqual(Value(0), v1);
608 ExpectEqual(Value(1000), v2);
Aart Bikaec3cce2015-10-14 17:44:55 -0700609
610 // In context of loop-body: known.
Aart Bik52be7e72016-06-23 11:20:41 -0700611 range_.GetInductionRange(increment_, condition_->InputAt(0), x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700612 EXPECT_FALSE(needs_finite_test);
613 ExpectEqual(Value(0), v1);
614 ExpectEqual(Value(999), v2);
Aart Bik52be7e72016-06-23 11:20:41 -0700615 range_.GetInductionRange(increment_, increment_, x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700616 EXPECT_FALSE(needs_finite_test);
617 ExpectEqual(Value(1), v1);
618 ExpectEqual(Value(1000), v2);
Aart Bikaec3cce2015-10-14 17:44:55 -0700619}
620
Aart Bik389b3db2015-10-28 14:23:40 -0700621TEST_F(InductionVarRangeTest, ConstantTripCountDown) {
622 BuildLoop(1000, graph_->GetIntConstant(0), -1);
Aart Bikaec3cce2015-10-14 17:44:55 -0700623 PerformInductionVarAnalysis();
Aart Bikaec3cce2015-10-14 17:44:55 -0700624
Aart Bik389b3db2015-10-28 14:23:40 -0700625 Value v1, v2;
626 bool needs_finite_test = true;
627
628 // In context of header: known.
Aart Bik52be7e72016-06-23 11:20:41 -0700629 range_.GetInductionRange(condition_, condition_->InputAt(0), x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700630 EXPECT_FALSE(needs_finite_test);
631 ExpectEqual(Value(0), v1);
632 ExpectEqual(Value(1000), v2);
Aart Bikaec3cce2015-10-14 17:44:55 -0700633
634 // In context of loop-body: known.
Aart Bik52be7e72016-06-23 11:20:41 -0700635 range_.GetInductionRange(increment_, condition_->InputAt(0), x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700636 EXPECT_FALSE(needs_finite_test);
637 ExpectEqual(Value(1), v1);
638 ExpectEqual(Value(1000), v2);
Aart Bik52be7e72016-06-23 11:20:41 -0700639 range_.GetInductionRange(increment_, increment_, x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700640 EXPECT_FALSE(needs_finite_test);
641 ExpectEqual(Value(0), v1);
642 ExpectEqual(Value(999), v2);
Aart Bikaec3cce2015-10-14 17:44:55 -0700643}
644
Aart Bik389b3db2015-10-28 14:23:40 -0700645TEST_F(InductionVarRangeTest, SymbolicTripCountUp) {
Aart Bik7d57d7f2015-12-09 14:39:48 -0800646 BuildLoop(0, x_, 1);
Aart Bikaec3cce2015-10-14 17:44:55 -0700647 PerformInductionVarAnalysis();
Aart Bikaec3cce2015-10-14 17:44:55 -0700648
Aart Bik389b3db2015-10-28 14:23:40 -0700649 Value v1, v2;
650 bool needs_finite_test = true;
651 bool needs_taken_test = true;
652
653 // In context of header: upper unknown.
Aart Bik52be7e72016-06-23 11:20:41 -0700654 range_.GetInductionRange(condition_, condition_->InputAt(0), x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700655 EXPECT_FALSE(needs_finite_test);
656 ExpectEqual(Value(0), v1);
657 ExpectEqual(Value(), v2);
658
659 // In context of loop-body: known.
Aart Bik52be7e72016-06-23 11:20:41 -0700660 range_.GetInductionRange(increment_, condition_->InputAt(0), x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700661 EXPECT_FALSE(needs_finite_test);
662 ExpectEqual(Value(0), v1);
Aart Bik7d57d7f2015-12-09 14:39:48 -0800663 ExpectEqual(Value(x_, 1, -1), v2);
Aart Bik52be7e72016-06-23 11:20:41 -0700664 range_.GetInductionRange(increment_, increment_, x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700665 EXPECT_FALSE(needs_finite_test);
666 ExpectEqual(Value(1), v1);
Aart Bik7d57d7f2015-12-09 14:39:48 -0800667 ExpectEqual(Value(x_, 1, 0), v2);
Aart Bik389b3db2015-10-28 14:23:40 -0700668
Aart Bikaec3cce2015-10-14 17:44:55 -0700669 HInstruction* lower = nullptr;
670 HInstruction* upper = nullptr;
Aart Bik389b3db2015-10-28 14:23:40 -0700671 HInstruction* taken = nullptr;
Aart Bikaec3cce2015-10-14 17:44:55 -0700672
673 // Can generate code in context of loop-body only.
Aart Bik7d57d7f2015-12-09 14:39:48 -0800674 EXPECT_FALSE(range_.CanGenerateCode(
Aart Bik389b3db2015-10-28 14:23:40 -0700675 condition_, condition_->InputAt(0), &needs_finite_test, &needs_taken_test));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800676 ASSERT_TRUE(range_.CanGenerateCode(
Aart Bik389b3db2015-10-28 14:23:40 -0700677 increment_, condition_->InputAt(0), &needs_finite_test, &needs_taken_test));
678 EXPECT_FALSE(needs_finite_test);
679 EXPECT_TRUE(needs_taken_test);
Aart Bikaec3cce2015-10-14 17:44:55 -0700680
681 // Generates code.
Aart Bik7d57d7f2015-12-09 14:39:48 -0800682 range_.GenerateRangeCode(
683 increment_, condition_->InputAt(0), graph_, loop_preheader_, &lower, &upper);
Aart Bikaec3cce2015-10-14 17:44:55 -0700684
685 // Verify lower is 0+0.
686 ASSERT_TRUE(lower != nullptr);
687 ASSERT_TRUE(lower->IsAdd());
688 ASSERT_TRUE(lower->InputAt(0)->IsIntConstant());
689 EXPECT_EQ(0, lower->InputAt(0)->AsIntConstant()->GetValue());
690 ASSERT_TRUE(lower->InputAt(1)->IsIntConstant());
691 EXPECT_EQ(0, lower->InputAt(1)->AsIntConstant()->GetValue());
692
Aart Bik389b3db2015-10-28 14:23:40 -0700693 // Verify upper is (V-1)+0.
Aart Bikaec3cce2015-10-14 17:44:55 -0700694 ASSERT_TRUE(upper != nullptr);
695 ASSERT_TRUE(upper->IsAdd());
696 ASSERT_TRUE(upper->InputAt(0)->IsSub());
697 EXPECT_TRUE(upper->InputAt(0)->InputAt(0)->IsParameterValue());
698 ASSERT_TRUE(upper->InputAt(0)->InputAt(1)->IsIntConstant());
699 EXPECT_EQ(1, upper->InputAt(0)->InputAt(1)->AsIntConstant()->GetValue());
700 ASSERT_TRUE(upper->InputAt(1)->IsIntConstant());
701 EXPECT_EQ(0, upper->InputAt(1)->AsIntConstant()->GetValue());
Aart Bik389b3db2015-10-28 14:23:40 -0700702
703 // Verify taken-test is 0<V.
Aart Bik7d57d7f2015-12-09 14:39:48 -0800704 range_.GenerateTakenTest(increment_, graph_, loop_preheader_, &taken);
Aart Bik389b3db2015-10-28 14:23:40 -0700705 ASSERT_TRUE(taken != nullptr);
706 ASSERT_TRUE(taken->IsLessThan());
707 ASSERT_TRUE(taken->InputAt(0)->IsIntConstant());
708 EXPECT_EQ(0, taken->InputAt(0)->AsIntConstant()->GetValue());
709 EXPECT_TRUE(taken->InputAt(1)->IsParameterValue());
710}
711
712TEST_F(InductionVarRangeTest, SymbolicTripCountDown) {
Aart Bik7d57d7f2015-12-09 14:39:48 -0800713 BuildLoop(1000, x_, -1);
Aart Bik389b3db2015-10-28 14:23:40 -0700714 PerformInductionVarAnalysis();
Aart Bik389b3db2015-10-28 14:23:40 -0700715
716 Value v1, v2;
717 bool needs_finite_test = true;
718 bool needs_taken_test = true;
719
720 // In context of header: lower unknown.
Aart Bik52be7e72016-06-23 11:20:41 -0700721 range_.GetInductionRange(condition_, condition_->InputAt(0), x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700722 EXPECT_FALSE(needs_finite_test);
723 ExpectEqual(Value(), v1);
724 ExpectEqual(Value(1000), v2);
725
726 // In context of loop-body: known.
Aart Bik52be7e72016-06-23 11:20:41 -0700727 range_.GetInductionRange(increment_, condition_->InputAt(0), x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700728 EXPECT_FALSE(needs_finite_test);
Aart Bik7d57d7f2015-12-09 14:39:48 -0800729 ExpectEqual(Value(x_, 1, 1), v1);
Aart Bik389b3db2015-10-28 14:23:40 -0700730 ExpectEqual(Value(1000), v2);
Aart Bik52be7e72016-06-23 11:20:41 -0700731 range_.GetInductionRange(increment_, increment_, x_, &v1, &v2, &needs_finite_test);
Aart Bik389b3db2015-10-28 14:23:40 -0700732 EXPECT_FALSE(needs_finite_test);
Aart Bik7d57d7f2015-12-09 14:39:48 -0800733 ExpectEqual(Value(x_, 1, 0), v1);
Aart Bik389b3db2015-10-28 14:23:40 -0700734 ExpectEqual(Value(999), v2);
735
736 HInstruction* lower = nullptr;
737 HInstruction* upper = nullptr;
738 HInstruction* taken = nullptr;
739
740 // Can generate code in context of loop-body only.
Aart Bik7d57d7f2015-12-09 14:39:48 -0800741 EXPECT_FALSE(range_.CanGenerateCode(
Aart Bik389b3db2015-10-28 14:23:40 -0700742 condition_, condition_->InputAt(0), &needs_finite_test, &needs_taken_test));
Aart Bik7d57d7f2015-12-09 14:39:48 -0800743 ASSERT_TRUE(range_.CanGenerateCode(
Aart Bik389b3db2015-10-28 14:23:40 -0700744 increment_, condition_->InputAt(0), &needs_finite_test, &needs_taken_test));
745 EXPECT_FALSE(needs_finite_test);
746 EXPECT_TRUE(needs_taken_test);
747
748 // Generates code.
Aart Bik7d57d7f2015-12-09 14:39:48 -0800749 range_.GenerateRangeCode(
750 increment_, condition_->InputAt(0), graph_, loop_preheader_, &lower, &upper);
Aart Bik389b3db2015-10-28 14:23:40 -0700751
Aart Bik7d57d7f2015-12-09 14:39:48 -0800752 // Verify lower is 1000-((1000-V)-1).
Aart Bik389b3db2015-10-28 14:23:40 -0700753 ASSERT_TRUE(lower != nullptr);
754 ASSERT_TRUE(lower->IsSub());
755 ASSERT_TRUE(lower->InputAt(0)->IsIntConstant());
756 EXPECT_EQ(1000, lower->InputAt(0)->AsIntConstant()->GetValue());
757 lower = lower->InputAt(1);
758 ASSERT_TRUE(lower->IsSub());
759 ASSERT_TRUE(lower->InputAt(1)->IsIntConstant());
760 EXPECT_EQ(1, lower->InputAt(1)->AsIntConstant()->GetValue());
761 lower = lower->InputAt(0);
Aart Bik389b3db2015-10-28 14:23:40 -0700762 ASSERT_TRUE(lower->IsSub());
Aart Bik7d57d7f2015-12-09 14:39:48 -0800763 ASSERT_TRUE(lower->InputAt(0)->IsIntConstant());
764 EXPECT_EQ(1000, lower->InputAt(0)->AsIntConstant()->GetValue());
765 EXPECT_TRUE(lower->InputAt(1)->IsParameterValue());
Aart Bik389b3db2015-10-28 14:23:40 -0700766
767 // Verify upper is 1000-0.
768 ASSERT_TRUE(upper != nullptr);
769 ASSERT_TRUE(upper->IsSub());
770 ASSERT_TRUE(upper->InputAt(0)->IsIntConstant());
771 EXPECT_EQ(1000, upper->InputAt(0)->AsIntConstant()->GetValue());
772 ASSERT_TRUE(upper->InputAt(1)->IsIntConstant());
773 EXPECT_EQ(0, upper->InputAt(1)->AsIntConstant()->GetValue());
774
775 // Verify taken-test is 1000>V.
Aart Bik7d57d7f2015-12-09 14:39:48 -0800776 range_.GenerateTakenTest(increment_, graph_, loop_preheader_, &taken);
Aart Bik389b3db2015-10-28 14:23:40 -0700777 ASSERT_TRUE(taken != nullptr);
778 ASSERT_TRUE(taken->IsGreaterThan());
779 ASSERT_TRUE(taken->InputAt(0)->IsIntConstant());
780 EXPECT_EQ(1000, taken->InputAt(0)->AsIntConstant()->GetValue());
781 EXPECT_TRUE(taken->InputAt(1)->IsParameterValue());
Aart Bikaec3cce2015-10-14 17:44:55 -0700782}
783
Aart Bikd14c5952015-09-08 15:25:15 -0700784} // namespace art