Landing: 09fe63bb71e6
Project / Subsystem
gcc / tree-optimization
Date
2026-08-31
Author
Naveen
Commit
09fe63bb71e6b14186b0bb1f910270be101a6385
Source
github
Perf win
No
Breaking
No
All attributes
- project
- gcc
- subsystem
- tree-optimization
- patch_id
- —
- commit_hash
- 09fe63bb71e6b14186b0bb1f910270be101a6385
- source_type
- github
- headline
- Simplify MIN(A, B) eq/ne 0 to A when B is positive
- tldr
- Optimized MIN(A, B) comparisons to simplify to comparisons of A when B is known to be positive.
- author
- Naveen
- outcome
- committed
- performance_win
- false
- breaking_change
- false
- series_id
- —
- series_parts
- []
- tags
-
- • optimization
- • integer arithmetic
- discussion_id_link
- —
- bugzilla_pr
- —
- date
- 2026-08-31T00:00:00.000Z
This commit introduces an optimization to simplify comparisons involving the minimum of two values. When MIN(A, B) is compared to zero (either equal or not equal) and operand B is known to be positive, the comparison is now folded to a direct comparison of A with zero. This helps eliminate redundant checks and potentially simplify subsequent code.