/usr/include/trilinos/MueLu_PerfUtils_def.hpp is in libtrilinos-muelu-dev 12.12.1-5.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 184 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 | // @HEADER
//
// ***********************************************************************
//
// MueLu: A package for multigrid based preconditioning
// Copyright 2012 Sandia Corporation
//
// Under the terms of Contract DE-AC04-94AL85000 with Sandia Corporation,
// the U.S. Government retains certain rights in this software.
//
// 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 NodeT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DIScalarLAIMED. IN Node EVENT SHALL SANDIA CORPORATION OR THE
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NodeT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GlobalOrdinalODS 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
// Jonathan Hu (jhu@sandia.gov)
// Andrey Prokopenko (aprokop@sandia.gov)
// Ray Tuminaro (rstumin@sandia.gov)
//
// ***********************************************************************
//
// @HEADER
#ifndef MUELU_PERFUTILS_DEF_HPP
#define MUELU_PERFUTILS_DEF_HPP
#include <algorithm>
#include <string>
#ifdef HAVE_MPI
#include <Teuchos_CommHelpers.hpp>
#endif
#include <Xpetra_Export.hpp>
#include <Xpetra_Import.hpp>
#include <Xpetra_Matrix.hpp>
#include "MueLu_PerfUtils_decl.hpp"
//#include "MueLu_Utilities.hpp"
namespace MueLu {
template<class Type>
void calculateStats(Type& minVal, Type& maxVal, double& avgVal, double& devVal, const RCP<const Teuchos::Comm<int> >& comm, int numActiveProcs, const Type& v) {
Type sumVal, sum2Val;
MueLu_sumAll(comm, v, sumVal);
MueLu_sumAll(comm, v*v, sum2Val);
MueLu_minAll(comm, v, minVal);
MueLu_maxAll(comm, v, maxVal);
avgVal = (numActiveProcs > 0 ? as<double>(sumVal) / numActiveProcs : 0);
devVal = (numActiveProcs > 1 ? sqrt((sum2Val - sumVal*avgVal)/(numActiveProcs-1)) : 0);
}
template<class Type>
std::string stringStats(const RCP<const Teuchos::Comm<int> >& comm, int numActiveProcs, const Type& v, RCP<ParameterList> paramList = Teuchos::null) {
Type minVal, maxVal;
double avgVal, devVal;
calculateStats<Type>(minVal, maxVal, avgVal, devVal, comm, numActiveProcs, v);
char buf[256];
if (avgVal && (paramList.is_null() || !paramList->isParameter("print abs") || paramList->get<bool>("print abs") == false))
sprintf(buf, "avg = %.2e, dev = %5.1f%%, min = %+6.1f%%, max = %+6.1f%%", avgVal,
(devVal/avgVal)*100, (minVal/avgVal-1)*100, (maxVal/avgVal-1)*100);
else
sprintf(buf, "avg = %8.2f, dev = %6.2f, min = %6.1f , max = %6.1f", avgVal,
devVal, as<double>(minVal), as<double>(maxVal));
return buf;
}
template<class Map>
bool cmp_less(typename Map::value_type& v1, typename Map::value_type& v2) {
return v1.second < v2.second;
}
template <class Scalar, class LocalOrdinal, class GlobalOrdinal, class Node>
std::string PerfUtils<Scalar, LocalOrdinal, GlobalOrdinal, Node>::PrintMatrixInfo(const Matrix& A, const std::string& msgTag, RCP<const ParameterList> params) {
if (!CheckMatrix(A))
return "";
typedef Xpetra::global_size_t global_size_t;
std::ostringstream ss;
ss << msgTag << " size = " << A.getGlobalNumRows() << " x " << A.getGlobalNumCols();
if(A.haveGlobalConstants())
ss << ", nnz = " << A.getGlobalNumEntries();
ss << std::endl;
if (params.is_null())
return ss.str();
bool printLoadBalanceInfo = false, printCommInfo = false;
if (params->isParameter("printLoadBalancingInfo") && params->get<bool>("printLoadBalancingInfo"))
printLoadBalanceInfo = true;
if (params->isParameter("printCommInfo") && params->get<bool>("printCommInfo"))
printCommInfo = true;
if (!printLoadBalanceInfo && !printCommInfo)
return ss.str();
RCP<const Import> importer = A.getCrsGraph()->getImporter();
RCP<const Export> exporter = A.getCrsGraph()->getExporter();
size_t numMyNnz = A.getNodeNumEntries(), numMyRows = A.getNodeNumRows();
// Create communicator only for active processes
RCP<const Teuchos::Comm<int> > origComm = A.getRowMap()->getComm();
bool activeProc = true;
int numProc = origComm->getSize();
int numActiveProcs = 0;
#ifdef HAVE_MPI
RCP<const Teuchos::MpiComm<int> > mpiComm = rcp_dynamic_cast<const Teuchos::MpiComm<int> >(origComm);
MPI_Comm rawComm = (*mpiComm->getRawMpiComm())();
std::vector<size_t> numRowsPerProc(numProc);
Teuchos::gatherAll(*origComm, 1, &numMyRows, numProc, &numRowsPerProc[0]);
int root = 0;
bool rootFlag = true;
for (int i = 0; i < numProc; i++) {
if (numRowsPerProc[i]) {
++numActiveProcs;
if(rootFlag) {
root = i;
rootFlag = false;
}
}
}
if(numMyRows == 0) {activeProc = false; numMyNnz = 0;} // Reset numMyNnz to avoid adding it up in reduceAll
#else
if(numMyRows == 0) {
//FIXME JJH 10-May-2017 Is there any case in serial where numMyRows would be zero?
// Reset numMyNnz to avoid adding it up in reduceAll
numActiveProcs = 0;
activeProc = false;
numMyNnz = 0;
} else {
numActiveProcs = 1;
}
#endif
std::string outstr;
ParameterList absList;
absList.set("print abs", true);
if (printLoadBalanceInfo) {
ss << msgTag << " Load balancing info" << std::endl;
ss << msgTag << " # active processes: " << numActiveProcs << "/" << numProc << std::endl;
ss << msgTag << " # rows per proc : " << stringStats<global_size_t>(origComm, numActiveProcs, numMyRows) << std::endl;
ss << msgTag << " # nnz per proc : " << stringStats<global_size_t>(origComm, numActiveProcs, numMyNnz) << std::endl;
}
if (printCommInfo && numActiveProcs != 1) {
typedef std::map<int,size_t> map_type;
map_type neighMap;
if (!importer.is_null()) {
ArrayView<const int> exportPIDs = importer->getExportPIDs();
if (exportPIDs.size())
for (int i = 0; i < exportPIDs.size(); i++)
neighMap[exportPIDs[i]]++;
}
// Communication volume
size_t numExportSend = 0;
size_t numImportSend = 0;
size_t numMsgs = 0;
size_t minMsg = 0;
size_t maxMsg = 0;
if(activeProc) {
numExportSend = (!exporter.is_null() ? exporter->getNumExportIDs() : 0);
numImportSend = (!importer.is_null() ? importer->getNumExportIDs() : 0);
numMsgs = neighMap.size();
map_type::const_iterator it = std::min_element(neighMap.begin(), neighMap.end(), cmp_less<map_type>);
minMsg = (it != neighMap.end() ? it->second : 0);
it = std::max_element(neighMap.begin(), neighMap.end(), cmp_less<map_type>);
maxMsg = (it != neighMap.end() ? it->second : 0);
}
ss << msgTag << " Communication info" << std::endl;
ss << msgTag << " # num export send : " << stringStats<global_size_t>(origComm, numActiveProcs, numExportSend) << std::endl;
ss << msgTag << " # num import send : " << stringStats<global_size_t>(origComm, numActiveProcs, numImportSend) << std::endl;
ss << msgTag << " # num msgs : " << stringStats<global_size_t>(origComm, numActiveProcs, numMsgs, rcpFromRef(absList)) << std::endl;
ss << msgTag << " # min msg size : " << stringStats<global_size_t>(origComm, numActiveProcs, minMsg) << std::endl;
ss << msgTag << " # max msg size : " << stringStats<global_size_t>(origComm, numActiveProcs, maxMsg) << std::endl;
}
outstr = ss.str();
#ifdef HAVE_MPI
int strLength = outstr.size();
MPI_Bcast(&strLength, 1, MPI_INT, root, rawComm);
if (origComm->getRank() != root)
outstr.resize(strLength);
MPI_Bcast(&outstr[0], strLength, MPI_CHAR, root, rawComm);
#endif
return outstr;
}
template <class Scalar, class LocalOrdinal, class GlobalOrdinal, class Node>
std::string PerfUtils<Scalar, LocalOrdinal, GlobalOrdinal, Node>::CommPattern(const Matrix& A, const std::string& msgTag, RCP<const ParameterList> params) {
if (!CheckMatrix(A))
return "";
std::ostringstream out;
RCP<const Teuchos::Comm<int> > comm = A.getRowMap()->getComm();
int myRank = comm->getRank();
out << msgTag << " " << myRank << ":";
RCP<const Import> importer = (A.getCrsGraph() != Teuchos::null ? A.getCrsGraph()->getImporter() : Teuchos::null);
if (importer.is_null()) {
out << std::endl;
return out.str();
}
ArrayView<const int> exportPIDs = importer->getExportPIDs();
if (exportPIDs.size()) {
// NodeTE: exportPIDs is sorted but not unique ( 1 1 1 2 2 3 4 4 4 )
int neigh = exportPIDs[0];
GO weight = 1;
for (int i = 1; i < exportPIDs.size(); i++) {
if (exportPIDs[i] != exportPIDs[i-1]) {
out << " " << neigh << "(" << weight << ")";
neigh = exportPIDs[i];
weight = 1;
} else {
weight += 1;
}
}
out << " " << neigh << "(" << weight << ")" << std::endl;
}
return out.str();
}
template <class Scalar, class LocalOrdinal, class GlobalOrdinal, class Node>
bool PerfUtils<Scalar, LocalOrdinal, GlobalOrdinal, Node>::CheckMatrix(const Matrix& A) {
// We can only print statistics for matrices that have a crs graph. A
// potential issue is regarding Xpetra::TpetraBlockCrsMatrix which has no
// CrsGraph. It is held as a private data member by Xpetra::CrsMatrix,
// which itself is an Xpetra::Matrix. So we check directly whether the
// request for the graph throws.
bool hasCrsGraph = true;
try {
A.getCrsGraph();
} catch (...) {
hasCrsGraph = false;
}
return hasCrsGraph;
}
} //namespace MueLu
#endif // MUELU_PERFUTILS_DEF_HPP
|