6b913d7c52
git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@225541 91177308-0d34-0410-b5e6-96231b3b80d8
189 lines
7.9 KiB
C++
189 lines
7.9 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// <vector>
|
|
|
|
// template <class T, class Alloc>
|
|
// void swap(vector<T,Alloc>& x, vector<T,Alloc>& y);
|
|
|
|
#include <vector>
|
|
#include <iterator>
|
|
#include <cassert>
|
|
#include "test_allocator.h"
|
|
#include "min_allocator.h"
|
|
#include "asan_testing.h"
|
|
|
|
int main()
|
|
{
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
int a2[] = {0, 2, 4, 5, 6, 8, 11};
|
|
std::vector<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
|
std::vector<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
swap(c1, c2);
|
|
assert(c1 == std::vector<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
|
|
assert(c2 == std::vector<int>(a1, a1+sizeof(a1)/sizeof(a1[0])));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
int a2[] = {0, 2, 4, 5, 6, 8, 11};
|
|
std::vector<int> c1(a1, a1);
|
|
std::vector<int> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
swap(c1, c2);
|
|
assert(c1 == std::vector<int>(a2, a2+sizeof(a2)/sizeof(a2[0])));
|
|
assert(c2.empty());
|
|
assert(distance(c2.begin(), c2.end()) == 0);
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
int a2[] = {0, 2, 4, 5, 6, 8, 11};
|
|
std::vector<int> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
|
std::vector<int> c2(a2, a2);
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
swap(c1, c2);
|
|
assert(c1.empty());
|
|
assert(distance(c1.begin(), c1.end()) == 0);
|
|
assert(c2 == std::vector<int>(a1, a1+sizeof(a1)/sizeof(a1[0])));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
int a2[] = {0, 2, 4, 5, 6, 8, 11};
|
|
std::vector<int> c1(a1, a1);
|
|
std::vector<int> c2(a2, a2);
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
swap(c1, c2);
|
|
assert(c1.empty());
|
|
assert(distance(c1.begin(), c1.end()) == 0);
|
|
assert(c2.empty());
|
|
assert(distance(c2.begin(), c2.end()) == 0);
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
#ifndef _LIBCPP_DEBUG_LEVEL
|
|
// This test known to result in undefined behavior detected by _LIBCPP_DEBUG_LEVEL >= 1
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
int a2[] = {0, 2, 4, 5, 6, 8, 11};
|
|
typedef test_allocator<int> A;
|
|
std::vector<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
|
|
std::vector<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2));
|
|
swap(c1, c2);
|
|
assert((c1 == std::vector<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
|
assert(c1.get_allocator() == A(1));
|
|
assert((c2 == std::vector<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0]))));
|
|
assert(c2.get_allocator() == A(2));
|
|
}
|
|
#endif
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
int a2[] = {0, 2, 4, 5, 6, 8, 11};
|
|
typedef other_allocator<int> A;
|
|
std::vector<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1));
|
|
std::vector<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
swap(c1, c2);
|
|
assert((c1 == std::vector<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
|
assert(c1.get_allocator() == A(2));
|
|
assert((c2 == std::vector<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0]))));
|
|
assert(c2.get_allocator() == A(1));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
#if __cplusplus >= 201103L
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
int a2[] = {0, 2, 4, 5, 6, 8, 11};
|
|
std::vector<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
|
std::vector<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
swap(c1, c2);
|
|
assert((c1 == std::vector<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
|
assert((c2 == std::vector<int, min_allocator<int>>(a1, a1+sizeof(a1)/sizeof(a1[0]))));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
int a2[] = {0, 2, 4, 5, 6, 8, 11};
|
|
std::vector<int, min_allocator<int>> c1(a1, a1);
|
|
std::vector<int, min_allocator<int>> c2(a2, a2+sizeof(a2)/sizeof(a2[0]));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
swap(c1, c2);
|
|
assert((c1 == std::vector<int, min_allocator<int>>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
|
assert(c2.empty());
|
|
assert(distance(c2.begin(), c2.end()) == 0);
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
int a2[] = {0, 2, 4, 5, 6, 8, 11};
|
|
std::vector<int, min_allocator<int>> c1(a1, a1+sizeof(a1)/sizeof(a1[0]));
|
|
std::vector<int, min_allocator<int>> c2(a2, a2);
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
swap(c1, c2);
|
|
assert(c1.empty());
|
|
assert(distance(c1.begin(), c1.end()) == 0);
|
|
assert((c2 == std::vector<int, min_allocator<int>>(a1, a1+sizeof(a1)/sizeof(a1[0]))));
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
int a2[] = {0, 2, 4, 5, 6, 8, 11};
|
|
std::vector<int, min_allocator<int>> c1(a1, a1);
|
|
std::vector<int, min_allocator<int>> c2(a2, a2);
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
swap(c1, c2);
|
|
assert(c1.empty());
|
|
assert(distance(c1.begin(), c1.end()) == 0);
|
|
assert(c2.empty());
|
|
assert(distance(c2.begin(), c2.end()) == 0);
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
#ifndef _LIBCPP_DEBUG_LEVEL
|
|
// This test known to result in undefined behavior detected by _LIBCPP_DEBUG_LEVEL >= 1
|
|
{
|
|
int a1[] = {1, 3, 7, 9, 10};
|
|
int a2[] = {0, 2, 4, 5, 6, 8, 11};
|
|
typedef min_allocator<int> A;
|
|
std::vector<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A());
|
|
std::vector<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A());
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
swap(c1, c2);
|
|
assert((c1 == std::vector<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0]))));
|
|
assert(c1.get_allocator() == A());
|
|
assert((c2 == std::vector<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0]))));
|
|
assert(c2.get_allocator() == A());
|
|
assert(is_contiguous_container_asan_correct(c1));
|
|
assert(is_contiguous_container_asan_correct(c2));
|
|
}
|
|
#endif
|
|
#endif
|
|
}
|