--- Comment #6 from hubicka at gcc dot gnu dot org 2009-06-04 14:50 ---
There is simple algoritm reordering functions so calls more commonly leads to
following function in memory. (just order calls by frequency and concatenate
them into sequences and then order sequences to promote forwa
--- Comment #5 from vvv at ru dot ru 2009-05-10 18:20 ---
(In reply to comment #4)
> Well you need whole program to get the behavior which you want.
Yes. Of course, it's no problem for small single-programmer project, but it's
problem for big projects like Linux Kernel.
--
http://g
--- Comment #4 from pinskia at gcc dot gnu dot org 2009-05-10 18:10 ---
Well you need whole program to get the behavior which you want.
--
http://gcc.gnu.org/bugzilla/show_bug.cgi?id=40093
--- Comment #3 from vvv at ru dot ru 2009-05-10 18:08 ---
(In reply to comment #2)
> This should have been done already with cgraph order.
Unfortunately, I can see inverse order only in separate source file. Inverse
but not optimized.
Example:
// file order1.c
#include
main(int argc,
--- Comment #2 from pinskia at gcc dot gnu dot org 2009-05-10 16:49 ---
This should have been done already with cgraph order.
--
pinskia at gcc dot gnu dot org changed:
What|Removed |Added
---
