/usr/include/viennacl/vector_proxy.hpp is in libviennacl-dev 1.5.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 | #ifndef VIENNACL_VECTOR_PROXY_HPP_
#define VIENNACL_VECTOR_PROXY_HPP_
/* =========================================================================
Copyright (c) 2010-2014, Institute for Microelectronics,
Institute for Analysis and Scientific Computing,
TU Wien.
Portions of this software are copyright by UChicago Argonne, LLC.
-----------------
ViennaCL - The Vienna Computing Library
-----------------
Project Head: Karl Rupp rupp@iue.tuwien.ac.at
(A list of authors and contributors can be found in the PDF manual)
License: MIT (X11), see file LICENSE in the base directory
============================================================================= */
/** @file vector_proxy.hpp
@brief Proxy classes for vectors.
*/
#include "viennacl/forwards.h"
#include "viennacl/range.hpp"
#include "viennacl/slice.hpp"
#include "viennacl/vector.hpp"
#include "viennacl/tools/entry_proxy.hpp"
namespace viennacl
{
/** @brief Class for representing non-strided subvectors of a bigger vector x.
*
* In MATLAB notation, this could for example refer to the subvector x(3:8) of a vector x.
*/
template <typename VectorType>
class vector_range : public vector_base<typename VectorType::cpu_value_type>
{
typedef vector_range<VectorType> self_type;
typedef vector_base<typename VectorType::cpu_value_type> base_type;
public:
typedef typename VectorType::value_type value_type;
typedef range::size_type size_type;
typedef range::difference_type difference_type;
typedef value_type reference;
typedef const value_type & const_reference;
typedef typename VectorType::const_iterator const_iterator;
typedef typename VectorType::iterator iterator;
typedef typename VectorType::cpu_value_type cpu_value_type;
static const int alignment = VectorType::alignment;
vector_range(VectorType & v, range const & entry_range)
: base_type(v.handle(), entry_range.size(), v.start() + v.stride() * entry_range.start(), v.stride()) {}
using base_type::operator=;
};
/////////////////////////////////////////////////////////////
///////////////////////// CPU to GPU ////////////////////////
/////////////////////////////////////////////////////////////
template <typename VectorType, typename SCALARTYPE>
void copy(const VectorType & cpu_vector,
vector_range<vector<SCALARTYPE> > & gpu_vector_range )
{
assert(cpu_vector.end() - cpu_vector.begin() >= 0 && bool("Range must have nonnegative length!"));
if (cpu_vector.end() - cpu_vector.begin() > 0)
{
//we require that the size of the gpu_vector is larger or equal to the cpu-size
std::vector<SCALARTYPE> temp_buffer(cpu_vector.end() - cpu_vector.begin());
std::copy(cpu_vector.begin(), cpu_vector.end(), temp_buffer.begin());
viennacl::backend::memory_write(gpu_vector_range.handle(), sizeof(SCALARTYPE)*gpu_vector_range.start(), sizeof(SCALARTYPE)*temp_buffer.size(), &(temp_buffer[0]));
}
}
/** @brief Transfer from a cpu vector to a gpu vector. Convenience wrapper for viennacl::linalg::fast_copy(cpu_vec.begin(), cpu_vec.end(), gpu_vec.begin());
*
* @param cpu_vec A cpu vector. Type requirements: Iterator can be obtained via member function .begin() and .end()
* @param gpu_vec The gpu vector.
*/
template <typename CPUVECTOR, typename VectorType>
void fast_copy(const CPUVECTOR & cpu_vec, vector_range<VectorType> & gpu_vec)
{
viennacl::fast_copy(cpu_vec.begin(), cpu_vec.end(), gpu_vec.begin());
}
/////////////////////////////////////////////////////////////
///////////////////////// GPU to CPU ////////////////////////
/////////////////////////////////////////////////////////////
template <typename SCALARTYPE, typename VectorType>
void copy(vector_range<vector<SCALARTYPE> > const & gpu_vector_range,
VectorType & cpu_vector)
{
assert(cpu_vector.end() - cpu_vector.begin() >= 0 && bool("Range must have nonnegative length!"));
if (cpu_vector.end() > cpu_vector.begin())
{
std::vector<SCALARTYPE> temp_buffer(cpu_vector.end() - cpu_vector.begin());
viennacl::backend::memory_read(gpu_vector_range.handle(), sizeof(SCALARTYPE)*gpu_vector_range.start(), sizeof(SCALARTYPE)*temp_buffer.size(), &(temp_buffer[0]));
//now copy entries to cpu_vec:
std::copy(temp_buffer.begin(), temp_buffer.end(), cpu_vector.begin());
}
}
/** @brief Transfer from a GPU vector range to a CPU vector. Convenience wrapper for viennacl::linalg::fast_copy(gpu_vec.begin(), gpu_vec.end(), cpu_vec.begin());
*
* @param gpu_vec A gpu vector range.
* @param cpu_vec The cpu vector. Type requirements: Output iterator can be obtained via member function .begin()
*/
template <typename VectorType, typename CPUVECTOR>
void fast_copy(vector_range< VectorType > const & gpu_vec,
CPUVECTOR & cpu_vec )
{
viennacl::fast_copy(gpu_vec.begin(), gpu_vec.end(), cpu_vec.begin());
}
//
// Convenience function
//
template <typename VectorType>
vector_range<VectorType> project(VectorType & vec, viennacl::range const & r1)
{
return vector_range<VectorType>(vec, r1);
}
template <typename VectorType>
vector_range<VectorType> project(viennacl::vector_range<VectorType> & vec, viennacl::range const & r1)
{
assert(r1.size() <= vec.size() && bool("Size of range invalid!"));
return vector_range<VectorType>(vec, viennacl::range(vec.start() + r1.start(), vec.start() + r1.start() + r1.size()));
}
//
//
//
/////////////////////////////// Slice /////////////////////////////////////////////
//
//
//
/** @brief Class for representing strided subvectors of a bigger vector x.
*
* In MATLAB notation, this could for example refer to the subvector x(3:2:8) of a vector x.
*/
template <typename VectorType>
class vector_slice : public vector_base<typename VectorType::cpu_value_type>
{
typedef vector_slice<VectorType> self_type;
typedef vector_base<typename VectorType::cpu_value_type> base_type;
public:
typedef typename VectorType::value_type value_type;
typedef slice::size_type size_type;
typedef slice::difference_type difference_type;
typedef value_type reference;
typedef const value_type & const_reference;
typedef typename VectorType::const_iterator const_iterator;
typedef typename VectorType::iterator iterator;
typedef typename VectorType::cpu_value_type cpu_value_type;
static const int alignment = VectorType::alignment;
vector_slice(VectorType & v, slice const & entry_slice)
: base_type(v.handle(), entry_slice.size(), v.start() + v.stride() * entry_slice.start(), v.stride() * entry_slice.stride()) {}
using base_type::operator=;
};
/////////////////////////////////////////////////////////////
///////////////////////// CPU to GPU ////////////////////////
/////////////////////////////////////////////////////////////
template <typename VectorType, typename SCALARTYPE>
void copy(const VectorType & cpu_vector,
vector_slice<vector<SCALARTYPE> > & gpu_vector_slice )
{
if (cpu_vector.size() > 0)
{
std::vector<SCALARTYPE> temp_buffer(gpu_vector_slice.stride() * gpu_vector_slice.size());
viennacl::backend::memory_read(gpu_vector_slice.handle(), sizeof(SCALARTYPE)*gpu_vector_slice.start(), sizeof(SCALARTYPE)*temp_buffer.size(), &(temp_buffer[0]));
for (vcl_size_t i=0; i<cpu_vector.size(); ++i)
temp_buffer[i * gpu_vector_slice.stride()] = cpu_vector[i];
viennacl::backend::memory_write(gpu_vector_slice.handle(), sizeof(SCALARTYPE)*gpu_vector_slice.start(), sizeof(SCALARTYPE)*temp_buffer.size(), &(temp_buffer[0]));
}
}
/////////////////////////////////////////////////////////////
///////////////////////// GPU to CPU ////////////////////////
/////////////////////////////////////////////////////////////
template <typename VectorType, typename SCALARTYPE>
void copy(vector_slice<vector<SCALARTYPE> > const & gpu_vector_slice,
VectorType & cpu_vector)
{
assert(gpu_vector_slice.end() - gpu_vector_slice.begin() >= 0 && bool("Range must have nonnegative length!"));
if (gpu_vector_slice.end() - gpu_vector_slice.begin() > 0)
{
std::vector<SCALARTYPE> temp_buffer(gpu_vector_slice.stride() * gpu_vector_slice.size());
viennacl::backend::memory_read(gpu_vector_slice.handle(), sizeof(SCALARTYPE)*gpu_vector_slice.start(), sizeof(SCALARTYPE)*temp_buffer.size(), &(temp_buffer[0]));
for (vcl_size_t i=0; i<cpu_vector.size(); ++i)
cpu_vector[i] = temp_buffer[i * gpu_vector_slice.stride()];
}
}
//
// Convenience functions
//
template <typename VectorType>
vector_slice<VectorType> project(VectorType & vec, viennacl::slice const & s1)
{
assert(s1.size() <= vec.size() && bool("Size of slice larger than vector size!"));
return vector_slice<VectorType>(vec, s1);
}
template <typename VectorType>
vector_slice<VectorType> project(viennacl::vector_slice<VectorType> & vec, viennacl::slice const & s1)
{
assert(s1.size() <= vec.size() && bool("Size of slice larger than vector proxy!"));
return vector_slice<VectorType>(vec, viennacl::slice(vec.start() + s1.start(), vec.stride() * s1.stride(), s1.size()));
}
// interaction with range and vector_range:
template <typename VectorType>
vector_slice<VectorType> project(viennacl::vector_slice<VectorType> & vec, viennacl::range const & r1)
{
assert(r1.size() <= vec.size() && bool("Size of slice larger than vector proxy!"));
return vector_slice<VectorType>(vec, viennacl::slice(vec.start() + r1.start(), vec.stride(), r1.size()));
}
template <typename VectorType>
vector_slice<VectorType> project(viennacl::vector_range<VectorType> & vec, viennacl::slice const & s1)
{
assert(s1.size() <= vec.size() && bool("Size of slice larger than vector proxy!"));
return vector_slice<VectorType>(vec, viennacl::range(vec.start() + s1.start(), s1.stride(), s1.size()));
}
}
#endif
|