Lines Matching defs:check
703 // Here we need to check all uses since we can't easily know which
1607 // in order to skip the overflow check. Similarly, we must not drop -0 from
1617 // an overflow check is needed on the output). Note that we do not
1618 // have to do any check if at most one side can be minus zero. For
1643 // a minus zero check for the right hand side, since we already
1645 // potentially guarded by a check.
1712 // (but an overflow check is needed on the output).
1723 // (but an overflow check is needed on the output).
1735 // If the result is truncated, we only need to check the inputs.
1836 // The bounds check is redundant if we already know that
2431 // (but an overflow check is needed on the output).
2503 // (but an overflow check is needed on the output).
2514 // (but an overflow check is needed on the output).
2527 // If the result is truncated, we only need to check the inputs.
3225 // to make sure that the overflow check is properly scheduled before the
4829 Node* check = graph()->NewNode(machine()->Word32Equal(), rhs, zero);
4830 Diamond d(graph(), common(), check, BranchHint::kFalse);