Lines Matching full:visited
322 // the loop is visited in increasing block id order, if the number of
550 // Assert that block is unreachable if dominator must not be visited.
747 BitVector visited(blocks_.length(), zone());
751 Postorder(start, &visited, &reverse_result, NULL);
764 BitVector* visited,
770 Postorder(it.Current(), visited, order, loop_header);
773 PostorderLoopBlocks(b->loop_information(), visited, order, loop_header);
780 BitVector* visited,
783 if (block == NULL || visited->Contains(block->block_id())) return;
785 visited->Add(block->block_id());
787 PostorderLoopBlocks(block->loop_information(), visited, order, loop_header);
789 Postorder(it.Current(), visited, order, block);
794 Postorder(it.Current(), visited, order, loop_header);
1968 void HGraph::PropagateMinusZeroChecks(HValue* value, BitVector* visited) {
1971 if (visited->Contains(current->id())) return;
1975 visited->Add(current->id());
1978 PropagateMinusZeroChecks(phi->OperandAt(i), visited);
1987 mul->EnsureAndPropagateNotMinusZero(visited);
1988 PropagateMinusZeroChecks(mul->left(), visited);
1989 PropagateMinusZeroChecks(mul->right(), visited);
1992 div->EnsureAndPropagateNotMinusZero(visited);
1993 PropagateMinusZeroChecks(div->left(), visited);
1994 PropagateMinusZeroChecks(div->right(), visited);
1997 current = current->EnsureAndPropagateNotMinusZero(visited);
2145 BitVector visited(GetMaximumValueID(), zone());
2158 ASSERT(visited.IsEmpty());
2159 PropagateMinusZeroChecks(change->value(), &visited);
2160 visited.Clear();
