mirror of
https://github.com/darlinghq/darling-libcxx.git
synced 2024-11-27 13:50:23 +00:00
7c3769df62
to reflect the new license. These used slightly different spellings that defeated my regular expressions. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@351648 91177308-0d34-0410-b5e6-96231b3b80d8
462 lines
12 KiB
C++
462 lines
12 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef MIN_ALLOCATOR_H
|
|
#define MIN_ALLOCATOR_H
|
|
|
|
#include <cstddef>
|
|
#include <cstdlib>
|
|
#include <cstddef>
|
|
#include <cassert>
|
|
#include <climits>
|
|
|
|
#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);}
|
|
};
|
|
|
|
template <class T>
|
|
struct cpp03_allocator : bare_allocator<T>
|
|
{
|
|
typedef T value_type;
|
|
typedef value_type* pointer;
|
|
|
|
static bool construct_called;
|
|
|
|
// Returned value is not used but it's not prohibited.
|
|
pointer construct(pointer p, const value_type& val)
|
|
{
|
|
::new(p) value_type(val);
|
|
construct_called = true;
|
|
return p;
|
|
}
|
|
|
|
std::size_t max_size() const
|
|
{
|
|
return UINT_MAX / sizeof(T);
|
|
}
|
|
};
|
|
template <class T> bool cpp03_allocator<T>::construct_called = false;
|
|
|
|
template <class T>
|
|
struct cpp03_overload_allocator : bare_allocator<T>
|
|
{
|
|
typedef T value_type;
|
|
typedef value_type* pointer;
|
|
|
|
static bool construct_called;
|
|
|
|
void construct(pointer p, const value_type& val)
|
|
{
|
|
construct(p, val, std::is_class<T>());
|
|
}
|
|
void construct(pointer p, const value_type& val, std::true_type)
|
|
{
|
|
::new(p) value_type(val);
|
|
construct_called = true;
|
|
}
|
|
void construct(pointer p, const value_type& val, std::false_type)
|
|
{
|
|
::new(p) value_type(val);
|
|
construct_called = true;
|
|
}
|
|
|
|
std::size_t max_size() const
|
|
{
|
|
return UINT_MAX / sizeof(T);
|
|
}
|
|
};
|
|
template <class T> bool cpp03_overload_allocator<T>::construct_called = false;
|
|
|
|
|
|
#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
|