/usr/include/trilinos/TbbTsqr_TbbRecursiveTsqr.hpp is in libtrilinos-tpetra-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 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 | //@HEADER
// ************************************************************************
//
// Kokkos: Node API and Parallel Node Kernels
// Copyright (2008) 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 Michael A. Heroux (maherou@sandia.gov)
//
// ************************************************************************
//@HEADER
#ifndef __TSQR_TbbRecursiveTsqr_hpp
#define __TSQR_TbbRecursiveTsqr_hpp
#include <Tsqr_ApplyType.hpp>
#include <Tsqr_CacheBlocker.hpp>
#include <Tsqr_SequentialTsqr.hpp>
#include <TbbTsqr_Partitioner.hpp>
#include <stdexcept>
#include <string>
#include <utility> // std::pair
#include <vector>
////////////////////////////////////////////////////////////////////////////////
////////////////////////////////////////////////////////////////////////////////
namespace TSQR {
namespace TBB {
/// \class TbbRecursiveTsqr
/// \brief Non-parallel "functioning stub" implementation of \c TbbTsqr.
///
template< class LocalOrdinal, class Scalar >
class TbbRecursiveTsqr {
public:
/// \brief Constructor.
///
/// \param num_cores [in] Maximum parallelism to use (i.e.,
/// maximum number of partitions into which to divide the
/// matrix to factor).
///
/// \param cache_size_hint [in] Approximate cache size in bytes
/// per CPU core. A hint, not a command. If zero, set to a
/// reasonable default.
TbbRecursiveTsqr (const size_t num_cores = 1,
const size_t cache_size_hint = 0);
/// Number of cores to use to solve the problem (i.e., number of
/// subproblems into which to divide the main problem, to solve
/// it in parallel).
size_t ncores() const { return ncores_; }
//! Cache size hint (in bytes) used for the factorization.
size_t cache_size_hint() const { return seq_.cache_size_hint(); }
//! Results of SequentialTsqr for each core.
typedef typename SequentialTsqr<LocalOrdinal, Scalar>::FactorOutput SeqOutput;
/// \typedef ParOutput
/// \brief Array of ncores "local tau arrays" from parallel TSQR.
///
/// Local Q factors are stored in place.
typedef std::vector<std::vector<Scalar> > ParOutput;
/// \typedef FactorOutput
/// \brief Return type of factor().
///
/// factor() returns a pair: the results of SequentialTsqr for
/// data on each core, and the results of combining the data on
/// the cores.
typedef typename std::pair<std::vector<SeqOutput>, ParOutput> FactorOutput;
/// Copy the nrows by ncols matrix A_in (with leading dimension
/// lda_in >= nrows) into A_out, such that cache blocks are
/// arranged contiguously in memory.
void
cache_block (const LocalOrdinal nrows,
const LocalOrdinal ncols,
Scalar A_out[],
const Scalar A_in[],
const LocalOrdinal lda_in) const;
/// Copy the nrows by ncols matrix A_in, whose cache blocks are
/// arranged contiguously in memory, into A_out (with leading
/// dimension lda_out >= nrows), which is in standard
/// column-major order.
void
un_cache_block (const LocalOrdinal nrows,
const LocalOrdinal ncols,
Scalar A_out[],
const LocalOrdinal lda_out,
const Scalar A_in[]) const;
/// Compute the QR factorization of the nrows by ncols matrix A
/// (with leading dimension lda >= nrows), returning a
/// representation of the Q factor (which includes data stored
/// in-place in A), and overwriting R (an ncols by ncols matrix
/// in column-major order with leading dimension ldr >= ncols)
/// with the R factor.
FactorOutput
factor (const LocalOrdinal nrows,
const LocalOrdinal ncols,
Scalar A[],
const LocalOrdinal lda,
Scalar R[],
const LocalOrdinal ldr,
const bool contiguous_cache_blocks) const;
/// Apply the Q factor computed by factor() (which see) to the
/// nrows by ncols_C matrix C, with leading dimension ldc >=
/// nrows.
void
apply (const std::string& op,
const LocalOrdinal nrows,
const LocalOrdinal ncols_C,
Scalar C[],
const LocalOrdinal ldc,
const LocalOrdinal ncols_Q,
const Scalar Q[],
const LocalOrdinal ldq,
const FactorOutput& factor_output,
const bool contiguous_cache_blocks) const;
/// Compute the explicit representation of the Q factor computed
/// by factor().
void
explicit_Q (const LocalOrdinal nrows,
const LocalOrdinal ncols_Q_in,
const Scalar Q_in[],
const LocalOrdinal ldq_in,
const LocalOrdinal ncols_Q_out,
Scalar Q_out[],
const LocalOrdinal ldq_out,
const FactorOutput& factor_output,
const bool contiguous_cache_blocks) const;
private:
size_t ncores_;
TSQR::SequentialTsqr<LocalOrdinal, Scalar> seq_;
Partitioner<LocalOrdinal, Scalar> partitioner_;
typedef MatView<LocalOrdinal, Scalar> mat_view_type;
typedef ConstMatView<LocalOrdinal, Scalar> const_mat_view_type;
typedef std::pair<const_mat_view_type, const_mat_view_type> const_split_t;
typedef std::pair<mat_view_type, mat_view_type> split_t;
typedef std::pair<const_mat_view_type, mat_view_type> top_blocks_t;
typedef std::vector<top_blocks_t> array_top_blocks_t;
void
explicit_Q_helper (const size_t P_first,
const size_t P_last,
mat_view_type& Q_out,
const bool contiguous_cache_blocks) const;
/// \brief Return a nonconst view of the topmost block.
///
/// This is helpful for combining the R factors and extracting
/// the final R factor result.
mat_view_type
factor_helper (const size_t P_first,
const size_t P_last,
const size_t depth,
mat_view_type A,
std::vector<SeqOutput>& seq_outputs,
ParOutput& par_outputs,
Scalar R[],
const LocalOrdinal ldr,
const bool contiguous_cache_blocks) const;
bool
apply_helper_empty (const size_t P_first,
const size_t P_last,
const_mat_view_type &Q,
mat_view_type& C) const;
/// \brief Build array of ncores() blocks, one for each partition.
///
/// Each block is the topmost block in that partition. This is
/// useful for apply_helper.
void
build_partition_array (const size_t P_first,
const size_t P_last,
array_top_blocks_t& top_blocks,
const_mat_view_type& Q,
mat_view_type& C,
const bool contiguous_cache_blocks) const;
/// Apply Q (not Q^T or Q^H, which is why we don't ask for "op")
/// to C.
void
apply_helper (const size_t P_first,
const size_t P_last,
const_mat_view_type Q,
mat_view_type C,
array_top_blocks_t& top_blocks,
const FactorOutput& factor_output,
const bool contiguous_cache_blocks) const;
/// Apply Q^T or Q^H to C.
///
/// \return Views of the topmost partitions of Q resp. C.
std::pair<const_mat_view_type, mat_view_type>
apply_transpose_helper (const std::string& op,
const size_t P_first,
const size_t P_last,
const_mat_view_type Q,
mat_view_type C,
const FactorOutput& factor_output,
const bool contiguous_cache_blocks) const;
void
factor_pair (const size_t P_top,
const size_t P_bot,
mat_view_type& A_top,
mat_view_type& A_bot,
std::vector< std::vector< Scalar > >& par_outputs,
const bool contiguous_cache_blocks) const;
void
apply_pair (const std::string& trans,
const size_t P_top,
const size_t P_bot,
const_mat_view_type& Q_bot,
const std::vector< std::vector< Scalar > >& tau_arrays,
mat_view_type& C_top,
mat_view_type& C_bot,
const bool contiguous_cache_blocks) const;
void
cache_block_helper (mat_view_type& A_out,
const_mat_view_type& A_in,
const size_t P_first,
const size_t P_last) const;
void
un_cache_block_helper (mat_view_type& A_out,
const const_mat_view_type& A_in,
const size_t P_first,
const size_t P_last) const;
}; // class TbbRecursiveTsqr
} // namespace TBB
} // namespace TSQR
#include <TSQR/TBB/TbbRecursiveTsqr_Def.hpp>
#endif // __TSQR_TbbRecursiveTsqr_hpp
|