Index: llvm/trunk/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp =================================================================== --- llvm/trunk/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp +++ llvm/trunk/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp @@ -1986,18 +1986,6 @@ if (Value *V = SimplifyBSwap(I)) return replaceInstUsesWith(I, V); - if (ConstantInt *RHS = dyn_cast(Op1)) { - ConstantInt *C1 = nullptr; Value *X = nullptr; - // (X ^ C1) | C2 --> (X | C2) ^ (C1&~C2) - if (match(Op0, m_Xor(m_Value(X), m_ConstantInt(C1))) && - Op0->hasOneUse()) { - Value *Or = Builder->CreateOr(X, RHS); - Or->takeName(Op0); - return BinaryOperator::CreateXor(Or, - Builder->getInt(C1->getValue() & ~RHS->getValue())); - } - } - if (isa(Op1)) if (Instruction *FoldedLogic = foldOpWithConstantIntoOperand(I)) return FoldedLogic; Index: llvm/trunk/test/Transforms/InstCombine/or-xor.ll =================================================================== --- llvm/trunk/test/Transforms/InstCombine/or-xor.ll +++ llvm/trunk/test/Transforms/InstCombine/or-xor.ll @@ -230,3 +230,73 @@ %xor = or i32 %and1, %and2 ret i32 %xor } + +define i8 @not_or(i8 %x) { +; CHECK-LABEL: @not_or( +; CHECK-NEXT: [[NOTX:%.*]] = or i8 %x, 7 +; CHECK-NEXT: [[OR:%.*]] = xor i8 [[NOTX]], -8 +; CHECK-NEXT: ret i8 [[OR]] +; + %notx = xor i8 %x, -1 + %or = or i8 %notx, 7 + ret i8 %or +} + +define i8 @not_or_xor(i8 %x) { +; CHECK-LABEL: @not_or_xor( +; CHECK-NEXT: [[NOTX:%.*]] = or i8 %x, 7 +; CHECK-NEXT: [[XOR:%.*]] = xor i8 [[NOTX]], -12 +; CHECK-NEXT: ret i8 [[XOR]] +; + %notx = xor i8 %x, -1 + %or = or i8 %notx, 7 + %xor = xor i8 %or, 12 + ret i8 %xor +} + +define i8 @xor_or(i8 %x) { +; CHECK-LABEL: @xor_or( +; CHECK-NEXT: [[XOR:%.*]] = or i8 %x, 7 +; CHECK-NEXT: [[OR:%.*]] = xor i8 [[XOR]], 32 +; CHECK-NEXT: ret i8 [[OR]] +; + %xor = xor i8 %x, 32 + %or = or i8 %xor, 7 + ret i8 %or +} + +define i8 @xor_or2(i8 %x) { +; CHECK-LABEL: @xor_or2( +; CHECK-NEXT: [[XOR:%.*]] = or i8 %x, 7 +; CHECK-NEXT: [[OR:%.*]] = xor i8 [[XOR]], 32 +; CHECK-NEXT: ret i8 [[OR]] +; + %xor = xor i8 %x, 33 + %or = or i8 %xor, 7 + ret i8 %or +} + +define i8 @xor_or_xor(i8 %x) { +; CHECK-LABEL: @xor_or_xor( +; CHECK-NEXT: [[XOR1:%.*]] = or i8 %x, 7 +; CHECK-NEXT: [[XOR2:%.*]] = xor i8 [[XOR1]], 44 +; CHECK-NEXT: ret i8 [[XOR2]] +; + %xor1 = xor i8 %x, 33 + %or = or i8 %xor1, 7 + %xor2 = xor i8 %or, 12 + ret i8 %xor2 +} + +define i8 @or_xor_or(i8 %x) { +; CHECK-LABEL: @or_xor_or( +; CHECK-NEXT: [[XOR:%.*]] = or i8 %x, 39 +; CHECK-NEXT: [[OR2:%.*]] = xor i8 [[XOR]], 8 +; CHECK-NEXT: ret i8 [[OR2]] +; + %or1 = or i8 %x, 33 + %xor = xor i8 %or1, 12 + %or2 = or i8 %xor, 7 + ret i8 %or2 +} +