tests/inputs/eqv/data_dependent2/1.c

   1 void compute_row(int, int *);
   2 int f(const int *);
   3 int g(int, int);
   4 int h(int);
   5
   6 int M;
   7 int N;
   8
   9 void dd(int C[])
  10 {
  11         int i, j;
  12         int in1[1][1];
  13         int in2[1];
  14         int A[1][10];
  15         #pragma value_bounds in2 "-1" "1"
  16         int m;
  17
  18         for (i = 0; i < N; ++i) {
  19                 m = i+1;
  20                 for (j = 0; j < M; ++j)
  21                         m = g(h(m), in1[i][j]);
  22                 compute_row(h(m), A[i]);
  23         }
  24         A[5][6] = 0;
  25         for (i = 0; i < N; ++i)
  26                 if (i + in2[i] >= 0 && i + in2[i] < N)
  27                         C[i] = f(A[i + in2[i]]);
  28                 else
  29                         C[i] = 0;
  30 }