This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Re: [RFA] optimizing predictable branches on x86
Hello,
a couple of language suggestions:
* Jan Hubicka wrote on Mon, Mar 03, 2008 at 01:03:48PM CET:
> *** doc/tm.texi (revision 132800)
> --- doc/tm.texi (working copy)
> *************** value to the result of that function. T
> *** 5828,5836 ****
[...]
> ! @defmac BRANCH_COST (@var{hot_p}, @var{predictable_p})
> ! A C expression for the cost of a branch instruction. A value of 1 is the
> ! default; other values are interpreted relative to that. Parameter @var{hot_p}
> ! is true when the branch in question might be hot in the compiled program. When
> ! it is false, @code{BRANCH_COST} should be returning value optimal for code size
s/value/the &/
> ! rather then performance considerations. @var{predictable_p} is true for well
s/then.*\./than for performance./
> ! predictable branches. On many architectures the @code{BRANCH_COST} can be
> ! reduced then.
s/architectures/&,/
s/can be reduced then/can then be reduced/
Cheers,
Ralf