Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 1 | //===- InstructionCombining.cpp - Combine multiple instructions -----------===// |
John Criswell | b576c94 | 2003-10-20 19:43:21 +0000 | [diff] [blame] | 2 | // |
| 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. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 9 | // |
| 10 | // InstructionCombining - Combine instructions to form fewer, simple |
Chris Lattner | 62b14df | 2002-09-02 04:59:56 +0000 | [diff] [blame] | 11 | // instructions. This pass does not modify the CFG This pass is where algebraic |
| 12 | // simplification happens. |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 13 | // |
| 14 | // This pass combines things like: |
Chris Lattner | 32ed46b | 2004-05-04 15:19:33 +0000 | [diff] [blame] | 15 | // %Y = add int %X, 1 |
| 16 | // %Z = add int %Y, 1 |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 17 | // into: |
Chris Lattner | 32ed46b | 2004-05-04 15:19:33 +0000 | [diff] [blame] | 18 | // %Z = add int %X, 2 |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 19 | // |
| 20 | // This is a simple worklist driven algorithm. |
| 21 | // |
Chris Lattner | 065a616 | 2003-09-10 05:29:43 +0000 | [diff] [blame] | 22 | // This pass guarantees that the following canonicalizations are performed on |
Chris Lattner | 2cd9196 | 2003-07-23 21:41:57 +0000 | [diff] [blame] | 23 | // the program: |
| 24 | // 1. If a binary operator has a constant operand, it is moved to the RHS |
Chris Lattner | df17af1 | 2003-08-12 21:53:41 +0000 | [diff] [blame] | 25 | // 2. Bitwise operators with constant operands are always grouped so that |
| 26 | // shifts are performed first, then or's, then and's, then xor's. |
Chris Lattner | 2cd9196 | 2003-07-23 21:41:57 +0000 | [diff] [blame] | 27 | // 3. SetCC instructions are converted from <,>,<=,>= to ==,!= if possible |
| 28 | // 4. All SetCC instructions on boolean values are replaced with logical ops |
Chris Lattner | e92d2f4 | 2003-08-13 04:18:28 +0000 | [diff] [blame] | 29 | // 5. add X, X is represented as (X*2) => (X << 1) |
| 30 | // 6. Multiplies with a power-of-two constant argument are transformed into |
| 31 | // shifts. |
Chris Lattner | 2cd9196 | 2003-07-23 21:41:57 +0000 | [diff] [blame] | 32 | // N. This list is incomplete |
| 33 | // |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 34 | //===----------------------------------------------------------------------===// |
| 35 | |
Chris Lattner | 0cea42a | 2004-03-13 23:54:27 +0000 | [diff] [blame] | 36 | #define DEBUG_TYPE "instcombine" |
Chris Lattner | 022103b | 2002-05-07 20:03:00 +0000 | [diff] [blame] | 37 | #include "llvm/Transforms/Scalar.h" |
Chris Lattner | c54e2b8 | 2003-05-22 19:07:21 +0000 | [diff] [blame] | 38 | #include "llvm/Instructions.h" |
Chris Lattner | 7bcc0e7 | 2004-02-28 05:22:00 +0000 | [diff] [blame] | 39 | #include "llvm/Intrinsics.h" |
Chris Lattner | bd0ef77 | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 40 | #include "llvm/Pass.h" |
Chris Lattner | 2a9c847 | 2003-05-27 16:40:51 +0000 | [diff] [blame] | 41 | #include "llvm/Constants.h" |
Chris Lattner | 0864acf | 2002-11-04 16:18:53 +0000 | [diff] [blame] | 42 | #include "llvm/DerivedTypes.h" |
Chris Lattner | 833b8a4 | 2003-06-26 05:06:25 +0000 | [diff] [blame] | 43 | #include "llvm/GlobalVariable.h" |
Chris Lattner | bc61e66 | 2003-11-02 05:57:39 +0000 | [diff] [blame] | 44 | #include "llvm/Target/TargetData.h" |
| 45 | #include "llvm/Transforms/Utils/BasicBlockUtils.h" |
| 46 | #include "llvm/Transforms/Utils/Local.h" |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 47 | #include "llvm/Support/CallSite.h" |
| 48 | #include "llvm/Support/GetElementPtrTypeIterator.h" |
Chris Lattner | 221d688 | 2002-02-12 21:07:25 +0000 | [diff] [blame] | 49 | #include "llvm/Support/InstIterator.h" |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 50 | #include "llvm/Support/InstVisitor.h" |
Chris Lattner | 0cea42a | 2004-03-13 23:54:27 +0000 | [diff] [blame] | 51 | #include "Support/Debug.h" |
Chris Lattner | a92f696 | 2002-10-01 22:38:41 +0000 | [diff] [blame] | 52 | #include "Support/Statistic.h" |
Chris Lattner | b3bc8fa | 2002-05-14 15:24:07 +0000 | [diff] [blame] | 53 | #include <algorithm> |
Chris Lattner | 67b1e1b | 2003-12-07 01:24:23 +0000 | [diff] [blame] | 54 | using namespace llvm; |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 55 | |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 56 | namespace { |
Chris Lattner | a92f696 | 2002-10-01 22:38:41 +0000 | [diff] [blame] | 57 | Statistic<> NumCombined ("instcombine", "Number of insts combined"); |
| 58 | Statistic<> NumConstProp("instcombine", "Number of constant folds"); |
| 59 | Statistic<> NumDeadInst ("instcombine", "Number of dead inst eliminated"); |
| 60 | |
Chris Lattner | f57b845 | 2002-04-27 06:56:12 +0000 | [diff] [blame] | 61 | class InstCombiner : public FunctionPass, |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 62 | public InstVisitor<InstCombiner, Instruction*> { |
| 63 | // Worklist of all of the instructions that need to be simplified. |
| 64 | std::vector<Instruction*> WorkList; |
Chris Lattner | bc61e66 | 2003-11-02 05:57:39 +0000 | [diff] [blame] | 65 | TargetData *TD; |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 66 | |
Chris Lattner | 7bcc0e7 | 2004-02-28 05:22:00 +0000 | [diff] [blame] | 67 | /// AddUsersToWorkList - When an instruction is simplified, add all users of |
| 68 | /// the instruction to the work lists because they might get more simplified |
| 69 | /// now. |
| 70 | /// |
| 71 | void AddUsersToWorkList(Instruction &I) { |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 72 | for (Value::use_iterator UI = I.use_begin(), UE = I.use_end(); |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 73 | UI != UE; ++UI) |
| 74 | WorkList.push_back(cast<Instruction>(*UI)); |
| 75 | } |
| 76 | |
Chris Lattner | 7bcc0e7 | 2004-02-28 05:22:00 +0000 | [diff] [blame] | 77 | /// AddUsesToWorkList - When an instruction is simplified, add operands to |
| 78 | /// the work lists because they might get more simplified now. |
| 79 | /// |
| 80 | void AddUsesToWorkList(Instruction &I) { |
| 81 | for (unsigned i = 0, e = I.getNumOperands(); i != e; ++i) |
| 82 | if (Instruction *Op = dyn_cast<Instruction>(I.getOperand(i))) |
| 83 | WorkList.push_back(Op); |
| 84 | } |
| 85 | |
Chris Lattner | 62b14df | 2002-09-02 04:59:56 +0000 | [diff] [blame] | 86 | // removeFromWorkList - remove all instances of I from the worklist. |
| 87 | void removeFromWorkList(Instruction *I); |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 88 | public: |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 89 | virtual bool runOnFunction(Function &F); |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 90 | |
Chris Lattner | 97e52e4 | 2002-04-28 21:27:06 +0000 | [diff] [blame] | 91 | virtual void getAnalysisUsage(AnalysisUsage &AU) const { |
Chris Lattner | bc61e66 | 2003-11-02 05:57:39 +0000 | [diff] [blame] | 92 | AU.addRequired<TargetData>(); |
Chris Lattner | cb2610e | 2002-10-21 20:00:28 +0000 | [diff] [blame] | 93 | AU.setPreservesCFG(); |
Chris Lattner | 97e52e4 | 2002-04-28 21:27:06 +0000 | [diff] [blame] | 94 | } |
| 95 | |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 96 | TargetData &getTargetData() const { return *TD; } |
| 97 | |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 98 | // Visitation implementation - Implement instruction combining for different |
| 99 | // instruction types. The semantics are as follows: |
| 100 | // Return Value: |
| 101 | // null - No change was made |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 102 | // I - Change was made, I is still valid, I may be dead though |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 103 | // otherwise - Change was made, replace I with returned instruction |
| 104 | // |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 105 | Instruction *visitAdd(BinaryOperator &I); |
| 106 | Instruction *visitSub(BinaryOperator &I); |
| 107 | Instruction *visitMul(BinaryOperator &I); |
| 108 | Instruction *visitDiv(BinaryOperator &I); |
| 109 | Instruction *visitRem(BinaryOperator &I); |
| 110 | Instruction *visitAnd(BinaryOperator &I); |
| 111 | Instruction *visitOr (BinaryOperator &I); |
| 112 | Instruction *visitXor(BinaryOperator &I); |
| 113 | Instruction *visitSetCondInst(BinaryOperator &I); |
Chris Lattner | ea34005 | 2003-03-10 19:16:08 +0000 | [diff] [blame] | 114 | Instruction *visitShiftInst(ShiftInst &I); |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 115 | Instruction *visitCastInst(CastInst &CI); |
Chris Lattner | 3d69f46 | 2004-03-12 05:52:32 +0000 | [diff] [blame] | 116 | Instruction *visitSelectInst(SelectInst &CI); |
Chris Lattner | 9fe3886 | 2003-06-19 17:00:31 +0000 | [diff] [blame] | 117 | Instruction *visitCallInst(CallInst &CI); |
| 118 | Instruction *visitInvokeInst(InvokeInst &II); |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 119 | Instruction *visitPHINode(PHINode &PN); |
| 120 | Instruction *visitGetElementPtrInst(GetElementPtrInst &GEP); |
Chris Lattner | 0864acf | 2002-11-04 16:18:53 +0000 | [diff] [blame] | 121 | Instruction *visitAllocationInst(AllocationInst &AI); |
Chris Lattner | 67b1e1b | 2003-12-07 01:24:23 +0000 | [diff] [blame] | 122 | Instruction *visitFreeInst(FreeInst &FI); |
Chris Lattner | 833b8a4 | 2003-06-26 05:06:25 +0000 | [diff] [blame] | 123 | Instruction *visitLoadInst(LoadInst &LI); |
Chris Lattner | c4d10eb | 2003-06-04 04:46:00 +0000 | [diff] [blame] | 124 | Instruction *visitBranchInst(BranchInst &BI); |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 125 | |
| 126 | // visitInstruction - Specify what to return for unhandled instructions... |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 127 | Instruction *visitInstruction(Instruction &I) { return 0; } |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 128 | |
Chris Lattner | 9fe3886 | 2003-06-19 17:00:31 +0000 | [diff] [blame] | 129 | private: |
Chris Lattner | a44d8a2 | 2003-10-07 22:32:43 +0000 | [diff] [blame] | 130 | Instruction *visitCallSite(CallSite CS); |
Chris Lattner | 9fe3886 | 2003-06-19 17:00:31 +0000 | [diff] [blame] | 131 | bool transformConstExprCastCall(CallSite CS); |
| 132 | |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 133 | public: |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 134 | // InsertNewInstBefore - insert an instruction New before instruction Old |
| 135 | // in the program. Add the new instruction to the worklist. |
| 136 | // |
Chris Lattner | 4cb170c | 2004-02-23 06:38:22 +0000 | [diff] [blame] | 137 | Value *InsertNewInstBefore(Instruction *New, Instruction &Old) { |
Chris Lattner | e6f9a91 | 2002-08-23 18:32:43 +0000 | [diff] [blame] | 138 | assert(New && New->getParent() == 0 && |
| 139 | "New instruction already inserted into a basic block!"); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 140 | BasicBlock *BB = Old.getParent(); |
| 141 | BB->getInstList().insert(&Old, New); // Insert inst |
| 142 | WorkList.push_back(New); // Add to worklist |
Chris Lattner | 4cb170c | 2004-02-23 06:38:22 +0000 | [diff] [blame] | 143 | return New; |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 144 | } |
| 145 | |
| 146 | // ReplaceInstUsesWith - This method is to be used when an instruction is |
| 147 | // found to be dead, replacable with another preexisting expression. Here |
| 148 | // we add all uses of I to the worklist, replace all uses of I with the new |
| 149 | // value, then return I, so that the inst combiner will know that I was |
| 150 | // modified. |
| 151 | // |
| 152 | Instruction *ReplaceInstUsesWith(Instruction &I, Value *V) { |
Chris Lattner | 7bcc0e7 | 2004-02-28 05:22:00 +0000 | [diff] [blame] | 153 | AddUsersToWorkList(I); // Add all modified instrs to worklist |
Chris Lattner | 15a76c0 | 2004-04-05 02:10:19 +0000 | [diff] [blame] | 154 | if (&I != V) { |
| 155 | I.replaceAllUsesWith(V); |
| 156 | return &I; |
| 157 | } else { |
| 158 | // If we are replacing the instruction with itself, this must be in a |
| 159 | // segment of unreachable code, so just clobber the instruction. |
| 160 | I.replaceAllUsesWith(Constant::getNullValue(I.getType())); |
| 161 | return &I; |
| 162 | } |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 163 | } |
Chris Lattner | 7bcc0e7 | 2004-02-28 05:22:00 +0000 | [diff] [blame] | 164 | |
| 165 | // EraseInstFromFunction - When dealing with an instruction that has side |
| 166 | // effects or produces a void value, we can't rely on DCE to delete the |
| 167 | // instruction. Instead, visit methods should return the value returned by |
| 168 | // this function. |
| 169 | Instruction *EraseInstFromFunction(Instruction &I) { |
| 170 | assert(I.use_empty() && "Cannot erase instruction that is used!"); |
| 171 | AddUsesToWorkList(I); |
| 172 | removeFromWorkList(&I); |
| 173 | I.getParent()->getInstList().erase(&I); |
| 174 | return 0; // Don't do anything with FI |
| 175 | } |
| 176 | |
| 177 | |
Chris Lattner | aa9c1f1 | 2003-08-13 20:16:26 +0000 | [diff] [blame] | 178 | private: |
Chris Lattner | 24c8e38 | 2003-07-24 17:35:25 +0000 | [diff] [blame] | 179 | /// InsertOperandCastBefore - This inserts a cast of V to DestTy before the |
| 180 | /// InsertBefore instruction. This is specialized a bit to avoid inserting |
| 181 | /// casts that are known to not do anything... |
| 182 | /// |
| 183 | Value *InsertOperandCastBefore(Value *V, const Type *DestTy, |
| 184 | Instruction *InsertBefore); |
| 185 | |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 186 | // SimplifyCommutative - This performs a few simplifications for commutative |
| 187 | // operators... |
| 188 | bool SimplifyCommutative(BinaryOperator &I); |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 189 | |
| 190 | Instruction *OptAndOp(Instruction *Op, ConstantIntegral *OpRHS, |
| 191 | ConstantIntegral *AndRHS, BinaryOperator &TheAnd); |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 192 | }; |
Chris Lattner | f629309 | 2002-07-23 18:06:35 +0000 | [diff] [blame] | 193 | |
Chris Lattner | a6275cc | 2002-07-26 21:12:46 +0000 | [diff] [blame] | 194 | RegisterOpt<InstCombiner> X("instcombine", "Combine redundant instructions"); |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 195 | } |
| 196 | |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 197 | // getComplexity: Assign a complexity or rank value to LLVM Values... |
| 198 | // 0 -> Constant, 1 -> Other, 2 -> Argument, 2 -> Unary, 3 -> OtherInst |
| 199 | static unsigned getComplexity(Value *V) { |
| 200 | if (isa<Instruction>(V)) { |
| 201 | if (BinaryOperator::isNeg(V) || BinaryOperator::isNot(V)) |
| 202 | return 2; |
| 203 | return 3; |
| 204 | } |
| 205 | if (isa<Argument>(V)) return 2; |
| 206 | return isa<Constant>(V) ? 0 : 1; |
| 207 | } |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 208 | |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 209 | // isOnlyUse - Return true if this instruction will be deleted if we stop using |
| 210 | // it. |
| 211 | static bool isOnlyUse(Value *V) { |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 212 | return V->hasOneUse() || isa<Constant>(V); |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 213 | } |
| 214 | |
Chris Lattner | 4cb170c | 2004-02-23 06:38:22 +0000 | [diff] [blame] | 215 | // getSignedIntegralType - Given an unsigned integral type, return the signed |
| 216 | // version of it that has the same size. |
| 217 | static const Type *getSignedIntegralType(const Type *Ty) { |
| 218 | switch (Ty->getPrimitiveID()) { |
| 219 | default: assert(0 && "Invalid unsigned integer type!"); abort(); |
| 220 | case Type::UByteTyID: return Type::SByteTy; |
| 221 | case Type::UShortTyID: return Type::ShortTy; |
| 222 | case Type::UIntTyID: return Type::IntTy; |
| 223 | case Type::ULongTyID: return Type::LongTy; |
| 224 | } |
| 225 | } |
| 226 | |
Chris Lattner | 9c29067 | 2004-03-12 23:53:13 +0000 | [diff] [blame] | 227 | // getUnsignedIntegralType - Given an signed integral type, return the unsigned |
| 228 | // version of it that has the same size. |
| 229 | static const Type *getUnsignedIntegralType(const Type *Ty) { |
| 230 | switch (Ty->getPrimitiveID()) { |
| 231 | default: assert(0 && "Invalid signed integer type!"); abort(); |
| 232 | case Type::SByteTyID: return Type::UByteTy; |
| 233 | case Type::ShortTyID: return Type::UShortTy; |
| 234 | case Type::IntTyID: return Type::UIntTy; |
| 235 | case Type::LongTyID: return Type::ULongTy; |
| 236 | } |
| 237 | } |
| 238 | |
Chris Lattner | 4cb170c | 2004-02-23 06:38:22 +0000 | [diff] [blame] | 239 | // getPromotedType - Return the specified type promoted as it would be to pass |
| 240 | // though a va_arg area... |
| 241 | static const Type *getPromotedType(const Type *Ty) { |
| 242 | switch (Ty->getPrimitiveID()) { |
| 243 | case Type::SByteTyID: |
| 244 | case Type::ShortTyID: return Type::IntTy; |
| 245 | case Type::UByteTyID: |
| 246 | case Type::UShortTyID: return Type::UIntTy; |
| 247 | case Type::FloatTyID: return Type::DoubleTy; |
| 248 | default: return Ty; |
| 249 | } |
| 250 | } |
| 251 | |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 252 | // SimplifyCommutative - This performs a few simplifications for commutative |
| 253 | // operators: |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 254 | // |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 255 | // 1. Order operands such that they are listed from right (least complex) to |
| 256 | // left (most complex). This puts constants before unary operators before |
| 257 | // binary operators. |
| 258 | // |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 259 | // 2. Transform: (op (op V, C1), C2) ==> (op V, (op C1, C2)) |
| 260 | // 3. Transform: (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2)) |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 261 | // |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 262 | bool InstCombiner::SimplifyCommutative(BinaryOperator &I) { |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 263 | bool Changed = false; |
| 264 | if (getComplexity(I.getOperand(0)) < getComplexity(I.getOperand(1))) |
| 265 | Changed = !I.swapOperands(); |
| 266 | |
| 267 | if (!I.isAssociative()) return Changed; |
| 268 | Instruction::BinaryOps Opcode = I.getOpcode(); |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 269 | if (BinaryOperator *Op = dyn_cast<BinaryOperator>(I.getOperand(0))) |
| 270 | if (Op->getOpcode() == Opcode && isa<Constant>(Op->getOperand(1))) { |
| 271 | if (isa<Constant>(I.getOperand(1))) { |
Chris Lattner | 2a9c847 | 2003-05-27 16:40:51 +0000 | [diff] [blame] | 272 | Constant *Folded = ConstantExpr::get(I.getOpcode(), |
| 273 | cast<Constant>(I.getOperand(1)), |
| 274 | cast<Constant>(Op->getOperand(1))); |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 275 | I.setOperand(0, Op->getOperand(0)); |
| 276 | I.setOperand(1, Folded); |
| 277 | return true; |
| 278 | } else if (BinaryOperator *Op1=dyn_cast<BinaryOperator>(I.getOperand(1))) |
| 279 | if (Op1->getOpcode() == Opcode && isa<Constant>(Op1->getOperand(1)) && |
| 280 | isOnlyUse(Op) && isOnlyUse(Op1)) { |
| 281 | Constant *C1 = cast<Constant>(Op->getOperand(1)); |
| 282 | Constant *C2 = cast<Constant>(Op1->getOperand(1)); |
| 283 | |
| 284 | // Fold (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2)) |
Chris Lattner | 2a9c847 | 2003-05-27 16:40:51 +0000 | [diff] [blame] | 285 | Constant *Folded = ConstantExpr::get(I.getOpcode(), C1, C2); |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 286 | Instruction *New = BinaryOperator::create(Opcode, Op->getOperand(0), |
| 287 | Op1->getOperand(0), |
| 288 | Op1->getName(), &I); |
| 289 | WorkList.push_back(New); |
| 290 | I.setOperand(0, New); |
| 291 | I.setOperand(1, Folded); |
| 292 | return true; |
| 293 | } |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 294 | } |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 295 | return Changed; |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 296 | } |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 297 | |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 298 | // dyn_castNegVal - Given a 'sub' instruction, return the RHS of the instruction |
| 299 | // if the LHS is a constant zero (which is the 'negate' form). |
Chris Lattner | b35dde1 | 2002-05-06 16:49:18 +0000 | [diff] [blame] | 300 | // |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 301 | static inline Value *dyn_castNegVal(Value *V) { |
| 302 | if (BinaryOperator::isNeg(V)) |
| 303 | return BinaryOperator::getNegArgument(cast<BinaryOperator>(V)); |
| 304 | |
Chris Lattner | fe32e0c | 2003-04-30 22:19:10 +0000 | [diff] [blame] | 305 | // Constants can be considered to be negated values if they can be folded... |
| 306 | if (Constant *C = dyn_cast<Constant>(V)) |
Chris Lattner | 2a9c847 | 2003-05-27 16:40:51 +0000 | [diff] [blame] | 307 | return ConstantExpr::get(Instruction::Sub, |
| 308 | Constant::getNullValue(V->getType()), C); |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 309 | return 0; |
Chris Lattner | b35dde1 | 2002-05-06 16:49:18 +0000 | [diff] [blame] | 310 | } |
| 311 | |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 312 | static Constant *NotConstant(Constant *C) { |
| 313 | return ConstantExpr::get(Instruction::Xor, C, |
| 314 | ConstantIntegral::getAllOnesValue(C->getType())); |
| 315 | } |
| 316 | |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 317 | static inline Value *dyn_castNotVal(Value *V) { |
| 318 | if (BinaryOperator::isNot(V)) |
| 319 | return BinaryOperator::getNotArgument(cast<BinaryOperator>(V)); |
| 320 | |
| 321 | // Constants can be considered to be not'ed values... |
Chris Lattner | 3f2ec39 | 2003-04-30 22:34:06 +0000 | [diff] [blame] | 322 | if (ConstantIntegral *C = dyn_cast<ConstantIntegral>(V)) |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 323 | return NotConstant(C); |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 324 | return 0; |
| 325 | } |
| 326 | |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 327 | // dyn_castFoldableMul - If this value is a multiply that can be folded into |
| 328 | // other computations (because it has a constant operand), return the |
| 329 | // non-constant operand of the multiply. |
| 330 | // |
| 331 | static inline Value *dyn_castFoldableMul(Value *V) { |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 332 | if (V->hasOneUse() && V->getType()->isInteger()) |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 333 | if (Instruction *I = dyn_cast<Instruction>(V)) |
| 334 | if (I->getOpcode() == Instruction::Mul) |
| 335 | if (isa<Constant>(I->getOperand(1))) |
| 336 | return I->getOperand(0); |
| 337 | return 0; |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 338 | } |
Chris Lattner | af2930e | 2002-08-14 17:51:49 +0000 | [diff] [blame] | 339 | |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 340 | // dyn_castMaskingAnd - If this value is an And instruction masking a value with |
| 341 | // a constant, return the constant being anded with. |
| 342 | // |
Chris Lattner | e132d95 | 2003-08-12 19:17:27 +0000 | [diff] [blame] | 343 | template<class ValueType> |
| 344 | static inline Constant *dyn_castMaskingAnd(ValueType *V) { |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 345 | if (Instruction *I = dyn_cast<Instruction>(V)) |
| 346 | if (I->getOpcode() == Instruction::And) |
| 347 | return dyn_cast<Constant>(I->getOperand(1)); |
| 348 | |
| 349 | // If this is a constant, it acts just like we were masking with it. |
| 350 | return dyn_cast<Constant>(V); |
| 351 | } |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 352 | |
| 353 | // Log2 - Calculate the log base 2 for the specified value if it is exactly a |
| 354 | // power of 2. |
| 355 | static unsigned Log2(uint64_t Val) { |
| 356 | assert(Val > 1 && "Values 0 and 1 should be handled elsewhere!"); |
| 357 | unsigned Count = 0; |
| 358 | while (Val != 1) { |
| 359 | if (Val & 1) return 0; // Multiple bits set? |
| 360 | Val >>= 1; |
| 361 | ++Count; |
| 362 | } |
| 363 | return Count; |
Chris Lattner | af2930e | 2002-08-14 17:51:49 +0000 | [diff] [blame] | 364 | } |
| 365 | |
Chris Lattner | 564a727 | 2003-08-13 19:01:45 +0000 | [diff] [blame] | 366 | |
| 367 | /// AssociativeOpt - Perform an optimization on an associative operator. This |
| 368 | /// function is designed to check a chain of associative operators for a |
| 369 | /// potential to apply a certain optimization. Since the optimization may be |
| 370 | /// applicable if the expression was reassociated, this checks the chain, then |
| 371 | /// reassociates the expression as necessary to expose the optimization |
| 372 | /// opportunity. This makes use of a special Functor, which must define |
| 373 | /// 'shouldApply' and 'apply' methods. |
| 374 | /// |
| 375 | template<typename Functor> |
| 376 | Instruction *AssociativeOpt(BinaryOperator &Root, const Functor &F) { |
| 377 | unsigned Opcode = Root.getOpcode(); |
| 378 | Value *LHS = Root.getOperand(0); |
| 379 | |
| 380 | // Quick check, see if the immediate LHS matches... |
| 381 | if (F.shouldApply(LHS)) |
| 382 | return F.apply(Root); |
| 383 | |
| 384 | // Otherwise, if the LHS is not of the same opcode as the root, return. |
| 385 | Instruction *LHSI = dyn_cast<Instruction>(LHS); |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 386 | while (LHSI && LHSI->getOpcode() == Opcode && LHSI->hasOneUse()) { |
Chris Lattner | 564a727 | 2003-08-13 19:01:45 +0000 | [diff] [blame] | 387 | // Should we apply this transform to the RHS? |
| 388 | bool ShouldApply = F.shouldApply(LHSI->getOperand(1)); |
| 389 | |
| 390 | // If not to the RHS, check to see if we should apply to the LHS... |
| 391 | if (!ShouldApply && F.shouldApply(LHSI->getOperand(0))) { |
| 392 | cast<BinaryOperator>(LHSI)->swapOperands(); // Make the LHS the RHS |
| 393 | ShouldApply = true; |
| 394 | } |
| 395 | |
| 396 | // If the functor wants to apply the optimization to the RHS of LHSI, |
| 397 | // reassociate the expression from ((? op A) op B) to (? op (A op B)) |
| 398 | if (ShouldApply) { |
| 399 | BasicBlock *BB = Root.getParent(); |
Chris Lattner | 564a727 | 2003-08-13 19:01:45 +0000 | [diff] [blame] | 400 | |
| 401 | // Now all of the instructions are in the current basic block, go ahead |
| 402 | // and perform the reassociation. |
| 403 | Instruction *TmpLHSI = cast<Instruction>(Root.getOperand(0)); |
| 404 | |
| 405 | // First move the selected RHS to the LHS of the root... |
| 406 | Root.setOperand(0, LHSI->getOperand(1)); |
| 407 | |
| 408 | // Make what used to be the LHS of the root be the user of the root... |
| 409 | Value *ExtraOperand = TmpLHSI->getOperand(1); |
Chris Lattner | 6572531 | 2004-04-16 18:08:07 +0000 | [diff] [blame] | 410 | if (&Root == TmpLHSI) { |
Chris Lattner | 15a76c0 | 2004-04-05 02:10:19 +0000 | [diff] [blame] | 411 | Root.replaceAllUsesWith(Constant::getNullValue(TmpLHSI->getType())); |
| 412 | return 0; |
| 413 | } |
Chris Lattner | 6572531 | 2004-04-16 18:08:07 +0000 | [diff] [blame] | 414 | Root.replaceAllUsesWith(TmpLHSI); // Users now use TmpLHSI |
Chris Lattner | 564a727 | 2003-08-13 19:01:45 +0000 | [diff] [blame] | 415 | TmpLHSI->setOperand(1, &Root); // TmpLHSI now uses the root |
Chris Lattner | 6572531 | 2004-04-16 18:08:07 +0000 | [diff] [blame] | 416 | TmpLHSI->getParent()->getInstList().remove(TmpLHSI); |
| 417 | BasicBlock::iterator ARI = &Root; ++ARI; |
| 418 | BB->getInstList().insert(ARI, TmpLHSI); // Move TmpLHSI to after Root |
| 419 | ARI = Root; |
Chris Lattner | 564a727 | 2003-08-13 19:01:45 +0000 | [diff] [blame] | 420 | |
| 421 | // Now propagate the ExtraOperand down the chain of instructions until we |
| 422 | // get to LHSI. |
| 423 | while (TmpLHSI != LHSI) { |
| 424 | Instruction *NextLHSI = cast<Instruction>(TmpLHSI->getOperand(0)); |
Chris Lattner | 6572531 | 2004-04-16 18:08:07 +0000 | [diff] [blame] | 425 | // Move the instruction to immediately before the chain we are |
| 426 | // constructing to avoid breaking dominance properties. |
| 427 | NextLHSI->getParent()->getInstList().remove(NextLHSI); |
| 428 | BB->getInstList().insert(ARI, NextLHSI); |
| 429 | ARI = NextLHSI; |
| 430 | |
Chris Lattner | 564a727 | 2003-08-13 19:01:45 +0000 | [diff] [blame] | 431 | Value *NextOp = NextLHSI->getOperand(1); |
| 432 | NextLHSI->setOperand(1, ExtraOperand); |
| 433 | TmpLHSI = NextLHSI; |
| 434 | ExtraOperand = NextOp; |
| 435 | } |
| 436 | |
| 437 | // Now that the instructions are reassociated, have the functor perform |
| 438 | // the transformation... |
| 439 | return F.apply(Root); |
| 440 | } |
| 441 | |
| 442 | LHSI = dyn_cast<Instruction>(LHSI->getOperand(0)); |
| 443 | } |
| 444 | return 0; |
| 445 | } |
| 446 | |
| 447 | |
| 448 | // AddRHS - Implements: X + X --> X << 1 |
| 449 | struct AddRHS { |
| 450 | Value *RHS; |
| 451 | AddRHS(Value *rhs) : RHS(rhs) {} |
| 452 | bool shouldApply(Value *LHS) const { return LHS == RHS; } |
| 453 | Instruction *apply(BinaryOperator &Add) const { |
| 454 | return new ShiftInst(Instruction::Shl, Add.getOperand(0), |
| 455 | ConstantInt::get(Type::UByteTy, 1)); |
| 456 | } |
| 457 | }; |
| 458 | |
| 459 | // AddMaskingAnd - Implements (A & C1)+(B & C2) --> (A & C1)|(B & C2) |
| 460 | // iff C1&C2 == 0 |
| 461 | struct AddMaskingAnd { |
| 462 | Constant *C2; |
| 463 | AddMaskingAnd(Constant *c) : C2(c) {} |
| 464 | bool shouldApply(Value *LHS) const { |
| 465 | if (Constant *C1 = dyn_castMaskingAnd(LHS)) |
| 466 | return ConstantExpr::get(Instruction::And, C1, C2)->isNullValue(); |
| 467 | return false; |
| 468 | } |
| 469 | Instruction *apply(BinaryOperator &Add) const { |
| 470 | return BinaryOperator::create(Instruction::Or, Add.getOperand(0), |
| 471 | Add.getOperand(1)); |
| 472 | } |
| 473 | }; |
| 474 | |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 475 | static Value *FoldOperationIntoSelectOperand(Instruction &BI, Value *SO, |
| 476 | InstCombiner *IC) { |
| 477 | // Figure out if the constant is the left or the right argument. |
| 478 | bool ConstIsRHS = isa<Constant>(BI.getOperand(1)); |
| 479 | Constant *ConstOperand = cast<Constant>(BI.getOperand(ConstIsRHS)); |
Chris Lattner | 564a727 | 2003-08-13 19:01:45 +0000 | [diff] [blame] | 480 | |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 481 | if (Constant *SOC = dyn_cast<Constant>(SO)) { |
| 482 | if (ConstIsRHS) |
| 483 | return ConstantExpr::get(BI.getOpcode(), SOC, ConstOperand); |
| 484 | return ConstantExpr::get(BI.getOpcode(), ConstOperand, SOC); |
| 485 | } |
| 486 | |
| 487 | Value *Op0 = SO, *Op1 = ConstOperand; |
| 488 | if (!ConstIsRHS) |
| 489 | std::swap(Op0, Op1); |
| 490 | Instruction *New; |
| 491 | if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&BI)) |
| 492 | New = BinaryOperator::create(BO->getOpcode(), Op0, Op1); |
| 493 | else if (ShiftInst *SI = dyn_cast<ShiftInst>(&BI)) |
| 494 | New = new ShiftInst(SI->getOpcode(), Op0, Op1); |
Chris Lattner | 326c0f3 | 2004-04-10 19:15:56 +0000 | [diff] [blame] | 495 | else { |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 496 | assert(0 && "Unknown binary instruction type!"); |
Chris Lattner | 326c0f3 | 2004-04-10 19:15:56 +0000 | [diff] [blame] | 497 | abort(); |
| 498 | } |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 499 | return IC->InsertNewInstBefore(New, BI); |
| 500 | } |
| 501 | |
| 502 | // FoldBinOpIntoSelect - Given an instruction with a select as one operand and a |
| 503 | // constant as the other operand, try to fold the binary operator into the |
| 504 | // select arguments. |
| 505 | static Instruction *FoldBinOpIntoSelect(Instruction &BI, SelectInst *SI, |
| 506 | InstCombiner *IC) { |
| 507 | // Don't modify shared select instructions |
| 508 | if (!SI->hasOneUse()) return 0; |
| 509 | Value *TV = SI->getOperand(1); |
| 510 | Value *FV = SI->getOperand(2); |
| 511 | |
| 512 | if (isa<Constant>(TV) || isa<Constant>(FV)) { |
| 513 | Value *SelectTrueVal = FoldOperationIntoSelectOperand(BI, TV, IC); |
| 514 | Value *SelectFalseVal = FoldOperationIntoSelectOperand(BI, FV, IC); |
| 515 | |
| 516 | return new SelectInst(SI->getCondition(), SelectTrueVal, |
| 517 | SelectFalseVal); |
| 518 | } |
| 519 | return 0; |
| 520 | } |
Chris Lattner | 564a727 | 2003-08-13 19:01:45 +0000 | [diff] [blame] | 521 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 522 | Instruction *InstCombiner::visitAdd(BinaryOperator &I) { |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 523 | bool Changed = SimplifyCommutative(I); |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 524 | Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); |
Chris Lattner | b35dde1 | 2002-05-06 16:49:18 +0000 | [diff] [blame] | 525 | |
Chris Lattner | 66331a4 | 2004-04-10 22:01:55 +0000 | [diff] [blame] | 526 | if (Constant *RHSC = dyn_cast<Constant>(RHS)) { |
| 527 | // X + 0 --> X |
| 528 | if (!I.getType()->isFloatingPoint() && // -0 + +0 = +0, so it's not a noop |
| 529 | RHSC->isNullValue()) |
| 530 | return ReplaceInstUsesWith(I, LHS); |
| 531 | |
| 532 | // X + (signbit) --> X ^ signbit |
| 533 | if (ConstantInt *CI = dyn_cast<ConstantInt>(RHSC)) { |
| 534 | unsigned NumBits = CI->getType()->getPrimitiveSize()*8; |
| 535 | uint64_t Val = CI->getRawValue() & (1ULL << NumBits)-1; |
| 536 | if (Val == (1ULL << NumBits-1)) |
| 537 | return BinaryOperator::create(Instruction::Xor, LHS, RHS); |
| 538 | } |
| 539 | } |
Chris Lattner | b35dde1 | 2002-05-06 16:49:18 +0000 | [diff] [blame] | 540 | |
Chris Lattner | 564a727 | 2003-08-13 19:01:45 +0000 | [diff] [blame] | 541 | // X + X --> X << 1 |
| 542 | if (I.getType()->isInteger()) |
| 543 | if (Instruction *Result = AssociativeOpt(I, AddRHS(RHS))) return Result; |
Chris Lattner | e92d2f4 | 2003-08-13 04:18:28 +0000 | [diff] [blame] | 544 | |
Chris Lattner | 5c4afb9 | 2002-05-08 22:46:53 +0000 | [diff] [blame] | 545 | // -A + B --> B - A |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 546 | if (Value *V = dyn_castNegVal(LHS)) |
Chris Lattner | 5c4afb9 | 2002-05-08 22:46:53 +0000 | [diff] [blame] | 547 | return BinaryOperator::create(Instruction::Sub, RHS, V); |
Chris Lattner | b35dde1 | 2002-05-06 16:49:18 +0000 | [diff] [blame] | 548 | |
| 549 | // A + -B --> A - B |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 550 | if (!isa<Constant>(RHS)) |
| 551 | if (Value *V = dyn_castNegVal(RHS)) |
| 552 | return BinaryOperator::create(Instruction::Sub, LHS, V); |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 553 | |
Chris Lattner | ad3448c | 2003-02-18 19:57:07 +0000 | [diff] [blame] | 554 | // X*C + X --> X * (C+1) |
| 555 | if (dyn_castFoldableMul(LHS) == RHS) { |
Chris Lattner | 2a9c847 | 2003-05-27 16:40:51 +0000 | [diff] [blame] | 556 | Constant *CP1 = |
| 557 | ConstantExpr::get(Instruction::Add, |
| 558 | cast<Constant>(cast<Instruction>(LHS)->getOperand(1)), |
| 559 | ConstantInt::get(I.getType(), 1)); |
Chris Lattner | ad3448c | 2003-02-18 19:57:07 +0000 | [diff] [blame] | 560 | return BinaryOperator::create(Instruction::Mul, RHS, CP1); |
| 561 | } |
| 562 | |
| 563 | // X + X*C --> X * (C+1) |
| 564 | if (dyn_castFoldableMul(RHS) == LHS) { |
Chris Lattner | 2a9c847 | 2003-05-27 16:40:51 +0000 | [diff] [blame] | 565 | Constant *CP1 = |
| 566 | ConstantExpr::get(Instruction::Add, |
| 567 | cast<Constant>(cast<Instruction>(RHS)->getOperand(1)), |
| 568 | ConstantInt::get(I.getType(), 1)); |
Chris Lattner | ad3448c | 2003-02-18 19:57:07 +0000 | [diff] [blame] | 569 | return BinaryOperator::create(Instruction::Mul, LHS, CP1); |
| 570 | } |
| 571 | |
Chris Lattner | 564a727 | 2003-08-13 19:01:45 +0000 | [diff] [blame] | 572 | // (A & C1)+(B & C2) --> (A & C1)|(B & C2) iff C1&C2 == 0 |
| 573 | if (Constant *C2 = dyn_castMaskingAnd(RHS)) |
| 574 | if (Instruction *R = AssociativeOpt(I, AddMaskingAnd(C2))) return R; |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 575 | |
Chris Lattner | 6b03205 | 2003-10-02 15:11:26 +0000 | [diff] [blame] | 576 | if (ConstantInt *CRHS = dyn_cast<ConstantInt>(RHS)) { |
| 577 | if (Instruction *ILHS = dyn_cast<Instruction>(LHS)) { |
| 578 | switch (ILHS->getOpcode()) { |
| 579 | case Instruction::Xor: |
| 580 | // ~X + C --> (C-1) - X |
| 581 | if (ConstantInt *XorRHS = dyn_cast<ConstantInt>(ILHS->getOperand(1))) |
| 582 | if (XorRHS->isAllOnesValue()) |
| 583 | return BinaryOperator::create(Instruction::Sub, |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 584 | ConstantExpr::get(Instruction::Sub, |
| 585 | CRHS, ConstantInt::get(I.getType(), 1)), |
Chris Lattner | 6b03205 | 2003-10-02 15:11:26 +0000 | [diff] [blame] | 586 | ILHS->getOperand(0)); |
| 587 | break; |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 588 | case Instruction::Select: |
| 589 | // Try to fold constant add into select arguments. |
| 590 | if (Instruction *R = FoldBinOpIntoSelect(I,cast<SelectInst>(ILHS),this)) |
| 591 | return R; |
| 592 | |
Chris Lattner | 6b03205 | 2003-10-02 15:11:26 +0000 | [diff] [blame] | 593 | default: break; |
| 594 | } |
| 595 | } |
| 596 | } |
| 597 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 598 | return Changed ? &I : 0; |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 599 | } |
| 600 | |
Chris Lattner | 1ba5bcd | 2003-07-22 21:46:59 +0000 | [diff] [blame] | 601 | // isSignBit - Return true if the value represented by the constant only has the |
| 602 | // highest order bit set. |
| 603 | static bool isSignBit(ConstantInt *CI) { |
| 604 | unsigned NumBits = CI->getType()->getPrimitiveSize()*8; |
| 605 | return (CI->getRawValue() & ~(-1LL << NumBits)) == (1ULL << (NumBits-1)); |
| 606 | } |
| 607 | |
Chris Lattner | 24c8e38 | 2003-07-24 17:35:25 +0000 | [diff] [blame] | 608 | static unsigned getTypeSizeInBits(const Type *Ty) { |
| 609 | return Ty == Type::BoolTy ? 1 : Ty->getPrimitiveSize()*8; |
| 610 | } |
| 611 | |
Chris Lattner | bfe492b | 2004-03-13 00:11:49 +0000 | [diff] [blame] | 612 | /// RemoveNoopCast - Strip off nonconverting casts from the value. |
| 613 | /// |
| 614 | static Value *RemoveNoopCast(Value *V) { |
| 615 | if (CastInst *CI = dyn_cast<CastInst>(V)) { |
| 616 | const Type *CTy = CI->getType(); |
| 617 | const Type *OpTy = CI->getOperand(0)->getType(); |
| 618 | if (CTy->isInteger() && OpTy->isInteger()) { |
| 619 | if (CTy->getPrimitiveSize() == OpTy->getPrimitiveSize()) |
| 620 | return RemoveNoopCast(CI->getOperand(0)); |
| 621 | } else if (isa<PointerType>(CTy) && isa<PointerType>(OpTy)) |
| 622 | return RemoveNoopCast(CI->getOperand(0)); |
| 623 | } |
| 624 | return V; |
| 625 | } |
| 626 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 627 | Instruction *InstCombiner::visitSub(BinaryOperator &I) { |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 628 | Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1); |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 629 | |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 630 | if (Op0 == Op1) // sub X, X -> 0 |
| 631 | return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType())); |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 632 | |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 633 | // If this is a 'B = x-(-A)', change to B = x+A... |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 634 | if (Value *V = dyn_castNegVal(Op1)) |
Chris Lattner | 5c4afb9 | 2002-05-08 22:46:53 +0000 | [diff] [blame] | 635 | return BinaryOperator::create(Instruction::Add, Op0, V); |
Chris Lattner | b35dde1 | 2002-05-06 16:49:18 +0000 | [diff] [blame] | 636 | |
Chris Lattner | d65460f | 2003-11-05 01:06:05 +0000 | [diff] [blame] | 637 | if (ConstantInt *C = dyn_cast<ConstantInt>(Op0)) { |
| 638 | // Replace (-1 - A) with (~A)... |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 639 | if (C->isAllOnesValue()) |
| 640 | return BinaryOperator::createNot(Op1); |
Chris Lattner | 4037171 | 2002-05-09 01:29:19 +0000 | [diff] [blame] | 641 | |
Chris Lattner | d65460f | 2003-11-05 01:06:05 +0000 | [diff] [blame] | 642 | // C - ~X == X + (1+C) |
| 643 | if (BinaryOperator::isNot(Op1)) |
| 644 | return BinaryOperator::create(Instruction::Add, |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 645 | BinaryOperator::getNotArgument(cast<BinaryOperator>(Op1)), |
| 646 | ConstantExpr::get(Instruction::Add, C, |
| 647 | ConstantInt::get(I.getType(), 1))); |
Chris Lattner | 9c29067 | 2004-03-12 23:53:13 +0000 | [diff] [blame] | 648 | // -((uint)X >> 31) -> ((int)X >> 31) |
| 649 | // -((int)X >> 31) -> ((uint)X >> 31) |
Chris Lattner | bfe492b | 2004-03-13 00:11:49 +0000 | [diff] [blame] | 650 | if (C->isNullValue()) { |
| 651 | Value *NoopCastedRHS = RemoveNoopCast(Op1); |
| 652 | if (ShiftInst *SI = dyn_cast<ShiftInst>(NoopCastedRHS)) |
Chris Lattner | 9c29067 | 2004-03-12 23:53:13 +0000 | [diff] [blame] | 653 | if (SI->getOpcode() == Instruction::Shr) |
| 654 | if (ConstantUInt *CU = dyn_cast<ConstantUInt>(SI->getOperand(1))) { |
| 655 | const Type *NewTy; |
Chris Lattner | bfe492b | 2004-03-13 00:11:49 +0000 | [diff] [blame] | 656 | if (SI->getType()->isSigned()) |
| 657 | NewTy = getUnsignedIntegralType(SI->getType()); |
Chris Lattner | 9c29067 | 2004-03-12 23:53:13 +0000 | [diff] [blame] | 658 | else |
Chris Lattner | bfe492b | 2004-03-13 00:11:49 +0000 | [diff] [blame] | 659 | NewTy = getSignedIntegralType(SI->getType()); |
Chris Lattner | 9c29067 | 2004-03-12 23:53:13 +0000 | [diff] [blame] | 660 | // Check to see if we are shifting out everything but the sign bit. |
Chris Lattner | bfe492b | 2004-03-13 00:11:49 +0000 | [diff] [blame] | 661 | if (CU->getValue() == SI->getType()->getPrimitiveSize()*8-1) { |
Chris Lattner | 9c29067 | 2004-03-12 23:53:13 +0000 | [diff] [blame] | 662 | // Ok, the transformation is safe. Insert a cast of the incoming |
| 663 | // value, then the new shift, then the new cast. |
| 664 | Instruction *FirstCast = new CastInst(SI->getOperand(0), NewTy, |
| 665 | SI->getOperand(0)->getName()); |
| 666 | Value *InV = InsertNewInstBefore(FirstCast, I); |
| 667 | Instruction *NewShift = new ShiftInst(Instruction::Shr, FirstCast, |
| 668 | CU, SI->getName()); |
Chris Lattner | bfe492b | 2004-03-13 00:11:49 +0000 | [diff] [blame] | 669 | if (NewShift->getType() == I.getType()) |
| 670 | return NewShift; |
| 671 | else { |
| 672 | InV = InsertNewInstBefore(NewShift, I); |
| 673 | return new CastInst(NewShift, I.getType()); |
| 674 | } |
Chris Lattner | 9c29067 | 2004-03-12 23:53:13 +0000 | [diff] [blame] | 675 | } |
| 676 | } |
Chris Lattner | bfe492b | 2004-03-13 00:11:49 +0000 | [diff] [blame] | 677 | } |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 678 | |
| 679 | // Try to fold constant sub into select arguments. |
| 680 | if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) |
| 681 | if (Instruction *R = FoldBinOpIntoSelect(I, SI, this)) |
| 682 | return R; |
Chris Lattner | d65460f | 2003-11-05 01:06:05 +0000 | [diff] [blame] | 683 | } |
| 684 | |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 685 | if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1)) |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 686 | if (Op1I->hasOneUse()) { |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 687 | // Replace (x - (y - z)) with (x + (z - y)) if the (y - z) subexpression |
| 688 | // is not used by anyone else... |
| 689 | // |
Chris Lattner | 0517e72 | 2004-02-02 20:09:56 +0000 | [diff] [blame] | 690 | if (Op1I->getOpcode() == Instruction::Sub && |
| 691 | !Op1I->getType()->isFloatingPoint()) { |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 692 | // Swap the two operands of the subexpr... |
| 693 | Value *IIOp0 = Op1I->getOperand(0), *IIOp1 = Op1I->getOperand(1); |
| 694 | Op1I->setOperand(0, IIOp1); |
| 695 | Op1I->setOperand(1, IIOp0); |
| 696 | |
| 697 | // Create the new top level add instruction... |
| 698 | return BinaryOperator::create(Instruction::Add, Op0, Op1); |
| 699 | } |
| 700 | |
| 701 | // Replace (A - (A & B)) with (A & ~B) if this is the only use of (A&B)... |
| 702 | // |
| 703 | if (Op1I->getOpcode() == Instruction::And && |
| 704 | (Op1I->getOperand(0) == Op0 || Op1I->getOperand(1) == Op0)) { |
| 705 | Value *OtherOp = Op1I->getOperand(Op1I->getOperand(0) == Op0); |
| 706 | |
| 707 | Instruction *NewNot = BinaryOperator::createNot(OtherOp, "B.not", &I); |
| 708 | return BinaryOperator::create(Instruction::And, Op0, NewNot); |
| 709 | } |
Chris Lattner | ad3448c | 2003-02-18 19:57:07 +0000 | [diff] [blame] | 710 | |
| 711 | // X - X*C --> X * (1-C) |
| 712 | if (dyn_castFoldableMul(Op1I) == Op0) { |
Chris Lattner | 2a9c847 | 2003-05-27 16:40:51 +0000 | [diff] [blame] | 713 | Constant *CP1 = |
| 714 | ConstantExpr::get(Instruction::Sub, |
| 715 | ConstantInt::get(I.getType(), 1), |
| 716 | cast<Constant>(cast<Instruction>(Op1)->getOperand(1))); |
Chris Lattner | ad3448c | 2003-02-18 19:57:07 +0000 | [diff] [blame] | 717 | assert(CP1 && "Couldn't constant fold 1-C?"); |
| 718 | return BinaryOperator::create(Instruction::Mul, Op0, CP1); |
| 719 | } |
Chris Lattner | 4037171 | 2002-05-09 01:29:19 +0000 | [diff] [blame] | 720 | } |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 721 | |
Chris Lattner | ad3448c | 2003-02-18 19:57:07 +0000 | [diff] [blame] | 722 | // X*C - X --> X * (C-1) |
| 723 | if (dyn_castFoldableMul(Op0) == Op1) { |
Chris Lattner | 2a9c847 | 2003-05-27 16:40:51 +0000 | [diff] [blame] | 724 | Constant *CP1 = |
| 725 | ConstantExpr::get(Instruction::Sub, |
| 726 | cast<Constant>(cast<Instruction>(Op0)->getOperand(1)), |
| 727 | ConstantInt::get(I.getType(), 1)); |
Chris Lattner | ad3448c | 2003-02-18 19:57:07 +0000 | [diff] [blame] | 728 | assert(CP1 && "Couldn't constant fold C - 1?"); |
| 729 | return BinaryOperator::create(Instruction::Mul, Op1, CP1); |
| 730 | } |
| 731 | |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 732 | return 0; |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 733 | } |
| 734 | |
Chris Lattner | 4cb170c | 2004-02-23 06:38:22 +0000 | [diff] [blame] | 735 | /// isSignBitCheck - Given an exploded setcc instruction, return true if it is |
| 736 | /// really just returns true if the most significant (sign) bit is set. |
| 737 | static bool isSignBitCheck(unsigned Opcode, Value *LHS, ConstantInt *RHS) { |
| 738 | if (RHS->getType()->isSigned()) { |
| 739 | // True if source is LHS < 0 or LHS <= -1 |
| 740 | return Opcode == Instruction::SetLT && RHS->isNullValue() || |
| 741 | Opcode == Instruction::SetLE && RHS->isAllOnesValue(); |
| 742 | } else { |
| 743 | ConstantUInt *RHSC = cast<ConstantUInt>(RHS); |
| 744 | // True if source is LHS > 127 or LHS >= 128, where the constants depend on |
| 745 | // the size of the integer type. |
| 746 | if (Opcode == Instruction::SetGE) |
| 747 | return RHSC->getValue() == 1ULL<<(RHS->getType()->getPrimitiveSize()*8-1); |
| 748 | if (Opcode == Instruction::SetGT) |
| 749 | return RHSC->getValue() == |
| 750 | (1ULL << (RHS->getType()->getPrimitiveSize()*8-1))-1; |
| 751 | } |
| 752 | return false; |
| 753 | } |
| 754 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 755 | Instruction *InstCombiner::visitMul(BinaryOperator &I) { |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 756 | bool Changed = SimplifyCommutative(I); |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 757 | Value *Op0 = I.getOperand(0); |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 758 | |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 759 | // Simplify mul instructions with a constant RHS... |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 760 | if (Constant *Op1 = dyn_cast<Constant>(I.getOperand(1))) { |
| 761 | if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) { |
Chris Lattner | e92d2f4 | 2003-08-13 04:18:28 +0000 | [diff] [blame] | 762 | |
| 763 | // ((X << C1)*C2) == (X * (C2 << C1)) |
| 764 | if (ShiftInst *SI = dyn_cast<ShiftInst>(Op0)) |
| 765 | if (SI->getOpcode() == Instruction::Shl) |
| 766 | if (Constant *ShOp = dyn_cast<Constant>(SI->getOperand(1))) |
| 767 | return BinaryOperator::create(Instruction::Mul, SI->getOperand(0), |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 768 | ConstantExpr::get(Instruction::Shl, CI, ShOp)); |
| 769 | |
Chris Lattner | 515c97c | 2003-09-11 22:24:54 +0000 | [diff] [blame] | 770 | if (CI->isNullValue()) |
| 771 | return ReplaceInstUsesWith(I, Op1); // X * 0 == 0 |
| 772 | if (CI->equalsInt(1)) // X * 1 == X |
| 773 | return ReplaceInstUsesWith(I, Op0); |
| 774 | if (CI->isAllOnesValue()) // X * -1 == 0 - X |
Chris Lattner | 0af1fab | 2003-06-25 17:09:20 +0000 | [diff] [blame] | 775 | return BinaryOperator::createNeg(Op0, I.getName()); |
Chris Lattner | 6c1ce21 | 2002-04-29 22:24:47 +0000 | [diff] [blame] | 776 | |
Chris Lattner | 515c97c | 2003-09-11 22:24:54 +0000 | [diff] [blame] | 777 | int64_t Val = (int64_t)cast<ConstantInt>(CI)->getRawValue(); |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 778 | if (uint64_t C = Log2(Val)) // Replace X*(2^C) with X << C |
| 779 | return new ShiftInst(Instruction::Shl, Op0, |
| 780 | ConstantUInt::get(Type::UByteTy, C)); |
| 781 | } else { |
| 782 | ConstantFP *Op1F = cast<ConstantFP>(Op1); |
| 783 | if (Op1F->isNullValue()) |
| 784 | return ReplaceInstUsesWith(I, Op1); |
Chris Lattner | 6c1ce21 | 2002-04-29 22:24:47 +0000 | [diff] [blame] | 785 | |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 786 | // "In IEEE floating point, x*1 is not equivalent to x for nans. However, |
| 787 | // ANSI says we can drop signals, so we can do this anyway." (from GCC) |
| 788 | if (Op1F->getValue() == 1.0) |
| 789 | return ReplaceInstUsesWith(I, Op0); // Eliminate 'mul double %X, 1.0' |
| 790 | } |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 791 | |
| 792 | // Try to fold constant mul into select arguments. |
| 793 | if (SelectInst *SI = dyn_cast<SelectInst>(Op0)) |
| 794 | if (Instruction *R = FoldBinOpIntoSelect(I, SI, this)) |
| 795 | return R; |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 796 | } |
| 797 | |
Chris Lattner | a4f445b | 2003-03-10 23:23:04 +0000 | [diff] [blame] | 798 | if (Value *Op0v = dyn_castNegVal(Op0)) // -X * -Y = X*Y |
| 799 | if (Value *Op1v = dyn_castNegVal(I.getOperand(1))) |
| 800 | return BinaryOperator::create(Instruction::Mul, Op0v, Op1v); |
| 801 | |
Chris Lattner | fb54b2b | 2004-02-23 05:39:21 +0000 | [diff] [blame] | 802 | // If one of the operands of the multiply is a cast from a boolean value, then |
| 803 | // we know the bool is either zero or one, so this is a 'masking' multiply. |
| 804 | // See if we can simplify things based on how the boolean was originally |
| 805 | // formed. |
| 806 | CastInst *BoolCast = 0; |
| 807 | if (CastInst *CI = dyn_cast<CastInst>(I.getOperand(0))) |
| 808 | if (CI->getOperand(0)->getType() == Type::BoolTy) |
| 809 | BoolCast = CI; |
| 810 | if (!BoolCast) |
| 811 | if (CastInst *CI = dyn_cast<CastInst>(I.getOperand(1))) |
| 812 | if (CI->getOperand(0)->getType() == Type::BoolTy) |
| 813 | BoolCast = CI; |
| 814 | if (BoolCast) { |
| 815 | if (SetCondInst *SCI = dyn_cast<SetCondInst>(BoolCast->getOperand(0))) { |
| 816 | Value *SCIOp0 = SCI->getOperand(0), *SCIOp1 = SCI->getOperand(1); |
| 817 | const Type *SCOpTy = SCIOp0->getType(); |
| 818 | |
Chris Lattner | 4cb170c | 2004-02-23 06:38:22 +0000 | [diff] [blame] | 819 | // If the setcc is true iff the sign bit of X is set, then convert this |
| 820 | // multiply into a shift/and combination. |
| 821 | if (isa<ConstantInt>(SCIOp1) && |
| 822 | isSignBitCheck(SCI->getOpcode(), SCIOp0, cast<ConstantInt>(SCIOp1))) { |
Chris Lattner | fb54b2b | 2004-02-23 05:39:21 +0000 | [diff] [blame] | 823 | // Shift the X value right to turn it into "all signbits". |
| 824 | Constant *Amt = ConstantUInt::get(Type::UByteTy, |
| 825 | SCOpTy->getPrimitiveSize()*8-1); |
Chris Lattner | 4cb170c | 2004-02-23 06:38:22 +0000 | [diff] [blame] | 826 | if (SCIOp0->getType()->isUnsigned()) { |
| 827 | const Type *NewTy = getSignedIntegralType(SCIOp0->getType()); |
| 828 | SCIOp0 = InsertNewInstBefore(new CastInst(SCIOp0, NewTy, |
| 829 | SCIOp0->getName()), I); |
| 830 | } |
| 831 | |
| 832 | Value *V = |
| 833 | InsertNewInstBefore(new ShiftInst(Instruction::Shr, SCIOp0, Amt, |
| 834 | BoolCast->getOperand(0)->getName()+ |
| 835 | ".mask"), I); |
Chris Lattner | fb54b2b | 2004-02-23 05:39:21 +0000 | [diff] [blame] | 836 | |
| 837 | // If the multiply type is not the same as the source type, sign extend |
| 838 | // or truncate to the multiply type. |
| 839 | if (I.getType() != V->getType()) |
Chris Lattner | 4cb170c | 2004-02-23 06:38:22 +0000 | [diff] [blame] | 840 | V = InsertNewInstBefore(new CastInst(V, I.getType(), V->getName()),I); |
Chris Lattner | fb54b2b | 2004-02-23 05:39:21 +0000 | [diff] [blame] | 841 | |
| 842 | Value *OtherOp = Op0 == BoolCast ? I.getOperand(1) : Op0; |
| 843 | return BinaryOperator::create(Instruction::And, V, OtherOp); |
| 844 | } |
| 845 | } |
| 846 | } |
| 847 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 848 | return Changed ? &I : 0; |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 849 | } |
| 850 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 851 | Instruction *InstCombiner::visitDiv(BinaryOperator &I) { |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 852 | if (ConstantInt *RHS = dyn_cast<ConstantInt>(I.getOperand(1))) { |
Chris Lattner | 83a2e6e | 2004-04-26 14:01:59 +0000 | [diff] [blame] | 853 | // div X, 1 == X |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 854 | if (RHS->equalsInt(1)) |
| 855 | return ReplaceInstUsesWith(I, I.getOperand(0)); |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 856 | |
Chris Lattner | 83a2e6e | 2004-04-26 14:01:59 +0000 | [diff] [blame] | 857 | // div X, -1 == -X |
| 858 | if (RHS->isAllOnesValue()) |
| 859 | return BinaryOperator::createNeg(I.getOperand(0)); |
| 860 | |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 861 | // Check to see if this is an unsigned division with an exact power of 2, |
| 862 | // if so, convert to a right shift. |
| 863 | if (ConstantUInt *C = dyn_cast<ConstantUInt>(RHS)) |
| 864 | if (uint64_t Val = C->getValue()) // Don't break X / 0 |
| 865 | if (uint64_t C = Log2(Val)) |
| 866 | return new ShiftInst(Instruction::Shr, I.getOperand(0), |
| 867 | ConstantUInt::get(Type::UByteTy, C)); |
| 868 | } |
| 869 | |
| 870 | // 0 / X == 0, we don't need to preserve faults! |
| 871 | if (ConstantInt *LHS = dyn_cast<ConstantInt>(I.getOperand(0))) |
| 872 | if (LHS->equalsInt(0)) |
| 873 | return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType())); |
| 874 | |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 875 | return 0; |
| 876 | } |
| 877 | |
| 878 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 879 | Instruction *InstCombiner::visitRem(BinaryOperator &I) { |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 880 | if (ConstantInt *RHS = dyn_cast<ConstantInt>(I.getOperand(1))) { |
| 881 | if (RHS->equalsInt(1)) // X % 1 == 0 |
| 882 | return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType())); |
Chris Lattner | 4df1b8a | 2004-03-26 16:11:24 +0000 | [diff] [blame] | 883 | if (RHS->isAllOnesValue()) // X % -1 == 0 |
| 884 | return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType())); |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 885 | |
| 886 | // Check to see if this is an unsigned remainder with an exact power of 2, |
| 887 | // if so, convert to a bitwise and. |
| 888 | if (ConstantUInt *C = dyn_cast<ConstantUInt>(RHS)) |
| 889 | if (uint64_t Val = C->getValue()) // Don't break X % 0 (divide by zero) |
Chris Lattner | 546516c | 2004-05-07 15:35:56 +0000 | [diff] [blame] | 890 | if (!(Val & (Val-1))) // Power of 2 |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 891 | return BinaryOperator::create(Instruction::And, I.getOperand(0), |
| 892 | ConstantUInt::get(I.getType(), Val-1)); |
| 893 | } |
| 894 | |
| 895 | // 0 % X == 0, we don't need to preserve faults! |
| 896 | if (ConstantInt *LHS = dyn_cast<ConstantInt>(I.getOperand(0))) |
| 897 | if (LHS->equalsInt(0)) |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 898 | return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType())); |
| 899 | |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 900 | return 0; |
| 901 | } |
| 902 | |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 903 | // isMaxValueMinusOne - return true if this is Max-1 |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 904 | static bool isMaxValueMinusOne(const ConstantInt *C) { |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 905 | if (const ConstantUInt *CU = dyn_cast<ConstantUInt>(C)) { |
| 906 | // Calculate -1 casted to the right type... |
| 907 | unsigned TypeBits = C->getType()->getPrimitiveSize()*8; |
| 908 | uint64_t Val = ~0ULL; // All ones |
| 909 | Val >>= 64-TypeBits; // Shift out unwanted 1 bits... |
| 910 | return CU->getValue() == Val-1; |
| 911 | } |
| 912 | |
| 913 | const ConstantSInt *CS = cast<ConstantSInt>(C); |
| 914 | |
| 915 | // Calculate 0111111111..11111 |
| 916 | unsigned TypeBits = C->getType()->getPrimitiveSize()*8; |
| 917 | int64_t Val = INT64_MAX; // All ones |
| 918 | Val >>= 64-TypeBits; // Shift out unwanted 1 bits... |
| 919 | return CS->getValue() == Val-1; |
| 920 | } |
| 921 | |
| 922 | // isMinValuePlusOne - return true if this is Min+1 |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 923 | static bool isMinValuePlusOne(const ConstantInt *C) { |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 924 | if (const ConstantUInt *CU = dyn_cast<ConstantUInt>(C)) |
| 925 | return CU->getValue() == 1; |
| 926 | |
| 927 | const ConstantSInt *CS = cast<ConstantSInt>(C); |
| 928 | |
| 929 | // Calculate 1111111111000000000000 |
| 930 | unsigned TypeBits = C->getType()->getPrimitiveSize()*8; |
| 931 | int64_t Val = -1; // All ones |
| 932 | Val <<= TypeBits-1; // Shift over to the right spot |
| 933 | return CS->getValue() == Val+1; |
| 934 | } |
| 935 | |
Chris Lattner | aa9c1f1 | 2003-08-13 20:16:26 +0000 | [diff] [blame] | 936 | /// getSetCondCode - Encode a setcc opcode into a three bit mask. These bits |
| 937 | /// are carefully arranged to allow folding of expressions such as: |
| 938 | /// |
| 939 | /// (A < B) | (A > B) --> (A != B) |
| 940 | /// |
| 941 | /// Bit value '4' represents that the comparison is true if A > B, bit value '2' |
| 942 | /// represents that the comparison is true if A == B, and bit value '1' is true |
| 943 | /// if A < B. |
| 944 | /// |
| 945 | static unsigned getSetCondCode(const SetCondInst *SCI) { |
| 946 | switch (SCI->getOpcode()) { |
| 947 | // False -> 0 |
| 948 | case Instruction::SetGT: return 1; |
| 949 | case Instruction::SetEQ: return 2; |
| 950 | case Instruction::SetGE: return 3; |
| 951 | case Instruction::SetLT: return 4; |
| 952 | case Instruction::SetNE: return 5; |
| 953 | case Instruction::SetLE: return 6; |
| 954 | // True -> 7 |
| 955 | default: |
| 956 | assert(0 && "Invalid SetCC opcode!"); |
| 957 | return 0; |
| 958 | } |
| 959 | } |
| 960 | |
| 961 | /// getSetCCValue - This is the complement of getSetCondCode, which turns an |
| 962 | /// opcode and two operands into either a constant true or false, or a brand new |
| 963 | /// SetCC instruction. |
| 964 | static Value *getSetCCValue(unsigned Opcode, Value *LHS, Value *RHS) { |
| 965 | switch (Opcode) { |
| 966 | case 0: return ConstantBool::False; |
| 967 | case 1: return new SetCondInst(Instruction::SetGT, LHS, RHS); |
| 968 | case 2: return new SetCondInst(Instruction::SetEQ, LHS, RHS); |
| 969 | case 3: return new SetCondInst(Instruction::SetGE, LHS, RHS); |
| 970 | case 4: return new SetCondInst(Instruction::SetLT, LHS, RHS); |
| 971 | case 5: return new SetCondInst(Instruction::SetNE, LHS, RHS); |
| 972 | case 6: return new SetCondInst(Instruction::SetLE, LHS, RHS); |
| 973 | case 7: return ConstantBool::True; |
| 974 | default: assert(0 && "Illegal SetCCCode!"); return 0; |
| 975 | } |
| 976 | } |
| 977 | |
| 978 | // FoldSetCCLogical - Implements (setcc1 A, B) & (setcc2 A, B) --> (setcc3 A, B) |
| 979 | struct FoldSetCCLogical { |
| 980 | InstCombiner &IC; |
| 981 | Value *LHS, *RHS; |
| 982 | FoldSetCCLogical(InstCombiner &ic, SetCondInst *SCI) |
| 983 | : IC(ic), LHS(SCI->getOperand(0)), RHS(SCI->getOperand(1)) {} |
| 984 | bool shouldApply(Value *V) const { |
| 985 | if (SetCondInst *SCI = dyn_cast<SetCondInst>(V)) |
| 986 | return (SCI->getOperand(0) == LHS && SCI->getOperand(1) == RHS || |
| 987 | SCI->getOperand(0) == RHS && SCI->getOperand(1) == LHS); |
| 988 | return false; |
| 989 | } |
| 990 | Instruction *apply(BinaryOperator &Log) const { |
| 991 | SetCondInst *SCI = cast<SetCondInst>(Log.getOperand(0)); |
| 992 | if (SCI->getOperand(0) != LHS) { |
| 993 | assert(SCI->getOperand(1) == LHS); |
| 994 | SCI->swapOperands(); // Swap the LHS and RHS of the SetCC |
| 995 | } |
| 996 | |
| 997 | unsigned LHSCode = getSetCondCode(SCI); |
| 998 | unsigned RHSCode = getSetCondCode(cast<SetCondInst>(Log.getOperand(1))); |
| 999 | unsigned Code; |
| 1000 | switch (Log.getOpcode()) { |
| 1001 | case Instruction::And: Code = LHSCode & RHSCode; break; |
| 1002 | case Instruction::Or: Code = LHSCode | RHSCode; break; |
| 1003 | case Instruction::Xor: Code = LHSCode ^ RHSCode; break; |
Chris Lattner | 021c190 | 2003-09-22 20:33:34 +0000 | [diff] [blame] | 1004 | default: assert(0 && "Illegal logical opcode!"); return 0; |
Chris Lattner | aa9c1f1 | 2003-08-13 20:16:26 +0000 | [diff] [blame] | 1005 | } |
| 1006 | |
| 1007 | Value *RV = getSetCCValue(Code, LHS, RHS); |
| 1008 | if (Instruction *I = dyn_cast<Instruction>(RV)) |
| 1009 | return I; |
| 1010 | // Otherwise, it's a constant boolean value... |
| 1011 | return IC.ReplaceInstUsesWith(Log, RV); |
| 1012 | } |
| 1013 | }; |
| 1014 | |
| 1015 | |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1016 | // OptAndOp - This handles expressions of the form ((val OP C1) & C2). Where |
| 1017 | // the Op parameter is 'OP', OpRHS is 'C1', and AndRHS is 'C2'. Op is |
| 1018 | // guaranteed to be either a shift instruction or a binary operator. |
| 1019 | Instruction *InstCombiner::OptAndOp(Instruction *Op, |
| 1020 | ConstantIntegral *OpRHS, |
| 1021 | ConstantIntegral *AndRHS, |
| 1022 | BinaryOperator &TheAnd) { |
| 1023 | Value *X = Op->getOperand(0); |
Chris Lattner | 76f7fe2 | 2004-01-12 19:47:05 +0000 | [diff] [blame] | 1024 | Constant *Together = 0; |
| 1025 | if (!isa<ShiftInst>(Op)) |
| 1026 | Together = ConstantExpr::get(Instruction::And, AndRHS, OpRHS); |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1027 | |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1028 | switch (Op->getOpcode()) { |
| 1029 | case Instruction::Xor: |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1030 | if (Together->isNullValue()) { |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1031 | // (X ^ C1) & C2 --> (X & C2) iff (C1&C2) == 0 |
| 1032 | return BinaryOperator::create(Instruction::And, X, AndRHS); |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 1033 | } else if (Op->hasOneUse()) { |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1034 | // (X ^ C1) & C2 --> (X & C2) ^ (C1&C2) |
| 1035 | std::string OpName = Op->getName(); Op->setName(""); |
| 1036 | Instruction *And = BinaryOperator::create(Instruction::And, |
| 1037 | X, AndRHS, OpName); |
| 1038 | InsertNewInstBefore(And, TheAnd); |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1039 | return BinaryOperator::create(Instruction::Xor, And, Together); |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1040 | } |
| 1041 | break; |
| 1042 | case Instruction::Or: |
| 1043 | // (X | C1) & C2 --> X & C2 iff C1 & C1 == 0 |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1044 | if (Together->isNullValue()) |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1045 | return BinaryOperator::create(Instruction::And, X, AndRHS); |
| 1046 | else { |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1047 | if (Together == AndRHS) // (X | C) & C --> C |
| 1048 | return ReplaceInstUsesWith(TheAnd, AndRHS); |
| 1049 | |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 1050 | if (Op->hasOneUse() && Together != OpRHS) { |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1051 | // (X | C1) & C2 --> (X | (C1&C2)) & C2 |
| 1052 | std::string Op0Name = Op->getName(); Op->setName(""); |
| 1053 | Instruction *Or = BinaryOperator::create(Instruction::Or, X, |
| 1054 | Together, Op0Name); |
| 1055 | InsertNewInstBefore(Or, TheAnd); |
| 1056 | return BinaryOperator::create(Instruction::And, Or, AndRHS); |
| 1057 | } |
| 1058 | } |
| 1059 | break; |
| 1060 | case Instruction::Add: |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 1061 | if (Op->hasOneUse()) { |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1062 | // Adding a one to a single bit bit-field should be turned into an XOR |
| 1063 | // of the bit. First thing to check is to see if this AND is with a |
| 1064 | // single bit constant. |
| 1065 | unsigned long long AndRHSV = cast<ConstantInt>(AndRHS)->getRawValue(); |
| 1066 | |
| 1067 | // Clear bits that are not part of the constant. |
| 1068 | AndRHSV &= (1ULL << AndRHS->getType()->getPrimitiveSize()*8)-1; |
| 1069 | |
| 1070 | // If there is only one bit set... |
| 1071 | if ((AndRHSV & (AndRHSV-1)) == 0) { |
| 1072 | // Ok, at this point, we know that we are masking the result of the |
| 1073 | // ADD down to exactly one bit. If the constant we are adding has |
| 1074 | // no bits set below this bit, then we can eliminate the ADD. |
| 1075 | unsigned long long AddRHS = cast<ConstantInt>(OpRHS)->getRawValue(); |
| 1076 | |
| 1077 | // Check to see if any bits below the one bit set in AndRHSV are set. |
| 1078 | if ((AddRHS & (AndRHSV-1)) == 0) { |
| 1079 | // If not, the only thing that can effect the output of the AND is |
| 1080 | // the bit specified by AndRHSV. If that bit is set, the effect of |
| 1081 | // the XOR is to toggle the bit. If it is clear, then the ADD has |
| 1082 | // no effect. |
| 1083 | if ((AddRHS & AndRHSV) == 0) { // Bit is not set, noop |
| 1084 | TheAnd.setOperand(0, X); |
| 1085 | return &TheAnd; |
| 1086 | } else { |
| 1087 | std::string Name = Op->getName(); Op->setName(""); |
| 1088 | // Pull the XOR out of the AND. |
| 1089 | Instruction *NewAnd = |
| 1090 | BinaryOperator::create(Instruction::And, X, AndRHS, Name); |
| 1091 | InsertNewInstBefore(NewAnd, TheAnd); |
| 1092 | return BinaryOperator::create(Instruction::Xor, NewAnd, AndRHS); |
| 1093 | } |
| 1094 | } |
| 1095 | } |
| 1096 | } |
| 1097 | break; |
Chris Lattner | 62a355c | 2003-09-19 19:05:02 +0000 | [diff] [blame] | 1098 | |
| 1099 | case Instruction::Shl: { |
| 1100 | // We know that the AND will not produce any of the bits shifted in, so if |
| 1101 | // the anded constant includes them, clear them now! |
| 1102 | // |
| 1103 | Constant *AllOne = ConstantIntegral::getAllOnesValue(AndRHS->getType()); |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1104 | Constant *CI = ConstantExpr::get(Instruction::And, AndRHS, |
| 1105 | ConstantExpr::get(Instruction::Shl, AllOne, OpRHS)); |
Chris Lattner | 62a355c | 2003-09-19 19:05:02 +0000 | [diff] [blame] | 1106 | if (CI != AndRHS) { |
| 1107 | TheAnd.setOperand(1, CI); |
| 1108 | return &TheAnd; |
| 1109 | } |
| 1110 | break; |
| 1111 | } |
| 1112 | case Instruction::Shr: |
| 1113 | // We know that the AND will not produce any of the bits shifted in, so if |
| 1114 | // the anded constant includes them, clear them now! This only applies to |
| 1115 | // unsigned shifts, because a signed shr may bring in set bits! |
| 1116 | // |
| 1117 | if (AndRHS->getType()->isUnsigned()) { |
| 1118 | Constant *AllOne = ConstantIntegral::getAllOnesValue(AndRHS->getType()); |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1119 | Constant *CI = ConstantExpr::get(Instruction::And, AndRHS, |
| 1120 | ConstantExpr::get(Instruction::Shr, AllOne, OpRHS)); |
Chris Lattner | 62a355c | 2003-09-19 19:05:02 +0000 | [diff] [blame] | 1121 | if (CI != AndRHS) { |
| 1122 | TheAnd.setOperand(1, CI); |
| 1123 | return &TheAnd; |
| 1124 | } |
| 1125 | } |
| 1126 | break; |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1127 | } |
| 1128 | return 0; |
| 1129 | } |
| 1130 | |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1131 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1132 | Instruction *InstCombiner::visitAnd(BinaryOperator &I) { |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 1133 | bool Changed = SimplifyCommutative(I); |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1134 | Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1); |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1135 | |
| 1136 | // and X, X = X and X, 0 == 0 |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 1137 | if (Op0 == Op1 || Op1 == Constant::getNullValue(I.getType())) |
| 1138 | return ReplaceInstUsesWith(I, Op1); |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1139 | |
| 1140 | // and X, -1 == X |
Chris Lattner | c6a8aff | 2003-07-23 17:57:01 +0000 | [diff] [blame] | 1141 | if (ConstantIntegral *RHS = dyn_cast<ConstantIntegral>(Op1)) { |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 1142 | if (RHS->isAllOnesValue()) |
| 1143 | return ReplaceInstUsesWith(I, Op0); |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1144 | |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1145 | // Optimize a variety of ((val OP C1) & C2) combinations... |
| 1146 | if (isa<BinaryOperator>(Op0) || isa<ShiftInst>(Op0)) { |
| 1147 | Instruction *Op0I = cast<Instruction>(Op0); |
Chris Lattner | 06782f8 | 2003-07-23 19:36:21 +0000 | [diff] [blame] | 1148 | Value *X = Op0I->getOperand(0); |
Chris Lattner | 5840326 | 2003-07-23 19:25:52 +0000 | [diff] [blame] | 1149 | if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) |
Chris Lattner | bd7b5ff | 2003-09-19 17:17:26 +0000 | [diff] [blame] | 1150 | if (Instruction *Res = OptAndOp(Op0I, Op0CI, RHS, I)) |
| 1151 | return Res; |
Chris Lattner | 06782f8 | 2003-07-23 19:36:21 +0000 | [diff] [blame] | 1152 | } |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 1153 | |
| 1154 | // Try to fold constant and into select arguments. |
| 1155 | if (SelectInst *SI = dyn_cast<SelectInst>(Op0)) |
| 1156 | if (Instruction *R = FoldBinOpIntoSelect(I, SI, this)) |
| 1157 | return R; |
Chris Lattner | c6a8aff | 2003-07-23 17:57:01 +0000 | [diff] [blame] | 1158 | } |
| 1159 | |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 1160 | Value *Op0NotVal = dyn_castNotVal(Op0); |
| 1161 | Value *Op1NotVal = dyn_castNotVal(Op1); |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 1162 | |
| 1163 | // (~A & ~B) == (~(A | B)) - Demorgan's Law |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 1164 | if (Op0NotVal && Op1NotVal && isOnlyUse(Op0) && isOnlyUse(Op1)) { |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 1165 | Instruction *Or = BinaryOperator::create(Instruction::Or, Op0NotVal, |
Chris Lattner | c6a8aff | 2003-07-23 17:57:01 +0000 | [diff] [blame] | 1166 | Op1NotVal,I.getName()+".demorgan"); |
| 1167 | InsertNewInstBefore(Or, I); |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 1168 | return BinaryOperator::createNot(Or); |
| 1169 | } |
| 1170 | |
| 1171 | if (Op0NotVal == Op1 || Op1NotVal == Op0) // A & ~A == ~A & A == 0 |
| 1172 | return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType())); |
Chris Lattner | e6f9a91 | 2002-08-23 18:32:43 +0000 | [diff] [blame] | 1173 | |
Chris Lattner | aa9c1f1 | 2003-08-13 20:16:26 +0000 | [diff] [blame] | 1174 | // (setcc1 A, B) & (setcc2 A, B) --> (setcc3 A, B) |
| 1175 | if (SetCondInst *RHS = dyn_cast<SetCondInst>(I.getOperand(1))) |
| 1176 | if (Instruction *R = AssociativeOpt(I, FoldSetCCLogical(*this, RHS))) |
| 1177 | return R; |
| 1178 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1179 | return Changed ? &I : 0; |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1180 | } |
| 1181 | |
| 1182 | |
| 1183 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1184 | Instruction *InstCombiner::visitOr(BinaryOperator &I) { |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 1185 | bool Changed = SimplifyCommutative(I); |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1186 | Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1); |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1187 | |
| 1188 | // or X, X = X or X, 0 == X |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 1189 | if (Op0 == Op1 || Op1 == Constant::getNullValue(I.getType())) |
| 1190 | return ReplaceInstUsesWith(I, Op0); |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1191 | |
| 1192 | // or X, -1 == -1 |
Chris Lattner | ad44ebf | 2003-07-23 18:29:44 +0000 | [diff] [blame] | 1193 | if (ConstantIntegral *RHS = dyn_cast<ConstantIntegral>(Op1)) { |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 1194 | if (RHS->isAllOnesValue()) |
| 1195 | return ReplaceInstUsesWith(I, Op1); |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1196 | |
Chris Lattner | ad44ebf | 2003-07-23 18:29:44 +0000 | [diff] [blame] | 1197 | if (Instruction *Op0I = dyn_cast<Instruction>(Op0)) { |
| 1198 | // (X & C1) | C2 --> (X | C2) & (C1|C2) |
| 1199 | if (Op0I->getOpcode() == Instruction::And && isOnlyUse(Op0)) |
| 1200 | if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) { |
| 1201 | std::string Op0Name = Op0I->getName(); Op0I->setName(""); |
| 1202 | Instruction *Or = BinaryOperator::create(Instruction::Or, |
| 1203 | Op0I->getOperand(0), RHS, |
| 1204 | Op0Name); |
| 1205 | InsertNewInstBefore(Or, I); |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1206 | return BinaryOperator::create(Instruction::And, Or, |
| 1207 | ConstantExpr::get(Instruction::Or, RHS, Op0CI)); |
Chris Lattner | ad44ebf | 2003-07-23 18:29:44 +0000 | [diff] [blame] | 1208 | } |
| 1209 | |
| 1210 | // (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2) |
| 1211 | if (Op0I->getOpcode() == Instruction::Xor && isOnlyUse(Op0)) |
| 1212 | if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) { |
| 1213 | std::string Op0Name = Op0I->getName(); Op0I->setName(""); |
| 1214 | Instruction *Or = BinaryOperator::create(Instruction::Or, |
| 1215 | Op0I->getOperand(0), RHS, |
| 1216 | Op0Name); |
| 1217 | InsertNewInstBefore(Or, I); |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1218 | return BinaryOperator::create(Instruction::Xor, Or, |
| 1219 | ConstantExpr::get(Instruction::And, Op0CI, |
| 1220 | NotConstant(RHS))); |
Chris Lattner | ad44ebf | 2003-07-23 18:29:44 +0000 | [diff] [blame] | 1221 | } |
| 1222 | } |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 1223 | |
| 1224 | // Try to fold constant and into select arguments. |
| 1225 | if (SelectInst *SI = dyn_cast<SelectInst>(Op0)) |
| 1226 | if (Instruction *R = FoldBinOpIntoSelect(I, SI, this)) |
| 1227 | return R; |
Chris Lattner | ad44ebf | 2003-07-23 18:29:44 +0000 | [diff] [blame] | 1228 | } |
| 1229 | |
Chris Lattner | 67ca768 | 2003-08-12 19:11:07 +0000 | [diff] [blame] | 1230 | // (A & C1)|(A & C2) == A & (C1|C2) |
Chris Lattner | e132d95 | 2003-08-12 19:17:27 +0000 | [diff] [blame] | 1231 | if (Instruction *LHS = dyn_cast<BinaryOperator>(Op0)) |
| 1232 | if (Instruction *RHS = dyn_cast<BinaryOperator>(Op1)) |
| 1233 | if (LHS->getOperand(0) == RHS->getOperand(0)) |
| 1234 | if (Constant *C0 = dyn_castMaskingAnd(LHS)) |
| 1235 | if (Constant *C1 = dyn_castMaskingAnd(RHS)) |
| 1236 | return BinaryOperator::create(Instruction::And, LHS->getOperand(0), |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1237 | ConstantExpr::get(Instruction::Or, C0, C1)); |
Chris Lattner | 67ca768 | 2003-08-12 19:11:07 +0000 | [diff] [blame] | 1238 | |
Chris Lattner | a27231a | 2003-03-10 23:13:59 +0000 | [diff] [blame] | 1239 | Value *Op0NotVal = dyn_castNotVal(Op0); |
| 1240 | Value *Op1NotVal = dyn_castNotVal(Op1); |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 1241 | |
Chris Lattner | a27231a | 2003-03-10 23:13:59 +0000 | [diff] [blame] | 1242 | if (Op1 == Op0NotVal) // ~A | A == -1 |
| 1243 | return ReplaceInstUsesWith(I, |
| 1244 | ConstantIntegral::getAllOnesValue(I.getType())); |
| 1245 | |
| 1246 | if (Op0 == Op1NotVal) // A | ~A == -1 |
| 1247 | return ReplaceInstUsesWith(I, |
| 1248 | ConstantIntegral::getAllOnesValue(I.getType())); |
| 1249 | |
| 1250 | // (~A | ~B) == (~(A & B)) - Demorgan's Law |
| 1251 | if (Op0NotVal && Op1NotVal && isOnlyUse(Op0) && isOnlyUse(Op1)) { |
| 1252 | Instruction *And = BinaryOperator::create(Instruction::And, Op0NotVal, |
| 1253 | Op1NotVal,I.getName()+".demorgan", |
| 1254 | &I); |
| 1255 | WorkList.push_back(And); |
| 1256 | return BinaryOperator::createNot(And); |
| 1257 | } |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 1258 | |
Chris Lattner | aa9c1f1 | 2003-08-13 20:16:26 +0000 | [diff] [blame] | 1259 | // (setcc1 A, B) | (setcc2 A, B) --> (setcc3 A, B) |
| 1260 | if (SetCondInst *RHS = dyn_cast<SetCondInst>(I.getOperand(1))) |
| 1261 | if (Instruction *R = AssociativeOpt(I, FoldSetCCLogical(*this, RHS))) |
| 1262 | return R; |
| 1263 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1264 | return Changed ? &I : 0; |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1265 | } |
| 1266 | |
Chris Lattner | c317d39 | 2004-02-16 01:20:27 +0000 | [diff] [blame] | 1267 | // XorSelf - Implements: X ^ X --> 0 |
| 1268 | struct XorSelf { |
| 1269 | Value *RHS; |
| 1270 | XorSelf(Value *rhs) : RHS(rhs) {} |
| 1271 | bool shouldApply(Value *LHS) const { return LHS == RHS; } |
| 1272 | Instruction *apply(BinaryOperator &Xor) const { |
| 1273 | return &Xor; |
| 1274 | } |
| 1275 | }; |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1276 | |
| 1277 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1278 | Instruction *InstCombiner::visitXor(BinaryOperator &I) { |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 1279 | bool Changed = SimplifyCommutative(I); |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1280 | Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1); |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1281 | |
Chris Lattner | c317d39 | 2004-02-16 01:20:27 +0000 | [diff] [blame] | 1282 | // xor X, X = 0, even if X is nested in a sequence of Xor's. |
| 1283 | if (Instruction *Result = AssociativeOpt(I, XorSelf(Op1))) { |
| 1284 | assert(Result == &I && "AssociativeOpt didn't work?"); |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 1285 | return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType())); |
Chris Lattner | c317d39 | 2004-02-16 01:20:27 +0000 | [diff] [blame] | 1286 | } |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1287 | |
Chris Lattner | eca0c5c | 2003-07-23 21:37:07 +0000 | [diff] [blame] | 1288 | if (ConstantIntegral *RHS = dyn_cast<ConstantIntegral>(Op1)) { |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1289 | // xor X, 0 == X |
Chris Lattner | eca0c5c | 2003-07-23 21:37:07 +0000 | [diff] [blame] | 1290 | if (RHS->isNullValue()) |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 1291 | return ReplaceInstUsesWith(I, Op0); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1292 | |
Chris Lattner | eca0c5c | 2003-07-23 21:37:07 +0000 | [diff] [blame] | 1293 | if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) { |
Chris Lattner | 05bd1b2 | 2002-08-20 18:24:26 +0000 | [diff] [blame] | 1294 | // xor (setcc A, B), true = not (setcc A, B) = setncc A, B |
Chris Lattner | eca0c5c | 2003-07-23 21:37:07 +0000 | [diff] [blame] | 1295 | if (SetCondInst *SCI = dyn_cast<SetCondInst>(Op0I)) |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 1296 | if (RHS == ConstantBool::True && SCI->hasOneUse()) |
Chris Lattner | 05bd1b2 | 2002-08-20 18:24:26 +0000 | [diff] [blame] | 1297 | return new SetCondInst(SCI->getInverseCondition(), |
| 1298 | SCI->getOperand(0), SCI->getOperand(1)); |
Chris Lattner | ad5b4fb | 2003-11-04 23:50:51 +0000 | [diff] [blame] | 1299 | |
Chris Lattner | d65460f | 2003-11-05 01:06:05 +0000 | [diff] [blame] | 1300 | // ~(c-X) == X-c-1 == X+(-c-1) |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1301 | if (Op0I->getOpcode() == Instruction::Sub && RHS->isAllOnesValue()) |
| 1302 | if (Constant *Op0I0C = dyn_cast<Constant>(Op0I->getOperand(0))) { |
| 1303 | Constant *NegOp0I0C = ConstantExpr::get(Instruction::Sub, |
| 1304 | Constant::getNullValue(Op0I0C->getType()), Op0I0C); |
| 1305 | Constant *ConstantRHS = ConstantExpr::get(Instruction::Sub, NegOp0I0C, |
| 1306 | ConstantInt::get(I.getType(), 1)); |
| 1307 | return BinaryOperator::create(Instruction::Add, Op0I->getOperand(1), |
| 1308 | ConstantRHS); |
| 1309 | } |
Chris Lattner | eca0c5c | 2003-07-23 21:37:07 +0000 | [diff] [blame] | 1310 | |
| 1311 | if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) |
Chris Lattner | ad5b4fb | 2003-11-04 23:50:51 +0000 | [diff] [blame] | 1312 | switch (Op0I->getOpcode()) { |
| 1313 | case Instruction::Add: |
Chris Lattner | 689d24b | 2003-11-04 23:37:10 +0000 | [diff] [blame] | 1314 | // ~(X-c) --> (-c-1)-X |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1315 | if (RHS->isAllOnesValue()) { |
| 1316 | Constant *NegOp0CI = ConstantExpr::get(Instruction::Sub, |
| 1317 | Constant::getNullValue(Op0CI->getType()), Op0CI); |
Chris Lattner | 689d24b | 2003-11-04 23:37:10 +0000 | [diff] [blame] | 1318 | return BinaryOperator::create(Instruction::Sub, |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1319 | ConstantExpr::get(Instruction::Sub, NegOp0CI, |
| 1320 | ConstantInt::get(I.getType(), 1)), |
Chris Lattner | 689d24b | 2003-11-04 23:37:10 +0000 | [diff] [blame] | 1321 | Op0I->getOperand(0)); |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1322 | } |
Chris Lattner | ad5b4fb | 2003-11-04 23:50:51 +0000 | [diff] [blame] | 1323 | break; |
| 1324 | case Instruction::And: |
Chris Lattner | eca0c5c | 2003-07-23 21:37:07 +0000 | [diff] [blame] | 1325 | // (X & C1) ^ C2 --> (X & C1) | C2 iff (C1&C2) == 0 |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1326 | if (ConstantExpr::get(Instruction::And, RHS, Op0CI)->isNullValue()) |
Chris Lattner | eca0c5c | 2003-07-23 21:37:07 +0000 | [diff] [blame] | 1327 | return BinaryOperator::create(Instruction::Or, Op0, RHS); |
Chris Lattner | ad5b4fb | 2003-11-04 23:50:51 +0000 | [diff] [blame] | 1328 | break; |
| 1329 | case Instruction::Or: |
Chris Lattner | eca0c5c | 2003-07-23 21:37:07 +0000 | [diff] [blame] | 1330 | // (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2 |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1331 | if (ConstantExpr::get(Instruction::And, RHS, Op0CI) == RHS) |
| 1332 | return BinaryOperator::create(Instruction::And, Op0, |
| 1333 | NotConstant(RHS)); |
Chris Lattner | ad5b4fb | 2003-11-04 23:50:51 +0000 | [diff] [blame] | 1334 | break; |
| 1335 | default: break; |
Chris Lattner | eca0c5c | 2003-07-23 21:37:07 +0000 | [diff] [blame] | 1336 | } |
Chris Lattner | 05bd1b2 | 2002-08-20 18:24:26 +0000 | [diff] [blame] | 1337 | } |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 1338 | |
| 1339 | // Try to fold constant and into select arguments. |
| 1340 | if (SelectInst *SI = dyn_cast<SelectInst>(Op0)) |
| 1341 | if (Instruction *R = FoldBinOpIntoSelect(I, SI, this)) |
| 1342 | return R; |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1343 | } |
| 1344 | |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 1345 | if (Value *X = dyn_castNotVal(Op0)) // ~A ^ A == -1 |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 1346 | if (X == Op1) |
| 1347 | return ReplaceInstUsesWith(I, |
| 1348 | ConstantIntegral::getAllOnesValue(I.getType())); |
| 1349 | |
Chris Lattner | 8d96964 | 2003-03-10 23:06:50 +0000 | [diff] [blame] | 1350 | if (Value *X = dyn_castNotVal(Op1)) // A ^ ~A == -1 |
Chris Lattner | a288196 | 2003-02-18 19:28:33 +0000 | [diff] [blame] | 1351 | if (X == Op0) |
| 1352 | return ReplaceInstUsesWith(I, |
| 1353 | ConstantIntegral::getAllOnesValue(I.getType())); |
| 1354 | |
Chris Lattner | cb40a37 | 2003-03-10 18:24:17 +0000 | [diff] [blame] | 1355 | if (Instruction *Op1I = dyn_cast<Instruction>(Op1)) |
Chris Lattner | 26ca7e1 | 2004-02-16 03:54:20 +0000 | [diff] [blame] | 1356 | if (Op1I->getOpcode() == Instruction::Or) { |
Chris Lattner | cb40a37 | 2003-03-10 18:24:17 +0000 | [diff] [blame] | 1357 | if (Op1I->getOperand(0) == Op0) { // B^(B|A) == (A|B)^B |
| 1358 | cast<BinaryOperator>(Op1I)->swapOperands(); |
| 1359 | I.swapOperands(); |
| 1360 | std::swap(Op0, Op1); |
| 1361 | } else if (Op1I->getOperand(1) == Op0) { // B^(A|B) == (A|B)^B |
| 1362 | I.swapOperands(); |
| 1363 | std::swap(Op0, Op1); |
Chris Lattner | 26ca7e1 | 2004-02-16 03:54:20 +0000 | [diff] [blame] | 1364 | } |
| 1365 | } else if (Op1I->getOpcode() == Instruction::Xor) { |
| 1366 | if (Op0 == Op1I->getOperand(0)) // A^(A^B) == B |
| 1367 | return ReplaceInstUsesWith(I, Op1I->getOperand(1)); |
| 1368 | else if (Op0 == Op1I->getOperand(1)) // A^(B^A) == B |
| 1369 | return ReplaceInstUsesWith(I, Op1I->getOperand(0)); |
| 1370 | } |
Chris Lattner | cb40a37 | 2003-03-10 18:24:17 +0000 | [diff] [blame] | 1371 | |
| 1372 | if (Instruction *Op0I = dyn_cast<Instruction>(Op0)) |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 1373 | if (Op0I->getOpcode() == Instruction::Or && Op0I->hasOneUse()) { |
Chris Lattner | cb40a37 | 2003-03-10 18:24:17 +0000 | [diff] [blame] | 1374 | if (Op0I->getOperand(0) == Op1) // (B|A)^B == (A|B)^B |
| 1375 | cast<BinaryOperator>(Op0I)->swapOperands(); |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 1376 | if (Op0I->getOperand(1) == Op1) { // (A|B)^B == A & ~B |
Chris Lattner | cb40a37 | 2003-03-10 18:24:17 +0000 | [diff] [blame] | 1377 | Value *NotB = BinaryOperator::createNot(Op1, Op1->getName()+".not", &I); |
| 1378 | WorkList.push_back(cast<Instruction>(NotB)); |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 1379 | return BinaryOperator::create(Instruction::And, Op0I->getOperand(0), |
| 1380 | NotB); |
Chris Lattner | cb40a37 | 2003-03-10 18:24:17 +0000 | [diff] [blame] | 1381 | } |
Chris Lattner | 26ca7e1 | 2004-02-16 03:54:20 +0000 | [diff] [blame] | 1382 | } else if (Op0I->getOpcode() == Instruction::Xor) { |
| 1383 | if (Op1 == Op0I->getOperand(0)) // (A^B)^A == B |
| 1384 | return ReplaceInstUsesWith(I, Op0I->getOperand(1)); |
| 1385 | else if (Op1 == Op0I->getOperand(1)) // (B^A)^A == B |
| 1386 | return ReplaceInstUsesWith(I, Op0I->getOperand(0)); |
Chris Lattner | cb40a37 | 2003-03-10 18:24:17 +0000 | [diff] [blame] | 1387 | } |
| 1388 | |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 1389 | // (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1^C2 == 0 |
| 1390 | if (Constant *C1 = dyn_castMaskingAnd(Op0)) |
| 1391 | if (Constant *C2 = dyn_castMaskingAnd(Op1)) |
Chris Lattner | 2a9c847 | 2003-05-27 16:40:51 +0000 | [diff] [blame] | 1392 | if (ConstantExpr::get(Instruction::And, C1, C2)->isNullValue()) |
Chris Lattner | c8802d2 | 2003-03-11 00:12:48 +0000 | [diff] [blame] | 1393 | return BinaryOperator::create(Instruction::Or, Op0, Op1); |
| 1394 | |
Chris Lattner | aa9c1f1 | 2003-08-13 20:16:26 +0000 | [diff] [blame] | 1395 | // (setcc1 A, B) ^ (setcc2 A, B) --> (setcc3 A, B) |
| 1396 | if (SetCondInst *RHS = dyn_cast<SetCondInst>(I.getOperand(1))) |
| 1397 | if (Instruction *R = AssociativeOpt(I, FoldSetCCLogical(*this, RHS))) |
| 1398 | return R; |
| 1399 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1400 | return Changed ? &I : 0; |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1401 | } |
| 1402 | |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1403 | // AddOne, SubOne - Add or subtract a constant one from an integer constant... |
| 1404 | static Constant *AddOne(ConstantInt *C) { |
Chris Lattner | 2a9c847 | 2003-05-27 16:40:51 +0000 | [diff] [blame] | 1405 | Constant *Result = ConstantExpr::get(Instruction::Add, C, |
| 1406 | ConstantInt::get(C->getType(), 1)); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1407 | assert(Result && "Constant folding integer addition failed!"); |
| 1408 | return Result; |
| 1409 | } |
| 1410 | static Constant *SubOne(ConstantInt *C) { |
Chris Lattner | 2a9c847 | 2003-05-27 16:40:51 +0000 | [diff] [blame] | 1411 | Constant *Result = ConstantExpr::get(Instruction::Sub, C, |
| 1412 | ConstantInt::get(C->getType(), 1)); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1413 | assert(Result && "Constant folding integer addition failed!"); |
| 1414 | return Result; |
| 1415 | } |
| 1416 | |
Chris Lattner | 53a5b57 | 2002-05-09 20:11:54 +0000 | [diff] [blame] | 1417 | // isTrueWhenEqual - Return true if the specified setcondinst instruction is |
| 1418 | // true when both operands are equal... |
| 1419 | // |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1420 | static bool isTrueWhenEqual(Instruction &I) { |
| 1421 | return I.getOpcode() == Instruction::SetEQ || |
| 1422 | I.getOpcode() == Instruction::SetGE || |
| 1423 | I.getOpcode() == Instruction::SetLE; |
Chris Lattner | 53a5b57 | 2002-05-09 20:11:54 +0000 | [diff] [blame] | 1424 | } |
| 1425 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1426 | Instruction *InstCombiner::visitSetCondInst(BinaryOperator &I) { |
Chris Lattner | 4f98c56 | 2003-03-10 21:43:22 +0000 | [diff] [blame] | 1427 | bool Changed = SimplifyCommutative(I); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1428 | Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1); |
| 1429 | const Type *Ty = Op0->getType(); |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1430 | |
| 1431 | // setcc X, X |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1432 | if (Op0 == Op1) |
| 1433 | return ReplaceInstUsesWith(I, ConstantBool::get(isTrueWhenEqual(I))); |
Chris Lattner | 53a5b57 | 2002-05-09 20:11:54 +0000 | [diff] [blame] | 1434 | |
Chris Lattner | 3ccd17e | 2003-08-13 05:38:46 +0000 | [diff] [blame] | 1435 | // setcc <global/alloca*>, 0 - Global/Stack value addresses are never null! |
| 1436 | if (isa<ConstantPointerNull>(Op1) && |
| 1437 | (isa<GlobalValue>(Op0) || isa<AllocaInst>(Op0))) |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1438 | return ReplaceInstUsesWith(I, ConstantBool::get(!isTrueWhenEqual(I))); |
| 1439 | |
Chris Lattner | 3ccd17e | 2003-08-13 05:38:46 +0000 | [diff] [blame] | 1440 | |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1441 | // setcc's with boolean values can always be turned into bitwise operations |
| 1442 | if (Ty == Type::BoolTy) { |
| 1443 | // If this is <, >, or !=, we can change this into a simple xor instruction |
| 1444 | if (!isTrueWhenEqual(I)) |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1445 | return BinaryOperator::create(Instruction::Xor, Op0, Op1); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1446 | |
| 1447 | // Otherwise we need to make a temporary intermediate instruction and insert |
| 1448 | // it into the instruction stream. This is what we are after: |
| 1449 | // |
| 1450 | // seteq bool %A, %B -> ~(A^B) |
| 1451 | // setle bool %A, %B -> ~A | B |
| 1452 | // setge bool %A, %B -> A | ~B |
| 1453 | // |
| 1454 | if (I.getOpcode() == Instruction::SetEQ) { // seteq case |
| 1455 | Instruction *Xor = BinaryOperator::create(Instruction::Xor, Op0, Op1, |
| 1456 | I.getName()+"tmp"); |
| 1457 | InsertNewInstBefore(Xor, I); |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1458 | return BinaryOperator::createNot(Xor); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1459 | } |
| 1460 | |
| 1461 | // Handle the setXe cases... |
| 1462 | assert(I.getOpcode() == Instruction::SetGE || |
| 1463 | I.getOpcode() == Instruction::SetLE); |
| 1464 | |
| 1465 | if (I.getOpcode() == Instruction::SetGE) |
| 1466 | std::swap(Op0, Op1); // Change setge -> setle |
| 1467 | |
| 1468 | // Now we just have the SetLE case. |
Chris Lattner | af2930e | 2002-08-14 17:51:49 +0000 | [diff] [blame] | 1469 | Instruction *Not = BinaryOperator::createNot(Op0, I.getName()+"tmp"); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1470 | InsertNewInstBefore(Not, I); |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1471 | return BinaryOperator::create(Instruction::Or, Not, Op1); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1472 | } |
| 1473 | |
| 1474 | // Check to see if we are doing one of many comparisons against constant |
| 1475 | // integers at the end of their ranges... |
| 1476 | // |
| 1477 | if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) { |
Chris Lattner | 3c6a0d4 | 2004-05-25 06:32:08 +0000 | [diff] [blame] | 1478 | if (Instruction *LHSI = dyn_cast<Instruction>(Op0)) |
| 1479 | if (LHSI->hasOneUse() && LHSI->getNumOperands() == 2 && |
| 1480 | isa<ConstantInt>(LHSI->getOperand(1))) { |
| 1481 | // If this is: (X >> C1) & C2 != C3 (where any shift and any compare |
| 1482 | // could exist), turn it into (X & (C2 << C1)) != (C3 << C1). This |
| 1483 | // happens a LOT in code produced by the C front-end, for bitfield |
| 1484 | // access. |
| 1485 | if (LHSI->getOpcode() == Instruction::And && |
| 1486 | LHSI->getOperand(0)->hasOneUse()) |
| 1487 | if (ShiftInst *Shift = dyn_cast<ShiftInst>(LHSI->getOperand(0))) |
| 1488 | if (ConstantUInt *ShAmt = |
| 1489 | dyn_cast<ConstantUInt>(Shift->getOperand(1))) { |
| 1490 | ConstantInt *AndCST = cast<ConstantInt>(LHSI->getOperand(1)); |
| 1491 | |
| 1492 | // We can fold this as long as we can't shift unknown bits into |
| 1493 | // the mask. This can only happen with signed shift rights, as |
| 1494 | // they sign-extend. |
| 1495 | const Type *Ty = Shift->getType(); |
| 1496 | if (Shift->getOpcode() != Instruction::Shr || |
| 1497 | Shift->getType()->isUnsigned() || |
| 1498 | // To test for the bad case of the signed shr, see if any of |
| 1499 | // the bits shifted in could be tested after the mask. |
| 1500 | ConstantExpr::getAnd(ConstantExpr::getShl(ConstantInt::getAllOnesValue(Ty), ConstantUInt::get(Type::UByteTy, Ty->getPrimitiveSize()*8-ShAmt->getValue())), AndCST)->isNullValue()) { |
| 1501 | unsigned ShiftOp = Shift->getOpcode() == Instruction::Shl |
| 1502 | ? Instruction::Shr : Instruction::Shl; |
| 1503 | I.setOperand(1, ConstantExpr::get(ShiftOp, CI, ShAmt)); |
| 1504 | LHSI->setOperand(1, ConstantExpr::get(ShiftOp, AndCST, ShAmt)); |
| 1505 | LHSI->setOperand(0, Shift->getOperand(0)); |
| 1506 | WorkList.push_back(Shift); // Shift is probably dead. |
| 1507 | AddUsesToWorkList(I); |
| 1508 | return &I; |
| 1509 | } |
| 1510 | } |
| 1511 | } |
| 1512 | |
Chris Lattner | bc5d414 | 2003-07-23 17:02:11 +0000 | [diff] [blame] | 1513 | // Simplify seteq and setne instructions... |
| 1514 | if (I.getOpcode() == Instruction::SetEQ || |
| 1515 | I.getOpcode() == Instruction::SetNE) { |
| 1516 | bool isSetNE = I.getOpcode() == Instruction::SetNE; |
| 1517 | |
Chris Lattner | 00b1a7e | 2003-07-23 17:26:36 +0000 | [diff] [blame] | 1518 | // If the first operand is (and|or|xor) with a constant, and the second |
Chris Lattner | bc5d414 | 2003-07-23 17:02:11 +0000 | [diff] [blame] | 1519 | // operand is a constant, simplify a bit. |
Chris Lattner | 934754b | 2003-08-13 05:33:12 +0000 | [diff] [blame] | 1520 | if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0)) { |
| 1521 | switch (BO->getOpcode()) { |
| 1522 | case Instruction::Add: |
| 1523 | if (CI->isNullValue()) { |
| 1524 | // Replace ((add A, B) != 0) with (A != -B) if A or B is |
| 1525 | // efficiently invertible, or if the add has just this one use. |
| 1526 | Value *BOp0 = BO->getOperand(0), *BOp1 = BO->getOperand(1); |
| 1527 | if (Value *NegVal = dyn_castNegVal(BOp1)) |
| 1528 | return new SetCondInst(I.getOpcode(), BOp0, NegVal); |
| 1529 | else if (Value *NegVal = dyn_castNegVal(BOp0)) |
| 1530 | return new SetCondInst(I.getOpcode(), NegVal, BOp1); |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 1531 | else if (BO->hasOneUse()) { |
Chris Lattner | 934754b | 2003-08-13 05:33:12 +0000 | [diff] [blame] | 1532 | Instruction *Neg = BinaryOperator::createNeg(BOp1, BO->getName()); |
| 1533 | BO->setName(""); |
| 1534 | InsertNewInstBefore(Neg, I); |
| 1535 | return new SetCondInst(I.getOpcode(), BOp0, Neg); |
| 1536 | } |
| 1537 | } |
| 1538 | break; |
| 1539 | case Instruction::Xor: |
| 1540 | // For the xor case, we can xor two constants together, eliminating |
| 1541 | // the explicit xor. |
| 1542 | if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1))) |
| 1543 | return BinaryOperator::create(I.getOpcode(), BO->getOperand(0), |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1544 | ConstantExpr::get(Instruction::Xor, CI, BOC)); |
Chris Lattner | 934754b | 2003-08-13 05:33:12 +0000 | [diff] [blame] | 1545 | |
| 1546 | // FALLTHROUGH |
| 1547 | case Instruction::Sub: |
| 1548 | // Replace (([sub|xor] A, B) != 0) with (A != B) |
| 1549 | if (CI->isNullValue()) |
| 1550 | return new SetCondInst(I.getOpcode(), BO->getOperand(0), |
| 1551 | BO->getOperand(1)); |
| 1552 | break; |
| 1553 | |
| 1554 | case Instruction::Or: |
| 1555 | // If bits are being or'd in that are not present in the constant we |
| 1556 | // are comparing against, then the comparison could never succeed! |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1557 | if (Constant *BOC = dyn_cast<Constant>(BO->getOperand(1))) { |
| 1558 | Constant *NotCI = NotConstant(CI); |
| 1559 | if (!ConstantExpr::get(Instruction::And, BOC, NotCI)->isNullValue()) |
Chris Lattner | bc5d414 | 2003-07-23 17:02:11 +0000 | [diff] [blame] | 1560 | return ReplaceInstUsesWith(I, ConstantBool::get(isSetNE)); |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1561 | } |
Chris Lattner | 934754b | 2003-08-13 05:33:12 +0000 | [diff] [blame] | 1562 | break; |
| 1563 | |
| 1564 | case Instruction::And: |
| 1565 | if (ConstantInt *BOC = dyn_cast<ConstantInt>(BO->getOperand(1))) { |
Chris Lattner | bc5d414 | 2003-07-23 17:02:11 +0000 | [diff] [blame] | 1566 | // If bits are being compared against that are and'd out, then the |
| 1567 | // comparison can never succeed! |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1568 | if (!ConstantExpr::get(Instruction::And, CI, |
| 1569 | NotConstant(BOC))->isNullValue()) |
Chris Lattner | bc5d414 | 2003-07-23 17:02:11 +0000 | [diff] [blame] | 1570 | return ReplaceInstUsesWith(I, ConstantBool::get(isSetNE)); |
Chris Lattner | 934754b | 2003-08-13 05:33:12 +0000 | [diff] [blame] | 1571 | |
| 1572 | // Replace (and X, (1 << size(X)-1) != 0) with x < 0, converting X |
| 1573 | // to be a signed value as appropriate. |
| 1574 | if (isSignBit(BOC)) { |
| 1575 | Value *X = BO->getOperand(0); |
| 1576 | // If 'X' is not signed, insert a cast now... |
| 1577 | if (!BOC->getType()->isSigned()) { |
Chris Lattner | 4cb170c | 2004-02-23 06:38:22 +0000 | [diff] [blame] | 1578 | const Type *DestTy = getSignedIntegralType(BOC->getType()); |
Chris Lattner | 934754b | 2003-08-13 05:33:12 +0000 | [diff] [blame] | 1579 | CastInst *NewCI = new CastInst(X,DestTy,X->getName()+".signed"); |
| 1580 | InsertNewInstBefore(NewCI, I); |
| 1581 | X = NewCI; |
| 1582 | } |
| 1583 | return new SetCondInst(isSetNE ? Instruction::SetLT : |
| 1584 | Instruction::SetGE, X, |
| 1585 | Constant::getNullValue(X->getType())); |
| 1586 | } |
Chris Lattner | bc5d414 | 2003-07-23 17:02:11 +0000 | [diff] [blame] | 1587 | } |
Chris Lattner | 934754b | 2003-08-13 05:33:12 +0000 | [diff] [blame] | 1588 | default: break; |
| 1589 | } |
| 1590 | } |
Chris Lattner | c5943fb | 2004-02-23 07:16:20 +0000 | [diff] [blame] | 1591 | } else { // Not a SetEQ/SetNE |
| 1592 | // If the LHS is a cast from an integral value of the same size, |
| 1593 | if (CastInst *Cast = dyn_cast<CastInst>(Op0)) { |
| 1594 | Value *CastOp = Cast->getOperand(0); |
| 1595 | const Type *SrcTy = CastOp->getType(); |
| 1596 | unsigned SrcTySize = SrcTy->getPrimitiveSize(); |
| 1597 | if (SrcTy != Cast->getType() && SrcTy->isInteger() && |
| 1598 | SrcTySize == Cast->getType()->getPrimitiveSize()) { |
| 1599 | assert((SrcTy->isSigned() ^ Cast->getType()->isSigned()) && |
| 1600 | "Source and destination signednesses should differ!"); |
| 1601 | if (Cast->getType()->isSigned()) { |
| 1602 | // If this is a signed comparison, check for comparisons in the |
| 1603 | // vicinity of zero. |
| 1604 | if (I.getOpcode() == Instruction::SetLT && CI->isNullValue()) |
| 1605 | // X < 0 => x > 127 |
| 1606 | return BinaryOperator::create(Instruction::SetGT, CastOp, |
| 1607 | ConstantUInt::get(SrcTy, (1ULL << (SrcTySize*8-1))-1)); |
| 1608 | else if (I.getOpcode() == Instruction::SetGT && |
| 1609 | cast<ConstantSInt>(CI)->getValue() == -1) |
| 1610 | // X > -1 => x < 128 |
Chris Lattner | 077a373 | 2004-02-23 21:46:42 +0000 | [diff] [blame] | 1611 | return BinaryOperator::create(Instruction::SetLT, CastOp, |
Chris Lattner | c5943fb | 2004-02-23 07:16:20 +0000 | [diff] [blame] | 1612 | ConstantUInt::get(SrcTy, 1ULL << (SrcTySize*8-1))); |
| 1613 | } else { |
| 1614 | ConstantUInt *CUI = cast<ConstantUInt>(CI); |
| 1615 | if (I.getOpcode() == Instruction::SetLT && |
| 1616 | CUI->getValue() == 1ULL << (SrcTySize*8-1)) |
| 1617 | // X < 128 => X > -1 |
| 1618 | return BinaryOperator::create(Instruction::SetGT, CastOp, |
| 1619 | ConstantSInt::get(SrcTy, -1)); |
| 1620 | else if (I.getOpcode() == Instruction::SetGT && |
| 1621 | CUI->getValue() == (1ULL << (SrcTySize*8-1))-1) |
| 1622 | // X > 127 => X < 0 |
| 1623 | return BinaryOperator::create(Instruction::SetLT, CastOp, |
| 1624 | Constant::getNullValue(SrcTy)); |
| 1625 | } |
| 1626 | } |
| 1627 | } |
Chris Lattner | 40f5d70 | 2003-06-04 05:10:11 +0000 | [diff] [blame] | 1628 | } |
Chris Lattner | 074d84c | 2003-06-01 03:35:25 +0000 | [diff] [blame] | 1629 | |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1630 | // Check to see if we are comparing against the minimum or maximum value... |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 1631 | if (CI->isMinValue()) { |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1632 | if (I.getOpcode() == Instruction::SetLT) // A < MIN -> FALSE |
| 1633 | return ReplaceInstUsesWith(I, ConstantBool::False); |
| 1634 | if (I.getOpcode() == Instruction::SetGE) // A >= MIN -> TRUE |
| 1635 | return ReplaceInstUsesWith(I, ConstantBool::True); |
| 1636 | if (I.getOpcode() == Instruction::SetLE) // A <= MIN -> A == MIN |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1637 | return BinaryOperator::create(Instruction::SetEQ, Op0, Op1); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1638 | if (I.getOpcode() == Instruction::SetGT) // A > MIN -> A != MIN |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1639 | return BinaryOperator::create(Instruction::SetNE, Op0, Op1); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1640 | |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 1641 | } else if (CI->isMaxValue()) { |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1642 | if (I.getOpcode() == Instruction::SetGT) // A > MAX -> FALSE |
| 1643 | return ReplaceInstUsesWith(I, ConstantBool::False); |
| 1644 | if (I.getOpcode() == Instruction::SetLE) // A <= MAX -> TRUE |
| 1645 | return ReplaceInstUsesWith(I, ConstantBool::True); |
| 1646 | if (I.getOpcode() == Instruction::SetGE) // A >= MAX -> A == MAX |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1647 | return BinaryOperator::create(Instruction::SetEQ, Op0, Op1); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1648 | if (I.getOpcode() == Instruction::SetLT) // A < MAX -> A != MAX |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1649 | return BinaryOperator::create(Instruction::SetNE, Op0, Op1); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1650 | |
| 1651 | // Comparing against a value really close to min or max? |
| 1652 | } else if (isMinValuePlusOne(CI)) { |
| 1653 | if (I.getOpcode() == Instruction::SetLT) // A < MIN+1 -> A == MIN |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1654 | return BinaryOperator::create(Instruction::SetEQ, Op0, SubOne(CI)); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1655 | if (I.getOpcode() == Instruction::SetGE) // A >= MIN-1 -> A != MIN |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1656 | return BinaryOperator::create(Instruction::SetNE, Op0, SubOne(CI)); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1657 | |
| 1658 | } else if (isMaxValueMinusOne(CI)) { |
| 1659 | if (I.getOpcode() == Instruction::SetGT) // A > MAX-1 -> A == MAX |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1660 | return BinaryOperator::create(Instruction::SetEQ, Op0, AddOne(CI)); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1661 | if (I.getOpcode() == Instruction::SetLE) // A <= MAX-1 -> A != MAX |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1662 | return BinaryOperator::create(Instruction::SetNE, Op0, AddOne(CI)); |
Chris Lattner | 8b17094 | 2002-08-09 23:47:40 +0000 | [diff] [blame] | 1663 | } |
Chris Lattner | 45aaafe | 2004-02-23 05:47:48 +0000 | [diff] [blame] | 1664 | |
| 1665 | // If we still have a setle or setge instruction, turn it into the |
| 1666 | // appropriate setlt or setgt instruction. Since the border cases have |
| 1667 | // already been handled above, this requires little checking. |
| 1668 | // |
| 1669 | if (I.getOpcode() == Instruction::SetLE) |
| 1670 | return BinaryOperator::create(Instruction::SetLT, Op0, AddOne(CI)); |
| 1671 | if (I.getOpcode() == Instruction::SetGE) |
| 1672 | return BinaryOperator::create(Instruction::SetGT, Op0, SubOne(CI)); |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1673 | } |
| 1674 | |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1675 | // Test to see if the operands of the setcc are casted versions of other |
| 1676 | // values. If the cast can be stripped off both arguments, we do so now. |
Chris Lattner | 6870805 | 2003-11-03 05:17:03 +0000 | [diff] [blame] | 1677 | if (CastInst *CI = dyn_cast<CastInst>(Op0)) { |
| 1678 | Value *CastOp0 = CI->getOperand(0); |
| 1679 | if (CastOp0->getType()->isLosslesslyConvertibleTo(CI->getType()) && |
Chris Lattner | 0cea42a | 2004-03-13 23:54:27 +0000 | [diff] [blame] | 1680 | (isa<Constant>(Op1) || isa<CastInst>(Op1)) && |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1681 | (I.getOpcode() == Instruction::SetEQ || |
| 1682 | I.getOpcode() == Instruction::SetNE)) { |
| 1683 | // We keep moving the cast from the left operand over to the right |
| 1684 | // operand, where it can often be eliminated completely. |
Chris Lattner | 6870805 | 2003-11-03 05:17:03 +0000 | [diff] [blame] | 1685 | Op0 = CastOp0; |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1686 | |
| 1687 | // If operand #1 is a cast instruction, see if we can eliminate it as |
| 1688 | // well. |
Chris Lattner | 6870805 | 2003-11-03 05:17:03 +0000 | [diff] [blame] | 1689 | if (CastInst *CI2 = dyn_cast<CastInst>(Op1)) |
| 1690 | if (CI2->getOperand(0)->getType()->isLosslesslyConvertibleTo( |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1691 | Op0->getType())) |
Chris Lattner | 6870805 | 2003-11-03 05:17:03 +0000 | [diff] [blame] | 1692 | Op1 = CI2->getOperand(0); |
Chris Lattner | de90b76 | 2003-11-03 04:25:02 +0000 | [diff] [blame] | 1693 | |
| 1694 | // If Op1 is a constant, we can fold the cast into the constant. |
| 1695 | if (Op1->getType() != Op0->getType()) |
| 1696 | if (Constant *Op1C = dyn_cast<Constant>(Op1)) { |
| 1697 | Op1 = ConstantExpr::getCast(Op1C, Op0->getType()); |
| 1698 | } else { |
| 1699 | // Otherwise, cast the RHS right before the setcc |
| 1700 | Op1 = new CastInst(Op1, Op0->getType(), Op1->getName()); |
| 1701 | InsertNewInstBefore(cast<Instruction>(Op1), I); |
| 1702 | } |
| 1703 | return BinaryOperator::create(I.getOpcode(), Op0, Op1); |
| 1704 | } |
| 1705 | |
Chris Lattner | 6870805 | 2003-11-03 05:17:03 +0000 | [diff] [blame] | 1706 | // Handle the special case of: setcc (cast bool to X), <cst> |
| 1707 | // This comes up when you have code like |
| 1708 | // int X = A < B; |
| 1709 | // if (X) ... |
| 1710 | // For generality, we handle any zero-extension of any operand comparison |
| 1711 | // with a constant. |
| 1712 | if (ConstantInt *ConstantRHS = dyn_cast<ConstantInt>(Op1)) { |
| 1713 | const Type *SrcTy = CastOp0->getType(); |
| 1714 | const Type *DestTy = Op0->getType(); |
| 1715 | if (SrcTy->getPrimitiveSize() < DestTy->getPrimitiveSize() && |
| 1716 | (SrcTy->isUnsigned() || SrcTy == Type::BoolTy)) { |
| 1717 | // Ok, we have an expansion of operand 0 into a new type. Get the |
| 1718 | // constant value, masink off bits which are not set in the RHS. These |
| 1719 | // could be set if the destination value is signed. |
| 1720 | uint64_t ConstVal = ConstantRHS->getRawValue(); |
| 1721 | ConstVal &= (1ULL << DestTy->getPrimitiveSize()*8)-1; |
| 1722 | |
| 1723 | // If the constant we are comparing it with has high bits set, which |
| 1724 | // don't exist in the original value, the values could never be equal, |
| 1725 | // because the source would be zero extended. |
| 1726 | unsigned SrcBits = |
| 1727 | SrcTy == Type::BoolTy ? 1 : SrcTy->getPrimitiveSize()*8; |
Chris Lattner | 1bcc70d | 2003-11-05 17:31:36 +0000 | [diff] [blame] | 1728 | bool HasSignBit = ConstVal & (1ULL << (DestTy->getPrimitiveSize()*8-1)); |
| 1729 | if (ConstVal & ~((1ULL << SrcBits)-1)) { |
Chris Lattner | 6870805 | 2003-11-03 05:17:03 +0000 | [diff] [blame] | 1730 | switch (I.getOpcode()) { |
| 1731 | default: assert(0 && "Unknown comparison type!"); |
| 1732 | case Instruction::SetEQ: |
| 1733 | return ReplaceInstUsesWith(I, ConstantBool::False); |
| 1734 | case Instruction::SetNE: |
| 1735 | return ReplaceInstUsesWith(I, ConstantBool::True); |
| 1736 | case Instruction::SetLT: |
| 1737 | case Instruction::SetLE: |
| 1738 | if (DestTy->isSigned() && HasSignBit) |
| 1739 | return ReplaceInstUsesWith(I, ConstantBool::False); |
| 1740 | return ReplaceInstUsesWith(I, ConstantBool::True); |
| 1741 | case Instruction::SetGT: |
| 1742 | case Instruction::SetGE: |
| 1743 | if (DestTy->isSigned() && HasSignBit) |
| 1744 | return ReplaceInstUsesWith(I, ConstantBool::True); |
| 1745 | return ReplaceInstUsesWith(I, ConstantBool::False); |
| 1746 | } |
| 1747 | } |
| 1748 | |
| 1749 | // Otherwise, we can replace the setcc with a setcc of the smaller |
| 1750 | // operand value. |
| 1751 | Op1 = ConstantExpr::getCast(cast<Constant>(Op1), SrcTy); |
| 1752 | return BinaryOperator::create(I.getOpcode(), CastOp0, Op1); |
| 1753 | } |
| 1754 | } |
| 1755 | } |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1756 | return Changed ? &I : 0; |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1757 | } |
| 1758 | |
| 1759 | |
| 1760 | |
Chris Lattner | ea34005 | 2003-03-10 19:16:08 +0000 | [diff] [blame] | 1761 | Instruction *InstCombiner::visitShiftInst(ShiftInst &I) { |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1762 | assert(I.getOperand(1)->getType() == Type::UByteTy); |
| 1763 | Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1); |
Chris Lattner | df17af1 | 2003-08-12 21:53:41 +0000 | [diff] [blame] | 1764 | bool isLeftShift = I.getOpcode() == Instruction::Shl; |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1765 | |
| 1766 | // shl X, 0 == X and shr X, 0 == X |
| 1767 | // shl 0, X == 0 and shr 0, X == 0 |
| 1768 | if (Op1 == Constant::getNullValue(Type::UByteTy) || |
Chris Lattner | 233f7dc | 2002-08-12 21:17:25 +0000 | [diff] [blame] | 1769 | Op0 == Constant::getNullValue(Op0->getType())) |
| 1770 | return ReplaceInstUsesWith(I, Op0); |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1771 | |
Chris Lattner | df17af1 | 2003-08-12 21:53:41 +0000 | [diff] [blame] | 1772 | // shr int -1, X = -1 (for any arithmetic shift rights of ~0) |
| 1773 | if (!isLeftShift) |
| 1774 | if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(Op0)) |
| 1775 | if (CSI->isAllOnesValue()) |
| 1776 | return ReplaceInstUsesWith(I, CSI); |
| 1777 | |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 1778 | // Try to fold constant and into select arguments. |
| 1779 | if (isa<Constant>(Op0)) |
| 1780 | if (SelectInst *SI = dyn_cast<SelectInst>(Op1)) |
| 1781 | if (Instruction *R = FoldBinOpIntoSelect(I, SI, this)) |
| 1782 | return R; |
| 1783 | |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1784 | if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(Op1)) { |
Chris Lattner | 08fd7ab | 2003-07-24 17:52:58 +0000 | [diff] [blame] | 1785 | // shl uint X, 32 = 0 and shr ubyte Y, 9 = 0, ... just don't eliminate shr |
| 1786 | // of a signed value. |
| 1787 | // |
Chris Lattner | ea34005 | 2003-03-10 19:16:08 +0000 | [diff] [blame] | 1788 | unsigned TypeBits = Op0->getType()->getPrimitiveSize()*8; |
Chris Lattner | 8adac75 | 2004-02-23 20:30:06 +0000 | [diff] [blame] | 1789 | if (CUI->getValue() >= TypeBits) { |
| 1790 | if (!Op0->getType()->isSigned() || isLeftShift) |
| 1791 | return ReplaceInstUsesWith(I, Constant::getNullValue(Op0->getType())); |
| 1792 | else { |
| 1793 | I.setOperand(1, ConstantUInt::get(Type::UByteTy, TypeBits-1)); |
| 1794 | return &I; |
| 1795 | } |
| 1796 | } |
Chris Lattner | f283608 | 2002-09-10 23:04:09 +0000 | [diff] [blame] | 1797 | |
Chris Lattner | e92d2f4 | 2003-08-13 04:18:28 +0000 | [diff] [blame] | 1798 | // ((X*C1) << C2) == (X * (C1 << C2)) |
| 1799 | if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0)) |
| 1800 | if (BO->getOpcode() == Instruction::Mul && isLeftShift) |
| 1801 | if (Constant *BOOp = dyn_cast<Constant>(BO->getOperand(1))) |
| 1802 | return BinaryOperator::create(Instruction::Mul, BO->getOperand(0), |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1803 | ConstantExpr::get(Instruction::Shl, BOOp, CUI)); |
Chris Lattner | e92d2f4 | 2003-08-13 04:18:28 +0000 | [diff] [blame] | 1804 | |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 1805 | // Try to fold constant and into select arguments. |
| 1806 | if (SelectInst *SI = dyn_cast<SelectInst>(Op0)) |
| 1807 | if (Instruction *R = FoldBinOpIntoSelect(I, SI, this)) |
| 1808 | return R; |
Chris Lattner | e92d2f4 | 2003-08-13 04:18:28 +0000 | [diff] [blame] | 1809 | |
Chris Lattner | df17af1 | 2003-08-12 21:53:41 +0000 | [diff] [blame] | 1810 | // If the operand is an bitwise operator with a constant RHS, and the |
| 1811 | // shift is the only use, we can pull it out of the shift. |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 1812 | if (Op0->hasOneUse()) |
Chris Lattner | df17af1 | 2003-08-12 21:53:41 +0000 | [diff] [blame] | 1813 | if (BinaryOperator *Op0BO = dyn_cast<BinaryOperator>(Op0)) |
| 1814 | if (ConstantInt *Op0C = dyn_cast<ConstantInt>(Op0BO->getOperand(1))) { |
| 1815 | bool isValid = true; // Valid only for And, Or, Xor |
| 1816 | bool highBitSet = false; // Transform if high bit of constant set? |
| 1817 | |
| 1818 | switch (Op0BO->getOpcode()) { |
| 1819 | default: isValid = false; break; // Do not perform transform! |
| 1820 | case Instruction::Or: |
| 1821 | case Instruction::Xor: |
| 1822 | highBitSet = false; |
| 1823 | break; |
| 1824 | case Instruction::And: |
| 1825 | highBitSet = true; |
| 1826 | break; |
| 1827 | } |
| 1828 | |
| 1829 | // If this is a signed shift right, and the high bit is modified |
| 1830 | // by the logical operation, do not perform the transformation. |
| 1831 | // The highBitSet boolean indicates the value of the high bit of |
| 1832 | // the constant which would cause it to be modified for this |
| 1833 | // operation. |
| 1834 | // |
| 1835 | if (isValid && !isLeftShift && !I.getType()->isUnsigned()) { |
| 1836 | uint64_t Val = Op0C->getRawValue(); |
| 1837 | isValid = ((Val & (1 << (TypeBits-1))) != 0) == highBitSet; |
| 1838 | } |
| 1839 | |
| 1840 | if (isValid) { |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1841 | Constant *NewRHS = ConstantExpr::get(I.getOpcode(), Op0C, CUI); |
Chris Lattner | df17af1 | 2003-08-12 21:53:41 +0000 | [diff] [blame] | 1842 | |
| 1843 | Instruction *NewShift = |
| 1844 | new ShiftInst(I.getOpcode(), Op0BO->getOperand(0), CUI, |
| 1845 | Op0BO->getName()); |
| 1846 | Op0BO->setName(""); |
| 1847 | InsertNewInstBefore(NewShift, I); |
| 1848 | |
| 1849 | return BinaryOperator::create(Op0BO->getOpcode(), NewShift, |
| 1850 | NewRHS); |
| 1851 | } |
| 1852 | } |
| 1853 | |
Chris Lattner | 08fd7ab | 2003-07-24 17:52:58 +0000 | [diff] [blame] | 1854 | // If this is a shift of a shift, see if we can fold the two together... |
Chris Lattner | df17af1 | 2003-08-12 21:53:41 +0000 | [diff] [blame] | 1855 | if (ShiftInst *Op0SI = dyn_cast<ShiftInst>(Op0)) |
Chris Lattner | 943c713 | 2003-07-24 18:38:56 +0000 | [diff] [blame] | 1856 | if (ConstantUInt *ShiftAmt1C = |
| 1857 | dyn_cast<ConstantUInt>(Op0SI->getOperand(1))) { |
Chris Lattner | 08fd7ab | 2003-07-24 17:52:58 +0000 | [diff] [blame] | 1858 | unsigned ShiftAmt1 = ShiftAmt1C->getValue(); |
| 1859 | unsigned ShiftAmt2 = CUI->getValue(); |
| 1860 | |
| 1861 | // Check for (A << c1) << c2 and (A >> c1) >> c2 |
| 1862 | if (I.getOpcode() == Op0SI->getOpcode()) { |
| 1863 | unsigned Amt = ShiftAmt1+ShiftAmt2; // Fold into one big shift... |
Chris Lattner | 8adac75 | 2004-02-23 20:30:06 +0000 | [diff] [blame] | 1864 | if (Op0->getType()->getPrimitiveSize()*8 < Amt) |
| 1865 | Amt = Op0->getType()->getPrimitiveSize()*8; |
Chris Lattner | 08fd7ab | 2003-07-24 17:52:58 +0000 | [diff] [blame] | 1866 | return new ShiftInst(I.getOpcode(), Op0SI->getOperand(0), |
| 1867 | ConstantUInt::get(Type::UByteTy, Amt)); |
| 1868 | } |
| 1869 | |
Chris Lattner | 943c713 | 2003-07-24 18:38:56 +0000 | [diff] [blame] | 1870 | // Check for (A << c1) >> c2 or visaversa. If we are dealing with |
| 1871 | // signed types, we can only support the (A >> c1) << c2 configuration, |
| 1872 | // because it can not turn an arbitrary bit of A into a sign bit. |
Chris Lattner | df17af1 | 2003-08-12 21:53:41 +0000 | [diff] [blame] | 1873 | if (I.getType()->isUnsigned() || isLeftShift) { |
Chris Lattner | 08fd7ab | 2003-07-24 17:52:58 +0000 | [diff] [blame] | 1874 | // Calculate bitmask for what gets shifted off the edge... |
| 1875 | Constant *C = ConstantIntegral::getAllOnesValue(I.getType()); |
Chris Lattner | df17af1 | 2003-08-12 21:53:41 +0000 | [diff] [blame] | 1876 | if (isLeftShift) |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1877 | C = ConstantExpr::get(Instruction::Shl, C, ShiftAmt1C); |
Chris Lattner | df17af1 | 2003-08-12 21:53:41 +0000 | [diff] [blame] | 1878 | else |
Chris Lattner | 7c4049c | 2004-01-12 19:35:11 +0000 | [diff] [blame] | 1879 | C = ConstantExpr::get(Instruction::Shr, C, ShiftAmt1C); |
Chris Lattner | 08fd7ab | 2003-07-24 17:52:58 +0000 | [diff] [blame] | 1880 | |
| 1881 | Instruction *Mask = |
| 1882 | BinaryOperator::create(Instruction::And, Op0SI->getOperand(0), |
| 1883 | C, Op0SI->getOperand(0)->getName()+".mask"); |
| 1884 | InsertNewInstBefore(Mask, I); |
| 1885 | |
| 1886 | // Figure out what flavor of shift we should use... |
| 1887 | if (ShiftAmt1 == ShiftAmt2) |
| 1888 | return ReplaceInstUsesWith(I, Mask); // (A << c) >> c === A & c2 |
| 1889 | else if (ShiftAmt1 < ShiftAmt2) { |
| 1890 | return new ShiftInst(I.getOpcode(), Mask, |
| 1891 | ConstantUInt::get(Type::UByteTy, ShiftAmt2-ShiftAmt1)); |
| 1892 | } else { |
| 1893 | return new ShiftInst(Op0SI->getOpcode(), Mask, |
| 1894 | ConstantUInt::get(Type::UByteTy, ShiftAmt1-ShiftAmt2)); |
| 1895 | } |
| 1896 | } |
| 1897 | } |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1898 | } |
Chris Lattner | 6eaeb57 | 2002-10-08 16:16:40 +0000 | [diff] [blame] | 1899 | |
Chris Lattner | 3f5b877 | 2002-05-06 16:14:14 +0000 | [diff] [blame] | 1900 | return 0; |
| 1901 | } |
| 1902 | |
| 1903 | |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 1904 | // isEliminableCastOfCast - Return true if it is valid to eliminate the CI |
| 1905 | // instruction. |
| 1906 | // |
Chris Lattner | 24c8e38 | 2003-07-24 17:35:25 +0000 | [diff] [blame] | 1907 | static inline bool isEliminableCastOfCast(const Type *SrcTy, const Type *MidTy, |
| 1908 | const Type *DstTy) { |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 1909 | |
Chris Lattner | 8fd217c | 2002-08-02 20:00:25 +0000 | [diff] [blame] | 1910 | // It is legal to eliminate the instruction if casting A->B->A if the sizes |
| 1911 | // are identical and the bits don't get reinterpreted (for example |
Chris Lattner | 5cf6f11 | 2002-08-14 23:21:10 +0000 | [diff] [blame] | 1912 | // int->float->int would not be allowed) |
Misha Brukman | f117cc9 | 2003-05-20 18:45:36 +0000 | [diff] [blame] | 1913 | if (SrcTy == DstTy && SrcTy->isLosslesslyConvertibleTo(MidTy)) |
Chris Lattner | 8fd217c | 2002-08-02 20:00:25 +0000 | [diff] [blame] | 1914 | return true; |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 1915 | |
| 1916 | // Allow free casting and conversion of sizes as long as the sign doesn't |
| 1917 | // change... |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 1918 | if (SrcTy->isIntegral() && MidTy->isIntegral() && DstTy->isIntegral()) { |
Chris Lattner | 8fd217c | 2002-08-02 20:00:25 +0000 | [diff] [blame] | 1919 | unsigned SrcSize = SrcTy->getPrimitiveSize(); |
| 1920 | unsigned MidSize = MidTy->getPrimitiveSize(); |
| 1921 | unsigned DstSize = DstTy->getPrimitiveSize(); |
Chris Lattner | 8fd217c | 2002-08-02 20:00:25 +0000 | [diff] [blame] | 1922 | |
Chris Lattner | 3ecce66 | 2002-08-15 16:15:25 +0000 | [diff] [blame] | 1923 | // Cases where we are monotonically decreasing the size of the type are |
| 1924 | // always ok, regardless of what sign changes are going on. |
| 1925 | // |
Chris Lattner | 5cf6f11 | 2002-08-14 23:21:10 +0000 | [diff] [blame] | 1926 | if (SrcSize >= MidSize && MidSize >= DstSize) |
Chris Lattner | 8fd217c | 2002-08-02 20:00:25 +0000 | [diff] [blame] | 1927 | return true; |
Chris Lattner | 3ecce66 | 2002-08-15 16:15:25 +0000 | [diff] [blame] | 1928 | |
Chris Lattner | d06451f | 2002-09-23 23:39:43 +0000 | [diff] [blame] | 1929 | // Cases where the source and destination type are the same, but the middle |
| 1930 | // type is bigger are noops. |
| 1931 | // |
| 1932 | if (SrcSize == DstSize && MidSize > SrcSize) |
| 1933 | return true; |
| 1934 | |
Chris Lattner | 3ecce66 | 2002-08-15 16:15:25 +0000 | [diff] [blame] | 1935 | // If we are monotonically growing, things are more complex. |
| 1936 | // |
| 1937 | if (SrcSize <= MidSize && MidSize <= DstSize) { |
| 1938 | // We have eight combinations of signedness to worry about. Here's the |
| 1939 | // table: |
| 1940 | static const int SignTable[8] = { |
| 1941 | // CODE, SrcSigned, MidSigned, DstSigned, Comment |
| 1942 | 1, // U U U Always ok |
| 1943 | 1, // U U S Always ok |
| 1944 | 3, // U S U Ok iff SrcSize != MidSize |
| 1945 | 3, // U S S Ok iff SrcSize != MidSize |
| 1946 | 0, // S U U Never ok |
| 1947 | 2, // S U S Ok iff MidSize == DstSize |
| 1948 | 1, // S S U Always ok |
| 1949 | 1, // S S S Always ok |
| 1950 | }; |
| 1951 | |
| 1952 | // Choose an action based on the current entry of the signtable that this |
| 1953 | // cast of cast refers to... |
| 1954 | unsigned Row = SrcTy->isSigned()*4+MidTy->isSigned()*2+DstTy->isSigned(); |
| 1955 | switch (SignTable[Row]) { |
| 1956 | case 0: return false; // Never ok |
| 1957 | case 1: return true; // Always ok |
| 1958 | case 2: return MidSize == DstSize; // Ok iff MidSize == DstSize |
| 1959 | case 3: // Ok iff SrcSize != MidSize |
| 1960 | return SrcSize != MidSize || SrcTy == Type::BoolTy; |
| 1961 | default: assert(0 && "Bad entry in sign table!"); |
| 1962 | } |
Chris Lattner | 3ecce66 | 2002-08-15 16:15:25 +0000 | [diff] [blame] | 1963 | } |
Chris Lattner | 8fd217c | 2002-08-02 20:00:25 +0000 | [diff] [blame] | 1964 | } |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 1965 | |
| 1966 | // Otherwise, we cannot succeed. Specifically we do not want to allow things |
| 1967 | // like: short -> ushort -> uint, because this can create wrong results if |
| 1968 | // the input short is negative! |
| 1969 | // |
| 1970 | return false; |
| 1971 | } |
| 1972 | |
Chris Lattner | 24c8e38 | 2003-07-24 17:35:25 +0000 | [diff] [blame] | 1973 | static bool ValueRequiresCast(const Value *V, const Type *Ty) { |
| 1974 | if (V->getType() == Ty || isa<Constant>(V)) return false; |
| 1975 | if (const CastInst *CI = dyn_cast<CastInst>(V)) |
| 1976 | if (isEliminableCastOfCast(CI->getOperand(0)->getType(), CI->getType(), Ty)) |
| 1977 | return false; |
| 1978 | return true; |
| 1979 | } |
| 1980 | |
| 1981 | /// InsertOperandCastBefore - This inserts a cast of V to DestTy before the |
| 1982 | /// InsertBefore instruction. This is specialized a bit to avoid inserting |
| 1983 | /// casts that are known to not do anything... |
| 1984 | /// |
| 1985 | Value *InstCombiner::InsertOperandCastBefore(Value *V, const Type *DestTy, |
| 1986 | Instruction *InsertBefore) { |
| 1987 | if (V->getType() == DestTy) return V; |
| 1988 | if (Constant *C = dyn_cast<Constant>(V)) |
| 1989 | return ConstantExpr::getCast(C, DestTy); |
| 1990 | |
| 1991 | CastInst *CI = new CastInst(V, DestTy, V->getName()); |
| 1992 | InsertNewInstBefore(CI, *InsertBefore); |
| 1993 | return CI; |
| 1994 | } |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 1995 | |
| 1996 | // CastInst simplification |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 1997 | // |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 1998 | Instruction *InstCombiner::visitCastInst(CastInst &CI) { |
Chris Lattner | 79d35b3 | 2003-06-23 21:59:52 +0000 | [diff] [blame] | 1999 | Value *Src = CI.getOperand(0); |
| 2000 | |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 2001 | // If the user is casting a value to the same type, eliminate this cast |
| 2002 | // instruction... |
Chris Lattner | 79d35b3 | 2003-06-23 21:59:52 +0000 | [diff] [blame] | 2003 | if (CI.getType() == Src->getType()) |
| 2004 | return ReplaceInstUsesWith(CI, Src); |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 2005 | |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 2006 | // If casting the result of another cast instruction, try to eliminate this |
| 2007 | // one! |
| 2008 | // |
Chris Lattner | 79d35b3 | 2003-06-23 21:59:52 +0000 | [diff] [blame] | 2009 | if (CastInst *CSrc = dyn_cast<CastInst>(Src)) { |
Chris Lattner | 24c8e38 | 2003-07-24 17:35:25 +0000 | [diff] [blame] | 2010 | if (isEliminableCastOfCast(CSrc->getOperand(0)->getType(), |
| 2011 | CSrc->getType(), CI.getType())) { |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 2012 | // This instruction now refers directly to the cast's src operand. This |
| 2013 | // has a good chance of making CSrc dead. |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 2014 | CI.setOperand(0, CSrc->getOperand(0)); |
| 2015 | return &CI; |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 2016 | } |
| 2017 | |
Chris Lattner | 8fd217c | 2002-08-02 20:00:25 +0000 | [diff] [blame] | 2018 | // If this is an A->B->A cast, and we are dealing with integral types, try |
| 2019 | // to convert this into a logical 'and' instruction. |
| 2020 | // |
| 2021 | if (CSrc->getOperand(0)->getType() == CI.getType() && |
Chris Lattner | 0c4e886 | 2002-09-03 01:08:28 +0000 | [diff] [blame] | 2022 | CI.getType()->isInteger() && CSrc->getType()->isInteger() && |
Chris Lattner | 8fd217c | 2002-08-02 20:00:25 +0000 | [diff] [blame] | 2023 | CI.getType()->isUnsigned() && CSrc->getType()->isUnsigned() && |
| 2024 | CSrc->getType()->getPrimitiveSize() < CI.getType()->getPrimitiveSize()){ |
| 2025 | assert(CSrc->getType() != Type::ULongTy && |
| 2026 | "Cannot have type bigger than ulong!"); |
Chris Lattner | bd4ecf7 | 2003-05-26 23:41:32 +0000 | [diff] [blame] | 2027 | uint64_t AndValue = (1ULL << CSrc->getType()->getPrimitiveSize()*8)-1; |
Chris Lattner | 8fd217c | 2002-08-02 20:00:25 +0000 | [diff] [blame] | 2028 | Constant *AndOp = ConstantUInt::get(CI.getType(), AndValue); |
| 2029 | return BinaryOperator::create(Instruction::And, CSrc->getOperand(0), |
| 2030 | AndOp); |
| 2031 | } |
| 2032 | } |
| 2033 | |
Chris Lattner | a710ddc | 2004-05-25 04:29:21 +0000 | [diff] [blame] | 2034 | // If this is a cast to bool, turn it into the appropriate setne instruction. |
| 2035 | if (CI.getType() == Type::BoolTy) |
| 2036 | return BinaryOperator::create(Instruction::SetNE, CI.getOperand(0), |
| 2037 | Constant::getNullValue(CI.getOperand(0)->getType())); |
| 2038 | |
Chris Lattner | 797249b | 2003-06-21 23:12:02 +0000 | [diff] [blame] | 2039 | // If casting the result of a getelementptr instruction with no offset, turn |
| 2040 | // this into a cast of the original pointer! |
| 2041 | // |
Chris Lattner | 79d35b3 | 2003-06-23 21:59:52 +0000 | [diff] [blame] | 2042 | if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Src)) { |
Chris Lattner | 797249b | 2003-06-21 23:12:02 +0000 | [diff] [blame] | 2043 | bool AllZeroOperands = true; |
| 2044 | for (unsigned i = 1, e = GEP->getNumOperands(); i != e; ++i) |
| 2045 | if (!isa<Constant>(GEP->getOperand(i)) || |
| 2046 | !cast<Constant>(GEP->getOperand(i))->isNullValue()) { |
| 2047 | AllZeroOperands = false; |
| 2048 | break; |
| 2049 | } |
| 2050 | if (AllZeroOperands) { |
| 2051 | CI.setOperand(0, GEP->getOperand(0)); |
| 2052 | return &CI; |
| 2053 | } |
| 2054 | } |
| 2055 | |
Chris Lattner | bc61e66 | 2003-11-02 05:57:39 +0000 | [diff] [blame] | 2056 | // If we are casting a malloc or alloca to a pointer to a type of the same |
| 2057 | // size, rewrite the allocation instruction to allocate the "right" type. |
| 2058 | // |
| 2059 | if (AllocationInst *AI = dyn_cast<AllocationInst>(Src)) |
Chris Lattner | fc07a34 | 2003-11-02 06:54:48 +0000 | [diff] [blame] | 2060 | if (AI->hasOneUse() && !AI->isArrayAllocation()) |
Chris Lattner | bc61e66 | 2003-11-02 05:57:39 +0000 | [diff] [blame] | 2061 | if (const PointerType *PTy = dyn_cast<PointerType>(CI.getType())) { |
| 2062 | // Get the type really allocated and the type casted to... |
| 2063 | const Type *AllocElTy = AI->getAllocatedType(); |
| 2064 | unsigned AllocElTySize = TD->getTypeSize(AllocElTy); |
| 2065 | const Type *CastElTy = PTy->getElementType(); |
| 2066 | unsigned CastElTySize = TD->getTypeSize(CastElTy); |
Chris Lattner | 1bcc70d | 2003-11-05 17:31:36 +0000 | [diff] [blame] | 2067 | |
Chris Lattner | bc61e66 | 2003-11-02 05:57:39 +0000 | [diff] [blame] | 2068 | // If the allocation is for an even multiple of the cast type size |
Chris Lattner | 8ee9204 | 2003-11-03 01:29:41 +0000 | [diff] [blame] | 2069 | if (CastElTySize && (AllocElTySize % CastElTySize == 0)) { |
Chris Lattner | bc61e66 | 2003-11-02 05:57:39 +0000 | [diff] [blame] | 2070 | Value *Amt = ConstantUInt::get(Type::UIntTy, |
| 2071 | AllocElTySize/CastElTySize); |
| 2072 | std::string Name = AI->getName(); AI->setName(""); |
| 2073 | AllocationInst *New; |
| 2074 | if (isa<MallocInst>(AI)) |
| 2075 | New = new MallocInst(CastElTy, Amt, Name); |
| 2076 | else |
| 2077 | New = new AllocaInst(CastElTy, Amt, Name); |
Chris Lattner | c1526a9 | 2004-04-30 04:37:52 +0000 | [diff] [blame] | 2078 | InsertNewInstBefore(New, *AI); |
Chris Lattner | bc61e66 | 2003-11-02 05:57:39 +0000 | [diff] [blame] | 2079 | return ReplaceInstUsesWith(CI, New); |
| 2080 | } |
| 2081 | } |
| 2082 | |
Chris Lattner | 24c8e38 | 2003-07-24 17:35:25 +0000 | [diff] [blame] | 2083 | // If the source value is an instruction with only this use, we can attempt to |
| 2084 | // propagate the cast into the instruction. Also, only handle integral types |
| 2085 | // for now. |
| 2086 | if (Instruction *SrcI = dyn_cast<Instruction>(Src)) |
Chris Lattner | fd05924 | 2003-10-15 16:48:29 +0000 | [diff] [blame] | 2087 | if (SrcI->hasOneUse() && Src->getType()->isIntegral() && |
Chris Lattner | 24c8e38 | 2003-07-24 17:35:25 +0000 | [diff] [blame] | 2088 | CI.getType()->isInteger()) { // Don't mess with casts to bool here |
| 2089 | const Type *DestTy = CI.getType(); |
| 2090 | unsigned SrcBitSize = getTypeSizeInBits(Src->getType()); |
| 2091 | unsigned DestBitSize = getTypeSizeInBits(DestTy); |
| 2092 | |
| 2093 | Value *Op0 = SrcI->getNumOperands() > 0 ? SrcI->getOperand(0) : 0; |
| 2094 | Value *Op1 = SrcI->getNumOperands() > 1 ? SrcI->getOperand(1) : 0; |
| 2095 | |
| 2096 | switch (SrcI->getOpcode()) { |
| 2097 | case Instruction::Add: |
| 2098 | case Instruction::Mul: |
| 2099 | case Instruction::And: |
| 2100 | case Instruction::Or: |
| 2101 | case Instruction::Xor: |
| 2102 | // If we are discarding information, or just changing the sign, rewrite. |
| 2103 | if (DestBitSize <= SrcBitSize && DestBitSize != 1) { |
| 2104 | // Don't insert two casts if they cannot be eliminated. We allow two |
| 2105 | // casts to be inserted if the sizes are the same. This could only be |
| 2106 | // converting signedness, which is a noop. |
| 2107 | if (DestBitSize == SrcBitSize || !ValueRequiresCast(Op1, DestTy) || |
| 2108 | !ValueRequiresCast(Op0, DestTy)) { |
| 2109 | Value *Op0c = InsertOperandCastBefore(Op0, DestTy, SrcI); |
| 2110 | Value *Op1c = InsertOperandCastBefore(Op1, DestTy, SrcI); |
| 2111 | return BinaryOperator::create(cast<BinaryOperator>(SrcI) |
| 2112 | ->getOpcode(), Op0c, Op1c); |
| 2113 | } |
| 2114 | } |
| 2115 | break; |
| 2116 | case Instruction::Shl: |
| 2117 | // Allow changing the sign of the source operand. Do not allow changing |
| 2118 | // the size of the shift, UNLESS the shift amount is a constant. We |
| 2119 | // mush not change variable sized shifts to a smaller size, because it |
| 2120 | // is undefined to shift more bits out than exist in the value. |
| 2121 | if (DestBitSize == SrcBitSize || |
| 2122 | (DestBitSize < SrcBitSize && isa<Constant>(Op1))) { |
| 2123 | Value *Op0c = InsertOperandCastBefore(Op0, DestTy, SrcI); |
| 2124 | return new ShiftInst(Instruction::Shl, Op0c, Op1); |
| 2125 | } |
| 2126 | break; |
| 2127 | } |
| 2128 | } |
| 2129 | |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 2130 | return 0; |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 2131 | } |
| 2132 | |
Chris Lattner | e576b91 | 2004-04-09 23:46:01 +0000 | [diff] [blame] | 2133 | /// GetSelectFoldableOperands - We want to turn code that looks like this: |
| 2134 | /// %C = or %A, %B |
| 2135 | /// %D = select %cond, %C, %A |
| 2136 | /// into: |
| 2137 | /// %C = select %cond, %B, 0 |
| 2138 | /// %D = or %A, %C |
| 2139 | /// |
| 2140 | /// Assuming that the specified instruction is an operand to the select, return |
| 2141 | /// a bitmask indicating which operands of this instruction are foldable if they |
| 2142 | /// equal the other incoming value of the select. |
| 2143 | /// |
| 2144 | static unsigned GetSelectFoldableOperands(Instruction *I) { |
| 2145 | switch (I->getOpcode()) { |
| 2146 | case Instruction::Add: |
| 2147 | case Instruction::Mul: |
| 2148 | case Instruction::And: |
| 2149 | case Instruction::Or: |
| 2150 | case Instruction::Xor: |
| 2151 | return 3; // Can fold through either operand. |
| 2152 | case Instruction::Sub: // Can only fold on the amount subtracted. |
| 2153 | case Instruction::Shl: // Can only fold on the shift amount. |
| 2154 | case Instruction::Shr: |
| 2155 | return 1; |
| 2156 | default: |
| 2157 | return 0; // Cannot fold |
| 2158 | } |
| 2159 | } |
| 2160 | |
| 2161 | /// GetSelectFoldableConstant - For the same transformation as the previous |
| 2162 | /// function, return the identity constant that goes into the select. |
| 2163 | static Constant *GetSelectFoldableConstant(Instruction *I) { |
| 2164 | switch (I->getOpcode()) { |
| 2165 | default: assert(0 && "This cannot happen!"); abort(); |
| 2166 | case Instruction::Add: |
| 2167 | case Instruction::Sub: |
| 2168 | case Instruction::Or: |
| 2169 | case Instruction::Xor: |
| 2170 | return Constant::getNullValue(I->getType()); |
| 2171 | case Instruction::Shl: |
| 2172 | case Instruction::Shr: |
| 2173 | return Constant::getNullValue(Type::UByteTy); |
| 2174 | case Instruction::And: |
| 2175 | return ConstantInt::getAllOnesValue(I->getType()); |
| 2176 | case Instruction::Mul: |
| 2177 | return ConstantInt::get(I->getType(), 1); |
| 2178 | } |
| 2179 | } |
| 2180 | |
Chris Lattner | 3d69f46 | 2004-03-12 05:52:32 +0000 | [diff] [blame] | 2181 | Instruction *InstCombiner::visitSelectInst(SelectInst &SI) { |
Chris Lattner | c32b30a | 2004-03-30 19:37:13 +0000 | [diff] [blame] | 2182 | Value *CondVal = SI.getCondition(); |
| 2183 | Value *TrueVal = SI.getTrueValue(); |
| 2184 | Value *FalseVal = SI.getFalseValue(); |
| 2185 | |
| 2186 | // select true, X, Y -> X |
| 2187 | // select false, X, Y -> Y |
| 2188 | if (ConstantBool *C = dyn_cast<ConstantBool>(CondVal)) |
Chris Lattner | 3d69f46 | 2004-03-12 05:52:32 +0000 | [diff] [blame] | 2189 | if (C == ConstantBool::True) |
Chris Lattner | c32b30a | 2004-03-30 19:37:13 +0000 | [diff] [blame] | 2190 | return ReplaceInstUsesWith(SI, TrueVal); |
Chris Lattner | 3d69f46 | 2004-03-12 05:52:32 +0000 | [diff] [blame] | 2191 | else { |
| 2192 | assert(C == ConstantBool::False); |
Chris Lattner | c32b30a | 2004-03-30 19:37:13 +0000 | [diff] [blame] | 2193 | return ReplaceInstUsesWith(SI, FalseVal); |
Chris Lattner | 3d69f46 | 2004-03-12 05:52:32 +0000 | [diff] [blame] | 2194 | } |
Chris Lattner | c32b30a | 2004-03-30 19:37:13 +0000 | [diff] [blame] | 2195 | |
| 2196 | // select C, X, X -> X |
| 2197 | if (TrueVal == FalseVal) |
| 2198 | return ReplaceInstUsesWith(SI, TrueVal); |
| 2199 | |
Chris Lattner | 0c199a7 | 2004-04-08 04:43:23 +0000 | [diff] [blame] | 2200 | if (SI.getType() == Type::BoolTy) |
| 2201 | if (ConstantBool *C = dyn_cast<ConstantBool>(TrueVal)) { |
| 2202 | if (C == ConstantBool::True) { |
| 2203 | // Change: A = select B, true, C --> A = or B, C |
| 2204 | return BinaryOperator::create(Instruction::Or, CondVal, FalseVal); |
| 2205 | } else { |
| 2206 | // Change: A = select B, false, C --> A = and !B, C |
| 2207 | Value *NotCond = |
| 2208 | InsertNewInstBefore(BinaryOperator::createNot(CondVal, |
| 2209 | "not."+CondVal->getName()), SI); |
| 2210 | return BinaryOperator::create(Instruction::And, NotCond, FalseVal); |
| 2211 | } |
| 2212 | } else if (ConstantBool *C = dyn_cast<ConstantBool>(FalseVal)) { |
| 2213 | if (C == ConstantBool::False) { |
| 2214 | // Change: A = select B, C, false --> A = and B, C |
| 2215 | return BinaryOperator::create(Instruction::And, CondVal, TrueVal); |
| 2216 | } else { |
| 2217 | // Change: A = select B, C, true --> A = or !B, C |
| 2218 | Value *NotCond = |
| 2219 | InsertNewInstBefore(BinaryOperator::createNot(CondVal, |
| 2220 | "not."+CondVal->getName()), SI); |
| 2221 | return BinaryOperator::create(Instruction::Or, NotCond, TrueVal); |
| 2222 | } |
| 2223 | } |
| 2224 | |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 2225 | // Selecting between two integer constants? |
| 2226 | if (ConstantInt *TrueValC = dyn_cast<ConstantInt>(TrueVal)) |
| 2227 | if (ConstantInt *FalseValC = dyn_cast<ConstantInt>(FalseVal)) { |
| 2228 | // select C, 1, 0 -> cast C to int |
| 2229 | if (FalseValC->isNullValue() && TrueValC->getRawValue() == 1) { |
| 2230 | return new CastInst(CondVal, SI.getType()); |
| 2231 | } else if (TrueValC->isNullValue() && FalseValC->getRawValue() == 1) { |
| 2232 | // select C, 0, 1 -> cast !C to int |
| 2233 | Value *NotCond = |
| 2234 | InsertNewInstBefore(BinaryOperator::createNot(CondVal, |
Chris Lattner | 82e14fe | 2004-04-09 18:19:44 +0000 | [diff] [blame] | 2235 | "not."+CondVal->getName()), SI); |
Chris Lattner | 2eefe51 | 2004-04-09 19:05:30 +0000 | [diff] [blame] | 2236 | return new CastInst(NotCond, SI.getType()); |
Chris Lattner | 82e14fe | 2004-04-09 18:19:44 +0000 | [diff] [blame] | 2237 | } |
Chris Lattner | c32b30a | 2004-03-30 19:37:13 +0000 | [diff] [blame] | 2238 | } |
Chris Lattner | d76956d | 2004-04-10 22:21:27 +0000 | [diff] [blame] | 2239 | |
| 2240 | // See if we are selecting two values based on a comparison of the two values. |
| 2241 | if (SetCondInst *SCI = dyn_cast<SetCondInst>(CondVal)) { |
| 2242 | if (SCI->getOperand(0) == TrueVal && SCI->getOperand(1) == FalseVal) { |
| 2243 | // Transform (X == Y) ? X : Y -> Y |
| 2244 | if (SCI->getOpcode() == Instruction::SetEQ) |
| 2245 | return ReplaceInstUsesWith(SI, FalseVal); |
| 2246 | // Transform (X != Y) ? X : Y -> X |
| 2247 | if (SCI->getOpcode() == Instruction::SetNE) |
| 2248 | return ReplaceInstUsesWith(SI, TrueVal); |
| 2249 | // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc. |
| 2250 | |
| 2251 | } else if (SCI->getOperand(0) == FalseVal && SCI->getOperand(1) == TrueVal){ |
| 2252 | // Transform (X == Y) ? Y : X -> X |
| 2253 | if (SCI->getOpcode() == Instruction::SetEQ) |
Chris Lattner | fbede52 | 2004-04-11 01:39:19 +0000 | [diff] [blame] | 2254 | return ReplaceInstUsesWith(SI, FalseVal); |
Chris Lattner | d76956d | 2004-04-10 22:21:27 +0000 | [diff] [blame] | 2255 | // Transform (X != Y) ? Y : X -> Y |
| 2256 | if (SCI->getOpcode() == Instruction::SetNE) |
Chris Lattner | fbede52 | 2004-04-11 01:39:19 +0000 | [diff] [blame] | 2257 | return ReplaceInstUsesWith(SI, TrueVal); |
Chris Lattner | d76956d | 2004-04-10 22:21:27 +0000 | [diff] [blame] | 2258 | // NOTE: if we wanted to, this is where to detect MIN/MAX/ABS/etc. |
| 2259 | } |
| 2260 | } |
Chris Lattner | 0c199a7 | 2004-04-08 04:43:23 +0000 | [diff] [blame] | 2261 | |
Chris Lattner | e576b91 | 2004-04-09 23:46:01 +0000 | [diff] [blame] | 2262 | // See if we can fold the select into one of our operands. |
| 2263 | if (SI.getType()->isInteger()) { |
| 2264 | // See the comment above GetSelectFoldableOperands for a description of the |
| 2265 | // transformation we are doing here. |
| 2266 | if (Instruction *TVI = dyn_cast<Instruction>(TrueVal)) |
| 2267 | if (TVI->hasOneUse() && TVI->getNumOperands() == 2 && |
| 2268 | !isa<Constant>(FalseVal)) |
| 2269 | if (unsigned SFO = GetSelectFoldableOperands(TVI)) { |
| 2270 | unsigned OpToFold = 0; |
| 2271 | if ((SFO & 1) && FalseVal == TVI->getOperand(0)) { |
| 2272 | OpToFold = 1; |
| 2273 | } else if ((SFO & 2) && FalseVal == TVI->getOperand(1)) { |
| 2274 | OpToFold = 2; |
| 2275 | } |
| 2276 | |
| 2277 | if (OpToFold) { |
| 2278 | Constant *C = GetSelectFoldableConstant(TVI); |
| 2279 | std::string Name = TVI->getName(); TVI->setName(""); |
| 2280 | Instruction *NewSel = |
| 2281 | new SelectInst(SI.getCondition(), TVI->getOperand(2-OpToFold), C, |
| 2282 | Name); |
| 2283 | InsertNewInstBefore(NewSel, SI); |
| 2284 | if (BinaryOperator *BO = dyn_cast<BinaryOperator>(TVI)) |
| 2285 | return BinaryOperator::create(BO->getOpcode(), FalseVal, NewSel); |
| 2286 | else if (ShiftInst *SI = dyn_cast<ShiftInst>(TVI)) |
| 2287 | return new ShiftInst(SI->getOpcode(), FalseVal, NewSel); |
| 2288 | else { |
| 2289 | assert(0 && "Unknown instruction!!"); |
| 2290 | } |
| 2291 | } |
| 2292 | } |
| 2293 | |
| 2294 | if (Instruction *FVI = dyn_cast<Instruction>(FalseVal)) |
| 2295 | if (FVI->hasOneUse() && FVI->getNumOperands() == 2 && |
| 2296 | !isa<Constant>(TrueVal)) |
| 2297 | if (unsigned SFO = GetSelectFoldableOperands(FVI)) { |
| 2298 | unsigned OpToFold = 0; |
| 2299 | if ((SFO & 1) && TrueVal == FVI->getOperand(0)) { |
| 2300 | OpToFold = 1; |
| 2301 | } else if ((SFO & 2) && TrueVal == FVI->getOperand(1)) { |
| 2302 | OpToFold = 2; |
| 2303 | } |
| 2304 | |
| 2305 | if (OpToFold) { |
| 2306 | Constant *C = GetSelectFoldableConstant(FVI); |
| 2307 | std::string Name = FVI->getName(); FVI->setName(""); |
| 2308 | Instruction *NewSel = |
| 2309 | new SelectInst(SI.getCondition(), C, FVI->getOperand(2-OpToFold), |
| 2310 | Name); |
| 2311 | InsertNewInstBefore(NewSel, SI); |
| 2312 | if (BinaryOperator *BO = dyn_cast<BinaryOperator>(FVI)) |
| 2313 | return BinaryOperator::create(BO->getOpcode(), TrueVal, NewSel); |
| 2314 | else if (ShiftInst *SI = dyn_cast<ShiftInst>(FVI)) |
| 2315 | return new ShiftInst(SI->getOpcode(), TrueVal, NewSel); |
| 2316 | else { |
| 2317 | assert(0 && "Unknown instruction!!"); |
| 2318 | } |
| 2319 | } |
| 2320 | } |
| 2321 | } |
Chris Lattner | 3d69f46 | 2004-03-12 05:52:32 +0000 | [diff] [blame] | 2322 | return 0; |
| 2323 | } |
| 2324 | |
| 2325 | |
Chris Lattner | 9fe3886 | 2003-06-19 17:00:31 +0000 | [diff] [blame] | 2326 | // CallInst simplification |
| 2327 | // |
| 2328 | Instruction *InstCombiner::visitCallInst(CallInst &CI) { |
Chris Lattner | 7bcc0e7 | 2004-02-28 05:22:00 +0000 | [diff] [blame] | 2329 | // Intrinsics cannot occur in an invoke, so handle them here instead of in |
| 2330 | // visitCallSite. |
| 2331 | if (Function *F = CI.getCalledFunction()) |
| 2332 | switch (F->getIntrinsicID()) { |
| 2333 | case Intrinsic::memmove: |
| 2334 | case Intrinsic::memcpy: |
| 2335 | case Intrinsic::memset: |
| 2336 | // memmove/cpy/set of zero bytes is a noop. |
| 2337 | if (Constant *NumBytes = dyn_cast<Constant>(CI.getOperand(3))) { |
| 2338 | if (NumBytes->isNullValue()) |
| 2339 | return EraseInstFromFunction(CI); |
| 2340 | } |
| 2341 | break; |
| 2342 | default: |
| 2343 | break; |
| 2344 | } |
| 2345 | |
Chris Lattner | a44d8a2 | 2003-10-07 22:32:43 +0000 | [diff] [blame] | 2346 | return visitCallSite(&CI); |
Chris Lattner | 9fe3886 | 2003-06-19 17:00:31 +0000 | [diff] [blame] | 2347 | } |
| 2348 | |
| 2349 | // InvokeInst simplification |
| 2350 | // |
| 2351 | Instruction *InstCombiner::visitInvokeInst(InvokeInst &II) { |
Chris Lattner | a44d8a2 | 2003-10-07 22:32:43 +0000 | [diff] [blame] | 2352 | return visitCallSite(&II); |
Chris Lattner | 9fe3886 | 2003-06-19 17:00:31 +0000 | [diff] [blame] | 2353 | } |
| 2354 | |
Chris Lattner | a44d8a2 | 2003-10-07 22:32:43 +0000 | [diff] [blame] | 2355 | // visitCallSite - Improvements for call and invoke instructions. |
| 2356 | // |
| 2357 | Instruction *InstCombiner::visitCallSite(CallSite CS) { |
Chris Lattner | 6c266db | 2003-10-07 22:54:13 +0000 | [diff] [blame] | 2358 | bool Changed = false; |
| 2359 | |
| 2360 | // If the callee is a constexpr cast of a function, attempt to move the cast |
| 2361 | // to the arguments of the call/invoke. |
Chris Lattner | a44d8a2 | 2003-10-07 22:32:43 +0000 | [diff] [blame] | 2362 | if (transformConstExprCastCall(CS)) return 0; |
| 2363 | |
Chris Lattner | 6c266db | 2003-10-07 22:54:13 +0000 | [diff] [blame] | 2364 | Value *Callee = CS.getCalledValue(); |
| 2365 | const PointerType *PTy = cast<PointerType>(Callee->getType()); |
| 2366 | const FunctionType *FTy = cast<FunctionType>(PTy->getElementType()); |
| 2367 | if (FTy->isVarArg()) { |
| 2368 | // See if we can optimize any arguments passed through the varargs area of |
| 2369 | // the call. |
| 2370 | for (CallSite::arg_iterator I = CS.arg_begin()+FTy->getNumParams(), |
| 2371 | E = CS.arg_end(); I != E; ++I) |
| 2372 | if (CastInst *CI = dyn_cast<CastInst>(*I)) { |
| 2373 | // If this cast does not effect the value passed through the varargs |
| 2374 | // area, we can eliminate the use of the cast. |
| 2375 | Value *Op = CI->getOperand(0); |
| 2376 | if (CI->getType()->isLosslesslyConvertibleTo(Op->getType())) { |
| 2377 | *I = Op; |
| 2378 | Changed = true; |
| 2379 | } |
| 2380 | } |
| 2381 | } |
Chris Lattner | a44d8a2 | 2003-10-07 22:32:43 +0000 | [diff] [blame] | 2382 | |
Chris Lattner | 6c266db | 2003-10-07 22:54:13 +0000 | [diff] [blame] | 2383 | return Changed ? CS.getInstruction() : 0; |
Chris Lattner | a44d8a2 | 2003-10-07 22:32:43 +0000 | [diff] [blame] | 2384 | } |
| 2385 | |
Chris Lattner | 9fe3886 | 2003-06-19 17:00:31 +0000 | [diff] [blame] | 2386 | // transformConstExprCastCall - If the callee is a constexpr cast of a function, |
| 2387 | // attempt to move the cast to the arguments of the call/invoke. |
| 2388 | // |
| 2389 | bool InstCombiner::transformConstExprCastCall(CallSite CS) { |
| 2390 | if (!isa<ConstantExpr>(CS.getCalledValue())) return false; |
| 2391 | ConstantExpr *CE = cast<ConstantExpr>(CS.getCalledValue()); |
| 2392 | if (CE->getOpcode() != Instruction::Cast || |
| 2393 | !isa<ConstantPointerRef>(CE->getOperand(0))) |
| 2394 | return false; |
| 2395 | ConstantPointerRef *CPR = cast<ConstantPointerRef>(CE->getOperand(0)); |
| 2396 | if (!isa<Function>(CPR->getValue())) return false; |
| 2397 | Function *Callee = cast<Function>(CPR->getValue()); |
| 2398 | Instruction *Caller = CS.getInstruction(); |
| 2399 | |
| 2400 | // Okay, this is a cast from a function to a different type. Unless doing so |
| 2401 | // would cause a type conversion of one of our arguments, change this call to |
| 2402 | // be a direct call with arguments casted to the appropriate types. |
| 2403 | // |
| 2404 | const FunctionType *FT = Callee->getFunctionType(); |
| 2405 | const Type *OldRetTy = Caller->getType(); |
| 2406 | |
Chris Lattner | f78616b | 2004-01-14 06:06:08 +0000 | [diff] [blame] | 2407 | // Check to see if we are changing the return type... |
| 2408 | if (OldRetTy != FT->getReturnType()) { |
| 2409 | if (Callee->isExternal() && |
| 2410 | !OldRetTy->isLosslesslyConvertibleTo(FT->getReturnType()) && |
| 2411 | !Caller->use_empty()) |
| 2412 | return false; // Cannot transform this return value... |
| 2413 | |
| 2414 | // If the callsite is an invoke instruction, and the return value is used by |
| 2415 | // a PHI node in a successor, we cannot change the return type of the call |
| 2416 | // because there is no place to put the cast instruction (without breaking |
| 2417 | // the critical edge). Bail out in this case. |
| 2418 | if (!Caller->use_empty()) |
| 2419 | if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) |
| 2420 | for (Value::use_iterator UI = II->use_begin(), E = II->use_end(); |
| 2421 | UI != E; ++UI) |
| 2422 | if (PHINode *PN = dyn_cast<PHINode>(*UI)) |
| 2423 | if (PN->getParent() == II->getNormalDest() || |
Chris Lattner | aeb2a1d | 2004-02-08 21:44:31 +0000 | [diff] [blame] | 2424 | PN->getParent() == II->getUnwindDest()) |
Chris Lattner | f78616b | 2004-01-14 06:06:08 +0000 | [diff] [blame] | 2425 | return false; |
| 2426 | } |
Chris Lattner | 9fe3886 | 2003-06-19 17:00:31 +0000 | [diff] [blame] | 2427 | |
| 2428 | unsigned NumActualArgs = unsigned(CS.arg_end()-CS.arg_begin()); |
| 2429 | unsigned NumCommonArgs = std::min(FT->getNumParams(), NumActualArgs); |
| 2430 | |
| 2431 | CallSite::arg_iterator AI = CS.arg_begin(); |
| 2432 | for (unsigned i = 0, e = NumCommonArgs; i != e; ++i, ++AI) { |
| 2433 | const Type *ParamTy = FT->getParamType(i); |
| 2434 | bool isConvertible = (*AI)->getType()->isLosslesslyConvertibleTo(ParamTy); |
| 2435 | if (Callee->isExternal() && !isConvertible) return false; |
| 2436 | } |
| 2437 | |
| 2438 | if (FT->getNumParams() < NumActualArgs && !FT->isVarArg() && |
| 2439 | Callee->isExternal()) |
| 2440 | return false; // Do not delete arguments unless we have a function body... |
| 2441 | |
| 2442 | // Okay, we decided that this is a safe thing to do: go ahead and start |
| 2443 | // inserting cast instructions as necessary... |
| 2444 | std::vector<Value*> Args; |
| 2445 | Args.reserve(NumActualArgs); |
| 2446 | |
| 2447 | AI = CS.arg_begin(); |
| 2448 | for (unsigned i = 0; i != NumCommonArgs; ++i, ++AI) { |
| 2449 | const Type *ParamTy = FT->getParamType(i); |
| 2450 | if ((*AI)->getType() == ParamTy) { |
| 2451 | Args.push_back(*AI); |
| 2452 | } else { |
Chris Lattner | 0c199a7 | 2004-04-08 04:43:23 +0000 | [diff] [blame] | 2453 | Args.push_back(InsertNewInstBefore(new CastInst(*AI, ParamTy, "tmp"), |
| 2454 | *Caller)); |
Chris Lattner | 9fe3886 | 2003-06-19 17:00:31 +0000 | [diff] [blame] | 2455 | } |
| 2456 | } |
| 2457 | |
| 2458 | // If the function takes more arguments than the call was taking, add them |
| 2459 | // now... |
| 2460 | for (unsigned i = NumCommonArgs; i != FT->getNumParams(); ++i) |
| 2461 | Args.push_back(Constant::getNullValue(FT->getParamType(i))); |
| 2462 | |
| 2463 | // If we are removing arguments to the function, emit an obnoxious warning... |
| 2464 | if (FT->getNumParams() < NumActualArgs) |
| 2465 | if (!FT->isVarArg()) { |
| 2466 | std::cerr << "WARNING: While resolving call to function '" |
| 2467 | << Callee->getName() << "' arguments were dropped!\n"; |
| 2468 | } else { |
| 2469 | // Add all of the arguments in their promoted form to the arg list... |
| 2470 | for (unsigned i = FT->getNumParams(); i != NumActualArgs; ++i, ++AI) { |
| 2471 | const Type *PTy = getPromotedType((*AI)->getType()); |
| 2472 | if (PTy != (*AI)->getType()) { |
| 2473 | // Must promote to pass through va_arg area! |
| 2474 | Instruction *Cast = new CastInst(*AI, PTy, "tmp"); |
| 2475 | InsertNewInstBefore(Cast, *Caller); |
| 2476 | Args.push_back(Cast); |
| 2477 | } else { |
| 2478 | Args.push_back(*AI); |
| 2479 | } |
| 2480 | } |
| 2481 | } |
| 2482 | |
| 2483 | if (FT->getReturnType() == Type::VoidTy) |
| 2484 | Caller->setName(""); // Void type should not have a name... |
| 2485 | |
| 2486 | Instruction *NC; |
| 2487 | if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) { |
Chris Lattner | aeb2a1d | 2004-02-08 21:44:31 +0000 | [diff] [blame] | 2488 | NC = new InvokeInst(Callee, II->getNormalDest(), II->getUnwindDest(), |
Chris Lattner | 9fe3886 | 2003-06-19 17:00:31 +0000 | [diff] [blame] | 2489 | Args, Caller->getName(), Caller); |
| 2490 | } else { |
| 2491 | NC = new CallInst(Callee, Args, Caller->getName(), Caller); |
| 2492 | } |
| 2493 | |
| 2494 | // Insert a cast of the return type as necessary... |
| 2495 | Value *NV = NC; |
| 2496 | if (Caller->getType() != NV->getType() && !Caller->use_empty()) { |
| 2497 | if (NV->getType() != Type::VoidTy) { |
| 2498 | NV = NC = new CastInst(NC, Caller->getType(), "tmp"); |
Chris Lattner | bb60904 | 2003-10-30 00:46:41 +0000 | [diff] [blame] | 2499 | |
| 2500 | // If this is an invoke instruction, we should insert it after the first |
| 2501 | // non-phi, instruction in the normal successor block. |
| 2502 | if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) { |
| 2503 | BasicBlock::iterator I = II->getNormalDest()->begin(); |
| 2504 | while (isa<PHINode>(I)) ++I; |
| 2505 | InsertNewInstBefore(NC, *I); |
| 2506 | } else { |
| 2507 | // Otherwise, it's a call, just insert cast right after the call instr |
| 2508 | InsertNewInstBefore(NC, *Caller); |
| 2509 | } |
Chris Lattner | 7bcc0e7 | 2004-02-28 05:22:00 +0000 | [diff] [blame] | 2510 | AddUsersToWorkList(*Caller); |
Chris Lattner | 9fe3886 | 2003-06-19 17:00:31 +0000 | [diff] [blame] | 2511 | } else { |
| 2512 | NV = Constant::getNullValue(Caller->getType()); |
| 2513 | } |
| 2514 | } |
| 2515 | |
| 2516 | if (Caller->getType() != Type::VoidTy && !Caller->use_empty()) |
| 2517 | Caller->replaceAllUsesWith(NV); |
| 2518 | Caller->getParent()->getInstList().erase(Caller); |
| 2519 | removeFromWorkList(Caller); |
| 2520 | return true; |
| 2521 | } |
| 2522 | |
| 2523 | |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 2524 | |
Chris Lattner | 473945d | 2002-05-06 18:06:38 +0000 | [diff] [blame] | 2525 | // PHINode simplification |
| 2526 | // |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 2527 | Instruction *InstCombiner::visitPHINode(PHINode &PN) { |
Chris Lattner | 60921c9 | 2003-12-19 05:58:40 +0000 | [diff] [blame] | 2528 | if (Value *V = hasConstantValue(&PN)) |
| 2529 | return ReplaceInstUsesWith(PN, V); |
Chris Lattner | 7059f2e | 2004-02-16 05:07:08 +0000 | [diff] [blame] | 2530 | |
| 2531 | // If the only user of this instruction is a cast instruction, and all of the |
| 2532 | // incoming values are constants, change this PHI to merge together the casted |
| 2533 | // constants. |
| 2534 | if (PN.hasOneUse()) |
| 2535 | if (CastInst *CI = dyn_cast<CastInst>(PN.use_back())) |
| 2536 | if (CI->getType() != PN.getType()) { // noop casts will be folded |
| 2537 | bool AllConstant = true; |
| 2538 | for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) |
| 2539 | if (!isa<Constant>(PN.getIncomingValue(i))) { |
| 2540 | AllConstant = false; |
| 2541 | break; |
| 2542 | } |
| 2543 | if (AllConstant) { |
| 2544 | // Make a new PHI with all casted values. |
| 2545 | PHINode *New = new PHINode(CI->getType(), PN.getName(), &PN); |
| 2546 | for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i) { |
| 2547 | Constant *OldArg = cast<Constant>(PN.getIncomingValue(i)); |
| 2548 | New->addIncoming(ConstantExpr::getCast(OldArg, New->getType()), |
| 2549 | PN.getIncomingBlock(i)); |
| 2550 | } |
| 2551 | |
| 2552 | // Update the cast instruction. |
| 2553 | CI->setOperand(0, New); |
| 2554 | WorkList.push_back(CI); // revisit the cast instruction to fold. |
| 2555 | WorkList.push_back(New); // Make sure to revisit the new Phi |
| 2556 | return &PN; // PN is now dead! |
| 2557 | } |
| 2558 | } |
Chris Lattner | 60921c9 | 2003-12-19 05:58:40 +0000 | [diff] [blame] | 2559 | return 0; |
Chris Lattner | 473945d | 2002-05-06 18:06:38 +0000 | [diff] [blame] | 2560 | } |
| 2561 | |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 2562 | static Value *InsertSignExtendToPtrTy(Value *V, const Type *DTy, |
| 2563 | Instruction *InsertPoint, |
| 2564 | InstCombiner *IC) { |
| 2565 | unsigned PS = IC->getTargetData().getPointerSize(); |
| 2566 | const Type *VTy = V->getType(); |
| 2567 | Instruction *Cast; |
| 2568 | if (!VTy->isSigned() && VTy->getPrimitiveSize() < PS) |
| 2569 | // We must insert a cast to ensure we sign-extend. |
| 2570 | V = IC->InsertNewInstBefore(new CastInst(V, VTy->getSignedVersion(), |
| 2571 | V->getName()), *InsertPoint); |
| 2572 | return IC->InsertNewInstBefore(new CastInst(V, DTy, V->getName()), |
| 2573 | *InsertPoint); |
| 2574 | } |
| 2575 | |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 2576 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 2577 | Instruction *InstCombiner::visitGetElementPtrInst(GetElementPtrInst &GEP) { |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2578 | Value *PtrOp = GEP.getOperand(0); |
Chris Lattner | c54e2b8 | 2003-05-22 19:07:21 +0000 | [diff] [blame] | 2579 | // Is it 'getelementptr %P, long 0' or 'getelementptr %P' |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 2580 | // If so, eliminate the noop. |
Chris Lattner | c6bd195 | 2004-02-22 05:25:17 +0000 | [diff] [blame] | 2581 | if (GEP.getNumOperands() == 1) |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2582 | return ReplaceInstUsesWith(GEP, PtrOp); |
Chris Lattner | c6bd195 | 2004-02-22 05:25:17 +0000 | [diff] [blame] | 2583 | |
| 2584 | bool HasZeroPointerIndex = false; |
| 2585 | if (Constant *C = dyn_cast<Constant>(GEP.getOperand(1))) |
| 2586 | HasZeroPointerIndex = C->isNullValue(); |
| 2587 | |
| 2588 | if (GEP.getNumOperands() == 2 && HasZeroPointerIndex) |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2589 | return ReplaceInstUsesWith(GEP, PtrOp); |
Chris Lattner | a1be566 | 2002-05-02 17:06:02 +0000 | [diff] [blame] | 2590 | |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 2591 | // Eliminate unneeded casts for indices. |
| 2592 | bool MadeChange = false; |
Chris Lattner | cb69a4e | 2004-04-07 18:38:20 +0000 | [diff] [blame] | 2593 | gep_type_iterator GTI = gep_type_begin(GEP); |
| 2594 | for (unsigned i = 1, e = GEP.getNumOperands(); i != e; ++i, ++GTI) |
| 2595 | if (isa<SequentialType>(*GTI)) { |
| 2596 | if (CastInst *CI = dyn_cast<CastInst>(GEP.getOperand(i))) { |
| 2597 | Value *Src = CI->getOperand(0); |
| 2598 | const Type *SrcTy = Src->getType(); |
| 2599 | const Type *DestTy = CI->getType(); |
| 2600 | if (Src->getType()->isInteger()) { |
| 2601 | if (SrcTy->getPrimitiveSize() == DestTy->getPrimitiveSize()) { |
| 2602 | // We can always eliminate a cast from ulong or long to the other. |
| 2603 | // We can always eliminate a cast from uint to int or the other on |
| 2604 | // 32-bit pointer platforms. |
| 2605 | if (DestTy->getPrimitiveSize() >= TD->getPointerSize()) { |
| 2606 | MadeChange = true; |
| 2607 | GEP.setOperand(i, Src); |
| 2608 | } |
| 2609 | } else if (SrcTy->getPrimitiveSize() < DestTy->getPrimitiveSize() && |
| 2610 | SrcTy->getPrimitiveSize() == 4) { |
| 2611 | // We can always eliminate a cast from int to [u]long. We can |
| 2612 | // eliminate a cast from uint to [u]long iff the target is a 32-bit |
| 2613 | // pointer target. |
| 2614 | if (SrcTy->isSigned() || |
| 2615 | SrcTy->getPrimitiveSize() >= TD->getPointerSize()) { |
| 2616 | MadeChange = true; |
| 2617 | GEP.setOperand(i, Src); |
| 2618 | } |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 2619 | } |
| 2620 | } |
| 2621 | } |
Chris Lattner | cb69a4e | 2004-04-07 18:38:20 +0000 | [diff] [blame] | 2622 | // If we are using a wider index than needed for this platform, shrink it |
| 2623 | // to what we need. If the incoming value needs a cast instruction, |
| 2624 | // insert it. This explicit cast can make subsequent optimizations more |
| 2625 | // obvious. |
| 2626 | Value *Op = GEP.getOperand(i); |
| 2627 | if (Op->getType()->getPrimitiveSize() > TD->getPointerSize()) |
Chris Lattner | 4f1134e | 2004-04-17 18:16:10 +0000 | [diff] [blame] | 2628 | if (Constant *C = dyn_cast<Constant>(Op)) { |
| 2629 | GEP.setOperand(i, ConstantExpr::getCast(C, TD->getIntPtrType())); |
| 2630 | MadeChange = true; |
| 2631 | } else { |
Chris Lattner | cb69a4e | 2004-04-07 18:38:20 +0000 | [diff] [blame] | 2632 | Op = InsertNewInstBefore(new CastInst(Op, TD->getIntPtrType(), |
| 2633 | Op->getName()), GEP); |
| 2634 | GEP.setOperand(i, Op); |
| 2635 | MadeChange = true; |
| 2636 | } |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 2637 | } |
| 2638 | if (MadeChange) return &GEP; |
| 2639 | |
Chris Lattner | 90ac28c | 2002-08-02 19:29:35 +0000 | [diff] [blame] | 2640 | // Combine Indices - If the source pointer to this getelementptr instruction |
| 2641 | // is a getelementptr instruction, combine the indices of the two |
| 2642 | // getelementptr instructions into a single instruction. |
| 2643 | // |
Chris Lattner | ebd985c | 2004-03-25 22:59:29 +0000 | [diff] [blame] | 2644 | std::vector<Value*> SrcGEPOperands; |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2645 | if (GetElementPtrInst *Src = dyn_cast<GetElementPtrInst>(PtrOp)) { |
Chris Lattner | ebd985c | 2004-03-25 22:59:29 +0000 | [diff] [blame] | 2646 | SrcGEPOperands.assign(Src->op_begin(), Src->op_end()); |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2647 | } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(PtrOp)) { |
Chris Lattner | ebd985c | 2004-03-25 22:59:29 +0000 | [diff] [blame] | 2648 | if (CE->getOpcode() == Instruction::GetElementPtr) |
| 2649 | SrcGEPOperands.assign(CE->op_begin(), CE->op_end()); |
| 2650 | } |
| 2651 | |
| 2652 | if (!SrcGEPOperands.empty()) { |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2653 | // Note that if our source is a gep chain itself that we wait for that |
| 2654 | // chain to be resolved before we perform this transformation. This |
| 2655 | // avoids us creating a TON of code in some cases. |
| 2656 | // |
| 2657 | if (isa<GetElementPtrInst>(SrcGEPOperands[0]) && |
| 2658 | cast<Instruction>(SrcGEPOperands[0])->getNumOperands() == 2) |
| 2659 | return 0; // Wait until our source is folded to completion. |
| 2660 | |
Chris Lattner | 90ac28c | 2002-08-02 19:29:35 +0000 | [diff] [blame] | 2661 | std::vector<Value *> Indices; |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2662 | |
| 2663 | // Find out whether the last index in the source GEP is a sequential idx. |
| 2664 | bool EndsWithSequential = false; |
| 2665 | for (gep_type_iterator I = gep_type_begin(*cast<User>(PtrOp)), |
| 2666 | E = gep_type_end(*cast<User>(PtrOp)); I != E; ++I) |
Chris Lattner | be97b4e | 2004-05-08 22:41:42 +0000 | [diff] [blame] | 2667 | EndsWithSequential = !isa<StructType>(*I); |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 2668 | |
Chris Lattner | 90ac28c | 2002-08-02 19:29:35 +0000 | [diff] [blame] | 2669 | // Can we combine the two pointer arithmetics offsets? |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2670 | if (EndsWithSequential) { |
Chris Lattner | decd081 | 2003-03-05 22:33:14 +0000 | [diff] [blame] | 2671 | // Replace: gep (gep %P, long B), long A, ... |
| 2672 | // With: T = long A+B; gep %P, T, ... |
| 2673 | // |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2674 | Value *Sum, *SO1 = SrcGEPOperands.back(), *GO1 = GEP.getOperand(1); |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 2675 | if (SO1 == Constant::getNullValue(SO1->getType())) { |
| 2676 | Sum = GO1; |
| 2677 | } else if (GO1 == Constant::getNullValue(GO1->getType())) { |
| 2678 | Sum = SO1; |
| 2679 | } else { |
| 2680 | // If they aren't the same type, convert both to an integer of the |
| 2681 | // target's pointer size. |
| 2682 | if (SO1->getType() != GO1->getType()) { |
| 2683 | if (Constant *SO1C = dyn_cast<Constant>(SO1)) { |
| 2684 | SO1 = ConstantExpr::getCast(SO1C, GO1->getType()); |
| 2685 | } else if (Constant *GO1C = dyn_cast<Constant>(GO1)) { |
| 2686 | GO1 = ConstantExpr::getCast(GO1C, SO1->getType()); |
| 2687 | } else { |
| 2688 | unsigned PS = TD->getPointerSize(); |
| 2689 | Instruction *Cast; |
| 2690 | if (SO1->getType()->getPrimitiveSize() == PS) { |
| 2691 | // Convert GO1 to SO1's type. |
| 2692 | GO1 = InsertSignExtendToPtrTy(GO1, SO1->getType(), &GEP, this); |
| 2693 | |
| 2694 | } else if (GO1->getType()->getPrimitiveSize() == PS) { |
| 2695 | // Convert SO1 to GO1's type. |
| 2696 | SO1 = InsertSignExtendToPtrTy(SO1, GO1->getType(), &GEP, this); |
| 2697 | } else { |
| 2698 | const Type *PT = TD->getIntPtrType(); |
| 2699 | SO1 = InsertSignExtendToPtrTy(SO1, PT, &GEP, this); |
| 2700 | GO1 = InsertSignExtendToPtrTy(GO1, PT, &GEP, this); |
| 2701 | } |
| 2702 | } |
| 2703 | } |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2704 | if (isa<Constant>(SO1) && isa<Constant>(GO1)) |
| 2705 | Sum = ConstantExpr::getAdd(cast<Constant>(SO1), cast<Constant>(GO1)); |
| 2706 | else { |
| 2707 | Sum = BinaryOperator::create(Instruction::Add, SO1, GO1, |
| 2708 | PtrOp->getName()+".sum", &GEP); |
| 2709 | WorkList.push_back(cast<Instruction>(Sum)); |
| 2710 | } |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 2711 | } |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2712 | |
| 2713 | // Recycle the GEP we already have if possible. |
| 2714 | if (SrcGEPOperands.size() == 2) { |
| 2715 | GEP.setOperand(0, SrcGEPOperands[0]); |
| 2716 | GEP.setOperand(1, Sum); |
| 2717 | return &GEP; |
| 2718 | } else { |
| 2719 | Indices.insert(Indices.end(), SrcGEPOperands.begin()+1, |
| 2720 | SrcGEPOperands.end()-1); |
| 2721 | Indices.push_back(Sum); |
| 2722 | Indices.insert(Indices.end(), GEP.op_begin()+2, GEP.op_end()); |
| 2723 | } |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 2724 | } else if (isa<Constant>(*GEP.idx_begin()) && |
| 2725 | cast<Constant>(*GEP.idx_begin())->isNullValue() && |
Chris Lattner | ebd985c | 2004-03-25 22:59:29 +0000 | [diff] [blame] | 2726 | SrcGEPOperands.size() != 1) { |
Chris Lattner | 90ac28c | 2002-08-02 19:29:35 +0000 | [diff] [blame] | 2727 | // Otherwise we can do the fold if the first index of the GEP is a zero |
Chris Lattner | ebd985c | 2004-03-25 22:59:29 +0000 | [diff] [blame] | 2728 | Indices.insert(Indices.end(), SrcGEPOperands.begin()+1, |
| 2729 | SrcGEPOperands.end()); |
Chris Lattner | 90ac28c | 2002-08-02 19:29:35 +0000 | [diff] [blame] | 2730 | Indices.insert(Indices.end(), GEP.idx_begin()+1, GEP.idx_end()); |
| 2731 | } |
| 2732 | |
| 2733 | if (!Indices.empty()) |
Chris Lattner | ebd985c | 2004-03-25 22:59:29 +0000 | [diff] [blame] | 2734 | return new GetElementPtrInst(SrcGEPOperands[0], Indices, GEP.getName()); |
Chris Lattner | 9b76123 | 2002-08-17 22:21:59 +0000 | [diff] [blame] | 2735 | |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2736 | } else if (GlobalValue *GV = dyn_cast<GlobalValue>(PtrOp)) { |
Chris Lattner | 9b76123 | 2002-08-17 22:21:59 +0000 | [diff] [blame] | 2737 | // GEP of global variable. If all of the indices for this GEP are |
| 2738 | // constants, we can promote this to a constexpr instead of an instruction. |
| 2739 | |
| 2740 | // Scan for nonconstants... |
| 2741 | std::vector<Constant*> Indices; |
| 2742 | User::op_iterator I = GEP.idx_begin(), E = GEP.idx_end(); |
| 2743 | for (; I != E && isa<Constant>(*I); ++I) |
| 2744 | Indices.push_back(cast<Constant>(*I)); |
| 2745 | |
| 2746 | if (I == E) { // If they are all constants... |
Chris Lattner | fb242b6 | 2003-04-16 22:40:51 +0000 | [diff] [blame] | 2747 | Constant *CE = |
Chris Lattner | 9b76123 | 2002-08-17 22:21:59 +0000 | [diff] [blame] | 2748 | ConstantExpr::getGetElementPtr(ConstantPointerRef::get(GV), Indices); |
| 2749 | |
| 2750 | // Replace all uses of the GEP with the new constexpr... |
| 2751 | return ReplaceInstUsesWith(GEP, CE); |
| 2752 | } |
Chris Lattner | 620ce14 | 2004-05-07 22:09:22 +0000 | [diff] [blame] | 2753 | } else if (ConstantExpr *CE = dyn_cast<ConstantExpr>(PtrOp)) { |
Chris Lattner | c6bd195 | 2004-02-22 05:25:17 +0000 | [diff] [blame] | 2754 | if (CE->getOpcode() == Instruction::Cast) { |
| 2755 | if (HasZeroPointerIndex) { |
| 2756 | // transform: GEP (cast [10 x ubyte]* X to [0 x ubyte]*), long 0, ... |
| 2757 | // into : GEP [10 x ubyte]* X, long 0, ... |
| 2758 | // |
| 2759 | // This occurs when the program declares an array extern like "int X[];" |
| 2760 | // |
| 2761 | Constant *X = CE->getOperand(0); |
| 2762 | const PointerType *CPTy = cast<PointerType>(CE->getType()); |
| 2763 | if (const PointerType *XTy = dyn_cast<PointerType>(X->getType())) |
| 2764 | if (const ArrayType *XATy = |
| 2765 | dyn_cast<ArrayType>(XTy->getElementType())) |
| 2766 | if (const ArrayType *CATy = |
| 2767 | dyn_cast<ArrayType>(CPTy->getElementType())) |
| 2768 | if (CATy->getElementType() == XATy->getElementType()) { |
| 2769 | // At this point, we know that the cast source type is a pointer |
| 2770 | // to an array of the same type as the destination pointer |
| 2771 | // array. Because the array type is never stepped over (there |
| 2772 | // is a leading zero) we can fold the cast into this GEP. |
| 2773 | GEP.setOperand(0, X); |
| 2774 | return &GEP; |
| 2775 | } |
| 2776 | } |
| 2777 | } |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 2778 | } |
| 2779 | |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 2780 | return 0; |
| 2781 | } |
| 2782 | |
Chris Lattner | 0864acf | 2002-11-04 16:18:53 +0000 | [diff] [blame] | 2783 | Instruction *InstCombiner::visitAllocationInst(AllocationInst &AI) { |
| 2784 | // Convert: malloc Ty, C - where C is a constant != 1 into: malloc [C x Ty], 1 |
| 2785 | if (AI.isArrayAllocation()) // Check C != 1 |
| 2786 | if (const ConstantUInt *C = dyn_cast<ConstantUInt>(AI.getArraySize())) { |
| 2787 | const Type *NewTy = ArrayType::get(AI.getAllocatedType(), C->getValue()); |
Chris Lattner | 0006bd7 | 2002-11-09 00:49:43 +0000 | [diff] [blame] | 2788 | AllocationInst *New = 0; |
Chris Lattner | 0864acf | 2002-11-04 16:18:53 +0000 | [diff] [blame] | 2789 | |
| 2790 | // Create and insert the replacement instruction... |
| 2791 | if (isa<MallocInst>(AI)) |
Chris Lattner | 7c881df | 2004-03-19 06:08:10 +0000 | [diff] [blame] | 2792 | New = new MallocInst(NewTy, 0, AI.getName()); |
Chris Lattner | 0006bd7 | 2002-11-09 00:49:43 +0000 | [diff] [blame] | 2793 | else { |
| 2794 | assert(isa<AllocaInst>(AI) && "Unknown type of allocation inst!"); |
Chris Lattner | 7c881df | 2004-03-19 06:08:10 +0000 | [diff] [blame] | 2795 | New = new AllocaInst(NewTy, 0, AI.getName()); |
Chris Lattner | 0006bd7 | 2002-11-09 00:49:43 +0000 | [diff] [blame] | 2796 | } |
Chris Lattner | 7c881df | 2004-03-19 06:08:10 +0000 | [diff] [blame] | 2797 | |
| 2798 | InsertNewInstBefore(New, AI); |
Chris Lattner | 0864acf | 2002-11-04 16:18:53 +0000 | [diff] [blame] | 2799 | |
| 2800 | // Scan to the end of the allocation instructions, to skip over a block of |
| 2801 | // allocas if possible... |
| 2802 | // |
| 2803 | BasicBlock::iterator It = New; |
| 2804 | while (isa<AllocationInst>(*It)) ++It; |
| 2805 | |
| 2806 | // Now that I is pointing to the first non-allocation-inst in the block, |
| 2807 | // insert our getelementptr instruction... |
| 2808 | // |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 2809 | std::vector<Value*> Idx(2, Constant::getNullValue(Type::IntTy)); |
Chris Lattner | 0864acf | 2002-11-04 16:18:53 +0000 | [diff] [blame] | 2810 | Value *V = new GetElementPtrInst(New, Idx, New->getName()+".sub", It); |
| 2811 | |
| 2812 | // Now make everything use the getelementptr instead of the original |
| 2813 | // allocation. |
Chris Lattner | 7c881df | 2004-03-19 06:08:10 +0000 | [diff] [blame] | 2814 | return ReplaceInstUsesWith(AI, V); |
Chris Lattner | 0864acf | 2002-11-04 16:18:53 +0000 | [diff] [blame] | 2815 | } |
Chris Lattner | 7c881df | 2004-03-19 06:08:10 +0000 | [diff] [blame] | 2816 | |
| 2817 | // If alloca'ing a zero byte object, replace the alloca with a null pointer. |
| 2818 | // Note that we only do this for alloca's, because malloc should allocate and |
| 2819 | // return a unique pointer, even for a zero byte allocation. |
| 2820 | if (isa<AllocaInst>(AI) && TD->getTypeSize(AI.getAllocatedType()) == 0) |
| 2821 | return ReplaceInstUsesWith(AI, Constant::getNullValue(AI.getType())); |
| 2822 | |
Chris Lattner | 0864acf | 2002-11-04 16:18:53 +0000 | [diff] [blame] | 2823 | return 0; |
| 2824 | } |
| 2825 | |
Chris Lattner | 67b1e1b | 2003-12-07 01:24:23 +0000 | [diff] [blame] | 2826 | Instruction *InstCombiner::visitFreeInst(FreeInst &FI) { |
| 2827 | Value *Op = FI.getOperand(0); |
| 2828 | |
| 2829 | // Change free <ty>* (cast <ty2>* X to <ty>*) into free <ty2>* X |
| 2830 | if (CastInst *CI = dyn_cast<CastInst>(Op)) |
| 2831 | if (isa<PointerType>(CI->getOperand(0)->getType())) { |
| 2832 | FI.setOperand(0, CI->getOperand(0)); |
| 2833 | return &FI; |
| 2834 | } |
| 2835 | |
Chris Lattner | 6160e85 | 2004-02-28 04:57:37 +0000 | [diff] [blame] | 2836 | // If we have 'free null' delete the instruction. This can happen in stl code |
| 2837 | // when lots of inlining happens. |
Chris Lattner | 7bcc0e7 | 2004-02-28 05:22:00 +0000 | [diff] [blame] | 2838 | if (isa<ConstantPointerNull>(Op)) |
| 2839 | return EraseInstFromFunction(FI); |
Chris Lattner | 6160e85 | 2004-02-28 04:57:37 +0000 | [diff] [blame] | 2840 | |
Chris Lattner | 67b1e1b | 2003-12-07 01:24:23 +0000 | [diff] [blame] | 2841 | return 0; |
| 2842 | } |
| 2843 | |
| 2844 | |
Chris Lattner | 833b8a4 | 2003-06-26 05:06:25 +0000 | [diff] [blame] | 2845 | /// GetGEPGlobalInitializer - Given a constant, and a getelementptr |
| 2846 | /// constantexpr, return the constant value being addressed by the constant |
| 2847 | /// expression, or null if something is funny. |
| 2848 | /// |
| 2849 | static Constant *GetGEPGlobalInitializer(Constant *C, ConstantExpr *CE) { |
Chris Lattner | 28977af | 2004-04-05 01:30:19 +0000 | [diff] [blame] | 2850 | if (CE->getOperand(1) != Constant::getNullValue(CE->getOperand(1)->getType())) |
Chris Lattner | 833b8a4 | 2003-06-26 05:06:25 +0000 | [diff] [blame] | 2851 | return 0; // Do not allow stepping over the value! |
| 2852 | |
| 2853 | // Loop over all of the operands, tracking down which value we are |
| 2854 | // addressing... |
Chris Lattner | e1368ae | 2004-05-27 17:30:27 +0000 | [diff] [blame^] | 2855 | gep_type_iterator I = gep_type_begin(CE), E = gep_type_end(CE); |
| 2856 | for (++I; I != E; ++I) |
| 2857 | if (const StructType *STy = dyn_cast<StructType>(*I)) { |
| 2858 | ConstantUInt *CU = cast<ConstantUInt>(I.getOperand()); |
| 2859 | assert(CU->getValue() < STy->getNumElements() && |
| 2860 | "Struct index out of range!"); |
| 2861 | if (ConstantStruct *CS = dyn_cast<ConstantStruct>(C)) { |
| 2862 | C = cast<Constant>(CS->getValues()[CU->getValue()]); |
| 2863 | } else if (isa<ConstantAggregateZero>(C)) { |
| 2864 | C = Constant::getNullValue(STy->getElementType(CU->getValue())); |
| 2865 | } else { |
| 2866 | return 0; |
| 2867 | } |
| 2868 | } else if (ConstantInt *CI = dyn_cast<ConstantInt>(I.getOperand())) { |
| 2869 | const ArrayType *ATy = cast<ArrayType>(*I); |
| 2870 | if ((uint64_t)CI->getRawValue() >= ATy->getNumElements()) return 0; |
| 2871 | if (ConstantArray *CA = dyn_cast<ConstantArray>(C)) |
| 2872 | C = cast<Constant>(CA->getValues()[CI->getRawValue()]); |
| 2873 | else if (isa<ConstantAggregateZero>(C)) |
| 2874 | C = Constant::getNullValue(ATy->getElementType()); |
| 2875 | else |
| 2876 | return 0; |
| 2877 | } else { |
Chris Lattner | 833b8a4 | 2003-06-26 05:06:25 +0000 | [diff] [blame] | 2878 | return 0; |
Chris Lattner | e1368ae | 2004-05-27 17:30:27 +0000 | [diff] [blame^] | 2879 | } |
Chris Lattner | 833b8a4 | 2003-06-26 05:06:25 +0000 | [diff] [blame] | 2880 | return C; |
| 2881 | } |
| 2882 | |
| 2883 | Instruction *InstCombiner::visitLoadInst(LoadInst &LI) { |
| 2884 | Value *Op = LI.getOperand(0); |
Chris Lattner | 5f16a13 | 2004-01-12 04:13:56 +0000 | [diff] [blame] | 2885 | if (LI.isVolatile()) return 0; |
| 2886 | |
Chris Lattner | d9955aa | 2004-04-14 03:28:36 +0000 | [diff] [blame] | 2887 | if (Constant *C = dyn_cast<Constant>(Op)) |
| 2888 | if (C->isNullValue()) // load null -> 0 |
| 2889 | return ReplaceInstUsesWith(LI, Constant::getNullValue(LI.getType())); |
| 2890 | else if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(C)) |
| 2891 | Op = CPR->getValue(); |
Chris Lattner | 833b8a4 | 2003-06-26 05:06:25 +0000 | [diff] [blame] | 2892 | |
| 2893 | // Instcombine load (constant global) into the value loaded... |
| 2894 | if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Op)) |
Chris Lattner | 1ba5bcd | 2003-07-22 21:46:59 +0000 | [diff] [blame] | 2895 | if (GV->isConstant() && !GV->isExternal()) |
Chris Lattner | 833b8a4 | 2003-06-26 05:06:25 +0000 | [diff] [blame] | 2896 | return ReplaceInstUsesWith(LI, GV->getInitializer()); |
| 2897 | |
| 2898 | // Instcombine load (constantexpr_GEP global, 0, ...) into the value loaded... |
| 2899 | if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Op)) |
| 2900 | if (CE->getOpcode() == Instruction::GetElementPtr) |
| 2901 | if (ConstantPointerRef *G=dyn_cast<ConstantPointerRef>(CE->getOperand(0))) |
| 2902 | if (GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getValue())) |
Chris Lattner | 1ba5bcd | 2003-07-22 21:46:59 +0000 | [diff] [blame] | 2903 | if (GV->isConstant() && !GV->isExternal()) |
Chris Lattner | 833b8a4 | 2003-06-26 05:06:25 +0000 | [diff] [blame] | 2904 | if (Constant *V = GetGEPGlobalInitializer(GV->getInitializer(), CE)) |
| 2905 | return ReplaceInstUsesWith(LI, V); |
Chris Lattner | f499eac | 2004-04-08 20:39:49 +0000 | [diff] [blame] | 2906 | |
| 2907 | // load (cast X) --> cast (load X) iff safe |
| 2908 | if (CastInst *CI = dyn_cast<CastInst>(Op)) { |
| 2909 | const Type *DestPTy = cast<PointerType>(CI->getType())->getElementType(); |
| 2910 | if (const PointerType *SrcTy = |
| 2911 | dyn_cast<PointerType>(CI->getOperand(0)->getType())) { |
| 2912 | const Type *SrcPTy = SrcTy->getElementType(); |
Chris Lattner | 546516c | 2004-05-07 15:35:56 +0000 | [diff] [blame] | 2913 | if (SrcPTy->isSized() && DestPTy->isSized() && |
| 2914 | TD->getTypeSize(SrcPTy) == TD->getTypeSize(DestPTy) && |
Chris Lattner | f499eac | 2004-04-08 20:39:49 +0000 | [diff] [blame] | 2915 | (SrcPTy->isInteger() || isa<PointerType>(SrcPTy)) && |
| 2916 | (DestPTy->isInteger() || isa<PointerType>(DestPTy))) { |
| 2917 | // Okay, we are casting from one integer or pointer type to another of |
| 2918 | // the same size. Instead of casting the pointer before the load, cast |
| 2919 | // the result of the loaded value. |
| 2920 | Value *NewLoad = InsertNewInstBefore(new LoadInst(CI->getOperand(0), |
| 2921 | CI->getName()), LI); |
| 2922 | // Now cast the result of the load. |
| 2923 | return new CastInst(NewLoad, LI.getType()); |
| 2924 | } |
| 2925 | } |
| 2926 | } |
| 2927 | |
Chris Lattner | 833b8a4 | 2003-06-26 05:06:25 +0000 | [diff] [blame] | 2928 | return 0; |
| 2929 | } |
| 2930 | |
| 2931 | |
Chris Lattner | c4d10eb | 2003-06-04 04:46:00 +0000 | [diff] [blame] | 2932 | Instruction *InstCombiner::visitBranchInst(BranchInst &BI) { |
| 2933 | // Change br (not X), label True, label False to: br X, label False, True |
Chris Lattner | a0ebceb | 2004-02-27 06:27:46 +0000 | [diff] [blame] | 2934 | if (BI.isConditional() && !isa<Constant>(BI.getCondition())) { |
Chris Lattner | 40f5d70 | 2003-06-04 05:10:11 +0000 | [diff] [blame] | 2935 | if (Value *V = dyn_castNotVal(BI.getCondition())) { |
| 2936 | BasicBlock *TrueDest = BI.getSuccessor(0); |
| 2937 | BasicBlock *FalseDest = BI.getSuccessor(1); |
| 2938 | // Swap Destinations and condition... |
| 2939 | BI.setCondition(V); |
| 2940 | BI.setSuccessor(0, FalseDest); |
| 2941 | BI.setSuccessor(1, TrueDest); |
| 2942 | return &BI; |
Chris Lattner | a0ebceb | 2004-02-27 06:27:46 +0000 | [diff] [blame] | 2943 | } else if (SetCondInst *I = dyn_cast<SetCondInst>(BI.getCondition())) { |
| 2944 | // Cannonicalize setne -> seteq |
| 2945 | if ((I->getOpcode() == Instruction::SetNE || |
| 2946 | I->getOpcode() == Instruction::SetLE || |
| 2947 | I->getOpcode() == Instruction::SetGE) && I->hasOneUse()) { |
| 2948 | std::string Name = I->getName(); I->setName(""); |
| 2949 | Instruction::BinaryOps NewOpcode = |
| 2950 | SetCondInst::getInverseCondition(I->getOpcode()); |
| 2951 | Value *NewSCC = BinaryOperator::create(NewOpcode, I->getOperand(0), |
| 2952 | I->getOperand(1), Name, I); |
| 2953 | BasicBlock *TrueDest = BI.getSuccessor(0); |
| 2954 | BasicBlock *FalseDest = BI.getSuccessor(1); |
| 2955 | // Swap Destinations and condition... |
| 2956 | BI.setCondition(NewSCC); |
| 2957 | BI.setSuccessor(0, FalseDest); |
| 2958 | BI.setSuccessor(1, TrueDest); |
| 2959 | removeFromWorkList(I); |
| 2960 | I->getParent()->getInstList().erase(I); |
| 2961 | WorkList.push_back(cast<Instruction>(NewSCC)); |
| 2962 | return &BI; |
| 2963 | } |
Chris Lattner | 40f5d70 | 2003-06-04 05:10:11 +0000 | [diff] [blame] | 2964 | } |
Chris Lattner | a0ebceb | 2004-02-27 06:27:46 +0000 | [diff] [blame] | 2965 | } |
Chris Lattner | c4d10eb | 2003-06-04 04:46:00 +0000 | [diff] [blame] | 2966 | return 0; |
| 2967 | } |
Chris Lattner | 0864acf | 2002-11-04 16:18:53 +0000 | [diff] [blame] | 2968 | |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 2969 | |
Chris Lattner | 62b14df | 2002-09-02 04:59:56 +0000 | [diff] [blame] | 2970 | void InstCombiner::removeFromWorkList(Instruction *I) { |
| 2971 | WorkList.erase(std::remove(WorkList.begin(), WorkList.end(), I), |
| 2972 | WorkList.end()); |
| 2973 | } |
| 2974 | |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 2975 | bool InstCombiner::runOnFunction(Function &F) { |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 2976 | bool Changed = false; |
Chris Lattner | bc61e66 | 2003-11-02 05:57:39 +0000 | [diff] [blame] | 2977 | TD = &getAnalysis<TargetData>(); |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 2978 | |
Chris Lattner | 216d4d8 | 2004-05-01 23:19:52 +0000 | [diff] [blame] | 2979 | for (inst_iterator i = inst_begin(F), e = inst_end(F); i != e; ++i) |
| 2980 | WorkList.push_back(&*i); |
Chris Lattner | 6ffe551 | 2004-04-27 15:13:33 +0000 | [diff] [blame] | 2981 | |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 2982 | |
| 2983 | while (!WorkList.empty()) { |
| 2984 | Instruction *I = WorkList.back(); // Get an instruction from the worklist |
| 2985 | WorkList.pop_back(); |
| 2986 | |
Misha Brukman | a3bbcb5 | 2002-10-29 23:06:16 +0000 | [diff] [blame] | 2987 | // Check to see if we can DCE or ConstantPropagate the instruction... |
Chris Lattner | 62b14df | 2002-09-02 04:59:56 +0000 | [diff] [blame] | 2988 | // Check to see if we can DIE the instruction... |
| 2989 | if (isInstructionTriviallyDead(I)) { |
| 2990 | // Add operands to the worklist... |
Chris Lattner | 4bb7c02 | 2003-10-06 17:11:01 +0000 | [diff] [blame] | 2991 | if (I->getNumOperands() < 4) |
Chris Lattner | 7bcc0e7 | 2004-02-28 05:22:00 +0000 | [diff] [blame] | 2992 | AddUsesToWorkList(*I); |
Chris Lattner | 62b14df | 2002-09-02 04:59:56 +0000 | [diff] [blame] | 2993 | ++NumDeadInst; |
Chris Lattner | 4bb7c02 | 2003-10-06 17:11:01 +0000 | [diff] [blame] | 2994 | |
| 2995 | I->getParent()->getInstList().erase(I); |
| 2996 | removeFromWorkList(I); |
| 2997 | continue; |
| 2998 | } |
Chris Lattner | 62b14df | 2002-09-02 04:59:56 +0000 | [diff] [blame] | 2999 | |
Misha Brukman | a3bbcb5 | 2002-10-29 23:06:16 +0000 | [diff] [blame] | 3000 | // Instruction isn't dead, see if we can constant propagate it... |
Chris Lattner | 62b14df | 2002-09-02 04:59:56 +0000 | [diff] [blame] | 3001 | if (Constant *C = ConstantFoldInstruction(I)) { |
| 3002 | // Add operands to the worklist... |
Chris Lattner | 7bcc0e7 | 2004-02-28 05:22:00 +0000 | [diff] [blame] | 3003 | AddUsesToWorkList(*I); |
Chris Lattner | c736d56 | 2002-12-05 22:41:53 +0000 | [diff] [blame] | 3004 | ReplaceInstUsesWith(*I, C); |
| 3005 | |
Chris Lattner | 62b14df | 2002-09-02 04:59:56 +0000 | [diff] [blame] | 3006 | ++NumConstProp; |
Chris Lattner | 4bb7c02 | 2003-10-06 17:11:01 +0000 | [diff] [blame] | 3007 | I->getParent()->getInstList().erase(I); |
Chris Lattner | 6061000 | 2003-10-07 15:17:02 +0000 | [diff] [blame] | 3008 | removeFromWorkList(I); |
Chris Lattner | 4bb7c02 | 2003-10-06 17:11:01 +0000 | [diff] [blame] | 3009 | continue; |
Chris Lattner | 62b14df | 2002-09-02 04:59:56 +0000 | [diff] [blame] | 3010 | } |
Chris Lattner | 4bb7c02 | 2003-10-06 17:11:01 +0000 | [diff] [blame] | 3011 | |
Chris Lattner | ebd985c | 2004-03-25 22:59:29 +0000 | [diff] [blame] | 3012 | // Check to see if any of the operands of this instruction are a |
| 3013 | // ConstantPointerRef. Since they sneak in all over the place and inhibit |
| 3014 | // optimization, we want to strip them out unconditionally! |
| 3015 | for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) |
| 3016 | if (ConstantPointerRef *CPR = |
| 3017 | dyn_cast<ConstantPointerRef>(I->getOperand(i))) { |
| 3018 | I->setOperand(i, CPR->getValue()); |
| 3019 | Changed = true; |
| 3020 | } |
| 3021 | |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 3022 | // Now that we have an instruction, try combining it to simplify it... |
Chris Lattner | 90ac28c | 2002-08-02 19:29:35 +0000 | [diff] [blame] | 3023 | if (Instruction *Result = visit(*I)) { |
Chris Lattner | 3dec1f2 | 2002-05-10 15:38:35 +0000 | [diff] [blame] | 3024 | ++NumCombined; |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 3025 | // Should we replace the old instruction with a new one? |
Chris Lattner | b3bc8fa | 2002-05-14 15:24:07 +0000 | [diff] [blame] | 3026 | if (Result != I) { |
Chris Lattner | 0cea42a | 2004-03-13 23:54:27 +0000 | [diff] [blame] | 3027 | DEBUG(std::cerr << "IC: Old = " << *I |
| 3028 | << " New = " << *Result); |
| 3029 | |
Chris Lattner | b3bc8fa | 2002-05-14 15:24:07 +0000 | [diff] [blame] | 3030 | // Instructions can end up on the worklist more than once. Make sure |
| 3031 | // we do not process an instruction that has been deleted. |
Chris Lattner | 62b14df | 2002-09-02 04:59:56 +0000 | [diff] [blame] | 3032 | removeFromWorkList(I); |
Chris Lattner | 4bb7c02 | 2003-10-06 17:11:01 +0000 | [diff] [blame] | 3033 | |
| 3034 | // Move the name to the new instruction first... |
| 3035 | std::string OldName = I->getName(); I->setName(""); |
Chris Lattner | d558dc3 | 2003-10-07 22:58:41 +0000 | [diff] [blame] | 3036 | Result->setName(OldName); |
Chris Lattner | 4bb7c02 | 2003-10-06 17:11:01 +0000 | [diff] [blame] | 3037 | |
| 3038 | // Insert the new instruction into the basic block... |
| 3039 | BasicBlock *InstParent = I->getParent(); |
| 3040 | InstParent->getInstList().insert(I, Result); |
| 3041 | |
Chris Lattner | 00d5131 | 2004-05-01 23:27:23 +0000 | [diff] [blame] | 3042 | // Make sure that we reprocess all operands now that we reduced their |
| 3043 | // use counts. |
Chris Lattner | 216d4d8 | 2004-05-01 23:19:52 +0000 | [diff] [blame] | 3044 | for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) |
| 3045 | if (Instruction *OpI = dyn_cast<Instruction>(I->getOperand(i))) |
| 3046 | WorkList.push_back(OpI); |
| 3047 | |
Chris Lattner | 4bb7c02 | 2003-10-06 17:11:01 +0000 | [diff] [blame] | 3048 | // Everything uses the new instruction now... |
| 3049 | I->replaceAllUsesWith(Result); |
| 3050 | |
| 3051 | // Erase the old instruction. |
| 3052 | InstParent->getInstList().erase(I); |
Chris Lattner | 7e70829 | 2002-06-25 16:13:24 +0000 | [diff] [blame] | 3053 | } else { |
Chris Lattner | 0cea42a | 2004-03-13 23:54:27 +0000 | [diff] [blame] | 3054 | DEBUG(std::cerr << "IC: MOD = " << *I); |
| 3055 | |
Chris Lattner | 90ac28c | 2002-08-02 19:29:35 +0000 | [diff] [blame] | 3056 | // If the instruction was modified, it's possible that it is now dead. |
| 3057 | // if so, remove it. |
Chris Lattner | 00d5131 | 2004-05-01 23:27:23 +0000 | [diff] [blame] | 3058 | if (isInstructionTriviallyDead(I)) { |
| 3059 | // Make sure we process all operands now that we are reducing their |
| 3060 | // use counts. |
| 3061 | for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i) |
| 3062 | if (Instruction *OpI = dyn_cast<Instruction>(I->getOperand(i))) |
| 3063 | WorkList.push_back(OpI); |
| 3064 | |
| 3065 | // Instructions may end up in the worklist more than once. Erase all |
| 3066 | // occurrances of this instruction. |
Chris Lattner | 62b14df | 2002-09-02 04:59:56 +0000 | [diff] [blame] | 3067 | removeFromWorkList(I); |
Chris Lattner | 00d5131 | 2004-05-01 23:27:23 +0000 | [diff] [blame] | 3068 | I->getParent()->getInstList().erase(I); |
Chris Lattner | 90ac28c | 2002-08-02 19:29:35 +0000 | [diff] [blame] | 3069 | Result = 0; |
| 3070 | } |
Chris Lattner | b3bc8fa | 2002-05-14 15:24:07 +0000 | [diff] [blame] | 3071 | } |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 3072 | |
Chris Lattner | 90ac28c | 2002-08-02 19:29:35 +0000 | [diff] [blame] | 3073 | if (Result) { |
| 3074 | WorkList.push_back(Result); |
Chris Lattner | 7bcc0e7 | 2004-02-28 05:22:00 +0000 | [diff] [blame] | 3075 | AddUsersToWorkList(*Result); |
Chris Lattner | 90ac28c | 2002-08-02 19:29:35 +0000 | [diff] [blame] | 3076 | } |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 3077 | Changed = true; |
Chris Lattner | 8a2a311 | 2001-12-14 16:52:21 +0000 | [diff] [blame] | 3078 | } |
| 3079 | } |
| 3080 | |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 3081 | return Changed; |
Chris Lattner | bd0ef77 | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 3082 | } |
| 3083 | |
Chris Lattner | 67b1e1b | 2003-12-07 01:24:23 +0000 | [diff] [blame] | 3084 | Pass *llvm::createInstructionCombiningPass() { |
Chris Lattner | dd841ae | 2002-04-18 17:39:14 +0000 | [diff] [blame] | 3085 | return new InstCombiner(); |
Chris Lattner | bd0ef77 | 2002-02-26 21:46:54 +0000 | [diff] [blame] | 3086 | } |
Brian Gaeke | d0fde30 | 2003-11-11 22:41:34 +0000 | [diff] [blame] | 3087 | |