ltrans-2.c

linux下编程用 编译软件

/* { dg-do compile } */ 
/* { dg-options "-O2 -ftree-loop-linear -fdump-tree-ltrans-all" } */

double u[1782225];
int foo(int N, int *res)
{
  unsigned int i, j;
  double sum = 0;
  
  /* This loop should be converted to a perfect nest and
     interchanged.  */
  for (i = 0; i < N; i++)
    {
      for (j = 0; j < N; j++)
	{
	  sum = sum + u[i + 1335 * j];
	  if (j == N - 1)
	    u[1336 * i] *= 2;
	}
    }
  *res = sum + N;
}
/* { dg-final { scan-tree-dump-times "transformed loop" 1 "ltrans"} {
   xfail *-*-*} } */ 
/* { dg-final { cleanup-tree-dump "ltrans" } } */