/usr/include/trilinos/MueLu_AmalgamationInfo_def.hpp is in libtrilinos-muelu-dev 12.4.2-2.
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 | // @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 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
// Jonathan Hu (jhu@sandia.gov)
// Andrey Prokopenko (aprokop@sandia.gov)
// Ray Tuminaro (rstumin@sandia.gov)
//
// ***********************************************************************
//
// @HEADER
/*
* MueLu_AmalgamationInfo_def.hpp
*
* Created on: Mar 28, 2012
* Author: wiesner
*/
#ifndef MUELU_AMALGAMATIONINFO_DEF_HPP_
#define MUELU_AMALGAMATIONINFO_DEF_HPP_
#include <Xpetra_MapFactory.hpp>
#include <Xpetra_Vector.hpp>
#include "MueLu_AmalgamationInfo_decl.hpp"
#include "MueLu_Exceptions.hpp"
#include "MueLu_Aggregates.hpp"
namespace MueLu {
template <class LocalOrdinal, class GlobalOrdinal, class Node>
void AmalgamationInfo<LocalOrdinal, GlobalOrdinal, Node>::UnamalgamateAggregates(const Aggregates& aggregates,
Teuchos::ArrayRCP<LocalOrdinal>& aggStart, Teuchos::ArrayRCP<GlobalOrdinal>& aggToRowMap) const {
int myPid = aggregates.GetMap()->getComm()->getRank();
Teuchos::ArrayView<const GO> nodeGlobalElts = aggregates.GetMap()->getNodeElementList();
Teuchos::ArrayRCP<LO> procWinner = aggregates.GetProcWinner()->getDataNonConst(0);
Teuchos::ArrayRCP<LO> vertex2AggId = aggregates.GetVertex2AggId()->getDataNonConst(0);
LO size = procWinner.size();
GO numAggregates = aggregates.GetNumAggregates();
std::vector<LO> sizes(numAggregates);
if (stridedblocksize_ == 1) {
for (LO lnode = 0; lnode < size; ++lnode) {
LO myAgg = vertex2AggId[lnode];
if (procWinner[lnode] == myPid)
sizes[myAgg] += 1;
}
} else {
for (LO lnode = 0; lnode < size; ++lnode) {
LO myAgg = vertex2AggId[lnode];
if (procWinner[lnode] == myPid) {
GO gnodeid = nodeGlobalElts[lnode];
for (LocalOrdinal k = 0; k < stridedblocksize_; k++) {
GlobalOrdinal gDofIndex = ComputeGlobalDOF(gnodeid,k);
if (columnMap_->isNodeGlobalElement(gDofIndex))
sizes[myAgg] += 1;
}
}
}
}
aggStart = ArrayRCP<LO>(numAggregates+1,0);
aggStart[0]=0;
for (GO i=0; i<numAggregates; ++i) {
aggStart[i+1] = aggStart[i] + sizes[i];
}
aggToRowMap = ArrayRCP<GO>(aggStart[numAggregates],0);
// count, how many dofs have been recorded for each aggregate so far
Array<LO> numDofs(numAggregates, 0); // empty array with number of Dofs for each aggregate
if (stridedblocksize_ == 1) {
for (LO lnode = 0; lnode < size; ++lnode) {
LO myAgg = vertex2AggId[lnode];
if (procWinner[lnode] == myPid) {
aggToRowMap[ aggStart[myAgg] + numDofs[myAgg] ] = ComputeGlobalDOF(nodeGlobalElts[lnode]);
++(numDofs[myAgg]);
}
}
} else {
for (LO lnode = 0; lnode < size; ++lnode) {
LO myAgg = vertex2AggId[lnode];
if (procWinner[lnode] == myPid) {
GO gnodeid = nodeGlobalElts[lnode];
for (LocalOrdinal k = 0; k < stridedblocksize_; k++) {
GlobalOrdinal gDofIndex = ComputeGlobalDOF(gnodeid,k);
if (columnMap_->isNodeGlobalElement(gDofIndex)) {
aggToRowMap[ aggStart[myAgg] + numDofs[myAgg] ] = gDofIndex;
++(numDofs[myAgg]);
}
}
}
}
}
// todo plausibility check: entry numDofs[k] == aggToRowMap[k].size()
} //UnamalgamateAggregates
template <class LocalOrdinal, class GlobalOrdinal, class Node>
void AmalgamationInfo<LocalOrdinal, GlobalOrdinal, Node>::UnamalgamateAggregatesLO(const Aggregates& aggregates,
Teuchos::ArrayRCP<LO>& aggStart, Teuchos::ArrayRCP<LO>& aggToRowMap) const {
int myPid = aggregates.GetMap()->getComm()->getRank();
Teuchos::ArrayView<const GO> nodeGlobalElts = aggregates.GetMap()->getNodeElementList();
Teuchos::ArrayRCP<LO> procWinner = aggregates.GetProcWinner() ->getDataNonConst(0);
Teuchos::ArrayRCP<LO> vertex2AggId = aggregates.GetVertex2AggId()->getDataNonConst(0);
const GO numAggregates = aggregates.GetNumAggregates();
// FIXME: Do we need to compute size here? Or can we use existing?
LO size = procWinner.size();
std::vector<LO> sizes(numAggregates);
if (stridedblocksize_ == 1) {
for (LO lnode = 0; lnode < size; lnode++)
if (procWinner[lnode] == myPid)
sizes[vertex2AggId[lnode]]++;
} else {
for (LO lnode = 0; lnode < size; lnode++)
if (procWinner[lnode] == myPid) {
GO nodeGID = nodeGlobalElts[lnode];
for (LO k = 0; k < stridedblocksize_; k++) {
GO GID = ComputeGlobalDOF(nodeGID, k);
if (columnMap_->isNodeGlobalElement(GID))
sizes[vertex2AggId[lnode]]++;
}
}
}
aggStart = ArrayRCP<LO>(numAggregates+1); // FIXME: useless initialization with zeros
aggStart[0] = 0;
for (GO i = 0; i < numAggregates; i++)
aggStart[i+1] = aggStart[i] + sizes[i];
aggToRowMap = ArrayRCP<LO>(aggStart[numAggregates], 0);
// count, how many dofs have been recorded for each aggregate so far
Array<LO> numDofs(numAggregates, 0); // empty array with number of DOFs for each aggregate
if (stridedblocksize_ == 1) {
for (LO lnode = 0; lnode < size; ++lnode)
if (procWinner[lnode] == myPid) {
LO myAgg = vertex2AggId[lnode];
aggToRowMap[aggStart[myAgg] + numDofs[myAgg]] = lnode;
numDofs[myAgg]++;
}
} else {
for (LO lnode = 0; lnode < size; ++lnode)
if (procWinner[lnode] == myPid) {
LO myAgg = vertex2AggId[lnode];
GO nodeGID = nodeGlobalElts[lnode];
for (LO k = 0; k < stridedblocksize_; k++) {
GO GID = ComputeGlobalDOF(nodeGID, k);
if (columnMap_->isNodeGlobalElement(GID)) {
aggToRowMap[aggStart[myAgg] + numDofs[myAgg]] = lnode*stridedblocksize_ + k;
numDofs[myAgg]++;
}
}
}
}
// todo plausibility check: entry numDofs[k] == aggToRowMap[k].size()
} //UnamalgamateAggregates
/////////////////////////////////////////////////////////////////////////////
template <class LocalOrdinal, class GlobalOrdinal, class Node>
RCP<Xpetra::Map<LocalOrdinal, GlobalOrdinal, Node> > AmalgamationInfo<LocalOrdinal, GlobalOrdinal, Node>::ComputeUnamalgamatedImportDofMap(const Aggregates& aggregates) const {
Teuchos::RCP<const Map> nodeMap = aggregates.GetMap();
Teuchos::RCP<std::vector<GO> > myDofGids = Teuchos::rcp(new std::vector<GO>);
Teuchos::ArrayView<const GO> gEltList = nodeMap->getNodeElementList();
LO nodeElements = Teuchos::as<LO>(nodeMap->getNodeNumElements());
if (stridedblocksize_ == 1) {
for (LO n = 0; n<nodeElements; n++) {
GlobalOrdinal gDofIndex = ComputeGlobalDOF(gEltList[n]);
myDofGids->push_back(gDofIndex);
}
} else {
for (LO n = 0; n<nodeElements; n++) {
for (LocalOrdinal k = 0; k < stridedblocksize_; k++) {
GlobalOrdinal gDofIndex = ComputeGlobalDOF(gEltList[n],k);
if (columnMap_->isNodeGlobalElement(gDofIndex))
myDofGids->push_back(gDofIndex);
}
}
}
Teuchos::ArrayRCP<GO> arr_myDofGids = Teuchos::arcp( myDofGids );
Teuchos::RCP<Map> importDofMap = MapFactory::Build(aggregates.GetMap()->lib(), Teuchos::OrdinalTraits<Xpetra::global_size_t>::invalid(), arr_myDofGids(), aggregates.GetMap()->getIndexBase(), aggregates.GetMap()->getComm());
return importDofMap;
}
/////////////////////////////////////////////////////////////////////////////
template <class LocalOrdinal, class GlobalOrdinal, class Node>
GlobalOrdinal AmalgamationInfo<LocalOrdinal, GlobalOrdinal, Node>::ComputeGlobalDOF(GlobalOrdinal const &gNodeID, LocalOrdinal const &k) const {
// here, the assumption is, that the node map has the same indexBase as the dof map
// this is the node map index base this is the dof map index base
GlobalOrdinal gDofIndex = offset_ + (gNodeID-indexBase_)*fullblocksize_ + nStridedOffset_ + k + indexBase_;
return gDofIndex;
}
} //namespace
#endif /* MUELU_AMALGAMATIONINFO_DEF_HPP_ */
|