Debian Codegraph @

packages/seacas/applications/fastq/savreg.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 SAVREG (MXND, MAXNBC, MAXSBC, XN, YN, NUID, LXK, NXL,
8 & LXN, LSTNBC, LSTSBC, KNBC, KSBC, NNN, KKK, NUMREG, IUNIT, BAR,
9 & M1)
10 C***********************************************************************
11
12 C SUBROUTINE SAVREG = SAVES THE NODE AND ELEMENT DESCRIPTIONS AS WELL
13 C AS THE BOUNDARY CONDITIONS
14
15 C***********************************************************************
16
17 C NOTE:
18 C THE MESH TABLES ARE EFFECTIVELY DESTROYED BY THIS ROUTINE
19
20 C***********************************************************************
21
22 DIMENSION XN (MXND), YN (MXND), NUID (MXND)
23 DIMENSION LXK (4, MXND), NXL (2, MXND*3), LXN (4, MXND)
24 DIMENSION LSTNBC (MAXNBC), LSTSBC (MAXSBC), NODES (4)
25
26 LOGICAL CCW, BAR
27
28 CCW = .TRUE.
29 IF (.NOT.BAR) THEN
30
31 C DEFINE NUID-S FOR INTERIOR NODES.
32 C SKIP DELETED NODES AND CONTINUATIONS.
33
34 K = 0
35 DO 100 I = 1, NNN
36 IF ((NUID (I) .EQ. 0) .AND. (LXN (1, I) .GT. 0)) THEN
37 K = K+1
38 NUID (I) = NUMREG*100000+K
39 ENDIF
40 100 CONTINUE
41
42 C GET COUNTER-CLOCKWISE NODE LISTS.
43 C (THESE LISTS WILL OVERWRITE THE LXK ARRAY.)
44 C DELETED ELEMENTS WILL BE SKIPPED.
45
46 J = 0
47 IDEL = 0
48 DO 130 K = 1, KKK
49 IF (LXK (1, K) .LE. 0) THEN
50 DO 110 JJ = 2, KSBC, 3
51 IF (LSTSBC (JJ) .GE. (K - IDEL)) THEN
52 LSTSBC (JJ) = LSTSBC (JJ) - 1
53 ENDIF
54 110 CONTINUE
55 IDEL = IDEL + 1
56 ELSE
57 CALL GNXKA (MXND, XN, YN, K, NODES, AREA, LXK, NXL, CCW)
58 J = J+1
59 DO 120 I = 1, 4
60 N = NODES (I)
61 LXK (I, J) = IABS (NUID (N))
62 120 CONTINUE
63 ENDIF
64 130 CONTINUE
65 KKK = J
66 ELSE
67 DO 140 I = 1, KKK
68 LXK (1, I) = IABS (NUID (LXK (1, I)))
69 LXK (2, I) = IABS (NUID (LXK (2, I)))
70 140 CONTINUE
71 ENDIF
72
73 C COLLAPSE THE NODE ARRAYS TO ELIMINATE DELETED NODES,
74 C CONTINUATIONS, AND NODES ALREADY WRITTEN OUT.
75
76 K = 0
77 DO 150 I = 1, NNN
78 IF ( ( (LXN (1, I) .GT. 0) .OR. (BAR))
79 & .AND. (NUID (I) .GT. 0) ) THEN
80 K = K+1
81 XN (K) = XN (I)
82 YN (K) = YN (I)
83 NUID (K) = NUID (I)
84 ENDIF
85 150 CONTINUE
86 NNN = K
87
88 C WRITE HEADER, NODE LIST, ELEMENT LIST, AND BOUNDARY LISTS
89
90 WRITE (IUNIT)KKK, NNN, KNBC, KSBC, NUMREG, BAR, M1
91 IF (NNN .GE. 1) WRITE (IUNIT) (NUID (I), XN (I), YN (I),
92 & I = 1, NNN)
93 WRITE (IUNIT) ((LXK (I, J), I = 1, 4), J = 1, KKK)
94 IF (KNBC .GT. 0)WRITE (IUNIT) (LSTNBC (I), I = 1, KNBC)
95 IF (KSBC .GT. 0)WRITE (IUNIT) (LSTSBC (I), I = 1, KSBC)
96
97 RETURN
98
99 END