| /art/compiler/utils/ |
| D | arena_bit_vector.h | 51 class ArenaBitVector : public BitVector, public ArenaObject<kArenaAllocGrowableBitMap> {
53 ArenaBitVector(ArenaAllocator* arena, uint32_t start_bits, bool expandable,
55 ArenaBitVector(ScopedArenaAllocator* arena, uint32_t start_bits, bool expandable,
57 ~ArenaBitVector() {} in ~ArenaBitVector()
62 DISALLOW_COPY_AND_ASSIGN(ArenaBitVector);
|
| D | arena_bit_vector.cc | 42 ArenaBitVector::ArenaBitVector(ArenaAllocator* arena, unsigned int start_bits, in ArenaBitVector() function in art::ArenaBitVector
49 ArenaBitVector::ArenaBitVector(ScopedArenaAllocator* arena, unsigned int start_bits, in ArenaBitVector() function in art::ArenaBitVector
|
| D | arena_allocator_test.cc | 26 ArenaBitVector bv(&arena, 10, true); in TEST()
|
| /art/compiler/dex/ |
| D | ssa_transformation.cc | 141 temp_scoped_alloc_->AllocArray<ArenaBitVector*>(num_registers, kArenaAllocDFInfo); in ComputeDefBlockMatrix()
146 temp_.ssa.def_block_matrix[i] = new (temp_scoped_alloc_.get()) ArenaBitVector( in ComputeDefBlockMatrix()
178 ScopedArenaVector<std::pair<BasicBlock*, ArenaBitVector::IndexIterator>> work_stack( in ComputeDomPostOrderTraversal()
183 std::pair<BasicBlock*, ArenaBitVector::IndexIterator>* curr = &work_stack.back(); in ComputeDomPostOrderTraversal()
185 ArenaBitVector::IndexIterator* curr_idom_iter = &curr->second; in ComputeDomPostOrderTraversal()
251 bb->dominators = new (arena_) ArenaBitVector(arena_, num_total_blocks, in InitializeDominationInfo()
253 bb->i_dominated = new (arena_) ArenaBitVector(arena_, num_total_blocks, in InitializeDominationInfo()
255 bb->dom_frontier = new (arena_) ArenaBitVector(arena_, num_total_blocks, in InitializeDominationInfo()
413 void MIRGraph::ComputeSuccLineIn(ArenaBitVector* dest, const ArenaBitVector* src1, in ComputeSuccLineIn()
414 const ArenaBitVector* src2) { in ComputeSuccLineIn()
[all …]
|
| D | mir_graph.h | 215 ArenaBitVector* use_v;
216 ArenaBitVector* def_v;
217 ArenaBitVector* live_in_v;
404 ArenaBitVector* dominators;
405 ArenaBitVector* i_dominated; // Set nodes being immediately dominated.
406 ArenaBitVector* dom_frontier; // Dominance frontier.
618 ArenaBitVector* GetTryBlockAddr() const { in GetTryBlockAddr()
1278 void ComputeSuccLineIn(ArenaBitVector* dest, const ArenaBitVector* src1,
1279 const ArenaBitVector* src2);
1280 void HandleLiveInUse(ArenaBitVector* use_v, ArenaBitVector* def_v,
[all …]
|
| D | gvn_dead_code_elimination.h | 26 class ArenaBitVector; variable
160 ArenaBitVector* unused_vregs_; // vregs that are not needed later.
161 ArenaBitVector* vregs_to_kill_; // vregs that revert to a previous value.
164 ArenaBitVector* dependent_vregs_;
|
| D | mir_dataflow.cc | 911 void MIRGraph::HandleLiveInUse(ArenaBitVector* use_v, ArenaBitVector* def_v, in HandleLiveInUse()
912 ArenaBitVector* live_in_v, int dalvik_reg_id) { in HandleLiveInUse()
920 void MIRGraph::HandleDef(ArenaBitVector* def_v, int dalvik_reg_id) { in HandleDef()
924 void MIRGraph::HandleExtended(ArenaBitVector* use_v, ArenaBitVector* def_v, in HandleExtended()
925 ArenaBitVector* live_in_v, in HandleExtended()
987 ArenaBitVector *use_v, *def_v, *live_in_v; in FindLocalLiveIn()
992 new (arena_) ArenaBitVector(arena_, GetNumOfCodeAndTempVRs(), false, kBitMapUse); in FindLocalLiveIn()
994 new (arena_) ArenaBitVector(arena_, GetNumOfCodeAndTempVRs(), false, kBitMapDef); in FindLocalLiveIn()
996 new (arena_) ArenaBitVector(arena_, GetNumOfCodeAndTempVRs(), false, kBitMapLiveIn); in FindLocalLiveIn()
|
| D | mir_graph.cc | 144 try_block_addr_ = new (arena_) ArenaBitVector(arena_, 0, true /* expandable */); in MIRGraph()
596 int width, int flags, ArenaBitVector* try_block_addr, in ProcessCanThrow()
1788 is_constant_v_ = new (arena_) ArenaBitVector(arena_, GetNumSSARegs(), false); in InitializeConstantPropagation()
1807 temp_.ssa.work_live_vregs = new (temp_scoped_alloc_.get()) ArenaBitVector( in SSATransformationStart()
1859 MIRGraph* mir_graph, const ArenaBitVector* current_loop, in SelectTopologicalSortOrderFallBack()
1868 ArenaBitVector candidate_reachable(allocator, mir_graph->GetNumBlocks(), false, kBitMapMisc); in SelectTopologicalSortOrderFallBack()
1913 ArenaBitVector* reachable, in ComputeUnvisitedReachableFrom()
1943 ArenaBitVector loop_exit_blocks(&allocator, num_blocks, false, kBitMapMisc); in ComputeTopologicalSortOrder()
1975 ScopedArenaVector<ArenaBitVector*> loop_head_reachable_from(allocator.Adapter()); in ComputeTopologicalSortOrder()
1994 ArenaBitVector* reachable = in ComputeTopologicalSortOrder()
[all …]
|
| D | type_inference.h | 27 class ArenaBitVector; variable
367 ArenaBitVector* def_phi_blocks_; // Indexed by BasicBlock::id.
|
| D | mir_optimization.cc | 927 temp_.nce.work_vregs_to_check = new (temp_scoped_alloc_.get()) ArenaBitVector( in EliminateNullChecksGate()
930 temp_scoped_alloc_->AllocArray<ArenaBitVector*>(GetNumBlocks(), kArenaAllocMisc); in EliminateNullChecksGate()
954 ArenaBitVector* vregs_to_check = temp_.nce.work_vregs_to_check; in EliminateNullChecks()
1089 ArenaBitVector* old_ending_ssa_regs_to_check = temp_.nce.ending_vregs_to_check_matrix[bb->id]; in EliminateNullChecks()
1095 temp_.nce.work_vregs_to_check = new (temp_scoped_alloc_.get()) ArenaBitVector( in EliminateNullChecks()
1238 temp_.cice.work_classes_to_check = new (temp_scoped_alloc_.get()) ArenaBitVector( in EliminateClassInitChecksGate()
1241 temp_scoped_alloc_->AllocArray<ArenaBitVector*>(GetNumBlocks(), kArenaAllocMisc); in EliminateClassInitChecksGate()
1261 ArenaBitVector* classes_to_check = temp_.cice.work_classes_to_check; in EliminateClassInitChecks()
1329 ArenaBitVector* old_ending_classes_to_check = temp_.cice.ending_classes_to_check_matrix[bb->id]; in EliminateClassInitChecks()
1335 temp_.cice.work_classes_to_check = new (temp_scoped_alloc_.get()) ArenaBitVector( in EliminateClassInitChecks()
[all …]
|
| D | type_inference.cc | 175 new (alloc_) ArenaBitVector(alloc_, num_blocks_, false) in AddCheckCast()
193 ArenaBitVector* phi_blocks = new (alloc_) ArenaBitVector(alloc_, num_blocks_, false); in AddPseudoPhis()
200 ArenaBitVector* input_blocks = data.def_phi_blocks_; in AddPseudoPhis()
|
| D | gvn_dead_code_elimination.cc | 453 unused_vregs_(new (alloc) ArenaBitVector(alloc, vreg_chains_.NumVRegs(), false)), in GvnDeadCodeElimination()
454 vregs_to_kill_(new (alloc) ArenaBitVector(alloc, vreg_chains_.NumVRegs(), false)), in GvnDeadCodeElimination()
457 dependent_vregs_(new (alloc) ArenaBitVector(alloc, vreg_chains_.NumVRegs(), false)) { in GvnDeadCodeElimination()
|
| /art/compiler/optimizing/ |
| D | dead_code_elimination.cc | 23 static void MarkReachableBlocks(HBasicBlock* block, ArenaBitVector* visited) { in MarkReachableBlocks()
50 static void MarkLoopHeadersContaining(const HBasicBlock& block, ArenaBitVector* set) { in MarkLoopHeadersContaining()
66 ArenaBitVector live_blocks(allocator, graph_->GetBlocks().Size(), false); in RemoveDeadBlocks()
67 ArenaBitVector affected_loops(allocator, graph_->GetBlocks().Size(), false); in RemoveDeadBlocks()
|
| D | stack_map_test.cc | 41 ArenaBitVector sp_mask(&arena, 0, false); in TEST()
123 ArenaBitVector sp_mask1(&arena, 0, true); in TEST()
134 ArenaBitVector sp_mask2(&arena, 0, true); in TEST()
277 ArenaBitVector sp_mask(&arena, 0, false); in TEST()
357 ArenaBitVector sp_mask(&arena, 0, false); in TEST()
419 ArenaBitVector sp_mask(&arena, 0, false); in TEST()
472 ArenaBitVector sp_mask(&arena, 0, false); in TEST()
|
| D | locations.cc | 42 stack_mask_ = new (arena) ArenaBitVector(arena, 0, true); in LocationSummary()
|
| D | graph_checker.h | 87 ArenaBitVector seen_ids_;
|
| D | licm.cc | 83 ArenaBitVector visited(graph_->GetArena(), graph_->GetBlocks().Size(), false); in Run()
|
| D | nodes.cc | 32 void HGraph::FindBackEdges(ArenaBitVector* visited) { in FindBackEdges()
33 ArenaBitVector visiting(arena_, blocks_.Size(), false); in FindBackEdges()
53 void HGraph::RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const { in RemoveInstructionsAsUsersFromDeadBlocks()
65 void HGraph::RemoveDeadBlocks(const ArenaBitVector& visited) { in RemoveDeadBlocks()
81 ArenaBitVector* visited, in VisitBlockForBackEdges()
82 ArenaBitVector* visiting) { in VisitBlockForBackEdges()
100 ArenaBitVector visited(arena_, blocks_.Size(), false); in BuildDominatorTree()
146 ArenaBitVector visited(arena_, blocks_.Size(), false); in FindCommonDominator()
|
| D | ssa_liveness_analysis.h | 45 ArenaBitVector live_in_;
46 ArenaBitVector live_out_;
47 ArenaBitVector kill_;
|
| D | gvn.cc | 288 ArenaBitVector buckets_owned_;
|
| D | stack_map_stream.cc | 40 new (allocator_) ArenaBitVector(allocator_, num_dex_registers, true); in BeginStackMapEntry()
|
| D | nodes.h | 293 void FindBackEdges(ArenaBitVector* visited);
295 ArenaBitVector* visited,
296 ArenaBitVector* visiting);
297 void RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const;
298 void RemoveDeadBlocks(const ArenaBitVector& visited);
464 const ArenaBitVector& GetBlocks() const { return blocks_; } in GetBlocks()
476 ArenaBitVector blocks_;
|
| D | graph_checker.cc | 350 const ArenaBitVector& loop_blocks = loop_information->GetBlocks(); in CheckLoop()
|
| D | register_allocator.cc | 474 GrowableArray<ArenaBitVector*> liveness_of_values( in ValidateIntervals()
480 liveness_of_values.Add(new (allocator) ArenaBitVector(allocator, 0, true)); in ValidateIntervals()
|
| /art/compiler/dex/quick/ |
| D | codegen_util.cc | 794 ArenaBitVector* references = new (arena_) ArenaBitVector(arena_, mir_graph_->GetNumSSARegs(), in CreateNativeGcMap()
|