| 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 FXNUID (NREGN, IGROUP, MR, MS, ML, NSPR, ILINE, ISIDE, |
| 8 |
& NLPS, IFLINE, ILLIST, LCON, ISLIST, IFSIDE, LINKR, LINKS, |
| 9 |
& LINKL, NNN, MAXNL, MXND, LISTL, NUID, NXL, LXN, INDX, NOROOM, |
| 10 |
& ERR) |
| 11 |
C*********************************************************************** |
| 12 |
|
| 13 |
C FXNUID - FIX NUID'S: RESETS NUID'S OF INTERIOR LINES IN GROUPS |
| 14 |
C TO ZERO |
| 15 |
|
| 16 |
C*********************************************************************** |
| 17 |
|
| 18 |
DIMENSION IGROUP(NREGN), NSPR(MR), ILINE(ML), ISIDE(MS), NLPS(MS) |
| 19 |
DIMENSION IFLINE(MS), ILLIST(MS*3), LCON(3, ML), ISLIST(MR*4) |
| 20 |
DIMENSION IFSIDE(MR), LINKR(2, MR), LINKS(2, MS), LINKL(2, ML) |
| 21 |
DIMENSION LISTL(MAXNL), NUID(MXND), NXL(2, 3*MXND), LXN(4, MXND) |
| 22 |
DIMENSION INDX(MXND), LINES(20) |
| 23 |
|
| 24 |
LOGICAL ADDLNK, ERR, LDUP, NOROOM |
| 25 |
|
| 26 |
C GET LIST OF LINES |
| 27 |
|
| 28 |
NOROOM = .FALSE. |
| 29 |
ERR = .FALSE. |
| 30 |
|
| 31 |
ADDLNK = .FALSE. |
| 32 |
N1 = 1 |
| 33 |
DO 100 I = 1, NREGN |
| 34 |
CALL LTSORT (MR, LINKR, IGROUP(I), IPTR, ADDLNK) |
| 35 |
IF (IPTR .GT. 0) THEN |
| 36 |
CALL LLIST (MS, ML, MAXNL, NSPR(IPTR), NL, IGROUP(I), |
| 37 |
& LISTL(N1), ILINE, ISIDE, NLPS, IFLINE, ILLIST, LCON, |
| 38 |
& ISLIST(IFSIDE(IPTR)), LINKS, LINKL, ERR) |
| 39 |
N1 = N1 + NL |
| 40 |
IF (N1 .GT. MAXNL) THEN |
| 41 |
CALL MESSAGE('IN FXNUID, LINE LIST OVERFLOW') |
| 42 |
NOROOM = .TRUE. |
| 43 |
ERR = .TRUE. |
| 44 |
RETURN |
| 45 |
END IF |
| 46 |
END IF |
| 47 |
100 CONTINUE |
| 48 |
NUML = N1 - 1 |
| 49 |
|
| 50 |
C SORT THE LINE LIST |
| 51 |
|
| 52 |
IF (NUML .GT. 1) THEN |
| 53 |
DO 110 I = 1, NUML |
| 54 |
INDX(I) = I |
| 55 |
110 CONTINUE |
| 56 |
CALL INDEXI_FQ (NUML, LISTL, NUML, INDX) |
| 57 |
ELSE |
| 58 |
RETURN |
| 59 |
END IF |
| 60 |
|
| 61 |
C IDENTIFY INTERIOR LINES |
| 62 |
|
| 63 |
I1 = 1 |
| 64 |
120 CONTINUE |
| 65 |
LDUP = .FALSE. |
| 66 |
IF (I1 .LT. NUML) THEN |
| 67 |
I2 = I1 + 1 |
| 68 |
130 CONTINUE |
| 69 |
IF (I2 .LE. NUML) THEN |
| 70 |
IF (LISTL(INDX(I1)) .EQ. LISTL(INDX(I2))) THEN |
| 71 |
INDX(I2) = 0 |
| 72 |
I2 = I2 + 1 |
| 73 |
LDUP = .TRUE. |
| 74 |
GO TO 130 |
| 75 |
ELSE |
| 76 |
IF (.NOT.LDUP) INDX(I1) = 0 |
| 77 |
I1 = I2 |
| 78 |
GO TO 120 |
| 79 |
END IF |
| 80 |
END IF |
| 81 |
END IF |
| 82 |
|
| 83 |
C FORM SORTED LINE LIST IN INDX THEN COPY IT BACK TO LISTL |
| 84 |
|
| 85 |
N1 = 0 |
| 86 |
DO 140 I = 1, NUML |
| 87 |
IF (INDX(I) .GT. 0) THEN |
| 88 |
N1 = N1 + 1 |
| 89 |
INDX(N1) = LISTL(INDX(I)) |
| 90 |
END IF |
| 91 |
140 CONTINUE |
| 92 |
NUML = N1 |
| 93 |
DO 150 I = 1, NUML |
| 94 |
LISTL(I) = INDX(I) |
| 95 |
150 CONTINUE |
| 96 |
|
| 97 |
C SORT NUID'S ON LINE'S FOR SPEEDY LOOKUP |
| 98 |
|
| 99 |
N1 = 0 |
| 100 |
DO 160 I = 1, NNN |
| 101 |
IF (NUID(I) .GT. 1000000000) THEN |
| 102 |
N1 = N1 + 1 |
| 103 |
INDX(N1) = I |
| 104 |
END IF |
| 105 |
160 CONTINUE |
| 106 |
NUMN = N1 |
| 107 |
IF (NUMN .GT. 1) CALL INDEXI_FQ (NNN, NUID, NUMN, INDX) |
| 108 |
|
| 109 |
C LOOP FOR INTERIOR LINES |
| 110 |
|
| 111 |
DO 220 I = 1, NUML |
| 112 |
KEY = 1000000000 + LISTL(I)*100000 |
| 113 |
|
| 114 |
C FIND LOW POINT |
| 115 |
|
| 116 |
IBOT = 0 |
| 117 |
DO 170 J = 1, NUMN |
| 118 |
IBOT = J |
| 119 |
IF (NUID(INDX(J)) .GE. KEY) GO TO 180 |
| 120 |
170 CONTINUE |
| 121 |
180 CONTINUE |
| 122 |
|
| 123 |
C CHECK INDIVIDUAL POINTS BETWEEN LOW + 1 AND HIGH - 1 |
| 124 |
|
| 125 |
KEY1 = KEY/100000 |
| 126 |
DO 190 J = IBOT, NUMN |
| 127 |
IF (NUID(INDX(J))/100000 .EQ. KEY1) THEN |
| 128 |
LXN(2, INDX(J)) = ABS(LXN(2, INDX(J))) |
| 129 |
INDX(J) = 0 |
| 130 |
ELSE IF (NUID(INDX(J)) .GT. KEY) THEN |
| 131 |
GO TO 200 |
| 132 |
END IF |
| 133 |
190 CONTINUE |
| 134 |
200 CONTINUE |
| 135 |
|
| 136 |
C COMPACT NUID'S INDEX LIST |
| 137 |
|
| 138 |
N1 = 0 |
| 139 |
DO 210 J = 1, NUMN |
| 140 |
IF (INDX(J) .GT. 0) THEN |
| 141 |
N1 = N1 + 1 |
| 142 |
INDX(N1) = INDX(J) |
| 143 |
END IF |
| 144 |
210 CONTINUE |
| 145 |
NUMN = N1 |
| 146 |
|
| 147 |
220 CONTINUE |
| 148 |
|
| 149 |
C CHECK ALL POINT NUID'S TO MAKE SURE THEY ARE ON BOUNDARY |
| 150 |
|
| 151 |
DO 240 I = 1, NNN |
| 152 |
IF (NUID(I) .GT. 0 .AND. NUID(I) .LT. 100000) THEN |
| 153 |
NODE = I |
| 154 |
CALL GETLXN (MXND, LXN, NODE, LINES, NL, ERR) |
| 155 |
IF (NL .GT. 20) THEN |
| 156 |
CALL MESSAGE('IN FXNUID, TOO MANY LINES/NODE') |
| 157 |
NOROOM = .TRUE. |
| 158 |
ERR = .TRUE. |
| 159 |
RETURN |
| 160 |
END IF |
| 161 |
|
| 162 |
KOUNT = 0 |
| 163 |
DO 230 J = 1, NL |
| 164 |
I1 = NXL(1, LINES(J)) + NXL(2, LINES(J)) - I |
| 165 |
IF (LXN(2, I1) .LT. 0) KOUNT = KOUNT + 1 |
| 166 |
230 CONTINUE |
| 167 |
IF (KOUNT .LT. 2) LXN(2, I) = ABS(LXN(2, I)) |
| 168 |
END IF |
| 169 |
240 CONTINUE |
| 170 |
|
| 171 |
RETURN |
| 172 |
|
| 173 |
END |