[2a/3][ASan][libcxx] std::deque annotations

[AdvenamTacet]

Summary

This revision is a part of a series of patches extending AddressSanitizer C++ container overflow detection capabilities by adding annotations, similar to those existing in std::vector, to std::string and std::deque collections. These changes allow ASan to detect cases when the instrumented program accesses memory which is internally allocated by the collection but is still not in-use (accesses before or after the stored elements for std::deque, or between the size and capacity bounds for std::string).

The motivation for the research and those changes was a bug, found by Trail of Bits, in a real code where an out-of-bounds read could happen as two strings were compared via a std::equals function that took iter1_begin, iter1_end, iter2_begin iterators (with a custom comparison function). When object iter1 was longer than iter2, read out-of-bounds on iter2 could happen. Container sanitization would detect it.

This revision introduces annotations for std::deque. Each chunk of the container can now be annotated using the __sanitizer_annotate_double_ended_contiguous_container function, which was added in the rG1c5ad6d2c01294a0decde43a88e9c27d7437d157. Any attempt to access poisoned memory will trigger an ASan error. Although false negatives are rare, they are possible due to limitations in the ASan API, where a few (usually up to 7) bytes before the container may remain unpoisoned. There are no false positives in the same way as with std::vector annotations.

This patch only supports objects (deques) that use the standard allocator. However, it can be easily extended to support all allocators, as suggested in the D146815 revision.

Furthermore, the patch includes the addition of the is_double_ended_contiguous_container_asan_correct function to libcxx/test/support/asan_testing.h. This function can be used to verify whether a std::deque object has been correctly annotated.

Finally, the patch extends the unit tests to verify ASan annotations (added LIBCPP_ASSERTs).
If a program is compiled without ASan, all helper functions will be no-ops. In binaries with ASan, there is a negligible performance impact since the code from the change is only executed when the deque container changes in size and it’s proportional to the change. It is important to note that regardless of whether or not these changes are in use, every access to the container's memory is instrumented.

If you have any questions, please email:

• [e-mail]
• [e-mail]

[philnik]

libcxx/include/deque

1597

The same through out.

1790

Every implementation-detail symbol should either be _Uglified or __uglified, but never __Uglified.

1849

Please add an end comment to longer preprocessor blocks.

[AdvenamTacet]

The udpate is fixing issues mentioned in the code review.
Content:

• fixed formating,
• use of _LIBCPP_HIDE_FROM_ABI,
• names and style improvements.

[AdvenamTacet]

This update should fix failing unit tests and improve code quality.
Content:

• Fixed includes (thx philnik for pointing that)
• Improved variable names (more consistent)
• Values passed to compiler-rt functions are correct now. (There

was an optimization depending on compiler-rt implementation, now
it should be correct even when implementation is extended.)

Overall, it's a very small update.

[AdvenamTacet]

Duplicated file removed.

[AdvenamTacet]

This update should fix failure of C++03 tests and a format check test.

[AdvenamTacet]

This update adds clang version check (_LIBCPP_CLANG_VER >= 16000),
because the change requires compiler-rt functions from a parent revision.

As a result, it changes implementation of libcxx/test/support/asan_testing.h.

It also removes a comment fix in compiler-rt function. I will add it to
the parent revision (D132090).

[AdvenamTacet]

Changin _de_ in names into _double_ended_, based on a review for compiler-rt part.
There will be one more change based on the review.

[AdvenamTacet]

clang-format (sorry for double update)

[AdvenamTacet]

Update of API. (A change was requested in review for D132090 and this
patch is reflecting that change - only one function is in API.)

[AdvenamTacet]

Moving libc++ code from D132090.

[AdvenamTacet]

I'm sending this update to test annotations with CI.
Updated changes to newer commit.
When I see green CI, I will send an update unifying those changes with D136765 and D132769, as well as minimizing code.

[AdvenamTacet]

Tests update, code refactor in next update.

[AdvenamTacet]

This update is a big refactor of code responsible for annotations.
This update reduced size of the patch significantly.
There are only two helper function (one wrapper), both are minimal.

I added a lot of comment to the (new) code, if you want a smaller patch those comments may be removed, but I think it's good to have them.

I belive, the code is ready for a review. I tested it locally (but only with one C++ standard, so there may be some failure, I will fix it asap).

[AdvenamTacet]

This update:

• removes incorrect extern,
• fixes a typo,
• adds sanity ASan test (not tested).

[AdvenamTacet]

This update:

• removed unnecessary macro and related limitations,
• updates formatting in __annotate_from_to,
• simplifies calls to helpers in __add_front_capacity.

[philnik]

Looks pretty good. I haven't looked closely at the annotation placements and tests yet.

libcxx/include/deque

1204–1205

Same below.

1859

As in other patches, let's give the parameters proper names.

1865

1873

Please don't add a 10th version of formatting. We are trying to reduce the formatting differences, not increase them.

1875

You have specialized functions for there IIUC. Why don't you use them here? There are a few more cases below.

1892

throughout the patch

1971

Missing _LIBCPP_HIDE_FROM_ABI

1976

Please add braces.

2799

Please avoid NFC changes in such a large patch.

2900–2908

Maybe add a function __annotate_whole_block?

libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size.pass.cpp

92–99 ↗

