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 |
#ifndef INC_FINLEY_NODEFILE |
17 |
#define INC_FINLEY_NODEFILE |
18 |
|
19 |
#define MAX_numDim 3 |
20 |
|
21 |
#include "Finley.h" |
22 |
#include "NodeMapping.h" |
23 |
#include "escript/DataC.h" |
24 |
#include "paso/Distribution.h" |
25 |
#include "paso/Coupler.h" |
26 |
|
27 |
struct Finley_NodeFile { |
28 |
Paso_MPIInfo *MPIInfo; /* MPI information */ |
29 |
|
30 |
dim_t numNodes; /* number of nodes */ |
31 |
dim_t numDim; /* spatial dimension */ |
32 |
index_t *Id; /* Id[i] is the id number of node i. It need to be unique. */ |
33 |
index_t *Tag; /* Tag[i] is the tag of node i. */ |
34 |
index_t *tagsInUse; /* array of tags which are actually used */ |
35 |
dim_t numTagsInUse; /* number of tags used */ |
36 |
|
37 |
index_t* globalDegreesOfFreedom; /* globalDegreesOfFreedom[i] is the global degree of freedom assigned to node i */ |
38 |
/* this index is used to consider periodic boundary conditions by assigning */ |
39 |
/* the same degreesOfFreedom to the same node */ |
40 |
double *Coordinates; /* Coordinates[INDEX2(k,i,numDim)] is the k-th coordinate of the */ |
41 |
/* node i. */ |
42 |
index_t *globalReducedDOFIndex; /* assigns each local node a global unique Id in a dens labeling of reduced DOF*/ |
43 |
/* value <0 indicates that the DOF is not used */ |
44 |
index_t *globalReducedNodesIndex; /* assigns each local node a global unique Id in a dens labeling */ |
45 |
/* value <0 indicates that the DOF is not used */ |
46 |
index_t *globalNodesIndex; /* assigns each local reduced node a global unique Id in a dens labeling */ |
47 |
|
48 |
|
49 |
Finley_NodeMapping *nodesMapping; |
50 |
Finley_NodeMapping *reducedNodesMapping; |
51 |
Finley_NodeMapping *degreesOfFreedomMapping; |
52 |
Finley_NodeMapping *reducedDegreesOfFreedomMapping; |
53 |
|
54 |
Paso_Distribution *nodesDistribution; |
55 |
Paso_Distribution *reducedNodesDistribution; |
56 |
Paso_Distribution *degreesOfFreedomDistribution; |
57 |
Paso_Distribution *reducedDegreesOfFreedomDistribution; |
58 |
|
59 |
Paso_Connector* degreesOfFreedomConnector; |
60 |
Paso_Connector *reducedDegreesOfFreedomConnector; |
61 |
|
62 |
/* these a the packed versions of Id */ |
63 |
index_t *reducedNodesId; |
64 |
index_t *degreesOfFreedomId; |
65 |
index_t *reducedDegreesOfFreedomId; |
66 |
|
67 |
|
68 |
int status; /* the status counts the updates done on the node coordinates */ |
69 |
/* the value of status is increased by when the node coordinates are updated.*/ |
70 |
|
71 |
|
72 |
}; |
73 |
|
74 |
typedef struct Finley_NodeFile Finley_NodeFile; |
75 |
|
76 |
|
77 |
|
78 |
Finley_NodeFile* Finley_NodeFile_alloc(dim_t, Paso_MPIInfo *MPIInfo); |
79 |
index_t Finley_NodeFile_getFirstReducedNode(Finley_NodeFile* in); |
80 |
index_t Finley_NodeFile_getLastReducedNode(Finley_NodeFile* in); |
81 |
dim_t Finley_NodeFile_getGlobalNumReducedNodes(Finley_NodeFile* in); |
82 |
index_t* Finley_NodeFile_borrowGlobalReducedNodesIndex(Finley_NodeFile* in); |
83 |
index_t Finley_NodeFile_maxGlobalNodeIDIndex(Finley_NodeFile* in); |
84 |
index_t Finley_NodeFile_maxGlobalReducedNodeIDIndex(Finley_NodeFile* in); |
85 |
index_t Finley_NodeFile_GlobalDegreeOfFreedomIndex(Finley_NodeFile* in); |
86 |
index_t Finley_NodeFile_GlobalReducedDegreeOfFreedomIndex(Finley_NodeFile* in); |
87 |
|
88 |
index_t Finley_NodeFile_getFirstNode(Finley_NodeFile* in); |
89 |
index_t Finley_NodeFile_getLastNode(Finley_NodeFile* in); |
90 |
dim_t Finley_NodeFile_getGlobalNumNodes(Finley_NodeFile* in); |
91 |
index_t* Finley_NodeFile_borrowGlobalNodesIndex(Finley_NodeFile* in); |
92 |
|
93 |
/* returns the number of target */ |
94 |
dim_t Finley_NodeFile_getNumReducedNodes(Finley_NodeFile* in); |
95 |
dim_t Finley_NodeFile_getNumDegreesOfFreedom(Finley_NodeFile* in); |
96 |
dim_t Finley_NodeFile_getNumNodes(Finley_NodeFile* in); |
97 |
dim_t Finley_NodeFile_getNumReducedDegreesOfFreedom(Finley_NodeFile* in); |
98 |
|
99 |
/* returns the mapping from local nodes to a target */ |
100 |
index_t* Finley_NodeFile_borrowTargetReducedNodes(Finley_NodeFile* in); |
101 |
index_t* Finley_NodeFile_borrowTargetDegreesOfFreedom(Finley_NodeFile* in); |
102 |
index_t* Finley_NodeFile_borrowTargetNodes(Finley_NodeFile* in); |
103 |
index_t* Finley_NodeFile_borrowTargetReducedDegreesOfFreedom(Finley_NodeFile* in); |
104 |
/* returns the mapping from target to the local nodes */ |
105 |
index_t* Finley_NodeFile_borrowReducedNodesTarget(Finley_NodeFile* in); |
106 |
index_t* Finley_NodeFile_borrowDegreesOfFreedomTarget(Finley_NodeFile* in); |
107 |
index_t* Finley_NodeFile_borrowNodesTarget(Finley_NodeFile* in); |
108 |
index_t* Finley_NodeFile_borrowReducedDegreesOfFreedomTarget(Finley_NodeFile* in); |
109 |
|
110 |
void Finley_NodeFile_allocTable(Finley_NodeFile*,dim_t); |
111 |
void Finley_NodeFile_free(Finley_NodeFile*); |
112 |
void Finley_NodeFile_freeTable(Finley_NodeFile*); |
113 |
void Finley_NodeFile_setIdGlobalRange(index_t*,index_t*,Finley_NodeFile*); |
114 |
void Finley_NodeFile_setIdRange(index_t*,index_t*,Finley_NodeFile*); |
115 |
void Finley_NodeFile_setDOFGlobalRange(index_t*,index_t*,Finley_NodeFile*); |
116 |
void Finley_NodeFile_setDOFRange(index_t*,index_t*,Finley_NodeFile*); |
117 |
|
118 |
void Finley_NodeFile_setGlobalDOFRange(index_t*,index_t*,Finley_NodeFile*); |
119 |
void Finley_NodeFile_setGlobalIdRange(index_t*,index_t*,Finley_NodeFile*); |
120 |
index_t Finley_NodeFile_maxGlobalDegreeOfFreedomIndex(Finley_NodeFile*); |
121 |
index_t Finley_NodeFile_maxGlobalReducedDegreeOfFreedomIndex(Finley_NodeFile*); |
122 |
|
123 |
void Finley_NodeFile_setReducedDOFRange(index_t*,index_t*,Finley_NodeFile*); |
124 |
dim_t Finley_NodeFile_createDenseDOFLabeling(Finley_NodeFile*); |
125 |
dim_t Finley_NodeFile_createDenseNodeLabeling(Finley_NodeFile* in); |
126 |
dim_t Finley_NodeFile_createDenseReducedNodeLabeling(Finley_NodeFile* in, index_t* reducedNodeMask); |
127 |
dim_t Finley_NodeFile_createDenseReducedDOFLabeling(Finley_NodeFile* in, index_t* reducedNodeMask); |
128 |
void Finley_NodeFile_assignMPIRankToDOFs(Finley_NodeFile* in,Paso_MPI_rank* mpiRankOfDOF, index_t *distribution); |
129 |
void Finley_NodeFile_gather(index_t*,Finley_NodeFile*,Finley_NodeFile*); |
130 |
void Finley_NodeFile_gather_global(index_t*,Finley_NodeFile*,Finley_NodeFile*); |
131 |
void Finley_NodeFile_gatherEntries(dim_t, index_t*, index_t, index_t, index_t*, index_t*, index_t*, index_t*, index_t*, index_t*, dim_t numDim, double*, double*); |
132 |
void Finley_NodeFile_copyTable(dim_t,Finley_NodeFile*,dim_t,dim_t,Finley_NodeFile*); |
133 |
void Finley_NodeFile_scatter(index_t*,Finley_NodeFile*,Finley_NodeFile*); |
134 |
void Finley_NodeFile_scatterEntries(dim_t, index_t*, index_t, index_t, index_t*, index_t*, index_t*, index_t*, index_t*, index_t*, dim_t numDim, double*, double*); |
135 |
void Finley_NodeFile_copyTable(dim_t,Finley_NodeFile*,dim_t,dim_t,Finley_NodeFile*); |
136 |
void Finley_NodeFile_setGlobalReducedDegreeOfFreedomRange(index_t* min_id,index_t* max_id,Finley_NodeFile* in); |
137 |
void Finley_NodeFile_setGlobalNodeIDIndexRange(index_t* min_id,index_t* max_id,Finley_NodeFile* in); |
138 |
void Finley_NodeFile_setGlobalReducedNodeIDIndexRange(index_t* min_id,index_t* max_id,Finley_NodeFile* in); |
139 |
|
140 |
/* ===================== */ |
141 |
void Finley_NodeFile_setCoordinates(Finley_NodeFile*,escriptDataC*); |
142 |
void Finley_NodeFile_setTags(Finley_NodeFile*,const int,escriptDataC*); |
143 |
void Finley_NodeFile_setTagsInUse(Finley_NodeFile* in); |
144 |
|
145 |
#endif |
146 |
|