| /art/runtime/gc/ |
| D | verification.cc | 160 explicit BFSFindReachable(ObjectSet* visited) : visited_(visited) {} in BFSFindReachable() argument
199 CollectRootVisitor(ObjectSet* visited, WorkQueue* work) : visited_(visited), work_(work) {} in CollectRootVisitor() argument
217 std::set<mirror::Object*> visited; in FirstPathFromRootSet() local
220 CollectRootVisitor root_visitor(&visited, &work); in FirstPathFromRootSet()
229 BFSFindReachable visitor(&visited); in FirstPathFromRootSet()
|
| /art/runtime/ |
| D | handle_scope_test.cc | 82 visited.insert(ref); in VisitRootIfNonNull()
87 std::set<StackReference<mirror::Object>*> visited; member in art::CollectVisitor
116 EXPECT_LE(visitor.visited.size(), base->NumberOfReferences()); in TEST_F()
118 for (StackReference<mirror::Object>* ref : visitor.visited) { in TEST_F()
|
| D | class_linker.cc | 1502 ObjPtr<mirror::String> visited = visitor(referred_string); in VisitInternedStringReferences() local
1503 if (visited != referred_string) { in VisitInternedStringReferences()
1507 /* kIsVolatile= */ false>(member_offset, visited); in VisitInternedStringReferences()
|
| /art/compiler/optimizing/ |
| D | licm.cc | 86 ArenaBitVector* visited = nullptr; in Run() local
88 visited = new (graph_->GetAllocator()) ArenaBitVector(graph_->GetAllocator(), in Run()
110 DCHECK(visited->IsBitSet(inner->GetBlockId())); in Run()
114 visited->SetBit(inner->GetBlockId()); in Run()
|
| D | dead_code_elimination.cc | 28 static void MarkReachableBlocks(HGraph* graph, ArenaBitVector* visited) { in MarkReachableBlocks() argument
35 visited->SetBit(graph->GetEntryBlock()->GetBlockId()); in MarkReachableBlocks()
42 DCHECK(visited->IsBitSet(block_id)); in MarkReachableBlocks()
82 if (!visited->IsBitSet(successor->GetBlockId())) { in MarkReachableBlocks()
83 visited->SetBit(successor->GetBlockId()); in MarkReachableBlocks()
|
| D | nodes.cc | 63 void HGraph::FindBackEdges(ArenaBitVector* visited) { in FindBackEdges() argument
65 DCHECK_EQ(visited->GetHighestBitSet(), -1); in FindBackEdges()
81 visited->SetBit(entry_block_->GetBlockId()); in FindBackEdges()
97 } else if (!visited->IsBitSet(successor_id)) { in FindBackEdges()
98 visited->SetBit(successor_id); in FindBackEdges()
153 void HGraph::RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const { in RemoveInstructionsAsUsersFromDeadBlocks()
155 if (!visited.IsBitSet(i)) { in RemoveInstructionsAsUsersFromDeadBlocks()
168 void HGraph::RemoveDeadBlocks(const ArenaBitVector& visited) { in RemoveDeadBlocks() argument
170 if (!visited.IsBitSet(i)) { in RemoveDeadBlocks()
194 ArenaBitVector visited(&allocator, blocks_.size(), false, kArenaAllocGraphBuilder); in BuildDominatorTree() local
[all …]
|
| D | graph_checker.cc | 784 BitVector* visited) { in IsConstantEquivalent() argument
794 if (visited->IsBitSet(insn1->GetId())) { in IsConstantEquivalent()
797 visited->SetBit(insn1->GetId()); in IsConstantEquivalent()
800 if (!IsConstantEquivalent(insn1_inputs[i], insn2_inputs[i], visited)) { in IsConstantEquivalent()
938 ArenaBitVector visited(&allocator, in VisitPhi() local
942 visited.ClearAllBits(); in VisitPhi()
943 if (!IsConstantEquivalent(phi, other_phi, &visited)) { in VisitPhi()
|
| D | load_store_elimination.cc | 1906 ArenaBitVector visited(&allocator, in TryReplacingLoopPhiPlaceholderWithDefault() local
1910 visited.ClearAllBits(); in TryReplacingLoopPhiPlaceholderWithDefault()
1916 visited.SetBit(PhiPlaceholderIndex(phi_placeholder)); in TryReplacingLoopPhiPlaceholderWithDefault()
1928 if (!visited.IsBitSet(PhiPlaceholderIndex(value))) { in TryReplacingLoopPhiPlaceholderWithDefault()
1929 visited.SetBit(PhiPlaceholderIndex(value)); in TryReplacingLoopPhiPlaceholderWithDefault()
1963 if (!visited.IsBitSet(PhiPlaceholderIndex(value))) { in TryReplacingLoopPhiPlaceholderWithDefault()
1964 visited.SetBit(PhiPlaceholderIndex(value)); in TryReplacingLoopPhiPlaceholderWithDefault()
1977 for (uint32_t phi_placeholder_index : visited.Indexes()) { in TryReplacingLoopPhiPlaceholderWithDefault()
1981 phi_placeholders_to_materialize->Subtract(&visited); in TryReplacingLoopPhiPlaceholderWithDefault()
1990 ArenaBitVector visited(&allocator, in TryReplacingLoopPhiPlaceholderWithSingleInput() local
[all …]
|
| D | superblock_cloner.cc | 274 ArenaBitVector visited(arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in FindBackEdgesLocal() local
276 DCHECK_EQ(visited.GetHighestBitSet(), -1); in FindBackEdgesLocal()
289 visited.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal()
309 } else if (!visited.IsBitSet(successor_id)) { in FindBackEdgesLocal()
310 visited.SetBit(successor_id); in FindBackEdgesLocal()
|
| D | execution_subgraph_test.cc | 48 std::unordered_set<const HBasicBlock*> visited; in CalculateValidity() local
53 if (visited.find(cur) != visited.end()) { in CalculateValidity()
56 visited.insert(cur); in CalculateValidity()
|
| D | nodes.h | 462 void FindBackEdges(ArenaBitVector* visited);
721 void RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const;
722 void RemoveDeadBlocks(const ArenaBitVector& visited);
|
| /art/test/1945-proxy-method-arguments/ |
| D | info.txt | 1 Test checking that reference arguments of proxy methods are visited as
|
| /art/tools/hiddenapi/ |
| D | hiddenapi.cc | 359 std::vector<HierarchyClass*> visited; in ForEachResolvableMember() local
360 return ForEachResolvableMember_Impl(other, fn, true, true, visited); in ForEachResolvableMember()
386 std::vector<HierarchyClass*> visited) { in ForEachResolvableMember_Impl() argument
387 if (std::find(visited.begin(), visited.end(), this) == visited.end()) { in ForEachResolvableMember_Impl()
388 visited.push_back(this); in ForEachResolvableMember_Impl()
405 visited); in ForEachResolvableMember_Impl()
420 visited); in ForEachResolvableMember_Impl()
|
| /art/dex2oat/linker/ |
| D | image_writer.cc | 858 HashSet<mirror::Object*>* visited, in PruneObjectReferenceVisitor() argument
860 : image_writer_(image_writer), early_exit_(early_exit), visited_(visited), result_(result) {} in PruneObjectReferenceVisitor()
921 HashSet<mirror::Object*> visited; in PruneImageClass() local
922 return PruneImageClassInternal(klass, &early_exit, &visited); in PruneImageClass()
928 HashSet<mirror::Object*>* visited) { in PruneImageClassInternal() argument
930 DCHECK(visited != nullptr); in PruneImageClassInternal()
941 if (visited->find(klass.Ptr()) != visited->end()) { in PruneImageClassInternal()
945 visited->insert(klass.Ptr()); in PruneImageClassInternal()
966 visited); in PruneImageClassInternal()
972 visited); in PruneImageClassInternal()
[all …]
|
| D | image_writer.h | 543 HashSet<mirror::Object*>* visited)
|
| /art/tools/dexanalyze/ |
| D | dexanalyze_bytecode.cc | 115 std::set<const void*> visited; in ProcessDexFiles() local
135 if (method.GetCodeItem() == nullptr || !visited.insert(method.GetCodeItem()).second) { in ProcessDexFiles()
|
| /art/dexlayout/ |
| D | dexlayout.cc | 1719 std::unordered_set<dex_ir::StringData*> visited; in LayoutStringData() local
1721 visited.insert(data.get()); in LayoutStringData()
1724 CHECK(visited.find(string_id->DataItem()) != visited.end()); in LayoutStringData()
|
| /art/openjdkjvmti/ |
| D | ti_heap.cc | 926 std::unordered_set<art::mirror::Object*>* visited) in CollectAndReportRootsVisitor() argument
930 visited_(visited), in CollectAndReportRootsVisitor()
|
| /art/runtime/gc/space/ |
| D | image_space.cc | 1109 explicit FixupObjectVisitor(gc::accounting::ContinuousSpaceBitmap* visited, in FixupObjectVisitor() argument
1111 : visited_(visited), forward_(forward) {} in FixupObjectVisitor()
|