update barvinok to version 0.41.7
[ppn.git] / tests / inputs / eqv / non-uniform / 2.c
blobb8f02a730db4b36ac84699f1ae226d6990b8e1b4
1 int f(int);
2 int g(int);
3 int N;
5 int main()
7 int i;
8 int in;
9 int A[1];
10 int out;
12 if (N >= 0) {
13 A[0] = g(in);
14 for (i = 1; i <= N; ++i) {
15 A[i] = g(f(A[i/2]));
17 out = A[N];
20 return out;