From 8ea0755f9851bcd7900fee2eed94265e60551918 Mon Sep 17 00:00:00 2001 From: Chris Lattner Date: Sat, 30 Jun 2001 06:37:16 +0000 Subject: [PATCH] Add prototypes for ADCE pass git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@115 91177308-0d34-0410-b5e6-96231b3b80d8 --- include/llvm/Transforms/Scalar/DCE.h | 12 +++++++++--- 1 file changed, 9 insertions(+), 3 deletions(-) diff --git a/include/llvm/Transforms/Scalar/DCE.h b/include/llvm/Transforms/Scalar/DCE.h index 362e14651da..a7497bc502f 100644 --- a/include/llvm/Transforms/Scalar/DCE.h +++ b/include/llvm/Transforms/Scalar/DCE.h @@ -8,10 +8,8 @@ #ifndef LLVM_OPT_DCE_H #define LLVM_OPT_DCE_H +#include "llvm/Module.h" #include "llvm/Method.h" -class Module; -class SymTabValue; -class BasicBlock; namespace opt { @@ -19,6 +17,14 @@ bool DoDeadCodeElimination(Method *M); // DCE a method bool DoRemoveUnusedConstants(SymTabValue *S); // RUC a method or module bool DoDeadCodeElimination(Module *C); // DCE & RUC a whole module + +// DoADCE - Execute the Agressive Dead Code Elimination Algorithm +// +bool DoADCE(Method *M); // Defined in ADCE.cpp +static inline bool DoADCE(Module *M) { + return M->reduceApply(DoADCE); +} + // SimplifyCFG - This function is used to do simplification of a CFG. For // example, it adjusts branches to branches to eliminate the extra hop, it // eliminates unreachable basic blocks, and does other "peephole" optimization -- 2.34.1