Chris Lattner | 44d2c35 | 2003-10-13 03:32:08 +0000 | [diff] [blame] | 1 | //===-- Instruction.cpp - Implement the Instruction class -----------------===// |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 2 | // |
John Criswell | 482202a | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | f3ebc3f | 2007-12-29 20:36:04 +0000 | [diff] [blame] | 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 7 | // |
John Criswell | 482202a | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 9 | // |
Chandler Carruth | ef860a2 | 2013-01-02 09:10:48 +0000 | [diff] [blame] | 10 | // This file implements the Instruction class for the IR library. |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
Chandler Carruth | 9fb823b | 2013-01-02 11:36:10 +0000 | [diff] [blame] | 14 | #include "llvm/IR/Instruction.h" |
Chandler Carruth | 219b89b | 2014-03-04 11:01:28 +0000 | [diff] [blame] | 15 | #include "llvm/IR/CallSite.h" |
Chandler Carruth | 9fb823b | 2013-01-02 11:36:10 +0000 | [diff] [blame] | 16 | #include "llvm/IR/Constants.h" |
| 17 | #include "llvm/IR/Instructions.h" |
Chandler Carruth | 4b6845c | 2014-03-04 12:46:06 +0000 | [diff] [blame] | 18 | #include "llvm/IR/LeakDetector.h" |
Chandler Carruth | 9fb823b | 2013-01-02 11:36:10 +0000 | [diff] [blame] | 19 | #include "llvm/IR/Module.h" |
| 20 | #include "llvm/IR/Operator.h" |
| 21 | #include "llvm/IR/Type.h" |
Chris Lattner | 0e03ab6 | 2003-11-20 17:45:12 +0000 | [diff] [blame] | 22 | using namespace llvm; |
Brian Gaeke | 960707c | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 23 | |
Chris Lattner | 229907c | 2011-07-18 04:54:35 +0000 | [diff] [blame] | 24 | Instruction::Instruction(Type *ty, unsigned it, Use *Ops, unsigned NumOps, |
Chris Lattner | 2195fc4 | 2007-02-24 00:55:48 +0000 | [diff] [blame] | 25 | Instruction *InsertBefore) |
Chris Lattner | c0f5ce3 | 2010-04-01 05:23:13 +0000 | [diff] [blame] | 26 | : User(ty, Value::InstructionVal + it, Ops, NumOps), Parent(0) { |
Chris Lattner | 184b298 | 2002-09-08 18:59:35 +0000 | [diff] [blame] | 27 | // Make sure that we get added to a basicblock |
| 28 | LeakDetector::addGarbageObject(this); |
Chris Lattner | 3c78744 | 2002-09-10 15:45:53 +0000 | [diff] [blame] | 29 | |
| 30 | // If requested, insert this instruction into a basic block... |
| 31 | if (InsertBefore) { |
| 32 | assert(InsertBefore->getParent() && |
| 33 | "Instruction to insert before is not in a basic block!"); |
| 34 | InsertBefore->getParent()->getInstList().insert(InsertBefore, this); |
| 35 | } |
Chris Lattner | 2f7c963 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 36 | } |
| 37 | |
Rafael Espindola | 339430f | 2014-02-25 23:25:17 +0000 | [diff] [blame] | 38 | const DataLayout *Instruction::getDataLayout() const { |
| 39 | return getParent()->getDataLayout(); |
| 40 | } |
| 41 | |
Chris Lattner | 229907c | 2011-07-18 04:54:35 +0000 | [diff] [blame] | 42 | Instruction::Instruction(Type *ty, unsigned it, Use *Ops, unsigned NumOps, |
Chris Lattner | 2195fc4 | 2007-02-24 00:55:48 +0000 | [diff] [blame] | 43 | BasicBlock *InsertAtEnd) |
Chris Lattner | c0f5ce3 | 2010-04-01 05:23:13 +0000 | [diff] [blame] | 44 | : User(ty, Value::InstructionVal + it, Ops, NumOps), Parent(0) { |
Chris Lattner | 5d1bc2c | 2005-01-29 00:35:33 +0000 | [diff] [blame] | 45 | // Make sure that we get added to a basicblock |
| 46 | LeakDetector::addGarbageObject(this); |
Alkis Evlogimenos | 9f0fdf7 | 2004-05-26 21:41:09 +0000 | [diff] [blame] | 47 | |
| 48 | // append this instruction into the basic block |
| 49 | assert(InsertAtEnd && "Basic block to append to may not be NULL!"); |
| 50 | InsertAtEnd->getInstList().push_back(this); |
Chris Lattner | 0f04816 | 2007-02-13 07:54:42 +0000 | [diff] [blame] | 51 | } |
| 52 | |
| 53 | |
Chris Lattner | 1c12a88 | 2006-06-21 16:53:47 +0000 | [diff] [blame] | 54 | // Out of line virtual method, so the vtable, etc has a home. |
Gordon Henriksen | 14a5569 | 2007-12-10 02:14:30 +0000 | [diff] [blame] | 55 | Instruction::~Instruction() { |
Devang Patel | 4e6f2e4 | 2009-09-24 16:19:11 +0000 | [diff] [blame] | 56 | assert(Parent == 0 && "Instruction still linked in the program!"); |
Dan Gohman | 48a995f | 2010-07-20 22:25:04 +0000 | [diff] [blame] | 57 | if (hasMetadataHashEntry()) |
| 58 | clearMetadataHashEntries(); |
Chris Lattner | 1c12a88 | 2006-06-21 16:53:47 +0000 | [diff] [blame] | 59 | } |
| 60 | |
| 61 | |
Chris Lattner | 9ed7aef | 2002-09-06 21:33:15 +0000 | [diff] [blame] | 62 | void Instruction::setParent(BasicBlock *P) { |
Chris Lattner | d8a232b | 2004-02-04 01:06:38 +0000 | [diff] [blame] | 63 | if (getParent()) { |
| 64 | if (!P) LeakDetector::addGarbageObject(this); |
| 65 | } else { |
| 66 | if (P) LeakDetector::removeGarbageObject(this); |
| 67 | } |
Chris Lattner | 184b298 | 2002-09-08 18:59:35 +0000 | [diff] [blame] | 68 | |
Chris Lattner | 9ed7aef | 2002-09-06 21:33:15 +0000 | [diff] [blame] | 69 | Parent = P; |
| 70 | } |
| 71 | |
Chris Lattner | 02a71e7 | 2004-10-11 22:21:39 +0000 | [diff] [blame] | 72 | void Instruction::removeFromParent() { |
| 73 | getParent()->getInstList().remove(this); |
| 74 | } |
| 75 | |
| 76 | void Instruction::eraseFromParent() { |
| 77 | getParent()->getInstList().erase(this); |
| 78 | } |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 79 | |
Owen Anderson | 2505e0c | 2008-06-17 18:29:27 +0000 | [diff] [blame] | 80 | /// insertBefore - Insert an unlinked instructions into a basic block |
| 81 | /// immediately before the specified instruction. |
| 82 | void Instruction::insertBefore(Instruction *InsertPos) { |
| 83 | InsertPos->getParent()->getInstList().insert(InsertPos, this); |
| 84 | } |
| 85 | |
Chris Lattner | 6e66d0a | 2009-01-13 07:43:51 +0000 | [diff] [blame] | 86 | /// insertAfter - Insert an unlinked instructions into a basic block |
| 87 | /// immediately after the specified instruction. |
| 88 | void Instruction::insertAfter(Instruction *InsertPos) { |
| 89 | InsertPos->getParent()->getInstList().insertAfter(InsertPos, this); |
| 90 | } |
| 91 | |
Chris Lattner | 24a0a43 | 2005-08-08 05:21:50 +0000 | [diff] [blame] | 92 | /// moveBefore - Unlink this instruction from its current basic block and |
| 93 | /// insert it into the basic block that MovePos lives in, right before |
| 94 | /// MovePos. |
| 95 | void Instruction::moveBefore(Instruction *MovePos) { |
| 96 | MovePos->getParent()->getInstList().splice(MovePos,getParent()->getInstList(), |
| 97 | this); |
| 98 | } |
| 99 | |
Michael Ilseman | 149209e | 2012-11-27 00:41:22 +0000 | [diff] [blame] | 100 | /// Set or clear the unsafe-algebra flag on this instruction, which must be an |
| 101 | /// operator which supports this flag. See LangRef.html for the meaning of this |
| 102 | /// flag. |
| 103 | void Instruction::setHasUnsafeAlgebra(bool B) { |
| 104 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 105 | cast<FPMathOperator>(this)->setHasUnsafeAlgebra(B); |
| 106 | } |
| 107 | |
| 108 | /// Set or clear the NoNaNs flag on this instruction, which must be an operator |
| 109 | /// which supports this flag. See LangRef.html for the meaning of this flag. |
| 110 | void Instruction::setHasNoNaNs(bool B) { |
| 111 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 112 | cast<FPMathOperator>(this)->setHasNoNaNs(B); |
| 113 | } |
| 114 | |
| 115 | /// Set or clear the no-infs flag on this instruction, which must be an operator |
| 116 | /// which supports this flag. See LangRef.html for the meaning of this flag. |
| 117 | void Instruction::setHasNoInfs(bool B) { |
| 118 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 119 | cast<FPMathOperator>(this)->setHasNoInfs(B); |
| 120 | } |
| 121 | |
| 122 | /// Set or clear the no-signed-zeros flag on this instruction, which must be an |
| 123 | /// operator which supports this flag. See LangRef.html for the meaning of this |
| 124 | /// flag. |
| 125 | void Instruction::setHasNoSignedZeros(bool B) { |
| 126 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 127 | cast<FPMathOperator>(this)->setHasNoSignedZeros(B); |
| 128 | } |
| 129 | |
| 130 | /// Set or clear the allow-reciprocal flag on this instruction, which must be an |
| 131 | /// operator which supports this flag. See LangRef.html for the meaning of this |
| 132 | /// flag. |
| 133 | void Instruction::setHasAllowReciprocal(bool B) { |
| 134 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 135 | cast<FPMathOperator>(this)->setHasAllowReciprocal(B); |
| 136 | } |
| 137 | |
| 138 | /// Convenience function for setting all the fast-math flags on this |
| 139 | /// instruction, which must be an operator which supports these flags. See |
| 140 | /// LangRef.html for the meaning of these flats. |
| 141 | void Instruction::setFastMathFlags(FastMathFlags FMF) { |
| 142 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 143 | cast<FPMathOperator>(this)->setFastMathFlags(FMF); |
| 144 | } |
| 145 | |
| 146 | /// Determine whether the unsafe-algebra flag is set. |
| 147 | bool Instruction::hasUnsafeAlgebra() const { |
| 148 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 149 | return cast<FPMathOperator>(this)->hasUnsafeAlgebra(); |
| 150 | } |
| 151 | |
| 152 | /// Determine whether the no-NaNs flag is set. |
| 153 | bool Instruction::hasNoNaNs() const { |
| 154 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 155 | return cast<FPMathOperator>(this)->hasNoNaNs(); |
| 156 | } |
| 157 | |
| 158 | /// Determine whether the no-infs flag is set. |
| 159 | bool Instruction::hasNoInfs() const { |
| 160 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 161 | return cast<FPMathOperator>(this)->hasNoInfs(); |
| 162 | } |
| 163 | |
| 164 | /// Determine whether the no-signed-zeros flag is set. |
| 165 | bool Instruction::hasNoSignedZeros() const { |
| 166 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 167 | return cast<FPMathOperator>(this)->hasNoSignedZeros(); |
| 168 | } |
| 169 | |
| 170 | /// Determine whether the allow-reciprocal flag is set. |
| 171 | bool Instruction::hasAllowReciprocal() const { |
| 172 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 173 | return cast<FPMathOperator>(this)->hasAllowReciprocal(); |
| 174 | } |
| 175 | |
| 176 | /// Convenience function for getting all the fast-math flags, which must be an |
| 177 | /// operator which supports these flags. See LangRef.html for the meaning of |
| 178 | /// these flats. |
| 179 | FastMathFlags Instruction::getFastMathFlags() const { |
| 180 | assert(isa<FPMathOperator>(this) && "setting fast-math flag on invalid op"); |
| 181 | return cast<FPMathOperator>(this)->getFastMathFlags(); |
| 182 | } |
Chris Lattner | 24a0a43 | 2005-08-08 05:21:50 +0000 | [diff] [blame] | 183 | |
Michael Ilseman | 05d3bf77a | 2012-11-29 21:25:12 +0000 | [diff] [blame] | 184 | /// Copy I's fast-math flags |
| 185 | void Instruction::copyFastMathFlags(const Instruction *I) { |
| 186 | setFastMathFlags(I->getFastMathFlags()); |
| 187 | } |
| 188 | |
| 189 | |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 190 | const char *Instruction::getOpcodeName(unsigned OpCode) { |
| 191 | switch (OpCode) { |
| 192 | // Terminators |
Chris Lattner | b193ff8 | 2002-08-14 18:18:02 +0000 | [diff] [blame] | 193 | case Ret: return "ret"; |
| 194 | case Br: return "br"; |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 195 | case Switch: return "switch"; |
Chris Lattner | d04cb6d | 2009-10-28 00:19:10 +0000 | [diff] [blame] | 196 | case IndirectBr: return "indirectbr"; |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 197 | case Invoke: return "invoke"; |
Bill Wendling | f891bf8 | 2011-07-31 06:30:59 +0000 | [diff] [blame] | 198 | case Resume: return "resume"; |
Chris Lattner | 5e0b9f2 | 2004-10-16 18:08:06 +0000 | [diff] [blame] | 199 | case Unreachable: return "unreachable"; |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 200 | |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 201 | // Standard binary operators... |
| 202 | case Add: return "add"; |
Dan Gohman | a5b9645 | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 203 | case FAdd: return "fadd"; |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 204 | case Sub: return "sub"; |
Dan Gohman | a5b9645 | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 205 | case FSub: return "fsub"; |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 206 | case Mul: return "mul"; |
Dan Gohman | a5b9645 | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 207 | case FMul: return "fmul"; |
Reid Spencer | 7e80b0b | 2006-10-26 06:15:43 +0000 | [diff] [blame] | 208 | case UDiv: return "udiv"; |
| 209 | case SDiv: return "sdiv"; |
| 210 | case FDiv: return "fdiv"; |
Reid Spencer | 7eb55b3 | 2006-11-02 01:53:59 +0000 | [diff] [blame] | 211 | case URem: return "urem"; |
| 212 | case SRem: return "srem"; |
| 213 | case FRem: return "frem"; |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 214 | |
| 215 | // Logical operators... |
| 216 | case And: return "and"; |
| 217 | case Or : return "or"; |
| 218 | case Xor: return "xor"; |
| 219 | |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 220 | // Memory instructions... |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 221 | case Alloca: return "alloca"; |
| 222 | case Load: return "load"; |
| 223 | case Store: return "store"; |
Eli Friedman | c9a551e | 2011-07-28 21:48:00 +0000 | [diff] [blame] | 224 | case AtomicCmpXchg: return "cmpxchg"; |
| 225 | case AtomicRMW: return "atomicrmw"; |
Eli Friedman | fee02c6 | 2011-07-25 23:16:38 +0000 | [diff] [blame] | 226 | case Fence: return "fence"; |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 227 | case GetElementPtr: return "getelementptr"; |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 228 | |
Reid Spencer | 6c38f0b | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 229 | // Convert instructions... |
Matt Arsenault | b03bd4d | 2013-11-15 01:34:59 +0000 | [diff] [blame] | 230 | case Trunc: return "trunc"; |
| 231 | case ZExt: return "zext"; |
| 232 | case SExt: return "sext"; |
| 233 | case FPTrunc: return "fptrunc"; |
| 234 | case FPExt: return "fpext"; |
| 235 | case FPToUI: return "fptoui"; |
| 236 | case FPToSI: return "fptosi"; |
| 237 | case UIToFP: return "uitofp"; |
| 238 | case SIToFP: return "sitofp"; |
| 239 | case IntToPtr: return "inttoptr"; |
| 240 | case PtrToInt: return "ptrtoint"; |
| 241 | case BitCast: return "bitcast"; |
| 242 | case AddrSpaceCast: return "addrspacecast"; |
Reid Spencer | 6c38f0b | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 243 | |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 244 | // Other instructions... |
Reid Spencer | 45e5239 | 2006-12-03 06:27:29 +0000 | [diff] [blame] | 245 | case ICmp: return "icmp"; |
| 246 | case FCmp: return "fcmp"; |
Reid Spencer | 6c38f0b | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 247 | case PHI: return "phi"; |
| 248 | case Select: return "select"; |
| 249 | case Call: return "call"; |
| 250 | case Shl: return "shl"; |
| 251 | case LShr: return "lshr"; |
| 252 | case AShr: return "ashr"; |
| 253 | case VAArg: return "va_arg"; |
Robert Bocchino | 2300448 | 2006-01-10 19:05:34 +0000 | [diff] [blame] | 254 | case ExtractElement: return "extractelement"; |
Reid Spencer | 6c38f0b | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 255 | case InsertElement: return "insertelement"; |
| 256 | case ShuffleVector: return "shufflevector"; |
Matthijs Kooijman | bf8d6ce | 2008-05-30 10:31:54 +0000 | [diff] [blame] | 257 | case ExtractValue: return "extractvalue"; |
| 258 | case InsertValue: return "insertvalue"; |
Bill Wendling | fae1475 | 2011-08-12 20:24:12 +0000 | [diff] [blame] | 259 | case LandingPad: return "landingpad"; |
Chris Lattner | f70da10 | 2003-05-08 02:44:12 +0000 | [diff] [blame] | 260 | |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 261 | default: return "<Invalid operator> "; |
| 262 | } |
Vikram S. Adve | 8aee796 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 263 | } |
Chris Lattner | cab6c33 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 264 | |
Chris Lattner | 0b6ebd8d | 2004-11-30 02:51:53 +0000 | [diff] [blame] | 265 | /// isIdenticalTo - Return true if the specified instruction is exactly |
| 266 | /// identical to the current one. This means that all operands match and any |
| 267 | /// extra information (e.g. load is volatile) agree. |
Chris Lattner | 378b041 | 2008-11-27 08:39:18 +0000 | [diff] [blame] | 268 | bool Instruction::isIdenticalTo(const Instruction *I) const { |
Dan Gohman | 23d2c76 | 2009-08-25 22:24:20 +0000 | [diff] [blame] | 269 | return isIdenticalToWhenDefined(I) && |
Dan Gohman | c8a27f2 | 2009-08-25 22:11:20 +0000 | [diff] [blame] | 270 | SubclassOptionalData == I->SubclassOptionalData; |
| 271 | } |
| 272 | |
Dan Gohman | 23d2c76 | 2009-08-25 22:24:20 +0000 | [diff] [blame] | 273 | /// isIdenticalToWhenDefined - This is like isIdenticalTo, except that it |
Dan Gohman | c8a27f2 | 2009-08-25 22:11:20 +0000 | [diff] [blame] | 274 | /// ignores the SubclassOptionalData flags, which specify conditions |
| 275 | /// under which the instruction's result is undefined. |
| 276 | bool Instruction::isIdenticalToWhenDefined(const Instruction *I) const { |
Chris Lattner | 0b6ebd8d | 2004-11-30 02:51:53 +0000 | [diff] [blame] | 277 | if (getOpcode() != I->getOpcode() || |
| 278 | getNumOperands() != I->getNumOperands() || |
| 279 | getType() != I->getType()) |
| 280 | return false; |
| 281 | |
| 282 | // We have two instructions of identical opcode and #operands. Check to see |
| 283 | // if all operands are the same. |
| 284 | for (unsigned i = 0, e = getNumOperands(); i != e; ++i) |
| 285 | if (getOperand(i) != I->getOperand(i)) |
| 286 | return false; |
| 287 | |
| 288 | // Check special state that is a part of some instructions. |
| 289 | if (const LoadInst *LI = dyn_cast<LoadInst>(this)) |
Dan Gohman | fc27e25 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 290 | return LI->isVolatile() == cast<LoadInst>(I)->isVolatile() && |
Eli Friedman | b9d5a63 | 2011-08-15 21:00:18 +0000 | [diff] [blame] | 291 | LI->getAlignment() == cast<LoadInst>(I)->getAlignment() && |
| 292 | LI->getOrdering() == cast<LoadInst>(I)->getOrdering() && |
| 293 | LI->getSynchScope() == cast<LoadInst>(I)->getSynchScope(); |
Chris Lattner | 0b6ebd8d | 2004-11-30 02:51:53 +0000 | [diff] [blame] | 294 | if (const StoreInst *SI = dyn_cast<StoreInst>(this)) |
Dan Gohman | fc27e25 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 295 | return SI->isVolatile() == cast<StoreInst>(I)->isVolatile() && |
Eli Friedman | b9d5a63 | 2011-08-15 21:00:18 +0000 | [diff] [blame] | 296 | SI->getAlignment() == cast<StoreInst>(I)->getAlignment() && |
| 297 | SI->getOrdering() == cast<StoreInst>(I)->getOrdering() && |
| 298 | SI->getSynchScope() == cast<StoreInst>(I)->getSynchScope(); |
Reid Spencer | 266e42b | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 299 | if (const CmpInst *CI = dyn_cast<CmpInst>(this)) |
| 300 | return CI->getPredicate() == cast<CmpInst>(I)->getPredicate(); |
Chris Lattner | 0603845 | 2005-05-06 05:51:46 +0000 | [diff] [blame] | 301 | if (const CallInst *CI = dyn_cast<CallInst>(this)) |
Dan Gohman | fc27e25 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 302 | return CI->isTailCall() == cast<CallInst>(I)->isTailCall() && |
| 303 | CI->getCallingConv() == cast<CallInst>(I)->getCallingConv() && |
Nick Lewycky | 9154344 | 2011-01-26 09:23:19 +0000 | [diff] [blame] | 304 | CI->getAttributes() == cast<CallInst>(I)->getAttributes(); |
Dan Gohman | fc27e25 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 305 | if (const InvokeInst *CI = dyn_cast<InvokeInst>(this)) |
Nick Lewycky | c5a68d2 | 2008-10-27 07:28:44 +0000 | [diff] [blame] | 306 | return CI->getCallingConv() == cast<InvokeInst>(I)->getCallingConv() && |
Nick Lewycky | 9154344 | 2011-01-26 09:23:19 +0000 | [diff] [blame] | 307 | CI->getAttributes() == cast<InvokeInst>(I)->getAttributes(); |
Jay Foad | 57aa636 | 2011-07-13 10:26:04 +0000 | [diff] [blame] | 308 | if (const InsertValueInst *IVI = dyn_cast<InsertValueInst>(this)) |
| 309 | return IVI->getIndices() == cast<InsertValueInst>(I)->getIndices(); |
| 310 | if (const ExtractValueInst *EVI = dyn_cast<ExtractValueInst>(this)) |
| 311 | return EVI->getIndices() == cast<ExtractValueInst>(I)->getIndices(); |
Eli Friedman | 89b694b | 2011-07-27 01:08:30 +0000 | [diff] [blame] | 312 | if (const FenceInst *FI = dyn_cast<FenceInst>(this)) |
| 313 | return FI->getOrdering() == cast<FenceInst>(FI)->getOrdering() && |
| 314 | FI->getSynchScope() == cast<FenceInst>(FI)->getSynchScope(); |
Eli Friedman | adec587 | 2011-07-29 03:05:32 +0000 | [diff] [blame] | 315 | if (const AtomicCmpXchgInst *CXI = dyn_cast<AtomicCmpXchgInst>(this)) |
| 316 | return CXI->isVolatile() == cast<AtomicCmpXchgInst>(I)->isVolatile() && |
| 317 | CXI->getOrdering() == cast<AtomicCmpXchgInst>(I)->getOrdering() && |
| 318 | CXI->getSynchScope() == cast<AtomicCmpXchgInst>(I)->getSynchScope(); |
| 319 | if (const AtomicRMWInst *RMWI = dyn_cast<AtomicRMWInst>(this)) |
| 320 | return RMWI->getOperation() == cast<AtomicRMWInst>(I)->getOperation() && |
| 321 | RMWI->isVolatile() == cast<AtomicRMWInst>(I)->isVolatile() && |
| 322 | RMWI->getOrdering() == cast<AtomicRMWInst>(I)->getOrdering() && |
| 323 | RMWI->getSynchScope() == cast<AtomicRMWInst>(I)->getSynchScope(); |
Joel Jones | 3d90a9a | 2012-05-10 15:59:41 +0000 | [diff] [blame] | 324 | if (const PHINode *thisPHI = dyn_cast<PHINode>(this)) { |
| 325 | const PHINode *otherPHI = cast<PHINode>(I); |
| 326 | for (unsigned i = 0, e = thisPHI->getNumOperands(); i != e; ++i) { |
| 327 | if (thisPHI->getIncomingBlock(i) != otherPHI->getIncomingBlock(i)) |
| 328 | return false; |
| 329 | } |
| 330 | return true; |
| 331 | } |
Chris Lattner | 0b6ebd8d | 2004-11-30 02:51:53 +0000 | [diff] [blame] | 332 | return true; |
| 333 | } |
| 334 | |
Reid Spencer | 266e42b | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 335 | // isSameOperationAs |
Dan Gohman | 17fb0d2 | 2009-06-12 19:03:05 +0000 | [diff] [blame] | 336 | // This should be kept in sync with isEquivalentOperation in |
| 337 | // lib/Transforms/IPO/MergeFunctions.cpp. |
Hal Finkel | 74e5225 | 2012-06-28 05:42:26 +0000 | [diff] [blame] | 338 | bool Instruction::isSameOperationAs(const Instruction *I, |
| 339 | unsigned flags) const { |
| 340 | bool IgnoreAlignment = flags & CompareIgnoringAlignment; |
| 341 | bool UseScalarTypes = flags & CompareUsingScalarTypes; |
| 342 | |
Dan Gohman | 17fb0d2 | 2009-06-12 19:03:05 +0000 | [diff] [blame] | 343 | if (getOpcode() != I->getOpcode() || |
| 344 | getNumOperands() != I->getNumOperands() || |
Hal Finkel | 74e5225 | 2012-06-28 05:42:26 +0000 | [diff] [blame] | 345 | (UseScalarTypes ? |
| 346 | getType()->getScalarType() != I->getType()->getScalarType() : |
| 347 | getType() != I->getType())) |
Reid Spencer | 266e42b | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 348 | return false; |
| 349 | |
| 350 | // We have two instructions of identical opcode and #operands. Check to see |
| 351 | // if all operands are the same type |
| 352 | for (unsigned i = 0, e = getNumOperands(); i != e; ++i) |
Hal Finkel | 74e5225 | 2012-06-28 05:42:26 +0000 | [diff] [blame] | 353 | if (UseScalarTypes ? |
| 354 | getOperand(i)->getType()->getScalarType() != |
| 355 | I->getOperand(i)->getType()->getScalarType() : |
| 356 | getOperand(i)->getType() != I->getOperand(i)->getType()) |
Reid Spencer | 266e42b | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 357 | return false; |
| 358 | |
| 359 | // Check special state that is a part of some instructions. |
| 360 | if (const LoadInst *LI = dyn_cast<LoadInst>(this)) |
Dan Gohman | fc27e25 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 361 | return LI->isVolatile() == cast<LoadInst>(I)->isVolatile() && |
Hal Finkel | 74e5225 | 2012-06-28 05:42:26 +0000 | [diff] [blame] | 362 | (LI->getAlignment() == cast<LoadInst>(I)->getAlignment() || |
| 363 | IgnoreAlignment) && |
Eli Friedman | b9d5a63 | 2011-08-15 21:00:18 +0000 | [diff] [blame] | 364 | LI->getOrdering() == cast<LoadInst>(I)->getOrdering() && |
| 365 | LI->getSynchScope() == cast<LoadInst>(I)->getSynchScope(); |
Reid Spencer | 266e42b | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 366 | if (const StoreInst *SI = dyn_cast<StoreInst>(this)) |
Dan Gohman | fc27e25 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 367 | return SI->isVolatile() == cast<StoreInst>(I)->isVolatile() && |
Hal Finkel | 74e5225 | 2012-06-28 05:42:26 +0000 | [diff] [blame] | 368 | (SI->getAlignment() == cast<StoreInst>(I)->getAlignment() || |
| 369 | IgnoreAlignment) && |
Eli Friedman | b9d5a63 | 2011-08-15 21:00:18 +0000 | [diff] [blame] | 370 | SI->getOrdering() == cast<StoreInst>(I)->getOrdering() && |
| 371 | SI->getSynchScope() == cast<StoreInst>(I)->getSynchScope(); |
Reid Spencer | 266e42b | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 372 | if (const CmpInst *CI = dyn_cast<CmpInst>(this)) |
| 373 | return CI->getPredicate() == cast<CmpInst>(I)->getPredicate(); |
| 374 | if (const CallInst *CI = dyn_cast<CallInst>(this)) |
Dan Gohman | fc27e25 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 375 | return CI->isTailCall() == cast<CallInst>(I)->isTailCall() && |
| 376 | CI->getCallingConv() == cast<CallInst>(I)->getCallingConv() && |
Nick Lewycky | 9154344 | 2011-01-26 09:23:19 +0000 | [diff] [blame] | 377 | CI->getAttributes() == cast<CallInst>(I)->getAttributes(); |
Dan Gohman | fc27e25 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 378 | if (const InvokeInst *CI = dyn_cast<InvokeInst>(this)) |
Nick Lewycky | c5a68d2 | 2008-10-27 07:28:44 +0000 | [diff] [blame] | 379 | return CI->getCallingConv() == cast<InvokeInst>(I)->getCallingConv() && |
Nick Lewycky | 9154344 | 2011-01-26 09:23:19 +0000 | [diff] [blame] | 380 | CI->getAttributes() == |
| 381 | cast<InvokeInst>(I)->getAttributes(); |
Jay Foad | 57aa636 | 2011-07-13 10:26:04 +0000 | [diff] [blame] | 382 | if (const InsertValueInst *IVI = dyn_cast<InsertValueInst>(this)) |
| 383 | return IVI->getIndices() == cast<InsertValueInst>(I)->getIndices(); |
| 384 | if (const ExtractValueInst *EVI = dyn_cast<ExtractValueInst>(this)) |
| 385 | return EVI->getIndices() == cast<ExtractValueInst>(I)->getIndices(); |
Eli Friedman | 89b694b | 2011-07-27 01:08:30 +0000 | [diff] [blame] | 386 | if (const FenceInst *FI = dyn_cast<FenceInst>(this)) |
Eli Friedman | adec587 | 2011-07-29 03:05:32 +0000 | [diff] [blame] | 387 | return FI->getOrdering() == cast<FenceInst>(I)->getOrdering() && |
| 388 | FI->getSynchScope() == cast<FenceInst>(I)->getSynchScope(); |
| 389 | if (const AtomicCmpXchgInst *CXI = dyn_cast<AtomicCmpXchgInst>(this)) |
| 390 | return CXI->isVolatile() == cast<AtomicCmpXchgInst>(I)->isVolatile() && |
| 391 | CXI->getOrdering() == cast<AtomicCmpXchgInst>(I)->getOrdering() && |
| 392 | CXI->getSynchScope() == cast<AtomicCmpXchgInst>(I)->getSynchScope(); |
| 393 | if (const AtomicRMWInst *RMWI = dyn_cast<AtomicRMWInst>(this)) |
| 394 | return RMWI->getOperation() == cast<AtomicRMWInst>(I)->getOperation() && |
| 395 | RMWI->isVolatile() == cast<AtomicRMWInst>(I)->isVolatile() && |
| 396 | RMWI->getOrdering() == cast<AtomicRMWInst>(I)->getOrdering() && |
| 397 | RMWI->getSynchScope() == cast<AtomicRMWInst>(I)->getSynchScope(); |
Reid Spencer | 266e42b | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 398 | |
| 399 | return true; |
| 400 | } |
| 401 | |
Chris Lattner | 8ec6e8a | 2008-04-20 22:11:30 +0000 | [diff] [blame] | 402 | /// isUsedOutsideOfBlock - Return true if there are any uses of I outside of the |
| 403 | /// specified block. Note that PHI nodes are considered to evaluate their |
| 404 | /// operands in the corresponding predecessor block. |
| 405 | bool Instruction::isUsedOutsideOfBlock(const BasicBlock *BB) const { |
Chandler Carruth | cdf4788 | 2014-03-09 03:16:01 +0000 | [diff] [blame^] | 406 | for (const Use &U : uses()) { |
Chris Lattner | 8ec6e8a | 2008-04-20 22:11:30 +0000 | [diff] [blame] | 407 | // PHI nodes uses values in the corresponding predecessor block. For other |
| 408 | // instructions, just check to see whether the parent of the use matches up. |
Chandler Carruth | cdf4788 | 2014-03-09 03:16:01 +0000 | [diff] [blame^] | 409 | const Instruction *I = cast<Instruction>(U.getUser()); |
| 410 | const PHINode *PN = dyn_cast<PHINode>(I); |
Chris Lattner | 8ec6e8a | 2008-04-20 22:11:30 +0000 | [diff] [blame] | 411 | if (PN == 0) { |
Chandler Carruth | cdf4788 | 2014-03-09 03:16:01 +0000 | [diff] [blame^] | 412 | if (I->getParent() != BB) |
Chris Lattner | 8ec6e8a | 2008-04-20 22:11:30 +0000 | [diff] [blame] | 413 | return true; |
| 414 | continue; |
| 415 | } |
Daniel Dunbar | 7d6781b | 2009-09-20 02:20:51 +0000 | [diff] [blame] | 416 | |
Chandler Carruth | cdf4788 | 2014-03-09 03:16:01 +0000 | [diff] [blame^] | 417 | if (PN->getIncomingBlock(U) != BB) |
Chris Lattner | 8ec6e8a | 2008-04-20 22:11:30 +0000 | [diff] [blame] | 418 | return true; |
| 419 | } |
Daniel Dunbar | 7d6781b | 2009-09-20 02:20:51 +0000 | [diff] [blame] | 420 | return false; |
Chris Lattner | 8ec6e8a | 2008-04-20 22:11:30 +0000 | [diff] [blame] | 421 | } |
| 422 | |
Chris Lattner | 8462711 | 2008-05-08 17:16:51 +0000 | [diff] [blame] | 423 | /// mayReadFromMemory - Return true if this instruction may read memory. |
| 424 | /// |
| 425 | bool Instruction::mayReadFromMemory() const { |
| 426 | switch (getOpcode()) { |
| 427 | default: return false; |
Chris Lattner | 8462711 | 2008-05-08 17:16:51 +0000 | [diff] [blame] | 428 | case Instruction::VAArg: |
Chris Lattner | 954907a | 2008-05-08 21:58:49 +0000 | [diff] [blame] | 429 | case Instruction::Load: |
Eli Friedman | 89b694b | 2011-07-27 01:08:30 +0000 | [diff] [blame] | 430 | case Instruction::Fence: // FIXME: refine definition of mayReadFromMemory |
Eli Friedman | adec587 | 2011-07-29 03:05:32 +0000 | [diff] [blame] | 431 | case Instruction::AtomicCmpXchg: |
| 432 | case Instruction::AtomicRMW: |
Chris Lattner | 8462711 | 2008-05-08 17:16:51 +0000 | [diff] [blame] | 433 | return true; |
| 434 | case Instruction::Call: |
| 435 | return !cast<CallInst>(this)->doesNotAccessMemory(); |
| 436 | case Instruction::Invoke: |
| 437 | return !cast<InvokeInst>(this)->doesNotAccessMemory(); |
Chris Lattner | 954907a | 2008-05-08 21:58:49 +0000 | [diff] [blame] | 438 | case Instruction::Store: |
Eli Friedman | b9d5a63 | 2011-08-15 21:00:18 +0000 | [diff] [blame] | 439 | return !cast<StoreInst>(this)->isUnordered(); |
Chris Lattner | 8462711 | 2008-05-08 17:16:51 +0000 | [diff] [blame] | 440 | } |
| 441 | } |
Chris Lattner | 8ec6e8a | 2008-04-20 22:11:30 +0000 | [diff] [blame] | 442 | |
Chris Lattner | c992e18 | 2007-02-15 23:15:00 +0000 | [diff] [blame] | 443 | /// mayWriteToMemory - Return true if this instruction may modify memory. |
| 444 | /// |
| 445 | bool Instruction::mayWriteToMemory() const { |
| 446 | switch (getOpcode()) { |
| 447 | default: return false; |
Eli Friedman | 89b694b | 2011-07-27 01:08:30 +0000 | [diff] [blame] | 448 | case Instruction::Fence: // FIXME: refine definition of mayWriteToMemory |
Duncan Sands | 38ef3a8 | 2007-12-03 20:06:50 +0000 | [diff] [blame] | 449 | case Instruction::Store: |
Chris Lattner | c992e18 | 2007-02-15 23:15:00 +0000 | [diff] [blame] | 450 | case Instruction::VAArg: |
Eli Friedman | adec587 | 2011-07-29 03:05:32 +0000 | [diff] [blame] | 451 | case Instruction::AtomicCmpXchg: |
| 452 | case Instruction::AtomicRMW: |
Chris Lattner | c992e18 | 2007-02-15 23:15:00 +0000 | [diff] [blame] | 453 | return true; |
| 454 | case Instruction::Call: |
Duncan Sands | 38ef3a8 | 2007-12-03 20:06:50 +0000 | [diff] [blame] | 455 | return !cast<CallInst>(this)->onlyReadsMemory(); |
Chris Lattner | 8462711 | 2008-05-08 17:16:51 +0000 | [diff] [blame] | 456 | case Instruction::Invoke: |
| 457 | return !cast<InvokeInst>(this)->onlyReadsMemory(); |
Chris Lattner | c992e18 | 2007-02-15 23:15:00 +0000 | [diff] [blame] | 458 | case Instruction::Load: |
Eli Friedman | b9d5a63 | 2011-08-15 21:00:18 +0000 | [diff] [blame] | 459 | return !cast<LoadInst>(this)->isUnordered(); |
Chris Lattner | c992e18 | 2007-02-15 23:15:00 +0000 | [diff] [blame] | 460 | } |
| 461 | } |
Chris Lattner | cab6c33 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 462 | |
Duncan Sands | 1efabaa | 2009-05-06 06:49:50 +0000 | [diff] [blame] | 463 | bool Instruction::mayThrow() const { |
| 464 | if (const CallInst *CI = dyn_cast<CallInst>(this)) |
| 465 | return !CI->doesNotThrow(); |
Bill Wendling | d7c6c91 | 2011-08-16 21:15:50 +0000 | [diff] [blame] | 466 | return isa<ResumeInst>(this); |
Duncan Sands | 1efabaa | 2009-05-06 06:49:50 +0000 | [diff] [blame] | 467 | } |
| 468 | |
Nadav Rotem | 0186347 | 2013-02-19 20:02:09 +0000 | [diff] [blame] | 469 | bool Instruction::mayReturn() const { |
| 470 | if (const CallInst *CI = dyn_cast<CallInst>(this)) |
| 471 | return !CI->doesNotReturn(); |
| 472 | return true; |
| 473 | } |
| 474 | |
Chris Lattner | cab6c33 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 475 | /// isAssociative - Return true if the instruction is associative: |
| 476 | /// |
Dan Gohman | a5b9645 | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 477 | /// Associative operators satisfy: x op (y op z) === (x op y) op z |
Chris Lattner | cab6c33 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 478 | /// |
Dan Gohman | a5b9645 | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 479 | /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative. |
Chris Lattner | cab6c33 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 480 | /// |
Duncan Sands | 70db5e7 | 2010-12-20 13:10:23 +0000 | [diff] [blame] | 481 | bool Instruction::isAssociative(unsigned Opcode) { |
Dan Gohman | a5b9645 | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 482 | return Opcode == And || Opcode == Or || Opcode == Xor || |
| 483 | Opcode == Add || Opcode == Mul; |
Chris Lattner | cab6c33 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 484 | } |
| 485 | |
Shuxin Yang | 01ab5d7 | 2012-11-29 01:47:31 +0000 | [diff] [blame] | 486 | bool Instruction::isAssociative() const { |
| 487 | unsigned Opcode = getOpcode(); |
| 488 | if (isAssociative(Opcode)) |
| 489 | return true; |
| 490 | |
| 491 | switch (Opcode) { |
| 492 | case FMul: |
| 493 | case FAdd: |
| 494 | return cast<FPMathOperator>(this)->hasUnsafeAlgebra(); |
| 495 | default: |
| 496 | return false; |
| 497 | } |
| 498 | } |
| 499 | |
Chris Lattner | cab6c33 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 500 | /// isCommutative - Return true if the instruction is commutative: |
| 501 | /// |
Misha Brukman | fa10053 | 2003-10-10 17:54:14 +0000 | [diff] [blame] | 502 | /// Commutative operators satisfy: (x op y) === (y op x) |
Chris Lattner | cab6c33 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 503 | /// |
| 504 | /// In LLVM, these are the associative operators, plus SetEQ and SetNE, when |
| 505 | /// applied to any type. |
| 506 | /// |
| 507 | bool Instruction::isCommutative(unsigned op) { |
| 508 | switch (op) { |
| 509 | case Add: |
Dan Gohman | a5b9645 | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 510 | case FAdd: |
Chris Lattner | cab6c33 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 511 | case Mul: |
Dan Gohman | a5b9645 | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 512 | case FMul: |
Misha Brukman | b1c9317 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 513 | case And: |
Chris Lattner | cab6c33 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 514 | case Or: |
| 515 | case Xor: |
Chris Lattner | cab6c33 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 516 | return true; |
| 517 | default: |
| 518 | return false; |
| 519 | } |
| 520 | } |
Tanya Lattner | a93c7ae | 2003-07-31 04:05:50 +0000 | [diff] [blame] | 521 | |
Duncan Sands | d7aeefe | 2012-06-12 14:33:56 +0000 | [diff] [blame] | 522 | /// isIdempotent - Return true if the instruction is idempotent: |
| 523 | /// |
| 524 | /// Idempotent operators satisfy: x op x === x |
| 525 | /// |
| 526 | /// In LLVM, the And and Or operators are idempotent. |
| 527 | /// |
| 528 | bool Instruction::isIdempotent(unsigned Opcode) { |
| 529 | return Opcode == And || Opcode == Or; |
| 530 | } |
| 531 | |
| 532 | /// isNilpotent - Return true if the instruction is nilpotent: |
| 533 | /// |
| 534 | /// Nilpotent operators satisfy: x op x === Id, |
| 535 | /// |
| 536 | /// where Id is the identity for the operator, i.e. a constant such that |
| 537 | /// x op Id === x and Id op x === x for all x. |
| 538 | /// |
| 539 | /// In LLVM, the Xor operator is nilpotent. |
| 540 | /// |
| 541 | bool Instruction::isNilpotent(unsigned Opcode) { |
| 542 | return Opcode == Xor; |
| 543 | } |
| 544 | |
Devang Patel | 11cf3f4 | 2009-10-27 22:16:29 +0000 | [diff] [blame] | 545 | Instruction *Instruction::clone() const { |
| 546 | Instruction *New = clone_impl(); |
| 547 | New->SubclassOptionalData = SubclassOptionalData; |
Chris Lattner | 6801780 | 2009-12-29 07:44:16 +0000 | [diff] [blame] | 548 | if (!hasMetadata()) |
| 549 | return New; |
Michael Ilseman | 26ee2b8 | 2012-11-15 22:34:00 +0000 | [diff] [blame] | 550 | |
Chris Lattner | 6801780 | 2009-12-29 07:44:16 +0000 | [diff] [blame] | 551 | // Otherwise, enumerate and copy over metadata from the old instruction to the |
| 552 | // new one. |
| 553 | SmallVector<std::pair<unsigned, MDNode*>, 4> TheMDs; |
Chris Lattner | 8f29491 | 2011-07-14 18:57:51 +0000 | [diff] [blame] | 554 | getAllMetadataOtherThanDebugLoc(TheMDs); |
Chris Lattner | 6801780 | 2009-12-29 07:44:16 +0000 | [diff] [blame] | 555 | for (unsigned i = 0, e = TheMDs.size(); i != e; ++i) |
| 556 | New->setMetadata(TheMDs[i].first, TheMDs[i].second); |
Michael Ilseman | 26ee2b8 | 2012-11-15 22:34:00 +0000 | [diff] [blame] | 557 | |
Chris Lattner | 8f29491 | 2011-07-14 18:57:51 +0000 | [diff] [blame] | 558 | New->setDebugLoc(getDebugLoc()); |
Devang Patel | 11cf3f4 | 2009-10-27 22:16:29 +0000 | [diff] [blame] | 559 | return New; |
| 560 | } |