Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1 | //===- GVNPRE.cpp - Eliminate redundant values and expressions ------------===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file was developed by the Owen Anderson and is distributed under |
| 6 | // the University of Illinois Open Source License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
| 10 | // This pass performs a hybrid of global value numbering and partial redundancy |
| 11 | // elimination, known as GVN-PRE. It performs partial redundancy elimination on |
| 12 | // values, rather than lexical expressions, allowing a more comprehensive view |
| 13 | // the optimization. It replaces redundant values with uses of earlier |
| 14 | // occurences of the same value. While this is beneficial in that it eliminates |
| 15 | // unneeded computation, it also increases register pressure by creating large |
Owen Anderson | a7f916c | 2007-06-08 20:57:08 +0000 | [diff] [blame] | 16 | // live ranges, and should be used with caution on platforms that are very |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 17 | // sensitive to register pressure. |
| 18 | // |
| 19 | //===----------------------------------------------------------------------===// |
| 20 | |
| 21 | #define DEBUG_TYPE "gvnpre" |
| 22 | #include "llvm/Value.h" |
| 23 | #include "llvm/Transforms/Scalar.h" |
| 24 | #include "llvm/Instructions.h" |
| 25 | #include "llvm/Function.h" |
| 26 | #include "llvm/Analysis/Dominators.h" |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 27 | #include "llvm/ADT/BitVector.h" |
Owen Anderson | 4f703ec | 2007-06-19 23:23:54 +0000 | [diff] [blame] | 28 | #include "llvm/ADT/DenseMap.h" |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 29 | #include "llvm/ADT/DepthFirstIterator.h" |
Owen Anderson | 9030d38 | 2007-06-25 18:25:31 +0000 | [diff] [blame] | 30 | #include "llvm/ADT/PostOrderIterator.h" |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 31 | #include "llvm/ADT/SmallPtrSet.h" |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 32 | #include "llvm/ADT/Statistic.h" |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 33 | #include "llvm/Support/CFG.h" |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 34 | #include "llvm/Support/Compiler.h" |
Owen Anderson | cdf8efd | 2007-05-29 23:15:21 +0000 | [diff] [blame] | 35 | #include "llvm/Support/Debug.h" |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 36 | #include <algorithm> |
Owen Anderson | 243f348 | 2007-05-31 22:44:11 +0000 | [diff] [blame] | 37 | #include <deque> |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 38 | #include <map> |
Owen Anderson | 243f348 | 2007-05-31 22:44:11 +0000 | [diff] [blame] | 39 | #include <vector> |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 40 | #include <set> |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 41 | using namespace llvm; |
| 42 | |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 43 | //===----------------------------------------------------------------------===// |
| 44 | // ValueTable Class |
| 45 | //===----------------------------------------------------------------------===// |
| 46 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 47 | /// This class holds the mapping between values and value numbers. It is used |
| 48 | /// as an efficient mechanism to determine the expression-wise equivalence of |
| 49 | /// two values. |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 50 | |
| 51 | namespace { |
| 52 | class VISIBILITY_HIDDEN ValueTable { |
| 53 | public: |
| 54 | struct Expression { |
| 55 | enum ExpressionOpcode { ADD, SUB, MUL, UDIV, SDIV, FDIV, UREM, SREM, |
| 56 | FREM, SHL, LSHR, ASHR, AND, OR, XOR, ICMPEQ, |
| 57 | ICMPNE, ICMPUGT, ICMPUGE, ICMPULT, ICMPULE, |
| 58 | ICMPSGT, ICMPSGE, ICMPSLT, ICMPSLE, FCMPOEQ, |
| 59 | FCMPOGT, FCMPOGE, FCMPOLT, FCMPOLE, FCMPONE, |
| 60 | FCMPORD, FCMPUNO, FCMPUEQ, FCMPUGT, FCMPUGE, |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 61 | FCMPULT, FCMPULE, FCMPUNE, EXTRACT, INSERT, |
| 62 | SHUFFLE }; |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 63 | |
| 64 | ExpressionOpcode opcode; |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 65 | uint32_t firstVN; |
| 66 | uint32_t secondVN; |
| 67 | uint32_t thirdVN; |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 68 | |
| 69 | bool operator< (const Expression& other) const { |
| 70 | if (opcode < other.opcode) |
| 71 | return true; |
| 72 | else if (opcode > other.opcode) |
| 73 | return false; |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 74 | else if (firstVN < other.firstVN) |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 75 | return true; |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 76 | else if (firstVN > other.firstVN) |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 77 | return false; |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 78 | else if (secondVN < other.secondVN) |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 79 | return true; |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 80 | else if (secondVN > other.secondVN) |
| 81 | return false; |
| 82 | else if (thirdVN < other.thirdVN) |
| 83 | return true; |
| 84 | else if (thirdVN > other.thirdVN) |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 85 | return false; |
| 86 | else |
| 87 | return false; |
Owen Anderson | 65d2862 | 2007-06-12 00:50:47 +0000 | [diff] [blame] | 88 | } |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 89 | }; |
| 90 | |
| 91 | private: |
Owen Anderson | 4f703ec | 2007-06-19 23:23:54 +0000 | [diff] [blame] | 92 | DenseMap<Value*, uint32_t> valueNumbering; |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 93 | std::map<Expression, uint32_t> expressionNumbering; |
| 94 | |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 95 | uint32_t nextValueNumber; |
| 96 | |
| 97 | Expression::ExpressionOpcode getOpcode(BinaryOperator* BO); |
| 98 | Expression::ExpressionOpcode getOpcode(CmpInst* C); |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 99 | Expression create_expression(BinaryOperator* BO); |
| 100 | Expression create_expression(CmpInst* C); |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 101 | Expression create_expression(ShuffleVectorInst* V); |
| 102 | Expression create_expression(ExtractElementInst* C); |
| 103 | Expression create_expression(InsertElementInst* V); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 104 | public: |
| 105 | ValueTable() { nextValueNumber = 1; } |
| 106 | uint32_t lookup_or_add(Value* V); |
| 107 | uint32_t lookup(Value* V); |
| 108 | void add(Value* V, uint32_t num); |
| 109 | void clear(); |
Owen Anderson | 20cb51f | 2007-06-19 05:37:32 +0000 | [diff] [blame] | 110 | void erase(Value* v); |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 111 | unsigned size(); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 112 | }; |
| 113 | } |
| 114 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 115 | //===----------------------------------------------------------------------===// |
| 116 | // ValueTable Internal Functions |
| 117 | //===----------------------------------------------------------------------===// |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 118 | ValueTable::Expression::ExpressionOpcode |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 119 | ValueTable::getOpcode(BinaryOperator* BO) { |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 120 | switch(BO->getOpcode()) { |
| 121 | case Instruction::Add: |
| 122 | return Expression::ADD; |
| 123 | case Instruction::Sub: |
| 124 | return Expression::SUB; |
| 125 | case Instruction::Mul: |
| 126 | return Expression::MUL; |
| 127 | case Instruction::UDiv: |
| 128 | return Expression::UDIV; |
| 129 | case Instruction::SDiv: |
| 130 | return Expression::SDIV; |
| 131 | case Instruction::FDiv: |
| 132 | return Expression::FDIV; |
| 133 | case Instruction::URem: |
| 134 | return Expression::UREM; |
| 135 | case Instruction::SRem: |
| 136 | return Expression::SREM; |
| 137 | case Instruction::FRem: |
| 138 | return Expression::FREM; |
| 139 | case Instruction::Shl: |
| 140 | return Expression::SHL; |
| 141 | case Instruction::LShr: |
| 142 | return Expression::LSHR; |
| 143 | case Instruction::AShr: |
| 144 | return Expression::ASHR; |
| 145 | case Instruction::And: |
| 146 | return Expression::AND; |
| 147 | case Instruction::Or: |
| 148 | return Expression::OR; |
| 149 | case Instruction::Xor: |
| 150 | return Expression::XOR; |
| 151 | |
| 152 | // THIS SHOULD NEVER HAPPEN |
| 153 | default: |
| 154 | assert(0 && "Binary operator with unknown opcode?"); |
| 155 | return Expression::ADD; |
| 156 | } |
| 157 | } |
| 158 | |
| 159 | ValueTable::Expression::ExpressionOpcode ValueTable::getOpcode(CmpInst* C) { |
| 160 | if (C->getOpcode() == Instruction::ICmp) { |
| 161 | switch (C->getPredicate()) { |
| 162 | case ICmpInst::ICMP_EQ: |
| 163 | return Expression::ICMPEQ; |
| 164 | case ICmpInst::ICMP_NE: |
| 165 | return Expression::ICMPNE; |
| 166 | case ICmpInst::ICMP_UGT: |
| 167 | return Expression::ICMPUGT; |
| 168 | case ICmpInst::ICMP_UGE: |
| 169 | return Expression::ICMPUGE; |
| 170 | case ICmpInst::ICMP_ULT: |
| 171 | return Expression::ICMPULT; |
| 172 | case ICmpInst::ICMP_ULE: |
| 173 | return Expression::ICMPULE; |
| 174 | case ICmpInst::ICMP_SGT: |
| 175 | return Expression::ICMPSGT; |
| 176 | case ICmpInst::ICMP_SGE: |
| 177 | return Expression::ICMPSGE; |
| 178 | case ICmpInst::ICMP_SLT: |
| 179 | return Expression::ICMPSLT; |
| 180 | case ICmpInst::ICMP_SLE: |
| 181 | return Expression::ICMPSLE; |
| 182 | |
| 183 | // THIS SHOULD NEVER HAPPEN |
| 184 | default: |
| 185 | assert(0 && "Comparison with unknown predicate?"); |
| 186 | return Expression::ICMPEQ; |
| 187 | } |
| 188 | } else { |
| 189 | switch (C->getPredicate()) { |
| 190 | case FCmpInst::FCMP_OEQ: |
| 191 | return Expression::FCMPOEQ; |
| 192 | case FCmpInst::FCMP_OGT: |
| 193 | return Expression::FCMPOGT; |
| 194 | case FCmpInst::FCMP_OGE: |
| 195 | return Expression::FCMPOGE; |
| 196 | case FCmpInst::FCMP_OLT: |
| 197 | return Expression::FCMPOLT; |
| 198 | case FCmpInst::FCMP_OLE: |
| 199 | return Expression::FCMPOLE; |
| 200 | case FCmpInst::FCMP_ONE: |
| 201 | return Expression::FCMPONE; |
| 202 | case FCmpInst::FCMP_ORD: |
| 203 | return Expression::FCMPORD; |
| 204 | case FCmpInst::FCMP_UNO: |
| 205 | return Expression::FCMPUNO; |
| 206 | case FCmpInst::FCMP_UEQ: |
| 207 | return Expression::FCMPUEQ; |
| 208 | case FCmpInst::FCMP_UGT: |
| 209 | return Expression::FCMPUGT; |
| 210 | case FCmpInst::FCMP_UGE: |
| 211 | return Expression::FCMPUGE; |
| 212 | case FCmpInst::FCMP_ULT: |
| 213 | return Expression::FCMPULT; |
| 214 | case FCmpInst::FCMP_ULE: |
| 215 | return Expression::FCMPULE; |
| 216 | case FCmpInst::FCMP_UNE: |
| 217 | return Expression::FCMPUNE; |
| 218 | |
| 219 | // THIS SHOULD NEVER HAPPEN |
| 220 | default: |
| 221 | assert(0 && "Comparison with unknown predicate?"); |
| 222 | return Expression::FCMPOEQ; |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 223 | } |
| 224 | } |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 225 | } |
| 226 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 227 | ValueTable::Expression ValueTable::create_expression(BinaryOperator* BO) { |
| 228 | Expression e; |
| 229 | |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 230 | e.firstVN = lookup_or_add(BO->getOperand(0)); |
| 231 | e.secondVN = lookup_or_add(BO->getOperand(1)); |
| 232 | e.thirdVN = 0; |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 233 | e.opcode = getOpcode(BO); |
| 234 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 235 | return e; |
| 236 | } |
| 237 | |
| 238 | ValueTable::Expression ValueTable::create_expression(CmpInst* C) { |
| 239 | Expression e; |
| 240 | |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 241 | e.firstVN = lookup_or_add(C->getOperand(0)); |
| 242 | e.secondVN = lookup_or_add(C->getOperand(1)); |
| 243 | e.thirdVN = 0; |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 244 | e.opcode = getOpcode(C); |
| 245 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 246 | return e; |
| 247 | } |
| 248 | |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 249 | ValueTable::Expression ValueTable::create_expression(ShuffleVectorInst* S) { |
| 250 | Expression e; |
| 251 | |
| 252 | e.firstVN = lookup_or_add(S->getOperand(0)); |
| 253 | e.secondVN = lookup_or_add(S->getOperand(1)); |
| 254 | e.thirdVN = lookup_or_add(S->getOperand(2)); |
| 255 | e.opcode = Expression::SHUFFLE; |
| 256 | |
| 257 | return e; |
| 258 | } |
| 259 | |
| 260 | ValueTable::Expression ValueTable::create_expression(ExtractElementInst* E) { |
| 261 | Expression e; |
| 262 | |
| 263 | e.firstVN = lookup_or_add(E->getOperand(0)); |
| 264 | e.secondVN = lookup_or_add(E->getOperand(1)); |
| 265 | e.thirdVN = 0; |
| 266 | e.opcode = Expression::EXTRACT; |
| 267 | |
| 268 | return e; |
| 269 | } |
| 270 | |
| 271 | ValueTable::Expression ValueTable::create_expression(InsertElementInst* I) { |
| 272 | Expression e; |
| 273 | |
| 274 | e.firstVN = lookup_or_add(I->getOperand(0)); |
| 275 | e.secondVN = lookup_or_add(I->getOperand(1)); |
| 276 | e.thirdVN = lookup_or_add(I->getOperand(2)); |
| 277 | e.opcode = Expression::INSERT; |
| 278 | |
| 279 | return e; |
| 280 | } |
| 281 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 282 | //===----------------------------------------------------------------------===// |
| 283 | // ValueTable External Functions |
| 284 | //===----------------------------------------------------------------------===// |
| 285 | |
| 286 | /// lookup_or_add - Returns the value number for the specified value, assigning |
| 287 | /// it a new number if it did not have one before. |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 288 | uint32_t ValueTable::lookup_or_add(Value* V) { |
Owen Anderson | 4f703ec | 2007-06-19 23:23:54 +0000 | [diff] [blame] | 289 | DenseMap<Value*, uint32_t>::iterator VI = valueNumbering.find(V); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 290 | if (VI != valueNumbering.end()) |
| 291 | return VI->second; |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 292 | |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 293 | |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 294 | if (BinaryOperator* BO = dyn_cast<BinaryOperator>(V)) { |
| 295 | Expression e = create_expression(BO); |
| 296 | |
| 297 | std::map<Expression, uint32_t>::iterator EI = expressionNumbering.find(e); |
| 298 | if (EI != expressionNumbering.end()) { |
| 299 | valueNumbering.insert(std::make_pair(V, EI->second)); |
| 300 | return EI->second; |
| 301 | } else { |
| 302 | expressionNumbering.insert(std::make_pair(e, nextValueNumber)); |
| 303 | valueNumbering.insert(std::make_pair(V, nextValueNumber)); |
| 304 | |
| 305 | return nextValueNumber++; |
| 306 | } |
| 307 | } else if (CmpInst* C = dyn_cast<CmpInst>(V)) { |
| 308 | Expression e = create_expression(C); |
| 309 | |
| 310 | std::map<Expression, uint32_t>::iterator EI = expressionNumbering.find(e); |
| 311 | if (EI != expressionNumbering.end()) { |
| 312 | valueNumbering.insert(std::make_pair(V, EI->second)); |
| 313 | return EI->second; |
| 314 | } else { |
| 315 | expressionNumbering.insert(std::make_pair(e, nextValueNumber)); |
| 316 | valueNumbering.insert(std::make_pair(V, nextValueNumber)); |
| 317 | |
| 318 | return nextValueNumber++; |
| 319 | } |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 320 | } else if (ShuffleVectorInst* U = dyn_cast<ShuffleVectorInst>(V)) { |
| 321 | Expression e = create_expression(U); |
| 322 | |
| 323 | std::map<Expression, uint32_t>::iterator EI = expressionNumbering.find(e); |
| 324 | if (EI != expressionNumbering.end()) { |
| 325 | valueNumbering.insert(std::make_pair(V, EI->second)); |
| 326 | return EI->second; |
| 327 | } else { |
| 328 | expressionNumbering.insert(std::make_pair(e, nextValueNumber)); |
| 329 | valueNumbering.insert(std::make_pair(V, nextValueNumber)); |
| 330 | |
| 331 | return nextValueNumber++; |
| 332 | } |
| 333 | } else if (ExtractElementInst* U = dyn_cast<ExtractElementInst>(V)) { |
| 334 | Expression e = create_expression(U); |
| 335 | |
| 336 | std::map<Expression, uint32_t>::iterator EI = expressionNumbering.find(e); |
| 337 | if (EI != expressionNumbering.end()) { |
| 338 | valueNumbering.insert(std::make_pair(V, EI->second)); |
| 339 | return EI->second; |
| 340 | } else { |
| 341 | expressionNumbering.insert(std::make_pair(e, nextValueNumber)); |
| 342 | valueNumbering.insert(std::make_pair(V, nextValueNumber)); |
| 343 | |
| 344 | return nextValueNumber++; |
| 345 | } |
| 346 | } else if (InsertElementInst* U = dyn_cast<InsertElementInst>(V)) { |
| 347 | Expression e = create_expression(U); |
| 348 | |
| 349 | std::map<Expression, uint32_t>::iterator EI = expressionNumbering.find(e); |
| 350 | if (EI != expressionNumbering.end()) { |
| 351 | valueNumbering.insert(std::make_pair(V, EI->second)); |
| 352 | return EI->second; |
| 353 | } else { |
| 354 | expressionNumbering.insert(std::make_pair(e, nextValueNumber)); |
| 355 | valueNumbering.insert(std::make_pair(V, nextValueNumber)); |
| 356 | |
| 357 | return nextValueNumber++; |
| 358 | } |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 359 | } else { |
| 360 | valueNumbering.insert(std::make_pair(V, nextValueNumber)); |
| 361 | return nextValueNumber++; |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 362 | } |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 363 | } |
| 364 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 365 | /// lookup - Returns the value number of the specified value. Fails if |
| 366 | /// the value has not yet been numbered. |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 367 | uint32_t ValueTable::lookup(Value* V) { |
Owen Anderson | 4f703ec | 2007-06-19 23:23:54 +0000 | [diff] [blame] | 368 | DenseMap<Value*, uint32_t>::iterator VI = valueNumbering.find(V); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 369 | if (VI != valueNumbering.end()) |
| 370 | return VI->second; |
| 371 | else |
| 372 | assert(0 && "Value not numbered?"); |
| 373 | |
| 374 | return 0; |
| 375 | } |
| 376 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 377 | /// add - Add the specified value with the given value number, removing |
| 378 | /// its old number, if any |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 379 | void ValueTable::add(Value* V, uint32_t num) { |
Owen Anderson | 4f703ec | 2007-06-19 23:23:54 +0000 | [diff] [blame] | 380 | DenseMap<Value*, uint32_t>::iterator VI = valueNumbering.find(V); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 381 | if (VI != valueNumbering.end()) |
| 382 | valueNumbering.erase(VI); |
| 383 | valueNumbering.insert(std::make_pair(V, num)); |
| 384 | } |
| 385 | |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 386 | /// clear - Remove all entries from the ValueTable |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 387 | void ValueTable::clear() { |
| 388 | valueNumbering.clear(); |
| 389 | expressionNumbering.clear(); |
| 390 | nextValueNumber = 1; |
| 391 | } |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 392 | |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 393 | /// erase - Remove a value from the value numbering |
Owen Anderson | 20cb51f | 2007-06-19 05:37:32 +0000 | [diff] [blame] | 394 | void ValueTable::erase(Value* V) { |
Owen Anderson | 20cb51f | 2007-06-19 05:37:32 +0000 | [diff] [blame] | 395 | valueNumbering.erase(V); |
Owen Anderson | 20cb51f | 2007-06-19 05:37:32 +0000 | [diff] [blame] | 396 | } |
| 397 | |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 398 | /// size - Return the number of assigned value numbers |
| 399 | unsigned ValueTable::size() { |
| 400 | // NOTE: zero is never assigned |
| 401 | return nextValueNumber; |
| 402 | } |
| 403 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 404 | //===----------------------------------------------------------------------===// |
| 405 | // GVNPRE Pass |
| 406 | //===----------------------------------------------------------------------===// |
| 407 | |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 408 | namespace { |
| 409 | |
| 410 | class VISIBILITY_HIDDEN GVNPRE : public FunctionPass { |
| 411 | bool runOnFunction(Function &F); |
| 412 | public: |
| 413 | static char ID; // Pass identification, replacement for typeid |
Owen Anderson | 6cae740 | 2007-06-19 04:32:55 +0000 | [diff] [blame] | 414 | GVNPRE() : FunctionPass((intptr_t)&ID) { } |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 415 | |
| 416 | private: |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 417 | ValueTable VN; |
Owen Anderson | 65d2862 | 2007-06-12 00:50:47 +0000 | [diff] [blame] | 418 | std::vector<Instruction*> createdExpressions; |
Owen Anderson | 8214d50 | 2007-05-31 00:42:15 +0000 | [diff] [blame] | 419 | |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 420 | std::map<BasicBlock*, SmallPtrSet<Value*, 32> > availableOut; |
| 421 | std::map<BasicBlock*, SmallPtrSet<Value*, 32> > anticipatedIn; |
Owen Anderson | 71fcebc | 2007-06-12 22:43:57 +0000 | [diff] [blame] | 422 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 423 | // This transformation requires dominator postdominator info |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 424 | virtual void getAnalysisUsage(AnalysisUsage &AU) const { |
| 425 | AU.setPreservesCFG(); |
| 426 | AU.addRequired<DominatorTree>(); |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 427 | } |
| 428 | |
| 429 | // Helper fuctions |
| 430 | // FIXME: eliminate or document these better |
Owen Anderson | b3b3734 | 2007-06-22 17:04:40 +0000 | [diff] [blame] | 431 | void dump(const SmallPtrSet<Value*, 32>& s) const; |
| 432 | void clean(SmallPtrSet<Value*, 32>& set); |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 433 | Value* find_leader(SmallPtrSet<Value*, 32>& vals, |
Owen Anderson | b3b3734 | 2007-06-22 17:04:40 +0000 | [diff] [blame] | 434 | uint32_t v); |
| 435 | Value* phi_translate(Value* V, BasicBlock* pred, BasicBlock* succ); |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 436 | void phi_translate_set(SmallPtrSet<Value*, 32>& anticIn, BasicBlock* pred, |
Owen Anderson | b3b3734 | 2007-06-22 17:04:40 +0000 | [diff] [blame] | 437 | BasicBlock* succ, SmallPtrSet<Value*, 32>& out); |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 438 | |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 439 | void topo_sort(SmallPtrSet<Value*, 32>& set, |
Owen Anderson | b3b3734 | 2007-06-22 17:04:40 +0000 | [diff] [blame] | 440 | std::vector<Value*>& vec); |
Owen Anderson | 243f348 | 2007-05-31 22:44:11 +0000 | [diff] [blame] | 441 | |
Owen Anderson | b3b3734 | 2007-06-22 17:04:40 +0000 | [diff] [blame] | 442 | void cleanup(); |
| 443 | bool elimination(); |
Owen Anderson | bbf1197 | 2007-06-18 04:42:29 +0000 | [diff] [blame] | 444 | |
Owen Anderson | b3b3734 | 2007-06-22 17:04:40 +0000 | [diff] [blame] | 445 | void val_insert(SmallPtrSet<Value*, 32>& s, Value* v); |
| 446 | void val_replace(SmallPtrSet<Value*, 32>& s, Value* v); |
| 447 | bool dependsOnInvoke(Value* V); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 448 | void buildsets_availout(BasicBlock::iterator I, |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 449 | SmallPtrSet<Value*, 32>& currAvail, |
| 450 | SmallPtrSet<PHINode*, 32>& currPhis, |
| 451 | SmallPtrSet<Value*, 32>& currExps, |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 452 | SmallPtrSet<Value*, 32>& currTemps, |
| 453 | BitVector& availNumbers, |
Owen Anderson | b3b3734 | 2007-06-22 17:04:40 +0000 | [diff] [blame] | 454 | BitVector& expNumbers); |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 455 | bool buildsets_anticout(BasicBlock* BB, |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 456 | SmallPtrSet<Value*, 32>& anticOut, |
Owen Anderson | b3b3734 | 2007-06-22 17:04:40 +0000 | [diff] [blame] | 457 | std::set<BasicBlock*>& visited); |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 458 | unsigned buildsets_anticin(BasicBlock* BB, |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 459 | SmallPtrSet<Value*, 32>& anticOut, |
| 460 | SmallPtrSet<Value*, 32>& currExps, |
| 461 | SmallPtrSet<Value*, 32>& currTemps, |
Owen Anderson | b3b3734 | 2007-06-22 17:04:40 +0000 | [diff] [blame] | 462 | std::set<BasicBlock*>& visited); |
Owen Anderson | 6032a5b | 2007-06-26 23:29:41 +0000 | [diff] [blame] | 463 | void buildsets(Function& F); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 464 | |
| 465 | void insertion_pre(Value* e, BasicBlock* BB, |
| 466 | std::map<BasicBlock*, Value*>& avail, |
Owen Anderson | b3b3734 | 2007-06-22 17:04:40 +0000 | [diff] [blame] | 467 | SmallPtrSet<Value*, 32>& new_set); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 468 | unsigned insertion_mergepoint(std::vector<Value*>& workList, |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 469 | df_iterator<DomTreeNode*>& D, |
Owen Anderson | b3b3734 | 2007-06-22 17:04:40 +0000 | [diff] [blame] | 470 | SmallPtrSet<Value*, 32>& new_set); |
| 471 | bool insertion(Function& F); |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 472 | |
| 473 | }; |
| 474 | |
| 475 | char GVNPRE::ID = 0; |
| 476 | |
| 477 | } |
| 478 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 479 | // createGVNPREPass - The public interface to this file... |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 480 | FunctionPass *llvm::createGVNPREPass() { return new GVNPRE(); } |
| 481 | |
| 482 | RegisterPass<GVNPRE> X("gvnpre", |
| 483 | "Global Value Numbering/Partial Redundancy Elimination"); |
| 484 | |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 485 | |
Owen Anderson | b8b873c | 2007-06-08 22:02:36 +0000 | [diff] [blame] | 486 | STATISTIC(NumInsertedVals, "Number of values inserted"); |
| 487 | STATISTIC(NumInsertedPhis, "Number of PHI nodes inserted"); |
| 488 | STATISTIC(NumEliminated, "Number of redundant instructions eliminated"); |
| 489 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 490 | /// find_leader - Given a set and a value number, return the first |
| 491 | /// element of the set with that value number, or 0 if no such element |
| 492 | /// is present |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 493 | Value* GVNPRE::find_leader(SmallPtrSet<Value*, 32>& vals, uint32_t v) { |
| 494 | for (SmallPtrSet<Value*, 32>::iterator I = vals.begin(), E = vals.end(); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 495 | I != E; ++I) |
| 496 | if (v == VN.lookup(*I)) |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 497 | return *I; |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 498 | |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 499 | return 0; |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 500 | } |
| 501 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 502 | /// val_insert - Insert a value into a set only if there is not a value |
| 503 | /// with the same value number already in the set |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 504 | void GVNPRE::val_insert(SmallPtrSet<Value*, 32>& s, Value* v) { |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 505 | uint32_t num = VN.lookup(v); |
| 506 | Value* leader = find_leader(s, num); |
| 507 | if (leader == 0) |
| 508 | s.insert(v); |
| 509 | } |
| 510 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 511 | /// val_replace - Insert a value into a set, replacing any values already in |
| 512 | /// the set that have the same value number |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 513 | void GVNPRE::val_replace(SmallPtrSet<Value*, 32>& s, Value* v) { |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 514 | uint32_t num = VN.lookup(v); |
| 515 | Value* leader = find_leader(s, num); |
| 516 | while (leader != 0) { |
| 517 | s.erase(leader); |
| 518 | leader = find_leader(s, num); |
| 519 | } |
| 520 | s.insert(v); |
| 521 | } |
| 522 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 523 | /// phi_translate - Given a value, its parent block, and a predecessor of its |
| 524 | /// parent, translate the value into legal for the predecessor block. This |
| 525 | /// means translating its operands (and recursively, their operands) through |
| 526 | /// any phi nodes in the parent into values available in the predecessor |
Owen Anderson | 71fcebc | 2007-06-12 22:43:57 +0000 | [diff] [blame] | 527 | Value* GVNPRE::phi_translate(Value* V, BasicBlock* pred, BasicBlock* succ) { |
Owen Anderson | 5ea069f | 2007-06-04 18:05:26 +0000 | [diff] [blame] | 528 | if (V == 0) |
| 529 | return 0; |
| 530 | |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 531 | // Binary Operations |
| 532 | if (isa<BinaryOperator>(V) || isa<CmpInst>(V) || |
| 533 | isa<ExtractElementInst>(V)) { |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 534 | User* U = cast<User>(V); |
| 535 | |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 536 | Value* newOp1 = 0; |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 537 | if (isa<Instruction>(U->getOperand(0))) |
| 538 | newOp1 = phi_translate(U->getOperand(0), pred, succ); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 539 | else |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 540 | newOp1 = U->getOperand(0); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 541 | |
Owen Anderson | 5ea069f | 2007-06-04 18:05:26 +0000 | [diff] [blame] | 542 | if (newOp1 == 0) |
| 543 | return 0; |
| 544 | |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 545 | Value* newOp2 = 0; |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 546 | if (isa<Instruction>(U->getOperand(1))) |
| 547 | newOp2 = phi_translate(U->getOperand(1), pred, succ); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 548 | else |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 549 | newOp2 = U->getOperand(1); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 550 | |
Owen Anderson | 5ea069f | 2007-06-04 18:05:26 +0000 | [diff] [blame] | 551 | if (newOp2 == 0) |
| 552 | return 0; |
| 553 | |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 554 | if (newOp1 != U->getOperand(0) || newOp2 != U->getOperand(1)) { |
| 555 | Instruction* newVal = 0; |
| 556 | if (BinaryOperator* BO = dyn_cast<BinaryOperator>(U)) |
| 557 | newVal = BinaryOperator::create(BO->getOpcode(), |
| 558 | newOp1, newOp2, |
| 559 | BO->getName()+".expr"); |
| 560 | else if (CmpInst* C = dyn_cast<CmpInst>(U)) |
| 561 | newVal = CmpInst::create(C->getOpcode(), |
| 562 | C->getPredicate(), |
| 563 | newOp1, newOp2, |
| 564 | C->getName()+".expr"); |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 565 | else if (ExtractElementInst* E = dyn_cast<ExtractElementInst>(U)) |
| 566 | newVal = new ExtractElementInst(newOp1, newOp2, E->getName()+".expr"); |
Owen Anderson | 8338ff5 | 2007-06-08 20:44:02 +0000 | [diff] [blame] | 567 | |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 568 | uint32_t v = VN.lookup_or_add(newVal); |
Owen Anderson | 71fcebc | 2007-06-12 22:43:57 +0000 | [diff] [blame] | 569 | |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 570 | Value* leader = find_leader(availableOut[pred], v); |
Owen Anderson | 71fcebc | 2007-06-12 22:43:57 +0000 | [diff] [blame] | 571 | if (leader == 0) { |
Owen Anderson | 65d2862 | 2007-06-12 00:50:47 +0000 | [diff] [blame] | 572 | createdExpressions.push_back(newVal); |
Owen Anderson | 5ea069f | 2007-06-04 18:05:26 +0000 | [diff] [blame] | 573 | return newVal; |
Owen Anderson | 8f862c8 | 2007-06-05 22:11:49 +0000 | [diff] [blame] | 574 | } else { |
Owen Anderson | 20cb51f | 2007-06-19 05:37:32 +0000 | [diff] [blame] | 575 | VN.erase(newVal); |
Owen Anderson | 8f862c8 | 2007-06-05 22:11:49 +0000 | [diff] [blame] | 576 | delete newVal; |
Owen Anderson | 71fcebc | 2007-06-12 22:43:57 +0000 | [diff] [blame] | 577 | return leader; |
Owen Anderson | 8f862c8 | 2007-06-05 22:11:49 +0000 | [diff] [blame] | 578 | } |
Owen Anderson | 5ea069f | 2007-06-04 18:05:26 +0000 | [diff] [blame] | 579 | } |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 580 | |
| 581 | // Ternary Operations |
| 582 | } else if (isa<ShuffleVectorInst>(V) || isa<InsertElementInst>(V)) { |
| 583 | User* U = cast<User>(V); |
| 584 | |
| 585 | Value* newOp1 = 0; |
| 586 | if (isa<Instruction>(U->getOperand(0))) |
| 587 | newOp1 = phi_translate(U->getOperand(0), pred, succ); |
| 588 | else |
| 589 | newOp1 = U->getOperand(0); |
| 590 | |
| 591 | if (newOp1 == 0) |
| 592 | return 0; |
| 593 | |
| 594 | Value* newOp2 = 0; |
| 595 | if (isa<Instruction>(U->getOperand(1))) |
| 596 | newOp2 = phi_translate(U->getOperand(1), pred, succ); |
| 597 | else |
| 598 | newOp2 = U->getOperand(1); |
| 599 | |
| 600 | if (newOp2 == 0) |
| 601 | return 0; |
| 602 | |
| 603 | Value* newOp3 = 0; |
| 604 | if (isa<Instruction>(U->getOperand(2))) |
| 605 | newOp3 = phi_translate(U->getOperand(2), pred, succ); |
| 606 | else |
| 607 | newOp3 = U->getOperand(2); |
| 608 | |
| 609 | if (newOp3 == 0) |
| 610 | return 0; |
| 611 | |
| 612 | if (newOp1 != U->getOperand(0) || |
| 613 | newOp2 != U->getOperand(1) || |
| 614 | newOp3 != U->getOperand(2)) { |
| 615 | Instruction* newVal = 0; |
| 616 | if (ShuffleVectorInst* S = dyn_cast<ShuffleVectorInst>(U)) |
| 617 | newVal = new ShuffleVectorInst(newOp1, newOp2, newOp3, |
| 618 | S->getName()+".expr"); |
| 619 | else if (InsertElementInst* I = dyn_cast<InsertElementInst>(U)) |
| 620 | newVal = new InsertElementInst(newOp1, newOp2, newOp3, |
| 621 | I->getName()+".expr"); |
| 622 | |
| 623 | uint32_t v = VN.lookup_or_add(newVal); |
| 624 | |
| 625 | Value* leader = find_leader(availableOut[pred], v); |
| 626 | if (leader == 0) { |
| 627 | createdExpressions.push_back(newVal); |
| 628 | return newVal; |
| 629 | } else { |
| 630 | VN.erase(newVal); |
| 631 | delete newVal; |
| 632 | return leader; |
| 633 | } |
| 634 | } |
| 635 | |
| 636 | // PHI Nodes |
Owen Anderson | 5ea069f | 2007-06-04 18:05:26 +0000 | [diff] [blame] | 637 | } else if (PHINode* P = dyn_cast<PHINode>(V)) { |
Owen Anderson | 65d2862 | 2007-06-12 00:50:47 +0000 | [diff] [blame] | 638 | if (P->getParent() == succ) |
Owen Anderson | 5ea069f | 2007-06-04 18:05:26 +0000 | [diff] [blame] | 639 | return P->getIncomingValueForBlock(pred); |
| 640 | } |
| 641 | |
| 642 | return V; |
| 643 | } |
| 644 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 645 | /// phi_translate_set - Perform phi translation on every element of a set |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 646 | void GVNPRE::phi_translate_set(SmallPtrSet<Value*, 32>& anticIn, |
Owen Anderson | 65d2862 | 2007-06-12 00:50:47 +0000 | [diff] [blame] | 647 | BasicBlock* pred, BasicBlock* succ, |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 648 | SmallPtrSet<Value*, 32>& out) { |
| 649 | for (SmallPtrSet<Value*, 32>::iterator I = anticIn.begin(), |
Owen Anderson | 5ea069f | 2007-06-04 18:05:26 +0000 | [diff] [blame] | 650 | E = anticIn.end(); I != E; ++I) { |
Owen Anderson | 71fcebc | 2007-06-12 22:43:57 +0000 | [diff] [blame] | 651 | Value* V = phi_translate(*I, pred, succ); |
Owen Anderson | 5ea069f | 2007-06-04 18:05:26 +0000 | [diff] [blame] | 652 | if (V != 0) |
| 653 | out.insert(V); |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 654 | } |
| 655 | } |
| 656 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 657 | /// dependsOnInvoke - Test if a value has an phi node as an operand, any of |
| 658 | /// whose inputs is an invoke instruction. If this is true, we cannot safely |
| 659 | /// PRE the instruction or anything that depends on it. |
Owen Anderson | bbf1197 | 2007-06-18 04:42:29 +0000 | [diff] [blame] | 660 | bool GVNPRE::dependsOnInvoke(Value* V) { |
Owen Anderson | 52471b1 | 2007-06-19 23:07:16 +0000 | [diff] [blame] | 661 | if (PHINode* p = dyn_cast<PHINode>(V)) { |
| 662 | for (PHINode::op_iterator I = p->op_begin(), E = p->op_end(); I != E; ++I) |
| 663 | if (isa<InvokeInst>(*I)) |
Owen Anderson | bbf1197 | 2007-06-18 04:42:29 +0000 | [diff] [blame] | 664 | return true; |
Owen Anderson | 52471b1 | 2007-06-19 23:07:16 +0000 | [diff] [blame] | 665 | return false; |
| 666 | } else { |
| 667 | return false; |
Owen Anderson | 32bc789 | 2007-06-16 00:26:54 +0000 | [diff] [blame] | 668 | } |
Owen Anderson | 32bc789 | 2007-06-16 00:26:54 +0000 | [diff] [blame] | 669 | } |
| 670 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 671 | /// clean - Remove all non-opaque values from the set whose operands are not |
| 672 | /// themselves in the set, as well as all values that depend on invokes (see |
| 673 | /// above) |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 674 | void GVNPRE::clean(SmallPtrSet<Value*, 32>& set) { |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 675 | std::vector<Value*> worklist; |
Owen Anderson | e8138ff | 2007-06-22 00:43:22 +0000 | [diff] [blame] | 676 | worklist.reserve(set.size()); |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 677 | topo_sort(set, worklist); |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 678 | |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 679 | for (unsigned i = 0; i < worklist.size(); ++i) { |
| 680 | Value* v = worklist[i]; |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 681 | |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 682 | if (BinaryOperator* BO = dyn_cast<BinaryOperator>(v)) { |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 683 | bool lhsValid = !isa<Instruction>(BO->getOperand(0)); |
| 684 | if (!lhsValid) |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 685 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 686 | I != E; ++I) |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 687 | if (VN.lookup(*I) == VN.lookup(BO->getOperand(0))) { |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 688 | lhsValid = true; |
| 689 | break; |
| 690 | } |
Owen Anderson | 60e1744 | 2007-06-18 04:30:44 +0000 | [diff] [blame] | 691 | if (lhsValid) |
| 692 | lhsValid = !dependsOnInvoke(BO->getOperand(0)); |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 693 | |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 694 | bool rhsValid = !isa<Instruction>(BO->getOperand(1)); |
| 695 | if (!rhsValid) |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 696 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
Owen Anderson | a8daa71 | 2007-06-18 04:31:21 +0000 | [diff] [blame] | 697 | I != E; ++I) |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 698 | if (VN.lookup(*I) == VN.lookup(BO->getOperand(1))) { |
Owen Anderson | a8daa71 | 2007-06-18 04:31:21 +0000 | [diff] [blame] | 699 | rhsValid = true; |
| 700 | break; |
| 701 | } |
Owen Anderson | 60e1744 | 2007-06-18 04:30:44 +0000 | [diff] [blame] | 702 | if (rhsValid) |
| 703 | rhsValid = !dependsOnInvoke(BO->getOperand(1)); |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 704 | |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 705 | if (!lhsValid || !rhsValid) |
| 706 | set.erase(BO); |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 707 | } else if (CmpInst* C = dyn_cast<CmpInst>(v)) { |
| 708 | bool lhsValid = !isa<Instruction>(C->getOperand(0)); |
| 709 | if (!lhsValid) |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 710 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 711 | I != E; ++I) |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 712 | if (VN.lookup(*I) == VN.lookup(C->getOperand(0))) { |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 713 | lhsValid = true; |
| 714 | break; |
| 715 | } |
Owen Anderson | 52471b1 | 2007-06-19 23:07:16 +0000 | [diff] [blame] | 716 | if (lhsValid) |
| 717 | lhsValid = !dependsOnInvoke(C->getOperand(0)); |
Owen Anderson | 32bc789 | 2007-06-16 00:26:54 +0000 | [diff] [blame] | 718 | |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 719 | bool rhsValid = !isa<Instruction>(C->getOperand(1)); |
| 720 | if (!rhsValid) |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 721 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 722 | I != E; ++I) |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 723 | if (VN.lookup(*I) == VN.lookup(C->getOperand(1))) { |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 724 | rhsValid = true; |
| 725 | break; |
| 726 | } |
Owen Anderson | 52471b1 | 2007-06-19 23:07:16 +0000 | [diff] [blame] | 727 | if (rhsValid) |
| 728 | rhsValid = !dependsOnInvoke(C->getOperand(1)); |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 729 | |
| 730 | if (!lhsValid || !rhsValid) |
| 731 | set.erase(C); |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 732 | } else if (ShuffleVectorInst* S = dyn_cast<ShuffleVectorInst>(v)) { |
| 733 | bool lhsValid = !isa<Instruction>(S->getOperand(0)); |
| 734 | if (!lhsValid) |
| 735 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
| 736 | I != E; ++I) |
| 737 | if (VN.lookup(*I) == VN.lookup(S->getOperand(0))) { |
| 738 | lhsValid = true; |
| 739 | break; |
| 740 | } |
| 741 | if (lhsValid) |
| 742 | lhsValid = !dependsOnInvoke(S->getOperand(0)); |
| 743 | |
| 744 | bool rhsValid = !isa<Instruction>(S->getOperand(1)); |
| 745 | if (!rhsValid) |
| 746 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
| 747 | I != E; ++I) |
| 748 | if (VN.lookup(*I) == VN.lookup(S->getOperand(1))) { |
| 749 | rhsValid = true; |
| 750 | break; |
| 751 | } |
| 752 | if (rhsValid) |
| 753 | rhsValid = !dependsOnInvoke(S->getOperand(1)); |
| 754 | |
| 755 | bool thirdValid = !isa<Instruction>(S->getOperand(2)); |
| 756 | if (!thirdValid) |
| 757 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
| 758 | I != E; ++I) |
| 759 | if (VN.lookup(*I) == VN.lookup(S->getOperand(2))) { |
| 760 | thirdValid = true; |
| 761 | break; |
| 762 | } |
| 763 | if (thirdValid) |
| 764 | thirdValid = !dependsOnInvoke(S->getOperand(2)); |
| 765 | |
| 766 | if (!lhsValid || !rhsValid || !thirdValid) |
| 767 | set.erase(C); |
| 768 | } else if (InsertElementInst* S = dyn_cast<InsertElementInst>(v)) { |
| 769 | bool lhsValid = !isa<Instruction>(S->getOperand(0)); |
| 770 | if (!lhsValid) |
| 771 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
| 772 | I != E; ++I) |
| 773 | if (VN.lookup(*I) == VN.lookup(S->getOperand(0))) { |
| 774 | lhsValid = true; |
| 775 | break; |
| 776 | } |
| 777 | if (lhsValid) |
| 778 | lhsValid = !dependsOnInvoke(S->getOperand(0)); |
| 779 | |
| 780 | bool rhsValid = !isa<Instruction>(S->getOperand(1)); |
| 781 | if (!rhsValid) |
| 782 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
| 783 | I != E; ++I) |
| 784 | if (VN.lookup(*I) == VN.lookup(S->getOperand(1))) { |
| 785 | rhsValid = true; |
| 786 | break; |
| 787 | } |
| 788 | if (rhsValid) |
| 789 | rhsValid = !dependsOnInvoke(S->getOperand(1)); |
| 790 | |
| 791 | bool thirdValid = !isa<Instruction>(S->getOperand(2)); |
| 792 | if (!thirdValid) |
| 793 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
| 794 | I != E; ++I) |
| 795 | if (VN.lookup(*I) == VN.lookup(S->getOperand(2))) { |
| 796 | thirdValid = true; |
| 797 | break; |
| 798 | } |
| 799 | if (thirdValid) |
| 800 | thirdValid = !dependsOnInvoke(S->getOperand(2)); |
| 801 | |
| 802 | if (!lhsValid || !rhsValid || !thirdValid) |
| 803 | set.erase(C); |
| 804 | } else if (ExtractElementInst* C = dyn_cast<ExtractElementInst>(v)) { |
| 805 | bool lhsValid = !isa<Instruction>(C->getOperand(0)); |
| 806 | if (!lhsValid) |
| 807 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
| 808 | I != E; ++I) |
| 809 | if (VN.lookup(*I) == VN.lookup(C->getOperand(0))) { |
| 810 | lhsValid = true; |
| 811 | break; |
| 812 | } |
| 813 | if (lhsValid) |
| 814 | lhsValid = !dependsOnInvoke(C->getOperand(0)); |
| 815 | |
| 816 | bool rhsValid = !isa<Instruction>(C->getOperand(1)); |
| 817 | if (!rhsValid) |
| 818 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
| 819 | I != E; ++I) |
| 820 | if (VN.lookup(*I) == VN.lookup(C->getOperand(1))) { |
| 821 | rhsValid = true; |
| 822 | break; |
| 823 | } |
| 824 | if (rhsValid) |
| 825 | rhsValid = !dependsOnInvoke(C->getOperand(1)); |
| 826 | |
| 827 | if (!lhsValid || !rhsValid) |
| 828 | set.erase(C); |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 829 | } |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 830 | } |
| 831 | } |
| 832 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 833 | /// topo_sort - Given a set of values, sort them by topological |
| 834 | /// order into the provided vector. |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 835 | void GVNPRE::topo_sort(SmallPtrSet<Value*, 32>& set, std::vector<Value*>& vec) { |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 836 | SmallPtrSet<Value*, 32> visited; |
Owen Anderson | 6475804 | 2007-06-22 21:31:16 +0000 | [diff] [blame] | 837 | std::vector<Value*> stack; |
| 838 | for (SmallPtrSet<Value*, 32>::iterator I = set.begin(), E = set.end(); |
| 839 | I != E; ++I) { |
| 840 | if (visited.count(*I) == 0) |
| 841 | stack.push_back(*I); |
| 842 | |
| 843 | while (!stack.empty()) { |
| 844 | Value* e = stack.back(); |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 845 | |
Owen Anderson | 6475804 | 2007-06-22 21:31:16 +0000 | [diff] [blame] | 846 | if (BinaryOperator* BO = dyn_cast<BinaryOperator>(e)) { |
| 847 | Value* l = find_leader(set, VN.lookup(BO->getOperand(0))); |
| 848 | Value* r = find_leader(set, VN.lookup(BO->getOperand(1))); |
| 849 | |
| 850 | if (l != 0 && isa<Instruction>(l) && |
| 851 | visited.count(l) == 0) |
| 852 | stack.push_back(l); |
| 853 | else if (r != 0 && isa<Instruction>(r) && |
| 854 | visited.count(r) == 0) |
| 855 | stack.push_back(r); |
| 856 | else { |
| 857 | vec.push_back(e); |
| 858 | visited.insert(e); |
| 859 | stack.pop_back(); |
| 860 | } |
| 861 | } else if (CmpInst* C = dyn_cast<CmpInst>(e)) { |
| 862 | Value* l = find_leader(set, VN.lookup(C->getOperand(0))); |
| 863 | Value* r = find_leader(set, VN.lookup(C->getOperand(1))); |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 864 | |
Owen Anderson | 6475804 | 2007-06-22 21:31:16 +0000 | [diff] [blame] | 865 | if (l != 0 && isa<Instruction>(l) && |
| 866 | visited.count(l) == 0) |
| 867 | stack.push_back(l); |
| 868 | else if (r != 0 && isa<Instruction>(r) && |
| 869 | visited.count(r) == 0) |
| 870 | stack.push_back(r); |
| 871 | else { |
| 872 | vec.push_back(e); |
| 873 | visited.insert(e); |
| 874 | stack.pop_back(); |
| 875 | } |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 876 | } else if (ExtractElementInst* C = dyn_cast<ExtractElementInst>(e)) { |
| 877 | Value* l = find_leader(set, VN.lookup(C->getOperand(0))); |
| 878 | Value* r = find_leader(set, VN.lookup(C->getOperand(1))); |
| 879 | |
| 880 | if (l != 0 && isa<Instruction>(l) && |
| 881 | visited.count(l) == 0) |
| 882 | stack.push_back(l); |
| 883 | else if (r != 0 && isa<Instruction>(r) && |
| 884 | visited.count(r) == 0) |
| 885 | stack.push_back(r); |
| 886 | else { |
| 887 | vec.push_back(e); |
| 888 | visited.insert(e); |
| 889 | stack.pop_back(); |
| 890 | } |
| 891 | } else if (InsertElementInst* C = dyn_cast<InsertElementInst>(e)) { |
| 892 | Value* l = find_leader(set, VN.lookup(C->getOperand(0))); |
| 893 | Value* r = find_leader(set, VN.lookup(C->getOperand(1))); |
| 894 | Value* m = find_leader(set, VN.lookup(C->getOperand(2))); |
| 895 | |
| 896 | if (l != 0 && isa<Instruction>(l) && |
| 897 | visited.count(l) == 0) |
| 898 | stack.push_back(l); |
| 899 | else if (r != 0 && isa<Instruction>(r) && |
| 900 | visited.count(r) == 0) |
| 901 | stack.push_back(r); |
| 902 | else if (m != 0 && isa<Instruction>(m) && |
| 903 | visited.count(m) == 0) |
| 904 | stack.push_back(r); |
| 905 | else { |
| 906 | vec.push_back(e); |
| 907 | visited.insert(e); |
| 908 | stack.pop_back(); |
| 909 | } |
| 910 | } else if (ShuffleVectorInst* C = dyn_cast<ShuffleVectorInst>(e)) { |
| 911 | Value* l = find_leader(set, VN.lookup(C->getOperand(0))); |
| 912 | Value* r = find_leader(set, VN.lookup(C->getOperand(1))); |
| 913 | Value* m = find_leader(set, VN.lookup(C->getOperand(2))); |
| 914 | |
| 915 | if (l != 0 && isa<Instruction>(l) && |
| 916 | visited.count(l) == 0) |
| 917 | stack.push_back(l); |
| 918 | else if (r != 0 && isa<Instruction>(r) && |
| 919 | visited.count(r) == 0) |
| 920 | stack.push_back(r); |
| 921 | else if (m != 0 && isa<Instruction>(m) && |
| 922 | visited.count(m) == 0) |
| 923 | stack.push_back(r); |
| 924 | else { |
| 925 | vec.push_back(e); |
| 926 | visited.insert(e); |
| 927 | stack.pop_back(); |
| 928 | } |
Owen Anderson | 6475804 | 2007-06-22 21:31:16 +0000 | [diff] [blame] | 929 | } else { |
Owen Anderson | a724ac1 | 2007-06-03 05:55:58 +0000 | [diff] [blame] | 930 | visited.insert(e); |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 931 | vec.push_back(e); |
Owen Anderson | 6475804 | 2007-06-22 21:31:16 +0000 | [diff] [blame] | 932 | stack.pop_back(); |
Owen Anderson | 139fe84 | 2007-06-09 18:35:31 +0000 | [diff] [blame] | 933 | } |
Owen Anderson | 243f348 | 2007-05-31 22:44:11 +0000 | [diff] [blame] | 934 | } |
Owen Anderson | 6475804 | 2007-06-22 21:31:16 +0000 | [diff] [blame] | 935 | |
| 936 | stack.clear(); |
Owen Anderson | 243f348 | 2007-05-31 22:44:11 +0000 | [diff] [blame] | 937 | } |
| 938 | } |
| 939 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 940 | /// dump - Dump a set of values to standard error |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 941 | void GVNPRE::dump(const SmallPtrSet<Value*, 32>& s) const { |
Owen Anderson | cdf8efd | 2007-05-29 23:15:21 +0000 | [diff] [blame] | 942 | DOUT << "{ "; |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 943 | for (SmallPtrSet<Value*, 32>::iterator I = s.begin(), E = s.end(); |
Owen Anderson | 0fa6b37 | 2007-06-03 22:02:14 +0000 | [diff] [blame] | 944 | I != E; ++I) { |
| 945 | DEBUG((*I)->dump()); |
| 946 | } |
| 947 | DOUT << "}\n\n"; |
| 948 | } |
| 949 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 950 | /// elimination - Phase 3 of the main algorithm. Perform full redundancy |
| 951 | /// elimination by walking the dominator tree and removing any instruction that |
| 952 | /// is dominated by another instruction with the same value number. |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 953 | bool GVNPRE::elimination() { |
Owen Anderson | 239e712 | 2007-06-12 16:57:50 +0000 | [diff] [blame] | 954 | DOUT << "\n\nPhase 3: Elimination\n\n"; |
| 955 | |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 956 | bool changed_function = false; |
| 957 | |
Owen Anderson | 239e712 | 2007-06-12 16:57:50 +0000 | [diff] [blame] | 958 | std::vector<std::pair<Instruction*, Value*> > replace; |
| 959 | std::vector<Instruction*> erase; |
| 960 | |
| 961 | DominatorTree& DT = getAnalysis<DominatorTree>(); |
| 962 | |
| 963 | for (df_iterator<DomTreeNode*> DI = df_begin(DT.getRootNode()), |
| 964 | E = df_end(DT.getRootNode()); DI != E; ++DI) { |
| 965 | BasicBlock* BB = DI->getBlock(); |
| 966 | |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 967 | //DOUT << "Block: " << BB->getName() << "\n"; |
| 968 | //dump(availableOut[BB]); |
| 969 | //DOUT << "\n\n"; |
Owen Anderson | 239e712 | 2007-06-12 16:57:50 +0000 | [diff] [blame] | 970 | |
| 971 | for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); |
| 972 | BI != BE; ++BI) { |
| 973 | |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 974 | if (isa<BinaryOperator>(BI) || isa<CmpInst>(BI) || |
| 975 | isa<ShuffleVectorInst>(BI) || isa<InsertElementInst>(BI) || |
| 976 | isa<ExtractElementInst>(BI)) { |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 977 | Value *leader = find_leader(availableOut[BB], VN.lookup(BI)); |
Owen Anderson | 239e712 | 2007-06-12 16:57:50 +0000 | [diff] [blame] | 978 | |
| 979 | if (leader != 0) |
| 980 | if (Instruction* Instr = dyn_cast<Instruction>(leader)) |
| 981 | if (Instr->getParent() != 0 && Instr != BI) { |
| 982 | replace.push_back(std::make_pair(BI, leader)); |
| 983 | erase.push_back(BI); |
| 984 | ++NumEliminated; |
| 985 | } |
| 986 | } |
| 987 | } |
| 988 | } |
| 989 | |
| 990 | while (!replace.empty()) { |
| 991 | std::pair<Instruction*, Value*> rep = replace.back(); |
| 992 | replace.pop_back(); |
| 993 | rep.first->replaceAllUsesWith(rep.second); |
Owen Anderson | 0304b2b | 2007-06-20 18:30:20 +0000 | [diff] [blame] | 994 | changed_function = true; |
Owen Anderson | 239e712 | 2007-06-12 16:57:50 +0000 | [diff] [blame] | 995 | } |
| 996 | |
| 997 | for (std::vector<Instruction*>::iterator I = erase.begin(), E = erase.end(); |
| 998 | I != E; ++I) |
| 999 | (*I)->eraseFromParent(); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1000 | |
| 1001 | return changed_function; |
Owen Anderson | 239e712 | 2007-06-12 16:57:50 +0000 | [diff] [blame] | 1002 | } |
| 1003 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1004 | /// cleanup - Delete any extraneous values that were created to represent |
| 1005 | /// expressions without leaders. |
Owen Anderson | 239e712 | 2007-06-12 16:57:50 +0000 | [diff] [blame] | 1006 | void GVNPRE::cleanup() { |
| 1007 | while (!createdExpressions.empty()) { |
| 1008 | Instruction* I = createdExpressions.back(); |
| 1009 | createdExpressions.pop_back(); |
| 1010 | |
| 1011 | delete I; |
| 1012 | } |
| 1013 | } |
| 1014 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1015 | /// buildsets_availout - When calculating availability, handle an instruction |
| 1016 | /// by inserting it into the appropriate sets |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1017 | void GVNPRE::buildsets_availout(BasicBlock::iterator I, |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1018 | SmallPtrSet<Value*, 32>& currAvail, |
| 1019 | SmallPtrSet<PHINode*, 32>& currPhis, |
| 1020 | SmallPtrSet<Value*, 32>& currExps, |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1021 | SmallPtrSet<Value*, 32>& currTemps, |
| 1022 | BitVector& availNumbers, |
| 1023 | BitVector& expNumbers) { |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1024 | // Handle PHI nodes... |
| 1025 | if (PHINode* p = dyn_cast<PHINode>(I)) { |
| 1026 | VN.lookup_or_add(p); |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1027 | expNumbers.resize(VN.size()); |
| 1028 | availNumbers.resize(VN.size()); |
| 1029 | |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1030 | currPhis.insert(p); |
| 1031 | |
| 1032 | // Handle binary ops... |
| 1033 | } else if (BinaryOperator* BO = dyn_cast<BinaryOperator>(I)) { |
| 1034 | Value* leftValue = BO->getOperand(0); |
| 1035 | Value* rightValue = BO->getOperand(1); |
| 1036 | |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1037 | unsigned num = VN.lookup_or_add(BO); |
| 1038 | expNumbers.resize(VN.size()); |
| 1039 | availNumbers.resize(VN.size()); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1040 | |
| 1041 | if (isa<Instruction>(leftValue)) |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1042 | if (!expNumbers.test(VN.lookup(leftValue))) { |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1043 | currExps.insert(leftValue); |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1044 | expNumbers.set(VN.lookup(leftValue)); |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1045 | } |
| 1046 | |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1047 | if (isa<Instruction>(rightValue)) |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1048 | if (!expNumbers.test(VN.lookup(rightValue))) { |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1049 | currExps.insert(rightValue); |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1050 | expNumbers.set(VN.lookup(rightValue)); |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1051 | } |
| 1052 | |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1053 | if (!expNumbers.test(VN.lookup(BO))) { |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1054 | currExps.insert(BO); |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1055 | expNumbers.set(num); |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1056 | } |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1057 | |
| 1058 | // Handle cmp ops... |
| 1059 | } else if (CmpInst* C = dyn_cast<CmpInst>(I)) { |
| 1060 | Value* leftValue = C->getOperand(0); |
| 1061 | Value* rightValue = C->getOperand(1); |
| 1062 | |
| 1063 | VN.lookup_or_add(C); |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1064 | |
| 1065 | unsigned num = VN.lookup_or_add(C); |
| 1066 | expNumbers.resize(VN.size()); |
| 1067 | availNumbers.resize(VN.size()); |
| 1068 | |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1069 | if (isa<Instruction>(leftValue)) |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1070 | if (!expNumbers.test(VN.lookup(leftValue))) { |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1071 | currExps.insert(leftValue); |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1072 | expNumbers.set(VN.lookup(leftValue)); |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1073 | } |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1074 | if (isa<Instruction>(rightValue)) |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1075 | if (!expNumbers.test(VN.lookup(rightValue))) { |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1076 | currExps.insert(rightValue); |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1077 | expNumbers.set(VN.lookup(rightValue)); |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1078 | } |
| 1079 | |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1080 | if (!expNumbers.test(VN.lookup(C))) { |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1081 | currExps.insert(C); |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1082 | expNumbers.set(num); |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1083 | } |
| 1084 | |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 1085 | // Handle extractelemt ops |
| 1086 | } else if (InsertElementInst* C = dyn_cast<InsertElementInst>(I)) { |
| 1087 | Value* leftValue = C->getOperand(0); |
| 1088 | Value* rightValue = C->getOperand(1); |
| 1089 | Value* thirdValue = C->getOperand(2); |
| 1090 | |
| 1091 | VN.lookup_or_add(C); |
| 1092 | |
| 1093 | unsigned num = VN.lookup_or_add(C); |
| 1094 | expNumbers.resize(VN.size()); |
| 1095 | availNumbers.resize(VN.size()); |
| 1096 | |
| 1097 | if (isa<Instruction>(leftValue)) |
| 1098 | if (!expNumbers.test(VN.lookup(leftValue))) { |
| 1099 | currExps.insert(leftValue); |
| 1100 | expNumbers.set(VN.lookup(leftValue)); |
| 1101 | } |
| 1102 | if (isa<Instruction>(rightValue)) |
| 1103 | if (!expNumbers.test(VN.lookup(rightValue))) { |
| 1104 | currExps.insert(rightValue); |
| 1105 | expNumbers.set(VN.lookup(rightValue)); |
| 1106 | } |
| 1107 | if (isa<Instruction>(thirdValue)) |
| 1108 | if (!expNumbers.test(VN.lookup(thirdValue))) { |
| 1109 | currExps.insert(thirdValue); |
| 1110 | expNumbers.set(VN.lookup(thirdValue)); |
| 1111 | } |
| 1112 | |
| 1113 | if (!expNumbers.test(VN.lookup(C))) { |
| 1114 | currExps.insert(C); |
| 1115 | expNumbers.set(num); |
| 1116 | } |
| 1117 | |
| 1118 | // Handle shufflevector ops |
| 1119 | } else if (ShuffleVectorInst* C = dyn_cast<ShuffleVectorInst>(I)) { |
| 1120 | Value* leftValue = C->getOperand(0); |
| 1121 | Value* rightValue = C->getOperand(1); |
| 1122 | Value* thirdValue = C->getOperand(2); |
| 1123 | |
| 1124 | VN.lookup_or_add(C); |
| 1125 | |
| 1126 | unsigned num = VN.lookup_or_add(C); |
| 1127 | expNumbers.resize(VN.size()); |
| 1128 | availNumbers.resize(VN.size()); |
| 1129 | |
| 1130 | if (isa<Instruction>(leftValue)) |
| 1131 | if (!expNumbers.test(VN.lookup(leftValue))) { |
| 1132 | currExps.insert(leftValue); |
| 1133 | expNumbers.set(VN.lookup(leftValue)); |
| 1134 | } |
| 1135 | if (isa<Instruction>(rightValue)) |
| 1136 | if (!expNumbers.test(VN.lookup(rightValue))) { |
| 1137 | currExps.insert(rightValue); |
| 1138 | expNumbers.set(VN.lookup(rightValue)); |
| 1139 | } |
| 1140 | if (isa<Instruction>(thirdValue)) |
| 1141 | if (!expNumbers.test(VN.lookup(thirdValue))) { |
| 1142 | currExps.insert(thirdValue); |
| 1143 | expNumbers.set(VN.lookup(thirdValue)); |
| 1144 | } |
| 1145 | |
| 1146 | if (!expNumbers.test(VN.lookup(C))) { |
| 1147 | currExps.insert(C); |
| 1148 | expNumbers.set(num); |
| 1149 | } |
| 1150 | |
| 1151 | // Handle insertelement ops |
| 1152 | } else if (ExtractElementInst* C = dyn_cast<ExtractElementInst>(I)) { |
| 1153 | Value* leftValue = C->getOperand(0); |
| 1154 | Value* rightValue = C->getOperand(1); |
| 1155 | |
| 1156 | VN.lookup_or_add(C); |
| 1157 | |
| 1158 | unsigned num = VN.lookup_or_add(C); |
| 1159 | expNumbers.resize(VN.size()); |
| 1160 | availNumbers.resize(VN.size()); |
| 1161 | |
| 1162 | if (isa<Instruction>(leftValue)) |
| 1163 | if (!expNumbers.test(VN.lookup(leftValue))) { |
| 1164 | currExps.insert(leftValue); |
| 1165 | expNumbers.set(VN.lookup(leftValue)); |
| 1166 | } |
| 1167 | if (isa<Instruction>(rightValue)) |
| 1168 | if (!expNumbers.test(VN.lookup(rightValue))) { |
| 1169 | currExps.insert(rightValue); |
| 1170 | expNumbers.set(VN.lookup(rightValue)); |
| 1171 | } |
| 1172 | |
| 1173 | if (!expNumbers.test(VN.lookup(C))) { |
| 1174 | currExps.insert(C); |
| 1175 | expNumbers.set(num); |
| 1176 | } |
| 1177 | |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1178 | // Handle unsupported ops |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 1179 | }else if (!I->isTerminator()){ |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1180 | VN.lookup_or_add(I); |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1181 | expNumbers.resize(VN.size()); |
| 1182 | availNumbers.resize(VN.size()); |
| 1183 | |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1184 | currTemps.insert(I); |
| 1185 | } |
| 1186 | |
| 1187 | if (!I->isTerminator()) |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1188 | if (!availNumbers.test(VN.lookup(I))) { |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1189 | currAvail.insert(I); |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1190 | availNumbers.set(VN.lookup(I)); |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1191 | } |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1192 | } |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1193 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1194 | /// buildsets_anticout - When walking the postdom tree, calculate the ANTIC_OUT |
| 1195 | /// set as a function of the ANTIC_IN set of the block's predecessors |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 1196 | bool GVNPRE::buildsets_anticout(BasicBlock* BB, |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1197 | SmallPtrSet<Value*, 32>& anticOut, |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1198 | std::set<BasicBlock*>& visited) { |
| 1199 | if (BB->getTerminator()->getNumSuccessors() == 1) { |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1200 | if (BB->getTerminator()->getSuccessor(0) != BB && |
| 1201 | visited.count(BB->getTerminator()->getSuccessor(0)) == 0) { |
| 1202 | DOUT << "DEFER: " << BB->getName() << "\n"; |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 1203 | return true; |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1204 | } |
| 1205 | else { |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1206 | phi_translate_set(anticipatedIn[BB->getTerminator()->getSuccessor(0)], |
| 1207 | BB, BB->getTerminator()->getSuccessor(0), anticOut); |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1208 | } |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1209 | } else if (BB->getTerminator()->getNumSuccessors() > 1) { |
| 1210 | BasicBlock* first = BB->getTerminator()->getSuccessor(0); |
| 1211 | anticOut.insert(anticipatedIn[first].begin(), anticipatedIn[first].end()); |
| 1212 | |
| 1213 | for (unsigned i = 1; i < BB->getTerminator()->getNumSuccessors(); ++i) { |
| 1214 | BasicBlock* currSucc = BB->getTerminator()->getSuccessor(i); |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1215 | SmallPtrSet<Value*, 32>& succAnticIn = anticipatedIn[currSucc]; |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1216 | |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1217 | std::vector<Value*> temp; |
| 1218 | |
| 1219 | for (SmallPtrSet<Value*, 32>::iterator I = anticOut.begin(), |
| 1220 | E = anticOut.end(); I != E; ++I) |
| 1221 | if (succAnticIn.count(*I) == 0) |
| 1222 | temp.push_back(*I); |
| 1223 | |
| 1224 | for (std::vector<Value*>::iterator I = temp.begin(), E = temp.end(); |
| 1225 | I != E; ++I) |
| 1226 | anticOut.erase(*I); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1227 | } |
| 1228 | } |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 1229 | |
| 1230 | return false; |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1231 | } |
| 1232 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1233 | /// buildsets_anticin - Walk the postdom tree, calculating ANTIC_OUT for |
| 1234 | /// each block. ANTIC_IN is then a function of ANTIC_OUT and the GEN |
| 1235 | /// sets populated in buildsets_availout |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 1236 | unsigned GVNPRE::buildsets_anticin(BasicBlock* BB, |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1237 | SmallPtrSet<Value*, 32>& anticOut, |
| 1238 | SmallPtrSet<Value*, 32>& currExps, |
| 1239 | SmallPtrSet<Value*, 32>& currTemps, |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1240 | std::set<BasicBlock*>& visited) { |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1241 | SmallPtrSet<Value*, 32>& anticIn = anticipatedIn[BB]; |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1242 | unsigned old = anticIn.size(); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1243 | |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 1244 | bool defer = buildsets_anticout(BB, anticOut, visited); |
| 1245 | if (defer) |
| 1246 | return 0; |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1247 | |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1248 | |
| 1249 | |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1250 | anticIn.clear(); |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1251 | |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 1252 | BitVector numbers(VN.size()); |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1253 | for (SmallPtrSet<Value*, 32>::iterator I = anticOut.begin(), |
| 1254 | E = anticOut.end(); I != E; ++I) { |
| 1255 | anticIn.insert(*I); |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1256 | unsigned num = VN.lookup_or_add(*I); |
| 1257 | numbers.resize(VN.size()); |
| 1258 | numbers.set(num); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1259 | } |
Owen Anderson | 2106f61 | 2007-06-22 18:27:04 +0000 | [diff] [blame] | 1260 | for (SmallPtrSet<Value*, 32>::iterator I = currExps.begin(), |
| 1261 | E = currExps.end(); I != E; ++I) { |
| 1262 | if (!numbers.test(VN.lookup_or_add(*I))) { |
| 1263 | anticIn.insert(*I); |
| 1264 | numbers.set(VN.lookup(*I)); |
| 1265 | } |
| 1266 | } |
| 1267 | |
| 1268 | for (SmallPtrSet<Value*, 32>::iterator I = currTemps.begin(), |
| 1269 | E = currTemps.end(); I != E; ++I) |
| 1270 | anticIn.erase(*I); |
| 1271 | |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1272 | clean(anticIn); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1273 | |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1274 | if (old != anticIn.size()) { |
| 1275 | DOUT << "OLD: " << old << "\n"; |
| 1276 | DOUT << "NEW: " << anticIn.size() << "\n"; |
| 1277 | DOUT << "ANTIC_OUT: " << anticOut.size() << "\n"; |
| 1278 | anticOut.clear(); |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 1279 | return 2; |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1280 | } else |
| 1281 | anticOut.clear(); |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 1282 | return 1; |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1283 | } |
| 1284 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1285 | /// buildsets - Phase 1 of the main algorithm. Construct the AVAIL_OUT |
| 1286 | /// and the ANTIC_IN sets. |
Owen Anderson | 6032a5b | 2007-06-26 23:29:41 +0000 | [diff] [blame] | 1287 | void GVNPRE::buildsets(Function& F) { |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1288 | std::map<BasicBlock*, SmallPtrSet<Value*, 32> > generatedExpressions; |
| 1289 | std::map<BasicBlock*, SmallPtrSet<PHINode*, 32> > generatedPhis; |
| 1290 | std::map<BasicBlock*, SmallPtrSet<Value*, 32> > generatedTemporaries; |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1291 | |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1292 | DominatorTree &DT = getAnalysis<DominatorTree>(); |
| 1293 | |
Owen Anderson | 12112af | 2007-06-06 01:27:49 +0000 | [diff] [blame] | 1294 | // Phase 1, Part 1: calculate AVAIL_OUT |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1295 | |
| 1296 | // Top-down walk of the dominator tree |
Devang Patel | 2604242 | 2007-06-04 00:32:22 +0000 | [diff] [blame] | 1297 | for (df_iterator<DomTreeNode*> DI = df_begin(DT.getRootNode()), |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1298 | E = df_end(DT.getRootNode()); DI != E; ++DI) { |
| 1299 | |
| 1300 | // Get the sets to update for this block |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1301 | SmallPtrSet<Value*, 32>& currExps = generatedExpressions[DI->getBlock()]; |
| 1302 | SmallPtrSet<PHINode*, 32>& currPhis = generatedPhis[DI->getBlock()]; |
| 1303 | SmallPtrSet<Value*, 32>& currTemps = generatedTemporaries[DI->getBlock()]; |
| 1304 | SmallPtrSet<Value*, 32>& currAvail = availableOut[DI->getBlock()]; |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1305 | |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 1306 | BasicBlock* BB = DI->getBlock(); |
| 1307 | |
| 1308 | // A block inherits AVAIL_OUT from its dominator |
| 1309 | if (DI->getIDom() != 0) |
| 1310 | currAvail.insert(availableOut[DI->getIDom()->getBlock()].begin(), |
| 1311 | availableOut[DI->getIDom()->getBlock()].end()); |
| 1312 | |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1313 | BitVector availNumbers(VN.size()); |
| 1314 | for (SmallPtrSet<Value*, 32>::iterator I = currAvail.begin(), |
| 1315 | E = currAvail.end(); I != E; ++I) |
| 1316 | availNumbers.set(VN.lookup(*I)); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 1317 | |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1318 | BitVector expNumbers(VN.size()); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 1319 | for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1320 | BI != BE; ++BI) |
Owen Anderson | 1240846 | 2007-06-22 03:14:03 +0000 | [diff] [blame] | 1321 | buildsets_availout(BI, currAvail, currPhis, currExps, |
| 1322 | currTemps, availNumbers, expNumbers); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 1323 | |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1324 | } |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1325 | |
| 1326 | // Phase 1, Part 2: calculate ANTIC_IN |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1327 | |
Owen Anderson | e3072b2 | 2007-05-29 23:26:30 +0000 | [diff] [blame] | 1328 | std::set<BasicBlock*> visited; |
Owen Anderson | 6032a5b | 2007-06-26 23:29:41 +0000 | [diff] [blame] | 1329 | SmallPtrSet<BasicBlock*, 4> block_changed; |
| 1330 | for (Function::iterator FI = F.begin(), FE = F.end(); FI != FE; ++FI) |
| 1331 | block_changed.insert(FI); |
Owen Anderson | e3072b2 | 2007-05-29 23:26:30 +0000 | [diff] [blame] | 1332 | |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1333 | bool changed = true; |
| 1334 | unsigned iterations = 0; |
Owen Anderson | 6032a5b | 2007-06-26 23:29:41 +0000 | [diff] [blame] | 1335 | |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1336 | while (changed) { |
| 1337 | changed = false; |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1338 | SmallPtrSet<Value*, 32> anticOut; |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1339 | |
Owen Anderson | 6032a5b | 2007-06-26 23:29:41 +0000 | [diff] [blame] | 1340 | // Postorder walk of the CFG |
Owen Anderson | 9030d38 | 2007-06-25 18:25:31 +0000 | [diff] [blame] | 1341 | for (po_iterator<BasicBlock*> BBI = po_begin(&F.getEntryBlock()), |
| 1342 | BBE = po_end(&F.getEntryBlock()); BBI != BBE; ++BBI) { |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1343 | BasicBlock* BB = *BBI; |
Owen Anderson | 0e71466 | 2007-06-11 16:25:17 +0000 | [diff] [blame] | 1344 | |
Owen Anderson | 6032a5b | 2007-06-26 23:29:41 +0000 | [diff] [blame] | 1345 | if (block_changed.count(BB) != 0) { |
| 1346 | unsigned ret = buildsets_anticin(BB, anticOut,generatedExpressions[BB], |
| 1347 | generatedTemporaries[BB], visited); |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 1348 | |
Owen Anderson | 6032a5b | 2007-06-26 23:29:41 +0000 | [diff] [blame] | 1349 | if (ret == 0) { |
| 1350 | changed = true; |
| 1351 | continue; |
| 1352 | } else { |
| 1353 | visited.insert(BB); |
| 1354 | |
| 1355 | if (ret == 2) |
| 1356 | for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); |
| 1357 | PI != PE; ++PI) { |
| 1358 | block_changed.insert(*PI); |
| 1359 | } |
| 1360 | else |
| 1361 | block_changed.erase(BB); |
| 1362 | |
| 1363 | changed |= (ret == 2); |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1364 | } |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 1365 | } |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1366 | } |
Owen Anderson | 5ea069f | 2007-06-04 18:05:26 +0000 | [diff] [blame] | 1367 | |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1368 | iterations++; |
| 1369 | } |
| 1370 | |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1371 | DOUT << "ITERATIONS: " << iterations << "\n"; |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1372 | } |
| 1373 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1374 | /// insertion_pre - When a partial redundancy has been identified, eliminate it |
| 1375 | /// by inserting appropriate values into the predecessors and a phi node in |
| 1376 | /// the main block |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1377 | void GVNPRE::insertion_pre(Value* e, BasicBlock* BB, |
| 1378 | std::map<BasicBlock*, Value*>& avail, |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1379 | SmallPtrSet<Value*, 32>& new_set) { |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1380 | for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { |
| 1381 | Value* e2 = avail[*PI]; |
| 1382 | if (!find_leader(availableOut[*PI], VN.lookup(e2))) { |
| 1383 | User* U = cast<User>(e2); |
| 1384 | |
| 1385 | Value* s1 = 0; |
| 1386 | if (isa<BinaryOperator>(U->getOperand(0)) || |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 1387 | isa<CmpInst>(U->getOperand(0)) || |
| 1388 | isa<ShuffleVectorInst>(U->getOperand(0)) || |
| 1389 | isa<ExtractElementInst>(U->getOperand(0)) || |
| 1390 | isa<InsertElementInst>(U->getOperand(0))) |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1391 | s1 = find_leader(availableOut[*PI], VN.lookup(U->getOperand(0))); |
| 1392 | else |
| 1393 | s1 = U->getOperand(0); |
| 1394 | |
| 1395 | Value* s2 = 0; |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 1396 | if (isa<BinaryOperator>(U->getOperand(1)) || |
| 1397 | isa<CmpInst>(U->getOperand(1)) || |
| 1398 | isa<ShuffleVectorInst>(U->getOperand(1)) || |
| 1399 | isa<ExtractElementInst>(U->getOperand(1)) || |
| 1400 | isa<InsertElementInst>(U->getOperand(1))) |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1401 | s2 = find_leader(availableOut[*PI], VN.lookup(U->getOperand(1))); |
| 1402 | else |
| 1403 | s2 = U->getOperand(1); |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 1404 | |
| 1405 | Value* s3 = 0; |
| 1406 | if (isa<ShuffleVectorInst>(U) || |
| 1407 | isa<InsertElementInst>(U)) |
| 1408 | if (isa<BinaryOperator>(U->getOperand(2)) || |
| 1409 | isa<CmpInst>(U->getOperand(2)) || |
| 1410 | isa<ShuffleVectorInst>(U->getOperand(2)) || |
| 1411 | isa<ExtractElementInst>(U->getOperand(2)) || |
| 1412 | isa<InsertElementInst>(U->getOperand(2))) |
| 1413 | s3 = find_leader(availableOut[*PI], VN.lookup(U->getOperand(2))); |
| 1414 | else |
| 1415 | s3 = U->getOperand(2); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1416 | |
| 1417 | Value* newVal = 0; |
| 1418 | if (BinaryOperator* BO = dyn_cast<BinaryOperator>(U)) |
| 1419 | newVal = BinaryOperator::create(BO->getOpcode(), s1, s2, |
| 1420 | BO->getName()+".gvnpre", |
| 1421 | (*PI)->getTerminator()); |
| 1422 | else if (CmpInst* C = dyn_cast<CmpInst>(U)) |
| 1423 | newVal = CmpInst::create(C->getOpcode(), C->getPredicate(), s1, s2, |
| 1424 | C->getName()+".gvnpre", |
| 1425 | (*PI)->getTerminator()); |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 1426 | else if (ShuffleVectorInst* S = dyn_cast<ShuffleVectorInst>(U)) |
| 1427 | newVal = new ShuffleVectorInst(s1, s2, s3, S->getName()+".gvnpre", |
| 1428 | (*PI)->getTerminator()); |
| 1429 | else if (InsertElementInst* S = dyn_cast<InsertElementInst>(U)) |
| 1430 | newVal = new InsertElementInst(s1, s2, s3, S->getName()+".gvnpre", |
| 1431 | (*PI)->getTerminator()); |
| 1432 | else if (ExtractElementInst* S = dyn_cast<ExtractElementInst>(U)) |
| 1433 | newVal = new ExtractElementInst(s1, s2, S->getName()+".gvnpre", |
| 1434 | (*PI)->getTerminator()); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1435 | |
| 1436 | VN.add(newVal, VN.lookup(U)); |
| 1437 | |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1438 | SmallPtrSet<Value*, 32>& predAvail = availableOut[*PI]; |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1439 | val_replace(predAvail, newVal); |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1440 | |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1441 | std::map<BasicBlock*, Value*>::iterator av = avail.find(*PI); |
| 1442 | if (av != avail.end()) |
| 1443 | avail.erase(av); |
| 1444 | avail.insert(std::make_pair(*PI, newVal)); |
| 1445 | |
| 1446 | ++NumInsertedVals; |
| 1447 | } |
| 1448 | } |
| 1449 | |
| 1450 | PHINode* p = 0; |
| 1451 | |
| 1452 | for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; ++PI) { |
| 1453 | if (p == 0) |
| 1454 | p = new PHINode(avail[*PI]->getType(), "gvnpre-join", BB->begin()); |
| 1455 | |
| 1456 | p->addIncoming(avail[*PI], *PI); |
| 1457 | } |
| 1458 | |
| 1459 | VN.add(p, VN.lookup(e)); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1460 | val_replace(availableOut[BB], p); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1461 | new_set.insert(p); |
| 1462 | |
| 1463 | ++NumInsertedPhis; |
| 1464 | } |
| 1465 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1466 | /// insertion_mergepoint - When walking the dom tree, check at each merge |
| 1467 | /// block for the possibility of a partial redundancy. If present, eliminate it |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1468 | unsigned GVNPRE::insertion_mergepoint(std::vector<Value*>& workList, |
Owen Anderson | 82575d8 | 2007-06-22 00:20:30 +0000 | [diff] [blame] | 1469 | df_iterator<DomTreeNode*>& D, |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1470 | SmallPtrSet<Value*, 32>& new_set) { |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1471 | bool changed_function = false; |
| 1472 | bool new_stuff = false; |
| 1473 | |
| 1474 | BasicBlock* BB = D->getBlock(); |
| 1475 | for (unsigned i = 0; i < workList.size(); ++i) { |
| 1476 | Value* e = workList[i]; |
| 1477 | |
Owen Anderson | 62cf8ba | 2007-06-27 04:10:46 +0000 | [diff] [blame^] | 1478 | if (isa<BinaryOperator>(e) || isa<CmpInst>(e) || |
| 1479 | isa<ExtractElementInst>(e) || isa<InsertElementInst>(e) || |
| 1480 | isa<ShuffleVectorInst>(e)) { |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1481 | if (find_leader(availableOut[D->getIDom()->getBlock()], |
| 1482 | VN.lookup(e)) != 0) |
| 1483 | continue; |
| 1484 | |
| 1485 | std::map<BasicBlock*, Value*> avail; |
| 1486 | bool by_some = false; |
| 1487 | int num_avail = 0; |
| 1488 | |
| 1489 | for (pred_iterator PI = pred_begin(BB), PE = pred_end(BB); PI != PE; |
| 1490 | ++PI) { |
| 1491 | Value *e2 = phi_translate(e, *PI, BB); |
| 1492 | Value *e3 = find_leader(availableOut[*PI], VN.lookup(e2)); |
| 1493 | |
| 1494 | if (e3 == 0) { |
| 1495 | std::map<BasicBlock*, Value*>::iterator av = avail.find(*PI); |
| 1496 | if (av != avail.end()) |
| 1497 | avail.erase(av); |
| 1498 | avail.insert(std::make_pair(*PI, e2)); |
| 1499 | } else { |
| 1500 | std::map<BasicBlock*, Value*>::iterator av = avail.find(*PI); |
| 1501 | if (av != avail.end()) |
| 1502 | avail.erase(av); |
| 1503 | avail.insert(std::make_pair(*PI, e3)); |
| 1504 | |
| 1505 | by_some = true; |
| 1506 | num_avail++; |
| 1507 | } |
| 1508 | } |
| 1509 | |
| 1510 | if (by_some && num_avail < std::distance(pred_begin(BB), pred_end(BB))) { |
| 1511 | insertion_pre(e, BB, avail, new_set); |
| 1512 | |
| 1513 | changed_function = true; |
| 1514 | new_stuff = true; |
| 1515 | } |
| 1516 | } |
| 1517 | } |
| 1518 | |
| 1519 | unsigned retval = 0; |
| 1520 | if (changed_function) |
| 1521 | retval += 1; |
| 1522 | if (new_stuff) |
| 1523 | retval += 2; |
| 1524 | |
| 1525 | return retval; |
| 1526 | } |
| 1527 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1528 | /// insert - Phase 2 of the main algorithm. Walk the dominator tree looking for |
| 1529 | /// merge points. When one is found, check for a partial redundancy. If one is |
| 1530 | /// present, eliminate it. Repeat this walk until no changes are made. |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1531 | bool GVNPRE::insertion(Function& F) { |
| 1532 | bool changed_function = false; |
| 1533 | |
| 1534 | DominatorTree &DT = getAnalysis<DominatorTree>(); |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1535 | |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1536 | std::map<BasicBlock*, SmallPtrSet<Value*, 32> > new_sets; |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1537 | bool new_stuff = true; |
| 1538 | while (new_stuff) { |
| 1539 | new_stuff = false; |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1540 | for (df_iterator<DomTreeNode*> DI = df_begin(DT.getRootNode()), |
| 1541 | E = df_end(DT.getRootNode()); DI != E; ++DI) { |
| 1542 | BasicBlock* BB = DI->getBlock(); |
| 1543 | |
Owen Anderson | 0e71466 | 2007-06-11 16:25:17 +0000 | [diff] [blame] | 1544 | if (BB == 0) |
| 1545 | continue; |
| 1546 | |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1547 | SmallPtrSet<Value*, 32>& new_set = new_sets[BB]; |
| 1548 | SmallPtrSet<Value*, 32>& availOut = availableOut[BB]; |
| 1549 | SmallPtrSet<Value*, 32>& anticIn = anticipatedIn[BB]; |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1550 | |
Owen Anderson | 8338ff5 | 2007-06-08 20:44:02 +0000 | [diff] [blame] | 1551 | new_set.clear(); |
| 1552 | |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1553 | // Replace leaders with leaders inherited from dominator |
| 1554 | if (DI->getIDom() != 0) { |
Owen Anderson | 66fd906 | 2007-06-21 17:57:53 +0000 | [diff] [blame] | 1555 | SmallPtrSet<Value*, 32>& dom_set = new_sets[DI->getIDom()->getBlock()]; |
| 1556 | for (SmallPtrSet<Value*, 32>::iterator I = dom_set.begin(), |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1557 | E = dom_set.end(); I != E; ++I) { |
| 1558 | new_set.insert(*I); |
Owen Anderson | 086f5f3 | 2007-06-19 03:31:41 +0000 | [diff] [blame] | 1559 | val_replace(availOut, *I); |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1560 | } |
| 1561 | } |
| 1562 | |
| 1563 | // If there is more than one predecessor... |
| 1564 | if (pred_begin(BB) != pred_end(BB) && ++pred_begin(BB) != pred_end(BB)) { |
| 1565 | std::vector<Value*> workList; |
Owen Anderson | e8138ff | 2007-06-22 00:43:22 +0000 | [diff] [blame] | 1566 | workList.reserve(anticIn.size()); |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1567 | topo_sort(anticIn, workList); |
| 1568 | |
Owen Anderson | f62c44a | 2007-06-25 05:41:12 +0000 | [diff] [blame] | 1569 | //DOUT << "Merge Block: " << BB->getName() << "\n"; |
| 1570 | //DOUT << "ANTIC_IN: "; |
| 1571 | //dump(anticIn); |
| 1572 | //DOUT << "\n"; |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1573 | |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1574 | unsigned result = insertion_mergepoint(workList, DI, new_set); |
| 1575 | if (result & 1) |
| 1576 | changed_function = true; |
| 1577 | if (result & 2) |
| 1578 | new_stuff = true; |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1579 | } |
| 1580 | } |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1581 | } |
Owen Anderson | 12112af | 2007-06-06 01:27:49 +0000 | [diff] [blame] | 1582 | |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1583 | return changed_function; |
| 1584 | } |
| 1585 | |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1586 | // GVNPRE::runOnFunction - This is the main transformation entry point for a |
| 1587 | // function. |
| 1588 | // |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1589 | bool GVNPRE::runOnFunction(Function &F) { |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1590 | // Clean out global sets from any previous functions |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1591 | VN.clear(); |
| 1592 | createdExpressions.clear(); |
| 1593 | availableOut.clear(); |
| 1594 | anticipatedIn.clear(); |
| 1595 | |
| 1596 | bool changed_function = false; |
| 1597 | |
| 1598 | // Phase 1: BuildSets |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1599 | // This phase calculates the AVAIL_OUT and ANTIC_IN sets |
Owen Anderson | 6032a5b | 2007-06-26 23:29:41 +0000 | [diff] [blame] | 1600 | buildsets(F); |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1601 | |
| 1602 | // Phase 2: Insert |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1603 | // This phase inserts values to make partially redundant values |
| 1604 | // fully redundant |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1605 | changed_function |= insertion(F); |
| 1606 | |
Owen Anderson | 12112af | 2007-06-06 01:27:49 +0000 | [diff] [blame] | 1607 | // Phase 3: Eliminate |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1608 | // This phase performs trivial full redundancy elimination |
Owen Anderson | 3eaca71 | 2007-06-20 22:10:02 +0000 | [diff] [blame] | 1609 | changed_function |= elimination(); |
Owen Anderson | 8338ff5 | 2007-06-08 20:44:02 +0000 | [diff] [blame] | 1610 | |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1611 | // Phase 4: Cleanup |
Owen Anderson | 9cb5601 | 2007-06-21 00:19:05 +0000 | [diff] [blame] | 1612 | // This phase cleans up values that were created solely |
| 1613 | // as leaders for expressions |
Owen Anderson | 239e712 | 2007-06-12 16:57:50 +0000 | [diff] [blame] | 1614 | cleanup(); |
Owen Anderson | 397d405 | 2007-06-08 01:03:01 +0000 | [diff] [blame] | 1615 | |
Owen Anderson | 0304b2b | 2007-06-20 18:30:20 +0000 | [diff] [blame] | 1616 | return changed_function; |
Owen Anderson | ea12a06 | 2007-05-29 21:53:49 +0000 | [diff] [blame] | 1617 | } |