blob: a1c797a80a5aa4856c0d2839f9f3174d9799c13e [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 Brazdild9510df2015-11-04 23:30:22 +000031class InductionVarRangeTest : public CommonCompilerTest {
Aart Bikd14c5952015-09-08 15:25:15 -070032 public:
33 InductionVarRangeTest() : pool_(), allocator_(&pool_) {
34 graph_ = CreateGraph(&allocator_);
35 iva_ = new (&allocator_) HInductionVarAnalysis(graph_);
36 BuildGraph();
37 }
38
39 ~InductionVarRangeTest() { }
40
41 void ExpectEqual(Value v1, Value v2) {
42 EXPECT_EQ(v1.instruction, v2.instruction);
43 EXPECT_EQ(v1.a_constant, v2.a_constant);
44 EXPECT_EQ(v1.b_constant, v2.b_constant);
Aart Bikb3365e02015-09-21 14:45:05 -070045 EXPECT_EQ(v1.is_known, v2.is_known);
Aart Bikd14c5952015-09-08 15:25:15 -070046 }
47
Aart Bik389b3db2015-10-28 14:23:40 -070048 //
49 // Construction methods.
50 //
51
Aart Bikd14c5952015-09-08 15:25:15 -070052 /** Constructs bare minimum graph. */
53 void BuildGraph() {
54 graph_->SetNumberOfVRegs(1);
Aart Bikaec3cce2015-10-14 17:44:55 -070055 entry_block_ = new (&allocator_) HBasicBlock(graph_);
56 exit_block_ = new (&allocator_) HBasicBlock(graph_);
57 graph_->AddBlock(entry_block_);
58 graph_->AddBlock(exit_block_);
59 graph_->SetEntryBlock(entry_block_);
60 graph_->SetExitBlock(exit_block_);
61 }
62
63 /** Constructs loop with given upper bound. */
Aart Bik389b3db2015-10-28 14:23:40 -070064 void BuildLoop(int32_t lower, HInstruction* upper, int32_t stride) {
Aart Bikaec3cce2015-10-14 17:44:55 -070065 // Control flow.
66 loop_preheader_ = new (&allocator_) HBasicBlock(graph_);
67 graph_->AddBlock(loop_preheader_);
68 HBasicBlock* loop_header = new (&allocator_) HBasicBlock(graph_);
69 graph_->AddBlock(loop_header);
70 HBasicBlock* loop_body = new (&allocator_) HBasicBlock(graph_);
71 graph_->AddBlock(loop_body);
David Brazdildb51efb2015-11-06 01:36:20 +000072 HBasicBlock* return_block = new (&allocator_) HBasicBlock(graph_);
73 graph_->AddBlock(return_block);
Aart Bikaec3cce2015-10-14 17:44:55 -070074 entry_block_->AddSuccessor(loop_preheader_);
75 loop_preheader_->AddSuccessor(loop_header);
76 loop_header->AddSuccessor(loop_body);
David Brazdildb51efb2015-11-06 01:36:20 +000077 loop_header->AddSuccessor(return_block);
Aart Bikaec3cce2015-10-14 17:44:55 -070078 loop_body->AddSuccessor(loop_header);
David Brazdildb51efb2015-11-06 01:36:20 +000079 return_block->AddSuccessor(exit_block_);
Aart Bikaec3cce2015-10-14 17:44:55 -070080 // Instructions.
81 HLocal* induc = new (&allocator_) HLocal(0);
82 entry_block_->AddInstruction(induc);
83 loop_preheader_->AddInstruction(
Aart Bik389b3db2015-10-28 14:23:40 -070084 new (&allocator_) HStoreLocal(induc, graph_->GetIntConstant(lower))); // i = l
Aart Bikaec3cce2015-10-14 17:44:55 -070085 loop_preheader_->AddInstruction(new (&allocator_) HGoto());
86 HInstruction* load = new (&allocator_) HLoadLocal(induc, Primitive::kPrimInt);
87 loop_header->AddInstruction(load);
Aart Bik389b3db2015-10-28 14:23:40 -070088 if (stride > 0) {
89 condition_ = new (&allocator_) HLessThan(load, upper); // i < u
90 } else {
91 condition_ = new (&allocator_) HGreaterThan(load, upper); // i > u
92 }
Aart Bikaec3cce2015-10-14 17:44:55 -070093 loop_header->AddInstruction(condition_);
Aart Bik389b3db2015-10-28 14:23:40 -070094 loop_header->AddInstruction(new (&allocator_) HIf(condition_));
Aart Bikaec3cce2015-10-14 17:44:55 -070095 load = new (&allocator_) HLoadLocal(induc, Primitive::kPrimInt);
96 loop_body->AddInstruction(load);
Aart Bik389b3db2015-10-28 14:23:40 -070097 increment_ = new (&allocator_) HAdd(Primitive::kPrimInt, load, graph_->GetIntConstant(stride));
Aart Bikaec3cce2015-10-14 17:44:55 -070098 loop_body->AddInstruction(increment_);
Aart Bik389b3db2015-10-28 14:23:40 -070099 loop_body->AddInstruction(new (&allocator_) HStoreLocal(induc, increment_)); // i += s
Aart Bikaec3cce2015-10-14 17:44:55 -0700100 loop_body->AddInstruction(new (&allocator_) HGoto());
David Brazdildb51efb2015-11-06 01:36:20 +0000101 return_block->AddInstruction(new (&allocator_) HReturnVoid());
102 exit_block_->AddInstruction(new (&allocator_) HExit());
Aart Bikaec3cce2015-10-14 17:44:55 -0700103 }
104
105 /** Performs induction variable analysis. */
106 void PerformInductionVarAnalysis() {
David Brazdild9510df2015-11-04 23:30:22 +0000107 TransformToSsa(graph_);
Aart Bikaec3cce2015-10-14 17:44:55 -0700108 iva_->Run();
Aart Bikd14c5952015-09-08 15:25:15 -0700109 }
110
111 /** Constructs an invariant. */
112 HInductionVarAnalysis::InductionInfo* CreateInvariant(char opc,
113 HInductionVarAnalysis::InductionInfo* a,
114 HInductionVarAnalysis::InductionInfo* b) {
115 HInductionVarAnalysis::InductionOp op;
116 switch (opc) {
117 case '+': op = HInductionVarAnalysis::kAdd; break;
118 case '-': op = HInductionVarAnalysis::kSub; break;
119 case 'n': op = HInductionVarAnalysis::kNeg; break;
120 case '*': op = HInductionVarAnalysis::kMul; break;
121 case '/': op = HInductionVarAnalysis::kDiv; break;
122 default: op = HInductionVarAnalysis::kNop; break;
123 }
124 return iva_->CreateInvariantOp(op, a, b);
125 }
126
127 /** Constructs a fetch. */
128 HInductionVarAnalysis::InductionInfo* CreateFetch(HInstruction* fetch) {
129 return iva_->CreateInvariantFetch(fetch);
130 }
131
132 /** Constructs a constant. */
133 HInductionVarAnalysis::InductionInfo* CreateConst(int32_t c) {
134 return CreateFetch(graph_->GetIntConstant(c));
135 }
136
137 /** Constructs a trip-count. */
Aart Bik389b3db2015-10-28 14:23:40 -0700138 HInductionVarAnalysis::InductionInfo* CreateTripCount(int32_t tc, bool in_loop, bool safe) {
139 if (in_loop && safe) {
140 return iva_->CreateTripCount(
141 HInductionVarAnalysis::kTripCountInLoop, CreateConst(tc), nullptr);
142 } else if (in_loop) {
143 return iva_->CreateTripCount(
144 HInductionVarAnalysis::kTripCountInLoopUnsafe, CreateConst(tc), nullptr);
145 } else if (safe) {
146 return iva_->CreateTripCount(
147 HInductionVarAnalysis::kTripCountInBody, CreateConst(tc), nullptr);
148 } else {
149 return iva_->CreateTripCount(
150 HInductionVarAnalysis::kTripCountInBodyUnsafe, CreateConst(tc), nullptr);
151 }
Aart Bikd14c5952015-09-08 15:25:15 -0700152 }
153
154 /** Constructs a linear a * i + b induction. */
155 HInductionVarAnalysis::InductionInfo* CreateLinear(int32_t a, int32_t b) {
156 return iva_->CreateInduction(HInductionVarAnalysis::kLinear, CreateConst(a), CreateConst(b));
157 }
158
159 /** Constructs a range [lo, hi] using a periodic induction. */
160 HInductionVarAnalysis::InductionInfo* CreateRange(int32_t lo, int32_t hi) {
161 return iva_->CreateInduction(
162 HInductionVarAnalysis::kPeriodic, CreateConst(lo), CreateConst(hi));
163 }
164
Aart Bik389b3db2015-10-28 14:23:40 -0700165 /** Constructs a wrap-around induction consisting of a constant, followed info */
166 HInductionVarAnalysis::InductionInfo* CreateWrapAround(
167 int32_t initial,
168 HInductionVarAnalysis::InductionInfo* info) {
169 return iva_->CreateInduction(HInductionVarAnalysis::kWrapAround, CreateConst(initial), info);
170 }
171
Aart Bikd14c5952015-09-08 15:25:15 -0700172 /** Constructs a wrap-around induction consisting of a constant, followed by a range. */
173 HInductionVarAnalysis::InductionInfo* CreateWrapAround(int32_t initial, int32_t lo, int32_t hi) {
Aart Bik389b3db2015-10-28 14:23:40 -0700174 return CreateWrapAround(initial, CreateRange(lo, hi));
Aart Bikd14c5952015-09-08 15:25:15 -0700175 }
176
177 //
178 // Relay methods.
179 //
180
Aart Bik389b3db2015-10-28 14:23:40 -0700181 bool NeedsTripCount(HInductionVarAnalysis::InductionInfo* info) {
182 return InductionVarRange::NeedsTripCount(info);
183 }
184
185 bool IsBodyTripCount(HInductionVarAnalysis::InductionInfo* trip) {
186 return InductionVarRange::IsBodyTripCount(trip);
187 }
188
189 bool IsUnsafeTripCount(HInductionVarAnalysis::InductionInfo* trip) {
190 return InductionVarRange::IsUnsafeTripCount(trip);
191 }
192
Aart Bikd14c5952015-09-08 15:25:15 -0700193 Value GetMin(HInductionVarAnalysis::InductionInfo* info,
194 HInductionVarAnalysis::InductionInfo* induc) {
Aart Bik9401f532015-09-28 16:25:56 -0700195 return InductionVarRange::GetVal(info, induc, /* in_body */ true, /* is_min */ true);
Aart Bikd14c5952015-09-08 15:25:15 -0700196 }
197
198 Value GetMax(HInductionVarAnalysis::InductionInfo* info,
199 HInductionVarAnalysis::InductionInfo* induc) {
Aart Bik9401f532015-09-28 16:25:56 -0700200 return InductionVarRange::GetVal(info, induc, /* in_body */ true, /* is_min */ false);
Aart Bikd14c5952015-09-08 15:25:15 -0700201 }
202
203 Value GetMul(HInductionVarAnalysis::InductionInfo* info1,
Aart Bikb3365e02015-09-21 14:45:05 -0700204 HInductionVarAnalysis::InductionInfo* info2,
205 bool is_min) {
Aart Bik9401f532015-09-28 16:25:56 -0700206 return InductionVarRange::GetMul(info1, info2, nullptr, /* in_body */ true, is_min);
Aart Bikd14c5952015-09-08 15:25:15 -0700207 }
208
209 Value GetDiv(HInductionVarAnalysis::InductionInfo* info1,
Aart Bikb3365e02015-09-21 14:45:05 -0700210 HInductionVarAnalysis::InductionInfo* info2,
211 bool is_min) {
Aart Bik9401f532015-09-28 16:25:56 -0700212 return InductionVarRange::GetDiv(info1, info2, nullptr, /* in_body */ true, is_min);
213 }
214
215 bool GetConstant(HInductionVarAnalysis::InductionInfo* info, int32_t* value) {
216 return InductionVarRange::GetConstant(info, value);
Aart Bikd14c5952015-09-08 15:25:15 -0700217 }
218
Aart Bikb3365e02015-09-21 14:45:05 -0700219 Value AddValue(Value v1, Value v2) { return InductionVarRange::AddValue(v1, v2); }
220 Value SubValue(Value v1, Value v2) { return InductionVarRange::SubValue(v1, v2); }
221 Value MulValue(Value v1, Value v2) { return InductionVarRange::MulValue(v1, v2); }
222 Value DivValue(Value v1, Value v2) { return InductionVarRange::DivValue(v1, v2); }
Aart Bikcd26feb2015-09-23 17:50:50 -0700223 Value MinValue(Value v1, Value v2) { return InductionVarRange::MergeVal(v1, v2, true); }
224 Value MaxValue(Value v1, Value v2) { return InductionVarRange::MergeVal(v1, v2, false); }
Aart Bikd14c5952015-09-08 15:25:15 -0700225
226 // General building fields.
227 ArenaPool pool_;
228 ArenaAllocator allocator_;
229 HGraph* graph_;
Aart Bikaec3cce2015-10-14 17:44:55 -0700230 HBasicBlock* entry_block_;
231 HBasicBlock* exit_block_;
232 HBasicBlock* loop_preheader_;
Aart Bikd14c5952015-09-08 15:25:15 -0700233 HInductionVarAnalysis* iva_;
234
Aart Bikaec3cce2015-10-14 17:44:55 -0700235 // Instructions.
236 HInstruction* condition_;
237 HInstruction* increment_;
Aart Bikd14c5952015-09-08 15:25:15 -0700238 HReturnVoid x_;
239 HReturnVoid y_;
240};
241
242//
Aart Bikaec3cce2015-10-14 17:44:55 -0700243// Tests on static methods.
Aart Bikd14c5952015-09-08 15:25:15 -0700244//
245
Aart Bik389b3db2015-10-28 14:23:40 -0700246TEST_F(InductionVarRangeTest, TripCountProperties) {
247 EXPECT_FALSE(NeedsTripCount(nullptr));
248 EXPECT_FALSE(NeedsTripCount(CreateConst(1)));
249 EXPECT_TRUE(NeedsTripCount(CreateLinear(1, 1)));
250 EXPECT_FALSE(NeedsTripCount(CreateWrapAround(1, 2, 3)));
251 EXPECT_TRUE(NeedsTripCount(CreateWrapAround(1, CreateLinear(1, 1))));
252
253 EXPECT_FALSE(IsBodyTripCount(nullptr));
254 EXPECT_FALSE(IsBodyTripCount(CreateTripCount(100, true, true)));
255 EXPECT_FALSE(IsBodyTripCount(CreateTripCount(100, true, false)));
256 EXPECT_TRUE(IsBodyTripCount(CreateTripCount(100, false, true)));
257 EXPECT_TRUE(IsBodyTripCount(CreateTripCount(100, false, false)));
258
259 EXPECT_FALSE(IsUnsafeTripCount(nullptr));
260 EXPECT_FALSE(IsUnsafeTripCount(CreateTripCount(100, true, true)));
261 EXPECT_TRUE(IsUnsafeTripCount(CreateTripCount(100, true, false)));
262 EXPECT_FALSE(IsUnsafeTripCount(CreateTripCount(100, false, true)));
263 EXPECT_TRUE(IsUnsafeTripCount(CreateTripCount(100, false, false)));
264}
265
Aart Bikd14c5952015-09-08 15:25:15 -0700266TEST_F(InductionVarRangeTest, GetMinMaxNull) {
Aart Bikb3365e02015-09-21 14:45:05 -0700267 ExpectEqual(Value(), GetMin(nullptr, nullptr));
268 ExpectEqual(Value(), GetMax(nullptr, nullptr));
Aart Bikd14c5952015-09-08 15:25:15 -0700269}
270
271TEST_F(InductionVarRangeTest, GetMinMaxAdd) {
272 ExpectEqual(Value(12),
273 GetMin(CreateInvariant('+', CreateConst(2), CreateRange(10, 20)), nullptr));
274 ExpectEqual(Value(22),
275 GetMax(CreateInvariant('+', CreateConst(2), CreateRange(10, 20)), nullptr));
276 ExpectEqual(Value(&x_, 1, -20),
277 GetMin(CreateInvariant('+', CreateFetch(&x_), CreateRange(-20, -10)), nullptr));
278 ExpectEqual(Value(&x_, 1, -10),
279 GetMax(CreateInvariant('+', CreateFetch(&x_), CreateRange(-20, -10)), nullptr));
280 ExpectEqual(Value(&x_, 1, 10),
281 GetMin(CreateInvariant('+', CreateRange(10, 20), CreateFetch(&x_)), nullptr));
282 ExpectEqual(Value(&x_, 1, 20),
283 GetMax(CreateInvariant('+', CreateRange(10, 20), CreateFetch(&x_)), nullptr));
284 ExpectEqual(Value(5),
285 GetMin(CreateInvariant('+', CreateRange(-5, -1), CreateRange(10, 20)), nullptr));
286 ExpectEqual(Value(19),
287 GetMax(CreateInvariant('+', CreateRange(-5, -1), CreateRange(10, 20)), nullptr));
288}
289
290TEST_F(InductionVarRangeTest, GetMinMaxSub) {
291 ExpectEqual(Value(-18),
292 GetMin(CreateInvariant('-', CreateConst(2), CreateRange(10, 20)), nullptr));
293 ExpectEqual(Value(-8),
294 GetMax(CreateInvariant('-', CreateConst(2), CreateRange(10, 20)), nullptr));
295 ExpectEqual(Value(&x_, 1, 10),
296 GetMin(CreateInvariant('-', CreateFetch(&x_), CreateRange(-20, -10)), nullptr));
297 ExpectEqual(Value(&x_, 1, 20),
298 GetMax(CreateInvariant('-', CreateFetch(&x_), CreateRange(-20, -10)), nullptr));
299 ExpectEqual(Value(&x_, -1, 10),
300 GetMin(CreateInvariant('-', CreateRange(10, 20), CreateFetch(&x_)), nullptr));
301 ExpectEqual(Value(&x_, -1, 20),
302 GetMax(CreateInvariant('-', CreateRange(10, 20), CreateFetch(&x_)), nullptr));
303 ExpectEqual(Value(-25),
304 GetMin(CreateInvariant('-', CreateRange(-5, -1), CreateRange(10, 20)), nullptr));
305 ExpectEqual(Value(-11),
306 GetMax(CreateInvariant('-', CreateRange(-5, -1), CreateRange(10, 20)), nullptr));
307}
308
309TEST_F(InductionVarRangeTest, GetMinMaxNeg) {
310 ExpectEqual(Value(-20), GetMin(CreateInvariant('n', nullptr, CreateRange(10, 20)), nullptr));
311 ExpectEqual(Value(-10), GetMax(CreateInvariant('n', nullptr, CreateRange(10, 20)), nullptr));
312 ExpectEqual(Value(10), GetMin(CreateInvariant('n', nullptr, CreateRange(-20, -10)), nullptr));
313 ExpectEqual(Value(20), GetMax(CreateInvariant('n', nullptr, CreateRange(-20, -10)), nullptr));
314 ExpectEqual(Value(&x_, -1, 0), GetMin(CreateInvariant('n', nullptr, CreateFetch(&x_)), nullptr));
315 ExpectEqual(Value(&x_, -1, 0), GetMax(CreateInvariant('n', nullptr, CreateFetch(&x_)), nullptr));
316}
317
318TEST_F(InductionVarRangeTest, GetMinMaxMul) {
319 ExpectEqual(Value(20),
320 GetMin(CreateInvariant('*', CreateConst(2), CreateRange(10, 20)), nullptr));
321 ExpectEqual(Value(40),
322 GetMax(CreateInvariant('*', CreateConst(2), CreateRange(10, 20)), nullptr));
323}
324
325TEST_F(InductionVarRangeTest, GetMinMaxDiv) {
326 ExpectEqual(Value(3),
327 GetMin(CreateInvariant('/', CreateRange(12, 20), CreateConst(4)), nullptr));
328 ExpectEqual(Value(5),
329 GetMax(CreateInvariant('/', CreateRange(12, 20), CreateConst(4)), nullptr));
330}
331
332TEST_F(InductionVarRangeTest, GetMinMaxConstant) {
333 ExpectEqual(Value(12345), GetMin(CreateConst(12345), nullptr));
334 ExpectEqual(Value(12345), GetMax(CreateConst(12345), nullptr));
335}
336
337TEST_F(InductionVarRangeTest, GetMinMaxFetch) {
338 ExpectEqual(Value(&x_, 1, 0), GetMin(CreateFetch(&x_), nullptr));
339 ExpectEqual(Value(&x_, 1, 0), GetMax(CreateFetch(&x_), nullptr));
340}
341
342TEST_F(InductionVarRangeTest, GetMinMaxLinear) {
Aart Bik389b3db2015-10-28 14:23:40 -0700343 ExpectEqual(Value(20), GetMin(CreateLinear(10, 20), CreateTripCount(100, true, true)));
344 ExpectEqual(Value(1010), GetMax(CreateLinear(10, 20), CreateTripCount(100, true, true)));
345 ExpectEqual(Value(-970), GetMin(CreateLinear(-10, 20), CreateTripCount(100, true, true)));
346 ExpectEqual(Value(20), GetMax(CreateLinear(-10, 20), CreateTripCount(100, true, true)));
Aart Bikd14c5952015-09-08 15:25:15 -0700347}
348
349TEST_F(InductionVarRangeTest, GetMinMaxWrapAround) {
350 ExpectEqual(Value(-5), GetMin(CreateWrapAround(-5, -1, 10), nullptr));
351 ExpectEqual(Value(10), GetMax(CreateWrapAround(-5, -1, 10), nullptr));
352 ExpectEqual(Value(-1), GetMin(CreateWrapAround(2, -1, 10), nullptr));
353 ExpectEqual(Value(10), GetMax(CreateWrapAround(2, -1, 10), nullptr));
354 ExpectEqual(Value(-1), GetMin(CreateWrapAround(20, -1, 10), nullptr));
355 ExpectEqual(Value(20), GetMax(CreateWrapAround(20, -1, 10), nullptr));
356}
357
358TEST_F(InductionVarRangeTest, GetMinMaxPeriodic) {
359 ExpectEqual(Value(-2), GetMin(CreateRange(-2, 99), nullptr));
360 ExpectEqual(Value(99), GetMax(CreateRange(-2, 99), nullptr));
361}
362
363TEST_F(InductionVarRangeTest, GetMulMin) {
Aart Bikb3365e02015-09-21 14:45:05 -0700364 ExpectEqual(Value(6), GetMul(CreateRange(2, 10), CreateRange(3, 5), true));
365 ExpectEqual(Value(-50), GetMul(CreateRange(2, 10), CreateRange(-5, -3), true));
366 ExpectEqual(Value(-50), GetMul(CreateRange(-10, -2), CreateRange(3, 5), true));
367 ExpectEqual(Value(6), GetMul(CreateRange(-10, -2), CreateRange(-5, -3), true));
Aart Bikd14c5952015-09-08 15:25:15 -0700368}
369
370TEST_F(InductionVarRangeTest, GetMulMax) {
Aart Bikb3365e02015-09-21 14:45:05 -0700371 ExpectEqual(Value(50), GetMul(CreateRange(2, 10), CreateRange(3, 5), false));
372 ExpectEqual(Value(-6), GetMul(CreateRange(2, 10), CreateRange(-5, -3), false));
373 ExpectEqual(Value(-6), GetMul(CreateRange(-10, -2), CreateRange(3, 5), false));
374 ExpectEqual(Value(50), GetMul(CreateRange(-10, -2), CreateRange(-5, -3), false));
Aart Bikd14c5952015-09-08 15:25:15 -0700375}
376
377TEST_F(InductionVarRangeTest, GetDivMin) {
Aart Bikb3365e02015-09-21 14:45:05 -0700378 ExpectEqual(Value(10), GetDiv(CreateRange(40, 1000), CreateRange(2, 4), true));
379 ExpectEqual(Value(-500), GetDiv(CreateRange(40, 1000), CreateRange(-4, -2), true));
380 ExpectEqual(Value(-500), GetDiv(CreateRange(-1000, -40), CreateRange(2, 4), true));
381 ExpectEqual(Value(10), GetDiv(CreateRange(-1000, -40), CreateRange(-4, -2), true));
Aart Bikd14c5952015-09-08 15:25:15 -0700382}
383
384TEST_F(InductionVarRangeTest, GetDivMax) {
Aart Bikb3365e02015-09-21 14:45:05 -0700385 ExpectEqual(Value(500), GetDiv(CreateRange(40, 1000), CreateRange(2, 4), false));
386 ExpectEqual(Value(-10), GetDiv(CreateRange(40, 1000), CreateRange(-4, -2), false));
387 ExpectEqual(Value(-10), GetDiv(CreateRange(-1000, -40), CreateRange(2, 4), false));
388 ExpectEqual(Value(500), GetDiv(CreateRange(-1000, -40), CreateRange(-4, -2), false));
Aart Bikd14c5952015-09-08 15:25:15 -0700389}
390
Aart Bik9401f532015-09-28 16:25:56 -0700391TEST_F(InductionVarRangeTest, GetConstant) {
392 int32_t value;
393 ASSERT_TRUE(GetConstant(CreateConst(12345), &value));
394 EXPECT_EQ(12345, value);
395 EXPECT_FALSE(GetConstant(CreateRange(1, 2), &value));
396}
397
Aart Bikd14c5952015-09-08 15:25:15 -0700398TEST_F(InductionVarRangeTest, AddValue) {
399 ExpectEqual(Value(110), AddValue(Value(10), Value(100)));
400 ExpectEqual(Value(-5), AddValue(Value(&x_, 1, -4), Value(&x_, -1, -1)));
401 ExpectEqual(Value(&x_, 3, -5), AddValue(Value(&x_, 2, -4), Value(&x_, 1, -1)));
Aart Bikb3365e02015-09-21 14:45:05 -0700402 ExpectEqual(Value(), AddValue(Value(&x_, 1, 5), Value(&y_, 1, -7)));
Aart Bikd14c5952015-09-08 15:25:15 -0700403 ExpectEqual(Value(&x_, 1, 23), AddValue(Value(&x_, 1, 20), Value(3)));
404 ExpectEqual(Value(&y_, 1, 5), AddValue(Value(55), Value(&y_, 1, -50)));
Aart Bikcd26feb2015-09-23 17:50:50 -0700405 const int32_t max_value = std::numeric_limits<int32_t>::max();
406 ExpectEqual(Value(max_value), AddValue(Value(max_value - 5), Value(5)));
407 ExpectEqual(Value(), AddValue(Value(max_value - 5), Value(6))); // unsafe
Aart Bikd14c5952015-09-08 15:25:15 -0700408}
409
410TEST_F(InductionVarRangeTest, SubValue) {
411 ExpectEqual(Value(-90), SubValue(Value(10), Value(100)));
412 ExpectEqual(Value(-3), SubValue(Value(&x_, 1, -4), Value(&x_, 1, -1)));
413 ExpectEqual(Value(&x_, 2, -3), SubValue(Value(&x_, 3, -4), Value(&x_, 1, -1)));
Aart Bikb3365e02015-09-21 14:45:05 -0700414 ExpectEqual(Value(), SubValue(Value(&x_, 1, 5), Value(&y_, 1, -7)));
Aart Bikd14c5952015-09-08 15:25:15 -0700415 ExpectEqual(Value(&x_, 1, 17), SubValue(Value(&x_, 1, 20), Value(3)));
416 ExpectEqual(Value(&y_, -4, 105), SubValue(Value(55), Value(&y_, 4, -50)));
Aart Bikcd26feb2015-09-23 17:50:50 -0700417 const int32_t min_value = std::numeric_limits<int32_t>::min();
418 ExpectEqual(Value(min_value), SubValue(Value(min_value + 5), Value(5)));
419 ExpectEqual(Value(), SubValue(Value(min_value + 5), Value(6))); // unsafe
Aart Bikd14c5952015-09-08 15:25:15 -0700420}
421
422TEST_F(InductionVarRangeTest, MulValue) {
423 ExpectEqual(Value(1000), MulValue(Value(10), Value(100)));
Aart Bikb3365e02015-09-21 14:45:05 -0700424 ExpectEqual(Value(), MulValue(Value(&x_, 1, -4), Value(&x_, 1, -1)));
425 ExpectEqual(Value(), MulValue(Value(&x_, 1, 5), Value(&y_, 1, -7)));
Aart Bikd14c5952015-09-08 15:25:15 -0700426 ExpectEqual(Value(&x_, 9, 60), MulValue(Value(&x_, 3, 20), Value(3)));
427 ExpectEqual(Value(&y_, 55, -110), MulValue(Value(55), Value(&y_, 1, -2)));
Aart Bikb3365e02015-09-21 14:45:05 -0700428 ExpectEqual(Value(), MulValue(Value(90000), Value(-90000))); // unsafe
Aart Bikd14c5952015-09-08 15:25:15 -0700429}
430
431TEST_F(InductionVarRangeTest, DivValue) {
432 ExpectEqual(Value(25), DivValue(Value(100), Value(4)));
Aart Bikb3365e02015-09-21 14:45:05 -0700433 ExpectEqual(Value(), DivValue(Value(&x_, 1, -4), Value(&x_, 1, -1)));
434 ExpectEqual(Value(), DivValue(Value(&x_, 1, 5), Value(&y_, 1, -7)));
435 ExpectEqual(Value(), DivValue(Value(&x_, 12, 24), Value(3)));
436 ExpectEqual(Value(), DivValue(Value(55), Value(&y_, 1, -50)));
437 ExpectEqual(Value(), DivValue(Value(1), Value(0))); // unsafe
Aart Bikd14c5952015-09-08 15:25:15 -0700438}
439
440TEST_F(InductionVarRangeTest, MinValue) {
441 ExpectEqual(Value(10), MinValue(Value(10), Value(100)));
442 ExpectEqual(Value(&x_, 1, -4), MinValue(Value(&x_, 1, -4), Value(&x_, 1, -1)));
443 ExpectEqual(Value(&x_, 4, -4), MinValue(Value(&x_, 4, -4), Value(&x_, 4, -1)));
Aart Bikb3365e02015-09-21 14:45:05 -0700444 ExpectEqual(Value(), MinValue(Value(&x_, 1, 5), Value(&y_, 1, -7)));
445 ExpectEqual(Value(), MinValue(Value(&x_, 1, 20), Value(3)));
446 ExpectEqual(Value(), MinValue(Value(55), Value(&y_, 1, -50)));
Aart Bikd14c5952015-09-08 15:25:15 -0700447}
448
449TEST_F(InductionVarRangeTest, MaxValue) {
450 ExpectEqual(Value(100), MaxValue(Value(10), Value(100)));
451 ExpectEqual(Value(&x_, 1, -1), MaxValue(Value(&x_, 1, -4), Value(&x_, 1, -1)));
452 ExpectEqual(Value(&x_, 4, -1), MaxValue(Value(&x_, 4, -4), Value(&x_, 4, -1)));
Aart Bikb3365e02015-09-21 14:45:05 -0700453 ExpectEqual(Value(), MaxValue(Value(&x_, 1, 5), Value(&y_, 1, -7)));
454 ExpectEqual(Value(), MaxValue(Value(&x_, 1, 20), Value(3)));
455 ExpectEqual(Value(), MaxValue(Value(55), Value(&y_, 1, -50)));
Aart Bikd14c5952015-09-08 15:25:15 -0700456}
457
Aart Bikaec3cce2015-10-14 17:44:55 -0700458//
459// Tests on instance methods.
460//
461
Aart Bik389b3db2015-10-28 14:23:40 -0700462TEST_F(InductionVarRangeTest, ConstantTripCountUp) {
463 BuildLoop(0, graph_->GetIntConstant(1000), 1);
Aart Bikaec3cce2015-10-14 17:44:55 -0700464 PerformInductionVarAnalysis();
465 InductionVarRange range(iva_);
466
Aart Bik389b3db2015-10-28 14:23:40 -0700467 Value v1, v2;
468 bool needs_finite_test = true;
469
Aart Bikaec3cce2015-10-14 17:44:55 -0700470 // In context of header: known.
Aart Bik389b3db2015-10-28 14:23:40 -0700471 range.GetInductionRange(condition_, condition_->InputAt(0), &v1, &v2, &needs_finite_test);
472 EXPECT_FALSE(needs_finite_test);
473 ExpectEqual(Value(0), v1);
474 ExpectEqual(Value(1000), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800475 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bikaec3cce2015-10-14 17:44:55 -0700476
477 // In context of loop-body: known.
Aart Bik389b3db2015-10-28 14:23:40 -0700478 range.GetInductionRange(increment_, condition_->InputAt(0), &v1, &v2, &needs_finite_test);
479 EXPECT_FALSE(needs_finite_test);
480 ExpectEqual(Value(0), v1);
481 ExpectEqual(Value(999), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800482 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bik389b3db2015-10-28 14:23:40 -0700483 range.GetInductionRange(increment_, increment_, &v1, &v2, &needs_finite_test);
484 EXPECT_FALSE(needs_finite_test);
485 ExpectEqual(Value(1), v1);
486 ExpectEqual(Value(1000), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800487 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bikaec3cce2015-10-14 17:44:55 -0700488}
489
Aart Bik389b3db2015-10-28 14:23:40 -0700490TEST_F(InductionVarRangeTest, ConstantTripCountDown) {
491 BuildLoop(1000, graph_->GetIntConstant(0), -1);
Aart Bikaec3cce2015-10-14 17:44:55 -0700492 PerformInductionVarAnalysis();
493 InductionVarRange range(iva_);
494
Aart Bik389b3db2015-10-28 14:23:40 -0700495 Value v1, v2;
496 bool needs_finite_test = true;
497
498 // In context of header: known.
499 range.GetInductionRange(condition_, condition_->InputAt(0), &v1, &v2, &needs_finite_test);
500 EXPECT_FALSE(needs_finite_test);
501 ExpectEqual(Value(0), v1);
502 ExpectEqual(Value(1000), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800503 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bikaec3cce2015-10-14 17:44:55 -0700504
505 // In context of loop-body: known.
Aart Bik389b3db2015-10-28 14:23:40 -0700506 range.GetInductionRange(increment_, condition_->InputAt(0), &v1, &v2, &needs_finite_test);
507 EXPECT_FALSE(needs_finite_test);
508 ExpectEqual(Value(1), v1);
509 ExpectEqual(Value(1000), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800510 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bik389b3db2015-10-28 14:23:40 -0700511 range.GetInductionRange(increment_, increment_, &v1, &v2, &needs_finite_test);
512 EXPECT_FALSE(needs_finite_test);
513 ExpectEqual(Value(0), v1);
514 ExpectEqual(Value(999), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800515 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bikaec3cce2015-10-14 17:44:55 -0700516}
517
Aart Bik389b3db2015-10-28 14:23:40 -0700518TEST_F(InductionVarRangeTest, SymbolicTripCountUp) {
Calin Juravle27cfad02015-10-20 11:29:36 +0100519 HInstruction* parameter = new (&allocator_) HParameterValue(
520 graph_->GetDexFile(), 0, 0, Primitive::kPrimInt);
Aart Bikaec3cce2015-10-14 17:44:55 -0700521 entry_block_->AddInstruction(parameter);
Aart Bik389b3db2015-10-28 14:23:40 -0700522 BuildLoop(0, parameter, 1);
Aart Bikaec3cce2015-10-14 17:44:55 -0700523 PerformInductionVarAnalysis();
524 InductionVarRange range(iva_);
525
Aart Bik389b3db2015-10-28 14:23:40 -0700526 Value v1, v2;
527 bool needs_finite_test = true;
528 bool needs_taken_test = true;
529
530 // In context of header: upper unknown.
531 range.GetInductionRange(condition_, condition_->InputAt(0), &v1, &v2, &needs_finite_test);
532 EXPECT_FALSE(needs_finite_test);
533 ExpectEqual(Value(0), v1);
534 ExpectEqual(Value(), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800535 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bik389b3db2015-10-28 14:23:40 -0700536
537 // In context of loop-body: known.
538 range.GetInductionRange(increment_, condition_->InputAt(0), &v1, &v2, &needs_finite_test);
539 EXPECT_FALSE(needs_finite_test);
540 ExpectEqual(Value(0), v1);
541 ExpectEqual(Value(parameter, 1, -1), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800542 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bik389b3db2015-10-28 14:23:40 -0700543 range.GetInductionRange(increment_, increment_, &v1, &v2, &needs_finite_test);
544 EXPECT_FALSE(needs_finite_test);
545 ExpectEqual(Value(1), v1);
546 ExpectEqual(Value(parameter, 1, 0), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800547 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bik389b3db2015-10-28 14:23:40 -0700548
Aart Bikaec3cce2015-10-14 17:44:55 -0700549 HInstruction* lower = nullptr;
550 HInstruction* upper = nullptr;
Aart Bik389b3db2015-10-28 14:23:40 -0700551 HInstruction* taken = nullptr;
Aart Bikaec3cce2015-10-14 17:44:55 -0700552
553 // Can generate code in context of loop-body only.
Aart Bik389b3db2015-10-28 14:23:40 -0700554 EXPECT_FALSE(range.CanGenerateCode(
555 condition_, condition_->InputAt(0), &needs_finite_test, &needs_taken_test));
556 ASSERT_TRUE(range.CanGenerateCode(
557 increment_, condition_->InputAt(0), &needs_finite_test, &needs_taken_test));
558 EXPECT_FALSE(needs_finite_test);
559 EXPECT_TRUE(needs_taken_test);
Aart Bikaec3cce2015-10-14 17:44:55 -0700560
561 // Generates code.
Aart Bik389b3db2015-10-28 14:23:40 -0700562 range.GenerateRangeCode(increment_, condition_->InputAt(0), graph_, loop_preheader_, &lower, &upper);
Aart Bikaec3cce2015-10-14 17:44:55 -0700563
564 // Verify lower is 0+0.
565 ASSERT_TRUE(lower != nullptr);
566 ASSERT_TRUE(lower->IsAdd());
567 ASSERT_TRUE(lower->InputAt(0)->IsIntConstant());
568 EXPECT_EQ(0, lower->InputAt(0)->AsIntConstant()->GetValue());
569 ASSERT_TRUE(lower->InputAt(1)->IsIntConstant());
570 EXPECT_EQ(0, lower->InputAt(1)->AsIntConstant()->GetValue());
571
Aart Bik389b3db2015-10-28 14:23:40 -0700572 // Verify upper is (V-1)+0.
Aart Bikaec3cce2015-10-14 17:44:55 -0700573 ASSERT_TRUE(upper != nullptr);
574 ASSERT_TRUE(upper->IsAdd());
575 ASSERT_TRUE(upper->InputAt(0)->IsSub());
576 EXPECT_TRUE(upper->InputAt(0)->InputAt(0)->IsParameterValue());
577 ASSERT_TRUE(upper->InputAt(0)->InputAt(1)->IsIntConstant());
578 EXPECT_EQ(1, upper->InputAt(0)->InputAt(1)->AsIntConstant()->GetValue());
579 ASSERT_TRUE(upper->InputAt(1)->IsIntConstant());
580 EXPECT_EQ(0, upper->InputAt(1)->AsIntConstant()->GetValue());
Aart Bik389b3db2015-10-28 14:23:40 -0700581
582 // Verify taken-test is 0<V.
583 range.GenerateTakenTest(increment_, graph_, loop_preheader_, &taken);
584 ASSERT_TRUE(taken != nullptr);
585 ASSERT_TRUE(taken->IsLessThan());
586 ASSERT_TRUE(taken->InputAt(0)->IsIntConstant());
587 EXPECT_EQ(0, taken->InputAt(0)->AsIntConstant()->GetValue());
588 EXPECT_TRUE(taken->InputAt(1)->IsParameterValue());
589}
590
591TEST_F(InductionVarRangeTest, SymbolicTripCountDown) {
592 HInstruction* parameter = new (&allocator_) HParameterValue(
593 graph_->GetDexFile(), 0, 0, Primitive::kPrimInt);
594 entry_block_->AddInstruction(parameter);
595 BuildLoop(1000, parameter, -1);
596 PerformInductionVarAnalysis();
597 InductionVarRange range(iva_);
598
599 Value v1, v2;
600 bool needs_finite_test = true;
601 bool needs_taken_test = true;
602
603 // In context of header: lower unknown.
604 range.GetInductionRange(condition_, condition_->InputAt(0), &v1, &v2, &needs_finite_test);
605 EXPECT_FALSE(needs_finite_test);
606 ExpectEqual(Value(), v1);
607 ExpectEqual(Value(1000), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800608 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bik389b3db2015-10-28 14:23:40 -0700609
610 // In context of loop-body: known.
611 range.GetInductionRange(increment_, condition_->InputAt(0), &v1, &v2, &needs_finite_test);
612 EXPECT_FALSE(needs_finite_test);
613 ExpectEqual(Value(parameter, 1, 1), v1);
614 ExpectEqual(Value(1000), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800615 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bik389b3db2015-10-28 14:23:40 -0700616 range.GetInductionRange(increment_, increment_, &v1, &v2, &needs_finite_test);
617 EXPECT_FALSE(needs_finite_test);
618 ExpectEqual(Value(parameter, 1, 0), v1);
619 ExpectEqual(Value(999), v2);
Aart Bikb738d4f2015-12-03 11:23:35 -0800620 EXPECT_FALSE(range.RefineOuter(&v1, &v2));
Aart Bik389b3db2015-10-28 14:23:40 -0700621
622 HInstruction* lower = nullptr;
623 HInstruction* upper = nullptr;
624 HInstruction* taken = nullptr;
625
626 // Can generate code in context of loop-body only.
627 EXPECT_FALSE(range.CanGenerateCode(
628 condition_, condition_->InputAt(0), &needs_finite_test, &needs_taken_test));
629 ASSERT_TRUE(range.CanGenerateCode(
630 increment_, condition_->InputAt(0), &needs_finite_test, &needs_taken_test));
631 EXPECT_FALSE(needs_finite_test);
632 EXPECT_TRUE(needs_taken_test);
633
634 // Generates code.
635 range.GenerateRangeCode(increment_, condition_->InputAt(0), graph_, loop_preheader_, &lower, &upper);
636
637 // Verify lower is 1000-(-(V-1000)-1).
638 ASSERT_TRUE(lower != nullptr);
639 ASSERT_TRUE(lower->IsSub());
640 ASSERT_TRUE(lower->InputAt(0)->IsIntConstant());
641 EXPECT_EQ(1000, lower->InputAt(0)->AsIntConstant()->GetValue());
642 lower = lower->InputAt(1);
643 ASSERT_TRUE(lower->IsSub());
644 ASSERT_TRUE(lower->InputAt(1)->IsIntConstant());
645 EXPECT_EQ(1, lower->InputAt(1)->AsIntConstant()->GetValue());
646 lower = lower->InputAt(0);
647 ASSERT_TRUE(lower->IsNeg());
648 lower = lower->InputAt(0);
649 ASSERT_TRUE(lower->IsSub());
650 EXPECT_TRUE(lower->InputAt(0)->IsParameterValue());
651 ASSERT_TRUE(lower->InputAt(1)->IsIntConstant());
652 EXPECT_EQ(1000, lower->InputAt(1)->AsIntConstant()->GetValue());
653
654 // Verify upper is 1000-0.
655 ASSERT_TRUE(upper != nullptr);
656 ASSERT_TRUE(upper->IsSub());
657 ASSERT_TRUE(upper->InputAt(0)->IsIntConstant());
658 EXPECT_EQ(1000, upper->InputAt(0)->AsIntConstant()->GetValue());
659 ASSERT_TRUE(upper->InputAt(1)->IsIntConstant());
660 EXPECT_EQ(0, upper->InputAt(1)->AsIntConstant()->GetValue());
661
662 // Verify taken-test is 1000>V.
663 range.GenerateTakenTest(increment_, graph_, loop_preheader_, &taken);
664 ASSERT_TRUE(taken != nullptr);
665 ASSERT_TRUE(taken->IsGreaterThan());
666 ASSERT_TRUE(taken->InputAt(0)->IsIntConstant());
667 EXPECT_EQ(1000, taken->InputAt(0)->AsIntConstant()->GetValue());
668 EXPECT_TRUE(taken->InputAt(1)->IsParameterValue());
Aart Bikaec3cce2015-10-14 17:44:55 -0700669}
670
Aart Bikd14c5952015-09-08 15:25:15 -0700671} // namespace art