Commit | Line | Data |
---|---|---|
dda118e3 JM |
1 | /* Process declarations and variables for C++ compiler. |
2 | Copyright (C) 1988-2015 Free Software Foundation, Inc. | |
3 | Hacked by Michael Tiemann (tiemann@cygnus.com) | |
4 | ||
5 | This file is part of GCC. | |
6 | ||
7 | GCC is free software; you can redistribute it and/or modify | |
8 | it under the terms of the GNU General Public License as published by | |
9 | the Free Software Foundation; either version 3, or (at your option) | |
10 | any later version. | |
11 | ||
12 | GCC is distributed in the hope that it will be useful, | |
13 | but WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
15 | GNU General Public License for more details. | |
16 | ||
17 | You should have received a copy of the GNU General Public License | |
18 | along with GCC; see the file COPYING3. If not see | |
19 | <http://www.gnu.org/licenses/>. */ | |
20 | ||
21 | ||
22 | /* Process declarations and symbol lookup for C++ front end. | |
23 | Also constructs types; the standard scalar types at initialization, | |
24 | and structure, union, array and enum types when they are declared. */ | |
25 | ||
26 | /* ??? not all decl nodes are given the most useful possible | |
27 | line numbers. For example, the CONST_DECLs for enum values. */ | |
28 | ||
29 | #include "config.h" | |
30 | #include "system.h" | |
31 | #include "coretypes.h" | |
32 | #include "tm.h" | |
33 | #include "hash-set.h" | |
34 | #include "machmode.h" | |
35 | #include "vec.h" | |
36 | #include "double-int.h" | |
37 | #include "input.h" | |
38 | #include "alias.h" | |
39 | #include "symtab.h" | |
40 | #include "wide-int.h" | |
41 | #include "inchash.h" | |
42 | #include "tree.h" | |
43 | #include "stringpool.h" | |
44 | #include "varasm.h" | |
45 | #include "attribs.h" | |
46 | #include "stor-layout.h" | |
47 | #include "calls.h" | |
48 | #include "flags.h" | |
49 | #include "cp-tree.h" | |
50 | #include "decl.h" | |
51 | #include "toplev.h" | |
52 | #include "timevar.h" | |
53 | #include "cpplib.h" | |
54 | #include "target.h" | |
55 | #include "c-family/c-common.h" | |
56 | #include "c-family/c-objc.h" | |
57 | #include "hash-map.h" | |
58 | #include "is-a.h" | |
59 | #include "plugin-api.h" | |
60 | #include "hard-reg-set.h" | |
61 | #include "input.h" | |
62 | #include "function.h" | |
63 | #include "ipa-ref.h" | |
64 | #include "cgraph.h" | |
65 | #include "tree-inline.h" | |
66 | #include "c-family/c-pragma.h" | |
67 | #include "dumpfile.h" | |
68 | #include "intl.h" | |
69 | #include "splay-tree.h" | |
70 | #include "langhooks.h" | |
71 | #include "c-family/c-ada-spec.h" | |
72 | #include "asan.h" | |
73 | ||
74 | extern cpp_reader *parse_in; | |
75 | ||
76 | /* This structure contains information about the initializations | |
77 | and/or destructions required for a particular priority level. */ | |
78 | typedef struct priority_info_s { | |
79 | /* Nonzero if there have been any initializations at this priority | |
80 | throughout the translation unit. */ | |
81 | int initializations_p; | |
82 | /* Nonzero if there have been any destructions at this priority | |
83 | throughout the translation unit. */ | |
84 | int destructions_p; | |
85 | } *priority_info; | |
86 | ||
87 | static void mark_vtable_entries (tree); | |
88 | static bool maybe_emit_vtables (tree); | |
89 | static bool acceptable_java_type (tree); | |
90 | static tree start_objects (int, int); | |
91 | static void finish_objects (int, int, tree); | |
92 | static tree start_static_storage_duration_function (unsigned); | |
93 | static void finish_static_storage_duration_function (tree); | |
94 | static priority_info get_priority_info (int); | |
95 | static void do_static_initialization_or_destruction (tree, bool); | |
96 | static void one_static_initialization_or_destruction (tree, tree, bool); | |
97 | static void generate_ctor_or_dtor_function (bool, int, location_t *); | |
98 | static int generate_ctor_and_dtor_functions_for_priority (splay_tree_node, | |
99 | void *); | |
100 | static tree prune_vars_needing_no_initialization (tree *); | |
101 | static void write_out_vars (tree); | |
102 | static void import_export_class (tree); | |
103 | static tree get_guard_bits (tree); | |
104 | static void determine_visibility_from_class (tree, tree); | |
105 | static bool determine_hidden_inline (tree); | |
106 | static bool decl_defined_p (tree); | |
107 | ||
108 | /* A list of static class variables. This is needed, because a | |
109 | static class variable can be declared inside the class without | |
110 | an initializer, and then initialized, statically, outside the class. */ | |
111 | static GTY(()) vec<tree, va_gc> *pending_statics; | |
112 | ||
113 | /* A list of functions which were declared inline, but which we | |
114 | may need to emit outline anyway. */ | |
115 | static GTY(()) vec<tree, va_gc> *deferred_fns; | |
116 | ||
117 | /* A list of decls that use types with no linkage, which we need to make | |
118 | sure are defined. */ | |
119 | static GTY(()) vec<tree, va_gc> *no_linkage_decls; | |
120 | ||
7d4d0543 JM |
121 | /* A vector of alternating decls and identifiers, where the latter |
122 | is to be an alias for the former if the former is defined. */ | |
123 | static GTY(()) vec<tree, va_gc> *mangling_aliases; | |
124 | ||
dda118e3 JM |
125 | /* Nonzero if we're done parsing and into end-of-file activities. */ |
126 | ||
127 | int at_eof; | |
7d4d0543 JM |
128 | |
129 | /* True if note_mangling_alias should enqueue mangling aliases for | |
130 | later generation, rather than emitting them right away. */ | |
131 | ||
132 | bool defer_mangling_aliases = true; | |
dda118e3 JM |
133 | \f |
134 | ||
135 | /* Return a member function type (a METHOD_TYPE), given FNTYPE (a | |
136 | FUNCTION_TYPE), CTYPE (class type), and QUALS (the cv-qualifiers | |
137 | that apply to the function). */ | |
138 | ||
139 | tree | |
140 | build_memfn_type (tree fntype, tree ctype, cp_cv_quals quals, | |
141 | cp_ref_qualifier rqual) | |
142 | { | |
143 | tree raises; | |
144 | tree attrs; | |
145 | int type_quals; | |
146 | bool late_return_type_p; | |
147 | ||
148 | if (fntype == error_mark_node || ctype == error_mark_node) | |
149 | return error_mark_node; | |
150 | ||
151 | gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE | |
152 | || TREE_CODE (fntype) == METHOD_TYPE); | |
153 | ||
154 | type_quals = quals & ~TYPE_QUAL_RESTRICT; | |
155 | ctype = cp_build_qualified_type (ctype, type_quals); | |
156 | raises = TYPE_RAISES_EXCEPTIONS (fntype); | |
157 | attrs = TYPE_ATTRIBUTES (fntype); | |
158 | late_return_type_p = TYPE_HAS_LATE_RETURN_TYPE (fntype); | |
159 | fntype = build_method_type_directly (ctype, TREE_TYPE (fntype), | |
160 | (TREE_CODE (fntype) == METHOD_TYPE | |
161 | ? TREE_CHAIN (TYPE_ARG_TYPES (fntype)) | |
162 | : TYPE_ARG_TYPES (fntype))); | |
163 | if (attrs) | |
164 | fntype = cp_build_type_attribute_variant (fntype, attrs); | |
165 | if (rqual) | |
166 | fntype = build_ref_qualified_type (fntype, rqual); | |
167 | if (raises) | |
168 | fntype = build_exception_variant (fntype, raises); | |
169 | if (late_return_type_p) | |
170 | TYPE_HAS_LATE_RETURN_TYPE (fntype) = 1; | |
171 | ||
172 | return fntype; | |
173 | } | |
174 | ||
175 | /* Return a variant of FNTYPE, a FUNCTION_TYPE or METHOD_TYPE, with its | |
176 | return type changed to NEW_RET. */ | |
177 | ||
178 | tree | |
179 | change_return_type (tree new_ret, tree fntype) | |
180 | { | |
181 | tree newtype; | |
182 | tree args = TYPE_ARG_TYPES (fntype); | |
183 | tree raises = TYPE_RAISES_EXCEPTIONS (fntype); | |
184 | tree attrs = TYPE_ATTRIBUTES (fntype); | |
185 | bool late_return_type_p = TYPE_HAS_LATE_RETURN_TYPE (fntype); | |
186 | ||
187 | if (new_ret == error_mark_node) | |
188 | return fntype; | |
189 | ||
190 | if (same_type_p (new_ret, TREE_TYPE (fntype))) | |
191 | return fntype; | |
192 | ||
193 | if (TREE_CODE (fntype) == FUNCTION_TYPE) | |
194 | { | |
195 | newtype = build_function_type (new_ret, args); | |
196 | newtype = apply_memfn_quals (newtype, | |
197 | type_memfn_quals (fntype), | |
198 | type_memfn_rqual (fntype)); | |
199 | } | |
200 | else | |
201 | newtype = build_method_type_directly | |
202 | (class_of_this_parm (fntype), new_ret, TREE_CHAIN (args)); | |
203 | if (raises) | |
204 | newtype = build_exception_variant (newtype, raises); | |
205 | if (attrs) | |
206 | newtype = cp_build_type_attribute_variant (newtype, attrs); | |
207 | if (late_return_type_p) | |
208 | TYPE_HAS_LATE_RETURN_TYPE (newtype) = 1; | |
209 | ||
210 | return newtype; | |
211 | } | |
212 | ||
213 | /* Build a PARM_DECL with NAME and TYPE, and set DECL_ARG_TYPE | |
214 | appropriately. */ | |
215 | ||
216 | tree | |
217 | cp_build_parm_decl (tree name, tree type) | |
218 | { | |
219 | tree parm = build_decl (input_location, | |
220 | PARM_DECL, name, type); | |
221 | /* DECL_ARG_TYPE is only used by the back end and the back end never | |
222 | sees templates. */ | |
223 | if (!processing_template_decl) | |
224 | DECL_ARG_TYPE (parm) = type_passed_as (type); | |
225 | ||
226 | return parm; | |
227 | } | |
228 | ||
229 | /* Returns a PARM_DECL for a parameter of the indicated TYPE, with the | |
230 | indicated NAME. */ | |
231 | ||
232 | tree | |
233 | build_artificial_parm (tree name, tree type) | |
234 | { | |
235 | tree parm = cp_build_parm_decl (name, type); | |
236 | DECL_ARTIFICIAL (parm) = 1; | |
237 | /* All our artificial parms are implicitly `const'; they cannot be | |
238 | assigned to. */ | |
239 | TREE_READONLY (parm) = 1; | |
240 | return parm; | |
241 | } | |
242 | ||
243 | /* Constructors for types with virtual baseclasses need an "in-charge" flag | |
244 | saying whether this constructor is responsible for initialization of | |
245 | virtual baseclasses or not. All destructors also need this "in-charge" | |
246 | flag, which additionally determines whether or not the destructor should | |
247 | free the memory for the object. | |
248 | ||
249 | This function adds the "in-charge" flag to member function FN if | |
250 | appropriate. It is called from grokclassfn and tsubst. | |
251 | FN must be either a constructor or destructor. | |
252 | ||
253 | The in-charge flag follows the 'this' parameter, and is followed by the | |
254 | VTT parm (if any), then the user-written parms. */ | |
255 | ||
256 | void | |
257 | maybe_retrofit_in_chrg (tree fn) | |
258 | { | |
259 | tree basetype, arg_types, parms, parm, fntype; | |
260 | ||
261 | /* If we've already add the in-charge parameter don't do it again. */ | |
262 | if (DECL_HAS_IN_CHARGE_PARM_P (fn)) | |
263 | return; | |
264 | ||
265 | /* When processing templates we can't know, in general, whether or | |
266 | not we're going to have virtual baseclasses. */ | |
267 | if (processing_template_decl) | |
268 | return; | |
269 | ||
270 | /* We don't need an in-charge parameter for constructors that don't | |
271 | have virtual bases. */ | |
272 | if (DECL_CONSTRUCTOR_P (fn) | |
273 | && !CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fn))) | |
274 | return; | |
275 | ||
276 | arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn)); | |
277 | basetype = TREE_TYPE (TREE_VALUE (arg_types)); | |
278 | arg_types = TREE_CHAIN (arg_types); | |
279 | ||
280 | parms = DECL_CHAIN (DECL_ARGUMENTS (fn)); | |
281 | ||
282 | /* If this is a subobject constructor or destructor, our caller will | |
283 | pass us a pointer to our VTT. */ | |
284 | if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fn))) | |
285 | { | |
286 | parm = build_artificial_parm (vtt_parm_identifier, vtt_parm_type); | |
287 | ||
288 | /* First add it to DECL_ARGUMENTS between 'this' and the real args... */ | |
289 | DECL_CHAIN (parm) = parms; | |
290 | parms = parm; | |
291 | ||
292 | /* ...and then to TYPE_ARG_TYPES. */ | |
293 | arg_types = hash_tree_chain (vtt_parm_type, arg_types); | |
294 | ||
295 | DECL_HAS_VTT_PARM_P (fn) = 1; | |
296 | } | |
297 | ||
298 | /* Then add the in-charge parm (before the VTT parm). */ | |
299 | parm = build_artificial_parm (in_charge_identifier, integer_type_node); | |
300 | DECL_CHAIN (parm) = parms; | |
301 | parms = parm; | |
302 | arg_types = hash_tree_chain (integer_type_node, arg_types); | |
303 | ||
304 | /* Insert our new parameter(s) into the list. */ | |
305 | DECL_CHAIN (DECL_ARGUMENTS (fn)) = parms; | |
306 | ||
307 | /* And rebuild the function type. */ | |
308 | fntype = build_method_type_directly (basetype, TREE_TYPE (TREE_TYPE (fn)), | |
309 | arg_types); | |
310 | if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn))) | |
311 | fntype = build_exception_variant (fntype, | |
312 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn))); | |
313 | if (TYPE_ATTRIBUTES (TREE_TYPE (fn))) | |
314 | fntype = (cp_build_type_attribute_variant | |
315 | (fntype, TYPE_ATTRIBUTES (TREE_TYPE (fn)))); | |
316 | TREE_TYPE (fn) = fntype; | |
317 | ||
318 | /* Now we've got the in-charge parameter. */ | |
319 | DECL_HAS_IN_CHARGE_PARM_P (fn) = 1; | |
320 | } | |
321 | ||
322 | /* Classes overload their constituent function names automatically. | |
323 | When a function name is declared in a record structure, | |
324 | its name is changed to it overloaded name. Since names for | |
325 | constructors and destructors can conflict, we place a leading | |
326 | '$' for destructors. | |
327 | ||
328 | CNAME is the name of the class we are grokking for. | |
329 | ||
330 | FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'. | |
331 | ||
332 | FLAGS contains bits saying what's special about today's | |
333 | arguments. DTOR_FLAG == DESTRUCTOR. | |
334 | ||
335 | If FUNCTION is a destructor, then we must add the `auto-delete' field | |
336 | as a second parameter. There is some hair associated with the fact | |
337 | that we must "declare" this variable in the manner consistent with the | |
338 | way the rest of the arguments were declared. | |
339 | ||
340 | QUALS are the qualifiers for the this pointer. */ | |
341 | ||
342 | void | |
343 | grokclassfn (tree ctype, tree function, enum overload_flags flags) | |
344 | { | |
345 | tree fn_name = DECL_NAME (function); | |
346 | ||
347 | /* Even within an `extern "C"' block, members get C++ linkage. See | |
348 | [dcl.link] for details. */ | |
349 | SET_DECL_LANGUAGE (function, lang_cplusplus); | |
350 | ||
351 | if (fn_name == NULL_TREE) | |
352 | { | |
353 | error ("name missing for member function"); | |
354 | fn_name = get_identifier ("<anonymous>"); | |
355 | DECL_NAME (function) = fn_name; | |
356 | } | |
357 | ||
358 | DECL_CONTEXT (function) = ctype; | |
359 | ||
360 | if (flags == DTOR_FLAG) | |
361 | DECL_DESTRUCTOR_P (function) = 1; | |
362 | ||
363 | if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function)) | |
364 | maybe_retrofit_in_chrg (function); | |
365 | } | |
366 | ||
367 | /* Create an ARRAY_REF, checking for the user doing things backwards | |
368 | along the way. DECLTYPE_P is for N3276, as in the parser. */ | |
369 | ||
370 | tree | |
371 | grok_array_decl (location_t loc, tree array_expr, tree index_exp, | |
372 | bool decltype_p) | |
373 | { | |
374 | tree type; | |
375 | tree expr; | |
376 | tree orig_array_expr = array_expr; | |
377 | tree orig_index_exp = index_exp; | |
378 | ||
379 | if (error_operand_p (array_expr) || error_operand_p (index_exp)) | |
380 | return error_mark_node; | |
381 | ||
382 | if (processing_template_decl) | |
383 | { | |
384 | if (type_dependent_expression_p (array_expr) | |
385 | || type_dependent_expression_p (index_exp)) | |
386 | return build_min_nt_loc (loc, ARRAY_REF, array_expr, index_exp, | |
387 | NULL_TREE, NULL_TREE); | |
388 | array_expr = build_non_dependent_expr (array_expr); | |
389 | index_exp = build_non_dependent_expr (index_exp); | |
390 | } | |
391 | ||
392 | type = TREE_TYPE (array_expr); | |
393 | gcc_assert (type); | |
394 | type = non_reference (type); | |
395 | ||
396 | /* If they have an `operator[]', use that. */ | |
397 | if (MAYBE_CLASS_TYPE_P (type) || MAYBE_CLASS_TYPE_P (TREE_TYPE (index_exp))) | |
398 | { | |
399 | tsubst_flags_t complain = tf_warning_or_error; | |
400 | if (decltype_p) | |
401 | complain |= tf_decltype; | |
402 | expr = build_new_op (loc, ARRAY_REF, LOOKUP_NORMAL, array_expr, | |
403 | index_exp, NULL_TREE, /*overload=*/NULL, complain); | |
404 | } | |
405 | else | |
406 | { | |
407 | tree p1, p2, i1, i2; | |
408 | ||
409 | /* Otherwise, create an ARRAY_REF for a pointer or array type. | |
410 | It is a little-known fact that, if `a' is an array and `i' is | |
411 | an int, you can write `i[a]', which means the same thing as | |
412 | `a[i]'. */ | |
413 | if (TREE_CODE (type) == ARRAY_TYPE || TREE_CODE (type) == VECTOR_TYPE) | |
414 | p1 = array_expr; | |
415 | else | |
416 | p1 = build_expr_type_conversion (WANT_POINTER, array_expr, false); | |
417 | ||
418 | if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE) | |
419 | p2 = index_exp; | |
420 | else | |
421 | p2 = build_expr_type_conversion (WANT_POINTER, index_exp, false); | |
422 | ||
423 | i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr, | |
424 | false); | |
425 | i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp, | |
426 | false); | |
427 | ||
428 | if ((p1 && i2) && (i1 && p2)) | |
429 | error ("ambiguous conversion for array subscript"); | |
430 | ||
431 | if (p1 && i2) | |
432 | array_expr = p1, index_exp = i2; | |
433 | else if (i1 && p2) | |
434 | array_expr = p2, index_exp = i1; | |
435 | else | |
436 | { | |
437 | error ("invalid types %<%T[%T]%> for array subscript", | |
438 | type, TREE_TYPE (index_exp)); | |
439 | return error_mark_node; | |
440 | } | |
441 | ||
442 | if (array_expr == error_mark_node || index_exp == error_mark_node) | |
443 | error ("ambiguous conversion for array subscript"); | |
444 | ||
445 | expr = build_array_ref (input_location, array_expr, index_exp); | |
446 | } | |
447 | if (processing_template_decl && expr != error_mark_node) | |
448 | return build_min_non_dep (ARRAY_REF, expr, orig_array_expr, orig_index_exp, | |
449 | NULL_TREE, NULL_TREE); | |
450 | return expr; | |
451 | } | |
452 | ||
453 | /* Given the cast expression EXP, checking out its validity. Either return | |
454 | an error_mark_node if there was an unavoidable error, return a cast to | |
455 | void for trying to delete a pointer w/ the value 0, or return the | |
456 | call to delete. If DOING_VEC is true, we handle things differently | |
457 | for doing an array delete. | |
458 | Implements ARM $5.3.4. This is called from the parser. */ | |
459 | ||
460 | tree | |
461 | delete_sanity (tree exp, tree size, bool doing_vec, int use_global_delete, | |
462 | tsubst_flags_t complain) | |
463 | { | |
464 | tree t, type; | |
465 | ||
466 | if (exp == error_mark_node) | |
467 | return exp; | |
468 | ||
469 | if (processing_template_decl) | |
470 | { | |
471 | t = build_min (DELETE_EXPR, void_type_node, exp, size); | |
472 | DELETE_EXPR_USE_GLOBAL (t) = use_global_delete; | |
473 | DELETE_EXPR_USE_VEC (t) = doing_vec; | |
474 | TREE_SIDE_EFFECTS (t) = 1; | |
475 | return t; | |
476 | } | |
477 | ||
478 | /* An array can't have been allocated by new, so complain. */ | |
479 | if (TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE) | |
480 | warning (0, "deleting array %q#E", exp); | |
481 | ||
482 | t = build_expr_type_conversion (WANT_POINTER, exp, true); | |
483 | ||
484 | if (t == NULL_TREE || t == error_mark_node) | |
485 | { | |
486 | error ("type %q#T argument given to %<delete%>, expected pointer", | |
487 | TREE_TYPE (exp)); | |
488 | return error_mark_node; | |
489 | } | |
490 | ||
491 | type = TREE_TYPE (t); | |
492 | ||
493 | /* As of Valley Forge, you can delete a pointer to const. */ | |
494 | ||
495 | /* You can't delete functions. */ | |
496 | if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE) | |
497 | { | |
498 | error ("cannot delete a function. Only pointer-to-objects are " | |
499 | "valid arguments to %<delete%>"); | |
500 | return error_mark_node; | |
501 | } | |
502 | ||
503 | /* Deleting ptr to void is undefined behavior [expr.delete/3]. */ | |
504 | if (VOID_TYPE_P (TREE_TYPE (type))) | |
505 | { | |
506 | warning (OPT_Wdelete_incomplete, "deleting %qT is undefined", type); | |
507 | doing_vec = 0; | |
508 | } | |
509 | ||
510 | /* Deleting a pointer with the value zero is valid and has no effect. */ | |
511 | if (integer_zerop (t)) | |
512 | return build1 (NOP_EXPR, void_type_node, t); | |
513 | ||
514 | if (doing_vec) | |
515 | return build_vec_delete (t, /*maxindex=*/NULL_TREE, | |
516 | sfk_deleting_destructor, | |
517 | use_global_delete, complain); | |
518 | else | |
519 | return build_delete (type, t, sfk_deleting_destructor, | |
520 | LOOKUP_NORMAL, use_global_delete, | |
521 | complain); | |
522 | } | |
523 | ||
524 | /* Report an error if the indicated template declaration is not the | |
525 | sort of thing that should be a member template. */ | |
526 | ||
527 | void | |
528 | check_member_template (tree tmpl) | |
529 | { | |
530 | tree decl; | |
531 | ||
532 | gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL); | |
533 | decl = DECL_TEMPLATE_RESULT (tmpl); | |
534 | ||
535 | if (TREE_CODE (decl) == FUNCTION_DECL | |
536 | || DECL_ALIAS_TEMPLATE_P (tmpl) | |
537 | || (TREE_CODE (decl) == TYPE_DECL | |
538 | && MAYBE_CLASS_TYPE_P (TREE_TYPE (decl)))) | |
539 | { | |
540 | /* The parser rejects template declarations in local classes | |
541 | (with the exception of generic lambdas). */ | |
542 | gcc_assert (!current_function_decl || LAMBDA_FUNCTION_P (decl)); | |
543 | /* The parser rejects any use of virtual in a function template. */ | |
544 | gcc_assert (!(TREE_CODE (decl) == FUNCTION_DECL | |
545 | && DECL_VIRTUAL_P (decl))); | |
546 | ||
547 | /* The debug-information generating code doesn't know what to do | |
548 | with member templates. */ | |
549 | DECL_IGNORED_P (tmpl) = 1; | |
550 | } | |
551 | else if (variable_template_p (tmpl)) | |
552 | /* OK */; | |
553 | else | |
554 | error ("template declaration of %q#D", decl); | |
555 | } | |
556 | ||
557 | /* Return true iff TYPE is a valid Java parameter or return type. */ | |
558 | ||
559 | static bool | |
560 | acceptable_java_type (tree type) | |
561 | { | |
562 | if (type == error_mark_node) | |
563 | return false; | |
564 | ||
565 | if (VOID_TYPE_P (type) || TYPE_FOR_JAVA (type)) | |
566 | return true; | |
567 | if (TYPE_PTR_P (type) || TREE_CODE (type) == REFERENCE_TYPE) | |
568 | { | |
569 | type = TREE_TYPE (type); | |
570 | if (TREE_CODE (type) == RECORD_TYPE) | |
571 | { | |
572 | tree args; int i; | |
573 | if (! TYPE_FOR_JAVA (type)) | |
574 | return false; | |
575 | if (! CLASSTYPE_TEMPLATE_INFO (type)) | |
576 | return true; | |
577 | args = CLASSTYPE_TI_ARGS (type); | |
578 | i = TREE_VEC_LENGTH (args); | |
579 | while (--i >= 0) | |
580 | { | |
581 | type = TREE_VEC_ELT (args, i); | |
582 | if (TYPE_PTR_P (type)) | |
583 | type = TREE_TYPE (type); | |
584 | if (! TYPE_FOR_JAVA (type)) | |
585 | return false; | |
586 | } | |
587 | return true; | |
588 | } | |
589 | } | |
590 | return false; | |
591 | } | |
592 | ||
593 | /* For a METHOD in a Java class CTYPE, return true if | |
594 | the parameter and return types are valid Java types. | |
595 | Otherwise, print appropriate error messages, and return false. */ | |
596 | ||
597 | bool | |
598 | check_java_method (tree method) | |
599 | { | |
600 | bool jerr = false; | |
601 | tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method)); | |
602 | tree ret_type = TREE_TYPE (TREE_TYPE (method)); | |
603 | ||
604 | if (!acceptable_java_type (ret_type)) | |
605 | { | |
606 | error ("Java method %qD has non-Java return type %qT", | |
607 | method, ret_type); | |
608 | jerr = true; | |
609 | } | |
610 | ||
611 | arg_types = TREE_CHAIN (arg_types); | |
612 | if (DECL_HAS_IN_CHARGE_PARM_P (method)) | |
613 | arg_types = TREE_CHAIN (arg_types); | |
614 | if (DECL_HAS_VTT_PARM_P (method)) | |
615 | arg_types = TREE_CHAIN (arg_types); | |
616 | ||
617 | for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types)) | |
618 | { | |
619 | tree type = TREE_VALUE (arg_types); | |
620 | if (!acceptable_java_type (type)) | |
621 | { | |
622 | if (type != error_mark_node) | |
623 | error ("Java method %qD has non-Java parameter type %qT", | |
624 | method, type); | |
625 | jerr = true; | |
626 | } | |
627 | } | |
628 | return !jerr; | |
629 | } | |
630 | ||
631 | /* Sanity check: report error if this function FUNCTION is not | |
632 | really a member of the class (CTYPE) it is supposed to belong to. | |
633 | TEMPLATE_PARMS is used to specify the template parameters of a member | |
634 | template passed as FUNCTION_DECL. If the member template is passed as a | |
635 | TEMPLATE_DECL, it can be NULL since the parameters can be extracted | |
636 | from the declaration. If the function is not a function template, it | |
637 | must be NULL. | |
638 | It returns the original declaration for the function, NULL_TREE if | |
639 | no declaration was found, error_mark_node if an error was emitted. */ | |
640 | ||
641 | tree | |
642 | check_classfn (tree ctype, tree function, tree template_parms) | |
643 | { | |
644 | int ix; | |
645 | bool is_template; | |
646 | tree pushed_scope; | |
647 | ||
648 | if (DECL_USE_TEMPLATE (function) | |
649 | && !(TREE_CODE (function) == TEMPLATE_DECL | |
650 | && DECL_TEMPLATE_SPECIALIZATION (function)) | |
651 | && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (function))) | |
652 | /* Since this is a specialization of a member template, | |
653 | we're not going to find the declaration in the class. | |
654 | For example, in: | |
655 | ||
656 | struct S { template <typename T> void f(T); }; | |
657 | template <> void S::f(int); | |
658 | ||
659 | we're not going to find `S::f(int)', but there's no | |
660 | reason we should, either. We let our callers know we didn't | |
661 | find the method, but we don't complain. */ | |
662 | return NULL_TREE; | |
663 | ||
664 | /* Basic sanity check: for a template function, the template parameters | |
665 | either were not passed, or they are the same of DECL_TEMPLATE_PARMS. */ | |
666 | if (TREE_CODE (function) == TEMPLATE_DECL) | |
667 | { | |
668 | if (template_parms | |
669 | && !comp_template_parms (template_parms, | |
670 | DECL_TEMPLATE_PARMS (function))) | |
671 | { | |
672 | error ("template parameter lists provided don%'t match the " | |
673 | "template parameters of %qD", function); | |
674 | return error_mark_node; | |
675 | } | |
676 | template_parms = DECL_TEMPLATE_PARMS (function); | |
677 | } | |
678 | ||
679 | /* OK, is this a definition of a member template? */ | |
680 | is_template = (template_parms != NULL_TREE); | |
681 | ||
682 | /* [temp.mem] | |
683 | ||
684 | A destructor shall not be a member template. */ | |
685 | if (DECL_DESTRUCTOR_P (function) && is_template) | |
686 | { | |
687 | error ("destructor %qD declared as member template", function); | |
688 | return error_mark_node; | |
689 | } | |
690 | ||
691 | /* We must enter the scope here, because conversion operators are | |
692 | named by target type, and type equivalence relies on typenames | |
693 | resolving within the scope of CTYPE. */ | |
694 | pushed_scope = push_scope (ctype); | |
695 | ix = class_method_index_for_fn (complete_type (ctype), function); | |
696 | if (ix >= 0) | |
697 | { | |
698 | vec<tree, va_gc> *methods = CLASSTYPE_METHOD_VEC (ctype); | |
699 | tree fndecls, fndecl = 0; | |
700 | bool is_conv_op; | |
701 | const char *format = NULL; | |
702 | ||
703 | for (fndecls = (*methods)[ix]; | |
704 | fndecls; fndecls = OVL_NEXT (fndecls)) | |
705 | { | |
706 | tree p1, p2; | |
707 | ||
708 | fndecl = OVL_CURRENT (fndecls); | |
709 | p1 = TYPE_ARG_TYPES (TREE_TYPE (function)); | |
710 | p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); | |
711 | ||
712 | /* We cannot simply call decls_match because this doesn't | |
713 | work for static member functions that are pretending to | |
714 | be methods, and because the name may have been changed by | |
715 | asm("new_name"). */ | |
716 | ||
717 | /* Get rid of the this parameter on functions that become | |
718 | static. */ | |
719 | if (DECL_STATIC_FUNCTION_P (fndecl) | |
720 | && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE) | |
721 | p1 = TREE_CHAIN (p1); | |
722 | ||
723 | /* A member template definition only matches a member template | |
724 | declaration. */ | |
725 | if (is_template != (TREE_CODE (fndecl) == TEMPLATE_DECL)) | |
726 | continue; | |
727 | ||
728 | /* ref-qualifier or absence of same must match. */ | |
729 | if (type_memfn_rqual (TREE_TYPE (function)) | |
730 | != type_memfn_rqual (TREE_TYPE (fndecl))) | |
731 | continue; | |
732 | ||
733 | /* While finding a match, same types and params are not enough | |
734 | if the function is versioned. Also check version ("target") | |
735 | attributes. */ | |
736 | if (same_type_p (TREE_TYPE (TREE_TYPE (function)), | |
737 | TREE_TYPE (TREE_TYPE (fndecl))) | |
738 | && compparms (p1, p2) | |
739 | && !targetm.target_option.function_versions (function, fndecl) | |
740 | && (!is_template | |
741 | || comp_template_parms (template_parms, | |
742 | DECL_TEMPLATE_PARMS (fndecl))) | |
743 | && (DECL_TEMPLATE_SPECIALIZATION (function) | |
744 | == DECL_TEMPLATE_SPECIALIZATION (fndecl)) | |
745 | && (!DECL_TEMPLATE_SPECIALIZATION (function) | |
746 | || (DECL_TI_TEMPLATE (function) | |
747 | == DECL_TI_TEMPLATE (fndecl)))) | |
748 | break; | |
749 | } | |
750 | if (fndecls) | |
751 | { | |
752 | if (pushed_scope) | |
753 | pop_scope (pushed_scope); | |
754 | return OVL_CURRENT (fndecls); | |
755 | } | |
756 | ||
757 | error_at (DECL_SOURCE_LOCATION (function), | |
758 | "prototype for %q#D does not match any in class %qT", | |
759 | function, ctype); | |
760 | is_conv_op = DECL_CONV_FN_P (fndecl); | |
761 | ||
762 | if (is_conv_op) | |
763 | ix = CLASSTYPE_FIRST_CONVERSION_SLOT; | |
764 | fndecls = (*methods)[ix]; | |
765 | while (fndecls) | |
766 | { | |
767 | fndecl = OVL_CURRENT (fndecls); | |
768 | fndecls = OVL_NEXT (fndecls); | |
769 | ||
770 | if (!fndecls && is_conv_op) | |
771 | { | |
772 | if (methods->length () > (size_t) ++ix) | |
773 | { | |
774 | fndecls = (*methods)[ix]; | |
775 | if (!DECL_CONV_FN_P (OVL_CURRENT (fndecls))) | |
776 | { | |
777 | fndecls = NULL_TREE; | |
778 | is_conv_op = false; | |
779 | } | |
780 | } | |
781 | else | |
782 | is_conv_op = false; | |
783 | } | |
784 | if (format) | |
785 | format = " %+#D"; | |
786 | else if (fndecls) | |
787 | format = N_("candidates are: %+#D"); | |
788 | else | |
789 | format = N_("candidate is: %+#D"); | |
790 | error (format, fndecl); | |
791 | } | |
792 | } | |
793 | else if (!COMPLETE_TYPE_P (ctype)) | |
794 | cxx_incomplete_type_error (function, ctype); | |
795 | else | |
796 | error ("no %q#D member function declared in class %qT", | |
797 | function, ctype); | |
798 | ||
799 | if (pushed_scope) | |
800 | pop_scope (pushed_scope); | |
801 | return error_mark_node; | |
802 | } | |
803 | ||
804 | /* DECL is a function with vague linkage. Remember it so that at the | |
805 | end of the translation unit we can decide whether or not to emit | |
806 | it. */ | |
807 | ||
808 | void | |
809 | note_vague_linkage_fn (tree decl) | |
810 | { | |
811 | DECL_DEFER_OUTPUT (decl) = 1; | |
812 | vec_safe_push (deferred_fns, decl); | |
813 | } | |
814 | ||
815 | /* As above, but for variable template instantiations. */ | |
816 | ||
817 | void | |
818 | note_variable_template_instantiation (tree decl) | |
819 | { | |
820 | vec_safe_push (pending_statics, decl); | |
821 | } | |
822 | ||
823 | /* We have just processed the DECL, which is a static data member. | |
824 | The other parameters are as for cp_finish_decl. */ | |
825 | ||
826 | void | |
827 | finish_static_data_member_decl (tree decl, | |
828 | tree init, bool init_const_expr_p, | |
829 | tree asmspec_tree, | |
830 | int flags) | |
831 | { | |
832 | DECL_CONTEXT (decl) = current_class_type; | |
833 | ||
834 | /* We cannot call pushdecl here, because that would fill in the | |
835 | TREE_CHAIN of our decl. Instead, we modify cp_finish_decl to do | |
836 | the right thing, namely, to put this decl out straight away. */ | |
837 | ||
838 | if (! processing_template_decl) | |
839 | vec_safe_push (pending_statics, decl); | |
840 | ||
841 | if (LOCAL_CLASS_P (current_class_type) | |
842 | /* We already complained about the template definition. */ | |
843 | && !DECL_TEMPLATE_INSTANTIATION (decl)) | |
844 | permerror (input_location, "local class %q#T shall not have static data member %q#D", | |
845 | current_class_type, decl); | |
846 | else | |
847 | for (tree t = current_class_type; TYPE_P (t); | |
848 | t = CP_TYPE_CONTEXT (t)) | |
849 | if (TYPE_ANONYMOUS_P (t)) | |
850 | { | |
851 | if (permerror (DECL_SOURCE_LOCATION (decl), | |
852 | "static data member %qD in unnamed class", decl)) | |
853 | inform (DECL_SOURCE_LOCATION (TYPE_NAME (t)), | |
854 | "unnamed class defined here"); | |
855 | break; | |
856 | } | |
857 | ||
858 | DECL_IN_AGGR_P (decl) = 1; | |
859 | ||
860 | if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE | |
861 | && TYPE_DOMAIN (TREE_TYPE (decl)) == NULL_TREE) | |
862 | SET_VAR_HAD_UNKNOWN_BOUND (decl); | |
863 | ||
864 | cp_finish_decl (decl, init, init_const_expr_p, asmspec_tree, flags); | |
865 | } | |
866 | ||
867 | /* DECLARATOR and DECLSPECS correspond to a class member. The other | |
868 | parameters are as for cp_finish_decl. Return the DECL for the | |
869 | class member declared. */ | |
870 | ||
871 | tree | |
872 | grokfield (const cp_declarator *declarator, | |
873 | cp_decl_specifier_seq *declspecs, | |
874 | tree init, bool init_const_expr_p, | |
875 | tree asmspec_tree, | |
876 | tree attrlist) | |
877 | { | |
878 | tree value; | |
879 | const char *asmspec = 0; | |
880 | int flags; | |
881 | tree name; | |
882 | ||
883 | if (init | |
884 | && TREE_CODE (init) == TREE_LIST | |
885 | && TREE_VALUE (init) == error_mark_node | |
886 | && TREE_CHAIN (init) == NULL_TREE) | |
887 | init = NULL_TREE; | |
888 | ||
889 | value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist); | |
890 | if (! value || value == error_mark_node) | |
891 | /* friend or constructor went bad. */ | |
892 | return error_mark_node; | |
893 | if (TREE_TYPE (value) == error_mark_node) | |
894 | return value; | |
895 | ||
896 | if (TREE_CODE (value) == TYPE_DECL && init) | |
897 | { | |
898 | error ("typedef %qD is initialized (use decltype instead)", value); | |
899 | init = NULL_TREE; | |
900 | } | |
901 | ||
902 | /* Pass friendly classes back. */ | |
903 | if (value == void_type_node) | |
904 | return value; | |
905 | ||
906 | ||
907 | name = DECL_NAME (value); | |
908 | ||
909 | if (name != NULL_TREE) | |
910 | { | |
911 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
912 | { | |
913 | error ("explicit template argument list not allowed"); | |
914 | return error_mark_node; | |
915 | } | |
916 | ||
917 | if (IDENTIFIER_POINTER (name)[0] == '_' | |
918 | && ! strcmp (IDENTIFIER_POINTER (name), "_vptr")) | |
919 | error ("member %qD conflicts with virtual function table field name", | |
920 | value); | |
921 | } | |
922 | ||
923 | /* Stash away type declarations. */ | |
924 | if (TREE_CODE (value) == TYPE_DECL) | |
925 | { | |
926 | DECL_NONLOCAL (value) = 1; | |
927 | DECL_CONTEXT (value) = current_class_type; | |
928 | ||
929 | if (attrlist) | |
930 | { | |
931 | int attrflags = 0; | |
932 | ||
933 | /* If this is a typedef that names the class for linkage purposes | |
934 | (7.1.3p8), apply any attributes directly to the type. */ | |
935 | if (OVERLOAD_TYPE_P (TREE_TYPE (value)) | |
936 | && value == TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (value)))) | |
937 | attrflags = ATTR_FLAG_TYPE_IN_PLACE; | |
938 | ||
939 | cplus_decl_attributes (&value, attrlist, attrflags); | |
940 | } | |
941 | ||
942 | if (decl_spec_seq_has_spec_p (declspecs, ds_typedef) | |
943 | && TREE_TYPE (value) != error_mark_node | |
944 | && TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (value))) != value) | |
945 | set_underlying_type (value); | |
946 | ||
947 | /* It's important that push_template_decl below follows | |
948 | set_underlying_type above so that the created template | |
949 | carries the properly set type of VALUE. */ | |
950 | if (processing_template_decl) | |
951 | value = push_template_decl (value); | |
952 | ||
953 | record_locally_defined_typedef (value); | |
954 | return value; | |
955 | } | |
956 | ||
957 | int friendp = decl_spec_seq_has_spec_p (declspecs, ds_friend); | |
958 | ||
959 | if (!friendp && DECL_IN_AGGR_P (value)) | |
960 | { | |
961 | error ("%qD is already defined in %qT", value, DECL_CONTEXT (value)); | |
962 | return void_type_node; | |
963 | } | |
964 | ||
965 | if (asmspec_tree && asmspec_tree != error_mark_node) | |
966 | asmspec = TREE_STRING_POINTER (asmspec_tree); | |
967 | ||
968 | if (init) | |
969 | { | |
970 | if (TREE_CODE (value) == FUNCTION_DECL) | |
971 | { | |
972 | if (init == ridpointers[(int)RID_DELETE]) | |
973 | { | |
974 | DECL_DELETED_FN (value) = 1; | |
975 | DECL_DECLARED_INLINE_P (value) = 1; | |
976 | DECL_INITIAL (value) = error_mark_node; | |
977 | } | |
978 | else if (init == ridpointers[(int)RID_DEFAULT]) | |
979 | { | |
980 | if (defaultable_fn_check (value)) | |
981 | { | |
982 | DECL_DEFAULTED_FN (value) = 1; | |
983 | DECL_INITIALIZED_IN_CLASS_P (value) = 1; | |
984 | DECL_DECLARED_INLINE_P (value) = 1; | |
985 | } | |
986 | } | |
987 | else if (TREE_CODE (init) == DEFAULT_ARG) | |
988 | error ("invalid initializer for member function %qD", value); | |
989 | else if (TREE_CODE (TREE_TYPE (value)) == METHOD_TYPE) | |
990 | { | |
991 | if (integer_zerop (init)) | |
992 | DECL_PURE_VIRTUAL_P (value) = 1; | |
993 | else if (error_operand_p (init)) | |
994 | ; /* An error has already been reported. */ | |
995 | else | |
996 | error ("invalid initializer for member function %qD", | |
997 | value); | |
998 | } | |
999 | else | |
1000 | { | |
1001 | gcc_assert (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE); | |
1002 | if (friendp) | |
1003 | error ("initializer specified for friend function %qD", | |
1004 | value); | |
1005 | else | |
1006 | error ("initializer specified for static member function %qD", | |
1007 | value); | |
1008 | } | |
1009 | } | |
1010 | else if (TREE_CODE (value) == FIELD_DECL) | |
1011 | /* C++11 NSDMI, keep going. */; | |
1012 | else if (!VAR_P (value)) | |
1013 | gcc_unreachable (); | |
1014 | } | |
1015 | ||
1016 | /* Pass friend decls back. */ | |
1017 | if ((TREE_CODE (value) == FUNCTION_DECL | |
1018 | || TREE_CODE (value) == TEMPLATE_DECL) | |
1019 | && DECL_CONTEXT (value) != current_class_type) | |
1020 | return value; | |
1021 | ||
1022 | /* Need to set this before push_template_decl. */ | |
1023 | if (TREE_CODE (value) == VAR_DECL) | |
1024 | DECL_CONTEXT (value) = current_class_type; | |
1025 | ||
1026 | if (processing_template_decl && VAR_OR_FUNCTION_DECL_P (value)) | |
1027 | { | |
1028 | value = push_template_decl (value); | |
1029 | if (error_operand_p (value)) | |
1030 | return error_mark_node; | |
1031 | } | |
1032 | ||
1033 | if (attrlist) | |
1034 | cplus_decl_attributes (&value, attrlist, 0); | |
1035 | ||
1036 | if (init && DIRECT_LIST_INIT_P (init)) | |
1037 | flags = LOOKUP_NORMAL; | |
1038 | else | |
1039 | flags = LOOKUP_IMPLICIT; | |
1040 | ||
1041 | switch (TREE_CODE (value)) | |
1042 | { | |
1043 | case VAR_DECL: | |
1044 | finish_static_data_member_decl (value, init, init_const_expr_p, | |
1045 | asmspec_tree, flags); | |
1046 | return value; | |
1047 | ||
1048 | case FIELD_DECL: | |
1049 | if (asmspec) | |
1050 | error ("%<asm%> specifiers are not permitted on non-static data members"); | |
1051 | if (DECL_INITIAL (value) == error_mark_node) | |
1052 | init = error_mark_node; | |
1053 | cp_finish_decl (value, init, /*init_const_expr_p=*/false, | |
1054 | NULL_TREE, flags); | |
1055 | DECL_IN_AGGR_P (value) = 1; | |
1056 | return value; | |
1057 | ||
1058 | case FUNCTION_DECL: | |
1059 | if (asmspec) | |
1060 | set_user_assembler_name (value, asmspec); | |
1061 | ||
1062 | cp_finish_decl (value, | |
1063 | /*init=*/NULL_TREE, | |
1064 | /*init_const_expr_p=*/false, | |
1065 | asmspec_tree, flags); | |
1066 | ||
1067 | /* Pass friends back this way. */ | |
1068 | if (DECL_FRIEND_P (value)) | |
1069 | return void_type_node; | |
1070 | ||
1071 | DECL_IN_AGGR_P (value) = 1; | |
1072 | return value; | |
1073 | ||
1074 | default: | |
1075 | gcc_unreachable (); | |
1076 | } | |
1077 | return NULL_TREE; | |
1078 | } | |
1079 | ||
1080 | /* Like `grokfield', but for bitfields. | |
1081 | WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */ | |
1082 | ||
1083 | tree | |
1084 | grokbitfield (const cp_declarator *declarator, | |
1085 | cp_decl_specifier_seq *declspecs, tree width, | |
1086 | tree attrlist) | |
1087 | { | |
1088 | tree value = grokdeclarator (declarator, declspecs, BITFIELD, 0, &attrlist); | |
1089 | ||
1090 | if (value == error_mark_node) | |
1091 | return NULL_TREE; /* friends went bad. */ | |
1092 | if (TREE_TYPE (value) == error_mark_node) | |
1093 | return value; | |
1094 | ||
1095 | /* Pass friendly classes back. */ | |
1096 | if (VOID_TYPE_P (value)) | |
1097 | return void_type_node; | |
1098 | ||
1099 | if (!INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (value)) | |
1100 | && (POINTER_TYPE_P (value) | |
1101 | || !dependent_type_p (TREE_TYPE (value)))) | |
1102 | { | |
1103 | error ("bit-field %qD with non-integral type", value); | |
1104 | return error_mark_node; | |
1105 | } | |
1106 | ||
1107 | if (TREE_CODE (value) == TYPE_DECL) | |
1108 | { | |
1109 | error ("cannot declare %qD to be a bit-field type", value); | |
1110 | return NULL_TREE; | |
1111 | } | |
1112 | ||
1113 | /* Usually, finish_struct_1 catches bitfields with invalid types. | |
1114 | But, in the case of bitfields with function type, we confuse | |
1115 | ourselves into thinking they are member functions, so we must | |
1116 | check here. */ | |
1117 | if (TREE_CODE (value) == FUNCTION_DECL) | |
1118 | { | |
1119 | error ("cannot declare bit-field %qD with function type", | |
1120 | DECL_NAME (value)); | |
1121 | return NULL_TREE; | |
1122 | } | |
1123 | ||
1124 | if (DECL_IN_AGGR_P (value)) | |
1125 | { | |
1126 | error ("%qD is already defined in the class %qT", value, | |
1127 | DECL_CONTEXT (value)); | |
1128 | return void_type_node; | |
1129 | } | |
1130 | ||
1131 | if (TREE_STATIC (value)) | |
1132 | { | |
1133 | error ("static member %qD cannot be a bit-field", value); | |
1134 | return NULL_TREE; | |
1135 | } | |
1136 | cp_finish_decl (value, NULL_TREE, false, NULL_TREE, 0); | |
1137 | ||
1138 | if (width != error_mark_node) | |
1139 | { | |
1140 | /* The width must be an integer type. */ | |
1141 | if (!type_dependent_expression_p (width) | |
1142 | && !INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (width))) | |
1143 | error ("width of bit-field %qD has non-integral type %qT", value, | |
1144 | TREE_TYPE (width)); | |
1145 | DECL_INITIAL (value) = width; | |
1146 | SET_DECL_C_BIT_FIELD (value); | |
1147 | } | |
1148 | ||
1149 | DECL_IN_AGGR_P (value) = 1; | |
1150 | ||
1151 | if (attrlist) | |
1152 | cplus_decl_attributes (&value, attrlist, /*flags=*/0); | |
1153 | ||
1154 | return value; | |
1155 | } | |
1156 | ||
1157 | \f | |
1158 | /* Returns true iff ATTR is an attribute which needs to be applied at | |
1159 | instantiation time rather than template definition time. */ | |
1160 | ||
1161 | static bool | |
1162 | is_late_template_attribute (tree attr, tree decl) | |
1163 | { | |
1164 | tree name = get_attribute_name (attr); | |
1165 | tree args = TREE_VALUE (attr); | |
1166 | const struct attribute_spec *spec = lookup_attribute_spec (name); | |
1167 | tree arg; | |
1168 | ||
1169 | if (!spec) | |
1170 | /* Unknown attribute. */ | |
1171 | return false; | |
1172 | ||
1173 | /* Attribute weak handling wants to write out assembly right away. */ | |
1174 | if (is_attribute_p ("weak", name)) | |
1175 | return true; | |
1176 | ||
1177 | /* Attribute unused is applied directly, as it appertains to | |
1178 | decls. */ | |
1179 | if (is_attribute_p ("unused", name)) | |
1180 | return false; | |
1181 | ||
1182 | /* #pragma omp declare simd attribute needs to be always deferred. */ | |
1183 | if (flag_openmp | |
1184 | && is_attribute_p ("omp declare simd", name)) | |
1185 | return true; | |
1186 | ||
558d4a67 JM |
1187 | /* An attribute pack is clearly dependent. */ |
1188 | if (args && PACK_EXPANSION_P (args)) | |
1189 | return true; | |
1190 | ||
dda118e3 JM |
1191 | /* If any of the arguments are dependent expressions, we can't evaluate |
1192 | the attribute until instantiation time. */ | |
1193 | for (arg = args; arg; arg = TREE_CHAIN (arg)) | |
1194 | { | |
1195 | tree t = TREE_VALUE (arg); | |
1196 | ||
1197 | /* If the first attribute argument is an identifier, only consider | |
1198 | second and following arguments. Attributes like mode, format, | |
1199 | cleanup and several target specific attributes aren't late | |
1200 | just because they have an IDENTIFIER_NODE as first argument. */ | |
1201 | if (arg == args && identifier_p (t)) | |
1202 | continue; | |
1203 | ||
1204 | if (value_dependent_expression_p (t) | |
1205 | || type_dependent_expression_p (t)) | |
1206 | return true; | |
1207 | } | |
1208 | ||
1209 | if (TREE_CODE (decl) == TYPE_DECL | |
1210 | || TYPE_P (decl) | |
1211 | || spec->type_required) | |
1212 | { | |
1213 | tree type = TYPE_P (decl) ? decl : TREE_TYPE (decl); | |
1214 | ||
1215 | /* We can't apply any attributes to a completely unknown type until | |
1216 | instantiation time. */ | |
1217 | enum tree_code code = TREE_CODE (type); | |
1218 | if (code == TEMPLATE_TYPE_PARM | |
1219 | || code == BOUND_TEMPLATE_TEMPLATE_PARM | |
1220 | || code == TYPENAME_TYPE) | |
1221 | return true; | |
1222 | /* Also defer most attributes on dependent types. This is not | |
1223 | necessary in all cases, but is the better default. */ | |
1224 | else if (dependent_type_p (type) | |
1225 | /* But some attributes specifically apply to templates. */ | |
1226 | && !is_attribute_p ("abi_tag", name) | |
1227 | && !is_attribute_p ("deprecated", name) | |
1228 | && !is_attribute_p ("visibility", name)) | |
1229 | return true; | |
1230 | else | |
1231 | return false; | |
1232 | } | |
1233 | else | |
1234 | return false; | |
1235 | } | |
1236 | ||
1237 | /* ATTR_P is a list of attributes. Remove any attributes which need to be | |
1238 | applied at instantiation time and return them. If IS_DEPENDENT is true, | |
1239 | the declaration itself is dependent, so all attributes should be applied | |
1240 | at instantiation time. */ | |
1241 | ||
1242 | static tree | |
1243 | splice_template_attributes (tree *attr_p, tree decl) | |
1244 | { | |
1245 | tree *p = attr_p; | |
1246 | tree late_attrs = NULL_TREE; | |
1247 | tree *q = &late_attrs; | |
1248 | ||
1249 | if (!p) | |
1250 | return NULL_TREE; | |
1251 | ||
1252 | for (; *p; ) | |
1253 | { | |
1254 | if (is_late_template_attribute (*p, decl)) | |
1255 | { | |
1256 | ATTR_IS_DEPENDENT (*p) = 1; | |
1257 | *q = *p; | |
1258 | *p = TREE_CHAIN (*p); | |
1259 | q = &TREE_CHAIN (*q); | |
1260 | *q = NULL_TREE; | |
1261 | } | |
1262 | else | |
1263 | p = &TREE_CHAIN (*p); | |
1264 | } | |
1265 | ||
1266 | return late_attrs; | |
1267 | } | |
1268 | ||
1269 | /* Remove any late attributes from the list in ATTR_P and attach them to | |
1270 | DECL_P. */ | |
1271 | ||
1272 | static void | |
1273 | save_template_attributes (tree *attr_p, tree *decl_p) | |
1274 | { | |
1275 | tree *q; | |
1276 | ||
1277 | if (attr_p && *attr_p == error_mark_node) | |
1278 | return; | |
1279 | ||
1280 | tree late_attrs = splice_template_attributes (attr_p, *decl_p); | |
1281 | if (!late_attrs) | |
1282 | return; | |
1283 | ||
1284 | if (DECL_P (*decl_p)) | |
1285 | q = &DECL_ATTRIBUTES (*decl_p); | |
1286 | else | |
1287 | q = &TYPE_ATTRIBUTES (*decl_p); | |
1288 | ||
1289 | tree old_attrs = *q; | |
1290 | ||
1291 | /* Merge the late attributes at the beginning with the attribute | |
1292 | list. */ | |
1293 | late_attrs = merge_attributes (late_attrs, *q); | |
1294 | *q = late_attrs; | |
1295 | ||
1296 | if (!DECL_P (*decl_p) && *decl_p == TYPE_MAIN_VARIANT (*decl_p)) | |
1297 | { | |
1298 | /* We've added new attributes directly to the main variant, so | |
1299 | now we need to update all of the other variants to include | |
1300 | these new attributes. */ | |
1301 | tree variant; | |
1302 | for (variant = TYPE_NEXT_VARIANT (*decl_p); variant; | |
1303 | variant = TYPE_NEXT_VARIANT (variant)) | |
1304 | { | |
1305 | gcc_assert (TYPE_ATTRIBUTES (variant) == old_attrs); | |
1306 | TYPE_ATTRIBUTES (variant) = TYPE_ATTRIBUTES (*decl_p); | |
1307 | } | |
1308 | } | |
1309 | } | |
1310 | ||
1311 | /* Return true iff ATTRS are acceptable attributes to be applied in-place | |
1312 | to a typedef which gives a previously anonymous class or enum a name for | |
1313 | linkage purposes. */ | |
1314 | ||
1315 | bool | |
1316 | attributes_naming_typedef_ok (tree attrs) | |
1317 | { | |
1318 | for (; attrs; attrs = TREE_CHAIN (attrs)) | |
1319 | { | |
1320 | tree name = get_attribute_name (attrs); | |
1321 | if (is_attribute_p ("vector_size", name)) | |
1322 | return false; | |
1323 | } | |
1324 | return true; | |
1325 | } | |
1326 | ||
1327 | /* Like reconstruct_complex_type, but handle also template trees. */ | |
1328 | ||
1329 | tree | |
1330 | cp_reconstruct_complex_type (tree type, tree bottom) | |
1331 | { | |
1332 | tree inner, outer; | |
1333 | bool late_return_type_p = false; | |
1334 | ||
1335 | if (TYPE_PTR_P (type)) | |
1336 | { | |
1337 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1338 | outer = build_pointer_type_for_mode (inner, TYPE_MODE (type), | |
1339 | TYPE_REF_CAN_ALIAS_ALL (type)); | |
1340 | } | |
1341 | else if (TREE_CODE (type) == REFERENCE_TYPE) | |
1342 | { | |
1343 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1344 | outer = build_reference_type_for_mode (inner, TYPE_MODE (type), | |
1345 | TYPE_REF_CAN_ALIAS_ALL (type)); | |
1346 | } | |
1347 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
1348 | { | |
1349 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1350 | outer = build_cplus_array_type (inner, TYPE_DOMAIN (type)); | |
1351 | /* Don't call cp_build_qualified_type on ARRAY_TYPEs, the | |
1352 | element type qualification will be handled by the recursive | |
1353 | cp_reconstruct_complex_type call and cp_build_qualified_type | |
1354 | for ARRAY_TYPEs changes the element type. */ | |
1355 | return outer; | |
1356 | } | |
1357 | else if (TREE_CODE (type) == FUNCTION_TYPE) | |
1358 | { | |
1359 | late_return_type_p = TYPE_HAS_LATE_RETURN_TYPE (type); | |
1360 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1361 | outer = build_function_type (inner, TYPE_ARG_TYPES (type)); | |
1362 | outer = apply_memfn_quals (outer, | |
1363 | type_memfn_quals (type), | |
1364 | type_memfn_rqual (type)); | |
1365 | } | |
1366 | else if (TREE_CODE (type) == METHOD_TYPE) | |
1367 | { | |
1368 | late_return_type_p = TYPE_HAS_LATE_RETURN_TYPE (type); | |
1369 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1370 | /* The build_method_type_directly() routine prepends 'this' to argument list, | |
1371 | so we must compensate by getting rid of it. */ | |
1372 | outer | |
1373 | = build_method_type_directly | |
1374 | (class_of_this_parm (type), inner, | |
1375 | TREE_CHAIN (TYPE_ARG_TYPES (type))); | |
1376 | } | |
1377 | else if (TREE_CODE (type) == OFFSET_TYPE) | |
1378 | { | |
1379 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1380 | outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner); | |
1381 | } | |
1382 | else | |
1383 | return bottom; | |
1384 | ||
1385 | if (TYPE_ATTRIBUTES (type)) | |
1386 | outer = cp_build_type_attribute_variant (outer, TYPE_ATTRIBUTES (type)); | |
1387 | outer = cp_build_qualified_type (outer, cp_type_quals (type)); | |
1388 | ||
1389 | if (late_return_type_p) | |
1390 | TYPE_HAS_LATE_RETURN_TYPE (outer) = 1; | |
1391 | ||
1392 | return outer; | |
1393 | } | |
1394 | ||
1395 | /* Replaces any constexpr expression that may be into the attributes | |
1396 | arguments with their reduced value. */ | |
1397 | ||
1398 | static void | |
1399 | cp_check_const_attributes (tree attributes) | |
1400 | { | |
1401 | if (attributes == error_mark_node) | |
1402 | return; | |
1403 | ||
1404 | tree attr; | |
1405 | for (attr = attributes; attr; attr = TREE_CHAIN (attr)) | |
1406 | { | |
1407 | tree arg; | |
1408 | for (arg = TREE_VALUE (attr); arg; arg = TREE_CHAIN (arg)) | |
1409 | { | |
1410 | tree expr = TREE_VALUE (arg); | |
1411 | if (EXPR_P (expr)) | |
1412 | TREE_VALUE (arg) = maybe_constant_value (expr); | |
1413 | } | |
1414 | } | |
1415 | } | |
1416 | ||
1417 | /* Return true if TYPE is an OpenMP mappable type. */ | |
1418 | bool | |
1419 | cp_omp_mappable_type (tree type) | |
1420 | { | |
1421 | /* Mappable type has to be complete. */ | |
1422 | if (type == error_mark_node || !COMPLETE_TYPE_P (type)) | |
1423 | return false; | |
1424 | /* Arrays have mappable type if the elements have mappable type. */ | |
1425 | while (TREE_CODE (type) == ARRAY_TYPE) | |
1426 | type = TREE_TYPE (type); | |
1427 | /* A mappable type cannot contain virtual members. */ | |
1428 | if (CLASS_TYPE_P (type) && CLASSTYPE_VTABLES (type)) | |
1429 | return false; | |
1430 | /* All data members must be non-static. */ | |
1431 | if (CLASS_TYPE_P (type)) | |
1432 | { | |
1433 | tree field; | |
1434 | for (field = TYPE_FIELDS (type); field; field = DECL_CHAIN (field)) | |
1435 | if (TREE_CODE (field) == VAR_DECL) | |
1436 | return false; | |
1437 | /* All fields must have mappable types. */ | |
1438 | else if (TREE_CODE (field) == FIELD_DECL | |
1439 | && !cp_omp_mappable_type (TREE_TYPE (field))) | |
1440 | return false; | |
1441 | } | |
1442 | return true; | |
1443 | } | |
1444 | ||
1445 | /* Like decl_attributes, but handle C++ complexity. */ | |
1446 | ||
1447 | void | |
1448 | cplus_decl_attributes (tree *decl, tree attributes, int flags) | |
1449 | { | |
1450 | if (*decl == NULL_TREE || *decl == void_type_node | |
1451 | || *decl == error_mark_node) | |
1452 | return; | |
1453 | ||
1454 | /* Add implicit "omp declare target" attribute if requested. */ | |
1455 | if (scope_chain->omp_declare_target_attribute | |
38c0c85b JM |
1456 | && ((TREE_CODE (*decl) == VAR_DECL |
1457 | && (TREE_STATIC (*decl) || DECL_EXTERNAL (*decl))) | |
dda118e3 JM |
1458 | || TREE_CODE (*decl) == FUNCTION_DECL)) |
1459 | { | |
1460 | if (TREE_CODE (*decl) == VAR_DECL | |
1461 | && DECL_CLASS_SCOPE_P (*decl)) | |
1462 | error ("%q+D static data member inside of declare target directive", | |
1463 | *decl); | |
1464 | else if (TREE_CODE (*decl) == VAR_DECL | |
1465 | && (DECL_FUNCTION_SCOPE_P (*decl) | |
1466 | || (current_function_decl && !DECL_EXTERNAL (*decl)))) | |
1467 | error ("%q+D in block scope inside of declare target directive", | |
1468 | *decl); | |
1469 | else if (!processing_template_decl | |
1470 | && TREE_CODE (*decl) == VAR_DECL | |
1471 | && !cp_omp_mappable_type (TREE_TYPE (*decl))) | |
1472 | error ("%q+D in declare target directive does not have mappable type", | |
1473 | *decl); | |
1474 | else | |
1475 | attributes = tree_cons (get_identifier ("omp declare target"), | |
1476 | NULL_TREE, attributes); | |
1477 | } | |
1478 | ||
1479 | if (processing_template_decl) | |
1480 | { | |
1481 | if (check_for_bare_parameter_packs (attributes)) | |
1482 | return; | |
1483 | ||
1484 | save_template_attributes (&attributes, decl); | |
1485 | } | |
1486 | ||
1487 | cp_check_const_attributes (attributes); | |
1488 | ||
1489 | if (TREE_CODE (*decl) == TEMPLATE_DECL) | |
1490 | decl = &DECL_TEMPLATE_RESULT (*decl); | |
1491 | ||
1492 | if (TREE_TYPE (*decl) && TYPE_PTRMEMFUNC_P (TREE_TYPE (*decl))) | |
1493 | { | |
1494 | attributes | |
1495 | = decl_attributes (decl, attributes, flags | ATTR_FLAG_FUNCTION_NEXT); | |
1496 | decl_attributes (&TYPE_PTRMEMFUNC_FN_TYPE_RAW (TREE_TYPE (*decl)), | |
1497 | attributes, flags); | |
1498 | } | |
1499 | else | |
1500 | decl_attributes (decl, attributes, flags); | |
1501 | ||
1502 | if (TREE_CODE (*decl) == TYPE_DECL) | |
1503 | SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl)); | |
1504 | ||
1505 | /* Propagate deprecation out to the template. */ | |
1506 | if (TREE_DEPRECATED (*decl)) | |
1507 | if (tree ti = get_template_info (*decl)) | |
1508 | { | |
1509 | tree tmpl = TI_TEMPLATE (ti); | |
1510 | tree pattern = (TYPE_P (*decl) ? TREE_TYPE (tmpl) | |
1511 | : DECL_TEMPLATE_RESULT (tmpl)); | |
1512 | if (*decl == pattern) | |
1513 | TREE_DEPRECATED (tmpl) = true; | |
1514 | } | |
1515 | } | |
1516 | \f | |
1517 | /* Walks through the namespace- or function-scope anonymous union | |
1518 | OBJECT, with the indicated TYPE, building appropriate VAR_DECLs. | |
1519 | Returns one of the fields for use in the mangled name. */ | |
1520 | ||
1521 | static tree | |
1522 | build_anon_union_vars (tree type, tree object) | |
1523 | { | |
1524 | tree main_decl = NULL_TREE; | |
1525 | tree field; | |
1526 | ||
1527 | /* Rather than write the code to handle the non-union case, | |
1528 | just give an error. */ | |
1529 | if (TREE_CODE (type) != UNION_TYPE) | |
1530 | { | |
1531 | error ("anonymous struct not inside named type"); | |
1532 | return error_mark_node; | |
1533 | } | |
1534 | ||
1535 | for (field = TYPE_FIELDS (type); | |
1536 | field != NULL_TREE; | |
1537 | field = DECL_CHAIN (field)) | |
1538 | { | |
1539 | tree decl; | |
1540 | tree ref; | |
1541 | ||
1542 | if (DECL_ARTIFICIAL (field)) | |
1543 | continue; | |
1544 | if (TREE_CODE (field) != FIELD_DECL) | |
1545 | { | |
1546 | permerror (input_location, "%q+#D invalid; an anonymous union can only " | |
1547 | "have non-static data members", field); | |
1548 | continue; | |
1549 | } | |
1550 | ||
1551 | if (TREE_PRIVATE (field)) | |
1552 | permerror (input_location, "private member %q+#D in anonymous union", field); | |
1553 | else if (TREE_PROTECTED (field)) | |
1554 | permerror (input_location, "protected member %q+#D in anonymous union", field); | |
1555 | ||
1556 | if (processing_template_decl) | |
1557 | ref = build_min_nt_loc (UNKNOWN_LOCATION, COMPONENT_REF, object, | |
1558 | DECL_NAME (field), NULL_TREE); | |
1559 | else | |
1560 | ref = build_class_member_access_expr (object, field, NULL_TREE, | |
1561 | false, tf_warning_or_error); | |
1562 | ||
1563 | if (DECL_NAME (field)) | |
1564 | { | |
1565 | tree base; | |
1566 | ||
1567 | decl = build_decl (input_location, | |
1568 | VAR_DECL, DECL_NAME (field), TREE_TYPE (field)); | |
1569 | DECL_ANON_UNION_VAR_P (decl) = 1; | |
1570 | DECL_ARTIFICIAL (decl) = 1; | |
1571 | ||
1572 | base = get_base_address (object); | |
1573 | TREE_PUBLIC (decl) = TREE_PUBLIC (base); | |
1574 | TREE_STATIC (decl) = TREE_STATIC (base); | |
1575 | DECL_EXTERNAL (decl) = DECL_EXTERNAL (base); | |
1576 | ||
1577 | SET_DECL_VALUE_EXPR (decl, ref); | |
1578 | DECL_HAS_VALUE_EXPR_P (decl) = 1; | |
1579 | ||
1580 | decl = pushdecl (decl); | |
1581 | } | |
1582 | else if (ANON_AGGR_TYPE_P (TREE_TYPE (field))) | |
1583 | decl = build_anon_union_vars (TREE_TYPE (field), ref); | |
1584 | else | |
1585 | decl = 0; | |
1586 | ||
1587 | if (main_decl == NULL_TREE) | |
1588 | main_decl = decl; | |
1589 | } | |
1590 | ||
1591 | return main_decl; | |
1592 | } | |
1593 | ||
1594 | /* Finish off the processing of a UNION_TYPE structure. If the union is an | |
1595 | anonymous union, then all members must be laid out together. PUBLIC_P | |
1596 | is nonzero if this union is not declared static. */ | |
1597 | ||
1598 | void | |
1599 | finish_anon_union (tree anon_union_decl) | |
1600 | { | |
1601 | tree type; | |
1602 | tree main_decl; | |
1603 | bool public_p; | |
1604 | ||
1605 | if (anon_union_decl == error_mark_node) | |
1606 | return; | |
1607 | ||
1608 | type = TREE_TYPE (anon_union_decl); | |
1609 | public_p = TREE_PUBLIC (anon_union_decl); | |
1610 | ||
1611 | /* The VAR_DECL's context is the same as the TYPE's context. */ | |
1612 | DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type)); | |
1613 | ||
1614 | if (TYPE_FIELDS (type) == NULL_TREE) | |
1615 | return; | |
1616 | ||
1617 | if (public_p) | |
1618 | { | |
1619 | error ("namespace-scope anonymous aggregates must be static"); | |
1620 | return; | |
1621 | } | |
1622 | ||
1623 | main_decl = build_anon_union_vars (type, anon_union_decl); | |
1624 | if (main_decl == error_mark_node) | |
1625 | return; | |
1626 | if (main_decl == NULL_TREE) | |
1627 | { | |
1628 | warning (0, "anonymous union with no members"); | |
1629 | return; | |
1630 | } | |
1631 | ||
1632 | if (!processing_template_decl) | |
1633 | { | |
1634 | /* Use main_decl to set the mangled name. */ | |
1635 | DECL_NAME (anon_union_decl) = DECL_NAME (main_decl); | |
1636 | maybe_commonize_var (anon_union_decl); | |
1637 | if (TREE_STATIC (anon_union_decl) || DECL_EXTERNAL (anon_union_decl)) | |
1638 | mangle_decl (anon_union_decl); | |
1639 | DECL_NAME (anon_union_decl) = NULL_TREE; | |
1640 | } | |
1641 | ||
1642 | pushdecl (anon_union_decl); | |
1643 | cp_finish_decl (anon_union_decl, NULL_TREE, false, NULL_TREE, 0); | |
1644 | } | |
1645 | \f | |
1646 | /* Auxiliary functions to make type signatures for | |
1647 | `operator new' and `operator delete' correspond to | |
1648 | what compiler will be expecting. */ | |
1649 | ||
1650 | tree | |
1651 | coerce_new_type (tree type) | |
1652 | { | |
1653 | int e = 0; | |
1654 | tree args = TYPE_ARG_TYPES (type); | |
1655 | ||
1656 | gcc_assert (TREE_CODE (type) == FUNCTION_TYPE); | |
1657 | ||
1658 | if (!same_type_p (TREE_TYPE (type), ptr_type_node)) | |
1659 | { | |
1660 | e = 1; | |
1661 | error ("%<operator new%> must return type %qT", ptr_type_node); | |
1662 | } | |
1663 | ||
1664 | if (args && args != void_list_node) | |
1665 | { | |
1666 | if (TREE_PURPOSE (args)) | |
1667 | { | |
1668 | /* [basic.stc.dynamic.allocation] | |
1669 | ||
1670 | The first parameter shall not have an associated default | |
1671 | argument. */ | |
1672 | error ("the first parameter of %<operator new%> cannot " | |
1673 | "have a default argument"); | |
1674 | /* Throw away the default argument. */ | |
1675 | TREE_PURPOSE (args) = NULL_TREE; | |
1676 | } | |
1677 | ||
1678 | if (!same_type_p (TREE_VALUE (args), size_type_node)) | |
1679 | { | |
1680 | e = 2; | |
1681 | args = TREE_CHAIN (args); | |
1682 | } | |
1683 | } | |
1684 | else | |
1685 | e = 2; | |
1686 | ||
1687 | if (e == 2) | |
1688 | permerror (input_location, "%<operator new%> takes type %<size_t%> (%qT) " | |
1689 | "as first parameter", size_type_node); | |
1690 | ||
1691 | switch (e) | |
1692 | { | |
1693 | case 2: | |
1694 | args = tree_cons (NULL_TREE, size_type_node, args); | |
1695 | /* Fall through. */ | |
1696 | case 1: | |
1697 | type = build_exception_variant | |
1698 | (build_function_type (ptr_type_node, args), | |
1699 | TYPE_RAISES_EXCEPTIONS (type)); | |
1700 | /* Fall through. */ | |
1701 | default:; | |
1702 | } | |
1703 | return type; | |
1704 | } | |
1705 | ||
1706 | tree | |
1707 | coerce_delete_type (tree type) | |
1708 | { | |
1709 | int e = 0; | |
1710 | tree args = TYPE_ARG_TYPES (type); | |
1711 | ||
1712 | gcc_assert (TREE_CODE (type) == FUNCTION_TYPE); | |
1713 | ||
1714 | if (!same_type_p (TREE_TYPE (type), void_type_node)) | |
1715 | { | |
1716 | e = 1; | |
1717 | error ("%<operator delete%> must return type %qT", void_type_node); | |
1718 | } | |
1719 | ||
1720 | if (!args || args == void_list_node | |
1721 | || !same_type_p (TREE_VALUE (args), ptr_type_node)) | |
1722 | { | |
1723 | e = 2; | |
1724 | if (args && args != void_list_node) | |
1725 | args = TREE_CHAIN (args); | |
1726 | error ("%<operator delete%> takes type %qT as first parameter", | |
1727 | ptr_type_node); | |
1728 | } | |
1729 | switch (e) | |
1730 | { | |
1731 | case 2: | |
1732 | args = tree_cons (NULL_TREE, ptr_type_node, args); | |
1733 | /* Fall through. */ | |
1734 | case 1: | |
1735 | type = build_exception_variant | |
1736 | (build_function_type (void_type_node, args), | |
1737 | TYPE_RAISES_EXCEPTIONS (type)); | |
1738 | /* Fall through. */ | |
1739 | default:; | |
1740 | } | |
1741 | ||
1742 | return type; | |
1743 | } | |
1744 | \f | |
1745 | /* DECL is a VAR_DECL for a vtable: walk through the entries in the vtable | |
1746 | and mark them as needed. */ | |
1747 | ||
1748 | static void | |
1749 | mark_vtable_entries (tree decl) | |
1750 | { | |
1751 | tree fnaddr; | |
1752 | unsigned HOST_WIDE_INT idx; | |
1753 | ||
7d4d0543 JM |
1754 | /* It's OK for the vtable to refer to deprecated virtual functions. */ |
1755 | warning_sentinel w(warn_deprecated_decl); | |
1756 | ||
dda118e3 JM |
1757 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)), |
1758 | idx, fnaddr) | |
1759 | { | |
1760 | tree fn; | |
1761 | ||
1762 | STRIP_NOPS (fnaddr); | |
1763 | ||
1764 | if (TREE_CODE (fnaddr) != ADDR_EXPR | |
1765 | && TREE_CODE (fnaddr) != FDESC_EXPR) | |
1766 | /* This entry is an offset: a virtual base class offset, a | |
1767 | virtual call offset, an RTTI offset, etc. */ | |
1768 | continue; | |
1769 | ||
1770 | fn = TREE_OPERAND (fnaddr, 0); | |
1771 | TREE_ADDRESSABLE (fn) = 1; | |
1772 | /* When we don't have vcall offsets, we output thunks whenever | |
1773 | we output the vtables that contain them. With vcall offsets, | |
1774 | we know all the thunks we'll need when we emit a virtual | |
1775 | function, so we emit the thunks there instead. */ | |
1776 | if (DECL_THUNK_P (fn)) | |
1777 | use_thunk (fn, /*emit_p=*/0); | |
1778 | mark_used (fn); | |
1779 | } | |
1780 | } | |
1781 | ||
1782 | /* Set DECL up to have the closest approximation of "initialized common" | |
1783 | linkage available. */ | |
1784 | ||
1785 | void | |
1786 | comdat_linkage (tree decl) | |
1787 | { | |
1788 | if (flag_weak) | |
1789 | make_decl_one_only (decl, cxx_comdat_group (decl)); | |
1790 | else if (TREE_CODE (decl) == FUNCTION_DECL | |
1791 | || (VAR_P (decl) && DECL_ARTIFICIAL (decl))) | |
1792 | /* We can just emit function and compiler-generated variables | |
1793 | statically; having multiple copies is (for the most part) only | |
1794 | a waste of space. | |
1795 | ||
1796 | There are two correctness issues, however: the address of a | |
1797 | template instantiation with external linkage should be the | |
1798 | same, independent of what translation unit asks for the | |
1799 | address, and this will not hold when we emit multiple copies of | |
1800 | the function. However, there's little else we can do. | |
1801 | ||
1802 | Also, by default, the typeinfo implementation assumes that | |
1803 | there will be only one copy of the string used as the name for | |
1804 | each type. Therefore, if weak symbols are unavailable, the | |
1805 | run-time library should perform a more conservative check; it | |
1806 | should perform a string comparison, rather than an address | |
1807 | comparison. */ | |
1808 | TREE_PUBLIC (decl) = 0; | |
1809 | else | |
1810 | { | |
1811 | /* Static data member template instantiations, however, cannot | |
1812 | have multiple copies. */ | |
1813 | if (DECL_INITIAL (decl) == 0 | |
1814 | || DECL_INITIAL (decl) == error_mark_node) | |
1815 | DECL_COMMON (decl) = 1; | |
1816 | else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl))) | |
1817 | { | |
1818 | DECL_COMMON (decl) = 1; | |
1819 | DECL_INITIAL (decl) = error_mark_node; | |
1820 | } | |
1821 | else if (!DECL_EXPLICIT_INSTANTIATION (decl)) | |
1822 | { | |
1823 | /* We can't do anything useful; leave vars for explicit | |
1824 | instantiation. */ | |
1825 | DECL_EXTERNAL (decl) = 1; | |
1826 | DECL_NOT_REALLY_EXTERN (decl) = 0; | |
1827 | } | |
1828 | } | |
1829 | ||
1830 | DECL_COMDAT (decl) = 1; | |
1831 | } | |
1832 | ||
1833 | /* For win32 we also want to put explicit instantiations in | |
1834 | linkonce sections, so that they will be merged with implicit | |
1835 | instantiations; otherwise we get duplicate symbol errors. | |
1836 | For Darwin we do not want explicit instantiations to be | |
1837 | linkonce. */ | |
1838 | ||
1839 | void | |
1840 | maybe_make_one_only (tree decl) | |
1841 | { | |
1842 | /* We used to say that this was not necessary on targets that support weak | |
1843 | symbols, because the implicit instantiations will defer to the explicit | |
1844 | one. However, that's not actually the case in SVR4; a strong definition | |
1845 | after a weak one is an error. Also, not making explicit | |
1846 | instantiations one_only means that we can end up with two copies of | |
1847 | some template instantiations. */ | |
1848 | if (! flag_weak) | |
1849 | return; | |
1850 | ||
1851 | /* We can't set DECL_COMDAT on functions, or cp_finish_file will think | |
1852 | we can get away with not emitting them if they aren't used. We need | |
1853 | to for variables so that cp_finish_decl will update their linkage, | |
1854 | because their DECL_INITIAL may not have been set properly yet. */ | |
1855 | ||
1856 | if (!TARGET_WEAK_NOT_IN_ARCHIVE_TOC | |
1857 | || (! DECL_EXPLICIT_INSTANTIATION (decl) | |
1858 | && ! DECL_TEMPLATE_SPECIALIZATION (decl))) | |
1859 | { | |
1860 | make_decl_one_only (decl, cxx_comdat_group (decl)); | |
1861 | ||
1862 | if (VAR_P (decl)) | |
1863 | { | |
1864 | varpool_node *node = varpool_node::get_create (decl); | |
1865 | DECL_COMDAT (decl) = 1; | |
1866 | /* Mark it needed so we don't forget to emit it. */ | |
1867 | node->forced_by_abi = true; | |
1868 | TREE_USED (decl) = 1; | |
1869 | } | |
1870 | } | |
1871 | } | |
1872 | ||
1873 | /* Returns true iff DECL, a FUNCTION_DECL or VAR_DECL, has vague linkage. | |
1874 | This predicate will give the right answer during parsing of the | |
1875 | function, which other tests may not. */ | |
1876 | ||
1877 | bool | |
1878 | vague_linkage_p (tree decl) | |
1879 | { | |
1880 | /* Unfortunately, import_export_decl has not always been called | |
1881 | before the function is processed, so we cannot simply check | |
1882 | DECL_COMDAT. */ | |
1883 | if (DECL_COMDAT (decl) | |
1884 | || (((TREE_CODE (decl) == FUNCTION_DECL | |
1885 | && DECL_DECLARED_INLINE_P (decl)) | |
1886 | || (DECL_LANG_SPECIFIC (decl) | |
1887 | && DECL_TEMPLATE_INSTANTIATION (decl))) | |
1888 | && TREE_PUBLIC (decl))) | |
1889 | return true; | |
1890 | else if (DECL_FUNCTION_SCOPE_P (decl)) | |
1891 | /* A local static in an inline effectively has vague linkage. */ | |
1892 | return (TREE_STATIC (decl) | |
1893 | && vague_linkage_p (DECL_CONTEXT (decl))); | |
1894 | else | |
1895 | return false; | |
1896 | } | |
1897 | ||
1898 | /* Determine whether or not we want to specifically import or export CTYPE, | |
1899 | using various heuristics. */ | |
1900 | ||
1901 | static void | |
1902 | import_export_class (tree ctype) | |
1903 | { | |
1904 | /* -1 for imported, 1 for exported. */ | |
1905 | int import_export = 0; | |
1906 | ||
1907 | /* It only makes sense to call this function at EOF. The reason is | |
1908 | that this function looks at whether or not the first non-inline | |
1909 | non-abstract virtual member function has been defined in this | |
1910 | translation unit. But, we can't possibly know that until we've | |
1911 | seen the entire translation unit. */ | |
1912 | gcc_assert (at_eof); | |
1913 | ||
1914 | if (CLASSTYPE_INTERFACE_KNOWN (ctype)) | |
1915 | return; | |
1916 | ||
1917 | /* If MULTIPLE_SYMBOL_SPACES is set and we saw a #pragma interface, | |
1918 | we will have CLASSTYPE_INTERFACE_ONLY set but not | |
1919 | CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this | |
1920 | heuristic because someone will supply a #pragma implementation | |
1921 | elsewhere, and deducing it here would produce a conflict. */ | |
1922 | if (CLASSTYPE_INTERFACE_ONLY (ctype)) | |
1923 | return; | |
1924 | ||
1925 | if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype))) | |
1926 | import_export = -1; | |
1927 | else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype))) | |
1928 | import_export = 1; | |
1929 | else if (CLASSTYPE_IMPLICIT_INSTANTIATION (ctype) | |
1930 | && !flag_implicit_templates) | |
1931 | /* For a template class, without -fimplicit-templates, check the | |
1932 | repository. If the virtual table is assigned to this | |
1933 | translation unit, then export the class; otherwise, import | |
1934 | it. */ | |
1935 | import_export = repo_export_class_p (ctype) ? 1 : -1; | |
1936 | else if (TYPE_POLYMORPHIC_P (ctype)) | |
1937 | { | |
1938 | /* The ABI specifies that the virtual table and associated | |
1939 | information are emitted with the key method, if any. */ | |
1940 | tree method = CLASSTYPE_KEY_METHOD (ctype); | |
1941 | /* If weak symbol support is not available, then we must be | |
1942 | careful not to emit the vtable when the key function is | |
1943 | inline. An inline function can be defined in multiple | |
1944 | translation units. If we were to emit the vtable in each | |
1945 | translation unit containing a definition, we would get | |
1946 | multiple definition errors at link-time. */ | |
1947 | if (method && (flag_weak || ! DECL_DECLARED_INLINE_P (method))) | |
1948 | import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1); | |
1949 | } | |
1950 | ||
1951 | /* When MULTIPLE_SYMBOL_SPACES is set, we cannot count on seeing | |
1952 | a definition anywhere else. */ | |
1953 | if (MULTIPLE_SYMBOL_SPACES && import_export == -1) | |
1954 | import_export = 0; | |
1955 | ||
1956 | /* Allow back ends the chance to overrule the decision. */ | |
1957 | if (targetm.cxx.import_export_class) | |
1958 | import_export = targetm.cxx.import_export_class (ctype, import_export); | |
1959 | ||
1960 | if (import_export) | |
1961 | { | |
1962 | SET_CLASSTYPE_INTERFACE_KNOWN (ctype); | |
1963 | CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0); | |
1964 | } | |
1965 | } | |
1966 | ||
1967 | /* Return true if VAR has already been provided to the back end; in that | |
1968 | case VAR should not be modified further by the front end. */ | |
1969 | static bool | |
1970 | var_finalized_p (tree var) | |
1971 | { | |
1972 | return varpool_node::get_create (var)->definition; | |
1973 | } | |
1974 | ||
1975 | /* DECL is a VAR_DECL or FUNCTION_DECL which, for whatever reason, | |
1976 | must be emitted in this translation unit. Mark it as such. */ | |
1977 | ||
1978 | void | |
1979 | mark_needed (tree decl) | |
1980 | { | |
1981 | TREE_USED (decl) = 1; | |
1982 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
1983 | { | |
1984 | /* Extern inline functions don't become needed when referenced. | |
1985 | If we know a method will be emitted in other TU and no new | |
1986 | functions can be marked reachable, just use the external | |
1987 | definition. */ | |
1988 | struct cgraph_node *node = cgraph_node::get_create (decl); | |
1989 | node->forced_by_abi = true; | |
1990 | ||
1991 | /* #pragma interface and -frepo code can call mark_needed for | |
1992 | maybe-in-charge 'tors; mark the clones as well. */ | |
1993 | tree clone; | |
1994 | FOR_EACH_CLONE (clone, decl) | |
1995 | mark_needed (clone); | |
1996 | } | |
1997 | else if (TREE_CODE (decl) == VAR_DECL) | |
1998 | { | |
1999 | varpool_node *node = varpool_node::get_create (decl); | |
2000 | /* C++ frontend use mark_decl_references to force COMDAT variables | |
2001 | to be output that might appear dead otherwise. */ | |
2002 | node->forced_by_abi = true; | |
2003 | } | |
2004 | } | |
2005 | ||
2006 | /* DECL is either a FUNCTION_DECL or a VAR_DECL. This function | |
2007 | returns true if a definition of this entity should be provided in | |
2008 | this object file. Callers use this function to determine whether | |
2009 | or not to let the back end know that a definition of DECL is | |
2010 | available in this translation unit. */ | |
2011 | ||
2012 | bool | |
2013 | decl_needed_p (tree decl) | |
2014 | { | |
2015 | gcc_assert (VAR_OR_FUNCTION_DECL_P (decl)); | |
2016 | /* This function should only be called at the end of the translation | |
2017 | unit. We cannot be sure of whether or not something will be | |
2018 | COMDAT until that point. */ | |
2019 | gcc_assert (at_eof); | |
2020 | ||
2021 | /* All entities with external linkage that are not COMDAT/EXTERN should be | |
2022 | emitted; they may be referred to from other object files. */ | |
2023 | if (TREE_PUBLIC (decl) && !DECL_COMDAT (decl) && !DECL_REALLY_EXTERN (decl)) | |
2024 | return true; | |
2025 | /* Functions marked "dllexport" must be emitted so that they are | |
2026 | visible to other DLLs. */ | |
2027 | if (flag_keep_inline_dllexport | |
2028 | && lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl))) | |
2029 | return true; | |
2030 | ||
2031 | /* When not optimizing, do not bother to produce definitions for extern | |
2032 | symbols. */ | |
2033 | if (DECL_REALLY_EXTERN (decl) | |
2034 | && ((TREE_CODE (decl) != FUNCTION_DECL | |
2035 | && !optimize) | |
2036 | || (TREE_CODE (decl) == FUNCTION_DECL | |
2037 | && !opt_for_fn (decl, optimize))) | |
2038 | && !lookup_attribute ("always_inline", decl)) | |
2039 | return false; | |
2040 | ||
2041 | /* If this entity was used, let the back end see it; it will decide | |
2042 | whether or not to emit it into the object file. */ | |
2043 | if (TREE_USED (decl)) | |
2044 | return true; | |
2045 | /* Virtual functions might be needed for devirtualization. */ | |
2046 | if (flag_devirtualize | |
2047 | && TREE_CODE (decl) == FUNCTION_DECL | |
2048 | && DECL_VIRTUAL_P (decl)) | |
2049 | return true; | |
2050 | /* Otherwise, DECL does not need to be emitted -- yet. A subsequent | |
2051 | reference to DECL might cause it to be emitted later. */ | |
2052 | return false; | |
2053 | } | |
2054 | ||
2055 | /* If necessary, write out the vtables for the dynamic class CTYPE. | |
2056 | Returns true if any vtables were emitted. */ | |
2057 | ||
2058 | static bool | |
2059 | maybe_emit_vtables (tree ctype) | |
2060 | { | |
2061 | tree vtbl; | |
2062 | tree primary_vtbl; | |
2063 | int needed = 0; | |
2064 | varpool_node *current = NULL, *last = NULL; | |
2065 | ||
2066 | /* If the vtables for this class have already been emitted there is | |
2067 | nothing more to do. */ | |
2068 | primary_vtbl = CLASSTYPE_VTABLES (ctype); | |
2069 | if (var_finalized_p (primary_vtbl)) | |
2070 | return false; | |
2071 | /* Ignore dummy vtables made by get_vtable_decl. */ | |
2072 | if (TREE_TYPE (primary_vtbl) == void_type_node) | |
2073 | return false; | |
2074 | ||
2075 | /* On some targets, we cannot determine the key method until the end | |
2076 | of the translation unit -- which is when this function is | |
2077 | called. */ | |
2078 | if (!targetm.cxx.key_method_may_be_inline ()) | |
2079 | determine_key_method (ctype); | |
2080 | ||
2081 | /* See if any of the vtables are needed. */ | |
2082 | for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = DECL_CHAIN (vtbl)) | |
2083 | { | |
2084 | import_export_decl (vtbl); | |
2085 | if (DECL_NOT_REALLY_EXTERN (vtbl) && decl_needed_p (vtbl)) | |
2086 | needed = 1; | |
2087 | } | |
2088 | if (!needed) | |
2089 | { | |
2090 | /* If the references to this class' vtables are optimized away, | |
2091 | still emit the appropriate debugging information. See | |
2092 | dfs_debug_mark. */ | |
2093 | if (DECL_COMDAT (primary_vtbl) | |
2094 | && CLASSTYPE_DEBUG_REQUESTED (ctype)) | |
2095 | note_debug_info_needed (ctype); | |
2096 | return false; | |
2097 | } | |
2098 | ||
2099 | /* The ABI requires that we emit all of the vtables if we emit any | |
2100 | of them. */ | |
2101 | for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = DECL_CHAIN (vtbl)) | |
2102 | { | |
2103 | /* Mark entities references from the virtual table as used. */ | |
2104 | mark_vtable_entries (vtbl); | |
2105 | ||
2106 | if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0) | |
2107 | { | |
2108 | vec<tree, va_gc> *cleanups = NULL; | |
2109 | tree expr = store_init_value (vtbl, DECL_INITIAL (vtbl), &cleanups, | |
2110 | LOOKUP_NORMAL); | |
2111 | ||
2112 | /* It had better be all done at compile-time. */ | |
2113 | gcc_assert (!expr && !cleanups); | |
2114 | } | |
2115 | ||
2116 | /* Write it out. */ | |
2117 | DECL_EXTERNAL (vtbl) = 0; | |
2118 | rest_of_decl_compilation (vtbl, 1, 1); | |
2119 | ||
2120 | /* Because we're only doing syntax-checking, we'll never end up | |
2121 | actually marking the variable as written. */ | |
2122 | if (flag_syntax_only) | |
2123 | TREE_ASM_WRITTEN (vtbl) = 1; | |
2124 | else if (DECL_ONE_ONLY (vtbl)) | |
2125 | { | |
2126 | current = varpool_node::get_create (vtbl); | |
2127 | if (last) | |
2128 | current->add_to_same_comdat_group (last); | |
2129 | last = current; | |
2130 | } | |
2131 | } | |
2132 | ||
2133 | /* Since we're writing out the vtable here, also write the debug | |
2134 | info. */ | |
2135 | note_debug_info_needed (ctype); | |
2136 | ||
2137 | return true; | |
2138 | } | |
2139 | ||
2140 | /* A special return value from type_visibility meaning internal | |
2141 | linkage. */ | |
2142 | ||
2143 | enum { VISIBILITY_ANON = VISIBILITY_INTERNAL+1 }; | |
2144 | ||
2145 | /* walk_tree helper function for type_visibility. */ | |
2146 | ||
2147 | static tree | |
2148 | min_vis_r (tree *tp, int *walk_subtrees, void *data) | |
2149 | { | |
2150 | int *vis_p = (int *)data; | |
2151 | if (! TYPE_P (*tp)) | |
2152 | { | |
2153 | *walk_subtrees = 0; | |
2154 | } | |
2155 | else if (OVERLOAD_TYPE_P (*tp) | |
2156 | && !TREE_PUBLIC (TYPE_MAIN_DECL (*tp))) | |
2157 | { | |
2158 | *vis_p = VISIBILITY_ANON; | |
2159 | return *tp; | |
2160 | } | |
2161 | else if (CLASS_TYPE_P (*tp) | |
2162 | && CLASSTYPE_VISIBILITY (*tp) > *vis_p) | |
2163 | *vis_p = CLASSTYPE_VISIBILITY (*tp); | |
2164 | return NULL; | |
2165 | } | |
2166 | ||
2167 | /* Returns the visibility of TYPE, which is the minimum visibility of its | |
2168 | component types. */ | |
2169 | ||
2170 | static int | |
2171 | type_visibility (tree type) | |
2172 | { | |
2173 | int vis = VISIBILITY_DEFAULT; | |
2174 | cp_walk_tree_without_duplicates (&type, min_vis_r, &vis); | |
2175 | return vis; | |
2176 | } | |
2177 | ||
2178 | /* Limit the visibility of DECL to VISIBILITY, if not explicitly | |
2179 | specified (or if VISIBILITY is static). If TMPL is true, this | |
2180 | constraint is for a template argument, and takes precedence | |
2181 | over explicitly-specified visibility on the template. */ | |
2182 | ||
2183 | static void | |
2184 | constrain_visibility (tree decl, int visibility, bool tmpl) | |
2185 | { | |
2186 | if (visibility == VISIBILITY_ANON) | |
2187 | { | |
2188 | /* extern "C" declarations aren't affected by the anonymous | |
2189 | namespace. */ | |
2190 | if (!DECL_EXTERN_C_P (decl)) | |
2191 | { | |
2192 | TREE_PUBLIC (decl) = 0; | |
2193 | DECL_WEAK (decl) = 0; | |
2194 | DECL_COMMON (decl) = 0; | |
224ceb26 | 2195 | DECL_COMDAT (decl) = false; |
dda118e3 JM |
2196 | if (TREE_CODE (decl) == FUNCTION_DECL |
2197 | || TREE_CODE (decl) == VAR_DECL) | |
2198 | { | |
2199 | struct symtab_node *snode = symtab_node::get (decl); | |
2200 | ||
2201 | if (snode) | |
2202 | snode->set_comdat_group (NULL); | |
2203 | } | |
2204 | DECL_INTERFACE_KNOWN (decl) = 1; | |
2205 | if (DECL_LANG_SPECIFIC (decl)) | |
2206 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
2207 | } | |
2208 | } | |
2209 | else if (visibility > DECL_VISIBILITY (decl) | |
2210 | && (tmpl || !DECL_VISIBILITY_SPECIFIED (decl))) | |
2211 | { | |
2212 | DECL_VISIBILITY (decl) = (enum symbol_visibility) visibility; | |
2213 | /* This visibility was not specified. */ | |
2214 | DECL_VISIBILITY_SPECIFIED (decl) = false; | |
2215 | } | |
2216 | } | |
2217 | ||
2218 | /* Constrain the visibility of DECL based on the visibility of its template | |
2219 | arguments. */ | |
2220 | ||
2221 | static void | |
2222 | constrain_visibility_for_template (tree decl, tree targs) | |
2223 | { | |
2224 | /* If this is a template instantiation, check the innermost | |
2225 | template args for visibility constraints. The outer template | |
2226 | args are covered by the class check. */ | |
2227 | tree args = INNERMOST_TEMPLATE_ARGS (targs); | |
2228 | int i; | |
2229 | for (i = TREE_VEC_LENGTH (args); i > 0; --i) | |
2230 | { | |
2231 | int vis = 0; | |
2232 | ||
2233 | tree arg = TREE_VEC_ELT (args, i-1); | |
2234 | if (TYPE_P (arg)) | |
2235 | vis = type_visibility (arg); | |
224ceb26 | 2236 | else |
dda118e3 | 2237 | { |
224ceb26 JM |
2238 | if (REFERENCE_REF_P (arg)) |
2239 | arg = TREE_OPERAND (arg, 0); | |
2240 | if (TREE_TYPE (arg)) | |
2241 | STRIP_NOPS (arg); | |
dda118e3 JM |
2242 | if (TREE_CODE (arg) == ADDR_EXPR) |
2243 | arg = TREE_OPERAND (arg, 0); | |
2244 | if (VAR_OR_FUNCTION_DECL_P (arg)) | |
2245 | { | |
2246 | if (! TREE_PUBLIC (arg)) | |
2247 | vis = VISIBILITY_ANON; | |
2248 | else | |
2249 | vis = DECL_VISIBILITY (arg); | |
2250 | } | |
2251 | } | |
2252 | if (vis) | |
2253 | constrain_visibility (decl, vis, true); | |
2254 | } | |
2255 | } | |
2256 | ||
2257 | /* Like c_determine_visibility, but with additional C++-specific | |
2258 | behavior. | |
2259 | ||
2260 | Function-scope entities can rely on the function's visibility because | |
2261 | it is set in start_preparsed_function. | |
2262 | ||
2263 | Class-scope entities cannot rely on the class's visibility until the end | |
2264 | of the enclosing class definition. | |
2265 | ||
2266 | Note that because namespaces have multiple independent definitions, | |
2267 | namespace visibility is handled elsewhere using the #pragma visibility | |
2268 | machinery rather than by decorating the namespace declaration. | |
2269 | ||
2270 | The goal is for constraints from the type to give a diagnostic, and | |
2271 | other constraints to be applied silently. */ | |
2272 | ||
2273 | void | |
2274 | determine_visibility (tree decl) | |
2275 | { | |
2276 | tree class_type = NULL_TREE; | |
2277 | bool use_template; | |
2278 | bool orig_visibility_specified; | |
2279 | enum symbol_visibility orig_visibility; | |
2280 | ||
2281 | /* Remember that all decls get VISIBILITY_DEFAULT when built. */ | |
2282 | ||
2283 | /* Only relevant for names with external linkage. */ | |
2284 | if (!TREE_PUBLIC (decl)) | |
2285 | return; | |
2286 | ||
2287 | /* Cloned constructors and destructors get the same visibility as | |
2288 | the underlying function. That should be set up in | |
2289 | maybe_clone_body. */ | |
2290 | gcc_assert (!DECL_CLONED_FUNCTION_P (decl)); | |
2291 | ||
2292 | orig_visibility_specified = DECL_VISIBILITY_SPECIFIED (decl); | |
2293 | orig_visibility = DECL_VISIBILITY (decl); | |
2294 | ||
2295 | if (TREE_CODE (decl) == TYPE_DECL) | |
2296 | { | |
2297 | if (CLASS_TYPE_P (TREE_TYPE (decl))) | |
2298 | use_template = CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)); | |
2299 | else if (TYPE_TEMPLATE_INFO (TREE_TYPE (decl))) | |
2300 | use_template = 1; | |
2301 | else | |
2302 | use_template = 0; | |
2303 | } | |
2304 | else if (DECL_LANG_SPECIFIC (decl)) | |
2305 | use_template = DECL_USE_TEMPLATE (decl); | |
2306 | else | |
2307 | use_template = 0; | |
2308 | ||
2309 | /* If DECL is a member of a class, visibility specifiers on the | |
2310 | class can influence the visibility of the DECL. */ | |
2311 | if (DECL_CLASS_SCOPE_P (decl)) | |
2312 | class_type = DECL_CONTEXT (decl); | |
2313 | else | |
2314 | { | |
2315 | /* Not a class member. */ | |
2316 | ||
2317 | /* Virtual tables have DECL_CONTEXT set to their associated class, | |
2318 | so they are automatically handled above. */ | |
2319 | gcc_assert (!VAR_P (decl) | |
2320 | || !DECL_VTABLE_OR_VTT_P (decl)); | |
2321 | ||
2322 | if (DECL_FUNCTION_SCOPE_P (decl) && ! DECL_VISIBILITY_SPECIFIED (decl)) | |
2323 | { | |
2324 | /* Local statics and classes get the visibility of their | |
2325 | containing function by default, except that | |
2326 | -fvisibility-inlines-hidden doesn't affect them. */ | |
2327 | tree fn = DECL_CONTEXT (decl); | |
2328 | if (DECL_VISIBILITY_SPECIFIED (fn)) | |
2329 | { | |
2330 | DECL_VISIBILITY (decl) = DECL_VISIBILITY (fn); | |
2331 | DECL_VISIBILITY_SPECIFIED (decl) = | |
2332 | DECL_VISIBILITY_SPECIFIED (fn); | |
2333 | } | |
2334 | else | |
2335 | { | |
2336 | if (DECL_CLASS_SCOPE_P (fn)) | |
2337 | determine_visibility_from_class (decl, DECL_CONTEXT (fn)); | |
2338 | else if (determine_hidden_inline (fn)) | |
2339 | { | |
2340 | DECL_VISIBILITY (decl) = default_visibility; | |
2341 | DECL_VISIBILITY_SPECIFIED (decl) = | |
2342 | visibility_options.inpragma; | |
2343 | } | |
2344 | else | |
2345 | { | |
2346 | DECL_VISIBILITY (decl) = DECL_VISIBILITY (fn); | |
2347 | DECL_VISIBILITY_SPECIFIED (decl) = | |
2348 | DECL_VISIBILITY_SPECIFIED (fn); | |
2349 | } | |
2350 | } | |
2351 | ||
2352 | /* Local classes in templates have CLASSTYPE_USE_TEMPLATE set, | |
2353 | but have no TEMPLATE_INFO, so don't try to check it. */ | |
2354 | use_template = 0; | |
2355 | } | |
2356 | else if (VAR_P (decl) && DECL_TINFO_P (decl) | |
2357 | && flag_visibility_ms_compat) | |
2358 | { | |
2359 | /* Under -fvisibility-ms-compat, types are visible by default, | |
2360 | even though their contents aren't. */ | |
2361 | tree underlying_type = TREE_TYPE (DECL_NAME (decl)); | |
2362 | int underlying_vis = type_visibility (underlying_type); | |
2363 | if (underlying_vis == VISIBILITY_ANON | |
2364 | || (CLASS_TYPE_P (underlying_type) | |
2365 | && CLASSTYPE_VISIBILITY_SPECIFIED (underlying_type))) | |
2366 | constrain_visibility (decl, underlying_vis, false); | |
2367 | else | |
2368 | DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT; | |
2369 | } | |
2370 | else if (VAR_P (decl) && DECL_TINFO_P (decl)) | |
2371 | { | |
2372 | /* tinfo visibility is based on the type it's for. */ | |
2373 | constrain_visibility | |
2374 | (decl, type_visibility (TREE_TYPE (DECL_NAME (decl))), false); | |
2375 | ||
2376 | /* Give the target a chance to override the visibility associated | |
2377 | with DECL. */ | |
2378 | if (TREE_PUBLIC (decl) | |
2379 | && !DECL_REALLY_EXTERN (decl) | |
2380 | && CLASS_TYPE_P (TREE_TYPE (DECL_NAME (decl))) | |
2381 | && !CLASSTYPE_VISIBILITY_SPECIFIED (TREE_TYPE (DECL_NAME (decl)))) | |
2382 | targetm.cxx.determine_class_data_visibility (decl); | |
2383 | } | |
2384 | else if (use_template) | |
2385 | /* Template instantiations and specializations get visibility based | |
2386 | on their template unless they override it with an attribute. */; | |
2387 | else if (! DECL_VISIBILITY_SPECIFIED (decl)) | |
2388 | { | |
2389 | if (determine_hidden_inline (decl)) | |
2390 | DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN; | |
2391 | else | |
2392 | { | |
2393 | /* Set default visibility to whatever the user supplied with | |
2394 | #pragma GCC visibility or a namespace visibility attribute. */ | |
2395 | DECL_VISIBILITY (decl) = default_visibility; | |
2396 | DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma; | |
2397 | } | |
2398 | } | |
2399 | } | |
2400 | ||
2401 | if (use_template) | |
2402 | { | |
2403 | /* If the specialization doesn't specify visibility, use the | |
2404 | visibility from the template. */ | |
2405 | tree tinfo = (TREE_CODE (decl) == TYPE_DECL | |
2406 | ? TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2407 | : DECL_TEMPLATE_INFO (decl)); | |
2408 | tree args = TI_ARGS (tinfo); | |
2409 | tree attribs = (TREE_CODE (decl) == TYPE_DECL | |
2410 | ? TYPE_ATTRIBUTES (TREE_TYPE (decl)) | |
2411 | : DECL_ATTRIBUTES (decl)); | |
2412 | ||
2413 | if (args != error_mark_node) | |
2414 | { | |
2415 | tree pattern = DECL_TEMPLATE_RESULT (TI_TEMPLATE (tinfo)); | |
2416 | ||
2417 | if (!DECL_VISIBILITY_SPECIFIED (decl)) | |
2418 | { | |
2419 | if (!DECL_VISIBILITY_SPECIFIED (pattern) | |
2420 | && determine_hidden_inline (decl)) | |
2421 | DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN; | |
2422 | else | |
2423 | { | |
2424 | DECL_VISIBILITY (decl) = DECL_VISIBILITY (pattern); | |
2425 | DECL_VISIBILITY_SPECIFIED (decl) | |
2426 | = DECL_VISIBILITY_SPECIFIED (pattern); | |
2427 | } | |
2428 | } | |
2429 | ||
2430 | if (args | |
2431 | /* Template argument visibility outweighs #pragma or namespace | |
2432 | visibility, but not an explicit attribute. */ | |
2433 | && !lookup_attribute ("visibility", attribs)) | |
2434 | { | |
2435 | int depth = TMPL_ARGS_DEPTH (args); | |
2436 | if (DECL_VISIBILITY_SPECIFIED (decl)) | |
2437 | { | |
2438 | /* A class template member with explicit visibility | |
2439 | overrides the class visibility, so we need to apply | |
2440 | all the levels of template args directly. */ | |
2441 | int i; | |
2442 | for (i = 1; i <= depth; ++i) | |
2443 | { | |
2444 | tree lev = TMPL_ARGS_LEVEL (args, i); | |
2445 | constrain_visibility_for_template (decl, lev); | |
2446 | } | |
2447 | } | |
2448 | else if (PRIMARY_TEMPLATE_P (TI_TEMPLATE (tinfo))) | |
2449 | /* Limit visibility based on its template arguments. */ | |
2450 | constrain_visibility_for_template (decl, args); | |
2451 | } | |
2452 | } | |
2453 | } | |
2454 | ||
2455 | if (class_type) | |
2456 | determine_visibility_from_class (decl, class_type); | |
2457 | ||
2458 | if (decl_anon_ns_mem_p (decl)) | |
2459 | /* Names in an anonymous namespace get internal linkage. | |
2460 | This might change once we implement export. */ | |
2461 | constrain_visibility (decl, VISIBILITY_ANON, false); | |
2462 | else if (TREE_CODE (decl) != TYPE_DECL) | |
2463 | { | |
2464 | /* Propagate anonymity from type to decl. */ | |
2465 | int tvis = type_visibility (TREE_TYPE (decl)); | |
2466 | if (tvis == VISIBILITY_ANON | |
2467 | || ! DECL_VISIBILITY_SPECIFIED (decl)) | |
2468 | constrain_visibility (decl, tvis, false); | |
2469 | } | |
2470 | else if (no_linkage_check (TREE_TYPE (decl), /*relaxed_p=*/true)) | |
2471 | /* DR 757: A type without linkage shall not be used as the type of a | |
2472 | variable or function with linkage, unless | |
2473 | o the variable or function has extern "C" linkage (7.5 [dcl.link]), or | |
2474 | o the variable or function is not used (3.2 [basic.def.odr]) or is | |
2475 | defined in the same translation unit. | |
2476 | ||
2477 | Since non-extern "C" decls need to be defined in the same | |
2478 | translation unit, we can make the type internal. */ | |
2479 | constrain_visibility (decl, VISIBILITY_ANON, false); | |
2480 | ||
2481 | /* If visibility changed and DECL already has DECL_RTL, ensure | |
2482 | symbol flags are updated. */ | |
2483 | if ((DECL_VISIBILITY (decl) != orig_visibility | |
2484 | || DECL_VISIBILITY_SPECIFIED (decl) != orig_visibility_specified) | |
2485 | && ((VAR_P (decl) && TREE_STATIC (decl)) | |
2486 | || TREE_CODE (decl) == FUNCTION_DECL) | |
2487 | && DECL_RTL_SET_P (decl)) | |
2488 | make_decl_rtl (decl); | |
2489 | } | |
2490 | ||
2491 | /* By default, static data members and function members receive | |
2492 | the visibility of their containing class. */ | |
2493 | ||
2494 | static void | |
2495 | determine_visibility_from_class (tree decl, tree class_type) | |
2496 | { | |
2497 | if (DECL_VISIBILITY_SPECIFIED (decl)) | |
2498 | return; | |
2499 | ||
2500 | if (determine_hidden_inline (decl)) | |
2501 | DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN; | |
2502 | else | |
2503 | { | |
2504 | /* Default to the class visibility. */ | |
2505 | DECL_VISIBILITY (decl) = CLASSTYPE_VISIBILITY (class_type); | |
2506 | DECL_VISIBILITY_SPECIFIED (decl) | |
2507 | = CLASSTYPE_VISIBILITY_SPECIFIED (class_type); | |
2508 | } | |
2509 | ||
2510 | /* Give the target a chance to override the visibility associated | |
2511 | with DECL. */ | |
2512 | if (VAR_P (decl) | |
2513 | && (DECL_TINFO_P (decl) | |
2514 | || (DECL_VTABLE_OR_VTT_P (decl) | |
2515 | /* Construction virtual tables are not exported because | |
2516 | they cannot be referred to from other object files; | |
2517 | their name is not standardized by the ABI. */ | |
2518 | && !DECL_CONSTRUCTION_VTABLE_P (decl))) | |
2519 | && TREE_PUBLIC (decl) | |
2520 | && !DECL_REALLY_EXTERN (decl) | |
2521 | && !CLASSTYPE_VISIBILITY_SPECIFIED (class_type)) | |
2522 | targetm.cxx.determine_class_data_visibility (decl); | |
2523 | } | |
2524 | ||
2525 | /* Returns true iff DECL is an inline that should get hidden visibility | |
2526 | because of -fvisibility-inlines-hidden. */ | |
2527 | ||
2528 | static bool | |
2529 | determine_hidden_inline (tree decl) | |
2530 | { | |
2531 | return (visibility_options.inlines_hidden | |
2532 | /* Don't do this for inline templates; specializations might not be | |
2533 | inline, and we don't want them to inherit the hidden | |
2534 | visibility. We'll set it here for all inline instantiations. */ | |
2535 | && !processing_template_decl | |
2536 | && TREE_CODE (decl) == FUNCTION_DECL | |
2537 | && DECL_DECLARED_INLINE_P (decl) | |
2538 | && (! DECL_LANG_SPECIFIC (decl) | |
2539 | || ! DECL_EXPLICIT_INSTANTIATION (decl))); | |
2540 | } | |
2541 | ||
2542 | /* Constrain the visibility of a class TYPE based on the visibility of its | |
2543 | field types. Warn if any fields require lesser visibility. */ | |
2544 | ||
2545 | void | |
2546 | constrain_class_visibility (tree type) | |
2547 | { | |
2548 | tree binfo; | |
2549 | tree t; | |
2550 | int i; | |
2551 | ||
2552 | int vis = type_visibility (type); | |
2553 | ||
2554 | if (vis == VISIBILITY_ANON | |
2555 | || DECL_IN_SYSTEM_HEADER (TYPE_MAIN_DECL (type))) | |
2556 | return; | |
2557 | ||
2558 | /* Don't warn about visibility if the class has explicit visibility. */ | |
2559 | if (CLASSTYPE_VISIBILITY_SPECIFIED (type)) | |
2560 | vis = VISIBILITY_INTERNAL; | |
2561 | ||
2562 | for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t)) | |
2563 | if (TREE_CODE (t) == FIELD_DECL && TREE_TYPE (t) != error_mark_node) | |
2564 | { | |
2565 | tree ftype = strip_pointer_or_array_types (TREE_TYPE (t)); | |
2566 | int subvis = type_visibility (ftype); | |
2567 | ||
2568 | if (subvis == VISIBILITY_ANON) | |
2569 | { | |
2570 | if (!in_main_input_context ()) | |
2571 | warning (0, "\ | |
2572 | %qT has a field %qD whose type uses the anonymous namespace", | |
2573 | type, t); | |
2574 | } | |
2575 | else if (MAYBE_CLASS_TYPE_P (ftype) | |
2576 | && vis < VISIBILITY_HIDDEN | |
2577 | && subvis >= VISIBILITY_HIDDEN) | |
2578 | warning (OPT_Wattributes, "\ | |
2579 | %qT declared with greater visibility than the type of its field %qD", | |
2580 | type, t); | |
2581 | } | |
2582 | ||
2583 | binfo = TYPE_BINFO (type); | |
2584 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, t); ++i) | |
2585 | { | |
2586 | int subvis = type_visibility (TREE_TYPE (t)); | |
2587 | ||
2588 | if (subvis == VISIBILITY_ANON) | |
2589 | { | |
2590 | if (!in_main_input_context()) | |
2591 | warning (0, "\ | |
2592 | %qT has a base %qT whose type uses the anonymous namespace", | |
2593 | type, TREE_TYPE (t)); | |
2594 | } | |
2595 | else if (vis < VISIBILITY_HIDDEN | |
2596 | && subvis >= VISIBILITY_HIDDEN) | |
2597 | warning (OPT_Wattributes, "\ | |
2598 | %qT declared with greater visibility than its base %qT", | |
2599 | type, TREE_TYPE (t)); | |
2600 | } | |
2601 | } | |
2602 | ||
2603 | /* Functions for adjusting the visibility of a tagged type and its nested | |
2604 | types and declarations when it gets a name for linkage purposes from a | |
2605 | typedef. */ | |
2606 | ||
2607 | static void bt_reset_linkage_1 (binding_entry, void *); | |
2608 | static void bt_reset_linkage_2 (binding_entry, void *); | |
2609 | ||
2610 | /* First reset the visibility of all the types. */ | |
2611 | ||
2612 | static void | |
2613 | reset_type_linkage_1 (tree type) | |
2614 | { | |
2615 | set_linkage_according_to_type (type, TYPE_MAIN_DECL (type)); | |
2616 | if (CLASS_TYPE_P (type)) | |
2617 | binding_table_foreach (CLASSTYPE_NESTED_UTDS (type), | |
2618 | bt_reset_linkage_1, NULL); | |
2619 | } | |
2620 | static void | |
2621 | bt_reset_linkage_1 (binding_entry b, void */*data*/) | |
2622 | { | |
2623 | reset_type_linkage_1 (b->type); | |
2624 | } | |
2625 | ||
2626 | /* Then reset the visibility of any static data members or member | |
2627 | functions that use those types. */ | |
2628 | ||
2629 | static void | |
2630 | reset_decl_linkage (tree decl) | |
2631 | { | |
2632 | if (TREE_PUBLIC (decl)) | |
2633 | return; | |
2634 | if (DECL_CLONED_FUNCTION_P (decl)) | |
2635 | return; | |
2636 | TREE_PUBLIC (decl) = true; | |
2637 | DECL_INTERFACE_KNOWN (decl) = false; | |
2638 | determine_visibility (decl); | |
2639 | tentative_decl_linkage (decl); | |
2640 | } | |
2641 | static void | |
2642 | reset_type_linkage_2 (tree type) | |
2643 | { | |
2644 | if (CLASS_TYPE_P (type)) | |
2645 | { | |
2646 | if (tree vt = CLASSTYPE_VTABLES (type)) | |
2647 | { | |
2648 | tree name = mangle_vtbl_for_type (type); | |
2649 | DECL_NAME (vt) = name; | |
2650 | SET_DECL_ASSEMBLER_NAME (vt, name); | |
2651 | reset_decl_linkage (vt); | |
2652 | } | |
2653 | if (tree ti = CLASSTYPE_TYPEINFO_VAR (type)) | |
2654 | { | |
2655 | tree name = mangle_typeinfo_for_type (type); | |
2656 | DECL_NAME (ti) = name; | |
2657 | SET_DECL_ASSEMBLER_NAME (ti, name); | |
2658 | TREE_TYPE (name) = type; | |
2659 | reset_decl_linkage (ti); | |
2660 | } | |
2661 | for (tree m = TYPE_FIELDS (type); m; m = DECL_CHAIN (m)) | |
2662 | if (TREE_CODE (m) == VAR_DECL) | |
2663 | reset_decl_linkage (m); | |
2664 | for (tree m = TYPE_METHODS (type); m; m = DECL_CHAIN (m)) | |
2665 | reset_decl_linkage (m); | |
2666 | binding_table_foreach (CLASSTYPE_NESTED_UTDS (type), | |
2667 | bt_reset_linkage_2, NULL); | |
2668 | } | |
2669 | } | |
2670 | static void | |
2671 | bt_reset_linkage_2 (binding_entry b, void */*data*/) | |
2672 | { | |
2673 | reset_type_linkage_2 (b->type); | |
2674 | } | |
2675 | void | |
2676 | reset_type_linkage (tree type) | |
2677 | { | |
2678 | reset_type_linkage_1 (type); | |
2679 | reset_type_linkage_2 (type); | |
2680 | } | |
2681 | ||
2682 | /* Set up our initial idea of what the linkage of DECL should be. */ | |
2683 | ||
2684 | void | |
2685 | tentative_decl_linkage (tree decl) | |
2686 | { | |
2687 | if (DECL_INTERFACE_KNOWN (decl)) | |
2688 | /* We've already made a decision as to how this function will | |
2689 | be handled. */; | |
2690 | else if (vague_linkage_p (decl)) | |
2691 | { | |
2692 | if (TREE_CODE (decl) == FUNCTION_DECL | |
2693 | && decl_defined_p (decl)) | |
2694 | { | |
2695 | DECL_EXTERNAL (decl) = 1; | |
2696 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
2697 | note_vague_linkage_fn (decl); | |
2698 | /* A non-template inline function with external linkage will | |
2699 | always be COMDAT. As we must eventually determine the | |
2700 | linkage of all functions, and as that causes writes to | |
2701 | the data mapped in from the PCH file, it's advantageous | |
2702 | to mark the functions at this point. */ | |
2703 | if (DECL_DECLARED_INLINE_P (decl) | |
2704 | && (!DECL_IMPLICIT_INSTANTIATION (decl) | |
2705 | || DECL_DEFAULTED_FN (decl))) | |
2706 | { | |
2707 | /* This function must have external linkage, as | |
2708 | otherwise DECL_INTERFACE_KNOWN would have been | |
2709 | set. */ | |
2710 | gcc_assert (TREE_PUBLIC (decl)); | |
2711 | comdat_linkage (decl); | |
2712 | DECL_INTERFACE_KNOWN (decl) = 1; | |
2713 | } | |
2714 | } | |
2715 | else if (TREE_CODE (decl) == VAR_DECL) | |
2716 | maybe_commonize_var (decl); | |
2717 | } | |
2718 | } | |
2719 | ||
2720 | /* DECL is a FUNCTION_DECL or VAR_DECL. If the object file linkage | |
2721 | for DECL has not already been determined, do so now by setting | |
2722 | DECL_EXTERNAL, DECL_COMDAT and other related flags. Until this | |
2723 | function is called entities with vague linkage whose definitions | |
2724 | are available must have TREE_PUBLIC set. | |
2725 | ||
2726 | If this function decides to place DECL in COMDAT, it will set | |
2727 | appropriate flags -- but will not clear DECL_EXTERNAL. It is up to | |
2728 | the caller to decide whether or not to clear DECL_EXTERNAL. Some | |
2729 | callers defer that decision until it is clear that DECL is actually | |
2730 | required. */ | |
2731 | ||
2732 | void | |
2733 | import_export_decl (tree decl) | |
2734 | { | |
2735 | int emit_p; | |
2736 | bool comdat_p; | |
2737 | bool import_p; | |
2738 | tree class_type = NULL_TREE; | |
2739 | ||
2740 | if (DECL_INTERFACE_KNOWN (decl)) | |
2741 | return; | |
2742 | ||
2743 | /* We cannot determine what linkage to give to an entity with vague | |
2744 | linkage until the end of the file. For example, a virtual table | |
2745 | for a class will be defined if and only if the key method is | |
2746 | defined in this translation unit. As a further example, consider | |
2747 | that when compiling a translation unit that uses PCH file with | |
2748 | "-frepo" it would be incorrect to make decisions about what | |
2749 | entities to emit when building the PCH; those decisions must be | |
2750 | delayed until the repository information has been processed. */ | |
2751 | gcc_assert (at_eof); | |
2752 | /* Object file linkage for explicit instantiations is handled in | |
2753 | mark_decl_instantiated. For static variables in functions with | |
2754 | vague linkage, maybe_commonize_var is used. | |
2755 | ||
2756 | Therefore, the only declarations that should be provided to this | |
2757 | function are those with external linkage that are: | |
2758 | ||
2759 | * implicit instantiations of function templates | |
2760 | ||
2761 | * inline function | |
2762 | ||
2763 | * implicit instantiations of static data members of class | |
2764 | templates | |
2765 | ||
2766 | * virtual tables | |
2767 | ||
2768 | * typeinfo objects | |
2769 | ||
2770 | Furthermore, all entities that reach this point must have a | |
2771 | definition available in this translation unit. | |
2772 | ||
2773 | The following assertions check these conditions. */ | |
2774 | gcc_assert (VAR_OR_FUNCTION_DECL_P (decl)); | |
2775 | /* Any code that creates entities with TREE_PUBLIC cleared should | |
2776 | also set DECL_INTERFACE_KNOWN. */ | |
2777 | gcc_assert (TREE_PUBLIC (decl)); | |
2778 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
2779 | gcc_assert (DECL_IMPLICIT_INSTANTIATION (decl) | |
2780 | || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl) | |
2781 | || DECL_DECLARED_INLINE_P (decl)); | |
2782 | else | |
2783 | gcc_assert (DECL_IMPLICIT_INSTANTIATION (decl) | |
2784 | || DECL_VTABLE_OR_VTT_P (decl) | |
2785 | || DECL_TINFO_P (decl)); | |
2786 | /* Check that a definition of DECL is available in this translation | |
2787 | unit. */ | |
2788 | gcc_assert (!DECL_REALLY_EXTERN (decl)); | |
2789 | ||
2790 | /* Assume that DECL will not have COMDAT linkage. */ | |
2791 | comdat_p = false; | |
2792 | /* Assume that DECL will not be imported into this translation | |
2793 | unit. */ | |
2794 | import_p = false; | |
2795 | ||
2796 | /* See if the repository tells us whether or not to emit DECL in | |
2797 | this translation unit. */ | |
2798 | emit_p = repo_emit_p (decl); | |
2799 | if (emit_p == 0) | |
2800 | import_p = true; | |
2801 | else if (emit_p == 1) | |
2802 | { | |
2803 | /* The repository indicates that this entity should be defined | |
2804 | here. Make sure the back end honors that request. */ | |
2805 | mark_needed (decl); | |
2806 | /* Output the definition as an ordinary strong definition. */ | |
2807 | DECL_EXTERNAL (decl) = 0; | |
2808 | DECL_INTERFACE_KNOWN (decl) = 1; | |
2809 | return; | |
2810 | } | |
2811 | ||
2812 | if (import_p) | |
2813 | /* We have already decided what to do with this DECL; there is no | |
2814 | need to check anything further. */ | |
2815 | ; | |
2816 | else if (VAR_P (decl) && DECL_VTABLE_OR_VTT_P (decl)) | |
2817 | { | |
2818 | class_type = DECL_CONTEXT (decl); | |
2819 | import_export_class (class_type); | |
2820 | if (TYPE_FOR_JAVA (class_type)) | |
2821 | import_p = true; | |
2822 | else if (CLASSTYPE_INTERFACE_KNOWN (class_type) | |
2823 | && CLASSTYPE_INTERFACE_ONLY (class_type)) | |
2824 | import_p = true; | |
2825 | else if ((!flag_weak || TARGET_WEAK_NOT_IN_ARCHIVE_TOC) | |
2826 | && !CLASSTYPE_USE_TEMPLATE (class_type) | |
2827 | && CLASSTYPE_KEY_METHOD (class_type) | |
2828 | && !DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (class_type))) | |
2829 | /* The ABI requires that all virtual tables be emitted with | |
2830 | COMDAT linkage. However, on systems where COMDAT symbols | |
2831 | don't show up in the table of contents for a static | |
2832 | archive, or on systems without weak symbols (where we | |
2833 | approximate COMDAT linkage by using internal linkage), the | |
2834 | linker will report errors about undefined symbols because | |
2835 | it will not see the virtual table definition. Therefore, | |
2836 | in the case that we know that the virtual table will be | |
2837 | emitted in only one translation unit, we make the virtual | |
2838 | table an ordinary definition with external linkage. */ | |
2839 | DECL_EXTERNAL (decl) = 0; | |
2840 | else if (CLASSTYPE_INTERFACE_KNOWN (class_type)) | |
2841 | { | |
2842 | /* CLASS_TYPE is being exported from this translation unit, | |
2843 | so DECL should be defined here. */ | |
2844 | if (!flag_weak && CLASSTYPE_EXPLICIT_INSTANTIATION (class_type)) | |
2845 | /* If a class is declared in a header with the "extern | |
2846 | template" extension, then it will not be instantiated, | |
2847 | even in translation units that would normally require | |
2848 | it. Often such classes are explicitly instantiated in | |
2849 | one translation unit. Therefore, the explicit | |
2850 | instantiation must be made visible to other translation | |
2851 | units. */ | |
2852 | DECL_EXTERNAL (decl) = 0; | |
2853 | else | |
2854 | { | |
2855 | /* The generic C++ ABI says that class data is always | |
2856 | COMDAT, even if there is a key function. Some | |
2857 | variants (e.g., the ARM EABI) says that class data | |
2858 | only has COMDAT linkage if the class data might be | |
2859 | emitted in more than one translation unit. When the | |
2860 | key method can be inline and is inline, we still have | |
2861 | to arrange for comdat even though | |
2862 | class_data_always_comdat is false. */ | |
2863 | if (!CLASSTYPE_KEY_METHOD (class_type) | |
2864 | || DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (class_type)) | |
2865 | || targetm.cxx.class_data_always_comdat ()) | |
2866 | { | |
2867 | /* The ABI requires COMDAT linkage. Normally, we | |
2868 | only emit COMDAT things when they are needed; | |
2869 | make sure that we realize that this entity is | |
2870 | indeed needed. */ | |
2871 | comdat_p = true; | |
2872 | mark_needed (decl); | |
2873 | } | |
2874 | } | |
2875 | } | |
2876 | else if (!flag_implicit_templates | |
2877 | && CLASSTYPE_IMPLICIT_INSTANTIATION (class_type)) | |
2878 | import_p = true; | |
2879 | else | |
2880 | comdat_p = true; | |
2881 | } | |
2882 | else if (VAR_P (decl) && DECL_TINFO_P (decl)) | |
2883 | { | |
2884 | tree type = TREE_TYPE (DECL_NAME (decl)); | |
2885 | if (CLASS_TYPE_P (type)) | |
2886 | { | |
2887 | class_type = type; | |
2888 | import_export_class (type); | |
2889 | if (CLASSTYPE_INTERFACE_KNOWN (type) | |
2890 | && TYPE_POLYMORPHIC_P (type) | |
2891 | && CLASSTYPE_INTERFACE_ONLY (type) | |
2892 | /* If -fno-rtti was specified, then we cannot be sure | |
2893 | that RTTI information will be emitted with the | |
2894 | virtual table of the class, so we must emit it | |
2895 | wherever it is used. */ | |
2896 | && flag_rtti) | |
2897 | import_p = true; | |
2898 | else | |
2899 | { | |
2900 | if (CLASSTYPE_INTERFACE_KNOWN (type) | |
2901 | && !CLASSTYPE_INTERFACE_ONLY (type)) | |
2902 | { | |
2903 | comdat_p = (targetm.cxx.class_data_always_comdat () | |
2904 | || (CLASSTYPE_KEY_METHOD (type) | |
2905 | && DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (type)))); | |
2906 | mark_needed (decl); | |
2907 | if (!flag_weak) | |
2908 | { | |
2909 | comdat_p = false; | |
2910 | DECL_EXTERNAL (decl) = 0; | |
2911 | } | |
2912 | } | |
2913 | else | |
2914 | comdat_p = true; | |
2915 | } | |
2916 | } | |
2917 | else | |
2918 | comdat_p = true; | |
2919 | } | |
2920 | else if (DECL_TEMPLOID_INSTANTIATION (decl)) | |
2921 | { | |
2922 | /* DECL is an implicit instantiation of a function or static | |
2923 | data member. */ | |
2924 | if ((flag_implicit_templates | |
2925 | && !flag_use_repository) | |
2926 | || (flag_implicit_inline_templates | |
2927 | && TREE_CODE (decl) == FUNCTION_DECL | |
2928 | && DECL_DECLARED_INLINE_P (decl))) | |
2929 | comdat_p = true; | |
2930 | else | |
2931 | /* If we are not implicitly generating templates, then mark | |
2932 | this entity as undefined in this translation unit. */ | |
2933 | import_p = true; | |
2934 | } | |
2935 | else if (DECL_FUNCTION_MEMBER_P (decl)) | |
2936 | { | |
2937 | if (!DECL_DECLARED_INLINE_P (decl)) | |
2938 | { | |
2939 | tree ctype = DECL_CONTEXT (decl); | |
2940 | import_export_class (ctype); | |
2941 | if (CLASSTYPE_INTERFACE_KNOWN (ctype)) | |
2942 | { | |
2943 | DECL_NOT_REALLY_EXTERN (decl) | |
2944 | = ! (CLASSTYPE_INTERFACE_ONLY (ctype) | |
2945 | || (DECL_DECLARED_INLINE_P (decl) | |
2946 | && ! flag_implement_inlines | |
2947 | && !DECL_VINDEX (decl))); | |
2948 | ||
2949 | if (!DECL_NOT_REALLY_EXTERN (decl)) | |
2950 | DECL_EXTERNAL (decl) = 1; | |
2951 | ||
2952 | /* Always make artificials weak. */ | |
2953 | if (DECL_ARTIFICIAL (decl) && flag_weak) | |
2954 | comdat_p = true; | |
2955 | else | |
2956 | maybe_make_one_only (decl); | |
2957 | } | |
2958 | } | |
2959 | else | |
2960 | comdat_p = true; | |
2961 | } | |
2962 | else | |
2963 | comdat_p = true; | |
2964 | ||
2965 | if (import_p) | |
2966 | { | |
2967 | /* If we are importing DECL into this translation unit, mark is | |
2968 | an undefined here. */ | |
2969 | DECL_EXTERNAL (decl) = 1; | |
2970 | DECL_NOT_REALLY_EXTERN (decl) = 0; | |
2971 | } | |
2972 | else if (comdat_p) | |
2973 | { | |
2974 | /* If we decided to put DECL in COMDAT, mark it accordingly at | |
2975 | this point. */ | |
2976 | comdat_linkage (decl); | |
2977 | } | |
2978 | ||
2979 | DECL_INTERFACE_KNOWN (decl) = 1; | |
2980 | } | |
2981 | ||
2982 | /* Return an expression that performs the destruction of DECL, which | |
2983 | must be a VAR_DECL whose type has a non-trivial destructor, or is | |
2984 | an array whose (innermost) elements have a non-trivial destructor. */ | |
2985 | ||
2986 | tree | |
2987 | build_cleanup (tree decl) | |
2988 | { | |
2989 | tree clean = cxx_maybe_build_cleanup (decl, tf_warning_or_error); | |
2990 | gcc_assert (clean != NULL_TREE); | |
2991 | return clean; | |
2992 | } | |
2993 | ||
2994 | /* Returns the initialization guard variable for the variable DECL, | |
2995 | which has static storage duration. */ | |
2996 | ||
2997 | tree | |
2998 | get_guard (tree decl) | |
2999 | { | |
3000 | tree sname; | |
3001 | tree guard; | |
3002 | ||
3003 | sname = mangle_guard_variable (decl); | |
3004 | guard = IDENTIFIER_GLOBAL_VALUE (sname); | |
3005 | if (! guard) | |
3006 | { | |
3007 | tree guard_type; | |
3008 | ||
3009 | /* We use a type that is big enough to contain a mutex as well | |
3010 | as an integer counter. */ | |
3011 | guard_type = targetm.cxx.guard_type (); | |
3012 | guard = build_decl (DECL_SOURCE_LOCATION (decl), | |
3013 | VAR_DECL, sname, guard_type); | |
3014 | ||
3015 | /* The guard should have the same linkage as what it guards. */ | |
3016 | TREE_PUBLIC (guard) = TREE_PUBLIC (decl); | |
3017 | TREE_STATIC (guard) = TREE_STATIC (decl); | |
3018 | DECL_COMMON (guard) = DECL_COMMON (decl); | |
3019 | DECL_COMDAT (guard) = DECL_COMDAT (decl); | |
3020 | set_decl_tls_model (guard, DECL_TLS_MODEL (decl)); | |
3021 | if (DECL_ONE_ONLY (decl)) | |
3022 | make_decl_one_only (guard, cxx_comdat_group (guard)); | |
3023 | if (TREE_PUBLIC (decl)) | |
3024 | DECL_WEAK (guard) = DECL_WEAK (decl); | |
3025 | DECL_VISIBILITY (guard) = DECL_VISIBILITY (decl); | |
3026 | DECL_VISIBILITY_SPECIFIED (guard) = DECL_VISIBILITY_SPECIFIED (decl); | |
3027 | ||
3028 | DECL_ARTIFICIAL (guard) = 1; | |
3029 | DECL_IGNORED_P (guard) = 1; | |
3030 | TREE_USED (guard) = 1; | |
3031 | pushdecl_top_level_and_finish (guard, NULL_TREE); | |
3032 | } | |
3033 | return guard; | |
3034 | } | |
3035 | ||
3036 | /* Return those bits of the GUARD variable that should be set when the | |
3037 | guarded entity is actually initialized. */ | |
3038 | ||
3039 | static tree | |
3040 | get_guard_bits (tree guard) | |
3041 | { | |
3042 | if (!targetm.cxx.guard_mask_bit ()) | |
3043 | { | |
3044 | /* We only set the first byte of the guard, in order to leave room | |
3045 | for a mutex in the high-order bits. */ | |
3046 | guard = build1 (ADDR_EXPR, | |
3047 | build_pointer_type (TREE_TYPE (guard)), | |
3048 | guard); | |
3049 | guard = build1 (NOP_EXPR, | |
3050 | build_pointer_type (char_type_node), | |
3051 | guard); | |
3052 | guard = build1 (INDIRECT_REF, char_type_node, guard); | |
3053 | } | |
3054 | ||
3055 | return guard; | |
3056 | } | |
3057 | ||
3058 | /* Return an expression which determines whether or not the GUARD | |
3059 | variable has already been initialized. */ | |
3060 | ||
3061 | tree | |
3062 | get_guard_cond (tree guard) | |
3063 | { | |
3064 | tree guard_value; | |
3065 | ||
3066 | /* Check to see if the GUARD is zero. */ | |
3067 | guard = get_guard_bits (guard); | |
3068 | ||
3069 | /* Mask off all but the low bit. */ | |
3070 | if (targetm.cxx.guard_mask_bit ()) | |
3071 | { | |
3072 | guard_value = integer_one_node; | |
3073 | if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard))) | |
3074 | guard_value = convert (TREE_TYPE (guard), guard_value); | |
3075 | guard = cp_build_binary_op (input_location, | |
3076 | BIT_AND_EXPR, guard, guard_value, | |
3077 | tf_warning_or_error); | |
3078 | } | |
3079 | ||
3080 | guard_value = integer_zero_node; | |
3081 | if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard))) | |
3082 | guard_value = convert (TREE_TYPE (guard), guard_value); | |
3083 | return cp_build_binary_op (input_location, | |
3084 | EQ_EXPR, guard, guard_value, | |
3085 | tf_warning_or_error); | |
3086 | } | |
3087 | ||
3088 | /* Return an expression which sets the GUARD variable, indicating that | |
3089 | the variable being guarded has been initialized. */ | |
3090 | ||
3091 | tree | |
3092 | set_guard (tree guard) | |
3093 | { | |
3094 | tree guard_init; | |
3095 | ||
3096 | /* Set the GUARD to one. */ | |
3097 | guard = get_guard_bits (guard); | |
3098 | guard_init = integer_one_node; | |
3099 | if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard))) | |
3100 | guard_init = convert (TREE_TYPE (guard), guard_init); | |
3101 | return cp_build_modify_expr (guard, NOP_EXPR, guard_init, | |
3102 | tf_warning_or_error); | |
3103 | } | |
3104 | ||
3105 | /* Returns true iff we can tell that VAR does not have a dynamic | |
3106 | initializer. */ | |
3107 | ||
3108 | static bool | |
3109 | var_defined_without_dynamic_init (tree var) | |
3110 | { | |
3111 | /* If it's defined in another TU, we can't tell. */ | |
3112 | if (DECL_EXTERNAL (var)) | |
3113 | return false; | |
3114 | /* If it has a non-trivial destructor, registering the destructor | |
3115 | counts as dynamic initialization. */ | |
3116 | if (TYPE_HAS_NONTRIVIAL_DESTRUCTOR (TREE_TYPE (var))) | |
3117 | return false; | |
3118 | /* If it's in this TU, its initializer has been processed, unless | |
3119 | it's a case of self-initialization, then DECL_INITIALIZED_P is | |
3120 | false while the initializer is handled by finish_id_expression. */ | |
3121 | if (!DECL_INITIALIZED_P (var)) | |
3122 | return false; | |
3123 | /* If it has no initializer or a constant one, it's not dynamic. */ | |
3124 | return (!DECL_NONTRIVIALLY_INITIALIZED_P (var) | |
3125 | || DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (var)); | |
3126 | } | |
3127 | ||
3128 | /* Returns true iff VAR is a variable that needs uses to be | |
3129 | wrapped for possible dynamic initialization. */ | |
3130 | ||
3131 | static bool | |
3132 | var_needs_tls_wrapper (tree var) | |
3133 | { | |
3134 | return (!error_operand_p (var) | |
3135 | && DECL_THREAD_LOCAL_P (var) | |
3136 | && !DECL_GNU_TLS_P (var) | |
3137 | && !DECL_FUNCTION_SCOPE_P (var) | |
3138 | && !var_defined_without_dynamic_init (var)); | |
3139 | } | |
3140 | ||
3141 | /* Get the FUNCTION_DECL for the shared TLS init function for this | |
3142 | translation unit. */ | |
3143 | ||
3144 | static tree | |
3145 | get_local_tls_init_fn (void) | |
3146 | { | |
3147 | tree sname = get_identifier ("__tls_init"); | |
3148 | tree fn = IDENTIFIER_GLOBAL_VALUE (sname); | |
3149 | if (!fn) | |
3150 | { | |
3151 | fn = build_lang_decl (FUNCTION_DECL, sname, | |
3152 | build_function_type (void_type_node, | |
3153 | void_list_node)); | |
3154 | SET_DECL_LANGUAGE (fn, lang_c); | |
3155 | TREE_PUBLIC (fn) = false; | |
3156 | DECL_ARTIFICIAL (fn) = true; | |
3157 | mark_used (fn); | |
3158 | SET_IDENTIFIER_GLOBAL_VALUE (sname, fn); | |
3159 | } | |
3160 | return fn; | |
3161 | } | |
3162 | ||
3163 | /* Get a FUNCTION_DECL for the init function for the thread_local | |
3164 | variable VAR. The init function will be an alias to the function | |
3165 | that initializes all the non-local TLS variables in the translation | |
3166 | unit. The init function is only used by the wrapper function. */ | |
3167 | ||
3168 | static tree | |
3169 | get_tls_init_fn (tree var) | |
3170 | { | |
3171 | /* Only C++11 TLS vars need this init fn. */ | |
3172 | if (!var_needs_tls_wrapper (var)) | |
3173 | return NULL_TREE; | |
3174 | ||
3175 | /* If -fno-extern-tls-init, assume that we don't need to call | |
3176 | a tls init function for a variable defined in another TU. */ | |
3177 | if (!flag_extern_tls_init && DECL_EXTERNAL (var)) | |
3178 | return NULL_TREE; | |
3179 | ||
3180 | #ifdef ASM_OUTPUT_DEF | |
3181 | /* If the variable is internal, or if we can't generate aliases, | |
3182 | call the local init function directly. */ | |
3183 | if (!TREE_PUBLIC (var)) | |
3184 | #endif | |
3185 | return get_local_tls_init_fn (); | |
3186 | ||
3187 | tree sname = mangle_tls_init_fn (var); | |
3188 | tree fn = IDENTIFIER_GLOBAL_VALUE (sname); | |
3189 | if (!fn) | |
3190 | { | |
3191 | fn = build_lang_decl (FUNCTION_DECL, sname, | |
3192 | build_function_type (void_type_node, | |
3193 | void_list_node)); | |
3194 | SET_DECL_LANGUAGE (fn, lang_c); | |
3195 | TREE_PUBLIC (fn) = TREE_PUBLIC (var); | |
3196 | DECL_ARTIFICIAL (fn) = true; | |
3197 | DECL_COMDAT (fn) = DECL_COMDAT (var); | |
3198 | DECL_EXTERNAL (fn) = DECL_EXTERNAL (var); | |
3199 | if (DECL_ONE_ONLY (var)) | |
3200 | make_decl_one_only (fn, cxx_comdat_group (fn)); | |
3201 | if (TREE_PUBLIC (var)) | |
3202 | { | |
3203 | tree obtype = strip_array_types (non_reference (TREE_TYPE (var))); | |
3204 | /* If the variable is defined somewhere else and might have static | |
3205 | initialization, make the init function a weak reference. */ | |
3206 | if ((!TYPE_NEEDS_CONSTRUCTING (obtype) | |
3207 | || TYPE_HAS_CONSTEXPR_CTOR (obtype)) | |
3208 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (obtype) | |
3209 | && DECL_EXTERNAL (var)) | |
3210 | declare_weak (fn); | |
3211 | else | |
3212 | DECL_WEAK (fn) = DECL_WEAK (var); | |
3213 | } | |
3214 | DECL_VISIBILITY (fn) = DECL_VISIBILITY (var); | |
3215 | DECL_VISIBILITY_SPECIFIED (fn) = DECL_VISIBILITY_SPECIFIED (var); | |
3216 | DECL_DLLIMPORT_P (fn) = DECL_DLLIMPORT_P (var); | |
3217 | DECL_IGNORED_P (fn) = 1; | |
3218 | mark_used (fn); | |
3219 | ||
3220 | DECL_BEFRIENDING_CLASSES (fn) = var; | |
3221 | ||
3222 | SET_IDENTIFIER_GLOBAL_VALUE (sname, fn); | |
3223 | } | |
3224 | return fn; | |
3225 | } | |
3226 | ||
3227 | /* Get a FUNCTION_DECL for the init wrapper function for the thread_local | |
3228 | variable VAR. The wrapper function calls the init function (if any) for | |
3229 | VAR and then returns a reference to VAR. The wrapper function is used | |
3230 | in place of VAR everywhere VAR is mentioned. */ | |
3231 | ||
3232 | tree | |
3233 | get_tls_wrapper_fn (tree var) | |
3234 | { | |
3235 | /* Only C++11 TLS vars need this wrapper fn. */ | |
3236 | if (!var_needs_tls_wrapper (var)) | |
3237 | return NULL_TREE; | |
3238 | ||
3239 | tree sname = mangle_tls_wrapper_fn (var); | |
3240 | tree fn = IDENTIFIER_GLOBAL_VALUE (sname); | |
3241 | if (!fn) | |
3242 | { | |
3243 | /* A named rvalue reference is an lvalue, so the wrapper should | |
3244 | always return an lvalue reference. */ | |
3245 | tree type = non_reference (TREE_TYPE (var)); | |
3246 | type = build_reference_type (type); | |
3247 | tree fntype = build_function_type (type, void_list_node); | |
3248 | fn = build_lang_decl (FUNCTION_DECL, sname, fntype); | |
3249 | SET_DECL_LANGUAGE (fn, lang_c); | |
3250 | TREE_PUBLIC (fn) = TREE_PUBLIC (var); | |
3251 | DECL_ARTIFICIAL (fn) = true; | |
3252 | DECL_IGNORED_P (fn) = 1; | |
3253 | /* The wrapper is inline and emitted everywhere var is used. */ | |
3254 | DECL_DECLARED_INLINE_P (fn) = true; | |
3255 | if (TREE_PUBLIC (var)) | |
3256 | { | |
3257 | comdat_linkage (fn); | |
3258 | #ifdef HAVE_GAS_HIDDEN | |
3259 | /* Make the wrapper bind locally; there's no reason to share | |
3260 | the wrapper between multiple shared objects. */ | |
3261 | DECL_VISIBILITY (fn) = VISIBILITY_INTERNAL; | |
3262 | DECL_VISIBILITY_SPECIFIED (fn) = true; | |
3263 | #endif | |
3264 | } | |
3265 | if (!TREE_PUBLIC (fn)) | |
3266 | DECL_INTERFACE_KNOWN (fn) = true; | |
3267 | mark_used (fn); | |
3268 | note_vague_linkage_fn (fn); | |
3269 | ||
3270 | #if 0 | |
3271 | /* We want CSE to commonize calls to the wrapper, but marking it as | |
3272 | pure is unsafe since it has side-effects. I guess we need a new | |
3273 | ECF flag even weaker than ECF_PURE. FIXME! */ | |
3274 | DECL_PURE_P (fn) = true; | |
3275 | #endif | |
3276 | ||
3277 | DECL_BEFRIENDING_CLASSES (fn) = var; | |
3278 | ||
3279 | SET_IDENTIFIER_GLOBAL_VALUE (sname, fn); | |
3280 | } | |
3281 | return fn; | |
3282 | } | |
3283 | ||
3284 | /* At EOF, generate the definition for the TLS wrapper function FN: | |
3285 | ||
3286 | T& var_wrapper() { | |
3287 | if (init_fn) init_fn(); | |
3288 | return var; | |
3289 | } */ | |
3290 | ||
3291 | static void | |
3292 | generate_tls_wrapper (tree fn) | |
3293 | { | |
3294 | tree var = DECL_BEFRIENDING_CLASSES (fn); | |
3295 | ||
3296 | start_preparsed_function (fn, NULL_TREE, SF_DEFAULT | SF_PRE_PARSED); | |
3297 | tree body = begin_function_body (); | |
3298 | /* Only call the init fn if there might be one. */ | |
3299 | if (tree init_fn = get_tls_init_fn (var)) | |
3300 | { | |
3301 | tree if_stmt = NULL_TREE; | |
3302 | /* If init_fn is a weakref, make sure it exists before calling. */ | |
3303 | if (lookup_attribute ("weak", DECL_ATTRIBUTES (init_fn))) | |
3304 | { | |
3305 | if_stmt = begin_if_stmt (); | |
3306 | tree addr = cp_build_addr_expr (init_fn, tf_warning_or_error); | |
3307 | tree cond = cp_build_binary_op (DECL_SOURCE_LOCATION (var), | |
3308 | NE_EXPR, addr, nullptr_node, | |
3309 | tf_warning_or_error); | |
3310 | finish_if_stmt_cond (cond, if_stmt); | |
3311 | } | |
3312 | finish_expr_stmt (build_cxx_call | |
3313 | (init_fn, 0, NULL, tf_warning_or_error)); | |
3314 | if (if_stmt) | |
3315 | { | |
3316 | finish_then_clause (if_stmt); | |
3317 | finish_if_stmt (if_stmt); | |
3318 | } | |
3319 | } | |
3320 | else | |
3321 | /* If there's no initialization, the wrapper is a constant function. */ | |
3322 | TREE_READONLY (fn) = true; | |
3323 | finish_return_stmt (convert_from_reference (var)); | |
3324 | finish_function_body (body); | |
3325 | expand_or_defer_fn (finish_function (0)); | |
3326 | } | |
3327 | ||
3328 | /* Start the process of running a particular set of global constructors | |
3329 | or destructors. Subroutine of do_[cd]tors. Also called from | |
3330 | vtv_start_verification_constructor_init_function. */ | |
3331 | ||
3332 | static tree | |
3333 | start_objects (int method_type, int initp) | |
3334 | { | |
3335 | tree body; | |
3336 | tree fndecl; | |
3337 | char type[14]; | |
3338 | ||
3339 | /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */ | |
3340 | ||
3341 | if (initp != DEFAULT_INIT_PRIORITY) | |
3342 | { | |
3343 | char joiner; | |
3344 | ||
3345 | #ifdef JOINER | |
3346 | joiner = JOINER; | |
3347 | #else | |
3348 | joiner = '_'; | |
3349 | #endif | |
3350 | ||
3351 | sprintf (type, "sub_%c%c%.5u", method_type, joiner, initp); | |
3352 | } | |
3353 | else | |
3354 | sprintf (type, "sub_%c", method_type); | |
3355 | ||
3356 | fndecl = build_lang_decl (FUNCTION_DECL, | |
3357 | get_file_function_name (type), | |
3358 | build_function_type_list (void_type_node, | |
3359 | NULL_TREE)); | |
3360 | start_preparsed_function (fndecl, /*attrs=*/NULL_TREE, SF_PRE_PARSED); | |
3361 | ||
3362 | TREE_PUBLIC (current_function_decl) = 0; | |
3363 | ||
3364 | /* Mark as artificial because it's not explicitly in the user's | |
3365 | source code. */ | |
3366 | DECL_ARTIFICIAL (current_function_decl) = 1; | |
3367 | ||
3368 | /* Mark this declaration as used to avoid spurious warnings. */ | |
3369 | TREE_USED (current_function_decl) = 1; | |
3370 | ||
3371 | /* Mark this function as a global constructor or destructor. */ | |
3372 | if (method_type == 'I') | |
3373 | DECL_GLOBAL_CTOR_P (current_function_decl) = 1; | |
3374 | else | |
3375 | DECL_GLOBAL_DTOR_P (current_function_decl) = 1; | |
3376 | ||
3377 | body = begin_compound_stmt (BCS_FN_BODY); | |
3378 | ||
3379 | return body; | |
3380 | } | |
3381 | ||
3382 | /* Finish the process of running a particular set of global constructors | |
3383 | or destructors. Subroutine of do_[cd]tors. */ | |
3384 | ||
3385 | static void | |
3386 | finish_objects (int method_type, int initp, tree body) | |
3387 | { | |
3388 | tree fn; | |
3389 | ||
3390 | /* Finish up. */ | |
3391 | finish_compound_stmt (body); | |
3392 | fn = finish_function (0); | |
3393 | ||
3394 | if (method_type == 'I') | |
3395 | { | |
3396 | DECL_STATIC_CONSTRUCTOR (fn) = 1; | |
3397 | decl_init_priority_insert (fn, initp); | |
3398 | } | |
3399 | else | |
3400 | { | |
3401 | DECL_STATIC_DESTRUCTOR (fn) = 1; | |
3402 | decl_fini_priority_insert (fn, initp); | |
3403 | } | |
3404 | ||
3405 | expand_or_defer_fn (fn); | |
3406 | } | |
3407 | ||
3408 | /* The names of the parameters to the function created to handle | |
3409 | initializations and destructions for objects with static storage | |
3410 | duration. */ | |
3411 | #define INITIALIZE_P_IDENTIFIER "__initialize_p" | |
3412 | #define PRIORITY_IDENTIFIER "__priority" | |
3413 | ||
3414 | /* The name of the function we create to handle initializations and | |
3415 | destructions for objects with static storage duration. */ | |
3416 | #define SSDF_IDENTIFIER "__static_initialization_and_destruction" | |
3417 | ||
3418 | /* The declaration for the __INITIALIZE_P argument. */ | |
3419 | static GTY(()) tree initialize_p_decl; | |
3420 | ||
3421 | /* The declaration for the __PRIORITY argument. */ | |
3422 | static GTY(()) tree priority_decl; | |
3423 | ||
3424 | /* The declaration for the static storage duration function. */ | |
3425 | static GTY(()) tree ssdf_decl; | |
3426 | ||
3427 | /* All the static storage duration functions created in this | |
3428 | translation unit. */ | |
3429 | static GTY(()) vec<tree, va_gc> *ssdf_decls; | |
3430 | ||
3431 | /* A map from priority levels to information about that priority | |
3432 | level. There may be many such levels, so efficient lookup is | |
3433 | important. */ | |
3434 | static splay_tree priority_info_map; | |
3435 | ||
3436 | /* Begins the generation of the function that will handle all | |
3437 | initialization and destruction of objects with static storage | |
3438 | duration. The function generated takes two parameters of type | |
3439 | `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is | |
3440 | nonzero, it performs initializations. Otherwise, it performs | |
3441 | destructions. It only performs those initializations or | |
3442 | destructions with the indicated __PRIORITY. The generated function | |
3443 | returns no value. | |
3444 | ||
3445 | It is assumed that this function will only be called once per | |
3446 | translation unit. */ | |
3447 | ||
3448 | static tree | |
3449 | start_static_storage_duration_function (unsigned count) | |
3450 | { | |
3451 | tree type; | |
3452 | tree body; | |
3453 | char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32]; | |
3454 | ||
3455 | /* Create the identifier for this function. It will be of the form | |
3456 | SSDF_IDENTIFIER_<number>. */ | |
3457 | sprintf (id, "%s_%u", SSDF_IDENTIFIER, count); | |
3458 | ||
3459 | type = build_function_type_list (void_type_node, | |
3460 | integer_type_node, integer_type_node, | |
3461 | NULL_TREE); | |
3462 | ||
3463 | /* Create the FUNCTION_DECL itself. */ | |
3464 | ssdf_decl = build_lang_decl (FUNCTION_DECL, | |
3465 | get_identifier (id), | |
3466 | type); | |
3467 | TREE_PUBLIC (ssdf_decl) = 0; | |
3468 | DECL_ARTIFICIAL (ssdf_decl) = 1; | |
3469 | ||
3470 | /* Put this function in the list of functions to be called from the | |
3471 | static constructors and destructors. */ | |
3472 | if (!ssdf_decls) | |
3473 | { | |
3474 | vec_alloc (ssdf_decls, 32); | |
3475 | ||
3476 | /* Take this opportunity to initialize the map from priority | |
3477 | numbers to information about that priority level. */ | |
3478 | priority_info_map = splay_tree_new (splay_tree_compare_ints, | |
3479 | /*delete_key_fn=*/0, | |
3480 | /*delete_value_fn=*/ | |
3481 | (splay_tree_delete_value_fn) &free); | |
3482 | ||
3483 | /* We always need to generate functions for the | |
3484 | DEFAULT_INIT_PRIORITY so enter it now. That way when we walk | |
3485 | priorities later, we'll be sure to find the | |
3486 | DEFAULT_INIT_PRIORITY. */ | |
3487 | get_priority_info (DEFAULT_INIT_PRIORITY); | |
3488 | } | |
3489 | ||
3490 | vec_safe_push (ssdf_decls, ssdf_decl); | |
3491 | ||
3492 | /* Create the argument list. */ | |
3493 | initialize_p_decl = cp_build_parm_decl | |
3494 | (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node); | |
3495 | DECL_CONTEXT (initialize_p_decl) = ssdf_decl; | |
3496 | TREE_USED (initialize_p_decl) = 1; | |
3497 | priority_decl = cp_build_parm_decl | |
3498 | (get_identifier (PRIORITY_IDENTIFIER), integer_type_node); | |
3499 | DECL_CONTEXT (priority_decl) = ssdf_decl; | |
3500 | TREE_USED (priority_decl) = 1; | |
3501 | ||
3502 | DECL_CHAIN (initialize_p_decl) = priority_decl; | |
3503 | DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl; | |
3504 | ||
3505 | /* Put the function in the global scope. */ | |
3506 | pushdecl (ssdf_decl); | |
3507 | ||
3508 | /* Start the function itself. This is equivalent to declaring the | |
3509 | function as: | |
3510 | ||
3511 | static void __ssdf (int __initialize_p, init __priority_p); | |
3512 | ||
3513 | It is static because we only need to call this function from the | |
3514 | various constructor and destructor functions for this module. */ | |
3515 | start_preparsed_function (ssdf_decl, | |
3516 | /*attrs=*/NULL_TREE, | |
3517 | SF_PRE_PARSED); | |
3518 | ||
3519 | /* Set up the scope of the outermost block in the function. */ | |
3520 | body = begin_compound_stmt (BCS_FN_BODY); | |
3521 | ||
3522 | return body; | |
3523 | } | |
3524 | ||
3525 | /* Finish the generation of the function which performs initialization | |
3526 | and destruction of objects with static storage duration. After | |
3527 | this point, no more such objects can be created. */ | |
3528 | ||
3529 | static void | |
3530 | finish_static_storage_duration_function (tree body) | |
3531 | { | |
3532 | /* Close out the function. */ | |
3533 | finish_compound_stmt (body); | |
3534 | expand_or_defer_fn (finish_function (0)); | |
3535 | } | |
3536 | ||
3537 | /* Return the information about the indicated PRIORITY level. If no | |
3538 | code to handle this level has yet been generated, generate the | |
3539 | appropriate prologue. */ | |
3540 | ||
3541 | static priority_info | |
3542 | get_priority_info (int priority) | |
3543 | { | |
3544 | priority_info pi; | |
3545 | splay_tree_node n; | |
3546 | ||
3547 | n = splay_tree_lookup (priority_info_map, | |
3548 | (splay_tree_key) priority); | |
3549 | if (!n) | |
3550 | { | |
3551 | /* Create a new priority information structure, and insert it | |
3552 | into the map. */ | |
3553 | pi = XNEW (struct priority_info_s); | |
3554 | pi->initializations_p = 0; | |
3555 | pi->destructions_p = 0; | |
3556 | splay_tree_insert (priority_info_map, | |
3557 | (splay_tree_key) priority, | |
3558 | (splay_tree_value) pi); | |
3559 | } | |
3560 | else | |
3561 | pi = (priority_info) n->value; | |
3562 | ||
3563 | return pi; | |
3564 | } | |
3565 | ||
3566 | /* The effective initialization priority of a DECL. */ | |
3567 | ||
3568 | #define DECL_EFFECTIVE_INIT_PRIORITY(decl) \ | |
3569 | ((!DECL_HAS_INIT_PRIORITY_P (decl) || DECL_INIT_PRIORITY (decl) == 0) \ | |
3570 | ? DEFAULT_INIT_PRIORITY : DECL_INIT_PRIORITY (decl)) | |
3571 | ||
3572 | /* Whether a DECL needs a guard to protect it against multiple | |
3573 | initialization. */ | |
3574 | ||
3575 | #define NEEDS_GUARD_P(decl) (TREE_PUBLIC (decl) && (DECL_COMMON (decl) \ | |
3576 | || DECL_ONE_ONLY (decl) \ | |
3577 | || DECL_WEAK (decl))) | |
3578 | ||
3579 | /* Called from one_static_initialization_or_destruction(), | |
3580 | via walk_tree. | |
3581 | Walks the initializer list of a global variable and looks for | |
3582 | temporary variables (DECL_NAME() == NULL and DECL_ARTIFICIAL != 0) | |
3583 | and that have their DECL_CONTEXT() == NULL. | |
3584 | For each such temporary variable, set their DECL_CONTEXT() to | |
3585 | the current function. This is necessary because otherwise | |
3586 | some optimizers (enabled by -O2 -fprofile-arcs) might crash | |
3587 | when trying to refer to a temporary variable that does not have | |
3588 | it's DECL_CONTECT() properly set. */ | |
3589 | static tree | |
3590 | fix_temporary_vars_context_r (tree *node, | |
3591 | int * /*unused*/, | |
3592 | void * /*unused1*/) | |
3593 | { | |
3594 | gcc_assert (current_function_decl); | |
3595 | ||
3596 | if (TREE_CODE (*node) == BIND_EXPR) | |
3597 | { | |
3598 | tree var; | |
3599 | ||
3600 | for (var = BIND_EXPR_VARS (*node); var; var = DECL_CHAIN (var)) | |
3601 | if (VAR_P (var) | |
3602 | && !DECL_NAME (var) | |
3603 | && DECL_ARTIFICIAL (var) | |
3604 | && !DECL_CONTEXT (var)) | |
3605 | DECL_CONTEXT (var) = current_function_decl; | |
3606 | } | |
3607 | ||
3608 | return NULL_TREE; | |
3609 | } | |
3610 | ||
3611 | /* Set up to handle the initialization or destruction of DECL. If | |
3612 | INITP is nonzero, we are initializing the variable. Otherwise, we | |
3613 | are destroying it. */ | |
3614 | ||
3615 | static void | |
3616 | one_static_initialization_or_destruction (tree decl, tree init, bool initp) | |
3617 | { | |
3618 | tree guard_if_stmt = NULL_TREE; | |
3619 | tree guard; | |
3620 | ||
3621 | /* If we are supposed to destruct and there's a trivial destructor, | |
3622 | nothing has to be done. */ | |
3623 | if (!initp | |
3624 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) | |
3625 | return; | |
3626 | ||
3627 | /* Trick the compiler into thinking we are at the file and line | |
3628 | where DECL was declared so that error-messages make sense, and so | |
3629 | that the debugger will show somewhat sensible file and line | |
3630 | information. */ | |
3631 | input_location = DECL_SOURCE_LOCATION (decl); | |
3632 | ||
3633 | /* Make sure temporary variables in the initialiser all have | |
3634 | their DECL_CONTEXT() set to a value different from NULL_TREE. | |
3635 | This can happen when global variables initialisers are built. | |
3636 | In that case, the DECL_CONTEXT() of the global variables _AND_ of all | |
3637 | the temporary variables that might have been generated in the | |
3638 | accompagning initialisers is NULL_TREE, meaning the variables have been | |
3639 | declared in the global namespace. | |
3640 | What we want to do here is to fix that and make sure the DECL_CONTEXT() | |
3641 | of the temporaries are set to the current function decl. */ | |
3642 | cp_walk_tree_without_duplicates (&init, | |
3643 | fix_temporary_vars_context_r, | |
3644 | NULL); | |
3645 | ||
3646 | /* Because of: | |
3647 | ||
3648 | [class.access.spec] | |
3649 | ||
3650 | Access control for implicit calls to the constructors, | |
3651 | the conversion functions, or the destructor called to | |
3652 | create and destroy a static data member is performed as | |
3653 | if these calls appeared in the scope of the member's | |
3654 | class. | |
3655 | ||
3656 | we pretend we are in a static member function of the class of | |
3657 | which the DECL is a member. */ | |
3658 | if (member_p (decl)) | |
3659 | { | |
3660 | DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl); | |
3661 | DECL_STATIC_FUNCTION_P (current_function_decl) = 1; | |
3662 | } | |
3663 | ||
3664 | /* Assume we don't need a guard. */ | |
3665 | guard = NULL_TREE; | |
3666 | /* We need a guard if this is an object with external linkage that | |
3667 | might be initialized in more than one place. (For example, a | |
3668 | static data member of a template, when the data member requires | |
3669 | construction.) */ | |
3670 | if (NEEDS_GUARD_P (decl)) | |
3671 | { | |
3672 | tree guard_cond; | |
3673 | ||
3674 | guard = get_guard (decl); | |
3675 | ||
3676 | /* When using __cxa_atexit, we just check the GUARD as we would | |
3677 | for a local static. */ | |
3678 | if (flag_use_cxa_atexit) | |
3679 | { | |
3680 | /* When using __cxa_atexit, we never try to destroy | |
3681 | anything from a static destructor. */ | |
3682 | gcc_assert (initp); | |
3683 | guard_cond = get_guard_cond (guard); | |
3684 | } | |
3685 | /* If we don't have __cxa_atexit, then we will be running | |
3686 | destructors from .fini sections, or their equivalents. So, | |
3687 | we need to know how many times we've tried to initialize this | |
3688 | object. We do initializations only if the GUARD is zero, | |
3689 | i.e., if we are the first to initialize the variable. We do | |
3690 | destructions only if the GUARD is one, i.e., if we are the | |
3691 | last to destroy the variable. */ | |
3692 | else if (initp) | |
3693 | guard_cond | |
3694 | = cp_build_binary_op (input_location, | |
3695 | EQ_EXPR, | |
3696 | cp_build_unary_op (PREINCREMENT_EXPR, | |
3697 | guard, | |
3698 | /*noconvert=*/1, | |
3699 | tf_warning_or_error), | |
3700 | integer_one_node, | |
3701 | tf_warning_or_error); | |
3702 | else | |
3703 | guard_cond | |
3704 | = cp_build_binary_op (input_location, | |
3705 | EQ_EXPR, | |
3706 | cp_build_unary_op (PREDECREMENT_EXPR, | |
3707 | guard, | |
3708 | /*noconvert=*/1, | |
3709 | tf_warning_or_error), | |
3710 | integer_zero_node, | |
3711 | tf_warning_or_error); | |
3712 | ||
3713 | guard_if_stmt = begin_if_stmt (); | |
3714 | finish_if_stmt_cond (guard_cond, guard_if_stmt); | |
3715 | } | |
3716 | ||
3717 | ||
3718 | /* If we're using __cxa_atexit, we have not already set the GUARD, | |
3719 | so we must do so now. */ | |
3720 | if (guard && initp && flag_use_cxa_atexit) | |
3721 | finish_expr_stmt (set_guard (guard)); | |
3722 | ||
3723 | /* Perform the initialization or destruction. */ | |
3724 | if (initp) | |
3725 | { | |
3726 | if (init) | |
3727 | { | |
3728 | finish_expr_stmt (init); | |
3729 | if (flag_sanitize & SANITIZE_ADDRESS) | |
3730 | { | |
3731 | varpool_node *vnode = varpool_node::get (decl); | |
3732 | if (vnode) | |
3733 | vnode->dynamically_initialized = 1; | |
3734 | } | |
3735 | } | |
3736 | ||
3737 | /* If we're using __cxa_atexit, register a function that calls the | |
3738 | destructor for the object. */ | |
3739 | if (flag_use_cxa_atexit) | |
3740 | finish_expr_stmt (register_dtor_fn (decl)); | |
3741 | } | |
3742 | else | |
3743 | finish_expr_stmt (build_cleanup (decl)); | |
3744 | ||
3745 | /* Finish the guard if-stmt, if necessary. */ | |
3746 | if (guard) | |
3747 | { | |
3748 | finish_then_clause (guard_if_stmt); | |
3749 | finish_if_stmt (guard_if_stmt); | |
3750 | } | |
3751 | ||
3752 | /* Now that we're done with DECL we don't need to pretend to be a | |
3753 | member of its class any longer. */ | |
3754 | DECL_CONTEXT (current_function_decl) = NULL_TREE; | |
3755 | DECL_STATIC_FUNCTION_P (current_function_decl) = 0; | |
3756 | } | |
3757 | ||
3758 | /* Generate code to do the initialization or destruction of the decls in VARS, | |
3759 | a TREE_LIST of VAR_DECL with static storage duration. | |
3760 | Whether initialization or destruction is performed is specified by INITP. */ | |
3761 | ||
3762 | static void | |
3763 | do_static_initialization_or_destruction (tree vars, bool initp) | |
3764 | { | |
3765 | tree node, init_if_stmt, cond; | |
3766 | ||
3767 | /* Build the outer if-stmt to check for initialization or destruction. */ | |
3768 | init_if_stmt = begin_if_stmt (); | |
3769 | cond = initp ? integer_one_node : integer_zero_node; | |
3770 | cond = cp_build_binary_op (input_location, | |
3771 | EQ_EXPR, | |
3772 | initialize_p_decl, | |
3773 | cond, | |
3774 | tf_warning_or_error); | |
3775 | finish_if_stmt_cond (cond, init_if_stmt); | |
3776 | ||
3777 | /* To make sure dynamic construction doesn't access globals from other | |
3778 | compilation units where they might not be yet constructed, for | |
3779 | -fsanitize=address insert __asan_before_dynamic_init call that | |
3780 | prevents access to either all global variables that need construction | |
3781 | in other compilation units, or at least those that haven't been | |
3782 | initialized yet. Variables that need dynamic construction in | |
3783 | the current compilation unit are kept accessible. */ | |
3784 | if (flag_sanitize & SANITIZE_ADDRESS) | |
3785 | finish_expr_stmt (asan_dynamic_init_call (/*after_p=*/false)); | |
3786 | ||
3787 | node = vars; | |
3788 | do { | |
3789 | tree decl = TREE_VALUE (node); | |
3790 | tree priority_if_stmt; | |
3791 | int priority; | |
3792 | priority_info pi; | |
3793 | ||
3794 | /* If we don't need a destructor, there's nothing to do. Avoid | |
3795 | creating a possibly empty if-stmt. */ | |
3796 | if (!initp && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) | |
3797 | { | |
3798 | node = TREE_CHAIN (node); | |
3799 | continue; | |
3800 | } | |
3801 | ||
3802 | /* Remember that we had an initialization or finalization at this | |
3803 | priority. */ | |
3804 | priority = DECL_EFFECTIVE_INIT_PRIORITY (decl); | |
3805 | pi = get_priority_info (priority); | |
3806 | if (initp) | |
3807 | pi->initializations_p = 1; | |
3808 | else | |
3809 | pi->destructions_p = 1; | |
3810 | ||
3811 | /* Conditionalize this initialization on being in the right priority | |
3812 | and being initializing/finalizing appropriately. */ | |
3813 | priority_if_stmt = begin_if_stmt (); | |
3814 | cond = cp_build_binary_op (input_location, | |
3815 | EQ_EXPR, | |
3816 | priority_decl, | |
3817 | build_int_cst (NULL_TREE, priority), | |
3818 | tf_warning_or_error); | |
3819 | finish_if_stmt_cond (cond, priority_if_stmt); | |
3820 | ||
3821 | /* Process initializers with same priority. */ | |
3822 | for (; node | |
3823 | && DECL_EFFECTIVE_INIT_PRIORITY (TREE_VALUE (node)) == priority; | |
3824 | node = TREE_CHAIN (node)) | |
3825 | /* Do one initialization or destruction. */ | |
3826 | one_static_initialization_or_destruction (TREE_VALUE (node), | |
3827 | TREE_PURPOSE (node), initp); | |
3828 | ||
3829 | /* Finish up the priority if-stmt body. */ | |
3830 | finish_then_clause (priority_if_stmt); | |
3831 | finish_if_stmt (priority_if_stmt); | |
3832 | ||
3833 | } while (node); | |
3834 | ||
3835 | /* Revert what __asan_before_dynamic_init did by calling | |
3836 | __asan_after_dynamic_init. */ | |
3837 | if (flag_sanitize & SANITIZE_ADDRESS) | |
3838 | finish_expr_stmt (asan_dynamic_init_call (/*after_p=*/true)); | |
3839 | ||
3840 | /* Finish up the init/destruct if-stmt body. */ | |
3841 | finish_then_clause (init_if_stmt); | |
3842 | finish_if_stmt (init_if_stmt); | |
3843 | } | |
3844 | ||
3845 | /* VARS is a list of variables with static storage duration which may | |
3846 | need initialization and/or finalization. Remove those variables | |
3847 | that don't really need to be initialized or finalized, and return | |
3848 | the resulting list. The order in which the variables appear in | |
3849 | VARS is in reverse order of the order in which they should actually | |
3850 | be initialized. The list we return is in the unreversed order; | |
3851 | i.e., the first variable should be initialized first. */ | |
3852 | ||
3853 | static tree | |
3854 | prune_vars_needing_no_initialization (tree *vars) | |
3855 | { | |
3856 | tree *var = vars; | |
3857 | tree result = NULL_TREE; | |
3858 | ||
3859 | while (*var) | |
3860 | { | |
3861 | tree t = *var; | |
3862 | tree decl = TREE_VALUE (t); | |
3863 | tree init = TREE_PURPOSE (t); | |
3864 | ||
3865 | /* Deal gracefully with error. */ | |
3866 | if (decl == error_mark_node) | |
3867 | { | |
3868 | var = &TREE_CHAIN (t); | |
3869 | continue; | |
3870 | } | |
3871 | ||
3872 | /* The only things that can be initialized are variables. */ | |
3873 | gcc_assert (VAR_P (decl)); | |
3874 | ||
3875 | /* If this object is not defined, we don't need to do anything | |
3876 | here. */ | |
3877 | if (DECL_EXTERNAL (decl)) | |
3878 | { | |
3879 | var = &TREE_CHAIN (t); | |
3880 | continue; | |
3881 | } | |
3882 | ||
3883 | /* Also, if the initializer already contains errors, we can bail | |
3884 | out now. */ | |
3885 | if (init && TREE_CODE (init) == TREE_LIST | |
3886 | && value_member (error_mark_node, init)) | |
3887 | { | |
3888 | var = &TREE_CHAIN (t); | |
3889 | continue; | |
3890 | } | |
3891 | ||
3892 | /* This variable is going to need initialization and/or | |
3893 | finalization, so we add it to the list. */ | |
3894 | *var = TREE_CHAIN (t); | |
3895 | TREE_CHAIN (t) = result; | |
3896 | result = t; | |
3897 | } | |
3898 | ||
3899 | return result; | |
3900 | } | |
3901 | ||
3902 | /* Make sure we have told the back end about all the variables in | |
3903 | VARS. */ | |
3904 | ||
3905 | static void | |
3906 | write_out_vars (tree vars) | |
3907 | { | |
3908 | tree v; | |
3909 | ||
3910 | for (v = vars; v; v = TREE_CHAIN (v)) | |
3911 | { | |
3912 | tree var = TREE_VALUE (v); | |
3913 | if (!var_finalized_p (var)) | |
3914 | { | |
3915 | import_export_decl (var); | |
3916 | rest_of_decl_compilation (var, 1, 1); | |
3917 | } | |
3918 | } | |
3919 | } | |
3920 | ||
3921 | /* Generate a static constructor (if CONSTRUCTOR_P) or destructor | |
3922 | (otherwise) that will initialize all global objects with static | |
3923 | storage duration having the indicated PRIORITY. */ | |
3924 | ||
3925 | static void | |
3926 | generate_ctor_or_dtor_function (bool constructor_p, int priority, | |
3927 | location_t *locus) | |
3928 | { | |
3929 | char function_key; | |
3930 | tree fndecl; | |
3931 | tree body; | |
3932 | size_t i; | |
3933 | ||
3934 | input_location = *locus; | |
3935 | /* ??? */ | |
3936 | /* Was: locus->line++; */ | |
3937 | ||
3938 | /* We use `I' to indicate initialization and `D' to indicate | |
3939 | destruction. */ | |
3940 | function_key = constructor_p ? 'I' : 'D'; | |
3941 | ||
3942 | /* We emit the function lazily, to avoid generating empty | |
3943 | global constructors and destructors. */ | |
3944 | body = NULL_TREE; | |
3945 | ||
3946 | /* For Objective-C++, we may need to initialize metadata found in this module. | |
3947 | This must be done _before_ any other static initializations. */ | |
3948 | if (c_dialect_objc () && (priority == DEFAULT_INIT_PRIORITY) | |
3949 | && constructor_p && objc_static_init_needed_p ()) | |
3950 | { | |
3951 | body = start_objects (function_key, priority); | |
3952 | objc_generate_static_init_call (NULL_TREE); | |
3953 | } | |
3954 | ||
3955 | /* Call the static storage duration function with appropriate | |
3956 | arguments. */ | |
3957 | FOR_EACH_VEC_SAFE_ELT (ssdf_decls, i, fndecl) | |
3958 | { | |
3959 | /* Calls to pure or const functions will expand to nothing. */ | |
3960 | if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE))) | |
3961 | { | |
3962 | tree call; | |
3963 | ||
3964 | if (! body) | |
3965 | body = start_objects (function_key, priority); | |
3966 | ||
3967 | call = cp_build_function_call_nary (fndecl, tf_warning_or_error, | |
3968 | build_int_cst (NULL_TREE, | |
3969 | constructor_p), | |
3970 | build_int_cst (NULL_TREE, | |
3971 | priority), | |
3972 | NULL_TREE); | |
3973 | finish_expr_stmt (call); | |
3974 | } | |
3975 | } | |
3976 | ||
3977 | /* Close out the function. */ | |
3978 | if (body) | |
3979 | finish_objects (function_key, priority, body); | |
3980 | } | |
3981 | ||
3982 | /* Generate constructor and destructor functions for the priority | |
3983 | indicated by N. */ | |
3984 | ||
3985 | static int | |
3986 | generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data) | |
3987 | { | |
3988 | location_t *locus = (location_t *) data; | |
3989 | int priority = (int) n->key; | |
3990 | priority_info pi = (priority_info) n->value; | |
3991 | ||
3992 | /* Generate the functions themselves, but only if they are really | |
3993 | needed. */ | |
3994 | if (pi->initializations_p) | |
3995 | generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus); | |
3996 | if (pi->destructions_p) | |
3997 | generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus); | |
3998 | ||
3999 | /* Keep iterating. */ | |
4000 | return 0; | |
4001 | } | |
4002 | ||
4003 | /* Java requires that we be able to reference a local address for a | |
4004 | method, and not be confused by PLT entries. If hidden aliases are | |
4005 | supported, collect and return all the functions for which we should | |
4006 | emit a hidden alias. */ | |
4007 | ||
4008 | static hash_set<tree> * | |
4009 | collect_candidates_for_java_method_aliases (void) | |
4010 | { | |
4011 | struct cgraph_node *node; | |
4012 | hash_set<tree> *candidates = NULL; | |
4013 | ||
4014 | #ifndef HAVE_GAS_HIDDEN | |
4015 | return candidates; | |
4016 | #endif | |
4017 | ||
4018 | FOR_EACH_FUNCTION (node) | |
4019 | { | |
4020 | tree fndecl = node->decl; | |
4021 | ||
4022 | if (DECL_CLASS_SCOPE_P (fndecl) | |
4023 | && TYPE_FOR_JAVA (DECL_CONTEXT (fndecl)) | |
4024 | && TARGET_USE_LOCAL_THUNK_ALIAS_P (fndecl)) | |
4025 | { | |
4026 | if (candidates == NULL) | |
4027 | candidates = new hash_set<tree>; | |
4028 | candidates->add (fndecl); | |
4029 | } | |
4030 | } | |
4031 | ||
4032 | return candidates; | |
4033 | } | |
4034 | ||
4035 | ||
4036 | /* Java requires that we be able to reference a local address for a | |
4037 | method, and not be confused by PLT entries. If hidden aliases are | |
4038 | supported, emit one for each java function that we've emitted. | |
4039 | CANDIDATES is the set of FUNCTION_DECLs that were gathered | |
4040 | by collect_candidates_for_java_method_aliases. */ | |
4041 | ||
4042 | static void | |
4043 | build_java_method_aliases (hash_set<tree> *candidates) | |
4044 | { | |
4045 | struct cgraph_node *node; | |
4046 | ||
4047 | #ifndef HAVE_GAS_HIDDEN | |
4048 | return; | |
4049 | #endif | |
4050 | ||
4051 | FOR_EACH_FUNCTION (node) | |
4052 | { | |
4053 | tree fndecl = node->decl; | |
4054 | ||
4055 | if (TREE_ASM_WRITTEN (fndecl) | |
4056 | && candidates->contains (fndecl)) | |
4057 | { | |
4058 | /* Mangle the name in a predictable way; we need to reference | |
4059 | this from a java compiled object file. */ | |
4060 | tree oid, nid, alias; | |
4061 | const char *oname; | |
4062 | char *nname; | |
4063 | ||
4064 | oid = DECL_ASSEMBLER_NAME (fndecl); | |
4065 | oname = IDENTIFIER_POINTER (oid); | |
4066 | gcc_assert (oname[0] == '_' && oname[1] == 'Z'); | |
4067 | nname = ACONCAT (("_ZGA", oname+2, NULL)); | |
4068 | nid = get_identifier (nname); | |
4069 | ||
4070 | alias = make_alias_for (fndecl, nid); | |
4071 | TREE_PUBLIC (alias) = 1; | |
4072 | DECL_VISIBILITY (alias) = VISIBILITY_HIDDEN; | |
4073 | ||
4074 | assemble_alias (alias, oid); | |
4075 | } | |
4076 | } | |
4077 | } | |
4078 | ||
4079 | /* Return C++ property of T, based on given operation OP. */ | |
4080 | ||
4081 | static int | |
4082 | cpp_check (tree t, cpp_operation op) | |
4083 | { | |
4084 | switch (op) | |
4085 | { | |
4086 | case IS_ABSTRACT: | |
4087 | return DECL_PURE_VIRTUAL_P (t); | |
4088 | case IS_CONSTRUCTOR: | |
4089 | return DECL_CONSTRUCTOR_P (t); | |
4090 | case IS_DESTRUCTOR: | |
4091 | return DECL_DESTRUCTOR_P (t); | |
4092 | case IS_COPY_CONSTRUCTOR: | |
4093 | return DECL_COPY_CONSTRUCTOR_P (t); | |
4094 | case IS_TEMPLATE: | |
4095 | return TREE_CODE (t) == TEMPLATE_DECL; | |
4096 | case IS_TRIVIAL: | |
4097 | return trivial_type_p (t); | |
4098 | default: | |
4099 | return 0; | |
4100 | } | |
4101 | } | |
4102 | ||
4103 | /* Collect source file references recursively, starting from NAMESPC. */ | |
4104 | ||
4105 | static void | |
4106 | collect_source_refs (tree namespc) | |
4107 | { | |
4108 | tree t; | |
4109 | ||
4110 | if (!namespc) | |
4111 | return; | |
4112 | ||
4113 | /* Iterate over names in this name space. */ | |
4114 | for (t = NAMESPACE_LEVEL (namespc)->names; t; t = TREE_CHAIN (t)) | |
4115 | if (!DECL_IS_BUILTIN (t) ) | |
4116 | collect_source_ref (DECL_SOURCE_FILE (t)); | |
4117 | ||
4118 | /* Dump siblings, if any */ | |
4119 | collect_source_refs (TREE_CHAIN (namespc)); | |
4120 | ||
4121 | /* Dump children, if any */ | |
4122 | collect_source_refs (NAMESPACE_LEVEL (namespc)->namespaces); | |
4123 | } | |
4124 | ||
4125 | /* Collect decls relevant to SOURCE_FILE from all namespaces recursively, | |
4126 | starting from NAMESPC. */ | |
4127 | ||
4128 | static void | |
4129 | collect_ada_namespace (tree namespc, const char *source_file) | |
4130 | { | |
4131 | if (!namespc) | |
4132 | return; | |
4133 | ||
4134 | /* Collect decls from this namespace */ | |
4135 | collect_ada_nodes (NAMESPACE_LEVEL (namespc)->names, source_file); | |
4136 | ||
4137 | /* Collect siblings, if any */ | |
4138 | collect_ada_namespace (TREE_CHAIN (namespc), source_file); | |
4139 | ||
4140 | /* Collect children, if any */ | |
4141 | collect_ada_namespace (NAMESPACE_LEVEL (namespc)->namespaces, source_file); | |
4142 | } | |
4143 | ||
4144 | /* Returns true iff there is a definition available for variable or | |
4145 | function DECL. */ | |
4146 | ||
4147 | static bool | |
4148 | decl_defined_p (tree decl) | |
4149 | { | |
4150 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
4151 | return (DECL_INITIAL (decl) != NULL_TREE); | |
4152 | else | |
4153 | { | |
4154 | gcc_assert (VAR_P (decl)); | |
4155 | return !DECL_EXTERNAL (decl); | |
4156 | } | |
4157 | } | |
4158 | ||
4159 | /* Nonzero for a VAR_DECL whose value can be used in a constant expression. | |
4160 | ||
4161 | [expr.const] | |
4162 | ||
4163 | An integral constant-expression can only involve ... const | |
4164 | variables of integral or enumeration types initialized with | |
4165 | constant expressions ... | |
4166 | ||
4167 | C++0x also allows constexpr variables and temporaries initialized | |
4168 | with constant expressions. We handle the former here, but the latter | |
4169 | are just folded away in cxx_eval_constant_expression. | |
4170 | ||
4171 | The standard does not require that the expression be non-volatile. | |
4172 | G++ implements the proposed correction in DR 457. */ | |
4173 | ||
4174 | bool | |
4175 | decl_constant_var_p (tree decl) | |
4176 | { | |
4177 | if (!decl_maybe_constant_var_p (decl)) | |
4178 | return false; | |
4179 | ||
4180 | /* We don't know if a template static data member is initialized with | |
4181 | a constant expression until we instantiate its initializer. Even | |
4182 | in the case of a constexpr variable, we can't treat it as a | |
4183 | constant until its initializer is complete in case it's used in | |
4184 | its own initializer. */ | |
4185 | mark_used (decl); | |
4186 | return DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl); | |
4187 | } | |
4188 | ||
4189 | /* Returns true if DECL could be a symbolic constant variable, depending on | |
4190 | its initializer. */ | |
4191 | ||
4192 | bool | |
4193 | decl_maybe_constant_var_p (tree decl) | |
4194 | { | |
4195 | tree type = TREE_TYPE (decl); | |
4196 | if (!VAR_P (decl)) | |
4197 | return false; | |
4198 | if (DECL_DECLARED_CONSTEXPR_P (decl)) | |
4199 | return true; | |
4200 | return (CP_TYPE_CONST_NON_VOLATILE_P (type) | |
4201 | && INTEGRAL_OR_ENUMERATION_TYPE_P (type)); | |
4202 | } | |
4203 | ||
4204 | /* Complain that DECL uses a type with no linkage. In C++98 mode this is | |
4205 | called from grokfndecl and grokvardecl; in all modes it is called from | |
4206 | cp_write_global_declarations. */ | |
4207 | ||
4208 | void | |
4209 | no_linkage_error (tree decl) | |
4210 | { | |
4211 | if (cxx_dialect >= cxx11 && decl_defined_p (decl)) | |
4212 | /* In C++11 it's ok if the decl is defined. */ | |
4213 | return; | |
4214 | tree t = no_linkage_check (TREE_TYPE (decl), /*relaxed_p=*/false); | |
4215 | if (t == NULL_TREE) | |
4216 | /* The type that got us on no_linkage_decls must have gotten a name for | |
4217 | linkage purposes. */; | |
4218 | else if (CLASS_TYPE_P (t) && TYPE_BEING_DEFINED (t)) | |
4219 | /* The type might end up having a typedef name for linkage purposes. */ | |
4220 | vec_safe_push (no_linkage_decls, decl); | |
4221 | else if (TYPE_ANONYMOUS_P (t)) | |
4222 | { | |
4223 | bool d = false; | |
4224 | if (cxx_dialect >= cxx11) | |
4225 | d = permerror (DECL_SOURCE_LOCATION (decl), "%q#D, declared using " | |
4226 | "anonymous type, is used but never defined", decl); | |
4227 | else if (DECL_EXTERN_C_P (decl)) | |
4228 | /* Allow this; it's pretty common in C. */; | |
4229 | else if (TREE_CODE (decl) == VAR_DECL) | |
4230 | /* DRs 132, 319 and 389 seem to indicate types with | |
4231 | no linkage can only be used to declare extern "C" | |
4232 | entities. Since it's not always an error in the | |
4233 | ISO C++ 90 Standard, we only issue a warning. */ | |
4234 | d = warning_at (DECL_SOURCE_LOCATION (decl), 0, "anonymous type " | |
4235 | "with no linkage used to declare variable %q#D with " | |
4236 | "linkage", decl); | |
4237 | else | |
4238 | d = permerror (DECL_SOURCE_LOCATION (decl), "anonymous type with no " | |
4239 | "linkage used to declare function %q#D with linkage", | |
4240 | decl); | |
4241 | if (d && is_typedef_decl (TYPE_NAME (t))) | |
4242 | inform (DECL_SOURCE_LOCATION (TYPE_NAME (t)), "%q#D does not refer " | |
4243 | "to the unqualified type, so it is not used for linkage", | |
4244 | TYPE_NAME (t)); | |
4245 | } | |
4246 | else if (cxx_dialect >= cxx11) | |
7d4d0543 JM |
4247 | { |
4248 | if (TREE_CODE (decl) == VAR_DECL || !DECL_PURE_VIRTUAL_P (decl)) | |
4249 | permerror (DECL_SOURCE_LOCATION (decl), | |
4250 | "%q#D, declared using local type " | |
4251 | "%qT, is used but never defined", decl, t); | |
4252 | } | |
dda118e3 JM |
4253 | else if (TREE_CODE (decl) == VAR_DECL) |
4254 | warning_at (DECL_SOURCE_LOCATION (decl), 0, "type %qT with no linkage " | |
4255 | "used to declare variable %q#D with linkage", t, decl); | |
4256 | else | |
4257 | permerror (DECL_SOURCE_LOCATION (decl), "type %qT with no linkage used " | |
4258 | "to declare function %q#D with linkage", t, decl); | |
4259 | } | |
4260 | ||
4261 | /* Collect declarations from all namespaces relevant to SOURCE_FILE. */ | |
4262 | ||
4263 | static void | |
4264 | collect_all_refs (const char *source_file) | |
4265 | { | |
4266 | collect_ada_namespace (global_namespace, source_file); | |
4267 | } | |
4268 | ||
4269 | /* Clear DECL_EXTERNAL for NODE. */ | |
4270 | ||
4271 | static bool | |
4272 | clear_decl_external (struct cgraph_node *node, void * /*data*/) | |
4273 | { | |
4274 | DECL_EXTERNAL (node->decl) = 0; | |
4275 | return false; | |
4276 | } | |
4277 | ||
4278 | /* Build up the function to run dynamic initializers for thread_local | |
4279 | variables in this translation unit and alias the init functions for the | |
4280 | individual variables to it. */ | |
4281 | ||
4282 | static void | |
4283 | handle_tls_init (void) | |
4284 | { | |
4285 | tree vars = prune_vars_needing_no_initialization (&tls_aggregates); | |
4286 | if (vars == NULL_TREE) | |
4287 | return; | |
4288 | ||
4289 | location_t loc = DECL_SOURCE_LOCATION (TREE_VALUE (vars)); | |
4290 | ||
4291 | write_out_vars (vars); | |
4292 | ||
4293 | tree guard = build_decl (loc, VAR_DECL, get_identifier ("__tls_guard"), | |
4294 | boolean_type_node); | |
4295 | TREE_PUBLIC (guard) = false; | |
4296 | TREE_STATIC (guard) = true; | |
4297 | DECL_ARTIFICIAL (guard) = true; | |
4298 | DECL_IGNORED_P (guard) = true; | |
4299 | TREE_USED (guard) = true; | |
4300 | set_decl_tls_model (guard, decl_default_tls_model (guard)); | |
4301 | pushdecl_top_level_and_finish (guard, NULL_TREE); | |
4302 | ||
4303 | tree fn = get_local_tls_init_fn (); | |
4304 | start_preparsed_function (fn, NULL_TREE, SF_PRE_PARSED); | |
4305 | tree body = begin_function_body (); | |
4306 | tree if_stmt = begin_if_stmt (); | |
4307 | tree cond = cp_build_unary_op (TRUTH_NOT_EXPR, guard, false, | |
4308 | tf_warning_or_error); | |
4309 | finish_if_stmt_cond (cond, if_stmt); | |
4310 | finish_expr_stmt (cp_build_modify_expr (guard, NOP_EXPR, boolean_true_node, | |
4311 | tf_warning_or_error)); | |
4312 | for (; vars; vars = TREE_CHAIN (vars)) | |
4313 | { | |
4314 | tree var = TREE_VALUE (vars); | |
4315 | tree init = TREE_PURPOSE (vars); | |
4316 | one_static_initialization_or_destruction (var, init, true); | |
4317 | ||
4318 | #ifdef ASM_OUTPUT_DEF | |
4319 | /* Output init aliases even with -fno-extern-tls-init. */ | |
4320 | if (TREE_PUBLIC (var)) | |
4321 | { | |
4322 | tree single_init_fn = get_tls_init_fn (var); | |
4323 | if (single_init_fn == NULL_TREE) | |
4324 | continue; | |
4325 | cgraph_node *alias | |
4326 | = cgraph_node::get_create (fn)->create_same_body_alias | |
4327 | (single_init_fn, fn); | |
4328 | gcc_assert (alias != NULL); | |
4329 | } | |
4330 | #endif | |
4331 | } | |
4332 | ||
4333 | finish_then_clause (if_stmt); | |
4334 | finish_if_stmt (if_stmt); | |
4335 | finish_function_body (body); | |
4336 | expand_or_defer_fn (finish_function (0)); | |
4337 | } | |
4338 | ||
7d4d0543 JM |
4339 | /* We're at the end of compilation, so generate any mangling aliases that |
4340 | we've been saving up, if DECL is going to be output and ID2 isn't | |
4341 | already taken by another declaration. */ | |
4342 | ||
4343 | static void | |
4344 | generate_mangling_alias (tree decl, tree id2) | |
4345 | { | |
4346 | /* If there's a declaration already using this mangled name, | |
4347 | don't create a compatibility alias that conflicts. */ | |
4348 | if (IDENTIFIER_GLOBAL_VALUE (id2)) | |
4349 | return; | |
4350 | ||
4351 | struct cgraph_node *n = NULL; | |
4352 | if (TREE_CODE (decl) == FUNCTION_DECL | |
4353 | && !(n = cgraph_node::get (decl))) | |
4354 | /* Don't create an alias to an unreferenced function. */ | |
4355 | return; | |
4356 | ||
4357 | tree alias = make_alias_for (decl, id2); | |
4358 | SET_IDENTIFIER_GLOBAL_VALUE (id2, alias); | |
4359 | DECL_IGNORED_P (alias) = 1; | |
4360 | TREE_PUBLIC (alias) = TREE_PUBLIC (decl); | |
4361 | DECL_VISIBILITY (alias) = DECL_VISIBILITY (decl); | |
4362 | if (vague_linkage_p (decl)) | |
4363 | DECL_WEAK (alias) = 1; | |
4364 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
4365 | n->create_same_body_alias (alias, decl); | |
4366 | else | |
4367 | varpool_node::create_extra_name_alias (alias, decl); | |
4368 | } | |
4369 | ||
4370 | /* Note that we might want to emit an alias with the symbol ID2 for DECL at | |
4371 | the end of translation, for compatibility across bugs in the mangling | |
4372 | implementation. */ | |
4373 | ||
4374 | void | |
4375 | note_mangling_alias (tree decl ATTRIBUTE_UNUSED, tree id2 ATTRIBUTE_UNUSED) | |
4376 | { | |
4377 | #ifdef ASM_OUTPUT_DEF | |
4378 | if (!defer_mangling_aliases) | |
4379 | generate_mangling_alias (decl, id2); | |
4380 | else | |
4381 | { | |
4382 | vec_safe_push (mangling_aliases, decl); | |
4383 | vec_safe_push (mangling_aliases, id2); | |
4384 | } | |
4385 | #endif | |
4386 | } | |
4387 | ||
4388 | /* Emit all mangling aliases that were deferred up to this point. */ | |
4389 | ||
4390 | void | |
4391 | generate_mangling_aliases () | |
4392 | { | |
4393 | while (!vec_safe_is_empty (mangling_aliases)) | |
4394 | { | |
4395 | tree id2 = mangling_aliases->pop(); | |
4396 | tree decl = mangling_aliases->pop(); | |
4397 | generate_mangling_alias (decl, id2); | |
4398 | } | |
4399 | defer_mangling_aliases = false; | |
4400 | } | |
4401 | ||
dda118e3 JM |
4402 | /* The entire file is now complete. If requested, dump everything |
4403 | to a file. */ | |
4404 | ||
4405 | static void | |
4406 | dump_tu (void) | |
4407 | { | |
4408 | int flags; | |
4409 | FILE *stream = dump_begin (TDI_tu, &flags); | |
4410 | ||
4411 | if (stream) | |
4412 | { | |
4413 | dump_node (global_namespace, flags & ~TDF_SLIM, stream); | |
4414 | dump_end (TDI_tu, stream); | |
4415 | } | |
4416 | } | |
4417 | ||
4418 | /* Check the deallocation functions for CODE to see if we want to warn that | |
4419 | only one was defined. */ | |
4420 | ||
4421 | static void | |
4422 | maybe_warn_sized_delete (enum tree_code code) | |
4423 | { | |
4424 | tree sized = NULL_TREE; | |
4425 | tree unsized = NULL_TREE; | |
4426 | ||
4427 | for (tree ovl = IDENTIFIER_GLOBAL_VALUE (ansi_opname (code)); | |
4428 | ovl; ovl = OVL_NEXT (ovl)) | |
4429 | { | |
4430 | tree fn = OVL_CURRENT (ovl); | |
4431 | /* We're only interested in usual deallocation functions. */ | |
4432 | if (!non_placement_deallocation_fn_p (fn)) | |
4433 | continue; | |
4434 | if (FUNCTION_ARG_CHAIN (fn) == void_list_node) | |
4435 | unsized = fn; | |
4436 | else | |
4437 | sized = fn; | |
4438 | } | |
4439 | if (DECL_INITIAL (unsized) && !DECL_INITIAL (sized)) | |
4440 | warning_at (DECL_SOURCE_LOCATION (unsized), OPT_Wsized_deallocation, | |
4441 | "the program should also define %qD", sized); | |
4442 | else if (!DECL_INITIAL (unsized) && DECL_INITIAL (sized)) | |
4443 | warning_at (DECL_SOURCE_LOCATION (sized), OPT_Wsized_deallocation, | |
4444 | "the program should also define %qD", unsized); | |
4445 | } | |
4446 | ||
4447 | /* Check the global deallocation functions to see if we want to warn about | |
4448 | defining unsized without sized (or vice versa). */ | |
4449 | ||
4450 | static void | |
4451 | maybe_warn_sized_delete () | |
4452 | { | |
4453 | if (!flag_sized_deallocation || !warn_sized_deallocation) | |
4454 | return; | |
4455 | maybe_warn_sized_delete (DELETE_EXPR); | |
4456 | maybe_warn_sized_delete (VEC_DELETE_EXPR); | |
4457 | } | |
4458 | ||
4459 | /* This routine is called at the end of compilation. | |
4460 | Its job is to create all the code needed to initialize and | |
4461 | destroy the global aggregates. We do the destruction | |
4462 | first, since that way we only need to reverse the decls once. */ | |
4463 | ||
4464 | void | |
4465 | cp_write_global_declarations (void) | |
4466 | { | |
4467 | tree vars; | |
4468 | bool reconsider; | |
4469 | size_t i; | |
4470 | location_t locus; | |
4471 | unsigned ssdf_count = 0; | |
4472 | int retries = 0; | |
4473 | tree decl; | |
4474 | hash_set<tree> *candidates; | |
4475 | ||
4476 | locus = input_location; | |
4477 | at_eof = 1; | |
4478 | ||
4479 | /* Bad parse errors. Just forget about it. */ | |
4480 | if (! global_bindings_p () || current_class_type | |
4481 | || !vec_safe_is_empty (decl_namespace_list)) | |
4482 | return; | |
4483 | ||
4484 | /* This is the point to write out a PCH if we're doing that. | |
4485 | In that case we do not want to do anything else. */ | |
4486 | if (pch_file) | |
4487 | { | |
4488 | c_common_write_pch (); | |
4489 | dump_tu (); | |
4490 | return; | |
4491 | } | |
4492 | ||
4493 | symtab->process_same_body_aliases (); | |
4494 | ||
4495 | /* Handle -fdump-ada-spec[-slim] */ | |
4496 | if (flag_dump_ada_spec || flag_dump_ada_spec_slim) | |
4497 | { | |
4498 | if (flag_dump_ada_spec_slim) | |
4499 | collect_source_ref (main_input_filename); | |
4500 | else | |
4501 | collect_source_refs (global_namespace); | |
4502 | ||
4503 | dump_ada_specs (collect_all_refs, cpp_check); | |
4504 | } | |
4505 | ||
4506 | /* FIXME - huh? was input_line -= 1;*/ | |
4507 | ||
4508 | timevar_start (TV_PHASE_DEFERRED); | |
4509 | ||
4510 | /* We now have to write out all the stuff we put off writing out. | |
4511 | These include: | |
4512 | ||
4513 | o Template specializations that we have not yet instantiated, | |
4514 | but which are needed. | |
4515 | o Initialization and destruction for non-local objects with | |
4516 | static storage duration. (Local objects with static storage | |
4517 | duration are initialized when their scope is first entered, | |
4518 | and are cleaned up via atexit.) | |
4519 | o Virtual function tables. | |
4520 | ||
4521 | All of these may cause others to be needed. For example, | |
4522 | instantiating one function may cause another to be needed, and | |
4523 | generating the initializer for an object may cause templates to be | |
4524 | instantiated, etc., etc. */ | |
4525 | ||
4526 | emit_support_tinfos (); | |
4527 | ||
4528 | do | |
4529 | { | |
4530 | tree t; | |
4531 | tree decl; | |
4532 | ||
4533 | reconsider = false; | |
4534 | ||
4535 | /* If there are templates that we've put off instantiating, do | |
4536 | them now. */ | |
4537 | instantiate_pending_templates (retries); | |
4538 | ggc_collect (); | |
4539 | ||
4540 | /* Write out virtual tables as required. Note that writing out | |
4541 | the virtual table for a template class may cause the | |
4542 | instantiation of members of that class. If we write out | |
4543 | vtables then we remove the class from our list so we don't | |
4544 | have to look at it again. */ | |
4545 | ||
4546 | while (keyed_classes != NULL_TREE | |
4547 | && maybe_emit_vtables (TREE_VALUE (keyed_classes))) | |
4548 | { | |
4549 | reconsider = true; | |
4550 | keyed_classes = TREE_CHAIN (keyed_classes); | |
4551 | } | |
4552 | ||
4553 | t = keyed_classes; | |
4554 | if (t != NULL_TREE) | |
4555 | { | |
4556 | tree next = TREE_CHAIN (t); | |
4557 | ||
4558 | while (next) | |
4559 | { | |
4560 | if (maybe_emit_vtables (TREE_VALUE (next))) | |
4561 | { | |
4562 | reconsider = true; | |
4563 | TREE_CHAIN (t) = TREE_CHAIN (next); | |
4564 | } | |
4565 | else | |
4566 | t = next; | |
4567 | ||
4568 | next = TREE_CHAIN (t); | |
4569 | } | |
4570 | } | |
4571 | ||
4572 | /* Write out needed type info variables. We have to be careful | |
4573 | looping through unemitted decls, because emit_tinfo_decl may | |
4574 | cause other variables to be needed. New elements will be | |
4575 | appended, and we remove from the vector those that actually | |
4576 | get emitted. */ | |
4577 | for (i = unemitted_tinfo_decls->length (); | |
4578 | unemitted_tinfo_decls->iterate (--i, &t);) | |
4579 | if (emit_tinfo_decl (t)) | |
4580 | { | |
4581 | reconsider = true; | |
4582 | unemitted_tinfo_decls->unordered_remove (i); | |
4583 | } | |
4584 | ||
4585 | /* The list of objects with static storage duration is built up | |
4586 | in reverse order. We clear STATIC_AGGREGATES so that any new | |
4587 | aggregates added during the initialization of these will be | |
4588 | initialized in the correct order when we next come around the | |
4589 | loop. */ | |
4590 | vars = prune_vars_needing_no_initialization (&static_aggregates); | |
4591 | ||
4592 | if (vars) | |
4593 | { | |
4594 | /* We need to start a new initialization function each time | |
4595 | through the loop. That's because we need to know which | |
4596 | vtables have been referenced, and TREE_SYMBOL_REFERENCED | |
4597 | isn't computed until a function is finished, and written | |
4598 | out. That's a deficiency in the back end. When this is | |
4599 | fixed, these initialization functions could all become | |
4600 | inline, with resulting performance improvements. */ | |
4601 | tree ssdf_body; | |
4602 | ||
4603 | /* Set the line and file, so that it is obviously not from | |
4604 | the source file. */ | |
4605 | input_location = locus; | |
4606 | ssdf_body = start_static_storage_duration_function (ssdf_count); | |
4607 | ||
4608 | /* Make sure the back end knows about all the variables. */ | |
4609 | write_out_vars (vars); | |
4610 | ||
4611 | /* First generate code to do all the initializations. */ | |
4612 | if (vars) | |
4613 | do_static_initialization_or_destruction (vars, /*initp=*/true); | |
4614 | ||
4615 | /* Then, generate code to do all the destructions. Do these | |
4616 | in reverse order so that the most recently constructed | |
4617 | variable is the first destroyed. If we're using | |
4618 | __cxa_atexit, then we don't need to do this; functions | |
4619 | were registered at initialization time to destroy the | |
4620 | local statics. */ | |
4621 | if (!flag_use_cxa_atexit && vars) | |
4622 | { | |
4623 | vars = nreverse (vars); | |
4624 | do_static_initialization_or_destruction (vars, /*initp=*/false); | |
4625 | } | |
4626 | else | |
4627 | vars = NULL_TREE; | |
4628 | ||
4629 | /* Finish up the static storage duration function for this | |
4630 | round. */ | |
4631 | input_location = locus; | |
4632 | finish_static_storage_duration_function (ssdf_body); | |
4633 | ||
4634 | /* All those initializations and finalizations might cause | |
4635 | us to need more inline functions, more template | |
4636 | instantiations, etc. */ | |
4637 | reconsider = true; | |
4638 | ssdf_count++; | |
4639 | /* ??? was: locus.line++; */ | |
4640 | } | |
4641 | ||
4642 | /* Now do the same for thread_local variables. */ | |
4643 | handle_tls_init (); | |
4644 | ||
4645 | /* Go through the set of inline functions whose bodies have not | |
4646 | been emitted yet. If out-of-line copies of these functions | |
4647 | are required, emit them. */ | |
4648 | FOR_EACH_VEC_SAFE_ELT (deferred_fns, i, decl) | |
4649 | { | |
4650 | /* Does it need synthesizing? */ | |
4651 | if (DECL_DEFAULTED_FN (decl) && ! DECL_INITIAL (decl) | |
4652 | && (! DECL_REALLY_EXTERN (decl) || possibly_inlined_p (decl))) | |
4653 | { | |
4654 | /* Even though we're already at the top-level, we push | |
4655 | there again. That way, when we pop back a few lines | |
4656 | hence, all of our state is restored. Otherwise, | |
4657 | finish_function doesn't clean things up, and we end | |
4658 | up with CURRENT_FUNCTION_DECL set. */ | |
4659 | push_to_top_level (); | |
4660 | /* The decl's location will mark where it was first | |
4661 | needed. Save that so synthesize method can indicate | |
4662 | where it was needed from, in case of error */ | |
4663 | input_location = DECL_SOURCE_LOCATION (decl); | |
4664 | synthesize_method (decl); | |
4665 | pop_from_top_level (); | |
4666 | reconsider = true; | |
4667 | } | |
4668 | ||
4669 | if (!DECL_INITIAL (decl) && decl_tls_wrapper_p (decl)) | |
4670 | generate_tls_wrapper (decl); | |
4671 | ||
4672 | if (!DECL_SAVED_TREE (decl)) | |
4673 | continue; | |
4674 | ||
4675 | /* We lie to the back end, pretending that some functions | |
4676 | are not defined when they really are. This keeps these | |
4677 | functions from being put out unnecessarily. But, we must | |
4678 | stop lying when the functions are referenced, or if they | |
4679 | are not comdat since they need to be put out now. If | |
4680 | DECL_INTERFACE_KNOWN, then we have already set | |
4681 | DECL_EXTERNAL appropriately, so there's no need to check | |
4682 | again, and we do not want to clear DECL_EXTERNAL if a | |
4683 | previous call to import_export_decl set it. | |
4684 | ||
4685 | This is done in a separate for cycle, because if some | |
4686 | deferred function is contained in another deferred | |
4687 | function later in deferred_fns varray, | |
4688 | rest_of_compilation would skip this function and we | |
4689 | really cannot expand the same function twice. */ | |
4690 | import_export_decl (decl); | |
4691 | if (DECL_NOT_REALLY_EXTERN (decl) | |
4692 | && DECL_INITIAL (decl) | |
4693 | && decl_needed_p (decl)) | |
4694 | { | |
4695 | struct cgraph_node *node, *next; | |
4696 | ||
4697 | node = cgraph_node::get (decl); | |
4698 | if (node->cpp_implicit_alias) | |
4699 | node = node->get_alias_target (); | |
4700 | ||
4701 | node->call_for_symbol_thunks_and_aliases (clear_decl_external, | |
4702 | NULL, true); | |
4703 | /* If we mark !DECL_EXTERNAL one of the symbols in some comdat | |
4704 | group, we need to mark all symbols in the same comdat group | |
4705 | that way. */ | |
4706 | if (node->same_comdat_group) | |
4707 | for (next = dyn_cast<cgraph_node *> (node->same_comdat_group); | |
4708 | next != node; | |
4709 | next = dyn_cast<cgraph_node *> (next->same_comdat_group)) | |
4710 | next->call_for_symbol_thunks_and_aliases (clear_decl_external, | |
4711 | NULL, true); | |
4712 | } | |
4713 | ||
4714 | /* If we're going to need to write this function out, and | |
4715 | there's already a body for it, create RTL for it now. | |
4716 | (There might be no body if this is a method we haven't | |
4717 | gotten around to synthesizing yet.) */ | |
4718 | if (!DECL_EXTERNAL (decl) | |
4719 | && decl_needed_p (decl) | |
4720 | && !TREE_ASM_WRITTEN (decl) | |
4721 | && !cgraph_node::get (decl)->definition) | |
4722 | { | |
4723 | /* We will output the function; no longer consider it in this | |
4724 | loop. */ | |
4725 | DECL_DEFER_OUTPUT (decl) = 0; | |
4726 | /* Generate RTL for this function now that we know we | |
4727 | need it. */ | |
4728 | expand_or_defer_fn (decl); | |
4729 | /* If we're compiling -fsyntax-only pretend that this | |
4730 | function has been written out so that we don't try to | |
4731 | expand it again. */ | |
4732 | if (flag_syntax_only) | |
4733 | TREE_ASM_WRITTEN (decl) = 1; | |
4734 | reconsider = true; | |
4735 | } | |
4736 | } | |
4737 | ||
4738 | if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0)) | |
4739 | reconsider = true; | |
4740 | ||
4741 | /* Static data members are just like namespace-scope globals. */ | |
4742 | FOR_EACH_VEC_SAFE_ELT (pending_statics, i, decl) | |
4743 | { | |
4744 | if (var_finalized_p (decl) || DECL_REALLY_EXTERN (decl) | |
4745 | /* Don't write it out if we haven't seen a definition. */ | |
4746 | || DECL_IN_AGGR_P (decl)) | |
4747 | continue; | |
4748 | import_export_decl (decl); | |
4749 | /* If this static data member is needed, provide it to the | |
4750 | back end. */ | |
4751 | if (DECL_NOT_REALLY_EXTERN (decl) && decl_needed_p (decl)) | |
4752 | DECL_EXTERNAL (decl) = 0; | |
4753 | } | |
4754 | if (vec_safe_length (pending_statics) != 0 | |
4755 | && wrapup_global_declarations (pending_statics->address (), | |
4756 | pending_statics->length ())) | |
4757 | reconsider = true; | |
4758 | ||
4759 | retries++; | |
4760 | } | |
4761 | while (reconsider); | |
4762 | ||
7d4d0543 JM |
4763 | generate_mangling_aliases (); |
4764 | ||
dda118e3 JM |
4765 | /* All used inline functions must have a definition at this point. */ |
4766 | FOR_EACH_VEC_SAFE_ELT (deferred_fns, i, decl) | |
4767 | { | |
4768 | if (/* Check online inline functions that were actually used. */ | |
4769 | DECL_ODR_USED (decl) && DECL_DECLARED_INLINE_P (decl) | |
4770 | /* If the definition actually was available here, then the | |
4771 | fact that the function was not defined merely represents | |
4772 | that for some reason (use of a template repository, | |
4773 | #pragma interface, etc.) we decided not to emit the | |
4774 | definition here. */ | |
4775 | && !DECL_INITIAL (decl) | |
4776 | /* Don't complain if the template was defined. */ | |
4777 | && !(DECL_TEMPLATE_INSTANTIATION (decl) | |
4778 | && DECL_INITIAL (DECL_TEMPLATE_RESULT | |
4779 | (template_for_substitution (decl))))) | |
4780 | { | |
4781 | warning (0, "inline function %q+D used but never defined", decl); | |
4782 | /* Avoid a duplicate warning from check_global_declaration_1. */ | |
4783 | TREE_NO_WARNING (decl) = 1; | |
4784 | } | |
4785 | } | |
4786 | ||
4787 | /* So must decls that use a type with no linkage. */ | |
4788 | FOR_EACH_VEC_SAFE_ELT (no_linkage_decls, i, decl) | |
4789 | no_linkage_error (decl); | |
4790 | ||
4791 | maybe_warn_sized_delete (); | |
4792 | ||
4793 | /* Then, do the Objective-C stuff. This is where all the | |
4794 | Objective-C module stuff gets generated (symtab, | |
4795 | class/protocol/selector lists etc). This must be done after C++ | |
4796 | templates, destructors etc. so that selectors used in C++ | |
4797 | templates are properly allocated. */ | |
4798 | if (c_dialect_objc ()) | |
4799 | objc_write_global_declarations (); | |
4800 | ||
4801 | /* We give C linkage to static constructors and destructors. */ | |
4802 | push_lang_context (lang_name_c); | |
4803 | ||
4804 | /* Generate initialization and destruction functions for all | |
4805 | priorities for which they are required. */ | |
4806 | if (priority_info_map) | |
4807 | splay_tree_foreach (priority_info_map, | |
4808 | generate_ctor_and_dtor_functions_for_priority, | |
4809 | /*data=*/&locus); | |
4810 | else if (c_dialect_objc () && objc_static_init_needed_p ()) | |
4811 | /* If this is obj-c++ and we need a static init, call | |
4812 | generate_ctor_or_dtor_function. */ | |
4813 | generate_ctor_or_dtor_function (/*constructor_p=*/true, | |
4814 | DEFAULT_INIT_PRIORITY, &locus); | |
4815 | ||
4816 | /* We're done with the splay-tree now. */ | |
4817 | if (priority_info_map) | |
4818 | splay_tree_delete (priority_info_map); | |
4819 | ||
4820 | /* Generate any missing aliases. */ | |
4821 | maybe_apply_pending_pragma_weaks (); | |
4822 | ||
4823 | /* We're done with static constructors, so we can go back to "C++" | |
4824 | linkage now. */ | |
4825 | pop_lang_context (); | |
4826 | ||
4827 | /* Collect candidates for Java hidden aliases. */ | |
4828 | candidates = collect_candidates_for_java_method_aliases (); | |
4829 | ||
4830 | timevar_stop (TV_PHASE_DEFERRED); | |
4831 | timevar_start (TV_PHASE_OPT_GEN); | |
4832 | ||
4833 | if (flag_vtable_verify) | |
4834 | { | |
4835 | vtv_recover_class_info (); | |
4836 | vtv_compute_class_hierarchy_transitive_closure (); | |
4837 | vtv_build_vtable_verify_fndecl (); | |
4838 | } | |
4839 | ||
4840 | symtab->finalize_compilation_unit (); | |
4841 | ||
4842 | if (flag_vtable_verify) | |
4843 | { | |
4844 | /* Generate the special constructor initialization function that | |
4845 | calls __VLTRegisterPairs, and give it a very high | |
4846 | initialization priority. This must be done after | |
4847 | finalize_compilation_unit so that we have accurate | |
4848 | information about which vtable will actually be emitted. */ | |
4849 | vtv_generate_init_routine (); | |
4850 | } | |
4851 | ||
4852 | timevar_stop (TV_PHASE_OPT_GEN); | |
4853 | timevar_start (TV_PHASE_CHECK_DBGINFO); | |
4854 | ||
4855 | /* Now, issue warnings about static, but not defined, functions, | |
4856 | etc., and emit debugging information. */ | |
4857 | walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider); | |
4858 | if (vec_safe_length (pending_statics) != 0) | |
4859 | { | |
4860 | check_global_declarations (pending_statics->address (), | |
4861 | pending_statics->length ()); | |
4862 | emit_debug_global_declarations (pending_statics->address (), | |
4863 | pending_statics->length ()); | |
4864 | } | |
4865 | ||
4866 | perform_deferred_noexcept_checks (); | |
4867 | ||
4868 | /* Generate hidden aliases for Java. */ | |
4869 | if (candidates) | |
4870 | { | |
4871 | build_java_method_aliases (candidates); | |
4872 | delete candidates; | |
4873 | } | |
4874 | ||
4875 | finish_repo (); | |
4876 | ||
4877 | /* The entire file is now complete. If requested, dump everything | |
4878 | to a file. */ | |
4879 | dump_tu (); | |
4880 | ||
4881 | if (flag_detailed_statistics) | |
4882 | { | |
4883 | dump_tree_statistics (); | |
4884 | dump_time_statistics (); | |
4885 | } | |
4886 | input_location = locus; | |
4887 | ||
4888 | #ifdef ENABLE_CHECKING | |
4889 | validate_conversion_obstack (); | |
4890 | #endif /* ENABLE_CHECKING */ | |
4891 | ||
4892 | timevar_stop (TV_PHASE_CHECK_DBGINFO); | |
4893 | } | |
4894 | ||
4895 | /* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the | |
4896 | function to call in parse-tree form; it has not yet been | |
4897 | semantically analyzed. ARGS are the arguments to the function. | |
4898 | They have already been semantically analyzed. This may change | |
4899 | ARGS. */ | |
4900 | ||
4901 | tree | |
4902 | build_offset_ref_call_from_tree (tree fn, vec<tree, va_gc> **args, | |
4903 | tsubst_flags_t complain) | |
4904 | { | |
4905 | tree orig_fn; | |
4906 | vec<tree, va_gc> *orig_args = NULL; | |
4907 | tree expr; | |
4908 | tree object; | |
4909 | ||
4910 | orig_fn = fn; | |
4911 | object = TREE_OPERAND (fn, 0); | |
4912 | ||
4913 | if (processing_template_decl) | |
4914 | { | |
4915 | gcc_assert (TREE_CODE (fn) == DOTSTAR_EXPR | |
4916 | || TREE_CODE (fn) == MEMBER_REF); | |
4917 | if (type_dependent_expression_p (fn) | |
4918 | || any_type_dependent_arguments_p (*args)) | |
4919 | return build_nt_call_vec (fn, *args); | |
4920 | ||
4921 | orig_args = make_tree_vector_copy (*args); | |
4922 | ||
4923 | /* Transform the arguments and add the implicit "this" | |
4924 | parameter. That must be done before the FN is transformed | |
4925 | because we depend on the form of FN. */ | |
4926 | make_args_non_dependent (*args); | |
4927 | object = build_non_dependent_expr (object); | |
4928 | if (TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE) | |
4929 | { | |
4930 | if (TREE_CODE (fn) == DOTSTAR_EXPR) | |
4931 | object = cp_build_addr_expr (object, complain); | |
4932 | vec_safe_insert (*args, 0, object); | |
4933 | } | |
4934 | /* Now that the arguments are done, transform FN. */ | |
4935 | fn = build_non_dependent_expr (fn); | |
4936 | } | |
4937 | ||
4938 | /* A qualified name corresponding to a bound pointer-to-member is | |
4939 | represented as an OFFSET_REF: | |
4940 | ||
4941 | struct B { void g(); }; | |
4942 | void (B::*p)(); | |
4943 | void B::g() { (this->*p)(); } */ | |
4944 | if (TREE_CODE (fn) == OFFSET_REF) | |
4945 | { | |
4946 | tree object_addr = cp_build_addr_expr (object, complain); | |
4947 | fn = TREE_OPERAND (fn, 1); | |
4948 | fn = get_member_function_from_ptrfunc (&object_addr, fn, | |
4949 | complain); | |
4950 | vec_safe_insert (*args, 0, object_addr); | |
4951 | } | |
4952 | ||
4953 | if (CLASS_TYPE_P (TREE_TYPE (fn))) | |
4954 | expr = build_op_call (fn, args, complain); | |
4955 | else | |
4956 | expr = cp_build_function_call_vec (fn, args, complain); | |
4957 | if (processing_template_decl && expr != error_mark_node) | |
4958 | expr = build_min_non_dep_call_vec (expr, orig_fn, orig_args); | |
4959 | ||
4960 | if (orig_args != NULL) | |
4961 | release_tree_vector (orig_args); | |
4962 | ||
4963 | return expr; | |
4964 | } | |
4965 | ||
4966 | ||
4967 | void | |
4968 | check_default_args (tree x) | |
4969 | { | |
4970 | tree arg = TYPE_ARG_TYPES (TREE_TYPE (x)); | |
4971 | bool saw_def = false; | |
4972 | int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE); | |
4973 | for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i) | |
4974 | { | |
4975 | if (TREE_PURPOSE (arg)) | |
4976 | saw_def = true; | |
4977 | else if (saw_def && !PACK_EXPANSION_P (TREE_VALUE (arg))) | |
4978 | { | |
4979 | error ("default argument missing for parameter %P of %q+#D", i, x); | |
4980 | TREE_PURPOSE (arg) = error_mark_node; | |
4981 | } | |
4982 | } | |
4983 | } | |
4984 | ||
4985 | /* Return true if function DECL can be inlined. This is used to force | |
4986 | instantiation of methods that might be interesting for inlining. */ | |
4987 | bool | |
4988 | possibly_inlined_p (tree decl) | |
4989 | { | |
4990 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); | |
4991 | if (DECL_UNINLINABLE (decl)) | |
4992 | return false; | |
4993 | if (!optimize || pragma_java_exceptions) | |
4994 | return DECL_DECLARED_INLINE_P (decl); | |
4995 | /* When optimizing, we might inline everything when flatten | |
4996 | attribute or heuristics inlining for size or autoinlining | |
4997 | is used. */ | |
4998 | return true; | |
4999 | } | |
5000 | ||
5001 | /* Mark DECL (either a _DECL or a BASELINK) as "used" in the program. | |
5002 | If DECL is a specialization or implicitly declared class member, | |
5003 | generate the actual definition. Return false if something goes | |
5004 | wrong, true otherwise. */ | |
5005 | ||
5006 | bool | |
5007 | mark_used (tree decl, tsubst_flags_t complain) | |
5008 | { | |
5009 | /* If DECL is a BASELINK for a single function, then treat it just | |
5010 | like the DECL for the function. Otherwise, if the BASELINK is | |
5011 | for an overloaded function, we don't know which function was | |
5012 | actually used until after overload resolution. */ | |
5013 | if (BASELINK_P (decl)) | |
5014 | { | |
5015 | decl = BASELINK_FUNCTIONS (decl); | |
5016 | if (really_overloaded_fn (decl)) | |
5017 | return true; | |
5018 | decl = OVL_CURRENT (decl); | |
5019 | } | |
5020 | ||
5021 | /* Set TREE_USED for the benefit of -Wunused. */ | |
5022 | TREE_USED (decl) = 1; | |
5023 | if (DECL_CLONED_FUNCTION_P (decl)) | |
5024 | TREE_USED (DECL_CLONED_FUNCTION (decl)) = 1; | |
5025 | ||
5026 | /* Mark enumeration types as used. */ | |
5027 | if (TREE_CODE (decl) == CONST_DECL) | |
5028 | used_types_insert (DECL_CONTEXT (decl)); | |
5029 | ||
5030 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
5031 | maybe_instantiate_noexcept (decl); | |
5032 | ||
5033 | if (TREE_CODE (decl) == FUNCTION_DECL | |
5034 | && DECL_DELETED_FN (decl)) | |
5035 | { | |
5036 | if (DECL_ARTIFICIAL (decl)) | |
5037 | { | |
5038 | if (DECL_OVERLOADED_OPERATOR_P (decl) == TYPE_EXPR | |
5039 | && LAMBDA_TYPE_P (DECL_CONTEXT (decl))) | |
5040 | { | |
5041 | /* We mark a lambda conversion op as deleted if we can't | |
5042 | generate it properly; see maybe_add_lambda_conv_op. */ | |
5043 | sorry ("converting lambda which uses %<...%> to " | |
5044 | "function pointer"); | |
5045 | return false; | |
5046 | } | |
5047 | } | |
5048 | if (complain & tf_error) | |
5049 | { | |
5050 | error ("use of deleted function %qD", decl); | |
5051 | if (!maybe_explain_implicit_delete (decl)) | |
5052 | inform (DECL_SOURCE_LOCATION (decl), "declared here"); | |
5053 | } | |
5054 | return false; | |
5055 | } | |
5056 | ||
5057 | if (TREE_DEPRECATED (decl) && (complain & tf_warning) | |
5058 | && deprecated_state != DEPRECATED_SUPPRESS) | |
5059 | warn_deprecated_use (decl, NULL_TREE); | |
5060 | ||
5061 | /* We can only check DECL_ODR_USED on variables or functions with | |
5062 | DECL_LANG_SPECIFIC set, and these are also the only decls that we | |
5063 | might need special handling for. */ | |
5064 | if (!VAR_OR_FUNCTION_DECL_P (decl) | |
5065 | || DECL_LANG_SPECIFIC (decl) == NULL | |
5066 | || DECL_THUNK_P (decl)) | |
5067 | { | |
5068 | if (!processing_template_decl && type_uses_auto (TREE_TYPE (decl))) | |
5069 | { | |
5070 | if (complain & tf_error) | |
5071 | error ("use of %qD before deduction of %<auto%>", decl); | |
5072 | return false; | |
5073 | } | |
5074 | return true; | |
5075 | } | |
5076 | ||
5077 | /* We only want to do this processing once. We don't need to keep trying | |
5078 | to instantiate inline templates, because unit-at-a-time will make sure | |
5079 | we get them compiled before functions that want to inline them. */ | |
5080 | if (DECL_ODR_USED (decl)) | |
5081 | return true; | |
5082 | ||
5083 | /* If within finish_function, defer the rest until that function | |
5084 | finishes, otherwise it might recurse. */ | |
5085 | if (defer_mark_used_calls) | |
5086 | { | |
5087 | vec_safe_push (deferred_mark_used_calls, decl); | |
5088 | return true; | |
5089 | } | |
5090 | ||
5091 | /* Normally, we can wait until instantiation-time to synthesize DECL. | |
5092 | However, if DECL is a static data member initialized with a constant | |
5093 | or a constexpr function, we need it right now because a reference to | |
5094 | such a data member or a call to such function is not value-dependent. | |
5095 | For a function that uses auto in the return type, we need to instantiate | |
5096 | it to find out its type. For OpenMP user defined reductions, we need | |
5097 | them instantiated for reduction clauses which inline them by hand | |
5098 | directly. */ | |
5099 | if (DECL_LANG_SPECIFIC (decl) | |
5100 | && DECL_TEMPLATE_INFO (decl) | |
5101 | && (decl_maybe_constant_var_p (decl) | |
5102 | || (TREE_CODE (decl) == FUNCTION_DECL | |
cfea5195 | 5103 | && DECL_OMP_DECLARE_REDUCTION_P (decl)) |
dda118e3 JM |
5104 | || undeduced_auto_decl (decl)) |
5105 | && !uses_template_parms (DECL_TI_ARGS (decl))) | |
5106 | { | |
5107 | /* Instantiating a function will result in garbage collection. We | |
5108 | must treat this situation as if we were within the body of a | |
5109 | function so as to avoid collecting live data only referenced from | |
5110 | the stack (such as overload resolution candidates). */ | |
5111 | ++function_depth; | |
5112 | instantiate_decl (decl, /*defer_ok=*/false, | |
5113 | /*expl_inst_class_mem_p=*/false); | |
5114 | --function_depth; | |
5115 | } | |
5116 | ||
5117 | if (processing_template_decl || in_template_function ()) | |
5118 | return true; | |
5119 | ||
5120 | /* Check this too in case we're within instantiate_non_dependent_expr. */ | |
5121 | if (DECL_TEMPLATE_INFO (decl) | |
5122 | && uses_template_parms (DECL_TI_ARGS (decl))) | |
5123 | return true; | |
5124 | ||
38c0c85b JM |
5125 | if (undeduced_auto_decl (decl)) |
5126 | { | |
5127 | if (complain & tf_error) | |
5128 | error ("use of %qD before deduction of %<auto%>", decl); | |
5129 | return false; | |
5130 | } | |
dda118e3 JM |
5131 | |
5132 | /* If we don't need a value, then we don't need to synthesize DECL. */ | |
5133 | if (cp_unevaluated_operand != 0) | |
5134 | return true; | |
5135 | ||
5136 | DECL_ODR_USED (decl) = 1; | |
5137 | if (DECL_CLONED_FUNCTION_P (decl)) | |
5138 | DECL_ODR_USED (DECL_CLONED_FUNCTION (decl)) = 1; | |
5139 | ||
5140 | /* DR 757: A type without linkage shall not be used as the type of a | |
5141 | variable or function with linkage, unless | |
5142 | o the variable or function has extern "C" linkage (7.5 [dcl.link]), or | |
5143 | o the variable or function is not used (3.2 [basic.def.odr]) or is | |
5144 | defined in the same translation unit. */ | |
5145 | if (cxx_dialect > cxx98 | |
5146 | && decl_linkage (decl) != lk_none | |
5147 | && !DECL_EXTERN_C_P (decl) | |
5148 | && !DECL_ARTIFICIAL (decl) | |
5149 | && !decl_defined_p (decl) | |
5150 | && no_linkage_check (TREE_TYPE (decl), /*relaxed_p=*/false)) | |
5151 | { | |
5152 | if (is_local_extern (decl)) | |
5153 | /* There's no way to define a local extern, and adding it to | |
5154 | the vector interferes with GC, so give an error now. */ | |
5155 | no_linkage_error (decl); | |
5156 | else | |
5157 | vec_safe_push (no_linkage_decls, decl); | |
5158 | } | |
5159 | ||
5160 | if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl) | |
5161 | && !DECL_INITIAL (decl) && !DECL_ARTIFICIAL (decl)) | |
5162 | /* Remember it, so we can check it was defined. */ | |
5163 | note_vague_linkage_fn (decl); | |
5164 | ||
5165 | /* Is it a synthesized method that needs to be synthesized? */ | |
5166 | if (TREE_CODE (decl) == FUNCTION_DECL | |
5167 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl) | |
5168 | && DECL_DEFAULTED_FN (decl) | |
5169 | /* A function defaulted outside the class is synthesized either by | |
5170 | cp_finish_decl or instantiate_decl. */ | |
5171 | && !DECL_DEFAULTED_OUTSIDE_CLASS_P (decl) | |
5172 | && ! DECL_INITIAL (decl)) | |
5173 | { | |
5174 | /* Defer virtual destructors so that thunks get the right | |
5175 | linkage. */ | |
5176 | if (DECL_VIRTUAL_P (decl) && !at_eof) | |
5177 | { | |
5178 | note_vague_linkage_fn (decl); | |
5179 | return true; | |
5180 | } | |
5181 | ||
5182 | /* Remember the current location for a function we will end up | |
5183 | synthesizing. Then we can inform the user where it was | |
5184 | required in the case of error. */ | |
5185 | DECL_SOURCE_LOCATION (decl) = input_location; | |
5186 | ||
5187 | /* Synthesizing an implicitly defined member function will result in | |
5188 | garbage collection. We must treat this situation as if we were | |
5189 | within the body of a function so as to avoid collecting live data | |
5190 | on the stack (such as overload resolution candidates). | |
5191 | ||
5192 | We could just let cp_write_global_declarations handle synthesizing | |
5193 | this function by adding it to deferred_fns, but doing | |
5194 | it at the use site produces better error messages. */ | |
5195 | ++function_depth; | |
5196 | synthesize_method (decl); | |
5197 | --function_depth; | |
5198 | /* If this is a synthesized method we don't need to | |
5199 | do the instantiation test below. */ | |
5200 | } | |
5201 | else if (VAR_OR_FUNCTION_DECL_P (decl) | |
5202 | && DECL_TEMPLATE_INFO (decl) | |
5203 | && (!DECL_EXPLICIT_INSTANTIATION (decl) | |
5204 | || always_instantiate_p (decl))) | |
5205 | /* If this is a function or variable that is an instance of some | |
5206 | template, we now know that we will need to actually do the | |
5207 | instantiation. We check that DECL is not an explicit | |
5208 | instantiation because that is not checked in instantiate_decl. | |
5209 | ||
5210 | We put off instantiating functions in order to improve compile | |
5211 | times. Maintaining a stack of active functions is expensive, | |
5212 | and the inliner knows to instantiate any functions it might | |
5213 | need. Therefore, we always try to defer instantiation. */ | |
5214 | { | |
5215 | ++function_depth; | |
5216 | instantiate_decl (decl, /*defer_ok=*/true, | |
5217 | /*expl_inst_class_mem_p=*/false); | |
5218 | --function_depth; | |
5219 | } | |
5220 | ||
5221 | return true; | |
5222 | } | |
5223 | ||
5224 | bool | |
5225 | mark_used (tree decl) | |
5226 | { | |
5227 | return mark_used (decl, tf_warning_or_error); | |
5228 | } | |
5229 | ||
5230 | tree | |
5231 | vtv_start_verification_constructor_init_function (void) | |
5232 | { | |
5233 | return start_objects ('I', MAX_RESERVED_INIT_PRIORITY - 1); | |
5234 | } | |
5235 | ||
5236 | tree | |
5237 | vtv_finish_verification_constructor_init_function (tree function_body) | |
5238 | { | |
5239 | tree fn; | |
5240 | ||
5241 | finish_compound_stmt (function_body); | |
5242 | fn = finish_function (0); | |
5243 | DECL_STATIC_CONSTRUCTOR (fn) = 1; | |
5244 | decl_init_priority_insert (fn, MAX_RESERVED_INIT_PRIORITY - 1); | |
5245 | ||
5246 | return fn; | |
5247 | } | |
5248 | ||
5249 | #include "gt-cp-decl2.h" |