Chris Lattner | cf3056d | 2003-10-13 03:32:08 +0000 | [diff] [blame] | 1 | //===-- Instruction.cpp - Implement the Instruction class -----------------===// |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 2 | // |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
Chris Lattner | 4ee451d | 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 | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 7 | // |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 9 | // |
| 10 | // This file implements the Instruction class for the VMCore library. |
| 11 | // |
| 12 | //===----------------------------------------------------------------------===// |
| 13 | |
Reid Spencer | 45fb3f3 | 2006-11-20 01:22:35 +0000 | [diff] [blame] | 14 | #include "llvm/Type.h" |
Chris Lattner | 38f1455 | 2004-11-30 02:51:53 +0000 | [diff] [blame] | 15 | #include "llvm/Instructions.h" |
Chris Lattner | 2fbfdcf | 2002-04-07 20:49:59 +0000 | [diff] [blame] | 16 | #include "llvm/Function.h" |
Eli Friedman | 0b79a77 | 2009-07-17 04:28:42 +0000 | [diff] [blame] | 17 | #include "llvm/Constants.h" |
| 18 | #include "llvm/GlobalVariable.h" |
Victor Hernandez | 88d9839 | 2009-09-18 19:20:02 +0000 | [diff] [blame] | 19 | #include "llvm/Module.h" |
Duncan Sands | a3355ff | 2007-12-03 20:06:50 +0000 | [diff] [blame] | 20 | #include "llvm/Support/CallSite.h" |
Reid Spencer | 551ccae | 2004-09-01 22:55:40 +0000 | [diff] [blame] | 21 | #include "llvm/Support/LeakDetector.h" |
Chris Lattner | 4b74c83 | 2003-11-20 17:45:12 +0000 | [diff] [blame] | 22 | using namespace llvm; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 23 | |
Chris Lattner | 96d83f6 | 2005-01-29 00:35:33 +0000 | [diff] [blame] | 24 | Instruction::Instruction(const Type *ty, unsigned it, Use *Ops, unsigned NumOps, |
Chris Lattner | 910c80a | 2007-02-24 00:55:48 +0000 | [diff] [blame] | 25 | Instruction *InsertBefore) |
Chris Lattner | dec628e | 2007-02-12 05:18:08 +0000 | [diff] [blame] | 26 | : User(ty, Value::InstructionVal + it, Ops, NumOps), Parent(0) { |
Chris Lattner | d1e693f | 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 | 2aa8311 | 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 | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 36 | } |
| 37 | |
Chris Lattner | 96d83f6 | 2005-01-29 00:35:33 +0000 | [diff] [blame] | 38 | Instruction::Instruction(const Type *ty, unsigned it, Use *Ops, unsigned NumOps, |
Chris Lattner | 910c80a | 2007-02-24 00:55:48 +0000 | [diff] [blame] | 39 | BasicBlock *InsertAtEnd) |
Chris Lattner | dec628e | 2007-02-12 05:18:08 +0000 | [diff] [blame] | 40 | : User(ty, Value::InstructionVal + it, Ops, NumOps), Parent(0) { |
Chris Lattner | 96d83f6 | 2005-01-29 00:35:33 +0000 | [diff] [blame] | 41 | // Make sure that we get added to a basicblock |
| 42 | LeakDetector::addGarbageObject(this); |
Alkis Evlogimenos | e5828f1 | 2004-05-26 21:41:09 +0000 | [diff] [blame] | 43 | |
| 44 | // append this instruction into the basic block |
| 45 | assert(InsertAtEnd && "Basic block to append to may not be NULL!"); |
| 46 | InsertAtEnd->getInstList().push_back(this); |
Chris Lattner | f00042a | 2007-02-13 07:54:42 +0000 | [diff] [blame] | 47 | } |
| 48 | |
| 49 | |
Chris Lattner | 70aa33e | 2006-06-21 16:53:47 +0000 | [diff] [blame] | 50 | // Out of line virtual method, so the vtable, etc has a home. |
Gordon Henriksen | afba8fe | 2007-12-10 02:14:30 +0000 | [diff] [blame] | 51 | Instruction::~Instruction() { |
| 52 | assert(Parent == 0 && "Instruction still linked in the program!"); |
Chris Lattner | 70aa33e | 2006-06-21 16:53:47 +0000 | [diff] [blame] | 53 | } |
| 54 | |
| 55 | |
Chris Lattner | bded132 | 2002-09-06 21:33:15 +0000 | [diff] [blame] | 56 | void Instruction::setParent(BasicBlock *P) { |
Chris Lattner | 786993c | 2004-02-04 01:06:38 +0000 | [diff] [blame] | 57 | if (getParent()) { |
| 58 | if (!P) LeakDetector::addGarbageObject(this); |
| 59 | } else { |
| 60 | if (P) LeakDetector::removeGarbageObject(this); |
| 61 | } |
Chris Lattner | d1e693f | 2002-09-08 18:59:35 +0000 | [diff] [blame] | 62 | |
Chris Lattner | bded132 | 2002-09-06 21:33:15 +0000 | [diff] [blame] | 63 | Parent = P; |
| 64 | } |
| 65 | |
Chris Lattner | 4b83380 | 2004-10-11 22:21:39 +0000 | [diff] [blame] | 66 | void Instruction::removeFromParent() { |
| 67 | getParent()->getInstList().remove(this); |
| 68 | } |
| 69 | |
| 70 | void Instruction::eraseFromParent() { |
| 71 | getParent()->getInstList().erase(this); |
| 72 | } |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 73 | |
Owen Anderson | 26bb50a | 2008-06-17 18:29:27 +0000 | [diff] [blame] | 74 | /// insertBefore - Insert an unlinked instructions into a basic block |
| 75 | /// immediately before the specified instruction. |
| 76 | void Instruction::insertBefore(Instruction *InsertPos) { |
| 77 | InsertPos->getParent()->getInstList().insert(InsertPos, this); |
| 78 | } |
| 79 | |
Chris Lattner | 3ff704f | 2009-01-13 07:43:51 +0000 | [diff] [blame] | 80 | /// insertAfter - Insert an unlinked instructions into a basic block |
| 81 | /// immediately after the specified instruction. |
| 82 | void Instruction::insertAfter(Instruction *InsertPos) { |
| 83 | InsertPos->getParent()->getInstList().insertAfter(InsertPos, this); |
| 84 | } |
| 85 | |
Chris Lattner | 0fe34d8 | 2005-08-08 05:21:50 +0000 | [diff] [blame] | 86 | /// moveBefore - Unlink this instruction from its current basic block and |
| 87 | /// insert it into the basic block that MovePos lives in, right before |
| 88 | /// MovePos. |
| 89 | void Instruction::moveBefore(Instruction *MovePos) { |
| 90 | MovePos->getParent()->getInstList().splice(MovePos,getParent()->getInstList(), |
| 91 | this); |
| 92 | } |
| 93 | |
| 94 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 95 | const char *Instruction::getOpcodeName(unsigned OpCode) { |
| 96 | switch (OpCode) { |
| 97 | // Terminators |
Chris Lattner | 0513e9f | 2002-08-14 18:18:02 +0000 | [diff] [blame] | 98 | case Ret: return "ret"; |
| 99 | case Br: return "br"; |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 100 | case Switch: return "switch"; |
| 101 | case Invoke: return "invoke"; |
Chris Lattner | a6ce898 | 2003-09-08 18:54:36 +0000 | [diff] [blame] | 102 | case Unwind: return "unwind"; |
Chris Lattner | b976e66 | 2004-10-16 18:08:06 +0000 | [diff] [blame] | 103 | case Unreachable: return "unreachable"; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 104 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 105 | // Standard binary operators... |
| 106 | case Add: return "add"; |
Dan Gohman | ae3a0be | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 107 | case FAdd: return "fadd"; |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 108 | case Sub: return "sub"; |
Dan Gohman | ae3a0be | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 109 | case FSub: return "fsub"; |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 110 | case Mul: return "mul"; |
Dan Gohman | ae3a0be | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 111 | case FMul: return "fmul"; |
Reid Spencer | 1628cec | 2006-10-26 06:15:43 +0000 | [diff] [blame] | 112 | case UDiv: return "udiv"; |
| 113 | case SDiv: return "sdiv"; |
| 114 | case FDiv: return "fdiv"; |
Reid Spencer | 0a783f7 | 2006-11-02 01:53:59 +0000 | [diff] [blame] | 115 | case URem: return "urem"; |
| 116 | case SRem: return "srem"; |
| 117 | case FRem: return "frem"; |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 118 | |
| 119 | // Logical operators... |
| 120 | case And: return "and"; |
| 121 | case Or : return "or"; |
| 122 | case Xor: return "xor"; |
| 123 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 124 | // Memory instructions... |
| 125 | case Malloc: return "malloc"; |
| 126 | case Free: return "free"; |
| 127 | case Alloca: return "alloca"; |
| 128 | case Load: return "load"; |
| 129 | case Store: return "store"; |
| 130 | case GetElementPtr: return "getelementptr"; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 131 | |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 132 | // Convert instructions... |
| 133 | case Trunc: return "trunc"; |
| 134 | case ZExt: return "zext"; |
| 135 | case SExt: return "sext"; |
| 136 | case FPTrunc: return "fptrunc"; |
| 137 | case FPExt: return "fpext"; |
| 138 | case FPToUI: return "fptoui"; |
| 139 | case FPToSI: return "fptosi"; |
| 140 | case UIToFP: return "uitofp"; |
| 141 | case SIToFP: return "sitofp"; |
| 142 | case IntToPtr: return "inttoptr"; |
| 143 | case PtrToInt: return "ptrtoint"; |
| 144 | case BitCast: return "bitcast"; |
| 145 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 146 | // Other instructions... |
Reid Spencer | 74f1642 | 2006-12-03 06:27:29 +0000 | [diff] [blame] | 147 | case ICmp: return "icmp"; |
| 148 | case FCmp: return "fcmp"; |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 149 | case PHI: return "phi"; |
| 150 | case Select: return "select"; |
| 151 | case Call: return "call"; |
| 152 | case Shl: return "shl"; |
| 153 | case LShr: return "lshr"; |
| 154 | case AShr: return "ashr"; |
| 155 | case VAArg: return "va_arg"; |
Robert Bocchino | b52ee7f | 2006-01-10 19:05:34 +0000 | [diff] [blame] | 156 | case ExtractElement: return "extractelement"; |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame] | 157 | case InsertElement: return "insertelement"; |
| 158 | case ShuffleVector: return "shufflevector"; |
Matthijs Kooijman | 74b5e07 | 2008-05-30 10:31:54 +0000 | [diff] [blame] | 159 | case ExtractValue: return "extractvalue"; |
| 160 | case InsertValue: return "insertvalue"; |
Chris Lattner | 8f77dae | 2003-05-08 02:44:12 +0000 | [diff] [blame] | 161 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 162 | default: return "<Invalid operator> "; |
| 163 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 164 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 165 | return 0; |
| 166 | } |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 167 | |
Chris Lattner | 38f1455 | 2004-11-30 02:51:53 +0000 | [diff] [blame] | 168 | /// isIdenticalTo - Return true if the specified instruction is exactly |
| 169 | /// identical to the current one. This means that all operands match and any |
| 170 | /// extra information (e.g. load is volatile) agree. |
Chris Lattner | e3a0884 | 2008-11-27 08:39:18 +0000 | [diff] [blame] | 171 | bool Instruction::isIdenticalTo(const Instruction *I) const { |
Dan Gohman | 75b0eda | 2009-08-25 22:24:20 +0000 | [diff] [blame] | 172 | return isIdenticalToWhenDefined(I) && |
Dan Gohman | 58cfa3b | 2009-08-25 22:11:20 +0000 | [diff] [blame] | 173 | SubclassOptionalData == I->SubclassOptionalData; |
| 174 | } |
| 175 | |
Dan Gohman | 75b0eda | 2009-08-25 22:24:20 +0000 | [diff] [blame] | 176 | /// isIdenticalToWhenDefined - This is like isIdenticalTo, except that it |
Dan Gohman | 58cfa3b | 2009-08-25 22:11:20 +0000 | [diff] [blame] | 177 | /// ignores the SubclassOptionalData flags, which specify conditions |
| 178 | /// under which the instruction's result is undefined. |
| 179 | bool Instruction::isIdenticalToWhenDefined(const Instruction *I) const { |
Chris Lattner | 38f1455 | 2004-11-30 02:51:53 +0000 | [diff] [blame] | 180 | if (getOpcode() != I->getOpcode() || |
| 181 | getNumOperands() != I->getNumOperands() || |
| 182 | getType() != I->getType()) |
| 183 | return false; |
| 184 | |
| 185 | // We have two instructions of identical opcode and #operands. Check to see |
| 186 | // if all operands are the same. |
| 187 | for (unsigned i = 0, e = getNumOperands(); i != e; ++i) |
| 188 | if (getOperand(i) != I->getOperand(i)) |
| 189 | return false; |
| 190 | |
| 191 | // Check special state that is a part of some instructions. |
| 192 | if (const LoadInst *LI = dyn_cast<LoadInst>(this)) |
Dan Gohman | 9a8af45 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 193 | return LI->isVolatile() == cast<LoadInst>(I)->isVolatile() && |
| 194 | LI->getAlignment() == cast<LoadInst>(I)->getAlignment(); |
Chris Lattner | 38f1455 | 2004-11-30 02:51:53 +0000 | [diff] [blame] | 195 | if (const StoreInst *SI = dyn_cast<StoreInst>(this)) |
Dan Gohman | 9a8af45 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 196 | return SI->isVolatile() == cast<StoreInst>(I)->isVolatile() && |
| 197 | SI->getAlignment() == cast<StoreInst>(I)->getAlignment(); |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 198 | if (const CmpInst *CI = dyn_cast<CmpInst>(this)) |
| 199 | return CI->getPredicate() == cast<CmpInst>(I)->getPredicate(); |
Chris Lattner | ddb6db4 | 2005-05-06 05:51:46 +0000 | [diff] [blame] | 200 | if (const CallInst *CI = dyn_cast<CallInst>(this)) |
Dan Gohman | 9a8af45 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 201 | return CI->isTailCall() == cast<CallInst>(I)->isTailCall() && |
| 202 | CI->getCallingConv() == cast<CallInst>(I)->getCallingConv() && |
| 203 | CI->getAttributes().getRawPointer() == |
| 204 | cast<CallInst>(I)->getAttributes().getRawPointer(); |
| 205 | if (const InvokeInst *CI = dyn_cast<InvokeInst>(this)) |
Nick Lewycky | 41fe88b | 2008-10-27 07:28:44 +0000 | [diff] [blame] | 206 | return CI->getCallingConv() == cast<InvokeInst>(I)->getCallingConv() && |
Dan Gohman | 9a8af45 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 207 | CI->getAttributes().getRawPointer() == |
Nick Lewycky | 41fe88b | 2008-10-27 07:28:44 +0000 | [diff] [blame] | 208 | cast<InvokeInst>(I)->getAttributes().getRawPointer(); |
Dan Gohman | 9a8af45 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 209 | if (const InsertValueInst *IVI = dyn_cast<InsertValueInst>(this)) { |
| 210 | if (IVI->getNumIndices() != cast<InsertValueInst>(I)->getNumIndices()) |
| 211 | return false; |
| 212 | for (unsigned i = 0, e = IVI->getNumIndices(); i != e; ++i) |
| 213 | if (IVI->idx_begin()[i] != cast<InsertValueInst>(I)->idx_begin()[i]) |
| 214 | return false; |
| 215 | return true; |
| 216 | } |
| 217 | if (const ExtractValueInst *EVI = dyn_cast<ExtractValueInst>(this)) { |
| 218 | if (EVI->getNumIndices() != cast<ExtractValueInst>(I)->getNumIndices()) |
| 219 | return false; |
| 220 | for (unsigned i = 0, e = EVI->getNumIndices(); i != e; ++i) |
| 221 | if (EVI->idx_begin()[i] != cast<ExtractValueInst>(I)->idx_begin()[i]) |
| 222 | return false; |
| 223 | return true; |
| 224 | } |
| 225 | |
Chris Lattner | 38f1455 | 2004-11-30 02:51:53 +0000 | [diff] [blame] | 226 | return true; |
| 227 | } |
| 228 | |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 229 | // isSameOperationAs |
Dan Gohman | 194ae78 | 2009-06-12 19:03:05 +0000 | [diff] [blame] | 230 | // This should be kept in sync with isEquivalentOperation in |
| 231 | // lib/Transforms/IPO/MergeFunctions.cpp. |
Chris Lattner | e3a0884 | 2008-11-27 08:39:18 +0000 | [diff] [blame] | 232 | bool Instruction::isSameOperationAs(const Instruction *I) const { |
Dan Gohman | 194ae78 | 2009-06-12 19:03:05 +0000 | [diff] [blame] | 233 | if (getOpcode() != I->getOpcode() || |
| 234 | getNumOperands() != I->getNumOperands() || |
| 235 | getType() != I->getType()) |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 236 | return false; |
| 237 | |
| 238 | // We have two instructions of identical opcode and #operands. Check to see |
| 239 | // if all operands are the same type |
| 240 | for (unsigned i = 0, e = getNumOperands(); i != e; ++i) |
| 241 | if (getOperand(i)->getType() != I->getOperand(i)->getType()) |
| 242 | return false; |
| 243 | |
| 244 | // Check special state that is a part of some instructions. |
| 245 | if (const LoadInst *LI = dyn_cast<LoadInst>(this)) |
Dan Gohman | 9a8af45 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 246 | return LI->isVolatile() == cast<LoadInst>(I)->isVolatile() && |
| 247 | LI->getAlignment() == cast<LoadInst>(I)->getAlignment(); |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 248 | if (const StoreInst *SI = dyn_cast<StoreInst>(this)) |
Dan Gohman | 9a8af45 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 249 | return SI->isVolatile() == cast<StoreInst>(I)->isVolatile() && |
| 250 | SI->getAlignment() == cast<StoreInst>(I)->getAlignment(); |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 251 | if (const CmpInst *CI = dyn_cast<CmpInst>(this)) |
| 252 | return CI->getPredicate() == cast<CmpInst>(I)->getPredicate(); |
| 253 | if (const CallInst *CI = dyn_cast<CallInst>(this)) |
Dan Gohman | 9a8af45 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 254 | return CI->isTailCall() == cast<CallInst>(I)->isTailCall() && |
| 255 | CI->getCallingConv() == cast<CallInst>(I)->getCallingConv() && |
| 256 | CI->getAttributes().getRawPointer() == |
| 257 | cast<CallInst>(I)->getAttributes().getRawPointer(); |
| 258 | if (const InvokeInst *CI = dyn_cast<InvokeInst>(this)) |
Nick Lewycky | 41fe88b | 2008-10-27 07:28:44 +0000 | [diff] [blame] | 259 | return CI->getCallingConv() == cast<InvokeInst>(I)->getCallingConv() && |
Dan Gohman | 9a8af45 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 260 | CI->getAttributes().getRawPointer() == |
Nick Lewycky | 41fe88b | 2008-10-27 07:28:44 +0000 | [diff] [blame] | 261 | cast<InvokeInst>(I)->getAttributes().getRawPointer(); |
Dan Gohman | 9a8af45 | 2008-10-16 01:24:45 +0000 | [diff] [blame] | 262 | if (const InsertValueInst *IVI = dyn_cast<InsertValueInst>(this)) { |
| 263 | if (IVI->getNumIndices() != cast<InsertValueInst>(I)->getNumIndices()) |
| 264 | return false; |
| 265 | for (unsigned i = 0, e = IVI->getNumIndices(); i != e; ++i) |
| 266 | if (IVI->idx_begin()[i] != cast<InsertValueInst>(I)->idx_begin()[i]) |
| 267 | return false; |
| 268 | return true; |
| 269 | } |
| 270 | if (const ExtractValueInst *EVI = dyn_cast<ExtractValueInst>(this)) { |
| 271 | if (EVI->getNumIndices() != cast<ExtractValueInst>(I)->getNumIndices()) |
| 272 | return false; |
| 273 | for (unsigned i = 0, e = EVI->getNumIndices(); i != e; ++i) |
| 274 | if (EVI->idx_begin()[i] != cast<ExtractValueInst>(I)->idx_begin()[i]) |
| 275 | return false; |
| 276 | return true; |
| 277 | } |
Reid Spencer | e4d87aa | 2006-12-23 06:05:41 +0000 | [diff] [blame] | 278 | |
| 279 | return true; |
| 280 | } |
| 281 | |
Chris Lattner | 7ae40e7 | 2008-04-20 22:11:30 +0000 | [diff] [blame] | 282 | /// isUsedOutsideOfBlock - Return true if there are any uses of I outside of the |
| 283 | /// specified block. Note that PHI nodes are considered to evaluate their |
| 284 | /// operands in the corresponding predecessor block. |
| 285 | bool Instruction::isUsedOutsideOfBlock(const BasicBlock *BB) const { |
| 286 | for (use_const_iterator UI = use_begin(), E = use_end(); UI != E; ++UI) { |
| 287 | // PHI nodes uses values in the corresponding predecessor block. For other |
| 288 | // instructions, just check to see whether the parent of the use matches up. |
| 289 | const PHINode *PN = dyn_cast<PHINode>(*UI); |
| 290 | if (PN == 0) { |
| 291 | if (cast<Instruction>(*UI)->getParent() != BB) |
| 292 | return true; |
| 293 | continue; |
| 294 | } |
| 295 | |
Gabor Greif | a36791d | 2009-01-23 19:40:15 +0000 | [diff] [blame] | 296 | if (PN->getIncomingBlock(UI) != BB) |
Chris Lattner | 7ae40e7 | 2008-04-20 22:11:30 +0000 | [diff] [blame] | 297 | return true; |
| 298 | } |
| 299 | return false; |
| 300 | } |
| 301 | |
Chris Lattner | d96288a | 2008-05-08 17:16:51 +0000 | [diff] [blame] | 302 | /// mayReadFromMemory - Return true if this instruction may read memory. |
| 303 | /// |
| 304 | bool Instruction::mayReadFromMemory() const { |
| 305 | switch (getOpcode()) { |
| 306 | default: return false; |
| 307 | case Instruction::Free: |
Chris Lattner | d96288a | 2008-05-08 17:16:51 +0000 | [diff] [blame] | 308 | case Instruction::VAArg: |
Chris Lattner | 748118d | 2008-05-08 21:58:49 +0000 | [diff] [blame] | 309 | case Instruction::Load: |
Chris Lattner | d96288a | 2008-05-08 17:16:51 +0000 | [diff] [blame] | 310 | return true; |
| 311 | case Instruction::Call: |
| 312 | return !cast<CallInst>(this)->doesNotAccessMemory(); |
| 313 | case Instruction::Invoke: |
| 314 | return !cast<InvokeInst>(this)->doesNotAccessMemory(); |
Chris Lattner | 748118d | 2008-05-08 21:58:49 +0000 | [diff] [blame] | 315 | case Instruction::Store: |
| 316 | return cast<StoreInst>(this)->isVolatile(); |
Chris Lattner | d96288a | 2008-05-08 17:16:51 +0000 | [diff] [blame] | 317 | } |
| 318 | } |
Chris Lattner | 7ae40e7 | 2008-04-20 22:11:30 +0000 | [diff] [blame] | 319 | |
Chris Lattner | bb5493d | 2007-02-15 23:15:00 +0000 | [diff] [blame] | 320 | /// mayWriteToMemory - Return true if this instruction may modify memory. |
| 321 | /// |
| 322 | bool Instruction::mayWriteToMemory() const { |
| 323 | switch (getOpcode()) { |
| 324 | default: return false; |
| 325 | case Instruction::Free: |
Duncan Sands | a3355ff | 2007-12-03 20:06:50 +0000 | [diff] [blame] | 326 | case Instruction::Store: |
Chris Lattner | bb5493d | 2007-02-15 23:15:00 +0000 | [diff] [blame] | 327 | case Instruction::VAArg: |
| 328 | return true; |
| 329 | case Instruction::Call: |
Duncan Sands | a3355ff | 2007-12-03 20:06:50 +0000 | [diff] [blame] | 330 | return !cast<CallInst>(this)->onlyReadsMemory(); |
Chris Lattner | d96288a | 2008-05-08 17:16:51 +0000 | [diff] [blame] | 331 | case Instruction::Invoke: |
| 332 | return !cast<InvokeInst>(this)->onlyReadsMemory(); |
Chris Lattner | bb5493d | 2007-02-15 23:15:00 +0000 | [diff] [blame] | 333 | case Instruction::Load: |
| 334 | return cast<LoadInst>(this)->isVolatile(); |
| 335 | } |
| 336 | } |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 337 | |
Duncan Sands | 7af1c78 | 2009-05-06 06:49:50 +0000 | [diff] [blame] | 338 | /// mayThrow - Return true if this instruction may throw an exception. |
| 339 | /// |
| 340 | bool Instruction::mayThrow() const { |
| 341 | if (const CallInst *CI = dyn_cast<CallInst>(this)) |
| 342 | return !CI->doesNotThrow(); |
| 343 | return false; |
| 344 | } |
| 345 | |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 346 | /// isAssociative - Return true if the instruction is associative: |
| 347 | /// |
Dan Gohman | ae3a0be | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 348 | /// Associative operators satisfy: x op (y op z) === (x op y) op z |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 349 | /// |
Dan Gohman | ae3a0be | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 350 | /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative. |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 351 | /// |
| 352 | bool Instruction::isAssociative(unsigned Opcode, const Type *Ty) { |
Dan Gohman | ae3a0be | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 353 | return Opcode == And || Opcode == Or || Opcode == Xor || |
| 354 | Opcode == Add || Opcode == Mul; |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 355 | } |
| 356 | |
| 357 | /// isCommutative - Return true if the instruction is commutative: |
| 358 | /// |
Misha Brukman | 6b63452 | 2003-10-10 17:54:14 +0000 | [diff] [blame] | 359 | /// Commutative operators satisfy: (x op y) === (y op x) |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 360 | /// |
| 361 | /// In LLVM, these are the associative operators, plus SetEQ and SetNE, when |
| 362 | /// applied to any type. |
| 363 | /// |
| 364 | bool Instruction::isCommutative(unsigned op) { |
| 365 | switch (op) { |
| 366 | case Add: |
Dan Gohman | ae3a0be | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 367 | case FAdd: |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 368 | case Mul: |
Dan Gohman | ae3a0be | 2009-06-04 22:49:04 +0000 | [diff] [blame] | 369 | case FMul: |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 370 | case And: |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 371 | case Or: |
| 372 | case Xor: |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 373 | return true; |
| 374 | default: |
| 375 | return false; |
| 376 | } |
| 377 | } |
Tanya Lattner | 741bb00 | 2003-07-31 04:05:50 +0000 | [diff] [blame] | 378 | |
Victor Hernandez | 88d9839 | 2009-09-18 19:20:02 +0000 | [diff] [blame] | 379 | // Code here matches isMalloc from MallocHelper, which is not in VMCore. |
| 380 | static bool isMalloc(const Value* I) { |
| 381 | const CallInst *CI = dyn_cast<CallInst>(I); |
| 382 | if (!CI) { |
| 383 | const BitCastInst *BCI = dyn_cast<BitCastInst>(I); |
| 384 | if (!BCI) return false; |
| 385 | |
| 386 | CI = dyn_cast<CallInst>(BCI->getOperand(0)); |
| 387 | } |
| 388 | |
| 389 | if (!CI) return false; |
| 390 | |
| 391 | const Module* M = CI->getParent()->getParent()->getParent(); |
| 392 | Constant *MallocFunc = M->getFunction("malloc"); |
| 393 | |
| 394 | if (CI->getOperand(0) != MallocFunc) |
| 395 | return false; |
| 396 | |
| 397 | return true; |
| 398 | } |
| 399 | |
Eli Friedman | 0b79a77 | 2009-07-17 04:28:42 +0000 | [diff] [blame] | 400 | bool Instruction::isSafeToSpeculativelyExecute() const { |
| 401 | for (unsigned i = 0, e = getNumOperands(); i != e; ++i) |
| 402 | if (Constant *C = dyn_cast<Constant>(getOperand(i))) |
| 403 | if (C->canTrap()) |
| 404 | return false; |
| 405 | |
| 406 | switch (getOpcode()) { |
Tanya Lattner | 741bb00 | 2003-07-31 04:05:50 +0000 | [diff] [blame] | 407 | default: |
Eli Friedman | 0b79a77 | 2009-07-17 04:28:42 +0000 | [diff] [blame] | 408 | return true; |
| 409 | case UDiv: |
| 410 | case URem: { |
| 411 | // x / y is undefined if y == 0, but calcuations like x / 3 are safe. |
| 412 | ConstantInt *Op = dyn_cast<ConstantInt>(getOperand(1)); |
| 413 | return Op && !Op->isNullValue(); |
| 414 | } |
| 415 | case SDiv: |
| 416 | case SRem: { |
| 417 | // x / y is undefined if y == 0, and might be undefined if y == -1, |
| 418 | // but calcuations like x / 3 are safe. |
| 419 | ConstantInt *Op = dyn_cast<ConstantInt>(getOperand(1)); |
| 420 | return Op && !Op->isNullValue() && !Op->isAllOnesValue(); |
| 421 | } |
| 422 | case Load: { |
| 423 | if (cast<LoadInst>(this)->isVolatile()) |
| 424 | return false; |
Victor Hernandez | 88d9839 | 2009-09-18 19:20:02 +0000 | [diff] [blame] | 425 | if (isa<AllocationInst>(getOperand(0)) || isMalloc(getOperand(0))) |
Eli Friedman | 0b79a77 | 2009-07-17 04:28:42 +0000 | [diff] [blame] | 426 | return true; |
| 427 | if (GlobalVariable *GV = dyn_cast<GlobalVariable>(getOperand(0))) |
| 428 | return !GV->hasExternalWeakLinkage(); |
| 429 | // FIXME: Handle cases involving GEPs. We have to be careful because |
| 430 | // a load of a out-of-bounds GEP has undefined behavior. |
Tanya Lattner | 741bb00 | 2003-07-31 04:05:50 +0000 | [diff] [blame] | 431 | return false; |
| 432 | } |
Eli Friedman | 0b79a77 | 2009-07-17 04:28:42 +0000 | [diff] [blame] | 433 | case Call: |
| 434 | return false; // The called function could have undefined behavior or |
| 435 | // side-effects. |
| 436 | // FIXME: We should special-case some intrinsics (bswap, |
| 437 | // overflow-checking arithmetic, etc.) |
| 438 | case VAArg: |
| 439 | case Alloca: |
| 440 | case Malloc: |
| 441 | case Invoke: |
| 442 | case PHI: |
| 443 | case Store: |
| 444 | case Free: |
| 445 | case Ret: |
| 446 | case Br: |
| 447 | case Switch: |
| 448 | case Unwind: |
| 449 | case Unreachable: |
| 450 | return false; // Misc instructions which have effects |
| 451 | } |
Tanya Lattner | 741bb00 | 2003-07-31 04:05:50 +0000 | [diff] [blame] | 452 | } |