|
|
1.1 root 1: c subroutine tst12
2: parameter(ntest=12)
3: c Loops
4:
5: j=5
6: k=0
7: do 1 i=1 , j
8: 1 k=k+1
9: if ( k.ne.5 ) call e(1,ntest)
10: k=0
11: do 2 i=5 , j
12: 2 k=k+1
13: if ( k.ne.1 ) call e(2,ntest)
14: k=0
15: do 3 i=6 , j
16: 3 k=k+1
17: if ( k.ne.0 ) call e(3,ntest)
18: k=0
19: do 4 i=-1 , -j ,-1
20: 4 k=k+1
21: if ( k.ne.5 ) call e(4,ntest)
22: k=0
23: do 5 i=-5 , -j ,-1
24: 5 k=k+1
25: if ( k.ne.1 ) call e(5,ntest)
26: k=0
27: do 6 i=-6 , j ,-1
28: 6 k=k+1
29: if ( k.ne.0 ) call e(6,ntest)
30: k=0
31: do 7 i=1 , 10 ,-1
32: 7 k=k+1
33: if ( k.ne.0 ) call e(7,ntest)
34:
35: k=0
36: i=2
37: do 8 l=1 , j , i
38: 8 k=k+1
39: if ( k.ne.3 ) call e(8,ntest)
40: k=0
41: do 9 l=5 , j , i
42: 9 k=k+1
43: if ( k.ne.1 ) call e(9,ntest)
44: k=0
45: do 10 l=6 , j , i
46: 10 k=k+1
47: if ( k.ne.0 ) call e(10,ntest)
48: k=0
49: do 11 l=-1 , -j ,-i
50: 11 k=k+1
51: if ( k.ne.3 ) call e(11,ntest)
52: k=0
53: do 12 l=-5 , -j ,-i
54: 12 k=k+1
55: if ( k.ne.1 ) call e(12,ntest)
56: k=0
57: do 13 l=-6 , j ,-i
58: 13 k=k+1
59: if ( k.ne.0 ) call e(13,ntest)
60: k=0
61: do 14 l=1 , 10 ,-i
62: 14 k=k+1
63: if ( k.ne.0 ) call e(14,ntest)
64: end
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.