1 //===----------------------------------------------------------------------===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8
9 // UNSUPPORTED: c++03
10
11 // <deque>
12
13 // void push_front(value_type&& v);
14
15 #include "asan_testing.h"
16 #include <deque>
17 #include <cassert>
18 #include <cstddef>
19
20 #include "test_macros.h"
21 #include "MoveOnly.h"
22 #include "min_allocator.h"
23
24
25 template <class C>
26 C
make(int size,int start=0)27 make(int size, int start = 0 )
28 {
29 const int b = 4096 / sizeof(int);
30 int init = 0;
31 if (start > 0)
32 {
33 init = (start+1) / b + ((start+1) % b != 0);
34 init *= b;
35 --init;
36 }
37 C c(init);
38 for (int i = 0; i < init-start; ++i)
39 c.pop_back();
40 for (int i = 0; i < size; ++i)
41 c.push_back(MoveOnly(i));
42 for (int i = 0; i < start; ++i)
43 c.pop_front();
44 return c;
45 }
46
47 template <class C>
48 void
test(C & c1,int x)49 test(C& c1, int x)
50 {
51 typedef typename C::iterator I;
52 std::size_t c1_osize = c1.size();
53 c1.push_front(MoveOnly(x));
54 assert(c1.size() == c1_osize + 1);
55 assert(static_cast<std::size_t>(std::distance(c1.begin(), c1.end())) == c1.size());
56 I i = c1.begin();
57 assert(*i == MoveOnly(x));
58 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));
59 ++i;
60 for (int j = 0; static_cast<std::size_t>(j) < c1_osize; ++j, (void) ++i)
61 assert(*i == MoveOnly(j));
62 }
63
64 template <class C>
65 void
testN(int start,int N)66 testN(int start, int N)
67 {
68 C c1 = make<C>(N, start);
69 test(c1, -10);
70 }
71
72
main(int,char **)73 int main(int, char**)
74 {
75 {
76 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
77 const int N = sizeof(rng)/sizeof(rng[0]);
78 for (int i = 0; i < N; ++i)
79 for (int j = 0; j < N; ++j)
80 testN<std::deque<MoveOnly> >(rng[i], rng[j]);
81 }
82 {
83 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};
84 const int N = sizeof(rng)/sizeof(rng[0]);
85 for (int i = 0; i < N; ++i)
86 for (int j = 0; j < N; ++j)
87 testN<std::deque<MoveOnly, safe_allocator<MoveOnly>> >(rng[i], rng[j]);
88 }
89
90 return 0;
91 }
92