diff options
| author | Nikita Popov <nikita.ppv@gmail.com> | 2020-02-17 21:56:28 +0100 |
|---|---|---|
| committer | Nikita Popov <nikita.ppv@gmail.com> | 2020-02-18 17:58:46 +0100 |
| commit | 28ffe38bbafebf049e4c1f5a5a6b4ce6b00357af (patch) | |
| tree | a3e6052b160b7c1cb46f4df19394c1bfd9064c7d /llvm/lib/Transforms/Utils/LoopUtils.cpp | |
| parent | ed6d30b517b618fb0d0b9b61c4586b7ab7dc74ec (diff) | |
| download | llvm-28ffe38bbafebf049e4c1f5a5a6b4ce6b00357af.zip llvm-28ffe38bbafebf049e4c1f5a5a6b4ce6b00357af.tar.gz llvm-28ffe38bbafebf049e4c1f5a5a6b4ce6b00357af.tar.bz2 | |
[LoopUtils] Accept IRBuilderBase; NFC
Diffstat (limited to 'llvm/lib/Transforms/Utils/LoopUtils.cpp')
| -rw-r--r-- | llvm/lib/Transforms/Utils/LoopUtils.cpp | 14 |
1 files changed, 7 insertions, 7 deletions
diff --git a/llvm/lib/Transforms/Utils/LoopUtils.cpp b/llvm/lib/Transforms/Utils/LoopUtils.cpp index d7789e4..938852d 100644 --- a/llvm/lib/Transforms/Utils/LoopUtils.cpp +++ b/llvm/lib/Transforms/Utils/LoopUtils.cpp @@ -824,7 +824,7 @@ bool llvm::hasIterationCountInvariantInParent(Loop *InnerLoop, return true; } -Value *llvm::createMinMaxOp(IRBuilder<> &Builder, +Value *llvm::createMinMaxOp(IRBuilderBase &Builder, RecurrenceDescriptor::MinMaxRecurrenceKind RK, Value *Left, Value *Right) { CmpInst::Predicate P = CmpInst::ICMP_NE; @@ -853,7 +853,7 @@ Value *llvm::createMinMaxOp(IRBuilder<> &Builder, // We only match FP sequences that are 'fast', so we can unconditionally // set it on any generated instructions. - IRBuilder<>::FastMathFlagGuard FMFG(Builder); + IRBuilderBase::FastMathFlagGuard FMFG(Builder); FastMathFlags FMF; FMF.setFast(); Builder.setFastMathFlags(FMF); @@ -871,7 +871,7 @@ Value *llvm::createMinMaxOp(IRBuilder<> &Builder, // Helper to generate an ordered reduction. Value * -llvm::getOrderedReduction(IRBuilder<> &Builder, Value *Acc, Value *Src, +llvm::getOrderedReduction(IRBuilderBase &Builder, Value *Acc, Value *Src, unsigned Op, RecurrenceDescriptor::MinMaxRecurrenceKind MinMaxKind, ArrayRef<Value *> RedOps) { @@ -902,7 +902,7 @@ llvm::getOrderedReduction(IRBuilder<> &Builder, Value *Acc, Value *Src, // Helper to generate a log2 shuffle reduction. Value * -llvm::getShuffleReduction(IRBuilder<> &Builder, Value *Src, unsigned Op, +llvm::getShuffleReduction(IRBuilderBase &Builder, Value *Src, unsigned Op, RecurrenceDescriptor::MinMaxRecurrenceKind MinMaxKind, ArrayRef<Value *> RedOps) { unsigned VF = Src->getType()->getVectorNumElements(); @@ -950,7 +950,7 @@ llvm::getShuffleReduction(IRBuilder<> &Builder, Value *Src, unsigned Op, /// Create a simple vector reduction specified by an opcode and some /// flags (if generating min/max reductions). Value *llvm::createSimpleTargetReduction( - IRBuilder<> &Builder, const TargetTransformInfo *TTI, unsigned Opcode, + IRBuilderBase &Builder, const TargetTransformInfo *TTI, unsigned Opcode, Value *Src, TargetTransformInfo::ReductionFlags Flags, ArrayRef<Value *> RedOps) { assert(isa<VectorType>(Src->getType()) && "Type must be a vector"); @@ -1021,7 +1021,7 @@ Value *llvm::createSimpleTargetReduction( } /// Create a vector reduction using a given recurrence descriptor. -Value *llvm::createTargetReduction(IRBuilder<> &B, +Value *llvm::createTargetReduction(IRBuilderBase &B, const TargetTransformInfo *TTI, RecurrenceDescriptor &Desc, Value *Src, bool NoNaN) { @@ -1033,7 +1033,7 @@ Value *llvm::createTargetReduction(IRBuilder<> &B, // All ops in the reduction inherit fast-math-flags from the recurrence // descriptor. - IRBuilder<>::FastMathFlagGuard FMFGuard(B); + IRBuilderBase::FastMathFlagGuard FMFGuard(B); B.setFastMathFlags(Desc.getFastMathFlags()); switch (RecKind) { |