LLVM 24.0.0git
InstCombineVectorOps.cpp File Reference
#include "InstCombineInternal.h"
#include "llvm/ADT/APInt.h"
#include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/DenseMap.h"
#include "llvm/ADT/STLExtras.h"
#include "llvm/ADT/SmallBitVector.h"
#include "llvm/ADT/SmallVector.h"
#include "llvm/ADT/Statistic.h"
#include "llvm/Analysis/InstructionSimplify.h"
#include "llvm/Analysis/VectorUtils.h"
#include "llvm/IR/BasicBlock.h"
#include "llvm/IR/Constant.h"
#include "llvm/IR/Constants.h"
#include "llvm/IR/DerivedTypes.h"
#include "llvm/IR/InstrTypes.h"
#include "llvm/IR/Instruction.h"
#include "llvm/IR/Instructions.h"
#include "llvm/IR/Operator.h"
#include "llvm/IR/PatternMatch.h"
#include "llvm/IR/Type.h"
#include "llvm/IR/User.h"
#include "llvm/IR/Value.h"
#include "llvm/Support/Casting.h"
#include "llvm/Support/ErrorHandling.h"
#include "llvm/Transforms/InstCombine/InstCombiner.h"
#include <cassert>
#include <cstdint>
#include <iterator>
#include <utility>

Go to the source code of this file.

Classes

struct  BinopElts
 These are the ingredients in an alternate form binary operator as described below. More...

Macros

#define DEBUG_TYPE   "instcombine"

Typedefs

using ShuffleOps = std::pair<Value *, Value *>
 We are building a shuffle to create V, which is a sequence of insertelement, extractelement pairs.

Functions

 STATISTIC (NumAggregateReconstructionsSimplified, "Number of aggregate reconstructions turned into reuse of the " "original aggregate")
static bool cheapToScalarize (Value *V, Value *EI)
 Return true if the value is cheaper to scalarize than it is to leave as a vector operation.
static bool findDemandedEltsBySingleUser (Value *V, Instruction *UserInstr, APInt &UnionUsedElts)
 Find elements of V demanded by UserInstr.
static APInt findDemandedEltsByAllUsers (Value *V)
 Find union of elements of V demanded by all its users.
static ConstantInt * getPreferredVectorIndex (ConstantInt *IndexC)
 Given a constant index for a extractelement or insertelement instruction, return it with the canonical type if it isn't already canonical.
static Value * foldExtractOfStridedPointerVector (ExtractElementInst &EI, InstCombiner::BuilderTy &Builder, const DataLayout &DL)
 Fold a variable extract from a vector of pointers that all point into the same object at a constant stride.
static bool collectSingleShuffleElements (Value *V, Value *LHS, Value *RHS, SmallVectorImpl< int > &Mask)
 If V is a shuffle of values that ONLY returns elements from either LHS or RHS, return the shuffle mask and true.
static bool replaceExtractElements (InsertElementInst *InsElt, ExtractElementInst *ExtElt, InstCombinerImpl &IC)
 If we have insertion into a vector that is wider than the vector that we are extracting from, try to widen the source vector to allow a single shufflevector to replace one or more insert/extract pairs.
static ShuffleOps collectShuffleElements (Value *V, SmallVectorImpl< int > &Mask, Value *PermittedRHS, InstCombinerImpl &IC, bool &Rerun)
static bool isShuffleEquivalentToSelect (ShuffleVectorInst &Shuf)
static Instruction * foldInsSequenceIntoSplat (InsertElementInst &InsElt)
 Turn a chain of inserts that splats a value into an insert + shuffle: insertelt(insertelt(insertelt(insertelt X, k, 0), k, 1), k, 2) ... -> shufflevector(insertelt(X, k, 0), poison, zero)
static Instruction * foldInsEltIntoSplat (InsertElementInst &InsElt)
 Try to fold an insert element into an existing splat shuffle by changing the shuffle's mask to include the index of this insert element.
