| /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 {
92 : public GraphTraits<DomTreeNode*> {
|
| Dominators.h | 58 // DomTreeNode - Dominator Tree Node
176 typedef DomTreeNodeBase<BasicBlock> DomTreeNode;
754 inline DomTreeNode *getRootNode() const {
761 DomTreeNode *R = getRootNode();
762 DomTreeNode *OtherR = Other.getRootNode();
781 inline bool dominates(const DomTreeNode* A, const DomTreeNode* B) const {
798 bool properlyDominates(const DomTreeNode *A, const DomTreeNode *B) const {
817 inline DomTreeNode *operator[](BasicBlock *BB) const
[all...] |
| RegionInfo.h | 612 DomTreeNode *getNextPostDom(DomTreeNode* N, BBtoBBMap *ShortCut) const;
630 void buildRegionsTree(DomTreeNode *N, Region *region);
|
| DominanceFrontier.h | 185 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;
42 const DomTreeNode *Node) {
56 const DomTreeNode *currentNode = currentW->Node;
57 const DomTreeNode *parentNode = currentW->parentNode;
79 for (DomTreeNode::const_iterator NI = currentNode->begin(),
81 DomTreeNode *IDominee = *NI;
|
| RegionInfo.cpp | 551 DomTreeNode* RegionInfo::getNextPostDom(DomTreeNode* N,
601 DomTreeNode *N = PDT->getNode(entry);
640 DomTreeNode *N = DT->getNode(entry);
646 for (po_iterator<DomTreeNode*> FI = po_begin(N), FE = po_end(N); FI != FE;
659 void RegionInfo::buildRegionsTree(DomTreeNode *N, Region *region) {
678 for (DomTreeNode::iterator CI = N->begin(), CE = N->end(); CI != CE; ++CI)
|
| IVUsers.cpp | 89 for (DomTreeNode *Rung = DT->getNode(BB);
|
| /external/clang/include/clang/Analysis/Analyses/ |
| Dominators.h | 27 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
53 /// \brief This method returns the root DomTreeNode, which is the wrapper
55 inline DomTreeNode *getRootNode() const {
64 DomTreeNode *R = getRootNode();
65 DomTreeNode *OtherR = Other.getRootNode();
170 template <> struct GraphTraits< ::clang::DomTreeNode* > {
171 typedef ::clang::DomTreeNode NodeType;
184 typedef df_iterator< ::clang::DomTreeNode* > nodes_iterator;
186 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
190 static nodes_iterator nodes_end(::clang::DomTreeNode *N)
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| EarlyCSE.cpp | 350 unsigned cg, DomTreeNode *n,
351 DomTreeNode::iterator child, DomTreeNode::iterator end) :
361 DomTreeNode *node() { return Node; }
362 DomTreeNode::iterator childIter() { return ChildIter; }
363 DomTreeNode *nextChild() {
364 DomTreeNode *child = *ChildIter;
368 DomTreeNode::iterator end() { return EndIter; }
379 DomTreeNode *Node;
380 DomTreeNode::iterator ChildIter
[all...] |
| LoopRotation.cpp | 441 DomTreeNode *OrigHeaderNode = DT->getNode(OrigHeader);
442 SmallVector<DomTreeNode *, 8> HeaderChildren(OrigHeaderNode->begin(),
444 DomTreeNode *OrigPreheaderNode = DT->getNode(OrigPreheader);
482 DomTreeNode *OrigHeaderNode = DT->getNode(OrigHeader);
483 SmallVector<DomTreeNode *, 8> HeaderChildren(OrigHeaderNode->begin(),
489 DomTreeNode *Node = HeaderChildren[I];
|
| LICM.cpp | 132 void SinkRegion(DomTreeNode *N);
140 void HoistRegion(DomTreeNode *N);
304 void LICM::SinkRegion(DomTreeNode *N) {
312 const std::vector<DomTreeNode*> &Children = N->getChildren();
351 void LICM::HoistRegion(DomTreeNode *N) {
385 const std::vector<DomTreeNode*> &Children = N->getChildren();
[all...] |
| LoopDeletion.cpp | 206 SmallVector<DomTreeNode*, 8> ChildNodes;
212 for (SmallVectorImpl<DomTreeNode *>::iterator DI = ChildNodes.begin(),
|
| Sink.cpp | 240 DomTreeNode *DTN = DT->getNode(Inst->getParent());
241 for (DomTreeNode::iterator I = DTN->begin(), E = DTN->end();
|
| StructurizeCFG.cpp | 40 typedef DenseMap<DomTreeNode *, unsigned> DTN2UnsignedMap;
72 DomTreeNode *Node = DT->getNode(BB);
|
| LoopStrengthReduce.cpp | [all...] |
| GVN.cpp | [all...] |
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 320 DenseMap<DomTreeNode *, unsigned> DomLevels;
646 SmallVector<DomTreeNode *, 32> Worklist;
648 DomTreeNode *Root = DT.getRootNode();
653 DomTreeNode *Node = Worklist.pop_back_val();
655 for (DomTreeNode::iterator CI = Node->begin(), CE = Node->end();
[all...] |
| BreakCriticalEdges.cpp | 248 DomTreeNode *TINode = DT->getNode(TIBB);
254 DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB);
255 DomTreeNode *DestBBNode = 0;
261 if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back()))
|
| BasicBlockUtils.cpp | 171 if (DomTreeNode *DTN = DT->getNode(BB)) {
172 DomTreeNode *PredDTN = DT->getNode(PredBB);
173 SmallVector<DomTreeNode*, 8> Children(DTN->begin(), DTN->end());
174 for (SmallVectorImpl<DomTreeNode *>::iterator DI = Children.begin(),
286 if (DomTreeNode *OldNode = DT->getNode(Old)) {
287 std::vector<DomTreeNode *> Children;
288 for (DomTreeNode::iterator I = OldNode->begin(), E = OldNode->end();
292 DomTreeNode *NewNode = DT->addNewBlock(New,Old);
293 for (std::vector<DomTreeNode *>::iterator I = Children.begin(),
|
| LCSSA.cpp | 108 DomTreeNode *DomNode = DT->getNode(BB);
218 DomTreeNode *DomNode = DT->getNode(DomBB);
|
| CodeExtractor.cpp | 272 DomTreeNode *OldNode = DT->getNode(*I);
273 SmallVector<DomTreeNode*, 8> Children;
274 for (DomTreeNode::iterator DI = OldNode->begin(), DE = OldNode->end();
278 DomTreeNode *NewNode = DT->addNewBlock(New, *I);
280 for (SmallVectorImpl<DomTreeNode *>::iterator I = Children.begin(),
|
| LoopSimplify.cpp | 349 DomTreeNode *Node = DT->getNode(ExitingBlock);
353 DomTreeNode *Child = Children.front();
|
