]>
Commit | Line | Data |
---|---|---|
3fd5abcf | 1 | /* Process declarations and variables for C++ compiler. |
d6a8bdff | 2 | Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998, |
36a549b8 | 3 | 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2007, 2008, 2009, 2010 |
b2febff9 | 4 | Free Software Foundation, Inc. |
8d08fdba MS |
5 | Hacked by Michael Tiemann (tiemann@cygnus.com) |
6 | ||
1c313945 | 7 | This file is part of GCC. |
8d08fdba | 8 | |
1c313945 | 9 | GCC is free software; you can redistribute it and/or modify |
8d08fdba | 10 | it under the terms of the GNU General Public License as published by |
e77f031d | 11 | the Free Software Foundation; either version 3, or (at your option) |
8d08fdba MS |
12 | any later version. |
13 | ||
1c313945 | 14 | GCC is distributed in the hope that it will be useful, |
8d08fdba MS |
15 | but WITHOUT ANY WARRANTY; without even the implied warranty of |
16 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | GNU General Public License for more details. | |
18 | ||
19 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
20 | along with GCC; see the file COPYING3. If not see |
21 | <http://www.gnu.org/licenses/>. */ | |
8d08fdba MS |
22 | |
23 | ||
1c313945 | 24 | /* Process declarations and symbol lookup for C++ front end. |
8d08fdba MS |
25 | Also constructs types; the standard scalar types at initialization, |
26 | and structure, union, array and enum types when they are declared. */ | |
27 | ||
28 | /* ??? not all decl nodes are given the most useful possible | |
29 | line numbers. For example, the CONST_DECLs for enum values. */ | |
30 | ||
31 | #include "config.h" | |
8d052bc7 | 32 | #include "system.h" |
4977bab6 ZW |
33 | #include "coretypes.h" |
34 | #include "tm.h" | |
8d08fdba | 35 | #include "tree.h" |
8d08fdba MS |
36 | #include "flags.h" |
37 | #include "cp-tree.h" | |
38 | #include "decl.h" | |
e8abc66f | 39 | #include "output.h" |
54f92bfb | 40 | #include "toplev.h" |
2a9a326b | 41 | #include "timevar.h" |
297441fd | 42 | #include "cpplib.h" |
672a6f42 | 43 | #include "target.h" |
39dabefd | 44 | #include "c-family/c-common.h" |
6de9cd9a | 45 | #include "tree-mudflap.h" |
8cd2462c JH |
46 | #include "cgraph.h" |
47 | #include "tree-inline.h" | |
39dabefd | 48 | #include "c-family/c-pragma.h" |
ef330312 | 49 | #include "tree-dump.h" |
dee15844 | 50 | #include "intl.h" |
726a989a | 51 | #include "gimple.h" |
4537ec0c | 52 | #include "pointer-set.h" |
245763e3 | 53 | #include "splay-tree.h" |
36a549b8 | 54 | #include "langhooks.h" |
39dabefd | 55 | #include "c-family/c-ada-spec.h" |
6de9cd9a | 56 | |
cf44ea52 | 57 | extern cpp_reader *parse_in; |
297441fd | 58 | |
0aafb128 MM |
59 | /* This structure contains information about the initializations |
60 | and/or destructions required for a particular priority level. */ | |
61 | typedef struct priority_info_s { | |
838dfd8a | 62 | /* Nonzero if there have been any initializations at this priority |
0352cfc8 MM |
63 | throughout the translation unit. */ |
64 | int initializations_p; | |
838dfd8a | 65 | /* Nonzero if there have been any destructions at this priority |
0352cfc8 MM |
66 | throughout the translation unit. */ |
67 | int destructions_p; | |
0aafb128 MM |
68 | } *priority_info; |
69 | ||
848eed92 | 70 | static void mark_vtable_entries (tree); |
848eed92 | 71 | static bool maybe_emit_vtables (tree); |
848eed92 | 72 | static bool acceptable_java_type (tree); |
848eed92 GDR |
73 | static tree start_objects (int, int); |
74 | static void finish_objects (int, int, tree); | |
299f79b5 | 75 | static tree start_static_storage_duration_function (unsigned); |
848eed92 GDR |
76 | static void finish_static_storage_duration_function (tree); |
77 | static priority_info get_priority_info (int); | |
6cec5cb5 RG |
78 | static void do_static_initialization_or_destruction (tree, bool); |
79 | static void one_static_initialization_or_destruction (tree, tree, bool); | |
299f79b5 | 80 | static void generate_ctor_or_dtor_function (bool, int, location_t *); |
848eed92 | 81 | static int generate_ctor_and_dtor_functions_for_priority (splay_tree_node, |
0cbd7506 | 82 | void *); |
cec24319 | 83 | static tree prune_vars_needing_no_initialization (tree *); |
848eed92 GDR |
84 | static void write_out_vars (tree); |
85 | static void import_export_class (tree); | |
848eed92 | 86 | static tree get_guard_bits (tree); |
0ed5edac | 87 | static void determine_visibility_from_class (tree, tree); |
e8f43da6 | 88 | static bool decl_defined_p (tree); |
313bc2c2 | 89 | |
8d08fdba MS |
90 | /* A list of static class variables. This is needed, because a |
91 | static class variable can be declared inside the class without | |
306ef644 | 92 | an initializer, and then initialized, statically, outside the class. */ |
2b41c040 | 93 | static GTY(()) VEC(tree,gc) *pending_statics; |
8d08fdba | 94 | |
8926095f | 95 | /* A list of functions which were declared inline, but which we |
e92cc029 | 96 | may need to emit outline anyway. */ |
125121e2 | 97 | static GTY(()) VEC(tree,gc) *deferred_fns; |
8d08fdba | 98 | |
e8f43da6 JM |
99 | /* A list of decls that use types with no linkage, which we need to make |
100 | sure are defined. */ | |
101 | static GTY(()) VEC(tree,gc) *no_linkage_decls; | |
102 | ||
5566b478 MS |
103 | /* Nonzero if we're done parsing and into end-of-file activities. */ |
104 | ||
105 | int at_eof; | |
106 | ||
8d08fdba | 107 | \f |
e2537f2c MM |
108 | |
109 | /* Return a member function type (a METHOD_TYPE), given FNTYPE (a | |
110 | FUNCTION_TYPE), CTYPE (class type), and QUALS (the cv-qualifiers | |
111 | that apply to the function). */ | |
112 | ||
113 | tree | |
114 | build_memfn_type (tree fntype, tree ctype, cp_cv_quals quals) | |
8d08fdba | 115 | { |
e2537f2c | 116 | tree raises; |
3c3905fc | 117 | tree attrs; |
e2537f2c | 118 | int type_quals; |
8d08fdba | 119 | |
15218346 VR |
120 | if (fntype == error_mark_node || ctype == error_mark_node) |
121 | return error_mark_node; | |
122 | ||
3c3905fc JM |
123 | gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE |
124 | || TREE_CODE (fntype) == METHOD_TYPE); | |
125 | ||
3c01e5df | 126 | type_quals = quals & ~TYPE_QUAL_RESTRICT; |
91063b51 | 127 | ctype = cp_build_qualified_type (ctype, type_quals); |
3c3905fc JM |
128 | raises = TYPE_RAISES_EXCEPTIONS (fntype); |
129 | attrs = TYPE_ATTRIBUTES (fntype); | |
43dc123f MM |
130 | fntype = build_method_type_directly (ctype, TREE_TYPE (fntype), |
131 | (TREE_CODE (fntype) == METHOD_TYPE | |
132 | ? TREE_CHAIN (TYPE_ARG_TYPES (fntype)) | |
133 | : TYPE_ARG_TYPES (fntype))); | |
8d08fdba | 134 | if (raises) |
f30432d7 | 135 | fntype = build_exception_variant (fntype, raises); |
3c3905fc JM |
136 | if (attrs) |
137 | fntype = cp_build_type_attribute_variant (fntype, attrs); | |
8d08fdba | 138 | |
e2537f2c | 139 | return fntype; |
8d08fdba MS |
140 | } |
141 | ||
643d4cd6 JM |
142 | /* Return a variant of FNTYPE, a FUNCTION_TYPE or METHOD_TYPE, with its |
143 | return type changed to NEW_RET. */ | |
144 | ||
145 | tree | |
146 | change_return_type (tree new_ret, tree fntype) | |
147 | { | |
148 | tree newtype; | |
149 | tree args = TYPE_ARG_TYPES (fntype); | |
150 | tree raises = TYPE_RAISES_EXCEPTIONS (fntype); | |
151 | tree attrs = TYPE_ATTRIBUTES (fntype); | |
152 | ||
153 | if (same_type_p (new_ret, TREE_TYPE (fntype))) | |
154 | return fntype; | |
155 | ||
156 | if (TREE_CODE (fntype) == FUNCTION_TYPE) | |
2872152c JM |
157 | { |
158 | newtype = build_function_type (new_ret, args); | |
159 | newtype = apply_memfn_quals (newtype, type_memfn_quals (fntype)); | |
160 | } | |
643d4cd6 | 161 | else |
c6be04ad JM |
162 | newtype = build_method_type_directly |
163 | (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (fntype))), | |
164 | new_ret, TREE_CHAIN (args)); | |
643d4cd6 JM |
165 | if (raises) |
166 | newtype = build_exception_variant (newtype, raises); | |
167 | if (attrs) | |
168 | newtype = cp_build_type_attribute_variant (newtype, attrs); | |
169 | ||
170 | return newtype; | |
171 | } | |
172 | ||
8e51619a JM |
173 | /* Build a PARM_DECL with NAME and TYPE, and set DECL_ARG_TYPE |
174 | appropriately. */ | |
175 | ||
176 | tree | |
848eed92 | 177 | cp_build_parm_decl (tree name, tree type) |
8e51619a | 178 | { |
c2255bc4 AH |
179 | tree parm = build_decl (input_location, |
180 | PARM_DECL, name, type); | |
560ad596 MM |
181 | /* DECL_ARG_TYPE is only used by the back end and the back end never |
182 | sees templates. */ | |
183 | if (!processing_template_decl) | |
184 | DECL_ARG_TYPE (parm) = type_passed_as (type); | |
5d80a306 DG |
185 | |
186 | /* If the type is a pack expansion, then we have a function | |
187 | parameter pack. */ | |
188 | if (type && TREE_CODE (type) == TYPE_PACK_EXPANSION) | |
189 | FUNCTION_PARAMETER_PACK_P (parm) = 1; | |
190 | ||
8e51619a JM |
191 | return parm; |
192 | } | |
193 | ||
3ec6bad3 MM |
194 | /* Returns a PARM_DECL for a parameter of the indicated TYPE, with the |
195 | indicated NAME. */ | |
196 | ||
e2537f2c | 197 | tree |
848eed92 | 198 | build_artificial_parm (tree name, tree type) |
3ec6bad3 | 199 | { |
8e51619a | 200 | tree parm = cp_build_parm_decl (name, type); |
c727aa5e | 201 | DECL_ARTIFICIAL (parm) = 1; |
a714e5c5 JM |
202 | /* All our artificial parms are implicitly `const'; they cannot be |
203 | assigned to. */ | |
204 | TREE_READONLY (parm) = 1; | |
3ec6bad3 MM |
205 | return parm; |
206 | } | |
207 | ||
711734a9 JM |
208 | /* Constructors for types with virtual baseclasses need an "in-charge" flag |
209 | saying whether this constructor is responsible for initialization of | |
210 | virtual baseclasses or not. All destructors also need this "in-charge" | |
211 | flag, which additionally determines whether or not the destructor should | |
212 | free the memory for the object. | |
213 | ||
214 | This function adds the "in-charge" flag to member function FN if | |
215 | appropriate. It is called from grokclassfn and tsubst. | |
e0fff4b3 JM |
216 | FN must be either a constructor or destructor. |
217 | ||
218 | The in-charge flag follows the 'this' parameter, and is followed by the | |
219 | VTT parm (if any), then the user-written parms. */ | |
711734a9 JM |
220 | |
221 | void | |
848eed92 | 222 | maybe_retrofit_in_chrg (tree fn) |
711734a9 JM |
223 | { |
224 | tree basetype, arg_types, parms, parm, fntype; | |
225 | ||
454fa7a7 MM |
226 | /* If we've already add the in-charge parameter don't do it again. */ |
227 | if (DECL_HAS_IN_CHARGE_PARM_P (fn)) | |
711734a9 JM |
228 | return; |
229 | ||
212e7048 MM |
230 | /* When processing templates we can't know, in general, whether or |
231 | not we're going to have virtual baseclasses. */ | |
c353b8e3 | 232 | if (processing_template_decl) |
212e7048 MM |
233 | return; |
234 | ||
454fa7a7 MM |
235 | /* We don't need an in-charge parameter for constructors that don't |
236 | have virtual bases. */ | |
237 | if (DECL_CONSTRUCTOR_P (fn) | |
5775a06a | 238 | && !CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fn))) |
454fa7a7 | 239 | return; |
711734a9 | 240 | |
711734a9 JM |
241 | arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn)); |
242 | basetype = TREE_TYPE (TREE_VALUE (arg_types)); | |
e0fff4b3 JM |
243 | arg_types = TREE_CHAIN (arg_types); |
244 | ||
910ad8de | 245 | parms = DECL_CHAIN (DECL_ARGUMENTS (fn)); |
e0fff4b3 JM |
246 | |
247 | /* If this is a subobject constructor or destructor, our caller will | |
248 | pass us a pointer to our VTT. */ | |
5775a06a | 249 | if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fn))) |
e0fff4b3 JM |
250 | { |
251 | parm = build_artificial_parm (vtt_parm_identifier, vtt_parm_type); | |
252 | ||
253 | /* First add it to DECL_ARGUMENTS between 'this' and the real args... */ | |
910ad8de | 254 | DECL_CHAIN (parm) = parms; |
e0fff4b3 JM |
255 | parms = parm; |
256 | ||
257 | /* ...and then to TYPE_ARG_TYPES. */ | |
258 | arg_types = hash_tree_chain (vtt_parm_type, arg_types); | |
259 | ||
260 | DECL_HAS_VTT_PARM_P (fn) = 1; | |
261 | } | |
262 | ||
263 | /* Then add the in-charge parm (before the VTT parm). */ | |
264 | parm = build_artificial_parm (in_charge_identifier, integer_type_node); | |
910ad8de | 265 | DECL_CHAIN (parm) = parms; |
e0fff4b3 JM |
266 | parms = parm; |
267 | arg_types = hash_tree_chain (integer_type_node, arg_types); | |
268 | ||
269 | /* Insert our new parameter(s) into the list. */ | |
910ad8de | 270 | DECL_CHAIN (DECL_ARGUMENTS (fn)) = parms; |
e0fff4b3 JM |
271 | |
272 | /* And rebuild the function type. */ | |
43dc123f MM |
273 | fntype = build_method_type_directly (basetype, TREE_TYPE (TREE_TYPE (fn)), |
274 | arg_types); | |
711734a9 JM |
275 | if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn))) |
276 | fntype = build_exception_variant (fntype, | |
277 | TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn))); | |
3c3905fc JM |
278 | if (TYPE_ATTRIBUTES (TREE_TYPE (fn))) |
279 | fntype = (cp_build_type_attribute_variant | |
280 | (fntype, TYPE_ATTRIBUTES (TREE_TYPE (fn)))); | |
711734a9 | 281 | TREE_TYPE (fn) = fntype; |
454fa7a7 MM |
282 | |
283 | /* Now we've got the in-charge parameter. */ | |
284 | DECL_HAS_IN_CHARGE_PARM_P (fn) = 1; | |
711734a9 JM |
285 | } |
286 | ||
8d08fdba MS |
287 | /* Classes overload their constituent function names automatically. |
288 | When a function name is declared in a record structure, | |
289 | its name is changed to it overloaded name. Since names for | |
290 | constructors and destructors can conflict, we place a leading | |
291 | '$' for destructors. | |
292 | ||
293 | CNAME is the name of the class we are grokking for. | |
294 | ||
295 | FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'. | |
296 | ||
297 | FLAGS contains bits saying what's special about today's | |
ee18fe39 | 298 | arguments. DTOR_FLAG == DESTRUCTOR. |
8d08fdba MS |
299 | |
300 | If FUNCTION is a destructor, then we must add the `auto-delete' field | |
301 | as a second parameter. There is some hair associated with the fact | |
302 | that we must "declare" this variable in the manner consistent with the | |
303 | way the rest of the arguments were declared. | |
304 | ||
305 | QUALS are the qualifiers for the this pointer. */ | |
306 | ||
307 | void | |
e2537f2c | 308 | grokclassfn (tree ctype, tree function, enum overload_flags flags) |
8d08fdba MS |
309 | { |
310 | tree fn_name = DECL_NAME (function); | |
8d08fdba | 311 | |
cab8bde9 MM |
312 | /* Even within an `extern "C"' block, members get C++ linkage. See |
313 | [dcl.link] for details. */ | |
5d2ed28c | 314 | SET_DECL_LANGUAGE (function, lang_cplusplus); |
cab8bde9 | 315 | |
8d08fdba MS |
316 | if (fn_name == NULL_TREE) |
317 | { | |
8251199e | 318 | error ("name missing for member function"); |
8d08fdba MS |
319 | fn_name = get_identifier ("<anonymous>"); |
320 | DECL_NAME (function) = fn_name; | |
321 | } | |
322 | ||
711734a9 | 323 | DECL_CONTEXT (function) = ctype; |
711734a9 | 324 | |
92643fea MM |
325 | if (flags == DTOR_FLAG) |
326 | DECL_DESTRUCTOR_P (function) = 1; | |
327 | ||
711734a9 | 328 | if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function)) |
535233a8 | 329 | maybe_retrofit_in_chrg (function); |
8d08fdba MS |
330 | } |
331 | ||
8d08fdba MS |
332 | /* Create an ARRAY_REF, checking for the user doing things backwards |
333 | along the way. */ | |
e92cc029 | 334 | |
8d08fdba | 335 | tree |
848eed92 | 336 | grok_array_decl (tree array_expr, tree index_exp) |
8d08fdba | 337 | { |
d17811fd MM |
338 | tree type; |
339 | tree expr; | |
340 | tree orig_array_expr = array_expr; | |
341 | tree orig_index_exp = index_exp; | |
8d08fdba | 342 | |
d17811fd | 343 | if (error_operand_p (array_expr) || error_operand_p (index_exp)) |
8d08fdba | 344 | return error_mark_node; |
d17811fd | 345 | |
5156628f | 346 | if (processing_template_decl) |
d17811fd MM |
347 | { |
348 | if (type_dependent_expression_p (array_expr) | |
349 | || type_dependent_expression_p (index_exp)) | |
44de5aeb RK |
350 | return build_min_nt (ARRAY_REF, array_expr, index_exp, |
351 | NULL_TREE, NULL_TREE); | |
d17811fd MM |
352 | array_expr = build_non_dependent_expr (array_expr); |
353 | index_exp = build_non_dependent_expr (index_exp); | |
354 | } | |
5566b478 | 355 | |
d17811fd | 356 | type = TREE_TYPE (array_expr); |
50bc768d | 357 | gcc_assert (type); |
ee76b931 | 358 | type = non_reference (type); |
8d08fdba MS |
359 | |
360 | /* If they have an `operator[]', use that. */ | |
9e1e64ec | 361 | if (MAYBE_CLASS_TYPE_P (type) || MAYBE_CLASS_TYPE_P (TREE_TYPE (index_exp))) |
d17811fd | 362 | expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL, |
ec835fb2 | 363 | array_expr, index_exp, NULL_TREE, |
5ade1ed2 | 364 | /*overloaded_p=*/NULL, tf_warning_or_error); |
b7484fbe | 365 | else |
d17811fd MM |
366 | { |
367 | tree p1, p2, i1, i2; | |
8d08fdba | 368 | |
d17811fd MM |
369 | /* Otherwise, create an ARRAY_REF for a pointer or array type. |
370 | It is a little-known fact that, if `a' is an array and `i' is | |
371 | an int, you can write `i[a]', which means the same thing as | |
372 | `a[i]'. */ | |
373 | if (TREE_CODE (type) == ARRAY_TYPE) | |
374 | p1 = array_expr; | |
375 | else | |
376 | p1 = build_expr_type_conversion (WANT_POINTER, array_expr, false); | |
377 | ||
378 | if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE) | |
379 | p2 = index_exp; | |
380 | else | |
381 | p2 = build_expr_type_conversion (WANT_POINTER, index_exp, false); | |
8d08fdba | 382 | |
c8094d83 | 383 | i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr, |
d17811fd | 384 | false); |
c8094d83 | 385 | i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp, |
d17811fd | 386 | false); |
8d08fdba | 387 | |
d17811fd MM |
388 | if ((p1 && i2) && (i1 && p2)) |
389 | error ("ambiguous conversion for array subscript"); | |
8d08fdba | 390 | |
d17811fd MM |
391 | if (p1 && i2) |
392 | array_expr = p1, index_exp = i2; | |
393 | else if (i1 && p2) | |
394 | array_expr = p2, index_exp = i1; | |
395 | else | |
396 | { | |
2d01edd7 | 397 | error ("invalid types %<%T[%T]%> for array subscript", |
0cbd7506 | 398 | type, TREE_TYPE (index_exp)); |
d17811fd MM |
399 | return error_mark_node; |
400 | } | |
b7484fbe | 401 | |
d17811fd MM |
402 | if (array_expr == error_mark_node || index_exp == error_mark_node) |
403 | error ("ambiguous conversion for array subscript"); | |
b7484fbe | 404 | |
3a11c665 | 405 | expr = build_array_ref (input_location, array_expr, index_exp); |
d17811fd MM |
406 | } |
407 | if (processing_template_decl && expr != error_mark_node) | |
44de5aeb RK |
408 | return build_min_non_dep (ARRAY_REF, expr, orig_array_expr, orig_index_exp, |
409 | NULL_TREE, NULL_TREE); | |
d17811fd | 410 | return expr; |
8d08fdba MS |
411 | } |
412 | ||
413 | /* Given the cast expression EXP, checking out its validity. Either return | |
414 | an error_mark_node if there was an unavoidable error, return a cast to | |
415 | void for trying to delete a pointer w/ the value 0, or return the | |
0e8c9b28 MM |
416 | call to delete. If DOING_VEC is true, we handle things differently |
417 | for doing an array delete. | |
8d08fdba | 418 | Implements ARM $5.3.4. This is called from the parser. */ |
e92cc029 | 419 | |
8d08fdba | 420 | tree |
0e8c9b28 | 421 | delete_sanity (tree exp, tree size, bool doing_vec, int use_global_delete) |
8d08fdba | 422 | { |
02020185 | 423 | tree t, type; |
5566b478 | 424 | |
909e536a MS |
425 | if (exp == error_mark_node) |
426 | return exp; | |
427 | ||
5156628f | 428 | if (processing_template_decl) |
5566b478 MS |
429 | { |
430 | t = build_min (DELETE_EXPR, void_type_node, exp, size); | |
431 | DELETE_EXPR_USE_GLOBAL (t) = use_global_delete; | |
432 | DELETE_EXPR_USE_VEC (t) = doing_vec; | |
c1cca8d4 | 433 | TREE_SIDE_EFFECTS (t) = 1; |
5566b478 MS |
434 | return t; |
435 | } | |
436 | ||
0e8c9b28 MM |
437 | /* An array can't have been allocated by new, so complain. */ |
438 | if (TREE_CODE (exp) == VAR_DECL | |
439 | && TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE) | |
d4ee4d25 | 440 | warning (0, "deleting array %q#D", exp); |
0e8c9b28 | 441 | |
49b7aacb | 442 | t = build_expr_type_conversion (WANT_POINTER, exp, true); |
8d08fdba | 443 | |
02020185 | 444 | if (t == NULL_TREE || t == error_mark_node) |
8d08fdba | 445 | { |
2d01edd7 | 446 | error ("type %q#T argument given to %<delete%>, expected pointer", |
0cbd7506 | 447 | TREE_TYPE (exp)); |
02020185 | 448 | return error_mark_node; |
8d08fdba MS |
449 | } |
450 | ||
02020185 JM |
451 | type = TREE_TYPE (t); |
452 | ||
453 | /* As of Valley Forge, you can delete a pointer to const. */ | |
454 | ||
455 | /* You can't delete functions. */ | |
456 | if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE) | |
8926095f | 457 | { |
2d01edd7 | 458 | error ("cannot delete a function. Only pointer-to-objects are " |
0cbd7506 | 459 | "valid arguments to %<delete%>"); |
02020185 | 460 | return error_mark_node; |
8926095f | 461 | } |
02020185 | 462 | |
838dfd8a | 463 | /* Deleting ptr to void is undefined behavior [expr.delete/3]. */ |
7f477e81 | 464 | if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE) |
655dc6ee | 465 | { |
d4ee4d25 | 466 | warning (0, "deleting %qT is undefined", type); |
655dc6ee JM |
467 | doing_vec = 0; |
468 | } | |
469 | ||
02020185 JM |
470 | /* Deleting a pointer with the value zero is valid and has no effect. */ |
471 | if (integer_zerop (t)) | |
472 | return build1 (NOP_EXPR, void_type_node, t); | |
8d08fdba MS |
473 | |
474 | if (doing_vec) | |
c8094d83 | 475 | return build_vec_delete (t, /*maxindex=*/NULL_TREE, |
0e8c9b28 | 476 | sfk_deleting_destructor, |
86f45d2c | 477 | use_global_delete); |
8d08fdba | 478 | else |
e3fe84e5 JM |
479 | return build_delete (type, t, sfk_deleting_destructor, |
480 | LOOKUP_NORMAL, use_global_delete); | |
8d08fdba MS |
481 | } |
482 | ||
98c1c668 JM |
483 | /* Report an error if the indicated template declaration is not the |
484 | sort of thing that should be a member template. */ | |
485 | ||
486 | void | |
848eed92 | 487 | check_member_template (tree tmpl) |
98c1c668 JM |
488 | { |
489 | tree decl; | |
490 | ||
50bc768d | 491 | gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL); |
98c1c668 JM |
492 | decl = DECL_TEMPLATE_RESULT (tmpl); |
493 | ||
1701f21e MM |
494 | if (TREE_CODE (decl) == FUNCTION_DECL |
495 | || (TREE_CODE (decl) == TYPE_DECL | |
9e1e64ec | 496 | && MAYBE_CLASS_TYPE_P (TREE_TYPE (decl)))) |
98c1c668 | 497 | { |
7f1ba716 MM |
498 | /* The parser rejects template declarations in local classes. */ |
499 | gcc_assert (!current_function_decl); | |
ceacde63 MM |
500 | /* The parser rejects any use of virtual in a function template. */ |
501 | gcc_assert (!(TREE_CODE (decl) == FUNCTION_DECL | |
502 | && DECL_VIRTUAL_P (decl))); | |
98c1c668 JM |
503 | |
504 | /* The debug-information generating code doesn't know what to do | |
c8094d83 | 505 | with member templates. */ |
98c1c668 | 506 | DECL_IGNORED_P (tmpl) = 1; |
c8094d83 | 507 | } |
98c1c668 | 508 | else |
2d01edd7 | 509 | error ("template declaration of %q#D", decl); |
98c1c668 JM |
510 | } |
511 | ||
a1c65f9f | 512 | /* Return true iff TYPE is a valid Java parameter or return type. */ |
eff71ab0 | 513 | |
848eed92 GDR |
514 | static bool |
515 | acceptable_java_type (tree type) | |
eff71ab0 | 516 | { |
662c2e83 LM |
517 | if (type == error_mark_node) |
518 | return false; | |
519 | ||
eff71ab0 | 520 | if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type)) |
662c2e83 | 521 | return true; |
23d4e4cc | 522 | if (TREE_CODE (type) == POINTER_TYPE || TREE_CODE (type) == REFERENCE_TYPE) |
eff71ab0 PB |
523 | { |
524 | type = TREE_TYPE (type); | |
525 | if (TREE_CODE (type) == RECORD_TYPE) | |
526 | { | |
824f42ab PB |
527 | tree args; int i; |
528 | if (! TYPE_FOR_JAVA (type)) | |
848eed92 | 529 | return false; |
824f42ab | 530 | if (! CLASSTYPE_TEMPLATE_INFO (type)) |
848eed92 | 531 | return true; |
824f42ab PB |
532 | args = CLASSTYPE_TI_ARGS (type); |
533 | i = TREE_VEC_LENGTH (args); | |
534 | while (--i >= 0) | |
535 | { | |
536 | type = TREE_VEC_ELT (args, i); | |
537 | if (TREE_CODE (type) == POINTER_TYPE) | |
538 | type = TREE_TYPE (type); | |
539 | if (! TYPE_FOR_JAVA (type)) | |
848eed92 | 540 | return false; |
824f42ab | 541 | } |
848eed92 | 542 | return true; |
eff71ab0 PB |
543 | } |
544 | } | |
848eed92 | 545 | return false; |
eff71ab0 PB |
546 | } |
547 | ||
848eed92 | 548 | /* For a METHOD in a Java class CTYPE, return true if |
eff71ab0 | 549 | the parameter and return types are valid Java types. |
848eed92 | 550 | Otherwise, print appropriate error messages, and return false. */ |
eff71ab0 | 551 | |
848eed92 GDR |
552 | bool |
553 | check_java_method (tree method) | |
eff71ab0 | 554 | { |
848eed92 | 555 | bool jerr = false; |
eff71ab0 PB |
556 | tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method)); |
557 | tree ret_type = TREE_TYPE (TREE_TYPE (method)); | |
f5c28a15 | 558 | |
848eed92 | 559 | if (!acceptable_java_type (ret_type)) |
eff71ab0 | 560 | { |
2d01edd7 | 561 | error ("Java method %qD has non-Java return type %qT", |
0cbd7506 | 562 | method, ret_type); |
848eed92 | 563 | jerr = true; |
eff71ab0 | 564 | } |
f5c28a15 NS |
565 | |
566 | arg_types = TREE_CHAIN (arg_types); | |
567 | if (DECL_HAS_IN_CHARGE_PARM_P (method)) | |
568 | arg_types = TREE_CHAIN (arg_types); | |
569 | if (DECL_HAS_VTT_PARM_P (method)) | |
570 | arg_types = TREE_CHAIN (arg_types); | |
c8094d83 | 571 | |
eff71ab0 PB |
572 | for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types)) |
573 | { | |
574 | tree type = TREE_VALUE (arg_types); | |
848eed92 | 575 | if (!acceptable_java_type (type)) |
eff71ab0 | 576 | { |
662c2e83 LM |
577 | if (type != error_mark_node) |
578 | error ("Java method %qD has non-Java parameter type %qT", | |
579 | method, type); | |
848eed92 | 580 | jerr = true; |
eff71ab0 PB |
581 | } |
582 | } | |
848eed92 | 583 | return !jerr; |
eff71ab0 PB |
584 | } |
585 | ||
8d08fdba MS |
586 | /* Sanity check: report error if this function FUNCTION is not |
587 | really a member of the class (CTYPE) it is supposed to belong to. | |
77880ae4 | 588 | TEMPLATE_PARMS is used to specify the template parameters of a member |
c8094d83 | 589 | template passed as FUNCTION_DECL. If the member template is passed as a |
44021471 GB |
590 | TEMPLATE_DECL, it can be NULL since the parameters can be extracted |
591 | from the declaration. If the function is not a function template, it | |
592 | must be NULL. | |
f8c3b097 PC |
593 | It returns the original declaration for the function, NULL_TREE if |
594 | no declaration was found, error_mark_node if an error was emitted. */ | |
8d08fdba | 595 | |
f30432d7 | 596 | tree |
44021471 | 597 | check_classfn (tree ctype, tree function, tree template_parms) |
8d08fdba | 598 | { |
b9201622 | 599 | int ix; |
44021471 | 600 | bool is_template; |
7d3bec9d NS |
601 | tree pushed_scope; |
602 | ||
03017874 | 603 | if (DECL_USE_TEMPLATE (function) |
74b846e0 MM |
604 | && !(TREE_CODE (function) == TEMPLATE_DECL |
605 | && DECL_TEMPLATE_SPECIALIZATION (function)) | |
c7222c02 | 606 | && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (function))) |
03017874 MM |
607 | /* Since this is a specialization of a member template, |
608 | we're not going to find the declaration in the class. | |
609 | For example, in: | |
c8094d83 | 610 | |
0cbd7506 MS |
611 | struct S { template <typename T> void f(T); }; |
612 | template <> void S::f(int); | |
c8094d83 | 613 | |
03017874 MM |
614 | we're not going to find `S::f(int)', but there's no |
615 | reason we should, either. We let our callers know we didn't | |
616 | find the method, but we don't complain. */ | |
617 | return NULL_TREE; | |
b9201622 | 618 | |
44021471 GB |
619 | /* Basic sanity check: for a template function, the template parameters |
620 | either were not passed, or they are the same of DECL_TEMPLATE_PARMS. */ | |
621 | if (TREE_CODE (function) == TEMPLATE_DECL) | |
622 | { | |
1dbc1ae7 JM |
623 | if (template_parms |
624 | && !comp_template_parms (template_parms, | |
625 | DECL_TEMPLATE_PARMS (function))) | |
626 | { | |
627 | error ("template parameter lists provided don't match the " | |
628 | "template parameters of %qD", function); | |
629 | return error_mark_node; | |
630 | } | |
44021471 GB |
631 | template_parms = DECL_TEMPLATE_PARMS (function); |
632 | } | |
633 | ||
5b8e011c | 634 | /* OK, is this a definition of a member template? */ |
44021471 | 635 | is_template = (template_parms != NULL_TREE); |
5b8e011c | 636 | |
7d3bec9d NS |
637 | /* We must enter the scope here, because conversion operators are |
638 | named by target type, and type equivalence relies on typenames | |
639 | resolving within the scope of CTYPE. */ | |
640 | pushed_scope = push_scope (ctype); | |
c7222c02 | 641 | ix = class_method_index_for_fn (complete_type (ctype), function); |
b9201622 | 642 | if (ix >= 0) |
8d08fdba | 643 | { |
d4e6fecb | 644 | VEC(tree,gc) *methods = CLASSTYPE_METHOD_VEC (ctype); |
dd1b7476 | 645 | tree fndecls, fndecl = 0; |
b9201622 NS |
646 | bool is_conv_op; |
647 | const char *format = NULL; | |
c8094d83 | 648 | |
aaaa46d2 | 649 | for (fndecls = VEC_index (tree, methods, ix); |
b9201622 NS |
650 | fndecls; fndecls = OVL_NEXT (fndecls)) |
651 | { | |
652 | tree p1, p2; | |
c8094d83 | 653 | |
b9201622 NS |
654 | fndecl = OVL_CURRENT (fndecls); |
655 | p1 = TYPE_ARG_TYPES (TREE_TYPE (function)); | |
656 | p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl)); | |
657 | ||
658 | /* We cannot simply call decls_match because this doesn't | |
659 | work for static member functions that are pretending to | |
660 | be methods, and because the name may have been changed by | |
c8094d83 MS |
661 | asm("new_name"). */ |
662 | ||
b9201622 NS |
663 | /* Get rid of the this parameter on functions that become |
664 | static. */ | |
665 | if (DECL_STATIC_FUNCTION_P (fndecl) | |
666 | && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE) | |
667 | p1 = TREE_CHAIN (p1); | |
5b8e011c JM |
668 | |
669 | /* A member template definition only matches a member template | |
670 | declaration. */ | |
671 | if (is_template != (TREE_CODE (fndecl) == TEMPLATE_DECL)) | |
672 | continue; | |
c8094d83 | 673 | |
b9201622 NS |
674 | if (same_type_p (TREE_TYPE (TREE_TYPE (function)), |
675 | TREE_TYPE (TREE_TYPE (fndecl))) | |
676 | && compparms (p1, p2) | |
44021471 | 677 | && (!is_template |
c8094d83 | 678 | || comp_template_parms (template_parms, |
44021471 | 679 | DECL_TEMPLATE_PARMS (fndecl))) |
b9201622 NS |
680 | && (DECL_TEMPLATE_SPECIALIZATION (function) |
681 | == DECL_TEMPLATE_SPECIALIZATION (fndecl)) | |
682 | && (!DECL_TEMPLATE_SPECIALIZATION (function) | |
c8094d83 | 683 | || (DECL_TI_TEMPLATE (function) |
b9201622 | 684 | == DECL_TI_TEMPLATE (fndecl)))) |
14d22dd6 | 685 | break; |
b9201622 | 686 | } |
14d22dd6 | 687 | if (fndecls) |
7d3bec9d NS |
688 | { |
689 | if (pushed_scope) | |
690 | pop_scope (pushed_scope); | |
691 | return OVL_CURRENT (fndecls); | |
692 | } | |
693 | ||
402b8cf6 AH |
694 | error_at (DECL_SOURCE_LOCATION (function), |
695 | "prototype for %q#D does not match any in class %qT", | |
696 | function, ctype); | |
b9201622 NS |
697 | is_conv_op = DECL_CONV_FN_P (fndecl); |
698 | ||
699 | if (is_conv_op) | |
700 | ix = CLASSTYPE_FIRST_CONVERSION_SLOT; | |
aaaa46d2 | 701 | fndecls = VEC_index (tree, methods, ix); |
b9201622 | 702 | while (fndecls) |
8d08fdba | 703 | { |
b9201622 NS |
704 | fndecl = OVL_CURRENT (fndecls); |
705 | fndecls = OVL_NEXT (fndecls); | |
706 | ||
707 | if (!fndecls && is_conv_op) | |
8d08fdba | 708 | { |
508a1c9c | 709 | if (VEC_length (tree, methods) > (size_t) ++ix) |
8d08fdba | 710 | { |
aaaa46d2 | 711 | fndecls = VEC_index (tree, methods, ix); |
b9201622 | 712 | if (!DECL_CONV_FN_P (OVL_CURRENT (fndecls))) |
8145f082 | 713 | { |
b9201622 NS |
714 | fndecls = NULL_TREE; |
715 | is_conv_op = false; | |
8145f082 | 716 | } |
8d08fdba | 717 | } |
b9201622 NS |
718 | else |
719 | is_conv_op = false; | |
8d08fdba | 720 | } |
b9201622 | 721 | if (format) |
dee15844 | 722 | format = " %+#D"; |
b9201622 | 723 | else if (fndecls) |
dee15844 | 724 | format = N_("candidates are: %+#D"); |
b9201622 | 725 | else |
dee15844 JM |
726 | format = N_("candidate is: %+#D"); |
727 | error (format, fndecl); | |
8d08fdba MS |
728 | } |
729 | } | |
b9201622 NS |
730 | else if (!COMPLETE_TYPE_P (ctype)) |
731 | cxx_incomplete_type_error (function, ctype); | |
8d08fdba | 732 | else |
a82f93ac SE |
733 | error ("no %q#D member function declared in class %qT", |
734 | function, ctype); | |
8d08fdba | 735 | |
7d3bec9d NS |
736 | if (pushed_scope) |
737 | pop_scope (pushed_scope); | |
f8c3b097 | 738 | return error_mark_node; |
8d08fdba MS |
739 | } |
740 | ||
4684cd27 MM |
741 | /* DECL is a function with vague linkage. Remember it so that at the |
742 | end of the translation unit we can decide whether or not to emit | |
743 | it. */ | |
744 | ||
745 | void | |
746 | note_vague_linkage_fn (tree decl) | |
747 | { | |
783a452c JM |
748 | DECL_DEFER_OUTPUT (decl) = 1; |
749 | VEC_safe_push (tree, gc, deferred_fns, decl); | |
4684cd27 MM |
750 | } |
751 | ||
fa8d6e85 | 752 | /* We have just processed the DECL, which is a static data member. |
d174af6c | 753 | The other parameters are as for cp_finish_decl. */ |
fa8d6e85 MM |
754 | |
755 | void | |
3db45ab5 | 756 | finish_static_data_member_decl (tree decl, |
d174af6c MM |
757 | tree init, bool init_const_expr_p, |
758 | tree asmspec_tree, | |
0cbd7506 | 759 | int flags) |
fa8d6e85 | 760 | { |
1f6e1acc AS |
761 | DECL_CONTEXT (decl) = current_class_type; |
762 | ||
fa8d6e85 | 763 | /* We cannot call pushdecl here, because that would fill in the |
46ccf50a | 764 | TREE_CHAIN of our decl. Instead, we modify cp_finish_decl to do |
fa8d6e85 | 765 | the right thing, namely, to put this decl out straight away. */ |
92643fea | 766 | |
42ccbf3d JJ |
767 | if (! processing_template_decl) |
768 | VEC_safe_push (tree, gc, pending_statics, decl); | |
0aafb128 | 769 | |
65f36ac8 | 770 | if (LOCAL_CLASS_P (current_class_type)) |
cbe5f3b3 | 771 | permerror (input_location, "local class %q#T shall not have static data member %q#D", |
37ec60ed | 772 | current_class_type, decl); |
65f36ac8 | 773 | |
fa8d6e85 | 774 | DECL_IN_AGGR_P (decl) = 1; |
fa8d6e85 | 775 | |
48326487 JM |
776 | if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE |
777 | && TYPE_DOMAIN (TREE_TYPE (decl)) == NULL_TREE) | |
778 | SET_VAR_HAD_UNKNOWN_BOUND (decl); | |
779 | ||
d174af6c | 780 | cp_finish_decl (decl, init, init_const_expr_p, asmspec_tree, flags); |
fa8d6e85 MM |
781 | } |
782 | ||
84dc00e8 | 783 | /* DECLARATOR and DECLSPECS correspond to a class member. The other |
d174af6c | 784 | parameters are as for cp_finish_decl. Return the DECL for the |
3db45ab5 | 785 | class member declared. */ |
8d08fdba MS |
786 | |
787 | tree | |
c8094d83 MS |
788 | grokfield (const cp_declarator *declarator, |
789 | cp_decl_specifier_seq *declspecs, | |
d174af6c MM |
790 | tree init, bool init_const_expr_p, |
791 | tree asmspec_tree, | |
0cbd7506 | 792 | tree attrlist) |
8d08fdba | 793 | { |
59387d2e | 794 | tree value; |
9c0758dd | 795 | const char *asmspec = 0; |
6060a796 | 796 | int flags = LOOKUP_ONLYCONVERTING; |
3937f036 | 797 | tree name; |
8d08fdba | 798 | |
8d08fdba MS |
799 | if (init |
800 | && TREE_CODE (init) == TREE_LIST | |
801 | && TREE_VALUE (init) == error_mark_node | |
802 | && TREE_CHAIN (init) == NULL_TREE) | |
cffa8729 | 803 | init = NULL_TREE; |
8d08fdba | 804 | |
91d231cb | 805 | value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist); |
89f1a6ec | 806 | if (! value || error_operand_p (value)) |
3ddfb0e6 | 807 | /* friend or constructor went bad. */ |
04d57dd5 ZW |
808 | return error_mark_node; |
809 | ||
810 | if (TREE_CODE (value) == TYPE_DECL && init) | |
811 | { | |
67dc1f24 | 812 | error ("typedef %qD is initialized (use decltype instead)", value); |
04d57dd5 ZW |
813 | init = NULL_TREE; |
814 | } | |
8d08fdba MS |
815 | |
816 | /* Pass friendly classes back. */ | |
8db1028e NS |
817 | if (value == void_type_node) |
818 | return value; | |
819 | ||
9bcb9aae | 820 | /* Pass friend decls back. */ |
8db1028e NS |
821 | if ((TREE_CODE (value) == FUNCTION_DECL |
822 | || TREE_CODE (value) == TEMPLATE_DECL) | |
823 | && DECL_CONTEXT (value) != current_class_type) | |
824 | return value; | |
8d08fdba | 825 | |
3937f036 PC |
826 | name = DECL_NAME (value); |
827 | ||
828 | if (name != NULL_TREE) | |
829 | { | |
830 | if (TREE_CODE (name) == TEMPLATE_ID_EXPR) | |
831 | { | |
832 | error ("explicit template argument list not allowed"); | |
833 | return error_mark_node; | |
834 | } | |
835 | ||
836 | if (IDENTIFIER_POINTER (name)[0] == '_' | |
837 | && ! strcmp (IDENTIFIER_POINTER (name), "_vptr")) | |
838 | error ("member %qD conflicts with virtual function table field name", | |
839 | value); | |
840 | } | |
8d08fdba MS |
841 | |
842 | /* Stash away type declarations. */ | |
843 | if (TREE_CODE (value) == TYPE_DECL) | |
844 | { | |
845 | DECL_NONLOCAL (value) = 1; | |
700f8a87 | 846 | DECL_CONTEXT (value) = current_class_type; |
8145f082 | 847 | |
9188c363 MM |
848 | if (processing_template_decl) |
849 | value = push_template_decl (value); | |
850 | ||
9596e064 | 851 | if (attrlist) |
01d685cc JM |
852 | { |
853 | int attrflags = 0; | |
854 | ||
855 | /* If this is a typedef that names the class for linkage purposes | |
856 | (7.1.3p8), apply any attributes directly to the type. */ | |
857 | if (TAGGED_TYPE_P (TREE_TYPE (value)) | |
858 | && value == TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (value)))) | |
859 | attrflags = ATTR_FLAG_TYPE_IN_PLACE; | |
860 | ||
861 | cplus_decl_attributes (&value, attrlist, attrflags); | |
862 | } | |
9596e064 | 863 | |
4fdaccea DS |
864 | if (declspecs->specs[(int)ds_typedef] |
865 | && TREE_TYPE (value) != error_mark_node | |
866 | && TYPE_NAME (TYPE_MAIN_VARIANT (TREE_TYPE (value))) != value) | |
9cf10655 | 867 | cp_set_underlying_type (value); |
d0940d56 | 868 | |
8d08fdba MS |
869 | return value; |
870 | } | |
871 | ||
8d08fdba MS |
872 | if (DECL_IN_AGGR_P (value)) |
873 | { | |
2d01edd7 | 874 | error ("%qD is already defined in %qT", value, DECL_CONTEXT (value)); |
8d08fdba MS |
875 | return void_type_node; |
876 | } | |
877 | ||
4f543d15 | 878 | if (asmspec_tree && asmspec_tree != error_mark_node) |
8d08fdba MS |
879 | asmspec = TREE_STRING_POINTER (asmspec_tree); |
880 | ||
881 | if (init) | |
882 | { | |
6eabb241 | 883 | if (TREE_CODE (value) == FUNCTION_DECL) |
8d08fdba | 884 | { |
515e6a84 GB |
885 | /* Initializers for functions are rejected early in the parser. |
886 | If we get here, it must be a pure specifier for a method. */ | |
b87d79e6 JM |
887 | if (init == ridpointers[(int)RID_DELETE]) |
888 | { | |
889 | DECL_DELETED_FN (value) = 1; | |
890 | DECL_DECLARED_INLINE_P (value) = 1; | |
891 | DECL_INITIAL (value) = error_mark_node; | |
892 | } | |
893 | else if (init == ridpointers[(int)RID_DEFAULT]) | |
894 | { | |
20f2653e | 895 | if (defaultable_fn_check (value)) |
b87d79e6 JM |
896 | { |
897 | DECL_DEFAULTED_FN (value) = 1; | |
898 | DECL_INITIALIZED_IN_CLASS_P (value) = 1; | |
899 | DECL_DECLARED_INLINE_P (value) = 1; | |
b87d79e6 JM |
900 | } |
901 | } | |
902 | else if (TREE_CODE (TREE_TYPE (value)) == METHOD_TYPE) | |
ea7ce50b | 903 | { |
7801b86a SM |
904 | if (integer_zerop (init)) |
905 | DECL_PURE_VIRTUAL_P (value) = 1; | |
906 | else if (error_operand_p (init)) | |
907 | ; /* An error has already been reported. */ | |
908 | else | |
909 | error ("invalid initializer for member function %qD", | |
910 | value); | |
ea7ce50b VR |
911 | } |
912 | else | |
913 | { | |
914 | gcc_assert (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE); | |
915 | error ("initializer specified for static member function %qD", | |
916 | value); | |
917 | } | |
8d08fdba | 918 | } |
5b605f68 | 919 | else if (pedantic && TREE_CODE (value) != VAR_DECL) |
a0a33927 MS |
920 | /* Already complained in grokdeclarator. */ |
921 | init = NULL_TREE; | |
4038c495 | 922 | else if (!processing_template_decl) |
8d08fdba | 923 | { |
4038c495 GB |
924 | if (TREE_CODE (init) == CONSTRUCTOR) |
925 | init = digest_init (TREE_TYPE (value), init); | |
fa2200cb | 926 | init = maybe_constant_init (init); |
dcba9b0f | 927 | |
4038c495 | 928 | if (init != error_mark_node && !TREE_CONSTANT (init)) |
8d08fdba | 929 | { |
4038c495 GB |
930 | /* We can allow references to things that are effectively |
931 | static, since references are initialized with the | |
932 | address. */ | |
933 | if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE | |
934 | || (TREE_STATIC (init) == 0 | |
935 | && (!DECL_P (init) || DECL_EXTERNAL (init) == 0))) | |
8d08fdba | 936 | { |
4038c495 GB |
937 | error ("field initializer is not constant"); |
938 | init = error_mark_node; | |
8d08fdba MS |
939 | } |
940 | } | |
941 | } | |
942 | } | |
943 | ||
ddb45080 | 944 | if (processing_template_decl |
5566b478 | 945 | && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL)) |
89f1a6ec MM |
946 | { |
947 | value = push_template_decl (value); | |
948 | if (error_operand_p (value)) | |
949 | return error_mark_node; | |
950 | } | |
5566b478 | 951 | |
45537677 | 952 | if (attrlist) |
91d231cb | 953 | cplus_decl_attributes (&value, attrlist, 0); |
45537677 | 954 | |
8dc2b103 | 955 | switch (TREE_CODE (value)) |
8d08fdba | 956 | { |
8dc2b103 | 957 | case VAR_DECL: |
d174af6c MM |
958 | finish_static_data_member_decl (value, init, init_const_expr_p, |
959 | asmspec_tree, flags); | |
8d08fdba | 960 | return value; |
8dc2b103 NS |
961 | |
962 | case FIELD_DECL: | |
8d08fdba | 963 | if (asmspec) |
9e637a26 | 964 | error ("%<asm%> specifiers are not permitted on non-static data members"); |
8d08fdba MS |
965 | if (DECL_INITIAL (value) == error_mark_node) |
966 | init = error_mark_node; | |
3db45ab5 | 967 | cp_finish_decl (value, init, /*init_const_expr_p=*/false, |
d174af6c | 968 | NULL_TREE, flags); |
8d08fdba MS |
969 | DECL_INITIAL (value) = init; |
970 | DECL_IN_AGGR_P (value) = 1; | |
971 | return value; | |
8dc2b103 NS |
972 | |
973 | case FUNCTION_DECL: | |
6060a796 | 974 | if (asmspec) |
0e6df31e | 975 | set_user_assembler_name (value, asmspec); |
c8094d83 | 976 | |
3db45ab5 MS |
977 | cp_finish_decl (value, |
978 | /*init=*/NULL_TREE, | |
979 | /*init_const_expr_p=*/false, | |
d174af6c | 980 | asmspec_tree, flags); |
8d08fdba MS |
981 | |
982 | /* Pass friends back this way. */ | |
983 | if (DECL_FRIEND_P (value)) | |
984 | return void_type_node; | |
985 | ||
986 | DECL_IN_AGGR_P (value) = 1; | |
987 | return value; | |
c8094d83 | 988 | |
8dc2b103 NS |
989 | default: |
990 | gcc_unreachable (); | |
8d08fdba | 991 | } |
8d08fdba MS |
992 | return NULL_TREE; |
993 | } | |
994 | ||
995 | /* Like `grokfield', but for bitfields. | |
996 | WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */ | |
997 | ||
998 | tree | |
c8094d83 | 999 | grokbitfield (const cp_declarator *declarator, |
a6d9bc9d SM |
1000 | cp_decl_specifier_seq *declspecs, tree width, |
1001 | tree attrlist) | |
8d08fdba | 1002 | { |
a6d9bc9d | 1003 | tree value = grokdeclarator (declarator, declspecs, BITFIELD, 0, &attrlist); |
8d08fdba | 1004 | |
344f237b LM |
1005 | if (value == error_mark_node) |
1006 | return NULL_TREE; /* friends went bad. */ | |
8d08fdba MS |
1007 | |
1008 | /* Pass friendly classes back. */ | |
1009 | if (TREE_CODE (value) == VOID_TYPE) | |
1010 | return void_type_node; | |
1011 | ||
550a799d | 1012 | if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (value)) |
4c9fb870 LM |
1013 | && (POINTER_TYPE_P (value) |
1014 | || !dependent_type_p (TREE_TYPE (value)))) | |
1015 | { | |
1016 | error ("bit-field %qD with non-integral type", value); | |
1017 | return error_mark_node; | |
1018 | } | |
1019 | ||
8d08fdba MS |
1020 | if (TREE_CODE (value) == TYPE_DECL) |
1021 | { | |
2d01edd7 | 1022 | error ("cannot declare %qD to be a bit-field type", value); |
8d08fdba MS |
1023 | return NULL_TREE; |
1024 | } | |
1025 | ||
33bd39a2 | 1026 | /* Usually, finish_struct_1 catches bitfields with invalid types. |
ae58fa02 MM |
1027 | But, in the case of bitfields with function type, we confuse |
1028 | ourselves into thinking they are member functions, so we must | |
1029 | check here. */ | |
1030 | if (TREE_CODE (value) == FUNCTION_DECL) | |
1031 | { | |
2d01edd7 | 1032 | error ("cannot declare bit-field %qD with function type", |
33bd39a2 | 1033 | DECL_NAME (value)); |
ae58fa02 MM |
1034 | return NULL_TREE; |
1035 | } | |
1036 | ||
8d08fdba MS |
1037 | if (DECL_IN_AGGR_P (value)) |
1038 | { | |
2d01edd7 | 1039 | error ("%qD is already defined in the class %qT", value, |
0cbd7506 | 1040 | DECL_CONTEXT (value)); |
8d08fdba MS |
1041 | return void_type_node; |
1042 | } | |
1043 | ||
8d08fdba MS |
1044 | if (TREE_STATIC (value)) |
1045 | { | |
2d01edd7 | 1046 | error ("static member %qD cannot be a bit-field", value); |
8d08fdba MS |
1047 | return NULL_TREE; |
1048 | } | |
3600f678 | 1049 | cp_finish_decl (value, NULL_TREE, false, NULL_TREE, 0); |
8d08fdba MS |
1050 | |
1051 | if (width != error_mark_node) | |
1052 | { | |
441b624e JM |
1053 | /* The width must be an integer type. */ |
1054 | if (!INTEGRAL_OR_UNSCOPED_ENUMERATION_TYPE_P (TREE_TYPE (width))) | |
1055 | error ("width of bit-field %qD has non-integral type %qT", value, | |
1056 | TREE_TYPE (width)); | |
5566b478 MS |
1057 | constant_expression_warning (width); |
1058 | DECL_INITIAL (value) = width; | |
162bc98d | 1059 | SET_DECL_C_BIT_FIELD (value); |
8d08fdba MS |
1060 | } |
1061 | ||
1062 | DECL_IN_AGGR_P (value) = 1; | |
a6d9bc9d SM |
1063 | |
1064 | if (attrlist) | |
1065 | cplus_decl_attributes (&value, attrlist, /*flags=*/0); | |
1066 | ||
8d08fdba MS |
1067 | return value; |
1068 | } | |
1069 | ||
8d08fdba | 1070 | \f |
4f4141ff JM |
1071 | /* Returns true iff ATTR is an attribute which needs to be applied at |
1072 | instantiation time rather than template definition time. */ | |
1073 | ||
a7f6bc8c JM |
1074 | static bool |
1075 | is_late_template_attribute (tree attr, tree decl) | |
4f4141ff JM |
1076 | { |
1077 | tree name = TREE_PURPOSE (attr); | |
5044ab0e | 1078 | tree args = TREE_VALUE (attr); |
a7f6bc8c | 1079 | const struct attribute_spec *spec = lookup_attribute_spec (name); |
160b8b80 | 1080 | tree arg; |
a7f6bc8c | 1081 | |
533007c1 JM |
1082 | if (!spec) |
1083 | /* Unknown attribute. */ | |
1084 | return false; | |
1085 | ||
5dc11954 JJ |
1086 | /* Attribute weak handling wants to write out assembly right away. */ |
1087 | if (is_attribute_p ("weak", name)) | |
8d2eb304 JM |
1088 | return true; |
1089 | ||
160b8b80 JM |
1090 | /* If any of the arguments are dependent expressions, we can't evaluate |
1091 | the attribute until instantiation time. */ | |
1092 | for (arg = args; arg; arg = TREE_CHAIN (arg)) | |
1093 | { | |
1094 | tree t = TREE_VALUE (arg); | |
b2febff9 JJ |
1095 | |
1096 | /* If the first attribute argument is an identifier, only consider | |
1097 | second and following arguments. Attributes like mode, format, | |
1098 | cleanup and several target specific attributes aren't late | |
1099 | just because they have an IDENTIFIER_NODE as first argument. */ | |
1100 | if (arg == args && TREE_CODE (t) == IDENTIFIER_NODE) | |
1101 | continue; | |
1102 | ||
160b8b80 JM |
1103 | if (value_dependent_expression_p (t) |
1104 | || type_dependent_expression_p (t)) | |
1105 | return true; | |
1106 | } | |
1107 | ||
1108 | if (TREE_CODE (decl) == TYPE_DECL | |
1109 | || TYPE_P (decl) | |
1110 | || spec->type_required) | |
a7f6bc8c JM |
1111 | { |
1112 | tree type = TYPE_P (decl) ? decl : TREE_TYPE (decl); | |
1113 | ||
1114 | /* We can't apply any attributes to a completely unknown type until | |
1115 | instantiation time. */ | |
1116 | enum tree_code code = TREE_CODE (type); | |
1117 | if (code == TEMPLATE_TYPE_PARM | |
1118 | || code == BOUND_TEMPLATE_TEMPLATE_PARM | |
1119 | || code == TYPENAME_TYPE) | |
1120 | return true; | |
1d555e26 JM |
1121 | /* Also defer most attributes on dependent types. This is not |
1122 | necessary in all cases, but is the better default. */ | |
1123 | else if (dependent_type_p (type) | |
1124 | /* But attribute visibility specifically works on | |
1125 | templates. */ | |
1126 | && !is_attribute_p ("visibility", name)) | |
160b8b80 | 1127 | return true; |
a7f6bc8c JM |
1128 | else |
1129 | return false; | |
1130 | } | |
4f4141ff JM |
1131 | else |
1132 | return false; | |
1133 | } | |
1134 | ||
1135 | /* ATTR_P is a list of attributes. Remove any attributes which need to be | |
a7f6bc8c JM |
1136 | applied at instantiation time and return them. If IS_DEPENDENT is true, |
1137 | the declaration itself is dependent, so all attributes should be applied | |
1138 | at instantiation time. */ | |
4f4141ff JM |
1139 | |
1140 | static tree | |
a7f6bc8c | 1141 | splice_template_attributes (tree *attr_p, tree decl) |
4f4141ff JM |
1142 | { |
1143 | tree *p = attr_p; | |
1144 | tree late_attrs = NULL_TREE; | |
1145 | tree *q = &late_attrs; | |
1146 | ||
1147 | if (!p) | |
1148 | return NULL_TREE; | |
1149 | ||
1150 | for (; *p; ) | |
1151 | { | |
a7f6bc8c | 1152 | if (is_late_template_attribute (*p, decl)) |
4f4141ff | 1153 | { |
a7f6bc8c | 1154 | ATTR_IS_DEPENDENT (*p) = 1; |
4f4141ff JM |
1155 | *q = *p; |
1156 | *p = TREE_CHAIN (*p); | |
1157 | q = &TREE_CHAIN (*q); | |
1158 | *q = NULL_TREE; | |
1159 | } | |
1160 | else | |
1161 | p = &TREE_CHAIN (*p); | |
1162 | } | |
1163 | ||
1164 | return late_attrs; | |
1165 | } | |
1166 | ||
1167 | /* Remove any late attributes from the list in ATTR_P and attach them to | |
1168 | DECL_P. */ | |
1169 | ||
1170 | static void | |
1171 | save_template_attributes (tree *attr_p, tree *decl_p) | |
1172 | { | |
a7f6bc8c | 1173 | tree late_attrs = splice_template_attributes (attr_p, *decl_p); |
4f4141ff | 1174 | tree *q; |
1db54f4e | 1175 | tree old_attrs = NULL_TREE; |
4f4141ff JM |
1176 | |
1177 | if (!late_attrs) | |
1178 | return; | |
1179 | ||
1180 | if (DECL_P (*decl_p)) | |
1181 | q = &DECL_ATTRIBUTES (*decl_p); | |
1182 | else | |
1183 | q = &TYPE_ATTRIBUTES (*decl_p); | |
1184 | ||
1db54f4e DG |
1185 | old_attrs = *q; |
1186 | ||
1187 | /* Place the late attributes at the beginning of the attribute | |
1188 | list. */ | |
1189 | TREE_CHAIN (tree_last (late_attrs)) = *q; | |
4f4141ff | 1190 | *q = late_attrs; |
1db54f4e DG |
1191 | |
1192 | if (!DECL_P (*decl_p) && *decl_p == TYPE_MAIN_VARIANT (*decl_p)) | |
1193 | { | |
1194 | /* We've added new attributes directly to the main variant, so | |
1195 | now we need to update all of the other variants to include | |
1196 | these new attributes. */ | |
1197 | tree variant; | |
1198 | for (variant = TYPE_NEXT_VARIANT (*decl_p); variant; | |
1199 | variant = TYPE_NEXT_VARIANT (variant)) | |
1200 | { | |
1201 | gcc_assert (TYPE_ATTRIBUTES (variant) == old_attrs); | |
1202 | TYPE_ATTRIBUTES (variant) = TYPE_ATTRIBUTES (*decl_p); | |
1203 | } | |
1204 | } | |
4f4141ff JM |
1205 | } |
1206 | ||
5dc11954 JJ |
1207 | /* Like reconstruct_complex_type, but handle also template trees. */ |
1208 | ||
1209 | tree | |
1210 | cp_reconstruct_complex_type (tree type, tree bottom) | |
1211 | { | |
1212 | tree inner, outer; | |
1213 | ||
1214 | if (TREE_CODE (type) == POINTER_TYPE) | |
1215 | { | |
1216 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1217 | outer = build_pointer_type_for_mode (inner, TYPE_MODE (type), | |
1218 | TYPE_REF_CAN_ALIAS_ALL (type)); | |
1219 | } | |
1220 | else if (TREE_CODE (type) == REFERENCE_TYPE) | |
1221 | { | |
1222 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1223 | outer = build_reference_type_for_mode (inner, TYPE_MODE (type), | |
1224 | TYPE_REF_CAN_ALIAS_ALL (type)); | |
1225 | } | |
1226 | else if (TREE_CODE (type) == ARRAY_TYPE) | |
1227 | { | |
1228 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1229 | outer = build_cplus_array_type (inner, TYPE_DOMAIN (type)); | |
1230 | /* Don't call cp_build_qualified_type on ARRAY_TYPEs, the | |
1231 | element type qualification will be handled by the recursive | |
1232 | cp_reconstruct_complex_type call and cp_build_qualified_type | |
1233 | for ARRAY_TYPEs changes the element type. */ | |
1234 | return outer; | |
1235 | } | |
1236 | else if (TREE_CODE (type) == FUNCTION_TYPE) | |
1237 | { | |
1238 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1239 | outer = build_function_type (inner, TYPE_ARG_TYPES (type)); | |
2872152c | 1240 | outer = apply_memfn_quals (outer, type_memfn_quals (type)); |
5dc11954 JJ |
1241 | } |
1242 | else if (TREE_CODE (type) == METHOD_TYPE) | |
1243 | { | |
1244 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1245 | /* The build_method_type_directly() routine prepends 'this' to argument list, | |
1246 | so we must compensate by getting rid of it. */ | |
1247 | outer | |
1248 | = build_method_type_directly | |
1249 | (TREE_TYPE (TREE_VALUE (TYPE_ARG_TYPES (type))), | |
1250 | inner, | |
1251 | TREE_CHAIN (TYPE_ARG_TYPES (type))); | |
1252 | } | |
1253 | else if (TREE_CODE (type) == OFFSET_TYPE) | |
1254 | { | |
1255 | inner = cp_reconstruct_complex_type (TREE_TYPE (type), bottom); | |
1256 | outer = build_offset_type (TYPE_OFFSET_BASETYPE (type), inner); | |
1257 | } | |
1258 | else | |
1259 | return bottom; | |
1260 | ||
3c3905fc JM |
1261 | if (TYPE_ATTRIBUTES (type)) |
1262 | outer = cp_build_type_attribute_variant (outer, TYPE_ATTRIBUTES (type)); | |
a3360e77 | 1263 | return cp_build_qualified_type (outer, cp_type_quals (type)); |
5dc11954 JJ |
1264 | } |
1265 | ||
4f4141ff JM |
1266 | /* Like decl_attributes, but handle C++ complexity. */ |
1267 | ||
28cbf42c | 1268 | void |
848eed92 | 1269 | cplus_decl_attributes (tree *decl, tree attributes, int flags) |
8d08fdba | 1270 | { |
6ae9b875 | 1271 | if (*decl == NULL_TREE || *decl == void_type_node |
4f4141ff JM |
1272 | || *decl == error_mark_node |
1273 | || attributes == NULL_TREE) | |
e8abc66f MS |
1274 | return; |
1275 | ||
4f4141ff JM |
1276 | if (processing_template_decl) |
1277 | { | |
7b3e2d46 DG |
1278 | if (check_for_bare_parameter_packs (attributes)) |
1279 | return; | |
1280 | ||
4f4141ff JM |
1281 | save_template_attributes (&attributes, decl); |
1282 | if (attributes == NULL_TREE) | |
1283 | return; | |
1284 | } | |
1285 | ||
59387d2e JM |
1286 | if (TREE_CODE (*decl) == TEMPLATE_DECL) |
1287 | decl = &DECL_TEMPLATE_RESULT (*decl); | |
e8abc66f | 1288 | |
91d231cb | 1289 | decl_attributes (decl, attributes, flags); |
863adfc0 | 1290 | |
59387d2e JM |
1291 | if (TREE_CODE (*decl) == TYPE_DECL) |
1292 | SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl)); | |
8d08fdba | 1293 | } |
8d08fdba | 1294 | \f |
744b12b6 | 1295 | /* Walks through the namespace- or function-scope anonymous union |
9bfa80fb | 1296 | OBJECT, with the indicated TYPE, building appropriate VAR_DECLs. |
744b12b6 | 1297 | Returns one of the fields for use in the mangled name. */ |
f237d906 | 1298 | |
0ca7178c | 1299 | static tree |
744b12b6 | 1300 | build_anon_union_vars (tree type, tree object) |
ce1b9eb9 | 1301 | { |
ce1b9eb9 | 1302 | tree main_decl = NULL_TREE; |
cb96daa2 | 1303 | tree field; |
ce1b9eb9 | 1304 | |
6bdb8141 JM |
1305 | /* Rather than write the code to handle the non-union case, |
1306 | just give an error. */ | |
1307 | if (TREE_CODE (type) != UNION_TYPE) | |
1308 | error ("anonymous struct not inside named type"); | |
1309 | ||
c8094d83 MS |
1310 | for (field = TYPE_FIELDS (type); |
1311 | field != NULL_TREE; | |
910ad8de | 1312 | field = DECL_CHAIN (field)) |
ce1b9eb9 | 1313 | { |
cb96daa2 | 1314 | tree decl; |
0ca7178c | 1315 | tree ref; |
8ebeee52 JM |
1316 | |
1317 | if (DECL_ARTIFICIAL (field)) | |
ce1b9eb9 | 1318 | continue; |
8ebeee52 JM |
1319 | if (TREE_CODE (field) != FIELD_DECL) |
1320 | { | |
cbe5f3b3 | 1321 | permerror (input_location, "%q+#D invalid; an anonymous union can only " |
37ec60ed | 1322 | "have non-static data members", field); |
8ebeee52 JM |
1323 | continue; |
1324 | } | |
ce1b9eb9 | 1325 | |
cb96daa2 | 1326 | if (TREE_PRIVATE (field)) |
cbe5f3b3 | 1327 | permerror (input_location, "private member %q+#D in anonymous union", field); |
cb96daa2 | 1328 | else if (TREE_PROTECTED (field)) |
cbe5f3b3 | 1329 | permerror (input_location, "protected member %q+#D in anonymous union", field); |
cb96daa2 | 1330 | |
8fbc5ae7 | 1331 | if (processing_template_decl) |
44de5aeb RK |
1332 | ref = build_min_nt (COMPONENT_REF, object, |
1333 | DECL_NAME (field), NULL_TREE); | |
8fbc5ae7 MM |
1334 | else |
1335 | ref = build_class_member_access_expr (object, field, NULL_TREE, | |
5ade1ed2 | 1336 | false, tf_warning_or_error); |
0ca7178c JM |
1337 | |
1338 | if (DECL_NAME (field)) | |
cb96daa2 | 1339 | { |
56b4ea3d RH |
1340 | tree base; |
1341 | ||
c2255bc4 AH |
1342 | decl = build_decl (input_location, |
1343 | VAR_DECL, DECL_NAME (field), TREE_TYPE (field)); | |
555551c2 | 1344 | DECL_ANON_UNION_VAR_P (decl) = 1; |
f208b768 | 1345 | DECL_ARTIFICIAL (decl) = 1; |
56b4ea3d RH |
1346 | |
1347 | base = get_base_address (object); | |
1348 | TREE_PUBLIC (decl) = TREE_PUBLIC (base); | |
1349 | TREE_STATIC (decl) = TREE_STATIC (base); | |
1350 | DECL_EXTERNAL (decl) = DECL_EXTERNAL (base); | |
1351 | ||
9bfa80fb RH |
1352 | SET_DECL_VALUE_EXPR (decl, ref); |
1353 | DECL_HAS_VALUE_EXPR_P (decl) = 1; | |
56b4ea3d | 1354 | |
cb96daa2 | 1355 | decl = pushdecl (decl); |
cb96daa2 | 1356 | } |
0ca7178c | 1357 | else if (ANON_AGGR_TYPE_P (TREE_TYPE (field))) |
744b12b6 | 1358 | decl = build_anon_union_vars (TREE_TYPE (field), ref); |
dd1b7476 KG |
1359 | else |
1360 | decl = 0; | |
cb96daa2 | 1361 | |
0ca7178c JM |
1362 | if (main_decl == NULL_TREE) |
1363 | main_decl = decl; | |
cb96daa2 | 1364 | } |
0ca7178c | 1365 | |
ce1b9eb9 MM |
1366 | return main_decl; |
1367 | } | |
1368 | ||
c050ec51 JM |
1369 | /* Finish off the processing of a UNION_TYPE structure. If the union is an |
1370 | anonymous union, then all members must be laid out together. PUBLIC_P | |
1371 | is nonzero if this union is not declared static. */ | |
e92cc029 | 1372 | |
8d08fdba | 1373 | void |
848eed92 | 1374 | finish_anon_union (tree anon_union_decl) |
8d08fdba | 1375 | { |
06c00c70 | 1376 | tree type; |
cb96daa2 | 1377 | tree main_decl; |
06c00c70 MM |
1378 | bool public_p; |
1379 | ||
1380 | if (anon_union_decl == error_mark_node) | |
1381 | return; | |
1382 | ||
1383 | type = TREE_TYPE (anon_union_decl); | |
1384 | public_p = TREE_PUBLIC (anon_union_decl); | |
8d08fdba | 1385 | |
a1c65f9f | 1386 | /* The VAR_DECL's context is the same as the TYPE's context. */ |
e5410b32 | 1387 | DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type)); |
c8094d83 | 1388 | |
cb96daa2 | 1389 | if (TYPE_FIELDS (type) == NULL_TREE) |
8d08fdba MS |
1390 | return; |
1391 | ||
1392 | if (public_p) | |
1393 | { | |
ff9f1a5d | 1394 | error ("namespace-scope anonymous aggregates must be static"); |
8d08fdba MS |
1395 | return; |
1396 | } | |
1397 | ||
744b12b6 | 1398 | main_decl = build_anon_union_vars (type, anon_union_decl); |
8bdb09cb VR |
1399 | if (main_decl == error_mark_node) |
1400 | return; | |
8fbc5ae7 | 1401 | if (main_decl == NULL_TREE) |
01f4137f | 1402 | { |
d4ee4d25 | 1403 | warning (0, "anonymous union with no members"); |
8fbc5ae7 MM |
1404 | return; |
1405 | } | |
bd9bb3d2 | 1406 | |
8fbc5ae7 MM |
1407 | if (!processing_template_decl) |
1408 | { | |
0ca7178c JM |
1409 | /* Use main_decl to set the mangled name. */ |
1410 | DECL_NAME (anon_union_decl) = DECL_NAME (main_decl); | |
68017cb4 | 1411 | maybe_commonize_var (anon_union_decl); |
0ca7178c JM |
1412 | mangle_decl (anon_union_decl); |
1413 | DECL_NAME (anon_union_decl) = NULL_TREE; | |
01f4137f | 1414 | } |
edebf865 | 1415 | |
0ca7178c JM |
1416 | pushdecl (anon_union_decl); |
1417 | if (building_stmt_tree () | |
1418 | && at_function_scope_p ()) | |
350fae66 | 1419 | add_decl_expr (anon_union_decl); |
0ca7178c | 1420 | else if (!processing_template_decl) |
0e6df31e | 1421 | rest_of_decl_compilation (anon_union_decl, |
0ca7178c | 1422 | toplevel_bindings_p (), at_eof); |
8d08fdba | 1423 | } |
8d08fdba MS |
1424 | \f |
1425 | /* Auxiliary functions to make type signatures for | |
1426 | `operator new' and `operator delete' correspond to | |
1427 | what compiler will be expecting. */ | |
1428 | ||
8d08fdba | 1429 | tree |
848eed92 | 1430 | coerce_new_type (tree type) |
8d08fdba | 1431 | { |
36791f1e NS |
1432 | int e = 0; |
1433 | tree args = TYPE_ARG_TYPES (type); | |
1434 | ||
50bc768d | 1435 | gcc_assert (TREE_CODE (type) == FUNCTION_TYPE); |
c8094d83 | 1436 | |
36791f1e | 1437 | if (!same_type_p (TREE_TYPE (type), ptr_type_node)) |
2d01edd7 GDR |
1438 | { |
1439 | e = 1; | |
1440 | error ("%<operator new%> must return type %qT", ptr_type_node); | |
1441 | } | |
36791f1e | 1442 | |
07021f8c | 1443 | if (args && args != void_list_node) |
36791f1e | 1444 | { |
07021f8c PC |
1445 | if (TREE_PURPOSE (args)) |
1446 | { | |
1447 | /* [basic.stc.dynamic.allocation] | |
1448 | ||
1449 | The first parameter shall not have an associated default | |
1450 | argument. */ | |
1451 | error ("the first parameter of %<operator new%> cannot " | |
1452 | "have a default argument"); | |
1453 | /* Throw away the default argument. */ | |
1454 | TREE_PURPOSE (args) = NULL_TREE; | |
1455 | } | |
1456 | ||
1457 | if (!same_type_p (TREE_VALUE (args), size_type_node)) | |
1458 | { | |
1459 | e = 2; | |
1460 | args = TREE_CHAIN (args); | |
1461 | } | |
36791f1e | 1462 | } |
07021f8c PC |
1463 | else |
1464 | e = 2; | |
1465 | ||
1466 | if (e == 2) | |
cbe5f3b3 | 1467 | permerror (input_location, "%<operator new%> takes type %<size_t%> (%qT) " |
37ec60ed | 1468 | "as first parameter", size_type_node); |
07021f8c | 1469 | |
36791f1e NS |
1470 | switch (e) |
1471 | { | |
1472 | case 2: | |
c9f8536c | 1473 | args = tree_cons (NULL_TREE, size_type_node, args); |
f4f206f4 | 1474 | /* Fall through. */ |
36791f1e NS |
1475 | case 1: |
1476 | type = build_exception_variant | |
0cbd7506 MS |
1477 | (build_function_type (ptr_type_node, args), |
1478 | TYPE_RAISES_EXCEPTIONS (type)); | |
f4f206f4 | 1479 | /* Fall through. */ |
36791f1e NS |
1480 | default:; |
1481 | } | |
8d08fdba MS |
1482 | return type; |
1483 | } | |
1484 | ||
1485 | tree | |
848eed92 | 1486 | coerce_delete_type (tree type) |
8d08fdba | 1487 | { |
36791f1e NS |
1488 | int e = 0; |
1489 | tree args = TYPE_ARG_TYPES (type); | |
c8094d83 | 1490 | |
50bc768d | 1491 | gcc_assert (TREE_CODE (type) == FUNCTION_TYPE); |
824b9a4c | 1492 | |
36791f1e | 1493 | if (!same_type_p (TREE_TYPE (type), void_type_node)) |
2d01edd7 GDR |
1494 | { |
1495 | e = 1; | |
1496 | error ("%<operator delete%> must return type %qT", void_type_node); | |
1497 | } | |
8d08fdba | 1498 | |
36791f1e NS |
1499 | if (!args || args == void_list_node |
1500 | || !same_type_p (TREE_VALUE (args), ptr_type_node)) | |
8d08fdba | 1501 | { |
36791f1e NS |
1502 | e = 2; |
1503 | if (args && args != void_list_node) | |
0cbd7506 | 1504 | args = TREE_CHAIN (args); |
2d01edd7 | 1505 | error ("%<operator delete%> takes type %qT as first parameter", |
0cbd7506 | 1506 | ptr_type_node); |
8d08fdba | 1507 | } |
36791f1e NS |
1508 | switch (e) |
1509 | { | |
1510 | case 2: | |
1511 | args = tree_cons (NULL_TREE, ptr_type_node, args); | |
f4f206f4 | 1512 | /* Fall through. */ |
36791f1e NS |
1513 | case 1: |
1514 | type = build_exception_variant | |
0cbd7506 MS |
1515 | (build_function_type (void_type_node, args), |
1516 | TYPE_RAISES_EXCEPTIONS (type)); | |
f4f206f4 | 1517 | /* Fall through. */ |
36791f1e NS |
1518 | default:; |
1519 | } | |
8d08fdba MS |
1520 | |
1521 | return type; | |
1522 | } | |
1523 | \f | |
dc472c59 JM |
1524 | /* DECL is a VAR_DECL for a vtable: walk through the entries in the vtable |
1525 | and mark them as needed. */ | |
1526 | ||
8d08fdba | 1527 | static void |
848eed92 | 1528 | mark_vtable_entries (tree decl) |
8d08fdba | 1529 | { |
4038c495 GB |
1530 | tree fnaddr; |
1531 | unsigned HOST_WIDE_INT idx; | |
f30432d7 | 1532 | |
4038c495 GB |
1533 | FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)), |
1534 | idx, fnaddr) | |
8d08fdba | 1535 | { |
aff08c18 | 1536 | tree fn; |
bb4f6e6b JH |
1537 | |
1538 | STRIP_NOPS (fnaddr); | |
1539 | ||
67231816 RH |
1540 | if (TREE_CODE (fnaddr) != ADDR_EXPR |
1541 | && TREE_CODE (fnaddr) != FDESC_EXPR) | |
bbd15aac | 1542 | /* This entry is an offset: a virtual base class offset, a |
46ccf50a | 1543 | virtual call offset, an RTTI offset, etc. */ |
aff08c18 JM |
1544 | continue; |
1545 | ||
aff08c18 | 1546 | fn = TREE_OPERAND (fnaddr, 0); |
8926095f | 1547 | TREE_ADDRESSABLE (fn) = 1; |
31f8e4f3 MM |
1548 | /* When we don't have vcall offsets, we output thunks whenever |
1549 | we output the vtables that contain them. With vcall offsets, | |
1550 | we know all the thunks we'll need when we emit a virtual | |
1551 | function, so we emit the thunks there instead. */ | |
c8094d83 | 1552 | if (DECL_THUNK_P (fn)) |
d0cd8b44 | 1553 | use_thunk (fn, /*emit_p=*/0); |
5566b478 | 1554 | mark_used (fn); |
7177d104 MS |
1555 | } |
1556 | } | |
1557 | ||
d11ad92e MS |
1558 | /* Set DECL up to have the closest approximation of "initialized common" |
1559 | linkage available. */ | |
1560 | ||
1561 | void | |
848eed92 | 1562 | comdat_linkage (tree decl) |
d11ad92e | 1563 | { |
d11ad92e | 1564 | if (flag_weak) |
fc26fae3 | 1565 | make_decl_one_only (decl, cxx_comdat_group (decl)); |
c8094d83 | 1566 | else if (TREE_CODE (decl) == FUNCTION_DECL |
97458258 MM |
1567 | || (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl))) |
1568 | /* We can just emit function and compiler-generated variables | |
1569 | statically; having multiple copies is (for the most part) only | |
c8094d83 | 1570 | a waste of space. |
97458258 MM |
1571 | |
1572 | There are two correctness issues, however: the address of a | |
1573 | template instantiation with external linkage should be the | |
ad50e811 MM |
1574 | same, independent of what translation unit asks for the |
1575 | address, and this will not hold when we emit multiple copies of | |
c8094d83 | 1576 | the function. However, there's little else we can do. |
97458258 | 1577 | |
3461fba7 NS |
1578 | Also, by default, the typeinfo implementation assumes that |
1579 | there will be only one copy of the string used as the name for | |
1580 | each type. Therefore, if weak symbols are unavailable, the | |
1581 | run-time library should perform a more conservative check; it | |
1582 | should perform a string comparison, rather than an address | |
1583 | comparison. */ | |
7fcdf4c2 | 1584 | TREE_PUBLIC (decl) = 0; |
ea735e02 JM |
1585 | else |
1586 | { | |
2f435bed JM |
1587 | /* Static data member template instantiations, however, cannot |
1588 | have multiple copies. */ | |
ea735e02 JM |
1589 | if (DECL_INITIAL (decl) == 0 |
1590 | || DECL_INITIAL (decl) == error_mark_node) | |
1591 | DECL_COMMON (decl) = 1; | |
1592 | else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl))) | |
1593 | { | |
1594 | DECL_COMMON (decl) = 1; | |
1595 | DECL_INITIAL (decl) = error_mark_node; | |
1596 | } | |
49bf4577 | 1597 | else if (!DECL_EXPLICIT_INSTANTIATION (decl)) |
ea735e02 JM |
1598 | { |
1599 | /* We can't do anything useful; leave vars for explicit | |
1600 | instantiation. */ | |
1601 | DECL_EXTERNAL (decl) = 1; | |
1602 | DECL_NOT_REALLY_EXTERN (decl) = 0; | |
1603 | } | |
1604 | } | |
ab23f787 | 1605 | |
07357341 | 1606 | DECL_COMDAT (decl) = 1; |
d11ad92e MS |
1607 | } |
1608 | ||
b385c841 JM |
1609 | /* For win32 we also want to put explicit instantiations in |
1610 | linkonce sections, so that they will be merged with implicit | |
c8094d83 MS |
1611 | instantiations; otherwise we get duplicate symbol errors. |
1612 | For Darwin we do not want explicit instantiations to be | |
324f9dfb | 1613 | linkonce. */ |
b385c841 JM |
1614 | |
1615 | void | |
848eed92 | 1616 | maybe_make_one_only (tree decl) |
b385c841 | 1617 | { |
b78121f6 JM |
1618 | /* We used to say that this was not necessary on targets that support weak |
1619 | symbols, because the implicit instantiations will defer to the explicit | |
1620 | one. However, that's not actually the case in SVR4; a strong definition | |
1621 | after a weak one is an error. Also, not making explicit | |
1622 | instantiations one_only means that we can end up with two copies of | |
a1c65f9f | 1623 | some template instantiations. */ |
90ecce3e | 1624 | if (! flag_weak) |
b385c841 JM |
1625 | return; |
1626 | ||
11bb4b27 | 1627 | /* We can't set DECL_COMDAT on functions, or cp_finish_file will think |
ea735e02 JM |
1628 | we can get away with not emitting them if they aren't used. We need |
1629 | to for variables so that cp_finish_decl will update their linkage, | |
1630 | because their DECL_INITIAL may not have been set properly yet. */ | |
b385c841 | 1631 | |
0524c91d | 1632 | if (!TARGET_WEAK_NOT_IN_ARCHIVE_TOC |
4746cf84 MA |
1633 | || (! DECL_EXPLICIT_INSTANTIATION (decl) |
1634 | && ! DECL_TEMPLATE_SPECIALIZATION (decl))) | |
5cc90635 | 1635 | { |
fc26fae3 | 1636 | make_decl_one_only (decl, cxx_comdat_group (decl)); |
4746cf84 MA |
1637 | |
1638 | if (TREE_CODE (decl) == VAR_DECL) | |
1639 | { | |
1640 | DECL_COMDAT (decl) = 1; | |
1641 | /* Mark it needed so we don't forget to emit it. */ | |
bb9a388d | 1642 | mark_decl_referenced (decl); |
4746cf84 | 1643 | } |
5cc90635 | 1644 | } |
b385c841 JM |
1645 | } |
1646 | ||
d6dcdbd5 JM |
1647 | /* Returns true iff DECL, a FUNCTION_DECL or VAR_DECL, has vague linkage. |
1648 | This predicate will give the right answer during parsing of the | |
1649 | function, which other tests may not. */ | |
ecc607fc JM |
1650 | |
1651 | bool | |
d6dcdbd5 | 1652 | vague_linkage_p (tree decl) |
ecc607fc JM |
1653 | { |
1654 | /* Unfortunately, import_export_decl has not always been called | |
1655 | before the function is processed, so we cannot simply check | |
1656 | DECL_COMDAT. */ | |
d6dcdbd5 JM |
1657 | return (DECL_COMDAT (decl) |
1658 | || (((TREE_CODE (decl) == FUNCTION_DECL | |
1659 | && DECL_DECLARED_INLINE_P (decl)) | |
39bac010 DS |
1660 | || (DECL_LANG_SPECIFIC (decl) |
1661 | && DECL_TEMPLATE_INSTANTIATION (decl))) | |
d6dcdbd5 | 1662 | && TREE_PUBLIC (decl))); |
ecc607fc JM |
1663 | } |
1664 | ||
7e776093 JM |
1665 | /* Determine whether or not we want to specifically import or export CTYPE, |
1666 | using various heuristics. */ | |
67f7c391 | 1667 | |
27d26ee7 | 1668 | static void |
848eed92 | 1669 | import_export_class (tree ctype) |
8d08fdba | 1670 | { |
7e776093 JM |
1671 | /* -1 for imported, 1 for exported. */ |
1672 | int import_export = 0; | |
1673 | ||
27d26ee7 MM |
1674 | /* It only makes sense to call this function at EOF. The reason is |
1675 | that this function looks at whether or not the first non-inline | |
1676 | non-abstract virtual member function has been defined in this | |
1677 | translation unit. But, we can't possibly know that until we've | |
1678 | seen the entire translation unit. */ | |
50bc768d | 1679 | gcc_assert (at_eof); |
27d26ee7 | 1680 | |
7e776093 JM |
1681 | if (CLASSTYPE_INTERFACE_KNOWN (ctype)) |
1682 | return; | |
1683 | ||
15072eb1 | 1684 | /* If MULTIPLE_SYMBOL_SPACES is set and we saw a #pragma interface, |
e9659ab0 JM |
1685 | we will have CLASSTYPE_INTERFACE_ONLY set but not |
1686 | CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this | |
1687 | heuristic because someone will supply a #pragma implementation | |
1688 | elsewhere, and deducing it here would produce a conflict. */ | |
1689 | if (CLASSTYPE_INTERFACE_ONLY (ctype)) | |
1690 | return; | |
1691 | ||
91d231cb | 1692 | if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype))) |
501990bb | 1693 | import_export = -1; |
91d231cb | 1694 | else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype))) |
501990bb | 1695 | import_export = 1; |
4684cd27 MM |
1696 | else if (CLASSTYPE_IMPLICIT_INSTANTIATION (ctype) |
1697 | && !flag_implicit_templates) | |
1698 | /* For a template class, without -fimplicit-templates, check the | |
1699 | repository. If the virtual table is assigned to this | |
1700 | translation unit, then export the class; otherwise, import | |
1701 | it. */ | |
1702 | import_export = repo_export_class_p (ctype) ? 1 : -1; | |
1703 | else if (TYPE_POLYMORPHIC_P (ctype)) | |
1704 | { | |
1705 | /* The ABI specifies that the virtual table and associated | |
1706 | information are emitted with the key method, if any. */ | |
9aad8f83 | 1707 | tree method = CLASSTYPE_KEY_METHOD (ctype); |
30bf22a0 MS |
1708 | /* If weak symbol support is not available, then we must be |
1709 | careful not to emit the vtable when the key function is | |
1710 | inline. An inline function can be defined in multiple | |
1711 | translation units. If we were to emit the vtable in each | |
1712 | translation unit containing a definition, we would get | |
1713 | multiple definition errors at link-time. */ | |
1714 | if (method && (flag_weak || ! DECL_DECLARED_INLINE_P (method))) | |
6db20143 | 1715 | import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1); |
51c184be | 1716 | } |
ad236eab | 1717 | |
15072eb1 ZW |
1718 | /* When MULTIPLE_SYMBOL_SPACES is set, we cannot count on seeing |
1719 | a definition anywhere else. */ | |
1720 | if (MULTIPLE_SYMBOL_SPACES && import_export == -1) | |
ad236eab | 1721 | import_export = 0; |
7e776093 | 1722 | |
3b426391 | 1723 | /* Allow back ends the chance to overrule the decision. */ |
d59c7b4b NC |
1724 | if (targetm.cxx.import_export_class) |
1725 | import_export = targetm.cxx.import_export_class (ctype, import_export); | |
1726 | ||
7e776093 JM |
1727 | if (import_export) |
1728 | { | |
1729 | SET_CLASSTYPE_INTERFACE_KNOWN (ctype); | |
7e776093 JM |
1730 | CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0); |
1731 | } | |
67f7c391 | 1732 | } |
a1dd0d36 | 1733 | |
c4d2313d JH |
1734 | /* Return true if VAR has already been provided to the back end; in that |
1735 | case VAR should not be modified further by the front end. */ | |
1736 | static bool | |
1737 | var_finalized_p (tree var) | |
1738 | { | |
8a4a83ed | 1739 | return varpool_node (var)->finalized; |
4684cd27 MM |
1740 | } |
1741 | ||
1742 | /* DECL is a VAR_DECL or FUNCTION_DECL which, for whatever reason, | |
1743 | must be emitted in this translation unit. Mark it as such. */ | |
1744 | ||
1745 | void | |
1746 | mark_needed (tree decl) | |
1747 | { | |
1748 | /* It's possible that we no longer need to set | |
1749 | TREE_SYMBOL_REFERENCED here directly, but doing so is | |
1750 | harmless. */ | |
1751 | TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)) = 1; | |
1752 | mark_decl_referenced (decl); | |
1753 | } | |
1754 | ||
1755 | /* DECL is either a FUNCTION_DECL or a VAR_DECL. This function | |
1756 | returns true if a definition of this entity should be provided in | |
1757 | this object file. Callers use this function to determine whether | |
1758 | or not to let the back end know that a definition of DECL is | |
1759 | available in this translation unit. */ | |
1760 | ||
1761 | bool | |
1762 | decl_needed_p (tree decl) | |
1763 | { | |
50bc768d NS |
1764 | gcc_assert (TREE_CODE (decl) == VAR_DECL |
1765 | || TREE_CODE (decl) == FUNCTION_DECL); | |
4684cd27 MM |
1766 | /* This function should only be called at the end of the translation |
1767 | unit. We cannot be sure of whether or not something will be | |
1768 | COMDAT until that point. */ | |
50bc768d | 1769 | gcc_assert (at_eof); |
4684cd27 MM |
1770 | |
1771 | /* All entities with external linkage that are not COMDAT should be | |
1772 | emitted; they may be referred to from other object files. */ | |
1773 | if (TREE_PUBLIC (decl) && !DECL_COMDAT (decl)) | |
1774 | return true; | |
3b426391 | 1775 | /* If this entity was used, let the back end see it; it will decide |
4684cd27 | 1776 | whether or not to emit it into the object file. */ |
c8094d83 | 1777 | if (TREE_USED (decl) |
4684cd27 MM |
1778 | || (DECL_ASSEMBLER_NAME_SET_P (decl) |
1779 | && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)))) | |
1780 | return true; | |
fe2978fb MM |
1781 | /* Functions marked "dllexport" must be emitted so that they are |
1782 | visible to other DLLs. */ | |
1783 | if (lookup_attribute ("dllexport", DECL_ATTRIBUTES (decl))) | |
1784 | return true; | |
4684cd27 MM |
1785 | /* Otherwise, DECL does not need to be emitted -- yet. A subsequent |
1786 | reference to DECL might cause it to be emitted later. */ | |
1787 | return false; | |
c4d2313d JH |
1788 | } |
1789 | ||
548502d3 | 1790 | /* If necessary, write out the vtables for the dynamic class CTYPE. |
848eed92 | 1791 | Returns true if any vtables were emitted. */ |
548502d3 | 1792 | |
848eed92 | 1793 | static bool |
548502d3 | 1794 | maybe_emit_vtables (tree ctype) |
d18c083e | 1795 | { |
548502d3 MM |
1796 | tree vtbl; |
1797 | tree primary_vtbl; | |
4684cd27 | 1798 | int needed = 0; |
9f90e80a | 1799 | struct varpool_node *current = NULL, *last = NULL, *first = NULL; |
548502d3 MM |
1800 | |
1801 | /* If the vtables for this class have already been emitted there is | |
1802 | nothing more to do. */ | |
1803 | primary_vtbl = CLASSTYPE_VTABLES (ctype); | |
c4d2313d | 1804 | if (var_finalized_p (primary_vtbl)) |
848eed92 | 1805 | return false; |
548502d3 MM |
1806 | /* Ignore dummy vtables made by get_vtable_decl. */ |
1807 | if (TREE_TYPE (primary_vtbl) == void_type_node) | |
848eed92 | 1808 | return false; |
548502d3 | 1809 | |
af287697 MM |
1810 | /* On some targets, we cannot determine the key method until the end |
1811 | of the translation unit -- which is when this function is | |
1812 | called. */ | |
1813 | if (!targetm.cxx.key_method_may_be_inline ()) | |
1814 | determine_key_method (ctype); | |
1815 | ||
548502d3 | 1816 | /* See if any of the vtables are needed. */ |
910ad8de | 1817 | for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = DECL_CHAIN (vtbl)) |
e9e4d4ee | 1818 | { |
4684cd27 MM |
1819 | import_export_decl (vtbl); |
1820 | if (DECL_NOT_REALLY_EXTERN (vtbl) && decl_needed_p (vtbl)) | |
1821 | needed = 1; | |
e9e4d4ee | 1822 | } |
4684cd27 | 1823 | if (!needed) |
548502d3 MM |
1824 | { |
1825 | /* If the references to this class' vtables are optimized away, | |
1826 | still emit the appropriate debugging information. See | |
1827 | dfs_debug_mark. */ | |
c8094d83 | 1828 | if (DECL_COMDAT (primary_vtbl) |
548502d3 MM |
1829 | && CLASSTYPE_DEBUG_REQUESTED (ctype)) |
1830 | note_debug_info_needed (ctype); | |
848eed92 | 1831 | return false; |
548502d3 MM |
1832 | } |
1833 | ||
1834 | /* The ABI requires that we emit all of the vtables if we emit any | |
1835 | of them. */ | |
910ad8de | 1836 | for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = DECL_CHAIN (vtbl)) |
d18c083e | 1837 | { |
4684cd27 | 1838 | /* Mark entities references from the virtual table as used. */ |
548502d3 | 1839 | mark_vtable_entries (vtbl); |
8cd2462c | 1840 | |
548502d3 | 1841 | if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0) |
25ebb82a | 1842 | { |
e57d93c6 | 1843 | tree expr = store_init_value (vtbl, DECL_INITIAL (vtbl), LOOKUP_NORMAL); |
c8094d83 | 1844 | |
25ebb82a | 1845 | /* It had better be all done at compile-time. */ |
8dc2b103 | 1846 | gcc_assert (!expr); |
25ebb82a | 1847 | } |
8d08fdba | 1848 | |
4684cd27 MM |
1849 | /* Write it out. */ |
1850 | DECL_EXTERNAL (vtbl) = 0; | |
0e6df31e | 1851 | rest_of_decl_compilation (vtbl, 1, 1); |
a1dd0d36 | 1852 | |
84df082b MM |
1853 | /* Because we're only doing syntax-checking, we'll never end up |
1854 | actually marking the variable as written. */ | |
1855 | if (flag_syntax_only) | |
548502d3 | 1856 | TREE_ASM_WRITTEN (vtbl) = 1; |
9f90e80a JH |
1857 | else if (DECL_COMDAT (vtbl)) |
1858 | { | |
1859 | current = varpool_node (vtbl); | |
1860 | if (last) | |
1861 | last->same_comdat_group = current; | |
1862 | last = current; | |
1863 | if (!first) | |
1864 | first = current; | |
1865 | } | |
8d08fdba | 1866 | } |
6db20143 | 1867 | |
9f90e80a JH |
1868 | if (first != last) |
1869 | last->same_comdat_group = first; | |
1870 | ||
548502d3 MM |
1871 | /* Since we're writing out the vtable here, also write the debug |
1872 | info. */ | |
1873 | note_debug_info_needed (ctype); | |
b7484fbe | 1874 | |
848eed92 | 1875 | return true; |
b7484fbe MS |
1876 | } |
1877 | ||
b9e75696 JM |
1878 | /* A special return value from type_visibility meaning internal |
1879 | linkage. */ | |
1880 | ||
b70f0f48 | 1881 | enum { VISIBILITY_ANON = VISIBILITY_INTERNAL+1 }; |
b9e75696 JM |
1882 | |
1883 | /* walk_tree helper function for type_visibility. */ | |
1884 | ||
1885 | static tree | |
1886 | min_vis_r (tree *tp, int *walk_subtrees, void *data) | |
1887 | { | |
1888 | int *vis_p = (int *)data; | |
1889 | if (! TYPE_P (*tp)) | |
1890 | { | |
1891 | *walk_subtrees = 0; | |
1892 | } | |
1893 | else if (CLASS_TYPE_P (*tp)) | |
1894 | { | |
1895 | if (!TREE_PUBLIC (TYPE_MAIN_DECL (*tp))) | |
1896 | { | |
b70f0f48 | 1897 | *vis_p = VISIBILITY_ANON; |
b9e75696 JM |
1898 | return *tp; |
1899 | } | |
1900 | else if (CLASSTYPE_VISIBILITY (*tp) > *vis_p) | |
1901 | *vis_p = CLASSTYPE_VISIBILITY (*tp); | |
1902 | } | |
1903 | return NULL; | |
1904 | } | |
1905 | ||
1906 | /* Returns the visibility of TYPE, which is the minimum visibility of its | |
1907 | component types. */ | |
1908 | ||
1909 | static int | |
1910 | type_visibility (tree type) | |
1911 | { | |
1912 | int vis = VISIBILITY_DEFAULT; | |
14588106 | 1913 | cp_walk_tree_without_duplicates (&type, min_vis_r, &vis); |
b9e75696 JM |
1914 | return vis; |
1915 | } | |
1916 | ||
b70f0f48 JM |
1917 | /* Limit the visibility of DECL to VISIBILITY, if not explicitly |
1918 | specified (or if VISIBILITY is static). */ | |
b9e75696 JM |
1919 | |
1920 | static bool | |
b70f0f48 | 1921 | constrain_visibility (tree decl, int visibility) |
b9e75696 | 1922 | { |
b70f0f48 | 1923 | if (visibility == VISIBILITY_ANON) |
b9e75696 | 1924 | { |
b70f0f48 JM |
1925 | /* extern "C" declarations aren't affected by the anonymous |
1926 | namespace. */ | |
1927 | if (!DECL_EXTERN_C_P (decl)) | |
1928 | { | |
1929 | TREE_PUBLIC (decl) = 0; | |
fcc993f6 JH |
1930 | DECL_WEAK (decl) = 0; |
1931 | DECL_COMMON (decl) = 0; | |
fc26fae3 | 1932 | DECL_COMDAT_GROUP (decl) = NULL_TREE; |
b70f0f48 JM |
1933 | DECL_INTERFACE_KNOWN (decl) = 1; |
1934 | if (DECL_LANG_SPECIFIC (decl)) | |
1935 | DECL_NOT_REALLY_EXTERN (decl) = 1; | |
1936 | } | |
b9e75696 | 1937 | } |
b70f0f48 JM |
1938 | else if (visibility > DECL_VISIBILITY (decl) |
1939 | && !DECL_VISIBILITY_SPECIFIED (decl)) | |
b9e75696 | 1940 | { |
32e8bb8e | 1941 | DECL_VISIBILITY (decl) = (enum symbol_visibility) visibility; |
b9e75696 JM |
1942 | return true; |
1943 | } | |
1944 | return false; | |
1945 | } | |
1946 | ||
e7d35a88 | 1947 | /* Constrain the visibility of DECL based on the visibility of its template |
b9e75696 JM |
1948 | arguments. */ |
1949 | ||
1950 | static void | |
1951 | constrain_visibility_for_template (tree decl, tree targs) | |
1952 | { | |
1953 | /* If this is a template instantiation, check the innermost | |
1954 | template args for visibility constraints. The outer template | |
1955 | args are covered by the class check. */ | |
1956 | tree args = INNERMOST_TEMPLATE_ARGS (targs); | |
1957 | int i; | |
1958 | for (i = TREE_VEC_LENGTH (args); i > 0; --i) | |
1959 | { | |
1960 | int vis = 0; | |
1961 | ||
1962 | tree arg = TREE_VEC_ELT (args, i-1); | |
1963 | if (TYPE_P (arg)) | |
1964 | vis = type_visibility (arg); | |
1965 | else if (TREE_TYPE (arg) && POINTER_TYPE_P (TREE_TYPE (arg))) | |
1966 | { | |
1967 | STRIP_NOPS (arg); | |
1968 | if (TREE_CODE (arg) == ADDR_EXPR) | |
1969 | arg = TREE_OPERAND (arg, 0); | |
1970 | if (TREE_CODE (arg) == VAR_DECL | |
1971 | || TREE_CODE (arg) == FUNCTION_DECL) | |
1972 | { | |
1973 | if (! TREE_PUBLIC (arg)) | |
b70f0f48 | 1974 | vis = VISIBILITY_ANON; |
b9e75696 JM |
1975 | else |
1976 | vis = DECL_VISIBILITY (arg); | |
1977 | } | |
1978 | } | |
1979 | if (vis) | |
b70f0f48 | 1980 | constrain_visibility (decl, vis); |
b9e75696 JM |
1981 | } |
1982 | } | |
1983 | ||
b2ca3702 | 1984 | /* Like c_determine_visibility, but with additional C++-specific |
0ed5edac JM |
1985 | behavior. |
1986 | ||
1987 | Function-scope entities can rely on the function's visibility because | |
1988 | it is set in start_preparsed_function. | |
1989 | ||
1990 | Class-scope entities cannot rely on the class's visibility until the end | |
1991 | of the enclosing class definition. | |
1992 | ||
1993 | Note that because namespaces have multiple independent definitions, | |
1994 | namespace visibility is handled elsewhere using the #pragma visibility | |
b9e75696 JM |
1995 | machinery rather than by decorating the namespace declaration. |
1996 | ||
1997 | The goal is for constraints from the type to give a diagnostic, and | |
1998 | other constraints to be applied silently. */ | |
73a8adb6 MM |
1999 | |
2000 | void | |
2001 | determine_visibility (tree decl) | |
2002 | { | |
b9e75696 JM |
2003 | tree class_type = NULL_TREE; |
2004 | bool use_template; | |
09812622 JJ |
2005 | bool orig_visibility_specified; |
2006 | enum symbol_visibility orig_visibility; | |
b9e75696 JM |
2007 | |
2008 | /* Remember that all decls get VISIBILITY_DEFAULT when built. */ | |
73a8adb6 | 2009 | |
0ed5edac JM |
2010 | /* Only relevant for names with external linkage. */ |
2011 | if (!TREE_PUBLIC (decl)) | |
2012 | return; | |
2013 | ||
73a8adb6 MM |
2014 | /* Cloned constructors and destructors get the same visibility as |
2015 | the underlying function. That should be set up in | |
2016 | maybe_clone_body. */ | |
50bc768d | 2017 | gcc_assert (!DECL_CLONED_FUNCTION_P (decl)); |
b2ca3702 | 2018 | |
09812622 JJ |
2019 | orig_visibility_specified = DECL_VISIBILITY_SPECIFIED (decl); |
2020 | orig_visibility = DECL_VISIBILITY (decl); | |
2021 | ||
b9e75696 JM |
2022 | if (TREE_CODE (decl) == TYPE_DECL) |
2023 | { | |
2024 | if (CLASS_TYPE_P (TREE_TYPE (decl))) | |
2025 | use_template = CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl)); | |
2026 | else if (TYPE_TEMPLATE_INFO (TREE_TYPE (decl))) | |
2027 | use_template = 1; | |
2028 | else | |
2029 | use_template = 0; | |
2030 | } | |
2031 | else if (DECL_LANG_SPECIFIC (decl)) | |
2032 | use_template = DECL_USE_TEMPLATE (decl); | |
2033 | else | |
2034 | use_template = 0; | |
2035 | ||
b2ca3702 MM |
2036 | /* If DECL is a member of a class, visibility specifiers on the |
2037 | class can influence the visibility of the DECL. */ | |
73a8adb6 MM |
2038 | if (DECL_CLASS_SCOPE_P (decl)) |
2039 | class_type = DECL_CONTEXT (decl); | |
73a8adb6 MM |
2040 | else |
2041 | { | |
b9e75696 JM |
2042 | /* Not a class member. */ |
2043 | ||
73a8adb6 MM |
2044 | /* Virtual tables have DECL_CONTEXT set to their associated class, |
2045 | so they are automatically handled above. */ | |
50bc768d NS |
2046 | gcc_assert (TREE_CODE (decl) != VAR_DECL |
2047 | || !DECL_VTABLE_OR_VTT_P (decl)); | |
0ed5edac | 2048 | |
7c0de6a5 | 2049 | if (DECL_FUNCTION_SCOPE_P (decl) && ! DECL_VISIBILITY_SPECIFIED (decl)) |
0ed5edac | 2050 | { |
b9e75696 | 2051 | /* Local statics and classes get the visibility of their |
7c0de6a5 GK |
2052 | containing function by default, except that |
2053 | -fvisibility-inlines-hidden doesn't affect them. */ | |
0ed5edac | 2054 | tree fn = DECL_CONTEXT (decl); |
7c0de6a5 GK |
2055 | if (DECL_VISIBILITY_SPECIFIED (fn) || ! DECL_CLASS_SCOPE_P (fn)) |
2056 | { | |
2057 | DECL_VISIBILITY (decl) = DECL_VISIBILITY (fn); | |
2058 | DECL_VISIBILITY_SPECIFIED (decl) = | |
2059 | DECL_VISIBILITY_SPECIFIED (fn); | |
2060 | } | |
2061 | else | |
2062 | determine_visibility_from_class (decl, DECL_CONTEXT (fn)); | |
0ed5edac | 2063 | |
b9e75696 JM |
2064 | /* Local classes in templates have CLASSTYPE_USE_TEMPLATE set, |
2065 | but have no TEMPLATE_INFO, so don't try to check it. */ | |
2066 | use_template = 0; | |
2067 | } | |
ddbfd28d GK |
2068 | else if (TREE_CODE (decl) == VAR_DECL && DECL_TINFO_P (decl) |
2069 | && flag_visibility_ms_compat) | |
2070 | { | |
2071 | /* Under -fvisibility-ms-compat, types are visible by default, | |
2072 | even though their contents aren't. */ | |
2073 | tree underlying_type = TREE_TYPE (DECL_NAME (decl)); | |
2074 | int underlying_vis = type_visibility (underlying_type); | |
2075 | if (underlying_vis == VISIBILITY_ANON | |
2076 | || CLASSTYPE_VISIBILITY_SPECIFIED (underlying_type)) | |
2077 | constrain_visibility (decl, underlying_vis); | |
2078 | else | |
2079 | DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT; | |
2080 | } | |
b9e75696 JM |
2081 | else if (TREE_CODE (decl) == VAR_DECL && DECL_TINFO_P (decl)) |
2082 | { | |
2083 | /* tinfo visibility is based on the type it's for. */ | |
2084 | constrain_visibility | |
b70f0f48 | 2085 | (decl, type_visibility (TREE_TYPE (DECL_NAME (decl)))); |
711b2998 JB |
2086 | |
2087 | /* Give the target a chance to override the visibility associated | |
2088 | with DECL. */ | |
2089 | if (TREE_PUBLIC (decl) | |
2090 | && !DECL_REALLY_EXTERN (decl) | |
2091 | && CLASS_TYPE_P (TREE_TYPE (DECL_NAME (decl))) | |
2092 | && !CLASSTYPE_VISIBILITY_SPECIFIED (TREE_TYPE (DECL_NAME (decl)))) | |
2093 | targetm.cxx.determine_class_data_visibility (decl); | |
b9e75696 JM |
2094 | } |
2095 | else if (use_template) | |
2096 | /* Template instantiations and specializations get visibility based | |
2097 | on their template unless they override it with an attribute. */; | |
2098 | else if (! DECL_VISIBILITY_SPECIFIED (decl)) | |
2099 | { | |
2100 | /* Set default visibility to whatever the user supplied with | |
2101 | #pragma GCC visibility or a namespace visibility attribute. */ | |
2102 | DECL_VISIBILITY (decl) = default_visibility; | |
2103 | DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma; | |
2104 | } | |
73a8adb6 MM |
2105 | } |
2106 | ||
b9e75696 | 2107 | if (use_template) |
73a8adb6 | 2108 | { |
b70f0f48 JM |
2109 | /* If the specialization doesn't specify visibility, use the |
2110 | visibility from the template. */ | |
b9e75696 JM |
2111 | tree tinfo = (TREE_CODE (decl) == TYPE_DECL |
2112 | ? TYPE_TEMPLATE_INFO (TREE_TYPE (decl)) | |
2113 | : DECL_TEMPLATE_INFO (decl)); | |
2114 | tree args = TI_ARGS (tinfo); | |
653109bd LM |
2115 | |
2116 | if (args != error_mark_node) | |
b9e75696 | 2117 | { |
653109bd LM |
2118 | int depth = TMPL_ARGS_DEPTH (args); |
2119 | tree pattern = DECL_TEMPLATE_RESULT (TI_TEMPLATE (tinfo)); | |
2120 | ||
2121 | if (!DECL_VISIBILITY_SPECIFIED (decl)) | |
2122 | { | |
2123 | DECL_VISIBILITY (decl) = DECL_VISIBILITY (pattern); | |
2124 | DECL_VISIBILITY_SPECIFIED (decl) | |
2125 | = DECL_VISIBILITY_SPECIFIED (pattern); | |
2126 | } | |
b9e75696 | 2127 | |
653109bd LM |
2128 | /* FIXME should TMPL_ARGS_DEPTH really return 1 for null input? */ |
2129 | if (args && depth > template_class_depth (class_type)) | |
2130 | /* Limit visibility based on its template arguments. */ | |
2131 | constrain_visibility_for_template (decl, args); | |
2132 | } | |
3db45ab5 | 2133 | } |
b70f0f48 | 2134 | |
b9e75696 JM |
2135 | if (class_type) |
2136 | determine_visibility_from_class (decl, class_type); | |
2137 | ||
b9e75696 JM |
2138 | if (decl_anon_ns_mem_p (decl)) |
2139 | /* Names in an anonymous namespace get internal linkage. | |
2140 | This might change once we implement export. */ | |
b70f0f48 | 2141 | constrain_visibility (decl, VISIBILITY_ANON); |
bd741f34 JM |
2142 | else if (TREE_CODE (decl) != TYPE_DECL) |
2143 | { | |
2144 | /* Propagate anonymity from type to decl. */ | |
2145 | int tvis = type_visibility (TREE_TYPE (decl)); | |
c96f0001 GK |
2146 | if (tvis == VISIBILITY_ANON |
2147 | || ! DECL_VISIBILITY_SPECIFIED (decl)) | |
bd741f34 JM |
2148 | constrain_visibility (decl, tvis); |
2149 | } | |
ecc607fc JM |
2150 | else if (no_linkage_check (TREE_TYPE (decl), /*relaxed_p=*/true)) |
2151 | /* DR 757: A type without linkage shall not be used as the type of a | |
2152 | variable or function with linkage, unless | |
2153 | o the variable or function has extern "C" linkage (7.5 [dcl.link]), or | |
2154 | o the variable or function is not used (3.2 [basic.def.odr]) or is | |
2155 | defined in the same translation unit. | |
2156 | ||
2157 | Since non-extern "C" decls need to be defined in the same | |
2158 | translation unit, we can make the type internal. */ | |
2159 | constrain_visibility (decl, VISIBILITY_ANON); | |
09812622 JJ |
2160 | |
2161 | /* If visibility changed and DECL already has DECL_RTL, ensure | |
2162 | symbol flags are updated. */ | |
2163 | if ((DECL_VISIBILITY (decl) != orig_visibility | |
2164 | || DECL_VISIBILITY_SPECIFIED (decl) != orig_visibility_specified) | |
2165 | && ((TREE_CODE (decl) == VAR_DECL && TREE_STATIC (decl)) | |
2166 | || TREE_CODE (decl) == FUNCTION_DECL) | |
2167 | && DECL_RTL_SET_P (decl)) | |
2168 | make_decl_rtl (decl); | |
0ed5edac JM |
2169 | } |
2170 | ||
b9e75696 JM |
2171 | /* By default, static data members and function members receive |
2172 | the visibility of their containing class. */ | |
2173 | ||
0ed5edac JM |
2174 | static void |
2175 | determine_visibility_from_class (tree decl, tree class_type) | |
2176 | { | |
3a687f8b MM |
2177 | if (DECL_VISIBILITY_SPECIFIED (decl)) |
2178 | return; | |
2179 | ||
b9e75696 JM |
2180 | if (visibility_options.inlines_hidden |
2181 | /* Don't do this for inline templates; specializations might not be | |
2182 | inline, and we don't want them to inherit the hidden | |
2183 | visibility. We'll set it here for all inline instantiations. */ | |
2184 | && !processing_template_decl | |
b9e75696 | 2185 | && TREE_CODE (decl) == FUNCTION_DECL |
dfb84d62 MS |
2186 | && DECL_DECLARED_INLINE_P (decl) |
2187 | && (! DECL_LANG_SPECIFIC (decl) | |
2188 | || ! DECL_EXPLICIT_INSTANTIATION (decl))) | |
b9e75696 | 2189 | DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN; |
3a687f8b | 2190 | else |
b70f0f48 JM |
2191 | { |
2192 | /* Default to the class visibility. */ | |
2193 | DECL_VISIBILITY (decl) = CLASSTYPE_VISIBILITY (class_type); | |
2194 | DECL_VISIBILITY_SPECIFIED (decl) | |
2195 | = CLASSTYPE_VISIBILITY_SPECIFIED (class_type); | |
2196 | } | |
b9e75696 JM |
2197 | |
2198 | /* Give the target a chance to override the visibility associated | |
2199 | with DECL. */ | |
2200 | if (TREE_CODE (decl) == VAR_DECL | |
2201 | && (DECL_TINFO_P (decl) | |
2202 | || (DECL_VTABLE_OR_VTT_P (decl) | |
2203 | /* Construction virtual tables are not exported because | |
2204 | they cannot be referred to from other object files; | |
2205 | their name is not standardized by the ABI. */ | |
2206 | && !DECL_CONSTRUCTION_VTABLE_P (decl))) | |
2207 | && TREE_PUBLIC (decl) | |
2208 | && !DECL_REALLY_EXTERN (decl) | |
b70f0f48 | 2209 | && !CLASSTYPE_VISIBILITY_SPECIFIED (class_type)) |
b9e75696 JM |
2210 | targetm.cxx.determine_class_data_visibility (decl); |
2211 | } | |
2212 | ||
2213 | /* Constrain the visibility of a class TYPE based on the visibility of its | |
2214 | field types. Warn if any fields require lesser visibility. */ | |
2215 | ||
2216 | void | |
2217 | constrain_class_visibility (tree type) | |
2218 | { | |
b70f0f48 | 2219 | tree binfo; |
b9e75696 JM |
2220 | tree t; |
2221 | int i; | |
2222 | ||
b70f0f48 JM |
2223 | int vis = type_visibility (type); |
2224 | ||
bd741f34 JM |
2225 | if (vis == VISIBILITY_ANON |
2226 | || DECL_IN_SYSTEM_HEADER (TYPE_MAIN_DECL (type))) | |
b70f0f48 JM |
2227 | return; |
2228 | ||
2229 | /* Don't warn about visibility if the class has explicit visibility. */ | |
2230 | if (CLASSTYPE_VISIBILITY_SPECIFIED (type)) | |
2231 | vis = VISIBILITY_INTERNAL; | |
2232 | ||
910ad8de | 2233 | for (t = TYPE_FIELDS (type); t; t = DECL_CHAIN (t)) |
b70f0f48 JM |
2234 | if (TREE_CODE (t) == FIELD_DECL && TREE_TYPE (t) != error_mark_node) |
2235 | { | |
ba992967 | 2236 | tree ftype = strip_pointer_or_array_types (TREE_TYPE (t)); |
bd741f34 | 2237 | int subvis = type_visibility (ftype); |
b70f0f48 JM |
2238 | |
2239 | if (subvis == VISIBILITY_ANON) | |
8fff2060 | 2240 | { |
61172206 | 2241 | if (!in_main_input_context ()) |
8fff2060 | 2242 | warning (0, "\ |
b70f0f48 | 2243 | %qT has a field %qD whose type uses the anonymous namespace", |
8fff2060 SP |
2244 | type, t); |
2245 | } | |
9e1e64ec | 2246 | else if (MAYBE_CLASS_TYPE_P (ftype) |
bd741f34 | 2247 | && vis < VISIBILITY_HIDDEN |
b70f0f48 JM |
2248 | && subvis >= VISIBILITY_HIDDEN) |
2249 | warning (OPT_Wattributes, "\ | |
b9e75696 | 2250 | %qT declared with greater visibility than the type of its field %qD", |
b70f0f48 JM |
2251 | type, t); |
2252 | } | |
b9e75696 | 2253 | |
b70f0f48 | 2254 | binfo = TYPE_BINFO (type); |
b9e75696 | 2255 | for (i = 0; BINFO_BASE_ITERATE (binfo, i, t); ++i) |
b70f0f48 JM |
2256 | { |
2257 | int subvis = type_visibility (TREE_TYPE (t)); | |
2258 | ||
2259 | if (subvis == VISIBILITY_ANON) | |
8fff2060 | 2260 | { |
61172206 | 2261 | if (!in_main_input_context()) |
8fff2060 | 2262 | warning (0, "\ |
b70f0f48 | 2263 | %qT has a base %qT whose type uses the anonymous namespace", |
8fff2060 SP |
2264 | type, TREE_TYPE (t)); |
2265 | } | |
b70f0f48 JM |
2266 | else if (vis < VISIBILITY_HIDDEN |
2267 | && subvis >= VISIBILITY_HIDDEN) | |
2268 | warning (OPT_Wattributes, "\ | |
b9e75696 | 2269 | %qT declared with greater visibility than its base %qT", |
b70f0f48 JM |
2270 | type, TREE_TYPE (t)); |
2271 | } | |
73a8adb6 MM |
2272 | } |
2273 | ||
4684cd27 MM |
2274 | /* DECL is a FUNCTION_DECL or VAR_DECL. If the object file linkage |
2275 | for DECL has not already been determined, do so now by setting | |
2276 | DECL_EXTERNAL, DECL_COMDAT and other related flags. Until this | |
2277 | function is called entities with vague linkage whose definitions | |
2278 | are available must have TREE_PUBLIC set. | |
2279 | ||
2280 | If this function decides to place DECL in COMDAT, it will set | |
2281 | appropriate flags -- but will not clear DECL_EXTERNAL. It is up to | |
2282 | the caller to decide whether or not to clear DECL_EXTERNAL. Some | |
2283 | callers defer that decision until it is clear that DECL is actually | |
2284 | required. */ | |
00595019 MS |
2285 | |
2286 | void | |
848eed92 | 2287 | import_export_decl (tree decl) |
00595019 | 2288 | { |
4684cd27 MM |
2289 | int emit_p; |
2290 | bool comdat_p; | |
2291 | bool import_p; | |
1e731102 | 2292 | tree class_type = NULL_TREE; |
4684cd27 | 2293 | |
db5ae43f | 2294 | if (DECL_INTERFACE_KNOWN (decl)) |
00595019 MS |
2295 | return; |
2296 | ||
4684cd27 MM |
2297 | /* We cannot determine what linkage to give to an entity with vague |
2298 | linkage until the end of the file. For example, a virtual table | |
2299 | for a class will be defined if and only if the key method is | |
2300 | defined in this translation unit. As a further example, consider | |
2301 | that when compiling a translation unit that uses PCH file with | |
2302 | "-frepo" it would be incorrect to make decisions about what | |
2303 | entities to emit when building the PCH; those decisions must be | |
2304 | delayed until the repository information has been processed. */ | |
50bc768d | 2305 | gcc_assert (at_eof); |
4684cd27 MM |
2306 | /* Object file linkage for explicit instantiations is handled in |
2307 | mark_decl_instantiated. For static variables in functions with | |
2308 | vague linkage, maybe_commonize_var is used. | |
2309 | ||
2310 | Therefore, the only declarations that should be provided to this | |
44370687 | 2311 | function are those with external linkage that are: |
4684cd27 MM |
2312 | |
2313 | * implicit instantiations of function templates | |
2314 | ||
2315 | * inline function | |
2316 | ||
2317 | * implicit instantiations of static data members of class | |
2318 | templates | |
2319 | ||
2320 | * virtual tables | |
2321 | ||
2322 | * typeinfo objects | |
2323 | ||
2324 | Furthermore, all entities that reach this point must have a | |
2325 | definition available in this translation unit. | |
2326 | ||
2327 | The following assertions check these conditions. */ | |
50bc768d NS |
2328 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL |
2329 | || TREE_CODE (decl) == VAR_DECL); | |
4684cd27 MM |
2330 | /* Any code that creates entities with TREE_PUBLIC cleared should |
2331 | also set DECL_INTERFACE_KNOWN. */ | |
50bc768d | 2332 | gcc_assert (TREE_PUBLIC (decl)); |
4684cd27 | 2333 | if (TREE_CODE (decl) == FUNCTION_DECL) |
50bc768d NS |
2334 | gcc_assert (DECL_IMPLICIT_INSTANTIATION (decl) |
2335 | || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl) | |
2336 | || DECL_DECLARED_INLINE_P (decl)); | |
4684cd27 | 2337 | else |
50bc768d NS |
2338 | gcc_assert (DECL_IMPLICIT_INSTANTIATION (decl) |
2339 | || DECL_VTABLE_OR_VTT_P (decl) | |
2340 | || DECL_TINFO_P (decl)); | |
4684cd27 MM |
2341 | /* Check that a definition of DECL is available in this translation |
2342 | unit. */ | |
50bc768d | 2343 | gcc_assert (!DECL_REALLY_EXTERN (decl)); |
4684cd27 MM |
2344 | |
2345 | /* Assume that DECL will not have COMDAT linkage. */ | |
2346 | comdat_p = false; | |
2347 | /* Assume that DECL will not be imported into this translation | |
2348 | unit. */ | |
2349 | import_p = false; | |
2350 | ||
2351 | /* See if the repository tells us whether or not to emit DECL in | |
2352 | this translation unit. */ | |
2353 | emit_p = repo_emit_p (decl); | |
2354 | if (emit_p == 0) | |
2355 | import_p = true; | |
2356 | else if (emit_p == 1) | |
2357 | { | |
2358 | /* The repository indicates that this entity should be defined | |
2359 | here. Make sure the back end honors that request. */ | |
2360 | if (TREE_CODE (decl) == VAR_DECL) | |
2361 | mark_needed (decl); | |
2362 | else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl) | |
2363 | || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl)) | |
a9aedbc2 | 2364 | { |
4684cd27 MM |
2365 | tree clone; |
2366 | FOR_EACH_CLONE (clone, decl) | |
2367 | mark_needed (clone); | |
a9aedbc2 | 2368 | } |
db5ae43f | 2369 | else |
4684cd27 MM |
2370 | mark_needed (decl); |
2371 | /* Output the definition as an ordinary strong definition. */ | |
2372 | DECL_EXTERNAL (decl) = 0; | |
2373 | DECL_INTERFACE_KNOWN (decl) = 1; | |
2374 | return; | |
2375 | } | |
2376 | ||
2377 | if (import_p) | |
2378 | /* We have already decided what to do with this DECL; there is no | |
2379 | need to check anything further. */ | |
2380 | ; | |
2381 | else if (TREE_CODE (decl) == VAR_DECL && DECL_VTABLE_OR_VTT_P (decl)) | |
2382 | { | |
1e731102 MM |
2383 | class_type = DECL_CONTEXT (decl); |
2384 | import_export_class (class_type); | |
2385 | if (TYPE_FOR_JAVA (class_type)) | |
4684cd27 | 2386 | import_p = true; |
1e731102 MM |
2387 | else if (CLASSTYPE_INTERFACE_KNOWN (class_type) |
2388 | && CLASSTYPE_INTERFACE_ONLY (class_type)) | |
4684cd27 | 2389 | import_p = true; |
e72f3fa1 | 2390 | else if ((!flag_weak || TARGET_WEAK_NOT_IN_ARCHIVE_TOC) |
1e731102 MM |
2391 | && !CLASSTYPE_USE_TEMPLATE (class_type) |
2392 | && CLASSTYPE_KEY_METHOD (class_type) | |
2393 | && !DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (class_type))) | |
4684cd27 MM |
2394 | /* The ABI requires that all virtual tables be emitted with |
2395 | COMDAT linkage. However, on systems where COMDAT symbols | |
2396 | don't show up in the table of contents for a static | |
e72f3fa1 MM |
2397 | archive, or on systems without weak symbols (where we |
2398 | approximate COMDAT linkage by using internal linkage), the | |
2399 | linker will report errors about undefined symbols because | |
2400 | it will not see the virtual table definition. Therefore, | |
2401 | in the case that we know that the virtual table will be | |
2402 | emitted in only one translation unit, we make the virtual | |
2403 | table an ordinary definition with external linkage. */ | |
4684cd27 | 2404 | DECL_EXTERNAL (decl) = 0; |
1e731102 | 2405 | else if (CLASSTYPE_INTERFACE_KNOWN (class_type)) |
b41d214e | 2406 | { |
1e731102 | 2407 | /* CLASS_TYPE is being exported from this translation unit, |
c8094d83 | 2408 | so DECL should be defined here. */ |
1e731102 | 2409 | if (!flag_weak && CLASSTYPE_EXPLICIT_INSTANTIATION (class_type)) |
e72f3fa1 MM |
2410 | /* If a class is declared in a header with the "extern |
2411 | template" extension, then it will not be instantiated, | |
2412 | even in translation units that would normally require | |
2413 | it. Often such classes are explicitly instantiated in | |
2414 | one translation unit. Therefore, the explicit | |
2415 | instantiation must be made visible to other translation | |
2416 | units. */ | |
2417 | DECL_EXTERNAL (decl) = 0; | |
2418 | else | |
2419 | { | |
1e731102 MM |
2420 | /* The generic C++ ABI says that class data is always |
2421 | COMDAT, even if there is a key function. Some | |
2422 | variants (e.g., the ARM EABI) says that class data | |
1a1d0917 MS |
2423 | only has COMDAT linkage if the class data might be |
2424 | emitted in more than one translation unit. When the | |
2425 | key method can be inline and is inline, we still have | |
2426 | to arrange for comdat even though | |
2427 | class_data_always_comdat is false. */ | |
1e731102 | 2428 | if (!CLASSTYPE_KEY_METHOD (class_type) |
67a70df6 | 2429 | || DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (class_type)) |
1e731102 MM |
2430 | || targetm.cxx.class_data_always_comdat ()) |
2431 | { | |
2432 | /* The ABI requires COMDAT linkage. Normally, we | |
2433 | only emit COMDAT things when they are needed; | |
2434 | make sure that we realize that this entity is | |
2435 | indeed needed. */ | |
2436 | comdat_p = true; | |
2437 | mark_needed (decl); | |
2438 | } | |
e72f3fa1 | 2439 | } |
b41d214e | 2440 | } |
4684cd27 | 2441 | else if (!flag_implicit_templates |
1e731102 | 2442 | && CLASSTYPE_IMPLICIT_INSTANTIATION (class_type)) |
4684cd27 MM |
2443 | import_p = true; |
2444 | else | |
2445 | comdat_p = true; | |
2446 | } | |
2447 | else if (TREE_CODE (decl) == VAR_DECL && DECL_TINFO_P (decl)) | |
2448 | { | |
2449 | tree type = TREE_TYPE (DECL_NAME (decl)); | |
2450 | if (CLASS_TYPE_P (type)) | |
2451 | { | |
1e731102 | 2452 | class_type = type; |
4684cd27 MM |
2453 | import_export_class (type); |
2454 | if (CLASSTYPE_INTERFACE_KNOWN (type) | |
2455 | && TYPE_POLYMORPHIC_P (type) | |
2456 | && CLASSTYPE_INTERFACE_ONLY (type) | |
2457 | /* If -fno-rtti was specified, then we cannot be sure | |
2458 | that RTTI information will be emitted with the | |
2459 | virtual table of the class, so we must emit it | |
2460 | wherever it is used. */ | |
2461 | && flag_rtti) | |
2462 | import_p = true; | |
c8094d83 | 2463 | else |
4684cd27 | 2464 | { |
4684cd27 MM |
2465 | if (CLASSTYPE_INTERFACE_KNOWN (type) |
2466 | && !CLASSTYPE_INTERFACE_ONLY (type)) | |
e72f3fa1 | 2467 | { |
1a1d0917 MS |
2468 | comdat_p = (targetm.cxx.class_data_always_comdat () |
2469 | || (CLASSTYPE_KEY_METHOD (type) | |
67a70df6 | 2470 | && DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (type)))); |
e72f3fa1 MM |
2471 | mark_needed (decl); |
2472 | if (!flag_weak) | |
2473 | { | |
2474 | comdat_p = false; | |
2475 | DECL_EXTERNAL (decl) = 0; | |
2476 | } | |
2477 | } | |
1e731102 MM |
2478 | else |
2479 | comdat_p = true; | |
4684cd27 MM |
2480 | } |
2481 | } | |
2482 | else | |
2483 | comdat_p = true; | |
2484 | } | |
2485 | else if (DECL_TEMPLATE_INSTANTIATION (decl) | |
2486 | || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl)) | |
2487 | { | |
2488 | /* DECL is an implicit instantiation of a function or static | |
2489 | data member. */ | |
23372b3f JJ |
2490 | if ((flag_implicit_templates |
2491 | && !flag_use_repository) | |
4684cd27 | 2492 | || (flag_implicit_inline_templates |
c8094d83 | 2493 | && TREE_CODE (decl) == FUNCTION_DECL |
4684cd27 MM |
2494 | && DECL_DECLARED_INLINE_P (decl))) |
2495 | comdat_p = true; | |
2496 | else | |
2497 | /* If we are not implicitly generating templates, then mark | |
2498 | this entity as undefined in this translation unit. */ | |
2499 | import_p = true; | |
00595019 MS |
2500 | } |
2501 | else if (DECL_FUNCTION_MEMBER_P (decl)) | |
2502 | { | |
79065db2 | 2503 | if (!DECL_DECLARED_INLINE_P (decl)) |
00595019 | 2504 | { |
92788413 MM |
2505 | tree ctype = DECL_CONTEXT (decl); |
2506 | import_export_class (ctype); | |
2507 | if (CLASSTYPE_INTERFACE_KNOWN (ctype)) | |
2508 | { | |
2509 | DECL_NOT_REALLY_EXTERN (decl) | |
2510 | = ! (CLASSTYPE_INTERFACE_ONLY (ctype) | |
c8094d83 | 2511 | || (DECL_DECLARED_INLINE_P (decl) |
79065db2 | 2512 | && ! flag_implement_inlines |
92788413 MM |
2513 | && !DECL_VINDEX (decl))); |
2514 | ||
b41d214e JM |
2515 | if (!DECL_NOT_REALLY_EXTERN (decl)) |
2516 | DECL_EXTERNAL (decl) = 1; | |
2517 | ||
92788413 MM |
2518 | /* Always make artificials weak. */ |
2519 | if (DECL_ARTIFICIAL (decl) && flag_weak) | |
4684cd27 | 2520 | comdat_p = true; |
92788413 MM |
2521 | else |
2522 | maybe_make_one_only (decl); | |
2523 | } | |
00595019 | 2524 | } |
db5ae43f | 2525 | else |
4684cd27 | 2526 | comdat_p = true; |
00595019 | 2527 | } |
db5ae43f | 2528 | else |
4684cd27 | 2529 | comdat_p = true; |
d689a8f1 | 2530 | |
4684cd27 | 2531 | if (import_p) |
d689a8f1 | 2532 | { |
4684cd27 MM |
2533 | /* If we are importing DECL into this translation unit, mark is |
2534 | an undefined here. */ | |
2535 | DECL_EXTERNAL (decl) = 1; | |
2536 | DECL_NOT_REALLY_EXTERN (decl) = 0; | |
d689a8f1 | 2537 | } |
4684cd27 | 2538 | else if (comdat_p) |
d689a8f1 | 2539 | { |
4684cd27 MM |
2540 | /* If we decided to put DECL in COMDAT, mark it accordingly at |
2541 | this point. */ | |
2542 | comdat_linkage (decl); | |
d689a8f1 | 2543 | } |
c6f553d1 | 2544 | |
d689a8f1 NS |
2545 | DECL_INTERFACE_KNOWN (decl) = 1; |
2546 | } | |
2547 | ||
c10cdb3d MM |
2548 | /* Return an expression that performs the destruction of DECL, which |
2549 | must be a VAR_DECL whose type has a non-trivial destructor, or is | |
2550 | an array whose (innermost) elements have a non-trivial destructor. */ | |
2551 | ||
72b7eeff | 2552 | tree |
848eed92 | 2553 | build_cleanup (tree decl) |
72b7eeff MS |
2554 | { |
2555 | tree temp; | |
2556 | tree type = TREE_TYPE (decl); | |
2557 | ||
c10cdb3d MM |
2558 | /* This function should only be called for declarations that really |
2559 | require cleanups. */ | |
50bc768d | 2560 | gcc_assert (!TYPE_HAS_TRIVIAL_DESTRUCTOR (type)); |
c10cdb3d MM |
2561 | |
2562 | /* Treat all objects with destructors as used; the destructor may do | |
2563 | something substantive. */ | |
2564 | mark_used (decl); | |
2565 | ||
72b7eeff MS |
2566 | if (TREE_CODE (type) == ARRAY_TYPE) |
2567 | temp = decl; | |
2568 | else | |
46a9e521 | 2569 | temp = build_address (decl); |
72b7eeff | 2570 | temp = build_delete (TREE_TYPE (temp), temp, |
86f45d2c | 2571 | sfk_complete_destructor, |
72b7eeff MS |
2572 | LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0); |
2573 | return temp; | |
2574 | } | |
2575 | ||
c395453c MM |
2576 | /* Returns the initialization guard variable for the variable DECL, |
2577 | which has static storage duration. */ | |
1f6e1acc | 2578 | |
c395453c | 2579 | tree |
848eed92 | 2580 | get_guard (tree decl) |
67d743fe | 2581 | { |
1f6e1acc | 2582 | tree sname; |
c395453c MM |
2583 | tree guard; |
2584 | ||
1f84ec23 | 2585 | sname = mangle_guard_variable (decl); |
c395453c MM |
2586 | guard = IDENTIFIER_GLOBAL_VALUE (sname); |
2587 | if (! guard) | |
2588 | { | |
2589 | tree guard_type; | |
2590 | ||
3461fba7 NS |
2591 | /* We use a type that is big enough to contain a mutex as well |
2592 | as an integer counter. */ | |
4185ae53 | 2593 | guard_type = targetm.cxx.guard_type (); |
c2255bc4 AH |
2594 | guard = build_decl (DECL_SOURCE_LOCATION (decl), |
2595 | VAR_DECL, sname, guard_type); | |
c8094d83 | 2596 | |
a1c65f9f | 2597 | /* The guard should have the same linkage as what it guards. */ |
844511c8 NS |
2598 | TREE_PUBLIC (guard) = TREE_PUBLIC (decl); |
2599 | TREE_STATIC (guard) = TREE_STATIC (decl); | |
2600 | DECL_COMMON (guard) = DECL_COMMON (decl); | |
07357341 | 2601 | DECL_COMDAT (guard) = DECL_COMDAT (decl); |
d35311a2 JM |
2602 | if (DECL_ONE_ONLY (decl)) |
2603 | make_decl_one_only (guard, cxx_comdat_group (guard)); | |
844511c8 | 2604 | if (TREE_PUBLIC (decl)) |
0cbd7506 | 2605 | DECL_WEAK (guard) = DECL_WEAK (decl); |
3fd40684 JM |
2606 | DECL_VISIBILITY (guard) = DECL_VISIBILITY (decl); |
2607 | DECL_VISIBILITY_SPECIFIED (guard) = DECL_VISIBILITY_SPECIFIED (decl); | |
c8094d83 | 2608 | |
c395453c | 2609 | DECL_ARTIFICIAL (guard) = 1; |
78e0d62b | 2610 | DECL_IGNORED_P (guard) = 1; |
c395453c | 2611 | TREE_USED (guard) = 1; |
170b020f | 2612 | pushdecl_top_level_and_finish (guard, NULL_TREE); |
c395453c MM |
2613 | } |
2614 | return guard; | |
2615 | } | |
2616 | ||
2617 | /* Return those bits of the GUARD variable that should be set when the | |
2618 | guarded entity is actually initialized. */ | |
2619 | ||
2620 | static tree | |
848eed92 | 2621 | get_guard_bits (tree guard) |
c395453c | 2622 | { |
4185ae53 PB |
2623 | if (!targetm.cxx.guard_mask_bit ()) |
2624 | { | |
2625 | /* We only set the first byte of the guard, in order to leave room | |
2626 | for a mutex in the high-order bits. */ | |
c8094d83 | 2627 | guard = build1 (ADDR_EXPR, |
4185ae53 PB |
2628 | build_pointer_type (TREE_TYPE (guard)), |
2629 | guard); | |
c8094d83 MS |
2630 | guard = build1 (NOP_EXPR, |
2631 | build_pointer_type (char_type_node), | |
4185ae53 PB |
2632 | guard); |
2633 | guard = build1 (INDIRECT_REF, char_type_node, guard); | |
2634 | } | |
c395453c MM |
2635 | |
2636 | return guard; | |
2637 | } | |
2638 | ||
2639 | /* Return an expression which determines whether or not the GUARD | |
2640 | variable has already been initialized. */ | |
2641 | ||
2642 | tree | |
848eed92 | 2643 | get_guard_cond (tree guard) |
c395453c MM |
2644 | { |
2645 | tree guard_value; | |
2646 | ||
2647 | /* Check to see if the GUARD is zero. */ | |
2648 | guard = get_guard_bits (guard); | |
4185ae53 PB |
2649 | |
2650 | /* Mask off all but the low bit. */ | |
2651 | if (targetm.cxx.guard_mask_bit ()) | |
2652 | { | |
2653 | guard_value = integer_one_node; | |
2654 | if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard))) | |
2655 | guard_value = convert (TREE_TYPE (guard), guard_value); | |
ba47d38d AH |
2656 | guard = cp_build_binary_op (input_location, |
2657 | BIT_AND_EXPR, guard, guard_value, | |
5ade1ed2 | 2658 | tf_warning_or_error); |
4185ae53 PB |
2659 | } |
2660 | ||
c395453c MM |
2661 | guard_value = integer_zero_node; |
2662 | if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard))) | |
2663 | guard_value = convert (TREE_TYPE (guard), guard_value); | |
ba47d38d AH |
2664 | return cp_build_binary_op (input_location, |
2665 | EQ_EXPR, guard, guard_value, | |
5ade1ed2 | 2666 | tf_warning_or_error); |
c395453c MM |
2667 | } |
2668 | ||
2669 | /* Return an expression which sets the GUARD variable, indicating that | |
2670 | the variable being guarded has been initialized. */ | |
2671 | ||
2672 | tree | |
848eed92 | 2673 | set_guard (tree guard) |
c395453c MM |
2674 | { |
2675 | tree guard_init; | |
2676 | ||
2677 | /* Set the GUARD to one. */ | |
2678 | guard = get_guard_bits (guard); | |
2679 | guard_init = integer_one_node; | |
2680 | if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard))) | |
2681 | guard_init = convert (TREE_TYPE (guard), guard_init); | |
5ade1ed2 DG |
2682 | return cp_build_modify_expr (guard, NOP_EXPR, guard_init, |
2683 | tf_warning_or_error); | |
67d743fe MS |
2684 | } |
2685 | ||
961ec1a5 JM |
2686 | /* Start the process of running a particular set of global constructors |
2687 | or destructors. Subroutine of do_[cd]tors. */ | |
2688 | ||
914653a2 | 2689 | static tree |
848eed92 | 2690 | start_objects (int method_type, int initp) |
961ec1a5 | 2691 | { |
914653a2 | 2692 | tree body; |
058b15c1 | 2693 | tree fndecl; |
2ce3c6c6 | 2694 | char type[10]; |
961ec1a5 JM |
2695 | |
2696 | /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */ | |
2697 | ||
000ab922 | 2698 | if (initp != DEFAULT_INIT_PRIORITY) |
2ce3c6c6 | 2699 | { |
066d147c MH |
2700 | char joiner; |
2701 | ||
2702 | #ifdef JOINER | |
2703 | joiner = JOINER; | |
2704 | #else | |
2705 | joiner = '_'; | |
2706 | #endif | |
2ce3c6c6 | 2707 | |
066d147c | 2708 | sprintf (type, "%c%c%.5u", method_type, joiner, initp); |
2ce3c6c6 JM |
2709 | } |
2710 | else | |
2711 | sprintf (type, "%c", method_type); | |
2712 | ||
c8094d83 | 2713 | fndecl = build_lang_decl (FUNCTION_DECL, |
5880f14f | 2714 | get_file_function_name (type), |
0244e6f7 NF |
2715 | build_function_type_list (void_type_node, |
2716 | NULL_TREE)); | |
058b15c1 | 2717 | start_preparsed_function (fndecl, /*attrs=*/NULL_TREE, SF_PRE_PARSED); |
961ec1a5 | 2718 | |
7be82279 | 2719 | TREE_PUBLIC (current_function_decl) = 0; |
b4bb92e5 | 2720 | |
32d49134 GK |
2721 | /* Mark as artificial because it's not explicitly in the user's |
2722 | source code. */ | |
2723 | DECL_ARTIFICIAL (current_function_decl) = 1; | |
2724 | ||
5fdaba89 MM |
2725 | /* Mark this declaration as used to avoid spurious warnings. */ |
2726 | TREE_USED (current_function_decl) = 1; | |
2727 | ||
2b76013c MM |
2728 | /* Mark this function as a global constructor or destructor. */ |
2729 | if (method_type == 'I') | |
2730 | DECL_GLOBAL_CTOR_P (current_function_decl) = 1; | |
2731 | else | |
2732 | DECL_GLOBAL_DTOR_P (current_function_decl) = 1; | |
2b76013c | 2733 | |
325c3691 | 2734 | body = begin_compound_stmt (BCS_FN_BODY); |
b3f738da | 2735 | |
914653a2 | 2736 | return body; |
961ec1a5 JM |
2737 | } |
2738 | ||
2739 | /* Finish the process of running a particular set of global constructors | |
2740 | or destructors. Subroutine of do_[cd]tors. */ | |
2741 | ||
2742 | static void | |
848eed92 | 2743 | finish_objects (int method_type, int initp, tree body) |
961ec1a5 | 2744 | { |
914653a2 | 2745 | tree fn; |
961ec1a5 | 2746 | |
c7cb8979 | 2747 | /* Finish up. */ |
7a3397c7 | 2748 | finish_compound_stmt (body); |
0acf7199 | 2749 | fn = finish_function (0); |
84df082b | 2750 | |
09191b7e | 2751 | if (method_type == 'I') |
2cc07db4 | 2752 | { |
09191b7e JH |
2753 | DECL_STATIC_CONSTRUCTOR (fn) = 1; |
2754 | decl_init_priority_insert (fn, initp); | |
2cc07db4 | 2755 | } |
09191b7e JH |
2756 | else |
2757 | { | |
2758 | DECL_STATIC_DESTRUCTOR (fn) = 1; | |
2759 | decl_fini_priority_insert (fn, initp); | |
2760 | } | |
2761 | ||
2762 | expand_or_defer_fn (fn); | |
961ec1a5 JM |
2763 | } |
2764 | ||
0aafb128 MM |
2765 | /* The names of the parameters to the function created to handle |
2766 | initializations and destructions for objects with static storage | |
2767 | duration. */ | |
2768 | #define INITIALIZE_P_IDENTIFIER "__initialize_p" | |
2769 | #define PRIORITY_IDENTIFIER "__priority" | |
2770 | ||
2771 | /* The name of the function we create to handle initializations and | |
2772 | destructions for objects with static storage duration. */ | |
2773 | #define SSDF_IDENTIFIER "__static_initialization_and_destruction" | |
2774 | ||
2775 | /* The declaration for the __INITIALIZE_P argument. */ | |
e2500fed | 2776 | static GTY(()) tree initialize_p_decl; |
0aafb128 MM |
2777 | |
2778 | /* The declaration for the __PRIORITY argument. */ | |
e2500fed | 2779 | static GTY(()) tree priority_decl; |
0aafb128 MM |
2780 | |
2781 | /* The declaration for the static storage duration function. */ | |
e2500fed | 2782 | static GTY(()) tree ssdf_decl; |
0aafb128 | 2783 | |
0352cfc8 MM |
2784 | /* All the static storage duration functions created in this |
2785 | translation unit. */ | |
1bc5f355 | 2786 | static GTY(()) VEC(tree,gc) *ssdf_decls; |
0352cfc8 | 2787 | |
0aafb128 MM |
2788 | /* A map from priority levels to information about that priority |
2789 | level. There may be many such levels, so efficient lookup is | |
2790 | important. */ | |
2791 | static splay_tree priority_info_map; | |
2792 | ||
2793 | /* Begins the generation of the function that will handle all | |
2794 | initialization and destruction of objects with static storage | |
2795 | duration. The function generated takes two parameters of type | |
2796 | `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is | |
838dfd8a | 2797 | nonzero, it performs initializations. Otherwise, it performs |
0aafb128 MM |
2798 | destructions. It only performs those initializations or |
2799 | destructions with the indicated __PRIORITY. The generated function | |
c8094d83 | 2800 | returns no value. |
0aafb128 MM |
2801 | |
2802 | It is assumed that this function will only be called once per | |
2803 | translation unit. */ | |
961ec1a5 | 2804 | |
313bc2c2 | 2805 | static tree |
299f79b5 | 2806 | start_static_storage_duration_function (unsigned count) |
961ec1a5 | 2807 | { |
0aafb128 | 2808 | tree type; |
313bc2c2 | 2809 | tree body; |
0352cfc8 MM |
2810 | char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32]; |
2811 | ||
2812 | /* Create the identifier for this function. It will be of the form | |
2813 | SSDF_IDENTIFIER_<number>. */ | |
299f79b5 | 2814 | sprintf (id, "%s_%u", SSDF_IDENTIFIER, count); |
0aafb128 | 2815 | |
0244e6f7 NF |
2816 | type = build_function_type_list (void_type_node, |
2817 | integer_type_node, integer_type_node, | |
2818 | NULL_TREE); | |
0aafb128 MM |
2819 | |
2820 | /* Create the FUNCTION_DECL itself. */ | |
c8094d83 | 2821 | ssdf_decl = build_lang_decl (FUNCTION_DECL, |
0352cfc8 | 2822 | get_identifier (id), |
0aafb128 MM |
2823 | type); |
2824 | TREE_PUBLIC (ssdf_decl) = 0; | |
2825 | DECL_ARTIFICIAL (ssdf_decl) = 1; | |
0352cfc8 MM |
2826 | |
2827 | /* Put this function in the list of functions to be called from the | |
2828 | static constructors and destructors. */ | |
2829 | if (!ssdf_decls) | |
2830 | { | |
1bc5f355 | 2831 | ssdf_decls = VEC_alloc (tree, gc, 32); |
0352cfc8 MM |
2832 | |
2833 | /* Take this opportunity to initialize the map from priority | |
a1c65f9f | 2834 | numbers to information about that priority level. */ |
0352cfc8 MM |
2835 | priority_info_map = splay_tree_new (splay_tree_compare_ints, |
2836 | /*delete_key_fn=*/0, | |
2837 | /*delete_value_fn=*/ | |
2838 | (splay_tree_delete_value_fn) &free); | |
2839 | ||
2840 | /* We always need to generate functions for the | |
2841 | DEFAULT_INIT_PRIORITY so enter it now. That way when we walk | |
2842 | priorities later, we'll be sure to find the | |
2843 | DEFAULT_INIT_PRIORITY. */ | |
2844 | get_priority_info (DEFAULT_INIT_PRIORITY); | |
2845 | } | |
2846 | ||
1bc5f355 | 2847 | VEC_safe_push (tree, gc, ssdf_decls, ssdf_decl); |
0aafb128 MM |
2848 | |
2849 | /* Create the argument list. */ | |
8e51619a JM |
2850 | initialize_p_decl = cp_build_parm_decl |
2851 | (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node); | |
0aafb128 | 2852 | DECL_CONTEXT (initialize_p_decl) = ssdf_decl; |
0aafb128 | 2853 | TREE_USED (initialize_p_decl) = 1; |
8e51619a JM |
2854 | priority_decl = cp_build_parm_decl |
2855 | (get_identifier (PRIORITY_IDENTIFIER), integer_type_node); | |
0aafb128 | 2856 | DECL_CONTEXT (priority_decl) = ssdf_decl; |
0aafb128 MM |
2857 | TREE_USED (priority_decl) = 1; |
2858 | ||
910ad8de | 2859 | DECL_CHAIN (initialize_p_decl) = priority_decl; |
0aafb128 MM |
2860 | DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl; |
2861 | ||
13ef1ec5 MM |
2862 | /* Put the function in the global scope. */ |
2863 | pushdecl (ssdf_decl); | |
2864 | ||
cd0be382 | 2865 | /* Start the function itself. This is equivalent to declaring the |
0aafb128 MM |
2866 | function as: |
2867 | ||
c472cdfd | 2868 | static void __ssdf (int __initialize_p, init __priority_p); |
c8094d83 | 2869 | |
0aafb128 MM |
2870 | It is static because we only need to call this function from the |
2871 | various constructor and destructor functions for this module. */ | |
058b15c1 MM |
2872 | start_preparsed_function (ssdf_decl, |
2873 | /*attrs=*/NULL_TREE, | |
2874 | SF_PRE_PARSED); | |
0aafb128 MM |
2875 | |
2876 | /* Set up the scope of the outermost block in the function. */ | |
325c3691 | 2877 | body = begin_compound_stmt (BCS_FN_BODY); |
2ce3c6c6 | 2878 | |
313bc2c2 | 2879 | return body; |
961ec1a5 JM |
2880 | } |
2881 | ||
0aafb128 MM |
2882 | /* Finish the generation of the function which performs initialization |
2883 | and destruction of objects with static storage duration. After | |
2884 | this point, no more such objects can be created. */ | |
961ec1a5 JM |
2885 | |
2886 | static void | |
848eed92 | 2887 | finish_static_storage_duration_function (tree body) |
961ec1a5 | 2888 | { |
0aafb128 | 2889 | /* Close out the function. */ |
7a3397c7 | 2890 | finish_compound_stmt (body); |
8cd2462c | 2891 | expand_or_defer_fn (finish_function (0)); |
0aafb128 | 2892 | } |
961ec1a5 | 2893 | |
0aafb128 MM |
2894 | /* Return the information about the indicated PRIORITY level. If no |
2895 | code to handle this level has yet been generated, generate the | |
2896 | appropriate prologue. */ | |
961ec1a5 | 2897 | |
0aafb128 | 2898 | static priority_info |
848eed92 | 2899 | get_priority_info (int priority) |
0aafb128 MM |
2900 | { |
2901 | priority_info pi; | |
2902 | splay_tree_node n; | |
2903 | ||
c8094d83 | 2904 | n = splay_tree_lookup (priority_info_map, |
0aafb128 MM |
2905 | (splay_tree_key) priority); |
2906 | if (!n) | |
2907 | { | |
2908 | /* Create a new priority information structure, and insert it | |
2909 | into the map. */ | |
0ac1b889 | 2910 | pi = XNEW (struct priority_info_s); |
0352cfc8 MM |
2911 | pi->initializations_p = 0; |
2912 | pi->destructions_p = 0; | |
0aafb128 MM |
2913 | splay_tree_insert (priority_info_map, |
2914 | (splay_tree_key) priority, | |
2915 | (splay_tree_value) pi); | |
2916 | } | |
2917 | else | |
2918 | pi = (priority_info) n->value; | |
961ec1a5 | 2919 | |
0aafb128 MM |
2920 | return pi; |
2921 | } | |
961ec1a5 | 2922 | |
6cec5cb5 RG |
2923 | /* The effective initialization priority of a DECL. */ |
2924 | ||
2925 | #define DECL_EFFECTIVE_INIT_PRIORITY(decl) \ | |
2926 | ((!DECL_HAS_INIT_PRIORITY_P (decl) || DECL_INIT_PRIORITY (decl) == 0) \ | |
2927 | ? DEFAULT_INIT_PRIORITY : DECL_INIT_PRIORITY (decl)) | |
2928 | ||
dd36d4e1 | 2929 | /* Whether a DECL needs a guard to protect it against multiple |
6cec5cb5 RG |
2930 | initialization. */ |
2931 | ||
2932 | #define NEEDS_GUARD_P(decl) (TREE_PUBLIC (decl) && (DECL_COMMON (decl) \ | |
2933 | || DECL_ONE_ONLY (decl) \ | |
2934 | || DECL_WEAK (decl))) | |
2935 | ||
e44c800e DS |
2936 | /* Called from one_static_initialization_or_destruction(), |
2937 | via walk_tree. | |
2938 | Walks the initializer list of a global variable and looks for | |
2939 | temporary variables (DECL_NAME() == NULL and DECL_ARTIFICIAL != 0) | |
2940 | and that have their DECL_CONTEXT() == NULL. | |
2941 | For each such temporary variable, set their DECL_CONTEXT() to | |
2942 | the current function. This is necessary because otherwise | |
2943 | some optimizers (enabled by -O2 -fprofile-arcs) might crash | |
2944 | when trying to refer to a temporary variable that does not have | |
2945 | it's DECL_CONTECT() properly set. */ | |
2946 | static tree | |
2947 | fix_temporary_vars_context_r (tree *node, | |
2948 | int *unused ATTRIBUTE_UNUSED, | |
2949 | void *unused1 ATTRIBUTE_UNUSED) | |
2950 | { | |
2951 | gcc_assert (current_function_decl); | |
2952 | ||
2953 | if (TREE_CODE (*node) == BIND_EXPR) | |
2954 | { | |
2955 | tree var; | |
2956 | ||
910ad8de | 2957 | for (var = BIND_EXPR_VARS (*node); var; var = DECL_CHAIN (var)) |
e44c800e DS |
2958 | if (TREE_CODE (var) == VAR_DECL |
2959 | && !DECL_NAME (var) | |
2960 | && DECL_ARTIFICIAL (var) | |
2961 | && !DECL_CONTEXT (var)) | |
2962 | DECL_CONTEXT (var) = current_function_decl; | |
2963 | } | |
2964 | ||
2965 | return NULL_TREE; | |
2966 | } | |
2967 | ||
313bc2c2 | 2968 | /* Set up to handle the initialization or destruction of DECL. If |
838dfd8a | 2969 | INITP is nonzero, we are initializing the variable. Otherwise, we |
313bc2c2 MM |
2970 | are destroying it. */ |
2971 | ||
6cec5cb5 RG |
2972 | static void |
2973 | one_static_initialization_or_destruction (tree decl, tree init, bool initp) | |
313bc2c2 | 2974 | { |
c395453c | 2975 | tree guard_if_stmt = NULL_TREE; |
c395453c | 2976 | tree guard; |
313bc2c2 | 2977 | |
6cec5cb5 RG |
2978 | /* If we are supposed to destruct and there's a trivial destructor, |
2979 | nothing has to be done. */ | |
2980 | if (!initp | |
2981 | && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) | |
2982 | return; | |
313bc2c2 MM |
2983 | |
2984 | /* Trick the compiler into thinking we are at the file and line | |
2985 | where DECL was declared so that error-messages make sense, and so | |
2986 | that the debugger will show somewhat sensible file and line | |
2987 | information. */ | |
f31686a3 | 2988 | input_location = DECL_SOURCE_LOCATION (decl); |
313bc2c2 | 2989 | |
e44c800e DS |
2990 | /* Make sure temporary variables in the initialiser all have |
2991 | their DECL_CONTEXT() set to a value different from NULL_TREE. | |
2992 | This can happen when global variables initialisers are built. | |
2993 | In that case, the DECL_CONTEXT() of the global variables _AND_ of all | |
2994 | the temporary variables that might have been generated in the | |
2995 | accompagning initialisers is NULL_TREE, meaning the variables have been | |
2996 | declared in the global namespace. | |
2997 | What we want to do here is to fix that and make sure the DECL_CONTEXT() | |
2998 | of the temporaries are set to the current function decl. */ | |
2999 | cp_walk_tree_without_duplicates (&init, | |
3000 | fix_temporary_vars_context_r, | |
3001 | NULL); | |
3002 | ||
313bc2c2 MM |
3003 | /* Because of: |
3004 | ||
3005 | [class.access.spec] | |
3006 | ||
3007 | Access control for implicit calls to the constructors, | |
3008 | the conversion functions, or the destructor called to | |
3009 | create and destroy a static data member is performed as | |
3010 | if these calls appeared in the scope of the member's | |
c8094d83 | 3011 | class. |
313bc2c2 MM |
3012 | |
3013 | we pretend we are in a static member function of the class of | |
3014 | which the DECL is a member. */ | |
3015 | if (member_p (decl)) | |
3016 | { | |
4f1c5b7d | 3017 | DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl); |
313bc2c2 MM |
3018 | DECL_STATIC_FUNCTION_P (current_function_decl) = 1; |
3019 | } | |
c8094d83 | 3020 | |
c395453c MM |
3021 | /* Assume we don't need a guard. */ |
3022 | guard = NULL_TREE; | |
3023 | /* We need a guard if this is an object with external linkage that | |
1f6e1acc AS |
3024 | might be initialized in more than one place. (For example, a |
3025 | static data member of a template, when the data member requires | |
3026 | construction.) */ | |
6cec5cb5 | 3027 | if (NEEDS_GUARD_P (decl)) |
313bc2c2 | 3028 | { |
c395453c | 3029 | tree guard_cond; |
313bc2c2 | 3030 | |
c395453c | 3031 | guard = get_guard (decl); |
313bc2c2 | 3032 | |
c395453c MM |
3033 | /* When using __cxa_atexit, we just check the GUARD as we would |
3034 | for a local static. */ | |
3035 | if (flag_use_cxa_atexit) | |
3036 | { | |
3037 | /* When using __cxa_atexit, we never try to destroy | |
3038 | anything from a static destructor. */ | |
50bc768d | 3039 | gcc_assert (initp); |
c395453c MM |
3040 | guard_cond = get_guard_cond (guard); |
3041 | } | |
5fd893d5 MM |
3042 | /* If we don't have __cxa_atexit, then we will be running |
3043 | destructors from .fini sections, or their equivalents. So, | |
3044 | we need to know how many times we've tried to initialize this | |
3045 | object. We do initializations only if the GUARD is zero, | |
3046 | i.e., if we are the first to initialize the variable. We do | |
3047 | destructions only if the GUARD is one, i.e., if we are the | |
3048 | last to destroy the variable. */ | |
c395453c | 3049 | else if (initp) |
c8094d83 | 3050 | guard_cond |
ba47d38d AH |
3051 | = cp_build_binary_op (input_location, |
3052 | EQ_EXPR, | |
5ade1ed2 | 3053 | cp_build_unary_op (PREINCREMENT_EXPR, |
ba47d38d AH |
3054 | guard, |
3055 | /*noconvert=*/1, | |
3056 | tf_warning_or_error), | |
5ade1ed2 DG |
3057 | integer_one_node, |
3058 | tf_warning_or_error); | |
313bc2c2 | 3059 | else |
c8094d83 | 3060 | guard_cond |
ba47d38d AH |
3061 | = cp_build_binary_op (input_location, |
3062 | EQ_EXPR, | |
5ade1ed2 | 3063 | cp_build_unary_op (PREDECREMENT_EXPR, |
ba47d38d AH |
3064 | guard, |
3065 | /*noconvert=*/1, | |
3066 | tf_warning_or_error), | |
5ade1ed2 DG |
3067 | integer_zero_node, |
3068 | tf_warning_or_error); | |
ab76ca54 | 3069 | |
6cec5cb5 RG |
3070 | guard_if_stmt = begin_if_stmt (); |
3071 | finish_if_stmt_cond (guard_cond, guard_if_stmt); | |
313bc2c2 MM |
3072 | } |
3073 | ||
c395453c | 3074 | |
5fd893d5 MM |
3075 | /* If we're using __cxa_atexit, we have not already set the GUARD, |
3076 | so we must do so now. */ | |
3077 | if (guard && initp && flag_use_cxa_atexit) | |
c395453c | 3078 | finish_expr_stmt (set_guard (guard)); |
313bc2c2 | 3079 | |
6cec5cb5 RG |
3080 | /* Perform the initialization or destruction. */ |
3081 | if (initp) | |
3082 | { | |
3083 | if (init) | |
3db45ab5 | 3084 | finish_expr_stmt (init); |
313bc2c2 | 3085 | |
6cec5cb5 | 3086 | /* If we're using __cxa_atexit, register a function that calls the |
3db45ab5 | 3087 | destructor for the object. */ |
6cec5cb5 | 3088 | if (flag_use_cxa_atexit) |
3db45ab5 | 3089 | finish_expr_stmt (register_dtor_fn (decl)); |
6cec5cb5 RG |
3090 | } |
3091 | else | |
3092 | finish_expr_stmt (build_cleanup (decl)); | |
313bc2c2 | 3093 | |
6cec5cb5 RG |
3094 | /* Finish the guard if-stmt, if necessary. */ |
3095 | if (guard) | |
3096 | { | |
3097 | finish_then_clause (guard_if_stmt); | |
3098 | finish_if_stmt (guard_if_stmt); | |
3099 | } | |
313bc2c2 MM |
3100 | |
3101 | /* Now that we're done with DECL we don't need to pretend to be a | |
3102 | member of its class any longer. */ | |
4f1c5b7d | 3103 | DECL_CONTEXT (current_function_decl) = NULL_TREE; |
313bc2c2 MM |
3104 | DECL_STATIC_FUNCTION_P (current_function_decl) = 0; |
3105 | } | |
3106 | ||
6cec5cb5 RG |
3107 | /* Generate code to do the initialization or destruction of the decls in VARS, |
3108 | a TREE_LIST of VAR_DECL with static storage duration. | |
3109 | Whether initialization or destruction is performed is specified by INITP. */ | |
961ec1a5 | 3110 | |
0aafb128 | 3111 | static void |
6cec5cb5 | 3112 | do_static_initialization_or_destruction (tree vars, bool initp) |
0aafb128 | 3113 | { |
6cec5cb5 | 3114 | tree node, init_if_stmt, cond; |
0aafb128 | 3115 | |
6cec5cb5 RG |
3116 | /* Build the outer if-stmt to check for initialization or destruction. */ |
3117 | init_if_stmt = begin_if_stmt (); | |
3118 | cond = initp ? integer_one_node : integer_zero_node; | |
ba47d38d AH |
3119 | cond = cp_build_binary_op (input_location, |
3120 | EQ_EXPR, | |
5ade1ed2 DG |
3121 | initialize_p_decl, |
3122 | cond, | |
3123 | tf_warning_or_error); | |
6cec5cb5 RG |
3124 | finish_if_stmt_cond (cond, init_if_stmt); |
3125 | ||
3126 | node = vars; | |
3127 | do { | |
3128 | tree decl = TREE_VALUE (node); | |
3129 | tree priority_if_stmt; | |
3130 | int priority; | |
3131 | priority_info pi; | |
3132 | ||
3133 | /* If we don't need a destructor, there's nothing to do. Avoid | |
3134 | creating a possibly empty if-stmt. */ | |
3135 | if (!initp && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl))) | |
3136 | { | |
3137 | node = TREE_CHAIN (node); | |
3138 | continue; | |
3139 | } | |
3140 | ||
3141 | /* Remember that we had an initialization or finalization at this | |
3142 | priority. */ | |
3143 | priority = DECL_EFFECTIVE_INIT_PRIORITY (decl); | |
3144 | pi = get_priority_info (priority); | |
3145 | if (initp) | |
3146 | pi->initializations_p = 1; | |
3147 | else | |
3148 | pi->destructions_p = 1; | |
3149 | ||
3150 | /* Conditionalize this initialization on being in the right priority | |
3151 | and being initializing/finalizing appropriately. */ | |
3152 | priority_if_stmt = begin_if_stmt (); | |
ba47d38d AH |
3153 | cond = cp_build_binary_op (input_location, |
3154 | EQ_EXPR, | |
6cec5cb5 | 3155 | priority_decl, |
5ade1ed2 DG |
3156 | build_int_cst (NULL_TREE, priority), |
3157 | tf_warning_or_error); | |
6cec5cb5 RG |
3158 | finish_if_stmt_cond (cond, priority_if_stmt); |
3159 | ||
3160 | /* Process initializers with same priority. */ | |
3161 | for (; node | |
3162 | && DECL_EFFECTIVE_INIT_PRIORITY (TREE_VALUE (node)) == priority; | |
3163 | node = TREE_CHAIN (node)) | |
3164 | /* Do one initialization or destruction. */ | |
3165 | one_static_initialization_or_destruction (TREE_VALUE (node), | |
3db45ab5 | 3166 | TREE_PURPOSE (node), initp); |
6cec5cb5 RG |
3167 | |
3168 | /* Finish up the priority if-stmt body. */ | |
3169 | finish_then_clause (priority_if_stmt); | |
3170 | finish_if_stmt (priority_if_stmt); | |
3171 | ||
3172 | } while (node); | |
3173 | ||
3174 | /* Finish up the init/destruct if-stmt body. */ | |
3175 | finish_then_clause (init_if_stmt); | |
3176 | finish_if_stmt (init_if_stmt); | |
961ec1a5 JM |
3177 | } |
3178 | ||
313bc2c2 MM |
3179 | /* VARS is a list of variables with static storage duration which may |
3180 | need initialization and/or finalization. Remove those variables | |
3181 | that don't really need to be initialized or finalized, and return | |
3182 | the resulting list. The order in which the variables appear in | |
3183 | VARS is in reverse order of the order in which they should actually | |
3184 | be initialized. The list we return is in the unreversed order; | |
3185 | i.e., the first variable should be initialized first. */ | |
8d08fdba | 3186 | |
313bc2c2 | 3187 | static tree |
cec24319 | 3188 | prune_vars_needing_no_initialization (tree *vars) |
8d08fdba | 3189 | { |
cec24319 MM |
3190 | tree *var = vars; |
3191 | tree result = NULL_TREE; | |
8d08fdba | 3192 | |
cec24319 | 3193 | while (*var) |
313bc2c2 | 3194 | { |
cec24319 MM |
3195 | tree t = *var; |
3196 | tree decl = TREE_VALUE (t); | |
3197 | tree init = TREE_PURPOSE (t); | |
8d2733ca | 3198 | |
313bc2c2 MM |
3199 | /* Deal gracefully with error. */ |
3200 | if (decl == error_mark_node) | |
cec24319 MM |
3201 | { |
3202 | var = &TREE_CHAIN (t); | |
3203 | continue; | |
3204 | } | |
5566b478 | 3205 | |
313bc2c2 | 3206 | /* The only things that can be initialized are variables. */ |
50bc768d | 3207 | gcc_assert (TREE_CODE (decl) == VAR_DECL); |
8d08fdba | 3208 | |
313bc2c2 MM |
3209 | /* If this object is not defined, we don't need to do anything |
3210 | here. */ | |
3211 | if (DECL_EXTERNAL (decl)) | |
cec24319 MM |
3212 | { |
3213 | var = &TREE_CHAIN (t); | |
3214 | continue; | |
3215 | } | |
8d08fdba | 3216 | |
313bc2c2 MM |
3217 | /* Also, if the initializer already contains errors, we can bail |
3218 | out now. */ | |
c8094d83 | 3219 | if (init && TREE_CODE (init) == TREE_LIST |
313bc2c2 | 3220 | && value_member (error_mark_node, init)) |
cec24319 MM |
3221 | { |
3222 | var = &TREE_CHAIN (t); | |
3223 | continue; | |
3224 | } | |
d18c083e | 3225 | |
313bc2c2 MM |
3226 | /* This variable is going to need initialization and/or |
3227 | finalization, so we add it to the list. */ | |
cec24319 MM |
3228 | *var = TREE_CHAIN (t); |
3229 | TREE_CHAIN (t) = result; | |
3230 | result = t; | |
313bc2c2 | 3231 | } |
1139b3d8 | 3232 | |
313bc2c2 MM |
3233 | return result; |
3234 | } | |
1139b3d8 | 3235 | |
313bc2c2 MM |
3236 | /* Make sure we have told the back end about all the variables in |
3237 | VARS. */ | |
0aafb128 | 3238 | |
313bc2c2 | 3239 | static void |
848eed92 | 3240 | write_out_vars (tree vars) |
313bc2c2 MM |
3241 | { |
3242 | tree v; | |
0aafb128 | 3243 | |
313bc2c2 | 3244 | for (v = vars; v; v = TREE_CHAIN (v)) |
4684cd27 MM |
3245 | { |
3246 | tree var = TREE_VALUE (v); | |
3247 | if (!var_finalized_p (var)) | |
3248 | { | |
3249 | import_export_decl (var); | |
0e6df31e | 3250 | rest_of_decl_compilation (var, 1, 1); |
4684cd27 MM |
3251 | } |
3252 | } | |
0aafb128 | 3253 | } |
909e536a | 3254 | |
0aafb128 | 3255 | /* Generate a static constructor (if CONSTRUCTOR_P) or destructor |
44cbf6e4 | 3256 | (otherwise) that will initialize all global objects with static |
0aafb128 | 3257 | storage duration having the indicated PRIORITY. */ |
73aad9b9 | 3258 | |
0aafb128 | 3259 | static void |
299f79b5 NS |
3260 | generate_ctor_or_dtor_function (bool constructor_p, int priority, |
3261 | location_t *locus) | |
0aafb128 MM |
3262 | { |
3263 | char function_key; | |
35b4a576 | 3264 | tree fndecl; |
914653a2 | 3265 | tree body; |
0352cfc8 | 3266 | size_t i; |
73aad9b9 | 3267 | |
82a98427 | 3268 | input_location = *locus; |
93409b8c | 3269 | /* ??? */ |
2d593c86 | 3270 | /* Was: locus->line++; */ |
c8094d83 | 3271 | |
0aafb128 MM |
3272 | /* We use `I' to indicate initialization and `D' to indicate |
3273 | destruction. */ | |
35b4a576 | 3274 | function_key = constructor_p ? 'I' : 'D'; |
73aad9b9 | 3275 | |
35b4a576 RS |
3276 | /* We emit the function lazily, to avoid generating empty |
3277 | global constructors and destructors. */ | |
3278 | body = NULL_TREE; | |
2c73f9f5 | 3279 | |
e58a9aa1 ZL |
3280 | /* For Objective-C++, we may need to initialize metadata found in this module. |
3281 | This must be done _before_ any other static initializations. */ | |
3282 | if (c_dialect_objc () && (priority == DEFAULT_INIT_PRIORITY) | |
3283 | && constructor_p && objc_static_init_needed_p ()) | |
3284 | { | |
3285 | body = start_objects (function_key, priority); | |
fc8600f9 | 3286 | objc_generate_static_init_call (NULL_TREE); |
e58a9aa1 ZL |
3287 | } |
3288 | ||
0aafb128 MM |
3289 | /* Call the static storage duration function with appropriate |
3290 | arguments. */ | |
ac47786e | 3291 | FOR_EACH_VEC_ELT (tree, ssdf_decls, i, fndecl) |
1bc5f355 KH |
3292 | { |
3293 | /* Calls to pure or const functions will expand to nothing. */ | |
3294 | if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE))) | |
3295 | { | |
450f4293 NF |
3296 | tree call; |
3297 | ||
1bc5f355 KH |
3298 | if (! body) |
3299 | body = start_objects (function_key, priority); | |
3300 | ||
450f4293 NF |
3301 | call = cp_build_function_call_nary (fndecl, tf_warning_or_error, |
3302 | build_int_cst (NULL_TREE, | |
3303 | constructor_p), | |
3304 | build_int_cst (NULL_TREE, | |
3305 | priority), | |
3306 | NULL_TREE); | |
3307 | finish_expr_stmt (call); | |
1bc5f355 KH |
3308 | } |
3309 | } | |
909e536a | 3310 | |
0aafb128 | 3311 | /* Close out the function. */ |
35b4a576 RS |
3312 | if (body) |
3313 | finish_objects (function_key, priority, body); | |
0aafb128 | 3314 | } |
44a8d0b3 | 3315 | |
0aafb128 | 3316 | /* Generate constructor and destructor functions for the priority |
0352cfc8 | 3317 | indicated by N. */ |
44a8d0b3 | 3318 | |
0aafb128 | 3319 | static int |
299f79b5 | 3320 | generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data) |
0aafb128 | 3321 | { |
67f5655f | 3322 | location_t *locus = (location_t *) data; |
0aafb128 MM |
3323 | int priority = (int) n->key; |
3324 | priority_info pi = (priority_info) n->value; | |
0aafb128 MM |
3325 | |
3326 | /* Generate the functions themselves, but only if they are really | |
3327 | needed. */ | |
fc8600f9 | 3328 | if (pi->initializations_p) |
299f79b5 | 3329 | generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus); |
fc8600f9 | 3330 | if (pi->destructions_p) |
299f79b5 | 3331 | generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus); |
0aafb128 MM |
3332 | |
3333 | /* Keep iterating. */ | |
3334 | return 0; | |
3335 | } | |
2ce3c6c6 | 3336 | |
25c84396 | 3337 | /* Called via LANGHOOK_CALLGRAPH_ANALYZE_EXPR. It is supposed to mark |
3b426391 | 3338 | decls referenced from front-end specific constructs; it will be called |
25c84396 RH |
3339 | only for language-specific tree nodes. |
3340 | ||
3341 | Here we must deal with member pointers. */ | |
3342 | ||
3343 | tree | |
c4e622b6 | 3344 | cxx_callgraph_analyze_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED) |
8cd2462c | 3345 | { |
dd07abd7 RH |
3346 | tree t = *tp; |
3347 | ||
4684cd27 MM |
3348 | switch (TREE_CODE (t)) |
3349 | { | |
3350 | case PTRMEM_CST: | |
3351 | if (TYPE_PTRMEMFUNC_P (TREE_TYPE (t))) | |
39ff5a96 | 3352 | cgraph_mark_address_taken_node (cgraph_node (PTRMEM_CST_MEMBER (t))); |
4684cd27 MM |
3353 | break; |
3354 | case BASELINK: | |
3355 | if (TREE_CODE (BASELINK_FUNCTIONS (t)) == FUNCTION_DECL) | |
39ff5a96 | 3356 | cgraph_mark_address_taken_node (cgraph_node (BASELINK_FUNCTIONS (t))); |
4684cd27 MM |
3357 | break; |
3358 | case VAR_DECL: | |
9f90e80a JH |
3359 | if (DECL_CONTEXT (t) |
3360 | && flag_use_repository | |
3361 | && TREE_CODE (DECL_CONTEXT (t)) == FUNCTION_DECL) | |
4684cd27 MM |
3362 | /* If we need a static variable in a function, then we |
3363 | need the containing function. */ | |
3364 | mark_decl_referenced (DECL_CONTEXT (t)); | |
3365 | break; | |
3366 | default: | |
3367 | break; | |
3368 | } | |
dd07abd7 | 3369 | |
25c84396 | 3370 | return NULL; |
8cd2462c JH |
3371 | } |
3372 | ||
6de33afa RH |
3373 | /* Java requires that we be able to reference a local address for a |
3374 | method, and not be confused by PLT entries. If hidden aliases are | |
4537ec0c DN |
3375 | supported, collect and return all the functions for which we should |
3376 | emit a hidden alias. */ | |
6de33afa | 3377 | |
4537ec0c DN |
3378 | static struct pointer_set_t * |
3379 | collect_candidates_for_java_method_aliases (void) | |
6de33afa RH |
3380 | { |
3381 | struct cgraph_node *node; | |
4537ec0c | 3382 | struct pointer_set_t *candidates = NULL; |
6de33afa RH |
3383 | |
3384 | #ifndef HAVE_GAS_HIDDEN | |
4537ec0c | 3385 | return candidates; |
6de33afa RH |
3386 | #endif |
3387 | ||
3388 | for (node = cgraph_nodes; node ; node = node->next) | |
3389 | { | |
3390 | tree fndecl = node->decl; | |
3391 | ||
4537ec0c | 3392 | if (DECL_CONTEXT (fndecl) |
6de33afa RH |
3393 | && TYPE_P (DECL_CONTEXT (fndecl)) |
3394 | && TYPE_FOR_JAVA (DECL_CONTEXT (fndecl)) | |
3395 | && TARGET_USE_LOCAL_THUNK_ALIAS_P (fndecl)) | |
4537ec0c DN |
3396 | { |
3397 | if (candidates == NULL) | |
3398 | candidates = pointer_set_create (); | |
3399 | pointer_set_insert (candidates, fndecl); | |
3400 | } | |
3401 | } | |
3402 | ||
3403 | return candidates; | |
3404 | } | |
3405 | ||
3406 | ||
3407 | /* Java requires that we be able to reference a local address for a | |
3408 | method, and not be confused by PLT entries. If hidden aliases are | |
3409 | supported, emit one for each java function that we've emitted. | |
3410 | CANDIDATES is the set of FUNCTION_DECLs that were gathered | |
3411 | by collect_candidates_for_java_method_aliases. */ | |
3412 | ||
3413 | static void | |
3414 | build_java_method_aliases (struct pointer_set_t *candidates) | |
3415 | { | |
3416 | struct cgraph_node *node; | |
3417 | ||
3418 | #ifndef HAVE_GAS_HIDDEN | |
3419 | return; | |
3420 | #endif | |
3421 | ||
3422 | for (node = cgraph_nodes; node ; node = node->next) | |
3423 | { | |
3424 | tree fndecl = node->decl; | |
3425 | ||
3426 | if (TREE_ASM_WRITTEN (fndecl) | |
3427 | && pointer_set_contains (candidates, fndecl)) | |
6de33afa RH |
3428 | { |
3429 | /* Mangle the name in a predictable way; we need to reference | |
3430 | this from a java compiled object file. */ | |
3431 | tree oid, nid, alias; | |
3432 | const char *oname; | |
3433 | char *nname; | |
3434 | ||
3435 | oid = DECL_ASSEMBLER_NAME (fndecl); | |
3436 | oname = IDENTIFIER_POINTER (oid); | |
3437 | gcc_assert (oname[0] == '_' && oname[1] == 'Z'); | |
3438 | nname = ACONCAT (("_ZGA", oname+2, NULL)); | |
3439 | nid = get_identifier (nname); | |
3440 | ||
3441 | alias = make_alias_for (fndecl, nid); | |
3442 | TREE_PUBLIC (alias) = 1; | |
3443 | DECL_VISIBILITY (alias) = VISIBILITY_HIDDEN; | |
3444 | ||
3445 | assemble_alias (alias, oid); | |
3446 | } | |
3447 | } | |
3448 | } | |
3449 | ||
36a549b8 AC |
3450 | /* Return C++ property of T, based on given operation OP. */ |
3451 | ||
3452 | static int | |
3453 | cpp_check (tree t, cpp_operation op) | |
3454 | { | |
3455 | switch (op) | |
3456 | { | |
3457 | case IS_ABSTRACT: | |
3458 | return DECL_PURE_VIRTUAL_P (t); | |
3459 | case IS_CONSTRUCTOR: | |
3460 | return DECL_CONSTRUCTOR_P (t); | |
3461 | case IS_DESTRUCTOR: | |
3462 | return DECL_DESTRUCTOR_P (t); | |
3463 | case IS_COPY_CONSTRUCTOR: | |
3464 | return DECL_COPY_CONSTRUCTOR_P (t); | |
3465 | case IS_TEMPLATE: | |
3466 | return TREE_CODE (t) == TEMPLATE_DECL; | |
3467 | default: | |
3468 | return 0; | |
3469 | } | |
3470 | } | |
3471 | ||
3472 | /* Collect source file references recursively, starting from NAMESPC. */ | |
3473 | ||
3474 | static void | |
3475 | collect_source_refs (tree namespc) | |
3476 | { | |
3477 | tree t; | |
3478 | ||
3479 | if (!namespc) | |
3480 | return; | |
3481 | ||
3482 | /* Iterate over names in this name space. */ | |
3483 | for (t = NAMESPACE_LEVEL (namespc)->names; t; t = TREE_CHAIN (t)) | |
3484 | if (!DECL_IS_BUILTIN (t) ) | |
3485 | collect_source_ref (DECL_SOURCE_FILE (t)); | |
3486 | ||
3487 | /* Dump siblings, if any */ | |
3488 | collect_source_refs (TREE_CHAIN (namespc)); | |
3489 | ||
3490 | /* Dump children, if any */ | |
3491 | collect_source_refs (NAMESPACE_LEVEL (namespc)->namespaces); | |
3492 | } | |
3493 | ||
3494 | /* Collect decls relevant to SOURCE_FILE from all namespaces recursively, | |
3495 | starting from NAMESPC. */ | |
3496 | ||
3497 | static void | |
3498 | collect_ada_namespace (tree namespc, const char *source_file) | |
3499 | { | |
3500 | if (!namespc) | |
3501 | return; | |
3502 | ||
3503 | /* Collect decls from this namespace */ | |
3504 | collect_ada_nodes (NAMESPACE_LEVEL (namespc)->names, source_file); | |
3505 | ||
3506 | /* Collect siblings, if any */ | |
3507 | collect_ada_namespace (TREE_CHAIN (namespc), source_file); | |
3508 | ||
3509 | /* Collect children, if any */ | |
3510 | collect_ada_namespace (NAMESPACE_LEVEL (namespc)->namespaces, source_file); | |
3511 | } | |
3512 | ||
e8f43da6 JM |
3513 | /* Returns true iff there is a definition available for variable or |
3514 | function DECL. */ | |
3515 | ||
3516 | static bool | |
3517 | decl_defined_p (tree decl) | |
3518 | { | |
3519 | if (TREE_CODE (decl) == FUNCTION_DECL) | |
3520 | return (DECL_INITIAL (decl) != NULL_TREE); | |
3521 | else | |
3522 | { | |
3523 | gcc_assert (TREE_CODE (decl) == VAR_DECL); | |
3524 | return !DECL_EXTERNAL (decl); | |
3525 | } | |
3526 | } | |
3527 | ||
aef4a215 JM |
3528 | /* Nonzero for a VAR_DECL whose value can be used in a constant expression. |
3529 | ||
3530 | [expr.const] | |
3531 | ||
3532 | An integral constant-expression can only involve ... const | |
3533 | variables of integral or enumeration types initialized with | |
3534 | constant expressions ... | |
3535 | ||
3536 | C++0x also allows constexpr variables and temporaries initialized | |
3537 | with constant expressions. We handle the former here, but the latter | |
3538 | are just folded away in cxx_eval_constant_expression. | |
3539 | ||
3540 | The standard does not require that the expression be non-volatile. | |
3541 | G++ implements the proposed correction in DR 457. */ | |
3542 | ||
3543 | bool | |
3544 | decl_constant_var_p (tree decl) | |
3545 | { | |
3546 | bool ret; | |
3547 | tree type = TREE_TYPE (decl); | |
3548 | if (TREE_CODE (decl) != VAR_DECL) | |
3549 | return false; | |
3550 | if (DECL_DECLARED_CONSTEXPR_P (decl)) | |
3551 | ret = true; | |
3552 | else if (CP_TYPE_CONST_NON_VOLATILE_P (type) | |
3553 | && INTEGRAL_OR_ENUMERATION_TYPE_P (type)) | |
3554 | { | |
3555 | /* We don't know if a template static data member is initialized with | |
3556 | a constant expression until we instantiate its initializer. */ | |
3557 | mark_used (decl); | |
3558 | ret = DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl); | |
3559 | } | |
3560 | else | |
3561 | ret = false; | |
3562 | ||
3563 | gcc_assert (!ret || DECL_INITIAL (decl)); | |
3564 | return ret; | |
3565 | } | |
3566 | ||
3567 | /* Returns true if DECL could be a symbolic constant variable, depending on | |
3568 | its initializer. */ | |
3569 | ||
3570 | bool | |
3571 | decl_maybe_constant_var_p (tree decl) | |
3572 | { | |
3573 | tree type = TREE_TYPE (decl); | |
3574 | if (TREE_CODE (decl) != VAR_DECL) | |
3575 | return false; | |
3576 | if (DECL_DECLARED_CONSTEXPR_P (decl)) | |
3577 | return true; | |
3578 | return (CP_TYPE_CONST_NON_VOLATILE_P (type) | |
3579 | && INTEGRAL_OR_ENUMERATION_TYPE_P (type)); | |
3580 | } | |
3581 | ||
e8f43da6 JM |
3582 | /* Complain that DECL uses a type with no linkage but is never defined. */ |
3583 | ||
3584 | static void | |
3585 | no_linkage_error (tree decl) | |
3586 | { | |
3587 | tree t = no_linkage_check (TREE_TYPE (decl), /*relaxed_p=*/false); | |
3588 | if (TYPE_ANONYMOUS_P (t)) | |
3589 | { | |
3590 | permerror (0, "%q+#D, declared using anonymous type, " | |
3591 | "is used but never defined", decl); | |
3592 | if (is_typedef_decl (TYPE_NAME (t))) | |
3593 | permerror (0, "%q+#D does not refer to the unqualified type, " | |
3594 | "so it is not used for linkage", TYPE_NAME (t)); | |
3595 | } | |
3596 | else | |
3597 | permerror (0, "%q+#D, declared using local type %qT, " | |
3598 | "is used but never defined", decl, t); | |
3599 | } | |
3600 | ||
36a549b8 AC |
3601 | /* Collect declarations from all namespaces relevant to SOURCE_FILE. */ |
3602 | ||
3603 | static void | |
3604 | collect_all_refs (const char *source_file) | |
3605 | { | |
3606 | collect_ada_namespace (global_namespace, source_file); | |
3607 | } | |
3608 | ||
e4305460 | 3609 | /* This routine is called at the end of compilation. |
0aafb128 MM |
3610 | Its job is to create all the code needed to initialize and |
3611 | destroy the global aggregates. We do the destruction | |
3612 | first, since that way we only need to reverse the decls once. */ | |
44a8d0b3 | 3613 | |
0aafb128 | 3614 | void |
e4305460 | 3615 | cp_write_global_declarations (void) |
0aafb128 | 3616 | { |
0aafb128 | 3617 | tree vars; |
848eed92 | 3618 | bool reconsider; |
0aafb128 | 3619 | size_t i; |
299f79b5 NS |
3620 | location_t locus; |
3621 | unsigned ssdf_count = 0; | |
35046a54 | 3622 | int retries = 0; |
125121e2 | 3623 | tree decl; |
4537ec0c | 3624 | struct pointer_set_t *candidates; |
8d08fdba | 3625 | |
82a98427 | 3626 | locus = input_location; |
0aafb128 | 3627 | at_eof = 1; |
faae18ab | 3628 | |
0aafb128 | 3629 | /* Bad parse errors. Just forget about it. */ |
2a4449a3 NF |
3630 | if (! global_bindings_p () || current_class_type |
3631 | || !VEC_empty (tree,decl_namespace_list)) | |
0aafb128 | 3632 | return; |
8d08fdba | 3633 | |
17211ab5 GK |
3634 | if (pch_file) |
3635 | c_common_write_pch (); | |
3636 | ||
36a549b8 AC |
3637 | /* Handle -fdump-ada-spec[-slim] */ |
3638 | if (dump_enabled_p (TDI_ada)) | |
3639 | { | |
3640 | if (get_dump_file_info (TDI_ada)->flags & TDF_SLIM) | |
3641 | collect_source_ref (main_input_filename); | |
3642 | else | |
3643 | collect_source_refs (global_namespace); | |
3644 | ||
3645 | dump_ada_specs (collect_all_refs, cpp_check); | |
3646 | } | |
3647 | ||
2d593c86 | 3648 | /* FIXME - huh? was input_line -= 1;*/ |
5566b478 | 3649 | |
0aafb128 MM |
3650 | /* We now have to write out all the stuff we put off writing out. |
3651 | These include: | |
d2e5ee5c | 3652 | |
0aafb128 | 3653 | o Template specializations that we have not yet instantiated, |
0cbd7506 | 3654 | but which are needed. |
0aafb128 | 3655 | o Initialization and destruction for non-local objects with |
0cbd7506 | 3656 | static storage duration. (Local objects with static storage |
0aafb128 MM |
3657 | duration are initialized when their scope is first entered, |
3658 | and are cleaned up via atexit.) | |
c8094d83 | 3659 | o Virtual function tables. |
ea735e02 | 3660 | |
0aafb128 MM |
3661 | All of these may cause others to be needed. For example, |
3662 | instantiating one function may cause another to be needed, and | |
0a288b9a | 3663 | generating the initializer for an object may cause templates to be |
0aafb128 | 3664 | instantiated, etc., etc. */ |
8d08fdba | 3665 | |
2a9a326b | 3666 | timevar_push (TV_VARCONST); |
8d08fdba | 3667 | |
8fa33dfa | 3668 | emit_support_tinfos (); |
6de9cd9a | 3669 | |
c8094d83 | 3670 | do |
0aafb128 | 3671 | { |
548502d3 | 3672 | tree t; |
2b41c040 | 3673 | tree decl; |
548502d3 | 3674 | |
848eed92 | 3675 | reconsider = false; |
0aafb128 | 3676 | |
1a6580ec MM |
3677 | /* If there are templates that we've put off instantiating, do |
3678 | them now. */ | |
35046a54 | 3679 | instantiate_pending_templates (retries); |
d34cb6a1 | 3680 | ggc_collect (); |
0aafb128 | 3681 | |
6eabb241 | 3682 | /* Write out virtual tables as required. Note that writing out |
0cbd7506 MS |
3683 | the virtual table for a template class may cause the |
3684 | instantiation of members of that class. If we write out | |
3685 | vtables then we remove the class from our list so we don't | |
3686 | have to look at it again. */ | |
35046a54 | 3687 | |
9aad8f83 | 3688 | while (keyed_classes != NULL_TREE |
0cbd7506 MS |
3689 | && maybe_emit_vtables (TREE_VALUE (keyed_classes))) |
3690 | { | |
3691 | reconsider = true; | |
3692 | keyed_classes = TREE_CHAIN (keyed_classes); | |
3693 | } | |
c8094d83 | 3694 | |
9aad8f83 MA |
3695 | t = keyed_classes; |
3696 | if (t != NULL_TREE) | |
0cbd7506 MS |
3697 | { |
3698 | tree next = TREE_CHAIN (t); | |
3699 | ||
3700 | while (next) | |
3701 | { | |
3702 | if (maybe_emit_vtables (TREE_VALUE (next))) | |
3703 | { | |
3704 | reconsider = true; | |
3705 | TREE_CHAIN (t) = TREE_CHAIN (next); | |
3706 | } | |
3707 | else | |
3708 | t = next; | |
3709 | ||
3710 | next = TREE_CHAIN (t); | |
3711 | } | |
3712 | } | |
35046a54 | 3713 | |
a260bce6 | 3714 | /* Write out needed type info variables. We have to be careful |
0cbd7506 MS |
3715 | looping through unemitted decls, because emit_tinfo_decl may |
3716 | cause other variables to be needed. New elements will be | |
3717 | appended, and we remove from the vector those that actually | |
3718 | get emitted. */ | |
94214953 NS |
3719 | for (i = VEC_length (tree, unemitted_tinfo_decls); |
3720 | VEC_iterate (tree, unemitted_tinfo_decls, --i, t);) | |
3721 | if (emit_tinfo_decl (t)) | |
3722 | { | |
3723 | reconsider = true; | |
3724 | VEC_unordered_remove (tree, unemitted_tinfo_decls, i); | |
3725 | } | |
7267d692 | 3726 | |
0aafb128 | 3727 | /* The list of objects with static storage duration is built up |
313bc2c2 MM |
3728 | in reverse order. We clear STATIC_AGGREGATES so that any new |
3729 | aggregates added during the initialization of these will be | |
3730 | initialized in the correct order when we next come around the | |
3731 | loop. */ | |
cec24319 | 3732 | vars = prune_vars_needing_no_initialization (&static_aggregates); |
c472cdfd | 3733 | |
313bc2c2 MM |
3734 | if (vars) |
3735 | { | |
313bc2c2 MM |
3736 | /* We need to start a new initialization function each time |
3737 | through the loop. That's because we need to know which | |
3738 | vtables have been referenced, and TREE_SYMBOL_REFERENCED | |
3739 | isn't computed until a function is finished, and written | |
3b426391 | 3740 | out. That's a deficiency in the back end. When this is |
313bc2c2 MM |
3741 | fixed, these initialization functions could all become |
3742 | inline, with resulting performance improvements. */ | |
299f79b5 NS |
3743 | tree ssdf_body; |
3744 | ||
3745 | /* Set the line and file, so that it is obviously not from | |
3746 | the source file. */ | |
82a98427 | 3747 | input_location = locus; |
299f79b5 | 3748 | ssdf_body = start_static_storage_duration_function (ssdf_count); |
313bc2c2 MM |
3749 | |
3750 | /* Make sure the back end knows about all the variables. */ | |
3751 | write_out_vars (vars); | |
3752 | ||
3753 | /* First generate code to do all the initializations. */ | |
6cec5cb5 RG |
3754 | if (vars) |
3755 | do_static_initialization_or_destruction (vars, /*initp=*/true); | |
313bc2c2 MM |
3756 | |
3757 | /* Then, generate code to do all the destructions. Do these | |
3758 | in reverse order so that the most recently constructed | |
bf419747 MM |
3759 | variable is the first destroyed. If we're using |
3760 | __cxa_atexit, then we don't need to do this; functions | |
4c0aad2c | 3761 | were registered at initialization time to destroy the |
bf419747 | 3762 | local statics. */ |
6cec5cb5 | 3763 | if (!flag_use_cxa_atexit && vars) |
bf419747 MM |
3764 | { |
3765 | vars = nreverse (vars); | |
6cec5cb5 | 3766 | do_static_initialization_or_destruction (vars, /*initp=*/false); |
bf419747 MM |
3767 | } |
3768 | else | |
3769 | vars = NULL_TREE; | |
313bc2c2 MM |
3770 | |
3771 | /* Finish up the static storage duration function for this | |
3772 | round. */ | |
82a98427 | 3773 | input_location = locus; |
313bc2c2 MM |
3774 | finish_static_storage_duration_function (ssdf_body); |
3775 | ||
3776 | /* All those initializations and finalizations might cause | |
3777 | us to need more inline functions, more template | |
3778 | instantiations, etc. */ | |
848eed92 | 3779 | reconsider = true; |
299f79b5 | 3780 | ssdf_count++; |
2d593c86 | 3781 | /* ??? was: locus.line++; */ |
0aafb128 | 3782 | } |
c8094d83 | 3783 | |
4684cd27 MM |
3784 | /* Go through the set of inline functions whose bodies have not |
3785 | been emitted yet. If out-of-line copies of these functions | |
3786 | are required, emit them. */ | |
ac47786e | 3787 | FOR_EACH_VEC_ELT (tree, deferred_fns, i, decl) |
0aafb128 | 3788 | { |
eab5474f | 3789 | /* Does it need synthesizing? */ |
bff54b19 | 3790 | if (DECL_DEFAULTED_FN (decl) && ! DECL_INITIAL (decl) |
4847609e | 3791 | && (! DECL_REALLY_EXTERN (decl) || possibly_inlined_p (decl))) |
0aafb128 MM |
3792 | { |
3793 | /* Even though we're already at the top-level, we push | |
3794 | there again. That way, when we pop back a few lines | |
3795 | hence, all of our state is restored. Otherwise, | |
3796 | finish_function doesn't clean things up, and we end | |
3797 | up with CURRENT_FUNCTION_DECL set. */ | |
3798 | push_to_top_level (); | |
3e3935a9 | 3799 | /* The decl's location will mark where it was first |
0cbd7506 MS |
3800 | needed. Save that so synthesize method can indicate |
3801 | where it was needed from, in case of error */ | |
3e3935a9 | 3802 | input_location = DECL_SOURCE_LOCATION (decl); |
1f84ec23 | 3803 | synthesize_method (decl); |
0aafb128 | 3804 | pop_from_top_level (); |
848eed92 | 3805 | reconsider = true; |
0aafb128 | 3806 | } |
0aafb128 | 3807 | |
a406865a | 3808 | if (!DECL_SAVED_TREE (decl)) |
2f0c006e | 3809 | continue; |
ea56c40c | 3810 | |
3b426391 | 3811 | /* We lie to the back end, pretending that some functions |
eab5474f NS |
3812 | are not defined when they really are. This keeps these |
3813 | functions from being put out unnecessarily. But, we must | |
3814 | stop lying when the functions are referenced, or if they | |
1ef0df47 MM |
3815 | are not comdat since they need to be put out now. If |
3816 | DECL_INTERFACE_KNOWN, then we have already set | |
3817 | DECL_EXTERNAL appropriately, so there's no need to check | |
3818 | again, and we do not want to clear DECL_EXTERNAL if a | |
3819 | previous call to import_export_decl set it. | |
3db45ab5 | 3820 | |
1ef0df47 MM |
3821 | This is done in a separate for cycle, because if some |
3822 | deferred function is contained in another deferred | |
3823 | function later in deferred_fns varray, | |
3824 | rest_of_compilation would skip this function and we | |
3825 | really cannot expand the same function twice. */ | |
3826 | import_export_decl (decl); | |
4cb02ea1 MM |
3827 | if (DECL_NOT_REALLY_EXTERN (decl) |
3828 | && DECL_INITIAL (decl) | |
4684cd27 | 3829 | && decl_needed_p (decl)) |
b2583345 | 3830 | { |
b66887e4 | 3831 | struct cgraph_node *node = cgraph_get_node (decl), *alias, *next; |
b2583345 JJ |
3832 | |
3833 | DECL_EXTERNAL (decl) = 0; | |
3834 | /* If we mark !DECL_EXTERNAL one of the same body aliases, | |
3835 | we need to mark all of them that way. */ | |
3836 | if (node && node->same_body) | |
3837 | { | |
3838 | DECL_EXTERNAL (node->decl) = 0; | |
3839 | for (alias = node->same_body; alias; alias = alias->next) | |
3840 | DECL_EXTERNAL (alias->decl) = 0; | |
3841 | } | |
b66887e4 JJ |
3842 | /* If we mark !DECL_EXTERNAL one of the symbols in some comdat |
3843 | group, we need to mark all symbols in the same comdat group | |
3844 | that way. */ | |
3845 | if (node->same_comdat_group) | |
3846 | for (next = node->same_comdat_group; | |
3847 | next != node; | |
3848 | next = next->same_comdat_group) | |
3849 | { | |
3850 | DECL_EXTERNAL (next->decl) = 0; | |
3851 | if (next->same_body) | |
3852 | { | |
3853 | for (alias = next->same_body; | |
3854 | alias; | |
3855 | alias = alias->next) | |
3856 | DECL_EXTERNAL (alias->decl) = 0; | |
3857 | } | |
3858 | } | |
b2583345 | 3859 | } |
21b0c6dc MM |
3860 | |
3861 | /* If we're going to need to write this function out, and | |
3862 | there's already a body for it, create RTL for it now. | |
3863 | (There might be no body if this is a method we haven't | |
3864 | gotten around to synthesizing yet.) */ | |
3865 | if (!DECL_EXTERNAL (decl) | |
4684cd27 | 3866 | && decl_needed_p (decl) |
8cd2462c | 3867 | && !TREE_ASM_WRITTEN (decl) |
4684cd27 | 3868 | && !cgraph_node (decl)->local.finalized) |
21b0c6dc | 3869 | { |
8cd2462c JH |
3870 | /* We will output the function; no longer consider it in this |
3871 | loop. */ | |
3872 | DECL_DEFER_OUTPUT (decl) = 0; | |
21b0c6dc MM |
3873 | /* Generate RTL for this function now that we know we |
3874 | need it. */ | |
8cd2462c | 3875 | expand_or_defer_fn (decl); |
21b0c6dc MM |
3876 | /* If we're compiling -fsyntax-only pretend that this |
3877 | function has been written out so that we don't try to | |
3878 | expand it again. */ | |
3879 | if (flag_syntax_only) | |
3880 | TREE_ASM_WRITTEN (decl) = 1; | |
848eed92 | 3881 | reconsider = true; |
21b0c6dc | 3882 | } |
4cb02ea1 MM |
3883 | } |
3884 | ||
4cb02ea1 | 3885 | if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0)) |
848eed92 | 3886 | reconsider = true; |
0aafb128 MM |
3887 | |
3888 | /* Static data members are just like namespace-scope globals. */ | |
ac47786e | 3889 | FOR_EACH_VEC_ELT (tree, pending_statics, i, decl) |
0aafb128 | 3890 | { |
6c5613b0 JM |
3891 | if (var_finalized_p (decl) || DECL_REALLY_EXTERN (decl) |
3892 | /* Don't write it out if we haven't seen a definition. */ | |
3893 | || DECL_IN_AGGR_P (decl)) | |
0aafb128 MM |
3894 | continue; |
3895 | import_export_decl (decl); | |
4684cd27 MM |
3896 | /* If this static data member is needed, provide it to the |
3897 | back end. */ | |
3898 | if (DECL_NOT_REALLY_EXTERN (decl) && decl_needed_p (decl)) | |
5b767b9d | 3899 | DECL_EXTERNAL (decl) = 0; |
0aafb128 | 3900 | } |
2b41c040 KH |
3901 | if (VEC_length (tree, pending_statics) != 0 |
3902 | && wrapup_global_declarations (VEC_address (tree, pending_statics), | |
3903 | VEC_length (tree, pending_statics))) | |
848eed92 | 3904 | reconsider = true; |
f6d1b84a | 3905 | |
35046a54 | 3906 | retries++; |
c8094d83 | 3907 | } |
0aafb128 | 3908 | while (reconsider); |
28cbf42c | 3909 | |
9bcb9aae | 3910 | /* All used inline functions must have a definition at this point. */ |
ac47786e | 3911 | FOR_EACH_VEC_ELT (tree, deferred_fns, i, decl) |
eab5474f | 3912 | { |
4684cd27 | 3913 | if (/* Check online inline functions that were actually used. */ |
3146f36f | 3914 | DECL_ODR_USED (decl) && DECL_DECLARED_INLINE_P (decl) |
1ef0df47 MM |
3915 | /* If the definition actually was available here, then the |
3916 | fact that the function was not defined merely represents | |
3917 | that for some reason (use of a template repository, | |
3918 | #pragma interface, etc.) we decided not to emit the | |
3919 | definition here. */ | |
3920 | && !DECL_INITIAL (decl) | |
2f0c006e GK |
3921 | /* An explicit instantiation can be used to specify |
3922 | that the body is in another unit. It will have | |
3923 | already verified there was a definition. */ | |
3924 | && !DECL_EXPLICIT_INSTANTIATION (decl)) | |
3cfabe60 | 3925 | { |
dee15844 | 3926 | warning (0, "inline function %q+D used but never defined", decl); |
96c993a8 JM |
3927 | /* Avoid a duplicate warning from check_global_declaration_1. */ |
3928 | TREE_NO_WARNING (decl) = 1; | |
3cfabe60 | 3929 | } |
eab5474f | 3930 | } |
c8094d83 | 3931 | |
e8f43da6 | 3932 | /* So must decls that use a type with no linkage. */ |
ac47786e | 3933 | FOR_EACH_VEC_ELT (tree, no_linkage_decls, i, decl) |
e8f43da6 JM |
3934 | if (!decl_defined_p (decl)) |
3935 | no_linkage_error (decl); | |
3936 | ||
977e30bc NP |
3937 | /* Then, do the Objective-C stuff. This is where all the |
3938 | Objective-C module stuff gets generated (symtab, | |
3939 | class/protocol/selector lists etc). This must be done after C++ | |
3940 | templates, destructors etc. so that selectors used in C++ | |
3941 | templates are properly allocated. */ | |
3942 | if (c_dialect_objc ()) | |
3943 | objc_write_global_declarations (); | |
3944 | ||
0352cfc8 MM |
3945 | /* We give C linkage to static constructors and destructors. */ |
3946 | push_lang_context (lang_name_c); | |
3947 | ||
3948 | /* Generate initialization and destruction functions for all | |
3949 | priorities for which they are required. */ | |
3950 | if (priority_info_map) | |
c8094d83 | 3951 | splay_tree_foreach (priority_info_map, |
0352cfc8 | 3952 | generate_ctor_and_dtor_functions_for_priority, |
299f79b5 | 3953 | /*data=*/&locus); |
fc8600f9 MM |
3954 | else if (c_dialect_objc () && objc_static_init_needed_p ()) |
3955 | /* If this is obj-c++ and we need a static init, call | |
3956 | generate_ctor_or_dtor_function. */ | |
3957 | generate_ctor_or_dtor_function (/*constructor_p=*/true, | |
3958 | DEFAULT_INIT_PRIORITY, &locus); | |
0352cfc8 MM |
3959 | |
3960 | /* We're done with the splay-tree now. */ | |
3961 | if (priority_info_map) | |
3962 | splay_tree_delete (priority_info_map); | |
3963 | ||
86f029aa JM |
3964 | /* Generate any missing aliases. */ |
3965 | maybe_apply_pending_pragma_weaks (); | |
3966 | ||
0352cfc8 MM |
3967 | /* We're done with static constructors, so we can go back to "C++" |
3968 | linkage now. */ | |
3969 | pop_lang_context (); | |
3970 | ||
4537ec0c DN |
3971 | /* Collect candidates for Java hidden aliases. */ |
3972 | candidates = collect_candidates_for_java_method_aliases (); | |
3973 | ||
4684cd27 | 3974 | cgraph_finalize_compilation_unit (); |
8cd2462c | 3975 | |
0aafb128 | 3976 | /* Now, issue warnings about static, but not defined, functions, |
033ed340 | 3977 | etc., and emit debugging information. */ |
0aafb128 | 3978 | walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider); |
2b41c040 | 3979 | if (VEC_length (tree, pending_statics) != 0) |
db5f8b93 RH |
3980 | { |
3981 | check_global_declarations (VEC_address (tree, pending_statics), | |
3db45ab5 | 3982 | VEC_length (tree, pending_statics)); |
db5f8b93 RH |
3983 | emit_debug_global_declarations (VEC_address (tree, pending_statics), |
3984 | VEC_length (tree, pending_statics)); | |
3985 | } | |
b7484fbe | 3986 | |
2c5df20f JM |
3987 | perform_deferred_noexcept_checks (); |
3988 | ||
6de33afa | 3989 | /* Generate hidden aliases for Java. */ |
4537ec0c DN |
3990 | if (candidates) |
3991 | { | |
3992 | build_java_method_aliases (candidates); | |
3993 | pointer_set_destroy (candidates); | |
3994 | } | |
6de33afa | 3995 | |
faae18ab MS |
3996 | finish_repo (); |
3997 | ||
f71f87f9 | 3998 | /* The entire file is now complete. If requested, dump everything |
a1c65f9f | 3999 | to a file. */ |
b7442fb5 NS |
4000 | { |
4001 | int flags; | |
6de9cd9a | 4002 | FILE *stream = dump_begin (TDI_tu, &flags); |
b7442fb5 NS |
4003 | |
4004 | if (stream) | |
4005 | { | |
4006 | dump_node (global_namespace, flags & ~TDF_SLIM, stream); | |
6de9cd9a | 4007 | dump_end (TDI_tu, stream); |
b7442fb5 NS |
4008 | } |
4009 | } | |
c8094d83 | 4010 | |
2a9a326b | 4011 | timevar_pop (TV_VARCONST); |
8d08fdba MS |
4012 | |
4013 | if (flag_detailed_statistics) | |
27bb8339 JM |
4014 | { |
4015 | dump_tree_statistics (); | |
4016 | dump_time_statistics (); | |
4017 | } | |
82a98427 | 4018 | input_location = locus; |
5bd61841 MM |
4019 | |
4020 | #ifdef ENABLE_CHECKING | |
4021 | validate_conversion_obstack (); | |
4022 | #endif /* ENABLE_CHECKING */ | |
8d08fdba | 4023 | } |
51c184be | 4024 | |
018a5803 NS |
4025 | /* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the |
4026 | function to call in parse-tree form; it has not yet been | |
4027 | semantically analyzed. ARGS are the arguments to the function. | |
c166b898 ILT |
4028 | They have already been semantically analyzed. This may change |
4029 | ARGS. */ | |
4ba126e4 MM |
4030 | |
4031 | tree | |
c166b898 | 4032 | build_offset_ref_call_from_tree (tree fn, VEC(tree,gc) **args) |
4ba126e4 | 4033 | { |
d17811fd | 4034 | tree orig_fn; |
c166b898 | 4035 | VEC(tree,gc) *orig_args = NULL; |
d17811fd | 4036 | tree expr; |
018a5803 | 4037 | tree object; |
4ba126e4 | 4038 | |
d17811fd | 4039 | orig_fn = fn; |
018a5803 | 4040 | object = TREE_OPERAND (fn, 0); |
d17811fd MM |
4041 | |
4042 | if (processing_template_decl) | |
4043 | { | |
50bc768d NS |
4044 | gcc_assert (TREE_CODE (fn) == DOTSTAR_EXPR |
4045 | || TREE_CODE (fn) == MEMBER_REF); | |
d17811fd | 4046 | if (type_dependent_expression_p (fn) |
c166b898 ILT |
4047 | || any_type_dependent_arguments_p (*args)) |
4048 | return build_nt_call_vec (fn, *args); | |
4049 | ||
4050 | orig_args = make_tree_vector_copy (*args); | |
d17811fd MM |
4051 | |
4052 | /* Transform the arguments and add the implicit "this" | |
4053 | parameter. That must be done before the FN is transformed | |
4054 | because we depend on the form of FN. */ | |
c166b898 | 4055 | make_args_non_dependent (*args); |
4c38e99e | 4056 | object = build_non_dependent_expr (object); |
d17811fd | 4057 | if (TREE_CODE (fn) == DOTSTAR_EXPR) |
93c0e0bb | 4058 | object = cp_build_addr_expr (object, tf_warning_or_error); |
c166b898 | 4059 | VEC_safe_insert (tree, gc, *args, 0, object); |
d17811fd MM |
4060 | /* Now that the arguments are done, transform FN. */ |
4061 | fn = build_non_dependent_expr (fn); | |
4062 | } | |
4ba126e4 | 4063 | |
ee76b931 MM |
4064 | /* A qualified name corresponding to a bound pointer-to-member is |
4065 | represented as an OFFSET_REF: | |
4ba126e4 MM |
4066 | |
4067 | struct B { void g(); }; | |
4068 | void (B::*p)(); | |
4069 | void B::g() { (this->*p)(); } */ | |
d17811fd | 4070 | if (TREE_CODE (fn) == OFFSET_REF) |
4ba126e4 | 4071 | { |
93c0e0bb | 4072 | tree object_addr = cp_build_addr_expr (object, tf_warning_or_error); |
4ba126e4 MM |
4073 | fn = TREE_OPERAND (fn, 1); |
4074 | fn = get_member_function_from_ptrfunc (&object_addr, fn); | |
c166b898 | 4075 | VEC_safe_insert (tree, gc, *args, 0, object_addr); |
4ba126e4 | 4076 | } |
4ba126e4 | 4077 | |
c166b898 | 4078 | expr = cp_build_function_call_vec (fn, args, tf_warning_or_error); |
d17811fd | 4079 | if (processing_template_decl && expr != error_mark_node) |
c166b898 ILT |
4080 | expr = build_min_non_dep_call_vec (expr, orig_fn, orig_args); |
4081 | ||
4082 | if (orig_args != NULL) | |
4083 | release_tree_vector (orig_args); | |
4084 | ||
d17811fd | 4085 | return expr; |
4ba126e4 | 4086 | } |
c8094d83 | 4087 | |
f30432d7 MS |
4088 | |
4089 | void | |
848eed92 | 4090 | check_default_args (tree x) |
f30432d7 MS |
4091 | { |
4092 | tree arg = TYPE_ARG_TYPES (TREE_TYPE (x)); | |
848eed92 GDR |
4093 | bool saw_def = false; |
4094 | int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE); | |
f30432d7 MS |
4095 | for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i) |
4096 | { | |
4097 | if (TREE_PURPOSE (arg)) | |
848eed92 | 4098 | saw_def = true; |
f30432d7 MS |
4099 | else if (saw_def) |
4100 | { | |
dee15844 | 4101 | error ("default argument missing for parameter %P of %q+#D", i, x); |
607c855e | 4102 | TREE_PURPOSE (arg) = error_mark_node; |
f30432d7 MS |
4103 | } |
4104 | } | |
4105 | } | |
72b7eeff | 4106 | |
4847609e JH |
4107 | /* Return true if function DECL can be inlined. This is used to force |
4108 | instantiation of methods that might be interesting for inlining. */ | |
4109 | bool | |
4110 | possibly_inlined_p (tree decl) | |
4111 | { | |
4112 | gcc_assert (TREE_CODE (decl) == FUNCTION_DECL); | |
4113 | if (DECL_UNINLINABLE (decl)) | |
4114 | return false; | |
359b8672 | 4115 | if (!optimize || pragma_java_exceptions) |
4847609e JH |
4116 | return DECL_DECLARED_INLINE_P (decl); |
4117 | /* When optimizing, we might inline everything when flatten | |
4118 | attribute or heuristics inlining for size or autoinlining | |
4119 | is used. */ | |
4120 | return true; | |
4121 | } | |
4122 | ||
520c3081 | 4123 | /* Mark DECL (either a _DECL or a BASELINK) as "used" in the program. |
7eab6e7b MM |
4124 | If DECL is a specialization or implicitly declared class member, |
4125 | generate the actual definition. */ | |
024f1251 | 4126 | |
72b7eeff | 4127 | void |
848eed92 | 4128 | mark_used (tree decl) |
72b7eeff | 4129 | { |
7eab6e7b MM |
4130 | /* If DECL is a BASELINK for a single function, then treat it just |
4131 | like the DECL for the function. Otherwise, if the BASELINK is | |
4132 | for an overloaded function, we don't know which function was | |
4133 | actually used until after overload resolution. */ | |
4134 | if (TREE_CODE (decl) == BASELINK) | |
4135 | { | |
4136 | decl = BASELINK_FUNCTIONS (decl); | |
4137 | if (really_overloaded_fn (decl)) | |
4138 | return; | |
4139 | decl = OVL_CURRENT (decl); | |
4140 | } | |
4141 | ||
3146f36f JM |
4142 | /* Set TREE_USED for the benefit of -Wunused. */ |
4143 | TREE_USED (decl) = 1; | |
4144 | if (DECL_CLONED_FUNCTION_P (decl)) | |
4145 | TREE_USED (DECL_CLONED_FUNCTION (decl)) = 1; | |
4146 | ||
4ad610c9 JM |
4147 | if (TREE_CODE (decl) == FUNCTION_DECL |
4148 | && DECL_DELETED_FN (decl)) | |
4149 | { | |
c6be04ad JM |
4150 | if (DECL_ARTIFICIAL (decl)) |
4151 | { | |
4152 | if (DECL_OVERLOADED_OPERATOR_P (decl) == TYPE_EXPR | |
4153 | && LAMBDA_TYPE_P (DECL_CONTEXT (decl))) | |
4154 | { | |
4155 | /* We mark a lambda conversion op as deleted if we can't | |
4156 | generate it properly; see maybe_add_lambda_conv_op. */ | |
4157 | sorry ("converting lambda which uses %<...%> to " | |
4158 | "function pointer"); | |
4159 | return; | |
4160 | } | |
4161 | } | |
9a71b305 JM |
4162 | error ("use of deleted function %qD", decl); |
4163 | if (!maybe_explain_implicit_delete (decl)) | |
4164 | error_at (DECL_SOURCE_LOCATION (decl), "declared here"); | |
869fef88 | 4165 | return; |
4ad610c9 | 4166 | } |
3368cdd3 | 4167 | |
3146f36f JM |
4168 | /* We can only check DECL_ODR_USED on variables or functions with |
4169 | DECL_LANG_SPECIFIC set, and these are also the only decls that we | |
4170 | might need special handling for. */ | |
4171 | if ((TREE_CODE (decl) != VAR_DECL && TREE_CODE (decl) != FUNCTION_DECL) | |
d9fbd03b JM |
4172 | || DECL_LANG_SPECIFIC (decl) == NULL |
4173 | || DECL_THUNK_P (decl)) | |
3146f36f JM |
4174 | return; |
4175 | ||
15305a73 JM |
4176 | /* We only want to do this processing once. We don't need to keep trying |
4177 | to instantiate inline templates, because unit-at-a-time will make sure | |
4178 | we get them compiled before functions that want to inline them. */ | |
3146f36f | 4179 | if (DECL_ODR_USED (decl)) |
15305a73 JM |
4180 | return; |
4181 | ||
3368cdd3 JJ |
4182 | /* If within finish_function, defer the rest until that function |
4183 | finishes, otherwise it might recurse. */ | |
4184 | if (defer_mark_used_calls) | |
4185 | { | |
4186 | VEC_safe_push (tree, gc, deferred_mark_used_calls, decl); | |
4187 | return; | |
4188 | } | |
4189 | ||
aef4a215 JM |
4190 | /* Normally, we can wait until instantiation-time to synthesize DECL. |
4191 | However, if DECL is a static data member initialized with a constant | |
4192 | or a constexpr function, we need it right now because a reference to | |
4193 | such a data member or a call to such function is not value-dependent. */ | |
4194 | if ((decl_maybe_constant_var_p (decl) | |
4195 | || (TREE_CODE (decl) == FUNCTION_DECL | |
4196 | && DECL_DECLARED_CONSTEXPR_P (decl))) | |
4197 | && !DECL_INITIAL (decl) | |
4198 | && DECL_LANG_SPECIFIC (decl) | |
4199 | && DECL_TEMPLATE_INSTANTIATION (decl)) | |
2d22db1f | 4200 | { |
aef4a215 JM |
4201 | /* Instantiating a function will result in garbage collection. We |
4202 | must treat this situation as if we were within the body of a | |
4203 | function so as to avoid collecting live data only referenced from | |
4204 | the stack (such as overload resolution candidates). */ | |
4205 | ++function_depth; | |
4206 | instantiate_decl (decl, /*defer_ok=*/false, | |
4207 | /*expl_inst_class_mem_p=*/false); | |
4208 | --function_depth; | |
024f1251 | 4209 | } |
3db45ab5 | 4210 | |
aef4a215 JM |
4211 | /* If we don't need a value, then we don't need to synthesize DECL. */ |
4212 | if (cp_unevaluated_operand != 0) | |
4213 | return; | |
4214 | ||
2d22db1f | 4215 | if (processing_template_decl) |
3db45ab5 | 4216 | return; |
eab5474f | 4217 | |
aef4a215 JM |
4218 | /* Check this too in case we're within fold_non_dependent_expr. */ |
4219 | if (DECL_TEMPLATE_INFO (decl) | |
4220 | && uses_template_parms (DECL_TI_ARGS (decl))) | |
4221 | return; | |
4222 | ||
3146f36f | 4223 | DECL_ODR_USED (decl) = 1; |
15305a73 | 4224 | if (DECL_CLONED_FUNCTION_P (decl)) |
3146f36f | 4225 | DECL_ODR_USED (DECL_CLONED_FUNCTION (decl)) = 1; |
15305a73 | 4226 | |
e8f43da6 JM |
4227 | /* DR 757: A type without linkage shall not be used as the type of a |
4228 | variable or function with linkage, unless | |
4229 | o the variable or function has extern "C" linkage (7.5 [dcl.link]), or | |
4230 | o the variable or function is not used (3.2 [basic.def.odr]) or is | |
4231 | defined in the same translation unit. */ | |
1eee69dd JM |
4232 | if (cxx_dialect > cxx98 |
4233 | && decl_linkage (decl) != lk_none | |
d9fbd03b JM |
4234 | && !DECL_EXTERN_C_P (decl) |
4235 | && !DECL_ARTIFICIAL (decl) | |
4236 | && !decl_defined_p (decl) | |
4237 | && no_linkage_check (TREE_TYPE (decl), /*relaxed_p=*/false)) | |
4238 | { | |
4239 | if (is_local_extern (decl)) | |
4240 | /* There's no way to define a local extern, and adding it to | |
4241 | the vector interferes with GC, so give an error now. */ | |
4242 | no_linkage_error (decl); | |
4243 | else | |
4244 | VEC_safe_push (tree, gc, no_linkage_decls, decl); | |
e8f43da6 JM |
4245 | } |
4246 | ||
eab5474f | 4247 | if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl) |
783a452c | 4248 | && !DECL_INITIAL (decl) && !DECL_ARTIFICIAL (decl)) |
eab5474f | 4249 | /* Remember it, so we can check it was defined. */ |
783a452c | 4250 | note_vague_linkage_fn (decl); |
c8094d83 | 4251 | |
73aad9b9 | 4252 | /* Is it a synthesized method that needs to be synthesized? */ |
4f1c5b7d MM |
4253 | if (TREE_CODE (decl) == FUNCTION_DECL |
4254 | && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl) | |
b87d79e6 | 4255 | && DECL_DEFAULTED_FN (decl) |
b49bd379 | 4256 | && ! DECL_INITIAL (decl)) |
db9b2174 | 4257 | { |
783a452c JM |
4258 | /* Remember the current location for a function we will end up |
4259 | synthesizing. Then we can inform the user where it was | |
4260 | required in the case of error. */ | |
4261 | DECL_SOURCE_LOCATION (decl) = input_location; | |
4262 | ||
595de302 JM |
4263 | /* Synthesizing an implicitly defined member function will result in |
4264 | garbage collection. We must treat this situation as if we were | |
4265 | within the body of a function so as to avoid collecting live data | |
4266 | on the stack (such as overload resolution candidates). | |
4267 | ||
62906aaa JM |
4268 | We could just let cp_write_global_declarations handle synthesizing |
4269 | this function, since we just added it to deferred_fns, but doing | |
4270 | it at the use site produces better error messages. */ | |
595de302 | 4271 | ++function_depth; |
db9b2174 | 4272 | synthesize_method (decl); |
595de302 | 4273 | --function_depth; |
62906aaa | 4274 | /* If this is a synthesized method we don't need to |
5a8613b2 MM |
4275 | do the instantiation test below. */ |
4276 | } | |
d9fbd03b JM |
4277 | else if ((TREE_CODE (decl) == FUNCTION_DECL || TREE_CODE (decl) == VAR_DECL) |
4278 | && DECL_TEMPLATE_INFO (decl) | |
5a8613b2 | 4279 | && (!DECL_EXPLICIT_INSTANTIATION (decl) |
15305a73 | 4280 | || always_instantiate_p (decl))) |
5a8613b2 MM |
4281 | /* If this is a function or variable that is an instance of some |
4282 | template, we now know that we will need to actually do the | |
4283 | instantiation. We check that DECL is not an explicit | |
4284 | instantiation because that is not checked in instantiate_decl. | |
3db45ab5 | 4285 | |
5a8613b2 | 4286 | We put off instantiating functions in order to improve compile |
4684cd27 MM |
4287 | times. Maintaining a stack of active functions is expensive, |
4288 | and the inliner knows to instantiate any functions it might | |
5a8613b2 | 4289 | need. Therefore, we always try to defer instantiation. */ |
3db45ab5 | 4290 | instantiate_decl (decl, /*defer_ok=*/true, |
eba839f9 | 4291 | /*expl_inst_class_mem_p=*/false); |
72b7eeff | 4292 | } |
f62dbf03 | 4293 | |
e2500fed | 4294 | #include "gt-cp-decl2.h" |