summaryrefslogtreecommitdiff
path: root/cloog-0.17.0/test/non_optimal/youcef.cloog
blob: 297bf79c016d425549f84516cac71216b89308b4 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
# Optimal code is in fact :
# 
# for (i=0;i<=M;i++) {
#   S1 ;
#   for (j=0;j<=N;j++) {
#     S2 ;
#   }
#   S3 ;
# }

# language: C
c

# parameters {M, N | M>=1 N >=1}
0 2
0

3 # Number of statements

1
# {i | 0<=i<=5 i==j}
3 4
1  1  0  0
1 -1  0  5
0  1 -1  0
0  0  0

1
# {i | 0<=i<=5 i<=j<=5}
4 4
1  1  0  0
1 -1  0  5
1 -1  1  0
1  0 -1  5
0  0  0

1
# {i | 0<=i<=5 j==5}
3 4
1  1  0  0
1 -1  0  5
0  0  1 -5
0  0  0
0
 
0 # Scattering functions