|
|
1.1 root 1: SUBROUTINE RDLIST(HEAD, L, N, M)
2: C
3: C HEAD IS THE HEAD OF A LINEAR LINKED LIST IN DSA
4: C L IS MAX NUMBER OF ITEMS DESIRED
5: C N IS NUMBER OF ITEMS RETURNED
6: C M IS END OF LIST MARKER
7: C
8: INTEGER HEAD, STACK, DSA, PDSA
9: COMMON /CTABL/ LDSA, PDSA, DSA(5000)
10: COMMON /CEXPRS/ LSTACK, STACK(620)
11: N = 0
12: 10 IF (HEAD.EQ.M .OR. N.GE.L) GO TO 20
13: N = N + 1
14: STACK(N) = DSA(HEAD)
15: HEAD = DSA(HEAD+1)
16: GO TO 10
17: 20 RETURN
18: END
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.