![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to Hard.out CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [CSRG BSD Unix] / 40BSD / cmd / efl / efltest|
Return to Hard.out CVS log | Up to [CSRG BSD Unix] / 40BSD / cmd / efl / efltest |
1.1 root 1: subroutine sam(x)
2: integer x(27, 4)
3: integer y(27), z(5, 7)
4: call ef1asc(x(10, 2), 6, 3habc, 3)
5: y(24) = 4
6: z(8, 4) = 2
7: call ef1asc(z(3, 1), 6, 3hxyz, 3)
8: end
9: c main program
10: integer mod, m, x(2)
11: x(1) = 3*(x(1)/3)+1
12: x(1) = x(1)-3*(mod(x(1)/3, 3)-1)
13: x(1) = x(1)-9*(mod(x(1)/9, 3)-1)
14: x(1) = mod(x(1), 27)+27
15: x(2) = 10000*(x(2)/10000)+1
16: x(2) = mod(x(2), 10000)+10000
17: x(1) = x(1)-2
18: x(1) = x(1)-6
19: x(1) = x(1)-18
20: x(1) = x(1)-54
21: x(1) = 3*(x(1)/3)+2*(mod(x(1), 3)+1)-1
22: x(1) = x(1)-3*(mod(x(1)/3, 3)-(2*(mod(x(1)/3, 3)+1)-1))
23: x(1) = x(1)-9*(mod(x(1)/9, 3)-(2*(mod(x(1)/9, 3)+1)-1))
24: x(1) = mod(x(1), 27)+27*(2*(x(1)/27+1)-1)
25: x(1) = x(1)+18
26: x(1) = 3*(x(1)/3)
27: x(1) = x(1)-3*(mod(x(1)/3, 3)-(mod(x(1), 3)+2))
28: x(1) = x(1)+27*(mod(x(1)/3, 3)+1)
29: x(1) = x(1)-9*(mod(x(1)/9, 3)-((mod(x(1)/9, 3)+1)*(x(1)/27+1)-1))
30: end
31: c main program
32: integer mod, k, x(1)
33: k = mod(x(1), 4)+mod(x(1)/4, 20)+1+x(1)/80+1
34: end
35: c main program
36: integer mod, i, x(3, 5)
37: integer temp, temp1, temp2, temp3, temp4
38: x(1, 2) = 50*(x(1, 2)/50)+i-1
39: x(1, 2) = mod(x(1, 2), 50)+50*(i-1)
40: x(2, 2) = 50*(x(2, 2)/50)+i-1
41: x(2, 2) = mod(x(2, 2), 50)+50*(i-1)
42: x(3, 2) = i-1
43: temp2 = mod(x(1, 1), 50)+1
44: temp1 = x(1, 3)/50+1
45: temp = x(3, 5)+1
46: do 1 i = temp2, temp1, temp
47: temp4 = i**2
48: temp3 = i**2
49: x(1, temp4) = mod(x(1, temp4), 50)+50*((x(1, temp4)/50+1)*(x(3,
50: 1 temp3+1)+1)-1)
51: 1 continue
52: end
53: c main program
54: real x(1)
55: integer y(2)
56: x(1) = 1.
57: y(1) = 1
58: x(1) = 2.
59: end
60: c main program
61: common /cc/ a3
62: complex a3
63: integer a, b
64: logical a1, a2
65: a2 = .true.
66: a = 1
67: a1 = .false.
68: a = 2
69: end
70: c main program
71: common /cc/ a
72: complex a
73: integer b
74: a = 1
75: end
76: subroutine a(b)
77: real b
78: common /cc/ a1
79: complex a1
80: integer b1
81: end
82: subroutine alltyp(y, y1, y2, y3, y4)
83: integer y(38)
84: real y1(38)
85: logical y2(38)
86: complex y3(19)
87: double precision y4(19)
88: common /cc/ a
89: complex a
90: integer b, x(38)
91: real x1(38)
92: logical x2(38)
93: complex x3(19)
94: double precision x4(19)
95: equivalence (x(1), x1(1), x2(1), x3(1), x4(1))
96: x3(10) = 1
97: x(13) = x3(10)
98: x4(5) = x(13)
99: x1(3) = x4(5)
100: x2(23) = .false.
101: call ef1asc(x(36), 9, 7habcdefg, 7)
102: call ef1asc(x(28), 8, x(36), 9)
103: end
104: c main program
105: common /cc/ a
106: complex a
107: integer b, i, j
108: logical l
109: goto 11
110: 1 if (.not. l) goto 2
111: goto 9
112: goto 7
113: 2 goto 5
114: 3 goto 4
115: goto 6
116: 4 goto 3
117: goto 6
118: 5 if (j .eq. 2) goto 4
119: if (j .eq. 1) goto 3
120: 6 continue
121: 7 goto 12
122: 8 j = 2
123: goto 12
124: 9 if (i .eq. j) goto 10
125: j = j+1
126: goto 9
127: 10 continue
128: goto 12
129: 11 if (i .gt. 0 .and. i .le. 3) goto ( 1, 9, 8), i
130: 12 continue
131: end
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.