Home
last modified time | relevance | path

Searched refs:ArenaBitVector (Results 1 – 25 of 31) sorted by relevance

12

/art/libartbase/base/
Darena_bit_vector.h32 class ArenaBitVector : public BitVector, public ArenaObject<kArenaAllocGrowableBitMap> {
35 static ArenaBitVector* Create(Allocator* allocator,
39 void* storage = allocator->template Alloc<ArenaBitVector>(kind);
40 return new (storage) ArenaBitVector(allocator, start_bits, expandable, kind);
43 ArenaBitVector(ArenaAllocator* allocator,
47 ArenaBitVector(ScopedArenaAllocator* allocator,
51 ~ArenaBitVector() {} in ~ArenaBitVector()
53 ArenaBitVector(ArenaBitVector&&) = default;
54 ArenaBitVector(const ArenaBitVector&) = delete;
67 explicit ArenaBitVectorArray(ArenaBitVector&& bv) : BaseBitVectorArray(), data_(std::move(bv)) {} in ArenaBitVectorArray()
[all …]
Darena_bit_vector.cc80 ArenaBitVector::ArenaBitVector(ArenaAllocator* allocator, in ArenaBitVector() function in art::ArenaBitVector
89 ArenaBitVector::ArenaBitVector(ScopedArenaAllocator* allocator, in ArenaBitVector() function in art::ArenaBitVector
Dbit_vector.h30 class ArenaBitVector; variable
Darena_allocator_test.cc40 ArenaBitVector bv(&allocator, 10, true); in TEST_F()
/art/compiler/optimizing/
Dcode_sinking.cc151 const ArenaBitVector& processed_instructions, in AddInstruction()
152 const ArenaBitVector& discard_blocks, in AddInstruction()
164 const ArenaBitVector& processed_instructions, in AddInputs()
165 const ArenaBitVector& discard_blocks, in AddInputs()
173 const ArenaBitVector& processed_instructions, in AddInputs()
174 const ArenaBitVector& discard_blocks, in AddInputs()
186 const ArenaBitVector& post_dominated) { in ShouldFilterUse()
205 const ArenaBitVector& post_dominated, in FindIdealPosition()
334ArenaBitVector processed_instructions(&allocator, number_of_instructions, /* expandable= */ false); in SinkCodeToUncommonBranch()
336 ArenaBitVector post_dominated(&allocator, graph_->GetBlocks().size(), /* expandable= */ false); in SinkCodeToUncommonBranch()
[all …]
Dexecution_subgraph.h201 BitVecBlockRange BlockIterRange(const ArenaBitVector& bv) const { in BlockIterRange()
210 ArenaBitVector entry_blocks_;
211 ArenaBitVector exit_blocks_;
212 ArenaBitVector blocks_;
342 ArenaBitVector unreachable_blocks_;
Dsuperblock_cloner.h142 using HBasicBlockSet = ArenaBitVector;
318 void FindBackEdgesLocal(HBasicBlock* entry_block, ArenaBitVector* local_set);
319 void RecalculateBackEdgesInfo(ArenaBitVector* outer_loop_bb_set);
320 GraphAnalysisResult AnalyzeLoopsLocally(ArenaBitVector* outer_loop_bb_set);
Dstack_map_test.cc63 ArenaBitVector sp_mask(&allocator, 0, false); in TEST()
123 ArenaBitVector sp_mask1(&allocator, 0, true); in TEST()
137 ArenaBitVector sp_mask2(&allocator, 0, true); in TEST()
145 ArenaBitVector sp_mask3(&allocator, 0, true); in TEST()
153 ArenaBitVector sp_mask4(&allocator, 0, true); in TEST()
322 ArenaBitVector sp_mask1(&allocator, 0, true); in TEST()
389 ArenaBitVector sp_mask(&allocator, 0, false); in TEST()
442 ArenaBitVector sp_mask(&allocator, 0, false); in TEST()
503 ArenaBitVector sp_mask(&allocator, 0, false); in TEST()
554 ArenaBitVector sp_mask1(&allocator, 0, true); in TEST()
[all …]
Dlicm.cc86 ArenaBitVector* visited = nullptr; in Run()
88 visited = new (graph_->GetAllocator()) ArenaBitVector(graph_->GetAllocator(), in Run()
Dsuperblock_cloner.cc273 void SuperblockCloner::FindBackEdgesLocal(HBasicBlock* entry_block, ArenaBitVector* local_set) { in FindBackEdgesLocal()
274 ArenaBitVector visited(arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in FindBackEdgesLocal()
279 ArenaBitVector visiting(arena_, graph_->GetBlocks().size(), false, kArenaAllocGraphBuilder); in FindBackEdgesLocal()
318 void SuperblockCloner::RecalculateBackEdgesInfo(ArenaBitVector* outer_loop_bb_set) { in RecalculateBackEdgesInfo()
365 GraphAnalysisResult SuperblockCloner::AnalyzeLoopsLocally(ArenaBitVector* outer_loop_bb_set) { in AnalyzeLoopsLocally()
403 ArenaBitVector outer_loop_bb_set( in CleanUpControlFlow()
534 ArenaBitVector outer_loop_bb_set( in AdjustControlFlowInfo()
798 void DumpBBSet(const ArenaBitVector* set) { in DumpBBSet()
Dregister_allocator.cc108 ScopedArenaVector<ArenaBitVector*> liveness_of_values( in ValidateIntervals()
123 ArenaBitVector::Create(&allocator, max_end, false, kArenaAllocRegisterAllocatorValidate)); in ValidateIntervals()
Dlocations.cc46 stack_mask_ = ArenaBitVector::Create(allocator, 0, true, kArenaAllocLocationSummary); in LocationSummary()
Dload_store_analysis.cc103 ArenaBitVector additional_exclusions( in PrunePartialEscapeWrites()
154 ArenaBitVector seen_instructions(&saa, graph->GetCurrentInstructionId(), false, kArenaAllocLSA); in CollectPartialEscapes()
Dload_store_elimination.cc936 /*inout*/ ArenaBitVector* phi_placeholders_to_materialize);
939 /*inout*/ ArenaBitVector* phi_placeholders_to_materialize);
942 /*out*/ ArenaBitVector* phi_placeholders_to_materialize,
948 bool MaterializeLoopPhis(const ArenaBitVector& phi_placeholders_to_materialize,
1402 ArenaBitVector kept_stores_;
1405 ArenaBitVector phi_placeholders_to_search_for_kept_stores_;
1428 ArenaBitVector kept_merged_unknowns_;
2040 /*inout*/ ArenaBitVector* phi_placeholders_to_materialize) { in TryReplacingLoopPhiPlaceholderWithDefault()
2043 ArenaBitVector visited(&allocator, in TryReplacingLoopPhiPlaceholderWithDefault()
2130 /*inout*/ ArenaBitVector* phi_placeholders_to_materialize) { in TryReplacingLoopPhiPlaceholderWithSingleInput()
[all …]
Dgraph_checker.h130 ArenaBitVector seen_ids_;
Dexecution_subgraph.cc96 ArenaBitVector visiting(&temporaries, num_blocks, false, kArenaAllocLSA); in Prune()
267 ArenaBitVector unreachable(allocator_, graph_->GetBlocks().size(), false, kArenaAllocLSA); in RecalculateExcludedCohort()
Dinstruction_builder.h33 class ArenaBitVector; variable
73 ArenaBitVector* FindNativeDebugInfoLocations();
Dstack_map_stream.h158 ArenaBitVector temp_dex_register_mask_;
Dgvn.cc341 ArenaBitVector buckets_owned_;
407 ArenaBitVector visited_blocks_;
Dssa_phi_elimination.cc142 ArenaBitVector visited_phis_in_cycle(&allocator, in Run()
Dnodes.cc63 void HGraph::FindBackEdges(ArenaBitVector* visited) { in FindBackEdges()
70 ArenaBitVector visiting( in FindBackEdges()
153 void HGraph::RemoveDeadBlocksInstructionsAsUsersAndDisconnect(const ArenaBitVector& visited) const { in RemoveDeadBlocksInstructionsAsUsersAndDisconnect()
191 void HGraph::RemoveDeadBlocks(const ArenaBitVector& visited) { in RemoveDeadBlocks()
218 ArenaBitVector visited(&allocator, blocks_.size(), false, kArenaAllocGraphBuilder); in BuildDominatorTree()
396 ArenaBitVector discovered( in CalculateConnectednessOn()
439 ArenaBitVector all_visited_nodes_;
441 ArenaBitVector not_post_order_visited_;
978 void HLoopInformation::PopulateIrreducibleRecursive(HBasicBlock* block, ArenaBitVector* finalized) { in PopulateIrreducibleRecursive()
1043 ArenaBitVector visited(&allocator, in Populate()
[all …]
Dsuperblock_cloner_test.cc159 ArenaBitVector orig_bb_set( in TEST_F()
240 ArenaBitVector orig_bb_set( in TEST_F()
636 ArenaBitVector orig_bb_set( in TEST_F()
Ddead_code_elimination.cc31 static void MarkReachableBlocks(HGraph* graph, ArenaBitVector* visited) { in MarkReachableBlocks()
784 ArenaBitVector live_blocks(&allocator, graph_->GetBlocks().size(), false, kArenaAllocDCE); in RemoveDeadBlocks()
Dssa_liveness_analysis.h51 ArenaBitVector live_in_;
52 ArenaBitVector live_out_;
53 ArenaBitVector kill_;
Dload_store_analysis.h643 ArenaBitVector aliasing_matrix_; // aliasing info between each pair of locations.

12