| /macosx-10.9.5/llvmCore-3425.0.33/include/llvm/Analysis/ |
| H A D | 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*> {
|
| H A D | Dominators.h | 58 // DomTreeNode - Dominator Tree Node
176 typedef DomTreeNodeBase<BasicBlock> DomTreeNode; typedef in namespace:llvm
755 inline DomTreeNode *getRootNode() const {
762 DomTreeNode *R = getRootNode();
763 DomTreeNode *OtherR = Other.getRootNode();
782 inline bool dominates(const DomTreeNode* A, const DomTreeNode* B) const {
799 bool properlyDominates(const DomTreeNode *A, const DomTreeNode *B) const {
818 inline DomTreeNode *operato
[all...] |
| H A D | RegionInfo.h | 594 DomTreeNode *getNextPostDom(DomTreeNode* N, BBtoBBMap *ShortCut) const;
612 void buildRegionsTree(DomTreeNode *N, Region *region);
|
| H A D | DominanceFrontier.h | 185 const DomTreeNode *Node);
|
| /macosx-10.9.5/llvmCore-3425.0.33/lib/Analysis/ |
| H A D | 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 *Nod
[all...] |
| H A D | 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;
|
| H A D | RegionInfo.cpp | 519 DomTreeNode* RegionInfo::getNextPostDom(DomTreeNode* N,
569 DomTreeNode *N = PDT->getNode(entry);
608 DomTreeNode *N = DT->getNode(entry);
614 for (po_iterator<DomTreeNode*> FI = po_begin(N), FE = po_end(N); FI != FE;
627 void RegionInfo::buildRegionsTree(DomTreeNode *N, Region *region) {
646 for (DomTreeNode::iterator CI = N->begin(), CE = N->end(); CI != CE; ++CI)
|
| H A D | IVUsers.cpp | 89 for (DomTreeNode *Rung = DT->getNode(BB);
|
| /macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Scalar/ |
| H A D | EarlyCSE.cpp | 294 unsigned cg, DomTreeNode *n,
295 DomTreeNode::iterator child, DomTreeNode::iterator end) :
305 DomTreeNode *node() { return Node; }
306 DomTreeNode::iterator childIter() { return ChildIter; }
307 DomTreeNode *nextChild() {
308 DomTreeNode *child = *ChildIter;
312 DomTreeNode::iterator end() { return EndIter; }
323 DomTreeNode *Node;
324 DomTreeNode
[all...] |
| H A D | LoopRotation.cpp | 414 DomTreeNode *OrigHeaderNode = DT->getNode(OrigHeader);
415 SmallVector<DomTreeNode *, 8> HeaderChildren(OrigHeaderNode->begin(),
417 DomTreeNode *OrigPreheaderNode = DT->getNode(OrigPreheader);
455 DomTreeNode *OrigHeaderNode = DT->getNode(OrigHeader);
456 SmallVector<DomTreeNode *, 8> HeaderChildren(OrigHeaderNode->begin(),
462 DomTreeNode *Node = HeaderChildren[I];
|
| H A D | LICM.cpp | 129 void SinkRegion(DomTreeNode *N);
137 void HoistRegion(DomTreeNode *N);
301 void LICM::SinkRegion(DomTreeNode *N) {
309 const std::vector<DomTreeNode*> &Children = N->getChildren();
348 void LICM::HoistRegion(DomTreeNode *N) {
382 const std::vector<DomTreeNode*> &Children = N->getChildren();
|
| H A D | LoopDeletion.cpp | 204 SmallVector<DomTreeNode*, 8> ChildNodes;
210 for (SmallVector<DomTreeNode*, 8>::iterator DI = ChildNodes.begin(),
|
| H A D | Sink.cpp | 240 DomTreeNode *DTN = DT->getNode(Inst->getParent());
241 for (DomTreeNode::iterator I = DTN->begin(), E = DTN->end();
|
| H A D | LoopStrengthReduce.cpp | 2601 for (DomTreeNode *Rung = DT.getNode(L->getLoopLatch());
4153 for (DomTreeNode *Rung = DT.getNode(IP->getParent()); ; ) {
4623 for (DomTreeNode *Rung = DT.getNode(L->getLoopPreheader());
|
| H A D | GVN.cpp | 2591 for (df_iterator<DomTreeNode*> DI = df_begin(DT->getRootNode()),
|
| /macosx-10.9.5/llvmCore-3425.0.33/lib/Transforms/Utils/ |
| H A D | 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(),
301 if (DomTreeNode *OldNode = DT->getNode(Old)) {
302 std::vector<DomTreeNode *> Children;
303 for (DomTreeNode::iterator I = OldNode->begin(), E = OldNode->end();
307 DomTreeNode *NewNode = DT->addNewBlock(New,Old);
308 for (std::vector<DomTreeNode *>::iterator I = Children.begin(),
|
| H A D | PromoteMemoryToRegister.cpp | 243 DenseMap<DomTreeNode*, unsigned> DomLevels;
352 typedef std::pair<DomTreeNode*, unsigned> DomTreeNodePair;
492 SmallVector<DomTreeNode*, 32> Worklist;
494 DomTreeNode *Root = DT.getRootNode();
499 DomTreeNode *Node = Worklist.pop_back_val();
501 for (DomTreeNode::iterator CI = Node->begin(), CE = Node->end();
765 if (DomTreeNode *Node = DT.getNode(*I))
770 SmallPtrSet<DomTreeNode*, 32> Visited;
771 SmallVector<DomTreeNode*, 32> Worklist;
775 DomTreeNode *Roo
[all...] |
| H A D | BreakCriticalEdges.cpp | 280 DomTreeNode *TINode = DT->getNode(TIBB);
286 DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB);
287 DomTreeNode *DestBBNode = 0;
293 if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back()))
|
| H A D | LCSSA.cpp | 106 DomTreeNode *DomNode = DT->getNode(BB);
208 DomTreeNode *DomNode = DT->getNode(DomBB);
|
| H A D | CodeExtractor.cpp | 271 DomTreeNode *OldNode = DT->getNode(*I);
272 SmallVector<DomTreeNode*, 8> Children;
273 for (DomTreeNode::iterator DI = OldNode->begin(), DE = OldNode->end();
277 DomTreeNode *NewNode = DT->addNewBlock(New, *I);
279 for (SmallVector<DomTreeNode*, 8>::iterator I = Children.begin(),
|
| H A D | LoopSimplify.cpp | 341 DomTreeNode *Node = DT->getNode(ExitingBlock);
345 DomTreeNode *Child = Children.front();
|