Return to INSYM.f CVS log

Up to [Research Unix] / researchv10no / cmd / pfort

Annotation of researchv10no/cmd/pfort/INSYM.f, revision 1.1.1.1

1.1       root        1:       LOGICAL FUNCTION INSYM(IDUM,II)
                      2:       INTEGER OUTUT, OUTUT2, OUTUT3, SYMHD, PDSA, SYMLEN, DSA, BNEXT
                      3:       COMMON /PARAMS/ INUT, OUTUT, NOCHAR, SYMLEN, OUTUT2, OUTUT3, I1
                      4:       COMMON /TABL/ NEXT, LABHD, SYMHD, BNEXT
                      5:       COMMON /FACTS/ NAME, NOST, ITYP, IASF
                      6:       COMMON /CTABL/ LDSA, PDSA, DSA(5000)
                      7: C
                      8: C     ROUTINE TO INPUT SYMBOL TABLE; RETURNS TRUE FOR SUCCESSFUL, ELSE
                      9: C     FALSE. KCODE=1 FOR TABLE, 3 FOR DUMMY TABLE, 4 FOR EOF
                     10: C     DUMMY TABLE CAUSES REFS FOR THIS PU TO BE FLUSHED IF
                     11: C     IDUM NE 0
                     12: C
                     13:  5    READ(OUTUT2) PDSA, KCODE, (DSA(I),I=1,PDSA)
                     14:       IF (KCODE-3) 10, 40, 30
                     15:    10 NAME = DSA(PDSA-2)
                     16:       SYMHD = DSA(PDSA-1)
                     17:       LABHD = DSA(PDSA)
                     18:       PDSA = PDSA - 3
                     19:       INSYM = .TRUE.
                     20:    20 RETURN
                     21:    30 INSYM = .FALSE.
                     22:       GO TO 20
                     23: C     FLUSH REFS FOR DUMMY TABLE IF IDUM NONZERO
                     24:  40   IF(IDUM.EQ.0) GOTO 5
                     25:  50   IF(INREF(IDUM)) 60, 60, 50
                     26: C     WRITE END OF REFS FOR DUMMY REFS IF II NE 0; ELSE GOT TO
                     27: C     NEXT SYMBOL TABLE
                     28:  60   IF(II.EQ.0) GOTO 5
                     29:       L = 1
                     30:       K = 3
                     31:       WRITE(II) L,K,L
                     32:       GOTO 5
                     33:       END

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