1 #ifndef STAN_MATH_MEMORY_STACK_ALLOC_HPP
2 #define STAN_MATH_MEMORY_STACK_ALLOC_HPP
31 return (reinterpret_cast<uintptr_t>(ptr) % bytes_aligned) == 0U;
36 const size_t DEFAULT_INITIAL_NBYTES = 1 << 16;
41 inline char* eight_byte_aligned_malloc(
size_t size) {
42 char* ptr =
static_cast<char*
>(malloc(size));
46 s <<
"invalid alignment to 8 bytes, ptr="
47 <<
reinterpret_cast<uintptr_t
>(ptr)
49 throw std::runtime_error(s.str());
76 std::vector<char*> blocks_;
78 std::vector<size_t> sizes_;
84 std::vector<size_t> nested_cur_blocks_;
85 std::vector<char*> nested_next_locs_;
86 std::vector<char*> nested_cur_block_ends_;
97 char* move_to_next_block(
size_t len) {
101 while ((cur_block_ < blocks_.size()) && (sizes_[cur_block_] < len))
104 if (
unlikely(cur_block_ >= blocks_.size())) {
106 size_t newsize = sizes_.back() * 2;
109 blocks_.push_back(eight_byte_aligned_malloc(newsize));
111 throw std::bad_alloc();
112 sizes_.push_back(newsize);
114 result = blocks_[cur_block_];
116 next_loc_ = result + len;
117 cur_block_end_ = result + sizes_[cur_block_];
131 explicit stack_alloc(
size_t initial_nbytes = DEFAULT_INITIAL_NBYTES) :
132 blocks_(1, eight_byte_aligned_malloc(initial_nbytes)),
133 sizes_(1, initial_nbytes),
135 cur_block_end_(blocks_[0] + initial_nbytes),
136 next_loc_(blocks_[0]) {
138 throw std::bad_alloc();
149 for (
size_t i = 0; i < blocks_.size(); ++i)
168 char* result = next_loc_;
171 if (
unlikely(next_loc_ >= cur_block_end_))
172 result = move_to_next_block(len);
173 return reinterpret_cast<void*
>(result);
184 template <
typename T>
187 return static_cast<T*
>(
alloc(n *
sizeof(T)));
199 next_loc_ = blocks_[0];
200 cur_block_end_ = next_loc_ + sizes_[0];
208 nested_cur_blocks_.push_back(cur_block_);
209 nested_next_locs_.push_back(next_loc_);
210 nested_cur_block_ends_.push_back(cur_block_end_);
217 if (
unlikely(nested_cur_blocks_.empty()))
220 cur_block_ = nested_cur_blocks_.back();
221 nested_cur_blocks_.pop_back();
223 next_loc_ = nested_next_locs_.back();
224 nested_next_locs_.pop_back();
226 cur_block_end_ = nested_cur_block_ends_.back();
227 nested_cur_block_ends_.pop_back();
237 for (
size_t i = 1; i < blocks_.size(); ++i)
257 for (
size_t i = 0; i <= cur_block_; ++i) {
fvar< T > sum(const std::vector< fvar< T > > &m)
Return the sum of the entries of the specified standard vector.
~stack_alloc()
Destroy this memory allocator.
void recover_nested()
recover memory back to the last start_nested call.
void free_all()
Free all memory used by the stack allocator other than the initial block allocation back to the syste...
void recover_all()
Recover all the memory used by the stack allocator.
size_t bytes_allocated()
Return number of bytes allocated to this instance by the heap.
T * alloc_array(size_t n)
Allocate an array on the arena of the specified size to hold values of the specified template paramet...
int size(const std::vector< T > &x)
Return the size of the specified standard vector.
void start_nested()
Store current positions before doing nested operation so can recover back to start.
bool is_aligned(T *ptr, unsigned int bytes_aligned)
Return true if the specified pointer is aligned on the number of bytes.
stack_alloc(size_t initial_nbytes=DEFAULT_INITIAL_NBYTES)
Construct a resizable stack allocator initially holding the specified number of bytes.
An instance of this class provides a memory pool through which blocks of raw memory may be allocated ...
void * alloc(size_t len)
Return a newly allocated block of memory of the appropriate size managed by the stack allocator...