finley/src/Mesh_write.c


/* $Id$ */

/*******************************************************
 *
 *           Copyright 2003-2007 by ACceSS MNRF
 *       Copyright 2007 by University of Queensland
 *
 *                http://esscc.uq.edu.au
 *        Primary Business: Queensland, Australia
 *  Licensed under the Open Software License version 3.0
 *     http://www.opensource.org/licenses/osl-3.0.php
 *
 *******************************************************/

/**************************************************************/

/*   Finley: write Mesh */

/**************************************************************/

#include "Mesh.h"

/**************************************************************/

/*  writes the mesh to the external file fname unsing the Finley file format: */

void Finley_Mesh_write(Finley_Mesh *in,char* fname) {
  char error_msg[LenErrorMsg_MAX];
  FILE *f;
  int NN,i,j,numDim;
  Finley_TagMap* tag_map=in->TagMap;

  if (in->MPIInfo->size >1 ) {
    Finley_setError(IO_ERROR,"Mesh_write: only single processor runs are supported.");
    return;

  }
  /* open file */
  f=fopen(fname,"w");
  if (f==NULL) {
    sprintf(error_msg,"Mesh_write: Opening file %s for writing failed.",fname);
    Finley_setError(IO_ERROR,error_msg);
    return;
  }

  /* write header */

  fprintf(f,"%s\n",in->Name);
  
  /*  write nodes: */
  
  if (in->Nodes!=NULL) {
    numDim=Finley_Mesh_getDim(in);
    fprintf(f,"%1dD-Nodes %d\n", numDim, in->Nodes->numNodes);
    for (i=0;i<in->Nodes->numNodes;i++) {
      fprintf(f,"%d %d %d",in->Nodes->Id[i],in->Nodes->globalDegreesOfFreedom[i],in->Nodes->Tag[i]);
      for (j=0;j<numDim;j++) fprintf(f," %20.15e",in->Nodes->Coordinates[INDEX2(j,i,numDim)]);
      fprintf(f,"\n");
    }
  } else {
    fprintf(f,"0D-Nodes 0\n");
  }
  
  /*  write elements: */

  if (in->Elements!=NULL) {
    fprintf(f, "%s %d\n",in->Elements->ReferenceElement->Type->Name,in->Elements->numElements);
    NN=in->Elements->numNodes;
    for (i=0;i<in->Elements->numElements;i++) {
      fprintf(f,"%d %d",in->Elements->Id[i],in->Elements->Tag[i]);
      for (j=0;j<NN;j++) fprintf(f," %d",in->Nodes->Id[in->Elements->Nodes[INDEX2(j,i,NN)]]);
      fprintf(f,"\n");
    }
  } else {
    fprintf(f,"Tet4 0\n");
  }

  /*  write face elements: */
  if (in->FaceElements!=NULL) {
    fprintf(f, "%s %d\n", in->FaceElements->ReferenceElement->Type->Name,in->FaceElements->numElements);
    NN=in->FaceElements->numNodes;
    for (i=0;i<in->FaceElements->numElements;i++) {
      fprintf(f,"%d %d",in->FaceElements->Id[i],in->FaceElements->Tag[i]);
      for (j=0;j<NN;j++) fprintf(f," %d",in->Nodes->Id[in->FaceElements->Nodes[INDEX2(j,i,NN)]]);
      fprintf(f,"\n");
    }
  } else {
    fprintf(f,"Tri3 0\n");
  }

  /*  write Contact elements : */
  if (in->ContactElements!=NULL) {
    fprintf(f, "%s %d\n",in->ContactElements->ReferenceElement->Type->Name,in->ContactElements->numElements);
    NN=in->ContactElements->numNodes;
    for (i=0;i<in->ContactElements->numElements;i++) {
      fprintf(f,"%d %d",in->ContactElements->Id[i],in->ContactElements->Tag[i]);
      for (j=0;j<NN;j++) fprintf(f," %d",in->Nodes->Id[in->ContactElements->Nodes[INDEX2(j,i,NN)]]);
      fprintf(f,"\n");
    }
  } else {
    fprintf(f,"Tri3_Contact 0\n");
  }
  
  /*  write points: */
  if (in->Points!=NULL) {
    fprintf(f, "%s %d\n",in->Points->ReferenceElement->Type->Name,in->Points->numElements);
    for (i=0;i<in->Points->numElements;i++) {
      fprintf(f,"%d %d %d\n",in->Points->Id[i],in->Points->Tag[i],in->Nodes->Id[in->Points->Nodes[INDEX2(0,i,1)]]);
    }
  } else {
    fprintf(f,"Point1 0\n");
  }

  /*  write tags:*/
  if (tag_map) {
     fprintf(f,"Tags\n");
     while (tag_map) {
        fprintf(f,"%s %d\n",tag_map->name,tag_map->tag_key);
        tag_map=tag_map->next;
     }
  }
  fclose(f);
  #ifdef Finley_TRACE
  printf("mesh %s has been written to file %s\n",in->Name,fname);
  #endif
}

