mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-19 02:52:53 +02:00
db20f1e2c5
Instead, represent the mask as out-of-line data in the instruction. This should be more efficient in the places that currently use getShuffleVector(), and paves the way for further changes to add new shuffles for scalable vectors. This doesn't change the syntax in textual IR. And I don't currently plan to change the bitcode encoding in this patch, although we'll probably need to do something once we extend shufflevector for scalable types. I expect that once this is finished, we can then replace the raw "mask" with something more appropriate for scalable vectors. Not sure exactly what this looks like at the moment, but there are a few different ways we could handle it. Maybe we could try to describe specific shuffles. Or maybe we could define it in terms of a function to convert a fixed-length array into an appropriate scalable vector, using a "step", or something like that. Differential Revision: https://reviews.llvm.org/D72467
280 lines
11 KiB
C++
280 lines
11 KiB
C++
//====- TargetFolder.h - Constant folding helper ---------------*- C++ -*-====//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file defines the TargetFolder class, a helper for IRBuilder.
|
|
// It provides IRBuilder with a set of methods for creating constants with
|
|
// target dependent folding, in addition to the same target-independent
|
|
// folding that the ConstantFolder class provides. For general constant
|
|
// creation and folding, use ConstantExpr and the routines in
|
|
// llvm/Analysis/ConstantFolding.h.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_ANALYSIS_TARGETFOLDER_H
|
|
#define LLVM_ANALYSIS_TARGETFOLDER_H
|
|
|
|
#include "llvm/ADT/ArrayRef.h"
|
|
#include "llvm/Analysis/ConstantFolding.h"
|
|
#include "llvm/IR/Constants.h"
|
|
#include "llvm/IR/InstrTypes.h"
|
|
#include "llvm/IR/IRBuilderFolder.h"
|
|
|
|
namespace llvm {
|
|
|
|
class DataLayout;
|
|
|
|
/// TargetFolder - Create constants with target dependent folding.
|
|
class TargetFolder final : public IRBuilderFolder {
|
|
const DataLayout &DL;
|
|
|
|
/// Fold - Fold the constant using target specific information.
|
|
Constant *Fold(Constant *C) const {
|
|
return ConstantFoldConstant(C, DL);
|
|
}
|
|
|
|
virtual void anchor();
|
|
|
|
public:
|
|
explicit TargetFolder(const DataLayout &DL) : DL(DL) {}
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
// Binary Operators
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
Constant *CreateAdd(Constant *LHS, Constant *RHS,
|
|
bool HasNUW = false, bool HasNSW = false) const override {
|
|
return Fold(ConstantExpr::getAdd(LHS, RHS, HasNUW, HasNSW));
|
|
}
|
|
Constant *CreateFAdd(Constant *LHS, Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getFAdd(LHS, RHS));
|
|
}
|
|
Constant *CreateSub(Constant *LHS, Constant *RHS,
|
|
bool HasNUW = false, bool HasNSW = false) const override {
|
|
return Fold(ConstantExpr::getSub(LHS, RHS, HasNUW, HasNSW));
|
|
}
|
|
Constant *CreateFSub(Constant *LHS, Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getFSub(LHS, RHS));
|
|
}
|
|
Constant *CreateMul(Constant *LHS, Constant *RHS,
|
|
bool HasNUW = false, bool HasNSW = false) const override {
|
|
return Fold(ConstantExpr::getMul(LHS, RHS, HasNUW, HasNSW));
|
|
}
|
|
Constant *CreateFMul(Constant *LHS, Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getFMul(LHS, RHS));
|
|
}
|
|
Constant *CreateUDiv(Constant *LHS, Constant *RHS,
|
|
bool isExact = false) const override {
|
|
return Fold(ConstantExpr::getUDiv(LHS, RHS, isExact));
|
|
}
|
|
Constant *CreateSDiv(Constant *LHS, Constant *RHS,
|
|
bool isExact = false) const override {
|
|
return Fold(ConstantExpr::getSDiv(LHS, RHS, isExact));
|
|
}
|
|
Constant *CreateFDiv(Constant *LHS, Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getFDiv(LHS, RHS));
|
|
}
|
|
Constant *CreateURem(Constant *LHS, Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getURem(LHS, RHS));
|
|
}
|
|
Constant *CreateSRem(Constant *LHS, Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getSRem(LHS, RHS));
|
|
}
|
|
Constant *CreateFRem(Constant *LHS, Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getFRem(LHS, RHS));
|
|
}
|
|
Constant *CreateShl(Constant *LHS, Constant *RHS,
|
|
bool HasNUW = false, bool HasNSW = false) const override {
|
|
return Fold(ConstantExpr::getShl(LHS, RHS, HasNUW, HasNSW));
|
|
}
|
|
Constant *CreateLShr(Constant *LHS, Constant *RHS,
|
|
bool isExact = false) const override {
|
|
return Fold(ConstantExpr::getLShr(LHS, RHS, isExact));
|
|
}
|
|
Constant *CreateAShr(Constant *LHS, Constant *RHS,
|
|
bool isExact = false) const override {
|
|
return Fold(ConstantExpr::getAShr(LHS, RHS, isExact));
|
|
}
|
|
Constant *CreateAnd(Constant *LHS, Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getAnd(LHS, RHS));
|
|
}
|
|
Constant *CreateOr(Constant *LHS, Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getOr(LHS, RHS));
|
|
}
|
|
Constant *CreateXor(Constant *LHS, Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getXor(LHS, RHS));
|
|
}
|
|
|
|
Constant *CreateBinOp(Instruction::BinaryOps Opc,
|
|
Constant *LHS, Constant *RHS) const override {
|
|
return Fold(ConstantExpr::get(Opc, LHS, RHS));
|
|
}
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
// Unary Operators
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
Constant *CreateNeg(Constant *C,
|
|
bool HasNUW = false, bool HasNSW = false) const override {
|
|
return Fold(ConstantExpr::getNeg(C, HasNUW, HasNSW));
|
|
}
|
|
Constant *CreateFNeg(Constant *C) const override {
|
|
return Fold(ConstantExpr::getFNeg(C));
|
|
}
|
|
Constant *CreateNot(Constant *C) const override {
|
|
return Fold(ConstantExpr::getNot(C));
|
|
}
|
|
|
|
Constant *CreateUnOp(Instruction::UnaryOps Opc, Constant *C) const override {
|
|
return Fold(ConstantExpr::get(Opc, C));
|
|
}
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
// Memory Instructions
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
Constant *CreateGetElementPtr(Type *Ty, Constant *C,
|
|
ArrayRef<Constant *> IdxList) const override {
|
|
return Fold(ConstantExpr::getGetElementPtr(Ty, C, IdxList));
|
|
}
|
|
Constant *CreateGetElementPtr(Type *Ty, Constant *C,
|
|
Constant *Idx) const override {
|
|
// This form of the function only exists to avoid ambiguous overload
|
|
// warnings about whether to convert Idx to ArrayRef<Constant *> or
|
|
// ArrayRef<Value *>.
|
|
return Fold(ConstantExpr::getGetElementPtr(Ty, C, Idx));
|
|
}
|
|
Constant *CreateGetElementPtr(Type *Ty, Constant *C,
|
|
ArrayRef<Value *> IdxList) const override {
|
|
return Fold(ConstantExpr::getGetElementPtr(Ty, C, IdxList));
|
|
}
|
|
|
|
Constant *CreateInBoundsGetElementPtr(
|
|
Type *Ty, Constant *C, ArrayRef<Constant *> IdxList) const override {
|
|
return Fold(ConstantExpr::getInBoundsGetElementPtr(Ty, C, IdxList));
|
|
}
|
|
Constant *CreateInBoundsGetElementPtr(Type *Ty, Constant *C,
|
|
Constant *Idx) const override {
|
|
// This form of the function only exists to avoid ambiguous overload
|
|
// warnings about whether to convert Idx to ArrayRef<Constant *> or
|
|
// ArrayRef<Value *>.
|
|
return Fold(ConstantExpr::getInBoundsGetElementPtr(Ty, C, Idx));
|
|
}
|
|
Constant *CreateInBoundsGetElementPtr(
|
|
Type *Ty, Constant *C, ArrayRef<Value *> IdxList) const override {
|
|
return Fold(ConstantExpr::getInBoundsGetElementPtr(Ty, C, IdxList));
|
|
}
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
// Cast/Conversion Operators
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
Constant *CreateCast(Instruction::CastOps Op, Constant *C,
|
|
Type *DestTy) const override {
|
|
if (C->getType() == DestTy)
|
|
return C; // avoid calling Fold
|
|
return Fold(ConstantExpr::getCast(Op, C, DestTy));
|
|
}
|
|
Constant *CreateIntCast(Constant *C, Type *DestTy,
|
|
bool isSigned) const override {
|
|
if (C->getType() == DestTy)
|
|
return C; // avoid calling Fold
|
|
return Fold(ConstantExpr::getIntegerCast(C, DestTy, isSigned));
|
|
}
|
|
Constant *CreatePointerCast(Constant *C, Type *DestTy) const override {
|
|
if (C->getType() == DestTy)
|
|
return C; // avoid calling Fold
|
|
return Fold(ConstantExpr::getPointerCast(C, DestTy));
|
|
}
|
|
Constant *CreateFPCast(Constant *C, Type *DestTy) const override {
|
|
if (C->getType() == DestTy)
|
|
return C; // avoid calling Fold
|
|
return Fold(ConstantExpr::getFPCast(C, DestTy));
|
|
}
|
|
Constant *CreateBitCast(Constant *C, Type *DestTy) const override {
|
|
return CreateCast(Instruction::BitCast, C, DestTy);
|
|
}
|
|
Constant *CreateIntToPtr(Constant *C, Type *DestTy) const override {
|
|
return CreateCast(Instruction::IntToPtr, C, DestTy);
|
|
}
|
|
Constant *CreatePtrToInt(Constant *C, Type *DestTy) const override {
|
|
return CreateCast(Instruction::PtrToInt, C, DestTy);
|
|
}
|
|
Constant *CreateZExtOrBitCast(Constant *C, Type *DestTy) const override {
|
|
if (C->getType() == DestTy)
|
|
return C; // avoid calling Fold
|
|
return Fold(ConstantExpr::getZExtOrBitCast(C, DestTy));
|
|
}
|
|
Constant *CreateSExtOrBitCast(Constant *C, Type *DestTy) const override {
|
|
if (C->getType() == DestTy)
|
|
return C; // avoid calling Fold
|
|
return Fold(ConstantExpr::getSExtOrBitCast(C, DestTy));
|
|
}
|
|
Constant *CreateTruncOrBitCast(Constant *C, Type *DestTy) const override {
|
|
if (C->getType() == DestTy)
|
|
return C; // avoid calling Fold
|
|
return Fold(ConstantExpr::getTruncOrBitCast(C, DestTy));
|
|
}
|
|
|
|
Constant *CreatePointerBitCastOrAddrSpaceCast(Constant *C,
|
|
Type *DestTy) const override {
|
|
if (C->getType() == DestTy)
|
|
return C; // avoid calling Fold
|
|
return Fold(ConstantExpr::getPointerBitCastOrAddrSpaceCast(C, DestTy));
|
|
}
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
// Compare Instructions
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
Constant *CreateICmp(CmpInst::Predicate P, Constant *LHS,
|
|
Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getCompare(P, LHS, RHS));
|
|
}
|
|
Constant *CreateFCmp(CmpInst::Predicate P, Constant *LHS,
|
|
Constant *RHS) const override {
|
|
return Fold(ConstantExpr::getCompare(P, LHS, RHS));
|
|
}
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
// Other Instructions
|
|
//===--------------------------------------------------------------------===//
|
|
|
|
Constant *CreateSelect(Constant *C, Constant *True,
|
|
Constant *False) const override {
|
|
return Fold(ConstantExpr::getSelect(C, True, False));
|
|
}
|
|
|
|
Constant *CreateExtractElement(Constant *Vec, Constant *Idx) const override {
|
|
return Fold(ConstantExpr::getExtractElement(Vec, Idx));
|
|
}
|
|
|
|
Constant *CreateInsertElement(Constant *Vec, Constant *NewElt,
|
|
Constant *Idx) const override {
|
|
return Fold(ConstantExpr::getInsertElement(Vec, NewElt, Idx));
|
|
}
|
|
|
|
Constant *CreateShuffleVector(Constant *V1, Constant *V2,
|
|
ArrayRef<int> Mask) const override {
|
|
return Fold(ConstantExpr::getShuffleVector(V1, V2, Mask));
|
|
}
|
|
|
|
Constant *CreateExtractValue(Constant *Agg,
|
|
ArrayRef<unsigned> IdxList) const override {
|
|
return Fold(ConstantExpr::getExtractValue(Agg, IdxList));
|
|
}
|
|
|
|
Constant *CreateInsertValue(Constant *Agg, Constant *Val,
|
|
ArrayRef<unsigned> IdxList) const override {
|
|
return Fold(ConstantExpr::getInsertValue(Agg, Val, IdxList));
|
|
}
|
|
};
|
|
|
|
}
|
|
|
|
#endif
|