mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-10-18 18:42:46 +02:00
ae65e281f3
to reflect the new license. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. llvm-svn: 351636
58 lines
1.7 KiB
C++
58 lines
1.7 KiB
C++
//===- MachinePostDominators.cpp -Machine Post Dominator Calculation ------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file implements simple dominator construction algorithms for finding
|
|
// post dominators on machine functions.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/CodeGen/MachinePostDominators.h"
|
|
|
|
using namespace llvm;
|
|
|
|
namespace llvm {
|
|
template class DominatorTreeBase<MachineBasicBlock, true>; // PostDomTreeBase
|
|
}
|
|
|
|
char MachinePostDominatorTree::ID = 0;
|
|
|
|
//declare initializeMachinePostDominatorTreePass
|
|
INITIALIZE_PASS(MachinePostDominatorTree, "machinepostdomtree",
|
|
"MachinePostDominator Tree Construction", true, true)
|
|
|
|
MachinePostDominatorTree::MachinePostDominatorTree() : MachineFunctionPass(ID) {
|
|
initializeMachinePostDominatorTreePass(*PassRegistry::getPassRegistry());
|
|
DT = new PostDomTreeBase<MachineBasicBlock>();
|
|
}
|
|
|
|
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);
|
|
}
|