mirror of
https://github.com/Xahau/xahaud.git
synced 2025-11-19 18:15:50 +00:00
43 lines
1.2 KiB
C++
43 lines
1.2 KiB
C++
//
|
|
// Allocator that locks its contents from being paged
|
|
// out of memory and clears its contents before deletion.
|
|
//
|
|
template<typename T>
|
|
struct secure_allocator : public std::allocator<T>
|
|
{
|
|
// MSVC8 default copy constructor is broken
|
|
typedef std::allocator<T> base;
|
|
typedef typename base::size_type size_type;
|
|
typedef typename base::difference_type difference_type;
|
|
typedef typename base::pointer pointer;
|
|
typedef typename base::const_pointer const_pointer;
|
|
typedef typename base::reference reference;
|
|
typedef typename base::const_reference const_reference;
|
|
typedef typename base::value_type value_type;
|
|
secure_allocator() throw() {}
|
|
secure_allocator(const secure_allocator& a) throw() : base(a) {}
|
|
template <typename U>
|
|
secure_allocator(const secure_allocator<U>& a) throw() : base(a) {}
|
|
~secure_allocator() throw() {}
|
|
template<typename _Other> struct rebind
|
|
{ typedef secure_allocator<_Other> other; };
|
|
|
|
T* allocate(std::size_t n, const void *hint = 0)
|
|
{
|
|
T *p;
|
|
p = std::allocator<T>::allocate(n, hint);
|
|
if (p != NULL)
|
|
mlock(p, sizeof(T) * n);
|
|
return p;
|
|
}
|
|
|
|
void deallocate(T* p, std::size_t n)
|
|
{
|
|
if (p != NULL)
|
|
{
|
|
memset(p, 0, sizeof(T) * n);
|
|
munlock(p, sizeof(T) * n);
|
|
}
|
|
std::allocator<T>::deallocate(p, n);
|
|
}
|
|
}; |