void Finley_PrintMesh_Info(Finley_Mesh *in, bool_t full) {
  int NN,i,j,numDim;
  Finley_TagMap* tag_map=in->TagMap;

  fprintf(stdout, "Finley_PrintMesh_Info running on CPU %d of %d\n",in->MPIInfo->rank, in->MPIInfo->size);
  fprintf(stdout, "\tMesh name '%s'\n",in->Name);
  fprintf(stdout, "\tOrder %d\n",in->order);
  fprintf(stdout, "\tReduced order %d\n",in->reduced_order);

  /* write nodes: */
  if (in->Nodes!=NULL) {
    numDim=Finley_Mesh_getDim(in);
    if (in->Nodes->degreesOfFreedomDistribution != NULL) {
      fprintf(stdout, "\tNodes->degreesOfFreedomDistribution:");
      for (j=0;j<in->MPIInfo->size+1;j++) fprintf(stdout," %d",in->Nodes->degreesOfFreedomDistribution->first_component[j]);
      fprintf(stdout, "\n");
    }
    fprintf(stdout, "\tNodes: %1dD-Nodes %d\n", numDim, in->Nodes->numNodes);
    if (full) {
      fprintf(stdout, "\t     Id   Tag  gDOF   gNI grDfI  grNI:  Coordinates\n");
      for (i=0;i<in->Nodes->numNodes;i++) {
        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]);
        for (j=0;j<numDim;j++) fprintf(stdout," %20.15e",in->Nodes->Coordinates[INDEX2(j,i,numDim)]);
        fprintf(stdout,"\n");
      }
    }
  } else {
    fprintf(stdout, "\tNodes: 0D-Nodes 0\n");
  }

  /* write elements: */
  if (in->Elements!=NULL) {
    fprintf(stdout, "\tElements: %s %d (TypeId=%d)\n",in->Elements->ReferenceElement->Type->Name,in->Elements->numElements,in->Elements->ReferenceElement->Type->TypeId);
    NN=in->Elements->numNodes;
    if (full) {
      fprintf(stdout, "\t     Id   Tag Owner Color:  Nodes\n");
      for (i=0;i<in->Elements->numElements;i++) {
        fprintf(stdout, "\t  %5d %5d %5d %5d: ",in->Elements->Id[i],in->Elements->Tag[i],in->Elements->Owner[i],in->Elements->Color[i]);
        for (j=0;j<NN;j++) fprintf(stdout," %5d",in->Nodes->Id[in->Elements->Nodes[INDEX2(j,i,NN)]]);
        fprintf(stdout,"\n");
      }
    }
  } else {
    fprintf(stdout, "\tElements: Tet4 0\n");
  }

  /* write face elements: */
  if (in->FaceElements!=NULL) {
    fprintf(stdout, "\tFace elements: %s %d (TypeId=%d)\n", in->FaceElements->ReferenceElement->Type->Name,in->FaceElements->numElements,in->FaceElements->ReferenceElement->Type->TypeId);
    NN=in->FaceElements->numNodes;
    if (full) {
      fprintf(stdout, "\t     Id   Tag Owner Color:  Nodes\n");
      for (i=0;i<in->FaceElements->numElements;i++) {
        fprintf(stdout, "\t  %5d %5d %5d %5d: ",in->FaceElements->Id[i],in->FaceElements->Tag[i],in->FaceElements->Owner[i],in->FaceElements->Color[i]);
        for (j=0;j<NN;j++) fprintf(stdout," %5d",in->Nodes->Id[in->FaceElements->Nodes[INDEX2(j,i,NN)]]);
        fprintf(stdout,"\n");
      }
    }
  } else {
    fprintf(stdout, "\tFace elements: Tri3 0\n");
  }

  /* write Contact elements : */
  if (in->ContactElements!=NULL) {
    fprintf(stdout, "\tContact elements: %s %d (TypeId=%d)\n",in->ContactElements->ReferenceElement->Type->Name,in->ContactElements->numElements,in->ContactElements->ReferenceElement->Type->TypeId);
    NN=in->ContactElements->numNodes;
    if (full) {
      fprintf(stdout, "\t     Id   Tag Owner Color:  Nodes\n");
      for (i=0;i<in->ContactElements->numElements;i++) {
        fprintf(stdout, "\t  %5d %5d %5d %5d: ",in->ContactElements->Id[i],in->ContactElements->Tag[i],in->ContactElements->Owner[i],in->ContactElements->Color[i]);
        for (j=0;j<NN;j++) fprintf(stdout," %5d",in->Nodes->Id[in->ContactElements->Nodes[INDEX2(j,i,NN)]]);
        fprintf(stdout,"\n");
      }
    }
  } else {
    fprintf(stdout, "\tFace elements: Tri3_Contact 0\n");
  }

  /* write points: */
  if (in->Points!=NULL) {
    fprintf(stdout, "\tPoints: %s %d (TypeId=%d)\n",in->Points->ReferenceElement->Type->Name,in->Points->numElements,in->Points->ReferenceElement->Type->TypeId);
    if (full) {
      fprintf(stdout, "\t     Id   Tag Owner Color:  Nodes\n");
      for (i=0;i<in->Points->numElements;i++) {
        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)]]);
      }
    }
  } else {
    fprintf(stdout, "\tPoints: Point1 0\n");
  }

  /* write tags:*/
  if (tag_map) {
     fprintf(stdout, "\tTags:\n");
     while (tag_map) {
        fprintf(stdout, "\t  %5d %s\n", tag_map->tag_key, tag_map->name);
        tag_map=tag_map->next;
     }
  }
}

