Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dexecution_subgraph_test.cc806 std::vector<std::string> mid_blocks; in TEST_F() local
810 mid_blocks.push_back(oss.str().c_str()); in TEST_F()
812 ASSERT_EQ(mid_blocks.size(), ExecutionSubgraph::kMaxFilterableSuccessors); in TEST_F()
814 for (const auto& mid : mid_blocks) { in TEST_F()
827 for (const auto& mid : mid_blocks) { in TEST_F()
836 std::vector<std::string> mid_blocks; in TEST_F() local
840 mid_blocks.push_back(oss.str()); in TEST_F()
843 for (const auto& mid : mid_blocks) { in TEST_F()
867 std::vector<std::string> mid_blocks; in TEST_F() local
871 mid_blocks.push_back(oss.str()); in TEST_F()
[all …]
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()
285 edges.emplace_back("start", mid_blocks.front()); in RunVisitListTest()
286 edges.emplace_back(mid_blocks.back(), mid_blocks.front()); in RunVisitListTest()
287 edges.emplace_back(mid_blocks.front(), "exit"); in RunVisitListTest()
310 single_value[alg.Get(mid_blocks.front())] = new_inst; 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()
[all …]