blob: c62aa663f6d0efaff465cc666f9ceae6bc45c594 [file] [log] [blame]
Duncan Sandseaff5002010-12-20 21:07:42 +00001//===------ 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//
10// This is a utility pass used for testing the InstructionSimplify analysis.
11// The analysis is applied to every instruction, and if it simplifies then the
12// instruction is replaced by the simplification. If you are looking for a pass
13// that performs serious instruction folding, use the instcombine pass instead.
14//
15//===----------------------------------------------------------------------===//
16
Chandler Carruthed0881b2012-12-03 16:50:05 +000017#include "llvm/Transforms/Scalar.h"
Duncan Sands2c440fa2010-12-31 17:49:05 +000018#include "llvm/ADT/DepthFirstIterator.h"
Duncan Sands697de772011-01-03 10:50:04 +000019#include "llvm/ADT/SmallPtrSet.h"
Duncan Sandseaff5002010-12-20 21:07:42 +000020#include "llvm/ADT/Statistic.h"
Duncan Sandseaff5002010-12-20 21:07:42 +000021#include "llvm/Analysis/InstructionSimplify.h"
Chandler Carruth9fb823b2013-01-02 11:36:10 +000022#include "llvm/IR/DataLayout.h"
Chandler Carruth5ad5f152014-01-13 09:26:24 +000023#include "llvm/IR/Dominators.h"
Chandler Carruth9fb823b2013-01-02 11:36:10 +000024#include "llvm/IR/Function.h"
25#include "llvm/IR/Type.h"
Chandler Carruthed0881b2012-12-03 16:50:05 +000026#include "llvm/Pass.h"
Chad Rosierc24b86f2011-12-01 03:08:23 +000027#include "llvm/Target/TargetLibraryInfo.h"
Duncan Sandse7cbb642010-12-21 16:12:03 +000028#include "llvm/Transforms/Utils/Local.h"
Duncan Sandseaff5002010-12-20 21:07:42 +000029using namespace llvm;
30
Chandler Carruth964daaa2014-04-22 02:55:47 +000031#define DEBUG_TYPE "instsimplify"
32
Duncan Sandseaff5002010-12-20 21:07:42 +000033STATISTIC(NumSimplified, "Number of redundant instructions removed");
34
35namespace {
36 struct InstSimplifier : public FunctionPass {
37 static char ID; // Pass identification, replacement for typeid
38 InstSimplifier() : FunctionPass(ID) {
39 initializeInstSimplifierPass(*PassRegistry::getPassRegistry());
40 }
41
Craig Topper3e4c6972014-03-05 09:10:37 +000042 void getAnalysisUsage(AnalysisUsage &AU) const override {
Duncan Sandseaff5002010-12-20 21:07:42 +000043 AU.setPreservesCFG();
Chad Rosierc24b86f2011-12-01 03:08:23 +000044 AU.addRequired<TargetLibraryInfo>();
Duncan Sandseaff5002010-12-20 21:07:42 +000045 }
46
47 /// runOnFunction - Remove instructions that simplify.
Craig Topper3e4c6972014-03-05 09:10:37 +000048 bool runOnFunction(Function &F) override {
Chandler Carruth73523022014-01-13 13:07:17 +000049 const DominatorTreeWrapperPass *DTWP =
50 getAnalysisIfAvailable<DominatorTreeWrapperPass>();
Craig Topperf40110f2014-04-25 05:29:35 +000051 const DominatorTree *DT = DTWP ? &DTWP->getDomTree() : nullptr;
Rafael Espindola93512512014-02-25 17:30:31 +000052 DataLayoutPass *DLP = getAnalysisIfAvailable<DataLayoutPass>();
Craig Topperf40110f2014-04-25 05:29:35 +000053 const DataLayout *DL = DLP ? &DLP->getDataLayout() : nullptr;
Chad Rosierc24b86f2011-12-01 03:08:23 +000054 const TargetLibraryInfo *TLI = &getAnalysis<TargetLibraryInfo>();
Duncan Sands697de772011-01-03 10:50:04 +000055 SmallPtrSet<const Instruction*, 8> S1, S2, *ToSimplify = &S1, *Next = &S2;
Duncan Sandse7cbb642010-12-21 16:12:03 +000056 bool Changed = false;
57
Duncan Sands2c440fa2010-12-31 17:49:05 +000058 do {
David Blaikieceec2bd2014-04-11 01:50:01 +000059 for (BasicBlock *BB : depth_first(&F.getEntryBlock()))
60 // Here be subtlety: the iterator must be incremented before the loop
61 // body (not sure why), so a range-for loop won't work here.
62 for (BasicBlock::iterator BI = BB->begin(), BE = BB->end(); BI != BE;) {
Duncan Sands2c440fa2010-12-31 17:49:05 +000063 Instruction *I = BI++;
Duncan Sands697de772011-01-03 10:50:04 +000064 // The first time through the loop ToSimplify is empty and we try to
65 // simplify all instructions. On later iterations ToSimplify is not
66 // empty and we only bother simplifying instructions that are in it.
67 if (!ToSimplify->empty() && !ToSimplify->count(I))
68 continue;
69 // Don't waste time simplifying unused instructions.
Duncan Sands2c440fa2010-12-31 17:49:05 +000070 if (!I->use_empty())
Rafael Espindola612886f2014-02-21 01:53:35 +000071 if (Value *V = SimplifyInstruction(I, DL, TLI, DT)) {
Duncan Sands697de772011-01-03 10:50:04 +000072 // Mark all uses for resimplification next time round the loop.
Chandler Carruthcdf47882014-03-09 03:16:01 +000073 for (User *U : I->users())
74 Next->insert(cast<Instruction>(U));
Duncan Sands2c440fa2010-12-31 17:49:05 +000075 I->replaceAllUsesWith(V);
Duncan Sands2c440fa2010-12-31 17:49:05 +000076 ++NumSimplified;
Duncan Sands697de772011-01-03 10:50:04 +000077 Changed = true;
Duncan Sands2c440fa2010-12-31 17:49:05 +000078 }
Benjamin Kramer8bcc9712012-08-29 15:32:21 +000079 Changed |= RecursivelyDeleteTriviallyDeadInstructions(I, TLI);
Duncan Sandseaff5002010-12-20 21:07:42 +000080 }
Duncan Sandse7cbb642010-12-21 16:12:03 +000081
Duncan Sands697de772011-01-03 10:50:04 +000082 // Place the list of instructions to simplify on the next loop iteration
83 // into ToSimplify.
84 std::swap(ToSimplify, Next);
85 Next->clear();
86 } while (!ToSimplify->empty());
Duncan Sands3b8af412010-12-21 17:08:55 +000087
Duncan Sandseaff5002010-12-20 21:07:42 +000088 return Changed;
89 }
90 };
91}
92
93char InstSimplifier::ID = 0;
Chad Rosierc24b86f2011-12-01 03:08:23 +000094INITIALIZE_PASS_BEGIN(InstSimplifier, "instsimplify",
95 "Remove redundant instructions", false, false)
96INITIALIZE_PASS_DEPENDENCY(TargetLibraryInfo)
97INITIALIZE_PASS_END(InstSimplifier, "instsimplify",
98 "Remove redundant instructions", false, false)
Duncan Sandseaff5002010-12-20 21:07:42 +000099char &llvm::InstructionSimplifierID = InstSimplifier::ID;
100
101// Public interface to the simplify instructions pass.
102FunctionPass *llvm::createInstructionSimplifierPass() {
103 return new InstSimplifier();
104}