1 // RUN: %clang_cc1 -std=c++11 -fsyntax-only -verify %s
2
3 // This must obviously come before the definition of std::initializer_list.
missing_initializerlist()4 void missing_initializerlist() {
5 auto l = {1, 2, 3, 4}; // expected-error {{std::initializer_list was not found}}
6 }
7
8 namespace std {
9 typedef decltype(sizeof(int)) size_t;
10
11 // libc++'s implementation
12 template <class _E>
13 class initializer_list
14 {
15 const _E* __begin_;
16 size_t __size_;
17
initializer_list(const _E * __b,size_t __s)18 initializer_list(const _E* __b, size_t __s)
19 : __begin_(__b),
20 __size_(__s)
21 {}
22
23 public:
24 typedef _E value_type;
25 typedef const _E& reference;
26 typedef const _E& const_reference;
27 typedef size_t size_type;
28
29 typedef const _E* iterator;
30 typedef const _E* const_iterator;
31
initializer_list()32 initializer_list() : __begin_(nullptr), __size_(0) {}
33
size() const34 size_t size() const {return __size_;}
begin() const35 const _E* begin() const {return __begin_;}
end() const36 const _E* end() const {return __begin_ + __size_;}
37 };
38 }
39
40 template <typename T, typename U>
41 struct same_type { static const bool value = false; };
42 template <typename T>
43 struct same_type<T, T> { static const bool value = true; };
44
45 struct one { char c[1]; };
46 struct two { char c[2]; };
47
48 struct A {
49 int a, b;
50 };
51
52 struct B {
53 B();
54 B(int, int);
55 };
56
simple_list()57 void simple_list() {
58 std::initializer_list<int> il = { 1, 2, 3 };
59 std::initializer_list<double> dl = { 1.0, 2.0, 3 };
60 std::initializer_list<A> al = { {1, 2}, {2, 3}, {3, 4} };
61 std::initializer_list<B> bl = { {1, 2}, {2, 3}, {} };
62 }
63
function_call()64 void function_call() {
65 void f(std::initializer_list<int>);
66 f({1, 2, 3});
67
68 void g(std::initializer_list<B>);
69 g({ {1, 2}, {2, 3}, {} });
70 }
71
72 struct C {
73 C(int);
74 };
75
76 struct D {
77 D();
78 operator int();
79 operator C();
80 };
81
overloaded_call()82 void overloaded_call() {
83 one overloaded(std::initializer_list<int>);
84 two overloaded(std::initializer_list<B>);
85
86 static_assert(sizeof(overloaded({1, 2, 3})) == sizeof(one), "bad overload");
87 static_assert(sizeof(overloaded({ {1, 2}, {2, 3}, {} })) == sizeof(two), "bad overload");
88
89 void ambiguous(std::initializer_list<A>); // expected-note {{candidate}}
90 void ambiguous(std::initializer_list<B>); // expected-note {{candidate}}
91 ambiguous({ {1, 2}, {2, 3}, {3, 4} }); // expected-error {{ambiguous}}
92
93 one ov2(std::initializer_list<int>); // expected-note {{candidate}}
94 two ov2(std::initializer_list<C>); // expected-note {{candidate}}
95 // Worst sequence to int is identity, whereas to C it's user-defined.
96 static_assert(sizeof(ov2({1, 2, 3})) == sizeof(one), "bad overload");
97 // But here, user-defined is worst in both cases.
98 ov2({1, 2, D()}); // expected-error {{ambiguous}}
99 }
100
101 template <typename T>
102 T deduce(std::initializer_list<T>); // expected-note {{conflicting types for parameter 'T' ('int' vs. 'double')}}
103 template <typename T>
104 T deduce_ref(const std::initializer_list<T>&); // expected-note {{conflicting types for parameter 'T' ('int' vs. 'double')}}
105
argument_deduction()106 void argument_deduction() {
107 static_assert(same_type<decltype(deduce({1, 2, 3})), int>::value, "bad deduction");
108 static_assert(same_type<decltype(deduce({1.0, 2.0, 3.0})), double>::value, "bad deduction");
109
110 deduce({1, 2.0}); // expected-error {{no matching function}}
111
112 static_assert(same_type<decltype(deduce_ref({1, 2, 3})), int>::value, "bad deduction");
113 static_assert(same_type<decltype(deduce_ref({1.0, 2.0, 3.0})), double>::value, "bad deduction");
114
115 deduce_ref({1, 2.0}); // expected-error {{no matching function}}
116 }
117
auto_deduction()118 void auto_deduction() {
119 auto l = {1, 2, 3, 4};
120 auto l2 {1, 2, 3, 4}; // expected-error {{initializer for variable 'l2' with type 'auto' contains multiple expressions}}
121 auto l3 {1};
122 static_assert(same_type<decltype(l), std::initializer_list<int>>::value, "");
123 static_assert(same_type<decltype(l3), int>::value, "");
124 auto bl = {1, 2.0}; // expected-error {{cannot deduce}}
125
126 for (int i : {1, 2, 3, 4}) {}
127 }
128
dangle()129 void dangle() {
130 new auto{1, 2, 3}; // expected-error {{cannot use list-initialization}}
131 new std::initializer_list<int>{1, 2, 3}; // expected-warning {{at the end of the full-expression}}
132 }
133
134 struct haslist1 {
135 std::initializer_list<int> il = {1, 2, 3}; // expected-warning{{at the end of the constructor}}
136 std::initializer_list<int> jl{1, 2, 3}; // expected-warning{{at the end of the constructor}}
137 haslist1();
138 };
139
haslist1()140 haslist1::haslist1()
141 : il{1, 2, 3} // expected-warning{{at the end of the constructor}}
142 {}
143
144 namespace PR12119 {
145 // Deduction with nested initializer lists.
146 template<typename T> void f(std::initializer_list<T>);
147 template<typename T> void g(std::initializer_list<std::initializer_list<T>>);
148
foo()149 void foo() {
150 f({0, {1}}); // expected-warning{{braces around scalar initializer}}
151 g({{0, 1}, {2, 3}});
152 std::initializer_list<int> il = {1, 2};
153 g({il, {2, 3}});
154 }
155 }
156
157 namespace Decay {
158 template<typename T>
f(std::initializer_list<T>)159 void f(std::initializer_list<T>) {
160 T x = 1; // expected-error{{cannot initialize a variable of type 'const char *' with an rvalue of type 'int'}}
161 }
162
g()163 void g() {
164 f({"A", "BB", "CCC"}); // expected-note{{in instantiation of function template specialization 'Decay::f<const char *>' requested here}}
165
166 auto x = { "A", "BB", "CCC" };
167 std::initializer_list<const char *> *il = &x;
168
169 for( auto s : {"A", "BB", "CCC", "DDD"}) { }
170 }
171 }
172
173 namespace PR12436 {
174 struct X {
175 template<typename T>
176 X(std::initializer_list<int>, T);
177 };
178
179 X x({}, 17);
180 }
181
182 namespace rdar11948732 {
183 template<typename T> struct X {};
184
185 struct XCtorInit {
186 XCtorInit(std::initializer_list<X<int>>);
187 };
188
f(X<int> & xi)189 void f(X<int> &xi) {
190 XCtorInit xc = { xi, xi };
191 }
192 }
193
194 namespace PR14272 {
195 auto x { { 0, 0 } }; // expected-error {{cannot deduce type for variable 'x' with type 'auto' from nested initializer list}}
196 }
197
198 namespace initlist_of_array {
f(std::initializer_list<int[2]>)199 void f(std::initializer_list<int[2]>) {}
200 void f(std::initializer_list<int[2][2]>) = delete;
h()201 void h() {
202 f({{1,2},{3,4}});
203 }
204 }
205
206 namespace init_list_deduction_failure {
207 void f();
208 void f(int);
209 template<typename T> void g(std::initializer_list<T>);
210 // expected-note@-1 {{candidate template ignored: couldn't resolve reference to overloaded function 'f'}}
h()211 void h() { g({f}); }
212 // expected-error@-1 {{no matching function for call to 'g'}}
213 }
214
215 namespace deleted_copy {
216 struct X {
Xdeleted_copy::X217 X(int i) {}
218 X(const X& x) = delete; // expected-note {{here}}
219 void operator=(const X& x) = delete;
220 };
221
222 std::initializer_list<X> x{1}; // expected-error {{invokes deleted constructor}}
223 }
224
225 namespace RefVersusInitList {
226 struct S {};
227 void f(const S &) = delete;
228 void f(std::initializer_list<S>);
g(S s)229 void g(S s) { f({S()}); }
230 }
231
232 namespace PR18013 {
233 int f();
234 std::initializer_list<long (*)()> x = {f}; // expected-error {{cannot initialize an array element of type 'long (*const)()' with an lvalue of type 'int ()': different return type ('long' vs 'int')}}
235 }
236
237 namespace DR1070 {
238 struct S {
239 S(std::initializer_list<int>);
240 };
241 S s[3] = { {1, 2, 3}, {4, 5} }; // ok
242 S *p = new S[3] { {1, 2, 3}, {4, 5} }; // ok
243 }
244
245 namespace ListInitInstantiate {
246 struct A {
247 A(std::initializer_list<A>);
248 A(std::initializer_list<int>);
249 };
250 struct B : A {
251 B(int);
252 };
253 template<typename T> struct X {
254 X();
255 A a;
256 };
X()257 template<typename T> X<T>::X() : a{B{0}, B{1}} {}
258
259 X<int> x;
260
261 int f(const A&);
g()262 template<typename T> void g() { int k = f({0}); }
263 template void g<int>();
264 }
265
266 namespace TemporaryInitListSourceRange_PR22367 {
267 struct A {
ATemporaryInitListSourceRange_PR22367::A268 constexpr A() {}
269 A(std::initializer_list<int>); // expected-note {{here}}
270 };
f(A)271 constexpr int f(A) { return 0; }
272 constexpr int k = f( // expected-error {{must be initialized by a constant expression}}
273 // The point of this test is to check that the caret points to
274 // 'std::initializer_list', not to '{0}'.
275 std::initializer_list // expected-note {{constructor}}
276 <int>
277 {0}
278 );
279 }
280
281 namespace ParameterPackNestedInitializerLists_PR23904c3 {
282 template <typename ...T>
283 void f(std::initializer_list<std::initializer_list<T>> ...tt);
284
foo()285 void foo() { f({{0}}, {{'\0'}}); }
286 }
287
288 namespace update_rbrace_loc_crash {
289 // We used to crash-on-invalid on this example when updating the right brace
290 // location.
291 template <typename T, T>
292 struct A {};
293 template <typename T, typename F, int... I>
ExplodeImpl(F p1,A<int,I...>)294 std::initializer_list<T> ExplodeImpl(F p1, A<int, I...>) {
295 // expected-error@+1 {{reference to type 'const update_rbrace_loc_crash::Incomplete' could not bind to an rvalue of type 'void'}}
296 return {p1(I)...};
297 }
298 template <typename T, int N, typename F>
Explode(F p1)299 void Explode(F p1) {
300 // expected-note@+1 {{in instantiation of function template specialization}}
301 ExplodeImpl<T>(p1, A<int, N>());
302 }
303 class Incomplete;
304 struct ContainsIncomplete {
305 const Incomplete &obstacle;
306 };
f()307 void f() {
308 // expected-note@+1 {{in instantiation of function template specialization}}
309 Explode<ContainsIncomplete, 4>([](int) {});
310 }
311 }
312