Searched refs:Indexes (Results 1 – 17 of 17) sorted by relevance
45 EXPECT_TRUE(bv.Indexes().begin().Done()); in TEST()46 EXPECT_TRUE(bv.Indexes().begin() == bv.Indexes().end()); in TEST()61 BitVector::IndexIterator iterator = bv.Indexes().begin(); in TEST()62 EXPECT_TRUE(iterator != bv.Indexes().end()); in TEST()65 EXPECT_TRUE(iterator != bv.Indexes().end()); in TEST()68 EXPECT_TRUE(iterator == bv.Indexes().end()); in TEST()306 auto indexs = bv.Indexes(); in TEST()
206 IndexContainer Indexes() const { in Indexes() function
178 auto idxs = entry_blocks_.Indexes(); in SucceedsBlock()191 auto idxs = exit_blocks_.Indexes(); in PrecedesBlock()201 auto indexes = bv.Indexes(); in BlockIterRange()259 auto idxs = unreachable_blocks_.Indexes(); in UnreachableBlocks()
250 if (std::any_of(unreachable_blocks_.Indexes().begin(), in RemoveConcavity()251 unreachable_blocks_.Indexes().end(), in RemoveConcavity()253 std::any_of(unreachable_blocks_.Indexes().begin(), in RemoveConcavity()254 unreachable_blocks_.Indexes().end(), in RemoveConcavity()
237 for (uint32_t orig_block_id : orig_bb_set_.Indexes()) { in CopyIncomingEdgesForVersioning()342 for (uint32_t idx : outer_loop_bb_set->Indexes()) { in RecalculateBackEdgesInfo()353 for (uint32_t idx : outer_loop_bb_set->Indexes()) { in RecalculateBackEdgesInfo()449 for (uint32_t block_id : orig_bb_set_.Indexes()) { in SearchForSubgraphExits()503 for (uint32_t orig_block_id : orig_bb_set_.Indexes()) { in RemapEdgesSuccessors()570 for (uint32_t idx : orig_bb_set_.Indexes()) { in CollectLiveOutsAndCheckClonable()799 for (uint32_t idx : set->Indexes()) { in DumpBBSet()806 for (uint32_t idx : orig_bb_set_.Indexes()) { in DumpInputSets()886 for (uint32_t idx : orig_bb_set_.Indexes()) { in IsFastCase()1099 for (uint32_t orig_block_id : work_set->Indexes()) { in IsSubgraphConnected()
203 for (uint32_t idx : live_in->Indexes()) { in ComputeLiveRanges()264 for (uint32_t idx : live_in->Indexes()) { in ComputeLiveRanges()
125 for (uint32_t exc : additional_exclusions.Indexes()) { in PrunePartialEscapeWrites()
159 for (uint32_t idx : live->Indexes()) { in Resolve()172 for (uint32_t idx : live->Indexes()) { in Resolve()
549 for (size_t block_id : visited_blocks_.Indexes()) { in FindVisitedBlockWithRecyclableSet()
1977 for (uint32_t phi_placeholder_index : visited.Indexes()) { in TryReplacingLoopPhiPlaceholderWithDefault()2034 for (uint32_t phi_placeholder_index : visited.Indexes()) { in TryReplacingLoopPhiPlaceholderWithSingleInput()2291 for (uint32_t marker_index : phi_placeholders_to_materialize.Indexes()) { in MaterializeLoopPhis()2351 for (uint32_t matrix_index : current_dependencies->Indexes()) { in MaterializeLoopPhis()2618 for (uint32_t index : phi_placeholders_to_search_for_kept_stores_.Indexes()) { in SearchPhiPlaceholdersForKeptStores()2970 auto idxs = heap_locs_.Indexes(); in IterateLocations()
762 for (uint32_t i : loop_blocks.Indexes()) { in HandleLoop()
1303 for (uint32_t idx : live_in->Indexes()) { in CheckNoLiveInIrreducibleLoop()
342 for (auto idx : not_post_order_visited_.Indexes()) { in CalculateReachability()804 for (uint32_t idx : blocks_.Indexes()) { in Dump()
7 Indexes are: 0:-1:0:43:33:-1:18:13:13:-1:18:18:-1:13:-1:-1:-1
338 for (uint32_t idx : types.Indexes()) { in Dump()988 for (uint32_t idx : unresolved_types_.Indexes()) { in CheckInvariants()
275 for (uint32_t idx : merge.GetUnresolvedTypes().Indexes()) { in AddAssignability()
2142 for (uint32_t index : indexes.Indexes()) { in CalculateNumberOfIndexBssMappingEntries()2825 for (uint32_t index : indexes.Indexes()) { in WriteIndexBssMapping()