bcm5719-llvm/libcxx/include/deque, branch meklort-10.0.1

[libc++] Rework compressed pair constructors.

2019-12-16T23:38:58+00:00

This patch de-duplicates most compressed pair constructors to use the same code in C++11 and C++03. Part of doing that is deleting the "__second_tag()" and replacing it with a "__value_init_tag()" which has the same effect, but allows for the removal of the special "one-arg" first element constructor. This patch is intended to have no semantic change.

Rename __is_foo_iterator traits to reflect their Cpp17 nature.

2019-11-18T06:49:32+00:00

With the upcoming introduction of iterator concepts in ranges, the meaning of "__is_contiguous_iterator" changes drastically. Currently we intend it to mean "does it have this iterator category", but it could now also mean "does it meet the requirements of this concept", and these can be different.

[libc++] Rename __to_raw_pointer to __to_address.

2019-11-16T22:16:09+00:00

This function has the same behavior as the now-standand std::to_address. Re-using the name makes the behavior more clear, and in the future it will allow us to correctly get the raw pointer for user provided pointer types.

Improve codegen for deque.

2019-08-12T07:51:05+00:00

This patch rewrites a few loops in deque and split_buffer to better optimize the codegen. For constructors like `deque d(500000, 0);` this patch results in a 2x speedup. The patch improves the codegen in roughly three ways: 1. Changes do { ... } while (...) loops into more typical for loops. The optimizer can reason about normal looking loops better. 2. Split the iteration over a range into (A) iteration over the blocks, then (B) iteration within the block. This nested structure helps LLVM lower the inner loop to `memset`. 3. Do fewer things each iteration. Some of these loops were incrementing or changing 4-5 variables every loop (in addition to the construction). Previously most loops would increment the end pointer, the size, and decrement the count of remaining items to construct. Now we only increment a single pointer for most iterations. llvm-svn: 368547

Refactor deque to centralize handling of spare blocks.

2019-08-01T23:11:18+00:00

I have upcoming changes that modify how deque handles spare blocks. This cleanup is intended to make those changes easier to review and understand. This patch should have NFC. llvm-svn: 367631

Mark 'front()' and 'back()' as noexcept for array/deque/string/string_view. These are just rebranded 'operator[]', and should be noexcept like it is.

2019-03-19T03:30:07+00:00

llvm-svn: 356435

Add noexcept to operator[] for array and deque. This is an extension. We already do this for string and string_view. This should give better codegen inside of noexcept functions.

2019-03-14T21:56:57+00:00

llvm-svn: 356209

Update more file headers across all of the LLVM projects in the monorepo

2019-01-19T10:56:40+00:00

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. llvm-svn: 351648

Implement P1209 - Adopt Consistent Container Erasure from Library Fundamentals 2 for C++20. Reviewed as https://reviews.llvm.org/D55532

2018-12-14T18:49:35+00:00

llvm-svn: 349178

[libcxx] Add assertion in deque::pop_back when popping from an empty deque

2018-12-12T23:58:25+00:00

Also, add tests making sure that vector and deque both catch the problem when assertions are enabled. Otherwise, deque would segfault and vector would never terminate. llvm-svn: 348994