/[escript]/trunk/finley/src/Mesh_write.c
ViewVC logotype

Contents of /trunk/finley/src/Mesh_write.c

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1343 - (show annotations)
Wed Nov 14 02:48:02 2007 UTC (11 years, 11 months ago) by ksteube
File MIME type: text/plain
File size: 8951 byte(s)
First cut implementation of mesh.dump() using NetCDF.  TagMap not
saved yet.  The code for Points probably works but has not been tested.

1
2 /* $Id$ */
3
4 /*******************************************************
5 *
6 * Copyright 2003-2007 by ACceSS MNRF
7 * Copyright 2007 by University of Queensland
8 *
9 * http://esscc.uq.edu.au
10 * Primary Business: Queensland, Australia
11 * Licensed under the Open Software License version 3.0
12 * http://www.opensource.org/licenses/osl-3.0.php
13 *
14 *******************************************************/
15
16 /**************************************************************/
17
18 /* Finley: write Mesh */
19
20 /**************************************************************/
21
22 #include "Mesh.h"
23
24 /**************************************************************/
25
26 /* writes the mesh to the external file fname unsing the Finley file format: */
27
28 void Finley_Mesh_write(Finley_Mesh *in,char* fname) {
29 char error_msg[LenErrorMsg_MAX];
30 FILE *f;
31 int NN,i,j,numDim;
32 Finley_TagMap* tag_map=in->TagMap;
33
34 if (in->MPIInfo->size >1 ) {
35 Finley_setError(IO_ERROR,"Mesh_write: only single processor runs are supported.");
36 return;
37
38 }
39 /* open file */
40 f=fopen(fname,"w");
41 if (f==NULL) {
42 sprintf(error_msg,"Mesh_write: Opening file %s for writing failed.",fname);
43 Finley_setError(IO_ERROR,error_msg);
44 return;
45 }
46
47 /* write header */
48
49 fprintf(f,"%s\n",in->Name);
50
51 /* write nodes: */
52
53 if (in->Nodes!=NULL) {
54 numDim=Finley_Mesh_getDim(in);
55 fprintf(f,"%1dD-Nodes %d\n", numDim, in->Nodes->numNodes);
56 for (i=0;i<in->Nodes->numNodes;i++) {
57 fprintf(f,"%d %d %d",in->Nodes->Id[i],in->Nodes->globalDegreesOfFreedom[i],in->Nodes->Tag[i]);
58 for (j=0;j<numDim;j++) fprintf(f," %20.15e",in->Nodes->Coordinates[INDEX2(j,i,numDim)]);
59 fprintf(f,"\n");
60 }
61 } else {
62 fprintf(f,"0D-Nodes 0\n");
63 }
64
65 /* write elements: */
66
67 if (in->Elements!=NULL) {
68 fprintf(f, "%s %d\n",in->Elements->ReferenceElement->Type->Name,in->Elements->numElements);
69 NN=in->Elements->numNodes;
70 for (i=0;i<in->Elements->numElements;i++) {
71 fprintf(f,"%d %d",in->Elements->Id[i],in->Elements->Tag[i]);
72 for (j=0;j<NN;j++) fprintf(f," %d",in->Nodes->Id[in->Elements->Nodes[INDEX2(j,i,NN)]]);
73 fprintf(f,"\n");
74 }
75 } else {
76 fprintf(f,"Tet4 0\n");
77 }
78
79 /* write face elements: */
80 if (in->FaceElements!=NULL) {
81 fprintf(f, "%s %d\n", in->FaceElements->ReferenceElement->Type->Name,in->FaceElements->numElements);
82 NN=in->FaceElements->numNodes;
83 for (i=0;i<in->FaceElements->numElements;i++) {
84 fprintf(f,"%d %d",in->FaceElements->Id[i],in->FaceElements->Tag[i]);
85 for (j=0;j<NN;j++) fprintf(f," %d",in->Nodes->Id[in->FaceElements->Nodes[INDEX2(j,i,NN)]]);
86 fprintf(f,"\n");
87 }
88 } else {
89 fprintf(f,"Tri3 0\n");
90 }
91
92 /* write Contact elements : */
93 if (in->ContactElements!=NULL) {
94 fprintf(f, "%s %d\n",in->ContactElements->ReferenceElement->Type->Name,in->ContactElements->numElements);
95 NN=in->ContactElements->numNodes;
96 for (i=0;i<in->ContactElements->numElements;i++) {
97 fprintf(f,"%d %d",in->ContactElements->Id[i],in->ContactElements->Tag[i]);
98 for (j=0;j<NN;j++) fprintf(f," %d",in->Nodes->Id[in->ContactElements->Nodes[INDEX2(j,i,NN)]]);
99 fprintf(f,"\n");
100 }
101 } else {
102 fprintf(f,"Tri3_Contact 0\n");
103 }
104
105 /* write points: */
106 if (in->Points!=NULL) {
107 fprintf(f, "%s %d\n",in->Points->ReferenceElement->Type->Name,in->Points->numElements);
108 for (i=0;i<in->Points->numElements;i++) {
109 fprintf(f,"%d %d %d\n",in->Points->Id[i],in->Points->Tag[i],in->Nodes->Id[in->Points->Nodes[INDEX2(0,i,1)]]);
110 }
111 } else {
112 fprintf(f,"Point1 0\n");
113 }
114
115 /* write tags:*/
116 if (tag_map) {
117 fprintf(f,"Tags\n");
118 while (tag_map) {
119 fprintf(f,"%s %d\n",tag_map->name,tag_map->tag_key);
120 tag_map=tag_map->next;
121 }
122 }
123 fclose(f);
124 #ifdef Finley_TRACE
125 printf("mesh %s has been written to file %s\n",in->Name,fname);
126 #endif
127 }
128
129 void Finley_PrintMesh_Info(Finley_Mesh *in, bool_t full) {
130 #ifdef PASO_MPI
131 int NN,i,j,numDim;
132 Finley_TagMap* tag_map=in->TagMap;
133
134 fprintf(stdout, "Finley_PrintMesh_Info running on CPU %d of %d\n",in->MPIInfo->rank, in->MPIInfo->size);
135 fprintf(stdout, "\tMesh name '%s'\n",in->Name);
136 fprintf(stdout, "\tOrder %d\n",in->order);
137 fprintf(stdout, "\tReduced order %d\n",in->reduced_order);
138
139 /* write nodes: */
140 if (in->Nodes!=NULL) {
141 numDim=Finley_Mesh_getDim(in);
142 fprintf(stdout, "\tNodes->degreesOfFreedomDistribution:");
143 for (j=0;j<in->MPIInfo->size+1;j++) fprintf(stdout," %d",in->Nodes->degreesOfFreedomDistribution->first_component[j]);
144 fprintf(stdout, "\n");
145 fprintf(stdout, "\tNodes: %1dD-Nodes %d\n", numDim, in->Nodes->numNodes);
146 if (full) {
147 fprintf(stdout, "\t Id Tag gDOF gNI grDfI grNI: Coordinates\n");
148 for (i=0;i<in->Nodes->numNodes;i++) {
149 fprintf(stdout, "\t %5d %5d %5d %5d %5d %5d: ", in->Nodes->Id[i], in->Nodes->Tag[i], in->Nodes->globalDegreesOfFreedom[i], in->Nodes->globalNodesIndex[i], in->Nodes->globalReducedDOFIndex[i], in->Nodes->globalReducedNodesIndex[i]);
150 for (j=0;j<numDim;j++) fprintf(stdout," %20.15e",in->Nodes->Coordinates[INDEX2(j,i,numDim)]);
151 fprintf(stdout,"\n");
152 }
153 }
154 } else {
155 fprintf(stdout, "\tNodes: 0D-Nodes 0\n");
156 }
157
158 /* write elements: */
159 if (in->Elements!=NULL) {
160 fprintf(stdout, "\tElements: %s %d (TypeId=%d)\n",in->Elements->ReferenceElement->Type->Name,in->Elements->numElements,in->Elements->ReferenceElement->Type->TypeId);
161 NN=in->Elements->numNodes;
162 if (full) {
163 fprintf(stdout, "\t Id Tag Owner Color: Nodes\n");
164 for (i=0;i<in->Elements->numElements;i++) {
165 fprintf(stdout, "\t %5d %5d %5d %5d: ",in->Elements->Id[i],in->Elements->Tag[i],in->Elements->Owner[i],in->Elements->Color[i]);
166 for (j=0;j<NN;j++) fprintf(stdout," %5d",in->Nodes->Id[in->Elements->Nodes[INDEX2(j,i,NN)]]);
167 fprintf(stdout,"\n");
168 }
169 }
170 } else {
171 fprintf(stdout, "\tElements: Tet4 0\n");
172 }
173
174 /* write face elements: */
175 if (in->FaceElements!=NULL) {
176 fprintf(stdout, "\tFace elements: %s %d (TypeId=%d)\n", in->FaceElements->ReferenceElement->Type->Name,in->FaceElements->numElements,in->FaceElements->ReferenceElement->Type->TypeId);
177 NN=in->FaceElements->numNodes;
178 if (full) {
179 fprintf(stdout, "\t Id Tag Owner Color: Nodes\n");
180 for (i=0;i<in->FaceElements->numElements;i++) {
181 fprintf(stdout, "\t %5d %5d %5d %5d: ",in->FaceElements->Id[i],in->FaceElements->Tag[i],in->FaceElements->Owner[i],in->FaceElements->Color[i]);
182 for (j=0;j<NN;j++) fprintf(stdout," %5d",in->Nodes->Id[in->FaceElements->Nodes[INDEX2(j,i,NN)]]);
183 fprintf(stdout,"\n");
184 }
185 }
186 } else {
187 fprintf(stdout, "\tFace elements: Tri3 0\n");
188 }
189
190 /* write Contact elements : */
191 if (in->ContactElements!=NULL) {
192 fprintf(stdout, "\tContact elements: %s %d (TypeId=%d)\n",in->ContactElements->ReferenceElement->Type->Name,in->ContactElements->numElements,in->ContactElements->ReferenceElement->Type->TypeId);
193 NN=in->ContactElements->numNodes;
194 if (full) {
195 fprintf(stdout, "\t Id Tag Owner Color: Nodes\n");
196 for (i=0;i<in->ContactElements->numElements;i++) {
197 fprintf(stdout, "\t %5d %5d %5d %5d: ",in->ContactElements->Id[i],in->ContactElements->Tag[i],in->ContactElements->Owner[i],in->ContactElements->Color[i]);
198 for (j=0;j<NN;j++) fprintf(stdout," %5d",in->Nodes->Id[in->ContactElements->Nodes[INDEX2(j,i,NN)]]);
199 fprintf(stdout,"\n");
200 }
201 }
202 } else {
203 fprintf(stdout, "\tFace elements: Tri3_Contact 0\n");
204 }
205
206 /* write points: */
207 if (in->Points!=NULL) {
208 fprintf(stdout, "\tPoints: %s %d (TypeId=%d)\n",in->Points->ReferenceElement->Type->Name,in->Points->numElements,in->Points->ReferenceElement->Type->TypeId);
209 if (full) {
210 fprintf(stdout, "\t Id Tag Owner Color: Nodes\n");
211 for (i=0;i<in->Points->numElements;i++) {
212 fprintf(stdout, "\t %5d %5d %5d %5d %5d\n",in->Points->Id[i],in->Points->Tag[i],in->Points->Owner[i],in->Points->Color[i],in->Nodes->Id[in->Points->Nodes[INDEX2(0,i,1)]]);
213 }
214 }
215 } else {
216 fprintf(stdout, "\tPoints: Point1 0\n");
217 }
218
219 /* write tags:*/
220 if (tag_map) {
221 fprintf(stdout, "\tTags:\n");
222 while (tag_map) {
223 fprintf(stdout, "\t %5d %s\n", tag_map->tag_key, tag_map->name);
224 tag_map=tag_map->next;
225 }
226 }
227 #else
228 fprintf(stdout, "Finley_PrintMesh_Info: MPI is not enabled\n");
229 #endif
230 }
231
232 /*
233 * $Log$
234 * Revision 1.2 2005/09/15 03:44:23 jgs
235 * Merge of development branch dev-02 back to main trunk on 2005-09-15
236 *
237 * Revision 1.1.1.1.6.1 2005/09/07 06:26:20 gross
238 * the solver from finley are put into the standalone package paso now
239 *
240 * Revision 1.1.1.1 2004/10/26 06:53:57 jgs
241 * initial import of project esys2
242 *
243 * Revision 1.1.1.1 2004/06/24 04:00:40 johng
244 * Initial version of eys using boost-python.
245 *
246 *
247 */
248

Properties

Name Value
svn:eol-style native
svn:keywords Author Date Id Revision

  ViewVC Help
Powered by ViewVC 1.1.26