[PATCH] D114882: [PatternMatch] create and use matcher for 'not' that excludes undef elements
Sanjay Patel via Phabricator via llvm-commits
llvm-commits at lists.llvm.org
Wed Dec 1 08:31:22 PST 2021
spatel created this revision.
spatel added reviewers: lebedev.ri, rampitec, foad.
Herald added subscribers: dexonsmith, hiraditya, mcrosier.
spatel requested review of this revision.
Herald added a project: LLVM.
Herald added a subscriber: llvm-commits.
We needed a stricter version of m_Not for D114462 <https://reviews.llvm.org/D114462>, but I wasn't sure if that was going to be required anywhere else, so I didn't bother to make that reusable.
It turns out we have one more existing simplification that needs this (currently miscompiles):
https://alive2.llvm.org/ce/z/9-nTKi
And there's at least one more fold in that family that we could add.
I copied from existing code to implement this, but I'm definitely open to suggestions if there's a better way. I don't know C++ template magic well at all.
https://reviews.llvm.org/D114882
Files:
llvm/include/llvm/IR/PatternMatch.h
llvm/lib/Analysis/InstructionSimplify.cpp
llvm/unittests/IR/PatternMatch.cpp
Index: llvm/unittests/IR/PatternMatch.cpp
===================================================================
--- llvm/unittests/IR/PatternMatch.cpp
+++ llvm/unittests/IR/PatternMatch.cpp
@@ -1727,6 +1727,41 @@
EXPECT_FALSE(match(PtrToInt2, m_VScale(DL)));
}
+TEST_F(PatternMatchTest, NotForbidUndef) {
+ Type *ScalarTy = IRB.getInt8Ty();
+ Type *VectorTy = FixedVectorType::get(ScalarTy, 3);
+ Constant *ScalarUndef = UndefValue::get(ScalarTy);
+ Constant *ScalarOnes = Constant::getAllOnesValue(ScalarTy);
+ Constant *VectorZero = Constant::getNullValue(VectorTy);
+ Constant *VectorOnes = Constant::getAllOnesValue(VectorTy);
+
+ SmallVector<Constant *, 3> MixedElems;
+ MixedElems.push_back(ScalarOnes);
+ MixedElems.push_back(ScalarOnes);
+ MixedElems.push_back(ScalarUndef);
+ Constant *VectorMixed = ConstantVector::get(MixedElems);
+
+ Value *Not = IRB.CreateXor(VectorZero, VectorOnes);
+ Value *X;
+ EXPECT_TRUE(match(Not, m_Not(m_Value())));
+ EXPECT_TRUE(match(Not, m_NotForbidUndef(m_Value(X))));
+ EXPECT_TRUE(match(X, m_Zero()));
+
+ Value *NotCommute = IRB.CreateXor(VectorOnes, VectorZero);
+ Value *Y;
+ EXPECT_TRUE(match(NotCommute, m_Not(m_Value())));
+ EXPECT_TRUE(match(NotCommute, m_NotForbidUndef(m_Value(Y))));
+ EXPECT_TRUE(match(Y, m_Zero()));
+
+ Value *NotWithUndefs = IRB.CreateXor(VectorZero, VectorMixed);
+ EXPECT_TRUE(match(NotWithUndefs, m_Not(m_Value())));
+ EXPECT_FALSE(match(NotWithUndefs, m_NotForbidUndef(m_Value())));
+
+ Value *NotWithUndefsCommute = IRB.CreateXor(VectorMixed, VectorZero);
+ EXPECT_TRUE(match(NotWithUndefsCommute, m_Not(m_Value())));
+ EXPECT_FALSE(match(NotWithUndefsCommute, m_NotForbidUndef(m_Value(X))));
+}
+
template <typename T> struct MutableConstTest : PatternMatchTest { };
typedef ::testing::Types<std::tuple<Value*, Instruction*>,
Index: llvm/lib/Analysis/InstructionSimplify.cpp
===================================================================
--- llvm/lib/Analysis/InstructionSimplify.cpp
+++ llvm/lib/Analysis/InstructionSimplify.cpp
@@ -2408,11 +2408,10 @@
// The 'not' op must contain a complete -1 operand (no undef elements for
// vector) for the transform to be safe.
Value *NotA;
- const APInt *C;
- if (match(X, m_c_Or(m_CombineAnd(m_Xor(m_Value(A), m_APIntForbidUndef(C)),
- m_Value(NotA)),
- m_Value(B))) &&
- match(Y, m_c_And(m_Specific(A), m_Specific(B))) && C->isAllOnes())
+ if (match(X,
+ m_c_Or(m_CombineAnd(m_NotForbidUndef(m_Value(A)), m_Value(NotA)),
+ m_Value(B))) &&
+ match(Y, m_c_And(m_Specific(A), m_Specific(B))))
return NotA;
return nullptr;
Index: llvm/include/llvm/IR/PatternMatch.h
===================================================================
--- llvm/include/llvm/IR/PatternMatch.h
+++ llvm/include/llvm/IR/PatternMatch.h
@@ -2285,6 +2285,26 @@
return m_c_Xor(V, m_AllOnes());
}
+template <typename ValTy> struct NotForbidUndef_match {
+ ValTy Val;
+ NotForbidUndef_match(const ValTy &V) : Val(V) {}
+
+ template <typename OpTy> bool match(OpTy *V) {
+ Value *X;
+ const APInt *C;
+ if (m_Xor(m_Value(X), m_APIntForbidUndef(C)).match(V) && C->isAllOnes())
+ return Val.match(X);
+ if (m_Xor(m_APIntForbidUndef(C), m_Value(X)).match(V) && C->isAllOnes())
+ return Val.match(X);
+ return false;
+ }
+};
+
+template <typename ValTy>
+inline NotForbidUndef_match<ValTy> m_NotForbidUndef(const ValTy &V) {
+ return NotForbidUndef_match<ValTy>(V);
+}
+
/// Matches an SMin with LHS and RHS in either order.
template <typename LHS, typename RHS>
inline MaxMin_match<ICmpInst, LHS, RHS, smin_pred_ty, true>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: D114882.391038.patch
Type: text/x-patch
Size: 3735 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20211201/ecb0dc66/attachment.bin>
More information about the llvm-commits
mailing list