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));
96 extern int current_class_depth;
98 /* A list of virtual function tables we must make sure to write out. */
101 /* A list of static class variables. This is needed, because a
102 static class variable can be declared inside the class without
103 an initializer, and then initialized, staticly, outside the class. */
104 static varray_type pending_statics;
105 #define pending_statics_used \
106 (pending_statics ? pending_statics->elements_used : 0)
108 /* A list of functions which were declared inline, but which we
109 may need to emit outline anyway. */
110 static varray_type saved_inlines;
111 #define saved_inlines_used \
112 (saved_inlines ? saved_inlines->elements_used : 0)
114 /* Same, but not reset. Local temp variables and global temp variables
115 can have the same name. */
116 static int global_temp_name_counter;
118 /* Flag used when debugging spew.c */
120 extern int spew_debug;
122 /* Nonzero if we're done parsing and into end-of-file activities. */
126 /* Functions called along with real static constructors and destructors. */
128 tree static_ctors, static_dtors;
130 /* The :: namespace. */
132 tree global_namespace;
134 /* The stack for namespaces of current declarations. */
136 static tree decl_namespace_list;
139 /* C (and C++) language-specific option variables. */
141 /* Nonzero means allow type mismatches in conditional expressions;
142 just make their values `void'. */
144 int flag_cond_mismatch;
146 /* Nonzero means give `double' the same size as `float'. */
148 int flag_short_double;
150 /* Nonzero means don't recognize the keyword `asm'. */
154 /* Nonzero means don't recognize any extension keywords. */
156 int flag_no_gnu_keywords;
158 /* Nonzero means don't recognize the non-ANSI builtin functions. */
162 /* Nonzero means don't recognize the non-ANSI builtin functions.
165 int flag_no_nonansi_builtin;
167 /* Nonzero means do some things the same way PCC does. Only provided so
168 the compiler will link. */
170 int flag_traditional;
172 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
174 int flag_signed_bitfields = 1;
176 /* Nonzero means enable obscure standard features and disable GNU
177 extensions that might cause standard-compliant code to be
182 /* Nonzero means do emit exported implementations of functions even if
183 they can be inlined. */
185 int flag_implement_inlines = 1;
187 /* Nonzero means do emit exported implementations of templates, instead of
188 multiple static copies in each file that needs a definition. */
190 int flag_external_templates;
192 /* Nonzero means that the decision to emit or not emit the implementation of a
193 template depends on where the template is instantiated, rather than where
196 int flag_alt_external_templates;
198 /* Nonzero means that implicit instantiations will be emitted if needed. */
200 int flag_implicit_templates = 1;
202 /* Nonzero means that implicit instantiations of inline templates will be
203 emitted if needed, even if instantiations of non-inline templates
206 int flag_implicit_inline_templates = 1;
208 /* Nonzero means warn about implicit declarations. */
210 int warn_implicit = 1;
212 /* Nonzero means warn about usage of long long when `-pedantic'. */
214 int warn_long_long = 1;
216 /* Nonzero means warn when all ctors or dtors are private, and the class
219 int warn_ctor_dtor_privacy = 1;
221 /* True if we want to implement vtables using "thunks".
222 The default is off. */
224 #ifndef DEFAULT_VTABLE_THUNKS
225 #define DEFAULT_VTABLE_THUNKS 0
227 int flag_vtable_thunks = DEFAULT_VTABLE_THUNKS;
229 /* Nonzero means generate separate instantiation control files and juggle
230 them at link time. */
232 int flag_use_repository;
234 /* Nonzero if we want to issue diagnostics that the standard says are not
237 int flag_optional_diags = 1;
239 /* Nonzero means give string constants the type `const char *', as mandated
242 int flag_const_strings = 1;
244 /* If non-NULL, dump the tree structure for the entire translation
245 unit to this file. */
247 char *flag_dump_translation_unit = 0;
249 /* Nonzero means warn about deprecated conversion from string constant to
252 int warn_write_strings;
254 /* Nonzero means warn about pointer casts that can drop a type qualifier
255 from the pointer target type. */
259 /* Nonzero means warn about sizeof(function) or addition/subtraction
260 of function pointers. */
262 int warn_pointer_arith = 1;
264 /* Nonzero means warn for any function def without prototype decl. */
266 int warn_missing_prototypes;
268 /* Nonzero means warn about multiple (redundant) decls for the same single
269 variable or function. */
271 int warn_redundant_decls;
273 /* Warn if initializer is not completely bracketed. */
275 int warn_missing_braces;
277 /* Warn about comparison of signed and unsigned values. */
279 int warn_sign_compare;
281 /* Warn about testing equality of floating point numbers. */
283 int warn_float_equal = 0;
285 /* Warn about *printf or *scanf format/argument anomalies. */
289 /* Warn about a subscript that has type char. */
291 int warn_char_subscripts;
293 /* Warn if a type conversion is done that might have confusing results. */
297 /* Warn if adding () is suggested. */
299 int warn_parentheses;
301 /* Non-zero means warn in function declared in derived class has the
302 same name as a virtual in the base class, but fails to match the
303 type signature of any virtual function in the base class. */
304 int warn_overloaded_virtual;
306 /* Non-zero means warn when declaring a class that has a non virtual
307 destructor, when it really ought to have a virtual one. */
310 /* Non-zero means warn when a function is declared extern and later inline. */
311 int warn_extern_inline;
313 /* Non-zero means warn when the compiler will reorder code. */
316 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
319 /* Non-zero means warn when we convert a pointer to member function
320 into a pointer to (void or function). */
321 int warn_pmf2ptr = 1;
323 /* Nonzero means warn about violation of some Effective C++ style rules. */
327 /* Nonzero means warn where overload resolution chooses a promotion from
328 unsigned to signed over a conversion to an unsigned of the same size. */
332 /* Nonzero means warn when an old-style cast is used. */
334 int warn_old_style_cast;
336 /* Warn about #pragma directives that are not recognised. */
338 int warn_unknown_pragmas; /* Tri state variable. */
340 /* Nonzero means warn about use of multicharacter literals. */
342 int warn_multichar = 1;
344 /* Nonzero means warn when non-templatized friend functions are
345 declared within a template */
347 int warn_nontemplate_friend = 1;
349 /* Nonzero means complain about deprecated features. */
351 int warn_deprecated = 1;
353 /* Nonzero means `$' can be in an identifier. */
355 #ifndef DOLLARS_IN_IDENTIFIERS
356 #define DOLLARS_IN_IDENTIFIERS 1
358 int dollars_in_ident = DOLLARS_IN_IDENTIFIERS;
360 /* Nonzero for -fno-strict-prototype switch: do not consider empty
361 argument prototype to mean function takes no arguments. */
363 int flag_strict_prototype = 2;
364 int strict_prototype = 1;
365 int strict_prototypes_lang_c, strict_prototypes_lang_cplusplus = 1;
367 /* Nonzero means that labels can be used as first-class objects */
371 /* Nonzero means allow Microsoft extensions without a pedwarn. */
373 int flag_ms_extensions;
375 /* Non-zero means to collect statistics which might be expensive
376 and to print them when we are done. */
377 int flag_detailed_statistics;
379 /* C++ specific flags. */
380 /* Zero means that `this' is a *const. This gives nice behavior in the
381 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
382 -2 means we're constructing an object and it has fixed type. */
384 int flag_this_is_variable;
386 /* Nonzero means we should attempt to elide constructors when possible. */
388 int flag_elide_constructors = 1;
390 /* Nonzero means that member functions defined in class scope are
391 inline by default. */
393 int flag_default_inline = 1;
395 /* Controls whether compiler generates 'type descriptor' that give
396 run-time type information. */
399 /* Nonzero if we wish to output cross-referencing information
400 for the GNU class browser. */
401 extern int flag_gnu_xref;
403 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
406 int flag_huge_objects;
408 /* Nonzero if we want to conserve space in the .o files. We do this
409 by putting uninitialized data and runtime initialized data into
410 .common instead of .data at the expense of not flagging multiple
413 int flag_conserve_space;
415 /* Nonzero if we want to obey access control semantics. */
417 int flag_access_control = 1;
419 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
421 int flag_operator_names;
423 /* Nonzero if we want to check the return value of new and avoid calling
424 constructors if it is a null pointer. */
428 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
429 initialization variables.
430 0: Old rules, set by -fno-for-scope.
431 2: New ISO rules, set by -ffor-scope.
432 1: Try to implement new ISO rules, but with backup compatibility
433 (and warnings). This is the default, for now. */
435 int flag_new_for_scope = 1;
437 /* Nonzero if we want to emit defined symbols with common-like linkage as
438 weak symbols where possible, in order to conform to C++ semantics.
439 Otherwise, emit them as local symbols. */
443 /* Nonzero to enable experimental ABI changes. */
447 /* Nonzero to use __cxa_atexit, rather than atexit, to register
448 destructors for local statics and global objects. */
450 int flag_use_cxa_atexit;
452 /* Nonzero to not ignore namespace std. */
456 /* Nonzero if we should expand functions calls inline at the tree
457 level, rather than at the RTL level. */
459 int flag_inline_trees = 0;
461 /* Maximum template instantiation depth. Must be at least 17 for ISO
464 int max_tinst_depth = 17;
466 /* The name-mangling scheme to use. Must be 1 or greater to support
467 template functions with identical types, but different template
469 int name_mangling_version = 2;
471 /* Nonzero means that guiding declarations are allowed. */
472 int flag_guiding_decls;
474 /* Nonzero if wchar_t should be `unsigned short' instead of whatever it
475 would normally be, for use with WINE. */
476 int flag_short_wchar;
478 /* Nonzero if squashed mangling is to be performed.
479 This uses the B and K codes to reference previously seen class types
480 and class qualifiers. */
481 int flag_do_squangling;
483 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
487 /* Nonzero means make the default pedwarns warnings instead of errors.
488 The value of this flag is ignored if -pedantic is specified. */
492 /* If this variable is defined to a non-NULL value, it will be called
493 after the file has been completely parsed. */
495 void (*back_end_hook) PARAMS ((tree));
497 /* Table of language-dependent -f options.
498 STRING is the option name. VARIABLE is the address of the variable.
499 ON_VALUE is the value to store in VARIABLE
500 if `-fSTRING' is seen as an option.
501 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
503 static struct { const char *string; int *variable; int on_value;}
507 {"signed-char", &flag_signed_char, 1},
508 {"unsigned-char", &flag_signed_char, 0},
509 {"signed-bitfields", &flag_signed_bitfields, 1},
510 {"unsigned-bitfields", &flag_signed_bitfields, 0},
511 {"short-enums", &flag_short_enums, 1},
512 {"short-double", &flag_short_double, 1},
513 {"short-wchar", &flag_short_wchar, 1},
514 {"cond-mismatch", &flag_cond_mismatch, 1},
515 {"asm", &flag_no_asm, 0},
516 {"builtin", &flag_no_builtin, 0},
518 /* C++-only options. */
519 {"access-control", &flag_access_control, 1},
520 {"check-new", &flag_check_new, 1},
521 {"conserve-space", &flag_conserve_space, 1},
522 {"const-strings", &flag_const_strings, 1},
523 {"default-inline", &flag_default_inline, 1},
524 {"dollars-in-identifiers", &dollars_in_ident, 1},
525 {"elide-constructors", &flag_elide_constructors, 1},
526 {"external-templates", &flag_external_templates, 1},
527 {"for-scope", &flag_new_for_scope, 2},
528 {"gnu-keywords", &flag_no_gnu_keywords, 0},
529 {"handle-exceptions", &flag_exceptions, 1},
530 {"honor-std", &flag_honor_std, 1},
531 {"huge-objects", &flag_huge_objects, 1},
532 {"implement-inlines", &flag_implement_inlines, 1},
533 {"implicit-inline-templates", &flag_implicit_inline_templates, 1},
534 {"implicit-templates", &flag_implicit_templates, 1},
535 {"labels-ok", &flag_labels_ok, 1},
536 {"ms-extensions", &flag_ms_extensions, 1},
537 {"nonansi-builtins", &flag_no_nonansi_builtin, 0},
538 {"operator-names", &flag_operator_names, 1},
539 {"optional-diags", &flag_optional_diags, 1},
540 {"permissive", &flag_permissive, 1},
541 {"repo", &flag_use_repository, 1},
542 {"rtti", &flag_rtti, 1},
543 {"squangle", &flag_do_squangling, 1},
544 {"stats", &flag_detailed_statistics, 1},
545 {"strict-prototype", &flag_strict_prototype, 1},
546 {"use-cxa-atexit", &flag_use_cxa_atexit, 1},
547 {"vtable-gc", &flag_vtable_gc, 1},
548 {"vtable-thunks", &flag_vtable_thunks, 1},
549 {"weak", &flag_weak, 1},
550 {"xref", &flag_gnu_xref, 1}
553 /* Decode the string P as a language-specific option.
554 Return the number of strings consumed for a valid option.
555 Otherwise return 0. Should not complain if it does not
556 recognise the option. */
559 lang_decode_option (argc, argv)
568 int strings_processed;
571 strings_processed = cpp_handle_option (&parse_in, argc, argv);
573 strings_processed = 0;
574 #endif /* ! USE_CPPLIB */
576 if (!strcmp (p, "-ftraditional") || !strcmp (p, "-traditional"))
578 else if (p[0] == '-' && p[1] == 'f')
580 /* Some kind of -f option.
581 P's value is the option sans `-f'.
582 Search for it in the table of options. */
586 /* Try special -f options. */
588 if (!strcmp (p, "handle-exceptions")
589 || !strcmp (p, "no-handle-exceptions"))
590 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
591 else if (!strcmp (p, "all-virtual")
592 || !strcmp (p, "enum-int-equiv")
593 || !strcmp (p, "no-nonnull-objects")
594 || !strcmp (p, "this-is-variable"))
595 warning ("-f%s is no longer supported", p);
596 else if (! strcmp (p, "alt-external-templates"))
598 flag_external_templates = 1;
599 flag_alt_external_templates = 1;
600 cp_deprecated ("-falt-external-templates");
602 else if (! strcmp (p, "no-alt-external-templates"))
603 flag_alt_external_templates = 0;
604 else if (!strcmp (p, "repo"))
606 flag_use_repository = 1;
607 flag_implicit_templates = 0;
609 else if (!strcmp (p, "guiding-decls"))
611 flag_guiding_decls = 1;
612 name_mangling_version = 0;
614 else if (!strcmp (p, "no-guiding-decls"))
615 flag_guiding_decls = 0;
616 else if (!strcmp (p, "external-templates"))
618 flag_external_templates = 1;
619 cp_deprecated ("-fexternal-templates");
621 else if (!strcmp (p, "new-abi"))
624 flag_do_squangling = 1;
625 flag_vtable_thunks = 1;
627 else if (!strcmp (p, "no-new-abi"))
630 flag_do_squangling = 0;
632 else if (!strncmp (p, "template-depth-", 15))
634 = read_integral_parameter (p + 15, p - 2, max_tinst_depth);
635 else if (!strncmp (p, "name-mangling-version-", 22))
636 name_mangling_version
637 = read_integral_parameter (p + 22, p - 2, name_mangling_version);
638 else if (!strncmp (p, "message-length=", 15))
640 (read_integral_parameter (p + 15, p - 2,
641 /* default line-wrap length */ 72));
642 else if (!strncmp (p, "dump-translation-unit-", 22))
645 error ("no file specified with -fdump-translation-unit");
647 flag_dump_translation_unit = p + 22;
654 !found && j < (sizeof (lang_f_options)
655 / sizeof (lang_f_options[0]));
658 if (!strcmp (p, lang_f_options[j].string))
660 *lang_f_options[j].variable = lang_f_options[j].on_value;
661 /* A goto here would be cleaner,
662 but breaks the vax pcc. */
665 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-'
666 && ! strcmp (p+3, lang_f_options[j].string))
668 *lang_f_options[j].variable = ! lang_f_options[j].on_value;
676 else if (p[0] == '-' && p[1] == 'W')
680 /* The -W options control the warning behavior of the compiler. */
683 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-')
686 if (!strcmp (p, "implicit"))
687 warn_implicit = setting;
688 else if (!strcmp (p, "long-long"))
689 warn_long_long = setting;
690 else if (!strcmp (p, "return-type"))
691 warn_return_type = setting;
692 else if (!strcmp (p, "ctor-dtor-privacy"))
693 warn_ctor_dtor_privacy = setting;
694 else if (!strcmp (p, "write-strings"))
695 warn_write_strings = setting;
696 else if (!strcmp (p, "cast-qual"))
697 warn_cast_qual = setting;
698 else if (!strcmp (p, "char-subscripts"))
699 warn_char_subscripts = setting;
700 else if (!strcmp (p, "pointer-arith"))
701 warn_pointer_arith = setting;
702 else if (!strcmp (p, "missing-prototypes"))
703 warn_missing_prototypes = setting;
704 else if (!strcmp (p, "redundant-decls"))
705 warn_redundant_decls = setting;
706 else if (!strcmp (p, "missing-braces"))
707 warn_missing_braces = setting;
708 else if (!strcmp (p, "sign-compare"))
709 warn_sign_compare = setting;
710 else if (!strcmp (p, "float-equal"))
711 warn_float_equal = setting;
712 else if (!strcmp (p, "format"))
713 warn_format = setting;
714 else if (!strcmp (p, "conversion"))
715 warn_conversion = setting;
716 else if (!strcmp (p, "parentheses"))
717 warn_parentheses = setting;
718 else if (!strcmp (p, "non-virtual-dtor"))
719 warn_nonvdtor = setting;
720 else if (!strcmp (p, "extern-inline"))
721 warn_extern_inline = setting;
722 else if (!strcmp (p, "reorder"))
723 warn_reorder = setting;
724 else if (!strcmp (p, "synth"))
725 warn_synth = setting;
726 else if (!strcmp (p, "pmf-conversions"))
727 warn_pmf2ptr = setting;
728 else if (!strcmp (p, "effc++"))
730 else if (!strcmp (p, "sign-promo"))
731 warn_sign_promo = setting;
732 else if (!strcmp (p, "old-style-cast"))
733 warn_old_style_cast = setting;
734 else if (!strcmp (p, "overloaded-virtual"))
735 warn_overloaded_virtual = setting;
736 else if (!strcmp (p, "multichar"))
737 warn_multichar = setting;
738 else if (!strcmp (p, "unknown-pragmas"))
739 /* Set to greater than 1, so that even unknown pragmas in
740 system headers will be warned about. */
741 warn_unknown_pragmas = setting * 2;
742 else if (!strcmp (p, "non-template-friend"))
743 warn_nontemplate_friend = setting;
744 else if (!strcmp (p, "deprecated"))
745 warn_deprecated = setting;
746 else if (!strcmp (p, "comment"))
747 ; /* cpp handles this one. */
748 else if (!strcmp (p, "comments"))
749 ; /* cpp handles this one. */
750 else if (!strcmp (p, "trigraphs"))
751 ; /* cpp handles this one. */
752 else if (!strcmp (p, "import"))
753 ; /* cpp handles this one. */
754 else if (!strcmp (p, "all"))
756 warn_return_type = setting;
757 warn_unused = setting;
758 warn_implicit = setting;
759 warn_switch = setting;
760 warn_format = setting;
761 warn_parentheses = setting;
762 warn_missing_braces = setting;
763 warn_sign_compare = setting;
764 warn_multichar = setting;
765 /* We save the value of warn_uninitialized, since if they put
766 -Wuninitialized on the command line, we need to generate a
767 warning about not using it without also specifying -O. */
768 if (warn_uninitialized != 1)
769 warn_uninitialized = (setting ? 2 : 0);
770 /* Only warn about unknown pragmas that are not in system
772 warn_unknown_pragmas = 1;
774 /* C++-specific warnings. */
775 warn_ctor_dtor_privacy = setting;
776 warn_nonvdtor = setting;
777 warn_reorder = setting;
778 warn_nontemplate_friend = setting;
780 else return strings_processed;
782 else if (!strcmp (p, "-ansi"))
783 flag_no_nonansi_builtin = 1, flag_ansi = 1,
784 flag_no_gnu_keywords = 1, flag_operator_names = 1;
786 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
787 it's probably safe to assume no sane person would ever want to use this
788 under normal circumstances. */
789 else if (!strcmp (p, "-spew-debug"))
793 return strings_processed;
798 /* Incorporate `const' and `volatile' qualifiers for member functions.
799 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
800 QUALS is a list of qualifiers. Returns any explicit
801 top-level qualifiers of the method's this pointer, anything other than
802 TYPE_UNQUALIFIED will be an extension. */
805 grok_method_quals (ctype, function, quals)
806 tree ctype, function, quals;
808 tree fntype = TREE_TYPE (function);
809 tree raises = TYPE_RAISES_EXCEPTIONS (fntype);
810 int type_quals = TYPE_UNQUALIFIED;
811 int dup_quals = TYPE_UNQUALIFIED;
812 int this_quals = TYPE_UNQUALIFIED;
816 int tq = cp_type_qual_from_rid (TREE_VALUE (quals));
818 if ((type_quals | this_quals) & tq)
820 else if (tq & TYPE_QUAL_RESTRICT)
824 quals = TREE_CHAIN (quals);
828 if (dup_quals != TYPE_UNQUALIFIED)
829 cp_error ("duplicate type qualifiers in %s declaration",
830 TREE_CODE (function) == FUNCTION_DECL
831 ? "member function" : "type");
833 ctype = cp_build_qualified_type (ctype, type_quals);
834 fntype = build_cplus_method_type (ctype, TREE_TYPE (fntype),
835 (TREE_CODE (fntype) == METHOD_TYPE
836 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
837 : TYPE_ARG_TYPES (fntype)));
839 fntype = build_exception_variant (fntype, raises);
841 TREE_TYPE (function) = fntype;
845 /* Warn when -fexternal-templates is used and #pragma
846 interface/implementation is not used all the times it should be,
850 warn_if_unknown_interface (decl)
853 static int already_warned = 0;
854 if (already_warned++)
857 if (flag_alt_external_templates)
859 struct tinst_level *til = tinst_for_decl ();
861 char *sf = input_filename;
866 input_filename = til->file;
868 cp_warning ("template `%#D' instantiated in file without #pragma interface",
874 cp_warning_at ("template `%#D' defined in file without #pragma interface",
878 /* A subroutine of the parser, to handle a component list. */
881 grok_x_components (specs)
884 struct pending_inline **p;
887 specs = strip_attrs (specs);
889 check_tag_decl (specs);
890 t = groktypename (build_decl_list (specs, NULL_TREE));
892 /* The only case where we need to do anything additional here is an
893 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
894 if (t == NULL_TREE || !ANON_AGGR_TYPE_P (t))
897 fixup_anonymous_aggr (t);
898 finish_member_declaration (build_lang_decl (FIELD_DECL, NULL_TREE, t));
900 /* Ignore any inline function definitions in the anonymous union
901 since an anonymous union may not have function members. */
902 p = &pending_inlines;
903 for (; *p; *p = (*p)->next)
904 if (DECL_CONTEXT ((*p)->fndecl) != t)
908 /* Constructors for types with virtual baseclasses need an "in-charge" flag
909 saying whether this constructor is responsible for initialization of
910 virtual baseclasses or not. All destructors also need this "in-charge"
911 flag, which additionally determines whether or not the destructor should
912 free the memory for the object.
914 This function adds the "in-charge" flag to member function FN if
915 appropriate. It is called from grokclassfn and tsubst.
916 FN must be either a constructor or destructor. */
919 maybe_retrofit_in_chrg (fn)
922 tree basetype, arg_types, parms, parm, fntype;
924 if (DECL_CONSTRUCTOR_P (fn)
925 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn))
926 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn))
928 else if (! DECL_CONSTRUCTOR_P (fn)
929 && TREE_CHAIN (DECL_ARGUMENTS (fn)) == NULL_TREE)
934 if (DECL_CONSTRUCTOR_P (fn))
935 DECL_CONSTRUCTOR_FOR_VBASE_P (fn) = 1;
937 /* First add it to DECL_ARGUMENTS... */
938 parm = build_decl (PARM_DECL, in_charge_identifier, integer_type_node);
939 /* Mark the artificial `__in_chrg' parameter as "artificial". */
940 SET_DECL_ARTIFICIAL (parm);
941 DECL_ARG_TYPE (parm) = integer_type_node;
942 TREE_READONLY (parm) = 1;
943 parms = DECL_ARGUMENTS (fn);
944 TREE_CHAIN (parm) = TREE_CHAIN (parms);
945 TREE_CHAIN (parms) = parm;
947 /* ...and then to TYPE_ARG_TYPES. */
948 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
949 basetype = TREE_TYPE (TREE_VALUE (arg_types));
950 arg_types = hash_tree_chain (integer_type_node, TREE_CHAIN (arg_types));
951 fntype = build_cplus_method_type (basetype, TREE_TYPE (TREE_TYPE (fn)),
953 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
954 fntype = build_exception_variant (fntype,
955 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
956 TREE_TYPE (fn) = fntype;
959 /* Classes overload their constituent function names automatically.
960 When a function name is declared in a record structure,
961 its name is changed to it overloaded name. Since names for
962 constructors and destructors can conflict, we place a leading
965 CNAME is the name of the class we are grokking for.
967 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
969 FLAGS contains bits saying what's special about today's
970 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
972 If FUNCTION is a destructor, then we must add the `auto-delete' field
973 as a second parameter. There is some hair associated with the fact
974 that we must "declare" this variable in the manner consistent with the
975 way the rest of the arguments were declared.
977 QUALS are the qualifiers for the this pointer. */
980 grokclassfn (ctype, function, flags, quals)
981 tree ctype, function;
982 enum overload_flags flags;
985 tree fn_name = DECL_NAME (function);
986 int this_quals = TYPE_UNQUALIFIED;
988 if (fn_name == NULL_TREE)
990 error ("name missing for member function");
991 fn_name = get_identifier ("<anonymous>");
992 DECL_NAME (function) = fn_name;
996 this_quals = grok_method_quals (ctype, function, quals);
998 if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1000 /* Must add the class instance variable up front. */
1001 /* Right now we just make this a pointer. But later
1002 we may wish to make it special. */
1003 tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function)));
1005 tree parm = build_decl (PARM_DECL, this_identifier,
1006 cp_build_qualified_type (type, this_quals | TYPE_QUAL_CONST));
1007 /* Mark the artificial `this' parameter as "artificial". */
1008 SET_DECL_ARTIFICIAL (parm);
1009 DECL_ARG_TYPE (parm) = type;
1010 /* We can make this a register, so long as we don't
1011 accidentally complain if someone tries to take its address. */
1012 DECL_REGISTER (parm) = 1;
1013 TREE_CHAIN (parm) = last_function_parms;
1014 last_function_parms = parm;
1017 DECL_ARGUMENTS (function) = last_function_parms;
1018 DECL_CONTEXT (function) = ctype;
1020 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
1021 maybe_retrofit_in_chrg (function);
1023 if (flags == DTOR_FLAG)
1025 DECL_ASSEMBLER_NAME (function) = build_destructor_name (ctype);
1026 TYPE_HAS_DESTRUCTOR (ctype) = 1;
1029 set_mangled_name_for_decl (function);
1032 /* Work on the expr used by alignof (this is only called by the parser). */
1041 if (processing_template_decl)
1042 return build_min (ALIGNOF_EXPR, sizetype, expr);
1044 if (TREE_CODE (expr) == COMPONENT_REF
1045 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
1046 error ("`__alignof__' applied to a bit-field");
1048 if (TREE_CODE (expr) == INDIRECT_REF)
1050 best = t = TREE_OPERAND (expr, 0);
1051 bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1053 while (TREE_CODE (t) == NOP_EXPR
1054 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
1057 t = TREE_OPERAND (t, 0);
1058 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1059 if (thisalign > bestalign)
1060 best = t, bestalign = thisalign;
1062 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
1065 return c_alignof (TREE_TYPE (expr));
1068 /* Create an ARRAY_REF, checking for the user doing things backwards
1072 grok_array_decl (array_expr, index_exp)
1073 tree array_expr, index_exp;
1075 tree type = TREE_TYPE (array_expr);
1076 tree p1, p2, i1, i2;
1078 if (type == error_mark_node || index_exp == error_mark_node)
1079 return error_mark_node;
1080 if (processing_template_decl)
1081 return build_min (ARRAY_REF, type ? TREE_TYPE (type) : NULL_TREE,
1082 array_expr, index_exp);
1084 if (type == NULL_TREE)
1086 /* Something has gone very wrong. Assume we are mistakenly reducing
1087 an expression instead of a declaration. */
1088 error ("parser may be lost: is there a '{' missing somewhere?");
1092 if (TREE_CODE (type) == OFFSET_TYPE
1093 || TREE_CODE (type) == REFERENCE_TYPE)
1094 type = TREE_TYPE (type);
1096 /* If they have an `operator[]', use that. */
1097 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
1098 return build_opfncall (ARRAY_REF, LOOKUP_NORMAL,
1099 array_expr, index_exp, NULL_TREE);
1101 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1102 is a little-known fact that, if `a' is an array and `i' is an
1103 int, you can write `i[a]', which means the same thing as `a[i]'. */
1105 if (TREE_CODE (type) == ARRAY_TYPE)
1108 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, 0);
1110 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
1113 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, 0);
1115 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr, 0);
1116 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp, 0);
1118 if ((p1 && i2) && (i1 && p2))
1119 error ("ambiguous conversion for array subscript");
1122 array_expr = p1, index_exp = i2;
1124 array_expr = p2, index_exp = i1;
1127 cp_error ("invalid types `%T[%T]' for array subscript",
1128 type, TREE_TYPE (index_exp));
1129 return error_mark_node;
1132 if (array_expr == error_mark_node || index_exp == error_mark_node)
1133 error ("ambiguous conversion for array subscript");
1135 return build_array_ref (array_expr, index_exp);
1138 /* Given the cast expression EXP, checking out its validity. Either return
1139 an error_mark_node if there was an unavoidable error, return a cast to
1140 void for trying to delete a pointer w/ the value 0, or return the
1141 call to delete. If DOING_VEC is 1, we handle things differently
1142 for doing an array delete. If DOING_VEC is 2, they gave us the
1143 array size as an argument to delete.
1144 Implements ARM $5.3.4. This is called from the parser. */
1147 delete_sanity (exp, size, doing_vec, use_global_delete)
1149 int doing_vec, use_global_delete;
1152 /* For a regular vector delete (aka, no size argument) we will pass
1153 this down as a NULL_TREE into build_vec_delete. */
1154 tree maxindex = NULL_TREE;
1156 if (exp == error_mark_node)
1159 if (processing_template_decl)
1161 t = build_min (DELETE_EXPR, void_type_node, exp, size);
1162 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
1163 DELETE_EXPR_USE_VEC (t) = doing_vec;
1167 if (TREE_CODE (exp) == OFFSET_REF)
1168 exp = resolve_offset_ref (exp);
1169 exp = convert_from_reference (exp);
1170 t = stabilize_reference (exp);
1171 t = build_expr_type_conversion (WANT_POINTER, t, 1);
1173 if (t == NULL_TREE || t == error_mark_node)
1175 cp_error ("type `%#T' argument given to `delete', expected pointer",
1177 return error_mark_node;
1182 maxindex = build_binary_op (MINUS_EXPR, size, integer_one_node);
1183 pedwarn ("anachronistic use of array size in vector delete");
1186 type = TREE_TYPE (t);
1188 /* As of Valley Forge, you can delete a pointer to const. */
1190 /* You can't delete functions. */
1191 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
1193 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
1194 return error_mark_node;
1197 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1198 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
1199 cp_warning ("`%T' is not a pointer-to-object type", type);
1201 /* An array can't have been allocated by new, so complain. */
1202 if (TREE_CODE (t) == ADDR_EXPR
1203 && TREE_CODE (TREE_OPERAND (t, 0)) == VAR_DECL
1204 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == ARRAY_TYPE)
1205 cp_warning ("deleting array `%#D'", TREE_OPERAND (t, 0));
1207 /* Deleting a pointer with the value zero is valid and has no effect. */
1208 if (integer_zerop (t))
1209 return build1 (NOP_EXPR, void_type_node, t);
1212 return build_vec_delete (t, maxindex, integer_one_node, use_global_delete);
1215 if (IS_AGGR_TYPE (TREE_TYPE (type))
1216 && TYPE_GETS_REG_DELETE (TREE_TYPE (type)))
1218 /* Only do access checking here; we'll be calling op delete
1219 from the destructor. */
1220 tree tmp = build_op_delete_call (DELETE_EXPR, t, size_zero_node,
1221 LOOKUP_NORMAL, NULL_TREE);
1222 if (tmp == error_mark_node)
1223 return error_mark_node;
1226 return build_delete (type, t, integer_three_node,
1227 LOOKUP_NORMAL, use_global_delete);
1231 /* Report an error if the indicated template declaration is not the
1232 sort of thing that should be a member template. */
1235 check_member_template (tmpl)
1240 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
1241 decl = DECL_TEMPLATE_RESULT (tmpl);
1243 if (TREE_CODE (decl) == FUNCTION_DECL
1244 || (TREE_CODE (decl) == TYPE_DECL
1245 && IS_AGGR_TYPE (TREE_TYPE (decl))))
1247 if (current_function_decl)
1248 /* 14.5.2.2 [temp.mem]
1250 A local class shall not have member templates. */
1251 cp_error ("invalid declaration of member template `%#D' in local class",
1254 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
1256 /* 14.5.2.3 [temp.mem]
1258 A member function template shall not be virtual. */
1260 ("invalid use of `virtual' in template declaration of `%#D'",
1262 DECL_VIRTUAL_P (decl) = 0;
1265 /* The debug-information generating code doesn't know what to do
1266 with member templates. */
1267 DECL_IGNORED_P (tmpl) = 1;
1270 cp_error ("template declaration of `%#D'", decl);
1273 /* Return true iff TYPE is a valid Java parameter or return type. */
1276 acceptable_java_type (type)
1279 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
1281 if (TREE_CODE (type) == POINTER_TYPE)
1283 type = TREE_TYPE (type);
1284 if (TREE_CODE (type) == RECORD_TYPE)
1287 if (! TYPE_FOR_JAVA (type))
1289 if (! CLASSTYPE_TEMPLATE_INFO (type))
1291 args = CLASSTYPE_TI_ARGS (type);
1292 i = TREE_VEC_LENGTH (args);
1295 type = TREE_VEC_ELT (args, i);
1296 if (TREE_CODE (type) == POINTER_TYPE)
1297 type = TREE_TYPE (type);
1298 if (! TYPE_FOR_JAVA (type))
1307 /* For a METHOD in a Java class CTYPE, return 1 if
1308 the parameter and return types are valid Java types.
1309 Otherwise, print appropriate error messages, and return 0. */
1312 check_java_method (method)
1316 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
1317 tree ret_type = TREE_TYPE (TREE_TYPE (method));
1318 if (! acceptable_java_type (ret_type))
1320 cp_error ("Java method '%D' has non-Java return type `%T'",
1324 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
1326 tree type = TREE_VALUE (arg_types);
1327 if (! acceptable_java_type (type))
1329 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1334 return jerr ? 0 : 1;
1337 /* Sanity check: report error if this function FUNCTION is not
1338 really a member of the class (CTYPE) it is supposed to belong to.
1339 CNAME is the same here as it is for grokclassfn above. */
1342 check_classfn (ctype, function)
1343 tree ctype, function;
1345 tree fn_name = DECL_NAME (function);
1346 tree fndecl, fndecls;
1347 tree method_vec = CLASSTYPE_METHOD_VEC (complete_type (ctype));
1351 if (DECL_USE_TEMPLATE (function)
1352 && is_member_template (DECL_TI_TEMPLATE (function)))
1353 /* Since this is a specialization of a member template,
1354 we're not going to find the declaration in the class.
1357 struct S { template <typename T> void f(T); };
1358 template <> void S::f(int);
1360 we're not going to find `S::f(int)', but there's no
1361 reason we should, either. We let our callers know we didn't
1362 find the method, but we don't complain. */
1365 if (method_vec != 0)
1367 methods = &TREE_VEC_ELT (method_vec, 0);
1368 end = TREE_VEC_END (method_vec);
1370 /* First suss out ctors and dtors. */
1371 if (*methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1372 && DECL_CONSTRUCTOR_P (function))
1374 if (*++methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1375 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function)))
1378 while (++methods != end && *methods)
1381 if (fn_name == DECL_NAME (OVL_CURRENT (*methods)))
1384 for (fndecls = *methods; fndecls != NULL_TREE;
1385 fndecls = OVL_NEXT (fndecls))
1387 fndecl = OVL_CURRENT (fndecls);
1388 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1389 for a for member function of a template class, is
1390 not mangled, so the check below does not work
1391 correctly in that case. Since mangled destructor
1392 names do not include the type of the arguments,
1393 we can't use this short-cut for them, either.
1394 (It's not legal to declare arguments for a
1395 destructor, but some people try.) */
1396 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function))
1397 && (DECL_ASSEMBLER_NAME (function)
1398 != DECL_NAME (function))
1399 && (DECL_ASSEMBLER_NAME (fndecl)
1400 != DECL_NAME (fndecl))
1401 && (DECL_ASSEMBLER_NAME (function)
1402 == DECL_ASSEMBLER_NAME (fndecl)))
1405 /* We cannot simply call decls_match because this
1406 doesn't work for static member functions that are
1407 pretending to be methods, and because the name
1408 may have been changed by asm("new_name"). */
1409 if (DECL_NAME (function) == DECL_NAME (fndecl))
1411 tree p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
1412 tree p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1414 /* Get rid of the this parameter on functions that become
1416 if (DECL_STATIC_FUNCTION_P (fndecl)
1417 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1418 p1 = TREE_CHAIN (p1);
1420 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
1421 TREE_TYPE (TREE_TYPE (fndecl)))
1422 && compparms (p1, p2)
1423 && (DECL_TEMPLATE_SPECIALIZATION (function)
1424 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
1425 && (!DECL_TEMPLATE_SPECIALIZATION (function)
1426 || (DECL_TI_TEMPLATE (function)
1427 == DECL_TI_TEMPLATE (fndecl))))
1436 if (methods != end && *methods)
1438 tree fndecl = *methods;
1439 cp_error ("prototype for `%#D' does not match any in class `%T'",
1441 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl) ? "s are" : " is",
1442 OVL_CURRENT (fndecl));
1443 while (fndecl = OVL_NEXT (fndecl), fndecl)
1444 cp_error_at (" %#D", OVL_CURRENT(fndecl));
1449 if (TYPE_SIZE (ctype) == 0)
1450 incomplete_type_error (function, ctype);
1452 cp_error ("no `%#D' member function declared in class `%T'",
1456 /* If we did not find the method in the class, add it to avoid
1457 spurious errors (unless the CTYPE is not yet defined, in which
1458 case we'll only confuse ourselves when the function is declared
1459 properly within the class. */
1460 if (TYPE_SIZE (ctype))
1461 add_method (ctype, methods, function);
1465 /* We have just processed the DECL, which is a static data member.
1466 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1467 present, is the assembly-language name for the data member.
1468 FLAGS is as for cp_finish_decl. */
1471 finish_static_data_member_decl (decl, init, asmspec_tree, flags)
1477 const char *asmspec = 0;
1480 asmspec = TREE_STRING_POINTER (asmspec_tree);
1482 my_friendly_assert (TREE_PUBLIC (decl), 0);
1484 /* We cannot call pushdecl here, because that would fill in the
1485 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1486 the right thing, namely, to put this decl out straight away. */
1487 /* current_class_type can be NULL_TREE in case of error. */
1488 if (!asmspec && current_class_type)
1490 DECL_INITIAL (decl) = error_mark_node;
1491 DECL_ASSEMBLER_NAME (decl)
1492 = build_static_name (current_class_type, DECL_NAME (decl));
1494 if (! processing_template_decl)
1496 if (!pending_statics)
1497 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
1498 VARRAY_PUSH_TREE (pending_statics, decl);
1501 /* Static consts need not be initialized in the class definition. */
1502 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
1504 static int explanation = 0;
1506 error ("initializer invalid for static member with constructor");
1507 if (explanation++ == 0)
1508 error ("(you really want to initialize it separately)");
1511 /* Force the compiler to know when an uninitialized static const
1512 member is being used. */
1513 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
1514 TREE_USED (decl) = 1;
1515 DECL_INITIAL (decl) = init;
1516 DECL_IN_AGGR_P (decl) = 1;
1517 DECL_CONTEXT (decl) = current_class_type;
1519 cp_finish_decl (decl, init, asmspec_tree, flags);
1522 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1523 of a structure component, returning a FIELD_DECL node.
1524 QUALS is a list of type qualifiers for this decl (such as for declaring
1525 const member functions).
1527 This is done during the parsing of the struct declaration.
1528 The FIELD_DECL nodes are chained together and the lot of them
1529 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1533 If class A defines that certain functions in class B are friends, then
1534 the way I have set things up, it is B who is interested in permission
1535 granted by A. However, it is in A's context that these declarations
1536 are parsed. By returning a void_type_node, class A does not attempt
1537 to incorporate the declarations of the friends within its structure.
1539 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1540 CHANGES TO CODE IN `start_method'. */
1543 grokfield (declarator, declspecs, init, asmspec_tree, attrlist)
1544 tree declarator, declspecs, init, asmspec_tree, attrlist;
1546 register tree value;
1547 const char *asmspec = 0;
1548 int flags = LOOKUP_ONLYCONVERTING;
1550 /* Convert () initializers to = initializers. */
1551 if (init == NULL_TREE && declarator != NULL_TREE
1552 && TREE_CODE (declarator) == CALL_EXPR
1553 && TREE_OPERAND (declarator, 0)
1554 && (TREE_CODE (TREE_OPERAND (declarator, 0)) == IDENTIFIER_NODE
1555 || TREE_CODE (TREE_OPERAND (declarator, 0)) == SCOPE_REF)
1556 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator)))
1558 init = TREE_OPERAND (declarator, 1);
1559 declarator = TREE_OPERAND (declarator, 0);
1563 if (declspecs == NULL_TREE
1564 && TREE_CODE (declarator) == SCOPE_REF
1565 && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
1567 /* Access declaration */
1568 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
1570 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
1571 pop_nested_class ();
1572 return do_class_using_decl (declarator);
1576 && TREE_CODE (init) == TREE_LIST
1577 && TREE_VALUE (init) == error_mark_node
1578 && TREE_CHAIN (init) == NULL_TREE)
1581 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, attrlist);
1582 if (! value || value == error_mark_node)
1583 /* friend or constructor went bad. */
1586 /* Pass friendly classes back. */
1587 if (TREE_CODE (value) == VOID_TYPE)
1588 return void_type_node;
1590 if (DECL_NAME (value) != NULL_TREE
1591 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
1592 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
1593 cp_error ("member `%D' conflicts with virtual function table field name",
1596 /* Stash away type declarations. */
1597 if (TREE_CODE (value) == TYPE_DECL)
1599 DECL_NONLOCAL (value) = 1;
1600 DECL_CONTEXT (value) = current_class_type;
1602 /* Now that we've updated the context, we need to remangle the
1603 name for this TYPE_DECL. */
1604 DECL_ASSEMBLER_NAME (value) = DECL_NAME (value);
1605 if (!uses_template_parms (value))
1606 DECL_ASSEMBLER_NAME (value) =
1607 get_identifier (build_overload_name (TREE_TYPE (value), 1, 1));
1609 if (processing_template_decl)
1610 value = push_template_decl (value);
1615 if (DECL_IN_AGGR_P (value))
1617 cp_error ("`%D' is already defined in `%T'", value,
1618 DECL_CONTEXT (value));
1619 return void_type_node;
1623 asmspec = TREE_STRING_POINTER (asmspec_tree);
1627 if (TREE_CODE (value) == FUNCTION_DECL)
1629 grok_function_init (value, init);
1632 else if (pedantic && TREE_CODE (value) != VAR_DECL)
1633 /* Already complained in grokdeclarator. */
1637 /* We allow initializers to become parameters to base
1639 if (TREE_CODE (init) == TREE_LIST)
1641 if (TREE_CHAIN (init) == NULL_TREE)
1642 init = TREE_VALUE (init);
1644 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1647 if (TREE_CODE (init) == CONST_DECL)
1648 init = DECL_INITIAL (init);
1649 else if (TREE_READONLY_DECL_P (init))
1650 init = decl_constant_value (init);
1651 else if (TREE_CODE (init) == CONSTRUCTOR)
1652 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1653 if (init == error_mark_node)
1654 /* We must make this look different than `error_mark_node'
1655 because `decl_const_value' would mis-interpret it
1656 as only meaning that this VAR_DECL is defined. */
1657 init = build1 (NOP_EXPR, TREE_TYPE (value), init);
1658 else if (processing_template_decl)
1660 else if (! TREE_CONSTANT (init))
1662 /* We can allow references to things that are effectively
1663 static, since references are initialized with the address. */
1664 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
1665 || (TREE_STATIC (init) == 0
1666 && (TREE_CODE_CLASS (TREE_CODE (init)) != 'd'
1667 || DECL_EXTERNAL (init) == 0)))
1669 error ("field initializer is not constant");
1670 init = error_mark_node;
1676 if (processing_template_decl && ! current_function_decl
1677 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
1678 value = push_template_decl (value);
1681 cplus_decl_attributes (value, TREE_PURPOSE (attrlist),
1682 TREE_VALUE (attrlist));
1684 if (TREE_CODE (value) == VAR_DECL)
1686 finish_static_data_member_decl (value, init, asmspec_tree,
1690 if (TREE_CODE (value) == FIELD_DECL)
1694 /* This must override the asm specifier which was placed
1695 by grokclassfn. Lay this out fresh. */
1696 DECL_RTL (value) = NULL_RTX;
1697 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1699 if (DECL_INITIAL (value) == error_mark_node)
1700 init = error_mark_node;
1701 cp_finish_decl (value, init, asmspec_tree, flags);
1702 DECL_INITIAL (value) = init;
1703 DECL_IN_AGGR_P (value) = 1;
1706 if (TREE_CODE (value) == FUNCTION_DECL)
1710 /* This must override the asm specifier which was placed
1711 by grokclassfn. Lay this out fresh. */
1712 DECL_RTL (value) = NULL_RTX;
1713 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1715 cp_finish_decl (value, init, asmspec_tree, flags);
1717 /* Pass friends back this way. */
1718 if (DECL_FRIEND_P (value))
1719 return void_type_node;
1721 DECL_IN_AGGR_P (value) = 1;
1724 my_friendly_abort (21);
1729 /* Like `grokfield', but for bitfields.
1730 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1733 grokbitfield (declarator, declspecs, width)
1734 tree declarator, declspecs, width;
1736 register tree value = grokdeclarator (declarator, declspecs, BITFIELD,
1739 if (! value) return NULL_TREE; /* friends went bad. */
1741 /* Pass friendly classes back. */
1742 if (TREE_CODE (value) == VOID_TYPE)
1743 return void_type_node;
1745 if (TREE_CODE (value) == TYPE_DECL)
1747 cp_error ("cannot declare `%D' to be a bitfield type", value);
1751 /* Usually, finish_struct_1 catches bitifields with invalid types.
1752 But, in the case of bitfields with function type, we confuse
1753 ourselves into thinking they are member functions, so we must
1755 if (TREE_CODE (value) == FUNCTION_DECL)
1757 cp_error ("cannot declare bitfield `%D' with funcion type",
1762 if (DECL_IN_AGGR_P (value))
1764 cp_error ("`%D' is already defined in the class %T", value,
1765 DECL_CONTEXT (value));
1766 return void_type_node;
1769 GNU_xref_member (current_class_name, value);
1771 if (TREE_STATIC (value))
1773 cp_error ("static member `%D' cannot be a bitfield", value);
1776 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1778 if (width != error_mark_node)
1780 constant_expression_warning (width);
1781 DECL_INITIAL (value) = width;
1782 SET_DECL_C_BIT_FIELD (value);
1785 DECL_IN_AGGR_P (value) = 1;
1790 grokoptypename (declspecs, declarator)
1791 tree declspecs, declarator;
1793 tree t = grokdeclarator (declarator, declspecs, TYPENAME, 0, NULL_TREE);
1794 return build_typename_overload (t);
1797 /* When a function is declared with an initializer,
1798 do the right thing. Currently, there are two possibilities:
1803 // initialization possibility #1.
1804 virtual void f () = 0;
1826 // initialization possibility #2
1833 copy_assignment_arg_p (parmtype, virtualp)
1835 int virtualp ATTRIBUTE_UNUSED;
1837 if (current_class_type == NULL_TREE)
1840 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
1841 parmtype = TREE_TYPE (parmtype);
1843 if ((TYPE_MAIN_VARIANT (parmtype) == current_class_type)
1845 /* Non-standard hack to support old Booch components. */
1846 || (! virtualp && DERIVED_FROM_P (parmtype, current_class_type))
1855 grok_function_init (decl, init)
1859 /* An initializer for a function tells how this function should
1861 tree type = TREE_TYPE (decl);
1863 if (TREE_CODE (type) == FUNCTION_TYPE)
1864 cp_error ("initializer specified for non-member function `%D'", decl);
1866 /* We'll check for this in finish_struct_1. */
1867 else if (DECL_VINDEX (decl) == NULL_TREE)
1868 cp_error ("initializer specified for non-virtual member function `%D'", decl);
1870 else if (integer_zerop (init))
1873 /* Mark this function as being "defined". */
1874 DECL_INITIAL (decl) = error_mark_node;
1875 /* pure virtual destructors must be defined. */
1876 /* pure virtual needs to be defined (as abort) only when put in
1877 vtbl. For wellformed call, it should be itself. pr4737 */
1878 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl)))
1880 /* Give this node rtl from `abort'. */
1881 DECL_RTL (decl) = DECL_RTL (abort_fndecl);
1884 DECL_PURE_VIRTUAL_P (decl) = 1;
1885 if (DECL_NAME (decl) == ansi_opname [(int) MODIFY_EXPR])
1888 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl))));
1890 if (copy_assignment_arg_p (parmtype, 1))
1891 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type) = 1;
1895 cp_error ("invalid initializer for virtual method `%D'", decl);
1899 cplus_decl_attributes (decl, attributes, prefix_attributes)
1900 tree decl, attributes, prefix_attributes;
1902 if (decl == NULL_TREE || decl == void_type_node)
1905 if (TREE_CODE (decl) == TEMPLATE_DECL)
1906 decl = DECL_TEMPLATE_RESULT (decl);
1908 decl_attributes (decl, attributes, prefix_attributes);
1910 if (TREE_CODE (decl) == TYPE_DECL)
1911 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl), TREE_TYPE (decl));
1914 /* CONSTRUCTOR_NAME:
1915 Return the name for the constructor (or destructor) for the
1916 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1917 IDENTIFIER_NODE. When given a template, this routine doesn't
1918 lose the specialization. */
1921 constructor_name_full (thing)
1924 if (TREE_CODE (thing) == TEMPLATE_TYPE_PARM
1925 || TREE_CODE (thing) == TEMPLATE_TEMPLATE_PARM
1926 || TREE_CODE (thing) == TYPENAME_TYPE)
1927 thing = TYPE_NAME (thing);
1928 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing)))
1930 if (TYPE_WAS_ANONYMOUS (thing) && TYPE_HAS_CONSTRUCTOR (thing))
1931 thing = DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing), 0)));
1933 thing = TYPE_NAME (thing);
1935 if (TREE_CODE (thing) == TYPE_DECL
1936 || (TREE_CODE (thing) == TEMPLATE_DECL
1937 && TREE_CODE (DECL_TEMPLATE_RESULT (thing)) == TYPE_DECL))
1938 thing = DECL_NAME (thing);
1939 my_friendly_assert (TREE_CODE (thing) == IDENTIFIER_NODE, 197);
1943 /* CONSTRUCTOR_NAME:
1944 Return the name for the constructor (or destructor) for the
1945 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1946 IDENTIFIER_NODE. When given a template, return the plain
1947 unspecialized name. */
1950 constructor_name (thing)
1954 thing = constructor_name_full (thing);
1955 t = IDENTIFIER_TEMPLATE (thing);
1961 /* Record the existence of an addressable inline function. */
1964 mark_inline_for_output (decl)
1967 decl = DECL_MAIN_VARIANT (decl);
1968 if (DECL_SAVED_INLINE (decl))
1970 DECL_SAVED_INLINE (decl) = 1;
1972 VARRAY_TREE_INIT (saved_inlines, 32, "saved_inlines");
1974 VARRAY_PUSH_TREE (saved_inlines, decl);
1977 /* Hand off a unique name which can be used for variable we don't really
1978 want to know about anyway, for example, the anonymous variables which
1979 are needed to make references work. Declare this thing so we can use it.
1980 The variable created will be of type TYPE.
1982 STATICP is nonzero if this variable should be static. */
1985 get_temp_name (type, staticp)
1989 char buf[sizeof (AUTO_TEMP_FORMAT) + 20];
1991 int toplev = toplevel_bindings_p ();
1993 if (toplev || staticp)
1995 sprintf (buf, AUTO_TEMP_FORMAT, global_temp_name_counter++);
1996 decl = pushdecl_top_level (build_decl (VAR_DECL, get_identifier (buf), type));
2000 sprintf (buf, AUTO_TEMP_FORMAT, temp_name_counter++);
2001 decl = pushdecl (build_decl (VAR_DECL, get_identifier (buf), type));
2003 TREE_USED (decl) = 1;
2004 TREE_STATIC (decl) = staticp;
2005 DECL_ARTIFICIAL (decl) = 1;
2007 /* If this is a local variable, then lay out its rtl now.
2008 Otherwise, callers of this function are responsible for dealing
2009 with this variable's rtl. */
2013 my_friendly_assert (DECL_INITIAL (decl) == NULL_TREE,
2020 /* Hunts through the global anonymous union ANON_DECL, building
2021 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2022 returns a VAR_DECL whose size is the same as the size of the
2023 ANON_DECL, if one is available. */
2026 build_anon_union_vars (anon_decl, elems, static_p, external_p)
2032 tree type = TREE_TYPE (anon_decl);
2033 tree main_decl = NULL_TREE;
2036 /* Rather than write the code to handle the non-union case,
2037 just give an error. */
2038 if (TREE_CODE (type) != UNION_TYPE)
2039 error ("anonymous struct not inside named type");
2041 for (field = TYPE_FIELDS (type);
2043 field = TREE_CHAIN (field))
2047 if (DECL_ARTIFICIAL (field))
2049 if (TREE_CODE (field) != FIELD_DECL)
2051 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2056 if (TREE_PRIVATE (field))
2057 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
2058 else if (TREE_PROTECTED (field))
2059 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
2061 if (DECL_NAME (field) == NULL_TREE
2062 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2064 decl = build_anon_union_vars (field, elems, static_p, external_p);
2068 else if (DECL_NAME (field) == NULL_TREE)
2072 decl = build_decl (VAR_DECL, DECL_NAME (field), TREE_TYPE (field));
2073 /* tell `pushdecl' that this is not tentative. */
2074 DECL_INITIAL (decl) = error_mark_node;
2075 TREE_PUBLIC (decl) = 0;
2076 TREE_STATIC (decl) = static_p;
2077 DECL_EXTERNAL (decl) = external_p;
2078 decl = pushdecl (decl);
2079 DECL_INITIAL (decl) = NULL_TREE;
2082 /* Only write out one anon union element--choose the one that
2083 can hold them all. */
2084 if (main_decl == NULL_TREE
2085 && simple_cst_equal (DECL_SIZE (decl),
2086 DECL_SIZE (anon_decl)) == 1)
2089 /* ??? This causes there to be no debug info written out
2091 TREE_ASM_WRITTEN (decl) = 1;
2093 if (DECL_NAME (field) == NULL_TREE
2094 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2095 /* The remainder of the processing was already done in the
2099 /* If there's a cleanup to do, it belongs in the
2100 TREE_PURPOSE of the following TREE_LIST. */
2101 *elems = tree_cons (NULL_TREE, decl, *elems);
2102 TREE_TYPE (*elems) = type;
2108 /* Finish off the processing of a UNION_TYPE structure.
2109 If there are static members, then all members are
2110 static, and must be laid out together. If the
2111 union is an anonymous union, we arrange for that
2112 as well. PUBLIC_P is nonzero if this union is
2113 not declared static. */
2116 finish_anon_union (anon_union_decl)
2117 tree anon_union_decl;
2119 tree type = TREE_TYPE (anon_union_decl);
2121 int public_p = TREE_PUBLIC (anon_union_decl);
2122 int static_p = TREE_STATIC (anon_union_decl);
2123 int external_p = DECL_EXTERNAL (anon_union_decl);
2125 if (TYPE_FIELDS (type) == NULL_TREE)
2130 error ("global anonymous unions must be declared static");
2134 main_decl = build_anon_union_vars (anon_union_decl,
2135 &DECL_ANON_UNION_ELEMS (anon_union_decl),
2136 static_p, external_p);
2138 if (main_decl == NULL_TREE)
2140 warning ("anonymous union with no members");
2146 make_decl_rtl (main_decl, 0, toplevel_bindings_p ());
2147 DECL_RTL (anon_union_decl) = DECL_RTL (main_decl);
2148 expand_anon_union_decl (anon_union_decl,
2150 DECL_ANON_UNION_ELEMS (anon_union_decl));
2153 add_decl_stmt (anon_union_decl);
2156 /* Finish processing a builtin type TYPE. It's name is NAME,
2157 its fields are in the array FIELDS. LEN is the number of elements
2158 in FIELDS minus one, or put another way, it is the maximum subscript
2161 It is given the same alignment as ALIGN_TYPE. */
2164 finish_builtin_type (type, name, fields, len, align_type)
2173 TYPE_FIELDS (type) = fields[0];
2174 for (i = 0; i < len; i++)
2176 layout_type (TREE_TYPE (fields[i]));
2177 DECL_FIELD_CONTEXT (fields[i]) = type;
2178 TREE_CHAIN (fields[i]) = fields[i+1];
2180 DECL_FIELD_CONTEXT (fields[i]) = type;
2181 TYPE_ALIGN (type) = TYPE_ALIGN (align_type);
2183 #if 0 /* not yet, should get fixed properly later */
2184 TYPE_NAME (type) = make_type_decl (get_identifier (name), type);
2186 TYPE_NAME (type) = build_decl (TYPE_DECL, get_identifier (name), type);
2188 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2189 layout_decl (TYPE_NAME (type), 0);
2192 /* Auxiliary functions to make type signatures for
2193 `operator new' and `operator delete' correspond to
2194 what compiler will be expecting. */
2197 coerce_new_type (type)
2202 if (TREE_CODE (type) == METHOD_TYPE)
2203 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (TYPE_ARG_TYPES (type)));
2204 if (! same_type_p (TREE_TYPE (type), ptr_type_node))
2205 e1 = 1, error ("`operator new' must return type `void *'");
2207 /* Technically the type must be `size_t', but we may not know
2209 if (TYPE_ARG_TYPES (type) == NULL_TREE)
2210 e1 = 1, error ("`operator new' takes type `size_t' parameter");
2211 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type)), sizetype))
2212 e2 = 1, error ("`operator new' takes type `size_t' as first parameter");
2214 type = build_function_type (ptr_type_node, tree_cons (NULL_TREE, sizetype, TREE_CHAIN (TYPE_ARG_TYPES (type))));
2216 type = build_function_type (ptr_type_node, TYPE_ARG_TYPES (type));
2221 coerce_delete_type (type)
2228 tree arg_types = TYPE_ARG_TYPES (type);
2230 if (TREE_CODE (type) == METHOD_TYPE)
2232 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (arg_types));
2233 arg_types = TREE_CHAIN (arg_types);
2236 if (TREE_TYPE (type) != void_type_node)
2237 e1 = 1, error ("`operator delete' must return type `void'");
2239 if (arg_types == NULL_TREE
2240 || ! same_type_p (TREE_VALUE (arg_types), ptr_type_node))
2241 e2 = 1, error ("`operator delete' takes type `void *' as first parameter");
2245 && TREE_CHAIN (arg_types)
2246 && TREE_CHAIN (arg_types) != void_list_node)
2248 /* Again, technically this argument must be `size_t', but again
2249 we may not know what that is. */
2250 tree t2 = TREE_VALUE (TREE_CHAIN (arg_types));
2251 if (! same_type_p (t2, sizetype))
2252 e3 = 1, error ("second argument to `operator delete' must be of type `size_t'");
2253 else if (TREE_CHAIN (TREE_CHAIN (arg_types)) != void_list_node)
2256 if (TREE_CHAIN (TREE_CHAIN (arg_types)))
2257 error ("too many arguments in declaration of `operator delete'");
2259 error ("`...' invalid in specification of `operator delete'");
2264 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2265 build_tree_list (NULL_TREE, sizetype));
2268 if (arg_types == NULL_TREE)
2269 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
2271 arg_types = tree_cons (NULL_TREE, ptr_type_node, TREE_CHAIN (arg_types));
2277 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2278 arg_types ? TREE_CHAIN (arg_types): NULL_TREE);
2280 type = build_function_type (void_type_node, arg_types);
2286 mark_vtable_entries (decl)
2289 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
2291 for (; entries; entries = TREE_CHAIN (entries))
2296 fnaddr = (flag_vtable_thunks ? TREE_VALUE (entries)
2297 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries)));
2299 if (TREE_CODE (fnaddr) != ADDR_EXPR)
2300 /* This entry is an offset: a virtual base class offset, a
2301 virtual call offset, and RTTI offset, etc. */
2304 fn = TREE_OPERAND (fnaddr, 0);
2305 TREE_ADDRESSABLE (fn) = 1;
2306 if (TREE_CODE (fn) == THUNK_DECL && DECL_EXTERNAL (fn))
2308 DECL_EXTERNAL (fn) = 0;
2315 /* Set DECL up to have the closest approximation of "initialized common"
2316 linkage available. */
2319 comdat_linkage (decl)
2323 make_decl_one_only (decl);
2324 else if (TREE_CODE (decl) == FUNCTION_DECL || DECL_VIRTUAL_P (decl))
2325 /* We can just emit functions and vtables statically; it doesn't really
2326 matter if we have multiple copies. */
2327 TREE_PUBLIC (decl) = 0;
2330 /* Static data member template instantiations, however, cannot
2331 have multiple copies. */
2332 if (DECL_INITIAL (decl) == 0
2333 || DECL_INITIAL (decl) == error_mark_node)
2334 DECL_COMMON (decl) = 1;
2335 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
2337 DECL_COMMON (decl) = 1;
2338 DECL_INITIAL (decl) = error_mark_node;
2342 /* We can't do anything useful; leave vars for explicit
2344 DECL_EXTERNAL (decl) = 1;
2345 DECL_NOT_REALLY_EXTERN (decl) = 0;
2349 if (DECL_LANG_SPECIFIC (decl))
2350 DECL_COMDAT (decl) = 1;
2353 /* For win32 we also want to put explicit instantiations in
2354 linkonce sections, so that they will be merged with implicit
2355 instantiations; otherwise we get duplicate symbol errors. */
2358 maybe_make_one_only (decl)
2361 /* We used to say that this was not necessary on targets that support weak
2362 symbols, because the implicit instantiations will defer to the explicit
2363 one. However, that's not actually the case in SVR4; a strong definition
2364 after a weak one is an error. Also, not making explicit
2365 instantiations one_only means that we can end up with two copies of
2366 some template instantiations. */
2367 if (! supports_one_only ())
2370 /* We can't set DECL_COMDAT on functions, or finish_file will think
2371 we can get away with not emitting them if they aren't used. We need
2372 to for variables so that cp_finish_decl will update their linkage,
2373 because their DECL_INITIAL may not have been set properly yet. */
2375 make_decl_one_only (decl);
2377 if (TREE_CODE (decl) == VAR_DECL && DECL_LANG_SPECIFIC (decl))
2378 DECL_COMDAT (decl) = 1;
2381 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2382 based on TYPE and other static flags.
2384 Note that anything public is tagged TREE_PUBLIC, whether
2385 it's public in this file or in another one. */
2388 import_export_vtable (decl, type, final)
2392 if (DECL_INTERFACE_KNOWN (decl))
2395 if (TYPE_FOR_JAVA (type))
2397 TREE_PUBLIC (decl) = 1;
2398 DECL_EXTERNAL (decl) = 1;
2399 DECL_INTERFACE_KNOWN (decl) = 1;
2401 else if (CLASSTYPE_INTERFACE_KNOWN (type))
2403 TREE_PUBLIC (decl) = 1;
2404 DECL_EXTERNAL (decl) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type);
2405 DECL_INTERFACE_KNOWN (decl) = 1;
2409 /* We can only wait to decide if we have real non-inline virtual
2410 functions in our class, or if we come from a template. */
2412 int found = CLASSTYPE_TEMPLATE_INSTANTIATION (type);
2414 if (! found && ! final)
2417 for (method = TYPE_METHODS (type); method != NULL_TREE;
2418 method = TREE_CHAIN (method))
2419 if (DECL_VINDEX (method) != NULL_TREE
2420 && ! DECL_THIS_INLINE (method)
2421 && ! DECL_PURE_VIRTUAL_P (method))
2428 if (final || ! found)
2430 comdat_linkage (decl);
2431 DECL_EXTERNAL (decl) = 0;
2435 TREE_PUBLIC (decl) = 1;
2436 DECL_EXTERNAL (decl) = 1;
2441 /* Determine whether or not we want to specifically import or export CTYPE,
2442 using various heuristics. */
2445 import_export_class (ctype)
2448 /* -1 for imported, 1 for exported. */
2449 int import_export = 0;
2451 /* It only makes sense to call this function at EOF. The reason is
2452 that this function looks at whether or not the first non-inline
2453 non-abstract virtual member function has been defined in this
2454 translation unit. But, we can't possibly know that until we've
2455 seen the entire translation unit. */
2456 my_friendly_assert (at_eof, 20000226);
2458 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
2461 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2462 we will have CLASSTYPE_INTERFACE_ONLY set but not
2463 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2464 heuristic because someone will supply a #pragma implementation
2465 elsewhere, and deducing it here would produce a conflict. */
2466 if (CLASSTYPE_INTERFACE_ONLY (ctype))
2469 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2470 /* FIXME this should really use some sort of target-independent macro. */
2471 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
2473 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
2477 /* If we got -fno-implicit-templates, we import template classes that
2478 weren't explicitly instantiated. */
2479 if (import_export == 0
2480 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
2481 && ! flag_implicit_templates)
2484 /* Base our import/export status on that of the first non-inline,
2485 non-abstract virtual function, if any. */
2486 if (import_export == 0
2487 && TYPE_POLYMORPHIC_P (ctype)
2488 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
2491 for (method = TYPE_METHODS (ctype); method != NULL_TREE;
2492 method = TREE_CHAIN (method))
2494 if (DECL_VINDEX (method) != NULL_TREE
2495 && !DECL_THIS_INLINE (method)
2496 && !DECL_PURE_VIRTUAL_P (method))
2498 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
2504 #ifdef MULTIPLE_SYMBOL_SPACES
2505 if (import_export == -1)
2511 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
2512 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype) = (import_export > 0);
2513 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
2517 /* We need to describe to the assembler the relationship between
2518 a vtable and the vtable of the parent class. */
2521 output_vtable_inherit (vars)
2527 op[0] = XEXP (DECL_RTL (vars), 0); /* strip the mem ref */
2529 parent = binfo_for_vtable (vars);
2531 if (parent == TYPE_BINFO (DECL_CONTEXT (vars)))
2535 parent = TYPE_BINFO_VTABLE (BINFO_TYPE (parent));
2536 op[1] = XEXP (DECL_RTL (parent), 0); /* strip the mem ref */
2539 my_friendly_abort (980826);
2541 output_asm_insn (".vtable_inherit %c0, %c1", op);
2545 finish_vtable_vardecl (t, data)
2547 void *data ATTRIBUTE_UNUSED;
2550 tree ctype = DECL_CONTEXT (vars);
2551 import_export_class (ctype);
2552 import_export_vtable (vars, ctype, 1);
2554 if (! DECL_EXTERNAL (vars)
2555 && (DECL_NEEDED_P (vars)
2556 || (decl_function_context (vars) && TREE_USED (vars)))
2557 && ! TREE_ASM_WRITTEN (vars))
2559 if (TREE_TYPE (vars) == void_type_node)
2560 /* It is a dummy vtable made by get_vtable_decl. Ignore it. */
2564 mark_vtable_entries (vars);
2565 if (TREE_TYPE (DECL_INITIAL (vars)) == 0)
2566 store_init_value (vars, DECL_INITIAL (vars));
2568 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
2570 /* Mark the VAR_DECL node representing the vtable itself as a
2571 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2572 It is rather important that such things be ignored because
2573 any effort to actually generate DWARF for them will run
2574 into trouble when/if we encounter code like:
2577 struct S { virtual void member (); };
2579 because the artificial declaration of the vtable itself (as
2580 manufactured by the g++ front end) will say that the vtable
2581 is a static member of `S' but only *after* the debug output
2582 for the definition of `S' has already been output. This causes
2583 grief because the DWARF entry for the definition of the vtable
2584 will try to refer back to an earlier *declaration* of the
2585 vtable as a static member of `S' and there won't be one.
2586 We might be able to arrange to have the "vtable static member"
2587 attached to the member list for `S' before the debug info for
2588 `S' get written (which would solve the problem) but that would
2589 require more intrusive changes to the g++ front end. */
2591 DECL_IGNORED_P (vars) = 1;
2594 /* Always make vtables weak. */
2596 comdat_linkage (vars);
2598 rest_of_decl_compilation (vars, NULL_PTR, 1, 1);
2601 output_vtable_inherit (vars);
2603 /* Because we're only doing syntax-checking, we'll never end up
2604 actually marking the variable as written. */
2605 if (flag_syntax_only)
2606 TREE_ASM_WRITTEN (vars) = 1;
2608 /* Since we're writing out the vtable here, also write the debug
2610 if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (ctype)))
2612 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (ctype)) = 0;
2613 rest_of_type_compilation (ctype, toplevel_bindings_p ());
2618 else if (!DECL_NEEDED_P (vars))
2619 /* We don't know what to do with this one yet. */
2626 prune_vtable_vardecl (t, data)
2628 void *data ATTRIBUTE_UNUSED;
2630 *t = TREE_CHAIN (*t);
2634 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2635 inline function or template instantiation at end-of-file. */
2638 import_export_decl (decl)
2641 if (DECL_INTERFACE_KNOWN (decl))
2644 if (DECL_TEMPLATE_INSTANTIATION (decl)
2645 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2647 DECL_NOT_REALLY_EXTERN (decl) = 1;
2648 if ((DECL_IMPLICIT_INSTANTIATION (decl)
2649 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2650 && (flag_implicit_templates
2651 || (flag_implicit_inline_templates && DECL_THIS_INLINE (decl))))
2653 if (!TREE_PUBLIC (decl))
2654 /* Templates are allowed to have internal linkage. See
2658 comdat_linkage (decl);
2661 DECL_NOT_REALLY_EXTERN (decl) = 0;
2663 else if (DECL_FUNCTION_MEMBER_P (decl))
2665 tree ctype = DECL_CONTEXT (decl);
2666 import_export_class (ctype);
2667 if (CLASSTYPE_INTERFACE_KNOWN (ctype)
2669 ? (! DECL_THIS_INLINE (decl))
2670 : (! DECL_ARTIFICIAL (decl) || DECL_VINDEX (decl))))
2672 DECL_NOT_REALLY_EXTERN (decl)
2673 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2674 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2675 && !DECL_VINDEX (decl)));
2677 /* Always make artificials weak. */
2678 if (DECL_ARTIFICIAL (decl) && flag_weak)
2679 comdat_linkage (decl);
2681 maybe_make_one_only (decl);
2684 comdat_linkage (decl);
2686 else if (DECL_TINFO_FN_P (decl))
2688 tree ctype = TREE_TYPE (DECL_NAME (decl));
2690 if (IS_AGGR_TYPE (ctype))
2691 import_export_class (ctype);
2693 if (IS_AGGR_TYPE (ctype) && CLASSTYPE_INTERFACE_KNOWN (ctype)
2694 && TYPE_POLYMORPHIC_P (ctype)
2695 /* If -fno-rtti, we're not necessarily emitting this stuff with
2696 the class, so go ahead and emit it now. This can happen
2697 when a class is used in exception handling. */
2699 /* If the type is a cv-qualified variant of a type, then we
2700 must emit the tinfo function in this translation unit
2701 since it will not be emitted when the vtable for the type
2702 is output (which is when the unqualified version is
2704 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2706 DECL_NOT_REALLY_EXTERN (decl)
2707 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2708 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2709 && !DECL_VINDEX (decl)));
2711 /* Always make artificials weak. */
2713 comdat_linkage (decl);
2715 else if (TYPE_BUILT_IN (ctype)
2716 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2717 DECL_NOT_REALLY_EXTERN (decl) = 0;
2719 comdat_linkage (decl);
2722 comdat_linkage (decl);
2724 DECL_INTERFACE_KNOWN (decl) = 1;
2728 build_cleanup (decl)
2732 tree type = TREE_TYPE (decl);
2734 if (TREE_CODE (type) == ARRAY_TYPE)
2738 mark_addressable (decl);
2739 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
2741 temp = build_delete (TREE_TYPE (temp), temp,
2743 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
2747 extern int parse_time, varconst_time;
2753 tree sname = get_id_2 ("__sn", base);
2754 /* For struct X foo __attribute__((weak)), there is a counter
2755 __snfoo. Since base is already an assembler name, sname should
2756 be globally unique */
2757 tree sentry = IDENTIFIER_GLOBAL_VALUE (sname);
2760 sentry = build_decl (VAR_DECL, sname, integer_type_node);
2761 TREE_PUBLIC (sentry) = 1;
2762 DECL_ARTIFICIAL (sentry) = 1;
2763 TREE_STATIC (sentry) = 1;
2764 TREE_USED (sentry) = 1;
2765 DECL_COMMON (sentry) = 1;
2766 pushdecl_top_level (sentry);
2767 cp_finish_decl (sentry, NULL_TREE, NULL_TREE, 0);
2772 /* Start the process of running a particular set of global constructors
2773 or destructors. Subroutine of do_[cd]tors. */
2776 start_objects (method_type, initp)
2777 int method_type, initp;
2783 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2785 if (initp != DEFAULT_INIT_PRIORITY)
2795 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
2798 sprintf (type, "%c", method_type);
2800 fnname = get_file_function_name_long (type);
2802 start_function (void_list_node,
2803 make_call_declarator (fnname, void_list_node, NULL_TREE,
2805 NULL_TREE, SF_DEFAULT);
2807 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2808 /* It can be a static function as long as collect2 does not have
2809 to scan the object file to find its ctor/dtor routine. */
2810 TREE_PUBLIC (current_function_decl) = 0;
2813 /* Mark this declaration as used to avoid spurious warnings. */
2814 TREE_USED (current_function_decl) = 1;
2816 /* Mark this function as a global constructor or destructor. */
2817 if (method_type == 'I')
2818 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
2820 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
2821 GLOBAL_INIT_PRIORITY (current_function_decl) = initp;
2823 body = begin_compound_stmt (/*has_no_scope=*/0);
2825 /* We cannot allow these functions to be elided, even if they do not
2826 have external linkage. And, there's no point in deferring
2827 copmilation of thes functions; they're all going to have to be
2829 current_function_cannot_inline
2830 = "static constructors and destructors cannot be inlined";
2835 /* Finish the process of running a particular set of global constructors
2836 or destructors. Subroutine of do_[cd]tors. */
2839 finish_objects (method_type, initp, body)
2840 int method_type, initp;
2847 finish_compound_stmt(/*has_no_scope=*/0, body);
2848 fn = finish_function (lineno, 0);
2851 /* When only doing semantic analysis, and no RTL generation, we
2852 can't call functions that directly emit assembly code; there is
2853 no assembly file in which to put the code. */
2854 if (flag_syntax_only)
2857 fnname = XSTR (XEXP (DECL_RTL (fn), 0), 0);
2858 if (initp == DEFAULT_INIT_PRIORITY)
2860 if (method_type == 'I')
2861 assemble_constructor (fnname);
2863 assemble_destructor (fnname);
2865 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2866 /* If we're using init priority we can't use assemble_*tor, but on ELF
2867 targets we can stick the references into named sections for GNU ld
2872 sprintf (buf, ".%ctors.%.5u", method_type == 'I' ? 'c' : 'd',
2873 /* invert the numbering so the linker puts us in the proper
2874 order; constructors are run from right to left, and the
2875 linker sorts in increasing order. */
2876 MAX_INIT_PRIORITY - initp);
2877 named_section (NULL_TREE, buf, 0);
2878 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, fnname),
2879 POINTER_SIZE / BITS_PER_UNIT, 1);
2884 /* The names of the parameters to the function created to handle
2885 initializations and destructions for objects with static storage
2887 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2888 #define PRIORITY_IDENTIFIER "__priority"
2890 /* The name of the function we create to handle initializations and
2891 destructions for objects with static storage duration. */
2892 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2894 /* The declaration for the __INITIALIZE_P argument. */
2895 static tree initialize_p_decl;
2897 /* The declaration for the __PRIORITY argument. */
2898 static tree priority_decl;
2900 /* The declaration for the static storage duration function. */
2901 static tree ssdf_decl;
2903 /* All the static storage duration functions created in this
2904 translation unit. */
2905 static varray_type ssdf_decls;
2907 /* A map from priority levels to information about that priority
2908 level. There may be many such levels, so efficient lookup is
2910 static splay_tree priority_info_map;
2912 /* Begins the generation of the function that will handle all
2913 initialization and destruction of objects with static storage
2914 duration. The function generated takes two parameters of type
2915 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2916 non-zero, it performs initializations. Otherwise, it performs
2917 destructions. It only performs those initializations or
2918 destructions with the indicated __PRIORITY. The generated function
2921 It is assumed that this function will only be called once per
2922 translation unit. */
2925 start_static_storage_duration_function ()
2927 static unsigned ssdf_number;
2932 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2934 /* Create the identifier for this function. It will be of the form
2935 SSDF_IDENTIFIER_<number>. */
2936 sprintf (id, "%s_%u", SSDF_IDENTIFIER, ssdf_number++);
2937 if (ssdf_number == 0)
2939 /* Overflow occurred. That means there are at least 4 billion
2940 initialization functions. */
2941 sorry ("too many initialization functions required");
2942 my_friendly_abort (19990430);
2945 /* Create the parameters. */
2946 parm_types = void_list_node;
2947 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2948 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2949 type = build_function_type (void_type_node, parm_types);
2951 /* Create the FUNCTION_DECL itself. */
2952 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2953 get_identifier (id),
2955 TREE_PUBLIC (ssdf_decl) = 0;
2956 DECL_ARTIFICIAL (ssdf_decl) = 1;
2958 /* Put this function in the list of functions to be called from the
2959 static constructors and destructors. */
2962 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2964 /* Take this opportunity to initialize the map from priority
2965 numbers to information about that priority level. */
2966 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2967 /*delete_key_fn=*/0,
2968 /*delete_value_fn=*/
2969 (splay_tree_delete_value_fn) &free);
2971 /* We always need to generate functions for the
2972 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2973 priorities later, we'll be sure to find the
2974 DEFAULT_INIT_PRIORITY. */
2975 get_priority_info (DEFAULT_INIT_PRIORITY);
2978 VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl);
2980 /* Create the argument list. */
2981 initialize_p_decl = build_decl (PARM_DECL,
2982 get_identifier (INITIALIZE_P_IDENTIFIER),
2984 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2985 DECL_ARG_TYPE (initialize_p_decl) = integer_type_node;
2986 TREE_USED (initialize_p_decl) = 1;
2987 priority_decl = build_decl (PARM_DECL, get_identifier (PRIORITY_IDENTIFIER),
2989 DECL_CONTEXT (priority_decl) = ssdf_decl;
2990 DECL_ARG_TYPE (priority_decl) = integer_type_node;
2991 TREE_USED (priority_decl) = 1;
2993 TREE_CHAIN (initialize_p_decl) = priority_decl;
2994 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2996 /* Put the function in the global scope. */
2997 pushdecl (ssdf_decl);
2999 /* Start the function itself. This is equivalent to declarating the
3002 static void __ssdf (int __initialize_p, init __priority_p);
3004 It is static because we only need to call this function from the
3005 various constructor and destructor functions for this module. */
3006 start_function (/*specs=*/NULL_TREE,
3008 /*attrs=*/NULL_TREE,
3011 /* Set up the scope of the outermost block in the function. */
3012 body = begin_compound_stmt (/*has_no_scope=*/0);
3014 /* This function must not be deferred because we are depending on
3015 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3016 current_function_cannot_inline
3017 = "static storage duration functions cannot be inlined";
3022 /* Finish the generation of the function which performs initialization
3023 and destruction of objects with static storage duration. After
3024 this point, no more such objects can be created. */
3027 finish_static_storage_duration_function (body)
3030 /* Close out the function. */
3031 finish_compound_stmt (/*has_no_scope=*/0, body);
3032 expand_body (finish_function (lineno, 0));
3035 /* Return the information about the indicated PRIORITY level. If no
3036 code to handle this level has yet been generated, generate the
3037 appropriate prologue. */
3039 static priority_info
3040 get_priority_info (priority)
3046 n = splay_tree_lookup (priority_info_map,
3047 (splay_tree_key) priority);
3050 /* Create a new priority information structure, and insert it
3052 pi = (priority_info) xmalloc (sizeof (struct priority_info_s));
3053 pi->initializations_p = 0;
3054 pi->destructions_p = 0;
3055 splay_tree_insert (priority_info_map,
3056 (splay_tree_key) priority,
3057 (splay_tree_value) pi);
3060 pi = (priority_info) n->value;
3065 /* Set up to handle the initialization or destruction of DECL. If
3066 INITP is non-zero, we are initializing the variable. Otherwise, we
3067 are destroying it. */
3070 start_static_initialization_or_destruction (decl, initp)
3074 tree sentry_if_stmt = NULL_TREE;
3080 /* Figure out the priority for this declaration. */
3081 priority = DECL_INIT_PRIORITY (decl);
3083 priority = DEFAULT_INIT_PRIORITY;
3085 /* Remember that we had an initialization or finalization at this
3087 pi = get_priority_info (priority);
3089 pi->initializations_p = 1;
3091 pi->destructions_p = 1;
3093 /* Trick the compiler into thinking we are at the file and line
3094 where DECL was declared so that error-messages make sense, and so
3095 that the debugger will show somewhat sensible file and line
3097 input_filename = DECL_SOURCE_FILE (decl);
3098 lineno = DECL_SOURCE_LINE (decl);
3104 Access control for implicit calls to the constructors,
3105 the conversion functions, or the destructor called to
3106 create and destroy a static data member is performed as
3107 if these calls appeared in the scope of the member's
3110 we pretend we are in a static member function of the class of
3111 which the DECL is a member. */
3112 if (member_p (decl))
3114 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
3115 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
3118 /* Conditionalize this initialization on being in the right priority
3119 and being initializing/finalizing appropriately. */
3120 sentry_if_stmt = begin_if_stmt ();
3121 cond = build_binary_op (EQ_EXPR,
3123 build_int_2 (priority, 0));
3124 init_cond = initp ? integer_one_node : integer_zero_node;
3125 init_cond = build_binary_op (EQ_EXPR,
3128 cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
3130 /* We need a sentry if this is an object with external linkage that
3131 might be initialized in more than one place. */
3132 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
3133 || DECL_ONE_ONLY (decl)
3134 || DECL_WEAK (decl)))
3139 sentry = get_sentry (DECL_ASSEMBLER_NAME (decl));
3141 /* We do initializations only if the SENTRY is zero, i.e., if we
3142 are the first to initialize the variable. We do destructions
3143 only if the SENTRY is one, i.e., if we are the last to
3144 destroy the variable. */
3146 sentry_cond = build_binary_op (EQ_EXPR,
3147 build_unary_op (PREINCREMENT_EXPR,
3152 sentry_cond = build_binary_op (EQ_EXPR,
3153 build_unary_op (PREDECREMENT_EXPR,
3158 cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, sentry_cond);
3161 finish_if_stmt_cond (cond, sentry_if_stmt);
3163 return sentry_if_stmt;
3166 /* We've just finished generating code to do an initialization or
3167 finalization. SENTRY_IF_STMT is the if-statement we used to guard
3168 the initialization. */
3171 finish_static_initialization_or_destruction (sentry_if_stmt)
3172 tree sentry_if_stmt;
3174 finish_then_clause (sentry_if_stmt);
3177 /* Now that we're done with DECL we don't need to pretend to be a
3178 member of its class any longer. */
3179 DECL_CONTEXT (current_function_decl) = NULL_TREE;
3180 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
3183 /* Generate code to do the static initialization of DECL. The
3184 initialization is INIT. If DECL may be initialized more than once
3185 in different object files, SENTRY is the guard variable to
3186 check. PRIORITY is the priority for the initialization. */
3189 do_static_initialization (decl, init)
3194 tree sentry_if_stmt;
3196 /* Set up for the initialization. */
3198 = start_static_initialization_or_destruction (decl,
3201 /* Do the initialization itself. */
3202 if (IS_AGGR_TYPE (TREE_TYPE (decl))
3203 || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
3204 expr = build_aggr_init (decl, init, 0);
3205 else if (TREE_CODE (init) == TREE_VEC)
3206 expr = build_vec_init (decl, TREE_VEC_ELT (init, 0),
3207 TREE_VEC_ELT (init, 1),
3208 TREE_VEC_ELT (init, 2), 0);
3211 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
3212 TREE_SIDE_EFFECTS (expr) = 1;
3214 finish_expr_stmt (expr);
3216 /* If we're using __cxa_atexit, register a a function that calls the
3217 destructor for the object. */
3218 if (flag_use_cxa_atexit)
3219 register_dtor_fn (decl);
3222 finish_static_initialization_or_destruction (sentry_if_stmt);
3225 /* Generate code to do the static destruction of DECL. If DECL may be
3226 initialized more than once in different object files, SENTRY is the
3227 guard variable to check. PRIORITY is the priority for the
3231 do_static_destruction (decl)
3234 tree sentry_if_stmt;
3236 /* If we're using __cxa_atexit, then destructors are registered
3237 immediately after objects are initialized. */
3238 my_friendly_assert (!flag_use_cxa_atexit, 20000121);
3240 /* If we don't need a destructor, there's nothing to do. */
3241 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
3244 /* Actually do the destruction. */
3245 sentry_if_stmt = start_static_initialization_or_destruction (decl,
3247 finish_expr_stmt (build_cleanup (decl));
3248 finish_static_initialization_or_destruction (sentry_if_stmt);
3251 /* VARS is a list of variables with static storage duration which may
3252 need initialization and/or finalization. Remove those variables
3253 that don't really need to be initialized or finalized, and return
3254 the resulting list. The order in which the variables appear in
3255 VARS is in reverse order of the order in which they should actually
3256 be initialized. The list we return is in the unreversed order;
3257 i.e., the first variable should be initialized first. */
3260 prune_vars_needing_no_initialization (vars)
3266 for (var = vars, result = NULL_TREE;
3268 var = TREE_CHAIN (var))
3270 tree decl = TREE_VALUE (var);
3271 tree init = TREE_PURPOSE (var);
3273 /* Deal gracefully with error. */
3274 if (decl == error_mark_node)
3277 /* The only things that can be initialized are variables. */
3278 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
3280 /* If this object is not defined, we don't need to do anything
3282 if (DECL_EXTERNAL (decl))
3285 /* Also, if the initializer already contains errors, we can bail
3287 if (init && TREE_CODE (init) == TREE_LIST
3288 && value_member (error_mark_node, init))
3291 /* This variable is going to need initialization and/or
3292 finalization, so we add it to the list. */
3293 result = tree_cons (init, decl, result);
3299 /* Make sure we have told the back end about all the variables in
3303 write_out_vars (vars)
3308 for (v = vars; v; v = TREE_CHAIN (v))
3309 if (! TREE_ASM_WRITTEN (TREE_VALUE (v)))
3310 rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1);
3313 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3314 (otherwise) that will initialize all gobal objects with static
3315 storage duration having the indicated PRIORITY. */
3318 generate_ctor_or_dtor_function (constructor_p, priority)
3327 /* We use `I' to indicate initialization and `D' to indicate
3334 /* Begin the function. */
3335 body = start_objects (function_key, priority);
3337 /* Call the static storage duration function with appropriate
3339 for (i = 0; i < ssdf_decls->elements_used; ++i)
3341 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
3343 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
3345 finish_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls, i),
3349 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3350 calls to any functions marked with attributes indicating that
3351 they should be called at initialization- or destruction-time. */
3352 if (priority == DEFAULT_INIT_PRIORITY)
3356 for (fns = constructor_p ? static_ctors : static_dtors;
3358 fns = TREE_CHAIN (fns))
3359 finish_expr_stmt (build_function_call (TREE_VALUE (fns), NULL_TREE));
3362 /* Close out the function. */
3363 finish_objects (function_key, priority, body);
3366 /* Generate constructor and destructor functions for the priority
3370 generate_ctor_and_dtor_functions_for_priority (n, data)
3372 void *data ATTRIBUTE_UNUSED;
3374 int priority = (int) n->key;
3375 priority_info pi = (priority_info) n->value;
3377 /* Generate the functions themselves, but only if they are really
3379 if (pi->initializations_p
3380 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
3381 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3383 if (pi->destructions_p
3384 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
3385 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3388 /* Keep iterating. */
3392 /* This routine is called from the last rule in yyparse ().
3393 Its job is to create all the code needed to initialize and
3394 destroy the global aggregates. We do the destruction
3395 first, since that way we only need to reverse the decls once. */
3401 int start_time, this_time;
3408 /* Bad parse errors. Just forget about it. */
3409 if (! global_bindings_p () || current_class_type || decl_namespace_list)
3412 start_time = get_run_time ();
3414 /* Otherwise, GDB can get confused, because in only knows
3415 about source for LINENO-1 lines. */
3418 interface_unknown = 1;
3421 /* We now have to write out all the stuff we put off writing out.
3424 o Template specializations that we have not yet instantiated,
3425 but which are needed.
3426 o Initialization and destruction for non-local objects with
3427 static storage duration. (Local objects with static storage
3428 duration are initialized when their scope is first entered,
3429 and are cleaned up via atexit.)
3430 o Virtual function tables.
3432 All of these may cause others to be needed. For example,
3433 instantiating one function may cause another to be needed, and
3434 generating the intiailzer for an object may cause templates to be
3435 instantiated, etc., etc. */
3437 this_time = get_run_time ();
3438 parse_time -= this_time - start_time;
3439 varconst_time += this_time - start_time;
3440 start_time = get_run_time ();
3442 if (new_abi_rtti_p ())
3443 emit_support_tinfos ();
3449 /* If there are templates that we've put off instantiating, do
3451 instantiate_pending_templates ();
3453 /* Write out virtual tables as required. Note that writing out
3454 the virtual table for a template class may cause the
3455 instantiation of members of that class. */
3456 if (walk_globals (vtable_decl_p,
3457 finish_vtable_vardecl,
3461 /* Write out needed type info variables. Writing out one variable
3462 might cause others to be needed. */
3463 if (new_abi_rtti_p ()
3464 && walk_globals (tinfo_decl_p, emit_tinfo_decl, /*data=*/0))
3467 /* The list of objects with static storage duration is built up
3468 in reverse order. We clear STATIC_AGGREGATES so that any new
3469 aggregates added during the initialization of these will be
3470 initialized in the correct order when we next come around the
3472 vars = prune_vars_needing_no_initialization (static_aggregates);
3473 static_aggregates = NULL_TREE;
3479 /* We need to start a new initialization function each time
3480 through the loop. That's because we need to know which
3481 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3482 isn't computed until a function is finished, and written
3483 out. That's a deficiency in the back-end. When this is
3484 fixed, these initialization functions could all become
3485 inline, with resulting performance improvements. */
3486 tree ssdf_body = start_static_storage_duration_function ();
3488 /* Make sure the back end knows about all the variables. */
3489 write_out_vars (vars);
3491 /* First generate code to do all the initializations. */
3492 for (v = vars; v; v = TREE_CHAIN (v))
3493 do_static_initialization (TREE_VALUE (v),
3496 /* Then, generate code to do all the destructions. Do these
3497 in reverse order so that the most recently constructed
3498 variable is the first destroyed. If we're using
3499 __cxa_atexit, then we don't need to do this; functions
3500 we're registered at initialization time to destroy the
3502 if (!flag_use_cxa_atexit)
3504 vars = nreverse (vars);
3505 for (v = vars; v; v = TREE_CHAIN (v))
3506 do_static_destruction (TREE_VALUE (v));
3511 /* Finish up the static storage duration function for this
3513 finish_static_storage_duration_function (ssdf_body);
3515 /* All those initializations and finalizations might cause
3516 us to need more inline functions, more template
3517 instantiations, etc. */
3521 /* Go through the various inline functions, and see if any need
3523 for (i = 0; i < saved_inlines_used; ++i)
3525 tree decl = VARRAY_TREE (saved_inlines, i);
3526 import_export_decl (decl);
3527 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
3529 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
3531 /* Even though we're already at the top-level, we push
3532 there again. That way, when we pop back a few lines
3533 hence, all of our state is restored. Otherwise,
3534 finish_function doesn't clean things up, and we end
3535 up with CURRENT_FUNCTION_DECL set. */
3536 push_to_top_level ();
3537 if (DECL_TINFO_FN_P (decl))
3538 synthesize_tinfo_fn (decl);
3540 synthesize_method (decl);
3541 pop_from_top_level ();
3546 /* Mark all functions that might deal with exception-handling as
3548 mark_all_runtime_matches ();
3550 /* We lie to the back-end, pretending that some functions are
3551 not defined when they really are. This keeps these functions
3552 from being put out unncessarily. But, we must stop lying
3553 when the functions are referenced, or if they are not comdat
3554 since they need to be put out now. */
3555 for (i = 0; i < saved_inlines_used; ++i)
3557 tree decl = VARRAY_TREE (saved_inlines, i);
3559 if (DECL_NOT_REALLY_EXTERN (decl)
3560 && DECL_INITIAL (decl)
3561 && DECL_NEEDED_P (decl))
3562 DECL_EXTERNAL (decl) = 0;
3564 /* If we're going to need to write this function out, and
3565 there's already a body for it, create RTL for it now.
3566 (There might be no body if this is a method we haven't
3567 gotten around to synthesizing yet.) */
3568 if (!DECL_EXTERNAL (decl)
3569 && DECL_NEEDED_P (decl)
3570 && DECL_SAVED_TREE (decl)
3571 && !DECL_SAVED_INSNS (decl)
3572 && !TREE_ASM_WRITTEN (decl))
3574 int saved_not_really_extern;
3576 /* When we call finish_function in expand_body, it will
3577 try to reset DECL_NOT_REALLY_EXTERN so we save and
3579 saved_not_really_extern = DECL_NOT_REALLY_EXTERN (decl);
3580 /* Generate RTL for this function now that we know we
3583 /* Undo the damage done by finish_function. */
3584 DECL_EXTERNAL (decl) = 0;
3585 DECL_NOT_REALLY_EXTERN (decl) = saved_not_really_extern;
3586 /* If we're compiling -fsyntax-only pretend that this
3587 function has been written out so that we don't try to
3589 if (flag_syntax_only)
3590 TREE_ASM_WRITTEN (decl) = 1;
3595 if (saved_inlines_used
3596 && wrapup_global_declarations (&VARRAY_TREE (saved_inlines, 0),
3597 saved_inlines_used))
3599 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
3602 /* Static data members are just like namespace-scope globals. */
3603 for (i = 0; i < pending_statics_used; ++i)
3605 tree decl = VARRAY_TREE (pending_statics, i);
3606 if (TREE_ASM_WRITTEN (decl))
3608 import_export_decl (decl);
3609 if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
3610 DECL_EXTERNAL (decl) = 0;
3613 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
3614 pending_statics_used))
3619 /* We give C linkage to static constructors and destructors. */
3620 push_lang_context (lang_name_c);
3622 /* Generate initialization and destruction functions for all
3623 priorities for which they are required. */
3624 if (priority_info_map)
3625 splay_tree_foreach (priority_info_map,
3626 generate_ctor_and_dtor_functions_for_priority,
3629 /* We're done with the splay-tree now. */
3630 if (priority_info_map)
3631 splay_tree_delete (priority_info_map);
3633 /* We're done with static constructors, so we can go back to "C++"
3635 pop_lang_context ();
3637 /* Now delete from the chain of variables all virtual function tables.
3638 We output them all ourselves, because each will be treated
3639 specially. We don't do this if we're just doing semantic
3640 analysis, and not code-generation. */
3641 if (!flag_syntax_only)
3642 walk_globals (vtable_decl_p, prune_vtable_vardecl, /*data=*/0);
3644 /* Now, issue warnings about static, but not defined, functions,
3645 etc., and emit debugging information. */
3646 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
3647 if (pending_statics)
3648 check_global_declarations (&VARRAY_TREE (pending_statics, 0),
3649 pending_statics_used);
3653 /* The entire file is now complete. If requested, dump everything
3655 if (flag_dump_translation_unit)
3656 dump_node_to_file (global_namespace, flag_dump_translation_unit);
3658 /* If there's some tool that wants to examine the entire translation
3659 unit, let it do so now. */
3661 (*back_end_hook) (global_namespace);
3663 this_time = get_run_time ();
3664 parse_time -= this_time - start_time;
3665 varconst_time += this_time - start_time;
3667 if (flag_detailed_statistics)
3669 dump_tree_statistics ();
3670 dump_time_statistics ();
3674 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3675 expr. Since it was parsed like a type, we need to wade through and fix
3676 that. Unfortunately, since operator() is left-associative, we can't use
3677 tail recursion. In the above example, TYPE is `A', and DECL is
3680 Maybe this shouldn't be recursive, but how often will it actually be
3684 reparse_absdcl_as_expr (type, decl)
3687 /* do build_functional_cast (type, NULL_TREE) at bottom */
3688 if (TREE_OPERAND (decl, 0) == NULL_TREE)
3689 return build_functional_cast (type, NULL_TREE);
3692 decl = reparse_absdcl_as_expr (type, TREE_OPERAND (decl, 0));
3694 decl = build_x_function_call (decl, NULL_TREE, current_class_ref);
3696 if (TREE_CODE (decl) == CALL_EXPR
3697 && (! TREE_TYPE (decl)
3698 || TREE_CODE (TREE_TYPE (decl)) != VOID_TYPE))
3699 decl = require_complete_type (decl);
3704 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3705 out to be an expr. Since it was parsed like a type, we need to wade
3706 through and fix that. Since casts are right-associative, we are
3707 reversing the order, so we don't have to recurse.
3709 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3713 reparse_absdcl_as_casts (decl, expr)
3718 if (TREE_CODE (expr) == CONSTRUCTOR
3719 && TREE_TYPE (expr) == 0)
3721 type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl)));
3722 decl = TREE_OPERAND (decl, 0);
3724 expr = digest_init (type, expr, (tree *) 0);
3725 if (TREE_CODE (type) == ARRAY_TYPE && TYPE_SIZE (type) == 0)
3727 int failure = complete_array_type (type, expr, 1);
3729 my_friendly_abort (78);
3735 type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl)));
3736 decl = TREE_OPERAND (decl, 0);
3737 expr = build_c_cast (type, expr);
3740 if (warn_old_style_cast && ! in_system_header
3741 && current_lang_name != lang_name_c)
3742 warning ("use of old-style cast");
3747 /* Given plain tree nodes for an expression, build up the full semantics. */
3750 build_expr_from_tree (t)
3753 if (t == NULL_TREE || t == error_mark_node)
3756 switch (TREE_CODE (t))
3758 case IDENTIFIER_NODE:
3759 return do_identifier (t, 0, NULL_TREE);
3762 if (LOOKUP_EXPR_GLOBAL (t))
3763 return do_scoped_id (TREE_OPERAND (t, 0), 0);
3765 return do_identifier (TREE_OPERAND (t, 0), 0, NULL_TREE);
3767 case TEMPLATE_ID_EXPR:
3768 return (lookup_template_function
3769 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3770 build_expr_from_tree (TREE_OPERAND (t, 1))));
3773 return build_x_indirect_ref
3774 (build_expr_from_tree (TREE_OPERAND (t, 0)), "unary *");
3777 return build_functional_cast
3778 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3780 case REINTERPRET_CAST_EXPR:
3781 return build_reinterpret_cast
3782 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3784 case CONST_CAST_EXPR:
3785 return build_const_cast
3786 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3788 case DYNAMIC_CAST_EXPR:
3789 return build_dynamic_cast
3790 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3792 case STATIC_CAST_EXPR:
3793 return build_static_cast
3794 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3796 case PREDECREMENT_EXPR:
3797 case PREINCREMENT_EXPR:
3798 case POSTDECREMENT_EXPR:
3799 case POSTINCREMENT_EXPR:
3803 case TRUTH_NOT_EXPR:
3805 case CONVERT_EXPR: /* Unary + */
3810 return build_x_unary_op (TREE_CODE (t),
3811 build_expr_from_tree (TREE_OPERAND (t, 0)));
3816 case TRUNC_DIV_EXPR:
3818 case FLOOR_DIV_EXPR:
3819 case ROUND_DIV_EXPR:
3820 case EXACT_DIV_EXPR:
3822 case BIT_ANDTC_EXPR:
3825 case TRUNC_MOD_EXPR:
3826 case FLOOR_MOD_EXPR:
3827 case TRUTH_ANDIF_EXPR:
3828 case TRUTH_ORIF_EXPR:
3829 case TRUTH_AND_EXPR:
3844 return build_x_binary_op
3846 build_expr_from_tree (TREE_OPERAND (t, 0)),
3847 build_expr_from_tree (TREE_OPERAND (t, 1)));
3850 return build_m_component_ref
3851 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3852 build_expr_from_tree (TREE_OPERAND (t, 1)));
3855 return build_offset_ref (TREE_OPERAND (t, 0), TREE_OPERAND (t, 1));
3858 if (TREE_OPERAND (t, 0) == NULL_TREE)
3860 return build_parse_node (ARRAY_REF, NULL_TREE,
3861 build_expr_from_tree (TREE_OPERAND (t, 1)));
3862 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t, 0)),
3863 build_expr_from_tree (TREE_OPERAND (t, 1)));
3868 tree r = build_expr_from_tree (TREE_OPERAND (t, 0));
3869 if (TREE_CODE_CLASS (TREE_CODE (r)) != 't')
3871 return TREE_CODE (t) == SIZEOF_EXPR ? c_sizeof (r) : c_alignof (r);
3875 return build_x_modify_expr
3876 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3877 TREE_CODE (TREE_OPERAND (t, 1)),
3878 build_expr_from_tree (TREE_OPERAND (t, 2)));
3881 return build_x_arrow
3882 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3886 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3887 build_expr_from_tree (TREE_OPERAND (t, 1)),
3888 build_expr_from_tree (TREE_OPERAND (t, 2)),
3889 NEW_EXPR_USE_GLOBAL (t));
3892 return delete_sanity
3893 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3894 build_expr_from_tree (TREE_OPERAND (t, 1)),
3895 DELETE_EXPR_USE_VEC (t), DELETE_EXPR_USE_GLOBAL (t));
3898 if (TREE_OPERAND (t, 1) == NULL_TREE)
3899 return build_x_compound_expr
3900 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3902 my_friendly_abort (42);
3904 case METHOD_CALL_EXPR:
3905 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
3907 tree ref = TREE_OPERAND (t, 0);
3908 return build_scoped_method_call
3909 (build_expr_from_tree (TREE_OPERAND (t, 1)),
3910 build_expr_from_tree (TREE_OPERAND (ref, 0)),
3911 TREE_OPERAND (ref, 1),
3912 build_expr_from_tree (TREE_OPERAND (t, 2)));
3916 tree fn = TREE_OPERAND (t, 0);
3918 /* We can get a TEMPLATE_ID_EXPR here on code like:
3922 so we must resolve that. However, we can also get things
3923 like a BIT_NOT_EXPR here, when referring to a destructor,
3924 and things like that are not correctly resolved by
3925 build_expr_from_tree. So, just use build_expr_from_tree
3926 when we really need it. */
3927 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3928 fn = lookup_template_function
3929 (TREE_OPERAND (fn, 0),
3930 build_expr_from_tree (TREE_OPERAND (fn, 1)));
3932 return build_method_call
3933 (build_expr_from_tree (TREE_OPERAND (t, 1)),
3935 build_expr_from_tree (TREE_OPERAND (t, 2)),
3936 NULL_TREE, LOOKUP_NORMAL);
3940 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
3942 tree ref = TREE_OPERAND (t, 0);
3943 return build_member_call
3944 (build_expr_from_tree (TREE_OPERAND (ref, 0)),
3945 TREE_OPERAND (ref, 1),
3946 build_expr_from_tree (TREE_OPERAND (t, 1)));
3950 tree name = TREE_OPERAND (t, 0);
3952 tree args = build_expr_from_tree (TREE_OPERAND (t, 1));
3953 if (args != NULL_TREE && TREE_CODE (name) == LOOKUP_EXPR
3954 && !LOOKUP_EXPR_GLOBAL (name)
3955 && TREE_CODE ((id = TREE_OPERAND (name, 0))) == IDENTIFIER_NODE
3956 && (!current_class_type
3957 || !lookup_member (current_class_type, id, 0, 0)))
3959 /* Do Koenig lookup if there are no class members. */
3960 name = do_identifier (id, 0, args);
3962 else if (TREE_CODE (name) == TEMPLATE_ID_EXPR
3963 || ! really_overloaded_fn (name))
3964 name = build_expr_from_tree (name);
3965 return build_x_function_call (name, args, current_class_ref);
3969 return build_x_conditional_expr
3970 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3971 build_expr_from_tree (TREE_OPERAND (t, 1)),
3972 build_expr_from_tree (TREE_OPERAND (t, 2)));
3974 case PSEUDO_DTOR_EXPR:
3975 return (finish_pseudo_destructor_call_expr
3976 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3977 build_expr_from_tree (TREE_OPERAND (t, 1)),
3978 build_expr_from_tree (TREE_OPERAND (t, 2))));
3982 tree purpose, value, chain;
3984 if (t == void_list_node)
3987 purpose = TREE_PURPOSE (t);
3989 purpose = build_expr_from_tree (purpose);
3990 value = TREE_VALUE (t);
3992 value = build_expr_from_tree (value);
3993 chain = TREE_CHAIN (t);
3994 if (chain && chain != void_type_node)
3995 chain = build_expr_from_tree (chain);
3996 return tree_cons (purpose, value, chain);
4001 tree object = build_expr_from_tree (TREE_OPERAND (t, 0));
4002 tree field = TREE_OPERAND (t, 1);
4004 /* We use a COMPONENT_REF to indicate things of the form `x.b'
4005 and `x.A::b'. We must distinguish between those cases
4007 if (TREE_CODE (field) == SCOPE_REF)
4008 return build_object_ref (object,
4009 TREE_OPERAND (field, 0),
4010 TREE_OPERAND (field, 1));
4012 return build_x_component_ref (object, field,
4017 return build_throw (build_expr_from_tree (TREE_OPERAND (t, 0)));
4023 /* digest_init will do the wrong thing if we let it. */
4024 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
4027 r = build_nt (CONSTRUCTOR, NULL_TREE,
4028 build_expr_from_tree (CONSTRUCTOR_ELTS (t)));
4029 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
4032 return digest_init (TREE_TYPE (t), r, 0);
4037 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t, 0))) == 't')
4038 return get_typeid (TREE_OPERAND (t, 0));
4039 return build_typeid (build_expr_from_tree (TREE_OPERAND (t, 0)));
4042 return convert_from_reference (t);
4045 return build_va_arg (build_expr_from_tree (TREE_OPERAND (t, 0)),
4053 /* This is something of the form `int (*a)++' that has turned out to be an
4054 expr. It was only converted into parse nodes, so we need to go through
4055 and build up the semantics. Most of the work is done by
4056 build_expr_from_tree, above.
4058 In the above example, TYPE is `int' and DECL is `*a'. */
4061 reparse_decl_as_expr (type, decl)
4064 decl = build_expr_from_tree (decl);
4066 return build_functional_cast (type, build_tree_list (NULL_TREE, decl));
4071 /* This is something of the form `int (*a)' that has turned out to be a
4072 decl. It was only converted into parse nodes, so we need to do the
4073 checking that make_{pointer,reference}_declarator do. */
4076 finish_decl_parsing (decl)
4079 extern int current_class_depth;
4081 switch (TREE_CODE (decl))
4083 case IDENTIFIER_NODE:
4086 return make_pointer_declarator
4087 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4089 return make_reference_declarator
4090 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4092 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4095 push_nested_class (TREE_TYPE (TREE_OPERAND (decl, 0)), 3);
4096 TREE_COMPLEXITY (decl) = current_class_depth;
4099 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4102 /* For attribute handling. */
4103 TREE_VALUE (decl) = finish_decl_parsing (TREE_VALUE (decl));
4106 my_friendly_abort (5);
4112 check_cp_case_value (value)
4115 if (value == NULL_TREE)
4118 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4119 STRIP_TYPE_NOPS (value);
4121 if (TREE_READONLY_DECL_P (value))
4123 value = decl_constant_value (value);
4124 STRIP_TYPE_NOPS (value);
4126 value = fold (value);
4128 if (TREE_CODE (value) != INTEGER_CST
4129 && value != error_mark_node)
4131 cp_error ("case label `%E' does not reduce to an integer constant",
4133 value = error_mark_node;
4136 /* Promote char or short to int. */
4137 value = default_conversion (value);
4139 constant_expression_warning (value);
4144 /* Return 1 if root encloses child. */
4147 is_namespace_ancestor (root, child)
4152 if (root == global_namespace)
4154 if (child == global_namespace)
4156 return is_namespace_ancestor (root, CP_DECL_CONTEXT (child));
4160 /* Return the namespace that is the common ancestor
4161 of two given namespaces. */
4164 namespace_ancestor (ns1, ns2)
4167 if (is_namespace_ancestor (ns1, ns2))
4169 return namespace_ancestor (CP_DECL_CONTEXT (ns1), ns2);
4172 /* Insert used into the using list of user. Set indirect_flag if this
4173 directive is not directly from the source. Also find the common
4174 ancestor and let our users know about the new namespace */
4176 add_using_namespace (user, used, indirect)
4182 /* Using oneself is a no-op. */
4185 my_friendly_assert (TREE_CODE (user) == NAMESPACE_DECL, 380);
4186 my_friendly_assert (TREE_CODE (used) == NAMESPACE_DECL, 380);
4187 /* Check if we already have this. */
4188 t = purpose_member (used, DECL_NAMESPACE_USING (user));
4192 /* Promote to direct usage. */
4193 TREE_INDIRECT_USING (t) = 0;
4197 /* Add used to the user's using list. */
4198 DECL_NAMESPACE_USING (user)
4199 = tree_cons (used, namespace_ancestor (user, used),
4200 DECL_NAMESPACE_USING (user));
4202 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect;
4204 /* Add user to the used's users list. */
4205 DECL_NAMESPACE_USERS (used)
4206 = tree_cons (user, 0, DECL_NAMESPACE_USERS (used));
4208 /* Recursively add all namespaces used. */
4209 for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t))
4210 /* indirect usage */
4211 add_using_namespace (user, TREE_PURPOSE (t), 1);
4213 /* Tell everyone using us about the new used namespaces. */
4214 for (t = DECL_NAMESPACE_USERS (user); t; t = TREE_CHAIN (t))
4215 add_using_namespace (TREE_PURPOSE (t), used, 1);
4218 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4219 duplicates. The first list becomes the tail of the result.
4221 The algorithm is O(n^2). We could get this down to O(n log n) by
4222 doing a sort on the addresses of the functions, if that becomes
4226 merge_functions (s1, s2)
4230 for (; s2; s2 = OVL_NEXT (s2))
4232 tree fn = OVL_CURRENT (s2);
4233 if (! ovl_member (fn, s1))
4234 s1 = build_overload (fn, s1);
4239 /* This should return an error not all definitions define functions.
4240 It is not an error if we find two functions with exactly the
4241 same signature, only if these are selected in overload resolution.
4242 old is the current set of bindings, new the freshly-found binding.
4243 XXX Do we want to give *all* candidates in case of ambiguity?
4244 XXX In what way should I treat extern declarations?
4245 XXX I don't want to repeat the entire duplicate_decls here */
4248 ambiguous_decl (name, old, new, flags)
4255 my_friendly_assert (old != NULL_TREE, 393);
4256 /* Copy the value. */
4257 val = BINDING_VALUE (new);
4259 switch (TREE_CODE (val))
4262 /* If we expect types or namespaces, and not templates,
4263 or this is not a template class. */
4264 if (LOOKUP_QUALIFIERS_ONLY (flags)
4265 && !DECL_CLASS_TEMPLATE_P (val))
4269 if (LOOKUP_NAMESPACES_ONLY (flags))
4272 case NAMESPACE_DECL:
4273 if (LOOKUP_TYPES_ONLY (flags))
4277 if (LOOKUP_QUALIFIERS_ONLY (flags))
4281 if (!BINDING_VALUE (old))
4282 BINDING_VALUE (old) = val;
4283 else if (val && val != BINDING_VALUE (old))
4285 if (is_overloaded_fn (BINDING_VALUE (old))
4286 && is_overloaded_fn (val))
4288 BINDING_VALUE (old) = merge_functions (BINDING_VALUE (old),
4293 /* Some declarations are functions, some are not. */
4294 if (flags & LOOKUP_COMPLAIN)
4296 /* If we've already given this error for this lookup,
4297 BINDING_VALUE (old) is error_mark_node, so let's not
4298 repeat ourselves. */
4299 if (BINDING_VALUE (old) != error_mark_node)
4301 cp_error ("use of `%D' is ambiguous", name);
4302 cp_error_at (" first declared as `%#D' here",
4303 BINDING_VALUE (old));
4305 cp_error_at (" also declared as `%#D' here", val);
4307 BINDING_VALUE (old) = error_mark_node;
4310 /* ... and copy the type. */
4311 type = BINDING_TYPE (new);
4312 if (LOOKUP_NAMESPACES_ONLY (flags))
4314 if (!BINDING_TYPE (old))
4315 BINDING_TYPE (old) = type;
4316 else if (type && BINDING_TYPE (old) != type)
4318 if (flags & LOOKUP_COMPLAIN)
4320 cp_error ("`%D' denotes an ambiguous type",name);
4321 cp_error_at (" first type here", BINDING_TYPE (old));
4322 cp_error_at (" other type here", type);
4328 /* Subroutine of unualified_namespace_lookup:
4329 Add the bindings of NAME in used namespaces to VAL.
4330 We are currently looking for names in namespace SCOPE, so we
4331 look through USINGS for using-directives of namespaces
4332 which have SCOPE as a common ancestor with the current scope.
4333 Returns zero on errors. */
4336 lookup_using_namespace (name, val, usings, scope, flags, spacesp)
4337 tree name, val, usings, scope;
4343 /* Iterate over all used namespaces in current, searching for using
4344 directives of scope. */
4345 for (iter = usings; iter; iter = TREE_CHAIN (iter))
4346 if (TREE_VALUE (iter) == scope)
4349 *spacesp = tree_cons (TREE_PURPOSE (iter), NULL_TREE,
4351 val1 = binding_for_name (name, TREE_PURPOSE (iter));
4352 /* Resolve ambiguities. */
4353 val = ambiguous_decl (name, val, val1, flags);
4355 return BINDING_VALUE (val) != error_mark_node;
4359 Accepts the NAME to lookup and its qualifying SCOPE.
4360 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4364 qualified_lookup_using_namespace (name, scope, result, flags)
4370 /* Maintain a list of namespaces visited... */
4371 tree seen = NULL_TREE;
4372 /* ... and a list of namespace yet to see. */
4373 tree todo = NULL_TREE;
4375 while (scope && (result != error_mark_node))
4377 seen = tree_cons (scope, NULL_TREE, seen);
4378 result = ambiguous_decl (name, result,
4379 binding_for_name (name, scope), flags);
4380 if (!BINDING_VALUE (result) && !BINDING_TYPE (result))
4381 /* Consider using directives. */
4382 for (usings = DECL_NAMESPACE_USING (scope); usings;
4383 usings = TREE_CHAIN (usings))
4384 /* If this was a real directive, and we have not seen it. */
4385 if (!TREE_INDIRECT_USING (usings)
4386 && !purpose_member (TREE_PURPOSE (usings), seen))
4387 todo = tree_cons (TREE_PURPOSE (usings), NULL_TREE, todo);
4390 scope = TREE_PURPOSE (todo);
4391 todo = TREE_CHAIN (todo);
4394 scope = NULL_TREE; /* If there never was a todo list. */
4396 return result != error_mark_node;
4399 /* [namespace.memdef]/2 */
4401 /* Set the context of a declaration to scope. Complain if we are not
4405 set_decl_namespace (decl, scope, friendp)
4411 if (scope == std_node)
4412 scope = global_namespace;
4413 /* Get rid of namespace aliases. */
4414 scope = ORIGINAL_NAMESPACE (scope);
4416 /* It is ok for friends to be qualified in parallel space. */
4417 if (!friendp && !is_namespace_ancestor (current_namespace, scope))
4418 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4420 DECL_CONTEXT (decl) = FROB_CONTEXT (scope);
4421 if (scope != current_namespace)
4423 /* See whether this has been declared in the namespace. */
4424 old = namespace_binding (DECL_NAME (decl), scope);
4426 /* No old declaration at all. */
4428 if (!is_overloaded_fn (decl))
4429 /* Don't compare non-function decls with decls_match here,
4430 since it can't check for the correct constness at this
4431 point. pushdecl will find those errors later. */
4433 /* Since decl is a function, old should contain a function decl. */
4434 if (!is_overloaded_fn (old))
4436 if (processing_template_decl || processing_specialization)
4437 /* We have not yet called push_template_decl to turn the
4438 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4439 won't match. But, we'll check later, when we construct the
4442 for (; old; old = OVL_NEXT (old))
4443 if (decls_match (decl, OVL_CURRENT (old)))
4449 cp_error ("`%D' should have been declared inside `%D'",
4453 /* Compute the namespace where a declaration is defined. */
4456 decl_namespace (decl)
4459 while (DECL_CONTEXT (decl))
4461 decl = DECL_CONTEXT (decl);
4462 if (TREE_CODE (decl) == NAMESPACE_DECL)
4464 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 't')
4465 decl = TYPE_STUB_DECL (decl);
4466 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd', 390);
4469 return global_namespace;
4472 /* Return the namespace where the current declaration is declared. */
4475 current_decl_namespace ()
4478 /* If we have been pushed into a different namespace, use it. */
4479 if (decl_namespace_list)
4480 return TREE_PURPOSE (decl_namespace_list);
4482 if (current_class_type)
4483 result = decl_namespace (TYPE_STUB_DECL (current_class_type));
4484 else if (current_function_decl)
4485 result = decl_namespace (current_function_decl);
4487 result = current_namespace;
4491 /* Temporarily set the namespace for the current declaration. */
4494 push_decl_namespace (decl)
4497 if (TREE_CODE (decl) != NAMESPACE_DECL)
4498 decl = decl_namespace (decl);
4499 decl_namespace_list = tree_cons (decl, NULL_TREE, decl_namespace_list);
4503 pop_decl_namespace ()
4505 decl_namespace_list = TREE_CHAIN (decl_namespace_list);
4508 /* Enter a class or namespace scope. */
4514 if (TREE_CODE (t) == NAMESPACE_DECL)
4515 push_decl_namespace (t);
4520 /* Leave scope pushed by push_scope. */
4526 if (TREE_CODE (t) == NAMESPACE_DECL)
4527 pop_decl_namespace ();
4532 /* [basic.lookup.koenig] */
4533 /* A non-zero return value in the functions below indicates an error.
4534 All nodes allocated in the procedure are on the scratch obstack. */
4544 static int arg_assoc PARAMS ((struct arg_lookup*, tree));
4545 static int arg_assoc_args PARAMS ((struct arg_lookup*, tree));
4546 static int arg_assoc_type PARAMS ((struct arg_lookup*, tree));
4547 static int add_function PARAMS ((struct arg_lookup *, tree));
4548 static int arg_assoc_namespace PARAMS ((struct arg_lookup *, tree));
4549 static int arg_assoc_class PARAMS ((struct arg_lookup *, tree));
4550 static int arg_assoc_template_arg PARAMS ((struct arg_lookup*, tree));
4552 /* Add a function to the lookup structure.
4553 Returns 1 on error. */
4556 add_function (k, fn)
4557 struct arg_lookup *k;
4560 /* We used to check here to see if the function was already in the list,
4561 but that's O(n^2), which is just too expensive for function lookup.
4562 Now we deal with the occasional duplicate in joust. In doing this, we
4563 assume that the number of duplicates will be small compared to the
4564 total number of functions being compared, which should usually be the
4567 /* We must find only functions, or exactly one non-function. */
4568 if (k->functions && is_overloaded_fn (k->functions)
4569 && is_overloaded_fn (fn))
4570 k->functions = build_overload (fn, k->functions);
4571 else if (k->functions)
4573 tree f1 = OVL_CURRENT (k->functions);
4575 if (is_overloaded_fn (f1))
4577 fn = f1; f1 = f2; f2 = fn;
4579 cp_error_at ("`%D' is not a function,", f1);
4580 cp_error_at (" conflict with `%D'", f2);
4581 cp_error (" in call to `%D'", k->name);
4589 /* Add functions of a namespace to the lookup structure.
4590 Returns 1 on error. */
4593 arg_assoc_namespace (k, scope)
4594 struct arg_lookup *k;
4599 if (purpose_member (scope, k->namespaces))
4601 k->namespaces = tree_cons (scope, NULL_TREE, k->namespaces);
4603 value = namespace_binding (k->name, scope);
4607 for (; value; value = OVL_NEXT (value))
4608 if (add_function (k, OVL_CURRENT (value)))
4614 /* Adds everything associated with a template argument to the lookup
4615 structure. Returns 1 on error. */
4618 arg_assoc_template_arg (k, arg)
4619 struct arg_lookup* k;
4622 /* [basic.lookup.koenig]
4624 If T is a template-id, its associated namespaces and classes are
4625 ... the namespaces and classes associated with the types of the
4626 template arguments provided for template type parameters
4627 (excluding template template parameters); the namespaces in which
4628 any template template arguments are defined; and the classes in
4629 which any member templates used as template template arguments
4630 are defined. [Note: non-type template arguments do not
4631 contribute to the set of associated namespaces. ] */
4633 /* Consider first template template arguments. */
4634 if (TREE_CODE (arg) == TEMPLATE_DECL)
4636 tree ctx = CP_DECL_CONTEXT (arg);
4638 /* It's not a member template. */
4639 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4640 return arg_assoc_namespace (k, ctx);
4641 /* Otherwise, it must be member template. */
4643 return arg_assoc_class (k, ctx);
4645 /* It's not a template template argument, but it is a type template
4647 else if (TREE_CODE_CLASS (TREE_CODE (arg)) == 't')
4648 return arg_assoc_type (k, arg);
4649 /* It's a non-type template argument. */
4654 /* Adds everything associated with class to the lookup structure.
4655 Returns 1 on error. */
4658 arg_assoc_class (k, type)
4659 struct arg_lookup* k;
4662 tree list, friends, context;
4665 /* Backend build structures, such as __builtin_va_list, aren't
4666 affected by all this. */
4667 if (!CLASS_TYPE_P (type))
4670 if (purpose_member (type, k->classes))
4672 k->classes = tree_cons (type, NULL_TREE, k->classes);
4674 context = decl_namespace (TYPE_MAIN_DECL (type));
4675 if (arg_assoc_namespace (k, context))
4678 /* Process baseclasses. */
4679 for (i = 0; i < CLASSTYPE_N_BASECLASSES (type); i++)
4680 if (arg_assoc_class (k, TYPE_BINFO_BASETYPE (type, i)))
4683 /* Process friends. */
4684 for (list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list;
4685 list = TREE_CHAIN (list))
4686 if (k->name == TREE_PURPOSE (list))
4687 for (friends = TREE_VALUE (list); friends;
4688 friends = TREE_CHAIN (friends))
4689 /* Only interested in global functions with potentially hidden
4690 (i.e. unqualified) declarations. */
4691 if (TREE_PURPOSE (list) == error_mark_node && TREE_VALUE (list)
4692 && decl_namespace (TREE_VALUE (list)) == context)
4693 if (add_function (k, TREE_VALUE (list)))
4696 /* Process template arguments. */
4697 if (CLASSTYPE_TEMPLATE_INFO (type))
4699 list = innermost_args (CLASSTYPE_TI_ARGS (type));
4700 for (i = 0; i < TREE_VEC_LENGTH (list); ++i)
4701 arg_assoc_template_arg (k, TREE_VEC_ELT (list, i));
4707 /* Adds everything associated with a given type.
4708 Returns 1 on error. */
4711 arg_assoc_type (k, type)
4712 struct arg_lookup *k;
4715 switch (TREE_CODE (type))
4725 if (TYPE_PTRMEMFUNC_P (type))
4726 return arg_assoc_type (k, TYPE_PTRMEMFUNC_FN_TYPE (type));
4727 return arg_assoc_class (k, type);
4729 case REFERENCE_TYPE:
4731 return arg_assoc_type (k, TREE_TYPE (type));
4734 return arg_assoc_namespace (k, decl_namespace (TYPE_MAIN_DECL (type)));
4736 /* Pointer to member: associate class type and value type. */
4737 if (arg_assoc_type (k, TYPE_OFFSET_BASETYPE (type)))
4739 return arg_assoc_type (k, TREE_TYPE (type));
4741 /* The basetype is referenced in the first arg type, so just
4744 /* Associate the parameter types. */
4745 if (arg_assoc_args (k, TYPE_ARG_TYPES (type)))
4747 /* Associate the return type. */
4748 return arg_assoc_type (k, TREE_TYPE (type));
4749 case TEMPLATE_TYPE_PARM:
4750 case TEMPLATE_TEMPLATE_PARM:
4753 if (type == unknown_type_node)
4755 /* else fall through */
4757 my_friendly_abort (390);
4762 /* Adds everything associated with arguments. Returns 1 on error. */
4765 arg_assoc_args (k, args)
4766 struct arg_lookup* k;
4769 for (; args; args = TREE_CHAIN (args))
4770 if (arg_assoc (k, TREE_VALUE (args)))
4775 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4779 struct arg_lookup* k;
4782 if (n == error_mark_node)
4785 if (TREE_CODE_CLASS (TREE_CODE (n)) == 't')
4786 return arg_assoc_type (k, n);
4788 if (! type_unknown_p (n))
4789 return arg_assoc_type (k, TREE_TYPE (n));
4791 if (TREE_CODE (n) == ADDR_EXPR)
4792 n = TREE_OPERAND (n, 0);
4793 if (TREE_CODE (n) == COMPONENT_REF)
4794 n = TREE_OPERAND (n, 1);
4795 if (TREE_CODE (n) == OFFSET_REF)
4796 n = TREE_OPERAND (n, 1);
4797 while (TREE_CODE (n) == TREE_LIST)
4800 if (TREE_CODE (n) == FUNCTION_DECL)
4801 return arg_assoc_type (k, TREE_TYPE (n));
4802 if (TREE_CODE (n) == TEMPLATE_ID_EXPR)
4804 /* [basic.lookup.koenig]
4806 If T is a template-id, its associated namespaces and classes
4807 are the namespace in which the template is defined; for
4808 member templates, the member template's class... */
4809 tree template = TREE_OPERAND (n, 0);
4810 tree args = TREE_OPERAND (n, 1);
4814 /* First, the template. There may actually be more than one if
4815 this is an overloaded function template. But, in that case,
4816 we only need the first; all the functions will be in the same
4818 template = OVL_CURRENT (template);
4820 ctx = CP_DECL_CONTEXT (template);
4822 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4824 if (arg_assoc_namespace (k, ctx) == 1)
4827 /* It must be a member template. */
4828 else if (arg_assoc_class (k, ctx) == 1)
4831 /* Now the arguments. */
4832 for (arg = args; arg != NULL_TREE; arg = TREE_CHAIN (arg))
4833 if (arg_assoc_template_arg (k, TREE_VALUE (arg)) == 1)
4838 my_friendly_assert (TREE_CODE (n) == OVERLOAD, 980715);
4840 for (; n; n = OVL_CHAIN (n))
4841 if (arg_assoc_type (k, TREE_TYPE (OVL_FUNCTION (n))))
4848 /* Performs Koenig lookup depending on arguments, where fns
4849 are the functions found in normal lookup. */
4852 lookup_arg_dependent (name, fns, args)
4857 struct arg_lookup k;
4858 tree fn = NULL_TREE;
4862 k.classes = NULL_TREE;
4864 /* Note that we've already looked at some namespaces during normal
4865 unqualified lookup, unless we found a decl in function scope. */
4867 fn = OVL_CURRENT (fns);
4868 if (fn && TREE_CODE (fn) == FUNCTION_DECL && DECL_LOCAL_FUNCTION_P (fn))
4869 k.namespaces = NULL_TREE;
4871 unqualified_namespace_lookup (name, 0, &k.namespaces);
4873 arg_assoc_args (&k, args);
4877 /* Process a namespace-alias declaration. */
4880 do_namespace_alias (alias, namespace)
4881 tree alias, namespace;
4883 if (TREE_CODE (namespace) != NAMESPACE_DECL)
4885 /* The parser did not find it, so it's not there. */
4886 cp_error ("unknown namespace `%D'", namespace);
4890 namespace = ORIGINAL_NAMESPACE (namespace);
4892 /* Build the alias. */
4893 alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node);
4894 DECL_NAMESPACE_ALIAS (alias) = namespace;
4898 /* Check a non-member using-declaration. Return the name and scope
4899 being used, and the USING_DECL, or NULL_TREE on failure. */
4902 validate_nonmember_using_decl (decl, scope, name)
4907 if (TREE_CODE (decl) == SCOPE_REF
4908 && TREE_OPERAND (decl, 0) == std_node)
4910 if (namespace_bindings_p ()
4911 && current_namespace == global_namespace)
4912 /* There's no need for a using declaration at all, here,
4913 since `std' is the same as `::'. We can't just pass this
4914 on because we'll complain later about declaring something
4915 in the same scope as a using declaration with the same
4916 name. We return NULL_TREE which indicates to the caller
4917 that there's no need to do any further processing. */
4920 *scope = global_namespace;
4921 *name = TREE_OPERAND (decl, 1);
4923 else if (TREE_CODE (decl) == SCOPE_REF)
4925 *scope = TREE_OPERAND (decl, 0);
4926 *name = TREE_OPERAND (decl, 1);
4928 /* [namespace.udecl]
4930 A using-declaration for a class member shall be a
4931 member-declaration. */
4932 if (TREE_CODE (*scope) != NAMESPACE_DECL)
4934 if (TYPE_P (*scope))
4935 cp_error ("`%T' is not a namespace", *scope);
4937 cp_error ("`%D' is not a namespace", *scope);
4941 else if (TREE_CODE (decl) == IDENTIFIER_NODE
4942 || TREE_CODE (decl) == TYPE_DECL
4943 || TREE_CODE (decl) == TEMPLATE_DECL)
4945 *scope = global_namespace;
4949 my_friendly_abort (382);
4950 if (TREE_CODE_CLASS (TREE_CODE (*name)) == 'd')
4951 *name = DECL_NAME (*name);
4952 /* Make a USING_DECL. */
4953 return push_using_decl (*scope, *name);
4956 /* Process local and global using-declarations. */
4959 do_nonmember_using_decl (scope, name, oldval, oldtype, newval, newtype)
4961 tree oldval, oldtype;
4962 tree *newval, *newtype;
4966 *newval = *newtype = NULL_TREE;
4967 decls = make_node (CPLUS_BINDING);
4968 if (!qualified_lookup_using_namespace (name, scope, decls, 0))
4972 if (!BINDING_VALUE (decls) && !BINDING_TYPE (decls))
4974 cp_error ("`%D' not declared", name);
4978 /* Check for using functions. */
4979 if (BINDING_VALUE (decls) && is_overloaded_fn (BINDING_VALUE (decls)))
4983 if (oldval && !is_overloaded_fn (oldval))
4985 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls)), oldval);
4990 for (tmp = BINDING_VALUE (decls); tmp; tmp = OVL_NEXT (tmp))
4992 tree new_fn = OVL_CURRENT (tmp);
4994 /* [namespace.udecl]
4996 If a function declaration in namespace scope or block
4997 scope has the same name and the same parameter types as a
4998 function introduced by a using declaration the program is
5000 for (tmp1 = oldval; tmp1; tmp1 = OVL_NEXT (tmp1))
5002 tree old_fn = OVL_CURRENT (tmp1);
5004 if (!OVL_USED (tmp1)
5005 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn)),
5006 TYPE_ARG_TYPES (TREE_TYPE (old_fn))))
5008 /* There was already a non-using declaration in
5009 this scope with the same parameter types. */
5010 cp_error ("`%D' is already declared in this scope",
5014 else if (duplicate_decls (new_fn, old_fn))
5015 /* We're re-using something we already used
5016 before. We don't need to add it again. */
5020 /* If we broke out of the loop, there's no reason to add
5021 this function to the using declarations for this
5026 *newval = build_overload (OVL_CURRENT (tmp), *newval);
5027 if (TREE_CODE (*newval) != OVERLOAD)
5028 *newval = ovl_cons (*newval, NULL_TREE);
5029 OVL_USED (*newval) = 1;
5034 *newval = BINDING_VALUE (decls);
5036 duplicate_decls (*newval, oldval);
5039 *newtype = BINDING_TYPE (decls);
5040 if (oldtype && *newtype && oldtype != *newtype)
5042 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5048 /* Process a using-declaration not appearing in class or local scope. */
5051 do_toplevel_using_decl (decl)
5054 tree scope, name, binding;
5055 tree oldval, oldtype, newval, newtype;
5057 decl = validate_nonmember_using_decl (decl, &scope, &name);
5058 if (decl == NULL_TREE)
5061 binding = binding_for_name (name, current_namespace);
5063 oldval = BINDING_VALUE (binding);
5064 oldtype = BINDING_TYPE (binding);
5066 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5068 /* Copy declarations found. */
5070 BINDING_VALUE (binding) = newval;
5072 BINDING_TYPE (binding) = newtype;
5076 /* Process a using-declaration at function scope. */
5079 do_local_using_decl (decl)
5083 tree oldval, oldtype, newval, newtype;
5085 decl = validate_nonmember_using_decl (decl, &scope, &name);
5086 if (decl == NULL_TREE)
5089 oldval = lookup_name_current_level (name);
5090 oldtype = lookup_type_current_level (name);
5092 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5096 if (is_overloaded_fn (newval))
5100 /* We only need to push declarations for those functions
5101 that were not already bound in the current level.
5102 The old value might be NULL_TREE, it might be a single
5103 function, or an OVERLOAD. */
5104 if (oldval && TREE_CODE (oldval) == OVERLOAD)
5105 term = OVL_FUNCTION (oldval);
5108 for (fn = newval; fn && OVL_CURRENT (fn) != term;
5110 push_overloaded_decl (OVL_CURRENT (fn),
5111 PUSH_LOCAL | PUSH_USING);
5114 push_local_binding (name, newval, PUSH_USING);
5117 set_identifier_type_value (name, newtype);
5121 do_class_using_decl (decl)
5126 if (TREE_CODE (decl) != SCOPE_REF
5127 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl, 0))) != 't')
5129 cp_error ("using-declaration for non-member at class scope");
5132 name = TREE_OPERAND (decl, 1);
5133 if (TREE_CODE (name) == BIT_NOT_EXPR)
5135 cp_error ("using-declaration for destructor");
5138 if (TREE_CODE (name) == TYPE_DECL)
5139 name = DECL_NAME (name);
5141 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 980716);
5143 value = build_lang_decl (USING_DECL, name, void_type_node);
5144 DECL_INITIAL (value) = TREE_OPERAND (decl, 0);
5148 /* Process a using-directive. */
5151 do_using_directive (namespace)
5154 if (namespace == std_node)
5156 /* using namespace A::B::C; */
5157 if (TREE_CODE (namespace) == SCOPE_REF)
5158 namespace = TREE_OPERAND (namespace, 1);
5159 if (TREE_CODE (namespace) == IDENTIFIER_NODE)
5161 /* Lookup in lexer did not find a namespace. */
5162 cp_error ("namespace `%T' undeclared", namespace);
5165 if (TREE_CODE (namespace) != NAMESPACE_DECL)
5167 cp_error ("`%T' is not a namespace", namespace);
5170 namespace = ORIGINAL_NAMESPACE (namespace);
5171 if (!toplevel_bindings_p ())
5172 push_using_directive (namespace);
5175 add_using_namespace (current_namespace, namespace, 0);
5179 check_default_args (x)
5182 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
5183 int saw_def = 0, i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
5184 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
5186 if (TREE_PURPOSE (arg))
5190 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5201 TREE_USED (decl) = 1;
5202 if (processing_template_decl)
5204 assemble_external (decl);
5206 /* Is it a synthesized method that needs to be synthesized? */
5207 if (TREE_CODE (decl) == FUNCTION_DECL
5208 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
5209 && DECL_ARTIFICIAL (decl)
5210 && ! DECL_INITIAL (decl)
5211 /* Kludge: don't synthesize for default args. */
5212 && current_function_decl)
5213 synthesize_method (decl);
5215 /* If this is a function or variable that is an instance of some
5216 template, we now know that we will need to actually do the
5217 instantiation. We check that DECL is not an explicit
5218 instantiation because that is not checked in instantiate_decl. */
5219 if ((TREE_CODE (decl) == FUNCTION_DECL || TREE_CODE (decl) == VAR_DECL)
5220 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
5221 && (!DECL_EXPLICIT_INSTANTIATION (decl)
5222 || (TREE_CODE (decl) == FUNCTION_DECL && DECL_INLINE (decl))))
5223 instantiate_decl (decl);
5226 /* Helper function for named_class_head_sans_basetype nonterminal. We
5227 have just seen something of the form `AGGR SCOPE::ID'. Return a
5228 TYPE_DECL for the type declared by ID in SCOPE. */
5231 handle_class_head (aggr, scope, id)
5232 tree aggr, scope, id;
5236 if (TREE_CODE (id) == TYPE_DECL)
5238 else if (DECL_CLASS_TEMPLATE_P (id))
5239 decl = DECL_TEMPLATE_RESULT (id);
5242 tree current = current_scope();
5244 if (current == NULL_TREE)
5245 current = current_namespace;
5246 if (scope == std_node)
5247 scope = global_namespace;
5248 if (scope == NULL_TREE)
5249 scope = global_namespace;
5250 if (scope == current)
5252 /* We've been given AGGR SCOPE::ID, when we're already inside SCOPE.
5253 Be nice about it. */
5255 cp_pedwarn ("extra qualification `%T::' on member `%D' ignored",
5256 FROB_CONTEXT (scope), id);
5258 else if (scope != global_namespace)
5259 cp_error ("`%T' does not have a nested type named `%D'", scope, id);
5261 cp_error ("no file-scope type named `%D'", id);
5263 /* Inject it at the current scope. */
5264 decl = TYPE_MAIN_DECL (xref_tag (aggr, id, 1));
5267 /* Enter the SCOPE. If this turns out not to be a definition, the
5268 parser must leave the scope. */
5269 push_scope (CP_DECL_CONTEXT (decl));
5271 /* If we see something like:
5273 template <typename T> struct S::I ....
5275 we must create a TEMPLATE_DECL for the nested type. */
5276 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5277 decl = push_template_decl (decl);
5282 /* Initialize decl2.c. */
5287 ggc_add_tree_root (&decl_namespace_list, 1);
5288 ggc_add_tree_varray_root (&saved_inlines, 1);
5289 ggc_add_tree_varray_root (&pending_statics, 1);
5290 ggc_add_tree_varray_root (&ssdf_decls, 1);
5291 ggc_add_tree_root (&ssdf_decl, 1);
5292 ggc_add_tree_root (&priority_decl, 1);
5293 ggc_add_tree_root (&initialize_p_decl, 1);
5294 ggc_add_tree_root (&pending_vtables, 1);