https://gcc.gnu.org/bugzilla/show_bug.cgi?id=88231
Andi Kleen <andi-gcc at firstfloor dot org> changed:
What |Removed |Added
----------------------------------------------------------------------------
CC| |andi-gcc at firstfloor dot org
--- Comment #4 from Andi Kleen <andi-gcc at firstfloor dot org> ---
I'm not sure it's a good idea to do this. Often the goal is not to get the
absolute smallest code, but to get code that minimizes cache line usage.
This is important for "frontend bound" code like gcc itself often is.
It would be rather better to use an algorithm like Petis-Hansen or the one in
hfsort (see
https://research.fb.com/wp-content/uploads/2017/01/cgo2017-hfsort-final1.pdf)
to lay out the code based on expected call order to minimize foot print. For
best result would need profile feedback of course, but it might already do a
reasonable job based on static call frequencies.
