Debian Codegraph @

packages/seacas/applications/fastq/fixsub.f

raw
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 FIXSUB (MXND, NNNOLD, NNN, LLLOLD, LLL, KKKOLD, KKK,
8 & XN, YN, NUID, LXK, KXL, NXL, LXN, INDX, IAVAIL, NAVAIL, FINAL)
9 C***********************************************************************
10
11 C SUBROUTINE FIXSUB = FIXES THE KXL, LXK, NXL, AND LXN ARRAYS FOR
12 C SUBREGIONS - TAKES OUT DUPLICATE LINES AND NODES
13
14 C***********************************************************************
15
16 DIMENSION XN(MXND), YN(MXND), NUID(MXND), INDX(MXND)
17 DIMENSION LXK(4, MXND), KXL(2, 3*MXND), NXL(2, 3*MXND)
18 DIMENSION LXN(4, MXND)
19 DIMENSION LINES(20)
20
21 LOGICAL ERR, FINAL, FOUND, NOROOM
22
23 C GENERATE A LIST OF NODES ON THE PERIMETER IN SORTED ORDER
24
25 NPER = 0
26 DO 100 I = 1, NNNOLD
27 IF (NUID(I) .NE. 0) THEN
28 NPER = NPER + 1
29 INDX(NPER) = I
30 END IF
31 100 CONTINUE
32 CALL INDEXI_FQ (NNNOLD, NUID, NPER, INDX)
33
34 C GO THROUGH ALL THE BOUNDARY NODES IN THE LIST CHECKING FOR DUPLICATES
35
36 I = NNNOLD + 1
37 110 CONTINUE
38 IF (NUID(I) .NE. 0) THEN
39
40 C SEE IF ANOTHER NODE EXISTS WITH THE SAME NUID
41
42 CALL LOWFND (MXND, NUID, NPER, INDX, I, IOLD)
43
44 C IF ANOTHER NODE EXISTS, THEN START CHECKING LINES
45
46 IF (IOLD .GT. 0) THEN
47 CALL GETLXN (MXND, LXN, IOLD, LINES, KEND, ERR)
48
49 C CHECK ALL THE LINES ATTACHED TO THE OLD NODE, TO SEE IF THEY ARE
50 C THE SAME LINE ATTACHED TO THE NODE BEING CHECKED.
51
52 C IF THE SAME LINE EXISTS, DELETE THE LINE, AND MARK THE NODE FOR
53 C LATER DELETION
54
55 DO 200 J = 1, 3
56 IF (LXN(J, I) .NE. 0) THEN
57 L = ABS(LXN(J, I))
58 N1 = NXL(1, L) + NXL(2, L) - I
59 FOUND = .FALSE.
60 DO 180 K = 1, KEND
61 LOLD = LINES(K)
62 N2 = NXL(1, LOLD) + NXL(2, LOLD) - IOLD
63 IF ((NUID(N2) .EQ. NUID(N1)) .AND.
64 & (NUID(N2) .NE. 0)) THEN
65
66 C THE SAME LINE HAS BEEN FOUND - CHANGE REFERENCES TO THE LATEST
67 C NODE TO REFERENCES TO THE OLD NODE
68
69 KXL(2, LOLD) = KXL(1, L)
70 KELEM = KXL(1, L)
71 DO 120 II = 1, 4
72 IF (LXK(II, KELEM) .EQ. L)
73 & LXK(II, KELEM) = LOLD
74 120 CONTINUE
75 CALL DELLXN (MXND, LXN, NUID, NAVAIL, IAVAIL,
76 & N1, L, NNN, ERR, NOROOM)
77
78 C NOW RENUMBER THE REMAINING LINES IN THE KXL AND NXL ARRAYS
79
80 LLL = LLL - 1
81 DO 130 II = L, LLL
82 KXL(1, II) = KXL(1, II + 1)
83 KXL(2, II) = KXL(2, II + 1)
84 NXL(1, II) = NXL(1, II + 1)
85 NXL(2, II) = NXL(2, II + 1)
86 130 CONTINUE
87 KXL(1, LLL + 1) = 0
88 KXL(2, LLL + 1) = 0
89 NXL(1, LLL + 1) = 0
90 NXL(2, LLL + 1) = 0
91
92 C NOW RENUMBER ANY REFERENCES TO LINES ABOVE L IN THE LXK AND
93 C THE LXN ARRAYS
94
95 DO 150 II = 1, NNN
96 DO 140 JJ = 1, 3
97 IF (ABS(LXN(JJ, II)) .EQ. L) THEN
98 LXN(JJ, II) = LOLD
99 ELSE IF (ABS(LXN(JJ, II)) .GT. L) THEN
100 LXN(JJ, II) = ABS(LXN(JJ, II)) - 1
101 END IF
102 140 CONTINUE
103 IF (LXN(4, II) .EQ. L) THEN
104 LXN(4, II) = LOLD
105 ELSE IF (LXN(4, II) .GT. L) THEN
106 LXN(4, II) = LXN(4, II) - 1
107 END IF
108 150 CONTINUE
109 DO 170 II = KKKOLD + 1, KKK
110 DO 160 JJ = 1, 4
111 IF (LXK(JJ, II) .EQ. L) THEN
112 LXK(JJ, II) = LOLD
113 ELSE IF (LXK(JJ, II) .GT. L) THEN
114 LXK(JJ, II) = LXK(JJ, II) - 1
115 END IF
116 160 CONTINUE
117 170 CONTINUE
118 FOUND = .TRUE.
119 GOTO 190
120 END IF
121 180 CONTINUE
122
123 C END OF CHECK FOR THE SAME LINE - JUST ADD THE LINE TO THE IOLD NODE
124 C IF THERE IS A PLACE FOR THE LINE (I.E. THE MAXIMUM IS FOUR/NODE WITH
125 C THIS SCHEME).
126
127 190 CONTINUE
128 IF (.NOT.FOUND) THEN
129 CALL ADDLXN (MXND, LXN, NUID, NAVAIL, IAVAIL,
130 & IOLD, L, NNN, ERR, NOROOM)
131 IF (NXL(1, L) .EQ. I) THEN
132 NXL(1, L) = IOLD
133 ELSE
134 NXL(2, L) = IOLD
135 END IF
136 END IF
137 END IF
138 200 CONTINUE
139
140 C ALL THE OLD LINES HAVE BEEN GONE THROUGH - NOW DELETE THE NODE I
141
142 DO 210 J = 1, I - 1
143 IF (LXN(4, J) .LT. -I) THEN
144 LXN(4, J) = LXN(4, J) + 1
145 END IF
146 210 CONTINUE
147
148 NNN = NNN - 1
149 DO 230 J = I, NNN
150 DO 220 K = 1, 3
151 LXN(K, J) = LXN(K, J + 1)
152 220 CONTINUE
153 IF (LXN(4, J + 1) .LT. 0) THEN
154 LXN(4, J) = LXN(4, J + 1) + 1
155 ELSE
156 LXN(4, J) = LXN(4, J + 1)
157 END IF
158 XN(J) = XN(J + 1)
159 YN(J) = YN(J + 1)
160 NUID(J) = NUID(J + 1)
161 230 CONTINUE
162 LXN(1, NNN + 1) = 0
163 LXN(2, NNN + 1) = 0
164 LXN(3, NNN + 1) = 0
165 LXN(4, NNN + 1) = 0
166 NUID(NNN + 1) = 0
167 DO 240 J = LLLOLD + 1, LLL
168 IF (NXL(1, J) .GE. I)NXL(1, J) = NXL(1, J) - 1
169 IF (NXL(2, J) .GE. I)NXL(2, J) = NXL(2, J) - 1
170 240 CONTINUE
171 ELSE
172 I = I + 1
173 END IF
174 ELSE
175 I = I + 1
176 END IF
177 IF (I .LE. NNN) GO TO 110
178
179 C IF THIS IS THE FINAL SUBREGION TO BE ADDED, THEN FLAG
180 C THE LXN ARRAY FOR TRULY EXTERIOR NODES, AND CLEAR THE TEMPORARY
181 C NUID'S OF THE SUBREGION ONLY BOUNDARY NODES
182
183 IF (FINAL) THEN
184 DO 250 I = 1, NNN
185 IF ((ABS(NUID(I)) .GT. 1000000000) .OR.
186 & ((ABS(NUID(I)) .LT. 100000) .AND.
187 & (NUID(I) .NE. 0))) THEN
188 LXN(2, I) = -ABS(LXN(2, I))
189 ELSE
190 NUID(I) = 0
191 LXN(2, I) = ABS(LXN(2, I))
192 END IF
193 250 CONTINUE
194
195 C LINK-UP AVAILABLE LXN SPACE
196
197 IAVAIL = NNN + 1
198 NAVAIL = MXND - NNN
199 DO 260 I = IAVAIL, MXND
200 LXN(1, I) = 0
201 LXN(2, I) = 0
202 LXN(3, I) = 0
203 LXN(4, I) = I + 1
204 260 CONTINUE
205 END IF
206 RETURN
207
208 END