HomeSort by relevance Sort by last modified time
    Searched defs:po_iterator (Results 1 - 3 of 3) sorted by null

  /external/llvm/include/llvm/ADT/
PostOrderIterator.h 52 class po_iterator : public std::iterator<std::forward_iterator_tag, class in namespace:llvm
73 inline po_iterator(NodeType *BB) { function in class:llvm::po_iterator
78 inline po_iterator() {} // End is when stack is empty. function in class:llvm::po_iterator
80 inline po_iterator(NodeType *BB, SetType &S) : function in class:llvm::po_iterator
88 inline po_iterator(SetType &S) : function in class:llvm::po_iterator
93 typedef po_iterator<GraphT, SetType, ExtStorage, GT> _Self;
136 po_iterator<T> po_begin(T G) { return po_iterator<T>::begin(G); }
138 po_iterator<T> po_end (T G) { return po_iterator<T>::end(G);
    [all...]
  /external/clang/lib/Analysis/
LiveVariables.cpp 25 // po_iterator requires this iterator, but the only interface needed is the
37 // Note that insert() is called by po_iterator, which doesn't check to make
60 typedef llvm::po_iterator<const CFG*, CFGBlockSet, true> po_iterator; typedef in class:__anon4253::TopologicallySortedCFG
75 for (po_iterator I = po_iterator::begin(CFGraph, BSet),
76 E = po_iterator::end(CFGraph, BSet); I != E; ++I) {
ThreadSafety.cpp 47 /// template parameter of the llvm::po_iterator template, as used with external
54 // po_iterator requires this iterator, but the only interface needed is the
66 // Note that insert() is called by po_iterator, which doesn't check to make
89 typedef llvm::po_iterator<const CFG*, CFGBlockSet, true> po_iterator; typedef in class:__anon4258::TopologicallySortedCFG
100 for (po_iterator I = po_iterator::begin(CFGraph, BSet),
101 E = po_iterator::end(CFGraph, BSet); I != E; ++I) {
    [all...]

Completed in 39 milliseconds