Newer
Older
Vít Hanousek
committed
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
/***************************************************************************
DistributedGridTest.cpp - description
-------------------
begin : Sep 6, 2017
copyright : (C) 2017 by Tomas Oberhuber et al.
email : tomas.oberhuber@fjfi.cvut.cz
***************************************************************************/
#ifdef HAVE_GTEST
#include <gtest/gtest.h>
#ifdef HAVE_MPI
#define USE_MPI
#include <TNL/Meshes/DistributedGrid.h>
#include <TNL/Meshes/DistributedGridSynchronizer.h>
#include <TNL/Functions/MeshFunction.h>
#include <mpi.h>
#include "Functions.h"
using namespace TNL;
using namespace TNL::Containers;
using namespace TNL::Meshes;
using namespace TNL::Functions;
using namespace TNL::Devices;
template<typename DofType>
void setDof_2D(DofType &dof, typename DofType::RealType value)
{
for(int i=0;i<dof.getSize();i++)
dof[i]=value;
}
template<typename DofType,typename GridType>
void checkLeftEdge(GridType &grid, DofType &dof, bool with_first, bool with_last, typename DofType::RealType expectedValue)
{
int maxx=grid.getDimensions().x();
int maxy=grid.getDimensions().y();
int begin=0;
int end=maxy;
if(!with_first)
begin++;
if(!with_last)
end--;
for(int i=begin;i<end;i++) //posledni je overlap
EXPECT_EQ( dof[maxx*i], expectedValue) << "Left Edge test failed " << i<<" " << maxx << " "<< maxy;
}
template<typename DofType,typename GridType>
void checkRightEdge(GridType &grid, DofType &dof, bool with_first, bool with_last, typename DofType::RealType expectedValue)
{
int maxx=grid.getDimensions().x();
int maxy=grid.getDimensions().y();
int begin=0;
int end=maxy;
if(!with_first)
begin++;
if(!with_last)
end--;
for(int i=begin;i<end;i++)
EXPECT_EQ( dof[maxx*i+(maxx-1)], expectedValue) << "Right Edge test failed " << i <<" " << maxx << " "<< maxy;
}
template<typename DofType,typename GridType>
void checkUpEdge(GridType &grid, DofType &dof, bool with_first, bool with_last, typename DofType::RealType expectedValue)
{
int maxx=grid.getDimensions().x();
int maxy=grid.getDimensions().y();
int begin=0;
int end=maxx;
if(!with_first)
begin++;
if(!with_last)
end--;
for(int i=begin;i<end;i++) //posledni je overlap
EXPECT_EQ( dof[i], expectedValue) << "Up Edge test failed " << i<<" " << maxx << " "<< maxy;
}
template<typename DofType,typename GridType>
void checkDownEdge(GridType &grid, DofType &dof, bool with_first, bool with_last, typename DofType::RealType expectedValue)
{
int maxx=grid.getDimensions().x();
int maxy=grid.getDimensions().y();
int begin=0;
int end=maxx;
if(!with_first)
begin++;
if(!with_last)
end--;
for(int i=begin;i<end;i++) //posledni je overlap
EXPECT_EQ( dof[maxx*(maxy-1)+i], expectedValue) << "Down Edge test failed " << i<<" " << maxx << " "<< maxy;
}
template<typename DofType,typename GridType>
void checkConner(GridType &grid, DofType &dof, bool up, bool left, typename DofType::RealType expectedValue )
{
int maxx=grid.getDimensions().x();
int maxy=grid.getDimensions().y();
if(up&&left)
{
EXPECT_EQ( dof[0], expectedValue) << "Up Left Conner test failed ";
}
if(up && !left)
{
EXPECT_EQ( dof[maxx-1], expectedValue) << "Up Right Conner test failed ";
}
if(!up && left)
{
EXPECT_EQ( dof[(maxy-1)*maxx], expectedValue) << "Down Left Conner test failed ";
}
if(!up && !left)
{
EXPECT_EQ( dof[(maxy-1)*maxx+maxx-1], expectedValue) << "Down right Conner test failed ";
}
}
/*expect 9 process*/
template<typename DofType,typename GridType>
void check_Boundary_2D(int rank, GridType &grid, DofType &dof, typename DofType::RealType expectedValue)
{
if(rank==0)//Up Left
{
checkUpEdge(grid,dof,true,false,expectedValue);//posledni je overlap
checkLeftEdge(grid,dof,true,false, expectedValue);//posledni je overlap
}
if(rank==1)//Up Center
{
checkUpEdge(grid,dof,false,false, expectedValue);//prvni a posledni je overlap
}
if(rank==2)//Up Right
{
checkUpEdge(grid,dof,false,true,expectedValue);//prvni je overlap
checkRightEdge(grid,dof,true,false,expectedValue);//posledni je overlap
}
if(rank==3)//Center Left
{
checkLeftEdge(grid,dof,false,false,expectedValue);//prvni a posledni je overlap
}
if(rank==4)//Center Center
{
//No boundary
}
if(rank==5)//Center Right
{
checkRightEdge(grid,dof,false,false,expectedValue);
}
if(rank==6)//Down Left
{
checkDownEdge(grid,dof,true,false,expectedValue);
checkLeftEdge(grid,dof,false,true,expectedValue);
}
if(rank==7) //Down Center
{
checkDownEdge(grid,dof,false,false,expectedValue);
}
if(rank==8) //Down Right
{
checkDownEdge(grid,dof,false,true,expectedValue);
checkRightEdge(grid,dof,false,true,expectedValue);
}
};
/*expect 9 process
* Known BUG of Traversars: Process boundary is writing over overlap.
* it should be true, true, every where, but we dont chcek boundary overalp on boundary
* so boundary overlap is not checked (it is filled incorectly by boundary condition).
Vít Hanousek
committed
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
*/
template<typename DofType,typename GridType>
void check_Overlap_2D(int rank, GridType &grid, DofType &dof, typename DofType::RealType expectedValue)
{
if(rank==0)//Up Left
{
checkRightEdge(grid,dof,false,true,expectedValue);
checkDownEdge(grid,dof,false,true,expectedValue);
}
if(rank==1)//Up Center
{
checkDownEdge(grid,dof,true,true,expectedValue);
checkLeftEdge(grid,dof,false,true,expectedValue);
checkRightEdge(grid,dof,false,true,expectedValue);
}
if(rank==2)//Up Right
{
checkDownEdge(grid,dof,true,false,expectedValue);//prvni je overlap
checkLeftEdge(grid,dof,false,true,expectedValue);
}
if(rank==3)//Center Left
{
checkUpEdge(grid,dof,false,true,expectedValue);
checkDownEdge(grid,dof,false,true,expectedValue);
checkRightEdge(grid,dof,true,true,expectedValue);
}
if(rank==4)//Center Center
{
checkUpEdge(grid,dof,true,true,expectedValue);
checkDownEdge(grid,dof,true,true,expectedValue);
checkRightEdge(grid,dof,true,true,expectedValue);
checkLeftEdge(grid,dof,true,true,expectedValue);
}
if(rank==5)//Center Right
{
checkUpEdge(grid,dof,true,false,expectedValue);
checkDownEdge(grid,dof,true,false,expectedValue);
checkLeftEdge(grid,dof,true,true,expectedValue);
}
if(rank==6)//Down Left
{
checkUpEdge(grid,dof,false,true,expectedValue);
checkRightEdge(grid,dof,true,false,expectedValue);
}
if(rank==7) //Down Center
{
checkUpEdge(grid,dof,true,true,expectedValue);
checkLeftEdge(grid,dof,true,false,expectedValue);
checkRightEdge(grid,dof,true,false,expectedValue);
}
if(rank==8) //Down Right
{
checkUpEdge(grid,dof,true,false,expectedValue);
checkLeftEdge(grid,dof,true,false,expectedValue);
}
}
/*Expect 9 process
*/
template<typename DofType,typename GridType>
void checkNeighbor_2D(int rank, GridType &grid, DofType &dof)
{
if(rank==0)//Up Left
{
checkRightEdge(grid,dof,true,false,1);
checkDownEdge(grid,dof,true,false,3);
checkConner(grid,dof,false,false,4);
}
if(rank==1)//Up Center
{
checkLeftEdge(grid,dof,true,false,0);
checkRightEdge(grid,dof,true,false,2);
checkConner(grid,dof,false,true,3);
checkDownEdge(grid,dof,false,false,4);
checkConner(grid,dof,false,false,5);
}
if(rank==2)//Up Right
{
checkLeftEdge(grid,dof,true,false,1);
checkConner(grid,dof,false,true,4);
checkDownEdge(grid,dof,false,true,5);
}
if(rank==3)//Center Left
{
checkUpEdge(grid,dof,true,false,0);
checkConner(grid,dof,true,false,1);
checkRightEdge(grid,dof,false,false,4);
checkDownEdge(grid,dof,true,false,6);
checkConner(grid,dof,false,false,7);
}
if(rank==4)//Center Center
{
checkConner(grid,dof,true,true,0);
checkUpEdge(grid,dof,false,false,1);
checkConner(grid,dof,true,false,2);
checkLeftEdge(grid,dof,false,false,3);
checkRightEdge(grid,dof,false,false,5);
checkConner(grid,dof,false,true,6);
checkDownEdge(grid,dof,false,false,7);
checkConner(grid,dof,false,false,8);
}
if(rank==5)//Center Right
{
checkConner(grid,dof,true,true,1);
checkUpEdge(grid,dof,false,true,2);
checkLeftEdge(grid,dof,false,false,4);
checkConner(grid,dof,false,true,7);
checkDownEdge(grid,dof,false,true,8);
}
if(rank==6)//Down Left
{
checkUpEdge(grid,dof,true,false,3);
checkConner(grid,dof,true,false,4);
checkRightEdge(grid,dof,false,true,7);
}
if(rank==7) //Down Center
{
checkConner(grid,dof,true,true,3);
checkUpEdge(grid,dof,false,false,4);
checkConner(grid,dof,true,false,5);
checkLeftEdge(grid,dof,false,true,6);
checkRightEdge(grid,dof,false,true,8);
}
if(rank==8) //Down Right
{
checkConner(grid,dof,true,true,4);
checkUpEdge(grid,dof,false,true,5);
checkLeftEdge(grid,dof,false,true,7);
}
}
template<typename DofType,typename GridType>
void check_Inner_2D(int rank, GridType grid, DofType dof, typename DofType::RealType expectedValue)
{
int maxx=grid.getDimensions().x();
int maxy=grid.getDimensions().y();
for(int j=1;j<maxy-1;j++)//prvni a posledni jsou buď hranice, nebo overlap
for(int i=1;i<maxx-1;i++) //buď je vlevo hranice, nebo overlap
EXPECT_EQ( dof[j*maxx+i], expectedValue) << " "<< j<<" "<<i << " " << maxx << " " << maxy;
}
Vít Hanousek
committed
/*
* Light check of 2D distributed grid and its synchronization.
* expected 9 processors
*/
typedef Grid<2,double,Host,int> MeshType;
typedef MeshFunction<MeshType> MeshFunctionType;
typedef Vector<double,Host,int> DofType;
typedef typename MeshType::Cell Cell;
typedef typename MeshType::IndexType IndexType;
typedef typename MeshType::PointType PointType;
Vít Hanousek
committed
typedef DistributedGrid<MeshType> DistributedGridType;
Vít Hanousek
committed
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
class DistributedGirdTest_2D : public ::testing::Test {
protected:
static DistributedGrid<MeshType> *distrgrid;
static DistributedGridSynchronizer<DistributedGrid<MeshType>,MeshFunctionType,2> *synchronizer;
static DofType *dof;
static SharedPointer<MeshType> gridptr;
static SharedPointer<MeshFunctionType> meshFunctionptr;
static MeshFunctionEvaluator< MeshFunctionType, ConstFunction<double,2> > constFunctionEvaluator;
static SharedPointer< ConstFunction<double,2>, Host > constFunctionPtr;
static MeshFunctionEvaluator< MeshFunctionType, LinearFunction<double,2> > linearFunctionEvaluator;
static SharedPointer< LinearFunction<double,2>, Host > linearFunctionPtr;
static int rank;
static int nproc;
// Per-test-case set-up.
// Called before the first test in this test case.
// Can be omitted if not needed.
static void SetUpTestCase() {
int size=10;
rank=MPI::COMM_WORLD.Get_rank();
nproc=MPI::COMM_WORLD.Get_size();
PointType globalOrigin;
PointType globalProportions;
MeshType globalGrid;
globalOrigin.x()=-0.5;
globalOrigin.y()=-0.5;
globalProportions.x()=size;
globalProportions.y()=size;
globalGrid.setDimensions(size,size);
globalGrid.setDomain(globalOrigin,globalProportions);
Vít Hanousek
committed
typename DistributedGridType::CoordinatesType overlap;
overlap.setValue(1);
distrgrid=new DistributedGrid<MeshType> (globalGrid,overlap);
Vít Hanousek
committed
distrgrid->SetupGrid(*gridptr);
dof=new DofType(gridptr->template getEntitiesCount< Cell >());
meshFunctionptr->bind(gridptr,*dof);
Vít Hanousek
committed
synchronizer=new DistributedGridSynchronizer<DistributedGrid<MeshType>,MeshFunctionType,2>(distrgrid);
Vít Hanousek
committed
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
constFunctionPtr->Number=rank;
}
// Per-test-case tear-down.
// Called after the last test in this test case.
// Can be omitted if not needed.
static void TearDownTestCase() {
delete dof;
delete synchronizer;
delete distrgrid;
}
};
DistributedGrid<MeshType> *DistributedGirdTest_2D::distrgrid=NULL;
DistributedGridSynchronizer<DistributedGrid<MeshType>,MeshFunctionType,2> *DistributedGirdTest_2D::synchronizer=NULL;
DofType *DistributedGirdTest_2D::dof=NULL;
SharedPointer<MeshType> DistributedGirdTest_2D::gridptr;
SharedPointer<MeshFunctionType> DistributedGirdTest_2D::meshFunctionptr;
MeshFunctionEvaluator< MeshFunctionType, ConstFunction<double,2> > DistributedGirdTest_2D::constFunctionEvaluator;
SharedPointer< ConstFunction<double,2>, Host > DistributedGirdTest_2D::constFunctionPtr;
MeshFunctionEvaluator< MeshFunctionType, LinearFunction<double,2> > DistributedGirdTest_2D::linearFunctionEvaluator;
SharedPointer< LinearFunction<double,2>, Host > DistributedGirdTest_2D::linearFunctionPtr;
int DistributedGirdTest_2D::rank;
int DistributedGirdTest_2D::nproc;
TEST_F(DistributedGirdTest_2D, evaluateAllEntities)
{
//Check Traversars
//All entities, witout overlap
setDof_2D(*dof,-1);
constFunctionEvaluator.evaluateAllEntities( meshFunctionptr , constFunctionPtr );
//Printer<MeshType,DofType>::print_dof(rank,*gridptr,*dof);
Vít Hanousek
committed
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
check_Boundary_2D(rank, *gridptr, *dof, rank);
check_Overlap_2D(rank, *gridptr, *dof, -1);
check_Inner_2D(rank, *gridptr, *dof, rank);
}
TEST_F(DistributedGirdTest_2D, evaluateBoundaryEntities)
{
//Boundary entities, witout overlap
setDof_2D(*dof,-1);
constFunctionEvaluator.evaluateBoundaryEntities( meshFunctionptr , constFunctionPtr );
//print_dof_2D(rank,*gridptr,dof);
check_Boundary_2D(rank, *gridptr, *dof, rank);
check_Overlap_2D(rank, *gridptr, *dof, -1);
check_Inner_2D(rank, *gridptr, *dof, -1);
}
TEST_F(DistributedGirdTest_2D, evaluateInteriorEntities)
{
//Inner entities, witout overlap
setDof_2D(*dof,-1);
constFunctionEvaluator.evaluateInteriorEntities( meshFunctionptr , constFunctionPtr );
check_Boundary_2D(rank, *gridptr, *dof, -1);
check_Overlap_2D(rank, *gridptr, *dof, -1);
check_Inner_2D(rank, *gridptr, *dof, rank);
}
TEST_F(DistributedGirdTest_2D, LinearFunctionTest)
{
//fill meshfunction with linear function (physical center of cell corresponds with its coordinates in grid)
setDof_2D(*dof,-1);
linearFunctionEvaluator.evaluateAllEntities(meshFunctionptr, linearFunctionPtr);
Vít Hanousek
committed
synchronizer->Synchronize(*meshFunctionptr);
Vít Hanousek
committed
int count =gridptr->template getEntitiesCount< Cell >();
for(int i=0;i<count;i++)
{
auto entity= gridptr->template getEntity< Cell >(i);
entity.refresh();
EXPECT_EQ(meshFunctionptr->getValue(entity), (*linearFunctionPtr)(entity)) << "Linear function doesnt fit recievd data. " << entity.getCoordinates().x() << " "<<entity.getCoordinates().y() << " "<< gridptr->getDimensions().x() <<" "<<gridptr->getDimensions().y();
}
}
TEST_F(DistributedGirdTest_2D, SynchronizerNeighborTest)
{
setDof_2D(*dof,-1);
constFunctionEvaluator.evaluateAllEntities( meshFunctionptr , constFunctionPtr );
Vít Hanousek
committed
synchronizer->Synchronize(*meshFunctionptr);
Vít Hanousek
committed
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
checkNeighbor_2D(rank, *gridptr, *dof);
}
#else
TEST(NoMPI, NoTest)
{
ASSERT_TRUE(true) << ":-(";
}
#endif
#endif
#if (defined(HAVE_GTEST) && defined(HAVE_MPI))
#include <sstream>
class MinimalistBuffredPrinter : public ::testing::EmptyTestEventListener {
private:
std::stringstream sout;
public:
// Called before a test starts.
virtual void OnTestStart(const ::testing::TestInfo& test_info) {
sout<< test_info.test_case_name() <<"." << test_info.name() << " Start." <<std::endl;
}
// Called after a failed assertion or a SUCCEED() invocation.
virtual void OnTestPartResult(
const ::testing::TestPartResult& test_part_result) {
sout << (test_part_result.failed() ? "====Failure=== " : "===Success=== ")
<< test_part_result.file_name() << " "
<< test_part_result.line_number() <<std::endl
<< test_part_result.summary() <<std::endl;
}
// Called after a test ends.
virtual void OnTestEnd(const ::testing::TestInfo& test_info)
{
int rank=MPI::COMM_WORLD.Get_rank();
sout<< test_info.test_case_name() <<"." << test_info.name() << " End." <<std::endl;
std::cout << rank << ":" << std::endl << sout.str()<< std::endl;
sout.str( std::string() );
sout.clear();
}
};
#endif
#include "../../src/UnitTests/GtestMissingError.h"
int main( int argc, char* argv[] )
{
#ifdef HAVE_GTEST
::testing::InitGoogleTest( &argc, argv );
#ifdef HAVE_MPI
::testing::TestEventListeners& listeners =
::testing::UnitTest::GetInstance()->listeners();
delete listeners.Release(listeners.default_result_printer());
listeners.Append(new MinimalistBuffredPrinter);
MPI::Init(argc,argv);
#endif
int result= RUN_ALL_TESTS();
#ifdef HAVE_MPI
MPI::Finalize();
#endif
return result;
#else
throw GtestMissingError();
#endif
}