Home
last modified time | relevance | path

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

/art/runtime/base/
Darena_bit_vector.h31 class ArenaBitVector : public BitVector, public ArenaObject<kArenaAllocGrowableBitMap> {
34 static ArenaBitVector* Create(Allocator* arena,
38 void* storage = arena->template Alloc<ArenaBitVector>(kind);
39 return new (storage) ArenaBitVector(arena, start_bits, expandable, kind);
42 ArenaBitVector(ArenaAllocator* arena,
46 ArenaBitVector(ScopedArenaAllocator* arena,
50 ~ArenaBitVector() {} in ~ArenaBitVector()
53 DISALLOW_COPY_AND_ASSIGN(ArenaBitVector);
Darena_bit_vector.cc80 ArenaBitVector::ArenaBitVector(ArenaAllocator* arena, in ArenaBitVector() function in art::ArenaBitVector
89 ArenaBitVector::ArenaBitVector(ScopedArenaAllocator* arena, in ArenaBitVector() function in art::ArenaBitVector
Darena_allocator_test.cc38 ArenaBitVector bv(&arena, 10, true); in TEST_F()
/art/compiler/optimizing/
Dcode_sinking.cc111 const ArenaBitVector& processed_instructions, in AddInstruction()
112 const ArenaBitVector& discard_blocks, in AddInstruction()
124 const ArenaBitVector& processed_instructions, in AddInputs()
125 const ArenaBitVector& discard_blocks, in AddInputs()
133 const ArenaBitVector& processed_instructions, in AddInputs()
134 const ArenaBitVector& discard_blocks, in AddInputs()
146 const ArenaBitVector& post_dominated) { in ShouldFilterUse()
166 const ArenaBitVector& post_dominated, in FindIdealPosition()
246 ArenaBitVector processed_instructions(&allocator, number_of_instructions, /* expandable */ false); in SinkCodeToUncommonBranch()
247 ArenaBitVector post_dominated(&allocator, graph_->GetBlocks().size(), /* expandable */ false); in SinkCodeToUncommonBranch()
[all …]
Dgraph_checker.h107 ArenaBitVector seen_ids_;
111 ArenaBitVector visited_storage_;
Dlicm.cc85 ArenaBitVector* visited = nullptr; in Run()
87 visited = new (graph_->GetArena()) ArenaBitVector(graph_->GetArena(), in Run()
Dstack_map_test.cc53 ArenaBitVector sp_mask(&arena, 0, false); in TEST()
135 ArenaBitVector sp_mask1(&arena, 0, true); in TEST()
149 ArenaBitVector sp_mask2(&arena, 0, true); in TEST()
157 ArenaBitVector sp_mask3(&arena, 0, true); in TEST()
165 ArenaBitVector sp_mask4(&arena, 0, true); in TEST()
419 ArenaBitVector sp_mask1(&arena, 0, true); in TEST()
512 ArenaBitVector sp_mask(&arena, 0, false); in TEST()
591 ArenaBitVector sp_mask(&arena, 0, false); in TEST()
654 ArenaBitVector sp_mask(&arena, 0, false); in TEST()
712 ArenaBitVector sp_mask(&arena, 0, false); in TEST()
[all …]
Dregister_allocator.cc101 ArenaVector<ArenaBitVector*> liveness_of_values( in ValidateIntervals()
116 ArenaBitVector::Create(allocator, max_end, false, kArenaAllocRegisterAllocatorValidate)); in ValidateIntervals()
Dlocations.cc47 stack_mask_ = ArenaBitVector::Create(arena, 0, true, kArenaAllocLocationSummary); in LocationSummary()
Ddead_code_elimination.cc26 static void MarkReachableBlocks(HGraph* graph, ArenaBitVector* visited) { in MarkReachableBlocks()
310 ArenaBitVector live_blocks(allocator, graph_->GetBlocks().size(), false, kArenaAllocDCE); in RemoveDeadBlocks()
Dssa_phi_elimination.cc126 ArenaBitVector visited_phis_in_cycle(graph_->GetArena(), in Run()
Dgvn.cc338 ArenaBitVector buckets_owned_;
403 ArenaBitVector visited_blocks_;
Dstack_map_stream.cc46 ? ArenaBitVector::Create(allocator_, num_dex_registers, true, kArenaAllocStackMapStream) in BeginStackMapEntry()
124 ? ArenaBitVector::Create(allocator_, num_dex_registers, true, kArenaAllocStackMapStream) in BeginInlineInfoEntry()
347 ArenaBitVector empty_bitmask(allocator_, 0, /* expandable */ false, kArenaAllocStackMapStream); in FillInCodeInfo()
Dinstruction_builder.h88 void FindNativeDebugInfoLocations(ArenaBitVector* locations);
Dssa_liveness_analysis.h48 ArenaBitVector live_in_;
49 ArenaBitVector live_out_;
50 ArenaBitVector kill_;
Dnodes.cc54 void HGraph::FindBackEdges(ArenaBitVector* visited) { in FindBackEdges()
59 ArenaBitVector visiting(arena_, blocks_.size(), false, kArenaAllocGraphBuilder); in FindBackEdges()
110 void HGraph::RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const { in RemoveInstructionsAsUsersFromDeadBlocks()
123 void HGraph::RemoveDeadBlocks(const ArenaBitVector& visited) { in RemoveDeadBlocks()
146 ArenaBitVector visited(arena_, blocks_.size(), false, kArenaAllocGraphBuilder); in BuildDominatorTree()
601 void HLoopInformation::PopulateIrreducibleRecursive(HBasicBlock* block, ArenaBitVector* finalized) { in PopulateIrreducibleRecursive()
664 ArenaBitVector visited(graph->GetArena(), in Populate()
Dload_store_analysis.h516 ArenaBitVector aliasing_matrix_; // aliasing info between each pair of locations.
Dgraph_checker.cc613 const ArenaBitVector& loop_blocks = loop_information->GetBlocks(); in HandleLoop()
834 ArenaBitVector& visited = visited_storage_; in VisitPhi()
Dinstruction_builder.cc279 ArenaBitVector* native_debug_info_locations = nullptr; in Build()
282 native_debug_info_locations = new (arena_) ArenaBitVector (arena_, num_instructions, false); in Build()
364 void HInstructionBuilder::FindNativeDebugInfoLocations(ArenaBitVector* locations) { in FindNativeDebugInfoLocations()
369 static_cast<ArenaBitVector*>(ctx)->SetBit(entry.address_); in FindNativeDebugInfoLocations()
Dcode_generator.cc934 ArenaBitVector* stack_mask = in RecordCatchBlockInfo()
935 ArenaBitVector::Create(arena, 0, /* expandable */ true, kArenaAllocCodeGenerator); in RecordCatchBlockInfo()
Dnodes.h373 void FindBackEdges(ArenaBitVector* visited);
598 void RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const;
599 void RemoveDeadBlocks(const ArenaBitVector& visited);
820 const ArenaBitVector& GetBlocks() const { return blocks_; } in GetBlocks()
842 void PopulateIrreducibleRecursive(HBasicBlock* block, ArenaBitVector* finalized);
849 ArenaBitVector blocks_;
Dregister_allocator_graph_color.cc1991 ArenaBitVector taken(allocator_, 0, true); in ColorSpillSlots()
/art/runtime/verifier/
Dreg_type_cache.cc352 ArenaBitVector types(&arena_, in FromUnresolvedMerge()
Dreg_type.h41 class ArenaBitVector; variable