• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 //===----------------------------------------------------------------------===//
2 //
3 //                     The LLVM Compiler Infrastructure
4 //
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
7 //
8 //===----------------------------------------------------------------------===//
9 
10 // <vector>
11 
12 // pointer data();
13 
14 #include <vector>
15 #include <cassert>
16 
17 #include "min_allocator.h"
18 #include "asan_testing.h"
19 
20 struct Nasty {
NastyNasty21     Nasty() : i_(0) {}
NastyNasty22     Nasty(int i) : i_(i) {}
~NastyNasty23     ~Nasty() {}
24 
operator &Nasty25     Nasty * operator&() const { assert(false); return nullptr; }
26     int i_;
27     };
28 
main()29 int main()
30 {
31     {
32         std::vector<int> v;
33         assert(v.data() == 0);
34         assert(is_contiguous_container_asan_correct(v));
35     }
36     {
37         std::vector<int> v(100);
38         assert(v.data() == std::addressof(v.front()));
39         assert(is_contiguous_container_asan_correct(v));
40     }
41     {
42         std::vector<Nasty> v(100);
43         assert(v.data() == std::addressof(v.front()));
44         assert(is_contiguous_container_asan_correct(v));
45     }
46 #if TEST_STD_VER >= 11
47     {
48         std::vector<int, min_allocator<int>> v;
49         assert(v.data() == 0);
50         assert(is_contiguous_container_asan_correct(v));
51     }
52     {
53         std::vector<int, min_allocator<int>> v(100);
54         assert(v.data() == std::addressof(v.front()));
55         assert(is_contiguous_container_asan_correct(v));
56     }
57     {
58         std::vector<Nasty, min_allocator<Nasty>> v(100);
59         assert(v.data() == std::addressof(v.front()));
60         assert(is_contiguous_container_asan_correct(v));
61     }
62 #endif
63 }
64