codegen_test.cc revision 946e143941d456a4ec666f7f54719c65c5aa3f5d
165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian/* 265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * Copyright (C) 2014 The Android Open Source Project 365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * 465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * Licensed under the Apache License, Version 2.0 (the "License"); 565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * you may not use this file except in compliance with the License. 665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * You may obtain a copy of the License at 765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * 865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * http://www.apache.org/licenses/LICENSE-2.0 965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * 1065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * Unless required by applicable law or agreed to in writing, software 1165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * distributed under the License is distributed on an "AS IS" BASIS, 1265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 1365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * See the License for the specific language governing permissions and 1465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian * limitations under the License. 1565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian */ 1665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 1765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include <functional> 1865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 1965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "base/macros.h" 20153b9fe667e6e78e0218ff0159353097428c7657Glenn Kasten#include "builder.h" 2165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "code_generator_arm.h" 2265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "code_generator_arm64.h" 2365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "code_generator_x86.h" 2465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "code_generator_x86_64.h" 2565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "common_compiler_test.h" 2665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "dex_file.h" 2765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "dex_instruction.h" 2865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "instruction_set.h" 29f1047e87767be1acd2c32f4d36028d1d0014f4c0Eric Laurent#include "nodes.h" 3065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "optimizing_unit_test.h" 3165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "prepare_for_register_allocation.h" 32f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov#include "register_allocator.h" 33f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov#include "ssa_liveness_analysis.h" 34f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov#include "utils.h" 3565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 3665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#include "gtest/gtest.h" 3765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 3844deb053252a3bd2f57a007ab9560f4924f62394Glenn Kastennamespace art { 3965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 407c7f10bd4fda9a084e5e7f0eb3a040dfcbf01745Eric Laurentclass InternalCodeAllocator : public CodeAllocator { 41c84d9d235679a4d48245b316b7b2e4c0b19413e7Chih-Hung Hsieh public: 4265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian InternalCodeAllocator() { } 4364760240f931714858a59c1579f07264d7182ba2Dima Zavin 447394a4f358fa9908a9f0a7c954b65c399f4268e6Dima Zavin virtual uint8_t* Allocate(size_t size) { 4561a4fac2e3ec271241e3a4f405d7357b7f6ca4c2Mikhail Naganov size_ = size; 46f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov memory_.reset(new uint8_t[size]); 47f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov return memory_.get(); 4865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian } 4965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 508dad0e31c2366c501bd1d600261d0af35a6ca786Glenn Kasten size_t GetSize() const { return size_; } 518dad0e31c2366c501bd1d600261d0af35a6ca786Glenn Kasten uint8_t* GetMemory() const { return memory_.get(); } 5265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 5365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian private: 5422ecc912a87099cff8cadc424cd12f85c118673fGlenn Kasten size_t size_; 5565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian std::unique_ptr<uint8_t[]> memory_; 560ede8924b98c2967be2795e8d4f9837d8d3f094cEric Laurent 575fa8c4bf81275d5e1f5ef71bc66fc22e3152eeb0Christer Fletcher DISALLOW_COPY_AND_ASSIGN(InternalCodeAllocator); 58f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov}; 59fce7a473248381cc83a01855f92581077d3c9ee2Dima Zavin 6065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopiantemplate <typename Expected> 6165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopianstatic void Run(const InternalCodeAllocator& allocator, 6265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const CodeGenerator& codegen, 63dce54a1492c410ad0d93253b341fb33305337505Eric Laurent bool has_result, 64bb6c9a05840d924b502ce0f1868fca4881ada1edEric Laurent Expected expected) { 6565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian typedef Expected (*fptr)(); 66f5ada6edcc83bb1b313abcd4c4fbdc4f7724f04dEric Laurent CommonCompilerTest::MakeExecutable(allocator.GetMemory(), allocator.GetSize()); 67f5ada6edcc83bb1b313abcd4c4fbdc4f7724f04dEric Laurent fptr f = reinterpret_cast<fptr>(allocator.GetMemory()); 68f5ada6edcc83bb1b313abcd4c4fbdc4f7724f04dEric Laurent if (codegen.GetInstructionSet() == kThumb2) { 69f5ada6edcc83bb1b313abcd4c4fbdc4f7724f04dEric Laurent // For thumb we need the bottom bit set. 708b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent f = reinterpret_cast<fptr>(reinterpret_cast<uintptr_t>(f) + 1); 718b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent } 72935752053ef2691dbb6d5a6d149e0e362c6e3c74Eric Laurent Expected result = f(); 738b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent if (has_result) { 748b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent ASSERT_EQ(result, expected); 758b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent } 768b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent} 778b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent 788b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurenttemplate <typename Expected> 79dce54a1492c410ad0d93253b341fb33305337505Eric Laurentstatic void RunCodeBaseline(HGraph* graph, bool has_result, Expected expected) { 808b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent InternalCodeAllocator allocator; 818b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent 828b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent x86::CodeGeneratorX86 codegenX86(graph); 83ba2b43990a7b4f0f2c425cf6cdfc63376a45772cbryant_liu // We avoid doing a stack overflow check that requires the runtime being setup, 848b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent // by making sure the compiler knows the methods we are running are leaf methods. 858b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent codegenX86.CompileBaseline(&allocator, true); 868b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent if (kRuntimeISA == kX86) { 878b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent Run(allocator, codegenX86, has_result, expected); 888b1e80bf1e9f214feea219cfe981ba533b806003Eric Laurent } 89f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 90f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov arm::CodeGeneratorARM codegenARM(graph); 91f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov codegenARM.CompileBaseline(&allocator, true); 9265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian if (kRuntimeISA == kArm || kRuntimeISA == kThumb2) { 9365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Run(allocator, codegenARM, has_result, expected); 9465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian } 9565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 9665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian x86_64::CodeGeneratorX86_64 codegenX86_64(graph); 9765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian codegenX86_64.CompileBaseline(&allocator, true); 98657ff61389d7316f798d4abe03efac56fd528d91Eric Laurent if (kRuntimeISA == kX86_64) { 997c7f10bd4fda9a084e5e7f0eb3a040dfcbf01745Eric Laurent Run(allocator, codegenX86_64, has_result, expected); 100f269b8e0e9ab950fc6652b9594b7a3431c81630cEric Laurent } 101dce54a1492c410ad0d93253b341fb33305337505Eric Laurent 102b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent arm64::CodeGeneratorARM64 codegenARM64(graph); 103b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent codegenARM64.CompileBaseline(&allocator, true); 104ba2b43990a7b4f0f2c425cf6cdfc63376a45772cbryant_liu if (kRuntimeISA == kArm64) { 105f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Run(allocator, codegenARM64, has_result, expected); 106f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov } 107f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov} 108b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 109b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurenttemplate <typename Expected> 110b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurentstatic void RunCodeOptimized(CodeGenerator* codegen, 111b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent HGraph* graph, 112b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent std::function<void(HGraph*)> hook_before_codegen, 113b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent bool has_result, 114125902529aed131abc00210c36dc9ff03d9e8120Eric Laurent Expected expected) { 115125902529aed131abc00210c36dc9ff03d9e8120Eric Laurent SsaLivenessAnalysis liveness(*graph, codegen); 116125902529aed131abc00210c36dc9ff03d9e8120Eric Laurent liveness.Analyze(); 117125902529aed131abc00210c36dc9ff03d9e8120Eric Laurent 1180ebd5f95b68a3a5c9e5509f21938c9e51e74d71bEric Laurent RegisterAllocator register_allocator(graph->GetArena(), codegen, liveness); 119b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent register_allocator.AllocateRegisters(); 120b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent hook_before_codegen(graph); 121b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 122b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent InternalCodeAllocator allocator; 123b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent codegen->CompileOptimized(&allocator); 124b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Run(allocator, *codegen, has_result, expected); 125b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent} 126b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 127b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurenttemplate <typename Expected> 128b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurentstatic void RunCodeOptimized(HGraph* graph, 129f888020c6e2735624f2b2a30e72aca24e17b8b4dMarco Nelissen std::function<void(HGraph*)> hook_before_codegen, 130b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent bool has_result, 131b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Expected expected) { 132b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent if (kRuntimeISA == kX86) { 133b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent x86::CodeGeneratorX86 codegenX86(graph); 134e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent RunCodeOptimized(&codegenX86, graph, hook_before_codegen, has_result, expected); 135e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent } else if (kRuntimeISA == kArm || kRuntimeISA == kThumb2) { 136e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent arm::CodeGeneratorARM codegenARM(graph); 137e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent RunCodeOptimized(&codegenARM, graph, hook_before_codegen, has_result, expected); 138e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent } else if (kRuntimeISA == kX86_64) { 139e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent x86_64::CodeGeneratorX86_64 codegenX86_64(graph); 140e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent RunCodeOptimized(&codegenX86_64, graph, hook_before_codegen, has_result, expected); 141e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent } 142e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent} 143e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent 144e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurentstatic void TestCode(const uint16_t* data, bool has_result = false, int32_t expected = 0) { 145b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent ArenaPool pool; 146b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent ArenaAllocator arena(&pool); 147b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent HGraphBuilder builder(&arena); 1480ebd5f95b68a3a5c9e5509f21938c9e51e74d71bEric Laurent const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); 1490ebd5f95b68a3a5c9e5509f21938c9e51e74d71bEric Laurent HGraph* graph = builder.BuildGraph(*item); 1500ebd5f95b68a3a5c9e5509f21938c9e51e74d71bEric Laurent ASSERT_NE(graph, nullptr); 1510ebd5f95b68a3a5c9e5509f21938c9e51e74d71bEric Laurent // Remove suspend checks, they cannot be executed in this context. 1520ebd5f95b68a3a5c9e5509f21938c9e51e74d71bEric Laurent RemoveSuspendChecks(graph); 1530ebd5f95b68a3a5c9e5509f21938c9e51e74d71bEric Laurent RunCodeBaseline(graph, has_result, expected); 154b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent} 15510b7123bd6ce29fe756422aeedc5cfe469c4309fEric Laurent 1568c7e6dac6f5eb38cef627dab92eac8b38513450cEric Laurentstatic void TestCodeLong(const uint16_t* data, bool has_result, int64_t expected) { 157b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent ArenaPool pool; 1580ebd5f95b68a3a5c9e5509f21938c9e51e74d71bEric Laurent ArenaAllocator arena(&pool); 159b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent HGraphBuilder builder(&arena, Primitive::kPrimLong); 160b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent const DexFile::CodeItem* item = reinterpret_cast<const DexFile::CodeItem*>(data); 161b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent HGraph* graph = builder.BuildGraph(*item); 162b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent ASSERT_NE(graph, nullptr); 163b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent // Remove suspend checks, they cannot be executed in this context. 164b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent RemoveSuspendChecks(graph); 165b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent RunCodeBaseline(graph, has_result, expected); 166b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent} 167b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 1680ebd5f95b68a3a5c9e5509f21938c9e51e74d71bEric LaurentTEST(CodegenTest, ReturnVoid) { 169b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent const uint16_t data[] = ZERO_REGISTER_CODE_ITEM(Instruction::RETURN_VOID); 170b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent TestCode(data); 171b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent} 172b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 173b52c152d553556b2d227ffc943489de0c60b4b02Eric LaurentTEST(CodegenTest, CFG1) { 174b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( 175b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::GOTO | 0x100, 176b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::RETURN_VOID); 17765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 17865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian TestCode(data); 179b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent} 180b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 1810ebd5f95b68a3a5c9e5509f21938c9e51e74d71bEric LaurentTEST(CodegenTest, CFG2) { 182b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( 183b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::GOTO | 0x100, 184b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::GOTO | 0x100, 185b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::RETURN_VOID); 186b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 187e964d4e421e2d1ca937227a580c0c837091a11e3Chih-Hung Hsieh TestCode(data); 188de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi} 189de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi 190de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel TriviTEST(CodegenTest, CFG3) { 191de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi const uint16_t data1[] = ZERO_REGISTER_CODE_ITEM( 192de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi Instruction::GOTO | 0x200, 193de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi Instruction::RETURN_VOID, 194e964d4e421e2d1ca937227a580c0c837091a11e3Chih-Hung Hsieh Instruction::GOTO | 0xFF00); 195de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi 196de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi TestCode(data1); 197de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi 198de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi const uint16_t data2[] = ZERO_REGISTER_CODE_ITEM( 199de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi Instruction::GOTO_16, 3, 200de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi Instruction::RETURN_VOID, 201de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi Instruction::GOTO_16, 0xFFFF); 202ac4e42982d4537732b30e71c9a00ba0077944984Jean-Michel Trivi 203ac4e42982d4537732b30e71c9a00ba0077944984Jean-Michel Trivi TestCode(data2); 2048c7cf3b7d0d7bccb9affbc34ae2ab2d6b332f972Jean-Michel Trivi 2052f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi const uint16_t data3[] = ZERO_REGISTER_CODE_ITEM( 206ac4e42982d4537732b30e71c9a00ba0077944984Jean-Michel Trivi Instruction::GOTO_32, 4, 0, 2078c7cf3b7d0d7bccb9affbc34ae2ab2d6b332f972Jean-Michel Trivi Instruction::RETURN_VOID, 2082f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi Instruction::GOTO_32, 0xFFFF, 0xFFFF); 2092f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi 210ac4e42982d4537732b30e71c9a00ba0077944984Jean-Michel Trivi TestCode(data3); 211ac4e42982d4537732b30e71c9a00ba0077944984Jean-Michel Trivi} 2128c7cf3b7d0d7bccb9affbc34ae2ab2d6b332f972Jean-Michel Trivi 2132f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel TriviTEST(CodegenTest, CFG4) { 2142f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi const uint16_t data[] = ZERO_REGISTER_CODE_ITEM( 2152f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi Instruction::RETURN_VOID, 216ac4e42982d4537732b30e71c9a00ba0077944984Jean-Michel Trivi Instruction::GOTO | 0x100, 2178c7cf3b7d0d7bccb9affbc34ae2ab2d6b332f972Jean-Michel Trivi Instruction::GOTO | 0xFE00); 2182f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi 2192f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi TestCode(data); 2202f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi} 2212f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi 2222f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel TriviTEST(CodegenTest, CFG5) { 2232f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 2242f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi Instruction::CONST_4 | 0 | 0, 2252f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi Instruction::IF_EQ, 3, 2262f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi Instruction::GOTO | 0x100, 2272f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi Instruction::RETURN_VOID); 2282f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi 2292f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi TestCode(data); 2302f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi} 2312f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi 2322f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel TriviTEST(CodegenTest, IntConstant) { 2332f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 234e1715a465a29db625da9d0ea365edf371e39e201Eric Laurent Instruction::CONST_4 | 0 | 0, 235e1715a465a29db625da9d0ea365edf371e39e201Eric Laurent Instruction::RETURN_VOID); 236e1715a465a29db625da9d0ea365edf371e39e201Eric Laurent 237e1715a465a29db625da9d0ea365edf371e39e201Eric Laurent TestCode(data); 238e1715a465a29db625da9d0ea365edf371e39e201Eric Laurent} 239e1715a465a29db625da9d0ea365edf371e39e201Eric Laurent 240b52c152d553556b2d227ffc943489de0c60b4b02Eric LaurentTEST(CodegenTest, Return1) { 241b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 242b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::CONST_4 | 0 | 0, 243e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent Instruction::RETURN | 0); 244e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent 245b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent TestCode(data, true, 0); 246b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent} 247b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 248b52c152d553556b2d227ffc943489de0c60b4b02Eric LaurentTEST(CodegenTest, Return2) { 249b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 250b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::CONST_4 | 0 | 0, 251b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::CONST_4 | 0 | 1 << 8, 252b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::RETURN | 1 << 8); 253b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 254b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent TestCode(data, true, 0); 255b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent} 256b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 257b52c152d553556b2d227ffc943489de0c60b4b02Eric LaurentTEST(CodegenTest, Return3) { 258b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 259b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::CONST_4 | 0 | 0, 260b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::CONST_4 | 1 << 8 | 1 << 12, 261b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::RETURN | 1 << 8); 262b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 263e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent TestCode(data, true, 1); 264b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent} 265b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 266b52c152d553556b2d227ffc943489de0c60b4b02Eric LaurentTEST(CodegenTest, ReturnIf1) { 267b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 268b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::CONST_4 | 0 | 0, 269b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::CONST_4 | 1 << 8 | 1 << 12, 270e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent Instruction::IF_EQ, 3, 271b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::RETURN | 0 << 8, 272b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent Instruction::RETURN | 1 << 8); 273b52c152d553556b2d227ffc943489de0c60b4b02Eric Laurent 27457dae99c9fcd6becd2b5ed0c53f277ba4d7dbcfcEric Laurent TestCode(data, true, 1); 275de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi} 276e964d4e421e2d1ca937227a580c0c837091a11e3Chih-Hung Hsieh 277de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel TriviTEST(CodegenTest, ReturnIf2) { 278f1047e87767be1acd2c32f4d36028d1d0014f4c0Eric Laurent const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 2792f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi Instruction::CONST_4 | 0 | 0, 2802f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi Instruction::CONST_4 | 1 << 8 | 1 << 12, 2812f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi Instruction::IF_EQ | 0 << 4 | 1 << 8, 3, 2822f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi Instruction::RETURN | 0 << 8, 2832f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi Instruction::RETURN | 1 << 8); 284ac4e42982d4537732b30e71c9a00ba0077944984Jean-Michel Trivi 2858c7cf3b7d0d7bccb9affbc34ae2ab2d6b332f972Jean-Michel Trivi TestCode(data, true, 0); 2868c7cf3b7d0d7bccb9affbc34ae2ab2d6b332f972Jean-Michel Trivi} 2872f4fe9f7df8f22c6bc8745407d19df73128810ecJean-Michel Trivi 288f1047e87767be1acd2c32f4d36028d1d0014f4c0Eric Laurent// Exercise bit-wise (one's complement) not-int instruction. 289ac4e42982d4537732b30e71c9a00ba0077944984Jean-Michel Trivi#define NOT_INT_TEST(TEST_NAME, INPUT, EXPECTED_OUTPUT) \ 2908c7cf3b7d0d7bccb9affbc34ae2ab2d6b332f972Jean-Michel TriviTEST(CodegenTest, TEST_NAME) { \ 291de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi const int32_t input = INPUT; \ 292de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi const uint16_t input_lo = Low16Bits(input); \ 293de80105c3f2db0eabd47640c49387ea3b44d4782Jean-Michel Trivi const uint16_t input_hi = High16Bits(input); \ 294e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( \ 295e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent Instruction::CONST | 0 << 8, input_lo, input_hi, \ 296e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent Instruction::NOT_INT | 1 << 8 | 0 << 12 , \ 297e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent Instruction::RETURN | 1 << 8); \ 298e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent \ 299e8726fea8a53bf3474aa3c6deaf2f6c1f565e694Eric Laurent TestCode(data, true, EXPECTED_OUTPUT); \ 30065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian} 301411e447c4b90298f5ff635429c53f94fbce4fff9Glenn Kasten 302de070137f11d346fba77605bd76a44c040a618fcEric LaurentNOT_INT_TEST(ReturnNotIntMinus2, -2, 1) 30365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_INT_TEST(ReturnNotIntMinus1, -1, 0) 30465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_INT_TEST(ReturnNotInt0, 0, -1) 30565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_INT_TEST(ReturnNotInt1, 1, -2) 30665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_INT_TEST(ReturnNotIntINT32_MIN, -2147483648, 2147483647) // (2^31) - 1 30765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_INT_TEST(ReturnNotIntINT32_MINPlus1, -2147483647, 2147483646) // (2^31) - 2 30865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_INT_TEST(ReturnNotIntINT32_MAXMinus1, 2147483646, -2147483647) // -(2^31) - 1 30965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_INT_TEST(ReturnNotIntINT32_MAX, 2147483647, -2147483648) // -(2^31) 31065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 31165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#undef NOT_INT_TEST 31265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 31322ecc912a87099cff8cadc424cd12f85c118673fGlenn Kasten// Exercise bit-wise (one's complement) not-long instruction. 31465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#define NOT_LONG_TEST(TEST_NAME, INPUT, EXPECTED_OUTPUT) \ 31565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianTEST(CodegenTest, TEST_NAME) { \ 31665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const int64_t input = INPUT; \ 31765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t word0 = Low16Bits(Low32Bits(input)); /* LSW. */ \ 31865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t word1 = High16Bits(Low32Bits(input)); \ 31965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t word2 = Low16Bits(High32Bits(input)); \ 32065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t word3 = High16Bits(High32Bits(input)); /* MSW. */ \ 32165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t data[] = FOUR_REGISTERS_CODE_ITEM( \ 32265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::CONST_WIDE | 0 << 8, word0, word1, word2, word3, \ 32365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::NOT_LONG | 2 << 8 | 0 << 12, \ 324dce54a1492c410ad0d93253b341fb33305337505Eric Laurent Instruction::RETURN_WIDE | 2 << 8); \ 32565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian \ 32665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian TestCodeLong(data, true, EXPECTED_OUTPUT); \ 32765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian} 32865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 32965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_LONG_TEST(ReturnNotLongMinus2, INT64_C(-2), INT64_C(1)) 33065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_LONG_TEST(ReturnNotLongMinus1, INT64_C(-1), INT64_C(0)) 33165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_LONG_TEST(ReturnNotLong0, INT64_C(0), INT64_C(-1)) 33265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_LONG_TEST(ReturnNotLong1, INT64_C(1), INT64_C(-2)) 33365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 33465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_LONG_TEST(ReturnNotLongINT32_MIN, 335f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov INT64_C(-2147483648), 336f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov INT64_C(2147483647)) // (2^31) - 1 337eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail NaganovNOT_LONG_TEST(ReturnNotLongINT32_MINPlus1, 338eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov INT64_C(-2147483647), 339eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov INT64_C(2147483646)) // (2^31) - 2 34010b7123bd6ce29fe756422aeedc5cfe469c4309fEric LaurentNOT_LONG_TEST(ReturnNotLongINT32_MAXMinus1, 341eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov INT64_C(2147483646), 342eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov INT64_C(-2147483647)) // -(2^31) - 1 343eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail NaganovNOT_LONG_TEST(ReturnNotLongINT32_MAX, 344eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov INT64_C(2147483647), 345eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov INT64_C(-2147483648)) // -(2^31) 346eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 347eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov// Note that the C++ compiler won't accept 348f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov// INT64_C(-9223372036854775808) (that is, INT64_MIN) as a valid 349f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov// int64_t literal, so we use INT64_C(-9223372036854775807)-1 instead. 3500f11b51a57bc9062c4fe8af73747319cedabc5d6Glenn KastenNOT_LONG_TEST(ReturnNotINT64_MIN, 35165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian INT64_C(-9223372036854775807)-1, 35244deb053252a3bd2f57a007ab9560f4924f62394Glenn Kasten INT64_C(9223372036854775807)); // (2^63) - 1 35365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_LONG_TEST(ReturnNotINT64_MINPlus1, 35465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian INT64_C(-9223372036854775807), 35565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian INT64_C(9223372036854775806)); // (2^63) - 2 35665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_LONG_TEST(ReturnNotLongINT64_MAXMinus1, 35765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian INT64_C(9223372036854775806), 35865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian INT64_C(-9223372036854775807)); // -(2^63) - 1 35965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianNOT_LONG_TEST(ReturnNotLongINT64_MAX, 36065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian INT64_C(9223372036854775807), 36165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian INT64_C(-9223372036854775807)-1); // -(2^63) 3629d1f02d74fd395ec4de6861147da289423f0ab6fGlenn Kasten 36365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#undef NOT_LONG_TEST 36465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 3659d1f02d74fd395ec4de6861147da289423f0ab6fGlenn Kasten#if defined(__aarch64__) 36665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianTEST(CodegenTest, DISABLED_IntToLongOfLongToInt) { 36765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#else 36865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianTEST(CodegenTest, IntToLongOfLongToInt) { 369dce54a1492c410ad0d93253b341fb33305337505Eric Laurent#endif 370dce54a1492c410ad0d93253b341fb33305337505Eric Laurent const int64_t input = INT64_C(4294967296); // 2^32 371dce54a1492c410ad0d93253b341fb33305337505Eric Laurent const uint16_t word0 = Low16Bits(Low32Bits(input)); // LSW. 37265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t word1 = High16Bits(Low32Bits(input)); 37365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t word2 = Low16Bits(High32Bits(input)); 37465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t word3 = High16Bits(High32Bits(input)); // MSW. 37565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t data[] = FIVE_REGISTERS_CODE_ITEM( 37665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::CONST_WIDE | 0 << 8, word0, word1, word2, word3, 37765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::CONST_WIDE | 2 << 8, 1, 0, 0, 0, 37865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::ADD_LONG | 0, 0 << 8 | 2, // v0 <- 2^32 + 1 37965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::LONG_TO_INT | 4 << 8 | 0 << 12, 38065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::INT_TO_LONG | 2 << 8 | 4 << 12, 38165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::RETURN_WIDE | 2 << 8); 38265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 38365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian TestCodeLong(data, true, 1); 38465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian} 38565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 38665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianTEST(CodegenTest, ReturnAdd1) { 38765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 38865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::CONST_4 | 3 << 12 | 0, 38965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::CONST_4 | 4 << 12 | 1 << 8, 39065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::ADD_INT, 1 << 8 | 0, 39165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::RETURN); 39265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 393f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov TestCode(data, true, 7); 394f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov} 395f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 396f4ddfefc8ba59a8486d91826154cc9447821409eSvet GanovTEST(CodegenTest, ReturnAdd2) { 397f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 398f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::CONST_4 | 3 << 12 | 0, 399f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::CONST_4 | 4 << 12 | 1 << 8, 400f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::ADD_INT_2ADDR | 1 << 12, 401f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::RETURN); 402f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 403f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov TestCode(data, true, 7); 404f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov} 405f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 406f4ddfefc8ba59a8486d91826154cc9447821409eSvet GanovTEST(CodegenTest, ReturnAdd3) { 407f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 408f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::CONST_4 | 4 << 12 | 0 << 8, 409f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::ADD_INT_LIT8, 3 << 8 | 0, 410f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::RETURN); 411f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 412f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov TestCode(data, true, 7); 413f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov} 414f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 415f4ddfefc8ba59a8486d91826154cc9447821409eSvet GanovTEST(CodegenTest, ReturnAdd4) { 416f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 417f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::CONST_4 | 4 << 12 | 0 << 8, 418f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::ADD_INT_LIT16, 3, 419f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::RETURN); 420f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 42165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian TestCode(data, true, 7); 42265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian} 42365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 424f4ddfefc8ba59a8486d91826154cc9447821409eSvet GanovTEST(CodegenTest, NonMaterializedCondition) { 425f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov ArenaPool pool; 426f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov ArenaAllocator allocator(&pool); 427f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 428f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HGraph* graph = new (&allocator) HGraph(&allocator); 429f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HBasicBlock* entry = new (&allocator) HBasicBlock(graph); 430f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->AddBlock(entry); 431f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->SetEntryBlock(entry); 432f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov entry->AddInstruction(new (&allocator) HGoto()); 433f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 434f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HBasicBlock* first_block = new (&allocator) HBasicBlock(graph); 435f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->AddBlock(first_block); 436f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov entry->AddSuccessor(first_block); 437f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HIntConstant* constant0 = new (&allocator) HIntConstant(0); 438f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov entry->AddInstruction(constant0); 439f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HIntConstant* constant1 = new (&allocator) HIntConstant(1); 440f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov entry->AddInstruction(constant1); 441f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HEqual* equal = new (&allocator) HEqual(constant0, constant0); 442f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov first_block->AddInstruction(equal); 443f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov first_block->AddInstruction(new (&allocator) HIf(equal)); 444f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 445f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HBasicBlock* then = new (&allocator) HBasicBlock(graph); 446f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HBasicBlock* else_ = new (&allocator) HBasicBlock(graph); 447f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HBasicBlock* exit = new (&allocator) HBasicBlock(graph); 448f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 449f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->AddBlock(then); 450f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->AddBlock(else_); 451f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->AddBlock(exit); 452f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov first_block->AddSuccessor(then); 453f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov first_block->AddSuccessor(else_); 454f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov then->AddSuccessor(exit); 455f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov else_->AddSuccessor(exit); 456f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 457f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov exit->AddInstruction(new (&allocator) HExit()); 458f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov then->AddInstruction(new (&allocator) HReturn(constant0)); 459f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov else_->AddInstruction(new (&allocator) HReturn(constant1)); 460f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 461f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov ASSERT_TRUE(equal->NeedsMaterialization()); 462f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->BuildDominatorTree(); 463f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov PrepareForRegisterAllocation(graph).Run(); 464f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov ASSERT_FALSE(equal->NeedsMaterialization()); 465f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 466f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov auto hook_before_codegen = [](HGraph* graph_in) { 467f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors().Get(0); 468f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HParallelMove* move = new (graph_in->GetArena()) HParallelMove(graph_in->GetArena()); 469f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov block->InsertInstructionBefore(move, block->GetLastInstruction()); 470f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov }; 471f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 472f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov RunCodeOptimized(graph, hook_before_codegen, true, 0); 473f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov} 474f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 475f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov#define MUL_TEST(TYPE, TEST_NAME) \ 476f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov TEST(CodegenTest, Return ## TEST_NAME) { \ 477f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( \ 478f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::CONST_4 | 3 << 12 | 0, \ 479f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::CONST_4 | 4 << 12 | 1 << 8, \ 480f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::MUL_ ## TYPE, 1 << 8 | 0, \ 481f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::RETURN); \ 482f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov \ 483f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov TestCode(data, true, 12); \ 484f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov } \ 485f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov \ 486f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov TEST(CodegenTest, Return ## TEST_NAME ## 2addr) { \ 487f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( \ 488f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::CONST_4 | 3 << 12 | 0, \ 489f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::CONST_4 | 4 << 12 | 1 << 8, \ 490f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::MUL_ ## TYPE ## _2ADDR | 1 << 12, \ 491f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::RETURN); \ 492f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov \ 493f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov TestCode(data, true, 12); \ 494f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov } 495f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 496f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov#if !defined(__aarch64__) 497f4ddfefc8ba59a8486d91826154cc9447821409eSvet GanovMUL_TEST(INT, MulInt); 498f4ddfefc8ba59a8486d91826154cc9447821409eSvet GanovMUL_TEST(LONG, MulLong); 499f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov#endif 500f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 501f4ddfefc8ba59a8486d91826154cc9447821409eSvet GanovTEST(CodegenTest, ReturnMulIntLit8) { 502f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 503f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::CONST_4 | 4 << 12 | 0 << 8, 504f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::MUL_INT_LIT8, 3 << 8 | 0, 505f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov Instruction::RETURN); 506f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 507f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov TestCode(data, true, 12); 508f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov} 509f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 510f4ddfefc8ba59a8486d91826154cc9447821409eSvet GanovTEST(CodegenTest, ReturnMulIntLit16) { 511eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 512eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov Instruction::CONST_4 | 4 << 12 | 0 << 8, 513eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov Instruction::MUL_INT_LIT16, 3, 514eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov Instruction::RETURN); 515eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 516eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov TestCode(data, true, 12); 517eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov} 518eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 519f4ddfefc8ba59a8486d91826154cc9447821409eSvet GanovTEST(CodegenTest, MaterializedCondition1) { 520f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov // Check that condition are materialized correctly. A materialized condition 521f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov // should yield `1` if it evaluated to true, and `0` otherwise. 522f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov // We force the materialization of comparisons for different combinations of 523eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov // inputs and check the results. 524f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 525eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov int lhs[] = {1, 2, -1, 2, 0xabc}; 526eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov int rhs[] = {2, 1, 2, -1, 0xabc}; 527f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 528f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov for (size_t i = 0; i < arraysize(lhs); i++) { 529eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov ArenaPool pool; 530eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov ArenaAllocator allocator(&pool); 531eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HGraph* graph = new (&allocator) HGraph(&allocator); 532eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 533f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HBasicBlock* entry_block = new (&allocator) HBasicBlock(graph); 534f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->AddBlock(entry_block); 535eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov graph->SetEntryBlock(entry_block); 536eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov entry_block->AddInstruction(new (&allocator) HGoto()); 537eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HBasicBlock* code_block = new (&allocator) HBasicBlock(graph); 538f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->AddBlock(code_block); 539eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HBasicBlock* exit_block = new (&allocator) HBasicBlock(graph); 540eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov graph->AddBlock(exit_block); 541f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov exit_block->AddInstruction(new (&allocator) HExit()); 542eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 543eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov entry_block->AddSuccessor(code_block); 544eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov code_block->AddSuccessor(exit_block); 545f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->SetExitBlock(exit_block); 546f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 547eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HIntConstant cst_lhs(lhs[i]); 548eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov code_block->AddInstruction(&cst_lhs); 549eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HIntConstant cst_rhs(rhs[i]); 550eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov code_block->AddInstruction(&cst_rhs); 551f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HLessThan cmp_lt(&cst_lhs, &cst_rhs); 552eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov code_block->AddInstruction(&cmp_lt); 553eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HReturn ret(&cmp_lt); 554eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov code_block->AddInstruction(&ret); 555eba668adbdee1ecfcf00fa9f9fc066c022cfddbaMikhail Naganov 556eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov auto hook_before_codegen = [](HGraph* graph_in) { 557f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors().Get(0); 558f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HParallelMove* move = new (graph_in->GetArena()) HParallelMove(graph_in->GetArena()); 559eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov block->InsertInstructionBefore(move, block->GetLastInstruction()); 560eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov }; 561eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 562eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov RunCodeOptimized(graph, hook_before_codegen, true, lhs[i] < rhs[i]); 563eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov } 564eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov} 565eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 566f4ddfefc8ba59a8486d91826154cc9447821409eSvet GanovTEST(CodegenTest, MaterializedCondition2) { 567f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov // Check that HIf correctly interprets a materialized condition. 568eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov // We force the materialization of comparisons for different combinations of 569eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov // inputs. An HIf takes the materialized combination as input and returns a 570f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov // value that we verify. 571f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov 572eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov int lhs[] = {1, 2, -1, 2, 0xabc}; 573eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov int rhs[] = {2, 1, 2, -1, 0xabc}; 574eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 575eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 576eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov for (size_t i = 0; i < arraysize(lhs); i++) { 577eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov ArenaPool pool; 578eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov ArenaAllocator allocator(&pool); 579eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HGraph* graph = new (&allocator) HGraph(&allocator); 580eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 581f1047e87767be1acd2c32f4d36028d1d0014f4c0Eric Laurent HBasicBlock* entry_block = new (&allocator) HBasicBlock(graph); 582eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov graph->AddBlock(entry_block); 583eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov graph->SetEntryBlock(entry_block); 584eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov entry_block->AddInstruction(new (&allocator) HGoto()); 585eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 586eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HBasicBlock* if_block = new (&allocator) HBasicBlock(graph); 587eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov graph->AddBlock(if_block); 588eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HBasicBlock* if_true_block = new (&allocator) HBasicBlock(graph); 589f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->AddBlock(if_true_block); 590f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HBasicBlock* if_false_block = new (&allocator) HBasicBlock(graph); 591f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov graph->AddBlock(if_false_block); 592eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HBasicBlock* exit_block = new (&allocator) HBasicBlock(graph); 593eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov graph->AddBlock(exit_block); 594f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov exit_block->AddInstruction(new (&allocator) HExit()); 595eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 596eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov graph->SetEntryBlock(entry_block); 597f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov entry_block->AddSuccessor(if_block); 598eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_block->AddSuccessor(if_true_block); 599eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_block->AddSuccessor(if_false_block); 600eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_true_block->AddSuccessor(exit_block); 601eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_false_block->AddSuccessor(exit_block); 602eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov graph->SetExitBlock(exit_block); 603eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 604f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HIntConstant cst_lhs(lhs[i]); 605f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov if_block->AddInstruction(&cst_lhs); 606f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov HIntConstant cst_rhs(rhs[i]); 607eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_block->AddInstruction(&cst_rhs); 608eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HLessThan cmp_lt(&cst_lhs, &cst_rhs); 609eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_block->AddInstruction(&cmp_lt); 610eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov // We insert a temporary to separate the HIf from the HLessThan and force 611eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov // the materialization of the condition. 612eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HTemporary force_materialization(0); 613eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_block->AddInstruction(&force_materialization); 614eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HIf if_lt(&cmp_lt); 615eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_block->AddInstruction(&if_lt); 616eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 617eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HIntConstant cst_lt(1); 618eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_true_block->AddInstruction(&cst_lt); 619eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HReturn ret_lt(&cst_lt); 620eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_true_block->AddInstruction(&ret_lt); 621eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HIntConstant cst_ge(0); 622eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_false_block->AddInstruction(&cst_ge); 623eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HReturn ret_ge(&cst_ge); 624eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov if_false_block->AddInstruction(&ret_ge); 625eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 626eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov auto hook_before_codegen = [](HGraph* graph_in) { 627eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HBasicBlock* block = graph_in->GetEntryBlock()->GetSuccessors().Get(0); 628eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov HParallelMove* move = new (graph_in->GetArena()) HParallelMove(graph_in->GetArena()); 629eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov block->InsertInstructionBefore(move, block->GetLastInstruction()); 630eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov }; 631eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov 632eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov RunCodeOptimized(graph, hook_before_codegen, true, lhs[i] < rhs[i]); 633eae73eb726c141056caf5a7ff95d45c3bcdd999fMikhail Naganov } 634f4ddfefc8ba59a8486d91826154cc9447821409eSvet Ganov} 63565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 63665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#if defined(__aarch64__) 63765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianTEST(CodegenTest, DISABLED_ReturnDivIntLit8) { 638bfb1b832079bbb9426f72f3863199a54aefd02daEric Laurent#else 639bfb1b832079bbb9426f72f3863199a54aefd02daEric LaurentTEST(CodegenTest, ReturnDivIntLit8) { 640bfb1b832079bbb9426f72f3863199a54aefd02daEric Laurent#endif 64165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t data[] = ONE_REGISTER_CODE_ITEM( 64265ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::CONST_4 | 4 << 12 | 0 << 8, 64365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::DIV_INT_LIT8, 3 << 8 | 0, 64465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::RETURN); 64565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 64665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian TestCode(data, true, 1); 64765ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian} 648bfb1b832079bbb9426f72f3863199a54aefd02daEric Laurent 64965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#if defined(__aarch64__) 65065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias AgopianTEST(CodegenTest, DISABLED_ReturnDivInt2Addr) { 65165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#else 652e9dd0176933d6233916c84e18f3e8c0d644ca05dGlenn KastenTEST(CodegenTest, ReturnDivInt2Addr) { 65365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian#endif 65465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian const uint16_t data[] = TWO_REGISTERS_CODE_ITEM( 65565ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::CONST_4 | 4 << 12 | 0, 65665ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::CONST_4 | 2 << 12 | 1 << 8, 657bfb1b832079bbb9426f72f3863199a54aefd02daEric Laurent Instruction::DIV_INT_2ADDR | 1 << 12, 65865ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian Instruction::RETURN); 65965ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian 66065ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian TestCode(data, true, 2); 66165ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian} 662d7eda8d0127fabf2d63b0890043da40e2a9e366cEric Laurent 66365ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian} // namespace art 66465ab47156e1c7dfcd8cc4266253a5ff30219e7f0Mathias Agopian