Lines Matching full:visited
52 void HGraph::FindBackEdges(ArenaBitVector* visited) {
53 // "visited" must be empty on entry, it's an output argument for all visited (i.e. live) blocks.
54 DCHECK_EQ(visited->GetHighestBitSet(), -1);
58 // Number of successors visited from a given node, indexed by block id.
66 visited->SetBit(entry_block_->GetBlockId());
82 } else if (!visited->IsBitSet(successor_id)) {
83 visited->SetBit(successor_id);
111 void HGraph::RemoveInstructionsAsUsersFromDeadBlocks(const ArenaBitVector& visited) const {
113 if (!visited.IsBitSet(i)) {
124 void HGraph::RemoveDeadBlocks(const ArenaBitVector& visited) {
126 if (!visited.IsBitSet(i)) {
147 ArenaBitVector visited(arena_, blocks_.size(), false, kArenaAllocGraphBuilder);
150 FindBackEdges(&visited);
152 // (2) Remove instructions and phis from blocks not visited during
155 RemoveInstructionsAsUsersFromDeadBlocks(visited);
157 // (3) Remove blocks not visited during the initial DFS.
160 RemoveDeadBlocks(visited);
234 // Number of successors visited from a given node, indexed by block id.
253 // Once all the forward edges have been visited, we know the immediate
391 // been visited already and had its try membership set.
641 // All predecessors have been recursively visited. Mark finalized if not marked yet.
661 ArenaBitVector visited(graph->GetArena(),
666 visited.SetBit(header_->GetBlockId());
669 PopulateIrreducibleRecursive(back_edge, &visited);
1783 // exception handlers of this TryBoundary were already visited and any
