1  /* PR tree-optimization/46099 */
       2  /* { dg-do compile } */
       3  /* { dg-options "-ftree-parallelize-loops=2 -fcompare-debug -O" } */
       4  
       5  static inline void
       6  bar (int *i)
       7  {
       8    int j = *i;
       9  }
      10  
      11  void baz (int *, int *, int *);
      12  
      13  void
      14  f1 (int n)
      15  {
      16    int i;
      17    for (i = 0; i < n; i++)
      18      bar (&i);
      19  }
      20  
      21  void
      22  f2 (int n)
      23  {
      24    int i;
      25    int a[10000], b[10000], c[10000];
      26    baz (a, b, c);
      27    for (i = 0; i < n; i++)
      28      {
      29        void *p = c;
      30        a[i] = b[i] + c[i];
      31      }
      32    baz (a, b, c);
      33  }
      34  
      35  void
      36  f3 (int n)
      37  {
      38    int i;
      39    int a[10000], b[10000], c[10000];
      40    baz (a, b, c);
      41    for (i = 0; i < n; i++)
      42      {
      43        a[i] = b[i] + c[i];
      44        void *p = c;
      45      }
      46    baz (a, b, c);
      47  }