Home
last modified time | relevance | path

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

/art/compiler/optimizing/
Dreference_type_propagation_test.cc269 constexpr size_t kNumBlocks = 100; in RunVisitListTest() local
272 for (auto i : Range(kNumBlocks)) { in RunVisitListTest()
279 for (auto cur : Range(kNumBlocks)) { in RunVisitListTest()
280 for (auto nxt : Range(cur + 1, std::min(cur + 1 + kTestMaxSuccessors, kNumBlocks))) { in RunVisitListTest()
371 constexpr size_t kNumBlocks = 5000; in RunVisitListTest() local
374 for (auto i : Range(kNumBlocks)) { in RunVisitListTest()
381 for (auto cur : Range(kNumBlocks)) { in RunVisitListTest()
382 for (auto nxt : Range(cur + 1, std::min(cur + 1 + kTestMaxSuccessors, kNumBlocks))) { in RunVisitListTest()
Dexecution_subgraph_test.cc892 constexpr size_t kNumBlocks = ExecutionSubgraph::kMaxFilterableSuccessors + 1000; in TEST_F() local
894 for (auto i : Range(kNumBlocks)) { in TEST_F()
900 for (auto cur : Range(kNumBlocks)) { in TEST_F()
903 std::min(cur + ExecutionSubgraph::kMaxFilterableSuccessors + 1, kNumBlocks))) { in TEST_F()
917 ASSERT_EQ(contents.size(), kNumBlocks); in TEST_F()
923 constexpr size_t kNumBlocks = ExecutionSubgraph::kMaxFilterableSuccessors + 1000; in TEST_F() local
926 for (auto i : Range(kNumBlocks)) { in TEST_F()
932 for (auto cur : Range(kNumBlocks)) { in TEST_F()
933 for (auto nxt : Range(cur + 1, std::min(cur + 1 + kTestMaxSuccessors, kNumBlocks))) { in TEST_F()
941 constexpr size_t kToRemoveIdx = kNumBlocks / 2; in TEST_F()