]>
Commit | Line | Data |
---|---|---|
8d08fdba MS |
1 | /* Report error messages, build initializers, and perform |
2 | some front-end optimizations for C++ compiler. | |
d6a8bdff | 3 | Copyright (C) 1987, 1988, 1989, 1992, 1993, 1994, 1995, 1996, 1997, 1998, |
66647d44 | 4 | 1999, 2000, 2001, 2002, 2004, 2005, 2006, 2007, 2008, 2009 |
3c2426b9 | 5 | Free Software Foundation, Inc. |
8d08fdba MS |
6 | Hacked by Michael Tiemann (tiemann@cygnus.com) |
7 | ||
f5adbb8d | 8 | This file is part of GCC. |
8d08fdba | 9 | |
f5adbb8d | 10 | GCC is free software; you can redistribute it and/or modify |
8d08fdba | 11 | it under the terms of the GNU General Public License as published by |
e77f031d | 12 | the Free Software Foundation; either version 3, or (at your option) |
8d08fdba MS |
13 | any later version. |
14 | ||
f5adbb8d | 15 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
16 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
17 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
18 | GNU General Public License for more details. | |
19 | ||
20 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
21 | along with GCC; see the file COPYING3. If not see |
22 | <http://www.gnu.org/licenses/>. */ | |
8d08fdba MS |
23 | |
24 | ||
25 | /* This file is part of the C++ front end. | |
26 | It contains routines to build C++ expressions given their operands, | |
27 | including computing the types of the result, C and C++ specific error | |
5088b058 | 28 | checks, and some optimization. */ |
8d08fdba MS |
29 | |
30 | #include "config.h" | |
8d052bc7 | 31 | #include "system.h" |
4977bab6 ZW |
32 | #include "coretypes.h" |
33 | #include "tm.h" | |
8d08fdba MS |
34 | #include "tree.h" |
35 | #include "cp-tree.h" | |
36 | #include "flags.h" | |
12027a89 | 37 | #include "toplev.h" |
71144a65 | 38 | #include "output.h" |
2a2b2d43 | 39 | #include "diagnostic.h" |
09357846 | 40 | #include "real.h" |
8d08fdba | 41 | |
4038c495 GB |
42 | static tree |
43 | process_init_constructor (tree type, tree init); | |
44 | ||
8d08fdba | 45 | |
8d08fdba MS |
46 | /* Print an error message stemming from an attempt to use |
47 | BASETYPE as a base class for TYPE. */ | |
e92cc029 | 48 | |
8d08fdba | 49 | tree |
0a8cb79e | 50 | error_not_base_type (tree basetype, tree type) |
8d08fdba MS |
51 | { |
52 | if (TREE_CODE (basetype) == FUNCTION_DECL) | |
4f1c5b7d | 53 | basetype = DECL_CONTEXT (basetype); |
a82e1a7d | 54 | error ("type %qT is not a base type for type %qT", basetype, type); |
8d08fdba MS |
55 | return error_mark_node; |
56 | } | |
57 | ||
58 | tree | |
0a8cb79e | 59 | binfo_or_else (tree base, tree type) |
8d08fdba | 60 | { |
18e4be85 | 61 | tree binfo = lookup_base (type, base, ba_unique, NULL); |
2db1ab2d NS |
62 | |
63 | if (binfo == error_mark_node) | |
64 | return NULL_TREE; | |
65 | else if (!binfo) | |
66 | error_not_base_type (base, type); | |
67 | return binfo; | |
8d08fdba MS |
68 | } |
69 | ||
8d08fdba | 70 | /* According to ARM $7.1.6, "A `const' object may be initialized, but its |
fabb00fc | 71 | value may not be changed thereafter. */ |
e92cc029 | 72 | |
8d08fdba | 73 | void |
fabb00fc | 74 | readonly_error (tree arg, const char* string) |
8d08fdba | 75 | { |
d8e178a0 | 76 | const char *fmt; |
8d08fdba MS |
77 | |
78 | if (TREE_CODE (arg) == COMPONENT_REF) | |
79 | { | |
80 | if (TYPE_READONLY (TREE_TYPE (TREE_OPERAND (arg, 0)))) | |
0cbd7506 | 81 | fmt = "%s of data-member %qD in read-only structure"; |
8d08fdba | 82 | else |
0cbd7506 | 83 | fmt = "%s of read-only data-member %qD"; |
fabb00fc | 84 | error (fmt, string, TREE_OPERAND (arg, 1)); |
8d08fdba MS |
85 | } |
86 | else if (TREE_CODE (arg) == VAR_DECL) | |
87 | { | |
88 | if (DECL_LANG_SPECIFIC (arg) | |
89 | && DECL_IN_AGGR_P (arg) | |
90 | && !TREE_STATIC (arg)) | |
a82e1a7d | 91 | fmt = "%s of constant field %qD"; |
8d08fdba | 92 | else |
a82e1a7d | 93 | fmt = "%s of read-only variable %qD"; |
fabb00fc | 94 | error (fmt, string, arg); |
8d08fdba MS |
95 | } |
96 | else if (TREE_CODE (arg) == PARM_DECL) | |
fabb00fc | 97 | error ("%s of read-only parameter %qD", string, arg); |
8d08fdba | 98 | else if (TREE_CODE (arg) == INDIRECT_REF |
0cbd7506 MS |
99 | && TREE_CODE (TREE_TYPE (TREE_OPERAND (arg, 0))) == REFERENCE_TYPE |
100 | && (TREE_CODE (TREE_OPERAND (arg, 0)) == VAR_DECL | |
101 | || TREE_CODE (TREE_OPERAND (arg, 0)) == PARM_DECL)) | |
fabb00fc | 102 | error ("%s of read-only reference %qD", string, TREE_OPERAND (arg, 0)); |
8d08fdba | 103 | else if (TREE_CODE (arg) == RESULT_DECL) |
fabb00fc | 104 | error ("%s of read-only named return value %qD", string, arg); |
69851283 | 105 | else if (TREE_CODE (arg) == FUNCTION_DECL) |
fabb00fc | 106 | error ("%s of function %qD", string, arg); |
69851283 | 107 | else |
d7705934 | 108 | error ("%s of read-only location %qE", string, arg); |
8d08fdba MS |
109 | } |
110 | ||
7fb213d8 GB |
111 | \f |
112 | /* Structure that holds information about declarations whose type was | |
113 | incomplete and we could not check whether it was abstract or not. */ | |
114 | ||
d1b38208 | 115 | struct GTY((chain_next ("%h.next"))) pending_abstract_type { |
7fb213d8 GB |
116 | /* Declaration which we are checking for abstractness. It is either |
117 | a DECL node, or an IDENTIFIER_NODE if we do not have a full | |
118 | declaration available. */ | |
119 | tree decl; | |
120 | ||
121 | /* Type which will be checked for abstractness. */ | |
122 | tree type; | |
123 | ||
124 | /* Position of the declaration. This is only needed for IDENTIFIER_NODEs, | |
125 | because DECLs already carry locus information. */ | |
126 | location_t locus; | |
127 | ||
128 | /* Link to the next element in list. */ | |
129 | struct pending_abstract_type* next; | |
130 | }; | |
131 | ||
132 | ||
133 | /* Compute the hash value of the node VAL. This function is used by the | |
134 | hash table abstract_pending_vars. */ | |
135 | ||
136 | static hashval_t | |
137 | pat_calc_hash (const void* val) | |
138 | { | |
67f5655f GDR |
139 | const struct pending_abstract_type *pat = |
140 | (const struct pending_abstract_type *) val; | |
7fb213d8 GB |
141 | return (hashval_t) TYPE_UID (pat->type); |
142 | } | |
143 | ||
144 | ||
145 | /* Compare node VAL1 with the type VAL2. This function is used by the | |
146 | hash table abstract_pending_vars. */ | |
147 | ||
148 | static int | |
149 | pat_compare (const void* val1, const void* val2) | |
150 | { | |
741ac903 | 151 | const struct pending_abstract_type *const pat1 = |
67f5655f | 152 | (const struct pending_abstract_type *) val1; |
741ac903 | 153 | const_tree const type2 = (const_tree)val2; |
7fb213d8 GB |
154 | |
155 | return (pat1->type == type2); | |
156 | } | |
157 | ||
158 | /* Hash table that maintains pending_abstract_type nodes, for which we still | |
159 | need to check for type abstractness. The key of the table is the type | |
160 | of the declaration. */ | |
161 | static GTY ((param_is (struct pending_abstract_type))) | |
162 | htab_t abstract_pending_vars = NULL; | |
163 | ||
164 | ||
165 | /* This function is called after TYPE is completed, and will check if there | |
166 | are pending declarations for which we still need to verify the abstractness | |
167 | of TYPE, and emit a diagnostic (through abstract_virtuals_error) if TYPE | |
168 | turned out to be incomplete. */ | |
169 | ||
170 | void | |
171 | complete_type_check_abstract (tree type) | |
172 | { | |
173 | void **slot; | |
174 | struct pending_abstract_type *pat; | |
175 | location_t cur_loc = input_location; | |
176 | ||
50bc768d | 177 | gcc_assert (COMPLETE_TYPE_P (type)); |
7fb213d8 GB |
178 | |
179 | if (!abstract_pending_vars) | |
180 | return; | |
181 | ||
182 | /* Retrieve the list of pending declarations for this type. */ | |
183 | slot = htab_find_slot_with_hash (abstract_pending_vars, type, | |
184 | (hashval_t)TYPE_UID (type), NO_INSERT); | |
185 | if (!slot) | |
186 | return; | |
187 | pat = (struct pending_abstract_type*)*slot; | |
50bc768d | 188 | gcc_assert (pat); |
7fb213d8 GB |
189 | |
190 | /* If the type is not abstract, do not do anything. */ | |
191 | if (CLASSTYPE_PURE_VIRTUALS (type)) | |
192 | { | |
193 | struct pending_abstract_type *prev = 0, *next; | |
194 | ||
195 | /* Reverse the list to emit the errors in top-down order. */ | |
196 | for (; pat; pat = next) | |
197 | { | |
198 | next = pat->next; | |
199 | pat->next = prev; | |
200 | prev = pat; | |
201 | } | |
202 | pat = prev; | |
203 | ||
204 | /* Go through the list, and call abstract_virtuals_error for each | |
77880ae4 | 205 | element: it will issue a diagnostic if the type is abstract. */ |
7fb213d8 GB |
206 | while (pat) |
207 | { | |
50bc768d | 208 | gcc_assert (type == pat->type); |
7fb213d8 GB |
209 | |
210 | /* Tweak input_location so that the diagnostic appears at the correct | |
211 | location. Notice that this is only needed if the decl is an | |
dee15844 | 212 | IDENTIFIER_NODE. */ |
7fb213d8 GB |
213 | input_location = pat->locus; |
214 | abstract_virtuals_error (pat->decl, pat->type); | |
215 | pat = pat->next; | |
216 | } | |
217 | } | |
218 | ||
219 | htab_clear_slot (abstract_pending_vars, slot); | |
220 | ||
221 | input_location = cur_loc; | |
222 | } | |
223 | ||
224 | ||
a7a64a77 MM |
225 | /* If TYPE has abstract virtual functions, issue an error about trying |
226 | to create an object of that type. DECL is the object declared, or | |
227 | NULL_TREE if the declaration is unavailable. Returns 1 if an error | |
228 | occurred; zero if all was well. */ | |
e92cc029 | 229 | |
a7a64a77 | 230 | int |
0a8cb79e | 231 | abstract_virtuals_error (tree decl, tree type) |
8d08fdba | 232 | { |
d4e6fecb | 233 | VEC(tree,gc) *pure; |
c8094d83 | 234 | |
7fb213d8 GB |
235 | /* This function applies only to classes. Any other entity can never |
236 | be abstract. */ | |
237 | if (!CLASS_TYPE_P (type)) | |
238 | return 0; | |
239 | ||
240 | /* If the type is incomplete, we register it within a hash table, | |
241 | so that we can check again once it is completed. This makes sense | |
242 | only for objects for which we have a declaration or at least a | |
243 | name. */ | |
244 | if (!COMPLETE_TYPE_P (type)) | |
245 | { | |
246 | void **slot; | |
247 | struct pending_abstract_type *pat; | |
248 | ||
c8094d83 | 249 | gcc_assert (!decl || DECL_P (decl) |
50bc768d | 250 | || TREE_CODE (decl) == IDENTIFIER_NODE); |
7fb213d8 GB |
251 | |
252 | if (!abstract_pending_vars) | |
c8094d83 | 253 | abstract_pending_vars = htab_create_ggc (31, &pat_calc_hash, |
7fb213d8 GB |
254 | &pat_compare, NULL); |
255 | ||
256 | slot = htab_find_slot_with_hash (abstract_pending_vars, type, | |
257 | (hashval_t)TYPE_UID (type), INSERT); | |
258 | ||
99dd239f | 259 | pat = GGC_NEW (struct pending_abstract_type); |
7fb213d8 GB |
260 | pat->type = type; |
261 | pat->decl = decl; | |
262 | pat->locus = ((decl && DECL_P (decl)) | |
263 | ? DECL_SOURCE_LOCATION (decl) | |
264 | : input_location); | |
265 | ||
67f5655f | 266 | pat->next = (struct pending_abstract_type *) *slot; |
7fb213d8 GB |
267 | *slot = pat; |
268 | ||
269 | return 0; | |
270 | } | |
271 | ||
e60505a5 NS |
272 | if (!TYPE_SIZE (type)) |
273 | /* TYPE is being defined, and during that time | |
274 | CLASSTYPE_PURE_VIRTUALS holds the inline friends. */ | |
275 | return 0; | |
276 | ||
585b44d3 NS |
277 | pure = CLASSTYPE_PURE_VIRTUALS (type); |
278 | if (!pure) | |
279 | return 0; | |
280 | ||
8d08fdba MS |
281 | if (decl) |
282 | { | |
283 | if (TREE_CODE (decl) == RESULT_DECL) | |
a7a64a77 | 284 | return 0; |
8d08fdba MS |
285 | |
286 | if (TREE_CODE (decl) == VAR_DECL) | |
dee15844 JM |
287 | error ("cannot declare variable %q+D to be of abstract " |
288 | "type %qT", decl, type); | |
8d08fdba | 289 | else if (TREE_CODE (decl) == PARM_DECL) |
dee15844 JM |
290 | error ("cannot declare parameter %q+D to be of abstract type %qT", |
291 | decl, type); | |
8d08fdba | 292 | else if (TREE_CODE (decl) == FIELD_DECL) |
dee15844 JM |
293 | error ("cannot declare field %q+D to be of abstract type %qT", |
294 | decl, type); | |
8d08fdba MS |
295 | else if (TREE_CODE (decl) == FUNCTION_DECL |
296 | && TREE_CODE (TREE_TYPE (decl)) == METHOD_TYPE) | |
dee15844 | 297 | error ("invalid abstract return type for member function %q+#D", decl); |
8d08fdba | 298 | else if (TREE_CODE (decl) == FUNCTION_DECL) |
dee15844 | 299 | error ("invalid abstract return type for function %q+#D", decl); |
7fb213d8 | 300 | else if (TREE_CODE (decl) == IDENTIFIER_NODE) |
dee15844 | 301 | /* Here we do not have location information. */ |
a82e1a7d | 302 | error ("invalid abstract type %qT for %qE", type, decl); |
da291c87 | 303 | else |
dee15844 | 304 | error ("invalid abstract type for %q+D", decl); |
8d08fdba | 305 | } |
4a67c9e9 | 306 | else |
a82e1a7d | 307 | error ("cannot allocate an object of abstract type %qT", type); |
4a67c9e9 | 308 | |
8d08fdba | 309 | /* Only go through this once. */ |
585b44d3 | 310 | if (VEC_length (tree, pure)) |
8d08fdba | 311 | { |
585b44d3 NS |
312 | unsigned ix; |
313 | tree fn; | |
c8094d83 | 314 | |
c5d75364 MLI |
315 | inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type)), |
316 | " because the following virtual functions are pure within %qT:", | |
317 | type); | |
da291c87 | 318 | |
585b44d3 | 319 | for (ix = 0; VEC_iterate (tree, pure, ix, fn); ix++) |
1f5b3869 | 320 | inform (input_location, "\t%+#D", fn); |
585b44d3 | 321 | /* Now truncate the vector. This leaves it non-null, so we know |
0cbd7506 MS |
322 | there are pure virtuals, but empty so we don't list them out |
323 | again. */ | |
585b44d3 | 324 | VEC_truncate (tree, pure, 0); |
8d08fdba | 325 | } |
4a67c9e9 | 326 | else |
c5d75364 MLI |
327 | inform (DECL_SOURCE_LOCATION (TYPE_MAIN_DECL (type)), |
328 | " since type %qT has pure virtual functions", | |
329 | type); | |
a7a64a77 MM |
330 | |
331 | return 1; | |
8d08fdba MS |
332 | } |
333 | ||
8d08fdba MS |
334 | /* Print an error message for invalid use of an incomplete type. |
335 | VALUE is the expression that was used (or 0 if that isn't known) | |
71205d17 MLI |
336 | and TYPE is the type that was invalid. DIAG_KIND indicates the |
337 | type of diagnostic (see diagnostic.def). */ | |
8d08fdba MS |
338 | |
339 | void | |
71205d17 MLI |
340 | cxx_incomplete_type_diagnostic (const_tree value, const_tree type, |
341 | diagnostic_t diag_kind) | |
8d08fdba | 342 | { |
146c8d60 | 343 | int decl = 0; |
23b4deba | 344 | |
71205d17 MLI |
345 | gcc_assert (diag_kind == DK_WARNING |
346 | || diag_kind == DK_PEDWARN | |
347 | || diag_kind == DK_ERROR); | |
c8094d83 | 348 | |
8d08fdba MS |
349 | /* Avoid duplicate error message. */ |
350 | if (TREE_CODE (type) == ERROR_MARK) | |
351 | return; | |
352 | ||
146c8d60 | 353 | if (value != 0 && (TREE_CODE (value) == VAR_DECL |
17f29637 KL |
354 | || TREE_CODE (value) == PARM_DECL |
355 | || TREE_CODE (value) == FIELD_DECL)) | |
146c8d60 | 356 | { |
71205d17 MLI |
357 | emit_diagnostic (diag_kind, input_location, 0, |
358 | "%q+D has incomplete type", value); | |
146c8d60 NS |
359 | decl = 1; |
360 | } | |
315fb5db | 361 | retry: |
66543169 NS |
362 | /* We must print an error message. Be clever about what it says. */ |
363 | ||
364 | switch (TREE_CODE (type)) | |
8d08fdba | 365 | { |
66543169 NS |
366 | case RECORD_TYPE: |
367 | case UNION_TYPE: | |
368 | case ENUMERAL_TYPE: | |
146c8d60 | 369 | if (!decl) |
71205d17 MLI |
370 | emit_diagnostic (diag_kind, input_location, 0, |
371 | "invalid use of incomplete type %q#T", type); | |
17f29637 | 372 | if (!TYPE_TEMPLATE_INFO (type)) |
71205d17 MLI |
373 | emit_diagnostic (diag_kind, input_location, 0, |
374 | "forward declaration of %q+#T", type); | |
17f29637 | 375 | else |
71205d17 MLI |
376 | emit_diagnostic (diag_kind, input_location, 0, |
377 | "declaration of %q+#T", type); | |
66543169 NS |
378 | break; |
379 | ||
380 | case VOID_TYPE: | |
71205d17 MLI |
381 | emit_diagnostic (diag_kind, input_location, 0, |
382 | "invalid use of %qT", type); | |
66543169 NS |
383 | break; |
384 | ||
385 | case ARRAY_TYPE: | |
386 | if (TYPE_DOMAIN (type)) | |
0cbd7506 MS |
387 | { |
388 | type = TREE_TYPE (type); | |
389 | goto retry; | |
390 | } | |
71205d17 MLI |
391 | emit_diagnostic (diag_kind, input_location, 0, |
392 | "invalid use of array with unspecified bounds"); | |
66543169 NS |
393 | break; |
394 | ||
395 | case OFFSET_TYPE: | |
396 | bad_member: | |
71205d17 MLI |
397 | emit_diagnostic (diag_kind, input_location, 0, |
398 | "invalid use of member (did you forget the %<&%> ?)"); | |
66543169 NS |
399 | break; |
400 | ||
401 | case TEMPLATE_TYPE_PARM: | |
86a09a9e JM |
402 | if (is_auto (type)) |
403 | emit_diagnostic (diag_kind, input_location, 0, | |
404 | "invalid use of %<auto%>"); | |
405 | else | |
406 | emit_diagnostic (diag_kind, input_location, 0, | |
407 | "invalid use of template type parameter %qT", type); | |
7acf7efa VR |
408 | break; |
409 | ||
410 | case BOUND_TEMPLATE_TEMPLATE_PARM: | |
71205d17 MLI |
411 | emit_diagnostic (diag_kind, input_location, 0, |
412 | "invalid use of template template parameter %qT", | |
413 | TYPE_NAME (type)); | |
66543169 NS |
414 | break; |
415 | ||
8fcd79cb | 416 | case TYPENAME_TYPE: |
71205d17 MLI |
417 | emit_diagnostic (diag_kind, input_location, 0, |
418 | "invalid use of dependent type %qT", type); | |
8fcd79cb MM |
419 | break; |
420 | ||
66543169 NS |
421 | case UNKNOWN_TYPE: |
422 | if (value && TREE_CODE (value) == COMPONENT_REF) | |
0cbd7506 | 423 | goto bad_member; |
66543169 | 424 | else if (value && TREE_CODE (value) == ADDR_EXPR) |
71205d17 MLI |
425 | emit_diagnostic (diag_kind, input_location, 0, |
426 | "address of overloaded function with no contextual " | |
427 | "type information"); | |
66543169 | 428 | else if (value && TREE_CODE (value) == OVERLOAD) |
71205d17 MLI |
429 | emit_diagnostic (diag_kind, input_location, 0, |
430 | "overloaded function with no contextual type information"); | |
66543169 | 431 | else |
71205d17 MLI |
432 | emit_diagnostic (diag_kind, input_location, 0, |
433 | "insufficient contextual information to determine type"); | |
66543169 | 434 | break; |
c8094d83 | 435 | |
66543169 | 436 | default: |
315fb5db | 437 | gcc_unreachable (); |
8d08fdba MS |
438 | } |
439 | } | |
440 | ||
23b4deba AO |
441 | /* Backward-compatibility interface to incomplete_type_diagnostic; |
442 | required by ../tree.c. */ | |
443 | #undef cxx_incomplete_type_error | |
444 | void | |
ac7d7749 | 445 | cxx_incomplete_type_error (const_tree value, const_tree type) |
23b4deba | 446 | { |
71205d17 | 447 | cxx_incomplete_type_diagnostic (value, type, DK_ERROR); |
23b4deba AO |
448 | } |
449 | ||
8d08fdba | 450 | \f |
25ebb82a | 451 | /* The recursive part of split_nonconstant_init. DEST is an lvalue |
325c3691 | 452 | expression to which INIT should be assigned. INIT is a CONSTRUCTOR. */ |
25ebb82a | 453 | |
325c3691 RH |
454 | static void |
455 | split_nonconstant_init_1 (tree dest, tree init) | |
25ebb82a | 456 | { |
4038c495 GB |
457 | unsigned HOST_WIDE_INT idx; |
458 | tree field_index, value; | |
459 | tree type = TREE_TYPE (dest); | |
460 | tree inner_type = NULL; | |
25ebb82a RH |
461 | bool array_type_p = false; |
462 | ||
25ebb82a RH |
463 | switch (TREE_CODE (type)) |
464 | { | |
465 | case ARRAY_TYPE: | |
466 | inner_type = TREE_TYPE (type); | |
467 | array_type_p = true; | |
468 | /* FALLTHRU */ | |
469 | ||
470 | case RECORD_TYPE: | |
471 | case UNION_TYPE: | |
472 | case QUAL_UNION_TYPE: | |
4038c495 GB |
473 | FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (init), idx, |
474 | field_index, value) | |
25ebb82a | 475 | { |
4038c495 GB |
476 | /* The current implementation of this algorithm assumes that |
477 | the field was set for all the elements. This is usually done | |
478 | by process_init_constructor. */ | |
479 | gcc_assert (field_index); | |
25ebb82a RH |
480 | |
481 | if (!array_type_p) | |
482 | inner_type = TREE_TYPE (field_index); | |
483 | ||
484 | if (TREE_CODE (value) == CONSTRUCTOR) | |
485 | { | |
4038c495 GB |
486 | tree sub; |
487 | ||
25ebb82a | 488 | if (array_type_p) |
0cbd7506 | 489 | sub = build4 (ARRAY_REF, inner_type, dest, field_index, |
f293ce4b | 490 | NULL_TREE, NULL_TREE); |
25ebb82a | 491 | else |
0cbd7506 | 492 | sub = build3 (COMPONENT_REF, inner_type, dest, field_index, |
f293ce4b | 493 | NULL_TREE); |
25ebb82a | 494 | |
325c3691 | 495 | split_nonconstant_init_1 (sub, value); |
25ebb82a RH |
496 | } |
497 | else if (!initializer_constant_valid_p (value, inner_type)) | |
498 | { | |
4038c495 GB |
499 | tree code; |
500 | tree sub; | |
501 | ||
502 | /* FIXME: Ordered removal is O(1) so the whole function is | |
503 | worst-case quadratic. This could be fixed using an aside | |
504 | bitmap to record which elements must be removed and remove | |
505 | them all at the same time. Or by merging | |
506 | split_non_constant_init into process_init_constructor_array, | |
507 | that is separating constants from non-constants while building | |
508 | the vector. */ | |
509 | VEC_ordered_remove (constructor_elt, CONSTRUCTOR_ELTS (init), | |
510 | idx); | |
511 | --idx; | |
25ebb82a RH |
512 | |
513 | if (array_type_p) | |
0cbd7506 | 514 | sub = build4 (ARRAY_REF, inner_type, dest, field_index, |
f293ce4b | 515 | NULL_TREE, NULL_TREE); |
25ebb82a | 516 | else |
0cbd7506 | 517 | sub = build3 (COMPONENT_REF, inner_type, dest, field_index, |
f293ce4b | 518 | NULL_TREE); |
25ebb82a | 519 | |
dae7ec87 | 520 | code = build2 (INIT_EXPR, inner_type, sub, value); |
c2255bc4 | 521 | code = build_stmt (input_location, EXPR_STMT, code); |
325c3691 | 522 | add_stmt (code); |
25ebb82a RH |
523 | continue; |
524 | } | |
25ebb82a RH |
525 | } |
526 | break; | |
527 | ||
528 | case VECTOR_TYPE: | |
529 | if (!initializer_constant_valid_p (init, type)) | |
530 | { | |
4038c495 | 531 | tree code; |
74aad7cc | 532 | tree cons = copy_node (init); |
25ebb82a | 533 | CONSTRUCTOR_ELTS (init) = NULL; |
74aad7cc | 534 | code = build2 (MODIFY_EXPR, type, dest, cons); |
c2255bc4 | 535 | code = build_stmt (input_location, EXPR_STMT, code); |
325c3691 | 536 | add_stmt (code); |
25ebb82a RH |
537 | } |
538 | break; | |
539 | ||
540 | default: | |
315fb5db | 541 | gcc_unreachable (); |
25ebb82a | 542 | } |
b7af94d8 CL |
543 | |
544 | /* The rest of the initializer is now a constant. */ | |
545 | TREE_CONSTANT (init) = 1; | |
25ebb82a RH |
546 | } |
547 | ||
c8094d83 | 548 | /* A subroutine of store_init_value. Splits non-constant static |
25ebb82a RH |
549 | initializer INIT into a constant part and generates code to |
550 | perform the non-constant part of the initialization to DEST. | |
551 | Returns the code for the runtime init. */ | |
552 | ||
553 | static tree | |
554 | split_nonconstant_init (tree dest, tree init) | |
555 | { | |
556 | tree code; | |
557 | ||
558 | if (TREE_CODE (init) == CONSTRUCTOR) | |
559 | { | |
325c3691 RH |
560 | code = push_stmt_list (); |
561 | split_nonconstant_init_1 (dest, init); | |
562 | code = pop_stmt_list (code); | |
25ebb82a | 563 | DECL_INITIAL (dest) = init; |
6407bc67 | 564 | TREE_READONLY (dest) = 0; |
25ebb82a RH |
565 | } |
566 | else | |
f293ce4b | 567 | code = build2 (INIT_EXPR, TREE_TYPE (dest), dest, init); |
25ebb82a RH |
568 | |
569 | return code; | |
570 | } | |
571 | ||
8d08fdba MS |
572 | /* Perform appropriate conversions on the initial value of a variable, |
573 | store it in the declaration DECL, | |
574 | and print any error messages that are appropriate. | |
575 | If the init is invalid, store an ERROR_MARK. | |
576 | ||
577 | C++: Note that INIT might be a TREE_LIST, which would mean that it is | |
578 | a base class initializer for some aggregate type, hopefully compatible | |
579 | with DECL. If INIT is a single element, and DECL is an aggregate | |
580 | type, we silently convert INIT into a TREE_LIST, allowing a constructor | |
581 | to be called. | |
582 | ||
583 | If INIT is a TREE_LIST and there is no constructor, turn INIT | |
584 | into a CONSTRUCTOR and use standard initialization techniques. | |
585 | Perhaps a warning should be generated? | |
586 | ||
25ebb82a RH |
587 | Returns code to be executed if initialization could not be performed |
588 | for static variable. In that case, caller must emit the code. */ | |
8d08fdba MS |
589 | |
590 | tree | |
e57d93c6 | 591 | store_init_value (tree decl, tree init, int flags) |
8d08fdba | 592 | { |
926ce8bd | 593 | tree value, type; |
8d08fdba MS |
594 | |
595 | /* If variable's type was invalidly declared, just ignore it. */ | |
596 | ||
597 | type = TREE_TYPE (decl); | |
598 | if (TREE_CODE (type) == ERROR_MARK) | |
599 | return NULL_TREE; | |
600 | ||
9e1e64ec | 601 | if (MAYBE_CLASS_TYPE_P (type)) |
8d08fdba | 602 | { |
315fb5db NS |
603 | gcc_assert (TYPE_HAS_TRIVIAL_INIT_REF (type) |
604 | || TREE_CODE (init) == CONSTRUCTOR); | |
e8abc66f | 605 | |
6eabb241 | 606 | if (TREE_CODE (init) == TREE_LIST) |
8d08fdba | 607 | { |
a82e1a7d | 608 | error ("constructor syntax used, but no constructor declared " |
0cbd7506 | 609 | "for type %qT", type); |
09357846 | 610 | init = build_constructor_from_list (init_list_type_node, nreverse (init)); |
8d08fdba | 611 | } |
8d08fdba MS |
612 | } |
613 | else if (TREE_CODE (init) == TREE_LIST | |
614 | && TREE_TYPE (init) != unknown_type_node) | |
615 | { | |
616 | if (TREE_CODE (decl) == RESULT_DECL) | |
c7b62f14 NS |
617 | init = build_x_compound_expr_from_list (init, |
618 | "return value initializer"); | |
8d08fdba MS |
619 | else if (TREE_CODE (init) == TREE_LIST |
620 | && TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) | |
621 | { | |
8251199e | 622 | error ("cannot initialize arrays using this syntax"); |
8d08fdba MS |
623 | return NULL_TREE; |
624 | } | |
625 | else | |
c7b62f14 NS |
626 | /* We get here with code like `int a (2);' */ |
627 | init = build_x_compound_expr_from_list (init, "initializer"); | |
8d08fdba MS |
628 | } |
629 | ||
630 | /* End of special C++ code. */ | |
631 | ||
8e3df2de | 632 | /* Digest the specified initializer into an expression. */ |
e57d93c6 | 633 | value = digest_init_flags (type, init, flags); |
80439563 MM |
634 | /* If the initializer is not a constant, fill in DECL_INITIAL with |
635 | the bits that are constant, and then return an expression that | |
636 | will perform the dynamic initialization. */ | |
637 | if (value != error_mark_node | |
638 | && (TREE_SIDE_EFFECTS (value) | |
639 | || ! initializer_constant_valid_p (value, TREE_TYPE (value)))) | |
25ebb82a | 640 | return split_nonconstant_init (decl, value); |
80439563 MM |
641 | /* If the value is a constant, just put it in DECL_INITIAL. If DECL |
642 | is an automatic variable, the middle end will turn this into a | |
643 | dynamic initialization later. */ | |
8d08fdba MS |
644 | DECL_INITIAL (decl) = value; |
645 | return NULL_TREE; | |
646 | } | |
94e6e4c4 | 647 | |
8d08fdba | 648 | \f |
09357846 JM |
649 | /* Give errors about narrowing conversions within { }. */ |
650 | ||
651 | void | |
652 | check_narrowing (tree type, tree init) | |
653 | { | |
2d727f75 | 654 | tree ftype = unlowered_expr_type (init); |
09357846 JM |
655 | bool ok = true; |
656 | REAL_VALUE_TYPE d; | |
a53b09fa | 657 | bool was_decl = false; |
09357846 JM |
658 | |
659 | if (DECL_P (init)) | |
a53b09fa JM |
660 | { |
661 | was_decl = true; | |
662 | init = decl_constant_value (init); | |
663 | } | |
09357846 JM |
664 | |
665 | if (TREE_CODE (type) == INTEGER_TYPE | |
666 | && TREE_CODE (ftype) == REAL_TYPE) | |
667 | ok = false; | |
668 | else if (INTEGRAL_OR_ENUMERATION_TYPE_P (ftype) | |
669 | && CP_INTEGRAL_TYPE_P (type)) | |
670 | { | |
671 | if (TYPE_PRECISION (type) < TYPE_PRECISION (ftype) | |
672 | && (TREE_CODE (init) != INTEGER_CST | |
673 | || !int_fits_type_p (init, type))) | |
674 | ok = false; | |
675 | } | |
676 | else if (TREE_CODE (ftype) == REAL_TYPE | |
677 | && TREE_CODE (type) == REAL_TYPE) | |
678 | { | |
679 | if (TYPE_PRECISION (type) < TYPE_PRECISION (ftype)) | |
680 | { | |
09357846 JM |
681 | if (TREE_CODE (init) == REAL_CST) |
682 | { | |
72258929 JM |
683 | /* Issue 703: Loss of precision is OK as long as the value is |
684 | within the representable range of the new type. */ | |
685 | REAL_VALUE_TYPE r; | |
09357846 | 686 | d = TREE_REAL_CST (init); |
72258929 JM |
687 | real_convert (&r, TYPE_MODE (type), &d); |
688 | if (real_isinf (&r)) | |
689 | ok = false; | |
09357846 | 690 | } |
72258929 JM |
691 | else |
692 | ok = false; | |
09357846 JM |
693 | } |
694 | } | |
695 | else if (INTEGRAL_OR_ENUMERATION_TYPE_P (ftype) | |
696 | && TREE_CODE (type) == REAL_TYPE) | |
697 | { | |
698 | ok = false; | |
699 | if (TREE_CODE (init) == INTEGER_CST) | |
700 | { | |
701 | d = real_value_from_int_cst (0, init); | |
702 | if (exact_real_truncate (TYPE_MODE (type), &d)) | |
703 | ok = true; | |
704 | } | |
705 | } | |
706 | ||
707 | if (!ok) | |
2d727f75 JM |
708 | permerror (input_location, "narrowing conversion of %qE from %qT to %qT inside { }", |
709 | init, ftype, type); | |
09357846 JM |
710 | } |
711 | ||
4038c495 GB |
712 | /* Process the initializer INIT for a variable of type TYPE, emitting |
713 | diagnostics for invalid initializers and converting the initializer as | |
714 | appropriate. | |
8d08fdba | 715 | |
4038c495 | 716 | For aggregate types, it assumes that reshape_init has already run, thus the |
09357846 | 717 | initializer will have the right shape (brace elision has been undone). |
8d08fdba | 718 | |
09357846 JM |
719 | NESTED is true iff we are being called for an element of a CONSTRUCTOR. */ |
720 | ||
721 | static tree | |
e57d93c6 | 722 | digest_init_r (tree type, tree init, bool nested, int flags) |
8d08fdba MS |
723 | { |
724 | enum tree_code code = TREE_CODE (type); | |
8d08fdba | 725 | |
4038c495 | 726 | if (init == error_mark_node) |
8d08fdba MS |
727 | return error_mark_node; |
728 | ||
4038c495 | 729 | gcc_assert (init); |
b8b98c66 NS |
730 | |
731 | /* We must strip the outermost array type when completing the type, | |
732 | because the its bounds might be incomplete at the moment. */ | |
733 | if (!complete_type_or_else (TREE_CODE (type) == ARRAY_TYPE | |
734 | ? TREE_TYPE (type) : type, NULL_TREE)) | |
735 | return error_mark_node; | |
c8094d83 | 736 | |
4038c495 GB |
737 | /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue |
738 | (g++.old-deja/g++.law/casts2.C). */ | |
8d08fdba MS |
739 | if (TREE_CODE (init) == NON_LVALUE_EXPR) |
740 | init = TREE_OPERAND (init, 0); | |
741 | ||
4038c495 GB |
742 | /* Initialization of an array of chars from a string constant. The initializer |
743 | can be optionally enclosed in braces, but reshape_init has already removed | |
744 | them if they were present. */ | |
8d08fdba MS |
745 | if (code == ARRAY_TYPE) |
746 | { | |
4038c495 | 747 | tree typ1 = TYPE_MAIN_VARIANT (TREE_TYPE (type)); |
7b019c19 | 748 | if (char_type_p (typ1) |
4038c495 GB |
749 | /*&& init */ |
750 | && TREE_CODE (init) == STRING_CST) | |
8d08fdba | 751 | { |
4038c495 | 752 | tree char_type = TYPE_MAIN_VARIANT (TREE_TYPE (TREE_TYPE (init))); |
8d08fdba | 753 | |
c466b2cd | 754 | if (TYPE_PRECISION (typ1) == BITS_PER_UNIT) |
8d08fdba | 755 | { |
c466b2cd KVH |
756 | if (char_type != char_type_node) |
757 | { | |
758 | error ("char-array initialized from wide string"); | |
759 | return error_mark_node; | |
760 | } | |
8d08fdba | 761 | } |
c466b2cd | 762 | else |
8d08fdba | 763 | { |
c466b2cd KVH |
764 | if (char_type == char_type_node) |
765 | { | |
766 | error ("int-array initialized from non-wide string"); | |
767 | return error_mark_node; | |
768 | } | |
769 | else if (char_type != typ1) | |
770 | { | |
771 | error ("int-array initialized from incompatible wide string"); | |
772 | return error_mark_node; | |
773 | } | |
8d08fdba MS |
774 | } |
775 | ||
4038c495 GB |
776 | TREE_TYPE (init) = type; |
777 | if (TYPE_DOMAIN (type) != 0 && TREE_CONSTANT (TYPE_SIZE (type))) | |
8d08fdba | 778 | { |
926ce8bd | 779 | int size = TREE_INT_CST_LOW (TYPE_SIZE (type)); |
8d08fdba MS |
780 | size = (size + BITS_PER_UNIT - 1) / BITS_PER_UNIT; |
781 | /* In C it is ok to subtract 1 from the length of the string | |
782 | because it's ok to ignore the terminating null char that is | |
783 | counted in the length of the constant, but in C++ this would | |
784 | be invalid. */ | |
4038c495 | 785 | if (size < TREE_STRING_LENGTH (init)) |
cbe5f3b3 | 786 | permerror (input_location, "initializer-string for array of chars is too long"); |
8d08fdba | 787 | } |
4038c495 | 788 | return init; |
8d08fdba MS |
789 | } |
790 | } | |
791 | ||
3c955a04 | 792 | /* Handle scalar types (including conversions) and references. */ |
a36c33eb JJ |
793 | if ((TREE_CODE (type) != COMPLEX_TYPE |
794 | || BRACE_ENCLOSED_INITIALIZER_P (init)) | |
b8063b29 | 795 | && (SCALAR_TYPE_P (type) || code == REFERENCE_TYPE)) |
6524147c OW |
796 | { |
797 | tree *exp; | |
798 | ||
09357846 JM |
799 | if (cxx_dialect != cxx98 && nested) |
800 | check_narrowing (type, init); | |
e57d93c6 | 801 | init = convert_for_initialization (0, type, init, flags, |
5ade1ed2 | 802 | "initialization", NULL_TREE, 0, |
e57d93c6 | 803 | tf_warning_or_error); |
6524147c OW |
804 | exp = &init; |
805 | ||
806 | /* Skip any conversions since we'll be outputting the underlying | |
807 | constant. */ | |
63a906f0 | 808 | while (CONVERT_EXPR_P (*exp) |
6524147c OW |
809 | || TREE_CODE (*exp) == NON_LVALUE_EXPR) |
810 | exp = &TREE_OPERAND (*exp, 0); | |
811 | ||
812 | *exp = cplus_expand_constant (*exp); | |
813 | ||
814 | return init; | |
815 | } | |
4038c495 GB |
816 | |
817 | /* Come here only for aggregates: records, arrays, unions, complex numbers | |
818 | and vectors. */ | |
819 | gcc_assert (TREE_CODE (type) == ARRAY_TYPE | |
820 | || TREE_CODE (type) == VECTOR_TYPE | |
821 | || TREE_CODE (type) == RECORD_TYPE | |
822 | || TREE_CODE (type) == UNION_TYPE | |
823 | || TREE_CODE (type) == COMPLEX_TYPE); | |
824 | ||
fc94bfc5 JM |
825 | if (BRACE_ENCLOSED_INITIALIZER_P (init) |
826 | && !TYPE_NON_AGGREGATE_CLASS (type)) | |
09357846 | 827 | return process_init_constructor (type, init); |
4038c495 | 828 | else |
8d08fdba | 829 | { |
3b2db49f | 830 | if (COMPOUND_LITERAL_P (init) && TREE_CODE (type) == ARRAY_TYPE) |
8d08fdba | 831 | { |
4038c495 GB |
832 | error ("cannot initialize aggregate of type %qT with " |
833 | "a compound literal", type); | |
8d08fdba | 834 | |
4038c495 GB |
835 | return error_mark_node; |
836 | } | |
8e76c2bf MS |
837 | |
838 | if (TREE_CODE (type) == ARRAY_TYPE | |
839 | && TREE_CODE (init) != CONSTRUCTOR) | |
840 | { | |
d5f4eddd JM |
841 | /* Allow the result of build_array_copy. */ |
842 | if (TREE_CODE (init) == TARGET_EXPR | |
843 | && (same_type_ignoring_top_level_qualifiers_p | |
844 | (type, TREE_TYPE (init)))) | |
845 | return init; | |
846 | ||
8e76c2bf MS |
847 | error ("array must be initialized with a brace-enclosed" |
848 | " initializer"); | |
849 | return error_mark_node; | |
850 | } | |
851 | ||
4038c495 | 852 | return convert_for_initialization (NULL_TREE, type, init, |
e57d93c6 | 853 | flags, |
5ade1ed2 DG |
854 | "initialization", NULL_TREE, 0, |
855 | tf_warning_or_error); | |
8d08fdba | 856 | } |
4038c495 GB |
857 | } |
858 | ||
09357846 JM |
859 | tree |
860 | digest_init (tree type, tree init) | |
861 | { | |
e57d93c6 JM |
862 | return digest_init_r (type, init, false, LOOKUP_IMPLICIT); |
863 | } | |
864 | ||
865 | tree | |
866 | digest_init_flags (tree type, tree init, int flags) | |
867 | { | |
868 | return digest_init_r (type, init, false, flags); | |
09357846 | 869 | } |
4038c495 GB |
870 | \f |
871 | /* Set of flags used within process_init_constructor to describe the | |
872 | initializers. */ | |
873 | #define PICFLAG_ERRONEOUS 1 | |
874 | #define PICFLAG_NOT_ALL_CONSTANT 2 | |
875 | #define PICFLAG_NOT_ALL_SIMPLE 4 | |
876 | ||
877 | /* Given an initializer INIT, return the flag (PICFLAG_*) which better | |
878 | describe it. */ | |
879 | ||
880 | static int | |
881 | picflag_from_initializer (tree init) | |
882 | { | |
883 | if (init == error_mark_node) | |
884 | return PICFLAG_ERRONEOUS; | |
885 | else if (!TREE_CONSTANT (init)) | |
886 | return PICFLAG_NOT_ALL_CONSTANT; | |
887 | else if (!initializer_constant_valid_p (init, TREE_TYPE (init))) | |
888 | return PICFLAG_NOT_ALL_SIMPLE; | |
889 | return 0; | |
890 | } | |
8d08fdba | 891 | |
4038c495 | 892 | /* Subroutine of process_init_constructor, which will process an initializer |
d732e98f KH |
893 | INIT for an array or vector of type TYPE. Returns the flags (PICFLAG_*) |
894 | which describe the initializers. */ | |
8d08fdba | 895 | |
4038c495 GB |
896 | static int |
897 | process_init_constructor_array (tree type, tree init) | |
898 | { | |
899 | unsigned HOST_WIDE_INT i, len = 0; | |
900 | int flags = 0; | |
901 | bool unbounded = false; | |
902 | constructor_elt *ce; | |
903 | VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (init); | |
904 | ||
905 | gcc_assert (TREE_CODE (type) == ARRAY_TYPE | |
906 | || TREE_CODE (type) == VECTOR_TYPE); | |
907 | ||
908 | if (TREE_CODE (type) == ARRAY_TYPE) | |
8d08fdba | 909 | { |
4038c495 GB |
910 | tree domain = TYPE_DOMAIN (type); |
911 | if (domain) | |
912 | len = (TREE_INT_CST_LOW (TYPE_MAX_VALUE (domain)) | |
913 | - TREE_INT_CST_LOW (TYPE_MIN_VALUE (domain)) | |
914 | + 1); | |
915 | else | |
916 | unbounded = true; /* Take as many as there are. */ | |
8d08fdba | 917 | } |
4038c495 GB |
918 | else |
919 | /* Vectors are like simple fixed-size arrays. */ | |
920 | len = TYPE_VECTOR_SUBPARTS (type); | |
8d08fdba | 921 | |
25357d1e JM |
922 | /* There must not be more initializers than needed. */ |
923 | if (!unbounded && VEC_length (constructor_elt, v) > len) | |
924 | error ("too many initializers for %qT", type); | |
4038c495 GB |
925 | |
926 | for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i) | |
8d08fdba | 927 | { |
4038c495 | 928 | if (ce->index) |
8d08fdba | 929 | { |
4038c495 GB |
930 | gcc_assert (TREE_CODE (ce->index) == INTEGER_CST); |
931 | if (compare_tree_int (ce->index, i) != 0) | |
e135a637 SE |
932 | { |
933 | ce->value = error_mark_node; | |
934 | sorry ("non-trivial designated initializers not supported"); | |
935 | } | |
8d08fdba | 936 | } |
4038c495 GB |
937 | else |
938 | ce->index = size_int (i); | |
939 | gcc_assert (ce->value); | |
e57d93c6 | 940 | ce->value = digest_init_r (TREE_TYPE (type), ce->value, true, LOOKUP_IMPLICIT); |
d22c8596 | 941 | |
4038c495 GB |
942 | if (ce->value != error_mark_node) |
943 | gcc_assert (same_type_ignoring_top_level_qualifiers_p | |
944 | (TREE_TYPE (type), TREE_TYPE (ce->value))); | |
dc26f471 | 945 | |
4038c495 | 946 | flags |= picflag_from_initializer (ce->value); |
8d08fdba MS |
947 | } |
948 | ||
4038c495 GB |
949 | /* No more initializers. If the array is unbounded, we are done. Otherwise, |
950 | we must add initializers ourselves. */ | |
951 | if (!unbounded) | |
952 | for (; i < len; ++i) | |
953 | { | |
954 | tree next; | |
955 | ||
956 | if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (type))) | |
957 | { | |
958 | /* If this type needs constructors run for default-initialization, | |
3b426391 | 959 | we can't rely on the back end to do it for us, so build up |
4038c495 GB |
960 | TARGET_EXPRs. If the type in question is a class, just build |
961 | one up; if it's an array, recurse. */ | |
9e1e64ec | 962 | if (MAYBE_CLASS_TYPE_P (TREE_TYPE (type))) |
5ade1ed2 DG |
963 | next = build_functional_cast (TREE_TYPE (type), NULL_TREE, |
964 | tf_warning_or_error); | |
4038c495 | 965 | else |
09357846 | 966 | next = build_constructor (init_list_type_node, NULL); |
4038c495 GB |
967 | next = digest_init (TREE_TYPE (type), next); |
968 | } | |
969 | else if (!zero_init_p (TREE_TYPE (type))) | |
970 | next = build_zero_init (TREE_TYPE (type), | |
971 | /*nelts=*/NULL_TREE, | |
972 | /*static_storage_p=*/false); | |
973 | else | |
974 | /* The default zero-initialization is fine for us; don't | |
975 | add anything to the CONSTRUCTOR. */ | |
976 | break; | |
977 | ||
3db45ab5 | 978 | flags |= picflag_from_initializer (next); |
4038c495 GB |
979 | CONSTRUCTOR_APPEND_ELT (v, size_int (i), next); |
980 | } | |
981 | ||
982 | CONSTRUCTOR_ELTS (init) = v; | |
983 | return flags; | |
8d08fdba | 984 | } |
8d08fdba | 985 | |
4038c495 GB |
986 | /* Subroutine of process_init_constructor, which will process an initializer |
987 | INIT for a class of type TYPE. Returns the flags (PICFLAG_*) which describe | |
988 | the initializers. */ | |
8d08fdba | 989 | |
4038c495 GB |
990 | static int |
991 | process_init_constructor_record (tree type, tree init) | |
8d08fdba | 992 | { |
4038c495 GB |
993 | VEC(constructor_elt,gc) *v = NULL; |
994 | int flags = 0; | |
995 | tree field; | |
996 | unsigned HOST_WIDE_INT idx = 0; | |
997 | ||
998 | gcc_assert (TREE_CODE (type) == RECORD_TYPE); | |
999 | gcc_assert (!CLASSTYPE_VBASECLASSES (type)); | |
1000 | gcc_assert (!TYPE_BINFO (type) | |
1001 | || !BINFO_N_BASE_BINFOS (TYPE_BINFO (type))); | |
1002 | gcc_assert (!TYPE_POLYMORPHIC_P (type)); | |
1003 | ||
1004 | /* Generally, we will always have an index for each initializer (which is | |
1005 | a FIELD_DECL, put by reshape_init), but compound literals don't go trough | |
1006 | reshape_init. So we need to handle both cases. */ | |
1007 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) | |
8d08fdba | 1008 | { |
4038c495 | 1009 | tree next; |
2d727f75 | 1010 | tree type; |
8d08fdba | 1011 | |
4038c495 | 1012 | if (!DECL_NAME (field) && DECL_C_BIT_FIELD (field)) |
ca4feb54 | 1013 | { |
4038c495 GB |
1014 | flags |= picflag_from_initializer (integer_zero_node); |
1015 | CONSTRUCTOR_APPEND_ELT (v, field, integer_zero_node); | |
1016 | continue; | |
ca4feb54 | 1017 | } |
8d08fdba | 1018 | |
4038c495 GB |
1019 | if (TREE_CODE (field) != FIELD_DECL || DECL_ARTIFICIAL (field)) |
1020 | continue; | |
1021 | ||
2d727f75 JM |
1022 | /* If this is a bitfield, first convert to the declared type. */ |
1023 | type = TREE_TYPE (field); | |
1024 | if (DECL_BIT_FIELD_TYPE (field)) | |
1025 | type = DECL_BIT_FIELD_TYPE (field); | |
1026 | ||
4038c495 | 1027 | if (idx < VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init))) |
8d08fdba | 1028 | { |
4038c495 GB |
1029 | constructor_elt *ce = VEC_index (constructor_elt, |
1030 | CONSTRUCTOR_ELTS (init), idx); | |
1031 | if (ce->index) | |
8d08fdba | 1032 | { |
4038c495 GB |
1033 | /* We can have either a FIELD_DECL or an IDENTIFIER_NODE. The |
1034 | latter case can happen in templates where lookup has to be | |
1035 | deferred. */ | |
1036 | gcc_assert (TREE_CODE (ce->index) == FIELD_DECL | |
1037 | || TREE_CODE (ce->index) == IDENTIFIER_NODE); | |
1038 | if (ce->index != field | |
3db45ab5 | 1039 | && ce->index != DECL_NAME (field)) |
e135a637 SE |
1040 | { |
1041 | ce->value = error_mark_node; | |
1042 | sorry ("non-trivial designated initializers not supported"); | |
1043 | } | |
8d08fdba | 1044 | } |
e6267549 | 1045 | |
4038c495 | 1046 | gcc_assert (ce->value); |
e57d93c6 | 1047 | next = digest_init_r (type, ce->value, true, LOOKUP_IMPLICIT); |
4038c495 GB |
1048 | ++idx; |
1049 | } | |
1050 | else if (TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (field))) | |
1051 | { | |
1052 | /* If this type needs constructors run for | |
3b426391 | 1053 | default-initialization, we can't rely on the back end to do it |
4038c495 GB |
1054 | for us, so build up TARGET_EXPRs. If the type in question is |
1055 | a class, just build one up; if it's an array, recurse. */ | |
9e1e64ec | 1056 | if (MAYBE_CLASS_TYPE_P (TREE_TYPE (field))) |
5ade1ed2 DG |
1057 | next = build_functional_cast (TREE_TYPE (field), NULL_TREE, |
1058 | tf_warning_or_error); | |
4038c495 | 1059 | else |
09357846 | 1060 | next = build_constructor (init_list_type_node, NULL); |
4038c495 | 1061 | |
e57d93c6 | 1062 | next = digest_init_r (TREE_TYPE (field), next, true, LOOKUP_IMPLICIT); |
4038c495 GB |
1063 | |
1064 | /* Warn when some struct elements are implicitly initialized. */ | |
1065 | warning (OPT_Wmissing_field_initializers, | |
1066 | "missing initializer for member %qD", field); | |
1067 | } | |
1068 | else | |
1069 | { | |
1070 | if (TREE_READONLY (field)) | |
1071 | error ("uninitialized const member %qD", field); | |
1072 | else if (CLASSTYPE_READONLY_FIELDS_NEED_INIT (TREE_TYPE (field))) | |
1073 | error ("member %qD with uninitialized const fields", field); | |
1074 | else if (TREE_CODE (TREE_TYPE (field)) == REFERENCE_TYPE) | |
1075 | error ("member %qD is uninitialized reference", field); | |
1076 | ||
1077 | /* Warn when some struct elements are implicitly initialized | |
1078 | to zero. */ | |
1079 | warning (OPT_Wmissing_field_initializers, | |
1080 | "missing initializer for member %qD", field); | |
1081 | ||
1082 | if (!zero_init_p (TREE_TYPE (field))) | |
1083 | next = build_zero_init (TREE_TYPE (field), /*nelts=*/NULL_TREE, | |
1084 | /*static_storage_p=*/false); | |
e6267549 JM |
1085 | else |
1086 | /* The default zero-initialization is fine for us; don't | |
4038c495 GB |
1087 | add anything to the CONSTRUCTOR. */ |
1088 | continue; | |
8d08fdba | 1089 | } |
4038c495 | 1090 | |
2d727f75 JM |
1091 | /* If this is a bitfield, now convert to the lowered type. */ |
1092 | if (type != TREE_TYPE (field)) | |
1093 | next = cp_convert_and_check (TREE_TYPE (field), next); | |
4038c495 GB |
1094 | flags |= picflag_from_initializer (next); |
1095 | CONSTRUCTOR_APPEND_ELT (v, field, next); | |
8d08fdba | 1096 | } |
8d08fdba | 1097 | |
fc94bfc5 JM |
1098 | if (idx < VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init))) |
1099 | error ("too many initializers for %qT", type); | |
1100 | ||
4038c495 GB |
1101 | CONSTRUCTOR_ELTS (init) = v; |
1102 | return flags; | |
1103 | } | |
8d08fdba | 1104 | |
4038c495 | 1105 | /* Subroutine of process_init_constructor, which will process a single |
13a44ee0 | 1106 | initializer INIT for a union of type TYPE. Returns the flags (PICFLAG_*) |
4038c495 | 1107 | which describe the initializer. */ |
8d08fdba | 1108 | |
4038c495 GB |
1109 | static int |
1110 | process_init_constructor_union (tree type, tree init) | |
1111 | { | |
1112 | constructor_elt *ce; | |
fc94bfc5 | 1113 | int len; |
8d08fdba | 1114 | |
4038c495 GB |
1115 | /* If the initializer was empty, use default zero initialization. */ |
1116 | if (VEC_empty (constructor_elt, CONSTRUCTOR_ELTS (init))) | |
1117 | return 0; | |
1118 | ||
fc94bfc5 JM |
1119 | len = VEC_length (constructor_elt, CONSTRUCTOR_ELTS (init)); |
1120 | if (len > 1) | |
1121 | { | |
1122 | error ("too many initializers for %qT", type); | |
1123 | VEC_block_remove (constructor_elt, CONSTRUCTOR_ELTS (init), 1, len-1); | |
1124 | } | |
1125 | ||
4038c495 GB |
1126 | ce = VEC_index (constructor_elt, CONSTRUCTOR_ELTS (init), 0); |
1127 | ||
1128 | /* If this element specifies a field, initialize via that field. */ | |
1129 | if (ce->index) | |
1130 | { | |
1131 | if (TREE_CODE (ce->index) == FIELD_DECL) | |
1132 | ; | |
1133 | else if (TREE_CODE (ce->index) == IDENTIFIER_NODE) | |
1134 | { | |
1135 | /* This can happen within a cast, see g++.dg/opt/cse2.C. */ | |
1136 | tree name = ce->index; | |
1137 | tree field; | |
1138 | for (field = TYPE_FIELDS (type); field; field = TREE_CHAIN (field)) | |
1139 | if (DECL_NAME (field) == name) | |
1140 | break; | |
1141 | if (!field) | |
8d08fdba | 1142 | { |
4038c495 GB |
1143 | error ("no field %qD found in union being initialized", field); |
1144 | ce->value = error_mark_node; | |
8d08fdba | 1145 | } |
4038c495 GB |
1146 | ce->index = field; |
1147 | } | |
1148 | else | |
1149 | { | |
1150 | gcc_assert (TREE_CODE (ce->index) == INTEGER_CST | |
1151 | || TREE_CODE (ce->index) == RANGE_EXPR); | |
1152 | error ("index value instead of field name in union initializer"); | |
1153 | ce->value = error_mark_node; | |
8d08fdba | 1154 | } |
8d08fdba | 1155 | } |
4038c495 | 1156 | else |
8d08fdba | 1157 | { |
8d08fdba MS |
1158 | /* Find the first named field. ANSI decided in September 1990 |
1159 | that only named fields count here. */ | |
4038c495 | 1160 | tree field = TYPE_FIELDS (type); |
17bbb839 | 1161 | while (field && (!DECL_NAME (field) || TREE_CODE (field) != FIELD_DECL)) |
8d08fdba | 1162 | field = TREE_CHAIN (field); |
9bfea41b JM |
1163 | if (field == NULL_TREE) |
1164 | { | |
1165 | error ("too many initializers for %qT", type); | |
1166 | ce->value = error_mark_node; | |
1167 | } | |
4038c495 GB |
1168 | ce->index = field; |
1169 | } | |
8d08fdba | 1170 | |
4038c495 | 1171 | if (ce->value && ce->value != error_mark_node) |
e57d93c6 | 1172 | ce->value = digest_init_r (TREE_TYPE (ce->index), ce->value, true, LOOKUP_IMPLICIT); |
8d08fdba | 1173 | |
4038c495 GB |
1174 | return picflag_from_initializer (ce->value); |
1175 | } | |
8d08fdba | 1176 | |
4038c495 GB |
1177 | /* Process INIT, a constructor for a variable of aggregate type TYPE. The |
1178 | constructor is a brace-enclosed initializer, and will be modified in-place. | |
1179 | ||
1180 | Each element is converted to the right type through digest_init, and | |
1181 | missing initializers are added following the language rules (zero-padding, | |
1182 | etc.). | |
8d08fdba | 1183 | |
4038c495 GB |
1184 | After the execution, the initializer will have TREE_CONSTANT if all elts are |
1185 | constant, and TREE_STATIC set if, in addition, all elts are simple enough | |
1186 | constants that the assembler and linker can compute them. | |
3db45ab5 | 1187 | |
4038c495 GB |
1188 | The function returns the initializer itself, or error_mark_node in case |
1189 | of error. */ | |
1190 | ||
1191 | static tree | |
1192 | process_init_constructor (tree type, tree init) | |
1193 | { | |
1194 | int flags; | |
1195 | ||
1196 | gcc_assert (BRACE_ENCLOSED_INITIALIZER_P (init)); | |
1197 | ||
1198 | if (TREE_CODE (type) == ARRAY_TYPE || TREE_CODE (type) == VECTOR_TYPE) | |
1199 | flags = process_init_constructor_array (type, init); | |
1200 | else if (TREE_CODE (type) == RECORD_TYPE) | |
1201 | flags = process_init_constructor_record (type, init); | |
1202 | else if (TREE_CODE (type) == UNION_TYPE) | |
1203 | flags = process_init_constructor_union (type, init); | |
1204 | else | |
1205 | gcc_unreachable (); | |
8d08fdba | 1206 | |
4038c495 | 1207 | if (flags & PICFLAG_ERRONEOUS) |
8d08fdba MS |
1208 | return error_mark_node; |
1209 | ||
4038c495 | 1210 | TREE_TYPE (init) = type; |
8c081e84 | 1211 | if (TREE_CODE (type) == ARRAY_TYPE && TYPE_DOMAIN (type) == NULL_TREE) |
4038c495 GB |
1212 | cp_complete_array_type (&TREE_TYPE (init), init, /*do_default=*/0); |
1213 | if (!(flags & PICFLAG_NOT_ALL_CONSTANT)) | |
6de9cd9a | 1214 | { |
4038c495 | 1215 | TREE_CONSTANT (init) = 1; |
4038c495 GB |
1216 | if (!(flags & PICFLAG_NOT_ALL_SIMPLE)) |
1217 | TREE_STATIC (init) = 1; | |
6de9cd9a | 1218 | } |
4038c495 | 1219 | return init; |
8d08fdba MS |
1220 | } |
1221 | \f | |
1222 | /* Given a structure or union value DATUM, construct and return | |
1223 | the structure or union component which results from narrowing | |
a29e1034 | 1224 | that value to the base specified in BASETYPE. For example, given the |
8d08fdba MS |
1225 | hierarchy |
1226 | ||
1227 | class L { int ii; }; | |
1228 | class A : L { ... }; | |
1229 | class B : L { ... }; | |
1230 | class C : A, B { ... }; | |
1231 | ||
1232 | and the declaration | |
1233 | ||
1234 | C x; | |
1235 | ||
1236 | then the expression | |
1237 | ||
be99da77 | 1238 | x.A::ii refers to the ii member of the L part of |
38e01259 | 1239 | the A part of the C object named by X. In this case, |
aa52c1ff JM |
1240 | DATUM would be x, and BASETYPE would be A. |
1241 | ||
477f6664 JM |
1242 | I used to think that this was nonconformant, that the standard specified |
1243 | that first we look up ii in A, then convert x to an L& and pull out the | |
1244 | ii part. But in fact, it does say that we convert x to an A&; A here | |
a29e1034 JM |
1245 | is known as the "naming class". (jason 2000-12-19) |
1246 | ||
1247 | BINFO_P points to a variable initialized either to NULL_TREE or to the | |
1248 | binfo for the specific base subobject we want to convert to. */ | |
8d08fdba MS |
1249 | |
1250 | tree | |
0a8cb79e | 1251 | build_scoped_ref (tree datum, tree basetype, tree* binfo_p) |
8d08fdba | 1252 | { |
338d90b8 | 1253 | tree binfo; |
8d08fdba MS |
1254 | |
1255 | if (datum == error_mark_node) | |
1256 | return error_mark_node; | |
a29e1034 JM |
1257 | if (*binfo_p) |
1258 | binfo = *binfo_p; | |
1259 | else | |
1260 | binfo = lookup_base (TREE_TYPE (datum), basetype, ba_check, NULL); | |
8d08fdba | 1261 | |
a29e1034 JM |
1262 | if (!binfo || binfo == error_mark_node) |
1263 | { | |
1264 | *binfo_p = NULL_TREE; | |
1265 | if (!binfo) | |
1266 | error_not_base_type (basetype, TREE_TYPE (datum)); | |
1267 | return error_mark_node; | |
1268 | } | |
8d08fdba | 1269 | |
a29e1034 JM |
1270 | *binfo_p = binfo; |
1271 | return build_base_path (PLUS_EXPR, datum, binfo, 1); | |
8d08fdba MS |
1272 | } |
1273 | ||
1274 | /* Build a reference to an object specified by the C++ `->' operator. | |
1275 | Usually this just involves dereferencing the object, but if the | |
1276 | `->' operator is overloaded, then such overloads must be | |
1277 | performed until an object which does not have the `->' operator | |
1278 | overloaded is found. An error is reported when circular pointer | |
1279 | delegation is detected. */ | |
e92cc029 | 1280 | |
8d08fdba | 1281 | tree |
d17811fd | 1282 | build_x_arrow (tree expr) |
8d08fdba | 1283 | { |
d17811fd | 1284 | tree orig_expr = expr; |
8d08fdba | 1285 | tree types_memoized = NULL_TREE; |
d17811fd | 1286 | tree type = TREE_TYPE (expr); |
a703fb38 | 1287 | tree last_rval = NULL_TREE; |
8d08fdba MS |
1288 | |
1289 | if (type == error_mark_node) | |
1290 | return error_mark_node; | |
1291 | ||
5156628f | 1292 | if (processing_template_decl) |
d17811fd MM |
1293 | { |
1294 | if (type_dependent_expression_p (expr)) | |
1295 | return build_min_nt (ARROW_EXPR, expr); | |
1296 | expr = build_non_dependent_expr (expr); | |
1297 | } | |
5566b478 | 1298 | |
9e1e64ec | 1299 | if (MAYBE_CLASS_TYPE_P (type)) |
8d08fdba | 1300 | { |
d17811fd | 1301 | while ((expr = build_new_op (COMPONENT_REF, LOOKUP_NORMAL, expr, |
ec835fb2 | 1302 | NULL_TREE, NULL_TREE, |
5ade1ed2 DG |
1303 | /*overloaded_p=*/NULL, |
1304 | tf_warning_or_error))) | |
8d08fdba | 1305 | { |
d17811fd | 1306 | if (expr == error_mark_node) |
8d08fdba MS |
1307 | return error_mark_node; |
1308 | ||
d17811fd | 1309 | if (value_member (TREE_TYPE (expr), types_memoized)) |
8d08fdba | 1310 | { |
8251199e | 1311 | error ("circular pointer delegation detected"); |
8d08fdba MS |
1312 | return error_mark_node; |
1313 | } | |
1314 | else | |
1315 | { | |
d17811fd | 1316 | types_memoized = tree_cons (NULL_TREE, TREE_TYPE (expr), |
8d08fdba MS |
1317 | types_memoized); |
1318 | } | |
d17811fd | 1319 | last_rval = expr; |
c8094d83 | 1320 | } |
297dcfb3 MM |
1321 | |
1322 | if (last_rval == NULL_TREE) | |
1323 | { | |
a82e1a7d | 1324 | error ("base operand of %<->%> has non-pointer type %qT", type); |
297dcfb3 MM |
1325 | return error_mark_node; |
1326 | } | |
1327 | ||
8d08fdba MS |
1328 | if (TREE_CODE (TREE_TYPE (last_rval)) == REFERENCE_TYPE) |
1329 | last_rval = convert_from_reference (last_rval); | |
1330 | } | |
1331 | else | |
d17811fd | 1332 | last_rval = decay_conversion (expr); |
8d08fdba | 1333 | |
8d08fdba | 1334 | if (TREE_CODE (TREE_TYPE (last_rval)) == POINTER_TYPE) |
d17811fd MM |
1335 | { |
1336 | if (processing_template_decl) | |
8e1daa34 NS |
1337 | { |
1338 | expr = build_min_non_dep (ARROW_EXPR, last_rval, orig_expr); | |
04c06002 | 1339 | /* It will be dereferenced. */ |
8e1daa34 NS |
1340 | TREE_TYPE (expr) = TREE_TYPE (TREE_TYPE (last_rval)); |
1341 | return expr; | |
1342 | } | |
d17811fd | 1343 | |
5ade1ed2 | 1344 | return cp_build_indirect_ref (last_rval, NULL, tf_warning_or_error); |
d17811fd | 1345 | } |
8d08fdba | 1346 | |
8d08fdba | 1347 | if (types_memoized) |
a82e1a7d | 1348 | error ("result of %<operator->()%> yields non-pointer result"); |
8d08fdba | 1349 | else |
a82e1a7d | 1350 | error ("base operand of %<->%> is not a pointer"); |
8d08fdba MS |
1351 | return error_mark_node; |
1352 | } | |
1353 | ||
d6b4ea85 MM |
1354 | /* Return an expression for "DATUM .* COMPONENT". DATUM has not |
1355 | already been checked out to be of aggregate type. */ | |
e92cc029 | 1356 | |
8d08fdba | 1357 | tree |
0a8cb79e | 1358 | build_m_component_ref (tree datum, tree component) |
8d08fdba | 1359 | { |
d6b4ea85 | 1360 | tree ptrmem_type; |
c3e899c1 | 1361 | tree objtype; |
d6b4ea85 | 1362 | tree type; |
71851aaa | 1363 | tree binfo; |
cad7e87b | 1364 | tree ctype; |
8d08fdba | 1365 | |
a8fe5a30 | 1366 | if (error_operand_p (datum) || error_operand_p (component)) |
f1a3f197 MM |
1367 | return error_mark_node; |
1368 | ||
d6b4ea85 | 1369 | ptrmem_type = TREE_TYPE (component); |
a5ac359a | 1370 | if (!TYPE_PTR_TO_MEMBER_P (ptrmem_type)) |
8d08fdba | 1371 | { |
a82e1a7d | 1372 | error ("%qE cannot be used as a member pointer, since it is of " |
0cbd7506 | 1373 | "type %qT", |
d6b4ea85 | 1374 | component, ptrmem_type); |
8d08fdba MS |
1375 | return error_mark_node; |
1376 | } | |
c8094d83 MS |
1377 | |
1378 | objtype = TYPE_MAIN_VARIANT (TREE_TYPE (datum)); | |
9e1e64ec | 1379 | if (! MAYBE_CLASS_TYPE_P (objtype)) |
51c184be | 1380 | { |
a82e1a7d | 1381 | error ("cannot apply member pointer %qE to %qE, which is of " |
41990f96 | 1382 | "non-class type %qT", |
0cbd7506 | 1383 | component, datum, objtype); |
51c184be MS |
1384 | return error_mark_node; |
1385 | } | |
71851aaa | 1386 | |
d6b4ea85 | 1387 | type = TYPE_PTRMEM_POINTED_TO_TYPE (ptrmem_type); |
cad7e87b NS |
1388 | ctype = complete_type (TYPE_PTRMEM_CLASS_TYPE (ptrmem_type)); |
1389 | ||
1390 | if (!COMPLETE_TYPE_P (ctype)) | |
8d08fdba | 1391 | { |
cad7e87b NS |
1392 | if (!same_type_p (ctype, objtype)) |
1393 | goto mismatch; | |
1394 | binfo = NULL; | |
1395 | } | |
1396 | else | |
1397 | { | |
1398 | binfo = lookup_base (objtype, ctype, ba_check, NULL); | |
c8094d83 | 1399 | |
cad7e87b NS |
1400 | if (!binfo) |
1401 | { | |
1402 | mismatch: | |
a82e1a7d | 1403 | error ("pointer to member type %qT incompatible with object " |
0cbd7506 | 1404 | "type %qT", |
cad7e87b NS |
1405 | type, objtype); |
1406 | return error_mark_node; | |
1407 | } | |
1408 | else if (binfo == error_mark_node) | |
1409 | return error_mark_node; | |
8d08fdba MS |
1410 | } |
1411 | ||
d6b4ea85 MM |
1412 | if (TYPE_PTRMEM_P (ptrmem_type)) |
1413 | { | |
b5119fa1 RG |
1414 | tree ptype; |
1415 | ||
d6b4ea85 MM |
1416 | /* Compute the type of the field, as described in [expr.ref]. |
1417 | There's no such thing as a mutable pointer-to-member, so | |
1418 | things are not as complex as they are for references to | |
1419 | non-static data members. */ | |
1420 | type = cp_build_qualified_type (type, | |
c8094d83 | 1421 | (cp_type_quals (type) |
d6b4ea85 | 1422 | | cp_type_quals (TREE_TYPE (datum)))); |
cad7e87b NS |
1423 | |
1424 | datum = build_address (datum); | |
c8094d83 | 1425 | |
cad7e87b NS |
1426 | /* Convert object to the correct base. */ |
1427 | if (binfo) | |
1428 | datum = build_base_path (PLUS_EXPR, datum, binfo, 1); | |
c8094d83 | 1429 | |
a5ac359a MM |
1430 | /* Build an expression for "object + offset" where offset is the |
1431 | value stored in the pointer-to-data-member. */ | |
b5119fa1 RG |
1432 | ptype = build_pointer_type (type); |
1433 | datum = build2 (POINTER_PLUS_EXPR, ptype, | |
1434 | fold_convert (ptype, datum), | |
1435 | build_nop (sizetype, component)); | |
5ade1ed2 | 1436 | return cp_build_indirect_ref (datum, 0, tf_warning_or_error); |
d6b4ea85 MM |
1437 | } |
1438 | else | |
f293ce4b | 1439 | return build2 (OFFSET_REF, type, datum, component); |
8d08fdba MS |
1440 | } |
1441 | ||
fc378698 | 1442 | /* Return a tree node for the expression TYPENAME '(' PARMS ')'. */ |
e92cc029 | 1443 | |
8d08fdba | 1444 | tree |
5ade1ed2 | 1445 | build_functional_cast (tree exp, tree parms, tsubst_flags_t complain) |
8d08fdba MS |
1446 | { |
1447 | /* This is either a call to a constructor, | |
1448 | or a C cast in C++'s `functional' notation. */ | |
0fcedd9c JM |
1449 | |
1450 | /* The type to which we are casting. */ | |
fc378698 | 1451 | tree type; |
c166b898 | 1452 | VEC(tree,gc) *parmvec; |
8d08fdba MS |
1453 | |
1454 | if (exp == error_mark_node || parms == error_mark_node) | |
1455 | return error_mark_node; | |
1456 | ||
4b0d3cbe | 1457 | if (TREE_CODE (exp) == TYPE_DECL) |
45537677 | 1458 | type = TREE_TYPE (exp); |
8d08fdba MS |
1459 | else |
1460 | type = exp; | |
1461 | ||
d67a3e2a AP |
1462 | if (TREE_CODE (type) == REFERENCE_TYPE && !parms) |
1463 | { | |
1464 | error ("invalid value-initialization of reference types"); | |
1465 | return error_mark_node; | |
1466 | } | |
1467 | ||
5156628f | 1468 | if (processing_template_decl) |
8e1daa34 NS |
1469 | { |
1470 | tree t = build_min (CAST_EXPR, type, parms); | |
1471 | /* We don't know if it will or will not have side effects. */ | |
1472 | TREE_SIDE_EFFECTS (t) = 1; | |
1473 | return t; | |
1474 | } | |
5566b478 | 1475 | |
9e1e64ec | 1476 | if (! MAYBE_CLASS_TYPE_P (type)) |
8d08fdba | 1477 | { |
8d08fdba | 1478 | if (parms == NULL_TREE) |
f0b99d6c | 1479 | return cp_convert (type, integer_zero_node); |
8ccc31eb | 1480 | |
f0b99d6c RS |
1481 | /* This must build a C cast. */ |
1482 | parms = build_x_compound_expr_from_list (parms, "functional cast"); | |
525521b6 | 1483 | return cp_build_c_cast (type, parms, complain); |
8d08fdba MS |
1484 | } |
1485 | ||
45537677 MS |
1486 | /* Prepare to evaluate as a call to a constructor. If this expression |
1487 | is actually used, for example, | |
c8094d83 | 1488 | |
45537677 | 1489 | return X (arg1, arg2, ...); |
c8094d83 | 1490 | |
45537677 MS |
1491 | then the slot being initialized will be filled in. */ |
1492 | ||
d0f062fb NS |
1493 | if (!complete_type_or_else (type, NULL_TREE)) |
1494 | return error_mark_node; | |
a7a64a77 MM |
1495 | if (abstract_virtuals_error (NULL_TREE, type)) |
1496 | return error_mark_node; | |
8d08fdba | 1497 | |
0fcedd9c JM |
1498 | /* [expr.type.conv] |
1499 | ||
1500 | If the expression list is a single-expression, the type | |
1501 | conversion is equivalent (in definedness, and if defined in | |
1502 | meaning) to the corresponding cast expression. */ | |
8d08fdba | 1503 | if (parms && TREE_CHAIN (parms) == NULL_TREE) |
525521b6 | 1504 | return cp_build_c_cast (type, TREE_VALUE (parms), complain); |
8d08fdba | 1505 | |
0fcedd9c JM |
1506 | /* [expr.type.conv] |
1507 | ||
1508 | The expression T(), where T is a simple-type-specifier for a | |
1509 | non-array complete object type or the (possibly cv-qualified) | |
1510 | void type, creates an rvalue of the specified type, which is | |
1511 | value-initialized. */ | |
1512 | ||
1513 | if (parms == NULL_TREE | |
1514 | /* If there's a user-defined constructor, value-initialization is | |
1515 | just calling the constructor, so fall through. */ | |
1516 | && !TYPE_HAS_USER_CONSTRUCTOR (type)) | |
3551c177 | 1517 | { |
0fcedd9c | 1518 | exp = build_value_init (type); |
3551c177 JM |
1519 | return get_target_expr (exp); |
1520 | } | |
1521 | ||
0fcedd9c | 1522 | /* Call the constructor. */ |
c166b898 ILT |
1523 | parmvec = make_tree_vector (); |
1524 | for (; parms != NULL_TREE; parms = TREE_CHAIN (parms)) | |
1525 | VEC_safe_push (tree, gc, parmvec, TREE_VALUE (parms)); | |
1526 | exp = build_special_member_call (NULL_TREE, complete_ctor_identifier, | |
1527 | &parmvec, type, LOOKUP_NORMAL, complain); | |
1528 | release_tree_vector (parmvec); | |
8d08fdba | 1529 | |
fc378698 | 1530 | if (exp == error_mark_node) |
a0a33927 | 1531 | return error_mark_node; |
8d08fdba | 1532 | |
fc378698 | 1533 | return build_cplus_new (type, exp); |
8d08fdba MS |
1534 | } |
1535 | \f | |
46b02c6d | 1536 | |
4cc1d462 NS |
1537 | /* Add new exception specifier SPEC, to the LIST we currently have. |
1538 | If it's already in LIST then do nothing. | |
1539 | Moan if it's bad and we're allowed to. COMPLAIN < 0 means we | |
1540 | know what we're doing. */ | |
1541 | ||
1542 | tree | |
0a8cb79e | 1543 | add_exception_specifier (tree list, tree spec, int complain) |
4cc1d462 | 1544 | { |
ef09717a | 1545 | bool ok; |
4cc1d462 | 1546 | tree core = spec; |
ef09717a | 1547 | bool is_ptr; |
71205d17 | 1548 | diagnostic_t diag_type = DK_UNSPECIFIED; /* none */ |
c8094d83 | 1549 | |
4cc1d462 NS |
1550 | if (spec == error_mark_node) |
1551 | return list; | |
c8094d83 | 1552 | |
50bc768d | 1553 | gcc_assert (spec && (!list || TREE_VALUE (list))); |
c8094d83 | 1554 | |
4cc1d462 NS |
1555 | /* [except.spec] 1, type in an exception specifier shall not be |
1556 | incomplete, or pointer or ref to incomplete other than pointer | |
1557 | to cv void. */ | |
1558 | is_ptr = TREE_CODE (core) == POINTER_TYPE; | |
1559 | if (is_ptr || TREE_CODE (core) == REFERENCE_TYPE) | |
1560 | core = TREE_TYPE (core); | |
1561 | if (complain < 0) | |
ef09717a | 1562 | ok = true; |
b72801e2 | 1563 | else if (VOID_TYPE_P (core)) |
4cc1d462 NS |
1564 | ok = is_ptr; |
1565 | else if (TREE_CODE (core) == TEMPLATE_TYPE_PARM) | |
ef09717a | 1566 | ok = true; |
baeb4732 | 1567 | else if (processing_template_decl) |
ef09717a | 1568 | ok = true; |
4cc1d462 | 1569 | else |
5aa3396c | 1570 | { |
ef09717a | 1571 | ok = true; |
5aa3396c | 1572 | /* 15.4/1 says that types in an exception specifier must be complete, |
0cbd7506 MS |
1573 | but it seems more reasonable to only require this on definitions |
1574 | and calls. So just give a pedwarn at this point; we will give an | |
1575 | error later if we hit one of those two cases. */ | |
5aa3396c | 1576 | if (!COMPLETE_TYPE_P (complete_type (core))) |
71205d17 | 1577 | diag_type = DK_PEDWARN; /* pedwarn */ |
5aa3396c | 1578 | } |
baeb4732 | 1579 | |
4cc1d462 NS |
1580 | if (ok) |
1581 | { | |
1582 | tree probe; | |
c8094d83 | 1583 | |
4cc1d462 | 1584 | for (probe = list; probe; probe = TREE_CHAIN (probe)) |
0cbd7506 MS |
1585 | if (same_type_p (TREE_VALUE (probe), spec)) |
1586 | break; | |
4cc1d462 | 1587 | if (!probe) |
80b1331c | 1588 | list = tree_cons (NULL_TREE, spec, list); |
4cc1d462 | 1589 | } |
5aa3396c | 1590 | else |
71205d17 | 1591 | diag_type = DK_ERROR; /* error */ |
c8094d83 | 1592 | |
71205d17 | 1593 | if (diag_type != DK_UNSPECIFIED && complain) |
5aa3396c JM |
1594 | cxx_incomplete_type_diagnostic (NULL_TREE, core, diag_type); |
1595 | ||
4cc1d462 NS |
1596 | return list; |
1597 | } | |
03378143 NS |
1598 | |
1599 | /* Combine the two exceptions specifier lists LIST and ADD, and return | |
c6002625 | 1600 | their union. */ |
03378143 NS |
1601 | |
1602 | tree | |
0a8cb79e | 1603 | merge_exception_specifiers (tree list, tree add) |
03378143 NS |
1604 | { |
1605 | if (!list || !add) | |
1606 | return NULL_TREE; | |
1607 | else if (!TREE_VALUE (list)) | |
1608 | return add; | |
1609 | else if (!TREE_VALUE (add)) | |
1610 | return list; | |
1611 | else | |
1612 | { | |
1613 | tree orig_list = list; | |
c8094d83 | 1614 | |
03378143 | 1615 | for (; add; add = TREE_CHAIN (add)) |
0cbd7506 MS |
1616 | { |
1617 | tree spec = TREE_VALUE (add); | |
1618 | tree probe; | |
1619 | ||
1620 | for (probe = orig_list; probe; probe = TREE_CHAIN (probe)) | |
1621 | if (same_type_p (TREE_VALUE (probe), spec)) | |
1622 | break; | |
1623 | if (!probe) | |
1624 | { | |
1625 | spec = build_tree_list (NULL_TREE, spec); | |
1626 | TREE_CHAIN (spec) = list; | |
1627 | list = spec; | |
1628 | } | |
1629 | } | |
03378143 NS |
1630 | } |
1631 | return list; | |
1632 | } | |
5aa3396c JM |
1633 | |
1634 | /* Subroutine of build_call. Ensure that each of the types in the | |
1635 | exception specification is complete. Technically, 15.4/1 says that | |
1636 | they need to be complete when we see a declaration of the function, | |
1637 | but we should be able to get away with only requiring this when the | |
1638 | function is defined or called. See also add_exception_specifier. */ | |
1639 | ||
1640 | void | |
0a8cb79e | 1641 | require_complete_eh_spec_types (tree fntype, tree decl) |
5aa3396c JM |
1642 | { |
1643 | tree raises; | |
1644 | /* Don't complain about calls to op new. */ | |
1645 | if (decl && DECL_ARTIFICIAL (decl)) | |
1646 | return; | |
1647 | for (raises = TYPE_RAISES_EXCEPTIONS (fntype); raises; | |
1648 | raises = TREE_CHAIN (raises)) | |
1649 | { | |
1650 | tree type = TREE_VALUE (raises); | |
1651 | if (type && !COMPLETE_TYPE_P (type)) | |
1652 | { | |
1653 | if (decl) | |
1654 | error | |
a82e1a7d | 1655 | ("call to function %qD which throws incomplete type %q#T", |
5aa3396c JM |
1656 | decl, type); |
1657 | else | |
a82e1a7d | 1658 | error ("call to function which throws incomplete type %q#T", |
5aa3396c JM |
1659 | decl); |
1660 | } | |
1661 | } | |
1662 | } | |
7fb213d8 GB |
1663 | |
1664 | \f | |
1665 | #include "gt-cp-typeck2.h" |