Re: Path optimizations
- From: Stephan Ceram <linuxkaffee_@xxxxxxxx>
- Date: 18 Nov 2007 14:55:03 GMT
There is quite a bit of optimization that can take place in code to make it
run faster, such as loop unrolling, branch indexes, inlining code,
etc... There is so much that can be optimized in a program it's more of
a question of what can't be optimized. Most code, however, is not
optimized as it makes the code harder to understand and maintain and is
usually a lot of effort for little gain.
I think my question hasn't be correctly understood. Of course, I
know that there is a large number of optimizations that can be
performed by the compiler. But, in a profile-driven optimization
process you perform special optimizations just on this one path and
leave the rest of the code unmodified. In contrast, general optimizations
like loop unrolling are performed not just to code on a single
path but to all loops in the program. So my question was which
other optimizations that are tailored towards optimizing a particular
path (and really just this path) do exist.
.
- References:
- Path optimizations
- From: Tim Frink
- Re: Path optimizations
- From: Jim Langston
- Path optimizations
- Prev by Date: Re: two interesting data structure/algorithm questions
- Next by Date: Wanted some practical problems to solve in data structures
- Previous by thread: Re: Path optimizations
- Next by thread: Re: Path optimizations
- Index(es):
Relevant Pages
|