| 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 |
C======================================================================= |
| 8 |
SUBROUTINE WREX2 (MS, MR, NPNODE, NPELEM, MXNFLG, MXSFLG, NPREGN, |
| 9 |
& NPNBC, NPSBC, IUNIT, NNN, KKK, NNXK, NODES, NELEMS, NNFLG, |
| 10 |
& NNPTR, NNLEN, NSFLG, NSPTR, NSLEN, NVPTR, NVLEN, NSIDEN, |
| 11 |
& MAPDXG, XN, YN, NXK, MAT, MAPGXD, MATMAP, WTNODE, WTSIDE, |
| 12 |
& NBCNOD, NNLIST, NBCSID, NSLIST, NVLIST, NUMMAT, LINKM, TITLE, |
| 13 |
& ERR, EIGHT, NINE, VERSN, A, IA, FILENAME) |
| 14 |
C======================================================================= |
| 15 |
C************************************************************************ |
| 16 |
|
| 17 |
C SUBROUTINE WREX2 = WRITES GENESIS DATABASE MESH OUTPUT |
| 18 |
|
| 19 |
C*********************************************************************** |
| 20 |
|
| 21 |
include 'exodusII.inc' |
| 22 |
|
| 23 |
DIMENSION XN (NPNODE), YN (NPNODE), NXK (NNXK, NPELEM) |
| 24 |
DIMENSION MAT (NPELEM) |
| 25 |
DIMENSION NODES (NPNBC), NELEMS (NPSBC), NSIDEN (NPSBC) |
| 26 |
DIMENSION NNFLG (MXNFLG), NNLEN (MXNFLG) |
| 27 |
DIMENSION NNPTR (MXNFLG), WTNODE (NPNBC) |
| 28 |
DIMENSION NSFLG (MXSFLG), NSLEN (MXSFLG) |
| 29 |
DIMENSION NSPTR (MXSFLG), WTSIDE (NPSBC) |
| 30 |
DIMENSION NVLEN (MXSFLG), NVPTR (MXSFLG), LINKM (2, (MS+MR)) |
| 31 |
DIMENSION MAPDXG (NPNODE), MAPGXD (NPNODE), MATMAP (3, NPREGN) |
| 32 |
|
| 33 |
CHARACTER*(*) FILENAME |
| 34 |
CHARACTER*1 cdum |
| 35 |
CHARACTER*72 TITLE, HOLD*(MXLNLN) |
| 36 |
CHARACTER*(MXSTLN) QAREC(4), CNAME(2) |
| 37 |
CHARACTER*(MXSTLN) ENAME |
| 38 |
CHARACTER*10 VERSN |
| 39 |
|
| 40 |
REAL A(*) |
| 41 |
INTEGER IA(*) |
| 42 |
|
| 43 |
LOGICAL ERR, EIGHT, NINE |
| 44 |
|
| 45 |
integer lcon(9) |
| 46 |
integer lbar(3) |
| 47 |
integer lquad(4) |
| 48 |
|
| 49 |
data lcon /1,3,5,7,2,4,6,8,9/ |
| 50 |
data lbar /1,3,2/ |
| 51 |
data lquad /1,2,3,4/ |
| 52 |
|
| 53 |
QAREC(1) = ' ' |
| 54 |
QAREC(2) = ' ' |
| 55 |
QAREC(3) = ' ' |
| 56 |
QAREC(4) = ' ' |
| 57 |
CALL EXDATE (QAREC(3)) |
| 58 |
CALL EXTIME (QAREC(4)) |
| 59 |
QAREC(1) = VERSN (1:5) |
| 60 |
QAREC(2) = VERSN (6:10) |
| 61 |
call expqa (iunit, 1, QAREC, ierr) |
| 62 |
|
| 63 |
ERR = .TRUE. |
| 64 |
HOLD = TITLE |
| 65 |
CNAME(1) = 'X' |
| 66 |
CNAME(2) = 'Y' |
| 67 |
|
| 68 |
C WRITE OUT HEADER INFORMATION |
| 69 |
|
| 70 |
IJK = 2 |
| 71 |
call expini (iunit, hold, ijk, nnn, kkk, nummat, nbcnod, |
| 72 |
& nbcsid, ierr) |
| 73 |
|
| 74 |
C ... WRITE OUT NODE BLOCK |
| 75 |
call expcor (iunit, xn, yn, rdum, ierr) |
| 76 |
call expcon (iunit, cname, ierr) |
| 77 |
|
| 78 |
C ... Write out the element map |
| 79 |
call expmap (iunit, mapdxg, ierr) |
| 80 |
|
| 81 |
C ... Write out element blocks |
| 82 |
C ... The fastq connectivity storage is not consistent with the |
| 83 |
C exodusII connectivity storage order. Determine the maximum |
| 84 |
C storage required to store the connectivity for an element |
| 85 |
C block and allocate that space. We duplicate some code here, |
| 86 |
C but we don't have any extra arrays to store the information |
| 87 |
MAXLNK = 0 |
| 88 |
MAXATT = 0 |
| 89 |
DO 90 I = 1, NUMMAT |
| 90 |
NUMEL = MATMAP (3, I) - MATMAP (2, I)+1 |
| 91 |
IF (NXK (3, MATMAP (2, I)) .EQ. 0) THEN |
| 92 |
C ...2-NODE BEAM |
| 93 |
INODE = 2 |
| 94 |
NATTR = 1 |
| 95 |
ELSEIF (NXK (4, MATMAP (2, I)) .EQ. 0) THEN |
| 96 |
C ...3-NODE BEAM |
| 97 |
INODE = 3 |
| 98 |
NATTR = 1 |
| 99 |
ELSEIF (EIGHT) THEN |
| 100 |
C ...8-NODE QUAD |
| 101 |
INODE = 8 |
| 102 |
NATTR = 0 |
| 103 |
ELSEIF (NINE) THEN |
| 104 |
C ...9-NODE QUAD |
| 105 |
INODE = 9 |
| 106 |
NATTR = 0 |
| 107 |
ELSE |
| 108 |
C ...4-NODE QUAD |
| 109 |
INODE = 4 |
| 110 |
NATTR = 0 |
| 111 |
ENDIF |
| 112 |
maxlnk = max(maxlnk, numel * inode) |
| 113 |
maxatt = max(maxatt, numel * nattr) |
| 114 |
90 CONTINUE |
| 115 |
|
| 116 |
C ... Have the maximum size of the link and attribute arrays, |
| 117 |
C Now allocate the space. |
| 118 |
CALL MDRSRV('LINK', KLINK, maxlnk) |
| 119 |
CALL MDRSRV('ATTR', KATRIB, maxatt) |
| 120 |
call mdstat(nerr, mused) |
| 121 |
if (nerr .gt. 0) go to 110 |
| 122 |
|
| 123 |
DO 100 I = 1, NUMMAT |
| 124 |
IF (NXK (3, MATMAP (2, I)) .EQ. 0) THEN |
| 125 |
INODE = 2 |
| 126 |
NATTR = 1 |
| 127 |
ATTR = 1. |
| 128 |
ENAME = 'BEAM' |
| 129 |
ELSEIF (NXK (4, MATMAP (2, I)) .EQ. 0) THEN |
| 130 |
INODE = 3 |
| 131 |
NATTR = 1 |
| 132 |
ATTR = 1. |
| 133 |
ENAME = 'BEAM3' |
| 134 |
ELSEIF (EIGHT) THEN |
| 135 |
INODE = 8 |
| 136 |
NATTR = 0 |
| 137 |
ENAME = 'QUAD8' |
| 138 |
ELSEIF (NINE) THEN |
| 139 |
INODE = 9 |
| 140 |
NATTR = 0 |
| 141 |
ENAME = 'QUAD9' |
| 142 |
ELSE |
| 143 |
INODE = 4 |
| 144 |
NATTR = 0 |
| 145 |
ENAME = 'QUAD' |
| 146 |
ENDIF |
| 147 |
|
| 148 |
call expelb(iunit, matmap(1,i), ename, |
| 149 |
& MATMAP (3, I) - MATMAP (2, I)+1, INODE, NATTR, ierr) |
| 150 |
C... 8 or 9 node quads |
| 151 |
IF (INODE .EQ. 8 .or. inode .eq. 9) THEN |
| 152 |
call trnlnk(ia(klink), nxk, nnxk, lcon, nnxk, |
| 153 |
& matmap(2,i), matmap(3,i), .TRUE.) |
| 154 |
call expelc(iunit, matmap(1,i), ia(klink), ierr) |
| 155 |
C... 3 node beam/truss |
| 156 |
ELSEIF (INODE .EQ. 3) THEN |
| 157 |
call trnlnk(ia(klink), nxk, nnxk, lbar, inode, |
| 158 |
& matmap(2,i), matmap(3,i), .TRUE.) |
| 159 |
call expelc(iunit, matmap(1,i), ia(klink), ierr) |
| 160 |
C... 4 node quad or 2 node beam/truss |
| 161 |
ELSE |
| 162 |
call trnlnk(ia(klink), nxk, nnxk, lquad, inode, |
| 163 |
& matmap(2,i), matmap(3,i), .FALSE.) |
| 164 |
call expelc(iunit, matmap(1,i), ia(klink), ierr) |
| 165 |
ENDIF |
| 166 |
if (NATTR .gt. 0) then |
| 167 |
C ... Initialize attributes |
| 168 |
NUMEL = MATMAP (3, I) - MATMAP (2, I)+1 |
| 169 |
do 95 iat = 0, nattr*numel-1 |
| 170 |
a(katrib+iat) = attr |
| 171 |
95 continue |
| 172 |
call expeat(iunit, matmap(1,i), a(katrib), ierr) |
| 173 |
end if |
| 174 |
c NLOOP = MAX0 (1, NATTR*KKK) |
| 175 |
c WRITE (IUNIT, ERR = 110) (ATTR, J = 1, NLOOP) |
| 176 |
100 CONTINUE |
| 177 |
call mddel('LINK') |
| 178 |
call mddel('ATTR') |
| 179 |
call mdstat(nerr, mused) |
| 180 |
if (nerr .gt. 0) go to 110 |
| 181 |
|
| 182 |
C WRITE OUT NODAL BOUNDARY FLAGS |
| 183 |
do 200 i = 1, nbcnod |
| 184 |
call expnp (iunit, nnflg(i), nnlen(i), nnlen(i), ierr) |
| 185 |
call expns (iunit, nnflg(i), nodes(nnptr(i)), ierr) |
| 186 |
call expnsd(iunit, nnflg(i), wtnode(nnptr(i)), ierr) |
| 187 |
200 continue |
| 188 |
|
| 189 |
C WRITE OUT SIDE BOUNDARY FLAGS |
| 190 |
C ... Fix up side set nodes and elements for 8 and 9 node elements. |
| 191 |
C ... At this point, they are treated as two linear segments, |
| 192 |
C ... They should be ends followed by middle |
| 193 |
|
| 194 |
C 1-----3-----2 Now: 1 3 3 2 Correct: 1 2 3 |
| 195 |
|
| 196 |
if (eight .or. nine) then |
| 197 |
ipn = 1 |
| 198 |
ipe = 1 |
| 199 |
do 130 ibc = 1, nbcsid |
| 200 |
|
| 201 |
ibee = nsptr(ibc) |
| 202 |
iene = nsptr(ibc) + nslen(ibc) - 1 |
| 203 |
nsptr(ibc) = ipe |
| 204 |
nslen(ibc) = max(1, nslen(ibc)/2) |
| 205 |
do 115 iel = ibee, iene, 2 |
| 206 |
nelems(ipe) = nelems(iel) |
| 207 |
ipe = ipe + 1 |
| 208 |
115 continue |
| 209 |
|
| 210 |
ibeg = nvptr(ibc) |
| 211 |
iend = nvptr(ibc) + nvlen(ibc) - 1 |
| 212 |
nvptr(ibc) = ipn |
| 213 |
nvlen(ibc) = nvlen(ibc) / 4 * 3 |
| 214 |
|
| 215 |
do 120 inod = ibeg, iend, 4 |
| 216 |
nsiden(ipn) = nsiden(inod) |
| 217 |
nsiden(ipn+2) = nsiden(inod+1) |
| 218 |
nsiden(ipn+1) = nsiden(inod+3) |
| 219 |
wtside(ipn) = wtside(inod) |
| 220 |
wtside(ipn+2) = wtside(inod+1) |
| 221 |
wtside(ipn+1) = wtside(inod+3) |
| 222 |
ipn = ipn + 3 |
| 223 |
120 continue |
| 224 |
130 continue |
| 225 |
nvlist = ipn - 1 |
| 226 |
nslist = ipe - 1 |
| 227 |
end if |
| 228 |
|
| 229 |
C ... Convert sideset nodes to sideset sides |
| 230 |
if (nbcsid .gt. 0) then |
| 231 |
call mdrsrv('ISIDES', ksides, nslist) |
| 232 |
call EXCN2S(iunit, nslen, nvlen, nsptr, nvptr, |
| 233 |
& nelems, nsiden, ia(ksides), IERR) |
| 234 |
|
| 235 |
do 140 i=1, nbcsid |
| 236 |
call expsp (iunit, nsflg(i), nslen(i), nvlen(i), ierr) |
| 237 |
call expss (iunit, nsflg(i), nelems(nsptr(i)), |
| 238 |
& ia(ksides+nsptr(i)-1), ierr) |
| 239 |
call expssd(iunit, nsflg(i), wtside(nvptr(i)), ierr) |
| 240 |
140 continue |
| 241 |
call mddel('ISIDES') |
| 242 |
end if |
| 243 |
C SUCCESSFUL WRITE COMPLETED |
| 244 |
CALL MESSAGE(' ') |
| 245 |
CALL MESSAGE('ExodusII output file successfully written') |
| 246 |
C ... Title is char*72, dbpini and exodusII expect char*80 |
| 247 |
HOLD = TITLE |
| 248 |
if (nbcnod .gt. 0) then |
| 249 |
call exinq (iunit, EXNSNL, lnsnl, rdum, cdum, ierr) |
| 250 |
call exinq (iunit, EXNSDF, lnsdf, rdum, cdum, ierr) |
| 251 |
else |
| 252 |
lnsnl = 0 |
| 253 |
lnsdf = 0 |
| 254 |
end if |
| 255 |
if (nbcsid .gt. 0) then |
| 256 |
call exinq (iunit, EXSSEL, lssel, rdum, cdum, ierr) |
| 257 |
call exinq (iunit, EXSSDF, lssdf, rdum, cdum, ierr) |
| 258 |
call exinq (iunit, EXSSNL, lssnl, rdum, cdum, ierr) |
| 259 |
else |
| 260 |
lssel = 0 |
| 261 |
lssdf = 0 |
| 262 |
lssnl = 0 |
| 263 |
end if |
| 264 |
CALL FQDBPINI ('NTIS', HOLD, ijk, nnn, kkk, nummat, nbcnod, |
| 265 |
* nnlist, nnlist, nbcsid, lssel, lssnl, lssdf, 0, 0, 0, |
| 266 |
* filename) |
| 267 |
ERR = .FALSE. |
| 268 |
RETURN |
| 269 |
|
| 270 |
C ERROR DURING WRITE PROBLEMS |
| 271 |
110 CONTINUE |
| 272 |
CALL MESSAGE('ERR DURING WRITE TO OUTPUT FILE') |
| 273 |
CALL MESSAGE('...File may be incomplete...') |
| 274 |
RETURN |
| 275 |
|
| 276 |
END |
| 277 |
|
| 278 |
subroutine trnlnk(LINK, NXK, NNXK, INDEX, NNODE, IBEG, IEND,USING) |
| 279 |
integer link(nnode, *) |
| 280 |
integer nxk(nnxk, *) |
| 281 |
integer index(*) |
| 282 |
logical using |
| 283 |
|
| 284 |
ii = 0 |
| 285 |
do 20 i = ibeg, iend |
| 286 |
ii = ii + 1 |
| 287 |
do 10 j = 1, nnode |
| 288 |
if (using) then |
| 289 |
link(j,ii) = nxk(index(j), i) |
| 290 |
else |
| 291 |
link(j,ii) = nxk(j, i) |
| 292 |
end if |
| 293 |
10 continue |
| 294 |
20 continue |
| 295 |
return |
| 296 |
end |