codegen_test.cc revision 8d5b8b295930aaa43255c4f0b74ece3ee8b43a47
1/* 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 <functional> 18 19#include "arch/instruction_set.h" 20#include "arch/arm/instruction_set_features_arm.h" 21#include "arch/arm64/instruction_set_features_arm64.h" 22#include "base/macros.h" 23#include "builder.h" 24#include "code_generator_arm.h" 25#include "code_generator_arm64.h" 26#include "code_generator_x86.h" 27#include "code_generator_x86_64.h" 28#include "common_compiler_test.h" 29#include "dex_file.h" 30#include "dex_instruction.h" 31#include "driver/compiler_options.h" 32#include "nodes.h" 33#include "optimizing_unit_test.h" 34#include "prepare_for_register_allocation.h" 35#include "register_allocator.h" 36#include "ssa_liveness_analysis.h" 37#include "utils.h" 38 39#include "gtest/gtest.h" 40 41namespace art { 42 43// Provide our own codegen, that ensures the C calling conventions 44// are preserved. Currently, ART and C do not match as R4 is caller-save 45// in ART, and callee-save in C. Alternatively, we could use or write 46// the stub that saves and restores all registers, but it is easier 47// to just overwrite the code generator. 48class TestCodeGeneratorARM : public arm::CodeGeneratorARM { 49 public: 50 TestCodeGeneratorARM(HGraph* graph, 51 const ArmInstructionSetFeatures& isa_features, 52 const CompilerOptions& compiler_options) 53 : arm::CodeGeneratorARM(graph, isa_features, compiler_options) { 54 AddAllocatedRegister(Location::RegisterLocation(6)); 55 AddAllocatedRegister(Location::RegisterLocation(7)); 56 } 57 58 void SetupBlockedRegisters(bool is_baseline) const OVERRIDE { 59 arm::CodeGeneratorARM::SetupBlockedRegisters(is_baseline); 60 blocked_core_registers_[4] = true; 61 blocked_core_registers_[6] = false; 62 blocked_core_registers_[7] = false; 63 // Makes pair R6-R7 available. 64 blocked_register_pairs_[6 >> 1] = false; 65 } 66}; 67 68class InternalCodeAllocator : public CodeAllocator { 69 public: 70 InternalCodeAllocator() : size_(0) { } 71 72 virtual uint8_t* Allocate(size_t size) { 73 size_ = size; 74 memory_.reset(new uint8_t[size]); 75 return memory_.get(); 76 } 77 78 size_t GetSize() const { return size_; } 79 uint8_t* GetMemory() const { return memory_.get(); } 80 81 private: 82 size_t size_; 83 std::unique_ptr<uint8_t[]> memory_; 84 85 DISALLOW_COPY_AND_ASSIGN(InternalCodeAllocator); 86}; 87 88template <typename Expected> 89static void Run(const InternalCodeAllocator& allocator, 90 const CodeGenerator& codegen, 91 bool has_result, 92 Expected expected) { 93 typedef Expected (*fptr)(); 94 CommonCompilerTest::MakeExecutable(allocator.GetMemory(), allocator.GetSize()); 95 fptr f = reinterpret_cast<fptr>(allocator.GetMemory()); 96 if (codegen.GetInstructionSet() == kThumb2) { 97 // For thumb we need the bottom bit set. 98 f = reinterpret_cast<fptr>(reinterpret_cast<uintptr_t>(f) + 1); 99 } 100 Expected result = f(); 101 if (has_result) { 102 ASSERT_EQ(result, expected); 103 } 104} 105 106template <typename Expected> 107static void RunCodeBaseline(HGraph* graph, bool has_result, Expected expected) { 108 InternalCodeAllocator allocator; 109 110 CompilerOptions compiler_options; 111 x86::CodeGeneratorX86 codegenX86(graph, compiler_options); 112 // We avoid doing a stack overflow check that requires the runtime being setup, 113 // by making sure the compiler knows the methods we are running are leaf methods. 114 codegenX86.CompileBaseline(&allocator, true); 115 if (kRuntimeISA == kX86) { 116 Run(allocator, codegenX86, has_result, expected); 117 } 118 119 std::unique_ptr<const ArmInstructionSetFeatures> features_arm( 120 ArmInstructionSetFeatures::FromCppDefines()); 121 TestCodeGeneratorARM codegenARM(graph, *features_arm.get(), compiler_options); 122 codegenARM.CompileBaseline(&allocator, true); 123 if (kRuntimeISA == kArm || kRuntimeISA == kThumb2) { 124 Run(allocator, codegenARM, has_result, expected); 125 } 126 127 x86_64::CodeGeneratorX86_64 codegenX86_64(graph, compiler_options); 128 codegenX86_64.CompileBaseline(&allocator, true); 129 if (kRuntimeISA == kX86_64) { 130 Run(allocator, codegenX86_64, has_result, expected); 131 } 132 133 std::unique_ptr<const Arm64InstructionSetFeatures> features_arm64( 134 Arm64InstructionSetFeatures::FromCppDefines()); 135 arm64::CodeGeneratorARM64 codegenARM64(graph, *features_arm64.get(), compiler_options); 136 codegenARM64.CompileBaseline(&allocator, true); 137 if (kRuntimeISA == kArm64) { 138 Run(allocator, codegenARM64, has_result, expected); 139 } 140} 141 142template <typename Expected> 143static void RunCodeOptimized(CodeGenerator* codegen, 144 HGraph* graph, 145 std::function<void(HGraph*)> hook_before_codegen, 146 bool has_result, 147 Expected expected) { 148 graph->BuildDominatorTree(); 149 SsaLivenessAnalysis liveness(*graph, codegen); 150 liveness.Analyze(); 151 152 RegisterAllocator register_allocator(graph->GetArena(), codegen, liveness); 153 register_allocator.AllocateRegisters(); 154 hook_before_codegen(graph); 155 156 InternalCodeAllocator allocator; 157 codegen->CompileOptimized(&allocator); 158 Run(allocator, *codegen, has_result, expected); 159} 160 161template <typename Expected> 162static void RunCodeOptimized(HGraph* graph, 163 std::function<void(HGraph*)> hook_before_codegen, 164 bool has_result, 165 Expected expected) { 166 CompilerOptions compiler_options; 167 if (kRuntimeISA == kArm || kRuntimeISA == kThumb2) { 168 TestCodeGeneratorARM codegenARM(graph, 169 *ArmInstructionSetFeatures::FromCppDefines(), 170 compiler_options); 171 RunCodeOptimized(&codegenARM, graph, hook_before_codegen, has_result, expected); 172 } else if (kRuntimeISA == kArm64) { 173 arm64::CodeGeneratorARM64 codegenARM64(graph, 174 *Arm64InstructionSetFeatures::FromCppDefines(), 175 compiler_options); 176 RunCodeOptimized(&codegenARM64, graph, hook_before_codegen, has_result, expected); 177 } else if (kRuntimeISA == kX86) { 178 x86::CodeGeneratorX86 codegenX86(graph, compiler_options); 179 RunCodeOptimized(&codegenX86, graph, hook_before_codegen, has_result, expected); 180 } else if (kRuntimeISA == kX86_64) { 181 x86_64::CodeGeneratorX86_64 codegenX86_64(graph, compiler_options); 182 RunCodeOptimized(&codegenX86_64, graph, hook_before_codegen, has_result, expected); 183 } 184} 185 186static void TestCode(const uint16_t* data, bool has_result = false, int32_t expected = 0) { 187 ArenaPool pool; 188 ArenaAllocator arena(&pool); 189 HGraph* graph = new (&arena) HGraph(&arena); 190 HGraphBuilder builder(graph); 191 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); 192 bool graph_built = builder.BuildGraph(*item); 193 ASSERT_TRUE(graph_built); 194 // Remove suspend checks, they cannot be executed in this context. 195 RemoveSuspendChecks(graph); 196 RunCodeBaseline(graph, has_result, expected); 197} 198 199static void TestCodeLong(const uint16_t* data, bool has_result, int64_t expected) { 200 ArenaPool pool; 201 ArenaAllocator arena(&pool); 202 HGraph* graph = new (&arena) HGraph(&arena); 203 HGraphBuilder builder(graph, Primitive::kPrimLong); 204 const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); 205 bool graph_built = builder.BuildGraph(*item); 206 ASSERT_TRUE(graph_built); 207 // Remove suspend checks, they cannot be executed in this context. 208 RemoveSuspendChecks(graph); 209 RunCodeBaseline(graph, has_result, expected); 210} 211 212TEST(CodegenTest, ReturnVoid) { 213 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM(Instruction::RETURN_VOID); 214 TestCode(data); 215} 216 217TEST(CodegenTest, CFG1) { 218 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( 219 Instruction::GOTO | 0x100, 220 Instruction::RETURN_VOID); 221 222 TestCode(data); 223} 224 225TEST(CodegenTest, CFG2) { 226 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( 227 Instruction::GOTO | 0x100, 228 Instruction::GOTO | 0x100, 229 Instruction::RETURN_VOID); 230 231 TestCode(data); 232} 233 234TEST(CodegenTest, CFG3) { 235 const uint16_t data1[] = ZERO_REGISTER_CODE_ITEM( 236 Instruction::GOTO | 0x200, 237 Instruction::RETURN_VOID, 238 Instruction::GOTO | 0xFF00); 239 240 TestCode(data1); 241 242 const uint16_t data2[] = ZERO_REGISTER_CODE_ITEM( 243 Instruction::GOTO_16, 3, 244 Instruction::RETURN_VOID, 245 Instruction::GOTO_16, 0xFFFF); 246 247 TestCode(data2); 248 249 const uint16_t data3[] = ZERO_REGISTER_CODE_ITEM( 250 Instruction::GOTO_32, 4, 0, 251 Instruction::RETURN_VOID, 252 Instruction::GOTO_32, 0xFFFF, 0xFFFF); 253 254 TestCode(data3); 255} 256 257TEST(CodegenTest, CFG4) { 258 const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( 259 Instruction::RETURN_VOID, 260 Instruction::GOTO | 0x100, 261 Instruction::GOTO | 0xFE00); 262 263 TestCode(data); 264} 265 266TEST(CodegenTest, CFG5) { 267 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 268 Instruction::CONST_4 | 0 | 0, 269 Instruction::IF_EQ, 3, 270 Instruction::GOTO | 0x100, 271 Instruction::RETURN_VOID); 272 273 TestCode(data); 274} 275 276TEST(CodegenTest, IntConstant) { 277 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 278 Instruction::CONST_4 | 0 | 0, 279 Instruction::RETURN_VOID); 280 281 TestCode(data); 282} 283 284TEST(CodegenTest, Return1) { 285 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 286 Instruction::CONST_4 | 0 | 0, 287 Instruction::RETURN | 0); 288 289 TestCode(data, true, 0); 290} 291 292TEST(CodegenTest, Return2) { 293 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 294 Instruction::CONST_4 | 0 | 0, 295 Instruction::CONST_4 | 0 | 1 << 8, 296 Instruction::RETURN | 1 << 8); 297 298 TestCode(data, true, 0); 299} 300 301TEST(CodegenTest, Return3) { 302 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 303 Instruction::CONST_4 | 0 | 0, 304 Instruction::CONST_4 | 1 << 8 | 1 << 12, 305 Instruction::RETURN | 1 << 8); 306 307 TestCode(data, true, 1); 308} 309 310TEST(CodegenTest, ReturnIf1) { 311 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 312 Instruction::CONST_4 | 0 | 0, 313 Instruction::CONST_4 | 1 << 8 | 1 << 12, 314 Instruction::IF_EQ, 3, 315 Instruction::RETURN | 0 << 8, 316 Instruction::RETURN | 1 << 8); 317 318 TestCode(data, true, 1); 319} 320 321TEST(CodegenTest, ReturnIf2) { 322 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 323 Instruction::CONST_4 | 0 | 0, 324 Instruction::CONST_4 | 1 << 8 | 1 << 12, 325 Instruction::IF_EQ | 0 << 4 | 1 << 8, 3, 326 Instruction::RETURN | 0 << 8, 327 Instruction::RETURN | 1 << 8); 328 329 TestCode(data, true, 0); 330} 331 332// Exercise bit-wise (one's complement) not-int instruction. 333#define NOT_INT_TEST(TEST_NAME, INPUT, EXPECTED_OUTPUT) \ 334TEST(CodegenTest, TEST_NAME) { \ 335 const int32_t input = INPUT; \ 336 const uint16_t input_lo = Low16Bits(input); \ 337 const uint16_t input_hi = High16Bits(input); \ 338 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( \ 339 Instruction::CONST | 0 << 8, input_lo, input_hi, \ 340 Instruction::NOT_INT | 1 << 8 | 0 << 12 , \ 341 Instruction::RETURN | 1 << 8); \ 342 \ 343 TestCode(data, true, EXPECTED_OUTPUT); \ 344} 345 346NOT_INT_TEST(ReturnNotIntMinus2, -2, 1) 347NOT_INT_TEST(ReturnNotIntMinus1, -1, 0) 348NOT_INT_TEST(ReturnNotInt0, 0, -1) 349NOT_INT_TEST(ReturnNotInt1, 1, -2) 350NOT_INT_TEST(ReturnNotIntINT32_MIN, -2147483648, 2147483647) // (2^31) - 1 351NOT_INT_TEST(ReturnNotIntINT32_MINPlus1, -2147483647, 2147483646) // (2^31) - 2 352NOT_INT_TEST(ReturnNotIntINT32_MAXMinus1, 2147483646, -2147483647) // -(2^31) - 1 353NOT_INT_TEST(ReturnNotIntINT32_MAX, 2147483647, -2147483648) // -(2^31) 354 355#undef NOT_INT_TEST 356 357// Exercise bit-wise (one's complement) not-long instruction. 358#define NOT_LONG_TEST(TEST_NAME, INPUT, EXPECTED_OUTPUT) \ 359TEST(CodegenTest, TEST_NAME) { \ 360 const int64_t input = INPUT; \ 361 const uint16_t word0 = Low16Bits(Low32Bits(input)); /* LSW. */ \ 362 const uint16_t word1 = High16Bits(Low32Bits(input)); \ 363 const uint16_t word2 = Low16Bits(High32Bits(input)); \ 364 const uint16_t word3 = High16Bits(High32Bits(input)); /* MSW. */ \ 365 const uint16_t data[] = FOUR_REGISTERS_CODE_ITEM( \ 366 Instruction::CONST_WIDE | 0 << 8, word0, word1, word2, word3, \ 367 Instruction::NOT_LONG | 2 << 8 | 0 << 12, \ 368 Instruction::RETURN_WIDE | 2 << 8); \ 369 \ 370 TestCodeLong(data, true, EXPECTED_OUTPUT); \ 371} 372 373NOT_LONG_TEST(ReturnNotLongMinus2, INT64_C(-2), INT64_C(1)) 374NOT_LONG_TEST(ReturnNotLongMinus1, INT64_C(-1), INT64_C(0)) 375NOT_LONG_TEST(ReturnNotLong0, INT64_C(0), INT64_C(-1)) 376NOT_LONG_TEST(ReturnNotLong1, INT64_C(1), INT64_C(-2)) 377 378NOT_LONG_TEST(ReturnNotLongINT32_MIN, 379 INT64_C(-2147483648), 380 INT64_C(2147483647)) // (2^31) - 1 381NOT_LONG_TEST(ReturnNotLongINT32_MINPlus1, 382 INT64_C(-2147483647), 383 INT64_C(2147483646)) // (2^31) - 2 384NOT_LONG_TEST(ReturnNotLongINT32_MAXMinus1, 385 INT64_C(2147483646), 386 INT64_C(-2147483647)) // -(2^31) - 1 387NOT_LONG_TEST(ReturnNotLongINT32_MAX, 388 INT64_C(2147483647), 389 INT64_C(-2147483648)) // -(2^31) 390 391// Note that the C++ compiler won't accept 392// INT64_C(-9223372036854775808) (that is, INT64_MIN) as a valid 393// int64_t literal, so we use INT64_C(-9223372036854775807)-1 instead. 394NOT_LONG_TEST(ReturnNotINT64_MIN, 395 INT64_C(-9223372036854775807)-1, 396 INT64_C(9223372036854775807)); // (2^63) - 1 397NOT_LONG_TEST(ReturnNotINT64_MINPlus1, 398 INT64_C(-9223372036854775807), 399 INT64_C(9223372036854775806)); // (2^63) - 2 400NOT_LONG_TEST(ReturnNotLongINT64_MAXMinus1, 401 INT64_C(9223372036854775806), 402 INT64_C(-9223372036854775807)); // -(2^63) - 1 403NOT_LONG_TEST(ReturnNotLongINT64_MAX, 404 INT64_C(9223372036854775807), 405 INT64_C(-9223372036854775807)-1); // -(2^63) 406 407#undef NOT_LONG_TEST 408 409TEST(CodegenTest, IntToLongOfLongToInt) { 410 const int64_t input = INT64_C(4294967296); // 2^32 411 const uint16_t word0 = Low16Bits(Low32Bits(input)); // LSW. 412 const uint16_t word1 = High16Bits(Low32Bits(input)); 413 const uint16_t word2 = Low16Bits(High32Bits(input)); 414 const uint16_t word3 = High16Bits(High32Bits(input)); // MSW. 415 const uint16_t data[] = FIVE_REGISTERS_CODE_ITEM( 416 Instruction::CONST_WIDE | 0 << 8, word0, word1, word2, word3, 417 Instruction::CONST_WIDE | 2 << 8, 1, 0, 0, 0, 418 Instruction::ADD_LONG | 0, 0 << 8 | 2, // v0 <- 2^32 + 1 419 Instruction::LONG_TO_INT | 4 << 8 | 0 << 12, 420 Instruction::INT_TO_LONG | 2 << 8 | 4 << 12, 421 Instruction::RETURN_WIDE | 2 << 8); 422 423 TestCodeLong(data, true, 1); 424} 425 426TEST(CodegenTest, ReturnAdd1) { 427 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 428 Instruction::CONST_4 | 3 << 12 | 0, 429 Instruction::CONST_4 | 4 << 12 | 1 << 8, 430 Instruction::ADD_INT, 1 << 8 | 0, 431 Instruction::RETURN); 432 433 TestCode(data, true, 7); 434} 435 436TEST(CodegenTest, ReturnAdd2) { 437 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 438 Instruction::CONST_4 | 3 << 12 | 0, 439 Instruction::CONST_4 | 4 << 12 | 1 << 8, 440 Instruction::ADD_INT_2ADDR | 1 << 12, 441 Instruction::RETURN); 442 443 TestCode(data, true, 7); 444} 445 446TEST(CodegenTest, ReturnAdd3) { 447 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 448 Instruction::CONST_4 | 4 << 12 | 0 << 8, 449 Instruction::ADD_INT_LIT8, 3 << 8 | 0, 450 Instruction::RETURN); 451 452 TestCode(data, true, 7); 453} 454 455TEST(CodegenTest, ReturnAdd4) { 456 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 457 Instruction::CONST_4 | 4 << 12 | 0 << 8, 458 Instruction::ADD_INT_LIT16, 3, 459 Instruction::RETURN); 460 461 TestCode(data, true, 7); 462} 463 464TEST(CodegenTest, NonMaterializedCondition) { 465 ArenaPool pool; 466 ArenaAllocator allocator(&pool); 467 468 HGraph* graph = new (&allocator) HGraph(&allocator); 469 HBasicBlock* entry = new (&allocator) HBasicBlock(graph); 470 graph->AddBlock(entry); 471 graph->SetEntryBlock(entry); 472 entry->AddInstruction(new (&allocator) HGoto()); 473 474 HBasicBlock* first_block = new (&allocator) HBasicBlock(graph); 475 graph->AddBlock(first_block); 476 entry->AddSuccessor(first_block); 477 HIntConstant* constant0 = graph->GetIntConstant(0); 478 HIntConstant* constant1 = graph->GetIntConstant(1); 479 HEqual* equal = new (&allocator) HEqual(constant0, constant0); 480 first_block->AddInstruction(equal); 481 first_block->AddInstruction(new (&allocator) HIf(equal)); 482 483 HBasicBlock* then = new (&allocator) HBasicBlock(graph); 484 HBasicBlock* else_ = new (&allocator) HBasicBlock(graph); 485 HBasicBlock* exit = new (&allocator) HBasicBlock(graph); 486 487 graph->AddBlock(then); 488 graph->AddBlock(else_); 489 graph->AddBlock(exit); 490 first_block->AddSuccessor(then); 491 first_block->AddSuccessor(else_); 492 then->AddSuccessor(exit); 493 else_->AddSuccessor(exit); 494 495 exit->AddInstruction(new (&allocator) HExit()); 496 then->AddInstruction(new (&allocator) HReturn(constant0)); 497 else_->AddInstruction(new (&allocator) HReturn(constant1)); 498 499 ASSERT_TRUE(equal->NeedsMaterialization()); 500 graph->BuildDominatorTree(); 501 PrepareForRegisterAllocation(graph).Run(); 502 ASSERT_FALSE(equal->NeedsMaterialization()); 503 504 auto hook_before_codegen = [](HGraph* graph_in) { 505 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors().Get(0); 506 HParallelMove* move = new (graph_in->GetArena()) HParallelMove(graph_in->GetArena()); 507 block->InsertInstructionBefore(move, block->GetLastInstruction()); 508 }; 509 510 RunCodeOptimized(graph, hook_before_codegen, true, 0); 511} 512 513#define MUL_TEST(TYPE, TEST_NAME) \ 514 TEST(CodegenTest, Return ## TEST_NAME) { \ 515 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( \ 516 Instruction::CONST_4 | 3 << 12 | 0, \ 517 Instruction::CONST_4 | 4 << 12 | 1 << 8, \ 518 Instruction::MUL_ ## TYPE, 1 << 8 | 0, \ 519 Instruction::RETURN); \ 520 \ 521 TestCode(data, true, 12); \ 522 } \ 523 \ 524 TEST(CodegenTest, Return ## TEST_NAME ## 2addr) { \ 525 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( \ 526 Instruction::CONST_4 | 3 << 12 | 0, \ 527 Instruction::CONST_4 | 4 << 12 | 1 << 8, \ 528 Instruction::MUL_ ## TYPE ## _2ADDR | 1 << 12, \ 529 Instruction::RETURN); \ 530 \ 531 TestCode(data, true, 12); \ 532 } 533 534MUL_TEST(INT, MulInt); 535MUL_TEST(LONG, MulLong); 536 537TEST(CodegenTest, ReturnMulIntLit8) { 538 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 539 Instruction::CONST_4 | 4 << 12 | 0 << 8, 540 Instruction::MUL_INT_LIT8, 3 << 8 | 0, 541 Instruction::RETURN); 542 543 TestCode(data, true, 12); 544} 545 546TEST(CodegenTest, ReturnMulIntLit16) { 547 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 548 Instruction::CONST_4 | 4 << 12 | 0 << 8, 549 Instruction::MUL_INT_LIT16, 3, 550 Instruction::RETURN); 551 552 TestCode(data, true, 12); 553} 554 555TEST(CodegenTest, MaterializedCondition1) { 556 // Check that condition are materialized correctly. A materialized condition 557 // should yield `1` if it evaluated to true, and `0` otherwise. 558 // We force the materialization of comparisons for different combinations of 559 // inputs and check the results. 560 561 int lhs[] = {1, 2, -1, 2, 0xabc}; 562 int rhs[] = {2, 1, 2, -1, 0xabc}; 563 564 for (size_t i = 0; i < arraysize(lhs); i++) { 565 ArenaPool pool; 566 ArenaAllocator allocator(&pool); 567 HGraph* graph = new (&allocator) HGraph(&allocator); 568 569 HBasicBlock* entry_block = new (&allocator) HBasicBlock(graph); 570 graph->AddBlock(entry_block); 571 graph->SetEntryBlock(entry_block); 572 entry_block->AddInstruction(new (&allocator) HGoto()); 573 HBasicBlock* code_block = new (&allocator) HBasicBlock(graph); 574 graph->AddBlock(code_block); 575 HBasicBlock* exit_block = new (&allocator) HBasicBlock(graph); 576 graph->AddBlock(exit_block); 577 exit_block->AddInstruction(new (&allocator) HExit()); 578 579 entry_block->AddSuccessor(code_block); 580 code_block->AddSuccessor(exit_block); 581 graph->SetExitBlock(exit_block); 582 583 HIntConstant* cst_lhs = graph->GetIntConstant(lhs[i]); 584 HIntConstant* cst_rhs = graph->GetIntConstant(rhs[i]); 585 HLessThan cmp_lt(cst_lhs, cst_rhs); 586 code_block->AddInstruction(&cmp_lt); 587 HReturn ret(&cmp_lt); 588 code_block->AddInstruction(&ret); 589 590 auto hook_before_codegen = [](HGraph* graph_in) { 591 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors().Get(0); 592 HParallelMove* move = new (graph_in->GetArena()) HParallelMove(graph_in->GetArena()); 593 block->InsertInstructionBefore(move, block->GetLastInstruction()); 594 }; 595 596 RunCodeOptimized(graph, hook_before_codegen, true, lhs[i] < rhs[i]); 597 } 598} 599 600TEST(CodegenTest, MaterializedCondition2) { 601 // Check that HIf correctly interprets a materialized condition. 602 // We force the materialization of comparisons for different combinations of 603 // inputs. An HIf takes the materialized combination as input and returns a 604 // value that we verify. 605 606 int lhs[] = {1, 2, -1, 2, 0xabc}; 607 int rhs[] = {2, 1, 2, -1, 0xabc}; 608 609 610 for (size_t i = 0; i < arraysize(lhs); i++) { 611 ArenaPool pool; 612 ArenaAllocator allocator(&pool); 613 HGraph* graph = new (&allocator) HGraph(&allocator); 614 615 HBasicBlock* entry_block = new (&allocator) HBasicBlock(graph); 616 graph->AddBlock(entry_block); 617 graph->SetEntryBlock(entry_block); 618 entry_block->AddInstruction(new (&allocator) HGoto()); 619 620 HBasicBlock* if_block = new (&allocator) HBasicBlock(graph); 621 graph->AddBlock(if_block); 622 HBasicBlock* if_true_block = new (&allocator) HBasicBlock(graph); 623 graph->AddBlock(if_true_block); 624 HBasicBlock* if_false_block = new (&allocator) HBasicBlock(graph); 625 graph->AddBlock(if_false_block); 626 HBasicBlock* exit_block = new (&allocator) HBasicBlock(graph); 627 graph->AddBlock(exit_block); 628 exit_block->AddInstruction(new (&allocator) HExit()); 629 630 graph->SetEntryBlock(entry_block); 631 entry_block->AddSuccessor(if_block); 632 if_block->AddSuccessor(if_true_block); 633 if_block->AddSuccessor(if_false_block); 634 if_true_block->AddSuccessor(exit_block); 635 if_false_block->AddSuccessor(exit_block); 636 graph->SetExitBlock(exit_block); 637 638 HIntConstant* cst_lhs = graph->GetIntConstant(lhs[i]); 639 HIntConstant* cst_rhs = graph->GetIntConstant(rhs[i]); 640 HLessThan cmp_lt(cst_lhs, cst_rhs); 641 if_block->AddInstruction(&cmp_lt); 642 // We insert a temporary to separate the HIf from the HLessThan and force 643 // the materialization of the condition. 644 HTemporary force_materialization(0); 645 if_block->AddInstruction(&force_materialization); 646 HIf if_lt(&cmp_lt); 647 if_block->AddInstruction(&if_lt); 648 649 HIntConstant* cst_lt = graph->GetIntConstant(1); 650 HReturn ret_lt(cst_lt); 651 if_true_block->AddInstruction(&ret_lt); 652 HIntConstant* cst_ge = graph->GetIntConstant(0); 653 HReturn ret_ge(cst_ge); 654 if_false_block->AddInstruction(&ret_ge); 655 656 auto hook_before_codegen = [](HGraph* graph_in) { 657 HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors().Get(0); 658 HParallelMove* move = new (graph_in->GetArena()) HParallelMove(graph_in->GetArena()); 659 block->InsertInstructionBefore(move, block->GetLastInstruction()); 660 }; 661 662 RunCodeOptimized(graph, hook_before_codegen, true, lhs[i] < rhs[i]); 663 } 664} 665 666TEST(CodegenTest, ReturnDivIntLit8) { 667 const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 668 Instruction::CONST_4 | 4 << 12 | 0 << 8, 669 Instruction::DIV_INT_LIT8, 3 << 8 | 0, 670 Instruction::RETURN); 671 672 TestCode(data, true, 1); 673} 674 675TEST(CodegenTest, ReturnDivInt2Addr) { 676 const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 677 Instruction::CONST_4 | 4 << 12 | 0, 678 Instruction::CONST_4 | 2 << 12 | 1 << 8, 679 Instruction::DIV_INT_2ADDR | 1 << 12, 680 Instruction::RETURN); 681 682 TestCode(data, true, 2); 683} 684 685} // namespace art 686