1 //===- InstructionCombining.cpp - Combine multiple instructions -----------===//
3 // InstructionCombining - Combine instructions to form fewer, simple
4 // instructions. This pass does not modify the CFG This pass is where algebraic
5 // simplification happens.
7 // This pass combines things like:
13 // This is a simple worklist driven algorithm.
15 //===----------------------------------------------------------------------===//
17 #include "llvm/Transforms/Scalar.h"
18 #include "llvm/Transforms/Utils/BasicBlockUtils.h"
19 #include "llvm/Transforms/Utils/Local.h"
20 #include "llvm/Instructions.h"
21 #include "llvm/Pass.h"
22 #include "llvm/Constants.h"
23 #include "llvm/ConstantHandling.h"
24 #include "llvm/DerivedTypes.h"
25 #include "llvm/GlobalVariable.h"
26 #include "llvm/Support/InstIterator.h"
27 #include "llvm/Support/InstVisitor.h"
28 #include "llvm/Support/CallSite.h"
29 #include "Support/Statistic.h"
33 Statistic<> NumCombined ("instcombine", "Number of insts combined");
34 Statistic<> NumConstProp("instcombine", "Number of constant folds");
35 Statistic<> NumDeadInst ("instcombine", "Number of dead inst eliminated");
37 class InstCombiner : public FunctionPass,
38 public InstVisitor<InstCombiner, Instruction*> {
39 // Worklist of all of the instructions that need to be simplified.
40 std::vector<Instruction*> WorkList;
42 void AddUsesToWorkList(Instruction &I) {
43 // The instruction was simplified, add all users of the instruction to
44 // the work lists because they might get more simplified now...
46 for (Value::use_iterator UI = I.use_begin(), UE = I.use_end();
48 WorkList.push_back(cast<Instruction>(*UI));
51 // removeFromWorkList - remove all instances of I from the worklist.
52 void removeFromWorkList(Instruction *I);
54 virtual bool runOnFunction(Function &F);
56 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
60 // Visitation implementation - Implement instruction combining for different
61 // instruction types. The semantics are as follows:
63 // null - No change was made
64 // I - Change was made, I is still valid, I may be dead though
65 // otherwise - Change was made, replace I with returned instruction
67 Instruction *visitAdd(BinaryOperator &I);
68 Instruction *visitSub(BinaryOperator &I);
69 Instruction *visitMul(BinaryOperator &I);
70 Instruction *visitDiv(BinaryOperator &I);
71 Instruction *visitRem(BinaryOperator &I);
72 Instruction *visitAnd(BinaryOperator &I);
73 Instruction *visitOr (BinaryOperator &I);
74 Instruction *visitXor(BinaryOperator &I);
75 Instruction *visitSetCondInst(BinaryOperator &I);
76 Instruction *visitShiftInst(ShiftInst &I);
77 Instruction *visitCastInst(CastInst &CI);
78 Instruction *visitCallInst(CallInst &CI);
79 Instruction *visitInvokeInst(InvokeInst &II);
80 Instruction *visitPHINode(PHINode &PN);
81 Instruction *visitGetElementPtrInst(GetElementPtrInst &GEP);
82 Instruction *visitAllocationInst(AllocationInst &AI);
83 Instruction *visitLoadInst(LoadInst &LI);
84 Instruction *visitBranchInst(BranchInst &BI);
86 // visitInstruction - Specify what to return for unhandled instructions...
87 Instruction *visitInstruction(Instruction &I) { return 0; }
90 bool transformConstExprCastCall(CallSite CS);
92 // InsertNewInstBefore - insert an instruction New before instruction Old
93 // in the program. Add the new instruction to the worklist.
95 void InsertNewInstBefore(Instruction *New, Instruction &Old) {
96 assert(New && New->getParent() == 0 &&
97 "New instruction already inserted into a basic block!");
98 BasicBlock *BB = Old.getParent();
99 BB->getInstList().insert(&Old, New); // Insert inst
100 WorkList.push_back(New); // Add to worklist
103 // ReplaceInstUsesWith - This method is to be used when an instruction is
104 // found to be dead, replacable with another preexisting expression. Here
105 // we add all uses of I to the worklist, replace all uses of I with the new
106 // value, then return I, so that the inst combiner will know that I was
109 Instruction *ReplaceInstUsesWith(Instruction &I, Value *V) {
110 AddUsesToWorkList(I); // Add all modified instrs to worklist
111 I.replaceAllUsesWith(V);
115 // SimplifyCommutative - This performs a few simplifications for commutative
117 bool SimplifyCommutative(BinaryOperator &I);
120 RegisterOpt<InstCombiner> X("instcombine", "Combine redundant instructions");
123 // getComplexity: Assign a complexity or rank value to LLVM Values...
124 // 0 -> Constant, 1 -> Other, 2 -> Argument, 2 -> Unary, 3 -> OtherInst
125 static unsigned getComplexity(Value *V) {
126 if (isa<Instruction>(V)) {
127 if (BinaryOperator::isNeg(V) || BinaryOperator::isNot(V))
131 if (isa<Argument>(V)) return 2;
132 return isa<Constant>(V) ? 0 : 1;
135 // isOnlyUse - Return true if this instruction will be deleted if we stop using
137 static bool isOnlyUse(Value *V) {
138 return V->use_size() == 1 || isa<Constant>(V);
141 // SimplifyCommutative - This performs a few simplifications for commutative
144 // 1. Order operands such that they are listed from right (least complex) to
145 // left (most complex). This puts constants before unary operators before
148 // 2. Transform: (op (op V, C1), C2) ==> (op V, (op C1, C2))
149 // 3. Transform: (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
151 bool InstCombiner::SimplifyCommutative(BinaryOperator &I) {
152 bool Changed = false;
153 if (getComplexity(I.getOperand(0)) < getComplexity(I.getOperand(1)))
154 Changed = !I.swapOperands();
156 if (!I.isAssociative()) return Changed;
157 Instruction::BinaryOps Opcode = I.getOpcode();
158 if (BinaryOperator *Op = dyn_cast<BinaryOperator>(I.getOperand(0)))
159 if (Op->getOpcode() == Opcode && isa<Constant>(Op->getOperand(1))) {
160 if (isa<Constant>(I.getOperand(1))) {
161 Constant *Folded = ConstantExpr::get(I.getOpcode(),
162 cast<Constant>(I.getOperand(1)),
163 cast<Constant>(Op->getOperand(1)));
164 I.setOperand(0, Op->getOperand(0));
165 I.setOperand(1, Folded);
167 } else if (BinaryOperator *Op1=dyn_cast<BinaryOperator>(I.getOperand(1)))
168 if (Op1->getOpcode() == Opcode && isa<Constant>(Op1->getOperand(1)) &&
169 isOnlyUse(Op) && isOnlyUse(Op1)) {
170 Constant *C1 = cast<Constant>(Op->getOperand(1));
171 Constant *C2 = cast<Constant>(Op1->getOperand(1));
173 // Fold (op (op V1, C1), (op V2, C2)) ==> (op (op V1, V2), (op C1,C2))
174 Constant *Folded = ConstantExpr::get(I.getOpcode(), C1, C2);
175 Instruction *New = BinaryOperator::create(Opcode, Op->getOperand(0),
178 WorkList.push_back(New);
179 I.setOperand(0, New);
180 I.setOperand(1, Folded);
187 // dyn_castNegVal - Given a 'sub' instruction, return the RHS of the instruction
188 // if the LHS is a constant zero (which is the 'negate' form).
190 static inline Value *dyn_castNegVal(Value *V) {
191 if (BinaryOperator::isNeg(V))
192 return BinaryOperator::getNegArgument(cast<BinaryOperator>(V));
194 // Constants can be considered to be negated values if they can be folded...
195 if (Constant *C = dyn_cast<Constant>(V))
196 return ConstantExpr::get(Instruction::Sub,
197 Constant::getNullValue(V->getType()), C);
201 static inline Value *dyn_castNotVal(Value *V) {
202 if (BinaryOperator::isNot(V))
203 return BinaryOperator::getNotArgument(cast<BinaryOperator>(V));
205 // Constants can be considered to be not'ed values...
206 if (ConstantIntegral *C = dyn_cast<ConstantIntegral>(V))
207 return ConstantExpr::get(Instruction::Xor,
208 ConstantIntegral::getAllOnesValue(C->getType()),C);
212 // dyn_castFoldableMul - If this value is a multiply that can be folded into
213 // other computations (because it has a constant operand), return the
214 // non-constant operand of the multiply.
216 static inline Value *dyn_castFoldableMul(Value *V) {
217 if (V->use_size() == 1 && V->getType()->isInteger())
218 if (Instruction *I = dyn_cast<Instruction>(V))
219 if (I->getOpcode() == Instruction::Mul)
220 if (isa<Constant>(I->getOperand(1)))
221 return I->getOperand(0);
225 // dyn_castMaskingAnd - If this value is an And instruction masking a value with
226 // a constant, return the constant being anded with.
228 static inline Constant *dyn_castMaskingAnd(Value *V) {
229 if (Instruction *I = dyn_cast<Instruction>(V))
230 if (I->getOpcode() == Instruction::And)
231 return dyn_cast<Constant>(I->getOperand(1));
233 // If this is a constant, it acts just like we were masking with it.
234 return dyn_cast<Constant>(V);
237 // Log2 - Calculate the log base 2 for the specified value if it is exactly a
239 static unsigned Log2(uint64_t Val) {
240 assert(Val > 1 && "Values 0 and 1 should be handled elsewhere!");
243 if (Val & 1) return 0; // Multiple bits set?
250 Instruction *InstCombiner::visitAdd(BinaryOperator &I) {
251 bool Changed = SimplifyCommutative(I);
252 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
254 // Eliminate 'add int %X, 0'
255 if (RHS == Constant::getNullValue(I.getType()))
256 return ReplaceInstUsesWith(I, LHS);
259 if (Value *V = dyn_castNegVal(LHS))
260 return BinaryOperator::create(Instruction::Sub, RHS, V);
263 if (!isa<Constant>(RHS))
264 if (Value *V = dyn_castNegVal(RHS))
265 return BinaryOperator::create(Instruction::Sub, LHS, V);
267 // X*C + X --> X * (C+1)
268 if (dyn_castFoldableMul(LHS) == RHS) {
270 ConstantExpr::get(Instruction::Add,
271 cast<Constant>(cast<Instruction>(LHS)->getOperand(1)),
272 ConstantInt::get(I.getType(), 1));
273 return BinaryOperator::create(Instruction::Mul, RHS, CP1);
276 // X + X*C --> X * (C+1)
277 if (dyn_castFoldableMul(RHS) == LHS) {
279 ConstantExpr::get(Instruction::Add,
280 cast<Constant>(cast<Instruction>(RHS)->getOperand(1)),
281 ConstantInt::get(I.getType(), 1));
282 return BinaryOperator::create(Instruction::Mul, LHS, CP1);
285 // (A & C1)+(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
286 if (Constant *C1 = dyn_castMaskingAnd(LHS))
287 if (Constant *C2 = dyn_castMaskingAnd(RHS))
288 if (ConstantExpr::get(Instruction::And, C1, C2)->isNullValue())
289 return BinaryOperator::create(Instruction::Or, LHS, RHS);
291 return Changed ? &I : 0;
294 // isSignBit - Return true if the value represented by the constant only has the
295 // highest order bit set.
296 static bool isSignBit(ConstantInt *CI) {
297 unsigned NumBits = CI->getType()->getPrimitiveSize()*8;
298 return (CI->getRawValue() & ~(-1LL << NumBits)) == (1ULL << (NumBits-1));
301 Instruction *InstCombiner::visitSub(BinaryOperator &I) {
302 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
304 if (Op0 == Op1) // sub X, X -> 0
305 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
307 // If this is a 'B = x-(-A)', change to B = x+A...
308 if (Value *V = dyn_castNegVal(Op1))
309 return BinaryOperator::create(Instruction::Add, Op0, V);
311 // Replace (-1 - A) with (~A)...
312 if (ConstantInt *C = dyn_cast<ConstantInt>(Op0))
313 if (C->isAllOnesValue())
314 return BinaryOperator::createNot(Op1);
316 if (BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1))
317 if (Op1I->use_size() == 1) {
318 // Replace (x - (y - z)) with (x + (z - y)) if the (y - z) subexpression
319 // is not used by anyone else...
321 if (Op1I->getOpcode() == Instruction::Sub) {
322 // Swap the two operands of the subexpr...
323 Value *IIOp0 = Op1I->getOperand(0), *IIOp1 = Op1I->getOperand(1);
324 Op1I->setOperand(0, IIOp1);
325 Op1I->setOperand(1, IIOp0);
327 // Create the new top level add instruction...
328 return BinaryOperator::create(Instruction::Add, Op0, Op1);
331 // Replace (A - (A & B)) with (A & ~B) if this is the only use of (A&B)...
333 if (Op1I->getOpcode() == Instruction::And &&
334 (Op1I->getOperand(0) == Op0 || Op1I->getOperand(1) == Op0)) {
335 Value *OtherOp = Op1I->getOperand(Op1I->getOperand(0) == Op0);
337 Instruction *NewNot = BinaryOperator::createNot(OtherOp, "B.not", &I);
338 return BinaryOperator::create(Instruction::And, Op0, NewNot);
341 // X - X*C --> X * (1-C)
342 if (dyn_castFoldableMul(Op1I) == Op0) {
344 ConstantExpr::get(Instruction::Sub,
345 ConstantInt::get(I.getType(), 1),
346 cast<Constant>(cast<Instruction>(Op1)->getOperand(1)));
347 assert(CP1 && "Couldn't constant fold 1-C?");
348 return BinaryOperator::create(Instruction::Mul, Op0, CP1);
352 // X*C - X --> X * (C-1)
353 if (dyn_castFoldableMul(Op0) == Op1) {
355 ConstantExpr::get(Instruction::Sub,
356 cast<Constant>(cast<Instruction>(Op0)->getOperand(1)),
357 ConstantInt::get(I.getType(), 1));
358 assert(CP1 && "Couldn't constant fold C - 1?");
359 return BinaryOperator::create(Instruction::Mul, Op1, CP1);
365 Instruction *InstCombiner::visitMul(BinaryOperator &I) {
366 bool Changed = SimplifyCommutative(I);
367 Value *Op0 = I.getOperand(0);
369 // Simplify mul instructions with a constant RHS...
370 if (Constant *Op1 = dyn_cast<Constant>(I.getOperand(1))) {
371 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
372 const Type *Ty = CI->getType();
373 int64_t Val = (int64_t)cast<ConstantInt>(CI)->getRawValue();
375 case -1: // X * -1 -> -X
376 return BinaryOperator::createNeg(Op0, I.getName());
378 return ReplaceInstUsesWith(I, Op1); // Eliminate 'mul double %X, 0'
380 return ReplaceInstUsesWith(I, Op0); // Eliminate 'mul int %X, 1'
381 case 2: // Convert 'mul int %X, 2' to 'add int %X, %X'
382 return BinaryOperator::create(Instruction::Add, Op0, Op0, I.getName());
385 if (uint64_t C = Log2(Val)) // Replace X*(2^C) with X << C
386 return new ShiftInst(Instruction::Shl, Op0,
387 ConstantUInt::get(Type::UByteTy, C));
389 ConstantFP *Op1F = cast<ConstantFP>(Op1);
390 if (Op1F->isNullValue())
391 return ReplaceInstUsesWith(I, Op1);
393 // "In IEEE floating point, x*1 is not equivalent to x for nans. However,
394 // ANSI says we can drop signals, so we can do this anyway." (from GCC)
395 if (Op1F->getValue() == 1.0)
396 return ReplaceInstUsesWith(I, Op0); // Eliminate 'mul double %X, 1.0'
400 if (Value *Op0v = dyn_castNegVal(Op0)) // -X * -Y = X*Y
401 if (Value *Op1v = dyn_castNegVal(I.getOperand(1)))
402 return BinaryOperator::create(Instruction::Mul, Op0v, Op1v);
404 return Changed ? &I : 0;
407 Instruction *InstCombiner::visitDiv(BinaryOperator &I) {
409 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I.getOperand(1))) {
410 if (RHS->equalsInt(1))
411 return ReplaceInstUsesWith(I, I.getOperand(0));
413 // Check to see if this is an unsigned division with an exact power of 2,
414 // if so, convert to a right shift.
415 if (ConstantUInt *C = dyn_cast<ConstantUInt>(RHS))
416 if (uint64_t Val = C->getValue()) // Don't break X / 0
417 if (uint64_t C = Log2(Val))
418 return new ShiftInst(Instruction::Shr, I.getOperand(0),
419 ConstantUInt::get(Type::UByteTy, C));
422 // 0 / X == 0, we don't need to preserve faults!
423 if (ConstantInt *LHS = dyn_cast<ConstantInt>(I.getOperand(0)))
424 if (LHS->equalsInt(0))
425 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
431 Instruction *InstCombiner::visitRem(BinaryOperator &I) {
432 if (ConstantInt *RHS = dyn_cast<ConstantInt>(I.getOperand(1))) {
433 if (RHS->equalsInt(1)) // X % 1 == 0
434 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
436 // Check to see if this is an unsigned remainder with an exact power of 2,
437 // if so, convert to a bitwise and.
438 if (ConstantUInt *C = dyn_cast<ConstantUInt>(RHS))
439 if (uint64_t Val = C->getValue()) // Don't break X % 0 (divide by zero)
441 return BinaryOperator::create(Instruction::And, I.getOperand(0),
442 ConstantUInt::get(I.getType(), Val-1));
445 // 0 % X == 0, we don't need to preserve faults!
446 if (ConstantInt *LHS = dyn_cast<ConstantInt>(I.getOperand(0)))
447 if (LHS->equalsInt(0))
448 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
453 // isMaxValueMinusOne - return true if this is Max-1
454 static bool isMaxValueMinusOne(const ConstantInt *C) {
455 if (const ConstantUInt *CU = dyn_cast<ConstantUInt>(C)) {
456 // Calculate -1 casted to the right type...
457 unsigned TypeBits = C->getType()->getPrimitiveSize()*8;
458 uint64_t Val = ~0ULL; // All ones
459 Val >>= 64-TypeBits; // Shift out unwanted 1 bits...
460 return CU->getValue() == Val-1;
463 const ConstantSInt *CS = cast<ConstantSInt>(C);
465 // Calculate 0111111111..11111
466 unsigned TypeBits = C->getType()->getPrimitiveSize()*8;
467 int64_t Val = INT64_MAX; // All ones
468 Val >>= 64-TypeBits; // Shift out unwanted 1 bits...
469 return CS->getValue() == Val-1;
472 // isMinValuePlusOne - return true if this is Min+1
473 static bool isMinValuePlusOne(const ConstantInt *C) {
474 if (const ConstantUInt *CU = dyn_cast<ConstantUInt>(C))
475 return CU->getValue() == 1;
477 const ConstantSInt *CS = cast<ConstantSInt>(C);
479 // Calculate 1111111111000000000000
480 unsigned TypeBits = C->getType()->getPrimitiveSize()*8;
481 int64_t Val = -1; // All ones
482 Val <<= TypeBits-1; // Shift over to the right spot
483 return CS->getValue() == Val+1;
487 Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
488 bool Changed = SimplifyCommutative(I);
489 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
491 // and X, X = X and X, 0 == 0
492 if (Op0 == Op1 || Op1 == Constant::getNullValue(I.getType()))
493 return ReplaceInstUsesWith(I, Op1);
496 if (ConstantIntegral *RHS = dyn_cast<ConstantIntegral>(Op1)) {
497 if (RHS->isAllOnesValue())
498 return ReplaceInstUsesWith(I, Op0);
500 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
501 Value *X = Op0I->getOperand(0);
502 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
503 if (Op0I->getOpcode() == Instruction::Xor) {
504 if ((*RHS & *Op0CI)->isNullValue()) {
505 // (X ^ C1) & C2 --> (X & C2) iff (C1&C2) == 0
506 return BinaryOperator::create(Instruction::And, X, RHS);
507 } else if (isOnlyUse(Op0)) {
508 // (X ^ C1) & C2 --> (X & C2) ^ (C1&C2)
509 std::string Op0Name = Op0I->getName(); Op0I->setName("");
510 Instruction *And = BinaryOperator::create(Instruction::And,
512 InsertNewInstBefore(And, I);
513 return BinaryOperator::create(Instruction::Xor, And, *RHS & *Op0CI);
515 } else if (Op0I->getOpcode() == Instruction::Or) {
516 // (X | C1) & C2 --> X & C2 iff C1 & C1 == 0
517 if ((*RHS & *Op0CI)->isNullValue())
518 return BinaryOperator::create(Instruction::And, X, RHS);
520 Constant *Together = *RHS & *Op0CI;
521 if (Together == RHS) // (X | C) & C --> C
522 return ReplaceInstUsesWith(I, RHS);
524 if (isOnlyUse(Op0)) {
525 if (Together != Op0CI) {
526 // (X | C1) & C2 --> (X | (C1&C2)) & C2
527 std::string Op0Name = Op0I->getName(); Op0I->setName("");
528 Instruction *Or = BinaryOperator::create(Instruction::Or, X,
530 InsertNewInstBefore(Or, I);
531 return BinaryOperator::create(Instruction::And, Or, RHS);
538 Value *Op0NotVal = dyn_castNotVal(Op0);
539 Value *Op1NotVal = dyn_castNotVal(Op1);
541 // (~A & ~B) == (~(A | B)) - Demorgan's Law
542 if (Op0NotVal && Op1NotVal && isOnlyUse(Op0) && isOnlyUse(Op1)) {
543 Instruction *Or = BinaryOperator::create(Instruction::Or, Op0NotVal,
544 Op1NotVal,I.getName()+".demorgan");
545 InsertNewInstBefore(Or, I);
546 return BinaryOperator::createNot(Or);
549 if (Op0NotVal == Op1 || Op1NotVal == Op0) // A & ~A == ~A & A == 0
550 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
552 return Changed ? &I : 0;
557 Instruction *InstCombiner::visitOr(BinaryOperator &I) {
558 bool Changed = SimplifyCommutative(I);
559 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
561 // or X, X = X or X, 0 == X
562 if (Op0 == Op1 || Op1 == Constant::getNullValue(I.getType()))
563 return ReplaceInstUsesWith(I, Op0);
566 if (ConstantIntegral *RHS = dyn_cast<ConstantIntegral>(Op1)) {
567 if (RHS->isAllOnesValue())
568 return ReplaceInstUsesWith(I, Op1);
570 if (Instruction *Op0I = dyn_cast<Instruction>(Op0)) {
571 // (X & C1) | C2 --> (X | C2) & (C1|C2)
572 if (Op0I->getOpcode() == Instruction::And && isOnlyUse(Op0))
573 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) {
574 std::string Op0Name = Op0I->getName(); Op0I->setName("");
575 Instruction *Or = BinaryOperator::create(Instruction::Or,
576 Op0I->getOperand(0), RHS,
578 InsertNewInstBefore(Or, I);
579 return BinaryOperator::create(Instruction::And, Or, *RHS | *Op0CI);
582 // (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)
583 if (Op0I->getOpcode() == Instruction::Xor && isOnlyUse(Op0))
584 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) {
585 std::string Op0Name = Op0I->getName(); Op0I->setName("");
586 Instruction *Or = BinaryOperator::create(Instruction::Or,
587 Op0I->getOperand(0), RHS,
589 InsertNewInstBefore(Or, I);
590 return BinaryOperator::create(Instruction::Xor, Or, *Op0CI & *~*RHS);
595 Value *Op0NotVal = dyn_castNotVal(Op0);
596 Value *Op1NotVal = dyn_castNotVal(Op1);
598 if (Op1 == Op0NotVal) // ~A | A == -1
599 return ReplaceInstUsesWith(I,
600 ConstantIntegral::getAllOnesValue(I.getType()));
602 if (Op0 == Op1NotVal) // A | ~A == -1
603 return ReplaceInstUsesWith(I,
604 ConstantIntegral::getAllOnesValue(I.getType()));
606 // (~A | ~B) == (~(A & B)) - Demorgan's Law
607 if (Op0NotVal && Op1NotVal && isOnlyUse(Op0) && isOnlyUse(Op1)) {
608 Instruction *And = BinaryOperator::create(Instruction::And, Op0NotVal,
609 Op1NotVal,I.getName()+".demorgan",
611 WorkList.push_back(And);
612 return BinaryOperator::createNot(And);
615 return Changed ? &I : 0;
620 Instruction *InstCombiner::visitXor(BinaryOperator &I) {
621 bool Changed = SimplifyCommutative(I);
622 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
626 return ReplaceInstUsesWith(I, Constant::getNullValue(I.getType()));
628 if (ConstantIntegral *RHS = dyn_cast<ConstantIntegral>(Op1)) {
630 if (RHS->isNullValue())
631 return ReplaceInstUsesWith(I, Op0);
633 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
634 // xor (setcc A, B), true = not (setcc A, B) = setncc A, B
635 if (SetCondInst *SCI = dyn_cast<SetCondInst>(Op0I))
636 if (RHS == ConstantBool::True && SCI->use_size() == 1)
637 return new SetCondInst(SCI->getInverseCondition(),
638 SCI->getOperand(0), SCI->getOperand(1));
640 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
641 if (Op0I->getOpcode() == Instruction::And) {
642 // (X & C1) ^ C2 --> (X & C1) | C2 iff (C1&C2) == 0
643 if ((*RHS & *Op0CI)->isNullValue())
644 return BinaryOperator::create(Instruction::Or, Op0, RHS);
645 } else if (Op0I->getOpcode() == Instruction::Or) {
646 // (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2
647 if ((*RHS & *Op0CI) == RHS)
648 return BinaryOperator::create(Instruction::And, Op0, ~*RHS);
653 if (Value *X = dyn_castNotVal(Op0)) // ~A ^ A == -1
655 return ReplaceInstUsesWith(I,
656 ConstantIntegral::getAllOnesValue(I.getType()));
658 if (Value *X = dyn_castNotVal(Op1)) // A ^ ~A == -1
660 return ReplaceInstUsesWith(I,
661 ConstantIntegral::getAllOnesValue(I.getType()));
663 if (Instruction *Op1I = dyn_cast<Instruction>(Op1))
664 if (Op1I->getOpcode() == Instruction::Or)
665 if (Op1I->getOperand(0) == Op0) { // B^(B|A) == (A|B)^B
666 cast<BinaryOperator>(Op1I)->swapOperands();
669 } else if (Op1I->getOperand(1) == Op0) { // B^(A|B) == (A|B)^B
674 if (Instruction *Op0I = dyn_cast<Instruction>(Op0))
675 if (Op0I->getOpcode() == Instruction::Or && Op0I->use_size() == 1) {
676 if (Op0I->getOperand(0) == Op1) // (B|A)^B == (A|B)^B
677 cast<BinaryOperator>(Op0I)->swapOperands();
678 if (Op0I->getOperand(1) == Op1) { // (A|B)^B == A & ~B
679 Value *NotB = BinaryOperator::createNot(Op1, Op1->getName()+".not", &I);
680 WorkList.push_back(cast<Instruction>(NotB));
681 return BinaryOperator::create(Instruction::And, Op0I->getOperand(0),
686 // (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1^C2 == 0
687 if (Constant *C1 = dyn_castMaskingAnd(Op0))
688 if (Constant *C2 = dyn_castMaskingAnd(Op1))
689 if (ConstantExpr::get(Instruction::And, C1, C2)->isNullValue())
690 return BinaryOperator::create(Instruction::Or, Op0, Op1);
692 return Changed ? &I : 0;
695 // AddOne, SubOne - Add or subtract a constant one from an integer constant...
696 static Constant *AddOne(ConstantInt *C) {
697 Constant *Result = ConstantExpr::get(Instruction::Add, C,
698 ConstantInt::get(C->getType(), 1));
699 assert(Result && "Constant folding integer addition failed!");
702 static Constant *SubOne(ConstantInt *C) {
703 Constant *Result = ConstantExpr::get(Instruction::Sub, C,
704 ConstantInt::get(C->getType(), 1));
705 assert(Result && "Constant folding integer addition failed!");
709 // isTrueWhenEqual - Return true if the specified setcondinst instruction is
710 // true when both operands are equal...
712 static bool isTrueWhenEqual(Instruction &I) {
713 return I.getOpcode() == Instruction::SetEQ ||
714 I.getOpcode() == Instruction::SetGE ||
715 I.getOpcode() == Instruction::SetLE;
718 Instruction *InstCombiner::visitSetCondInst(BinaryOperator &I) {
719 bool Changed = SimplifyCommutative(I);
720 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
721 const Type *Ty = Op0->getType();
725 return ReplaceInstUsesWith(I, ConstantBool::get(isTrueWhenEqual(I)));
727 // setcc <global*>, 0 - Global value addresses are never null!
728 if (isa<GlobalValue>(Op0) && isa<ConstantPointerNull>(Op1))
729 return ReplaceInstUsesWith(I, ConstantBool::get(!isTrueWhenEqual(I)));
731 // setcc's with boolean values can always be turned into bitwise operations
732 if (Ty == Type::BoolTy) {
733 // If this is <, >, or !=, we can change this into a simple xor instruction
734 if (!isTrueWhenEqual(I))
735 return BinaryOperator::create(Instruction::Xor, Op0, Op1, I.getName());
737 // Otherwise we need to make a temporary intermediate instruction and insert
738 // it into the instruction stream. This is what we are after:
740 // seteq bool %A, %B -> ~(A^B)
741 // setle bool %A, %B -> ~A | B
742 // setge bool %A, %B -> A | ~B
744 if (I.getOpcode() == Instruction::SetEQ) { // seteq case
745 Instruction *Xor = BinaryOperator::create(Instruction::Xor, Op0, Op1,
747 InsertNewInstBefore(Xor, I);
748 return BinaryOperator::createNot(Xor, I.getName());
751 // Handle the setXe cases...
752 assert(I.getOpcode() == Instruction::SetGE ||
753 I.getOpcode() == Instruction::SetLE);
755 if (I.getOpcode() == Instruction::SetGE)
756 std::swap(Op0, Op1); // Change setge -> setle
758 // Now we just have the SetLE case.
759 Instruction *Not = BinaryOperator::createNot(Op0, I.getName()+"tmp");
760 InsertNewInstBefore(Not, I);
761 return BinaryOperator::create(Instruction::Or, Not, Op1, I.getName());
764 // Check to see if we are doing one of many comparisons against constant
765 // integers at the end of their ranges...
767 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op1)) {
768 // Simplify seteq and setne instructions...
769 if (I.getOpcode() == Instruction::SetEQ ||
770 I.getOpcode() == Instruction::SetNE) {
771 bool isSetNE = I.getOpcode() == Instruction::SetNE;
773 if (CI->isNullValue()) { // Simplify [seteq|setne] X, 0
774 CastInst *Val = new CastInst(Op0, Type::BoolTy, I.getName()+".not");
775 if (isSetNE) return Val;
777 // seteq X, 0 -> not (cast X to bool)
778 InsertNewInstBefore(Val, I);
779 return BinaryOperator::createNot(Val, I.getName());
782 // If the first operand is (and|or|xor) with a constant, and the second
783 // operand is a constant, simplify a bit.
784 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op0))
785 if (ConstantInt *BOC = dyn_cast<ConstantInt>(BO->getOperand(1)))
786 if (BO->getOpcode() == Instruction::Or) {
787 // If bits are being or'd in that are not present in the constant we
788 // are comparing against, then the comparison could never succeed!
789 if (!(*BOC & *~*CI)->isNullValue())
790 return ReplaceInstUsesWith(I, ConstantBool::get(isSetNE));
791 } else if (BO->getOpcode() == Instruction::And) {
792 // If bits are being compared against that are and'd out, then the
793 // comparison can never succeed!
794 if (!(*CI & *~*BOC)->isNullValue())
795 return ReplaceInstUsesWith(I, ConstantBool::get(isSetNE));
796 } else if (BO->getOpcode() == Instruction::Xor) {
797 // For the xor case, we can always just xor the two constants
798 // together, potentially eliminating the explicit xor.
799 return BinaryOperator::create(I.getOpcode(), BO->getOperand(0),
804 // Check to see if we are comparing against the minimum or maximum value...
805 if (CI->isMinValue()) {
806 if (I.getOpcode() == Instruction::SetLT) // A < MIN -> FALSE
807 return ReplaceInstUsesWith(I, ConstantBool::False);
808 if (I.getOpcode() == Instruction::SetGE) // A >= MIN -> TRUE
809 return ReplaceInstUsesWith(I, ConstantBool::True);
810 if (I.getOpcode() == Instruction::SetLE) // A <= MIN -> A == MIN
811 return BinaryOperator::create(Instruction::SetEQ, Op0,Op1, I.getName());
812 if (I.getOpcode() == Instruction::SetGT) // A > MIN -> A != MIN
813 return BinaryOperator::create(Instruction::SetNE, Op0,Op1, I.getName());
815 } else if (CI->isMaxValue()) {
816 if (I.getOpcode() == Instruction::SetGT) // A > MAX -> FALSE
817 return ReplaceInstUsesWith(I, ConstantBool::False);
818 if (I.getOpcode() == Instruction::SetLE) // A <= MAX -> TRUE
819 return ReplaceInstUsesWith(I, ConstantBool::True);
820 if (I.getOpcode() == Instruction::SetGE) // A >= MAX -> A == MAX
821 return BinaryOperator::create(Instruction::SetEQ, Op0,Op1, I.getName());
822 if (I.getOpcode() == Instruction::SetLT) // A < MAX -> A != MAX
823 return BinaryOperator::create(Instruction::SetNE, Op0,Op1, I.getName());
825 // Comparing against a value really close to min or max?
826 } else if (isMinValuePlusOne(CI)) {
827 if (I.getOpcode() == Instruction::SetLT) // A < MIN+1 -> A == MIN
828 return BinaryOperator::create(Instruction::SetEQ, Op0,
829 SubOne(CI), I.getName());
830 if (I.getOpcode() == Instruction::SetGE) // A >= MIN-1 -> A != MIN
831 return BinaryOperator::create(Instruction::SetNE, Op0,
832 SubOne(CI), I.getName());
834 } else if (isMaxValueMinusOne(CI)) {
835 if (I.getOpcode() == Instruction::SetGT) // A > MAX-1 -> A == MAX
836 return BinaryOperator::create(Instruction::SetEQ, Op0,
837 AddOne(CI), I.getName());
838 if (I.getOpcode() == Instruction::SetLE) // A <= MAX-1 -> A != MAX
839 return BinaryOperator::create(Instruction::SetNE, Op0,
840 AddOne(CI), I.getName());
844 return Changed ? &I : 0;
849 Instruction *InstCombiner::visitShiftInst(ShiftInst &I) {
850 assert(I.getOperand(1)->getType() == Type::UByteTy);
851 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
853 // shl X, 0 == X and shr X, 0 == X
854 // shl 0, X == 0 and shr 0, X == 0
855 if (Op1 == Constant::getNullValue(Type::UByteTy) ||
856 Op0 == Constant::getNullValue(Op0->getType()))
857 return ReplaceInstUsesWith(I, Op0);
859 // If this is a shift of a shift, see if we can fold the two together...
860 if (ShiftInst *Op0SI = dyn_cast<ShiftInst>(Op0)) {
861 if (isa<Constant>(Op1) && isa<Constant>(Op0SI->getOperand(1))) {
862 ConstantUInt *ShiftAmt1C = cast<ConstantUInt>(Op0SI->getOperand(1));
863 unsigned ShiftAmt1 = ShiftAmt1C->getValue();
864 unsigned ShiftAmt2 = cast<ConstantUInt>(Op1)->getValue();
866 // Check for (A << c1) << c2 and (A >> c1) >> c2
867 if (I.getOpcode() == Op0SI->getOpcode()) {
868 unsigned Amt = ShiftAmt1+ShiftAmt2; // Fold into one big shift...
869 return new ShiftInst(I.getOpcode(), Op0SI->getOperand(0),
870 ConstantUInt::get(Type::UByteTy, Amt));
873 if (I.getType()->isUnsigned()) { // Check for (A << c1) >> c2 or visaversa
874 // Calculate bitmask for what gets shifted off the edge...
875 Constant *C = ConstantIntegral::getAllOnesValue(I.getType());
876 if (I.getOpcode() == Instruction::Shr)
877 C = ConstantExpr::getShift(Instruction::Shr, C, ShiftAmt1C);
879 C = ConstantExpr::getShift(Instruction::Shl, C, ShiftAmt1C);
882 BinaryOperator::create(Instruction::And, Op0SI->getOperand(0),
883 C, Op0SI->getOperand(0)->getName()+".mask",&I);
884 WorkList.push_back(Mask);
886 // Figure out what flavor of shift we should use...
887 if (ShiftAmt1 == ShiftAmt2)
888 return ReplaceInstUsesWith(I, Mask); // (A << c) >> c === A & c2
889 else if (ShiftAmt1 < ShiftAmt2) {
890 return new ShiftInst(I.getOpcode(), Mask,
891 ConstantUInt::get(Type::UByteTy, ShiftAmt2-ShiftAmt1));
893 return new ShiftInst(Op0SI->getOpcode(), Mask,
894 ConstantUInt::get(Type::UByteTy, ShiftAmt1-ShiftAmt2));
900 // shl uint X, 32 = 0 and shr ubyte Y, 9 = 0, ... just don't eliminate shr of
903 if (ConstantUInt *CUI = dyn_cast<ConstantUInt>(Op1)) {
904 unsigned TypeBits = Op0->getType()->getPrimitiveSize()*8;
905 if (CUI->getValue() >= TypeBits &&
906 (!Op0->getType()->isSigned() || I.getOpcode() == Instruction::Shl))
907 return ReplaceInstUsesWith(I, Constant::getNullValue(Op0->getType()));
909 // Check to see if we are shifting left by 1. If so, turn it into an add
911 if (I.getOpcode() == Instruction::Shl && CUI->equalsInt(1))
912 // Convert 'shl int %X, 1' to 'add int %X, %X'
913 return BinaryOperator::create(Instruction::Add, Op0, Op0, I.getName());
917 // shr int -1, X = -1 (for any arithmetic shift rights of ~0)
918 if (ConstantSInt *CSI = dyn_cast<ConstantSInt>(Op0))
919 if (I.getOpcode() == Instruction::Shr && CSI->isAllOnesValue())
920 return ReplaceInstUsesWith(I, CSI);
926 // isEliminableCastOfCast - Return true if it is valid to eliminate the CI
929 static inline bool isEliminableCastOfCast(const CastInst &CI,
930 const CastInst *CSrc) {
931 assert(CI.getOperand(0) == CSrc);
932 const Type *SrcTy = CSrc->getOperand(0)->getType();
933 const Type *MidTy = CSrc->getType();
934 const Type *DstTy = CI.getType();
936 // It is legal to eliminate the instruction if casting A->B->A if the sizes
937 // are identical and the bits don't get reinterpreted (for example
938 // int->float->int would not be allowed)
939 if (SrcTy == DstTy && SrcTy->isLosslesslyConvertibleTo(MidTy))
942 // Allow free casting and conversion of sizes as long as the sign doesn't
944 if (SrcTy->isIntegral() && MidTy->isIntegral() && DstTy->isIntegral()) {
945 unsigned SrcSize = SrcTy->getPrimitiveSize();
946 unsigned MidSize = MidTy->getPrimitiveSize();
947 unsigned DstSize = DstTy->getPrimitiveSize();
949 // Cases where we are monotonically decreasing the size of the type are
950 // always ok, regardless of what sign changes are going on.
952 if (SrcSize >= MidSize && MidSize >= DstSize)
955 // Cases where the source and destination type are the same, but the middle
956 // type is bigger are noops.
958 if (SrcSize == DstSize && MidSize > SrcSize)
961 // If we are monotonically growing, things are more complex.
963 if (SrcSize <= MidSize && MidSize <= DstSize) {
964 // We have eight combinations of signedness to worry about. Here's the
966 static const int SignTable[8] = {
967 // CODE, SrcSigned, MidSigned, DstSigned, Comment
968 1, // U U U Always ok
969 1, // U U S Always ok
970 3, // U S U Ok iff SrcSize != MidSize
971 3, // U S S Ok iff SrcSize != MidSize
973 2, // S U S Ok iff MidSize == DstSize
974 1, // S S U Always ok
975 1, // S S S Always ok
978 // Choose an action based on the current entry of the signtable that this
979 // cast of cast refers to...
980 unsigned Row = SrcTy->isSigned()*4+MidTy->isSigned()*2+DstTy->isSigned();
981 switch (SignTable[Row]) {
982 case 0: return false; // Never ok
983 case 1: return true; // Always ok
984 case 2: return MidSize == DstSize; // Ok iff MidSize == DstSize
985 case 3: // Ok iff SrcSize != MidSize
986 return SrcSize != MidSize || SrcTy == Type::BoolTy;
987 default: assert(0 && "Bad entry in sign table!");
992 // Otherwise, we cannot succeed. Specifically we do not want to allow things
993 // like: short -> ushort -> uint, because this can create wrong results if
994 // the input short is negative!
1000 // CastInst simplification
1002 Instruction *InstCombiner::visitCastInst(CastInst &CI) {
1003 Value *Src = CI.getOperand(0);
1005 // If the user is casting a value to the same type, eliminate this cast
1007 if (CI.getType() == Src->getType())
1008 return ReplaceInstUsesWith(CI, Src);
1010 // If casting the result of another cast instruction, try to eliminate this
1013 if (CastInst *CSrc = dyn_cast<CastInst>(Src)) {
1014 if (isEliminableCastOfCast(CI, CSrc)) {
1015 // This instruction now refers directly to the cast's src operand. This
1016 // has a good chance of making CSrc dead.
1017 CI.setOperand(0, CSrc->getOperand(0));
1021 // If this is an A->B->A cast, and we are dealing with integral types, try
1022 // to convert this into a logical 'and' instruction.
1024 if (CSrc->getOperand(0)->getType() == CI.getType() &&
1025 CI.getType()->isInteger() && CSrc->getType()->isInteger() &&
1026 CI.getType()->isUnsigned() && CSrc->getType()->isUnsigned() &&
1027 CSrc->getType()->getPrimitiveSize() < CI.getType()->getPrimitiveSize()){
1028 assert(CSrc->getType() != Type::ULongTy &&
1029 "Cannot have type bigger than ulong!");
1030 uint64_t AndValue = (1ULL << CSrc->getType()->getPrimitiveSize()*8)-1;
1031 Constant *AndOp = ConstantUInt::get(CI.getType(), AndValue);
1032 return BinaryOperator::create(Instruction::And, CSrc->getOperand(0),
1037 // If casting the result of a getelementptr instruction with no offset, turn
1038 // this into a cast of the original pointer!
1040 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(Src)) {
1041 bool AllZeroOperands = true;
1042 for (unsigned i = 1, e = GEP->getNumOperands(); i != e; ++i)
1043 if (!isa<Constant>(GEP->getOperand(i)) ||
1044 !cast<Constant>(GEP->getOperand(i))->isNullValue()) {
1045 AllZeroOperands = false;
1048 if (AllZeroOperands) {
1049 CI.setOperand(0, GEP->getOperand(0));
1054 // If this is a cast to bool (which is effectively a "!=0" test), then we can
1055 // perform a few optimizations...
1057 if (CI.getType() == Type::BoolTy) {
1058 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Src)) {
1059 Value *Op0 = BO->getOperand(0), *Op1 = BO->getOperand(1);
1061 switch (BO->getOpcode()) {
1062 case Instruction::Sub:
1063 case Instruction::Xor:
1064 // Replace (cast ([sub|xor] A, B) to bool) with (setne A, B)
1065 return new SetCondInst(Instruction::SetNE, Op0, Op1);
1067 // Replace (cast (add A, B) to bool) with (setne A, -B) if B is
1068 // efficiently invertible, or if the add has just this one use.
1069 case Instruction::Add:
1070 if (Value *NegVal = dyn_castNegVal(Op1))
1071 return new SetCondInst(Instruction::SetNE, Op0, NegVal);
1072 else if (Value *NegVal = dyn_castNegVal(Op0))
1073 return new SetCondInst(Instruction::SetNE, NegVal, Op1);
1074 else if (BO->use_size() == 1) {
1075 Instruction *Neg = BinaryOperator::createNeg(Op1, BO->getName());
1077 InsertNewInstBefore(Neg, CI);
1078 return new SetCondInst(Instruction::SetNE, Op0, Neg);
1082 case Instruction::And:
1083 // Replace (cast (and X, (1 << size(X)-1)) to bool) with x < 0,
1084 // converting X to be a signed value as appropriate. Don't worry about
1085 // bool values, as they will be optimized other ways if they occur in
1086 // this configuration.
1087 if (ConstantInt *CInt = dyn_cast<ConstantInt>(Op1))
1088 if (isSignBit(CInt)) {
1089 // If 'X' is not signed, insert a cast now...
1090 if (!CInt->getType()->isSigned()) {
1092 switch (CInt->getType()->getPrimitiveID()) {
1093 case Type::UByteTyID: DestTy = Type::SByteTy; break;
1094 case Type::UShortTyID: DestTy = Type::ShortTy; break;
1095 case Type::UIntTyID: DestTy = Type::IntTy; break;
1096 case Type::ULongTyID: DestTy = Type::LongTy; break;
1097 default: assert(0 && "Invalid unsigned integer type!"); abort();
1099 CastInst *NewCI = new CastInst(Op0, DestTy,
1100 Op0->getName()+".signed");
1101 InsertNewInstBefore(NewCI, CI);
1104 return new SetCondInst(Instruction::SetLT, Op0,
1105 Constant::getNullValue(Op0->getType()));
1116 // CallInst simplification
1118 Instruction *InstCombiner::visitCallInst(CallInst &CI) {
1119 if (transformConstExprCastCall(&CI)) return 0;
1123 // InvokeInst simplification
1125 Instruction *InstCombiner::visitInvokeInst(InvokeInst &II) {
1126 if (transformConstExprCastCall(&II)) return 0;
1130 // getPromotedType - Return the specified type promoted as it would be to pass
1131 // though a va_arg area...
1132 static const Type *getPromotedType(const Type *Ty) {
1133 switch (Ty->getPrimitiveID()) {
1134 case Type::SByteTyID:
1135 case Type::ShortTyID: return Type::IntTy;
1136 case Type::UByteTyID:
1137 case Type::UShortTyID: return Type::UIntTy;
1138 case Type::FloatTyID: return Type::DoubleTy;
1143 // transformConstExprCastCall - If the callee is a constexpr cast of a function,
1144 // attempt to move the cast to the arguments of the call/invoke.
1146 bool InstCombiner::transformConstExprCastCall(CallSite CS) {
1147 if (!isa<ConstantExpr>(CS.getCalledValue())) return false;
1148 ConstantExpr *CE = cast<ConstantExpr>(CS.getCalledValue());
1149 if (CE->getOpcode() != Instruction::Cast ||
1150 !isa<ConstantPointerRef>(CE->getOperand(0)))
1152 ConstantPointerRef *CPR = cast<ConstantPointerRef>(CE->getOperand(0));
1153 if (!isa<Function>(CPR->getValue())) return false;
1154 Function *Callee = cast<Function>(CPR->getValue());
1155 Instruction *Caller = CS.getInstruction();
1157 // Okay, this is a cast from a function to a different type. Unless doing so
1158 // would cause a type conversion of one of our arguments, change this call to
1159 // be a direct call with arguments casted to the appropriate types.
1161 const FunctionType *FT = Callee->getFunctionType();
1162 const Type *OldRetTy = Caller->getType();
1164 if (Callee->isExternal() &&
1165 !OldRetTy->isLosslesslyConvertibleTo(FT->getReturnType()))
1166 return false; // Cannot transform this return value...
1168 unsigned NumActualArgs = unsigned(CS.arg_end()-CS.arg_begin());
1169 unsigned NumCommonArgs = std::min(FT->getNumParams(), NumActualArgs);
1171 CallSite::arg_iterator AI = CS.arg_begin();
1172 for (unsigned i = 0, e = NumCommonArgs; i != e; ++i, ++AI) {
1173 const Type *ParamTy = FT->getParamType(i);
1174 bool isConvertible = (*AI)->getType()->isLosslesslyConvertibleTo(ParamTy);
1175 if (Callee->isExternal() && !isConvertible) return false;
1178 if (FT->getNumParams() < NumActualArgs && !FT->isVarArg() &&
1179 Callee->isExternal())
1180 return false; // Do not delete arguments unless we have a function body...
1182 // Okay, we decided that this is a safe thing to do: go ahead and start
1183 // inserting cast instructions as necessary...
1184 std::vector<Value*> Args;
1185 Args.reserve(NumActualArgs);
1187 AI = CS.arg_begin();
1188 for (unsigned i = 0; i != NumCommonArgs; ++i, ++AI) {
1189 const Type *ParamTy = FT->getParamType(i);
1190 if ((*AI)->getType() == ParamTy) {
1191 Args.push_back(*AI);
1193 Instruction *Cast = new CastInst(*AI, ParamTy, "tmp");
1194 InsertNewInstBefore(Cast, *Caller);
1195 Args.push_back(Cast);
1199 // If the function takes more arguments than the call was taking, add them
1201 for (unsigned i = NumCommonArgs; i != FT->getNumParams(); ++i)
1202 Args.push_back(Constant::getNullValue(FT->getParamType(i)));
1204 // If we are removing arguments to the function, emit an obnoxious warning...
1205 if (FT->getNumParams() < NumActualArgs)
1206 if (!FT->isVarArg()) {
1207 std::cerr << "WARNING: While resolving call to function '"
1208 << Callee->getName() << "' arguments were dropped!\n";
1210 // Add all of the arguments in their promoted form to the arg list...
1211 for (unsigned i = FT->getNumParams(); i != NumActualArgs; ++i, ++AI) {
1212 const Type *PTy = getPromotedType((*AI)->getType());
1213 if (PTy != (*AI)->getType()) {
1214 // Must promote to pass through va_arg area!
1215 Instruction *Cast = new CastInst(*AI, PTy, "tmp");
1216 InsertNewInstBefore(Cast, *Caller);
1217 Args.push_back(Cast);
1219 Args.push_back(*AI);
1224 if (FT->getReturnType() == Type::VoidTy)
1225 Caller->setName(""); // Void type should not have a name...
1228 if (InvokeInst *II = dyn_cast<InvokeInst>(Caller)) {
1229 NC = new InvokeInst(Callee, II->getNormalDest(), II->getExceptionalDest(),
1230 Args, Caller->getName(), Caller);
1232 NC = new CallInst(Callee, Args, Caller->getName(), Caller);
1235 // Insert a cast of the return type as necessary...
1237 if (Caller->getType() != NV->getType() && !Caller->use_empty()) {
1238 if (NV->getType() != Type::VoidTy) {
1239 NV = NC = new CastInst(NC, Caller->getType(), "tmp");
1240 InsertNewInstBefore(NC, *Caller);
1241 AddUsesToWorkList(*Caller);
1243 NV = Constant::getNullValue(Caller->getType());
1247 if (Caller->getType() != Type::VoidTy && !Caller->use_empty())
1248 Caller->replaceAllUsesWith(NV);
1249 Caller->getParent()->getInstList().erase(Caller);
1250 removeFromWorkList(Caller);
1256 // PHINode simplification
1258 Instruction *InstCombiner::visitPHINode(PHINode &PN) {
1259 // If the PHI node only has one incoming value, eliminate the PHI node...
1260 if (PN.getNumIncomingValues() == 1)
1261 return ReplaceInstUsesWith(PN, PN.getIncomingValue(0));
1263 // Otherwise if all of the incoming values are the same for the PHI, replace
1264 // the PHI node with the incoming value.
1267 for (unsigned i = 0, e = PN.getNumIncomingValues(); i != e; ++i)
1268 if (PN.getIncomingValue(i) != &PN) // Not the PHI node itself...
1269 if (InVal && PN.getIncomingValue(i) != InVal)
1270 return 0; // Not the same, bail out.
1272 InVal = PN.getIncomingValue(i);
1274 // The only case that could cause InVal to be null is if we have a PHI node
1275 // that only has entries for itself. In this case, there is no entry into the
1276 // loop, so kill the PHI.
1278 if (InVal == 0) InVal = Constant::getNullValue(PN.getType());
1280 // All of the incoming values are the same, replace the PHI node now.
1281 return ReplaceInstUsesWith(PN, InVal);
1285 Instruction *InstCombiner::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1286 // Is it 'getelementptr %P, long 0' or 'getelementptr %P'
1287 // If so, eliminate the noop.
1288 if ((GEP.getNumOperands() == 2 &&
1289 GEP.getOperand(1) == Constant::getNullValue(Type::LongTy)) ||
1290 GEP.getNumOperands() == 1)
1291 return ReplaceInstUsesWith(GEP, GEP.getOperand(0));
1293 // Combine Indices - If the source pointer to this getelementptr instruction
1294 // is a getelementptr instruction, combine the indices of the two
1295 // getelementptr instructions into a single instruction.
1297 if (GetElementPtrInst *Src = dyn_cast<GetElementPtrInst>(GEP.getOperand(0))) {
1298 std::vector<Value *> Indices;
1300 // Can we combine the two pointer arithmetics offsets?
1301 if (Src->getNumOperands() == 2 && isa<Constant>(Src->getOperand(1)) &&
1302 isa<Constant>(GEP.getOperand(1))) {
1303 // Replace: gep (gep %P, long C1), long C2, ...
1304 // With: gep %P, long (C1+C2), ...
1305 Value *Sum = ConstantExpr::get(Instruction::Add,
1306 cast<Constant>(Src->getOperand(1)),
1307 cast<Constant>(GEP.getOperand(1)));
1308 assert(Sum && "Constant folding of longs failed!?");
1309 GEP.setOperand(0, Src->getOperand(0));
1310 GEP.setOperand(1, Sum);
1311 AddUsesToWorkList(*Src); // Reduce use count of Src
1313 } else if (Src->getNumOperands() == 2) {
1314 // Replace: gep (gep %P, long B), long A, ...
1315 // With: T = long A+B; gep %P, T, ...
1317 Value *Sum = BinaryOperator::create(Instruction::Add, Src->getOperand(1),
1319 Src->getName()+".sum", &GEP);
1320 GEP.setOperand(0, Src->getOperand(0));
1321 GEP.setOperand(1, Sum);
1322 WorkList.push_back(cast<Instruction>(Sum));
1324 } else if (*GEP.idx_begin() == Constant::getNullValue(Type::LongTy) &&
1325 Src->getNumOperands() != 1) {
1326 // Otherwise we can do the fold if the first index of the GEP is a zero
1327 Indices.insert(Indices.end(), Src->idx_begin(), Src->idx_end());
1328 Indices.insert(Indices.end(), GEP.idx_begin()+1, GEP.idx_end());
1329 } else if (Src->getOperand(Src->getNumOperands()-1) ==
1330 Constant::getNullValue(Type::LongTy)) {
1331 // If the src gep ends with a constant array index, merge this get into
1332 // it, even if we have a non-zero array index.
1333 Indices.insert(Indices.end(), Src->idx_begin(), Src->idx_end()-1);
1334 Indices.insert(Indices.end(), GEP.idx_begin(), GEP.idx_end());
1337 if (!Indices.empty())
1338 return new GetElementPtrInst(Src->getOperand(0), Indices, GEP.getName());
1340 } else if (GlobalValue *GV = dyn_cast<GlobalValue>(GEP.getOperand(0))) {
1341 // GEP of global variable. If all of the indices for this GEP are
1342 // constants, we can promote this to a constexpr instead of an instruction.
1344 // Scan for nonconstants...
1345 std::vector<Constant*> Indices;
1346 User::op_iterator I = GEP.idx_begin(), E = GEP.idx_end();
1347 for (; I != E && isa<Constant>(*I); ++I)
1348 Indices.push_back(cast<Constant>(*I));
1350 if (I == E) { // If they are all constants...
1352 ConstantExpr::getGetElementPtr(ConstantPointerRef::get(GV), Indices);
1354 // Replace all uses of the GEP with the new constexpr...
1355 return ReplaceInstUsesWith(GEP, CE);
1362 Instruction *InstCombiner::visitAllocationInst(AllocationInst &AI) {
1363 // Convert: malloc Ty, C - where C is a constant != 1 into: malloc [C x Ty], 1
1364 if (AI.isArrayAllocation()) // Check C != 1
1365 if (const ConstantUInt *C = dyn_cast<ConstantUInt>(AI.getArraySize())) {
1366 const Type *NewTy = ArrayType::get(AI.getAllocatedType(), C->getValue());
1367 AllocationInst *New = 0;
1369 // Create and insert the replacement instruction...
1370 if (isa<MallocInst>(AI))
1371 New = new MallocInst(NewTy, 0, AI.getName(), &AI);
1373 assert(isa<AllocaInst>(AI) && "Unknown type of allocation inst!");
1374 New = new AllocaInst(NewTy, 0, AI.getName(), &AI);
1377 // Scan to the end of the allocation instructions, to skip over a block of
1378 // allocas if possible...
1380 BasicBlock::iterator It = New;
1381 while (isa<AllocationInst>(*It)) ++It;
1383 // Now that I is pointing to the first non-allocation-inst in the block,
1384 // insert our getelementptr instruction...
1386 std::vector<Value*> Idx(2, Constant::getNullValue(Type::LongTy));
1387 Value *V = new GetElementPtrInst(New, Idx, New->getName()+".sub", It);
1389 // Now make everything use the getelementptr instead of the original
1391 ReplaceInstUsesWith(AI, V);
1397 /// GetGEPGlobalInitializer - Given a constant, and a getelementptr
1398 /// constantexpr, return the constant value being addressed by the constant
1399 /// expression, or null if something is funny.
1401 static Constant *GetGEPGlobalInitializer(Constant *C, ConstantExpr *CE) {
1402 if (CE->getOperand(1) != Constant::getNullValue(Type::LongTy))
1403 return 0; // Do not allow stepping over the value!
1405 // Loop over all of the operands, tracking down which value we are
1407 for (unsigned i = 2, e = CE->getNumOperands(); i != e; ++i)
1408 if (ConstantUInt *CU = dyn_cast<ConstantUInt>(CE->getOperand(i))) {
1409 ConstantStruct *CS = cast<ConstantStruct>(C);
1410 if (CU->getValue() >= CS->getValues().size()) return 0;
1411 C = cast<Constant>(CS->getValues()[CU->getValue()]);
1412 } else if (ConstantSInt *CS = dyn_cast<ConstantSInt>(CE->getOperand(i))) {
1413 ConstantArray *CA = cast<ConstantArray>(C);
1414 if ((uint64_t)CS->getValue() >= CA->getValues().size()) return 0;
1415 C = cast<Constant>(CA->getValues()[CS->getValue()]);
1421 Instruction *InstCombiner::visitLoadInst(LoadInst &LI) {
1422 Value *Op = LI.getOperand(0);
1423 if (ConstantPointerRef *CPR = dyn_cast<ConstantPointerRef>(Op))
1424 Op = CPR->getValue();
1426 // Instcombine load (constant global) into the value loaded...
1427 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(Op))
1428 if (GV->isConstant() && !GV->isExternal())
1429 return ReplaceInstUsesWith(LI, GV->getInitializer());
1431 // Instcombine load (constantexpr_GEP global, 0, ...) into the value loaded...
1432 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(Op))
1433 if (CE->getOpcode() == Instruction::GetElementPtr)
1434 if (ConstantPointerRef *G=dyn_cast<ConstantPointerRef>(CE->getOperand(0)))
1435 if (GlobalVariable *GV = dyn_cast<GlobalVariable>(G->getValue()))
1436 if (GV->isConstant() && !GV->isExternal())
1437 if (Constant *V = GetGEPGlobalInitializer(GV->getInitializer(), CE))
1438 return ReplaceInstUsesWith(LI, V);
1443 Instruction *InstCombiner::visitBranchInst(BranchInst &BI) {
1444 // Change br (not X), label True, label False to: br X, label False, True
1445 if (BI.isConditional() && !isa<Constant>(BI.getCondition()))
1446 if (Value *V = dyn_castNotVal(BI.getCondition())) {
1447 BasicBlock *TrueDest = BI.getSuccessor(0);
1448 BasicBlock *FalseDest = BI.getSuccessor(1);
1449 // Swap Destinations and condition...
1451 BI.setSuccessor(0, FalseDest);
1452 BI.setSuccessor(1, TrueDest);
1459 void InstCombiner::removeFromWorkList(Instruction *I) {
1460 WorkList.erase(std::remove(WorkList.begin(), WorkList.end(), I),
1464 bool InstCombiner::runOnFunction(Function &F) {
1465 bool Changed = false;
1467 WorkList.insert(WorkList.end(), inst_begin(F), inst_end(F));
1469 while (!WorkList.empty()) {
1470 Instruction *I = WorkList.back(); // Get an instruction from the worklist
1471 WorkList.pop_back();
1473 // Check to see if we can DCE or ConstantPropagate the instruction...
1474 // Check to see if we can DIE the instruction...
1475 if (isInstructionTriviallyDead(I)) {
1476 // Add operands to the worklist...
1477 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
1478 if (Instruction *Op = dyn_cast<Instruction>(I->getOperand(i)))
1479 WorkList.push_back(Op);
1482 BasicBlock::iterator BBI = I;
1483 if (dceInstruction(BBI)) {
1484 removeFromWorkList(I);
1489 // Instruction isn't dead, see if we can constant propagate it...
1490 if (Constant *C = ConstantFoldInstruction(I)) {
1491 // Add operands to the worklist...
1492 for (unsigned i = 0, e = I->getNumOperands(); i != e; ++i)
1493 if (Instruction *Op = dyn_cast<Instruction>(I->getOperand(i)))
1494 WorkList.push_back(Op);
1495 ReplaceInstUsesWith(*I, C);
1498 BasicBlock::iterator BBI = I;
1499 if (dceInstruction(BBI)) {
1500 removeFromWorkList(I);
1505 // Now that we have an instruction, try combining it to simplify it...
1506 if (Instruction *Result = visit(*I)) {
1508 // Should we replace the old instruction with a new one?
1510 // Instructions can end up on the worklist more than once. Make sure
1511 // we do not process an instruction that has been deleted.
1512 removeFromWorkList(I);
1513 ReplaceInstWithInst(I, Result);
1515 BasicBlock::iterator II = I;
1517 // If the instruction was modified, it's possible that it is now dead.
1518 // if so, remove it.
1519 if (dceInstruction(II)) {
1520 // Instructions may end up in the worklist more than once. Erase them
1522 removeFromWorkList(I);
1528 WorkList.push_back(Result);
1529 AddUsesToWorkList(*Result);
1538 Pass *createInstructionCombiningPass() {
1539 return new InstCombiner();