| /art/runtime/gc/accounting/ |
| D | space_bitmap.cc | 181 void SpaceBitmap<kAlignment>::WalkInstanceFields(SpaceBitmap<kAlignment>* visited, in WalkInstanceFields() argument
188 WalkInstanceFields(visited, callback, obj, super, arg); in WalkInstanceFields()
198 WalkFieldsInOrder(visited, callback, value, arg); in WalkInstanceFields()
206 void SpaceBitmap<kAlignment>::WalkFieldsInOrder(SpaceBitmap<kAlignment>* visited, in WalkFieldsInOrder() argument
209 if (visited->Test(obj)) { in WalkFieldsInOrder()
214 visited->Set(obj); in WalkFieldsInOrder()
217 WalkInstanceFields(visited, callback, obj, klass, arg); in WalkFieldsInOrder()
227 WalkFieldsInOrder(visited, callback, value, arg); in WalkFieldsInOrder()
239 WalkFieldsInOrder(visited, callback, value, arg); in WalkFieldsInOrder()
247 std::unique_ptr<SpaceBitmap<kAlignment>> visited( in InOrderWalk() local
[all …]
|
| D | space_bitmap.h | 205 static void WalkFieldsInOrder(SpaceBitmap* visited, ObjectCallback* callback, mirror::Object* obj,
209 static void WalkInstanceFields(SpaceBitmap<kAlignment>* visited, ObjectCallback* callback,
|
| /art/compiler/optimizing/ |
| D | nodes.cc | 28 void HGraph::FindBackEdges(ArenaBitVector* visited) { in FindBackEdges() argument
30 VisitBlockForBackEdges(entry_block_, visited, &visiting); in FindBackEdges()
33 void HGraph::RemoveDeadBlocks(const ArenaBitVector& visited) const { in RemoveDeadBlocks()
35 if (!visited.IsBitSet(i)) { in RemoveDeadBlocks()
51 ArenaBitVector* visited, in VisitBlockForBackEdges() argument
54 if (visited->IsBitSet(id)) return; in VisitBlockForBackEdges()
56 visited->SetBit(id); in VisitBlockForBackEdges()
63 VisitBlockForBackEdges(successor, visited, visiting); in VisitBlockForBackEdges()
70 ArenaBitVector visited(arena_, blocks_.Size(), false); in BuildDominatorTree() local
73 FindBackEdges(&visited); in BuildDominatorTree()
[all …]
|
| D | ssa_liveness_analysis.cc | 52 ArenaBitVector* visited) { in VisitBlockForLinearization() argument
53 if (visited->IsBitSet(block->GetBlockId())) { in VisitBlockForLinearization()
56 visited->SetBit(block->GetBlockId()); in VisitBlockForLinearization()
61 VisitBlockForLinearization(block->GetSuccessors().Get(0), order, visited); in VisitBlockForLinearization()
79 VisitBlockForLinearization(first_successor, order, visited); in VisitBlockForLinearization()
80 VisitBlockForLinearization(second_successor, order, visited); in VisitBlockForLinearization()
88 ArenaBitVector visited(graph_.GetArena(), graph_.GetBlocks().Size(), false); in LinearizeGraph() local
89 VisitBlockForLinearization(graph_.GetEntryBlock(), &linear_post_order_, &visited); in LinearizeGraph()
|
| D | nodes.h | 155 void FindBackEdges(ArenaBitVector* visited);
157 ArenaBitVector* visited,
159 void RemoveDeadBlocks(const ArenaBitVector& visited) const;
|
| /art/compiler/dex/ |
| D | dataflow_iterator-inl.h | 128 bb->visited = true; in Next()
133 child_bb->visited = false; in Next()
149 if (!recalculated || !loop_head->visited) { in Next()
165 if (!bb->visited) { in Next()
|
| D | ssa_transformation.cc | 28 bb->visited = false; in ClearAllVisitedFlags()
34 if (bb->visited || bb->hidden) { in NeedsVisit()
65 block->visited = true; in MarkPreOrder()
125 if (!bb->visited) { in ComputeDFSOrders()
194 bb->visited = true; in ComputeDomPostOrderTraversal()
207 new_bb->visited = true; in ComputeDomPostOrderTraversal()
582 if (block->visited || block->hidden) { in DoDFSPreOrderSSARename()
585 block->visited = true; in DoDFSPreOrderSSARename()
|
| D | mir_optimization.cc | 607 if (bb->visited) { in LayoutBlocks()
610 bb->visited = true; in LayoutBlocks()
621 if (prev->visited) { in LayoutBlocks()
624 prev->visited = true; in LayoutBlocks()
1327 if (bb->visited) return false; in BuildExtendedBBList()
1331 bb->visited = true; in BuildExtendedBBList()
1341 bb->visited = true; in BuildExtendedBBList()
|
| D | mir_graph.cc | 1553 candidate->visited || // already processed, or in SelectTopologicalSortOrderFallBack()
1572 if (child_bb->visited || // Already processed, or in SelectTopologicalSortOrderFallBack()
1608 if (!pred_bb->visited && !reachable->IsBitSet(pred_bb->id)) { in ComputeUnvisitedReachableFrom()
1677 if (bb->visited) { in ComputeTopologicalSortOrder()
1717 candidate->visited || // already processed, or in ComputeTopologicalSortOrder()
1727 if (pred_bb != candidate && !pred_bb->visited && in ComputeTopologicalSortOrder()
1748 DCHECK_EQ(bb->visited, false); in ComputeTopologicalSortOrder()
1749 bb->visited = true; in ComputeTopologicalSortOrder()
|
| D | mir_analysis.cc | 863 if (bb->visited || (bb->block_type != kDalvikByteCode)) { in AnalyzeBlock()
903 tbb->visited = true; in AnalyzeBlock()
|
| D | mir_graph.h | 401 bool visited:1; member
|