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

  /external/llvm/include/llvm/Support/
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::child_begin(BB))
    [all...]
  /external/llvm/lib/Analysis/
BlockFrequencyInfoImpl.cpp 587 typedef bfi_detail::IrreducibleGraph GraphT;
589 typedef const GraphT::IrrNode NodeType;
590 typedef GraphT::IrrNode::iterator ChildIteratorType;
592 static const NodeType *getEntryNode(const GraphT &G) {
CFLAliasAnalysis.cpp 714 typedef WeightedBidirectionalGraph<std::pair<EdgeType, StratifiedAttrs>> GraphT;
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()));
    [all...]

Completed in 4266 milliseconds