Debian Codegraph @

packages/seacas/applications/fastq/llist.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 LLIST (MS, ML, MAXNL, NS, NL, KNUM, LISTL, ILINE,
8 & ISIDE, NLPS, IFLINE, ILLIST, LCON, ISLIST, LINKS, LINKL, ERR)
9 C***********************************************************************
10
11 C SUBROUTINE LLIST = PRODUCE LIST OF LINES FOR REGION
12
13 C***********************************************************************
14
15 C SUBROUTINE CALLED BY:
16 C PERIM = GENERATES PERIMETER OF THE REGION
17
18 C***********************************************************************
19
20 C PRODUCE THE LIST OF (PHYSICAL INDICES OF) LINES FOR (PHYSICAL)
21 C REGION KREG. THIS LIST IS (LISTL (I), I=1, NL).
22 C *BACKWARDS* SIDES WILL BE REVERSED.
23 C IT IS ASSUMED LINES ARE PROPERLY LISTED IN ORDER ON SIDE CARDS.
24 C IF THEY ARE NOT, PERIM WILL DIAGNOSE IT.
25 C ERR = .TRUE. IF ERRORS WERE ENCOUNTERED.
26
27 C***********************************************************************
28
29 DIMENSION ILINE (ML), LCON (3, ML)
30 DIMENSION ISIDE (MS), NLPS (MS), IFLINE (MS), ILLIST (MS * 3)
31 DIMENSION ISLIST (NS), LISTL (MAXNL)
32 DIMENSION LINKL (2, ML), LINKS (2, MS)
33
34 LOGICAL ERR, ADDLNK
35
36 ERR = .TRUE.
37 ADDLNK = .FALSE.
38 IS = ISLIST (1)
39
40 C FIRST SIDE
41
42 IF (IS .EQ. 0) THEN
43 RETURN
44 ELSEIF (IS .LT. 0) THEN
45 IFL1 = IABS (IS)
46 ILL1 = IABS (IS)
47 NEW = 1
48 LISTL (NEW) = IFL1
49 ELSE
50 CALL LTSORT (MS, LINKS, IS, IPNTR, ADDLNK)
51 I1 = IFLINE (IPNTR)
52 I2 = I1 + NLPS (IPNTR) - 1
53 IFL1 = ILLIST (I1)
54 ILL1 = ILLIST (I2)
55 NEW = 0
56 DO 100 I = I1, I2
57 NEW = NEW + 1
58 LISTL (NEW) = ILLIST (I)
59 100 CONTINUE
60 ENDIF
61 IF (NS .LE. 1) THEN
62 NL = NEW
63 ERR = .FALSE.
64 RETURN
65 ENDIF
66
67 C SECOND SIDE
68
69 IS2 = ISLIST (2)
70 IF (IS2 .EQ. 0) THEN
71 RETURN
72 ELSEIF (IS2 .LT. 0) THEN
73 IFL2 = IABS (IS2)
74 ILL2 = IABS (IS2)
75 ELSE
76 CALL LTSORT (MS, LINKS, IS2, IPNTR, ADDLNK)
77 I1 = IFLINE (IPNTR)
78 I2 = I1 + NLPS (IPNTR) - 1
79 IFL2 = ILLIST (I1)
80 ILL2 = ILLIST (I2)
81 ENDIF
82
83 C DECIDE WHICH END OF SIDE ONE IS THE STARTING POINT
84
85 CALL LTSORT (ML, LINKL, IFL2, IPNTR, ADDLNK)
86 K1 = LCON (1, IPNTR)
87 K2 = LCON (2, IPNTR)
88 CALL LTSORT (ML, LINKL, ILL2, IPNTR, ADDLNK)
89 K3 = LCON (1, IPNTR)
90 K4 = LCON (2, IPNTR)
91 CALL LTSORT (ML, LINKL, IFL1, IPNTR, ADDLNK)
92 J1 = LCON (1, IPNTR)
93 J2 = LCON (2, IPNTR)
94 CALL LTSORT (ML, LINKL, ILL1, IPNTR, ADDLNK)
95 J3 = LCON (1, IPNTR)
96 J4 = LCON (2, IPNTR)
97
98 C FIRST SIDE IN PROPER ORDER
99
100 IF ( (J3 .EQ. K1) .OR. (J3 .EQ. K2) .OR. (J3 .EQ. K3)
101 & .OR. (J3 .EQ. K4) .OR. (J4 .EQ. K1) .OR. (J4 .EQ. K2)
102 & .OR. (J4 .EQ. K3) .OR. (J4 .EQ. K4)) THEN
103 CONTINUE
104
105 C FIRST SIDE NEEDS REVERSED
106
107 ELSEIF ( (J1 .EQ. K1) .OR. (J1 .EQ. K2) .OR. (J1 .EQ. K3)
108 & .OR. (J1 .EQ. K4) .OR. (J2 .EQ. K1) .OR. (J2 .EQ. K2)
109 & .OR. (J2 .EQ. K3) .OR. (J2 .EQ. K4)) THEN
110 CALL IREVER (LISTL, NEW)
111
112 C CONNECTIVITY DOES NOT EXIST
113
114 ELSE
115 IF (IS2 .GT. 0) THEN
116 CALL LTSORT (MS, LINKS, IS2, IPNTR, ADDLNK)
117 WRITE ( * , 10000)KNUM, ISIDE (IPNTR)
118 ELSE
119 CALL LTSORT (ML, LINKL, IABS (IS2), IPNTR, ADDLNK)
120 WRITE ( * , 10010)KNUM, ILINE (IPNTR)
121 ENDIF
122 RETURN
123 ENDIF
124
125 NL = NEW
126 DO 120 KS = 2, NS
127 I = LISTL (NL)
128 CALL LTSORT (ML, LINKL, I, IPNTR, ADDLNK)
129 J1 = LCON (1, IPNTR)
130 J2 = LCON (2, IPNTR)
131 IS = ISLIST (KS)
132
133 C ADD NEW LINES TO LIST
134
135 IF (IS .EQ. 0) THEN
136 RETURN
137 ELSEIF (IS .LT. 0) THEN
138 IFL = IABS (IS)
139 ILL = IABS (IS)
140 NEW = NL + 1
141 LISTL (NEW) = IABS (IS)
142 ELSE
143 CALL LTSORT (MS, LINKS, IS, IPNTR, ADDLNK)
144 I1 = IFLINE (IPNTR)
145 I2 = I1 + NLPS (IPNTR) - 1
146 IFL = ILLIST (I1)
147 ILL = ILLIST (I2)
148 NEW = NL
149 DO 110 I = I1, I2
150 NEW = NEW + 1
151 LISTL (NEW) = ILLIST (I)
152 110 CONTINUE
153 ENDIF
154
155 C DETERMINE WHETHER THIS SIDE IS BACKWARDS
156
157 CALL LTSORT (ML, LINKL, IFL, IPNTR, ADDLNK)
158 K1 = LCON (1, IPNTR)
159 K2 = LCON (2, IPNTR)
160 CALL LTSORT (ML, LINKL, ILL, IPNTR, ADDLNK)
161 K3 = LCON (1, IPNTR)
162 K4 = LCON (2, IPNTR)
163
164 C THIS SIDE IS IN PROPER ORDER
165
166 IF ( (J1 .EQ. K1) .OR. (J1 .EQ. K2) .OR. (J2 .EQ. K1)
167 & .OR. (J2 .EQ. K2)) THEN
168 CONTINUE
169
170 C THIS SIDE NEEDS REVERSING
171
172 ELSEIF ( (J1 .EQ. K3) .OR. (J1 .EQ. K4) .OR. (J2 .EQ. K3)
173 & .OR. (J2 .EQ. K4)) THEN
174 CALL LTSORT (MS, LINKS, IS, IPNTR, ADDLNK)
175 CALL IREVER (LISTL (NL + 1), NLPS (IPNTR))
176
177 C CONNECTIVITY DOES NOT EXIST
178
179 ELSE
180 IF (IS .GT. 0) THEN
181 CALL LTSORT (MS, LINKS, IS, IPNTR, ADDLNK)
182 WRITE ( * , 10000)KNUM, ISIDE (IPNTR)
183 ELSE
184 CALL LTSORT (ML, LINKL, IABS (IS), IPNTR, ADDLNK)
185 WRITE ( * , 10010)KNUM, ILINE (IPNTR)
186 ENDIF
187 RETURN
188 ENDIF
189
190 NL = NEW
191
192 120 CONTINUE
193
194 C SUCCESSFUL LINE LIST GENERATION
195
196 ERR = .FALSE.
197
198 RETURN
199
200 10000 FORMAT (' IN REGION', I5, ', SIDE', I5, ' DOES NOT CONNECT TO',
201 & /, ' THE PREVIOUS SECTION OF THE PERIMETER')
202 10010 FORMAT (' IN REGION', I5, ', LINE', I5, ' DOES NOT CONNECT TO',
203 & /, ' THE PREVIOUS SECTION OF THE PERIMETER')
204
205 END