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
|
/*
* Copyright 2008-2018 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.
*/
#pragma once
#include <thrust/detail/config.h>
#include <thrust/system/cpp/detail/execution_policy.h>
#include <thrust/system/omp/memory.h>
#include <thrust/system/cpp/memory.h>
#include <limits>
THRUST_NAMESPACE_BEGIN
namespace system
{
namespace omp
{
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::omp::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 omp
} // end system
THRUST_NAMESPACE_END
|
