Home
last modified time | relevance | path

Searched refs:visited (Results 1 – 10 of 10) sorted by relevance

/art/compiler/optimizing/
Dlicm.cc85 ArenaBitVector* visited = nullptr; in Run() local
87 visited = new (graph_->GetArena()) ArenaBitVector(graph_->GetArena(), in Run()
109 DCHECK(visited->IsBitSet(inner->GetBlockId())); in Run()
113 visited->SetBit(inner->GetBlockId()); in Run()
Ddead_code_elimination.cc26 static void MarkReachableBlocks(HGraph* graph, ArenaBitVector* visited) { in MarkReachableBlocks() argument
30 visited->SetBit(graph->GetEntryBlock()->GetBlockId()); in MarkReachableBlocks()
37 DCHECK(visited->IsBitSet(block_id)); in MarkReachableBlocks()
77 if (!visited->IsBitSet(successor->GetBlockId())) { in MarkReachableBlocks()
78 visited->SetBit(successor->GetBlockId()); in MarkReachableBlocks()
Dgraph_checker.cc676 BitVector* visited) { in IsConstantEquivalent() argument
686 if (visited->IsBitSet(insn1->GetId())) { in IsConstantEquivalent()
689 visited->SetBit(insn1->GetId()); in IsConstantEquivalent()
692 if (!IsConstantEquivalent(insn1_inputs[i], insn2_inputs[i], visited)) { in IsConstantEquivalent()
828 ArenaBitVector& visited = visited_storage_; in VisitPhi() local
829 visited.SetBit(GetGraph()->GetCurrentInstructionId()); in VisitPhi()
830 visited.ClearAllBits(); in VisitPhi()
831 if (!IsConstantEquivalent(phi, other_phi, &visited)) { in VisitPhi()
Dnodes.cc54 void HGraph::FindBackEdges(ArenaBitVector* visited) { in FindBackEdges() argument
56 DCHECK_EQ(visited->GetHighestBitSet(), -1); in FindBackEdges()
68 visited->SetBit(entry_block_->GetBlockId()); in FindBackEdges()
84 } else if (!visited->IsBitSet(successor_id)) { in FindBackEdges()
85 visited->SetBit(successor_id); in FindBackEdges()
110 void HGraph::RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const { in RemoveInstructionsAsUsersFromDeadBlocks()
112 if (!visited.IsBitSet(i)) { in RemoveInstructionsAsUsersFromDeadBlocks()
123 void HGraph::RemoveDeadBlocks(const ArenaBitVector& visited) { in RemoveDeadBlocks() argument
125 if (!visited.IsBitSet(i)) { in RemoveDeadBlocks()
146 ArenaBitVector visited(arena_, blocks_.size(), false, kArenaAllocGraphBuilder); in BuildDominatorTree() local
[all …]
Dnodes.h371 void FindBackEdges(ArenaBitVector* visited);
590 void RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const;
591 void RemoveDeadBlocks(const ArenaBitVector& visited);
/art/runtime/
Dhandle_scope_test.cc81 visited.insert(ref); in VisitRootIfNonNull()
86 std::set<StackReference<mirror::Object>*> visited; member in art::CollectVisitor
115 EXPECT_LE(visitor.visited.size(), base->NumberOfReferences()); in TEST_F()
117 for (StackReference<mirror::Object>* ref : visitor.visited) { in TEST_F()
/art/compiler/
Dimage_writer.cc729 std::unordered_set<mirror::Class*> visited; in PruneAppImageClass() local
730 return PruneAppImageClassInternal(klass, &early_exit, &visited); in PruneAppImageClass()
736 std::unordered_set<mirror::Class*>* visited) { in PruneAppImageClassInternal() argument
738 DCHECK(visited != nullptr); in PruneAppImageClassInternal()
749 if (visited->find(klass.Ptr()) != visited->end()) { in PruneAppImageClassInternal()
753 visited->emplace(klass.Ptr()); in PruneAppImageClassInternal()
774 visited); in PruneAppImageClassInternal()
780 visited); in PruneAppImageClassInternal()
795 visited); in PruneAppImageClassInternal()
799 visited); in PruneAppImageClassInternal()
[all …]
Dimage_writer.h496 std::unordered_set<mirror::Class*>* visited)
/art/runtime/openjdkjvmti/
Dti_heap.cc878 std::unordered_set<art::mirror::Object*>* visited) in CollectAndReportRootsVisitor() argument
882 visited_(visited), in CollectAndReportRootsVisitor()
/art/runtime/gc/space/
Dimage_space.cc921 explicit FixupObjectVisitor(gc::accounting::ContinuousSpaceBitmap* visited, in FixupObjectVisitor() argument
926 visited_(visited) {} in FixupObjectVisitor()