1  /* { dg-do compile { target size32plus } } */
       2  /* { dg-options "-O2 -ftree-loop-distribution -ftree-loop-distribute-patterns -fdump-tree-ldist-details" } */
       3  
       4  #define M (256)
       5  #define N (512)
       6  int a[M][N], b[M][N], c[M];
       7  
       8  void
       9  foo (void)
      10  {
      11    for (int i = M - 1; i >= 0; --i)
      12      {
      13        c[i] = 0;
      14        for (unsigned j = N; j > 0; --j)
      15  	a[i][j - 1] = b[i][j - 1];
      16      }
      17  }
      18  
      19  /* { dg-final { scan-tree-dump-times "Loop nest . distributed: split to 0 loops and 2 library" 1 "ldist" } } */