|
|
1.1 root 1: c subroutine tst2
2: parameter(ntest=2)
3: c Arithmetic on global integer variables
4: c common /t2/ i,j,k,l,m
5: i=1
6: j=2
7: k=3
8: l=4
9: m=10
10: if( i+j .ne. k ) call e(1,ntest)
11: if( i+k .ne. l ) call e(2,ntest)
12: if( j-k .ne. -i ) call e(3,ntest)
13: if( j*(j+k) .ne. m ) call e(4,ntest)
14: if( -m .ne. -(k+k+l) ) call e(5,ntest)
15: if( i / i .ne. 1 ) call e(6,ntest)
16: if( m*m / m .ne. m ) call e(7,ntest)
17: if( 10*m .ne. 100 ) call e(8,ntest)
18: if( m*(-10) .ne. -100 ) call e(9,ntest)
19: if( j / k .ne. 0 ) call e(10,ntest)
20: if( 100 / k .ne. 33 ) call e(11,ntest)
21: c if( i+j*k+l+m mod j + 50 / k .ne. 27 ) call e(12,ntest)
22: if( j*k*m / 6 .ne. 10 ) call e(13,ntest)
23: if( (k.gt.4) .or. (k.ge.4) .or. (k.eq.4) ) call e(14,ntest)
24: if( (m.lt.j) .or. (m.le.j) .or. (m.eq.j) ) call e(15,ntest)
25: if( k .ne. i+j ) call e(16,ntest)
26: if( j .lt. i ) call e(17,ntest)
27: if( j .le. i ) call e(18,ntest)
28: if( j .eq. i ) call e(19,ntest)
29: if( j .ne. j ) call e(20,ntest)
30: if( i .ge. j ) call e(21,ntest)
31: if( i .gt. j ) call e(22,ntest)
32: if( k**2 .ne. 9 ) call e(23,ntest)
33: if( j**k .ne. 8 ) call e(24,ntest)
34: end
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.