|
20 | 20 | #include <gtest/gtest.h> |
21 | 21 | #include <mpi.h> |
22 | 22 |
|
23 | | - |
24 | 23 | using namespace lpf::mpi; |
25 | 24 |
|
26 | | -extern "C" const int LPF_MPI_AUTO_INITIALIZE=0; |
27 | | - |
| 25 | +extern "C" const int LPF_MPI_AUTO_INITIALIZE = 0; |
28 | 26 |
|
29 | | -/** |
| 27 | +/** |
30 | 28 | * \pre P >= 1 |
31 | 29 | * \pre P <= 2 |
32 | 30 | */ |
33 | 31 | class DenseAll2AllTests : public testing::Test { |
34 | 32 |
|
35 | | - protected: |
36 | | - |
37 | | - static void SetUpTestSuite() { |
38 | | - |
39 | | - MPI_Init(NULL, NULL); |
40 | | - Lib::instance(); |
| 33 | +protected: |
| 34 | + static void SetUpTestSuite() { |
41 | 35 |
|
42 | | - MPI_Comm_rank( MPI_COMM_WORLD, &my_pid ); |
43 | | - MPI_Comm_size( MPI_COMM_WORLD, &nprocs ); |
| 36 | + MPI_Init(NULL, NULL); |
| 37 | + Lib::instance(); |
44 | 38 |
|
45 | | - } |
| 39 | + MPI_Comm_rank(MPI_COMM_WORLD, &my_pid); |
| 40 | + MPI_Comm_size(MPI_COMM_WORLD, &nprocs); |
| 41 | + } |
46 | 42 |
|
47 | | - static void TearDownTestSuite() { |
48 | | - MPI_Finalize(); |
49 | | - } |
| 43 | + static void TearDownTestSuite() { MPI_Finalize(); } |
50 | 44 |
|
51 | | - static int my_pid; |
52 | | - static int nprocs; |
| 45 | + static int my_pid; |
| 46 | + static int nprocs; |
53 | 47 | }; |
54 | 48 |
|
55 | 49 | int DenseAll2AllTests::my_pid = -1; |
56 | 50 | int DenseAll2AllTests::nprocs = -1; |
57 | 51 |
|
58 | | -TEST_F( DenseAll2AllTests, Create ) |
59 | | -{ |
60 | | - DenseAllToAll x(9, 10); |
61 | | -} |
| 52 | +TEST_F(DenseAll2AllTests, Create) { DenseAllToAll x(9, 10); } |
62 | 53 |
|
63 | | -TEST_F( DenseAll2AllTests, Reserve ) |
64 | | -{ |
65 | | - DenseAllToAll x( 4,10); |
66 | | - x.reserve( 50 , 100); |
| 54 | +TEST_F(DenseAll2AllTests, Reserve) { |
| 55 | + DenseAllToAll x(4, 10); |
| 56 | + x.reserve(50, 100); |
67 | 57 | } |
68 | 58 |
|
69 | | -TEST_F( DenseAll2AllTests, Send ) |
70 | | -{ |
| 59 | +TEST_F(DenseAll2AllTests, Send) { |
71 | 60 |
|
72 | | - DenseAllToAll x( my_pid, nprocs ); |
73 | | - x.reserve( nprocs , sizeof(int)); |
74 | | - for (int i = 0; i <= my_pid ; ++i) |
75 | | - x.send( (my_pid + 1) % nprocs, &i, sizeof(int) ); |
| 61 | + DenseAllToAll x(my_pid, nprocs); |
| 62 | + x.reserve(nprocs, sizeof(int)); |
| 63 | + for (int i = 0; i <= my_pid; ++i) |
| 64 | + x.send((my_pid + 1) % nprocs, &i, sizeof(int)); |
76 | 65 |
|
77 | | - bool prerandomize = true; |
78 | | - int error = x.exchange( Lib::instance().world(), prerandomize, NULL); |
79 | | - EXPECT_TRUE( !error ); |
| 66 | + bool prerandomize = true; |
| 67 | + int error = x.exchange(Lib::instance().world(), prerandomize, NULL); |
| 68 | + EXPECT_TRUE(!error); |
80 | 69 | } |
81 | 70 |
|
82 | | -TEST_F( DenseAll2AllTests, Ring ) |
83 | | -{ |
84 | | - DenseAllToAll x(my_pid, nprocs); |
85 | | - x.reserve( nprocs , sizeof(int)); |
86 | | - x.send( (my_pid + 1) % nprocs, &my_pid, sizeof(my_pid) ); |
| 71 | +TEST_F(DenseAll2AllTests, Ring) { |
| 72 | + DenseAllToAll x(my_pid, nprocs); |
| 73 | + x.reserve(nprocs, sizeof(int)); |
| 74 | + x.send((my_pid + 1) % nprocs, &my_pid, sizeof(my_pid)); |
87 | 75 |
|
88 | | - EXPECT_FALSE( x.empty() ); |
| 76 | + EXPECT_FALSE(x.empty()); |
89 | 77 |
|
90 | | - bool prerandomize = true; |
91 | | - int error = x.exchange( Lib::instance().world(), prerandomize, NULL); |
92 | | - EXPECT_TRUE( !error ); |
| 78 | + bool prerandomize = true; |
| 79 | + int error = x.exchange(Lib::instance().world(), prerandomize, NULL); |
| 80 | + EXPECT_TRUE(!error); |
93 | 81 |
|
94 | | - EXPECT_FALSE( x.empty() ); |
95 | | - |
96 | | - int y = -1; |
97 | | - x.recv( &y, sizeof(y)); |
98 | | - EXPECT_EQ( (my_pid + nprocs -1) % nprocs, y ); |
| 82 | + EXPECT_FALSE(x.empty()); |
99 | 83 |
|
100 | | - EXPECT_TRUE( x.empty() ); |
| 84 | + int y = -1; |
| 85 | + x.recv(&y, sizeof(y)); |
| 86 | + EXPECT_EQ((my_pid + nprocs - 1) % nprocs, y); |
101 | 87 |
|
| 88 | + EXPECT_TRUE(x.empty()); |
102 | 89 | } |
103 | 90 |
|
| 91 | +TEST_F(DenseAll2AllTests, ManyMsgs) { |
| 92 | + DenseAllToAll x(my_pid, nprocs); |
| 93 | + const int nMsgs = 10000; |
| 94 | + x.reserve(nMsgs, sizeof(int)); |
| 95 | + |
| 96 | + for (int j = 0; j < 10; ++j) { |
| 97 | + x.clear(); |
104 | 98 |
|
105 | | -TEST_F( DenseAll2AllTests, ManyMsgs ) |
106 | | -{ |
107 | | - DenseAllToAll x(my_pid, nprocs ); |
108 | | - const int nMsgs = 10000; |
109 | | - x.reserve( nMsgs , sizeof(int)); |
110 | | - |
111 | | - for (int j = 0; j < 10 ; ++j) { |
112 | | - x.clear(); |
113 | | - |
114 | | - for (int i = 0; i < nMsgs; ++i) |
115 | | - { |
116 | | - x.send( (my_pid + i) % nprocs, & i, sizeof(i) ); |
117 | | - } |
118 | | - |
119 | | - bool prerandomize = true; |
120 | | - int trials = 5; |
121 | | - int error = x.exchange( Lib::instance().world(), prerandomize, |
122 | | - NULL, trials); |
123 | | - EXPECT_FALSE( error ); |
124 | | - |
125 | | - for (int i = 0; i < nMsgs; ++i) |
126 | | - { |
127 | | - EXPECT_FALSE( x.empty() ); |
128 | | - int k = -1; |
129 | | - x.recv( &k, sizeof(k)); |
130 | | - EXPECT_GE( k, 0 ); |
131 | | - EXPECT_LT( k, nMsgs ); |
132 | | - } |
133 | | - EXPECT_TRUE( x.empty() ); |
| 99 | + for (int i = 0; i < nMsgs; ++i) { |
| 100 | + x.send((my_pid + i) % nprocs, &i, sizeof(i)); |
134 | 101 | } |
135 | | -} |
136 | 102 |
|
137 | | -TEST_F( DenseAll2AllTests, LargeSend ) |
138 | | -{ |
139 | | - DenseAllToAll x( my_pid, nprocs ); |
| 103 | + bool prerandomize = true; |
| 104 | + int trials = 5; |
| 105 | + int error = x.exchange(Lib::instance().world(), prerandomize, NULL, trials); |
| 106 | + EXPECT_FALSE(error); |
| 107 | + |
| 108 | + for (int i = 0; i < nMsgs; ++i) { |
| 109 | + EXPECT_FALSE(x.empty()); |
| 110 | + int k = -1; |
| 111 | + x.recv(&k, sizeof(k)); |
| 112 | + EXPECT_GE(k, 0); |
| 113 | + EXPECT_LT(k, nMsgs); |
| 114 | + } |
| 115 | + EXPECT_TRUE(x.empty()); |
| 116 | + } |
| 117 | +} |
140 | 118 |
|
141 | | - size_t bigNum = size_t(std::numeric_limits<int>::max()) + 10u ; |
| 119 | +TEST_F(DenseAll2AllTests, LargeSend) { |
| 120 | + DenseAllToAll x(my_pid, nprocs); |
142 | 121 |
|
143 | | - EXPECT_THROW( x.reserve( 1 , bigNum ), std::bad_alloc ); |
| 122 | + size_t bigNum = size_t(std::numeric_limits<int>::max()) + 10u; |
144 | 123 |
|
| 124 | + EXPECT_THROW(x.reserve(1, bigNum), std::bad_alloc); |
145 | 125 | } |
146 | | - |
147 | | - |
0 commit comments