//===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is dual licensed under the MIT and the University of Illinois Open // Source Licenses. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// #ifndef MIN_ALLOCATOR_H #define MIN_ALLOCATOR_H #include <cstddef> #include <cstdlib> #include <cstddef> #include <cassert> #include "test_macros.h" template <class T> class bare_allocator { public: typedef T value_type; bare_allocator() TEST_NOEXCEPT {} template <class U> bare_allocator(bare_allocator<U>) TEST_NOEXCEPT {} T* allocate(std::size_t n) { return static_cast<T*>(::operator new(n*sizeof(T))); } void deallocate(T* p, std::size_t) { return ::operator delete(static_cast<void*>(p)); } friend bool operator==(bare_allocator, bare_allocator) {return true;} friend bool operator!=(bare_allocator x, bare_allocator y) {return !(x == y);} }; template <class T> class no_default_allocator { #if TEST_STD_VER >= 11 no_default_allocator() = delete; #else no_default_allocator(); #endif struct construct_tag {}; explicit no_default_allocator(construct_tag) {} public: static no_default_allocator create() { construct_tag tag; return no_default_allocator(tag); } public: typedef T value_type; template <class U> no_default_allocator(no_default_allocator<U>) TEST_NOEXCEPT {} T* allocate(std::size_t n) { return static_cast<T*>(::operator new(n*sizeof(T))); } void deallocate(T* p, std::size_t) { return ::operator delete(static_cast<void*>(p)); } friend bool operator==(no_default_allocator, no_default_allocator) {return true;} friend bool operator!=(no_default_allocator x, no_default_allocator y) {return !(x == y);} }; struct malloc_allocator_base { static size_t alloc_count; static size_t dealloc_count; static bool disable_default_constructor; static size_t outstanding_alloc() { assert(alloc_count >= dealloc_count); return (alloc_count - dealloc_count); } static void reset() { assert(outstanding_alloc() == 0); disable_default_constructor = false; alloc_count = 0; dealloc_count = 0; } }; size_t malloc_allocator_base::alloc_count = 0; size_t malloc_allocator_base::dealloc_count = 0; bool malloc_allocator_base::disable_default_constructor = false; template <class T> class malloc_allocator : public malloc_allocator_base { public: typedef T value_type; malloc_allocator() TEST_NOEXCEPT { assert(!disable_default_constructor); } template <class U> malloc_allocator(malloc_allocator<U>) TEST_NOEXCEPT {} T* allocate(std::size_t n) { ++alloc_count; return static_cast<T*>(std::malloc(n*sizeof(T))); } void deallocate(T* p, std::size_t) { ++dealloc_count; std::free(static_cast<void*>(p)); } friend bool operator==(malloc_allocator, malloc_allocator) {return true;} friend bool operator!=(malloc_allocator x, malloc_allocator y) {return !(x == y);} }; #if TEST_STD_VER >= 11 #include <memory> template <class T, class = std::integral_constant<size_t, 0> > class min_pointer; template <class T, class ID> class min_pointer<const T, ID>; template <class ID> class min_pointer<void, ID>; template <class ID> class min_pointer<const void, ID>; template <class T> class min_allocator; template <class ID> class min_pointer<const void, ID> { const void* ptr_; public: min_pointer() TEST_NOEXCEPT = default; min_pointer(std::nullptr_t) TEST_NOEXCEPT : ptr_(nullptr) {} template <class T> min_pointer(min_pointer<T, ID> p) TEST_NOEXCEPT : ptr_(p.ptr_) {} explicit operator bool() const {return ptr_ != nullptr;} friend bool operator==(min_pointer x, min_pointer y) {return x.ptr_ == y.ptr_;} friend bool operator!=(min_pointer x, min_pointer y) {return !(x == y);} template <class U, class XID> friend class min_pointer; }; template <class ID> class min_pointer<void, ID> { void* ptr_; public: min_pointer() TEST_NOEXCEPT = default; min_pointer(std::nullptr_t) TEST_NOEXCEPT : ptr_(nullptr) {} template <class T, class = typename std::enable_if < !std::is_const<T>::value >::type > min_pointer(min_pointer<T, ID> p) TEST_NOEXCEPT : ptr_(p.ptr_) {} explicit operator bool() const {return ptr_ != nullptr;} friend bool operator==(min_pointer x, min_pointer y) {return x.ptr_ == y.ptr_;} friend bool operator!=(min_pointer x, min_pointer y) {return !(x == y);} template <class U, class XID> friend class min_pointer; }; template <class T, class ID> class min_pointer { T* ptr_; explicit min_pointer(T* p) TEST_NOEXCEPT : ptr_(p) {} public: min_pointer() TEST_NOEXCEPT = default; min_pointer(std::nullptr_t) TEST_NOEXCEPT : ptr_(nullptr) {} explicit min_pointer(min_pointer<void, ID> p) TEST_NOEXCEPT : ptr_(static_cast<T*>(p.ptr_)) {} explicit operator bool() const {return ptr_ != nullptr;} typedef std::ptrdiff_t difference_type; typedef T& reference; typedef T* pointer; typedef T value_type; typedef std::random_access_iterator_tag iterator_category; reference operator*() const {return *ptr_;} pointer operator->() const {return ptr_;} min_pointer& operator++() {++ptr_; return *this;} min_pointer operator++(int) {min_pointer tmp(*this); ++ptr_; return tmp;} min_pointer& operator--() {--ptr_; return *this;} min_pointer operator--(int) {min_pointer tmp(*this); --ptr_; return tmp;} min_pointer& operator+=(difference_type n) {ptr_ += n; return *this;} min_pointer& operator-=(difference_type n) {ptr_ -= n; return *this;} min_pointer operator+(difference_type n) const { min_pointer tmp(*this); tmp += n; return tmp; } friend min_pointer operator+(difference_type n, min_pointer x) { return x + n; } min_pointer operator-(difference_type n) const { min_pointer tmp(*this); tmp -= n; return tmp; } friend difference_type operator-(min_pointer x, min_pointer y) { return x.ptr_ - y.ptr_; } reference operator[](difference_type n) const {return ptr_[n];} friend bool operator< (min_pointer x, min_pointer y) {return x.ptr_ < y.ptr_;} friend bool operator> (min_pointer x, min_pointer y) {return y < x;} friend bool operator<=(min_pointer x, min_pointer y) {return !(y < x);} friend bool operator>=(min_pointer x, min_pointer y) {return !(x < y);} static min_pointer pointer_to(T& t) {return min_pointer(std::addressof(t));} friend bool operator==(min_pointer x, min_pointer y) {return x.ptr_ == y.ptr_;} friend bool operator!=(min_pointer x, min_pointer y) {return !(x == y);} template <class U, class XID> friend class min_pointer; template <class U> friend class min_allocator; }; template <class T, class ID> class min_pointer<const T, ID> { const T* ptr_; explicit min_pointer(const T* p) : ptr_(p) {} public: min_pointer() TEST_NOEXCEPT = default; min_pointer(std::nullptr_t) : ptr_(nullptr) {} min_pointer(min_pointer<T, ID> p) : ptr_(p.ptr_) {} explicit min_pointer(min_pointer<const void, ID> p) : ptr_(static_cast<const T*>(p.ptr_)) {} explicit operator bool() const {return ptr_ != nullptr;} typedef std::ptrdiff_t difference_type; typedef const T& reference; typedef const T* pointer; typedef const T value_type; typedef std::random_access_iterator_tag iterator_category; reference operator*() const {return *ptr_;} pointer operator->() const {return ptr_;} min_pointer& operator++() {++ptr_; return *this;} min_pointer operator++(int) {min_pointer tmp(*this); ++ptr_; return tmp;} min_pointer& operator--() {--ptr_; return *this;} min_pointer operator--(int) {min_pointer tmp(*this); --ptr_; return tmp;} min_pointer& operator+=(difference_type n) {ptr_ += n; return *this;} min_pointer& operator-=(difference_type n) {ptr_ -= n; return *this;} min_pointer operator+(difference_type n) const { min_pointer tmp(*this); tmp += n; return tmp; } friend min_pointer operator+(difference_type n, min_pointer x) { return x + n; } min_pointer operator-(difference_type n) const { min_pointer tmp(*this); tmp -= n; return tmp; } friend difference_type operator-(min_pointer x, min_pointer y) { return x.ptr_ - y.ptr_; } reference operator[](difference_type n) const {return ptr_[n];} friend bool operator< (min_pointer x, min_pointer y) {return x.ptr_ < y.ptr_;} friend bool operator> (min_pointer x, min_pointer y) {return y < x;} friend bool operator<=(min_pointer x, min_pointer y) {return !(y < x);} friend bool operator>=(min_pointer x, min_pointer y) {return !(x < y);} static min_pointer pointer_to(const T& t) {return min_pointer(std::addressof(t));} friend bool operator==(min_pointer x, min_pointer y) {return x.ptr_ == y.ptr_;} friend bool operator!=(min_pointer x, min_pointer y) {return !(x == y);} template <class U, class XID> friend class min_pointer; }; template <class T, class ID> inline bool operator==(min_pointer<T, ID> x, std::nullptr_t) { return !static_cast<bool>(x); } template <class T, class ID> inline bool operator==(std::nullptr_t, min_pointer<T, ID> x) { return !static_cast<bool>(x); } template <class T, class ID> inline bool operator!=(min_pointer<T, ID> x, std::nullptr_t) { return static_cast<bool>(x); } template <class T, class ID> inline bool operator!=(std::nullptr_t, min_pointer<T, ID> x) { return static_cast<bool>(x); } template <class T> class min_allocator { public: typedef T value_type; typedef min_pointer<T> pointer; min_allocator() = default; template <class U> min_allocator(min_allocator<U>) {} pointer allocate(std::ptrdiff_t n) { return pointer(static_cast<T*>(::operator new(n*sizeof(T)))); } void deallocate(pointer p, std::ptrdiff_t) { return ::operator delete(p.ptr_); } friend bool operator==(min_allocator, min_allocator) {return true;} friend bool operator!=(min_allocator x, min_allocator y) {return !(x == y);} }; template <class T> class explicit_allocator { public: typedef T value_type; explicit_allocator() TEST_NOEXCEPT {} template <class U> explicit explicit_allocator(explicit_allocator<U>) TEST_NOEXCEPT {} T* allocate(std::size_t n) { return static_cast<T*>(::operator new(n*sizeof(T))); } void deallocate(T* p, std::size_t) { return ::operator delete(static_cast<void*>(p)); } friend bool operator==(explicit_allocator, explicit_allocator) {return true;} friend bool operator!=(explicit_allocator x, explicit_allocator y) {return !(x == y);} }; #endif // TEST_STD_VER >= 11 #endif // MIN_ALLOCATOR_H