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
195   visited.ClearAllBits();  in BuildDominatorTree()
198   FindBackEdges(&visited);  in BuildDominatorTree()
203   RemoveInstructionsAsUsersFromDeadBlocks(visited);  in BuildDominatorTree()
208   RemoveDeadBlocks(visited);  in BuildDominatorTree()
1002     ArenaBitVector visited(&allocator,  in Populate()  local
1006     visited.ClearAllBits();  in Populate()
1008     visited.SetBit(header_->GetBlockId());  in Populate()
1011       PopulateIrreducibleRecursive(back_edge, &visited);  in Populate()
1333     ArenaBitVector visited(&allocator,  in Dump()  local
1337     visited.ClearAllBits();  in Dump()
1338     visited.SetBit(GetId());  in Dump()
1352       if (!visited.IsBitSet(instruction->GetId())) {  in Dump()
1353         visited.SetBit(instruction->GetId());  in Dump()