GOSTCoin CUDA miner project, compatible with most nvidia cards, containing only gostd algo
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.

111 lines
2.8 KiB

/*
* Copyright 2008-2012 NVIDIA Corporation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in ctbbliance 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.
*/
#include <thrust/detail/config.h>
#include <thrust/system/cpp/detail/execution_policy.h>
#include <thrust/system/tbb/memory.h>
#include <thrust/system/cpp/memory.h>
#include <limits>
namespace thrust
{
namespace system
{
namespace tbb
{
template<typename T>
template<typename OtherT>
reference<T> &
reference<T>
::operator=(const reference<OtherT> &other)
{
return super_t::operator=(other);
} // end reference::operator=()
template<typename T>
reference<T> &
reference<T>
::operator=(const value_type &x)
{
return super_t::operator=(x);
} // end reference::operator=()
template<typename T>
__host__ __device__
void swap(reference<T> a, reference<T> b)
{
a.swap(b);
} // end swap()
namespace detail
{
// XXX circular #inclusion problems cause the compiler to believe that cpp::malloc
// is not defined
// WAR the problem by using adl to call cpp::malloc, which requires it to depend
// on a template parameter
template<typename Tag>
pointer<void> malloc_workaround(Tag t, std::size_t n)
{
return pointer<void>(malloc(t, n));
} // end malloc_workaround()
// XXX circular #inclusion problems cause the compiler to believe that cpp::free
// is not defined
// WAR the problem by using adl to call cpp::free, which requires it to depend
// on a template parameter
template<typename Tag>
void free_workaround(Tag t, pointer<void> ptr)
{
free(t, ptr.get());
} // end free_workaround()
} // end detail
inline pointer<void> malloc(std::size_t n)
{
// XXX this is how we'd like to implement this function,
// if not for circular #inclusion problems:
//
// return pointer<void>(thrust::system::cpp::malloc(n))
//
return detail::malloc_workaround(cpp::tag(), n);
} // end malloc()
template<typename T>
pointer<T> malloc(std::size_t n)
{
pointer<void> raw_ptr = thrust::system::tbb::malloc(sizeof(T) * n);
return pointer<T>(reinterpret_cast<T*>(raw_ptr.get()));
} // end malloc()
inline void free(pointer<void> ptr)
{
// XXX this is how we'd like to implement this function,
// if not for circular #inclusion problems:
//
// thrust::system::cpp::free(ptr)
//
detail::free_workaround(cpp::tag(), ptr);
} // end free()
} // end tbb
} // end system
} // end thrust