| SimplifyInstructions.cpp (234353) | SimplifyInstructions.cpp (243830) |
|---|---|
| 1//===------ SimplifyInstructions.cpp - Remove redundant instructions ------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// --- 9 unchanged lines hidden (view full) --- 18#include "llvm/Function.h" 19#include "llvm/Pass.h" 20#include "llvm/Type.h" 21#include "llvm/ADT/DepthFirstIterator.h" 22#include "llvm/ADT/SmallPtrSet.h" 23#include "llvm/ADT/Statistic.h" 24#include "llvm/Analysis/Dominators.h" 25#include "llvm/Analysis/InstructionSimplify.h" | 1//===------ SimplifyInstructions.cpp - Remove redundant instructions ------===// 2// 3// The LLVM Compiler Infrastructure 4// 5// This file is distributed under the University of Illinois Open Source 6// License. See LICENSE.TXT for details. 7// 8//===----------------------------------------------------------------------===// --- 9 unchanged lines hidden (view full) --- 18#include "llvm/Function.h" 19#include "llvm/Pass.h" 20#include "llvm/Type.h" 21#include "llvm/ADT/DepthFirstIterator.h" 22#include "llvm/ADT/SmallPtrSet.h" 23#include "llvm/ADT/Statistic.h" 24#include "llvm/Analysis/Dominators.h" 25#include "llvm/Analysis/InstructionSimplify.h" |
| 26#include "llvm/Target/TargetData.h" | 26#include "llvm/DataLayout.h" |
| 27#include "llvm/Target/TargetLibraryInfo.h" 28#include "llvm/Transforms/Scalar.h" 29#include "llvm/Transforms/Utils/Local.h" 30using namespace llvm; 31 32STATISTIC(NumSimplified, "Number of redundant instructions removed"); 33 34namespace { --- 6 unchanged lines hidden (view full) --- 41 void getAnalysisUsage(AnalysisUsage &AU) const { 42 AU.setPreservesCFG(); 43 AU.addRequired<TargetLibraryInfo>(); 44 } 45 46 /// runOnFunction - Remove instructions that simplify. 47 bool runOnFunction(Function &F) { 48 const DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>(); | 27#include "llvm/Target/TargetLibraryInfo.h" 28#include "llvm/Transforms/Scalar.h" 29#include "llvm/Transforms/Utils/Local.h" 30using namespace llvm; 31 32STATISTIC(NumSimplified, "Number of redundant instructions removed"); 33 34namespace { --- 6 unchanged lines hidden (view full) --- 41 void getAnalysisUsage(AnalysisUsage &AU) const { 42 AU.setPreservesCFG(); 43 AU.addRequired<TargetLibraryInfo>(); 44 } 45 46 /// runOnFunction - Remove instructions that simplify. 47 bool runOnFunction(Function &F) { 48 const DominatorTree *DT = getAnalysisIfAvailable<DominatorTree>(); |
| 49 const TargetData *TD = getAnalysisIfAvailable<TargetData>(); | 49 const DataLayout *TD = getAnalysisIfAvailable<DataLayout>(); |
| 50 const TargetLibraryInfo *TLI = &getAnalysis<TargetLibraryInfo>(); 51 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; 52 bool Changed = false; 53 54 do { 55 for (df_iterator<BasicBlock*> DI = df_begin(&F.getEntryBlock()), 56 DE = df_end(&F.getEntryBlock()); DI != DE; ++DI) 57 for (BasicBlock::iterator BI = DI->begin(), BE = DI->end(); BI != BE;) { --- 9 unchanged lines hidden (view full) --- 67 // Mark all uses for resimplification next time round the loop. 68 for (Value::use_iterator UI = I->use_begin(), UE = I->use_end(); 69 UI != UE; ++UI) 70 Next->insert(cast<Instruction>(*UI)); 71 I->replaceAllUsesWith(V); 72 ++NumSimplified; 73 Changed = true; 74 } | 50 const TargetLibraryInfo *TLI = &getAnalysis<TargetLibraryInfo>(); 51 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2; 52 bool Changed = false; 53 54 do { 55 for (df_iterator<BasicBlock*> DI = df_begin(&F.getEntryBlock()), 56 DE = df_end(&F.getEntryBlock()); DI != DE; ++DI) 57 for (BasicBlock::iterator BI = DI->begin(), BE = DI->end(); BI != BE;) { --- 9 unchanged lines hidden (view full) --- 67 // Mark all uses for resimplification next time round the loop. 68 for (Value::use_iterator UI = I->use_begin(), UE = I->use_end(); 69 UI != UE; ++UI) 70 Next->insert(cast<Instruction>(*UI)); 71 I->replaceAllUsesWith(V); 72 ++NumSimplified; 73 Changed = true; 74 } |
| 75 Changed |= RecursivelyDeleteTriviallyDeadInstructions(I); | 75 Changed |= RecursivelyDeleteTriviallyDeadInstructions(I, TLI); |
| 76 } 77 78 // Place the list of instructions to simplify on the next loop iteration 79 // into ToSimplify. 80 std::swap(ToSimplify, Next); 81 Next->clear(); 82 } while (!ToSimplify->empty()); 83 --- 17 unchanged lines hidden --- | 76 } 77 78 // Place the list of instructions to simplify on the next loop iteration 79 // into ToSimplify. 80 std::swap(ToSimplify, Next); 81 Next->clear(); 82 } while (!ToSimplify->empty()); 83 --- 17 unchanged lines hidden --- |