1  /* { dg-do compile { target int32plus } } */ 
       2  /* { dg-options "-O2 -ftree-loop-distribution -fdump-tree-ldist-all" } */
       3  
       4  int loop1 (int k)
       5  {
       6    unsigned int i;
       7    unsigned int j;
       8    int a[100][100], b[100][100], c[100][100], d[100][100];
       9  
      10    a[0][0] = k;
      11    for (i = 1; i < 100; i ++)
      12      for (j = 1; j < (100-1); j++) 
      13        {   
      14          a[i][j] = k * i; /* S1 */
      15          b[i][j] = a[i][j-1] + k; /* S2 */
      16          c[i][j] = b[i][j] + a[i][j+1]; /* S3 */
      17          d[i][j] = c[i][j] + k + i; /* S4 */
      18        }
      19    /* Dependences:
      20       S1->S2 (flow, level 2)
      21       S1->S3 (anti, level 2)
      22       S2->S3 (flow, level 0)
      23       S3->S4 (flow, level 0)
      24    */
      25    
      26    return a[100-1][100-1] + b[100-1][100-1] + c[100-1][100-1] + d[100-1][100-1];
      27  }
      28  
      29  /* FIXME: This is XFAILed because of a data dependence analysis
      30     problem: the dependence test fails with a "don't know" relation.  */
      31  
      32  /* { dg-final { scan-tree-dump-times "distributed: split to 2 loops" 1 "ldist" { xfail *-*-* } } } */