blob: 29d47e13cc430b76e92b2ffae51db804bf28734e [file] [log] [blame]
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +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#ifndef ART_COMPILER_OPTIMIZING_OPTIMIZING_UNIT_TEST_H_
18#define ART_COMPILER_OPTIMIZING_OPTIMIZING_UNIT_TEST_H_
19
Roland Levillainccc07a92014-09-16 14:48:16 +010020#include "nodes.h"
21#include "builder.h"
Mathieu Chartier5bdab122015-01-26 18:30:19 -080022#include "compiler/dex/pass_manager.h"
Roland Levillainccc07a92014-09-16 14:48:16 +010023#include "dex_file.h"
24#include "dex_instruction.h"
Nicolas Geoffraya7062e02014-05-22 12:50:17 +010025#include "ssa_liveness_analysis.h"
26
Roland Levillain72bceff2014-09-15 18:29:00 +010027#include "gtest/gtest.h"
28
Nicolas Geoffraya7062e02014-05-22 12:50:17 +010029namespace art {
30
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +000031#define NUM_INSTRUCTIONS(...) \
32 (sizeof((uint16_t[]) {__VA_ARGS__}) /sizeof(uint16_t))
33
Roland Levillain55dcfb52014-10-24 18:09:09 +010034#define N_REGISTERS_CODE_ITEM(NUM_REGS, ...) \
35 { NUM_REGS, 0, 0, 0, 0, 0, NUM_INSTRUCTIONS(__VA_ARGS__), 0, __VA_ARGS__ }
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +000036
Roland Levillain55dcfb52014-10-24 18:09:09 +010037#define ZERO_REGISTER_CODE_ITEM(...) N_REGISTERS_CODE_ITEM(0, __VA_ARGS__)
38#define ONE_REGISTER_CODE_ITEM(...) N_REGISTERS_CODE_ITEM(1, __VA_ARGS__)
39#define TWO_REGISTERS_CODE_ITEM(...) N_REGISTERS_CODE_ITEM(2, __VA_ARGS__)
40#define THREE_REGISTERS_CODE_ITEM(...) N_REGISTERS_CODE_ITEM(3, __VA_ARGS__)
41#define FOUR_REGISTERS_CODE_ITEM(...) N_REGISTERS_CODE_ITEM(4, __VA_ARGS__)
42#define FIVE_REGISTERS_CODE_ITEM(...) N_REGISTERS_CODE_ITEM(5, __VA_ARGS__)
43#define SIX_REGISTERS_CODE_ITEM(...) N_REGISTERS_CODE_ITEM(6, __VA_ARGS__)
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +000044
Nicolas Geoffraya7062e02014-05-22 12:50:17 +010045
46LiveInterval* BuildInterval(const size_t ranges[][2],
47 size_t number_of_ranges,
48 ArenaAllocator* allocator,
Nicolas Geoffraydd8f8872015-01-15 15:37:37 +000049 int reg = -1,
50 HInstruction* defined_by = nullptr) {
51 LiveInterval* interval = LiveInterval::MakeInterval(allocator, Primitive::kPrimInt, defined_by);
52 if (defined_by != nullptr) {
53 defined_by->SetLiveInterval(interval);
54 }
Nicolas Geoffraya7062e02014-05-22 12:50:17 +010055 for (size_t i = number_of_ranges; i > 0; --i) {
56 interval->AddRange(ranges[i - 1][0], ranges[i - 1][1]);
57 }
58 interval->SetRegister(reg);
59 return interval;
60}
61
Nicolas Geoffrayfbc695f2014-09-15 15:33:30 +000062void RemoveSuspendChecks(HGraph* graph) {
63 for (size_t i = 0, e = graph->GetBlocks().Size(); i < e; ++i) {
64 for (HInstructionIterator it(graph->GetBlocks().Get(i)->GetInstructions());
65 !it.Done();
66 it.Advance()) {
67 HInstruction* current = it.Current();
68 if (current->IsSuspendCheck()) {
69 current->GetBlock()->RemoveInstruction(current);
70 }
71 }
72 }
73}
74
Roland Levillainccc07a92014-09-16 14:48:16 +010075// Create a control-flow graph from Dex instructions.
Nicolas Geoffray7fb49da2014-10-06 09:12:41 +010076inline HGraph* CreateCFG(ArenaAllocator* allocator,
77 const uint16_t* data,
78 Primitive::Type return_type = Primitive::kPrimInt) {
79 HGraphBuilder builder(allocator, return_type);
Roland Levillainccc07a92014-09-16 14:48:16 +010080 const DexFile::CodeItem* item =
81 reinterpret_cast<const DexFile::CodeItem*>(data);
82 HGraph* graph = builder.BuildGraph(*item);
83 return graph;
84}
85
Roland Levillain72bceff2014-09-15 18:29:00 +010086// Naive string diff data type.
87typedef std::list<std::pair<std::string, std::string>> diff_t;
88
89// An alias for the empty string used to make it clear that a line is
90// removed in a diff.
91static const std::string removed = "";
92
93// Naive patch command: apply a diff to a string.
94inline std::string Patch(const std::string& original, const diff_t& diff) {
95 std::string result = original;
96 for (const auto& p : diff) {
97 std::string::size_type pos = result.find(p.first);
98 EXPECT_NE(pos, std::string::npos);
99 result.replace(pos, p.first.size(), p.second);
100 }
101 return result;
102}
103
Mingyao Yangf384f882014-10-22 16:08:18 -0700104// Returns if the instruction is removed from the graph.
105inline bool IsRemoved(HInstruction* instruction) {
106 return instruction->GetBlock() == nullptr;
107}
108
Nicolas Geoffraya7062e02014-05-22 12:50:17 +0100109} // namespace art
110
Nicolas Geoffray3ff386a2014-03-04 14:46:47 +0000111#endif // ART_COMPILER_OPTIMIZING_OPTIMIZING_UNIT_TEST_H_