summaryrefslogtreecommitdiff
path: root/test/nul_basic2.cloog
blob: bf3c78c169ae7d20f105eb5b3eee312e88fd7ba7 (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
47
48
49
50
51
52
53
54
# Optimal code is in fact :
#
# for (i=0;i<=M;i+=2) {
#   S1 ;
# }
 
# language: C
c

# parameter n
1 3
#  n  1
1  1 -2
1
n

2 # Number of statements

1
# {i, j | i=2*j; 1<=i<=n}
3 5
#  i  j  n  1
0  1 -2  0  0
1  1  0  0 -1
1 -1  0  1  0
0  0  0

1
# {i, j | i=4*j; 1<=i<=n}
3 5
#  i  j  n  1
0  1 -4  0  0
1  1  0  0 -1
1 -1  0  1  0
0  0  0
0

0 # Scattering functions
5 10
# t1 t2 t3 t4 t5  i  j  n  1
0  1  0  0  0  0  0  0  0  0
0  0  1  0  0  0 -1  0  0  0
0  0  0  1  0  0  0  0  0  0
0  0  0  0  1  0  0 -1  0  0
0  0  0  0  0  1  0  0  0  0

5 10
# t1 t2 t3 t4 t5  i  j  n  1
0  1  0  0  0  0  0  0  0  0
0  0  1  0  0  0 -1  0  0  0
0  0  0  1  0  0  0  0  0  0
0  0  0  0  1  0  0 -1  0  0
0  0  0  0  0  1  0  0  0  0
0