Lines Matching defs:overflow
56 // No overflow.
250 // `overflow` or `underflow` will return whether the resulting bound may
251 // overflow or underflow an int.
252 ValueBound Add(int32_t c, /* out */ bool* overflow, /* out */ bool* underflow) const {
253 *overflow = *underflow = false;
261 *overflow = true;
266 // (array.length + non-positive-constant) won't overflow an int.
271 *overflow = true;
351 bool overflow, underflow;
352 ValueBound lower = lower_.Add(constant, &overflow, &underflow);
358 ValueBound upper = upper_.Add(constant, &overflow, &underflow);
359 if (overflow) {
360 // Upper bound overflow will wrap around to negative values
378 * Special care needs to be taken to account for overflow/underflow
389 // used as a regular value range, due to possible overflow/underflow.
418 // possible overflow/underflow, that may not be possible.
452 // that's <= upper, (last_num_in_sequence + increment_) doesn't trigger overflow,
462 // Cast to int64_t for the substraction part to avoid int32_t overflow.
468 // No overflow. The sequence will be stopped by the upper bound test as expected.
472 // There might be overflow. Give up narrowing.
652 // Handle common cases which also don't have overflow/underflow concerns.
680 bool overflow;
685 right_range->GetBound().Add(left_compensation, &overflow, &underflow));
686 if (!overflow && !underflow) {
693 left_range->GetBound().Add(right_compensation, &overflow, &underflow),
695 if (!overflow && !underflow) {
756 bool overflow, underflow;
760 ValueBound new_upper = upper.Add(compensation, &overflow, &underflow);
761 if (overflow || underflow) {
772 ValueBound new_lower = lower.Add(compensation, &overflow, &underflow);
773 if (overflow || underflow) {
784 ValueBound new_lower = lower.Add(compensation, &overflow, &underflow);
785 if (overflow || underflow) {
795 ValueBound new_upper = upper.Add(compensation, &overflow, &underflow);
796 if (overflow || underflow) {
1027 // array.length + (c0 - c1) won't overflow/underflow.
