54 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
149   FindBackEdges(&visited);  in BuildDominatorTree()
154   RemoveInstructionsAsUsersFromDeadBlocks(visited);  in BuildDominatorTree()
159   RemoveDeadBlocks(visited);  in BuildDominatorTree()
655     ArenaBitVector visited(graph->GetArena(),  in Populate()  local
660     visited.SetBit(header_->GetBlockId());  in Populate()
663       PopulateIrreducibleRecursive(back_edge, &visited);  in Populate()