static Instruction * foldInsEltIntoIdentityShuffle (InsertElementInst &InsElt)
 Try to fold an extract+insert element into an existing identity shuffle by changing the shuffle's mask to include the index of this insert element.
static Instruction * hoistInsEltConst (InsertElementInst &InsElt2, InstCombiner::BuilderTy &Builder)
 If we have an insertelement instruction feeding into another insertelement and the 2nd is inserting a constant into the vector, canonicalize that constant insertion before the insertion of a variable:
static Instruction * foldConstantInsEltIntoShuffle (InsertElementInst &InsElt)
 insertelt (shufflevector X, CVec, Mask|insertelt X, C1, CIndex1), C, CIndex --> shufflevector X, CVec', Mask'
static Instruction * narrowInsElt (InsertElementInst &InsElt, InstCombiner::BuilderTy &Builder)
 If both the base vector and the inserted element are extended from the same type, do the insert element in the narrow source type followed by extend.
static Instruction * foldTruncInsEltPair (InsertElementInst &InsElt, bool IsBigEndian, InstCombiner::BuilderTy &Builder)
 If we are inserting 2 halves of a value into adjacent elements of a vector, try to convert to a single insert with appropriate bitcasts.
static bool canEvaluateShuffled (Value *V, ArrayRef< int > Mask, unsigned Depth=5)
 Return true if we can evaluate the specified expression tree if the vector elements were shuffled in a different order.
static Value * buildNew (Instruction *I, ArrayRef< Value * > NewOps, IRBuilderBase &Builder)
 Rebuild a new instruction just like 'I' but with the new operands given.
static Value * evaluateInDifferentElementOrder (Value *V, ArrayRef< int > Mask, IRBuilderBase &Builder)
static bool isShuffleExtractingFromLHS (ShuffleVectorInst &SVI, ArrayRef< int > Mask)
static BinopElts getAlternateBinop (BinaryOperator *BO, const DataLayout &DL)
 Binops may be transformed into binops with different opcodes and operands.
static Instruction * foldSelectShuffleOfSelectShuffle (ShuffleVectorInst &Shuf)
 A select shuffle of a select shuffle with a shared operand can be reduced to a single select shuffle.
static Instruction * foldSelectShuffleWith1Binop (ShuffleVectorInst &Shuf, const SimplifyQuery &SQ)
static Instruction * canonicalizeInsertSplat (ShuffleVectorInst &Shuf, InstCombiner::BuilderTy &Builder)
 If we have an insert of a scalar to a non-zero element of an undefined vector and then shuffle that value, that's the same as inserting to the zero element and shuffling.
static Instruction * foldTruncShuffle (ShuffleVectorInst &Shuf, bool IsBigEndian)
 Convert a narrowing shuffle of a bitcasted vector into a vector truncate.
static Instruction * narrowVectorSelect (ShuffleVectorInst &Shuf, InstCombiner::BuilderTy &Builder)
 Match a shuffle-select-shuffle pattern where the shuffles are widening and narrowing (concatenating with poison and extracting back to the original length).
static Instruction * foldShuffleOfUnaryOps (ShuffleVectorInst &Shuf, InstCombiner::BuilderTy &Builder)
 Canonicalize FP negate/abs after shuffle.
static Instruction * foldCastShuffle (ShuffleVectorInst &Shuf, InstCombiner::BuilderTy &Builder)
 Canonicalize casts after shuffle.
static Instruction * foldIdentityExtractShuffle (ShuffleVectorInst &Shuf)
 Try to fold an extract subvector operation.
static Instruction * foldShuffleWithInsert (ShuffleVectorInst &Shuf, InstCombinerImpl &IC)
 Try to replace a shuffle with an insertelement or try to replace a shuffle operand with the operand of an insertelement.
static Instruction * foldIdentityPaddedShuffles (ShuffleVectorInst &Shuf)

Macro Definition Documentation

◆ DEBUG_TYPE

#define DEBUG_TYPE   "instcombine"

Definition at line 44 of file InstCombineVectorOps.cpp.

Typedef Documentation

◆ ShuffleOps

