head 1.2; access; symbols perseant-exfatfs-base-20250801:1.2 perseant-exfatfs-base-20240630:1.2 perseant-exfatfs:1.2.0.4 perseant-exfatfs-base:1.2 netbsd-8-3-RELEASE:1.1.1.3 netbsd-9-4-RELEASE:1.1.1.3 netbsd-9-3-RELEASE:1.1.1.3 cjep_sun2x:1.2.0.2 cjep_sun2x-base:1.2 cjep_staticlib_x-base1:1.2 netbsd-9-2-RELEASE:1.1.1.3 cjep_staticlib_x:1.1.1.3.0.22 cjep_staticlib_x-base:1.1.1.3 netbsd-9-1-RELEASE:1.1.1.3 phil-wifi-20200421:1.1.1.3 phil-wifi-20200411:1.1.1.3 is-mlppp:1.1.1.3.0.20 is-mlppp-base:1.1.1.3 phil-wifi-20200406:1.1.1.3 netbsd-8-2-RELEASE:1.1.1.3 netbsd-9-0-RELEASE:1.1.1.3 netbsd-9-0-RC2:1.1.1.3 netbsd-9-0-RC1:1.1.1.3 phil-wifi-20191119:1.1.1.3 netbsd-9:1.1.1.3.0.18 netbsd-9-base:1.1.1.3 phil-wifi-20190609:1.1.1.3 netbsd-8-1-RELEASE:1.1.1.3 netbsd-8-1-RC1:1.1.1.3 pgoyette-compat-merge-20190127:1.1.1.3 pgoyette-compat-20190127:1.1.1.3 pgoyette-compat-20190118:1.1.1.3 pgoyette-compat-1226:1.1.1.3 pgoyette-compat-1126:1.1.1.3 pgoyette-compat-1020:1.1.1.3 pgoyette-compat-0930:1.1.1.3 pgoyette-compat-0906:1.1.1.3 netbsd-7-2-RELEASE:1.1.1.2 pgoyette-compat-0728:1.1.1.3 netbsd-8-0-RELEASE:1.1.1.3 phil-wifi:1.1.1.3.0.16 phil-wifi-base:1.1.1.3 pgoyette-compat-0625:1.1.1.3 netbsd-8-0-RC2:1.1.1.3 pgoyette-compat-0521:1.1.1.3 pgoyette-compat-0502:1.1.1.3 pgoyette-compat-0422:1.1.1.3 netbsd-8-0-RC1:1.1.1.3 pgoyette-compat-0415:1.1.1.3 pgoyette-compat-0407:1.1.1.3 pgoyette-compat-0330:1.1.1.3 pgoyette-compat-0322:1.1.1.3 pgoyette-compat-0315:1.1.1.3 netbsd-7-1-2-RELEASE:1.1.1.2 pgoyette-compat:1.1.1.3.0.14 pgoyette-compat-base:1.1.1.3 netbsd-7-1-1-RELEASE:1.1.1.2 matt-nb8-mediatek:1.1.1.3.0.12 matt-nb8-mediatek-base:1.1.1.3 perseant-stdc-iso10646:1.1.1.3.0.10 perseant-stdc-iso10646-base:1.1.1.3 netbsd-8:1.1.1.3.0.8 netbsd-8-base:1.1.1.3 prg-localcount2-base3:1.1.1.3 prg-localcount2-base2:1.1.1.3 prg-localcount2-base1:1.1.1.3 prg-localcount2:1.1.1.3.0.6 prg-localcount2-base:1.1.1.3 pgoyette-localcount-20170426:1.1.1.3 bouyer-socketcan-base1:1.1.1.3 pgoyette-localcount-20170320:1.1.1.3 netbsd-7-1:1.1.1.2.0.12 netbsd-7-1-RELEASE:1.1.1.2 netbsd-7-1-RC2:1.1.1.2 netbsd-7-nhusb-base-20170116:1.1.1.2 bouyer-socketcan:1.1.1.3.0.4 bouyer-socketcan-base:1.1.1.3 pgoyette-localcount-20170107:1.1.1.3 netbsd-7-1-RC1:1.1.1.2 pgoyette-localcount-20161104:1.1.1.3 netbsd-7-0-2-RELEASE:1.1.1.2 localcount-20160914:1.1.1.3 netbsd-7-nhusb:1.1.1.2.0.10 netbsd-7-nhusb-base:1.1.1.2 pgoyette-localcount-20160806:1.1.1.3 pgoyette-localcount-20160726:1.1.1.3 pgoyette-localcount:1.1.1.3.0.2 pgoyette-localcount-base:1.1.1.3 netbsd-7-0-1-RELEASE:1.1.1.2 netbsd-7-0:1.1.1.2.0.8 netbsd-7-0-RELEASE:1.1.1.2 libcxx-245547:1.1.1.3 netbsd-7-0-RC3:1.1.1.2 netbsd-7-0-RC2:1.1.1.2 netbsd-7-0-RC1:1.1.1.2 tls-maxphys-base:1.1.1.2 tls-maxphys:1.1.1.2.0.6 netbsd-7:1.1.1.2.0.4 netbsd-7-base:1.1.1.2 libcxx-215289:1.1.1.2 libcxx-209785:1.1.1.2 yamt-pagecache:1.1.1.2.0.2 libcxx-208870:1.1.1.2 yamt-pagecache-base9:1.1.1.1 tls-earlyentropy:1.1.1.1.0.2 tls-earlyentropy-base:1.1.1.2 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.1 riastradh-drm2-base3:1.1.1.1 libcxx-198773:1.1.1.1 libcxx-198452:1.1.1.1 LLVM:1.1.1; locks; strict; comment @ * @; 1.2 date 2021.05.30.03.31.07; author joerg; state dead; branches; next 1.1; commitid Z2BWNc6JrDmRz7VC; 1.1 date 2014.01.04.21.32.06; author joerg; state Exp; branches 1.1.1.1; next ; commitid gAL45VqEe0AdtQjx; 1.1.1.1 date 2014.01.04.21.32.06; author joerg; state Exp; branches 1.1.1.1.2.1; next 1.1.1.2; commitid gAL45VqEe0AdtQjx; 1.1.1.2 date 2014.05.15.23.53.13; author joerg; state Exp; branches 1.1.1.2.2.1 1.1.1.2.6.1; next 1.1.1.3; commitid GaGFKjw76FPm2HAx; 1.1.1.3 date 2015.08.20.09.31.53; author joerg; state Exp; branches 1.1.1.3.22.1; next ; commitid ejnZ8WhR0kK5qZxy; 1.1.1.1.2.1 date 2014.08.10.07.07.33; author tls; state Exp; branches; next ; commitid xYWlO1qKJE4jGMLx; 1.1.1.2.2.1 date 2014.05.15.23.53.13; author yamt; state dead; branches; next 1.1.1.2.2.2; commitid 5gylMoBTXvvB7yBx; 1.1.1.2.2.2 date 2014.05.22.15.47.20; author yamt; state Exp; branches; next ; commitid 5gylMoBTXvvB7yBx; 1.1.1.2.6.1 date 2014.05.15.23.53.13; author tls; state dead; branches; next 1.1.1.2.6.2; commitid jTnpym9Qu0o4R1Nx; 1.1.1.2.6.2 date 2014.08.19.23.47.08; author tls; state Exp; branches; next ; commitid jTnpym9Qu0o4R1Nx; 1.1.1.3.22.1 date 2021.05.31.22.14.25; author cjep; state dead; branches; next ; commitid eWz9SBW0XqKjJlVC; desc @@ 1.2 log @Remove old version of libc++, migrated to external/apache2/dist/libcxx to match the rest of the mono-repo imports. @ text @#ifndef ALLOCATORS_H #define ALLOCATORS_H #include #include #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template class A1 { int id_; public: explicit A1(int id = 0) : id_(id) {} typedef T value_type; int id() const {return id_;} static bool copy_called; static bool move_called; static bool allocate_called; static std::pair deallocate_called; A1(const A1& a) : id_(a.id()) {copy_called = true;} A1(A1&& a) : id_(a.id()) {move_called = true;} template A1(const A1& a) : id_(a.id()) {copy_called = true;} template A1(A1&& a) : id_(a.id()) {move_called = true;} T* allocate(std::size_t n) { allocate_called = true; return (T*)n; } void deallocate(T* p, std::size_t n) { deallocate_called = std::pair(p, n); } std::size_t max_size() const {return id_;} }; template bool A1::copy_called = false; template bool A1::move_called = false; template bool A1::allocate_called = false; template std::pair A1::deallocate_called; template inline bool operator==(const A1& x, const A1& y) { return x.id() == y.id(); } template inline bool operator!=(const A1& x, const A1& y) { return !(x == y); } template class A2 { int id_; public: explicit A2(int id = 0) : id_(id) {} typedef T value_type; typedef unsigned size_type; typedef int difference_type; typedef std::true_type propagate_on_container_move_assignment; int id() const {return id_;} static bool copy_called; static bool move_called; static bool allocate_called; A2(const A2& a) : id_(a.id()) {copy_called = true;} A2(A2&& a) : id_(a.id()) {move_called = true;} T* allocate(std::size_t n, const void* hint) { allocate_called = true; return (T*)hint; } }; template bool A2::copy_called = false; template bool A2::move_called = false; template bool A2::allocate_called = false; template inline bool operator==(const A2& x, const A2& y) { return x.id() == y.id(); } template inline bool operator!=(const A2& x, const A2& y) { return !(x == y); } template class A3 { int id_; public: explicit A3(int id = 0) : id_(id) {} typedef T value_type; typedef std::true_type propagate_on_container_copy_assignment; typedef std::true_type propagate_on_container_swap; int id() const {return id_;} static bool copy_called; static bool move_called; static bool constructed; static bool destroy_called; A3(const A3& a) : id_(a.id()) {copy_called = true;} A3(A3&& a) : id_(a.id()) {move_called = true;} template void construct(U* p, Args&& ...args) { ::new (p) U(std::forward(args)...); constructed = true; } template void destroy(U* p) { p->~U(); destroy_called = true; } A3 select_on_container_copy_construction() const {return A3(-1);} }; template bool A3::copy_called = false; template bool A3::move_called = false; template bool A3::constructed = false; template bool A3::destroy_called = false; template inline bool operator==(const A3& x, const A3& y) { return x.id() == y.id(); } template inline bool operator!=(const A3& x, const A3& y) { return !(x == y); } #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES #endif // ALLOCATORS_H @ 1.1 log @Initial revision @ text @@ 1.1.1.1 log @Import r198452 of libc++. Primarily avoids C style casts and adds a number of cleanups. @ text @@ 1.1.1.1.2.1 log @Rebase. @ text @a0 9 //===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// @ 1.1.1.2 log @Import libc++ r208870. Improves const use, fixes a few cases of missing assign-to-self support and increase support for GCC. @ text @a0 9 //===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// @ 1.1.1.3 log @Import libc++ r245547. Various bugfixes, improvements to the C++14 support and some experimental features from the library standard track. @ text @a15 2 #include "test_macros.h" d23 1 a23 1 explicit A1(int id = 0) TEST_NOEXCEPT : id_(id) {} d34 2 a35 2 A1(const A1& a) TEST_NOEXCEPT : id_(a.id()) {copy_called = true;} A1(A1&& a) TEST_NOEXCEPT : id_(a.id()) {move_called = true;} d38 1 a38 1 A1(const A1& a) TEST_NOEXCEPT : id_(a.id()) {copy_called = true;} d40 1 a40 1 A1(A1&& a) TEST_NOEXCEPT : id_(a.id()) {move_called = true;} d80 1 a80 1 explicit A2(int id = 0) TEST_NOEXCEPT : id_(id) {} d95 2 a96 2 A2(const A2& a) TEST_NOEXCEPT : id_(a.id()) {copy_called = true;} A2(A2&& a) TEST_NOEXCEPT : id_(a.id()) {move_called = true;} d128 1 a128 1 explicit A3(int id = 0) TEST_NOEXCEPT : id_(id) {} d142 2 a143 2 A3(const A3& a) TEST_NOEXCEPT : id_(a.id()) {copy_called = true;} A3(A3&& a) TEST_NOEXCEPT: id_(a.id()) {move_called = true;} @ 1.1.1.3.22.1 log @sync with head @ text @@ 1.1.1.2.6.1 log @file allocators.h was added on branch tls-maxphys on 2014-08-19 23:47:08 +0000 @ text @d1 183 @ 1.1.1.2.6.2 log @Rebase to HEAD as of a few days ago. @ text @a0 183 //===----------------------------------------------------------------------===// // // 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 ALLOCATORS_H #define ALLOCATORS_H #include #include #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template class A1 { int id_; public: explicit A1(int id = 0) : id_(id) {} typedef T value_type; int id() const {return id_;} static bool copy_called; static bool move_called; static bool allocate_called; static std::pair deallocate_called; A1(const A1& a) : id_(a.id()) {copy_called = true;} A1(A1&& a) : id_(a.id()) {move_called = true;} template A1(const A1& a) : id_(a.id()) {copy_called = true;} template A1(A1&& a) : id_(a.id()) {move_called = true;} T* allocate(std::size_t n) { allocate_called = true; return (T*)n; } void deallocate(T* p, std::size_t n) { deallocate_called = std::pair(p, n); } std::size_t max_size() const {return id_;} }; template bool A1::copy_called = false; template bool A1::move_called = false; template bool A1::allocate_called = false; template std::pair A1::deallocate_called; template inline bool operator==(const A1& x, const A1& y) { return x.id() == y.id(); } template inline bool operator!=(const A1& x, const A1& y) { return !(x == y); } template class A2 { int id_; public: explicit A2(int id = 0) : id_(id) {} typedef T value_type; typedef unsigned size_type; typedef int difference_type; typedef std::true_type propagate_on_container_move_assignment; int id() const {return id_;} static bool copy_called; static bool move_called; static bool allocate_called; A2(const A2& a) : id_(a.id()) {copy_called = true;} A2(A2&& a) : id_(a.id()) {move_called = true;} T* allocate(std::size_t n, const void* hint) { allocate_called = true; return (T*)hint; } }; template bool A2::copy_called = false; template bool A2::move_called = false; template bool A2::allocate_called = false; template inline bool operator==(const A2& x, const A2& y) { return x.id() == y.id(); } template inline bool operator!=(const A2& x, const A2& y) { return !(x == y); } template class A3 { int id_; public: explicit A3(int id = 0) : id_(id) {} typedef T value_type; typedef std::true_type propagate_on_container_copy_assignment; typedef std::true_type propagate_on_container_swap; int id() const {return id_;} static bool copy_called; static bool move_called; static bool constructed; static bool destroy_called; A3(const A3& a) : id_(a.id()) {copy_called = true;} A3(A3&& a) : id_(a.id()) {move_called = true;} template void construct(U* p, Args&& ...args) { ::new (p) U(std::forward(args)...); constructed = true; } template void destroy(U* p) { p->~U(); destroy_called = true; } A3 select_on_container_copy_construction() const {return A3(-1);} }; template bool A3::copy_called = false; template bool A3::move_called = false; template bool A3::constructed = false; template bool A3::destroy_called = false; template inline bool operator==(const A3& x, const A3& y) { return x.id() == y.id(); } template inline bool operator!=(const A3& x, const A3& y) { return !(x == y); } #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES #endif // ALLOCATORS_H @ 1.1.1.2.2.1 log @file allocators.h was added on branch yamt-pagecache on 2014-05-22 15:47:20 +0000 @ text @d1 183 @ 1.1.1.2.2.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 174 #ifndef ALLOCATORS_H #define ALLOCATORS_H #include #include #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template class A1 { int id_; public: explicit A1(int id = 0) : id_(id) {} typedef T value_type; int id() const {return id_;} static bool copy_called; static bool move_called; static bool allocate_called; static std::pair deallocate_called; A1(const A1& a) : id_(a.id()) {copy_called = true;} A1(A1&& a) : id_(a.id()) {move_called = true;} template A1(const A1& a) : id_(a.id()) {copy_called = true;} template A1(A1&& a) : id_(a.id()) {move_called = true;} T* allocate(std::size_t n) { allocate_called = true; return (T*)n; } void deallocate(T* p, std::size_t n) { deallocate_called = std::pair(p, n); } std::size_t max_size() const {return id_;} }; template bool A1::copy_called = false; template bool A1::move_called = false; template bool A1::allocate_called = false; template std::pair A1::deallocate_called; template inline bool operator==(const A1& x, const A1& y) { return x.id() == y.id(); } template inline bool operator!=(const A1& x, const A1& y) { return !(x == y); } template class A2 { int id_; public: explicit A2(int id = 0) : id_(id) {} typedef T value_type; typedef unsigned size_type; typedef int difference_type; typedef std::true_type propagate_on_container_move_assignment; int id() const {return id_;} static bool copy_called; static bool move_called; static bool allocate_called; A2(const A2& a) : id_(a.id()) {copy_called = true;} A2(A2&& a) : id_(a.id()) {move_called = true;} T* allocate(std::size_t n, const void* hint) { allocate_called = true; return (T*)hint; } }; template bool A2::copy_called = false; template bool A2::move_called = false; template bool A2::allocate_called = false; template inline bool operator==(const A2& x, const A2& y) { return x.id() == y.id(); } template inline bool operator!=(const A2& x, const A2& y) { return !(x == y); } template class A3 { int id_; public: explicit A3(int id = 0) : id_(id) {} typedef T value_type; typedef std::true_type propagate_on_container_copy_assignment; typedef std::true_type propagate_on_container_swap; int id() const {return id_;} static bool copy_called; static bool move_called; static bool constructed; static bool destroy_called; A3(const A3& a) : id_(a.id()) {copy_called = true;} A3(A3&& a) : id_(a.id()) {move_called = true;} template void construct(U* p, Args&& ...args) { ::new (p) U(std::forward(args)...); constructed = true; } template void destroy(U* p) { p->~U(); destroy_called = true; } A3 select_on_container_copy_construction() const {return A3(-1);} }; template bool A3::copy_called = false; template bool A3::move_called = false; template bool A3::constructed = false; template bool A3::destroy_called = false; template inline bool operator==(const A3& x, const A3& y) { return x.id() == y.id(); } template inline bool operator!=(const A3& x, const A3& y) { return !(x == y); } #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES #endif // ALLOCATORS_H @