Landing: b190388bad47
Project / Subsystem
gcc / match.pd
Date
2026-08-11
Author
Reshma Roy
Commit
b190388bad47b1d3507abd52dc2a07f39a899984
Source
github
Perf win
Yes
Breaking
No
All attributes
- project
- gcc
- subsystem
- match.pd
- patch_id
- —
- commit_hash
- b190388bad47b1d3507abd52dc2a07f39a899984
- source_type
- github
- headline
- Fold umin(a, 1) | umin(b, 1) into umin(a | b, 1)
- tldr
- Simplifies bitwise OR of minimums with 1 into a minimum of a bitwise OR.
- author
- Reshma Roy
- outcome
- committed
- performance_win
- true
- breaking_change
- false
- series_id
- —
- series_parts
- []
- tags
-
- • optimization
- • bitwise
- • pattern matching
- discussion_id_link
- —
- bugzilla_pr
- —
- date
- 2026-08-11T00:00:00.000Z
This commit optimizes a specific bitwise operation pattern within the match.pd pattern matching system. It folds the expression umin(a, 1) | umin(b, 1) into the more efficient form umin(a | b, 1). This optimization is applied to integer types and is accompanied by new test cases to verify its correctness.