12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455 |
- //===- MachinePostDominators.cpp -Machine Post Dominator Calculation ------===//
- //
- // The LLVM Compiler Infrastructure
- //
- // This file is distributed under the University of Illinois Open Source
- // License. See LICENSE.TXT for details.
- //
- //===----------------------------------------------------------------------===//
- //
- // This file implements simple dominator construction algorithms for finding
- // post dominators on machine functions.
- //
- //===----------------------------------------------------------------------===//
- #include "llvm/CodeGen/MachinePostDominators.h"
- using namespace llvm;
- char MachinePostDominatorTree::ID = 0;
- //declare initializeMachinePostDominatorTreePass
- INITIALIZE_PASS(MachinePostDominatorTree, "machinepostdomtree",
- "MachinePostDominator Tree Construction", true, true)
- MachinePostDominatorTree::MachinePostDominatorTree() : MachineFunctionPass(ID) {
- initializeMachinePostDominatorTreePass(*PassRegistry::getPassRegistry());
- DT = new DominatorTreeBase<MachineBasicBlock>(true); //true indicate
- // postdominator
- }
- FunctionPass *
- MachinePostDominatorTree::createMachinePostDominatorTreePass() {
- return new MachinePostDominatorTree();
- }
- bool
- MachinePostDominatorTree::runOnMachineFunction(MachineFunction &F) {
- DT->recalculate(F);
- return false;
- }
- MachinePostDominatorTree::~MachinePostDominatorTree() {
- delete DT;
- }
- void
- MachinePostDominatorTree::getAnalysisUsage(AnalysisUsage &AU) const {
- AU.setPreservesAll();
- MachineFunctionPass::getAnalysisUsage(AU);
- }
- void
- MachinePostDominatorTree::print(llvm::raw_ostream &OS, const Module *M) const {
- DT->print(OS);
- }
|