HomeSort by relevance Sort by last modified time
    Searched refs:DomTreeNode (Results 1 - 25 of 87) sorted by null

1 2 3 4

  /external/llvm/lib/Analysis/
IteratedDominanceFrontier.cpp 33 typedef std::pair<DomTreeNode *, unsigned> DomTreeNodePair;
39 if (DomTreeNode *Node = DT.getNode(BB))
43 SmallVector<DomTreeNode *, 32> Worklist;
44 SmallPtrSet<DomTreeNode *, 32> VisitedPQ;
45 SmallPtrSet<DomTreeNode *, 32> VisitedWorklist;
50 DomTreeNode *Root = RootPair.first;
63 DomTreeNode *Node = Worklist.pop_back_val();
71 DomTreeNode *SuccNode = DT.getNode(Succ);
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...]
  /external/swiftshader/third_party/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);
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/
IteratedDominanceFrontier.cpp 27 typedef std::pair<DomTreeNode *, std::pair<unsigned, unsigned>>
36 if (DomTreeNode *Node = DT.getNode(BB))
40 SmallVector<DomTreeNode *, 32> Worklist;
41 SmallPtrSet<DomTreeNode *, 32> VisitedPQ;
42 SmallPtrSet<DomTreeNode *, 32> VisitedWorklist;
47 DomTreeNode *Root = RootPair.first;
60 DomTreeNode *Node = Worklist.pop_back_val();
65 DomTreeNode *SuccNode = DT.getNode(Succ);
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...]
  /external/swiftshader/third_party/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;
  /external/clang/include/clang/Analysis/Analyses/
Dominators.h 33 typedef llvm::DomTreeNodeBase<CFGBlock> DomTreeNode;
57 /// \brief This method returns the root DomTreeNode, which is the wrapper
59 inline DomTreeNode *getRootNode() const {
68 DomTreeNode *R = getRootNode();
69 DomTreeNode *OtherR = Other.getRootNode();
169 template <> struct GraphTraits< ::clang::DomTreeNode* > {
170 typedef ::clang::DomTreeNode NodeType;
183 typedef df_iterator< ::clang::DomTreeNode* > nodes_iterator;
185 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
189 static nodes_iterator nodes_end(::clang::DomTreeNode *N)
    [all...]
  /external/llvm/include/llvm/IR/
Dominators.h 41 typedef DomTreeNodeBase<BasicBlock> DomTreeNode;
115 const DomTreeNode *R = getRootNode();
116 const DomTreeNode *OtherR = Other.getRootNode();
178 struct GraphTraits<DomTreeNode *>
179 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
182 struct GraphTraits<const DomTreeNode *>
183 : public DomTreeGraphTraitsBase<const DomTreeNode,
184 DomTreeNode::const_iterator> {};
187 : public GraphTraits<DomTreeNode*> {
    [all...]
  /external/llvm/include/llvm/Analysis/
IteratedDominanceFrontier.h 89 DenseMap<DomTreeNode *, unsigned> DomLevels;
PostDominators.h 91 : public GraphTraits<DomTreeNode*> {
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/IR/
Dominators.h 72 using DomTreeNode = DomTreeNodeBase<BasicBlock>;
203 struct GraphTraits<DomTreeNode *>
204 : public DomTreeGraphTraitsBase<DomTreeNode, DomTreeNode::iterator> {};
207 struct GraphTraits<const DomTreeNode *>
208 : public DomTreeGraphTraitsBase<const DomTreeNode,
209 DomTreeNode::const_iterator> {};
212 : public GraphTraits<DomTreeNode*> {
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/
OrderedInstructions.cpp 48 DomTreeNode *DA = DT->getNode(InstA->getParent());
49 DomTreeNode *DB = DT->getNode(InstB->getParent());
BasicBlockUtils.cpp 200 if (DomTreeNode *DTN = DT->getNode(BB)) {
201 DomTreeNode *PredDTN = DT->getNode(PredBB);
202 SmallVector<DomTreeNode *, 8> Children(DTN->begin(), DTN->end());
203 for (DomTreeNode *DI : Children)
319 if (DomTreeNode *OldNode = DT->getNode(Old)) {
320 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end());
322 DomTreeNode *NewNode = DT->addNewBlock(New, Old);
323 for (DomTreeNode *I : Children)
705 if (DomTreeNode *OldNode = DT->getNode(Head)) {
706 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end())
    [all...]
  /external/llvm/lib/Transforms/Utils/
BreakCriticalEdges.cpp 213 DomTreeNode *TINode = DT->getNode(TIBB);
219 DomTreeNode *NewBBNode = DT->addNewBlock(NewBB, TIBB);
220 DomTreeNode *DestBBNode = nullptr;
226 if (DomTreeNode *OPNode = DT->getNode(OtherPreds.back()))
BasicBlockUtils.cpp 152 if (DomTreeNode *DTN = DT->getNode(BB)) {
153 DomTreeNode *PredDTN = DT->getNode(PredBB);
154 SmallVector<DomTreeNode *, 8> Children(DTN->begin(), DTN->end());
155 for (DomTreeNode *DI : Children)
266 if (DomTreeNode *OldNode = DT->getNode(Old)) {
267 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end());
269 DomTreeNode *NewNode = DT->addNewBlock(New, Old);
270 for (DomTreeNode *I : Children)
636 if (DomTreeNode *OldNode = DT->getNode(Head)) {
637 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end())
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/
PostDominators.h 97 : public GraphTraits<DomTreeNode*> {
  /external/swiftshader/third_party/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()))
  /external/llvm/lib/Transforms/Scalar/
EarlyCSE.cpp 347 CallHTType &AvailableCalls, unsigned cg, DomTreeNode *n,
348 DomTreeNode::iterator child, DomTreeNode::iterator end)
357 DomTreeNode *node() { return Node; }
358 DomTreeNode::iterator childIter() { return ChildIter; }
359 DomTreeNode *nextChild() {
360 DomTreeNode *child = *ChildIter;
364 DomTreeNode::iterator end() { return EndIter; }
375 DomTreeNode *Node;
376 DomTreeNode::iterator ChildIter
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Scalar/
EarlyCSE.cpp 447 unsigned cg, DomTreeNode *n, DomTreeNode::iterator child,
448 DomTreeNode::iterator end)
461 DomTreeNode *node() { return Node; }
462 DomTreeNode::iterator childIter() { return ChildIter; }
464 DomTreeNode *nextChild() {
465 DomTreeNode *child = *ChildIter;
470 DomTreeNode::iterator end() { return EndIter; }
477 DomTreeNode *Node;
478 DomTreeNode::iterator ChildIter
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Transforms/Utils/
LoopUtils.h 417 /// iteration. Takes DomTreeNode, AliasAnalysis, LoopInfo, DominatorTree,
421 bool sinkRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
430 /// Takes DomTreeNode, AliasAnalysis, LoopInfo, DominatorTree, DataLayout,
434 bool hoistRegion(DomTreeNode *, AliasAnalysis *, LoopInfo *, DominatorTree *,
470 SmallVector<DomTreeNode *, 16> collectChildrenInLoop(DomTreeNode *N,

Completed in 652 milliseconds

1 2 3 4