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 different, increment your counter.