HomeSort by relevance Sort by last modified time
    Searched refs:GraphT (Results 126 - 131 of 131) sorted by null

1 2 3 4 56

  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/
GenericDomTree.h 772 using GraphT = GraphTraits<N>;
773 using NodeRef = typename GraphT::NodeRef;
774 assert(std::distance(GraphT::child_begin(NewBB),
775 GraphT::child_end(NewBB)) == 1 &&
777 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/
GenericDomTree.h 772 using GraphT = GraphTraits<N>;
773 using NodeRef = typename GraphT::NodeRef;
774 assert(std::distance(GraphT::child_begin(NewBB),
775 GraphT::child_end(NewBB)) == 1 &&
777 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/
GenericDomTree.h 772 using GraphT = GraphTraits<N>;
773 using NodeRef = typename GraphT::NodeRef;
774 assert(std::distance(GraphT::child_begin(NewBB),
775 GraphT::child_end(NewBB)) == 1 &&
777 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/
GenericDomTree.h 772 using GraphT = GraphTraits<N>;
773 using NodeRef = typename GraphT::NodeRef;
774 assert(std::distance(GraphT::child_begin(NewBB),
775 GraphT::child_end(NewBB)) == 1 &&
777 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/
GenericDomTree.h 772 using GraphT = GraphTraits<N>;
773 using NodeRef = typename GraphT::NodeRef;
774 assert(std::distance(GraphT::child_begin(NewBB),
775 GraphT::child_end(NewBB)) == 1 &&
777 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
  /external/llvm/lib/Analysis/
BlockFrequencyInfoImpl.cpp 623 typedef bfi_detail::IrreducibleGraph GraphT;
625 typedef const GraphT::IrrNode NodeType;
626 typedef GraphT::IrrNode::iterator ChildIteratorType;
628 static const NodeType *getEntryNode(const GraphT &G) {

Completed in 339 milliseconds

1 2 3 4 56