| 1 |
C Copyright(C) 1999-2020 National Technology & Engineering Solutions |
| 2 |
C of Sandia, LLC (NTESS). Under the terms of Contract DE-NA0003525 with |
| 3 |
C NTESS, the U.S. Government retains certain rights in this software. |
| 4 |
C |
| 5 |
C See packages/seacas/LICENSE for details |
| 6 |
|
| 7 |
SUBROUTINE GETNXN (NPNODE, NPELEM, MAXKXN, NNXK, KXN, NXK, NUID, |
| 8 |
& NODE, NLIST, NUMN, ALL, ERR) |
| 9 |
C*********************************************************************** |
| 10 |
|
| 11 |
C SUBROUTINE GETNXN = GETS THE LIST OF NODES CONNECTED TO NODE |
| 12 |
|
| 13 |
C*********************************************************************** |
| 14 |
|
| 15 |
C NOTE: |
| 16 |
C NODES FOR WHICH NUID (NODE) IS NEGATIVE WILL NOT BE INCLUDED. |
| 17 |
C IF ALL=.FALSE., ONLY DIRECTLY CONNECTED NODES WILL BE LISTED. |
| 18 |
C IF ALL=.TRUE., INDIRECTLY CONNECTED NODES WILL ALSO BE LISTED. |
| 19 |
|
| 20 |
C*********************************************************************** |
| 21 |
|
| 22 |
DIMENSION NLIST (20), KLIST (20), M (3) |
| 23 |
DIMENSION KXN (NNXK, MAXKXN), NUID (NPNODE) |
| 24 |
DIMENSION NXK (NNXK, NPELEM) |
| 25 |
|
| 26 |
LOGICAL ALL, ERR |
| 27 |
|
| 28 |
ERR = .FALSE. |
| 29 |
CALL GETKXN (NPNODE, MAXKXN, NNXK, KXN, NUID, NODE, KLIST, NUMK, |
| 30 |
& ERR) |
| 31 |
IF (ERR) RETURN |
| 32 |
IF (ALL) THEN |
| 33 |
NDO = 3 |
| 34 |
ELSE |
| 35 |
NDO = 2 |
| 36 |
ENDIF |
| 37 |
NUM = 0 |
| 38 |
NOD = NODE |
| 39 |
|
| 40 |
DO 130 IK = 1, NUMK |
| 41 |
K = KLIST (IK) |
| 42 |
IF (NXK (1, K) .EQ. NOD) THEN |
| 43 |
M (1) = 4 |
| 44 |
M (2) = 2 |
| 45 |
M (3) = 3 |
| 46 |
ELSEIF (NXK (2, K) .EQ. NOD) THEN |
| 47 |
M (1) = 1 |
| 48 |
M (2) = 3 |
| 49 |
M (3) = 4 |
| 50 |
ELSEIF (NXK (3, K) .EQ. NOD) THEN |
| 51 |
M (1) = 2 |
| 52 |
M (2) = 4 |
| 53 |
M (3) = 1 |
| 54 |
ELSEIF (NXK (4, K) .EQ. NOD) THEN |
| 55 |
M (1) = 3 |
| 56 |
M (2) = 1 |
| 57 |
M (3) = 2 |
| 58 |
ELSE |
| 59 |
CALL MESSAGE('IMPOSSIBLE SITUATION IN GETNXN, LOOP 50') |
| 60 |
ERR = .TRUE. |
| 61 |
RETURN |
| 62 |
ENDIF |
| 63 |
|
| 64 |
NLK = NUM |
| 65 |
DO 120 IDO = 1, NDO |
| 66 |
MIDO = M (IDO) |
| 67 |
N = NXK (MIDO, K) |
| 68 |
IF ( (N .GT. 0) .AND. (NUID (N) .GT. 0)) THEN |
| 69 |
IF (NLK .LE. 0) THEN |
| 70 |
NUM = NUM + 1 |
| 71 |
NLIST (NUM) = N |
| 72 |
ELSE |
| 73 |
DO 100 I = 1, NLK |
| 74 |
IF (NLIST (I) .EQ. N)GOTO 110 |
| 75 |
100 CONTINUE |
| 76 |
NUM = NUM + 1 |
| 77 |
NLIST (NUM) = N |
| 78 |
ENDIF |
| 79 |
ENDIF |
| 80 |
110 CONTINUE |
| 81 |
120 CONTINUE |
| 82 |
130 CONTINUE |
| 83 |
|
| 84 |
NUMN = NUM |
| 85 |
IF (NUMN .GT. 20) THEN |
| 86 |
WRITE (*, 10000)NODE, NUID (NODE) |
| 87 |
ERR = .TRUE. |
| 88 |
ENDIF |
| 89 |
|
| 90 |
RETURN |
| 91 |
|
| 92 |
10000 FORMAT (' TOO MANY NODES CONNECTED TO NODE', I5, |
| 93 |
& ', NUID = ', I10) |
| 94 |
|
| 95 |
END |