From a1e8ad4f2fa79eabd484856a47a56c5c01259051 Mon Sep 17 00:00:00 2001 From: Sanjay Patel Date: Tue, 29 Oct 2019 07:41:41 -0400 Subject: [PATCH] [IR] move helper function to replace undef constant (elements) with fixed constants This is the NFC part of D69519. We had this functionality locally in instcombine, but it can be used elsewhere, so hoisting it to Constant class. --- llvm/include/llvm/IR/Constant.h | 4 +++ llvm/lib/IR/Constants.cpp | 29 +++++++++++++++++++--- .../Transforms/InstCombine/InstCombineShifts.cpp | 22 ++-------------- 3 files changed, 31 insertions(+), 24 deletions(-) diff --git a/llvm/include/llvm/IR/Constant.h b/llvm/include/llvm/IR/Constant.h index 2b6a6e4..b91100a 100644 --- a/llvm/include/llvm/IR/Constant.h +++ b/llvm/include/llvm/IR/Constant.h @@ -188,6 +188,10 @@ public: return const_cast( static_cast(this)->stripPointerCasts()); } + + /// Try to replace undefined constant C or undefined elements in C with + /// Replacement. If no changes are made, the constant C is returned. + static Constant *replaceUndefsWith(Constant *C, Constant *Replacement); }; } // end namespace llvm diff --git a/llvm/lib/IR/Constants.cpp b/llvm/lib/IR/Constants.cpp index f792f01..ab4e478 100644 --- a/llvm/lib/IR/Constants.cpp +++ b/llvm/lib/IR/Constants.cpp @@ -31,6 +31,7 @@ #include using namespace llvm; +using namespace PatternMatch; //===----------------------------------------------------------------------===// // Constant Class @@ -259,10 +260,9 @@ bool Constant::isElementWiseEqual(Value *Y) const { auto *Cy = dyn_cast(Y); if (!Cy) return false; - return PatternMatch::match(ConstantExpr::getICmp(ICmpInst::Predicate::ICMP_EQ, - const_cast(this), - Cy), - PatternMatch::m_One()); + return match(ConstantExpr::getICmp(ICmpInst::Predicate::ICMP_EQ, + const_cast(this), Cy), + m_One()); } bool Constant::containsUndefElement() const { @@ -595,6 +595,27 @@ void Constant::removeDeadConstantUsers() const { } } +Constant *Constant::replaceUndefsWith(Constant *C, Constant *Replacement) { + Type *Ty = C->getType(); + if (C && match(C, m_Undef())) { + assert(Ty == Replacement->getType() && "Expected matching types"); + return Replacement; + } + + // Don't know how to deal with this constant. + if (!Ty->isVectorTy()) + return C; + + unsigned NumElts = Ty->getVectorNumElements(); + SmallVector NewC(NumElts); + for (unsigned i = 0; i != NumElts; ++i) { + Constant *EltC = C->getAggregateElement(i); + assert(EltC->getType() == Replacement->getType() && + "Expected matching types"); + NewC[i] = EltC && match(EltC, m_Undef()) ? Replacement : EltC; + } + return ConstantVector::get(NewC); +} //===----------------------------------------------------------------------===// diff --git a/llvm/lib/Transforms/InstCombine/InstCombineShifts.cpp b/llvm/lib/Transforms/InstCombine/InstCombineShifts.cpp index 6429483..d28601f 100644 --- a/llvm/lib/Transforms/InstCombine/InstCombineShifts.cpp +++ b/llvm/lib/Transforms/InstCombine/InstCombineShifts.cpp @@ -138,24 +138,6 @@ Value *InstCombiner::reassociateShiftAmtsOfTwoSameDirectionShifts( return Ret; } -// Try to replace `undef` constants in C with Replacement. -static Constant *replaceUndefsWith(Constant *C, Constant *Replacement) { - if (C && match(C, m_Undef())) - return Replacement; - - if (auto *CV = dyn_cast(C)) { - llvm::SmallVector NewOps(CV->getNumOperands()); - for (unsigned i = 0, NumElts = NewOps.size(); i != NumElts; ++i) { - Constant *EltC = CV->getOperand(i); - NewOps[i] = EltC && match(EltC, m_Undef()) ? Replacement : EltC; - } - return ConstantVector::get(NewOps); - } - - // Don't know how to deal with this constant. - return C; -} - // If we have some pattern that leaves only some low bits set, and then performs // left-shift of those bits, if none of the bits that are left after the final // shift are modified by the mask, we can omit the mask. @@ -216,7 +198,7 @@ dropRedundantMaskingOfLeftShiftInput(BinaryOperator *OuterShift, // completely unknown. Replace the the `undef` shift amounts with final // shift bitwidth to ensure that the value remains undef when creating the // subsequent shift op. - SumOfShAmts = replaceUndefsWith( + SumOfShAmts = Constant::replaceUndefsWith( SumOfShAmts, ConstantInt::get(SumOfShAmts->getType()->getScalarType(), ExtendedTy->getScalarSizeInBits())); auto *ExtendedSumOfShAmts = ConstantExpr::getZExt(SumOfShAmts, ExtendedTy); @@ -241,7 +223,7 @@ dropRedundantMaskingOfLeftShiftInput(BinaryOperator *OuterShift, // bitwidth of innermost shift to ensure that the value remains undef when // creating the subsequent shift op. unsigned WidestTyBitWidth = WidestTy->getScalarSizeInBits(); - ShAmtsDiff = replaceUndefsWith( + ShAmtsDiff = Constant::replaceUndefsWith( ShAmtsDiff, ConstantInt::get(ShAmtsDiff->getType()->getScalarType(), -WidestTyBitWidth)); auto *ExtendedNumHighBitsToClear = ConstantExpr::getZExt( -- 2.7.4