1 //===- InstructionCombining.cpp - Combine multiple instructions -----------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // InstructionCombining - Combine instructions to form fewer, simple
11 // instructions. This pass does not modify the CFG. This pass is where
12 // algebraic simplification happens.
14 // This pass combines things like:
20 // This is a simple worklist driven algorithm.
22 // This pass guarantees that the following canonicalizations are performed on
24 // 1. If a binary operator has a constant operand, it is moved to the RHS
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.
27 // 3. Compare instructions are converted from <,>,<=,>= to ==,!= if possible
28 // 4. All cmp instructions on boolean values are replaced with logical ops
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
34 //===----------------------------------------------------------------------===//
36 #include "llvm/Transforms/InstCombine/InstCombine.h"
37 #include "InstCombineInternal.h"
38 #include "llvm-c/Initialization.h"
39 #include "llvm/ADT/SmallPtrSet.h"
40 #include "llvm/ADT/Statistic.h"
41 #include "llvm/ADT/StringSwitch.h"
42 #include "llvm/Analysis/AssumptionCache.h"
43 #include "llvm/Analysis/CFG.h"
44 #include "llvm/Analysis/ConstantFolding.h"
45 #include "llvm/Analysis/EHPersonalities.h"
46 #include "llvm/Analysis/GlobalsModRef.h"
47 #include "llvm/Analysis/InstructionSimplify.h"
48 #include "llvm/Analysis/LoopInfo.h"
49 #include "llvm/Analysis/MemoryBuiltins.h"
50 #include "llvm/Analysis/TargetLibraryInfo.h"
51 #include "llvm/Analysis/ValueTracking.h"
52 #include "llvm/IR/CFG.h"
53 #include "llvm/IR/DataLayout.h"
54 #include "llvm/IR/Dominators.h"
55 #include "llvm/IR/GetElementPtrTypeIterator.h"
56 #include "llvm/IR/IntrinsicInst.h"
57 #include "llvm/IR/PatternMatch.h"
58 #include "llvm/IR/ValueHandle.h"
59 #include "llvm/Support/CommandLine.h"
60 #include "llvm/Support/Debug.h"
61 #include "llvm/Support/raw_ostream.h"
62 #include "llvm/Transforms/Scalar.h"
63 #include "llvm/Transforms/Utils/Local.h"
67 using namespace llvm::PatternMatch;
69 #define DEBUG_TYPE "instcombine"
71 STATISTIC(NumCombined , "Number of insts combined");
72 STATISTIC(NumConstProp, "Number of constant folds");
73 STATISTIC(NumDeadInst , "Number of dead inst eliminated");
74 STATISTIC(NumSunkInst , "Number of instructions sunk");
75 STATISTIC(NumExpand, "Number of expansions");
76 STATISTIC(NumFactor , "Number of factorizations");
77 STATISTIC(NumReassoc , "Number of reassociations");
79 Value *InstCombiner::EmitGEPOffset(User *GEP) {
80 return llvm::EmitGEPOffset(Builder, DL, GEP);
83 /// Return true if it is desirable to convert an integer computation from a
84 /// given bit width to a new bit width.
85 /// We don't want to convert from a legal to an illegal type for example or from
86 /// a smaller to a larger illegal type.
87 bool InstCombiner::ShouldChangeType(unsigned FromWidth,
88 unsigned ToWidth) const {
89 bool FromLegal = DL.isLegalInteger(FromWidth);
90 bool ToLegal = DL.isLegalInteger(ToWidth);
92 // If this is a legal integer from type, and the result would be an illegal
93 // type, don't do the transformation.
94 if (FromLegal && !ToLegal)
97 // Otherwise, if both are illegal, do not increase the size of the result. We
98 // do allow things like i160 -> i64, but not i64 -> i160.
99 if (!FromLegal && !ToLegal && ToWidth > FromWidth)
105 /// Return true if it is desirable to convert a computation from 'From' to 'To'.
106 /// We don't want to convert from a legal to an illegal type for example or from
107 /// a smaller to a larger illegal type.
108 bool InstCombiner::ShouldChangeType(Type *From, Type *To) const {
109 assert(From->isIntegerTy() && To->isIntegerTy());
111 unsigned FromWidth = From->getPrimitiveSizeInBits();
112 unsigned ToWidth = To->getPrimitiveSizeInBits();
113 return ShouldChangeType(FromWidth, ToWidth);
116 // Return true, if No Signed Wrap should be maintained for I.
117 // The No Signed Wrap flag can be kept if the operation "B (I.getOpcode) C",
118 // where both B and C should be ConstantInts, results in a constant that does
119 // not overflow. This function only handles the Add and Sub opcodes. For
120 // all other opcodes, the function conservatively returns false.
121 static bool MaintainNoSignedWrap(BinaryOperator &I, Value *B, Value *C) {
122 OverflowingBinaryOperator *OBO = dyn_cast<OverflowingBinaryOperator>(&I);
123 if (!OBO || !OBO->hasNoSignedWrap()) {
127 // We reason about Add and Sub Only.
128 Instruction::BinaryOps Opcode = I.getOpcode();
129 if (Opcode != Instruction::Add &&
130 Opcode != Instruction::Sub) {
134 ConstantInt *CB = dyn_cast<ConstantInt>(B);
135 ConstantInt *CC = dyn_cast<ConstantInt>(C);
141 const APInt &BVal = CB->getValue();
142 const APInt &CVal = CC->getValue();
143 bool Overflow = false;
145 if (Opcode == Instruction::Add) {
146 BVal.sadd_ov(CVal, Overflow);
148 BVal.ssub_ov(CVal, Overflow);
154 /// Conservatively clears subclassOptionalData after a reassociation or
155 /// commutation. We preserve fast-math flags when applicable as they can be
157 static void ClearSubclassDataAfterReassociation(BinaryOperator &I) {
158 FPMathOperator *FPMO = dyn_cast<FPMathOperator>(&I);
160 I.clearSubclassOptionalData();
164 FastMathFlags FMF = I.getFastMathFlags();
165 I.clearSubclassOptionalData();
166 I.setFastMathFlags(FMF);
169 /// This performs a few simplifications for operators that are associative or
172 /// Commutative operators:
174 /// 1. Order operands such that they are listed from right (least complex) to
175 /// left (most complex). This puts constants before unary operators before
176 /// binary operators.
178 /// Associative operators:
180 /// 2. Transform: "(A op B) op C" ==> "A op (B op C)" if "B op C" simplifies.
181 /// 3. Transform: "A op (B op C)" ==> "(A op B) op C" if "A op B" simplifies.
183 /// Associative and commutative operators:
185 /// 4. Transform: "(A op B) op C" ==> "(C op A) op B" if "C op A" simplifies.
186 /// 5. Transform: "A op (B op C)" ==> "B op (C op A)" if "C op A" simplifies.
187 /// 6. Transform: "(A op C1) op (B op C2)" ==> "(A op B) op (C1 op C2)"
188 /// if C1 and C2 are constants.
189 bool InstCombiner::SimplifyAssociativeOrCommutative(BinaryOperator &I) {
190 Instruction::BinaryOps Opcode = I.getOpcode();
191 bool Changed = false;
194 // Order operands such that they are listed from right (least complex) to
195 // left (most complex). This puts constants before unary operators before
197 if (I.isCommutative() && getComplexity(I.getOperand(0)) <
198 getComplexity(I.getOperand(1)))
199 Changed = !I.swapOperands();
201 BinaryOperator *Op0 = dyn_cast<BinaryOperator>(I.getOperand(0));
202 BinaryOperator *Op1 = dyn_cast<BinaryOperator>(I.getOperand(1));
204 if (I.isAssociative()) {
205 // Transform: "(A op B) op C" ==> "A op (B op C)" if "B op C" simplifies.
206 if (Op0 && Op0->getOpcode() == Opcode) {
207 Value *A = Op0->getOperand(0);
208 Value *B = Op0->getOperand(1);
209 Value *C = I.getOperand(1);
211 // Does "B op C" simplify?
212 if (Value *V = SimplifyBinOp(Opcode, B, C, DL)) {
213 // It simplifies to V. Form "A op V".
216 // Conservatively clear the optional flags, since they may not be
217 // preserved by the reassociation.
218 if (MaintainNoSignedWrap(I, B, C) &&
219 (!Op0 || (isa<BinaryOperator>(Op0) && Op0->hasNoSignedWrap()))) {
220 // Note: this is only valid because SimplifyBinOp doesn't look at
221 // the operands to Op0.
222 I.clearSubclassOptionalData();
223 I.setHasNoSignedWrap(true);
225 ClearSubclassDataAfterReassociation(I);
234 // Transform: "A op (B op C)" ==> "(A op B) op C" if "A op B" simplifies.
235 if (Op1 && Op1->getOpcode() == Opcode) {
236 Value *A = I.getOperand(0);
237 Value *B = Op1->getOperand(0);
238 Value *C = Op1->getOperand(1);
240 // Does "A op B" simplify?
241 if (Value *V = SimplifyBinOp(Opcode, A, B, DL)) {
242 // It simplifies to V. Form "V op C".
245 // Conservatively clear the optional flags, since they may not be
246 // preserved by the reassociation.
247 ClearSubclassDataAfterReassociation(I);
255 if (I.isAssociative() && I.isCommutative()) {
256 // Transform: "(A op B) op C" ==> "(C op A) op B" if "C op A" simplifies.
257 if (Op0 && Op0->getOpcode() == Opcode) {
258 Value *A = Op0->getOperand(0);
259 Value *B = Op0->getOperand(1);
260 Value *C = I.getOperand(1);
262 // Does "C op A" simplify?
263 if (Value *V = SimplifyBinOp(Opcode, C, A, DL)) {
264 // It simplifies to V. Form "V op B".
267 // Conservatively clear the optional flags, since they may not be
268 // preserved by the reassociation.
269 ClearSubclassDataAfterReassociation(I);
276 // Transform: "A op (B op C)" ==> "B op (C op A)" if "C op A" simplifies.
277 if (Op1 && Op1->getOpcode() == Opcode) {
278 Value *A = I.getOperand(0);
279 Value *B = Op1->getOperand(0);
280 Value *C = Op1->getOperand(1);
282 // Does "C op A" simplify?
283 if (Value *V = SimplifyBinOp(Opcode, C, A, DL)) {
284 // It simplifies to V. Form "B op V".
287 // Conservatively clear the optional flags, since they may not be
288 // preserved by the reassociation.
289 ClearSubclassDataAfterReassociation(I);
296 // Transform: "(A op C1) op (B op C2)" ==> "(A op B) op (C1 op C2)"
297 // if C1 and C2 are constants.
299 Op0->getOpcode() == Opcode && Op1->getOpcode() == Opcode &&
300 isa<Constant>(Op0->getOperand(1)) &&
301 isa<Constant>(Op1->getOperand(1)) &&
302 Op0->hasOneUse() && Op1->hasOneUse()) {
303 Value *A = Op0->getOperand(0);
304 Constant *C1 = cast<Constant>(Op0->getOperand(1));
305 Value *B = Op1->getOperand(0);
306 Constant *C2 = cast<Constant>(Op1->getOperand(1));
308 Constant *Folded = ConstantExpr::get(Opcode, C1, C2);
309 BinaryOperator *New = BinaryOperator::Create(Opcode, A, B);
310 if (isa<FPMathOperator>(New)) {
311 FastMathFlags Flags = I.getFastMathFlags();
312 Flags &= Op0->getFastMathFlags();
313 Flags &= Op1->getFastMathFlags();
314 New->setFastMathFlags(Flags);
316 InsertNewInstWith(New, I);
318 I.setOperand(0, New);
319 I.setOperand(1, Folded);
320 // Conservatively clear the optional flags, since they may not be
321 // preserved by the reassociation.
322 ClearSubclassDataAfterReassociation(I);
329 // No further simplifications.
334 /// Return whether "X LOp (Y ROp Z)" is always equal to
335 /// "(X LOp Y) ROp (X LOp Z)".
336 static bool LeftDistributesOverRight(Instruction::BinaryOps LOp,
337 Instruction::BinaryOps ROp) {
342 case Instruction::And:
343 // And distributes over Or and Xor.
347 case Instruction::Or:
348 case Instruction::Xor:
352 case Instruction::Mul:
353 // Multiplication distributes over addition and subtraction.
357 case Instruction::Add:
358 case Instruction::Sub:
362 case Instruction::Or:
363 // Or distributes over And.
367 case Instruction::And:
373 /// Return whether "(X LOp Y) ROp Z" is always equal to
374 /// "(X ROp Z) LOp (Y ROp Z)".
375 static bool RightDistributesOverLeft(Instruction::BinaryOps LOp,
376 Instruction::BinaryOps ROp) {
377 if (Instruction::isCommutative(ROp))
378 return LeftDistributesOverRight(ROp, LOp);
383 // (X >> Z) & (Y >> Z) -> (X&Y) >> Z for all shifts.
384 // (X >> Z) | (Y >> Z) -> (X|Y) >> Z for all shifts.
385 // (X >> Z) ^ (Y >> Z) -> (X^Y) >> Z for all shifts.
386 case Instruction::And:
387 case Instruction::Or:
388 case Instruction::Xor:
392 case Instruction::Shl:
393 case Instruction::LShr:
394 case Instruction::AShr:
398 // TODO: It would be nice to handle division, aka "(X + Y)/Z = X/Z + Y/Z",
399 // but this requires knowing that the addition does not overflow and other
404 /// This function returns identity value for given opcode, which can be used to
405 /// factor patterns like (X * 2) + X ==> (X * 2) + (X * 1) ==> X * (2 + 1).
406 static Value *getIdentityValue(Instruction::BinaryOps OpCode, Value *V) {
407 if (isa<Constant>(V))
410 if (OpCode == Instruction::Mul)
411 return ConstantInt::get(V->getType(), 1);
413 // TODO: We can handle other cases e.g. Instruction::And, Instruction::Or etc.
418 /// This function factors binary ops which can be combined using distributive
419 /// laws. This function tries to transform 'Op' based TopLevelOpcode to enable
420 /// factorization e.g for ADD(SHL(X , 2), MUL(X, 5)), When this function called
421 /// with TopLevelOpcode == Instruction::Add and Op = SHL(X, 2), transforms
422 /// SHL(X, 2) to MUL(X, 4) i.e. returns Instruction::Mul with LHS set to 'X' and
424 static Instruction::BinaryOps
425 getBinOpsForFactorization(Instruction::BinaryOps TopLevelOpcode,
426 BinaryOperator *Op, Value *&LHS, Value *&RHS) {
428 return Instruction::BinaryOpsEnd;
430 LHS = Op->getOperand(0);
431 RHS = Op->getOperand(1);
433 switch (TopLevelOpcode) {
435 return Op->getOpcode();
437 case Instruction::Add:
438 case Instruction::Sub:
439 if (Op->getOpcode() == Instruction::Shl) {
440 if (Constant *CST = dyn_cast<Constant>(Op->getOperand(1))) {
441 // The multiplier is really 1 << CST.
442 RHS = ConstantExpr::getShl(ConstantInt::get(Op->getType(), 1), CST);
443 return Instruction::Mul;
446 return Op->getOpcode();
449 // TODO: We can add other conversions e.g. shr => div etc.
452 /// This tries to simplify binary operations by factorizing out common terms
453 /// (e. g. "(A*B)+(A*C)" -> "A*(B+C)").
454 static Value *tryFactorization(InstCombiner::BuilderTy *Builder,
455 const DataLayout &DL, BinaryOperator &I,
456 Instruction::BinaryOps InnerOpcode, Value *A,
457 Value *B, Value *C, Value *D) {
459 // If any of A, B, C, D are null, we can not factor I, return early.
460 // Checking A and C should be enough.
461 if (!A || !C || !B || !D)
465 Value *SimplifiedInst = nullptr;
466 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
467 Instruction::BinaryOps TopLevelOpcode = I.getOpcode();
469 // Does "X op' Y" always equal "Y op' X"?
470 bool InnerCommutative = Instruction::isCommutative(InnerOpcode);
472 // Does "X op' (Y op Z)" always equal "(X op' Y) op (X op' Z)"?
473 if (LeftDistributesOverRight(InnerOpcode, TopLevelOpcode))
474 // Does the instruction have the form "(A op' B) op (A op' D)" or, in the
475 // commutative case, "(A op' B) op (C op' A)"?
476 if (A == C || (InnerCommutative && A == D)) {
479 // Consider forming "A op' (B op D)".
480 // If "B op D" simplifies then it can be formed with no cost.
481 V = SimplifyBinOp(TopLevelOpcode, B, D, DL);
482 // If "B op D" doesn't simplify then only go on if both of the existing
483 // operations "A op' B" and "C op' D" will be zapped as no longer used.
484 if (!V && LHS->hasOneUse() && RHS->hasOneUse())
485 V = Builder->CreateBinOp(TopLevelOpcode, B, D, RHS->getName());
487 SimplifiedInst = Builder->CreateBinOp(InnerOpcode, A, V);
491 // Does "(X op Y) op' Z" always equal "(X op' Z) op (Y op' Z)"?
492 if (!SimplifiedInst && RightDistributesOverLeft(TopLevelOpcode, InnerOpcode))
493 // Does the instruction have the form "(A op' B) op (C op' B)" or, in the
494 // commutative case, "(A op' B) op (B op' D)"?
495 if (B == D || (InnerCommutative && B == C)) {
498 // Consider forming "(A op C) op' B".
499 // If "A op C" simplifies then it can be formed with no cost.
500 V = SimplifyBinOp(TopLevelOpcode, A, C, DL);
502 // If "A op C" doesn't simplify then only go on if both of the existing
503 // operations "A op' B" and "C op' D" will be zapped as no longer used.
504 if (!V && LHS->hasOneUse() && RHS->hasOneUse())
505 V = Builder->CreateBinOp(TopLevelOpcode, A, C, LHS->getName());
507 SimplifiedInst = Builder->CreateBinOp(InnerOpcode, V, B);
511 if (SimplifiedInst) {
513 SimplifiedInst->takeName(&I);
515 // Check if we can add NSW flag to SimplifiedInst. If so, set NSW flag.
516 // TODO: Check for NUW.
517 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(SimplifiedInst)) {
518 if (isa<OverflowingBinaryOperator>(SimplifiedInst)) {
520 if (isa<OverflowingBinaryOperator>(&I))
521 HasNSW = I.hasNoSignedWrap();
523 if (BinaryOperator *Op0 = dyn_cast<BinaryOperator>(LHS))
524 if (isa<OverflowingBinaryOperator>(Op0))
525 HasNSW &= Op0->hasNoSignedWrap();
527 if (BinaryOperator *Op1 = dyn_cast<BinaryOperator>(RHS))
528 if (isa<OverflowingBinaryOperator>(Op1))
529 HasNSW &= Op1->hasNoSignedWrap();
531 // We can propagate 'nsw' if we know that
532 // %Y = mul nsw i16 %X, C
533 // %Z = add nsw i16 %Y, %X
535 // %Z = mul nsw i16 %X, C+1
537 // iff C+1 isn't INT_MIN
539 if (TopLevelOpcode == Instruction::Add &&
540 InnerOpcode == Instruction::Mul)
541 if (match(V, m_APInt(CInt)) && !CInt->isMinSignedValue())
542 BO->setHasNoSignedWrap(HasNSW);
546 return SimplifiedInst;
549 /// This tries to simplify binary operations which some other binary operation
550 /// distributes over either by factorizing out common terms
551 /// (eg "(A*B)+(A*C)" -> "A*(B+C)") or expanding out if this results in
552 /// simplifications (eg: "A & (B | C) -> (A&B) | (A&C)" if this is a win).
553 /// Returns the simplified value, or null if it didn't simplify.
554 Value *InstCombiner::SimplifyUsingDistributiveLaws(BinaryOperator &I) {
555 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1);
556 BinaryOperator *Op0 = dyn_cast<BinaryOperator>(LHS);
557 BinaryOperator *Op1 = dyn_cast<BinaryOperator>(RHS);
560 Value *A = nullptr, *B = nullptr, *C = nullptr, *D = nullptr;
561 auto TopLevelOpcode = I.getOpcode();
562 auto LHSOpcode = getBinOpsForFactorization(TopLevelOpcode, Op0, A, B);
563 auto RHSOpcode = getBinOpsForFactorization(TopLevelOpcode, Op1, C, D);
565 // The instruction has the form "(A op' B) op (C op' D)". Try to factorize
567 if (LHSOpcode == RHSOpcode) {
568 if (Value *V = tryFactorization(Builder, DL, I, LHSOpcode, A, B, C, D))
572 // The instruction has the form "(A op' B) op (C)". Try to factorize common
574 if (Value *V = tryFactorization(Builder, DL, I, LHSOpcode, A, B, RHS,
575 getIdentityValue(LHSOpcode, RHS)))
578 // The instruction has the form "(B) op (C op' D)". Try to factorize common
580 if (Value *V = tryFactorization(Builder, DL, I, RHSOpcode, LHS,
581 getIdentityValue(RHSOpcode, LHS), C, D))
585 if (Op0 && RightDistributesOverLeft(Op0->getOpcode(), TopLevelOpcode)) {
586 // The instruction has the form "(A op' B) op C". See if expanding it out
587 // to "(A op C) op' (B op C)" results in simplifications.
588 Value *A = Op0->getOperand(0), *B = Op0->getOperand(1), *C = RHS;
589 Instruction::BinaryOps InnerOpcode = Op0->getOpcode(); // op'
591 // Do "A op C" and "B op C" both simplify?
592 if (Value *L = SimplifyBinOp(TopLevelOpcode, A, C, DL))
593 if (Value *R = SimplifyBinOp(TopLevelOpcode, B, C, DL)) {
594 // They do! Return "L op' R".
596 // If "L op' R" equals "A op' B" then "L op' R" is just the LHS.
597 if ((L == A && R == B) ||
598 (Instruction::isCommutative(InnerOpcode) && L == B && R == A))
600 // Otherwise return "L op' R" if it simplifies.
601 if (Value *V = SimplifyBinOp(InnerOpcode, L, R, DL))
603 // Otherwise, create a new instruction.
604 C = Builder->CreateBinOp(InnerOpcode, L, R);
610 if (Op1 && LeftDistributesOverRight(TopLevelOpcode, Op1->getOpcode())) {
611 // The instruction has the form "A op (B op' C)". See if expanding it out
612 // to "(A op B) op' (A op C)" results in simplifications.
613 Value *A = LHS, *B = Op1->getOperand(0), *C = Op1->getOperand(1);
614 Instruction::BinaryOps InnerOpcode = Op1->getOpcode(); // op'
616 // Do "A op B" and "A op C" both simplify?
617 if (Value *L = SimplifyBinOp(TopLevelOpcode, A, B, DL))
618 if (Value *R = SimplifyBinOp(TopLevelOpcode, A, C, DL)) {
619 // They do! Return "L op' R".
621 // If "L op' R" equals "B op' C" then "L op' R" is just the RHS.
622 if ((L == B && R == C) ||
623 (Instruction::isCommutative(InnerOpcode) && L == C && R == B))
625 // Otherwise return "L op' R" if it simplifies.
626 if (Value *V = SimplifyBinOp(InnerOpcode, L, R, DL))
628 // Otherwise, create a new instruction.
629 A = Builder->CreateBinOp(InnerOpcode, L, R);
635 // (op (select (a, c, b)), (select (a, d, b))) -> (select (a, (op c, d), 0))
636 // (op (select (a, b, c)), (select (a, b, d))) -> (select (a, 0, (op c, d)))
637 if (auto *SI0 = dyn_cast<SelectInst>(LHS)) {
638 if (auto *SI1 = dyn_cast<SelectInst>(RHS)) {
639 if (SI0->getCondition() == SI1->getCondition()) {
641 if (Value *V = SimplifyBinOp(TopLevelOpcode, SI0->getFalseValue(),
642 SI1->getFalseValue(), DL, TLI, DT, AC))
643 SI = Builder->CreateSelect(SI0->getCondition(),
644 Builder->CreateBinOp(TopLevelOpcode,
646 SI1->getTrueValue()),
648 if (Value *V = SimplifyBinOp(TopLevelOpcode, SI0->getTrueValue(),
649 SI1->getTrueValue(), DL, TLI, DT, AC))
650 SI = Builder->CreateSelect(
651 SI0->getCondition(), V,
652 Builder->CreateBinOp(TopLevelOpcode, SI0->getFalseValue(),
653 SI1->getFalseValue()));
665 /// Given a 'sub' instruction, return the RHS of the instruction if the LHS is a
666 /// constant zero (which is the 'negate' form).
667 Value *InstCombiner::dyn_castNegVal(Value *V) const {
668 if (BinaryOperator::isNeg(V))
669 return BinaryOperator::getNegArgument(V);
671 // Constants can be considered to be negated values if they can be folded.
672 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
673 return ConstantExpr::getNeg(C);
675 if (ConstantDataVector *C = dyn_cast<ConstantDataVector>(V))
676 if (C->getType()->getElementType()->isIntegerTy())
677 return ConstantExpr::getNeg(C);
682 /// Given a 'fsub' instruction, return the RHS of the instruction if the LHS is
683 /// a constant negative zero (which is the 'negate' form).
684 Value *InstCombiner::dyn_castFNegVal(Value *V, bool IgnoreZeroSign) const {
685 if (BinaryOperator::isFNeg(V, IgnoreZeroSign))
686 return BinaryOperator::getFNegArgument(V);
688 // Constants can be considered to be negated values if they can be folded.
689 if (ConstantFP *C = dyn_cast<ConstantFP>(V))
690 return ConstantExpr::getFNeg(C);
692 if (ConstantDataVector *C = dyn_cast<ConstantDataVector>(V))
693 if (C->getType()->getElementType()->isFloatingPointTy())
694 return ConstantExpr::getFNeg(C);
699 static Value *FoldOperationIntoSelectOperand(Instruction &I, Value *SO,
701 if (CastInst *CI = dyn_cast<CastInst>(&I)) {
702 return IC->Builder->CreateCast(CI->getOpcode(), SO, I.getType());
705 // Figure out if the constant is the left or the right argument.
706 bool ConstIsRHS = isa<Constant>(I.getOperand(1));
707 Constant *ConstOperand = cast<Constant>(I.getOperand(ConstIsRHS));
709 if (Constant *SOC = dyn_cast<Constant>(SO)) {
711 return ConstantExpr::get(I.getOpcode(), SOC, ConstOperand);
712 return ConstantExpr::get(I.getOpcode(), ConstOperand, SOC);
715 Value *Op0 = SO, *Op1 = ConstOperand;
719 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(&I)) {
720 Value *RI = IC->Builder->CreateBinOp(BO->getOpcode(), Op0, Op1,
721 SO->getName()+".op");
722 Instruction *FPInst = dyn_cast<Instruction>(RI);
723 if (FPInst && isa<FPMathOperator>(FPInst))
724 FPInst->copyFastMathFlags(BO);
727 if (ICmpInst *CI = dyn_cast<ICmpInst>(&I))
728 return IC->Builder->CreateICmp(CI->getPredicate(), Op0, Op1,
729 SO->getName()+".cmp");
730 if (FCmpInst *CI = dyn_cast<FCmpInst>(&I))
731 return IC->Builder->CreateICmp(CI->getPredicate(), Op0, Op1,
732 SO->getName()+".cmp");
733 llvm_unreachable("Unknown binary instruction type!");
736 /// Given an instruction with a select as one operand and a constant as the
737 /// other operand, try to fold the binary operator into the select arguments.
738 /// This also works for Cast instructions, which obviously do not have a second
740 Instruction *InstCombiner::FoldOpIntoSelect(Instruction &Op, SelectInst *SI) {
741 // Don't modify shared select instructions
742 if (!SI->hasOneUse()) return nullptr;
743 Value *TV = SI->getOperand(1);
744 Value *FV = SI->getOperand(2);
746 if (isa<Constant>(TV) || isa<Constant>(FV)) {
747 // Bool selects with constant operands can be folded to logical ops.
748 if (SI->getType()->isIntegerTy(1)) return nullptr;
750 // If it's a bitcast involving vectors, make sure it has the same number of
751 // elements on both sides.
752 if (BitCastInst *BC = dyn_cast<BitCastInst>(&Op)) {
753 VectorType *DestTy = dyn_cast<VectorType>(BC->getDestTy());
754 VectorType *SrcTy = dyn_cast<VectorType>(BC->getSrcTy());
756 // Verify that either both or neither are vectors.
757 if ((SrcTy == nullptr) != (DestTy == nullptr)) return nullptr;
758 // If vectors, verify that they have the same number of elements.
759 if (SrcTy && SrcTy->getNumElements() != DestTy->getNumElements())
763 // Test if a CmpInst instruction is used exclusively by a select as
764 // part of a minimum or maximum operation. If so, refrain from doing
765 // any other folding. This helps out other analyses which understand
766 // non-obfuscated minimum and maximum idioms, such as ScalarEvolution
767 // and CodeGen. And in this case, at least one of the comparison
768 // operands has at least one user besides the compare (the select),
769 // which would often largely negate the benefit of folding anyway.
770 if (auto *CI = dyn_cast<CmpInst>(SI->getCondition())) {
771 if (CI->hasOneUse()) {
772 Value *Op0 = CI->getOperand(0), *Op1 = CI->getOperand(1);
773 if ((SI->getOperand(1) == Op0 && SI->getOperand(2) == Op1) ||
774 (SI->getOperand(2) == Op0 && SI->getOperand(1) == Op1))
779 Value *SelectTrueVal = FoldOperationIntoSelectOperand(Op, TV, this);
780 Value *SelectFalseVal = FoldOperationIntoSelectOperand(Op, FV, this);
782 return SelectInst::Create(SI->getCondition(),
783 SelectTrueVal, SelectFalseVal);
788 /// Given a binary operator, cast instruction, or select which has a PHI node as
789 /// operand #0, see if we can fold the instruction into the PHI (which is only
790 /// possible if all operands to the PHI are constants).
791 Instruction *InstCombiner::FoldOpIntoPhi(Instruction &I) {
792 PHINode *PN = cast<PHINode>(I.getOperand(0));
793 unsigned NumPHIValues = PN->getNumIncomingValues();
794 if (NumPHIValues == 0)
797 // We normally only transform phis with a single use. However, if a PHI has
798 // multiple uses and they are all the same operation, we can fold *all* of the
799 // uses into the PHI.
800 if (!PN->hasOneUse()) {
801 // Walk the use list for the instruction, comparing them to I.
802 for (User *U : PN->users()) {
803 Instruction *UI = cast<Instruction>(U);
804 if (UI != &I && !I.isIdenticalTo(UI))
807 // Otherwise, we can replace *all* users with the new PHI we form.
810 // Check to see if all of the operands of the PHI are simple constants
811 // (constantint/constantfp/undef). If there is one non-constant value,
812 // remember the BB it is in. If there is more than one or if *it* is a PHI,
813 // bail out. We don't do arbitrary constant expressions here because moving
814 // their computation can be expensive without a cost model.
815 BasicBlock *NonConstBB = nullptr;
816 for (unsigned i = 0; i != NumPHIValues; ++i) {
817 Value *InVal = PN->getIncomingValue(i);
818 if (isa<Constant>(InVal) && !isa<ConstantExpr>(InVal))
821 if (isa<PHINode>(InVal)) return nullptr; // Itself a phi.
822 if (NonConstBB) return nullptr; // More than one non-const value.
824 NonConstBB = PN->getIncomingBlock(i);
826 // If the InVal is an invoke at the end of the pred block, then we can't
827 // insert a computation after it without breaking the edge.
828 if (InvokeInst *II = dyn_cast<InvokeInst>(InVal))
829 if (II->getParent() == NonConstBB)
832 // If the incoming non-constant value is in I's block, we will remove one
833 // instruction, but insert another equivalent one, leading to infinite
835 if (isPotentiallyReachable(I.getParent(), NonConstBB, DT, LI))
839 // If there is exactly one non-constant value, we can insert a copy of the
840 // operation in that block. However, if this is a critical edge, we would be
841 // inserting the computation on some other paths (e.g. inside a loop). Only
842 // do this if the pred block is unconditionally branching into the phi block.
843 if (NonConstBB != nullptr) {
844 BranchInst *BI = dyn_cast<BranchInst>(NonConstBB->getTerminator());
845 if (!BI || !BI->isUnconditional()) return nullptr;
848 // Okay, we can do the transformation: create the new PHI node.
849 PHINode *NewPN = PHINode::Create(I.getType(), PN->getNumIncomingValues());
850 InsertNewInstBefore(NewPN, *PN);
853 // If we are going to have to insert a new computation, do so right before the
854 // predecessor's terminator.
856 Builder->SetInsertPoint(NonConstBB->getTerminator());
858 // Next, add all of the operands to the PHI.
859 if (SelectInst *SI = dyn_cast<SelectInst>(&I)) {
860 // We only currently try to fold the condition of a select when it is a phi,
861 // not the true/false values.
862 Value *TrueV = SI->getTrueValue();
863 Value *FalseV = SI->getFalseValue();
864 BasicBlock *PhiTransBB = PN->getParent();
865 for (unsigned i = 0; i != NumPHIValues; ++i) {
866 BasicBlock *ThisBB = PN->getIncomingBlock(i);
867 Value *TrueVInPred = TrueV->DoPHITranslation(PhiTransBB, ThisBB);
868 Value *FalseVInPred = FalseV->DoPHITranslation(PhiTransBB, ThisBB);
869 Value *InV = nullptr;
870 // Beware of ConstantExpr: it may eventually evaluate to getNullValue,
871 // even if currently isNullValue gives false.
872 Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i));
873 if (InC && !isa<ConstantExpr>(InC))
874 InV = InC->isNullValue() ? FalseVInPred : TrueVInPred;
876 InV = Builder->CreateSelect(PN->getIncomingValue(i),
877 TrueVInPred, FalseVInPred, "phitmp");
878 NewPN->addIncoming(InV, ThisBB);
880 } else if (CmpInst *CI = dyn_cast<CmpInst>(&I)) {
881 Constant *C = cast<Constant>(I.getOperand(1));
882 for (unsigned i = 0; i != NumPHIValues; ++i) {
883 Value *InV = nullptr;
884 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i)))
885 InV = ConstantExpr::getCompare(CI->getPredicate(), InC, C);
886 else if (isa<ICmpInst>(CI))
887 InV = Builder->CreateICmp(CI->getPredicate(), PN->getIncomingValue(i),
890 InV = Builder->CreateFCmp(CI->getPredicate(), PN->getIncomingValue(i),
892 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
894 } else if (I.getNumOperands() == 2) {
895 Constant *C = cast<Constant>(I.getOperand(1));
896 for (unsigned i = 0; i != NumPHIValues; ++i) {
897 Value *InV = nullptr;
898 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i)))
899 InV = ConstantExpr::get(I.getOpcode(), InC, C);
901 InV = Builder->CreateBinOp(cast<BinaryOperator>(I).getOpcode(),
902 PN->getIncomingValue(i), C, "phitmp");
903 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
906 CastInst *CI = cast<CastInst>(&I);
907 Type *RetTy = CI->getType();
908 for (unsigned i = 0; i != NumPHIValues; ++i) {
910 if (Constant *InC = dyn_cast<Constant>(PN->getIncomingValue(i)))
911 InV = ConstantExpr::getCast(CI->getOpcode(), InC, RetTy);
913 InV = Builder->CreateCast(CI->getOpcode(),
914 PN->getIncomingValue(i), I.getType(), "phitmp");
915 NewPN->addIncoming(InV, PN->getIncomingBlock(i));
919 for (auto UI = PN->user_begin(), E = PN->user_end(); UI != E;) {
920 Instruction *User = cast<Instruction>(*UI++);
921 if (User == &I) continue;
922 ReplaceInstUsesWith(*User, NewPN);
923 EraseInstFromFunction(*User);
925 return ReplaceInstUsesWith(I, NewPN);
928 /// Given a pointer type and a constant offset, determine whether or not there
929 /// is a sequence of GEP indices into the pointed type that will land us at the
930 /// specified offset. If so, fill them into NewIndices and return the resultant
931 /// element type, otherwise return null.
932 Type *InstCombiner::FindElementAtOffset(PointerType *PtrTy, int64_t Offset,
933 SmallVectorImpl<Value *> &NewIndices) {
934 Type *Ty = PtrTy->getElementType();
938 // Start with the index over the outer type. Note that the type size
939 // might be zero (even if the offset isn't zero) if the indexed type
940 // is something like [0 x {int, int}]
941 Type *IntPtrTy = DL.getIntPtrType(PtrTy);
942 int64_t FirstIdx = 0;
943 if (int64_t TySize = DL.getTypeAllocSize(Ty)) {
944 FirstIdx = Offset/TySize;
945 Offset -= FirstIdx*TySize;
947 // Handle hosts where % returns negative instead of values [0..TySize).
953 assert((uint64_t)Offset < (uint64_t)TySize && "Out of range offset");
956 NewIndices.push_back(ConstantInt::get(IntPtrTy, FirstIdx));
958 // Index into the types. If we fail, set OrigBase to null.
960 // Indexing into tail padding between struct/array elements.
961 if (uint64_t(Offset * 8) >= DL.getTypeSizeInBits(Ty))
964 if (StructType *STy = dyn_cast<StructType>(Ty)) {
965 const StructLayout *SL = DL.getStructLayout(STy);
966 assert(Offset < (int64_t)SL->getSizeInBytes() &&
967 "Offset must stay within the indexed type");
969 unsigned Elt = SL->getElementContainingOffset(Offset);
970 NewIndices.push_back(ConstantInt::get(Type::getInt32Ty(Ty->getContext()),
973 Offset -= SL->getElementOffset(Elt);
974 Ty = STy->getElementType(Elt);
975 } else if (ArrayType *AT = dyn_cast<ArrayType>(Ty)) {
976 uint64_t EltSize = DL.getTypeAllocSize(AT->getElementType());
977 assert(EltSize && "Cannot index into a zero-sized array");
978 NewIndices.push_back(ConstantInt::get(IntPtrTy,Offset/EltSize));
980 Ty = AT->getElementType();
982 // Otherwise, we can't index into the middle of this atomic type, bail.
990 static bool shouldMergeGEPs(GEPOperator &GEP, GEPOperator &Src) {
991 // If this GEP has only 0 indices, it is the same pointer as
992 // Src. If Src is not a trivial GEP too, don't combine
994 if (GEP.hasAllZeroIndices() && !Src.hasAllZeroIndices() &&
1000 /// Return a value X such that Val = X * Scale, or null if none.
1001 /// If the multiplication is known not to overflow, then NoSignedWrap is set.
1002 Value *InstCombiner::Descale(Value *Val, APInt Scale, bool &NoSignedWrap) {
1003 assert(isa<IntegerType>(Val->getType()) && "Can only descale integers!");
1004 assert(cast<IntegerType>(Val->getType())->getBitWidth() ==
1005 Scale.getBitWidth() && "Scale not compatible with value!");
1007 // If Val is zero or Scale is one then Val = Val * Scale.
1008 if (match(Val, m_Zero()) || Scale == 1) {
1009 NoSignedWrap = true;
1013 // If Scale is zero then it does not divide Val.
1014 if (Scale.isMinValue())
1017 // Look through chains of multiplications, searching for a constant that is
1018 // divisible by Scale. For example, descaling X*(Y*(Z*4)) by a factor of 4
1019 // will find the constant factor 4 and produce X*(Y*Z). Descaling X*(Y*8) by
1020 // a factor of 4 will produce X*(Y*2). The principle of operation is to bore
1023 // Val = M1 * X || Analysis starts here and works down
1024 // M1 = M2 * Y || Doesn't descend into terms with more
1025 // M2 = Z * 4 \/ than one use
1027 // Then to modify a term at the bottom:
1030 // M1 = Z * Y || Replaced M2 with Z
1032 // Then to work back up correcting nsw flags.
1034 // Op - the term we are currently analyzing. Starts at Val then drills down.
1035 // Replaced with its descaled value before exiting from the drill down loop.
1038 // Parent - initially null, but after drilling down notes where Op came from.
1039 // In the example above, Parent is (Val, 0) when Op is M1, because M1 is the
1040 // 0'th operand of Val.
1041 std::pair<Instruction*, unsigned> Parent;
1043 // Set if the transform requires a descaling at deeper levels that doesn't
1045 bool RequireNoSignedWrap = false;
1047 // Log base 2 of the scale. Negative if not a power of 2.
1048 int32_t logScale = Scale.exactLogBase2();
1050 for (;; Op = Parent.first->getOperand(Parent.second)) { // Drill down
1052 if (ConstantInt *CI = dyn_cast<ConstantInt>(Op)) {
1053 // If Op is a constant divisible by Scale then descale to the quotient.
1054 APInt Quotient(Scale), Remainder(Scale); // Init ensures right bitwidth.
1055 APInt::sdivrem(CI->getValue(), Scale, Quotient, Remainder);
1056 if (!Remainder.isMinValue())
1057 // Not divisible by Scale.
1059 // Replace with the quotient in the parent.
1060 Op = ConstantInt::get(CI->getType(), Quotient);
1061 NoSignedWrap = true;
1065 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Op)) {
1067 if (BO->getOpcode() == Instruction::Mul) {
1069 NoSignedWrap = BO->hasNoSignedWrap();
1070 if (RequireNoSignedWrap && !NoSignedWrap)
1073 // There are three cases for multiplication: multiplication by exactly
1074 // the scale, multiplication by a constant different to the scale, and
1075 // multiplication by something else.
1076 Value *LHS = BO->getOperand(0);
1077 Value *RHS = BO->getOperand(1);
1079 if (ConstantInt *CI = dyn_cast<ConstantInt>(RHS)) {
1080 // Multiplication by a constant.
1081 if (CI->getValue() == Scale) {
1082 // Multiplication by exactly the scale, replace the multiplication
1083 // by its left-hand side in the parent.
1088 // Otherwise drill down into the constant.
1089 if (!Op->hasOneUse())
1092 Parent = std::make_pair(BO, 1);
1096 // Multiplication by something else. Drill down into the left-hand side
1097 // since that's where the reassociate pass puts the good stuff.
1098 if (!Op->hasOneUse())
1101 Parent = std::make_pair(BO, 0);
1105 if (logScale > 0 && BO->getOpcode() == Instruction::Shl &&
1106 isa<ConstantInt>(BO->getOperand(1))) {
1107 // Multiplication by a power of 2.
1108 NoSignedWrap = BO->hasNoSignedWrap();
1109 if (RequireNoSignedWrap && !NoSignedWrap)
1112 Value *LHS = BO->getOperand(0);
1113 int32_t Amt = cast<ConstantInt>(BO->getOperand(1))->
1114 getLimitedValue(Scale.getBitWidth());
1117 if (Amt == logScale) {
1118 // Multiplication by exactly the scale, replace the multiplication
1119 // by its left-hand side in the parent.
1123 if (Amt < logScale || !Op->hasOneUse())
1126 // Multiplication by more than the scale. Reduce the multiplying amount
1127 // by the scale in the parent.
1128 Parent = std::make_pair(BO, 1);
1129 Op = ConstantInt::get(BO->getType(), Amt - logScale);
1134 if (!Op->hasOneUse())
1137 if (CastInst *Cast = dyn_cast<CastInst>(Op)) {
1138 if (Cast->getOpcode() == Instruction::SExt) {
1139 // Op is sign-extended from a smaller type, descale in the smaller type.
1140 unsigned SmallSize = Cast->getSrcTy()->getPrimitiveSizeInBits();
1141 APInt SmallScale = Scale.trunc(SmallSize);
1142 // Suppose Op = sext X, and we descale X as Y * SmallScale. We want to
1143 // descale Op as (sext Y) * Scale. In order to have
1144 // sext (Y * SmallScale) = (sext Y) * Scale
1145 // some conditions need to hold however: SmallScale must sign-extend to
1146 // Scale and the multiplication Y * SmallScale should not overflow.
1147 if (SmallScale.sext(Scale.getBitWidth()) != Scale)
1148 // SmallScale does not sign-extend to Scale.
1150 assert(SmallScale.exactLogBase2() == logScale);
1151 // Require that Y * SmallScale must not overflow.
1152 RequireNoSignedWrap = true;
1154 // Drill down through the cast.
1155 Parent = std::make_pair(Cast, 0);
1160 if (Cast->getOpcode() == Instruction::Trunc) {
1161 // Op is truncated from a larger type, descale in the larger type.
1162 // Suppose Op = trunc X, and we descale X as Y * sext Scale. Then
1163 // trunc (Y * sext Scale) = (trunc Y) * Scale
1164 // always holds. However (trunc Y) * Scale may overflow even if
1165 // trunc (Y * sext Scale) does not, so nsw flags need to be cleared
1166 // from this point up in the expression (see later).
1167 if (RequireNoSignedWrap)
1170 // Drill down through the cast.
1171 unsigned LargeSize = Cast->getSrcTy()->getPrimitiveSizeInBits();
1172 Parent = std::make_pair(Cast, 0);
1173 Scale = Scale.sext(LargeSize);
1174 if (logScale + 1 == (int32_t)Cast->getType()->getPrimitiveSizeInBits())
1176 assert(Scale.exactLogBase2() == logScale);
1181 // Unsupported expression, bail out.
1185 // If Op is zero then Val = Op * Scale.
1186 if (match(Op, m_Zero())) {
1187 NoSignedWrap = true;
1191 // We know that we can successfully descale, so from here on we can safely
1192 // modify the IR. Op holds the descaled version of the deepest term in the
1193 // expression. NoSignedWrap is 'true' if multiplying Op by Scale is known
1197 // The expression only had one term.
1200 // Rewrite the parent using the descaled version of its operand.
1201 assert(Parent.first->hasOneUse() && "Drilled down when more than one use!");
1202 assert(Op != Parent.first->getOperand(Parent.second) &&
1203 "Descaling was a no-op?");
1204 Parent.first->setOperand(Parent.second, Op);
1205 Worklist.Add(Parent.first);
1207 // Now work back up the expression correcting nsw flags. The logic is based
1208 // on the following observation: if X * Y is known not to overflow as a signed
1209 // multiplication, and Y is replaced by a value Z with smaller absolute value,
1210 // then X * Z will not overflow as a signed multiplication either. As we work
1211 // our way up, having NoSignedWrap 'true' means that the descaled value at the
1212 // current level has strictly smaller absolute value than the original.
1213 Instruction *Ancestor = Parent.first;
1215 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(Ancestor)) {
1216 // If the multiplication wasn't nsw then we can't say anything about the
1217 // value of the descaled multiplication, and we have to clear nsw flags
1218 // from this point on up.
1219 bool OpNoSignedWrap = BO->hasNoSignedWrap();
1220 NoSignedWrap &= OpNoSignedWrap;
1221 if (NoSignedWrap != OpNoSignedWrap) {
1222 BO->setHasNoSignedWrap(NoSignedWrap);
1223 Worklist.Add(Ancestor);
1225 } else if (Ancestor->getOpcode() == Instruction::Trunc) {
1226 // The fact that the descaled input to the trunc has smaller absolute
1227 // value than the original input doesn't tell us anything useful about
1228 // the absolute values of the truncations.
1229 NoSignedWrap = false;
1231 assert((Ancestor->getOpcode() != Instruction::SExt || NoSignedWrap) &&
1232 "Failed to keep proper track of nsw flags while drilling down?");
1234 if (Ancestor == Val)
1235 // Got to the top, all done!
1238 // Move up one level in the expression.
1239 assert(Ancestor->hasOneUse() && "Drilled down when more than one use!");
1240 Ancestor = Ancestor->user_back();
1244 /// \brief Creates node of binary operation with the same attributes as the
1245 /// specified one but with other operands.
1246 static Value *CreateBinOpAsGiven(BinaryOperator &Inst, Value *LHS, Value *RHS,
1247 InstCombiner::BuilderTy *B) {
1248 Value *BO = B->CreateBinOp(Inst.getOpcode(), LHS, RHS);
1249 // If LHS and RHS are constant, BO won't be a binary operator.
1250 if (BinaryOperator *NewBO = dyn_cast<BinaryOperator>(BO))
1251 NewBO->copyIRFlags(&Inst);
1255 /// \brief Makes transformation of binary operation specific for vector types.
1256 /// \param Inst Binary operator to transform.
1257 /// \return Pointer to node that must replace the original binary operator, or
1258 /// null pointer if no transformation was made.
1259 Value *InstCombiner::SimplifyVectorOp(BinaryOperator &Inst) {
1260 if (!Inst.getType()->isVectorTy()) return nullptr;
1262 // It may not be safe to reorder shuffles and things like div, urem, etc.
1263 // because we may trap when executing those ops on unknown vector elements.
1265 if (!isSafeToSpeculativelyExecute(&Inst))
1268 unsigned VWidth = cast<VectorType>(Inst.getType())->getNumElements();
1269 Value *LHS = Inst.getOperand(0), *RHS = Inst.getOperand(1);
1270 assert(cast<VectorType>(LHS->getType())->getNumElements() == VWidth);
1271 assert(cast<VectorType>(RHS->getType())->getNumElements() == VWidth);
1273 // If both arguments of binary operation are shuffles, which use the same
1274 // mask and shuffle within a single vector, it is worthwhile to move the
1275 // shuffle after binary operation:
1276 // Op(shuffle(v1, m), shuffle(v2, m)) -> shuffle(Op(v1, v2), m)
1277 if (isa<ShuffleVectorInst>(LHS) && isa<ShuffleVectorInst>(RHS)) {
1278 ShuffleVectorInst *LShuf = cast<ShuffleVectorInst>(LHS);
1279 ShuffleVectorInst *RShuf = cast<ShuffleVectorInst>(RHS);
1280 if (isa<UndefValue>(LShuf->getOperand(1)) &&
1281 isa<UndefValue>(RShuf->getOperand(1)) &&
1282 LShuf->getOperand(0)->getType() == RShuf->getOperand(0)->getType() &&
1283 LShuf->getMask() == RShuf->getMask()) {
1284 Value *NewBO = CreateBinOpAsGiven(Inst, LShuf->getOperand(0),
1285 RShuf->getOperand(0), Builder);
1286 return Builder->CreateShuffleVector(NewBO,
1287 UndefValue::get(NewBO->getType()), LShuf->getMask());
1291 // If one argument is a shuffle within one vector, the other is a constant,
1292 // try moving the shuffle after the binary operation.
1293 ShuffleVectorInst *Shuffle = nullptr;
1294 Constant *C1 = nullptr;
1295 if (isa<ShuffleVectorInst>(LHS)) Shuffle = cast<ShuffleVectorInst>(LHS);
1296 if (isa<ShuffleVectorInst>(RHS)) Shuffle = cast<ShuffleVectorInst>(RHS);
1297 if (isa<Constant>(LHS)) C1 = cast<Constant>(LHS);
1298 if (isa<Constant>(RHS)) C1 = cast<Constant>(RHS);
1299 if (Shuffle && C1 &&
1300 (isa<ConstantVector>(C1) || isa<ConstantDataVector>(C1)) &&
1301 isa<UndefValue>(Shuffle->getOperand(1)) &&
1302 Shuffle->getType() == Shuffle->getOperand(0)->getType()) {
1303 SmallVector<int, 16> ShMask = Shuffle->getShuffleMask();
1304 // Find constant C2 that has property:
1305 // shuffle(C2, ShMask) = C1
1306 // If such constant does not exist (example: ShMask=<0,0> and C1=<1,2>)
1307 // reorder is not possible.
1308 SmallVector<Constant*, 16> C2M(VWidth,
1309 UndefValue::get(C1->getType()->getScalarType()));
1310 bool MayChange = true;
1311 for (unsigned I = 0; I < VWidth; ++I) {
1312 if (ShMask[I] >= 0) {
1313 assert(ShMask[I] < (int)VWidth);
1314 if (!isa<UndefValue>(C2M[ShMask[I]])) {
1318 C2M[ShMask[I]] = C1->getAggregateElement(I);
1322 Constant *C2 = ConstantVector::get(C2M);
1323 Value *NewLHS = isa<Constant>(LHS) ? C2 : Shuffle->getOperand(0);
1324 Value *NewRHS = isa<Constant>(LHS) ? Shuffle->getOperand(0) : C2;
1325 Value *NewBO = CreateBinOpAsGiven(Inst, NewLHS, NewRHS, Builder);
1326 return Builder->CreateShuffleVector(NewBO,
1327 UndefValue::get(Inst.getType()), Shuffle->getMask());
1334 Instruction *InstCombiner::visitGetElementPtrInst(GetElementPtrInst &GEP) {
1335 SmallVector<Value*, 8> Ops(GEP.op_begin(), GEP.op_end());
1337 if (Value *V = SimplifyGEPInst(Ops, DL, TLI, DT, AC))
1338 return ReplaceInstUsesWith(GEP, V);
1340 Value *PtrOp = GEP.getOperand(0);
1342 // Eliminate unneeded casts for indices, and replace indices which displace
1343 // by multiples of a zero size type with zero.
1344 bool MadeChange = false;
1346 DL.getIntPtrType(GEP.getPointerOperandType()->getScalarType());
1348 gep_type_iterator GTI = gep_type_begin(GEP);
1349 for (User::op_iterator I = GEP.op_begin() + 1, E = GEP.op_end(); I != E;
1351 // Skip indices into struct types.
1352 SequentialType *SeqTy = dyn_cast<SequentialType>(*GTI);
1356 // Index type should have the same width as IntPtr
1357 Type *IndexTy = (*I)->getType();
1358 Type *NewIndexType = IndexTy->isVectorTy() ?
1359 VectorType::get(IntPtrTy, IndexTy->getVectorNumElements()) : IntPtrTy;
1361 // If the element type has zero size then any index over it is equivalent
1362 // to an index of zero, so replace it with zero if it is not zero already.
1363 if (SeqTy->getElementType()->isSized() &&
1364 DL.getTypeAllocSize(SeqTy->getElementType()) == 0)
1365 if (!isa<Constant>(*I) || !cast<Constant>(*I)->isNullValue()) {
1366 *I = Constant::getNullValue(NewIndexType);
1370 if (IndexTy != NewIndexType) {
1371 // If we are using a wider index than needed for this platform, shrink
1372 // it to what we need. If narrower, sign-extend it to what we need.
1373 // This explicit cast can make subsequent optimizations more obvious.
1374 *I = Builder->CreateIntCast(*I, NewIndexType, true);
1381 // Check to see if the inputs to the PHI node are getelementptr instructions.
1382 if (PHINode *PN = dyn_cast<PHINode>(PtrOp)) {
1383 GetElementPtrInst *Op1 = dyn_cast<GetElementPtrInst>(PN->getOperand(0));
1387 // Don't fold a GEP into itself through a PHI node. This can only happen
1388 // through the back-edge of a loop. Folding a GEP into itself means that
1389 // the value of the previous iteration needs to be stored in the meantime,
1390 // thus requiring an additional register variable to be live, but not
1391 // actually achieving anything (the GEP still needs to be executed once per
1398 for (auto I = PN->op_begin()+1, E = PN->op_end(); I !=E; ++I) {
1399 GetElementPtrInst *Op2 = dyn_cast<GetElementPtrInst>(*I);
1400 if (!Op2 || Op1->getNumOperands() != Op2->getNumOperands())
1403 // As for Op1 above, don't try to fold a GEP into itself.
1407 // Keep track of the type as we walk the GEP.
1408 Type *CurTy = Op1->getOperand(0)->getType()->getScalarType();
1410 for (unsigned J = 0, F = Op1->getNumOperands(); J != F; ++J) {
1411 if (Op1->getOperand(J)->getType() != Op2->getOperand(J)->getType())
1414 if (Op1->getOperand(J) != Op2->getOperand(J)) {
1416 // We have not seen any differences yet in the GEPs feeding the
1417 // PHI yet, so we record this one if it is allowed to be a
1420 // The first two arguments can vary for any GEP, the rest have to be
1421 // static for struct slots
1422 if (J > 1 && CurTy->isStructTy())
1427 // The GEP is different by more than one input. While this could be
1428 // extended to support GEPs that vary by more than one variable it
1429 // doesn't make sense since it greatly increases the complexity and
1430 // would result in an R+R+R addressing mode which no backend
1431 // directly supports and would need to be broken into several
1432 // simpler instructions anyway.
1437 // Sink down a layer of the type for the next iteration.
1439 if (CompositeType *CT = dyn_cast<CompositeType>(CurTy)) {
1440 CurTy = CT->getTypeAtIndex(Op1->getOperand(J));
1448 // If not all GEPs are identical we'll have to create a new PHI node.
1449 // Check that the old PHI node has only one use so that it will get
1451 if (DI != -1 && !PN->hasOneUse())
1454 GetElementPtrInst *NewGEP = cast<GetElementPtrInst>(Op1->clone());
1456 // All the GEPs feeding the PHI are identical. Clone one down into our
1457 // BB so that it can be merged with the current GEP.
1458 GEP.getParent()->getInstList().insert(
1459 GEP.getParent()->getFirstInsertionPt(), NewGEP);
1461 // All the GEPs feeding the PHI differ at a single offset. Clone a GEP
1462 // into the current block so it can be merged, and create a new PHI to
1466 IRBuilderBase::InsertPointGuard Guard(*Builder);
1467 Builder->SetInsertPoint(PN);
1468 NewPN = Builder->CreatePHI(Op1->getOperand(DI)->getType(),
1469 PN->getNumOperands());
1472 for (auto &I : PN->operands())
1473 NewPN->addIncoming(cast<GEPOperator>(I)->getOperand(DI),
1474 PN->getIncomingBlock(I));
1476 NewGEP->setOperand(DI, NewPN);
1477 GEP.getParent()->getInstList().insert(
1478 GEP.getParent()->getFirstInsertionPt(), NewGEP);
1479 NewGEP->setOperand(DI, NewPN);
1482 GEP.setOperand(0, NewGEP);
1486 // Combine Indices - If the source pointer to this getelementptr instruction
1487 // is a getelementptr instruction, combine the indices of the two
1488 // getelementptr instructions into a single instruction.
1490 if (GEPOperator *Src = dyn_cast<GEPOperator>(PtrOp)) {
1491 if (!shouldMergeGEPs(*cast<GEPOperator>(&GEP), *Src))
1494 // Note that if our source is a gep chain itself then we wait for that
1495 // chain to be resolved before we perform this transformation. This
1496 // avoids us creating a TON of code in some cases.
1497 if (GEPOperator *SrcGEP =
1498 dyn_cast<GEPOperator>(Src->getOperand(0)))
1499 if (SrcGEP->getNumOperands() == 2 && shouldMergeGEPs(*Src, *SrcGEP))
1500 return nullptr; // Wait until our source is folded to completion.
1502 SmallVector<Value*, 8> Indices;
1504 // Find out whether the last index in the source GEP is a sequential idx.
1505 bool EndsWithSequential = false;
1506 for (gep_type_iterator I = gep_type_begin(*Src), E = gep_type_end(*Src);
1508 EndsWithSequential = !(*I)->isStructTy();
1510 // Can we combine the two pointer arithmetics offsets?
1511 if (EndsWithSequential) {
1512 // Replace: gep (gep %P, long B), long A, ...
1513 // With: T = long A+B; gep %P, T, ...
1516 Value *SO1 = Src->getOperand(Src->getNumOperands()-1);
1517 Value *GO1 = GEP.getOperand(1);
1518 if (SO1 == Constant::getNullValue(SO1->getType())) {
1520 } else if (GO1 == Constant::getNullValue(GO1->getType())) {
1523 // If they aren't the same type, then the input hasn't been processed
1524 // by the loop above yet (which canonicalizes sequential index types to
1525 // intptr_t). Just avoid transforming this until the input has been
1527 if (SO1->getType() != GO1->getType())
1529 // Only do the combine when GO1 and SO1 are both constants. Only in
1530 // this case, we are sure the cost after the merge is never more than
1531 // that before the merge.
1532 if (!isa<Constant>(GO1) || !isa<Constant>(SO1))
1534 Sum = Builder->CreateAdd(SO1, GO1, PtrOp->getName()+".sum");
1537 // Update the GEP in place if possible.
1538 if (Src->getNumOperands() == 2) {
1539 GEP.setOperand(0, Src->getOperand(0));
1540 GEP.setOperand(1, Sum);
1543 Indices.append(Src->op_begin()+1, Src->op_end()-1);
1544 Indices.push_back(Sum);
1545 Indices.append(GEP.op_begin()+2, GEP.op_end());
1546 } else if (isa<Constant>(*GEP.idx_begin()) &&
1547 cast<Constant>(*GEP.idx_begin())->isNullValue() &&
1548 Src->getNumOperands() != 1) {
1549 // Otherwise we can do the fold if the first index of the GEP is a zero
1550 Indices.append(Src->op_begin()+1, Src->op_end());
1551 Indices.append(GEP.idx_begin()+1, GEP.idx_end());
1554 if (!Indices.empty())
1555 return GEP.isInBounds() && Src->isInBounds()
1556 ? GetElementPtrInst::CreateInBounds(
1557 Src->getSourceElementType(), Src->getOperand(0), Indices,
1559 : GetElementPtrInst::Create(Src->getSourceElementType(),
1560 Src->getOperand(0), Indices,
1564 if (GEP.getNumIndices() == 1) {
1565 unsigned AS = GEP.getPointerAddressSpace();
1566 if (GEP.getOperand(1)->getType()->getScalarSizeInBits() ==
1567 DL.getPointerSizeInBits(AS)) {
1568 Type *PtrTy = GEP.getPointerOperandType();
1569 Type *Ty = PtrTy->getPointerElementType();
1570 uint64_t TyAllocSize = DL.getTypeAllocSize(Ty);
1572 bool Matched = false;
1575 if (TyAllocSize == 1) {
1576 V = GEP.getOperand(1);
1578 } else if (match(GEP.getOperand(1),
1579 m_AShr(m_Value(V), m_ConstantInt(C)))) {
1580 if (TyAllocSize == 1ULL << C)
1582 } else if (match(GEP.getOperand(1),
1583 m_SDiv(m_Value(V), m_ConstantInt(C)))) {
1584 if (TyAllocSize == C)
1589 // Canonicalize (gep i8* X, -(ptrtoint Y))
1590 // to (inttoptr (sub (ptrtoint X), (ptrtoint Y)))
1591 // The GEP pattern is emitted by the SCEV expander for certain kinds of
1592 // pointer arithmetic.
1593 if (match(V, m_Neg(m_PtrToInt(m_Value())))) {
1594 Operator *Index = cast<Operator>(V);
1595 Value *PtrToInt = Builder->CreatePtrToInt(PtrOp, Index->getType());
1596 Value *NewSub = Builder->CreateSub(PtrToInt, Index->getOperand(1));
1597 return CastInst::Create(Instruction::IntToPtr, NewSub, GEP.getType());
1599 // Canonicalize (gep i8* X, (ptrtoint Y)-(ptrtoint X))
1602 if (match(V, m_Sub(m_PtrToInt(m_Value(Y)),
1603 m_PtrToInt(m_Specific(GEP.getOperand(0)))))) {
1604 return CastInst::CreatePointerBitCastOrAddrSpaceCast(Y,
1611 // Handle gep(bitcast x) and gep(gep x, 0, 0, 0).
1612 Value *StrippedPtr = PtrOp->stripPointerCasts();
1613 PointerType *StrippedPtrTy = dyn_cast<PointerType>(StrippedPtr->getType());
1615 // We do not handle pointer-vector geps here.
1619 if (StrippedPtr != PtrOp) {
1620 bool HasZeroPointerIndex = false;
1621 if (ConstantInt *C = dyn_cast<ConstantInt>(GEP.getOperand(1)))
1622 HasZeroPointerIndex = C->isZero();
1624 // Transform: GEP (bitcast [10 x i8]* X to [0 x i8]*), i32 0, ...
1625 // into : GEP [10 x i8]* X, i32 0, ...
1627 // Likewise, transform: GEP (bitcast i8* X to [0 x i8]*), i32 0, ...
1628 // into : GEP i8* X, ...
1630 // This occurs when the program declares an array extern like "int X[];"
1631 if (HasZeroPointerIndex) {
1632 PointerType *CPTy = cast<PointerType>(PtrOp->getType());
1633 if (ArrayType *CATy =
1634 dyn_cast<ArrayType>(CPTy->getElementType())) {
1635 // GEP (bitcast i8* X to [0 x i8]*), i32 0, ... ?
1636 if (CATy->getElementType() == StrippedPtrTy->getElementType()) {
1637 // -> GEP i8* X, ...
1638 SmallVector<Value*, 8> Idx(GEP.idx_begin()+1, GEP.idx_end());
1639 GetElementPtrInst *Res = GetElementPtrInst::Create(
1640 StrippedPtrTy->getElementType(), StrippedPtr, Idx, GEP.getName());
1641 Res->setIsInBounds(GEP.isInBounds());
1642 if (StrippedPtrTy->getAddressSpace() == GEP.getAddressSpace())
1644 // Insert Res, and create an addrspacecast.
1646 // GEP (addrspacecast i8 addrspace(1)* X to [0 x i8]*), i32 0, ...
1648 // %0 = GEP i8 addrspace(1)* X, ...
1649 // addrspacecast i8 addrspace(1)* %0 to i8*
1650 return new AddrSpaceCastInst(Builder->Insert(Res), GEP.getType());
1653 if (ArrayType *XATy =
1654 dyn_cast<ArrayType>(StrippedPtrTy->getElementType())){
1655 // GEP (bitcast [10 x i8]* X to [0 x i8]*), i32 0, ... ?
1656 if (CATy->getElementType() == XATy->getElementType()) {
1657 // -> GEP [10 x i8]* X, i32 0, ...
1658 // At this point, we know that the cast source type is a pointer
1659 // to an array of the same type as the destination pointer
1660 // array. Because the array type is never stepped over (there
1661 // is a leading zero) we can fold the cast into this GEP.
1662 if (StrippedPtrTy->getAddressSpace() == GEP.getAddressSpace()) {
1663 GEP.setOperand(0, StrippedPtr);
1664 GEP.setSourceElementType(XATy);
1667 // Cannot replace the base pointer directly because StrippedPtr's
1668 // address space is different. Instead, create a new GEP followed by
1669 // an addrspacecast.
1671 // GEP (addrspacecast [10 x i8] addrspace(1)* X to [0 x i8]*),
1674 // %0 = GEP [10 x i8] addrspace(1)* X, ...
1675 // addrspacecast i8 addrspace(1)* %0 to i8*
1676 SmallVector<Value*, 8> Idx(GEP.idx_begin(), GEP.idx_end());
1677 Value *NewGEP = GEP.isInBounds()
1678 ? Builder->CreateInBoundsGEP(
1679 nullptr, StrippedPtr, Idx, GEP.getName())
1680 : Builder->CreateGEP(nullptr, StrippedPtr, Idx,
1682 return new AddrSpaceCastInst(NewGEP, GEP.getType());
1686 } else if (GEP.getNumOperands() == 2) {
1687 // Transform things like:
1688 // %t = getelementptr i32* bitcast ([2 x i32]* %str to i32*), i32 %V
1689 // into: %t1 = getelementptr [2 x i32]* %str, i32 0, i32 %V; bitcast
1690 Type *SrcElTy = StrippedPtrTy->getElementType();
1691 Type *ResElTy = PtrOp->getType()->getPointerElementType();
1692 if (SrcElTy->isArrayTy() &&
1693 DL.getTypeAllocSize(SrcElTy->getArrayElementType()) ==
1694 DL.getTypeAllocSize(ResElTy)) {
1695 Type *IdxType = DL.getIntPtrType(GEP.getType());
1696 Value *Idx[2] = { Constant::getNullValue(IdxType), GEP.getOperand(1) };
1699 ? Builder->CreateInBoundsGEP(nullptr, StrippedPtr, Idx,
1701 : Builder->CreateGEP(nullptr, StrippedPtr, Idx, GEP.getName());
1703 // V and GEP are both pointer types --> BitCast
1704 return CastInst::CreatePointerBitCastOrAddrSpaceCast(NewGEP,
1708 // Transform things like:
1709 // %V = mul i64 %N, 4
1710 // %t = getelementptr i8* bitcast (i32* %arr to i8*), i32 %V
1711 // into: %t1 = getelementptr i32* %arr, i32 %N; bitcast
1712 if (ResElTy->isSized() && SrcElTy->isSized()) {
1713 // Check that changing the type amounts to dividing the index by a scale
1715 uint64_t ResSize = DL.getTypeAllocSize(ResElTy);
1716 uint64_t SrcSize = DL.getTypeAllocSize(SrcElTy);
1717 if (ResSize && SrcSize % ResSize == 0) {
1718 Value *Idx = GEP.getOperand(1);
1719 unsigned BitWidth = Idx->getType()->getPrimitiveSizeInBits();
1720 uint64_t Scale = SrcSize / ResSize;
1722 // Earlier transforms ensure that the index has type IntPtrType, which
1723 // considerably simplifies the logic by eliminating implicit casts.
1724 assert(Idx->getType() == DL.getIntPtrType(GEP.getType()) &&
1725 "Index not cast to pointer width?");
1728 if (Value *NewIdx = Descale(Idx, APInt(BitWidth, Scale), NSW)) {
1729 // Successfully decomposed Idx as NewIdx * Scale, form a new GEP.
1730 // If the multiplication NewIdx * Scale may overflow then the new
1731 // GEP may not be "inbounds".
1733 GEP.isInBounds() && NSW
1734 ? Builder->CreateInBoundsGEP(nullptr, StrippedPtr, NewIdx,
1736 : Builder->CreateGEP(nullptr, StrippedPtr, NewIdx,
1739 // The NewGEP must be pointer typed, so must the old one -> BitCast
1740 return CastInst::CreatePointerBitCastOrAddrSpaceCast(NewGEP,
1746 // Similarly, transform things like:
1747 // getelementptr i8* bitcast ([100 x double]* X to i8*), i32 %tmp
1748 // (where tmp = 8*tmp2) into:
1749 // getelementptr [100 x double]* %arr, i32 0, i32 %tmp2; bitcast
1750 if (ResElTy->isSized() && SrcElTy->isSized() && SrcElTy->isArrayTy()) {
1751 // Check that changing to the array element type amounts to dividing the
1752 // index by a scale factor.
1753 uint64_t ResSize = DL.getTypeAllocSize(ResElTy);
1754 uint64_t ArrayEltSize =
1755 DL.getTypeAllocSize(SrcElTy->getArrayElementType());
1756 if (ResSize && ArrayEltSize % ResSize == 0) {
1757 Value *Idx = GEP.getOperand(1);
1758 unsigned BitWidth = Idx->getType()->getPrimitiveSizeInBits();
1759 uint64_t Scale = ArrayEltSize / ResSize;
1761 // Earlier transforms ensure that the index has type IntPtrType, which
1762 // considerably simplifies the logic by eliminating implicit casts.
1763 assert(Idx->getType() == DL.getIntPtrType(GEP.getType()) &&
1764 "Index not cast to pointer width?");
1767 if (Value *NewIdx = Descale(Idx, APInt(BitWidth, Scale), NSW)) {
1768 // Successfully decomposed Idx as NewIdx * Scale, form a new GEP.
1769 // If the multiplication NewIdx * Scale may overflow then the new
1770 // GEP may not be "inbounds".
1772 Constant::getNullValue(DL.getIntPtrType(GEP.getType())),
1775 Value *NewGEP = GEP.isInBounds() && NSW
1776 ? Builder->CreateInBoundsGEP(
1777 SrcElTy, StrippedPtr, Off, GEP.getName())
1778 : Builder->CreateGEP(SrcElTy, StrippedPtr, Off,
1780 // The NewGEP must be pointer typed, so must the old one -> BitCast
1781 return CastInst::CreatePointerBitCastOrAddrSpaceCast(NewGEP,
1789 // addrspacecast between types is canonicalized as a bitcast, then an
1790 // addrspacecast. To take advantage of the below bitcast + struct GEP, look
1791 // through the addrspacecast.
1792 if (AddrSpaceCastInst *ASC = dyn_cast<AddrSpaceCastInst>(PtrOp)) {
1793 // X = bitcast A addrspace(1)* to B addrspace(1)*
1794 // Y = addrspacecast A addrspace(1)* to B addrspace(2)*
1795 // Z = gep Y, <...constant indices...>
1796 // Into an addrspacecasted GEP of the struct.
1797 if (BitCastInst *BC = dyn_cast<BitCastInst>(ASC->getOperand(0)))
1801 /// See if we can simplify:
1802 /// X = bitcast A* to B*
1803 /// Y = gep X, <...constant indices...>
1804 /// into a gep of the original struct. This is important for SROA and alias
1805 /// analysis of unions. If "A" is also a bitcast, wait for A/X to be merged.
1806 if (BitCastInst *BCI = dyn_cast<BitCastInst>(PtrOp)) {
1807 Value *Operand = BCI->getOperand(0);
1808 PointerType *OpType = cast<PointerType>(Operand->getType());
1809 unsigned OffsetBits = DL.getPointerTypeSizeInBits(GEP.getType());
1810 APInt Offset(OffsetBits, 0);
1811 if (!isa<BitCastInst>(Operand) &&
1812 GEP.accumulateConstantOffset(DL, Offset)) {
1814 // If this GEP instruction doesn't move the pointer, just replace the GEP
1815 // with a bitcast of the real input to the dest type.
1817 // If the bitcast is of an allocation, and the allocation will be
1818 // converted to match the type of the cast, don't touch this.
1819 if (isa<AllocaInst>(Operand) || isAllocationFn(Operand, TLI)) {
1820 // See if the bitcast simplifies, if so, don't nuke this GEP yet.
1821 if (Instruction *I = visitBitCast(*BCI)) {
1824 BCI->getParent()->getInstList().insert(BCI->getIterator(), I);
1825 ReplaceInstUsesWith(*BCI, I);
1831 if (Operand->getType()->getPointerAddressSpace() != GEP.getAddressSpace())
1832 return new AddrSpaceCastInst(Operand, GEP.getType());
1833 return new BitCastInst(Operand, GEP.getType());
1836 // Otherwise, if the offset is non-zero, we need to find out if there is a
1837 // field at Offset in 'A's type. If so, we can pull the cast through the
1839 SmallVector<Value*, 8> NewIndices;
1840 if (FindElementAtOffset(OpType, Offset.getSExtValue(), NewIndices)) {
1843 ? Builder->CreateInBoundsGEP(nullptr, Operand, NewIndices)
1844 : Builder->CreateGEP(nullptr, Operand, NewIndices);
1846 if (NGEP->getType() == GEP.getType())
1847 return ReplaceInstUsesWith(GEP, NGEP);
1848 NGEP->takeName(&GEP);
1850 if (NGEP->getType()->getPointerAddressSpace() != GEP.getAddressSpace())
1851 return new AddrSpaceCastInst(NGEP, GEP.getType());
1852 return new BitCastInst(NGEP, GEP.getType());
1861 isAllocSiteRemovable(Instruction *AI, SmallVectorImpl<WeakVH> &Users,
1862 const TargetLibraryInfo *TLI) {
1863 SmallVector<Instruction*, 4> Worklist;
1864 Worklist.push_back(AI);
1867 Instruction *PI = Worklist.pop_back_val();
1868 for (User *U : PI->users()) {
1869 Instruction *I = cast<Instruction>(U);
1870 switch (I->getOpcode()) {
1872 // Give up the moment we see something we can't handle.
1875 case Instruction::BitCast:
1876 case Instruction::GetElementPtr:
1877 Users.emplace_back(I);
1878 Worklist.push_back(I);
1881 case Instruction::ICmp: {
1882 ICmpInst *ICI = cast<ICmpInst>(I);
1883 // We can fold eq/ne comparisons with null to false/true, respectively.
1884 if (!ICI->isEquality() || !isa<ConstantPointerNull>(ICI->getOperand(1)))
1886 Users.emplace_back(I);
1890 case Instruction::Call:
1891 // Ignore no-op and store intrinsics.
1892 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
1893 switch (II->getIntrinsicID()) {
1897 case Intrinsic::memmove:
1898 case Intrinsic::memcpy:
1899 case Intrinsic::memset: {
1900 MemIntrinsic *MI = cast<MemIntrinsic>(II);
1901 if (MI->isVolatile() || MI->getRawDest() != PI)
1905 case Intrinsic::dbg_declare:
1906 case Intrinsic::dbg_value:
1907 case Intrinsic::invariant_start:
1908 case Intrinsic::invariant_end:
1909 case Intrinsic::lifetime_start:
1910 case Intrinsic::lifetime_end:
1911 case Intrinsic::objectsize:
1912 Users.emplace_back(I);
1917 if (isFreeCall(I, TLI)) {
1918 Users.emplace_back(I);
1923 case Instruction::Store: {
1924 StoreInst *SI = cast<StoreInst>(I);
1925 if (SI->isVolatile() || SI->getPointerOperand() != PI)
1927 Users.emplace_back(I);
1931 llvm_unreachable("missing a return?");
1933 } while (!Worklist.empty());
1937 Instruction *InstCombiner::visitAllocSite(Instruction &MI) {
1938 // If we have a malloc call which is only used in any amount of comparisons
1939 // to null and free calls, delete the calls and replace the comparisons with
1940 // true or false as appropriate.
1941 SmallVector<WeakVH, 64> Users;
1942 if (isAllocSiteRemovable(&MI, Users, TLI)) {
1943 for (unsigned i = 0, e = Users.size(); i != e; ++i) {
1944 Instruction *I = cast_or_null<Instruction>(&*Users[i]);
1947 if (ICmpInst *C = dyn_cast<ICmpInst>(I)) {
1948 ReplaceInstUsesWith(*C,
1949 ConstantInt::get(Type::getInt1Ty(C->getContext()),
1950 C->isFalseWhenEqual()));
1951 } else if (isa<BitCastInst>(I) || isa<GetElementPtrInst>(I)) {
1952 ReplaceInstUsesWith(*I, UndefValue::get(I->getType()));
1953 } else if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(I)) {
1954 if (II->getIntrinsicID() == Intrinsic::objectsize) {
1955 ConstantInt *CI = cast<ConstantInt>(II->getArgOperand(1));
1956 uint64_t DontKnow = CI->isZero() ? -1ULL : 0;
1957 ReplaceInstUsesWith(*I, ConstantInt::get(I->getType(), DontKnow));
1960 EraseInstFromFunction(*I);
1963 if (InvokeInst *II = dyn_cast<InvokeInst>(&MI)) {
1964 // Replace invoke with a NOP intrinsic to maintain the original CFG
1965 Module *M = II->getModule();
1966 Function *F = Intrinsic::getDeclaration(M, Intrinsic::donothing);
1967 InvokeInst::Create(F, II->getNormalDest(), II->getUnwindDest(),
1968 None, "", II->getParent());
1970 return EraseInstFromFunction(MI);
1975 /// \brief Move the call to free before a NULL test.
1977 /// Check if this free is accessed after its argument has been test
1978 /// against NULL (property 0).
1979 /// If yes, it is legal to move this call in its predecessor block.
1981 /// The move is performed only if the block containing the call to free
1982 /// will be removed, i.e.:
1983 /// 1. it has only one predecessor P, and P has two successors
1984 /// 2. it contains the call and an unconditional branch
1985 /// 3. its successor is the same as its predecessor's successor
1987 /// The profitability is out-of concern here and this function should
1988 /// be called only if the caller knows this transformation would be
1989 /// profitable (e.g., for code size).
1990 static Instruction *
1991 tryToMoveFreeBeforeNullTest(CallInst &FI) {
1992 Value *Op = FI.getArgOperand(0);
1993 BasicBlock *FreeInstrBB = FI.getParent();
1994 BasicBlock *PredBB = FreeInstrBB->getSinglePredecessor();
1996 // Validate part of constraint #1: Only one predecessor
1997 // FIXME: We can extend the number of predecessor, but in that case, we
1998 // would duplicate the call to free in each predecessor and it may
1999 // not be profitable even for code size.
2003 // Validate constraint #2: Does this block contains only the call to
2004 // free and an unconditional branch?
2005 // FIXME: We could check if we can speculate everything in the
2006 // predecessor block
2007 if (FreeInstrBB->size() != 2)
2010 if (!match(FreeInstrBB->getTerminator(), m_UnconditionalBr(SuccBB)))
2013 // Validate the rest of constraint #1 by matching on the pred branch.
2014 TerminatorInst *TI = PredBB->getTerminator();
2015 BasicBlock *TrueBB, *FalseBB;
2016 ICmpInst::Predicate Pred;
2017 if (!match(TI, m_Br(m_ICmp(Pred, m_Specific(Op), m_Zero()), TrueBB, FalseBB)))
2019 if (Pred != ICmpInst::ICMP_EQ && Pred != ICmpInst::ICMP_NE)
2022 // Validate constraint #3: Ensure the null case just falls through.
2023 if (SuccBB != (Pred == ICmpInst::ICMP_EQ ? TrueBB : FalseBB))
2025 assert(FreeInstrBB == (Pred == ICmpInst::ICMP_EQ ? FalseBB : TrueBB) &&
2026 "Broken CFG: missing edge from predecessor to successor");
2033 Instruction *InstCombiner::visitFree(CallInst &FI) {
2034 Value *Op = FI.getArgOperand(0);
2036 // free undef -> unreachable.
2037 if (isa<UndefValue>(Op)) {
2038 // Insert a new store to null because we cannot modify the CFG here.
2039 Builder->CreateStore(ConstantInt::getTrue(FI.getContext()),
2040 UndefValue::get(Type::getInt1PtrTy(FI.getContext())));
2041 return EraseInstFromFunction(FI);
2044 // If we have 'free null' delete the instruction. This can happen in stl code
2045 // when lots of inlining happens.
2046 if (isa<ConstantPointerNull>(Op))
2047 return EraseInstFromFunction(FI);
2049 // If we optimize for code size, try to move the call to free before the null
2050 // test so that simplify cfg can remove the empty block and dead code
2051 // elimination the branch. I.e., helps to turn something like:
2052 // if (foo) free(foo);
2056 if (Instruction *I = tryToMoveFreeBeforeNullTest(FI))
2062 Instruction *InstCombiner::visitReturnInst(ReturnInst &RI) {
2063 if (RI.getNumOperands() == 0) // ret void
2066 Value *ResultOp = RI.getOperand(0);
2067 Type *VTy = ResultOp->getType();
2068 if (!VTy->isIntegerTy())
2071 // There might be assume intrinsics dominating this return that completely
2072 // determine the value. If so, constant fold it.
2073 unsigned BitWidth = VTy->getPrimitiveSizeInBits();
2074 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
2075 computeKnownBits(ResultOp, KnownZero, KnownOne, 0, &RI);
2076 if ((KnownZero|KnownOne).isAllOnesValue())
2077 RI.setOperand(0, Constant::getIntegerValue(VTy, KnownOne));
2082 Instruction *InstCombiner::visitBranchInst(BranchInst &BI) {
2083 // Change br (not X), label True, label False to: br X, label False, True
2085 BasicBlock *TrueDest;
2086 BasicBlock *FalseDest;
2087 if (match(&BI, m_Br(m_Not(m_Value(X)), TrueDest, FalseDest)) &&
2088 !isa<Constant>(X)) {
2089 // Swap Destinations and condition...
2091 BI.swapSuccessors();
2095 // If the condition is irrelevant, remove the use so that other
2096 // transforms on the condition become more effective.
2097 if (BI.isConditional() &&
2098 BI.getSuccessor(0) == BI.getSuccessor(1) &&
2099 !isa<UndefValue>(BI.getCondition())) {
2100 BI.setCondition(UndefValue::get(BI.getCondition()->getType()));
2104 // Canonicalize fcmp_one -> fcmp_oeq
2105 FCmpInst::Predicate FPred; Value *Y;
2106 if (match(&BI, m_Br(m_FCmp(FPred, m_Value(X), m_Value(Y)),
2107 TrueDest, FalseDest)) &&
2108 BI.getCondition()->hasOneUse())
2109 if (FPred == FCmpInst::FCMP_ONE || FPred == FCmpInst::FCMP_OLE ||
2110 FPred == FCmpInst::FCMP_OGE) {
2111 FCmpInst *Cond = cast<FCmpInst>(BI.getCondition());
2112 Cond->setPredicate(FCmpInst::getInversePredicate(FPred));
2114 // Swap Destinations and condition.
2115 BI.swapSuccessors();
2120 // Canonicalize icmp_ne -> icmp_eq
2121 ICmpInst::Predicate IPred;
2122 if (match(&BI, m_Br(m_ICmp(IPred, m_Value(X), m_Value(Y)),
2123 TrueDest, FalseDest)) &&
2124 BI.getCondition()->hasOneUse())
2125 if (IPred == ICmpInst::ICMP_NE || IPred == ICmpInst::ICMP_ULE ||
2126 IPred == ICmpInst::ICMP_SLE || IPred == ICmpInst::ICMP_UGE ||
2127 IPred == ICmpInst::ICMP_SGE) {
2128 ICmpInst *Cond = cast<ICmpInst>(BI.getCondition());
2129 Cond->setPredicate(ICmpInst::getInversePredicate(IPred));
2130 // Swap Destinations and condition.
2131 BI.swapSuccessors();
2139 Instruction *InstCombiner::visitSwitchInst(SwitchInst &SI) {
2140 Value *Cond = SI.getCondition();
2141 unsigned BitWidth = cast<IntegerType>(Cond->getType())->getBitWidth();
2142 APInt KnownZero(BitWidth, 0), KnownOne(BitWidth, 0);
2143 computeKnownBits(Cond, KnownZero, KnownOne, 0, &SI);
2144 unsigned LeadingKnownZeros = KnownZero.countLeadingOnes();
2145 unsigned LeadingKnownOnes = KnownOne.countLeadingOnes();
2147 // Compute the number of leading bits we can ignore.
2148 for (auto &C : SI.cases()) {
2149 LeadingKnownZeros = std::min(
2150 LeadingKnownZeros, C.getCaseValue()->getValue().countLeadingZeros());
2151 LeadingKnownOnes = std::min(
2152 LeadingKnownOnes, C.getCaseValue()->getValue().countLeadingOnes());
2155 unsigned NewWidth = BitWidth - std::max(LeadingKnownZeros, LeadingKnownOnes);
2157 // Truncate the condition operand if the new type is equal to or larger than
2158 // the largest legal integer type. We need to be conservative here since
2159 // x86 generates redundant zero-extension instructions if the operand is
2160 // truncated to i8 or i16.
2161 bool TruncCond = false;
2162 if (NewWidth > 0 && BitWidth > NewWidth &&
2163 NewWidth >= DL.getLargestLegalIntTypeSize()) {
2165 IntegerType *Ty = IntegerType::get(SI.getContext(), NewWidth);
2166 Builder->SetInsertPoint(&SI);
2167 Value *NewCond = Builder->CreateTrunc(SI.getCondition(), Ty, "trunc");
2168 SI.setCondition(NewCond);
2170 for (auto &C : SI.cases())
2171 static_cast<SwitchInst::CaseIt *>(&C)->setValue(ConstantInt::get(
2172 SI.getContext(), C.getCaseValue()->getValue().trunc(NewWidth)));
2175 if (Instruction *I = dyn_cast<Instruction>(Cond)) {
2176 if (I->getOpcode() == Instruction::Add)
2177 if (ConstantInt *AddRHS = dyn_cast<ConstantInt>(I->getOperand(1))) {
2178 // change 'switch (X+4) case 1:' into 'switch (X) case -3'
2179 // Skip the first item since that's the default case.
2180 for (SwitchInst::CaseIt i = SI.case_begin(), e = SI.case_end();
2182 ConstantInt* CaseVal = i.getCaseValue();
2183 Constant *LHS = CaseVal;
2185 LHS = LeadingKnownZeros
2186 ? ConstantExpr::getZExt(CaseVal, Cond->getType())
2187 : ConstantExpr::getSExt(CaseVal, Cond->getType());
2188 Constant* NewCaseVal = ConstantExpr::getSub(LHS, AddRHS);
2189 assert(isa<ConstantInt>(NewCaseVal) &&
2190 "Result of expression should be constant");
2191 i.setValue(cast<ConstantInt>(NewCaseVal));
2193 SI.setCondition(I->getOperand(0));
2199 return TruncCond ? &SI : nullptr;
2202 Instruction *InstCombiner::visitExtractValueInst(ExtractValueInst &EV) {
2203 Value *Agg = EV.getAggregateOperand();
2205 if (!EV.hasIndices())
2206 return ReplaceInstUsesWith(EV, Agg);
2209 SimplifyExtractValueInst(Agg, EV.getIndices(), DL, TLI, DT, AC))
2210 return ReplaceInstUsesWith(EV, V);
2212 if (InsertValueInst *IV = dyn_cast<InsertValueInst>(Agg)) {
2213 // We're extracting from an insertvalue instruction, compare the indices
2214 const unsigned *exti, *exte, *insi, *inse;
2215 for (exti = EV.idx_begin(), insi = IV->idx_begin(),
2216 exte = EV.idx_end(), inse = IV->idx_end();
2217 exti != exte && insi != inse;
2220 // The insert and extract both reference distinctly different elements.
2221 // This means the extract is not influenced by the insert, and we can
2222 // replace the aggregate operand of the extract with the aggregate
2223 // operand of the insert. i.e., replace
2224 // %I = insertvalue { i32, { i32 } } %A, { i32 } { i32 42 }, 1
2225 // %E = extractvalue { i32, { i32 } } %I, 0
2227 // %E = extractvalue { i32, { i32 } } %A, 0
2228 return ExtractValueInst::Create(IV->getAggregateOperand(),
2231 if (exti == exte && insi == inse)
2232 // Both iterators are at the end: Index lists are identical. Replace
2233 // %B = insertvalue { i32, { i32 } } %A, i32 42, 1, 0
2234 // %C = extractvalue { i32, { i32 } } %B, 1, 0
2236 return ReplaceInstUsesWith(EV, IV->getInsertedValueOperand());
2238 // The extract list is a prefix of the insert list. i.e. replace
2239 // %I = insertvalue { i32, { i32 } } %A, i32 42, 1, 0
2240 // %E = extractvalue { i32, { i32 } } %I, 1
2242 // %X = extractvalue { i32, { i32 } } %A, 1
2243 // %E = insertvalue { i32 } %X, i32 42, 0
2244 // by switching the order of the insert and extract (though the
2245 // insertvalue should be left in, since it may have other uses).
2246 Value *NewEV = Builder->CreateExtractValue(IV->getAggregateOperand(),
2248 return InsertValueInst::Create(NewEV, IV->getInsertedValueOperand(),
2249 makeArrayRef(insi, inse));
2252 // The insert list is a prefix of the extract list
2253 // We can simply remove the common indices from the extract and make it
2254 // operate on the inserted value instead of the insertvalue result.
2256 // %I = insertvalue { i32, { i32 } } %A, { i32 } { i32 42 }, 1
2257 // %E = extractvalue { i32, { i32 } } %I, 1, 0
2259 // %E extractvalue { i32 } { i32 42 }, 0
2260 return ExtractValueInst::Create(IV->getInsertedValueOperand(),
2261 makeArrayRef(exti, exte));
2263 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(Agg)) {
2264 // We're extracting from an intrinsic, see if we're the only user, which
2265 // allows us to simplify multiple result intrinsics to simpler things that
2266 // just get one value.
2267 if (II->hasOneUse()) {
2268 // Check if we're grabbing the overflow bit or the result of a 'with
2269 // overflow' intrinsic. If it's the latter we can remove the intrinsic
2270 // and replace it with a traditional binary instruction.
2271 switch (II->getIntrinsicID()) {
2272 case Intrinsic::uadd_with_overflow:
2273 case Intrinsic::sadd_with_overflow:
2274 if (*EV.idx_begin() == 0) { // Normal result.
2275 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1);
2276 ReplaceInstUsesWith(*II, UndefValue::get(II->getType()));
2277 EraseInstFromFunction(*II);
2278 return BinaryOperator::CreateAdd(LHS, RHS);
2281 // If the normal result of the add is dead, and the RHS is a constant,
2282 // we can transform this into a range comparison.
2283 // overflow = uadd a, -4 --> overflow = icmp ugt a, 3
2284 if (II->getIntrinsicID() == Intrinsic::uadd_with_overflow)
2285 if (ConstantInt *CI = dyn_cast<ConstantInt>(II->getArgOperand(1)))
2286 return new ICmpInst(ICmpInst::ICMP_UGT, II->getArgOperand(0),
2287 ConstantExpr::getNot(CI));
2289 case Intrinsic::usub_with_overflow:
2290 case Intrinsic::ssub_with_overflow:
2291 if (*EV.idx_begin() == 0) { // Normal result.
2292 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1);
2293 ReplaceInstUsesWith(*II, UndefValue::get(II->getType()));
2294 EraseInstFromFunction(*II);
2295 return BinaryOperator::CreateSub(LHS, RHS);
2298 case Intrinsic::umul_with_overflow:
2299 case Intrinsic::smul_with_overflow:
2300 if (*EV.idx_begin() == 0) { // Normal result.
2301 Value *LHS = II->getArgOperand(0), *RHS = II->getArgOperand(1);
2302 ReplaceInstUsesWith(*II, UndefValue::get(II->getType()));
2303 EraseInstFromFunction(*II);
2304 return BinaryOperator::CreateMul(LHS, RHS);
2312 if (LoadInst *L = dyn_cast<LoadInst>(Agg))
2313 // If the (non-volatile) load only has one use, we can rewrite this to a
2314 // load from a GEP. This reduces the size of the load.
2315 // FIXME: If a load is used only by extractvalue instructions then this
2316 // could be done regardless of having multiple uses.
2317 if (L->isSimple() && L->hasOneUse()) {
2318 // extractvalue has integer indices, getelementptr has Value*s. Convert.
2319 SmallVector<Value*, 4> Indices;
2320 // Prefix an i32 0 since we need the first element.
2321 Indices.push_back(Builder->getInt32(0));
2322 for (ExtractValueInst::idx_iterator I = EV.idx_begin(), E = EV.idx_end();
2324 Indices.push_back(Builder->getInt32(*I));
2326 // We need to insert these at the location of the old load, not at that of
2327 // the extractvalue.
2328 Builder->SetInsertPoint(L);
2329 Value *GEP = Builder->CreateInBoundsGEP(L->getType(),
2330 L->getPointerOperand(), Indices);
2331 // Returning the load directly will cause the main loop to insert it in
2332 // the wrong spot, so use ReplaceInstUsesWith().
2333 return ReplaceInstUsesWith(EV, Builder->CreateLoad(GEP));
2335 // We could simplify extracts from other values. Note that nested extracts may
2336 // already be simplified implicitly by the above: extract (extract (insert) )
2337 // will be translated into extract ( insert ( extract ) ) first and then just
2338 // the value inserted, if appropriate. Similarly for extracts from single-use
2339 // loads: extract (extract (load)) will be translated to extract (load (gep))
2340 // and if again single-use then via load (gep (gep)) to load (gep).
2341 // However, double extracts from e.g. function arguments or return values
2342 // aren't handled yet.
2346 /// Return 'true' if the given typeinfo will match anything.
2347 static bool isCatchAll(EHPersonality Personality, Constant *TypeInfo) {
2348 switch (Personality) {
2349 case EHPersonality::GNU_C:
2350 // The GCC C EH personality only exists to support cleanups, so it's not
2351 // clear what the semantics of catch clauses are.
2353 case EHPersonality::Unknown:
2355 case EHPersonality::GNU_Ada:
2356 // While __gnat_all_others_value will match any Ada exception, it doesn't
2357 // match foreign exceptions (or didn't, before gcc-4.7).
2359 case EHPersonality::GNU_CXX:
2360 case EHPersonality::GNU_ObjC:
2361 case EHPersonality::MSVC_X86SEH:
2362 case EHPersonality::MSVC_Win64SEH:
2363 case EHPersonality::MSVC_CXX:
2364 case EHPersonality::CoreCLR:
2365 return TypeInfo->isNullValue();
2367 llvm_unreachable("invalid enum");
2370 static bool shorter_filter(const Value *LHS, const Value *RHS) {
2372 cast<ArrayType>(LHS->getType())->getNumElements()
2374 cast<ArrayType>(RHS->getType())->getNumElements();
2377 Instruction *InstCombiner::visitLandingPadInst(LandingPadInst &LI) {
2378 // The logic here should be correct for any real-world personality function.
2379 // However if that turns out not to be true, the offending logic can always
2380 // be conditioned on the personality function, like the catch-all logic is.
2381 EHPersonality Personality =
2382 classifyEHPersonality(LI.getParent()->getParent()->getPersonalityFn());
2384 // Simplify the list of clauses, eg by removing repeated catch clauses
2385 // (these are often created by inlining).
2386 bool MakeNewInstruction = false; // If true, recreate using the following:
2387 SmallVector<Constant *, 16> NewClauses; // - Clauses for the new instruction;
2388 bool CleanupFlag = LI.isCleanup(); // - The new instruction is a cleanup.
2390 SmallPtrSet<Value *, 16> AlreadyCaught; // Typeinfos known caught already.
2391 for (unsigned i = 0, e = LI.getNumClauses(); i != e; ++i) {
2392 bool isLastClause = i + 1 == e;
2393 if (LI.isCatch(i)) {
2395 Constant *CatchClause = LI.getClause(i);
2396 Constant *TypeInfo = CatchClause->stripPointerCasts();
2398 // If we already saw this clause, there is no point in having a second
2400 if (AlreadyCaught.insert(TypeInfo).second) {
2401 // This catch clause was not already seen.
2402 NewClauses.push_back(CatchClause);
2404 // Repeated catch clause - drop the redundant copy.
2405 MakeNewInstruction = true;
2408 // If this is a catch-all then there is no point in keeping any following
2409 // clauses or marking the landingpad as having a cleanup.
2410 if (isCatchAll(Personality, TypeInfo)) {
2412 MakeNewInstruction = true;
2413 CleanupFlag = false;
2417 // A filter clause. If any of the filter elements were already caught
2418 // then they can be dropped from the filter. It is tempting to try to
2419 // exploit the filter further by saying that any typeinfo that does not
2420 // occur in the filter can't be caught later (and thus can be dropped).
2421 // However this would be wrong, since typeinfos can match without being
2422 // equal (for example if one represents a C++ class, and the other some
2423 // class derived from it).
2424 assert(LI.isFilter(i) && "Unsupported landingpad clause!");
2425 Constant *FilterClause = LI.getClause(i);
2426 ArrayType *FilterType = cast<ArrayType>(FilterClause->getType());
2427 unsigned NumTypeInfos = FilterType->getNumElements();
2429 // An empty filter catches everything, so there is no point in keeping any
2430 // following clauses or marking the landingpad as having a cleanup. By
2431 // dealing with this case here the following code is made a bit simpler.
2432 if (!NumTypeInfos) {
2433 NewClauses.push_back(FilterClause);
2435 MakeNewInstruction = true;
2436 CleanupFlag = false;
2440 bool MakeNewFilter = false; // If true, make a new filter.
2441 SmallVector<Constant *, 16> NewFilterElts; // New elements.
2442 if (isa<ConstantAggregateZero>(FilterClause)) {
2443 // Not an empty filter - it contains at least one null typeinfo.
2444 assert(NumTypeInfos > 0 && "Should have handled empty filter already!");
2445 Constant *TypeInfo =
2446 Constant::getNullValue(FilterType->getElementType());
2447 // If this typeinfo is a catch-all then the filter can never match.
2448 if (isCatchAll(Personality, TypeInfo)) {
2449 // Throw the filter away.
2450 MakeNewInstruction = true;
2454 // There is no point in having multiple copies of this typeinfo, so
2455 // discard all but the first copy if there is more than one.
2456 NewFilterElts.push_back(TypeInfo);
2457 if (NumTypeInfos > 1)
2458 MakeNewFilter = true;
2460 ConstantArray *Filter = cast<ConstantArray>(FilterClause);
2461 SmallPtrSet<Value *, 16> SeenInFilter; // For uniquing the elements.
2462 NewFilterElts.reserve(NumTypeInfos);
2464 // Remove any filter elements that were already caught or that already
2465 // occurred in the filter. While there, see if any of the elements are
2466 // catch-alls. If so, the filter can be discarded.
2467 bool SawCatchAll = false;
2468 for (unsigned j = 0; j != NumTypeInfos; ++j) {
2469 Constant *Elt = Filter->getOperand(j);
2470 Constant *TypeInfo = Elt->stripPointerCasts();
2471 if (isCatchAll(Personality, TypeInfo)) {
2472 // This element is a catch-all. Bail out, noting this fact.
2477 // Even if we've seen a type in a catch clause, we don't want to
2478 // remove it from the filter. An unexpected type handler may be
2479 // set up for a call site which throws an exception of the same
2480 // type caught. In order for the exception thrown by the unexpected
2481 // handler to propogate correctly, the filter must be correctly
2482 // described for the call site.
2486 // void unexpected() { throw 1;}
2487 // void foo() throw (int) {
2488 // std::set_unexpected(unexpected);
2491 // } catch (int i) {}
2494 // There is no point in having multiple copies of the same typeinfo in
2495 // a filter, so only add it if we didn't already.
2496 if (SeenInFilter.insert(TypeInfo).second)
2497 NewFilterElts.push_back(cast<Constant>(Elt));
2499 // A filter containing a catch-all cannot match anything by definition.
2501 // Throw the filter away.
2502 MakeNewInstruction = true;
2506 // If we dropped something from the filter, make a new one.
2507 if (NewFilterElts.size() < NumTypeInfos)
2508 MakeNewFilter = true;
2510 if (MakeNewFilter) {
2511 FilterType = ArrayType::get(FilterType->getElementType(),
2512 NewFilterElts.size());
2513 FilterClause = ConstantArray::get(FilterType, NewFilterElts);
2514 MakeNewInstruction = true;
2517 NewClauses.push_back(FilterClause);
2519 // If the new filter is empty then it will catch everything so there is
2520 // no point in keeping any following clauses or marking the landingpad
2521 // as having a cleanup. The case of the original filter being empty was
2522 // already handled above.
2523 if (MakeNewFilter && !NewFilterElts.size()) {
2524 assert(MakeNewInstruction && "New filter but not a new instruction!");
2525 CleanupFlag = false;
2531 // If several filters occur in a row then reorder them so that the shortest
2532 // filters come first (those with the smallest number of elements). This is
2533 // advantageous because shorter filters are more likely to match, speeding up
2534 // unwinding, but mostly because it increases the effectiveness of the other
2535 // filter optimizations below.
2536 for (unsigned i = 0, e = NewClauses.size(); i + 1 < e; ) {
2538 // Find the maximal 'j' s.t. the range [i, j) consists entirely of filters.
2539 for (j = i; j != e; ++j)
2540 if (!isa<ArrayType>(NewClauses[j]->getType()))
2543 // Check whether the filters are already sorted by length. We need to know
2544 // if sorting them is actually going to do anything so that we only make a
2545 // new landingpad instruction if it does.
2546 for (unsigned k = i; k + 1 < j; ++k)
2547 if (shorter_filter(NewClauses[k+1], NewClauses[k])) {
2548 // Not sorted, so sort the filters now. Doing an unstable sort would be
2549 // correct too but reordering filters pointlessly might confuse users.
2550 std::stable_sort(NewClauses.begin() + i, NewClauses.begin() + j,
2552 MakeNewInstruction = true;
2556 // Look for the next batch of filters.
2560 // If typeinfos matched if and only if equal, then the elements of a filter L
2561 // that occurs later than a filter F could be replaced by the intersection of
2562 // the elements of F and L. In reality two typeinfos can match without being
2563 // equal (for example if one represents a C++ class, and the other some class
2564 // derived from it) so it would be wrong to perform this transform in general.
2565 // However the transform is correct and useful if F is a subset of L. In that
2566 // case L can be replaced by F, and thus removed altogether since repeating a
2567 // filter is pointless. So here we look at all pairs of filters F and L where
2568 // L follows F in the list of clauses, and remove L if every element of F is
2569 // an element of L. This can occur when inlining C++ functions with exception
2571 for (unsigned i = 0; i + 1 < NewClauses.size(); ++i) {
2572 // Examine each filter in turn.
2573 Value *Filter = NewClauses[i];
2574 ArrayType *FTy = dyn_cast<ArrayType>(Filter->getType());
2576 // Not a filter - skip it.
2578 unsigned FElts = FTy->getNumElements();
2579 // Examine each filter following this one. Doing this backwards means that
2580 // we don't have to worry about filters disappearing under us when removed.
2581 for (unsigned j = NewClauses.size() - 1; j != i; --j) {
2582 Value *LFilter = NewClauses[j];
2583 ArrayType *LTy = dyn_cast<ArrayType>(LFilter->getType());
2585 // Not a filter - skip it.
2587 // If Filter is a subset of LFilter, i.e. every element of Filter is also
2588 // an element of LFilter, then discard LFilter.
2589 SmallVectorImpl<Constant *>::iterator J = NewClauses.begin() + j;
2590 // If Filter is empty then it is a subset of LFilter.
2593 NewClauses.erase(J);
2594 MakeNewInstruction = true;
2595 // Move on to the next filter.
2598 unsigned LElts = LTy->getNumElements();
2599 // If Filter is longer than LFilter then it cannot be a subset of it.
2601 // Move on to the next filter.
2603 // At this point we know that LFilter has at least one element.
2604 if (isa<ConstantAggregateZero>(LFilter)) { // LFilter only contains zeros.
2605 // Filter is a subset of LFilter iff Filter contains only zeros (as we
2606 // already know that Filter is not longer than LFilter).
2607 if (isa<ConstantAggregateZero>(Filter)) {
2608 assert(FElts <= LElts && "Should have handled this case earlier!");
2610 NewClauses.erase(J);
2611 MakeNewInstruction = true;
2613 // Move on to the next filter.
2616 ConstantArray *LArray = cast<ConstantArray>(LFilter);
2617 if (isa<ConstantAggregateZero>(Filter)) { // Filter only contains zeros.
2618 // Since Filter is non-empty and contains only zeros, it is a subset of
2619 // LFilter iff LFilter contains a zero.
2620 assert(FElts > 0 && "Should have eliminated the empty filter earlier!");
2621 for (unsigned l = 0; l != LElts; ++l)
2622 if (LArray->getOperand(l)->isNullValue()) {
2623 // LFilter contains a zero - discard it.
2624 NewClauses.erase(J);
2625 MakeNewInstruction = true;
2628 // Move on to the next filter.
2631 // At this point we know that both filters are ConstantArrays. Loop over
2632 // operands to see whether every element of Filter is also an element of
2633 // LFilter. Since filters tend to be short this is probably faster than
2634 // using a method that scales nicely.
2635 ConstantArray *FArray = cast<ConstantArray>(Filter);
2636 bool AllFound = true;
2637 for (unsigned f = 0; f != FElts; ++f) {
2638 Value *FTypeInfo = FArray->getOperand(f)->stripPointerCasts();
2640 for (unsigned l = 0; l != LElts; ++l) {
2641 Value *LTypeInfo = LArray->getOperand(l)->stripPointerCasts();
2642 if (LTypeInfo == FTypeInfo) {
2652 NewClauses.erase(J);
2653 MakeNewInstruction = true;
2655 // Move on to the next filter.
2659 // If we changed any of the clauses, replace the old landingpad instruction
2661 if (MakeNewInstruction) {
2662 LandingPadInst *NLI = LandingPadInst::Create(LI.getType(),
2664 for (unsigned i = 0, e = NewClauses.size(); i != e; ++i)
2665 NLI->addClause(NewClauses[i]);
2666 // A landing pad with no clauses must have the cleanup flag set. It is
2667 // theoretically possible, though highly unlikely, that we eliminated all
2668 // clauses. If so, force the cleanup flag to true.
2669 if (NewClauses.empty())
2671 NLI->setCleanup(CleanupFlag);
2675 // Even if none of the clauses changed, we may nonetheless have understood
2676 // that the cleanup flag is pointless. Clear it if so.
2677 if (LI.isCleanup() != CleanupFlag) {
2678 assert(!CleanupFlag && "Adding a cleanup, not removing one?!");
2679 LI.setCleanup(CleanupFlag);
2686 /// Try to move the specified instruction from its current block into the
2687 /// beginning of DestBlock, which can only happen if it's safe to move the
2688 /// instruction past all of the instructions between it and the end of its
2690 static bool TryToSinkInstruction(Instruction *I, BasicBlock *DestBlock) {
2691 assert(I->hasOneUse() && "Invariants didn't hold!");
2693 // Cannot move control-flow-involving, volatile loads, vaarg, etc.
2694 if (isa<PHINode>(I) || I->isEHPad() || I->mayHaveSideEffects() ||
2695 isa<TerminatorInst>(I))
2698 // Do not sink alloca instructions out of the entry block.
2699 if (isa<AllocaInst>(I) && I->getParent() ==
2700 &DestBlock->getParent()->getEntryBlock())
2703 // Do not sink convergent call instructions.
2704 if (auto *CI = dyn_cast<CallInst>(I)) {
2705 if (CI->isConvergent())
2709 // We can only sink load instructions if there is nothing between the load and
2710 // the end of block that could change the value.
2711 if (I->mayReadFromMemory()) {
2712 for (BasicBlock::iterator Scan = I->getIterator(),
2713 E = I->getParent()->end();
2715 if (Scan->mayWriteToMemory())
2719 BasicBlock::iterator InsertPos = DestBlock->getFirstInsertionPt();
2720 I->moveBefore(&*InsertPos);
2725 bool InstCombiner::run() {
2726 while (!Worklist.isEmpty()) {
2727 Instruction *I = Worklist.RemoveOne();
2728 if (I == nullptr) continue; // skip null values.
2730 // Check to see if we can DCE the instruction.
2731 if (isInstructionTriviallyDead(I, TLI)) {
2732 DEBUG(dbgs() << "IC: DCE: " << *I << '\n');
2733 EraseInstFromFunction(*I);
2735 MadeIRChange = true;
2739 // Instruction isn't dead, see if we can constant propagate it.
2740 if (!I->use_empty() &&
2741 (I->getNumOperands() == 0 || isa<Constant>(I->getOperand(0)))) {
2742 if (Constant *C = ConstantFoldInstruction(I, DL, TLI)) {
2743 DEBUG(dbgs() << "IC: ConstFold to: " << *C << " from: " << *I << '\n');
2745 // Add operands to the worklist.
2746 ReplaceInstUsesWith(*I, C);
2748 EraseInstFromFunction(*I);
2749 MadeIRChange = true;
2754 // In general, it is possible for computeKnownBits to determine all bits in a
2755 // value even when the operands are not all constants.
2756 if (!I->use_empty() && I->getType()->isIntegerTy()) {
2757 unsigned BitWidth = I->getType()->getScalarSizeInBits();
2758 APInt KnownZero(BitWidth, 0);
2759 APInt KnownOne(BitWidth, 0);
2760 computeKnownBits(I, KnownZero, KnownOne, /*Depth*/0, I);
2761 if ((KnownZero | KnownOne).isAllOnesValue()) {
2762 Constant *C = ConstantInt::get(I->getContext(), KnownOne);
2763 DEBUG(dbgs() << "IC: ConstFold (all bits known) to: " << *C <<
2764 " from: " << *I << '\n');
2766 // Add operands to the worklist.
2767 ReplaceInstUsesWith(*I, C);
2769 EraseInstFromFunction(*I);
2770 MadeIRChange = true;
2775 // See if we can trivially sink this instruction to a successor basic block.
2776 if (I->hasOneUse()) {
2777 BasicBlock *BB = I->getParent();
2778 Instruction *UserInst = cast<Instruction>(*I->user_begin());
2779 BasicBlock *UserParent;
2781 // Get the block the use occurs in.
2782 if (PHINode *PN = dyn_cast<PHINode>(UserInst))
2783 UserParent = PN->getIncomingBlock(*I->use_begin());
2785 UserParent = UserInst->getParent();
2787 if (UserParent != BB) {
2788 bool UserIsSuccessor = false;
2789 // See if the user is one of our successors.
2790 for (succ_iterator SI = succ_begin(BB), E = succ_end(BB); SI != E; ++SI)
2791 if (*SI == UserParent) {
2792 UserIsSuccessor = true;
2796 // If the user is one of our immediate successors, and if that successor
2797 // only has us as a predecessors (we'd have to split the critical edge
2798 // otherwise), we can keep going.
2799 if (UserIsSuccessor && UserParent->getSinglePredecessor()) {
2800 // Okay, the CFG is simple enough, try to sink this instruction.
2801 if (TryToSinkInstruction(I, UserParent)) {
2802 MadeIRChange = true;
2803 // We'll add uses of the sunk instruction below, but since sinking
2804 // can expose opportunities for it's *operands* add them to the
2806 for (Use &U : I->operands())
2807 if (Instruction *OpI = dyn_cast<Instruction>(U.get()))
2814 // Now that we have an instruction, try combining it to simplify it.
2815 Builder->SetInsertPoint(I);
2816 Builder->SetCurrentDebugLocation(I->getDebugLoc());
2821 DEBUG(raw_string_ostream SS(OrigI); I->print(SS); OrigI = SS.str(););
2822 DEBUG(dbgs() << "IC: Visiting: " << OrigI << '\n');
2824 if (Instruction *Result = visit(*I)) {
2826 // Should we replace the old instruction with a new one?
2828 DEBUG(dbgs() << "IC: Old = " << *I << '\n'
2829 << " New = " << *Result << '\n');
2831 if (I->getDebugLoc())
2832 Result->setDebugLoc(I->getDebugLoc());
2833 // Everything uses the new instruction now.
2834 I->replaceAllUsesWith(Result);
2836 // Move the name to the new instruction first.
2837 Result->takeName(I);
2839 // Push the new instruction and any users onto the worklist.
2840 Worklist.Add(Result);
2841 Worklist.AddUsersToWorkList(*Result);
2843 // Insert the new instruction into the basic block...
2844 BasicBlock *InstParent = I->getParent();
2845 BasicBlock::iterator InsertPos = I->getIterator();
2847 // If we replace a PHI with something that isn't a PHI, fix up the
2849 if (!isa<PHINode>(Result) && isa<PHINode>(InsertPos))
2850 InsertPos = InstParent->getFirstInsertionPt();
2852 InstParent->getInstList().insert(InsertPos, Result);
2854 EraseInstFromFunction(*I);
2857 DEBUG(dbgs() << "IC: Mod = " << OrigI << '\n'
2858 << " New = " << *I << '\n');
2861 // If the instruction was modified, it's possible that it is now dead.
2862 // if so, remove it.
2863 if (isInstructionTriviallyDead(I, TLI)) {
2864 EraseInstFromFunction(*I);
2867 Worklist.AddUsersToWorkList(*I);
2870 MadeIRChange = true;
2875 return MadeIRChange;
2878 /// Walk the function in depth-first order, adding all reachable code to the
2881 /// This has a couple of tricks to make the code faster and more powerful. In
2882 /// particular, we constant fold and DCE instructions as we go, to avoid adding
2883 /// them to the worklist (this significantly speeds up instcombine on code where
2884 /// many instructions are dead or constant). Additionally, if we find a branch
2885 /// whose condition is a known constant, we only visit the reachable successors.
2887 static bool AddReachableCodeToWorklist(BasicBlock *BB, const DataLayout &DL,
2888 SmallPtrSetImpl<BasicBlock *> &Visited,
2889 InstCombineWorklist &ICWorklist,
2890 const TargetLibraryInfo *TLI) {
2891 bool MadeIRChange = false;
2892 SmallVector<BasicBlock*, 256> Worklist;
2893 Worklist.push_back(BB);
2895 SmallVector<Instruction*, 128> InstrsForInstCombineWorklist;
2896 DenseMap<ConstantExpr*, Constant*> FoldedConstants;
2899 BB = Worklist.pop_back_val();
2901 // We have now visited this block! If we've already been here, ignore it.
2902 if (!Visited.insert(BB).second)
2905 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) {
2906 Instruction *Inst = &*BBI++;
2908 // DCE instruction if trivially dead.
2909 if (isInstructionTriviallyDead(Inst, TLI)) {
2911 DEBUG(dbgs() << "IC: DCE: " << *Inst << '\n');
2912 Inst->eraseFromParent();
2916 // ConstantProp instruction if trivially constant.
2917 if (!Inst->use_empty() &&
2918 (Inst->getNumOperands() == 0 || isa<Constant>(Inst->getOperand(0))))
2919 if (Constant *C = ConstantFoldInstruction(Inst, DL, TLI)) {
2920 DEBUG(dbgs() << "IC: ConstFold to: " << *C << " from: "
2922 Inst->replaceAllUsesWith(C);
2924 Inst->eraseFromParent();
2928 // See if we can constant fold its operands.
2929 for (User::op_iterator i = Inst->op_begin(), e = Inst->op_end(); i != e;
2931 ConstantExpr *CE = dyn_cast<ConstantExpr>(i);
2935 Constant *&FoldRes = FoldedConstants[CE];
2937 FoldRes = ConstantFoldConstantExpression(CE, DL, TLI);
2941 if (FoldRes != CE) {
2943 MadeIRChange = true;
2947 InstrsForInstCombineWorklist.push_back(Inst);
2950 // Recursively visit successors. If this is a branch or switch on a
2951 // constant, only visit the reachable successor.
2952 TerminatorInst *TI = BB->getTerminator();
2953 if (BranchInst *BI = dyn_cast<BranchInst>(TI)) {
2954 if (BI->isConditional() && isa<ConstantInt>(BI->getCondition())) {
2955 bool CondVal = cast<ConstantInt>(BI->getCondition())->getZExtValue();
2956 BasicBlock *ReachableBB = BI->getSuccessor(!CondVal);
2957 Worklist.push_back(ReachableBB);
2960 } else if (SwitchInst *SI = dyn_cast<SwitchInst>(TI)) {
2961 if (ConstantInt *Cond = dyn_cast<ConstantInt>(SI->getCondition())) {
2962 // See if this is an explicit destination.
2963 for (SwitchInst::CaseIt i = SI->case_begin(), e = SI->case_end();
2965 if (i.getCaseValue() == Cond) {
2966 BasicBlock *ReachableBB = i.getCaseSuccessor();
2967 Worklist.push_back(ReachableBB);
2971 // Otherwise it is the default destination.
2972 Worklist.push_back(SI->getDefaultDest());
2977 for (BasicBlock *SuccBB : TI->successors())
2978 Worklist.push_back(SuccBB);
2979 } while (!Worklist.empty());
2981 // Once we've found all of the instructions to add to instcombine's worklist,
2982 // add them in reverse order. This way instcombine will visit from the top
2983 // of the function down. This jives well with the way that it adds all uses
2984 // of instructions to the worklist after doing a transformation, thus avoiding
2985 // some N^2 behavior in pathological cases.
2986 ICWorklist.AddInitialGroup(InstrsForInstCombineWorklist);
2988 return MadeIRChange;
2991 /// \brief Populate the IC worklist from a function, and prune any dead basic
2992 /// blocks discovered in the process.
2994 /// This also does basic constant propagation and other forward fixing to make
2995 /// the combiner itself run much faster.
2996 static bool prepareICWorklistFromFunction(Function &F, const DataLayout &DL,
2997 TargetLibraryInfo *TLI,
2998 InstCombineWorklist &ICWorklist) {
2999 bool MadeIRChange = false;
3001 // Do a depth-first traversal of the function, populate the worklist with
3002 // the reachable instructions. Ignore blocks that are not reachable. Keep
3003 // track of which blocks we visit.
3004 SmallPtrSet<BasicBlock *, 64> Visited;
3006 AddReachableCodeToWorklist(&F.front(), DL, Visited, ICWorklist, TLI);
3008 // Do a quick scan over the function. If we find any blocks that are
3009 // unreachable, remove any instructions inside of them. This prevents
3010 // the instcombine code from having to deal with some bad special cases.
3011 for (Function::iterator BB = F.begin(), E = F.end(); BB != E; ++BB) {
3012 if (Visited.count(&*BB))
3015 // Delete the instructions backwards, as it has a reduced likelihood of
3016 // having to update as many def-use and use-def chains.
3017 Instruction *EndInst = BB->getTerminator(); // Last not to be deleted.
3018 while (EndInst != BB->begin()) {
3019 // Delete the next to last instruction.
3020 Instruction *Inst = &*--EndInst->getIterator();
3021 if (!Inst->use_empty() && !Inst->getType()->isTokenTy())
3022 Inst->replaceAllUsesWith(UndefValue::get(Inst->getType()));
3023 if (Inst->isEHPad()) {
3027 if (!isa<DbgInfoIntrinsic>(Inst)) {
3029 MadeIRChange = true;
3031 if (!Inst->getType()->isTokenTy())
3032 Inst->eraseFromParent();
3036 return MadeIRChange;
3040 combineInstructionsOverFunction(Function &F, InstCombineWorklist &Worklist,
3041 AliasAnalysis *AA, AssumptionCache &AC,
3042 TargetLibraryInfo &TLI, DominatorTree &DT,
3043 LoopInfo *LI = nullptr) {
3044 auto &DL = F.getParent()->getDataLayout();
3046 /// Builder - This is an IRBuilder that automatically inserts new
3047 /// instructions into the worklist when they are created.
3048 IRBuilder<true, TargetFolder, InstCombineIRInserter> Builder(
3049 F.getContext(), TargetFolder(DL), InstCombineIRInserter(Worklist, &AC));
3051 // Lower dbg.declare intrinsics otherwise their value may be clobbered
3053 bool DbgDeclaresChanged = LowerDbgDeclare(F);
3055 // Iterate while there is work to do.
3059 DEBUG(dbgs() << "\n\nINSTCOMBINE ITERATION #" << Iteration << " on "
3060 << F.getName() << "\n");
3062 bool Changed = false;
3063 if (prepareICWorklistFromFunction(F, DL, &TLI, Worklist))
3066 InstCombiner IC(Worklist, &Builder, F.optForMinSize(),
3067 AA, &AC, &TLI, &DT, DL, LI);
3075 return DbgDeclaresChanged || Iteration > 1;
3078 PreservedAnalyses InstCombinePass::run(Function &F,
3079 AnalysisManager<Function> *AM) {
3080 auto &AC = AM->getResult<AssumptionAnalysis>(F);
3081 auto &DT = AM->getResult<DominatorTreeAnalysis>(F);
3082 auto &TLI = AM->getResult<TargetLibraryAnalysis>(F);
3084 auto *LI = AM->getCachedResult<LoopAnalysis>(F);
3086 // FIXME: The AliasAnalysis is not yet supported in the new pass manager
3087 if (!combineInstructionsOverFunction(F, Worklist, nullptr, AC, TLI, DT, LI))
3088 // No changes, all analyses are preserved.
3089 return PreservedAnalyses::all();
3091 // Mark all the analyses that instcombine updates as preserved.
3092 // FIXME: Need a way to preserve CFG analyses here!
3093 PreservedAnalyses PA;
3094 PA.preserve<DominatorTreeAnalysis>();
3099 /// \brief The legacy pass manager's instcombine pass.
3101 /// This is a basic whole-function wrapper around the instcombine utility. It
3102 /// will try to combine all instructions in the function.
3103 class InstructionCombiningPass : public FunctionPass {
3104 InstCombineWorklist Worklist;
3107 static char ID; // Pass identification, replacement for typeid
3109 InstructionCombiningPass() : FunctionPass(ID) {
3110 initializeInstructionCombiningPassPass(*PassRegistry::getPassRegistry());
3113 void getAnalysisUsage(AnalysisUsage &AU) const override;
3114 bool runOnFunction(Function &F) override;
3118 void InstructionCombiningPass::getAnalysisUsage(AnalysisUsage &AU) const {
3119 AU.setPreservesCFG();
3120 AU.addRequired<AAResultsWrapperPass>();
3121 AU.addRequired<AssumptionCacheTracker>();
3122 AU.addRequired<TargetLibraryInfoWrapperPass>();
3123 AU.addRequired<DominatorTreeWrapperPass>();
3124 AU.addPreserved<DominatorTreeWrapperPass>();
3125 AU.addPreserved<GlobalsAAWrapperPass>();
3128 bool InstructionCombiningPass::runOnFunction(Function &F) {
3129 if (skipOptnoneFunction(F))
3132 // Required analyses.
3133 auto AA = &getAnalysis<AAResultsWrapperPass>().getAAResults();
3134 auto &AC = getAnalysis<AssumptionCacheTracker>().getAssumptionCache(F);
3135 auto &TLI = getAnalysis<TargetLibraryInfoWrapperPass>().getTLI();
3136 auto &DT = getAnalysis<DominatorTreeWrapperPass>().getDomTree();
3138 // Optional analyses.
3139 auto *LIWP = getAnalysisIfAvailable<LoopInfoWrapperPass>();
3140 auto *LI = LIWP ? &LIWP->getLoopInfo() : nullptr;
3142 return combineInstructionsOverFunction(F, Worklist, AA, AC, TLI, DT, LI);
3145 char InstructionCombiningPass::ID = 0;
3146 INITIALIZE_PASS_BEGIN(InstructionCombiningPass, "instcombine",
3147 "Combine redundant instructions", false, false)
3148 INITIALIZE_PASS_DEPENDENCY(AssumptionCacheTracker)
3149 INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfoWrapperPass)
3150 INITIALIZE_PASS_DEPENDENCY(DominatorTreeWrapperPass)
3151 INITIALIZE_PASS_DEPENDENCY(AAResultsWrapperPass)
3152 INITIALIZE_PASS_DEPENDENCY(GlobalsAAWrapperPass)
3153 INITIALIZE_PASS_END(InstructionCombiningPass, "instcombine",
3154 "Combine redundant instructions", false, false)
3156 // Initialization Routines
3157 void llvm::initializeInstCombine(PassRegistry &Registry) {
3158 initializeInstructionCombiningPassPass(Registry);
3161 void LLVMInitializeInstCombine(LLVMPassRegistryRef R) {
3162 initializeInstructionCombiningPassPass(*unwrap(R));
3165 FunctionPass *llvm::createInstructionCombiningPass() {
3166 return new InstructionCombiningPass();