| /* |
| * Copyright (C) 2014 The Android Open Source Project |
| * |
| * Licensed under the Apache License, Version 2.0 (the "License"); |
| * you may not use this file except in compliance with the License. |
| * You may obtain a copy of the License at |
| * |
| * http://www.apache.org/licenses/LICENSE-2.0 |
| * |
| * Unless required by applicable law or agreed to in writing, software |
| * distributed under the License is distributed on an "AS IS" BASIS, |
| * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| * See the License for the specific language governing permissions and |
| * limitations under the License. |
| */ |
| |
| #include <fstream> |
| |
| #include "base/arena_allocator.h" |
| #include "base/macros.h" |
| #include "builder.h" |
| #include "code_generator.h" |
| #include "dex/dex_file.h" |
| #include "dex/dex_instruction.h" |
| #include "driver/compiler_options.h" |
| #include "graph_visualizer.h" |
| #include "nodes.h" |
| #include "optimizing_unit_test.h" |
| #include "pretty_printer.h" |
| #include "ssa_liveness_analysis.h" |
| |
| namespace art HIDDEN { |
| |
| class LinearizeTest : public CommonCompilerTest, public OptimizingUnitTestHelper { |
| protected: |
| template <size_t number_of_blocks> |
| void TestCode(const std::vector<uint16_t>& data, |
| const uint32_t (&expected_order)[number_of_blocks]); |
| }; |
| |
| template <size_t number_of_blocks> |
| void LinearizeTest::TestCode(const std::vector<uint16_t>& data, |
| const uint32_t (&expected_order)[number_of_blocks]) { |
| HGraph* graph = CreateCFG(data); |
| std::unique_ptr<CompilerOptions> compiler_options = |
| CommonCompilerTest::CreateCompilerOptions(kRuntimeISA, "default"); |
| std::unique_ptr<CodeGenerator> codegen = CodeGenerator::Create(graph, *compiler_options); |
| SsaLivenessAnalysis liveness(graph, codegen.get(), GetScopedAllocator()); |
| liveness.Analyze(); |
| |
| ASSERT_EQ(graph->GetLinearOrder().size(), number_of_blocks); |
| for (size_t i = 0; i < number_of_blocks; ++i) { |
| ASSERT_EQ(graph->GetLinearOrder()[i]->GetBlockId(), expected_order[i]); |
| } |
| } |
| |
| TEST_F(LinearizeTest, CFG1) { |
| TEST_DISABLED_FOR_RISCV64(); |
| // Structure of this graph (+ are back edges) |
| // Block0 |
| // | |
| // Block1 |
| // | |
| // Block2 ++++++ |
| // / \ + |
| // Block5 Block7 + |
| // | | + |
| // Block6 Block3 + |
| // + / \ + |
| // Block4 Block8 |
| |
| const std::vector<uint16_t> data = ONE_REGISTER_CODE_ITEM( |
| Instruction::CONST_4 | 0 | 0, |
| Instruction::IF_EQ, 5, |
| Instruction::IF_EQ, 0xFFFE, |
| Instruction::GOTO | 0xFE00, |
| Instruction::RETURN_VOID); |
| |
| const uint32_t blocks[] = {0, 1, 2, 7, 3, 4, 8, 5, 6}; |
| TestCode(data, blocks); |
| } |
| |
| TEST_F(LinearizeTest, CFG2) { |
| TEST_DISABLED_FOR_RISCV64(); |
| // Structure of this graph (+ are back edges) |
| // Block0 |
| // | |
| // Block1 |
| // | |
| // Block2 ++++++ |
| // / \ + |
| // Block3 Block7 + |
| // | | + |
| // Block6 Block4 + |
| // + / \ + |
| // Block5 Block8 |
| |
| const std::vector<uint16_t> data = ONE_REGISTER_CODE_ITEM( |
| Instruction::CONST_4 | 0 | 0, |
| Instruction::IF_EQ, 3, |
| Instruction::RETURN_VOID, |
| Instruction::IF_EQ, 0xFFFD, |
| Instruction::GOTO | 0xFE00); |
| |
| const uint32_t blocks[] = {0, 1, 2, 7, 4, 5, 8, 3, 6}; |
| TestCode(data, blocks); |
| } |
| |
| TEST_F(LinearizeTest, CFG3) { |
| TEST_DISABLED_FOR_RISCV64(); |
| // Structure of this graph (+ are back edges) |
| // Block0 |
| // | |
| // Block1 |
| // | |
| // Block2 ++++++ |
| // / \ + |
| // Block3 Block8 + |
| // | | + |
| // Block7 Block5 + |
| // / + \ + |
| // Block6 + Block9 |
| // | + |
| // Block4 ++ |
| const std::vector<uint16_t> data = ONE_REGISTER_CODE_ITEM( |
| Instruction::CONST_4 | 0 | 0, |
| Instruction::IF_EQ, 4, |
| Instruction::RETURN_VOID, |
| Instruction::GOTO | 0x0100, |
| Instruction::IF_EQ, 0xFFFC, |
| Instruction::GOTO | 0xFD00); |
| |
| const uint32_t blocks[] = {0, 1, 2, 8, 5, 6, 4, 9, 3, 7}; |
| TestCode(data, blocks); |
| } |
| |
| TEST_F(LinearizeTest, CFG4) { |
| TEST_DISABLED_FOR_RISCV64(); |
| /* Structure of this graph (+ are back edges) |
| // Block0 |
| // | |
| // Block1 |
| // | |
| // Block2 |
| // / + \ |
| // Block6 + Block8 |
| // | + | |
| // Block7 + Block3 +++++++ |
| // + / \ + |
| // Block9 Block10 + |
| // | + |
| // Block4 + |
| // + / \ + |
| // Block5 Block11 |
| */ |
| const std::vector<uint16_t> data = ONE_REGISTER_CODE_ITEM( |
| Instruction::CONST_4 | 0 | 0, |
| Instruction::IF_EQ, 7, |
| Instruction::IF_EQ, 0xFFFE, |
| Instruction::IF_EQ, 0xFFFE, |
| Instruction::GOTO | 0xFE00, |
| Instruction::RETURN_VOID); |
| |
| const uint32_t blocks[] = {0, 1, 2, 8, 3, 10, 4, 5, 11, 9, 6, 7}; |
| TestCode(data, blocks); |
| } |
| |
| TEST_F(LinearizeTest, CFG5) { |
| TEST_DISABLED_FOR_RISCV64(); |
| /* Structure of this graph (+ are back edges) |
| // Block0 |
| // | |
| // Block1 |
| // | |
| // Block2 |
| // / + \ |
| // Block3 + Block8 |
| // | + | |
| // Block7 + Block4 +++++++ |
| // + / \ + |
| // Block9 Block10 + |
| // | + |
| // Block5 + |
| // +/ \ + |
| // Block6 Block11 |
| */ |
| const std::vector<uint16_t> data = ONE_REGISTER_CODE_ITEM( |
| Instruction::CONST_4 | 0 | 0, |
| Instruction::IF_EQ, 3, |
| Instruction::RETURN_VOID, |
| Instruction::IF_EQ, 0xFFFD, |
| Instruction::IF_EQ, 0xFFFE, |
| Instruction::GOTO | 0xFE00); |
| |
| const uint32_t blocks[] = {0, 1, 2, 8, 4, 10, 5, 6, 11, 9, 3, 7}; |
| TestCode(data, blocks); |
| } |
| |
| TEST_F(LinearizeTest, CFG6) { |
| TEST_DISABLED_FOR_RISCV64(); |
| // Block0 |
| // | |
| // Block1 |
| // | |
| // Block2 ++++++++++++++ |
| // | + |
| // Block3 + |
| // / \ + |
| // Block8 Block4 + |
| // | / \ + |
| // Block5 <- Block9 Block6 + |
| // | |
| // Block7 |
| const std::vector<uint16_t> data = ONE_REGISTER_CODE_ITEM( |
| Instruction::CONST_4 | 0 | 0, |
| Instruction::GOTO | 0x0100, |
| Instruction::IF_EQ, 0x0004, |
| Instruction::IF_EQ, 0x0003, |
| Instruction::RETURN_VOID, |
| Instruction::GOTO | 0xFA00); |
| |
| const uint32_t blocks[] = {0, 1, 2, 3, 4, 6, 9, 8, 5, 7}; |
| TestCode(data, blocks); |
| } |
| |
| TEST_F(LinearizeTest, CFG7) { |
| TEST_DISABLED_FOR_RISCV64(); |
| // Structure of this graph (+ are back edges) |
| // Block0 |
| // | |
| // Block1 |
| // | |
| // Block2 ++++++++ |
| // | + |
| // Block3 + |
| // / \ + |
| // Block4 Block8 + |
| // / \ | + |
| // Block5 Block9 - Block6 + |
| // | |
| // Block7 |
| // |
| const std::vector<uint16_t> data = ONE_REGISTER_CODE_ITEM( |
| Instruction::CONST_4 | 0 | 0, |
| Instruction::GOTO | 0x0100, |
| Instruction::IF_EQ, 0x0005, |
| Instruction::IF_EQ, 0x0003, |
| Instruction::RETURN_VOID, |
| Instruction::GOTO | 0xFA00); |
| |
| const uint32_t blocks[] = {0, 1, 2, 3, 4, 9, 8, 6, 5, 7}; |
| TestCode(data, blocks); |
| } |
| |
| } // namespace art |