using ShuffleOps = std::pair<Value *, Value *>

We are building a shuffle to create V, which is a sequence of insertelement, extractelement pairs.

If PermittedRHS is set, then we must either use it or not rely on the second vector source. Return a std::pair containing the left and right vectors of the proposed shuffle (or 0), and set the Mask parameter as required.

Note: we intentionally don't try to fold earlier shuffles since they have often been chosen carefully to be efficiently implementable on the target.

Definition at line 897 of file InstCombineVectorOps.cpp.

Function Documentation

◆ buildNew()

Value * buildNew ( Instruction * I,
ArrayRef< Value * > NewOps,
IRBuilderBase & Builder )
static

Rebuild a new instruction just like 'I' but with the new operands given.

In the event of type mismatch, the type of the operands is correct.

Definition at line 2033 of file InstCombineVectorOps.cpp.

References assert(), llvm::cast(), llvm::dyn_cast(), llvm::VectorType::get(), llvm::Instruction::hasNoSignedWrap(), llvm::Instruction::hasNoUnsignedWrap(), I, llvm::isa(), llvm::Instruction::isExact(), llvm_unreachable, llvm::ArrayRef< T >::size(), and llvm::ArrayRef< T >::slice().

Referenced by evaluateInDifferentElementOrder().

◆ canEvaluateShuffled()

bool canEvaluateShuffled ( Value * V,
ArrayRef< int > Mask,
unsigned Depth = 5 )
static

Return true if we can evaluate the specified expression tree if the vector elements were shuffled in a different order.

Definition at line 1945 of file InstCombineVectorOps.cpp.

References canEvaluateShuffled(), llvm::cast(), llvm::Depth, llvm::dyn_cast(), llvm::ConstantInt::getLimitedValue(), I, llvm::is_contained(), llvm::isa(), and llvm::Type::isVectorTy().

Referenced by canEvaluateShuffled(), and llvm::InstCombinerImpl::visitShuffleVectorInst().

◆ canonicalizeInsertSplat()

Instruction * canonicalizeInsertSplat ( ShuffleVectorInst & Shuf,
InstCombiner::BuilderTy & Builder )
static

If we have an insert of a scalar to a non-zero element of an undefined vector and then shuffle that value, that's the same as inserting to the zero element and shuffling.

Splatting from the zero element is recognized as the canonical form of splat.

Definition at line 2413 of file InstCombineVectorOps.cpp.

References llvm::cast(), llvm::PoisonValue::get(), llvm::User::getOperand(), llvm::ShuffleVectorInst::getShuffleMask(), llvm::ShuffleVectorInst::getType(), llvm::PatternMatch::m_ConstantInt(), llvm::PatternMatch::m_InsertElt(), llvm::MIPatternMatch::m_OneUse(), llvm::PatternMatch::m_Poison(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), llvm::PoisonMaskElem, uint64_t, and X.

Referenced by llvm::InstCombinerImpl::visitShuffleVectorInst().

◆ cheapToScalarize()

bool cheapToScalarize ( Value * V,
Value * EI )
static

Return true if the value is cheaper to scalarize than it is to leave as a vector operation.

If the extract index EI is a constant integer then some operations may be cheap to scalarize.

FIXME: It's possible to create more instructions than previously existed.

Definition at line 58 of file InstCombineVectorOps.cpp.

References C(), llvm::cast(), cheapToScalarize(), llvm::dyn_cast(), llvm::ConstantInt::getValue(), llvm::PatternMatch::m_BinOp(), llvm::PatternMatch::m_Cmp(), llvm::PatternMatch::m_ConstantInt(), llvm::PatternMatch::m_InsertElt(), llvm::PatternMatch::m_Intrinsic(), llvm::PatternMatch::m_Load(), llvm::MIPatternMatch::m_OneUse(), llvm::PatternMatch::m_UnOp(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), llvm::APInt::ult(), and llvm::V1.

Referenced by cheapToScalarize(), and llvm::InstCombinerImpl::visitExtractElementInst().

◆ collectShuffleElements()

