gcc/testsuite/gcc.dg/tree-ssa/ssa-sccvn-4.c

   1 /* { dg-do compile } */
   2 /* { dg-options "-O2 -fdump-tree-fre-stats" } */
   3
   4 int vnum_test8(int *data)
   5 {
   6   int i;
   7   int stop = data[3];
   8   int m = data[4];
   9   int n = m;
  10   int p = 0;
  11
  12   for (i=0; i<stop; i++) {
  13     int k = data[2];
  14     data[5] = 0;
  15     if (i < 30)
  16       data[5] = m - n;
  17     p = data[5];
  18     k = data[1];
  19     m = m + k;
  20     n = n + k;
  21   }
  22   return p;
  23 }
  24 /* We should eliminate m - n, n + k, set data[5] = 0, eliminate the
  25    address arithmetic for data[5], and set p = 0.
  26 /* { dg-final { scan-tree-dump-times "Eliminated: 6" 1 "fre"} } */
  27 /* { dg-final { cleanup-tree-dump "fre" } } */