/usr/include/trilinos/Zoltan2_XpetraCrsGraphAdapter.hpp is in libtrilinos-zoltan2-dev 12.10.1-3.
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 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 346 347 348 349 350 351 352 353 354 355 356 357 358 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 400 401 402 403 404 405 406 407 408 409 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 446 447 448 449 450 451 | // @HEADER
//
// ***********************************************************************
//
// Zoltan2: A package of combinatorial algorithms for scientific computing
// 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 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 Karen Devine (kddevin@sandia.gov)
// Erik Boman (egboman@sandia.gov)
// Siva Rajamanickam (srajama@sandia.gov)
//
// ***********************************************************************
//
// @HEADER
/*! \file Zoltan2_XpetraCrsGraphAdapter.hpp
\brief Defines XpetraCrsGraphAdapter class.
*/
#ifndef _ZOLTAN2_XPETRACRSGRAPHADAPTER_HPP_
#define _ZOLTAN2_XPETRACRSGRAPHADAPTER_HPP_
#include <Zoltan2_GraphAdapter.hpp>
#include <Zoltan2_StridedData.hpp>
#include <Zoltan2_XpetraTraits.hpp>
#include <Zoltan2_PartitioningHelpers.hpp>
#include <Xpetra_CrsGraph.hpp>
namespace Zoltan2 {
/*! \brief Provides access for Zoltan2 to Xpetra::CrsGraph data.
\todo test for memory alloc failure when we resize a vector
\todo we assume FillComplete has been called. Should we support
objects that are not FillCompleted.
The template parameter is the user's input object:
\li Tpetra::CrsGraph
\li Xpetra::CrsGraph
\li Epetra_CrsGraph
The \c scalar_t type, representing use data such as matrix values, is
used by Zoltan2 for weights, coordinates, part sizes and
quality metrics.
Some User types (like Tpetra::CrsMatrix) have an inherent scalar type,
and some
(like Tpetra::CrsGraph) do not. For such objects, the scalar type is
set by Zoltan2 to \c float. If you wish to change it to double, set
the second template parameter to \c double.
*/
template <typename User, typename UserCoord=User>
class XpetraCrsGraphAdapter : public GraphAdapter<User,UserCoord> {
public:
#ifndef DOXYGEN_SHOULD_SKIP_THIS
typedef typename InputTraits<User>::scalar_t scalar_t;
typedef typename InputTraits<User>::lno_t lno_t;
typedef typename InputTraits<User>::gno_t gno_t;
typedef typename InputTraits<User>::part_t part_t;
typedef typename InputTraits<User>::node_t node_t;
typedef Xpetra::CrsGraph<lno_t, gno_t, node_t> xgraph_t;
typedef User user_t;
typedef UserCoord userCoord_t;
#endif
/*! \brief Destructor
*/
~XpetraCrsGraphAdapter() { }
/*! \brief Constructor for graph with no weights or coordinates.
* \param ingraph the Epetra_CrsGraph, Tpetra::CrsGraph or Xpetra::CrsGraph
* \param numVtxWeights the number of weights per vertex (default = 0)
* \param numEdgeWeights the number of weights per edge (default = 0)
*
* Most adapters do not have RCPs in their interface. This
* one does because the user is obviously a Trilinos user.
*/
XpetraCrsGraphAdapter(const RCP<const User> &ingraph,
int nVtxWeights=0, int nEdgeWeights=0);
/*! \brief Provide a pointer to weights for the primary entity type.
* \param val A pointer to the weights for index \c idx.
* \param stride A stride for the \c val array. If \stride is
* \c k, then val[n * k] is the weight for the
* \c n th entity for index \idx.
* \param idx A number from 0 to one less than
* weight idx specified in the constructor.
*
* The order of the weights should match the order that
* entities appear in the input data structure.
*/
void setWeights(const scalar_t *val, int stride, int idx);
/*! \brief Provide a pointer to vertex weights.
* \param val A pointer to the weights for index \c idx.
* \param stride A stride for the \c val array. If \stride is
* \c k, then val[n * k] is the weight for the
* \c n th vertex for index \idx.
* \param idx A number from 0 to one less than
* number of vertex weights specified in the constructor.
*
* The order of the vertex weights should match the order that
* vertices appear in the input data structure.
* \code
* TheGraph->getRowMap()->getNodeElementList()
* \endcode
*/
void setVertexWeights(const scalar_t *val, int stride, int idx);
/*! \brief Specify an index for which the weight should be
the degree of the entity
* \param idx Zoltan2 will use the entity's
* degree as the entity weight for index \c idx.
*/
void setWeightIsDegree(int idx);
/*! \brief Specify an index for which the vertex weight should be
the degree of the vertex
* \param idx Zoltan2 will use the vertex's
* degree as the vertex weight for index \c idx.
*/
void setVertexWeightIsDegree(int idx);
/*! \brief Provide a pointer to edge weights.
* \param val A pointer to the weights for index \c idx.
* \param stride A stride for the \c val array. If \stride is
* \c k, then val[n * k] is the weight for the
* \c n th edge for index \idx.
* \param dim A number from 0 to one less than the number
* of edge weights specified in the constructor.
*
* The order of the edge weights should follow the order that the
* the vertices and edges appear in the input data structure.
*
* By vertex:
* \code
* TheGraph->getRowMap()->getNodeElementList()
* \endcode
*
* Then by vertex neighbor:
* \code
* TheGraph->getLocalRowView(vertexNum, neighborList);
* \endcode
*/
void setEdgeWeights(const scalar_t *val, int stride, int idx);
/*! \brief Access to Xpetra-wrapped user's graph.
*/
RCP<const xgraph_t> getXpetraGraph() const { return graph_; }
/*! \brief Access to user's graph
*/
RCP<const User> getUserGraph() const { return ingraph_; }
////////////////////////////////////////////////////
// The Adapter interface.
////////////////////////////////////////////////////
////////////////////////////////////////////////////
// The GraphAdapter interface.
////////////////////////////////////////////////////
// TODO: Assuming rows == objects;
// TODO: Need to add option for columns or nonzeros?
size_t getLocalNumVertices() const { return graph_->getNodeNumRows(); }
void getVertexIDsView(const gno_t *&ids) const
{
ids = NULL;
if (getLocalNumVertices())
ids = graph_->getRowMap()->getNodeElementList().getRawPtr();
}
size_t getLocalNumEdges() const { return graph_->getNodeNumEntries(); }
void getEdgesView(const lno_t *&offsets, const gno_t *&adjIds) const
{
offsets = offs_.getRawPtr();
adjIds = (getLocalNumEdges() ? adjids_.getRawPtr() : NULL);
}
int getNumWeightsPerVertex() const { return nWeightsPerVertex_;}
void getVertexWeightsView(const scalar_t *&weights, int &stride,
int idx) const
{
env_->localInputAssertion(__FILE__, __LINE__, "invalid weight index",
idx >= 0 && idx < nWeightsPerVertex_, BASIC_ASSERTION);
size_t length;
vertexWeights_[idx].getStridedList(length, weights, stride);
}
bool useDegreeAsVertexWeight(int idx) const {return vertexDegreeWeight_[idx];}
int getNumWeightsPerEdge() const { return nWeightsPerEdge_;}
void getEdgeWeightsView(const scalar_t *&weights, int &stride, int idx) const
{
env_->localInputAssertion(__FILE__, __LINE__, "invalid weight index",
idx >= 0 && idx < nWeightsPerEdge_, BASIC_ASSERTION);
size_t length;
edgeWeights_[idx].getStridedList(length, weights, stride);
}
template <typename Adapter>
void applyPartitioningSolution(const User &in, User *&out,
const PartitioningSolution<Adapter> &solution) const;
template <typename Adapter>
void applyPartitioningSolution(const User &in, RCP<User> &out,
const PartitioningSolution<Adapter> &solution) const;
private:
RCP<const User > ingraph_;
RCP<const xgraph_t > graph_;
RCP<const Comm<int> > comm_;
ArrayRCP<const lno_t> offs_;
ArrayRCP<const gno_t> adjids_;
int nWeightsPerVertex_;
ArrayRCP<StridedData<lno_t, scalar_t> > vertexWeights_;
ArrayRCP<bool> vertexDegreeWeight_;
int nWeightsPerEdge_;
ArrayRCP<StridedData<lno_t, scalar_t> > edgeWeights_;
int coordinateDim_;
ArrayRCP<StridedData<lno_t, scalar_t> > coords_;
// A default Environment for error messages. User-written
// InputAdapter classes can use some other error return convention
// if desired.
RCP<const Environment> env_;
};
/////////////////////////////////////////////////////////////////
// Definitions
/////////////////////////////////////////////////////////////////
template <typename User, typename UserCoord>
XpetraCrsGraphAdapter<User,UserCoord>::XpetraCrsGraphAdapter(
const RCP<const User> &ingraph, int nVtxWgts, int nEdgeWgts):
ingraph_(ingraph), graph_(), comm_() , offs_(), adjids_(),
nWeightsPerVertex_(nVtxWgts), vertexWeights_(), vertexDegreeWeight_(),
nWeightsPerEdge_(nEdgeWgts), edgeWeights_(),
coordinateDim_(0), coords_(),
env_(rcp(new Environment))
{
typedef StridedData<lno_t,scalar_t> input_t;
try {
graph_ = rcp_const_cast<const xgraph_t>(
XpetraTraits<User>::convertToXpetra(rcp_const_cast<User>(ingraph)));
}
Z2_FORWARD_EXCEPTIONS
comm_ = graph_->getComm();
size_t nvtx = graph_->getNodeNumRows();
size_t nedges = graph_->getNodeNumEntries();
// Unfortunately we have to copy the offsets and edge Ids
// because edge Ids are not usually stored in vertex id order.
size_t n = nvtx + 1;
lno_t *offs = new lno_t [n];
env_->localMemoryAssertion(__FILE__, __LINE__, n, offs);
gno_t *adjids = NULL;
if (nedges){
adjids = new gno_t [nedges];
env_->localMemoryAssertion(__FILE__, __LINE__, nedges, adjids);
}
offs[0] = 0;
for (size_t v=0; v < nvtx; v++){
ArrayView<const lno_t> nbors;
graph_->getLocalRowView(v, nbors);
offs[v+1] = offs[v] + nbors.size();
for (lno_t e=offs[v], i=0; e < offs[v+1]; e++)
adjids[e] = graph_->getColMap()->getGlobalElement(nbors[i++]);
}
offs_ = arcp(offs, 0, n, true);
adjids_ = arcp(adjids, 0, nedges, true);
if (nWeightsPerVertex_ > 0) {
vertexWeights_ =
arcp(new input_t[nWeightsPerVertex_], 0, nWeightsPerVertex_, true);
vertexDegreeWeight_ =
arcp(new bool[nWeightsPerVertex_], 0, nWeightsPerVertex_, true);
for (int i=0; i < nWeightsPerVertex_; i++)
vertexDegreeWeight_[i] = false;
}
if (nWeightsPerEdge_ > 0)
edgeWeights_ = arcp(new input_t[nWeightsPerEdge_], 0, nWeightsPerEdge_, true);
}
////////////////////////////////////////////////////////////////////////////
template <typename User, typename UserCoord>
void XpetraCrsGraphAdapter<User,UserCoord>::setWeights(
const scalar_t *weightVal, int stride, int idx)
{
if (this->getPrimaryEntityType() == GRAPH_VERTEX)
setVertexWeights(weightVal, stride, idx);
else
setEdgeWeights(weightVal, stride, idx);
}
////////////////////////////////////////////////////////////////////////////
template <typename User, typename UserCoord>
void XpetraCrsGraphAdapter<User,UserCoord>::setVertexWeights(
const scalar_t *weightVal, int stride, int idx)
{
typedef StridedData<lno_t,scalar_t> input_t;
env_->localInputAssertion(__FILE__, __LINE__, "invalid vertex weight index",
idx >= 0 && idx < nWeightsPerVertex_, BASIC_ASSERTION);
size_t nvtx = getLocalNumVertices();
ArrayRCP<const scalar_t> weightV(weightVal, 0, nvtx*stride, false);
vertexWeights_[idx] = input_t(weightV, stride);
}
////////////////////////////////////////////////////////////////////////////
template <typename User, typename UserCoord>
void XpetraCrsGraphAdapter<User,UserCoord>::setWeightIsDegree(
int idx)
{
if (this->getPrimaryEntityType() == GRAPH_VERTEX)
setVertexWeightIsDegree(idx);
else {
std::ostringstream emsg;
emsg << __FILE__ << "," << __LINE__
<< " error: setWeightIsNumberOfNonZeros is supported only for"
<< " vertices" << std::endl;
throw std::runtime_error(emsg.str());
}
}
////////////////////////////////////////////////////////////////////////////
template <typename User, typename UserCoord>
void XpetraCrsGraphAdapter<User,UserCoord>::setVertexWeightIsDegree(
int idx)
{
env_->localInputAssertion(__FILE__, __LINE__, "invalid vertex weight index",
idx >= 0 && idx < nWeightsPerVertex_, BASIC_ASSERTION);
vertexDegreeWeight_[idx] = true;
}
////////////////////////////////////////////////////////////////////////////
template <typename User, typename UserCoord>
void XpetraCrsGraphAdapter<User,UserCoord>::setEdgeWeights(
const scalar_t *weightVal, int stride, int idx)
{
typedef StridedData<lno_t,scalar_t> input_t;
env_->localInputAssertion(__FILE__, __LINE__, "invalid edge weight index",
idx >= 0 && idx < nWeightsPerEdge_, BASIC_ASSERTION);
size_t nedges = getLocalNumEdges();
ArrayRCP<const scalar_t> weightV(weightVal, 0, nedges*stride, false);
edgeWeights_[idx] = input_t(weightV, stride);
}
////////////////////////////////////////////////////////////////////////////
template <typename User, typename UserCoord>
template<typename Adapter>
void XpetraCrsGraphAdapter<User,UserCoord>::applyPartitioningSolution(
const User &in, User *&out,
const PartitioningSolution<Adapter> &solution) const
{
// Get an import list (rows to be received)
size_t numNewVtx;
ArrayRCP<gno_t> importList;
try{
numNewVtx = Zoltan2::getImportList<Adapter,
XpetraCrsGraphAdapter<User,UserCoord> >
(solution, this, importList);
}
Z2_FORWARD_EXCEPTIONS;
// Move the rows, creating a new graph.
RCP<User> outPtr = XpetraTraits<User>::doMigration(in, numNewVtx,
importList.getRawPtr());
out = outPtr.get();
outPtr.release();
}
////////////////////////////////////////////////////////////////////////////
template <typename User, typename UserCoord>
template<typename Adapter>
void XpetraCrsGraphAdapter<User,UserCoord>::applyPartitioningSolution(
const User &in, RCP<User> &out,
const PartitioningSolution<Adapter> &solution) const
{
// Get an import list (rows to be received)
size_t numNewVtx;
ArrayRCP<gno_t> importList;
try{
numNewVtx = Zoltan2::getImportList<Adapter,
XpetraCrsGraphAdapter<User,UserCoord> >
(solution, this, importList);
}
Z2_FORWARD_EXCEPTIONS;
// Move the rows, creating a new graph.
out = XpetraTraits<User>::doMigration(in, numNewVtx,
importList.getRawPtr());
}
} //namespace Zoltan2
#endif
|