mirror of
https://github.com/freebsd/freebsd-src.git
synced 2026-10-30 12:25:10 +01:00
MFC r309126 (by emaste):
Correct lld llvm-tblgen dependency file name
MFC r309169:
Get rid of separate Subversion mergeinfo properties for llvm-dwarfdump
and llvm-lto. The mergeinfo confuses Subversion enormously, and these
directories will just use the mergeinfo for llvm itself.
MFC r312765:
Pull in r276136 from upstream llvm trunk (by Wei Mi):
Use ValueOffsetPair to enhance value reuse during SCEV expansion.
In D12090, the ExprValueMap was added to reuse existing value during
SCEV expansion. However, const folding and sext/zext distribution can
make the reuse still difficult.
A simplified case is: suppose we know S1 expands to V1 in
ExprValueMap, and
S1 = S2 + C_a
S3 = S2 + C_b
where C_a and C_b are different SCEVConstants. Then we'd like to
expand S3 as V1 - C_a + C_b instead of expanding S2 literally. It is
helpful when S2 is a complex SCEV expr and S2 has no entry in
ExprValueMap, which is usually caused by the fact that S3 is
generated from S1 after const folding.
In order to do that, we represent ExprValueMap as a mapping from SCEV
to ValueOffsetPair. We will save both S1->{V1, 0} and S2->{V1, C_a}
into the ExprValueMap when we create SCEV for V1. When S3 is
expanded, it will first expand S2 to V1 - C_a because of S2->{V1,
C_a} in the map, then expand S3 to V1 - C_a + C_b.
Differential Revision: https://reviews.llvm.org/D21313
This should fix assertion failures when building OpenCV >= 3.1.
PR: 215649
MFC r312831:
Revert r312765 for now, since it causes assertions when building
lang/spidermonkey24.
Reported by: antoine
PR: 215649
MFC r316511 (by jhb):
Add an implementation of __ffssi2() derived from __ffsdi2().
Newer versions of GCC include an __ffssi2() symbol in libgcc and the
compiler can emit calls to it in generated code. This is true for at
least GCC 6.2 when compiling world for mips and mips64.
Reviewed by: jmallett, dim
Sponsored by: DARPA / AFRL
Differential Revision: https://reviews.freebsd.org/D10086
MFC r318601 (by adrian):
[libcompiler-rt] add bswapdi2/bswapsi2
This is required for mips gcc 6.3 userland to build/run.
Reviewed by: emaste, dim
Approved by: emaste
Differential Revision: https://reviews.freebsd.org/D10838
MFC r318884 (by emaste):
lldb: map TRAP_CAP to a trace trap
In the absense of a more specific handler for TRAP_CAP (generated by
ENOTCAPABLE or ECAPMODE while in capability mode) treat it as a trace
trap.
Example usage (testing the bug in PR219173):
% proccontrol -m trapcap lldb usr.bin/hexdump/obj/hexdump -- -Cv -s 1 /bin/ls
...
(lldb) run
Process 12980 launching
Process 12980 launched: '.../usr.bin/hexdump/obj/hexdump' (x86_64)
Process 12980 stopped
* thread #1, stop reason = trace
frame #0: 0x0000004b80c65f1a libc.so.7`__sys_lseek + 10
...
In the future we should have LLDB control the trapcap procctl itself
(as it does with ASLR), as well as report a specific stop reason.
This change eliminates an assertion failure from LLDB for now.
MFC r319796:
Remove a few unneeded files from libllvm, libclang and liblldb.
MFC r319885 (by emaste):
lld: ELF: Fix ICF crash on absolute symbol relocations.
If two sections contained relocations to absolute symbols with the same
value we would crash when trying to access their sections. Add a check that
both symbols point to sections before accessing their sections, and treat
absolute symbols as equal if their values are equal.
Obtained from: LLD commit r292578
MFC r319918:
Revert r319796 for now, it can cause undefined references when linking
in some circumstances.
Reported by: Shawn Webb <[email protected]>
MFC r319957 (by emaste):
lld: Add armelf emulation mode
Obtained from: LLD r305375
MFC r321369:
Upgrade our copies of clang, llvm, lld, lldb, compiler-rt and libc++ to
5.0.0 (trunk r308421). Upstream has branched for the 5.0.0 release,
which should be in about a month. Please report bugs and regressions,
so we can get them into the release.
Please note that from 3.5.0 onwards, clang, llvm and lldb require C++11
support to build; see UPDATING for more information.
MFC r321420:
Add a few more object files to liblldb, which should solve errors when
linking the lldb executable in some cases. In particular, when the
-ffunction-sections -fdata-sections options are turned off, or
ineffective.
Reported by: Shawn Webb, Mark Millard
MFC r321433:
Cleanup stale Options.inc files from the previous libllvm build for
clang 4.0.0. Otherwise, these can get included before the two newly
generated ones (which are different) for clang 5.0.0.
Reported by: Mark Millard
MFC r321439 (by bdrewery):
Move llvm Options.inc hack from r321433 for NO_CLEAN to lib/clang/libllvm.
The files are only ever generated to .OBJDIR, not to WORLDTMP (as a
sysroot) and are only ever included from a compilation. So using
a beforebuild target here removes the file before the compilation
tries to include it.
MFC r321664:
Pull in r308891 from upstream llvm trunk (by Benjamin Kramer):
[CodeGenPrepare] Cut off FindAllMemoryUses if there are too many uses.
This avoids excessive compile time. The case I'm looking at is
Function.cpp from an old version of LLVM that still had the giant
memcmp string matcher in it. Before r308322 this compiled in about 2
minutes, after it, clang takes infinite* time to compile it. With
this patch we're at 5 min, which is still bad but this is a
pathological case.
The cut off at 20 uses was chosen by looking at other cut-offs in LLVM
for user scanning. It's probably too high, but does the job and is
very unlikely to regress anything.
Fixes PR33900.
* I'm impatient and aborted after 15 minutes, on the bug report it was
killed after 2h.
Pull in r308986 from upstream llvm trunk (by Simon Pilgrim):
[X86][CGP] Reduce memcmp() expansion to 2 load pairs (PR33914)
D35067/rL308322 attempted to support up to 4 load pairs for memcmp
inlining which resulted in regressions for some optimized libc memcmp
implementations (PR33914).
Until we can match these more optimal cases, this patch reduces the
memcmp expansion to a maximum of 2 load pairs (which matches what we
do for -Os).
This patch should be considered for the 5.0.0 release branch as well
Differential Revision: https://reviews.llvm.org/D35830
These fix a hang (or extremely long compile time) when building older
LLVM ports.
Reported by: antoine
PR: 219139
MFC r321719:
Pull in r309503 from upstream clang trunk (by Richard Smith):
PR33902: Invalidate line number cache when adding more text to
existing buffer.
This led to crashes as the line number cache would report a bogus
line number for a line of code, and we'd try to find a nonexistent
column within the line when printing diagnostics.
This fixes an assertion when building the graphics/champlain port.
Reported by: antoine, kwm
PR: 219139
MFC r321723:
Upgrade our copies of clang, llvm, lld and lldb to r309439 from the
upstream release_50 branch. This is just after upstream's 5.0.0-rc1.
MFC r322320:
Upgrade our copies of clang, llvm and libc++ to r310316 from the
upstream release_50 branch.
MFC r322326 (by emaste):
lldb: Make i386-*-freebsd expression work on JIT path
* Enable i386 ABI creation for freebsd
* Added an extra argument in ABISysV_i386::PrepareTrivialCall for mmap
syscall
* Unlike linux, the last argument of mmap is actually 64-bit(off_t).
This requires us to push an additional word for the higher order bits.
* Prior to this change, ktrace dump will show mmap failures due to
invalid argument coming from the 6th mmap argument.
Submitted by: Karnajit Wangkhem
Differential Revision: https://reviews.llvm.org/D34776
MFC r322360 (by emaste):
lldb: Report inferior signals as signals, not exceptions, on FreeBSD
This is the FreeBSD equivalent of LLVM r238549.
This serves 2 purposes:
* LLDB should handle inferior process signals SIGSEGV/SIGILL/SIGBUS/
SIGFPE the way it is suppose to be handled. Prior to this fix these
signals will neither create a coredump, nor exit from the debugger
or work for signal handling scenario.
* eInvalidCrashReason need not report "unknown crash reason" if we have
a valid si_signo
llvm.org/pr23699
Patch by Karnajit Wangkhem
Differential Revision: https://reviews.llvm.org/D35223
Submitted by: Karnajit Wangkhem
Obtained from: LLVM r310591
MFC r322474 (by emaste):
lld: Add `-z muldefs` option.
Obtained from: LLVM r310757
MFC r322740:
Upgrade our copies of clang, llvm, lld and libc++ to r311219 from the
upstream release_50 branch.
MFC r322855:
Upgrade our copies of clang, llvm, lldb and compiler-rt to r311606 from
the upstream release_50 branch.
As of this version, lib/msun's trig test should also work correctly
again (see bug 220989 for more information).
PR: 220989
MFC r323112:
Upgrade our copies of clang, llvm, lldb and compiler-rt to r312293 from
the upstream release_50 branch. This corresponds to 5.0.0 rc4.
As of this version, the cad/stepcode port should now compile in a more
reasonable time on i386 (see bug 221836 for more information).
PR: 221836
MFC r323245:
Upgrade our copies of clang, llvm, lld, lldb, compiler-rt and libc++ to
5.0.0 release (upstream r312559).
Release notes for llvm, clang and lld will be available here soon:
<http://releases.llvm.org/5.0.0/docs/ReleaseNotes.html>
<http://releases.llvm.org/5.0.0/tools/clang/docs/ReleaseNotes.html>
<http://releases.llvm.org/5.0.0/tools/lld/docs/ReleaseNotes.html>
Relnotes: yes
638 lines
21 KiB
C++
638 lines
21 KiB
C++
// -*- C++ -*-
|
|
#ifndef _LIBCPP_SPLIT_BUFFER
|
|
#define _LIBCPP_SPLIT_BUFFER
|
|
|
|
#include <__config>
|
|
#include <type_traits>
|
|
#include <algorithm>
|
|
|
|
#if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
|
|
#pragma GCC system_header
|
|
#endif
|
|
|
|
_LIBCPP_PUSH_MACROS
|
|
#include <__undef_macros>
|
|
|
|
|
|
_LIBCPP_BEGIN_NAMESPACE_STD
|
|
|
|
template <bool>
|
|
class __split_buffer_common
|
|
{
|
|
protected:
|
|
void __throw_length_error() const;
|
|
void __throw_out_of_range() const;
|
|
};
|
|
|
|
template <class _Tp, class _Allocator = allocator<_Tp> >
|
|
struct __split_buffer
|
|
: private __split_buffer_common<true>
|
|
{
|
|
private:
|
|
__split_buffer(const __split_buffer&);
|
|
__split_buffer& operator=(const __split_buffer&);
|
|
public:
|
|
typedef _Tp value_type;
|
|
typedef _Allocator allocator_type;
|
|
typedef typename remove_reference<allocator_type>::type __alloc_rr;
|
|
typedef allocator_traits<__alloc_rr> __alloc_traits;
|
|
typedef value_type& reference;
|
|
typedef const value_type& const_reference;
|
|
typedef typename __alloc_traits::size_type size_type;
|
|
typedef typename __alloc_traits::difference_type difference_type;
|
|
typedef typename __alloc_traits::pointer pointer;
|
|
typedef typename __alloc_traits::const_pointer const_pointer;
|
|
typedef pointer iterator;
|
|
typedef const_pointer const_iterator;
|
|
|
|
pointer __first_;
|
|
pointer __begin_;
|
|
pointer __end_;
|
|
__compressed_pair<pointer, allocator_type> __end_cap_;
|
|
|
|
typedef typename add_lvalue_reference<allocator_type>::type __alloc_ref;
|
|
typedef typename add_lvalue_reference<allocator_type>::type __alloc_const_ref;
|
|
|
|
_LIBCPP_INLINE_VISIBILITY __alloc_rr& __alloc() _NOEXCEPT {return __end_cap_.second();}
|
|
_LIBCPP_INLINE_VISIBILITY const __alloc_rr& __alloc() const _NOEXCEPT {return __end_cap_.second();}
|
|
_LIBCPP_INLINE_VISIBILITY pointer& __end_cap() _NOEXCEPT {return __end_cap_.first();}
|
|
_LIBCPP_INLINE_VISIBILITY const pointer& __end_cap() const _NOEXCEPT {return __end_cap_.first();}
|
|
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
__split_buffer()
|
|
_NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value);
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
explicit __split_buffer(__alloc_rr& __a);
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
explicit __split_buffer(const __alloc_rr& __a);
|
|
__split_buffer(size_type __cap, size_type __start, __alloc_rr& __a);
|
|
~__split_buffer();
|
|
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
__split_buffer(__split_buffer&& __c)
|
|
_NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value);
|
|
__split_buffer(__split_buffer&& __c, const __alloc_rr& __a);
|
|
__split_buffer& operator=(__split_buffer&& __c)
|
|
_NOEXCEPT_((__alloc_traits::propagate_on_container_move_assignment::value &&
|
|
is_nothrow_move_assignable<allocator_type>::value) ||
|
|
!__alloc_traits::propagate_on_container_move_assignment::value);
|
|
#endif // _LIBCPP_CXX03_LANG
|
|
|
|
_LIBCPP_INLINE_VISIBILITY iterator begin() _NOEXCEPT {return __begin_;}
|
|
_LIBCPP_INLINE_VISIBILITY const_iterator begin() const _NOEXCEPT {return __begin_;}
|
|
_LIBCPP_INLINE_VISIBILITY iterator end() _NOEXCEPT {return __end_;}
|
|
_LIBCPP_INLINE_VISIBILITY const_iterator end() const _NOEXCEPT {return __end_;}
|
|
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
void clear() _NOEXCEPT
|
|
{__destruct_at_end(__begin_);}
|
|
_LIBCPP_INLINE_VISIBILITY size_type size() const {return static_cast<size_type>(__end_ - __begin_);}
|
|
_LIBCPP_INLINE_VISIBILITY bool empty() const {return __end_ == __begin_;}
|
|
_LIBCPP_INLINE_VISIBILITY size_type capacity() const {return static_cast<size_type>(__end_cap() - __first_);}
|
|
_LIBCPP_INLINE_VISIBILITY size_type __front_spare() const {return static_cast<size_type>(__begin_ - __first_);}
|
|
_LIBCPP_INLINE_VISIBILITY size_type __back_spare() const {return static_cast<size_type>(__end_cap() - __end_);}
|
|
|
|
_LIBCPP_INLINE_VISIBILITY reference front() {return *__begin_;}
|
|
_LIBCPP_INLINE_VISIBILITY const_reference front() const {return *__begin_;}
|
|
_LIBCPP_INLINE_VISIBILITY reference back() {return *(__end_ - 1);}
|
|
_LIBCPP_INLINE_VISIBILITY const_reference back() const {return *(__end_ - 1);}
|
|
|
|
void reserve(size_type __n);
|
|
void shrink_to_fit() _NOEXCEPT;
|
|
void push_front(const_reference __x);
|
|
_LIBCPP_INLINE_VISIBILITY void push_back(const_reference __x);
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
void push_front(value_type&& __x);
|
|
void push_back(value_type&& __x);
|
|
template <class... _Args>
|
|
void emplace_back(_Args&&... __args);
|
|
#endif // !defined(_LIBCPP_CXX03_LANG)
|
|
|
|
_LIBCPP_INLINE_VISIBILITY void pop_front() {__destruct_at_begin(__begin_+1);}
|
|
_LIBCPP_INLINE_VISIBILITY void pop_back() {__destruct_at_end(__end_-1);}
|
|
|
|
void __construct_at_end(size_type __n);
|
|
void __construct_at_end(size_type __n, const_reference __x);
|
|
template <class _InputIter>
|
|
typename enable_if
|
|
<
|
|
__is_input_iterator<_InputIter>::value &&
|
|
!__is_forward_iterator<_InputIter>::value,
|
|
void
|
|
>::type
|
|
__construct_at_end(_InputIter __first, _InputIter __last);
|
|
template <class _ForwardIterator>
|
|
typename enable_if
|
|
<
|
|
__is_forward_iterator<_ForwardIterator>::value,
|
|
void
|
|
>::type
|
|
__construct_at_end(_ForwardIterator __first, _ForwardIterator __last);
|
|
|
|
_LIBCPP_INLINE_VISIBILITY void __destruct_at_begin(pointer __new_begin)
|
|
{__destruct_at_begin(__new_begin, is_trivially_destructible<value_type>());}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
void __destruct_at_begin(pointer __new_begin, false_type);
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
void __destruct_at_begin(pointer __new_begin, true_type);
|
|
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
void __destruct_at_end(pointer __new_last) _NOEXCEPT
|
|
{__destruct_at_end(__new_last, false_type());}
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
void __destruct_at_end(pointer __new_last, false_type) _NOEXCEPT;
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
void __destruct_at_end(pointer __new_last, true_type) _NOEXCEPT;
|
|
|
|
void swap(__split_buffer& __x)
|
|
_NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value||
|
|
__is_nothrow_swappable<__alloc_rr>::value);
|
|
|
|
bool __invariants() const;
|
|
|
|
private:
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
void __move_assign_alloc(__split_buffer& __c, true_type)
|
|
_NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value)
|
|
{
|
|
__alloc() = _VSTD::move(__c.__alloc());
|
|
}
|
|
|
|
_LIBCPP_INLINE_VISIBILITY
|
|
void __move_assign_alloc(__split_buffer&, false_type) _NOEXCEPT
|
|
{}
|
|
};
|
|
|
|
template <class _Tp, class _Allocator>
|
|
bool
|
|
__split_buffer<_Tp, _Allocator>::__invariants() const
|
|
{
|
|
if (__first_ == nullptr)
|
|
{
|
|
if (__begin_ != nullptr)
|
|
return false;
|
|
if (__end_ != nullptr)
|
|
return false;
|
|
if (__end_cap() != nullptr)
|
|
return false;
|
|
}
|
|
else
|
|
{
|
|
if (__begin_ < __first_)
|
|
return false;
|
|
if (__end_ < __begin_)
|
|
return false;
|
|
if (__end_cap() < __end_)
|
|
return false;
|
|
}
|
|
return true;
|
|
}
|
|
|
|
// Default constructs __n objects starting at __end_
|
|
// throws if construction throws
|
|
// Precondition: __n > 0
|
|
// Precondition: size() + __n <= capacity()
|
|
// Postcondition: size() == size() + __n
|
|
template <class _Tp, class _Allocator>
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::__construct_at_end(size_type __n)
|
|
{
|
|
__alloc_rr& __a = this->__alloc();
|
|
do
|
|
{
|
|
__alloc_traits::construct(__a, _VSTD::__to_raw_pointer(this->__end_));
|
|
++this->__end_;
|
|
--__n;
|
|
} while (__n > 0);
|
|
}
|
|
|
|
// Copy constructs __n objects starting at __end_ from __x
|
|
// throws if construction throws
|
|
// Precondition: __n > 0
|
|
// Precondition: size() + __n <= capacity()
|
|
// Postcondition: size() == old size() + __n
|
|
// Postcondition: [i] == __x for all i in [size() - __n, __n)
|
|
template <class _Tp, class _Allocator>
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::__construct_at_end(size_type __n, const_reference __x)
|
|
{
|
|
__alloc_rr& __a = this->__alloc();
|
|
do
|
|
{
|
|
__alloc_traits::construct(__a, _VSTD::__to_raw_pointer(this->__end_), __x);
|
|
++this->__end_;
|
|
--__n;
|
|
} while (__n > 0);
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
template <class _InputIter>
|
|
typename enable_if
|
|
<
|
|
__is_input_iterator<_InputIter>::value &&
|
|
!__is_forward_iterator<_InputIter>::value,
|
|
void
|
|
>::type
|
|
__split_buffer<_Tp, _Allocator>::__construct_at_end(_InputIter __first, _InputIter __last)
|
|
{
|
|
__alloc_rr& __a = this->__alloc();
|
|
for (; __first != __last; ++__first)
|
|
{
|
|
if (__end_ == __end_cap())
|
|
{
|
|
size_type __old_cap = __end_cap() - __first_;
|
|
size_type __new_cap = _VSTD::max<size_type>(2 * __old_cap, 8);
|
|
__split_buffer __buf(__new_cap, 0, __a);
|
|
for (pointer __p = __begin_; __p != __end_; ++__p, ++__buf.__end_)
|
|
__alloc_traits::construct(__buf.__alloc(),
|
|
_VSTD::__to_raw_pointer(__buf.__end_), _VSTD::move(*__p));
|
|
swap(__buf);
|
|
}
|
|
__alloc_traits::construct(__a, _VSTD::__to_raw_pointer(this->__end_), *__first);
|
|
++this->__end_;
|
|
}
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
template <class _ForwardIterator>
|
|
typename enable_if
|
|
<
|
|
__is_forward_iterator<_ForwardIterator>::value,
|
|
void
|
|
>::type
|
|
__split_buffer<_Tp, _Allocator>::__construct_at_end(_ForwardIterator __first, _ForwardIterator __last)
|
|
{
|
|
__alloc_rr& __a = this->__alloc();
|
|
for (; __first != __last; ++__first)
|
|
{
|
|
__alloc_traits::construct(__a, _VSTD::__to_raw_pointer(this->__end_), *__first);
|
|
++this->__end_;
|
|
}
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
inline
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::__destruct_at_begin(pointer __new_begin, false_type)
|
|
{
|
|
while (__begin_ != __new_begin)
|
|
__alloc_traits::destroy(__alloc(), __to_raw_pointer(__begin_++));
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
inline
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::__destruct_at_begin(pointer __new_begin, true_type)
|
|
{
|
|
__begin_ = __new_begin;
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
inline _LIBCPP_INLINE_VISIBILITY
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::__destruct_at_end(pointer __new_last, false_type) _NOEXCEPT
|
|
{
|
|
while (__new_last != __end_)
|
|
__alloc_traits::destroy(__alloc(), __to_raw_pointer(--__end_));
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
inline _LIBCPP_INLINE_VISIBILITY
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::__destruct_at_end(pointer __new_last, true_type) _NOEXCEPT
|
|
{
|
|
__end_ = __new_last;
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
__split_buffer<_Tp, _Allocator>::__split_buffer(size_type __cap, size_type __start, __alloc_rr& __a)
|
|
: __end_cap_(nullptr, __a)
|
|
{
|
|
__first_ = __cap != 0 ? __alloc_traits::allocate(__alloc(), __cap) : nullptr;
|
|
__begin_ = __end_ = __first_ + __start;
|
|
__end_cap() = __first_ + __cap;
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
inline
|
|
__split_buffer<_Tp, _Allocator>::__split_buffer()
|
|
_NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
|
|
: __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr)
|
|
{
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
inline
|
|
__split_buffer<_Tp, _Allocator>::__split_buffer(__alloc_rr& __a)
|
|
: __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr, __a)
|
|
{
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
inline
|
|
__split_buffer<_Tp, _Allocator>::__split_buffer(const __alloc_rr& __a)
|
|
: __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr, __a)
|
|
{
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
__split_buffer<_Tp, _Allocator>::~__split_buffer()
|
|
{
|
|
clear();
|
|
if (__first_)
|
|
__alloc_traits::deallocate(__alloc(), __first_, capacity());
|
|
}
|
|
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
|
|
template <class _Tp, class _Allocator>
|
|
__split_buffer<_Tp, _Allocator>::__split_buffer(__split_buffer&& __c)
|
|
_NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value)
|
|
: __first_(_VSTD::move(__c.__first_)),
|
|
__begin_(_VSTD::move(__c.__begin_)),
|
|
__end_(_VSTD::move(__c.__end_)),
|
|
__end_cap_(_VSTD::move(__c.__end_cap_))
|
|
{
|
|
__c.__first_ = nullptr;
|
|
__c.__begin_ = nullptr;
|
|
__c.__end_ = nullptr;
|
|
__c.__end_cap() = nullptr;
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
__split_buffer<_Tp, _Allocator>::__split_buffer(__split_buffer&& __c, const __alloc_rr& __a)
|
|
: __end_cap_(__second_tag(), __a)
|
|
{
|
|
if (__a == __c.__alloc())
|
|
{
|
|
__first_ = __c.__first_;
|
|
__begin_ = __c.__begin_;
|
|
__end_ = __c.__end_;
|
|
__end_cap() = __c.__end_cap();
|
|
__c.__first_ = nullptr;
|
|
__c.__begin_ = nullptr;
|
|
__c.__end_ = nullptr;
|
|
__c.__end_cap() = nullptr;
|
|
}
|
|
else
|
|
{
|
|
size_type __cap = __c.size();
|
|
__first_ = __alloc_traits::allocate(__alloc(), __cap);
|
|
__begin_ = __end_ = __first_;
|
|
__end_cap() = __first_ + __cap;
|
|
typedef move_iterator<iterator> _Ip;
|
|
__construct_at_end(_Ip(__c.begin()), _Ip(__c.end()));
|
|
}
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
__split_buffer<_Tp, _Allocator>&
|
|
__split_buffer<_Tp, _Allocator>::operator=(__split_buffer&& __c)
|
|
_NOEXCEPT_((__alloc_traits::propagate_on_container_move_assignment::value &&
|
|
is_nothrow_move_assignable<allocator_type>::value) ||
|
|
!__alloc_traits::propagate_on_container_move_assignment::value)
|
|
{
|
|
clear();
|
|
shrink_to_fit();
|
|
__first_ = __c.__first_;
|
|
__begin_ = __c.__begin_;
|
|
__end_ = __c.__end_;
|
|
__end_cap() = __c.__end_cap();
|
|
__move_assign_alloc(__c,
|
|
integral_constant<bool,
|
|
__alloc_traits::propagate_on_container_move_assignment::value>());
|
|
__c.__first_ = __c.__begin_ = __c.__end_ = __c.__end_cap() = nullptr;
|
|
return *this;
|
|
}
|
|
|
|
#endif // _LIBCPP_CXX03_LANG
|
|
|
|
template <class _Tp, class _Allocator>
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::swap(__split_buffer& __x)
|
|
_NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value||
|
|
__is_nothrow_swappable<__alloc_rr>::value)
|
|
{
|
|
_VSTD::swap(__first_, __x.__first_);
|
|
_VSTD::swap(__begin_, __x.__begin_);
|
|
_VSTD::swap(__end_, __x.__end_);
|
|
_VSTD::swap(__end_cap(), __x.__end_cap());
|
|
__swap_allocator(__alloc(), __x.__alloc());
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::reserve(size_type __n)
|
|
{
|
|
if (__n < capacity())
|
|
{
|
|
__split_buffer<value_type, __alloc_rr&> __t(__n, 0, __alloc());
|
|
__t.__construct_at_end(move_iterator<pointer>(__begin_),
|
|
move_iterator<pointer>(__end_));
|
|
_VSTD::swap(__first_, __t.__first_);
|
|
_VSTD::swap(__begin_, __t.__begin_);
|
|
_VSTD::swap(__end_, __t.__end_);
|
|
_VSTD::swap(__end_cap(), __t.__end_cap());
|
|
}
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::shrink_to_fit() _NOEXCEPT
|
|
{
|
|
if (capacity() > size())
|
|
{
|
|
#ifndef _LIBCPP_NO_EXCEPTIONS
|
|
try
|
|
{
|
|
#endif // _LIBCPP_NO_EXCEPTIONS
|
|
__split_buffer<value_type, __alloc_rr&> __t(size(), 0, __alloc());
|
|
__t.__construct_at_end(move_iterator<pointer>(__begin_),
|
|
move_iterator<pointer>(__end_));
|
|
__t.__end_ = __t.__begin_ + (__end_ - __begin_);
|
|
_VSTD::swap(__first_, __t.__first_);
|
|
_VSTD::swap(__begin_, __t.__begin_);
|
|
_VSTD::swap(__end_, __t.__end_);
|
|
_VSTD::swap(__end_cap(), __t.__end_cap());
|
|
#ifndef _LIBCPP_NO_EXCEPTIONS
|
|
}
|
|
catch (...)
|
|
{
|
|
}
|
|
#endif // _LIBCPP_NO_EXCEPTIONS
|
|
}
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::push_front(const_reference __x)
|
|
{
|
|
if (__begin_ == __first_)
|
|
{
|
|
if (__end_ < __end_cap())
|
|
{
|
|
difference_type __d = __end_cap() - __end_;
|
|
__d = (__d + 1) / 2;
|
|
__begin_ = _VSTD::move_backward(__begin_, __end_, __end_ + __d);
|
|
__end_ += __d;
|
|
}
|
|
else
|
|
{
|
|
size_type __c = max<size_type>(2 * static_cast<size_t>(__end_cap() - __first_), 1);
|
|
__split_buffer<value_type, __alloc_rr&> __t(__c, (__c + 3) / 4, __alloc());
|
|
__t.__construct_at_end(move_iterator<pointer>(__begin_),
|
|
move_iterator<pointer>(__end_));
|
|
_VSTD::swap(__first_, __t.__first_);
|
|
_VSTD::swap(__begin_, __t.__begin_);
|
|
_VSTD::swap(__end_, __t.__end_);
|
|
_VSTD::swap(__end_cap(), __t.__end_cap());
|
|
}
|
|
}
|
|
__alloc_traits::construct(__alloc(), _VSTD::__to_raw_pointer(__begin_-1), __x);
|
|
--__begin_;
|
|
}
|
|
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
|
|
template <class _Tp, class _Allocator>
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::push_front(value_type&& __x)
|
|
{
|
|
if (__begin_ == __first_)
|
|
{
|
|
if (__end_ < __end_cap())
|
|
{
|
|
difference_type __d = __end_cap() - __end_;
|
|
__d = (__d + 1) / 2;
|
|
__begin_ = _VSTD::move_backward(__begin_, __end_, __end_ + __d);
|
|
__end_ += __d;
|
|
}
|
|
else
|
|
{
|
|
size_type __c = max<size_type>(2 * static_cast<size_t>(__end_cap() - __first_), 1);
|
|
__split_buffer<value_type, __alloc_rr&> __t(__c, (__c + 3) / 4, __alloc());
|
|
__t.__construct_at_end(move_iterator<pointer>(__begin_),
|
|
move_iterator<pointer>(__end_));
|
|
_VSTD::swap(__first_, __t.__first_);
|
|
_VSTD::swap(__begin_, __t.__begin_);
|
|
_VSTD::swap(__end_, __t.__end_);
|
|
_VSTD::swap(__end_cap(), __t.__end_cap());
|
|
}
|
|
}
|
|
__alloc_traits::construct(__alloc(), _VSTD::__to_raw_pointer(__begin_-1),
|
|
_VSTD::move(__x));
|
|
--__begin_;
|
|
}
|
|
|
|
#endif // _LIBCPP_CXX03_LANG
|
|
|
|
template <class _Tp, class _Allocator>
|
|
inline _LIBCPP_INLINE_VISIBILITY
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::push_back(const_reference __x)
|
|
{
|
|
if (__end_ == __end_cap())
|
|
{
|
|
if (__begin_ > __first_)
|
|
{
|
|
difference_type __d = __begin_ - __first_;
|
|
__d = (__d + 1) / 2;
|
|
__end_ = _VSTD::move(__begin_, __end_, __begin_ - __d);
|
|
__begin_ -= __d;
|
|
}
|
|
else
|
|
{
|
|
size_type __c = max<size_type>(2 * static_cast<size_t>(__end_cap() - __first_), 1);
|
|
__split_buffer<value_type, __alloc_rr&> __t(__c, __c / 4, __alloc());
|
|
__t.__construct_at_end(move_iterator<pointer>(__begin_),
|
|
move_iterator<pointer>(__end_));
|
|
_VSTD::swap(__first_, __t.__first_);
|
|
_VSTD::swap(__begin_, __t.__begin_);
|
|
_VSTD::swap(__end_, __t.__end_);
|
|
_VSTD::swap(__end_cap(), __t.__end_cap());
|
|
}
|
|
}
|
|
__alloc_traits::construct(__alloc(), _VSTD::__to_raw_pointer(__end_), __x);
|
|
++__end_;
|
|
}
|
|
|
|
#ifndef _LIBCPP_CXX03_LANG
|
|
|
|
template <class _Tp, class _Allocator>
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::push_back(value_type&& __x)
|
|
{
|
|
if (__end_ == __end_cap())
|
|
{
|
|
if (__begin_ > __first_)
|
|
{
|
|
difference_type __d = __begin_ - __first_;
|
|
__d = (__d + 1) / 2;
|
|
__end_ = _VSTD::move(__begin_, __end_, __begin_ - __d);
|
|
__begin_ -= __d;
|
|
}
|
|
else
|
|
{
|
|
size_type __c = max<size_type>(2 * static_cast<size_t>(__end_cap() - __first_), 1);
|
|
__split_buffer<value_type, __alloc_rr&> __t(__c, __c / 4, __alloc());
|
|
__t.__construct_at_end(move_iterator<pointer>(__begin_),
|
|
move_iterator<pointer>(__end_));
|
|
_VSTD::swap(__first_, __t.__first_);
|
|
_VSTD::swap(__begin_, __t.__begin_);
|
|
_VSTD::swap(__end_, __t.__end_);
|
|
_VSTD::swap(__end_cap(), __t.__end_cap());
|
|
}
|
|
}
|
|
__alloc_traits::construct(__alloc(), _VSTD::__to_raw_pointer(__end_),
|
|
_VSTD::move(__x));
|
|
++__end_;
|
|
}
|
|
|
|
template <class _Tp, class _Allocator>
|
|
template <class... _Args>
|
|
void
|
|
__split_buffer<_Tp, _Allocator>::emplace_back(_Args&&... __args)
|
|
{
|
|
if (__end_ == __end_cap())
|
|
{
|
|
if (__begin_ > __first_)
|
|
{
|
|
difference_type __d = __begin_ - __first_;
|
|
__d = (__d + 1) / 2;
|
|
__end_ = _VSTD::move(__begin_, __end_, __begin_ - __d);
|
|
__begin_ -= __d;
|
|
}
|
|
else
|
|
{
|
|
size_type __c = max<size_type>(2 * static_cast<size_t>(__end_cap() - __first_), 1);
|
|
__split_buffer<value_type, __alloc_rr&> __t(__c, __c / 4, __alloc());
|
|
__t.__construct_at_end(move_iterator<pointer>(__begin_),
|
|
move_iterator<pointer>(__end_));
|
|
_VSTD::swap(__first_, __t.__first_);
|
|
_VSTD::swap(__begin_, __t.__begin_);
|
|
_VSTD::swap(__end_, __t.__end_);
|
|
_VSTD::swap(__end_cap(), __t.__end_cap());
|
|
}
|
|
}
|
|
__alloc_traits::construct(__alloc(), _VSTD::__to_raw_pointer(__end_),
|
|
_VSTD::forward<_Args>(__args)...);
|
|
++__end_;
|
|
}
|
|
|
|
#endif // _LIBCPP_CXX03_LANG
|
|
|
|
template <class _Tp, class _Allocator>
|
|
inline _LIBCPP_INLINE_VISIBILITY
|
|
void
|
|
swap(__split_buffer<_Tp, _Allocator>& __x, __split_buffer<_Tp, _Allocator>& __y)
|
|
_NOEXCEPT_(_NOEXCEPT_(__x.swap(__y)))
|
|
{
|
|
__x.swap(__y);
|
|
}
|
|
|
|
_LIBCPP_END_NAMESPACE_STD
|
|
|
|
_LIBCPP_POP_MACROS
|
|
|
|
#endif // _LIBCPP_SPLIT_BUFFER
|