Searched refs:nxt (Results 1 – 4 of 4) sorted by relevance
| /art/compiler/optimizing/ |
| D | execution_subgraph.cc | 205 const HBasicBlock* nxt = cur_block->GetSuccessors()[*cur_succ]; in Prune() local
206 DCHECK(nxt != nullptr) << "id: " << *cur_succ in Prune()
208 if (visiting.IsBitSet(nxt->GetBlockId())) { in Prune()
215 push_block(nxt); in Prune()
|
| D | reference_type_propagation_test.cc | 280 for (auto nxt : Range(cur + 1, std::min(cur + 1 + kTestMaxSuccessors, kNumBlocks))) { in RunVisitListTest() local
281 edges.emplace_back(mid_blocks[cur], mid_blocks[nxt]); in RunVisitListTest()
382 for (auto nxt : Range(cur + 1, std::min(cur + 1 + kTestMaxSuccessors, kNumBlocks))) { in RunVisitListTest() local
383 edges.emplace_back(mid_blocks[cur], mid_blocks[nxt]); in RunVisitListTest()
|
| D | execution_subgraph_test.cc | 901 for (auto nxt : in TEST_F() local
904 edges.emplace_back(mid_blocks[cur], mid_blocks[nxt]); in TEST_F()
933 for (auto nxt : Range(cur + 1, std::min(cur + 1 + kTestMaxSuccessors, kNumBlocks))) { in TEST_F() local
934 edges.emplace_back(mid_blocks[cur], mid_blocks[nxt]); in TEST_F()
|
| /art/libartbase/base/ |
| D | stl_util.h | 340 size_t nxt = sv_.find(split_on_, cur_index_);
341 if (nxt == std::string_view::npos) {
344 cur_index_ = nxt + 1;
|