/usr/include/trilinos/Teuchos_Comm.hpp is in libtrilinos-dev 10.4.0.dfsg-1ubuntu2.
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 | // @HEADER
// ***********************************************************************
//
// Teuchos: Common Tools Package
// Copyright (2004) 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.
//
// This library is free software; you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 2.1 of the
// License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful, but
// WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
// USA
// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
//
// ***********************************************************************
// @HEADER
#ifndef TEUCHOS_COMM_HPP
#define TEUCHOS_COMM_HPP
#include "Teuchos_ReductionOp.hpp"
#include "Teuchos_ArrayRCP.hpp"
namespace Teuchos {
/** \brief . */
class CommRequest : public Teuchos::Describable {};
/** \brief Abstract interface class for a basic communication channel between
* one or more processes.
*
* This interface is templated on the ordinal type but only deals with buffers
* of untyped data represented as arrays <tt>char</tt> type. All reduction
* operations that are initiated by the concreate communicator object are
* performed by user-defined <tt>ReductOpBase</tt> objects. It is the
* responsibility of the <tt>ReductOpBase</tt> object to know what the currect
* data type is, to perform casts or serializations/unserializations to and
* from <tt>char[]</tt> buffers, and to know how to reduce the objects
* correctly. It is strictly up to the client to correctly convert data types
* to <tt>char[]</tt> arrays but there is a great deal of helper code to make
* this easy and safe.
*
* ToDo: Finish documentation!
*/
template<typename Ordinal>
class Comm : virtual public Describable {
public:
//! @name Query functions
//@{
/** \brief Returns the rank of this process.
*
* <b>Postconditions:</b><ul>
* <li><tt>0 <= return && return < this->getSize()</tt>
* </ul>
*/
virtual int getRank() const = 0;
/** \brief Returns the number of processes that make up this communicator.
*
* <b>Postconditions:</b><ul>
* <li><tt>return > 0</tt>
* </ul>
*/
virtual int getSize() const = 0;
//@}
//! @name Collective Operations
//@{
/** \brief Pause every process in <tt>*this</tt> communicator until all the
* processes reach this point.
*/
virtual void barrier() const = 0;
/** \brief Broadcast values from the root process to the slave processes.
*
* \param rootRank [in] The rank of the root process.
*
* \param count [in] The number of bytes in <tt>buffer[]</tt>.
*
* \param buffer [in/out] Array (length <tt>bytes</tt>) of packed data.
* Must be set on input on the root processes with rank <tt>root</tt>. On
* output, each processs, including the root process contains the data.
*
* <b>Preconditions:</b><ul>
* <li><tt>0 <= rootRank && rootRank < this->getSize()</tt>
* </ul>
*/
virtual void broadcast(
const int rootRank, const Ordinal bytes, char buffer[]
) const = 0;
/** \brief Gather values from each process to collect on all processes.
*
* \param sendBytes [in] Number of entires in <tt>sendBuffer[]</tt> on
* input.
*
* \param sendBuffer [in] Array (length <tt>sendBytes</tt>) of data being
* sent from each process.
*
* \param recvBytes [in] Number of entires in <tt>recvBuffer[]</tt> which
* must be equal to <tt>sendBytes*this->getSize()</tt>. This field is just
* here for debug checking.
*
* \param recvBuffer [out] Array (length <tt>recvBytes</tt>) of all of the
* entires sent from each processes. Specifically,
* <tt>recvBuffer[sendBytes*j+i]</tt>, for <tt>j=0...this->getSize()-1</tt>
* and <tt>i=0...sendBytes-1</tt>, is the entry <tt>sendBuffer[i]</tt> from
* process with rank <tt>j</tt>.
*
* <b>Preconditions:</b><ul>
* <li><tt>recvBytes==sendBytes*this->getSize()</tt>
* </ul>
*/
virtual void gatherAll(
const Ordinal sendBytes, const char sendBuffer[]
,const Ordinal recvBytes, char recvBuffer[]
) const = 0;
/** \brief Global reduction.
*
* \param reductOp [in] The user-defined reduction operation
*
* \param bytes [in] The length of the buffers <tt>sendBuffer[]</tt> and
* <tt>globalReducts[]</tt>.
*
* \param sendBuffer [in] Array (length <tt>bytes</tt>) of the data
* contributed from each process.
*
* \param globalReducts [out] Array (length <tt>bytes</tt>) of the global
* reduction from each process.
*/
virtual void reduceAll(
const ValueTypeReductionOp<Ordinal,char> &reductOp
,const Ordinal bytes, const char sendBuffer[], char globalReducts[]
) const = 0;
/** \brief Global reduction combined with a scatter.
*
* \param reductOp [in] The user-defined reduction operation that accepts
* char arrays.
*
* \param sendBytes [in] The number of entires in <tt>sendBuffer[]</tt>.
* This must be the same in each process.
*
* \param sendBuffer [in] Array (length <tt>sendBytes</tt>) of the data
* contributed from each process.
*
* \param recvCounts [in] Array (length <tt>this->getSize()</tt>) which
* gives the number of chars from the global reduction that will be received
* in each process.
*
* \param myGlobalReducts [out] Array (length
* <tt>blockSize*recvCounts[rank]</tt>) of the global reductions gathered in
* this process.
*
* <b>Preconditions:</b><ul>
* <li><tt>sendBytes == sum(recvCounts[i],i=0...this->getSize()-1)</tt>
* </ul>
*/
virtual void reduceAllAndScatter(
const ValueTypeReductionOp<Ordinal,char> &reductOp
,const Ordinal sendBytes, const char sendBuffer[]
,const Ordinal recvCounts[], char myGlobalReducts[]
) const = 0;
/** \brief Scan reduction.
*
* \param reductOp [in] The user-defined reduction operation
*
* \param bytes [in] The length of the buffers <tt>sendBuffer[]</tt> and
* <tt>scanReducts[]</tt>.
*
* \param sendBuffer [in] Array (length <tt>bytes</tt>) of the data
* contributed from each process.
*
* \param scanReducts [out] Array (length <tt>bytes</tt>) of the reduction
* up to and including this process.
*/
virtual void scan(
const ValueTypeReductionOp<Ordinal,char> &reductOp
,const Ordinal bytes, const char sendBuffer[], char scanReducts[]
) const = 0;
//! @name Blocking Point-to-Point Operations
//@{
/** \brief Blocking send of data from this process to another process.
*
* \param bytes [in] The number of bytes of data being passed between
* processes.
*
* \param sendBuffer [in] Array (length <tt>bytes</tt>) of data being sent
* from this process. This buffer can be immediately destroyed or reused as
* soon as the function exits (that is why this function is "blocking").
*
* \param destRank [in] The rank of the process to receive the data.
*
* <b>Preconditions:</b><ul>
* <li><tt>0 <= destRank && destRank < this->getSize()</tt>
* <li><tt>destRank != this->getRank()</tt>
* </ul>
*/
virtual void send(
const Ordinal bytes, const char sendBuffer[], const int destRank
) const = 0;
/** \brief Blocking receive of data from this process to another process.
*
* \param sourceRank [in] The rank of the process to receive the data from.
* If <tt>sourceRank < 0</tt> then data will be received from any process.
*
* \param bytes [in] The number of bytes of data being passed between
* processes.
*
* \param recvBuffer [out] Array (length <tt>bytes</tt>) of data being
* received from this process. This buffer can be immediately used to
* access the data as soon as the function exits (that is why this function
* is "blocking").
*
* <b>Preconditions:</b><ul>
* <li>[<tt>sourceRank >= 0] <tt>sourceRank < this->getSize()</tt>
* <li><tt>sourceRank != this->getRank()</tt>
* </ul>
*
* \return Returns the senders rank.
*/
virtual int receive(
const int sourceRank, const Ordinal bytes, char recvBuffer[]
) const = 0;
/** \brief Ready send of data from this process to another process.
*
* \param sendBuffer [in] The data to be sent.
*
* \param destRank [in] The rank of the process to receive the data.
*
* <b>Preconditions:</b><ul>
* <li><tt>0 <= destRank && destRank < this->getSize()</tt>
* <li><tt>destRank != this->getRank()</tt>
* </ul>
*/
virtual void readySend(
const ArrayView<const char> &sendBuffer,
const int destRank
) const = 0;
//@}
//! @name Non-blocking Point-to-Point Operations
//@{
/** \brief Non-blocking send.
*
* \param sendBuffer [in] The data buffer to be sent.
*
* \param destRank [in] The rank of the process to receive the data.
*
* <b>Preconditions:</b><ul>
* <li><tt>0 <= destRank && destRank < this->getSize()</tt>
* <li><tt>destRank != this->getRank()</tt>
* </ul>
*/
virtual RCP<CommRequest> isend(
const ArrayView<const char> &sendBuffer,
const int destRank
) const = 0;
/** \brief Non-blocking receive.
*
* \param recvBuffer [out] The location for storing the received data.
*
* \param sourceRank [in] The rank of the process to receive the data from.
* If <tt>sourceRank < 0</tt> then data will be received from any process.
*
* <b>Preconditions:</b><ul>
* <li>[<tt>sourceRank >= 0] <tt>sourceRank < this->getSize()</tt>
* <li><tt>sourceRank != this->getRank()</tt>
* </ul>
*
* \return Returns the senders rank.
*/
virtual RCP<CommRequest> ireceive(
const ArrayView<char> &recvBuffer,
const int sourceRank
) const = 0;
/** \brief Wait on a set of communication request.
*
* <b>Preconditions:</b><ul>
* <li> <tt>requests.size() > 0</tt>
* </ul>
*
* <b>Postconditions:</b><ul>
* <li> <tt>is_null(request[i]))</tt> for <tt>i=0...requests.size()-1</tt>
* </ul>
*/
virtual void waitAll(
const ArrayView<RCP<CommRequest> > &requests
) const = 0;
/** \brief Wait on a single communication request.
*
* <b>Preconditions:</b><ul>
* <li> <tt>!is_null(request))</tt>
* </ul>
*
* <b>Postconditions:</b><ul>
* <li> <tt>is_null(*request))</tt>
* </ul>
*/
virtual void wait(
const Ptr<RCP<CommRequest> > &request
) const = 0;
//@}
}; // class Comm
} // namespace Teuchos
#endif // TEUCHOS_COMM_HPP
|