1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-98, 1999 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Process declarations and symbol lookup for C front end.
24 Also constructs types; the standard scalar types at initialization,
25 and structure, union, array and enum types when they are declared. */
27 /* ??? not all decl nodes are given the most useful possible
28 line numbers. For example, the CONST_DECLs for enum values. */
43 #include "dwarf2out.h"
45 #include "splay-tree.h"
50 extern cpp_reader parse_in;
53 /* This structure contains information about the initializations
54 and/or destructions required for a particular priority level. */
55 typedef struct priority_info_s {
56 /* Non-zero if there have been any initializations at this priority
57 throughout the translation unit. */
58 int initializations_p;
59 /* Non-zero if there have been any destructions at this priority
60 throughout the translation unit. */
64 static tree get_sentry PROTO((tree));
65 static void mark_vtable_entries PROTO((tree));
66 static void grok_function_init PROTO((tree, tree));
67 static int finish_vtable_vardecl PROTO((tree *, void *));
68 static int prune_vtable_vardecl PROTO((tree *, void *));
69 static int is_namespace_ancestor PROTO((tree, tree));
70 static void add_using_namespace PROTO((tree, tree, int));
71 static tree ambiguous_decl PROTO((tree, tree, tree,int));
72 static tree build_anon_union_vars PROTO((tree, tree*, int, int));
73 static int acceptable_java_type PROTO((tree));
74 static void output_vtable_inherit PROTO((tree));
75 static tree start_objects PROTO((int, int));
76 static void finish_objects PROTO((int, int, tree));
77 static tree merge_functions PROTO((tree, tree));
78 static tree decl_namespace PROTO((tree));
79 static tree validate_nonmember_using_decl PROTO((tree, tree *, tree *));
80 static void do_nonmember_using_decl PROTO((tree, tree, tree, tree,
82 static tree start_static_storage_duration_function PROTO((void));
83 static void finish_static_storage_duration_function PROTO((tree));
84 static priority_info get_priority_info PROTO((int));
85 static void do_static_initialization PROTO((tree, tree));
86 static void do_static_destruction PROTO((tree));
87 static tree start_static_initialization_or_destruction PROTO((tree, int));
88 static void finish_static_initialization_or_destruction PROTO((tree));
89 static void generate_ctor_or_dtor_function PROTO((int, int));
90 static int generate_ctor_and_dtor_functions_for_priority
91 PROTO((splay_tree_node, void *));
92 static tree prune_vars_needing_no_initialization PROTO((tree));
93 static void write_out_vars PROTO((tree));
95 extern int current_class_depth;
97 /* A list of virtual function tables we must make sure to write out. */
100 /* A list of static class variables. This is needed, because a
101 static class variable can be declared inside the class without
102 an initializer, and then initialized, staticly, outside the class. */
103 static varray_type pending_statics;
104 static size_t pending_statics_used;
106 /* A list of functions which were declared inline, but which we
107 may need to emit outline anyway. */
108 static varray_type saved_inlines;
109 static size_t saved_inlines_used;
111 /* Same, but not reset. Local temp variables and global temp variables
112 can have the same name. */
113 static int global_temp_name_counter;
115 /* Flag used when debugging spew.c */
117 extern int spew_debug;
119 /* Nonzero if we're done parsing and into end-of-file activities. */
123 /* Functions called along with real static constructors and destructors. */
125 tree static_ctors, static_dtors;
127 /* The :: namespace. */
129 tree global_namespace;
131 /* The stack for namespaces of current declarations. */
133 static tree decl_namespace_list;
136 /* C (and C++) language-specific option variables. */
138 /* Nonzero means allow type mismatches in conditional expressions;
139 just make their values `void'. */
141 int flag_cond_mismatch;
143 /* Nonzero means give `double' the same size as `float'. */
145 int flag_short_double;
147 /* Nonzero means don't recognize the keyword `asm'. */
151 /* Nonzero means don't recognize any extension keywords. */
153 int flag_no_gnu_keywords;
155 /* Nonzero means don't recognize the non-ANSI builtin functions. */
159 /* Nonzero means don't recognize the non-ANSI builtin functions.
162 int flag_no_nonansi_builtin;
164 /* Nonzero means do some things the same way PCC does. Only provided so
165 the compiler will link. */
167 int flag_traditional;
169 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
171 int flag_signed_bitfields = 1;
173 /* Nonzero means enable obscure ANSI features and disable GNU extensions
174 that might cause ANSI-compliant code to be miscompiled. */
178 /* Nonzero means do emit exported implementations of functions even if
179 they can be inlined. */
181 int flag_implement_inlines = 1;
183 /* Nonzero means do emit exported implementations of templates, instead of
184 multiple static copies in each file that needs a definition. */
186 int flag_external_templates;
188 /* Nonzero means that the decision to emit or not emit the implementation of a
189 template depends on where the template is instantiated, rather than where
192 int flag_alt_external_templates;
194 /* Nonzero means that implicit instantiations will be emitted if needed. */
196 int flag_implicit_templates = 1;
198 /* Nonzero means that implicit instantiations of inline templates will be
199 emitted if needed, even if instantiations of non-inline templates
202 int flag_implicit_inline_templates = 1;
204 /* Nonzero means warn about implicit declarations. */
206 int warn_implicit = 1;
208 /* Nonzero means warn about usage of long long when `-pedantic'. */
210 int warn_long_long = 1;
212 /* Nonzero means warn when all ctors or dtors are private, and the class
215 int warn_ctor_dtor_privacy = 1;
217 /* True if we want to implement vtables using "thunks".
218 The default is off. */
220 #ifndef DEFAULT_VTABLE_THUNKS
221 #define DEFAULT_VTABLE_THUNKS 0
223 int flag_vtable_thunks = DEFAULT_VTABLE_THUNKS;
225 /* Nonzero means generate separate instantiation control files and juggle
226 them at link time. */
228 int flag_use_repository;
230 /* Nonzero if we want to issue diagnostics that the standard says are not
233 int flag_optional_diags = 1;
235 /* Nonzero means give string constants the type `const char *', as mandated
238 int flag_const_strings = 1;
240 /* If non-NULL, dump the tree structure for the entire translation
241 unit to this file. */
243 char *flag_dump_translation_unit = 0;
245 /* Nonzero means warn about deprecated conversion from string constant to
248 int warn_write_strings;
250 /* Nonzero means warn about pointer casts that can drop a type qualifier
251 from the pointer target type. */
255 /* Nonzero means warn about sizeof(function) or addition/subtraction
256 of function pointers. */
258 int warn_pointer_arith = 1;
260 /* Nonzero means warn for any function def without prototype decl. */
262 int warn_missing_prototypes;
264 /* Nonzero means warn about multiple (redundant) decls for the same single
265 variable or function. */
267 int warn_redundant_decls;
269 /* Warn if initializer is not completely bracketed. */
271 int warn_missing_braces;
273 /* Warn about comparison of signed and unsigned values. */
275 int warn_sign_compare;
277 /* Warn about testing equality of floating point numbers. */
279 int warn_float_equal = 0;
281 /* Warn about *printf or *scanf format/argument anomalies. */
285 /* Warn about a subscript that has type char. */
287 int warn_char_subscripts;
289 /* Warn if a type conversion is done that might have confusing results. */
293 /* Warn if adding () is suggested. */
295 int warn_parentheses;
297 /* Non-zero means warn in function declared in derived class has the
298 same name as a virtual in the base class, but fails to match the
299 type signature of any virtual function in the base class. */
300 int warn_overloaded_virtual;
302 /* Non-zero means warn when declaring a class that has a non virtual
303 destructor, when it really ought to have a virtual one. */
306 /* Non-zero means warn when a function is declared extern and later inline. */
307 int warn_extern_inline;
309 /* Non-zero means warn when the compiler will reorder code. */
312 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
315 /* Non-zero means warn when we convert a pointer to member function
316 into a pointer to (void or function). */
317 int warn_pmf2ptr = 1;
319 /* Nonzero means warn about violation of some Effective C++ style rules. */
323 /* Nonzero means warn where overload resolution chooses a promotion from
324 unsigned to signed over a conversion to an unsigned of the same size. */
328 /* Nonzero means warn when an old-style cast is used. */
330 int warn_old_style_cast;
332 /* Warn about #pragma directives that are not recognised. */
334 int warn_unknown_pragmas; /* Tri state variable. */
336 /* Nonzero means warn about use of multicharacter literals. */
338 int warn_multichar = 1;
340 /* Nonzero means warn when non-templatized friend functions are
341 declared within a template */
343 int warn_nontemplate_friend = 1;
345 /* Nonzero means complain about deprecated features. */
347 int warn_deprecated = 1;
349 /* Nonzero means `$' can be in an identifier. */
351 #ifndef DOLLARS_IN_IDENTIFIERS
352 #define DOLLARS_IN_IDENTIFIERS 1
354 int dollars_in_ident = DOLLARS_IN_IDENTIFIERS;
356 /* Nonzero for -fno-strict-prototype switch: do not consider empty
357 argument prototype to mean function takes no arguments. */
359 int flag_strict_prototype = 2;
360 int strict_prototype = 1;
361 int strict_prototypes_lang_c, strict_prototypes_lang_cplusplus = 1;
363 /* Nonzero means that labels can be used as first-class objects */
367 /* Nonzero means allow Microsoft extensions without a pedwarn. */
369 int flag_ms_extensions;
371 /* Non-zero means to collect statistics which might be expensive
372 and to print them when we are done. */
373 int flag_detailed_statistics;
375 /* C++ specific flags. */
376 /* Zero means that `this' is a *const. This gives nice behavior in the
377 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
378 -2 means we're constructing an object and it has fixed type. */
380 int flag_this_is_variable;
382 /* Nonzero means we should attempt to elide constructors when possible. */
384 int flag_elide_constructors = 1;
386 /* Nonzero means that member functions defined in class scope are
387 inline by default. */
389 int flag_default_inline = 1;
391 /* Controls whether compiler generates 'type descriptor' that give
392 run-time type information. */
395 /* Nonzero if we wish to output cross-referencing information
396 for the GNU class browser. */
397 extern int flag_gnu_xref;
399 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
402 int flag_huge_objects;
404 /* Nonzero if we want to conserve space in the .o files. We do this
405 by putting uninitialized data and runtime initialized data into
406 .common instead of .data at the expense of not flagging multiple
409 int flag_conserve_space;
411 /* Nonzero if we want to obey access control semantics. */
413 int flag_access_control = 1;
415 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
417 int flag_operator_names;
419 /* Nonzero if we want to check the return value of new and avoid calling
420 constructors if it is a null pointer. */
424 /* Nonzero if we want the new ANSI rules for pushing a new scope for `for'
425 initialization variables.
426 0: Old rules, set by -fno-for-scope.
427 2: New ANSI rules, set by -ffor-scope.
428 1: Try to implement new ANSI rules, but with backup compatibility
429 (and warnings). This is the default, for now. */
431 int flag_new_for_scope = 1;
433 /* Nonzero if we want to emit defined symbols with common-like linkage as
434 weak symbols where possible, in order to conform to C++ semantics.
435 Otherwise, emit them as local symbols. */
439 /* Nonzero to enable experimental ABI changes. */
443 /* Nonzero to not ignore namespace std. */
447 /* Maximum template instantiation depth. Must be at least 17 for ANSI
450 int max_tinst_depth = 17;
452 /* The name-mangling scheme to use. Must be 1 or greater to support
453 template functions with identical types, but different template
455 int name_mangling_version = 2;
457 /* Nonzero means that guiding declarations are allowed. */
458 int flag_guiding_decls;
460 /* Nonzero if wchar_t should be `unsigned short' instead of whatever it
461 would normally be, for use with WINE. */
462 int flag_short_wchar;
464 /* Nonzero if squashed mangling is to be performed.
465 This uses the B and K codes to reference previously seen class types
466 and class qualifiers. */
467 int flag_do_squangling;
469 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
473 /* Nonzero means make the default pedwarns warnings instead of errors.
474 The value of this flag is ignored if -pedantic is specified. */
478 /* If this variable is defined to a non-NULL value, it will be called
479 after the file has been completely parsed. */
481 void (*back_end_hook) PROTO((tree));
483 /* Table of language-dependent -f options.
484 STRING is the option name. VARIABLE is the address of the variable.
485 ON_VALUE is the value to store in VARIABLE
486 if `-fSTRING' is seen as an option.
487 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
489 static struct { const char *string; int *variable; int on_value;}
493 {"signed-char", &flag_signed_char, 1},
494 {"unsigned-char", &flag_signed_char, 0},
495 {"signed-bitfields", &flag_signed_bitfields, 1},
496 {"unsigned-bitfields", &flag_signed_bitfields, 0},
497 {"short-enums", &flag_short_enums, 1},
498 {"short-double", &flag_short_double, 1},
499 {"short-wchar", &flag_short_wchar, 1},
500 {"cond-mismatch", &flag_cond_mismatch, 1},
501 {"asm", &flag_no_asm, 0},
502 {"builtin", &flag_no_builtin, 0},
504 /* C++-only options. */
505 {"access-control", &flag_access_control, 1},
506 {"check-new", &flag_check_new, 1},
507 {"conserve-space", &flag_conserve_space, 1},
508 {"const-strings", &flag_const_strings, 1},
509 {"default-inline", &flag_default_inline, 1},
510 {"dollars-in-identifiers", &dollars_in_ident, 1},
511 {"elide-constructors", &flag_elide_constructors, 1},
512 {"external-templates", &flag_external_templates, 1},
513 {"for-scope", &flag_new_for_scope, 2},
514 {"gnu-keywords", &flag_no_gnu_keywords, 0},
515 {"handle-exceptions", &flag_exceptions, 1},
516 {"honor-std", &flag_honor_std, 1},
517 {"huge-objects", &flag_huge_objects, 1},
518 {"implement-inlines", &flag_implement_inlines, 1},
519 {"implicit-inline-templates", &flag_implicit_inline_templates, 1},
520 {"implicit-templates", &flag_implicit_templates, 1},
521 {"labels-ok", &flag_labels_ok, 1},
522 {"ms-extensions", &flag_ms_extensions, 1},
523 {"nonansi-builtins", &flag_no_nonansi_builtin, 0},
524 {"operator-names", &flag_operator_names, 1},
525 {"optional-diags", &flag_optional_diags, 1},
526 {"permissive", &flag_permissive, 1},
527 {"repo", &flag_use_repository, 1},
528 {"rtti", &flag_rtti, 1},
529 {"squangle", &flag_do_squangling, 1},
530 {"stats", &flag_detailed_statistics, 1},
531 {"strict-prototype", &flag_strict_prototype, 1},
532 {"vtable-gc", &flag_vtable_gc, 1},
533 {"vtable-thunks", &flag_vtable_thunks, 1},
534 {"weak", &flag_weak, 1},
535 {"xref", &flag_gnu_xref, 1}
538 /* Decode the string P as a language-specific option.
539 Return the number of strings consumed for a valid option.
540 Otherwise return 0. Should not complain if it does not
541 recognise the option. */
544 lang_decode_option (argc, argv)
553 int strings_processed;
556 strings_processed = cpp_handle_option (&parse_in, argc, argv);
558 strings_processed = 0;
559 #endif /* ! USE_CPPLIB */
561 if (!strcmp (p, "-ftraditional") || !strcmp (p, "-traditional"))
563 else if (p[0] == '-' && p[1] == 'f')
565 /* Some kind of -f option.
566 P's value is the option sans `-f'.
567 Search for it in the table of options. */
571 /* Try special -f options. */
573 if (!strcmp (p, "handle-exceptions")
574 || !strcmp (p, "no-handle-exceptions"))
575 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
576 else if (!strcmp (p, "all-virtual")
577 || !strcmp (p, "enum-int-equiv")
578 || !strcmp (p, "no-nonnull-objects")
579 || !strcmp (p, "this-is-variable"))
580 warning ("-f%s is no longer supported", p);
581 else if (! strcmp (p, "alt-external-templates"))
583 flag_external_templates = 1;
584 flag_alt_external_templates = 1;
585 cp_deprecated ("-falt-external-templates");
587 else if (! strcmp (p, "no-alt-external-templates"))
588 flag_alt_external_templates = 0;
589 else if (!strcmp (p, "repo"))
591 flag_use_repository = 1;
592 flag_implicit_templates = 0;
594 else if (!strcmp (p, "guiding-decls"))
596 flag_guiding_decls = 1;
597 name_mangling_version = 0;
599 else if (!strcmp (p, "no-guiding-decls"))
600 flag_guiding_decls = 0;
601 else if (!strcmp (p, "external-templates"))
603 flag_external_templates = 1;
604 cp_deprecated ("-fexternal-templates");
606 else if (!strcmp (p, "new-abi"))
609 flag_do_squangling = 1;
611 flag_vtable_thunks = 1;
613 else if (!strcmp (p, "no-new-abi"))
616 flag_do_squangling = 0;
619 else if (!strncmp (p, "template-depth-", 15))
621 = read_integral_parameter (p + 15, p - 2, max_tinst_depth);
622 else if (!strncmp (p, "name-mangling-version-", 22))
623 name_mangling_version
624 = read_integral_parameter (p + 22, p - 2, name_mangling_version);
625 else if (!strncmp (p, "dump-translation-unit-", 22))
628 error ("no file specified with -fdump-translation-unit");
630 flag_dump_translation_unit = p + 22;
637 !found && j < (sizeof (lang_f_options)
638 / sizeof (lang_f_options[0]));
641 if (!strcmp (p, lang_f_options[j].string))
643 *lang_f_options[j].variable = lang_f_options[j].on_value;
644 /* A goto here would be cleaner,
645 but breaks the vax pcc. */
648 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-'
649 && ! strcmp (p+3, lang_f_options[j].string))
651 *lang_f_options[j].variable = ! lang_f_options[j].on_value;
659 else if (p[0] == '-' && p[1] == 'W')
663 /* The -W options control the warning behavior of the compiler. */
666 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-')
669 if (!strcmp (p, "implicit"))
670 warn_implicit = setting;
671 else if (!strcmp (p, "long-long"))
672 warn_long_long = setting;
673 else if (!strcmp (p, "return-type"))
674 warn_return_type = setting;
675 else if (!strcmp (p, "ctor-dtor-privacy"))
676 warn_ctor_dtor_privacy = setting;
677 else if (!strcmp (p, "write-strings"))
678 warn_write_strings = setting;
679 else if (!strcmp (p, "cast-qual"))
680 warn_cast_qual = setting;
681 else if (!strcmp (p, "char-subscripts"))
682 warn_char_subscripts = setting;
683 else if (!strcmp (p, "pointer-arith"))
684 warn_pointer_arith = setting;
685 else if (!strcmp (p, "missing-prototypes"))
686 warn_missing_prototypes = setting;
687 else if (!strcmp (p, "redundant-decls"))
688 warn_redundant_decls = setting;
689 else if (!strcmp (p, "missing-braces"))
690 warn_missing_braces = setting;
691 else if (!strcmp (p, "sign-compare"))
692 warn_sign_compare = setting;
693 else if (!strcmp (p, "float-equal"))
694 warn_float_equal = setting;
695 else if (!strcmp (p, "format"))
696 warn_format = setting;
697 else if (!strcmp (p, "conversion"))
698 warn_conversion = setting;
699 else if (!strcmp (p, "parentheses"))
700 warn_parentheses = setting;
701 else if (!strcmp (p, "non-virtual-dtor"))
702 warn_nonvdtor = setting;
703 else if (!strcmp (p, "extern-inline"))
704 warn_extern_inline = setting;
705 else if (!strcmp (p, "reorder"))
706 warn_reorder = setting;
707 else if (!strcmp (p, "synth"))
708 warn_synth = setting;
709 else if (!strcmp (p, "pmf-conversions"))
710 warn_pmf2ptr = setting;
711 else if (!strcmp (p, "effc++"))
713 else if (!strcmp (p, "sign-promo"))
714 warn_sign_promo = setting;
715 else if (!strcmp (p, "old-style-cast"))
716 warn_old_style_cast = setting;
717 else if (!strcmp (p, "overloaded-virtual"))
718 warn_overloaded_virtual = setting;
719 else if (!strcmp (p, "multichar"))
720 warn_multichar = setting;
721 else if (!strcmp (p, "unknown-pragmas"))
722 /* Set to greater than 1, so that even unknown pragmas in
723 system headers will be warned about. */
724 warn_unknown_pragmas = setting * 2;
725 else if (!strcmp (p, "non-template-friend"))
726 warn_nontemplate_friend = setting;
727 else if (!strcmp (p, "deprecated"))
728 warn_deprecated = setting;
729 else if (!strcmp (p, "comment"))
730 ; /* cpp handles this one. */
731 else if (!strcmp (p, "comments"))
732 ; /* cpp handles this one. */
733 else if (!strcmp (p, "trigraphs"))
734 ; /* cpp handles this one. */
735 else if (!strcmp (p, "import"))
736 ; /* cpp handles this one. */
737 else if (!strcmp (p, "all"))
739 warn_return_type = setting;
740 warn_unused = setting;
741 warn_implicit = setting;
742 warn_switch = setting;
743 warn_format = setting;
744 warn_parentheses = setting;
745 warn_missing_braces = setting;
746 warn_sign_compare = setting;
747 warn_multichar = setting;
748 /* We save the value of warn_uninitialized, since if they put
749 -Wuninitialized on the command line, we need to generate a
750 warning about not using it without also specifying -O. */
751 if (warn_uninitialized != 1)
752 warn_uninitialized = (setting ? 2 : 0);
753 /* Only warn about unknown pragmas that are not in system
755 warn_unknown_pragmas = 1;
757 /* C++-specific warnings. */
758 warn_ctor_dtor_privacy = setting;
759 warn_nonvdtor = setting;
760 warn_reorder = setting;
761 warn_nontemplate_friend = setting;
763 else return strings_processed;
765 else if (!strcmp (p, "-ansi"))
766 flag_no_nonansi_builtin = 1, flag_ansi = 1,
767 flag_no_gnu_keywords = 1, flag_operator_names = 1;
769 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
770 it's probably safe to assume no sane person would ever want to use this
771 under normal circumstances. */
772 else if (!strcmp (p, "-spew-debug"))
776 return strings_processed;
781 /* Incorporate `const' and `volatile' qualifiers for member functions.
782 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
783 QUALS is a list of qualifiers. Returns any explicit
784 top-level qualifiers of the method's this pointer, anything other than
785 TYPE_UNQUALIFIED will be an extension. */
788 grok_method_quals (ctype, function, quals)
789 tree ctype, function, quals;
791 tree fntype = TREE_TYPE (function);
792 tree raises = TYPE_RAISES_EXCEPTIONS (fntype);
793 int type_quals = TYPE_UNQUALIFIED;
794 int dup_quals = TYPE_UNQUALIFIED;
795 int this_quals = TYPE_UNQUALIFIED;
799 int tq = cp_type_qual_from_rid (TREE_VALUE (quals));
801 if ((type_quals | this_quals) & tq)
803 else if (tq & TYPE_QUAL_RESTRICT)
807 quals = TREE_CHAIN (quals);
811 if (dup_quals != TYPE_UNQUALIFIED)
812 cp_error ("duplicate type qualifiers in %s declaration",
813 TREE_CODE (function) == FUNCTION_DECL
814 ? "member function" : "type");
816 ctype = cp_build_qualified_type (ctype, type_quals);
817 fntype = build_cplus_method_type (ctype, TREE_TYPE (fntype),
818 (TREE_CODE (fntype) == METHOD_TYPE
819 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
820 : TYPE_ARG_TYPES (fntype)));
822 fntype = build_exception_variant (fntype, raises);
824 TREE_TYPE (function) = fntype;
828 /* Warn when -fexternal-templates is used and #pragma
829 interface/implementation is not used all the times it should be,
833 warn_if_unknown_interface (decl)
836 static int already_warned = 0;
837 if (already_warned++)
840 if (flag_alt_external_templates)
842 struct tinst_level *til = tinst_for_decl ();
844 char *sf = input_filename;
849 input_filename = til->file;
851 cp_warning ("template `%#D' instantiated in file without #pragma interface",
857 cp_warning_at ("template `%#D' defined in file without #pragma interface",
861 /* A subroutine of the parser, to handle a component list. */
864 grok_x_components (specs)
867 struct pending_inline **p;
870 specs = strip_attrs (specs);
872 check_tag_decl (specs);
873 t = groktypename (build_decl_list (specs, NULL_TREE));
875 /* The only case where we need to do anything additional here is an
876 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
877 if (t == NULL_TREE || !ANON_AGGR_TYPE_P (t))
880 fixup_anonymous_aggr (t);
881 finish_member_declaration (build_lang_decl (FIELD_DECL, NULL_TREE, t));
883 /* Ignore any inline function definitions in the anonymous union
884 since an anonymous union may not have function members. */
885 p = &pending_inlines;
886 for (; *p; *p = (*p)->next)
887 if (DECL_CONTEXT ((*p)->fndecl) != t)
891 /* Constructors for types with virtual baseclasses need an "in-charge" flag
892 saying whether this constructor is responsible for initialization of
893 virtual baseclasses or not. All destructors also need this "in-charge"
894 flag, which additionally determines whether or not the destructor should
895 free the memory for the object.
897 This function adds the "in-charge" flag to member function FN if
898 appropriate. It is called from grokclassfn and tsubst.
899 FN must be either a constructor or destructor. */
902 maybe_retrofit_in_chrg (fn)
905 tree basetype, arg_types, parms, parm, fntype;
907 if (DECL_CONSTRUCTOR_P (fn)
908 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CLASS_CONTEXT (fn))
909 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn))
911 else if (! DECL_CONSTRUCTOR_P (fn)
912 && TREE_CHAIN (DECL_ARGUMENTS (fn)) == NULL_TREE)
917 if (DECL_CONSTRUCTOR_P (fn))
918 DECL_CONSTRUCTOR_FOR_VBASE_P (fn) = 1;
920 /* First add it to DECL_ARGUMENTS... */
921 parm = build_decl (PARM_DECL, in_charge_identifier, integer_type_node);
922 /* Mark the artificial `__in_chrg' parameter as "artificial". */
923 SET_DECL_ARTIFICIAL (parm);
924 DECL_ARG_TYPE (parm) = integer_type_node;
925 TREE_READONLY (parm) = 1;
926 parms = DECL_ARGUMENTS (fn);
927 TREE_CHAIN (parm) = TREE_CHAIN (parms);
928 TREE_CHAIN (parms) = parm;
930 /* ...and then to TYPE_ARG_TYPES. */
931 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
932 basetype = TREE_TYPE (TREE_VALUE (arg_types));
933 arg_types = hash_tree_chain (integer_type_node, TREE_CHAIN (arg_types));
934 fntype = build_cplus_method_type (basetype, TREE_TYPE (TREE_TYPE (fn)),
936 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
937 fntype = build_exception_variant (fntype,
938 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
939 TREE_TYPE (fn) = fntype;
942 /* Classes overload their constituent function names automatically.
943 When a function name is declared in a record structure,
944 its name is changed to it overloaded name. Since names for
945 constructors and destructors can conflict, we place a leading
948 CNAME is the name of the class we are grokking for.
950 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
952 FLAGS contains bits saying what's special about today's
953 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
955 If FUNCTION is a destructor, then we must add the `auto-delete' field
956 as a second parameter. There is some hair associated with the fact
957 that we must "declare" this variable in the manner consistent with the
958 way the rest of the arguments were declared.
960 QUALS are the qualifiers for the this pointer. */
963 grokclassfn (ctype, function, flags, quals)
964 tree ctype, function;
965 enum overload_flags flags;
968 tree fn_name = DECL_NAME (function);
969 int this_quals = TYPE_UNQUALIFIED;
971 if (fn_name == NULL_TREE)
973 error ("name missing for member function");
974 fn_name = get_identifier ("<anonymous>");
975 DECL_NAME (function) = fn_name;
979 this_quals = grok_method_quals (ctype, function, quals);
981 if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
983 /* Must add the class instance variable up front. */
984 /* Right now we just make this a pointer. But later
985 we may wish to make it special. */
986 tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function)));
988 tree parm = build_decl (PARM_DECL, this_identifier,
989 cp_build_qualified_type (type, this_quals | TYPE_QUAL_CONST));
990 /* Mark the artificial `this' parameter as "artificial". */
991 SET_DECL_ARTIFICIAL (parm);
992 DECL_ARG_TYPE (parm) = type;
993 /* We can make this a register, so long as we don't
994 accidentally complain if someone tries to take its address. */
995 DECL_REGISTER (parm) = 1;
996 TREE_CHAIN (parm) = last_function_parms;
997 last_function_parms = parm;
1000 DECL_ARGUMENTS (function) = last_function_parms;
1001 /* First approximations. */
1002 DECL_CONTEXT (function) = ctype;
1003 DECL_CLASS_CONTEXT (function) = ctype;
1005 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
1006 maybe_retrofit_in_chrg (function);
1008 if (flags == DTOR_FLAG)
1010 DECL_ASSEMBLER_NAME (function) = build_destructor_name (ctype);
1011 TYPE_HAS_DESTRUCTOR (ctype) = 1;
1014 set_mangled_name_for_decl (function);
1017 /* Work on the expr used by alignof (this is only called by the parser). */
1026 if (processing_template_decl)
1027 return build_min (ALIGNOF_EXPR, sizetype, expr);
1029 if (TREE_CODE (expr) == COMPONENT_REF
1030 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
1031 error ("`__alignof__' applied to a bit-field");
1033 if (TREE_CODE (expr) == INDIRECT_REF)
1035 best = t = TREE_OPERAND (expr, 0);
1036 bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1038 while (TREE_CODE (t) == NOP_EXPR
1039 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
1042 t = TREE_OPERAND (t, 0);
1043 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1044 if (thisalign > bestalign)
1045 best = t, bestalign = thisalign;
1047 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
1050 return c_alignof (TREE_TYPE (expr));
1053 /* Create an ARRAY_REF, checking for the user doing things backwards
1057 grok_array_decl (array_expr, index_exp)
1058 tree array_expr, index_exp;
1060 tree type = TREE_TYPE (array_expr);
1061 tree p1, p2, i1, i2;
1063 if (type == error_mark_node || index_exp == error_mark_node)
1064 return error_mark_node;
1065 if (processing_template_decl)
1066 return build_min (ARRAY_REF, type ? TREE_TYPE (type) : NULL_TREE,
1067 array_expr, index_exp);
1069 if (type == NULL_TREE)
1071 /* Something has gone very wrong. Assume we are mistakenly reducing
1072 an expression instead of a declaration. */
1073 error ("parser may be lost: is there a '{' missing somewhere?");
1077 if (TREE_CODE (type) == OFFSET_TYPE
1078 || TREE_CODE (type) == REFERENCE_TYPE)
1079 type = TREE_TYPE (type);
1081 /* If they have an `operator[]', use that. */
1082 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
1083 return build_opfncall (ARRAY_REF, LOOKUP_NORMAL,
1084 array_expr, index_exp, NULL_TREE);
1086 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1087 is a little-known fact that, if `a' is an array and `i' is an
1088 int, you can write `i[a]', which means the same thing as `a[i]'. */
1090 if (TREE_CODE (type) == ARRAY_TYPE)
1093 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, 0);
1095 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
1098 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, 0);
1100 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr, 0);
1101 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp, 0);
1103 if ((p1 && i2) && (i1 && p2))
1104 error ("ambiguous conversion for array subscript");
1107 array_expr = p1, index_exp = i2;
1109 array_expr = p2, index_exp = i1;
1112 cp_error ("invalid types `%T[%T]' for array subscript",
1113 type, TREE_TYPE (index_exp));
1114 return error_mark_node;
1117 if (array_expr == error_mark_node || index_exp == error_mark_node)
1118 error ("ambiguous conversion for array subscript");
1120 return build_array_ref (array_expr, index_exp);
1123 /* Given the cast expression EXP, checking out its validity. Either return
1124 an error_mark_node if there was an unavoidable error, return a cast to
1125 void for trying to delete a pointer w/ the value 0, or return the
1126 call to delete. If DOING_VEC is 1, we handle things differently
1127 for doing an array delete. If DOING_VEC is 2, they gave us the
1128 array size as an argument to delete.
1129 Implements ARM $5.3.4. This is called from the parser. */
1132 delete_sanity (exp, size, doing_vec, use_global_delete)
1134 int doing_vec, use_global_delete;
1137 /* For a regular vector delete (aka, no size argument) we will pass
1138 this down as a NULL_TREE into build_vec_delete. */
1139 tree maxindex = NULL_TREE;
1141 if (exp == error_mark_node)
1144 if (processing_template_decl)
1146 t = build_min (DELETE_EXPR, void_type_node, exp, size);
1147 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
1148 DELETE_EXPR_USE_VEC (t) = doing_vec;
1152 if (TREE_CODE (exp) == OFFSET_REF)
1153 exp = resolve_offset_ref (exp);
1154 exp = convert_from_reference (exp);
1155 t = stabilize_reference (exp);
1156 t = build_expr_type_conversion (WANT_POINTER, t, 1);
1158 if (t == NULL_TREE || t == error_mark_node)
1160 cp_error ("type `%#T' argument given to `delete', expected pointer",
1162 return error_mark_node;
1167 maxindex = build_binary_op (MINUS_EXPR, size, integer_one_node);
1168 pedwarn ("anachronistic use of array size in vector delete");
1171 type = TREE_TYPE (t);
1173 /* As of Valley Forge, you can delete a pointer to const. */
1175 /* You can't delete functions. */
1176 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
1178 error ("cannot delete a function");
1179 return error_mark_node;
1182 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1183 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
1184 cp_warning ("`%T' is not a pointer-to-object type", type);
1186 /* An array can't have been allocated by new, so complain. */
1187 if (TREE_CODE (t) == ADDR_EXPR
1188 && TREE_CODE (TREE_OPERAND (t, 0)) == VAR_DECL
1189 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == ARRAY_TYPE)
1190 cp_warning ("deleting array `%#D'", TREE_OPERAND (t, 0));
1192 /* Deleting a pointer with the value zero is valid and has no effect. */
1193 if (integer_zerop (t))
1194 return build1 (NOP_EXPR, void_type_node, t);
1197 return build_vec_delete (t, maxindex, integer_one_node,
1198 integer_zero_node, use_global_delete);
1201 if (IS_AGGR_TYPE (TREE_TYPE (type))
1202 && TYPE_GETS_REG_DELETE (TREE_TYPE (type)))
1204 /* Only do access checking here; we'll be calling op delete
1205 from the destructor. */
1206 tree tmp = build_op_delete_call (DELETE_EXPR, t, size_zero_node,
1207 LOOKUP_NORMAL, NULL_TREE);
1208 if (tmp == error_mark_node)
1209 return error_mark_node;
1212 return build_delete (type, t, integer_three_node,
1213 LOOKUP_NORMAL, use_global_delete);
1217 /* Report an error if the indicated template declaration is not the
1218 sort of thing that should be a member template. */
1221 check_member_template (tmpl)
1226 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
1227 decl = DECL_TEMPLATE_RESULT (tmpl);
1229 if (TREE_CODE (decl) == FUNCTION_DECL
1230 || (TREE_CODE (decl) == TYPE_DECL
1231 && IS_AGGR_TYPE (TREE_TYPE (decl))))
1233 if (current_function_decl)
1234 /* 14.5.2.2 [temp.mem]
1236 A local class shall not have member templates. */
1237 cp_error ("declaration of member template `%#D' in local class",
1240 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
1242 /* 14.5.2.3 [temp.mem]
1244 A member function template shall not be virtual. */
1246 ("invalid use of `virtual' in template declaration of `%#D'",
1248 DECL_VIRTUAL_P (decl) = 0;
1251 /* The debug-information generating code doesn't know what to do
1252 with member templates. */
1253 DECL_IGNORED_P (tmpl) = 1;
1256 cp_error ("template declaration of `%#D'", decl);
1259 /* Return true iff TYPE is a valid Java parameter or return type. */
1262 acceptable_java_type (type)
1265 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
1267 if (TREE_CODE (type) == POINTER_TYPE)
1269 type = TREE_TYPE (type);
1270 if (TREE_CODE (type) == RECORD_TYPE)
1273 if (! TYPE_FOR_JAVA (type))
1275 if (! CLASSTYPE_TEMPLATE_INFO (type))
1277 args = CLASSTYPE_TI_ARGS (type);
1278 i = TREE_VEC_LENGTH (args);
1281 type = TREE_VEC_ELT (args, i);
1282 if (TREE_CODE (type) == POINTER_TYPE)
1283 type = TREE_TYPE (type);
1284 if (! TYPE_FOR_JAVA (type))
1293 /* For a METHOD in a Java class CTYPE, return 1 if
1294 the parameter and return types are valid Java types.
1295 Otherwise, print appropriate error messages, and return 0. */
1298 check_java_method (method)
1302 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
1303 tree ret_type = TREE_TYPE (TREE_TYPE (method));
1304 if (! acceptable_java_type (ret_type))
1306 cp_error ("Java method '%D' has non-Java return type `%T'",
1310 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
1312 tree type = TREE_VALUE (arg_types);
1313 if (! acceptable_java_type (type))
1315 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1320 return jerr ? 0 : 1;
1323 /* Sanity check: report error if this function FUNCTION is not
1324 really a member of the class (CTYPE) it is supposed to belong to.
1325 CNAME is the same here as it is for grokclassfn above. */
1328 check_classfn (ctype, function)
1329 tree ctype, function;
1331 tree fn_name = DECL_NAME (function);
1332 tree fndecl, fndecls;
1333 tree method_vec = CLASSTYPE_METHOD_VEC (complete_type (ctype));
1337 if (DECL_USE_TEMPLATE (function)
1338 && is_member_template (DECL_TI_TEMPLATE (function)))
1339 /* Since this is a specialization of a member template,
1340 we're not going to find the declaration in the class.
1343 struct S { template <typename T> void f(T); };
1344 template <> void S::f(int);
1346 we're not going to find `S::f(int)', but there's no
1347 reason we should, either. We let our callers know we didn't
1348 find the method, but we don't complain. */
1351 if (method_vec != 0)
1353 methods = &TREE_VEC_ELT (method_vec, 0);
1354 end = TREE_VEC_END (method_vec);
1356 /* First suss out ctors and dtors. */
1357 if (*methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1358 && DECL_CONSTRUCTOR_P (function))
1360 if (*++methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1361 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function)))
1364 while (++methods != end && *methods)
1367 if (fn_name == DECL_NAME (OVL_CURRENT (*methods)))
1370 for (fndecls = *methods; fndecls != NULL_TREE;
1371 fndecls = OVL_NEXT (fndecls))
1373 fndecl = OVL_CURRENT (fndecls);
1374 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1375 for a for member function of a template class, is
1376 not mangled, so the check below does not work
1377 correctly in that case. Since mangled destructor
1378 names do not include the type of the arguments,
1379 we can't use this short-cut for them, either.
1380 (It's not legal to declare arguments for a
1381 destructor, but some people try.) */
1382 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function))
1383 && (DECL_ASSEMBLER_NAME (function)
1384 != DECL_NAME (function))
1385 && (DECL_ASSEMBLER_NAME (fndecl)
1386 != DECL_NAME (fndecl))
1387 && (DECL_ASSEMBLER_NAME (function)
1388 == DECL_ASSEMBLER_NAME (fndecl)))
1391 /* We cannot simply call decls_match because this
1392 doesn't work for static member functions that are
1393 pretending to be methods, and because the name
1394 may have been changed by asm("new_name"). */
1395 if (DECL_NAME (function) == DECL_NAME (fndecl))
1397 tree p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
1398 tree p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1400 /* Get rid of the this parameter on functions that become
1402 if (DECL_STATIC_FUNCTION_P (fndecl)
1403 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1404 p1 = TREE_CHAIN (p1);
1406 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
1407 TREE_TYPE (TREE_TYPE (fndecl)))
1408 && compparms (p1, p2)
1409 && (DECL_TEMPLATE_SPECIALIZATION (function)
1410 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
1411 && (!DECL_TEMPLATE_SPECIALIZATION (function)
1412 || (DECL_TI_TEMPLATE (function)
1413 == DECL_TI_TEMPLATE (fndecl))))
1422 if (methods != end && *methods)
1424 tree fndecl = *methods;
1425 cp_error ("prototype for `%#D' does not match any in class `%T'",
1427 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl) ? "s are" : " is",
1428 OVL_CURRENT (fndecl));
1429 while (fndecl = OVL_NEXT (fndecl), fndecl)
1430 cp_error_at (" %#D", OVL_CURRENT(fndecl));
1435 if (TYPE_SIZE (ctype) == 0)
1436 incomplete_type_error (function, ctype);
1438 cp_error ("no `%#D' member function declared in class `%T'",
1442 /* If we did not find the method in the class, add it to avoid
1443 spurious errors (unless the CTYPE is not yet defined, in which
1444 case we'll only confuse ourselves when the function is declared
1445 properly within the class. */
1446 if (TYPE_SIZE (ctype))
1447 add_method (ctype, methods, function);
1451 /* We have just processed the DECL, which is a static data member.
1452 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1453 present, is the assembly-language name for the data member.
1454 FLAGS is as for cp_finish_decl. */
1457 finish_static_data_member_decl (decl, init, asmspec_tree, flags)
1463 const char *asmspec = 0;
1466 asmspec = TREE_STRING_POINTER (asmspec_tree);
1468 my_friendly_assert (TREE_PUBLIC (decl), 0);
1470 /* We cannot call pushdecl here, because that would fill in the
1471 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1472 the right thing, namely, to put this decl out straight away. */
1473 /* current_class_type can be NULL_TREE in case of error. */
1474 if (!asmspec && current_class_type)
1476 DECL_INITIAL (decl) = error_mark_node;
1477 DECL_ASSEMBLER_NAME (decl)
1478 = build_static_name (current_class_type, DECL_NAME (decl));
1480 if (! processing_template_decl)
1482 if (!pending_statics)
1483 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
1485 if (pending_statics_used == pending_statics->num_elements)
1486 VARRAY_GROW (pending_statics,
1487 2 * pending_statics->num_elements);
1488 VARRAY_TREE (pending_statics, pending_statics_used) = decl;
1489 ++pending_statics_used;
1492 /* Static consts need not be initialized in the class definition. */
1493 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
1495 static int explanation = 0;
1497 error ("initializer invalid for static member with constructor");
1498 if (explanation++ == 0)
1499 error ("(you really want to initialize it separately)");
1502 /* Force the compiler to know when an uninitialized static const
1503 member is being used. */
1504 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
1505 TREE_USED (decl) = 1;
1506 DECL_INITIAL (decl) = init;
1507 DECL_IN_AGGR_P (decl) = 1;
1508 DECL_CONTEXT (decl) = current_class_type;
1509 DECL_CLASS_CONTEXT (decl) = current_class_type;
1511 cp_finish_decl (decl, init, asmspec_tree, flags);
1514 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1515 of a structure component, returning a FIELD_DECL node.
1516 QUALS is a list of type qualifiers for this decl (such as for declaring
1517 const member functions).
1519 This is done during the parsing of the struct declaration.
1520 The FIELD_DECL nodes are chained together and the lot of them
1521 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1525 If class A defines that certain functions in class B are friends, then
1526 the way I have set things up, it is B who is interested in permission
1527 granted by A. However, it is in A's context that these declarations
1528 are parsed. By returning a void_type_node, class A does not attempt
1529 to incorporate the declarations of the friends within its structure.
1531 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1532 CHANGES TO CODE IN `start_method'. */
1535 grokfield (declarator, declspecs, init, asmspec_tree, attrlist)
1536 tree declarator, declspecs, init, asmspec_tree, attrlist;
1538 register tree value;
1539 const char *asmspec = 0;
1540 int flags = LOOKUP_ONLYCONVERTING;
1542 /* Convert () initializers to = initializers. */
1543 if (init == NULL_TREE && declarator != NULL_TREE
1544 && TREE_CODE (declarator) == CALL_EXPR
1545 && TREE_OPERAND (declarator, 0)
1546 && (TREE_CODE (TREE_OPERAND (declarator, 0)) == IDENTIFIER_NODE
1547 || TREE_CODE (TREE_OPERAND (declarator, 0)) == SCOPE_REF)
1548 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator)))
1550 init = TREE_OPERAND (declarator, 1);
1551 declarator = TREE_OPERAND (declarator, 0);
1555 if (declspecs == NULL_TREE
1556 && TREE_CODE (declarator) == SCOPE_REF
1557 && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
1559 /* Access declaration */
1560 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
1562 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
1563 pop_nested_class ();
1564 return do_class_using_decl (declarator);
1568 && TREE_CODE (init) == TREE_LIST
1569 && TREE_VALUE (init) == error_mark_node
1570 && TREE_CHAIN (init) == NULL_TREE)
1573 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, attrlist);
1574 if (! value || value == error_mark_node)
1575 /* friend or constructor went bad. */
1578 /* Pass friendly classes back. */
1579 if (TREE_CODE (value) == VOID_TYPE)
1580 return void_type_node;
1582 if (DECL_NAME (value) != NULL_TREE
1583 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
1584 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
1585 cp_error ("member `%D' conflicts with virtual function table field name",
1588 /* Stash away type declarations. */
1589 if (TREE_CODE (value) == TYPE_DECL)
1591 DECL_NONLOCAL (value) = 1;
1592 DECL_CONTEXT (value) = current_class_type;
1593 DECL_CLASS_CONTEXT (value) = current_class_type;
1595 /* Now that we've updated the context, we need to remangle the
1596 name for this TYPE_DECL. */
1597 DECL_ASSEMBLER_NAME (value) = DECL_NAME (value);
1598 if (!uses_template_parms (value))
1599 DECL_ASSEMBLER_NAME (value) =
1600 get_identifier (build_overload_name (TREE_TYPE (value), 1, 1));
1602 if (processing_template_decl)
1603 value = push_template_decl (value);
1608 if (DECL_IN_AGGR_P (value))
1610 cp_error ("`%D' is already defined in `%T'", value,
1611 DECL_CONTEXT (value));
1612 return void_type_node;
1616 asmspec = TREE_STRING_POINTER (asmspec_tree);
1620 if (TREE_CODE (value) == FUNCTION_DECL)
1622 grok_function_init (value, init);
1625 else if (pedantic && TREE_CODE (value) != VAR_DECL)
1626 /* Already complained in grokdeclarator. */
1630 /* We allow initializers to become parameters to base
1632 if (TREE_CODE (init) == TREE_LIST)
1634 if (TREE_CHAIN (init) == NULL_TREE)
1635 init = TREE_VALUE (init);
1637 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1640 if (TREE_CODE (init) == CONST_DECL)
1641 init = DECL_INITIAL (init);
1642 else if (TREE_READONLY_DECL_P (init))
1643 init = decl_constant_value (init);
1644 else if (TREE_CODE (init) == CONSTRUCTOR)
1645 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1646 if (init == error_mark_node)
1647 /* We must make this look different than `error_mark_node'
1648 because `decl_const_value' would mis-interpret it
1649 as only meaning that this VAR_DECL is defined. */
1650 init = build1 (NOP_EXPR, TREE_TYPE (value), init);
1651 else if (processing_template_decl)
1653 else if (! TREE_CONSTANT (init))
1655 /* We can allow references to things that are effectively
1656 static, since references are initialized with the address. */
1657 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
1658 || (TREE_STATIC (init) == 0
1659 && (TREE_CODE_CLASS (TREE_CODE (init)) != 'd'
1660 || DECL_EXTERNAL (init) == 0)))
1662 error ("field initializer is not constant");
1663 init = error_mark_node;
1669 if (processing_template_decl && ! current_function_decl
1670 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
1671 value = push_template_decl (value);
1674 cplus_decl_attributes (value, TREE_PURPOSE (attrlist),
1675 TREE_VALUE (attrlist));
1677 if (TREE_CODE (value) == VAR_DECL)
1679 finish_static_data_member_decl (value, init, asmspec_tree,
1683 if (TREE_CODE (value) == FIELD_DECL)
1687 /* This must override the asm specifier which was placed
1688 by grokclassfn. Lay this out fresh. */
1689 DECL_RTL (value) = NULL_RTX;
1690 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1692 if (DECL_INITIAL (value) == error_mark_node)
1693 init = error_mark_node;
1694 cp_finish_decl (value, init, asmspec_tree, flags);
1695 DECL_INITIAL (value) = init;
1696 DECL_IN_AGGR_P (value) = 1;
1699 if (TREE_CODE (value) == FUNCTION_DECL)
1703 /* This must override the asm specifier which was placed
1704 by grokclassfn. Lay this out fresh. */
1705 DECL_RTL (value) = NULL_RTX;
1706 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1708 cp_finish_decl (value, init, asmspec_tree, flags);
1710 /* Pass friends back this way. */
1711 if (DECL_FRIEND_P (value))
1712 return void_type_node;
1714 DECL_IN_AGGR_P (value) = 1;
1717 my_friendly_abort (21);
1722 /* Like `grokfield', but for bitfields.
1723 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1726 grokbitfield (declarator, declspecs, width)
1727 tree declarator, declspecs, width;
1729 register tree value = grokdeclarator (declarator, declspecs, BITFIELD,
1732 if (! value) return NULL_TREE; /* friends went bad. */
1734 /* Pass friendly classes back. */
1735 if (TREE_CODE (value) == VOID_TYPE)
1736 return void_type_node;
1738 if (TREE_CODE (value) == TYPE_DECL)
1740 cp_error ("cannot declare `%D' to be a bitfield type", value);
1744 /* Usually, finish_struct_1 catches bitifields with invalid types.
1745 But, in the case of bitfields with function type, we confuse
1746 ourselves into thinking they are member functions, so we must
1748 if (TREE_CODE (value) == FUNCTION_DECL)
1750 cp_error ("cannot declare bitfield `%D' with funcion type",
1755 if (DECL_IN_AGGR_P (value))
1757 cp_error ("`%D' is already defined in the class %T", value,
1758 DECL_CONTEXT (value));
1759 return void_type_node;
1762 GNU_xref_member (current_class_name, value);
1764 if (TREE_STATIC (value))
1766 cp_error ("static member `%D' cannot be a bitfield", value);
1769 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1771 if (width != error_mark_node)
1773 constant_expression_warning (width);
1774 DECL_INITIAL (value) = width;
1775 SET_DECL_C_BIT_FIELD (value);
1778 DECL_IN_AGGR_P (value) = 1;
1783 grokoptypename (declspecs, declarator)
1784 tree declspecs, declarator;
1786 tree t = grokdeclarator (declarator, declspecs, TYPENAME, 0, NULL_TREE);
1787 return build_typename_overload (t);
1790 /* When a function is declared with an initializer,
1791 do the right thing. Currently, there are two possibilities:
1796 // initialization possibility #1.
1797 virtual void f () = 0;
1819 // initialization possibility #2
1826 copy_assignment_arg_p (parmtype, virtualp)
1828 int virtualp ATTRIBUTE_UNUSED;
1830 if (current_class_type == NULL_TREE)
1833 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
1834 parmtype = TREE_TYPE (parmtype);
1836 if ((TYPE_MAIN_VARIANT (parmtype) == current_class_type)
1838 /* Non-standard hack to support old Booch components. */
1839 || (! virtualp && DERIVED_FROM_P (parmtype, current_class_type))
1848 grok_function_init (decl, init)
1852 /* An initializer for a function tells how this function should
1854 tree type = TREE_TYPE (decl);
1856 if (TREE_CODE (type) == FUNCTION_TYPE)
1857 cp_error ("initializer specified for non-member function `%D'", decl);
1859 /* We'll check for this in finish_struct_1. */
1860 else if (DECL_VINDEX (decl) == NULL_TREE)
1861 cp_error ("initializer specified for non-virtual method `%D'", decl);
1863 else if (integer_zerop (init))
1866 /* Mark this function as being "defined". */
1867 DECL_INITIAL (decl) = error_mark_node;
1868 /* pure virtual destructors must be defined. */
1869 /* pure virtual needs to be defined (as abort) only when put in
1870 vtbl. For wellformed call, it should be itself. pr4737 */
1871 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl)))
1873 /* Give this node rtl from `abort'. */
1874 DECL_RTL (decl) = DECL_RTL (abort_fndecl);
1877 DECL_ABSTRACT_VIRTUAL_P (decl) = 1;
1878 if (DECL_NAME (decl) == ansi_opname [(int) MODIFY_EXPR])
1881 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl))));
1883 if (copy_assignment_arg_p (parmtype, 1))
1884 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type) = 1;
1888 cp_error ("invalid initializer for virtual method `%D'", decl);
1892 cplus_decl_attributes (decl, attributes, prefix_attributes)
1893 tree decl, attributes, prefix_attributes;
1895 if (decl == NULL_TREE || decl == void_type_node)
1898 if (TREE_CODE (decl) == TEMPLATE_DECL)
1899 decl = DECL_TEMPLATE_RESULT (decl);
1901 decl_attributes (decl, attributes, prefix_attributes);
1903 if (TREE_CODE (decl) == TYPE_DECL)
1904 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl), TREE_TYPE (decl));
1907 /* CONSTRUCTOR_NAME:
1908 Return the name for the constructor (or destructor) for the
1909 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1910 IDENTIFIER_NODE. When given a template, this routine doesn't
1911 lose the specialization. */
1914 constructor_name_full (thing)
1917 if (TREE_CODE (thing) == TEMPLATE_TYPE_PARM
1918 || TREE_CODE (thing) == TEMPLATE_TEMPLATE_PARM
1919 || TREE_CODE (thing) == TYPENAME_TYPE)
1920 thing = TYPE_NAME (thing);
1921 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing)))
1923 if (TYPE_WAS_ANONYMOUS (thing) && TYPE_HAS_CONSTRUCTOR (thing))
1924 thing = DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing), 0)));
1926 thing = TYPE_NAME (thing);
1928 if (TREE_CODE (thing) == TYPE_DECL
1929 || (TREE_CODE (thing) == TEMPLATE_DECL
1930 && TREE_CODE (DECL_TEMPLATE_RESULT (thing)) == TYPE_DECL))
1931 thing = DECL_NAME (thing);
1932 my_friendly_assert (TREE_CODE (thing) == IDENTIFIER_NODE, 197);
1936 /* CONSTRUCTOR_NAME:
1937 Return the name for the constructor (or destructor) for the
1938 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1939 IDENTIFIER_NODE. When given a template, return the plain
1940 unspecialized name. */
1943 constructor_name (thing)
1947 thing = constructor_name_full (thing);
1948 t = IDENTIFIER_TEMPLATE (thing);
1954 /* Record the existence of an addressable inline function. */
1957 mark_inline_for_output (decl)
1960 decl = DECL_MAIN_VARIANT (decl);
1961 if (DECL_SAVED_INLINE (decl))
1963 DECL_SAVED_INLINE (decl) = 1;
1965 VARRAY_TREE_INIT (saved_inlines, 32, "saved_inlines");
1967 if (saved_inlines_used == saved_inlines->num_elements)
1968 VARRAY_GROW (saved_inlines,
1969 2 * saved_inlines->num_elements);
1970 VARRAY_TREE (saved_inlines, saved_inlines_used) = decl;
1971 ++saved_inlines_used;
1974 /* Hand off a unique name which can be used for variable we don't really
1975 want to know about anyway, for example, the anonymous variables which
1976 are needed to make references work. Declare this thing so we can use it.
1977 The variable created will be of type TYPE.
1979 STATICP is nonzero if this variable should be static. */
1982 get_temp_name (type, staticp)
1986 char buf[sizeof (AUTO_TEMP_FORMAT) + 20];
1988 int toplev = toplevel_bindings_p ();
1990 if (toplev || staticp)
1992 sprintf (buf, AUTO_TEMP_FORMAT, global_temp_name_counter++);
1993 decl = pushdecl_top_level (build_decl (VAR_DECL, get_identifier (buf), type));
1997 sprintf (buf, AUTO_TEMP_FORMAT, temp_name_counter++);
1998 decl = pushdecl (build_decl (VAR_DECL, get_identifier (buf), type));
2000 TREE_USED (decl) = 1;
2001 TREE_STATIC (decl) = staticp;
2002 DECL_ARTIFICIAL (decl) = 1;
2004 /* If this is a local variable, then lay out its rtl now.
2005 Otherwise, callers of this function are responsible for dealing
2006 with this variable's rtl. */
2010 my_friendly_assert (DECL_INITIAL (decl) == NULL_TREE,
2017 /* Hunts through the global anonymous union ANON_DECL, building
2018 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2019 returns a VAR_DECL whose size is the same as the size of the
2020 ANON_DECL, if one is available. */
2023 build_anon_union_vars (anon_decl, elems, static_p, external_p)
2029 tree type = TREE_TYPE (anon_decl);
2030 tree main_decl = NULL_TREE;
2033 /* Rather than write the code to handle the non-union case,
2034 just give an error. */
2035 if (TREE_CODE (type) != UNION_TYPE)
2036 error ("anonymous struct not inside named type");
2038 for (field = TYPE_FIELDS (type);
2040 field = TREE_CHAIN (field))
2044 if (DECL_ARTIFICIAL (field))
2046 if (TREE_CODE (field) != FIELD_DECL)
2048 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2053 if (TREE_PRIVATE (field))
2054 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
2055 else if (TREE_PROTECTED (field))
2056 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
2058 if (DECL_NAME (field) == NULL_TREE
2059 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2061 decl = build_anon_union_vars (field, elems, static_p, external_p);
2065 else if (DECL_NAME (field) == NULL_TREE)
2069 decl = build_decl (VAR_DECL, DECL_NAME (field), TREE_TYPE (field));
2070 /* tell `pushdecl' that this is not tentative. */
2071 DECL_INITIAL (decl) = error_mark_node;
2072 TREE_PUBLIC (decl) = 0;
2073 TREE_STATIC (decl) = static_p;
2074 DECL_EXTERNAL (decl) = external_p;
2075 decl = pushdecl (decl);
2076 DECL_INITIAL (decl) = NULL_TREE;
2079 /* Only write out one anon union element--choose the one that
2080 can hold them all. */
2081 if (main_decl == NULL_TREE
2082 && simple_cst_equal (DECL_SIZE (decl),
2083 DECL_SIZE (anon_decl)) == 1)
2086 /* ??? This causes there to be no debug info written out
2088 TREE_ASM_WRITTEN (decl) = 1;
2090 if (DECL_NAME (field) == NULL_TREE
2091 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2092 /* The remainder of the processing was already done in the
2096 /* If there's a cleanup to do, it belongs in the
2097 TREE_PURPOSE of the following TREE_LIST. */
2098 *elems = tree_cons (NULL_TREE, decl, *elems);
2099 TREE_TYPE (*elems) = type;
2105 /* Finish off the processing of a UNION_TYPE structure.
2106 If there are static members, then all members are
2107 static, and must be laid out together. If the
2108 union is an anonymous union, we arrange for that
2109 as well. PUBLIC_P is nonzero if this union is
2110 not declared static. */
2113 finish_anon_union (anon_union_decl)
2114 tree anon_union_decl;
2116 tree type = TREE_TYPE (anon_union_decl);
2118 int public_p = TREE_PUBLIC (anon_union_decl);
2119 int static_p = TREE_STATIC (anon_union_decl);
2120 int external_p = DECL_EXTERNAL (anon_union_decl);
2122 if (TYPE_FIELDS (type) == NULL_TREE)
2127 error ("global anonymous unions must be declared static");
2131 main_decl = build_anon_union_vars (anon_union_decl,
2132 &DECL_ANON_UNION_ELEMS (anon_union_decl),
2133 static_p, external_p);
2135 if (main_decl == NULL_TREE)
2137 warning ("anonymous union with no members");
2143 make_decl_rtl (main_decl, 0, toplevel_bindings_p ());
2144 DECL_RTL (anon_union_decl) = DECL_RTL (main_decl);
2145 expand_anon_union_decl (anon_union_decl,
2147 DECL_ANON_UNION_ELEMS (anon_union_decl));
2150 add_decl_stmt (anon_union_decl);
2153 /* Finish processing a builtin type TYPE. It's name is NAME,
2154 its fields are in the array FIELDS. LEN is the number of elements
2155 in FIELDS minus one, or put another way, it is the maximum subscript
2158 It is given the same alignment as ALIGN_TYPE. */
2161 finish_builtin_type (type, name, fields, len, align_type)
2170 TYPE_FIELDS (type) = fields[0];
2171 for (i = 0; i < len; i++)
2173 layout_type (TREE_TYPE (fields[i]));
2174 DECL_FIELD_CONTEXT (fields[i]) = type;
2175 TREE_CHAIN (fields[i]) = fields[i+1];
2177 DECL_FIELD_CONTEXT (fields[i]) = type;
2178 DECL_CLASS_CONTEXT (fields[i]) = type;
2179 TYPE_ALIGN (type) = TYPE_ALIGN (align_type);
2181 #if 0 /* not yet, should get fixed properly later */
2182 TYPE_NAME (type) = make_type_decl (get_identifier (name), type);
2184 TYPE_NAME (type) = build_decl (TYPE_DECL, get_identifier (name), type);
2186 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2187 layout_decl (TYPE_NAME (type), 0);
2190 /* Auxiliary functions to make type signatures for
2191 `operator new' and `operator delete' correspond to
2192 what compiler will be expecting. */
2195 coerce_new_type (type)
2200 if (TREE_CODE (type) == METHOD_TYPE)
2201 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (TYPE_ARG_TYPES (type)));
2202 if (! same_type_p (TREE_TYPE (type), ptr_type_node))
2203 e1 = 1, error ("`operator new' must return type `void *'");
2205 /* Technically the type must be `size_t', but we may not know
2207 if (TYPE_ARG_TYPES (type) == NULL_TREE)
2208 e1 = 1, error ("`operator new' takes type `size_t' parameter");
2209 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type)), sizetype))
2210 e2 = 1, error ("`operator new' takes type `size_t' as first parameter");
2212 type = build_function_type (ptr_type_node, tree_cons (NULL_TREE, sizetype, TREE_CHAIN (TYPE_ARG_TYPES (type))));
2214 type = build_function_type (ptr_type_node, TYPE_ARG_TYPES (type));
2219 coerce_delete_type (type)
2226 tree arg_types = TYPE_ARG_TYPES (type);
2228 if (TREE_CODE (type) == METHOD_TYPE)
2230 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (arg_types));
2231 arg_types = TREE_CHAIN (arg_types);
2234 if (TREE_TYPE (type) != void_type_node)
2235 e1 = 1, error ("`operator delete' must return type `void'");
2237 if (arg_types == NULL_TREE
2238 || ! same_type_p (TREE_VALUE (arg_types), ptr_type_node))
2239 e2 = 1, error ("`operator delete' takes type `void *' as first parameter");
2243 && TREE_CHAIN (arg_types)
2244 && TREE_CHAIN (arg_types) != void_list_node)
2246 /* Again, technically this argument must be `size_t', but again
2247 we may not know what that is. */
2248 tree t2 = TREE_VALUE (TREE_CHAIN (arg_types));
2249 if (! same_type_p (t2, sizetype))
2250 e3 = 1, error ("second argument to `operator delete' must be of type `size_t'");
2251 else if (TREE_CHAIN (TREE_CHAIN (arg_types)) != void_list_node)
2254 if (TREE_CHAIN (TREE_CHAIN (arg_types)))
2255 error ("too many arguments in declaration of `operator delete'");
2257 error ("`...' invalid in specification of `operator delete'");
2262 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2263 build_tree_list (NULL_TREE, sizetype));
2266 if (arg_types == NULL_TREE)
2267 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
2269 arg_types = tree_cons (NULL_TREE, ptr_type_node, TREE_CHAIN (arg_types));
2275 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2276 arg_types ? TREE_CHAIN (arg_types): NULL_TREE);
2278 type = build_function_type (void_type_node, arg_types);
2284 mark_vtable_entries (decl)
2287 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
2289 for (; entries; entries = TREE_CHAIN (entries))
2294 fnaddr = (flag_vtable_thunks ? TREE_VALUE (entries)
2295 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries)));
2297 if (TREE_CODE (fnaddr) == NOP_EXPR)
2301 fn = TREE_OPERAND (fnaddr, 0);
2302 TREE_ADDRESSABLE (fn) = 1;
2303 if (TREE_CODE (fn) == THUNK_DECL && DECL_EXTERNAL (fn))
2305 DECL_EXTERNAL (fn) = 0;
2312 /* Set DECL up to have the closest approximation of "initialized common"
2313 linkage available. */
2316 comdat_linkage (decl)
2320 make_decl_one_only (decl);
2321 else if (TREE_CODE (decl) == FUNCTION_DECL || DECL_VIRTUAL_P (decl))
2322 /* We can just emit functions and vtables statically; it doesn't really
2323 matter if we have multiple copies. */
2324 TREE_PUBLIC (decl) = 0;
2327 /* Static data member template instantiations, however, cannot
2328 have multiple copies. */
2329 if (DECL_INITIAL (decl) == 0
2330 || DECL_INITIAL (decl) == error_mark_node)
2331 DECL_COMMON (decl) = 1;
2332 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
2334 DECL_COMMON (decl) = 1;
2335 DECL_INITIAL (decl) = error_mark_node;
2339 /* We can't do anything useful; leave vars for explicit
2341 DECL_EXTERNAL (decl) = 1;
2342 DECL_NOT_REALLY_EXTERN (decl) = 0;
2346 if (DECL_LANG_SPECIFIC (decl))
2347 DECL_COMDAT (decl) = 1;
2349 if (TREE_CODE (decl) == FUNCTION_DECL)
2350 DECL_DEFER_OUTPUT (decl) = 1;
2353 /* For win32 we also want to put explicit instantiations in
2354 linkonce sections, so that they will be merged with implicit
2355 instantiations; otherwise we get duplicate symbol errors. */
2358 maybe_make_one_only (decl)
2361 /* We used to say that this was not necessary on targets that support weak
2362 symbols, because the implicit instantiations will defer to the explicit
2363 one. However, that's not actually the case in SVR4; a strong definition
2364 after a weak one is an error. Also, not making explicit
2365 instantiations one_only means that we can end up with two copies of
2366 some template instantiations. */
2367 if (! supports_one_only ())
2370 /* We can't set DECL_COMDAT on functions, or finish_file will think
2371 we can get away with not emitting them if they aren't used. We need
2372 to for variables so that cp_finish_decl will update their linkage,
2373 because their DECL_INITIAL may not have been set properly yet. */
2375 make_decl_one_only (decl);
2377 if (TREE_CODE (decl) == VAR_DECL && DECL_LANG_SPECIFIC (decl))
2378 DECL_COMDAT (decl) = 1;
2381 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2382 based on TYPE and other static flags.
2384 Note that anything public is tagged TREE_PUBLIC, whether
2385 it's public in this file or in another one. */
2388 import_export_vtable (decl, type, final)
2392 if (DECL_INTERFACE_KNOWN (decl))
2395 if (TYPE_FOR_JAVA (type))
2397 TREE_PUBLIC (decl) = 1;
2398 DECL_EXTERNAL (decl) = 1;
2399 DECL_INTERFACE_KNOWN (decl) = 1;
2401 else if (CLASSTYPE_INTERFACE_KNOWN (type))
2403 TREE_PUBLIC (decl) = 1;
2404 DECL_EXTERNAL (decl) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type);
2405 DECL_INTERFACE_KNOWN (decl) = 1;
2409 /* We can only wait to decide if we have real non-inline virtual
2410 functions in our class, or if we come from a template. */
2412 int found = CLASSTYPE_TEMPLATE_INSTANTIATION (type);
2414 if (! found && ! final)
2417 for (method = TYPE_METHODS (type); method != NULL_TREE;
2418 method = TREE_CHAIN (method))
2419 if (DECL_VINDEX (method) != NULL_TREE
2420 && ! DECL_THIS_INLINE (method)
2421 && ! DECL_ABSTRACT_VIRTUAL_P (method))
2428 if (final || ! found)
2430 comdat_linkage (decl);
2431 DECL_EXTERNAL (decl) = 0;
2435 TREE_PUBLIC (decl) = 1;
2436 DECL_EXTERNAL (decl) = 1;
2441 /* Determine whether or not we want to specifically import or export CTYPE,
2442 using various heuristics. */
2445 import_export_class (ctype)
2448 /* -1 for imported, 1 for exported. */
2449 int import_export = 0;
2451 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
2454 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2455 we will have CLASSTYPE_INTERFACE_ONLY set but not
2456 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2457 heuristic because someone will supply a #pragma implementation
2458 elsewhere, and deducing it here would produce a conflict. */
2459 if (CLASSTYPE_INTERFACE_ONLY (ctype))
2462 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2463 /* FIXME this should really use some sort of target-independent macro. */
2464 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
2466 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
2470 /* If we got -fno-implicit-templates, we import template classes that
2471 weren't explicitly instantiated. */
2472 if (import_export == 0
2473 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
2474 && ! flag_implicit_templates)
2477 /* Base our import/export status on that of the first non-inline,
2478 non-abstract virtual function, if any. */
2479 if (import_export == 0
2480 && TYPE_VIRTUAL_P (ctype)
2481 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
2484 for (method = TYPE_METHODS (ctype); method != NULL_TREE;
2485 method = TREE_CHAIN (method))
2487 if (DECL_VINDEX (method) != NULL_TREE
2488 && !DECL_THIS_INLINE (method)
2489 && !DECL_ABSTRACT_VIRTUAL_P (method))
2491 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
2497 #ifdef MULTIPLE_SYMBOL_SPACES
2498 if (import_export == -1)
2504 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
2505 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype) = (import_export > 0);
2506 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
2510 /* We need to describe to the assembler the relationship between
2511 a vtable and the vtable of the parent class. */
2514 output_vtable_inherit (vars)
2520 op[0] = XEXP (DECL_RTL (vars), 0); /* strip the mem ref */
2522 parent = binfo_for_vtable (vars);
2524 if (parent == TYPE_BINFO (DECL_CONTEXT (vars)))
2528 parent = TYPE_BINFO_VTABLE (BINFO_TYPE (parent));
2529 op[1] = XEXP (DECL_RTL (parent), 0); /* strip the mem ref */
2532 my_friendly_abort (980826);
2534 output_asm_insn (".vtable_inherit %c0, %c1", op);
2538 finish_vtable_vardecl (t, data)
2540 void *data ATTRIBUTE_UNUSED;
2543 tree ctype = DECL_CONTEXT (vars);
2544 import_export_class (ctype);
2545 import_export_vtable (vars, ctype, 1);
2547 if (! DECL_EXTERNAL (vars)
2548 && (DECL_INTERFACE_KNOWN (vars)
2549 || DECL_NEEDED_P (vars)
2550 || (hack_decl_function_context (vars) && TREE_USED (vars)))
2551 && ! TREE_ASM_WRITTEN (vars))
2554 mark_vtable_entries (vars);
2555 if (TREE_TYPE (DECL_INITIAL (vars)) == 0)
2556 store_init_value (vars, DECL_INITIAL (vars));
2558 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
2560 /* Mark the VAR_DECL node representing the vtable itself as a
2561 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2562 It is rather important that such things be ignored because
2563 any effort to actually generate DWARF for them will run
2564 into trouble when/if we encounter code like:
2567 struct S { virtual void member (); };
2569 because the artificial declaration of the vtable itself (as
2570 manufactured by the g++ front end) will say that the vtable
2571 is a static member of `S' but only *after* the debug output
2572 for the definition of `S' has already been output. This causes
2573 grief because the DWARF entry for the definition of the vtable
2574 will try to refer back to an earlier *declaration* of the
2575 vtable as a static member of `S' and there won't be one.
2576 We might be able to arrange to have the "vtable static member"
2577 attached to the member list for `S' before the debug info for
2578 `S' get written (which would solve the problem) but that would
2579 require more intrusive changes to the g++ front end. */
2581 DECL_IGNORED_P (vars) = 1;
2584 /* Always make vtables weak. */
2586 comdat_linkage (vars);
2588 rest_of_decl_compilation (vars, NULL_PTR, 1, 1);
2591 output_vtable_inherit (vars);
2593 /* Because we're only doing syntax-checking, we'll never end up
2594 actually marking the variable as written. */
2595 if (flag_syntax_only)
2596 TREE_ASM_WRITTEN (vars) = 1;
2598 /* Since we're writing out the vtable here, also write the debug
2600 if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (ctype)))
2602 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (ctype)) = 0;
2603 rest_of_type_compilation (ctype, toplevel_bindings_p ());
2608 else if (!DECL_NEEDED_P (vars))
2609 /* We don't know what to do with this one yet. */
2612 *t = TREE_CHAIN (vars);
2617 prune_vtable_vardecl (t, data)
2619 void *data ATTRIBUTE_UNUSED;
2621 *t = TREE_CHAIN (*t);
2625 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2626 inline function or template instantiation at end-of-file. */
2629 import_export_decl (decl)
2632 if (DECL_INTERFACE_KNOWN (decl))
2635 if (DECL_TEMPLATE_INSTANTIATION (decl)
2636 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2638 DECL_NOT_REALLY_EXTERN (decl) = 1;
2639 if ((DECL_IMPLICIT_INSTANTIATION (decl)
2640 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2641 && (flag_implicit_templates
2642 || (flag_implicit_inline_templates && DECL_THIS_INLINE (decl))))
2644 if (!TREE_PUBLIC (decl))
2645 /* Templates are allowed to have internal linkage. See
2649 comdat_linkage (decl);
2652 DECL_NOT_REALLY_EXTERN (decl) = 0;
2654 else if (DECL_FUNCTION_MEMBER_P (decl))
2656 tree ctype = DECL_CLASS_CONTEXT (decl);
2657 import_export_class (ctype);
2658 if (CLASSTYPE_INTERFACE_KNOWN (ctype)
2660 ? (! DECL_THIS_INLINE (decl))
2661 : (! DECL_ARTIFICIAL (decl) || DECL_VINDEX (decl))))
2663 DECL_NOT_REALLY_EXTERN (decl)
2664 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2665 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2666 && !DECL_VINDEX (decl)));
2668 /* Always make artificials weak. */
2669 if (DECL_ARTIFICIAL (decl) && flag_weak)
2670 comdat_linkage (decl);
2672 maybe_make_one_only (decl);
2675 comdat_linkage (decl);
2677 else if (DECL_TINFO_FN_P (decl))
2679 tree ctype = TREE_TYPE (DECL_NAME (decl));
2681 if (IS_AGGR_TYPE (ctype))
2682 import_export_class (ctype);
2684 if (IS_AGGR_TYPE (ctype) && CLASSTYPE_INTERFACE_KNOWN (ctype)
2685 && TYPE_VIRTUAL_P (ctype)
2686 /* If -fno-rtti, we're not necessarily emitting this stuff with
2687 the class, so go ahead and emit it now. This can happen
2688 when a class is used in exception handling. */
2690 /* If the type is a cv-qualified variant of a type, then we
2691 must emit the tinfo function in this translation unit
2692 since it will not be emitted when the vtable for the type
2693 is output (which is when the unqualified version is
2695 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2697 DECL_NOT_REALLY_EXTERN (decl)
2698 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2699 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2700 && !DECL_VINDEX (decl)));
2702 /* Always make artificials weak. */
2704 comdat_linkage (decl);
2706 else if (TYPE_BUILT_IN (ctype)
2707 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2708 DECL_NOT_REALLY_EXTERN (decl) = 0;
2710 comdat_linkage (decl);
2713 comdat_linkage (decl);
2715 DECL_INTERFACE_KNOWN (decl) = 1;
2719 build_cleanup (decl)
2723 tree type = TREE_TYPE (decl);
2725 if (TREE_CODE (type) == ARRAY_TYPE)
2729 mark_addressable (decl);
2730 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
2732 temp = build_delete (TREE_TYPE (temp), temp,
2734 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
2738 extern int parse_time, varconst_time;
2744 tree sname = get_id_2 ("__sn", base);
2745 /* For struct X foo __attribute__((weak)), there is a counter
2746 __snfoo. Since base is already an assembler name, sname should
2747 be globally unique */
2748 tree sentry = IDENTIFIER_GLOBAL_VALUE (sname);
2751 sentry = build_decl (VAR_DECL, sname, integer_type_node);
2752 TREE_PUBLIC (sentry) = 1;
2753 DECL_ARTIFICIAL (sentry) = 1;
2754 TREE_STATIC (sentry) = 1;
2755 TREE_USED (sentry) = 1;
2756 DECL_COMMON (sentry) = 1;
2757 pushdecl_top_level (sentry);
2758 cp_finish_decl (sentry, NULL_TREE, NULL_TREE, 0);
2763 /* Start the process of running a particular set of global constructors
2764 or destructors. Subroutine of do_[cd]tors. */
2767 start_objects (method_type, initp)
2768 int method_type, initp;
2774 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2776 if (initp != DEFAULT_INIT_PRIORITY)
2786 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
2789 sprintf (type, "%c", method_type);
2791 fnname = get_file_function_name_long (type);
2793 start_function (void_list_node,
2794 make_call_declarator (fnname, void_list_node, NULL_TREE,
2796 NULL_TREE, SF_DEFAULT);
2798 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2799 /* It can be a static function as long as collect2 does not have
2800 to scan the object file to find its ctor/dtor routine. */
2801 TREE_PUBLIC (current_function_decl) = 0;
2804 /* Mark this declaration as used to avoid spurious warnings. */
2805 TREE_USED (current_function_decl) = 1;
2807 /* Mark this function as a global constructor or destructor. */
2808 if (method_type == 'I')
2809 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
2811 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
2812 GLOBAL_INIT_PRIORITY (current_function_decl) = initp;
2814 body = begin_compound_stmt (/*has_no_scope=*/0);
2816 /* We cannot allow these functions to be elided, even if they do not
2817 have external linkage. And, there's no point in deferring
2818 copmilation of thes functions; they're all going to have to be
2820 current_function_cannot_inline
2821 = "static constructors and destructors cannot be inlined";
2826 /* Finish the process of running a particular set of global constructors
2827 or destructors. Subroutine of do_[cd]tors. */
2830 finish_objects (method_type, initp, body)
2831 int method_type, initp;
2838 finish_compound_stmt(/*has_no_scope=*/0, body);
2839 fn = finish_function (lineno, 0);
2842 /* When only doing semantic analysis, and no RTL generation, we
2843 can't call functions that directly emit assembly code; there is
2844 no assembly file in which to put the code. */
2845 if (flag_syntax_only)
2848 fnname = XSTR (XEXP (DECL_RTL (fn), 0), 0);
2849 if (initp == DEFAULT_INIT_PRIORITY)
2851 if (method_type == 'I')
2852 assemble_constructor (fnname);
2854 assemble_destructor (fnname);
2856 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2857 /* If we're using init priority we can't use assemble_*tor, but on ELF
2858 targets we can stick the references into named sections for GNU ld
2863 sprintf (buf, ".%ctors.%.5u", method_type == 'I' ? 'c' : 'd',
2864 /* invert the numbering so the linker puts us in the proper
2865 order; constructors are run from right to left, and the
2866 linker sorts in increasing order. */
2867 MAX_INIT_PRIORITY - initp);
2868 named_section (NULL_TREE, buf, 0);
2869 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, fnname),
2870 POINTER_SIZE / BITS_PER_UNIT, 1);
2875 /* The names of the parameters to the function created to handle
2876 initializations and destructions for objects with static storage
2878 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2879 #define PRIORITY_IDENTIFIER "__priority"
2881 /* The name of the function we create to handle initializations and
2882 destructions for objects with static storage duration. */
2883 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2885 /* The declaration for the __INITIALIZE_P argument. */
2886 static tree initialize_p_decl;
2888 /* The declaration for the __PRIORITY argument. */
2889 static tree priority_decl;
2891 /* The declaration for the static storage duration function. */
2892 static tree ssdf_decl;
2894 /* All the static storage duration functions created in this
2895 translation unit. */
2896 static varray_type ssdf_decls;
2897 static size_t ssdf_decls_used;
2899 /* A map from priority levels to information about that priority
2900 level. There may be many such levels, so efficient lookup is
2902 static splay_tree priority_info_map;
2904 /* Begins the generation of the function that will handle all
2905 initialization and destruction of objects with static storage
2906 duration. The function generated takes two parameters of type
2907 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2908 non-zero, it performs initializations. Otherwise, it performs
2909 destructions. It only performs those initializations or
2910 destructions with the indicated __PRIORITY. The generated function
2913 It is assumed that this function will only be called once per
2914 translation unit. */
2917 start_static_storage_duration_function ()
2919 static unsigned ssdf_number;
2924 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2926 /* Create the identifier for this function. It will be of the form
2927 SSDF_IDENTIFIER_<number>. */
2928 sprintf (id, "%s_%u", SSDF_IDENTIFIER, ssdf_number++);
2929 if (ssdf_number == 0)
2931 /* Overflow occurred. That means there are at least 4 billion
2932 initialization functions. */
2933 sorry ("too many initialization functions required");
2934 my_friendly_abort (19990430);
2937 /* Create the parameters. */
2938 parm_types = void_list_node;
2939 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2940 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2941 type = build_function_type (void_type_node, parm_types);
2943 /* Create the FUNCTION_DECL itself. */
2944 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2945 get_identifier (id),
2947 TREE_PUBLIC (ssdf_decl) = 0;
2948 DECL_ARTIFICIAL (ssdf_decl) = 1;
2950 /* Put this function in the list of functions to be called from the
2951 static constructors and destructors. */
2954 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2956 /* Take this opportunity to initialize the map from priority
2957 numbers to information about that priority level. */
2958 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2959 /*delete_key_fn=*/0,
2960 /*delete_value_fn=*/
2961 (splay_tree_delete_value_fn) &free);
2963 /* We always need to generate functions for the
2964 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2965 priorities later, we'll be sure to find the
2966 DEFAULT_INIT_PRIORITY. */
2967 get_priority_info (DEFAULT_INIT_PRIORITY);
2970 if (ssdf_decls_used == ssdf_decls->num_elements)
2971 VARRAY_GROW (ssdf_decls, 2 * ssdf_decls_used);
2972 VARRAY_TREE (ssdf_decls, ssdf_decls_used) = ssdf_decl;
2975 /* Create the argument list. */
2976 initialize_p_decl = build_decl (PARM_DECL,
2977 get_identifier (INITIALIZE_P_IDENTIFIER),
2979 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2980 DECL_ARG_TYPE (initialize_p_decl) = integer_type_node;
2981 TREE_USED (initialize_p_decl) = 1;
2982 priority_decl = build_decl (PARM_DECL, get_identifier (PRIORITY_IDENTIFIER),
2984 DECL_CONTEXT (priority_decl) = ssdf_decl;
2985 DECL_ARG_TYPE (priority_decl) = integer_type_node;
2986 TREE_USED (priority_decl) = 1;
2988 TREE_CHAIN (initialize_p_decl) = priority_decl;
2989 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2991 /* Put the function in the global scope. */
2992 pushdecl (ssdf_decl);
2994 /* Start the function itself. This is equivalent to declarating the
2997 static void __ssdf (int __initialize_p, init __priority_p);
2999 It is static because we only need to call this function from the
3000 various constructor and destructor functions for this module. */
3001 start_function (/*specs=*/NULL_TREE,
3003 /*attrs=*/NULL_TREE,
3006 /* Set up the scope of the outermost block in the function. */
3007 body = begin_compound_stmt (/*has_no_scope=*/0);
3009 /* This function must not be deferred because we are depending on
3010 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3011 current_function_cannot_inline
3012 = "static storage duration functions cannot be inlined";
3017 /* Finish the generation of the function which performs initialization
3018 and destruction of objects with static storage duration. After
3019 this point, no more such objects can be created. */
3022 finish_static_storage_duration_function (body)
3025 /* Close out the function. */
3026 finish_compound_stmt (/*has_no_scope=*/0, body);
3027 expand_body (finish_function (lineno, 0));
3030 /* Return the information about the indicated PRIORITY level. If no
3031 code to handle this level has yet been generated, generate the
3032 appropriate prologue. */
3034 static priority_info
3035 get_priority_info (priority)
3041 n = splay_tree_lookup (priority_info_map,
3042 (splay_tree_key) priority);
3045 /* Create a new priority information structure, and insert it
3047 pi = (priority_info) xmalloc (sizeof (struct priority_info_s));
3048 pi->initializations_p = 0;
3049 pi->destructions_p = 0;
3050 splay_tree_insert (priority_info_map,
3051 (splay_tree_key) priority,
3052 (splay_tree_value) pi);
3055 pi = (priority_info) n->value;
3060 /* Set up to handle the initialization or destruction of DECL. If
3061 INITP is non-zero, we are initializing the variable. Otherwise, we
3062 are destroying it. */
3065 start_static_initialization_or_destruction (decl, initp)
3069 tree sentry_if_stmt = NULL_TREE;
3075 /* Figure out the priority for this declaration. */
3076 priority = DECL_INIT_PRIORITY (decl);
3078 priority = DEFAULT_INIT_PRIORITY;
3080 /* Remember that we had an initialization or finalization at this
3082 pi = get_priority_info (priority);
3084 pi->initializations_p = 1;
3086 pi->destructions_p = 1;
3088 /* Trick the compiler into thinking we are at the file and line
3089 where DECL was declared so that error-messages make sense, and so
3090 that the debugger will show somewhat sensible file and line
3092 input_filename = DECL_SOURCE_FILE (decl);
3093 lineno = DECL_SOURCE_LINE (decl);
3099 Access control for implicit calls to the constructors,
3100 the conversion functions, or the destructor called to
3101 create and destroy a static data member is performed as
3102 if these calls appeared in the scope of the member's
3105 we pretend we are in a static member function of the class of
3106 which the DECL is a member. */
3107 if (member_p (decl))
3109 DECL_CLASS_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
3110 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
3113 /* Conditionalize this initialization on being in the right priority
3114 and being initializing/finalizing appropriately. */
3115 sentry_if_stmt = begin_if_stmt ();
3116 cond = build_binary_op (EQ_EXPR,
3118 build_int_2 (priority, 0));
3119 init_cond = initp ? integer_one_node : integer_zero_node;
3120 init_cond = build_binary_op (EQ_EXPR,
3123 cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
3125 /* We need a sentry if this is an object with external linkage that
3126 might be initialized in more than one place. */
3127 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
3128 || DECL_ONE_ONLY (decl)
3129 || DECL_WEAK (decl)))
3134 sentry = get_sentry (DECL_ASSEMBLER_NAME (decl));
3136 /* We do initializations only if the SENTRY is zero, i.e., if we
3137 are the first to initialize the variable. We do destructions
3138 only if the SENTRY is one, i.e., if we are the last to
3139 destroy the variable. */
3141 sentry_cond = build_binary_op (EQ_EXPR,
3142 build_unary_op (PREINCREMENT_EXPR,
3147 sentry_cond = build_binary_op (EQ_EXPR,
3148 build_unary_op (PREDECREMENT_EXPR,
3153 cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, sentry_cond);
3156 finish_if_stmt_cond (cond, sentry_if_stmt);
3158 return sentry_if_stmt;
3161 /* We've just finished generating code to do an initialization or
3162 finalization. SENTRY_IF_STMT is the if-statement we used to guard
3163 the initialization. */
3166 finish_static_initialization_or_destruction (sentry_if_stmt)
3167 tree sentry_if_stmt;
3169 finish_then_clause (sentry_if_stmt);
3172 /* Now that we're done with DECL we don't need to pretend to be a
3173 member of its class any longer. */
3174 DECL_CLASS_CONTEXT (current_function_decl) = NULL_TREE;
3175 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
3178 /* Generate code to do the static initialization of DECL. The
3179 initialization is INIT. If DECL may be initialized more than once
3180 in different object files, SENTRY is the guard variable to
3181 check. PRIORITY is the priority for the initialization. */
3184 do_static_initialization (decl, init)
3189 tree sentry_if_stmt;
3191 /* Set up for the initialization. */
3193 = start_static_initialization_or_destruction (decl,
3196 /* Do the initialization itself. */
3197 if (IS_AGGR_TYPE (TREE_TYPE (decl))
3198 || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
3199 expr = build_aggr_init (decl, init, 0);
3200 else if (TREE_CODE (init) == TREE_VEC)
3201 expr = build_vec_init (decl, TREE_VEC_ELT (init, 0),
3202 TREE_VEC_ELT (init, 1),
3203 TREE_VEC_ELT (init, 2), 0);
3206 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
3207 TREE_SIDE_EFFECTS (expr) = 1;
3209 finish_expr_stmt (expr);
3212 finish_static_initialization_or_destruction (sentry_if_stmt);
3215 /* Generate code to do the static destruction of DECL. If DECL may be
3216 initialized more than once in different object files, SENTRY is the
3217 guard variable to check. PRIORITY is the priority for the
3221 do_static_destruction (decl)
3224 tree sentry_if_stmt;
3226 /* If we don't need a destructor, there's nothing to do. */
3227 if (!TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl)))
3230 /* Actually do the destruction. */
3231 sentry_if_stmt = start_static_initialization_or_destruction (decl,
3233 finish_expr_stmt (build_cleanup (decl));
3234 finish_static_initialization_or_destruction (sentry_if_stmt);
3237 /* VARS is a list of variables with static storage duration which may
3238 need initialization and/or finalization. Remove those variables
3239 that don't really need to be initialized or finalized, and return
3240 the resulting list. The order in which the variables appear in
3241 VARS is in reverse order of the order in which they should actually
3242 be initialized. The list we return is in the unreversed order;
3243 i.e., the first variable should be initialized first. */
3246 prune_vars_needing_no_initialization (vars)
3252 for (var = vars, result = NULL_TREE;
3254 var = TREE_CHAIN (var))
3256 tree decl = TREE_VALUE (var);
3257 tree init = TREE_PURPOSE (var);
3259 /* Deal gracefully with error. */
3260 if (decl == error_mark_node)
3263 /* The only things that can be initialized are variables. */
3264 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
3266 /* If this object is not defined, we don't need to do anything
3268 if (DECL_EXTERNAL (decl))
3271 /* Also, if the initializer already contains errors, we can bail
3273 if (init && TREE_CODE (init) == TREE_LIST
3274 && value_member (error_mark_node, init))
3277 /* This variable is going to need initialization and/or
3278 finalization, so we add it to the list. */
3279 result = tree_cons (init, decl, result);
3285 /* Make sure we have told the back end about all the variables in
3289 write_out_vars (vars)
3294 for (v = vars; v; v = TREE_CHAIN (v))
3295 if (! TREE_ASM_WRITTEN (TREE_VALUE (v)))
3296 rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1);
3299 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3300 (otherwise) that will initialize all gobal objects with static
3301 storage duration having the indicated PRIORITY. */
3304 generate_ctor_or_dtor_function (constructor_p, priority)
3313 /* We use `I' to indicate initialization and `D' to indicate
3320 /* Begin the function. */
3321 body = start_objects (function_key, priority);
3323 /* Call the static storage duration function with appropriate
3325 for (i = 0; i < ssdf_decls_used; ++i)
3327 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
3329 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
3331 finish_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls, i),
3335 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3336 calls to any functions marked with attributes indicating that
3337 they should be called at initialization- or destruction-time. */
3338 if (priority == DEFAULT_INIT_PRIORITY)
3342 for (fns = constructor_p ? static_ctors : static_dtors;
3344 fns = TREE_CHAIN (fns))
3345 finish_expr_stmt (build_function_call (TREE_VALUE (fns), NULL_TREE));
3348 /* Close out the function. */
3349 finish_objects (function_key, priority, body);
3352 /* Generate constructor and destructor functions for the priority
3356 generate_ctor_and_dtor_functions_for_priority (n, data)
3358 void *data ATTRIBUTE_UNUSED;
3360 int priority = (int) n->key;
3361 priority_info pi = (priority_info) n->value;
3363 /* Generate the functions themselves, but only if they are really
3365 if (pi->initializations_p
3366 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
3367 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3369 if (pi->destructions_p
3370 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
3371 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3374 /* Keep iterating. */
3378 /* This routine is called from the last rule in yyparse ().
3379 Its job is to create all the code needed to initialize and
3380 destroy the global aggregates. We do the destruction
3381 first, since that way we only need to reverse the decls once. */
3387 int start_time, this_time;
3394 /* Bad parse errors. Just forget about it. */
3395 if (! global_bindings_p () || current_class_type || decl_namespace_list)
3398 start_time = get_run_time ();
3400 /* Otherwise, GDB can get confused, because in only knows
3401 about source for LINENO-1 lines. */
3404 interface_unknown = 1;
3407 /* We now have to write out all the stuff we put off writing out.
3410 o Template specializations that we have not yet instantiated,
3411 but which are needed.
3412 o Initialization and destruction for non-local objects with
3413 static storage duration. (Local objects with static storage
3414 duration are initialized when their scope is first entered,
3415 and are cleaned up via atexit.)
3416 o Virtual function tables.
3418 All of these may cause others to be needed. For example,
3419 instantiating one function may cause another to be needed, and
3420 generating the intiailzer for an object may cause templates to be
3421 instantiated, etc., etc. */
3423 this_time = get_run_time ();
3424 parse_time -= this_time - start_time;
3425 varconst_time += this_time - start_time;
3426 start_time = get_run_time ();
3432 /* If there are templates that we've put off instantiating, do
3434 instantiate_pending_templates ();
3436 /* Write out virtual tables as required. Note that writing out
3437 the virtual table for a template class may cause the
3438 instantiation of members of that class. */
3439 if (walk_globals (vtable_decl_p,
3440 finish_vtable_vardecl,
3444 /* The list of objects with static storage duration is built up
3445 in reverse order. We clear STATIC_AGGREGATES so that any new
3446 aggregates added during the initialization of these will be
3447 initialized in the correct order when we next come around the
3449 vars = prune_vars_needing_no_initialization (static_aggregates);
3450 static_aggregates = NULL_TREE;
3456 /* We need to start a new initialization function each time
3457 through the loop. That's because we need to know which
3458 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3459 isn't computed until a function is finished, and written
3460 out. That's a deficiency in the back-end. When this is
3461 fixed, these initialization functions could all become
3462 inline, with resulting performance improvements. */
3463 tree ssdf_body = start_static_storage_duration_function ();
3465 /* Make sure the back end knows about all the variables. */
3466 write_out_vars (vars);
3468 /* First generate code to do all the initializations. */
3469 for (v = vars; v; v = TREE_CHAIN (v))
3470 do_static_initialization (TREE_VALUE (v),
3473 /* Then, generate code to do all the destructions. Do these
3474 in reverse order so that the most recently constructed
3475 variable is the first destroyed. */
3476 vars = nreverse (vars);
3477 for (v = vars; v; v = TREE_CHAIN (v))
3478 do_static_destruction (TREE_VALUE (v));
3480 /* Finish up the static storage duration function for this
3482 finish_static_storage_duration_function (ssdf_body);
3484 /* All those initializations and finalizations might cause
3485 us to need more inline functions, more template
3486 instantiations, etc. */
3490 /* Go through the various inline functions, and see if any need
3492 for (i = 0; i < saved_inlines_used; ++i)
3494 tree decl = VARRAY_TREE (saved_inlines, i);
3495 import_export_decl (decl);
3496 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
3498 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
3500 /* Even though we're already at the top-level, we push
3501 there again. That way, when we pop back a few lines
3502 hence, all of our state is restored. Otherwise,
3503 finish_function doesn't clean things up, and we end
3504 up with CURRENT_FUNCTION_DECL set. */
3505 push_to_top_level ();
3506 if (DECL_TINFO_FN_P (decl))
3507 synthesize_tinfo_fn (decl);
3509 synthesize_method (decl);
3510 pop_from_top_level ();
3515 /* Mark all functions that might deal with exception-handling as
3517 mark_all_runtime_matches ();
3519 /* We lie to the back-end, pretending that some functions are
3520 not defined when they really are. This keeps these functions
3521 from being put out unncessarily. But, we must stop lying
3522 when the functions are referenced, or if they are not comdat
3523 since they need to be put out now. */
3524 for (i = 0; i < saved_inlines_used; ++i)
3526 tree decl = VARRAY_TREE (saved_inlines, i);
3528 if (DECL_NOT_REALLY_EXTERN (decl)
3529 && DECL_INITIAL (decl)
3530 && (DECL_NEEDED_P (decl) || !DECL_COMDAT (decl)))
3531 DECL_EXTERNAL (decl) = 0;
3534 if (saved_inlines_used
3535 && wrapup_global_declarations (&VARRAY_TREE (saved_inlines, 0),
3536 saved_inlines_used))
3538 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
3541 /* Static data members are just like namespace-scope globals. */
3542 for (i = 0; i < pending_statics_used; ++i)
3544 tree decl = VARRAY_TREE (pending_statics, i);
3545 if (TREE_ASM_WRITTEN (decl))
3547 import_export_decl (decl);
3548 if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
3549 DECL_EXTERNAL (decl) = 0;
3552 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
3553 pending_statics_used))
3558 /* We give C linkage to static constructors and destructors. */
3559 push_lang_context (lang_name_c);
3561 /* Generate initialization and destruction functions for all
3562 priorities for which they are required. */
3563 if (priority_info_map)
3564 splay_tree_foreach (priority_info_map,
3565 generate_ctor_and_dtor_functions_for_priority,
3568 /* We're done with the splay-tree now. */
3569 if (priority_info_map)
3570 splay_tree_delete (priority_info_map);
3572 /* We're done with static constructors, so we can go back to "C++"
3574 pop_lang_context ();
3576 /* Now delete from the chain of variables all virtual function tables.
3577 We output them all ourselves, because each will be treated
3578 specially. We don't do this if we're just doing semantic
3579 analysis, and not code-generation. */
3580 if (!flag_syntax_only)
3581 walk_globals (vtable_decl_p, prune_vtable_vardecl, /*data=*/0);
3583 /* Now, issue warnings about static, but not defined, functions,
3584 etc., and emit debugging information. */
3585 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
3586 if (pending_statics)
3587 check_global_declarations (&VARRAY_TREE (pending_statics, 0),
3588 pending_statics_used);
3592 /* The entire file is now complete. If requested, dump everything
3594 if (flag_dump_translation_unit)
3595 dump_node_to_file (global_namespace, flag_dump_translation_unit);
3597 /* If there's some tool that wants to examine the entire translation
3598 unit, let it do so now. */
3600 (*back_end_hook) (global_namespace);
3602 this_time = get_run_time ();
3603 parse_time -= this_time - start_time;
3604 varconst_time += this_time - start_time;
3606 if (flag_detailed_statistics)
3608 dump_tree_statistics ();
3609 dump_time_statistics ();
3613 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3614 expr. Since it was parsed like a type, we need to wade through and fix
3615 that. Unfortunately, since operator() is left-associative, we can't use
3616 tail recursion. In the above example, TYPE is `A', and DECL is
3619 Maybe this shouldn't be recursive, but how often will it actually be
3623 reparse_absdcl_as_expr (type, decl)
3626 /* do build_functional_cast (type, NULL_TREE) at bottom */
3627 if (TREE_OPERAND (decl, 0) == NULL_TREE)
3628 return build_functional_cast (type, NULL_TREE);
3631 decl = reparse_absdcl_as_expr (type, TREE_OPERAND (decl, 0));
3633 decl = build_x_function_call (decl, NULL_TREE, current_class_ref);
3635 if (TREE_CODE (decl) == CALL_EXPR
3636 && (! TREE_TYPE (decl)
3637 || TREE_CODE (TREE_TYPE (decl)) != VOID_TYPE))
3638 decl = require_complete_type (decl);
3643 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3644 out to be an expr. Since it was parsed like a type, we need to wade
3645 through and fix that. Since casts are right-associative, we are
3646 reversing the order, so we don't have to recurse.
3648 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3652 reparse_absdcl_as_casts (decl, expr)
3657 if (TREE_CODE (expr) == CONSTRUCTOR
3658 && TREE_TYPE (expr) == 0)
3660 type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl)));
3661 decl = TREE_OPERAND (decl, 0);
3663 expr = digest_init (type, expr, (tree *) 0);
3664 if (TREE_CODE (type) == ARRAY_TYPE && TYPE_SIZE (type) == 0)
3666 int failure = complete_array_type (type, expr, 1);
3668 my_friendly_abort (78);
3674 type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl)));
3675 decl = TREE_OPERAND (decl, 0);
3676 expr = build_c_cast (type, expr);
3679 if (warn_old_style_cast && ! in_system_header
3680 && current_lang_name != lang_name_c)
3681 warning ("use of old-style cast");
3686 /* Given plain tree nodes for an expression, build up the full semantics. */
3689 build_expr_from_tree (t)
3692 if (t == NULL_TREE || t == error_mark_node)
3695 switch (TREE_CODE (t))
3697 case IDENTIFIER_NODE:
3698 return do_identifier (t, 0, NULL_TREE);
3701 if (LOOKUP_EXPR_GLOBAL (t))
3702 return do_scoped_id (TREE_OPERAND (t, 0), 0);
3704 return do_identifier (TREE_OPERAND (t, 0), 0, NULL_TREE);
3706 case TEMPLATE_ID_EXPR:
3707 return (lookup_template_function
3708 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3709 build_expr_from_tree (TREE_OPERAND (t, 1))));
3712 return build_x_indirect_ref
3713 (build_expr_from_tree (TREE_OPERAND (t, 0)), "unary *");
3716 return build_functional_cast
3717 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3719 case REINTERPRET_CAST_EXPR:
3720 return build_reinterpret_cast
3721 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3723 case CONST_CAST_EXPR:
3724 return build_const_cast
3725 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3727 case DYNAMIC_CAST_EXPR:
3728 return build_dynamic_cast
3729 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3731 case STATIC_CAST_EXPR:
3732 return build_static_cast
3733 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3735 case PREDECREMENT_EXPR:
3736 case PREINCREMENT_EXPR:
3737 case POSTDECREMENT_EXPR:
3738 case POSTINCREMENT_EXPR:
3742 case TRUTH_NOT_EXPR:
3744 case CONVERT_EXPR: /* Unary + */
3749 return build_x_unary_op (TREE_CODE (t),
3750 build_expr_from_tree (TREE_OPERAND (t, 0)));
3755 case TRUNC_DIV_EXPR:
3757 case FLOOR_DIV_EXPR:
3758 case ROUND_DIV_EXPR:
3759 case EXACT_DIV_EXPR:
3761 case BIT_ANDTC_EXPR:
3764 case TRUNC_MOD_EXPR:
3765 case FLOOR_MOD_EXPR:
3766 case TRUTH_ANDIF_EXPR:
3767 case TRUTH_ORIF_EXPR:
3768 case TRUTH_AND_EXPR:
3783 return build_x_binary_op
3785 build_expr_from_tree (TREE_OPERAND (t, 0)),
3786 build_expr_from_tree (TREE_OPERAND (t, 1)));
3789 return build_m_component_ref
3790 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3791 build_expr_from_tree (TREE_OPERAND (t, 1)));
3794 return build_offset_ref (TREE_OPERAND (t, 0), TREE_OPERAND (t, 1));
3797 if (TREE_OPERAND (t, 0) == NULL_TREE)
3799 return build_parse_node (ARRAY_REF, NULL_TREE,
3800 build_expr_from_tree (TREE_OPERAND (t, 1)));
3801 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t, 0)),
3802 build_expr_from_tree (TREE_OPERAND (t, 1)));
3807 tree r = build_expr_from_tree (TREE_OPERAND (t, 0));
3808 if (TREE_CODE_CLASS (TREE_CODE (r)) != 't')
3810 return TREE_CODE (t) == SIZEOF_EXPR ? c_sizeof (r) : c_alignof (r);
3814 return build_x_modify_expr
3815 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3816 TREE_CODE (TREE_OPERAND (t, 1)),
3817 build_expr_from_tree (TREE_OPERAND (t, 2)));
3820 return build_x_arrow
3821 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3825 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3826 build_expr_from_tree (TREE_OPERAND (t, 1)),
3827 build_expr_from_tree (TREE_OPERAND (t, 2)),
3828 NEW_EXPR_USE_GLOBAL (t));
3831 return delete_sanity
3832 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3833 build_expr_from_tree (TREE_OPERAND (t, 1)),
3834 DELETE_EXPR_USE_VEC (t), DELETE_EXPR_USE_GLOBAL (t));
3837 if (TREE_OPERAND (t, 1) == NULL_TREE)
3838 return build_x_compound_expr
3839 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3841 my_friendly_abort (42);
3843 case METHOD_CALL_EXPR:
3844 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
3846 tree ref = TREE_OPERAND (t, 0);
3847 return build_scoped_method_call
3848 (build_expr_from_tree (TREE_OPERAND (t, 1)),
3849 build_expr_from_tree (TREE_OPERAND (ref, 0)),
3850 TREE_OPERAND (ref, 1),
3851 build_expr_from_tree (TREE_OPERAND (t, 2)));
3855 tree fn = TREE_OPERAND (t, 0);
3857 /* We can get a TEMPLATE_ID_EXPR here on code like:
3861 so we must resolve that. However, we can also get things
3862 like a BIT_NOT_EXPR here, when referring to a destructor,
3863 and things like that are not correctly resolved by
3864 build_expr_from_tree. So, just use build_expr_from_tree
3865 when we really need it. */
3866 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3867 fn = lookup_template_function
3868 (TREE_OPERAND (fn, 0),
3869 build_expr_from_tree (TREE_OPERAND (fn, 1)));
3871 return build_method_call
3872 (build_expr_from_tree (TREE_OPERAND (t, 1)),
3874 build_expr_from_tree (TREE_OPERAND (t, 2)),
3875 NULL_TREE, LOOKUP_NORMAL);
3879 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
3881 tree ref = TREE_OPERAND (t, 0);
3882 return build_member_call
3883 (build_expr_from_tree (TREE_OPERAND (ref, 0)),
3884 TREE_OPERAND (ref, 1),
3885 build_expr_from_tree (TREE_OPERAND (t, 1)));
3889 tree name = TREE_OPERAND (t, 0);
3891 tree args = build_expr_from_tree (TREE_OPERAND (t, 1));
3892 if (args != NULL_TREE && TREE_CODE (name) == LOOKUP_EXPR
3893 && !LOOKUP_EXPR_GLOBAL (name)
3894 && TREE_CODE ((id = TREE_OPERAND (name, 0))) == IDENTIFIER_NODE
3895 && (!current_class_type
3896 || !lookup_member (current_class_type, id, 0, 0)))
3898 /* Do Koenig lookup if there are no class members. */
3899 name = do_identifier (id, 0, args);
3901 else if (TREE_CODE (name) == TEMPLATE_ID_EXPR
3902 || ! really_overloaded_fn (name))
3903 name = build_expr_from_tree (name);
3904 return build_x_function_call (name, args, current_class_ref);
3908 return build_x_conditional_expr
3909 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3910 build_expr_from_tree (TREE_OPERAND (t, 1)),
3911 build_expr_from_tree (TREE_OPERAND (t, 2)));
3913 case PSEUDO_DTOR_EXPR:
3914 return (finish_pseudo_destructor_call_expr
3915 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3916 build_expr_from_tree (TREE_OPERAND (t, 1)),
3917 build_expr_from_tree (TREE_OPERAND (t, 2))));
3921 tree purpose, value, chain;
3923 if (t == void_list_node)
3926 purpose = TREE_PURPOSE (t);
3928 purpose = build_expr_from_tree (purpose);
3929 value = TREE_VALUE (t);
3931 value = build_expr_from_tree (value);
3932 chain = TREE_CHAIN (t);
3933 if (chain && chain != void_type_node)
3934 chain = build_expr_from_tree (chain);
3935 return tree_cons (purpose, value, chain);
3940 tree object = build_expr_from_tree (TREE_OPERAND (t, 0));
3941 tree field = TREE_OPERAND (t, 1);
3943 /* We use a COMPONENT_REF to indicate things of the form `x.b'
3944 and `x.A::b'. We must distinguish between those cases
3946 if (TREE_CODE (field) == SCOPE_REF)
3947 return build_object_ref (object,
3948 TREE_OPERAND (field, 0),
3949 TREE_OPERAND (field, 1));
3951 return build_x_component_ref (object, field,
3956 return build_throw (build_expr_from_tree (TREE_OPERAND (t, 0)));
3962 /* digest_init will do the wrong thing if we let it. */
3963 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
3966 r = build_nt (CONSTRUCTOR, NULL_TREE,
3967 build_expr_from_tree (CONSTRUCTOR_ELTS (t)));
3968 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
3971 return digest_init (TREE_TYPE (t), r, 0);
3976 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t, 0))) == 't')
3977 return get_typeid (TREE_OPERAND (t, 0));
3978 return build_x_typeid (build_expr_from_tree (TREE_OPERAND (t, 0)));
3981 return convert_from_reference (t);
3984 return build_va_arg (build_expr_from_tree (TREE_OPERAND (t, 0)),
3992 /* This is something of the form `int (*a)++' that has turned out to be an
3993 expr. It was only converted into parse nodes, so we need to go through
3994 and build up the semantics. Most of the work is done by
3995 build_expr_from_tree, above.
3997 In the above example, TYPE is `int' and DECL is `*a'. */
4000 reparse_decl_as_expr (type, decl)
4003 decl = build_expr_from_tree (decl);
4005 return build_functional_cast (type, build_expr_list (NULL_TREE, decl));
4010 /* This is something of the form `int (*a)' that has turned out to be a
4011 decl. It was only converted into parse nodes, so we need to do the
4012 checking that make_{pointer,reference}_declarator do. */
4015 finish_decl_parsing (decl)
4018 extern int current_class_depth;
4020 switch (TREE_CODE (decl))
4022 case IDENTIFIER_NODE:
4025 return make_pointer_declarator
4026 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4028 return make_reference_declarator
4029 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4031 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4034 push_nested_class (TREE_TYPE (TREE_OPERAND (decl, 0)), 3);
4035 TREE_COMPLEXITY (decl) = current_class_depth;
4038 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4041 /* For attribute handling. */
4042 TREE_VALUE (decl) = finish_decl_parsing (TREE_VALUE (decl));
4045 my_friendly_abort (5);
4051 check_cp_case_value (value)
4054 if (value == NULL_TREE)
4057 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4058 STRIP_TYPE_NOPS (value);
4060 if (TREE_READONLY_DECL_P (value))
4062 value = decl_constant_value (value);
4063 STRIP_TYPE_NOPS (value);
4065 value = fold (value);
4067 if (TREE_CODE (value) != INTEGER_CST
4068 && value != error_mark_node)
4070 cp_error ("case label `%E' does not reduce to an integer constant",
4072 value = error_mark_node;
4075 /* Promote char or short to int. */
4076 value = default_conversion (value);
4078 constant_expression_warning (value);
4083 /* Return 1 if root encloses child. */
4086 is_namespace_ancestor (root, child)
4091 if (root == global_namespace)
4093 if (child == global_namespace)
4095 return is_namespace_ancestor (root, CP_DECL_CONTEXT (child));
4099 /* Return the namespace that is the common ancestor
4100 of two given namespaces. */
4103 namespace_ancestor (ns1, ns2)
4106 if (is_namespace_ancestor (ns1, ns2))
4108 return namespace_ancestor (CP_DECL_CONTEXT (ns1), ns2);
4111 /* Insert used into the using list of user. Set indirect_flag if this
4112 directive is not directly from the source. Also find the common
4113 ancestor and let our users know about the new namespace */
4115 add_using_namespace (user, used, indirect)
4121 /* Using oneself is a no-op. */
4124 my_friendly_assert (TREE_CODE (user) == NAMESPACE_DECL, 380);
4125 my_friendly_assert (TREE_CODE (used) == NAMESPACE_DECL, 380);
4126 /* Check if we already have this. */
4127 t = purpose_member (used, DECL_NAMESPACE_USING (user));
4131 /* Promote to direct usage. */
4132 TREE_INDIRECT_USING (t) = 0;
4136 /* Add used to the user's using list. */
4137 DECL_NAMESPACE_USING (user)
4138 = tree_cons (used, namespace_ancestor (user, used),
4139 DECL_NAMESPACE_USING (user));
4141 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect;
4143 /* Add user to the used's users list. */
4144 DECL_NAMESPACE_USERS (used)
4145 = tree_cons (user, 0, DECL_NAMESPACE_USERS (used));
4147 /* Recursively add all namespaces used. */
4148 for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t))
4149 /* indirect usage */
4150 add_using_namespace (user, TREE_PURPOSE (t), 1);
4152 /* Tell everyone using us about the new used namespaces. */
4153 for (t = DECL_NAMESPACE_USERS (user); t; t = TREE_CHAIN (t))
4154 add_using_namespace (TREE_PURPOSE (t), used, 1);
4157 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4158 duplicates. The first list becomes the tail of the result.
4160 The algorithm is O(n^2). We could get this down to O(n log n) by
4161 doing a sort on the addresses of the functions, if that becomes
4165 merge_functions (s1, s2)
4169 for (; s2; s2 = OVL_NEXT (s2))
4171 tree fn = OVL_CURRENT (s2);
4172 if (! ovl_member (fn, s1))
4173 s1 = build_overload (fn, s1);
4178 /* This should return an error not all definitions define functions.
4179 It is not an error if we find two functions with exactly the
4180 same signature, only if these are selected in overload resolution.
4181 old is the current set of bindings, new the freshly-found binding.
4182 XXX Do we want to give *all* candidates in case of ambiguity?
4183 XXX In what way should I treat extern declarations?
4184 XXX I don't want to repeat the entire duplicate_decls here */
4187 ambiguous_decl (name, old, new, flags)
4194 my_friendly_assert (old != NULL_TREE, 393);
4195 /* Copy the value. */
4196 val = BINDING_VALUE (new);
4198 switch (TREE_CODE (val))
4201 /* If we expect types or namespaces, and not templates,
4202 or this is not a template class. */
4203 if (LOOKUP_QUALIFIERS_ONLY (flags)
4204 && !DECL_CLASS_TEMPLATE_P (val))
4208 if (LOOKUP_NAMESPACES_ONLY (flags))
4211 case NAMESPACE_DECL:
4212 if (LOOKUP_TYPES_ONLY (flags))
4216 if (LOOKUP_QUALIFIERS_ONLY (flags))
4220 if (!BINDING_VALUE (old))
4221 BINDING_VALUE (old) = val;
4222 else if (val && val != BINDING_VALUE (old))
4224 if (is_overloaded_fn (BINDING_VALUE (old))
4225 && is_overloaded_fn (val))
4227 BINDING_VALUE (old) = merge_functions (BINDING_VALUE (old),
4232 /* Some declarations are functions, some are not. */
4233 if (flags & LOOKUP_COMPLAIN)
4235 /* If we've already given this error for this lookup,
4236 BINDING_VALUE (old) is error_mark_node, so let's not
4237 repeat ourselves. */
4238 if (BINDING_VALUE (old) != error_mark_node)
4240 cp_error ("use of `%D' is ambiguous", name);
4241 cp_error_at (" first declared as `%#D' here",
4242 BINDING_VALUE (old));
4244 cp_error_at (" also declared as `%#D' here", val);
4246 return error_mark_node;
4249 /* ... and copy the type. */
4250 type = BINDING_TYPE (new);
4251 if (LOOKUP_NAMESPACES_ONLY (flags))
4253 if (!BINDING_TYPE (old))
4254 BINDING_TYPE (old) = type;
4255 else if (type && BINDING_TYPE (old) != type)
4257 if (flags & LOOKUP_COMPLAIN)
4259 cp_error ("`%D' denotes an ambiguous type",name);
4260 cp_error_at (" first type here", BINDING_TYPE (old));
4261 cp_error_at (" other type here", type);
4267 /* Subroutine of unualified_namespace_lookup:
4268 Add the bindings of NAME in used namespaces to VAL.
4269 We are currently looking for names in namespace SCOPE, so we
4270 look through USINGS for using-directives of namespaces
4271 which have SCOPE as a common ancestor with the current scope.
4272 Returns zero on errors. */
4275 lookup_using_namespace (name, val, usings, scope, flags, spacesp)
4276 tree name, val, usings, scope;
4282 /* Iterate over all used namespaces in current, searching for using
4283 directives of scope. */
4284 for (iter = usings; iter; iter = TREE_CHAIN (iter))
4285 if (TREE_VALUE (iter) == scope)
4288 *spacesp = tree_cons (TREE_PURPOSE (iter), NULL_TREE,
4290 val1 = binding_for_name (name, TREE_PURPOSE (iter));
4291 /* Resolve ambiguities. */
4292 val = ambiguous_decl (name, val, val1, flags);
4294 return val != error_mark_node;
4298 Accepts the NAME to lookup and its qualifying SCOPE.
4299 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4303 qualified_lookup_using_namespace (name, scope, result, flags)
4309 /* Maintain a list of namespaces visited... */
4310 tree seen = NULL_TREE;
4311 /* ... and a list of namespace yet to see. */
4312 tree todo = NULL_TREE;
4314 while (scope && (result != error_mark_node))
4316 seen = temp_tree_cons (scope, NULL_TREE, seen);
4317 result = ambiguous_decl (name, result,
4318 binding_for_name (name, scope), flags);
4319 if (!BINDING_VALUE (result) && !BINDING_TYPE (result))
4320 /* Consider using directives. */
4321 for (usings = DECL_NAMESPACE_USING (scope); usings;
4322 usings = TREE_CHAIN (usings))
4323 /* If this was a real directive, and we have not seen it. */
4324 if (!TREE_INDIRECT_USING (usings)
4325 && !purpose_member (TREE_PURPOSE (usings), seen))
4326 todo = temp_tree_cons (TREE_PURPOSE (usings), NULL_TREE, todo);
4329 scope = TREE_PURPOSE (todo);
4330 todo = TREE_CHAIN (todo);
4333 scope = NULL_TREE; /* If there never was a todo list. */
4335 return result != error_mark_node;
4338 /* [namespace.memdef]/2 */
4340 /* Set the context of a declaration to scope. Complain if we are not
4344 set_decl_namespace (decl, scope, friendp)
4350 if (scope == std_node)
4351 scope = global_namespace;
4352 /* Get rid of namespace aliases. */
4353 scope = ORIGINAL_NAMESPACE (scope);
4355 /* It is ok for friends to be qualified in parallel space. */
4356 if (!friendp && !is_namespace_ancestor (current_namespace, scope))
4357 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4359 DECL_CONTEXT (decl) = FROB_CONTEXT (scope);
4360 if (scope != current_namespace)
4362 /* See whether this has been declared in the namespace. */
4363 old = namespace_binding (DECL_NAME (decl), scope);
4365 /* No old declaration at all. */
4367 if (!is_overloaded_fn (decl))
4368 /* Don't compare non-function decls with decls_match here,
4369 since it can't check for the correct constness at this
4370 point. pushdecl will find those errors later. */
4372 /* Since decl is a function, old should contain a function decl. */
4373 if (!is_overloaded_fn (old))
4375 if (processing_template_decl || processing_specialization)
4376 /* We have not yet called push_template_decl to turn the
4377 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4378 won't match. But, we'll check later, when we construct the
4381 for (; old; old = OVL_NEXT (old))
4382 if (decls_match (decl, OVL_CURRENT (old)))
4388 cp_error ("`%D' should have been declared inside `%D'",
4392 /* Compute the namespace where a declaration is defined. */
4395 decl_namespace (decl)
4398 while (DECL_CONTEXT (decl))
4400 decl = DECL_CONTEXT (decl);
4401 if (TREE_CODE (decl) == NAMESPACE_DECL)
4403 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 't')
4404 decl = TYPE_STUB_DECL (decl);
4405 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd', 390);
4408 return global_namespace;
4411 /* Return the namespace where the current declaration is declared. */
4414 current_decl_namespace ()
4417 /* If we have been pushed into a different namespace, use it. */
4418 if (decl_namespace_list)
4419 return TREE_PURPOSE (decl_namespace_list);
4421 if (current_class_type)
4422 result = decl_namespace (TYPE_STUB_DECL (current_class_type));
4423 else if (current_function_decl)
4424 result = decl_namespace (current_function_decl);
4426 result = current_namespace;
4430 /* Temporarily set the namespace for the current declaration. */
4433 push_decl_namespace (decl)
4436 if (TREE_CODE (decl) != NAMESPACE_DECL)
4437 decl = decl_namespace (decl);
4438 decl_namespace_list = tree_cons (decl, NULL_TREE, decl_namespace_list);
4442 pop_decl_namespace ()
4444 decl_namespace_list = TREE_CHAIN (decl_namespace_list);
4447 /* Enter a class or namespace scope. */
4453 if (TREE_CODE (t) == NAMESPACE_DECL)
4454 push_decl_namespace (t);
4459 /* Leave scope pushed by push_scope. */
4465 if (TREE_CODE (t) == NAMESPACE_DECL)
4466 pop_decl_namespace ();
4471 /* [basic.lookup.koenig] */
4472 /* A non-zero return value in the functions below indicates an error.
4473 All nodes allocated in the procedure are on the scratch obstack. */
4483 static int arg_assoc PROTO((struct arg_lookup*, tree));
4484 static int arg_assoc_args PROTO((struct arg_lookup*, tree));
4485 static int arg_assoc_type PROTO((struct arg_lookup*, tree));
4486 static int add_function PROTO((struct arg_lookup *, tree));
4487 static int arg_assoc_namespace PROTO((struct arg_lookup *, tree));
4488 static int arg_assoc_class PROTO((struct arg_lookup *, tree));
4489 static int arg_assoc_template_arg PROTO((struct arg_lookup*, tree));
4491 /* Add a function to the lookup structure.
4492 Returns 1 on error. */
4495 add_function (k, fn)
4496 struct arg_lookup *k;
4499 /* We used to check here to see if the function was already in the list,
4500 but that's O(n^2), which is just too expensive for function lookup.
4501 Now we deal with the occasional duplicate in joust. In doing this, we
4502 assume that the number of duplicates will be small compared to the
4503 total number of functions being compared, which should usually be the
4506 /* We must find only functions, or exactly one non-function. */
4507 if (k->functions && is_overloaded_fn (k->functions)
4508 && is_overloaded_fn (fn))
4509 k->functions = build_overload (fn, k->functions);
4510 else if (k->functions)
4512 tree f1 = OVL_CURRENT (k->functions);
4514 if (is_overloaded_fn (f1))
4516 fn = f1; f1 = f2; f2 = fn;
4518 cp_error_at ("`%D' is not a function,", f1);
4519 cp_error_at (" conflict with `%D'", f2);
4520 cp_error (" in call to `%D'", k->name);
4528 /* Add functions of a namespace to the lookup structure.
4529 Returns 1 on error. */
4532 arg_assoc_namespace (k, scope)
4533 struct arg_lookup *k;
4538 if (purpose_member (scope, k->namespaces))
4540 k->namespaces = tree_cons (scope, NULL_TREE, k->namespaces);
4542 value = namespace_binding (k->name, scope);
4546 for (; value; value = OVL_NEXT (value))
4547 if (add_function (k, OVL_CURRENT (value)))
4553 /* Adds everything associated with a template argument to the lookup
4554 structure. Returns 1 on error. */
4557 arg_assoc_template_arg (k, arg)
4558 struct arg_lookup* k;
4561 /* [basic.lookup.koenig]
4563 If T is a template-id, its associated namespaces and classes are
4564 ... the namespaces and classes associated with the types of the
4565 template arguments provided for template type parameters
4566 (excluding template template parameters); the namespaces in which
4567 any template template arguments are defined; and the classes in
4568 which any member templates used as template template arguments
4569 are defined. [Note: non-type template arguments do not
4570 contribute to the set of associated namespaces. ] */
4572 /* Consider first template template arguments. */
4573 if (TREE_CODE (arg) == TEMPLATE_DECL)
4575 tree ctx = CP_DECL_CONTEXT (arg);
4577 /* It's not a member template. */
4578 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4579 return arg_assoc_namespace (k, ctx);
4580 /* Otherwise, it must be member template. */
4582 return arg_assoc_class (k, ctx);
4584 /* It's not a template template argument, but it is a type template
4586 else if (TREE_CODE_CLASS (TREE_CODE (arg)) == 't')
4587 return arg_assoc_type (k, arg);
4588 /* It's a non-type template argument. */
4593 /* Adds everything associated with class to the lookup structure.
4594 Returns 1 on error. */
4597 arg_assoc_class (k, type)
4598 struct arg_lookup* k;
4601 tree list, friends, context;
4604 /* Backend build structures, such as __builtin_va_list, aren't
4605 affected by all this. */
4606 if (!CLASS_TYPE_P (type))
4609 if (purpose_member (type, k->classes))
4611 k->classes = tree_cons (type, NULL_TREE, k->classes);
4613 context = decl_namespace (TYPE_MAIN_DECL (type));
4614 if (arg_assoc_namespace (k, context))
4617 /* Process baseclasses. */
4618 for (i = 0; i < CLASSTYPE_N_BASECLASSES (type); i++)
4619 if (arg_assoc_class (k, TYPE_BINFO_BASETYPE (type, i)))
4622 /* Process friends. */
4623 for (list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list;
4624 list = TREE_CHAIN (list))
4625 if (k->name == TREE_PURPOSE (list))
4626 for (friends = TREE_VALUE (list); friends;
4627 friends = TREE_CHAIN (friends))
4628 /* Only interested in global functions with potentially hidden
4629 (i.e. unqualified) declarations. */
4630 if (TREE_PURPOSE (list) == error_mark_node && TREE_VALUE (list)
4631 && decl_namespace (TREE_VALUE (list)) == context)
4632 if (add_function (k, TREE_VALUE (list)))
4635 /* Process template arguments. */
4636 if (CLASSTYPE_TEMPLATE_INFO (type))
4638 list = innermost_args (CLASSTYPE_TI_ARGS (type));
4639 for (i = 0; i < TREE_VEC_LENGTH (list); ++i)
4640 arg_assoc_template_arg (k, TREE_VEC_ELT (list, i));
4646 /* Adds everything associated with a given type.
4647 Returns 1 on error. */
4650 arg_assoc_type (k, type)
4651 struct arg_lookup *k;
4654 switch (TREE_CODE (type))
4664 if (TYPE_PTRMEMFUNC_P (type))
4665 return arg_assoc_type (k, TYPE_PTRMEMFUNC_FN_TYPE (type));
4666 return arg_assoc_class (k, type);
4668 case REFERENCE_TYPE:
4670 return arg_assoc_type (k, TREE_TYPE (type));
4673 return arg_assoc_namespace (k, decl_namespace (TYPE_MAIN_DECL (type)));
4675 /* Pointer to member: associate class type and value type. */
4676 if (arg_assoc_type (k, TYPE_OFFSET_BASETYPE (type)))
4678 return arg_assoc_type (k, TREE_TYPE (type));
4680 /* The basetype is referenced in the first arg type, so just
4683 /* Associate the parameter types. */
4684 if (arg_assoc_args (k, TYPE_ARG_TYPES (type)))
4686 /* Associate the return type. */
4687 return arg_assoc_type (k, TREE_TYPE (type));
4688 case TEMPLATE_TYPE_PARM:
4689 case TEMPLATE_TEMPLATE_PARM:
4692 if (type == unknown_type_node)
4694 /* else fall through */
4696 my_friendly_abort (390);
4701 /* Adds everything associated with arguments. Returns 1 on error. */
4704 arg_assoc_args (k, args)
4705 struct arg_lookup* k;
4708 for (; args; args = TREE_CHAIN (args))
4709 if (arg_assoc (k, TREE_VALUE (args)))
4714 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4718 struct arg_lookup* k;
4721 if (n == error_mark_node)
4724 if (TREE_CODE_CLASS (TREE_CODE (n)) == 't')
4725 return arg_assoc_type (k, n);
4727 if (! type_unknown_p (n))
4728 return arg_assoc_type (k, TREE_TYPE (n));
4730 if (TREE_CODE (n) == ADDR_EXPR)
4731 n = TREE_OPERAND (n, 0);
4732 if (TREE_CODE (n) == COMPONENT_REF)
4733 n = TREE_OPERAND (n, 1);
4734 if (TREE_CODE (n) == OFFSET_REF)
4735 n = TREE_OPERAND (n, 1);
4736 while (TREE_CODE (n) == TREE_LIST)
4739 if (TREE_CODE (n) == FUNCTION_DECL)
4740 return arg_assoc_type (k, TREE_TYPE (n));
4741 if (TREE_CODE (n) == TEMPLATE_ID_EXPR)
4743 /* [basic.lookup.koenig]
4745 If T is a template-id, its associated namespaces and classes
4746 are the namespace in which the template is defined; for
4747 member templates, the member template's class... */
4748 tree template = TREE_OPERAND (n, 0);
4749 tree args = TREE_OPERAND (n, 1);
4753 /* First, the template. There may actually be more than one if
4754 this is an overloaded function template. But, in that case,
4755 we only need the first; all the functions will be in the same
4757 template = OVL_CURRENT (template);
4759 ctx = CP_DECL_CONTEXT (template);
4761 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4763 if (arg_assoc_namespace (k, ctx) == 1)
4766 /* It must be a member template. */
4767 else if (arg_assoc_class (k, ctx) == 1)
4770 /* Now the arguments. */
4771 for (arg = args; arg != NULL_TREE; arg = TREE_CHAIN (arg))
4772 if (arg_assoc_template_arg (k, TREE_VALUE (arg)) == 1)
4777 my_friendly_assert (TREE_CODE (n) == OVERLOAD, 980715);
4779 for (; n; n = OVL_CHAIN (n))
4780 if (arg_assoc_type (k, TREE_TYPE (OVL_FUNCTION (n))))
4787 /* Performs Koenig lookup depending on arguments, where fns
4788 are the functions found in normal lookup. */
4791 lookup_arg_dependent (name, fns, args)
4796 struct arg_lookup k;
4800 k.classes = NULL_TREE;
4802 /* Note that we've already looked at some namespaces during normal
4803 unqualified lookup, unless we found a decl in function scope. */
4804 if (fns && DECL_LOCAL_FUNCTION_P (OVL_CURRENT (fns)))
4805 k.namespaces = NULL_TREE;
4807 unqualified_namespace_lookup (name, 0, &k.namespaces);
4809 arg_assoc_args (&k, args);
4813 /* Process a namespace-alias declaration. */
4816 do_namespace_alias (alias, namespace)
4817 tree alias, namespace;
4819 if (TREE_CODE (namespace) != NAMESPACE_DECL)
4821 /* The parser did not find it, so it's not there. */
4822 cp_error ("unknown namespace `%D'", namespace);
4826 namespace = ORIGINAL_NAMESPACE (namespace);
4828 /* Build the alias. */
4829 alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node);
4830 DECL_NAMESPACE_ALIAS (alias) = namespace;
4834 /* Check a non-member using-declaration. Return the name and scope
4835 being used, and the USING_DECL, or NULL_TREE on failure. */
4838 validate_nonmember_using_decl (decl, scope, name)
4843 if (TREE_CODE (decl) == SCOPE_REF
4844 && TREE_OPERAND (decl, 0) == std_node)
4846 if (namespace_bindings_p ()
4847 && current_namespace == global_namespace)
4848 /* There's no need for a using declaration at all, here,
4849 since `std' is the same as `::'. We can't just pass this
4850 on because we'll complain later about declaring something
4851 in the same scope as a using declaration with the same
4852 name. We return NULL_TREE which indicates to the caller
4853 that there's no need to do any further processing. */
4856 *scope = global_namespace;
4857 *name = TREE_OPERAND (decl, 1);
4859 else if (TREE_CODE (decl) == SCOPE_REF)
4861 *scope = TREE_OPERAND (decl, 0);
4862 *name = TREE_OPERAND (decl, 1);
4864 /* [namespace.udecl]
4866 A using-declaration for a class member shall be a
4867 member-declaration. */
4868 if (TREE_CODE (*scope) != NAMESPACE_DECL)
4870 if (TYPE_P (*scope))
4871 cp_error ("`%T' is not a namespace", *scope);
4873 cp_error ("`%D' is not a namespace", *scope);
4877 else if (TREE_CODE (decl) == IDENTIFIER_NODE
4878 || TREE_CODE (decl) == TYPE_DECL
4879 || TREE_CODE (decl) == TEMPLATE_DECL)
4881 *scope = global_namespace;
4885 my_friendly_abort (382);
4886 if (TREE_CODE_CLASS (TREE_CODE (*name)) == 'd')
4887 *name = DECL_NAME (*name);
4888 /* Make a USING_DECL. */
4889 return push_using_decl (*scope, *name);
4892 /* Process local and global using-declarations. */
4895 do_nonmember_using_decl (scope, name, oldval, oldtype, newval, newtype)
4897 tree oldval, oldtype;
4898 tree *newval, *newtype;
4902 *newval = *newtype = NULL_TREE;
4903 decls = make_node (CPLUS_BINDING);
4904 if (!qualified_lookup_using_namespace (name, scope, decls, 0))
4908 if (!BINDING_VALUE (decls) && !BINDING_TYPE (decls))
4910 cp_error ("`%D' not declared", name);
4914 /* Check for using functions. */
4915 if (BINDING_VALUE (decls) && is_overloaded_fn (BINDING_VALUE (decls)))
4919 if (oldval && !is_overloaded_fn (oldval))
4921 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls)), oldval);
4926 for (tmp = BINDING_VALUE (decls); tmp; tmp = OVL_NEXT (tmp))
4928 tree new_fn = OVL_CURRENT (tmp);
4930 /* [namespace.udecl]
4932 If a function declaration in namespace scope or block
4933 scope has the same name and the same parameter types as a
4934 function introduced by a using declaration the program is
4936 for (tmp1 = oldval; tmp1; tmp1 = OVL_NEXT (tmp1))
4938 tree old_fn = OVL_CURRENT (tmp1);
4940 if (!OVL_USED (tmp1)
4941 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn)),
4942 TYPE_ARG_TYPES (TREE_TYPE (old_fn))))
4944 /* There was already a non-using declaration in
4945 this scope with the same parameter types. */
4946 cp_error ("`%D' is already declared in this scope",
4950 else if (duplicate_decls (new_fn, old_fn))
4951 /* We're re-using something we already used
4952 before. We don't need to add it again. */
4956 /* If we broke out of the loop, there's no reason to add
4957 this function to the using declarations for this
4962 *newval = build_overload (OVL_CURRENT (tmp), *newval);
4963 if (TREE_CODE (*newval) != OVERLOAD)
4964 *newval = ovl_cons (*newval, NULL_TREE);
4965 OVL_USED (*newval) = 1;
4970 *newval = BINDING_VALUE (decls);
4972 duplicate_decls (*newval, oldval);
4975 *newtype = BINDING_TYPE (decls);
4976 if (oldtype && *newtype && oldtype != *newtype)
4978 cp_error ("using directive `%D' introduced ambiguous type `%T'",
4984 /* Process a using-declaration not appearing in class or local scope. */
4987 do_toplevel_using_decl (decl)
4990 tree scope, name, binding;
4991 tree oldval, oldtype, newval, newtype;
4993 decl = validate_nonmember_using_decl (decl, &scope, &name);
4994 if (decl == NULL_TREE)
4997 binding = binding_for_name (name, current_namespace);
4999 oldval = BINDING_VALUE (binding);
5000 oldtype = BINDING_TYPE (binding);
5002 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5004 /* Copy declarations found. */
5006 BINDING_VALUE (binding) = newval;
5008 BINDING_TYPE (binding) = newtype;
5012 /* Process a using-declaration at function scope. */
5015 do_local_using_decl (decl)
5019 tree oldval, oldtype, newval, newtype;
5021 decl = validate_nonmember_using_decl (decl, &scope, &name);
5022 if (decl == NULL_TREE)
5025 oldval = lookup_name_current_level (name);
5026 oldtype = lookup_type_current_level (name);
5028 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5032 if (is_overloaded_fn (newval))
5036 /* We only need to push declarations for those functions
5037 that were not already bound in the current level.
5038 The old value might be NULL_TREE, it might be a single
5039 function, or an OVERLOAD. */
5040 if (oldval && TREE_CODE (oldval) == OVERLOAD)
5041 term = OVL_FUNCTION (oldval);
5044 for (fn = newval; fn && OVL_CURRENT (fn) != term;
5046 push_overloaded_decl (OVL_CURRENT (fn),
5047 PUSH_LOCAL | PUSH_USING);
5050 push_local_binding (name, newval, PUSH_USING);
5053 set_identifier_type_value (name, newtype);
5057 do_class_using_decl (decl)
5062 if (TREE_CODE (decl) != SCOPE_REF
5063 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl, 0))) != 't')
5065 cp_error ("using-declaration for non-member at class scope");
5068 name = TREE_OPERAND (decl, 1);
5069 if (TREE_CODE (name) == BIT_NOT_EXPR)
5071 cp_error ("using-declaration for destructor");
5074 if (TREE_CODE (name) == TYPE_DECL)
5075 name = DECL_NAME (name);
5077 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 980716);
5079 value = build_lang_decl (USING_DECL, name, void_type_node);
5080 DECL_INITIAL (value) = TREE_OPERAND (decl, 0);
5084 /* Process a using-directive. */
5087 do_using_directive (namespace)
5090 if (namespace == std_node)
5092 /* using namespace A::B::C; */
5093 if (TREE_CODE (namespace) == SCOPE_REF)
5094 namespace = TREE_OPERAND (namespace, 1);
5095 if (TREE_CODE (namespace) == IDENTIFIER_NODE)
5097 /* Lookup in lexer did not find a namespace. */
5098 cp_error ("namespace `%T' undeclared", namespace);
5101 if (TREE_CODE (namespace) != NAMESPACE_DECL)
5103 cp_error ("`%T' is not a namespace", namespace);
5106 namespace = ORIGINAL_NAMESPACE (namespace);
5107 if (!toplevel_bindings_p ())
5108 push_using_directive (namespace);
5111 add_using_namespace (current_namespace, namespace, 0);
5115 check_default_args (x)
5118 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
5119 int saw_def = 0, i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
5120 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
5122 if (TREE_PURPOSE (arg))
5126 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5137 TREE_USED (decl) = 1;
5138 if (processing_template_decl)
5140 assemble_external (decl);
5142 /* Is it a synthesized method that needs to be synthesized? */
5143 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_CLASS_CONTEXT (decl)
5144 && DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
5145 /* Kludge: don't synthesize for default args. */
5146 && current_function_decl)
5147 synthesize_method (decl);
5149 /* If this is a function or variable that is an instance of some
5150 template, we now know that we will need to actually do the
5151 instantiation. We check that DECL is not an explicit
5152 instantiation because that is not checked in instantiate_decl. */
5153 if ((TREE_CODE (decl) == FUNCTION_DECL || TREE_CODE (decl) == VAR_DECL)
5154 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
5155 && !DECL_EXPLICIT_INSTANTIATION (decl))
5156 instantiate_decl (decl);
5159 /* Helper function for named_class_head_sans_basetype nonterminal. We
5160 have just seen something of the form `AGGR SCOPE::ID'. Return a
5161 TYPE_DECL for the type declared by ID in SCOPE. */
5164 handle_class_head (aggr, scope, id)
5165 tree aggr, scope, id;
5169 if (TREE_CODE (id) == TYPE_DECL)
5171 else if (DECL_CLASS_TEMPLATE_P (id))
5172 decl = DECL_TEMPLATE_RESULT (id);
5175 tree current = current_scope();
5177 if (current == NULL_TREE)
5178 current = current_namespace;
5179 if (scope == std_node)
5180 scope = global_namespace;
5181 if (scope == NULL_TREE)
5182 scope = global_namespace;
5183 if (scope == current)
5185 /* We've been given AGGR SCOPE::ID, when we're already inside SCOPE.
5186 Be nice about it. */
5188 cp_pedwarn ("extra qualification `%T::' on member `%D' ignored",
5189 FROB_CONTEXT (scope), id);
5191 else if (scope != global_namespace)
5192 cp_error ("`%T' does not have a nested type named `%D'", scope, id);
5194 cp_error ("no file-scope type named `%D'", id);
5196 /* Inject it at the current scope. */
5197 decl = TYPE_MAIN_DECL (xref_tag (aggr, id, 1));
5200 /* Enter the SCOPE. If this turns out not to be a definition, the
5201 parser must leave the scope. */
5202 push_scope (CP_DECL_CONTEXT (decl));
5204 /* If we see something like:
5206 template <typename T> struct S::I ....
5208 we must create a TEMPLATE_DECL for the nested type. */
5209 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5210 decl = push_template_decl (decl);
5215 /* Initialize decl2.c. */
5220 ggc_add_tree_root (&decl_namespace_list, 1);
5221 ggc_add_tree_varray_root (&saved_inlines, 1);
5222 ggc_add_tree_varray_root (&pending_statics, 1);
5223 ggc_add_tree_varray_root (&ssdf_decls, 1);
5224 ggc_add_tree_root (&ssdf_decl, 1);
5225 ggc_add_tree_root (&priority_decl, 1);
5226 ggc_add_tree_root (&initialize_p_decl, 1);
5227 ggc_add_tree_root (&pending_vtables, 1);