gcc/testsuite/gcc.dg/tree-ssa/reassoc-2.c

   1 /* { dg-do compile } */
   2 /* { dg-options "-O2 -fdump-tree-optimized" } */
   3 int f (int a0,int a1,int a2,int a3,int a4)
   4 {
   5 int b0, b1, b2, b3, b4,e;
   6   /* this can be optimized to four additions... */
   7   b4 = a4 + a3 + a2 + a1 + a0;
   8   b3 = a3 + a2 + a1 + a0;
   9   b2 = a2 + a1 + a0;
  10   b1 = a1 + a0;
  11   /* This is actually 0 */
  12   e = b4 - b3 + b2 - b1 - a4 - a2;
  13   return e;
  14 }
  15
  16 /* { dg-final { scan-tree-dump-times "return 0" 1 "optimized" } } */
  17 /* { dg-final { cleanup-tree-dump "optimized" } } */