2015-02-01 11:51:23 +01:00
|
|
|
//===- EarlyCSE.h - Simple and fast CSE pass --------------------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// \file
|
|
|
|
/// This file provides the interface for a simple, fast CSE pass.
|
|
|
|
///
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_TRANSFORMS_SCALAR_EARLYCSE_H
|
|
|
|
#define LLVM_TRANSFORMS_SCALAR_EARLYCSE_H
|
|
|
|
|
|
|
|
#include "llvm/IR/Function.h"
|
|
|
|
#include "llvm/IR/PassManager.h"
|
|
|
|
|
|
|
|
namespace llvm {
|
|
|
|
|
|
|
|
/// \brief A simple and fast domtree-based CSE pass.
|
|
|
|
///
|
|
|
|
/// This pass does a simple depth-first walk over the dominator tree,
|
|
|
|
/// eliminating trivially redundant instructions and using instsimplify to
|
|
|
|
/// canonicalize things as it goes. It is intended to be fast and catch obvious
|
|
|
|
/// cases so that instcombine and other passes are more effective. It is
|
|
|
|
/// expected that a later pass of GVN will catch the interesting/hard cases.
|
2016-03-11 11:33:22 +01:00
|
|
|
struct EarlyCSEPass : PassInfoMixin<EarlyCSEPass> {
|
2016-08-31 21:24:10 +02:00
|
|
|
EarlyCSEPass(bool UseMemorySSA = false) : UseMemorySSA(UseMemorySSA) {}
|
|
|
|
|
2015-02-01 11:51:23 +01:00
|
|
|
/// \brief Run the pass over the function.
|
2016-08-09 02:28:15 +02:00
|
|
|
PreservedAnalyses run(Function &F, FunctionAnalysisManager &AM);
|
2016-08-31 21:24:10 +02:00
|
|
|
|
|
|
|
bool UseMemorySSA;
|
2015-02-01 11:51:23 +01:00
|
|
|
};
|
|
|
|
|
2015-06-23 11:49:53 +02:00
|
|
|
}
|
2015-02-01 11:51:23 +01:00
|
|
|
|
|
|
|
#endif
|