/[escript]/branches/domexper/dudley/src/Mesh.c
ViewVC logotype

Diff of /branches/domexper/dudley/src/Mesh.c

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

revision 1062 by gross, Mon Mar 26 06:17:53 2007 UTC revision 2358 by gross, Wed Apr 1 22:25:24 2009 UTC
# Line 1  Line 1 
1  /*  /*******************************************************
2   ************************************************************  *
3   *          Copyright 2006 by ACcESS MNRF                   *  * Copyright (c) 2003-2008 by University of Queensland
4   *                                                          *  * Earth Systems Science Computational Center (ESSCC)
5   *              http://www.access.edu.au                    *  * http://www.uq.edu.au/esscc
6   *       Primary Business: Queensland, Australia            *  *
7   *  Licensed under the Open Software License version 3.0    *  * Primary Business: Queensland, Australia
8   *     http://www.opensource.org/licenses/osl-3.0.php       *  * Licensed under the Open Software License version 3.0
9   *                                                          *  * http://www.opensource.org/licenses/osl-3.0.php
10   ************************************************************  *
11  */  *******************************************************/
12    
13    
14  /**************************************************************/  /**************************************************************/
# Line 17  Line 17 
17    
18  /**************************************************************/  /**************************************************************/
19    
 /*  Author: gross@access.edu.au */  
 /*  Version: $Id$ */  
   
 /**************************************************************/  
   
20  #include "Mesh.h"  #include "Mesh.h"
21    
22  /**************************************************************/  /**************************************************************/
# Line 31  Line 26 
26    
27  extern Finley_RefElementInfo Finley_RefElement_InfoList[];  extern Finley_RefElementInfo Finley_RefElement_InfoList[];
28    
 #ifndef PASO_MPI  
 Finley_Mesh* Finley_Mesh_alloc(char* name,dim_t numDim, index_t order, index_t reduced_order)  
 #else  
29  Finley_Mesh* Finley_Mesh_alloc(char* name,dim_t numDim, index_t order, index_t reduced_order, Paso_MPIInfo *mpi_info)  Finley_Mesh* Finley_Mesh_alloc(char* name,dim_t numDim, index_t order, index_t reduced_order, Paso_MPIInfo *mpi_info)
 #endif  
