12bb61ba2SHal Finkel //===---- BDCE.cpp - Bit-tracking dead code elimination -------------------===// 22bb61ba2SHal Finkel // 32bb61ba2SHal Finkel // The LLVM Compiler Infrastructure 42bb61ba2SHal Finkel // 52bb61ba2SHal Finkel // This file is distributed under the University of Illinois Open Source 62bb61ba2SHal Finkel // License. See LICENSE.TXT for details. 72bb61ba2SHal Finkel // 82bb61ba2SHal Finkel //===----------------------------------------------------------------------===// 92bb61ba2SHal Finkel // 102bb61ba2SHal Finkel // This file implements the Bit-Tracking Dead Code Elimination pass. Some 112bb61ba2SHal Finkel // instructions (shifts, some ands, ors, etc.) kill some of their input bits. 122bb61ba2SHal Finkel // We track these dead bits and remove instructions that compute only these 132bb61ba2SHal Finkel // dead bits. 142bb61ba2SHal Finkel // 152bb61ba2SHal Finkel //===----------------------------------------------------------------------===// 162bb61ba2SHal Finkel 17655a145eSDavide Italiano #include "llvm/Transforms/Scalar/BDCE.h" 182bb61ba2SHal Finkel #include "llvm/ADT/SmallVector.h" 192bb61ba2SHal Finkel #include "llvm/ADT/Statistic.h" 2087405c7fSJames Molloy #include "llvm/Analysis/DemandedBits.h" 21655a145eSDavide Italiano #include "llvm/Analysis/GlobalsModRef.h" 222bb61ba2SHal Finkel #include "llvm/IR/CFG.h" 232bb61ba2SHal Finkel #include "llvm/IR/InstIterator.h" 242bb61ba2SHal Finkel #include "llvm/IR/Instructions.h" 252bb61ba2SHal Finkel #include "llvm/IR/IntrinsicInst.h" 262bb61ba2SHal Finkel #include "llvm/IR/Operator.h" 272bb61ba2SHal Finkel #include "llvm/Pass.h" 282bb61ba2SHal Finkel #include "llvm/Support/Debug.h" 292bb61ba2SHal Finkel #include "llvm/Support/raw_ostream.h" 30655a145eSDavide Italiano #include "llvm/Transforms/Scalar.h" 312bb61ba2SHal Finkel using namespace llvm; 322bb61ba2SHal Finkel 332bb61ba2SHal Finkel #define DEBUG_TYPE "bdce" 342bb61ba2SHal Finkel 352bb61ba2SHal Finkel STATISTIC(NumRemoved, "Number of instructions removed (unused)"); 362bb61ba2SHal Finkel STATISTIC(NumSimplified, "Number of instructions trivialized (dead bits)"); 372bb61ba2SHal Finkel 38655a145eSDavide Italiano static bool bitTrackingDCE(Function &F, DemandedBits &DB) { 392bb61ba2SHal Finkel SmallVector<Instruction*, 128> Worklist; 402bb61ba2SHal Finkel bool Changed = false; 4178199518SNico Rieck for (Instruction &I : instructions(F)) { 42043e6613SDavide Italiano // If the instruction has side effects and no non-dbg uses, 43*1ed53963SDavide Italiano // skip it. This way we avoid computing known bits on an instruction 44*1ed53963SDavide Italiano // that will not help us. 45043e6613SDavide Italiano if (I.mayHaveSideEffects() && I.use_empty()) 46043e6613SDavide Italiano continue; 47043e6613SDavide Italiano 4887405c7fSJames Molloy if (I.getType()->isIntegerTy() && 4987405c7fSJames Molloy !DB.getDemandedBits(&I).getBoolValue()) { 502bb61ba2SHal Finkel // For live instructions that have all dead bits, first make them dead by 512bb61ba2SHal Finkel // replacing all uses with something else. Then, if they don't need to 522bb61ba2SHal Finkel // remain live (because they have side effects, etc.) we can remove them. 532bb61ba2SHal Finkel DEBUG(dbgs() << "BDCE: Trivializing: " << I << " (all bits dead)\n"); 542bb61ba2SHal Finkel // FIXME: In theory we could substitute undef here instead of zero. 552bb61ba2SHal Finkel // This should be reconsidered once we settle on the semantics of 562bb61ba2SHal Finkel // undef, poison, etc. 572bb61ba2SHal Finkel Value *Zero = ConstantInt::get(I.getType(), 0); 582bb61ba2SHal Finkel ++NumSimplified; 59*1ed53963SDavide Italiano I.replaceNonMetadataUsesWith(Zero); 602bb61ba2SHal Finkel Changed = true; 612bb61ba2SHal Finkel } 6287405c7fSJames Molloy if (!DB.isInstructionDead(&I)) 632bb61ba2SHal Finkel continue; 642bb61ba2SHal Finkel 652bb61ba2SHal Finkel Worklist.push_back(&I); 662bb61ba2SHal Finkel I.dropAllReferences(); 672bb61ba2SHal Finkel Changed = true; 682bb61ba2SHal Finkel } 692bb61ba2SHal Finkel 702bb61ba2SHal Finkel for (Instruction *&I : Worklist) { 712bb61ba2SHal Finkel ++NumRemoved; 722bb61ba2SHal Finkel I->eraseFromParent(); 732bb61ba2SHal Finkel } 742bb61ba2SHal Finkel 752bb61ba2SHal Finkel return Changed; 762bb61ba2SHal Finkel } 772bb61ba2SHal Finkel 78655a145eSDavide Italiano PreservedAnalyses BDCEPass::run(Function &F, FunctionAnalysisManager &AM) { 79655a145eSDavide Italiano auto &DB = AM.getResult<DemandedBitsAnalysis>(F); 80bdc29714SDavide Italiano if (!bitTrackingDCE(F, DB)) 81655a145eSDavide Italiano return PreservedAnalyses::all(); 82bdc29714SDavide Italiano 83835facd8SMichael Kuperstein // FIXME: This should also 'preserve the CFG'. 84bdc29714SDavide Italiano auto PA = PreservedAnalyses(); 85bdc29714SDavide Italiano PA.preserve<GlobalsAA>(); 86bdc29714SDavide Italiano return PA; 872bb61ba2SHal Finkel } 882bb61ba2SHal Finkel 89655a145eSDavide Italiano namespace { 90655a145eSDavide Italiano struct BDCELegacyPass : public FunctionPass { 91655a145eSDavide Italiano static char ID; // Pass identification, replacement for typeid 92655a145eSDavide Italiano BDCELegacyPass() : FunctionPass(ID) { 93655a145eSDavide Italiano initializeBDCELegacyPassPass(*PassRegistry::getPassRegistry()); 94655a145eSDavide Italiano } 95655a145eSDavide Italiano 96655a145eSDavide Italiano bool runOnFunction(Function &F) override { 97655a145eSDavide Italiano if (skipFunction(F)) 98655a145eSDavide Italiano return false; 99655a145eSDavide Italiano auto &DB = getAnalysis<DemandedBitsWrapperPass>().getDemandedBits(); 100655a145eSDavide Italiano return bitTrackingDCE(F, DB); 101655a145eSDavide Italiano } 102655a145eSDavide Italiano 103655a145eSDavide Italiano void getAnalysisUsage(AnalysisUsage &AU) const override { 104655a145eSDavide Italiano AU.setPreservesCFG(); 105655a145eSDavide Italiano AU.addRequired<DemandedBitsWrapperPass>(); 106655a145eSDavide Italiano AU.addPreserved<GlobalsAAWrapperPass>(); 107655a145eSDavide Italiano } 108655a145eSDavide Italiano }; 109655a145eSDavide Italiano } 110655a145eSDavide Italiano 111655a145eSDavide Italiano char BDCELegacyPass::ID = 0; 112655a145eSDavide Italiano INITIALIZE_PASS_BEGIN(BDCELegacyPass, "bdce", 113655a145eSDavide Italiano "Bit-Tracking Dead Code Elimination", false, false) 114655a145eSDavide Italiano INITIALIZE_PASS_DEPENDENCY(DemandedBitsWrapperPass) 115655a145eSDavide Italiano INITIALIZE_PASS_END(BDCELegacyPass, "bdce", 116655a145eSDavide Italiano "Bit-Tracking Dead Code Elimination", false, false) 117655a145eSDavide Italiano 118655a145eSDavide Italiano FunctionPass *llvm::createBitTrackingDCEPass() { return new BDCELegacyPass(); } 119