buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 1 | /* |
| 2 | * Copyright (C) 2011 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 | |
Ian Rogers | e77493c | 2014-08-20 15:08:45 -0700 | [diff] [blame] | 17 | #include "base/bit_vector-inl.h" |
buzbee | eaf09bc | 2012-11-15 14:51:41 -0800 | [diff] [blame] | 18 | #include "compiler_internals.h" |
Ian Rogers | 8d3a117 | 2013-06-04 01:13:28 -0700 | [diff] [blame] | 19 | #include "dataflow_iterator-inl.h" |
Vladimir Marko | c9360ce | 2014-06-05 20:09:47 +0100 | [diff] [blame] | 20 | #include "utils/scoped_arena_containers.h" |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 21 | |
buzbee | 1fd3346 | 2013-03-25 13:40:45 -0700 | [diff] [blame] | 22 | #define NOTVISITED (-1) |
| 23 | |
Elliott Hughes | 11d1b0c | 2012-01-23 16:57:47 -0800 | [diff] [blame] | 24 | namespace art { |
| 25 | |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 26 | void MIRGraph::ClearAllVisitedFlags() { |
buzbee | 56c7178 | 2013-09-05 17:13:19 -0700 | [diff] [blame] | 27 | AllNodesIterator iter(this); |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 28 | for (BasicBlock* bb = iter.Next(); bb != NULL; bb = iter.Next()) { |
| 29 | bb->visited = false; |
| 30 | } |
| 31 | } |
| 32 | |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 33 | BasicBlock* MIRGraph::NeedsVisit(BasicBlock* bb) { |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 34 | if (bb != NULL) { |
| 35 | if (bb->visited || bb->hidden) { |
| 36 | bb = NULL; |
| 37 | } |
| 38 | } |
| 39 | return bb; |
| 40 | } |
| 41 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 42 | BasicBlock* MIRGraph::NextUnvisitedSuccessor(BasicBlock* bb) { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 43 | BasicBlock* res = NeedsVisit(GetBasicBlock(bb->fall_through)); |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 44 | if (res == NULL) { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 45 | res = NeedsVisit(GetBasicBlock(bb->taken)); |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 46 | if (res == NULL) { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 47 | if (bb->successor_block_list_type != kNotUsed) { |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 48 | for (SuccessorBlockInfo* sbi : bb->successor_blocks) { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 49 | res = NeedsVisit(GetBasicBlock(sbi->block)); |
Brian Carlstrom | 0cd7ec2 | 2013-07-17 23:40:20 -0700 | [diff] [blame] | 50 | if (res != NULL) { |
| 51 | break; |
| 52 | } |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 53 | } |
| 54 | } |
| 55 | } |
| 56 | } |
| 57 | return res; |
| 58 | } |
| 59 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 60 | void MIRGraph::MarkPreOrder(BasicBlock* block) { |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 61 | block->visited = true; |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 62 | /* Enqueue the pre_order block id */ |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 63 | if (block->id != NullBasicBlockId) { |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 64 | dfs_order_.push_back(block->id); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 65 | } |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 66 | } |
| 67 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 68 | void MIRGraph::RecordDFSOrders(BasicBlock* block) { |
Vladimir Marko | c9360ce | 2014-06-05 20:09:47 +0100 | [diff] [blame] | 69 | DCHECK(temp_scoped_alloc_.get() != nullptr); |
| 70 | ScopedArenaVector<BasicBlock*> succ(temp_scoped_alloc_->Adapter()); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 71 | MarkPreOrder(block); |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 72 | succ.push_back(block); |
| 73 | while (!succ.empty()) { |
| 74 | BasicBlock* curr = succ.back(); |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 75 | BasicBlock* next_successor = NextUnvisitedSuccessor(curr); |
| 76 | if (next_successor != NULL) { |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 77 | MarkPreOrder(next_successor); |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 78 | succ.push_back(next_successor); |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 79 | continue; |
| 80 | } |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 81 | curr->dfs_id = dfs_post_order_.size(); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 82 | if (curr->id != NullBasicBlockId) { |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 83 | dfs_post_order_.push_back(curr->id); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 84 | } |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 85 | succ.pop_back(); |
| 86 | } |
| 87 | } |
| 88 | |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 89 | /* Sort the blocks by the Depth-First-Search */ |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 90 | void MIRGraph::ComputeDFSOrders() { |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 91 | /* Clear the DFS pre-order and post-order lists. */ |
| 92 | dfs_order_.clear(); |
| 93 | dfs_order_.reserve(GetNumBlocks()); |
| 94 | dfs_post_order_.clear(); |
| 95 | dfs_post_order_.reserve(GetNumBlocks()); |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 96 | |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 97 | // Reset visited flags from all nodes |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 98 | ClearAllVisitedFlags(); |
| 99 | |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 100 | // Record dfs orders |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 101 | RecordDFSOrders(GetEntryBlock()); |
buzbee | e5f0122 | 2012-06-14 15:19:35 -0700 | [diff] [blame] | 102 | |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 103 | num_reachable_blocks_ = dfs_order_.size(); |
Andreas Gampe | 4439596 | 2014-06-13 13:44:40 -0700 | [diff] [blame] | 104 | |
| 105 | if (num_reachable_blocks_ != num_blocks_) { |
| 106 | // Hide all unreachable blocks. |
| 107 | AllNodesIterator iter(this); |
| 108 | for (BasicBlock* bb = iter.Next(); bb != NULL; bb = iter.Next()) { |
| 109 | if (!bb->visited) { |
| 110 | bb->Hide(cu_); |
| 111 | } |
| 112 | } |
| 113 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 114 | } |
| 115 | |
| 116 | /* |
| 117 | * Mark block bit on the per-Dalvik register vector to denote that Dalvik |
| 118 | * register idx is defined in BasicBlock bb. |
| 119 | */ |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 120 | bool MIRGraph::FillDefBlockMatrix(BasicBlock* bb) { |
Brian Carlstrom | 0cd7ec2 | 2013-07-17 23:40:20 -0700 | [diff] [blame] | 121 | if (bb->data_flow_info == NULL) { |
| 122 | return false; |
| 123 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 124 | |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 125 | for (uint32_t idx : bb->data_flow_info->def_v->Indexes()) { |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 126 | /* Block bb defines register idx */ |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 127 | def_block_matrix_[idx]->SetBit(bb->id); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 128 | } |
| 129 | return true; |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 130 | } |
| 131 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 132 | void MIRGraph::ComputeDefBlockMatrix() { |
Razvan A Lupusoru | 8d0d03e | 2014-06-06 17:04:52 -0700 | [diff] [blame] | 133 | int num_registers = GetNumOfCodeAndTempVRs(); |
| 134 | /* Allocate num_registers bit vector pointers */ |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 135 | def_block_matrix_ = static_cast<ArenaBitVector**> |
Mathieu Chartier | f6c4b3b | 2013-08-24 16:11:37 -0700 | [diff] [blame] | 136 | (arena_->Alloc(sizeof(ArenaBitVector *) * num_registers, |
Vladimir Marko | 83cc7ae | 2014-02-12 18:02:05 +0000 | [diff] [blame] | 137 | kArenaAllocDFInfo)); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 138 | int i; |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 139 | |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 140 | /* Initialize num_register vectors with num_blocks bits each */ |
| 141 | for (i = 0; i < num_registers; i++) { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 142 | def_block_matrix_[i] = |
| 143 | new (arena_) ArenaBitVector(arena_, GetNumBlocks(), false, kBitMapBMatrix); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 144 | } |
Razvan A Lupusoru | 8d0d03e | 2014-06-06 17:04:52 -0700 | [diff] [blame] | 145 | |
buzbee | 56c7178 | 2013-09-05 17:13:19 -0700 | [diff] [blame] | 146 | AllNodesIterator iter(this); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 147 | for (BasicBlock* bb = iter.Next(); bb != NULL; bb = iter.Next()) { |
| 148 | FindLocalLiveIn(bb); |
| 149 | } |
buzbee | 56c7178 | 2013-09-05 17:13:19 -0700 | [diff] [blame] | 150 | AllNodesIterator iter2(this); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 151 | for (BasicBlock* bb = iter2.Next(); bb != NULL; bb = iter2.Next()) { |
| 152 | FillDefBlockMatrix(bb); |
| 153 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 154 | |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 155 | /* |
| 156 | * Also set the incoming parameters as defs in the entry block. |
| 157 | * Only need to handle the parameters for the outer method. |
| 158 | */ |
Razvan A Lupusoru | 8d0d03e | 2014-06-06 17:04:52 -0700 | [diff] [blame] | 159 | int num_regs = GetNumOfCodeVRs(); |
| 160 | int in_reg = GetFirstInVR(); |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 161 | for (; in_reg < num_regs; in_reg++) { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 162 | def_block_matrix_[in_reg]->SetBit(GetEntryBlock()->id); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 163 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 164 | } |
| 165 | |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 166 | void MIRGraph::ComputeDomPostOrderTraversal(BasicBlock* bb) { |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 167 | // Clear the dominator post-order list. |
| 168 | dom_post_order_traversal_.clear(); |
| 169 | dom_post_order_traversal_.reserve(num_reachable_blocks_); |
| 170 | |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 171 | ClearAllVisitedFlags(); |
Vladimir Marko | c9360ce | 2014-06-05 20:09:47 +0100 | [diff] [blame] | 172 | DCHECK(temp_scoped_alloc_.get() != nullptr); |
| 173 | ScopedArenaVector<std::pair<BasicBlock*, ArenaBitVector::IndexIterator>> work_stack( |
| 174 | temp_scoped_alloc_->Adapter()); |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 175 | bb->visited = true; |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 176 | work_stack.push_back(std::make_pair(bb, bb->i_dominated->Indexes().begin())); |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 177 | while (!work_stack.empty()) { |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 178 | std::pair<BasicBlock*, ArenaBitVector::IndexIterator>* curr = &work_stack.back(); |
| 179 | BasicBlock* curr_bb = curr->first; |
| 180 | ArenaBitVector::IndexIterator* curr_idom_iter = &curr->second; |
| 181 | while (!curr_idom_iter->Done() && (NeedsVisit(GetBasicBlock(**curr_idom_iter)) == nullptr)) { |
| 182 | ++*curr_idom_iter; |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 183 | } |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 184 | // NOTE: work_stack.push_back()/pop_back() invalidate curr and curr_idom_iter. |
| 185 | if (!curr_idom_iter->Done()) { |
| 186 | BasicBlock* new_bb = GetBasicBlock(**curr_idom_iter); |
| 187 | ++*curr_idom_iter; |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 188 | new_bb->visited = true; |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 189 | work_stack.push_back(std::make_pair(new_bb, new_bb->i_dominated->Indexes().begin())); |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 190 | } else { |
| 191 | // no successor/next |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 192 | if (curr_bb->id != NullBasicBlockId) { |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 193 | dom_post_order_traversal_.push_back(curr_bb->id); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 194 | } |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 195 | work_stack.pop_back(); |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 196 | |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 197 | /* hacky loop detection */ |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 198 | if ((curr_bb->taken != NullBasicBlockId) && curr_bb->dominators->IsBitSet(curr_bb->taken)) { |
Bill Buzbee | 0b1191c | 2013-10-28 22:11:59 +0000 | [diff] [blame] | 199 | curr_bb->nesting_depth++; |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 200 | attributes_ |= METHOD_HAS_LOOP; |
| 201 | } |
| 202 | } |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 203 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 204 | } |
| 205 | |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 206 | void MIRGraph::CheckForDominanceFrontier(BasicBlock* dom_bb, |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 207 | const BasicBlock* succ_bb) { |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 208 | /* |
| 209 | * TODO - evaluate whether phi will ever need to be inserted into exit |
| 210 | * blocks. |
| 211 | */ |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 212 | if (succ_bb->i_dom != dom_bb->id && |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 213 | succ_bb->block_type == kDalvikByteCode && |
| 214 | succ_bb->hidden == false) { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 215 | dom_bb->dom_frontier->SetBit(succ_bb->id); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 216 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 217 | } |
| 218 | |
| 219 | /* Worker function to compute the dominance frontier */ |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 220 | bool MIRGraph::ComputeDominanceFrontier(BasicBlock* bb) { |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 221 | /* Calculate DF_local */ |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 222 | if (bb->taken != NullBasicBlockId) { |
| 223 | CheckForDominanceFrontier(bb, GetBasicBlock(bb->taken)); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 224 | } |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 225 | if (bb->fall_through != NullBasicBlockId) { |
| 226 | CheckForDominanceFrontier(bb, GetBasicBlock(bb->fall_through)); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 227 | } |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 228 | if (bb->successor_block_list_type != kNotUsed) { |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 229 | for (SuccessorBlockInfo* successor_block_info : bb->successor_blocks) { |
| 230 | BasicBlock* succ_bb = GetBasicBlock(successor_block_info->block); |
| 231 | CheckForDominanceFrontier(bb, succ_bb); |
| 232 | } |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 233 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 234 | |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 235 | /* Calculate DF_up */ |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 236 | for (uint32_t dominated_idx : bb->i_dominated->Indexes()) { |
Jean Christophe Beyler | 2469e60 | 2014-05-06 20:36:55 -0700 | [diff] [blame] | 237 | BasicBlock* dominated_bb = GetBasicBlock(dominated_idx); |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 238 | for (uint32_t df_up_block_idx : dominated_bb->dom_frontier->Indexes()) { |
Jean Christophe Beyler | 2469e60 | 2014-05-06 20:36:55 -0700 | [diff] [blame] | 239 | BasicBlock* df_up_block = GetBasicBlock(df_up_block_idx); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 240 | CheckForDominanceFrontier(bb, df_up_block); |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 241 | } |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 242 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 243 | |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 244 | return true; |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 245 | } |
| 246 | |
| 247 | /* Worker function for initializing domination-related data structures */ |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 248 | void MIRGraph::InitializeDominationInfo(BasicBlock* bb) { |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 249 | int num_total_blocks = GetBasicBlockListCount(); |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 250 | |
Brian Carlstrom | df62950 | 2013-07-17 22:39:56 -0700 | [diff] [blame] | 251 | if (bb->dominators == NULL) { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 252 | bb->dominators = new (arena_) ArenaBitVector(arena_, num_total_blocks, |
Jean Christophe Beyler | 007a065 | 2014-09-05 16:06:42 -0700 | [diff] [blame] | 253 | true /* expandable */, kBitMapDominators); |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 254 | bb->i_dominated = new (arena_) ArenaBitVector(arena_, num_total_blocks, |
Jean Christophe Beyler | 007a065 | 2014-09-05 16:06:42 -0700 | [diff] [blame] | 255 | true /* expandable */, kBitMapIDominated); |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 256 | bb->dom_frontier = new (arena_) ArenaBitVector(arena_, num_total_blocks, |
Jean Christophe Beyler | 007a065 | 2014-09-05 16:06:42 -0700 | [diff] [blame] | 257 | true /* expandable */, kBitMapDomFrontier); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 258 | } else { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 259 | bb->dominators->ClearAllBits(); |
| 260 | bb->i_dominated->ClearAllBits(); |
| 261 | bb->dom_frontier->ClearAllBits(); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 262 | } |
| 263 | /* Set all bits in the dominator vector */ |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 264 | bb->dominators->SetInitialBits(num_total_blocks); |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 265 | |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 266 | return; |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 267 | } |
| 268 | |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 269 | /* |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 270 | * Walk through the ordered i_dom list until we reach common parent. |
| 271 | * Given the ordering of i_dom_list, this common parent represents the |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 272 | * last element of the intersection of block1 and block2 dominators. |
| 273 | */ |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 274 | int MIRGraph::FindCommonParent(int block1, int block2) { |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 275 | while (block1 != block2) { |
| 276 | while (block1 < block2) { |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 277 | block1 = i_dom_list_[block1]; |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 278 | DCHECK_NE(block1, NOTVISITED); |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 279 | } |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 280 | while (block2 < block1) { |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 281 | block2 = i_dom_list_[block2]; |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 282 | DCHECK_NE(block2, NOTVISITED); |
| 283 | } |
| 284 | } |
| 285 | return block1; |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 286 | } |
| 287 | |
| 288 | /* Worker function to compute each block's immediate dominator */ |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 289 | bool MIRGraph::ComputeblockIDom(BasicBlock* bb) { |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 290 | /* Special-case entry block */ |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 291 | if ((bb->id == NullBasicBlockId) || (bb == GetEntryBlock())) { |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 292 | return false; |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 293 | } |
| 294 | |
| 295 | /* Iterate through the predecessors */ |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 296 | auto it = bb->predecessors.begin(), end = bb->predecessors.end(); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 297 | |
| 298 | /* Find the first processed predecessor */ |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 299 | int idom = -1; |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 300 | for ( ; ; ++it) { |
| 301 | CHECK(it != end); |
| 302 | BasicBlock* pred_bb = GetBasicBlock(*it); |
| 303 | DCHECK(pred_bb != nullptr); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 304 | if (i_dom_list_[pred_bb->dfs_id] != NOTVISITED) { |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 305 | idom = pred_bb->dfs_id; |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 306 | break; |
| 307 | } |
| 308 | } |
| 309 | |
| 310 | /* Scan the rest of the predecessors */ |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 311 | for ( ; it != end; ++it) { |
| 312 | BasicBlock* pred_bb = GetBasicBlock(*it); |
| 313 | DCHECK(pred_bb != nullptr); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 314 | if (i_dom_list_[pred_bb->dfs_id] == NOTVISITED) { |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 315 | continue; |
| 316 | } else { |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 317 | idom = FindCommonParent(pred_bb->dfs_id, idom); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 318 | } |
| 319 | } |
| 320 | |
| 321 | DCHECK_NE(idom, NOTVISITED); |
| 322 | |
| 323 | /* Did something change? */ |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 324 | if (i_dom_list_[bb->dfs_id] != idom) { |
| 325 | i_dom_list_[bb->dfs_id] = idom; |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 326 | return true; |
| 327 | } |
| 328 | return false; |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 329 | } |
| 330 | |
| 331 | /* Worker function to compute each block's domintors */ |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 332 | bool MIRGraph::ComputeBlockDominators(BasicBlock* bb) { |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 333 | if (bb == GetEntryBlock()) { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 334 | bb->dominators->ClearAllBits(); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 335 | } else { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 336 | bb->dominators->Copy(GetBasicBlock(bb->i_dom)->dominators); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 337 | } |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 338 | bb->dominators->SetBit(bb->id); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 339 | return false; |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 340 | } |
| 341 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 342 | bool MIRGraph::SetDominators(BasicBlock* bb) { |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 343 | if (bb != GetEntryBlock()) { |
| 344 | int idom_dfs_idx = i_dom_list_[bb->dfs_id]; |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 345 | DCHECK_NE(idom_dfs_idx, NOTVISITED); |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 346 | int i_dom_idx = dfs_post_order_[idom_dfs_idx]; |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 347 | BasicBlock* i_dom = GetBasicBlock(i_dom_idx); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 348 | bb->i_dom = i_dom->id; |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 349 | /* Add bb to the i_dominated set of the immediate dominator block */ |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 350 | i_dom->i_dominated->SetBit(bb->id); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 351 | } |
| 352 | return false; |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 353 | } |
| 354 | |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 355 | /* Compute dominators, immediate dominator, and dominance fronter */ |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 356 | void MIRGraph::ComputeDominators() { |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 357 | int num_reachable_blocks = num_reachable_blocks_; |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 358 | |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 359 | /* Initialize domination-related data structures */ |
buzbee | 56c7178 | 2013-09-05 17:13:19 -0700 | [diff] [blame] | 360 | PreOrderDfsIterator iter(this); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 361 | for (BasicBlock* bb = iter.Next(); bb != NULL; bb = iter.Next()) { |
| 362 | InitializeDominationInfo(bb); |
| 363 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 364 | |
Jean Christophe Beyler | 4896d7b | 2014-05-01 15:36:22 -0700 | [diff] [blame] | 365 | /* Initialize & Clear i_dom_list */ |
| 366 | if (max_num_reachable_blocks_ < num_reachable_blocks_) { |
Mathieu Chartier | f6c4b3b | 2013-08-24 16:11:37 -0700 | [diff] [blame] | 367 | i_dom_list_ = static_cast<int*>(arena_->Alloc(sizeof(int) * num_reachable_blocks, |
Vladimir Marko | 83cc7ae | 2014-02-12 18:02:05 +0000 | [diff] [blame] | 368 | kArenaAllocDFInfo)); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 369 | } |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 370 | for (int i = 0; i < num_reachable_blocks; i++) { |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 371 | i_dom_list_[i] = NOTVISITED; |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 372 | } |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 373 | |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 374 | /* For post-order, last block is entry block. Set its i_dom to istelf */ |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 375 | DCHECK_EQ(GetEntryBlock()->dfs_id, num_reachable_blocks-1); |
| 376 | i_dom_list_[GetEntryBlock()->dfs_id] = GetEntryBlock()->dfs_id; |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 377 | |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 378 | /* Compute the immediate dominators */ |
buzbee | 56c7178 | 2013-09-05 17:13:19 -0700 | [diff] [blame] | 379 | RepeatingReversePostOrderDfsIterator iter2(this); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 380 | bool change = false; |
| 381 | for (BasicBlock* bb = iter2.Next(false); bb != NULL; bb = iter2.Next(change)) { |
| 382 | change = ComputeblockIDom(bb); |
| 383 | } |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 384 | |
| 385 | /* Set the dominator for the root node */ |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 386 | GetEntryBlock()->dominators->ClearAllBits(); |
| 387 | GetEntryBlock()->dominators->SetBit(GetEntryBlock()->id); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 388 | |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 389 | GetEntryBlock()->i_dom = 0; |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 390 | |
buzbee | 56c7178 | 2013-09-05 17:13:19 -0700 | [diff] [blame] | 391 | PreOrderDfsIterator iter3(this); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 392 | for (BasicBlock* bb = iter3.Next(); bb != NULL; bb = iter3.Next()) { |
| 393 | SetDominators(bb); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 394 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 395 | |
buzbee | 56c7178 | 2013-09-05 17:13:19 -0700 | [diff] [blame] | 396 | ReversePostOrderDfsIterator iter4(this); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 397 | for (BasicBlock* bb = iter4.Next(); bb != NULL; bb = iter4.Next()) { |
| 398 | ComputeBlockDominators(bb); |
| 399 | } |
buzbee | 5b53710 | 2012-01-17 17:33:47 -0800 | [diff] [blame] | 400 | |
buzbee | a5abf70 | 2013-04-12 14:39:29 -0700 | [diff] [blame] | 401 | // Compute the dominance frontier for each block. |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 402 | ComputeDomPostOrderTraversal(GetEntryBlock()); |
buzbee | 56c7178 | 2013-09-05 17:13:19 -0700 | [diff] [blame] | 403 | PostOrderDOMIterator iter5(this); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 404 | for (BasicBlock* bb = iter5.Next(); bb != NULL; bb = iter5.Next()) { |
| 405 | ComputeDominanceFrontier(bb); |
| 406 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 407 | } |
| 408 | |
| 409 | /* |
| 410 | * Perform dest U= src1 ^ ~src2 |
| 411 | * This is probably not general enough to be placed in BitVector.[ch]. |
| 412 | */ |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 413 | void MIRGraph::ComputeSuccLineIn(ArenaBitVector* dest, const ArenaBitVector* src1, |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 414 | const ArenaBitVector* src2) { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 415 | if (dest->GetStorageSize() != src1->GetStorageSize() || |
| 416 | dest->GetStorageSize() != src2->GetStorageSize() || |
| 417 | dest->IsExpandable() != src1->IsExpandable() || |
| 418 | dest->IsExpandable() != src2->IsExpandable()) { |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 419 | LOG(FATAL) << "Incompatible set properties"; |
| 420 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 421 | |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 422 | unsigned int idx; |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 423 | for (idx = 0; idx < dest->GetStorageSize(); idx++) { |
| 424 | dest->GetRawStorage()[idx] |= src1->GetRawStorageWord(idx) & ~(src2->GetRawStorageWord(idx)); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 425 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 426 | } |
| 427 | |
| 428 | /* |
| 429 | * Iterate through all successor blocks and propagate up the live-in sets. |
| 430 | * The calculated result is used for phi-node pruning - where we only need to |
| 431 | * insert a phi node if the variable is live-in to the block. |
| 432 | */ |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 433 | bool MIRGraph::ComputeBlockLiveIns(BasicBlock* bb) { |
Razvan A Lupusoru | 8d0d03e | 2014-06-06 17:04:52 -0700 | [diff] [blame] | 434 | DCHECK_EQ(temp_bit_vector_size_, cu_->mir_graph.get()->GetNumOfCodeAndTempVRs()); |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 435 | ArenaBitVector* temp_dalvik_register_v = temp_bit_vector_; |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 436 | |
Brian Carlstrom | 0cd7ec2 | 2013-07-17 23:40:20 -0700 | [diff] [blame] | 437 | if (bb->data_flow_info == NULL) { |
| 438 | return false; |
| 439 | } |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 440 | temp_dalvik_register_v->Copy(bb->data_flow_info->live_in_v); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 441 | BasicBlock* bb_taken = GetBasicBlock(bb->taken); |
| 442 | BasicBlock* bb_fall_through = GetBasicBlock(bb->fall_through); |
| 443 | if (bb_taken && bb_taken->data_flow_info) |
| 444 | ComputeSuccLineIn(temp_dalvik_register_v, bb_taken->data_flow_info->live_in_v, |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 445 | bb->data_flow_info->def_v); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 446 | if (bb_fall_through && bb_fall_through->data_flow_info) |
| 447 | ComputeSuccLineIn(temp_dalvik_register_v, bb_fall_through->data_flow_info->live_in_v, |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 448 | bb->data_flow_info->def_v); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 449 | if (bb->successor_block_list_type != kNotUsed) { |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 450 | for (SuccessorBlockInfo* successor_block_info : bb->successor_blocks) { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 451 | BasicBlock* succ_bb = GetBasicBlock(successor_block_info->block); |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 452 | if (succ_bb->data_flow_info) { |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 453 | ComputeSuccLineIn(temp_dalvik_register_v, succ_bb->data_flow_info->live_in_v, |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 454 | bb->data_flow_info->def_v); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 455 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 456 | } |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 457 | } |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 458 | if (!temp_dalvik_register_v->Equal(bb->data_flow_info->live_in_v)) { |
| 459 | bb->data_flow_info->live_in_v->Copy(temp_dalvik_register_v); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 460 | return true; |
| 461 | } |
| 462 | return false; |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 463 | } |
| 464 | |
| 465 | /* Insert phi nodes to for each variable to the dominance frontiers */ |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 466 | void MIRGraph::InsertPhiNodes() { |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 467 | int dalvik_reg; |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 468 | ArenaBitVector* phi_blocks = new (temp_scoped_alloc_.get()) ArenaBitVector( |
| 469 | temp_scoped_alloc_.get(), GetNumBlocks(), false, kBitMapPhi); |
| 470 | ArenaBitVector* input_blocks = new (temp_scoped_alloc_.get()) ArenaBitVector( |
| 471 | temp_scoped_alloc_.get(), GetNumBlocks(), false, kBitMapInputBlocks); |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 472 | |
buzbee | 56c7178 | 2013-09-05 17:13:19 -0700 | [diff] [blame] | 473 | RepeatingPostOrderDfsIterator iter(this); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 474 | bool change = false; |
| 475 | for (BasicBlock* bb = iter.Next(false); bb != NULL; bb = iter.Next(change)) { |
| 476 | change = ComputeBlockLiveIns(bb); |
| 477 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 478 | |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 479 | /* Iterate through each Dalvik register */ |
Razvan A Lupusoru | 8d0d03e | 2014-06-06 17:04:52 -0700 | [diff] [blame] | 480 | for (dalvik_reg = GetNumOfCodeAndTempVRs() - 1; dalvik_reg >= 0; dalvik_reg--) { |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 481 | input_blocks->Copy(def_block_matrix_[dalvik_reg]); |
| 482 | phi_blocks->ClearAllBits(); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 483 | do { |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 484 | // TUNING: When we repeat this, we could skip indexes from the previous pass. |
| 485 | for (uint32_t idx : input_blocks->Indexes()) { |
Brian Carlstrom | 0cd7ec2 | 2013-07-17 23:40:20 -0700 | [diff] [blame] | 486 | BasicBlock* def_bb = GetBasicBlock(idx); |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 487 | if (def_bb->dom_frontier != nullptr) { |
| 488 | phi_blocks->Union(def_bb->dom_frontier); |
Brian Carlstrom | 0cd7ec2 | 2013-07-17 23:40:20 -0700 | [diff] [blame] | 489 | } |
| 490 | } |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 491 | } while (input_blocks->Union(phi_blocks)); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 492 | |
| 493 | /* |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 494 | * Insert a phi node for dalvik_reg in the phi_blocks if the Dalvik |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 495 | * register is in the live-in set. |
| 496 | */ |
Vladimir Marko | a5b8fde | 2014-05-23 15:16:44 +0100 | [diff] [blame] | 497 | for (uint32_t idx : phi_blocks->Indexes()) { |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 498 | BasicBlock* phi_bb = GetBasicBlock(idx); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 499 | /* Variable will be clobbered before being used - no need for phi */ |
Brian Carlstrom | 0cd7ec2 | 2013-07-17 23:40:20 -0700 | [diff] [blame] | 500 | if (!phi_bb->data_flow_info->live_in_v->IsBitSet(dalvik_reg)) { |
| 501 | continue; |
| 502 | } |
Jean Christophe Beyler | 3aa5773 | 2014-04-17 12:47:24 -0700 | [diff] [blame] | 503 | MIR *phi = NewMIR(); |
buzbee | cbd6d44 | 2012-11-17 14:11:25 -0800 | [diff] [blame] | 504 | phi->dalvikInsn.opcode = static_cast<Instruction::Code>(kMirOpPhi); |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 505 | phi->dalvikInsn.vA = dalvik_reg; |
| 506 | phi->offset = phi_bb->start_offset; |
Brian Carlstrom | 7934ac2 | 2013-07-26 10:54:15 -0700 | [diff] [blame] | 507 | phi->m_unit_index = 0; // Arbitrarily assign all Phi nodes to outermost method. |
Jean Christophe Beyler | cdacac4 | 2014-03-13 14:54:59 -0700 | [diff] [blame] | 508 | phi_bb->PrependMIR(phi); |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 509 | } |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 510 | } |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 511 | } |
| 512 | |
| 513 | /* |
| 514 | * Worker function to insert phi-operands with latest SSA names from |
| 515 | * predecessor blocks |
| 516 | */ |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 517 | bool MIRGraph::InsertPhiNodeOperands(BasicBlock* bb) { |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 518 | /* Phi nodes are at the beginning of each block */ |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 519 | for (MIR* mir = bb->first_mir_insn; mir != NULL; mir = mir->next) { |
buzbee | cbd6d44 | 2012-11-17 14:11:25 -0800 | [diff] [blame] | 520 | if (mir->dalvikInsn.opcode != static_cast<Instruction::Code>(kMirOpPhi)) |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 521 | return true; |
buzbee | fa57c47 | 2012-11-21 12:06:18 -0800 | [diff] [blame] | 522 | int ssa_reg = mir->ssa_rep->defs[0]; |
| 523 | DCHECK_GE(ssa_reg, 0); // Shouldn't see compiler temps here |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 524 | int v_reg = SRegToVReg(ssa_reg); |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 525 | |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 526 | /* Iterate through the predecessors */ |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 527 | size_t num_uses = bb->predecessors.size(); |
Jean Christophe Beyler | 4896d7b | 2014-05-01 15:36:22 -0700 | [diff] [blame] | 528 | AllocateSSAUseData(mir, num_uses); |
| 529 | int* uses = mir->ssa_rep->uses; |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 530 | BasicBlockId* incoming = |
| 531 | static_cast<BasicBlockId*>(arena_->Alloc(sizeof(BasicBlockId) * num_uses, |
Vladimir Marko | 83cc7ae | 2014-02-12 18:02:05 +0000 | [diff] [blame] | 532 | kArenaAllocDFInfo)); |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 533 | mir->meta.phi_incoming = incoming; |
| 534 | int idx = 0; |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 535 | for (BasicBlockId pred_id : bb->predecessors) { |
| 536 | BasicBlock* pred_bb = GetBasicBlock(pred_id); |
| 537 | DCHECK(pred_bb != nullptr); |
Jean Christophe Beyler | 4896d7b | 2014-05-01 15:36:22 -0700 | [diff] [blame] | 538 | int ssa_reg = pred_bb->data_flow_info->vreg_to_ssa_map_exit[v_reg]; |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 539 | uses[idx] = ssa_reg; |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 540 | incoming[idx] = pred_id; |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 541 | idx++; |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 542 | } |
| 543 | } |
| 544 | |
| 545 | return true; |
buzbee | 67bf885 | 2011-08-17 17:51:35 -0700 | [diff] [blame] | 546 | } |
| 547 | |
Brian Carlstrom | 2ce745c | 2013-07-17 17:44:30 -0700 | [diff] [blame] | 548 | void MIRGraph::DoDFSPreOrderSSARename(BasicBlock* block) { |
Brian Carlstrom | 0cd7ec2 | 2013-07-17 23:40:20 -0700 | [diff] [blame] | 549 | if (block->visited || block->hidden) { |
| 550 | return; |
| 551 | } |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 552 | block->visited = true; |
buzbee | f0cde54 | 2011-09-13 14:55:02 -0700 | [diff] [blame] | 553 | |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 554 | /* Process this block */ |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 555 | DoSSAConversion(block); |
Razvan A Lupusoru | 8d0d03e | 2014-06-06 17:04:52 -0700 | [diff] [blame] | 556 | int map_size = sizeof(int) * GetNumOfCodeAndTempVRs(); |
buzbee | f0cde54 | 2011-09-13 14:55:02 -0700 | [diff] [blame] | 557 | |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 558 | /* Save SSA map snapshot */ |
Vladimir Marko | 5d47447 | 2014-03-21 17:10:58 +0000 | [diff] [blame] | 559 | ScopedArenaAllocator allocator(&cu_->arena_stack); |
buzbee | 862a760 | 2013-04-05 10:58:54 -0700 | [diff] [blame] | 560 | int* saved_ssa_map = |
Vladimir Marko | 5d47447 | 2014-03-21 17:10:58 +0000 | [diff] [blame] | 561 | static_cast<int*>(allocator.Alloc(map_size, kArenaAllocDalvikToSSAMap)); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 562 | memcpy(saved_ssa_map, vreg_to_ssa_map_, map_size); |
buzbee | f0cde54 | 2011-09-13 14:55:02 -0700 | [diff] [blame] | 563 | |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 564 | if (block->fall_through != NullBasicBlockId) { |
| 565 | DoDFSPreOrderSSARename(GetBasicBlock(block->fall_through)); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 566 | /* Restore SSA map snapshot */ |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 567 | memcpy(vreg_to_ssa_map_, saved_ssa_map, map_size); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 568 | } |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 569 | if (block->taken != NullBasicBlockId) { |
| 570 | DoDFSPreOrderSSARename(GetBasicBlock(block->taken)); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 571 | /* Restore SSA map snapshot */ |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 572 | memcpy(vreg_to_ssa_map_, saved_ssa_map, map_size); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 573 | } |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 574 | if (block->successor_block_list_type != kNotUsed) { |
Vladimir Marko | e39c54e | 2014-09-22 14:50:02 +0100 | [diff] [blame] | 575 | for (SuccessorBlockInfo* successor_block_info : block->successor_blocks) { |
buzbee | 0d82948 | 2013-10-11 15:24:55 -0700 | [diff] [blame] | 576 | BasicBlock* succ_bb = GetBasicBlock(successor_block_info->block); |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 577 | DoDFSPreOrderSSARename(succ_bb); |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 578 | /* Restore SSA map snapshot */ |
buzbee | 311ca16 | 2013-02-28 15:56:43 -0800 | [diff] [blame] | 579 | memcpy(vreg_to_ssa_map_, saved_ssa_map, map_size); |
buzbee | f0cde54 | 2011-09-13 14:55:02 -0700 | [diff] [blame] | 580 | } |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 581 | } |
Bill Buzbee | a114add | 2012-05-03 15:00:40 -0700 | [diff] [blame] | 582 | return; |
buzbee | f0cde54 | 2011-09-13 14:55:02 -0700 | [diff] [blame] | 583 | } |
| 584 | |
Elliott Hughes | 11d1b0c | 2012-01-23 16:57:47 -0800 | [diff] [blame] | 585 | } // namespace art |