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
|
/* SPDX-License-Identifier: Apache-2.0
* Copyright 2011-2022 Blender Foundation */
#ifndef __UTIL_STACK_ALLOCATOR_H__
#define __UTIL_STACK_ALLOCATOR_H__
#include <cstddef>
#include <memory>
CCL_NAMESPACE_BEGIN
/* Stack allocator for the use with STL. */
template<int SIZE, typename T> class ccl_try_align(16) StackAllocator
{
public:
typedef size_t size_type;
typedef ptrdiff_t difference_type;
typedef T *pointer;
typedef const T *const_pointer;
typedef T &reference;
typedef const T &const_reference;
typedef T value_type;
/* Allocator construction/destruction. */
StackAllocator() : pointer_(0), use_stack_(true)
{
}
StackAllocator(const StackAllocator &) : pointer_(0), use_stack_(true)
{
}
template<class U>
StackAllocator(const StackAllocator<SIZE, U> &) : pointer_(0), use_stack_(false)
{
}
/* Memory allocation/deallocation. */
T *allocate(size_t n, const void *hint = 0)
{
(void)hint;
if (n == 0) {
return NULL;
}
if (pointer_ + n >= SIZE || use_stack_ == false) {
size_t size = n * sizeof(T);
util_guarded_mem_alloc(size);
T *mem;
#ifdef WITH_BLENDER_GUARDEDALLOC
mem = (T *)MEM_mallocN_aligned(size, 16, "Cycles Alloc");
#else
mem = (T *)malloc(size);
#endif
if (mem == NULL) {
throw std::bad_alloc();
}
return mem;
}
T *mem = &data_[pointer_];
pointer_ += n;
return mem;
}
void deallocate(T * p, size_t n)
{
if (p == NULL) {
return;
}
if (p < data_ || p >= data_ + SIZE) {
util_guarded_mem_free(n * sizeof(T));
#ifdef WITH_BLENDER_GUARDEDALLOC
MEM_freeN(p);
#else
free(p);
#endif
return;
}
/* We don't support memory free for the stack allocator. */
}
/* Address of an reference. */
T *address(T & x) const
{
return &x;
}
const T *address(const T &x) const
{
return &x;
}
/* Object construction/destruction. */
void construct(T * p, const T &val)
{
if (p != NULL) {
new ((T *)p) T(val);
}
}
void destroy(T * p)
{
p->~T();
}
/* Maximum allocation size. */
size_t max_size() const
{
return size_t(-1);
}
/* Rebind to other type of allocator. */
template<class U> struct rebind {
typedef StackAllocator<SIZE, U> other;
};
/* Operators */
template<class U> inline StackAllocator &operator=(const StackAllocator<SIZE, U> &)
{
return *this;
}
StackAllocator<SIZE, T> &operator=(const StackAllocator &)
{
return *this;
}
inline bool operator==(StackAllocator const & /*other*/) const
{
return true;
}
inline bool operator!=(StackAllocator const &other) const
{
return !operator==(other);
}
private:
int pointer_;
bool use_stack_;
T data_[SIZE];
};
CCL_NAMESPACE_END
#endif /* __UTIL_STACK_ALLOCATOR_H__ */
|
