/[escript]/branches/doubleplusgood/dudley/src/Mesh.cpp
ViewVC logotype

Diff of /branches/doubleplusgood/dudley/src/Mesh.cpp

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

trunk/esys2/finley/src/finleyC/Mesh.c revision 150 by jgs, Thu Sep 15 03:44:45 2005 UTC trunk/finley/src/Mesh.c revision 1044 by gross, Mon Mar 19 07:29:31 2007 UTC
# Line 1  Line 1 
1  /*  /*
2   ******************************************************************************   ************************************************************
3   *                                                                            *   *          Copyright 2006 by ACcESS MNRF                   *
4   *       COPYRIGHT  ACcESS 2003,2004,2005 -  All Rights Reserved              *   *                                                          *
5   *                                                                            *   *              http://www.access.edu.au                    *
6   * This software is the property of ACcESS. No part of this code              *   *       Primary Business: Queensland, Australia            *
7   * may be copied in any form or by any means without the expressed written    *   *  Licensed under the Open Software License version 3.0    *
8   * consent of ACcESS.  Copying, use or modification of this software          *   *     http://www.opensource.org/licenses/osl-3.0.php       *
9   * by any unauthorised person is illegal unless that person has a software    *   *                                                          *
10   * license agreement with ACcESS.                                             *   ************************************************************
  *                                                                            *  
  ******************************************************************************  
11  */  */
12    
13    
14  /**************************************************************/  /**************************************************************/
15    
16  /*   Finley: Mesh */  /*   Finley: Mesh */
# Line 32  Line 31 
31    
32  extern Finley_RefElementInfo Finley_RefElement_InfoList[];  extern Finley_RefElementInfo Finley_RefElement_InfoList[];
33    
34  Finley_Mesh* Finley_Mesh_alloc(char* name,dim_t numDim, index_t order) {  #ifndef PASO_MPI
35    Finley_Mesh* Finley_Mesh_alloc(char* name,dim_t numDim, index_t order)
36    #else
37    Finley_Mesh* Finley_Mesh_alloc(char* name,dim_t numDim, index_t order, Paso_MPIInfo *mpi_info)
38    #endif
39    {
40    Finley_Mesh *out;    Finley_Mesh *out;
41        
42    /*  allocate the return value */    /*  allocate the return value */
# Line 45  Finley_Mesh* Finley_Mesh_alloc(char* nam Line 49  Finley_Mesh* Finley_Mesh_alloc(char* nam
49    out->FaceElements=NULL;    out->FaceElements=NULL;
50    out->Points=NULL;          out->Points=NULL;      
51    out->ContactElements=NULL;          out->ContactElements=NULL;      
52      out->TagMap=NULL;      
53    out->reference_counter=0;    out->reference_counter=0;
54    
55    out->FullFullPattern=NULL;    out->FullFullPattern=NULL;
56    out->FullReducedPattern=NULL;    out->FullReducedPattern=NULL;
57    out->ReducedFullPattern=NULL;    out->ReducedFullPattern=NULL;
58    out->ReducedReducedPattern=NULL;    out->ReducedReducedPattern=NULL;
59      
60    #ifdef PASO_MPI
61      out->MPIInfo = NULL;
62    
63      /* get MPI info */
64      out->MPIInfo = Paso_MPIInfo_getReference( mpi_info );
65      if (! Finley_noError()) {
66          Finley_Mesh_dealloc(out);
67          return NULL;
68      }
69    #endif
70    /*   copy name: */    /*   copy name: */
71        
72    out->Name=MEMALLOC(strlen(name)+1,char);    out->Name=MEMALLOC(strlen(name)+1,char);
# Line 62  Finley_Mesh* Finley_Mesh_alloc(char* nam Line 77  Finley_Mesh* Finley_Mesh_alloc(char* nam
77    strcpy(out->Name,name);    strcpy(out->Name,name);
78        
79    /*   allocate node table: */    /*   allocate node table: */
80      #ifdef PASO_MPI
81      out->Nodes=Finley_NodeFile_alloc( numDim, mpi_info );
82    #else
83    out->Nodes=Finley_NodeFile_alloc(numDim);    out->Nodes=Finley_NodeFile_alloc(numDim);
84    #endif
85    if (! Finley_noError()) {    if (! Finley_noError()) {
86        Finley_Mesh_dealloc(out);        Finley_Mesh_dealloc(out);
87        return NULL;        return NULL;
# Line 103  void Finley_Mesh_dealloc(Finley_Mesh* in Line 121  void Finley_Mesh_dealloc(Finley_Mesh* in
121         Finley_ElementFile_dealloc(in->FaceElements);         Finley_ElementFile_dealloc(in->FaceElements);
122         Finley_ElementFile_dealloc(in->ContactElements);         Finley_ElementFile_dealloc(in->ContactElements);
123         Finley_ElementFile_dealloc(in->Points);         Finley_ElementFile_dealloc(in->Points);
124           Finley_TagMap_free(in->TagMap);
125         Paso_SystemMatrixPattern_dealloc(in->FullFullPattern);         Paso_SystemMatrixPattern_dealloc(in->FullFullPattern);
126         Paso_SystemMatrixPattern_dealloc(in->FullReducedPattern);         Paso_SystemMatrixPattern_dealloc(in->FullReducedPattern);
127         Paso_SystemMatrixPattern_dealloc(in->ReducedFullPattern);         Paso_SystemMatrixPattern_dealloc(in->ReducedFullPattern);
128         Paso_SystemMatrixPattern_dealloc(in->ReducedReducedPattern);         Paso_SystemMatrixPattern_dealloc(in->ReducedReducedPattern);
129    #ifdef PASO_MPI
130           Paso_MPIInfo_dealloc( in->MPIInfo );
131    #endif
132         MEMFREE(in);               MEMFREE(in);      
133       }       }
134    }    }
# Line 141  dim_t Finley_Mesh_getNumDegreesOfFreedom Line 163  dim_t Finley_Mesh_getNumDegreesOfFreedom
163  dim_t Finley_Mesh_getReducedNumDegreesOfFreedom(Finley_Mesh *in) {  dim_t Finley_Mesh_getReducedNumDegreesOfFreedom(Finley_Mesh *in) {
164    return in->Nodes->reducedNumDegreesOfFreedom;    return in->Nodes->reducedNumDegreesOfFreedom;
165  }  }
166    
167    #ifdef PASO_MPI
168    void print_mesh_statistics( Finley_Mesh *out, bool_t reduced )
169    {
170      index_t i, r, j, N, M, dim;
171        int *ref;  
172        dim = out->Nodes->numDim;
173    
174        if( !reduced ){
175            printf( "+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\nMESH STATISTICS\n\nFULL MESH\n+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n\n" );
176            printf( "\nNodes\n========\n\n" );
177            printf( "\t%d internal DOF\n\t%d boundary DOF\n\t%d local DOF\n\t%d external DOF\n", out->Nodes->degreeOfFreedomDistribution->numInternal, out->Nodes->degreeOfFreedomDistribution->numBoundary, out->Nodes->degreeOfFreedomDistribution->numLocal, out->Nodes->degreeOfFreedomDistribution->numExternal);
178            for( i=0; i<out->Nodes->numNodes; i++ ){
179                printf( "node %d\t: id %d   \tDOF %d   \t: tag %d  \t: Dom %d  \t: coordinates [%3g", i, out->Nodes->Id[i], out->Nodes->degreeOfFreedom[i], out->Nodes->Tag[i], out->Nodes->Dom[i], out->Nodes->Coordinates[INDEX2(0,i,dim)] );
180                for( j=1; j<dim; j++ )
181                    printf( ", %3g",  out->Nodes->Coordinates[INDEX2(j,i,dim)]);
182                printf( " ]\n" );
183            }
184    
185            printf( "Elements\n=========\n\n" );
186            printf( "\t%d internal\n\t%d boundary\n\t%d local\n", out->Elements->elementDistribution->numInternal, out->Elements->elementDistribution->numBoundary, out->Elements->elementDistribution->numLocal );
187            N = out->Elements->ReferenceElement->Type->numNodes;
188            for( i=0; i<out->Elements->numElements; i++ ){
189                printf( "element %d    \t: id %d  \t: dom %d  \t: nodes [ %2d", i, out->Elements->Id[i], out->Elements->Dom[i], out->Elements->Nodes[INDEX2(0,i,N)] );
190                for( j=1; j<N; j++ )
191                    printf( ", %2d", out->Elements->Nodes[INDEX2(j,i,N)]);  
192                printf( " ] -> " );
193                if( N>8 )
194                    printf( "\n\t\t\t\t\t\t" );
195                printf( ": DOF   [ %2d", out->Nodes->degreeOfFreedom[out->Elements->Nodes[INDEX2(0,i,N)]] );    
196                for( j=1; j<N; j++ )
197                    printf( ", %2d", out->Nodes->degreeOfFreedom[out->Elements->Nodes[INDEX2(j,i,N)]]);
198                printf( " ]\n" );  
199            }
200    
201            printf( "\nFace Elements\n==========\n\n" );
202            printf( "\t%d internal\n\t%d boundary\n\t%d local\n", out->FaceElements->elementDistribution->numInternal, out->FaceElements->elementDistribution->numBoundary, out->FaceElements->elementDistribution->numLocal );
203            N = out->FaceElements->ReferenceElement->Type->numNodes;
204            for( i=0; i<out->FaceElements->numElements; i++ ){
205                printf( "face element %d \t: id %d  \t: dom %d  \t: nodes [ %2d", i, out->FaceElements->Id[i], out->FaceElements->Dom[i], out->FaceElements->Nodes[INDEX2(0,i,N)] );
206                for( j=1; j<N; j++ )
207                    printf( ", %2d", out->FaceElements->Nodes[INDEX2(j,i,N)]  );    
208                printf( " ] -> " );
209                if( N>8 )
210                    printf( "\n\t\t\t\t\t\t" );
211                printf( ": DOF   [ %2d", out->Nodes->degreeOfFreedom[out->FaceElements->Nodes[INDEX2(0,i,N)]]);
212                for( j=1; j<N; j++ )
213                    printf( ", %2d", out->Nodes->degreeOfFreedom[out->FaceElements->Nodes[INDEX2(j,i,N)]]);
214                printf( " ]\n" );  
215            }
216            printf( "\nDistribution Data\n==========\n\n" );
217            Finley_NodeDistribution_print( out->Nodes->degreeOfFreedomDistribution, stdout );
218        }
219        else{
220            printf( "+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\nMESH STATISTICS\n\nREDUCED MESH\n+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n\n" );
221            printf( "\nNodes\n========\n\n" );
222            printf( "\t%d internal DOF\n\t%d boundary DOF\n\t%d local DOF\n\t%d external DOF\n", out->Nodes->reducedDegreeOfFreedomDistribution->numInternal, out->Nodes->reducedDegreeOfFreedomDistribution->numBoundary, out->Nodes->reducedDegreeOfFreedomDistribution->numLocal, out->Nodes->reducedDegreeOfFreedomDistribution->numExternal);
223            for( i=0, r=0; i<out->Nodes->numNodes; i++ ){
224                if( out->Nodes->toReduced[i]>=0 ){
225                    printf( "node %d   \t: id %d   \tDOF %d   \t: tag %d  \t: Dom %d  \t: coordinates [%3g", r, out->Nodes->Id[i], out->Nodes->reducedDegreeOfFreedom[i], out->Nodes->Tag[i], out->Nodes->Dom[i], out->Nodes->Coordinates[INDEX2(0,i,dim)] );
226                    for( j=1; j<dim; j++ )
227                        printf( ", %3g",  out->Nodes->Coordinates[INDEX2(j,i,dim)]);
228                    printf( " ]\n" );
229                    r++;
230                }
231            }
232    
233            printf( "Elements\n=========\n\n" );
234            printf( "\t%d internal\n\t%d boundary\n\t%d local\n", out->Elements->elementDistribution->numInternal, out->Elements->elementDistribution->numBoundary, out->Elements->elementDistribution->numLocal );
235            N = out->Elements->LinearReferenceElement->Type->numNodes;
236            M = out->Elements->ReferenceElement->Type->numNodes;
237            ref = out->Elements->ReferenceElement->Type->linearNodes;
238            for( i=0; i<out->Elements->numElements; i++ ){
239                printf( "element %d    \t: id %d  \t: dom %d  \t: nodes [ %3d", i, out->Elements->Id[i], out->Elements->Dom[i], out->Nodes->toReduced[out->Elements->Nodes[INDEX2(ref[0],i,M)]] );
240                for( j=1; j<N; j++ ){
241                    printf( ", %3d", out->Nodes->toReduced[out->Elements->Nodes[INDEX2(ref[j],i,M)]] );
242                }
243                printf( " ] DOF [ %3d", out->Nodes->reducedDegreeOfFreedom[out->Elements->Nodes[INDEX2(ref[0],i,M)]] );
244                for( j=1; j<N; j++ )
245                    printf( ", %3d", out->Nodes->reducedDegreeOfFreedom[out->Elements->Nodes[INDEX2(ref[j],i,M)]]);
246                printf( " ]\n" );  
247            }
248    
249            printf( "\nFace Elements\n=================================================\n\n" );
250            printf( "\t%d internal\n\t%d boundary\n\t%d local\n", out->FaceElements->elementDistribution->numInternal, out->FaceElements->elementDistribution->numBoundary, out->FaceElements->elementDistribution->numLocal );
251            N = out->FaceElements->LinearReferenceElement->Type->numNodes;
252            M = out->FaceElements->ReferenceElement->Type->numNodes;
253            ref = out->FaceElements->ReferenceElement->Type->linearNodes;
254            for( i=0; i<out->FaceElements->numElements; i++ ){
255                printf( "face element %d \t: id %d  \t: dom %d  \t: nodes [ %3d", i, out->FaceElements->Id[i], out->FaceElements->Dom[i], out->Nodes->toReduced[out->FaceElements->Nodes[INDEX2(ref[0],i,M)]] );
256                for( j=1; j<N; j++ )
257                    printf( ", %3d", out->Nodes->toReduced[out->FaceElements->Nodes[INDEX2(j,i,M)]]  );
258                printf( " ] DOF [ %3d", out->Nodes->reducedDegreeOfFreedom[out->FaceElements->Nodes[INDEX2(ref[0],i,M)]]);  
259                for( j=1; j<N; j++ )
260                    printf( ", %3d", out->Nodes->reducedDegreeOfFreedom[out->FaceElements->Nodes[INDEX2(j,i,M)]]);  
261                printf( " ]\n" );  
262            }
263    
264            printf( "\nDistribution Data\n==================\n\n" );
265            Finley_NodeDistribution_print( out->Nodes->reducedDegreeOfFreedomDistribution, stdout );
266        }
267    }
268    #endif
269  /*  /*
270  * $Log$  * $Log$
271  * Revision 1.6  2005/09/15 03:44:22  jgs  * Revision 1.6  2005/09/15 03:44:22  jgs

Legend:
Removed from v.150  
changed lines
  Added in v.1044

  ViewVC Help
Powered by ViewVC 1.1.26