|
|
|
|
|
|
by astrange
1614 days ago
|
|
|
Unsigned overflow is not UB (it wraps) so it has to be preserved more often, which means you have a loop bounds less often, which means those loops can't be optimized. Typically not a problem for i=0...n loops but eg `for (i=0;i<n;i+=2)` could overflow. |
|
|