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

1 2 3 45 6

  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/
GenericDomTree.h 279 template <class N, class GraphT>
280 void Split(DominatorTreeBaseByGraphTraits<GraphT> &DT,
281 typename GraphT::NodeRef NewBB) {
282 assert(std::distance(GraphT::child_begin(NewBB),
283 GraphT::child_end(NewBB)) == 1 &&
285 typename GraphT::NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
287 std::vector<typename GraphT::NodeRef> PredBlocks;
690 template <class GraphT>
691 friend typename GraphT::NodeRe
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/
GenericDomTree.h 279 template <class N, class GraphT>
280 void Split(DominatorTreeBaseByGraphTraits<GraphT> &DT,
281 typename GraphT::NodeRef NewBB) {
282 assert(std::distance(GraphT::child_begin(NewBB),
283 GraphT::child_end(NewBB)) == 1 &&
285 typename GraphT::NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
287 std::vector<typename GraphT::NodeRef> PredBlocks;
690 template <class GraphT>
691 friend typename GraphT::NodeRe
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/XRay/
Graph.h 203 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
254 InOutEdgeView(GraphT &G, VertexIdentifier A)
279 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
282 GraphT &G;
293 VertexView(GraphT &_G) : G(_G) {}
316 using GraphT = typename std::conditional<isConst, const Graph, Graph>::type;
319 GraphT &G;
330 EdgeView(GraphT &_G) : G(_G) {}
  /external/llvm/include/llvm/Support/
GenericDomTree.h 253 template <class N, class GraphT>
254 void Split(DominatorTreeBase<typename GraphT::NodeType> &DT,
255 typename GraphT::NodeType *NewBB) {
256 assert(std::distance(GraphT::child_begin(NewBB),
257 GraphT::child_end(NewBB)) == 1 &&
259 typename GraphT::NodeType *NewBBSucc = *GraphT::child_begin(NewBB);
261 std::vector<typename GraphT::NodeType *> PredBlocks;
629 template <class GraphT>
630 friend typename GraphT::NodeType
    [all...]
  /external/swiftshader/third_party/LLVM/include/llvm/Analysis/
Dominators.h 226 template<class N, class GraphT>
227 void Split(DominatorTreeBase<typename GraphT::NodeType>& DT,
228 typename GraphT::NodeType* NewBB) {
229 assert(std::distance(GraphT::child_begin(NewBB),
230 GraphT::child_end(NewBB)) == 1 &&
232 typename GraphT::NodeType* NewBBSucc = *GraphT::child_begin(NewBB);
234 std::vector<typename GraphT::NodeType*> PredBlocks;
566 template<class GraphT>
567 friend typename GraphT::NodeType* Eval
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Support/
GenericDomTree.h 281 using GraphT = GraphTraits<N>;
282 using NodeRef = typename GraphT::NodeRef;
283 assert(std::distance(GraphT::child_begin(NewBB),
284 GraphT::child_end(NewBB)) == 1 &&
286 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
682 template <class GraphT>
683 friend typename GraphT::NodeRef
684 Eval(DominatorTreeBaseByGraphTraits<GraphT> &DT, typename GraphT::NodeRef V,
687 template <class GraphT>
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Support/
GenericDomTree.h 281 using GraphT = GraphTraits<N>;
282 using NodeRef = typename GraphT::NodeRef;
283 assert(std::distance(GraphT::child_begin(NewBB),
284 GraphT::child_end(NewBB)) == 1 &&
286 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
682 template <class GraphT>
683 friend typename GraphT::NodeRef
684 Eval(DominatorTreeBaseByGraphTraits<GraphT> &DT, typename GraphT::NodeRef V,
687 template <class GraphT>
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Support/
GenericDomTree.h 281 using GraphT = GraphTraits<N>;
282 using NodeRef = typename GraphT::NodeRef;
283 assert(std::distance(GraphT::child_begin(NewBB),
284 GraphT::child_end(NewBB)) == 1 &&
286 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
682 template <class GraphT>
683 friend typename GraphT::NodeRef
684 Eval(DominatorTreeBaseByGraphTraits<GraphT> &DT, typename GraphT::NodeRef V,
687 template <class GraphT>
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Support/
GenericDomTree.h 281 using GraphT = GraphTraits<N>;
282 using NodeRef = typename GraphT::NodeRef;
283 assert(std::distance(GraphT::child_begin(NewBB),
284 GraphT::child_end(NewBB)) == 1 &&
286 NodeRef NewBBSucc = *GraphT::child_begin(NewBB);
682 template <class GraphT>
683 friend typename GraphT::NodeRef
684 Eval(DominatorTreeBaseByGraphTraits<GraphT> &DT, typename GraphT::NodeRef V,
687 template <class GraphT>
    [all...]
  /prebuilts/clang/host/darwin-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/darwin-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/darwin-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);

Completed in 1196 milliseconds

1 2 3 45 6