mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-20 19:42:54 +02:00
6ca80a4d95
llvm-svn: 292320
72 lines
2.7 KiB
C++
72 lines
2.7 KiB
C++
//===---- MemCpyOptimizer.h - memcpy optimization ---------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This pass performs various transformations related to eliminating memcpy
|
|
// calls, or transforming sets of stores into memset's.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_TRANSFORMS_SCALAR_MEMCPYOPTIMIZER_H
|
|
#define LLVM_TRANSFORMS_SCALAR_MEMCPYOPTIMIZER_H
|
|
|
|
#include "llvm/Analysis/AliasAnalysis.h"
|
|
#include "llvm/Analysis/AssumptionCache.h"
|
|
#include "llvm/Analysis/MemoryDependenceAnalysis.h"
|
|
#include "llvm/Analysis/TargetLibraryInfo.h"
|
|
#include "llvm/IR/BasicBlock.h"
|
|
#include "llvm/IR/Dominators.h"
|
|
#include "llvm/IR/Function.h"
|
|
#include "llvm/IR/Instructions.h"
|
|
#include "llvm/IR/IntrinsicInst.h"
|
|
#include "llvm/IR/PassManager.h"
|
|
#include <cstdint>
|
|
#include <functional>
|
|
|
|
namespace llvm {
|
|
|
|
class MemCpyOptPass : public PassInfoMixin<MemCpyOptPass> {
|
|
MemoryDependenceResults *MD = nullptr;
|
|
TargetLibraryInfo *TLI = nullptr;
|
|
std::function<AliasAnalysis &()> LookupAliasAnalysis;
|
|
std::function<AssumptionCache &()> LookupAssumptionCache;
|
|
std::function<DominatorTree &()> LookupDomTree;
|
|
|
|
public:
|
|
MemCpyOptPass() = default;
|
|
|
|
PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM);
|
|
// Glue for the old PM.
|
|
bool runImpl(Function &F, MemoryDependenceResults *MD_,
|
|
TargetLibraryInfo *TLI_,
|
|
std::function<AliasAnalysis &()> LookupAliasAnalysis_,
|
|
std::function<AssumptionCache &()> LookupAssumptionCache_,
|
|
std::function<DominatorTree &()> LookupDomTree_);
|
|
|
|
private:
|
|
// Helper functions
|
|
bool processStore(StoreInst *SI, BasicBlock::iterator &BBI);
|
|
bool processMemSet(MemSetInst *SI, BasicBlock::iterator &BBI);
|
|
bool processMemCpy(MemCpyInst *M);
|
|
bool processMemMove(MemMoveInst *M);
|
|
bool performCallSlotOptzn(Instruction *cpy, Value *cpyDst, Value *cpySrc,
|
|
uint64_t cpyLen, unsigned cpyAlign, CallInst *C);
|
|
bool processMemCpyMemCpyDependence(MemCpyInst *M, MemCpyInst *MDep);
|
|
bool processMemSetMemCpyDependence(MemCpyInst *M, MemSetInst *MDep);
|
|
bool performMemCpyToMemSetOptzn(MemCpyInst *M, MemSetInst *MDep);
|
|
bool processByValArgument(CallSite CS, unsigned ArgNo);
|
|
Instruction *tryMergingIntoMemset(Instruction *I, Value *StartPtr,
|
|
Value *ByteVal);
|
|
|
|
bool iterateOnFunction(Function &F);
|
|
};
|
|
|
|
} // end namespace llvm
|
|
|
|
#endif // LLVM_TRANSFORMS_SCALAR_MEMCPYOPTIMIZER_H
|