Searched defs:GraphT (Results 1 - 3 of 3) sorted by relevance
/external/llvm/include/llvm/Support/ |
H A D | GenericDomTreeConstruction.h | 33 template<class GraphT> 34 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT, 35 typename GraphT::NodeType* V, unsigned N) { 56 SmallVector<std::pair<typename GraphT::NodeType*, 57 typename GraphT::ChildIteratorType>, 32> Worklist; 58 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V))); 60 typename GraphT::NodeType* BB = Worklist.back().first; 61 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second; 63 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo = 67 if (NextSucc == GraphT 153 typedef GraphTraits<NodeT> GraphT; typedef [all...] |
/external/llvm/lib/Analysis/ |
H A D | BlockFrequencyInfoImpl.cpp | 587 typedef bfi_detail::IrreducibleGraph GraphT; typedef in struct:llvm::GraphTraits 589 typedef const GraphT::IrrNode NodeType; 590 typedef GraphT::IrrNode::iterator ChildIteratorType; 592 static const NodeType *getEntryNode(const GraphT &G) {
|
H A D | CFLAliasAnalysis.cpp | 714 typedef WeightedBidirectionalGraph<std::pair<EdgeType, StratifiedAttrs>> GraphT; typedef in namespace:__anon10328 715 typedef DenseMap<Value *, GraphT::Node> NodeMapT; 752 SmallVectorImpl<Value *> &, NodeMapT &, GraphT &); 768 GraphT &); 896 NodeMapT &Map, GraphT &Graph) { 898 auto Pair = Map.insert(std::make_pair(Val, GraphT::Node())); 959 NodeMapT &Map, GraphT &Graph) { 989 GraphT Graph; 994 DenseMap<GraphT::Node, Value *> NodeValueMap; 999 const auto findValueOrDie = [&NodeValueMap](GraphT [all...] |
Completed in 159 milliseconds