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

1.1       root        1:       INTEGER FUNCTION FINDND(K1, K2)
                      2:       INTEGER K1(2)
                      3:       INTEGER PLAT, PNODE
                      4:       LOGICAL COMPAR
                      5:       COMMON /HEAD/ LNODE, PNODE, NODE(500)
                      6:       COMMON /GRAPH/ LLAT, PLAT, LAT(6000)
                      7: C
                      8: C     FINDS SUBPROGRAM WHOSE PACKED NAME IS IN K1(2) AND
                      9: C     RETURNS INDEX OF ITS LAT ENTRY AS VALUE OF FINFND
                     10: C     RETURNS IN K2 INDEX IN NODE OF LAT INDEX
                     11: C     IGNORES ASF NODES IN LAT BY IGNORING NEGATIVE NODE
                     12: C     ENTRIES
                     13: C
                     14:       IF (PNODE-1) 40, 40, 10
                     15:    10 K = PNODE - 1
                     16:       DO 30 I=1,K
                     17:         IF (NODE(I)) 30, 30, 20
                     18:    20   FINDND = NODE(I)
                     19:         K2 = I
                     20:         IF (COMPAR(LAT(FINDND),K1)) GO TO 50
                     21:    30 CONTINUE
                     22:    40 FINDND = 0
                     23:    50 RETURN
                     24:       END

unix.superglobalmegacorp.com

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