Reordering of functions

Hi,

I've a question about the influence of compiler optimizations that
reorder functions on the system performance.

Assume a modern processor with all state-of-the art features like
prefetching, branch prediction and a superscalar pipeline. Further
assume that all caches are disabled. Will the program runtime change
when just the order of functions is changed (without any other code
transformation)?

I'm of the opinion that a reordering of function should have little
influence on the program execution, maybe due to some prefetch effects
but thes should be marginal. Of course, with caches this situation
would look different.

How do you see that?

Regards,
Tim

.

Relevant Pages

  • Reordering of functions
    ... I've a question about the influence of compiler ... optimizations that reorder functions on the ... features like prefetching, branch prediction and ...
    (comp.dsp)
  • Re: Reordering of functions
    ... optimizations that reorder functions on the ... features like prefetching, branch prediction and ... the author of the compiler and/or the library functions you ...
    (comp.arch.embedded)
  • Reordering of functions
    ... I've a question about the influence of compiler ... optimizations that reorder functions on the ... features like prefetching, branch prediction and ...
    (comp.arch.embedded)
  • Re: Reordering of functions
    ... I've a question about the influence of compiler ... features like prefetching, branch prediction and ... I'm of the opinion that a reordering of function should ... due to some prefetch effects but thes should be marginal. ...
    (comp.arch.embedded)