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.34 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.32 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.30 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.3 pgoyette-compat-0728:1.1.1.3 netbsd-8-0-RELEASE:1.1.1.3 phil-wifi:1.1.1.3.0.28 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.3 pgoyette-compat:1.1.1.3.0.26 pgoyette-compat-base:1.1.1.3 netbsd-7-1-1-RELEASE:1.1.1.3 matt-nb8-mediatek:1.1.1.3.0.24 matt-nb8-mediatek-base:1.1.1.3 perseant-stdc-iso10646:1.1.1.3.0.22 perseant-stdc-iso10646-base:1.1.1.3 netbsd-8:1.1.1.3.0.20 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.18 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.3.0.16 netbsd-7-1-RELEASE:1.1.1.3 netbsd-7-1-RC2:1.1.1.3 netbsd-7-nhusb-base-20170116:1.1.1.3 bouyer-socketcan:1.1.1.3.0.14 bouyer-socketcan-base:1.1.1.3 pgoyette-localcount-20170107:1.1.1.3 netbsd-7-1-RC1:1.1.1.3 pgoyette-localcount-20161104:1.1.1.3 netbsd-7-0-2-RELEASE:1.1.1.3 localcount-20160914:1.1.1.3 netbsd-7-nhusb:1.1.1.3.0.12 netbsd-7-nhusb-base:1.1.1.3 pgoyette-localcount-20160806:1.1.1.3 pgoyette-localcount-20160726:1.1.1.3 pgoyette-localcount:1.1.1.3.0.10 pgoyette-localcount-base:1.1.1.3 netbsd-7-0-1-RELEASE:1.1.1.3 netbsd-7-0:1.1.1.3.0.8 netbsd-7-0-RELEASE:1.1.1.3 netbsd-7-0-RC3:1.1.1.3 netbsd-7-0-RC2:1.1.1.3 netbsd-7-0-RC1:1.1.1.3 netbsd-7:1.1.1.3.0.6 netbsd-7-base:1.1.1.3 libcxx-215289:1.1.1.3 libcxx-209785:1.1.1.3 yamt-pagecache:1.1.1.3.0.4 libcxx-208870:1.1.1.3 yamt-pagecache-base9:1.1.1.3 tls-earlyentropy:1.1.1.3.0.2 tls-earlyentropy-base:1.1.1.3 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.3 riastradh-drm2-base3:1.1.1.3 libcxx-198773:1.1.1.3 libcxx-198452:1.1.1.3 libcxx-195694:1.1.1.2 libcxx-194207:1.1.1.2 libcxx-188475:1.1.1.2 riastradh-drm2-base2:1.1.1.2 riastradh-drm2-base1:1.1.1.2 riastradh-drm2:1.1.1.2.0.2 riastradh-drm2-base:1.1.1.2 libcxx-185674:1.1.1.2 tls-maxphys-base:1.1.1.3 tls-maxphys:1.1.1.1.0.2 libcxx-182162:1.1.1.1 LLVM:1.1.1; locks; strict; comment @// @; 1.2 date 2021.05.30.03.26.53; author joerg; state dead; branches; next 1.1; commitid Z2BWNc6JrDmRz7VC; 1.1 date 2013.05.17.23.02.30; author joerg; state Exp; branches 1.1.1.1; next ; commitid 5RZzZYRawlqwq2Qw; 1.1.1.1 date 2013.05.17.23.02.30; author joerg; state Exp; branches 1.1.1.1.2.1; next 1.1.1.2; commitid 5RZzZYRawlqwq2Qw; 1.1.1.2 date 2013.07.04.22.20.54; author joerg; state Exp; branches; next 1.1.1.3; commitid WlNO2WjvXD3uEcWw; 1.1.1.3 date 2014.01.04.21.32.04; author joerg; state Exp; branches 1.1.1.3.4.1 1.1.1.3.34.1; next ; commitid gAL45VqEe0AdtQjx; 1.1.1.1.2.1 date 2013.05.17.23.02.30; author tls; state dead; branches; next 1.1.1.1.2.2; commitid OnlO1cBgtQRcIHUw; 1.1.1.1.2.2 date 2013.06.23.06.26.52; author tls; state Exp; branches; next 1.1.1.1.2.3; commitid OnlO1cBgtQRcIHUw; 1.1.1.1.2.3 date 2014.08.19.23.46.54; author tls; state Exp; branches; next ; commitid jTnpym9Qu0o4R1Nx; 1.1.1.3.4.1 date 2014.01.04.21.32.04; author yamt; state dead; branches; next 1.1.1.3.4.2; commitid 5gylMoBTXvvB7yBx; 1.1.1.3.4.2 date 2014.05.22.15.46.21; author yamt; state Exp; branches; next ; commitid 5gylMoBTXvvB7yBx; 1.1.1.3.34.1 date 2021.05.31.22.10.33; 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 @//===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // reference operator[](size_type __i); // const_reference operator[](size_type __i) const; // // reference at(size_type __i); // const_reference at(size_type __i) const; // // reference front(); // const_reference front() const; // // reference back(); // const_reference back() const; #include #include std::deque make(int size, int start = 0 ) { const int b = 4096 / sizeof(int); int init = 0; if (start > 0) { init = (start+1) / b + ((start+1) % b != 0); init *= b; --init; } std::deque c(init, 0); for (int i = 0; i < init-start; ++i) c.pop_back(); for (int i = 0; i < size; ++i) c.push_back(i); for (int i = 0; i < start; ++i) c.pop_front(); return c; }; int main() { { std::deque c = make(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } { const std::deque c = make(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } } @ 1.1 log @Initial revision @ text @@ 1.1.1.1 log @Import libc++ from http://llvm.org/svn/llvm-project, r182162. @ text @@ 1.1.1.2 log @Update libc++ snapshot to r185674. This removes an incorrect freelocale of the C locale on NetBSD. It adds support for non-pointer based allocators, integer sequences and more. @ text @d27 1 a27 4 #include "../../../min_allocator.h" template C d38 1 a38 1 C c(init, 0); d51 1 a51 20 std::deque c = make >(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } { const std::deque c = make >(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } #if __cplusplus >= 201103L { std::deque> c = make> >(10); d60 1 a60 1 const std::deque> c = make> >(10); a67 1 #endif @ 1.1.1.3 log @Import r198452 of libc++. Primarily avoids C style casts and adds a number of cleanups. @ text @d27 1 a27 1 #include "min_allocator.h" @ 1.1.1.3.34.1 log @sync with head @ text @@ 1.1.1.3.4.1 log @file access.pass.cpp was added on branch yamt-pagecache on 2014-05-22 15:46:21 +0000 @ text @d1 91 @ 1.1.1.3.4.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 91 //===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // reference operator[](size_type __i); // const_reference operator[](size_type __i) const; // // reference at(size_type __i); // const_reference at(size_type __i) const; // // reference front(); // const_reference front() const; // // reference back(); // const_reference back() const; #include #include #include "min_allocator.h" template C make(int size, int start = 0 ) { const int b = 4096 / sizeof(int); int init = 0; if (start > 0) { init = (start+1) / b + ((start+1) % b != 0); init *= b; --init; } C c(init, 0); for (int i = 0; i < init-start; ++i) c.pop_back(); for (int i = 0; i < size; ++i) c.push_back(i); for (int i = 0; i < start; ++i) c.pop_front(); return c; }; int main() { { std::deque c = make >(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } { const std::deque c = make >(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } #if __cplusplus >= 201103L { std::deque> c = make> >(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } { const std::deque> c = make> >(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } #endif } @ 1.1.1.1.2.1 log @file access.pass.cpp was added on branch tls-maxphys on 2013-06-23 06:26:52 +0000 @ text @d1 68 @ 1.1.1.1.2.2 log @resync from head @ text @a0 68 //===----------------------------------------------------------------------===// // // 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. // //===----------------------------------------------------------------------===// // // reference operator[](size_type __i); // const_reference operator[](size_type __i) const; // // reference at(size_type __i); // const_reference at(size_type __i) const; // // reference front(); // const_reference front() const; // // reference back(); // const_reference back() const; #include #include std::deque make(int size, int start = 0 ) { const int b = 4096 / sizeof(int); int init = 0; if (start > 0) { init = (start+1) / b + ((start+1) % b != 0); init *= b; --init; } std::deque c(init, 0); for (int i = 0; i < init-start; ++i) c.pop_back(); for (int i = 0; i < size; ++i) c.push_back(i); for (int i = 0; i < start; ++i) c.pop_front(); return c; }; int main() { { std::deque c = make(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } { const std::deque c = make(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } } @ 1.1.1.1.2.3 log @Rebase to HEAD as of a few days ago. @ text @d27 1 a27 4 #include "min_allocator.h" template C d38 1 a38 1 C c(init, 0); d51 1 a51 20 std::deque c = make >(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } { const std::deque c = make >(10); for (unsigned i = 0; i < 10; ++i) assert(c[i] == i); for (unsigned i = 0; i < 10; ++i) assert(c.at(i) == i); assert(c.front() == 0); assert(c.back() == 9); } #if __cplusplus >= 201103L { std::deque> c = make> >(10); d60 1 a60 1 const std::deque> c = make> >(10); a67 1 #endif @