1! Program to test intrinsic bitops 2program intrinsic_bitops 3 implicit none 4 integer(kind=4) :: i, j, k, o, t 5 integer(kind=8) :: a, b, c 6 7 o = 0 8 i = 2 9 j = 3 10 k = 12 11 a = 5 12 13 if (.not. btest (i, o+1)) STOP 1 14 if (btest (i, o+2)) STOP 2 15 if (iand (i, j) .ne. 2) STOP 3 16 if (ibclr (j, o+1) .ne. 1) STOP 4 17 if (ibclr (j, o+2) .ne. 3) STOP 5 18 if (ibits (k, o+1, o+2) .ne. 2) STOP 6 19 if (ibset (j, o+1) .ne. 3) STOP 7 20 if (ibset (j, o+2) .ne. 7) STOP 8 21 if (ieor (i, j) .ne. 1) STOP 9 22 if (ior (i, j) .ne. 3) STOP 10 23 if (ishft (k, o+2) .ne. 48) STOP 11 24 if (ishft (k, o-3) .ne. 1) STOP 12 25 if (ishft (k, o) .ne. 12) STOP 13 26 if (ishftc (k, o+30) .ne. 3) STOP 14 27 if (ishftc (k, o-30) .ne. 48) STOP 15 28 if (ishftc (k, o+1, o+3) .ne. 9) STOP 16 29 if (not (i) .ne. -3) STOP 17 30 if (ishftc (a, 1, bit_size(a)) .ne. 10) STOP 18 31 if (ishftc (1, 1, 32) .ne. 2) STOP 19 32end program 33