30  {  {
31    Finley_Mesh *out;    Finley_Mesh *out;
32        
# Line 56  Finley_Mesh* Finley_Mesh_alloc(char* nam Line 47  Finley_Mesh* Finley_Mesh_alloc(char* nam
47    out->FullReducedPattern=NULL;    out->FullReducedPattern=NULL;
48    out->ReducedFullPattern=NULL;    out->ReducedFullPattern=NULL;
49    out->ReducedReducedPattern=NULL;    out->ReducedReducedPattern=NULL;
   
 #ifdef PASO_MPI  
   out->MPIInfo = NULL;  
   
   /* get MPI info */  
50    out->MPIInfo = Paso_MPIInfo_getReference( mpi_info );    out->MPIInfo = Paso_MPIInfo_getReference( mpi_info );
51    if (! Finley_noError()) {    if (! Finley_noError()) {
52        Finley_Mesh_dealloc(out);        Finley_Mesh_free(out);
53        return NULL;        return NULL;
54    }    }
 #endif  
55    /*   copy name: */    /*   copy name: */
56        
57    out->Name=MEMALLOC(strlen(name)+1,char);    out->Name=MEMALLOC(strlen(name)+1,char);
58    if (Finley_checkPtr(out->Name)) {    if (Finley_checkPtr(out->Name)) {
59        Finley_Mesh_dealloc(out);        Finley_Mesh_free(out);
60        return NULL;        return NULL;
61    }    }
62    strcpy(out->Name,name);    strcpy(out->Name,name);
63        
64    /*   allocate node table: */    /*   allocate node table: */
 #ifdef PASO_MPI  
65    out->Nodes=Finley_NodeFile_alloc( numDim, mpi_info );    out->Nodes=Finley_NodeFile_alloc( numDim, mpi_info );
 #else  
   out->Nodes=Finley_NodeFile_alloc(numDim);  
 #endif  
66    if (! Finley_noError()) {    if (! Finley_noError()) {
67        Finley_Mesh_dealloc(out);        Finley_Mesh_free(out);
68        return NULL;        return NULL;
69    }    }
70    out->order=order;    out->order=order;
# Line 103  Finley_Mesh* Finley_Mesh_reference(Finle Line 84  Finley_Mesh* Finley_Mesh_reference(Finle
84       return in;       return in;
85  }  }
86    
87  /*   deallocates a mesh: */  /*   freeates a mesh: */
88    
89  void Finley_Mesh_dealloc(Finley_Mesh* in) {  void Finley_Mesh_free(Finley_Mesh* in) {
90    if (in!=NULL) {    if (in!=NULL) {
91       in->reference_counter--;       in->reference_counter--;
92       if (in->reference_counter<1) {       if (in->reference_counter<1) {
93         #ifdef Finley_TRACE         #ifdef Finley_TRACE
94         if (in->Name!=NULL) {         if (in->Name!=NULL) {
95             printf("Finley_Mesh_dealloc: mesh %s is deallocated.\n",in->Name);             printf("Finley_Mesh_free: mesh %s is freed.\n",in->Name);
96         } else {         } else {
97             printf("Finley_Mesh_dealloc\n");             printf("Finley_Mesh_free\n");
98         }         }
99         #endif         #endif
100         MEMFREE(in->Name);         MEMFREE(in->Name);
101         Finley_NodeFile_dealloc(in->Nodes);         Finley_NodeFile_free(in->Nodes);
102         Finley_ElementFile_dealloc(in->Elements);           Finley_ElementFile_free(in->FaceElements);
103         Finley_ElementFile_dealloc(in->FaceElements);         Finley_ElementFile_free(in->Elements);  
104         Finley_ElementFile_dealloc(in->ContactElements);         Finley_ElementFile_free(in->ContactElements);
105         Finley_ElementFile_dealloc(in->Points);         Finley_ElementFile_free(in->Points);
106         Finley_TagMap_free(in->TagMap);         Finley_TagMap_free(in->TagMap);
107         Paso_SystemMatrixPattern_dealloc(in->FullFullPattern);         Paso_SystemMatrixPattern_free(in->FullFullPattern);
108         Paso_SystemMatrixPattern_dealloc(in->FullReducedPattern);         Paso_SystemMatrixPattern_free(in->FullReducedPattern);
109         Paso_SystemMatrixPattern_dealloc(in->ReducedFullPattern);         Paso_SystemMatrixPattern_free(in->ReducedFullPattern);
110         Paso_SystemMatrixPattern_dealloc(in->ReducedReducedPattern);         Paso_SystemMatrixPattern_free(in->ReducedReducedPattern);
111  #ifdef PASO_MPI         Paso_MPIInfo_free( in->MPIInfo );
        Paso_MPIInfo_dealloc( in->MPIInfo );  
 #endif  
112         MEMFREE(in);               MEMFREE(in);      
113       }       }
114    }    }
# Line 143  dim_t Finley_Mesh_getDim(Finley_Mesh *in Line 122  dim_t Finley_Mesh_getDim(Finley_Mesh *in
122    return in->Nodes->numDim;    return in->Nodes->numDim;
123  }  }
124    
125  /**************************************************************/  void Finley_Mesh_setElements(Finley_Mesh* self,Finley_ElementFile *elements) {
126        Finley_ElementFile_free(self->Elements);
127  /*  returns the number of nodes in the mesh: */      self->Elements=elements;
128    }
129  dim_t Finley_Mesh_getNumNodes(Finley_Mesh *in) {  void Finley_Mesh_setFaceElements(Finley_Mesh* self,Finley_ElementFile *elements) {
130    return in->Nodes->numNodes;      Finley_ElementFile_free(self->FaceElements);
131        self->FaceElements=elements;
132    }
133    void Finley_Mesh_setContactElements(Finley_Mesh* self,Finley_ElementFile *elements) {
134        Finley_ElementFile_free(self->ContactElements);
135        self->ContactElements=elements;
136    }
137    void Finley_Mesh_setPoints(Finley_Mesh* self,Finley_ElementFile *elements) {
138        Finley_ElementFile_free(self->Points);
139        self->Points=elements;
140  }  }
 /**************************************************************/  
