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 | // |
| 5 | // This file was developed by the LLVM research group and is distributed under |
| 6 | // the University of Illinois Open Source 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" |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 17 | #include "llvm/SymbolTable.h" |
Reid Spencer | 551ccae | 2004-09-01 22:55:40 +0000 | [diff] [blame] | 18 | #include "llvm/Support/LeakDetector.h" |
Chris Lattner | 4b74c83 | 2003-11-20 17:45:12 +0000 | [diff] [blame] | 19 | using namespace llvm; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 20 | |
Chris Lattner | 96d83f6 | 2005-01-29 00:35:33 +0000 | [diff] [blame] | 21 | Instruction::Instruction(const Type *ty, unsigned it, Use *Ops, unsigned NumOps, |
| 22 | const std::string &Name, Instruction *InsertBefore) |
| 23 | : User(ty, Value::InstructionVal + it, Ops, NumOps, Name), Parent(0) { |
Chris Lattner | d1e693f | 2002-09-08 18:59:35 +0000 | [diff] [blame] | 24 | // Make sure that we get added to a basicblock |
| 25 | LeakDetector::addGarbageObject(this); |
Chris Lattner | 2aa8311 | 2002-09-10 15:45:53 +0000 | [diff] [blame] | 26 | |
| 27 | // If requested, insert this instruction into a basic block... |
| 28 | if (InsertBefore) { |
| 29 | assert(InsertBefore->getParent() && |
| 30 | "Instruction to insert before is not in a basic block!"); |
| 31 | InsertBefore->getParent()->getInstList().insert(InsertBefore, this); |
| 32 | } |
Chris Lattner | 0095054 | 2001-06-06 20:29:01 +0000 | [diff] [blame] | 33 | } |
| 34 | |
Chris Lattner | 96d83f6 | 2005-01-29 00:35:33 +0000 | [diff] [blame] | 35 | Instruction::Instruction(const Type *ty, unsigned it, Use *Ops, unsigned NumOps, |
| 36 | const std::string &Name, BasicBlock *InsertAtEnd) |
| 37 | : User(ty, Value::InstructionVal + it, Ops, NumOps, Name), Parent(0) { |
| 38 | // Make sure that we get added to a basicblock |
| 39 | LeakDetector::addGarbageObject(this); |
Alkis Evlogimenos | e5828f1 | 2004-05-26 21:41:09 +0000 | [diff] [blame] | 40 | |
| 41 | // append this instruction into the basic block |
| 42 | assert(InsertAtEnd && "Basic block to append to may not be NULL!"); |
| 43 | InsertAtEnd->getInstList().push_back(this); |
| 44 | } |
| 45 | |
Chris Lattner | 70aa33e | 2006-06-21 16:53:47 +0000 | [diff] [blame] | 46 | // Out of line virtual method, so the vtable, etc has a home. |
| 47 | Instruction::~Instruction() { |
| 48 | assert(Parent == 0 && "Instruction still linked in the program!"); |
| 49 | } |
| 50 | |
| 51 | |
Chris Lattner | 40515db | 2004-06-27 18:38:48 +0000 | [diff] [blame] | 52 | void Instruction::setOpcode(unsigned opc) { |
| 53 | setValueType(Value::InstructionVal + opc); |
| 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 | |
Chris Lattner | 0fe34d8 | 2005-08-08 05:21:50 +0000 | [diff] [blame] | 74 | /// moveBefore - Unlink this instruction from its current basic block and |
| 75 | /// insert it into the basic block that MovePos lives in, right before |
| 76 | /// MovePos. |
| 77 | void Instruction::moveBefore(Instruction *MovePos) { |
| 78 | MovePos->getParent()->getInstList().splice(MovePos,getParent()->getInstList(), |
| 79 | this); |
| 80 | } |
| 81 | |
| 82 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 83 | const char *Instruction::getOpcodeName(unsigned OpCode) { |
| 84 | switch (OpCode) { |
| 85 | // Terminators |
Chris Lattner | 0513e9f | 2002-08-14 18:18:02 +0000 | [diff] [blame] | 86 | case Ret: return "ret"; |
| 87 | case Br: return "br"; |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 88 | case Switch: return "switch"; |
| 89 | case Invoke: return "invoke"; |
Chris Lattner | a6ce898 | 2003-09-08 18:54:36 +0000 | [diff] [blame] | 90 | case Unwind: return "unwind"; |
Chris Lattner | b976e66 | 2004-10-16 18:08:06 +0000 | [diff] [blame] | 91 | case Unreachable: return "unreachable"; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 92 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 93 | // Standard binary operators... |
| 94 | case Add: return "add"; |
| 95 | case Sub: return "sub"; |
| 96 | case Mul: return "mul"; |
Reid Spencer | 1628cec | 2006-10-26 06:15:43 +0000 | [diff] [blame] | 97 | case UDiv: return "udiv"; |
| 98 | case SDiv: return "sdiv"; |
| 99 | case FDiv: return "fdiv"; |
Reid Spencer | 0a783f7 | 2006-11-02 01:53:59 +0000 | [diff] [blame] | 100 | case URem: return "urem"; |
| 101 | case SRem: return "srem"; |
| 102 | case FRem: return "frem"; |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 103 | |
| 104 | // Logical operators... |
| 105 | case And: return "and"; |
| 106 | case Or : return "or"; |
| 107 | case Xor: return "xor"; |
| 108 | |
| 109 | // SetCC operators... |
| 110 | case SetLE: return "setle"; |
| 111 | case SetGE: return "setge"; |
| 112 | case SetLT: return "setlt"; |
| 113 | case SetGT: return "setgt"; |
| 114 | case SetEQ: return "seteq"; |
| 115 | case SetNE: return "setne"; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 116 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 117 | // Memory instructions... |
| 118 | case Malloc: return "malloc"; |
| 119 | case Free: return "free"; |
| 120 | case Alloca: return "alloca"; |
| 121 | case Load: return "load"; |
| 122 | case Store: return "store"; |
| 123 | case GetElementPtr: return "getelementptr"; |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 124 | |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame^] | 125 | // Convert instructions... |
| 126 | case Trunc: return "trunc"; |
| 127 | case ZExt: return "zext"; |
| 128 | case SExt: return "sext"; |
| 129 | case FPTrunc: return "fptrunc"; |
| 130 | case FPExt: return "fpext"; |
| 131 | case FPToUI: return "fptoui"; |
| 132 | case FPToSI: return "fptosi"; |
| 133 | case UIToFP: return "uitofp"; |
| 134 | case SIToFP: return "sitofp"; |
| 135 | case IntToPtr: return "inttoptr"; |
| 136 | case PtrToInt: return "ptrtoint"; |
| 137 | case BitCast: return "bitcast"; |
| 138 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 139 | // Other instructions... |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame^] | 140 | case PHI: return "phi"; |
| 141 | case Select: return "select"; |
| 142 | case Call: return "call"; |
| 143 | case Shl: return "shl"; |
| 144 | case LShr: return "lshr"; |
| 145 | case AShr: return "ashr"; |
| 146 | case VAArg: return "va_arg"; |
Robert Bocchino | b52ee7f | 2006-01-10 19:05:34 +0000 | [diff] [blame] | 147 | case ExtractElement: return "extractelement"; |
Reid Spencer | 3da59db | 2006-11-27 01:05:10 +0000 | [diff] [blame^] | 148 | case InsertElement: return "insertelement"; |
| 149 | case ShuffleVector: return "shufflevector"; |
Chris Lattner | 8f77dae | 2003-05-08 02:44:12 +0000 | [diff] [blame] | 150 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 151 | default: return "<Invalid operator> "; |
| 152 | } |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 153 | |
Vikram S. Adve | c105645 | 2002-07-14 23:09:40 +0000 | [diff] [blame] | 154 | return 0; |
| 155 | } |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 156 | |
Chris Lattner | 38f1455 | 2004-11-30 02:51:53 +0000 | [diff] [blame] | 157 | /// isIdenticalTo - Return true if the specified instruction is exactly |
| 158 | /// identical to the current one. This means that all operands match and any |
| 159 | /// extra information (e.g. load is volatile) agree. |
| 160 | bool Instruction::isIdenticalTo(Instruction *I) const { |
| 161 | if (getOpcode() != I->getOpcode() || |
| 162 | getNumOperands() != I->getNumOperands() || |
| 163 | getType() != I->getType()) |
| 164 | return false; |
| 165 | |
| 166 | // We have two instructions of identical opcode and #operands. Check to see |
| 167 | // if all operands are the same. |
| 168 | for (unsigned i = 0, e = getNumOperands(); i != e; ++i) |
| 169 | if (getOperand(i) != I->getOperand(i)) |
| 170 | return false; |
| 171 | |
| 172 | // Check special state that is a part of some instructions. |
| 173 | if (const LoadInst *LI = dyn_cast<LoadInst>(this)) |
| 174 | return LI->isVolatile() == cast<LoadInst>(I)->isVolatile(); |
| 175 | if (const StoreInst *SI = dyn_cast<StoreInst>(this)) |
| 176 | return SI->isVolatile() == cast<StoreInst>(I)->isVolatile(); |
Chris Lattner | ddb6db4 | 2005-05-06 05:51:46 +0000 | [diff] [blame] | 177 | if (const CallInst *CI = dyn_cast<CallInst>(this)) |
| 178 | return CI->isTailCall() == cast<CallInst>(I)->isTailCall(); |
Chris Lattner | 38f1455 | 2004-11-30 02:51:53 +0000 | [diff] [blame] | 179 | return true; |
| 180 | } |
| 181 | |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 182 | |
| 183 | /// isAssociative - Return true if the instruction is associative: |
| 184 | /// |
| 185 | /// Associative operators satisfy: x op (y op z) === (x op y) op z) |
| 186 | /// |
| 187 | /// In LLVM, the Add, Mul, And, Or, and Xor operators are associative, when not |
| 188 | /// applied to floating point types. |
| 189 | /// |
| 190 | bool Instruction::isAssociative(unsigned Opcode, const Type *Ty) { |
Chris Lattner | 4d3839d | 2006-10-26 18:27:26 +0000 | [diff] [blame] | 191 | if (Opcode == And || Opcode == Or || Opcode == Xor) |
| 192 | return true; |
| 193 | |
| 194 | // Add/Mul reassociate unless they are FP or FP vectors. |
| 195 | if (Opcode == Add || Opcode == Mul) |
| 196 | return !Ty->isFPOrFPVector(); |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 197 | return 0; |
| 198 | } |
| 199 | |
| 200 | /// isCommutative - Return true if the instruction is commutative: |
| 201 | /// |
Misha Brukman | 6b63452 | 2003-10-10 17:54:14 +0000 | [diff] [blame] | 202 | /// Commutative operators satisfy: (x op y) === (y op x) |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 203 | /// |
| 204 | /// In LLVM, these are the associative operators, plus SetEQ and SetNE, when |
| 205 | /// applied to any type. |
| 206 | /// |
| 207 | bool Instruction::isCommutative(unsigned op) { |
| 208 | switch (op) { |
| 209 | case Add: |
| 210 | case Mul: |
Misha Brukman | fd93908 | 2005-04-21 23:48:37 +0000 | [diff] [blame] | 211 | case And: |
Chris Lattner | f2da724 | 2002-10-31 04:14:01 +0000 | [diff] [blame] | 212 | case Or: |
| 213 | case Xor: |
| 214 | case SetEQ: |
| 215 | case SetNE: |
| 216 | return true; |
| 217 | default: |
| 218 | return false; |
| 219 | } |
| 220 | } |
Tanya Lattner | 741bb00 | 2003-07-31 04:05:50 +0000 | [diff] [blame] | 221 | |
Chris Lattner | a5b0740 | 2006-09-17 19:14:47 +0000 | [diff] [blame] | 222 | /// isComparison - Return true if the instruction is a Set* instruction: |
Chris Lattner | 3a534f2 | 2004-01-12 23:18:25 +0000 | [diff] [blame] | 223 | /// |
Chris Lattner | a5b0740 | 2006-09-17 19:14:47 +0000 | [diff] [blame] | 224 | bool Instruction::isComparison(unsigned op) { |
Chris Lattner | 3a534f2 | 2004-01-12 23:18:25 +0000 | [diff] [blame] | 225 | switch (op) { |
| 226 | case SetEQ: |
| 227 | case SetNE: |
| 228 | case SetLT: |
| 229 | case SetGT: |
| 230 | case SetLE: |
| 231 | case SetGE: |
| 232 | return true; |
| 233 | } |
| 234 | return false; |
| 235 | } |
| 236 | |
| 237 | |
Tanya Lattner | 741bb00 | 2003-07-31 04:05:50 +0000 | [diff] [blame] | 238 | |
| 239 | /// isTrappingInstruction - Return true if the instruction may trap. |
| 240 | /// |
Tanya Lattner | ec127bb | 2003-07-31 05:06:09 +0000 | [diff] [blame] | 241 | bool Instruction::isTrapping(unsigned op) { |
Tanya Lattner | 741bb00 | 2003-07-31 04:05:50 +0000 | [diff] [blame] | 242 | switch(op) { |
Reid Spencer | 1628cec | 2006-10-26 06:15:43 +0000 | [diff] [blame] | 243 | case UDiv: |
| 244 | case SDiv: |
| 245 | case FDiv: |
Reid Spencer | 0a783f7 | 2006-11-02 01:53:59 +0000 | [diff] [blame] | 246 | case URem: |
| 247 | case SRem: |
| 248 | case FRem: |
Tanya Lattner | 741bb00 | 2003-07-31 04:05:50 +0000 | [diff] [blame] | 249 | case Load: |
| 250 | case Store: |
| 251 | case Call: |
| 252 | case Invoke: |
| 253 | return true; |
| 254 | default: |
| 255 | return false; |
| 256 | } |
| 257 | } |