Home
last modified time | relevance | path

Searched refs:Edge (Results 1 – 5 of 5) sorted by relevance

/art/compiler/optimizing/
Dexecution_subgraph_test.cc85 const std::vector<AdjacencyListGraph::Edge>& adj) { in SetupFromAdjacencyList()
813 std::vector<AdjacencyListGraph::Edge> edges; in TEST_F()
842 std::vector<AdjacencyListGraph::Edge> edges; in TEST_F()
873 std::vector<AdjacencyListGraph::Edge> edges; in TEST_F()
899 std::vector<AdjacencyListGraph::Edge> edges; in TEST_F()
931 std::vector<AdjacencyListGraph::Edge> edges; in TEST_F()
967 std::vector<AdjacencyListGraph::Edge> edges; in TEST_F()
Doptimizing_unit_test.h143 using Edge = std::pair<const std::string_view, const std::string_view>;
149 const std::vector<Edge>& adj) : graph_(graph) { in AdjacencyListGraph()
400 const std::vector<AdjacencyListGraph::Edge>& adj) { in SetupFromAdjacencyList()
Dreference_type_propagation_test.cc280 std::vector<AdjacencyListGraph::Edge> edges; in RunVisitListTest()
382 std::vector<AdjacencyListGraph::Edge> edges; in RunVisitListTest()
Dload_store_analysis_test.cc50 const std::vector<AdjacencyListGraph::Edge>& adj) { in SetupFromAdjacencyList()
62 const std::vector<AdjacencyListGraph::Edge>& reach);
721 const std::vector<AdjacencyListGraph::Edge>& reach) { in CheckReachability()
733 AdjacencyListGraph::Edge { adj.GetName(blk), adj.GetName(other) }) != in CheckReachability()
/art/runtime/verifier/
Dreg_type_test.cc858 struct Edge { in TEST_F() struct
862 Edge(const RegType& from_, const RegType& to_) : from(from_), to(to_) {} in TEST_F() function
864 std::vector<Edge> edges; in TEST_F()
988 for (const Edge& edge : edges) { in TEST_F()
1013 for (Edge& e : edges) { in TEST_F()