Home
last modified time | relevance | path

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

/art/compiler/utils/
Darena_bit_vector.h53 class ArenaBitVector : public BitVector {
55 ArenaBitVector(ArenaAllocator* arena, uint32_t start_bits, bool expandable,
57 ArenaBitVector(ScopedArenaAllocator* arena, uint32_t start_bits, bool expandable,
59 ~ArenaBitVector() {} in ~ArenaBitVector()
62 return arena->Alloc(sizeof(ArenaBitVector), kArenaAllocGrowableBitMap); in new()
65 return arena->Alloc(sizeof(ArenaBitVector), kArenaAllocGrowableBitMap); in new()
Darena_bit_vector.cc44 ArenaBitVector::ArenaBitVector(ArenaAllocator* arena, unsigned int start_bits, in ArenaBitVector() function in art::ArenaBitVector
51 ArenaBitVector::ArenaBitVector(ScopedArenaAllocator* arena, unsigned int start_bits, in ArenaBitVector() function in art::ArenaBitVector
Darena_allocator_test.cc26 ArenaBitVector bv(&arena, 10, true); in TEST()
/art/compiler/dex/
Dssa_transformation.cc151 def_block_matrix_ = static_cast<ArenaBitVector**> in ComputeDefBlockMatrix()
152 (arena_->Alloc(sizeof(ArenaBitVector *) * num_registers, in ComputeDefBlockMatrix()
159 new (arena_) ArenaBitVector(arena_, GetNumBlocks(), false, kBitMapBMatrix); in ComputeDefBlockMatrix()
192 ScopedArenaVector<std::pair<BasicBlock*, ArenaBitVector::IndexIterator>> work_stack( in ComputeDomPostOrderTraversal()
197 std::pair<BasicBlock*, ArenaBitVector::IndexIterator>* curr = &work_stack.back(); in ComputeDomPostOrderTraversal()
199 ArenaBitVector::IndexIterator* curr_idom_iter = &curr->second; in ComputeDomPostOrderTraversal()
276 bb->dominators = new (arena_) ArenaBitVector(arena_, num_total_blocks, in InitializeDominationInfo()
278 bb->i_dominated = new (arena_) ArenaBitVector(arena_, num_total_blocks, in InitializeDominationInfo()
280 bb->dom_frontier = new (arena_) ArenaBitVector(arena_, num_total_blocks, in InitializeDominationInfo()
438 void MIRGraph::ComputeSuccLineIn(ArenaBitVector* dest, const ArenaBitVector* src1, in ComputeSuccLineIn()
[all …]
Dmir_graph.h230 ArenaBitVector* use_v;
231 ArenaBitVector* def_v;
232 ArenaBitVector* live_in_v;
233 ArenaBitVector* phi_v;
235 ArenaBitVector* ending_check_v; // For null check and class init check elimination.
412 ArenaBitVector* dominators;
413 ArenaBitVector* i_dominated; // Set nodes being immediately dominated.
414 ArenaBitVector* dom_frontier; // Dominance frontier.
584 ArenaBitVector* GetTryBlockAddr() const { in GetTryBlockAddr()
1082 void ComputeSuccLineIn(ArenaBitVector* dest, const ArenaBitVector* src1,
[all …]
Dmir_dataflow.cc899 void MIRGraph::HandleLiveInUse(ArenaBitVector* use_v, ArenaBitVector* def_v, in HandleLiveInUse()
900 ArenaBitVector* live_in_v, int dalvik_reg_id) { in HandleLiveInUse()
908 void MIRGraph::HandleDef(ArenaBitVector* def_v, int dalvik_reg_id) { in HandleDef()
912 void MIRGraph::HandleExtended(ArenaBitVector* use_v, ArenaBitVector* def_v, in HandleExtended()
913 ArenaBitVector* live_in_v, in HandleExtended()
928 ArenaBitVector *use_v, *def_v, *live_in_v; in FindLocalLiveIn()
933 new (arena_) ArenaBitVector(arena_, cu_->num_dalvik_registers, false, kBitMapUse); in FindLocalLiveIn()
935 new (arena_) ArenaBitVector(arena_, cu_->num_dalvik_registers, false, kBitMapDef); in FindLocalLiveIn()
937 new (arena_) ArenaBitVector(arena_, cu_->num_dalvik_registers, false, kBitMapLiveIn); in FindLocalLiveIn()
Dmir_graph.cc128 try_block_addr_ = new (arena_) ArenaBitVector(arena_, 0, true /* expandable */); in MIRGraph()
543 int width, int flags, ArenaBitVector* try_block_addr, in ProcessCanThrow()
1500 is_constant_v_ = new (arena_) ArenaBitVector(arena_, GetNumSSARegs(), false); in InitializeConstantPropagation()
1520 temp_bit_vector_ = new (temp_scoped_alloc_.get()) ArenaBitVector( in SSATransformationStart()
1540 MIRGraph* mir_graph, const ArenaBitVector* current_loop, in SelectTopologicalSortOrderFallBack()
1549 ArenaBitVector candidate_reachable(allocator, mir_graph->GetNumBlocks(), false, kBitMapMisc); in SelectTopologicalSortOrderFallBack()
1594 ArenaBitVector* reachable, in ComputeUnvisitedReachableFrom()
1624 ArenaBitVector loop_exit_blocks(&allocator, num_blocks, false, kBitMapMisc); in ComputeTopologicalSortOrder()
1665 ScopedArenaVector<ArenaBitVector*> loop_head_reachable_from(allocator.Adapter()); in ComputeTopologicalSortOrder()
1684 ArenaBitVector* reachable = in ComputeTopologicalSortOrder()
[all …]
Dmir_optimization.cc739 temp_bit_vector_ = new (temp_scoped_alloc_.get()) ArenaBitVector( in EliminateNullChecksAndInferTypesStart()
753 ArenaBitVector* ssa_regs_to_check = temp_bit_vector_; in EliminateNullChecksAndInferTypes()
936 bb->data_flow_info->ending_check_v = new (temp_scoped_alloc_.get()) ArenaBitVector( in EliminateNullChecksAndInferTypes()
1048 temp_bit_vector_ = new (temp_scoped_alloc_.get()) ArenaBitVector( in EliminateClassInitChecksGate()
1066 ArenaBitVector* classes_to_check = temp_bit_vector_; in EliminateClassInitChecks()
1129 bb->data_flow_info->ending_check_v = new (temp_scoped_alloc_.get()) ArenaBitVector( in EliminateClassInitChecks()
1252 temp_bit_vector_ = new (temp_scoped_alloc_.get()) ArenaBitVector( in InlineSpecialMethodsStart()
Dlocal_value_numbering.cc506 ArenaBitVector* live_in_v = gvn_->GetMirGraph()->GetBasicBlock(id_)->data_flow_info->live_in_v; in CopyLiveSregValues()
529 ArenaBitVector* live_in_v = gvn_->GetMirGraph()->GetBasicBlock(id_)->data_flow_info->live_in_v; in IntersectSregValueMaps()
Dglobal_value_numbering_test.cc338 live_in_v_(new (&cu_.arena) ArenaBitVector(&cu_.arena, kMaxSsaRegs, false, kBitMapMisc)) { in GlobalValueNumberingTest()
362 ArenaBitVector* live_in_v_;
/art/compiler/optimizing/
Dnodes.cc28 void HGraph::FindBackEdges(ArenaBitVector* visited) { in FindBackEdges()
29 ArenaBitVector visiting(arena_, blocks_.Size(), false); in FindBackEdges()
33 void HGraph::RemoveDeadBlocks(const ArenaBitVector& visited) const { in RemoveDeadBlocks()
51 ArenaBitVector* visited, in VisitBlockForBackEdges()
52 ArenaBitVector* visiting) { in VisitBlockForBackEdges()
70 ArenaBitVector visited(arena_, blocks_.Size(), false); in BuildDominatorTree()
96 ArenaBitVector visited(arena_, blocks_.Size(), false); in FindCommonDominator()
186 ArenaBitVector back_edges(arena_, GetBlocks().Size(), false); in SimplifyLoop()
Dstack_map_test.cc39 ArenaBitVector sp_mask(&arena, 0, false); in TEST()
76 ArenaBitVector sp_mask1(&arena, 0, true); in TEST()
85 ArenaBitVector sp_mask2(&arena, 0, true); in TEST()
Dssa_liveness_analysis.cc52 ArenaBitVector* visited) { in VisitBlockForLinearization()
88 ArenaBitVector visited(graph_.GetArena(), graph_.GetBlocks().Size(), false); in LinearizeGraph()
Dssa_liveness_analysis.h40 ArenaBitVector live_in_;
41 ArenaBitVector live_out_;
42 ArenaBitVector kill_;
Dnodes.h155 void FindBackEdges(ArenaBitVector* visited);
157 ArenaBitVector* visited,
158 ArenaBitVector* visiting);
159 void RemoveDeadBlocks(const ArenaBitVector& visited) const;
242 const ArenaBitVector& GetBlocks() const { return blocks_; } in GetBlocks()
250 ArenaBitVector blocks_;
Dregister_allocator.cc235 GrowableArray<ArenaBitVector*> liveness_of_values( in ValidateIntervals()
241 liveness_of_values.Add(new (allocator) ArenaBitVector(allocator, 0, true)); in ValidateIntervals()