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
|
/*
//@HEADER
// ***********************************************************************
//
// Ifpack2: Templated Object-Oriented Algebraic Preconditioner Package
// Copyright (2009) Sandia Corporation
//
// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
// license for use of this work by or on behalf of the U.S. Government.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither the name of the Corporation nor the names of the
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ***********************************************************************
//@HEADER
*/
/*! \file Ifpack2_UnitTestOverlapGraph.cpp
\brief Ifpack2 Unit Test for OverlapGraph class.
*/
#include <Teuchos_ConfigDefs.hpp>
#include <Ifpack2_ConfigDefs.hpp>
#include <Teuchos_UnitTestHarness.hpp>
#include <iostream>
#include <Ifpack2_UnitTestHelpers.hpp>
#include <Ifpack2_OverlapGraph.hpp>
namespace {
using Teuchos::Comm;
using Teuchos::outArg;
using Teuchos::RCP;
using Teuchos::rcp;
using Teuchos::reduceAll;
using Teuchos::REDUCE_MIN;
using std::endl;
typedef tif_utest::Node Node;
// Macro used inside the unit test below. It tests for global error,
// and if so, prints each process' error message and quits the test
// early.
//
// 'out' only prints on Process 0. It's really not OK for other
// processes to print to stdout, but it usually works and we need to
// do it for debugging.
#define IFPACK2OVERLAPGRAPH_REPORT_GLOBAL_ERR( WHAT_STRING ) do { \
reduceAll<int, int> (*comm, REDUCE_MIN, lclSuccess, outArg (gblSuccess)); \
TEST_EQUALITY_CONST( gblSuccess, 1 ); \
if (gblSuccess != 1) { \
out << WHAT_STRING << " FAILED on one or more processes!" << endl; \
for (int p = 0; p < numProcs; ++p) { \
if (myRank == p && lclSuccess != 1) { \
std::cout << errStrm.str () << std::flush; \
} \
comm->barrier (); \
comm->barrier (); \
comm->barrier (); \
} \
return; \
} \
} while (false)
//this macro declares the unit-test-class:
TEUCHOS_UNIT_TEST_TEMPLATE_2_DECL(Ifpack2OverlapGraph, OverlapGraphTest0, LO, GO)
{
typedef Tpetra::CrsGraph<LO,GO,Node> crs_graph_type;
typedef Ifpack2::OverlapGraph<LO,GO,Node> overlap_graph_type;
int lclSuccess = 1;
int gblSuccess = 1;
std::ostringstream errStrm; // for error collection
out << "Ifpack2::OverlapGraph unit test" << endl;
RCP<const Comm<int> > comm = tif_utest::getDefaultComm ();
const int myRank = comm->getRank ();
const int numProcs = comm->getSize ();
// Create a test graph.
const size_t num_rows_per_proc = 5;
RCP<const crs_graph_type> crsgraph;
try {
crsgraph = tif_utest::create_tridiag_graph<LO,GO,Node> (num_rows_per_proc);
} catch (std::exception& e) {
lclSuccess = 0;
errStrm << "create_tridiag_graph threw exception: " << e.what () << endl;
}
IFPACK2OVERLAPGRAPH_REPORT_GLOBAL_ERR( "Tpetra::CrsGraph creation" );
TEST_EQUALITY( crsgraph->getMap()->getNodeNumElements(), num_rows_per_proc )
const LO overlap_levels = 2;
RCP<overlap_graph_type> overlapgraph;
try {
overlapgraph = rcp (new overlap_graph_type (crsgraph, overlap_levels));
} catch (std::exception& e) {
lclSuccess = 0;
errStrm << "Ifpack2::OverlapGraph constructor threw exception: "
<< e.what () << endl;
}
IFPACK2OVERLAPGRAPH_REPORT_GLOBAL_ERR( "Ifpack2::OverlapGraph constructor" );
// Now test how many local rows there are in the overlapped-graph.
// For a tri-diagonal input-graph with 5 local rows on each proc:
// 'end' procs (procs 0 and numProcs-1) should have an extra row in the
// overlapped graph for each level of overlap. Other procs should
// have an extra 2 rows for each level of overlap.
// Special case: if numProcs==1 then overlapgraph should have the same
// number of rows as the input-graph.
// NOTE: The Teuchos unit test macros actually only work on Process
// 0 in MPI_COMM_WORLD. This is because they work by printing a
// failure message to 'out', but 'out' is set up only to print on
// Process 0.
if (numProcs == 1) {
// This works fine, because Process 0 is doing the check in this case.
TEST_EQUALITY(overlapgraph->getOverlapGraph().getMap()->getNodeNumElements(), num_rows_per_proc)
}
else { // numProcs > 1
const size_t actualOverlap =
overlapgraph->getOverlapGraph ().getMap ()->getNodeNumElements ();
size_t expectedOverlap = 0;
if (myRank == 0 || myRank == numProcs - 1) {
expectedOverlap = num_rows_per_proc + overlap_levels;
} else {
expectedOverlap = num_rows_per_proc + overlap_levels * 2;
}
lclSuccess = (actualOverlap == expectedOverlap) ? 1 : 0;
if (lclSuccess != 1) {
errStrm << "Process " << myRank << ": Actual overlap " << actualOverlap
<< " != expected overlap " << expectedOverlap << "." << endl;
}
IFPACK2OVERLAPGRAPH_REPORT_GLOBAL_ERR( "Overlap is wrong on at least one process." );
}
}
#define UNIT_TEST_GROUP_LO_GO( LO, GO ) \
TEUCHOS_UNIT_TEST_TEMPLATE_2_INSTANT( Ifpack2OverlapGraph, OverlapGraphTest0, LO, GO )
#include "Ifpack2_ETIHelperMacros.h"
IFPACK2_ETI_MANGLING_TYPEDEFS()
IFPACK2_INSTANTIATE_LG( UNIT_TEST_GROUP_LO_GO )
} // namespace (anonymous)
|