/*
* $Log$
* Revision 1.2  2005/09/15 03:44:23  jgs
* Merge of development branch dev-02 back to main trunk on 2005-09-15
*
* Revision 1.1.1.1.6.1  2005/09/07 06:26:20  gross
* the solver from finley are put into the standalone package paso now
*
* Revision 1.1.1.1  2004/10/26 06:53:57  jgs
* initial import of project esys2
*
* Revision 1.1.1.1  2004/06/24 04:00:40  johng
* Initial version of eys using boost-python.
*
*
*/

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	int NN,i,j,numDim;
131	Finley_TagMap* tag_map=in->TagMap;
132
133	fprintf(stdout, "Finley_PrintMesh_Info running on CPU %d of %d\n",in->MPIInfo->rank, in->MPIInfo->size);
134	fprintf(stdout, "\tMesh name '%s'\n",in->Name);
135	fprintf(stdout, "\tOrder %d\n",in->order);
136	fprintf(stdout, "\tReduced order %d\n",in->reduced_order);
137
138	/* write nodes: */
139	if (in->Nodes!=NULL) {
140	numDim=Finley_Mesh_getDim(in);
141	if (in->Nodes->degreesOfFreedomDistribution != NULL) {
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	}
146	fprintf(stdout, "\tNodes: %1dD-Nodes %d\n", numDim, in->Nodes->numNodes);
147	if (full) {
148	fprintf(stdout, "\t Id Tag gDOF gNI grDfI grNI: Coordinates\n");
149	for (i=0;i<in->Nodes->numNodes;i++) {
150	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]);
151	for (j=0;j<numDim;j++) fprintf(stdout," %20.15e",in->Nodes->Coordinates[INDEX2(j,i,numDim)]);
152	fprintf(stdout,"\n");
153	}
154	}
155	} else {
156	fprintf(stdout, "\tNodes: 0D-Nodes 0\n");
157	}
158
159	/* write elements: */
160	if (in->Elements!=NULL) {
161	fprintf(stdout, "\tElements: %s %d (TypeId=%d)\n",in->Elements->ReferenceElement->Type->Name,in->Elements->numElements,in->Elements->ReferenceElement->Type->TypeId);
162	NN=in->Elements->numNodes;
163	if (full) {
164	fprintf(stdout, "\t Id Tag Owner Color: Nodes\n");
165	for (i=0;i<in->Elements->numElements;i++) {
166	fprintf(stdout, "\t %5d %5d %5d %5d: ",in->Elements->Id[i],in->Elements->Tag[i],in->Elements->Owner[i],in->Elements->Color[i]);
167	for (j=0;j<NN;j++) fprintf(stdout," %5d",in->Nodes->Id[in->Elements->Nodes[INDEX2(j,i,NN)]]);
168	fprintf(stdout,"\n");
169	}
170	}
171	} else {
172	fprintf(stdout, "\tElements: Tet4 0\n");
173	}
174
175	/* write face elements: */
176	if (in->FaceElements!=NULL) {
177	fprintf(stdout, "\tFace elements: %s %d (TypeId=%d)\n", in->FaceElements->ReferenceElement->Type->Name,in->FaceElements->numElements,in->FaceElements->ReferenceElement->Type->TypeId);
178	NN=in->FaceElements->numNodes;
179	if (full) {
180	fprintf(stdout, "\t Id Tag Owner Color: Nodes\n");
181	for (i=0;i<in->FaceElements->numElements;i++) {
182	fprintf(stdout, "\t %5d %5d %5d %5d: ",in->FaceElements->Id[i],in->FaceElements->Tag[i],in->FaceElements->Owner[i],in->FaceElements->Color[i]);
183	for (j=0;j<NN;j++) fprintf(stdout," %5d",in->Nodes->Id[in->FaceElements->Nodes[INDEX2(j,i,NN)]]);
184	fprintf(stdout,"\n");
185	}
186	}
187	} else {
188	fprintf(stdout, "\tFace elements: Tri3 0\n");
189	}
190
191	/* write Contact elements : */
192	if (in->ContactElements!=NULL) {
193	fprintf(stdout, "\tContact elements: %s %d (TypeId=%d)\n",in->ContactElements->ReferenceElement->Type->Name,in->ContactElements->numElements,in->ContactElements->ReferenceElement->Type->TypeId);
194	NN=in->ContactElements->numNodes;
195	if (full) {
196	fprintf(stdout, "\t Id Tag Owner Color: Nodes\n");
197	for (i=0;i<in->ContactElements->numElements;i++) {
198	fprintf(stdout, "\t %5d %5d %5d %5d: ",in->ContactElements->Id[i],in->ContactElements->Tag[i],in->ContactElements->Owner[i],in->ContactElements->Color[i]);
199	for (j=0;j<NN;j++) fprintf(stdout," %5d",in->Nodes->Id[in->ContactElements->Nodes[INDEX2(j,i,NN)]]);
200	fprintf(stdout,"\n");
201	}
202	}
203	} else {
204	fprintf(stdout, "\tFace elements: Tri3_Contact 0\n");
205	}
206
207	/* write points: */
208	if (in->Points!=NULL) {
209	fprintf(stdout, "\tPoints: %s %d (TypeId=%d)\n",in->Points->ReferenceElement->Type->Name,in->Points->numElements,in->Points->ReferenceElement->Type->TypeId);
210	if (full) {
211	fprintf(stdout, "\t Id Tag Owner Color: Nodes\n");
212	for (i=0;i<in->Points->numElements;i++) {
213	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)]]);
214	}
215	}
216	} else {
217	fprintf(stdout, "\tPoints: Point1 0\n");
218	}
219
220	/* write tags:*/
221	if (tag_map) {
222	fprintf(stdout, "\tTags:\n");
223	while (tag_map) {
224	fprintf(stdout, "\t %5d %s\n", tag_map->tag_key, tag_map->name);
225	tag_map=tag_map->next;
226	}
227	}
228	}
229
230	/*
231	* $Log$
232	* Revision 1.2 2005/09/15 03:44:23 jgs
233	* Merge of development branch dev-02 back to main trunk on 2005-09-15
234	*
235	* Revision 1.1.1.1.6.1 2005/09/07 06:26:20 gross
236	* the solver from finley are put into the standalone package paso now
237	*
238	* Revision 1.1.1.1 2004/10/26 06:53:57 jgs
239	* initial import of project esys2
240	*
241	* Revision 1.1.1.1 2004/06/24 04:00:40 johng
242	* Initial version of eys using boost-python.
243	*
244	*
245	*/
246
Name	Value
svn:eol-style	native
svn:keywords	Author Date Id Revision