Home
last modified time | relevance | path

Searched refs:mid_blocks (Results 1 – 2 of 2) sorted by relevance

/aosp12/art/compiler/optimizing/
H A Dexecution_subgraph_test.cc806 std::vector<std::string> mid_blocks; in TEST_F() local
840 mid_blocks.push_back(oss.str()); in TEST_F()
871 mid_blocks.push_back(oss.str()); in TEST_F()
897 mid_blocks.push_back(oss.str()); in TEST_F()
904 edges.emplace_back(mid_blocks[cur], mid_blocks[nxt]); in TEST_F()
907 AdjacencyListGraph blks(SetupFromAdjacencyList(mid_blocks.front(), mid_blocks.back(), edges)); in TEST_F()
929 mid_blocks.push_back(oss.str()); in TEST_F()
934 edges.emplace_back(mid_blocks[cur], mid_blocks[nxt]); in TEST_F()
937 edges.emplace_back(mid_blocks.front(), mid_blocks.back()); in TEST_F()
938 AdjacencyListGraph blks(SetupFromAdjacencyList(mid_blocks.front(), mid_blocks.back(), edges)); in TEST_F()
[all …]
H A Dreference_type_propagation_test.cc271 std::vector<std::string> mid_blocks; in RunVisitListTest() local
275 mid_blocks.push_back(oss.str()); in RunVisitListTest()
281 edges.emplace_back(mid_blocks[cur], mid_blocks[nxt]); in RunVisitListTest()
286 edges.emplace_back(mid_blocks.back(), mid_blocks.front()); in RunVisitListTest()
287 edges.emplace_back(mid_blocks.front(), "exit"); in RunVisitListTest()
320 auto range = MakeIterationRange(mid_blocks); in RunVisitListTest()
373 std::vector<std::string> mid_blocks; in RunVisitListTest() local
377 mid_blocks.push_back(oss.str()); in RunVisitListTest()
383 edges.emplace_back(mid_blocks[cur], mid_blocks[nxt]); in RunVisitListTest()
386 AdjacencyListGraph alg(graph_, GetAllocator(), mid_blocks.front(), mid_blocks.back(), edges); in RunVisitListTest()
[all …]