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 | #include "nodes.h" |
Calin Juravle | 77520bc | 2015-01-12 18:45:46 +0000 | [diff] [blame] | 18 | |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 19 | #include "code_generator.h" |
Vladimir Marko | 391d01f | 2015-11-06 11:02:08 +0000 | [diff] [blame] | 20 | #include "common_dominator.h" |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 21 | #include "ssa_builder.h" |
David Brazdil | a4b8c21 | 2015-05-07 09:59:30 +0100 | [diff] [blame] | 22 | #include "base/bit_vector-inl.h" |
Vladimir Marko | 80afd02 | 2015-05-19 18:08:00 +0100 | [diff] [blame] | 23 | #include "base/bit_utils.h" |
Vladimir Marko | 1f8695c | 2015-09-24 13:11:31 +0100 | [diff] [blame] | 24 | #include "base/stl_util.h" |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 25 | #include "intrinsics.h" |
David Brazdil | baf89b8 | 2015-09-15 11:36:54 +0100 | [diff] [blame] | 26 | #include "mirror/class-inl.h" |
Calin Juravle | acf735c | 2015-02-12 15:25:22 +0000 | [diff] [blame] | 27 | #include "scoped_thread_state_change.h" |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 28 | |
| 29 | namespace art { |
| 30 | |
| 31 | void HGraph::AddBlock(HBasicBlock* block) { |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 32 | block->SetBlockId(blocks_.size()); |
| 33 | blocks_.push_back(block); |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 34 | } |
| 35 | |
Nicolas Geoffray | 804d093 | 2014-05-02 08:46:00 +0100 | [diff] [blame] | 36 | void HGraph::FindBackEdges(ArenaBitVector* visited) { |
Vladimir Marko | 1f8695c | 2015-09-24 13:11:31 +0100 | [diff] [blame] | 37 | // "visited" must be empty on entry, it's an output argument for all visited (i.e. live) blocks. |
| 38 | DCHECK_EQ(visited->GetHighestBitSet(), -1); |
| 39 | |
| 40 | // Nodes that we're currently visiting, indexed by block id. |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 41 | ArenaBitVector visiting(arena_, blocks_.size(), false); |
Vladimir Marko | 1f8695c | 2015-09-24 13:11:31 +0100 | [diff] [blame] | 42 | // Number of successors visited from a given node, indexed by block id. |
| 43 | ArenaVector<size_t> successors_visited(blocks_.size(), 0u, arena_->Adapter()); |
| 44 | // Stack of nodes that we're currently visiting (same as marked in "visiting" above). |
| 45 | ArenaVector<HBasicBlock*> worklist(arena_->Adapter()); |
| 46 | constexpr size_t kDefaultWorklistSize = 8; |
| 47 | worklist.reserve(kDefaultWorklistSize); |
| 48 | visited->SetBit(entry_block_->GetBlockId()); |
| 49 | visiting.SetBit(entry_block_->GetBlockId()); |
| 50 | worklist.push_back(entry_block_); |
| 51 | |
| 52 | while (!worklist.empty()) { |
| 53 | HBasicBlock* current = worklist.back(); |
| 54 | uint32_t current_id = current->GetBlockId(); |
| 55 | if (successors_visited[current_id] == current->GetSuccessors().size()) { |
| 56 | visiting.ClearBit(current_id); |
| 57 | worklist.pop_back(); |
| 58 | } else { |
Vladimir Marko | 1f8695c | 2015-09-24 13:11:31 +0100 | [diff] [blame] | 59 | HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; |
| 60 | uint32_t successor_id = successor->GetBlockId(); |
| 61 | if (visiting.IsBitSet(successor_id)) { |
| 62 | DCHECK(ContainsElement(worklist, successor)); |
| 63 | successor->AddBackEdge(current); |
| 64 | } else if (!visited->IsBitSet(successor_id)) { |
| 65 | visited->SetBit(successor_id); |
| 66 | visiting.SetBit(successor_id); |
| 67 | worklist.push_back(successor); |
| 68 | } |
| 69 | } |
| 70 | } |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 71 | } |
| 72 | |
Roland Levillain | fc600dc | 2014-12-02 17:16:31 +0000 | [diff] [blame] | 73 | static void RemoveAsUser(HInstruction* instruction) { |
| 74 | for (size_t i = 0; i < instruction->InputCount(); i++) { |
David Brazdil | 1abb419 | 2015-02-17 18:33:36 +0000 | [diff] [blame] | 75 | instruction->RemoveAsUserOfInput(i); |
Roland Levillain | fc600dc | 2014-12-02 17:16:31 +0000 | [diff] [blame] | 76 | } |
| 77 | |
Nicolas Geoffray | 0a23d74 | 2015-05-07 11:57:35 +0100 | [diff] [blame] | 78 | for (HEnvironment* environment = instruction->GetEnvironment(); |
| 79 | environment != nullptr; |
| 80 | environment = environment->GetParent()) { |
Roland Levillain | fc600dc | 2014-12-02 17:16:31 +0000 | [diff] [blame] | 81 | for (size_t i = 0, e = environment->Size(); i < e; ++i) { |
David Brazdil | 1abb419 | 2015-02-17 18:33:36 +0000 | [diff] [blame] | 82 | if (environment->GetInstructionAt(i) != nullptr) { |
| 83 | environment->RemoveAsUserOfInput(i); |
Roland Levillain | fc600dc | 2014-12-02 17:16:31 +0000 | [diff] [blame] | 84 | } |
| 85 | } |
| 86 | } |
| 87 | } |
| 88 | |
| 89 | void HGraph::RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const { |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 90 | for (size_t i = 0; i < blocks_.size(); ++i) { |
Roland Levillain | fc600dc | 2014-12-02 17:16:31 +0000 | [diff] [blame] | 91 | if (!visited.IsBitSet(i)) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 92 | HBasicBlock* block = blocks_[i]; |
Nicolas Geoffray | f776b92 | 2015-04-15 18:22:45 +0100 | [diff] [blame] | 93 | DCHECK(block->GetPhis().IsEmpty()) << "Phis are not inserted at this stage"; |
Roland Levillain | fc600dc | 2014-12-02 17:16:31 +0000 | [diff] [blame] | 94 | for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { |
| 95 | RemoveAsUser(it.Current()); |
| 96 | } |
| 97 | } |
| 98 | } |
| 99 | } |
| 100 | |
Nicolas Geoffray | f776b92 | 2015-04-15 18:22:45 +0100 | [diff] [blame] | 101 | void HGraph::RemoveDeadBlocks(const ArenaBitVector& visited) { |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 102 | for (size_t i = 0; i < blocks_.size(); ++i) { |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 103 | if (!visited.IsBitSet(i)) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 104 | HBasicBlock* block = blocks_[i]; |
Nicolas Geoffray | f776b92 | 2015-04-15 18:22:45 +0100 | [diff] [blame] | 105 | // We only need to update the successor, which might be live. |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 106 | for (HBasicBlock* successor : block->GetSuccessors()) { |
| 107 | successor->RemovePredecessor(block); |
David Brazdil | 1abb419 | 2015-02-17 18:33:36 +0000 | [diff] [blame] | 108 | } |
Nicolas Geoffray | f776b92 | 2015-04-15 18:22:45 +0100 | [diff] [blame] | 109 | // Remove the block from the list of blocks, so that further analyses |
| 110 | // never see it. |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 111 | blocks_[i] = nullptr; |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 112 | } |
| 113 | } |
| 114 | } |
| 115 | |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 116 | void HGraph::BuildDominatorTree() { |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 117 | // (1) Simplify the CFG so that catch blocks have only exceptional incoming |
| 118 | // edges. This invariant simplifies building SSA form because Phis cannot |
| 119 | // collect both normal- and exceptional-flow values at the same time. |
| 120 | SimplifyCatchBlocks(); |
| 121 | |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 122 | ArenaBitVector visited(arena_, blocks_.size(), false); |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 123 | |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 124 | // (2) Find the back edges in the graph doing a DFS traversal. |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 125 | FindBackEdges(&visited); |
| 126 | |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 127 | // (3) Remove instructions and phis from blocks not visited during |
Roland Levillain | fc600dc | 2014-12-02 17:16:31 +0000 | [diff] [blame] | 128 | // the initial DFS as users from other instructions, so that |
| 129 | // users can be safely removed before uses later. |
| 130 | RemoveInstructionsAsUsersFromDeadBlocks(visited); |
| 131 | |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 132 | // (4) Remove blocks not visited during the initial DFS. |
Roland Levillain | fc600dc | 2014-12-02 17:16:31 +0000 | [diff] [blame] | 133 | // Step (4) requires dead blocks to be removed from the |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 134 | // predecessors list of live blocks. |
| 135 | RemoveDeadBlocks(visited); |
| 136 | |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 137 | // (5) Simplify the CFG now, so that we don't need to recompute |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 138 | // dominators and the reverse post order. |
| 139 | SimplifyCFG(); |
| 140 | |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 141 | // (6) Compute the dominance information and the reverse post order. |
Nicolas Geoffray | 1f82ecc | 2015-06-24 12:20:24 +0100 | [diff] [blame] | 142 | ComputeDominanceInformation(); |
| 143 | } |
| 144 | |
| 145 | void HGraph::ClearDominanceInformation() { |
| 146 | for (HReversePostOrderIterator it(*this); !it.Done(); it.Advance()) { |
| 147 | it.Current()->ClearDominanceInformation(); |
| 148 | } |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 149 | reverse_post_order_.clear(); |
Nicolas Geoffray | 1f82ecc | 2015-06-24 12:20:24 +0100 | [diff] [blame] | 150 | } |
| 151 | |
| 152 | void HBasicBlock::ClearDominanceInformation() { |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 153 | dominated_blocks_.clear(); |
Nicolas Geoffray | 1f82ecc | 2015-06-24 12:20:24 +0100 | [diff] [blame] | 154 | dominator_ = nullptr; |
| 155 | } |
| 156 | |
| 157 | void HGraph::ComputeDominanceInformation() { |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 158 | DCHECK(reverse_post_order_.empty()); |
| 159 | reverse_post_order_.reserve(blocks_.size()); |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 160 | reverse_post_order_.push_back(entry_block_); |
Vladimir Marko | d76d139 | 2015-09-23 16:07:14 +0100 | [diff] [blame] | 161 | |
| 162 | // Number of visits of a given node, indexed by block id. |
| 163 | ArenaVector<size_t> visits(blocks_.size(), 0u, arena_->Adapter()); |
| 164 | // Number of successors visited from a given node, indexed by block id. |
| 165 | ArenaVector<size_t> successors_visited(blocks_.size(), 0u, arena_->Adapter()); |
| 166 | // Nodes for which we need to visit successors. |
| 167 | ArenaVector<HBasicBlock*> worklist(arena_->Adapter()); |
| 168 | constexpr size_t kDefaultWorklistSize = 8; |
| 169 | worklist.reserve(kDefaultWorklistSize); |
| 170 | worklist.push_back(entry_block_); |
| 171 | |
| 172 | while (!worklist.empty()) { |
| 173 | HBasicBlock* current = worklist.back(); |
| 174 | uint32_t current_id = current->GetBlockId(); |
| 175 | if (successors_visited[current_id] == current->GetSuccessors().size()) { |
| 176 | worklist.pop_back(); |
| 177 | } else { |
Vladimir Marko | d76d139 | 2015-09-23 16:07:14 +0100 | [diff] [blame] | 178 | HBasicBlock* successor = current->GetSuccessors()[successors_visited[current_id]++]; |
| 179 | |
| 180 | if (successor->GetDominator() == nullptr) { |
| 181 | successor->SetDominator(current); |
| 182 | } else { |
Vladimir Marko | 391d01f | 2015-11-06 11:02:08 +0000 | [diff] [blame] | 183 | // The CommonDominator can work for multiple blocks as long as the |
| 184 | // domination information doesn't change. However, since we're changing |
| 185 | // that information here, we can use the finder only for pairs of blocks. |
| 186 | successor->SetDominator(CommonDominator::ForPair(successor->GetDominator(), current)); |
Vladimir Marko | d76d139 | 2015-09-23 16:07:14 +0100 | [diff] [blame] | 187 | } |
| 188 | |
| 189 | // Once all the forward edges have been visited, we know the immediate |
| 190 | // dominator of the block. We can then start visiting its successors. |
Vladimir Marko | d76d139 | 2015-09-23 16:07:14 +0100 | [diff] [blame] | 191 | if (++visits[successor->GetBlockId()] == |
| 192 | successor->GetPredecessors().size() - successor->NumberOfBackEdges()) { |
| 193 | successor->GetDominator()->AddDominatedBlock(successor); |
| 194 | reverse_post_order_.push_back(successor); |
| 195 | worklist.push_back(successor); |
| 196 | } |
| 197 | } |
Nicolas Geoffray | be9a92a | 2014-02-25 14:22:56 +0000 | [diff] [blame] | 198 | } |
| 199 | } |
| 200 | |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 201 | void HGraph::TransformToSsa() { |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 202 | DCHECK(!reverse_post_order_.empty()); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 203 | SsaBuilder ssa_builder(this); |
| 204 | ssa_builder.BuildSsa(); |
| 205 | } |
| 206 | |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 207 | HBasicBlock* HGraph::SplitEdge(HBasicBlock* block, HBasicBlock* successor) { |
David Brazdil | 3e18738 | 2015-06-26 09:59:52 +0000 | [diff] [blame] | 208 | HBasicBlock* new_block = new (arena_) HBasicBlock(this, successor->GetDexPc()); |
| 209 | AddBlock(new_block); |
David Brazdil | 3e18738 | 2015-06-26 09:59:52 +0000 | [diff] [blame] | 210 | // Use `InsertBetween` to ensure the predecessor index and successor index of |
| 211 | // `block` and `successor` are preserved. |
| 212 | new_block->InsertBetween(block, successor); |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 213 | return new_block; |
| 214 | } |
| 215 | |
| 216 | void HGraph::SplitCriticalEdge(HBasicBlock* block, HBasicBlock* successor) { |
| 217 | // Insert a new node between `block` and `successor` to split the |
| 218 | // critical edge. |
| 219 | HBasicBlock* new_block = SplitEdge(block, successor); |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 220 | new_block->AddInstruction(new (arena_) HGoto(successor->GetDexPc())); |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 221 | if (successor->IsLoopHeader()) { |
| 222 | // If we split at a back edge boundary, make the new block the back edge. |
| 223 | HLoopInformation* info = successor->GetLoopInformation(); |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 224 | if (info->IsBackEdge(*block)) { |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 225 | info->RemoveBackEdge(block); |
| 226 | info->AddBackEdge(new_block); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 227 | } |
| 228 | } |
| 229 | } |
| 230 | |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 231 | void HGraph::SimplifyLoop(HBasicBlock* header) { |
| 232 | HLoopInformation* info = header->GetLoopInformation(); |
| 233 | |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 234 | // Make sure the loop has only one pre header. This simplifies SSA building by having |
| 235 | // to just look at the pre header to know which locals are initialized at entry of the |
| 236 | // loop. |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 237 | size_t number_of_incomings = header->GetPredecessors().size() - info->NumberOfBackEdges(); |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 238 | if (number_of_incomings != 1) { |
Nicolas Geoffray | 3c04974 | 2014-09-24 18:10:46 +0100 | [diff] [blame] | 239 | HBasicBlock* pre_header = new (arena_) HBasicBlock(this, header->GetDexPc()); |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 240 | AddBlock(pre_header); |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 241 | pre_header->AddInstruction(new (arena_) HGoto(header->GetDexPc())); |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 242 | |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 243 | for (size_t pred = 0; pred < header->GetPredecessors().size(); ++pred) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 244 | HBasicBlock* predecessor = header->GetPredecessors()[pred]; |
Nicolas Geoffray | db216f4 | 2015-05-05 17:02:20 +0100 | [diff] [blame] | 245 | if (!info->IsBackEdge(*predecessor)) { |
Nicolas Geoffray | ec7e472 | 2014-06-06 11:24:33 +0100 | [diff] [blame] | 246 | predecessor->ReplaceSuccessor(header, pre_header); |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 247 | pred--; |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 248 | } |
| 249 | } |
| 250 | pre_header->AddSuccessor(header); |
| 251 | } |
Nicolas Geoffray | 604c6e4 | 2014-09-17 12:08:44 +0100 | [diff] [blame] | 252 | |
Nicolas Geoffray | db216f4 | 2015-05-05 17:02:20 +0100 | [diff] [blame] | 253 | // Make sure the first predecessor of a loop header is the incoming block. |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 254 | if (info->IsBackEdge(*header->GetPredecessors()[0])) { |
| 255 | HBasicBlock* to_swap = header->GetPredecessors()[0]; |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 256 | for (size_t pred = 1, e = header->GetPredecessors().size(); pred < e; ++pred) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 257 | HBasicBlock* predecessor = header->GetPredecessors()[pred]; |
Nicolas Geoffray | db216f4 | 2015-05-05 17:02:20 +0100 | [diff] [blame] | 258 | if (!info->IsBackEdge(*predecessor)) { |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 259 | header->predecessors_[pred] = to_swap; |
| 260 | header->predecessors_[0] = predecessor; |
Nicolas Geoffray | db216f4 | 2015-05-05 17:02:20 +0100 | [diff] [blame] | 261 | break; |
| 262 | } |
| 263 | } |
Nicolas Geoffray | 604c6e4 | 2014-09-17 12:08:44 +0100 | [diff] [blame] | 264 | } |
Nicolas Geoffray | 3c04974 | 2014-09-24 18:10:46 +0100 | [diff] [blame] | 265 | |
| 266 | // Place the suspend check at the beginning of the header, so that live registers |
| 267 | // will be known when allocating registers. Note that code generation can still |
| 268 | // generate the suspend check at the back edge, but needs to be careful with |
| 269 | // loop phi spill slots (which are not written to at back edge). |
| 270 | HInstruction* first_instruction = header->GetFirstInstruction(); |
| 271 | if (!first_instruction->IsSuspendCheck()) { |
| 272 | HSuspendCheck* check = new (arena_) HSuspendCheck(header->GetDexPc()); |
| 273 | header->InsertInstructionBefore(check, first_instruction); |
| 274 | first_instruction = check; |
| 275 | } |
| 276 | info->SetSuspendCheck(first_instruction->AsSuspendCheck()); |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 277 | } |
| 278 | |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 279 | static bool CheckIfPredecessorAtIsExceptional(const HBasicBlock& block, size_t pred_idx) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 280 | HBasicBlock* predecessor = block.GetPredecessors()[pred_idx]; |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 281 | if (!predecessor->EndsWithTryBoundary()) { |
| 282 | // Only edges from HTryBoundary can be exceptional. |
| 283 | return false; |
| 284 | } |
| 285 | HTryBoundary* try_boundary = predecessor->GetLastInstruction()->AsTryBoundary(); |
| 286 | if (try_boundary->GetNormalFlowSuccessor() == &block) { |
| 287 | // This block is the normal-flow successor of `try_boundary`, but it could |
| 288 | // also be one of its exception handlers if catch blocks have not been |
| 289 | // simplified yet. Predecessors are unordered, so we will consider the first |
| 290 | // occurrence to be the normal edge and a possible second occurrence to be |
| 291 | // the exceptional edge. |
| 292 | return !block.IsFirstIndexOfPredecessor(predecessor, pred_idx); |
| 293 | } else { |
| 294 | // This is not the normal-flow successor of `try_boundary`, hence it must be |
| 295 | // one of its exception handlers. |
| 296 | DCHECK(try_boundary->HasExceptionHandler(block)); |
| 297 | return true; |
| 298 | } |
| 299 | } |
| 300 | |
| 301 | void HGraph::SimplifyCatchBlocks() { |
Vladimir Marko | b7d8e8c | 2015-09-17 15:47:05 +0100 | [diff] [blame] | 302 | // NOTE: We're appending new blocks inside the loop, so we need to use index because iterators |
| 303 | // can be invalidated. We remember the initial size to avoid iterating over the new blocks. |
| 304 | for (size_t block_id = 0u, end = blocks_.size(); block_id != end; ++block_id) { |
| 305 | HBasicBlock* catch_block = blocks_[block_id]; |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 306 | if (!catch_block->IsCatchBlock()) { |
| 307 | continue; |
| 308 | } |
| 309 | |
| 310 | bool exceptional_predecessors_only = true; |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 311 | for (size_t j = 0; j < catch_block->GetPredecessors().size(); ++j) { |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 312 | if (!CheckIfPredecessorAtIsExceptional(*catch_block, j)) { |
| 313 | exceptional_predecessors_only = false; |
| 314 | break; |
| 315 | } |
| 316 | } |
| 317 | |
| 318 | if (!exceptional_predecessors_only) { |
| 319 | // Catch block has normal-flow predecessors and needs to be simplified. |
| 320 | // Splitting the block before its first instruction moves all its |
| 321 | // instructions into `normal_block` and links the two blocks with a Goto. |
| 322 | // Afterwards, incoming normal-flow edges are re-linked to `normal_block`, |
| 323 | // leaving `catch_block` with the exceptional edges only. |
David Brazdil | 9bc4361 | 2015-11-05 21:25:24 +0000 | [diff] [blame] | 324 | // |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 325 | // Note that catch blocks with normal-flow predecessors cannot begin with |
David Brazdil | 9bc4361 | 2015-11-05 21:25:24 +0000 | [diff] [blame] | 326 | // a move-exception instruction, as guaranteed by the verifier. However, |
| 327 | // trivially dead predecessors are ignored by the verifier and such code |
| 328 | // has not been removed at this stage. We therefore ignore the assumption |
| 329 | // and rely on GraphChecker to enforce it after initial DCE is run (b/25492628). |
| 330 | HBasicBlock* normal_block = catch_block->SplitCatchBlockAfterMoveException(); |
| 331 | if (normal_block == nullptr) { |
| 332 | // Catch block is either empty or only contains a move-exception. It must |
| 333 | // therefore be dead and will be removed during initial DCE. Do nothing. |
| 334 | DCHECK(!catch_block->EndsWithControlFlowInstruction()); |
| 335 | } else { |
| 336 | // Catch block was split. Re-link normal-flow edges to the new block. |
| 337 | for (size_t j = 0; j < catch_block->GetPredecessors().size(); ++j) { |
| 338 | if (!CheckIfPredecessorAtIsExceptional(*catch_block, j)) { |
| 339 | catch_block->GetPredecessors()[j]->ReplaceSuccessor(catch_block, normal_block); |
| 340 | --j; |
| 341 | } |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 342 | } |
| 343 | } |
| 344 | } |
| 345 | } |
| 346 | } |
| 347 | |
| 348 | void HGraph::ComputeTryBlockInformation() { |
| 349 | // Iterate in reverse post order to propagate try membership information from |
| 350 | // predecessors to their successors. |
| 351 | for (HReversePostOrderIterator it(*this); !it.Done(); it.Advance()) { |
| 352 | HBasicBlock* block = it.Current(); |
| 353 | if (block->IsEntryBlock() || block->IsCatchBlock()) { |
| 354 | // Catch blocks after simplification have only exceptional predecessors |
| 355 | // and hence are never in tries. |
| 356 | continue; |
| 357 | } |
| 358 | |
| 359 | // Infer try membership from the first predecessor. Having simplified loops, |
| 360 | // the first predecessor can never be a back edge and therefore it must have |
| 361 | // been visited already and had its try membership set. |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 362 | HBasicBlock* first_predecessor = block->GetPredecessors()[0]; |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 363 | DCHECK(!block->IsLoopHeader() || !block->GetLoopInformation()->IsBackEdge(*first_predecessor)); |
David Brazdil | ec16f79 | 2015-08-19 15:04:01 +0100 | [diff] [blame] | 364 | const HTryBoundary* try_entry = first_predecessor->ComputeTryEntryOfSuccessors(); |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 365 | if (try_entry != nullptr && |
| 366 | (block->GetTryCatchInformation() == nullptr || |
| 367 | try_entry != &block->GetTryCatchInformation()->GetTryEntry())) { |
| 368 | // We are either setting try block membership for the first time or it |
| 369 | // has changed. |
David Brazdil | ec16f79 | 2015-08-19 15:04:01 +0100 | [diff] [blame] | 370 | block->SetTryCatchInformation(new (arena_) TryCatchInformation(*try_entry)); |
| 371 | } |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 372 | } |
| 373 | } |
| 374 | |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 375 | void HGraph::SimplifyCFG() { |
David Brazdil | db51efb | 2015-11-06 01:36:20 +0000 | [diff] [blame] | 376 | // Simplify the CFG for future analysis, and code generation: |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 377 | // (1): Split critical edges. |
David Brazdil | db51efb | 2015-11-06 01:36:20 +0000 | [diff] [blame] | 378 | // (2): Simplify loops by having only one preheader. |
Vladimir Marko | b7d8e8c | 2015-09-17 15:47:05 +0100 | [diff] [blame] | 379 | // NOTE: We're appending new blocks inside the loop, so we need to use index because iterators |
| 380 | // can be invalidated. We remember the initial size to avoid iterating over the new blocks. |
| 381 | for (size_t block_id = 0u, end = blocks_.size(); block_id != end; ++block_id) { |
| 382 | HBasicBlock* block = blocks_[block_id]; |
Nicolas Geoffray | f776b92 | 2015-04-15 18:22:45 +0100 | [diff] [blame] | 383 | if (block == nullptr) continue; |
David Brazdil | db51efb | 2015-11-06 01:36:20 +0000 | [diff] [blame] | 384 | if (block->GetSuccessors().size() > 1) { |
| 385 | // Only split normal-flow edges. We cannot split exceptional edges as they |
| 386 | // are synthesized (approximate real control flow), and we do not need to |
| 387 | // anyway. Moves that would be inserted there are performed by the runtime. |
David Brazdil | d26a411 | 2015-11-10 11:07:31 +0000 | [diff] [blame] | 388 | ArrayRef<HBasicBlock* const> normal_successors = block->GetNormalSuccessors(); |
| 389 | for (size_t j = 0, e = normal_successors.size(); j < e; ++j) { |
| 390 | HBasicBlock* successor = normal_successors[j]; |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 391 | DCHECK(!successor->IsCatchBlock()); |
David Brazdil | db51efb | 2015-11-06 01:36:20 +0000 | [diff] [blame] | 392 | if (successor == exit_block_) { |
| 393 | // Throw->TryBoundary->Exit. Special case which we do not want to split |
| 394 | // because Goto->Exit is not allowed. |
| 395 | DCHECK(block->IsSingleTryBoundary()); |
| 396 | DCHECK(block->GetSinglePredecessor()->GetLastInstruction()->IsThrow()); |
| 397 | } else if (successor->GetPredecessors().size() > 1) { |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 398 | SplitCriticalEdge(block, successor); |
David Brazdil | d26a411 | 2015-11-10 11:07:31 +0000 | [diff] [blame] | 399 | // SplitCriticalEdge could have invalidated the `normal_successors` |
| 400 | // ArrayRef. We must re-acquire it. |
| 401 | normal_successors = block->GetNormalSuccessors(); |
| 402 | DCHECK_EQ(normal_successors[j]->GetSingleSuccessor(), successor); |
| 403 | DCHECK_EQ(e, normal_successors.size()); |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 404 | } |
| 405 | } |
| 406 | } |
| 407 | if (block->IsLoopHeader()) { |
| 408 | SimplifyLoop(block); |
| 409 | } |
| 410 | } |
| 411 | } |
| 412 | |
Nicolas Geoffray | f537012 | 2014-12-02 11:51:19 +0000 | [diff] [blame] | 413 | bool HGraph::AnalyzeNaturalLoops() const { |
Nicolas Geoffray | f776b92 | 2015-04-15 18:22:45 +0100 | [diff] [blame] | 414 | // Order does not matter. |
| 415 | for (HReversePostOrderIterator it(*this); !it.Done(); it.Advance()) { |
| 416 | HBasicBlock* block = it.Current(); |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 417 | if (block->IsLoopHeader()) { |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 418 | if (block->IsCatchBlock()) { |
| 419 | // TODO: Dealing with exceptional back edges could be tricky because |
| 420 | // they only approximate the real control flow. Bail out for now. |
| 421 | return false; |
| 422 | } |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 423 | HLoopInformation* info = block->GetLoopInformation(); |
| 424 | if (!info->Populate()) { |
| 425 | // Abort if the loop is non natural. We currently bailout in such cases. |
| 426 | return false; |
| 427 | } |
| 428 | } |
| 429 | } |
| 430 | return true; |
| 431 | } |
| 432 | |
David Brazdil | 8d5b8b2 | 2015-03-24 10:51:52 +0000 | [diff] [blame] | 433 | void HGraph::InsertConstant(HConstant* constant) { |
| 434 | // New constants are inserted before the final control-flow instruction |
| 435 | // of the graph, or at its end if called from the graph builder. |
| 436 | if (entry_block_->EndsWithControlFlowInstruction()) { |
| 437 | entry_block_->InsertInstructionBefore(constant, entry_block_->GetLastInstruction()); |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 438 | } else { |
David Brazdil | 8d5b8b2 | 2015-03-24 10:51:52 +0000 | [diff] [blame] | 439 | entry_block_->AddInstruction(constant); |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 440 | } |
| 441 | } |
| 442 | |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 443 | HNullConstant* HGraph::GetNullConstant(uint32_t dex_pc) { |
Nicolas Geoffray | 18e6873 | 2015-06-17 23:09:05 +0100 | [diff] [blame] | 444 | // For simplicity, don't bother reviving the cached null constant if it is |
| 445 | // not null and not in a block. Otherwise, we need to clear the instruction |
| 446 | // id and/or any invariants the graph is assuming when adding new instructions. |
| 447 | if ((cached_null_constant_ == nullptr) || (cached_null_constant_->GetBlock() == nullptr)) { |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 448 | cached_null_constant_ = new (arena_) HNullConstant(dex_pc); |
David Brazdil | 8d5b8b2 | 2015-03-24 10:51:52 +0000 | [diff] [blame] | 449 | InsertConstant(cached_null_constant_); |
Nicolas Geoffray | d6138ef | 2015-02-18 14:48:53 +0000 | [diff] [blame] | 450 | } |
| 451 | return cached_null_constant_; |
| 452 | } |
| 453 | |
Nicolas Geoffray | 76b1e17 | 2015-05-27 17:18:33 +0100 | [diff] [blame] | 454 | HCurrentMethod* HGraph::GetCurrentMethod() { |
Nicolas Geoffray | f78848f | 2015-06-17 11:57:56 +0100 | [diff] [blame] | 455 | // For simplicity, don't bother reviving the cached current method if it is |
| 456 | // not null and not in a block. Otherwise, we need to clear the instruction |
| 457 | // id and/or any invariants the graph is assuming when adding new instructions. |
| 458 | if ((cached_current_method_ == nullptr) || (cached_current_method_->GetBlock() == nullptr)) { |
Mathieu Chartier | e401d14 | 2015-04-22 13:56:20 -0700 | [diff] [blame] | 459 | cached_current_method_ = new (arena_) HCurrentMethod( |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 460 | Is64BitInstructionSet(instruction_set_) ? Primitive::kPrimLong : Primitive::kPrimInt, |
| 461 | entry_block_->GetDexPc()); |
Nicolas Geoffray | 76b1e17 | 2015-05-27 17:18:33 +0100 | [diff] [blame] | 462 | if (entry_block_->GetFirstInstruction() == nullptr) { |
| 463 | entry_block_->AddInstruction(cached_current_method_); |
| 464 | } else { |
| 465 | entry_block_->InsertInstructionBefore( |
| 466 | cached_current_method_, entry_block_->GetFirstInstruction()); |
| 467 | } |
| 468 | } |
| 469 | return cached_current_method_; |
| 470 | } |
| 471 | |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 472 | HConstant* HGraph::GetConstant(Primitive::Type type, int64_t value, uint32_t dex_pc) { |
David Brazdil | 8d5b8b2 | 2015-03-24 10:51:52 +0000 | [diff] [blame] | 473 | switch (type) { |
| 474 | case Primitive::Type::kPrimBoolean: |
| 475 | DCHECK(IsUint<1>(value)); |
| 476 | FALLTHROUGH_INTENDED; |
| 477 | case Primitive::Type::kPrimByte: |
| 478 | case Primitive::Type::kPrimChar: |
| 479 | case Primitive::Type::kPrimShort: |
| 480 | case Primitive::Type::kPrimInt: |
| 481 | DCHECK(IsInt(Primitive::ComponentSize(type) * kBitsPerByte, value)); |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 482 | return GetIntConstant(static_cast<int32_t>(value), dex_pc); |
David Brazdil | 8d5b8b2 | 2015-03-24 10:51:52 +0000 | [diff] [blame] | 483 | |
| 484 | case Primitive::Type::kPrimLong: |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 485 | return GetLongConstant(value, dex_pc); |
David Brazdil | 8d5b8b2 | 2015-03-24 10:51:52 +0000 | [diff] [blame] | 486 | |
| 487 | default: |
| 488 | LOG(FATAL) << "Unsupported constant type"; |
| 489 | UNREACHABLE(); |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 490 | } |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 491 | } |
| 492 | |
Nicolas Geoffray | f213e05 | 2015-04-27 08:53:46 +0000 | [diff] [blame] | 493 | void HGraph::CacheFloatConstant(HFloatConstant* constant) { |
| 494 | int32_t value = bit_cast<int32_t, float>(constant->GetValue()); |
| 495 | DCHECK(cached_float_constants_.find(value) == cached_float_constants_.end()); |
| 496 | cached_float_constants_.Overwrite(value, constant); |
| 497 | } |
| 498 | |
| 499 | void HGraph::CacheDoubleConstant(HDoubleConstant* constant) { |
| 500 | int64_t value = bit_cast<int64_t, double>(constant->GetValue()); |
| 501 | DCHECK(cached_double_constants_.find(value) == cached_double_constants_.end()); |
| 502 | cached_double_constants_.Overwrite(value, constant); |
| 503 | } |
| 504 | |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 505 | void HLoopInformation::Add(HBasicBlock* block) { |
| 506 | blocks_.SetBit(block->GetBlockId()); |
| 507 | } |
| 508 | |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 509 | void HLoopInformation::Remove(HBasicBlock* block) { |
| 510 | blocks_.ClearBit(block->GetBlockId()); |
| 511 | } |
| 512 | |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 513 | void HLoopInformation::PopulateRecursive(HBasicBlock* block) { |
| 514 | if (blocks_.IsBitSet(block->GetBlockId())) { |
| 515 | return; |
| 516 | } |
| 517 | |
| 518 | blocks_.SetBit(block->GetBlockId()); |
| 519 | block->SetInLoop(this); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 520 | for (HBasicBlock* predecessor : block->GetPredecessors()) { |
| 521 | PopulateRecursive(predecessor); |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 522 | } |
| 523 | } |
| 524 | |
| 525 | bool HLoopInformation::Populate() { |
David Brazdil | a4b8c21 | 2015-05-07 09:59:30 +0100 | [diff] [blame] | 526 | DCHECK_EQ(blocks_.NumSetBits(), 0u) << "Loop information has already been populated"; |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 527 | for (HBasicBlock* back_edge : GetBackEdges()) { |
Nicolas Geoffray | db216f4 | 2015-05-05 17:02:20 +0100 | [diff] [blame] | 528 | DCHECK(back_edge->GetDominator() != nullptr); |
| 529 | if (!header_->Dominates(back_edge)) { |
| 530 | // This loop is not natural. Do not bother going further. |
| 531 | return false; |
| 532 | } |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 533 | |
Nicolas Geoffray | db216f4 | 2015-05-05 17:02:20 +0100 | [diff] [blame] | 534 | // Populate this loop: starting with the back edge, recursively add predecessors |
| 535 | // that are not already part of that loop. Set the header as part of the loop |
| 536 | // to end the recursion. |
| 537 | // This is a recursive implementation of the algorithm described in |
| 538 | // "Advanced Compiler Design & Implementation" (Muchnick) p192. |
| 539 | blocks_.SetBit(header_->GetBlockId()); |
| 540 | PopulateRecursive(back_edge); |
| 541 | } |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 542 | return true; |
| 543 | } |
| 544 | |
David Brazdil | a4b8c21 | 2015-05-07 09:59:30 +0100 | [diff] [blame] | 545 | void HLoopInformation::Update() { |
| 546 | HGraph* graph = header_->GetGraph(); |
| 547 | for (uint32_t id : blocks_.Indexes()) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 548 | HBasicBlock* block = graph->GetBlocks()[id]; |
David Brazdil | a4b8c21 | 2015-05-07 09:59:30 +0100 | [diff] [blame] | 549 | // Reset loop information of non-header blocks inside the loop, except |
| 550 | // members of inner nested loops because those should already have been |
| 551 | // updated by their own LoopInformation. |
| 552 | if (block->GetLoopInformation() == this && block != header_) { |
| 553 | block->SetLoopInformation(nullptr); |
| 554 | } |
| 555 | } |
| 556 | blocks_.ClearAllBits(); |
| 557 | |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 558 | if (back_edges_.empty()) { |
David Brazdil | a4b8c21 | 2015-05-07 09:59:30 +0100 | [diff] [blame] | 559 | // The loop has been dismantled, delete its suspend check and remove info |
| 560 | // from the header. |
| 561 | DCHECK(HasSuspendCheck()); |
| 562 | header_->RemoveInstruction(suspend_check_); |
| 563 | header_->SetLoopInformation(nullptr); |
| 564 | header_ = nullptr; |
| 565 | suspend_check_ = nullptr; |
| 566 | } else { |
| 567 | if (kIsDebugBuild) { |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 568 | for (HBasicBlock* back_edge : back_edges_) { |
| 569 | DCHECK(header_->Dominates(back_edge)); |
David Brazdil | a4b8c21 | 2015-05-07 09:59:30 +0100 | [diff] [blame] | 570 | } |
| 571 | } |
| 572 | // This loop still has reachable back edges. Repopulate the list of blocks. |
| 573 | bool populate_successful = Populate(); |
| 574 | DCHECK(populate_successful); |
| 575 | } |
| 576 | } |
| 577 | |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 578 | HBasicBlock* HLoopInformation::GetPreHeader() const { |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 579 | return header_->GetDominator(); |
| 580 | } |
| 581 | |
| 582 | bool HLoopInformation::Contains(const HBasicBlock& block) const { |
| 583 | return blocks_.IsBitSet(block.GetBlockId()); |
| 584 | } |
| 585 | |
| 586 | bool HLoopInformation::IsIn(const HLoopInformation& other) const { |
| 587 | return other.blocks_.IsBitSet(header_->GetBlockId()); |
| 588 | } |
| 589 | |
Aart Bik | 73f1f3b | 2015-10-28 15:28:08 -0700 | [diff] [blame] | 590 | bool HLoopInformation::IsLoopInvariant(HInstruction* instruction, bool must_dominate) const { |
| 591 | HLoopInformation* other_loop = instruction->GetBlock()->GetLoopInformation(); |
| 592 | if (other_loop != this && (other_loop == nullptr || !other_loop->IsIn(*this))) { |
| 593 | if (must_dominate) { |
| 594 | return instruction->GetBlock()->Dominates(GetHeader()); |
| 595 | } |
| 596 | return true; |
| 597 | } |
| 598 | return false; |
| 599 | } |
| 600 | |
Nicolas Geoffray | db216f4 | 2015-05-05 17:02:20 +0100 | [diff] [blame] | 601 | size_t HLoopInformation::GetLifetimeEnd() const { |
| 602 | size_t last_position = 0; |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 603 | for (HBasicBlock* back_edge : GetBackEdges()) { |
| 604 | last_position = std::max(back_edge->GetLifetimeEnd(), last_position); |
Nicolas Geoffray | db216f4 | 2015-05-05 17:02:20 +0100 | [diff] [blame] | 605 | } |
| 606 | return last_position; |
| 607 | } |
| 608 | |
Nicolas Geoffray | 622d9c3 | 2014-05-12 16:11:02 +0100 | [diff] [blame] | 609 | bool HBasicBlock::Dominates(HBasicBlock* other) const { |
| 610 | // Walk up the dominator tree from `other`, to find out if `this` |
| 611 | // is an ancestor. |
| 612 | HBasicBlock* current = other; |
| 613 | while (current != nullptr) { |
| 614 | if (current == this) { |
| 615 | return true; |
| 616 | } |
| 617 | current = current->GetDominator(); |
| 618 | } |
| 619 | return false; |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 620 | } |
| 621 | |
Nicolas Geoffray | 191c4b1 | 2014-10-07 14:14:27 +0100 | [diff] [blame] | 622 | static void UpdateInputsUsers(HInstruction* instruction) { |
| 623 | for (size_t i = 0, e = instruction->InputCount(); i < e; ++i) { |
| 624 | instruction->InputAt(i)->AddUseAt(instruction, i); |
| 625 | } |
| 626 | // Environment should be created later. |
| 627 | DCHECK(!instruction->HasEnvironment()); |
| 628 | } |
| 629 | |
Roland Levillain | ccc07a9 | 2014-09-16 14:48:16 +0100 | [diff] [blame] | 630 | void HBasicBlock::ReplaceAndRemoveInstructionWith(HInstruction* initial, |
| 631 | HInstruction* replacement) { |
| 632 | DCHECK(initial->GetBlock() == this); |
Mark Mendell | 805b3b5 | 2015-09-18 14:10:29 -0400 | [diff] [blame] | 633 | if (initial->IsControlFlow()) { |
| 634 | // We can only replace a control flow instruction with another control flow instruction. |
| 635 | DCHECK(replacement->IsControlFlow()); |
| 636 | DCHECK_EQ(replacement->GetId(), -1); |
| 637 | DCHECK_EQ(replacement->GetType(), Primitive::kPrimVoid); |
| 638 | DCHECK_EQ(initial->GetBlock(), this); |
| 639 | DCHECK_EQ(initial->GetType(), Primitive::kPrimVoid); |
| 640 | DCHECK(initial->GetUses().IsEmpty()); |
| 641 | DCHECK(initial->GetEnvUses().IsEmpty()); |
| 642 | replacement->SetBlock(this); |
| 643 | replacement->SetId(GetGraph()->GetNextInstructionId()); |
| 644 | instructions_.InsertInstructionBefore(replacement, initial); |
| 645 | UpdateInputsUsers(replacement); |
| 646 | } else { |
| 647 | InsertInstructionBefore(replacement, initial); |
| 648 | initial->ReplaceWith(replacement); |
| 649 | } |
Roland Levillain | ccc07a9 | 2014-09-16 14:48:16 +0100 | [diff] [blame] | 650 | RemoveInstruction(initial); |
| 651 | } |
| 652 | |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 653 | static void Add(HInstructionList* instruction_list, |
| 654 | HBasicBlock* block, |
| 655 | HInstruction* instruction) { |
Nicolas Geoffray | 787c307 | 2014-03-17 10:20:19 +0000 | [diff] [blame] | 656 | DCHECK(instruction->GetBlock() == nullptr); |
Nicolas Geoffray | 43c8642 | 2014-03-18 11:58:24 +0000 | [diff] [blame] | 657 | DCHECK_EQ(instruction->GetId(), -1); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 658 | instruction->SetBlock(block); |
| 659 | instruction->SetId(block->GetGraph()->GetNextInstructionId()); |
Nicolas Geoffray | 191c4b1 | 2014-10-07 14:14:27 +0100 | [diff] [blame] | 660 | UpdateInputsUsers(instruction); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 661 | instruction_list->AddInstruction(instruction); |
| 662 | } |
| 663 | |
| 664 | void HBasicBlock::AddInstruction(HInstruction* instruction) { |
| 665 | Add(&instructions_, this, instruction); |
| 666 | } |
| 667 | |
| 668 | void HBasicBlock::AddPhi(HPhi* phi) { |
| 669 | Add(&phis_, this, phi); |
| 670 | } |
| 671 | |
David Brazdil | c3d743f | 2015-04-22 13:40:50 +0100 | [diff] [blame] | 672 | void HBasicBlock::InsertInstructionBefore(HInstruction* instruction, HInstruction* cursor) { |
| 673 | DCHECK(!cursor->IsPhi()); |
| 674 | DCHECK(!instruction->IsPhi()); |
| 675 | DCHECK_EQ(instruction->GetId(), -1); |
| 676 | DCHECK_NE(cursor->GetId(), -1); |
| 677 | DCHECK_EQ(cursor->GetBlock(), this); |
| 678 | DCHECK(!instruction->IsControlFlow()); |
| 679 | instruction->SetBlock(this); |
| 680 | instruction->SetId(GetGraph()->GetNextInstructionId()); |
| 681 | UpdateInputsUsers(instruction); |
| 682 | instructions_.InsertInstructionBefore(instruction, cursor); |
| 683 | } |
| 684 | |
Guillaume "Vermeille" Sanchez | 2967ec6 | 2015-04-24 16:36:52 +0100 | [diff] [blame] | 685 | void HBasicBlock::InsertInstructionAfter(HInstruction* instruction, HInstruction* cursor) { |
| 686 | DCHECK(!cursor->IsPhi()); |
| 687 | DCHECK(!instruction->IsPhi()); |
| 688 | DCHECK_EQ(instruction->GetId(), -1); |
| 689 | DCHECK_NE(cursor->GetId(), -1); |
| 690 | DCHECK_EQ(cursor->GetBlock(), this); |
| 691 | DCHECK(!instruction->IsControlFlow()); |
| 692 | DCHECK(!cursor->IsControlFlow()); |
| 693 | instruction->SetBlock(this); |
| 694 | instruction->SetId(GetGraph()->GetNextInstructionId()); |
| 695 | UpdateInputsUsers(instruction); |
| 696 | instructions_.InsertInstructionAfter(instruction, cursor); |
| 697 | } |
| 698 | |
Nicolas Geoffray | 102cbed | 2014-10-15 18:31:05 +0100 | [diff] [blame] | 699 | void HBasicBlock::InsertPhiAfter(HPhi* phi, HPhi* cursor) { |
| 700 | DCHECK_EQ(phi->GetId(), -1); |
| 701 | DCHECK_NE(cursor->GetId(), -1); |
| 702 | DCHECK_EQ(cursor->GetBlock(), this); |
Nicolas Geoffray | 102cbed | 2014-10-15 18:31:05 +0100 | [diff] [blame] | 703 | phi->SetBlock(this); |
| 704 | phi->SetId(GetGraph()->GetNextInstructionId()); |
| 705 | UpdateInputsUsers(phi); |
David Brazdil | c3d743f | 2015-04-22 13:40:50 +0100 | [diff] [blame] | 706 | phis_.InsertInstructionAfter(phi, cursor); |
Nicolas Geoffray | 102cbed | 2014-10-15 18:31:05 +0100 | [diff] [blame] | 707 | } |
| 708 | |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 709 | static void Remove(HInstructionList* instruction_list, |
| 710 | HBasicBlock* block, |
David Brazdil | 1abb419 | 2015-02-17 18:33:36 +0000 | [diff] [blame] | 711 | HInstruction* instruction, |
| 712 | bool ensure_safety) { |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 713 | DCHECK_EQ(block, instruction->GetBlock()); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 714 | instruction->SetBlock(nullptr); |
| 715 | instruction_list->RemoveInstruction(instruction); |
David Brazdil | 1abb419 | 2015-02-17 18:33:36 +0000 | [diff] [blame] | 716 | if (ensure_safety) { |
| 717 | DCHECK(instruction->GetUses().IsEmpty()); |
| 718 | DCHECK(instruction->GetEnvUses().IsEmpty()); |
| 719 | RemoveAsUser(instruction); |
| 720 | } |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 721 | } |
| 722 | |
David Brazdil | 1abb419 | 2015-02-17 18:33:36 +0000 | [diff] [blame] | 723 | void HBasicBlock::RemoveInstruction(HInstruction* instruction, bool ensure_safety) { |
David Brazdil | c7508e9 | 2015-04-27 13:28:57 +0100 | [diff] [blame] | 724 | DCHECK(!instruction->IsPhi()); |
David Brazdil | 1abb419 | 2015-02-17 18:33:36 +0000 | [diff] [blame] | 725 | Remove(&instructions_, this, instruction, ensure_safety); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 726 | } |
| 727 | |
David Brazdil | 1abb419 | 2015-02-17 18:33:36 +0000 | [diff] [blame] | 728 | void HBasicBlock::RemovePhi(HPhi* phi, bool ensure_safety) { |
| 729 | Remove(&phis_, this, phi, ensure_safety); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 730 | } |
| 731 | |
David Brazdil | c7508e9 | 2015-04-27 13:28:57 +0100 | [diff] [blame] | 732 | void HBasicBlock::RemoveInstructionOrPhi(HInstruction* instruction, bool ensure_safety) { |
| 733 | if (instruction->IsPhi()) { |
| 734 | RemovePhi(instruction->AsPhi(), ensure_safety); |
| 735 | } else { |
| 736 | RemoveInstruction(instruction, ensure_safety); |
| 737 | } |
| 738 | } |
| 739 | |
Vladimir Marko | 71bf809 | 2015-09-15 15:33:14 +0100 | [diff] [blame] | 740 | void HEnvironment::CopyFrom(const ArenaVector<HInstruction*>& locals) { |
| 741 | for (size_t i = 0; i < locals.size(); i++) { |
| 742 | HInstruction* instruction = locals[i]; |
Nicolas Geoffray | 8c0c91a | 2015-05-07 11:46:05 +0100 | [diff] [blame] | 743 | SetRawEnvAt(i, instruction); |
| 744 | if (instruction != nullptr) { |
| 745 | instruction->AddEnvUseAt(this, i); |
| 746 | } |
| 747 | } |
| 748 | } |
| 749 | |
David Brazdil | ed59619 | 2015-01-23 10:39:45 +0000 | [diff] [blame] | 750 | void HEnvironment::CopyFrom(HEnvironment* env) { |
| 751 | for (size_t i = 0; i < env->Size(); i++) { |
| 752 | HInstruction* instruction = env->GetInstructionAt(i); |
| 753 | SetRawEnvAt(i, instruction); |
| 754 | if (instruction != nullptr) { |
| 755 | instruction->AddEnvUseAt(this, i); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 756 | } |
David Brazdil | ed59619 | 2015-01-23 10:39:45 +0000 | [diff] [blame] | 757 | } |
| 758 | } |
| 759 | |
Mingyao Yang | 206d6fd | 2015-04-13 16:46:28 -0700 | [diff] [blame] | 760 | void HEnvironment::CopyFromWithLoopPhiAdjustment(HEnvironment* env, |
| 761 | HBasicBlock* loop_header) { |
| 762 | DCHECK(loop_header->IsLoopHeader()); |
| 763 | for (size_t i = 0; i < env->Size(); i++) { |
| 764 | HInstruction* instruction = env->GetInstructionAt(i); |
| 765 | SetRawEnvAt(i, instruction); |
| 766 | if (instruction == nullptr) { |
| 767 | continue; |
| 768 | } |
| 769 | if (instruction->IsLoopHeaderPhi() && (instruction->GetBlock() == loop_header)) { |
| 770 | // At the end of the loop pre-header, the corresponding value for instruction |
| 771 | // is the first input of the phi. |
| 772 | HInstruction* initial = instruction->AsPhi()->InputAt(0); |
| 773 | DCHECK(initial->GetBlock()->Dominates(loop_header)); |
| 774 | SetRawEnvAt(i, initial); |
| 775 | initial->AddEnvUseAt(this, i); |
| 776 | } else { |
| 777 | instruction->AddEnvUseAt(this, i); |
| 778 | } |
| 779 | } |
| 780 | } |
| 781 | |
David Brazdil | 1abb419 | 2015-02-17 18:33:36 +0000 | [diff] [blame] | 782 | void HEnvironment::RemoveAsUserOfInput(size_t index) const { |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 783 | const HUserRecord<HEnvironment*>& user_record = vregs_[index]; |
David Brazdil | 1abb419 | 2015-02-17 18:33:36 +0000 | [diff] [blame] | 784 | user_record.GetInstruction()->RemoveEnvironmentUser(user_record.GetUseNode()); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 785 | } |
| 786 | |
Calin Juravle | 77520bc | 2015-01-12 18:45:46 +0000 | [diff] [blame] | 787 | HInstruction* HInstruction::GetNextDisregardingMoves() const { |
| 788 | HInstruction* next = GetNext(); |
| 789 | while (next != nullptr && next->IsParallelMove()) { |
| 790 | next = next->GetNext(); |
| 791 | } |
| 792 | return next; |
| 793 | } |
| 794 | |
| 795 | HInstruction* HInstruction::GetPreviousDisregardingMoves() const { |
| 796 | HInstruction* previous = GetPrevious(); |
| 797 | while (previous != nullptr && previous->IsParallelMove()) { |
| 798 | previous = previous->GetPrevious(); |
| 799 | } |
| 800 | return previous; |
| 801 | } |
| 802 | |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 803 | void HInstructionList::AddInstruction(HInstruction* instruction) { |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 804 | if (first_instruction_ == nullptr) { |
| 805 | DCHECK(last_instruction_ == nullptr); |
| 806 | first_instruction_ = last_instruction_ = instruction; |
| 807 | } else { |
| 808 | last_instruction_->next_ = instruction; |
| 809 | instruction->previous_ = last_instruction_; |
| 810 | last_instruction_ = instruction; |
| 811 | } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 812 | } |
| 813 | |
David Brazdil | c3d743f | 2015-04-22 13:40:50 +0100 | [diff] [blame] | 814 | void HInstructionList::InsertInstructionBefore(HInstruction* instruction, HInstruction* cursor) { |
| 815 | DCHECK(Contains(cursor)); |
| 816 | if (cursor == first_instruction_) { |
| 817 | cursor->previous_ = instruction; |
| 818 | instruction->next_ = cursor; |
| 819 | first_instruction_ = instruction; |
| 820 | } else { |
| 821 | instruction->previous_ = cursor->previous_; |
| 822 | instruction->next_ = cursor; |
| 823 | cursor->previous_ = instruction; |
| 824 | instruction->previous_->next_ = instruction; |
| 825 | } |
| 826 | } |
| 827 | |
| 828 | void HInstructionList::InsertInstructionAfter(HInstruction* instruction, HInstruction* cursor) { |
| 829 | DCHECK(Contains(cursor)); |
| 830 | if (cursor == last_instruction_) { |
| 831 | cursor->next_ = instruction; |
| 832 | instruction->previous_ = cursor; |
| 833 | last_instruction_ = instruction; |
| 834 | } else { |
| 835 | instruction->next_ = cursor->next_; |
| 836 | instruction->previous_ = cursor; |
| 837 | cursor->next_ = instruction; |
| 838 | instruction->next_->previous_ = instruction; |
| 839 | } |
| 840 | } |
| 841 | |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 842 | void HInstructionList::RemoveInstruction(HInstruction* instruction) { |
| 843 | if (instruction->previous_ != nullptr) { |
| 844 | instruction->previous_->next_ = instruction->next_; |
| 845 | } |
| 846 | if (instruction->next_ != nullptr) { |
| 847 | instruction->next_->previous_ = instruction->previous_; |
| 848 | } |
| 849 | if (instruction == first_instruction_) { |
| 850 | first_instruction_ = instruction->next_; |
| 851 | } |
| 852 | if (instruction == last_instruction_) { |
| 853 | last_instruction_ = instruction->previous_; |
| 854 | } |
| 855 | } |
| 856 | |
Roland Levillain | 6b46923 | 2014-09-25 10:10:38 +0100 | [diff] [blame] | 857 | bool HInstructionList::Contains(HInstruction* instruction) const { |
| 858 | for (HInstructionIterator it(*this); !it.Done(); it.Advance()) { |
| 859 | if (it.Current() == instruction) { |
| 860 | return true; |
| 861 | } |
| 862 | } |
| 863 | return false; |
| 864 | } |
| 865 | |
Roland Levillain | ccc07a9 | 2014-09-16 14:48:16 +0100 | [diff] [blame] | 866 | bool HInstructionList::FoundBefore(const HInstruction* instruction1, |
| 867 | const HInstruction* instruction2) const { |
| 868 | DCHECK_EQ(instruction1->GetBlock(), instruction2->GetBlock()); |
| 869 | for (HInstructionIterator it(*this); !it.Done(); it.Advance()) { |
| 870 | if (it.Current() == instruction1) { |
| 871 | return true; |
| 872 | } |
| 873 | if (it.Current() == instruction2) { |
| 874 | return false; |
| 875 | } |
| 876 | } |
| 877 | LOG(FATAL) << "Did not find an order between two instructions of the same block."; |
| 878 | return true; |
| 879 | } |
| 880 | |
Roland Levillain | 6c82d40 | 2014-10-13 16:10:27 +0100 | [diff] [blame] | 881 | bool HInstruction::StrictlyDominates(HInstruction* other_instruction) const { |
| 882 | if (other_instruction == this) { |
| 883 | // An instruction does not strictly dominate itself. |
| 884 | return false; |
| 885 | } |
Roland Levillain | ccc07a9 | 2014-09-16 14:48:16 +0100 | [diff] [blame] | 886 | HBasicBlock* block = GetBlock(); |
| 887 | HBasicBlock* other_block = other_instruction->GetBlock(); |
| 888 | if (block != other_block) { |
| 889 | return GetBlock()->Dominates(other_instruction->GetBlock()); |
| 890 | } else { |
| 891 | // If both instructions are in the same block, ensure this |
| 892 | // instruction comes before `other_instruction`. |
| 893 | if (IsPhi()) { |
| 894 | if (!other_instruction->IsPhi()) { |
| 895 | // Phis appear before non phi-instructions so this instruction |
| 896 | // dominates `other_instruction`. |
| 897 | return true; |
| 898 | } else { |
| 899 | // There is no order among phis. |
| 900 | LOG(FATAL) << "There is no dominance between phis of a same block."; |
| 901 | return false; |
| 902 | } |
| 903 | } else { |
| 904 | // `this` is not a phi. |
| 905 | if (other_instruction->IsPhi()) { |
| 906 | // Phis appear before non phi-instructions so this instruction |
| 907 | // does not dominate `other_instruction`. |
| 908 | return false; |
| 909 | } else { |
| 910 | // Check whether this instruction comes before |
| 911 | // `other_instruction` in the instruction list. |
| 912 | return block->GetInstructions().FoundBefore(this, other_instruction); |
| 913 | } |
| 914 | } |
| 915 | } |
| 916 | } |
| 917 | |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 918 | void HInstruction::ReplaceWith(HInstruction* other) { |
Nicolas Geoffray | a7062e0 | 2014-05-22 12:50:17 +0100 | [diff] [blame] | 919 | DCHECK(other != nullptr); |
David Brazdil | ed59619 | 2015-01-23 10:39:45 +0000 | [diff] [blame] | 920 | for (HUseIterator<HInstruction*> it(GetUses()); !it.Done(); it.Advance()) { |
| 921 | HUseListNode<HInstruction*>* current = it.Current(); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 922 | HInstruction* user = current->GetUser(); |
| 923 | size_t input_index = current->GetIndex(); |
| 924 | user->SetRawInputAt(input_index, other); |
| 925 | other->AddUseAt(user, input_index); |
| 926 | } |
| 927 | |
David Brazdil | ed59619 | 2015-01-23 10:39:45 +0000 | [diff] [blame] | 928 | for (HUseIterator<HEnvironment*> it(GetEnvUses()); !it.Done(); it.Advance()) { |
| 929 | HUseListNode<HEnvironment*>* current = it.Current(); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 930 | HEnvironment* user = current->GetUser(); |
| 931 | size_t input_index = current->GetIndex(); |
| 932 | user->SetRawEnvAt(input_index, other); |
| 933 | other->AddEnvUseAt(user, input_index); |
| 934 | } |
| 935 | |
David Brazdil | ed59619 | 2015-01-23 10:39:45 +0000 | [diff] [blame] | 936 | uses_.Clear(); |
| 937 | env_uses_.Clear(); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 938 | } |
| 939 | |
Nicolas Geoffray | 102cbed | 2014-10-15 18:31:05 +0100 | [diff] [blame] | 940 | void HInstruction::ReplaceInput(HInstruction* replacement, size_t index) { |
David Brazdil | 1abb419 | 2015-02-17 18:33:36 +0000 | [diff] [blame] | 941 | RemoveAsUserOfInput(index); |
Nicolas Geoffray | 102cbed | 2014-10-15 18:31:05 +0100 | [diff] [blame] | 942 | SetRawInputAt(index, replacement); |
| 943 | replacement->AddUseAt(this, index); |
| 944 | } |
| 945 | |
Nicolas Geoffray | 3946844 | 2014-09-02 15:17:15 +0100 | [diff] [blame] | 946 | size_t HInstruction::EnvironmentSize() const { |
| 947 | return HasEnvironment() ? environment_->Size() : 0; |
| 948 | } |
| 949 | |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 950 | void HPhi::AddInput(HInstruction* input) { |
| 951 | DCHECK(input->GetBlock() != nullptr); |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 952 | inputs_.push_back(HUserRecord<HInstruction*>(input)); |
| 953 | input->AddUseAt(this, inputs_.size() - 1); |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 954 | } |
| 955 | |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 956 | void HPhi::RemoveInputAt(size_t index) { |
| 957 | RemoveAsUserOfInput(index); |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 958 | inputs_.erase(inputs_.begin() + index); |
Nicolas Geoffray | 5d7b7f8 | 2015-04-28 00:52:43 +0100 | [diff] [blame] | 959 | for (size_t i = index, e = InputCount(); i < e; ++i) { |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 960 | DCHECK_EQ(InputRecordAt(i).GetUseNode()->GetIndex(), i + 1u); |
Nicolas Geoffray | 5d7b7f8 | 2015-04-28 00:52:43 +0100 | [diff] [blame] | 961 | InputRecordAt(i).GetUseNode()->SetIndex(i); |
| 962 | } |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 963 | } |
| 964 | |
Nicolas Geoffray | 360231a | 2014-10-08 21:07:48 +0100 | [diff] [blame] | 965 | #define DEFINE_ACCEPT(name, super) \ |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 966 | void H##name::Accept(HGraphVisitor* visitor) { \ |
| 967 | visitor->Visit##name(this); \ |
| 968 | } |
| 969 | |
| 970 | FOR_EACH_INSTRUCTION(DEFINE_ACCEPT) |
| 971 | |
| 972 | #undef DEFINE_ACCEPT |
| 973 | |
| 974 | void HGraphVisitor::VisitInsertionOrder() { |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 975 | const ArenaVector<HBasicBlock*>& blocks = graph_->GetBlocks(); |
| 976 | for (HBasicBlock* block : blocks) { |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 977 | if (block != nullptr) { |
| 978 | VisitBasicBlock(block); |
| 979 | } |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 980 | } |
| 981 | } |
| 982 | |
Roland Levillain | 633021e | 2014-10-01 14:12:25 +0100 | [diff] [blame] | 983 | void HGraphVisitor::VisitReversePostOrder() { |
| 984 | for (HReversePostOrderIterator it(*graph_); !it.Done(); it.Advance()) { |
| 985 | VisitBasicBlock(it.Current()); |
| 986 | } |
| 987 | } |
| 988 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 989 | void HGraphVisitor::VisitBasicBlock(HBasicBlock* block) { |
Nicolas Geoffray | f635e63 | 2014-05-14 09:43:38 +0100 | [diff] [blame] | 990 | for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.Advance()) { |
Nicolas Geoffray | c32e770 | 2014-04-24 12:43:16 +0100 | [diff] [blame] | 991 | it.Current()->Accept(this); |
| 992 | } |
Nicolas Geoffray | f635e63 | 2014-05-14 09:43:38 +0100 | [diff] [blame] | 993 | for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.Advance()) { |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 994 | it.Current()->Accept(this); |
| 995 | } |
| 996 | } |
| 997 | |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 998 | HConstant* HTypeConversion::TryStaticEvaluation() const { |
| 999 | HGraph* graph = GetBlock()->GetGraph(); |
| 1000 | if (GetInput()->IsIntConstant()) { |
| 1001 | int32_t value = GetInput()->AsIntConstant()->GetValue(); |
| 1002 | switch (GetResultType()) { |
| 1003 | case Primitive::kPrimLong: |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1004 | return graph->GetLongConstant(static_cast<int64_t>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1005 | case Primitive::kPrimFloat: |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1006 | return graph->GetFloatConstant(static_cast<float>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1007 | case Primitive::kPrimDouble: |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1008 | return graph->GetDoubleConstant(static_cast<double>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1009 | default: |
| 1010 | return nullptr; |
| 1011 | } |
| 1012 | } else if (GetInput()->IsLongConstant()) { |
| 1013 | int64_t value = GetInput()->AsLongConstant()->GetValue(); |
| 1014 | switch (GetResultType()) { |
| 1015 | case Primitive::kPrimInt: |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1016 | return graph->GetIntConstant(static_cast<int32_t>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1017 | case Primitive::kPrimFloat: |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1018 | return graph->GetFloatConstant(static_cast<float>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1019 | case Primitive::kPrimDouble: |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1020 | return graph->GetDoubleConstant(static_cast<double>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1021 | default: |
| 1022 | return nullptr; |
| 1023 | } |
| 1024 | } else if (GetInput()->IsFloatConstant()) { |
| 1025 | float value = GetInput()->AsFloatConstant()->GetValue(); |
| 1026 | switch (GetResultType()) { |
| 1027 | case Primitive::kPrimInt: |
| 1028 | if (std::isnan(value)) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1029 | return graph->GetIntConstant(0, GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1030 | if (value >= kPrimIntMax) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1031 | return graph->GetIntConstant(kPrimIntMax, GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1032 | if (value <= kPrimIntMin) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1033 | return graph->GetIntConstant(kPrimIntMin, GetDexPc()); |
| 1034 | return graph->GetIntConstant(static_cast<int32_t>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1035 | case Primitive::kPrimLong: |
| 1036 | if (std::isnan(value)) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1037 | return graph->GetLongConstant(0, GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1038 | if (value >= kPrimLongMax) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1039 | return graph->GetLongConstant(kPrimLongMax, GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1040 | if (value <= kPrimLongMin) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1041 | return graph->GetLongConstant(kPrimLongMin, GetDexPc()); |
| 1042 | return graph->GetLongConstant(static_cast<int64_t>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1043 | case Primitive::kPrimDouble: |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1044 | return graph->GetDoubleConstant(static_cast<double>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1045 | default: |
| 1046 | return nullptr; |
| 1047 | } |
| 1048 | } else if (GetInput()->IsDoubleConstant()) { |
| 1049 | double value = GetInput()->AsDoubleConstant()->GetValue(); |
| 1050 | switch (GetResultType()) { |
| 1051 | case Primitive::kPrimInt: |
| 1052 | if (std::isnan(value)) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1053 | return graph->GetIntConstant(0, GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1054 | if (value >= kPrimIntMax) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1055 | return graph->GetIntConstant(kPrimIntMax, GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1056 | if (value <= kPrimLongMin) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1057 | return graph->GetIntConstant(kPrimIntMin, GetDexPc()); |
| 1058 | return graph->GetIntConstant(static_cast<int32_t>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1059 | case Primitive::kPrimLong: |
| 1060 | if (std::isnan(value)) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1061 | return graph->GetLongConstant(0, GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1062 | if (value >= kPrimLongMax) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1063 | return graph->GetLongConstant(kPrimLongMax, GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1064 | if (value <= kPrimLongMin) |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1065 | return graph->GetLongConstant(kPrimLongMin, GetDexPc()); |
| 1066 | return graph->GetLongConstant(static_cast<int64_t>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1067 | case Primitive::kPrimFloat: |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1068 | return graph->GetFloatConstant(static_cast<float>(value), GetDexPc()); |
Mark Mendell | e82549b | 2015-05-06 10:55:34 -0400 | [diff] [blame] | 1069 | default: |
| 1070 | return nullptr; |
| 1071 | } |
| 1072 | } |
| 1073 | return nullptr; |
| 1074 | } |
| 1075 | |
Roland Levillain | 9240d6a | 2014-10-20 16:47:04 +0100 | [diff] [blame] | 1076 | HConstant* HUnaryOperation::TryStaticEvaluation() const { |
| 1077 | if (GetInput()->IsIntConstant()) { |
Roland Levillain | 9867bc7 | 2015-08-05 10:21:34 +0100 | [diff] [blame] | 1078 | return Evaluate(GetInput()->AsIntConstant()); |
Roland Levillain | 9240d6a | 2014-10-20 16:47:04 +0100 | [diff] [blame] | 1079 | } else if (GetInput()->IsLongConstant()) { |
Roland Levillain | 9867bc7 | 2015-08-05 10:21:34 +0100 | [diff] [blame] | 1080 | return Evaluate(GetInput()->AsLongConstant()); |
Roland Levillain | 9240d6a | 2014-10-20 16:47:04 +0100 | [diff] [blame] | 1081 | } |
| 1082 | return nullptr; |
| 1083 | } |
| 1084 | |
| 1085 | HConstant* HBinaryOperation::TryStaticEvaluation() const { |
Roland Levillain | 9867bc7 | 2015-08-05 10:21:34 +0100 | [diff] [blame] | 1086 | if (GetLeft()->IsIntConstant()) { |
| 1087 | if (GetRight()->IsIntConstant()) { |
| 1088 | return Evaluate(GetLeft()->AsIntConstant(), GetRight()->AsIntConstant()); |
| 1089 | } else if (GetRight()->IsLongConstant()) { |
| 1090 | return Evaluate(GetLeft()->AsIntConstant(), GetRight()->AsLongConstant()); |
| 1091 | } |
| 1092 | } else if (GetLeft()->IsLongConstant()) { |
| 1093 | if (GetRight()->IsIntConstant()) { |
| 1094 | return Evaluate(GetLeft()->AsLongConstant(), GetRight()->AsIntConstant()); |
| 1095 | } else if (GetRight()->IsLongConstant()) { |
| 1096 | return Evaluate(GetLeft()->AsLongConstant(), GetRight()->AsLongConstant()); |
Nicolas Geoffray | 9ee6618 | 2015-01-16 12:35:40 +0000 | [diff] [blame] | 1097 | } |
Vladimir Marko | 9e23df5 | 2015-11-10 17:14:35 +0000 | [diff] [blame] | 1098 | } else if (GetLeft()->IsNullConstant() && GetRight()->IsNullConstant()) { |
| 1099 | return Evaluate(GetLeft()->AsNullConstant(), GetRight()->AsNullConstant()); |
Roland Levillain | 556c3d1 | 2014-09-18 15:25:07 +0100 | [diff] [blame] | 1100 | } |
| 1101 | return nullptr; |
| 1102 | } |
Dave Allison | 20dfc79 | 2014-06-16 20:44:29 -0700 | [diff] [blame] | 1103 | |
Alexandre Rames | b2fd7bc | 2015-03-11 16:48:16 +0000 | [diff] [blame] | 1104 | HConstant* HBinaryOperation::GetConstantRight() const { |
| 1105 | if (GetRight()->IsConstant()) { |
| 1106 | return GetRight()->AsConstant(); |
| 1107 | } else if (IsCommutative() && GetLeft()->IsConstant()) { |
| 1108 | return GetLeft()->AsConstant(); |
| 1109 | } else { |
| 1110 | return nullptr; |
| 1111 | } |
| 1112 | } |
| 1113 | |
| 1114 | // If `GetConstantRight()` returns one of the input, this returns the other |
Mathieu Chartier | 2cebb24 | 2015-04-21 16:50:40 -0700 | [diff] [blame] | 1115 | // one. Otherwise it returns null. |
Alexandre Rames | b2fd7bc | 2015-03-11 16:48:16 +0000 | [diff] [blame] | 1116 | HInstruction* HBinaryOperation::GetLeastConstantLeft() const { |
| 1117 | HInstruction* most_constant_right = GetConstantRight(); |
| 1118 | if (most_constant_right == nullptr) { |
| 1119 | return nullptr; |
| 1120 | } else if (most_constant_right == GetLeft()) { |
| 1121 | return GetRight(); |
| 1122 | } else { |
| 1123 | return GetLeft(); |
| 1124 | } |
| 1125 | } |
| 1126 | |
Mingyao Yang | d43b3ac | 2015-04-01 14:03:04 -0700 | [diff] [blame] | 1127 | bool HCondition::IsBeforeWhenDisregardMoves(HInstruction* instruction) const { |
| 1128 | return this == instruction->GetPreviousDisregardingMoves(); |
Nicolas Geoffray | 18efde5 | 2014-09-22 15:51:11 +0100 | [diff] [blame] | 1129 | } |
| 1130 | |
Nicolas Geoffray | 065bf77 | 2014-09-03 14:51:22 +0100 | [diff] [blame] | 1131 | bool HInstruction::Equals(HInstruction* other) const { |
| 1132 | if (!InstructionTypeEquals(other)) return false; |
Nicolas Geoffray | d31cf3d | 2014-09-08 17:30:24 +0100 | [diff] [blame] | 1133 | DCHECK_EQ(GetKind(), other->GetKind()); |
Nicolas Geoffray | 065bf77 | 2014-09-03 14:51:22 +0100 | [diff] [blame] | 1134 | if (!InstructionDataEquals(other)) return false; |
| 1135 | if (GetType() != other->GetType()) return false; |
| 1136 | if (InputCount() != other->InputCount()) return false; |
| 1137 | |
| 1138 | for (size_t i = 0, e = InputCount(); i < e; ++i) { |
| 1139 | if (InputAt(i) != other->InputAt(i)) return false; |
| 1140 | } |
Nicolas Geoffray | d31cf3d | 2014-09-08 17:30:24 +0100 | [diff] [blame] | 1141 | DCHECK_EQ(ComputeHashCode(), other->ComputeHashCode()); |
Nicolas Geoffray | 065bf77 | 2014-09-03 14:51:22 +0100 | [diff] [blame] | 1142 | return true; |
| 1143 | } |
| 1144 | |
Ian Rogers | 6a3c1fc | 2014-10-31 00:33:20 -0700 | [diff] [blame] | 1145 | std::ostream& operator<<(std::ostream& os, const HInstruction::InstructionKind& rhs) { |
| 1146 | #define DECLARE_CASE(type, super) case HInstruction::k##type: os << #type; break; |
| 1147 | switch (rhs) { |
| 1148 | FOR_EACH_INSTRUCTION(DECLARE_CASE) |
| 1149 | default: |
| 1150 | os << "Unknown instruction kind " << static_cast<int>(rhs); |
| 1151 | break; |
| 1152 | } |
| 1153 | #undef DECLARE_CASE |
| 1154 | return os; |
| 1155 | } |
| 1156 | |
Nicolas Geoffray | 82091da | 2015-01-26 10:02:45 +0000 | [diff] [blame] | 1157 | void HInstruction::MoveBefore(HInstruction* cursor) { |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 1158 | next_->previous_ = previous_; |
| 1159 | if (previous_ != nullptr) { |
| 1160 | previous_->next_ = next_; |
| 1161 | } |
| 1162 | if (block_->instructions_.first_instruction_ == this) { |
| 1163 | block_->instructions_.first_instruction_ = next_; |
| 1164 | } |
Nicolas Geoffray | 82091da | 2015-01-26 10:02:45 +0000 | [diff] [blame] | 1165 | DCHECK_NE(block_->instructions_.last_instruction_, this); |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 1166 | |
| 1167 | previous_ = cursor->previous_; |
| 1168 | if (previous_ != nullptr) { |
| 1169 | previous_->next_ = this; |
| 1170 | } |
| 1171 | next_ = cursor; |
| 1172 | cursor->previous_ = this; |
| 1173 | block_ = cursor->block_; |
Nicolas Geoffray | 82091da | 2015-01-26 10:02:45 +0000 | [diff] [blame] | 1174 | |
| 1175 | if (block_->instructions_.first_instruction_ == cursor) { |
| 1176 | block_->instructions_.first_instruction_ = this; |
| 1177 | } |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 1178 | } |
| 1179 | |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 1180 | HBasicBlock* HBasicBlock::SplitBefore(HInstruction* cursor) { |
David Brazdil | 9bc4361 | 2015-11-05 21:25:24 +0000 | [diff] [blame] | 1181 | DCHECK(!graph_->IsInSsaForm()) << "Support for SSA form not implemented."; |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 1182 | DCHECK_EQ(cursor->GetBlock(), this); |
| 1183 | |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1184 | HBasicBlock* new_block = new (GetGraph()->GetArena()) HBasicBlock(GetGraph(), |
| 1185 | cursor->GetDexPc()); |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 1186 | new_block->instructions_.first_instruction_ = cursor; |
| 1187 | new_block->instructions_.last_instruction_ = instructions_.last_instruction_; |
| 1188 | instructions_.last_instruction_ = cursor->previous_; |
| 1189 | if (cursor->previous_ == nullptr) { |
| 1190 | instructions_.first_instruction_ = nullptr; |
| 1191 | } else { |
| 1192 | cursor->previous_->next_ = nullptr; |
| 1193 | cursor->previous_ = nullptr; |
| 1194 | } |
| 1195 | |
| 1196 | new_block->instructions_.SetBlockOfInstructions(new_block); |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1197 | AddInstruction(new (GetGraph()->GetArena()) HGoto(new_block->GetDexPc())); |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 1198 | |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1199 | for (HBasicBlock* successor : GetSuccessors()) { |
| 1200 | new_block->successors_.push_back(successor); |
| 1201 | successor->predecessors_[successor->GetPredecessorIndexOf(this)] = new_block; |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 1202 | } |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1203 | successors_.clear(); |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 1204 | AddSuccessor(new_block); |
| 1205 | |
David Brazdil | 56e1acc | 2015-06-30 15:41:36 +0100 | [diff] [blame] | 1206 | GetGraph()->AddBlock(new_block); |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 1207 | return new_block; |
| 1208 | } |
| 1209 | |
David Brazdil | d7558da | 2015-09-22 13:04:14 +0100 | [diff] [blame] | 1210 | HBasicBlock* HBasicBlock::CreateImmediateDominator() { |
David Brazdil | 9bc4361 | 2015-11-05 21:25:24 +0000 | [diff] [blame] | 1211 | DCHECK(!graph_->IsInSsaForm()) << "Support for SSA form not implemented."; |
David Brazdil | d7558da | 2015-09-22 13:04:14 +0100 | [diff] [blame] | 1212 | DCHECK(!IsCatchBlock()) << "Support for updating try/catch information not implemented."; |
| 1213 | |
| 1214 | HBasicBlock* new_block = new (GetGraph()->GetArena()) HBasicBlock(GetGraph(), GetDexPc()); |
| 1215 | |
| 1216 | for (HBasicBlock* predecessor : GetPredecessors()) { |
| 1217 | new_block->predecessors_.push_back(predecessor); |
| 1218 | predecessor->successors_[predecessor->GetSuccessorIndexOf(this)] = new_block; |
| 1219 | } |
| 1220 | predecessors_.clear(); |
| 1221 | AddPredecessor(new_block); |
| 1222 | |
| 1223 | GetGraph()->AddBlock(new_block); |
| 1224 | return new_block; |
| 1225 | } |
| 1226 | |
David Brazdil | 9bc4361 | 2015-11-05 21:25:24 +0000 | [diff] [blame] | 1227 | HBasicBlock* HBasicBlock::SplitCatchBlockAfterMoveException() { |
| 1228 | DCHECK(!graph_->IsInSsaForm()) << "Support for SSA form not implemented."; |
| 1229 | DCHECK(IsCatchBlock()) << "This method is intended for catch blocks only."; |
| 1230 | |
| 1231 | HInstruction* first_insn = GetFirstInstruction(); |
| 1232 | HInstruction* split_before = nullptr; |
| 1233 | |
| 1234 | if (first_insn != nullptr && first_insn->IsLoadException()) { |
| 1235 | // Catch block starts with a LoadException. Split the block after |
| 1236 | // the StoreLocal and ClearException which must come after the load. |
| 1237 | DCHECK(first_insn->GetNext()->IsStoreLocal()); |
| 1238 | DCHECK(first_insn->GetNext()->GetNext()->IsClearException()); |
| 1239 | split_before = first_insn->GetNext()->GetNext()->GetNext(); |
| 1240 | } else { |
| 1241 | // Catch block does not load the exception. Split at the beginning |
| 1242 | // to create an empty catch block. |
| 1243 | split_before = first_insn; |
| 1244 | } |
| 1245 | |
| 1246 | if (split_before == nullptr) { |
| 1247 | // Catch block has no instructions after the split point (must be dead). |
| 1248 | // Do not split it but rather signal error by returning nullptr. |
| 1249 | return nullptr; |
| 1250 | } else { |
| 1251 | return SplitBefore(split_before); |
| 1252 | } |
| 1253 | } |
| 1254 | |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1255 | HBasicBlock* HBasicBlock::SplitAfter(HInstruction* cursor) { |
| 1256 | DCHECK(!cursor->IsControlFlow()); |
| 1257 | DCHECK_NE(instructions_.last_instruction_, cursor); |
| 1258 | DCHECK_EQ(cursor->GetBlock(), this); |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 1259 | |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1260 | HBasicBlock* new_block = new (GetGraph()->GetArena()) HBasicBlock(GetGraph(), GetDexPc()); |
| 1261 | new_block->instructions_.first_instruction_ = cursor->GetNext(); |
| 1262 | new_block->instructions_.last_instruction_ = instructions_.last_instruction_; |
| 1263 | cursor->next_->previous_ = nullptr; |
| 1264 | cursor->next_ = nullptr; |
| 1265 | instructions_.last_instruction_ = cursor; |
| 1266 | |
| 1267 | new_block->instructions_.SetBlockOfInstructions(new_block); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1268 | for (HBasicBlock* successor : GetSuccessors()) { |
| 1269 | new_block->successors_.push_back(successor); |
| 1270 | successor->predecessors_[successor->GetPredecessorIndexOf(this)] = new_block; |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1271 | } |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1272 | successors_.clear(); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1273 | |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1274 | for (HBasicBlock* dominated : GetDominatedBlocks()) { |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1275 | dominated->dominator_ = new_block; |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1276 | new_block->dominated_blocks_.push_back(dominated); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1277 | } |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1278 | dominated_blocks_.clear(); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1279 | return new_block; |
| 1280 | } |
| 1281 | |
David Brazdil | ec16f79 | 2015-08-19 15:04:01 +0100 | [diff] [blame] | 1282 | const HTryBoundary* HBasicBlock::ComputeTryEntryOfSuccessors() const { |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 1283 | if (EndsWithTryBoundary()) { |
| 1284 | HTryBoundary* try_boundary = GetLastInstruction()->AsTryBoundary(); |
| 1285 | if (try_boundary->IsEntry()) { |
David Brazdil | ec16f79 | 2015-08-19 15:04:01 +0100 | [diff] [blame] | 1286 | DCHECK(!IsTryBlock()); |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 1287 | return try_boundary; |
| 1288 | } else { |
David Brazdil | ec16f79 | 2015-08-19 15:04:01 +0100 | [diff] [blame] | 1289 | DCHECK(IsTryBlock()); |
| 1290 | DCHECK(try_catch_information_->GetTryEntry().HasSameExceptionHandlersAs(*try_boundary)); |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 1291 | return nullptr; |
| 1292 | } |
David Brazdil | ec16f79 | 2015-08-19 15:04:01 +0100 | [diff] [blame] | 1293 | } else if (IsTryBlock()) { |
| 1294 | return &try_catch_information_->GetTryEntry(); |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 1295 | } else { |
David Brazdil | ec16f79 | 2015-08-19 15:04:01 +0100 | [diff] [blame] | 1296 | return nullptr; |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 1297 | } |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 1298 | } |
| 1299 | |
David Brazdil | d7558da | 2015-09-22 13:04:14 +0100 | [diff] [blame] | 1300 | bool HBasicBlock::HasThrowingInstructions() const { |
| 1301 | for (HInstructionIterator it(GetInstructions()); !it.Done(); it.Advance()) { |
| 1302 | if (it.Current()->CanThrow()) { |
| 1303 | return true; |
| 1304 | } |
| 1305 | } |
| 1306 | return false; |
| 1307 | } |
| 1308 | |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 1309 | static bool HasOnlyOneInstruction(const HBasicBlock& block) { |
| 1310 | return block.GetPhis().IsEmpty() |
| 1311 | && !block.GetInstructions().IsEmpty() |
| 1312 | && block.GetFirstInstruction() == block.GetLastInstruction(); |
| 1313 | } |
| 1314 | |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 1315 | bool HBasicBlock::IsSingleGoto() const { |
David Brazdil | fc6a86a | 2015-06-26 10:33:45 +0000 | [diff] [blame] | 1316 | return HasOnlyOneInstruction(*this) && GetLastInstruction()->IsGoto(); |
| 1317 | } |
| 1318 | |
| 1319 | bool HBasicBlock::IsSingleTryBoundary() const { |
| 1320 | return HasOnlyOneInstruction(*this) && GetLastInstruction()->IsTryBoundary(); |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 1321 | } |
| 1322 | |
David Brazdil | 8d5b8b2 | 2015-03-24 10:51:52 +0000 | [diff] [blame] | 1323 | bool HBasicBlock::EndsWithControlFlowInstruction() const { |
| 1324 | return !GetInstructions().IsEmpty() && GetLastInstruction()->IsControlFlow(); |
| 1325 | } |
| 1326 | |
David Brazdil | b2bd1c5 | 2015-03-25 11:17:37 +0000 | [diff] [blame] | 1327 | bool HBasicBlock::EndsWithIf() const { |
| 1328 | return !GetInstructions().IsEmpty() && GetLastInstruction()->IsIf(); |
| 1329 | } |
| 1330 | |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 1331 | bool HBasicBlock::EndsWithTryBoundary() const { |
| 1332 | return !GetInstructions().IsEmpty() && GetLastInstruction()->IsTryBoundary(); |
| 1333 | } |
| 1334 | |
David Brazdil | b2bd1c5 | 2015-03-25 11:17:37 +0000 | [diff] [blame] | 1335 | bool HBasicBlock::HasSinglePhi() const { |
| 1336 | return !GetPhis().IsEmpty() && GetFirstPhi()->GetNext() == nullptr; |
| 1337 | } |
| 1338 | |
David Brazdil | d26a411 | 2015-11-10 11:07:31 +0000 | [diff] [blame] | 1339 | ArrayRef<HBasicBlock* const> HBasicBlock::GetNormalSuccessors() const { |
| 1340 | if (EndsWithTryBoundary()) { |
| 1341 | // The normal-flow successor of HTryBoundary is always stored at index zero. |
| 1342 | DCHECK_EQ(successors_[0], GetLastInstruction()->AsTryBoundary()->GetNormalFlowSuccessor()); |
| 1343 | return ArrayRef<HBasicBlock* const>(successors_).SubArray(0u, 1u); |
| 1344 | } else { |
| 1345 | // All successors of blocks not ending with TryBoundary are normal. |
| 1346 | return ArrayRef<HBasicBlock* const>(successors_); |
| 1347 | } |
| 1348 | } |
| 1349 | |
| 1350 | ArrayRef<HBasicBlock* const> HBasicBlock::GetExceptionalSuccessors() const { |
| 1351 | if (EndsWithTryBoundary()) { |
| 1352 | return GetLastInstruction()->AsTryBoundary()->GetExceptionHandlers(); |
| 1353 | } else { |
| 1354 | // Blocks not ending with TryBoundary do not have exceptional successors. |
| 1355 | return ArrayRef<HBasicBlock* const>(); |
| 1356 | } |
| 1357 | } |
| 1358 | |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 1359 | bool HTryBoundary::HasSameExceptionHandlersAs(const HTryBoundary& other) const { |
David Brazdil | d26a411 | 2015-11-10 11:07:31 +0000 | [diff] [blame] | 1360 | ArrayRef<HBasicBlock* const> handlers1 = GetExceptionHandlers(); |
| 1361 | ArrayRef<HBasicBlock* const> handlers2 = other.GetExceptionHandlers(); |
| 1362 | |
| 1363 | size_t length = handlers1.size(); |
| 1364 | if (length != handlers2.size()) { |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 1365 | return false; |
| 1366 | } |
| 1367 | |
David Brazdil | b618ade | 2015-07-29 10:31:29 +0100 | [diff] [blame] | 1368 | // Exception handlers need to be stored in the same order. |
David Brazdil | d26a411 | 2015-11-10 11:07:31 +0000 | [diff] [blame] | 1369 | for (size_t i = 0; i < length; ++i) { |
| 1370 | if (handlers1[i] != handlers2[i]) { |
David Brazdil | ffee3d3 | 2015-07-06 11:48:53 +0100 | [diff] [blame] | 1371 | return false; |
| 1372 | } |
| 1373 | } |
| 1374 | return true; |
| 1375 | } |
| 1376 | |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1377 | size_t HInstructionList::CountSize() const { |
| 1378 | size_t size = 0; |
| 1379 | HInstruction* current = first_instruction_; |
| 1380 | for (; current != nullptr; current = current->GetNext()) { |
| 1381 | size++; |
| 1382 | } |
| 1383 | return size; |
| 1384 | } |
| 1385 | |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1386 | void HInstructionList::SetBlockOfInstructions(HBasicBlock* block) const { |
| 1387 | for (HInstruction* current = first_instruction_; |
| 1388 | current != nullptr; |
| 1389 | current = current->GetNext()) { |
| 1390 | current->SetBlock(block); |
| 1391 | } |
| 1392 | } |
| 1393 | |
| 1394 | void HInstructionList::AddAfter(HInstruction* cursor, const HInstructionList& instruction_list) { |
| 1395 | DCHECK(Contains(cursor)); |
| 1396 | if (!instruction_list.IsEmpty()) { |
| 1397 | if (cursor == last_instruction_) { |
| 1398 | last_instruction_ = instruction_list.last_instruction_; |
| 1399 | } else { |
| 1400 | cursor->next_->previous_ = instruction_list.last_instruction_; |
| 1401 | } |
| 1402 | instruction_list.last_instruction_->next_ = cursor->next_; |
| 1403 | cursor->next_ = instruction_list.first_instruction_; |
| 1404 | instruction_list.first_instruction_->previous_ = cursor; |
| 1405 | } |
| 1406 | } |
| 1407 | |
| 1408 | void HInstructionList::Add(const HInstructionList& instruction_list) { |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 1409 | if (IsEmpty()) { |
| 1410 | first_instruction_ = instruction_list.first_instruction_; |
| 1411 | last_instruction_ = instruction_list.last_instruction_; |
| 1412 | } else { |
| 1413 | AddAfter(last_instruction_, instruction_list); |
| 1414 | } |
| 1415 | } |
| 1416 | |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1417 | void HBasicBlock::DisconnectAndDelete() { |
| 1418 | // Dominators must be removed after all the blocks they dominate. This way |
| 1419 | // a loop header is removed last, a requirement for correct loop information |
| 1420 | // iteration. |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1421 | DCHECK(dominated_blocks_.empty()); |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 1422 | |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1423 | // (1) Remove the block from all loops it is included in. |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1424 | for (HLoopInformationOutwardIterator it(*this); !it.Done(); it.Advance()) { |
| 1425 | HLoopInformation* loop_info = it.Current(); |
| 1426 | loop_info->Remove(this); |
| 1427 | if (loop_info->IsBackEdge(*this)) { |
Nicolas Geoffray | db216f4 | 2015-05-05 17:02:20 +0100 | [diff] [blame] | 1428 | // If this was the last back edge of the loop, we deliberately leave the |
| 1429 | // loop in an inconsistent state and will fail SSAChecker unless the |
| 1430 | // entire loop is removed during the pass. |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1431 | loop_info->RemoveBackEdge(this); |
| 1432 | } |
| 1433 | } |
| 1434 | |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1435 | // (2) Disconnect the block from its predecessors and update their |
| 1436 | // control-flow instructions. |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1437 | for (HBasicBlock* predecessor : predecessors_) { |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1438 | HInstruction* last_instruction = predecessor->GetLastInstruction(); |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1439 | if (last_instruction->IsTryBoundary() && !IsCatchBlock()) { |
| 1440 | // This block is the only normal-flow successor of the TryBoundary which |
| 1441 | // makes `predecessor` dead. Since DCE removes blocks in post order, |
| 1442 | // exception handlers of this TryBoundary were already visited and any |
| 1443 | // remaining handlers therefore must be live. We remove `predecessor` from |
| 1444 | // their list of predecessors. |
| 1445 | DCHECK_EQ(last_instruction->AsTryBoundary()->GetNormalFlowSuccessor(), this); |
| 1446 | while (predecessor->GetSuccessors().size() > 1) { |
| 1447 | HBasicBlock* handler = predecessor->GetSuccessors()[1]; |
| 1448 | DCHECK(handler->IsCatchBlock()); |
| 1449 | predecessor->RemoveSuccessor(handler); |
| 1450 | handler->RemovePredecessor(predecessor); |
| 1451 | } |
| 1452 | } |
| 1453 | |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1454 | predecessor->RemoveSuccessor(this); |
Mark Mendell | fe57faa | 2015-09-18 09:26:15 -0400 | [diff] [blame] | 1455 | uint32_t num_pred_successors = predecessor->GetSuccessors().size(); |
| 1456 | if (num_pred_successors == 1u) { |
| 1457 | // If we have one successor after removing one, then we must have |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1458 | // had an HIf, HPackedSwitch or HTryBoundary, as they have more than one |
| 1459 | // successor. Replace those with a HGoto. |
| 1460 | DCHECK(last_instruction->IsIf() || |
| 1461 | last_instruction->IsPackedSwitch() || |
| 1462 | (last_instruction->IsTryBoundary() && IsCatchBlock())); |
Mark Mendell | fe57faa | 2015-09-18 09:26:15 -0400 | [diff] [blame] | 1463 | predecessor->RemoveInstruction(last_instruction); |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1464 | predecessor->AddInstruction(new (graph_->GetArena()) HGoto(last_instruction->GetDexPc())); |
Mark Mendell | fe57faa | 2015-09-18 09:26:15 -0400 | [diff] [blame] | 1465 | } else if (num_pred_successors == 0u) { |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1466 | // The predecessor has no remaining successors and therefore must be dead. |
| 1467 | // We deliberately leave it without a control-flow instruction so that the |
| 1468 | // SSAChecker fails unless it is not removed during the pass too. |
Mark Mendell | fe57faa | 2015-09-18 09:26:15 -0400 | [diff] [blame] | 1469 | predecessor->RemoveInstruction(last_instruction); |
| 1470 | } else { |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1471 | // There are multiple successors left. The removed block might be a successor |
| 1472 | // of a PackedSwitch which will be completely removed (perhaps replaced with |
| 1473 | // a Goto), or we are deleting a catch block from a TryBoundary. In either |
| 1474 | // case, leave `last_instruction` as is for now. |
| 1475 | DCHECK(last_instruction->IsPackedSwitch() || |
| 1476 | (last_instruction->IsTryBoundary() && IsCatchBlock())); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1477 | } |
David Brazdil | 46e2a39 | 2015-03-16 17:31:52 +0000 | [diff] [blame] | 1478 | } |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1479 | predecessors_.clear(); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1480 | |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1481 | // (3) Disconnect the block from its successors and update their phis. |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1482 | for (HBasicBlock* successor : successors_) { |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1483 | // Delete this block from the list of predecessors. |
| 1484 | size_t this_index = successor->GetPredecessorIndexOf(this); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1485 | successor->predecessors_.erase(successor->predecessors_.begin() + this_index); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1486 | |
| 1487 | // Check that `successor` has other predecessors, otherwise `this` is the |
| 1488 | // dominator of `successor` which violates the order DCHECKed at the top. |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1489 | DCHECK(!successor->predecessors_.empty()); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1490 | |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1491 | // Remove this block's entries in the successor's phis. Skip exceptional |
| 1492 | // successors because catch phi inputs do not correspond to predecessor |
| 1493 | // blocks but throwing instructions. Their inputs will be updated in step (4). |
| 1494 | if (!successor->IsCatchBlock()) { |
| 1495 | if (successor->predecessors_.size() == 1u) { |
| 1496 | // The successor has just one predecessor left. Replace phis with the only |
| 1497 | // remaining input. |
| 1498 | for (HInstructionIterator phi_it(successor->GetPhis()); !phi_it.Done(); phi_it.Advance()) { |
| 1499 | HPhi* phi = phi_it.Current()->AsPhi(); |
| 1500 | phi->ReplaceWith(phi->InputAt(1 - this_index)); |
| 1501 | successor->RemovePhi(phi); |
| 1502 | } |
| 1503 | } else { |
| 1504 | for (HInstructionIterator phi_it(successor->GetPhis()); !phi_it.Done(); phi_it.Advance()) { |
| 1505 | phi_it.Current()->AsPhi()->RemoveInputAt(this_index); |
| 1506 | } |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1507 | } |
| 1508 | } |
| 1509 | } |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1510 | successors_.clear(); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1511 | |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1512 | // (4) Remove instructions and phis. Instructions should have no remaining uses |
| 1513 | // except in catch phis. If an instruction is used by a catch phi at `index`, |
| 1514 | // remove `index`-th input of all phis in the catch block since they are |
| 1515 | // guaranteed dead. Note that we may miss dead inputs this way but the |
| 1516 | // graph will always remain consistent. |
| 1517 | for (HBackwardInstructionIterator it(GetInstructions()); !it.Done(); it.Advance()) { |
| 1518 | HInstruction* insn = it.Current(); |
| 1519 | while (insn->HasUses()) { |
| 1520 | DCHECK(IsTryBlock()); |
| 1521 | HUseListNode<HInstruction*>* use = insn->GetUses().GetFirst(); |
| 1522 | size_t use_index = use->GetIndex(); |
| 1523 | HBasicBlock* user_block = use->GetUser()->GetBlock(); |
| 1524 | DCHECK(use->GetUser()->IsPhi() && user_block->IsCatchBlock()); |
| 1525 | for (HInstructionIterator phi_it(user_block->GetPhis()); !phi_it.Done(); phi_it.Advance()) { |
| 1526 | phi_it.Current()->AsPhi()->RemoveInputAt(use_index); |
| 1527 | } |
| 1528 | } |
| 1529 | |
| 1530 | RemoveInstruction(insn); |
| 1531 | } |
| 1532 | for (HInstructionIterator it(GetPhis()); !it.Done(); it.Advance()) { |
| 1533 | RemovePhi(it.Current()->AsPhi()); |
| 1534 | } |
| 1535 | |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1536 | // Disconnect from the dominator. |
| 1537 | dominator_->RemoveDominatedBlock(this); |
| 1538 | SetDominator(nullptr); |
| 1539 | |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1540 | // Delete from the graph, update reverse post order. |
| 1541 | graph_->DeleteDeadEmptyBlock(this); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1542 | SetGraph(nullptr); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1543 | } |
| 1544 | |
| 1545 | void HBasicBlock::MergeWith(HBasicBlock* other) { |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1546 | DCHECK_EQ(GetGraph(), other->GetGraph()); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1547 | DCHECK(ContainsElement(dominated_blocks_, other)); |
| 1548 | DCHECK_EQ(GetSingleSuccessor(), other); |
| 1549 | DCHECK_EQ(other->GetSinglePredecessor(), this); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1550 | DCHECK(other->GetPhis().IsEmpty()); |
| 1551 | |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1552 | // Move instructions from `other` to `this`. |
| 1553 | DCHECK(EndsWithControlFlowInstruction()); |
| 1554 | RemoveInstruction(GetLastInstruction()); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1555 | instructions_.Add(other->GetInstructions()); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1556 | other->instructions_.SetBlockOfInstructions(this); |
| 1557 | other->instructions_.Clear(); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1558 | |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1559 | // Remove `other` from the loops it is included in. |
| 1560 | for (HLoopInformationOutwardIterator it(*other); !it.Done(); it.Advance()) { |
| 1561 | HLoopInformation* loop_info = it.Current(); |
| 1562 | loop_info->Remove(other); |
| 1563 | if (loop_info->IsBackEdge(*other)) { |
Nicolas Geoffray | db216f4 | 2015-05-05 17:02:20 +0100 | [diff] [blame] | 1564 | loop_info->ReplaceBackEdge(other, this); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1565 | } |
| 1566 | } |
| 1567 | |
| 1568 | // Update links to the successors of `other`. |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1569 | successors_.clear(); |
| 1570 | while (!other->successors_.empty()) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 1571 | HBasicBlock* successor = other->GetSuccessors()[0]; |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1572 | successor->ReplacePredecessor(other, this); |
| 1573 | } |
| 1574 | |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1575 | // Update the dominator tree. |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1576 | RemoveDominatedBlock(other); |
| 1577 | for (HBasicBlock* dominated : other->GetDominatedBlocks()) { |
| 1578 | dominated_blocks_.push_back(dominated); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1579 | dominated->SetDominator(this); |
| 1580 | } |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1581 | other->dominated_blocks_.clear(); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1582 | other->dominator_ = nullptr; |
| 1583 | |
| 1584 | // Clear the list of predecessors of `other` in preparation of deleting it. |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1585 | other->predecessors_.clear(); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1586 | |
| 1587 | // Delete `other` from the graph. The function updates reverse post order. |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1588 | graph_->DeleteDeadEmptyBlock(other); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1589 | other->SetGraph(nullptr); |
| 1590 | } |
| 1591 | |
| 1592 | void HBasicBlock::MergeWithInlined(HBasicBlock* other) { |
| 1593 | DCHECK_NE(GetGraph(), other->GetGraph()); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1594 | DCHECK(GetDominatedBlocks().empty()); |
| 1595 | DCHECK(GetSuccessors().empty()); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1596 | DCHECK(!EndsWithControlFlowInstruction()); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1597 | DCHECK(other->GetSinglePredecessor()->IsEntryBlock()); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1598 | DCHECK(other->GetPhis().IsEmpty()); |
| 1599 | DCHECK(!other->IsInLoop()); |
| 1600 | |
| 1601 | // Move instructions from `other` to `this`. |
| 1602 | instructions_.Add(other->GetInstructions()); |
| 1603 | other->instructions_.SetBlockOfInstructions(this); |
| 1604 | |
| 1605 | // Update links to the successors of `other`. |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1606 | successors_.clear(); |
| 1607 | while (!other->successors_.empty()) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 1608 | HBasicBlock* successor = other->GetSuccessors()[0]; |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1609 | successor->ReplacePredecessor(other, this); |
| 1610 | } |
| 1611 | |
| 1612 | // Update the dominator tree. |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1613 | for (HBasicBlock* dominated : other->GetDominatedBlocks()) { |
| 1614 | dominated_blocks_.push_back(dominated); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1615 | dominated->SetDominator(this); |
| 1616 | } |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1617 | other->dominated_blocks_.clear(); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1618 | other->dominator_ = nullptr; |
| 1619 | other->graph_ = nullptr; |
| 1620 | } |
| 1621 | |
| 1622 | void HBasicBlock::ReplaceWith(HBasicBlock* other) { |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1623 | while (!GetPredecessors().empty()) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 1624 | HBasicBlock* predecessor = GetPredecessors()[0]; |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1625 | predecessor->ReplaceSuccessor(this, other); |
| 1626 | } |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1627 | while (!GetSuccessors().empty()) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 1628 | HBasicBlock* successor = GetSuccessors()[0]; |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1629 | successor->ReplacePredecessor(this, other); |
| 1630 | } |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1631 | for (HBasicBlock* dominated : GetDominatedBlocks()) { |
| 1632 | other->AddDominatedBlock(dominated); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1633 | } |
| 1634 | GetDominator()->ReplaceDominatedBlock(this, other); |
| 1635 | other->SetDominator(GetDominator()); |
| 1636 | dominator_ = nullptr; |
| 1637 | graph_ = nullptr; |
| 1638 | } |
| 1639 | |
| 1640 | // Create space in `blocks` for adding `number_of_new_blocks` entries |
| 1641 | // starting at location `at`. Blocks after `at` are moved accordingly. |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 1642 | static void MakeRoomFor(ArenaVector<HBasicBlock*>* blocks, |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1643 | size_t number_of_new_blocks, |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 1644 | size_t after) { |
| 1645 | DCHECK_LT(after, blocks->size()); |
| 1646 | size_t old_size = blocks->size(); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1647 | size_t new_size = old_size + number_of_new_blocks; |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 1648 | blocks->resize(new_size); |
| 1649 | std::copy_backward(blocks->begin() + after + 1u, blocks->begin() + old_size, blocks->end()); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1650 | } |
| 1651 | |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1652 | void HGraph::DeleteDeadEmptyBlock(HBasicBlock* block) { |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1653 | DCHECK_EQ(block->GetGraph(), this); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1654 | DCHECK(block->GetSuccessors().empty()); |
| 1655 | DCHECK(block->GetPredecessors().empty()); |
| 1656 | DCHECK(block->GetDominatedBlocks().empty()); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1657 | DCHECK(block->GetDominator() == nullptr); |
David Brazdil | 8a7c0fe | 2015-11-02 20:24:55 +0000 | [diff] [blame] | 1658 | DCHECK(block->GetInstructions().IsEmpty()); |
| 1659 | DCHECK(block->GetPhis().IsEmpty()); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1660 | |
David Brazdil | c7af85d | 2015-05-26 12:05:55 +0100 | [diff] [blame] | 1661 | if (block->IsExitBlock()) { |
| 1662 | exit_block_ = nullptr; |
| 1663 | } |
| 1664 | |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 1665 | RemoveElement(reverse_post_order_, block); |
| 1666 | blocks_[block->GetBlockId()] = nullptr; |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1667 | } |
| 1668 | |
Calin Juravle | 2e76830 | 2015-07-28 14:41:11 +0000 | [diff] [blame] | 1669 | HInstruction* HGraph::InlineInto(HGraph* outer_graph, HInvoke* invoke) { |
David Brazdil | c7af85d | 2015-05-26 12:05:55 +0100 | [diff] [blame] | 1670 | DCHECK(HasExitBlock()) << "Unimplemented scenario"; |
Nicolas Geoffray | d23eeef | 2015-05-18 22:31:29 +0100 | [diff] [blame] | 1671 | // Update the environments in this graph to have the invoke's environment |
| 1672 | // as parent. |
| 1673 | { |
| 1674 | HReversePostOrderIterator it(*this); |
| 1675 | it.Advance(); // Skip the entry block, we do not need to update the entry's suspend check. |
| 1676 | for (; !it.Done(); it.Advance()) { |
| 1677 | HBasicBlock* block = it.Current(); |
| 1678 | for (HInstructionIterator instr_it(block->GetInstructions()); |
| 1679 | !instr_it.Done(); |
| 1680 | instr_it.Advance()) { |
| 1681 | HInstruction* current = instr_it.Current(); |
| 1682 | if (current->NeedsEnvironment()) { |
| 1683 | current->GetEnvironment()->SetAndCopyParentChain( |
| 1684 | outer_graph->GetArena(), invoke->GetEnvironment()); |
| 1685 | } |
| 1686 | } |
| 1687 | } |
| 1688 | } |
| 1689 | outer_graph->UpdateMaximumNumberOfOutVRegs(GetMaximumNumberOfOutVRegs()); |
| 1690 | if (HasBoundsChecks()) { |
| 1691 | outer_graph->SetHasBoundsChecks(true); |
| 1692 | } |
| 1693 | |
Calin Juravle | 2e76830 | 2015-07-28 14:41:11 +0000 | [diff] [blame] | 1694 | HInstruction* return_value = nullptr; |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 1695 | if (GetBlocks().size() == 3) { |
Nicolas Geoffray | be31ff9 | 2015-02-04 14:52:20 +0000 | [diff] [blame] | 1696 | // Simple case of an entry block, a body block, and an exit block. |
| 1697 | // Put the body block's instruction into `invoke`'s block. |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 1698 | HBasicBlock* body = GetBlocks()[1]; |
| 1699 | DCHECK(GetBlocks()[0]->IsEntryBlock()); |
| 1700 | DCHECK(GetBlocks()[2]->IsExitBlock()); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1701 | DCHECK(!body->IsExitBlock()); |
| 1702 | HInstruction* last = body->GetLastInstruction(); |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 1703 | |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1704 | invoke->GetBlock()->instructions_.AddAfter(invoke, body->GetInstructions()); |
| 1705 | body->GetInstructions().SetBlockOfInstructions(invoke->GetBlock()); |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 1706 | |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1707 | // Replace the invoke with the return value of the inlined graph. |
| 1708 | if (last->IsReturn()) { |
Calin Juravle | 2e76830 | 2015-07-28 14:41:11 +0000 | [diff] [blame] | 1709 | return_value = last->InputAt(0); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1710 | } else { |
| 1711 | DCHECK(last->IsReturnVoid()); |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 1712 | } |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 1713 | |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1714 | invoke->GetBlock()->RemoveInstruction(last); |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 1715 | } else { |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1716 | // Need to inline multiple blocks. We split `invoke`'s block |
| 1717 | // into two blocks, merge the first block of the inlined graph into |
Nicolas Geoffray | be31ff9 | 2015-02-04 14:52:20 +0000 | [diff] [blame] | 1718 | // the first half, and replace the exit block of the inlined graph |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1719 | // with the second half. |
| 1720 | ArenaAllocator* allocator = outer_graph->GetArena(); |
| 1721 | HBasicBlock* at = invoke->GetBlock(); |
| 1722 | HBasicBlock* to = at->SplitAfter(invoke); |
| 1723 | |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 1724 | HBasicBlock* first = entry_block_->GetSuccessors()[0]; |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1725 | DCHECK(!first->IsInLoop()); |
David Brazdil | 2d7352b | 2015-04-20 14:52:42 +0100 | [diff] [blame] | 1726 | at->MergeWithInlined(first); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1727 | exit_block_->ReplaceWith(to); |
| 1728 | |
| 1729 | // Update all predecessors of the exit block (now the `to` block) |
Nicolas Geoffray | 817bce7 | 2015-02-24 13:35:38 +0000 | [diff] [blame] | 1730 | // to not `HReturn` but `HGoto` instead. |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 1731 | bool returns_void = to->GetPredecessors()[0]->GetLastInstruction()->IsReturnVoid(); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1732 | if (to->GetPredecessors().size() == 1) { |
Vladimir Marko | ec7802a | 2015-10-01 20:57:57 +0100 | [diff] [blame] | 1733 | HBasicBlock* predecessor = to->GetPredecessors()[0]; |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1734 | HInstruction* last = predecessor->GetLastInstruction(); |
Nicolas Geoffray | 817bce7 | 2015-02-24 13:35:38 +0000 | [diff] [blame] | 1735 | if (!returns_void) { |
| 1736 | return_value = last->InputAt(0); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1737 | } |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1738 | predecessor->AddInstruction(new (allocator) HGoto(last->GetDexPc())); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1739 | predecessor->RemoveInstruction(last); |
Nicolas Geoffray | 817bce7 | 2015-02-24 13:35:38 +0000 | [diff] [blame] | 1740 | } else { |
| 1741 | if (!returns_void) { |
| 1742 | // There will be multiple returns. |
Nicolas Geoffray | 4f1a384 | 2015-03-12 10:34:11 +0000 | [diff] [blame] | 1743 | return_value = new (allocator) HPhi( |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1744 | allocator, kNoRegNumber, 0, HPhi::ToPhiType(invoke->GetType()), to->GetDexPc()); |
Nicolas Geoffray | 817bce7 | 2015-02-24 13:35:38 +0000 | [diff] [blame] | 1745 | to->AddPhi(return_value->AsPhi()); |
| 1746 | } |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1747 | for (HBasicBlock* predecessor : to->GetPredecessors()) { |
Nicolas Geoffray | 817bce7 | 2015-02-24 13:35:38 +0000 | [diff] [blame] | 1748 | HInstruction* last = predecessor->GetLastInstruction(); |
| 1749 | if (!returns_void) { |
| 1750 | return_value->AsPhi()->AddInput(last->InputAt(0)); |
| 1751 | } |
Yevgeny Rouban | 3ecfd65 | 2015-09-07 17:57:00 +0600 | [diff] [blame] | 1752 | predecessor->AddInstruction(new (allocator) HGoto(last->GetDexPc())); |
Nicolas Geoffray | 817bce7 | 2015-02-24 13:35:38 +0000 | [diff] [blame] | 1753 | predecessor->RemoveInstruction(last); |
| 1754 | } |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1755 | } |
| 1756 | |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1757 | // Update the meta information surrounding blocks: |
| 1758 | // (1) the graph they are now in, |
| 1759 | // (2) the reverse post order of that graph, |
David Brazdil | 9517798 | 2015-10-30 12:56:58 -0500 | [diff] [blame] | 1760 | // (3) the potential loop information they are now in, |
| 1761 | // (4) try block membership. |
David Brazdil | 59a850e | 2015-11-10 13:04:30 +0000 | [diff] [blame] | 1762 | // Note that we do not need to update catch phi inputs because they |
| 1763 | // correspond to the register file of the outer method which the inlinee |
| 1764 | // cannot modify. |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1765 | |
| 1766 | // We don't add the entry block, the exit block, and the first block, which |
| 1767 | // has been merged with `at`. |
| 1768 | static constexpr int kNumberOfSkippedBlocksInCallee = 3; |
| 1769 | |
| 1770 | // We add the `to` block. |
| 1771 | static constexpr int kNumberOfNewBlocksInCaller = 1; |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 1772 | size_t blocks_added = (reverse_post_order_.size() - kNumberOfSkippedBlocksInCallee) |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1773 | + kNumberOfNewBlocksInCaller; |
| 1774 | |
| 1775 | // Find the location of `at` in the outer graph's reverse post order. The new |
| 1776 | // blocks will be added after it. |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 1777 | size_t index_of_at = IndexOfElement(outer_graph->reverse_post_order_, at); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1778 | MakeRoomFor(&outer_graph->reverse_post_order_, blocks_added, index_of_at); |
| 1779 | |
David Brazdil | 9517798 | 2015-10-30 12:56:58 -0500 | [diff] [blame] | 1780 | HLoopInformation* loop_info = at->GetLoopInformation(); |
| 1781 | // Copy TryCatchInformation if `at` is a try block, not if it is a catch block. |
| 1782 | TryCatchInformation* try_catch_info = at->IsTryBlock() ? at->GetTryCatchInformation() : nullptr; |
| 1783 | |
| 1784 | // Do a reverse post order of the blocks in the callee and do (1), (2), (3) |
| 1785 | // and (4) to the blocks that apply. |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1786 | for (HReversePostOrderIterator it(*this); !it.Done(); it.Advance()) { |
| 1787 | HBasicBlock* current = it.Current(); |
| 1788 | if (current != exit_block_ && current != entry_block_ && current != first) { |
| 1789 | DCHECK(!current->IsInLoop()); |
David Brazdil | 9517798 | 2015-10-30 12:56:58 -0500 | [diff] [blame] | 1790 | DCHECK(current->GetTryCatchInformation() == nullptr); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1791 | DCHECK(current->GetGraph() == this); |
| 1792 | current->SetGraph(outer_graph); |
| 1793 | outer_graph->AddBlock(current); |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 1794 | outer_graph->reverse_post_order_[++index_of_at] = current; |
David Brazdil | 9517798 | 2015-10-30 12:56:58 -0500 | [diff] [blame] | 1795 | if (loop_info != nullptr) { |
| 1796 | current->SetLoopInformation(loop_info); |
David Brazdil | 7d27537 | 2015-04-21 16:36:35 +0100 | [diff] [blame] | 1797 | for (HLoopInformationOutwardIterator loop_it(*at); !loop_it.Done(); loop_it.Advance()) { |
| 1798 | loop_it.Current()->Add(current); |
| 1799 | } |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1800 | } |
David Brazdil | 9517798 | 2015-10-30 12:56:58 -0500 | [diff] [blame] | 1801 | current->SetTryCatchInformation(try_catch_info); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1802 | } |
| 1803 | } |
| 1804 | |
David Brazdil | 9517798 | 2015-10-30 12:56:58 -0500 | [diff] [blame] | 1805 | // Do (1), (2), (3) and (4) to `to`. |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1806 | to->SetGraph(outer_graph); |
| 1807 | outer_graph->AddBlock(to); |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 1808 | outer_graph->reverse_post_order_[++index_of_at] = to; |
David Brazdil | 9517798 | 2015-10-30 12:56:58 -0500 | [diff] [blame] | 1809 | if (loop_info != nullptr) { |
| 1810 | to->SetLoopInformation(loop_info); |
David Brazdil | 7d27537 | 2015-04-21 16:36:35 +0100 | [diff] [blame] | 1811 | for (HLoopInformationOutwardIterator loop_it(*at); !loop_it.Done(); loop_it.Advance()) { |
| 1812 | loop_it.Current()->Add(to); |
| 1813 | } |
David Brazdil | 9517798 | 2015-10-30 12:56:58 -0500 | [diff] [blame] | 1814 | if (loop_info->IsBackEdge(*at)) { |
Nicolas Geoffray | db216f4 | 2015-05-05 17:02:20 +0100 | [diff] [blame] | 1815 | // Only `to` can become a back edge, as the inlined blocks |
| 1816 | // are predecessors of `to`. |
David Brazdil | 9517798 | 2015-10-30 12:56:58 -0500 | [diff] [blame] | 1817 | loop_info->ReplaceBackEdge(at, to); |
Nicolas Geoffray | 276d9da | 2015-02-02 18:24:11 +0000 | [diff] [blame] | 1818 | } |
| 1819 | } |
David Brazdil | 9517798 | 2015-10-30 12:56:58 -0500 | [diff] [blame] | 1820 | to->SetTryCatchInformation(try_catch_info); |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 1821 | } |
Nicolas Geoffray | 7c5367b | 2014-12-17 10:13:46 +0000 | [diff] [blame] | 1822 | |
David Brazdil | 05144f4 | 2015-04-16 15:18:00 +0100 | [diff] [blame] | 1823 | // Update the next instruction id of the outer graph, so that instructions |
| 1824 | // added later get bigger ids than those in the inner graph. |
| 1825 | outer_graph->SetCurrentInstructionId(GetNextInstructionId()); |
| 1826 | |
| 1827 | // Walk over the entry block and: |
| 1828 | // - Move constants from the entry block to the outer_graph's entry block, |
| 1829 | // - Replace HParameterValue instructions with their real value. |
| 1830 | // - Remove suspend checks, that hold an environment. |
| 1831 | // We must do this after the other blocks have been inlined, otherwise ids of |
| 1832 | // constants could overlap with the inner graph. |
Roland Levillain | 4c0eb42 | 2015-04-24 16:43:49 +0100 | [diff] [blame] | 1833 | size_t parameter_index = 0; |
David Brazdil | 05144f4 | 2015-04-16 15:18:00 +0100 | [diff] [blame] | 1834 | for (HInstructionIterator it(entry_block_->GetInstructions()); !it.Done(); it.Advance()) { |
| 1835 | HInstruction* current = it.Current(); |
Calin Juravle | 214bbcd | 2015-10-20 14:54:07 +0100 | [diff] [blame] | 1836 | HInstruction* replacement = nullptr; |
David Brazdil | 05144f4 | 2015-04-16 15:18:00 +0100 | [diff] [blame] | 1837 | if (current->IsNullConstant()) { |
Calin Juravle | 214bbcd | 2015-10-20 14:54:07 +0100 | [diff] [blame] | 1838 | replacement = outer_graph->GetNullConstant(current->GetDexPc()); |
David Brazdil | 05144f4 | 2015-04-16 15:18:00 +0100 | [diff] [blame] | 1839 | } else if (current->IsIntConstant()) { |
Calin Juravle | 214bbcd | 2015-10-20 14:54:07 +0100 | [diff] [blame] | 1840 | replacement = outer_graph->GetIntConstant( |
| 1841 | current->AsIntConstant()->GetValue(), current->GetDexPc()); |
David Brazdil | 05144f4 | 2015-04-16 15:18:00 +0100 | [diff] [blame] | 1842 | } else if (current->IsLongConstant()) { |
Calin Juravle | 214bbcd | 2015-10-20 14:54:07 +0100 | [diff] [blame] | 1843 | replacement = outer_graph->GetLongConstant( |
| 1844 | current->AsLongConstant()->GetValue(), current->GetDexPc()); |
Nicolas Geoffray | f213e05 | 2015-04-27 08:53:46 +0000 | [diff] [blame] | 1845 | } else if (current->IsFloatConstant()) { |
Calin Juravle | 214bbcd | 2015-10-20 14:54:07 +0100 | [diff] [blame] | 1846 | replacement = outer_graph->GetFloatConstant( |
| 1847 | current->AsFloatConstant()->GetValue(), current->GetDexPc()); |
Nicolas Geoffray | f213e05 | 2015-04-27 08:53:46 +0000 | [diff] [blame] | 1848 | } else if (current->IsDoubleConstant()) { |
Calin Juravle | 214bbcd | 2015-10-20 14:54:07 +0100 | [diff] [blame] | 1849 | replacement = outer_graph->GetDoubleConstant( |
| 1850 | current->AsDoubleConstant()->GetValue(), current->GetDexPc()); |
David Brazdil | 05144f4 | 2015-04-16 15:18:00 +0100 | [diff] [blame] | 1851 | } else if (current->IsParameterValue()) { |
Roland Levillain | 4c0eb42 | 2015-04-24 16:43:49 +0100 | [diff] [blame] | 1852 | if (kIsDebugBuild |
| 1853 | && invoke->IsInvokeStaticOrDirect() |
| 1854 | && invoke->AsInvokeStaticOrDirect()->IsStaticWithExplicitClinitCheck()) { |
| 1855 | // Ensure we do not use the last input of `invoke`, as it |
| 1856 | // contains a clinit check which is not an actual argument. |
| 1857 | size_t last_input_index = invoke->InputCount() - 1; |
| 1858 | DCHECK(parameter_index != last_input_index); |
| 1859 | } |
Calin Juravle | 214bbcd | 2015-10-20 14:54:07 +0100 | [diff] [blame] | 1860 | replacement = invoke->InputAt(parameter_index++); |
Nicolas Geoffray | 76b1e17 | 2015-05-27 17:18:33 +0100 | [diff] [blame] | 1861 | } else if (current->IsCurrentMethod()) { |
Calin Juravle | 214bbcd | 2015-10-20 14:54:07 +0100 | [diff] [blame] | 1862 | replacement = outer_graph->GetCurrentMethod(); |
David Brazdil | 05144f4 | 2015-04-16 15:18:00 +0100 | [diff] [blame] | 1863 | } else { |
| 1864 | DCHECK(current->IsGoto() || current->IsSuspendCheck()); |
| 1865 | entry_block_->RemoveInstruction(current); |
| 1866 | } |
Calin Juravle | 214bbcd | 2015-10-20 14:54:07 +0100 | [diff] [blame] | 1867 | if (replacement != nullptr) { |
| 1868 | current->ReplaceWith(replacement); |
| 1869 | // If the current is the return value then we need to update the latter. |
| 1870 | if (current == return_value) { |
| 1871 | DCHECK_EQ(entry_block_, return_value->GetBlock()); |
| 1872 | return_value = replacement; |
| 1873 | } |
| 1874 | } |
| 1875 | } |
| 1876 | |
| 1877 | if (return_value != nullptr) { |
| 1878 | invoke->ReplaceWith(return_value); |
David Brazdil | 05144f4 | 2015-04-16 15:18:00 +0100 | [diff] [blame] | 1879 | } |
| 1880 | |
Nicolas Geoffray | 7c5367b | 2014-12-17 10:13:46 +0000 | [diff] [blame] | 1881 | // Finally remove the invoke from the caller. |
| 1882 | invoke->GetBlock()->RemoveInstruction(invoke); |
Calin Juravle | 2e76830 | 2015-07-28 14:41:11 +0000 | [diff] [blame] | 1883 | |
| 1884 | return return_value; |
Nicolas Geoffray | e53798a | 2014-12-01 10:31:54 +0000 | [diff] [blame] | 1885 | } |
| 1886 | |
Mingyao Yang | 3584bce | 2015-05-19 16:01:59 -0700 | [diff] [blame] | 1887 | /* |
| 1888 | * Loop will be transformed to: |
| 1889 | * old_pre_header |
| 1890 | * | |
| 1891 | * if_block |
| 1892 | * / \ |
| 1893 | * dummy_block deopt_block |
| 1894 | * \ / |
| 1895 | * new_pre_header |
| 1896 | * | |
| 1897 | * header |
| 1898 | */ |
| 1899 | void HGraph::TransformLoopHeaderForBCE(HBasicBlock* header) { |
| 1900 | DCHECK(header->IsLoopHeader()); |
| 1901 | HBasicBlock* pre_header = header->GetDominator(); |
| 1902 | |
| 1903 | // Need this to avoid critical edge. |
| 1904 | HBasicBlock* if_block = new (arena_) HBasicBlock(this, header->GetDexPc()); |
| 1905 | // Need this to avoid critical edge. |
| 1906 | HBasicBlock* dummy_block = new (arena_) HBasicBlock(this, header->GetDexPc()); |
| 1907 | HBasicBlock* deopt_block = new (arena_) HBasicBlock(this, header->GetDexPc()); |
| 1908 | HBasicBlock* new_pre_header = new (arena_) HBasicBlock(this, header->GetDexPc()); |
| 1909 | AddBlock(if_block); |
| 1910 | AddBlock(dummy_block); |
| 1911 | AddBlock(deopt_block); |
| 1912 | AddBlock(new_pre_header); |
| 1913 | |
| 1914 | header->ReplacePredecessor(pre_header, new_pre_header); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1915 | pre_header->successors_.clear(); |
| 1916 | pre_header->dominated_blocks_.clear(); |
Mingyao Yang | 3584bce | 2015-05-19 16:01:59 -0700 | [diff] [blame] | 1917 | |
| 1918 | pre_header->AddSuccessor(if_block); |
| 1919 | if_block->AddSuccessor(dummy_block); // True successor |
| 1920 | if_block->AddSuccessor(deopt_block); // False successor |
| 1921 | dummy_block->AddSuccessor(new_pre_header); |
| 1922 | deopt_block->AddSuccessor(new_pre_header); |
| 1923 | |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1924 | pre_header->dominated_blocks_.push_back(if_block); |
Mingyao Yang | 3584bce | 2015-05-19 16:01:59 -0700 | [diff] [blame] | 1925 | if_block->SetDominator(pre_header); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1926 | if_block->dominated_blocks_.push_back(dummy_block); |
Mingyao Yang | 3584bce | 2015-05-19 16:01:59 -0700 | [diff] [blame] | 1927 | dummy_block->SetDominator(if_block); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1928 | if_block->dominated_blocks_.push_back(deopt_block); |
Mingyao Yang | 3584bce | 2015-05-19 16:01:59 -0700 | [diff] [blame] | 1929 | deopt_block->SetDominator(if_block); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1930 | if_block->dominated_blocks_.push_back(new_pre_header); |
Mingyao Yang | 3584bce | 2015-05-19 16:01:59 -0700 | [diff] [blame] | 1931 | new_pre_header->SetDominator(if_block); |
Vladimir Marko | 6058455 | 2015-09-03 13:35:12 +0000 | [diff] [blame] | 1932 | new_pre_header->dominated_blocks_.push_back(header); |
Mingyao Yang | 3584bce | 2015-05-19 16:01:59 -0700 | [diff] [blame] | 1933 | header->SetDominator(new_pre_header); |
| 1934 | |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 1935 | size_t index_of_header = IndexOfElement(reverse_post_order_, header); |
Mingyao Yang | 3584bce | 2015-05-19 16:01:59 -0700 | [diff] [blame] | 1936 | MakeRoomFor(&reverse_post_order_, 4, index_of_header - 1); |
Vladimir Marko | fa6b93c | 2015-09-15 10:15:55 +0100 | [diff] [blame] | 1937 | reverse_post_order_[index_of_header++] = if_block; |
| 1938 | reverse_post_order_[index_of_header++] = dummy_block; |
| 1939 | reverse_post_order_[index_of_header++] = deopt_block; |
| 1940 | reverse_post_order_[index_of_header++] = new_pre_header; |
Mingyao Yang | 3584bce | 2015-05-19 16:01:59 -0700 | [diff] [blame] | 1941 | |
| 1942 | HLoopInformation* info = pre_header->GetLoopInformation(); |
| 1943 | if (info != nullptr) { |
| 1944 | if_block->SetLoopInformation(info); |
| 1945 | dummy_block->SetLoopInformation(info); |
| 1946 | deopt_block->SetLoopInformation(info); |
| 1947 | new_pre_header->SetLoopInformation(info); |
| 1948 | for (HLoopInformationOutwardIterator loop_it(*pre_header); |
| 1949 | !loop_it.Done(); |
| 1950 | loop_it.Advance()) { |
| 1951 | loop_it.Current()->Add(if_block); |
| 1952 | loop_it.Current()->Add(dummy_block); |
| 1953 | loop_it.Current()->Add(deopt_block); |
| 1954 | loop_it.Current()->Add(new_pre_header); |
| 1955 | } |
| 1956 | } |
| 1957 | } |
| 1958 | |
Calin Juravle | 2e76830 | 2015-07-28 14:41:11 +0000 | [diff] [blame] | 1959 | void HInstruction::SetReferenceTypeInfo(ReferenceTypeInfo rti) { |
| 1960 | if (kIsDebugBuild) { |
| 1961 | DCHECK_EQ(GetType(), Primitive::kPrimNot); |
| 1962 | ScopedObjectAccess soa(Thread::Current()); |
| 1963 | DCHECK(rti.IsValid()) << "Invalid RTI for " << DebugName(); |
| 1964 | if (IsBoundType()) { |
| 1965 | // Having the test here spares us from making the method virtual just for |
| 1966 | // the sake of a DCHECK. |
| 1967 | ReferenceTypeInfo upper_bound_rti = AsBoundType()->GetUpperBound(); |
| 1968 | DCHECK(upper_bound_rti.IsSupertypeOf(rti)) |
| 1969 | << " upper_bound_rti: " << upper_bound_rti |
| 1970 | << " rti: " << rti; |
David Brazdil | baf89b8 | 2015-09-15 11:36:54 +0100 | [diff] [blame] | 1971 | DCHECK(!upper_bound_rti.GetTypeHandle()->CannotBeAssignedFromOtherTypes() || rti.IsExact()); |
Calin Juravle | 2e76830 | 2015-07-28 14:41:11 +0000 | [diff] [blame] | 1972 | } |
| 1973 | } |
| 1974 | reference_type_info_ = rti; |
| 1975 | } |
| 1976 | |
| 1977 | ReferenceTypeInfo::ReferenceTypeInfo() : type_handle_(TypeHandle()), is_exact_(false) {} |
| 1978 | |
| 1979 | ReferenceTypeInfo::ReferenceTypeInfo(TypeHandle type_handle, bool is_exact) |
| 1980 | : type_handle_(type_handle), is_exact_(is_exact) { |
| 1981 | if (kIsDebugBuild) { |
| 1982 | ScopedObjectAccess soa(Thread::Current()); |
| 1983 | DCHECK(IsValidHandle(type_handle)); |
| 1984 | } |
| 1985 | } |
| 1986 | |
Calin Juravle | acf735c | 2015-02-12 15:25:22 +0000 | [diff] [blame] | 1987 | std::ostream& operator<<(std::ostream& os, const ReferenceTypeInfo& rhs) { |
| 1988 | ScopedObjectAccess soa(Thread::Current()); |
| 1989 | os << "[" |
Calin Juravle | 2e76830 | 2015-07-28 14:41:11 +0000 | [diff] [blame] | 1990 | << " is_valid=" << rhs.IsValid() |
| 1991 | << " type=" << (!rhs.IsValid() ? "?" : PrettyClass(rhs.GetTypeHandle().Get())) |
Calin Juravle | acf735c | 2015-02-12 15:25:22 +0000 | [diff] [blame] | 1992 | << " is_exact=" << rhs.IsExact() |
| 1993 | << " ]"; |
| 1994 | return os; |
| 1995 | } |
| 1996 | |
Mark Mendell | c470193 | 2015-04-10 13:18:51 -0400 | [diff] [blame] | 1997 | bool HInstruction::HasAnyEnvironmentUseBefore(HInstruction* other) { |
| 1998 | // For now, assume that instructions in different blocks may use the |
| 1999 | // environment. |
| 2000 | // TODO: Use the control flow to decide if this is true. |
| 2001 | if (GetBlock() != other->GetBlock()) { |
| 2002 | return true; |
| 2003 | } |
| 2004 | |
| 2005 | // We know that we are in the same block. Walk from 'this' to 'other', |
| 2006 | // checking to see if there is any instruction with an environment. |
| 2007 | HInstruction* current = this; |
| 2008 | for (; current != other && current != nullptr; current = current->GetNext()) { |
| 2009 | // This is a conservative check, as the instruction result may not be in |
| 2010 | // the referenced environment. |
| 2011 | if (current->HasEnvironment()) { |
| 2012 | return true; |
| 2013 | } |
| 2014 | } |
| 2015 | |
| 2016 | // We should have been called with 'this' before 'other' in the block. |
| 2017 | // Just confirm this. |
| 2018 | DCHECK(current != nullptr); |
| 2019 | return false; |
| 2020 | } |
| 2021 | |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 2022 | void HInvoke::SetIntrinsic(Intrinsics intrinsic, |
| 2023 | IntrinsicNeedsEnvironmentOrCache needs_env_or_cache) { |
| 2024 | intrinsic_ = intrinsic; |
| 2025 | IntrinsicOptimizations opt(this); |
| 2026 | if (needs_env_or_cache == kNoEnvironmentOrCache) { |
| 2027 | opt.SetDoesNotNeedDexCache(); |
| 2028 | opt.SetDoesNotNeedEnvironment(); |
| 2029 | } |
| 2030 | } |
| 2031 | |
| 2032 | bool HInvoke::NeedsEnvironment() const { |
| 2033 | if (!IsIntrinsic()) { |
| 2034 | return true; |
| 2035 | } |
| 2036 | IntrinsicOptimizations opt(*this); |
| 2037 | return !opt.GetDoesNotNeedEnvironment(); |
| 2038 | } |
| 2039 | |
Vladimir Marko | dc151b2 | 2015-10-15 18:02:30 +0100 | [diff] [blame] | 2040 | bool HInvokeStaticOrDirect::NeedsDexCacheOfDeclaringClass() const { |
| 2041 | if (GetMethodLoadKind() != MethodLoadKind::kDexCacheViaMethod) { |
Nicolas Geoffray | a83a54d | 2015-10-02 17:30:26 +0100 | [diff] [blame] | 2042 | return false; |
| 2043 | } |
| 2044 | if (!IsIntrinsic()) { |
| 2045 | return true; |
| 2046 | } |
| 2047 | IntrinsicOptimizations opt(*this); |
| 2048 | return !opt.GetDoesNotNeedDexCache(); |
| 2049 | } |
| 2050 | |
Vladimir Marko | 0f7dca4 | 2015-11-02 14:36:43 +0000 | [diff] [blame] | 2051 | void HInvokeStaticOrDirect::InsertInputAt(size_t index, HInstruction* input) { |
| 2052 | inputs_.insert(inputs_.begin() + index, HUserRecord<HInstruction*>(input)); |
| 2053 | input->AddUseAt(this, index); |
| 2054 | // Update indexes in use nodes of inputs that have been pushed further back by the insert(). |
| 2055 | for (size_t i = index + 1u, size = inputs_.size(); i != size; ++i) { |
| 2056 | DCHECK_EQ(InputRecordAt(i).GetUseNode()->GetIndex(), i - 1u); |
| 2057 | InputRecordAt(i).GetUseNode()->SetIndex(i); |
| 2058 | } |
| 2059 | } |
| 2060 | |
Vladimir Marko | b554b5a | 2015-11-06 12:57:55 +0000 | [diff] [blame] | 2061 | void HInvokeStaticOrDirect::RemoveInputAt(size_t index) { |
| 2062 | RemoveAsUserOfInput(index); |
| 2063 | inputs_.erase(inputs_.begin() + index); |
| 2064 | // Update indexes in use nodes of inputs that have been pulled forward by the erase(). |
| 2065 | for (size_t i = index, e = InputCount(); i < e; ++i) { |
| 2066 | DCHECK_EQ(InputRecordAt(i).GetUseNode()->GetIndex(), i + 1u); |
| 2067 | InputRecordAt(i).GetUseNode()->SetIndex(i); |
| 2068 | } |
| 2069 | } |
| 2070 | |
Vladimir Marko | fbb184a | 2015-11-13 14:47:00 +0000 | [diff] [blame^] | 2071 | std::ostream& operator<<(std::ostream& os, HInvokeStaticOrDirect::ClinitCheckRequirement rhs) { |
| 2072 | switch (rhs) { |
| 2073 | case HInvokeStaticOrDirect::ClinitCheckRequirement::kExplicit: |
| 2074 | return os << "explicit"; |
| 2075 | case HInvokeStaticOrDirect::ClinitCheckRequirement::kImplicit: |
| 2076 | return os << "implicit"; |
| 2077 | case HInvokeStaticOrDirect::ClinitCheckRequirement::kNone: |
| 2078 | return os << "none"; |
| 2079 | default: |
| 2080 | return os << "unknown:" << static_cast<int>(rhs); |
| 2081 | } |
| 2082 | } |
| 2083 | |
Mark Mendell | c470193 | 2015-04-10 13:18:51 -0400 | [diff] [blame] | 2084 | void HInstruction::RemoveEnvironmentUsers() { |
| 2085 | for (HUseIterator<HEnvironment*> use_it(GetEnvUses()); !use_it.Done(); use_it.Advance()) { |
| 2086 | HUseListNode<HEnvironment*>* user_node = use_it.Current(); |
| 2087 | HEnvironment* user = user_node->GetUser(); |
| 2088 | user->SetRawEnvAt(user_node->GetIndex(), nullptr); |
| 2089 | } |
| 2090 | env_uses_.Clear(); |
| 2091 | } |
| 2092 | |
Nicolas Geoffray | 818f210 | 2014-02-18 16:43:35 +0000 | [diff] [blame] | 2093 | } // namespace art |