1  /* { dg-require-stack-size "52*8" } */
       2  
       3  f (n, a)
       4       int n;
       5       double a[];
       6  {
       7     double b[51];
       8     int i, j;
       9  
      10     i = 0;
      11  
      12     for (j = n - 1; j > 0; j--)
      13       b[i++] = 0;
      14  
      15     if (b[0] > b[i - 1])
      16       a[i] = b[i - 1];
      17  }