1  /* { dg-options "-O3 -fdump-tree-cunrolli-details" } */
       2  
       3  static int s[10][10][10];
       4  static int d[10][10][10];
       5  
       6  __attribute__((noipa)) 
       7  int array()
       8  {
       9  	int i;
      10  	register int j, k;
      11  	for (i = 0; i < 10; i++)
      12  		for (j = 0; j < 10; j++)
      13  			for (k = 0; k < 10; k++)
      14  				d[i][j][k] = s[i][j][k];
      15  
      16  	return(0);
      17  }
      18  
      19  __attribute__((noipa)) 
      20  void TestBench()
      21  {
      22  	for (int i = 0; i < 150000; ++i)
      23  	{ 
      24  	   array();
      25  	}
      26  }
      27  
      28  int main(int argc, char *argv[])
      29  {
      30  
      31  	TestBench();
      32  
      33  	if (d[9][9][9] == 0 && s[9][9][9] == 0)
      34  	{
      35  		return 0;
      36  	}
      37  	else
      38  	{
      39  		return -1;
      40  	}	
      41  }
      42  
      43  /* { dg-final-use { scan-tree-dump-times "loop with 10 iterations completely unrolled" 2 "cunrolli"} } */