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

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

Parent Directory Parent Directory | Revision Log Revision Log


Revision 751 - (show annotations)
Mon Jun 26 01:46:34 2006 UTC (12 years, 10 months ago) by bcumming
File MIME type: text/plain
File size: 5979 byte(s)
Changes relating to the MPI version of escript
The standard OpenMP version of escript is unchanged

- updated data types (Finley_Mesh, Finley_NodeFile, etc) to store meshes
  over multiple MPI processes.
- added CommBuffer code in Paso for communication of Data associated
  with distributed meshes
- updates in Finley and Escript to support distributed data and operations
  on distributed data (such as interpolation).
- construction of RHS in MPI, so that simple explicit schemes (such as
  /docs/examples/wave.py without IO and the Locator) can run in MPI.
- updated mesh generation for first order line, rectangle and brick
  meshes and second order line meshes in MPI.        
- small changes to trunk/SConstruct and trunk/scons/ess_options.py to
  build the MPI version, these changes are turned off by default.

1 /*
2 ************************************************************
3 * Copyright 2006 by ACcESS MNRF *
4 * *
5 * http://www.access.edu.au *
6 * Primary Business: Queensland, Australia *
7 * Licensed under the Open Software License version 3.0 *
8 * http://www.opensource.org/licenses/osl-3.0.php *
9 * *
10 ************************************************************
11 */
12
13 /**************************************************************/
14
15 /* Finley: Mesh */
16
17 /* at input the element nodes refers to the numbering defined the Id assigned to the nodes in the */
18 /* NodeFile. At the output, the numbering of the element nodes is between 0 and numNodes */
19 /* degreesOfFreedom are not neccessarily referening to a dense numbering */
20
21 /**************************************************************/
22
23 /* Author: gross@access.edu.au */
24 /* Version: $Id$ */
25
26 /**************************************************************/
27
28 #include "Mesh.h"
29 #include "Util.h"
30
31 /**************************************************************/
32
33 void Finley_Mesh_resolveNodeIds(Finley_Mesh* in) {
34 char error_msg[LenErrorMsg_MAX];
35 dim_t k,len,numDim,newNumNodes,n;
36 index_t min_id,max_id,min_id2,max_id2,*maskNodes=NULL,*maskElements=NULL,*index=NULL;
37 Finley_NodeFile *newNodeFile=NULL;
38 Finley_resetError();
39 numDim=Finley_Mesh_getDim(in);
40
41 /* find the minimum and maximum id used: */
42
43 min_id=INDEX_T_MAX;
44 max_id=-INDEX_T_MAX;
45 Finley_NodeFile_setIdRange(&min_id2,&max_id2,in->Nodes);
46 if (min_id2==INDEX_T_MAX || max_id2==-INDEX_T_MAX) {
47 Finley_setError(VALUE_ERROR,"__FILE__: Mesh has not been defined completely.");
48 goto clean;
49 }
50
51 max_id=MAX(max_id,max_id2);
52 min_id=MIN(min_id,min_id2);
53 Finley_ElementFile_setNodeRange(&min_id2,&max_id2,in->Elements);
54 max_id=MAX(max_id,max_id2);
55 min_id=MIN(min_id,min_id2);
56 Finley_ElementFile_setNodeRange(&min_id2,&max_id2,in->FaceElements);
57 max_id=MAX(max_id,max_id2);
58 min_id=MIN(min_id,min_id2);
59 Finley_ElementFile_setNodeRange(&min_id2,&max_id2,in->ContactElements);
60 max_id=MAX(max_id,max_id2);
61 min_id=MIN(min_id,min_id2);
62 Finley_ElementFile_setNodeRange(&min_id2,&max_id2,in->Points);
63 max_id=MAX(max_id,max_id2);
64 min_id=MIN(min_id,min_id2);
65 #ifdef Finley_TRACE
66 printf("Node id range is %d:%d\n",min_id,max_id);
67 #endif
68
69 /* allocate a new node file used to gather existing node file: */
70
71 len=max_id-min_id+1;
72 #ifndef PASO_MPI
73 newNodeFile=Finley_NodeFile_alloc(numDim);
74 #else
75 newNodeFile=Finley_NodeFile_alloc(numDim,in->MPIInfo);
76 #endif
77 if (! Finley_noError()) goto clean;
78
79 maskNodes=TMPMEMALLOC(len,index_t);
80 if (Finley_checkPtr(maskNodes)) goto clean;
81
82 maskElements=TMPMEMALLOC(len,index_t);
83 if (Finley_checkPtr(maskElements)) goto clean;
84
85 index=TMPMEMALLOC(in->Nodes->numNodes,index_t);
86
87 if (Finley_checkPtr(maskElements)) goto clean;
88
89 #pragma omp parallel for private(n) schedule(static)
90 for (n=0;n<in->Nodes->numNodes;n++) index[n]=-1;
91 #pragma omp parallel for private(n) schedule(static)
92 for (n=0;n<len;n++) {
93 maskNodes[n]=-1;
94 maskElements[n]=-1;
95 }
96 /* mark the nodes referred by elements in maskElements: */
97
98 Finley_Mesh_markNodes(maskElements,min_id,in,FALSE);
99
100 /* mark defined nodes */
101
102 #pragma omp parallel for private(k) schedule(static)
103 for (k=0;k<in->Nodes->numNodes;k++) maskNodes[in->Nodes->Id[k]-min_id]=1;
104
105 /* check if all referenced nodes are actually defined: */
106
107 #pragma omp parallel for private(k) schedule(static)
108 for (k=0;k<len;k++) {
109 /* if a node is refered by an element is there a node defined ?*/
110 if (maskElements[k]>=0 && maskNodes[k]<0) {
111 sprintf(error_msg,"__FILE__:Node id %d is referenced by element but is not defined.",k+min_id);
112 Finley_setError(VALUE_ERROR,error_msg);
113 }
114 }
115
116 Finley_NodeFile_allocTable(newNodeFile,len);
117 if (! Finley_noError() ) goto clean;
118
119 if (Finley_noError()) {
120 /* scatter the nodefile in->nodes into newNodeFile using index; */
121 #pragma omp parallel for private(k) schedule(static)
122 for (k=0;k<in->Nodes->numNodes;k++)
123 index[k]=in->Nodes->Id[k]-min_id;
124 Finley_NodeFile_scatter(index,in->Nodes,newNodeFile);
125
126 /* relable used nodes: */
127 /* index maps the new node labeling onto the old one */
128 newNumNodes=Finley_Util_packMask(len,maskElements,index);
129 #pragma omp parallel for private(k) schedule(static)
130 for (k=0;k<newNumNodes;k++) maskElements[index[k]]=k;
131
132 /* create a new table of nodes: */
133 Finley_NodeFile_deallocTable(in->Nodes);
134 Finley_NodeFile_allocTable(in->Nodes,newNumNodes);
135
136 if (! Finley_noError()) goto clean;
137
138 /* gather the new nodefile into in->Nodes */
139 Finley_NodeFile_gather(index,newNodeFile,in->Nodes);
140
141 /* relable nodes of the elements: */
142 Finley_Mesh_relableElementNodes(maskElements,min_id,in);
143 }
144
145 /* clean-up: */
146
147 clean: TMPMEMFREE(maskNodes);
148 TMPMEMFREE(maskElements);
149 TMPMEMFREE(index);
150 Finley_NodeFile_deallocTable(newNodeFile);
151 Finley_NodeFile_dealloc(newNodeFile);
152 }
153
154 /*
155 * $Log$
156 * Revision 1.6 2005/09/15 03:44:23 jgs
157 * Merge of development branch dev-02 back to main trunk on 2005-09-15
158 *
159 * Revision 1.5.2.1 2005/09/07 06:26:20 gross
160 * the solver from finley are put into the standalone package paso now
161 *
162 * Revision 1.5 2005/07/08 04:07:54 jgs
163 * Merge of development branch back to main trunk on 2005-07-08
164 *
165 * Revision 1.4 2004/12/15 07:08:33 jgs
166 * *** empty log message ***
167 * Revision 1.1.1.1.2.2 2005/06/29 02:34:53 gross
168 * some changes towards 64 integers in finley
169 *
170 * Revision 1.1.1.1.2.1 2004/11/24 01:37:14 gross
171 * some changes dealing with the integer overflow in memory allocation. Finley solves 4M unknowns now
172 *
173 *
174 *
175 */
176

Properties

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

  ViewVC Help
Powered by ViewVC 1.1.26