Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 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 | #ifndef ART_COMPILER_OPTIMIZING_NODES_H_ |
| 18 | #define ART_COMPILER_OPTIMIZING_NODES_H_ |
| 19 | |
| 20 | #include "utils/allocation.h" |
Nicolas Geoffray | 0e33643 | 2014-02-26 18:24:38 +0000 | [diff] [blame] | 21 | #include "utils/arena_bit_vector.h" |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 22 | #include "utils/growable_array.h" |
| 23 | |
| 24 | namespace art { |
| 25 | |
| 26 | class HBasicBlock; |
| 27 | class HInstruction; |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 28 | class HIntConstant; |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 29 | class HGraphVisitor; |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 30 | class LocationSummary; |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 31 | |
| 32 | static const int kDefaultNumberOfBlocks = 8; |
| 33 | static const int kDefaultNumberOfSuccessors = 2; |
| 34 | static const int kDefaultNumberOfPredecessors = 2; |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 35 | static const int kDefaultNumberOfBackEdges = 1; |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 36 | |
| 37 | // Control-flow graph of a method. Contains a list of basic blocks. |
| 38 | class HGraph : public ArenaObject { |
| 39 | public: |
| 40 | explicit HGraph(ArenaAllocator* arena) |
| 41 | : arena_(arena), |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 42 | blocks_(arena, kDefaultNumberOfBlocks), |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 43 | dominator_order_(arena, kDefaultNumberOfBlocks), |
Nicolas Geoffray | 4a34a42 | 2014-04-03 10:38:37 +0100 | [diff] [blame] | 44 | maximum_number_of_out_vregs_(0), |
Nicolas Geoffray | f583e59 | 2014-04-07 13:20:42 +0100 | [diff] [blame] | 45 | number_of_vregs_(0), |
| 46 | number_of_in_vregs_(0), |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 47 | current_instruction_id_(0) { } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 48 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 49 | ArenaAllocator* GetArena() const { return arena_; } |
| 50 | const GrowableArray<HBasicBlock*>* GetBlocks() const { return &blocks_; } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 51 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 52 | HBasicBlock* GetEntryBlock() const { return entry_block_; } |
| 53 | HBasicBlock* GetExitBlock() const { return exit_block_; } |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 54 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 55 | void SetEntryBlock(HBasicBlock* block) { entry_block_ = block; } |
| 56 | void SetExitBlock(HBasicBlock* block) { exit_block_ = block; } |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 57 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 58 | void AddBlock(HBasicBlock* block); |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 59 | void BuildDominatorTree(); |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 60 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 61 | int GetNextInstructionId() { |
| 62 | return current_instruction_id_++; |
| 63 | } |
| 64 | |
Nicolas Geoffray | 4a34a42 | 2014-04-03 10:38:37 +0100 | [diff] [blame] | 65 | uint16_t GetMaximumNumberOfOutVRegs() const { |
| 66 | return maximum_number_of_out_vregs_; |
| 67 | } |
| 68 | |
| 69 | void UpdateMaximumNumberOfOutVRegs(uint16_t new_value) { |
| 70 | maximum_number_of_out_vregs_ = std::max(new_value, maximum_number_of_out_vregs_); |
| 71 | } |
| 72 | |
Nicolas Geoffray | f583e59 | 2014-04-07 13:20:42 +0100 | [diff] [blame] | 73 | void SetNumberOfVRegs(uint16_t number_of_vregs) { |
| 74 | number_of_vregs_ = number_of_vregs; |
| 75 | } |
| 76 | |
| 77 | uint16_t GetNumberOfVRegs() const { |
| 78 | return number_of_vregs_; |
| 79 | } |
| 80 | |
| 81 | void SetNumberOfInVRegs(uint16_t value) { |
| 82 | number_of_in_vregs_ = value; |
| 83 | } |
| 84 | |
| 85 | uint16_t GetNumberOfInVRegs() const { |
| 86 | return number_of_in_vregs_; |
| 87 | } |
| 88 | |
| 89 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 90 | private: |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 91 | HBasicBlock* FindCommonDominator(HBasicBlock* first, HBasicBlock* second) const; |
| 92 | void VisitBlockForDominatorTree(HBasicBlock* block, |
| 93 | HBasicBlock* predecessor, |
| 94 | GrowableArray<size_t>* visits); |
| 95 | void FindBackEdges(ArenaBitVector* visited) const; |
| 96 | void VisitBlockForBackEdges(HBasicBlock* block, |
| 97 | ArenaBitVector* visited, |
| 98 | ArenaBitVector* visiting) const; |
| 99 | void RemoveDeadBlocks(const ArenaBitVector& visited) const; |
| 100 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 101 | ArenaAllocator* const arena_; |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 102 | |
| 103 | // List of blocks in insertion order. |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 104 | GrowableArray<HBasicBlock*> blocks_; |
| 105 | |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 106 | // List of blocks to perform a pre-order dominator tree traversal. |
| 107 | GrowableArray<HBasicBlock*> dominator_order_; |
| 108 | |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 109 | HBasicBlock* entry_block_; |
| 110 | HBasicBlock* exit_block_; |
| 111 | |
Nicolas Geoffray | f583e59 | 2014-04-07 13:20:42 +0100 | [diff] [blame] | 112 | // The maximum number of virtual registers arguments passed to a HInvoke in this graph. |
Nicolas Geoffray | 4a34a42 | 2014-04-03 10:38:37 +0100 | [diff] [blame] | 113 | uint16_t maximum_number_of_out_vregs_; |
| 114 | |
Nicolas Geoffray | f583e59 | 2014-04-07 13:20:42 +0100 | [diff] [blame] | 115 | // The number of virtual registers in this method. Contains the parameters. |
| 116 | uint16_t number_of_vregs_; |
| 117 | |
| 118 | // The number of virtual registers used by parameters of this method. |
| 119 | uint16_t number_of_in_vregs_; |
| 120 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 121 | // The current id to assign to a newly added instruction. See HInstruction.id_. |
| 122 | int current_instruction_id_; |
| 123 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 124 | DISALLOW_COPY_AND_ASSIGN(HGraph); |
| 125 | }; |
| 126 | |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 127 | class HLoopInformation : public ArenaObject { |
| 128 | public: |
| 129 | HLoopInformation(HBasicBlock* header, HGraph* graph) |
| 130 | : header_(header), |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 131 | back_edges_(graph->GetArena(), kDefaultNumberOfBackEdges) { } |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 132 | |
| 133 | void AddBackEdge(HBasicBlock* back_edge) { |
| 134 | back_edges_.Add(back_edge); |
| 135 | } |
| 136 | |
| 137 | int NumberOfBackEdges() const { |
| 138 | return back_edges_.Size(); |
| 139 | } |
| 140 | |
| 141 | private: |
| 142 | HBasicBlock* header_; |
| 143 | GrowableArray<HBasicBlock*> back_edges_; |
| 144 | |
| 145 | DISALLOW_COPY_AND_ASSIGN(HLoopInformation); |
| 146 | }; |
| 147 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 148 | // A block in a method. Contains the list of instructions represented |
| 149 | // as a double linked list. Each block knows its predecessors and |
| 150 | // successors. |
| 151 | class HBasicBlock : public ArenaObject { |
| 152 | public: |
| 153 | explicit HBasicBlock(HGraph* graph) |
| 154 | : graph_(graph), |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 155 | predecessors_(graph->GetArena(), kDefaultNumberOfPredecessors), |
| 156 | successors_(graph->GetArena(), kDefaultNumberOfSuccessors), |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 157 | first_instruction_(nullptr), |
| 158 | last_instruction_(nullptr), |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 159 | loop_information_(nullptr), |
| 160 | dominator_(nullptr), |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 161 | block_id_(-1) { } |
| 162 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 163 | const GrowableArray<HBasicBlock*>* GetPredecessors() const { |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 164 | return &predecessors_; |
| 165 | } |
| 166 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 167 | const GrowableArray<HBasicBlock*>* GetSuccessors() const { |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 168 | return &successors_; |
| 169 | } |
| 170 | |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 171 | void AddBackEdge(HBasicBlock* back_edge) { |
| 172 | if (loop_information_ == nullptr) { |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 173 | loop_information_ = new (graph_->GetArena()) HLoopInformation(this, graph_); |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 174 | } |
| 175 | loop_information_->AddBackEdge(back_edge); |
| 176 | } |
| 177 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 178 | HGraph* GetGraph() const { return graph_; } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 179 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 180 | int GetBlockId() const { return block_id_; } |
| 181 | void SetBlockId(int id) { block_id_ = id; } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 182 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 183 | HBasicBlock* GetDominator() const { return dominator_; } |
| 184 | void SetDominator(HBasicBlock* dominator) { dominator_ = dominator; } |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 185 | |
| 186 | int NumberOfBackEdges() const { |
| 187 | return loop_information_ == nullptr |
| 188 | ? 0 |
| 189 | : loop_information_->NumberOfBackEdges(); |
| 190 | } |
| 191 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 192 | HInstruction* GetFirstInstruction() const { return first_instruction_; } |
| 193 | HInstruction* GetLastInstruction() const { return last_instruction_; } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 194 | |
| 195 | void AddSuccessor(HBasicBlock* block) { |
| 196 | successors_.Add(block); |
| 197 | block->predecessors_.Add(this); |
| 198 | } |
| 199 | |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 200 | void RemovePredecessor(HBasicBlock* block) { |
| 201 | predecessors_.Delete(block); |
| 202 | } |
| 203 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 204 | void AddInstruction(HInstruction* instruction); |
| 205 | |
| 206 | private: |
| 207 | HGraph* const graph_; |
| 208 | GrowableArray<HBasicBlock*> predecessors_; |
| 209 | GrowableArray<HBasicBlock*> successors_; |
| 210 | HInstruction* first_instruction_; |
| 211 | HInstruction* last_instruction_; |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 212 | HLoopInformation* loop_information_; |
| 213 | HBasicBlock* dominator_; |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 214 | int block_id_; |
| 215 | |
| 216 | DISALLOW_COPY_AND_ASSIGN(HBasicBlock); |
| 217 | }; |
| 218 | |
| 219 | #define FOR_EACH_INSTRUCTION(M) \ |
Nicolas Geoffray | d8ee737 | 2014-03-28 15:43:40 +0000 | [diff] [blame] | 220 | M(Add) \ |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 221 | M(Equal) \ |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 222 | M(Exit) \ |
| 223 | M(Goto) \ |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 224 | M(If) \ |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 225 | M(IntConstant) \ |
Nicolas Geoffray | 8ccc3f5 | 2014-03-19 10:34:11 +0000 | [diff] [blame] | 226 | M(InvokeStatic) \ |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 227 | M(LoadLocal) \ |
| 228 | M(Local) \ |
Nicolas Geoffray | 2e7038a | 2014-04-03 18:49:58 +0100 | [diff] [blame] | 229 | M(NewInstance) \ |
Nicolas Geoffray | b55f835 | 2014-04-07 15:26:35 +0100 | [diff] [blame^] | 230 | M(Not) \ |
Nicolas Geoffray | f583e59 | 2014-04-07 13:20:42 +0100 | [diff] [blame] | 231 | M(ParameterValue) \ |
Nicolas Geoffray | 4a34a42 | 2014-04-03 10:38:37 +0100 | [diff] [blame] | 232 | M(PushArgument) \ |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 233 | M(Return) \ |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 234 | M(ReturnVoid) \ |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 235 | M(StoreLocal) \ |
Nicolas Geoffray | f583e59 | 2014-04-07 13:20:42 +0100 | [diff] [blame] | 236 | M(Sub) \ |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 237 | |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 238 | #define FORWARD_DECLARATION(type) class H##type; |
| 239 | FOR_EACH_INSTRUCTION(FORWARD_DECLARATION) |
| 240 | #undef FORWARD_DECLARATION |
| 241 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 242 | #define DECLARE_INSTRUCTION(type) \ |
| 243 | virtual void Accept(HGraphVisitor* visitor); \ |
| 244 | virtual const char* DebugName() const { return #type; } \ |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 245 | virtual H##type* As##type() { return this; } \ |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 246 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 247 | class HUseListNode : public ArenaObject { |
| 248 | public: |
| 249 | HUseListNode(HInstruction* instruction, HUseListNode* tail) |
| 250 | : instruction_(instruction), tail_(tail) { } |
| 251 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 252 | HUseListNode* GetTail() const { return tail_; } |
| 253 | HInstruction* GetInstruction() const { return instruction_; } |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 254 | |
| 255 | private: |
| 256 | HInstruction* const instruction_; |
| 257 | HUseListNode* const tail_; |
| 258 | |
| 259 | DISALLOW_COPY_AND_ASSIGN(HUseListNode); |
| 260 | }; |
| 261 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 262 | class HInstruction : public ArenaObject { |
| 263 | public: |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 264 | HInstruction() |
| 265 | : previous_(nullptr), |
| 266 | next_(nullptr), |
| 267 | block_(nullptr), |
| 268 | id_(-1), |
| 269 | uses_(nullptr), |
| 270 | locations_(nullptr) { } |
| 271 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 272 | virtual ~HInstruction() { } |
| 273 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 274 | HInstruction* GetNext() const { return next_; } |
| 275 | HInstruction* GetPrevious() const { return previous_; } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 276 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 277 | HBasicBlock* GetBlock() const { return block_; } |
| 278 | void SetBlock(HBasicBlock* block) { block_ = block; } |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 279 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 280 | virtual intptr_t InputCount() const = 0; |
| 281 | virtual HInstruction* InputAt(intptr_t i) const = 0; |
| 282 | |
| 283 | virtual void Accept(HGraphVisitor* visitor) = 0; |
| 284 | virtual const char* DebugName() const = 0; |
| 285 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 286 | void AddUse(HInstruction* user) { |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 287 | uses_ = new (block_->GetGraph()->GetArena()) HUseListNode(user, uses_); |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 288 | } |
| 289 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 290 | HUseListNode* GetUses() const { return uses_; } |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 291 | |
| 292 | bool HasUses() const { return uses_ != nullptr; } |
| 293 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 294 | int GetId() const { return id_; } |
| 295 | void SetId(int id) { id_ = id; } |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 296 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 297 | LocationSummary* GetLocations() const { return locations_; } |
| 298 | void SetLocations(LocationSummary* locations) { locations_ = locations; } |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 299 | |
| 300 | #define INSTRUCTION_TYPE_CHECK(type) \ |
| 301 | virtual H##type* As##type() { return nullptr; } |
| 302 | |
| 303 | FOR_EACH_INSTRUCTION(INSTRUCTION_TYPE_CHECK) |
| 304 | #undef INSTRUCTION_TYPE_CHECK |
| 305 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 306 | private: |
| 307 | HInstruction* previous_; |
| 308 | HInstruction* next_; |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 309 | HBasicBlock* block_; |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 310 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 311 | // An instruction gets an id when it is added to the graph. |
| 312 | // It reflects creation order. A negative id means the instruction |
| 313 | // has not beed added to the graph. |
| 314 | int id_; |
| 315 | |
| 316 | HUseListNode* uses_; |
| 317 | |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 318 | // Set by the code generator. |
| 319 | LocationSummary* locations_; |
| 320 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 321 | friend class HBasicBlock; |
| 322 | |
| 323 | DISALLOW_COPY_AND_ASSIGN(HInstruction); |
| 324 | }; |
| 325 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 326 | class HUseIterator : public ValueObject { |
| 327 | public: |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 328 | explicit HUseIterator(HInstruction* instruction) : current_(instruction->GetUses()) { } |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 329 | |
| 330 | bool Done() const { return current_ == nullptr; } |
| 331 | |
| 332 | void Advance() { |
| 333 | DCHECK(!Done()); |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 334 | current_ = current_->GetTail(); |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 335 | } |
| 336 | |
| 337 | HInstruction* Current() const { |
| 338 | DCHECK(!Done()); |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 339 | return current_->GetInstruction(); |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 340 | } |
| 341 | |
| 342 | private: |
| 343 | HUseListNode* current_; |
| 344 | |
| 345 | friend class HValue; |
| 346 | }; |
| 347 | |
| 348 | class HInputIterator : public ValueObject { |
| 349 | public: |
| 350 | explicit HInputIterator(HInstruction* instruction) : instruction_(instruction), index_(0) { } |
| 351 | |
| 352 | bool Done() const { return index_ == instruction_->InputCount(); } |
| 353 | HInstruction* Current() const { return instruction_->InputAt(index_); } |
| 354 | void Advance() { index_++; } |
| 355 | |
| 356 | private: |
| 357 | HInstruction* instruction_; |
| 358 | int index_; |
| 359 | |
| 360 | DISALLOW_COPY_AND_ASSIGN(HInputIterator); |
| 361 | }; |
| 362 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 363 | class HInstructionIterator : public ValueObject { |
| 364 | public: |
| 365 | explicit HInstructionIterator(HBasicBlock* block) |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 366 | : instruction_(block->GetFirstInstruction()) { |
| 367 | next_ = Done() ? nullptr : instruction_->GetNext(); |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 368 | } |
| 369 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 370 | bool Done() const { return instruction_ == nullptr; } |
| 371 | HInstruction* Current() const { return instruction_; } |
| 372 | void Advance() { |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 373 | instruction_ = next_; |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 374 | next_ = Done() ? nullptr : instruction_->GetNext(); |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 375 | } |
| 376 | |
| 377 | private: |
| 378 | HInstruction* instruction_; |
| 379 | HInstruction* next_; |
| 380 | }; |
| 381 | |
| 382 | // An embedded container with N elements of type T. Used (with partial |
| 383 | // specialization for N=0) because embedded arrays cannot have size 0. |
| 384 | template<typename T, intptr_t N> |
| 385 | class EmbeddedArray { |
| 386 | public: |
| 387 | EmbeddedArray() : elements_() { } |
| 388 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 389 | intptr_t GetLength() const { return N; } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 390 | |
| 391 | const T& operator[](intptr_t i) const { |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 392 | DCHECK_LT(i, GetLength()); |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 393 | return elements_[i]; |
| 394 | } |
| 395 | |
| 396 | T& operator[](intptr_t i) { |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 397 | DCHECK_LT(i, GetLength()); |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 398 | return elements_[i]; |
| 399 | } |
| 400 | |
| 401 | const T& At(intptr_t i) const { |
| 402 | return (*this)[i]; |
| 403 | } |
| 404 | |
| 405 | void SetAt(intptr_t i, const T& val) { |
| 406 | (*this)[i] = val; |
| 407 | } |
| 408 | |
| 409 | private: |
| 410 | T elements_[N]; |
| 411 | }; |
| 412 | |
| 413 | template<typename T> |
| 414 | class EmbeddedArray<T, 0> { |
| 415 | public: |
| 416 | intptr_t length() const { return 0; } |
| 417 | const T& operator[](intptr_t i) const { |
| 418 | LOG(FATAL) << "Unreachable"; |
| 419 | static T sentinel = 0; |
| 420 | return sentinel; |
| 421 | } |
| 422 | T& operator[](intptr_t i) { |
| 423 | LOG(FATAL) << "Unreachable"; |
| 424 | static T sentinel = 0; |
| 425 | return sentinel; |
| 426 | } |
| 427 | }; |
| 428 | |
| 429 | template<intptr_t N> |
| 430 | class HTemplateInstruction: public HInstruction { |
| 431 | public: |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 432 | HTemplateInstruction<N>() : inputs_() { } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 433 | virtual ~HTemplateInstruction() { } |
| 434 | |
| 435 | virtual intptr_t InputCount() const { return N; } |
| 436 | virtual HInstruction* InputAt(intptr_t i) const { return inputs_[i]; } |
| 437 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 438 | protected: |
| 439 | void SetRawInputAt(intptr_t i, HInstruction* instruction) { |
| 440 | inputs_[i] = instruction; |
| 441 | } |
| 442 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 443 | private: |
| 444 | EmbeddedArray<HInstruction*, N> inputs_; |
| 445 | }; |
| 446 | |
| 447 | // Represents dex's RETURN_VOID opcode. A HReturnVoid is a control flow |
| 448 | // instruction that branches to the exit block. |
| 449 | class HReturnVoid : public HTemplateInstruction<0> { |
| 450 | public: |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 451 | HReturnVoid() { } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 452 | |
| 453 | DECLARE_INSTRUCTION(ReturnVoid) |
| 454 | |
| 455 | private: |
| 456 | DISALLOW_COPY_AND_ASSIGN(HReturnVoid); |
| 457 | }; |
| 458 | |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 459 | // Represents dex's RETURN opcodes. A HReturn is a control flow |
| 460 | // instruction that branches to the exit block. |
| 461 | class HReturn : public HTemplateInstruction<1> { |
| 462 | public: |
| 463 | explicit HReturn(HInstruction* value) { |
| 464 | SetRawInputAt(0, value); |
| 465 | } |
| 466 | |
| 467 | DECLARE_INSTRUCTION(Return) |
| 468 | |
| 469 | private: |
| 470 | DISALLOW_COPY_AND_ASSIGN(HReturn); |
| 471 | }; |
| 472 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 473 | // The exit instruction is the only instruction of the exit block. |
| 474 | // Instructions aborting the method (HTrow and HReturn) must branch to the |
| 475 | // exit block. |
| 476 | class HExit : public HTemplateInstruction<0> { |
| 477 | public: |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 478 | HExit() { } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 479 | |
| 480 | DECLARE_INSTRUCTION(Exit) |
| 481 | |
| 482 | private: |
| 483 | DISALLOW_COPY_AND_ASSIGN(HExit); |
| 484 | }; |
| 485 | |
| 486 | // Jumps from one block to another. |
| 487 | class HGoto : public HTemplateInstruction<0> { |
| 488 | public: |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 489 | HGoto() { } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 490 | |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 491 | HBasicBlock* GetSuccessor() const { |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 492 | return GetBlock()->GetSuccessors()->Get(0); |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 493 | } |
| 494 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 495 | DECLARE_INSTRUCTION(Goto) |
| 496 | |
| 497 | private: |
| 498 | DISALLOW_COPY_AND_ASSIGN(HGoto); |
| 499 | }; |
| 500 | |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 501 | // Conditional branch. A block ending with an HIf instruction must have |
| 502 | // two successors. |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 503 | class HIf : public HTemplateInstruction<1> { |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 504 | public: |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 505 | explicit HIf(HInstruction* input) { |
| 506 | SetRawInputAt(0, input); |
| 507 | } |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 508 | |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 509 | HBasicBlock* IfTrueSuccessor() const { |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 510 | return GetBlock()->GetSuccessors()->Get(0); |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 511 | } |
| 512 | |
| 513 | HBasicBlock* IfFalseSuccessor() const { |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 514 | return GetBlock()->GetSuccessors()->Get(1); |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 515 | } |
| 516 | |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 517 | DECLARE_INSTRUCTION(If) |
| 518 | |
| 519 | private: |
| 520 | DISALLOW_COPY_AND_ASSIGN(HIf); |
| 521 | }; |
| 522 | |
Nicolas Geoffray | d8ee737 | 2014-03-28 15:43:40 +0000 | [diff] [blame] | 523 | class HBinaryOperation : public HTemplateInstruction<2> { |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 524 | public: |
Nicolas Geoffray | d8ee737 | 2014-03-28 15:43:40 +0000 | [diff] [blame] | 525 | HBinaryOperation(Primitive::Type result_type, |
| 526 | HInstruction* left, |
| 527 | HInstruction* right) : result_type_(result_type) { |
| 528 | SetRawInputAt(0, left); |
| 529 | SetRawInputAt(1, right); |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 530 | } |
| 531 | |
Nicolas Geoffray | d8ee737 | 2014-03-28 15:43:40 +0000 | [diff] [blame] | 532 | HInstruction* GetLeft() const { return InputAt(0); } |
| 533 | HInstruction* GetRight() const { return InputAt(1); } |
| 534 | Primitive::Type GetResultType() const { return result_type_; } |
| 535 | |
| 536 | virtual bool IsCommutative() { return false; } |
| 537 | |
| 538 | private: |
| 539 | const Primitive::Type result_type_; |
| 540 | |
| 541 | DISALLOW_COPY_AND_ASSIGN(HBinaryOperation); |
| 542 | }; |
| 543 | |
| 544 | |
| 545 | // Instruction to check if two inputs are equal to each other. |
| 546 | class HEqual : public HBinaryOperation { |
| 547 | public: |
| 548 | HEqual(HInstruction* first, HInstruction* second) |
| 549 | : HBinaryOperation(Primitive::kPrimBoolean, first, second) {} |
| 550 | |
| 551 | virtual bool IsCommutative() { return true; } |
| 552 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 553 | DECLARE_INSTRUCTION(Equal) |
| 554 | |
| 555 | private: |
| 556 | DISALLOW_COPY_AND_ASSIGN(HEqual); |
| 557 | }; |
| 558 | |
| 559 | // A local in the graph. Corresponds to a Dex register. |
| 560 | class HLocal : public HTemplateInstruction<0> { |
| 561 | public: |
| 562 | explicit HLocal(uint16_t reg_number) : reg_number_(reg_number) { } |
| 563 | |
| 564 | DECLARE_INSTRUCTION(Local) |
| 565 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 566 | uint16_t GetRegNumber() const { return reg_number_; } |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 567 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 568 | private: |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 569 | // The Dex register number. |
| 570 | const uint16_t reg_number_; |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 571 | |
| 572 | DISALLOW_COPY_AND_ASSIGN(HLocal); |
| 573 | }; |
| 574 | |
| 575 | // Load a given local. The local is an input of this instruction. |
| 576 | class HLoadLocal : public HTemplateInstruction<1> { |
| 577 | public: |
| 578 | explicit HLoadLocal(HLocal* local) { |
| 579 | SetRawInputAt(0, local); |
| 580 | } |
| 581 | |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 582 | HLocal* GetLocal() const { return reinterpret_cast<HLocal*>(InputAt(0)); } |
| 583 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 584 | DECLARE_INSTRUCTION(LoadLocal) |
| 585 | |
| 586 | private: |
| 587 | DISALLOW_COPY_AND_ASSIGN(HLoadLocal); |
| 588 | }; |
| 589 | |
| 590 | // Store a value in a given local. This instruction has two inputs: the value |
| 591 | // and the local. |
| 592 | class HStoreLocal : public HTemplateInstruction<2> { |
| 593 | public: |
| 594 | HStoreLocal(HLocal* local, HInstruction* value) { |
| 595 | SetRawInputAt(0, local); |
| 596 | SetRawInputAt(1, value); |
| 597 | } |
| 598 | |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 599 | HLocal* GetLocal() const { return reinterpret_cast<HLocal*>(InputAt(0)); } |
| 600 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 601 | DECLARE_INSTRUCTION(StoreLocal) |
| 602 | |
| 603 | private: |
| 604 | DISALLOW_COPY_AND_ASSIGN(HStoreLocal); |
| 605 | }; |
| 606 | |
| 607 | // Constants of the type int. Those can be from Dex instructions, or |
| 608 | // synthesized (for example with the if-eqz instruction). |
| 609 | class HIntConstant : public HTemplateInstruction<0> { |
| 610 | public: |
| 611 | explicit HIntConstant(int32_t value) : value_(value) { } |
| 612 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 613 | int32_t GetValue() const { return value_; } |
Nicolas Geoffray | bab4ed7 | 2014-03-11 17:53:17 +0000 | [diff] [blame] | 614 | |
Nicolas Geoffray | 3ff386a | 2014-03-04 14:46:47 +0000 | [diff] [blame] | 615 | DECLARE_INSTRUCTION(IntConstant) |
| 616 | |
| 617 | private: |
| 618 | const int32_t value_; |
| 619 | |
| 620 | DISALLOW_COPY_AND_ASSIGN(HIntConstant); |
| 621 | }; |
| 622 | |
Nicolas Geoffray | 8ccc3f5 | 2014-03-19 10:34:11 +0000 | [diff] [blame] | 623 | class HInvoke : public HInstruction { |
| 624 | public: |
Nicolas Geoffray | 2e7038a | 2014-04-03 18:49:58 +0100 | [diff] [blame] | 625 | HInvoke(ArenaAllocator* arena, uint32_t number_of_arguments, uint32_t dex_pc) |
Nicolas Geoffray | 8ccc3f5 | 2014-03-19 10:34:11 +0000 | [diff] [blame] | 626 | : inputs_(arena, number_of_arguments), |
| 627 | dex_pc_(dex_pc) { |
| 628 | inputs_.SetSize(number_of_arguments); |
| 629 | } |
| 630 | |
| 631 | virtual intptr_t InputCount() const { return inputs_.Size(); } |
| 632 | virtual HInstruction* InputAt(intptr_t i) const { return inputs_.Get(i); } |
| 633 | |
Nicolas Geoffray | 4a34a42 | 2014-04-03 10:38:37 +0100 | [diff] [blame] | 634 | void SetArgumentAt(size_t index, HInstruction* argument) { |
| 635 | inputs_.Put(index, argument); |
| 636 | } |
| 637 | |
Nicolas Geoffray | 2e7038a | 2014-04-03 18:49:58 +0100 | [diff] [blame] | 638 | uint32_t GetDexPc() const { return dex_pc_; } |
Nicolas Geoffray | 8ccc3f5 | 2014-03-19 10:34:11 +0000 | [diff] [blame] | 639 | |
| 640 | protected: |
| 641 | GrowableArray<HInstruction*> inputs_; |
Nicolas Geoffray | 2e7038a | 2014-04-03 18:49:58 +0100 | [diff] [blame] | 642 | const uint32_t dex_pc_; |
Nicolas Geoffray | 8ccc3f5 | 2014-03-19 10:34:11 +0000 | [diff] [blame] | 643 | |
| 644 | private: |
| 645 | DISALLOW_COPY_AND_ASSIGN(HInvoke); |
| 646 | }; |
| 647 | |
| 648 | class HInvokeStatic : public HInvoke { |
| 649 | public: |
Nicolas Geoffray | 4a34a42 | 2014-04-03 10:38:37 +0100 | [diff] [blame] | 650 | HInvokeStatic(ArenaAllocator* arena, |
| 651 | uint32_t number_of_arguments, |
Nicolas Geoffray | 2e7038a | 2014-04-03 18:49:58 +0100 | [diff] [blame] | 652 | uint32_t dex_pc, |
| 653 | uint32_t index_in_dex_cache) |
Nicolas Geoffray | 4a34a42 | 2014-04-03 10:38:37 +0100 | [diff] [blame] | 654 | : HInvoke(arena, number_of_arguments, dex_pc), index_in_dex_cache_(index_in_dex_cache) {} |
Nicolas Geoffray | 8ccc3f5 | 2014-03-19 10:34:11 +0000 | [diff] [blame] | 655 | |
| 656 | uint32_t GetIndexInDexCache() const { return index_in_dex_cache_; } |
| 657 | |
| 658 | DECLARE_INSTRUCTION(InvokeStatic) |
| 659 | |
| 660 | private: |
Nicolas Geoffray | 4a34a42 | 2014-04-03 10:38:37 +0100 | [diff] [blame] | 661 | const uint32_t index_in_dex_cache_; |
Nicolas Geoffray | 8ccc3f5 | 2014-03-19 10:34:11 +0000 | [diff] [blame] | 662 | |
| 663 | DISALLOW_COPY_AND_ASSIGN(HInvokeStatic); |
| 664 | }; |
| 665 | |
Nicolas Geoffray | 2e7038a | 2014-04-03 18:49:58 +0100 | [diff] [blame] | 666 | class HNewInstance : public HTemplateInstruction<0> { |
| 667 | public: |
| 668 | HNewInstance(uint32_t dex_pc, uint16_t type_index) : dex_pc_(dex_pc), type_index_(type_index) {} |
| 669 | |
| 670 | uint32_t GetDexPc() const { return dex_pc_; } |
| 671 | uint16_t GetTypeIndex() const { return type_index_; } |
| 672 | |
| 673 | DECLARE_INSTRUCTION(NewInstance) |
| 674 | |
| 675 | private: |
| 676 | const uint32_t dex_pc_; |
| 677 | const uint16_t type_index_; |
| 678 | |
| 679 | DISALLOW_COPY_AND_ASSIGN(HNewInstance); |
| 680 | }; |
| 681 | |
Nicolas Geoffray | 4a34a42 | 2014-04-03 10:38:37 +0100 | [diff] [blame] | 682 | // HPushArgument nodes are inserted after the evaluation of an argument |
| 683 | // of a call. Their mere purpose is to ease the code generator's work. |
| 684 | class HPushArgument : public HTemplateInstruction<1> { |
| 685 | public: |
| 686 | HPushArgument(HInstruction* argument, uint8_t argument_index) : argument_index_(argument_index) { |
| 687 | SetRawInputAt(0, argument); |
| 688 | } |
| 689 | |
| 690 | uint8_t GetArgumentIndex() const { return argument_index_; } |
| 691 | |
| 692 | DECLARE_INSTRUCTION(PushArgument) |
| 693 | |
| 694 | private: |
| 695 | const uint8_t argument_index_; |
| 696 | |
| 697 | DISALLOW_COPY_AND_ASSIGN(HPushArgument); |
| 698 | }; |
| 699 | |
Nicolas Geoffray | d8ee737 | 2014-03-28 15:43:40 +0000 | [diff] [blame] | 700 | class HAdd : public HBinaryOperation { |
| 701 | public: |
| 702 | HAdd(Primitive::Type result_type, HInstruction* left, HInstruction* right) |
| 703 | : HBinaryOperation(result_type, left, right) {} |
| 704 | |
| 705 | virtual bool IsCommutative() { return true; } |
| 706 | |
| 707 | DECLARE_INSTRUCTION(Add); |
| 708 | |
| 709 | private: |
| 710 | DISALLOW_COPY_AND_ASSIGN(HAdd); |
| 711 | }; |
| 712 | |
Nicolas Geoffray | f583e59 | 2014-04-07 13:20:42 +0100 | [diff] [blame] | 713 | class HSub : public HBinaryOperation { |
| 714 | public: |
| 715 | HSub(Primitive::Type result_type, HInstruction* left, HInstruction* right) |
| 716 | : HBinaryOperation(result_type, left, right) {} |
| 717 | |
| 718 | virtual bool IsCommutative() { return false; } |
| 719 | |
| 720 | DECLARE_INSTRUCTION(Sub); |
| 721 | |
| 722 | private: |
| 723 | DISALLOW_COPY_AND_ASSIGN(HSub); |
| 724 | }; |
| 725 | |
| 726 | // The value of a parameter in this method. Its location depends on |
| 727 | // the calling convention. |
| 728 | class HParameterValue : public HTemplateInstruction<0> { |
| 729 | public: |
| 730 | explicit HParameterValue(uint8_t index) : index_(index) {} |
| 731 | |
| 732 | uint8_t GetIndex() const { return index_; } |
| 733 | |
| 734 | DECLARE_INSTRUCTION(ParameterValue); |
| 735 | |
| 736 | private: |
| 737 | // The index of this parameter in the parameters list. Must be less |
| 738 | // than HGraph::number_of_in_vregs_; |
| 739 | const uint8_t index_; |
| 740 | |
| 741 | DISALLOW_COPY_AND_ASSIGN(HParameterValue); |
| 742 | }; |
| 743 | |
Nicolas Geoffray | b55f835 | 2014-04-07 15:26:35 +0100 | [diff] [blame^] | 744 | class HNot : public HTemplateInstruction<1> { |
| 745 | public: |
| 746 | explicit HNot(HInstruction* input) { |
| 747 | SetRawInputAt(0, input); |
| 748 | } |
| 749 | |
| 750 | DECLARE_INSTRUCTION(Not); |
| 751 | |
| 752 | private: |
| 753 | DISALLOW_COPY_AND_ASSIGN(HNot); |
| 754 | }; |
| 755 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 756 | class HGraphVisitor : public ValueObject { |
| 757 | public: |
| 758 | explicit HGraphVisitor(HGraph* graph) : graph_(graph) { } |
| 759 | virtual ~HGraphVisitor() { } |
| 760 | |
| 761 | virtual void VisitInstruction(HInstruction* instruction) { } |
| 762 | virtual void VisitBasicBlock(HBasicBlock* block); |
| 763 | |
| 764 | void VisitInsertionOrder(); |
| 765 | |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 766 | HGraph* GetGraph() const { return graph_; } |
Nicolas Geoffray | d4dd255 | 2014-02-28 10:23:58 +0000 | [diff] [blame] | 767 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 768 | // Visit functions for instruction classes. |
| 769 | #define DECLARE_VISIT_INSTRUCTION(name) \ |
| 770 | virtual void Visit##name(H##name* instr) { VisitInstruction(instr); } |
| 771 | |
| 772 | FOR_EACH_INSTRUCTION(DECLARE_VISIT_INSTRUCTION) |
| 773 | |
| 774 | #undef DECLARE_VISIT_INSTRUCTION |
| 775 | |
| 776 | private: |
| 777 | HGraph* graph_; |
| 778 | |
| 779 | DISALLOW_COPY_AND_ASSIGN(HGraphVisitor); |
| 780 | }; |
| 781 | |
| 782 | } // namespace art |
| 783 | |
| 784 | #endif // ART_COMPILER_OPTIMIZING_NODES_H_ |