◆ collectSingleShuffleElements()

bool collectSingleShuffleElements ( Value * V,
Value * LHS,
Value * RHS,
SmallVectorImpl< int > & Mask )
static

If V is a shuffle of values that ONLY returns elements from either LHS or RHS, return the shuffle mask and true.

Otherwise, return false.

Definition at line 726 of file InstCombineVectorOps.cpp.

References assert(), llvm::cast(), collectSingleShuffleElements(), llvm::dyn_cast(), llvm::User::getOperand(), llvm::isa(), LHS, llvm::PatternMatch::m_Poison(), llvm::PatternMatch::match(), and RHS.

Referenced by collectShuffleElements(), and collectSingleShuffleElements().

◆ evaluateInDifferentElementOrder()

◆ findDemandedEltsByAllUsers()

APInt findDemandedEltsByAllUsers ( Value * V)
static

Find union of elements of V demanded by all its users.

If it is known by querying findDemandedEltsBySingleUser that no user demands an element of V, then the corresponding bit remains unset in the returned value.

Definition at line 381 of file InstCombineVectorOps.cpp.

References llvm::cast(), llvm::dyn_cast(), findDemandedEltsBySingleUser(), llvm::APInt::getAllOnes(), I, llvm::APInt::isAllOnes(), and llvm::Value::uses().

Referenced by llvm::InstCombinerImpl::visitExtractElementInst().

◆ findDemandedEltsBySingleUser()

◆ foldCastShuffle()

◆ foldConstantInsEltIntoShuffle()

◆ foldExtractOfStridedPointerVector()

◆ foldIdentityExtractShuffle()

◆ foldIdentityPaddedShuffles()

◆ foldInsEltIntoIdentityShuffle()

Instruction * foldInsEltIntoIdentityShuffle ( InsertElementInst & InsElt)
static

◆ foldInsEltIntoSplat()

Instruction * foldInsEltIntoSplat ( InsertElementInst & InsElt)
static

◆ foldInsSequenceIntoSplat()

◆ foldSelectShuffleOfSelectShuffle()

Instruction * foldSelectShuffleOfSelectShuffle ( ShuffleVectorInst & Shuf)
static

A select shuffle of a select shuffle with a shared operand can be reduced to a single select shuffle.

This is an obvious improvement in IR, and the backend is expected to lower select shuffles efficiently.

Definition at line 2290 of file InstCombineVectorOps.cpp.

References assert(), llvm::ShuffleVectorInst::commuteShuffleMask(), llvm::dyn_cast(), llvm::User::getOperand(), llvm::ShuffleVectorInst::getShuffleMask(), llvm::ShuffleVectorInst::isIdentityMask(), llvm::ShuffleVectorInst::isSelect(), llvm::ShuffleVectorInst::isSelectMask(), llvm::SmallVectorTemplateCommon< T, typename >::size(), std::swap(), X, and Y.

Referenced by llvm::InstCombinerImpl::foldSelectShuffle().

◆ foldSelectShuffleWith1Binop()

◆ foldShuffleOfUnaryOps()

◆ foldShuffleWithInsert()

◆ foldTruncInsEltPair()

◆ foldTruncShuffle()

◆ getAlternateBinop()

BinopElts getAlternateBinop ( BinaryOperator * BO,
const DataLayout & DL )
static

Binops may be transformed into binops with different opcodes and operands.

Reverse the usual canonicalization to enable folds with the non-canonical form of the binop. If a transform is possible, return the elements of the new binop. If not, return invalid elements.

Definition at line 2255 of file InstCombineVectorOps.cpp.

References assert(), C(), llvm::cast(), llvm::ConstantFoldBinaryOpOperands(), DL, llvm::Constant::getAllOnesValue(), llvm::BinaryOperator::getOpcode(), llvm::User::getOperand(), llvm::Value::getType(), llvm::PatternMatch::m_ImmConstant(), llvm::MIPatternMatch::m_ZeroInt(), and llvm::PatternMatch::match().

Referenced by llvm::InstCombinerImpl::foldSelectShuffle().

