Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
154 changes: 154 additions & 0 deletions llvm/lib/Transforms/InstCombine/InstCombineAndOrXor.cpp
Original file line number Diff line number Diff line change
Expand Up @@ -11,10 +11,13 @@
//===----------------------------------------------------------------------===//

#include "InstCombineInternal.h"
#include "llvm/ADT/SmallBitVector.h"
#include "llvm/Analysis/CmpInstAnalysis.h"
#include "llvm/Analysis/FloatingPointPredicateUtils.h"
#include "llvm/Analysis/InstructionSimplify.h"
#include "llvm/IR/ConstantRange.h"
#include "llvm/IR/DerivedTypes.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/Intrinsics.h"
#include "llvm/IR/PatternMatch.h"
#include "llvm/Transforms/InstCombine/InstCombiner.h"
Expand Down Expand Up @@ -3592,6 +3595,154 @@ static Value *foldOrOfInversions(BinaryOperator &I,
return nullptr;
}

/// Match \p V as "shufflevector -> bitcast" or "extractelement -> zext -> shl"
/// patterns, which extract vector elements and pack them in the same relative
/// positions.
///
/// \p Vec is the underlying vector being extracted from.
/// \p Mask is a bitmask identifying which packed elements are obtained from the
/// vector.
/// \p VecOffset is the vector element corresponding to index 0 of the
/// mask.
static bool matchSubIntegerPackFromVector(Value *V, Value *&Vec,
int64_t &VecOffset,
SmallBitVector &Mask,
const DataLayout &DL) {
static const auto m_ConstShlOrSelf = [](const auto &Base, uint64_t &ShlAmt) {
ShlAmt = 0;
return m_CombineOr(m_Shl(Base, m_ConstantInt(ShlAmt)), Base);
Copy link
Member

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

We may need a helper like m_ShlLike/m_LShrLike to match a constant shift or the value itself. This pattern is also used in AggressiveInstCombine.

if (!match(StoredVal, m_CombineOr(m_Trunc(m_LShr(m_Value(Val),
m_ConstantInt(ValOffset))),
m_Trunc(m_Value(Val)))))
return std::nullopt;

if (match(V, m_OneUse(m_c_Or(
m_Value(X),
m_OneUse(m_Shl(m_OneUse(m_ZExt(m_OneUse(m_Instruction(L2)))),
m_APInt(ShAmt2)))))) ||
match(V, m_OneUse(m_Or(m_Value(X),
m_OneUse(m_ZExt(m_OneUse(m_Instruction(L2)))))))) {

(match(X, m_OneUse(m_ZExt(m_Instruction(L1)))) ||
match(X, m_OneUse(m_Shl(m_OneUse(m_ZExt(m_OneUse(m_Instruction(L1)))),
m_APInt(ShAmt1)))))) {

cc @nikic

};

// First try to match extractelement -> zext -> shl
uint64_t VecIdx, ShlAmt;
if (match(V, m_ConstShlOrSelf(m_ZExtOrSelf(m_ExtractElt(
m_Value(Vec), m_ConstantInt(VecIdx))),
ShlAmt))) {
auto *VecTy = dyn_cast<FixedVectorType>(Vec->getType());
if (!VecTy)
return false;
auto *EltTy = dyn_cast<IntegerType>(VecTy->getElementType());
if (!EltTy)
return false;

const unsigned EltBitWidth = EltTy->getBitWidth();
const unsigned TargetBitWidth = V->getType()->getIntegerBitWidth();
if (TargetBitWidth % EltBitWidth != 0 || ShlAmt % EltBitWidth != 0)
return false;
const unsigned TargetEltWidth = TargetBitWidth / EltBitWidth;
const unsigned ShlEltAmt = ShlAmt / EltBitWidth;

const unsigned MaskIdx =
DL.isLittleEndian() ? ShlEltAmt : TargetEltWidth - ShlEltAmt - 1;

VecOffset = static_cast<int64_t>(VecIdx) - static_cast<int64_t>(MaskIdx);
Mask.resize(TargetEltWidth);
Mask.set(MaskIdx);
return true;
}

// Now try to match a bitcasted subvector.
Instruction *SrcVecI;
if (!match(V, m_BitCast(m_Instruction(SrcVecI))))
return false;

auto *SrcTy = dyn_cast<FixedVectorType>(SrcVecI->getType());
if (!SrcTy)
return false;

Mask.resize(SrcTy->getNumElements());

// First check for a subvector obtained from a shufflevector.
if (isa<ShuffleVectorInst>(SrcVecI)) {
Constant *ConstVec;
ArrayRef<int> ShuffleMask;
if (!match(SrcVecI, m_Shuffle(m_Value(Vec), m_Constant(ConstVec),
m_Mask(ShuffleMask))))
return false;

auto *VecTy = dyn_cast<FixedVectorType>(Vec->getType());
if (!VecTy)
return false;

const unsigned NumVecElts = VecTy->getNumElements();
bool FoundVecOffset = false;
for (unsigned Idx = 0; Idx < ShuffleMask.size(); ++Idx) {
if (ShuffleMask[Idx] == PoisonMaskElem)
return false;
const unsigned ShuffleIdx = ShuffleMask[Idx];
if (ShuffleIdx >= NumVecElts) {
const unsigned ConstIdx = ShuffleIdx - NumVecElts;
auto *ConstElt =
dyn_cast<ConstantInt>(ConstVec->getAggregateElement(ConstIdx));
if (!ConstElt || !ConstElt->isNullValue())
return false;
continue;
}

if (FoundVecOffset) {
if (VecOffset + Idx != ShuffleIdx)
return false;
} else {
if (ShuffleIdx < Idx)
return false;
VecOffset = ShuffleIdx - Idx;
FoundVecOffset = true;
}
Mask.set(Idx);
}
return FoundVecOffset;
}

// Check for a subvector obtained as an (insertelement V, 0, idx)
uint64_t InsertIdx;
if (!match(SrcVecI,
m_InsertElt(m_Value(Vec), m_Zero(), m_ConstantInt(InsertIdx))))
return false;

auto *VecTy = dyn_cast<FixedVectorType>(Vec->getType());
if (!VecTy)
return false;
VecOffset = 0;
bool AlreadyInsertedMaskedElt = Mask.test(InsertIdx);
Mask.set();
if (!AlreadyInsertedMaskedElt)
Mask.reset(InsertIdx);
return true;
}

/// Try to fold the join of two scalar integers whose contents are packed
/// elements of the same vector.
static Instruction *foldIntegerPackFromVector(Instruction &I,
InstCombiner::BuilderTy &Builder,
const DataLayout &DL) {
assert(I.getOpcode() == Instruction::Or);
Value *LhsVec, *RhsVec;
int64_t LhsVecOffset, RhsVecOffset;
SmallBitVector Mask;
if (!matchSubIntegerPackFromVector(I.getOperand(0), LhsVec, LhsVecOffset,
Mask, DL))
return nullptr;
if (!matchSubIntegerPackFromVector(I.getOperand(1), RhsVec, RhsVecOffset,
Mask, DL))
return nullptr;
if (LhsVec != RhsVec || LhsVecOffset != RhsVecOffset)
return nullptr;

// Convert into shufflevector -> bitcast;
const unsigned ZeroVecIdx =
cast<FixedVectorType>(LhsVec->getType())->getNumElements();
SmallVector<int> ShuffleMask(Mask.size(), ZeroVecIdx);
for (unsigned Idx : Mask.set_bits()) {
assert(LhsVecOffset + Idx >= 0);
ShuffleMask[Idx] = LhsVecOffset + Idx;
}

Value *MaskedVec = Builder.CreateShuffleVector(
LhsVec, Constant::getNullValue(LhsVec->getType()), ShuffleMask,
I.getName() + ".v");
return CastInst::Create(Instruction::BitCast, MaskedVec, I.getType());
}

// A decomposition of ((X & Mask) * Factor). The NUW / NSW bools
// track these properities for preservation. Note that we can decompose
// equivalent select form of this expression (e.g. (!(X & Mask) ? 0 : Mask *
Expand Down Expand Up @@ -3688,6 +3839,9 @@ Instruction *InstCombinerImpl::visitOr(BinaryOperator &I) {
if (Instruction *X = foldComplexAndOrPatterns(I, Builder))
return X;

if (Instruction *X = foldIntegerPackFromVector(I, Builder, DL))
return X;

// (A & B) | (C & D) -> A ^ D where A == ~C && B == ~D
// (A & B) | (C & D) -> A ^ C where A == ~D && B == ~C
if (Value *V = foldOrOfInversions(I, Builder))
Expand Down
Loading