1 //===- InstCombineAndOrXor.cpp --------------------------------------------===//
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 // This file implements the visitAnd, visitOr, and visitXor functions.
12 //===----------------------------------------------------------------------===//
14 #include "InstCombine.h"
15 #include "llvm/Analysis/InstructionSimplify.h"
16 #include "llvm/IR/ConstantRange.h"
17 #include "llvm/IR/Intrinsics.h"
18 #include "llvm/IR/PatternMatch.h"
19 #include "llvm/Transforms/Utils/CmpInstAnalysis.h"
21 using namespace PatternMatch;
23 #define DEBUG_TYPE "instcombine"
25 /// isFreeToInvert - Return true if the specified value is free to invert (apply
26 /// ~ to). This happens in cases where the ~ can be eliminated.
27 static inline bool isFreeToInvert(Value *V) {
29 if (BinaryOperator::isNot(V))
32 // Constants can be considered to be not'ed values.
33 if (isa<ConstantInt>(V))
36 // Compares can be inverted if they have a single use.
37 if (CmpInst *CI = dyn_cast<CmpInst>(V))
38 return CI->hasOneUse();
43 static inline Value *dyn_castNotVal(Value *V) {
44 // If this is not(not(x)) don't return that this is a not: we want the two
45 // not's to be folded first.
46 if (BinaryOperator::isNot(V)) {
47 Value *Operand = BinaryOperator::getNotArgument(V);
48 if (!isFreeToInvert(Operand))
52 // Constants can be considered to be not'ed values...
53 if (ConstantInt *C = dyn_cast<ConstantInt>(V))
54 return ConstantInt::get(C->getType(), ~C->getValue());
58 /// getFCmpCode - Similar to getICmpCode but for FCmpInst. This encodes a fcmp
59 /// predicate into a three bit mask. It also returns whether it is an ordered
60 /// predicate by reference.
61 static unsigned getFCmpCode(FCmpInst::Predicate CC, bool &isOrdered) {
64 case FCmpInst::FCMP_ORD: isOrdered = true; return 0; // 000
65 case FCmpInst::FCMP_UNO: return 0; // 000
66 case FCmpInst::FCMP_OGT: isOrdered = true; return 1; // 001
67 case FCmpInst::FCMP_UGT: return 1; // 001
68 case FCmpInst::FCMP_OEQ: isOrdered = true; return 2; // 010
69 case FCmpInst::FCMP_UEQ: return 2; // 010
70 case FCmpInst::FCMP_OGE: isOrdered = true; return 3; // 011
71 case FCmpInst::FCMP_UGE: return 3; // 011
72 case FCmpInst::FCMP_OLT: isOrdered = true; return 4; // 100
73 case FCmpInst::FCMP_ULT: return 4; // 100
74 case FCmpInst::FCMP_ONE: isOrdered = true; return 5; // 101
75 case FCmpInst::FCMP_UNE: return 5; // 101
76 case FCmpInst::FCMP_OLE: isOrdered = true; return 6; // 110
77 case FCmpInst::FCMP_ULE: return 6; // 110
80 // Not expecting FCMP_FALSE and FCMP_TRUE;
81 llvm_unreachable("Unexpected FCmp predicate!");
85 /// getNewICmpValue - This is the complement of getICmpCode, which turns an
86 /// opcode and two operands into either a constant true or false, or a brand
87 /// new ICmp instruction. The sign is passed in to determine which kind
88 /// of predicate to use in the new icmp instruction.
89 static Value *getNewICmpValue(bool Sign, unsigned Code, Value *LHS, Value *RHS,
90 InstCombiner::BuilderTy *Builder) {
91 ICmpInst::Predicate NewPred;
92 if (Value *NewConstant = getICmpValue(Sign, Code, LHS, RHS, NewPred))
94 return Builder->CreateICmp(NewPred, LHS, RHS);
97 /// getFCmpValue - This is the complement of getFCmpCode, which turns an
98 /// opcode and two operands into either a FCmp instruction. isordered is passed
99 /// in to determine which kind of predicate to use in the new fcmp instruction.
100 static Value *getFCmpValue(bool isordered, unsigned code,
101 Value *LHS, Value *RHS,
102 InstCombiner::BuilderTy *Builder) {
103 CmpInst::Predicate Pred;
105 default: llvm_unreachable("Illegal FCmp code!");
106 case 0: Pred = isordered ? FCmpInst::FCMP_ORD : FCmpInst::FCMP_UNO; break;
107 case 1: Pred = isordered ? FCmpInst::FCMP_OGT : FCmpInst::FCMP_UGT; break;
108 case 2: Pred = isordered ? FCmpInst::FCMP_OEQ : FCmpInst::FCMP_UEQ; break;
109 case 3: Pred = isordered ? FCmpInst::FCMP_OGE : FCmpInst::FCMP_UGE; break;
110 case 4: Pred = isordered ? FCmpInst::FCMP_OLT : FCmpInst::FCMP_ULT; break;
111 case 5: Pred = isordered ? FCmpInst::FCMP_ONE : FCmpInst::FCMP_UNE; break;
112 case 6: Pred = isordered ? FCmpInst::FCMP_OLE : FCmpInst::FCMP_ULE; break;
114 if (!isordered) return ConstantInt::getTrue(LHS->getContext());
115 Pred = FCmpInst::FCMP_ORD; break;
117 return Builder->CreateFCmp(Pred, LHS, RHS);
120 // OptAndOp - This handles expressions of the form ((val OP C1) & C2). Where
121 // the Op parameter is 'OP', OpRHS is 'C1', and AndRHS is 'C2'. Op is
122 // guaranteed to be a binary operator.
123 Instruction *InstCombiner::OptAndOp(Instruction *Op,
126 BinaryOperator &TheAnd) {
127 Value *X = Op->getOperand(0);
128 Constant *Together = nullptr;
130 Together = ConstantExpr::getAnd(AndRHS, OpRHS);
132 switch (Op->getOpcode()) {
133 case Instruction::Xor:
134 if (Op->hasOneUse()) {
135 // (X ^ C1) & C2 --> (X & C2) ^ (C1&C2)
136 Value *And = Builder->CreateAnd(X, AndRHS);
138 return BinaryOperator::CreateXor(And, Together);
141 case Instruction::Or:
142 if (Op->hasOneUse()){
143 if (Together != OpRHS) {
144 // (X | C1) & C2 --> (X | (C1&C2)) & C2
145 Value *Or = Builder->CreateOr(X, Together);
147 return BinaryOperator::CreateAnd(Or, AndRHS);
150 ConstantInt *TogetherCI = dyn_cast<ConstantInt>(Together);
151 if (TogetherCI && !TogetherCI->isZero()){
152 // (X | C1) & C2 --> (X & (C2^(C1&C2))) | C1
153 // NOTE: This reduces the number of bits set in the & mask, which
154 // can expose opportunities for store narrowing.
155 Together = ConstantExpr::getXor(AndRHS, Together);
156 Value *And = Builder->CreateAnd(X, Together);
158 return BinaryOperator::CreateOr(And, OpRHS);
163 case Instruction::Add:
164 if (Op->hasOneUse()) {
165 // Adding a one to a single bit bit-field should be turned into an XOR
166 // of the bit. First thing to check is to see if this AND is with a
167 // single bit constant.
168 const APInt &AndRHSV = AndRHS->getValue();
170 // If there is only one bit set.
171 if (AndRHSV.isPowerOf2()) {
172 // Ok, at this point, we know that we are masking the result of the
173 // ADD down to exactly one bit. If the constant we are adding has
174 // no bits set below this bit, then we can eliminate the ADD.
175 const APInt& AddRHS = OpRHS->getValue();
177 // Check to see if any bits below the one bit set in AndRHSV are set.
178 if ((AddRHS & (AndRHSV-1)) == 0) {
179 // If not, the only thing that can effect the output of the AND is
180 // the bit specified by AndRHSV. If that bit is set, the effect of
181 // the XOR is to toggle the bit. If it is clear, then the ADD has
183 if ((AddRHS & AndRHSV) == 0) { // Bit is not set, noop
184 TheAnd.setOperand(0, X);
187 // Pull the XOR out of the AND.
188 Value *NewAnd = Builder->CreateAnd(X, AndRHS);
189 NewAnd->takeName(Op);
190 return BinaryOperator::CreateXor(NewAnd, AndRHS);
197 case Instruction::Shl: {
198 // We know that the AND will not produce any of the bits shifted in, so if
199 // the anded constant includes them, clear them now!
201 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
202 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
203 APInt ShlMask(APInt::getHighBitsSet(BitWidth, BitWidth-OpRHSVal));
204 ConstantInt *CI = Builder->getInt(AndRHS->getValue() & ShlMask);
206 if (CI->getValue() == ShlMask)
207 // Masking out bits that the shift already masks.
208 return ReplaceInstUsesWith(TheAnd, Op); // No need for the and.
210 if (CI != AndRHS) { // Reducing bits set in and.
211 TheAnd.setOperand(1, CI);
216 case Instruction::LShr: {
217 // We know that the AND will not produce any of the bits shifted in, so if
218 // the anded constant includes them, clear them now! This only applies to
219 // unsigned shifts, because a signed shr may bring in set bits!
221 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
222 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
223 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
224 ConstantInt *CI = Builder->getInt(AndRHS->getValue() & ShrMask);
226 if (CI->getValue() == ShrMask)
227 // Masking out bits that the shift already masks.
228 return ReplaceInstUsesWith(TheAnd, Op);
231 TheAnd.setOperand(1, CI); // Reduce bits set in and cst.
236 case Instruction::AShr:
238 // See if this is shifting in some sign extension, then masking it out
240 if (Op->hasOneUse()) {
241 uint32_t BitWidth = AndRHS->getType()->getBitWidth();
242 uint32_t OpRHSVal = OpRHS->getLimitedValue(BitWidth);
243 APInt ShrMask(APInt::getLowBitsSet(BitWidth, BitWidth - OpRHSVal));
244 Constant *C = Builder->getInt(AndRHS->getValue() & ShrMask);
245 if (C == AndRHS) { // Masking out bits shifted in.
246 // (Val ashr C1) & C2 -> (Val lshr C1) & C2
247 // Make the argument unsigned.
248 Value *ShVal = Op->getOperand(0);
249 ShVal = Builder->CreateLShr(ShVal, OpRHS, Op->getName());
250 return BinaryOperator::CreateAnd(ShVal, AndRHS, TheAnd.getName());
258 /// Emit a computation of: (V >= Lo && V < Hi) if Inside is true, otherwise
259 /// (V < Lo || V >= Hi). In practice, we emit the more efficient
260 /// (V-Lo) \<u Hi-Lo. This method expects that Lo <= Hi. isSigned indicates
261 /// whether to treat the V, Lo and HI as signed or not. IB is the location to
262 /// insert new instructions.
263 Value *InstCombiner::InsertRangeTest(Value *V, Constant *Lo, Constant *Hi,
264 bool isSigned, bool Inside) {
265 assert(cast<ConstantInt>(ConstantExpr::getICmp((isSigned ?
266 ICmpInst::ICMP_SLE:ICmpInst::ICMP_ULE), Lo, Hi))->getZExtValue() &&
267 "Lo is not <= Hi in range emission code!");
270 if (Lo == Hi) // Trivially false.
271 return Builder->getFalse();
273 // V >= Min && V < Hi --> V < Hi
274 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
275 ICmpInst::Predicate pred = (isSigned ?
276 ICmpInst::ICMP_SLT : ICmpInst::ICMP_ULT);
277 return Builder->CreateICmp(pred, V, Hi);
280 // Emit V-Lo <u Hi-Lo
281 Constant *NegLo = ConstantExpr::getNeg(Lo);
282 Value *Add = Builder->CreateAdd(V, NegLo, V->getName()+".off");
283 Constant *UpperBound = ConstantExpr::getAdd(NegLo, Hi);
284 return Builder->CreateICmpULT(Add, UpperBound);
287 if (Lo == Hi) // Trivially true.
288 return Builder->getTrue();
290 // V < Min || V >= Hi -> V > Hi-1
291 Hi = SubOne(cast<ConstantInt>(Hi));
292 if (cast<ConstantInt>(Lo)->isMinValue(isSigned)) {
293 ICmpInst::Predicate pred = (isSigned ?
294 ICmpInst::ICMP_SGT : ICmpInst::ICMP_UGT);
295 return Builder->CreateICmp(pred, V, Hi);
298 // Emit V-Lo >u Hi-1-Lo
299 // Note that Hi has already had one subtracted from it, above.
300 ConstantInt *NegLo = cast<ConstantInt>(ConstantExpr::getNeg(Lo));
301 Value *Add = Builder->CreateAdd(V, NegLo, V->getName()+".off");
302 Constant *LowerBound = ConstantExpr::getAdd(NegLo, Hi);
303 return Builder->CreateICmpUGT(Add, LowerBound);
306 // isRunOfOnes - Returns true iff Val consists of one contiguous run of 1s with
307 // any number of 0s on either side. The 1s are allowed to wrap from LSB to
308 // MSB, so 0x000FFF0, 0x0000FFFF, and 0xFF0000FF are all runs. 0x0F0F0000 is
309 // not, since all 1s are not contiguous.
310 static bool isRunOfOnes(ConstantInt *Val, uint32_t &MB, uint32_t &ME) {
311 const APInt& V = Val->getValue();
312 uint32_t BitWidth = Val->getType()->getBitWidth();
313 if (!APIntOps::isShiftedMask(BitWidth, V)) return false;
315 // look for the first zero bit after the run of ones
316 MB = BitWidth - ((V - 1) ^ V).countLeadingZeros();
317 // look for the first non-zero bit
318 ME = V.getActiveBits();
322 /// FoldLogicalPlusAnd - This is part of an expression (LHS +/- RHS) & Mask,
323 /// where isSub determines whether the operator is a sub. If we can fold one of
324 /// the following xforms:
326 /// ((A & N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == Mask
327 /// ((A | N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
328 /// ((A ^ N) +/- B) & Mask -> (A +/- B) & Mask iff N&Mask == 0
330 /// return (A +/- B).
332 Value *InstCombiner::FoldLogicalPlusAnd(Value *LHS, Value *RHS,
333 ConstantInt *Mask, bool isSub,
335 Instruction *LHSI = dyn_cast<Instruction>(LHS);
336 if (!LHSI || LHSI->getNumOperands() != 2 ||
337 !isa<ConstantInt>(LHSI->getOperand(1))) return nullptr;
339 ConstantInt *N = cast<ConstantInt>(LHSI->getOperand(1));
341 switch (LHSI->getOpcode()) {
342 default: return nullptr;
343 case Instruction::And:
344 if (ConstantExpr::getAnd(N, Mask) == Mask) {
345 // If the AndRHS is a power of two minus one (0+1+), this is simple.
346 if ((Mask->getValue().countLeadingZeros() +
347 Mask->getValue().countPopulation()) ==
348 Mask->getValue().getBitWidth())
351 // Otherwise, if Mask is 0+1+0+, and if B is known to have the low 0+
352 // part, we don't need any explicit masks to take them out of A. If that
353 // is all N is, ignore it.
354 uint32_t MB = 0, ME = 0;
355 if (isRunOfOnes(Mask, MB, ME)) { // begin/end bit of run, inclusive
356 uint32_t BitWidth = cast<IntegerType>(RHS->getType())->getBitWidth();
357 APInt Mask(APInt::getLowBitsSet(BitWidth, MB-1));
358 if (MaskedValueIsZero(RHS, Mask, 0, &I))
363 case Instruction::Or:
364 case Instruction::Xor:
365 // If the AndRHS is a power of two minus one (0+1+), and N&Mask == 0
366 if ((Mask->getValue().countLeadingZeros() +
367 Mask->getValue().countPopulation()) == Mask->getValue().getBitWidth()
368 && ConstantExpr::getAnd(N, Mask)->isNullValue())
374 return Builder->CreateSub(LHSI->getOperand(0), RHS, "fold");
375 return Builder->CreateAdd(LHSI->getOperand(0), RHS, "fold");
378 /// enum for classifying (icmp eq (A & B), C) and (icmp ne (A & B), C)
379 /// One of A and B is considered the mask, the other the value. This is
380 /// described as the "AMask" or "BMask" part of the enum. If the enum
381 /// contains only "Mask", then both A and B can be considered masks.
382 /// If A is the mask, then it was proven, that (A & C) == C. This
383 /// is trivial if C == A, or C == 0. If both A and C are constants, this
384 /// proof is also easy.
385 /// For the following explanations we assume that A is the mask.
386 /// The part "AllOnes" declares, that the comparison is true only
387 /// if (A & B) == A, or all bits of A are set in B.
388 /// Example: (icmp eq (A & 3), 3) -> FoldMskICmp_AMask_AllOnes
389 /// The part "AllZeroes" declares, that the comparison is true only
390 /// if (A & B) == 0, or all bits of A are cleared in B.
391 /// Example: (icmp eq (A & 3), 0) -> FoldMskICmp_Mask_AllZeroes
392 /// The part "Mixed" declares, that (A & B) == C and C might or might not
393 /// contain any number of one bits and zero bits.
394 /// Example: (icmp eq (A & 3), 1) -> FoldMskICmp_AMask_Mixed
395 /// The Part "Not" means, that in above descriptions "==" should be replaced
397 /// Example: (icmp ne (A & 3), 3) -> FoldMskICmp_AMask_NotAllOnes
398 /// If the mask A contains a single bit, then the following is equivalent:
399 /// (icmp eq (A & B), A) equals (icmp ne (A & B), 0)
400 /// (icmp ne (A & B), A) equals (icmp eq (A & B), 0)
401 enum MaskedICmpType {
402 FoldMskICmp_AMask_AllOnes = 1,
403 FoldMskICmp_AMask_NotAllOnes = 2,
404 FoldMskICmp_BMask_AllOnes = 4,
405 FoldMskICmp_BMask_NotAllOnes = 8,
406 FoldMskICmp_Mask_AllZeroes = 16,
407 FoldMskICmp_Mask_NotAllZeroes = 32,
408 FoldMskICmp_AMask_Mixed = 64,
409 FoldMskICmp_AMask_NotMixed = 128,
410 FoldMskICmp_BMask_Mixed = 256,
411 FoldMskICmp_BMask_NotMixed = 512
414 /// return the set of pattern classes (from MaskedICmpType)
415 /// that (icmp SCC (A & B), C) satisfies
416 static unsigned getTypeOfMaskedICmp(Value* A, Value* B, Value* C,
417 ICmpInst::Predicate SCC)
419 ConstantInt *ACst = dyn_cast<ConstantInt>(A);
420 ConstantInt *BCst = dyn_cast<ConstantInt>(B);
421 ConstantInt *CCst = dyn_cast<ConstantInt>(C);
422 bool icmp_eq = (SCC == ICmpInst::ICMP_EQ);
423 bool icmp_abit = (ACst && !ACst->isZero() &&
424 ACst->getValue().isPowerOf2());
425 bool icmp_bbit = (BCst && !BCst->isZero() &&
426 BCst->getValue().isPowerOf2());
428 if (CCst && CCst->isZero()) {
429 // if C is zero, then both A and B qualify as mask
430 result |= (icmp_eq ? (FoldMskICmp_Mask_AllZeroes |
431 FoldMskICmp_Mask_AllZeroes |
432 FoldMskICmp_AMask_Mixed |
433 FoldMskICmp_BMask_Mixed)
434 : (FoldMskICmp_Mask_NotAllZeroes |
435 FoldMskICmp_Mask_NotAllZeroes |
436 FoldMskICmp_AMask_NotMixed |
437 FoldMskICmp_BMask_NotMixed));
439 result |= (icmp_eq ? (FoldMskICmp_AMask_NotAllOnes |
440 FoldMskICmp_AMask_NotMixed)
441 : (FoldMskICmp_AMask_AllOnes |
442 FoldMskICmp_AMask_Mixed));
444 result |= (icmp_eq ? (FoldMskICmp_BMask_NotAllOnes |
445 FoldMskICmp_BMask_NotMixed)
446 : (FoldMskICmp_BMask_AllOnes |
447 FoldMskICmp_BMask_Mixed));
451 result |= (icmp_eq ? (FoldMskICmp_AMask_AllOnes |
452 FoldMskICmp_AMask_Mixed)
453 : (FoldMskICmp_AMask_NotAllOnes |
454 FoldMskICmp_AMask_NotMixed));
456 result |= (icmp_eq ? (FoldMskICmp_Mask_NotAllZeroes |
457 FoldMskICmp_AMask_NotMixed)
458 : (FoldMskICmp_Mask_AllZeroes |
459 FoldMskICmp_AMask_Mixed));
460 } else if (ACst && CCst &&
461 ConstantExpr::getAnd(ACst, CCst) == CCst) {
462 result |= (icmp_eq ? FoldMskICmp_AMask_Mixed
463 : FoldMskICmp_AMask_NotMixed);
466 result |= (icmp_eq ? (FoldMskICmp_BMask_AllOnes |
467 FoldMskICmp_BMask_Mixed)
468 : (FoldMskICmp_BMask_NotAllOnes |
469 FoldMskICmp_BMask_NotMixed));
471 result |= (icmp_eq ? (FoldMskICmp_Mask_NotAllZeroes |
472 FoldMskICmp_BMask_NotMixed)
473 : (FoldMskICmp_Mask_AllZeroes |
474 FoldMskICmp_BMask_Mixed));
475 } else if (BCst && CCst &&
476 ConstantExpr::getAnd(BCst, CCst) == CCst) {
477 result |= (icmp_eq ? FoldMskICmp_BMask_Mixed
478 : FoldMskICmp_BMask_NotMixed);
483 /// Convert an analysis of a masked ICmp into its equivalent if all boolean
484 /// operations had the opposite sense. Since each "NotXXX" flag (recording !=)
485 /// is adjacent to the corresponding normal flag (recording ==), this just
486 /// involves swapping those bits over.
487 static unsigned conjugateICmpMask(unsigned Mask) {
489 NewMask = (Mask & (FoldMskICmp_AMask_AllOnes | FoldMskICmp_BMask_AllOnes |
490 FoldMskICmp_Mask_AllZeroes | FoldMskICmp_AMask_Mixed |
491 FoldMskICmp_BMask_Mixed))
495 (Mask & (FoldMskICmp_AMask_NotAllOnes | FoldMskICmp_BMask_NotAllOnes |
496 FoldMskICmp_Mask_NotAllZeroes | FoldMskICmp_AMask_NotMixed |
497 FoldMskICmp_BMask_NotMixed))
503 /// decomposeBitTestICmp - Decompose an icmp into the form ((X & Y) pred Z)
504 /// if possible. The returned predicate is either == or !=. Returns false if
505 /// decomposition fails.
506 static bool decomposeBitTestICmp(const ICmpInst *I, ICmpInst::Predicate &Pred,
507 Value *&X, Value *&Y, Value *&Z) {
508 ConstantInt *C = dyn_cast<ConstantInt>(I->getOperand(1));
512 switch (I->getPredicate()) {
515 case ICmpInst::ICMP_SLT:
516 // X < 0 is equivalent to (X & SignBit) != 0.
519 Y = ConstantInt::get(I->getContext(), APInt::getSignBit(C->getBitWidth()));
520 Pred = ICmpInst::ICMP_NE;
522 case ICmpInst::ICMP_SGT:
523 // X > -1 is equivalent to (X & SignBit) == 0.
524 if (!C->isAllOnesValue())
526 Y = ConstantInt::get(I->getContext(), APInt::getSignBit(C->getBitWidth()));
527 Pred = ICmpInst::ICMP_EQ;
529 case ICmpInst::ICMP_ULT:
530 // X <u 2^n is equivalent to (X & ~(2^n-1)) == 0.
531 if (!C->getValue().isPowerOf2())
533 Y = ConstantInt::get(I->getContext(), -C->getValue());
534 Pred = ICmpInst::ICMP_EQ;
536 case ICmpInst::ICMP_UGT:
537 // X >u 2^n-1 is equivalent to (X & ~(2^n-1)) != 0.
538 if (!(C->getValue() + 1).isPowerOf2())
540 Y = ConstantInt::get(I->getContext(), ~C->getValue());
541 Pred = ICmpInst::ICMP_NE;
545 X = I->getOperand(0);
546 Z = ConstantInt::getNullValue(C->getType());
550 /// foldLogOpOfMaskedICmpsHelper:
551 /// handle (icmp(A & B) ==/!= C) &/| (icmp(A & D) ==/!= E)
552 /// return the set of pattern classes (from MaskedICmpType)
553 /// that both LHS and RHS satisfy
554 static unsigned foldLogOpOfMaskedICmpsHelper(Value*& A,
555 Value*& B, Value*& C,
556 Value*& D, Value*& E,
557 ICmpInst *LHS, ICmpInst *RHS,
558 ICmpInst::Predicate &LHSCC,
559 ICmpInst::Predicate &RHSCC) {
560 if (LHS->getOperand(0)->getType() != RHS->getOperand(0)->getType()) return 0;
561 // vectors are not (yet?) supported
562 if (LHS->getOperand(0)->getType()->isVectorTy()) return 0;
564 // Here comes the tricky part:
565 // LHS might be of the form L11 & L12 == X, X == L21 & L22,
566 // and L11 & L12 == L21 & L22. The same goes for RHS.
567 // Now we must find those components L** and R**, that are equal, so
568 // that we can extract the parameters A, B, C, D, and E for the canonical
570 Value *L1 = LHS->getOperand(0);
571 Value *L2 = LHS->getOperand(1);
572 Value *L11,*L12,*L21,*L22;
573 // Check whether the icmp can be decomposed into a bit test.
574 if (decomposeBitTestICmp(LHS, LHSCC, L11, L12, L2)) {
575 L21 = L22 = L1 = nullptr;
577 // Look for ANDs in the LHS icmp.
578 if (!L1->getType()->isIntegerTy()) {
579 // You can icmp pointers, for example. They really aren't masks.
581 } else if (!match(L1, m_And(m_Value(L11), m_Value(L12)))) {
582 // Any icmp can be viewed as being trivially masked; if it allows us to
583 // remove one, it's worth it.
585 L12 = Constant::getAllOnesValue(L1->getType());
588 if (!L2->getType()->isIntegerTy()) {
589 // You can icmp pointers, for example. They really aren't masks.
591 } else if (!match(L2, m_And(m_Value(L21), m_Value(L22)))) {
593 L22 = Constant::getAllOnesValue(L2->getType());
597 // Bail if LHS was a icmp that can't be decomposed into an equality.
598 if (!ICmpInst::isEquality(LHSCC))
601 Value *R1 = RHS->getOperand(0);
602 Value *R2 = RHS->getOperand(1);
605 if (decomposeBitTestICmp(RHS, RHSCC, R11, R12, R2)) {
606 if (R11 == L11 || R11 == L12 || R11 == L21 || R11 == L22) {
608 } else if (R12 == L11 || R12 == L12 || R12 == L21 || R12 == L22) {
613 E = R2; R1 = nullptr; ok = true;
614 } else if (R1->getType()->isIntegerTy()) {
615 if (!match(R1, m_And(m_Value(R11), m_Value(R12)))) {
616 // As before, model no mask as a trivial mask if it'll let us do an
619 R12 = Constant::getAllOnesValue(R1->getType());
622 if (R11 == L11 || R11 == L12 || R11 == L21 || R11 == L22) {
623 A = R11; D = R12; E = R2; ok = true;
624 } else if (R12 == L11 || R12 == L12 || R12 == L21 || R12 == L22) {
625 A = R12; D = R11; E = R2; ok = true;
629 // Bail if RHS was a icmp that can't be decomposed into an equality.
630 if (!ICmpInst::isEquality(RHSCC))
633 // Look for ANDs in on the right side of the RHS icmp.
634 if (!ok && R2->getType()->isIntegerTy()) {
635 if (!match(R2, m_And(m_Value(R11), m_Value(R12)))) {
637 R12 = Constant::getAllOnesValue(R2->getType());
640 if (R11 == L11 || R11 == L12 || R11 == L21 || R11 == L22) {
641 A = R11; D = R12; E = R1; ok = true;
642 } else if (R12 == L11 || R12 == L12 || R12 == L21 || R12 == L22) {
643 A = R12; D = R11; E = R1; ok = true;
653 } else if (L12 == A) {
655 } else if (L21 == A) {
657 } else if (L22 == A) {
661 unsigned left_type = getTypeOfMaskedICmp(A, B, C, LHSCC);
662 unsigned right_type = getTypeOfMaskedICmp(A, D, E, RHSCC);
663 return left_type & right_type;
665 /// foldLogOpOfMaskedICmps:
666 /// try to fold (icmp(A & B) ==/!= C) &/| (icmp(A & D) ==/!= E)
667 /// into a single (icmp(A & X) ==/!= Y)
668 static Value* foldLogOpOfMaskedICmps(ICmpInst *LHS, ICmpInst *RHS, bool IsAnd,
669 llvm::InstCombiner::BuilderTy* Builder) {
670 Value *A = nullptr, *B = nullptr, *C = nullptr, *D = nullptr, *E = nullptr;
671 ICmpInst::Predicate LHSCC = LHS->getPredicate(), RHSCC = RHS->getPredicate();
672 unsigned mask = foldLogOpOfMaskedICmpsHelper(A, B, C, D, E, LHS, RHS,
674 if (mask == 0) return nullptr;
675 assert(ICmpInst::isEquality(LHSCC) && ICmpInst::isEquality(RHSCC) &&
676 "foldLogOpOfMaskedICmpsHelper must return an equality predicate.");
678 // In full generality:
679 // (icmp (A & B) Op C) | (icmp (A & D) Op E)
680 // == ![ (icmp (A & B) !Op C) & (icmp (A & D) !Op E) ]
682 // If the latter can be converted into (icmp (A & X) Op Y) then the former is
683 // equivalent to (icmp (A & X) !Op Y).
685 // Therefore, we can pretend for the rest of this function that we're dealing
686 // with the conjunction, provided we flip the sense of any comparisons (both
687 // input and output).
689 // In most cases we're going to produce an EQ for the "&&" case.
690 ICmpInst::Predicate NEWCC = IsAnd ? ICmpInst::ICMP_EQ : ICmpInst::ICMP_NE;
692 // Convert the masking analysis into its equivalent with negated
694 mask = conjugateICmpMask(mask);
697 if (mask & FoldMskICmp_Mask_AllZeroes) {
698 // (icmp eq (A & B), 0) & (icmp eq (A & D), 0)
699 // -> (icmp eq (A & (B|D)), 0)
700 Value* newOr = Builder->CreateOr(B, D);
701 Value* newAnd = Builder->CreateAnd(A, newOr);
702 // we can't use C as zero, because we might actually handle
703 // (icmp ne (A & B), B) & (icmp ne (A & D), D)
704 // with B and D, having a single bit set
705 Value* zero = Constant::getNullValue(A->getType());
706 return Builder->CreateICmp(NEWCC, newAnd, zero);
708 if (mask & FoldMskICmp_BMask_AllOnes) {
709 // (icmp eq (A & B), B) & (icmp eq (A & D), D)
710 // -> (icmp eq (A & (B|D)), (B|D))
711 Value* newOr = Builder->CreateOr(B, D);
712 Value* newAnd = Builder->CreateAnd(A, newOr);
713 return Builder->CreateICmp(NEWCC, newAnd, newOr);
715 if (mask & FoldMskICmp_AMask_AllOnes) {
716 // (icmp eq (A & B), A) & (icmp eq (A & D), A)
717 // -> (icmp eq (A & (B&D)), A)
718 Value* newAnd1 = Builder->CreateAnd(B, D);
719 Value* newAnd = Builder->CreateAnd(A, newAnd1);
720 return Builder->CreateICmp(NEWCC, newAnd, A);
723 // Remaining cases assume at least that B and D are constant, and depend on
724 // their actual values. This isn't strictly, necessary, just a "handle the
725 // easy cases for now" decision.
726 ConstantInt *BCst = dyn_cast<ConstantInt>(B);
727 if (!BCst) return nullptr;
728 ConstantInt *DCst = dyn_cast<ConstantInt>(D);
729 if (!DCst) return nullptr;
731 if (mask & (FoldMskICmp_Mask_NotAllZeroes | FoldMskICmp_BMask_NotAllOnes)) {
732 // (icmp ne (A & B), 0) & (icmp ne (A & D), 0) and
733 // (icmp ne (A & B), B) & (icmp ne (A & D), D)
734 // -> (icmp ne (A & B), 0) or (icmp ne (A & D), 0)
735 // Only valid if one of the masks is a superset of the other (check "B&D" is
736 // the same as either B or D).
737 APInt NewMask = BCst->getValue() & DCst->getValue();
739 if (NewMask == BCst->getValue())
741 else if (NewMask == DCst->getValue())
744 if (mask & FoldMskICmp_AMask_NotAllOnes) {
745 // (icmp ne (A & B), B) & (icmp ne (A & D), D)
746 // -> (icmp ne (A & B), A) or (icmp ne (A & D), A)
747 // Only valid if one of the masks is a superset of the other (check "B|D" is
748 // the same as either B or D).
749 APInt NewMask = BCst->getValue() | DCst->getValue();
751 if (NewMask == BCst->getValue())
753 else if (NewMask == DCst->getValue())
756 if (mask & FoldMskICmp_BMask_Mixed) {
757 // (icmp eq (A & B), C) & (icmp eq (A & D), E)
758 // We already know that B & C == C && D & E == E.
759 // If we can prove that (B & D) & (C ^ E) == 0, that is, the bits of
760 // C and E, which are shared by both the mask B and the mask D, don't
761 // contradict, then we can transform to
762 // -> (icmp eq (A & (B|D)), (C|E))
763 // Currently, we only handle the case of B, C, D, and E being constant.
764 // we can't simply use C and E, because we might actually handle
765 // (icmp ne (A & B), B) & (icmp eq (A & D), D)
766 // with B and D, having a single bit set
767 ConstantInt *CCst = dyn_cast<ConstantInt>(C);
768 if (!CCst) return nullptr;
770 CCst = dyn_cast<ConstantInt>( ConstantExpr::getXor(BCst, CCst) );
771 ConstantInt *ECst = dyn_cast<ConstantInt>(E);
772 if (!ECst) return nullptr;
774 ECst = dyn_cast<ConstantInt>( ConstantExpr::getXor(DCst, ECst) );
775 ConstantInt* MCst = dyn_cast<ConstantInt>(
776 ConstantExpr::getAnd(ConstantExpr::getAnd(BCst, DCst),
777 ConstantExpr::getXor(CCst, ECst)) );
778 // if there is a conflict we should actually return a false for the
782 Value *newOr1 = Builder->CreateOr(B, D);
783 Value *newOr2 = ConstantExpr::getOr(CCst, ECst);
784 Value *newAnd = Builder->CreateAnd(A, newOr1);
785 return Builder->CreateICmp(NEWCC, newAnd, newOr2);
790 /// FoldAndOfICmps - Fold (icmp)&(icmp) if possible.
791 Value *InstCombiner::FoldAndOfICmps(ICmpInst *LHS, ICmpInst *RHS) {
792 ICmpInst::Predicate LHSCC = LHS->getPredicate(), RHSCC = RHS->getPredicate();
794 // (icmp1 A, B) & (icmp2 A, B) --> (icmp3 A, B)
795 if (PredicatesFoldable(LHSCC, RHSCC)) {
796 if (LHS->getOperand(0) == RHS->getOperand(1) &&
797 LHS->getOperand(1) == RHS->getOperand(0))
799 if (LHS->getOperand(0) == RHS->getOperand(0) &&
800 LHS->getOperand(1) == RHS->getOperand(1)) {
801 Value *Op0 = LHS->getOperand(0), *Op1 = LHS->getOperand(1);
802 unsigned Code = getICmpCode(LHS) & getICmpCode(RHS);
803 bool isSigned = LHS->isSigned() || RHS->isSigned();
804 return getNewICmpValue(isSigned, Code, Op0, Op1, Builder);
808 // handle (roughly): (icmp eq (A & B), C) & (icmp eq (A & D), E)
809 if (Value *V = foldLogOpOfMaskedICmps(LHS, RHS, true, Builder))
812 // This only handles icmp of constants: (icmp1 A, C1) & (icmp2 B, C2).
813 Value *Val = LHS->getOperand(0), *Val2 = RHS->getOperand(0);
814 ConstantInt *LHSCst = dyn_cast<ConstantInt>(LHS->getOperand(1));
815 ConstantInt *RHSCst = dyn_cast<ConstantInt>(RHS->getOperand(1));
816 if (!LHSCst || !RHSCst) return nullptr;
818 if (LHSCst == RHSCst && LHSCC == RHSCC) {
819 // (icmp ult A, C) & (icmp ult B, C) --> (icmp ult (A|B), C)
820 // where C is a power of 2
821 if (LHSCC == ICmpInst::ICMP_ULT &&
822 LHSCst->getValue().isPowerOf2()) {
823 Value *NewOr = Builder->CreateOr(Val, Val2);
824 return Builder->CreateICmp(LHSCC, NewOr, LHSCst);
827 // (icmp eq A, 0) & (icmp eq B, 0) --> (icmp eq (A|B), 0)
828 if (LHSCC == ICmpInst::ICMP_EQ && LHSCst->isZero()) {
829 Value *NewOr = Builder->CreateOr(Val, Val2);
830 return Builder->CreateICmp(LHSCC, NewOr, LHSCst);
834 // (trunc x) == C1 & (and x, CA) == C2 -> (and x, CA|CMAX) == C1|C2
835 // where CMAX is the all ones value for the truncated type,
836 // iff the lower bits of C2 and CA are zero.
837 if (LHSCC == ICmpInst::ICMP_EQ && LHSCC == RHSCC &&
838 LHS->hasOneUse() && RHS->hasOneUse()) {
840 ConstantInt *AndCst, *SmallCst = nullptr, *BigCst = nullptr;
842 // (trunc x) == C1 & (and x, CA) == C2
843 // (and x, CA) == C2 & (trunc x) == C1
844 if (match(Val2, m_Trunc(m_Value(V))) &&
845 match(Val, m_And(m_Specific(V), m_ConstantInt(AndCst)))) {
848 } else if (match(Val, m_Trunc(m_Value(V))) &&
849 match(Val2, m_And(m_Specific(V), m_ConstantInt(AndCst)))) {
854 if (SmallCst && BigCst) {
855 unsigned BigBitSize = BigCst->getType()->getBitWidth();
856 unsigned SmallBitSize = SmallCst->getType()->getBitWidth();
858 // Check that the low bits are zero.
859 APInt Low = APInt::getLowBitsSet(BigBitSize, SmallBitSize);
860 if ((Low & AndCst->getValue()) == 0 && (Low & BigCst->getValue()) == 0) {
861 Value *NewAnd = Builder->CreateAnd(V, Low | AndCst->getValue());
862 APInt N = SmallCst->getValue().zext(BigBitSize) | BigCst->getValue();
863 Value *NewVal = ConstantInt::get(AndCst->getType()->getContext(), N);
864 return Builder->CreateICmp(LHSCC, NewAnd, NewVal);
869 // From here on, we only handle:
870 // (icmp1 A, C1) & (icmp2 A, C2) --> something simpler.
871 if (Val != Val2) return nullptr;
873 // ICMP_[US][GL]E X, CST is folded to ICMP_[US][GL]T elsewhere.
874 if (LHSCC == ICmpInst::ICMP_UGE || LHSCC == ICmpInst::ICMP_ULE ||
875 RHSCC == ICmpInst::ICMP_UGE || RHSCC == ICmpInst::ICMP_ULE ||
876 LHSCC == ICmpInst::ICMP_SGE || LHSCC == ICmpInst::ICMP_SLE ||
877 RHSCC == ICmpInst::ICMP_SGE || RHSCC == ICmpInst::ICMP_SLE)
880 // Make a constant range that's the intersection of the two icmp ranges.
881 // If the intersection is empty, we know that the result is false.
882 ConstantRange LHSRange =
883 ConstantRange::makeICmpRegion(LHSCC, LHSCst->getValue());
884 ConstantRange RHSRange =
885 ConstantRange::makeICmpRegion(RHSCC, RHSCst->getValue());
887 if (LHSRange.intersectWith(RHSRange).isEmptySet())
888 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 0);
890 // We can't fold (ugt x, C) & (sgt x, C2).
891 if (!PredicatesFoldable(LHSCC, RHSCC))
894 // Ensure that the larger constant is on the RHS.
896 if (CmpInst::isSigned(LHSCC) ||
897 (ICmpInst::isEquality(LHSCC) &&
898 CmpInst::isSigned(RHSCC)))
899 ShouldSwap = LHSCst->getValue().sgt(RHSCst->getValue());
901 ShouldSwap = LHSCst->getValue().ugt(RHSCst->getValue());
905 std::swap(LHSCst, RHSCst);
906 std::swap(LHSCC, RHSCC);
909 // At this point, we know we have two icmp instructions
910 // comparing a value against two constants and and'ing the result
911 // together. Because of the above check, we know that we only have
912 // icmp eq, icmp ne, icmp [su]lt, and icmp [SU]gt here. We also know
913 // (from the icmp folding check above), that the two constants
914 // are not equal and that the larger constant is on the RHS
915 assert(LHSCst != RHSCst && "Compares not folded above?");
918 default: llvm_unreachable("Unknown integer condition code!");
919 case ICmpInst::ICMP_EQ:
921 default: llvm_unreachable("Unknown integer condition code!");
922 case ICmpInst::ICMP_NE: // (X == 13 & X != 15) -> X == 13
923 case ICmpInst::ICMP_ULT: // (X == 13 & X < 15) -> X == 13
924 case ICmpInst::ICMP_SLT: // (X == 13 & X < 15) -> X == 13
927 case ICmpInst::ICMP_NE:
929 default: llvm_unreachable("Unknown integer condition code!");
930 case ICmpInst::ICMP_ULT:
931 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X u< 14) -> X < 13
932 return Builder->CreateICmpULT(Val, LHSCst);
933 break; // (X != 13 & X u< 15) -> no change
934 case ICmpInst::ICMP_SLT:
935 if (LHSCst == SubOne(RHSCst)) // (X != 13 & X s< 14) -> X < 13
936 return Builder->CreateICmpSLT(Val, LHSCst);
937 break; // (X != 13 & X s< 15) -> no change
938 case ICmpInst::ICMP_EQ: // (X != 13 & X == 15) -> X == 15
939 case ICmpInst::ICMP_UGT: // (X != 13 & X u> 15) -> X u> 15
940 case ICmpInst::ICMP_SGT: // (X != 13 & X s> 15) -> X s> 15
942 case ICmpInst::ICMP_NE:
943 // Special case to get the ordering right when the values wrap around
945 if (LHSCst->getValue() == 0 && RHSCst->getValue().isAllOnesValue())
946 std::swap(LHSCst, RHSCst);
947 if (LHSCst == SubOne(RHSCst)){// (X != 13 & X != 14) -> X-13 >u 1
948 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
949 Value *Add = Builder->CreateAdd(Val, AddCST, Val->getName()+".off");
950 return Builder->CreateICmpUGT(Add, ConstantInt::get(Add->getType(), 1),
951 Val->getName()+".cmp");
953 break; // (X != 13 & X != 15) -> no change
956 case ICmpInst::ICMP_ULT:
958 default: llvm_unreachable("Unknown integer condition code!");
959 case ICmpInst::ICMP_EQ: // (X u< 13 & X == 15) -> false
960 case ICmpInst::ICMP_UGT: // (X u< 13 & X u> 15) -> false
961 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 0);
962 case ICmpInst::ICMP_SGT: // (X u< 13 & X s> 15) -> no change
964 case ICmpInst::ICMP_NE: // (X u< 13 & X != 15) -> X u< 13
965 case ICmpInst::ICMP_ULT: // (X u< 13 & X u< 15) -> X u< 13
967 case ICmpInst::ICMP_SLT: // (X u< 13 & X s< 15) -> no change
971 case ICmpInst::ICMP_SLT:
973 default: llvm_unreachable("Unknown integer condition code!");
974 case ICmpInst::ICMP_UGT: // (X s< 13 & X u> 15) -> no change
976 case ICmpInst::ICMP_NE: // (X s< 13 & X != 15) -> X < 13
977 case ICmpInst::ICMP_SLT: // (X s< 13 & X s< 15) -> X < 13
979 case ICmpInst::ICMP_ULT: // (X s< 13 & X u< 15) -> no change
983 case ICmpInst::ICMP_UGT:
985 default: llvm_unreachable("Unknown integer condition code!");
986 case ICmpInst::ICMP_EQ: // (X u> 13 & X == 15) -> X == 15
987 case ICmpInst::ICMP_UGT: // (X u> 13 & X u> 15) -> X u> 15
989 case ICmpInst::ICMP_SGT: // (X u> 13 & X s> 15) -> no change
991 case ICmpInst::ICMP_NE:
992 if (RHSCst == AddOne(LHSCst)) // (X u> 13 & X != 14) -> X u> 14
993 return Builder->CreateICmp(LHSCC, Val, RHSCst);
994 break; // (X u> 13 & X != 15) -> no change
995 case ICmpInst::ICMP_ULT: // (X u> 13 & X u< 15) -> (X-14) <u 1
996 return InsertRangeTest(Val, AddOne(LHSCst), RHSCst, false, true);
997 case ICmpInst::ICMP_SLT: // (X u> 13 & X s< 15) -> no change
1001 case ICmpInst::ICMP_SGT:
1003 default: llvm_unreachable("Unknown integer condition code!");
1004 case ICmpInst::ICMP_EQ: // (X s> 13 & X == 15) -> X == 15
1005 case ICmpInst::ICMP_SGT: // (X s> 13 & X s> 15) -> X s> 15
1007 case ICmpInst::ICMP_UGT: // (X s> 13 & X u> 15) -> no change
1009 case ICmpInst::ICMP_NE:
1010 if (RHSCst == AddOne(LHSCst)) // (X s> 13 & X != 14) -> X s> 14
1011 return Builder->CreateICmp(LHSCC, Val, RHSCst);
1012 break; // (X s> 13 & X != 15) -> no change
1013 case ICmpInst::ICMP_SLT: // (X s> 13 & X s< 15) -> (X-14) s< 1
1014 return InsertRangeTest(Val, AddOne(LHSCst), RHSCst, true, true);
1015 case ICmpInst::ICMP_ULT: // (X s> 13 & X u< 15) -> no change
1024 /// FoldAndOfFCmps - Optimize (fcmp)&(fcmp). NOTE: Unlike the rest of
1025 /// instcombine, this returns a Value which should already be inserted into the
1027 Value *InstCombiner::FoldAndOfFCmps(FCmpInst *LHS, FCmpInst *RHS) {
1028 if (LHS->getPredicate() == FCmpInst::FCMP_ORD &&
1029 RHS->getPredicate() == FCmpInst::FCMP_ORD) {
1030 if (LHS->getOperand(0)->getType() != RHS->getOperand(0)->getType())
1033 // (fcmp ord x, c) & (fcmp ord y, c) -> (fcmp ord x, y)
1034 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
1035 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
1036 // If either of the constants are nans, then the whole thing returns
1038 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
1039 return Builder->getFalse();
1040 return Builder->CreateFCmpORD(LHS->getOperand(0), RHS->getOperand(0));
1043 // Handle vector zeros. This occurs because the canonical form of
1044 // "fcmp ord x,x" is "fcmp ord x, 0".
1045 if (isa<ConstantAggregateZero>(LHS->getOperand(1)) &&
1046 isa<ConstantAggregateZero>(RHS->getOperand(1)))
1047 return Builder->CreateFCmpORD(LHS->getOperand(0), RHS->getOperand(0));
1051 Value *Op0LHS = LHS->getOperand(0), *Op0RHS = LHS->getOperand(1);
1052 Value *Op1LHS = RHS->getOperand(0), *Op1RHS = RHS->getOperand(1);
1053 FCmpInst::Predicate Op0CC = LHS->getPredicate(), Op1CC = RHS->getPredicate();
1056 if (Op0LHS == Op1RHS && Op0RHS == Op1LHS) {
1057 // Swap RHS operands to match LHS.
1058 Op1CC = FCmpInst::getSwappedPredicate(Op1CC);
1059 std::swap(Op1LHS, Op1RHS);
1062 if (Op0LHS == Op1LHS && Op0RHS == Op1RHS) {
1063 // Simplify (fcmp cc0 x, y) & (fcmp cc1 x, y).
1065 return Builder->CreateFCmp((FCmpInst::Predicate)Op0CC, Op0LHS, Op0RHS);
1066 if (Op0CC == FCmpInst::FCMP_FALSE || Op1CC == FCmpInst::FCMP_FALSE)
1067 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 0);
1068 if (Op0CC == FCmpInst::FCMP_TRUE)
1070 if (Op1CC == FCmpInst::FCMP_TRUE)
1075 unsigned Op0Pred = getFCmpCode(Op0CC, Op0Ordered);
1076 unsigned Op1Pred = getFCmpCode(Op1CC, Op1Ordered);
1077 // uno && ord -> false
1078 if (Op0Pred == 0 && Op1Pred == 0 && Op0Ordered != Op1Ordered)
1079 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 0);
1081 std::swap(LHS, RHS);
1082 std::swap(Op0Pred, Op1Pred);
1083 std::swap(Op0Ordered, Op1Ordered);
1086 // uno && ueq -> uno && (uno || eq) -> uno
1087 // ord && olt -> ord && (ord && lt) -> olt
1088 if (!Op0Ordered && (Op0Ordered == Op1Ordered))
1090 if (Op0Ordered && (Op0Ordered == Op1Ordered))
1093 // uno && oeq -> uno && (ord && eq) -> false
1095 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 0);
1096 // ord && ueq -> ord && (uno || eq) -> oeq
1097 return getFCmpValue(true, Op1Pred, Op0LHS, Op0RHS, Builder);
1104 Instruction *InstCombiner::visitAnd(BinaryOperator &I) {
1105 bool Changed = SimplifyAssociativeOrCommutative(I);
1106 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
1108 if (Value *V = SimplifyVectorOp(I))
1109 return ReplaceInstUsesWith(I, V);
1111 if (Value *V = SimplifyAndInst(Op0, Op1, DL, TLI, DT, AT))
1112 return ReplaceInstUsesWith(I, V);
1114 // (A|B)&(A|C) -> A|(B&C) etc
1115 if (Value *V = SimplifyUsingDistributiveLaws(I))
1116 return ReplaceInstUsesWith(I, V);
1118 // See if we can simplify any instructions used by the instruction whose sole
1119 // purpose is to compute bits we don't care about.
1120 if (SimplifyDemandedInstructionBits(I))
1123 if (ConstantInt *AndRHS = dyn_cast<ConstantInt>(Op1)) {
1124 const APInt &AndRHSMask = AndRHS->getValue();
1126 // Optimize a variety of ((val OP C1) & C2) combinations...
1127 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
1128 Value *Op0LHS = Op0I->getOperand(0);
1129 Value *Op0RHS = Op0I->getOperand(1);
1130 switch (Op0I->getOpcode()) {
1132 case Instruction::Xor:
1133 case Instruction::Or: {
1134 // If the mask is only needed on one incoming arm, push it up.
1135 if (!Op0I->hasOneUse()) break;
1137 APInt NotAndRHS(~AndRHSMask);
1138 if (MaskedValueIsZero(Op0LHS, NotAndRHS, 0, &I)) {
1139 // Not masking anything out for the LHS, move to RHS.
1140 Value *NewRHS = Builder->CreateAnd(Op0RHS, AndRHS,
1141 Op0RHS->getName()+".masked");
1142 return BinaryOperator::Create(Op0I->getOpcode(), Op0LHS, NewRHS);
1144 if (!isa<Constant>(Op0RHS) &&
1145 MaskedValueIsZero(Op0RHS, NotAndRHS, 0, &I)) {
1146 // Not masking anything out for the RHS, move to LHS.
1147 Value *NewLHS = Builder->CreateAnd(Op0LHS, AndRHS,
1148 Op0LHS->getName()+".masked");
1149 return BinaryOperator::Create(Op0I->getOpcode(), NewLHS, Op0RHS);
1154 case Instruction::Add:
1155 // ((A & N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == AndRHS.
1156 // ((A | N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
1157 // ((A ^ N) + B) & AndRHS -> (A + B) & AndRHS iff N&AndRHS == 0
1158 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, false, I))
1159 return BinaryOperator::CreateAnd(V, AndRHS);
1160 if (Value *V = FoldLogicalPlusAnd(Op0RHS, Op0LHS, AndRHS, false, I))
1161 return BinaryOperator::CreateAnd(V, AndRHS); // Add commutes
1164 case Instruction::Sub:
1165 // ((A & N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == AndRHS.
1166 // ((A | N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
1167 // ((A ^ N) - B) & AndRHS -> (A - B) & AndRHS iff N&AndRHS == 0
1168 if (Value *V = FoldLogicalPlusAnd(Op0LHS, Op0RHS, AndRHS, true, I))
1169 return BinaryOperator::CreateAnd(V, AndRHS);
1171 // (A - N) & AndRHS -> -N & AndRHS iff A&AndRHS==0 and AndRHS
1172 // has 1's for all bits that the subtraction with A might affect.
1173 if (Op0I->hasOneUse() && !match(Op0LHS, m_Zero())) {
1174 uint32_t BitWidth = AndRHSMask.getBitWidth();
1175 uint32_t Zeros = AndRHSMask.countLeadingZeros();
1176 APInt Mask = APInt::getLowBitsSet(BitWidth, BitWidth - Zeros);
1178 if (MaskedValueIsZero(Op0LHS, Mask, 0, &I)) {
1179 Value *NewNeg = Builder->CreateNeg(Op0RHS);
1180 return BinaryOperator::CreateAnd(NewNeg, AndRHS);
1185 case Instruction::Shl:
1186 case Instruction::LShr:
1187 // (1 << x) & 1 --> zext(x == 0)
1188 // (1 >> x) & 1 --> zext(x == 0)
1189 if (AndRHSMask == 1 && Op0LHS == AndRHS) {
1191 Builder->CreateICmpEQ(Op0RHS, Constant::getNullValue(I.getType()));
1192 return new ZExtInst(NewICmp, I.getType());
1197 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1)))
1198 if (Instruction *Res = OptAndOp(Op0I, Op0CI, AndRHS, I))
1202 // If this is an integer truncation, and if the source is an 'and' with
1203 // immediate, transform it. This frequently occurs for bitfield accesses.
1205 Value *X = nullptr; ConstantInt *YC = nullptr;
1206 if (match(Op0, m_Trunc(m_And(m_Value(X), m_ConstantInt(YC))))) {
1207 // Change: and (trunc (and X, YC) to T), C2
1208 // into : and (trunc X to T), trunc(YC) & C2
1209 // This will fold the two constants together, which may allow
1210 // other simplifications.
1211 Value *NewCast = Builder->CreateTrunc(X, I.getType(), "and.shrunk");
1212 Constant *C3 = ConstantExpr::getTrunc(YC, I.getType());
1213 C3 = ConstantExpr::getAnd(C3, AndRHS);
1214 return BinaryOperator::CreateAnd(NewCast, C3);
1218 // Try to fold constant and into select arguments.
1219 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
1220 if (Instruction *R = FoldOpIntoSelect(I, SI))
1222 if (isa<PHINode>(Op0))
1223 if (Instruction *NV = FoldOpIntoPhi(I))
1228 // (~A & ~B) == (~(A | B)) - De Morgan's Law
1229 if (Value *Op0NotVal = dyn_castNotVal(Op0))
1230 if (Value *Op1NotVal = dyn_castNotVal(Op1))
1231 if (Op0->hasOneUse() && Op1->hasOneUse()) {
1232 Value *Or = Builder->CreateOr(Op0NotVal, Op1NotVal,
1233 I.getName()+".demorgan");
1234 return BinaryOperator::CreateNot(Or);
1238 Value *A = nullptr, *B = nullptr, *C = nullptr, *D = nullptr;
1239 // (A|B) & ~(A&B) -> A^B
1240 if (match(Op0, m_Or(m_Value(A), m_Value(B))) &&
1241 match(Op1, m_Not(m_And(m_Value(C), m_Value(D)))) &&
1242 ((A == C && B == D) || (A == D && B == C)))
1243 return BinaryOperator::CreateXor(A, B);
1245 // ~(A&B) & (A|B) -> A^B
1246 if (match(Op1, m_Or(m_Value(A), m_Value(B))) &&
1247 match(Op0, m_Not(m_And(m_Value(C), m_Value(D)))) &&
1248 ((A == C && B == D) || (A == D && B == C)))
1249 return BinaryOperator::CreateXor(A, B);
1251 // A&(A^B) => A & ~B
1253 Value *tmpOp0 = Op0;
1254 Value *tmpOp1 = Op1;
1255 if (Op0->hasOneUse() &&
1256 match(Op0, m_Xor(m_Value(A), m_Value(B)))) {
1257 if (A == Op1 || B == Op1 ) {
1264 if (tmpOp1->hasOneUse() &&
1265 match(tmpOp1, m_Xor(m_Value(A), m_Value(B)))) {
1269 // Notice that the patten (A&(~B)) is actually (A&(-1^B)), so if
1270 // A is originally -1 (or a vector of -1 and undefs), then we enter
1271 // an endless loop. By checking that A is non-constant we ensure that
1272 // we will never get to the loop.
1273 if (A == tmpOp0 && !isa<Constant>(A)) // A&(A^B) -> A & ~B
1274 return BinaryOperator::CreateAnd(A, Builder->CreateNot(B));
1278 // (A&((~A)|B)) -> A&B
1279 if (match(Op0, m_Or(m_Not(m_Specific(Op1)), m_Value(A))) ||
1280 match(Op0, m_Or(m_Value(A), m_Not(m_Specific(Op1)))))
1281 return BinaryOperator::CreateAnd(A, Op1);
1282 if (match(Op1, m_Or(m_Not(m_Specific(Op0)), m_Value(A))) ||
1283 match(Op1, m_Or(m_Value(A), m_Not(m_Specific(Op0)))))
1284 return BinaryOperator::CreateAnd(A, Op0);
1286 // (A ^ B) & ((B ^ C) ^ A) -> (A ^ B) & ~C
1287 if (match(Op0, m_Xor(m_Value(A), m_Value(B))))
1288 if (match(Op1, m_Xor(m_Xor(m_Specific(B), m_Value(C)), m_Specific(A))))
1289 if (Op1->hasOneUse() || cast<BinaryOperator>(Op1)->hasOneUse())
1290 return BinaryOperator::CreateAnd(Op0, Builder->CreateNot(C));
1292 // ((A ^ C) ^ B) & (B ^ A) -> (B ^ A) & ~C
1293 if (match(Op0, m_Xor(m_Xor(m_Value(A), m_Value(C)), m_Value(B))))
1294 if (match(Op1, m_Xor(m_Specific(B), m_Specific(A))))
1295 if (Op0->hasOneUse() || cast<BinaryOperator>(Op0)->hasOneUse())
1296 return BinaryOperator::CreateAnd(Op1, Builder->CreateNot(C));
1298 // (A | B) & ((~A) ^ B) -> (A & B)
1299 if (match(Op0, m_Or(m_Value(A), m_Value(B))) &&
1300 match(Op1, m_Xor(m_Not(m_Specific(A)), m_Specific(B))))
1301 return BinaryOperator::CreateAnd(A, B);
1303 // ((~A) ^ B) & (A | B) -> (A & B)
1304 if (match(Op0, m_Xor(m_Not(m_Value(A)), m_Value(B))) &&
1305 match(Op1, m_Or(m_Specific(A), m_Specific(B))))
1306 return BinaryOperator::CreateAnd(A, B);
1310 ICmpInst *LHS = dyn_cast<ICmpInst>(Op0);
1311 ICmpInst *RHS = dyn_cast<ICmpInst>(Op1);
1313 if (Value *Res = FoldAndOfICmps(LHS, RHS))
1314 return ReplaceInstUsesWith(I, Res);
1316 // TODO: Make this recursive; it's a little tricky because an arbitrary
1317 // number of 'and' instructions might have to be created.
1319 if (LHS && match(Op1, m_OneUse(m_And(m_Value(X), m_Value(Y))))) {
1320 if (auto *Cmp = dyn_cast<ICmpInst>(X))
1321 if (Value *Res = FoldAndOfICmps(LHS, Cmp))
1322 return ReplaceInstUsesWith(I, Builder->CreateAnd(Res, Y));
1323 if (auto *Cmp = dyn_cast<ICmpInst>(Y))
1324 if (Value *Res = FoldAndOfICmps(LHS, Cmp))
1325 return ReplaceInstUsesWith(I, Builder->CreateAnd(Res, X));
1327 if (RHS && match(Op0, m_OneUse(m_And(m_Value(X), m_Value(Y))))) {
1328 if (auto *Cmp = dyn_cast<ICmpInst>(X))
1329 if (Value *Res = FoldAndOfICmps(Cmp, RHS))
1330 return ReplaceInstUsesWith(I, Builder->CreateAnd(Res, Y));
1331 if (auto *Cmp = dyn_cast<ICmpInst>(Y))
1332 if (Value *Res = FoldAndOfICmps(Cmp, RHS))
1333 return ReplaceInstUsesWith(I, Builder->CreateAnd(Res, X));
1337 // If and'ing two fcmp, try combine them into one.
1338 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0)))
1339 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1)))
1340 if (Value *Res = FoldAndOfFCmps(LHS, RHS))
1341 return ReplaceInstUsesWith(I, Res);
1344 // fold (and (cast A), (cast B)) -> (cast (and A, B))
1345 if (CastInst *Op0C = dyn_cast<CastInst>(Op0))
1346 if (CastInst *Op1C = dyn_cast<CastInst>(Op1)) {
1347 Type *SrcTy = Op0C->getOperand(0)->getType();
1348 if (Op0C->getOpcode() == Op1C->getOpcode() && // same cast kind ?
1349 SrcTy == Op1C->getOperand(0)->getType() &&
1350 SrcTy->isIntOrIntVectorTy()) {
1351 Value *Op0COp = Op0C->getOperand(0), *Op1COp = Op1C->getOperand(0);
1353 // Only do this if the casts both really cause code to be generated.
1354 if (ShouldOptimizeCast(Op0C->getOpcode(), Op0COp, I.getType()) &&
1355 ShouldOptimizeCast(Op1C->getOpcode(), Op1COp, I.getType())) {
1356 Value *NewOp = Builder->CreateAnd(Op0COp, Op1COp, I.getName());
1357 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
1360 // If this is and(cast(icmp), cast(icmp)), try to fold this even if the
1361 // cast is otherwise not optimizable. This happens for vector sexts.
1362 if (ICmpInst *RHS = dyn_cast<ICmpInst>(Op1COp))
1363 if (ICmpInst *LHS = dyn_cast<ICmpInst>(Op0COp))
1364 if (Value *Res = FoldAndOfICmps(LHS, RHS))
1365 return CastInst::Create(Op0C->getOpcode(), Res, I.getType());
1367 // If this is and(cast(fcmp), cast(fcmp)), try to fold this even if the
1368 // cast is otherwise not optimizable. This happens for vector sexts.
1369 if (FCmpInst *RHS = dyn_cast<FCmpInst>(Op1COp))
1370 if (FCmpInst *LHS = dyn_cast<FCmpInst>(Op0COp))
1371 if (Value *Res = FoldAndOfFCmps(LHS, RHS))
1372 return CastInst::Create(Op0C->getOpcode(), Res, I.getType());
1378 bool OpsSwapped = false;
1379 // Canonicalize SExt or Not to the LHS
1380 if (match(Op1, m_SExt(m_Value())) ||
1381 match(Op1, m_Not(m_Value()))) {
1382 std::swap(Op0, Op1);
1386 // Fold (and (sext bool to A), B) --> (select bool, B, 0)
1387 if (match(Op0, m_SExt(m_Value(X))) &&
1388 X->getType()->getScalarType()->isIntegerTy(1)) {
1389 Value *Zero = Constant::getNullValue(Op1->getType());
1390 return SelectInst::Create(X, Op1, Zero);
1393 // Fold (and ~(sext bool to A), B) --> (select bool, 0, B)
1394 if (match(Op0, m_Not(m_SExt(m_Value(X)))) &&
1395 X->getType()->getScalarType()->isIntegerTy(1)) {
1396 Value *Zero = Constant::getNullValue(Op0->getType());
1397 return SelectInst::Create(X, Zero, Op1);
1401 std::swap(Op0, Op1);
1404 return Changed ? &I : nullptr;
1407 /// CollectBSwapParts - Analyze the specified subexpression and see if it is
1408 /// capable of providing pieces of a bswap. The subexpression provides pieces
1409 /// of a bswap if it is proven that each of the non-zero bytes in the output of
1410 /// the expression came from the corresponding "byte swapped" byte in some other
1411 /// value. For example, if the current subexpression is "(shl i32 %X, 24)" then
1412 /// we know that the expression deposits the low byte of %X into the high byte
1413 /// of the bswap result and that all other bytes are zero. This expression is
1414 /// accepted, the high byte of ByteValues is set to X to indicate a correct
1417 /// This function returns true if the match was unsuccessful and false if so.
1418 /// On entry to the function the "OverallLeftShift" is a signed integer value
1419 /// indicating the number of bytes that the subexpression is later shifted. For
1420 /// example, if the expression is later right shifted by 16 bits, the
1421 /// OverallLeftShift value would be -2 on entry. This is used to specify which
1422 /// byte of ByteValues is actually being set.
1424 /// Similarly, ByteMask is a bitmask where a bit is clear if its corresponding
1425 /// byte is masked to zero by a user. For example, in (X & 255), X will be
1426 /// processed with a bytemask of 1. Because bytemask is 32-bits, this limits
1427 /// this function to working on up to 32-byte (256 bit) values. ByteMask is
1428 /// always in the local (OverallLeftShift) coordinate space.
1430 static bool CollectBSwapParts(Value *V, int OverallLeftShift, uint32_t ByteMask,
1431 SmallVectorImpl<Value *> &ByteValues) {
1432 if (Instruction *I = dyn_cast<Instruction>(V)) {
1433 // If this is an or instruction, it may be an inner node of the bswap.
1434 if (I->getOpcode() == Instruction::Or) {
1435 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
1437 CollectBSwapParts(I->getOperand(1), OverallLeftShift, ByteMask,
1441 // If this is a logical shift by a constant multiple of 8, recurse with
1442 // OverallLeftShift and ByteMask adjusted.
1443 if (I->isLogicalShift() && isa<ConstantInt>(I->getOperand(1))) {
1445 cast<ConstantInt>(I->getOperand(1))->getLimitedValue(~0U);
1446 // Ensure the shift amount is defined and of a byte value.
1447 if ((ShAmt & 7) || (ShAmt > 8*ByteValues.size()))
1450 unsigned ByteShift = ShAmt >> 3;
1451 if (I->getOpcode() == Instruction::Shl) {
1452 // X << 2 -> collect(X, +2)
1453 OverallLeftShift += ByteShift;
1454 ByteMask >>= ByteShift;
1456 // X >>u 2 -> collect(X, -2)
1457 OverallLeftShift -= ByteShift;
1458 ByteMask <<= ByteShift;
1459 ByteMask &= (~0U >> (32-ByteValues.size()));
1462 if (OverallLeftShift >= (int)ByteValues.size()) return true;
1463 if (OverallLeftShift <= -(int)ByteValues.size()) return true;
1465 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
1469 // If this is a logical 'and' with a mask that clears bytes, clear the
1470 // corresponding bytes in ByteMask.
1471 if (I->getOpcode() == Instruction::And &&
1472 isa<ConstantInt>(I->getOperand(1))) {
1473 // Scan every byte of the and mask, seeing if the byte is either 0 or 255.
1474 unsigned NumBytes = ByteValues.size();
1475 APInt Byte(I->getType()->getPrimitiveSizeInBits(), 255);
1476 const APInt &AndMask = cast<ConstantInt>(I->getOperand(1))->getValue();
1478 for (unsigned i = 0; i != NumBytes; ++i, Byte <<= 8) {
1479 // If this byte is masked out by a later operation, we don't care what
1481 if ((ByteMask & (1 << i)) == 0)
1484 // If the AndMask is all zeros for this byte, clear the bit.
1485 APInt MaskB = AndMask & Byte;
1487 ByteMask &= ~(1U << i);
1491 // If the AndMask is not all ones for this byte, it's not a bytezap.
1495 // Otherwise, this byte is kept.
1498 return CollectBSwapParts(I->getOperand(0), OverallLeftShift, ByteMask,
1503 // Okay, we got to something that isn't a shift, 'or' or 'and'. This must be
1504 // the input value to the bswap. Some observations: 1) if more than one byte
1505 // is demanded from this input, then it could not be successfully assembled
1506 // into a byteswap. At least one of the two bytes would not be aligned with
1507 // their ultimate destination.
1508 if (!isPowerOf2_32(ByteMask)) return true;
1509 unsigned InputByteNo = countTrailingZeros(ByteMask);
1511 // 2) The input and ultimate destinations must line up: if byte 3 of an i32
1512 // is demanded, it needs to go into byte 0 of the result. This means that the
1513 // byte needs to be shifted until it lands in the right byte bucket. The
1514 // shift amount depends on the position: if the byte is coming from the high
1515 // part of the value (e.g. byte 3) then it must be shifted right. If from the
1516 // low part, it must be shifted left.
1517 unsigned DestByteNo = InputByteNo + OverallLeftShift;
1518 if (ByteValues.size()-1-DestByteNo != InputByteNo)
1521 // If the destination byte value is already defined, the values are or'd
1522 // together, which isn't a bswap (unless it's an or of the same bits).
1523 if (ByteValues[DestByteNo] && ByteValues[DestByteNo] != V)
1525 ByteValues[DestByteNo] = V;
1529 /// MatchBSwap - Given an OR instruction, check to see if this is a bswap idiom.
1530 /// If so, insert the new bswap intrinsic and return it.
1531 Instruction *InstCombiner::MatchBSwap(BinaryOperator &I) {
1532 IntegerType *ITy = dyn_cast<IntegerType>(I.getType());
1533 if (!ITy || ITy->getBitWidth() % 16 ||
1534 // ByteMask only allows up to 32-byte values.
1535 ITy->getBitWidth() > 32*8)
1536 return nullptr; // Can only bswap pairs of bytes. Can't do vectors.
1538 /// ByteValues - For each byte of the result, we keep track of which value
1539 /// defines each byte.
1540 SmallVector<Value*, 8> ByteValues;
1541 ByteValues.resize(ITy->getBitWidth()/8);
1543 // Try to find all the pieces corresponding to the bswap.
1544 uint32_t ByteMask = ~0U >> (32-ByteValues.size());
1545 if (CollectBSwapParts(&I, 0, ByteMask, ByteValues))
1548 // Check to see if all of the bytes come from the same value.
1549 Value *V = ByteValues[0];
1550 if (!V) return nullptr; // Didn't find a byte? Must be zero.
1552 // Check to make sure that all of the bytes come from the same value.
1553 for (unsigned i = 1, e = ByteValues.size(); i != e; ++i)
1554 if (ByteValues[i] != V)
1556 Module *M = I.getParent()->getParent()->getParent();
1557 Function *F = Intrinsic::getDeclaration(M, Intrinsic::bswap, ITy);
1558 return CallInst::Create(F, V);
1561 /// MatchSelectFromAndOr - We have an expression of the form (A&C)|(B&D). Check
1562 /// If A is (cond?-1:0) and either B or D is ~(cond?-1,0) or (cond?0,-1), then
1563 /// we can simplify this expression to "cond ? C : D or B".
1564 static Instruction *MatchSelectFromAndOr(Value *A, Value *B,
1565 Value *C, Value *D) {
1566 // If A is not a select of -1/0, this cannot match.
1567 Value *Cond = nullptr;
1568 if (!match(A, m_SExt(m_Value(Cond))) ||
1569 !Cond->getType()->isIntegerTy(1))
1572 // ((cond?-1:0)&C) | (B&(cond?0:-1)) -> cond ? C : B.
1573 if (match(D, m_Not(m_SExt(m_Specific(Cond)))))
1574 return SelectInst::Create(Cond, C, B);
1575 if (match(D, m_SExt(m_Not(m_Specific(Cond)))))
1576 return SelectInst::Create(Cond, C, B);
1578 // ((cond?-1:0)&C) | ((cond?0:-1)&D) -> cond ? C : D.
1579 if (match(B, m_Not(m_SExt(m_Specific(Cond)))))
1580 return SelectInst::Create(Cond, C, D);
1581 if (match(B, m_SExt(m_Not(m_Specific(Cond)))))
1582 return SelectInst::Create(Cond, C, D);
1586 /// FoldOrOfICmps - Fold (icmp)|(icmp) if possible.
1587 Value *InstCombiner::FoldOrOfICmps(ICmpInst *LHS, ICmpInst *RHS,
1588 Instruction *CxtI) {
1589 ICmpInst::Predicate LHSCC = LHS->getPredicate(), RHSCC = RHS->getPredicate();
1591 // Fold (iszero(A & K1) | iszero(A & K2)) -> (A & (K1 | K2)) != (K1 | K2)
1592 // if K1 and K2 are a one-bit mask.
1593 ConstantInt *LHSCst = dyn_cast<ConstantInt>(LHS->getOperand(1));
1594 ConstantInt *RHSCst = dyn_cast<ConstantInt>(RHS->getOperand(1));
1596 if (LHS->getPredicate() == ICmpInst::ICMP_EQ && LHSCst && LHSCst->isZero() &&
1597 RHS->getPredicate() == ICmpInst::ICMP_EQ && RHSCst && RHSCst->isZero()) {
1599 BinaryOperator *LAnd = dyn_cast<BinaryOperator>(LHS->getOperand(0));
1600 BinaryOperator *RAnd = dyn_cast<BinaryOperator>(RHS->getOperand(0));
1601 if (LAnd && RAnd && LAnd->hasOneUse() && RHS->hasOneUse() &&
1602 LAnd->getOpcode() == Instruction::And &&
1603 RAnd->getOpcode() == Instruction::And) {
1605 Value *Mask = nullptr;
1606 Value *Masked = nullptr;
1607 if (LAnd->getOperand(0) == RAnd->getOperand(0) &&
1608 isKnownToBeAPowerOfTwo(LAnd->getOperand(1), false, 0, AT, CxtI, DT) &&
1609 isKnownToBeAPowerOfTwo(RAnd->getOperand(1), false, 0, AT, CxtI, DT)) {
1610 Mask = Builder->CreateOr(LAnd->getOperand(1), RAnd->getOperand(1));
1611 Masked = Builder->CreateAnd(LAnd->getOperand(0), Mask);
1612 } else if (LAnd->getOperand(1) == RAnd->getOperand(1) &&
1613 isKnownToBeAPowerOfTwo(LAnd->getOperand(0),
1614 false, 0, AT, CxtI, DT) &&
1615 isKnownToBeAPowerOfTwo(RAnd->getOperand(0),
1616 false, 0, AT, CxtI, DT)) {
1617 Mask = Builder->CreateOr(LAnd->getOperand(0), RAnd->getOperand(0));
1618 Masked = Builder->CreateAnd(LAnd->getOperand(1), Mask);
1622 return Builder->CreateICmp(ICmpInst::ICMP_NE, Masked, Mask);
1626 // Fold (icmp ult/ule (A + C1), C3) | (icmp ult/ule (A + C2), C3)
1627 // --> (icmp ult/ule ((A & ~(C1 ^ C2)) + max(C1, C2)), C3)
1628 // The original condition actually refers to the following two ranges:
1629 // [MAX_UINT-C1+1, MAX_UINT-C1+1+C3] and [MAX_UINT-C2+1, MAX_UINT-C2+1+C3]
1630 // We can fold these two ranges if:
1631 // 1) C1 and C2 is unsigned greater than C3.
1632 // 2) The two ranges are separated.
1633 // 3) C1 ^ C2 is one-bit mask.
1634 // 4) LowRange1 ^ LowRange2 and HighRange1 ^ HighRange2 are one-bit mask.
1635 // This implies all values in the two ranges differ by exactly one bit.
1637 if ((LHSCC == ICmpInst::ICMP_ULT || LHSCC == ICmpInst::ICMP_ULE) &&
1638 LHSCC == RHSCC && LHSCst && RHSCst && LHS->hasOneUse() &&
1639 RHS->hasOneUse() && LHSCst->getType() == RHSCst->getType() &&
1640 LHSCst->getValue() == (RHSCst->getValue())) {
1642 Value *LAdd = LHS->getOperand(0);
1643 Value *RAdd = RHS->getOperand(0);
1645 Value *LAddOpnd, *RAddOpnd;
1646 ConstantInt *LAddCst, *RAddCst;
1647 if (match(LAdd, m_Add(m_Value(LAddOpnd), m_ConstantInt(LAddCst))) &&
1648 match(RAdd, m_Add(m_Value(RAddOpnd), m_ConstantInt(RAddCst))) &&
1649 LAddCst->getValue().ugt(LHSCst->getValue()) &&
1650 RAddCst->getValue().ugt(LHSCst->getValue())) {
1652 APInt DiffCst = LAddCst->getValue() ^ RAddCst->getValue();
1653 if (LAddOpnd == RAddOpnd && DiffCst.isPowerOf2()) {
1654 ConstantInt *MaxAddCst = nullptr;
1655 if (LAddCst->getValue().ult(RAddCst->getValue()))
1656 MaxAddCst = RAddCst;
1658 MaxAddCst = LAddCst;
1660 APInt RRangeLow = -RAddCst->getValue();
1661 APInt RRangeHigh = RRangeLow + LHSCst->getValue();
1662 APInt LRangeLow = -LAddCst->getValue();
1663 APInt LRangeHigh = LRangeLow + LHSCst->getValue();
1664 APInt LowRangeDiff = RRangeLow ^ LRangeLow;
1665 APInt HighRangeDiff = RRangeHigh ^ LRangeHigh;
1666 APInt RangeDiff = LRangeLow.sgt(RRangeLow) ? LRangeLow - RRangeLow
1667 : RRangeLow - LRangeLow;
1669 if (LowRangeDiff.isPowerOf2() && LowRangeDiff == HighRangeDiff &&
1670 RangeDiff.ugt(LHSCst->getValue())) {
1671 Value *MaskCst = ConstantInt::get(LAddCst->getType(), ~DiffCst);
1673 Value *NewAnd = Builder->CreateAnd(LAddOpnd, MaskCst);
1674 Value *NewAdd = Builder->CreateAdd(NewAnd, MaxAddCst);
1675 return (Builder->CreateICmp(LHS->getPredicate(), NewAdd, LHSCst));
1681 // (icmp1 A, B) | (icmp2 A, B) --> (icmp3 A, B)
1682 if (PredicatesFoldable(LHSCC, RHSCC)) {
1683 if (LHS->getOperand(0) == RHS->getOperand(1) &&
1684 LHS->getOperand(1) == RHS->getOperand(0))
1685 LHS->swapOperands();
1686 if (LHS->getOperand(0) == RHS->getOperand(0) &&
1687 LHS->getOperand(1) == RHS->getOperand(1)) {
1688 Value *Op0 = LHS->getOperand(0), *Op1 = LHS->getOperand(1);
1689 unsigned Code = getICmpCode(LHS) | getICmpCode(RHS);
1690 bool isSigned = LHS->isSigned() || RHS->isSigned();
1691 return getNewICmpValue(isSigned, Code, Op0, Op1, Builder);
1695 // handle (roughly):
1696 // (icmp ne (A & B), C) | (icmp ne (A & D), E)
1697 if (Value *V = foldLogOpOfMaskedICmps(LHS, RHS, false, Builder))
1700 Value *Val = LHS->getOperand(0), *Val2 = RHS->getOperand(0);
1701 if (LHS->hasOneUse() || RHS->hasOneUse()) {
1702 // (icmp eq B, 0) | (icmp ult A, B) -> (icmp ule A, B-1)
1703 // (icmp eq B, 0) | (icmp ugt B, A) -> (icmp ule A, B-1)
1704 Value *A = nullptr, *B = nullptr;
1705 if (LHSCC == ICmpInst::ICMP_EQ && LHSCst && LHSCst->isZero()) {
1707 if (RHSCC == ICmpInst::ICMP_ULT && Val == RHS->getOperand(1))
1709 else if (RHSCC == ICmpInst::ICMP_UGT && Val == Val2)
1710 A = RHS->getOperand(1);
1712 // (icmp ult A, B) | (icmp eq B, 0) -> (icmp ule A, B-1)
1713 // (icmp ugt B, A) | (icmp eq B, 0) -> (icmp ule A, B-1)
1714 else if (RHSCC == ICmpInst::ICMP_EQ && RHSCst && RHSCst->isZero()) {
1716 if (LHSCC == ICmpInst::ICMP_ULT && Val2 == LHS->getOperand(1))
1718 else if (LHSCC == ICmpInst::ICMP_UGT && Val2 == Val)
1719 A = LHS->getOperand(1);
1722 return Builder->CreateICmp(
1724 Builder->CreateAdd(B, ConstantInt::getSigned(B->getType(), -1)), A);
1727 // This only handles icmp of constants: (icmp1 A, C1) | (icmp2 B, C2).
1728 if (!LHSCst || !RHSCst) return nullptr;
1730 if (LHSCst == RHSCst && LHSCC == RHSCC) {
1731 // (icmp ne A, 0) | (icmp ne B, 0) --> (icmp ne (A|B), 0)
1732 if (LHSCC == ICmpInst::ICMP_NE && LHSCst->isZero()) {
1733 Value *NewOr = Builder->CreateOr(Val, Val2);
1734 return Builder->CreateICmp(LHSCC, NewOr, LHSCst);
1738 // (icmp ult (X + CA), C1) | (icmp eq X, C2) -> (icmp ule (X + CA), C1)
1739 // iff C2 + CA == C1.
1740 if (LHSCC == ICmpInst::ICMP_ULT && RHSCC == ICmpInst::ICMP_EQ) {
1741 ConstantInt *AddCst;
1742 if (match(Val, m_Add(m_Specific(Val2), m_ConstantInt(AddCst))))
1743 if (RHSCst->getValue() + AddCst->getValue() == LHSCst->getValue())
1744 return Builder->CreateICmpULE(Val, LHSCst);
1747 // From here on, we only handle:
1748 // (icmp1 A, C1) | (icmp2 A, C2) --> something simpler.
1749 if (Val != Val2) return nullptr;
1751 // ICMP_[US][GL]E X, CST is folded to ICMP_[US][GL]T elsewhere.
1752 if (LHSCC == ICmpInst::ICMP_UGE || LHSCC == ICmpInst::ICMP_ULE ||
1753 RHSCC == ICmpInst::ICMP_UGE || RHSCC == ICmpInst::ICMP_ULE ||
1754 LHSCC == ICmpInst::ICMP_SGE || LHSCC == ICmpInst::ICMP_SLE ||
1755 RHSCC == ICmpInst::ICMP_SGE || RHSCC == ICmpInst::ICMP_SLE)
1758 // We can't fold (ugt x, C) | (sgt x, C2).
1759 if (!PredicatesFoldable(LHSCC, RHSCC))
1762 // Ensure that the larger constant is on the RHS.
1764 if (CmpInst::isSigned(LHSCC) ||
1765 (ICmpInst::isEquality(LHSCC) &&
1766 CmpInst::isSigned(RHSCC)))
1767 ShouldSwap = LHSCst->getValue().sgt(RHSCst->getValue());
1769 ShouldSwap = LHSCst->getValue().ugt(RHSCst->getValue());
1772 std::swap(LHS, RHS);
1773 std::swap(LHSCst, RHSCst);
1774 std::swap(LHSCC, RHSCC);
1777 // At this point, we know we have two icmp instructions
1778 // comparing a value against two constants and or'ing the result
1779 // together. Because of the above check, we know that we only have
1780 // ICMP_EQ, ICMP_NE, ICMP_LT, and ICMP_GT here. We also know (from the
1781 // icmp folding check above), that the two constants are not
1783 assert(LHSCst != RHSCst && "Compares not folded above?");
1786 default: llvm_unreachable("Unknown integer condition code!");
1787 case ICmpInst::ICMP_EQ:
1789 default: llvm_unreachable("Unknown integer condition code!");
1790 case ICmpInst::ICMP_EQ:
1791 if (LHS->getOperand(0) == RHS->getOperand(0)) {
1792 // if LHSCst and RHSCst differ only by one bit:
1793 // (A == C1 || A == C2) -> (A & ~(C1 ^ C2)) == C1
1794 assert(LHSCst->getValue().ule(LHSCst->getValue()));
1796 APInt Xor = LHSCst->getValue() ^ RHSCst->getValue();
1797 if (Xor.isPowerOf2()) {
1798 Value *NegCst = Builder->getInt(~Xor);
1799 Value *And = Builder->CreateAnd(LHS->getOperand(0), NegCst);
1800 return Builder->CreateICmp(ICmpInst::ICMP_EQ, And, LHSCst);
1804 if (LHSCst == SubOne(RHSCst)) {
1805 // (X == 13 | X == 14) -> X-13 <u 2
1806 Constant *AddCST = ConstantExpr::getNeg(LHSCst);
1807 Value *Add = Builder->CreateAdd(Val, AddCST, Val->getName()+".off");
1808 AddCST = ConstantExpr::getSub(AddOne(RHSCst), LHSCst);
1809 return Builder->CreateICmpULT(Add, AddCST);
1812 break; // (X == 13 | X == 15) -> no change
1813 case ICmpInst::ICMP_UGT: // (X == 13 | X u> 14) -> no change
1814 case ICmpInst::ICMP_SGT: // (X == 13 | X s> 14) -> no change
1816 case ICmpInst::ICMP_NE: // (X == 13 | X != 15) -> X != 15
1817 case ICmpInst::ICMP_ULT: // (X == 13 | X u< 15) -> X u< 15
1818 case ICmpInst::ICMP_SLT: // (X == 13 | X s< 15) -> X s< 15
1822 case ICmpInst::ICMP_NE:
1824 default: llvm_unreachable("Unknown integer condition code!");
1825 case ICmpInst::ICMP_EQ: // (X != 13 | X == 15) -> X != 13
1826 case ICmpInst::ICMP_UGT: // (X != 13 | X u> 15) -> X != 13
1827 case ICmpInst::ICMP_SGT: // (X != 13 | X s> 15) -> X != 13
1829 case ICmpInst::ICMP_NE: // (X != 13 | X != 15) -> true
1830 case ICmpInst::ICMP_ULT: // (X != 13 | X u< 15) -> true
1831 case ICmpInst::ICMP_SLT: // (X != 13 | X s< 15) -> true
1832 return Builder->getTrue();
1834 case ICmpInst::ICMP_ULT:
1836 default: llvm_unreachable("Unknown integer condition code!");
1837 case ICmpInst::ICMP_EQ: // (X u< 13 | X == 14) -> no change
1839 case ICmpInst::ICMP_UGT: // (X u< 13 | X u> 15) -> (X-13) u> 2
1840 // If RHSCst is [us]MAXINT, it is always false. Not handling
1841 // this can cause overflow.
1842 if (RHSCst->isMaxValue(false))
1844 return InsertRangeTest(Val, LHSCst, AddOne(RHSCst), false, false);
1845 case ICmpInst::ICMP_SGT: // (X u< 13 | X s> 15) -> no change
1847 case ICmpInst::ICMP_NE: // (X u< 13 | X != 15) -> X != 15
1848 case ICmpInst::ICMP_ULT: // (X u< 13 | X u< 15) -> X u< 15
1850 case ICmpInst::ICMP_SLT: // (X u< 13 | X s< 15) -> no change
1854 case ICmpInst::ICMP_SLT:
1856 default: llvm_unreachable("Unknown integer condition code!");
1857 case ICmpInst::ICMP_EQ: // (X s< 13 | X == 14) -> no change
1859 case ICmpInst::ICMP_SGT: // (X s< 13 | X s> 15) -> (X-13) s> 2
1860 // If RHSCst is [us]MAXINT, it is always false. Not handling
1861 // this can cause overflow.
1862 if (RHSCst->isMaxValue(true))
1864 return InsertRangeTest(Val, LHSCst, AddOne(RHSCst), true, false);
1865 case ICmpInst::ICMP_UGT: // (X s< 13 | X u> 15) -> no change
1867 case ICmpInst::ICMP_NE: // (X s< 13 | X != 15) -> X != 15
1868 case ICmpInst::ICMP_SLT: // (X s< 13 | X s< 15) -> X s< 15
1870 case ICmpInst::ICMP_ULT: // (X s< 13 | X u< 15) -> no change
1874 case ICmpInst::ICMP_UGT:
1876 default: llvm_unreachable("Unknown integer condition code!");
1877 case ICmpInst::ICMP_EQ: // (X u> 13 | X == 15) -> X u> 13
1878 case ICmpInst::ICMP_UGT: // (X u> 13 | X u> 15) -> X u> 13
1880 case ICmpInst::ICMP_SGT: // (X u> 13 | X s> 15) -> no change
1882 case ICmpInst::ICMP_NE: // (X u> 13 | X != 15) -> true
1883 case ICmpInst::ICMP_ULT: // (X u> 13 | X u< 15) -> true
1884 return Builder->getTrue();
1885 case ICmpInst::ICMP_SLT: // (X u> 13 | X s< 15) -> no change
1889 case ICmpInst::ICMP_SGT:
1891 default: llvm_unreachable("Unknown integer condition code!");
1892 case ICmpInst::ICMP_EQ: // (X s> 13 | X == 15) -> X > 13
1893 case ICmpInst::ICMP_SGT: // (X s> 13 | X s> 15) -> X > 13
1895 case ICmpInst::ICMP_UGT: // (X s> 13 | X u> 15) -> no change
1897 case ICmpInst::ICMP_NE: // (X s> 13 | X != 15) -> true
1898 case ICmpInst::ICMP_SLT: // (X s> 13 | X s< 15) -> true
1899 return Builder->getTrue();
1900 case ICmpInst::ICMP_ULT: // (X s> 13 | X u< 15) -> no change
1908 /// FoldOrOfFCmps - Optimize (fcmp)|(fcmp). NOTE: Unlike the rest of
1909 /// instcombine, this returns a Value which should already be inserted into the
1911 Value *InstCombiner::FoldOrOfFCmps(FCmpInst *LHS, FCmpInst *RHS) {
1912 if (LHS->getPredicate() == FCmpInst::FCMP_UNO &&
1913 RHS->getPredicate() == FCmpInst::FCMP_UNO &&
1914 LHS->getOperand(0)->getType() == RHS->getOperand(0)->getType()) {
1915 if (ConstantFP *LHSC = dyn_cast<ConstantFP>(LHS->getOperand(1)))
1916 if (ConstantFP *RHSC = dyn_cast<ConstantFP>(RHS->getOperand(1))) {
1917 // If either of the constants are nans, then the whole thing returns
1919 if (LHSC->getValueAPF().isNaN() || RHSC->getValueAPF().isNaN())
1920 return Builder->getTrue();
1922 // Otherwise, no need to compare the two constants, compare the
1924 return Builder->CreateFCmpUNO(LHS->getOperand(0), RHS->getOperand(0));
1927 // Handle vector zeros. This occurs because the canonical form of
1928 // "fcmp uno x,x" is "fcmp uno x, 0".
1929 if (isa<ConstantAggregateZero>(LHS->getOperand(1)) &&
1930 isa<ConstantAggregateZero>(RHS->getOperand(1)))
1931 return Builder->CreateFCmpUNO(LHS->getOperand(0), RHS->getOperand(0));
1936 Value *Op0LHS = LHS->getOperand(0), *Op0RHS = LHS->getOperand(1);
1937 Value *Op1LHS = RHS->getOperand(0), *Op1RHS = RHS->getOperand(1);
1938 FCmpInst::Predicate Op0CC = LHS->getPredicate(), Op1CC = RHS->getPredicate();
1940 if (Op0LHS == Op1RHS && Op0RHS == Op1LHS) {
1941 // Swap RHS operands to match LHS.
1942 Op1CC = FCmpInst::getSwappedPredicate(Op1CC);
1943 std::swap(Op1LHS, Op1RHS);
1945 if (Op0LHS == Op1LHS && Op0RHS == Op1RHS) {
1946 // Simplify (fcmp cc0 x, y) | (fcmp cc1 x, y).
1948 return Builder->CreateFCmp((FCmpInst::Predicate)Op0CC, Op0LHS, Op0RHS);
1949 if (Op0CC == FCmpInst::FCMP_TRUE || Op1CC == FCmpInst::FCMP_TRUE)
1950 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 1);
1951 if (Op0CC == FCmpInst::FCMP_FALSE)
1953 if (Op1CC == FCmpInst::FCMP_FALSE)
1957 unsigned Op0Pred = getFCmpCode(Op0CC, Op0Ordered);
1958 unsigned Op1Pred = getFCmpCode(Op1CC, Op1Ordered);
1959 if (Op0Ordered == Op1Ordered) {
1960 // If both are ordered or unordered, return a new fcmp with
1961 // or'ed predicates.
1962 return getFCmpValue(Op0Ordered, Op0Pred|Op1Pred, Op0LHS, Op0RHS, Builder);
1968 /// FoldOrWithConstants - This helper function folds:
1970 /// ((A | B) & C1) | (B & C2)
1976 /// when the XOR of the two constants is "all ones" (-1).
1977 Instruction *InstCombiner::FoldOrWithConstants(BinaryOperator &I, Value *Op,
1978 Value *A, Value *B, Value *C) {
1979 ConstantInt *CI1 = dyn_cast<ConstantInt>(C);
1980 if (!CI1) return nullptr;
1982 Value *V1 = nullptr;
1983 ConstantInt *CI2 = nullptr;
1984 if (!match(Op, m_And(m_Value(V1), m_ConstantInt(CI2)))) return nullptr;
1986 APInt Xor = CI1->getValue() ^ CI2->getValue();
1987 if (!Xor.isAllOnesValue()) return nullptr;
1989 if (V1 == A || V1 == B) {
1990 Value *NewOp = Builder->CreateAnd((V1 == A) ? B : A, CI1);
1991 return BinaryOperator::CreateOr(NewOp, V1);
1997 /// \brief This helper function folds:
1999 /// ((A | B) & C1) ^ (B & C2)
2005 /// when the XOR of the two constants is "all ones" (-1).
2006 Instruction *InstCombiner::FoldXorWithConstants(BinaryOperator &I, Value *Op,
2007 Value *A, Value *B, Value *C) {
2008 ConstantInt *CI1 = dyn_cast<ConstantInt>(C);
2012 Value *V1 = nullptr;
2013 ConstantInt *CI2 = nullptr;
2014 if (!match(Op, m_And(m_Value(V1), m_ConstantInt(CI2))))
2017 APInt Xor = CI1->getValue() ^ CI2->getValue();
2018 if (!Xor.isAllOnesValue())
2021 if (V1 == A || V1 == B) {
2022 Value *NewOp = Builder->CreateAnd(V1 == A ? B : A, CI1);
2023 return BinaryOperator::CreateXor(NewOp, V1);
2029 Instruction *InstCombiner::visitOr(BinaryOperator &I) {
2030 bool Changed = SimplifyAssociativeOrCommutative(I);
2031 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2033 if (Value *V = SimplifyVectorOp(I))
2034 return ReplaceInstUsesWith(I, V);
2036 if (Value *V = SimplifyOrInst(Op0, Op1, DL, TLI, DT, AT))
2037 return ReplaceInstUsesWith(I, V);
2039 // (A&B)|(A&C) -> A&(B|C) etc
2040 if (Value *V = SimplifyUsingDistributiveLaws(I))
2041 return ReplaceInstUsesWith(I, V);
2043 // See if we can simplify any instructions used by the instruction whose sole
2044 // purpose is to compute bits we don't care about.
2045 if (SimplifyDemandedInstructionBits(I))
2048 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2049 ConstantInt *C1 = nullptr; Value *X = nullptr;
2050 // (X & C1) | C2 --> (X | C2) & (C1|C2)
2051 // iff (C1 & C2) == 0.
2052 if (match(Op0, m_And(m_Value(X), m_ConstantInt(C1))) &&
2053 (RHS->getValue() & C1->getValue()) != 0 &&
2055 Value *Or = Builder->CreateOr(X, RHS);
2057 return BinaryOperator::CreateAnd(Or,
2058 Builder->getInt(RHS->getValue() | C1->getValue()));
2061 // (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2)
2062 if (match(Op0, m_Xor(m_Value(X), m_ConstantInt(C1))) &&
2064 Value *Or = Builder->CreateOr(X, RHS);
2066 return BinaryOperator::CreateXor(Or,
2067 Builder->getInt(C1->getValue() & ~RHS->getValue()));
2070 // Try to fold constant and into select arguments.
2071 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2072 if (Instruction *R = FoldOpIntoSelect(I, SI))
2075 if (isa<PHINode>(Op0))
2076 if (Instruction *NV = FoldOpIntoPhi(I))
2080 Value *A = nullptr, *B = nullptr;
2081 ConstantInt *C1 = nullptr, *C2 = nullptr;
2083 // (A | B) | C and A | (B | C) -> bswap if possible.
2084 // (A >> B) | (C << D) and (A << B) | (B >> C) -> bswap if possible.
2085 if (match(Op0, m_Or(m_Value(), m_Value())) ||
2086 match(Op1, m_Or(m_Value(), m_Value())) ||
2087 (match(Op0, m_LogicalShift(m_Value(), m_Value())) &&
2088 match(Op1, m_LogicalShift(m_Value(), m_Value())))) {
2089 if (Instruction *BSwap = MatchBSwap(I))
2093 // (X^C)|Y -> (X|Y)^C iff Y&C == 0
2094 if (Op0->hasOneUse() &&
2095 match(Op0, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
2096 MaskedValueIsZero(Op1, C1->getValue(), 0, &I)) {
2097 Value *NOr = Builder->CreateOr(A, Op1);
2099 return BinaryOperator::CreateXor(NOr, C1);
2102 // Y|(X^C) -> (X|Y)^C iff Y&C == 0
2103 if (Op1->hasOneUse() &&
2104 match(Op1, m_Xor(m_Value(A), m_ConstantInt(C1))) &&
2105 MaskedValueIsZero(Op0, C1->getValue(), 0, &I)) {
2106 Value *NOr = Builder->CreateOr(A, Op0);
2108 return BinaryOperator::CreateXor(NOr, C1);
2111 // ((~A & B) | A) -> (A | B)
2112 if (match(Op0, m_And(m_Not(m_Value(A)), m_Value(B))) &&
2113 match(Op1, m_Specific(A)))
2114 return BinaryOperator::CreateOr(A, B);
2116 // ((A & B) | ~A) -> (~A | B)
2117 if (match(Op0, m_And(m_Value(A), m_Value(B))) &&
2118 match(Op1, m_Not(m_Specific(A))))
2119 return BinaryOperator::CreateOr(Builder->CreateNot(A), B);
2121 // (A & (~B)) | (A ^ B) -> (A ^ B)
2122 if (match(Op0, m_And(m_Value(A), m_Not(m_Value(B)))) &&
2123 match(Op1, m_Xor(m_Specific(A), m_Specific(B))))
2124 return BinaryOperator::CreateXor(A, B);
2126 // (A ^ B) | ( A & (~B)) -> (A ^ B)
2127 if (match(Op0, m_Xor(m_Value(A), m_Value(B))) &&
2128 match(Op1, m_And(m_Specific(A), m_Not(m_Specific(B)))))
2129 return BinaryOperator::CreateXor(A, B);
2132 Value *C = nullptr, *D = nullptr;
2133 if (match(Op0, m_And(m_Value(A), m_Value(C))) &&
2134 match(Op1, m_And(m_Value(B), m_Value(D)))) {
2135 Value *V1 = nullptr, *V2 = nullptr;
2136 C1 = dyn_cast<ConstantInt>(C);
2137 C2 = dyn_cast<ConstantInt>(D);
2138 if (C1 && C2) { // (A & C1)|(B & C2)
2139 if ((C1->getValue() & C2->getValue()) == 0) {
2140 // ((V | N) & C1) | (V & C2) --> (V|N) & (C1|C2)
2141 // iff (C1&C2) == 0 and (N&~C1) == 0
2142 if (match(A, m_Or(m_Value(V1), m_Value(V2))) &&
2144 MaskedValueIsZero(V2, ~C1->getValue(), 0, &I)) || // (V|N)
2146 MaskedValueIsZero(V1, ~C1->getValue(), 0, &I)))) // (N|V)
2147 return BinaryOperator::CreateAnd(A,
2148 Builder->getInt(C1->getValue()|C2->getValue()));
2149 // Or commutes, try both ways.
2150 if (match(B, m_Or(m_Value(V1), m_Value(V2))) &&
2152 MaskedValueIsZero(V2, ~C2->getValue(), 0, &I)) || // (V|N)
2154 MaskedValueIsZero(V1, ~C2->getValue(), 0, &I)))) // (N|V)
2155 return BinaryOperator::CreateAnd(B,
2156 Builder->getInt(C1->getValue()|C2->getValue()));
2158 // ((V|C3)&C1) | ((V|C4)&C2) --> (V|C3|C4)&(C1|C2)
2159 // iff (C1&C2) == 0 and (C3&~C1) == 0 and (C4&~C2) == 0.
2160 ConstantInt *C3 = nullptr, *C4 = nullptr;
2161 if (match(A, m_Or(m_Value(V1), m_ConstantInt(C3))) &&
2162 (C3->getValue() & ~C1->getValue()) == 0 &&
2163 match(B, m_Or(m_Specific(V1), m_ConstantInt(C4))) &&
2164 (C4->getValue() & ~C2->getValue()) == 0) {
2165 V2 = Builder->CreateOr(V1, ConstantExpr::getOr(C3, C4), "bitfield");
2166 return BinaryOperator::CreateAnd(V2,
2167 Builder->getInt(C1->getValue()|C2->getValue()));
2172 // (A & (C0?-1:0)) | (B & ~(C0?-1:0)) -> C0 ? A : B, and commuted variants.
2173 // Don't do this for vector select idioms, the code generator doesn't handle
2175 if (!I.getType()->isVectorTy()) {
2176 if (Instruction *Match = MatchSelectFromAndOr(A, B, C, D))
2178 if (Instruction *Match = MatchSelectFromAndOr(B, A, D, C))
2180 if (Instruction *Match = MatchSelectFromAndOr(C, B, A, D))
2182 if (Instruction *Match = MatchSelectFromAndOr(D, A, B, C))
2186 // ((A&~B)|(~A&B)) -> A^B
2187 if ((match(C, m_Not(m_Specific(D))) &&
2188 match(B, m_Not(m_Specific(A)))))
2189 return BinaryOperator::CreateXor(A, D);
2190 // ((~B&A)|(~A&B)) -> A^B
2191 if ((match(A, m_Not(m_Specific(D))) &&
2192 match(B, m_Not(m_Specific(C)))))
2193 return BinaryOperator::CreateXor(C, D);
2194 // ((A&~B)|(B&~A)) -> A^B
2195 if ((match(C, m_Not(m_Specific(B))) &&
2196 match(D, m_Not(m_Specific(A)))))
2197 return BinaryOperator::CreateXor(A, B);
2198 // ((~B&A)|(B&~A)) -> A^B
2199 if ((match(A, m_Not(m_Specific(B))) &&
2200 match(D, m_Not(m_Specific(C)))))
2201 return BinaryOperator::CreateXor(C, B);
2203 // ((A|B)&1)|(B&-2) -> (A&1) | B
2204 if (match(A, m_Or(m_Value(V1), m_Specific(B))) ||
2205 match(A, m_Or(m_Specific(B), m_Value(V1)))) {
2206 Instruction *Ret = FoldOrWithConstants(I, Op1, V1, B, C);
2207 if (Ret) return Ret;
2209 // (B&-2)|((A|B)&1) -> (A&1) | B
2210 if (match(B, m_Or(m_Specific(A), m_Value(V1))) ||
2211 match(B, m_Or(m_Value(V1), m_Specific(A)))) {
2212 Instruction *Ret = FoldOrWithConstants(I, Op0, A, V1, D);
2213 if (Ret) return Ret;
2215 // ((A^B)&1)|(B&-2) -> (A&1) ^ B
2216 if (match(A, m_Xor(m_Value(V1), m_Specific(B))) ||
2217 match(A, m_Xor(m_Specific(B), m_Value(V1)))) {
2218 Instruction *Ret = FoldXorWithConstants(I, Op1, V1, B, C);
2219 if (Ret) return Ret;
2221 // (B&-2)|((A^B)&1) -> (A&1) ^ B
2222 if (match(B, m_Xor(m_Specific(A), m_Value(V1))) ||
2223 match(B, m_Xor(m_Value(V1), m_Specific(A)))) {
2224 Instruction *Ret = FoldXorWithConstants(I, Op0, A, V1, D);
2225 if (Ret) return Ret;
2229 // (A ^ B) | ((B ^ C) ^ A) -> (A ^ B) | C
2230 if (match(Op0, m_Xor(m_Value(A), m_Value(B))))
2231 if (match(Op1, m_Xor(m_Xor(m_Specific(B), m_Value(C)), m_Specific(A))))
2232 if (Op1->hasOneUse() || cast<BinaryOperator>(Op1)->hasOneUse())
2233 return BinaryOperator::CreateOr(Op0, C);
2235 // ((A ^ C) ^ B) | (B ^ A) -> (B ^ A) | C
2236 if (match(Op0, m_Xor(m_Xor(m_Value(A), m_Value(C)), m_Value(B))))
2237 if (match(Op1, m_Xor(m_Specific(B), m_Specific(A))))
2238 if (Op0->hasOneUse() || cast<BinaryOperator>(Op0)->hasOneUse())
2239 return BinaryOperator::CreateOr(Op1, C);
2241 // ((B | C) & A) | B -> B | (A & C)
2242 if (match(Op0, m_And(m_Or(m_Specific(Op1), m_Value(C)), m_Value(A))))
2243 return BinaryOperator::CreateOr(Op1, Builder->CreateAnd(A, C));
2245 // (~A | ~B) == (~(A & B)) - De Morgan's Law
2246 if (Value *Op0NotVal = dyn_castNotVal(Op0))
2247 if (Value *Op1NotVal = dyn_castNotVal(Op1))
2248 if (Op0->hasOneUse() && Op1->hasOneUse()) {
2249 Value *And = Builder->CreateAnd(Op0NotVal, Op1NotVal,
2250 I.getName()+".demorgan");
2251 return BinaryOperator::CreateNot(And);
2254 // Canonicalize xor to the RHS.
2255 bool SwappedForXor = false;
2256 if (match(Op0, m_Xor(m_Value(), m_Value()))) {
2257 std::swap(Op0, Op1);
2258 SwappedForXor = true;
2261 // A | ( A ^ B) -> A | B
2262 // A | (~A ^ B) -> A | ~B
2263 // (A & B) | (A ^ B)
2264 if (match(Op1, m_Xor(m_Value(A), m_Value(B)))) {
2265 if (Op0 == A || Op0 == B)
2266 return BinaryOperator::CreateOr(A, B);
2268 if (match(Op0, m_And(m_Specific(A), m_Specific(B))) ||
2269 match(Op0, m_And(m_Specific(B), m_Specific(A))))
2270 return BinaryOperator::CreateOr(A, B);
2272 if (Op1->hasOneUse() && match(A, m_Not(m_Specific(Op0)))) {
2273 Value *Not = Builder->CreateNot(B, B->getName()+".not");
2274 return BinaryOperator::CreateOr(Not, Op0);
2276 if (Op1->hasOneUse() && match(B, m_Not(m_Specific(Op0)))) {
2277 Value *Not = Builder->CreateNot(A, A->getName()+".not");
2278 return BinaryOperator::CreateOr(Not, Op0);
2282 // A | ~(A | B) -> A | ~B
2283 // A | ~(A ^ B) -> A | ~B
2284 if (match(Op1, m_Not(m_Value(A))))
2285 if (BinaryOperator *B = dyn_cast<BinaryOperator>(A))
2286 if ((Op0 == B->getOperand(0) || Op0 == B->getOperand(1)) &&
2287 Op1->hasOneUse() && (B->getOpcode() == Instruction::Or ||
2288 B->getOpcode() == Instruction::Xor)) {
2289 Value *NotOp = Op0 == B->getOperand(0) ? B->getOperand(1) :
2291 Value *Not = Builder->CreateNot(NotOp, NotOp->getName()+".not");
2292 return BinaryOperator::CreateOr(Not, Op0);
2295 // (A & B) | ((~A) ^ B) -> (~A ^ B)
2296 if (match(Op0, m_And(m_Value(A), m_Value(B))) &&
2297 match(Op1, m_Xor(m_Not(m_Specific(A)), m_Specific(B))))
2298 return BinaryOperator::CreateXor(Builder->CreateNot(A), B);
2300 // ((~A) ^ B) | (A & B) -> (~A ^ B)
2301 if (match(Op0, m_Xor(m_Not(m_Value(A)), m_Value(B))) &&
2302 match(Op1, m_And(m_Specific(A), m_Specific(B))))
2303 return BinaryOperator::CreateXor(Builder->CreateNot(A), B);
2306 std::swap(Op0, Op1);
2308 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1)))
2309 if (ICmpInst *LHS = dyn_cast<ICmpInst>(I.getOperand(0)))
2310 if (Value *Res = FoldOrOfICmps(LHS, RHS, &I))
2311 return ReplaceInstUsesWith(I, Res);
2313 // (fcmp uno x, c) | (fcmp uno y, c) -> (fcmp uno x, y)
2314 if (FCmpInst *LHS = dyn_cast<FCmpInst>(I.getOperand(0)))
2315 if (FCmpInst *RHS = dyn_cast<FCmpInst>(I.getOperand(1)))
2316 if (Value *Res = FoldOrOfFCmps(LHS, RHS))
2317 return ReplaceInstUsesWith(I, Res);
2319 // fold (or (cast A), (cast B)) -> (cast (or A, B))
2320 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
2321 CastInst *Op1C = dyn_cast<CastInst>(Op1);
2322 if (Op1C && Op0C->getOpcode() == Op1C->getOpcode()) {// same cast kind ?
2323 Type *SrcTy = Op0C->getOperand(0)->getType();
2324 if (SrcTy == Op1C->getOperand(0)->getType() &&
2325 SrcTy->isIntOrIntVectorTy()) {
2326 Value *Op0COp = Op0C->getOperand(0), *Op1COp = Op1C->getOperand(0);
2328 if ((!isa<ICmpInst>(Op0COp) || !isa<ICmpInst>(Op1COp)) &&
2329 // Only do this if the casts both really cause code to be
2331 ShouldOptimizeCast(Op0C->getOpcode(), Op0COp, I.getType()) &&
2332 ShouldOptimizeCast(Op1C->getOpcode(), Op1COp, I.getType())) {
2333 Value *NewOp = Builder->CreateOr(Op0COp, Op1COp, I.getName());
2334 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
2337 // If this is or(cast(icmp), cast(icmp)), try to fold this even if the
2338 // cast is otherwise not optimizable. This happens for vector sexts.
2339 if (ICmpInst *RHS = dyn_cast<ICmpInst>(Op1COp))
2340 if (ICmpInst *LHS = dyn_cast<ICmpInst>(Op0COp))
2341 if (Value *Res = FoldOrOfICmps(LHS, RHS, &I))
2342 return CastInst::Create(Op0C->getOpcode(), Res, I.getType());
2344 // If this is or(cast(fcmp), cast(fcmp)), try to fold this even if the
2345 // cast is otherwise not optimizable. This happens for vector sexts.
2346 if (FCmpInst *RHS = dyn_cast<FCmpInst>(Op1COp))
2347 if (FCmpInst *LHS = dyn_cast<FCmpInst>(Op0COp))
2348 if (Value *Res = FoldOrOfFCmps(LHS, RHS))
2349 return CastInst::Create(Op0C->getOpcode(), Res, I.getType());
2354 // or(sext(A), B) -> A ? -1 : B where A is an i1
2355 // or(A, sext(B)) -> B ? -1 : A where B is an i1
2356 if (match(Op0, m_SExt(m_Value(A))) && A->getType()->isIntegerTy(1))
2357 return SelectInst::Create(A, ConstantInt::getSigned(I.getType(), -1), Op1);
2358 if (match(Op1, m_SExt(m_Value(A))) && A->getType()->isIntegerTy(1))
2359 return SelectInst::Create(A, ConstantInt::getSigned(I.getType(), -1), Op0);
2361 // Note: If we've gotten to the point of visiting the outer OR, then the
2362 // inner one couldn't be simplified. If it was a constant, then it won't
2363 // be simplified by a later pass either, so we try swapping the inner/outer
2364 // ORs in the hopes that we'll be able to simplify it this way.
2365 // (X|C) | V --> (X|V) | C
2366 if (Op0->hasOneUse() && !isa<ConstantInt>(Op1) &&
2367 match(Op0, m_Or(m_Value(A), m_ConstantInt(C1)))) {
2368 Value *Inner = Builder->CreateOr(A, Op1);
2369 Inner->takeName(Op0);
2370 return BinaryOperator::CreateOr(Inner, C1);
2373 // Change (or (bool?A:B),(bool?C:D)) --> (bool?(or A,C):(or B,D))
2374 // Since this OR statement hasn't been optimized further yet, we hope
2375 // that this transformation will allow the new ORs to be optimized.
2377 Value *X = nullptr, *Y = nullptr;
2378 if (Op0->hasOneUse() && Op1->hasOneUse() &&
2379 match(Op0, m_Select(m_Value(X), m_Value(A), m_Value(B))) &&
2380 match(Op1, m_Select(m_Value(Y), m_Value(C), m_Value(D))) && X == Y) {
2381 Value *orTrue = Builder->CreateOr(A, C);
2382 Value *orFalse = Builder->CreateOr(B, D);
2383 return SelectInst::Create(X, orTrue, orFalse);
2387 return Changed ? &I : nullptr;
2390 Instruction *InstCombiner::visitXor(BinaryOperator &I) {
2391 bool Changed = SimplifyAssociativeOrCommutative(I);
2392 Value *Op0 = I.getOperand(0), *Op1 = I.getOperand(1);
2394 if (Value *V = SimplifyVectorOp(I))
2395 return ReplaceInstUsesWith(I, V);
2397 if (Value *V = SimplifyXorInst(Op0, Op1, DL, TLI, DT, AT))
2398 return ReplaceInstUsesWith(I, V);
2400 // (A&B)^(A&C) -> A&(B^C) etc
2401 if (Value *V = SimplifyUsingDistributiveLaws(I))
2402 return ReplaceInstUsesWith(I, V);
2404 // See if we can simplify any instructions used by the instruction whose sole
2405 // purpose is to compute bits we don't care about.
2406 if (SimplifyDemandedInstructionBits(I))
2409 // Is this a ~ operation?
2410 if (Value *NotOp = dyn_castNotVal(&I)) {
2411 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(NotOp)) {
2412 if (Op0I->getOpcode() == Instruction::And ||
2413 Op0I->getOpcode() == Instruction::Or) {
2414 // ~(~X & Y) --> (X | ~Y) - De Morgan's Law
2415 // ~(~X | Y) === (X & ~Y) - De Morgan's Law
2416 if (dyn_castNotVal(Op0I->getOperand(1)))
2417 Op0I->swapOperands();
2418 if (Value *Op0NotVal = dyn_castNotVal(Op0I->getOperand(0))) {
2420 Builder->CreateNot(Op0I->getOperand(1),
2421 Op0I->getOperand(1)->getName()+".not");
2422 if (Op0I->getOpcode() == Instruction::And)
2423 return BinaryOperator::CreateOr(Op0NotVal, NotY);
2424 return BinaryOperator::CreateAnd(Op0NotVal, NotY);
2427 // ~(X & Y) --> (~X | ~Y) - De Morgan's Law
2428 // ~(X | Y) === (~X & ~Y) - De Morgan's Law
2429 if (isFreeToInvert(Op0I->getOperand(0)) &&
2430 isFreeToInvert(Op0I->getOperand(1))) {
2432 Builder->CreateNot(Op0I->getOperand(0), "notlhs");
2434 Builder->CreateNot(Op0I->getOperand(1), "notrhs");
2435 if (Op0I->getOpcode() == Instruction::And)
2436 return BinaryOperator::CreateOr(NotX, NotY);
2437 return BinaryOperator::CreateAnd(NotX, NotY);
2440 } else if (Op0I->getOpcode() == Instruction::AShr) {
2441 // ~(~X >>s Y) --> (X >>s Y)
2442 if (Value *Op0NotVal = dyn_castNotVal(Op0I->getOperand(0)))
2443 return BinaryOperator::CreateAShr(Op0NotVal, Op0I->getOperand(1));
2449 if (ConstantInt *RHS = dyn_cast<ConstantInt>(Op1)) {
2450 if (RHS->isOne() && Op0->hasOneUse())
2451 // xor (cmp A, B), true = not (cmp A, B) = !cmp A, B
2452 if (CmpInst *CI = dyn_cast<CmpInst>(Op0))
2453 return CmpInst::Create(CI->getOpcode(),
2454 CI->getInversePredicate(),
2455 CI->getOperand(0), CI->getOperand(1));
2457 // fold (xor(zext(cmp)), 1) and (xor(sext(cmp)), -1) to ext(!cmp).
2458 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
2459 if (CmpInst *CI = dyn_cast<CmpInst>(Op0C->getOperand(0))) {
2460 if (CI->hasOneUse() && Op0C->hasOneUse()) {
2461 Instruction::CastOps Opcode = Op0C->getOpcode();
2462 if ((Opcode == Instruction::ZExt || Opcode == Instruction::SExt) &&
2463 (RHS == ConstantExpr::getCast(Opcode, Builder->getTrue(),
2464 Op0C->getDestTy()))) {
2465 CI->setPredicate(CI->getInversePredicate());
2466 return CastInst::Create(Opcode, CI, Op0C->getType());
2472 if (BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0)) {
2473 // ~(c-X) == X-c-1 == X+(-c-1)
2474 if (Op0I->getOpcode() == Instruction::Sub && RHS->isAllOnesValue())
2475 if (Constant *Op0I0C = dyn_cast<Constant>(Op0I->getOperand(0))) {
2476 Constant *NegOp0I0C = ConstantExpr::getNeg(Op0I0C);
2477 Constant *ConstantRHS = ConstantExpr::getSub(NegOp0I0C,
2478 ConstantInt::get(I.getType(), 1));
2479 return BinaryOperator::CreateAdd(Op0I->getOperand(1), ConstantRHS);
2482 if (ConstantInt *Op0CI = dyn_cast<ConstantInt>(Op0I->getOperand(1))) {
2483 if (Op0I->getOpcode() == Instruction::Add) {
2484 // ~(X-c) --> (-c-1)-X
2485 if (RHS->isAllOnesValue()) {
2486 Constant *NegOp0CI = ConstantExpr::getNeg(Op0CI);
2487 return BinaryOperator::CreateSub(
2488 ConstantExpr::getSub(NegOp0CI,
2489 ConstantInt::get(I.getType(), 1)),
2490 Op0I->getOperand(0));
2491 } else if (RHS->getValue().isSignBit()) {
2492 // (X + C) ^ signbit -> (X + C + signbit)
2493 Constant *C = Builder->getInt(RHS->getValue() + Op0CI->getValue());
2494 return BinaryOperator::CreateAdd(Op0I->getOperand(0), C);
2497 } else if (Op0I->getOpcode() == Instruction::Or) {
2498 // (X|C1)^C2 -> X^(C1|C2) iff X&~C1 == 0
2499 if (MaskedValueIsZero(Op0I->getOperand(0), Op0CI->getValue(),
2501 Constant *NewRHS = ConstantExpr::getOr(Op0CI, RHS);
2502 // Anything in both C1 and C2 is known to be zero, remove it from
2504 Constant *CommonBits = ConstantExpr::getAnd(Op0CI, RHS);
2505 NewRHS = ConstantExpr::getAnd(NewRHS,
2506 ConstantExpr::getNot(CommonBits));
2508 I.setOperand(0, Op0I->getOperand(0));
2509 I.setOperand(1, NewRHS);
2512 } else if (Op0I->getOpcode() == Instruction::LShr) {
2513 // ((X^C1) >> C2) ^ C3 -> (X>>C2) ^ ((C1>>C2)^C3)
2517 if (Op0I->hasOneUse() &&
2518 (E1 = dyn_cast<BinaryOperator>(Op0I->getOperand(0))) &&
2519 E1->getOpcode() == Instruction::Xor &&
2520 (C1 = dyn_cast<ConstantInt>(E1->getOperand(1)))) {
2521 // fold (C1 >> C2) ^ C3
2522 ConstantInt *C2 = Op0CI, *C3 = RHS;
2523 APInt FoldConst = C1->getValue().lshr(C2->getValue());
2524 FoldConst ^= C3->getValue();
2525 // Prepare the two operands.
2526 Value *Opnd0 = Builder->CreateLShr(E1->getOperand(0), C2);
2527 Opnd0->takeName(Op0I);
2528 cast<Instruction>(Opnd0)->setDebugLoc(I.getDebugLoc());
2529 Value *FoldVal = ConstantInt::get(Opnd0->getType(), FoldConst);
2531 return BinaryOperator::CreateXor(Opnd0, FoldVal);
2537 // Try to fold constant and into select arguments.
2538 if (SelectInst *SI = dyn_cast<SelectInst>(Op0))
2539 if (Instruction *R = FoldOpIntoSelect(I, SI))
2541 if (isa<PHINode>(Op0))
2542 if (Instruction *NV = FoldOpIntoPhi(I))
2546 BinaryOperator *Op1I = dyn_cast<BinaryOperator>(Op1);
2549 if (match(Op1I, m_Or(m_Value(A), m_Value(B)))) {
2550 if (A == Op0) { // B^(B|A) == (A|B)^B
2551 Op1I->swapOperands();
2553 std::swap(Op0, Op1);
2554 } else if (B == Op0) { // B^(A|B) == (A|B)^B
2555 I.swapOperands(); // Simplified below.
2556 std::swap(Op0, Op1);
2558 } else if (match(Op1I, m_And(m_Value(A), m_Value(B))) &&
2560 if (A == Op0) { // A^(A&B) -> A^(B&A)
2561 Op1I->swapOperands();
2564 if (B == Op0) { // A^(B&A) -> (B&A)^A
2565 I.swapOperands(); // Simplified below.
2566 std::swap(Op0, Op1);
2571 BinaryOperator *Op0I = dyn_cast<BinaryOperator>(Op0);
2574 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) &&
2575 Op0I->hasOneUse()) {
2576 if (A == Op1) // (B|A)^B == (A|B)^B
2578 if (B == Op1) // (A|B)^B == A & ~B
2579 return BinaryOperator::CreateAnd(A, Builder->CreateNot(Op1));
2580 } else if (match(Op0I, m_And(m_Value(A), m_Value(B))) &&
2582 if (A == Op1) // (A&B)^A -> (B&A)^A
2584 if (B == Op1 && // (B&A)^A == ~B & A
2585 !isa<ConstantInt>(Op1)) { // Canonical form is (B&C)^C
2586 return BinaryOperator::CreateAnd(Builder->CreateNot(A), Op1);
2592 Value *A, *B, *C, *D;
2593 // (A & B)^(A | B) -> A ^ B
2594 if (match(Op0I, m_And(m_Value(A), m_Value(B))) &&
2595 match(Op1I, m_Or(m_Value(C), m_Value(D)))) {
2596 if ((A == C && B == D) || (A == D && B == C))
2597 return BinaryOperator::CreateXor(A, B);
2599 // (A | B)^(A & B) -> A ^ B
2600 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) &&
2601 match(Op1I, m_And(m_Value(C), m_Value(D)))) {
2602 if ((A == C && B == D) || (A == D && B == C))
2603 return BinaryOperator::CreateXor(A, B);
2605 // (A | ~B) ^ (~A | B) -> A ^ B
2606 if (match(Op0I, m_Or(m_Value(A), m_Not(m_Value(B)))) &&
2607 match(Op1I, m_Or(m_Not(m_Specific(A)), m_Specific(B)))) {
2608 return BinaryOperator::CreateXor(A, B);
2610 // (~A | B) ^ (A | ~B) -> A ^ B
2611 if (match(Op0I, m_Or(m_Not(m_Value(A)), m_Value(B))) &&
2612 match(Op1I, m_Or(m_Specific(A), m_Not(m_Specific(B))))) {
2613 return BinaryOperator::CreateXor(A, B);
2615 // (A & ~B) ^ (~A & B) -> A ^ B
2616 if (match(Op0I, m_And(m_Value(A), m_Not(m_Value(B)))) &&
2617 match(Op1I, m_And(m_Not(m_Specific(A)), m_Specific(B)))) {
2618 return BinaryOperator::CreateXor(A, B);
2620 // (~A & B) ^ (A & ~B) -> A ^ B
2621 if (match(Op0I, m_And(m_Not(m_Value(A)), m_Value(B))) &&
2622 match(Op1I, m_And(m_Specific(A), m_Not(m_Specific(B))))) {
2623 return BinaryOperator::CreateXor(A, B);
2625 // (A ^ C)^(A | B) -> ((~A) & B) ^ C
2626 if (match(Op0I, m_Xor(m_Value(D), m_Value(C))) &&
2627 match(Op1I, m_Or(m_Value(A), m_Value(B)))) {
2629 return BinaryOperator::CreateXor(
2630 Builder->CreateAnd(Builder->CreateNot(A), B), C);
2632 return BinaryOperator::CreateXor(
2633 Builder->CreateAnd(Builder->CreateNot(B), A), C);
2635 // (A | B)^(A ^ C) -> ((~A) & B) ^ C
2636 if (match(Op0I, m_Or(m_Value(A), m_Value(B))) &&
2637 match(Op1I, m_Xor(m_Value(D), m_Value(C)))) {
2639 return BinaryOperator::CreateXor(
2640 Builder->CreateAnd(Builder->CreateNot(A), B), C);
2642 return BinaryOperator::CreateXor(
2643 Builder->CreateAnd(Builder->CreateNot(B), A), C);
2645 // (A & B) ^ (A ^ B) -> (A | B)
2646 if (match(Op0I, m_And(m_Value(A), m_Value(B))) &&
2647 match(Op1I, m_Xor(m_Specific(A), m_Specific(B))))
2648 return BinaryOperator::CreateOr(A, B);
2649 // (A ^ B) ^ (A & B) -> (A | B)
2650 if (match(Op0I, m_Xor(m_Value(A), m_Value(B))) &&
2651 match(Op1I, m_And(m_Specific(A), m_Specific(B))))
2652 return BinaryOperator::CreateOr(A, B);
2655 Value *A = nullptr, *B = nullptr;
2656 // (A & ~B) ^ (~A) -> ~(A & B)
2657 if (match(Op0, m_And(m_Value(A), m_Not(m_Value(B)))) &&
2658 match(Op1, m_Not(m_Specific(A))))
2659 return BinaryOperator::CreateNot(Builder->CreateAnd(A, B));
2661 // (icmp1 A, B) ^ (icmp2 A, B) --> (icmp3 A, B)
2662 if (ICmpInst *RHS = dyn_cast<ICmpInst>(I.getOperand(1)))
2663 if (ICmpInst *LHS = dyn_cast<ICmpInst>(I.getOperand(0)))
2664 if (PredicatesFoldable(LHS->getPredicate(), RHS->getPredicate())) {
2665 if (LHS->getOperand(0) == RHS->getOperand(1) &&
2666 LHS->getOperand(1) == RHS->getOperand(0))
2667 LHS->swapOperands();
2668 if (LHS->getOperand(0) == RHS->getOperand(0) &&
2669 LHS->getOperand(1) == RHS->getOperand(1)) {
2670 Value *Op0 = LHS->getOperand(0), *Op1 = LHS->getOperand(1);
2671 unsigned Code = getICmpCode(LHS) ^ getICmpCode(RHS);
2672 bool isSigned = LHS->isSigned() || RHS->isSigned();
2673 return ReplaceInstUsesWith(I,
2674 getNewICmpValue(isSigned, Code, Op0, Op1,
2679 // fold (xor (cast A), (cast B)) -> (cast (xor A, B))
2680 if (CastInst *Op0C = dyn_cast<CastInst>(Op0)) {
2681 if (CastInst *Op1C = dyn_cast<CastInst>(Op1))
2682 if (Op0C->getOpcode() == Op1C->getOpcode()) { // same cast kind?
2683 Type *SrcTy = Op0C->getOperand(0)->getType();
2684 if (SrcTy == Op1C->getOperand(0)->getType() && SrcTy->isIntegerTy() &&
2685 // Only do this if the casts both really cause code to be generated.
2686 ShouldOptimizeCast(Op0C->getOpcode(), Op0C->getOperand(0),
2688 ShouldOptimizeCast(Op1C->getOpcode(), Op1C->getOperand(0),
2690 Value *NewOp = Builder->CreateXor(Op0C->getOperand(0),
2691 Op1C->getOperand(0), I.getName());
2692 return CastInst::Create(Op0C->getOpcode(), NewOp, I.getType());
2697 return Changed ? &I : nullptr;