GOSTSec
/
ccminer
mirror of https://github.com/GOSTSec/ccminer
1
0
Fork 0
Code Issues Releases Wiki Activity
GOSTcoin support for ccminer CUDA miner project, compatible with most nvidia cards
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
202 Commits
2 Branches
52 Tags
66 MiB
 
 
 
 
 
Tree: e40a7a720c
Branches Tags
${ item.name }
Create tag ${ searchTerm }
Create branch ${ searchTerm }
from 'e40a7a720c'
${ noResults }
ccminer/compat/thrust/uninitialized_fill.h

273 lines
10 KiB
Raw Blame History

/*
* Copyright 2008-2012 NVIDIA Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/*! \file uninitialized_fill.h
* \brief Copy construction into a range of uninitialized elements from a source value
*/
#pragma once
#include <thrust/detail/config.h>
#include <thrust/detail/execution_policy.h>
namespace thrust
{
/*! \addtogroup filling
* \ingroup transformations
* \{
*/
/*! In \c thrust, the function \c thrust::device_new allocates memory for
* an object and then creates an object at that location by calling a
* constructor. Occasionally, however, it is useful to separate those two
* operations. If each iterator in the range <tt>[first, last)</tt> points
* to unitialized memory, then \p unitialized_fill creates copies of \c x
* in that range. That is, for each iterator \c i in the range <tt>[first, last)</tt>,
* \p uninitialized_fill creates a copy of \c x in the location pointed to \c i by
* calling \p ForwardIterator's \c value_type's copy constructor.
*
* The algorithm's execution is parallelized as determined by \p exec.
*
* \param exec The execution policy to use for parallelization.
* \param first The first element of the range of interest.
* \param last The last element of the range of interest.
* \param x The value to use as the exemplar of the copy constructor.
*
* \tparam DerivedPolicy The name of the derived execution policy.
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator">Forward Iterator</a>,
* \p ForwardIterator is mutable, and \p ForwardIterator's \c value_type has a constructor that
* takes a single argument of type \p T.
*
* The following code snippet demonstrates how to use \p uninitialized_fill to initialize a range of
* uninitialized memory using the \p thrust::device execution policy for parallelization:
*
* \code
* #include <thrust/uninitialized_fill.h>
* #include <thrust/device_malloc.h>
* #include <thrust/execution_policy.h>
*
* struct Int
* {
* __host__ __device__
* Int(int x) : val(x) {}
* int val;
* };
* ...
* const int N = 137;
*
* Int val(46);
* thrust::device_ptr<Int> array = thrust::device_malloc<Int>(N);
* thrust::uninitialized_fill(thrust::device, array, array + N, val);
*
* // Int x = array[i];
* // x.val == 46 for all 0 <= i < N
* \endcode
*
* \see http://www.sgi.com/tech/stl/uninitialized_fill.html
* \see \c uninitialized_fill_n
* \see \c fill
* \see \c uninitialized_copy
* \see \c device_new
* \see \c device_malloc
*/
template<typename DerivedPolicy, typename ForwardIterator, typename T>
void uninitialized_fill(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
ForwardIterator first,
ForwardIterator last,
const T &x);
/*! In \c thrust, the function \c thrust::device_new allocates memory for
* an object and then creates an object at that location by calling a
* constructor. Occasionally, however, it is useful to separate those two
* operations. If each iterator in the range <tt>[first, last)</tt> points
* to unitialized memory, then \p unitialized_fill creates copies of \c x
* in that range. That is, for each iterator \c i in the range <tt>[first, last)</tt>,
* \p uninitialized_fill creates a copy of \c x in the location pointed to \c i by
* calling \p ForwardIterator's \c value_type's copy constructor.
*
* \param first The first element of the range of interest.
* \param last The last element of the range of interest.
* \param x The value to use as the exemplar of the copy constructor.
*
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator">Forward Iterator</a>,
* \p ForwardIterator is mutable, and \p ForwardIterator's \c value_type has a constructor that
* takes a single argument of type \p T.
*
* The following code snippet demonstrates how to use \p uninitialized_fill to initialize a range of
* uninitialized memory.
*
* \code
* #include <thrust/uninitialized_fill.h>
* #include <thrust/device_malloc.h>
*
* struct Int
* {
* __host__ __device__
* Int(int x) : val(x) {}
* int val;
* };
* ...
* const int N = 137;
*
* Int val(46);
* thrust::device_ptr<Int> array = thrust::device_malloc<Int>(N);
* thrust::uninitialized_fill(array, array + N, val);
*
* // Int x = array[i];
* // x.val == 46 for all 0 <= i < N
* \endcode
*
* \see http://www.sgi.com/tech/stl/uninitialized_fill.html
* \see \c uninitialized_fill_n
* \see \c fill
* \see \c uninitialized_copy
* \see \c device_new
* \see \c device_malloc
*/
template<typename ForwardIterator, typename T>
void uninitialized_fill(ForwardIterator first,
ForwardIterator last,
const T &x);
/*! In \c thrust, the function \c thrust::device_new allocates memory for
* an object and then creates an object at that location by calling a
* constructor. Occasionally, however, it is useful to separate those two
* operations. If each iterator in the range <tt>[first, first+n)</tt> points
* to unitialized memory, then \p unitialized_fill creates copies of \c x
* in that range. That is, for each iterator \c i in the range <tt>[first, first+n)</tt>,
* \p uninitialized_fill creates a copy of \c x in the location pointed to \c i by
* calling \p ForwardIterator's \c value_type's copy constructor.
*
* The algorithm's execution is parallelized as determined by \p exec.
*
* \param exec The execution policy to use for parallelization.
* \param first The first element of the range of interest.
* \param n The size of the range of interest.
* \param x The value to use as the exemplar of the copy constructor.
* \return <tt>first+n</tt>
*
* \tparam DerivedPolicy The name of the derived execution policy.
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator">Forward Iterator</a>,
* \p ForwardIterator is mutable, and \p ForwardIterator's \c value_type has a constructor that
* takes a single argument of type \p T.
*
* The following code snippet demonstrates how to use \p uninitialized_fill to initialize a range of
* uninitialized memory using the \p thrust::device execution policy for parallelization:
*
* \code
* #include <thrust/uninitialized_fill.h>
* #include <thrust/device_malloc.h>
* #include <thrust/execution_policy.h>
*
* struct Int
* {
* __host__ __device__
* Int(int x) : val(x) {}
* int val;
* };
* ...
* const int N = 137;
*
* Int val(46);
* thrust::device_ptr<Int> array = thrust::device_malloc<Int>(N);
* thrust::uninitialized_fill_n(thrust::device, array, N, val);
*
* // Int x = array[i];
* // x.val == 46 for all 0 <= i < N
* \endcode
*
* \see http://www.sgi.com/tech/stl/uninitialized_fill.html
* \see \c uninitialized_fill
* \see \c fill
* \see \c uninitialized_copy_n
* \see \c device_new
* \see \c device_malloc
*/
template<typename DerivedPolicy, typename ForwardIterator, typename Size, typename T>
ForwardIterator uninitialized_fill_n(const thrust::detail::execution_policy_base<DerivedPolicy> &exec,
ForwardIterator first,
Size n,
const T &x);
/*! In \c thrust, the function \c thrust::device_new allocates memory for
* an object and then creates an object at that location by calling a
* constructor. Occasionally, however, it is useful to separate those two
* operations. If each iterator in the range <tt>[first, first+n)</tt> points
* to unitialized memory, then \p unitialized_fill creates copies of \c x
* in that range. That is, for each iterator \c i in the range <tt>[first, first+n)</tt>,
* \p uninitialized_fill creates a copy of \c x in the location pointed to \c i by
* calling \p ForwardIterator's \c value_type's copy constructor.
*
* \param first The first element of the range of interest.
* \param n The size of the range of interest.
* \param x The value to use as the exemplar of the copy constructor.
* \return <tt>first+n</tt>
*
* \tparam ForwardIterator is a model of <a href="http://www.sgi.com/tech/stl/ForwardIterator">Forward Iterator</a>,
* \p ForwardIterator is mutable, and \p ForwardIterator's \c value_type has a constructor that
* takes a single argument of type \p T.
*
* The following code snippet demonstrates how to use \p uninitialized_fill to initialize a range of
* uninitialized memory.
*
* \code
* #include <thrust/uninitialized_fill.h>
* #include <thrust/device_malloc.h>
*
* struct Int
* {
* __host__ __device__
* Int(int x) : val(x) {}
* int val;
* };
* ...
* const int N = 137;
*
* Int val(46);
* thrust::device_ptr<Int> array = thrust::device_malloc<Int>(N);
* thrust::uninitialized_fill_n(array, N, val);
*
* // Int x = array[i];
* // x.val == 46 for all 0 <= i < N
* \endcode
*
* \see http://www.sgi.com/tech/stl/uninitialized_fill.html
* \see \c uninitialized_fill
* \see \c fill
* \see \c uninitialized_copy_n
* \see \c device_new
* \see \c device_malloc
*/
template<typename ForwardIterator, typename Size, typename T>
ForwardIterator uninitialized_fill_n(ForwardIterator first,
Size n,
const T &x);
/*! \} // end filling
* \} // transformations
*/
} // end thrust
#include <thrust/detail/uninitialized_fill.inl>