1/* Process declarations and variables for C++ compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
5
6This file is part of GCC.
7
8GCC is free software; you can redistribute it and/or modify
9it under the terms of the GNU General Public License as published by
10the Free Software Foundation; either version 2, or (at your option)
11any later version.
12
13GCC is distributed in the hope that it will be useful,
14but WITHOUT ANY WARRANTY; without even the implied warranty of
15MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16GNU General Public License for more details.
17
18You should have received a copy of the GNU General Public License
19along with GCC; see the file COPYING. If not, write to
20the Free Software Foundation, 51 Franklin Street, Fifth Floor,
21Boston, MA 02110-1301, USA. */
22
23
24/* Process declarations and symbol lookup for C++ front end.
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"
32#include "system.h"
33#include "coretypes.h"
34#include "tm.h"
35#include "tree.h"
36#include "rtl.h"
37#include "expr.h"
38#include "flags.h"
39#include "cp-tree.h"
40#include "decl.h"
41#include "output.h"
42#include "except.h"
43#include "toplev.h"
44#include "timevar.h"
45#include "cpplib.h"
46#include "target.h"
47#include "c-common.h"
48#include "tree-mudflap.h"
49#include "cgraph.h"
50#include "tree-inline.h"
51#include "c-pragma.h"
52#include "tree-dump.h"
53#include "intl.h"
54
55extern cpp_reader *parse_in;
56
57/* This structure contains information about the initializations
58 and/or destructions required for a particular priority level. */
59typedef struct priority_info_s {
60 /* Nonzero if there have been any initializations at this priority
61 throughout the translation unit. */
62 int initializations_p;
63 /* Nonzero if there have been any destructions at this priority
64 throughout the translation unit. */
65 int destructions_p;
66} *priority_info;
67
68static void mark_vtable_entries (tree);
69static bool maybe_emit_vtables (tree);
70static bool acceptable_java_type (tree);
71static tree start_objects (int, int);
72static void finish_objects (int, int, tree);
73static tree start_static_storage_duration_function (unsigned);
74static void finish_static_storage_duration_function (tree);
75static priority_info get_priority_info (int);
76static void do_static_initialization_or_destruction (tree, bool);
77static void one_static_initialization_or_destruction (tree, tree, bool);
78static void generate_ctor_or_dtor_function (bool, int, location_t *);
79static int generate_ctor_and_dtor_functions_for_priority (splay_tree_node,
80 void *);
81static tree prune_vars_needing_no_initialization (tree *);
82static void write_out_vars (tree);
83static void import_export_class (tree);
84static tree get_guard_bits (tree);
85static void determine_visibility_from_class (tree, tree);
86
87/* A list of static class variables. This is needed, because a
88 static class variable can be declared inside the class without
89 an initializer, and then initialized, statically, outside the class. */
90static GTY(()) VEC(tree,gc) *pending_statics;
91
92/* A list of functions which were declared inline, but which we
93 may need to emit outline anyway. */
94static GTY(()) VEC(tree,gc) *deferred_fns;
95
96/* Nonzero if we're done parsing and into end-of-file activities. */
97
98int at_eof;
99
100/* Functions called along with real static constructors and destructors. */
101
102tree static_ctors;
103tree static_dtors;
104
105
106
107/* Return a member function type (a METHOD_TYPE), given FNTYPE (a
108 FUNCTION_TYPE), CTYPE (class type), and QUALS (the cv-qualifiers
109 that apply to the function). */
110
111tree
112build_memfn_type (tree fntype, tree ctype, cp_cv_quals quals)
113{
114 tree raises;
115 int type_quals;
116
117 if (fntype == error_mark_node || ctype == error_mark_node)
118 return error_mark_node;
119
120 type_quals = quals & ~TYPE_QUAL_RESTRICT;
121 ctype = cp_build_qualified_type (ctype, type_quals);
122 fntype = build_method_type_directly (ctype, TREE_TYPE (fntype),
123 (TREE_CODE (fntype) == METHOD_TYPE
124 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
125 : TYPE_ARG_TYPES (fntype)));
126 raises = TYPE_RAISES_EXCEPTIONS (fntype);
127 if (raises)
128 fntype = build_exception_variant (fntype, raises);
129
130 return fntype;
131}
132
133/* Build a PARM_DECL with NAME and TYPE, and set DECL_ARG_TYPE
134 appropriately. */
135
136tree
137cp_build_parm_decl (tree name, tree type)
138{
139 tree parm = build_decl (PARM_DECL, name, type);
140 /* DECL_ARG_TYPE is only used by the back end and the back end never
141 sees templates. */
142 if (!processing_template_decl)
143 DECL_ARG_TYPE (parm) = type_passed_as (type);
144 return parm;
145}
146
147/* Returns a PARM_DECL for a parameter of the indicated TYPE, with the
148 indicated NAME. */
149
150tree
151build_artificial_parm (tree name, tree type)
152{
153 tree parm = cp_build_parm_decl (name, type);
154 DECL_ARTIFICIAL (parm) = 1;
155 /* All our artificial parms are implicitly `const'; they cannot be
156 assigned to. */
157 TREE_READONLY (parm) = 1;
158 return parm;
159}
160
161/* Constructors for types with virtual baseclasses need an "in-charge" flag
162 saying whether this constructor is responsible for initialization of
163 virtual baseclasses or not. All destructors also need this "in-charge"
164 flag, which additionally determines whether or not the destructor should
165 free the memory for the object.
166
167 This function adds the "in-charge" flag to member function FN if
168 appropriate. It is called from grokclassfn and tsubst.
169 FN must be either a constructor or destructor.
170
171 The in-charge flag follows the 'this' parameter, and is followed by the
172 VTT parm (if any), then the user-written parms. */
173
174void
175maybe_retrofit_in_chrg (tree fn)
176{
177 tree basetype, arg_types, parms, parm, fntype;
178
179 /* If we've already add the in-charge parameter don't do it again. */
180 if (DECL_HAS_IN_CHARGE_PARM_P (fn))
181 return;
182
183 /* When processing templates we can't know, in general, whether or
184 not we're going to have virtual baseclasses. */
185 if (processing_template_decl)
186 return;
187
188 /* We don't need an in-charge parameter for constructors that don't
189 have virtual bases. */
190 if (DECL_CONSTRUCTOR_P (fn)
191 && !CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fn)))
192 return;
193
194 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
195 basetype = TREE_TYPE (TREE_VALUE (arg_types));
196 arg_types = TREE_CHAIN (arg_types);
197
198 parms = TREE_CHAIN (DECL_ARGUMENTS (fn));
199
200 /* If this is a subobject constructor or destructor, our caller will
201 pass us a pointer to our VTT. */
202 if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fn)))
203 {
204 parm = build_artificial_parm (vtt_parm_identifier, vtt_parm_type);
205
206 /* First add it to DECL_ARGUMENTS between 'this' and the real args... */
207 TREE_CHAIN (parm) = parms;
208 parms = parm;
209
210 /* ...and then to TYPE_ARG_TYPES. */
211 arg_types = hash_tree_chain (vtt_parm_type, arg_types);
212
213 DECL_HAS_VTT_PARM_P (fn) = 1;
214 }
215
216 /* Then add the in-charge parm (before the VTT parm). */
217 parm = build_artificial_parm (in_charge_identifier, integer_type_node);
218 TREE_CHAIN (parm) = parms;
219 parms = parm;
220 arg_types = hash_tree_chain (integer_type_node, arg_types);
221
222 /* Insert our new parameter(s) into the list. */
223 TREE_CHAIN (DECL_ARGUMENTS (fn)) = parms;
224
225 /* And rebuild the function type. */
226 fntype = build_method_type_directly (basetype, TREE_TYPE (TREE_TYPE (fn)),
227 arg_types);
228 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
229 fntype = build_exception_variant (fntype,
230 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
231 TREE_TYPE (fn) = fntype;
232
233 /* Now we've got the in-charge parameter. */
234 DECL_HAS_IN_CHARGE_PARM_P (fn) = 1;
235}
236
237/* Classes overload their constituent function names automatically.
238 When a function name is declared in a record structure,
239 its name is changed to it overloaded name. Since names for
240 constructors and destructors can conflict, we place a leading
241 '$' for destructors.
242
243 CNAME is the name of the class we are grokking for.
244
245 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
246
247 FLAGS contains bits saying what's special about today's
248 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
249
250 If FUNCTION is a destructor, then we must add the `auto-delete' field
251 as a second parameter. There is some hair associated with the fact
252 that we must "declare" this variable in the manner consistent with the
253 way the rest of the arguments were declared.
254
255 QUALS are the qualifiers for the this pointer. */
256
257void
258grokclassfn (tree ctype, tree function, enum overload_flags flags)
259{
260 tree fn_name = DECL_NAME (function);
261
262 /* Even within an `extern "C"' block, members get C++ linkage. See
263 [dcl.link] for details. */
264 SET_DECL_LANGUAGE (function, lang_cplusplus);
265
266 if (fn_name == NULL_TREE)
267 {
268 error ("name missing for member function");
269 fn_name = get_identifier ("<anonymous>");
270 DECL_NAME (function) = fn_name;
271 }
272
273 DECL_CONTEXT (function) = ctype;
274
275 if (flags == DTOR_FLAG)
276 DECL_DESTRUCTOR_P (function) = 1;
277
278 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
279 maybe_retrofit_in_chrg (function);
280}
281
282/* Create an ARRAY_REF, checking for the user doing things backwards
283 along the way. */
284
285tree
286grok_array_decl (tree array_expr, tree index_exp)
287{
288 tree type;
289 tree expr;
290 tree orig_array_expr = array_expr;
291 tree orig_index_exp = index_exp;
292
293 if (error_operand_p (array_expr) || error_operand_p (index_exp))
294 return error_mark_node;
295
296 if (processing_template_decl)
297 {
298 if (type_dependent_expression_p (array_expr)
299 || type_dependent_expression_p (index_exp))
300 return build_min_nt (ARRAY_REF, array_expr, index_exp,
301 NULL_TREE, NULL_TREE);
302 array_expr = build_non_dependent_expr (array_expr);
303 index_exp = build_non_dependent_expr (index_exp);
304 }
305
306 type = TREE_TYPE (array_expr);
307 gcc_assert (type);
308 type = non_reference (type);
309
310 /* If they have an `operator[]', use that. */
311 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
312 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL,
313 array_expr, index_exp, NULL_TREE,
314 /*overloaded_p=*/NULL);
315 else
316 {
317 tree p1, p2, i1, i2;
318
319 /* Otherwise, create an ARRAY_REF for a pointer or array type.
320 It is a little-known fact that, if `a' is an array and `i' is
321 an int, you can write `i[a]', which means the same thing as
322 `a[i]'. */
323 if (TREE_CODE (type) == ARRAY_TYPE)
324 p1 = array_expr;
325 else
326 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, false);
327
328 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
329 p2 = index_exp;
330 else
331 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, false);
332
333 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr,
334 false);
335 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp,
336 false);
337
338 if ((p1 && i2) && (i1 && p2))
339 error ("ambiguous conversion for array subscript");
340
341 if (p1 && i2)
342 array_expr = p1, index_exp = i2;
343 else if (i1 && p2)
344 array_expr = p2, index_exp = i1;
345 else
346 {
347 error ("invalid types %<%T[%T]%> for array subscript",
348 type, TREE_TYPE (index_exp));
349 return error_mark_node;
350 }
351
352 if (array_expr == error_mark_node || index_exp == error_mark_node)
353 error ("ambiguous conversion for array subscript");
354
355 expr = build_array_ref (array_expr, index_exp);
356 }
357 if (processing_template_decl && expr != error_mark_node)
358 return build_min_non_dep (ARRAY_REF, expr, orig_array_expr, orig_index_exp,
359 NULL_TREE, NULL_TREE);
360 return expr;
361}
362
363/* Given the cast expression EXP, checking out its validity. Either return
364 an error_mark_node if there was an unavoidable error, return a cast to
365 void for trying to delete a pointer w/ the value 0, or return the
366 call to delete. If DOING_VEC is true, we handle things differently
367 for doing an array delete.
368 Implements ARM $5.3.4. This is called from the parser. */
369
370tree
371delete_sanity (tree exp, tree size, bool doing_vec, int use_global_delete)
372{
373 tree t, type;
374
375 if (exp == error_mark_node)
376 return exp;
377
378 if (processing_template_decl)
379 {
380 t = build_min (DELETE_EXPR, void_type_node, exp, size);
381 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
382 DELETE_EXPR_USE_VEC (t) = doing_vec;
383 TREE_SIDE_EFFECTS (t) = 1;
384 return t;
385 }
386
387 /* An array can't have been allocated by new, so complain. */
388 if (TREE_CODE (exp) == VAR_DECL
389 && TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
390 warning (0, "deleting array %q#D", exp);
391
392 t = build_expr_type_conversion (WANT_POINTER, exp, true);
393
394 if (t == NULL_TREE || t == error_mark_node)
395 {
396 error ("type %q#T argument given to %<delete%>, expected pointer",
397 TREE_TYPE (exp));
398 return error_mark_node;
399 }
400
401 type = TREE_TYPE (t);
402
403 /* As of Valley Forge, you can delete a pointer to const. */
404
405 /* You can't delete functions. */
406 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
407 {
408 error ("cannot delete a function. Only pointer-to-objects are "
409 "valid arguments to %<delete%>");
410 return error_mark_node;
411 }
412
413 /* Deleting ptr to void is undefined behavior [expr.delete/3]. */
414 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
415 {
416 warning (0, "deleting %qT is undefined", type);
417 doing_vec = 0;
418 }
419
420 /* Deleting a pointer with the value zero is valid and has no effect. */
421 if (integer_zerop (t))
422 return build1 (NOP_EXPR, void_type_node, t);
423
424 if (doing_vec)
425 return build_vec_delete (t, /*maxindex=*/NULL_TREE,
426 sfk_deleting_destructor,
427 use_global_delete);
428 else
429 return build_delete (type, t, sfk_deleting_destructor,
430 LOOKUP_NORMAL, use_global_delete);
431}
432
433/* Report an error if the indicated template declaration is not the
434 sort of thing that should be a member template. */
435
436void
437check_member_template (tree tmpl)
438{
439 tree decl;
440
441 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
442 decl = DECL_TEMPLATE_RESULT (tmpl);
443
444 if (TREE_CODE (decl) == FUNCTION_DECL
445 || (TREE_CODE (decl) == TYPE_DECL
446 && IS_AGGR_TYPE (TREE_TYPE (decl))))
447 {
448 /* The parser rejects template declarations in local classes. */
449 gcc_assert (!current_function_decl);
450 /* The parser rejects any use of virtual in a function template. */
451 gcc_assert (!(TREE_CODE (decl) == FUNCTION_DECL
452 && DECL_VIRTUAL_P (decl)));
453
454 /* The debug-information generating code doesn't know what to do
455 with member templates. */
456 DECL_IGNORED_P (tmpl) = 1;
457 }
458 else
459 error ("template declaration of %q#D", decl);
460}
461
462/* Return true iff TYPE is a valid Java parameter or return type. */
463
464static bool
465acceptable_java_type (tree type)
466{
467 if (type == error_mark_node)
468 return false;
469
470 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
471 return true;
472 if (TREE_CODE (type) == POINTER_TYPE || TREE_CODE (type) == REFERENCE_TYPE)
473 {
474 type = TREE_TYPE (type);
475 if (TREE_CODE (type) == RECORD_TYPE)
476 {
477 tree args; int i;
478 if (! TYPE_FOR_JAVA (type))
479 return false;
480 if (! CLASSTYPE_TEMPLATE_INFO (type))
481 return true;
482 args = CLASSTYPE_TI_ARGS (type);
483 i = TREE_VEC_LENGTH (args);
484 while (--i >= 0)
485 {
486 type = TREE_VEC_ELT (args, i);
487 if (TREE_CODE (type) == POINTER_TYPE)
488 type = TREE_TYPE (type);
489 if (! TYPE_FOR_JAVA (type))
490 return false;
491 }
492 return true;
493 }
494 }
495 return false;
496}
497
498/* For a METHOD in a Java class CTYPE, return true if
499 the parameter and return types are valid Java types.
500 Otherwise, print appropriate error messages, and return false. */
501
502bool
503check_java_method (tree method)
504{
505 bool jerr = false;
506 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
507 tree ret_type = TREE_TYPE (TREE_TYPE (method));
508
509 if (!acceptable_java_type (ret_type))
510 {
511 error ("Java method %qD has non-Java return type %qT",
512 method, ret_type);
513 jerr = true;
514 }
515
516 arg_types = TREE_CHAIN (arg_types);
517 if (DECL_HAS_IN_CHARGE_PARM_P (method))
518 arg_types = TREE_CHAIN (arg_types);
519 if (DECL_HAS_VTT_PARM_P (method))
520 arg_types = TREE_CHAIN (arg_types);
521
522 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
523 {
524 tree type = TREE_VALUE (arg_types);
525 if (!acceptable_java_type (type))
526 {
527 if (type != error_mark_node)
528 error ("Java method %qD has non-Java parameter type %qT",
529 method, type);
530 jerr = true;
531 }
532 }
533 return !jerr;
534}
535
536/* Sanity check: report error if this function FUNCTION is not
537 really a member of the class (CTYPE) it is supposed to belong to.
538 TEMPLATE_PARMS is used to specify the template parameters of a member
539 template passed as FUNCTION_DECL. If the member template is passed as a
540 TEMPLATE_DECL, it can be NULL since the parameters can be extracted
541 from the declaration. If the function is not a function template, it
542 must be NULL.
543 It returns the original declaration for the function, or NULL_TREE
544 if no declaration was found (and an error was emitted). */
545
546tree
547check_classfn (tree ctype, tree function, tree template_parms)
548{
549 int ix;
550 bool is_template;
551 tree pushed_scope;
552
553 if (DECL_USE_TEMPLATE (function)
554 && !(TREE_CODE (function) == TEMPLATE_DECL
555 && DECL_TEMPLATE_SPECIALIZATION (function))
556 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (function)))
557 /* Since this is a specialization of a member template,
558 we're not going to find the declaration in the class.
559 For example, in:
560
561 struct S { template <typename T> void f(T); };
562 template <> void S::f(int);
563
564 we're not going to find `S::f(int)', but there's no
565 reason we should, either. We let our callers know we didn't
566 find the method, but we don't complain. */
567 return NULL_TREE;
568
569 /* Basic sanity check: for a template function, the template parameters
570 either were not passed, or they are the same of DECL_TEMPLATE_PARMS. */
571 if (TREE_CODE (function) == TEMPLATE_DECL)
572 {
573 gcc_assert (!template_parms
574 || comp_template_parms (template_parms,
575 DECL_TEMPLATE_PARMS (function)));
576 template_parms = DECL_TEMPLATE_PARMS (function);
577 }
578
579 /* OK, is this a definition of a member template? */
580 is_template = (template_parms != NULL_TREE);
581
582 /* We must enter the scope here, because conversion operators are
583 named by target type, and type equivalence relies on typenames
584 resolving within the scope of CTYPE. */
585 pushed_scope = push_scope (ctype);
586 ix = class_method_index_for_fn (complete_type (ctype), function);
587 if (ix >= 0)
588 {
589 VEC(tree,gc) *methods = CLASSTYPE_METHOD_VEC (ctype);
590 tree fndecls, fndecl = 0;
591 bool is_conv_op;
592 const char *format = NULL;
593
594 for (fndecls = VEC_index (tree, methods, ix);
595 fndecls; fndecls = OVL_NEXT (fndecls))
596 {
597 tree p1, p2;
598
599 fndecl = OVL_CURRENT (fndecls);
600 p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
601 p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
602
603 /* We cannot simply call decls_match because this doesn't
604 work for static member functions that are pretending to
605 be methods, and because the name may have been changed by
606 asm("new_name"). */
607
608 /* Get rid of the this parameter on functions that become
609 static. */
610 if (DECL_STATIC_FUNCTION_P (fndecl)
611 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
612 p1 = TREE_CHAIN (p1);
613
614 /* A member template definition only matches a member template
615 declaration. */
616 if (is_template != (TREE_CODE (fndecl) == TEMPLATE_DECL))
617 continue;
618
619 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
620 TREE_TYPE (TREE_TYPE (fndecl)))
621 && compparms (p1, p2)
622 && (!is_template
623 || comp_template_parms (template_parms,
624 DECL_TEMPLATE_PARMS (fndecl)))
625 && (DECL_TEMPLATE_SPECIALIZATION (function)
626 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
627 && (!DECL_TEMPLATE_SPECIALIZATION (function)
628 || (DECL_TI_TEMPLATE (function)
629 == DECL_TI_TEMPLATE (fndecl))))
630 break;
631 }
632 if (fndecls)
633 {
634 if (pushed_scope)
635 pop_scope (pushed_scope);
636 return OVL_CURRENT (fndecls);
637 }
638
639 error ("prototype for %q#D does not match any in class %qT",
640 function, ctype);
641 is_conv_op = DECL_CONV_FN_P (fndecl);
642
643 if (is_conv_op)
644 ix = CLASSTYPE_FIRST_CONVERSION_SLOT;
645 fndecls = VEC_index (tree, methods, ix);
646 while (fndecls)
647 {
648 fndecl = OVL_CURRENT (fndecls);
649 fndecls = OVL_NEXT (fndecls);
650
651 if (!fndecls && is_conv_op)
652 {
653 if (VEC_length (tree, methods) > (size_t) ++ix)
654 {
655 fndecls = VEC_index (tree, methods, ix);
656 if (!DECL_CONV_FN_P (OVL_CURRENT (fndecls)))
657 {
658 fndecls = NULL_TREE;
659 is_conv_op = false;
660 }
661 }
662 else
663 is_conv_op = false;
664 }
665 if (format)
666 format = " %+#D";
667 else if (fndecls)
668 format = N_("candidates are: %+#D");
669 else
670 format = N_("candidate is: %+#D");
671 error (format, fndecl);
672 }
673 }
674 else if (!COMPLETE_TYPE_P (ctype))
675 cxx_incomplete_type_error (function, ctype);
676 else
677 error ("no %q#D member function declared in class %qT",
678 function, ctype);
679
680 /* If we did not find the method in the class, add it to avoid
681 spurious errors (unless the CTYPE is not yet defined, in which
682 case we'll only confuse ourselves when the function is declared
683 properly within the class. */
684 if (COMPLETE_TYPE_P (ctype))
685 add_method (ctype, function, NULL_TREE);
686
687 if (pushed_scope)
688 pop_scope (pushed_scope);
689 return NULL_TREE;
690}
691
692/* DECL is a function with vague linkage. Remember it so that at the
693 end of the translation unit we can decide whether or not to emit
694 it. */
695
696void
697note_vague_linkage_fn (tree decl)
698{
699 if (!DECL_DEFERRED_FN (decl))
700 {
701 DECL_DEFERRED_FN (decl) = 1;
702 DECL_DEFER_OUTPUT (decl) = 1;
703 VEC_safe_push (tree, gc, deferred_fns, decl);
704 }
705}
706
707/* We have just processed the DECL, which is a static data member.
708 The other parameters are as for cp_finish_decl. */
709
710void
711finish_static_data_member_decl (tree decl,
712 tree init, bool init_const_expr_p,
713 tree asmspec_tree,
714 int flags)
715{
716 DECL_CONTEXT (decl) = current_class_type;
717
718 /* We cannot call pushdecl here, because that would fill in the
719 TREE_CHAIN of our decl. Instead, we modify cp_finish_decl to do
720 the right thing, namely, to put this decl out straight away. */
721
722 if (! processing_template_decl)
723 VEC_safe_push (tree, gc, pending_statics, decl);
724
725 if (LOCAL_CLASS_P (current_class_type))
726 pedwarn ("local class %q#T shall not have static data member %q#D",
727 current_class_type, decl);
728
729 /* Static consts need not be initialized in the class definition. */
730 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
731 {
732 static int explained = 0;
733
734 error ("initializer invalid for static member with constructor");
735 if (!explained)
736 {
737 error ("(an out of class initialization is required)");
738 explained = 1;
739 }
740 init = NULL_TREE;
741 }
742 /* Force the compiler to know when an uninitialized static const
743 member is being used. */
744 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
745 TREE_USED (decl) = 1;
746 DECL_INITIAL (decl) = init;
747 DECL_IN_AGGR_P (decl) = 1;
748
749 cp_finish_decl (decl, init, init_const_expr_p, asmspec_tree, flags);
750}
751
752/* DECLARATOR and DECLSPECS correspond to a class member. The other
753 parameters are as for cp_finish_decl. Return the DECL for the
754 class member declared. */
755
756tree
757grokfield (const cp_declarator *declarator,
758 cp_decl_specifier_seq *declspecs,
759 tree init, bool init_const_expr_p,
760 tree asmspec_tree,
761 tree attrlist)
762{
763 tree value;
764 const char *asmspec = 0;
765 int flags = LOOKUP_ONLYCONVERTING;
766
767 if (init
768 && TREE_CODE (init) == TREE_LIST
769 && TREE_VALUE (init) == error_mark_node
770 && TREE_CHAIN (init) == NULL_TREE)
771 init = NULL_TREE;
772
773 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist);
774 if (! value || error_operand_p (value))
775 /* friend or constructor went bad. */
776 return error_mark_node;
777
778 if (TREE_CODE (value) == TYPE_DECL && init)
779 {
780 error ("typedef %qD is initialized (use __typeof__ instead)", value);
781 init = NULL_TREE;
782 }
783
784 /* Pass friendly classes back. */
785 if (value == void_type_node)
786 return value;
787
788 /* Pass friend decls back. */
789 if ((TREE_CODE (value) == FUNCTION_DECL
790 || TREE_CODE (value) == TEMPLATE_DECL)
791 && DECL_CONTEXT (value) != current_class_type)
792 return value;
793
794 if (DECL_NAME (value) != NULL_TREE
795 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
796 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
797 error ("member %qD conflicts with virtual function table field name",
798 value);
799
800 /* Stash away type declarations. */
801 if (TREE_CODE (value) == TYPE_DECL)
802 {
803 DECL_NONLOCAL (value) = 1;
804 DECL_CONTEXT (value) = current_class_type;
805
806 if (processing_template_decl)
807 value = push_template_decl (value);
808
809 if (attrlist)
810 {
811 /* Avoid storing attributes in template parameters:
812 tsubst is not ready to handle them. */
813 tree type = TREE_TYPE (value);
814 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
815 || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
816 sorry ("applying attributes to template parameters is not implemented");
817 else
818 cplus_decl_attributes (&value, attrlist, 0);
819 }
820
821 return value;
822 }
823
824 if (DECL_IN_AGGR_P (value))
825 {
826 error ("%qD is already defined in %qT", value, DECL_CONTEXT (value));
827 return void_type_node;
828 }
829
830 if (asmspec_tree && asmspec_tree != error_mark_node)
831 asmspec = TREE_STRING_POINTER (asmspec_tree);
832
833 if (init)
834 {
835 if (TREE_CODE (value) == FUNCTION_DECL)
836 {
837 /* Initializers for functions are rejected early in the parser.
838 If we get here, it must be a pure specifier for a method. */
839 if (TREE_CODE (TREE_TYPE (value)) == METHOD_TYPE)
840 {
841 gcc_assert (error_operand_p (init) || integer_zerop (init));
842 DECL_PURE_VIRTUAL_P (value) = 1;
843 }
844 else
845 {
846 gcc_assert (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE);
847 error ("initializer specified for static member function %qD",
848 value);
849 }
850 }
851 else if (pedantic && TREE_CODE (value) != VAR_DECL)
852 /* Already complained in grokdeclarator. */
853 init = NULL_TREE;
854 else if (!processing_template_decl)
855 {
856 if (TREE_CODE (init) == CONSTRUCTOR)
857 init = digest_init (TREE_TYPE (value), init);
858 else
859 init = integral_constant_value (init);
860
861 if (init != error_mark_node && !TREE_CONSTANT (init))
862 {
863 /* We can allow references to things that are effectively
864 static, since references are initialized with the
865 address. */
866 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
867 || (TREE_STATIC (init) == 0
868 && (!DECL_P (init) || DECL_EXTERNAL (init) == 0)))
869 {
870 error ("field initializer is not constant");
871 init = error_mark_node;
872 }
873 }
874 }
875 }
876
877 if (processing_template_decl
878 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
879 {
880 value = push_template_decl (value);
881 if (error_operand_p (value))
882 return error_mark_node;
883 }
884
885 if (attrlist)
886 cplus_decl_attributes (&value, attrlist, 0);
887
888 switch (TREE_CODE (value))
889 {
890 case VAR_DECL:
891 finish_static_data_member_decl (value, init, init_const_expr_p,
892 asmspec_tree, flags);
893 return value;
894
895 case FIELD_DECL:
896 if (asmspec)
897 error ("%<asm%> specifiers are not permitted on non-static data members");
898 if (DECL_INITIAL (value) == error_mark_node)
899 init = error_mark_node;
900 cp_finish_decl (value, init, /*init_const_expr_p=*/false,
901 NULL_TREE, flags);
902 DECL_INITIAL (value) = init;
903 DECL_IN_AGGR_P (value) = 1;
904 return value;
905
906 case FUNCTION_DECL:
907 if (asmspec)
908 set_user_assembler_name (value, asmspec);
909
910 cp_finish_decl (value,
911 /*init=*/NULL_TREE,
912 /*init_const_expr_p=*/false,
913 asmspec_tree, flags);
914
915 /* Pass friends back this way. */
916 if (DECL_FRIEND_P (value))
917 return void_type_node;
918
919 DECL_IN_AGGR_P (value) = 1;
920 return value;
921
922 default:
923 gcc_unreachable ();
924 }
925 return NULL_TREE;
926}
927
928/* Like `grokfield', but for bitfields.
929 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
930
931tree
932grokbitfield (const cp_declarator *declarator,
933 cp_decl_specifier_seq *declspecs, tree width)
934{
935 tree value = grokdeclarator (declarator, declspecs, BITFIELD, 0, NULL);
936
937 if (value == error_mark_node)
938 return NULL_TREE; /* friends went bad. */
939
940 /* Pass friendly classes back. */
941 if (TREE_CODE (value) == VOID_TYPE)
942 return void_type_node;
943
944 if (!INTEGRAL_TYPE_P (TREE_TYPE (value))
945 && (POINTER_TYPE_P (value)
946 || !dependent_type_p (TREE_TYPE (value))))
947 {
948 error ("bit-field %qD with non-integral type", value);
949 return error_mark_node;
950 }
951
952 if (TREE_CODE (value) == TYPE_DECL)
953 {
954 error ("cannot declare %qD to be a bit-field type", value);
955 return NULL_TREE;
956 }
957
958 /* Usually, finish_struct_1 catches bitfields with invalid types.
959 But, in the case of bitfields with function type, we confuse
960 ourselves into thinking they are member functions, so we must
961 check here. */
962 if (TREE_CODE (value) == FUNCTION_DECL)
963 {
964 error ("cannot declare bit-field %qD with function type",
965 DECL_NAME (value));
966 return NULL_TREE;
967 }
968
969 if (DECL_IN_AGGR_P (value))
970 {
971 error ("%qD is already defined in the class %qT", value,
972 DECL_CONTEXT (value));
973 return void_type_node;
974 }
975
976 if (TREE_STATIC (value))
977 {
978 error ("static member %qD cannot be a bit-field", value);
979 return NULL_TREE;
980 }
981 finish_decl (value, NULL_TREE, NULL_TREE);
982
983 if (width != error_mark_node)
984 {
985 constant_expression_warning (width);
986 DECL_INITIAL (value) = width;
987 SET_DECL_C_BIT_FIELD (value);
988 }
989
990 DECL_IN_AGGR_P (value) = 1;
991 return value;
992}
993
994
995void
996cplus_decl_attributes (tree *decl, tree attributes, int flags)
997{
998 if (*decl == NULL_TREE || *decl == void_type_node
999 || *decl == error_mark_node)
1000 return;
1001
1002 if (TREE_CODE (*decl) == TEMPLATE_DECL)
1003 decl = &DECL_TEMPLATE_RESULT (*decl);
1004
1005 decl_attributes (decl, attributes, flags);
1006
1007 if (TREE_CODE (*decl) == TYPE_DECL)
1008 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl));
1009}
1010
1011/* Walks through the namespace- or function-scope anonymous union
1012 OBJECT, with the indicated TYPE, building appropriate VAR_DECLs.
1013 Returns one of the fields for use in the mangled name. */
1014
1015static tree
1016build_anon_union_vars (tree type, tree object)
1017{
1018 tree main_decl = NULL_TREE;
1019 tree field;
1020
1021 /* Rather than write the code to handle the non-union case,
1022 just give an error. */
1023 if (TREE_CODE (type) != UNION_TYPE)
1024 error ("anonymous struct not inside named type");
1025
1026 for (field = TYPE_FIELDS (type);
1027 field != NULL_TREE;
1028 field = TREE_CHAIN (field))
1029 {
1030 tree decl;
1031 tree ref;
1032
1033 if (DECL_ARTIFICIAL (field))
1034 continue;
1035 if (TREE_CODE (field) != FIELD_DECL)
1036 {
1037 pedwarn ("%q+#D invalid; an anonymous union can only "
1038 "have non-static data members", field);
1039 continue;
1040 }
1041
1042 if (TREE_PRIVATE (field))
1043 pedwarn ("private member %q+#D in anonymous union", field);
1044 else if (TREE_PROTECTED (field))
1045 pedwarn ("protected member %q+#D in anonymous union", field);
1046
1047 if (processing_template_decl)
1048 ref = build_min_nt (COMPONENT_REF, object,
1049 DECL_NAME (field), NULL_TREE);
1050 else
1051 ref = build_class_member_access_expr (object, field, NULL_TREE,
1052 false);
1053
1054 if (DECL_NAME (field))
1055 {
1056 tree base;
1057
1058 decl = build_decl (VAR_DECL, DECL_NAME (field), TREE_TYPE (field));
1059 DECL_ANON_UNION_VAR_P (decl) = 1;
1060
1061 base = get_base_address (object);
1062 TREE_PUBLIC (decl) = TREE_PUBLIC (base);
1063 TREE_STATIC (decl) = TREE_STATIC (base);
1064 DECL_EXTERNAL (decl) = DECL_EXTERNAL (base);
1065
1066 SET_DECL_VALUE_EXPR (decl, ref);
1067 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1068
1069 decl = pushdecl (decl);
1070 }
1071 else if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1072 decl = build_anon_union_vars (TREE_TYPE (field), ref);
1073 else
1074 decl = 0;
1075
1076 if (main_decl == NULL_TREE)
1077 main_decl = decl;
1078 }
1079
1080 return main_decl;
1081}
1082
1083/* Finish off the processing of a UNION_TYPE structure. If the union is an
1084 anonymous union, then all members must be laid out together. PUBLIC_P
1085 is nonzero if this union is not declared static. */
1086
1087void
1088finish_anon_union (tree anon_union_decl)
1089{
1090 tree type;
1091 tree main_decl;
1092 bool public_p;
1093
1094 if (anon_union_decl == error_mark_node)
1095 return;
1096
1097 type = TREE_TYPE (anon_union_decl);
1098 public_p = TREE_PUBLIC (anon_union_decl);
1099
1100 /* The VAR_DECL's context is the same as the TYPE's context. */
1101 DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type));
1102
1103 if (TYPE_FIELDS (type) == NULL_TREE)
1104 return;
1105
1106 if (public_p)
1107 {
1108 error ("namespace-scope anonymous aggregates must be static");
1109 return;
1110 }
1111
1112 main_decl = build_anon_union_vars (type, anon_union_decl);
1113 if (main_decl == error_mark_node)
1114 return;
1115 if (main_decl == NULL_TREE)
1116 {
1117 warning (0, "anonymous union with no members");
1118 return;
1119 }
1120
1121 if (!processing_template_decl)
1122 {
1123 /* Use main_decl to set the mangled name. */
1124 DECL_NAME (anon_union_decl) = DECL_NAME (main_decl);
1125 mangle_decl (anon_union_decl);
1126 DECL_NAME (anon_union_decl) = NULL_TREE;
1127 }
1128
1129 pushdecl (anon_union_decl);
1130 if (building_stmt_tree ()
1131 && at_function_scope_p ())
1132 add_decl_expr (anon_union_decl);
1133 else if (!processing_template_decl)
1134 rest_of_decl_compilation (anon_union_decl,
1135 toplevel_bindings_p (), at_eof);
1136}
1137
1138/* Auxiliary functions to make type signatures for
1139 `operator new' and `operator delete' correspond to
1140 what compiler will be expecting. */
1141
1142tree
1143coerce_new_type (tree type)
1144{
1145 int e = 0;
1146 tree args = TYPE_ARG_TYPES (type);
1147
1148 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
1149
1150 if (!same_type_p (TREE_TYPE (type), ptr_type_node))
1151 {
1152 e = 1;
1153 error ("%<operator new%> must return type %qT", ptr_type_node);
1154 }
1155
1156 if (!args || args == void_list_node
1157 || !same_type_p (TREE_VALUE (args), size_type_node))
1158 {
1159 e = 2;
1160 if (args && args != void_list_node)
1161 args = TREE_CHAIN (args);
1162 pedwarn ("%<operator new%> takes type %<size_t%> (%qT) "
1163 "as first parameter", size_type_node);
1164 }
1165 switch (e)
1166 {
1167 case 2:
1168 args = tree_cons (NULL_TREE, size_type_node, args);
1169 /* Fall through. */
1170 case 1:
1171 type = build_exception_variant
1172 (build_function_type (ptr_type_node, args),
1173 TYPE_RAISES_EXCEPTIONS (type));
1174 /* Fall through. */
1175 default:;
1176 }
1177 return type;
1178}
1179
1180tree
1181coerce_delete_type (tree type)
1182{
1183 int e = 0;
1184 tree args = TYPE_ARG_TYPES (type);
1185
1186 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
1187
1188 if (!same_type_p (TREE_TYPE (type), void_type_node))
1189 {
1190 e = 1;
1191 error ("%<operator delete%> must return type %qT", void_type_node);
1192 }
1193
1194 if (!args || args == void_list_node
1195 || !same_type_p (TREE_VALUE (args), ptr_type_node))
1196 {
1197 e = 2;
1198 if (args && args != void_list_node)
1199 args = TREE_CHAIN (args);
1200 error ("%<operator delete%> takes type %qT as first parameter",
1201 ptr_type_node);
1202 }
1203 switch (e)
1204 {
1205 case 2:
1206 args = tree_cons (NULL_TREE, ptr_type_node, args);
1207 /* Fall through. */
1208 case 1:
1209 type = build_exception_variant
1210 (build_function_type (void_type_node, args),
1211 TYPE_RAISES_EXCEPTIONS (type));
1212 /* Fall through. */
1213 default:;
1214 }
1215
1216 return type;
1217}
1218
1219static void
1220mark_vtable_entries (tree decl)
1221{
1222 tree fnaddr;
1223 unsigned HOST_WIDE_INT idx;
1224
1225 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)),
1226 idx, fnaddr)
1227 {
1228 tree fn;
1229
1230 STRIP_NOPS (fnaddr);
1231
1232 if (TREE_CODE (fnaddr) != ADDR_EXPR
1233 && TREE_CODE (fnaddr) != FDESC_EXPR)
1234 /* This entry is an offset: a virtual base class offset, a
1235 virtual call offset, an RTTI offset, etc. */
1236 continue;
1237
1238 fn = TREE_OPERAND (fnaddr, 0);
1239 TREE_ADDRESSABLE (fn) = 1;
1240 /* When we don't have vcall offsets, we output thunks whenever
1241 we output the vtables that contain them. With vcall offsets,
1242 we know all the thunks we'll need when we emit a virtual
1243 function, so we emit the thunks there instead. */
1244 if (DECL_THUNK_P (fn))
1245 use_thunk (fn, /*emit_p=*/0);
1246 mark_used (fn);
1247 }
1248}
1249
1250/* Set DECL up to have the closest approximation of "initialized common"
1251 linkage available. */
1252
1253void
1254comdat_linkage (tree decl)
1255{
1256 if (flag_weak)
1257 make_decl_one_only (decl);
1258 else if (TREE_CODE (decl) == FUNCTION_DECL
1259 || (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)))
1260 /* We can just emit function and compiler-generated variables
1261 statically; having multiple copies is (for the most part) only
1262 a waste of space.
1263
1264 There are two correctness issues, however: the address of a
1265 template instantiation with external linkage should be the
1266 same, independent of what translation unit asks for the
1267 address, and this will not hold when we emit multiple copies of
1268 the function. However, there's little else we can do.
1269
1270 Also, by default, the typeinfo implementation assumes that
1271 there will be only one copy of the string used as the name for
1272 each type. Therefore, if weak symbols are unavailable, the
1273 run-time library should perform a more conservative check; it
1274 should perform a string comparison, rather than an address
1275 comparison. */
1276 TREE_PUBLIC (decl) = 0;
1277 else
1278 {
1279 /* Static data member template instantiations, however, cannot
1280 have multiple copies. */
1281 if (DECL_INITIAL (decl) == 0
1282 || DECL_INITIAL (decl) == error_mark_node)
1283 DECL_COMMON (decl) = 1;
1284 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
1285 {
1286 DECL_COMMON (decl) = 1;
1287 DECL_INITIAL (decl) = error_mark_node;
1288 }
1289 else if (!DECL_EXPLICIT_INSTANTIATION (decl))
1290 {
1291 /* We can't do anything useful; leave vars for explicit
1292 instantiation. */
1293 DECL_EXTERNAL (decl) = 1;
1294 DECL_NOT_REALLY_EXTERN (decl) = 0;
1295 }
1296 }
1297
1298 if (DECL_LANG_SPECIFIC (decl))
1299 DECL_COMDAT (decl) = 1;
1300}
1301
1302/* For win32 we also want to put explicit instantiations in
1303 linkonce sections, so that they will be merged with implicit
1304 instantiations; otherwise we get duplicate symbol errors.
1305 For Darwin we do not want explicit instantiations to be
1306 linkonce. */
1307
1308void
1309maybe_make_one_only (tree decl)
1310{
1311 /* We used to say that this was not necessary on targets that support weak
1312 symbols, because the implicit instantiations will defer to the explicit
1313 one. However, that's not actually the case in SVR4; a strong definition
1314 after a weak one is an error. Also, not making explicit
1315 instantiations one_only means that we can end up with two copies of
1316 some template instantiations. */
1317 if (! flag_weak)
1318 return;
1319
1320 /* We can't set DECL_COMDAT on functions, or cp_finish_file will think
1321 we can get away with not emitting them if they aren't used. We need
1322 to for variables so that cp_finish_decl will update their linkage,
1323 because their DECL_INITIAL may not have been set properly yet. */
1324
1325 if (!TARGET_WEAK_NOT_IN_ARCHIVE_TOC
1326 || (! DECL_EXPLICIT_INSTANTIATION (decl)
1327 && ! DECL_TEMPLATE_SPECIALIZATION (decl)))
1328 {
1329 make_decl_one_only (decl);
1330
1331 if (TREE_CODE (decl) == VAR_DECL)
1332 {
1333 DECL_COMDAT (decl) = 1;
1334 /* Mark it needed so we don't forget to emit it. */
1335 mark_decl_referenced (decl);
1336 }
1337 }
1338}
1339
1340/* Determine whether or not we want to specifically import or export CTYPE,
1341 using various heuristics. */
1342
1343static void
1344import_export_class (tree ctype)
1345{
1346 /* -1 for imported, 1 for exported. */
1347 int import_export = 0;
1348
1349 /* It only makes sense to call this function at EOF. The reason is
1350 that this function looks at whether or not the first non-inline
1351 non-abstract virtual member function has been defined in this
1352 translation unit. But, we can't possibly know that until we've
1353 seen the entire translation unit. */
1354 gcc_assert (at_eof);
1355
1356 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1357 return;
1358
1359 /* If MULTIPLE_SYMBOL_SPACES is set and we saw a #pragma interface,
1360 we will have CLASSTYPE_INTERFACE_ONLY set but not
1361 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
1362 heuristic because someone will supply a #pragma implementation
1363 elsewhere, and deducing it here would produce a conflict. */
1364 if (CLASSTYPE_INTERFACE_ONLY (ctype))
1365 return;
1366
1367 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
1368 import_export = -1;
1369 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
1370 import_export = 1;
1371 else if (CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
1372 && !flag_implicit_templates)
1373 /* For a template class, without -fimplicit-templates, check the
1374 repository. If the virtual table is assigned to this
1375 translation unit, then export the class; otherwise, import
1376 it. */
1377 import_export = repo_export_class_p (ctype) ? 1 : -1;
1378 else if (TYPE_POLYMORPHIC_P (ctype))
1379 {
1380 /* The ABI specifies that the virtual table and associated
1381 information are emitted with the key method, if any. */
1382 tree method = CLASSTYPE_KEY_METHOD (ctype);
1383 /* If weak symbol support is not available, then we must be
1384 careful not to emit the vtable when the key function is
1385 inline. An inline function can be defined in multiple
1386 translation units. If we were to emit the vtable in each
1387 translation unit containing a definition, we would get
1388 multiple definition errors at link-time. */
1389 if (method && (flag_weak || ! DECL_DECLARED_INLINE_P (method)))
1390 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
1391 }
1392
1393 /* When MULTIPLE_SYMBOL_SPACES is set, we cannot count on seeing
1394 a definition anywhere else. */
1395 if (MULTIPLE_SYMBOL_SPACES && import_export == -1)
1396 import_export = 0;
1397
1398 /* Allow backends the chance to overrule the decision. */
1399 if (targetm.cxx.import_export_class)
1400 import_export = targetm.cxx.import_export_class (ctype, import_export);
1401
1402 if (import_export)
1403 {
1404 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
1405 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
1406 }
1407}
1408
1409/* Return true if VAR has already been provided to the back end; in that
1410 case VAR should not be modified further by the front end. */
1411static bool
1412var_finalized_p (tree var)
1413{
1414 return cgraph_varpool_node (var)->finalized;
1415}
1416
1417/* DECL is a VAR_DECL or FUNCTION_DECL which, for whatever reason,
1418 must be emitted in this translation unit. Mark it as such. */
1419
1420void
1421mark_needed (tree decl)
1422{
1423 /* It's possible that we no longer need to set
1424 TREE_SYMBOL_REFERENCED here directly, but doing so is
1425 harmless. */
1426 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)) = 1;
1427 mark_decl_referenced (decl);
1428}
1429
1430/* DECL is either a FUNCTION_DECL or a VAR_DECL. This function
1431 returns true if a definition of this entity should be provided in
1432 this object file. Callers use this function to determine whether
1433 or not to let the back end know that a definition of DECL is
1434 available in this translation unit. */
1435
1436bool
1437decl_needed_p (tree decl)
1438{
1439 gcc_assert (TREE_CODE (decl) == VAR_DECL
1440 || TREE_CODE (decl) == FUNCTION_DECL);
1441 /* This function should only be called at the end of the translation
1442 unit. We cannot be sure of whether or not something will be
1443 COMDAT until that point. */
1444 gcc_assert (at_eof);
1445
1446 /* All entities with external linkage that are not COMDAT should be
1447 emitted; they may be referred to from other object files. */
1448 if (TREE_PUBLIC (decl) && !DECL_COMDAT (decl))
1449 return true;
1450 /* If this entity was used, let the back-end see it; it will decide
1451 whether or not to emit it into the object file. */
1452 if (TREE_USED (decl)
1453 || (DECL_ASSEMBLER_NAME_SET_P (decl)
1454 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))))
1455 return true;
1456 /* Otherwise, DECL does not need to be emitted -- yet. A subsequent
1457 reference to DECL might cause it to be emitted later. */
1458 return false;
1459}
1460
1461/* If necessary, write out the vtables for the dynamic class CTYPE.
1462 Returns true if any vtables were emitted. */
1463
1464static bool
1465maybe_emit_vtables (tree ctype)
1466{
1467 tree vtbl;
1468 tree primary_vtbl;
1469 int needed = 0;
1470
1471 /* If the vtables for this class have already been emitted there is
1472 nothing more to do. */
1473 primary_vtbl = CLASSTYPE_VTABLES (ctype);
1474 if (var_finalized_p (primary_vtbl))
1475 return false;
1476 /* Ignore dummy vtables made by get_vtable_decl. */
1477 if (TREE_TYPE (primary_vtbl) == void_type_node)
1478 return false;
1479
1480 /* On some targets, we cannot determine the key method until the end
1481 of the translation unit -- which is when this function is
1482 called. */
1483 if (!targetm.cxx.key_method_may_be_inline ())
1484 determine_key_method (ctype);
1485
1486 /* See if any of the vtables are needed. */
1487 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1488 {
1489 import_export_decl (vtbl);
1490 if (DECL_NOT_REALLY_EXTERN (vtbl) && decl_needed_p (vtbl))
1491 needed = 1;
1492 }
1493 if (!needed)
1494 {
1495 /* If the references to this class' vtables are optimized away,
1496 still emit the appropriate debugging information. See
1497 dfs_debug_mark. */
1498 if (DECL_COMDAT (primary_vtbl)
1499 && CLASSTYPE_DEBUG_REQUESTED (ctype))
1500 note_debug_info_needed (ctype);
1501 return false;
1502 }
1503
1504 /* The ABI requires that we emit all of the vtables if we emit any
1505 of them. */
1506 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1507 {
1508 /* Mark entities references from the virtual table as used. */
1509 mark_vtable_entries (vtbl);
1510
1511 if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0)
1512 {
1513 tree expr = store_init_value (vtbl, DECL_INITIAL (vtbl));
1514
1515 /* It had better be all done at compile-time. */
1516 gcc_assert (!expr);
1517 }
1518
1519 /* Write it out. */
1520 DECL_EXTERNAL (vtbl) = 0;
1521 rest_of_decl_compilation (vtbl, 1, 1);
1522
1523 /* Because we're only doing syntax-checking, we'll never end up
1524 actually marking the variable as written. */
1525 if (flag_syntax_only)
1526 TREE_ASM_WRITTEN (vtbl) = 1;
1527 }
1528
1529 /* Since we're writing out the vtable here, also write the debug
1530 info. */
1531 note_debug_info_needed (ctype);
1532
1533 return true;
1534}
1535
1536/* A special return value from type_visibility meaning internal
1537 linkage. */
1538
1539enum { VISIBILITY_ANON = VISIBILITY_INTERNAL+1 };
1540
1541/* walk_tree helper function for type_visibility. */
1542
1543static tree
1544min_vis_r (tree *tp, int *walk_subtrees, void *data)
1545{
1546 int *vis_p = (int *)data;
1547 if (! TYPE_P (*tp))
1548 {
1549 *walk_subtrees = 0;
1550 }
1551 else if (CLASS_TYPE_P (*tp))
1552 {
1553 if (!TREE_PUBLIC (TYPE_MAIN_DECL (*tp)))
1554 {
1555 *vis_p = VISIBILITY_ANON;
1556 return *tp;
1557 }
1558 else if (CLASSTYPE_VISIBILITY (*tp) > *vis_p)
1559 *vis_p = CLASSTYPE_VISIBILITY (*tp);
1560 }
1561 return NULL;
1562}
1563
1564/* Returns the visibility of TYPE, which is the minimum visibility of its
1565 component types. */
1566
1567static int
1568type_visibility (tree type)
1569{
1570 int vis = VISIBILITY_DEFAULT;
1571 walk_tree_without_duplicates (&type, min_vis_r, &vis);
1572 return vis;
1573}
1574
1575/* Limit the visibility of DECL to VISIBILITY, if not explicitly
1576 specified (or if VISIBILITY is static). */
1577
1578static bool
1579constrain_visibility (tree decl, int visibility)
1580{
1581 if (visibility == VISIBILITY_ANON)
1582 {
1583 /* extern "C" declarations aren't affected by the anonymous
1584 namespace. */
1585 if (!DECL_EXTERN_C_P (decl))
1586 {
1587 TREE_PUBLIC (decl) = 0;
1588 DECL_INTERFACE_KNOWN (decl) = 1;
1589 if (DECL_LANG_SPECIFIC (decl))
1590 DECL_NOT_REALLY_EXTERN (decl) = 1;
1591 }
1592 }
1593 else if (visibility > DECL_VISIBILITY (decl)
1594 && !DECL_VISIBILITY_SPECIFIED (decl))
1595 {
1596 DECL_VISIBILITY (decl) = visibility;
1597 return true;
1598 }
1599 return false;
1600}
1601
1602/* Constrain the visibility of DECL based on the visibility of its template
1603 arguments. */
1604
1605static void
1606constrain_visibility_for_template (tree decl, tree targs)
1607{
1608 /* If this is a template instantiation, check the innermost
1609 template args for visibility constraints. The outer template
1610 args are covered by the class check. */
1611 tree args = INNERMOST_TEMPLATE_ARGS (targs);
1612 int i;
1613 for (i = TREE_VEC_LENGTH (args); i > 0; --i)
1614 {
1615 int vis = 0;
1616
1617 tree arg = TREE_VEC_ELT (args, i-1);
1618 if (TYPE_P (arg))
1619 vis = type_visibility (arg);
1620 else if (TREE_TYPE (arg) && POINTER_TYPE_P (TREE_TYPE (arg)))
1621 {
1622 STRIP_NOPS (arg);
1623 if (TREE_CODE (arg) == ADDR_EXPR)
1624 arg = TREE_OPERAND (arg, 0);
1625 if (TREE_CODE (arg) == VAR_DECL
1626 || TREE_CODE (arg) == FUNCTION_DECL)
1627 {
1628 if (! TREE_PUBLIC (arg))
1629 vis = VISIBILITY_ANON;
1630 else
1631 vis = DECL_VISIBILITY (arg);
1632 }
1633 }
1634 if (vis)
1635 constrain_visibility (decl, vis);
1636 }
1637}
1638
1639/* Like c_determine_visibility, but with additional C++-specific
1640 behavior.
1641
1642 Function-scope entities can rely on the function's visibility because
1643 it is set in start_preparsed_function.
1644
1645 Class-scope entities cannot rely on the class's visibility until the end
1646 of the enclosing class definition.
1647
1648 Note that because namespaces have multiple independent definitions,
1649 namespace visibility is handled elsewhere using the #pragma visibility
1650 machinery rather than by decorating the namespace declaration.
1651
1652 The goal is for constraints from the type to give a diagnostic, and
1653 other constraints to be applied silently. */
1654
1655void
1656determine_visibility (tree decl)
1657{
1658 tree class_type = NULL_TREE;
1659 bool use_template;
1660
1661 /* Remember that all decls get VISIBILITY_DEFAULT when built. */
1662
1663 /* Only relevant for names with external linkage. */
1664 if (!TREE_PUBLIC (decl))
1665 return;
1666
1667 /* Cloned constructors and destructors get the same visibility as
1668 the underlying function. That should be set up in
1669 maybe_clone_body. */
1670 gcc_assert (!DECL_CLONED_FUNCTION_P (decl));
1671
1672 if (TREE_CODE (decl) == TYPE_DECL)
1673 {
1674 if (CLASS_TYPE_P (TREE_TYPE (decl)))
1675 use_template = CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl));
1676 else if (TYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
1677 use_template = 1;
1678 else
1679 use_template = 0;
1680 }
1681 else if (DECL_LANG_SPECIFIC (decl))
1682 use_template = DECL_USE_TEMPLATE (decl);
1683 else
1684 use_template = 0;
1685
1686 /* Anything that is exported must have default visibility. */
1687 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
1688 && lookup_attribute ("dllexport",
1689 TREE_CODE (decl) == TYPE_DECL
1690 ? TYPE_ATTRIBUTES (TREE_TYPE (decl))
1691 : DECL_ATTRIBUTES (decl)))
1692 {
1693 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
1694 DECL_VISIBILITY_SPECIFIED (decl) = 1;
1695 }
1696
1697 /* If DECL is a member of a class, visibility specifiers on the
1698 class can influence the visibility of the DECL. */
1699 if (DECL_CLASS_SCOPE_P (decl))
1700 class_type = DECL_CONTEXT (decl);
1701 else
1702 {
1703 /* Not a class member. */
1704
1705 /* Virtual tables have DECL_CONTEXT set to their associated class,
1706 so they are automatically handled above. */
1707 gcc_assert (TREE_CODE (decl) != VAR_DECL
1708 || !DECL_VTABLE_OR_VTT_P (decl));
1709
1710 if (DECL_FUNCTION_SCOPE_P (decl) && ! DECL_VISIBILITY_SPECIFIED (decl))
1711 {
1712 /* Local statics and classes get the visibility of their
1713 containing function by default, except that
1714 -fvisibility-inlines-hidden doesn't affect them. */
1715 tree fn = DECL_CONTEXT (decl);
1716 if (DECL_VISIBILITY_SPECIFIED (fn) || ! DECL_CLASS_SCOPE_P (fn))
1717 {
1718 DECL_VISIBILITY (decl) = DECL_VISIBILITY (fn);
1719 DECL_VISIBILITY_SPECIFIED (decl) =
1720 DECL_VISIBILITY_SPECIFIED (fn);
1721 }
1722 else
1723 determine_visibility_from_class (decl, DECL_CONTEXT (fn));
1724
1725 /* Local classes in templates have CLASSTYPE_USE_TEMPLATE set,
1726 but have no TEMPLATE_INFO, so don't try to check it. */
1727 use_template = 0;
1728 }
| 1/* Process declarations and variables for C++ compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002, 2003, 2004, 2005 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
5
6This file is part of GCC.
7
8GCC is free software; you can redistribute it and/or modify
9it under the terms of the GNU General Public License as published by
10the Free Software Foundation; either version 2, or (at your option)
11any later version.
12
13GCC is distributed in the hope that it will be useful,
14but WITHOUT ANY WARRANTY; without even the implied warranty of
15MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16GNU General Public License for more details.
17
18You should have received a copy of the GNU General Public License
19along with GCC; see the file COPYING. If not, write to
20the Free Software Foundation, 51 Franklin Street, Fifth Floor,
21Boston, MA 02110-1301, USA. */
22
23
24/* Process declarations and symbol lookup for C++ front end.
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"
32#include "system.h"
33#include "coretypes.h"
34#include "tm.h"
35#include "tree.h"
36#include "rtl.h"
37#include "expr.h"
38#include "flags.h"
39#include "cp-tree.h"
40#include "decl.h"
41#include "output.h"
42#include "except.h"
43#include "toplev.h"
44#include "timevar.h"
45#include "cpplib.h"
46#include "target.h"
47#include "c-common.h"
48#include "tree-mudflap.h"
49#include "cgraph.h"
50#include "tree-inline.h"
51#include "c-pragma.h"
52#include "tree-dump.h"
53#include "intl.h"
54
55extern cpp_reader *parse_in;
56
57/* This structure contains information about the initializations
58 and/or destructions required for a particular priority level. */
59typedef struct priority_info_s {
60 /* Nonzero if there have been any initializations at this priority
61 throughout the translation unit. */
62 int initializations_p;
63 /* Nonzero if there have been any destructions at this priority
64 throughout the translation unit. */
65 int destructions_p;
66} *priority_info;
67
68static void mark_vtable_entries (tree);
69static bool maybe_emit_vtables (tree);
70static bool acceptable_java_type (tree);
71static tree start_objects (int, int);
72static void finish_objects (int, int, tree);
73static tree start_static_storage_duration_function (unsigned);
74static void finish_static_storage_duration_function (tree);
75static priority_info get_priority_info (int);
76static void do_static_initialization_or_destruction (tree, bool);
77static void one_static_initialization_or_destruction (tree, tree, bool);
78static void generate_ctor_or_dtor_function (bool, int, location_t *);
79static int generate_ctor_and_dtor_functions_for_priority (splay_tree_node,
80 void *);
81static tree prune_vars_needing_no_initialization (tree *);
82static void write_out_vars (tree);
83static void import_export_class (tree);
84static tree get_guard_bits (tree);
85static void determine_visibility_from_class (tree, tree);
86
87/* A list of static class variables. This is needed, because a
88 static class variable can be declared inside the class without
89 an initializer, and then initialized, statically, outside the class. */
90static GTY(()) VEC(tree,gc) *pending_statics;
91
92/* A list of functions which were declared inline, but which we
93 may need to emit outline anyway. */
94static GTY(()) VEC(tree,gc) *deferred_fns;
95
96/* Nonzero if we're done parsing and into end-of-file activities. */
97
98int at_eof;
99
100/* Functions called along with real static constructors and destructors. */
101
102tree static_ctors;
103tree static_dtors;
104
105
106
107/* Return a member function type (a METHOD_TYPE), given FNTYPE (a
108 FUNCTION_TYPE), CTYPE (class type), and QUALS (the cv-qualifiers
109 that apply to the function). */
110
111tree
112build_memfn_type (tree fntype, tree ctype, cp_cv_quals quals)
113{
114 tree raises;
115 int type_quals;
116
117 if (fntype == error_mark_node || ctype == error_mark_node)
118 return error_mark_node;
119
120 type_quals = quals & ~TYPE_QUAL_RESTRICT;
121 ctype = cp_build_qualified_type (ctype, type_quals);
122 fntype = build_method_type_directly (ctype, TREE_TYPE (fntype),
123 (TREE_CODE (fntype) == METHOD_TYPE
124 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
125 : TYPE_ARG_TYPES (fntype)));
126 raises = TYPE_RAISES_EXCEPTIONS (fntype);
127 if (raises)
128 fntype = build_exception_variant (fntype, raises);
129
130 return fntype;
131}
132
133/* Build a PARM_DECL with NAME and TYPE, and set DECL_ARG_TYPE
134 appropriately. */
135
136tree
137cp_build_parm_decl (tree name, tree type)
138{
139 tree parm = build_decl (PARM_DECL, name, type);
140 /* DECL_ARG_TYPE is only used by the back end and the back end never
141 sees templates. */
142 if (!processing_template_decl)
143 DECL_ARG_TYPE (parm) = type_passed_as (type);
144 return parm;
145}
146
147/* Returns a PARM_DECL for a parameter of the indicated TYPE, with the
148 indicated NAME. */
149
150tree
151build_artificial_parm (tree name, tree type)
152{
153 tree parm = cp_build_parm_decl (name, type);
154 DECL_ARTIFICIAL (parm) = 1;
155 /* All our artificial parms are implicitly `const'; they cannot be
156 assigned to. */
157 TREE_READONLY (parm) = 1;
158 return parm;
159}
160
161/* Constructors for types with virtual baseclasses need an "in-charge" flag
162 saying whether this constructor is responsible for initialization of
163 virtual baseclasses or not. All destructors also need this "in-charge"
164 flag, which additionally determines whether or not the destructor should
165 free the memory for the object.
166
167 This function adds the "in-charge" flag to member function FN if
168 appropriate. It is called from grokclassfn and tsubst.
169 FN must be either a constructor or destructor.
170
171 The in-charge flag follows the 'this' parameter, and is followed by the
172 VTT parm (if any), then the user-written parms. */
173
174void
175maybe_retrofit_in_chrg (tree fn)
176{
177 tree basetype, arg_types, parms, parm, fntype;
178
179 /* If we've already add the in-charge parameter don't do it again. */
180 if (DECL_HAS_IN_CHARGE_PARM_P (fn))
181 return;
182
183 /* When processing templates we can't know, in general, whether or
184 not we're going to have virtual baseclasses. */
185 if (processing_template_decl)
186 return;
187
188 /* We don't need an in-charge parameter for constructors that don't
189 have virtual bases. */
190 if (DECL_CONSTRUCTOR_P (fn)
191 && !CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fn)))
192 return;
193
194 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
195 basetype = TREE_TYPE (TREE_VALUE (arg_types));
196 arg_types = TREE_CHAIN (arg_types);
197
198 parms = TREE_CHAIN (DECL_ARGUMENTS (fn));
199
200 /* If this is a subobject constructor or destructor, our caller will
201 pass us a pointer to our VTT. */
202 if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fn)))
203 {
204 parm = build_artificial_parm (vtt_parm_identifier, vtt_parm_type);
205
206 /* First add it to DECL_ARGUMENTS between 'this' and the real args... */
207 TREE_CHAIN (parm) = parms;
208 parms = parm;
209
210 /* ...and then to TYPE_ARG_TYPES. */
211 arg_types = hash_tree_chain (vtt_parm_type, arg_types);
212
213 DECL_HAS_VTT_PARM_P (fn) = 1;
214 }
215
216 /* Then add the in-charge parm (before the VTT parm). */
217 parm = build_artificial_parm (in_charge_identifier, integer_type_node);
218 TREE_CHAIN (parm) = parms;
219 parms = parm;
220 arg_types = hash_tree_chain (integer_type_node, arg_types);
221
222 /* Insert our new parameter(s) into the list. */
223 TREE_CHAIN (DECL_ARGUMENTS (fn)) = parms;
224
225 /* And rebuild the function type. */
226 fntype = build_method_type_directly (basetype, TREE_TYPE (TREE_TYPE (fn)),
227 arg_types);
228 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
229 fntype = build_exception_variant (fntype,
230 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
231 TREE_TYPE (fn) = fntype;
232
233 /* Now we've got the in-charge parameter. */
234 DECL_HAS_IN_CHARGE_PARM_P (fn) = 1;
235}
236
237/* Classes overload their constituent function names automatically.
238 When a function name is declared in a record structure,
239 its name is changed to it overloaded name. Since names for
240 constructors and destructors can conflict, we place a leading
241 '$' for destructors.
242
243 CNAME is the name of the class we are grokking for.
244
245 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
246
247 FLAGS contains bits saying what's special about today's
248 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
249
250 If FUNCTION is a destructor, then we must add the `auto-delete' field
251 as a second parameter. There is some hair associated with the fact
252 that we must "declare" this variable in the manner consistent with the
253 way the rest of the arguments were declared.
254
255 QUALS are the qualifiers for the this pointer. */
256
257void
258grokclassfn (tree ctype, tree function, enum overload_flags flags)
259{
260 tree fn_name = DECL_NAME (function);
261
262 /* Even within an `extern "C"' block, members get C++ linkage. See
263 [dcl.link] for details. */
264 SET_DECL_LANGUAGE (function, lang_cplusplus);
265
266 if (fn_name == NULL_TREE)
267 {
268 error ("name missing for member function");
269 fn_name = get_identifier ("<anonymous>");
270 DECL_NAME (function) = fn_name;
271 }
272
273 DECL_CONTEXT (function) = ctype;
274
275 if (flags == DTOR_FLAG)
276 DECL_DESTRUCTOR_P (function) = 1;
277
278 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
279 maybe_retrofit_in_chrg (function);
280}
281
282/* Create an ARRAY_REF, checking for the user doing things backwards
283 along the way. */
284
285tree
286grok_array_decl (tree array_expr, tree index_exp)
287{
288 tree type;
289 tree expr;
290 tree orig_array_expr = array_expr;
291 tree orig_index_exp = index_exp;
292
293 if (error_operand_p (array_expr) || error_operand_p (index_exp))
294 return error_mark_node;
295
296 if (processing_template_decl)
297 {
298 if (type_dependent_expression_p (array_expr)
299 || type_dependent_expression_p (index_exp))
300 return build_min_nt (ARRAY_REF, array_expr, index_exp,
301 NULL_TREE, NULL_TREE);
302 array_expr = build_non_dependent_expr (array_expr);
303 index_exp = build_non_dependent_expr (index_exp);
304 }
305
306 type = TREE_TYPE (array_expr);
307 gcc_assert (type);
308 type = non_reference (type);
309
310 /* If they have an `operator[]', use that. */
311 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
312 expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL,
313 array_expr, index_exp, NULL_TREE,
314 /*overloaded_p=*/NULL);
315 else
316 {
317 tree p1, p2, i1, i2;
318
319 /* Otherwise, create an ARRAY_REF for a pointer or array type.
320 It is a little-known fact that, if `a' is an array and `i' is
321 an int, you can write `i[a]', which means the same thing as
322 `a[i]'. */
323 if (TREE_CODE (type) == ARRAY_TYPE)
324 p1 = array_expr;
325 else
326 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, false);
327
328 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
329 p2 = index_exp;
330 else
331 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, false);
332
333 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr,
334 false);
335 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp,
336 false);
337
338 if ((p1 && i2) && (i1 && p2))
339 error ("ambiguous conversion for array subscript");
340
341 if (p1 && i2)
342 array_expr = p1, index_exp = i2;
343 else if (i1 && p2)
344 array_expr = p2, index_exp = i1;
345 else
346 {
347 error ("invalid types %<%T[%T]%> for array subscript",
348 type, TREE_TYPE (index_exp));
349 return error_mark_node;
350 }
351
352 if (array_expr == error_mark_node || index_exp == error_mark_node)
353 error ("ambiguous conversion for array subscript");
354
355 expr = build_array_ref (array_expr, index_exp);
356 }
357 if (processing_template_decl && expr != error_mark_node)
358 return build_min_non_dep (ARRAY_REF, expr, orig_array_expr, orig_index_exp,
359 NULL_TREE, NULL_TREE);
360 return expr;
361}
362
363/* Given the cast expression EXP, checking out its validity. Either return
364 an error_mark_node if there was an unavoidable error, return a cast to
365 void for trying to delete a pointer w/ the value 0, or return the
366 call to delete. If DOING_VEC is true, we handle things differently
367 for doing an array delete.
368 Implements ARM $5.3.4. This is called from the parser. */
369
370tree
371delete_sanity (tree exp, tree size, bool doing_vec, int use_global_delete)
372{
373 tree t, type;
374
375 if (exp == error_mark_node)
376 return exp;
377
378 if (processing_template_decl)
379 {
380 t = build_min (DELETE_EXPR, void_type_node, exp, size);
381 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
382 DELETE_EXPR_USE_VEC (t) = doing_vec;
383 TREE_SIDE_EFFECTS (t) = 1;
384 return t;
385 }
386
387 /* An array can't have been allocated by new, so complain. */
388 if (TREE_CODE (exp) == VAR_DECL
389 && TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
390 warning (0, "deleting array %q#D", exp);
391
392 t = build_expr_type_conversion (WANT_POINTER, exp, true);
393
394 if (t == NULL_TREE || t == error_mark_node)
395 {
396 error ("type %q#T argument given to %<delete%>, expected pointer",
397 TREE_TYPE (exp));
398 return error_mark_node;
399 }
400
401 type = TREE_TYPE (t);
402
403 /* As of Valley Forge, you can delete a pointer to const. */
404
405 /* You can't delete functions. */
406 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
407 {
408 error ("cannot delete a function. Only pointer-to-objects are "
409 "valid arguments to %<delete%>");
410 return error_mark_node;
411 }
412
413 /* Deleting ptr to void is undefined behavior [expr.delete/3]. */
414 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
415 {
416 warning (0, "deleting %qT is undefined", type);
417 doing_vec = 0;
418 }
419
420 /* Deleting a pointer with the value zero is valid and has no effect. */
421 if (integer_zerop (t))
422 return build1 (NOP_EXPR, void_type_node, t);
423
424 if (doing_vec)
425 return build_vec_delete (t, /*maxindex=*/NULL_TREE,
426 sfk_deleting_destructor,
427 use_global_delete);
428 else
429 return build_delete (type, t, sfk_deleting_destructor,
430 LOOKUP_NORMAL, use_global_delete);
431}
432
433/* Report an error if the indicated template declaration is not the
434 sort of thing that should be a member template. */
435
436void
437check_member_template (tree tmpl)
438{
439 tree decl;
440
441 gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
442 decl = DECL_TEMPLATE_RESULT (tmpl);
443
444 if (TREE_CODE (decl) == FUNCTION_DECL
445 || (TREE_CODE (decl) == TYPE_DECL
446 && IS_AGGR_TYPE (TREE_TYPE (decl))))
447 {
448 /* The parser rejects template declarations in local classes. */
449 gcc_assert (!current_function_decl);
450 /* The parser rejects any use of virtual in a function template. */
451 gcc_assert (!(TREE_CODE (decl) == FUNCTION_DECL
452 && DECL_VIRTUAL_P (decl)));
453
454 /* The debug-information generating code doesn't know what to do
455 with member templates. */
456 DECL_IGNORED_P (tmpl) = 1;
457 }
458 else
459 error ("template declaration of %q#D", decl);
460}
461
462/* Return true iff TYPE is a valid Java parameter or return type. */
463
464static bool
465acceptable_java_type (tree type)
466{
467 if (type == error_mark_node)
468 return false;
469
470 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
471 return true;
472 if (TREE_CODE (type) == POINTER_TYPE || TREE_CODE (type) == REFERENCE_TYPE)
473 {
474 type = TREE_TYPE (type);
475 if (TREE_CODE (type) == RECORD_TYPE)
476 {
477 tree args; int i;
478 if (! TYPE_FOR_JAVA (type))
479 return false;
480 if (! CLASSTYPE_TEMPLATE_INFO (type))
481 return true;
482 args = CLASSTYPE_TI_ARGS (type);
483 i = TREE_VEC_LENGTH (args);
484 while (--i >= 0)
485 {
486 type = TREE_VEC_ELT (args, i);
487 if (TREE_CODE (type) == POINTER_TYPE)
488 type = TREE_TYPE (type);
489 if (! TYPE_FOR_JAVA (type))
490 return false;
491 }
492 return true;
493 }
494 }
495 return false;
496}
497
498/* For a METHOD in a Java class CTYPE, return true if
499 the parameter and return types are valid Java types.
500 Otherwise, print appropriate error messages, and return false. */
501
502bool
503check_java_method (tree method)
504{
505 bool jerr = false;
506 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
507 tree ret_type = TREE_TYPE (TREE_TYPE (method));
508
509 if (!acceptable_java_type (ret_type))
510 {
511 error ("Java method %qD has non-Java return type %qT",
512 method, ret_type);
513 jerr = true;
514 }
515
516 arg_types = TREE_CHAIN (arg_types);
517 if (DECL_HAS_IN_CHARGE_PARM_P (method))
518 arg_types = TREE_CHAIN (arg_types);
519 if (DECL_HAS_VTT_PARM_P (method))
520 arg_types = TREE_CHAIN (arg_types);
521
522 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
523 {
524 tree type = TREE_VALUE (arg_types);
525 if (!acceptable_java_type (type))
526 {
527 if (type != error_mark_node)
528 error ("Java method %qD has non-Java parameter type %qT",
529 method, type);
530 jerr = true;
531 }
532 }
533 return !jerr;
534}
535
536/* Sanity check: report error if this function FUNCTION is not
537 really a member of the class (CTYPE) it is supposed to belong to.
538 TEMPLATE_PARMS is used to specify the template parameters of a member
539 template passed as FUNCTION_DECL. If the member template is passed as a
540 TEMPLATE_DECL, it can be NULL since the parameters can be extracted
541 from the declaration. If the function is not a function template, it
542 must be NULL.
543 It returns the original declaration for the function, or NULL_TREE
544 if no declaration was found (and an error was emitted). */
545
546tree
547check_classfn (tree ctype, tree function, tree template_parms)
548{
549 int ix;
550 bool is_template;
551 tree pushed_scope;
552
553 if (DECL_USE_TEMPLATE (function)
554 && !(TREE_CODE (function) == TEMPLATE_DECL
555 && DECL_TEMPLATE_SPECIALIZATION (function))
556 && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (function)))
557 /* Since this is a specialization of a member template,
558 we're not going to find the declaration in the class.
559 For example, in:
560
561 struct S { template <typename T> void f(T); };
562 template <> void S::f(int);
563
564 we're not going to find `S::f(int)', but there's no
565 reason we should, either. We let our callers know we didn't
566 find the method, but we don't complain. */
567 return NULL_TREE;
568
569 /* Basic sanity check: for a template function, the template parameters
570 either were not passed, or they are the same of DECL_TEMPLATE_PARMS. */
571 if (TREE_CODE (function) == TEMPLATE_DECL)
572 {
573 gcc_assert (!template_parms
574 || comp_template_parms (template_parms,
575 DECL_TEMPLATE_PARMS (function)));
576 template_parms = DECL_TEMPLATE_PARMS (function);
577 }
578
579 /* OK, is this a definition of a member template? */
580 is_template = (template_parms != NULL_TREE);
581
582 /* We must enter the scope here, because conversion operators are
583 named by target type, and type equivalence relies on typenames
584 resolving within the scope of CTYPE. */
585 pushed_scope = push_scope (ctype);
586 ix = class_method_index_for_fn (complete_type (ctype), function);
587 if (ix >= 0)
588 {
589 VEC(tree,gc) *methods = CLASSTYPE_METHOD_VEC (ctype);
590 tree fndecls, fndecl = 0;
591 bool is_conv_op;
592 const char *format = NULL;
593
594 for (fndecls = VEC_index (tree, methods, ix);
595 fndecls; fndecls = OVL_NEXT (fndecls))
596 {
597 tree p1, p2;
598
599 fndecl = OVL_CURRENT (fndecls);
600 p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
601 p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
602
603 /* We cannot simply call decls_match because this doesn't
604 work for static member functions that are pretending to
605 be methods, and because the name may have been changed by
606 asm("new_name"). */
607
608 /* Get rid of the this parameter on functions that become
609 static. */
610 if (DECL_STATIC_FUNCTION_P (fndecl)
611 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
612 p1 = TREE_CHAIN (p1);
613
614 /* A member template definition only matches a member template
615 declaration. */
616 if (is_template != (TREE_CODE (fndecl) == TEMPLATE_DECL))
617 continue;
618
619 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
620 TREE_TYPE (TREE_TYPE (fndecl)))
621 && compparms (p1, p2)
622 && (!is_template
623 || comp_template_parms (template_parms,
624 DECL_TEMPLATE_PARMS (fndecl)))
625 && (DECL_TEMPLATE_SPECIALIZATION (function)
626 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
627 && (!DECL_TEMPLATE_SPECIALIZATION (function)
628 || (DECL_TI_TEMPLATE (function)
629 == DECL_TI_TEMPLATE (fndecl))))
630 break;
631 }
632 if (fndecls)
633 {
634 if (pushed_scope)
635 pop_scope (pushed_scope);
636 return OVL_CURRENT (fndecls);
637 }
638
639 error ("prototype for %q#D does not match any in class %qT",
640 function, ctype);
641 is_conv_op = DECL_CONV_FN_P (fndecl);
642
643 if (is_conv_op)
644 ix = CLASSTYPE_FIRST_CONVERSION_SLOT;
645 fndecls = VEC_index (tree, methods, ix);
646 while (fndecls)
647 {
648 fndecl = OVL_CURRENT (fndecls);
649 fndecls = OVL_NEXT (fndecls);
650
651 if (!fndecls && is_conv_op)
652 {
653 if (VEC_length (tree, methods) > (size_t) ++ix)
654 {
655 fndecls = VEC_index (tree, methods, ix);
656 if (!DECL_CONV_FN_P (OVL_CURRENT (fndecls)))
657 {
658 fndecls = NULL_TREE;
659 is_conv_op = false;
660 }
661 }
662 else
663 is_conv_op = false;
664 }
665 if (format)
666 format = " %+#D";
667 else if (fndecls)
668 format = N_("candidates are: %+#D");
669 else
670 format = N_("candidate is: %+#D");
671 error (format, fndecl);
672 }
673 }
674 else if (!COMPLETE_TYPE_P (ctype))
675 cxx_incomplete_type_error (function, ctype);
676 else
677 error ("no %q#D member function declared in class %qT",
678 function, ctype);
679
680 /* If we did not find the method in the class, add it to avoid
681 spurious errors (unless the CTYPE is not yet defined, in which
682 case we'll only confuse ourselves when the function is declared
683 properly within the class. */
684 if (COMPLETE_TYPE_P (ctype))
685 add_method (ctype, function, NULL_TREE);
686
687 if (pushed_scope)
688 pop_scope (pushed_scope);
689 return NULL_TREE;
690}
691
692/* DECL is a function with vague linkage. Remember it so that at the
693 end of the translation unit we can decide whether or not to emit
694 it. */
695
696void
697note_vague_linkage_fn (tree decl)
698{
699 if (!DECL_DEFERRED_FN (decl))
700 {
701 DECL_DEFERRED_FN (decl) = 1;
702 DECL_DEFER_OUTPUT (decl) = 1;
703 VEC_safe_push (tree, gc, deferred_fns, decl);
704 }
705}
706
707/* We have just processed the DECL, which is a static data member.
708 The other parameters are as for cp_finish_decl. */
709
710void
711finish_static_data_member_decl (tree decl,
712 tree init, bool init_const_expr_p,
713 tree asmspec_tree,
714 int flags)
715{
716 DECL_CONTEXT (decl) = current_class_type;
717
718 /* We cannot call pushdecl here, because that would fill in the
719 TREE_CHAIN of our decl. Instead, we modify cp_finish_decl to do
720 the right thing, namely, to put this decl out straight away. */
721
722 if (! processing_template_decl)
723 VEC_safe_push (tree, gc, pending_statics, decl);
724
725 if (LOCAL_CLASS_P (current_class_type))
726 pedwarn ("local class %q#T shall not have static data member %q#D",
727 current_class_type, decl);
728
729 /* Static consts need not be initialized in the class definition. */
730 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
731 {
732 static int explained = 0;
733
734 error ("initializer invalid for static member with constructor");
735 if (!explained)
736 {
737 error ("(an out of class initialization is required)");
738 explained = 1;
739 }
740 init = NULL_TREE;
741 }
742 /* Force the compiler to know when an uninitialized static const
743 member is being used. */
744 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
745 TREE_USED (decl) = 1;
746 DECL_INITIAL (decl) = init;
747 DECL_IN_AGGR_P (decl) = 1;
748
749 cp_finish_decl (decl, init, init_const_expr_p, asmspec_tree, flags);
750}
751
752/* DECLARATOR and DECLSPECS correspond to a class member. The other
753 parameters are as for cp_finish_decl. Return the DECL for the
754 class member declared. */
755
756tree
757grokfield (const cp_declarator *declarator,
758 cp_decl_specifier_seq *declspecs,
759 tree init, bool init_const_expr_p,
760 tree asmspec_tree,
761 tree attrlist)
762{
763 tree value;
764 const char *asmspec = 0;
765 int flags = LOOKUP_ONLYCONVERTING;
766
767 if (init
768 && TREE_CODE (init) == TREE_LIST
769 && TREE_VALUE (init) == error_mark_node
770 && TREE_CHAIN (init) == NULL_TREE)
771 init = NULL_TREE;
772
773 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist);
774 if (! value || error_operand_p (value))
775 /* friend or constructor went bad. */
776 return error_mark_node;
777
778 if (TREE_CODE (value) == TYPE_DECL && init)
779 {
780 error ("typedef %qD is initialized (use __typeof__ instead)", value);
781 init = NULL_TREE;
782 }
783
784 /* Pass friendly classes back. */
785 if (value == void_type_node)
786 return value;
787
788 /* Pass friend decls back. */
789 if ((TREE_CODE (value) == FUNCTION_DECL
790 || TREE_CODE (value) == TEMPLATE_DECL)
791 && DECL_CONTEXT (value) != current_class_type)
792 return value;
793
794 if (DECL_NAME (value) != NULL_TREE
795 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
796 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
797 error ("member %qD conflicts with virtual function table field name",
798 value);
799
800 /* Stash away type declarations. */
801 if (TREE_CODE (value) == TYPE_DECL)
802 {
803 DECL_NONLOCAL (value) = 1;
804 DECL_CONTEXT (value) = current_class_type;
805
806 if (processing_template_decl)
807 value = push_template_decl (value);
808
809 if (attrlist)
810 {
811 /* Avoid storing attributes in template parameters:
812 tsubst is not ready to handle them. */
813 tree type = TREE_TYPE (value);
814 if (TREE_CODE (type) == TEMPLATE_TYPE_PARM
815 || TREE_CODE (type) == BOUND_TEMPLATE_TEMPLATE_PARM)
816 sorry ("applying attributes to template parameters is not implemented");
817 else
818 cplus_decl_attributes (&value, attrlist, 0);
819 }
820
821 return value;
822 }
823
824 if (DECL_IN_AGGR_P (value))
825 {
826 error ("%qD is already defined in %qT", value, DECL_CONTEXT (value));
827 return void_type_node;
828 }
829
830 if (asmspec_tree && asmspec_tree != error_mark_node)
831 asmspec = TREE_STRING_POINTER (asmspec_tree);
832
833 if (init)
834 {
835 if (TREE_CODE (value) == FUNCTION_DECL)
836 {
837 /* Initializers for functions are rejected early in the parser.
838 If we get here, it must be a pure specifier for a method. */
839 if (TREE_CODE (TREE_TYPE (value)) == METHOD_TYPE)
840 {
841 gcc_assert (error_operand_p (init) || integer_zerop (init));
842 DECL_PURE_VIRTUAL_P (value) = 1;
843 }
844 else
845 {
846 gcc_assert (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE);
847 error ("initializer specified for static member function %qD",
848 value);
849 }
850 }
851 else if (pedantic && TREE_CODE (value) != VAR_DECL)
852 /* Already complained in grokdeclarator. */
853 init = NULL_TREE;
854 else if (!processing_template_decl)
855 {
856 if (TREE_CODE (init) == CONSTRUCTOR)
857 init = digest_init (TREE_TYPE (value), init);
858 else
859 init = integral_constant_value (init);
860
861 if (init != error_mark_node && !TREE_CONSTANT (init))
862 {
863 /* We can allow references to things that are effectively
864 static, since references are initialized with the
865 address. */
866 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
867 || (TREE_STATIC (init) == 0
868 && (!DECL_P (init) || DECL_EXTERNAL (init) == 0)))
869 {
870 error ("field initializer is not constant");
871 init = error_mark_node;
872 }
873 }
874 }
875 }
876
877 if (processing_template_decl
878 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
879 {
880 value = push_template_decl (value);
881 if (error_operand_p (value))
882 return error_mark_node;
883 }
884
885 if (attrlist)
886 cplus_decl_attributes (&value, attrlist, 0);
887
888 switch (TREE_CODE (value))
889 {
890 case VAR_DECL:
891 finish_static_data_member_decl (value, init, init_const_expr_p,
892 asmspec_tree, flags);
893 return value;
894
895 case FIELD_DECL:
896 if (asmspec)
897 error ("%<asm%> specifiers are not permitted on non-static data members");
898 if (DECL_INITIAL (value) == error_mark_node)
899 init = error_mark_node;
900 cp_finish_decl (value, init, /*init_const_expr_p=*/false,
901 NULL_TREE, flags);
902 DECL_INITIAL (value) = init;
903 DECL_IN_AGGR_P (value) = 1;
904 return value;
905
906 case FUNCTION_DECL:
907 if (asmspec)
908 set_user_assembler_name (value, asmspec);
909
910 cp_finish_decl (value,
911 /*init=*/NULL_TREE,
912 /*init_const_expr_p=*/false,
913 asmspec_tree, flags);
914
915 /* Pass friends back this way. */
916 if (DECL_FRIEND_P (value))
917 return void_type_node;
918
919 DECL_IN_AGGR_P (value) = 1;
920 return value;
921
922 default:
923 gcc_unreachable ();
924 }
925 return NULL_TREE;
926}
927
928/* Like `grokfield', but for bitfields.
929 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
930
931tree
932grokbitfield (const cp_declarator *declarator,
933 cp_decl_specifier_seq *declspecs, tree width)
934{
935 tree value = grokdeclarator (declarator, declspecs, BITFIELD, 0, NULL);
936
937 if (value == error_mark_node)
938 return NULL_TREE; /* friends went bad. */
939
940 /* Pass friendly classes back. */
941 if (TREE_CODE (value) == VOID_TYPE)
942 return void_type_node;
943
944 if (!INTEGRAL_TYPE_P (TREE_TYPE (value))
945 && (POINTER_TYPE_P (value)
946 || !dependent_type_p (TREE_TYPE (value))))
947 {
948 error ("bit-field %qD with non-integral type", value);
949 return error_mark_node;
950 }
951
952 if (TREE_CODE (value) == TYPE_DECL)
953 {
954 error ("cannot declare %qD to be a bit-field type", value);
955 return NULL_TREE;
956 }
957
958 /* Usually, finish_struct_1 catches bitfields with invalid types.
959 But, in the case of bitfields with function type, we confuse
960 ourselves into thinking they are member functions, so we must
961 check here. */
962 if (TREE_CODE (value) == FUNCTION_DECL)
963 {
964 error ("cannot declare bit-field %qD with function type",
965 DECL_NAME (value));
966 return NULL_TREE;
967 }
968
969 if (DECL_IN_AGGR_P (value))
970 {
971 error ("%qD is already defined in the class %qT", value,
972 DECL_CONTEXT (value));
973 return void_type_node;
974 }
975
976 if (TREE_STATIC (value))
977 {
978 error ("static member %qD cannot be a bit-field", value);
979 return NULL_TREE;
980 }
981 finish_decl (value, NULL_TREE, NULL_TREE);
982
983 if (width != error_mark_node)
984 {
985 constant_expression_warning (width);
986 DECL_INITIAL (value) = width;
987 SET_DECL_C_BIT_FIELD (value);
988 }
989
990 DECL_IN_AGGR_P (value) = 1;
991 return value;
992}
993
994
995void
996cplus_decl_attributes (tree *decl, tree attributes, int flags)
997{
998 if (*decl == NULL_TREE || *decl == void_type_node
999 || *decl == error_mark_node)
1000 return;
1001
1002 if (TREE_CODE (*decl) == TEMPLATE_DECL)
1003 decl = &DECL_TEMPLATE_RESULT (*decl);
1004
1005 decl_attributes (decl, attributes, flags);
1006
1007 if (TREE_CODE (*decl) == TYPE_DECL)
1008 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl));
1009}
1010
1011/* Walks through the namespace- or function-scope anonymous union
1012 OBJECT, with the indicated TYPE, building appropriate VAR_DECLs.
1013 Returns one of the fields for use in the mangled name. */
1014
1015static tree
1016build_anon_union_vars (tree type, tree object)
1017{
1018 tree main_decl = NULL_TREE;
1019 tree field;
1020
1021 /* Rather than write the code to handle the non-union case,
1022 just give an error. */
1023 if (TREE_CODE (type) != UNION_TYPE)
1024 error ("anonymous struct not inside named type");
1025
1026 for (field = TYPE_FIELDS (type);
1027 field != NULL_TREE;
1028 field = TREE_CHAIN (field))
1029 {
1030 tree decl;
1031 tree ref;
1032
1033 if (DECL_ARTIFICIAL (field))
1034 continue;
1035 if (TREE_CODE (field) != FIELD_DECL)
1036 {
1037 pedwarn ("%q+#D invalid; an anonymous union can only "
1038 "have non-static data members", field);
1039 continue;
1040 }
1041
1042 if (TREE_PRIVATE (field))
1043 pedwarn ("private member %q+#D in anonymous union", field);
1044 else if (TREE_PROTECTED (field))
1045 pedwarn ("protected member %q+#D in anonymous union", field);
1046
1047 if (processing_template_decl)
1048 ref = build_min_nt (COMPONENT_REF, object,
1049 DECL_NAME (field), NULL_TREE);
1050 else
1051 ref = build_class_member_access_expr (object, field, NULL_TREE,
1052 false);
1053
1054 if (DECL_NAME (field))
1055 {
1056 tree base;
1057
1058 decl = build_decl (VAR_DECL, DECL_NAME (field), TREE_TYPE (field));
1059 DECL_ANON_UNION_VAR_P (decl) = 1;
1060
1061 base = get_base_address (object);
1062 TREE_PUBLIC (decl) = TREE_PUBLIC (base);
1063 TREE_STATIC (decl) = TREE_STATIC (base);
1064 DECL_EXTERNAL (decl) = DECL_EXTERNAL (base);
1065
1066 SET_DECL_VALUE_EXPR (decl, ref);
1067 DECL_HAS_VALUE_EXPR_P (decl) = 1;
1068
1069 decl = pushdecl (decl);
1070 }
1071 else if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1072 decl = build_anon_union_vars (TREE_TYPE (field), ref);
1073 else
1074 decl = 0;
1075
1076 if (main_decl == NULL_TREE)
1077 main_decl = decl;
1078 }
1079
1080 return main_decl;
1081}
1082
1083/* Finish off the processing of a UNION_TYPE structure. If the union is an
1084 anonymous union, then all members must be laid out together. PUBLIC_P
1085 is nonzero if this union is not declared static. */
1086
1087void
1088finish_anon_union (tree anon_union_decl)
1089{
1090 tree type;
1091 tree main_decl;
1092 bool public_p;
1093
1094 if (anon_union_decl == error_mark_node)
1095 return;
1096
1097 type = TREE_TYPE (anon_union_decl);
1098 public_p = TREE_PUBLIC (anon_union_decl);
1099
1100 /* The VAR_DECL's context is the same as the TYPE's context. */
1101 DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type));
1102
1103 if (TYPE_FIELDS (type) == NULL_TREE)
1104 return;
1105
1106 if (public_p)
1107 {
1108 error ("namespace-scope anonymous aggregates must be static");
1109 return;
1110 }
1111
1112 main_decl = build_anon_union_vars (type, anon_union_decl);
1113 if (main_decl == error_mark_node)
1114 return;
1115 if (main_decl == NULL_TREE)
1116 {
1117 warning (0, "anonymous union with no members");
1118 return;
1119 }
1120
1121 if (!processing_template_decl)
1122 {
1123 /* Use main_decl to set the mangled name. */
1124 DECL_NAME (anon_union_decl) = DECL_NAME (main_decl);
1125 mangle_decl (anon_union_decl);
1126 DECL_NAME (anon_union_decl) = NULL_TREE;
1127 }
1128
1129 pushdecl (anon_union_decl);
1130 if (building_stmt_tree ()
1131 && at_function_scope_p ())
1132 add_decl_expr (anon_union_decl);
1133 else if (!processing_template_decl)
1134 rest_of_decl_compilation (anon_union_decl,
1135 toplevel_bindings_p (), at_eof);
1136}
1137
1138/* Auxiliary functions to make type signatures for
1139 `operator new' and `operator delete' correspond to
1140 what compiler will be expecting. */
1141
1142tree
1143coerce_new_type (tree type)
1144{
1145 int e = 0;
1146 tree args = TYPE_ARG_TYPES (type);
1147
1148 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
1149
1150 if (!same_type_p (TREE_TYPE (type), ptr_type_node))
1151 {
1152 e = 1;
1153 error ("%<operator new%> must return type %qT", ptr_type_node);
1154 }
1155
1156 if (!args || args == void_list_node
1157 || !same_type_p (TREE_VALUE (args), size_type_node))
1158 {
1159 e = 2;
1160 if (args && args != void_list_node)
1161 args = TREE_CHAIN (args);
1162 pedwarn ("%<operator new%> takes type %<size_t%> (%qT) "
1163 "as first parameter", size_type_node);
1164 }
1165 switch (e)
1166 {
1167 case 2:
1168 args = tree_cons (NULL_TREE, size_type_node, args);
1169 /* Fall through. */
1170 case 1:
1171 type = build_exception_variant
1172 (build_function_type (ptr_type_node, args),
1173 TYPE_RAISES_EXCEPTIONS (type));
1174 /* Fall through. */
1175 default:;
1176 }
1177 return type;
1178}
1179
1180tree
1181coerce_delete_type (tree type)
1182{
1183 int e = 0;
1184 tree args = TYPE_ARG_TYPES (type);
1185
1186 gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
1187
1188 if (!same_type_p (TREE_TYPE (type), void_type_node))
1189 {
1190 e = 1;
1191 error ("%<operator delete%> must return type %qT", void_type_node);
1192 }
1193
1194 if (!args || args == void_list_node
1195 || !same_type_p (TREE_VALUE (args), ptr_type_node))
1196 {
1197 e = 2;
1198 if (args && args != void_list_node)
1199 args = TREE_CHAIN (args);
1200 error ("%<operator delete%> takes type %qT as first parameter",
1201 ptr_type_node);
1202 }
1203 switch (e)
1204 {
1205 case 2:
1206 args = tree_cons (NULL_TREE, ptr_type_node, args);
1207 /* Fall through. */
1208 case 1:
1209 type = build_exception_variant
1210 (build_function_type (void_type_node, args),
1211 TYPE_RAISES_EXCEPTIONS (type));
1212 /* Fall through. */
1213 default:;
1214 }
1215
1216 return type;
1217}
1218
1219static void
1220mark_vtable_entries (tree decl)
1221{
1222 tree fnaddr;
1223 unsigned HOST_WIDE_INT idx;
1224
1225 FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)),
1226 idx, fnaddr)
1227 {
1228 tree fn;
1229
1230 STRIP_NOPS (fnaddr);
1231
1232 if (TREE_CODE (fnaddr) != ADDR_EXPR
1233 && TREE_CODE (fnaddr) != FDESC_EXPR)
1234 /* This entry is an offset: a virtual base class offset, a
1235 virtual call offset, an RTTI offset, etc. */
1236 continue;
1237
1238 fn = TREE_OPERAND (fnaddr, 0);
1239 TREE_ADDRESSABLE (fn) = 1;
1240 /* When we don't have vcall offsets, we output thunks whenever
1241 we output the vtables that contain them. With vcall offsets,
1242 we know all the thunks we'll need when we emit a virtual
1243 function, so we emit the thunks there instead. */
1244 if (DECL_THUNK_P (fn))
1245 use_thunk (fn, /*emit_p=*/0);
1246 mark_used (fn);
1247 }
1248}
1249
1250/* Set DECL up to have the closest approximation of "initialized common"
1251 linkage available. */
1252
1253void
1254comdat_linkage (tree decl)
1255{
1256 if (flag_weak)
1257 make_decl_one_only (decl);
1258 else if (TREE_CODE (decl) == FUNCTION_DECL
1259 || (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)))
1260 /* We can just emit function and compiler-generated variables
1261 statically; having multiple copies is (for the most part) only
1262 a waste of space.
1263
1264 There are two correctness issues, however: the address of a
1265 template instantiation with external linkage should be the
1266 same, independent of what translation unit asks for the
1267 address, and this will not hold when we emit multiple copies of
1268 the function. However, there's little else we can do.
1269
1270 Also, by default, the typeinfo implementation assumes that
1271 there will be only one copy of the string used as the name for
1272 each type. Therefore, if weak symbols are unavailable, the
1273 run-time library should perform a more conservative check; it
1274 should perform a string comparison, rather than an address
1275 comparison. */
1276 TREE_PUBLIC (decl) = 0;
1277 else
1278 {
1279 /* Static data member template instantiations, however, cannot
1280 have multiple copies. */
1281 if (DECL_INITIAL (decl) == 0
1282 || DECL_INITIAL (decl) == error_mark_node)
1283 DECL_COMMON (decl) = 1;
1284 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
1285 {
1286 DECL_COMMON (decl) = 1;
1287 DECL_INITIAL (decl) = error_mark_node;
1288 }
1289 else if (!DECL_EXPLICIT_INSTANTIATION (decl))
1290 {
1291 /* We can't do anything useful; leave vars for explicit
1292 instantiation. */
1293 DECL_EXTERNAL (decl) = 1;
1294 DECL_NOT_REALLY_EXTERN (decl) = 0;
1295 }
1296 }
1297
1298 if (DECL_LANG_SPECIFIC (decl))
1299 DECL_COMDAT (decl) = 1;
1300}
1301
1302/* For win32 we also want to put explicit instantiations in
1303 linkonce sections, so that they will be merged with implicit
1304 instantiations; otherwise we get duplicate symbol errors.
1305 For Darwin we do not want explicit instantiations to be
1306 linkonce. */
1307
1308void
1309maybe_make_one_only (tree decl)
1310{
1311 /* We used to say that this was not necessary on targets that support weak
1312 symbols, because the implicit instantiations will defer to the explicit
1313 one. However, that's not actually the case in SVR4; a strong definition
1314 after a weak one is an error. Also, not making explicit
1315 instantiations one_only means that we can end up with two copies of
1316 some template instantiations. */
1317 if (! flag_weak)
1318 return;
1319
1320 /* We can't set DECL_COMDAT on functions, or cp_finish_file will think
1321 we can get away with not emitting them if they aren't used. We need
1322 to for variables so that cp_finish_decl will update their linkage,
1323 because their DECL_INITIAL may not have been set properly yet. */
1324
1325 if (!TARGET_WEAK_NOT_IN_ARCHIVE_TOC
1326 || (! DECL_EXPLICIT_INSTANTIATION (decl)
1327 && ! DECL_TEMPLATE_SPECIALIZATION (decl)))
1328 {
1329 make_decl_one_only (decl);
1330
1331 if (TREE_CODE (decl) == VAR_DECL)
1332 {
1333 DECL_COMDAT (decl) = 1;
1334 /* Mark it needed so we don't forget to emit it. */
1335 mark_decl_referenced (decl);
1336 }
1337 }
1338}
1339
1340/* Determine whether or not we want to specifically import or export CTYPE,
1341 using various heuristics. */
1342
1343static void
1344import_export_class (tree ctype)
1345{
1346 /* -1 for imported, 1 for exported. */
1347 int import_export = 0;
1348
1349 /* It only makes sense to call this function at EOF. The reason is
1350 that this function looks at whether or not the first non-inline
1351 non-abstract virtual member function has been defined in this
1352 translation unit. But, we can't possibly know that until we've
1353 seen the entire translation unit. */
1354 gcc_assert (at_eof);
1355
1356 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1357 return;
1358
1359 /* If MULTIPLE_SYMBOL_SPACES is set and we saw a #pragma interface,
1360 we will have CLASSTYPE_INTERFACE_ONLY set but not
1361 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
1362 heuristic because someone will supply a #pragma implementation
1363 elsewhere, and deducing it here would produce a conflict. */
1364 if (CLASSTYPE_INTERFACE_ONLY (ctype))
1365 return;
1366
1367 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
1368 import_export = -1;
1369 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
1370 import_export = 1;
1371 else if (CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
1372 && !flag_implicit_templates)
1373 /* For a template class, without -fimplicit-templates, check the
1374 repository. If the virtual table is assigned to this
1375 translation unit, then export the class; otherwise, import
1376 it. */
1377 import_export = repo_export_class_p (ctype) ? 1 : -1;
1378 else if (TYPE_POLYMORPHIC_P (ctype))
1379 {
1380 /* The ABI specifies that the virtual table and associated
1381 information are emitted with the key method, if any. */
1382 tree method = CLASSTYPE_KEY_METHOD (ctype);
1383 /* If weak symbol support is not available, then we must be
1384 careful not to emit the vtable when the key function is
1385 inline. An inline function can be defined in multiple
1386 translation units. If we were to emit the vtable in each
1387 translation unit containing a definition, we would get
1388 multiple definition errors at link-time. */
1389 if (method && (flag_weak || ! DECL_DECLARED_INLINE_P (method)))
1390 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
1391 }
1392
1393 /* When MULTIPLE_SYMBOL_SPACES is set, we cannot count on seeing
1394 a definition anywhere else. */
1395 if (MULTIPLE_SYMBOL_SPACES && import_export == -1)
1396 import_export = 0;
1397
1398 /* Allow backends the chance to overrule the decision. */
1399 if (targetm.cxx.import_export_class)
1400 import_export = targetm.cxx.import_export_class (ctype, import_export);
1401
1402 if (import_export)
1403 {
1404 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
1405 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
1406 }
1407}
1408
1409/* Return true if VAR has already been provided to the back end; in that
1410 case VAR should not be modified further by the front end. */
1411static bool
1412var_finalized_p (tree var)
1413{
1414 return cgraph_varpool_node (var)->finalized;
1415}
1416
1417/* DECL is a VAR_DECL or FUNCTION_DECL which, for whatever reason,
1418 must be emitted in this translation unit. Mark it as such. */
1419
1420void
1421mark_needed (tree decl)
1422{
1423 /* It's possible that we no longer need to set
1424 TREE_SYMBOL_REFERENCED here directly, but doing so is
1425 harmless. */
1426 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)) = 1;
1427 mark_decl_referenced (decl);
1428}
1429
1430/* DECL is either a FUNCTION_DECL or a VAR_DECL. This function
1431 returns true if a definition of this entity should be provided in
1432 this object file. Callers use this function to determine whether
1433 or not to let the back end know that a definition of DECL is
1434 available in this translation unit. */
1435
1436bool
1437decl_needed_p (tree decl)
1438{
1439 gcc_assert (TREE_CODE (decl) == VAR_DECL
1440 || TREE_CODE (decl) == FUNCTION_DECL);
1441 /* This function should only be called at the end of the translation
1442 unit. We cannot be sure of whether or not something will be
1443 COMDAT until that point. */
1444 gcc_assert (at_eof);
1445
1446 /* All entities with external linkage that are not COMDAT should be
1447 emitted; they may be referred to from other object files. */
1448 if (TREE_PUBLIC (decl) && !DECL_COMDAT (decl))
1449 return true;
1450 /* If this entity was used, let the back-end see it; it will decide
1451 whether or not to emit it into the object file. */
1452 if (TREE_USED (decl)
1453 || (DECL_ASSEMBLER_NAME_SET_P (decl)
1454 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))))
1455 return true;
1456 /* Otherwise, DECL does not need to be emitted -- yet. A subsequent
1457 reference to DECL might cause it to be emitted later. */
1458 return false;
1459}
1460
1461/* If necessary, write out the vtables for the dynamic class CTYPE.
1462 Returns true if any vtables were emitted. */
1463
1464static bool
1465maybe_emit_vtables (tree ctype)
1466{
1467 tree vtbl;
1468 tree primary_vtbl;
1469 int needed = 0;
1470
1471 /* If the vtables for this class have already been emitted there is
1472 nothing more to do. */
1473 primary_vtbl = CLASSTYPE_VTABLES (ctype);
1474 if (var_finalized_p (primary_vtbl))
1475 return false;
1476 /* Ignore dummy vtables made by get_vtable_decl. */
1477 if (TREE_TYPE (primary_vtbl) == void_type_node)
1478 return false;
1479
1480 /* On some targets, we cannot determine the key method until the end
1481 of the translation unit -- which is when this function is
1482 called. */
1483 if (!targetm.cxx.key_method_may_be_inline ())
1484 determine_key_method (ctype);
1485
1486 /* See if any of the vtables are needed. */
1487 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1488 {
1489 import_export_decl (vtbl);
1490 if (DECL_NOT_REALLY_EXTERN (vtbl) && decl_needed_p (vtbl))
1491 needed = 1;
1492 }
1493 if (!needed)
1494 {
1495 /* If the references to this class' vtables are optimized away,
1496 still emit the appropriate debugging information. See
1497 dfs_debug_mark. */
1498 if (DECL_COMDAT (primary_vtbl)
1499 && CLASSTYPE_DEBUG_REQUESTED (ctype))
1500 note_debug_info_needed (ctype);
1501 return false;
1502 }
1503
1504 /* The ABI requires that we emit all of the vtables if we emit any
1505 of them. */
1506 for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1507 {
1508 /* Mark entities references from the virtual table as used. */
1509 mark_vtable_entries (vtbl);
1510
1511 if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0)
1512 {
1513 tree expr = store_init_value (vtbl, DECL_INITIAL (vtbl));
1514
1515 /* It had better be all done at compile-time. */
1516 gcc_assert (!expr);
1517 }
1518
1519 /* Write it out. */
1520 DECL_EXTERNAL (vtbl) = 0;
1521 rest_of_decl_compilation (vtbl, 1, 1);
1522
1523 /* Because we're only doing syntax-checking, we'll never end up
1524 actually marking the variable as written. */
1525 if (flag_syntax_only)
1526 TREE_ASM_WRITTEN (vtbl) = 1;
1527 }
1528
1529 /* Since we're writing out the vtable here, also write the debug
1530 info. */
1531 note_debug_info_needed (ctype);
1532
1533 return true;
1534}
1535
1536/* A special return value from type_visibility meaning internal
1537 linkage. */
1538
1539enum { VISIBILITY_ANON = VISIBILITY_INTERNAL+1 };
1540
1541/* walk_tree helper function for type_visibility. */
1542
1543static tree
1544min_vis_r (tree *tp, int *walk_subtrees, void *data)
1545{
1546 int *vis_p = (int *)data;
1547 if (! TYPE_P (*tp))
1548 {
1549 *walk_subtrees = 0;
1550 }
1551 else if (CLASS_TYPE_P (*tp))
1552 {
1553 if (!TREE_PUBLIC (TYPE_MAIN_DECL (*tp)))
1554 {
1555 *vis_p = VISIBILITY_ANON;
1556 return *tp;
1557 }
1558 else if (CLASSTYPE_VISIBILITY (*tp) > *vis_p)
1559 *vis_p = CLASSTYPE_VISIBILITY (*tp);
1560 }
1561 return NULL;
1562}
1563
1564/* Returns the visibility of TYPE, which is the minimum visibility of its
1565 component types. */
1566
1567static int
1568type_visibility (tree type)
1569{
1570 int vis = VISIBILITY_DEFAULT;
1571 walk_tree_without_duplicates (&type, min_vis_r, &vis);
1572 return vis;
1573}
1574
1575/* Limit the visibility of DECL to VISIBILITY, if not explicitly
1576 specified (or if VISIBILITY is static). */
1577
1578static bool
1579constrain_visibility (tree decl, int visibility)
1580{
1581 if (visibility == VISIBILITY_ANON)
1582 {
1583 /* extern "C" declarations aren't affected by the anonymous
1584 namespace. */
1585 if (!DECL_EXTERN_C_P (decl))
1586 {
1587 TREE_PUBLIC (decl) = 0;
1588 DECL_INTERFACE_KNOWN (decl) = 1;
1589 if (DECL_LANG_SPECIFIC (decl))
1590 DECL_NOT_REALLY_EXTERN (decl) = 1;
1591 }
1592 }
1593 else if (visibility > DECL_VISIBILITY (decl)
1594 && !DECL_VISIBILITY_SPECIFIED (decl))
1595 {
1596 DECL_VISIBILITY (decl) = visibility;
1597 return true;
1598 }
1599 return false;
1600}
1601
1602/* Constrain the visibility of DECL based on the visibility of its template
1603 arguments. */
1604
1605static void
1606constrain_visibility_for_template (tree decl, tree targs)
1607{
1608 /* If this is a template instantiation, check the innermost
1609 template args for visibility constraints. The outer template
1610 args are covered by the class check. */
1611 tree args = INNERMOST_TEMPLATE_ARGS (targs);
1612 int i;
1613 for (i = TREE_VEC_LENGTH (args); i > 0; --i)
1614 {
1615 int vis = 0;
1616
1617 tree arg = TREE_VEC_ELT (args, i-1);
1618 if (TYPE_P (arg))
1619 vis = type_visibility (arg);
1620 else if (TREE_TYPE (arg) && POINTER_TYPE_P (TREE_TYPE (arg)))
1621 {
1622 STRIP_NOPS (arg);
1623 if (TREE_CODE (arg) == ADDR_EXPR)
1624 arg = TREE_OPERAND (arg, 0);
1625 if (TREE_CODE (arg) == VAR_DECL
1626 || TREE_CODE (arg) == FUNCTION_DECL)
1627 {
1628 if (! TREE_PUBLIC (arg))
1629 vis = VISIBILITY_ANON;
1630 else
1631 vis = DECL_VISIBILITY (arg);
1632 }
1633 }
1634 if (vis)
1635 constrain_visibility (decl, vis);
1636 }
1637}
1638
1639/* Like c_determine_visibility, but with additional C++-specific
1640 behavior.
1641
1642 Function-scope entities can rely on the function's visibility because
1643 it is set in start_preparsed_function.
1644
1645 Class-scope entities cannot rely on the class's visibility until the end
1646 of the enclosing class definition.
1647
1648 Note that because namespaces have multiple independent definitions,
1649 namespace visibility is handled elsewhere using the #pragma visibility
1650 machinery rather than by decorating the namespace declaration.
1651
1652 The goal is for constraints from the type to give a diagnostic, and
1653 other constraints to be applied silently. */
1654
1655void
1656determine_visibility (tree decl)
1657{
1658 tree class_type = NULL_TREE;
1659 bool use_template;
1660
1661 /* Remember that all decls get VISIBILITY_DEFAULT when built. */
1662
1663 /* Only relevant for names with external linkage. */
1664 if (!TREE_PUBLIC (decl))
1665 return;
1666
1667 /* Cloned constructors and destructors get the same visibility as
1668 the underlying function. That should be set up in
1669 maybe_clone_body. */
1670 gcc_assert (!DECL_CLONED_FUNCTION_P (decl));
1671
1672 if (TREE_CODE (decl) == TYPE_DECL)
1673 {
1674 if (CLASS_TYPE_P (TREE_TYPE (decl)))
1675 use_template = CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl));
1676 else if (TYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
1677 use_template = 1;
1678 else
1679 use_template = 0;
1680 }
1681 else if (DECL_LANG_SPECIFIC (decl))
1682 use_template = DECL_USE_TEMPLATE (decl);
1683 else
1684 use_template = 0;
1685
1686 /* Anything that is exported must have default visibility. */
1687 if (TARGET_DLLIMPORT_DECL_ATTRIBUTES
1688 && lookup_attribute ("dllexport",
1689 TREE_CODE (decl) == TYPE_DECL
1690 ? TYPE_ATTRIBUTES (TREE_TYPE (decl))
1691 : DECL_ATTRIBUTES (decl)))
1692 {
1693 DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
1694 DECL_VISIBILITY_SPECIFIED (decl) = 1;
1695 }
1696
1697 /* If DECL is a member of a class, visibility specifiers on the
1698 class can influence the visibility of the DECL. */
1699 if (DECL_CLASS_SCOPE_P (decl))
1700 class_type = DECL_CONTEXT (decl);
1701 else
1702 {
1703 /* Not a class member. */
1704
1705 /* Virtual tables have DECL_CONTEXT set to their associated class,
1706 so they are automatically handled above. */
1707 gcc_assert (TREE_CODE (decl) != VAR_DECL
1708 || !DECL_VTABLE_OR_VTT_P (decl));
1709
1710 if (DECL_FUNCTION_SCOPE_P (decl) && ! DECL_VISIBILITY_SPECIFIED (decl))
1711 {
1712 /* Local statics and classes get the visibility of their
1713 containing function by default, except that
1714 -fvisibility-inlines-hidden doesn't affect them. */
1715 tree fn = DECL_CONTEXT (decl);
1716 if (DECL_VISIBILITY_SPECIFIED (fn) || ! DECL_CLASS_SCOPE_P (fn))
1717 {
1718 DECL_VISIBILITY (decl) = DECL_VISIBILITY (fn);
1719 DECL_VISIBILITY_SPECIFIED (decl) =
1720 DECL_VISIBILITY_SPECIFIED (fn);
1721 }
1722 else
1723 determine_visibility_from_class (decl, DECL_CONTEXT (fn));
1724
1725 /* Local classes in templates have CLASSTYPE_USE_TEMPLATE set,
1726 but have no TEMPLATE_INFO, so don't try to check it. */
1727 use_template = 0;
1728 }
|
1729 else if (TREE_CODE (decl) == VAR_DECL && DECL_TINFO_P (decl))
1730 {
1731 /* tinfo visibility is based on the type it's for. */
1732 constrain_visibility
1733 (decl, type_visibility (TREE_TYPE (DECL_NAME (decl))));
1734 }
1735 else if (use_template)
1736 /* Template instantiations and specializations get visibility based
1737 on their template unless they override it with an attribute. */;
1738 else if (! DECL_VISIBILITY_SPECIFIED (decl))
1739 {
1740 /* Set default visibility to whatever the user supplied with
1741 #pragma GCC visibility or a namespace visibility attribute. */
1742 DECL_VISIBILITY (decl) = default_visibility;
1743 DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
1744 }
1745 }
1746
1747 if (use_template)
1748 {
1749 /* If the specialization doesn't specify visibility, use the
1750 visibility from the template. */
1751 tree tinfo = (TREE_CODE (decl) == TYPE_DECL
1752 ? TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
1753 : DECL_TEMPLATE_INFO (decl));
1754 tree args = TI_ARGS (tinfo);
1755
1756 if (args != error_mark_node)
1757 {
1758 int depth = TMPL_ARGS_DEPTH (args);
1759 tree pattern = DECL_TEMPLATE_RESULT (TI_TEMPLATE (tinfo));
1760
1761 if (!DECL_VISIBILITY_SPECIFIED (decl))
1762 {
1763 DECL_VISIBILITY (decl) = DECL_VISIBILITY (pattern);
1764 DECL_VISIBILITY_SPECIFIED (decl)
1765 = DECL_VISIBILITY_SPECIFIED (pattern);
1766 }
1767
1768 /* FIXME should TMPL_ARGS_DEPTH really return 1 for null input? */
1769 if (args && depth > template_class_depth (class_type))
1770 /* Limit visibility based on its template arguments. */
1771 constrain_visibility_for_template (decl, args);
1772 }
1773 }
1774
1775 if (class_type)
1776 determine_visibility_from_class (decl, class_type);
1777
1778 if (decl_anon_ns_mem_p (decl))
1779 /* Names in an anonymous namespace get internal linkage.
1780 This might change once we implement export. */
1781 constrain_visibility (decl, VISIBILITY_ANON);
1782 else if (TREE_CODE (decl) != TYPE_DECL)
1783 {
1784 /* Propagate anonymity from type to decl. */
1785 int tvis = type_visibility (TREE_TYPE (decl));
1786 if (tvis == VISIBILITY_ANON
1787 || ! DECL_VISIBILITY_SPECIFIED (decl))
1788 constrain_visibility (decl, tvis);
1789 }
1790}
1791
1792/* By default, static data members and function members receive
1793 the visibility of their containing class. */
1794
1795static void
1796determine_visibility_from_class (tree decl, tree class_type)
1797{
1798 if (visibility_options.inlines_hidden
1799 /* Don't do this for inline templates; specializations might not be
1800 inline, and we don't want them to inherit the hidden
1801 visibility. We'll set it here for all inline instantiations. */
1802 && !processing_template_decl
1803 && ! DECL_VISIBILITY_SPECIFIED (decl)
1804 && TREE_CODE (decl) == FUNCTION_DECL
1805 && DECL_DECLARED_INLINE_P (decl)
1806 && (! DECL_LANG_SPECIFIC (decl)
1807 || ! DECL_EXPLICIT_INSTANTIATION (decl)))
1808 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
1809 else if (!DECL_VISIBILITY_SPECIFIED (decl))
1810 {
1811 /* Default to the class visibility. */
1812 DECL_VISIBILITY (decl) = CLASSTYPE_VISIBILITY (class_type);
1813 DECL_VISIBILITY_SPECIFIED (decl)
1814 = CLASSTYPE_VISIBILITY_SPECIFIED (class_type);
1815 }
1816
1817 /* Give the target a chance to override the visibility associated
1818 with DECL. */
1819 if (TREE_CODE (decl) == VAR_DECL
1820 && (DECL_TINFO_P (decl)
1821 || (DECL_VTABLE_OR_VTT_P (decl)
1822 /* Construction virtual tables are not exported because
1823 they cannot be referred to from other object files;
1824 their name is not standardized by the ABI. */
1825 && !DECL_CONSTRUCTION_VTABLE_P (decl)))
1826 && TREE_PUBLIC (decl)
1827 && !DECL_REALLY_EXTERN (decl)
1828 && !DECL_VISIBILITY_SPECIFIED (decl)
1829 && !CLASSTYPE_VISIBILITY_SPECIFIED (class_type))
1830 targetm.cxx.determine_class_data_visibility (decl);
1831}
1832
1833/* Constrain the visibility of a class TYPE based on the visibility of its
1834 field types. Warn if any fields require lesser visibility. */
1835
1836void
1837constrain_class_visibility (tree type)
1838{
1839 tree binfo;
1840 tree t;
1841 int i;
1842
1843 int vis = type_visibility (type);
1844
1845 if (vis == VISIBILITY_ANON
1846 || DECL_IN_SYSTEM_HEADER (TYPE_MAIN_DECL (type)))
1847 return;
1848
1849 /* Don't warn about visibility if the class has explicit visibility. */
1850 if (CLASSTYPE_VISIBILITY_SPECIFIED (type))
1851 vis = VISIBILITY_INTERNAL;
1852
1853 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
1854 if (TREE_CODE (t) == FIELD_DECL && TREE_TYPE (t) != error_mark_node)
1855 {
1856 tree ftype = strip_array_types (TREE_TYPE (t));
1857 int subvis = type_visibility (ftype);
1858
1859 if (subvis == VISIBILITY_ANON)
1860 {
1861 if (!in_main_input_context ())
1862 warning (0, "\
1863%qT has a field %qD whose type uses the anonymous namespace",
1864 type, t);
1865 }
1866 else if (IS_AGGR_TYPE (ftype)
1867 && vis < VISIBILITY_HIDDEN
1868 && subvis >= VISIBILITY_HIDDEN)
1869 warning (OPT_Wattributes, "\
1870%qT declared with greater visibility than the type of its field %qD",
1871 type, t);
1872 }
1873
1874 binfo = TYPE_BINFO (type);
1875 for (i = 0; BINFO_BASE_ITERATE (binfo, i, t); ++i)
1876 {
1877 int subvis = type_visibility (TREE_TYPE (t));
1878
1879 if (subvis == VISIBILITY_ANON)
1880 {
1881 if (!in_main_input_context())
1882 warning (0, "\
1883%qT has a base %qT whose type uses the anonymous namespace",
1884 type, TREE_TYPE (t));
1885 }
1886 else if (vis < VISIBILITY_HIDDEN
1887 && subvis >= VISIBILITY_HIDDEN)
1888 warning (OPT_Wattributes, "\
1889%qT declared with greater visibility than its base %qT",
1890 type, TREE_TYPE (t));
1891 }
1892}
1893
1894/* DECL is a FUNCTION_DECL or VAR_DECL. If the object file linkage
1895 for DECL has not already been determined, do so now by setting
1896 DECL_EXTERNAL, DECL_COMDAT and other related flags. Until this
1897 function is called entities with vague linkage whose definitions
1898 are available must have TREE_PUBLIC set.
1899
1900 If this function decides to place DECL in COMDAT, it will set
1901 appropriate flags -- but will not clear DECL_EXTERNAL. It is up to
1902 the caller to decide whether or not to clear DECL_EXTERNAL. Some
1903 callers defer that decision until it is clear that DECL is actually
1904 required. */
1905
1906void
1907import_export_decl (tree decl)
1908{
1909 int emit_p;
1910 bool comdat_p;
1911 bool import_p;
1912 tree class_type = NULL_TREE;
1913
1914 if (DECL_INTERFACE_KNOWN (decl))
1915 return;
1916
1917 /* We cannot determine what linkage to give to an entity with vague
1918 linkage until the end of the file. For example, a virtual table
1919 for a class will be defined if and only if the key method is
1920 defined in this translation unit. As a further example, consider
1921 that when compiling a translation unit that uses PCH file with
1922 "-frepo" it would be incorrect to make decisions about what
1923 entities to emit when building the PCH; those decisions must be
1924 delayed until the repository information has been processed. */
1925 gcc_assert (at_eof);
1926 /* Object file linkage for explicit instantiations is handled in
1927 mark_decl_instantiated. For static variables in functions with
1928 vague linkage, maybe_commonize_var is used.
1929
1930 Therefore, the only declarations that should be provided to this
1931 function are those with external linkage that are:
1932
1933 * implicit instantiations of function templates
1934
1935 * inline function
1936
1937 * implicit instantiations of static data members of class
1938 templates
1939
1940 * virtual tables
1941
1942 * typeinfo objects
1943
1944 Furthermore, all entities that reach this point must have a
1945 definition available in this translation unit.
1946
1947 The following assertions check these conditions. */
1948 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
1949 || TREE_CODE (decl) == VAR_DECL);
1950 /* Any code that creates entities with TREE_PUBLIC cleared should
1951 also set DECL_INTERFACE_KNOWN. */
1952 gcc_assert (TREE_PUBLIC (decl));
1953 if (TREE_CODE (decl) == FUNCTION_DECL)
1954 gcc_assert (DECL_IMPLICIT_INSTANTIATION (decl)
1955 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl)
1956 || DECL_DECLARED_INLINE_P (decl));
1957 else
1958 gcc_assert (DECL_IMPLICIT_INSTANTIATION (decl)
1959 || DECL_VTABLE_OR_VTT_P (decl)
1960 || DECL_TINFO_P (decl));
1961 /* Check that a definition of DECL is available in this translation
1962 unit. */
1963 gcc_assert (!DECL_REALLY_EXTERN (decl));
1964
1965 /* Assume that DECL will not have COMDAT linkage. */
1966 comdat_p = false;
1967 /* Assume that DECL will not be imported into this translation
1968 unit. */
1969 import_p = false;
1970
1971 /* See if the repository tells us whether or not to emit DECL in
1972 this translation unit. */
1973 emit_p = repo_emit_p (decl);
1974 if (emit_p == 0)
1975 import_p = true;
1976 else if (emit_p == 1)
1977 {
1978 /* The repository indicates that this entity should be defined
1979 here. Make sure the back end honors that request. */
1980 if (TREE_CODE (decl) == VAR_DECL)
1981 mark_needed (decl);
1982 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)
1983 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
1984 {
1985 tree clone;
1986 FOR_EACH_CLONE (clone, decl)
1987 mark_needed (clone);
1988 }
1989 else
1990 mark_needed (decl);
1991 /* Output the definition as an ordinary strong definition. */
1992 DECL_EXTERNAL (decl) = 0;
1993 DECL_INTERFACE_KNOWN (decl) = 1;
1994 return;
1995 }
1996
1997 if (import_p)
1998 /* We have already decided what to do with this DECL; there is no
1999 need to check anything further. */
2000 ;
2001 else if (TREE_CODE (decl) == VAR_DECL && DECL_VTABLE_OR_VTT_P (decl))
2002 {
2003 class_type = DECL_CONTEXT (decl);
2004 import_export_class (class_type);
2005 if (TYPE_FOR_JAVA (class_type))
2006 import_p = true;
2007 else if (CLASSTYPE_INTERFACE_KNOWN (class_type)
2008 && CLASSTYPE_INTERFACE_ONLY (class_type))
2009 import_p = true;
2010 else if ((!flag_weak || TARGET_WEAK_NOT_IN_ARCHIVE_TOC)
2011 && !CLASSTYPE_USE_TEMPLATE (class_type)
2012 && CLASSTYPE_KEY_METHOD (class_type)
2013 && !DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (class_type)))
2014 /* The ABI requires that all virtual tables be emitted with
2015 COMDAT linkage. However, on systems where COMDAT symbols
2016 don't show up in the table of contents for a static
2017 archive, or on systems without weak symbols (where we
2018 approximate COMDAT linkage by using internal linkage), the
2019 linker will report errors about undefined symbols because
2020 it will not see the virtual table definition. Therefore,
2021 in the case that we know that the virtual table will be
2022 emitted in only one translation unit, we make the virtual
2023 table an ordinary definition with external linkage. */
2024 DECL_EXTERNAL (decl) = 0;
2025 else if (CLASSTYPE_INTERFACE_KNOWN (class_type))
2026 {
2027 /* CLASS_TYPE is being exported from this translation unit,
2028 so DECL should be defined here. */
2029 if (!flag_weak && CLASSTYPE_EXPLICIT_INSTANTIATION (class_type))
2030 /* If a class is declared in a header with the "extern
2031 template" extension, then it will not be instantiated,
2032 even in translation units that would normally require
2033 it. Often such classes are explicitly instantiated in
2034 one translation unit. Therefore, the explicit
2035 instantiation must be made visible to other translation
2036 units. */
2037 DECL_EXTERNAL (decl) = 0;
2038 else
2039 {
2040 /* The generic C++ ABI says that class data is always
2041 COMDAT, even if there is a key function. Some
2042 variants (e.g., the ARM EABI) says that class data
2043 only has COMDAT linkage if the class data might be
2044 emitted in more than one translation unit. When the
2045 key method can be inline and is inline, we still have
2046 to arrange for comdat even though
2047 class_data_always_comdat is false. */
2048 if (!CLASSTYPE_KEY_METHOD (class_type)
2049 || DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (class_type))
2050 || targetm.cxx.class_data_always_comdat ())
2051 {
2052 /* The ABI requires COMDAT linkage. Normally, we
2053 only emit COMDAT things when they are needed;
2054 make sure that we realize that this entity is
2055 indeed needed. */
2056 comdat_p = true;
2057 mark_needed (decl);
2058 }
2059 }
2060 }
2061 else if (!flag_implicit_templates
2062 && CLASSTYPE_IMPLICIT_INSTANTIATION (class_type))
2063 import_p = true;
2064 else
2065 comdat_p = true;
2066 }
2067 else if (TREE_CODE (decl) == VAR_DECL && DECL_TINFO_P (decl))
2068 {
2069 tree type = TREE_TYPE (DECL_NAME (decl));
2070 if (CLASS_TYPE_P (type))
2071 {
2072 class_type = type;
2073 import_export_class (type);
2074 if (CLASSTYPE_INTERFACE_KNOWN (type)
2075 && TYPE_POLYMORPHIC_P (type)
2076 && CLASSTYPE_INTERFACE_ONLY (type)
2077 /* If -fno-rtti was specified, then we cannot be sure
2078 that RTTI information will be emitted with the
2079 virtual table of the class, so we must emit it
2080 wherever it is used. */
2081 && flag_rtti)
2082 import_p = true;
2083 else
2084 {
2085 if (CLASSTYPE_INTERFACE_KNOWN (type)
2086 && !CLASSTYPE_INTERFACE_ONLY (type))
2087 {
2088 comdat_p = (targetm.cxx.class_data_always_comdat ()
2089 || (CLASSTYPE_KEY_METHOD (type)
2090 && DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (type))));
2091 mark_needed (decl);
2092 if (!flag_weak)
2093 {
2094 comdat_p = false;
2095 DECL_EXTERNAL (decl) = 0;
2096 }
2097 }
2098 else
2099 comdat_p = true;
2100 }
2101 }
2102 else
2103 comdat_p = true;
2104 }
2105 else if (DECL_TEMPLATE_INSTANTIATION (decl)
2106 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2107 {
2108 /* DECL is an implicit instantiation of a function or static
2109 data member. */
2110 if (flag_implicit_templates
2111 || (flag_implicit_inline_templates
2112 && TREE_CODE (decl) == FUNCTION_DECL
2113 && DECL_DECLARED_INLINE_P (decl)))
2114 comdat_p = true;
2115 else
2116 /* If we are not implicitly generating templates, then mark
2117 this entity as undefined in this translation unit. */
2118 import_p = true;
2119 }
2120 else if (DECL_FUNCTION_MEMBER_P (decl))
2121 {
2122 if (!DECL_DECLARED_INLINE_P (decl))
2123 {
2124 tree ctype = DECL_CONTEXT (decl);
2125 import_export_class (ctype);
2126 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
2127 {
2128 DECL_NOT_REALLY_EXTERN (decl)
2129 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2130 || (DECL_DECLARED_INLINE_P (decl)
2131 && ! flag_implement_inlines
2132 && !DECL_VINDEX (decl)));
2133
2134 if (!DECL_NOT_REALLY_EXTERN (decl))
2135 DECL_EXTERNAL (decl) = 1;
2136
2137 /* Always make artificials weak. */
2138 if (DECL_ARTIFICIAL (decl) && flag_weak)
2139 comdat_p = true;
2140 else
2141 maybe_make_one_only (decl);
2142 }
2143 }
2144 else
2145 comdat_p = true;
2146 }
2147 else
2148 comdat_p = true;
2149
2150 if (import_p)
2151 {
2152 /* If we are importing DECL into this translation unit, mark is
2153 an undefined here. */
2154 DECL_EXTERNAL (decl) = 1;
2155 DECL_NOT_REALLY_EXTERN (decl) = 0;
2156 }
2157 else if (comdat_p)
2158 {
2159 /* If we decided to put DECL in COMDAT, mark it accordingly at
2160 this point. */
2161 comdat_linkage (decl);
2162 }
2163
2164 DECL_INTERFACE_KNOWN (decl) = 1;
2165}
2166
2167/* Return an expression that performs the destruction of DECL, which
2168 must be a VAR_DECL whose type has a non-trivial destructor, or is
2169 an array whose (innermost) elements have a non-trivial destructor. */
2170
2171tree
2172build_cleanup (tree decl)
2173{
2174 tree temp;
2175 tree type = TREE_TYPE (decl);
2176
2177 /* This function should only be called for declarations that really
2178 require cleanups. */
2179 gcc_assert (!TYPE_HAS_TRIVIAL_DESTRUCTOR (type));
2180
2181 /* Treat all objects with destructors as used; the destructor may do
2182 something substantive. */
2183 mark_used (decl);
2184
2185 if (TREE_CODE (type) == ARRAY_TYPE)
2186 temp = decl;
2187 else
2188 {
2189 cxx_mark_addressable (decl);
2190 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
2191 }
2192 temp = build_delete (TREE_TYPE (temp), temp,
2193 sfk_complete_destructor,
2194 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
2195 return temp;
2196}
2197
2198/* Returns the initialization guard variable for the variable DECL,
2199 which has static storage duration. */
2200
2201tree
2202get_guard (tree decl)
2203{
2204 tree sname;
2205 tree guard;
2206
2207 sname = mangle_guard_variable (decl);
2208 guard = IDENTIFIER_GLOBAL_VALUE (sname);
2209 if (! guard)
2210 {
2211 tree guard_type;
2212
2213 /* We use a type that is big enough to contain a mutex as well
2214 as an integer counter. */
2215 guard_type = targetm.cxx.guard_type ();
2216 guard = build_decl (VAR_DECL, sname, guard_type);
2217
2218 /* The guard should have the same linkage as what it guards. */
2219 TREE_PUBLIC (guard) = TREE_PUBLIC (decl);
2220 TREE_STATIC (guard) = TREE_STATIC (decl);
2221 DECL_COMMON (guard) = DECL_COMMON (decl);
2222 DECL_ONE_ONLY (guard) = DECL_ONE_ONLY (decl);
2223 if (TREE_PUBLIC (decl))
2224 DECL_WEAK (guard) = DECL_WEAK (decl);
2225
2226 DECL_ARTIFICIAL (guard) = 1;
2227 DECL_IGNORED_P (guard) = 1;
2228 TREE_USED (guard) = 1;
2229 pushdecl_top_level_and_finish (guard, NULL_TREE);
2230 }
2231 return guard;
2232}
2233
2234/* Return those bits of the GUARD variable that should be set when the
2235 guarded entity is actually initialized. */
2236
2237static tree
2238get_guard_bits (tree guard)
2239{
2240 if (!targetm.cxx.guard_mask_bit ())
2241 {
2242 /* We only set the first byte of the guard, in order to leave room
2243 for a mutex in the high-order bits. */
2244 guard = build1 (ADDR_EXPR,
2245 build_pointer_type (TREE_TYPE (guard)),
2246 guard);
2247 guard = build1 (NOP_EXPR,
2248 build_pointer_type (char_type_node),
2249 guard);
2250 guard = build1 (INDIRECT_REF, char_type_node, guard);
2251 }
2252
2253 return guard;
2254}
2255
2256/* Return an expression which determines whether or not the GUARD
2257 variable has already been initialized. */
2258
2259tree
2260get_guard_cond (tree guard)
2261{
2262 tree guard_value;
2263
2264 /* Check to see if the GUARD is zero. */
2265 guard = get_guard_bits (guard);
2266
2267 /* Mask off all but the low bit. */
2268 if (targetm.cxx.guard_mask_bit ())
2269 {
2270 guard_value = integer_one_node;
2271 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
2272 guard_value = convert (TREE_TYPE (guard), guard_value);
2273 guard = cp_build_binary_op (BIT_AND_EXPR, guard, guard_value);
2274 }
2275
2276 guard_value = integer_zero_node;
2277 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
2278 guard_value = convert (TREE_TYPE (guard), guard_value);
2279 return cp_build_binary_op (EQ_EXPR, guard, guard_value);
2280}
2281
2282/* Return an expression which sets the GUARD variable, indicating that
2283 the variable being guarded has been initialized. */
2284
2285tree
2286set_guard (tree guard)
2287{
2288 tree guard_init;
2289
2290 /* Set the GUARD to one. */
2291 guard = get_guard_bits (guard);
2292 guard_init = integer_one_node;
2293 if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard)))
2294 guard_init = convert (TREE_TYPE (guard), guard_init);
2295 return build_modify_expr (guard, NOP_EXPR, guard_init);
2296}
2297
2298/* Start the process of running a particular set of global constructors
2299 or destructors. Subroutine of do_[cd]tors. */
2300
2301static tree
2302start_objects (int method_type, int initp)
2303{
2304 tree body;
2305 tree fndecl;
2306 char type[10];
2307
2308 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2309
2310 if (initp != DEFAULT_INIT_PRIORITY)
2311 {
2312 char joiner;
2313
2314#ifdef JOINER
2315 joiner = JOINER;
2316#else
2317 joiner = '_';
2318#endif
2319
2320 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
2321 }
2322 else
2323 sprintf (type, "%c", method_type);
2324
2325 fndecl = build_lang_decl (FUNCTION_DECL,
2326 get_file_function_name (type),
2327 build_function_type (void_type_node,
2328 void_list_node));
2329 start_preparsed_function (fndecl, /*attrs=*/NULL_TREE, SF_PRE_PARSED);
2330
2331 /* It can be a static function as long as collect2 does not have
2332 to scan the object file to find its ctor/dtor routine. */
2333 TREE_PUBLIC (current_function_decl) = ! targetm.have_ctors_dtors;
2334
2335 /* Mark as artificial because it's not explicitly in the user's
2336 source code. */
2337 DECL_ARTIFICIAL (current_function_decl) = 1;
2338
2339 /* Mark this declaration as used to avoid spurious warnings. */
2340 TREE_USED (current_function_decl) = 1;
2341
2342 /* Mark this function as a global constructor or destructor. */
2343 if (method_type == 'I')
2344 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
2345 else
2346 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
2347 DECL_LANG_SPECIFIC (current_function_decl)->decl_flags.u2sel = 1;
2348
2349 body = begin_compound_stmt (BCS_FN_BODY);
2350
2351 /* We cannot allow these functions to be elided, even if they do not
2352 have external linkage. And, there's no point in deferring
2353 compilation of these functions; they're all going to have to be
2354 out anyhow. */
2355 DECL_INLINE (current_function_decl) = 0;
2356 DECL_UNINLINABLE (current_function_decl) = 1;
2357
2358 return body;
2359}
2360
2361/* Finish the process of running a particular set of global constructors
2362 or destructors. Subroutine of do_[cd]tors. */
2363
2364static void
2365finish_objects (int method_type, int initp, tree body)
2366{
2367 tree fn;
2368
2369 /* Finish up. */
2370 finish_compound_stmt (body);
2371 fn = finish_function (0);
2372 expand_or_defer_fn (fn);
2373
2374 /* When only doing semantic analysis, and no RTL generation, we
2375 can't call functions that directly emit assembly code; there is
2376 no assembly file in which to put the code. */
2377 if (flag_syntax_only)
2378 return;
2379
2380 if (targetm.have_ctors_dtors)
2381 {
2382 rtx fnsym = XEXP (DECL_RTL (fn), 0);
2383 cgraph_mark_needed_node (cgraph_node (fn));
2384 if (method_type == 'I')
2385 (* targetm.asm_out.constructor) (fnsym, initp);
2386 else
2387 (* targetm.asm_out.destructor) (fnsym, initp);
2388 }
2389}
2390
2391/* The names of the parameters to the function created to handle
2392 initializations and destructions for objects with static storage
2393 duration. */
2394#define INITIALIZE_P_IDENTIFIER "__initialize_p"
2395#define PRIORITY_IDENTIFIER "__priority"
2396
2397/* The name of the function we create to handle initializations and
2398 destructions for objects with static storage duration. */
2399#define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2400
2401/* The declaration for the __INITIALIZE_P argument. */
2402static GTY(()) tree initialize_p_decl;
2403
2404/* The declaration for the __PRIORITY argument. */
2405static GTY(()) tree priority_decl;
2406
2407/* The declaration for the static storage duration function. */
2408static GTY(()) tree ssdf_decl;
2409
2410/* All the static storage duration functions created in this
2411 translation unit. */
2412static GTY(()) VEC(tree,gc) *ssdf_decls;
2413
2414/* A map from priority levels to information about that priority
2415 level. There may be many such levels, so efficient lookup is
2416 important. */
2417static splay_tree priority_info_map;
2418
2419/* Begins the generation of the function that will handle all
2420 initialization and destruction of objects with static storage
2421 duration. The function generated takes two parameters of type
2422 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2423 nonzero, it performs initializations. Otherwise, it performs
2424 destructions. It only performs those initializations or
2425 destructions with the indicated __PRIORITY. The generated function
2426 returns no value.
2427
2428 It is assumed that this function will only be called once per
2429 translation unit. */
2430
2431static tree
2432start_static_storage_duration_function (unsigned count)
2433{
2434 tree parm_types;
2435 tree type;
2436 tree body;
2437 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2438
2439 /* Create the identifier for this function. It will be of the form
2440 SSDF_IDENTIFIER_<number>. */
2441 sprintf (id, "%s_%u", SSDF_IDENTIFIER, count);
2442
2443 /* Create the parameters. */
2444 parm_types = void_list_node;
2445 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2446 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2447 type = build_function_type (void_type_node, parm_types);
2448
2449 /* Create the FUNCTION_DECL itself. */
2450 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2451 get_identifier (id),
2452 type);
2453 TREE_PUBLIC (ssdf_decl) = 0;
2454 DECL_ARTIFICIAL (ssdf_decl) = 1;
2455
2456 /* Put this function in the list of functions to be called from the
2457 static constructors and destructors. */
2458 if (!ssdf_decls)
2459 {
2460 ssdf_decls = VEC_alloc (tree, gc, 32);
2461
2462 /* Take this opportunity to initialize the map from priority
2463 numbers to information about that priority level. */
2464 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2465 /*delete_key_fn=*/0,
2466 /*delete_value_fn=*/
2467 (splay_tree_delete_value_fn) &free);
2468
2469 /* We always need to generate functions for the
2470 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2471 priorities later, we'll be sure to find the
2472 DEFAULT_INIT_PRIORITY. */
2473 get_priority_info (DEFAULT_INIT_PRIORITY);
2474 }
2475
2476 VEC_safe_push (tree, gc, ssdf_decls, ssdf_decl);
2477
2478 /* Create the argument list. */
2479 initialize_p_decl = cp_build_parm_decl
2480 (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node);
2481 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2482 TREE_USED (initialize_p_decl) = 1;
2483 priority_decl = cp_build_parm_decl
2484 (get_identifier (PRIORITY_IDENTIFIER), integer_type_node);
2485 DECL_CONTEXT (priority_decl) = ssdf_decl;
2486 TREE_USED (priority_decl) = 1;
2487
2488 TREE_CHAIN (initialize_p_decl) = priority_decl;
2489 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2490
2491 /* Put the function in the global scope. */
2492 pushdecl (ssdf_decl);
2493
2494 /* Start the function itself. This is equivalent to declaring the
2495 function as:
2496
2497 static void __ssdf (int __initialize_p, init __priority_p);
2498
2499 It is static because we only need to call this function from the
2500 various constructor and destructor functions for this module. */
2501 start_preparsed_function (ssdf_decl,
2502 /*attrs=*/NULL_TREE,
2503 SF_PRE_PARSED);
2504
2505 /* Set up the scope of the outermost block in the function. */
2506 body = begin_compound_stmt (BCS_FN_BODY);
2507
2508 /* This function must not be deferred because we are depending on
2509 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
2510 DECL_INLINE (ssdf_decl) = 0;
2511 DECL_UNINLINABLE (ssdf_decl) = 1;
2512
2513 return body;
2514}
2515
2516/* Finish the generation of the function which performs initialization
2517 and destruction of objects with static storage duration. After
2518 this point, no more such objects can be created. */
2519
2520static void
2521finish_static_storage_duration_function (tree body)
2522{
2523 /* Close out the function. */
2524 finish_compound_stmt (body);
2525 expand_or_defer_fn (finish_function (0));
2526}
2527
2528/* Return the information about the indicated PRIORITY level. If no
2529 code to handle this level has yet been generated, generate the
2530 appropriate prologue. */
2531
2532static priority_info
2533get_priority_info (int priority)
2534{
2535 priority_info pi;
2536 splay_tree_node n;
2537
2538 n = splay_tree_lookup (priority_info_map,
2539 (splay_tree_key) priority);
2540 if (!n)
2541 {
2542 /* Create a new priority information structure, and insert it
2543 into the map. */
2544 pi = XNEW (struct priority_info_s);
2545 pi->initializations_p = 0;
2546 pi->destructions_p = 0;
2547 splay_tree_insert (priority_info_map,
2548 (splay_tree_key) priority,
2549 (splay_tree_value) pi);
2550 }
2551 else
2552 pi = (priority_info) n->value;
2553
2554 return pi;
2555}
2556
2557/* The effective initialization priority of a DECL. */
2558
2559#define DECL_EFFECTIVE_INIT_PRIORITY(decl) \
2560 ((!DECL_HAS_INIT_PRIORITY_P (decl) || DECL_INIT_PRIORITY (decl) == 0) \
2561 ? DEFAULT_INIT_PRIORITY : DECL_INIT_PRIORITY (decl))
2562
2563/* Whether a DECL needs a guard to protect it against multiple
2564 initialization. */
2565
2566#define NEEDS_GUARD_P(decl) (TREE_PUBLIC (decl) && (DECL_COMMON (decl) \
2567 || DECL_ONE_ONLY (decl) \
2568 || DECL_WEAK (decl)))
2569
2570/* Set up to handle the initialization or destruction of DECL. If
2571 INITP is nonzero, we are initializing the variable. Otherwise, we
2572 are destroying it. */
2573
2574static void
2575one_static_initialization_or_destruction (tree decl, tree init, bool initp)
2576{
2577 tree guard_if_stmt = NULL_TREE;
2578 tree guard;
2579
2580 /* If we are supposed to destruct and there's a trivial destructor,
2581 nothing has to be done. */
2582 if (!initp
2583 && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2584 return;
2585
2586 /* Trick the compiler into thinking we are at the file and line
2587 where DECL was declared so that error-messages make sense, and so
2588 that the debugger will show somewhat sensible file and line
2589 information. */
2590 input_location = DECL_SOURCE_LOCATION (decl);
2591
2592 /* Because of:
2593
2594 [class.access.spec]
2595
2596 Access control for implicit calls to the constructors,
2597 the conversion functions, or the destructor called to
2598 create and destroy a static data member is performed as
2599 if these calls appeared in the scope of the member's
2600 class.
2601
2602 we pretend we are in a static member function of the class of
2603 which the DECL is a member. */
2604 if (member_p (decl))
2605 {
2606 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
2607 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
2608 }
2609
2610 /* Assume we don't need a guard. */
2611 guard = NULL_TREE;
2612 /* We need a guard if this is an object with external linkage that
2613 might be initialized in more than one place. (For example, a
2614 static data member of a template, when the data member requires
2615 construction.) */
2616 if (NEEDS_GUARD_P (decl))
2617 {
2618 tree guard_cond;
2619
2620 guard = get_guard (decl);
2621
2622 /* When using __cxa_atexit, we just check the GUARD as we would
2623 for a local static. */
2624 if (flag_use_cxa_atexit)
2625 {
2626 /* When using __cxa_atexit, we never try to destroy
2627 anything from a static destructor. */
2628 gcc_assert (initp);
2629 guard_cond = get_guard_cond (guard);
2630 }
2631 /* If we don't have __cxa_atexit, then we will be running
2632 destructors from .fini sections, or their equivalents. So,
2633 we need to know how many times we've tried to initialize this
2634 object. We do initializations only if the GUARD is zero,
2635 i.e., if we are the first to initialize the variable. We do
2636 destructions only if the GUARD is one, i.e., if we are the
2637 last to destroy the variable. */
2638 else if (initp)
2639 guard_cond
2640 = cp_build_binary_op (EQ_EXPR,
2641 build_unary_op (PREINCREMENT_EXPR,
2642 guard,
2643 /*noconvert=*/1),
2644 integer_one_node);
2645 else
2646 guard_cond
2647 = cp_build_binary_op (EQ_EXPR,
2648 build_unary_op (PREDECREMENT_EXPR,
2649 guard,
2650 /*noconvert=*/1),
2651 integer_zero_node);
2652
2653 guard_if_stmt = begin_if_stmt ();
2654 finish_if_stmt_cond (guard_cond, guard_if_stmt);
2655 }
2656
2657
2658 /* If we're using __cxa_atexit, we have not already set the GUARD,
2659 so we must do so now. */
2660 if (guard && initp && flag_use_cxa_atexit)
2661 finish_expr_stmt (set_guard (guard));
2662
2663 /* Perform the initialization or destruction. */
2664 if (initp)
2665 {
2666 if (init)
2667 finish_expr_stmt (init);
2668
2669 /* If we're using __cxa_atexit, register a function that calls the
2670 destructor for the object. */
2671 if (flag_use_cxa_atexit)
2672 finish_expr_stmt (register_dtor_fn (decl));
2673 }
2674 else
2675 finish_expr_stmt (build_cleanup (decl));
2676
2677 /* Finish the guard if-stmt, if necessary. */
2678 if (guard)
2679 {
2680 finish_then_clause (guard_if_stmt);
2681 finish_if_stmt (guard_if_stmt);
2682 }
2683
2684 /* Now that we're done with DECL we don't need to pretend to be a
2685 member of its class any longer. */
2686 DECL_CONTEXT (current_function_decl) = NULL_TREE;
2687 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
2688}
2689
2690/* Generate code to do the initialization or destruction of the decls in VARS,
2691 a TREE_LIST of VAR_DECL with static storage duration.
2692 Whether initialization or destruction is performed is specified by INITP. */
2693
2694static void
2695do_static_initialization_or_destruction (tree vars, bool initp)
2696{
2697 tree node, init_if_stmt, cond;
2698
2699 /* Build the outer if-stmt to check for initialization or destruction. */
2700 init_if_stmt = begin_if_stmt ();
2701 cond = initp ? integer_one_node : integer_zero_node;
2702 cond = cp_build_binary_op (EQ_EXPR,
2703 initialize_p_decl,
2704 cond);
2705 finish_if_stmt_cond (cond, init_if_stmt);
2706
2707 node = vars;
2708 do {
2709 tree decl = TREE_VALUE (node);
2710 tree priority_if_stmt;
2711 int priority;
2712 priority_info pi;
2713
2714 /* If we don't need a destructor, there's nothing to do. Avoid
2715 creating a possibly empty if-stmt. */
2716 if (!initp && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2717 {
2718 node = TREE_CHAIN (node);
2719 continue;
2720 }
2721
2722 /* Remember that we had an initialization or finalization at this
2723 priority. */
2724 priority = DECL_EFFECTIVE_INIT_PRIORITY (decl);
2725 pi = get_priority_info (priority);
2726 if (initp)
2727 pi->initializations_p = 1;
2728 else
2729 pi->destructions_p = 1;
2730
2731 /* Conditionalize this initialization on being in the right priority
2732 and being initializing/finalizing appropriately. */
2733 priority_if_stmt = begin_if_stmt ();
2734 cond = cp_build_binary_op (EQ_EXPR,
2735 priority_decl,
2736 build_int_cst (NULL_TREE, priority));
2737 finish_if_stmt_cond (cond, priority_if_stmt);
2738
2739 /* Process initializers with same priority. */
2740 for (; node
2741 && DECL_EFFECTIVE_INIT_PRIORITY (TREE_VALUE (node)) == priority;
2742 node = TREE_CHAIN (node))
2743 /* Do one initialization or destruction. */
2744 one_static_initialization_or_destruction (TREE_VALUE (node),
2745 TREE_PURPOSE (node), initp);
2746
2747 /* Finish up the priority if-stmt body. */
2748 finish_then_clause (priority_if_stmt);
2749 finish_if_stmt (priority_if_stmt);
2750
2751 } while (node);
2752
2753 /* Finish up the init/destruct if-stmt body. */
2754 finish_then_clause (init_if_stmt);
2755 finish_if_stmt (init_if_stmt);
2756}
2757
2758/* VARS is a list of variables with static storage duration which may
2759 need initialization and/or finalization. Remove those variables
2760 that don't really need to be initialized or finalized, and return
2761 the resulting list. The order in which the variables appear in
2762 VARS is in reverse order of the order in which they should actually
2763 be initialized. The list we return is in the unreversed order;
2764 i.e., the first variable should be initialized first. */
2765
2766static tree
2767prune_vars_needing_no_initialization (tree *vars)
2768{
2769 tree *var = vars;
2770 tree result = NULL_TREE;
2771
2772 while (*var)
2773 {
2774 tree t = *var;
2775 tree decl = TREE_VALUE (t);
2776 tree init = TREE_PURPOSE (t);
2777
2778 /* Deal gracefully with error. */
2779 if (decl == error_mark_node)
2780 {
2781 var = &TREE_CHAIN (t);
2782 continue;
2783 }
2784
2785 /* The only things that can be initialized are variables. */
2786 gcc_assert (TREE_CODE (decl) == VAR_DECL);
2787
2788 /* If this object is not defined, we don't need to do anything
2789 here. */
2790 if (DECL_EXTERNAL (decl))
2791 {
2792 var = &TREE_CHAIN (t);
2793 continue;
2794 }
2795
2796 /* Also, if the initializer already contains errors, we can bail
2797 out now. */
2798 if (init && TREE_CODE (init) == TREE_LIST
2799 && value_member (error_mark_node, init))
2800 {
2801 var = &TREE_CHAIN (t);
2802 continue;
2803 }
2804
2805 /* This variable is going to need initialization and/or
2806 finalization, so we add it to the list. */
2807 *var = TREE_CHAIN (t);
2808 TREE_CHAIN (t) = result;
2809 result = t;
2810 }
2811
2812 return result;
2813}
2814
2815/* Make sure we have told the back end about all the variables in
2816 VARS. */
2817
2818static void
2819write_out_vars (tree vars)
2820{
2821 tree v;
2822
2823 for (v = vars; v; v = TREE_CHAIN (v))
2824 {
2825 tree var = TREE_VALUE (v);
2826 if (!var_finalized_p (var))
2827 {
2828 import_export_decl (var);
2829 rest_of_decl_compilation (var, 1, 1);
2830 }
2831 }
2832}
2833
2834/* Generate a static constructor (if CONSTRUCTOR_P) or destructor
2835 (otherwise) that will initialize all gobal objects with static
2836 storage duration having the indicated PRIORITY. */
2837
2838static void
2839generate_ctor_or_dtor_function (bool constructor_p, int priority,
2840 location_t *locus)
2841{
2842 char function_key;
2843 tree arguments;
2844 tree fndecl;
2845 tree body;
2846 size_t i;
2847
2848 input_location = *locus;
2849#ifdef USE_MAPPED_LOCATION
2850 /* ??? */
2851#else
2852 locus->line++;
2853#endif
2854
2855 /* We use `I' to indicate initialization and `D' to indicate
2856 destruction. */
2857 function_key = constructor_p ? 'I' : 'D';
2858
2859 /* We emit the function lazily, to avoid generating empty
2860 global constructors and destructors. */
2861 body = NULL_TREE;
2862
2863 /* For Objective-C++, we may need to initialize metadata found in this module.
2864 This must be done _before_ any other static initializations. */
2865 if (c_dialect_objc () && (priority == DEFAULT_INIT_PRIORITY)
2866 && constructor_p && objc_static_init_needed_p ())
2867 {
2868 body = start_objects (function_key, priority);
2869 static_ctors = objc_generate_static_init_call (static_ctors);
2870 }
2871
2872 /* Call the static storage duration function with appropriate
2873 arguments. */
2874 for (i = 0; VEC_iterate (tree, ssdf_decls, i, fndecl); ++i)
2875 {
2876 /* Calls to pure or const functions will expand to nothing. */
2877 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2878 {
2879 if (! body)
2880 body = start_objects (function_key, priority);
2881
2882 arguments = tree_cons (NULL_TREE,
2883 build_int_cst (NULL_TREE, priority),
2884 NULL_TREE);
2885 arguments = tree_cons (NULL_TREE,
2886 build_int_cst (NULL_TREE, constructor_p),
2887 arguments);
2888 finish_expr_stmt (build_function_call (fndecl, arguments));
2889 }
2890 }
2891
2892 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
2893 calls to any functions marked with attributes indicating that
2894 they should be called at initialization- or destruction-time. */
2895 if (priority == DEFAULT_INIT_PRIORITY)
2896 {
2897 tree fns;
2898
2899 for (fns = constructor_p ? static_ctors : static_dtors;
2900 fns;
2901 fns = TREE_CHAIN (fns))
2902 {
2903 fndecl = TREE_VALUE (fns);
2904
2905 /* Calls to pure/const functions will expand to nothing. */
2906 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2907 {
2908 if (! body)
2909 body = start_objects (function_key, priority);
2910 finish_expr_stmt (build_function_call (fndecl, NULL_TREE));
2911 }
2912 }
2913 }
2914
2915 /* Close out the function. */
2916 if (body)
2917 finish_objects (function_key, priority, body);
2918}
2919
2920/* Generate constructor and destructor functions for the priority
2921 indicated by N. */
2922
2923static int
2924generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data)
2925{
2926 location_t *locus = (location_t *) data;
2927 int priority = (int) n->key;
2928 priority_info pi = (priority_info) n->value;
2929
2930 /* Generate the functions themselves, but only if they are really
2931 needed. */
2932 if (pi->initializations_p
2933 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
2934 generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus);
2935 if (pi->destructions_p
2936 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
2937 generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus);
2938
2939 /* Keep iterating. */
2940 return 0;
2941}
2942
2943/* Called via LANGHOOK_CALLGRAPH_ANALYZE_EXPR. It is supposed to mark
2944 decls referenced from frontend specific constructs; it will be called
2945 only for language-specific tree nodes.
2946
2947 Here we must deal with member pointers. */
2948
2949tree
2950cxx_callgraph_analyze_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2951 tree from ATTRIBUTE_UNUSED)
2952{
2953 tree t = *tp;
2954
2955 switch (TREE_CODE (t))
2956 {
2957 case PTRMEM_CST:
2958 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
2959 cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t)));
2960 break;
2961 case BASELINK:
2962 if (TREE_CODE (BASELINK_FUNCTIONS (t)) == FUNCTION_DECL)
2963 cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t)));
2964 break;
2965 case VAR_DECL:
2966 if (DECL_VTABLE_OR_VTT_P (t))
2967 {
2968 /* The ABI requires that all virtual tables be emitted
2969 whenever one of them is. */
2970 tree vtbl;
2971 for (vtbl = CLASSTYPE_VTABLES (DECL_CONTEXT (t));
2972 vtbl;
2973 vtbl = TREE_CHAIN (vtbl))
2974 mark_decl_referenced (vtbl);
2975 }
2976 else if (DECL_CONTEXT (t)
2977 && TREE_CODE (DECL_CONTEXT (t)) == FUNCTION_DECL)
2978 /* If we need a static variable in a function, then we
2979 need the containing function. */
2980 mark_decl_referenced (DECL_CONTEXT (t));
2981 break;
2982 default:
2983 break;
2984 }
2985
2986 return NULL;
2987}
2988
2989/* Java requires that we be able to reference a local address for a
2990 method, and not be confused by PLT entries. If hidden aliases are
2991 supported, emit one for each java function that we've emitted. */
2992
2993static void
2994build_java_method_aliases (void)
2995{
2996 struct cgraph_node *node;
2997
2998#ifndef HAVE_GAS_HIDDEN
2999 return;
3000#endif
3001
3002 for (node = cgraph_nodes; node ; node = node->next)
3003 {
3004 tree fndecl = node->decl;
3005
3006 if (TREE_ASM_WRITTEN (fndecl)
3007 && DECL_CONTEXT (fndecl)
3008 && TYPE_P (DECL_CONTEXT (fndecl))
3009 && TYPE_FOR_JAVA (DECL_CONTEXT (fndecl))
3010 && TARGET_USE_LOCAL_THUNK_ALIAS_P (fndecl))
3011 {
3012 /* Mangle the name in a predictable way; we need to reference
3013 this from a java compiled object file. */
3014 tree oid, nid, alias;
3015 const char *oname;
3016 char *nname;
3017
3018 oid = DECL_ASSEMBLER_NAME (fndecl);
3019 oname = IDENTIFIER_POINTER (oid);
3020 gcc_assert (oname[0] == '_' && oname[1] == 'Z');
3021 nname = ACONCAT (("_ZGA", oname+2, NULL));
3022 nid = get_identifier (nname);
3023
3024 alias = make_alias_for (fndecl, nid);
3025 TREE_PUBLIC (alias) = 1;
3026 DECL_VISIBILITY (alias) = VISIBILITY_HIDDEN;
3027
3028 assemble_alias (alias, oid);
3029 }
3030 }
3031}
3032
3033/* This routine is called from the last rule in yyparse ().
3034 Its job is to create all the code needed to initialize and
3035 destroy the global aggregates. We do the destruction
3036 first, since that way we only need to reverse the decls once. */
3037
3038void
3039cp_finish_file (void)
3040{
3041 tree vars;
3042 bool reconsider;
3043 size_t i;
3044 location_t locus;
3045 unsigned ssdf_count = 0;
3046 int retries = 0;
3047 tree decl;
3048
3049 locus = input_location;
3050 at_eof = 1;
3051
3052 /* Bad parse errors. Just forget about it. */
3053 if (! global_bindings_p () || current_class_type || decl_namespace_list)
3054 return;
3055
3056 if (pch_file)
3057 c_common_write_pch ();
3058
3059#ifdef USE_MAPPED_LOCATION
3060 /* FIXME - huh? */
3061#else
3062 /* Otherwise, GDB can get confused, because in only knows
3063 about source for LINENO-1 lines. */
3064 input_line -= 1;
3065#endif
3066
3067 /* We now have to write out all the stuff we put off writing out.
3068 These include:
3069
3070 o Template specializations that we have not yet instantiated,
3071 but which are needed.
3072 o Initialization and destruction for non-local objects with
3073 static storage duration. (Local objects with static storage
3074 duration are initialized when their scope is first entered,
3075 and are cleaned up via atexit.)
3076 o Virtual function tables.
3077
3078 All of these may cause others to be needed. For example,
3079 instantiating one function may cause another to be needed, and
3080 generating the initializer for an object may cause templates to be
3081 instantiated, etc., etc. */
3082
3083 timevar_push (TV_VARCONST);
3084
3085 emit_support_tinfos ();
3086
3087 do
3088 {
3089 tree t;
3090 tree decl;
3091
3092 reconsider = false;
3093
3094 /* If there are templates that we've put off instantiating, do
3095 them now. */
3096 instantiate_pending_templates (retries);
3097 ggc_collect ();
3098
3099 /* Write out virtual tables as required. Note that writing out
3100 the virtual table for a template class may cause the
3101 instantiation of members of that class. If we write out
3102 vtables then we remove the class from our list so we don't
3103 have to look at it again. */
3104
3105 while (keyed_classes != NULL_TREE
3106 && maybe_emit_vtables (TREE_VALUE (keyed_classes)))
3107 {
3108 reconsider = true;
3109 keyed_classes = TREE_CHAIN (keyed_classes);
3110 }
3111
3112 t = keyed_classes;
3113 if (t != NULL_TREE)
3114 {
3115 tree next = TREE_CHAIN (t);
3116
3117 while (next)
3118 {
3119 if (maybe_emit_vtables (TREE_VALUE (next)))
3120 {
3121 reconsider = true;
3122 TREE_CHAIN (t) = TREE_CHAIN (next);
3123 }
3124 else
3125 t = next;
3126
3127 next = TREE_CHAIN (t);
3128 }
3129 }
3130
3131 /* Write out needed type info variables. We have to be careful
3132 looping through unemitted decls, because emit_tinfo_decl may
3133 cause other variables to be needed. New elements will be
3134 appended, and we remove from the vector those that actually
3135 get emitted. */
3136 for (i = VEC_length (tree, unemitted_tinfo_decls);
3137 VEC_iterate (tree, unemitted_tinfo_decls, --i, t);)
3138 if (emit_tinfo_decl (t))
3139 {
3140 reconsider = true;
3141 VEC_unordered_remove (tree, unemitted_tinfo_decls, i);
3142 }
3143
3144 /* The list of objects with static storage duration is built up
3145 in reverse order. We clear STATIC_AGGREGATES so that any new
3146 aggregates added during the initialization of these will be
3147 initialized in the correct order when we next come around the
3148 loop. */
3149 vars = prune_vars_needing_no_initialization (&static_aggregates);
3150
3151 if (vars)
3152 {
3153 /* We need to start a new initialization function each time
3154 through the loop. That's because we need to know which
3155 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3156 isn't computed until a function is finished, and written
3157 out. That's a deficiency in the back-end. When this is
3158 fixed, these initialization functions could all become
3159 inline, with resulting performance improvements. */
3160 tree ssdf_body;
3161
3162 /* Set the line and file, so that it is obviously not from
3163 the source file. */
3164 input_location = locus;
3165 ssdf_body = start_static_storage_duration_function (ssdf_count);
3166
3167 /* Make sure the back end knows about all the variables. */
3168 write_out_vars (vars);
3169
3170 /* First generate code to do all the initializations. */
3171 if (vars)
3172 do_static_initialization_or_destruction (vars, /*initp=*/true);
3173
3174 /* Then, generate code to do all the destructions. Do these
3175 in reverse order so that the most recently constructed
3176 variable is the first destroyed. If we're using
3177 __cxa_atexit, then we don't need to do this; functions
3178 were registered at initialization time to destroy the
3179 local statics. */
3180 if (!flag_use_cxa_atexit && vars)
3181 {
3182 vars = nreverse (vars);
3183 do_static_initialization_or_destruction (vars, /*initp=*/false);
3184 }
3185 else
3186 vars = NULL_TREE;
3187
3188 /* Finish up the static storage duration function for this
3189 round. */
3190 input_location = locus;
3191 finish_static_storage_duration_function (ssdf_body);
3192
3193 /* All those initializations and finalizations might cause
3194 us to need more inline functions, more template
3195 instantiations, etc. */
3196 reconsider = true;
3197 ssdf_count++;
3198#ifdef USE_MAPPED_LOCATION
3199 /* ??? */
3200#else
3201 locus.line++;
3202#endif
3203 }
3204
3205 /* Go through the set of inline functions whose bodies have not
3206 been emitted yet. If out-of-line copies of these functions
3207 are required, emit them. */
3208 for (i = 0; VEC_iterate (tree, deferred_fns, i, decl); ++i)
3209 {
3210 /* Does it need synthesizing? */
3211 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
3212 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
3213 {
3214 /* Even though we're already at the top-level, we push
3215 there again. That way, when we pop back a few lines
3216 hence, all of our state is restored. Otherwise,
3217 finish_function doesn't clean things up, and we end
3218 up with CURRENT_FUNCTION_DECL set. */
3219 push_to_top_level ();
3220 /* The decl's location will mark where it was first
3221 needed. Save that so synthesize method can indicate
3222 where it was needed from, in case of error */
3223 input_location = DECL_SOURCE_LOCATION (decl);
3224 synthesize_method (decl);
3225 pop_from_top_level ();
3226 reconsider = true;
3227 }
3228
3229 if (!DECL_SAVED_TREE (decl))
3230 continue;
3231
3232 /* We lie to the back-end, pretending that some functions
3233 are not defined when they really are. This keeps these
3234 functions from being put out unnecessarily. But, we must
3235 stop lying when the functions are referenced, or if they
3236 are not comdat since they need to be put out now. If
3237 DECL_INTERFACE_KNOWN, then we have already set
3238 DECL_EXTERNAL appropriately, so there's no need to check
3239 again, and we do not want to clear DECL_EXTERNAL if a
3240 previous call to import_export_decl set it.
3241
3242 This is done in a separate for cycle, because if some
3243 deferred function is contained in another deferred
3244 function later in deferred_fns varray,
3245 rest_of_compilation would skip this function and we
3246 really cannot expand the same function twice. */
3247 import_export_decl (decl);
3248 if (DECL_NOT_REALLY_EXTERN (decl)
3249 && DECL_INITIAL (decl)
3250 && decl_needed_p (decl))
3251 DECL_EXTERNAL (decl) = 0;
3252
3253 /* If we're going to need to write this function out, and
3254 there's already a body for it, create RTL for it now.
3255 (There might be no body if this is a method we haven't
3256 gotten around to synthesizing yet.) */
3257 if (!DECL_EXTERNAL (decl)
3258 && decl_needed_p (decl)
3259 && !TREE_ASM_WRITTEN (decl)
3260 && !cgraph_node (decl)->local.finalized)
3261 {
3262 /* We will output the function; no longer consider it in this
3263 loop. */
3264 DECL_DEFER_OUTPUT (decl) = 0;
3265 /* Generate RTL for this function now that we know we
3266 need it. */
3267 expand_or_defer_fn (decl);
3268 /* If we're compiling -fsyntax-only pretend that this
3269 function has been written out so that we don't try to
3270 expand it again. */
3271 if (flag_syntax_only)
3272 TREE_ASM_WRITTEN (decl) = 1;
3273 reconsider = true;
3274 }
3275 }
3276
3277 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
3278 reconsider = true;
3279
3280 /* Static data members are just like namespace-scope globals. */
3281 for (i = 0; VEC_iterate (tree, pending_statics, i, decl); ++i)
3282 {
3283 if (var_finalized_p (decl) || DECL_REALLY_EXTERN (decl))
3284 continue;
3285 import_export_decl (decl);
3286 /* If this static data member is needed, provide it to the
3287 back end. */
3288 if (DECL_NOT_REALLY_EXTERN (decl) && decl_needed_p (decl))
3289 DECL_EXTERNAL (decl) = 0;
3290 }
3291 if (VEC_length (tree, pending_statics) != 0
3292 && wrapup_global_declarations (VEC_address (tree, pending_statics),
3293 VEC_length (tree, pending_statics)))
3294 reconsider = true;
3295
3296 retries++;
3297 }
3298 while (reconsider);
3299
3300 /* All used inline functions must have a definition at this point. */
3301 for (i = 0; VEC_iterate (tree, deferred_fns, i, decl); ++i)
3302 {
3303 if (/* Check online inline functions that were actually used. */
3304 TREE_USED (decl) && DECL_DECLARED_INLINE_P (decl)
3305 /* If the definition actually was available here, then the
3306 fact that the function was not defined merely represents
3307 that for some reason (use of a template repository,
3308 #pragma interface, etc.) we decided not to emit the
3309 definition here. */
3310 && !DECL_INITIAL (decl)
3311 /* An explicit instantiation can be used to specify
3312 that the body is in another unit. It will have
3313 already verified there was a definition. */
3314 && !DECL_EXPLICIT_INSTANTIATION (decl))
3315 {
3316 warning (0, "inline function %q+D used but never defined", decl);
3317 /* Avoid a duplicate warning from check_global_declaration_1. */
3318 TREE_NO_WARNING (decl) = 1;
3319 }
3320 }
3321
3322 /* We give C linkage to static constructors and destructors. */
3323 push_lang_context (lang_name_c);
3324
3325 /* Generate initialization and destruction functions for all
3326 priorities for which they are required. */
3327 if (priority_info_map)
3328 splay_tree_foreach (priority_info_map,
3329 generate_ctor_and_dtor_functions_for_priority,
3330 /*data=*/&locus);
3331 else
3332 {
3333 /* If we have a ctor or this is obj-c++ and we need a static init,
3334 call generate_ctor_or_dtor_function. */
3335 if (static_ctors || (c_dialect_objc () && objc_static_init_needed_p ()))
3336 generate_ctor_or_dtor_function (/*constructor_p=*/true,
3337 DEFAULT_INIT_PRIORITY, &locus);
3338 if (static_dtors)
3339 generate_ctor_or_dtor_function (/*constructor_p=*/false,
3340 DEFAULT_INIT_PRIORITY, &locus);
3341 }
3342
3343 /* We're done with the splay-tree now. */
3344 if (priority_info_map)
3345 splay_tree_delete (priority_info_map);
3346
3347 /* Generate any missing aliases. */
3348 maybe_apply_pending_pragma_weaks ();
3349
3350 /* We're done with static constructors, so we can go back to "C++"
3351 linkage now. */
3352 pop_lang_context ();
3353
3354 cgraph_finalize_compilation_unit ();
3355 cgraph_optimize ();
3356
3357 /* Now, issue warnings about static, but not defined, functions,
3358 etc., and emit debugging information. */
3359 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
3360 if (VEC_length (tree, pending_statics) != 0)
3361 {
3362 check_global_declarations (VEC_address (tree, pending_statics),
3363 VEC_length (tree, pending_statics));
3364 emit_debug_global_declarations (VEC_address (tree, pending_statics),
3365 VEC_length (tree, pending_statics));
3366 }
3367
3368 /* Generate hidden aliases for Java. */
3369 build_java_method_aliases ();
3370
3371 finish_repo ();
3372
3373 /* The entire file is now complete. If requested, dump everything
3374 to a file. */
3375 {
3376 int flags;
3377 FILE *stream = dump_begin (TDI_tu, &flags);
3378
3379 if (stream)
3380 {
3381 dump_node (global_namespace, flags & ~TDF_SLIM, stream);
3382 dump_end (TDI_tu, stream);
3383 }
3384 }
3385
3386 timevar_pop (TV_VARCONST);
3387
3388 if (flag_detailed_statistics)
3389 {
3390 dump_tree_statistics ();
3391 dump_time_statistics ();
3392 }
3393 input_location = locus;
3394
3395#ifdef ENABLE_CHECKING
3396 validate_conversion_obstack ();
3397#endif /* ENABLE_CHECKING */
3398}
3399
3400/* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the
3401 function to call in parse-tree form; it has not yet been
3402 semantically analyzed. ARGS are the arguments to the function.
3403 They have already been semantically analyzed. */
3404
3405tree
3406build_offset_ref_call_from_tree (tree fn, tree args)
3407{
3408 tree orig_fn;
3409 tree orig_args;
3410 tree expr;
3411 tree object;
3412
3413 orig_fn = fn;
3414 orig_args = args;
3415 object = TREE_OPERAND (fn, 0);
3416
3417 if (processing_template_decl)
3418 {
3419 gcc_assert (TREE_CODE (fn) == DOTSTAR_EXPR
3420 || TREE_CODE (fn) == MEMBER_REF);
3421 if (type_dependent_expression_p (fn)
3422 || any_type_dependent_arguments_p (args))
3423 return build_min_nt (CALL_EXPR, fn, args, NULL_TREE);
3424
3425 /* Transform the arguments and add the implicit "this"
3426 parameter. That must be done before the FN is transformed
3427 because we depend on the form of FN. */
3428 args = build_non_dependent_args (args);
3429 if (TREE_CODE (fn) == DOTSTAR_EXPR)
3430 object = build_unary_op (ADDR_EXPR, object, 0);
3431 object = build_non_dependent_expr (object);
3432 args = tree_cons (NULL_TREE, object, args);
3433 /* Now that the arguments are done, transform FN. */
3434 fn = build_non_dependent_expr (fn);
3435 }
3436
3437 /* A qualified name corresponding to a bound pointer-to-member is
3438 represented as an OFFSET_REF:
3439
3440 struct B { void g(); };
3441 void (B::*p)();
3442 void B::g() { (this->*p)(); } */
3443 if (TREE_CODE (fn) == OFFSET_REF)
3444 {
3445 tree object_addr = build_unary_op (ADDR_EXPR, object, 0);
3446 fn = TREE_OPERAND (fn, 1);
3447 fn = get_member_function_from_ptrfunc (&object_addr, fn);
3448 args = tree_cons (NULL_TREE, object_addr, args);
3449 }
3450
3451 expr = build_function_call (fn, args);
3452 if (processing_template_decl && expr != error_mark_node)
3453 return build_min_non_dep (CALL_EXPR, expr, orig_fn, orig_args, NULL_TREE);
3454 return expr;
3455}
3456
3457
3458void
3459check_default_args (tree x)
3460{
3461 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
3462 bool saw_def = false;
3463 int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
3464 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
3465 {
3466 if (TREE_PURPOSE (arg))
3467 saw_def = true;
3468 else if (saw_def)
3469 {
3470 error ("default argument missing for parameter %P of %q+#D", i, x);
3471 TREE_PURPOSE (arg) = error_mark_node;
3472 }
3473 }
3474}
3475
3476/* Mark DECL (either a _DECL or a BASELINK) as "used" in the program.
3477 If DECL is a specialization or implicitly declared class member,
3478 generate the actual definition. */
3479
3480void
3481mark_used (tree decl)
3482{
3483 HOST_WIDE_INT saved_processing_template_decl = 0;
3484
3485 /* If DECL is a BASELINK for a single function, then treat it just
3486 like the DECL for the function. Otherwise, if the BASELINK is
3487 for an overloaded function, we don't know which function was
3488 actually used until after overload resolution. */
3489 if (TREE_CODE (decl) == BASELINK)
3490 {
3491 decl = BASELINK_FUNCTIONS (decl);
3492 if (really_overloaded_fn (decl))
3493 return;
3494 decl = OVL_CURRENT (decl);
3495 }
3496
3497 TREE_USED (decl) = 1;
3498 if (DECL_CLONED_FUNCTION_P (decl))
3499 TREE_USED (DECL_CLONED_FUNCTION (decl)) = 1;
3500 /* If we don't need a value, then we don't need to synthesize DECL. */
3501 if (skip_evaluation)
3502 return;
3503 /* Normally, we can wait until instantiation-time to synthesize
3504 DECL. However, if DECL is a static data member initialized with
3505 a constant, we need the value right now because a reference to
3506 such a data member is not value-dependent. */
3507 if (TREE_CODE (decl) == VAR_DECL
3508 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl)
3509 && DECL_CLASS_SCOPE_P (decl))
3510 {
3511 /* Don't try to instantiate members of dependent types. We
3512 cannot just use dependent_type_p here because this function
3513 may be called from fold_non_dependent_expr, and then we may
3514 see dependent types, even though processing_template_decl
3515 will not be set. */
3516 if (CLASSTYPE_TEMPLATE_INFO ((DECL_CONTEXT (decl)))
3517 && uses_template_parms (CLASSTYPE_TI_ARGS (DECL_CONTEXT (decl))))
3518 return;
3519 /* Pretend that we are not in a template, even if we are, so
3520 that the static data member initializer will be processed. */
3521 saved_processing_template_decl = processing_template_decl;
3522 processing_template_decl = 0;
3523 }
3524
3525 if (processing_template_decl)
3526 return;
3527
3528 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl)
3529 && !TREE_ASM_WRITTEN (decl))
3530 /* Remember it, so we can check it was defined. */
3531 {
3532 if (DECL_DEFERRED_FN (decl))
3533 return;
3534
3535 /* Remember the current location for a function we will end up
3536 synthesizing. Then we can inform the user where it was
3537 required in the case of error. */
3538 if (DECL_ARTIFICIAL (decl) && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
3539 && !DECL_THUNK_P (decl))
3540 DECL_SOURCE_LOCATION (decl) = input_location;
3541
3542 note_vague_linkage_fn (decl);
3543 }
3544
3545 assemble_external (decl);
3546
3547 /* Is it a synthesized method that needs to be synthesized? */
3548 if (TREE_CODE (decl) == FUNCTION_DECL
3549 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
3550 && DECL_ARTIFICIAL (decl)
3551 && !DECL_THUNK_P (decl)
3552 && ! DECL_INITIAL (decl)
3553 /* Kludge: don't synthesize for default args. Unfortunately this
3554 rules out initializers of namespace-scoped objects too, but
3555 it's sort-of ok if the implicit ctor or dtor decl keeps
3556 pointing to the class location. */
3557 && current_function_decl)
3558 {
3559 synthesize_method (decl);
3560 /* If we've already synthesized the method we don't need to
3561 do the instantiation test below. */
3562 }
3563 else if ((DECL_NON_THUNK_FUNCTION_P (decl) || TREE_CODE (decl) == VAR_DECL)
3564 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
3565 && (!DECL_EXPLICIT_INSTANTIATION (decl)
3566 || (TREE_CODE (decl) == FUNCTION_DECL
3567 && DECL_INLINE (DECL_TEMPLATE_RESULT
3568 (template_for_substitution (decl))))
3569 /* We need to instantiate static data members so that there
3570 initializers are available in integral constant
3571 expressions. */
3572 || (TREE_CODE (decl) == VAR_DECL
3573 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl))))
3574 /* If this is a function or variable that is an instance of some
3575 template, we now know that we will need to actually do the
3576 instantiation. We check that DECL is not an explicit
3577 instantiation because that is not checked in instantiate_decl.
3578
3579 We put off instantiating functions in order to improve compile
3580 times. Maintaining a stack of active functions is expensive,
3581 and the inliner knows to instantiate any functions it might
3582 need. Therefore, we always try to defer instantiation. */
3583 instantiate_decl (decl, /*defer_ok=*/true,
3584 /*expl_inst_class_mem_p=*/false);
3585
3586 processing_template_decl = saved_processing_template_decl;
3587}
3588
3589#include "gt-cp-decl2.h"
| 1742 else if (TREE_CODE (decl) == VAR_DECL && DECL_TINFO_P (decl))
1743 {
1744 /* tinfo visibility is based on the type it's for. */
1745 constrain_visibility
1746 (decl, type_visibility (TREE_TYPE (DECL_NAME (decl))));
1747 }
1748 else if (use_template)
1749 /* Template instantiations and specializations get visibility based
1750 on their template unless they override it with an attribute. */;
1751 else if (! DECL_VISIBILITY_SPECIFIED (decl))
1752 {
1753 /* Set default visibility to whatever the user supplied with
1754 #pragma GCC visibility or a namespace visibility attribute. */
1755 DECL_VISIBILITY (decl) = default_visibility;
1756 DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
1757 }
1758 }
1759
1760 if (use_template)
1761 {
1762 /* If the specialization doesn't specify visibility, use the
1763 visibility from the template. */
1764 tree tinfo = (TREE_CODE (decl) == TYPE_DECL
1765 ? TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
1766 : DECL_TEMPLATE_INFO (decl));
1767 tree args = TI_ARGS (tinfo);
1768
1769 if (args != error_mark_node)
1770 {
1771 int depth = TMPL_ARGS_DEPTH (args);
1772 tree pattern = DECL_TEMPLATE_RESULT (TI_TEMPLATE (tinfo));
1773
1774 if (!DECL_VISIBILITY_SPECIFIED (decl))
1775 {
1776 DECL_VISIBILITY (decl) = DECL_VISIBILITY (pattern);
1777 DECL_VISIBILITY_SPECIFIED (decl)
1778 = DECL_VISIBILITY_SPECIFIED (pattern);
1779 }
1780
1781 /* FIXME should TMPL_ARGS_DEPTH really return 1 for null input? */
1782 if (args && depth > template_class_depth (class_type))
1783 /* Limit visibility based on its template arguments. */
1784 constrain_visibility_for_template (decl, args);
1785 }
1786 }
1787
1788 if (class_type)
1789 determine_visibility_from_class (decl, class_type);
1790
1791 if (decl_anon_ns_mem_p (decl))
1792 /* Names in an anonymous namespace get internal linkage.
1793 This might change once we implement export. */
1794 constrain_visibility (decl, VISIBILITY_ANON);
1795 else if (TREE_CODE (decl) != TYPE_DECL)
1796 {
1797 /* Propagate anonymity from type to decl. */
1798 int tvis = type_visibility (TREE_TYPE (decl));
1799 if (tvis == VISIBILITY_ANON
1800 || ! DECL_VISIBILITY_SPECIFIED (decl))
1801 constrain_visibility (decl, tvis);
1802 }
1803}
1804
1805/* By default, static data members and function members receive
1806 the visibility of their containing class. */
1807
1808static void
1809determine_visibility_from_class (tree decl, tree class_type)
1810{
1811 if (visibility_options.inlines_hidden
1812 /* Don't do this for inline templates; specializations might not be
1813 inline, and we don't want them to inherit the hidden
1814 visibility. We'll set it here for all inline instantiations. */
1815 && !processing_template_decl
1816 && ! DECL_VISIBILITY_SPECIFIED (decl)
1817 && TREE_CODE (decl) == FUNCTION_DECL
1818 && DECL_DECLARED_INLINE_P (decl)
1819 && (! DECL_LANG_SPECIFIC (decl)
1820 || ! DECL_EXPLICIT_INSTANTIATION (decl)))
1821 DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
1822 else if (!DECL_VISIBILITY_SPECIFIED (decl))
1823 {
1824 /* Default to the class visibility. */
1825 DECL_VISIBILITY (decl) = CLASSTYPE_VISIBILITY (class_type);
1826 DECL_VISIBILITY_SPECIFIED (decl)
1827 = CLASSTYPE_VISIBILITY_SPECIFIED (class_type);
1828 }
1829
1830 /* Give the target a chance to override the visibility associated
1831 with DECL. */
1832 if (TREE_CODE (decl) == VAR_DECL
1833 && (DECL_TINFO_P (decl)
1834 || (DECL_VTABLE_OR_VTT_P (decl)
1835 /* Construction virtual tables are not exported because
1836 they cannot be referred to from other object files;
1837 their name is not standardized by the ABI. */
1838 && !DECL_CONSTRUCTION_VTABLE_P (decl)))
1839 && TREE_PUBLIC (decl)
1840 && !DECL_REALLY_EXTERN (decl)
1841 && !DECL_VISIBILITY_SPECIFIED (decl)
1842 && !CLASSTYPE_VISIBILITY_SPECIFIED (class_type))
1843 targetm.cxx.determine_class_data_visibility (decl);
1844}
1845
1846/* Constrain the visibility of a class TYPE based on the visibility of its
1847 field types. Warn if any fields require lesser visibility. */
1848
1849void
1850constrain_class_visibility (tree type)
1851{
1852 tree binfo;
1853 tree t;
1854 int i;
1855
1856 int vis = type_visibility (type);
1857
1858 if (vis == VISIBILITY_ANON
1859 || DECL_IN_SYSTEM_HEADER (TYPE_MAIN_DECL (type)))
1860 return;
1861
1862 /* Don't warn about visibility if the class has explicit visibility. */
1863 if (CLASSTYPE_VISIBILITY_SPECIFIED (type))
1864 vis = VISIBILITY_INTERNAL;
1865
1866 for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
1867 if (TREE_CODE (t) == FIELD_DECL && TREE_TYPE (t) != error_mark_node)
1868 {
1869 tree ftype = strip_array_types (TREE_TYPE (t));
1870 int subvis = type_visibility (ftype);
1871
1872 if (subvis == VISIBILITY_ANON)
1873 {
1874 if (!in_main_input_context ())
1875 warning (0, "\
1876%qT has a field %qD whose type uses the anonymous namespace",
1877 type, t);
1878 }
1879 else if (IS_AGGR_TYPE (ftype)
1880 && vis < VISIBILITY_HIDDEN
1881 && subvis >= VISIBILITY_HIDDEN)
1882 warning (OPT_Wattributes, "\
1883%qT declared with greater visibility than the type of its field %qD",
1884 type, t);
1885 }
1886
1887 binfo = TYPE_BINFO (type);
1888 for (i = 0; BINFO_BASE_ITERATE (binfo, i, t); ++i)
1889 {
1890 int subvis = type_visibility (TREE_TYPE (t));
1891
1892 if (subvis == VISIBILITY_ANON)
1893 {
1894 if (!in_main_input_context())
1895 warning (0, "\
1896%qT has a base %qT whose type uses the anonymous namespace",
1897 type, TREE_TYPE (t));
1898 }
1899 else if (vis < VISIBILITY_HIDDEN
1900 && subvis >= VISIBILITY_HIDDEN)
1901 warning (OPT_Wattributes, "\
1902%qT declared with greater visibility than its base %qT",
1903 type, TREE_TYPE (t));
1904 }
1905}
1906
1907/* DECL is a FUNCTION_DECL or VAR_DECL. If the object file linkage
1908 for DECL has not already been determined, do so now by setting
1909 DECL_EXTERNAL, DECL_COMDAT and other related flags. Until this
1910 function is called entities with vague linkage whose definitions
1911 are available must have TREE_PUBLIC set.
1912
1913 If this function decides to place DECL in COMDAT, it will set
1914 appropriate flags -- but will not clear DECL_EXTERNAL. It is up to
1915 the caller to decide whether or not to clear DECL_EXTERNAL. Some
1916 callers defer that decision until it is clear that DECL is actually
1917 required. */
1918
1919void
1920import_export_decl (tree decl)
1921{
1922 int emit_p;
1923 bool comdat_p;
1924 bool import_p;
1925 tree class_type = NULL_TREE;
1926
1927 if (DECL_INTERFACE_KNOWN (decl))
1928 return;
1929
1930 /* We cannot determine what linkage to give to an entity with vague
1931 linkage until the end of the file. For example, a virtual table
1932 for a class will be defined if and only if the key method is
1933 defined in this translation unit. As a further example, consider
1934 that when compiling a translation unit that uses PCH file with
1935 "-frepo" it would be incorrect to make decisions about what
1936 entities to emit when building the PCH; those decisions must be
1937 delayed until the repository information has been processed. */
1938 gcc_assert (at_eof);
1939 /* Object file linkage for explicit instantiations is handled in
1940 mark_decl_instantiated. For static variables in functions with
1941 vague linkage, maybe_commonize_var is used.
1942
1943 Therefore, the only declarations that should be provided to this
1944 function are those with external linkage that are:
1945
1946 * implicit instantiations of function templates
1947
1948 * inline function
1949
1950 * implicit instantiations of static data members of class
1951 templates
1952
1953 * virtual tables
1954
1955 * typeinfo objects
1956
1957 Furthermore, all entities that reach this point must have a
1958 definition available in this translation unit.
1959
1960 The following assertions check these conditions. */
1961 gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
1962 || TREE_CODE (decl) == VAR_DECL);
1963 /* Any code that creates entities with TREE_PUBLIC cleared should
1964 also set DECL_INTERFACE_KNOWN. */
1965 gcc_assert (TREE_PUBLIC (decl));
1966 if (TREE_CODE (decl) == FUNCTION_DECL)
1967 gcc_assert (DECL_IMPLICIT_INSTANTIATION (decl)
1968 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl)
1969 || DECL_DECLARED_INLINE_P (decl));
1970 else
1971 gcc_assert (DECL_IMPLICIT_INSTANTIATION (decl)
1972 || DECL_VTABLE_OR_VTT_P (decl)
1973 || DECL_TINFO_P (decl));
1974 /* Check that a definition of DECL is available in this translation
1975 unit. */
1976 gcc_assert (!DECL_REALLY_EXTERN (decl));
1977
1978 /* Assume that DECL will not have COMDAT linkage. */
1979 comdat_p = false;
1980 /* Assume that DECL will not be imported into this translation
1981 unit. */
1982 import_p = false;
1983
1984 /* See if the repository tells us whether or not to emit DECL in
1985 this translation unit. */
1986 emit_p = repo_emit_p (decl);
1987 if (emit_p == 0)
1988 import_p = true;
1989 else if (emit_p == 1)
1990 {
1991 /* The repository indicates that this entity should be defined
1992 here. Make sure the back end honors that request. */
1993 if (TREE_CODE (decl) == VAR_DECL)
1994 mark_needed (decl);
1995 else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)
1996 || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
1997 {
1998 tree clone;
1999 FOR_EACH_CLONE (clone, decl)
2000 mark_needed (clone);
2001 }
2002 else
2003 mark_needed (decl);
2004 /* Output the definition as an ordinary strong definition. */
2005 DECL_EXTERNAL (decl) = 0;
2006 DECL_INTERFACE_KNOWN (decl) = 1;
2007 return;
2008 }
2009
2010 if (import_p)
2011 /* We have already decided what to do with this DECL; there is no
2012 need to check anything further. */
2013 ;
2014 else if (TREE_CODE (decl) == VAR_DECL && DECL_VTABLE_OR_VTT_P (decl))
2015 {
2016 class_type = DECL_CONTEXT (decl);
2017 import_export_class (class_type);
2018 if (TYPE_FOR_JAVA (class_type))
2019 import_p = true;
2020 else if (CLASSTYPE_INTERFACE_KNOWN (class_type)
2021 && CLASSTYPE_INTERFACE_ONLY (class_type))
2022 import_p = true;
2023 else if ((!flag_weak || TARGET_WEAK_NOT_IN_ARCHIVE_TOC)
2024 && !CLASSTYPE_USE_TEMPLATE (class_type)
2025 && CLASSTYPE_KEY_METHOD (class_type)
2026 && !DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (class_type)))
2027 /* The ABI requires that all virtual tables be emitted with
2028 COMDAT linkage. However, on systems where COMDAT symbols
2029 don't show up in the table of contents for a static
2030 archive, or on systems without weak symbols (where we
2031 approximate COMDAT linkage by using internal linkage), the
2032 linker will report errors about undefined symbols because
2033 it will not see the virtual table definition. Therefore,
2034 in the case that we know that the virtual table will be
2035 emitted in only one translation unit, we make the virtual
2036 table an ordinary definition with external linkage. */
2037 DECL_EXTERNAL (decl) = 0;
2038 else if (CLASSTYPE_INTERFACE_KNOWN (class_type))
2039 {
2040 /* CLASS_TYPE is being exported from this translation unit,
2041 so DECL should be defined here. */
2042 if (!flag_weak && CLASSTYPE_EXPLICIT_INSTANTIATION (class_type))
2043 /* If a class is declared in a header with the "extern
2044 template" extension, then it will not be instantiated,
2045 even in translation units that would normally require
2046 it. Often such classes are explicitly instantiated in
2047 one translation unit. Therefore, the explicit
2048 instantiation must be made visible to other translation
2049 units. */
2050 DECL_EXTERNAL (decl) = 0;
2051 else
2052 {
2053 /* The generic C++ ABI says that class data is always
2054 COMDAT, even if there is a key function. Some
2055 variants (e.g., the ARM EABI) says that class data
2056 only has COMDAT linkage if the class data might be
2057 emitted in more than one translation unit. When the
2058 key method can be inline and is inline, we still have
2059 to arrange for comdat even though
2060 class_data_always_comdat is false. */
2061 if (!CLASSTYPE_KEY_METHOD (class_type)
2062 || DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (class_type))
2063 || targetm.cxx.class_data_always_comdat ())
2064 {
2065 /* The ABI requires COMDAT linkage. Normally, we
2066 only emit COMDAT things when they are needed;
2067 make sure that we realize that this entity is
2068 indeed needed. */
2069 comdat_p = true;
2070 mark_needed (decl);
2071 }
2072 }
2073 }
2074 else if (!flag_implicit_templates
2075 && CLASSTYPE_IMPLICIT_INSTANTIATION (class_type))
2076 import_p = true;
2077 else
2078 comdat_p = true;
2079 }
2080 else if (TREE_CODE (decl) == VAR_DECL && DECL_TINFO_P (decl))
2081 {
2082 tree type = TREE_TYPE (DECL_NAME (decl));
2083 if (CLASS_TYPE_P (type))
2084 {
2085 class_type = type;
2086 import_export_class (type);
2087 if (CLASSTYPE_INTERFACE_KNOWN (type)
2088 && TYPE_POLYMORPHIC_P (type)
2089 && CLASSTYPE_INTERFACE_ONLY (type)
2090 /* If -fno-rtti was specified, then we cannot be sure
2091 that RTTI information will be emitted with the
2092 virtual table of the class, so we must emit it
2093 wherever it is used. */
2094 && flag_rtti)
2095 import_p = true;
2096 else
2097 {
2098 if (CLASSTYPE_INTERFACE_KNOWN (type)
2099 && !CLASSTYPE_INTERFACE_ONLY (type))
2100 {
2101 comdat_p = (targetm.cxx.class_data_always_comdat ()
2102 || (CLASSTYPE_KEY_METHOD (type)
2103 && DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (type))));
2104 mark_needed (decl);
2105 if (!flag_weak)
2106 {
2107 comdat_p = false;
2108 DECL_EXTERNAL (decl) = 0;
2109 }
2110 }
2111 else
2112 comdat_p = true;
2113 }
2114 }
2115 else
2116 comdat_p = true;
2117 }
2118 else if (DECL_TEMPLATE_INSTANTIATION (decl)
2119 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2120 {
2121 /* DECL is an implicit instantiation of a function or static
2122 data member. */
2123 if (flag_implicit_templates
2124 || (flag_implicit_inline_templates
2125 && TREE_CODE (decl) == FUNCTION_DECL
2126 && DECL_DECLARED_INLINE_P (decl)))
2127 comdat_p = true;
2128 else
2129 /* If we are not implicitly generating templates, then mark
2130 this entity as undefined in this translation unit. */
2131 import_p = true;
2132 }
2133 else if (DECL_FUNCTION_MEMBER_P (decl))
2134 {
2135 if (!DECL_DECLARED_INLINE_P (decl))
2136 {
2137 tree ctype = DECL_CONTEXT (decl);
2138 import_export_class (ctype);
2139 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
2140 {
2141 DECL_NOT_REALLY_EXTERN (decl)
2142 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2143 || (DECL_DECLARED_INLINE_P (decl)
2144 && ! flag_implement_inlines
2145 && !DECL_VINDEX (decl)));
2146
2147 if (!DECL_NOT_REALLY_EXTERN (decl))
2148 DECL_EXTERNAL (decl) = 1;
2149
2150 /* Always make artificials weak. */
2151 if (DECL_ARTIFICIAL (decl) && flag_weak)
2152 comdat_p = true;
2153 else
2154 maybe_make_one_only (decl);
2155 }
2156 }
2157 else
2158 comdat_p = true;
2159 }
2160 else
2161 comdat_p = true;
2162
2163 if (import_p)
2164 {
2165 /* If we are importing DECL into this translation unit, mark is
2166 an undefined here. */
2167 DECL_EXTERNAL (decl) = 1;
2168 DECL_NOT_REALLY_EXTERN (decl) = 0;
2169 }
2170 else if (comdat_p)
2171 {
2172 /* If we decided to put DECL in COMDAT, mark it accordingly at
2173 this point. */
2174 comdat_linkage (decl);
2175 }
2176
2177 DECL_INTERFACE_KNOWN (decl) = 1;
2178}
2179
2180/* Return an expression that performs the destruction of DECL, which
2181 must be a VAR_DECL whose type has a non-trivial destructor, or is
2182 an array whose (innermost) elements have a non-trivial destructor. */
2183
2184tree
2185build_cleanup (tree decl)
2186{
2187 tree temp;
2188 tree type = TREE_TYPE (decl);
2189
2190 /* This function should only be called for declarations that really
2191 require cleanups. */
2192 gcc_assert (!TYPE_HAS_TRIVIAL_DESTRUCTOR (type));
2193
2194 /* Treat all objects with destructors as used; the destructor may do
2195 something substantive. */
2196 mark_used (decl);
2197
2198 if (TREE_CODE (type) == ARRAY_TYPE)
2199 temp = decl;
2200 else
2201 {
2202 cxx_mark_addressable (decl);
2203 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
2204 }
2205 temp = build_delete (TREE_TYPE (temp), temp,
2206 sfk_complete_destructor,
2207 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
2208 return temp;
2209}
2210
2211/* Returns the initialization guard variable for the variable DECL,
2212 which has static storage duration. */
2213
2214tree
2215get_guard (tree decl)
2216{
2217 tree sname;
2218 tree guard;
2219
2220 sname = mangle_guard_variable (decl);
2221 guard = IDENTIFIER_GLOBAL_VALUE (sname);
2222 if (! guard)
2223 {
2224 tree guard_type;
2225
2226 /* We use a type that is big enough to contain a mutex as well
2227 as an integer counter. */
2228 guard_type = targetm.cxx.guard_type ();
2229 guard = build_decl (VAR_DECL, sname, guard_type);
2230
2231 /* The guard should have the same linkage as what it guards. */
2232 TREE_PUBLIC (guard) = TREE_PUBLIC (decl);
2233 TREE_STATIC (guard) = TREE_STATIC (decl);
2234 DECL_COMMON (guard) = DECL_COMMON (decl);
2235 DECL_ONE_ONLY (guard) = DECL_ONE_ONLY (decl);
2236 if (TREE_PUBLIC (decl))
2237 DECL_WEAK (guard) = DECL_WEAK (decl);
2238
2239 DECL_ARTIFICIAL (guard) = 1;
2240 DECL_IGNORED_P (guard) = 1;
2241 TREE_USED (guard) = 1;
2242 pushdecl_top_level_and_finish (guard, NULL_TREE);
2243 }
2244 return guard;
2245}
2246
2247/* Return those bits of the GUARD variable that should be set when the
2248 guarded entity is actually initialized. */
2249
2250static tree
2251get_guard_bits (tree guard)
2252{
2253 if (!targetm.cxx.guard_mask_bit ())
2254 {
2255 /* We only set the first byte of the guard, in order to leave room
2256 for a mutex in the high-order bits. */
2257 guard = build1 (ADDR_EXPR,
2258 build_pointer_type (TREE_TYPE (guard)),
2259 guard);
2260 guard = build1 (NOP_EXPR,
2261 build_pointer_type (char_type_node),
2262 guard);
2263 guard = build1 (INDIRECT_REF, char_type_node, guard);
2264 }
2265
2266 return guard;
2267}
2268
2269/* Return an expression which determines whether or not the GUARD
2270 variable has already been initialized. */
2271
2272tree
2273get_guard_cond (tree guard)
2274{
2275 tree guard_value;
2276
2277 /* Check to see if the GUARD is zero. */
2278 guard = get_guard_bits (guard);
2279
2280 /* Mask off all but the low bit. */
2281 if (targetm.cxx.guard_mask_bit ())
2282 {
2283 guard_value = integer_one_node;
2284 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
2285 guard_value = convert (TREE_TYPE (guard), guard_value);
2286 guard = cp_build_binary_op (BIT_AND_EXPR, guard, guard_value);
2287 }
2288
2289 guard_value = integer_zero_node;
2290 if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
2291 guard_value = convert (TREE_TYPE (guard), guard_value);
2292 return cp_build_binary_op (EQ_EXPR, guard, guard_value);
2293}
2294
2295/* Return an expression which sets the GUARD variable, indicating that
2296 the variable being guarded has been initialized. */
2297
2298tree
2299set_guard (tree guard)
2300{
2301 tree guard_init;
2302
2303 /* Set the GUARD to one. */
2304 guard = get_guard_bits (guard);
2305 guard_init = integer_one_node;
2306 if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard)))
2307 guard_init = convert (TREE_TYPE (guard), guard_init);
2308 return build_modify_expr (guard, NOP_EXPR, guard_init);
2309}
2310
2311/* Start the process of running a particular set of global constructors
2312 or destructors. Subroutine of do_[cd]tors. */
2313
2314static tree
2315start_objects (int method_type, int initp)
2316{
2317 tree body;
2318 tree fndecl;
2319 char type[10];
2320
2321 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2322
2323 if (initp != DEFAULT_INIT_PRIORITY)
2324 {
2325 char joiner;
2326
2327#ifdef JOINER
2328 joiner = JOINER;
2329#else
2330 joiner = '_';
2331#endif
2332
2333 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
2334 }
2335 else
2336 sprintf (type, "%c", method_type);
2337
2338 fndecl = build_lang_decl (FUNCTION_DECL,
2339 get_file_function_name (type),
2340 build_function_type (void_type_node,
2341 void_list_node));
2342 start_preparsed_function (fndecl, /*attrs=*/NULL_TREE, SF_PRE_PARSED);
2343
2344 /* It can be a static function as long as collect2 does not have
2345 to scan the object file to find its ctor/dtor routine. */
2346 TREE_PUBLIC (current_function_decl) = ! targetm.have_ctors_dtors;
2347
2348 /* Mark as artificial because it's not explicitly in the user's
2349 source code. */
2350 DECL_ARTIFICIAL (current_function_decl) = 1;
2351
2352 /* Mark this declaration as used to avoid spurious warnings. */
2353 TREE_USED (current_function_decl) = 1;
2354
2355 /* Mark this function as a global constructor or destructor. */
2356 if (method_type == 'I')
2357 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
2358 else
2359 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
2360 DECL_LANG_SPECIFIC (current_function_decl)->decl_flags.u2sel = 1;
2361
2362 body = begin_compound_stmt (BCS_FN_BODY);
2363
2364 /* We cannot allow these functions to be elided, even if they do not
2365 have external linkage. And, there's no point in deferring
2366 compilation of these functions; they're all going to have to be
2367 out anyhow. */
2368 DECL_INLINE (current_function_decl) = 0;
2369 DECL_UNINLINABLE (current_function_decl) = 1;
2370
2371 return body;
2372}
2373
2374/* Finish the process of running a particular set of global constructors
2375 or destructors. Subroutine of do_[cd]tors. */
2376
2377static void
2378finish_objects (int method_type, int initp, tree body)
2379{
2380 tree fn;
2381
2382 /* Finish up. */
2383 finish_compound_stmt (body);
2384 fn = finish_function (0);
2385 expand_or_defer_fn (fn);
2386
2387 /* When only doing semantic analysis, and no RTL generation, we
2388 can't call functions that directly emit assembly code; there is
2389 no assembly file in which to put the code. */
2390 if (flag_syntax_only)
2391 return;
2392
2393 if (targetm.have_ctors_dtors)
2394 {
2395 rtx fnsym = XEXP (DECL_RTL (fn), 0);
2396 cgraph_mark_needed_node (cgraph_node (fn));
2397 if (method_type == 'I')
2398 (* targetm.asm_out.constructor) (fnsym, initp);
2399 else
2400 (* targetm.asm_out.destructor) (fnsym, initp);
2401 }
2402}
2403
2404/* The names of the parameters to the function created to handle
2405 initializations and destructions for objects with static storage
2406 duration. */
2407#define INITIALIZE_P_IDENTIFIER "__initialize_p"
2408#define PRIORITY_IDENTIFIER "__priority"
2409
2410/* The name of the function we create to handle initializations and
2411 destructions for objects with static storage duration. */
2412#define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2413
2414/* The declaration for the __INITIALIZE_P argument. */
2415static GTY(()) tree initialize_p_decl;
2416
2417/* The declaration for the __PRIORITY argument. */
2418static GTY(()) tree priority_decl;
2419
2420/* The declaration for the static storage duration function. */
2421static GTY(()) tree ssdf_decl;
2422
2423/* All the static storage duration functions created in this
2424 translation unit. */
2425static GTY(()) VEC(tree,gc) *ssdf_decls;
2426
2427/* A map from priority levels to information about that priority
2428 level. There may be many such levels, so efficient lookup is
2429 important. */
2430static splay_tree priority_info_map;
2431
2432/* Begins the generation of the function that will handle all
2433 initialization and destruction of objects with static storage
2434 duration. The function generated takes two parameters of type
2435 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2436 nonzero, it performs initializations. Otherwise, it performs
2437 destructions. It only performs those initializations or
2438 destructions with the indicated __PRIORITY. The generated function
2439 returns no value.
2440
2441 It is assumed that this function will only be called once per
2442 translation unit. */
2443
2444static tree
2445start_static_storage_duration_function (unsigned count)
2446{
2447 tree parm_types;
2448 tree type;
2449 tree body;
2450 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2451
2452 /* Create the identifier for this function. It will be of the form
2453 SSDF_IDENTIFIER_<number>. */
2454 sprintf (id, "%s_%u", SSDF_IDENTIFIER, count);
2455
2456 /* Create the parameters. */
2457 parm_types = void_list_node;
2458 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2459 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2460 type = build_function_type (void_type_node, parm_types);
2461
2462 /* Create the FUNCTION_DECL itself. */
2463 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2464 get_identifier (id),
2465 type);
2466 TREE_PUBLIC (ssdf_decl) = 0;
2467 DECL_ARTIFICIAL (ssdf_decl) = 1;
2468
2469 /* Put this function in the list of functions to be called from the
2470 static constructors and destructors. */
2471 if (!ssdf_decls)
2472 {
2473 ssdf_decls = VEC_alloc (tree, gc, 32);
2474
2475 /* Take this opportunity to initialize the map from priority
2476 numbers to information about that priority level. */
2477 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2478 /*delete_key_fn=*/0,
2479 /*delete_value_fn=*/
2480 (splay_tree_delete_value_fn) &free);
2481
2482 /* We always need to generate functions for the
2483 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2484 priorities later, we'll be sure to find the
2485 DEFAULT_INIT_PRIORITY. */
2486 get_priority_info (DEFAULT_INIT_PRIORITY);
2487 }
2488
2489 VEC_safe_push (tree, gc, ssdf_decls, ssdf_decl);
2490
2491 /* Create the argument list. */
2492 initialize_p_decl = cp_build_parm_decl
2493 (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node);
2494 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2495 TREE_USED (initialize_p_decl) = 1;
2496 priority_decl = cp_build_parm_decl
2497 (get_identifier (PRIORITY_IDENTIFIER), integer_type_node);
2498 DECL_CONTEXT (priority_decl) = ssdf_decl;
2499 TREE_USED (priority_decl) = 1;
2500
2501 TREE_CHAIN (initialize_p_decl) = priority_decl;
2502 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2503
2504 /* Put the function in the global scope. */
2505 pushdecl (ssdf_decl);
2506
2507 /* Start the function itself. This is equivalent to declaring the
2508 function as:
2509
2510 static void __ssdf (int __initialize_p, init __priority_p);
2511
2512 It is static because we only need to call this function from the
2513 various constructor and destructor functions for this module. */
2514 start_preparsed_function (ssdf_decl,
2515 /*attrs=*/NULL_TREE,
2516 SF_PRE_PARSED);
2517
2518 /* Set up the scope of the outermost block in the function. */
2519 body = begin_compound_stmt (BCS_FN_BODY);
2520
2521 /* This function must not be deferred because we are depending on
2522 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
2523 DECL_INLINE (ssdf_decl) = 0;
2524 DECL_UNINLINABLE (ssdf_decl) = 1;
2525
2526 return body;
2527}
2528
2529/* Finish the generation of the function which performs initialization
2530 and destruction of objects with static storage duration. After
2531 this point, no more such objects can be created. */
2532
2533static void
2534finish_static_storage_duration_function (tree body)
2535{
2536 /* Close out the function. */
2537 finish_compound_stmt (body);
2538 expand_or_defer_fn (finish_function (0));
2539}
2540
2541/* Return the information about the indicated PRIORITY level. If no
2542 code to handle this level has yet been generated, generate the
2543 appropriate prologue. */
2544
2545static priority_info
2546get_priority_info (int priority)
2547{
2548 priority_info pi;
2549 splay_tree_node n;
2550
2551 n = splay_tree_lookup (priority_info_map,
2552 (splay_tree_key) priority);
2553 if (!n)
2554 {
2555 /* Create a new priority information structure, and insert it
2556 into the map. */
2557 pi = XNEW (struct priority_info_s);
2558 pi->initializations_p = 0;
2559 pi->destructions_p = 0;
2560 splay_tree_insert (priority_info_map,
2561 (splay_tree_key) priority,
2562 (splay_tree_value) pi);
2563 }
2564 else
2565 pi = (priority_info) n->value;
2566
2567 return pi;
2568}
2569
2570/* The effective initialization priority of a DECL. */
2571
2572#define DECL_EFFECTIVE_INIT_PRIORITY(decl) \
2573 ((!DECL_HAS_INIT_PRIORITY_P (decl) || DECL_INIT_PRIORITY (decl) == 0) \
2574 ? DEFAULT_INIT_PRIORITY : DECL_INIT_PRIORITY (decl))
2575
2576/* Whether a DECL needs a guard to protect it against multiple
2577 initialization. */
2578
2579#define NEEDS_GUARD_P(decl) (TREE_PUBLIC (decl) && (DECL_COMMON (decl) \
2580 || DECL_ONE_ONLY (decl) \
2581 || DECL_WEAK (decl)))
2582
2583/* Set up to handle the initialization or destruction of DECL. If
2584 INITP is nonzero, we are initializing the variable. Otherwise, we
2585 are destroying it. */
2586
2587static void
2588one_static_initialization_or_destruction (tree decl, tree init, bool initp)
2589{
2590 tree guard_if_stmt = NULL_TREE;
2591 tree guard;
2592
2593 /* If we are supposed to destruct and there's a trivial destructor,
2594 nothing has to be done. */
2595 if (!initp
2596 && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2597 return;
2598
2599 /* Trick the compiler into thinking we are at the file and line
2600 where DECL was declared so that error-messages make sense, and so
2601 that the debugger will show somewhat sensible file and line
2602 information. */
2603 input_location = DECL_SOURCE_LOCATION (decl);
2604
2605 /* Because of:
2606
2607 [class.access.spec]
2608
2609 Access control for implicit calls to the constructors,
2610 the conversion functions, or the destructor called to
2611 create and destroy a static data member is performed as
2612 if these calls appeared in the scope of the member's
2613 class.
2614
2615 we pretend we are in a static member function of the class of
2616 which the DECL is a member. */
2617 if (member_p (decl))
2618 {
2619 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
2620 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
2621 }
2622
2623 /* Assume we don't need a guard. */
2624 guard = NULL_TREE;
2625 /* We need a guard if this is an object with external linkage that
2626 might be initialized in more than one place. (For example, a
2627 static data member of a template, when the data member requires
2628 construction.) */
2629 if (NEEDS_GUARD_P (decl))
2630 {
2631 tree guard_cond;
2632
2633 guard = get_guard (decl);
2634
2635 /* When using __cxa_atexit, we just check the GUARD as we would
2636 for a local static. */
2637 if (flag_use_cxa_atexit)
2638 {
2639 /* When using __cxa_atexit, we never try to destroy
2640 anything from a static destructor. */
2641 gcc_assert (initp);
2642 guard_cond = get_guard_cond (guard);
2643 }
2644 /* If we don't have __cxa_atexit, then we will be running
2645 destructors from .fini sections, or their equivalents. So,
2646 we need to know how many times we've tried to initialize this
2647 object. We do initializations only if the GUARD is zero,
2648 i.e., if we are the first to initialize the variable. We do
2649 destructions only if the GUARD is one, i.e., if we are the
2650 last to destroy the variable. */
2651 else if (initp)
2652 guard_cond
2653 = cp_build_binary_op (EQ_EXPR,
2654 build_unary_op (PREINCREMENT_EXPR,
2655 guard,
2656 /*noconvert=*/1),
2657 integer_one_node);
2658 else
2659 guard_cond
2660 = cp_build_binary_op (EQ_EXPR,
2661 build_unary_op (PREDECREMENT_EXPR,
2662 guard,
2663 /*noconvert=*/1),
2664 integer_zero_node);
2665
2666 guard_if_stmt = begin_if_stmt ();
2667 finish_if_stmt_cond (guard_cond, guard_if_stmt);
2668 }
2669
2670
2671 /* If we're using __cxa_atexit, we have not already set the GUARD,
2672 so we must do so now. */
2673 if (guard && initp && flag_use_cxa_atexit)
2674 finish_expr_stmt (set_guard (guard));
2675
2676 /* Perform the initialization or destruction. */
2677 if (initp)
2678 {
2679 if (init)
2680 finish_expr_stmt (init);
2681
2682 /* If we're using __cxa_atexit, register a function that calls the
2683 destructor for the object. */
2684 if (flag_use_cxa_atexit)
2685 finish_expr_stmt (register_dtor_fn (decl));
2686 }
2687 else
2688 finish_expr_stmt (build_cleanup (decl));
2689
2690 /* Finish the guard if-stmt, if necessary. */
2691 if (guard)
2692 {
2693 finish_then_clause (guard_if_stmt);
2694 finish_if_stmt (guard_if_stmt);
2695 }
2696
2697 /* Now that we're done with DECL we don't need to pretend to be a
2698 member of its class any longer. */
2699 DECL_CONTEXT (current_function_decl) = NULL_TREE;
2700 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
2701}
2702
2703/* Generate code to do the initialization or destruction of the decls in VARS,
2704 a TREE_LIST of VAR_DECL with static storage duration.
2705 Whether initialization or destruction is performed is specified by INITP. */
2706
2707static void
2708do_static_initialization_or_destruction (tree vars, bool initp)
2709{
2710 tree node, init_if_stmt, cond;
2711
2712 /* Build the outer if-stmt to check for initialization or destruction. */
2713 init_if_stmt = begin_if_stmt ();
2714 cond = initp ? integer_one_node : integer_zero_node;
2715 cond = cp_build_binary_op (EQ_EXPR,
2716 initialize_p_decl,
2717 cond);
2718 finish_if_stmt_cond (cond, init_if_stmt);
2719
2720 node = vars;
2721 do {
2722 tree decl = TREE_VALUE (node);
2723 tree priority_if_stmt;
2724 int priority;
2725 priority_info pi;
2726
2727 /* If we don't need a destructor, there's nothing to do. Avoid
2728 creating a possibly empty if-stmt. */
2729 if (!initp && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2730 {
2731 node = TREE_CHAIN (node);
2732 continue;
2733 }
2734
2735 /* Remember that we had an initialization or finalization at this
2736 priority. */
2737 priority = DECL_EFFECTIVE_INIT_PRIORITY (decl);
2738 pi = get_priority_info (priority);
2739 if (initp)
2740 pi->initializations_p = 1;
2741 else
2742 pi->destructions_p = 1;
2743
2744 /* Conditionalize this initialization on being in the right priority
2745 and being initializing/finalizing appropriately. */
2746 priority_if_stmt = begin_if_stmt ();
2747 cond = cp_build_binary_op (EQ_EXPR,
2748 priority_decl,
2749 build_int_cst (NULL_TREE, priority));
2750 finish_if_stmt_cond (cond, priority_if_stmt);
2751
2752 /* Process initializers with same priority. */
2753 for (; node
2754 && DECL_EFFECTIVE_INIT_PRIORITY (TREE_VALUE (node)) == priority;
2755 node = TREE_CHAIN (node))
2756 /* Do one initialization or destruction. */
2757 one_static_initialization_or_destruction (TREE_VALUE (node),
2758 TREE_PURPOSE (node), initp);
2759
2760 /* Finish up the priority if-stmt body. */
2761 finish_then_clause (priority_if_stmt);
2762 finish_if_stmt (priority_if_stmt);
2763
2764 } while (node);
2765
2766 /* Finish up the init/destruct if-stmt body. */
2767 finish_then_clause (init_if_stmt);
2768 finish_if_stmt (init_if_stmt);
2769}
2770
2771/* VARS is a list of variables with static storage duration which may
2772 need initialization and/or finalization. Remove those variables
2773 that don't really need to be initialized or finalized, and return
2774 the resulting list. The order in which the variables appear in
2775 VARS is in reverse order of the order in which they should actually
2776 be initialized. The list we return is in the unreversed order;
2777 i.e., the first variable should be initialized first. */
2778
2779static tree
2780prune_vars_needing_no_initialization (tree *vars)
2781{
2782 tree *var = vars;
2783 tree result = NULL_TREE;
2784
2785 while (*var)
2786 {
2787 tree t = *var;
2788 tree decl = TREE_VALUE (t);
2789 tree init = TREE_PURPOSE (t);
2790
2791 /* Deal gracefully with error. */
2792 if (decl == error_mark_node)
2793 {
2794 var = &TREE_CHAIN (t);
2795 continue;
2796 }
2797
2798 /* The only things that can be initialized are variables. */
2799 gcc_assert (TREE_CODE (decl) == VAR_DECL);
2800
2801 /* If this object is not defined, we don't need to do anything
2802 here. */
2803 if (DECL_EXTERNAL (decl))
2804 {
2805 var = &TREE_CHAIN (t);
2806 continue;
2807 }
2808
2809 /* Also, if the initializer already contains errors, we can bail
2810 out now. */
2811 if (init && TREE_CODE (init) == TREE_LIST
2812 && value_member (error_mark_node, init))
2813 {
2814 var = &TREE_CHAIN (t);
2815 continue;
2816 }
2817
2818 /* This variable is going to need initialization and/or
2819 finalization, so we add it to the list. */
2820 *var = TREE_CHAIN (t);
2821 TREE_CHAIN (t) = result;
2822 result = t;
2823 }
2824
2825 return result;
2826}
2827
2828/* Make sure we have told the back end about all the variables in
2829 VARS. */
2830
2831static void
2832write_out_vars (tree vars)
2833{
2834 tree v;
2835
2836 for (v = vars; v; v = TREE_CHAIN (v))
2837 {
2838 tree var = TREE_VALUE (v);
2839 if (!var_finalized_p (var))
2840 {
2841 import_export_decl (var);
2842 rest_of_decl_compilation (var, 1, 1);
2843 }
2844 }
2845}
2846
2847/* Generate a static constructor (if CONSTRUCTOR_P) or destructor
2848 (otherwise) that will initialize all gobal objects with static
2849 storage duration having the indicated PRIORITY. */
2850
2851static void
2852generate_ctor_or_dtor_function (bool constructor_p, int priority,
2853 location_t *locus)
2854{
2855 char function_key;
2856 tree arguments;
2857 tree fndecl;
2858 tree body;
2859 size_t i;
2860
2861 input_location = *locus;
2862#ifdef USE_MAPPED_LOCATION
2863 /* ??? */
2864#else
2865 locus->line++;
2866#endif
2867
2868 /* We use `I' to indicate initialization and `D' to indicate
2869 destruction. */
2870 function_key = constructor_p ? 'I' : 'D';
2871
2872 /* We emit the function lazily, to avoid generating empty
2873 global constructors and destructors. */
2874 body = NULL_TREE;
2875
2876 /* For Objective-C++, we may need to initialize metadata found in this module.
2877 This must be done _before_ any other static initializations. */
2878 if (c_dialect_objc () && (priority == DEFAULT_INIT_PRIORITY)
2879 && constructor_p && objc_static_init_needed_p ())
2880 {
2881 body = start_objects (function_key, priority);
2882 static_ctors = objc_generate_static_init_call (static_ctors);
2883 }
2884
2885 /* Call the static storage duration function with appropriate
2886 arguments. */
2887 for (i = 0; VEC_iterate (tree, ssdf_decls, i, fndecl); ++i)
2888 {
2889 /* Calls to pure or const functions will expand to nothing. */
2890 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2891 {
2892 if (! body)
2893 body = start_objects (function_key, priority);
2894
2895 arguments = tree_cons (NULL_TREE,
2896 build_int_cst (NULL_TREE, priority),
2897 NULL_TREE);
2898 arguments = tree_cons (NULL_TREE,
2899 build_int_cst (NULL_TREE, constructor_p),
2900 arguments);
2901 finish_expr_stmt (build_function_call (fndecl, arguments));
2902 }
2903 }
2904
2905 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
2906 calls to any functions marked with attributes indicating that
2907 they should be called at initialization- or destruction-time. */
2908 if (priority == DEFAULT_INIT_PRIORITY)
2909 {
2910 tree fns;
2911
2912 for (fns = constructor_p ? static_ctors : static_dtors;
2913 fns;
2914 fns = TREE_CHAIN (fns))
2915 {
2916 fndecl = TREE_VALUE (fns);
2917
2918 /* Calls to pure/const functions will expand to nothing. */
2919 if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2920 {
2921 if (! body)
2922 body = start_objects (function_key, priority);
2923 finish_expr_stmt (build_function_call (fndecl, NULL_TREE));
2924 }
2925 }
2926 }
2927
2928 /* Close out the function. */
2929 if (body)
2930 finish_objects (function_key, priority, body);
2931}
2932
2933/* Generate constructor and destructor functions for the priority
2934 indicated by N. */
2935
2936static int
2937generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data)
2938{
2939 location_t *locus = (location_t *) data;
2940 int priority = (int) n->key;
2941 priority_info pi = (priority_info) n->value;
2942
2943 /* Generate the functions themselves, but only if they are really
2944 needed. */
2945 if (pi->initializations_p
2946 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
2947 generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus);
2948 if (pi->destructions_p
2949 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
2950 generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus);
2951
2952 /* Keep iterating. */
2953 return 0;
2954}
2955
2956/* Called via LANGHOOK_CALLGRAPH_ANALYZE_EXPR. It is supposed to mark
2957 decls referenced from frontend specific constructs; it will be called
2958 only for language-specific tree nodes.
2959
2960 Here we must deal with member pointers. */
2961
2962tree
2963cxx_callgraph_analyze_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2964 tree from ATTRIBUTE_UNUSED)
2965{
2966 tree t = *tp;
2967
2968 switch (TREE_CODE (t))
2969 {
2970 case PTRMEM_CST:
2971 if (TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
2972 cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t)));
2973 break;
2974 case BASELINK:
2975 if (TREE_CODE (BASELINK_FUNCTIONS (t)) == FUNCTION_DECL)
2976 cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t)));
2977 break;
2978 case VAR_DECL:
2979 if (DECL_VTABLE_OR_VTT_P (t))
2980 {
2981 /* The ABI requires that all virtual tables be emitted
2982 whenever one of them is. */
2983 tree vtbl;
2984 for (vtbl = CLASSTYPE_VTABLES (DECL_CONTEXT (t));
2985 vtbl;
2986 vtbl = TREE_CHAIN (vtbl))
2987 mark_decl_referenced (vtbl);
2988 }
2989 else if (DECL_CONTEXT (t)
2990 && TREE_CODE (DECL_CONTEXT (t)) == FUNCTION_DECL)
2991 /* If we need a static variable in a function, then we
2992 need the containing function. */
2993 mark_decl_referenced (DECL_CONTEXT (t));
2994 break;
2995 default:
2996 break;
2997 }
2998
2999 return NULL;
3000}
3001
3002/* Java requires that we be able to reference a local address for a
3003 method, and not be confused by PLT entries. If hidden aliases are
3004 supported, emit one for each java function that we've emitted. */
3005
3006static void
3007build_java_method_aliases (void)
3008{
3009 struct cgraph_node *node;
3010
3011#ifndef HAVE_GAS_HIDDEN
3012 return;
3013#endif
3014
3015 for (node = cgraph_nodes; node ; node = node->next)
3016 {
3017 tree fndecl = node->decl;
3018
3019 if (TREE_ASM_WRITTEN (fndecl)
3020 && DECL_CONTEXT (fndecl)
3021 && TYPE_P (DECL_CONTEXT (fndecl))
3022 && TYPE_FOR_JAVA (DECL_CONTEXT (fndecl))
3023 && TARGET_USE_LOCAL_THUNK_ALIAS_P (fndecl))
3024 {
3025 /* Mangle the name in a predictable way; we need to reference
3026 this from a java compiled object file. */
3027 tree oid, nid, alias;
3028 const char *oname;
3029 char *nname;
3030
3031 oid = DECL_ASSEMBLER_NAME (fndecl);
3032 oname = IDENTIFIER_POINTER (oid);
3033 gcc_assert (oname[0] == '_' && oname[1] == 'Z');
3034 nname = ACONCAT (("_ZGA", oname+2, NULL));
3035 nid = get_identifier (nname);
3036
3037 alias = make_alias_for (fndecl, nid);
3038 TREE_PUBLIC (alias) = 1;
3039 DECL_VISIBILITY (alias) = VISIBILITY_HIDDEN;
3040
3041 assemble_alias (alias, oid);
3042 }
3043 }
3044}
3045
3046/* This routine is called from the last rule in yyparse ().
3047 Its job is to create all the code needed to initialize and
3048 destroy the global aggregates. We do the destruction
3049 first, since that way we only need to reverse the decls once. */
3050
3051void
3052cp_finish_file (void)
3053{
3054 tree vars;
3055 bool reconsider;
3056 size_t i;
3057 location_t locus;
3058 unsigned ssdf_count = 0;
3059 int retries = 0;
3060 tree decl;
3061
3062 locus = input_location;
3063 at_eof = 1;
3064
3065 /* Bad parse errors. Just forget about it. */
3066 if (! global_bindings_p () || current_class_type || decl_namespace_list)
3067 return;
3068
3069 if (pch_file)
3070 c_common_write_pch ();
3071
3072#ifdef USE_MAPPED_LOCATION
3073 /* FIXME - huh? */
3074#else
3075 /* Otherwise, GDB can get confused, because in only knows
3076 about source for LINENO-1 lines. */
3077 input_line -= 1;
3078#endif
3079
3080 /* We now have to write out all the stuff we put off writing out.
3081 These include:
3082
3083 o Template specializations that we have not yet instantiated,
3084 but which are needed.
3085 o Initialization and destruction for non-local objects with
3086 static storage duration. (Local objects with static storage
3087 duration are initialized when their scope is first entered,
3088 and are cleaned up via atexit.)
3089 o Virtual function tables.
3090
3091 All of these may cause others to be needed. For example,
3092 instantiating one function may cause another to be needed, and
3093 generating the initializer for an object may cause templates to be
3094 instantiated, etc., etc. */
3095
3096 timevar_push (TV_VARCONST);
3097
3098 emit_support_tinfos ();
3099
3100 do
3101 {
3102 tree t;
3103 tree decl;
3104
3105 reconsider = false;
3106
3107 /* If there are templates that we've put off instantiating, do
3108 them now. */
3109 instantiate_pending_templates (retries);
3110 ggc_collect ();
3111
3112 /* Write out virtual tables as required. Note that writing out
3113 the virtual table for a template class may cause the
3114 instantiation of members of that class. If we write out
3115 vtables then we remove the class from our list so we don't
3116 have to look at it again. */
3117
3118 while (keyed_classes != NULL_TREE
3119 && maybe_emit_vtables (TREE_VALUE (keyed_classes)))
3120 {
3121 reconsider = true;
3122 keyed_classes = TREE_CHAIN (keyed_classes);
3123 }
3124
3125 t = keyed_classes;
3126 if (t != NULL_TREE)
3127 {
3128 tree next = TREE_CHAIN (t);
3129
3130 while (next)
3131 {
3132 if (maybe_emit_vtables (TREE_VALUE (next)))
3133 {
3134 reconsider = true;
3135 TREE_CHAIN (t) = TREE_CHAIN (next);
3136 }
3137 else
3138 t = next;
3139
3140 next = TREE_CHAIN (t);
3141 }
3142 }
3143
3144 /* Write out needed type info variables. We have to be careful
3145 looping through unemitted decls, because emit_tinfo_decl may
3146 cause other variables to be needed. New elements will be
3147 appended, and we remove from the vector those that actually
3148 get emitted. */
3149 for (i = VEC_length (tree, unemitted_tinfo_decls);
3150 VEC_iterate (tree, unemitted_tinfo_decls, --i, t);)
3151 if (emit_tinfo_decl (t))
3152 {
3153 reconsider = true;
3154 VEC_unordered_remove (tree, unemitted_tinfo_decls, i);
3155 }
3156
3157 /* The list of objects with static storage duration is built up
3158 in reverse order. We clear STATIC_AGGREGATES so that any new
3159 aggregates added during the initialization of these will be
3160 initialized in the correct order when we next come around the
3161 loop. */
3162 vars = prune_vars_needing_no_initialization (&static_aggregates);
3163
3164 if (vars)
3165 {
3166 /* We need to start a new initialization function each time
3167 through the loop. That's because we need to know which
3168 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3169 isn't computed until a function is finished, and written
3170 out. That's a deficiency in the back-end. When this is
3171 fixed, these initialization functions could all become
3172 inline, with resulting performance improvements. */
3173 tree ssdf_body;
3174
3175 /* Set the line and file, so that it is obviously not from
3176 the source file. */
3177 input_location = locus;
3178 ssdf_body = start_static_storage_duration_function (ssdf_count);
3179
3180 /* Make sure the back end knows about all the variables. */
3181 write_out_vars (vars);
3182
3183 /* First generate code to do all the initializations. */
3184 if (vars)
3185 do_static_initialization_or_destruction (vars, /*initp=*/true);
3186
3187 /* Then, generate code to do all the destructions. Do these
3188 in reverse order so that the most recently constructed
3189 variable is the first destroyed. If we're using
3190 __cxa_atexit, then we don't need to do this; functions
3191 were registered at initialization time to destroy the
3192 local statics. */
3193 if (!flag_use_cxa_atexit && vars)
3194 {
3195 vars = nreverse (vars);
3196 do_static_initialization_or_destruction (vars, /*initp=*/false);
3197 }
3198 else
3199 vars = NULL_TREE;
3200
3201 /* Finish up the static storage duration function for this
3202 round. */
3203 input_location = locus;
3204 finish_static_storage_duration_function (ssdf_body);
3205
3206 /* All those initializations and finalizations might cause
3207 us to need more inline functions, more template
3208 instantiations, etc. */
3209 reconsider = true;
3210 ssdf_count++;
3211#ifdef USE_MAPPED_LOCATION
3212 /* ??? */
3213#else
3214 locus.line++;
3215#endif
3216 }
3217
3218 /* Go through the set of inline functions whose bodies have not
3219 been emitted yet. If out-of-line copies of these functions
3220 are required, emit them. */
3221 for (i = 0; VEC_iterate (tree, deferred_fns, i, decl); ++i)
3222 {
3223 /* Does it need synthesizing? */
3224 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
3225 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
3226 {
3227 /* Even though we're already at the top-level, we push
3228 there again. That way, when we pop back a few lines
3229 hence, all of our state is restored. Otherwise,
3230 finish_function doesn't clean things up, and we end
3231 up with CURRENT_FUNCTION_DECL set. */
3232 push_to_top_level ();
3233 /* The decl's location will mark where it was first
3234 needed. Save that so synthesize method can indicate
3235 where it was needed from, in case of error */
3236 input_location = DECL_SOURCE_LOCATION (decl);
3237 synthesize_method (decl);
3238 pop_from_top_level ();
3239 reconsider = true;
3240 }
3241
3242 if (!DECL_SAVED_TREE (decl))
3243 continue;
3244
3245 /* We lie to the back-end, pretending that some functions
3246 are not defined when they really are. This keeps these
3247 functions from being put out unnecessarily. But, we must
3248 stop lying when the functions are referenced, or if they
3249 are not comdat since they need to be put out now. If
3250 DECL_INTERFACE_KNOWN, then we have already set
3251 DECL_EXTERNAL appropriately, so there's no need to check
3252 again, and we do not want to clear DECL_EXTERNAL if a
3253 previous call to import_export_decl set it.
3254
3255 This is done in a separate for cycle, because if some
3256 deferred function is contained in another deferred
3257 function later in deferred_fns varray,
3258 rest_of_compilation would skip this function and we
3259 really cannot expand the same function twice. */
3260 import_export_decl (decl);
3261 if (DECL_NOT_REALLY_EXTERN (decl)
3262 && DECL_INITIAL (decl)
3263 && decl_needed_p (decl))
3264 DECL_EXTERNAL (decl) = 0;
3265
3266 /* If we're going to need to write this function out, and
3267 there's already a body for it, create RTL for it now.
3268 (There might be no body if this is a method we haven't
3269 gotten around to synthesizing yet.) */
3270 if (!DECL_EXTERNAL (decl)
3271 && decl_needed_p (decl)
3272 && !TREE_ASM_WRITTEN (decl)
3273 && !cgraph_node (decl)->local.finalized)
3274 {
3275 /* We will output the function; no longer consider it in this
3276 loop. */
3277 DECL_DEFER_OUTPUT (decl) = 0;
3278 /* Generate RTL for this function now that we know we
3279 need it. */
3280 expand_or_defer_fn (decl);
3281 /* If we're compiling -fsyntax-only pretend that this
3282 function has been written out so that we don't try to
3283 expand it again. */
3284 if (flag_syntax_only)
3285 TREE_ASM_WRITTEN (decl) = 1;
3286 reconsider = true;
3287 }
3288 }
3289
3290 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
3291 reconsider = true;
3292
3293 /* Static data members are just like namespace-scope globals. */
3294 for (i = 0; VEC_iterate (tree, pending_statics, i, decl); ++i)
3295 {
3296 if (var_finalized_p (decl) || DECL_REALLY_EXTERN (decl))
3297 continue;
3298 import_export_decl (decl);
3299 /* If this static data member is needed, provide it to the
3300 back end. */
3301 if (DECL_NOT_REALLY_EXTERN (decl) && decl_needed_p (decl))
3302 DECL_EXTERNAL (decl) = 0;
3303 }
3304 if (VEC_length (tree, pending_statics) != 0
3305 && wrapup_global_declarations (VEC_address (tree, pending_statics),
3306 VEC_length (tree, pending_statics)))
3307 reconsider = true;
3308
3309 retries++;
3310 }
3311 while (reconsider);
3312
3313 /* All used inline functions must have a definition at this point. */
3314 for (i = 0; VEC_iterate (tree, deferred_fns, i, decl); ++i)
3315 {
3316 if (/* Check online inline functions that were actually used. */
3317 TREE_USED (decl) && DECL_DECLARED_INLINE_P (decl)
3318 /* If the definition actually was available here, then the
3319 fact that the function was not defined merely represents
3320 that for some reason (use of a template repository,
3321 #pragma interface, etc.) we decided not to emit the
3322 definition here. */
3323 && !DECL_INITIAL (decl)
3324 /* An explicit instantiation can be used to specify
3325 that the body is in another unit. It will have
3326 already verified there was a definition. */
3327 && !DECL_EXPLICIT_INSTANTIATION (decl))
3328 {
3329 warning (0, "inline function %q+D used but never defined", decl);
3330 /* Avoid a duplicate warning from check_global_declaration_1. */
3331 TREE_NO_WARNING (decl) = 1;
3332 }
3333 }
3334
3335 /* We give C linkage to static constructors and destructors. */
3336 push_lang_context (lang_name_c);
3337
3338 /* Generate initialization and destruction functions for all
3339 priorities for which they are required. */
3340 if (priority_info_map)
3341 splay_tree_foreach (priority_info_map,
3342 generate_ctor_and_dtor_functions_for_priority,
3343 /*data=*/&locus);
3344 else
3345 {
3346 /* If we have a ctor or this is obj-c++ and we need a static init,
3347 call generate_ctor_or_dtor_function. */
3348 if (static_ctors || (c_dialect_objc () && objc_static_init_needed_p ()))
3349 generate_ctor_or_dtor_function (/*constructor_p=*/true,
3350 DEFAULT_INIT_PRIORITY, &locus);
3351 if (static_dtors)
3352 generate_ctor_or_dtor_function (/*constructor_p=*/false,
3353 DEFAULT_INIT_PRIORITY, &locus);
3354 }
3355
3356 /* We're done with the splay-tree now. */
3357 if (priority_info_map)
3358 splay_tree_delete (priority_info_map);
3359
3360 /* Generate any missing aliases. */
3361 maybe_apply_pending_pragma_weaks ();
3362
3363 /* We're done with static constructors, so we can go back to "C++"
3364 linkage now. */
3365 pop_lang_context ();
3366
3367 cgraph_finalize_compilation_unit ();
3368 cgraph_optimize ();
3369
3370 /* Now, issue warnings about static, but not defined, functions,
3371 etc., and emit debugging information. */
3372 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
3373 if (VEC_length (tree, pending_statics) != 0)
3374 {
3375 check_global_declarations (VEC_address (tree, pending_statics),
3376 VEC_length (tree, pending_statics));
3377 emit_debug_global_declarations (VEC_address (tree, pending_statics),
3378 VEC_length (tree, pending_statics));
3379 }
3380
3381 /* Generate hidden aliases for Java. */
3382 build_java_method_aliases ();
3383
3384 finish_repo ();
3385
3386 /* The entire file is now complete. If requested, dump everything
3387 to a file. */
3388 {
3389 int flags;
3390 FILE *stream = dump_begin (TDI_tu, &flags);
3391
3392 if (stream)
3393 {
3394 dump_node (global_namespace, flags & ~TDF_SLIM, stream);
3395 dump_end (TDI_tu, stream);
3396 }
3397 }
3398
3399 timevar_pop (TV_VARCONST);
3400
3401 if (flag_detailed_statistics)
3402 {
3403 dump_tree_statistics ();
3404 dump_time_statistics ();
3405 }
3406 input_location = locus;
3407
3408#ifdef ENABLE_CHECKING
3409 validate_conversion_obstack ();
3410#endif /* ENABLE_CHECKING */
3411}
3412
3413/* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the
3414 function to call in parse-tree form; it has not yet been
3415 semantically analyzed. ARGS are the arguments to the function.
3416 They have already been semantically analyzed. */
3417
3418tree
3419build_offset_ref_call_from_tree (tree fn, tree args)
3420{
3421 tree orig_fn;
3422 tree orig_args;
3423 tree expr;
3424 tree object;
3425
3426 orig_fn = fn;
3427 orig_args = args;
3428 object = TREE_OPERAND (fn, 0);
3429
3430 if (processing_template_decl)
3431 {
3432 gcc_assert (TREE_CODE (fn) == DOTSTAR_EXPR
3433 || TREE_CODE (fn) == MEMBER_REF);
3434 if (type_dependent_expression_p (fn)
3435 || any_type_dependent_arguments_p (args))
3436 return build_min_nt (CALL_EXPR, fn, args, NULL_TREE);
3437
3438 /* Transform the arguments and add the implicit "this"
3439 parameter. That must be done before the FN is transformed
3440 because we depend on the form of FN. */
3441 args = build_non_dependent_args (args);
3442 if (TREE_CODE (fn) == DOTSTAR_EXPR)
3443 object = build_unary_op (ADDR_EXPR, object, 0);
3444 object = build_non_dependent_expr (object);
3445 args = tree_cons (NULL_TREE, object, args);
3446 /* Now that the arguments are done, transform FN. */
3447 fn = build_non_dependent_expr (fn);
3448 }
3449
3450 /* A qualified name corresponding to a bound pointer-to-member is
3451 represented as an OFFSET_REF:
3452
3453 struct B { void g(); };
3454 void (B::*p)();
3455 void B::g() { (this->*p)(); } */
3456 if (TREE_CODE (fn) == OFFSET_REF)
3457 {
3458 tree object_addr = build_unary_op (ADDR_EXPR, object, 0);
3459 fn = TREE_OPERAND (fn, 1);
3460 fn = get_member_function_from_ptrfunc (&object_addr, fn);
3461 args = tree_cons (NULL_TREE, object_addr, args);
3462 }
3463
3464 expr = build_function_call (fn, args);
3465 if (processing_template_decl && expr != error_mark_node)
3466 return build_min_non_dep (CALL_EXPR, expr, orig_fn, orig_args, NULL_TREE);
3467 return expr;
3468}
3469
3470
3471void
3472check_default_args (tree x)
3473{
3474 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
3475 bool saw_def = false;
3476 int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
3477 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
3478 {
3479 if (TREE_PURPOSE (arg))
3480 saw_def = true;
3481 else if (saw_def)
3482 {
3483 error ("default argument missing for parameter %P of %q+#D", i, x);
3484 TREE_PURPOSE (arg) = error_mark_node;
3485 }
3486 }
3487}
3488
3489/* Mark DECL (either a _DECL or a BASELINK) as "used" in the program.
3490 If DECL is a specialization or implicitly declared class member,
3491 generate the actual definition. */
3492
3493void
3494mark_used (tree decl)
3495{
3496 HOST_WIDE_INT saved_processing_template_decl = 0;
3497
3498 /* If DECL is a BASELINK for a single function, then treat it just
3499 like the DECL for the function. Otherwise, if the BASELINK is
3500 for an overloaded function, we don't know which function was
3501 actually used until after overload resolution. */
3502 if (TREE_CODE (decl) == BASELINK)
3503 {
3504 decl = BASELINK_FUNCTIONS (decl);
3505 if (really_overloaded_fn (decl))
3506 return;
3507 decl = OVL_CURRENT (decl);
3508 }
3509
3510 TREE_USED (decl) = 1;
3511 if (DECL_CLONED_FUNCTION_P (decl))
3512 TREE_USED (DECL_CLONED_FUNCTION (decl)) = 1;
3513 /* If we don't need a value, then we don't need to synthesize DECL. */
3514 if (skip_evaluation)
3515 return;
3516 /* Normally, we can wait until instantiation-time to synthesize
3517 DECL. However, if DECL is a static data member initialized with
3518 a constant, we need the value right now because a reference to
3519 such a data member is not value-dependent. */
3520 if (TREE_CODE (decl) == VAR_DECL
3521 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl)
3522 && DECL_CLASS_SCOPE_P (decl))
3523 {
3524 /* Don't try to instantiate members of dependent types. We
3525 cannot just use dependent_type_p here because this function
3526 may be called from fold_non_dependent_expr, and then we may
3527 see dependent types, even though processing_template_decl
3528 will not be set. */
3529 if (CLASSTYPE_TEMPLATE_INFO ((DECL_CONTEXT (decl)))
3530 && uses_template_parms (CLASSTYPE_TI_ARGS (DECL_CONTEXT (decl))))
3531 return;
3532 /* Pretend that we are not in a template, even if we are, so
3533 that the static data member initializer will be processed. */
3534 saved_processing_template_decl = processing_template_decl;
3535 processing_template_decl = 0;
3536 }
3537
3538 if (processing_template_decl)
3539 return;
3540
3541 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl)
3542 && !TREE_ASM_WRITTEN (decl))
3543 /* Remember it, so we can check it was defined. */
3544 {
3545 if (DECL_DEFERRED_FN (decl))
3546 return;
3547
3548 /* Remember the current location for a function we will end up
3549 synthesizing. Then we can inform the user where it was
3550 required in the case of error. */
3551 if (DECL_ARTIFICIAL (decl) && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
3552 && !DECL_THUNK_P (decl))
3553 DECL_SOURCE_LOCATION (decl) = input_location;
3554
3555 note_vague_linkage_fn (decl);
3556 }
3557
3558 assemble_external (decl);
3559
3560 /* Is it a synthesized method that needs to be synthesized? */
3561 if (TREE_CODE (decl) == FUNCTION_DECL
3562 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
3563 && DECL_ARTIFICIAL (decl)
3564 && !DECL_THUNK_P (decl)
3565 && ! DECL_INITIAL (decl)
3566 /* Kludge: don't synthesize for default args. Unfortunately this
3567 rules out initializers of namespace-scoped objects too, but
3568 it's sort-of ok if the implicit ctor or dtor decl keeps
3569 pointing to the class location. */
3570 && current_function_decl)
3571 {
3572 synthesize_method (decl);
3573 /* If we've already synthesized the method we don't need to
3574 do the instantiation test below. */
3575 }
3576 else if ((DECL_NON_THUNK_FUNCTION_P (decl) || TREE_CODE (decl) == VAR_DECL)
3577 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
3578 && (!DECL_EXPLICIT_INSTANTIATION (decl)
3579 || (TREE_CODE (decl) == FUNCTION_DECL
3580 && DECL_INLINE (DECL_TEMPLATE_RESULT
3581 (template_for_substitution (decl))))
3582 /* We need to instantiate static data members so that there
3583 initializers are available in integral constant
3584 expressions. */
3585 || (TREE_CODE (decl) == VAR_DECL
3586 && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl))))
3587 /* If this is a function or variable that is an instance of some
3588 template, we now know that we will need to actually do the
3589 instantiation. We check that DECL is not an explicit
3590 instantiation because that is not checked in instantiate_decl.
3591
3592 We put off instantiating functions in order to improve compile
3593 times. Maintaining a stack of active functions is expensive,
3594 and the inliner knows to instantiate any functions it might
3595 need. Therefore, we always try to defer instantiation. */
3596 instantiate_decl (decl, /*defer_ok=*/true,
3597 /*expl_inst_class_mem_p=*/false);
3598
3599 processing_template_decl = saved_processing_template_decl;
3600}
3601
3602#include "gt-cp-decl2.h"
|