Lines Matching refs:visited
54 void HGraph::FindBackEdges(ArenaBitVector* visited) { in FindBackEdges() argument
56 DCHECK_EQ(visited->GetHighestBitSet(), -1); in FindBackEdges()
72 visited->SetBit(entry_block_->GetBlockId()); in FindBackEdges()
88 } else if (!visited->IsBitSet(successor_id)) { in FindBackEdges()
89 visited->SetBit(successor_id); in FindBackEdges()
144 void HGraph::RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const { in RemoveInstructionsAsUsersFromDeadBlocks()
146 if (!visited.IsBitSet(i)) { in RemoveInstructionsAsUsersFromDeadBlocks()
159 void HGraph::RemoveDeadBlocks(const ArenaBitVector& visited) { in RemoveDeadBlocks() argument
161 if (!visited.IsBitSet(i)) { in RemoveDeadBlocks()
185 ArenaBitVector visited(&allocator, blocks_.size(), false, kArenaAllocGraphBuilder); in BuildDominatorTree() local
186 visited.ClearAllBits(); in BuildDominatorTree()
189 FindBackEdges(&visited); in BuildDominatorTree()
194 RemoveInstructionsAsUsersFromDeadBlocks(visited); in BuildDominatorTree()
199 RemoveDeadBlocks(visited); in BuildDominatorTree()
828 ArenaBitVector visited(&allocator, in Populate() local
832 visited.ClearAllBits(); in Populate()
834 visited.SetBit(header_->GetBlockId()); in Populate()
837 PopulateIrreducibleRecursive(back_edge, &visited); in Populate()