Return to Hard.out CVS log

Up to [CSRG BSD Unix] / 41BSD / cmd / efl / efltest

Initial revision

      subroutine sam(x)
      integer x(27, 4)
      integer y(27), z(5, 7)
      call ef1asc(x(10, 2), 6, 3habc, 3)
      y(24) = 4
      z(8, 4) = 2
      call ef1asc(z(3, 1), 6, 3hxyz, 3)
      end
c  main program
      integer mod, m, x(2)
      x(1) = 3*(x(1)/3)+1
      x(1) = x(1)-3*(mod(x(1)/3, 3)-1)
      x(1) = x(1)-9*(mod(x(1)/9, 3)-1)
      x(1) = mod(x(1), 27)+27
      x(2) = 10000*(x(2)/10000)+1
      x(2) = mod(x(2), 10000)+10000
      x(1) = x(1)-2
      x(1) = x(1)-6
      x(1) = x(1)-18
      x(1) = x(1)-54
      x(1) = 3*(x(1)/3)+2*(mod(x(1), 3)+1)-1
      x(1) = x(1)-3*(mod(x(1)/3, 3)-(2*(mod(x(1)/3, 3)+1)-1))
      x(1) = x(1)-9*(mod(x(1)/9, 3)-(2*(mod(x(1)/9, 3)+1)-1))
      x(1) = mod(x(1), 27)+27*(2*(x(1)/27+1)-1)
      x(1) = x(1)+18
      x(1) = 3*(x(1)/3)
      x(1) = x(1)-3*(mod(x(1)/3, 3)-(mod(x(1), 3)+2))
      x(1) = x(1)+27*(mod(x(1)/3, 3)+1)
      x(1) = x(1)-9*(mod(x(1)/9, 3)-((mod(x(1)/9, 3)+1)*(x(1)/27+1)-1))
      end
c  main program
      integer mod, k, x(1)
      k = mod(x(1), 4)+mod(x(1)/4, 20)+1+x(1)/80+1
      end
c  main program
      integer mod, i, x(3, 5)
      integer temp, temp1, temp2, temp3, temp4
      x(1, 2) = 50*(x(1, 2)/50)+i-1
      x(1, 2) = mod(x(1, 2), 50)+50*(i-1)
      x(2, 2) = 50*(x(2, 2)/50)+i-1
      x(2, 2) = mod(x(2, 2), 50)+50*(i-1)
      x(3, 2) = i-1
      temp2 = mod(x(1, 1), 50)+1
      temp1 = x(1, 3)/50+1
      temp = x(3, 5)+1
      do  1 i = temp2, temp1, temp
         temp4 = i**2
         temp3 = i**2
         x(1, temp4) = mod(x(1, temp4), 50)+50*((x(1, temp4)/50+1)*(x(3,
     1      temp3+1)+1)-1)
   1     continue
      end
c  main program
      real x(1)
      integer y(2)
      x(1) = 1.
      y(1) = 1
      x(1) = 2.
      end
c  main program
      common /cc/ a3
      complex a3
      integer a, b
      logical a1, a2
      a2 = .true.
      a = 1
      a1 = .false.
      a = 2
      end
c  main program
      common /cc/ a
      complex a
      integer b
      a = 1
      end
      subroutine a(b)
      real b
      common /cc/ a1
      complex a1
      integer b1
      end
      subroutine alltyp(y, y1, y2, y3, y4)
      integer y(38)
      real y1(38)
      logical y2(38)
      complex y3(19)
      double precision y4(19)
      common /cc/ a
      complex a
      integer b, x(38)
      real x1(38)
      logical x2(38)
      complex x3(19)
      double precision x4(19)
      equivalence (x(1), x1(1), x2(1), x3(1), x4(1))
      x3(10) = 1
      x(13) = x3(10)
      x4(5) = x(13)
      x1(3) = x4(5)
      x2(23) = .false.
      call ef1asc(x(36), 9, 7habcdefg, 7)
      call ef1asc(x(28), 8, x(36), 9)
      end
c  main program
      common /cc/ a
      complex a
      integer b, i, j
      logical l
      goto  11
   1     if (.not. l) goto 2
            goto  9
            goto  7
   2        goto  5
   3           goto  4
               goto  6
   4           goto  3
               goto  6
   5           if (j .eq. 2) goto  4
               if (j .eq. 1) goto  3
   6     continue
   7     goto  12
   8     j = 2
         goto  12
   9     if (i .eq. j) goto  10
            j = j+1
            goto  9
  10     continue
         goto  12
  11     if (i .gt. 0 .and. i .le. 3) goto ( 1,  9,  8), i
  12  continue
      end

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.