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

  /external/llvm/include/llvm/Support/
GenericDomTreeConstruction.h 32 template<class GraphT>
33 unsigned DFSPass(DominatorTreeBase<typename GraphT::NodeType>& DT,
34 typename GraphT::NodeType* V, unsigned N) {
55 SmallVector<std::pair<typename GraphT::NodeType*,
56 typename GraphT::ChildIteratorType>, 32> Worklist;
57 Worklist.push_back(std::make_pair(V, GraphT::child_begin(V)));
59 typename GraphT::NodeType* BB = Worklist.back().first;
60 typename GraphT::ChildIteratorType NextSucc = Worklist.back().second;
62 typename DominatorTreeBase<typename GraphT::NodeType>::InfoRec &BBInfo =
66 if (NextSucc == GraphT::child_begin(BB))
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/Analysis/
DominatorInternals.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/swiftshader/third_party/llvm-7.0/llvm/unittests/XRay/
GraphTest.cpp 26 typedef Graph<VAttr, EAttr, unsigned> GraphT;
27 typedef typename GraphT::VertexIdentifier VI;
28 typedef typename GraphT::EdgeIdentifier EI;
58 typedef ::testing::Types<GraphT, const GraphT> GraphTestTypes;
60 using VVT = typename GraphT::VertexValueType;
61 using EVT = typename GraphT::EdgeValueType;
183 GraphT MG;
184 const GraphT &G = MG;
200 GraphT MG
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/tools/llvm-xray/
xray-graph.h 85 class GraphT : public Graph<FunctionStats, CallStats, int32_t> {
91 GraphT G;
164 const GraphT &getGraph() { return G; }
  /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 2208 milliseconds