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