Home
last modified time | relevance | path

Searched refs:AdjacencyListGraph (Results 1 – 6 of 6) sorted by relevance

/art/compiler/optimizing/
Doptimizing_unit_test.h142 class AdjacencyListGraph {
145 AdjacencyListGraph( in AdjacencyListGraph() function
185 AdjacencyListGraph(AdjacencyListGraph&&) = default;
186 AdjacencyListGraph(const AdjacencyListGraph&) = default;
187 AdjacencyListGraph& operator=(AdjacencyListGraph&&) = default;
188 AdjacencyListGraph& operator=(const AdjacencyListGraph&) = default;
193 explicit Namer(const AdjacencyListGraph& alg) : BlockNamer(), alg_(alg) {} in Dump()
202 const AdjacencyListGraph& alg_; in Dump()
383 AdjacencyListGraph SetupFromAdjacencyList(const std::string_view entry_name, in SetupFromAdjacencyList()
385 const std::vector<AdjacencyListGraph::Edge>& adj) { in SetupFromAdjacencyList()
[all …]
Dinstruction_simplifier_test.cc55 void PerformSimplification(const AdjacencyListGraph& blks) { in PerformSimplification()
151 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_P()
232 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", "exit", {{"entry", "exit"}})); in TEST_P()
Dreference_type_propagation_test.cc278 std::vector<AdjacencyListGraph::Edge> edges; in RunVisitListTest()
289 AdjacencyListGraph alg(graph_, GetAllocator(), "start", "exit", edges); in RunVisitListTest()
380 std::vector<AdjacencyListGraph::Edge> edges; in RunVisitListTest()
386 AdjacencyListGraph alg(graph_, GetAllocator(), mid_blocks.front(), mid_blocks.back(), edges); in RunVisitListTest()
Dload_store_elimination_test.cc79 void PerformLSE(const AdjacencyListGraph& blks) { in PerformLSE()
990 AdjacencyListGraph blocks( in TEST_F()
1041 AdjacencyListGraph blocks( in TEST_F()
1098 AdjacencyListGraph blocks(graph_, in TEST_F()
1227 AdjacencyListGraph blocks(graph_, in TEST_F()
1367 AdjacencyListGraph blocks(graph_, in TEST_F()
1462 AdjacencyListGraph blocks(graph_, in TEST_F()
1554 AdjacencyListGraph blocks(graph_, in TEST_F()
1648 AdjacencyListGraph blocks(graph_, in TEST_F()
1773 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F()
[all …]
Dnodes_test.cc40 AdjacencyListGraph alg(graph_, in TEST_F()
96 AdjacencyListGraph alg(graph_, in TEST_F()
Dload_store_analysis_test.cc46 AdjacencyListGraph SetupFromAdjacencyList( in SetupFromAdjacencyList()
49 const std::vector<AdjacencyListGraph::Edge>& adj) { in SetupFromAdjacencyList()
50 return AdjacencyListGraph(graph_, GetAllocator(), entry_name, exit_name, adj); in SetupFromAdjacencyList()
221 AdjacencyListGraph blks( in TEST_F()
725 AdjacencyListGraph blks(SetupFromAdjacencyList( in TEST_F()
829 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", "exit", { { "entry", "exit" } })); in TEST_F()
899 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F()
1082 AdjacencyListGraph blks(SetupFromAdjacencyList("entry", in TEST_F()