/art/runtime/gc/ |
D | verification.cc | 161 explicit BFSFindReachable(ObjectSet* visited) : visited_(visited) {} in BFSFindReachable() argument 200 CollectRootVisitor(ObjectSet* visited, WorkQueue* work) : visited_(visited), work_(work) {} in CollectRootVisitor() argument 218 std::set<mirror::Object*> visited; in FirstPathFromRootSet() local 221 CollectRootVisitor root_visitor(&visited, &work); in FirstPathFromRootSet() 230 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()
|
/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 | graph_checker.cc | 778 BitVector* visited) { in IsConstantEquivalent() argument 788 if (visited->IsBitSet(insn1->GetId())) { in IsConstantEquivalent() 791 visited->SetBit(insn1->GetId()); in IsConstantEquivalent() 794 if (!IsConstantEquivalent(insn1_inputs[i], insn2_inputs[i], visited)) { in IsConstantEquivalent() 932 ArenaBitVector visited(&allocator, in VisitPhi() local 936 visited.ClearAllBits(); in VisitPhi() 937 if (!IsConstantEquivalent(phi, other_phi, &visited)) { in VisitPhi()
|
D | nodes.cc | 55 void HGraph::FindBackEdges(ArenaBitVector* visited) { in FindBackEdges() argument 57 DCHECK_EQ(visited->GetHighestBitSet(), -1); in FindBackEdges() 73 visited->SetBit(entry_block_->GetBlockId()); in FindBackEdges() 89 } else if (!visited->IsBitSet(successor_id)) { in FindBackEdges() 90 visited->SetBit(successor_id); in FindBackEdges() 145 void HGraph::RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const { in RemoveInstructionsAsUsersFromDeadBlocks() 147 if (!visited.IsBitSet(i)) { in RemoveInstructionsAsUsersFromDeadBlocks() 160 void HGraph::RemoveDeadBlocks(const ArenaBitVector& visited) { in RemoveDeadBlocks() argument 162 if (!visited.IsBitSet(i)) { in RemoveDeadBlocks() 186 ArenaBitVector visited(&allocator, blocks_.size(), false, kArenaAllocGraphBuilder); in BuildDominatorTree() local [all …]
|
D | superblock_cloner.cc | 240 ArenaBitVector visited(arena_, graph_->GetBlocks().size(), false, kArenaAllocSuperblockCloner); in FindBackEdgesLocal() local 242 DCHECK_EQ(visited.GetHighestBitSet(), -1); in FindBackEdgesLocal() 255 visited.SetBit(entry_block->GetBlockId()); in FindBackEdgesLocal() 275 } else if (!visited.IsBitSet(successor_id)) { in FindBackEdgesLocal() 276 visited.SetBit(successor_id); in FindBackEdgesLocal()
|
D | nodes.h | 384 void FindBackEdges(ArenaBitVector* visited); 627 void RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const; 628 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 | 341 std::vector<HierarchyClass*> visited; in ForEachResolvableMember() local 342 return ForEachResolvableMember_Impl(other, fn, true, true, visited); in ForEachResolvableMember() 368 std::vector<HierarchyClass*> visited) { in ForEachResolvableMember_Impl() argument 369 if (std::find(visited.begin(), visited.end(), this) == visited.end()) { in ForEachResolvableMember_Impl() 370 visited.push_back(this); in ForEachResolvableMember_Impl() 387 visited); in ForEachResolvableMember_Impl() 402 visited); in ForEachResolvableMember_Impl()
|
/art/dex2oat/linker/ |
D | image_writer.cc | 1308 std::unordered_set<mirror::Object*>* visited, in PruneObjectReferenceVisitor() argument 1310 : image_writer_(image_writer), early_exit_(early_exit), visited_(visited), result_(result) {} in PruneObjectReferenceVisitor() 1373 std::unordered_set<mirror::Object*> visited; in PruneAppImageClass() local 1374 return PruneAppImageClassInternal(klass, &early_exit, &visited); in PruneAppImageClass() 1380 std::unordered_set<mirror::Object*>* visited) { in PruneAppImageClassInternal() argument 1382 DCHECK(visited != nullptr); in PruneAppImageClassInternal() 1393 if (visited->find(klass.Ptr()) != visited->end()) { in PruneAppImageClassInternal() 1397 visited->emplace(klass.Ptr()); in PruneAppImageClassInternal() 1418 visited); in PruneAppImageClassInternal() 1424 visited); in PruneAppImageClassInternal() [all …]
|
D | image_writer.h | 591 std::unordered_set<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 | 1715 std::unordered_set<dex_ir::StringData*> visited; in LayoutStringData() local 1717 visited.insert(data.get()); in LayoutStringData() 1720 CHECK(visited.find(string_id->DataItem()) != visited.end()); in LayoutStringData()
|
/art/openjdkjvmti/ |
D | ti_heap.cc | 900 std::unordered_set<art::mirror::Object*>* visited) in CollectAndReportRootsVisitor() argument 904 visited_(visited), in CollectAndReportRootsVisitor()
|
/art/runtime/gc/space/ |
D | image_space.cc | 1082 explicit FixupObjectVisitor(gc::accounting::ContinuousSpaceBitmap* visited, in FixupObjectVisitor() argument 1084 : visited_(visited), forward_(forward) {} in FixupObjectVisitor()
|