Searched defs:visited (Results 1 - 7 of 7) sorted by path

/art/compiler/
H A Dimage_writer.cc713 std::unordered_set<mirror::Class*> visited; local
714 return PruneAppImageClassInternal(klass, &early_exit, &visited);
720 std::unordered_set<mirror::Class*>* visited) {
722 DCHECK(visited != nullptr);
733 if (visited->find(klass) != visited->end()) {
737 visited->emplace(klass);
752 // Check interfaces since these wont be visited through VisitReferences.)
757 visited);
763 visited);
717 PruneAppImageClassInternal( mirror::Class* klass, bool* early_exit, std::unordered_set<mirror::Class*>* visited) argument
[all...]
/art/compiler/optimizing/
H A Ddead_code_elimination.cc25 static void MarkReachableBlocks(HGraph* graph, ArenaBitVector* visited) { argument
29 visited->SetBit(graph->GetEntryBlock()->GetBlockId());
36 DCHECK(visited->IsBitSet(block_id));
75 // Add only those successors that have not been visited yet.
76 if (!visited->IsBitSet(successor->GetBlockId())) {
77 visited->SetBit(successor->GetBlockId());
H A Dgraph_checker.cc674 static bool IsConstantEquivalent(HInstruction* insn1, HInstruction* insn2, BitVector* visited) { argument
679 if (visited->IsBitSet(insn1->GetId())) {
682 visited->SetBit(insn1->GetId());
685 if (!IsConstantEquivalent(insn1->InputAt(i), insn2->InputAt(i), visited)) {
821 ArenaBitVector& visited = visited_storage_; local
822 visited.SetBit(GetGraph()->GetCurrentInstructionId());
823 visited.ClearAllBits();
824 if (!IsConstantEquivalent(phi, other_phi, &visited)) {
H A Dlicm.cc84 ArenaBitVector* visited = nullptr; local
86 visited = new (graph_->GetArena()) ArenaBitVector(graph_->GetArena(),
108 // Thanks to post order visit, inner loops were already visited.
109 DCHECK(visited->IsBitSet(inner->GetBlockId()));
113 visited->SetBit(inner->GetBlockId());
H A Dnodes.cc52 void HGraph::FindBackEdges(ArenaBitVector* visited) { argument
53 // "visited" must be empty on entry, it's an output argument for all visited (i.e. live) blocks.
54 DCHECK_EQ(visited->GetHighestBitSet(), -1);
58 // Number of successors visited from a given node, indexed by block id.
66 visited->SetBit(entry_block_->GetBlockId());
82 } else if (!visited->IsBitSet(successor_id)) {
83 visited->SetBit(successor_id);
111 void HGraph::RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const {
113 if (!visited
124 RemoveDeadBlocks(const ArenaBitVector& visited) argument
[all...]
/art/runtime/gc/accounting/
H A Dspace_bitmap.cc188 void SpaceBitmap<kAlignment>::WalkInstanceFields(SpaceBitmap<kAlignment>* visited,
195 WalkInstanceFields(visited, callback, obj, super, arg);
202 WalkFieldsInOrder(visited, callback, value, arg);
209 void SpaceBitmap<kAlignment>::WalkFieldsInOrder(SpaceBitmap<kAlignment>* visited, argument
212 if (visited->Test(obj)) {
217 visited->Set(obj);
220 WalkInstanceFields(visited, callback, obj, klass, arg);
227 WalkFieldsInOrder(visited, callback, value, arg);
238 WalkFieldsInOrder(visited, callback, value, arg);
246 std::unique_ptr<SpaceBitmap<kAlignment>> visited(
[all...]
/art/runtime/gc/space/
H A Dimage_space.cc744 explicit FixupObjectVisitor(gc::accounting::ContinuousSpaceBitmap* visited, argument
749 visited_(visited) {}
775 // boot image. Uses the bitmap to ensure the same array is not visited multiple times.
782 // already visited the array as a long / int array from walking the bitmap without knowing it
805 // Already visited.
1028 // The visited bitmap is used to ensure that pointer arrays are not forwarded twice.

Completed in 88 milliseconds