2015-02-14 13:03:39 +00:00
|
|
|
/*
|
|
|
|
* Copyright 2011-2015 Blender Foundation
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef __UTIL_GUARDED_ALLOCATOR_H__
|
|
|
|
#define __UTIL_GUARDED_ALLOCATOR_H__
|
|
|
|
|
2016-02-06 22:40:41 +00:00
|
|
|
#include <cstddef>
|
2015-02-14 13:03:39 +00:00
|
|
|
#include <memory>
|
|
|
|
|
2016-02-06 22:40:41 +00:00
|
|
|
#include "util_debug.h"
|
2015-02-14 13:03:39 +00:00
|
|
|
#include "util_types.h"
|
|
|
|
|
2015-02-14 18:26:07 +00:00
|
|
|
#ifdef WITH_BLENDER_GUARDEDALLOC
|
|
|
|
# include "../../guardedalloc/MEM_guardedalloc.h"
|
|
|
|
#endif
|
|
|
|
|
2015-02-14 13:03:39 +00:00
|
|
|
CCL_NAMESPACE_BEGIN
|
|
|
|
|
|
|
|
/* Internal use only. */
|
|
|
|
void util_guarded_mem_alloc(size_t n);
|
|
|
|
void util_guarded_mem_free(size_t n);
|
|
|
|
|
|
|
|
/* Guarded allocator for the use with STL. */
|
|
|
|
template <typename T>
|
2016-02-06 22:40:41 +00:00
|
|
|
class GuardedAllocator {
|
2015-02-14 13:03:39 +00:00
|
|
|
public:
|
2016-02-06 22:40:41 +00:00
|
|
|
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;
|
|
|
|
|
|
|
|
GuardedAllocator() {}
|
|
|
|
GuardedAllocator(const GuardedAllocator&) {}
|
2015-02-14 13:03:39 +00:00
|
|
|
|
|
|
|
T *allocate(size_t n, const void *hint = 0)
|
|
|
|
{
|
2016-02-13 11:35:33 +00:00
|
|
|
size_t size = n * sizeof(T);
|
|
|
|
util_guarded_mem_alloc(size);
|
2015-04-02 10:06:40 +00:00
|
|
|
(void)hint;
|
2016-02-06 22:40:41 +00:00
|
|
|
#ifdef WITH_BLENDER_GUARDEDALLOC
|
|
|
|
if(n == 0) {
|
|
|
|
return NULL;
|
|
|
|
}
|
2016-02-13 11:35:33 +00:00
|
|
|
/* C++ standard requires allocation functions to allocate memory suitably
|
|
|
|
* aligned for any standard type. This is 16 bytes for 64 bit platform as
|
|
|
|
* far as i concerned. We might over-align on 32bit here, but that should
|
|
|
|
* be all safe actually.
|
|
|
|
*/
|
|
|
|
return (T*)MEM_mallocN_aligned(size, 16, "Cycles Alloc");
|
2015-02-14 18:26:07 +00:00
|
|
|
#else
|
2016-02-13 11:35:33 +00:00
|
|
|
return (T*)malloc(size);
|
2015-02-14 18:26:07 +00:00
|
|
|
#endif
|
2015-02-14 13:03:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void deallocate(T *p, size_t n)
|
|
|
|
{
|
|
|
|
util_guarded_mem_free(n * sizeof(T));
|
2016-02-06 22:40:41 +00:00
|
|
|
if(p != NULL) {
|
2015-02-14 18:26:07 +00:00
|
|
|
#ifdef WITH_BLENDER_GUARDEDALLOC
|
2016-02-06 22:40:41 +00:00
|
|
|
MEM_freeN(p);
|
2015-02-14 18:26:07 +00:00
|
|
|
#else
|
2016-02-06 22:40:41 +00:00
|
|
|
free(p);
|
2015-02-14 18:26:07 +00:00
|
|
|
#endif
|
2016-02-06 22:40:41 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
T *address(T& x) const
|
|
|
|
{
|
|
|
|
return &x;
|
|
|
|
}
|
|
|
|
|
|
|
|
const T *address(const T& x) const
|
|
|
|
{
|
|
|
|
return &x;
|
|
|
|
}
|
|
|
|
|
|
|
|
GuardedAllocator<T>& operator=(const GuardedAllocator&)
|
|
|
|
{
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
void construct(T *p, const T& val)
|
|
|
|
{
|
|
|
|
new ((T *)p) T(val);
|
|
|
|
}
|
|
|
|
|
|
|
|
void destroy(T *p)
|
|
|
|
{
|
|
|
|
p->~T();
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t max_size() const
|
|
|
|
{
|
|
|
|
return size_t(-1);
|
2015-02-14 13:03:39 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
template <class U>
|
2016-02-06 22:40:41 +00:00
|
|
|
struct rebind {
|
|
|
|
typedef GuardedAllocator<U> other;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <class U>
|
|
|
|
GuardedAllocator(const GuardedAllocator<U>&) {}
|
|
|
|
|
|
|
|
template <class U>
|
|
|
|
GuardedAllocator& operator=(const GuardedAllocator<U>&) { return *this; }
|
2016-02-13 12:28:51 +00:00
|
|
|
|
2016-02-15 13:31:13 +00:00
|
|
|
inline bool operator==(GuardedAllocator const& /*other*/) const { return true; }
|
|
|
|
inline bool operator!=(GuardedAllocator const& other) const { return !operator==(other); }
|
2016-02-15 10:46:13 +00:00
|
|
|
|
|
|
|
#ifdef _MSC_VER
|
|
|
|
/* Welcome to the black magic here.
|
|
|
|
*
|
|
|
|
* The issue is that MSVC C++ allocates container proxy on any
|
|
|
|
* vector initialization, including static vectors which don't
|
|
|
|
* have any data yet. This leads to several issues:
|
|
|
|
*
|
|
|
|
* - Static objects initialization fiasco (global_stats from
|
|
|
|
* util_stats.h might not be initialized yet).
|
|
|
|
* - If main() function changes allocator type (for example,
|
|
|
|
* this might happen with `blender --debug-memory`) nobody
|
|
|
|
* will know how to convert already allocated memory to a new
|
|
|
|
* guarded allocator.
|
|
|
|
*
|
|
|
|
* Here we work this around by making it so container proxy does
|
|
|
|
* not use guarded allocation. A bit fragile, unfortunately.
|
|
|
|
*/
|
|
|
|
template<>
|
|
|
|
struct rebind<std::_Container_proxy> {
|
|
|
|
typedef std::allocator<std::_Container_proxy> other;
|
|
|
|
};
|
|
|
|
|
|
|
|
operator std::allocator<std::_Container_proxy>() const
|
|
|
|
{
|
|
|
|
return std::allocator<std::_Container_proxy>();
|
|
|
|
}
|
|
|
|
#endif
|
2015-02-14 13:03:39 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
/* Get memory usage and peak from the guarded STL allocator. */
|
|
|
|
size_t util_guarded_get_mem_used(void);
|
|
|
|
size_t util_guarded_get_mem_peak(void);
|
|
|
|
|
|
|
|
CCL_NAMESPACE_END
|
|
|
|
|
|
|
|
#endif /* __UTIL_GUARDED_ALLOCATOR_H__ */
|