119 lines · cpp
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-exception6//7//===----------------------------------------------------------------------===//8 9// <deque>10 11// template <class T, class A>12// void swap(deque<T, A>& x, deque<T, A>& y);13 14#include "asan_testing.h"15#include <deque>16#include <cassert>17#include "test_macros.h"18#include "test_allocator.h"19#include "min_allocator.h"20 21template <class C>22C make(int size, int start = 0) {23 const int b = 4096 / sizeof(int);24 int init = 0;25 if (start > 0) {26 init = (start + 1) / b + ((start + 1) % b != 0);27 init *= b;28 --init;29 }30 C c(init, 0);31 for (int i = 0; i < init - start; ++i)32 c.pop_back();33 for (int i = 0; i < size; ++i)34 c.push_back(i);35 for (int i = 0; i < start; ++i)36 c.pop_front();37 return c;38}39 40template <class C>41void testN(int start, int N, int M) {42 C c1 = make<C>(N, start);43 C c2 = make<C>(M);44 C c1_save = c1;45 C c2_save = c2;46 swap(c1, c2);47 assert(c1 == c2_save);48 assert(c2 == c1_save);49 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));50 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));51 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1_save));52 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2_save));53}54 55int main(int, char**) {56 {57 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};58 const int N = sizeof(rng) / sizeof(rng[0]);59 for (int i = 0; i < N; ++i)60 for (int j = 0; j < N; ++j)61 for (int k = 0; k < N; ++k)62 testN<std::deque<int> >(rng[i], rng[j], rng[k]);63 }64 {65 int a1[] = {1, 3, 7, 9, 10};66 int a2[] = {0, 2, 4, 5, 6, 8, 11};67 typedef test_allocator<int> A;68 std::deque<int, A> c1(a1, a1 + sizeof(a1) / sizeof(a1[0]), A(1, 1));69 std::deque<int, A> c2(a2, a2 + sizeof(a2) / sizeof(a2[0]), A(1, 2));70 swap(c1, c2);71 assert((c1 == std::deque<int, A>(a2, a2 + sizeof(a2) / sizeof(a2[0]))));72 assert(c1.get_allocator().get_id() == 1);73 assert((c2 == std::deque<int, A>(a1, a1 + sizeof(a1) / sizeof(a1[0]))));74 assert(c2.get_allocator().get_id() == 2);75 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));76 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));77 }78 {79 int a1[] = {1, 3, 7, 9, 10};80 int a2[] = {0, 2, 4, 5, 6, 8, 11};81 typedef other_allocator<int> A;82 std::deque<int, A> c1(a1, a1 + sizeof(a1) / sizeof(a1[0]), A(1));83 std::deque<int, A> c2(a2, a2 + sizeof(a2) / sizeof(a2[0]), A(2));84 swap(c1, c2);85 assert((c1 == std::deque<int, A>(a2, a2 + sizeof(a2) / sizeof(a2[0]))));86 assert(c1.get_allocator() == A(2));87 assert((c2 == std::deque<int, A>(a1, a1 + sizeof(a1) / sizeof(a1[0]))));88 assert(c2.get_allocator() == A(1));89 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));90 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));91 }92#if TEST_STD_VER >= 1193 {94 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049};95 const int N = sizeof(rng) / sizeof(rng[0]);96 for (int i = 0; i < N; ++i)97 for (int j = 0; j < N; ++j)98 for (int k = 0; k < N; ++k)99 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]);100 }101 {102 int a1[] = {1, 3, 7, 9, 10};103 int a2[] = {0, 2, 4, 5, 6, 8, 11};104 typedef min_allocator<int> A;105 std::deque<int, A> c1(a1, a1 + sizeof(a1) / sizeof(a1[0]), A());106 std::deque<int, A> c2(a2, a2 + sizeof(a2) / sizeof(a2[0]), A());107 swap(c1, c2);108 assert((c1 == std::deque<int, A>(a2, a2 + sizeof(a2) / sizeof(a2[0]))));109 assert(c1.get_allocator() == A());110 assert((c2 == std::deque<int, A>(a1, a1 + sizeof(a1) / sizeof(a1[0]))));111 assert(c2.get_allocator() == A());112 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c1));113 LIBCPP_ASSERT(is_double_ended_contiguous_container_asan_correct(c2));114 }115#endif116 117 return 0;118}119