(On Diff #508651)

Maybe just call both in the same loop?

[AdvenamTacet]

Based on the code review, this update:

• adds __annotate_whole_block and __annotate_poison_block helpers,
• updates arguements and variables names in __annotate_from_to and __verify_asan_annotations,
• changes _VSTD to std,
• adds missing _LIBCPP_HIDE_FROM_ABI,
• removes NFC,
• fixes formatting and comments.

[AdvenamTacet]

libcxx/include/deque

1859

I changed __b and __e to __beg and __end. I believe same length makes the code easier to read. Updated also local variable names.

1875

There was no helper for a single block and use of __annotate_shrink_* is impossible as it requires annotated memory area to be just before or just after the container in-use area, but new block may be added not directly before/after. I added __annotate_whole_block.

2900–2908

I added __annotate_poison_block for this. It's not very similar to other helpers, because here we are annotating a memory block in __buf and not in __map_.

libcxx/test/std/containers/sequences/deque/deque.capacity/resize_size.pass.cpp

92–99 ↗

(On Diff #508651)

I started doing it, but stopped. I don't think it's a good idea to introduce that change in this patch. There is already a lot of copy-paste of tests, so it would require to refactor all of them or have two different styles in one file.

[philnik]

libcxx/include/deque

1538

Let's add a LLVM 18 TODO to clean this up.

1556

Maybe having two enums like

enum {
  __asan_poinson,
  __asan_unposion
};

enum {
  __asan_front_moved,
  __asan_back_moved,
};

would make this more readable? (and remove the need for the comments below)

1563

I think it's pretty clear what a return; does.

1568

Maybe use __map_const_pointer?

1569

What does the mp stand for?

1659–1663

I would reverse the condition here to match __annotate_new.

2900–2908

Ah. Makes sense.

3058

[AdvenamTacet]

This update:

• adds enums (poisoning, unpoisoning; back, front)
• adds LLVM 18 TODO comment; improves other comments
• reverses the condition in __annotate_delete.

[AdvenamTacet]

libcxx/include/deque

1568

I did try it at the beginning and there are type related issues. It's much cleaner that way than working around it.

1569

I believe map_pointer, but I used this name based on the rest of the code where it's used.

[AdvenamTacet]

This update updates a base commit.

[philnik]

LGTM % nits.

libcxx/include/deque

1568

Let's adda new alias __map_const_iterator then. The typename __map::const_iterator is really irritating.

1569

Let's drop it if nobody knows what it actually stands for.

1710–1712

I think this comment is wrong now?

[AdvenamTacet]

This update addresses all nits.

• Adds __map_const_iterator.
• Removes incorrect comments.
• Addresses _mp sufix.

libcxx/include/deque

1569

I changed it to map, I feel that it makes code much easier to read when it is clear if it points on the map (buffer of buffers) or the actual buffer. Hope it's clear now.

[AdvenamTacet]

This update fixes an issue with name shadowing and hopefully resolves all CI problems.

[vitalybuka]

Asan bots are broken, reverted.

[philnik]

In D132092#4323869, @vitalybuka wrote:

Asan bots are broken, reverted.

Could you maybe provide some more information? Which bots were broken by this and what was the error? Without any information we can't address the problem.

[AdvenamTacet]

It looks like the problem was created when I added __annotate_whole_block. Example buildbot output relevant for this revision: https://lab.llvm.org/buildbot/#/builders/5/builds/33480/steps/13/logs/stdio

==296484==ERROR: AddressSanitizer: bad parameters to __sanitizer_annotate_double_ended_contiguous_container:
      storage_beg        : 0x6210000d0d00
      storage_end        : 0x6210000d1d00
      old_container_beg  : 0x6210000d1b40
      old_container_end  : 0x6210000d1d00
      new_container_beg  : 0x6210000d1b40
      new_container_end  : 0x6210000d0d00
    #0 0x56178e14cac5 in __sanitizer_annotate_double_ended_contiguous_container /b/sanitizer-x86_64-linux-fast/build/llvm-project/compiler-rt/lib/asan/asan_poisoning.cpp:499:5
    #1 0x56178efd3474 in __annotate_double_ended_contiguous_container /b/sanitizer-x86_64-linux-fast/build/libcxx_build_asan/include/c++/v1/deque:893:13
    #2 0x56178efd3474 in __annotate_from_to /b/sanitizer-x86_64-linux-fast/build/libcxx_build_asan/include/c++/v1/deque:991:13
    #3 0x56178efd3474 in __annotate_whole_block /b/sanitizer-x86_64-linux-fast/build/libcxx_build_asan/include/c++/v1/deque:1037:9
    #4 0x56178efd3474 in std::__1::deque<std::__1::pair<std::__1::function<void ()>, llvm::ThreadPoolTaskGroup*>, std::__1::allocator<std::__1::pair<std::__1::function<void ()>, llvm::ThreadPoolTaskGroup*>>>::__add_back_capacity() /b/sanitizer-x86_64-linux-fast/build/libcxx_build_asan/include/c++/v1/deque:2233:13
    #5 0x56178efd1aaf in std::__1::pair<std::__1::function<void ()>, llvm::ThreadPoolTaskGroup*>& std::__1::deque<std::__1::pair<std::__1::function<void ()>, llvm::ThreadPoolTaskGroup*>, std::__1::allocator<std::__1::pair<std::__1::function<void ()>, llvm::ThreadPoolTaskGroup*>>>::emplace_back<std::__1::pair<std::__1::function<void ()>, llvm::ThreadPoolTaskGroup*>>(std::__1::pair<std::__1::function<void ()>, llvm::ThreadPoolTaskGroup*>&&) /b/sanitizer-x86_64-linux-fast/build/libcxx_build_asan/include/c++/v1/deque:1596:9
    [...]

All errors I could find seem to have an origin in __add_back_capacity and I'm almost sure that I see a problem in the function.

I am trying to create unit test catching it and then I will send the next update with fix and tests.

[AdvenamTacet]

I have a hard time trying to create a stand alone test.
To go to the problematic if branch, push_back should be called when:

• __back_spare() == 0
• __front_spare() < __block_size
• __map_.size() < __map_.capacity()
• __map_.__back_spare() == 0

The problem is incorrect value argument to a helper function __annotate_whole_block, but actually there is no need to call this function yet (it can be called later after whole if-else block). It's easy to see what is wrong and how to fix it. I have a hard time creating a unit test covering it.

[AdvenamTacet]

This update fixes the issue with incorrect arguments during deque annotations. Now the patch should work without a problem after landing.

[AdvenamTacet]

This update resolves merge conflicts with the new head commin on the main branch.

I believe, this revision is ready to land.

[alexfh]

Hi @AdvenamTacet, is it expected that the std::deque<const T> can't be compiled after the patch? I couldn't find a clause in the standard that requires deque to have non-const value_type.

Example: https://gcc.godbolt.org/z/sbcvzzbKd

#include <deque>

std::deque<const int> q;
std::deque<const int> qq = q;

[alexfh]

@ldionne @EricWF do you know if std::deque<const T> is allowed by the standard? If it's not, can we have a proper static assert (similar to the one in libstdc++: https://gcc.godbolt.org/z/jjzbP3bd4) instead of a vague compiler error?

[AdvenamTacet]

@alexfh it's not by design. A const_cast is missing (or should I use (void *)?). We may add it in the very place where error happens or later before calling API, but type has to be changed here.

Working on the fix right now.

• I am going to add a const deque test.
• Add the const_cast, I believe it's the correct choice.

[AdvenamTacet]

Ok, I just learned that deque objects have to be assignable/movable, so std::deque<const int> is not correct (from what I understand). Therefore tests for it cannot exist. But it's not my intention to change behavior of std::deque<const T> and therefore I created D151777. The new patch adds a few const. All examples working previously seem to work with D151777, but I found some not working even before this patch.

As - if I'm correct - deque object cannot be of const type, I think I did as much as I could.

[eaeltsin]

It looks like std::deque elements do not need to be copy assignable since C++11 (https://en.cppreference.com/w/cpp/container/deque).

Though it says member functions can impose stricter requirements - I'm not sure if there is a member that still requires copy assignable

[vitalybuka]

D151836 triggers asserts

[vitalybuka]

I believe it's reasonable to revert for investigation.

[vitalybuka]

Sorry that I had to revert this second time. This one discovered a lot of real bugs in our code.
Please include D151836 or similar test into the patch?

[AdvenamTacet]

This update (hopefully) brings back old behavior of deque with const elements.

To understand the problem better, I tried to create tests for deque with const elements, but those are failing even in functions that might work. It seems like resize is failing, but it should be possible to make it work changing iterator to const_iterator (didn't test it, tho).
https://godbolt.org/z/qfxTW7aK7

Hey @alexfh, I hope this will solve your problem!
But deque<const T> seems to be poorly supported in general.

PS
MinGW prints:

std::deque must have a non-const, non-volatile value_type

https://godbolt.org/z/zerMG7GTf

[AdvenamTacet]

This update:

• adds a test suggested by @vitalybuka (extended to do that kind of caterpillar from every side),
• removes the issue,
• reimplementes __annotate_whole_block (last arguments removed; no longer calling __annotate_from_to).

The problem was a very similar to the previous one. Incorrect last argument (argument informing if end or begin of the container moved). It wasn't easy to spot, even that now it's obvious.
I was checking for issues like that previously but I had to miss that one. However, the argument doesn't have much sense, whole block has to be annotated anyway and it's not always obvious what value should be passed in some situations. I reimplemented problematic function, so it does not require the argument. Hope it will help to avoid similar issues in future.

I believe it's ready to land again, as both probles are solved (const element type bahaviour and incorrect annotations), a new test is added and tests passed (locally).

[AdvenamTacet]

This update changes how __annotate_delete() for an empty container is executed and makrs two functions as const.
It solves issues with non-standard allocators.

Now it's tested with D146815 and both revisions can land.

[AdvenamTacet]

This update renames the new test and updates it slightly.

[AdvenamTacet]

Hey @vitalybuka, thanks for the standalone failing test (D151836)! It was really helpful! I fixed the problem and hope there are no more issues with that revision (and for no more reverts).

This one discovered a lot of real bugs in our code.

I'm really happy that my code could help!

Hey @philnik, I hope I fixed the patch already and it can go back to upstream, for good this time. Also, D136765 wasn't reverted for a while already, so maybe we can land D146815 as well?

[AdvenamTacet]

This update fixes a naming issue.

[AdvenamTacet]

rebase, I hope it fixes the CI fail (doesn't look like issue made by this revision).

[AdvenamTacet]

Rebase, I hope it will fix the issue with the fail on MacOS.

ld: warning: object file (/Users/libcxx-buildkite-agent/libcxx.buildkite-agent/builds/y10-8-macminivault-com/llvm-project/libcxx-ci/build/apple-system-backdeployment-10.15/lib/libc++experimental.a(memory_resource.cpp.o)) was built for newer macOS version (12.0) than being linked (10.15)
ld: warning: dylib (/Users/libcxx-buildkite-agent/libcxx.buildkite-agent/builds/y10-8-macminivault-com/llvm-project/libcxx-ci/build/apple-system-backdeployment-10.15/lib/libc++.dylib) was built for newer macOS version (12.0) than being linked (10.15)
ld: warning: dylib (/Users/libcxx-buildkite-agent/libcxx.buildkite-agent/builds/y10-8-macminivault-com/llvm-project/libcxx-ci/build/apple-system-backdeployment-10.15/lib/libunwind.dylib) was built for newer macOS version (12.0) than being linked (10.15)
ld: warning: dylib (/Users/libcxx-buildkite-agent/libcxx.buildkite-agent/builds/y10-8-macminivault-com/llvm-project/libcxx-ci/build/apple-system-backdeployment-10.15/lib/libunwind.dylib) was built for newer macOS version (12.0) than being linked (10.15)

[AdvenamTacet]

This update:

• removes XFAIL as the test should always pass,
• removes _LIBCPP_ENABLE_ASSERTIONS=1 because ASan assertions are catched anyway.

I copt-pasted those, but there is no need for them, I believe.

[AdvenamTacet]

Rebase.

[AdvenamTacet]

Updating libcxx/include/__config in response to _LIBCPP_FUNC_VIS removal.

Used: _LIBCPP_EXPORTED_FROM_ABI

[AdvenamTacet]

rebase

[AdvenamTacet]

Rebase.

[AdvenamTacet]

I hope I fixed everything requested, cannot find anything else to fix. I hope this time it landed for the last time...
I see buildbot failures, but I don't see how my patch may be the cause (one, two).

This one discovered a lot of real bugs in our code.

Hey @vitalybuka, could you share a little bit more? Like statistics, in what projects, how those bugs look like, was there any more interesting? I will appreciate any and every data which we can use!

[vitalybuka]

In D132092#4451255, @AdvenamTacet wrote:

I hope I fixed everything requested, cannot find anything else to fix. I hope this time it landed for the last time...
I see buildbot failures, but I don't see how my patch may be the cause (one, two).

This one discovered a lot of real bugs in our code.

Hey @vitalybuka, could you share a little bit more? Like statistics, in what projects, how those bugs look like, was there any more interesting? I will appreciate any and every data which we can use!

I have number of bugs we had to fix after the first attempt to integrate, but, I guess, it's meaningless on it's own, without any baseline.
From my experience of enabling https://libcxx.llvm.org/UsingLibcxx.html#enabling-the-safe-libc-mode on the same code-base, my very rough estimate is that your patch fetched at least 10% of additional bugs to the "safe libc++ mode".

Unfortunately all discoveries so far are in internal code, nothing to share from open sourced components yet. Maybe chromium.org or https://github.com/google/oss-fuzz will find bugs in open source libraries. But they didn't integrated the patch yet.

At least 90% of these bugs look like https://godbolt.org/z/eGddPd3qs or std::stack equivalent. Note that for large 'n' you can already expect SEGV or 'heap-use-after-free' with existing Asan. But smaller 'n' was not covered before your patches.

Also very good news that fixing those bugs very easy, either remove the reference or swap use and pop(). This mean fix rate for discovered bugs should be very high.

BTW. This pattern is quote similar to typical implementations work-lists, BFS and DFS algorithms. We have them in LLVM. We run LLVM under Asan here https://lab.llvm.org/buildbot/#/builders/168, but I didn't see any related reports.

[ldionne]

libcxx/include/__config

910 ↗

(On Diff #534836)

This breaks on AppleClang when using asan, because then _LIBCPP_CLANG_VER isn't defined and we check for _LIBCPP_CLANG_VER >= 1600. That triggers -Wundef, which is turned into an error in our test suite.

[ldionne]

libcxx/include/deque

1548

Same here for -Wundef.

[AdvenamTacet]

libcxx/include/__config

910 ↗

(On Diff #534836)

Hey! What is the correct way of checking the version then?

Also, can I fix it in another commit, or should we revert the whole commit, fix it and land it again?

libcxx/include/deque

 __deque_base<_Tp, _Allocator>::~__deque_base()
 {
     clear();
     typename __map::iterator __i = __map_.begin();
     typename __map::iterator __e = __map_.end();
     for (; __i != __e; ++__i)
         __alloc_traits::deallocate(__alloc(), *__i, __block_size);
 }
 
 #ifndef _LIBCPP_CXX03_LANG
 
 template <class _Tp, class _Allocator>
 __deque_base<_Tp, _Allocator>::__deque_base(__deque_base&& __c)
     _NOEXCEPT_(is_nothrow_move_constructible<allocator_type>::value)
     : __map_(_VSTD::move(__c.__map_)),
       __start_(_VSTD::move(__c.__start_)),
       __size_(_VSTD::move(__c.__size_))
 {
case 2:
         break;
     }
 }
 
 template <class _Tp, class _Allocator /*= allocator<_Tp>*/>
 class _LIBCPP_TEMPLATE_VIS deque
     : private __deque_base<_Tp, _Allocator>
 {
+private:
+    typedef allocator<_Tp>                      __default_allocator_type;
 public:
     // types:
 
     typedef _Tp value_type;
     typedef _Allocator allocator_type;
 
     static_assert((is_same<typename allocator_type::value_type, value_type>::value),
                   "Allocator::value_type must be same type as value_type");
public:
     using typename __base::__deque_range;
     using typename __base::__deque_block_range;
     using typename __base::_ConstructTransaction;
 
     // construct/copy/destroy:
     _LIBCPP_INLINE_VISIBILITY
     deque()
         _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
-        {}
-    _LIBCPP_INLINE_VISIBILITY explicit deque(const allocator_type& __a) : __base(__a) {}
+        { __annotate_new(0); }
+    _LIBCPP_INLINE_VISIBILITY explicit deque(const allocator_type& __a) : __base(__a)
+        { __annotate_new(0); }
     explicit deque(size_type __n);
 #if _LIBCPP_STD_VER > 11
     explicit deque(size_type __n, const _Allocator& __a);
 #endif
     deque(size_type __n, const value_type& __v);
 
     template <class = __enable_if_t<__is_allocator<_Allocator>::value> >
     deque(size_type __n, const value_type& __v, const allocator_type& __a) : __base(__a)
     {
+        __annotate_new(0);
         if (__n > 0)
             __append(__n, __v);
     }
 
     template <class _InputIter>
         deque(_InputIter __f, _InputIter __l,
               typename enable_if<__is_cpp17_input_iterator<_InputIter>::value>::type* = 0);
     template <class _InputIter>
size_type __back_spare() const
         return __capacity() - (__base::__start_ + __base::size());
     }
     _LIBCPP_INLINE_VISIBILITY
     size_type __back_spare_blocks() const {
       return __back_spare() / __base::__block_size;
     }
 
  private:
+    // Implementation based on the one from std::vector.
+    //
+    // The following functions are no-ops outside of AddressSanitizer mode.
+    // We call annotatations only for the default Allocator because other allocators
+    // may not meet the AddressSanitizer alignment constraints.
+    // See the documentation for __sanitizer_annotate_contiguous_container for more details.
+#ifndef _LIBCPP_HAS_NO_ASAN
+    _LIBCPP_INLINE_VISIBILITY
+
+    void __annotate_contiguous_container_front(const void *__beg, const void *__end,
+                                         const void *__new_con_beg,
+                                         const void *__old_con_beg,
+                                         const void *__con_end) const
+    {
+        // Same wrapper as in std::vector for annotating mid-to-end of a contiguous block
+        // Note that we don't maintain front annotations of a std::deque here
+        // as this is done in a more specific functions below and this one is only
+        // used by them.
+        if (__beg && is_same<allocator_type, __default_allocator_type>::value)
+            __sanitizer_annotate_de_contiguous_container_front(__beg, __end, __new_con_beg, __old_con_beg, __con_end);
+
+    }
+        void __annotate_contiguous_container_back(const void *__beg, const void *__end,
+                                               const void *__old_con_end,
+                                               const void *__new_con_end,
+                                               const void *__con_beg) const
+    {
+        // Same wrapper as in std::vector for annotating mid-to-end of a contiguous block
+        // Note that we don't maintain front annotations of a std::deque here
+        // as this is done in a more specific functions below and this one is only
+        // used by them.
+        if (__beg && is_same<allocator_type, __default_allocator_type>::value)
+            __sanitizer_annotate_de_contiguous_container_back(__beg, __end, __old_con_end, __new_con_end, __con_beg);
+
+    }
+#else
+    _LIBCPP_INLINE_VISIBILITY
+    void __annotate_contiguous_container_front(const void*, const void*, const void*,
+                                         const void*, const void*) const _NOEXCEPT {}
+    _LIBCPP_INLINE_VISIBILITY
+    void __annotate_contiguous_container_back(const void*, const void*, const void*,
+                                         const void*, const void *) const _NOEXCEPT {}
+#endif
+
+    _LIBCPP_INLINE_VISIBILITY
+    // __b - index of first item in __map_ to annotate
+    // __e - index behind the last item in __map_ to annotate (so last item + 1)
+    void __annotate_poison_from_to_front(size_type __b, size_type __e) const _NOEXCEPT
+    {
+        if (__b == __e)
+            return;
+
+        // __mp - ponter to the first chunk which annotations we want to modify.
+        // __last_mp - pointer to the last chunk which annotations we want to modify.
+        // If ony one chunk if affected, __mp == __last_mp
+        // We use (__e - 1) in calculations, because if we poison to the very end of chunk,
+        // we still want to point at that chunk and not the next one. Using __e, would
+        // point at the memory for the next element, which may be in a next chunk.
+        typename __base::__map_traits::const_pointer __mp = __base::__map_.begin() + __b / __base::__block_size;
+        typename __base::__map_traits::const_pointer __last_mp = __base::__map_.begin() + (__e - 1) / __base::__block_size;
+
+        const void *__p = _VSTD::__to_address(*__mp + (__b % __base::__block_size));
+
+        // We iterate over map pointers and fully poison all blocks between the first and the last.
+        // The first block is partialy poisoned here as well.
+        // The last one is poisoned after the while loop.
+        while (__mp != __last_mp)
+        {
+            // Pointer to block's end
+            const void *__p_e = _VSTD::__to_address(*__mp + __base::__block_size);
+            // Pointer to block's beginning
+            const void *__p_b = _VSTD::__to_address(*__mp);
+            __annotate_contiguous_container_front(__p_b, __p_e, __p_e, __p, __p_e); // poison [__p, __p_e]
+
+            __mp += 1;
+            __p = _VSTD::__to_address(*__mp);
+        }
+
+        // If __last_block_index is zero, then we should point to the end of a chunk (one of its contiguous blocks).
+        size_type __last_block_index = __e % __base::__block_size;
+
+        const void *__p_e = _VSTD::__to_address(*__mp + (__last_block_index == 0 ? __base::__block_size : __last_block_index));
+        const void *__p_b = _VSTD::__to_address(*__mp);
+        const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
+
+        // Poisoning happens after the container modification, so the size
+        // was already changed and may be 0 but we still have to poison the cleared blocks.
+        if (__last_block_index == 0 || size() == 0)
+            __annotate_contiguous_container_front(__p_b, __p_t_e, __p_e, __p, __p_e);
+        else {
+            // Due to current limitations of ASan, it only matters if container is empty or not,
+            // therefore we do not calculate true end of the container in the block (performance reasons),
+            // but if poisoning prefixes will be implemented in Asan, we should pass correct end of memory in use
+            // inside that chunk, instead of just end of the allocated memory. (Last argument.)
+            __annotate_contiguous_container_front(__p_b, __p_t_e, __p_e, __p, __p_t_e);
+        }
+   }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __annotate_unpoison_from_to_front(size_type __b, size_type __e) const _NOEXCEPT
+    {
+        if (__b == __e)
+            return;
+        // Check comment in  __annotate_poison_from_to_front(size_type, size_type) for details.
+        typename __base::__map_traits::const_pointer __mp = __base::__map_.begin() + __b / __base::__block_size;
+        typename __base::__map_traits::const_pointer __last_mp = __base::__map_.begin() + (__e-1) / __base::__block_size;
+
+        const void *__p = _VSTD::__to_address(*__mp + (__b % __base::__block_size));
+        while (__mp != __last_mp)
+        {
+            // Pointer to block's end
+            const void *__p_e = _VSTD::__to_address(*__mp + __base::__block_size);
+            // Pointer to block's beginning
+            const void *__p_b = _VSTD::__to_address(*__mp);
+            __annotate_contiguous_container_front(__p_b, __p_e, __p, __p_e, __p_e);
+
+            __mp += 1;
+            __p = _VSTD::__to_address(*__mp);
+        }
+
+        size_type __last_block_index = __e % __base::__block_size;
+
+        const void *__p_e = _VSTD::__to_address(*__mp + (__last_block_index == 0 ? __base::__block_size : __last_block_index));
+        const void *__p_b = _VSTD::__to_address(*__mp);
+        const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
+
+        // unpoison happens before the size is changed
+        // so we have to unpoison the block before its modified
+        if (__last_block_index == 0 || size() == 0)
+            __annotate_contiguous_container_front(__p_b, __p_e, __p, __p_e, __p_e);
+        else
+        {
+            // Check comment in  __annotate_poison_from_to_front(size_type, size_type) for details.
+            __annotate_contiguous_container_front(__p_b, __p_t_e, __p, __p_e, __p_t_e);
+        }
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __annotate_poison_from_to_back(size_type __b, size_type __e) const _NOEXCEPT
+    {
+        if (__b == __e)
+            return;
+
+        // Check comment in  __annotate_poison_from_to_front(size_type, size_type) for details.
+        typename __base::__map_traits::const_pointer __mp = __base::__map_.begin() + __b / __base::__block_size;
+        typename __base::__map_traits::const_pointer __last_mp = __base::__map_.begin() + (__e - 1) / __base::__block_size;
+
+        const void *__p = _VSTD::__to_address(*__mp + (__b % __base::__block_size));
+        const void *__p_t_b = size() == 0 ? __p : _VSTD::__to_address(*__mp);
+
+        while (__mp != __last_mp)
+        {
+            const void *__p_e = _VSTD::__to_address(*__mp + __base::__block_size);
+            const void *__p_b = _VSTD::__to_address(*__mp);
+            const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
+            __annotate_contiguous_container_back(__p_b, __p_t_e, __p_e, __p, __p_t_b);
+
+            __mp += 1;
+            __p_t_b = __p = _VSTD::__to_address(*__mp);
+        }
+
+        size_type __last_block_index = __e % __base::__block_size;
+        const void *__p_e = _VSTD::__to_address(*__mp + (__last_block_index == 0 ? __base::__block_size : __last_block_index));
+        const void *__p_b = _VSTD::__to_address(*__mp);
+        const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
+        __annotate_contiguous_container_back(__p_b, __p_t_e, __p_e, __p, __p_t_b);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __annotate_unpoison_from_to_back(size_type __b, size_type __e) const _NOEXCEPT
+    {
+        if (__b == __e)
+            return;
+
+        // Check comment in  __annotate_poison_from_to_front(size_type, size_type) for details.
+        typename __base::__map_traits::const_pointer __mp = __base::__map_.begin() + __b / __base::__block_size;
+        typename __base::__map_traits::const_pointer __last_mp = __base::__map_.begin() + (__e-1) / __base::__block_size;
+
+        const void *__p = _VSTD::__to_address(*__mp + (__b % __base::__block_size));
+        const void *__p_t_b = _VSTD::__to_address(*__mp);
+
+        while (__mp != __last_mp)
+        {
+            const void *__p_e = _VSTD::__to_address(*__mp + __base::__block_size);
+            const void *__p_b = _VSTD::__to_address(*__mp);
+            const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
+            __annotate_contiguous_container_back(__p_b, __p_t_e, __p, __p_e, __p_t_b);
+
+            __mp += 1;
+            __p_t_b = __p = _VSTD::__to_address(*__mp);
+        }
+
+        size_type __last_block_index = __e % __base::__block_size;
+        const void *__p_e = _VSTD::__to_address(*__mp + (__last_block_index == 0 ? __base::__block_size : __last_block_index));
+        const void *__p_b = _VSTD::__to_address(*__mp);
+        const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
+        __annotate_contiguous_container_back(__p_b, __p_t_e, __p, __p_e, __p_t_b);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __annotate_new(size_type __current_size) const _NOEXCEPT
+    {
+        if (__current_size == 0)
+            __annotate_poison_from_to_back(0, __base::__map_.size() * __base::__block_size);
+        else
+        {
+            // This branch is never reached in current implementation because
+            // __annotate_new is always called with 0,
+            // but let's leave it here in case anyone needs to use
+            // __annotate_new(n) in the future
+            __annotate_poison_from_to_front(0, __base::__start_);
+            __annotate_poison_from_to_back(__base::__start_ + __current_size, __base::__map_.size() * __base::__block_size);
+        }
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __annotate_delete() const _NOEXCEPT
+    {
+        if(!empty())
+        {
+            __annotate_unpoison_from_to_front(0, __base::__start_);
+            __annotate_unpoison_from_to_back(__base::__start_ + __base::size(), __base::__map_.size() * __base::__block_size);
+        }
+        else
+            __annotate_unpoison_from_to_back(0, __base::__map_.size() * __base::__block_size);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __annotate_increase_front(size_type __n) const _NOEXCEPT
+    {
+        __annotate_unpoison_from_to_front(__base::__start_ - __n, __base::__start_);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __annotate_increase_back(size_type __n) const _NOEXCEPT
+    {
+        __annotate_unpoison_from_to_back(__base::__start_ + __base::size(), __base::__start_ + __base::size() + __n);
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __annotate_shrink_front(size_type __old_size, size_type __old_start) const _NOEXCEPT
+    {
+        __annotate_poison_from_to_front(__old_start, __old_start + (__old_size - size()));
+    }
+
+    _LIBCPP_INLINE_VISIBILITY
+    void __annotate_shrink_back(size_type __old_size, size_type __old_start) const _NOEXCEPT
+    {
+        __annotate_poison_from_to_back(__old_start + size(), __old_start + __old_size);
+    }
+
+// This macro should be defined only during testing ASAN.
+// Include the "asan_testing.h" file which defines it
+// to be able to use it in ASan tests.
+#ifdef __LIBCPP_VERIFY_ASAN_DEQUE_ANNOTATIONS
+ public:
+    bool __verify_asan_annotations() const _NOEXCEPT
+    {
+        // This function tests deque object annotations.
+        // This test is simplified, it tests only if:
+        // - memory owned by deque (deque blocks) not containig alements is poisoned.
+        // - memory owned by deque elements is accessible.
+        //
+        // Therefore you cannot test, with that function, deque containing objects
+        // which memory may be partialy (or fully) poisoned, like std::string (SSO case).
+        // You can test std::vector or long std::string.
+
+        if (empty())
+        {
+            for (typename __base::__map_traits::const_pointer __it = __base::__map_.begin(); __it != __base::__map_.end(); ++__it)
+                if (!__sanitizer_verify_de_contiguous_container(*__it, *__it, *__it, *__it + __base::__block_size))
+                    return false;
+
+            return true;
+        }
+
+        size_type __e = __base::__start_ + __base::size();
+        typename __base::__map_traits::const_pointer __first_mp = __base::__map_.begin() + __base::__start_ / __base::__block_size;
+        typename __base::__map_traits::const_pointer __last_mp = __base::__map_.begin() + (__e-1) / __base::__block_size;
+
+        // Pointers to first and last elements
+        // They can be in *different deque blocks*
+        pointer __p_first = *__first_mp + (__base::__start_ % __base::__block_size);
+        pointer __p_last = *__last_mp + ((__e % __base::__block_size == 0) ? __base::__block_size : __e % __base::__block_size);
+
+        for (typename __base::__map_traits::const_pointer __it = __base::__map_.begin(); __it != __base::__map_.end(); ++__it)
+        {
+            // Go over all blocks, find the place we are in and verify its annotations
+            // Note that __p_last points *behind* the last item.
+
+            // - blocks before the first block with container elements
+            // - first block with items
+            // - last block with items
+            // - blocks after last block with ciontainer elements
+
+
+            // Is the block before or after deque blocks that contain elements?
+            if (__it < __first_mp || __it > __last_mp)
+                {if (!__sanitizer_verify_de_contiguous_container(*__it, *__it, *__it, (*__it + __base::__block_size))) return false;}
+
+            else
+            {
+                // Is the block the first block that contains elements?
+                pointer __con_beg = (__it == __first_mp) ? __p_first : *__it;
+                // Is it the last one?
+                pointer __con_end = (__it == __last_mp) ? __p_last : (*__it + __base::__block_size);
+                {if (!__sanitizer_verify_de_contiguous_container(*__it, __con_beg, __con_end, (*__it + __base::__block_size))) return false;}
+            }
+        }
+
+        return true;
+    }
+ private:
+#endif
+
     _LIBCPP_INLINE_VISIBILITY
     bool __maybe_remove_front_spare(bool __keep_one = true) {
       if (__front_spare_blocks() >= 2 || (!__keep_one && __front_spare_blocks())) {
+        __annotate_unpoison_from_to_back(0, __base::__block_size);
         __alloc_traits::deallocate(__base::__alloc(), __base::__map_.front(),
                                    __base::__block_size);
         __base::__map_.pop_front();
         __base::__start_ -= __base::__block_size;
         return true;
       }
       return false;
     }
 
     _LIBCPP_INLINE_VISIBILITY
     bool __maybe_remove_back_spare(bool __keep_one = true) {
       if (__back_spare_blocks() >= 2 || (!__keep_one && __back_spare_blocks())) {
+        __annotate_unpoison_from_to_back((__base::__map_.size() - 1) * __base::__block_size, __base::__map_.size() * __base::__block_size);
         __alloc_traits::deallocate(__base::__alloc(), __base::__map_.back(),
                                    __base::__block_size);
         __base::__map_.pop_back();
         return true;
       }
       return false;
     }
 
     template <class _InpIter>
         void __append(_InpIter __f, _InpIter __l,
                  typename enable_if<__is_exactly_cpp17_input_iterator<_InpIter>::value>::type* = 0);
     template <class _ForIter>
         void __append(_ForIter __f, _ForIter __l,
                       typename enable_if<__is_cpp17_forward_iterator<_ForIter>::value>::type* = 0);
     void __append(size_type __n);
     void __append(size_type __n, const value_type& __v);
     void __erase_to_end(const_iterator __f);
     void __add_front_capacity();
     void __add_front_capacity(size_type __n);
     void __add_back_capacity();
     void __add_back_capacity(size_type __n);
     iterator __move_and_check(iterator __f, iterator __l, iterator __r,
                               const_pointer& __vt);
     iterator __move_backward_and_check(iterator __f, iterator __l, iterator __r,
                                        const_pointer& __vt);
     void __move_construct_and_check(iterator __f, iterator __l,
                                     iterator __r, const_pointer& __vt);
     void __move_construct_backward_and_check(iterator __f, iterator __l,
                                              iterator __r, const_pointer& __vt);
 
     _LIBCPP_INLINE_VISIBILITY
     void __copy_assign_alloc(const deque& __c)
         {__copy_assign_alloc(__c, integral_constant<bool,
#endif
 
     _LIBCPP_INLINE_VISIBILITY
     void __copy_assign_alloc(const deque&, false_type)
         {}
 
     void __move_assign(deque& __c, true_type)
         _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value);
     void __move_assign(deque& __c, false_type);
+public:
+    ~deque() { __annotate_delete(); }
 };
 
 #if _LIBCPP_STD_VER >= 17
 template<class _InputIterator,
          class _Alloc = allocator<__iter_value_type<_InputIterator>>,
          class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
          class = enable_if_t<__is_allocator<_Alloc>::value>
          >
 deque(_InputIterator, _InputIterator)
   -> deque<__iter_value_type<_InputIterator>, _Alloc>;
 
 template<class _InputIterator,
          class _Alloc,
          class = enable_if_t<__is_cpp17_input_iterator<_InputIterator>::value>,
          class = enable_if_t<__is_allocator<_Alloc>::value>
          >
 deque(_InputIterator, _InputIterator, _Alloc)
   -> deque<__iter_value_type<_InputIterator>, _Alloc>;
 #endif
 
 template <class _Tp, class _Allocator>
 deque<_Tp, _Allocator>::deque(size_type __n)
 {
+    __annotate_new(0);
     if (__n > 0)
         __append(__n);
 }
 
 #if _LIBCPP_STD_VER > 11
 template <class _Tp, class _Allocator>
 deque<_Tp, _Allocator>::deque(size_type __n, const _Allocator& __a)
     : __base(__a)
 {
+    __annotate_new(0);
     if (__n > 0)
         __append(__n);
 }
 #endif
 
 template <class _Tp, class _Allocator>
 deque<_Tp, _Allocator>::deque(size_type __n, const value_type& __v)
 {
+    __annotate_new(0);
     if (__n > 0)
         __append(__n, __v);
 }
 
 template <class _Tp, class _Allocator>
 template <class _InputIter>
 deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l,
               typename enable_if<__is_cpp17_input_iterator<_InputIter>::value>::type*)
 {
+    __annotate_new(0);
     __append(__f, __l);
 }
 
 template <class _Tp, class _Allocator>
 template <class _InputIter>
 deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l, const allocator_type& __a,
               typename enable_if<__is_cpp17_input_iterator<_InputIter>::value>::type*)
     : __base(__a)
 {
+    __annotate_new(0);
     __append(__f, __l);
 }
 
 template <class _Tp, class _Allocator>
 deque<_Tp, _Allocator>::deque(const deque& __c)
     : __base(__alloc_traits::select_on_container_copy_construction(__c.__alloc()))
 {
+    __annotate_new(0);
     __append(__c.begin(), __c.end());
 }
 
 template <class _Tp, class _Allocator>
 deque<_Tp, _Allocator>::deque(const deque& __c, const __type_identity_t<allocator_type>& __a)
     : __base(__a)
 {
+    __annotate_new(0);
     __append(__c.begin(), __c.end());
 }
 
 template <class _Tp, class _Allocator>
 deque<_Tp, _Allocator>&
 deque<_Tp, _Allocator>::operator=(const deque& __c)
 {
     if (this != _VSTD::addressof(__c))
     {
         __copy_assign_alloc(__c);
         assign(__c.begin(), __c.end());
     }
     return *this;
 }
 
 #ifndef _LIBCPP_CXX03_LANG
 
 template <class _Tp, class _Allocator>
 deque<_Tp, _Allocator>::deque(initializer_list<value_type> __il)
 {
+    __annotate_new(0);
     __append(__il.begin(), __il.end());
 }
 
 template <class _Tp, class _Allocator>
 deque<_Tp, _Allocator>::deque(initializer_list<value_type> __il, const allocator_type& __a)
     : __base(__a)
 {
+    __annotate_new(0);
     __append(__il.begin(), __il.end());
 }
 
 template <class _Tp, class _Allocator>
 inline
 deque<_Tp, _Allocator>::deque(deque&& __c)
     _NOEXCEPT_(is_nothrow_move_constructible<__base>::value)
     : __base(_VSTD::move(__c))

 
 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::shrink_to_fit() _NOEXCEPT
 {
     allocator_type& __a = __base::__alloc();
     if (empty())
     {
+        __annotate_delete();
         while (__base::__map_.size() > 0)
         {
             __alloc_traits::deallocate(__a, __base::__map_.back(), __base::__block_size);
             __base::__map_.pop_back();
         }
         __base::__start_ = 0;
+        __annotate_new(0);
     }
     else
     {
       __maybe_remove_front_spare(/*__keep_one=*/false);
       __maybe_remove_back_spare(/*__keep_one=*/false);
     }
     __base::__map_.shrink_to_fit();
 }

 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::push_back(const value_type& __v)
 {
     allocator_type& __a = __base::__alloc();
     if (__back_spare() == 0)
         __add_back_capacity();
     // __back_spare() >= 1
+    __annotate_increase_back(1);
     __alloc_traits::construct(__a, _VSTD::addressof(*__base::end()), __v);
     ++__base::size();
 }
 
 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::push_front(const value_type& __v)
 {
     allocator_type& __a = __base::__alloc();
     if (__front_spare() == 0)
         __add_front_capacity();
     // __front_spare() >= 1
+    __annotate_increase_front(1);
     __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), __v);
     --__base::__start_;
     ++__base::size();
 }
 
 #ifndef _LIBCPP_CXX03_LANG
 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::push_back(value_type&& __v)
 {
     allocator_type& __a = __base::__alloc();
     if (__back_spare() == 0)
         __add_back_capacity();
     // __back_spare() >= 1
+    __annotate_increase_back(1);
     __alloc_traits::construct(__a, _VSTD::addressof(*__base::end()), _VSTD::move(__v));
     ++__base::size();
 }
 
 template <class _Tp, class _Allocator>
 template <class... _Args>
 #if _LIBCPP_STD_VER > 14
 typename deque<_Tp, _Allocator>::reference
 #else
 void
 #endif
 deque<_Tp, _Allocator>::emplace_back(_Args&&... __args)
 {
     allocator_type& __a = __base::__alloc();
     if (__back_spare() == 0)
         __add_back_capacity();
     // __back_spare() >= 1
+    __annotate_increase_back(1);
     __alloc_traits::construct(__a, _VSTD::addressof(*__base::end()),
                               _VSTD::forward<_Args>(__args)...);
     ++__base::size();
 #if _LIBCPP_STD_VER > 14
     return *--__base::end();
 #endif
 }
 
 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::push_front(value_type&& __v)
 {
     allocator_type& __a = __base::__alloc();
     if (__front_spare() == 0)
         __add_front_capacity();
     // __front_spare() >= 1
+    __annotate_increase_front(1);
     __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), _VSTD::move(__v));
     --__base::__start_;
     ++__base::size();
 }
 
 
 template <class _Tp, class _Allocator>
 template <class... _Args>
 #if _LIBCPP_STD_VER > 14
 typename deque<_Tp, _Allocator>::reference
 #else
 void
 #endif
 deque<_Tp, _Allocator>::emplace_front(_Args&&... __args)
 {
     allocator_type& __a = __base::__alloc();
     if (__front_spare() == 0)
         __add_front_capacity();
     // __front_spare() >= 1
+    __annotate_increase_front(1);
     __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), _VSTD::forward<_Args>(__args)...);
     --__base::__start_;
     ++__base::size();
 #if _LIBCPP_STD_VER > 14
     return *__base::begin();
 #endif
 }
 
 template <class _Tp, class _Allocator>
 typename deque<_Tp, _Allocator>::iterator
 deque<_Tp, _Allocator>::insert(const_iterator __p, value_type&& __v)
 {
     size_type __pos = __p - __base::begin();
     size_type __to_end = __base::size() - __pos;
     allocator_type& __a = __base::__alloc();
     if (__pos < __to_end)
     {   // insert by shifting things backward
         if (__front_spare() == 0)
             __add_front_capacity();
         // __front_spare() >= 1
+        __annotate_increase_front(1);
         if (__pos == 0)
         {
             __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), _VSTD::move(__v));
             --__base::__start_;
             ++__base::size();
         }
         else
         {
             iterator __b = __base::begin();
             iterator __bm1 = _VSTD::prev(__b);
             __alloc_traits::construct(__a, _VSTD::addressof(*__bm1), _VSTD::move(*__b));
             --__base::__start_;
             ++__base::size();
             if (__pos > 1)
                 __b = _VSTD::move(_VSTD::next(__b), __b + __pos, __b);
             *__b = _VSTD::move(__v);
         }
     }
     else
     {   // insert by shifting things forward
         if (__back_spare() == 0)
             __add_back_capacity();
         // __back_capacity >= 1
+        __annotate_increase_back(1);
         size_type __de = __base::size() - __pos;
         if (__de == 0)
         {
             __alloc_traits::construct(__a, _VSTD::addressof(*__base::end()), _VSTD::move(__v));
             ++__base::size();
         }
         else
         {
deque<_Tp, _Allocator>::emplace(const_iterator __p, _Args&&... __args)
     size_type __pos = __p - __base::begin();
     size_type __to_end = __base::size() - __pos;
     allocator_type& __a = __base::__alloc();
     if (__pos < __to_end)
     {   // insert by shifting things backward
         if (__front_spare() == 0)
             __add_front_capacity();
         // __front_spare() >= 1
+        __annotate_increase_front(1);
         if (__pos == 0)
         {
             __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), _VSTD::forward<_Args>(__args)...);
             --__base::__start_;
             ++__base::size();
         }
         else
         {
             __temp_value<value_type, _Allocator> __tmp(this->__alloc(), _VSTD::forward<_Args>(__args)...);
             iterator __b = __base::begin();
             iterator __bm1 = _VSTD::prev(__b);
             __alloc_traits::construct(__a, _VSTD::addressof(*__bm1), _VSTD::move(*__b));
             --__base::__start_;
             ++__base::size();
             if (__pos > 1)
                 __b = _VSTD::move(_VSTD::next(__b), __b + __pos, __b);
             *__b = _VSTD::move(__tmp.get());
         }
     }
     else
     {   // insert by shifting things forward
         if (__back_spare() == 0)
             __add_back_capacity();
         // __back_capacity >= 1
+        __annotate_increase_back(1);
         size_type __de = __base::size() - __pos;
         if (__de == 0)
         {
             __alloc_traits::construct(__a, _VSTD::addressof(*__base::end()), _VSTD::forward<_Args>(__args)...);
             ++__base::size();
         }
         else
         {
deque<_Tp, _Allocator>::insert(const_iterator __p, const value_type& __v)
     size_type __pos = __p - __base::begin();
     size_type __to_end = __base::size() - __pos;
     allocator_type& __a = __base::__alloc();
     if (__pos < __to_end)
     {   // insert by shifting things backward
         if (__front_spare() == 0)
             __add_front_capacity();
         // __front_spare() >= 1
+        __annotate_increase_front(1);
         if (__pos == 0)
         {
             __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), __v);
             --__base::__start_;
             ++__base::size();
         }
         else
         {
if (__pos < __to_end)
             *__b = *__vt;
         }
     }
     else
     {   // insert by shifting things forward
         if (__back_spare() == 0)
             __add_back_capacity();
         // __back_capacity >= 1
+        __annotate_increase_back(1);
         size_type __de = __base::size() - __pos;
         if (__de == 0)
         {
             __alloc_traits::construct(__a, _VSTD::addressof(*__base::end()), __v);
             ++__base::size();
         }
         else
         {
deque<_Tp, _Allocator>::insert(const_iterator __p, size_type __n, const value_type& __v)
     size_type __pos = __p - __base::begin();
     size_type __to_end = __base::size() - __pos;
     allocator_type& __a = __base::__alloc();
     if (__pos < __to_end)
     {   // insert by shifting things backward
         if (__n > __front_spare())
             __add_front_capacity(__n - __front_spare());
         // __n <= __front_spare()
+        __annotate_increase_front(__n);
         iterator __old_begin = __base::begin();
         iterator __i = __old_begin;
         if (__n > __pos)
         {
             for (size_type __m = __n - __pos; __m; --__m, --__base::__start_, ++__base::size())
                 __alloc_traits::construct(__a, _VSTD::addressof(*--__i), __v);
             __n = __pos;
         }
         if (__n > 0)
         {
             const_pointer __vt = pointer_traits<const_pointer>::pointer_to(__v);
             iterator __obn = __old_begin + __n;
             __move_construct_backward_and_check(__old_begin, __obn, __i, __vt);
             if (__n < __pos)
                 __old_begin = __move_and_check(__obn, __old_begin + __pos, __old_begin, __vt);
             _VSTD::fill_n(__old_begin, __n, *__vt);
         }
     }
     else
     {   // insert by shifting things forward
         size_type __back_capacity = __back_spare();
         if (__n > __back_capacity)
             __add_back_capacity(__n - __back_capacity);
         // __n <= __back_capacity
+        __annotate_increase_back(__n);
         iterator __old_end = __base::end();
         iterator __i = __old_end;
         size_type __de = __base::size() - __pos;
         if (__n > __de)
         {
             for (size_type __m = __n - __de; __m; --__m, (void) ++__i, ++__base::size())
                 __alloc_traits::construct(__a, _VSTD::addressof(*__i), __v);
             __n = __de;
deque<_Tp, _Allocator>::insert(const_iterator __p, _BiIter __f, _BiIter __l,
     size_type __pos = __p - __base::begin();
     size_type __to_end = __base::size() - __pos;
     allocator_type& __a = __base::__alloc();
     if (__pos < __to_end)
     {   // insert by shifting things backward
         if (__n > __front_spare())
             __add_front_capacity(__n - __front_spare());
         // __n <= __front_spare()
+        __annotate_increase_front(__n);
         iterator __old_begin = __base::begin();
         iterator __i = __old_begin;
         _BiIter __m = __f;
         if (__n > __pos)
         {
             __m = __pos < __n / 2 ? _VSTD::prev(__l, __pos) : _VSTD::next(__f, __n - __pos);
             for (_BiIter __j = __m; __j != __f; --__base::__start_, ++__base::size())
                 __alloc_traits::construct(__a, _VSTD::addressof(*--__i), *--__j);
if (__pos < __to_end)
         }
     }
     else
     {   // insert by shifting things forward
         size_type __back_capacity = __back_spare();
         if (__n > __back_capacity)
             __add_back_capacity(__n - __back_capacity);
         // __n <= __back_capacity
+        __annotate_increase_back(__n);
         iterator __old_end = __base::end();
         iterator __i = __old_end;
         _BiIter __m = __l;
         size_type __de = __base::size() - __pos;
         if (__n > __de)
         {
             __m = __de < __n / 2 ? _VSTD::next(__f, __de) : _VSTD::prev(__l, __n - __de);
             for (_BiIter __j = __m; __j != __l; ++__i, (void) ++__j, ++__base::size())
deque<_Tp, _Allocator>::__append(_ForIter __f, _ForIter __l,
                                  typename enable_if<__is_cpp17_forward_iterator<_ForIter>::value>::type*)
 {
     size_type __n = _VSTD::distance(__f, __l);
     allocator_type& __a = __base::__alloc();
     size_type __back_capacity = __back_spare();
     if (__n > __back_capacity)
         __add_back_capacity(__n - __back_capacity);
     // __n <= __back_capacity
+    __annotate_increase_back(__n);
     for (__deque_block_range __br : __deque_range(__base::end(), __base::end() + __n)) {
       _ConstructTransaction __tx(this, __br);
       for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_, (void)++__f) {
         __alloc_traits::construct(__a, _VSTD::__to_address(__tx.__pos_), *__f);
       }
     }
 }
 
 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::__append(size_type __n)
 {
     allocator_type& __a = __base::__alloc();
     size_type __back_capacity = __back_spare();
     if (__n > __back_capacity)
         __add_back_capacity(__n - __back_capacity);
     // __n <= __back_capacity
+    __annotate_increase_back(__n);
     for (__deque_block_range __br : __deque_range(__base::end(), __base::end() + __n)) {
       _ConstructTransaction __tx(this, __br);
       for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_) {
         __alloc_traits::construct(__a, _VSTD::__to_address(__tx.__pos_));
       }
     }
 }
 
 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::__append(size_type __n, const value_type& __v)
 {
     allocator_type& __a = __base::__alloc();
     size_type __back_capacity = __back_spare();
     if (__n > __back_capacity)
         __add_back_capacity(__n - __back_capacity);
     // __n <= __back_capacity
+    __annotate_increase_back(__n);
     for (__deque_block_range __br : __deque_range(__base::end(), __base::end() + __n)) {
       _ConstructTransaction __tx(this, __br);
       for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_) {
         __alloc_traits::construct(__a, _VSTD::__to_address(__tx.__pos_), __v);
       }
     }
 
 }
deque<_Tp, _Allocator>::__add_front_capacity()
     }
     // Else if __base::__map_.size() < __base::__map_.capacity() then we need to allocate 1 buffer
     else if (__base::__map_.size() < __base::__map_.capacity())
     {   // we can put the new buffer into the map, but don't shift things around
         // until all buffers are allocated.  If we throw, we don't need to fix
         // anything up (any added buffers are undetectible)
         if (__base::__map_.__front_spare() > 0)
             __base::__map_.push_front(__alloc_traits::allocate(__a, __base::__block_size));
         else
         {
             __base::__map_.push_back(__alloc_traits::allocate(__a, __base::__block_size));
             // Done allocating, reorder capacity
             pointer __pt = __base::__map_.back();
             __base::__map_.pop_back();
             __base::__map_.push_front(__pt);
         }
         __base::__start_ = __base::__map_.size() == 1 ?
                                __base::__block_size / 2 :
                                __base::__start_ + __base::__block_size;
+        __annotate_poison_from_to_back(0, __base::__block_size);
     }
     // Else need to allocate 1 buffer, *and* we need to reallocate __map_.
     else
     {
         __split_buffer<pointer, typename __base::__pointer_allocator&>
             __buf(max<size_type>(2 * __base::__map_.capacity(), 1),
                   0, __base::__map_.__alloc());
 
else
             __buf.push_back(*__i);
         _VSTD::swap(__base::__map_.__first_, __buf.__first_);
         _VSTD::swap(__base::__map_.__begin_, __buf.__begin_);
         _VSTD::swap(__base::__map_.__end_, __buf.__end_);
         _VSTD::swap(__base::__map_.__end_cap(), __buf.__end_cap());
         __base::__start_ = __base::__map_.size() == 1 ?
                                __base::__block_size / 2 :
                                __base::__start_ + __base::__block_size;
+        __annotate_poison_from_to_back(0, __base::__block_size);
     }
 }
 
 // Create front capacity for __n elements.
 // Strong guarantee.  Either do it or don't touch anything.
 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::__add_front_capacity(size_type __n)
deque<_Tp, _Allocator>::__add_front_capacity(size_type __n)
     {   // we can put the new buffers into the map, but don't shift things around
         // until all buffers are allocated.  If we throw, we don't need to fix
         // anything up (any added buffers are undetectible)
         for (; __nb > 0; --__nb, __base::__start_ += __base::__block_size - (__base::__map_.size() == 1))
         {
             if (__base::__map_.__front_spare() == 0)
                 break;
             __base::__map_.push_front(__alloc_traits::allocate(__a, __base::__block_size));
+            __annotate_poison_from_to_back(0, __base::__block_size);
         }
         for (; __nb > 0; --__nb, ++__back_capacity)
             __base::__map_.push_back(__alloc_traits::allocate(__a, __base::__block_size));
         // Done allocating, reorder capacity
         __base::__start_ += __back_capacity * __base::__block_size;
         for (; __back_capacity > 0; --__back_capacity)
         {
             pointer __pt = __base::__map_.back();
             __base::__map_.pop_back();
             __base::__map_.push_front(__pt);
+            __annotate_poison_from_to_back(0, __base::__block_size);
         }
     }
     // Else need to allocate __nb buffers, *and* we need to reallocate __map_.
     else
     {
         size_type __ds = (__nb + __back_capacity) * __base::__block_size - __base::__map_.empty();
         __split_buffer<pointer, typename __base::__pointer_allocator&>
             __buf(max<size_type>(2* __base::__map_.capacity(),
                                  __nb + __base::__map_.size()),
                   0, __base::__map_.__alloc());
 #ifndef _LIBCPP_NO_EXCEPTIONS
         try
         {
 #endif // _LIBCPP_NO_EXCEPTIONS
             for (; __nb > 0; --__nb)
+            {
                 __buf.push_back(__alloc_traits::allocate(__a, __base::__block_size));
+                // ASan: this is empty container, we have to poison whole
+                __annotate_contiguous_container_back(_VSTD::__to_address(__buf.back()),
+                    _VSTD::__to_address(__buf.back() + __base::__block_size),
+                    _VSTD::__to_address(__buf.back() + __base::__block_size),
+                    _VSTD::__to_address(__buf.back()),
+                    _VSTD::__to_address(__buf.back())
+                );
+            }
 #ifndef _LIBCPP_NO_EXCEPTIONS
         }
         catch (...)
         {
+            __annotate_delete();
             for (typename __base::__map_pointer __i = __buf.begin();
                     __i != __buf.end(); ++__i)
                 __alloc_traits::deallocate(__a, *__i, __base::__block_size);
             throw;
         }
 #endif // _LIBCPP_NO_EXCEPTIONS
         for (; __back_capacity > 0; --__back_capacity)
         {
else if (__base::__map_.size() < __base::__map_.capacity())
         else
         {
             __base::__map_.push_front(__alloc_traits::allocate(__a, __base::__block_size));
             // Done allocating, reorder capacity
             pointer __pt = __base::__map_.front();
             __base::__map_.pop_front();
             __base::__map_.push_back(__pt);
         }
+        __annotate_poison_from_to_back((__base::__map_.size() - 1) * __base::__block_size, __base::__map_.size() * __base::__block_size);
     }
     // Else need to allocate 1 buffer, *and* we need to reallocate __map_.
     else
     {
         __split_buffer<pointer, typename __base::__pointer_allocator&>
             __buf(max<size_type>(2* __base::__map_.capacity(), 1),
                   __base::__map_.size(),
                   __base::__map_.__alloc());
 
         typedef __allocator_destructor<_Allocator> _Dp;
         unique_ptr<pointer, _Dp> __hold(
             __alloc_traits::allocate(__a, __base::__block_size),
                 _Dp(__a, __base::__block_size));
         __buf.push_back(__hold.get());
         __hold.release();
 
         for (typename __base::__map_pointer __i = __base::__map_.end();
                 __i != __base::__map_.begin();)
             __buf.push_front(*--__i);
         _VSTD::swap(__base::__map_.__first_, __buf.__first_);
         _VSTD::swap(__base::__map_.__begin_, __buf.__begin_);
         _VSTD::swap(__base::__map_.__end_, __buf.__end_);
         _VSTD::swap(__base::__map_.__end_cap(), __buf.__end_cap());
+        __annotate_poison_from_to_back((__base::__map_.size() - 1) * __base::__block_size, __base::__map_.size() * __base::__block_size);
     }
 }
 
 // Create back capacity for __n elements.
 // Strong guarantee.  Either do it or don't touch anything.
 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::__add_back_capacity(size_type __n)
deque<_Tp, _Allocator>::__add_back_capacity(size_type __n)
     {   // we can put the new buffers into the map, but don't shift things around
         // until all buffers are allocated.  If we throw, we don't need to fix
         // anything up (any added buffers are undetectible)
         for (; __nb > 0; --__nb)
         {
             if (__base::__map_.__back_spare() == 0)
                 break;
             __base::__map_.push_back(__alloc_traits::allocate(__a, __base::__block_size));
+            __annotate_poison_from_to_back((__base::__map_.size() - 1) * __base::__block_size, __base::__map_.size() * __base::__block_size);
         }
         for (; __nb > 0; --__nb, ++__front_capacity, __base::__start_ +=
                                  __base::__block_size - (__base::__map_.size() == 1))
+        {
             __base::__map_.push_front(__alloc_traits::allocate(__a, __base::__block_size));
+            __annotate_poison_from_to_back(0, __base::__block_size);
+        }
         // Done allocating, reorder capacity
         __base::__start_ -= __base::__block_size * __front_capacity;
         for (; __front_capacity > 0; --__front_capacity)
         {
             pointer __pt = __base::__map_.front();
             __base::__map_.pop_front();
             __base::__map_.push_back(__pt);
         }
     }
     // Else need to allocate __nb buffers, *and* we need to reallocate __map_.
     else
     {
         size_type __ds = __front_capacity * __base::__block_size;
         __split_buffer<pointer, typename __base::__pointer_allocator&>
             __buf(max<size_type>(2* __base::__map_.capacity(),
                                  __nb + __base::__map_.size()),
                   __base::__map_.size() - __front_capacity,
                   __base::__map_.__alloc());
 #ifndef _LIBCPP_NO_EXCEPTIONS
         try
         {
 #endif // _LIBCPP_NO_EXCEPTIONS
             for (; __nb > 0; --__nb)
+            {
                 __buf.push_back(__alloc_traits::allocate(__a, __base::__block_size));
+                // ASan: this is empty container, we have to poison whole
+                __annotate_contiguous_container_back(_VSTD::__to_address(__buf.back()),
+                    _VSTD::__to_address(__buf.back() + __base::__block_size),
+                    _VSTD::__to_address(__buf.back() + __base::__block_size),
+                    _VSTD::__to_address(__buf.back()),
+                    _VSTD::__to_address(__buf.back())
+                );
+            }
 #ifndef _LIBCPP_NO_EXCEPTIONS
         }
         catch (...)
         {
+            __annotate_delete();
             for (typename __base::__map_pointer __i = __buf.begin();
                     __i != __buf.end(); ++__i)
                 __alloc_traits::deallocate(__a, *__i, __base::__block_size);
             throw;
         }
 #endif // _LIBCPP_NO_EXCEPTIONS
         for (; __front_capacity > 0; --__front_capacity)
         {
#endif // _LIBCPP_NO_EXCEPTIONS
         __base::__start_ -= __ds;
     }
 }
 
 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::pop_front()
 {
+    size_type __old_sz = __base::size();
+    size_type __old_start = __base::__start_;
     allocator_type& __a = __base::__alloc();
     __alloc_traits::destroy(__a, _VSTD::__to_address(*(__base::__map_.begin() +
                                                     __base::__start_ / __base::__block_size) +
                                                     __base::__start_ % __base::__block_size));
     --__base::size();
     ++__base::__start_;
+    __annotate_shrink_front(__old_sz, __old_start);
     __maybe_remove_front_spare();
 }
 
 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::pop_back()
 {
     _LIBCPP_ASSERT(!empty(), "deque::pop_back called on an empty deque");
+    size_type __old_sz = __base::size();
+    size_type __old_start = __base::__start_;
     allocator_type& __a = __base::__alloc();
     size_type __p = __base::size() + __base::__start_ - 1;
     __alloc_traits::destroy(__a, _VSTD::__to_address(*(__base::__map_.begin() +
                                                     __p / __base::__block_size) +
                                                     __p % __base::__block_size));
     --__base::size();
+    __annotate_shrink_back(__old_sz, __old_start);
     __maybe_remove_back_spare();
 }
 
 // move assign [__f, __l) to [__r, __r + (__l-__f)).
 // If __vt points into [__f, __l), then subtract (__f - __r) from __vt.
 template <class _Tp, class _Allocator>
 typename deque<_Tp, _Allocator>::iterator
 deque<_Tp, _Allocator>::__move_and_check(iterator __f, iterator __l, iterator __r,
while (__n > 0)
         __l -= __bs - 1;
     }
 }
 
 template <class _Tp, class _Allocator>
 typename deque<_Tp, _Allocator>::iterator
 deque<_Tp, _Allocator>::erase(const_iterator __f)
 {
+    size_type __old_sz = __base::size();
+    size_type __old_start = __base::__start_;
     iterator __b = __base::begin();
     difference_type __pos = __f - __b;
     iterator __p = __b + __pos;
     allocator_type& __a = __base::__alloc();
     if (static_cast<size_t>(__pos) <= (__base::size() - 1) / 2)
     {   // erase from front
         _VSTD::move_backward(__b, __p, _VSTD::next(__p));
         __alloc_traits::destroy(__a, _VSTD::addressof(*__b));
         --__base::size();
         ++__base::__start_;
+        __annotate_shrink_front(__old_sz, __old_start);
         __maybe_remove_front_spare();
     }
     else
     {   // erase from back
         iterator __i = _VSTD::move(_VSTD::next(__p), __base::end(), __p);
         __alloc_traits::destroy(__a, _VSTD::addressof(*__i));
         --__base::size();
+        __annotate_shrink_back(__old_sz, __old_start);
         __maybe_remove_back_spare();
     }
     return __base::begin() + __pos;
 }
 
 template <class _Tp, class _Allocator>
 typename deque<_Tp, _Allocator>::iterator
 deque<_Tp, _Allocator>::erase(const_iterator __f, const_iterator __l)
 {
+    size_type __old_sz = __base::size();
+    size_type __old_start = __base::__start_;
     difference_type __n = __l - __f;
     iterator __b = __base::begin();
     difference_type __pos = __f - __b;
     iterator __p = __b + __pos;
     if (__n > 0)
     {
         allocator_type& __a = __base::__alloc();
         if (static_cast<size_t>(__pos) <= (__base::size() - __n) / 2)
         {   // erase from front
             iterator __i = _VSTD::move_backward(__b, __p, __p + __n);
             for (; __b != __i; ++__b)
                 __alloc_traits::destroy(__a, _VSTD::addressof(*__b));
             __base::size() -= __n;
             __base::__start_ += __n;
+            __annotate_shrink_front(__old_sz, __old_start);
             while (__maybe_remove_front_spare()) {
             }
         }
         else
         {   // erase from back
             iterator __i = _VSTD::move(__p + __n, __base::end(), __p);
             for (iterator __e = __base::end(); __i != __e; ++__i)
                 __alloc_traits::destroy(__a, _VSTD::addressof(*__i));
             __base::size() -= __n;
+            __annotate_shrink_back(__old_sz, __old_start);
             while (__maybe_remove_back_spare()) {
             }
         }
     }
     return __base::begin() + __pos;
 }
 
 template <class _Tp, class _Allocator>
 void
 deque<_Tp, _Allocator>::__erase_to_end(const_iterator __f)
 {
+    size_type __old_sz = __base::size();
+    size_type __old_start = __base::__start_;
     iterator __e = __base::end();
     difference_type __n = __e - __f;
     if (__n > 0)
     {
         allocator_type& __a = __base::__alloc();
         iterator __b = __base::begin();
         difference_type __pos = __f - __b;
         for (iterator __p = __b + __pos; __p != __e; ++__p)
             __alloc_traits::destroy(__a, _VSTD::addressof(*__p));
         __base::size() -= __n;
+        __annotate_shrink_back(__old_sz, __old_start);
         while (__maybe_remove_back_spare()) {
         }
     }
 }
 
 template <class _Tp, class _Allocator>
 inline
 void
 deque<_Tp, _Allocator>::swap(deque& __c)
 #if _LIBCPP_STD_VER >= 14
         _NOEXCEPT
 #else
         _NOEXCEPT_(!__alloc_traits::propagate_on_container_swap::value ||
                     __is_nothrow_swappable<allocator_type>::value)
 #endif
 {
     __base::swap(__c);
 }
 
 template <class _Tp, class _Allocator>
 inline
 void
 deque<_Tp, _Allocator>::clear() _NOEXCEPT
 {
+    __annotate_delete();
     __base::clear();
+    __annotate_new(0);
 }
 
 template <class _Tp, class _Allocator>
 inline _LIBCPP_INLINE_VISIBILITY
 bool
 operator==(const deque<_Tp, _Allocator>& __x, const deque<_Tp, _Allocator>& __y)
 {
     const typename deque<_Tp, _Allocator>::size_type __sz = __x.size();

libcxx/test/std/containers/sequences/deque/deque.asan/assign.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+#if TEST_STD_VER >= 11
+template <typename T>
+void test_assign_d5(const size_t N) {
+  typedef std::deque<T> D;
+  D empty_d5;
+  D short_d5a(1), short_d5b(N - 1);
+  D mid_d5(N + 1);
+  D long_d5(32 * N + 1);
+
+  empty_d5.assign({T(), T()});
+  short_d5a.assign({T(), T()});
+  short_d5b.assign({T(), T()});
+  mid_d5.assign({T(), T()});
+  long_d5.assign({T(), T()});
+
+  assert(is_de_contiguous_container_asan_correct(empty_d5));
+  assert(is_de_contiguous_container_asan_correct(short_d5a));
+  assert(is_de_contiguous_container_asan_correct(short_d5b));
+  assert(is_de_contiguous_container_asan_correct(mid_d5));
+  assert(is_de_contiguous_container_asan_correct(long_d5));
+
+  empty_d5.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+  short_d5a.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+  short_d5b.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+  mid_d5.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+  long_d5.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+
+  assert(empty_d5.size() > 16);
+  assert(short_d5a.size() > 16);
+  assert(short_d5b.size() > 16);
+  assert(mid_d5.size() > 16);
+  assert(long_d5.size() > 16);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d5));
+  assert(is_de_contiguous_container_asan_correct(short_d5a));
+  assert(is_de_contiguous_container_asan_correct(short_d5b));
+  assert(is_de_contiguous_container_asan_correct(mid_d5));
+  assert(is_de_contiguous_container_asan_correct(long_d5));
+}
+
+template <typename T>
+void test_assign_d6(const size_t N) {
+  typedef std::deque<T> D;
+  D empty_d6;
+  D short_d6a(1), short_d6b(N - 1);
+  D mid_d6(N + 1);
+  D long_d6(32 * N + 1);
+
+  empty_d6.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+  short_d6a.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+  short_d6b.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+  mid_d6.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+  long_d6.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+
+  assert(empty_d6.size() > 16);
+  assert(short_d6a.size() > 16);
+  assert(short_d6b.size() > 16);
+  assert(mid_d6.size() > 16);
+  assert(long_d6.size() > 16);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d6));
+  assert(is_de_contiguous_container_asan_correct(short_d6a));
+  assert(is_de_contiguous_container_asan_correct(short_d6b));
+  assert(is_de_contiguous_container_asan_correct(mid_d6));
+  assert(is_de_contiguous_container_asan_correct(long_d6));
+}
+
+template <typename T>
+void test_assign_d7(const size_t N) {
+  typedef std::deque<T> D;
+  const T val = T();
+  D empty_d7;
+  D short_d7a(1), short_d7b(N - 1);
+  D mid_d7(N + 1);
+  D long_d7(32 * N + 1);
+
+  empty_d7.assign({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
+  short_d7a.assign({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
+  short_d7b.assign({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
+  mid_d7.assign({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
+  long_d7.assign({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
+
+  assert(empty_d7.size() > 16);
+  assert(short_d7a.size() > 16);
+  assert(short_d7b.size() > 16);
+  assert(mid_d7.size() > 16);
+  assert(long_d7.size() > 16);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d7));
+  assert(is_de_contiguous_container_asan_correct(short_d7a));
+  assert(is_de_contiguous_container_asan_correct(short_d7b));
+  assert(is_de_contiguous_container_asan_correct(mid_d7));
+  assert(is_de_contiguous_container_asan_correct(long_d7));
+}
+#endif
+
+template <typename T>
+void test_assign() {
+  typedef std::deque<T> D;
+  const size_t N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  // void assign( size_type count, const T& value );
+
+  D empty_d1;
+  D short_d1a(1), short_d1b(N - 1);
+  D mid_d1(N + 1);
+  D long_d1(32 * N + 1);
+
+  empty_d1.assign(2, T());
+  short_d1a.assign(2, T());
+  short_d1b.assign(2, T());
+  mid_d1.assign(2, T());
+  long_d1.assign(2, T());
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1));
+  assert(is_de_contiguous_container_asan_correct(long_d1));
+
+  empty_d1.assign(2 * N, T());
+  short_d1a.assign(2 * N, T());
+  short_d1b.assign(2 * N, T());
+  mid_d1.assign(2 * N, T());
+  long_d1.assign(2 * N, T());
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1));
+  assert(is_de_contiguous_container_asan_correct(long_d1));
+
+  D empty_d2;
+  D short_d2a(1), short_d2b(N - 1);
+  D mid_d2(N + 1);
+  D long_d2(32 * N + 1);
+
+  empty_d2.assign(42 * N, T());
+  short_d2a.assign(42 * N, T());
+  short_d2b.assign(42 * N, T());
+  mid_d2.assign(42 * N, T());
+  long_d2.assign(42 * N, T());
+
+  assert(is_de_contiguous_container_asan_correct(empty_d2));
+  assert(is_de_contiguous_container_asan_correct(short_d2a));
+  assert(is_de_contiguous_container_asan_correct(short_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2));
+  assert(is_de_contiguous_container_asan_correct(long_d2));
+
+  // template< class InputIt >
+  // void assign( InputIt first, InputIt last );
+  D source_d(50 * N);
+
+  D empty_d3;
+  D short_d3a(1), short_d3b(N - 1);
+  D mid_d3(N + 1);
+  D long_d3(32 * N + 1);
+
+  empty_d3.assign(source_d.begin() + N - 1, source_d.begin() + N + 1);
+  short_d3a.assign(source_d.begin() + N - 1, source_d.begin() + N + 1);
+  short_d3b.assign(source_d.begin() + N - 1, source_d.begin() + N + 1);
+  mid_d3.assign(source_d.begin() + N - 1, source_d.begin() + N + 1);
+  long_d3.assign(source_d.begin() + N - 1, source_d.begin() + N + 1);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d3));
+  assert(is_de_contiguous_container_asan_correct(short_d3a));
+  assert(is_de_contiguous_container_asan_correct(short_d3b));
+  assert(is_de_contiguous_container_asan_correct(mid_d3));
+  assert(is_de_contiguous_container_asan_correct(long_d3));
+  assert(is_de_contiguous_container_asan_correct(source_d));
+
+  empty_d3.assign(source_d.begin() + N, source_d.begin() + 3 * N);
+  short_d3a.assign(source_d.begin() + N, source_d.begin() + 3 * N);
+  short_d3b.assign(source_d.begin() + N, source_d.begin() + 3 * N);
+  mid_d3.assign(source_d.begin() + N, source_d.begin() + 3 * N);
+  long_d3.assign(source_d.begin() + N, source_d.begin() + 3 * N);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d3));
+  assert(is_de_contiguous_container_asan_correct(short_d3a));
+  assert(is_de_contiguous_container_asan_correct(short_d3b));
+  assert(is_de_contiguous_container_asan_correct(mid_d3));
+  assert(is_de_contiguous_container_asan_correct(long_d3));
+  assert(is_de_contiguous_container_asan_correct(source_d));
+
+  D empty_d4;
+  D short_d4a(1), short_d4b(N - 1);
+  D mid_d4(N + 1);
+  D long_d4(32 * N + 1);
+
+  empty_d4.assign(source_d.end() - 42 * N - 1, source_d.end() - 1);
+  short_d4a.assign(source_d.end() - 42 * N - 1, source_d.end() - 1);
+  short_d4b.assign(source_d.end() - 42 * N - 1, source_d.end() - 1);
+  mid_d4.assign(source_d.end() - 42 * N - 1, source_d.end() - 1);
+  long_d4.assign(source_d.end() - 42 * N - 1, source_d.end() - 1);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d4));
+  assert(is_de_contiguous_container_asan_correct(short_d4a));
+  assert(is_de_contiguous_container_asan_correct(short_d4b));
+  assert(is_de_contiguous_container_asan_correct(mid_d4));
+  assert(is_de_contiguous_container_asan_correct(long_d4));
+  assert(is_de_contiguous_container_asan_correct(source_d));
+
+#if TEST_STD_VER >= 11
+  // void assign( std::initializer_list<T> ilist );
+  test_assign_d5<T>(N);
+  test_assign_d6<T>(N);
+  test_assign_d7<T>(N);
+#endif
+}
+
+template <typename T>
+void test_operator() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  // deque& operator=( const deque& other );
+
+  D empty_d1, empty_d2;
+  D mid_d1(N), mid_d2(N);
+  D long_d1(32 * N), long_d2(32 * N);
+
+  empty_d1 = empty_d2;
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(empty_d2));
+  empty_d1 = mid_d1;
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(mid_d1));
+  empty_d1 = empty_d2;
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(empty_d2));
+  empty_d1 = long_d1;
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(long_d1));
+  empty_d1 = empty_d2;
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(empty_d2));
+
+  empty_d2 = long_d1;
+  assert(is_de_contiguous_container_asan_correct(empty_d2));
+
+  mid_d1 = long_d1;
+  assert(is_de_contiguous_container_asan_correct(mid_d1));
+  mid_d1 = empty_d2;
+  assert(is_de_contiguous_container_asan_correct(mid_d1));
+  mid_d1 = long_d1;
+  assert(is_de_contiguous_container_asan_correct(mid_d1));
+  mid_d1 = mid_d2;
+  assert(is_de_contiguous_container_asan_correct(mid_d1));
+
+  long_d1 = long_d2;
+  assert(is_de_contiguous_container_asan_correct(long_d1));
+  long_d1 = empty_d1;
+  assert(is_de_contiguous_container_asan_correct(long_d1));
+  long_d1 = long_d2;
+  assert(is_de_contiguous_container_asan_correct(long_d1));
+
+  empty_d1 = D();
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  mid_d1 = D();
+  assert(is_de_contiguous_container_asan_correct(mid_d1));
+  long_d1 = D();
+  assert(is_de_contiguous_container_asan_correct(long_d1));
+
+  mid_d1 = mid_d2;
+  assert(is_de_contiguous_container_asan_correct(mid_d1));
+  long_d1 = long_d2;
+  assert(is_de_contiguous_container_asan_correct(long_d1));
+
+  // deque& operator=( deque&& other )
+
+#if TEST_STD_VER >= 11
+  mid_d1 = std::move(mid_d2);
+  assert(is_de_contiguous_container_asan_correct(mid_d1));
+  assert(is_de_contiguous_container_asan_correct(mid_d2));
+  long_d1 = std::move(long_d2);
+  assert(is_de_contiguous_container_asan_correct(long_d1));
+  assert(is_de_contiguous_container_asan_correct(long_d2));
+
+  D mid_d3a(N), mid_d3b(N);
+  D long_d3a(32 * N), long_d3b(32 * N);
+
+  mid_d3a  = std::move(long_d3a);
+  long_d3b = std::move(mid_d3b);
+  assert(is_de_contiguous_container_asan_correct(mid_d3a));
+  assert(is_de_contiguous_container_asan_correct(mid_d3b));
+  assert(is_de_contiguous_container_asan_correct(long_d3a));
+  assert(is_de_contiguous_container_asan_correct(long_d3b));
+
+  D empty_d4;
+  D long_d4a(32 * N), long_d4b(32 * N);
+
+  long_d4a = std::move(empty_d4);
+  long_d4b = std::move(empty_d1);
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(empty_d4));
+  assert(is_de_contiguous_container_asan_correct(long_d4a));
+  assert(is_de_contiguous_container_asan_correct(long_d4b));
+#endif
+
+  // void assign( std::initializer_list<T> ilist )
+
+  D empty_d5;
+  D short_d5a(1), short_d5b(N - 1);
+  D mid_d5(N + 1);
+  D long_d5(32 * N + 1);
+
+  empty_d5  = {T(), T()};
+  short_d5a = {T(), T()};
+  short_d5b = {T(), T()};
+  mid_d5    = {T(), T()};
+  long_d5   = {T(), T()};
+
+  assert(is_de_contiguous_container_asan_correct(empty_d5));
+  assert(is_de_contiguous_container_asan_correct(short_d5a));
+  assert(is_de_contiguous_container_asan_correct(short_d5b));
+  assert(is_de_contiguous_container_asan_correct(mid_d5));
+  assert(is_de_contiguous_container_asan_correct(long_d5));
+
+  empty_d5  = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
+  short_d5a = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
+  short_d5b = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
+  mid_d5    = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
+  long_d5   = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
+
+  assert(empty_d5.size() > 16);
+  assert(short_d5a.size() > 16);
+  assert(short_d5b.size() > 16);
+  assert(mid_d5.size() > 16);
+  assert(long_d5.size() > 16);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d5));
+  assert(is_de_contiguous_container_asan_correct(short_d5a));
+  assert(is_de_contiguous_container_asan_correct(short_d5b));
+  assert(is_de_contiguous_container_asan_correct(mid_d5));
+  assert(is_de_contiguous_container_asan_correct(long_d5));
+
+  D empty_d6;
+  D short_d6a(1), short_d6b(N - 1);
+  D mid_d6(N + 1);
+  D long_d6(32 * N + 1);
+
+  empty_d6  = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
+  short_d6a = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
+  short_d6b = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
+  mid_d6    = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
+  long_d6   = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
+
+  assert(empty_d6.size() > 16);
+  assert(short_d6a.size() > 16);
+  assert(short_d6b.size() > 16);
+  assert(mid_d6.size() > 16);
+  assert(long_d6.size() > 16);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d6));
+  assert(is_de_contiguous_container_asan_correct(short_d6a));
+  assert(is_de_contiguous_container_asan_correct(short_d6b));
+  assert(is_de_contiguous_container_asan_correct(mid_d6));
+  assert(is_de_contiguous_container_asan_correct(long_d6));
+}
+
+template <typename T>
+void test() {
+  test_assign<T>();
+  test_operator<T>();
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        test<T>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/clear.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+template <typename T>
+void test() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  // void clear()
+
+  D empty_d1;
+  D short_d1a(1), short_d1b(2);
+  D mid_d1a(N - 1), mid_d1b(N), mid_d1c(N + 1);
+  D long_d1a(17 * N - 1), long_d1b(8 * N), long_d1c(11 * N + 1);
+
+  empty_d1.clear();
+  short_d1a.clear();
+  short_d1b.clear();
+  mid_d1a.clear();
+  mid_d1b.clear();
+  mid_d1c.clear();
+  long_d1a.clear();
+  long_d1b.clear();
+  long_d1c.clear();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        typedef std::deque<T> D;
+        test<D>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/constructor.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+template <typename T>
+void test() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  // Different constructors are called based on the used standard.
+  // Please, check https://en.cppreference.com/w/cpp/container/deque/deque
+  // for full list.
+
+  D empty_d1;
+  D short_d1a(1), short_d1b(2);
+  D mid_d1a(N - 1), mid_d1b(N), mid_d1c(N + 1);
+  D long_d1a(17 * N - 1), long_d1b(8 * N), long_d1c(11 * N + 1);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  D empty_d2(empty_d1);
+  D short_d2a(short_d1a), short_d2b(short_d1b);
+  D mid_d2a(mid_d1a), mid_d2b(mid_d1b), mid_d2c(mid_d1c);
+  D long_d2a(long_d1a), long_d2b(long_d1b), long_d2c(long_d1c);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d2));
+  assert(is_de_contiguous_container_asan_correct(short_d2a));
+  assert(is_de_contiguous_container_asan_correct(short_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2a));
+  assert(is_de_contiguous_container_asan_correct(mid_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2c));
+  assert(is_de_contiguous_container_asan_correct(long_d2a));
+  assert(is_de_contiguous_container_asan_correct(long_d2b));
+  assert(is_de_contiguous_container_asan_correct(long_d2c));
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  D empty_d3(std::move(empty_d2));
+  D short_d3a(std::move(short_d2a)), short_d3b(std::move(short_d2b));
+  D mid_d3a(std::move(mid_d2a)), mid_d3b(std::move(mid_d2b)), mid_d3c(std::move(mid_d2c));
+  D long_d3a(std::move(long_d2a)), long_d3b(std::move(long_d2b)), long_d3c(std::move(long_d2c));
+
+  assert(is_de_contiguous_container_asan_correct(empty_d3));
+  assert(is_de_contiguous_container_asan_correct(short_d3a));
+  assert(is_de_contiguous_container_asan_correct(short_d3b));
+  assert(is_de_contiguous_container_asan_correct(mid_d3a));
+  assert(is_de_contiguous_container_asan_correct(mid_d3b));
+  assert(is_de_contiguous_container_asan_correct(mid_d3c));
+  assert(is_de_contiguous_container_asan_correct(long_d3a));
+  assert(is_de_contiguous_container_asan_correct(long_d3b));
+  assert(is_de_contiguous_container_asan_correct(long_d3c));
+
+  assert(is_de_contiguous_container_asan_correct(empty_d2));
+  assert(is_de_contiguous_container_asan_correct(short_d2a));
+  assert(is_de_contiguous_container_asan_correct(short_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2a));
+  assert(is_de_contiguous_container_asan_correct(mid_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2c));
+  assert(is_de_contiguous_container_asan_correct(long_d2a));
+  assert(is_de_contiguous_container_asan_correct(long_d2b));
+  assert(is_de_contiguous_container_asan_correct(long_d2c));
+
+#if TEST_STD_VER >= 11
+  D empty_d4(empty_d1.cbegin(), empty_d1.cend());
+  D short_d4a(short_d1a.cbegin(), short_d1a.cend()), short_d4b(short_d1b.cbegin(), short_d1b.cend());
+  D mid_d4a(mid_d1a.cbegin(), mid_d1a.cend()), mid_d4b(mid_d1b.cbegin(), mid_d1b.cend()),
+      mid_d4c(mid_d1c.cbegin(), mid_d1c.cend());
+  D long_d4a(long_d1a.cbegin(), long_d1a.cend()), long_d4b(long_d1a.cbegin(), long_d1a.cend()),
+      long_d4c(long_d1a.cbegin(), long_d1a.cend());
+#else
+  D empty_d4(empty_d1.begin(), empty_d1.end());
+  D short_d4a(short_d1a.begin(), short_d1a.end()), short_d4b(short_d1b.begin(), short_d1b.end());
+  D mid_d4a(mid_d1a.begin(), mid_d1a.end()), mid_d4b(mid_d1b.begin(), mid_d1b.end()),
+      mid_d4c(mid_d1c.begin(), mid_d1c.end());
+  D long_d4a(long_d1a.begin(), long_d1a.end()), long_d4b(long_d1a.begin(), long_d1a.end()),
+      long_d4c(long_d1a.begin(), long_d1a.end());
+#endif
+
+  assert(is_de_contiguous_container_asan_correct(empty_d4));
+  assert(is_de_contiguous_container_asan_correct(short_d4a));
+  assert(is_de_contiguous_container_asan_correct(short_d4b));
+  assert(is_de_contiguous_container_asan_correct(mid_d4a));
+  assert(is_de_contiguous_container_asan_correct(mid_d4b));
+  assert(is_de_contiguous_container_asan_correct(mid_d4c));
+  assert(is_de_contiguous_container_asan_correct(long_d4a));
+  assert(is_de_contiguous_container_asan_correct(long_d4b));
+  assert(is_de_contiguous_container_asan_correct(long_d4c));
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+#if TEST_STD_VER >= 11
+  D empty_d5(empty_d1.crbegin(), empty_d1.crend());
+  D short_d5a(short_d1a.crbegin(), short_d1a.crend()), short_d5b(short_d1b.crbegin(), short_d1b.crend());
+  D mid_d5a(mid_d1a.crbegin(), mid_d1a.crend()), mid_d5b(mid_d1b.crbegin(), mid_d1b.crend()),
+      mid_d5c(mid_d1c.crbegin(), mid_d1c.crend());
+  D long_d5a(long_d1a.crbegin(), long_d1a.crend()), long_d5b(long_d1a.crbegin(), long_d1a.crend()),
+      long_d5c(long_d1a.crbegin(), long_d1a.crend());
+#else
+  D empty_d5(empty_d1.rbegin(), empty_d1.rend());
+  D short_d5a(short_d1a.rbegin(), short_d1a.rend()), short_d5b(short_d1b.rbegin(), short_d1b.rend());
+  D mid_d5a(mid_d1a.rbegin(), mid_d1a.rend()), mid_d5b(mid_d1b.rbegin(), mid_d1b.rend()),
+      mid_d5c(mid_d1c.rbegin(), mid_d1c.rend());
+  D long_d5a(long_d1a.rbegin(), long_d1a.rend()), long_d5b(long_d1a.rbegin(), long_d1a.rend()),
+      long_d5c(long_d1a.rbegin(), long_d1a.rend());
+#endif
+
+  assert(is_de_contiguous_container_asan_correct(empty_d5));
+  assert(is_de_contiguous_container_asan_correct(short_d5a));
+  assert(is_de_contiguous_container_asan_correct(short_d5b));
+  assert(is_de_contiguous_container_asan_correct(mid_d5a));
+  assert(is_de_contiguous_container_asan_correct(mid_d5b));
+  assert(is_de_contiguous_container_asan_correct(mid_d5c));
+  assert(is_de_contiguous_container_asan_correct(long_d5a));
+  assert(is_de_contiguous_container_asan_correct(long_d5b));
+  assert(is_de_contiguous_container_asan_correct(long_d5c));
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  D empty_d6(0, T());
+  D short_d6a(1, T()), short_d6b(2, T());
+  D mid_d6a(N - 1, T()), mid_d6b(N, T()), mid_d6c(N + 1, T());
+  D long_d6a(17 * N - 1, T()), long_d6b(8 * N, T()), long_d6c(11 * N + 1, T());
+
+  assert(is_de_contiguous_container_asan_correct(empty_d6));
+  assert(is_de_contiguous_container_asan_correct(short_d6a));
+  assert(is_de_contiguous_container_asan_correct(short_d6b));
+  assert(is_de_contiguous_container_asan_correct(mid_d6a));
+  assert(is_de_contiguous_container_asan_correct(mid_d6b));
+  assert(is_de_contiguous_container_asan_correct(mid_d6c));
+  assert(is_de_contiguous_container_asan_correct(long_d6a));
+  assert(is_de_contiguous_container_asan_correct(long_d6b));
+  assert(is_de_contiguous_container_asan_correct(long_d6c));
+
+#if TEST_STD_VER >= 11
+  D empty_d7({});
+  D short_d7a({T()}), short_d7b({T(), T()});
+  D mid_d7a({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+  D mid_d7b({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
+
+  assert(is_de_contiguous_container_asan_correct(empty_d7));
+  assert(is_de_contiguous_container_asan_correct(short_d7a));
+  assert(is_de_contiguous_container_asan_correct(short_d7b));
+  assert(mid_d7a.size() == 16);
+  assert(is_de_contiguous_container_asan_correct(mid_d7a));
+  assert(mid_d7b.size() == 17);
+  assert(is_de_contiguous_container_asan_correct(mid_d7b));
+
+  const T val = T();
+  D empty_d8({});
+  D short_d8a({val}), short_d8b({val, val});
+  D mid_d8a({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
+  D mid_d8b({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
+
+  assert(is_de_contiguous_container_asan_correct(empty_d8));
+  assert(is_de_contiguous_container_asan_correct(short_d8a));
+  assert(is_de_contiguous_container_asan_correct(short_d8b));
+  assert(mid_d8a.size() == 16);
+  assert(is_de_contiguous_container_asan_correct(mid_d8a));
+  assert(mid_d8b.size() == 17);
+  assert(is_de_contiguous_container_asan_correct(mid_d8b));
+#endif
+
+  D empty_d9a((std::allocator<T>())), empty_d9b(empty_d8.get_allocator());
+  assert(is_de_contiguous_container_asan_correct(empty_d9a));
+  assert(is_de_contiguous_container_asan_correct(empty_d9b));
+
+#if TEST_STD_VER >= 11
+  D empty_d10(empty_d3, std::allocator<T>());
+  D short_d10a(short_d3a, std::allocator<T>()), short_d10b(short_d3b, std::allocator<T>());
+  D mid_d10a(mid_d3a, std::allocator<T>()), mid_d10b(mid_d3b, std::allocator<T>()),
+      mid_d10c(mid_d3c, std::allocator<T>());
+  D long_d10a(long_d3a, std::allocator<T>()), long_d10b(long_d3b, std::allocator<T>()),
+      long_d10c(long_d3c, std::allocator<T>());
+
+  assert(is_de_contiguous_container_asan_correct(empty_d10));
+  assert(is_de_contiguous_container_asan_correct(short_d10a));
+  assert(is_de_contiguous_container_asan_correct(short_d10b));
+  assert(is_de_contiguous_container_asan_correct(mid_d10a));
+  assert(is_de_contiguous_container_asan_correct(mid_d10b));
+  assert(is_de_contiguous_container_asan_correct(mid_d10c));
+  assert(is_de_contiguous_container_asan_correct(long_d10a));
+  assert(is_de_contiguous_container_asan_correct(long_d10b));
+  assert(is_de_contiguous_container_asan_correct(long_d10c));
+
+  assert(is_de_contiguous_container_asan_correct(empty_d3));
+  assert(is_de_contiguous_container_asan_correct(short_d3a));
+  assert(is_de_contiguous_container_asan_correct(short_d3b));
+  assert(is_de_contiguous_container_asan_correct(mid_d3a));
+  assert(is_de_contiguous_container_asan_correct(mid_d3b));
+  assert(is_de_contiguous_container_asan_correct(mid_d3c));
+  assert(is_de_contiguous_container_asan_correct(long_d3a));
+  assert(is_de_contiguous_container_asan_correct(long_d3b));
+  assert(is_de_contiguous_container_asan_correct(long_d3c));
+
+  D empty_d11(std::move(empty_d10), std::allocator<T>());
+  D short_d11a(std::move(short_d10a), std::allocator<T>()), short_d11b(std::move(short_d10b), std::allocator<T>());
+  D mid_d11a(std::move(mid_d10a), std::allocator<T>()), mid_d11b(std::move(mid_d10b), std::allocator<T>()),
+      mid_d11c(std::move(mid_d10c), std::allocator<T>());
+  D long_d11a(std::move(long_d10a), std::allocator<T>()), long_d11b(std::move(long_d10b), std::allocator<T>()),
+      long_d11c(std::move(long_d10c), std::allocator<T>());
+
+  assert(is_de_contiguous_container_asan_correct(empty_d11));
+  assert(is_de_contiguous_container_asan_correct(short_d11a));
+  assert(is_de_contiguous_container_asan_correct(short_d11b));
+  assert(is_de_contiguous_container_asan_correct(mid_d11a));
+  assert(is_de_contiguous_container_asan_correct(mid_d11b));
+  assert(is_de_contiguous_container_asan_correct(mid_d11c));
+  assert(is_de_contiguous_container_asan_correct(long_d11a));
+  assert(is_de_contiguous_container_asan_correct(long_d11b));
+  assert(is_de_contiguous_container_asan_correct(long_d11c));
+
+  assert(is_de_contiguous_container_asan_correct(empty_d10));
+  assert(is_de_contiguous_container_asan_correct(short_d10a));
+  assert(is_de_contiguous_container_asan_correct(short_d10b));
+  assert(is_de_contiguous_container_asan_correct(mid_d10a));
+  assert(is_de_contiguous_container_asan_correct(mid_d10b));
+  assert(is_de_contiguous_container_asan_correct(mid_d10c));
+  assert(is_de_contiguous_container_asan_correct(long_d10a));
+  assert(is_de_contiguous_container_asan_correct(long_d10b));
+  assert(is_de_contiguous_container_asan_correct(long_d10c));
+#endif
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        test<T>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/emplace_constructible.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+// The test helped us find issues with llvm12 implementation,
+// but it's a problematic one now.
+// We may want to delete it.
+
+// UNSUPPORTED: c++03
+
+#include <cassert>
+#include <array>
+#include "emplace_constructible.h"
+#include "asan_testing.h" // includes deque - don't do it before
+#include "test_iterators.h"
+
+template <typename T>
+void test_constructible() {
+  T arr1[] = {T()};
+  using T2 = EmplaceConstructibleMoveableAndAssignable<T>;
+  using It = cpp17_input_iterator<T*>;
+  typedef std::deque<T2> D;
+
+  D d;
+  d.assign(It(arr1), It(std::end(arr1)));
+  assert(is_de_contiguous_container_asan_correct(d));
+}
+
+template <typename T>
+void test() {
+  test_constructible<T>();
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        test<T>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/erase.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+template <typename T>
+void test() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  // iterator erase( iterator first, iterator last );
+  // iterator erase( const_iterator first, const_iterator last );
+
+  D d1a(N), d1b(N), d1c(N);
+#if TEST_STD_VER >= 11
+  d1a.erase(d1a.cbegin(), d1a.cend());
+  d1b.erase(d1b.cbegin() + 1);
+  d1c.erase(d1c.cend() - 1);
+#else
+  d1a.erase(d1a.begin(), d1a.end());
+  d1b.erase(d1b.begin() + 1);
+  d1c.erase(d1c.end() - 1);
+#endif
+
+  assert(is_de_contiguous_container_asan_correct(d1a));
+  assert(is_de_contiguous_container_asan_correct(d1b));
+  assert(is_de_contiguous_container_asan_correct(d1c));
+
+  D d2a(N + 1), d2b(N + 1), d2c(N + 1), d2d(N + 1);
+
+  d2a.erase(d2a.begin(), d2a.end() - 2);
+  d2b.erase(d2b.begin() + 1, d2b.end());
+  // iterator erase( iterator pos );
+  // iterator erase( const_iterator pos );
+  d2c.erase(d2c.begin() + 2);
+  d2d.erase(d2d.end() - 3);
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  d2c.erase(d2c.begin() + 2);
+  d2d.erase(d2d.end() - 3);
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  d2c.erase(d2c.begin() + 2);
+  d2d.erase(d2d.end() - 3);
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  D d3a(32 * N + 1), d3b(32 * N + 1), d3c(32 * N + 1), d3d(32 * N + 1);
+
+  d3a.erase(d3a.begin() + N + 1, d3a.end() - N - 2);
+  d3b.erase(d3b.begin() + N - 1, d3b.end());
+
+  assert(is_de_contiguous_container_asan_correct(d3a));
+  assert(is_de_contiguous_container_asan_correct(d3b));
+  while (d3c.size() > 3) {
+    d3c.erase(d3c.begin() + 2);
+    assert(is_de_contiguous_container_asan_correct(d3c));
+  }
+  while (d3d.size() > 4) {
+    d3d.erase(d3d.end() - 3);
+    assert(is_de_contiguous_container_asan_correct(d3d));
+  }
+
+  D d4a(32 * N + 3), d4b(32 * N + 3);
+  while (d4a.size() > 5) {
+    d4a.erase(d4a.begin() + 2, d4a.begin() + 4);
+    assert(is_de_contiguous_container_asan_correct(d4a));
+  }
+
+  while (d4b.size() > 5) {
+    d4b.erase(d4b.end() - 4, d4b.end() - 2);
+    assert(is_de_contiguous_container_asan_correct(d4b));
+  }
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        test<T>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/insert.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+template <typename T>
+void test_insert() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  T t = T();
+  D d1a(2), d1b(2), d1c(2);
+
+#if TEST_STD_VER >= 11
+  d1a.insert(d1a.cbegin(), t);
+  d1b.insert(d1b.cend(), t);
+  d1c.insert(d1c.cbegin() + 1, t);
+#else
+  d1a.insert(d1a.begin(), t);
+  d1b.insert(d1b.end(), t);
+  d1c.insert(d1c.begin() + 1, t);
+#endif
+
+  assert(is_de_contiguous_container_asan_correct(d1a));
+  assert(is_de_contiguous_container_asan_correct(d1b));
+  assert(is_de_contiguous_container_asan_correct(d1c));
+
+  D d2a(3 * N), d2b(3 * N), d2c(3 * N), d2d(3 * N);
+
+  d2a.insert(d2a.begin(), t);
+  d2b.insert(d2b.end(), t);
+  d2c.insert(d2c.begin() + 1, t);
+  d2d.insert(d2d.end() - 1, t);
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  d2a.insert(d2a.begin(), 2 * N + 1, t);
+  d2b.insert(d2b.end(), 2 * N + 1, t);
+  d2c.insert(d2c.begin() + 1, 2 * N + 1, t);
+  d2d.insert(d2d.end() - 1, 2 * N + 1, t);
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  d2c.insert(d2c.begin() + N + 1, 2 * N + 1, t);
+  d2d.insert(d2d.end() - N - 1, 2 * N + 1, t);
+
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  D source(3 * N);
+
+  d2a.insert(d2a.begin(), source.begin() + 1, source.end() - 1);
+  d2b.insert(d2b.end(), source.begin() + 1, source.end() - 1);
+  d2c.insert(d2c.begin() + 1, source.begin() + 1, source.end() - 1);
+  d2d.insert(d2d.end() - 1, source.begin() + 1, source.end() - 1);
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  d2c.insert(d2c.begin() + N + 1, source.begin() + 1, source.end() - 1);
+  d2d.insert(d2d.end() - N - 1, source.begin() + 1, source.end() - 1);
+
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  d2a.insert(d2a.begin(), T());
+  d2b.insert(d2b.end(), T());
+  d2c.insert(d2c.begin() + 1, T());
+  d2d.insert(d2d.end() - 1, T());
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  T a = T(), b = T(), c = T(), d = T();
+  d2a.insert(d2a.begin(), a);
+  d2b.insert(d2b.end(), b);
+  d2c.insert(d2c.begin() + 1, c);
+  d2d.insert(d2d.end() - 1, d);
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  d2a.insert(d2a.begin(), 3, a);
+  d2b.insert(d2b.end(), 3, b);
+  d2c.insert(d2c.begin() + 1, 3, c);
+  d2d.insert(d2d.end() - 1, 3, d);
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  d2a.insert(d2a.begin(), 3 * N, a);
+  d2b.insert(d2b.end(), 3 * N, b);
+  d2c.insert(d2c.begin() + 1, 3 * N, c);
+  d2d.insert(d2d.end() - 1, 3 * N, d);
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  d2a.insert(d2a.begin(), std::move(a));
+  d2b.insert(d2b.end(), std::move(b));
+  d2c.insert(d2c.begin() + 1, std::move(c));
+  d2d.insert(d2d.end() - 1, std::move(d));
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+#if TEST_STD_VER >= 11
+  D d3a(2), d3b(2), d3c(2);
+
+  d3a.insert(d3a.cbegin(), {t});
+  d3b.insert(d3b.cend(), {t});
+  d3c.insert(d3c.cbegin() + 1, {t});
+
+  assert(is_de_contiguous_container_asan_correct(d3a));
+  assert(is_de_contiguous_container_asan_correct(d3b));
+  assert(is_de_contiguous_container_asan_correct(d3c));
+
+  d3a.insert(d3a.cbegin(), {t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
+  d3b.insert(d3b.cend(), {t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
+  d3c.insert(d3c.cbegin() + 1, {t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
+
+  assert(d3a.size() > 16);
+  assert(d3b.size() > 16);
+  assert(d3c.size() > 16);
+
+  assert(is_de_contiguous_container_asan_correct(d3a));
+  assert(is_de_contiguous_container_asan_correct(d3b));
+  assert(is_de_contiguous_container_asan_correct(d3c));
+
+  d3a.insert(d3a.cbegin() + 1, {t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
+  d3b.insert(d3b.cend() - 1, {t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
+  d3c.resize(N - 1);
+  d3c.insert(d3c.cbegin() + N - 2, {t, t, t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
+
+  assert(is_de_contiguous_container_asan_correct(d3a));
+  assert(is_de_contiguous_container_asan_correct(d3b));
+  assert(is_de_contiguous_container_asan_correct(d3c));
+#endif
+}
+
+#if TEST_STD_VER >= 11
+template <typename T>
+void test_emplace() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  T t = T();
+  D d1a(2), d1b(2), d1c(2);
+
+  d1a.emplace(d1a.cbegin(), t);
+  d1b.emplace(d1b.cend(), t);
+  d1c.emplace(d1c.cbegin() + 1, t);
+
+  assert(is_de_contiguous_container_asan_correct(d1a));
+  assert(is_de_contiguous_container_asan_correct(d1b));
+  assert(is_de_contiguous_container_asan_correct(d1c));
+
+  D d2a(3 * N), d2b(3 * N), d2c(3 * N), d2d(3 * N);
+
+  d2a.emplace(d2a.cbegin(), t);
+  d2b.emplace(d2b.cend(), t);
+  d2c.emplace(d2c.cbegin() + 1, t);
+  d2d.emplace(d2d.cend() - 1, t);
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  d2a.emplace(d2a.cbegin(), T());
+  d2b.emplace(d2b.cend(), T());
+  d2c.emplace(d2c.cbegin() + 1, T());
+  d2d.emplace(d2d.cend() - 1, T());
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+
+  T a = T(), b = T(), c = T(), d = T();
+  d2a.emplace(d2a.cbegin(), std::move(a));
+  d2b.emplace(d2b.cend(), std::move(b));
+  d2c.emplace(d2c.cbegin() + 1, std::move(c));
+  d2d.emplace(d2d.cend() - 1, std::move(d));
+
+  assert(is_de_contiguous_container_asan_correct(d2a));
+  assert(is_de_contiguous_container_asan_correct(d2b));
+  assert(is_de_contiguous_container_asan_correct(d2c));
+  assert(is_de_contiguous_container_asan_correct(d2d));
+}
+#endif
+
+template <typename T>
+void test() {
+  test_insert<T>();
+#if TEST_STD_VER >= 11
+  test_emplace<T>();
+#endif
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        test<T>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/pop_back.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+template <typename T>
+void test_aligned() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  // void pop_back()
+
+  D single_d(1);
+  single_d.pop_back();
+  assert(is_de_contiguous_container_asan_correct(single_d));
+
+  D d1(34 * N);
+  while (!d1.empty()) {
+    d1.pop_back();
+    assert(is_de_contiguous_container_asan_correct(d1));
+  }
+}
+
+template <typename T>
+void test_not_aligned() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  // void pop_back()
+
+  D single_d(1);
+  single_d.pop_back();
+  assert(is_de_contiguous_container_asan_correct(single_d));
+
+  D d1(34 * N);
+  d1.pop_front();
+
+  while (!d1.empty()) {
+    d1.pop_back();
+    assert(is_de_contiguous_container_asan_correct(d1));
+  }
+}
+
+template <typename T>
+void test() {
+  test_aligned<T>();
+  test_not_aligned<T>();
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        typedef std::deque<T> D;
+        test<D>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/pop_front.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+template <typename T>
+void test() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  // void pop_front()
+
+  D single_d(1);
+  single_d.pop_front();
+  assert(is_de_contiguous_container_asan_correct(single_d));
+
+  D d1(34 * N);
+  while (!d1.empty()) {
+    d1.pop_front();
+    assert(is_de_contiguous_container_asan_correct(d1));
+  }
+
+  D d2(34 * N + 1);
+  while (!d2.empty()) {
+    d2.pop_front();
+    assert(is_de_contiguous_container_asan_correct(d2));
+  }
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        typedef std::deque<T> D;
+        test<D>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/push_back.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+template <typename T>
+void test_push() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  D d1;
+
+  // void push_back( const T& value );
+
+  for (size_t i = 0; i < 32 * N; ++i) {
+    T b = T();
+    d1.push_back(b);
+    assert(is_de_contiguous_container_asan_correct(d1));
+  }
+
+  d1.clear();
+
+  for (size_t i = 0; i < 34 * N; ++i) {
+    T b = T();
+    d1.push_back(b);
+    assert(is_de_contiguous_container_asan_correct(d1));
+  }
+
+#if TEST_STD_VER >= 11
+  // void push_back( T&& value );
+
+  D d2;
+
+  for (size_t i = 0; i < 34 * N; ++i) {
+    T b = T();
+    d2.push_back(std::move(b));
+    assert(is_de_contiguous_container_asan_correct(d2));
+    d2.push_back(T());
+    assert(is_de_contiguous_container_asan_correct(d2));
+  }
+#endif
+}
+
+#if TEST_STD_VER >= 11
+template <typename T>
+void test_emplace() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  // template< class... Args >
+  // reference emplace_back( Args&&... args );
+  D d1;
+
+  for (size_t i = 0; i < 32 * N; ++i) {
+    T b = T();
+    d1.emplace_back(b);
+    assert(is_de_contiguous_container_asan_correct(d1));
+  }
+
+  d1.clear();
+
+  for (size_t i = 0; i < 34 * N; ++i) {
+    T b = T();
+    d1.emplace_back(b);
+    assert(is_de_contiguous_container_asan_correct(d1));
+  }
+
+  D d2;
+
+  for (size_t i = 0; i < 32 * N; ++i) {
+    T b = T();
+    d2.emplace_back(std::move(b));
+    assert(is_de_contiguous_container_asan_correct(d2));
+    d2.emplace_back(T());
+    assert(is_de_contiguous_container_asan_correct(d2));
+  }
+}
+#endif
+
+template <typename T>
+void test() {
+  test_push<T>();
+#if TEST_STD_VER >= 11
+  test_emplace<T>();
+#endif
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        test<T>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/push_front.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+template <typename T>
+void test_push() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  // void push_front( const T& value );
+
+  D d1;
+
+  for (size_t i = 0; i < 32 * N; ++i) {
+    T f = T();
+    d1.push_front(f);
+    assert(is_de_contiguous_container_asan_correct(d1));
+  }
+
+  d1.clear();
+
+  for (size_t i = 0; i < 34 * N; ++i) {
+    T f = T();
+    d1.push_front(f);
+    assert(is_de_contiguous_container_asan_correct(d1));
+  }
+
+#if TEST_STD_VER >= 11
+  // void push_front( T&& value );
+
+  D d2;
+
+  for (size_t i = 0; i < 32 * N; ++i) {
+    T f = T();
+    d2.push_front(std::move(f));
+    assert(is_de_contiguous_container_asan_correct(d2));
+    d2.push_front(T());
+    assert(is_de_contiguous_container_asan_correct(d2));
+  }
+#endif
+}
+
+#if TEST_STD_VER >= 11
+template <typename T>
+void test_emplace() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  // template< class... Args >
+  // reference emplace_front( Args&&... args );
+
+  D d1;
+
+  for (size_t i = 0; i < 32 * N; ++i) {
+    T f = T();
+    d1.emplace_front(f);
+    assert(is_de_contiguous_container_asan_correct(d1));
+  }
+
+  d1.clear();
+
+  for (size_t i = 0; i < 34 * N; ++i) {
+    T f = T();
+    d1.emplace_front(f);
+    assert(is_de_contiguous_container_asan_correct(d1));
+  }
+
+  D d2;
+
+  for (size_t i = 0; i < 32 * N; ++i) {
+    T f = T();
+    d2.emplace_front(std::move(f));
+    assert(is_de_contiguous_container_asan_correct(d2));
+    d2.emplace_front(T());
+    assert(is_de_contiguous_container_asan_correct(d2));
+  }
+}
+#endif
+
+template <typename T>
+void test() {
+  test_push<T>();
+#if TEST_STD_VER >= 11
+  test_emplace<T>();
+#endif
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        test<T>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/resize.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+template <typename T>
+void test_count() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  D empty_d1;
+  D short_d1a(1), short_d1b(2);
+  D mid_d1a(N - 1), mid_d1b(N), mid_d1c(N + 1);
+  D long_d1a(17 * N - 1), long_d1b(8 * N), long_d1c(11 * N + 1);
+
+  empty_d1.resize(0);
+  short_d1a.resize(1);
+  short_d1b.resize(2);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(17 * N - 1);
+  long_d1b.resize(8 * N);
+  long_d1c.resize(11 * N + 1);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(1);
+  short_d1a.resize(1);
+  short_d1b.resize(1);
+  mid_d1a.resize(1);
+  mid_d1b.resize(1);
+  mid_d1c.resize(1);
+  long_d1a.resize(1);
+  long_d1b.resize(1);
+  long_d1c.resize(1);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(2);
+  short_d1a.resize(2);
+  short_d1b.resize(2);
+  mid_d1a.resize(2);
+  mid_d1b.resize(2);
+  mid_d1c.resize(2);
+  long_d1a.resize(2);
+  long_d1b.resize(2);
+  long_d1c.resize(2);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(N - 1);
+  short_d1a.resize(N - 1);
+  short_d1b.resize(N - 1);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N - 1);
+  mid_d1c.resize(N - 1);
+  long_d1a.resize(N - 1);
+  long_d1b.resize(N - 1);
+  long_d1c.resize(N - 1);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(N);
+  short_d1a.resize(N);
+  short_d1b.resize(N);
+  mid_d1a.resize(N);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N);
+  long_d1a.resize(N);
+  long_d1b.resize(N);
+  long_d1c.resize(N);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(N + 1);
+  short_d1a.resize(N + 1);
+  short_d1b.resize(N + 1);
+  mid_d1a.resize(N + 1);
+  mid_d1b.resize(N + 1);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(N + 1);
+  long_d1b.resize(N + 1);
+  long_d1c.resize(N + 1);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(N);
+  short_d1a.resize(N);
+  short_d1b.resize(N);
+  mid_d1a.resize(N);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N);
+  long_d1a.resize(N);
+  long_d1b.resize(N);
+  long_d1c.resize(N);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(20 * N);
+  short_d1a.resize(20 * N);
+  short_d1b.resize(20 * N);
+  mid_d1a.resize(20 * N);
+  mid_d1b.resize(20 * N);
+  mid_d1c.resize(20 * N);
+  long_d1a.resize(20 * N);
+  long_d1b.resize(20 * N);
+  long_d1c.resize(20 * N);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(0);
+  short_d1a.resize(1);
+  short_d1b.resize(2);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(17 * N - 1);
+  long_d1b.resize(8 * N);
+  long_d1c.resize(11 * N + 1);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  D empty_d2;
+  D short_d2a(1), short_d2b(2);
+  D mid_d2a(N - 1), mid_d2b(N), mid_d2c(N + 1);
+  D long_d2a(17 * N - 1), long_d2b(8 * N), long_d2c(11 * N + 1);
+
+  empty_d2.resize(20 * N);
+  short_d2a.resize(20 * N);
+  short_d2b.resize(20 * N);
+  mid_d2a.resize(20 * N);
+  mid_d2b.resize(20 * N);
+  mid_d2c.resize(20 * N);
+  long_d2a.resize(20 * N);
+  long_d2b.resize(20 * N);
+  long_d2c.resize(20 * N);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d2));
+  assert(is_de_contiguous_container_asan_correct(short_d2a));
+  assert(is_de_contiguous_container_asan_correct(short_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2a));
+  assert(is_de_contiguous_container_asan_correct(mid_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2c));
+  assert(is_de_contiguous_container_asan_correct(long_d2a));
+  assert(is_de_contiguous_container_asan_correct(long_d2b));
+  assert(is_de_contiguous_container_asan_correct(long_d2c));
+}
+
+template <typename T>
+void test_value() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+  const T val    = T();
+
+  D empty_d1;
+  D short_d1a(1), short_d1b(2);
+  D mid_d1a(N - 1), mid_d1b(N), mid_d1c(N + 1);
+  D long_d1a(17 * N - 1), long_d1b(8 * N), long_d1c(11 * N + 1);
+
+  empty_d1.resize(0, val);
+  short_d1a.resize(1, val);
+  short_d1b.resize(2, val);
+  mid_d1a.resize(N - 1, val);
+  mid_d1b.resize(N, val);
+  mid_d1c.resize(N + 1, val);
+  long_d1a.resize(17 * N - 1, val);
+  long_d1b.resize(8 * N, val);
+  long_d1c.resize(11 * N + 1, val);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(1, val);
+  short_d1a.resize(1, val);
+  short_d1b.resize(1, val);
+  mid_d1a.resize(1, val);
+  mid_d1b.resize(1, val);
+  mid_d1c.resize(1, val);
+  long_d1a.resize(1, val);
+  long_d1b.resize(1, val);
+  long_d1c.resize(1, val);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(2, val);
+  short_d1a.resize(2, val);
+  short_d1b.resize(2, val);
+  mid_d1a.resize(2, val);
+  mid_d1b.resize(2, val);
+  mid_d1c.resize(2, val);
+  long_d1a.resize(2, val);
+  long_d1b.resize(2, val);
+  long_d1c.resize(2, val);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(N - 1, val);
+  short_d1a.resize(N - 1, val);
+  short_d1b.resize(N - 1, val);
+  mid_d1a.resize(N - 1, val);
+  mid_d1b.resize(N - 1, val);
+  mid_d1c.resize(N - 1, val);
+  long_d1a.resize(N - 1, val);
+  long_d1b.resize(N - 1, val);
+  long_d1c.resize(N - 1, val);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(N, val);
+  short_d1a.resize(N, val);
+  short_d1b.resize(N, val);
+  mid_d1a.resize(N, val);
+  mid_d1b.resize(N, val);
+  mid_d1c.resize(N, val);
+  long_d1a.resize(N, val);
+  long_d1b.resize(N, val);
+  long_d1c.resize(N, val);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(N + 1, val);
+  short_d1a.resize(N + 1, val);
+  short_d1b.resize(N + 1, val);
+  mid_d1a.resize(N + 1, val);
+  mid_d1b.resize(N + 1, val);
+  mid_d1c.resize(N + 1, val);
+  long_d1a.resize(N + 1, val);
+  long_d1b.resize(N + 1, val);
+  long_d1c.resize(N + 1, val);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(N, val);
+  short_d1a.resize(N, val);
+  short_d1b.resize(N, val);
+  mid_d1a.resize(N, val);
+  mid_d1b.resize(N, val);
+  mid_d1c.resize(N, val);
+  long_d1a.resize(N, val);
+  long_d1b.resize(N, val);
+  long_d1c.resize(N, val);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(20 * N, val);
+  short_d1a.resize(20 * N, val);
+  short_d1b.resize(20 * N, val);
+  mid_d1a.resize(20 * N, val);
+  mid_d1b.resize(20 * N, val);
+  mid_d1c.resize(20 * N, val);
+  long_d1a.resize(20 * N, val);
+  long_d1b.resize(20 * N, val);
+  long_d1c.resize(20 * N, val);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(0, val);
+  short_d1a.resize(1, val);
+  short_d1b.resize(2, val);
+  mid_d1a.resize(N - 1, val);
+  mid_d1b.resize(N, val);
+  mid_d1c.resize(N + 1, val);
+  long_d1a.resize(17 * N - 1, val);
+  long_d1b.resize(8 * N, val);
+  long_d1c.resize(11 * N + 1, val);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  D empty_d2;
+  D short_d2a(1), short_d2b(2);
+  D mid_d2a(N - 1), mid_d2b(N), mid_d2c(N + 1);
+  D long_d2a(17 * N - 1), long_d2b(8 * N), long_d2c(11 * N + 1);
+
+  empty_d2.resize(20 * N, val);
+  short_d2a.resize(20 * N, val);
+  short_d2b.resize(20 * N, val);
+  mid_d2a.resize(20 * N, val);
+  mid_d2b.resize(20 * N, val);
+  mid_d2c.resize(20 * N, val);
+  long_d2a.resize(20 * N, val);
+  long_d2b.resize(20 * N, val);
+  long_d2c.resize(20 * N, val);
+
+  assert(is_de_contiguous_container_asan_correct(empty_d2));
+  assert(is_de_contiguous_container_asan_correct(short_d2a));
+  assert(is_de_contiguous_container_asan_correct(short_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2a));
+  assert(is_de_contiguous_container_asan_correct(mid_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2c));
+  assert(is_de_contiguous_container_asan_correct(long_d2a));
+  assert(is_de_contiguous_container_asan_correct(long_d2b));
+  assert(is_de_contiguous_container_asan_correct(long_d2c));
+}
+
+template <typename T>
+void test() {
+  test_count<T>();
+  test_value<T>();
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        test<T>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/shrink_to_fit.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+// UNSUPPORTED: c++03
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+template <typename T>
+void test() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  D empty_d1;
+  D short_d1a(1), short_d1b(2);
+  D mid_d1a(N - 1), mid_d1b(N), mid_d1c(N + 1);
+  D long_d1a(17 * N - 1), long_d1b(8 * N), long_d1c(11 * N + 1);
+
+  empty_d1.resize(0);
+  short_d1a.resize(1);
+  short_d1b.resize(2);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(17 * N - 1);
+  long_d1b.resize(8 * N);
+  long_d1c.resize(11 * N + 1);
+
+  empty_d1.shrink_to_fit();
+  short_d1a.shrink_to_fit();
+  short_d1b.shrink_to_fit();
+  mid_d1a.shrink_to_fit();
+  mid_d1b.shrink_to_fit();
+  mid_d1c.shrink_to_fit();
+  long_d1a.shrink_to_fit();
+  long_d1b.shrink_to_fit();
+  long_d1c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(1);
+  short_d1a.resize(1);
+  short_d1b.resize(1);
+  mid_d1a.resize(1);
+  mid_d1b.resize(1);
+  mid_d1c.resize(1);
+  long_d1a.resize(1);
+  long_d1b.resize(1);
+  long_d1c.resize(1);
+
+  empty_d1.shrink_to_fit();
+  short_d1a.shrink_to_fit();
+  short_d1b.shrink_to_fit();
+  mid_d1a.shrink_to_fit();
+  mid_d1b.shrink_to_fit();
+  mid_d1c.shrink_to_fit();
+  long_d1a.shrink_to_fit();
+  long_d1b.shrink_to_fit();
+  long_d1c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(0);
+  short_d1a.resize(1);
+  short_d1b.resize(2);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(17 * N - 1);
+  long_d1b.resize(8 * N);
+  long_d1c.resize(11 * N + 1);
+
+  empty_d1.resize(2);
+  short_d1a.resize(2);
+  short_d1b.resize(2);
+  mid_d1a.resize(2);
+  mid_d1b.resize(2);
+  mid_d1c.resize(2);
+  long_d1a.resize(2);
+  long_d1b.resize(2);
+  long_d1c.resize(2);
+
+  empty_d1.shrink_to_fit();
+  short_d1a.shrink_to_fit();
+  short_d1b.shrink_to_fit();
+  mid_d1a.shrink_to_fit();
+  mid_d1b.shrink_to_fit();
+  mid_d1c.shrink_to_fit();
+  long_d1a.shrink_to_fit();
+  long_d1b.shrink_to_fit();
+  long_d1c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(0);
+  short_d1a.resize(1);
+  short_d1b.resize(2);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(17 * N - 1);
+  long_d1b.resize(8 * N);
+  long_d1c.resize(11 * N + 1);
+
+  empty_d1.resize(N - 1);
+  short_d1a.resize(N - 1);
+  short_d1b.resize(N - 1);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N - 1);
+  mid_d1c.resize(N - 1);
+  long_d1a.resize(N - 1);
+  long_d1b.resize(N - 1);
+  long_d1c.resize(N - 1);
+
+  empty_d1.shrink_to_fit();
+  short_d1a.shrink_to_fit();
+  short_d1b.shrink_to_fit();
+  mid_d1a.shrink_to_fit();
+  mid_d1b.shrink_to_fit();
+  mid_d1c.shrink_to_fit();
+  long_d1a.shrink_to_fit();
+  long_d1b.shrink_to_fit();
+  long_d1c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(0);
+  short_d1a.resize(1);
+  short_d1b.resize(2);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(17 * N - 1);
+  long_d1b.resize(8 * N);
+  long_d1c.resize(11 * N + 1);
+
+  empty_d1.resize(N);
+  short_d1a.resize(N);
+  short_d1b.resize(N);
+  mid_d1a.resize(N);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N);
+  long_d1a.resize(N);
+  long_d1b.resize(N);
+  long_d1c.resize(N);
+
+  empty_d1.shrink_to_fit();
+  short_d1a.shrink_to_fit();
+  short_d1b.shrink_to_fit();
+  mid_d1a.shrink_to_fit();
+  mid_d1b.shrink_to_fit();
+  mid_d1c.shrink_to_fit();
+  long_d1a.shrink_to_fit();
+  long_d1b.shrink_to_fit();
+  long_d1c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(0);
+  short_d1a.resize(1);
+  short_d1b.resize(2);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(17 * N - 1);
+  long_d1b.resize(8 * N);
+  long_d1c.resize(11 * N + 1);
+
+  empty_d1.resize(N + 1);
+  short_d1a.resize(N + 1);
+  short_d1b.resize(N + 1);
+  mid_d1a.resize(N + 1);
+  mid_d1b.resize(N + 1);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(N + 1);
+  long_d1b.resize(N + 1);
+  long_d1c.resize(N + 1);
+
+  empty_d1.shrink_to_fit();
+  short_d1a.shrink_to_fit();
+  short_d1b.shrink_to_fit();
+  mid_d1a.shrink_to_fit();
+  mid_d1b.shrink_to_fit();
+  mid_d1c.shrink_to_fit();
+  long_d1a.shrink_to_fit();
+  long_d1b.shrink_to_fit();
+  long_d1c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(0);
+  short_d1a.resize(1);
+  short_d1b.resize(2);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(17 * N - 1);
+  long_d1b.resize(8 * N);
+  long_d1c.resize(11 * N + 1);
+
+  empty_d1.resize(N);
+  short_d1a.resize(N);
+  short_d1b.resize(N);
+  mid_d1a.resize(N);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N);
+  long_d1a.resize(N);
+  long_d1b.resize(N);
+  long_d1c.resize(N);
+
+  empty_d1.shrink_to_fit();
+  short_d1a.shrink_to_fit();
+  short_d1b.shrink_to_fit();
+  mid_d1a.shrink_to_fit();
+  mid_d1b.shrink_to_fit();
+  mid_d1c.shrink_to_fit();
+  long_d1a.shrink_to_fit();
+  long_d1b.shrink_to_fit();
+  long_d1c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(0);
+  short_d1a.resize(1);
+  short_d1b.resize(2);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(17 * N - 1);
+  long_d1b.resize(8 * N);
+  long_d1c.resize(11 * N + 1);
+
+  empty_d1.resize(20 * N);
+  short_d1a.resize(20 * N);
+  short_d1b.resize(20 * N);
+  mid_d1a.resize(20 * N);
+  mid_d1b.resize(20 * N);
+  mid_d1c.resize(20 * N);
+  long_d1a.resize(20 * N);
+  long_d1b.resize(20 * N);
+  long_d1c.resize(20 * N);
+
+  empty_d1.shrink_to_fit();
+  short_d1a.shrink_to_fit();
+  short_d1b.shrink_to_fit();
+  mid_d1a.shrink_to_fit();
+  mid_d1b.shrink_to_fit();
+  mid_d1c.shrink_to_fit();
+  long_d1a.shrink_to_fit();
+  long_d1b.shrink_to_fit();
+  long_d1c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.resize(0);
+  short_d1a.resize(1);
+  short_d1b.resize(2);
+  mid_d1a.resize(N - 1);
+  mid_d1b.resize(N);
+  mid_d1c.resize(N + 1);
+  long_d1a.resize(17 * N - 1);
+  long_d1b.resize(8 * N);
+  long_d1c.resize(11 * N + 1);
+
+  empty_d1.shrink_to_fit();
+  short_d1a.shrink_to_fit();
+  short_d1b.shrink_to_fit();
+  mid_d1a.shrink_to_fit();
+  mid_d1b.shrink_to_fit();
+  mid_d1c.shrink_to_fit();
+  long_d1a.shrink_to_fit();
+  long_d1b.shrink_to_fit();
+  long_d1c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  empty_d1.clear();
+  short_d1a.clear();
+  short_d1b.clear();
+  mid_d1a.clear();
+  mid_d1b.clear();
+  mid_d1c.clear();
+  long_d1a.clear();
+  long_d1b.clear();
+  long_d1c.clear();
+
+  empty_d1.shrink_to_fit();
+  short_d1a.shrink_to_fit();
+  short_d1b.shrink_to_fit();
+  mid_d1a.shrink_to_fit();
+  mid_d1b.shrink_to_fit();
+  mid_d1c.shrink_to_fit();
+  long_d1a.shrink_to_fit();
+  long_d1b.shrink_to_fit();
+  long_d1c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d1));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  assert(is_de_contiguous_container_asan_correct(mid_d1c));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  assert(is_de_contiguous_container_asan_correct(long_d1c));
+
+  D empty_d2;
+  D short_d2a(1), short_d2b(2);
+  D mid_d2a(N - 1), mid_d2b(N), mid_d2c(N + 1);
+  D long_d2a(17 * N - 1), long_d2b(8 * N), long_d2c(11 * N + 1);
+
+  empty_d2.resize(20 * N);
+  short_d2a.resize(20 * N);
+  short_d2b.resize(20 * N);
+  mid_d2a.resize(20 * N);
+  mid_d2b.resize(20 * N);
+  mid_d2c.resize(20 * N);
+  long_d2a.resize(20 * N);
+  long_d2b.resize(20 * N);
+  long_d2c.resize(20 * N);
+
+  empty_d2.shrink_to_fit();
+  short_d2a.shrink_to_fit();
+  short_d2b.shrink_to_fit();
+  mid_d2a.shrink_to_fit();
+  mid_d2b.shrink_to_fit();
+  mid_d2c.shrink_to_fit();
+  long_d2a.shrink_to_fit();
+  long_d2b.shrink_to_fit();
+  long_d2c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d2));
+  assert(is_de_contiguous_container_asan_correct(short_d2a));
+  assert(is_de_contiguous_container_asan_correct(short_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2a));
+  assert(is_de_contiguous_container_asan_correct(mid_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2c));
+  assert(is_de_contiguous_container_asan_correct(long_d2a));
+  assert(is_de_contiguous_container_asan_correct(long_d2b));
+  assert(is_de_contiguous_container_asan_correct(long_d2c));
+
+  empty_d2.resize(0);
+  short_d2a.resize(0);
+  short_d2b.resize(0);
+  mid_d2a.resize(0);
+  mid_d2b.resize(0);
+  mid_d2c.resize(0);
+  long_d2a.resize(0);
+  long_d2b.resize(0);
+  long_d2c.resize(0);
+
+  empty_d2.shrink_to_fit();
+  short_d2a.shrink_to_fit();
+  short_d2b.shrink_to_fit();
+  mid_d2a.shrink_to_fit();
+  mid_d2b.shrink_to_fit();
+  mid_d2c.shrink_to_fit();
+  long_d2a.shrink_to_fit();
+  long_d2b.shrink_to_fit();
+  long_d2c.shrink_to_fit();
+
+  assert(is_de_contiguous_container_asan_correct(empty_d2));
+  assert(is_de_contiguous_container_asan_correct(short_d2a));
+  assert(is_de_contiguous_container_asan_correct(short_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2a));
+  assert(is_de_contiguous_container_asan_correct(mid_d2b));
+  assert(is_de_contiguous_container_asan_correct(mid_d2c));
+  assert(is_de_contiguous_container_asan_correct(long_d2a));
+  assert(is_de_contiguous_container_asan_correct(long_d2b));
+  assert(is_de_contiguous_container_asan_correct(long_d2c));
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        test<T>();
+    }
+*/
+  return 0;
+}

libcxx/test/std/containers/sequences/deque/deque.asan/swap.pass.cpp

+//===----------------------------------------------------------------------===//
+//
+// 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
+//
+//===----------------------------------------------------------------------===//
+
+// <deque>
+
+#include <cassert>
+#include <array>
+#include "test_macros.h"
+#include "asan_testing.h" // includes deque - don't do it before
+
+template <typename T>
+void test_external() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  D empty_d1a, empty_d1b;
+  D short_d1a(1), short_d1b;
+  D mid_d1a(N), mid_d1b(N + 1);
+  D long_d1a(8 * N), long_d1b(11 * N + 1);
+
+  std::swap(empty_d1a, empty_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(empty_d1b));
+  std::swap(empty_d1a, empty_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(empty_d1b));
+
+  std::swap(empty_d1a, short_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  std::swap(empty_d1a, short_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+
+  std::swap(empty_d1a, mid_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  std::swap(empty_d1a, mid_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+
+  std::swap(empty_d1a, mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  std::swap(empty_d1a, mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+
+  std::swap(empty_d1a, long_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  std::swap(empty_d1a, long_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+
+  std::swap(empty_d1a, long_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  std::swap(empty_d1a, long_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+
+  std::swap(short_d1a, short_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  std::swap(short_d1a, short_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+
+  std::swap(short_d1a, mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  std::swap(short_d1a, mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+
+  std::swap(short_d1a, long_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  std::swap(short_d1a, long_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+
+  std::swap(mid_d1a, mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  std::swap(mid_d1a, mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+
+  std::swap(mid_d1a, long_d1b);
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  std::swap(mid_d1a, long_d1b);
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+
+  std::swap(long_d1a, long_d1b);
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  std::swap(long_d1a, long_d1b);
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+
+  std::swap(empty_d1a, empty_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+
+  std::swap(short_d1a, short_d1a);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  std::swap(short_d1b, short_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+
+  std::swap(long_d1a, long_d1a);
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+}
+
+template <typename T>
+void test_member() {
+  typedef std::deque<T> D;
+  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
+
+  D empty_d1a, empty_d1b;
+  D short_d1a(1), short_d1b;
+  D mid_d1a(N), mid_d1b(N + 1);
+  D long_d1a(8 * N), long_d1b(11 * N + 1);
+
+  empty_d1a.swap(empty_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(empty_d1b));
+  empty_d1a.swap(empty_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(empty_d1b));
+
+  empty_d1a.swap(short_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  empty_d1a.swap(short_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+
+  empty_d1a.swap(mid_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  empty_d1a.swap(mid_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+
+  empty_d1a.swap(mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  empty_d1a.swap(mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+
+  empty_d1a.swap(long_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  empty_d1a.swap(long_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+
+  empty_d1a.swap(long_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  empty_d1a.swap(long_d1b);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+
+  short_d1a.swap(short_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+  short_d1a.swap(short_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+
+  short_d1a.swap(mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  short_d1a.swap(mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+
+  short_d1a.swap(long_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  short_d1a.swap(long_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+
+  mid_d1a.swap(mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+  mid_d1a.swap(mid_d1b);
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(mid_d1b));
+
+  mid_d1a.swap(long_d1b);
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  mid_d1a.swap(long_d1b);
+  assert(is_de_contiguous_container_asan_correct(mid_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+
+  long_d1a.swap(long_d1b);
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+  long_d1a.swap(long_d1b);
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+  assert(is_de_contiguous_container_asan_correct(long_d1b));
+
+  empty_d1a.swap(empty_d1a);
+  assert(is_de_contiguous_container_asan_correct(empty_d1a));
+
+  short_d1a.swap(short_d1a);
+  assert(is_de_contiguous_container_asan_correct(short_d1a));
+  short_d1b.swap(short_d1b);
+  assert(is_de_contiguous_container_asan_correct(short_d1b));
+
+  long_d1a.swap(long_d1a);
+  assert(is_de_contiguous_container_asan_correct(long_d1a));
+}
+
+template <typename T>
+void test() {
+  test_external<T>();
+  test_member<T>();
+}
+
+int main(int, char**) {
+  {
+    typedef char T;
+    test<T>();
+  }
+  {
+    typedef short T;
+    test<T>();
+  }
+  {
+    typedef int T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 3> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 5> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 11> T;
+    test<T>();
+  }
+  {
+    typedef std::array<char, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<int, 8000> T;
+    test<T>();
+  }
+  {
+    typedef std::array<std::array<char, 3>, 8000> T;
+    test<T>();
+  }
+  /*
+    // Testing interface does not support situations,
+    // when object memory may be poisoned (SSO case).
+    {
+        typedef std::string T;
+        test<T>();
+    }
+*/
+  return 0;
+}

libcxx/test/support/asan_testing.h

 //===----------------------------------------------------------------------===//
 //
 // 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 ASAN_TESTING_H
 #define ASAN_TESTING_H
 
+#ifdef _LIBCPP_DEQUE
+// We need to define __LIBCPP_VERIFY_ASAN_DEQUE_ANNOTATIONS first
+// prior to including deque, so we error out if its already included
+#  error deque included before asan_testing.h
+#endif
+
 #include "test_macros.h"
 
 #if TEST_HAS_FEATURE(address_sanitizer)
 extern "C" int __sanitizer_verify_contiguous_container
      ( const void *beg, const void *mid, const void *end );
+extern "C" int
+__sanitizer_verify_de_contiguous_container(const void* beg, const void* con_beg, const void* con_end, const void* end);
+extern "C" bool __sanitizer_is_annotable(const void* address, const unsigned long size);
+#  define __LIBCPP_VERIFY_ASAN_DEQUE_ANNOTATIONS
+#  include <deque>
+#  include <vector>
 
 template <typename T, typename Alloc>
 TEST_CONSTEXPR bool is_contiguous_container_asan_correct ( const std::vector<T, Alloc> &c )
 {
     if (std::__libcpp_is_constant_evaluated())
         return true;
     if (std::is_same<Alloc, std::allocator<T> >::value && c.data() != NULL)
         return __sanitizer_verify_contiguous_container(
             c.data(), c.data() + c.size(), c.data() + c.capacity()) != 0;
     return true;
 }
 
+template <class _Tp, class _Allocator>
+TEST_CONSTEXPR bool is_de_contiguous_container_asan_correct(const std::deque<_Tp, _Allocator>& c) {
+  return c.__verify_asan_annotations();
+}
 #else
 template <typename T, typename Alloc>
 TEST_CONSTEXPR bool is_contiguous_container_asan_correct ( const std::vector<T, Alloc> &)
 {
     return true;
 }
-#endif
 
+template <class _Tp, class _Allocator>
+TEST_CONSTEXPR bool is_de_contiguous_container_asan_correct(const std::deque<_Tp, _Allocator>&) {
+  return true;
+}
+#endif
 
 #endif // ASAN_TESTING_H

upstream-deque-rev-2

+commit 9a8b9041217b32d6a3f952140175b1fbf26b3be4
+Author: Advenam Tacet <[e-mail]>
+Date:   Wed Aug 17 21:47:13 2022 +0200
+
+    [2a/3][ASan][libcxx] std::deque annotations
+    
+    This commit is a part of patches extending AddressSanitizer
+    C++ container overflow detection capabilities by adding annotations,
+    similar to those existing in std::vector, to std::string and
+    std::deque collections. These changes allow ASan to detect cases
+    when the instrumented program accesses memory which is internally
+    allocated by the collection but is still not in-use
+    (accesses before or after the stored elements for std::deque,
+    or between the size and capacity bounds for std::string).
+    
+    Trail of Bits developed this as part of a research project where
+    we tried to find bugs using the oss-fuzz
+    (using llvm-14 with our modifications) harnesses.
+    Now, we want to upstream the llvm-15 port of this work.
+    
+    That commit adds ASan annotations to std::deque.
+    Every std::deque chunk (contiguous memory block used by the container)
+    is annotated separately and API functions from [1a/3]
+    are used for that purpose.
+    
+    Regarding performance, the introduced changes only affect cases when
+    a std::deque object is created or has an element added or removed.
+    It is similar to std::vector in that aspect.
+    
+    The commit also adds unit tests for those annotations and
+    a compiler-rt function,
+    __sanitizer_verify_de_contiguous_container,
+    which is used within those tests.
+    This function can also be used in the future to verify
+    the sanitization/annotation verification of other
+    double ended contiguous containers.
+    
+    Also please note that
+    the is_de_contiguous_container_asan_correct function
+    can only verify std::deque objects whose memory is never poisoned
+    by elements inside.
+    Therefore it cannot be and is not used within the tests with
+    a sanitized std::basic_string implementation
+    (which is added in the next commit in this patch series).
+    
+    Structure of our patches:
+    [1a/3][ASan][compiler-rt] API for double ended containers
+    [1b/3][ASan][compiler-rt] API for annotating objects memory
+    [2a/3][ASan][libcxx] std::deque annotations
+    [2b/3][ASan][libcxx] std::basic_string annotations
+    [3/3][ASan] integration test for std::deque and std::basic_string annotations
+    
+    1a -> 2a -
+               \
+                --> 3
+               /
+    1b -> 2b -
+    
+    If you have any questions, please email:
+    - [e-mail]
+    - [e-mail]
+
+diff --git a/libcxx/include/deque b/libcxx/include/deque
+index 2bb2643c2214..ab6173a73ba1 100644
+--- a/libcxx/include/deque
++++ b/libcxx/include/deque
+@@ -1280,6 +1280,8 @@ template <class _Tp, class _Allocator /*= allocator<_Tp>*/>
+ class _LIBCPP_TEMPLATE_VIS deque
+     : private __deque_base<_Tp, _Allocator>
+ {
++private:
++    typedef allocator<_Tp>                      __default_allocator_type;
+ public:
+     // types:
+ 
+@@ -1312,8 +1314,9 @@ public:
+     _LIBCPP_INLINE_VISIBILITY
+     deque()
+         _NOEXCEPT_(is_nothrow_default_constructible<allocator_type>::value)
+-        {}
+-    _LIBCPP_INLINE_VISIBILITY explicit deque(const allocator_type& __a) : __base(__a) {}
++        { __annotate_new(0); }
++    _LIBCPP_INLINE_VISIBILITY explicit deque(const allocator_type& __a) : __base(__a)
++        { __annotate_new(0); }
+     explicit deque(size_type __n);
+ #if _LIBCPP_STD_VER > 11
+     explicit deque(size_type __n, const _Allocator& __a);
+@@ -1323,6 +1326,7 @@ public:
+     template <class = __enable_if_t<__is_allocator<_Allocator>::value> >
+     deque(size_type __n, const value_type& __v, const allocator_type& __a) : __base(__a)
+     {
++        __annotate_new(0);
+         if (__n > 0)
+             __append(__n, __v);
+     }
+@@ -1529,9 +1533,325 @@ public:
+     }
+ 
+  private:
++    // Implementation based on the one from std::vector.
++    //
++    // The following functions are no-ops outside of AddressSanitizer mode.
++    // We call annotatations only for the default Allocator because other allocators
++    // may not meet the AddressSanitizer alignment constraints.
++    // See the documentation for __sanitizer_annotate_contiguous_container for more details.
++#ifndef _LIBCPP_HAS_NO_ASAN
++    _LIBCPP_INLINE_VISIBILITY
++
++    void __annotate_contiguous_container_front(const void *__beg, const void *__end,
++                                         const void *__new_con_beg,
++                                         const void *__old_con_beg,
++                                         const void *__con_end) const
++    {
++        // Same wrapper as in std::vector for annotating mid-to-end of a contiguous block
++        // Note that we don't maintain front annotations of a std::deque here
++        // as this is done in a more specific functions below and this one is only
++        // used by them.
++        if (__beg && is_same<allocator_type, __default_allocator_type>::value)
++            __sanitizer_annotate_de_contiguous_container_front(__beg, __end, __new_con_beg, __old_con_beg, __con_end);
++
++    }
++        void __annotate_contiguous_container_back(const void *__beg, const void *__end,
++                                               const void *__old_con_end,
++                                               const void *__new_con_end,
++                                               const void *__con_beg) const
++    {
++        // Same wrapper as in std::vector for annotating mid-to-end of a contiguous block
++        // Note that we don't maintain front annotations of a std::deque here
++        // as this is done in a more specific functions below and this one is only
++        // used by them.
++        if (__beg && is_same<allocator_type, __default_allocator_type>::value)
++            __sanitizer_annotate_de_contiguous_container_back(__beg, __end, __old_con_end, __new_con_end, __con_beg);
++
++    }
++#else
++    _LIBCPP_INLINE_VISIBILITY
++    void __annotate_contiguous_container_front(const void*, const void*, const void*,
++                                         const void*, const void*) const _NOEXCEPT {}
++    _LIBCPP_INLINE_VISIBILITY
++    void __annotate_contiguous_container_back(const void*, const void*, const void*,
++                                         const void*, const void *) const _NOEXCEPT {}
++#endif
++
++    _LIBCPP_INLINE_VISIBILITY
++    // __b - index of first item in __map_ to annotate
++    // __e - index behind the last item in __map_ to annotate (so last item + 1)
++    void __annotate_poison_from_to_front(size_type __b, size_type __e) const _NOEXCEPT
++    {
++        if (__b == __e)
++            return;
++
++        // __mp - ponter to the first chunk which annotations we want to modify.
++        // __last_mp - pointer to the last chunk which annotations we want to modify.
++        // If ony one chunk if affected, __mp == __last_mp
++        // We use (__e - 1) in calculations, because if we poison to the very end of chunk,
++        // we still want to point at that chunk and not the next one. Using __e, would
++        // point at the memory for the next element, which may be in a next chunk.
++        typename __base::__map_traits::const_pointer __mp = __base::__map_.begin() + __b / __base::__block_size;
++        typename __base::__map_traits::const_pointer __last_mp = __base::__map_.begin() + (__e - 1) / __base::__block_size;
++
++        const void *__p = _VSTD::__to_address(*__mp + (__b % __base::__block_size));
++
++        // We iterate over map pointers and fully poison all blocks between the first and the last.
++        // The first block is partialy poisoned here as well.
++        // The last one is poisoned after the while loop.
++        while (__mp != __last_mp)
++        {
++            // Pointer to block's end
++            const void *__p_e = _VSTD::__to_address(*__mp + __base::__block_size);
++            // Pointer to block's beginning
++            const void *__p_b = _VSTD::__to_address(*__mp);
++            __annotate_contiguous_container_front(__p_b, __p_e, __p_e, __p, __p_e); // poison [__p, __p_e]
++
++            __mp += 1;
++            __p = _VSTD::__to_address(*__mp);
++        }
++
++        // If __last_block_index is zero, then we should point to the end of a chunk (one of its contiguous blocks).
++        size_type __last_block_index = __e % __base::__block_size;
++
++        const void *__p_e = _VSTD::__to_address(*__mp + (__last_block_index == 0 ? __base::__block_size : __last_block_index));
++        const void *__p_b = _VSTD::__to_address(*__mp);
++        const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
++
++        // Poisoning happens after the container modification, so the size
++        // was already changed and may be 0 but we still have to poison the cleared blocks.
++        if (__last_block_index == 0 || size() == 0)
++            __annotate_contiguous_container_front(__p_b, __p_t_e, __p_e, __p, __p_e);
++        else {
++            // Due to current limitations of ASan, it only matters if container is empty or not,
++            // therefore we do not calculate true end of the container in the block (performance reasons),
++            // but if poisoning prefixes will be implemented in Asan, we should pass correct end of memory in use
++            // inside that chunk, instead of just end of the allocated memory. (Last argument.)
++            __annotate_contiguous_container_front(__p_b, __p_t_e, __p_e, __p, __p_t_e);
++        }
++   }
++
++    _LIBCPP_INLINE_VISIBILITY
++    void __annotate_unpoison_from_to_front(size_type __b, size_type __e) const _NOEXCEPT
++    {
++        if (__b == __e)
++            return;
++        // Check comment in  __annotate_poison_from_to_front(size_type, size_type) for details.
++        typename __base::__map_traits::const_pointer __mp = __base::__map_.begin() + __b / __base::__block_size;
++        typename __base::__map_traits::const_pointer __last_mp = __base::__map_.begin() + (__e-1) / __base::__block_size;
++
++        const void *__p = _VSTD::__to_address(*__mp + (__b % __base::__block_size));
++        while (__mp != __last_mp)
++        {
++            // Pointer to block's end
++            const void *__p_e = _VSTD::__to_address(*__mp + __base::__block_size);
++            // Pointer to block's beginning
++            const void *__p_b = _VSTD::__to_address(*__mp);
++            __annotate_contiguous_container_front(__p_b, __p_e, __p, __p_e, __p_e);
++
++            __mp += 1;
++            __p = _VSTD::__to_address(*__mp);
++        }
++
++        size_type __last_block_index = __e % __base::__block_size;
++
++        const void *__p_e = _VSTD::__to_address(*__mp + (__last_block_index == 0 ? __base::__block_size : __last_block_index));
++        const void *__p_b = _VSTD::__to_address(*__mp);
++        const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
++
++        // unpoison happens before the size is changed
++        // so we have to unpoison the block before its modified
++        if (__last_block_index == 0 || size() == 0)
++            __annotate_contiguous_container_front(__p_b, __p_e, __p, __p_e, __p_e);
++        else
++        {
++            // Check comment in  __annotate_poison_from_to_front(size_type, size_type) for details.
++            __annotate_contiguous_container_front(__p_b, __p_t_e, __p, __p_e, __p_t_e);
++        }
++    }
++
++    _LIBCPP_INLINE_VISIBILITY
++    void __annotate_poison_from_to_back(size_type __b, size_type __e) const _NOEXCEPT
++    {
++        if (__b == __e)
++            return;
++
++        // Check comment in  __annotate_poison_from_to_front(size_type, size_type) for details.
++        typename __base::__map_traits::const_pointer __mp = __base::__map_.begin() + __b / __base::__block_size;
++        typename __base::__map_traits::const_pointer __last_mp = __base::__map_.begin() + (__e - 1) / __base::__block_size;
++
++        const void *__p = _VSTD::__to_address(*__mp + (__b % __base::__block_size));
++        const void *__p_t_b = size() == 0 ? __p : _VSTD::__to_address(*__mp);
++
++        while (__mp != __last_mp)
++        {
++            const void *__p_e = _VSTD::__to_address(*__mp + __base::__block_size);
++            const void *__p_b = _VSTD::__to_address(*__mp);
++            const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
++            __annotate_contiguous_container_back(__p_b, __p_t_e, __p_e, __p, __p_t_b);
++
++            __mp += 1;
++            __p_t_b = __p = _VSTD::__to_address(*__mp);
++        }
++
++        size_type __last_block_index = __e % __base::__block_size;
++        const void *__p_e = _VSTD::__to_address(*__mp + (__last_block_index == 0 ? __base::__block_size : __last_block_index));
++        const void *__p_b = _VSTD::__to_address(*__mp);
++        const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
++        __annotate_contiguous_container_back(__p_b, __p_t_e, __p_e, __p, __p_t_b);
++    }
++
++    _LIBCPP_INLINE_VISIBILITY
++    void __annotate_unpoison_from_to_back(size_type __b, size_type __e) const _NOEXCEPT
++    {
++        if (__b == __e)
++            return;
++
++        // Check comment in  __annotate_poison_from_to_front(size_type, size_type) for details.
++        typename __base::__map_traits::const_pointer __mp = __base::__map_.begin() + __b / __base::__block_size;
++        typename __base::__map_traits::const_pointer __last_mp = __base::__map_.begin() + (__e-1) / __base::__block_size;
++
++        const void *__p = _VSTD::__to_address(*__mp + (__b % __base::__block_size));
++        const void *__p_t_b = _VSTD::__to_address(*__mp);
++
++        while (__mp != __last_mp)
++        {
++            const void *__p_e = _VSTD::__to_address(*__mp + __base::__block_size);
++            const void *__p_b = _VSTD::__to_address(*__mp);
++            const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
++            __annotate_contiguous_container_back(__p_b, __p_t_e, __p, __p_e, __p_t_b);
++
++            __mp += 1;
++            __p_t_b = __p = _VSTD::__to_address(*__mp);
++        }
++
++        size_type __last_block_index = __e % __base::__block_size;
++        const void *__p_e = _VSTD::__to_address(*__mp + (__last_block_index == 0 ? __base::__block_size : __last_block_index));
++        const void *__p_b = _VSTD::__to_address(*__mp);
++        const void *__p_t_e = _VSTD::__to_address(*__mp + __base::__block_size);
++        __annotate_contiguous_container_back(__p_b, __p_t_e, __p, __p_e, __p_t_b);
++    }
++
++    _LIBCPP_INLINE_VISIBILITY
++    void __annotate_new(size_type __current_size) const _NOEXCEPT
++    {
++        if (__current_size == 0)
++            __annotate_poison_from_to_back(0, __base::__map_.size() * __base::__block_size);
++        else
++        {
++            // This branch is never reached in current implementation because
++            // __annotate_new is always called with 0,
++            // but let's leave it here in case anyone needs to use
++            // __annotate_new(n) in the future
++            __annotate_poison_from_to_front(0, __base::__start_);
++            __annotate_poison_from_to_back(__base::__start_ + __current_size, __base::__map_.size() * __base::__block_size);
++        }
++    }
++
++    _LIBCPP_INLINE_VISIBILITY
++    void __annotate_delete() const _NOEXCEPT
++    {
++        if(!empty())
++        {
++            __annotate_unpoison_from_to_front(0, __base::__start_);
++            __annotate_unpoison_from_to_back(__base::__start_ + __base::size(), __base::__map_.size() * __base::__block_size);
++        }
++        else
++            __annotate_unpoison_from_to_back(0, __base::__map_.size() * __base::__block_size);
++    }
++
++    _LIBCPP_INLINE_VISIBILITY
++    void __annotate_increase_front(size_type __n) const _NOEXCEPT
++    {
++        __annotate_unpoison_from_to_front(__base::__start_ - __n, __base::__start_);
++    }
++
++    _LIBCPP_INLINE_VISIBILITY
++    void __annotate_increase_back(size_type __n) const _NOEXCEPT
++    {
++        __annotate_unpoison_from_to_back(__base::__start_ + __base::size(), __base::__start_ + __base::size() + __n);
++    }
++
++    _LIBCPP_INLINE_VISIBILITY
++    void __annotate_shrink_front(size_type __old_size, size_type __old_start) const _NOEXCEPT
++    {
++        __annotate_poison_from_to_front(__old_start, __old_start + (__old_size - size()));
++    }
++
++    _LIBCPP_INLINE_VISIBILITY
++    void __annotate_shrink_back(size_type __old_size, size_type __old_start) const _NOEXCEPT
++    {
++        __annotate_poison_from_to_back(__old_start + size(), __old_start + __old_size);
++    }
++
++// This macro should be defined only during testing ASAN.
++// Include the "asan_testing.h" file which defines it
++// to be able to use it in ASan tests.
++#ifdef __LIBCPP_VERIFY_ASAN_DEQUE_ANNOTATIONS
++ public:
++    bool __verify_asan_annotations() const _NOEXCEPT
++    {
++        // This function tests deque object annotations.
++        // This test is simplified, it tests only if:
++        // - memory owned by deque (deque blocks) not containig alements is poisoned.
++        // - memory owned by deque elements is accessible.
++        //
++        // Therefore you cannot test, with that function, deque containing objects
++        // which memory may be partialy (or fully) poisoned, like std::string (SSO case).
++        // You can test std::vector or long std::string.
++
++        if (empty())
++        {
++            for (typename __base::__map_traits::const_pointer __it = __base::__map_.begin(); __it != __base::__map_.end(); ++__it)
++                if (!__sanitizer_verify_de_contiguous_container(*__it, *__it, *__it, *__it + __base::__block_size))
++                    return false;
++
++            return true;
++        }
++
++        size_type __e = __base::__start_ + __base::size();
++        typename __base::__map_traits::const_pointer __first_mp = __base::__map_.begin() + __base::__start_ / __base::__block_size;
++        typename __base::__map_traits::const_pointer __last_mp = __base::__map_.begin() + (__e-1) / __base::__block_size;
++
++        // Pointers to first and last elements
++        // They can be in *different deque blocks*
++        pointer __p_first = *__first_mp + (__base::__start_ % __base::__block_size);
++        pointer __p_last = *__last_mp + ((__e % __base::__block_size == 0) ? __base::__block_size : __e % __base::__block_size);
++
++        for (typename __base::__map_traits::const_pointer __it = __base::__map_.begin(); __it != __base::__map_.end(); ++__it)
++        {
++            // Go over all blocks, find the place we are in and verify its annotations
++            // Note that __p_last points *behind* the last item.
++
++            // - blocks before the first block with container elements
++            // - first block with items
++            // - last block with items
++            // - blocks after last block with ciontainer elements
++
++
++            // Is the block before or after deque blocks that contain elements?
++            if (__it < __first_mp || __it > __last_mp)
++                {if (!__sanitizer_verify_de_contiguous_container(*__it, *__it, *__it, (*__it + __base::__block_size))) return false;}
++
++            else
++            {
++                // Is the block the first block that contains elements?
++                pointer __con_beg = (__it == __first_mp) ? __p_first : *__it;
++                // Is it the last one?
++                pointer __con_end = (__it == __last_mp) ? __p_last : (*__it + __base::__block_size);
++                {if (!__sanitizer_verify_de_contiguous_container(*__it, __con_beg, __con_end, (*__it + __base::__block_size))) return false;}
++            }
++        }
++
++        return true;
++    }
++ private:
++#endif
++
+     _LIBCPP_INLINE_VISIBILITY
+     bool __maybe_remove_front_spare(bool __keep_one = true) {
+       if (__front_spare_blocks() >= 2 || (!__keep_one && __front_spare_blocks())) {
++        __annotate_unpoison_from_to_back(0, __base::__block_size);
+         __alloc_traits::deallocate(__base::__alloc(), __base::__map_.front(),
+                                    __base::__block_size);
+         __base::__map_.pop_front();
+@@ -1544,6 +1864,7 @@ public:
+     _LIBCPP_INLINE_VISIBILITY
+     bool __maybe_remove_back_spare(bool __keep_one = true) {
+       if (__back_spare_blocks() >= 2 || (!__keep_one && __back_spare_blocks())) {
++        __annotate_unpoison_from_to_back((__base::__map_.size() - 1) * __base::__block_size, __base::__map_.size() * __base::__block_size);
+         __alloc_traits::deallocate(__base::__alloc(), __base::__map_.back(),
+                                    __base::__block_size);
+         __base::__map_.pop_back();
+@@ -1598,6 +1919,8 @@ public:
+     void __move_assign(deque& __c, true_type)
+         _NOEXCEPT_(is_nothrow_move_assignable<allocator_type>::value);
+     void __move_assign(deque& __c, false_type);
++public:
++    ~deque() { __annotate_delete(); }
+ };
+ 
+ #if _LIBCPP_STD_VER >= 17
+@@ -1621,6 +1944,7 @@ deque(_InputIterator, _InputIterator, _Alloc)
+ template <class _Tp, class _Allocator>
+ deque<_Tp, _Allocator>::deque(size_type __n)
+ {
++    __annotate_new(0);
+     if (__n > 0)
+         __append(__n);
+ }
+@@ -1630,6 +1954,7 @@ template <class _Tp, class _Allocator>
+ deque<_Tp, _Allocator>::deque(size_type __n, const _Allocator& __a)
+     : __base(__a)
+ {
++    __annotate_new(0);
+     if (__n > 0)
+         __append(__n);
+ }
+@@ -1638,6 +1963,7 @@ deque<_Tp, _Allocator>::deque(size_type __n, const _Allocator& __a)
+ template <class _Tp, class _Allocator>
+ deque<_Tp, _Allocator>::deque(size_type __n, const value_type& __v)
+ {
++    __annotate_new(0);
+     if (__n > 0)
+         __append(__n, __v);
+ }
+@@ -1647,6 +1973,7 @@ template <class _InputIter>
+ deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l,
+               typename enable_if<__is_cpp17_input_iterator<_InputIter>::value>::type*)
+ {
++    __annotate_new(0);
+     __append(__f, __l);
+ }
+ 
+@@ -1656,6 +1983,7 @@ deque<_Tp, _Allocator>::deque(_InputIter __f, _InputIter __l, const allocator_ty
+               typename enable_if<__is_cpp17_input_iterator<_InputIter>::value>::type*)
+     : __base(__a)
+ {
++    __annotate_new(0);
+     __append(__f, __l);
+ }
+ 
+@@ -1663,6 +1991,7 @@ template <class _Tp, class _Allocator>
+ deque<_Tp, _Allocator>::deque(const deque& __c)
+     : __base(__alloc_traits::select_on_container_copy_construction(__c.__alloc()))
+ {
++    __annotate_new(0);
+     __append(__c.begin(), __c.end());
+ }
+ 
+@@ -1670,6 +1999,7 @@ template <class _Tp, class _Allocator>
+ deque<_Tp, _Allocator>::deque(const deque& __c, const __type_identity_t<allocator_type>& __a)
+     : __base(__a)
+ {
++    __annotate_new(0);
+     __append(__c.begin(), __c.end());
+ }
+ 
+@@ -1690,6 +2020,7 @@ deque<_Tp, _Allocator>::operator=(const deque& __c)
+ template <class _Tp, class _Allocator>
+ deque<_Tp, _Allocator>::deque(initializer_list<value_type> __il)
+ {
++    __annotate_new(0);
+     __append(__il.begin(), __il.end());
+ }
+ 
+@@ -1697,6 +2028,7 @@ template <class _Tp, class _Allocator>
+ deque<_Tp, _Allocator>::deque(initializer_list<value_type> __il, const allocator_type& __a)
+     : __base(__a)
+ {
++    __annotate_new(0);
+     __append(__il.begin(), __il.end());
+ }
+ 
+@@ -1839,12 +2171,14 @@ deque<_Tp, _Allocator>::shrink_to_fit() _NOEXCEPT
+     allocator_type& __a = __base::__alloc();
+     if (empty())
+     {
++        __annotate_delete();
+         while (__base::__map_.size() > 0)
+         {
+             __alloc_traits::deallocate(__a, __base::__map_.back(), __base::__block_size);
+             __base::__map_.pop_back();
+         }
+         __base::__start_ = 0;
++        __annotate_new(0);
+     }
+     else
+     {
+@@ -1938,6 +2272,7 @@ deque<_Tp, _Allocator>::push_back(const value_type& __v)
+     if (__back_spare() == 0)
+         __add_back_capacity();
+     // __back_spare() >= 1
++    __annotate_increase_back(1);
+     __alloc_traits::construct(__a, _VSTD::addressof(*__base::end()), __v);
+     ++__base::size();
+ }
+@@ -1950,6 +2285,7 @@ deque<_Tp, _Allocator>::push_front(const value_type& __v)
+     if (__front_spare() == 0)
+         __add_front_capacity();
+     // __front_spare() >= 1
++    __annotate_increase_front(1);
+     __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), __v);
+     --__base::__start_;
+     ++__base::size();
+@@ -1964,6 +2300,7 @@ deque<_Tp, _Allocator>::push_back(value_type&& __v)
+     if (__back_spare() == 0)
+         __add_back_capacity();
+     // __back_spare() >= 1
++    __annotate_increase_back(1);
+     __alloc_traits::construct(__a, _VSTD::addressof(*__base::end()), _VSTD::move(__v));
+     ++__base::size();
+ }
+@@ -1981,6 +2318,7 @@ deque<_Tp, _Allocator>::emplace_back(_Args&&... __args)
+     if (__back_spare() == 0)
+         __add_back_capacity();
+     // __back_spare() >= 1
++    __annotate_increase_back(1);
+     __alloc_traits::construct(__a, _VSTD::addressof(*__base::end()),
+                               _VSTD::forward<_Args>(__args)...);
+     ++__base::size();
+@@ -1997,6 +2335,7 @@ deque<_Tp, _Allocator>::push_front(value_type&& __v)
+     if (__front_spare() == 0)
+         __add_front_capacity();
+     // __front_spare() >= 1
++    __annotate_increase_front(1);
+     __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), _VSTD::move(__v));
+     --__base::__start_;
+     ++__base::size();
+@@ -2016,6 +2355,7 @@ deque<_Tp, _Allocator>::emplace_front(_Args&&... __args)
+     if (__front_spare() == 0)
+         __add_front_capacity();
+     // __front_spare() >= 1
++    __annotate_increase_front(1);
+     __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), _VSTD::forward<_Args>(__args)...);
+     --__base::__start_;
+     ++__base::size();
+@@ -2036,6 +2376,7 @@ deque<_Tp, _Allocator>::insert(const_iterator __p, value_type&& __v)
+         if (__front_spare() == 0)
+             __add_front_capacity();
+         // __front_spare() >= 1
++        __annotate_increase_front(1);
+         if (__pos == 0)
+         {
+             __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), _VSTD::move(__v));
+@@ -2059,6 +2400,7 @@ deque<_Tp, _Allocator>::insert(const_iterator __p, value_type&& __v)
+         if (__back_spare() == 0)
+             __add_back_capacity();
+         // __back_capacity >= 1
++        __annotate_increase_back(1);
+         size_type __de = __base::size() - __pos;
+         if (__de == 0)
+         {
+@@ -2092,6 +2434,7 @@ deque<_Tp, _Allocator>::emplace(const_iterator __p, _Args&&... __args)
+         if (__front_spare() == 0)
+             __add_front_capacity();
+         // __front_spare() >= 1
++        __annotate_increase_front(1);
+         if (__pos == 0)
+         {
+             __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), _VSTD::forward<_Args>(__args)...);
+@@ -2116,6 +2459,7 @@ deque<_Tp, _Allocator>::emplace(const_iterator __p, _Args&&... __args)
+         if (__back_spare() == 0)
+             __add_back_capacity();
+         // __back_capacity >= 1
++        __annotate_increase_back(1);
+         size_type __de = __base::size() - __pos;
+         if (__de == 0)
+         {
+@@ -2152,6 +2496,7 @@ deque<_Tp, _Allocator>::insert(const_iterator __p, const value_type& __v)
+         if (__front_spare() == 0)
+             __add_front_capacity();
+         // __front_spare() >= 1
++        __annotate_increase_front(1);
+         if (__pos == 0)
+         {
+             __alloc_traits::construct(__a, _VSTD::addressof(*--__base::begin()), __v);
+@@ -2178,6 +2523,7 @@ deque<_Tp, _Allocator>::insert(const_iterator __p, const value_type& __v)
+         if (__back_spare() == 0)
+             __add_back_capacity();
+         // __back_capacity >= 1
++        __annotate_increase_back(1);
+         size_type __de = __base::size() - __pos;
+         if (__de == 0)
+         {
+@@ -2213,6 +2559,7 @@ deque<_Tp, _Allocator>::insert(const_iterator __p, size_type __n, const value_ty
+         if (__n > __front_spare())
+             __add_front_capacity(__n - __front_spare());
+         // __n <= __front_spare()
++        __annotate_increase_front(__n);
+         iterator __old_begin = __base::begin();
+         iterator __i = __old_begin;
+         if (__n > __pos)
+@@ -2237,6 +2584,7 @@ deque<_Tp, _Allocator>::insert(const_iterator __p, size_type __n, const value_ty
+         if (__n > __back_capacity)
+             __add_back_capacity(__n - __back_capacity);
+         // __n <= __back_capacity
++        __annotate_increase_back(__n);
+         iterator __old_end = __base::end();
+         iterator __i = __old_end;
+         size_type __de = __base::size() - __pos;
+@@ -2299,6 +2647,7 @@ deque<_Tp, _Allocator>::insert(const_iterator __p, _BiIter __f, _BiIter __l,
+         if (__n > __front_spare())
+             __add_front_capacity(__n - __front_spare());
+         // __n <= __front_spare()
++        __annotate_increase_front(__n);
+         iterator __old_begin = __base::begin();
+         iterator __i = __old_begin;
+         _BiIter __m = __f;
+@@ -2329,6 +2678,7 @@ deque<_Tp, _Allocator>::insert(const_iterator __p, _BiIter __f, _BiIter __l,
+         if (__n > __back_capacity)
+             __add_back_capacity(__n - __back_capacity);
+         // __n <= __back_capacity
++        __annotate_increase_back(__n);
+         iterator __old_end = __base::end();
+         iterator __i = __old_end;
+         _BiIter __m = __l;
+@@ -2379,6 +2729,7 @@ deque<_Tp, _Allocator>::__append(_ForIter __f, _ForIter __l,
+     if (__n > __back_capacity)
+         __add_back_capacity(__n - __back_capacity);
+     // __n <= __back_capacity
++    __annotate_increase_back(__n);
+     for (__deque_block_range __br : __deque_range(__base::end(), __base::end() + __n)) {
+       _ConstructTransaction __tx(this, __br);
+       for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_, (void)++__f) {
+@@ -2396,6 +2747,7 @@ deque<_Tp, _Allocator>::__append(size_type __n)
+     if (__n > __back_capacity)
+         __add_back_capacity(__n - __back_capacity);
+     // __n <= __back_capacity
++    __annotate_increase_back(__n);
+     for (__deque_block_range __br : __deque_range(__base::end(), __base::end() + __n)) {
+       _ConstructTransaction __tx(this, __br);
+       for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_) {
+@@ -2413,6 +2765,7 @@ deque<_Tp, _Allocator>::__append(size_type __n, const value_type& __v)
+     if (__n > __back_capacity)
+         __add_back_capacity(__n - __back_capacity);
+     // __n <= __back_capacity
++    __annotate_increase_back(__n);
+     for (__deque_block_range __br : __deque_range(__base::end(), __base::end() + __n)) {
+       _ConstructTransaction __tx(this, __br);
+       for (; __tx.__pos_ != __tx.__end_; ++__tx.__pos_) {
+@@ -2454,6 +2807,7 @@ deque<_Tp, _Allocator>::__add_front_capacity()
+         __base::__start_ = __base::__map_.size() == 1 ?
+                                __base::__block_size / 2 :
+                                __base::__start_ + __base::__block_size;
++        __annotate_poison_from_to_back(0, __base::__block_size);
+     }
+     // Else need to allocate 1 buffer, *and* we need to reallocate __map_.
+     else
+@@ -2479,6 +2833,7 @@ deque<_Tp, _Allocator>::__add_front_capacity()
+         __base::__start_ = __base::__map_.size() == 1 ?
+                                __base::__block_size / 2 :
+                                __base::__start_ + __base::__block_size;
++        __annotate_poison_from_to_back(0, __base::__block_size);
+     }
+ }
+ 
+@@ -2515,6 +2870,7 @@ deque<_Tp, _Allocator>::__add_front_capacity(size_type __n)
+             if (__base::__map_.__front_spare() == 0)
+                 break;
+             __base::__map_.push_front(__alloc_traits::allocate(__a, __base::__block_size));
++            __annotate_poison_from_to_back(0, __base::__block_size);
+         }
+         for (; __nb > 0; --__nb, ++__back_capacity)
+             __base::__map_.push_back(__alloc_traits::allocate(__a, __base::__block_size));
+@@ -2525,6 +2881,7 @@ deque<_Tp, _Allocator>::__add_front_capacity(size_type __n)
+             pointer __pt = __base::__map_.back();
+             __base::__map_.pop_back();
+             __base::__map_.push_front(__pt);
++            __annotate_poison_from_to_back(0, __base::__block_size);
+         }
+     }
+     // Else need to allocate __nb buffers, *and* we need to reallocate __map_.
+@@ -2540,11 +2897,21 @@ deque<_Tp, _Allocator>::__add_front_capacity(size_type __n)
+         {
+ #endif // _LIBCPP_NO_EXCEPTIONS
+             for (; __nb > 0; --__nb)
++            {
+                 __buf.push_back(__alloc_traits::allocate(__a, __base::__block_size));
++                // ASan: this is empty container, we have to poison whole
++                __annotate_contiguous_container_back(_VSTD::__to_address(__buf.back()),
++                    _VSTD::__to_address(__buf.back() + __base::__block_size),
++                    _VSTD::__to_address(__buf.back() + __base::__block_size),
++                    _VSTD::__to_address(__buf.back()),
++                    _VSTD::__to_address(__buf.back())
++                );
++            }
+ #ifndef _LIBCPP_NO_EXCEPTIONS
+         }
+         catch (...)
+         {
++            __annotate_delete();
+             for (typename __base::__map_pointer __i = __buf.begin();
+                     __i != __buf.end(); ++__i)
+                 __alloc_traits::deallocate(__a, *__i, __base::__block_size);
+@@ -2596,6 +2963,7 @@ deque<_Tp, _Allocator>::__add_back_capacity()
+             __base::__map_.pop_front();
+             __base::__map_.push_back(__pt);
+         }
++        __annotate_poison_from_to_back((__base::__map_.size() - 1) * __base::__block_size, __base::__map_.size() * __base::__block_size);
+     }
+     // Else need to allocate 1 buffer, *and* we need to reallocate __map_.
+     else
+@@ -2619,6 +2987,7 @@ deque<_Tp, _Allocator>::__add_back_capacity()
+         _VSTD::swap(__base::__map_.__begin_, __buf.__begin_);
+         _VSTD::swap(__base::__map_.__end_, __buf.__end_);
+         _VSTD::swap(__base::__map_.__end_cap(), __buf.__end_cap());
++        __annotate_poison_from_to_back((__base::__map_.size() - 1) * __base::__block_size, __base::__map_.size() * __base::__block_size);
+     }
+ }
+ 
+@@ -2655,10 +3024,14 @@ deque<_Tp, _Allocator>::__add_back_capacity(size_type __n)
+             if (__base::__map_.__back_spare() == 0)
+                 break;
+             __base::__map_.push_back(__alloc_traits::allocate(__a, __base::__block_size));
++            __annotate_poison_from_to_back((__base::__map_.size() - 1) * __base::__block_size, __base::__map_.size() * __base::__block_size);
+         }
+         for (; __nb > 0; --__nb, ++__front_capacity, __base::__start_ +=
+                                  __base::__block_size - (__base::__map_.size() == 1))
++        {
+             __base::__map_.push_front(__alloc_traits::allocate(__a, __base::__block_size));
++            __annotate_poison_from_to_back(0, __base::__block_size);
++        }
+         // Done allocating, reorder capacity
+         __base::__start_ -= __base::__block_size * __front_capacity;
+         for (; __front_capacity > 0; --__front_capacity)
+@@ -2682,11 +3055,21 @@ deque<_Tp, _Allocator>::__add_back_capacity(size_type __n)
+         {
+ #endif // _LIBCPP_NO_EXCEPTIONS
+             for (; __nb > 0; --__nb)
++            {
+                 __buf.push_back(__alloc_traits::allocate(__a, __base::__block_size));
++                // ASan: this is empty container, we have to poison whole
++                __annotate_contiguous_container_back(_VSTD::__to_address(__buf.back()),
++                    _VSTD::__to_address(__buf.back() + __base::__block_size),
++                    _VSTD::__to_address(__buf.back() + __base::__block_size),
++                    _VSTD::__to_address(__buf.back()),
++                    _VSTD::__to_address(__buf.back())
++                );
++            }
+ #ifndef _LIBCPP_NO_EXCEPTIONS
+         }
+         catch (...)
+         {
++            __annotate_delete();
+             for (typename __base::__map_pointer __i = __buf.begin();
+                     __i != __buf.end(); ++__i)
+                 __alloc_traits::deallocate(__a, *__i, __base::__block_size);
+@@ -2713,12 +3096,15 @@ template <class _Tp, class _Allocator>
+ void
+ deque<_Tp, _Allocator>::pop_front()
+ {
++    size_type __old_sz = __base::size();
++    size_type __old_start = __base::__start_;
+     allocator_type& __a = __base::__alloc();
+     __alloc_traits::destroy(__a, _VSTD::__to_address(*(__base::__map_.begin() +
+                                                     __base::__start_ / __base::__block_size) +
+                                                     __base::__start_ % __base::__block_size));
+     --__base::size();
+     ++__base::__start_;
++    __annotate_shrink_front(__old_sz, __old_start);
+     __maybe_remove_front_spare();
+ }
+ 
+@@ -2727,12 +3113,15 @@ void
+ deque<_Tp, _Allocator>::pop_back()
+ {
+     _LIBCPP_ASSERT(!empty(), "deque::pop_back called on an empty deque");
++    size_type __old_sz = __base::size();
++    size_type __old_start = __base::__start_;
+     allocator_type& __a = __base::__alloc();
+     size_type __p = __base::size() + __base::__start_ - 1;
+     __alloc_traits::destroy(__a, _VSTD::__to_address(*(__base::__map_.begin() +
+                                                     __p / __base::__block_size) +
+                                                     __p % __base::__block_size));
+     --__base::size();
++    __annotate_shrink_back(__old_sz, __old_start);
+     __maybe_remove_back_spare();
+ }
+ 
+@@ -2872,6 +3261,8 @@ template <class _Tp, class _Allocator>
+ typename deque<_Tp, _Allocator>::iterator
+ deque<_Tp, _Allocator>::erase(const_iterator __f)
+ {
++    size_type __old_sz = __base::size();
++    size_type __old_start = __base::__start_;
+     iterator __b = __base::begin();
+     difference_type __pos = __f - __b;
+     iterator __p = __b + __pos;
+@@ -2882,6 +3273,7 @@ deque<_Tp, _Allocator>::erase(const_iterator __f)
+         __alloc_traits::destroy(__a, _VSTD::addressof(*__b));
+         --__base::size();
+         ++__base::__start_;
++        __annotate_shrink_front(__old_sz, __old_start);
+         __maybe_remove_front_spare();
+     }
+     else
+@@ -2889,6 +3281,7 @@ deque<_Tp, _Allocator>::erase(const_iterator __f)
+         iterator __i = _VSTD::move(_VSTD::next(__p), __base::end(), __p);
+         __alloc_traits::destroy(__a, _VSTD::addressof(*__i));
+         --__base::size();
++        __annotate_shrink_back(__old_sz, __old_start);
+         __maybe_remove_back_spare();
+     }
+     return __base::begin() + __pos;
+@@ -2898,6 +3291,8 @@ template <class _Tp, class _Allocator>
+ typename deque<_Tp, _Allocator>::iterator
+ deque<_Tp, _Allocator>::erase(const_iterator __f, const_iterator __l)
+ {
++    size_type __old_sz = __base::size();
++    size_type __old_start = __base::__start_;
+     difference_type __n = __l - __f;
+     iterator __b = __base::begin();
+     difference_type __pos = __f - __b;
+@@ -2912,6 +3307,7 @@ deque<_Tp, _Allocator>::erase(const_iterator __f, const_iterator __l)
+                 __alloc_traits::destroy(__a, _VSTD::addressof(*__b));
+             __base::size() -= __n;
+             __base::__start_ += __n;
++            __annotate_shrink_front(__old_sz, __old_start);
+             while (__maybe_remove_front_spare()) {
+             }
+         }
+@@ -2921,6 +3317,7 @@ deque<_Tp, _Allocator>::erase(const_iterator __f, const_iterator __l)
+             for (iterator __e = __base::end(); __i != __e; ++__i)
+                 __alloc_traits::destroy(__a, _VSTD::addressof(*__i));
+             __base::size() -= __n;
++            __annotate_shrink_back(__old_sz, __old_start);
+             while (__maybe_remove_back_spare()) {
+             }
+         }
+@@ -2932,6 +3329,8 @@ template <class _Tp, class _Allocator>
+ void
+ deque<_Tp, _Allocator>::__erase_to_end(const_iterator __f)
+ {
++    size_type __old_sz = __base::size();
++    size_type __old_start = __base::__start_;
+     iterator __e = __base::end();
+     difference_type __n = __e - __f;
+     if (__n > 0)
+@@ -2942,6 +3341,7 @@ deque<_Tp, _Allocator>::__erase_to_end(const_iterator __f)
+         for (iterator __p = __b + __pos; __p != __e; ++__p)
+             __alloc_traits::destroy(__a, _VSTD::addressof(*__p));
+         __base::size() -= __n;
++        __annotate_shrink_back(__old_sz, __old_start);
+         while (__maybe_remove_back_spare()) {
+         }
+     }
+@@ -2966,7 +3366,9 @@ inline
+ void
+ deque<_Tp, _Allocator>::clear() _NOEXCEPT
+ {
++    __annotate_delete();
+     __base::clear();
++    __annotate_new(0);
+ }
+ 
+ template <class _Tp, class _Allocator>
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/assign.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/assign.pass.cpp
+new file mode 100644
+index 000000000000..30d23d512535
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/assign.pass.cpp
+@@ -0,0 +1,428 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++#if TEST_STD_VER >= 11
++template <typename T>
++void test_assign_d5(const size_t N) {
++  typedef std::deque<T> D;
++  D empty_d5;
++  D short_d5a(1), short_d5b(N - 1);
++  D mid_d5(N + 1);
++  D long_d5(32 * N + 1);
++
++  empty_d5.assign({T(), T()});
++  short_d5a.assign({T(), T()});
++  short_d5b.assign({T(), T()});
++  mid_d5.assign({T(), T()});
++  long_d5.assign({T(), T()});
++
++  assert(is_de_contiguous_container_asan_correct(empty_d5));
++  assert(is_de_contiguous_container_asan_correct(short_d5a));
++  assert(is_de_contiguous_container_asan_correct(short_d5b));
++  assert(is_de_contiguous_container_asan_correct(mid_d5));
++  assert(is_de_contiguous_container_asan_correct(long_d5));
++
++  empty_d5.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++  short_d5a.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++  short_d5b.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++  mid_d5.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++  long_d5.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++
++  assert(empty_d5.size() > 16);
++  assert(short_d5a.size() > 16);
++  assert(short_d5b.size() > 16);
++  assert(mid_d5.size() > 16);
++  assert(long_d5.size() > 16);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d5));
++  assert(is_de_contiguous_container_asan_correct(short_d5a));
++  assert(is_de_contiguous_container_asan_correct(short_d5b));
++  assert(is_de_contiguous_container_asan_correct(mid_d5));
++  assert(is_de_contiguous_container_asan_correct(long_d5));
++}
++
++template <typename T>
++void test_assign_d6(const size_t N) {
++  typedef std::deque<T> D;
++  D empty_d6;
++  D short_d6a(1), short_d6b(N - 1);
++  D mid_d6(N + 1);
++  D long_d6(32 * N + 1);
++
++  empty_d6.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++  short_d6a.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++  short_d6b.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++  mid_d6.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++  long_d6.assign({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++
++  assert(empty_d6.size() > 16);
++  assert(short_d6a.size() > 16);
++  assert(short_d6b.size() > 16);
++  assert(mid_d6.size() > 16);
++  assert(long_d6.size() > 16);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d6));
++  assert(is_de_contiguous_container_asan_correct(short_d6a));
++  assert(is_de_contiguous_container_asan_correct(short_d6b));
++  assert(is_de_contiguous_container_asan_correct(mid_d6));
++  assert(is_de_contiguous_container_asan_correct(long_d6));
++}
++
++template <typename T>
++void test_assign_d7(const size_t N) {
++  typedef std::deque<T> D;
++  const T val = T();
++  D empty_d7;
++  D short_d7a(1), short_d7b(N - 1);
++  D mid_d7(N + 1);
++  D long_d7(32 * N + 1);
++
++  empty_d7.assign({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
++  short_d7a.assign({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
++  short_d7b.assign({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
++  mid_d7.assign({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
++  long_d7.assign({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
++
++  assert(empty_d7.size() > 16);
++  assert(short_d7a.size() > 16);
++  assert(short_d7b.size() > 16);
++  assert(mid_d7.size() > 16);
++  assert(long_d7.size() > 16);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d7));
++  assert(is_de_contiguous_container_asan_correct(short_d7a));
++  assert(is_de_contiguous_container_asan_correct(short_d7b));
++  assert(is_de_contiguous_container_asan_correct(mid_d7));
++  assert(is_de_contiguous_container_asan_correct(long_d7));
++}
++#endif
++
++template <typename T>
++void test_assign() {
++  typedef std::deque<T> D;
++  const size_t N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  // void assign( size_type count, const T& value );
++
++  D empty_d1;
++  D short_d1a(1), short_d1b(N - 1);
++  D mid_d1(N + 1);
++  D long_d1(32 * N + 1);
++
++  empty_d1.assign(2, T());
++  short_d1a.assign(2, T());
++  short_d1b.assign(2, T());
++  mid_d1.assign(2, T());
++  long_d1.assign(2, T());
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1));
++  assert(is_de_contiguous_container_asan_correct(long_d1));
++
++  empty_d1.assign(2 * N, T());
++  short_d1a.assign(2 * N, T());
++  short_d1b.assign(2 * N, T());
++  mid_d1.assign(2 * N, T());
++  long_d1.assign(2 * N, T());
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1));
++  assert(is_de_contiguous_container_asan_correct(long_d1));
++
++  D empty_d2;
++  D short_d2a(1), short_d2b(N - 1);
++  D mid_d2(N + 1);
++  D long_d2(32 * N + 1);
++
++  empty_d2.assign(42 * N, T());
++  short_d2a.assign(42 * N, T());
++  short_d2b.assign(42 * N, T());
++  mid_d2.assign(42 * N, T());
++  long_d2.assign(42 * N, T());
++
++  assert(is_de_contiguous_container_asan_correct(empty_d2));
++  assert(is_de_contiguous_container_asan_correct(short_d2a));
++  assert(is_de_contiguous_container_asan_correct(short_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2));
++  assert(is_de_contiguous_container_asan_correct(long_d2));
++
++  // template< class InputIt >
++  // void assign( InputIt first, InputIt last );
++  D source_d(50 * N);
++
++  D empty_d3;
++  D short_d3a(1), short_d3b(N - 1);
++  D mid_d3(N + 1);
++  D long_d3(32 * N + 1);
++
++  empty_d3.assign(source_d.begin() + N - 1, source_d.begin() + N + 1);
++  short_d3a.assign(source_d.begin() + N - 1, source_d.begin() + N + 1);
++  short_d3b.assign(source_d.begin() + N - 1, source_d.begin() + N + 1);
++  mid_d3.assign(source_d.begin() + N - 1, source_d.begin() + N + 1);
++  long_d3.assign(source_d.begin() + N - 1, source_d.begin() + N + 1);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d3));
++  assert(is_de_contiguous_container_asan_correct(short_d3a));
++  assert(is_de_contiguous_container_asan_correct(short_d3b));
++  assert(is_de_contiguous_container_asan_correct(mid_d3));
++  assert(is_de_contiguous_container_asan_correct(long_d3));
++  assert(is_de_contiguous_container_asan_correct(source_d));
++
++  empty_d3.assign(source_d.begin() + N, source_d.begin() + 3 * N);
++  short_d3a.assign(source_d.begin() + N, source_d.begin() + 3 * N);
++  short_d3b.assign(source_d.begin() + N, source_d.begin() + 3 * N);
++  mid_d3.assign(source_d.begin() + N, source_d.begin() + 3 * N);
++  long_d3.assign(source_d.begin() + N, source_d.begin() + 3 * N);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d3));
++  assert(is_de_contiguous_container_asan_correct(short_d3a));
++  assert(is_de_contiguous_container_asan_correct(short_d3b));
++  assert(is_de_contiguous_container_asan_correct(mid_d3));
++  assert(is_de_contiguous_container_asan_correct(long_d3));
++  assert(is_de_contiguous_container_asan_correct(source_d));
++
++  D empty_d4;
++  D short_d4a(1), short_d4b(N - 1);
++  D mid_d4(N + 1);
++  D long_d4(32 * N + 1);
++
++  empty_d4.assign(source_d.end() - 42 * N - 1, source_d.end() - 1);
++  short_d4a.assign(source_d.end() - 42 * N - 1, source_d.end() - 1);
++  short_d4b.assign(source_d.end() - 42 * N - 1, source_d.end() - 1);
++  mid_d4.assign(source_d.end() - 42 * N - 1, source_d.end() - 1);
++  long_d4.assign(source_d.end() - 42 * N - 1, source_d.end() - 1);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d4));
++  assert(is_de_contiguous_container_asan_correct(short_d4a));
++  assert(is_de_contiguous_container_asan_correct(short_d4b));
++  assert(is_de_contiguous_container_asan_correct(mid_d4));
++  assert(is_de_contiguous_container_asan_correct(long_d4));
++  assert(is_de_contiguous_container_asan_correct(source_d));
++
++#if TEST_STD_VER >= 11
++  // void assign( std::initializer_list<T> ilist );
++  test_assign_d5<T>(N);
++  test_assign_d6<T>(N);
++  test_assign_d7<T>(N);
++#endif
++}
++
++template <typename T>
++void test_operator() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  // deque& operator=( const deque& other );
++
++  D empty_d1, empty_d2;
++  D mid_d1(N), mid_d2(N);
++  D long_d1(32 * N), long_d2(32 * N);
++
++  empty_d1 = empty_d2;
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(empty_d2));
++  empty_d1 = mid_d1;
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(mid_d1));
++  empty_d1 = empty_d2;
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(empty_d2));
++  empty_d1 = long_d1;
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(long_d1));
++  empty_d1 = empty_d2;
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(empty_d2));
++
++  empty_d2 = long_d1;
++  assert(is_de_contiguous_container_asan_correct(empty_d2));
++
++  mid_d1 = long_d1;
++  assert(is_de_contiguous_container_asan_correct(mid_d1));
++  mid_d1 = empty_d2;
++  assert(is_de_contiguous_container_asan_correct(mid_d1));
++  mid_d1 = long_d1;
++  assert(is_de_contiguous_container_asan_correct(mid_d1));
++  mid_d1 = mid_d2;
++  assert(is_de_contiguous_container_asan_correct(mid_d1));
++
++  long_d1 = long_d2;
++  assert(is_de_contiguous_container_asan_correct(long_d1));
++  long_d1 = empty_d1;
++  assert(is_de_contiguous_container_asan_correct(long_d1));
++  long_d1 = long_d2;
++  assert(is_de_contiguous_container_asan_correct(long_d1));
++
++  empty_d1 = D();
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  mid_d1 = D();
++  assert(is_de_contiguous_container_asan_correct(mid_d1));
++  long_d1 = D();
++  assert(is_de_contiguous_container_asan_correct(long_d1));
++
++  mid_d1 = mid_d2;
++  assert(is_de_contiguous_container_asan_correct(mid_d1));
++  long_d1 = long_d2;
++  assert(is_de_contiguous_container_asan_correct(long_d1));
++
++  // deque& operator=( deque&& other )
++
++#if TEST_STD_VER >= 11
++  mid_d1 = std::move(mid_d2);
++  assert(is_de_contiguous_container_asan_correct(mid_d1));
++  assert(is_de_contiguous_container_asan_correct(mid_d2));
++  long_d1 = std::move(long_d2);
++  assert(is_de_contiguous_container_asan_correct(long_d1));
++  assert(is_de_contiguous_container_asan_correct(long_d2));
++
++  D mid_d3a(N), mid_d3b(N);
++  D long_d3a(32 * N), long_d3b(32 * N);
++
++  mid_d3a  = std::move(long_d3a);
++  long_d3b = std::move(mid_d3b);
++  assert(is_de_contiguous_container_asan_correct(mid_d3a));
++  assert(is_de_contiguous_container_asan_correct(mid_d3b));
++  assert(is_de_contiguous_container_asan_correct(long_d3a));
++  assert(is_de_contiguous_container_asan_correct(long_d3b));
++
++  D empty_d4;
++  D long_d4a(32 * N), long_d4b(32 * N);
++
++  long_d4a = std::move(empty_d4);
++  long_d4b = std::move(empty_d1);
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(empty_d4));
++  assert(is_de_contiguous_container_asan_correct(long_d4a));
++  assert(is_de_contiguous_container_asan_correct(long_d4b));
++#endif
++
++  // void assign( std::initializer_list<T> ilist )
++
++  D empty_d5;
++  D short_d5a(1), short_d5b(N - 1);
++  D mid_d5(N + 1);
++  D long_d5(32 * N + 1);
++
++  empty_d5  = {T(), T()};
++  short_d5a = {T(), T()};
++  short_d5b = {T(), T()};
++  mid_d5    = {T(), T()};
++  long_d5   = {T(), T()};
++
++  assert(is_de_contiguous_container_asan_correct(empty_d5));
++  assert(is_de_contiguous_container_asan_correct(short_d5a));
++  assert(is_de_contiguous_container_asan_correct(short_d5b));
++  assert(is_de_contiguous_container_asan_correct(mid_d5));
++  assert(is_de_contiguous_container_asan_correct(long_d5));
++
++  empty_d5  = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
++  short_d5a = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
++  short_d5b = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
++  mid_d5    = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
++  long_d5   = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
++
++  assert(empty_d5.size() > 16);
++  assert(short_d5a.size() > 16);
++  assert(short_d5b.size() > 16);
++  assert(mid_d5.size() > 16);
++  assert(long_d5.size() > 16);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d5));
++  assert(is_de_contiguous_container_asan_correct(short_d5a));
++  assert(is_de_contiguous_container_asan_correct(short_d5b));
++  assert(is_de_contiguous_container_asan_correct(mid_d5));
++  assert(is_de_contiguous_container_asan_correct(long_d5));
++
++  D empty_d6;
++  D short_d6a(1), short_d6b(N - 1);
++  D mid_d6(N + 1);
++  D long_d6(32 * N + 1);
++
++  empty_d6  = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
++  short_d6a = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
++  short_d6b = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
++  mid_d6    = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
++  long_d6   = {T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()};
++
++  assert(empty_d6.size() > 16);
++  assert(short_d6a.size() > 16);
++  assert(short_d6b.size() > 16);
++  assert(mid_d6.size() > 16);
++  assert(long_d6.size() > 16);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d6));
++  assert(is_de_contiguous_container_asan_correct(short_d6a));
++  assert(is_de_contiguous_container_asan_correct(short_d6b));
++  assert(is_de_contiguous_container_asan_correct(mid_d6));
++  assert(is_de_contiguous_container_asan_correct(long_d6));
++}
++
++template <typename T>
++void test() {
++  test_assign<T>();
++  test_operator<T>();
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        test<T>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/clear.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/clear.pass.cpp
+new file mode 100644
+index 000000000000..b7a4a87ddfb2
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/clear.pass.cpp
+@@ -0,0 +1,96 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++template <typename T>
++void test() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  // void clear()
++
++  D empty_d1;
++  D short_d1a(1), short_d1b(2);
++  D mid_d1a(N - 1), mid_d1b(N), mid_d1c(N + 1);
++  D long_d1a(17 * N - 1), long_d1b(8 * N), long_d1c(11 * N + 1);
++
++  empty_d1.clear();
++  short_d1a.clear();
++  short_d1b.clear();
++  mid_d1a.clear();
++  mid_d1b.clear();
++  mid_d1c.clear();
++  long_d1a.clear();
++  long_d1b.clear();
++  long_d1c.clear();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        typedef std::deque<T> D;
++        test<D>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/constructor.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/constructor.pass.cpp
+new file mode 100644
+index 000000000000..acf560dc96bd
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/constructor.pass.cpp
+@@ -0,0 +1,313 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++template <typename T>
++void test() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  // Different constructors are called based on the used standard.
++  // Please, check https://en.cppreference.com/w/cpp/container/deque/deque
++  // for full list.
++
++  D empty_d1;
++  D short_d1a(1), short_d1b(2);
++  D mid_d1a(N - 1), mid_d1b(N), mid_d1c(N + 1);
++  D long_d1a(17 * N - 1), long_d1b(8 * N), long_d1c(11 * N + 1);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  D empty_d2(empty_d1);
++  D short_d2a(short_d1a), short_d2b(short_d1b);
++  D mid_d2a(mid_d1a), mid_d2b(mid_d1b), mid_d2c(mid_d1c);
++  D long_d2a(long_d1a), long_d2b(long_d1b), long_d2c(long_d1c);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d2));
++  assert(is_de_contiguous_container_asan_correct(short_d2a));
++  assert(is_de_contiguous_container_asan_correct(short_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2a));
++  assert(is_de_contiguous_container_asan_correct(mid_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2c));
++  assert(is_de_contiguous_container_asan_correct(long_d2a));
++  assert(is_de_contiguous_container_asan_correct(long_d2b));
++  assert(is_de_contiguous_container_asan_correct(long_d2c));
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  D empty_d3(std::move(empty_d2));
++  D short_d3a(std::move(short_d2a)), short_d3b(std::move(short_d2b));
++  D mid_d3a(std::move(mid_d2a)), mid_d3b(std::move(mid_d2b)), mid_d3c(std::move(mid_d2c));
++  D long_d3a(std::move(long_d2a)), long_d3b(std::move(long_d2b)), long_d3c(std::move(long_d2c));
++
++  assert(is_de_contiguous_container_asan_correct(empty_d3));
++  assert(is_de_contiguous_container_asan_correct(short_d3a));
++  assert(is_de_contiguous_container_asan_correct(short_d3b));
++  assert(is_de_contiguous_container_asan_correct(mid_d3a));
++  assert(is_de_contiguous_container_asan_correct(mid_d3b));
++  assert(is_de_contiguous_container_asan_correct(mid_d3c));
++  assert(is_de_contiguous_container_asan_correct(long_d3a));
++  assert(is_de_contiguous_container_asan_correct(long_d3b));
++  assert(is_de_contiguous_container_asan_correct(long_d3c));
++
++  assert(is_de_contiguous_container_asan_correct(empty_d2));
++  assert(is_de_contiguous_container_asan_correct(short_d2a));
++  assert(is_de_contiguous_container_asan_correct(short_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2a));
++  assert(is_de_contiguous_container_asan_correct(mid_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2c));
++  assert(is_de_contiguous_container_asan_correct(long_d2a));
++  assert(is_de_contiguous_container_asan_correct(long_d2b));
++  assert(is_de_contiguous_container_asan_correct(long_d2c));
++
++#if TEST_STD_VER >= 11
++  D empty_d4(empty_d1.cbegin(), empty_d1.cend());
++  D short_d4a(short_d1a.cbegin(), short_d1a.cend()), short_d4b(short_d1b.cbegin(), short_d1b.cend());
++  D mid_d4a(mid_d1a.cbegin(), mid_d1a.cend()), mid_d4b(mid_d1b.cbegin(), mid_d1b.cend()),
++      mid_d4c(mid_d1c.cbegin(), mid_d1c.cend());
++  D long_d4a(long_d1a.cbegin(), long_d1a.cend()), long_d4b(long_d1a.cbegin(), long_d1a.cend()),
++      long_d4c(long_d1a.cbegin(), long_d1a.cend());
++#else
++  D empty_d4(empty_d1.begin(), empty_d1.end());
++  D short_d4a(short_d1a.begin(), short_d1a.end()), short_d4b(short_d1b.begin(), short_d1b.end());
++  D mid_d4a(mid_d1a.begin(), mid_d1a.end()), mid_d4b(mid_d1b.begin(), mid_d1b.end()),
++      mid_d4c(mid_d1c.begin(), mid_d1c.end());
++  D long_d4a(long_d1a.begin(), long_d1a.end()), long_d4b(long_d1a.begin(), long_d1a.end()),
++      long_d4c(long_d1a.begin(), long_d1a.end());
++#endif
++
++  assert(is_de_contiguous_container_asan_correct(empty_d4));
++  assert(is_de_contiguous_container_asan_correct(short_d4a));
++  assert(is_de_contiguous_container_asan_correct(short_d4b));
++  assert(is_de_contiguous_container_asan_correct(mid_d4a));
++  assert(is_de_contiguous_container_asan_correct(mid_d4b));
++  assert(is_de_contiguous_container_asan_correct(mid_d4c));
++  assert(is_de_contiguous_container_asan_correct(long_d4a));
++  assert(is_de_contiguous_container_asan_correct(long_d4b));
++  assert(is_de_contiguous_container_asan_correct(long_d4c));
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++#if TEST_STD_VER >= 11
++  D empty_d5(empty_d1.crbegin(), empty_d1.crend());
++  D short_d5a(short_d1a.crbegin(), short_d1a.crend()), short_d5b(short_d1b.crbegin(), short_d1b.crend());
++  D mid_d5a(mid_d1a.crbegin(), mid_d1a.crend()), mid_d5b(mid_d1b.crbegin(), mid_d1b.crend()),
++      mid_d5c(mid_d1c.crbegin(), mid_d1c.crend());
++  D long_d5a(long_d1a.crbegin(), long_d1a.crend()), long_d5b(long_d1a.crbegin(), long_d1a.crend()),
++      long_d5c(long_d1a.crbegin(), long_d1a.crend());
++#else
++  D empty_d5(empty_d1.rbegin(), empty_d1.rend());
++  D short_d5a(short_d1a.rbegin(), short_d1a.rend()), short_d5b(short_d1b.rbegin(), short_d1b.rend());
++  D mid_d5a(mid_d1a.rbegin(), mid_d1a.rend()), mid_d5b(mid_d1b.rbegin(), mid_d1b.rend()),
++      mid_d5c(mid_d1c.rbegin(), mid_d1c.rend());
++  D long_d5a(long_d1a.rbegin(), long_d1a.rend()), long_d5b(long_d1a.rbegin(), long_d1a.rend()),
++      long_d5c(long_d1a.rbegin(), long_d1a.rend());
++#endif
++
++  assert(is_de_contiguous_container_asan_correct(empty_d5));
++  assert(is_de_contiguous_container_asan_correct(short_d5a));
++  assert(is_de_contiguous_container_asan_correct(short_d5b));
++  assert(is_de_contiguous_container_asan_correct(mid_d5a));
++  assert(is_de_contiguous_container_asan_correct(mid_d5b));
++  assert(is_de_contiguous_container_asan_correct(mid_d5c));
++  assert(is_de_contiguous_container_asan_correct(long_d5a));
++  assert(is_de_contiguous_container_asan_correct(long_d5b));
++  assert(is_de_contiguous_container_asan_correct(long_d5c));
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  D empty_d6(0, T());
++  D short_d6a(1, T()), short_d6b(2, T());
++  D mid_d6a(N - 1, T()), mid_d6b(N, T()), mid_d6c(N + 1, T());
++  D long_d6a(17 * N - 1, T()), long_d6b(8 * N, T()), long_d6c(11 * N + 1, T());
++
++  assert(is_de_contiguous_container_asan_correct(empty_d6));
++  assert(is_de_contiguous_container_asan_correct(short_d6a));
++  assert(is_de_contiguous_container_asan_correct(short_d6b));
++  assert(is_de_contiguous_container_asan_correct(mid_d6a));
++  assert(is_de_contiguous_container_asan_correct(mid_d6b));
++  assert(is_de_contiguous_container_asan_correct(mid_d6c));
++  assert(is_de_contiguous_container_asan_correct(long_d6a));
++  assert(is_de_contiguous_container_asan_correct(long_d6b));
++  assert(is_de_contiguous_container_asan_correct(long_d6c));
++
++#if TEST_STD_VER >= 11
++  D empty_d7({});
++  D short_d7a({T()}), short_d7b({T(), T()});
++  D mid_d7a({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++  D mid_d7b({T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T(), T()});
++
++  assert(is_de_contiguous_container_asan_correct(empty_d7));
++  assert(is_de_contiguous_container_asan_correct(short_d7a));
++  assert(is_de_contiguous_container_asan_correct(short_d7b));
++  assert(mid_d7a.size() == 16);
++  assert(is_de_contiguous_container_asan_correct(mid_d7a));
++  assert(mid_d7b.size() == 17);
++  assert(is_de_contiguous_container_asan_correct(mid_d7b));
++
++  const T val = T();
++  D empty_d8({});
++  D short_d8a({val}), short_d8b({val, val});
++  D mid_d8a({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
++  D mid_d8b({val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val, val});
++
++  assert(is_de_contiguous_container_asan_correct(empty_d8));
++  assert(is_de_contiguous_container_asan_correct(short_d8a));
++  assert(is_de_contiguous_container_asan_correct(short_d8b));
++  assert(mid_d8a.size() == 16);
++  assert(is_de_contiguous_container_asan_correct(mid_d8a));
++  assert(mid_d8b.size() == 17);
++  assert(is_de_contiguous_container_asan_correct(mid_d8b));
++#endif
++
++  D empty_d9a((std::allocator<T>())), empty_d9b(empty_d8.get_allocator());
++  assert(is_de_contiguous_container_asan_correct(empty_d9a));
++  assert(is_de_contiguous_container_asan_correct(empty_d9b));
++
++#if TEST_STD_VER >= 11
++  D empty_d10(empty_d3, std::allocator<T>());
++  D short_d10a(short_d3a, std::allocator<T>()), short_d10b(short_d3b, std::allocator<T>());
++  D mid_d10a(mid_d3a, std::allocator<T>()), mid_d10b(mid_d3b, std::allocator<T>()),
++      mid_d10c(mid_d3c, std::allocator<T>());
++  D long_d10a(long_d3a, std::allocator<T>()), long_d10b(long_d3b, std::allocator<T>()),
++      long_d10c(long_d3c, std::allocator<T>());
++
++  assert(is_de_contiguous_container_asan_correct(empty_d10));
++  assert(is_de_contiguous_container_asan_correct(short_d10a));
++  assert(is_de_contiguous_container_asan_correct(short_d10b));
++  assert(is_de_contiguous_container_asan_correct(mid_d10a));
++  assert(is_de_contiguous_container_asan_correct(mid_d10b));
++  assert(is_de_contiguous_container_asan_correct(mid_d10c));
++  assert(is_de_contiguous_container_asan_correct(long_d10a));
++  assert(is_de_contiguous_container_asan_correct(long_d10b));
++  assert(is_de_contiguous_container_asan_correct(long_d10c));
++
++  assert(is_de_contiguous_container_asan_correct(empty_d3));
++  assert(is_de_contiguous_container_asan_correct(short_d3a));
++  assert(is_de_contiguous_container_asan_correct(short_d3b));
++  assert(is_de_contiguous_container_asan_correct(mid_d3a));
++  assert(is_de_contiguous_container_asan_correct(mid_d3b));
++  assert(is_de_contiguous_container_asan_correct(mid_d3c));
++  assert(is_de_contiguous_container_asan_correct(long_d3a));
++  assert(is_de_contiguous_container_asan_correct(long_d3b));
++  assert(is_de_contiguous_container_asan_correct(long_d3c));
++
++  D empty_d11(std::move(empty_d10), std::allocator<T>());
++  D short_d11a(std::move(short_d10a), std::allocator<T>()), short_d11b(std::move(short_d10b), std::allocator<T>());
++  D mid_d11a(std::move(mid_d10a), std::allocator<T>()), mid_d11b(std::move(mid_d10b), std::allocator<T>()),
++      mid_d11c(std::move(mid_d10c), std::allocator<T>());
++  D long_d11a(std::move(long_d10a), std::allocator<T>()), long_d11b(std::move(long_d10b), std::allocator<T>()),
++      long_d11c(std::move(long_d10c), std::allocator<T>());
++
++  assert(is_de_contiguous_container_asan_correct(empty_d11));
++  assert(is_de_contiguous_container_asan_correct(short_d11a));
++  assert(is_de_contiguous_container_asan_correct(short_d11b));
++  assert(is_de_contiguous_container_asan_correct(mid_d11a));
++  assert(is_de_contiguous_container_asan_correct(mid_d11b));
++  assert(is_de_contiguous_container_asan_correct(mid_d11c));
++  assert(is_de_contiguous_container_asan_correct(long_d11a));
++  assert(is_de_contiguous_container_asan_correct(long_d11b));
++  assert(is_de_contiguous_container_asan_correct(long_d11c));
++
++  assert(is_de_contiguous_container_asan_correct(empty_d10));
++  assert(is_de_contiguous_container_asan_correct(short_d10a));
++  assert(is_de_contiguous_container_asan_correct(short_d10b));
++  assert(is_de_contiguous_container_asan_correct(mid_d10a));
++  assert(is_de_contiguous_container_asan_correct(mid_d10b));
++  assert(is_de_contiguous_container_asan_correct(mid_d10c));
++  assert(is_de_contiguous_container_asan_correct(long_d10a));
++  assert(is_de_contiguous_container_asan_correct(long_d10b));
++  assert(is_de_contiguous_container_asan_correct(long_d10c));
++#endif
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        test<T>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/emplace_constructible.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/emplace_constructible.pass.cpp
+new file mode 100644
+index 000000000000..4fcaea0194da
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/emplace_constructible.pass.cpp
+@@ -0,0 +1,86 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++// The test helped us find issues with llvm12 implementation,
++// but it's a problematic one now.
++// We may want to delete it.
++
++// UNSUPPORTED: c++03
++
++#include <cassert>
++#include <array>
++#include "emplace_constructible.h"
++#include "asan_testing.h" // includes deque - don't do it before
++#include "test_iterators.h"
++
++template <typename T>
++void test_constructible() {
++  T arr1[] = {T()};
++  using T2 = EmplaceConstructibleMoveableAndAssignable<T>;
++  using It = cpp17_input_iterator<T*>;
++  typedef std::deque<T2> D;
++
++  D d;
++  d.assign(It(arr1), It(std::end(arr1)));
++  assert(is_de_contiguous_container_asan_correct(d));
++}
++
++template <typename T>
++void test() {
++  test_constructible<T>();
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        test<T>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/erase.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/erase.pass.cpp
+new file mode 100644
+index 000000000000..56b2d19f19b3
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/erase.pass.cpp
+@@ -0,0 +1,137 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++template <typename T>
++void test() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  // iterator erase( iterator first, iterator last );
++  // iterator erase( const_iterator first, const_iterator last );
++
++  D d1a(N), d1b(N), d1c(N);
++#if TEST_STD_VER >= 11
++  d1a.erase(d1a.cbegin(), d1a.cend());
++  d1b.erase(d1b.cbegin() + 1);
++  d1c.erase(d1c.cend() - 1);
++#else
++  d1a.erase(d1a.begin(), d1a.end());
++  d1b.erase(d1b.begin() + 1);
++  d1c.erase(d1c.end() - 1);
++#endif
++
++  assert(is_de_contiguous_container_asan_correct(d1a));
++  assert(is_de_contiguous_container_asan_correct(d1b));
++  assert(is_de_contiguous_container_asan_correct(d1c));
++
++  D d2a(N + 1), d2b(N + 1), d2c(N + 1), d2d(N + 1);
++
++  d2a.erase(d2a.begin(), d2a.end() - 2);
++  d2b.erase(d2b.begin() + 1, d2b.end());
++  // iterator erase( iterator pos );
++  // iterator erase( const_iterator pos );
++  d2c.erase(d2c.begin() + 2);
++  d2d.erase(d2d.end() - 3);
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  d2c.erase(d2c.begin() + 2);
++  d2d.erase(d2d.end() - 3);
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  d2c.erase(d2c.begin() + 2);
++  d2d.erase(d2d.end() - 3);
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  D d3a(32 * N + 1), d3b(32 * N + 1), d3c(32 * N + 1), d3d(32 * N + 1);
++
++  d3a.erase(d3a.begin() + N + 1, d3a.end() - N - 2);
++  d3b.erase(d3b.begin() + N - 1, d3b.end());
++
++  assert(is_de_contiguous_container_asan_correct(d3a));
++  assert(is_de_contiguous_container_asan_correct(d3b));
++  while (d3c.size() > 3) {
++    d3c.erase(d3c.begin() + 2);
++    assert(is_de_contiguous_container_asan_correct(d3c));
++  }
++  while (d3d.size() > 4) {
++    d3d.erase(d3d.end() - 3);
++    assert(is_de_contiguous_container_asan_correct(d3d));
++  }
++
++  D d4a(32 * N + 3), d4b(32 * N + 3);
++  while (d4a.size() > 5) {
++    d4a.erase(d4a.begin() + 2, d4a.begin() + 4);
++    assert(is_de_contiguous_container_asan_correct(d4a));
++  }
++
++  while (d4b.size() > 5) {
++    d4b.erase(d4b.end() - 4, d4b.end() - 2);
++    assert(is_de_contiguous_container_asan_correct(d4b));
++  }
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        test<T>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/insert.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/insert.pass.cpp
+new file mode 100644
+index 000000000000..d3c5667271c2
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/insert.pass.cpp
+@@ -0,0 +1,278 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++template <typename T>
++void test_insert() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  T t = T();
++  D d1a(2), d1b(2), d1c(2);
++
++#if TEST_STD_VER >= 11
++  d1a.insert(d1a.cbegin(), t);
++  d1b.insert(d1b.cend(), t);
++  d1c.insert(d1c.cbegin() + 1, t);
++#else
++  d1a.insert(d1a.begin(), t);
++  d1b.insert(d1b.end(), t);
++  d1c.insert(d1c.begin() + 1, t);
++#endif
++
++  assert(is_de_contiguous_container_asan_correct(d1a));
++  assert(is_de_contiguous_container_asan_correct(d1b));
++  assert(is_de_contiguous_container_asan_correct(d1c));
++
++  D d2a(3 * N), d2b(3 * N), d2c(3 * N), d2d(3 * N);
++
++  d2a.insert(d2a.begin(), t);
++  d2b.insert(d2b.end(), t);
++  d2c.insert(d2c.begin() + 1, t);
++  d2d.insert(d2d.end() - 1, t);
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  d2a.insert(d2a.begin(), 2 * N + 1, t);
++  d2b.insert(d2b.end(), 2 * N + 1, t);
++  d2c.insert(d2c.begin() + 1, 2 * N + 1, t);
++  d2d.insert(d2d.end() - 1, 2 * N + 1, t);
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  d2c.insert(d2c.begin() + N + 1, 2 * N + 1, t);
++  d2d.insert(d2d.end() - N - 1, 2 * N + 1, t);
++
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  D source(3 * N);
++
++  d2a.insert(d2a.begin(), source.begin() + 1, source.end() - 1);
++  d2b.insert(d2b.end(), source.begin() + 1, source.end() - 1);
++  d2c.insert(d2c.begin() + 1, source.begin() + 1, source.end() - 1);
++  d2d.insert(d2d.end() - 1, source.begin() + 1, source.end() - 1);
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  d2c.insert(d2c.begin() + N + 1, source.begin() + 1, source.end() - 1);
++  d2d.insert(d2d.end() - N - 1, source.begin() + 1, source.end() - 1);
++
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  d2a.insert(d2a.begin(), T());
++  d2b.insert(d2b.end(), T());
++  d2c.insert(d2c.begin() + 1, T());
++  d2d.insert(d2d.end() - 1, T());
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  T a = T(), b = T(), c = T(), d = T();
++  d2a.insert(d2a.begin(), a);
++  d2b.insert(d2b.end(), b);
++  d2c.insert(d2c.begin() + 1, c);
++  d2d.insert(d2d.end() - 1, d);
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  d2a.insert(d2a.begin(), 3, a);
++  d2b.insert(d2b.end(), 3, b);
++  d2c.insert(d2c.begin() + 1, 3, c);
++  d2d.insert(d2d.end() - 1, 3, d);
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  d2a.insert(d2a.begin(), 3 * N, a);
++  d2b.insert(d2b.end(), 3 * N, b);
++  d2c.insert(d2c.begin() + 1, 3 * N, c);
++  d2d.insert(d2d.end() - 1, 3 * N, d);
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  d2a.insert(d2a.begin(), std::move(a));
++  d2b.insert(d2b.end(), std::move(b));
++  d2c.insert(d2c.begin() + 1, std::move(c));
++  d2d.insert(d2d.end() - 1, std::move(d));
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++#if TEST_STD_VER >= 11
++  D d3a(2), d3b(2), d3c(2);
++
++  d3a.insert(d3a.cbegin(), {t});
++  d3b.insert(d3b.cend(), {t});
++  d3c.insert(d3c.cbegin() + 1, {t});
++
++  assert(is_de_contiguous_container_asan_correct(d3a));
++  assert(is_de_contiguous_container_asan_correct(d3b));
++  assert(is_de_contiguous_container_asan_correct(d3c));
++
++  d3a.insert(d3a.cbegin(), {t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
++  d3b.insert(d3b.cend(), {t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
++  d3c.insert(d3c.cbegin() + 1, {t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
++
++  assert(d3a.size() > 16);
++  assert(d3b.size() > 16);
++  assert(d3c.size() > 16);
++
++  assert(is_de_contiguous_container_asan_correct(d3a));
++  assert(is_de_contiguous_container_asan_correct(d3b));
++  assert(is_de_contiguous_container_asan_correct(d3c));
++
++  d3a.insert(d3a.cbegin() + 1, {t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
++  d3b.insert(d3b.cend() - 1, {t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
++  d3c.resize(N - 1);
++  d3c.insert(d3c.cbegin() + N - 2, {t, t, t, t, t, t, t, T(), t, t, t, t, T(), t, t, t, t, t, t});
++
++  assert(is_de_contiguous_container_asan_correct(d3a));
++  assert(is_de_contiguous_container_asan_correct(d3b));
++  assert(is_de_contiguous_container_asan_correct(d3c));
++#endif
++}
++
++#if TEST_STD_VER >= 11
++template <typename T>
++void test_emplace() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  T t = T();
++  D d1a(2), d1b(2), d1c(2);
++
++  d1a.emplace(d1a.cbegin(), t);
++  d1b.emplace(d1b.cend(), t);
++  d1c.emplace(d1c.cbegin() + 1, t);
++
++  assert(is_de_contiguous_container_asan_correct(d1a));
++  assert(is_de_contiguous_container_asan_correct(d1b));
++  assert(is_de_contiguous_container_asan_correct(d1c));
++
++  D d2a(3 * N), d2b(3 * N), d2c(3 * N), d2d(3 * N);
++
++  d2a.emplace(d2a.cbegin(), t);
++  d2b.emplace(d2b.cend(), t);
++  d2c.emplace(d2c.cbegin() + 1, t);
++  d2d.emplace(d2d.cend() - 1, t);
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  d2a.emplace(d2a.cbegin(), T());
++  d2b.emplace(d2b.cend(), T());
++  d2c.emplace(d2c.cbegin() + 1, T());
++  d2d.emplace(d2d.cend() - 1, T());
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++
++  T a = T(), b = T(), c = T(), d = T();
++  d2a.emplace(d2a.cbegin(), std::move(a));
++  d2b.emplace(d2b.cend(), std::move(b));
++  d2c.emplace(d2c.cbegin() + 1, std::move(c));
++  d2d.emplace(d2d.cend() - 1, std::move(d));
++
++  assert(is_de_contiguous_container_asan_correct(d2a));
++  assert(is_de_contiguous_container_asan_correct(d2b));
++  assert(is_de_contiguous_container_asan_correct(d2c));
++  assert(is_de_contiguous_container_asan_correct(d2d));
++}
++#endif
++
++template <typename T>
++void test() {
++  test_insert<T>();
++#if TEST_STD_VER >= 11
++  test_emplace<T>();
++#endif
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        test<T>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/pop_back.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/pop_back.pass.cpp
+new file mode 100644
+index 000000000000..7257750bee33
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/pop_back.pass.cpp
+@@ -0,0 +1,107 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++template <typename T>
++void test_aligned() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  // void pop_back()
++
++  D single_d(1);
++  single_d.pop_back();
++  assert(is_de_contiguous_container_asan_correct(single_d));
++
++  D d1(34 * N);
++  while (!d1.empty()) {
++    d1.pop_back();
++    assert(is_de_contiguous_container_asan_correct(d1));
++  }
++}
++
++template <typename T>
++void test_not_aligned() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  // void pop_back()
++
++  D single_d(1);
++  single_d.pop_back();
++  assert(is_de_contiguous_container_asan_correct(single_d));
++
++  D d1(34 * N);
++  d1.pop_front();
++
++  while (!d1.empty()) {
++    d1.pop_back();
++    assert(is_de_contiguous_container_asan_correct(d1));
++  }
++}
++
++template <typename T>
++void test() {
++  test_aligned<T>();
++  test_not_aligned<T>();
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        typedef std::deque<T> D;
++        test<D>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/pop_front.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/pop_front.pass.cpp
+new file mode 100644
+index 000000000000..a87e90b48a5f
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/pop_front.pass.cpp
+@@ -0,0 +1,87 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++template <typename T>
++void test() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  // void pop_front()
++
++  D single_d(1);
++  single_d.pop_front();
++  assert(is_de_contiguous_container_asan_correct(single_d));
++
++  D d1(34 * N);
++  while (!d1.empty()) {
++    d1.pop_front();
++    assert(is_de_contiguous_container_asan_correct(d1));
++  }
++
++  D d2(34 * N + 1);
++  while (!d2.empty()) {
++    d2.pop_front();
++    assert(is_de_contiguous_container_asan_correct(d2));
++  }
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        typedef std::deque<T> D;
++        test<D>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/push_back.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/push_back.pass.cpp
+new file mode 100644
+index 000000000000..bda9a4fbcd1b
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/push_back.pass.cpp
+@@ -0,0 +1,144 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++template <typename T>
++void test_push() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  D d1;
++
++  // void push_back( const T& value );
++
++  for (size_t i = 0; i < 32 * N; ++i) {
++    T b = T();
++    d1.push_back(b);
++    assert(is_de_contiguous_container_asan_correct(d1));
++  }
++
++  d1.clear();
++
++  for (size_t i = 0; i < 34 * N; ++i) {
++    T b = T();
++    d1.push_back(b);
++    assert(is_de_contiguous_container_asan_correct(d1));
++  }
++
++#if TEST_STD_VER >= 11
++  // void push_back( T&& value );
++
++  D d2;
++
++  for (size_t i = 0; i < 34 * N; ++i) {
++    T b = T();
++    d2.push_back(std::move(b));
++    assert(is_de_contiguous_container_asan_correct(d2));
++    d2.push_back(T());
++    assert(is_de_contiguous_container_asan_correct(d2));
++  }
++#endif
++}
++
++#if TEST_STD_VER >= 11
++template <typename T>
++void test_emplace() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  // template< class... Args >
++  // reference emplace_back( Args&&... args );
++  D d1;
++
++  for (size_t i = 0; i < 32 * N; ++i) {
++    T b = T();
++    d1.emplace_back(b);
++    assert(is_de_contiguous_container_asan_correct(d1));
++  }
++
++  d1.clear();
++
++  for (size_t i = 0; i < 34 * N; ++i) {
++    T b = T();
++    d1.emplace_back(b);
++    assert(is_de_contiguous_container_asan_correct(d1));
++  }
++
++  D d2;
++
++  for (size_t i = 0; i < 32 * N; ++i) {
++    T b = T();
++    d2.emplace_back(std::move(b));
++    assert(is_de_contiguous_container_asan_correct(d2));
++    d2.emplace_back(T());
++    assert(is_de_contiguous_container_asan_correct(d2));
++  }
++}
++#endif
++
++template <typename T>
++void test() {
++  test_push<T>();
++#if TEST_STD_VER >= 11
++  test_emplace<T>();
++#endif
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        test<T>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/push_front.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/push_front.pass.cpp
+new file mode 100644
+index 000000000000..22bab2fa4cb7
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/push_front.pass.cpp
+@@ -0,0 +1,145 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++template <typename T>
++void test_push() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  // void push_front( const T& value );
++
++  D d1;
++
++  for (size_t i = 0; i < 32 * N; ++i) {
++    T f = T();
++    d1.push_front(f);
++    assert(is_de_contiguous_container_asan_correct(d1));
++  }
++
++  d1.clear();
++
++  for (size_t i = 0; i < 34 * N; ++i) {
++    T f = T();
++    d1.push_front(f);
++    assert(is_de_contiguous_container_asan_correct(d1));
++  }
++
++#if TEST_STD_VER >= 11
++  // void push_front( T&& value );
++
++  D d2;
++
++  for (size_t i = 0; i < 32 * N; ++i) {
++    T f = T();
++    d2.push_front(std::move(f));
++    assert(is_de_contiguous_container_asan_correct(d2));
++    d2.push_front(T());
++    assert(is_de_contiguous_container_asan_correct(d2));
++  }
++#endif
++}
++
++#if TEST_STD_VER >= 11
++template <typename T>
++void test_emplace() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  // template< class... Args >
++  // reference emplace_front( Args&&... args );
++
++  D d1;
++
++  for (size_t i = 0; i < 32 * N; ++i) {
++    T f = T();
++    d1.emplace_front(f);
++    assert(is_de_contiguous_container_asan_correct(d1));
++  }
++
++  d1.clear();
++
++  for (size_t i = 0; i < 34 * N; ++i) {
++    T f = T();
++    d1.emplace_front(f);
++    assert(is_de_contiguous_container_asan_correct(d1));
++  }
++
++  D d2;
++
++  for (size_t i = 0; i < 32 * N; ++i) {
++    T f = T();
++    d2.emplace_front(std::move(f));
++    assert(is_de_contiguous_container_asan_correct(d2));
++    d2.emplace_front(T());
++    assert(is_de_contiguous_container_asan_correct(d2));
++  }
++}
++#endif
++
++template <typename T>
++void test() {
++  test_push<T>();
++#if TEST_STD_VER >= 11
++  test_emplace<T>();
++#endif
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        test<T>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/resize.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/resize.pass.cpp
+new file mode 100644
+index 000000000000..9e3c8d6f3fa5
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/resize.pass.cpp
+@@ -0,0 +1,501 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++template <typename T>
++void test_count() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  D empty_d1;
++  D short_d1a(1), short_d1b(2);
++  D mid_d1a(N - 1), mid_d1b(N), mid_d1c(N + 1);
++  D long_d1a(17 * N - 1), long_d1b(8 * N), long_d1c(11 * N + 1);
++
++  empty_d1.resize(0);
++  short_d1a.resize(1);
++  short_d1b.resize(2);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(17 * N - 1);
++  long_d1b.resize(8 * N);
++  long_d1c.resize(11 * N + 1);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(1);
++  short_d1a.resize(1);
++  short_d1b.resize(1);
++  mid_d1a.resize(1);
++  mid_d1b.resize(1);
++  mid_d1c.resize(1);
++  long_d1a.resize(1);
++  long_d1b.resize(1);
++  long_d1c.resize(1);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(2);
++  short_d1a.resize(2);
++  short_d1b.resize(2);
++  mid_d1a.resize(2);
++  mid_d1b.resize(2);
++  mid_d1c.resize(2);
++  long_d1a.resize(2);
++  long_d1b.resize(2);
++  long_d1c.resize(2);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(N - 1);
++  short_d1a.resize(N - 1);
++  short_d1b.resize(N - 1);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N - 1);
++  mid_d1c.resize(N - 1);
++  long_d1a.resize(N - 1);
++  long_d1b.resize(N - 1);
++  long_d1c.resize(N - 1);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(N);
++  short_d1a.resize(N);
++  short_d1b.resize(N);
++  mid_d1a.resize(N);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N);
++  long_d1a.resize(N);
++  long_d1b.resize(N);
++  long_d1c.resize(N);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(N + 1);
++  short_d1a.resize(N + 1);
++  short_d1b.resize(N + 1);
++  mid_d1a.resize(N + 1);
++  mid_d1b.resize(N + 1);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(N + 1);
++  long_d1b.resize(N + 1);
++  long_d1c.resize(N + 1);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(N);
++  short_d1a.resize(N);
++  short_d1b.resize(N);
++  mid_d1a.resize(N);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N);
++  long_d1a.resize(N);
++  long_d1b.resize(N);
++  long_d1c.resize(N);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(20 * N);
++  short_d1a.resize(20 * N);
++  short_d1b.resize(20 * N);
++  mid_d1a.resize(20 * N);
++  mid_d1b.resize(20 * N);
++  mid_d1c.resize(20 * N);
++  long_d1a.resize(20 * N);
++  long_d1b.resize(20 * N);
++  long_d1c.resize(20 * N);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(0);
++  short_d1a.resize(1);
++  short_d1b.resize(2);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(17 * N - 1);
++  long_d1b.resize(8 * N);
++  long_d1c.resize(11 * N + 1);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  D empty_d2;
++  D short_d2a(1), short_d2b(2);
++  D mid_d2a(N - 1), mid_d2b(N), mid_d2c(N + 1);
++  D long_d2a(17 * N - 1), long_d2b(8 * N), long_d2c(11 * N + 1);
++
++  empty_d2.resize(20 * N);
++  short_d2a.resize(20 * N);
++  short_d2b.resize(20 * N);
++  mid_d2a.resize(20 * N);
++  mid_d2b.resize(20 * N);
++  mid_d2c.resize(20 * N);
++  long_d2a.resize(20 * N);
++  long_d2b.resize(20 * N);
++  long_d2c.resize(20 * N);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d2));
++  assert(is_de_contiguous_container_asan_correct(short_d2a));
++  assert(is_de_contiguous_container_asan_correct(short_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2a));
++  assert(is_de_contiguous_container_asan_correct(mid_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2c));
++  assert(is_de_contiguous_container_asan_correct(long_d2a));
++  assert(is_de_contiguous_container_asan_correct(long_d2b));
++  assert(is_de_contiguous_container_asan_correct(long_d2c));
++}
++
++template <typename T>
++void test_value() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++  const T val    = T();
++
++  D empty_d1;
++  D short_d1a(1), short_d1b(2);
++  D mid_d1a(N - 1), mid_d1b(N), mid_d1c(N + 1);
++  D long_d1a(17 * N - 1), long_d1b(8 * N), long_d1c(11 * N + 1);
++
++  empty_d1.resize(0, val);
++  short_d1a.resize(1, val);
++  short_d1b.resize(2, val);
++  mid_d1a.resize(N - 1, val);
++  mid_d1b.resize(N, val);
++  mid_d1c.resize(N + 1, val);
++  long_d1a.resize(17 * N - 1, val);
++  long_d1b.resize(8 * N, val);
++  long_d1c.resize(11 * N + 1, val);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(1, val);
++  short_d1a.resize(1, val);
++  short_d1b.resize(1, val);
++  mid_d1a.resize(1, val);
++  mid_d1b.resize(1, val);
++  mid_d1c.resize(1, val);
++  long_d1a.resize(1, val);
++  long_d1b.resize(1, val);
++  long_d1c.resize(1, val);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(2, val);
++  short_d1a.resize(2, val);
++  short_d1b.resize(2, val);
++  mid_d1a.resize(2, val);
++  mid_d1b.resize(2, val);
++  mid_d1c.resize(2, val);
++  long_d1a.resize(2, val);
++  long_d1b.resize(2, val);
++  long_d1c.resize(2, val);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(N - 1, val);
++  short_d1a.resize(N - 1, val);
++  short_d1b.resize(N - 1, val);
++  mid_d1a.resize(N - 1, val);
++  mid_d1b.resize(N - 1, val);
++  mid_d1c.resize(N - 1, val);
++  long_d1a.resize(N - 1, val);
++  long_d1b.resize(N - 1, val);
++  long_d1c.resize(N - 1, val);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(N, val);
++  short_d1a.resize(N, val);
++  short_d1b.resize(N, val);
++  mid_d1a.resize(N, val);
++  mid_d1b.resize(N, val);
++  mid_d1c.resize(N, val);
++  long_d1a.resize(N, val);
++  long_d1b.resize(N, val);
++  long_d1c.resize(N, val);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(N + 1, val);
++  short_d1a.resize(N + 1, val);
++  short_d1b.resize(N + 1, val);
++  mid_d1a.resize(N + 1, val);
++  mid_d1b.resize(N + 1, val);
++  mid_d1c.resize(N + 1, val);
++  long_d1a.resize(N + 1, val);
++  long_d1b.resize(N + 1, val);
++  long_d1c.resize(N + 1, val);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(N, val);
++  short_d1a.resize(N, val);
++  short_d1b.resize(N, val);
++  mid_d1a.resize(N, val);
++  mid_d1b.resize(N, val);
++  mid_d1c.resize(N, val);
++  long_d1a.resize(N, val);
++  long_d1b.resize(N, val);
++  long_d1c.resize(N, val);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(20 * N, val);
++  short_d1a.resize(20 * N, val);
++  short_d1b.resize(20 * N, val);
++  mid_d1a.resize(20 * N, val);
++  mid_d1b.resize(20 * N, val);
++  mid_d1c.resize(20 * N, val);
++  long_d1a.resize(20 * N, val);
++  long_d1b.resize(20 * N, val);
++  long_d1c.resize(20 * N, val);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(0, val);
++  short_d1a.resize(1, val);
++  short_d1b.resize(2, val);
++  mid_d1a.resize(N - 1, val);
++  mid_d1b.resize(N, val);
++  mid_d1c.resize(N + 1, val);
++  long_d1a.resize(17 * N - 1, val);
++  long_d1b.resize(8 * N, val);
++  long_d1c.resize(11 * N + 1, val);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  D empty_d2;
++  D short_d2a(1), short_d2b(2);
++  D mid_d2a(N - 1), mid_d2b(N), mid_d2c(N + 1);
++  D long_d2a(17 * N - 1), long_d2b(8 * N), long_d2c(11 * N + 1);
++
++  empty_d2.resize(20 * N, val);
++  short_d2a.resize(20 * N, val);
++  short_d2b.resize(20 * N, val);
++  mid_d2a.resize(20 * N, val);
++  mid_d2b.resize(20 * N, val);
++  mid_d2c.resize(20 * N, val);
++  long_d2a.resize(20 * N, val);
++  long_d2b.resize(20 * N, val);
++  long_d2c.resize(20 * N, val);
++
++  assert(is_de_contiguous_container_asan_correct(empty_d2));
++  assert(is_de_contiguous_container_asan_correct(short_d2a));
++  assert(is_de_contiguous_container_asan_correct(short_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2a));
++  assert(is_de_contiguous_container_asan_correct(mid_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2c));
++  assert(is_de_contiguous_container_asan_correct(long_d2a));
++  assert(is_de_contiguous_container_asan_correct(long_d2b));
++  assert(is_de_contiguous_container_asan_correct(long_d2c));
++}
++
++template <typename T>
++void test() {
++  test_count<T>();
++  test_value<T>();
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        test<T>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/shrink_to_fit.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/shrink_to_fit.pass.cpp
+new file mode 100644
+index 000000000000..5398c382c82c
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/shrink_to_fit.pass.cpp
+@@ -0,0 +1,500 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++// UNSUPPORTED: c++03
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++template <typename T>
++void test() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  D empty_d1;
++  D short_d1a(1), short_d1b(2);
++  D mid_d1a(N - 1), mid_d1b(N), mid_d1c(N + 1);
++  D long_d1a(17 * N - 1), long_d1b(8 * N), long_d1c(11 * N + 1);
++
++  empty_d1.resize(0);
++  short_d1a.resize(1);
++  short_d1b.resize(2);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(17 * N - 1);
++  long_d1b.resize(8 * N);
++  long_d1c.resize(11 * N + 1);
++
++  empty_d1.shrink_to_fit();
++  short_d1a.shrink_to_fit();
++  short_d1b.shrink_to_fit();
++  mid_d1a.shrink_to_fit();
++  mid_d1b.shrink_to_fit();
++  mid_d1c.shrink_to_fit();
++  long_d1a.shrink_to_fit();
++  long_d1b.shrink_to_fit();
++  long_d1c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(1);
++  short_d1a.resize(1);
++  short_d1b.resize(1);
++  mid_d1a.resize(1);
++  mid_d1b.resize(1);
++  mid_d1c.resize(1);
++  long_d1a.resize(1);
++  long_d1b.resize(1);
++  long_d1c.resize(1);
++
++  empty_d1.shrink_to_fit();
++  short_d1a.shrink_to_fit();
++  short_d1b.shrink_to_fit();
++  mid_d1a.shrink_to_fit();
++  mid_d1b.shrink_to_fit();
++  mid_d1c.shrink_to_fit();
++  long_d1a.shrink_to_fit();
++  long_d1b.shrink_to_fit();
++  long_d1c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(0);
++  short_d1a.resize(1);
++  short_d1b.resize(2);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(17 * N - 1);
++  long_d1b.resize(8 * N);
++  long_d1c.resize(11 * N + 1);
++
++  empty_d1.resize(2);
++  short_d1a.resize(2);
++  short_d1b.resize(2);
++  mid_d1a.resize(2);
++  mid_d1b.resize(2);
++  mid_d1c.resize(2);
++  long_d1a.resize(2);
++  long_d1b.resize(2);
++  long_d1c.resize(2);
++
++  empty_d1.shrink_to_fit();
++  short_d1a.shrink_to_fit();
++  short_d1b.shrink_to_fit();
++  mid_d1a.shrink_to_fit();
++  mid_d1b.shrink_to_fit();
++  mid_d1c.shrink_to_fit();
++  long_d1a.shrink_to_fit();
++  long_d1b.shrink_to_fit();
++  long_d1c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(0);
++  short_d1a.resize(1);
++  short_d1b.resize(2);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(17 * N - 1);
++  long_d1b.resize(8 * N);
++  long_d1c.resize(11 * N + 1);
++
++  empty_d1.resize(N - 1);
++  short_d1a.resize(N - 1);
++  short_d1b.resize(N - 1);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N - 1);
++  mid_d1c.resize(N - 1);
++  long_d1a.resize(N - 1);
++  long_d1b.resize(N - 1);
++  long_d1c.resize(N - 1);
++
++  empty_d1.shrink_to_fit();
++  short_d1a.shrink_to_fit();
++  short_d1b.shrink_to_fit();
++  mid_d1a.shrink_to_fit();
++  mid_d1b.shrink_to_fit();
++  mid_d1c.shrink_to_fit();
++  long_d1a.shrink_to_fit();
++  long_d1b.shrink_to_fit();
++  long_d1c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(0);
++  short_d1a.resize(1);
++  short_d1b.resize(2);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(17 * N - 1);
++  long_d1b.resize(8 * N);
++  long_d1c.resize(11 * N + 1);
++
++  empty_d1.resize(N);
++  short_d1a.resize(N);
++  short_d1b.resize(N);
++  mid_d1a.resize(N);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N);
++  long_d1a.resize(N);
++  long_d1b.resize(N);
++  long_d1c.resize(N);
++
++  empty_d1.shrink_to_fit();
++  short_d1a.shrink_to_fit();
++  short_d1b.shrink_to_fit();
++  mid_d1a.shrink_to_fit();
++  mid_d1b.shrink_to_fit();
++  mid_d1c.shrink_to_fit();
++  long_d1a.shrink_to_fit();
++  long_d1b.shrink_to_fit();
++  long_d1c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(0);
++  short_d1a.resize(1);
++  short_d1b.resize(2);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(17 * N - 1);
++  long_d1b.resize(8 * N);
++  long_d1c.resize(11 * N + 1);
++
++  empty_d1.resize(N + 1);
++  short_d1a.resize(N + 1);
++  short_d1b.resize(N + 1);
++  mid_d1a.resize(N + 1);
++  mid_d1b.resize(N + 1);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(N + 1);
++  long_d1b.resize(N + 1);
++  long_d1c.resize(N + 1);
++
++  empty_d1.shrink_to_fit();
++  short_d1a.shrink_to_fit();
++  short_d1b.shrink_to_fit();
++  mid_d1a.shrink_to_fit();
++  mid_d1b.shrink_to_fit();
++  mid_d1c.shrink_to_fit();
++  long_d1a.shrink_to_fit();
++  long_d1b.shrink_to_fit();
++  long_d1c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(0);
++  short_d1a.resize(1);
++  short_d1b.resize(2);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(17 * N - 1);
++  long_d1b.resize(8 * N);
++  long_d1c.resize(11 * N + 1);
++
++  empty_d1.resize(N);
++  short_d1a.resize(N);
++  short_d1b.resize(N);
++  mid_d1a.resize(N);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N);
++  long_d1a.resize(N);
++  long_d1b.resize(N);
++  long_d1c.resize(N);
++
++  empty_d1.shrink_to_fit();
++  short_d1a.shrink_to_fit();
++  short_d1b.shrink_to_fit();
++  mid_d1a.shrink_to_fit();
++  mid_d1b.shrink_to_fit();
++  mid_d1c.shrink_to_fit();
++  long_d1a.shrink_to_fit();
++  long_d1b.shrink_to_fit();
++  long_d1c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(0);
++  short_d1a.resize(1);
++  short_d1b.resize(2);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(17 * N - 1);
++  long_d1b.resize(8 * N);
++  long_d1c.resize(11 * N + 1);
++
++  empty_d1.resize(20 * N);
++  short_d1a.resize(20 * N);
++  short_d1b.resize(20 * N);
++  mid_d1a.resize(20 * N);
++  mid_d1b.resize(20 * N);
++  mid_d1c.resize(20 * N);
++  long_d1a.resize(20 * N);
++  long_d1b.resize(20 * N);
++  long_d1c.resize(20 * N);
++
++  empty_d1.shrink_to_fit();
++  short_d1a.shrink_to_fit();
++  short_d1b.shrink_to_fit();
++  mid_d1a.shrink_to_fit();
++  mid_d1b.shrink_to_fit();
++  mid_d1c.shrink_to_fit();
++  long_d1a.shrink_to_fit();
++  long_d1b.shrink_to_fit();
++  long_d1c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.resize(0);
++  short_d1a.resize(1);
++  short_d1b.resize(2);
++  mid_d1a.resize(N - 1);
++  mid_d1b.resize(N);
++  mid_d1c.resize(N + 1);
++  long_d1a.resize(17 * N - 1);
++  long_d1b.resize(8 * N);
++  long_d1c.resize(11 * N + 1);
++
++  empty_d1.shrink_to_fit();
++  short_d1a.shrink_to_fit();
++  short_d1b.shrink_to_fit();
++  mid_d1a.shrink_to_fit();
++  mid_d1b.shrink_to_fit();
++  mid_d1c.shrink_to_fit();
++  long_d1a.shrink_to_fit();
++  long_d1b.shrink_to_fit();
++  long_d1c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  empty_d1.clear();
++  short_d1a.clear();
++  short_d1b.clear();
++  mid_d1a.clear();
++  mid_d1b.clear();
++  mid_d1c.clear();
++  long_d1a.clear();
++  long_d1b.clear();
++  long_d1c.clear();
++
++  empty_d1.shrink_to_fit();
++  short_d1a.shrink_to_fit();
++  short_d1b.shrink_to_fit();
++  mid_d1a.shrink_to_fit();
++  mid_d1b.shrink_to_fit();
++  mid_d1c.shrink_to_fit();
++  long_d1a.shrink_to_fit();
++  long_d1b.shrink_to_fit();
++  long_d1c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d1));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  assert(is_de_contiguous_container_asan_correct(mid_d1c));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  assert(is_de_contiguous_container_asan_correct(long_d1c));
++
++  D empty_d2;
++  D short_d2a(1), short_d2b(2);
++  D mid_d2a(N - 1), mid_d2b(N), mid_d2c(N + 1);
++  D long_d2a(17 * N - 1), long_d2b(8 * N), long_d2c(11 * N + 1);
++
++  empty_d2.resize(20 * N);
++  short_d2a.resize(20 * N);
++  short_d2b.resize(20 * N);
++  mid_d2a.resize(20 * N);
++  mid_d2b.resize(20 * N);
++  mid_d2c.resize(20 * N);
++  long_d2a.resize(20 * N);
++  long_d2b.resize(20 * N);
++  long_d2c.resize(20 * N);
++
++  empty_d2.shrink_to_fit();
++  short_d2a.shrink_to_fit();
++  short_d2b.shrink_to_fit();
++  mid_d2a.shrink_to_fit();
++  mid_d2b.shrink_to_fit();
++  mid_d2c.shrink_to_fit();
++  long_d2a.shrink_to_fit();
++  long_d2b.shrink_to_fit();
++  long_d2c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d2));
++  assert(is_de_contiguous_container_asan_correct(short_d2a));
++  assert(is_de_contiguous_container_asan_correct(short_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2a));
++  assert(is_de_contiguous_container_asan_correct(mid_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2c));
++  assert(is_de_contiguous_container_asan_correct(long_d2a));
++  assert(is_de_contiguous_container_asan_correct(long_d2b));
++  assert(is_de_contiguous_container_asan_correct(long_d2c));
++
++  empty_d2.resize(0);
++  short_d2a.resize(0);
++  short_d2b.resize(0);
++  mid_d2a.resize(0);
++  mid_d2b.resize(0);
++  mid_d2c.resize(0);
++  long_d2a.resize(0);
++  long_d2b.resize(0);
++  long_d2c.resize(0);
++
++  empty_d2.shrink_to_fit();
++  short_d2a.shrink_to_fit();
++  short_d2b.shrink_to_fit();
++  mid_d2a.shrink_to_fit();
++  mid_d2b.shrink_to_fit();
++  mid_d2c.shrink_to_fit();
++  long_d2a.shrink_to_fit();
++  long_d2b.shrink_to_fit();
++  long_d2c.shrink_to_fit();
++
++  assert(is_de_contiguous_container_asan_correct(empty_d2));
++  assert(is_de_contiguous_container_asan_correct(short_d2a));
++  assert(is_de_contiguous_container_asan_correct(short_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2a));
++  assert(is_de_contiguous_container_asan_correct(mid_d2b));
++  assert(is_de_contiguous_container_asan_correct(mid_d2c));
++  assert(is_de_contiguous_container_asan_correct(long_d2a));
++  assert(is_de_contiguous_container_asan_correct(long_d2b));
++  assert(is_de_contiguous_container_asan_correct(long_d2c));
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        test<T>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/std/containers/sequences/deque/deque.asan/swap.pass.cpp b/libcxx/test/std/containers/sequences/deque/deque.asan/swap.pass.cpp
+new file mode 100644
+index 000000000000..2263121cdc72
+--- /dev/null
++++ b/libcxx/test/std/containers/sequences/deque/deque.asan/swap.pass.cpp
+@@ -0,0 +1,280 @@
++//===----------------------------------------------------------------------===//
++//
++// 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
++//
++//===----------------------------------------------------------------------===//
++
++// <deque>
++
++#include <cassert>
++#include <array>
++#include "test_macros.h"
++#include "asan_testing.h" // includes deque - don't do it before
++
++template <typename T>
++void test_external() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  D empty_d1a, empty_d1b;
++  D short_d1a(1), short_d1b;
++  D mid_d1a(N), mid_d1b(N + 1);
++  D long_d1a(8 * N), long_d1b(11 * N + 1);
++
++  std::swap(empty_d1a, empty_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(empty_d1b));
++  std::swap(empty_d1a, empty_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(empty_d1b));
++
++  std::swap(empty_d1a, short_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  std::swap(empty_d1a, short_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++
++  std::swap(empty_d1a, mid_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  std::swap(empty_d1a, mid_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++
++  std::swap(empty_d1a, mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  std::swap(empty_d1a, mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++
++  std::swap(empty_d1a, long_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  std::swap(empty_d1a, long_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++
++  std::swap(empty_d1a, long_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  std::swap(empty_d1a, long_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++
++  std::swap(short_d1a, short_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  std::swap(short_d1a, short_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++
++  std::swap(short_d1a, mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  std::swap(short_d1a, mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++
++  std::swap(short_d1a, long_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  std::swap(short_d1a, long_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++
++  std::swap(mid_d1a, mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  std::swap(mid_d1a, mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++
++  std::swap(mid_d1a, long_d1b);
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  std::swap(mid_d1a, long_d1b);
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++
++  std::swap(long_d1a, long_d1b);
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  std::swap(long_d1a, long_d1b);
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++
++  std::swap(empty_d1a, empty_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++
++  std::swap(short_d1a, short_d1a);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  std::swap(short_d1b, short_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++
++  std::swap(long_d1a, long_d1a);
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++}
++
++template <typename T>
++void test_member() {
++  typedef std::deque<T> D;
++  size_t const N = sizeof(T) < 256 ? (4096 / sizeof(T)) : 16;
++
++  D empty_d1a, empty_d1b;
++  D short_d1a(1), short_d1b;
++  D mid_d1a(N), mid_d1b(N + 1);
++  D long_d1a(8 * N), long_d1b(11 * N + 1);
++
++  empty_d1a.swap(empty_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(empty_d1b));
++  empty_d1a.swap(empty_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(empty_d1b));
++
++  empty_d1a.swap(short_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  empty_d1a.swap(short_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++
++  empty_d1a.swap(mid_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  empty_d1a.swap(mid_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++
++  empty_d1a.swap(mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  empty_d1a.swap(mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++
++  empty_d1a.swap(long_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  empty_d1a.swap(long_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++
++  empty_d1a.swap(long_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  empty_d1a.swap(long_d1b);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++
++  short_d1a.swap(short_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++  short_d1a.swap(short_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++
++  short_d1a.swap(mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  short_d1a.swap(mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++
++  short_d1a.swap(long_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  short_d1a.swap(long_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++
++  mid_d1a.swap(mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++  mid_d1a.swap(mid_d1b);
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(mid_d1b));
++
++  mid_d1a.swap(long_d1b);
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  mid_d1a.swap(long_d1b);
++  assert(is_de_contiguous_container_asan_correct(mid_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++
++  long_d1a.swap(long_d1b);
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++  long_d1a.swap(long_d1b);
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++  assert(is_de_contiguous_container_asan_correct(long_d1b));
++
++  empty_d1a.swap(empty_d1a);
++  assert(is_de_contiguous_container_asan_correct(empty_d1a));
++
++  short_d1a.swap(short_d1a);
++  assert(is_de_contiguous_container_asan_correct(short_d1a));
++  short_d1b.swap(short_d1b);
++  assert(is_de_contiguous_container_asan_correct(short_d1b));
++
++  long_d1a.swap(long_d1a);
++  assert(is_de_contiguous_container_asan_correct(long_d1a));
++}
++
++template <typename T>
++void test() {
++  test_external<T>();
++  test_member<T>();
++}
++
++int main(int, char**) {
++  {
++    typedef char T;
++    test<T>();
++  }
++  {
++    typedef short T;
++    test<T>();
++  }
++  {
++    typedef int T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 3> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 5> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 11> T;
++    test<T>();
++  }
++  {
++    typedef std::array<char, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<int, 8000> T;
++    test<T>();
++  }
++  {
++    typedef std::array<std::array<char, 3>, 8000> T;
++    test<T>();
++  }
++  /*
++    // Testing interface does not support situations,
++    // when object memory may be poisoned (SSO case).
++    {
++        typedef std::string T;
++        test<T>();
++    }
++*/
++  return 0;
++}
+diff --git a/libcxx/test/support/asan_testing.h b/libcxx/test/support/asan_testing.h
+index aae93019fe1c..f9663cdc1cbb 100644
+--- a/libcxx/test/support/asan_testing.h
++++ b/libcxx/test/support/asan_testing.h
+@@ -9,11 +9,23 @@
+ #ifndef ASAN_TESTING_H
+ #define ASAN_TESTING_H
+ 
++#ifdef _LIBCPP_DEQUE
++// We need to define __LIBCPP_VERIFY_ASAN_DEQUE_ANNOTATIONS first
++// prior to including deque, so we error out if its already included
++#  error deque included before asan_testing.h
++#endif
++
+ #include "test_macros.h"
+ 
+ #if TEST_HAS_FEATURE(address_sanitizer)
+ extern "C" int __sanitizer_verify_contiguous_container
+      ( const void *beg, const void *mid, const void *end );
++extern "C" int
++__sanitizer_verify_de_contiguous_container(const void* beg, const void* con_beg, const void* con_end, const void* end);
++extern "C" bool __sanitizer_is_annotable(const void* address, const unsigned long size);
++#define __LIBCPP_VERIFY_ASAN_DEQUE_ANNOTATIONS
++#include <deque>
++#include <vector>
+ 
+ template <typename T, typename Alloc>
+ TEST_CONSTEXPR bool is_contiguous_container_asan_correct ( const std::vector<T, Alloc> &c )
+@@ -26,13 +38,21 @@ TEST_CONSTEXPR bool is_contiguous_container_asan_correct ( const std::vector<T,
+     return true;
+ }
+ 
++template <class _Tp, class _Allocator>
++TEST_CONSTEXPR bool is_de_contiguous_container_asan_correct ( const std::deque<_Tp, _Allocator>& c) {
++  return c.__verify_asan_annotations();
++}
+ #else
+ template <typename T, typename Alloc>
+ TEST_CONSTEXPR bool is_contiguous_container_asan_correct ( const std::vector<T, Alloc> &)
+ {
+     return true;
+ }
+-#endif
+ 
++template <class _Tp, class _Allocator>
++TEST_CONSTEXPR bool is_de_contiguous_container_asan_correct ( const std::deque<_Tp, _Allocator> &) {
++  return true;
++}
++#endif
+ 
+ #endif // ASAN_TESTING_H