/[escript]/trunk-mpi-branch/finley/src/Mesh_hex8.c
ViewVC logotype

Contents of /trunk-mpi-branch/finley/src/Mesh_hex8.c

Parent Directory Parent Directory | Revision Log Revision Log


Revision 1223 - (show annotations)
Fri Aug 3 02:40:39 2007 UTC (11 years, 8 months ago) by gross
File MIME type: text/plain
File size: 21149 byte(s)
first attemt towards an improved MPI version.  

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: generates rectangular meshes */
16
17 /* Generates a numElements[0] x numElements[1] x numElements[2] mesh with first order elements (Hex8) in the brick */
18 /* [0,Length[0]] x [0,Length[1]] x [0,Length[2]]. order is the desired accuracy of the */
19 /* integration scheme. */
20
21 /**************************************************************/
22
23 /* Author: gross@access.edu.au */
24 /* Version: $Id$ */
25
26 /**************************************************************/
27
28 #include "RectangularMesh.h"
29
30 Finley_Mesh* Finley_RectangularMesh_Hex8(dim_t* numElements,
31 double* Length,
32 bool_t* periodic,
33 index_t order,
34 index_t reduced_order,
35 bool_t useElementsOnFace,
36 bool_t useFullElementOrder)
37 {
38 #define N_PER_E 1
39 #define DIM 3
40 dim_t N0,N1,N2,NE0,NE1,NE2,i0,i1,i2,k,Nstride0,Nstride1,Nstride2, local_NE0, local_NE1, local_NE2, local_N0, local_N1, local_N2;
41 dim_t totalNECount,faceNECount,NDOF0,NDOF1,NDOF2,NFaceElements, NN;
42 index_t node0, myRank, e_offset2, e_offset1, e_offset0, offset1, offset2, offset0, global_i0, global_i1, global_i2;
43 Finley_Mesh* out;
44 Paso_MPIInfo *mpi_info = NULL;
45 char name[50];
46 double time0=Finley_timer();
47
48 /* get MPI information */
49 mpi_info = Paso_MPIInfo_alloc( MPI_COMM_WORLD );
50 if (! Finley_noError()) {
51 return NULL;
52 }
53 myRank=mpi_info->rank;
54
55 /* allocate mesh: */
56 sprintf(name,"Rectangular %d x %d x %d mesh",N0,N1,N2);
57 out=Finley_Mesh_alloc(name,DIM,order, reduced_order, mpi_info);
58 if (! Finley_noError()) {
59 Paso_MPIInfo_free( mpi_info );
60 return NULL;
61 }
62
63 Finley_Mesh_setElements(out,Finley_ElementFile_alloc(Hex8,out->order,out->reduced_order,mpi_info));
64 if (useElementsOnFace) {
65 Finley_Mesh_setFaceElements(out,Finley_ElementFile_alloc(Hex8Face,
66 out->order,
67 out->reduced_order,
68 mpi_info));
69 Finley_Mesh_setContactElements(out,Finley_ElementFile_alloc(Hex8Face_Contact,
70 out->order,
71 out->reduced_order,
72 mpi_info));
73 } else {
74 Finley_Mesh_setFaceElements(out,Finley_ElementFile_alloc(Rec4,
75 out->order,
76 out->reduced_order,
77 mpi_info));
78 Finley_Mesh_setContactElements(out,Finley_ElementFile_alloc(Rec4_Contact,
79 out->order,
80 out->reduced_order,
81 mpi_info));
82 }
83 Finley_Mesh_setPoints(out,Finley_ElementFile_alloc(Point1,
84 out->order,
85 out->reduced_order,
86 mpi_info));
87 if (! Finley_noError()) {
88 Paso_MPIInfo_free( mpi_info );
89 Finley_Mesh_free(out);
90 return NULL;
91 }
92
93 /* set up the global dimensions of the mesh */
94
95 NE0=MAX(1,numElements[0]);
96 NE1=MAX(1,numElements[1]);
97 NE2=MAX(1,numElements[2]);
98 N0=N_PER_E*NE0+1;
99 N1=N_PER_E*NE1+1;
100 N2=N_PER_E*NE2+1;
101
102 /* work out the largest dimension */
103 if (N2=MAX3(N0,N1,N2)) {
104 Nstride0=1;
105 Nstride1=N0;
106 Nstride2=N0*N1;
107 local_NE0=NE0;
108 e_offset0=0;
109 local_NE1=NE1;
110 e_offset1=0;
111 Paso_MPIInfo_Split(mpi_info,NE2,&local_NE2,&e_offset2);
112 } else if (N1=MAX3(N0,N1,N2)) {
113 Nstride0=N2;
114 Nstride1=N0*N2;
115 Nstride2=1;
116 local_NE0=NE0;
117 e_offset0=0;
118 Paso_MPIInfo_Split(mpi_info,NE1,&local_NE1,&e_offset1);
119 local_NE2=NE2;
120 e_offset2=0;
121 } else {
122 Nstride0=N1*N2;
123 Nstride1=1;
124 Nstride2=N1;
125 Paso_MPIInfo_Split(mpi_info,NE0,&local_NE0,&e_offset0);
126 local_NE1=NE1;
127 e_offset1=0;
128 local_NE2=NE2;
129 e_offset2=0;
130 }
131 offset0=e_offset0*N_PER_E;
132 offset1=e_offset1*N_PER_E;
133 offset2=e_offset2*N_PER_E;
134 local_N0=local_NE0*N_PER_E+1;
135 local_N1=local_NE1*N_PER_E+1;
136 local_N2=local_NE2*N_PER_E+1;
137
138 /* get the number of surface elements */
139
140 NFaceElements=0;
141 if (!periodic[2]) {
142 NDOF2=N2;
143 if (offset2==0) NFaceElements+=local_NE1*local_NE0;
144 if (local_NE2+e_offset2 == NE2) NFaceElements+=local_NE1*local_NE0;
145 } else {
146 NDOF2=N2-1;
147
148 if (!periodic[0]) {
149 NDOF0=N0;
150 if (e_offset0 == 0) NFaceElements+=local_NE1*local_NE2;
151 if (local_NE0+e_offset0 == NE0) NFaceElements+=local_NE1*local_NE2;
152 } else {
153 NDOF0=N0-1;
154 }
155 if (!periodic[1]) {
156 NDOF1=N1;
157 if (e_offset1 == 0) NFaceElements+=local_NE0*local_NE2;
158 if (local_NE1+e_offset1 == NE1) NFaceElements+=local_NE0*local_NE2;
159 } else {
160 NDOF1=N1-1;
161 }
162
163 /* allocate tables: */
164
165 Finley_NodeFile_allocTable(out->Nodes,local_N0*local_N1*local_N2);
166 Finley_ElementFile_allocTable(out->Elements,local_NE0*local_NE1*local_NE2);
167 Finley_ElementFile_allocTable(out->FaceElements,NFaceElements);
168
169 if (Finley_noError()) {
170 /* create nodes */
171
172 #pragma omp parallel for private(i0,i1,i2,k,global_i0,global_i1,global_i2)
173 for (i2=0;i2<local_N2;i2++) {
174 for (i1=0;i1<local_N1;i1++) {
175 for (i0=0;i0<local_N0;i0++) {
176 k=i0+local_N0*i1+local_N0*local_N1*i2;
177 global_i0=i0+offset0;
178 global_i1=i1+offset1;
179 global_i2=i2+offset2;
180 out->Nodes->Coordinates[INDEX2(0,k,DIM)]=DBLE(global_i0)/DBLE(N0-1)*Length[0];
181 out->Nodes->Coordinates[INDEX2(1,k,DIM)]=DBLE(global_i1)/DBLE(N1-1)*Length[1];
182 out->Nodes->Coordinates[INDEX2(2,k,DIM)]=DBLE(global_i2)/DBLE(N2-1)*Length[2];
183 out->Nodes->Id[k]=Nstride0*global_i0+Nstride1*global_i1+Nstride2*global_i2;
184 out->Nodes->Tag[k]=0;
185 out->Nodes->globalDegreesOfFreedom[k]=Nstride0*(global_i0%NDOF0)
186 +Nstride1*(global_i1%NDOF1)
187 +Nstride2*(global_i2%NDOF2);
188 }
189 }
190 }
191 /* set the elements: */
192 NN=out->Elements->numNodes;
193 #pragma omp parallel for private(i0,i1,i2,k,node0)
194 for (i2=0;i2<local_NE2;i2++) {
195 for (i1=0;i1<local_NE1;i1++) {
196 for (i0=0;i0<local_NE0;i0++) {
197
198 k=i0+local_NE0*i1+local_NE0*local_NE1*i2;
199 node0=Nstride0*N_PER_E*(i0+e_offset0)+Nstride1*N_PER_E*(i1+e_offset1)+Nstride2*N_PER_E*(i2+e_offset2);
200
201 out->Elements->Id[k]=(i0+e_offset0)+NE0*(i1+e_offset1)+NE0*NE1*(i2+e_offset2);
202 out->Elements->Tag[k]=0;
203 out->Elements->Owner[k]=myRank;
204
205 out->Elements->Nodes[INDEX2(0,k,NN)] =node0 ;
206 out->Elements->Nodes[INDEX2(1,k,NN)] =node0+ Nstride0;
207 out->Elements->Nodes[INDEX2(2,k,NN)] =node0+ Nstride1+Nstride0;
208 out->Elements->Nodes[INDEX2(3,k,NN)] =node0+ Nstride1;
209 out->Elements->Nodes[INDEX2(4,k,NN)] =node0+Nstride2 ;
210 out->Elements->Nodes[INDEX2(5,k,NN)] =node0+Nstride2 +Nstride0;
211 out->Elements->Nodes[INDEX2(6,k,NN)] =node0+Nstride2+Nstride1+Nstride0;
212 out->Elements->Nodes[INDEX2(7,k,NN)] =node0+Nstride2+Nstride1 ;
213 }
214 }
215 }
216 /* face elements */
217 NN=out->FaceElements->numNodes;
218 totalNECount=NE0*NE1*NE2;
219 faceNECount=0;
220 /* these are the quadrilateral elements on boundary 1 (x3=0): */
221 if (!periodic[2]) {
222 /* ** elements on boundary 100 (x3=0): */
223 if (offset2==0) {
224 #pragma omp parallel for private(i0,i1,k,node0)
225 for (i1=0;i1<local_NE1;i1++) {
226 for (i0=0;i0<local_NE0;i0++) {
227
228 k=i0+local_NE0*i1+faceNECount;
229 node0=Nstride0*N_PER_E*(i0+e_offset0)+Nstride1*N_PER_E*(i1+e_offset1);
230
231 out->FaceElements->Id[k]=(i0+e_offset0)+NE0*(i1+e_offset1)+totalNECount;
232 out->FaceElements->Tag[k]=100;
233 out->FaceElements->Owner[k]=myRank;
234
235 if (useElementsOnFace) {
236 out->FaceElements->Nodes[INDEX2(0,k,NN)] =node0 ;
237 out->FaceElements->Nodes[INDEX2(1,k,NN)] =node0 +Nstride1 ;
238 out->FaceElements->Nodes[INDEX2(2,k,NN)] =node0 +Nstride1+Nstride0;
239 out->FaceElements->Nodes[INDEX2(3,k,NN)] =node0+ Nstride0 ;
240 out->FaceElements->Nodes[INDEX2(4,k,NN)] =node0+Nstride2 ;
241 out->FaceElements->Nodes[INDEX2(5,k,NN)] =node0+Nstride2+Nstride1 ;
242 out->FaceElements->Nodes[INDEX2(6,k,NN)] =node0+Nstride2+Nstride1+Nstride0;
243 out->FaceElements->Nodes[INDEX2(7,k,NN)] =node0+Nstride2 +Nstride0;
244 } else {
245 out->FaceElements->Nodes[INDEX2(0,k,NN)] =node0 ;
246 out->FaceElements->Nodes[INDEX2(1,k,NN)] =node0+ Nstride1 ;
247 out->FaceElements->Nodes[INDEX2(2,k,NN)] =node0+ Nstride1+Nstride0;
248 out->FaceElements->Nodes[INDEX2(3,k,NN)] =node0+ Nstride0;
249 }
250 }
251 }
252 faceNECount+=local_NE1*local_NE0;
253 }
254 totalNECount+=NE1*NE0;
255 /* ** elements on boundary 200 (x3=1) */
256 if (local_NE2+e_offset2 == NE2) {
257 #pragma omp parallel for private(i0,i1,k,node0)
258 for (i1=0;i1<local_NE1;i1++) {
259 for (i0=0;i0<local_NE0;i0++) {
260
261 k=i0+local_NE0*i1+faceNECount;
262 node0=Nstride0*N_PER_E*(i0+e_offset0)+Nstride1*N_PER_E*(i1+e_offset1)+Nstride2*N_PER_E*(NE2-1);
263
264 out->FaceElements->Id[k]=(i0+e_offset0)+NE0*(i1+e_offset1)+totalNECount;
265 out->FaceElements->Tag[k]=200;
266 out->FaceElements->Owner[k]=myRank;
267 if (useElementsOnFace) {
268 out->FaceElements->Nodes[INDEX2(0,k,NN)] =node0+Nstride2 ;
269 out->FaceElements->Nodes[INDEX2(1,k,NN)] =node0+Nstride2+ Nstride0;
270 out->FaceElements->Nodes[INDEX2(2,k,NN)] =node0+Nstride2+Nstride1+Nstride0;
271 out->FaceElements->Nodes[INDEX2(3,k,NN)] =node0+Nstride2+Nstride1 ;
272
273 out->FaceElements->Nodes[INDEX2(4,k,NN)] =node0 ;
274 out->FaceElements->Nodes[INDEX2(5,k,NN)] =node0+Nstride0 ;
275 out->FaceElements->Nodes[INDEX2(6,k,NN)] =node0+ Nstride1+Nstride0;
276 out->FaceElements->Nodes[INDEX2(7,k,NN)] =node0+ Nstride1;
277 } else {
278 out->FaceElements->Nodes[INDEX2(0,k,NN)] =node0+Nstride2 ;
279 out->FaceElements->Nodes[INDEX2(1,k,NN)] =node0+Nstride2 +Nstride0;
280 out->FaceElements->Nodes[INDEX2(2,k,NN)] =node0+Nstride2+Nstride1+Nstride0;
281 out->FaceElements->Nodes[INDEX2(3,k,NN)] =node0+Nstride2+Nstride1 ;
282 }
283 }
284 }
285 faceNECount+=local_NE1*local_NE0;
286 }
287 totalNECount+=NE1*NE0;
288 }
289 if (!periodic[0]) {
290 /* ** elements on boundary 001 (x1=0): */
291
292 if (e_offset0 == 0) {
293 #pragma omp parallel for private(i1,i2,k,node0)
294 for (i2=0;i2<local_NE2;i2++) {
295 for (i1=0;i1<local_NE1;i1++) {
296
297 k=i1+local_NE1*i2+faceNECount;
298 node0=Nstride1*N_PER_E*(i1+e_offset1)+Nstride2*N_PER_E*(i2+e_offset2);
299 out->FaceElements->Id[k]=(i1+e_offset1)+NE1*(i2+e_offset2)+totalNECount;
300 out->FaceElements->Tag[k]=1;
301 out->FaceElements->Owner[k]=myRank;
302
303 if (useElementsOnFace) {
304 out->FaceElements->Nodes[INDEX2(0,k,NN)] =node0 ;
305 out->FaceElements->Nodes[INDEX2(1,k,NN)] =node0+Nstride2 ;
306 out->FaceElements->Nodes[INDEX2(2,k,NN)] =node0+Nstride2+Nstride1 ;
307 out->FaceElements->Nodes[INDEX2(3,k,NN)] =node0+Nstride1 ;
308 out->FaceElements->Nodes[INDEX2(4,k,NN)] =node0+Nstride0 ;
309 out->FaceElements->Nodes[INDEX2(5,k,NN)] =node0+Nstride2+Nstride0 ;
310 out->FaceElements->Nodes[INDEX2(6,k,NN)] =node0+Nstride2+Nstride1+Nstride0;
311 out->FaceElements->Nodes[INDEX2(7,k,NN)] =node0+Nstride1+Nstride0 ;
312 } else {
313 out->FaceElements->Nodes[INDEX2(0,k,NN)] =node0 ;
314 out->FaceElements->Nodes[INDEX2(1,k,NN)] =node0+Nstride2 ;
315 out->FaceElements->Nodes[INDEX2(2,k,NN)] =node0+Nstride2+Nstride1 ;
316 out->FaceElements->Nodes[INDEX2(3,k,NN)] =node0+ Nstride1 ;
317 }
318 }
319 }
320 }
321 faceNECount+=local_NE1*local_NE2;
322 }
323 totalNECount+=NE1*NE2;
324
325 /* ** elements on boundary 002 (x1=1): */
326 if (local_NE0+e_offset0 == NE0) {
327 #pragma omp parallel for private(i1,i2,k,node0)
328 for (i2=0;i2<local_NE2;i2++) {
329 for (i1=0;i1<local_NE1;i1++) {
330 k=i1+local_NE1*i2+faceNECount;
331 node0=Nstride0*N_PER_E*(NE0-1)+Nstride1*N_PER_E*(i1+e_offset1)+Nstride2*N_PER_E*(i2+e_offset2);
332 out->FaceElements->Id[k]=(i1+e_offset1)+NE1*(i2+e_offset2)+totalNECount;
333 out->FaceElements->Tag[k]=2;
334 out->FaceElements->Owner[k]=myRank;
335
336 if (useElementsOnFace) {
337 out->FaceElements->Nodes[INDEX2(0,k,NN)]=node0+ Nstride0;
338 out->FaceElements->Nodes[INDEX2(1,k,NN)]=node0+ Nstride1+Nstride0;
339 out->FaceElements->Nodes[INDEX2(2,k,NN)]=node0+Nstride2+Nstride1+Nstride0;
340 out->FaceElements->Nodes[INDEX2(3,k,NN)]=node0+Nstride2+ Nstride0;
341
342 out->FaceElements->Nodes[INDEX2(4,k,NN)]=node0 ;
343 out->FaceElements->Nodes[INDEX2(5,k,NN)]=node0+ Nstride1 ;
344 out->FaceElements->Nodes[INDEX2(6,k,NN)]=node0+Nstride2+Nstride1 ;
345 out->FaceElements->Nodes[INDEX2(7,k,NN)]=node0+Nstride2 ;
346
347 } else {
348 out->FaceElements->Nodes[INDEX2(0,k,NN)]=node0 +Nstride0;
349 out->FaceElements->Nodes[INDEX2(1,k,NN)]=node0+ Nstride1+Nstride0;
350 out->FaceElements->Nodes[INDEX2(2,k,NN)]=node0+Nstride2+Nstride1+Nstride0;
351 out->FaceElements->Nodes[INDEX2(3,k,NN)]=node0+Nstride2+ Nstride0;
352 }
353
354 }
355 }
356 faceNECount+=local_NE1*local_NE2;
357 }
358 totalNECount+=NE1*NE2;
359 }
360 if (!periodic[1]) {
361 /* ** elements on boundary 010 (x2=0): */
362 if (e_offset1 == 0) {
363 #pragma omp parallel for private(i0,i2,k,node0)
364 for (i2=0;i2<local_NE2;i2++) {
365 for (i0=0;i0<local_NE0;i0++) {
366 k=i0+local_NE0*i2+faceNECount;
367 node0=Nstride0*N_PER_E*(i0+e_offset0)+Nstride2*N_PER_E*(i2+e_offset2);
368
369 out->FaceElements->Id[k]=(i2+e_offset2)+NE2*(e_offset0+i0)+totalNECount;
370 out->FaceElements->Tag[k]=10;
371 out->FaceElements->Owner[k]=myRank;
372 if (useElementsOnFace) {
373 out->FaceElements->Nodes[INDEX2(0,k,NN)]=node0 ;
374 out->FaceElements->Nodes[INDEX2(1,k,NN)]=node0+ Nstride0;
375 out->FaceElements->Nodes[INDEX2(2,k,NN)]=node0+Nstride2 +Nstride0;
376 out->FaceElements->Nodes[INDEX2(3,k,NN)]=node0+Nstride2 ;
377
378 out->FaceElements->Nodes[INDEX2(4,k,NN)]=node0+ Nstride1 ;
379 out->FaceElements->Nodes[INDEX2(5,k,NN)]=node0+Nstride1+ Nstride0;
380 out->FaceElements->Nodes[INDEX2(6,k,NN)]=node0+Nstride2+Nstride1+Nstride0;
381 out->FaceElements->Nodes[INDEX2(7,k,NN)]=node0+Nstride2+Nstride1 ;
382 } else {
383 out->FaceElements->Nodes[INDEX2(0,k,NN)]=node0 ;
384 out->FaceElements->Nodes[INDEX2(1,k,NN)]=node0+ Nstride0;
385 out->FaceElements->Nodes[INDEX2(2,k,NN)]=node0+Nstride2+ Nstride0;
386 out->FaceElements->Nodes[INDEX2(3,k,NN)]=node0+Nstride2 ;
387 }
388 }
389 }
390 faceNECount+=local_NE0*local_NE2;
391 }
392 totalNECount+=NE0*NE2;
393 /* ** elements on boundary 020 (x2=1): */
394 if (local_NE1+e_offset1 == NE1) {
395 #pragma omp parallel for private(i0,i2,k,node0)
396 for (i2=0;i2<local_NE2;i2++) {
397 for (i0=0;i0<local_NE0;i0++) {
398 k=i0+local_NE0*i2+faceNECount;
399 node0=Nstride0*N_PER_E*(i0+e_offset0)+Nstride1*N_PER_E*(NE1-1)+Nstride2*N_PER_E*(i2+e_offset2);
400
401 out->FaceElements->Id[k]=(i2+e_offset2)+NE2*(i0+e_offset0)+totalNECount;
402 out->FaceElements->Tag[k]=20;
403 out->FaceElements->Owner[k]=myRank;
404
405 if (useElementsOnFace) {
406 out->FaceElements->Nodes[INDEX2(0,k,NN)]=node0+ Nstride1 ;
407 out->FaceElements->Nodes[INDEX2(1,k,NN)]=node0+Nstride2+Nstride1 ;
408 out->FaceElements->Nodes[INDEX2(2,k,NN)]=node0+Nstride2+Nstride1+Nstride0;
409 out->FaceElements->Nodes[INDEX2(3,k,NN)]=node0+Nstride1+Nstride0 ;
410
411 out->FaceElements->Nodes[INDEX2(4,k,NN)]=node0 ;
412 out->FaceElements->Nodes[INDEX2(5,k,NN)]=node0+Nstride2 ;
413 out->FaceElements->Nodes[INDEX2(6,k,NN)]=node0+Nstride2+ Nstride0;
414 out->FaceElements->Nodes[INDEX2(7,k,NN)]=node0+ Nstride0;
415 } else {
416 out->FaceElements->Nodes[INDEX2(0,k,NN)]=node0+ Nstride1 ;
417 out->FaceElements->Nodes[INDEX2(1,k,NN)]=node0+Nstride2+Nstride1 ;
418 out->FaceElements->Nodes[INDEX2(2,k,NN)]=node0+Nstride2+Nstride1+Nstride0;
419 out->FaceElements->Nodes[INDEX2(3,k,NN)]=node0+ Nstride1+Nstride0;
420 }
421 }
422 }
423 faceNECount+=local_NE0*local_NE2;
424 }
425 totalNECount+=NE0*NE2;
426 }
427 /* add tag names */
428 Finley_Mesh_addTagMap(out,"top", 200);
429 Finley_Mesh_addTagMap(out,"bottom", 100);
430 Finley_Mesh_addTagMap(out,"left", 1);
431 Finley_Mesh_addTagMap(out,"right", 2);
432 Finley_Mesh_addTagMap(out,"front", 10);
433 Finley_Mesh_addTagMap(out,"back", 20);
434
435 /* prepare mesh for further calculatuions:*/
436 if (Finley_noError()) {
437 Finley_Mesh_resolveNodeIds(out);
438 }
439 if (Finley_noError()) {
440 Finley_Mesh_prepare(out);
441 }
442 }
443
444 if (!Finley_noError()) {
445 Finley_Mesh_free(out);
446 }
447 /* free up memory */
448 Paso_MPIInfo_free( mpi_info );
449 #ifdef Finley_TRACE
450 printf("timing: mesh generation: %.4e sec\n",Finley_timer()-time0);
451 #endif
452
453 return out;
454 }

Properties

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

  ViewVC Help
Powered by ViewVC 1.1.26