OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:DomTreeNode
(Results
1 - 18
of
18
) sorted by null
/external/llvm/include/llvm/Analysis/
PostDominators.h
45
inline
DomTreeNode
*getRootNode() const {
49
inline
DomTreeNode
*operator[](BasicBlock *BB) const {
53
inline
DomTreeNode
*getNode(BasicBlock *BB) const {
57
inline bool dominates(
DomTreeNode
* A,
DomTreeNode
* B) const {
65
inline bool properlyDominates(const
DomTreeNode
* A,
DomTreeNode
* B) const {
87
: public GraphTraits<
DomTreeNode
*> {
Dominators.h
58
//
DomTreeNode
- Dominator Tree Node
176
typedef DomTreeNodeBase<BasicBlock>
DomTreeNode
;
717
inline
DomTreeNode
*getRootNode() const {
724
DomTreeNode
*R = getRootNode();
725
DomTreeNode
*OtherR = Other.getRootNode();
744
inline bool dominates(const
DomTreeNode
* A, const
DomTreeNode
* B) const {
756
bool properlyDominates(const
DomTreeNode
*A, const
DomTreeNode
*B) const {
775
inline
DomTreeNode
*operator[](BasicBlock *BB) const
[
all
...]
RegionInfo.h
561
DomTreeNode
*getNextPostDom(
DomTreeNode
* N, BBtoBBMap *ShortCut) const;
579
void buildRegionsTree(
DomTreeNode
*N, Region *region);
DominanceFrontier.h
184
const
DomTreeNode
*Node);
/external/llvm/lib/Analysis/
DomPrinter.cpp
29
struct DOTGraphTraits<
DomTreeNode
*> : public DefaultDOTGraphTraits {
34
std::string getNodeLabel(
DomTreeNode
*Node,
DomTreeNode
*Graph) {
52
struct DOTGraphTraits<DominatorTree*> : public DOTGraphTraits<
DomTreeNode
*> {
55
: DOTGraphTraits<
DomTreeNode
*>(isSimple) {}
61
std::string getNodeLabel(
DomTreeNode
*Node, DominatorTree *G) {
62
return DOTGraphTraits<
DomTreeNode
*>::getNodeLabel(Node, G->getRootNode());
68
: public DOTGraphTraits<
DomTreeNode
*> {
71
: DOTGraphTraits<
DomTreeNode
*>(isSimple) {}
77
std::string getNodeLabel(
DomTreeNode
*Node, PostDominatorTree *G )
[
all
...]
DominanceFrontier.cpp
28
const
DomTreeNode
*N,
29
const
DomTreeNode
*PN)
33
const
DomTreeNode
*Node;
34
const
DomTreeNode
*parentNode;
40
const
DomTreeNode
*Node) {
54
const
DomTreeNode
*currentNode = currentW->Node;
55
const
DomTreeNode
*parentNode = currentW->parentNode;
77
for (
DomTreeNode
::const_iterator NI = currentNode->begin(),
79
DomTreeNode
*IDominee = *NI;
RegionInfo.cpp
535
DomTreeNode
* RegionInfo::getNextPostDom(
DomTreeNode
* N,
585
DomTreeNode
*N = PDT->getNode(entry);
624
DomTreeNode
*N = DT->getNode(entry);
630
for (po_iterator<
DomTreeNode
*> FI = po_begin(N), FE = po_end(N); FI != FE;
643
void RegionInfo::buildRegionsTree(
DomTreeNode
*N, Region *region) {
662
for (
DomTreeNode
::iterator CI = N->begin(), CE = N->end(); CI != CE; ++CI)
/external/llvm/lib/Transforms/Utils/
BasicBlockUtils.cpp
170
if (
DomTreeNode
*DTN = DT->getNode(BB)) {
171
DomTreeNode
*PredDTN = DT->getNode(PredBB);
172
SmallVector<
DomTreeNode
*, 8> Children(DTN->begin(), DTN->end());
173
for (SmallVector<
DomTreeNode
*, 8>::iterator DI = Children.begin(),
302
if (
DomTreeNode
*OldNode = DT->getNode(Old)) {
303
std::vector<
DomTreeNode
*> Children;
304
for (
DomTreeNode
::iterator I = OldNode->begin(), E = OldNode->end();
308
DomTreeNode
*NewNode = DT->addNewBlock(New,Old);
309
for (std::vector<
DomTreeNode
*>::iterator I = Children.begin(),
PromoteMemoryToRegister.cpp
241
DenseMap<
DomTreeNode
*, unsigned> DomLevels;
350
typedef std::pair<
DomTreeNode
*, unsigned> DomTreeNodePair;
489
SmallVector<
DomTreeNode
*, 32> Worklist;
491
DomTreeNode
*Root = DT.getRootNode();
496
DomTreeNode
*Node = Worklist.pop_back_val();
498
for (
DomTreeNode
::iterator CI = Node->begin(), CE = Node->end();
762
if (
DomTreeNode
*Node = DT.getNode(*I))
767
SmallPtrSet<
DomTreeNode
*, 32> Visited;
768
SmallVector<
DomTreeNode
*, 32> Worklist;
772
DomTreeNode
*Root = RootPair.first
[
all
...]
BreakCriticalEdges.cpp
274
DomTreeNode
*TINode = DT->getNode(TIBB);
280
DomTreeNode
*NewBBNode = DT->addNewBlock(NewBB, TIBB);
281
DomTreeNode
*DestBBNode = 0;
287
if (
DomTreeNode
*OPNode = DT->getNode(OtherPreds.back()))
LCSSA.cpp
106
DomTreeNode
*DomNode = DT->getNode(BB);
208
DomTreeNode
*DomNode = DT->getNode(DomBB);
CodeExtractor.cpp
191
DomTreeNode
*OldNode = DT->getNode(*I);
192
SmallVector<
DomTreeNode
*, 8> Children;
193
for (
DomTreeNode
::iterator DI = OldNode->begin(), DE = OldNode->end();
197
DomTreeNode
*NewNode = DT->addNewBlock(New, *I);
199
for (SmallVector<
DomTreeNode
*, 8>::iterator I = Children.begin(),
LoopSimplify.cpp
340
DomTreeNode
*Node = DT->getNode(ExitingBlock);
344
DomTreeNode
*Child = Children.front();
/external/llvm/lib/Transforms/Scalar/
LICM.cpp
119
void SinkRegion(
DomTreeNode
*N);
127
void HoistRegion(
DomTreeNode
*N);
273
void LICM::SinkRegion(
DomTreeNode
*N) {
281
const std::vector<
DomTreeNode
*> &Children = N->getChildren();
320
void LICM::HoistRegion(
DomTreeNode
*N) {
354
const std::vector<
DomTreeNode
*> &Children = N->getChildren();
LoopDeletion.cpp
204
SmallVector<
DomTreeNode
*, 8> ChildNodes;
210
for (SmallVector<
DomTreeNode
*, 8>::iterator DI = ChildNodes.begin(),
EarlyCSE.cpp
261
bool processNode(
DomTreeNode
*Node);
282
bool EarlyCSE::processNode(
DomTreeNode
*Node) {
447
for (
DomTreeNode
::iterator I = Node->begin(), E = Node->end(); I != E; ++I) {
GVN.cpp
[
all
...]
LoopStrengthReduce.cpp
[
all
...]
Completed in 331 milliseconds