This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: thanks for the memory work
- From: law at redhat dot com
- To: Andrew MacLeod <amacleod at redhat dot com>
- Cc: Steven Bosscher <s dot bosscher at student dot tudelft dot nl>, gcc mailing list <gcc at gcc dot gnu dot org>
- Date: Tue, 25 Nov 2003 21:25:10 -0700
- Subject: Re: thanks for the memory work
- Reply-to: law at redhat dot com
In message <1069818583.8326.2212.camel@p4>, Andrew MacLeod writes:
>Use operands are read a lot more too I think. And if you think about it,
>you have to check an awful lot... if you have a MODIFY_EXPR, and if the
>RHS matches a certain class of binary operators, then you still have to
>check if the LHS or the RHS is an SSA_NAME or not, so figuring out where
>use(0) is maybe take quite a bit of calculation. I do not think this is
>the direction to go. I would expect it to be measurably slower.
>
>Once its abstracted out, its easy for someone to play with tho I
>suppose.
Precisely. Once abstracted out, people at least have the chance to
prove our gut instincts wrong :-)
jeff