> The idea is a bit complex. Anyway the fold function has no one only
> return so i can't compare input tree with output one, and it's called
> from a lot of others functions of others files. Ian said to create a
> counter and increment it every time a role is triggered, it's seems
> better but it'
Dino Puller wrote on 10/27/06 11:25:
The idea is a bit complex. Anyway the fold function has no one only
return so i can't compare input tree with output one, and it's called
from a lot of others functions of others files.
>
Of course you can. fold() does not modify the input tree anymore. Ju
2006/10/26, Diego Novillo <[EMAIL PROTECTED]>:
Dino Puller wrote on 10/26/06 10:11:
> How many times gcc simplify expressions like: x/x, 0*x, 1*y, a+0,
> x*x/x and so on
>
You are probably looking at folding then. An initial idea might be to
put some code in fold-const.c:fold that compares the
Dino Puller wrote on 10/26/06 10:11:
How many times gcc simplify expressions like: x/x, 0*x, 1*y, a+0,
x*x/x and so on
You are probably looking at folding then. An initial idea might be to
put some code in fold-const.c:fold that compares the input tree
expression with the output, if they are
"Dino Puller" <[EMAIL PROTECTED]> writes:
> i want to make a statistic(i haven't found one) over linux source
> code, and i want to know how many times expressions are simplified by
> gcc.
I don't think any of us know what you mean by "how many times
expressions are simplified." Can you be mor
