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 th
From: Dino Puller <[EMAIL PROTECTED]>
Date: 26-ott-2006 15.45
Subject: Re: fdump-tree explanation
To: Ian Lance Taylor <[EMAIL PROTECTED]>
25 Oct 2006 09:55:30 -0700, Ian Lance Taylor <[EMAIL PROTECTED]>:
"Dino Puller" <[EMAIL PROTECTED]> writes:
> i wan
Hi all,
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've found that "-O -ftree-dominator-opts -fdump-tree-optimized"
writes a file optimized, now if i can compare it with a not optimized
one i win, "u
Hi all,
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've found that "-O -ftree-dominator-opts -fdump-tree-optimized"
writes a file optimized, now if i can compare it with a not optimized
one i win, "u
2006/10/17, Mike Stump <[EMAIL PROTECTED]>:
On Oct 17, 2006, at 8:05 AM, Dino Puller wrote:
> i'm looking for a statistic of how many expressions simplification
> may be possible on source code
One way would be:
http://www.cs.fit.edu/~mmahoney/compression/text.html
But
Hi all,
i'm looking for a statistic of how many expressions simplification
may be possible on source code, for example in some linux project.
Otherwise how can i produce a statistic like that?
tnx,
Dino
