blob: d7ac10d164428511117414fa3376bfb1a9c8139e [file] [log] [blame]
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +00001/*
2 * Copyright (C) 2014 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
17#include "builder.h"
18#include "code_generator.h"
19#include "common_compiler_test.h"
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +000020#include "dex_file.h"
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000021#include "dex_instruction.h"
22#include "instruction_set.h"
23#include "nodes.h"
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +000024#include "optimizing_unit_test.h"
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000025
26#include "gtest/gtest.h"
27
28namespace art {
29
Nicolas Geoffray787c3072014-03-17 10:20:19 +000030class InternalCodeAllocator : public CodeAllocator {
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000031 public:
Nicolas Geoffray787c3072014-03-17 10:20:19 +000032 InternalCodeAllocator() { }
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000033
34 virtual uint8_t* Allocate(size_t size) {
Nicolas Geoffray787c3072014-03-17 10:20:19 +000035 size_ = size;
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000036 memory_.reset(new uint8_t[size]);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000037 return memory_.get();
38 }
39
Nicolas Geoffray787c3072014-03-17 10:20:19 +000040 size_t GetSize() const { return size_; }
41 uint8_t* GetMemory() const { return memory_.get(); }
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000042
43 private:
Nicolas Geoffray787c3072014-03-17 10:20:19 +000044 size_t size_;
Ian Rogers700a4022014-05-19 16:49:03 -070045 std::unique_ptr<uint8_t[]> memory_;
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000046
Nicolas Geoffray787c3072014-03-17 10:20:19 +000047 DISALLOW_COPY_AND_ASSIGN(InternalCodeAllocator);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000048};
49
Nicolas Geoffray49c105d2014-06-13 10:29:43 +010050#if defined(__i386__) || defined(__arm__) || defined(__x86_64__)
Nicolas Geoffray8d486732014-07-16 16:23:40 +010051static void Run(const InternalCodeAllocator& allocator,
52 const CodeGenerator& codegen,
53 bool has_result,
54 int32_t expected) {
Nicolas Geoffray9cf35522014-06-09 18:40:10 +010055 typedef int32_t (*fptr)();
56 CommonCompilerTest::MakeExecutable(allocator.GetMemory(), allocator.GetSize());
Dave Allison20dfc792014-06-16 20:44:29 -070057 fptr f = reinterpret_cast<fptr>(allocator.GetMemory());
Nicolas Geoffray8d486732014-07-16 16:23:40 +010058 if (codegen.GetInstructionSet() == kThumb2) {
59 // For thumb we need the bottom bit set.
60 f = reinterpret_cast<fptr>(reinterpret_cast<uintptr_t>(f) + 1);
61 }
Dave Allison20dfc792014-06-16 20:44:29 -070062 int32_t result = f();
Nicolas Geoffray9cf35522014-06-09 18:40:10 +010063 if (has_result) {
64 CHECK_EQ(result, expected);
65 }
66}
Nicolas Geoffray49c105d2014-06-13 10:29:43 +010067#endif
Nicolas Geoffray9cf35522014-06-09 18:40:10 +010068
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +000069static void TestCode(const uint16_t* data, bool has_result = false, int32_t expected = 0) {
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000070 ArenaPool pool;
71 ArenaAllocator arena(&pool);
72 HGraphBuilder builder(&arena);
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +000073 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data);
74 HGraph* graph = builder.BuildGraph(*item);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000075 ASSERT_NE(graph, nullptr);
Nicolas Geoffray787c3072014-03-17 10:20:19 +000076 InternalCodeAllocator allocator;
Nicolas Geoffray9cf35522014-06-09 18:40:10 +010077
Nicolas Geoffray787c3072014-03-17 10:20:19 +000078 CodeGenerator* codegen = CodeGenerator::Create(&arena, graph, kX86);
Nicolas Geoffray73e80c32014-07-22 17:47:56 +010079 // We avoid doing a stack overflow check that requires the runtime being setup,
80 // by making sure the compiler knows the methods we are running are leaf methods.
81 codegen->CompileBaseline(&allocator, true);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000082#if defined(__i386__)
Nicolas Geoffray8d486732014-07-16 16:23:40 +010083 Run(allocator, *codegen, has_result, expected);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000084#endif
Nicolas Geoffray9cf35522014-06-09 18:40:10 +010085
Nicolas Geoffray787c3072014-03-17 10:20:19 +000086 codegen = CodeGenerator::Create(&arena, graph, kArm);
Nicolas Geoffray73e80c32014-07-22 17:47:56 +010087 codegen->CompileBaseline(&allocator, true);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000088#if defined(__arm__)
Nicolas Geoffray8d486732014-07-16 16:23:40 +010089 Run(allocator, *codegen, has_result, expected);
Nicolas Geoffray9cf35522014-06-09 18:40:10 +010090#endif
91
92 codegen = CodeGenerator::Create(&arena, graph, kX86_64);
Nicolas Geoffray73e80c32014-07-22 17:47:56 +010093 codegen->CompileBaseline(&allocator, true);
Nicolas Geoffray9cf35522014-06-09 18:40:10 +010094#if defined(__x86_64__)
Nicolas Geoffray8d486732014-07-16 16:23:40 +010095 Run(allocator, *codegen, has_result, expected);
Nicolas Geoffray39d57e22014-03-13 10:28:41 +000096#endif
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +000097}
98
99TEST(CodegenTest, ReturnVoid) {
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000100 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM(Instruction::RETURN_VOID);
101 TestCode(data);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000102}
103
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +0000104TEST(CodegenTest, CFG1) {
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000105 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM(
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000106 Instruction::GOTO | 0x100,
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000107 Instruction::RETURN_VOID);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000108
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000109 TestCode(data);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000110}
111
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +0000112TEST(CodegenTest, CFG2) {
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000113 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM(
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000114 Instruction::GOTO | 0x100,
115 Instruction::GOTO | 0x100,
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000116 Instruction::RETURN_VOID);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000117
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000118 TestCode(data);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000119}
120
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +0000121TEST(CodegenTest, CFG3) {
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000122 const uint16_t data1[] = ZERO_REGISTER_CODE_ITEM(
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000123 Instruction::GOTO | 0x200,
124 Instruction::RETURN_VOID,
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000125 Instruction::GOTO | 0xFF00);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000126
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000127 TestCode(data1);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000128
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000129 const uint16_t data2[] = ZERO_REGISTER_CODE_ITEM(
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000130 Instruction::GOTO_16, 3,
131 Instruction::RETURN_VOID,
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000132 Instruction::GOTO_16, 0xFFFF);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000133
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000134 TestCode(data2);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000135
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000136 const uint16_t data3[] = ZERO_REGISTER_CODE_ITEM(
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000137 Instruction::GOTO_32, 4, 0,
138 Instruction::RETURN_VOID,
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000139 Instruction::GOTO_32, 0xFFFF, 0xFFFF);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000140
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000141 TestCode(data3);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000142}
143
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +0000144TEST(CodegenTest, CFG4) {
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000145 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM(
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000146 Instruction::RETURN_VOID,
147 Instruction::GOTO | 0x100,
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000148 Instruction::GOTO | 0xFE00);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000149
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000150 TestCode(data);
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000151}
152
Nicolas Geoffraybab4ed72014-03-11 17:53:17 +0000153TEST(CodegenTest, CFG5) {
154 const uint16_t data[] = ONE_REGISTER_CODE_ITEM(
155 Instruction::CONST_4 | 0 | 0,
156 Instruction::IF_EQ, 3,
157 Instruction::GOTO | 0x100,
158 Instruction::RETURN_VOID);
159
160 TestCode(data);
161}
162
163TEST(CodegenTest, IntConstant) {
164 const uint16_t data[] = ONE_REGISTER_CODE_ITEM(
165 Instruction::CONST_4 | 0 | 0,
166 Instruction::RETURN_VOID);
167
168 TestCode(data);
169}
170
171TEST(CodegenTest, Return1) {
172 const uint16_t data[] = ONE_REGISTER_CODE_ITEM(
173 Instruction::CONST_4 | 0 | 0,
174 Instruction::RETURN | 0);
175
176 TestCode(data, true, 0);
177}
178
179TEST(CodegenTest, Return2) {
180 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM(
181 Instruction::CONST_4 | 0 | 0,
182 Instruction::CONST_4 | 0 | 1 << 8,
183 Instruction::RETURN | 1 << 8);
184
185 TestCode(data, true, 0);
186}
187
188TEST(CodegenTest, Return3) {
189 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM(
190 Instruction::CONST_4 | 0 | 0,
191 Instruction::CONST_4 | 1 << 8 | 1 << 12,
192 Instruction::RETURN | 1 << 8);
193
194 TestCode(data, true, 1);
195}
196
197TEST(CodegenTest, ReturnIf1) {
198 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM(
199 Instruction::CONST_4 | 0 | 0,
200 Instruction::CONST_4 | 1 << 8 | 1 << 12,
201 Instruction::IF_EQ, 3,
202 Instruction::RETURN | 0 << 8,
203 Instruction::RETURN | 1 << 8);
204
205 TestCode(data, true, 1);
206}
207
208TEST(CodegenTest, ReturnIf2) {
209 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM(
210 Instruction::CONST_4 | 0 | 0,
211 Instruction::CONST_4 | 1 << 8 | 1 << 12,
212 Instruction::IF_EQ | 0 << 4 | 1 << 8, 3,
213 Instruction::RETURN | 0 << 8,
214 Instruction::RETURN | 1 << 8);
215
216 TestCode(data, true, 0);
217}
218
Nicolas Geoffrayd8ee7372014-03-28 15:43:40 +0000219TEST(CodegenTest, ReturnAdd1) {
220 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM(
221 Instruction::CONST_4 | 3 << 12 | 0,
222 Instruction::CONST_4 | 4 << 12 | 1 << 8,
223 Instruction::ADD_INT, 1 << 8 | 0,
224 Instruction::RETURN);
225
226 TestCode(data, true, 7);
227}
228
229TEST(CodegenTest, ReturnAdd2) {
230 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM(
231 Instruction::CONST_4 | 3 << 12 | 0,
232 Instruction::CONST_4 | 4 << 12 | 1 << 8,
233 Instruction::ADD_INT_2ADDR | 1 << 12,
234 Instruction::RETURN);
235
236 TestCode(data, true, 7);
237}
238
239TEST(CodegenTest, ReturnAdd3) {
240 const uint16_t data[] = ONE_REGISTER_CODE_ITEM(
241 Instruction::CONST_4 | 4 << 12 | 0 << 8,
242 Instruction::ADD_INT_LIT8, 3 << 8 | 0,
243 Instruction::RETURN);
244
245 TestCode(data, true, 7);
246}
247
248TEST(CodegenTest, ReturnAdd4) {
249 const uint16_t data[] = ONE_REGISTER_CODE_ITEM(
250 Instruction::CONST_4 | 4 << 12 | 0 << 8,
251 Instruction::ADD_INT_LIT16, 3,
252 Instruction::RETURN);
253
254 TestCode(data, true, 7);
255}
256
Nicolas Geoffrayd4dd2552014-02-28 10:23:58 +0000257} // namespace art