update barvinok to version 0.41.7
[ppn.git] / tests / inputs / eqv / commutative / 1.c
blob646c7bea511a7d2a9911d9ffa91b0fe5cc798fbe
1 int f(int);
2 int g(int);
3 int N;
5 int main()
7 int i;
8 int in[1];
9 int A[1];
10 int D[1];
11 int E[1];
12 int out;
14 if (N >= 1) {
15 A[0] = in[0];
16 for (i = 1; i < N; ++i) {
17 D[i] = f(in[i]);
18 E[i] = g(A[i-1]);
19 A[i] = D[i] + E[i];
21 out = A[N-1];
24 return out;