source: issm/trunk/src/c/Container/Elements.cpp@ 10522

Last change on this file since 10522 was 10522, checked in by Mathieu Morlighem, 13 years ago

Simplified constructors of classes derived from Dataset
File size: 7.8 KB
Line 
1/*
2 * \file Elements.c
3 * \brief: implementation of the Elements class, derived from DataSet class
4 */
5
6/*Headers: {{{1*/
7#ifdef HAVE_CONFIG_H
8 #include <config.h>
9#else
10#error "Cannot compile with HAVE_CONFIG_H symbol! run configure first!"
11#endif
12
13#include <vector>
14#include <functional>
15#include <algorithm>
16#include <iostream>
17
18#include "./DataSet.h"
19#include "../shared/shared.h"
20#include "../include/include.h"
21#include "../EnumDefinitions/EnumDefinitions.h"
22
23using namespace std;
24/*}}}*/
25
26/*Object constructors and destructor*/
27/*FUNCTION Elements::Elements(){{{1*/
28Elements::Elements(){
29 enum_type=MeshElementsEnum;
30 return;
31}
32/*}}}*/
33/*FUNCTION Elements::~Elements(){{{1*/
34Elements::~Elements(){
35 return;
36}
37/*}}}*/
38
39/*Object management*/
40/*FUNCTION Elements::Configure{{{1*/
41void Elements::Configure(Elements* elements,Loads* loads, Nodes* nodes, Vertices* vertices, Materials* materials,Parameters* parameters){
42
43 vector<Object*>::iterator object;
44 Element* element=NULL;
45
46 for ( object=objects.begin() ; object < objects.end(); object++ ){
47
48 element=(Element*)(*object);
49 element->Configure(elements,loads,nodes,materials,parameters);
50
51 }
52
53}
54/*}}}*/
55/*FUNCTION Elements::ProcessResultsUnits{{{1*/
56void Elements::ProcessResultsUnits(void){
57
58 //Process results to be output in the correct units
59 for(int i=0;i<this->Size();i++){
60 Element* element=(Element*)this->GetObjectByOffset(i);
61 element->ProcessResultsUnits();
62 }
63}
64/*}}}*/
65/*FUNCTION Elements::DeleteResults{{{1*/
66void Elements::DeleteResults(void){
67
68 for (int i=0;i<this->Size();i++){
69 Element* element=(Element*)this->GetObjectByOffset(i);
70 element->DeleteResults();
71 }
72}
73/*}}}*/
74/*FUNCTION Elements::ResultsToPatch{{{1*/
75Patch* Elements::ResultsToPatch(void){
76
77 /*output: */
78 Patch* patch=NULL;
79
80 /*intermediary: */
81 int i;
82 int count;
83 int numrows;
84 int numvertices;
85 int numnodes;
86 int max_numvertices;
87 int max_numnodes;
88 int element_numvertices;
89 int element_numrows;
90 int element_numnodes;
91
92 /*We are going to extract from the results within the elements, the desired results , and create a table
93 * of patch information, that will hold, for each element that computed the result that
94 * we desire, the enum_type of the result, the step and time, the id of the element, the interpolation type, the vertices ids, and the values
95 * at the nodes (could be different from the vertices). This will be used for visualization purposes.
96 * For example, we could build the following patch table, for velocities:
97 *
98 1. on a Beam element, Vx, at step 1, time .5, element id 1, interpolation type P0 (constant), vertices ids 1 and 2, one constant value 4.5
99 VxEnum 1 .5 1 P0 1 2 4.5 NaN NaN
100 2. on a Tria element, Vz, at step 2, time .8, element id 2, interpolation type P1 (linear), vertices ids 1 3 and 4, with values at 3 nodes 4.5, 3.2, 2.5
101 VzEnum 2 .8 2 P1 1 3 4 4.5 3.2 2.5
102 * ... etc ...
103 *
104 * So what do we need to build the table: the maximum number of vertices included in the table,
105 * and the maximum number of nodal values, as well as the number of rows. Once we have that,
106 * we ask the elements to fill their own row in the table, by looping on the elememnts.
107 *
108 * We will use the Patch object, which will store all of the information needed, and will be able
109 * to output itself to disk on its own. See object/Patch.h for format of this object.*/
110
111 /*First, determine maximum number of vertices, nodes, and number of results: */
112 numrows=0;
113 numvertices=0;
114 numnodes=0;
115
116 for(i=0;i<this->Size();i++){
117
118 Element* element=(Element*)this->GetObjectByOffset(i);
119 element->PatchSize(&element_numrows,&element_numvertices,&element_numnodes);
120
121 numrows+=element_numrows;
122 if(element_numvertices>numvertices)numvertices=element_numvertices;
123 if(element_numnodes>numnodes)numnodes=element_numnodes;
124 }
125
126 #ifdef _PARALLEL_
127 /*Synchronize across cluster, so as to not end up with different sizes for each patch on each cpu: */
128 MPI_Reduce (&numvertices,&max_numvertices,1,MPI_INT,MPI_MAX,0,MPI_COMM_WORLD );
129 MPI_Bcast(&max_numvertices,1,MPI_INT,0,MPI_COMM_WORLD);
130 numvertices=max_numvertices;
131
132 MPI_Reduce (&numnodes,&max_numnodes,1,MPI_INT,MPI_MAX,0,MPI_COMM_WORLD );
133 MPI_Bcast(&max_numnodes,1,MPI_INT,0,MPI_COMM_WORLD);
134 numnodes=max_numnodes;
135 #endif
136
137 /*Ok, initialize Patch object: */
138 patch=new Patch(numrows,numvertices,numnodes);
139
140 /*Now, go through elements, and fill the Patch object: */
141 count=0;
142 for(i=0;i<this->Size();i++){
143 Element* element=(Element*)this->GetObjectByOffset(i);
144 element->PatchFill(&count,patch);
145 }
146
147 return patch;
148}
149/*}}}*/
150/*FUNCTION Elements::SetCurrentConfiguration{{{1*/
151void Elements::SetCurrentConfiguration(Elements* elements,Loads* loads, Nodes* nodes, Vertices* vertices, Materials* materials,Parameters* parameters){
152
153 vector<Object*>::iterator object;
154 Element* element=NULL;
155
156 for ( object=objects.begin() ; object < objects.end(); object++ ){
157
158 element=(Element*)(*object);
159 element->SetCurrentConfiguration(elements,loads,nodes,materials,parameters);
160
161 }
162
163}
164/*}}}*/
165/*FUNCTION Elements::ToResults{{{1*/
166void Elements::ToResults(Results* results,Parameters* parameters,int step, double time){
167
168 extern int my_rank;
169
170 Patch *patch = NULL;
171 int *resultsenums = NULL;
172 double *vector_serial= NULL;
173 Vec vector = NULL;
174 bool io_gather;
175 bool results_on_vertices;
176 int numberofvertices;
177 int numberofresults;
178
179 /*Recover parameters: */
180 parameters->FindParam(&io_gather,SettingsIoGatherEnum);
181 parameters->FindParam(&results_on_vertices,SettingsResultsOnVerticesEnum);
182 parameters->FindParam(&numberofvertices,MeshNumberofverticesEnum);
183
184 if(results_on_vertices){
185 /*No patch here, we prepare vectors*/
186
187 /*OK, see what the first element of this partition has in stock (this is common to all partitions)*/
188 Element* element=(Element*)this->GetObjectByOffset(0);
189 element->ListResultsEnums(&resultsenums,&numberofresults);
190
191 /*Loop over all results and get nodal vector*/
192 for(int i=0;i<numberofresults;i++){
193
194 /*Get vector for result number i*/
195 vector=NewVec(numberofvertices);
196 for(int j=0;j<this->Size();j++){
197 Element* element=(Element*)this->GetObjectByOffset(j);
198 element->GetVectorFromResults(vector,resultsenums[i]);
199 }
200 VecAssemblyBegin(vector);
201 VecAssemblyEnd(vector);
202
203 /*Serialize and add to results*/
204 VecToMPISerial(&vector_serial,vector);
205 if(my_rank==0){
206 /*No need to add this vector for all cpus*/
207 results->AddObject(new DoubleVecExternalResult(results->Size()+1,resultsenums[i],vector_serial,numberofvertices,step,time));
208 }
209
210 /*clean up*/
211 VecFree(&vector);
212 xfree((void**)&vector_serial);
213 }
214 }
215 else{
216 /*create patch object out of all results in this dataset: */
217 patch=this->ResultsToPatch();
218
219 /*Gather onto master cpu 0, if needed: */
220#ifdef _PARALLEL_
221 if(io_gather)patch->Gather();
222#endif
223
224 /*create result object and add to results dataset:*/
225 if (patch->maxvertices && patch->maxnodes){
226 results->AddObject(new IntExternalResult(results->Size()+1,PatchVerticesEnum,patch->maxvertices,step,time));
227 results->AddObject(new IntExternalResult(results->Size()+1,PatchNodesEnum, patch->maxnodes,step,time));
228 results->AddObject(new DoubleMatExternalResult(results->Size()+1,PatchEnum,patch->values,patch->numrows,patch->numcols,step,time));
229 }
230 }
231
232 /*Free ressources:*/
233 xfree((void**)&resultsenums);
234 delete patch;
235}
236/*}}}*/
237/*FUNCTION Elements::NumberOfElements{{{1*/
238int Elements::NumberOfElements(void){
239
240 int local_nelem=0;
241 int numberofelements;
242
243 #ifdef _PARALLEL_
244 local_nelem=this->Size();
245 MPI_Allreduce ( (void*)&local_nelem,(void*)&numberofelements,1,MPI_INT,MPI_SUM,MPI_COMM_WORLD);
246 #else
247 numberofelements=this->Size();
248 #endif
249
250 return numberofelements;
251}
252/*}}}*/
253/*FUNCTION Elements::InputCopy{{{1*/
254void Elements::InputDuplicate(int input_enum,int output_enum){
255
256 for(int i=0;i<this->Size();i++){
257 Element* element=(Element*)this->GetObjectByOffset(i);
258 element->InputDuplicate(input_enum,output_enum);
259 }
260}
261/*}}}*/
Note: See TracBrowser for help on using the repository browser.