1  /* { dg-do compile } */ 
       2  /* { dg-options "-O2 -ftree-loop-distribution -fdump-tree-ldist-all" } */
       3  
       4  int loop1 (int k)
       5  {
       6    unsigned int i;
       7    int a[1000], b[1000];
       8  
       9    for (i = 1; i < (1000-1); i ++) {
      10      a[i] = a[i+1] + a[i-1]; /* S1 */
      11      b[i] = a[i-1] + k; /* S2 */
      12    }
      13    /*
      14      Dependences:
      15      S1->S2 (flow, level 1)
      16      S1->S1 (anti, level 1)
      17      S1->S1 (flow, level 1)
      18  
      19      One partition, because of the cost of cache misses.
      20    */
      21  
      22    return a[1000-2] + b[1000-1];
      23  }
      24  
      25  /* { dg-final { scan-tree-dump-times "distributed: split to 2 loops" 0 "ldist" } } */