Home
last modified time | relevance | path

Searched refs:Indexes (Results 1 – 7 of 7) sorted by relevance

/art/runtime/base/
Dbit_vector_test.cc41 EXPECT_TRUE(bv.Indexes().begin().Done()); in TEST()
42 EXPECT_TRUE(bv.Indexes().begin() == bv.Indexes().end()); in TEST()
57 BitVector::IndexIterator iterator = bv.Indexes().begin(); in TEST()
58 EXPECT_TRUE(iterator != bv.Indexes().end()); in TEST()
61 EXPECT_TRUE(iterator != bv.Indexes().end()); in TEST()
64 EXPECT_TRUE(iterator == bv.Indexes().end()); in TEST()
Dbit_vector.h186 IndexContainer Indexes() const { in Indexes() function
/art/compiler/dex/
Dssa_transformation.cc141 for (uint32_t idx : bb->data_flow_info->def_v->Indexes()) { in FillDefBlockMatrix()
195 work_stack.push_back(std::make_pair(bb, bb->i_dominated->Indexes().begin())); in ComputeDomPostOrderTraversal()
208 work_stack.push_back(std::make_pair(new_bb, new_bb->i_dominated->Indexes().begin())); in ComputeDomPostOrderTraversal()
260 for (uint32_t dominated_idx : bb->i_dominated->Indexes()) { in ComputeDominanceFrontier()
262 for (uint32_t df_up_block_idx : dominated_bb->dom_frontier->Indexes()) { in ComputeDominanceFrontier()
515 for (uint32_t idx : input_blocks->Indexes()) { in InsertPhiNodes()
527 for (uint32_t idx : phi_blocks->Indexes()) { in InsertPhiNodes()
Dmir_graph.cc1686 for (BasicBlockId candidate_id : loop_exit_blocks.Indexes()) { in ComputeTopologicalSortOrder()
/art/test/020-string/
Dexpected.txt7 Indexes are: 0:-1:0:43:33:-1:18:13:13:-1:18:18:-1:13:-1:-1:-1
/art/compiler/optimizing/
Dssa_liveness_analysis.cc190 for (uint32_t idx : live_in->Indexes()) { in ComputeLiveRanges()
246 for (uint32_t idx : live_in->Indexes()) { in ComputeLiveRanges()
Dregister_allocator.cc955 for (uint32_t idx : live->Indexes()) { in Resolve()