Landing: e73194188cea

Project / Subsystem

gcc / bitmap

Date

2026-06-04

Author

Richard Sandiford

Commit

e73194188cea9c4b41eccadb74bfbd3f0c52b8bd

Source

github

Perf win

Yes

Breaking

No

All attributes

project
gcc
subsystem
bitmap
patch_id
commit_hash
e73194188cea9c4b41eccadb74bfbd3f0c52b8bd
source_type
github
headline
Bitmap avoids a redundant splay operation to speed up tree linking.
tldr
A redundant tree splay operation in `bitmap_tree_link_element` is removed, improving performance by 20% in an artificial test case.
author
Richard Sandiford
outcome
committed
performance_win
true
breaking_change
false
series_id
series_parts
[]
tags
  • performance
  • data-structures
discussion_id_link
bugzilla_pr
date
2026-06-04T00:00:00.000Z

This commit optimizes the bitmap_tree_link_element function by removing a redundant splay operation. Previously, the function would splay the tree a second time to ensure the root was a neighbor of the element to be inserted, even though callers had already performed a similar splay. Eliminating this unnecessary work yields a 20% performance improvement in a controlled test.