141    
 /*  returns the number of degrees of freedom in the mesh: */  
   
 dim_t Finley_Mesh_getNumDegreesOfFreedom(Finley_Mesh *in) {  
   return in->Nodes->numDegreesOfFreedom;  
 }  
 /**************************************************************/  
   
 /*  returns the number of degrees of freedom in the mesh: */  
   
 dim_t Finley_Mesh_getReducedNumDegreesOfFreedom(Finley_Mesh *in) {  
   return in->Nodes->reducedNumDegreesOfFreedom;  
 }  
   
 #ifdef PASO_MPI  
 void print_mesh_statistics( Finley_Mesh *out, bool_t reduced )  
 {  
   index_t i, r, j, N, M, dim;  
     int *ref;    
     dim = out->Nodes->numDim;  
   
     if( !reduced ){  
         printf( "+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\nMESH STATISTICS\n\nFULL MESH\n+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n\n" );  
         printf( "\nNodes\n========\n\n" );  
         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);  
         for( i=0; i<out->Nodes->numNodes; i++ ){  
             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)] );  
             for( j=1; j<dim; j++ )  
                 printf( ", %3g",  out->Nodes->Coordinates[INDEX2(j,i,dim)]);  
             printf( " ]\n" );  
         }  
   
         printf( "Elements\n=========\n\n" );  
         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 );  
         N = out->Elements->ReferenceElement->Type->numNodes;  
         for( i=0; i<out->Elements->numElements; i++ ){  
             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)] );  
             for( j=1; j<N; j++ )  
                 printf( ", %2d", out->Elements->Nodes[INDEX2(j,i,N)]);    
             printf( " ] -> " );  
             if( N>8 )  
                 printf( "\n\t\t\t\t\t\t" );  
             printf( ": DOF   [ %2d", out->Nodes->degreeOfFreedom[out->Elements->Nodes[INDEX2(0,i,N)]] );      
             for( j=1; j<N; j++ )  
                 printf( ", %2d", out->Nodes->degreeOfFreedom[out->Elements->Nodes[INDEX2(j,i,N)]]);  
             printf( " ]\n" );    
         }  
   
         printf( "\nFace Elements\n==========\n\n" );  
         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 );  
         N = out->FaceElements->ReferenceElement->Type->numNodes;  
         for( i=0; i<out->FaceElements->numElements; i++ ){  
             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)] );  
             for( j=1; j<N; j++ )  
                 printf( ", %2d", out->FaceElements->Nodes[INDEX2(j,i,N)]  );      
             printf( " ] -> " );  
             if( N>8 )  
                 printf( "\n\t\t\t\t\t\t" );  
             printf( ": DOF   [ %2d", out->Nodes->degreeOfFreedom[out->FaceElements->Nodes[INDEX2(0,i,N)]]);  
             for( j=1; j<N; j++ )  
                 printf( ", %2d", out->Nodes->degreeOfFreedom[out->FaceElements->Nodes[INDEX2(j,i,N)]]);  
             printf( " ]\n" );    
         }  
         printf( "\nDistribution Data\n==========\n\n" );  
         Finley_NodeDistribution_print( out->Nodes->degreeOfFreedomDistribution, stdout );  
     }  
     else{  
         printf( "+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\nMESH STATISTICS\n\nREDUCED MESH\n+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++\n\n" );  
         printf( "\nNodes\n========\n\n" );  
         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);  
         for( i=0, r=0; i<out->Nodes->numNodes; i++ ){  
             if( out->Nodes->toReduced[i]>=0 ){  
                 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)] );  
                 for( j=1; j<dim; j++ )  
                     printf( ", %3g",  out->Nodes->Coordinates[INDEX2(j,i,dim)]);  
                 printf( " ]\n" );  
                 r++;  
             }  
         }  
   
         printf( "Elements\n=========\n\n" );  
         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 );  
         N = out->Elements->LinearReferenceElement->Type->numNodes;  
         M = out->Elements->ReferenceElement->Type->numNodes;  
         ref = out->Elements->ReferenceElement->Type->linearNodes;  
         for( i=0; i<out->Elements->numElements; i++ ){  
             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)]] );  
             for( j=1; j<N; j++ ){  
                 printf( ", %3d", out->Nodes->toReduced[out->Elements->Nodes[INDEX2(ref[j],i,M)]] );  
             }  
             printf( " ] DOF [ %3d", out->Nodes->reducedDegreeOfFreedom[out->Elements->Nodes[INDEX2(ref[0],i,M)]] );  
             for( j=1; j<N; j++ )  
                 printf( ", %3d", out->Nodes->reducedDegreeOfFreedom[out->Elements->Nodes[INDEX2(ref[j],i,M)]]);  
             printf( " ]\n" );    
         }  
   
         printf( "\nFace Elements\n=================================================\n\n" );  
         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 );  
         N = out->FaceElements->LinearReferenceElement->Type->numNodes;  
         M = out->FaceElements->ReferenceElement->Type->numNodes;  
         ref = out->FaceElements->ReferenceElement->Type->linearNodes;  
         for( i=0; i<out->FaceElements->numElements; i++ ){  
             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)]] );  
             for( j=1; j<N; j++ )  
                 printf( ", %3d", out->Nodes->toReduced[out->FaceElements->Nodes[INDEX2(j,i,M)]]  );  
             printf( " ] DOF [ %3d", out->Nodes->reducedDegreeOfFreedom[out->FaceElements->Nodes[INDEX2(ref[0],i,M)]]);    
             for( j=1; j<N; j++ )  
                 printf( ", %3d", out->Nodes->reducedDegreeOfFreedom[out->FaceElements->Nodes[INDEX2(j,i,M)]]);    
             printf( " ]\n" );    
         }  
   
         printf( "\nDistribution Data\n==================\n\n" );  
         Finley_NodeDistribution_print( out->Nodes->reducedDegreeOfFreedomDistribution, stdout );  
     }  
 }  
 #endif  
 /*  
 * $Log$  
 * Revision 1.6  2005/09/15 03:44:22  jgs  
 * Merge of development branch dev-02 back to main trunk on 2005-09-15  
 *  
 * Revision 1.5.2.1  2005/09/07 06:26:19  gross  
 * the solver from finley are put into the standalone package paso now  
 *  
 * Revision 1.5  2005/07/08 04:07:51  jgs  
 * Merge of development branch back to main trunk on 2005-07-08  
 *  
 * Revision 1.4  2004/12/15 07:08:32  jgs  
 * *** empty log message ***  
 * Revision 1.1.1.1.2.3  2005/06/29 02:34:51  gross  
 * some changes towards 64 integers in finley  
 *  
 * Revision 1.1.1.1.2.2  2004/11/24 01:37:13  gross  
 * some changes dealing with the integer overflow in memory allocation. Finley solves 4M unknowns now  
 *  
 *  
 *  
 */  

Legend:
Removed from v.1062  
changed lines
  Added in v.2358

  ViewVC Help
Powered by ViewVC 1.1.26