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
|
/*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*/
#ifndef __BLI_MEMORY_UTILS_CXX_H__
#define __BLI_MEMORY_UTILS_CXX_H__
/** \file
* \ingroup bli
*/
#include <memory>
#include <algorithm>
namespace BLI {
using std::copy;
using std::copy_n;
using std::uninitialized_copy;
using std::uninitialized_copy_n;
using std::uninitialized_fill;
using std::uninitialized_fill_n;
template<typename T> void construct_default(T *ptr)
{
new (ptr) T();
}
template<typename T> void destruct(T *ptr)
{
ptr->~T();
}
template<typename T> void destruct_n(T *ptr, uint n)
{
for (uint i = 0; i < n; i++) {
ptr[i].~T();
}
}
template<typename T> void uninitialized_move_n(T *src, uint n, T *dst)
{
std::uninitialized_copy_n(std::make_move_iterator(src), n, dst);
}
template<typename T> void move_n(T *src, uint n, T *dst)
{
std::copy_n(std::make_move_iterator(src), n, dst);
}
template<typename T> void uninitialized_relocate(T *src, T *dst)
{
new (dst) T(std::move(*src));
destruct(src);
}
template<typename T> void uninitialized_relocate_n(T *src, uint n, T *dst)
{
uninitialized_move_n(src, n, dst);
destruct_n(src, n);
}
template<typename T> void relocate(T *src, T *dst)
{
*dst = std::move(*src);
destruct(src);
}
template<typename T> void relocate_n(T *src, uint n, T *dst)
{
move_n(src, n, dst);
destruct_n(src, n);
}
template<typename T, typename... Args> std::unique_ptr<T> make_unique(Args &&... args)
{
return std::unique_ptr<T>(new T(std::forward<Args>(args)...));
}
template<typename T> struct DestructValueAtAddress {
void operator()(T *ptr)
{
ptr->~T();
}
};
template<typename T> using destruct_ptr = std::unique_ptr<T, DestructValueAtAddress<T>>;
template<uint Size, uint Alignment> class alignas(Alignment) AlignedBuffer {
private:
/* Don't create an empty array. This causes problems with some compilers. */
static constexpr uint ActualSize = (Size > 0) ? Size : 1;
char m_buffer[ActualSize];
public:
void *ptr()
{
return (void *)m_buffer;
}
const void *ptr() const
{
return (const void *)m_buffer;
}
};
} // namespace BLI
#endif /* __BLI_MEMORY_UTILS_CXX_H__ */
|
