Landing: ac1c1f64e11b

Project / Subsystem

gcc / match

Date

2026-08-21

Author

Andrea Pinski

Commit

ac1c1f64e11b84ba6a5e8dbef4589f8369df7d08

Source

github

Perf win

No

Breaking

No

All attributes

project
gcc
subsystem
match
patch_id
—
commit_hash
ac1c1f64e11b84ba6a5e8dbef4589f8369df7d08
source_type
github
headline
match: Use match to match mult for mul_ladder_sum1
tldr
Replaced manual SSA walk in mul_ladder_sum1 with a pattern-matching approach.
author
Andrea Pinski
outcome
committed
performance_win
false
breaking_change
false
series_id
—
series_parts
[]
tags
  • • maintenance
  • • optimization
discussion_id_link
—
bugzilla_pr
—
date
2026-08-21T00:00:00.000Z

GCC’s mul_ladder_sum1 pattern has been refactored to use the declarative match syntax instead of manually traversing SSA (Static Single Assignment) names. The previous implementation involved checking the GIMPLE statement and its right-hand side code. The new pattern (mult@mul_hilo1 @2 @3) achieves the same goal more readably and potentially leverages the pattern-matching infrastructure more effectively, including its valueizer if available.