forked from mirror/libcxx
You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
64 lines
1.6 KiB
C++
64 lines
1.6 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>
|
|
|
|
// pointer data();
|
|
|
|
#include <vector>
|
|
#include <cassert>
|
|
|
|
#include "min_allocator.h"
|
|
#include "asan_testing.h"
|
|
|
|
struct Nasty {
|
|
Nasty() : i_(0) {}
|
|
Nasty(int i) : i_(i) {}
|
|
~Nasty() {}
|
|
|
|
Nasty * operator&() const { assert(false); return nullptr; }
|
|
int i_;
|
|
};
|
|
|
|
int main()
|
|
{
|
|
{
|
|
std::vector<int> v;
|
|
assert(v.data() == 0);
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
}
|
|
{
|
|
std::vector<int> v(100);
|
|
assert(v.data() == std::addressof(v.front()));
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
}
|
|
{
|
|
std::vector<Nasty> v(100);
|
|
assert(v.data() == std::addressof(v.front()));
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
}
|
|
#if TEST_STD_VER >= 11
|
|
{
|
|
std::vector<int, min_allocator<int>> v;
|
|
assert(v.data() == 0);
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
}
|
|
{
|
|
std::vector<int, min_allocator<int>> v(100);
|
|
assert(v.data() == std::addressof(v.front()));
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
}
|
|
{
|
|
std::vector<Nasty, min_allocator<Nasty>> v(100);
|
|
assert(v.data() == std::addressof(v.front()));
|
|
assert(is_contiguous_container_asan_correct(v));
|
|
}
|
|
#endif
|
|
}
|