◆ getPreferredVectorIndex()

ConstantInt * getPreferredVectorIndex ( ConstantInt * IndexC)
static

Given a constant index for a extractelement or insertelement instruction, return it with the canonical type if it isn't already canonical.

We arbitrarily pick 64 bit as our canonical type. The actual bitwidth doesn't matter, we just want a consistent type to simplify CSE.

Definition at line 405 of file InstCombineVectorOps.cpp.

References llvm::APInt::getActiveBits(), llvm::ConstantInt::getBitWidth(), llvm::Value::getContext(), llvm::ConstantInt::getValue(), and llvm::APInt::zextOrTrunc().

Referenced by llvm::InstCombinerImpl::visitExtractElementInst(), and llvm::InstCombinerImpl::visitInsertElementInst().

◆ hoistInsEltConst()

Instruction * hoistInsEltConst ( InsertElementInst & InsElt2,
InstCombiner::BuilderTy & Builder )
static

If we have an insertelement instruction feeding into another insertelement and the 2nd is inserting a constant into the vector, canonicalize that constant insertion before the insertion of a variable:

insertelement (insertelement X, Y, IdxC1), ScalarC, IdxC2 --> insertelement (insertelement X, ScalarC, IdxC2), Y, IdxC1

This has the potential of eliminating the 2nd insertelement instruction via constant folding of the scalar constant into a vector constant.

Definition at line 1567 of file InstCombineVectorOps.cpp.

References llvm::InsertElementInst::Create(), llvm::dyn_cast(), llvm::User::getOperand(), llvm::isa(), llvm::PatternMatch::m_Constant(), llvm::PatternMatch::m_ConstantInt(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), X, and Y.

Referenced by llvm::InstCombinerImpl::visitInsertElementInst().

◆ isShuffleEquivalentToSelect()

◆ isShuffleExtractingFromLHS()

bool isShuffleExtractingFromLHS ( ShuffleVectorInst & SVI,
ArrayRef< int > Mask )
static

◆ narrowInsElt()

Instruction * narrowInsElt ( InsertElementInst & InsElt,
InstCombiner::BuilderTy & Builder )
static

If both the base vector and the inserted element are extended from the same type, do the insert element in the narrow source type followed by extend.

TODO: This can be extended to include other cast opcodes, but particularly if we create a wider insertelement, make sure codegen is not harmed.

Definition at line 1694 of file InstCombineVectorOps.cpp.

References llvm::CastInst::Create(), llvm::User::getOperand(), llvm::InsertElementInst::getType(), llvm::Value::hasOneUse(), llvm::PatternMatch::m_FPExt(), llvm::PatternMatch::m_SExt(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::m_ZExt(), llvm::PatternMatch::match(), X, and Y.

Referenced by llvm::InstCombinerImpl::visitInsertElementInst().

◆ narrowVectorSelect()

Instruction * narrowVectorSelect ( ShuffleVectorInst & Shuf,
InstCombiner::BuilderTy & Builder )
static

Match a shuffle-select-shuffle pattern where the shuffles are widening and narrowing (concatenating with poison and extracting back to the original length).

This allows replacing the wide select with a narrow select.

Definition at line 2625 of file InstCombineVectorOps.cpp.

References llvm::cast(), Cond, llvm::SelectInst::Create(), llvm::User::getOperand(), llvm::ShuffleVectorInst::getShuffleMask(), llvm::ShuffleVectorInst::getType(), llvm::Value::getType(), llvm::ShuffleVectorInst::isIdentityWithExtract(), llvm::MIPatternMatch::m_OneUse(), llvm::PatternMatch::m_Poison(), llvm::PatternMatch::m_Select(), llvm::PatternMatch::m_Shuffle(), llvm::PatternMatch::m_Value(), llvm::PatternMatch::match(), X, and Y.

◆ replaceExtractElements()

◆ STATISTIC()

STATISTIC ( NumAggregateReconstructionsSimplified ,
"Number of aggregate reconstructions turned into reuse of the " "original aggregate"  )