Index: lib/Transforms/InstCombine/InstCombineAndOrXor.cpp
===================================================================
--- lib/Transforms/InstCombine/InstCombineAndOrXor.cpp
+++ lib/Transforms/InstCombine/InstCombineAndOrXor.cpp
@@ -2651,6 +2651,11 @@
     if (match(Op0I, m_Xor(m_Value(A), m_Value(B))) &&
         match(Op1I, m_And(m_Specific(A), m_Specific(B))))
       return BinaryOperator::CreateOr(A, B);
+    // (A | B) ^ ((A ^ C) & B) -> (A ^ (B & (~C)))
+    if (match(Op0I, m_Or(m_Value(A), m_Value(B))) &&
+        match(Op1I, m_And(m_Xor(m_Specific(A), m_Value(C)), m_Specific(B))))
+      return BinaryOperator::CreateXor(
+          A, Builder->CreateAnd(B, Builder->CreateNot(C)));
   }
 
   // (A | B)^(~A) -> (A | ~B)
Index: test/Transforms/InstCombine/xor2.ll
===================================================================
--- test/Transforms/InstCombine/xor2.ll
+++ test/Transforms/InstCombine/xor2.ll
@@ -167,3 +167,15 @@
 ; CHECK-NEXT: %1 = and i32 %a, %b
 ; CHECK-NEXT: %xor = xor i32 %1, -1
 }
+
+define i32 @test15(i32 %a, i32 %b, i32 %c) {
+ %or = or i32 %a, %b
+ %not = xor i32 %a, %c
+ %and = and i32 %not, %b
+ %xor = xor i32 %or, %and
+ ret i32 %xor
+; CHECK-LABEL: @test15(
+; CHECK-NEXT: %1 = xor i32 %c, -1
+; CHECK-NEXT: %2 = and i32 %b, %1
+; CHECK-NEXT: %xor = xor i32 %2, %a
+}