projects
/
oota-llvm.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Add is16BitVector and is32BitVector to MVT and call them from EVT. Matches other...
[oota-llvm.git]
/
include
/
llvm
/
CodeGen
/
MachineDominators.h
diff --git
a/include/llvm/CodeGen/MachineDominators.h
b/include/llvm/CodeGen/MachineDominators.h
index 7b3d5f71b5f8348c3db06ce7a064b92a53af5226..82a4ac821b69fa44b59a13302f5cd5f017365b34 100644
(file)
--- a/
include/llvm/CodeGen/MachineDominators.h
+++ b/
include/llvm/CodeGen/MachineDominators.h
@@
-23,8
+23,6
@@
namespace llvm {
namespace llvm {
-inline void WriteAsOperand(std::ostream &, const MachineBasicBlock*, bool t) { }
-
template<>
inline void DominatorTreeBase<MachineBasicBlock>::addRoot(MachineBasicBlock* MBB) {
this->Roots.push_back(MBB);
template<>
inline void DominatorTreeBase<MachineBasicBlock>::addRoot(MachineBasicBlock* MBB) {
this->Roots.push_back(MBB);
@@
-86,7
+84,8
@@
public:
// Loop through the basic block until we find A or B.
MachineBasicBlock::iterator I = BBA->begin();
// Loop through the basic block until we find A or B.
MachineBasicBlock::iterator I = BBA->begin();
- for (; &*I != A && &*I != B; ++I) /*empty*/;
+ for (; &*I != A && &*I != B; ++I)
+ /*empty*/ ;
//if(!DT.IsPostDominators) {
// A dominates B if it is found first in the basic block.
//if(!DT.IsPostDominators) {
// A dominates B if it is found first in the basic block.
@@
-147,7
+146,7
@@
public:
}
/// eraseNode - Removes a node from the dominator tree. Block must not
}
/// eraseNode - Removes a node from the dominator tree. Block must not
- /// domi
an
te any other blocks. Removes node from its immediate dominator's
+ /// domi
na
te any other blocks. Removes node from its immediate dominator's
/// children list. Deletes dominator node associated with basic block BB.
inline void eraseNode(MachineBasicBlock *BB) {
DT->eraseNode(BB);
/// children list. Deletes dominator node associated with basic block BB.
inline void eraseNode(MachineBasicBlock *BB) {
DT->eraseNode(BB);
@@
-158,13
+157,16
@@
public:
inline void splitBlock(MachineBasicBlock* NewBB) {
DT->splitBlock(NewBB);
}
inline void splitBlock(MachineBasicBlock* NewBB) {
DT->splitBlock(NewBB);
}
-
-
+
+ /// isReachableFromEntry - Return true if A is dominated by the entry
+ /// block of the function containing it.
+ bool isReachableFromEntry(MachineBasicBlock *A) {
+ return DT->isReachableFromEntry(A);
+ }
+
virtual void releaseMemory();
virtual void releaseMemory();
- virtual void print(std::ostream &OS, const Module* M= 0) const {
- DT->print(OS, M);
- }
+ virtual void print(raw_ostream &OS, const Module*) const;
};
//===-------------------------------------
};
//===-------------------------------------