1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
44 #include "dwarf2out.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 PARAMS ((tree));
65 static void mark_vtable_entries PARAMS ((tree));
66 static void grok_function_init PARAMS ((tree, tree));
67 static int finish_vtable_vardecl PARAMS ((tree *, void *));
68 static int prune_vtable_vardecl PARAMS ((tree *, void *));
69 static int is_namespace_ancestor PARAMS ((tree, tree));
70 static void add_using_namespace PARAMS ((tree, tree, int));
71 static tree ambiguous_decl PARAMS ((tree, tree, tree,int));
72 static tree build_anon_union_vars PARAMS ((tree, tree*, int, int));
73 static int acceptable_java_type PARAMS ((tree));
74 static void output_vtable_inherit PARAMS ((tree));
75 static tree start_objects PARAMS ((int, int));
76 static void finish_objects PARAMS ((int, int, tree));
77 static tree merge_functions PARAMS ((tree, tree));
78 static tree decl_namespace PARAMS ((tree));
79 static tree validate_nonmember_using_decl PARAMS ((tree, tree *, tree *));
80 static void do_nonmember_using_decl PARAMS ((tree, tree, tree, tree,
82 static tree start_static_storage_duration_function PARAMS ((void));
83 static void finish_static_storage_duration_function PARAMS ((tree));
84 static priority_info get_priority_info PARAMS ((int));
85 static void do_static_initialization PARAMS ((tree, tree));
86 static void do_static_destruction PARAMS ((tree));
87 static tree start_static_initialization_or_destruction PARAMS ((tree, int));
88 static void finish_static_initialization_or_destruction PARAMS ((tree));
89 static void generate_ctor_or_dtor_function PARAMS ((int, int));
90 static int generate_ctor_and_dtor_functions_for_priority
91 PARAMS ((splay_tree_node, void *));
92 static tree prune_vars_needing_no_initialization PARAMS ((tree));
93 static void write_out_vars PARAMS ((tree));
94 static void import_export_class PARAMS ((tree));
95 static tree key_method PARAMS ((tree));
97 extern int current_class_depth;
99 /* A list of virtual function tables we must make sure to write out. */
100 tree pending_vtables;
102 /* A list of static class variables. This is needed, because a
103 static class variable can be declared inside the class without
104 an initializer, and then initialized, staticly, outside the class. */
105 static varray_type pending_statics;
106 #define pending_statics_used \
107 (pending_statics ? pending_statics->elements_used : 0)
109 /* A list of functions which were declared inline, but which we
110 may need to emit outline anyway. */
111 static varray_type deferred_fns;
112 #define deferred_fns_used \
113 (deferred_fns ? deferred_fns->elements_used : 0)
115 /* Same, but not reset. Local temp variables and global temp variables
116 can have the same name. */
117 static int global_temp_name_counter;
119 /* Flag used when debugging spew.c */
121 extern int spew_debug;
123 /* Nonzero if we're done parsing and into end-of-file activities. */
127 /* Functions called along with real static constructors and destructors. */
129 tree static_ctors, static_dtors;
131 /* The :: namespace. */
133 tree global_namespace;
135 /* The stack for namespaces of current declarations. */
137 static tree decl_namespace_list;
140 /* C (and C++) language-specific option variables. */
142 /* Nonzero means allow type mismatches in conditional expressions;
143 just make their values `void'. */
145 int flag_cond_mismatch;
147 /* Nonzero means give `double' the same size as `float'. */
149 int flag_short_double;
151 /* Nonzero means don't recognize the keyword `asm'. */
155 /* Nonzero means don't recognize any extension keywords. */
157 int flag_no_gnu_keywords;
159 /* Nonzero means don't recognize the non-ANSI builtin functions. */
163 /* Nonzero means don't recognize the non-ANSI builtin functions.
166 int flag_no_nonansi_builtin;
168 /* Nonzero means do some things the same way PCC does. Only provided so
169 the compiler will link. */
171 int flag_traditional;
173 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
175 int flag_signed_bitfields = 1;
177 /* Nonzero means enable obscure standard features and disable GNU
178 extensions that might cause standard-compliant code to be
183 /* Nonzero means do emit exported implementations of functions even if
184 they can be inlined. */
186 int flag_implement_inlines = 1;
188 /* Nonzero means do emit exported implementations of templates, instead of
189 multiple static copies in each file that needs a definition. */
191 int flag_external_templates;
193 /* Nonzero means that the decision to emit or not emit the implementation of a
194 template depends on where the template is instantiated, rather than where
197 int flag_alt_external_templates;
199 /* Nonzero means that implicit instantiations will be emitted if needed. */
201 int flag_implicit_templates = 1;
203 /* Nonzero means that implicit instantiations of inline templates will be
204 emitted if needed, even if instantiations of non-inline templates
207 int flag_implicit_inline_templates = 1;
209 /* Nonzero means warn about implicit declarations. */
211 int warn_implicit = 1;
213 /* Nonzero means warn about usage of long long when `-pedantic'. */
215 int warn_long_long = 1;
217 /* Nonzero means warn when all ctors or dtors are private, and the class
220 int warn_ctor_dtor_privacy = 1;
222 /* True if we want to implement vtables using "thunks".
223 The default is off. */
225 #ifndef DEFAULT_VTABLE_THUNKS
226 #define DEFAULT_VTABLE_THUNKS 0
228 int flag_vtable_thunks = DEFAULT_VTABLE_THUNKS;
230 /* Nonzero means generate separate instantiation control files and juggle
231 them at link time. */
233 int flag_use_repository;
235 /* Nonzero if we want to issue diagnostics that the standard says are not
238 int flag_optional_diags = 1;
240 /* Nonzero means give string constants the type `const char *', as mandated
243 int flag_const_strings = 1;
245 /* If non-NULL, dump the tree structure for the entire translation
246 unit to this file. */
248 char *flag_dump_translation_unit = 0;
250 /* Nonzero means warn about deprecated conversion from string constant to
253 int warn_write_strings;
255 /* Nonzero means warn about pointer casts that can drop a type qualifier
256 from the pointer target type. */
260 /* Nonzero means warn about sizeof(function) or addition/subtraction
261 of function pointers. */
263 int warn_pointer_arith = 1;
265 /* Nonzero means warn for any function def without prototype decl. */
267 int warn_missing_prototypes;
269 /* Nonzero means warn about multiple (redundant) decls for the same single
270 variable or function. */
272 int warn_redundant_decls;
274 /* Warn if initializer is not completely bracketed. */
276 int warn_missing_braces;
278 /* Warn about comparison of signed and unsigned values. */
280 int warn_sign_compare;
282 /* Warn about testing equality of floating point numbers. */
284 int warn_float_equal = 0;
286 /* Warn about *printf or *scanf format/argument anomalies. */
290 /* Warn about a subscript that has type char. */
292 int warn_char_subscripts;
294 /* Warn if a type conversion is done that might have confusing results. */
298 /* Warn if adding () is suggested. */
300 int warn_parentheses;
302 /* Non-zero means warn in function declared in derived class has the
303 same name as a virtual in the base class, but fails to match the
304 type signature of any virtual function in the base class. */
305 int warn_overloaded_virtual;
307 /* Non-zero means warn when declaring a class that has a non virtual
308 destructor, when it really ought to have a virtual one. */
311 /* Non-zero means warn when a function is declared extern and later inline. */
312 int warn_extern_inline;
314 /* Non-zero means warn when the compiler will reorder code. */
317 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
320 /* Non-zero means warn when we convert a pointer to member function
321 into a pointer to (void or function). */
322 int warn_pmf2ptr = 1;
324 /* Nonzero means warn about violation of some Effective C++ style rules. */
328 /* Nonzero means warn where overload resolution chooses a promotion from
329 unsigned to signed over a conversion to an unsigned of the same size. */
333 /* Nonzero means warn when an old-style cast is used. */
335 int warn_old_style_cast;
337 /* Warn about #pragma directives that are not recognised. */
339 int warn_unknown_pragmas; /* Tri state variable. */
341 /* Nonzero means warn about use of multicharacter literals. */
343 int warn_multichar = 1;
345 /* Nonzero means warn when non-templatized friend functions are
346 declared within a template */
348 int warn_nontemplate_friend = 1;
350 /* Nonzero means complain about deprecated features. */
352 int warn_deprecated = 1;
354 /* Nonzero means `$' can be in an identifier. */
356 #ifndef DOLLARS_IN_IDENTIFIERS
357 #define DOLLARS_IN_IDENTIFIERS 1
359 int dollars_in_ident = DOLLARS_IN_IDENTIFIERS;
361 /* Nonzero for -fno-strict-prototype switch: do not consider empty
362 argument prototype to mean function takes no arguments. */
364 int flag_strict_prototype = 2;
365 int strict_prototype = 1;
366 int strict_prototypes_lang_c, strict_prototypes_lang_cplusplus = 1;
368 /* Nonzero means that labels can be used as first-class objects */
372 /* Nonzero means allow Microsoft extensions without a pedwarn. */
374 int flag_ms_extensions;
376 /* Non-zero means to collect statistics which might be expensive
377 and to print them when we are done. */
378 int flag_detailed_statistics;
380 /* C++ specific flags. */
381 /* Zero means that `this' is a *const. This gives nice behavior in the
382 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
383 -2 means we're constructing an object and it has fixed type. */
385 int flag_this_is_variable;
387 /* Nonzero means we should attempt to elide constructors when possible. */
389 int flag_elide_constructors = 1;
391 /* Nonzero means that member functions defined in class scope are
392 inline by default. */
394 int flag_default_inline = 1;
396 /* Controls whether compiler generates 'type descriptor' that give
397 run-time type information. */
400 /* Nonzero if we wish to output cross-referencing information
401 for the GNU class browser. */
402 extern int flag_gnu_xref;
404 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
407 int flag_huge_objects;
409 /* Nonzero if we want to conserve space in the .o files. We do this
410 by putting uninitialized data and runtime initialized data into
411 .common instead of .data at the expense of not flagging multiple
414 int flag_conserve_space;
416 /* Nonzero if we want to obey access control semantics. */
418 int flag_access_control = 1;
420 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
422 int flag_operator_names;
424 /* Nonzero if we want to check the return value of new and avoid calling
425 constructors if it is a null pointer. */
429 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
430 initialization variables.
431 0: Old rules, set by -fno-for-scope.
432 2: New ISO rules, set by -ffor-scope.
433 1: Try to implement new ISO rules, but with backup compatibility
434 (and warnings). This is the default, for now. */
436 int flag_new_for_scope = 1;
438 /* Nonzero if we want to emit defined symbols with common-like linkage as
439 weak symbols where possible, in order to conform to C++ semantics.
440 Otherwise, emit them as local symbols. */
444 /* Nonzero to enable experimental ABI changes. */
448 /* Nonzero to use __cxa_atexit, rather than atexit, to register
449 destructors for local statics and global objects. */
451 int flag_use_cxa_atexit;
453 /* Nonzero to not ignore namespace std. */
455 int flag_honor_std = ENABLE_STD_NAMESPACE;
457 /* Nonzero if we should expand functions calls inline at the tree
458 level, rather than at the RTL level. */
460 int flag_inline_trees = 0;
462 /* Maximum template instantiation depth. Must be at least 17 for ISO
465 int max_tinst_depth = 17;
467 /* The name-mangling scheme to use. Must be 1 or greater to support
468 template functions with identical types, but different template
470 int name_mangling_version = 2;
472 /* Nonzero means that guiding declarations are allowed. */
473 int flag_guiding_decls;
475 /* Nonzero if wchar_t should be `unsigned short' instead of whatever it
476 would normally be, for use with WINE. */
477 int flag_short_wchar;
479 /* Nonzero if squashed mangling is to be performed.
480 This uses the B and K codes to reference previously seen class types
481 and class qualifiers. */
482 int flag_do_squangling;
484 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
488 /* Nonzero means make the default pedwarns warnings instead of errors.
489 The value of this flag is ignored if -pedantic is specified. */
493 /* Nonzero means to implement standard semantics for exception
494 specifications, calling unexpected if an exception is thrown that
495 doesn't match the specification. Zero means to treat them as
496 assertions and optimize accordingly, but not check them. */
498 int flag_enforce_eh_specs = 1;
500 /* If this variable is defined to a non-NULL value, it will be called
501 after the file has been completely parsed. */
503 void (*back_end_hook) PARAMS ((tree));
505 /* Table of language-dependent -f options.
506 STRING is the option name. VARIABLE is the address of the variable.
507 ON_VALUE is the value to store in VARIABLE
508 if `-fSTRING' is seen as an option.
509 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
511 static struct { const char *string; int *variable; int on_value;}
515 {"signed-char", &flag_signed_char, 1},
516 {"unsigned-char", &flag_signed_char, 0},
517 {"signed-bitfields", &flag_signed_bitfields, 1},
518 {"unsigned-bitfields", &flag_signed_bitfields, 0},
519 {"short-enums", &flag_short_enums, 1},
520 {"short-double", &flag_short_double, 1},
521 {"short-wchar", &flag_short_wchar, 1},
522 {"cond-mismatch", &flag_cond_mismatch, 1},
523 {"asm", &flag_no_asm, 0},
524 {"builtin", &flag_no_builtin, 0},
526 /* C++-only options. */
527 {"access-control", &flag_access_control, 1},
528 {"check-new", &flag_check_new, 1},
529 {"conserve-space", &flag_conserve_space, 1},
530 {"const-strings", &flag_const_strings, 1},
531 {"default-inline", &flag_default_inline, 1},
532 {"dollars-in-identifiers", &dollars_in_ident, 1},
533 {"elide-constructors", &flag_elide_constructors, 1},
534 {"enforce-eh-specs", &flag_enforce_eh_specs, 1},
535 {"external-templates", &flag_external_templates, 1},
536 {"for-scope", &flag_new_for_scope, 2},
537 {"gnu-keywords", &flag_no_gnu_keywords, 0},
538 {"handle-exceptions", &flag_exceptions, 1},
539 {"honor-std", &flag_honor_std, 1},
540 {"huge-objects", &flag_huge_objects, 1},
541 {"implement-inlines", &flag_implement_inlines, 1},
542 {"implicit-inline-templates", &flag_implicit_inline_templates, 1},
543 {"implicit-templates", &flag_implicit_templates, 1},
544 {"labels-ok", &flag_labels_ok, 1},
545 {"ms-extensions", &flag_ms_extensions, 1},
546 {"nonansi-builtins", &flag_no_nonansi_builtin, 0},
547 {"operator-names", &flag_operator_names, 1},
548 {"optional-diags", &flag_optional_diags, 1},
549 {"permissive", &flag_permissive, 1},
550 {"repo", &flag_use_repository, 1},
551 {"rtti", &flag_rtti, 1},
552 {"squangle", &flag_do_squangling, 1},
553 {"stats", &flag_detailed_statistics, 1},
554 {"strict-prototype", &flag_strict_prototype, 1},
555 {"use-cxa-atexit", &flag_use_cxa_atexit, 1},
556 {"vtable-gc", &flag_vtable_gc, 1},
557 {"vtable-thunks", &flag_vtable_thunks, 1},
558 {"weak", &flag_weak, 1},
559 {"xref", &flag_gnu_xref, 1}
562 /* Decode the string P as a language-specific option.
563 Return the number of strings consumed for a valid option.
564 Otherwise return 0. Should not complain if it does not
565 recognise the option. */
568 lang_decode_option (argc, argv)
576 int strings_processed;
579 strings_processed = cpp_handle_option (&parse_in, argc, argv);
581 strings_processed = 0;
582 #endif /* ! USE_CPPLIB */
584 if (!strcmp (p, "-ftraditional") || !strcmp (p, "-traditional"))
586 else if (p[0] == '-' && p[1] == 'f')
588 /* Some kind of -f option.
589 P's value is the option sans `-f'.
590 Search for it in the table of options. */
594 /* Try special -f options. */
596 if (!strcmp (p, "handle-exceptions")
597 || !strcmp (p, "no-handle-exceptions"))
598 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
599 else if (!strcmp (p, "all-virtual")
600 || !strcmp (p, "enum-int-equiv")
601 || !strcmp (p, "no-nonnull-objects")
602 || !strcmp (p, "this-is-variable"))
603 warning ("-f%s is no longer supported", p);
604 else if (! strcmp (p, "alt-external-templates"))
606 flag_external_templates = 1;
607 flag_alt_external_templates = 1;
608 cp_deprecated ("-falt-external-templates");
610 else if (! strcmp (p, "no-alt-external-templates"))
611 flag_alt_external_templates = 0;
612 else if (!strcmp (p, "repo"))
614 flag_use_repository = 1;
615 flag_implicit_templates = 0;
617 else if (!strcmp (p, "guiding-decls"))
619 flag_guiding_decls = 1;
620 name_mangling_version = 0;
622 else if (!strcmp (p, "no-guiding-decls"))
623 flag_guiding_decls = 0;
624 else if (!strcmp (p, "external-templates"))
626 flag_external_templates = 1;
627 cp_deprecated ("-fexternal-templates");
629 else if (!strcmp (p, "new-abi"))
632 flag_do_squangling = 1;
633 flag_vtable_thunks = 1;
635 else if (!strcmp (p, "no-new-abi"))
638 flag_do_squangling = 0;
640 else if (!strncmp (p, "template-depth-", 15))
642 = read_integral_parameter (p + 15, p - 2, max_tinst_depth);
643 else if (!strncmp (p, "name-mangling-version-", 22))
644 name_mangling_version
645 = read_integral_parameter (p + 22, p - 2, name_mangling_version);
646 else if (!strncmp (p, "message-length=", 15))
648 (read_integral_parameter (p + 15, p - 2,
649 /* default line-wrap length */ 72));
650 else if (!strncmp (p, "dump-translation-unit-", 22))
653 error ("no file specified with -fdump-translation-unit");
655 flag_dump_translation_unit = p + 22;
662 !found && j < (sizeof (lang_f_options)
663 / sizeof (lang_f_options[0]));
666 if (!strcmp (p, lang_f_options[j].string))
668 *lang_f_options[j].variable = lang_f_options[j].on_value;
669 /* A goto here would be cleaner,
670 but breaks the vax pcc. */
673 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-'
674 && ! strcmp (p+3, lang_f_options[j].string))
676 *lang_f_options[j].variable = ! lang_f_options[j].on_value;
684 else if (p[0] == '-' && p[1] == 'W')
688 /* The -W options control the warning behavior of the compiler. */
691 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-')
694 if (!strcmp (p, "implicit"))
695 warn_implicit = setting;
696 else if (!strcmp (p, "long-long"))
697 warn_long_long = setting;
698 else if (!strcmp (p, "return-type"))
699 warn_return_type = setting;
700 else if (!strcmp (p, "ctor-dtor-privacy"))
701 warn_ctor_dtor_privacy = setting;
702 else if (!strcmp (p, "write-strings"))
703 warn_write_strings = setting;
704 else if (!strcmp (p, "cast-qual"))
705 warn_cast_qual = setting;
706 else if (!strcmp (p, "char-subscripts"))
707 warn_char_subscripts = setting;
708 else if (!strcmp (p, "pointer-arith"))
709 warn_pointer_arith = setting;
710 else if (!strcmp (p, "missing-prototypes"))
711 warn_missing_prototypes = setting;
712 else if (!strcmp (p, "redundant-decls"))
713 warn_redundant_decls = setting;
714 else if (!strcmp (p, "missing-braces"))
715 warn_missing_braces = setting;
716 else if (!strcmp (p, "sign-compare"))
717 warn_sign_compare = setting;
718 else if (!strcmp (p, "float-equal"))
719 warn_float_equal = setting;
720 else if (!strcmp (p, "format"))
721 warn_format = setting;
722 else if (!strcmp (p, "conversion"))
723 warn_conversion = setting;
724 else if (!strcmp (p, "parentheses"))
725 warn_parentheses = setting;
726 else if (!strcmp (p, "non-virtual-dtor"))
727 warn_nonvdtor = setting;
728 else if (!strcmp (p, "extern-inline"))
729 warn_extern_inline = setting;
730 else if (!strcmp (p, "reorder"))
731 warn_reorder = setting;
732 else if (!strcmp (p, "synth"))
733 warn_synth = setting;
734 else if (!strcmp (p, "pmf-conversions"))
735 warn_pmf2ptr = setting;
736 else if (!strcmp (p, "effc++"))
738 else if (!strcmp (p, "sign-promo"))
739 warn_sign_promo = setting;
740 else if (!strcmp (p, "old-style-cast"))
741 warn_old_style_cast = setting;
742 else if (!strcmp (p, "overloaded-virtual"))
743 warn_overloaded_virtual = setting;
744 else if (!strcmp (p, "multichar"))
745 warn_multichar = setting;
746 else if (!strcmp (p, "unknown-pragmas"))
747 /* Set to greater than 1, so that even unknown pragmas in
748 system headers will be warned about. */
749 warn_unknown_pragmas = setting * 2;
750 else if (!strcmp (p, "non-template-friend"))
751 warn_nontemplate_friend = setting;
752 else if (!strcmp (p, "deprecated"))
753 warn_deprecated = setting;
754 else if (!strcmp (p, "comment"))
755 ; /* cpp handles this one. */
756 else if (!strcmp (p, "comments"))
757 ; /* cpp handles this one. */
758 else if (!strcmp (p, "trigraphs"))
759 ; /* cpp handles this one. */
760 else if (!strcmp (p, "import"))
761 ; /* cpp handles this one. */
762 else if (!strcmp (p, "all"))
764 warn_return_type = setting;
765 warn_unused = setting;
766 warn_implicit = setting;
767 warn_switch = setting;
768 warn_format = setting;
769 warn_parentheses = setting;
770 warn_missing_braces = setting;
771 warn_sign_compare = setting;
772 warn_multichar = setting;
773 /* We save the value of warn_uninitialized, since if they put
774 -Wuninitialized on the command line, we need to generate a
775 warning about not using it without also specifying -O. */
776 if (warn_uninitialized != 1)
777 warn_uninitialized = (setting ? 2 : 0);
778 /* Only warn about unknown pragmas that are not in system
780 warn_unknown_pragmas = 1;
782 /* C++-specific warnings. */
783 warn_ctor_dtor_privacy = setting;
784 warn_nonvdtor = setting;
785 warn_reorder = setting;
786 warn_nontemplate_friend = setting;
788 else return strings_processed;
790 else if (!strcmp (p, "-ansi"))
791 flag_no_nonansi_builtin = 1, flag_ansi = 1,
792 flag_no_gnu_keywords = 1, flag_operator_names = 1;
794 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
795 it's probably safe to assume no sane person would ever want to use this
796 under normal circumstances. */
797 else if (!strcmp (p, "-spew-debug"))
801 return strings_processed;
806 /* Incorporate `const' and `volatile' qualifiers for member functions.
807 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
808 QUALS is a list of qualifiers. Returns any explicit
809 top-level qualifiers of the method's this pointer, anything other than
810 TYPE_UNQUALIFIED will be an extension. */
813 grok_method_quals (ctype, function, quals)
814 tree ctype, function, quals;
816 tree fntype = TREE_TYPE (function);
817 tree raises = TYPE_RAISES_EXCEPTIONS (fntype);
818 int type_quals = TYPE_UNQUALIFIED;
819 int dup_quals = TYPE_UNQUALIFIED;
820 int this_quals = TYPE_UNQUALIFIED;
824 int tq = cp_type_qual_from_rid (TREE_VALUE (quals));
826 if ((type_quals | this_quals) & tq)
828 else if (tq & TYPE_QUAL_RESTRICT)
832 quals = TREE_CHAIN (quals);
836 if (dup_quals != TYPE_UNQUALIFIED)
837 cp_error ("duplicate type qualifiers in %s declaration",
838 TREE_CODE (function) == FUNCTION_DECL
839 ? "member function" : "type");
841 ctype = cp_build_qualified_type (ctype, type_quals);
842 fntype = build_cplus_method_type (ctype, TREE_TYPE (fntype),
843 (TREE_CODE (fntype) == METHOD_TYPE
844 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
845 : TYPE_ARG_TYPES (fntype)));
847 fntype = build_exception_variant (fntype, raises);
849 TREE_TYPE (function) = fntype;
853 /* Warn when -fexternal-templates is used and #pragma
854 interface/implementation is not used all the times it should be,
858 warn_if_unknown_interface (decl)
861 static int already_warned = 0;
862 if (already_warned++)
865 if (flag_alt_external_templates)
867 struct tinst_level *til = tinst_for_decl ();
869 char *sf = input_filename;
874 input_filename = til->file;
876 cp_warning ("template `%#D' instantiated in file without #pragma interface",
882 cp_warning_at ("template `%#D' defined in file without #pragma interface",
886 /* A subroutine of the parser, to handle a component list. */
889 grok_x_components (specs)
892 struct pending_inline **p;
895 specs = strip_attrs (specs);
897 check_tag_decl (specs);
898 t = groktypename (build_decl_list (specs, NULL_TREE));
900 /* The only case where we need to do anything additional here is an
901 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
902 if (t == NULL_TREE || !ANON_AGGR_TYPE_P (t))
905 fixup_anonymous_aggr (t);
906 finish_member_declaration (build_lang_decl (FIELD_DECL, NULL_TREE, t));
908 /* Ignore any inline function definitions in the anonymous union
909 since an anonymous union may not have function members. */
910 p = &pending_inlines;
911 for (; *p; *p = (*p)->next)
912 if (DECL_CONTEXT ((*p)->fndecl) != t)
916 /* Constructors for types with virtual baseclasses need an "in-charge" flag
917 saying whether this constructor is responsible for initialization of
918 virtual baseclasses or not. All destructors also need this "in-charge"
919 flag, which additionally determines whether or not the destructor should
920 free the memory for the object.
922 This function adds the "in-charge" flag to member function FN if
923 appropriate. It is called from grokclassfn and tsubst.
924 FN must be either a constructor or destructor. */
927 maybe_retrofit_in_chrg (fn)
930 tree basetype, arg_types, parms, parm, fntype;
932 if (DECL_CONSTRUCTOR_P (fn)
933 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn))
934 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn))
936 else if (! DECL_CONSTRUCTOR_P (fn)
937 && TREE_CHAIN (DECL_ARGUMENTS (fn)) == NULL_TREE)
942 if (DECL_CONSTRUCTOR_P (fn))
943 DECL_CONSTRUCTOR_FOR_VBASE_P (fn) = 1;
945 /* First add it to DECL_ARGUMENTS... */
946 parm = build_decl (PARM_DECL, in_charge_identifier, integer_type_node);
947 /* Mark the artificial `__in_chrg' parameter as "artificial". */
948 SET_DECL_ARTIFICIAL (parm);
949 DECL_ARG_TYPE (parm) = integer_type_node;
950 TREE_READONLY (parm) = 1;
951 parms = DECL_ARGUMENTS (fn);
952 TREE_CHAIN (parm) = TREE_CHAIN (parms);
953 TREE_CHAIN (parms) = parm;
955 /* ...and then to TYPE_ARG_TYPES. */
956 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
957 basetype = TREE_TYPE (TREE_VALUE (arg_types));
958 arg_types = hash_tree_chain (integer_type_node, TREE_CHAIN (arg_types));
959 fntype = build_cplus_method_type (basetype, TREE_TYPE (TREE_TYPE (fn)),
961 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
962 fntype = build_exception_variant (fntype,
963 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
964 TREE_TYPE (fn) = fntype;
967 /* Classes overload their constituent function names automatically.
968 When a function name is declared in a record structure,
969 its name is changed to it overloaded name. Since names for
970 constructors and destructors can conflict, we place a leading
973 CNAME is the name of the class we are grokking for.
975 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
977 FLAGS contains bits saying what's special about today's
978 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
980 If FUNCTION is a destructor, then we must add the `auto-delete' field
981 as a second parameter. There is some hair associated with the fact
982 that we must "declare" this variable in the manner consistent with the
983 way the rest of the arguments were declared.
985 QUALS are the qualifiers for the this pointer. */
988 grokclassfn (ctype, function, flags, quals)
989 tree ctype, function;
990 enum overload_flags flags;
993 tree fn_name = DECL_NAME (function);
994 int this_quals = TYPE_UNQUALIFIED;
996 if (fn_name == NULL_TREE)
998 error ("name missing for member function");
999 fn_name = get_identifier ("<anonymous>");
1000 DECL_NAME (function) = fn_name;
1004 this_quals = grok_method_quals (ctype, function, quals);
1006 if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1008 /* Must add the class instance variable up front. */
1009 /* Right now we just make this a pointer. But later
1010 we may wish to make it special. */
1011 tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function)));
1015 /* The `this' parameter is implicitly `const'; it cannot be
1017 this_quals |= TYPE_QUAL_CONST;
1018 qual_type = cp_build_qualified_type (type, this_quals);
1019 parm = build_decl (PARM_DECL, this_identifier, qual_type);
1020 c_apply_type_quals_to_decl (this_quals, parm);
1022 /* Mark the artificial `this' parameter as "artificial". */
1023 SET_DECL_ARTIFICIAL (parm);
1024 DECL_ARG_TYPE (parm) = type;
1025 /* We can make this a register, so long as we don't
1026 accidentally complain if someone tries to take its address. */
1027 DECL_REGISTER (parm) = 1;
1028 TREE_CHAIN (parm) = last_function_parms;
1029 last_function_parms = parm;
1032 DECL_ARGUMENTS (function) = last_function_parms;
1033 DECL_CONTEXT (function) = ctype;
1035 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
1036 maybe_retrofit_in_chrg (function);
1038 if (flags == DTOR_FLAG)
1040 DECL_ASSEMBLER_NAME (function) = build_destructor_name (ctype);
1041 TYPE_HAS_DESTRUCTOR (ctype) = 1;
1044 set_mangled_name_for_decl (function);
1047 /* Work on the expr used by alignof (this is only called by the parser). */
1056 if (processing_template_decl)
1057 return build_min (ALIGNOF_EXPR, sizetype, expr);
1059 if (TREE_CODE (expr) == COMPONENT_REF
1060 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
1061 error ("`__alignof__' applied to a bit-field");
1063 if (TREE_CODE (expr) == INDIRECT_REF)
1065 best = t = TREE_OPERAND (expr, 0);
1066 bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1068 while (TREE_CODE (t) == NOP_EXPR
1069 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
1072 t = TREE_OPERAND (t, 0);
1073 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1074 if (thisalign > bestalign)
1075 best = t, bestalign = thisalign;
1077 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
1080 return c_alignof (TREE_TYPE (expr));
1083 /* Create an ARRAY_REF, checking for the user doing things backwards
1087 grok_array_decl (array_expr, index_exp)
1088 tree array_expr, index_exp;
1090 tree type = TREE_TYPE (array_expr);
1091 tree p1, p2, i1, i2;
1093 if (type == error_mark_node || index_exp == error_mark_node)
1094 return error_mark_node;
1095 if (processing_template_decl)
1096 return build_min (ARRAY_REF, type ? TREE_TYPE (type) : NULL_TREE,
1097 array_expr, index_exp);
1099 if (type == NULL_TREE)
1101 /* Something has gone very wrong. Assume we are mistakenly reducing
1102 an expression instead of a declaration. */
1103 error ("parser may be lost: is there a '{' missing somewhere?");
1107 if (TREE_CODE (type) == OFFSET_TYPE
1108 || TREE_CODE (type) == REFERENCE_TYPE)
1109 type = TREE_TYPE (type);
1111 /* If they have an `operator[]', use that. */
1112 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
1113 return build_opfncall (ARRAY_REF, LOOKUP_NORMAL,
1114 array_expr, index_exp, NULL_TREE);
1116 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1117 is a little-known fact that, if `a' is an array and `i' is an
1118 int, you can write `i[a]', which means the same thing as `a[i]'. */
1120 if (TREE_CODE (type) == ARRAY_TYPE)
1123 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, 0);
1125 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
1128 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, 0);
1130 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr, 0);
1131 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp, 0);
1133 if ((p1 && i2) && (i1 && p2))
1134 error ("ambiguous conversion for array subscript");
1137 array_expr = p1, index_exp = i2;
1139 array_expr = p2, index_exp = i1;
1142 cp_error ("invalid types `%T[%T]' for array subscript",
1143 type, TREE_TYPE (index_exp));
1144 return error_mark_node;
1147 if (array_expr == error_mark_node || index_exp == error_mark_node)
1148 error ("ambiguous conversion for array subscript");
1150 return build_array_ref (array_expr, index_exp);
1153 /* Given the cast expression EXP, checking out its validity. Either return
1154 an error_mark_node if there was an unavoidable error, return a cast to
1155 void for trying to delete a pointer w/ the value 0, or return the
1156 call to delete. If DOING_VEC is 1, we handle things differently
1157 for doing an array delete. If DOING_VEC is 2, they gave us the
1158 array size as an argument to delete.
1159 Implements ARM $5.3.4. This is called from the parser. */
1162 delete_sanity (exp, size, doing_vec, use_global_delete)
1164 int doing_vec, use_global_delete;
1167 /* For a regular vector delete (aka, no size argument) we will pass
1168 this down as a NULL_TREE into build_vec_delete. */
1169 tree maxindex = NULL_TREE;
1171 if (exp == error_mark_node)
1174 if (processing_template_decl)
1176 t = build_min (DELETE_EXPR, void_type_node, exp, size);
1177 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
1178 DELETE_EXPR_USE_VEC (t) = doing_vec;
1182 if (TREE_CODE (exp) == OFFSET_REF)
1183 exp = resolve_offset_ref (exp);
1184 exp = convert_from_reference (exp);
1185 t = stabilize_reference (exp);
1186 t = build_expr_type_conversion (WANT_POINTER, t, 1);
1188 if (t == NULL_TREE || t == error_mark_node)
1190 cp_error ("type `%#T' argument given to `delete', expected pointer",
1192 return error_mark_node;
1197 maxindex = build_binary_op (MINUS_EXPR, size, integer_one_node);
1198 pedwarn ("anachronistic use of array size in vector delete");
1201 type = TREE_TYPE (t);
1203 /* As of Valley Forge, you can delete a pointer to const. */
1205 /* You can't delete functions. */
1206 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
1208 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
1209 return error_mark_node;
1212 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1213 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
1214 cp_warning ("`%T' is not a pointer-to-object type", type);
1216 /* An array can't have been allocated by new, so complain. */
1217 if (TREE_CODE (t) == ADDR_EXPR
1218 && TREE_CODE (TREE_OPERAND (t, 0)) == VAR_DECL
1219 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == ARRAY_TYPE)
1220 cp_warning ("deleting array `%#D'", TREE_OPERAND (t, 0));
1222 /* Deleting a pointer with the value zero is valid and has no effect. */
1223 if (integer_zerop (t))
1224 return build1 (NOP_EXPR, void_type_node, t);
1227 return build_vec_delete (t, maxindex, integer_one_node, use_global_delete);
1230 if (IS_AGGR_TYPE (TREE_TYPE (type))
1231 && TYPE_GETS_REG_DELETE (TREE_TYPE (type)))
1233 /* Only do access checking here; we'll be calling op delete
1234 from the destructor. */
1235 tree tmp = build_op_delete_call (DELETE_EXPR, t, size_zero_node,
1236 LOOKUP_NORMAL, NULL_TREE);
1237 if (tmp == error_mark_node)
1238 return error_mark_node;
1241 return build_delete (type, t, integer_three_node,
1242 LOOKUP_NORMAL, use_global_delete);
1246 /* Report an error if the indicated template declaration is not the
1247 sort of thing that should be a member template. */
1250 check_member_template (tmpl)
1255 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
1256 decl = DECL_TEMPLATE_RESULT (tmpl);
1258 if (TREE_CODE (decl) == FUNCTION_DECL
1259 || (TREE_CODE (decl) == TYPE_DECL
1260 && IS_AGGR_TYPE (TREE_TYPE (decl))))
1262 if (current_function_decl)
1263 /* 14.5.2.2 [temp.mem]
1265 A local class shall not have member templates. */
1266 cp_error ("invalid declaration of member template `%#D' in local class",
1269 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
1271 /* 14.5.2.3 [temp.mem]
1273 A member function template shall not be virtual. */
1275 ("invalid use of `virtual' in template declaration of `%#D'",
1277 DECL_VIRTUAL_P (decl) = 0;
1280 /* The debug-information generating code doesn't know what to do
1281 with member templates. */
1282 DECL_IGNORED_P (tmpl) = 1;
1285 cp_error ("template declaration of `%#D'", decl);
1288 /* Return true iff TYPE is a valid Java parameter or return type. */
1291 acceptable_java_type (type)
1294 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
1296 if (TREE_CODE (type) == POINTER_TYPE)
1298 type = TREE_TYPE (type);
1299 if (TREE_CODE (type) == RECORD_TYPE)
1302 if (! TYPE_FOR_JAVA (type))
1304 if (! CLASSTYPE_TEMPLATE_INFO (type))
1306 args = CLASSTYPE_TI_ARGS (type);
1307 i = TREE_VEC_LENGTH (args);
1310 type = TREE_VEC_ELT (args, i);
1311 if (TREE_CODE (type) == POINTER_TYPE)
1312 type = TREE_TYPE (type);
1313 if (! TYPE_FOR_JAVA (type))
1322 /* For a METHOD in a Java class CTYPE, return 1 if
1323 the parameter and return types are valid Java types.
1324 Otherwise, print appropriate error messages, and return 0. */
1327 check_java_method (method)
1331 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
1332 tree ret_type = TREE_TYPE (TREE_TYPE (method));
1333 if (! acceptable_java_type (ret_type))
1335 cp_error ("Java method '%D' has non-Java return type `%T'",
1339 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
1341 tree type = TREE_VALUE (arg_types);
1342 if (! acceptable_java_type (type))
1344 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1349 return jerr ? 0 : 1;
1352 /* Sanity check: report error if this function FUNCTION is not
1353 really a member of the class (CTYPE) it is supposed to belong to.
1354 CNAME is the same here as it is for grokclassfn above. */
1357 check_classfn (ctype, function)
1358 tree ctype, function;
1360 tree fn_name = DECL_NAME (function);
1361 tree fndecl, fndecls;
1362 tree method_vec = CLASSTYPE_METHOD_VEC (complete_type (ctype));
1366 if (DECL_USE_TEMPLATE (function)
1367 && !(TREE_CODE (function) == TEMPLATE_DECL
1368 && DECL_TEMPLATE_SPECIALIZATION (function))
1369 && is_member_template (DECL_TI_TEMPLATE (function)))
1370 /* Since this is a specialization of a member template,
1371 we're not going to find the declaration in the class.
1374 struct S { template <typename T> void f(T); };
1375 template <> void S::f(int);
1377 we're not going to find `S::f(int)', but there's no
1378 reason we should, either. We let our callers know we didn't
1379 find the method, but we don't complain. */
1382 if (method_vec != 0)
1384 methods = &TREE_VEC_ELT (method_vec, 0);
1385 end = TREE_VEC_END (method_vec);
1387 /* First suss out ctors and dtors. */
1388 if (*methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1389 && DECL_CONSTRUCTOR_P (function))
1391 if (*++methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1392 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function)))
1395 while (++methods != end && *methods)
1398 if (fn_name == DECL_NAME (OVL_CURRENT (*methods)))
1401 for (fndecls = *methods; fndecls != NULL_TREE;
1402 fndecls = OVL_NEXT (fndecls))
1404 fndecl = OVL_CURRENT (fndecls);
1405 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1406 for a for member function of a template class, is
1407 not mangled, so the check below does not work
1408 correctly in that case. Since mangled destructor
1409 names do not include the type of the arguments,
1410 we can't use this short-cut for them, either.
1411 (It's not legal to declare arguments for a
1412 destructor, but some people try.) */
1413 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function))
1414 && (DECL_ASSEMBLER_NAME (function)
1415 != DECL_NAME (function))
1416 && (DECL_ASSEMBLER_NAME (fndecl)
1417 != DECL_NAME (fndecl))
1418 && (DECL_ASSEMBLER_NAME (function)
1419 == DECL_ASSEMBLER_NAME (fndecl)))
1422 /* We cannot simply call decls_match because this
1423 doesn't work for static member functions that are
1424 pretending to be methods, and because the name
1425 may have been changed by asm("new_name"). */
1426 if (DECL_NAME (function) == DECL_NAME (fndecl))
1428 tree p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
1429 tree p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1431 /* Get rid of the this parameter on functions that become
1433 if (DECL_STATIC_FUNCTION_P (fndecl)
1434 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1435 p1 = TREE_CHAIN (p1);
1437 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
1438 TREE_TYPE (TREE_TYPE (fndecl)))
1439 && compparms (p1, p2)
1440 && (DECL_TEMPLATE_SPECIALIZATION (function)
1441 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
1442 && (!DECL_TEMPLATE_SPECIALIZATION (function)
1443 || (DECL_TI_TEMPLATE (function)
1444 == DECL_TI_TEMPLATE (fndecl))))
1453 if (methods != end && *methods)
1455 tree fndecl = *methods;
1456 cp_error ("prototype for `%#D' does not match any in class `%T'",
1458 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl) ? "s are" : " is",
1459 OVL_CURRENT (fndecl));
1460 while (fndecl = OVL_NEXT (fndecl), fndecl)
1461 cp_error_at (" %#D", OVL_CURRENT(fndecl));
1466 if (!COMPLETE_TYPE_P (ctype))
1467 incomplete_type_error (function, ctype);
1469 cp_error ("no `%#D' member function declared in class `%T'",
1473 /* If we did not find the method in the class, add it to avoid
1474 spurious errors (unless the CTYPE is not yet defined, in which
1475 case we'll only confuse ourselves when the function is declared
1476 properly within the class. */
1477 if (COMPLETE_TYPE_P (ctype))
1478 add_method (ctype, methods, function);
1482 /* We have just processed the DECL, which is a static data member.
1483 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1484 present, is the assembly-language name for the data member.
1485 FLAGS is as for cp_finish_decl. */
1488 finish_static_data_member_decl (decl, init, asmspec_tree, flags)
1494 const char *asmspec = 0;
1497 asmspec = TREE_STRING_POINTER (asmspec_tree);
1499 my_friendly_assert (TREE_PUBLIC (decl), 0);
1501 /* We cannot call pushdecl here, because that would fill in the
1502 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1503 the right thing, namely, to put this decl out straight away. */
1504 /* current_class_type can be NULL_TREE in case of error. */
1505 if (!asmspec && current_class_type)
1507 DECL_INITIAL (decl) = error_mark_node;
1508 DECL_ASSEMBLER_NAME (decl)
1509 = build_static_name (current_class_type, DECL_NAME (decl));
1511 if (! processing_template_decl)
1513 if (!pending_statics)
1514 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
1515 VARRAY_PUSH_TREE (pending_statics, decl);
1518 /* Static consts need not be initialized in the class definition. */
1519 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
1521 static int explanation = 0;
1523 error ("initializer invalid for static member with constructor");
1524 if (explanation++ == 0)
1525 error ("(you really want to initialize it separately)");
1528 /* Force the compiler to know when an uninitialized static const
1529 member is being used. */
1530 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
1531 TREE_USED (decl) = 1;
1532 DECL_INITIAL (decl) = init;
1533 DECL_IN_AGGR_P (decl) = 1;
1534 DECL_CONTEXT (decl) = current_class_type;
1536 cp_finish_decl (decl, init, asmspec_tree, flags);
1539 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1540 of a structure component, returning a FIELD_DECL node.
1541 QUALS is a list of type qualifiers for this decl (such as for declaring
1542 const member functions).
1544 This is done during the parsing of the struct declaration.
1545 The FIELD_DECL nodes are chained together and the lot of them
1546 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1550 If class A defines that certain functions in class B are friends, then
1551 the way I have set things up, it is B who is interested in permission
1552 granted by A. However, it is in A's context that these declarations
1553 are parsed. By returning a void_type_node, class A does not attempt
1554 to incorporate the declarations of the friends within its structure.
1556 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1557 CHANGES TO CODE IN `start_method'. */
1560 grokfield (declarator, declspecs, init, asmspec_tree, attrlist)
1561 tree declarator, declspecs, init, asmspec_tree, attrlist;
1563 register tree value;
1564 const char *asmspec = 0;
1565 int flags = LOOKUP_ONLYCONVERTING;
1567 /* Convert () initializers to = initializers. */
1568 if (init == NULL_TREE && declarator != NULL_TREE
1569 && TREE_CODE (declarator) == CALL_EXPR
1570 && TREE_OPERAND (declarator, 0)
1571 && (TREE_CODE (TREE_OPERAND (declarator, 0)) == IDENTIFIER_NODE
1572 || TREE_CODE (TREE_OPERAND (declarator, 0)) == SCOPE_REF)
1573 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator)))
1575 init = TREE_OPERAND (declarator, 1);
1576 declarator = TREE_OPERAND (declarator, 0);
1580 if (declspecs == NULL_TREE
1581 && TREE_CODE (declarator) == SCOPE_REF
1582 && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
1584 /* Access declaration */
1585 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
1587 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
1588 pop_nested_class ();
1589 return do_class_using_decl (declarator);
1593 && TREE_CODE (init) == TREE_LIST
1594 && TREE_VALUE (init) == error_mark_node
1595 && TREE_CHAIN (init) == NULL_TREE)
1598 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, attrlist);
1599 if (! value || value == error_mark_node)
1600 /* friend or constructor went bad. */
1602 if (TREE_TYPE (value) == error_mark_node)
1603 return error_mark_node;
1605 /* Pass friendly classes back. */
1606 if (TREE_CODE (value) == VOID_TYPE)
1607 return void_type_node;
1609 if (DECL_NAME (value) != NULL_TREE
1610 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
1611 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
1612 cp_error ("member `%D' conflicts with virtual function table field name",
1615 /* Stash away type declarations. */
1616 if (TREE_CODE (value) == TYPE_DECL)
1618 DECL_NONLOCAL (value) = 1;
1619 DECL_CONTEXT (value) = current_class_type;
1621 /* Now that we've updated the context, we need to remangle the
1622 name for this TYPE_DECL. */
1623 DECL_ASSEMBLER_NAME (value) = DECL_NAME (value);
1624 if (!uses_template_parms (value))
1625 DECL_ASSEMBLER_NAME (value) =
1626 get_identifier (build_overload_name (TREE_TYPE (value), 1, 1));
1628 if (processing_template_decl)
1629 value = push_template_decl (value);
1634 if (DECL_IN_AGGR_P (value))
1636 cp_error ("`%D' is already defined in `%T'", value,
1637 DECL_CONTEXT (value));
1638 return void_type_node;
1642 asmspec = TREE_STRING_POINTER (asmspec_tree);
1646 if (TREE_CODE (value) == FUNCTION_DECL)
1648 grok_function_init (value, init);
1651 else if (pedantic && TREE_CODE (value) != VAR_DECL)
1652 /* Already complained in grokdeclarator. */
1656 /* We allow initializers to become parameters to base
1658 if (TREE_CODE (init) == TREE_LIST)
1660 if (TREE_CHAIN (init) == NULL_TREE)
1661 init = TREE_VALUE (init);
1663 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1666 if (TREE_CODE (init) == CONST_DECL)
1667 init = DECL_INITIAL (init);
1668 else if (TREE_READONLY_DECL_P (init))
1669 init = decl_constant_value (init);
1670 else if (TREE_CODE (init) == CONSTRUCTOR)
1671 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1672 if (init == error_mark_node)
1673 /* We must make this look different than `error_mark_node'
1674 because `decl_const_value' would mis-interpret it
1675 as only meaning that this VAR_DECL is defined. */
1676 init = build1 (NOP_EXPR, TREE_TYPE (value), init);
1677 else if (processing_template_decl)
1679 else if (! TREE_CONSTANT (init))
1681 /* We can allow references to things that are effectively
1682 static, since references are initialized with the address. */
1683 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
1684 || (TREE_STATIC (init) == 0
1685 && (!DECL_P (init) || DECL_EXTERNAL (init) == 0)))
1687 error ("field initializer is not constant");
1688 init = error_mark_node;
1694 if (processing_template_decl && ! current_function_decl
1695 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
1696 value = push_template_decl (value);
1699 cplus_decl_attributes (value, TREE_PURPOSE (attrlist),
1700 TREE_VALUE (attrlist));
1702 if (TREE_CODE (value) == VAR_DECL)
1704 finish_static_data_member_decl (value, init, asmspec_tree,
1708 if (TREE_CODE (value) == FIELD_DECL)
1712 /* This must override the asm specifier which was placed
1713 by grokclassfn. Lay this out fresh. */
1714 DECL_RTL (value) = NULL_RTX;
1715 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1717 if (DECL_INITIAL (value) == error_mark_node)
1718 init = error_mark_node;
1719 cp_finish_decl (value, init, asmspec_tree, flags);
1720 DECL_INITIAL (value) = init;
1721 DECL_IN_AGGR_P (value) = 1;
1724 if (TREE_CODE (value) == FUNCTION_DECL)
1728 /* This must override the asm specifier which was placed
1729 by grokclassfn. Lay this out fresh. */
1730 DECL_RTL (value) = NULL_RTX;
1731 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1733 cp_finish_decl (value, init, asmspec_tree, flags);
1735 /* Pass friends back this way. */
1736 if (DECL_FRIEND_P (value))
1737 return void_type_node;
1739 DECL_IN_AGGR_P (value) = 1;
1742 my_friendly_abort (21);
1747 /* Like `grokfield', but for bitfields.
1748 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1751 grokbitfield (declarator, declspecs, width)
1752 tree declarator, declspecs, width;
1754 register tree value = grokdeclarator (declarator, declspecs, BITFIELD,
1757 if (! value) return NULL_TREE; /* friends went bad. */
1759 /* Pass friendly classes back. */
1760 if (TREE_CODE (value) == VOID_TYPE)
1761 return void_type_node;
1763 if (TREE_CODE (value) == TYPE_DECL)
1765 cp_error ("cannot declare `%D' to be a bitfield type", value);
1769 /* Usually, finish_struct_1 catches bitifields with invalid types.
1770 But, in the case of bitfields with function type, we confuse
1771 ourselves into thinking they are member functions, so we must
1773 if (TREE_CODE (value) == FUNCTION_DECL)
1775 cp_error ("cannot declare bitfield `%D' with funcion type",
1780 if (DECL_IN_AGGR_P (value))
1782 cp_error ("`%D' is already defined in the class %T", value,
1783 DECL_CONTEXT (value));
1784 return void_type_node;
1787 GNU_xref_member (current_class_name, value);
1789 if (TREE_STATIC (value))
1791 cp_error ("static member `%D' cannot be a bitfield", value);
1794 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1796 if (width != error_mark_node)
1798 constant_expression_warning (width);
1799 DECL_INITIAL (value) = width;
1800 SET_DECL_C_BIT_FIELD (value);
1803 DECL_IN_AGGR_P (value) = 1;
1808 grokoptypename (declspecs, declarator)
1809 tree declspecs, declarator;
1811 tree t = grokdeclarator (declarator, declspecs, TYPENAME, 0, NULL_TREE);
1812 return build_typename_overload (t);
1815 /* When a function is declared with an initializer,
1816 do the right thing. Currently, there are two possibilities:
1821 // initialization possibility #1.
1822 virtual void f () = 0;
1844 // initialization possibility #2
1851 copy_assignment_arg_p (parmtype, virtualp)
1853 int virtualp ATTRIBUTE_UNUSED;
1855 if (current_class_type == NULL_TREE)
1858 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
1859 parmtype = TREE_TYPE (parmtype);
1861 if ((TYPE_MAIN_VARIANT (parmtype) == current_class_type)
1863 /* Non-standard hack to support old Booch components. */
1864 || (! virtualp && DERIVED_FROM_P (parmtype, current_class_type))
1873 grok_function_init (decl, init)
1877 /* An initializer for a function tells how this function should
1879 tree type = TREE_TYPE (decl);
1881 if (TREE_CODE (type) == FUNCTION_TYPE)
1882 cp_error ("initializer specified for non-member function `%D'", decl);
1884 /* We'll check for this in finish_struct_1. */
1885 else if (DECL_VINDEX (decl) == NULL_TREE)
1886 cp_error ("initializer specified for non-virtual member function `%D'", decl);
1888 else if (integer_zerop (init))
1891 /* Mark this function as being "defined". */
1892 DECL_INITIAL (decl) = error_mark_node;
1893 /* pure virtual destructors must be defined. */
1894 /* pure virtual needs to be defined (as abort) only when put in
1895 vtbl. For wellformed call, it should be itself. pr4737 */
1896 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl)))
1898 /* Give this node rtl from `abort'. */
1899 DECL_RTL (decl) = DECL_RTL (abort_fndecl);
1902 DECL_PURE_VIRTUAL_P (decl) = 1;
1903 if (DECL_NAME (decl) == ansi_opname [(int) MODIFY_EXPR])
1906 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl))));
1908 if (copy_assignment_arg_p (parmtype, 1))
1909 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type) = 1;
1913 cp_error ("invalid initializer for virtual method `%D'", decl);
1917 cplus_decl_attributes (decl, attributes, prefix_attributes)
1918 tree decl, attributes, prefix_attributes;
1920 if (decl == NULL_TREE || decl == void_type_node)
1923 if (TREE_CODE (decl) == TEMPLATE_DECL)
1924 decl = DECL_TEMPLATE_RESULT (decl);
1926 decl_attributes (decl, attributes, prefix_attributes);
1928 if (TREE_CODE (decl) == TYPE_DECL)
1929 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl), TREE_TYPE (decl));
1932 /* CONSTRUCTOR_NAME:
1933 Return the name for the constructor (or destructor) for the
1934 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1935 IDENTIFIER_NODE. When given a template, this routine doesn't
1936 lose the specialization. */
1939 constructor_name_full (thing)
1942 if (TREE_CODE (thing) == TEMPLATE_TYPE_PARM
1943 || TREE_CODE (thing) == TEMPLATE_TEMPLATE_PARM
1944 || TREE_CODE (thing) == TYPENAME_TYPE)
1945 thing = TYPE_NAME (thing);
1946 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing)))
1948 if (TYPE_WAS_ANONYMOUS (thing) && TYPE_HAS_CONSTRUCTOR (thing))
1949 thing = DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing), 0)));
1951 thing = TYPE_NAME (thing);
1953 if (TREE_CODE (thing) == TYPE_DECL
1954 || (TREE_CODE (thing) == TEMPLATE_DECL
1955 && TREE_CODE (DECL_TEMPLATE_RESULT (thing)) == TYPE_DECL))
1956 thing = DECL_NAME (thing);
1957 my_friendly_assert (TREE_CODE (thing) == IDENTIFIER_NODE, 197);
1961 /* CONSTRUCTOR_NAME:
1962 Return the name for the constructor (or destructor) for the
1963 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1964 IDENTIFIER_NODE. When given a template, return the plain
1965 unspecialized name. */
1968 constructor_name (thing)
1972 thing = constructor_name_full (thing);
1973 t = IDENTIFIER_TEMPLATE (thing);
1979 /* Defer the compilation of the FN until the end of compilation. */
1985 fn = DECL_MAIN_VARIANT (fn);
1986 if (DECL_DEFERRED_FN (fn))
1988 DECL_DEFERRED_FN (fn) = 1;
1990 VARRAY_TREE_INIT (deferred_fns, 32, "deferred_fns");
1992 VARRAY_PUSH_TREE (deferred_fns, fn);
1995 /* Hand off a unique name which can be used for variable we don't really
1996 want to know about anyway, for example, the anonymous variables which
1997 are needed to make references work. Declare this thing so we can use it.
1998 The variable created will be of type TYPE.
2000 STATICP is nonzero if this variable should be static. */
2003 get_temp_name (type, staticp)
2007 char buf[sizeof (AUTO_TEMP_FORMAT) + 20];
2009 int toplev = toplevel_bindings_p ();
2011 if (toplev || staticp)
2013 sprintf (buf, AUTO_TEMP_FORMAT, global_temp_name_counter++);
2014 decl = pushdecl_top_level (build_decl (VAR_DECL, get_identifier (buf), type));
2018 sprintf (buf, AUTO_TEMP_FORMAT, temp_name_counter++);
2019 decl = pushdecl (build_decl (VAR_DECL, get_identifier (buf), type));
2021 TREE_USED (decl) = 1;
2022 TREE_STATIC (decl) = staticp;
2023 DECL_ARTIFICIAL (decl) = 1;
2025 /* If this is a local variable, then lay out its rtl now.
2026 Otherwise, callers of this function are responsible for dealing
2027 with this variable's rtl. */
2031 my_friendly_assert (DECL_INITIAL (decl) == NULL_TREE,
2038 /* Hunts through the global anonymous union ANON_DECL, building
2039 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2040 returns a VAR_DECL whose size is the same as the size of the
2041 ANON_DECL, if one is available. */
2044 build_anon_union_vars (anon_decl, elems, static_p, external_p)
2050 tree type = TREE_TYPE (anon_decl);
2051 tree main_decl = NULL_TREE;
2054 /* Rather than write the code to handle the non-union case,
2055 just give an error. */
2056 if (TREE_CODE (type) != UNION_TYPE)
2057 error ("anonymous struct not inside named type");
2059 for (field = TYPE_FIELDS (type);
2061 field = TREE_CHAIN (field))
2065 if (DECL_ARTIFICIAL (field))
2067 if (TREE_CODE (field) != FIELD_DECL)
2069 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2074 if (TREE_PRIVATE (field))
2075 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
2076 else if (TREE_PROTECTED (field))
2077 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
2079 if (DECL_NAME (field) == NULL_TREE
2080 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2082 decl = build_anon_union_vars (field, elems, static_p, external_p);
2086 else if (DECL_NAME (field) == NULL_TREE)
2090 decl = build_decl (VAR_DECL, DECL_NAME (field), TREE_TYPE (field));
2091 /* tell `pushdecl' that this is not tentative. */
2092 DECL_INITIAL (decl) = error_mark_node;
2093 TREE_PUBLIC (decl) = 0;
2094 TREE_STATIC (decl) = static_p;
2095 DECL_EXTERNAL (decl) = external_p;
2096 decl = pushdecl (decl);
2097 DECL_INITIAL (decl) = NULL_TREE;
2100 /* Only write out one anon union element--choose the one that
2101 can hold them all. */
2102 if (main_decl == NULL_TREE
2103 && simple_cst_equal (DECL_SIZE (decl),
2104 DECL_SIZE (anon_decl)) == 1)
2107 /* ??? This causes there to be no debug info written out
2109 TREE_ASM_WRITTEN (decl) = 1;
2111 if (DECL_NAME (field) == NULL_TREE
2112 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2113 /* The remainder of the processing was already done in the
2117 /* If there's a cleanup to do, it belongs in the
2118 TREE_PURPOSE of the following TREE_LIST. */
2119 *elems = tree_cons (NULL_TREE, decl, *elems);
2120 TREE_TYPE (*elems) = type;
2126 /* Finish off the processing of a UNION_TYPE structure.
2127 If there are static members, then all members are
2128 static, and must be laid out together. If the
2129 union is an anonymous union, we arrange for that
2130 as well. PUBLIC_P is nonzero if this union is
2131 not declared static. */
2134 finish_anon_union (anon_union_decl)
2135 tree anon_union_decl;
2137 tree type = TREE_TYPE (anon_union_decl);
2139 int public_p = TREE_PUBLIC (anon_union_decl);
2140 int static_p = TREE_STATIC (anon_union_decl);
2141 int external_p = DECL_EXTERNAL (anon_union_decl);
2143 if (TYPE_FIELDS (type) == NULL_TREE)
2148 error ("global anonymous unions must be declared static");
2152 main_decl = build_anon_union_vars (anon_union_decl,
2153 &DECL_ANON_UNION_ELEMS (anon_union_decl),
2154 static_p, external_p);
2156 if (main_decl == NULL_TREE)
2158 warning ("anonymous union with no members");
2164 make_decl_rtl (main_decl, 0, toplevel_bindings_p ());
2165 DECL_RTL (anon_union_decl) = DECL_RTL (main_decl);
2166 expand_anon_union_decl (anon_union_decl,
2168 DECL_ANON_UNION_ELEMS (anon_union_decl));
2171 add_decl_stmt (anon_union_decl);
2174 /* Finish processing a builtin type TYPE. It's name is NAME,
2175 its fields are in the array FIELDS. LEN is the number of elements
2176 in FIELDS minus one, or put another way, it is the maximum subscript
2179 It is given the same alignment as ALIGN_TYPE. */
2182 finish_builtin_type (type, name, fields, len, align_type)
2191 TYPE_FIELDS (type) = fields[0];
2192 for (i = 0; i < len; i++)
2194 layout_type (TREE_TYPE (fields[i]));
2195 DECL_FIELD_CONTEXT (fields[i]) = type;
2196 TREE_CHAIN (fields[i]) = fields[i+1];
2198 DECL_FIELD_CONTEXT (fields[i]) = type;
2199 TYPE_ALIGN (type) = TYPE_ALIGN (align_type);
2201 #if 0 /* not yet, should get fixed properly later */
2202 TYPE_NAME (type) = make_type_decl (get_identifier (name), type);
2204 TYPE_NAME (type) = build_decl (TYPE_DECL, get_identifier (name), type);
2206 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2207 layout_decl (TYPE_NAME (type), 0);
2210 /* Auxiliary functions to make type signatures for
2211 `operator new' and `operator delete' correspond to
2212 what compiler will be expecting. */
2215 coerce_new_type (type)
2220 if (TREE_CODE (type) == METHOD_TYPE)
2221 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (TYPE_ARG_TYPES (type)));
2222 if (! same_type_p (TREE_TYPE (type), ptr_type_node))
2223 e1 = 1, error ("`operator new' must return type `void *'");
2225 /* Technically the type must be `size_t', but we may not know
2227 if (TYPE_ARG_TYPES (type) == NULL_TREE)
2228 e1 = 1, error ("`operator new' takes type `size_t' parameter");
2229 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type)), sizetype))
2230 e2 = 1, error ("`operator new' takes type `size_t' as first parameter");
2232 type = build_function_type (ptr_type_node, tree_cons (NULL_TREE, sizetype, TREE_CHAIN (TYPE_ARG_TYPES (type))));
2234 type = build_function_type (ptr_type_node, TYPE_ARG_TYPES (type));
2239 coerce_delete_type (type)
2246 tree arg_types = TYPE_ARG_TYPES (type);
2248 if (TREE_CODE (type) == METHOD_TYPE)
2250 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (arg_types));
2251 arg_types = TREE_CHAIN (arg_types);
2254 if (TREE_TYPE (type) != void_type_node)
2255 e1 = 1, error ("`operator delete' must return type `void'");
2257 if (arg_types == NULL_TREE
2258 || ! same_type_p (TREE_VALUE (arg_types), ptr_type_node))
2259 e2 = 1, error ("`operator delete' takes type `void *' as first parameter");
2263 && TREE_CHAIN (arg_types)
2264 && TREE_CHAIN (arg_types) != void_list_node)
2266 /* Again, technically this argument must be `size_t', but again
2267 we may not know what that is. */
2268 tree t2 = TREE_VALUE (TREE_CHAIN (arg_types));
2269 if (! same_type_p (t2, sizetype))
2270 e3 = 1, error ("second argument to `operator delete' must be of type `size_t'");
2271 else if (TREE_CHAIN (TREE_CHAIN (arg_types)) != void_list_node)
2274 if (TREE_CHAIN (TREE_CHAIN (arg_types)))
2275 error ("too many arguments in declaration of `operator delete'");
2277 error ("`...' invalid in specification of `operator delete'");
2282 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2283 build_tree_list (NULL_TREE, sizetype));
2286 if (arg_types == NULL_TREE)
2287 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
2289 arg_types = tree_cons (NULL_TREE, ptr_type_node, TREE_CHAIN (arg_types));
2295 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2296 arg_types ? TREE_CHAIN (arg_types): NULL_TREE);
2298 type = build_function_type (void_type_node, arg_types);
2304 mark_vtable_entries (decl)
2307 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
2309 for (; entries; entries = TREE_CHAIN (entries))
2314 fnaddr = (flag_vtable_thunks ? TREE_VALUE (entries)
2315 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries)));
2317 if (TREE_CODE (fnaddr) != ADDR_EXPR)
2318 /* This entry is an offset: a virtual base class offset, a
2319 virtual call offset, and RTTI offset, etc. */
2322 fn = TREE_OPERAND (fnaddr, 0);
2323 TREE_ADDRESSABLE (fn) = 1;
2324 if (TREE_CODE (fn) == THUNK_DECL && DECL_EXTERNAL (fn))
2326 DECL_EXTERNAL (fn) = 0;
2333 /* Set DECL up to have the closest approximation of "initialized common"
2334 linkage available. */
2337 comdat_linkage (decl)
2341 make_decl_one_only (decl);
2342 else if (TREE_CODE (decl) == FUNCTION_DECL || DECL_VIRTUAL_P (decl))
2343 /* We can just emit functions and vtables statically; it doesn't really
2344 matter if we have multiple copies. */
2345 TREE_PUBLIC (decl) = 0;
2348 /* Static data member template instantiations, however, cannot
2349 have multiple copies. */
2350 if (DECL_INITIAL (decl) == 0
2351 || DECL_INITIAL (decl) == error_mark_node)
2352 DECL_COMMON (decl) = 1;
2353 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
2355 DECL_COMMON (decl) = 1;
2356 DECL_INITIAL (decl) = error_mark_node;
2360 /* We can't do anything useful; leave vars for explicit
2362 DECL_EXTERNAL (decl) = 1;
2363 DECL_NOT_REALLY_EXTERN (decl) = 0;
2367 if (DECL_LANG_SPECIFIC (decl))
2368 DECL_COMDAT (decl) = 1;
2371 /* For win32 we also want to put explicit instantiations in
2372 linkonce sections, so that they will be merged with implicit
2373 instantiations; otherwise we get duplicate symbol errors. */
2376 maybe_make_one_only (decl)
2379 /* We used to say that this was not necessary on targets that support weak
2380 symbols, because the implicit instantiations will defer to the explicit
2381 one. However, that's not actually the case in SVR4; a strong definition
2382 after a weak one is an error. Also, not making explicit
2383 instantiations one_only means that we can end up with two copies of
2384 some template instantiations. */
2385 if (! supports_one_only ())
2388 /* We can't set DECL_COMDAT on functions, or finish_file will think
2389 we can get away with not emitting them if they aren't used. We need
2390 to for variables so that cp_finish_decl will update their linkage,
2391 because their DECL_INITIAL may not have been set properly yet. */
2393 make_decl_one_only (decl);
2395 if (TREE_CODE (decl) == VAR_DECL && DECL_LANG_SPECIFIC (decl))
2396 DECL_COMDAT (decl) = 1;
2399 /* Returns the virtual function with which the vtable for TYPE is
2400 emitted, or NULL_TREE if that heuristic is not applicable to TYPE. */
2408 if (TYPE_FOR_JAVA (type)
2409 || CLASSTYPE_INTERFACE_KNOWN (type))
2412 for (method = TYPE_METHODS (type); method != NULL_TREE;
2413 method = TREE_CHAIN (method))
2414 if (DECL_VINDEX (method) != NULL_TREE
2415 && ! DECL_THIS_INLINE (method)
2416 && ! DECL_PURE_VIRTUAL_P (method))
2422 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2423 based on TYPE and other static flags.
2425 Note that anything public is tagged TREE_PUBLIC, whether
2426 it's public in this file or in another one. */
2429 import_export_vtable (decl, type, final)
2433 if (DECL_INTERFACE_KNOWN (decl))
2436 if (TYPE_FOR_JAVA (type))
2438 TREE_PUBLIC (decl) = 1;
2439 DECL_EXTERNAL (decl) = 1;
2440 DECL_INTERFACE_KNOWN (decl) = 1;
2442 else if (CLASSTYPE_INTERFACE_KNOWN (type))
2444 TREE_PUBLIC (decl) = 1;
2445 DECL_EXTERNAL (decl) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type);
2446 DECL_INTERFACE_KNOWN (decl) = 1;
2450 /* We can only wait to decide if we have real non-inline virtual
2451 functions in our class, or if we come from a template. */
2453 int found = (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
2454 || key_method (type));
2456 if (final || ! found)
2458 comdat_linkage (decl);
2459 DECL_EXTERNAL (decl) = 0;
2463 TREE_PUBLIC (decl) = 1;
2464 DECL_EXTERNAL (decl) = 1;
2469 /* Determine whether or not we want to specifically import or export CTYPE,
2470 using various heuristics. */
2473 import_export_class (ctype)
2476 /* -1 for imported, 1 for exported. */
2477 int import_export = 0;
2479 /* It only makes sense to call this function at EOF. The reason is
2480 that this function looks at whether or not the first non-inline
2481 non-abstract virtual member function has been defined in this
2482 translation unit. But, we can't possibly know that until we've
2483 seen the entire translation unit. */
2484 my_friendly_assert (at_eof, 20000226);
2486 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
2489 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2490 we will have CLASSTYPE_INTERFACE_ONLY set but not
2491 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2492 heuristic because someone will supply a #pragma implementation
2493 elsewhere, and deducing it here would produce a conflict. */
2494 if (CLASSTYPE_INTERFACE_ONLY (ctype))
2497 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2498 /* FIXME this should really use some sort of target-independent macro. */
2499 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
2501 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
2505 /* If we got -fno-implicit-templates, we import template classes that
2506 weren't explicitly instantiated. */
2507 if (import_export == 0
2508 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
2509 && ! flag_implicit_templates)
2512 /* Base our import/export status on that of the first non-inline,
2513 non-pure virtual function, if any. */
2514 if (import_export == 0
2515 && TYPE_POLYMORPHIC_P (ctype)
2516 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
2518 tree method = key_method (ctype);
2520 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
2523 #ifdef MULTIPLE_SYMBOL_SPACES
2524 if (import_export == -1)
2530 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
2531 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype) = (import_export > 0);
2532 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
2536 /* We need to describe to the assembler the relationship between
2537 a vtable and the vtable of the parent class. */
2540 output_vtable_inherit (vars)
2546 op[0] = XEXP (DECL_RTL (vars), 0); /* strip the mem ref */
2548 parent = binfo_for_vtable (vars);
2550 if (parent == TYPE_BINFO (DECL_CONTEXT (vars)))
2554 parent = get_vtbl_decl_for_binfo (TYPE_BINFO (BINFO_TYPE (parent)));
2555 op[1] = XEXP (DECL_RTL (parent), 0); /* strip the mem ref */
2558 my_friendly_abort (980826);
2560 output_asm_insn (".vtable_inherit %c0, %c1", op);
2564 finish_vtable_vardecl (t, data)
2566 void *data ATTRIBUTE_UNUSED;
2569 tree ctype = DECL_CONTEXT (vars);
2570 import_export_class (ctype);
2571 import_export_vtable (vars, ctype, 1);
2573 if (! DECL_EXTERNAL (vars)
2574 && DECL_NEEDED_P (vars)
2575 && ! TREE_ASM_WRITTEN (vars))
2577 if (TREE_TYPE (vars) == void_type_node)
2578 /* It is a dummy vtable made by get_vtable_decl. Ignore it. */
2582 mark_vtable_entries (vars);
2583 if (TREE_TYPE (DECL_INITIAL (vars)) == 0)
2584 store_init_value (vars, DECL_INITIAL (vars));
2586 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
2588 /* Mark the VAR_DECL node representing the vtable itself as a
2589 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2590 It is rather important that such things be ignored because
2591 any effort to actually generate DWARF for them will run
2592 into trouble when/if we encounter code like:
2595 struct S { virtual void member (); };
2597 because the artificial declaration of the vtable itself (as
2598 manufactured by the g++ front end) will say that the vtable
2599 is a static member of `S' but only *after* the debug output
2600 for the definition of `S' has already been output. This causes
2601 grief because the DWARF entry for the definition of the vtable
2602 will try to refer back to an earlier *declaration* of the
2603 vtable as a static member of `S' and there won't be one.
2604 We might be able to arrange to have the "vtable static member"
2605 attached to the member list for `S' before the debug info for
2606 `S' get written (which would solve the problem) but that would
2607 require more intrusive changes to the g++ front end. */
2609 DECL_IGNORED_P (vars) = 1;
2612 /* Always make vtables weak. */
2614 comdat_linkage (vars);
2616 rest_of_decl_compilation (vars, NULL_PTR, 1, 1);
2619 output_vtable_inherit (vars);
2621 /* Because we're only doing syntax-checking, we'll never end up
2622 actually marking the variable as written. */
2623 if (flag_syntax_only)
2624 TREE_ASM_WRITTEN (vars) = 1;
2626 /* Since we're writing out the vtable here, also write the debug
2628 note_debug_info_needed (ctype);
2633 /* If the references to this class' vtables were optimized away, still
2634 emit the appropriate debugging information. See dfs_debug_mark. */
2635 if (DECL_COMDAT (vars)
2636 && CLASSTYPE_DEBUG_REQUESTED (ctype))
2637 note_debug_info_needed (ctype);
2643 prune_vtable_vardecl (t, data)
2645 void *data ATTRIBUTE_UNUSED;
2647 *t = TREE_CHAIN (*t);
2651 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2652 inline function or template instantiation at end-of-file. */
2655 import_export_decl (decl)
2658 if (DECL_INTERFACE_KNOWN (decl))
2661 if (DECL_TEMPLATE_INSTANTIATION (decl)
2662 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2664 DECL_NOT_REALLY_EXTERN (decl) = 1;
2665 if ((DECL_IMPLICIT_INSTANTIATION (decl)
2666 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2667 && (flag_implicit_templates
2668 || (flag_implicit_inline_templates && DECL_THIS_INLINE (decl))))
2670 if (!TREE_PUBLIC (decl))
2671 /* Templates are allowed to have internal linkage. See
2675 comdat_linkage (decl);
2678 DECL_NOT_REALLY_EXTERN (decl) = 0;
2680 else if (DECL_FUNCTION_MEMBER_P (decl))
2682 tree ctype = DECL_CONTEXT (decl);
2683 import_export_class (ctype);
2684 if (CLASSTYPE_INTERFACE_KNOWN (ctype)
2686 ? (! DECL_THIS_INLINE (decl))
2687 : (! DECL_ARTIFICIAL (decl) || DECL_VINDEX (decl))))
2689 DECL_NOT_REALLY_EXTERN (decl)
2690 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2691 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2692 && !DECL_VINDEX (decl)));
2694 /* Always make artificials weak. */
2695 if (DECL_ARTIFICIAL (decl) && flag_weak)
2696 comdat_linkage (decl);
2698 maybe_make_one_only (decl);
2701 comdat_linkage (decl);
2703 else if (DECL_TINFO_FN_P (decl))
2705 tree ctype = TREE_TYPE (DECL_NAME (decl));
2707 if (IS_AGGR_TYPE (ctype))
2708 import_export_class (ctype);
2710 if (IS_AGGR_TYPE (ctype) && CLASSTYPE_INTERFACE_KNOWN (ctype)
2711 && TYPE_POLYMORPHIC_P (ctype)
2712 /* If -fno-rtti, we're not necessarily emitting this stuff with
2713 the class, so go ahead and emit it now. This can happen
2714 when a class is used in exception handling. */
2716 /* If the type is a cv-qualified variant of a type, then we
2717 must emit the tinfo function in this translation unit
2718 since it will not be emitted when the vtable for the type
2719 is output (which is when the unqualified version is
2721 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2723 DECL_NOT_REALLY_EXTERN (decl)
2724 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2725 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2726 && !DECL_VINDEX (decl)));
2728 /* Always make artificials weak. */
2730 comdat_linkage (decl);
2732 else if (TYPE_BUILT_IN (ctype)
2733 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2734 DECL_NOT_REALLY_EXTERN (decl) = 0;
2736 comdat_linkage (decl);
2739 comdat_linkage (decl);
2741 DECL_INTERFACE_KNOWN (decl) = 1;
2745 build_cleanup (decl)
2749 tree type = TREE_TYPE (decl);
2751 if (TREE_CODE (type) == ARRAY_TYPE)
2755 mark_addressable (decl);
2756 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
2758 temp = build_delete (TREE_TYPE (temp), temp,
2760 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
2764 extern int parse_time, varconst_time;
2770 tree sname = get_id_2 ("__sn", base);
2771 /* For struct X foo __attribute__((weak)), there is a counter
2772 __snfoo. Since base is already an assembler name, sname should
2773 be globally unique */
2774 tree sentry = IDENTIFIER_GLOBAL_VALUE (sname);
2777 sentry = build_decl (VAR_DECL, sname, integer_type_node);
2778 TREE_PUBLIC (sentry) = 1;
2779 DECL_ARTIFICIAL (sentry) = 1;
2780 TREE_STATIC (sentry) = 1;
2781 TREE_USED (sentry) = 1;
2782 DECL_COMMON (sentry) = 1;
2783 pushdecl_top_level (sentry);
2784 cp_finish_decl (sentry, NULL_TREE, NULL_TREE, 0);
2789 /* Start the process of running a particular set of global constructors
2790 or destructors. Subroutine of do_[cd]tors. */
2793 start_objects (method_type, initp)
2794 int method_type, initp;
2800 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2802 if (initp != DEFAULT_INIT_PRIORITY)
2812 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
2815 sprintf (type, "%c", method_type);
2817 fnname = get_file_function_name_long (type);
2819 start_function (void_list_node,
2820 make_call_declarator (fnname, void_list_node, NULL_TREE,
2822 NULL_TREE, SF_DEFAULT);
2824 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2825 /* It can be a static function as long as collect2 does not have
2826 to scan the object file to find its ctor/dtor routine. */
2827 TREE_PUBLIC (current_function_decl) = 0;
2830 /* Mark this declaration as used to avoid spurious warnings. */
2831 TREE_USED (current_function_decl) = 1;
2833 /* Mark this function as a global constructor or destructor. */
2834 if (method_type == 'I')
2835 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
2837 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
2838 GLOBAL_INIT_PRIORITY (current_function_decl) = initp;
2840 body = begin_compound_stmt (/*has_no_scope=*/0);
2842 /* We cannot allow these functions to be elided, even if they do not
2843 have external linkage. And, there's no point in deferring
2844 copmilation of thes functions; they're all going to have to be
2846 current_function_cannot_inline
2847 = "static constructors and destructors cannot be inlined";
2852 /* Finish the process of running a particular set of global constructors
2853 or destructors. Subroutine of do_[cd]tors. */
2856 finish_objects (method_type, initp, body)
2857 int method_type, initp;
2864 finish_compound_stmt(/*has_no_scope=*/0, body);
2865 fn = finish_function (lineno, 0);
2868 /* When only doing semantic analysis, and no RTL generation, we
2869 can't call functions that directly emit assembly code; there is
2870 no assembly file in which to put the code. */
2871 if (flag_syntax_only)
2874 fnname = XSTR (XEXP (DECL_RTL (fn), 0), 0);
2875 if (initp == DEFAULT_INIT_PRIORITY)
2877 if (method_type == 'I')
2878 assemble_constructor (fnname);
2880 assemble_destructor (fnname);
2882 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2883 /* If we're using init priority we can't use assemble_*tor, but on ELF
2884 targets we can stick the references into named sections for GNU ld
2889 sprintf (buf, ".%ctors.%.5u", method_type == 'I' ? 'c' : 'd',
2890 /* invert the numbering so the linker puts us in the proper
2891 order; constructors are run from right to left, and the
2892 linker sorts in increasing order. */
2893 MAX_INIT_PRIORITY - initp);
2894 named_section (NULL_TREE, buf, 0);
2895 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, fnname),
2896 POINTER_SIZE / BITS_PER_UNIT, 1);
2901 /* The names of the parameters to the function created to handle
2902 initializations and destructions for objects with static storage
2904 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2905 #define PRIORITY_IDENTIFIER "__priority"
2907 /* The name of the function we create to handle initializations and
2908 destructions for objects with static storage duration. */
2909 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2911 /* The declaration for the __INITIALIZE_P argument. */
2912 static tree initialize_p_decl;
2914 /* The declaration for the __PRIORITY argument. */
2915 static tree priority_decl;
2917 /* The declaration for the static storage duration function. */
2918 static tree ssdf_decl;
2920 /* All the static storage duration functions created in this
2921 translation unit. */
2922 static varray_type ssdf_decls;
2924 /* A map from priority levels to information about that priority
2925 level. There may be many such levels, so efficient lookup is
2927 static splay_tree priority_info_map;
2929 /* Begins the generation of the function that will handle all
2930 initialization and destruction of objects with static storage
2931 duration. The function generated takes two parameters of type
2932 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2933 non-zero, it performs initializations. Otherwise, it performs
2934 destructions. It only performs those initializations or
2935 destructions with the indicated __PRIORITY. The generated function
2938 It is assumed that this function will only be called once per
2939 translation unit. */
2942 start_static_storage_duration_function ()
2944 static unsigned ssdf_number;
2949 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2951 /* Create the identifier for this function. It will be of the form
2952 SSDF_IDENTIFIER_<number>. */
2953 sprintf (id, "%s_%u", SSDF_IDENTIFIER, ssdf_number++);
2954 if (ssdf_number == 0)
2956 /* Overflow occurred. That means there are at least 4 billion
2957 initialization functions. */
2958 sorry ("too many initialization functions required");
2959 my_friendly_abort (19990430);
2962 /* Create the parameters. */
2963 parm_types = void_list_node;
2964 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2965 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2966 type = build_function_type (void_type_node, parm_types);
2968 /* Create the FUNCTION_DECL itself. */
2969 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2970 get_identifier (id),
2972 TREE_PUBLIC (ssdf_decl) = 0;
2973 DECL_ARTIFICIAL (ssdf_decl) = 1;
2975 /* Put this function in the list of functions to be called from the
2976 static constructors and destructors. */
2979 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2981 /* Take this opportunity to initialize the map from priority
2982 numbers to information about that priority level. */
2983 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2984 /*delete_key_fn=*/0,
2985 /*delete_value_fn=*/
2986 (splay_tree_delete_value_fn) &free);
2988 /* We always need to generate functions for the
2989 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2990 priorities later, we'll be sure to find the
2991 DEFAULT_INIT_PRIORITY. */
2992 get_priority_info (DEFAULT_INIT_PRIORITY);
2995 VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl);
2997 /* Create the argument list. */
2998 initialize_p_decl = build_decl (PARM_DECL,
2999 get_identifier (INITIALIZE_P_IDENTIFIER),
3001 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
3002 DECL_ARG_TYPE (initialize_p_decl) = integer_type_node;
3003 TREE_USED (initialize_p_decl) = 1;
3004 priority_decl = build_decl (PARM_DECL, get_identifier (PRIORITY_IDENTIFIER),
3006 DECL_CONTEXT (priority_decl) = ssdf_decl;
3007 DECL_ARG_TYPE (priority_decl) = integer_type_node;
3008 TREE_USED (priority_decl) = 1;
3010 TREE_CHAIN (initialize_p_decl) = priority_decl;
3011 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
3013 /* Put the function in the global scope. */
3014 pushdecl (ssdf_decl);
3016 /* Start the function itself. This is equivalent to declarating the
3019 static void __ssdf (int __initialize_p, init __priority_p);
3021 It is static because we only need to call this function from the
3022 various constructor and destructor functions for this module. */
3023 start_function (/*specs=*/NULL_TREE,
3025 /*attrs=*/NULL_TREE,
3028 /* Set up the scope of the outermost block in the function. */
3029 body = begin_compound_stmt (/*has_no_scope=*/0);
3031 /* This function must not be deferred because we are depending on
3032 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3033 current_function_cannot_inline
3034 = "static storage duration functions cannot be inlined";
3039 /* Finish the generation of the function which performs initialization
3040 and destruction of objects with static storage duration. After
3041 this point, no more such objects can be created. */
3044 finish_static_storage_duration_function (body)
3047 /* Close out the function. */
3048 finish_compound_stmt (/*has_no_scope=*/0, body);
3049 expand_body (finish_function (lineno, 0));
3052 /* Return the information about the indicated PRIORITY level. If no
3053 code to handle this level has yet been generated, generate the
3054 appropriate prologue. */
3056 static priority_info
3057 get_priority_info (priority)
3063 n = splay_tree_lookup (priority_info_map,
3064 (splay_tree_key) priority);
3067 /* Create a new priority information structure, and insert it
3069 pi = (priority_info) xmalloc (sizeof (struct priority_info_s));
3070 pi->initializations_p = 0;
3071 pi->destructions_p = 0;
3072 splay_tree_insert (priority_info_map,
3073 (splay_tree_key) priority,
3074 (splay_tree_value) pi);
3077 pi = (priority_info) n->value;
3082 /* Set up to handle the initialization or destruction of DECL. If
3083 INITP is non-zero, we are initializing the variable. Otherwise, we
3084 are destroying it. */
3087 start_static_initialization_or_destruction (decl, initp)
3091 tree sentry_if_stmt = NULL_TREE;
3097 /* Figure out the priority for this declaration. */
3098 priority = DECL_INIT_PRIORITY (decl);
3100 priority = DEFAULT_INIT_PRIORITY;
3102 /* Remember that we had an initialization or finalization at this
3104 pi = get_priority_info (priority);
3106 pi->initializations_p = 1;
3108 pi->destructions_p = 1;
3110 /* Trick the compiler into thinking we are at the file and line
3111 where DECL was declared so that error-messages make sense, and so
3112 that the debugger will show somewhat sensible file and line
3114 input_filename = DECL_SOURCE_FILE (decl);
3115 lineno = DECL_SOURCE_LINE (decl);
3121 Access control for implicit calls to the constructors,
3122 the conversion functions, or the destructor called to
3123 create and destroy a static data member is performed as
3124 if these calls appeared in the scope of the member's
3127 we pretend we are in a static member function of the class of
3128 which the DECL is a member. */
3129 if (member_p (decl))
3131 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
3132 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
3135 /* Conditionalize this initialization on being in the right priority
3136 and being initializing/finalizing appropriately. */
3137 sentry_if_stmt = begin_if_stmt ();
3138 cond = build_binary_op (EQ_EXPR,
3140 build_int_2 (priority, 0));
3141 init_cond = initp ? integer_one_node : integer_zero_node;
3142 init_cond = build_binary_op (EQ_EXPR,
3145 cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
3147 /* We need a sentry if this is an object with external linkage that
3148 might be initialized in more than one place. */
3149 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
3150 || DECL_ONE_ONLY (decl)
3151 || DECL_WEAK (decl)))
3156 sentry = get_sentry (DECL_ASSEMBLER_NAME (decl));
3158 /* We do initializations only if the SENTRY is zero, i.e., if we
3159 are the first to initialize the variable. We do destructions
3160 only if the SENTRY is one, i.e., if we are the last to
3161 destroy the variable. */
3163 sentry_cond = build_binary_op (EQ_EXPR,
3164 build_unary_op (PREINCREMENT_EXPR,
3169 sentry_cond = build_binary_op (EQ_EXPR,
3170 build_unary_op (PREDECREMENT_EXPR,
3175 cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, sentry_cond);
3178 finish_if_stmt_cond (cond, sentry_if_stmt);
3180 return sentry_if_stmt;
3183 /* We've just finished generating code to do an initialization or
3184 finalization. SENTRY_IF_STMT is the if-statement we used to guard
3185 the initialization. */
3188 finish_static_initialization_or_destruction (sentry_if_stmt)
3189 tree sentry_if_stmt;
3191 finish_then_clause (sentry_if_stmt);
3194 /* Now that we're done with DECL we don't need to pretend to be a
3195 member of its class any longer. */
3196 DECL_CONTEXT (current_function_decl) = NULL_TREE;
3197 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
3200 /* Generate code to do the static initialization of DECL. The
3201 initialization is INIT. If DECL may be initialized more than once
3202 in different object files, SENTRY is the guard variable to
3203 check. PRIORITY is the priority for the initialization. */
3206 do_static_initialization (decl, init)
3211 tree sentry_if_stmt;
3213 /* Set up for the initialization. */
3215 = start_static_initialization_or_destruction (decl,
3218 /* Do the initialization itself. */
3219 if (IS_AGGR_TYPE (TREE_TYPE (decl))
3220 || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
3221 expr = build_aggr_init (decl, init, 0);
3222 else if (TREE_CODE (init) == TREE_VEC)
3223 expr = build_vec_init (decl, TREE_VEC_ELT (init, 0),
3224 TREE_VEC_ELT (init, 1),
3225 TREE_VEC_ELT (init, 2), 0);
3228 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
3229 TREE_SIDE_EFFECTS (expr) = 1;
3231 finish_expr_stmt (expr);
3233 /* If we're using __cxa_atexit, register a a function that calls the
3234 destructor for the object. */
3235 if (flag_use_cxa_atexit)
3236 register_dtor_fn (decl);
3239 finish_static_initialization_or_destruction (sentry_if_stmt);
3242 /* Generate code to do the static destruction of DECL. If DECL may be
3243 initialized more than once in different object files, SENTRY is the
3244 guard variable to check. PRIORITY is the priority for the
3248 do_static_destruction (decl)
3251 tree sentry_if_stmt;
3253 /* If we're using __cxa_atexit, then destructors are registered
3254 immediately after objects are initialized. */
3255 my_friendly_assert (!flag_use_cxa_atexit, 20000121);
3257 /* If we don't need a destructor, there's nothing to do. */
3258 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
3261 /* Actually do the destruction. */
3262 sentry_if_stmt = start_static_initialization_or_destruction (decl,
3264 finish_expr_stmt (build_cleanup (decl));
3265 finish_static_initialization_or_destruction (sentry_if_stmt);
3268 /* VARS is a list of variables with static storage duration which may
3269 need initialization and/or finalization. Remove those variables
3270 that don't really need to be initialized or finalized, and return
3271 the resulting list. The order in which the variables appear in
3272 VARS is in reverse order of the order in which they should actually
3273 be initialized. The list we return is in the unreversed order;
3274 i.e., the first variable should be initialized first. */
3277 prune_vars_needing_no_initialization (vars)
3283 for (var = vars, result = NULL_TREE;
3285 var = TREE_CHAIN (var))
3287 tree decl = TREE_VALUE (var);
3288 tree init = TREE_PURPOSE (var);
3290 /* Deal gracefully with error. */
3291 if (decl == error_mark_node)
3294 /* The only things that can be initialized are variables. */
3295 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
3297 /* If this object is not defined, we don't need to do anything
3299 if (DECL_EXTERNAL (decl))
3302 /* Also, if the initializer already contains errors, we can bail
3304 if (init && TREE_CODE (init) == TREE_LIST
3305 && value_member (error_mark_node, init))
3308 /* This variable is going to need initialization and/or
3309 finalization, so we add it to the list. */
3310 result = tree_cons (init, decl, result);
3316 /* Make sure we have told the back end about all the variables in
3320 write_out_vars (vars)
3325 for (v = vars; v; v = TREE_CHAIN (v))
3326 if (! TREE_ASM_WRITTEN (TREE_VALUE (v)))
3327 rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1);
3330 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3331 (otherwise) that will initialize all gobal objects with static
3332 storage duration having the indicated PRIORITY. */
3335 generate_ctor_or_dtor_function (constructor_p, priority)
3344 /* We use `I' to indicate initialization and `D' to indicate
3351 /* Begin the function. */
3352 body = start_objects (function_key, priority);
3354 /* Call the static storage duration function with appropriate
3356 for (i = 0; i < ssdf_decls->elements_used; ++i)
3358 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
3360 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
3362 finish_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls, i),
3366 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3367 calls to any functions marked with attributes indicating that
3368 they should be called at initialization- or destruction-time. */
3369 if (priority == DEFAULT_INIT_PRIORITY)
3373 for (fns = constructor_p ? static_ctors : static_dtors;
3375 fns = TREE_CHAIN (fns))
3376 finish_expr_stmt (build_function_call (TREE_VALUE (fns), NULL_TREE));
3379 /* Close out the function. */
3380 finish_objects (function_key, priority, body);
3383 /* Generate constructor and destructor functions for the priority
3387 generate_ctor_and_dtor_functions_for_priority (n, data)
3389 void *data ATTRIBUTE_UNUSED;
3391 int priority = (int) n->key;
3392 priority_info pi = (priority_info) n->value;
3394 /* Generate the functions themselves, but only if they are really
3396 if (pi->initializations_p
3397 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
3398 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3400 if (pi->destructions_p
3401 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
3402 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3405 /* Keep iterating. */
3409 /* This routine is called from the last rule in yyparse ().
3410 Its job is to create all the code needed to initialize and
3411 destroy the global aggregates. We do the destruction
3412 first, since that way we only need to reverse the decls once. */
3418 int start_time, this_time;
3425 /* Bad parse errors. Just forget about it. */
3426 if (! global_bindings_p () || current_class_type || decl_namespace_list)
3429 start_time = get_run_time ();
3431 /* Otherwise, GDB can get confused, because in only knows
3432 about source for LINENO-1 lines. */
3435 interface_unknown = 1;
3438 /* We now have to write out all the stuff we put off writing out.
3441 o Template specializations that we have not yet instantiated,
3442 but which are needed.
3443 o Initialization and destruction for non-local objects with
3444 static storage duration. (Local objects with static storage
3445 duration are initialized when their scope is first entered,
3446 and are cleaned up via atexit.)
3447 o Virtual function tables.
3449 All of these may cause others to be needed. For example,
3450 instantiating one function may cause another to be needed, and
3451 generating the intiailzer for an object may cause templates to be
3452 instantiated, etc., etc. */
3454 this_time = get_run_time ();
3455 parse_time -= this_time - start_time;
3456 varconst_time += this_time - start_time;
3457 start_time = get_run_time ();
3459 if (new_abi_rtti_p ())
3460 emit_support_tinfos ();
3466 /* If there are templates that we've put off instantiating, do
3468 instantiate_pending_templates ();
3470 /* Write out virtual tables as required. Note that writing out
3471 the virtual table for a template class may cause the
3472 instantiation of members of that class. */
3473 if (walk_globals (vtable_decl_p,
3474 finish_vtable_vardecl,
3478 /* Write out needed type info variables. Writing out one variable
3479 might cause others to be needed. */
3480 if (new_abi_rtti_p ()
3481 && walk_globals (tinfo_decl_p, emit_tinfo_decl, /*data=*/0))
3484 /* The list of objects with static storage duration is built up
3485 in reverse order. We clear STATIC_AGGREGATES so that any new
3486 aggregates added during the initialization of these will be
3487 initialized in the correct order when we next come around the
3489 vars = prune_vars_needing_no_initialization (static_aggregates);
3490 static_aggregates = NULL_TREE;
3496 /* We need to start a new initialization function each time
3497 through the loop. That's because we need to know which
3498 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3499 isn't computed until a function is finished, and written
3500 out. That's a deficiency in the back-end. When this is
3501 fixed, these initialization functions could all become
3502 inline, with resulting performance improvements. */
3503 tree ssdf_body = start_static_storage_duration_function ();
3505 /* Make sure the back end knows about all the variables. */
3506 write_out_vars (vars);
3508 /* First generate code to do all the initializations. */
3509 for (v = vars; v; v = TREE_CHAIN (v))
3510 do_static_initialization (TREE_VALUE (v),
3513 /* Then, generate code to do all the destructions. Do these
3514 in reverse order so that the most recently constructed
3515 variable is the first destroyed. If we're using
3516 __cxa_atexit, then we don't need to do this; functions
3517 we're registered at initialization time to destroy the
3519 if (!flag_use_cxa_atexit)
3521 vars = nreverse (vars);
3522 for (v = vars; v; v = TREE_CHAIN (v))
3523 do_static_destruction (TREE_VALUE (v));
3528 /* Finish up the static storage duration function for this
3530 finish_static_storage_duration_function (ssdf_body);
3532 /* All those initializations and finalizations might cause
3533 us to need more inline functions, more template
3534 instantiations, etc. */
3538 /* Go through the various inline functions, and see if any need
3540 for (i = 0; i < deferred_fns_used; ++i)
3542 tree decl = VARRAY_TREE (deferred_fns, i);
3543 import_export_decl (decl);
3544 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
3546 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
3548 /* Even though we're already at the top-level, we push
3549 there again. That way, when we pop back a few lines
3550 hence, all of our state is restored. Otherwise,
3551 finish_function doesn't clean things up, and we end
3552 up with CURRENT_FUNCTION_DECL set. */
3553 push_to_top_level ();
3554 if (DECL_TINFO_FN_P (decl))
3555 synthesize_tinfo_fn (decl);
3557 synthesize_method (decl);
3558 pop_from_top_level ();
3563 /* Mark all functions that might deal with exception-handling as
3565 mark_all_runtime_matches ();
3567 /* We lie to the back-end, pretending that some functions are
3568 not defined when they really are. This keeps these functions
3569 from being put out unncessarily. But, we must stop lying
3570 when the functions are referenced, or if they are not comdat
3571 since they need to be put out now. */
3572 for (i = 0; i < deferred_fns_used; ++i)
3574 tree decl = VARRAY_TREE (deferred_fns, i);
3576 if (DECL_NOT_REALLY_EXTERN (decl)
3577 && DECL_INITIAL (decl)
3578 && DECL_NEEDED_P (decl))
3579 DECL_EXTERNAL (decl) = 0;
3581 /* If we're going to need to write this function out, and
3582 there's already a body for it, create RTL for it now.
3583 (There might be no body if this is a method we haven't
3584 gotten around to synthesizing yet.) */
3585 if (!DECL_EXTERNAL (decl)
3586 && DECL_NEEDED_P (decl)
3587 && DECL_SAVED_TREE (decl)
3588 && !DECL_SAVED_INSNS (decl)
3589 && !TREE_ASM_WRITTEN (decl))
3591 int saved_not_really_extern;
3593 /* When we call finish_function in expand_body, it will
3594 try to reset DECL_NOT_REALLY_EXTERN so we save and
3596 saved_not_really_extern = DECL_NOT_REALLY_EXTERN (decl);
3597 /* Generate RTL for this function now that we know we
3600 /* Undo the damage done by finish_function. */
3601 DECL_EXTERNAL (decl) = 0;
3602 DECL_NOT_REALLY_EXTERN (decl) = saved_not_really_extern;
3603 /* If we're compiling -fsyntax-only pretend that this
3604 function has been written out so that we don't try to
3606 if (flag_syntax_only)
3607 TREE_ASM_WRITTEN (decl) = 1;
3612 if (deferred_fns_used
3613 && wrapup_global_declarations (&VARRAY_TREE (deferred_fns, 0),
3616 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
3619 /* Static data members are just like namespace-scope globals. */
3620 for (i = 0; i < pending_statics_used; ++i)
3622 tree decl = VARRAY_TREE (pending_statics, i);
3623 if (TREE_ASM_WRITTEN (decl))
3625 import_export_decl (decl);
3626 if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
3627 DECL_EXTERNAL (decl) = 0;
3630 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
3631 pending_statics_used))
3636 /* We give C linkage to static constructors and destructors. */
3637 push_lang_context (lang_name_c);
3639 /* Generate initialization and destruction functions for all
3640 priorities for which they are required. */
3641 if (priority_info_map)
3642 splay_tree_foreach (priority_info_map,
3643 generate_ctor_and_dtor_functions_for_priority,
3646 /* We're done with the splay-tree now. */
3647 if (priority_info_map)
3648 splay_tree_delete (priority_info_map);
3650 /* We're done with static constructors, so we can go back to "C++"
3652 pop_lang_context ();
3654 /* Now delete from the chain of variables all virtual function tables.
3655 We output them all ourselves, because each will be treated
3656 specially. We don't do this if we're just doing semantic
3657 analysis, and not code-generation. */
3658 if (!flag_syntax_only)
3659 walk_globals (vtable_decl_p, prune_vtable_vardecl, /*data=*/0);
3661 /* Now, issue warnings about static, but not defined, functions,
3662 etc., and emit debugging information. */
3663 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
3664 if (pending_statics)
3665 check_global_declarations (&VARRAY_TREE (pending_statics, 0),
3666 pending_statics_used);
3670 /* The entire file is now complete. If requested, dump everything
3672 if (flag_dump_translation_unit)
3673 dump_node_to_file (global_namespace, flag_dump_translation_unit);
3675 /* If there's some tool that wants to examine the entire translation
3676 unit, let it do so now. */
3678 (*back_end_hook) (global_namespace);
3680 this_time = get_run_time ();
3681 parse_time -= this_time - start_time;
3682 varconst_time += this_time - start_time;
3684 if (flag_detailed_statistics)
3686 dump_tree_statistics ();
3687 dump_time_statistics ();
3691 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3692 expr. Since it was parsed like a type, we need to wade through and fix
3693 that. Unfortunately, since operator() is left-associative, we can't use
3694 tail recursion. In the above example, TYPE is `A', and DECL is
3697 Maybe this shouldn't be recursive, but how often will it actually be
3701 reparse_absdcl_as_expr (type, decl)
3704 /* do build_functional_cast (type, NULL_TREE) at bottom */
3705 if (TREE_OPERAND (decl, 0) == NULL_TREE)
3706 return build_functional_cast (type, NULL_TREE);
3709 decl = reparse_absdcl_as_expr (type, TREE_OPERAND (decl, 0));
3711 decl = build_x_function_call (decl, NULL_TREE, current_class_ref);
3713 if (TREE_CODE (decl) == CALL_EXPR
3714 && (! TREE_TYPE (decl)
3715 || TREE_CODE (TREE_TYPE (decl)) != VOID_TYPE))
3716 decl = require_complete_type (decl);
3721 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3722 out to be an expr. Since it was parsed like a type, we need to wade
3723 through and fix that. Since casts are right-associative, we are
3724 reversing the order, so we don't have to recurse.
3726 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3730 reparse_absdcl_as_casts (decl, expr)
3735 if (TREE_CODE (expr) == CONSTRUCTOR
3736 && TREE_TYPE (expr) == 0)
3738 type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl)));
3739 decl = TREE_OPERAND (decl, 0);
3741 expr = digest_init (type, expr, (tree *) 0);
3742 if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type))
3744 int failure = complete_array_type (type, expr, 1);
3746 my_friendly_abort (78);
3752 type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl)));
3753 decl = TREE_OPERAND (decl, 0);
3754 expr = build_c_cast (type, expr);
3757 if (warn_old_style_cast && ! in_system_header
3758 && current_lang_name != lang_name_c)
3759 warning ("use of old-style cast");
3764 /* Given plain tree nodes for an expression, build up the full semantics. */
3767 build_expr_from_tree (t)
3770 if (t == NULL_TREE || t == error_mark_node)
3773 switch (TREE_CODE (t))
3775 case IDENTIFIER_NODE:
3776 return do_identifier (t, 0, NULL_TREE);
3779 if (LOOKUP_EXPR_GLOBAL (t))
3780 return do_scoped_id (TREE_OPERAND (t, 0), 0);
3782 return do_identifier (TREE_OPERAND (t, 0), 0, NULL_TREE);
3784 case TEMPLATE_ID_EXPR:
3785 return (lookup_template_function
3786 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3787 build_expr_from_tree (TREE_OPERAND (t, 1))));
3790 return build_x_indirect_ref
3791 (build_expr_from_tree (TREE_OPERAND (t, 0)), "unary *");
3794 return build_functional_cast
3795 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3797 case REINTERPRET_CAST_EXPR:
3798 return build_reinterpret_cast
3799 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3801 case CONST_CAST_EXPR:
3802 return build_const_cast
3803 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3805 case DYNAMIC_CAST_EXPR:
3806 return build_dynamic_cast
3807 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3809 case STATIC_CAST_EXPR:
3810 return build_static_cast
3811 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3813 case PREDECREMENT_EXPR:
3814 case PREINCREMENT_EXPR:
3815 case POSTDECREMENT_EXPR:
3816 case POSTINCREMENT_EXPR:
3820 case TRUTH_NOT_EXPR:
3822 case CONVERT_EXPR: /* Unary + */
3827 return build_x_unary_op (TREE_CODE (t),
3828 build_expr_from_tree (TREE_OPERAND (t, 0)));
3833 case TRUNC_DIV_EXPR:
3835 case FLOOR_DIV_EXPR:
3836 case ROUND_DIV_EXPR:
3837 case EXACT_DIV_EXPR:
3839 case BIT_ANDTC_EXPR:
3842 case TRUNC_MOD_EXPR:
3843 case FLOOR_MOD_EXPR:
3844 case TRUTH_ANDIF_EXPR:
3845 case TRUTH_ORIF_EXPR:
3846 case TRUTH_AND_EXPR:
3861 return build_x_binary_op
3863 build_expr_from_tree (TREE_OPERAND (t, 0)),
3864 build_expr_from_tree (TREE_OPERAND (t, 1)));
3867 return build_m_component_ref
3868 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3869 build_expr_from_tree (TREE_OPERAND (t, 1)));
3872 return build_offset_ref (TREE_OPERAND (t, 0), TREE_OPERAND (t, 1));
3875 if (TREE_OPERAND (t, 0) == NULL_TREE)
3877 return build_parse_node (ARRAY_REF, NULL_TREE,
3878 build_expr_from_tree (TREE_OPERAND (t, 1)));
3879 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t, 0)),
3880 build_expr_from_tree (TREE_OPERAND (t, 1)));
3885 tree r = build_expr_from_tree (TREE_OPERAND (t, 0));
3888 return TREE_CODE (t) == SIZEOF_EXPR ? c_sizeof (r) : c_alignof (r);
3892 return build_x_modify_expr
3893 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3894 TREE_CODE (TREE_OPERAND (t, 1)),
3895 build_expr_from_tree (TREE_OPERAND (t, 2)));
3898 return build_x_arrow
3899 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3903 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3904 build_expr_from_tree (TREE_OPERAND (t, 1)),
3905 build_expr_from_tree (TREE_OPERAND (t, 2)),
3906 NEW_EXPR_USE_GLOBAL (t));
3909 return delete_sanity
3910 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3911 build_expr_from_tree (TREE_OPERAND (t, 1)),
3912 DELETE_EXPR_USE_VEC (t), DELETE_EXPR_USE_GLOBAL (t));
3915 if (TREE_OPERAND (t, 1) == NULL_TREE)
3916 return build_x_compound_expr
3917 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3919 my_friendly_abort (42);
3921 case METHOD_CALL_EXPR:
3922 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
3924 tree ref = TREE_OPERAND (t, 0);
3925 return build_scoped_method_call
3926 (build_expr_from_tree (TREE_OPERAND (t, 1)),
3927 build_expr_from_tree (TREE_OPERAND (ref, 0)),
3928 TREE_OPERAND (ref, 1),
3929 build_expr_from_tree (TREE_OPERAND (t, 2)));
3933 tree fn = TREE_OPERAND (t, 0);
3935 /* We can get a TEMPLATE_ID_EXPR here on code like:
3939 so we must resolve that. However, we can also get things
3940 like a BIT_NOT_EXPR here, when referring to a destructor,
3941 and things like that are not correctly resolved by
3942 build_expr_from_tree. So, just use build_expr_from_tree
3943 when we really need it. */
3944 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3945 fn = lookup_template_function
3946 (TREE_OPERAND (fn, 0),
3947 build_expr_from_tree (TREE_OPERAND (fn, 1)));
3949 return build_method_call
3950 (build_expr_from_tree (TREE_OPERAND (t, 1)),
3952 build_expr_from_tree (TREE_OPERAND (t, 2)),
3953 NULL_TREE, LOOKUP_NORMAL);
3957 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
3959 tree ref = TREE_OPERAND (t, 0);
3960 return build_member_call
3961 (build_expr_from_tree (TREE_OPERAND (ref, 0)),
3962 TREE_OPERAND (ref, 1),
3963 build_expr_from_tree (TREE_OPERAND (t, 1)));
3967 tree name = TREE_OPERAND (t, 0);
3969 tree args = build_expr_from_tree (TREE_OPERAND (t, 1));
3970 if (args != NULL_TREE && TREE_CODE (name) == LOOKUP_EXPR
3971 && !LOOKUP_EXPR_GLOBAL (name)
3972 && TREE_CODE ((id = TREE_OPERAND (name, 0))) == IDENTIFIER_NODE
3973 && (!current_class_type
3974 || !lookup_member (current_class_type, id, 0, 0)))
3976 /* Do Koenig lookup if there are no class members. */
3977 name = do_identifier (id, 0, args);
3979 else if (TREE_CODE (name) == TEMPLATE_ID_EXPR
3980 || ! really_overloaded_fn (name))
3981 name = build_expr_from_tree (name);
3982 return build_x_function_call (name, args, current_class_ref);
3986 return build_x_conditional_expr
3987 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3988 build_expr_from_tree (TREE_OPERAND (t, 1)),
3989 build_expr_from_tree (TREE_OPERAND (t, 2)));
3991 case PSEUDO_DTOR_EXPR:
3992 return (finish_pseudo_destructor_call_expr
3993 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3994 build_expr_from_tree (TREE_OPERAND (t, 1)),
3995 build_expr_from_tree (TREE_OPERAND (t, 2))));
3999 tree purpose, value, chain;
4001 if (t == void_list_node)
4004 purpose = TREE_PURPOSE (t);
4006 purpose = build_expr_from_tree (purpose);
4007 value = TREE_VALUE (t);
4009 value = build_expr_from_tree (value);
4010 chain = TREE_CHAIN (t);
4011 if (chain && chain != void_type_node)
4012 chain = build_expr_from_tree (chain);
4013 return tree_cons (purpose, value, chain);
4018 tree object = build_expr_from_tree (TREE_OPERAND (t, 0));
4019 tree field = TREE_OPERAND (t, 1);
4021 /* We use a COMPONENT_REF to indicate things of the form `x.b'
4022 and `x.A::b'. We must distinguish between those cases
4024 if (TREE_CODE (field) == SCOPE_REF)
4025 return build_object_ref (object,
4026 TREE_OPERAND (field, 0),
4027 TREE_OPERAND (field, 1));
4029 return build_x_component_ref (object, field,
4034 return build_throw (build_expr_from_tree (TREE_OPERAND (t, 0)));
4040 /* digest_init will do the wrong thing if we let it. */
4041 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
4044 r = build_nt (CONSTRUCTOR, NULL_TREE,
4045 build_expr_from_tree (CONSTRUCTOR_ELTS (t)));
4046 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
4049 return digest_init (TREE_TYPE (t), r, 0);
4054 if (TYPE_P (TREE_OPERAND (t, 0)))
4055 return get_typeid (TREE_OPERAND (t, 0));
4056 return build_typeid (build_expr_from_tree (TREE_OPERAND (t, 0)));
4059 return convert_from_reference (t);
4062 return build_va_arg (build_expr_from_tree (TREE_OPERAND (t, 0)),
4070 /* This is something of the form `int (*a)++' that has turned out to be an
4071 expr. It was only converted into parse nodes, so we need to go through
4072 and build up the semantics. Most of the work is done by
4073 build_expr_from_tree, above.
4075 In the above example, TYPE is `int' and DECL is `*a'. */
4078 reparse_decl_as_expr (type, decl)
4081 decl = build_expr_from_tree (decl);
4083 return build_functional_cast (type, build_tree_list (NULL_TREE, decl));
4088 /* This is something of the form `int (*a)' that has turned out to be a
4089 decl. It was only converted into parse nodes, so we need to do the
4090 checking that make_{pointer,reference}_declarator do. */
4093 finish_decl_parsing (decl)
4096 extern int current_class_depth;
4098 switch (TREE_CODE (decl))
4100 case IDENTIFIER_NODE:
4103 return make_pointer_declarator
4104 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4106 return make_reference_declarator
4107 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4109 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4112 push_nested_class (TREE_TYPE (TREE_OPERAND (decl, 0)), 3);
4113 TREE_COMPLEXITY (decl) = current_class_depth;
4116 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4119 /* For attribute handling. */
4120 TREE_VALUE (decl) = finish_decl_parsing (TREE_VALUE (decl));
4123 my_friendly_abort (5);
4129 check_cp_case_value (value)
4132 if (value == NULL_TREE)
4135 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4136 STRIP_TYPE_NOPS (value);
4138 if (TREE_READONLY_DECL_P (value))
4140 value = decl_constant_value (value);
4141 STRIP_TYPE_NOPS (value);
4143 value = fold (value);
4145 if (TREE_CODE (value) != INTEGER_CST
4146 && value != error_mark_node)
4148 cp_error ("case label `%E' does not reduce to an integer constant",
4150 value = error_mark_node;
4153 /* Promote char or short to int. */
4154 value = default_conversion (value);
4156 constant_expression_warning (value);
4161 /* Return 1 if root encloses child. */
4164 is_namespace_ancestor (root, child)
4169 if (root == global_namespace)
4171 if (child == global_namespace)
4173 return is_namespace_ancestor (root, CP_DECL_CONTEXT (child));
4177 /* Return the namespace that is the common ancestor
4178 of two given namespaces. */
4181 namespace_ancestor (ns1, ns2)
4184 if (is_namespace_ancestor (ns1, ns2))
4186 return namespace_ancestor (CP_DECL_CONTEXT (ns1), ns2);
4189 /* Insert used into the using list of user. Set indirect_flag if this
4190 directive is not directly from the source. Also find the common
4191 ancestor and let our users know about the new namespace */
4193 add_using_namespace (user, used, indirect)
4199 /* Using oneself is a no-op. */
4202 my_friendly_assert (TREE_CODE (user) == NAMESPACE_DECL, 380);
4203 my_friendly_assert (TREE_CODE (used) == NAMESPACE_DECL, 380);
4204 /* Check if we already have this. */
4205 t = purpose_member (used, DECL_NAMESPACE_USING (user));
4209 /* Promote to direct usage. */
4210 TREE_INDIRECT_USING (t) = 0;
4214 /* Add used to the user's using list. */
4215 DECL_NAMESPACE_USING (user)
4216 = tree_cons (used, namespace_ancestor (user, used),
4217 DECL_NAMESPACE_USING (user));
4219 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect;
4221 /* Add user to the used's users list. */
4222 DECL_NAMESPACE_USERS (used)
4223 = tree_cons (user, 0, DECL_NAMESPACE_USERS (used));
4225 /* Recursively add all namespaces used. */
4226 for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t))
4227 /* indirect usage */
4228 add_using_namespace (user, TREE_PURPOSE (t), 1);
4230 /* Tell everyone using us about the new used namespaces. */
4231 for (t = DECL_NAMESPACE_USERS (user); t; t = TREE_CHAIN (t))
4232 add_using_namespace (TREE_PURPOSE (t), used, 1);
4235 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4236 duplicates. The first list becomes the tail of the result.
4238 The algorithm is O(n^2). We could get this down to O(n log n) by
4239 doing a sort on the addresses of the functions, if that becomes
4243 merge_functions (s1, s2)
4247 for (; s2; s2 = OVL_NEXT (s2))
4249 tree fn = OVL_CURRENT (s2);
4250 if (! ovl_member (fn, s1))
4251 s1 = build_overload (fn, s1);
4256 /* This should return an error not all definitions define functions.
4257 It is not an error if we find two functions with exactly the
4258 same signature, only if these are selected in overload resolution.
4259 old is the current set of bindings, new the freshly-found binding.
4260 XXX Do we want to give *all* candidates in case of ambiguity?
4261 XXX In what way should I treat extern declarations?
4262 XXX I don't want to repeat the entire duplicate_decls here */
4265 ambiguous_decl (name, old, new, flags)
4272 my_friendly_assert (old != NULL_TREE, 393);
4273 /* Copy the value. */
4274 val = BINDING_VALUE (new);
4276 switch (TREE_CODE (val))
4279 /* If we expect types or namespaces, and not templates,
4280 or this is not a template class. */
4281 if (LOOKUP_QUALIFIERS_ONLY (flags)
4282 && !DECL_CLASS_TEMPLATE_P (val))
4286 if (LOOKUP_NAMESPACES_ONLY (flags))
4289 case NAMESPACE_DECL:
4290 if (LOOKUP_TYPES_ONLY (flags))
4294 if (LOOKUP_QUALIFIERS_ONLY (flags))
4298 if (!BINDING_VALUE (old))
4299 BINDING_VALUE (old) = val;
4300 else if (val && val != BINDING_VALUE (old))
4302 if (is_overloaded_fn (BINDING_VALUE (old))
4303 && is_overloaded_fn (val))
4305 BINDING_VALUE (old) = merge_functions (BINDING_VALUE (old),
4310 /* Some declarations are functions, some are not. */
4311 if (flags & LOOKUP_COMPLAIN)
4313 /* If we've already given this error for this lookup,
4314 BINDING_VALUE (old) is error_mark_node, so let's not
4315 repeat ourselves. */
4316 if (BINDING_VALUE (old) != error_mark_node)
4318 cp_error ("use of `%D' is ambiguous", name);
4319 cp_error_at (" first declared as `%#D' here",
4320 BINDING_VALUE (old));
4322 cp_error_at (" also declared as `%#D' here", val);
4324 BINDING_VALUE (old) = error_mark_node;
4327 /* ... and copy the type. */
4328 type = BINDING_TYPE (new);
4329 if (LOOKUP_NAMESPACES_ONLY (flags))
4331 if (!BINDING_TYPE (old))
4332 BINDING_TYPE (old) = type;
4333 else if (type && BINDING_TYPE (old) != type)
4335 if (flags & LOOKUP_COMPLAIN)
4337 cp_error ("`%D' denotes an ambiguous type",name);
4338 cp_error_at (" first type here", BINDING_TYPE (old));
4339 cp_error_at (" other type here", type);
4345 /* Subroutine of unualified_namespace_lookup:
4346 Add the bindings of NAME in used namespaces to VAL.
4347 We are currently looking for names in namespace SCOPE, so we
4348 look through USINGS for using-directives of namespaces
4349 which have SCOPE as a common ancestor with the current scope.
4350 Returns zero on errors. */
4353 lookup_using_namespace (name, val, usings, scope, flags, spacesp)
4354 tree name, val, usings, scope;
4360 /* Iterate over all used namespaces in current, searching for using
4361 directives of scope. */
4362 for (iter = usings; iter; iter = TREE_CHAIN (iter))
4363 if (TREE_VALUE (iter) == scope)
4366 *spacesp = tree_cons (TREE_PURPOSE (iter), NULL_TREE,
4368 val1 = binding_for_name (name, TREE_PURPOSE (iter));
4369 /* Resolve ambiguities. */
4370 val = ambiguous_decl (name, val, val1, flags);
4372 return BINDING_VALUE (val) != error_mark_node;
4376 Accepts the NAME to lookup and its qualifying SCOPE.
4377 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4381 qualified_lookup_using_namespace (name, scope, result, flags)
4387 /* Maintain a list of namespaces visited... */
4388 tree seen = NULL_TREE;
4389 /* ... and a list of namespace yet to see. */
4390 tree todo = NULL_TREE;
4392 while (scope && (result != error_mark_node))
4394 seen = tree_cons (scope, NULL_TREE, seen);
4395 result = ambiguous_decl (name, result,
4396 binding_for_name (name, scope), flags);
4397 if (!BINDING_VALUE (result) && !BINDING_TYPE (result))
4398 /* Consider using directives. */
4399 for (usings = DECL_NAMESPACE_USING (scope); usings;
4400 usings = TREE_CHAIN (usings))
4401 /* If this was a real directive, and we have not seen it. */
4402 if (!TREE_INDIRECT_USING (usings)
4403 && !purpose_member (TREE_PURPOSE (usings), seen))
4404 todo = tree_cons (TREE_PURPOSE (usings), NULL_TREE, todo);
4407 scope = TREE_PURPOSE (todo);
4408 todo = TREE_CHAIN (todo);
4411 scope = NULL_TREE; /* If there never was a todo list. */
4413 return result != error_mark_node;
4416 /* [namespace.memdef]/2 */
4418 /* Set the context of a declaration to scope. Complain if we are not
4422 set_decl_namespace (decl, scope, friendp)
4428 if (scope == std_node)
4429 scope = global_namespace;
4430 /* Get rid of namespace aliases. */
4431 scope = ORIGINAL_NAMESPACE (scope);
4433 /* It is ok for friends to be qualified in parallel space. */
4434 if (!friendp && !is_namespace_ancestor (current_namespace, scope))
4435 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4437 DECL_CONTEXT (decl) = FROB_CONTEXT (scope);
4438 if (scope != current_namespace)
4440 /* See whether this has been declared in the namespace. */
4441 old = namespace_binding (DECL_NAME (decl), scope);
4443 /* No old declaration at all. */
4445 if (!is_overloaded_fn (decl))
4446 /* Don't compare non-function decls with decls_match here,
4447 since it can't check for the correct constness at this
4448 point. pushdecl will find those errors later. */
4450 /* Since decl is a function, old should contain a function decl. */
4451 if (!is_overloaded_fn (old))
4453 if (processing_template_decl || processing_specialization)
4454 /* We have not yet called push_template_decl to turn the
4455 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4456 won't match. But, we'll check later, when we construct the
4459 for (; old; old = OVL_NEXT (old))
4460 if (decls_match (decl, OVL_CURRENT (old)))
4466 cp_error ("`%D' should have been declared inside `%D'",
4470 /* Compute the namespace where a declaration is defined. */
4473 decl_namespace (decl)
4476 while (DECL_CONTEXT (decl))
4478 decl = DECL_CONTEXT (decl);
4479 if (TREE_CODE (decl) == NAMESPACE_DECL)
4482 decl = TYPE_STUB_DECL (decl);
4483 my_friendly_assert (DECL_P (decl), 390);
4486 return global_namespace;
4489 /* Return the namespace where the current declaration is declared. */
4492 current_decl_namespace ()
4495 /* If we have been pushed into a different namespace, use it. */
4496 if (decl_namespace_list)
4497 return TREE_PURPOSE (decl_namespace_list);
4499 if (current_class_type)
4500 result = decl_namespace (TYPE_STUB_DECL (current_class_type));
4501 else if (current_function_decl)
4502 result = decl_namespace (current_function_decl);
4504 result = current_namespace;
4508 /* Temporarily set the namespace for the current declaration. */
4511 push_decl_namespace (decl)
4514 if (TREE_CODE (decl) != NAMESPACE_DECL)
4515 decl = decl_namespace (decl);
4516 decl_namespace_list = tree_cons (decl, NULL_TREE, decl_namespace_list);
4520 pop_decl_namespace ()
4522 decl_namespace_list = TREE_CHAIN (decl_namespace_list);
4525 /* Enter a class or namespace scope. */
4531 if (TREE_CODE (t) == NAMESPACE_DECL)
4532 push_decl_namespace (t);
4537 /* Leave scope pushed by push_scope. */
4543 if (TREE_CODE (t) == NAMESPACE_DECL)
4544 pop_decl_namespace ();
4549 /* [basic.lookup.koenig] */
4550 /* A non-zero return value in the functions below indicates an error.
4551 All nodes allocated in the procedure are on the scratch obstack. */
4561 static int arg_assoc PARAMS ((struct arg_lookup*, tree));
4562 static int arg_assoc_args PARAMS ((struct arg_lookup*, tree));
4563 static int arg_assoc_type PARAMS ((struct arg_lookup*, tree));
4564 static int add_function PARAMS ((struct arg_lookup *, tree));
4565 static int arg_assoc_namespace PARAMS ((struct arg_lookup *, tree));
4566 static int arg_assoc_class PARAMS ((struct arg_lookup *, tree));
4567 static int arg_assoc_template_arg PARAMS ((struct arg_lookup*, tree));
4569 /* Add a function to the lookup structure.
4570 Returns 1 on error. */
4573 add_function (k, fn)
4574 struct arg_lookup *k;
4577 /* We used to check here to see if the function was already in the list,
4578 but that's O(n^2), which is just too expensive for function lookup.
4579 Now we deal with the occasional duplicate in joust. In doing this, we
4580 assume that the number of duplicates will be small compared to the
4581 total number of functions being compared, which should usually be the
4584 /* We must find only functions, or exactly one non-function. */
4585 if (k->functions && is_overloaded_fn (k->functions)
4586 && is_overloaded_fn (fn))
4587 k->functions = build_overload (fn, k->functions);
4588 else if (k->functions)
4590 tree f1 = OVL_CURRENT (k->functions);
4592 if (is_overloaded_fn (f1))
4594 fn = f1; f1 = f2; f2 = fn;
4596 cp_error_at ("`%D' is not a function,", f1);
4597 cp_error_at (" conflict with `%D'", f2);
4598 cp_error (" in call to `%D'", k->name);
4606 /* Add functions of a namespace to the lookup structure.
4607 Returns 1 on error. */
4610 arg_assoc_namespace (k, scope)
4611 struct arg_lookup *k;
4616 if (purpose_member (scope, k->namespaces))
4618 k->namespaces = tree_cons (scope, NULL_TREE, k->namespaces);
4620 value = namespace_binding (k->name, scope);
4624 for (; value; value = OVL_NEXT (value))
4625 if (add_function (k, OVL_CURRENT (value)))
4631 /* Adds everything associated with a template argument to the lookup
4632 structure. Returns 1 on error. */
4635 arg_assoc_template_arg (k, arg)
4636 struct arg_lookup* k;
4639 /* [basic.lookup.koenig]
4641 If T is a template-id, its associated namespaces and classes are
4642 ... the namespaces and classes associated with the types of the
4643 template arguments provided for template type parameters
4644 (excluding template template parameters); the namespaces in which
4645 any template template arguments are defined; and the classes in
4646 which any member templates used as template template arguments
4647 are defined. [Note: non-type template arguments do not
4648 contribute to the set of associated namespaces. ] */
4650 /* Consider first template template arguments. */
4651 if (TREE_CODE (arg) == TEMPLATE_DECL)
4653 tree ctx = CP_DECL_CONTEXT (arg);
4655 /* It's not a member template. */
4656 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4657 return arg_assoc_namespace (k, ctx);
4658 /* Otherwise, it must be member template. */
4660 return arg_assoc_class (k, ctx);
4662 /* It's not a template template argument, but it is a type template
4664 else if (TYPE_P (arg))
4665 return arg_assoc_type (k, arg);
4666 /* It's a non-type template argument. */
4671 /* Adds everything associated with class to the lookup structure.
4672 Returns 1 on error. */
4675 arg_assoc_class (k, type)
4676 struct arg_lookup* k;
4679 tree list, friends, context;
4682 /* Backend build structures, such as __builtin_va_list, aren't
4683 affected by all this. */
4684 if (!CLASS_TYPE_P (type))
4687 if (purpose_member (type, k->classes))
4689 k->classes = tree_cons (type, NULL_TREE, k->classes);
4691 context = decl_namespace (TYPE_MAIN_DECL (type));
4692 if (arg_assoc_namespace (k, context))
4695 /* Process baseclasses. */
4696 for (i = 0; i < CLASSTYPE_N_BASECLASSES (type); i++)
4697 if (arg_assoc_class (k, TYPE_BINFO_BASETYPE (type, i)))
4700 /* Process friends. */
4701 for (list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list;
4702 list = TREE_CHAIN (list))
4703 if (k->name == TREE_PURPOSE (list))
4704 for (friends = TREE_VALUE (list); friends;
4705 friends = TREE_CHAIN (friends))
4706 /* Only interested in global functions with potentially hidden
4707 (i.e. unqualified) declarations. */
4708 if (TREE_PURPOSE (list) == error_mark_node && TREE_VALUE (list)
4709 && decl_namespace (TREE_VALUE (list)) == context)
4710 if (add_function (k, TREE_VALUE (list)))
4713 /* Process template arguments. */
4714 if (CLASSTYPE_TEMPLATE_INFO (type))
4716 list = innermost_args (CLASSTYPE_TI_ARGS (type));
4717 for (i = 0; i < TREE_VEC_LENGTH (list); ++i)
4718 arg_assoc_template_arg (k, TREE_VEC_ELT (list, i));
4724 /* Adds everything associated with a given type.
4725 Returns 1 on error. */
4728 arg_assoc_type (k, type)
4729 struct arg_lookup *k;
4732 switch (TREE_CODE (type))
4742 if (TYPE_PTRMEMFUNC_P (type))
4743 return arg_assoc_type (k, TYPE_PTRMEMFUNC_FN_TYPE (type));
4744 return arg_assoc_class (k, type);
4746 case REFERENCE_TYPE:
4748 return arg_assoc_type (k, TREE_TYPE (type));
4751 return arg_assoc_namespace (k, decl_namespace (TYPE_MAIN_DECL (type)));
4753 /* Pointer to member: associate class type and value type. */
4754 if (arg_assoc_type (k, TYPE_OFFSET_BASETYPE (type)))
4756 return arg_assoc_type (k, TREE_TYPE (type));
4758 /* The basetype is referenced in the first arg type, so just
4761 /* Associate the parameter types. */
4762 if (arg_assoc_args (k, TYPE_ARG_TYPES (type)))
4764 /* Associate the return type. */
4765 return arg_assoc_type (k, TREE_TYPE (type));
4766 case TEMPLATE_TYPE_PARM:
4767 case TEMPLATE_TEMPLATE_PARM:
4770 if (type == unknown_type_node)
4772 /* else fall through */
4774 my_friendly_abort (390);
4779 /* Adds everything associated with arguments. Returns 1 on error. */
4782 arg_assoc_args (k, args)
4783 struct arg_lookup* k;
4786 for (; args; args = TREE_CHAIN (args))
4787 if (arg_assoc (k, TREE_VALUE (args)))
4792 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4796 struct arg_lookup* k;
4799 if (n == error_mark_node)
4803 return arg_assoc_type (k, n);
4805 if (! type_unknown_p (n))
4806 return arg_assoc_type (k, TREE_TYPE (n));
4808 if (TREE_CODE (n) == ADDR_EXPR)
4809 n = TREE_OPERAND (n, 0);
4810 if (TREE_CODE (n) == COMPONENT_REF)
4811 n = TREE_OPERAND (n, 1);
4812 if (TREE_CODE (n) == OFFSET_REF)
4813 n = TREE_OPERAND (n, 1);
4814 while (TREE_CODE (n) == TREE_LIST)
4817 if (TREE_CODE (n) == FUNCTION_DECL)
4818 return arg_assoc_type (k, TREE_TYPE (n));
4819 if (TREE_CODE (n) == TEMPLATE_ID_EXPR)
4821 /* [basic.lookup.koenig]
4823 If T is a template-id, its associated namespaces and classes
4824 are the namespace in which the template is defined; for
4825 member templates, the member template's class... */
4826 tree template = TREE_OPERAND (n, 0);
4827 tree args = TREE_OPERAND (n, 1);
4831 /* First, the template. There may actually be more than one if
4832 this is an overloaded function template. But, in that case,
4833 we only need the first; all the functions will be in the same
4835 template = OVL_CURRENT (template);
4837 ctx = CP_DECL_CONTEXT (template);
4839 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4841 if (arg_assoc_namespace (k, ctx) == 1)
4844 /* It must be a member template. */
4845 else if (arg_assoc_class (k, ctx) == 1)
4848 /* Now the arguments. */
4849 for (arg = args; arg != NULL_TREE; arg = TREE_CHAIN (arg))
4850 if (arg_assoc_template_arg (k, TREE_VALUE (arg)) == 1)
4855 my_friendly_assert (TREE_CODE (n) == OVERLOAD, 980715);
4857 for (; n; n = OVL_CHAIN (n))
4858 if (arg_assoc_type (k, TREE_TYPE (OVL_FUNCTION (n))))
4865 /* Performs Koenig lookup depending on arguments, where fns
4866 are the functions found in normal lookup. */
4869 lookup_arg_dependent (name, fns, args)
4874 struct arg_lookup k;
4875 tree fn = NULL_TREE;
4879 k.classes = NULL_TREE;
4881 /* Note that we've already looked at some namespaces during normal
4882 unqualified lookup, unless we found a decl in function scope. */
4884 fn = OVL_CURRENT (fns);
4885 if (fn && TREE_CODE (fn) == FUNCTION_DECL && DECL_LOCAL_FUNCTION_P (fn))
4886 k.namespaces = NULL_TREE;
4888 unqualified_namespace_lookup (name, 0, &k.namespaces);
4890 arg_assoc_args (&k, args);
4894 /* Process a namespace-alias declaration. */
4897 do_namespace_alias (alias, namespace)
4898 tree alias, namespace;
4900 if (TREE_CODE (namespace) != NAMESPACE_DECL)
4902 /* The parser did not find it, so it's not there. */
4903 cp_error ("unknown namespace `%D'", namespace);
4907 namespace = ORIGINAL_NAMESPACE (namespace);
4909 /* Build the alias. */
4910 alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node);
4911 DECL_NAMESPACE_ALIAS (alias) = namespace;
4915 /* Check a non-member using-declaration. Return the name and scope
4916 being used, and the USING_DECL, or NULL_TREE on failure. */
4919 validate_nonmember_using_decl (decl, scope, name)
4924 if (TREE_CODE (decl) == SCOPE_REF
4925 && TREE_OPERAND (decl, 0) == std_node)
4927 if (namespace_bindings_p ()
4928 && current_namespace == global_namespace)
4929 /* There's no need for a using declaration at all, here,
4930 since `std' is the same as `::'. We can't just pass this
4931 on because we'll complain later about declaring something
4932 in the same scope as a using declaration with the same
4933 name. We return NULL_TREE which indicates to the caller
4934 that there's no need to do any further processing. */
4937 *scope = global_namespace;
4938 *name = TREE_OPERAND (decl, 1);
4940 else if (TREE_CODE (decl) == SCOPE_REF)
4942 *scope = TREE_OPERAND (decl, 0);
4943 *name = TREE_OPERAND (decl, 1);
4945 /* [namespace.udecl]
4947 A using-declaration for a class member shall be a
4948 member-declaration. */
4949 if (TREE_CODE (*scope) != NAMESPACE_DECL)
4951 if (TYPE_P (*scope))
4952 cp_error ("`%T' is not a namespace", *scope);
4954 cp_error ("`%D' is not a namespace", *scope);
4958 else if (TREE_CODE (decl) == IDENTIFIER_NODE
4959 || TREE_CODE (decl) == TYPE_DECL
4960 || TREE_CODE (decl) == TEMPLATE_DECL)
4962 *scope = global_namespace;
4966 my_friendly_abort (382);
4968 *name = DECL_NAME (*name);
4969 /* Make a USING_DECL. */
4970 return push_using_decl (*scope, *name);
4973 /* Process local and global using-declarations. */
4976 do_nonmember_using_decl (scope, name, oldval, oldtype, newval, newtype)
4978 tree oldval, oldtype;
4979 tree *newval, *newtype;
4983 *newval = *newtype = NULL_TREE;
4984 decls = make_node (CPLUS_BINDING);
4985 if (!qualified_lookup_using_namespace (name, scope, decls, 0))
4989 if (!BINDING_VALUE (decls) && !BINDING_TYPE (decls))
4991 cp_error ("`%D' not declared", name);
4995 /* Check for using functions. */
4996 if (BINDING_VALUE (decls) && is_overloaded_fn (BINDING_VALUE (decls)))
5000 if (oldval && !is_overloaded_fn (oldval))
5002 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls)), oldval);
5007 for (tmp = BINDING_VALUE (decls); tmp; tmp = OVL_NEXT (tmp))
5009 tree new_fn = OVL_CURRENT (tmp);
5011 /* [namespace.udecl]
5013 If a function declaration in namespace scope or block
5014 scope has the same name and the same parameter types as a
5015 function introduced by a using declaration the program is
5017 for (tmp1 = oldval; tmp1; tmp1 = OVL_NEXT (tmp1))
5019 tree old_fn = OVL_CURRENT (tmp1);
5021 if (!OVL_USED (tmp1)
5022 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn)),
5023 TYPE_ARG_TYPES (TREE_TYPE (old_fn))))
5025 /* There was already a non-using declaration in
5026 this scope with the same parameter types. */
5027 cp_error ("`%D' is already declared in this scope",
5031 else if (duplicate_decls (new_fn, old_fn))
5032 /* We're re-using something we already used
5033 before. We don't need to add it again. */
5037 /* If we broke out of the loop, there's no reason to add
5038 this function to the using declarations for this
5043 *newval = build_overload (OVL_CURRENT (tmp), *newval);
5044 if (TREE_CODE (*newval) != OVERLOAD)
5045 *newval = ovl_cons (*newval, NULL_TREE);
5046 OVL_USED (*newval) = 1;
5051 *newval = BINDING_VALUE (decls);
5053 duplicate_decls (*newval, oldval);
5056 *newtype = BINDING_TYPE (decls);
5057 if (oldtype && *newtype && oldtype != *newtype)
5059 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5065 /* Process a using-declaration not appearing in class or local scope. */
5068 do_toplevel_using_decl (decl)
5071 tree scope, name, binding;
5072 tree oldval, oldtype, newval, newtype;
5074 decl = validate_nonmember_using_decl (decl, &scope, &name);
5075 if (decl == NULL_TREE)
5078 binding = binding_for_name (name, current_namespace);
5080 oldval = BINDING_VALUE (binding);
5081 oldtype = BINDING_TYPE (binding);
5083 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5085 /* Copy declarations found. */
5087 BINDING_VALUE (binding) = newval;
5089 BINDING_TYPE (binding) = newtype;
5093 /* Process a using-declaration at function scope. */
5096 do_local_using_decl (decl)
5100 tree oldval, oldtype, newval, newtype;
5102 decl = validate_nonmember_using_decl (decl, &scope, &name);
5103 if (decl == NULL_TREE)
5106 oldval = lookup_name_current_level (name);
5107 oldtype = lookup_type_current_level (name);
5109 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5113 if (is_overloaded_fn (newval))
5117 /* We only need to push declarations for those functions
5118 that were not already bound in the current level.
5119 The old value might be NULL_TREE, it might be a single
5120 function, or an OVERLOAD. */
5121 if (oldval && TREE_CODE (oldval) == OVERLOAD)
5122 term = OVL_FUNCTION (oldval);
5125 for (fn = newval; fn && OVL_CURRENT (fn) != term;
5127 push_overloaded_decl (OVL_CURRENT (fn),
5128 PUSH_LOCAL | PUSH_USING);
5131 push_local_binding (name, newval, PUSH_USING);
5134 set_identifier_type_value (name, newtype);
5138 do_class_using_decl (decl)
5143 if (TREE_CODE (decl) != SCOPE_REF
5144 || !TYPE_P (TREE_OPERAND (decl, 0)))
5146 cp_error ("using-declaration for non-member at class scope");
5149 name = TREE_OPERAND (decl, 1);
5150 if (TREE_CODE (name) == BIT_NOT_EXPR)
5152 cp_error ("using-declaration for destructor");
5155 if (TREE_CODE (name) == TYPE_DECL)
5156 name = DECL_NAME (name);
5158 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 980716);
5160 value = build_lang_decl (USING_DECL, name, void_type_node);
5161 DECL_INITIAL (value) = TREE_OPERAND (decl, 0);
5165 /* Process a using-directive. */
5168 do_using_directive (namespace)
5171 if (namespace == std_node)
5173 /* using namespace A::B::C; */
5174 if (TREE_CODE (namespace) == SCOPE_REF)
5175 namespace = TREE_OPERAND (namespace, 1);
5176 if (TREE_CODE (namespace) == IDENTIFIER_NODE)
5178 /* Lookup in lexer did not find a namespace. */
5179 cp_error ("namespace `%T' undeclared", namespace);
5182 if (TREE_CODE (namespace) != NAMESPACE_DECL)
5184 cp_error ("`%T' is not a namespace", namespace);
5187 namespace = ORIGINAL_NAMESPACE (namespace);
5188 if (!toplevel_bindings_p ())
5189 push_using_directive (namespace);
5192 add_using_namespace (current_namespace, namespace, 0);
5196 check_default_args (x)
5199 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
5200 int saw_def = 0, i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
5201 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
5203 if (TREE_PURPOSE (arg))
5207 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5218 TREE_USED (decl) = 1;
5219 if (processing_template_decl)
5221 assemble_external (decl);
5223 /* Is it a synthesized method that needs to be synthesized? */
5224 if (TREE_CODE (decl) == FUNCTION_DECL
5225 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
5226 && DECL_ARTIFICIAL (decl)
5227 && ! DECL_INITIAL (decl)
5228 /* Kludge: don't synthesize for default args. */
5229 && current_function_decl)
5230 synthesize_method (decl);
5232 /* If this is a function or variable that is an instance of some
5233 template, we now know that we will need to actually do the
5234 instantiation. We check that DECL is not an explicit
5235 instantiation because that is not checked in instantiate_decl. */
5236 if ((TREE_CODE (decl) == FUNCTION_DECL || TREE_CODE (decl) == VAR_DECL)
5237 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
5238 && (!DECL_EXPLICIT_INSTANTIATION (decl)
5239 || (TREE_CODE (decl) == FUNCTION_DECL && DECL_INLINE (decl))))
5240 instantiate_decl (decl, /*defer_ok=*/1);
5243 /* Helper function for named_class_head_sans_basetype nonterminal. We
5244 have just seen something of the form `AGGR SCOPE::ID'. Return a
5245 TYPE_DECL for the type declared by ID in SCOPE. */
5248 handle_class_head (aggr, scope, id)
5249 tree aggr, scope, id;
5253 if (TREE_CODE (id) == TYPE_DECL)
5255 else if (DECL_CLASS_TEMPLATE_P (id))
5256 decl = DECL_TEMPLATE_RESULT (id);
5259 tree current = current_scope();
5261 if (current == NULL_TREE)
5262 current = current_namespace;
5263 if (scope == std_node)
5264 scope = global_namespace;
5265 if (scope == NULL_TREE)
5266 scope = global_namespace;
5267 if (scope == current)
5269 /* We've been given AGGR SCOPE::ID, when we're already inside SCOPE.
5270 Be nice about it. */
5272 cp_pedwarn ("extra qualification `%T::' on member `%D' ignored",
5273 FROB_CONTEXT (scope), id);
5275 else if (scope != global_namespace)
5276 cp_error ("`%T' does not have a nested type named `%D'", scope, id);
5278 cp_error ("no file-scope type named `%D'", id);
5280 /* Inject it at the current scope. */
5281 decl = TYPE_MAIN_DECL (xref_tag (aggr, id, 1));
5284 /* Enter the SCOPE. If this turns out not to be a definition, the
5285 parser must leave the scope. */
5286 push_scope (CP_DECL_CONTEXT (decl));
5288 /* If we see something like:
5290 template <typename T> struct S::I ....
5292 we must create a TEMPLATE_DECL for the nested type. */
5293 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5294 decl = push_template_decl (decl);
5299 /* Initialize decl2.c. */
5304 ggc_add_tree_root (&decl_namespace_list, 1);
5305 ggc_add_tree_varray_root (&deferred_fns, 1);
5306 ggc_add_tree_varray_root (&pending_statics, 1);
5307 ggc_add_tree_varray_root (&ssdf_decls, 1);
5308 ggc_add_tree_root (&ssdf_decl, 1);
5309 ggc_add_tree_root (&priority_decl, 1);
5310 ggc_add_tree_root (&initialize_p_decl, 1);
5311 ggc_add_tree_root (&pending_vtables, 1);