1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
44 #include "dwarf2out.h"
50 extern cpp_reader parse_in;
53 /* This structure contains information about the initializations
54 and/or destructions required for a particular priority level. */
55 typedef struct priority_info_s {
56 /* Non-zero if there have been any initializations at this priority
57 throughout the translation unit. */
58 int initializations_p;
59 /* Non-zero if there have been any destructions at this priority
60 throughout the translation unit. */
64 static tree get_sentry PARAMS ((tree));
65 static void mark_vtable_entries PARAMS ((tree));
66 static void grok_function_init PARAMS ((tree, tree));
67 static int finish_vtable_vardecl PARAMS ((tree *, void *));
68 static int prune_vtable_vardecl PARAMS ((tree *, void *));
69 static int is_namespace_ancestor PARAMS ((tree, tree));
70 static void add_using_namespace PARAMS ((tree, tree, int));
71 static tree ambiguous_decl PARAMS ((tree, tree, tree,int));
72 static tree build_anon_union_vars PARAMS ((tree, tree*, int, int));
73 static int acceptable_java_type PARAMS ((tree));
74 static void output_vtable_inherit PARAMS ((tree));
75 static tree start_objects PARAMS ((int, int));
76 static void finish_objects PARAMS ((int, int, tree));
77 static tree merge_functions PARAMS ((tree, tree));
78 static tree decl_namespace PARAMS ((tree));
79 static tree validate_nonmember_using_decl PARAMS ((tree, tree *, tree *));
80 static void do_nonmember_using_decl PARAMS ((tree, tree, tree, tree,
82 static tree start_static_storage_duration_function PARAMS ((void));
83 static void finish_static_storage_duration_function PARAMS ((tree));
84 static priority_info get_priority_info PARAMS ((int));
85 static void do_static_initialization PARAMS ((tree, tree));
86 static void do_static_destruction PARAMS ((tree));
87 static tree start_static_initialization_or_destruction PARAMS ((tree, int));
88 static void finish_static_initialization_or_destruction PARAMS ((tree));
89 static void generate_ctor_or_dtor_function PARAMS ((int, int));
90 static int generate_ctor_and_dtor_functions_for_priority
91 PARAMS ((splay_tree_node, void *));
92 static tree prune_vars_needing_no_initialization PARAMS ((tree));
93 static void write_out_vars PARAMS ((tree));
94 static void import_export_class PARAMS ((tree));
95 static tree key_method PARAMS ((tree));
97 extern int current_class_depth;
99 /* A list of virtual function tables we must make sure to write out. */
100 tree pending_vtables;
102 /* A list of static class variables. This is needed, because a
103 static class variable can be declared inside the class without
104 an initializer, and then initialized, staticly, outside the class. */
105 static varray_type pending_statics;
106 #define pending_statics_used \
107 (pending_statics ? pending_statics->elements_used : 0)
109 /* A list of functions which were declared inline, but which we
110 may need to emit outline anyway. */
111 static varray_type saved_inlines;
112 #define saved_inlines_used \
113 (saved_inlines ? saved_inlines->elements_used : 0)
115 /* Same, but not reset. Local temp variables and global temp variables
116 can have the same name. */
117 static int global_temp_name_counter;
119 /* Flag used when debugging spew.c */
121 extern int spew_debug;
123 /* Nonzero if we're done parsing and into end-of-file activities. */
127 /* Functions called along with real static constructors and destructors. */
129 tree static_ctors, static_dtors;
131 /* The :: namespace. */
133 tree global_namespace;
135 /* The stack for namespaces of current declarations. */
137 static tree decl_namespace_list;
140 /* C (and C++) language-specific option variables. */
142 /* Nonzero means allow type mismatches in conditional expressions;
143 just make their values `void'. */
145 int flag_cond_mismatch;
147 /* Nonzero means give `double' the same size as `float'. */
149 int flag_short_double;
151 /* Nonzero means don't recognize the keyword `asm'. */
155 /* Nonzero means don't recognize any extension keywords. */
157 int flag_no_gnu_keywords;
159 /* Nonzero means don't recognize the non-ANSI builtin functions. */
163 /* Nonzero means don't recognize the non-ANSI builtin functions.
166 int flag_no_nonansi_builtin;
168 /* Nonzero means do some things the same way PCC does. Only provided so
169 the compiler will link. */
171 int flag_traditional;
173 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
175 int flag_signed_bitfields = 1;
177 /* Nonzero means enable obscure standard features and disable GNU
178 extensions that might cause standard-compliant code to be
183 /* Nonzero means do emit exported implementations of functions even if
184 they can be inlined. */
186 int flag_implement_inlines = 1;
188 /* Nonzero means do emit exported implementations of templates, instead of
189 multiple static copies in each file that needs a definition. */
191 int flag_external_templates;
193 /* Nonzero means that the decision to emit or not emit the implementation of a
194 template depends on where the template is instantiated, rather than where
197 int flag_alt_external_templates;
199 /* Nonzero means that implicit instantiations will be emitted if needed. */
201 int flag_implicit_templates = 1;
203 /* Nonzero means that implicit instantiations of inline templates will be
204 emitted if needed, even if instantiations of non-inline templates
207 int flag_implicit_inline_templates = 1;
209 /* Nonzero means warn about implicit declarations. */
211 int warn_implicit = 1;
213 /* Nonzero means warn about usage of long long when `-pedantic'. */
215 int warn_long_long = 1;
217 /* Nonzero means warn when all ctors or dtors are private, and the class
220 int warn_ctor_dtor_privacy = 1;
222 /* True if we want to implement vtables using "thunks".
223 The default is off. */
225 #ifndef DEFAULT_VTABLE_THUNKS
226 #define DEFAULT_VTABLE_THUNKS 0
228 int flag_vtable_thunks = DEFAULT_VTABLE_THUNKS;
230 /* Nonzero means generate separate instantiation control files and juggle
231 them at link time. */
233 int flag_use_repository;
235 /* Nonzero if we want to issue diagnostics that the standard says are not
238 int flag_optional_diags = 1;
240 /* Nonzero means give string constants the type `const char *', as mandated
243 int flag_const_strings = 1;
245 /* If non-NULL, dump the tree structure for the entire translation
246 unit to this file. */
248 char *flag_dump_translation_unit = 0;
250 /* Nonzero means warn about deprecated conversion from string constant to
253 int warn_write_strings;
255 /* Nonzero means warn about pointer casts that can drop a type qualifier
256 from the pointer target type. */
260 /* Nonzero means warn about sizeof(function) or addition/subtraction
261 of function pointers. */
263 int warn_pointer_arith = 1;
265 /* Nonzero means warn for any function def without prototype decl. */
267 int warn_missing_prototypes;
269 /* Nonzero means warn about multiple (redundant) decls for the same single
270 variable or function. */
272 int warn_redundant_decls;
274 /* Warn if initializer is not completely bracketed. */
276 int warn_missing_braces;
278 /* Warn about comparison of signed and unsigned values. */
280 int warn_sign_compare;
282 /* Warn about testing equality of floating point numbers. */
284 int warn_float_equal = 0;
286 /* Warn about *printf or *scanf format/argument anomalies. */
290 /* Warn about a subscript that has type char. */
292 int warn_char_subscripts;
294 /* Warn if a type conversion is done that might have confusing results. */
298 /* Warn if adding () is suggested. */
300 int warn_parentheses;
302 /* Non-zero means warn in function declared in derived class has the
303 same name as a virtual in the base class, but fails to match the
304 type signature of any virtual function in the base class. */
305 int warn_overloaded_virtual;
307 /* Non-zero means warn when declaring a class that has a non virtual
308 destructor, when it really ought to have a virtual one. */
311 /* Non-zero means warn when a function is declared extern and later inline. */
312 int warn_extern_inline;
314 /* Non-zero means warn when the compiler will reorder code. */
317 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
320 /* Non-zero means warn when we convert a pointer to member function
321 into a pointer to (void or function). */
322 int warn_pmf2ptr = 1;
324 /* Nonzero means warn about violation of some Effective C++ style rules. */
328 /* Nonzero means warn where overload resolution chooses a promotion from
329 unsigned to signed over a conversion to an unsigned of the same size. */
333 /* Nonzero means warn when an old-style cast is used. */
335 int warn_old_style_cast;
337 /* Warn about #pragma directives that are not recognised. */
339 int warn_unknown_pragmas; /* Tri state variable. */
341 /* Nonzero means warn about use of multicharacter literals. */
343 int warn_multichar = 1;
345 /* Nonzero means warn when non-templatized friend functions are
346 declared within a template */
348 int warn_nontemplate_friend = 1;
350 /* Nonzero means complain about deprecated features. */
352 int warn_deprecated = 1;
354 /* Nonzero means `$' can be in an identifier. */
356 #ifndef DOLLARS_IN_IDENTIFIERS
357 #define DOLLARS_IN_IDENTIFIERS 1
359 int dollars_in_ident = DOLLARS_IN_IDENTIFIERS;
361 /* Nonzero for -fno-strict-prototype switch: do not consider empty
362 argument prototype to mean function takes no arguments. */
364 int flag_strict_prototype = 2;
365 int strict_prototype = 1;
366 int strict_prototypes_lang_c, strict_prototypes_lang_cplusplus = 1;
368 /* Nonzero means that labels can be used as first-class objects */
372 /* Nonzero means allow Microsoft extensions without a pedwarn. */
374 int flag_ms_extensions;
376 /* Non-zero means to collect statistics which might be expensive
377 and to print them when we are done. */
378 int flag_detailed_statistics;
380 /* C++ specific flags. */
381 /* Zero means that `this' is a *const. This gives nice behavior in the
382 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
383 -2 means we're constructing an object and it has fixed type. */
385 int flag_this_is_variable;
387 /* Nonzero means we should attempt to elide constructors when possible. */
389 int flag_elide_constructors = 1;
391 /* Nonzero means that member functions defined in class scope are
392 inline by default. */
394 int flag_default_inline = 1;
396 /* Controls whether compiler generates 'type descriptor' that give
397 run-time type information. */
400 /* Nonzero if we wish to output cross-referencing information
401 for the GNU class browser. */
402 extern int flag_gnu_xref;
404 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
407 int flag_huge_objects;
409 /* Nonzero if we want to conserve space in the .o files. We do this
410 by putting uninitialized data and runtime initialized data into
411 .common instead of .data at the expense of not flagging multiple
414 int flag_conserve_space;
416 /* Nonzero if we want to obey access control semantics. */
418 int flag_access_control = 1;
420 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
422 int flag_operator_names;
424 /* Nonzero if we want to check the return value of new and avoid calling
425 constructors if it is a null pointer. */
429 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
430 initialization variables.
431 0: Old rules, set by -fno-for-scope.
432 2: New ISO rules, set by -ffor-scope.
433 1: Try to implement new ISO rules, but with backup compatibility
434 (and warnings). This is the default, for now. */
436 int flag_new_for_scope = 1;
438 /* Nonzero if we want to emit defined symbols with common-like linkage as
439 weak symbols where possible, in order to conform to C++ semantics.
440 Otherwise, emit them as local symbols. */
444 /* Nonzero to enable experimental ABI changes. */
448 /* Nonzero to use __cxa_atexit, rather than atexit, to register
449 destructors for local statics and global objects. */
451 int flag_use_cxa_atexit;
453 /* Nonzero to not ignore namespace std. */
457 /* Nonzero if we should expand functions calls inline at the tree
458 level, rather than at the RTL level. */
460 int flag_inline_trees = 0;
462 /* Maximum template instantiation depth. Must be at least 17 for ISO
465 int max_tinst_depth = 17;
467 /* The name-mangling scheme to use. Must be 1 or greater to support
468 template functions with identical types, but different template
470 int name_mangling_version = 2;
472 /* Nonzero means that guiding declarations are allowed. */
473 int flag_guiding_decls;
475 /* Nonzero if wchar_t should be `unsigned short' instead of whatever it
476 would normally be, for use with WINE. */
477 int flag_short_wchar;
479 /* Nonzero if squashed mangling is to be performed.
480 This uses the B and K codes to reference previously seen class types
481 and class qualifiers. */
482 int flag_do_squangling;
484 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
488 /* Nonzero means make the default pedwarns warnings instead of errors.
489 The value of this flag is ignored if -pedantic is specified. */
493 /* If this variable is defined to a non-NULL value, it will be called
494 after the file has been completely parsed. */
496 void (*back_end_hook) PARAMS ((tree));
498 /* Table of language-dependent -f options.
499 STRING is the option name. VARIABLE is the address of the variable.
500 ON_VALUE is the value to store in VARIABLE
501 if `-fSTRING' is seen as an option.
502 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
504 static struct { const char *string; int *variable; int on_value;}
508 {"signed-char", &flag_signed_char, 1},
509 {"unsigned-char", &flag_signed_char, 0},
510 {"signed-bitfields", &flag_signed_bitfields, 1},
511 {"unsigned-bitfields", &flag_signed_bitfields, 0},
512 {"short-enums", &flag_short_enums, 1},
513 {"short-double", &flag_short_double, 1},
514 {"short-wchar", &flag_short_wchar, 1},
515 {"cond-mismatch", &flag_cond_mismatch, 1},
516 {"asm", &flag_no_asm, 0},
517 {"builtin", &flag_no_builtin, 0},
519 /* C++-only options. */
520 {"access-control", &flag_access_control, 1},
521 {"check-new", &flag_check_new, 1},
522 {"conserve-space", &flag_conserve_space, 1},
523 {"const-strings", &flag_const_strings, 1},
524 {"default-inline", &flag_default_inline, 1},
525 {"dollars-in-identifiers", &dollars_in_ident, 1},
526 {"elide-constructors", &flag_elide_constructors, 1},
527 {"external-templates", &flag_external_templates, 1},
528 {"for-scope", &flag_new_for_scope, 2},
529 {"gnu-keywords", &flag_no_gnu_keywords, 0},
530 {"handle-exceptions", &flag_exceptions, 1},
531 {"honor-std", &flag_honor_std, 1},
532 {"huge-objects", &flag_huge_objects, 1},
533 {"implement-inlines", &flag_implement_inlines, 1},
534 {"implicit-inline-templates", &flag_implicit_inline_templates, 1},
535 {"implicit-templates", &flag_implicit_templates, 1},
536 {"labels-ok", &flag_labels_ok, 1},
537 {"ms-extensions", &flag_ms_extensions, 1},
538 {"nonansi-builtins", &flag_no_nonansi_builtin, 0},
539 {"operator-names", &flag_operator_names, 1},
540 {"optional-diags", &flag_optional_diags, 1},
541 {"permissive", &flag_permissive, 1},
542 {"repo", &flag_use_repository, 1},
543 {"rtti", &flag_rtti, 1},
544 {"squangle", &flag_do_squangling, 1},
545 {"stats", &flag_detailed_statistics, 1},
546 {"strict-prototype", &flag_strict_prototype, 1},
547 {"use-cxa-atexit", &flag_use_cxa_atexit, 1},
548 {"vtable-gc", &flag_vtable_gc, 1},
549 {"vtable-thunks", &flag_vtable_thunks, 1},
550 {"weak", &flag_weak, 1},
551 {"xref", &flag_gnu_xref, 1}
554 /* Decode the string P as a language-specific option.
555 Return the number of strings consumed for a valid option.
556 Otherwise return 0. Should not complain if it does not
557 recognise the option. */
560 lang_decode_option (argc, argv)
569 int strings_processed;
572 strings_processed = cpp_handle_option (&parse_in, argc, argv);
574 strings_processed = 0;
575 #endif /* ! USE_CPPLIB */
577 if (!strcmp (p, "-ftraditional") || !strcmp (p, "-traditional"))
579 else if (p[0] == '-' && p[1] == 'f')
581 /* Some kind of -f option.
582 P's value is the option sans `-f'.
583 Search for it in the table of options. */
587 /* Try special -f options. */
589 if (!strcmp (p, "handle-exceptions")
590 || !strcmp (p, "no-handle-exceptions"))
591 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
592 else if (!strcmp (p, "all-virtual")
593 || !strcmp (p, "enum-int-equiv")
594 || !strcmp (p, "no-nonnull-objects")
595 || !strcmp (p, "this-is-variable"))
596 warning ("-f%s is no longer supported", p);
597 else if (! strcmp (p, "alt-external-templates"))
599 flag_external_templates = 1;
600 flag_alt_external_templates = 1;
601 cp_deprecated ("-falt-external-templates");
603 else if (! strcmp (p, "no-alt-external-templates"))
604 flag_alt_external_templates = 0;
605 else if (!strcmp (p, "repo"))
607 flag_use_repository = 1;
608 flag_implicit_templates = 0;
610 else if (!strcmp (p, "guiding-decls"))
612 flag_guiding_decls = 1;
613 name_mangling_version = 0;
615 else if (!strcmp (p, "no-guiding-decls"))
616 flag_guiding_decls = 0;
617 else if (!strcmp (p, "external-templates"))
619 flag_external_templates = 1;
620 cp_deprecated ("-fexternal-templates");
622 else if (!strcmp (p, "new-abi"))
625 flag_do_squangling = 1;
626 flag_vtable_thunks = 1;
628 else if (!strcmp (p, "no-new-abi"))
631 flag_do_squangling = 0;
633 else if (!strncmp (p, "template-depth-", 15))
635 = read_integral_parameter (p + 15, p - 2, max_tinst_depth);
636 else if (!strncmp (p, "name-mangling-version-", 22))
637 name_mangling_version
638 = read_integral_parameter (p + 22, p - 2, name_mangling_version);
639 else if (!strncmp (p, "message-length=", 15))
641 (read_integral_parameter (p + 15, p - 2,
642 /* default line-wrap length */ 72));
643 else if (!strncmp (p, "dump-translation-unit-", 22))
646 error ("no file specified with -fdump-translation-unit");
648 flag_dump_translation_unit = p + 22;
655 !found && j < (sizeof (lang_f_options)
656 / sizeof (lang_f_options[0]));
659 if (!strcmp (p, lang_f_options[j].string))
661 *lang_f_options[j].variable = lang_f_options[j].on_value;
662 /* A goto here would be cleaner,
663 but breaks the vax pcc. */
666 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-'
667 && ! strcmp (p+3, lang_f_options[j].string))
669 *lang_f_options[j].variable = ! lang_f_options[j].on_value;
677 else if (p[0] == '-' && p[1] == 'W')
681 /* The -W options control the warning behavior of the compiler. */
684 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-')
687 if (!strcmp (p, "implicit"))
688 warn_implicit = setting;
689 else if (!strcmp (p, "long-long"))
690 warn_long_long = setting;
691 else if (!strcmp (p, "return-type"))
692 warn_return_type = setting;
693 else if (!strcmp (p, "ctor-dtor-privacy"))
694 warn_ctor_dtor_privacy = setting;
695 else if (!strcmp (p, "write-strings"))
696 warn_write_strings = setting;
697 else if (!strcmp (p, "cast-qual"))
698 warn_cast_qual = setting;
699 else if (!strcmp (p, "char-subscripts"))
700 warn_char_subscripts = setting;
701 else if (!strcmp (p, "pointer-arith"))
702 warn_pointer_arith = setting;
703 else if (!strcmp (p, "missing-prototypes"))
704 warn_missing_prototypes = setting;
705 else if (!strcmp (p, "redundant-decls"))
706 warn_redundant_decls = setting;
707 else if (!strcmp (p, "missing-braces"))
708 warn_missing_braces = setting;
709 else if (!strcmp (p, "sign-compare"))
710 warn_sign_compare = setting;
711 else if (!strcmp (p, "float-equal"))
712 warn_float_equal = setting;
713 else if (!strcmp (p, "format"))
714 warn_format = setting;
715 else if (!strcmp (p, "conversion"))
716 warn_conversion = setting;
717 else if (!strcmp (p, "parentheses"))
718 warn_parentheses = setting;
719 else if (!strcmp (p, "non-virtual-dtor"))
720 warn_nonvdtor = setting;
721 else if (!strcmp (p, "extern-inline"))
722 warn_extern_inline = setting;
723 else if (!strcmp (p, "reorder"))
724 warn_reorder = setting;
725 else if (!strcmp (p, "synth"))
726 warn_synth = setting;
727 else if (!strcmp (p, "pmf-conversions"))
728 warn_pmf2ptr = setting;
729 else if (!strcmp (p, "effc++"))
731 else if (!strcmp (p, "sign-promo"))
732 warn_sign_promo = setting;
733 else if (!strcmp (p, "old-style-cast"))
734 warn_old_style_cast = setting;
735 else if (!strcmp (p, "overloaded-virtual"))
736 warn_overloaded_virtual = setting;
737 else if (!strcmp (p, "multichar"))
738 warn_multichar = setting;
739 else if (!strcmp (p, "unknown-pragmas"))
740 /* Set to greater than 1, so that even unknown pragmas in
741 system headers will be warned about. */
742 warn_unknown_pragmas = setting * 2;
743 else if (!strcmp (p, "non-template-friend"))
744 warn_nontemplate_friend = setting;
745 else if (!strcmp (p, "deprecated"))
746 warn_deprecated = setting;
747 else if (!strcmp (p, "comment"))
748 ; /* cpp handles this one. */
749 else if (!strcmp (p, "comments"))
750 ; /* cpp handles this one. */
751 else if (!strcmp (p, "trigraphs"))
752 ; /* cpp handles this one. */
753 else if (!strcmp (p, "import"))
754 ; /* cpp handles this one. */
755 else if (!strcmp (p, "all"))
757 warn_return_type = setting;
758 warn_unused = setting;
759 warn_implicit = setting;
760 warn_switch = setting;
761 warn_format = setting;
762 warn_parentheses = setting;
763 warn_missing_braces = setting;
764 warn_sign_compare = setting;
765 warn_multichar = setting;
766 /* We save the value of warn_uninitialized, since if they put
767 -Wuninitialized on the command line, we need to generate a
768 warning about not using it without also specifying -O. */
769 if (warn_uninitialized != 1)
770 warn_uninitialized = (setting ? 2 : 0);
771 /* Only warn about unknown pragmas that are not in system
773 warn_unknown_pragmas = 1;
775 /* C++-specific warnings. */
776 warn_ctor_dtor_privacy = setting;
777 warn_nonvdtor = setting;
778 warn_reorder = setting;
779 warn_nontemplate_friend = setting;
781 else return strings_processed;
783 else if (!strcmp (p, "-ansi"))
784 flag_no_nonansi_builtin = 1, flag_ansi = 1,
785 flag_no_gnu_keywords = 1, flag_operator_names = 1;
787 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
788 it's probably safe to assume no sane person would ever want to use this
789 under normal circumstances. */
790 else if (!strcmp (p, "-spew-debug"))
794 return strings_processed;
799 /* Incorporate `const' and `volatile' qualifiers for member functions.
800 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
801 QUALS is a list of qualifiers. Returns any explicit
802 top-level qualifiers of the method's this pointer, anything other than
803 TYPE_UNQUALIFIED will be an extension. */
806 grok_method_quals (ctype, function, quals)
807 tree ctype, function, quals;
809 tree fntype = TREE_TYPE (function);
810 tree raises = TYPE_RAISES_EXCEPTIONS (fntype);
811 int type_quals = TYPE_UNQUALIFIED;
812 int dup_quals = TYPE_UNQUALIFIED;
813 int this_quals = TYPE_UNQUALIFIED;
817 int tq = cp_type_qual_from_rid (TREE_VALUE (quals));
819 if ((type_quals | this_quals) & tq)
821 else if (tq & TYPE_QUAL_RESTRICT)
825 quals = TREE_CHAIN (quals);
829 if (dup_quals != TYPE_UNQUALIFIED)
830 cp_error ("duplicate type qualifiers in %s declaration",
831 TREE_CODE (function) == FUNCTION_DECL
832 ? "member function" : "type");
834 ctype = cp_build_qualified_type (ctype, type_quals);
835 fntype = build_cplus_method_type (ctype, TREE_TYPE (fntype),
836 (TREE_CODE (fntype) == METHOD_TYPE
837 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
838 : TYPE_ARG_TYPES (fntype)));
840 fntype = build_exception_variant (fntype, raises);
842 TREE_TYPE (function) = fntype;
846 /* Warn when -fexternal-templates is used and #pragma
847 interface/implementation is not used all the times it should be,
851 warn_if_unknown_interface (decl)
854 static int already_warned = 0;
855 if (already_warned++)
858 if (flag_alt_external_templates)
860 struct tinst_level *til = tinst_for_decl ();
862 char *sf = input_filename;
867 input_filename = til->file;
869 cp_warning ("template `%#D' instantiated in file without #pragma interface",
875 cp_warning_at ("template `%#D' defined in file without #pragma interface",
879 /* A subroutine of the parser, to handle a component list. */
882 grok_x_components (specs)
885 struct pending_inline **p;
888 specs = strip_attrs (specs);
890 check_tag_decl (specs);
891 t = groktypename (build_decl_list (specs, NULL_TREE));
893 /* The only case where we need to do anything additional here is an
894 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
895 if (t == NULL_TREE || !ANON_AGGR_TYPE_P (t))
898 fixup_anonymous_aggr (t);
899 finish_member_declaration (build_lang_decl (FIELD_DECL, NULL_TREE, t));
901 /* Ignore any inline function definitions in the anonymous union
902 since an anonymous union may not have function members. */
903 p = &pending_inlines;
904 for (; *p; *p = (*p)->next)
905 if (DECL_CONTEXT ((*p)->fndecl) != t)
909 /* Constructors for types with virtual baseclasses need an "in-charge" flag
910 saying whether this constructor is responsible for initialization of
911 virtual baseclasses or not. All destructors also need this "in-charge"
912 flag, which additionally determines whether or not the destructor should
913 free the memory for the object.
915 This function adds the "in-charge" flag to member function FN if
916 appropriate. It is called from grokclassfn and tsubst.
917 FN must be either a constructor or destructor. */
920 maybe_retrofit_in_chrg (fn)
923 tree basetype, arg_types, parms, parm, fntype;
925 if (DECL_CONSTRUCTOR_P (fn)
926 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn))
927 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn))
929 else if (! DECL_CONSTRUCTOR_P (fn)
930 && TREE_CHAIN (DECL_ARGUMENTS (fn)) == NULL_TREE)
935 if (DECL_CONSTRUCTOR_P (fn))
936 DECL_CONSTRUCTOR_FOR_VBASE_P (fn) = 1;
938 /* First add it to DECL_ARGUMENTS... */
939 parm = build_decl (PARM_DECL, in_charge_identifier, integer_type_node);
940 /* Mark the artificial `__in_chrg' parameter as "artificial". */
941 SET_DECL_ARTIFICIAL (parm);
942 DECL_ARG_TYPE (parm) = integer_type_node;
943 TREE_READONLY (parm) = 1;
944 parms = DECL_ARGUMENTS (fn);
945 TREE_CHAIN (parm) = TREE_CHAIN (parms);
946 TREE_CHAIN (parms) = parm;
948 /* ...and then to TYPE_ARG_TYPES. */
949 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
950 basetype = TREE_TYPE (TREE_VALUE (arg_types));
951 arg_types = hash_tree_chain (integer_type_node, TREE_CHAIN (arg_types));
952 fntype = build_cplus_method_type (basetype, TREE_TYPE (TREE_TYPE (fn)),
954 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
955 fntype = build_exception_variant (fntype,
956 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
957 TREE_TYPE (fn) = fntype;
960 /* Classes overload their constituent function names automatically.
961 When a function name is declared in a record structure,
962 its name is changed to it overloaded name. Since names for
963 constructors and destructors can conflict, we place a leading
966 CNAME is the name of the class we are grokking for.
968 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
970 FLAGS contains bits saying what's special about today's
971 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
973 If FUNCTION is a destructor, then we must add the `auto-delete' field
974 as a second parameter. There is some hair associated with the fact
975 that we must "declare" this variable in the manner consistent with the
976 way the rest of the arguments were declared.
978 QUALS are the qualifiers for the this pointer. */
981 grokclassfn (ctype, function, flags, quals)
982 tree ctype, function;
983 enum overload_flags flags;
986 tree fn_name = DECL_NAME (function);
987 int this_quals = TYPE_UNQUALIFIED;
989 if (fn_name == NULL_TREE)
991 error ("name missing for member function");
992 fn_name = get_identifier ("<anonymous>");
993 DECL_NAME (function) = fn_name;
997 this_quals = grok_method_quals (ctype, function, quals);
999 if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1001 /* Must add the class instance variable up front. */
1002 /* Right now we just make this a pointer. But later
1003 we may wish to make it special. */
1004 tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function)));
1006 tree parm = build_decl (PARM_DECL, this_identifier,
1007 cp_build_qualified_type (type, this_quals | TYPE_QUAL_CONST));
1008 /* Mark the artificial `this' parameter as "artificial". */
1009 SET_DECL_ARTIFICIAL (parm);
1010 DECL_ARG_TYPE (parm) = type;
1011 /* We can make this a register, so long as we don't
1012 accidentally complain if someone tries to take its address. */
1013 DECL_REGISTER (parm) = 1;
1014 TREE_CHAIN (parm) = last_function_parms;
1015 last_function_parms = parm;
1018 DECL_ARGUMENTS (function) = last_function_parms;
1019 DECL_CONTEXT (function) = ctype;
1021 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
1022 maybe_retrofit_in_chrg (function);
1024 if (flags == DTOR_FLAG)
1026 DECL_ASSEMBLER_NAME (function) = build_destructor_name (ctype);
1027 TYPE_HAS_DESTRUCTOR (ctype) = 1;
1030 set_mangled_name_for_decl (function);
1033 /* Work on the expr used by alignof (this is only called by the parser). */
1042 if (processing_template_decl)
1043 return build_min (ALIGNOF_EXPR, sizetype, expr);
1045 if (TREE_CODE (expr) == COMPONENT_REF
1046 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
1047 error ("`__alignof__' applied to a bit-field");
1049 if (TREE_CODE (expr) == INDIRECT_REF)
1051 best = t = TREE_OPERAND (expr, 0);
1052 bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1054 while (TREE_CODE (t) == NOP_EXPR
1055 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
1058 t = TREE_OPERAND (t, 0);
1059 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1060 if (thisalign > bestalign)
1061 best = t, bestalign = thisalign;
1063 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
1066 return c_alignof (TREE_TYPE (expr));
1069 /* Create an ARRAY_REF, checking for the user doing things backwards
1073 grok_array_decl (array_expr, index_exp)
1074 tree array_expr, index_exp;
1076 tree type = TREE_TYPE (array_expr);
1077 tree p1, p2, i1, i2;
1079 if (type == error_mark_node || index_exp == error_mark_node)
1080 return error_mark_node;
1081 if (processing_template_decl)
1082 return build_min (ARRAY_REF, type ? TREE_TYPE (type) : NULL_TREE,
1083 array_expr, index_exp);
1085 if (type == NULL_TREE)
1087 /* Something has gone very wrong. Assume we are mistakenly reducing
1088 an expression instead of a declaration. */
1089 error ("parser may be lost: is there a '{' missing somewhere?");
1093 if (TREE_CODE (type) == OFFSET_TYPE
1094 || TREE_CODE (type) == REFERENCE_TYPE)
1095 type = TREE_TYPE (type);
1097 /* If they have an `operator[]', use that. */
1098 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
1099 return build_opfncall (ARRAY_REF, LOOKUP_NORMAL,
1100 array_expr, index_exp, NULL_TREE);
1102 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1103 is a little-known fact that, if `a' is an array and `i' is an
1104 int, you can write `i[a]', which means the same thing as `a[i]'. */
1106 if (TREE_CODE (type) == ARRAY_TYPE)
1109 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, 0);
1111 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
1114 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, 0);
1116 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr, 0);
1117 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp, 0);
1119 if ((p1 && i2) && (i1 && p2))
1120 error ("ambiguous conversion for array subscript");
1123 array_expr = p1, index_exp = i2;
1125 array_expr = p2, index_exp = i1;
1128 cp_error ("invalid types `%T[%T]' for array subscript",
1129 type, TREE_TYPE (index_exp));
1130 return error_mark_node;
1133 if (array_expr == error_mark_node || index_exp == error_mark_node)
1134 error ("ambiguous conversion for array subscript");
1136 return build_array_ref (array_expr, index_exp);
1139 /* Given the cast expression EXP, checking out its validity. Either return
1140 an error_mark_node if there was an unavoidable error, return a cast to
1141 void for trying to delete a pointer w/ the value 0, or return the
1142 call to delete. If DOING_VEC is 1, we handle things differently
1143 for doing an array delete. If DOING_VEC is 2, they gave us the
1144 array size as an argument to delete.
1145 Implements ARM $5.3.4. This is called from the parser. */
1148 delete_sanity (exp, size, doing_vec, use_global_delete)
1150 int doing_vec, use_global_delete;
1153 /* For a regular vector delete (aka, no size argument) we will pass
1154 this down as a NULL_TREE into build_vec_delete. */
1155 tree maxindex = NULL_TREE;
1157 if (exp == error_mark_node)
1160 if (processing_template_decl)
1162 t = build_min (DELETE_EXPR, void_type_node, exp, size);
1163 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
1164 DELETE_EXPR_USE_VEC (t) = doing_vec;
1168 if (TREE_CODE (exp) == OFFSET_REF)
1169 exp = resolve_offset_ref (exp);
1170 exp = convert_from_reference (exp);
1171 t = stabilize_reference (exp);
1172 t = build_expr_type_conversion (WANT_POINTER, t, 1);
1174 if (t == NULL_TREE || t == error_mark_node)
1176 cp_error ("type `%#T' argument given to `delete', expected pointer",
1178 return error_mark_node;
1183 maxindex = build_binary_op (MINUS_EXPR, size, integer_one_node);
1184 pedwarn ("anachronistic use of array size in vector delete");
1187 type = TREE_TYPE (t);
1189 /* As of Valley Forge, you can delete a pointer to const. */
1191 /* You can't delete functions. */
1192 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
1194 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
1195 return error_mark_node;
1198 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1199 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
1200 cp_warning ("`%T' is not a pointer-to-object type", type);
1202 /* An array can't have been allocated by new, so complain. */
1203 if (TREE_CODE (t) == ADDR_EXPR
1204 && TREE_CODE (TREE_OPERAND (t, 0)) == VAR_DECL
1205 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == ARRAY_TYPE)
1206 cp_warning ("deleting array `%#D'", TREE_OPERAND (t, 0));
1208 /* Deleting a pointer with the value zero is valid and has no effect. */
1209 if (integer_zerop (t))
1210 return build1 (NOP_EXPR, void_type_node, t);
1213 return build_vec_delete (t, maxindex, integer_one_node, use_global_delete);
1216 if (IS_AGGR_TYPE (TREE_TYPE (type))
1217 && TYPE_GETS_REG_DELETE (TREE_TYPE (type)))
1219 /* Only do access checking here; we'll be calling op delete
1220 from the destructor. */
1221 tree tmp = build_op_delete_call (DELETE_EXPR, t, size_zero_node,
1222 LOOKUP_NORMAL, NULL_TREE);
1223 if (tmp == error_mark_node)
1224 return error_mark_node;
1227 return build_delete (type, t, integer_three_node,
1228 LOOKUP_NORMAL, use_global_delete);
1232 /* Report an error if the indicated template declaration is not the
1233 sort of thing that should be a member template. */
1236 check_member_template (tmpl)
1241 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
1242 decl = DECL_TEMPLATE_RESULT (tmpl);
1244 if (TREE_CODE (decl) == FUNCTION_DECL
1245 || (TREE_CODE (decl) == TYPE_DECL
1246 && IS_AGGR_TYPE (TREE_TYPE (decl))))
1248 if (current_function_decl)
1249 /* 14.5.2.2 [temp.mem]
1251 A local class shall not have member templates. */
1252 cp_error ("invalid declaration of member template `%#D' in local class",
1255 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
1257 /* 14.5.2.3 [temp.mem]
1259 A member function template shall not be virtual. */
1261 ("invalid use of `virtual' in template declaration of `%#D'",
1263 DECL_VIRTUAL_P (decl) = 0;
1266 /* The debug-information generating code doesn't know what to do
1267 with member templates. */
1268 DECL_IGNORED_P (tmpl) = 1;
1271 cp_error ("template declaration of `%#D'", decl);
1274 /* Return true iff TYPE is a valid Java parameter or return type. */
1277 acceptable_java_type (type)
1280 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
1282 if (TREE_CODE (type) == POINTER_TYPE)
1284 type = TREE_TYPE (type);
1285 if (TREE_CODE (type) == RECORD_TYPE)
1288 if (! TYPE_FOR_JAVA (type))
1290 if (! CLASSTYPE_TEMPLATE_INFO (type))
1292 args = CLASSTYPE_TI_ARGS (type);
1293 i = TREE_VEC_LENGTH (args);
1296 type = TREE_VEC_ELT (args, i);
1297 if (TREE_CODE (type) == POINTER_TYPE)
1298 type = TREE_TYPE (type);
1299 if (! TYPE_FOR_JAVA (type))
1308 /* For a METHOD in a Java class CTYPE, return 1 if
1309 the parameter and return types are valid Java types.
1310 Otherwise, print appropriate error messages, and return 0. */
1313 check_java_method (method)
1317 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
1318 tree ret_type = TREE_TYPE (TREE_TYPE (method));
1319 if (! acceptable_java_type (ret_type))
1321 cp_error ("Java method '%D' has non-Java return type `%T'",
1325 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
1327 tree type = TREE_VALUE (arg_types);
1328 if (! acceptable_java_type (type))
1330 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1335 return jerr ? 0 : 1;
1338 /* Sanity check: report error if this function FUNCTION is not
1339 really a member of the class (CTYPE) it is supposed to belong to.
1340 CNAME is the same here as it is for grokclassfn above. */
1343 check_classfn (ctype, function)
1344 tree ctype, function;
1346 tree fn_name = DECL_NAME (function);
1347 tree fndecl, fndecls;
1348 tree method_vec = CLASSTYPE_METHOD_VEC (complete_type (ctype));
1352 if (DECL_USE_TEMPLATE (function)
1353 && is_member_template (DECL_TI_TEMPLATE (function)))
1354 /* Since this is a specialization of a member template,
1355 we're not going to find the declaration in the class.
1358 struct S { template <typename T> void f(T); };
1359 template <> void S::f(int);
1361 we're not going to find `S::f(int)', but there's no
1362 reason we should, either. We let our callers know we didn't
1363 find the method, but we don't complain. */
1366 if (method_vec != 0)
1368 methods = &TREE_VEC_ELT (method_vec, 0);
1369 end = TREE_VEC_END (method_vec);
1371 /* First suss out ctors and dtors. */
1372 if (*methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1373 && DECL_CONSTRUCTOR_P (function))
1375 if (*++methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1376 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function)))
1379 while (++methods != end && *methods)
1382 if (fn_name == DECL_NAME (OVL_CURRENT (*methods)))
1385 for (fndecls = *methods; fndecls != NULL_TREE;
1386 fndecls = OVL_NEXT (fndecls))
1388 fndecl = OVL_CURRENT (fndecls);
1389 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1390 for a for member function of a template class, is
1391 not mangled, so the check below does not work
1392 correctly in that case. Since mangled destructor
1393 names do not include the type of the arguments,
1394 we can't use this short-cut for them, either.
1395 (It's not legal to declare arguments for a
1396 destructor, but some people try.) */
1397 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function))
1398 && (DECL_ASSEMBLER_NAME (function)
1399 != DECL_NAME (function))
1400 && (DECL_ASSEMBLER_NAME (fndecl)
1401 != DECL_NAME (fndecl))
1402 && (DECL_ASSEMBLER_NAME (function)
1403 == DECL_ASSEMBLER_NAME (fndecl)))
1406 /* We cannot simply call decls_match because this
1407 doesn't work for static member functions that are
1408 pretending to be methods, and because the name
1409 may have been changed by asm("new_name"). */
1410 if (DECL_NAME (function) == DECL_NAME (fndecl))
1412 tree p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
1413 tree p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1415 /* Get rid of the this parameter on functions that become
1417 if (DECL_STATIC_FUNCTION_P (fndecl)
1418 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1419 p1 = TREE_CHAIN (p1);
1421 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
1422 TREE_TYPE (TREE_TYPE (fndecl)))
1423 && compparms (p1, p2)
1424 && (DECL_TEMPLATE_SPECIALIZATION (function)
1425 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
1426 && (!DECL_TEMPLATE_SPECIALIZATION (function)
1427 || (DECL_TI_TEMPLATE (function)
1428 == DECL_TI_TEMPLATE (fndecl))))
1437 if (methods != end && *methods)
1439 tree fndecl = *methods;
1440 cp_error ("prototype for `%#D' does not match any in class `%T'",
1442 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl) ? "s are" : " is",
1443 OVL_CURRENT (fndecl));
1444 while (fndecl = OVL_NEXT (fndecl), fndecl)
1445 cp_error_at (" %#D", OVL_CURRENT(fndecl));
1450 if (TYPE_SIZE (ctype) == 0)
1451 incomplete_type_error (function, ctype);
1453 cp_error ("no `%#D' member function declared in class `%T'",
1457 /* If we did not find the method in the class, add it to avoid
1458 spurious errors (unless the CTYPE is not yet defined, in which
1459 case we'll only confuse ourselves when the function is declared
1460 properly within the class. */
1461 if (TYPE_SIZE (ctype))
1462 add_method (ctype, methods, function);
1466 /* We have just processed the DECL, which is a static data member.
1467 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1468 present, is the assembly-language name for the data member.
1469 FLAGS is as for cp_finish_decl. */
1472 finish_static_data_member_decl (decl, init, asmspec_tree, flags)
1478 const char *asmspec = 0;
1481 asmspec = TREE_STRING_POINTER (asmspec_tree);
1483 my_friendly_assert (TREE_PUBLIC (decl), 0);
1485 /* We cannot call pushdecl here, because that would fill in the
1486 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1487 the right thing, namely, to put this decl out straight away. */
1488 /* current_class_type can be NULL_TREE in case of error. */
1489 if (!asmspec && current_class_type)
1491 DECL_INITIAL (decl) = error_mark_node;
1492 DECL_ASSEMBLER_NAME (decl)
1493 = build_static_name (current_class_type, DECL_NAME (decl));
1495 if (! processing_template_decl)
1497 if (!pending_statics)
1498 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
1499 VARRAY_PUSH_TREE (pending_statics, decl);
1502 /* Static consts need not be initialized in the class definition. */
1503 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
1505 static int explanation = 0;
1507 error ("initializer invalid for static member with constructor");
1508 if (explanation++ == 0)
1509 error ("(you really want to initialize it separately)");
1512 /* Force the compiler to know when an uninitialized static const
1513 member is being used. */
1514 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
1515 TREE_USED (decl) = 1;
1516 DECL_INITIAL (decl) = init;
1517 DECL_IN_AGGR_P (decl) = 1;
1518 DECL_CONTEXT (decl) = current_class_type;
1520 cp_finish_decl (decl, init, asmspec_tree, flags);
1523 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1524 of a structure component, returning a FIELD_DECL node.
1525 QUALS is a list of type qualifiers for this decl (such as for declaring
1526 const member functions).
1528 This is done during the parsing of the struct declaration.
1529 The FIELD_DECL nodes are chained together and the lot of them
1530 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1534 If class A defines that certain functions in class B are friends, then
1535 the way I have set things up, it is B who is interested in permission
1536 granted by A. However, it is in A's context that these declarations
1537 are parsed. By returning a void_type_node, class A does not attempt
1538 to incorporate the declarations of the friends within its structure.
1540 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1541 CHANGES TO CODE IN `start_method'. */
1544 grokfield (declarator, declspecs, init, asmspec_tree, attrlist)
1545 tree declarator, declspecs, init, asmspec_tree, attrlist;
1547 register tree value;
1548 const char *asmspec = 0;
1549 int flags = LOOKUP_ONLYCONVERTING;
1551 /* Convert () initializers to = initializers. */
1552 if (init == NULL_TREE && declarator != NULL_TREE
1553 && TREE_CODE (declarator) == CALL_EXPR
1554 && TREE_OPERAND (declarator, 0)
1555 && (TREE_CODE (TREE_OPERAND (declarator, 0)) == IDENTIFIER_NODE
1556 || TREE_CODE (TREE_OPERAND (declarator, 0)) == SCOPE_REF)
1557 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator)))
1559 init = TREE_OPERAND (declarator, 1);
1560 declarator = TREE_OPERAND (declarator, 0);
1564 if (declspecs == NULL_TREE
1565 && TREE_CODE (declarator) == SCOPE_REF
1566 && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
1568 /* Access declaration */
1569 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
1571 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
1572 pop_nested_class ();
1573 return do_class_using_decl (declarator);
1577 && TREE_CODE (init) == TREE_LIST
1578 && TREE_VALUE (init) == error_mark_node
1579 && TREE_CHAIN (init) == NULL_TREE)
1582 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, attrlist);
1583 if (! value || value == error_mark_node)
1584 /* friend or constructor went bad. */
1587 /* Pass friendly classes back. */
1588 if (TREE_CODE (value) == VOID_TYPE)
1589 return void_type_node;
1591 if (DECL_NAME (value) != NULL_TREE
1592 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
1593 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
1594 cp_error ("member `%D' conflicts with virtual function table field name",
1597 /* Stash away type declarations. */
1598 if (TREE_CODE (value) == TYPE_DECL)
1600 DECL_NONLOCAL (value) = 1;
1601 DECL_CONTEXT (value) = current_class_type;
1603 /* Now that we've updated the context, we need to remangle the
1604 name for this TYPE_DECL. */
1605 DECL_ASSEMBLER_NAME (value) = DECL_NAME (value);
1606 if (!uses_template_parms (value))
1607 DECL_ASSEMBLER_NAME (value) =
1608 get_identifier (build_overload_name (TREE_TYPE (value), 1, 1));
1610 if (processing_template_decl)
1611 value = push_template_decl (value);
1616 if (DECL_IN_AGGR_P (value))
1618 cp_error ("`%D' is already defined in `%T'", value,
1619 DECL_CONTEXT (value));
1620 return void_type_node;
1624 asmspec = TREE_STRING_POINTER (asmspec_tree);
1628 if (TREE_CODE (value) == FUNCTION_DECL)
1630 grok_function_init (value, init);
1633 else if (pedantic && TREE_CODE (value) != VAR_DECL)
1634 /* Already complained in grokdeclarator. */
1638 /* We allow initializers to become parameters to base
1640 if (TREE_CODE (init) == TREE_LIST)
1642 if (TREE_CHAIN (init) == NULL_TREE)
1643 init = TREE_VALUE (init);
1645 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1648 if (TREE_CODE (init) == CONST_DECL)
1649 init = DECL_INITIAL (init);
1650 else if (TREE_READONLY_DECL_P (init))
1651 init = decl_constant_value (init);
1652 else if (TREE_CODE (init) == CONSTRUCTOR)
1653 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1654 if (init == error_mark_node)
1655 /* We must make this look different than `error_mark_node'
1656 because `decl_const_value' would mis-interpret it
1657 as only meaning that this VAR_DECL is defined. */
1658 init = build1 (NOP_EXPR, TREE_TYPE (value), init);
1659 else if (processing_template_decl)
1661 else if (! TREE_CONSTANT (init))
1663 /* We can allow references to things that are effectively
1664 static, since references are initialized with the address. */
1665 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
1666 || (TREE_STATIC (init) == 0
1667 && (TREE_CODE_CLASS (TREE_CODE (init)) != 'd'
1668 || DECL_EXTERNAL (init) == 0)))
1670 error ("field initializer is not constant");
1671 init = error_mark_node;
1677 if (processing_template_decl && ! current_function_decl
1678 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
1679 value = push_template_decl (value);
1682 cplus_decl_attributes (value, TREE_PURPOSE (attrlist),
1683 TREE_VALUE (attrlist));
1685 if (TREE_CODE (value) == VAR_DECL)
1687 finish_static_data_member_decl (value, init, asmspec_tree,
1691 if (TREE_CODE (value) == FIELD_DECL)
1695 /* This must override the asm specifier which was placed
1696 by grokclassfn. Lay this out fresh. */
1697 DECL_RTL (value) = NULL_RTX;
1698 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1700 if (DECL_INITIAL (value) == error_mark_node)
1701 init = error_mark_node;
1702 cp_finish_decl (value, init, asmspec_tree, flags);
1703 DECL_INITIAL (value) = init;
1704 DECL_IN_AGGR_P (value) = 1;
1707 if (TREE_CODE (value) == FUNCTION_DECL)
1711 /* This must override the asm specifier which was placed
1712 by grokclassfn. Lay this out fresh. */
1713 DECL_RTL (value) = NULL_RTX;
1714 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1716 cp_finish_decl (value, init, asmspec_tree, flags);
1718 /* Pass friends back this way. */
1719 if (DECL_FRIEND_P (value))
1720 return void_type_node;
1722 DECL_IN_AGGR_P (value) = 1;
1725 my_friendly_abort (21);
1730 /* Like `grokfield', but for bitfields.
1731 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1734 grokbitfield (declarator, declspecs, width)
1735 tree declarator, declspecs, width;
1737 register tree value = grokdeclarator (declarator, declspecs, BITFIELD,
1740 if (! value) return NULL_TREE; /* friends went bad. */
1742 /* Pass friendly classes back. */
1743 if (TREE_CODE (value) == VOID_TYPE)
1744 return void_type_node;
1746 if (TREE_CODE (value) == TYPE_DECL)
1748 cp_error ("cannot declare `%D' to be a bitfield type", value);
1752 /* Usually, finish_struct_1 catches bitifields with invalid types.
1753 But, in the case of bitfields with function type, we confuse
1754 ourselves into thinking they are member functions, so we must
1756 if (TREE_CODE (value) == FUNCTION_DECL)
1758 cp_error ("cannot declare bitfield `%D' with funcion type",
1763 if (DECL_IN_AGGR_P (value))
1765 cp_error ("`%D' is already defined in the class %T", value,
1766 DECL_CONTEXT (value));
1767 return void_type_node;
1770 GNU_xref_member (current_class_name, value);
1772 if (TREE_STATIC (value))
1774 cp_error ("static member `%D' cannot be a bitfield", value);
1777 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1779 if (width != error_mark_node)
1781 constant_expression_warning (width);
1782 DECL_INITIAL (value) = width;
1783 SET_DECL_C_BIT_FIELD (value);
1786 DECL_IN_AGGR_P (value) = 1;
1791 grokoptypename (declspecs, declarator)
1792 tree declspecs, declarator;
1794 tree t = grokdeclarator (declarator, declspecs, TYPENAME, 0, NULL_TREE);
1795 return build_typename_overload (t);
1798 /* When a function is declared with an initializer,
1799 do the right thing. Currently, there are two possibilities:
1804 // initialization possibility #1.
1805 virtual void f () = 0;
1827 // initialization possibility #2
1834 copy_assignment_arg_p (parmtype, virtualp)
1836 int virtualp ATTRIBUTE_UNUSED;
1838 if (current_class_type == NULL_TREE)
1841 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
1842 parmtype = TREE_TYPE (parmtype);
1844 if ((TYPE_MAIN_VARIANT (parmtype) == current_class_type)
1846 /* Non-standard hack to support old Booch components. */
1847 || (! virtualp && DERIVED_FROM_P (parmtype, current_class_type))
1856 grok_function_init (decl, init)
1860 /* An initializer for a function tells how this function should
1862 tree type = TREE_TYPE (decl);
1864 if (TREE_CODE (type) == FUNCTION_TYPE)
1865 cp_error ("initializer specified for non-member function `%D'", decl);
1867 /* We'll check for this in finish_struct_1. */
1868 else if (DECL_VINDEX (decl) == NULL_TREE)
1869 cp_error ("initializer specified for non-virtual member function `%D'", decl);
1871 else if (integer_zerop (init))
1874 /* Mark this function as being "defined". */
1875 DECL_INITIAL (decl) = error_mark_node;
1876 /* pure virtual destructors must be defined. */
1877 /* pure virtual needs to be defined (as abort) only when put in
1878 vtbl. For wellformed call, it should be itself. pr4737 */
1879 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl)))
1881 /* Give this node rtl from `abort'. */
1882 DECL_RTL (decl) = DECL_RTL (abort_fndecl);
1885 DECL_PURE_VIRTUAL_P (decl) = 1;
1886 if (DECL_NAME (decl) == ansi_opname [(int) MODIFY_EXPR])
1889 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl))));
1891 if (copy_assignment_arg_p (parmtype, 1))
1892 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type) = 1;
1896 cp_error ("invalid initializer for virtual method `%D'", decl);
1900 cplus_decl_attributes (decl, attributes, prefix_attributes)
1901 tree decl, attributes, prefix_attributes;
1903 if (decl == NULL_TREE || decl == void_type_node)
1906 if (TREE_CODE (decl) == TEMPLATE_DECL)
1907 decl = DECL_TEMPLATE_RESULT (decl);
1909 decl_attributes (decl, attributes, prefix_attributes);
1911 if (TREE_CODE (decl) == TYPE_DECL)
1912 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl), TREE_TYPE (decl));
1915 /* CONSTRUCTOR_NAME:
1916 Return the name for the constructor (or destructor) for the
1917 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1918 IDENTIFIER_NODE. When given a template, this routine doesn't
1919 lose the specialization. */
1922 constructor_name_full (thing)
1925 if (TREE_CODE (thing) == TEMPLATE_TYPE_PARM
1926 || TREE_CODE (thing) == TEMPLATE_TEMPLATE_PARM
1927 || TREE_CODE (thing) == TYPENAME_TYPE)
1928 thing = TYPE_NAME (thing);
1929 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing)))
1931 if (TYPE_WAS_ANONYMOUS (thing) && TYPE_HAS_CONSTRUCTOR (thing))
1932 thing = DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing), 0)));
1934 thing = TYPE_NAME (thing);
1936 if (TREE_CODE (thing) == TYPE_DECL
1937 || (TREE_CODE (thing) == TEMPLATE_DECL
1938 && TREE_CODE (DECL_TEMPLATE_RESULT (thing)) == TYPE_DECL))
1939 thing = DECL_NAME (thing);
1940 my_friendly_assert (TREE_CODE (thing) == IDENTIFIER_NODE, 197);
1944 /* CONSTRUCTOR_NAME:
1945 Return the name for the constructor (or destructor) for the
1946 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1947 IDENTIFIER_NODE. When given a template, return the plain
1948 unspecialized name. */
1951 constructor_name (thing)
1955 thing = constructor_name_full (thing);
1956 t = IDENTIFIER_TEMPLATE (thing);
1962 /* Record the existence of an addressable inline function. */
1965 mark_inline_for_output (decl)
1968 decl = DECL_MAIN_VARIANT (decl);
1969 if (DECL_SAVED_INLINE (decl))
1971 DECL_SAVED_INLINE (decl) = 1;
1973 VARRAY_TREE_INIT (saved_inlines, 32, "saved_inlines");
1975 VARRAY_PUSH_TREE (saved_inlines, decl);
1978 /* Hand off a unique name which can be used for variable we don't really
1979 want to know about anyway, for example, the anonymous variables which
1980 are needed to make references work. Declare this thing so we can use it.
1981 The variable created will be of type TYPE.
1983 STATICP is nonzero if this variable should be static. */
1986 get_temp_name (type, staticp)
1990 char buf[sizeof (AUTO_TEMP_FORMAT) + 20];
1992 int toplev = toplevel_bindings_p ();
1994 if (toplev || staticp)
1996 sprintf (buf, AUTO_TEMP_FORMAT, global_temp_name_counter++);
1997 decl = pushdecl_top_level (build_decl (VAR_DECL, get_identifier (buf), type));
2001 sprintf (buf, AUTO_TEMP_FORMAT, temp_name_counter++);
2002 decl = pushdecl (build_decl (VAR_DECL, get_identifier (buf), type));
2004 TREE_USED (decl) = 1;
2005 TREE_STATIC (decl) = staticp;
2006 DECL_ARTIFICIAL (decl) = 1;
2008 /* If this is a local variable, then lay out its rtl now.
2009 Otherwise, callers of this function are responsible for dealing
2010 with this variable's rtl. */
2014 my_friendly_assert (DECL_INITIAL (decl) == NULL_TREE,
2021 /* Hunts through the global anonymous union ANON_DECL, building
2022 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2023 returns a VAR_DECL whose size is the same as the size of the
2024 ANON_DECL, if one is available. */
2027 build_anon_union_vars (anon_decl, elems, static_p, external_p)
2033 tree type = TREE_TYPE (anon_decl);
2034 tree main_decl = NULL_TREE;
2037 /* Rather than write the code to handle the non-union case,
2038 just give an error. */
2039 if (TREE_CODE (type) != UNION_TYPE)
2040 error ("anonymous struct not inside named type");
2042 for (field = TYPE_FIELDS (type);
2044 field = TREE_CHAIN (field))
2048 if (DECL_ARTIFICIAL (field))
2050 if (TREE_CODE (field) != FIELD_DECL)
2052 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2057 if (TREE_PRIVATE (field))
2058 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
2059 else if (TREE_PROTECTED (field))
2060 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
2062 if (DECL_NAME (field) == NULL_TREE
2063 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2065 decl = build_anon_union_vars (field, elems, static_p, external_p);
2069 else if (DECL_NAME (field) == NULL_TREE)
2073 decl = build_decl (VAR_DECL, DECL_NAME (field), TREE_TYPE (field));
2074 /* tell `pushdecl' that this is not tentative. */
2075 DECL_INITIAL (decl) = error_mark_node;
2076 TREE_PUBLIC (decl) = 0;
2077 TREE_STATIC (decl) = static_p;
2078 DECL_EXTERNAL (decl) = external_p;
2079 decl = pushdecl (decl);
2080 DECL_INITIAL (decl) = NULL_TREE;
2083 /* Only write out one anon union element--choose the one that
2084 can hold them all. */
2085 if (main_decl == NULL_TREE
2086 && simple_cst_equal (DECL_SIZE (decl),
2087 DECL_SIZE (anon_decl)) == 1)
2090 /* ??? This causes there to be no debug info written out
2092 TREE_ASM_WRITTEN (decl) = 1;
2094 if (DECL_NAME (field) == NULL_TREE
2095 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2096 /* The remainder of the processing was already done in the
2100 /* If there's a cleanup to do, it belongs in the
2101 TREE_PURPOSE of the following TREE_LIST. */
2102 *elems = tree_cons (NULL_TREE, decl, *elems);
2103 TREE_TYPE (*elems) = type;
2109 /* Finish off the processing of a UNION_TYPE structure.
2110 If there are static members, then all members are
2111 static, and must be laid out together. If the
2112 union is an anonymous union, we arrange for that
2113 as well. PUBLIC_P is nonzero if this union is
2114 not declared static. */
2117 finish_anon_union (anon_union_decl)
2118 tree anon_union_decl;
2120 tree type = TREE_TYPE (anon_union_decl);
2122 int public_p = TREE_PUBLIC (anon_union_decl);
2123 int static_p = TREE_STATIC (anon_union_decl);
2124 int external_p = DECL_EXTERNAL (anon_union_decl);
2126 if (TYPE_FIELDS (type) == NULL_TREE)
2131 error ("global anonymous unions must be declared static");
2135 main_decl = build_anon_union_vars (anon_union_decl,
2136 &DECL_ANON_UNION_ELEMS (anon_union_decl),
2137 static_p, external_p);
2139 if (main_decl == NULL_TREE)
2141 warning ("anonymous union with no members");
2147 make_decl_rtl (main_decl, 0, toplevel_bindings_p ());
2148 DECL_RTL (anon_union_decl) = DECL_RTL (main_decl);
2149 expand_anon_union_decl (anon_union_decl,
2151 DECL_ANON_UNION_ELEMS (anon_union_decl));
2154 add_decl_stmt (anon_union_decl);
2157 /* Finish processing a builtin type TYPE. It's name is NAME,
2158 its fields are in the array FIELDS. LEN is the number of elements
2159 in FIELDS minus one, or put another way, it is the maximum subscript
2162 It is given the same alignment as ALIGN_TYPE. */
2165 finish_builtin_type (type, name, fields, len, align_type)
2174 TYPE_FIELDS (type) = fields[0];
2175 for (i = 0; i < len; i++)
2177 layout_type (TREE_TYPE (fields[i]));
2178 DECL_FIELD_CONTEXT (fields[i]) = type;
2179 TREE_CHAIN (fields[i]) = fields[i+1];
2181 DECL_FIELD_CONTEXT (fields[i]) = type;
2182 TYPE_ALIGN (type) = TYPE_ALIGN (align_type);
2184 #if 0 /* not yet, should get fixed properly later */
2185 TYPE_NAME (type) = make_type_decl (get_identifier (name), type);
2187 TYPE_NAME (type) = build_decl (TYPE_DECL, get_identifier (name), type);
2189 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2190 layout_decl (TYPE_NAME (type), 0);
2193 /* Auxiliary functions to make type signatures for
2194 `operator new' and `operator delete' correspond to
2195 what compiler will be expecting. */
2198 coerce_new_type (type)
2203 if (TREE_CODE (type) == METHOD_TYPE)
2204 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (TYPE_ARG_TYPES (type)));
2205 if (! same_type_p (TREE_TYPE (type), ptr_type_node))
2206 e1 = 1, error ("`operator new' must return type `void *'");
2208 /* Technically the type must be `size_t', but we may not know
2210 if (TYPE_ARG_TYPES (type) == NULL_TREE)
2211 e1 = 1, error ("`operator new' takes type `size_t' parameter");
2212 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type)), sizetype))
2213 e2 = 1, error ("`operator new' takes type `size_t' as first parameter");
2215 type = build_function_type (ptr_type_node, tree_cons (NULL_TREE, sizetype, TREE_CHAIN (TYPE_ARG_TYPES (type))));
2217 type = build_function_type (ptr_type_node, TYPE_ARG_TYPES (type));
2222 coerce_delete_type (type)
2229 tree arg_types = TYPE_ARG_TYPES (type);
2231 if (TREE_CODE (type) == METHOD_TYPE)
2233 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (arg_types));
2234 arg_types = TREE_CHAIN (arg_types);
2237 if (TREE_TYPE (type) != void_type_node)
2238 e1 = 1, error ("`operator delete' must return type `void'");
2240 if (arg_types == NULL_TREE
2241 || ! same_type_p (TREE_VALUE (arg_types), ptr_type_node))
2242 e2 = 1, error ("`operator delete' takes type `void *' as first parameter");
2246 && TREE_CHAIN (arg_types)
2247 && TREE_CHAIN (arg_types) != void_list_node)
2249 /* Again, technically this argument must be `size_t', but again
2250 we may not know what that is. */
2251 tree t2 = TREE_VALUE (TREE_CHAIN (arg_types));
2252 if (! same_type_p (t2, sizetype))
2253 e3 = 1, error ("second argument to `operator delete' must be of type `size_t'");
2254 else if (TREE_CHAIN (TREE_CHAIN (arg_types)) != void_list_node)
2257 if (TREE_CHAIN (TREE_CHAIN (arg_types)))
2258 error ("too many arguments in declaration of `operator delete'");
2260 error ("`...' invalid in specification of `operator delete'");
2265 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2266 build_tree_list (NULL_TREE, sizetype));
2269 if (arg_types == NULL_TREE)
2270 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
2272 arg_types = tree_cons (NULL_TREE, ptr_type_node, TREE_CHAIN (arg_types));
2278 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2279 arg_types ? TREE_CHAIN (arg_types): NULL_TREE);
2281 type = build_function_type (void_type_node, arg_types);
2287 mark_vtable_entries (decl)
2290 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
2292 for (; entries; entries = TREE_CHAIN (entries))
2297 fnaddr = (flag_vtable_thunks ? TREE_VALUE (entries)
2298 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries)));
2300 if (TREE_CODE (fnaddr) != ADDR_EXPR)
2301 /* This entry is an offset: a virtual base class offset, a
2302 virtual call offset, and RTTI offset, etc. */
2305 fn = TREE_OPERAND (fnaddr, 0);
2306 TREE_ADDRESSABLE (fn) = 1;
2307 if (TREE_CODE (fn) == THUNK_DECL && DECL_EXTERNAL (fn))
2309 DECL_EXTERNAL (fn) = 0;
2316 /* Set DECL up to have the closest approximation of "initialized common"
2317 linkage available. */
2320 comdat_linkage (decl)
2324 make_decl_one_only (decl);
2325 else if (TREE_CODE (decl) == FUNCTION_DECL || DECL_VIRTUAL_P (decl))
2326 /* We can just emit functions and vtables statically; it doesn't really
2327 matter if we have multiple copies. */
2328 TREE_PUBLIC (decl) = 0;
2331 /* Static data member template instantiations, however, cannot
2332 have multiple copies. */
2333 if (DECL_INITIAL (decl) == 0
2334 || DECL_INITIAL (decl) == error_mark_node)
2335 DECL_COMMON (decl) = 1;
2336 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
2338 DECL_COMMON (decl) = 1;
2339 DECL_INITIAL (decl) = error_mark_node;
2343 /* We can't do anything useful; leave vars for explicit
2345 DECL_EXTERNAL (decl) = 1;
2346 DECL_NOT_REALLY_EXTERN (decl) = 0;
2350 if (DECL_LANG_SPECIFIC (decl))
2351 DECL_COMDAT (decl) = 1;
2354 /* For win32 we also want to put explicit instantiations in
2355 linkonce sections, so that they will be merged with implicit
2356 instantiations; otherwise we get duplicate symbol errors. */
2359 maybe_make_one_only (decl)
2362 /* We used to say that this was not necessary on targets that support weak
2363 symbols, because the implicit instantiations will defer to the explicit
2364 one. However, that's not actually the case in SVR4; a strong definition
2365 after a weak one is an error. Also, not making explicit
2366 instantiations one_only means that we can end up with two copies of
2367 some template instantiations. */
2368 if (! supports_one_only ())
2371 /* We can't set DECL_COMDAT on functions, or finish_file will think
2372 we can get away with not emitting them if they aren't used. We need
2373 to for variables so that cp_finish_decl will update their linkage,
2374 because their DECL_INITIAL may not have been set properly yet. */
2376 make_decl_one_only (decl);
2378 if (TREE_CODE (decl) == VAR_DECL && DECL_LANG_SPECIFIC (decl))
2379 DECL_COMDAT (decl) = 1;
2382 /* Returns the virtual function with which the vtable for TYPE is
2383 emitted, or NULL_TREE if that heuristic is not applicable to TYPE. */
2391 if (TYPE_FOR_JAVA (type)
2392 || CLASSTYPE_INTERFACE_KNOWN (type))
2395 for (method = TYPE_METHODS (type); method != NULL_TREE;
2396 method = TREE_CHAIN (method))
2397 if (DECL_VINDEX (method) != NULL_TREE
2398 && ! DECL_THIS_INLINE (method)
2399 && ! DECL_PURE_VIRTUAL_P (method))
2405 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2406 based on TYPE and other static flags.
2408 Note that anything public is tagged TREE_PUBLIC, whether
2409 it's public in this file or in another one. */
2412 import_export_vtable (decl, type, final)
2416 if (DECL_INTERFACE_KNOWN (decl))
2419 if (TYPE_FOR_JAVA (type))
2421 TREE_PUBLIC (decl) = 1;
2422 DECL_EXTERNAL (decl) = 1;
2423 DECL_INTERFACE_KNOWN (decl) = 1;
2425 else if (CLASSTYPE_INTERFACE_KNOWN (type))
2427 TREE_PUBLIC (decl) = 1;
2428 DECL_EXTERNAL (decl) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type);
2429 DECL_INTERFACE_KNOWN (decl) = 1;
2433 /* We can only wait to decide if we have real non-inline virtual
2434 functions in our class, or if we come from a template. */
2436 int found = (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
2437 || key_method (type));
2439 if (final || ! found)
2441 comdat_linkage (decl);
2442 DECL_EXTERNAL (decl) = 0;
2446 TREE_PUBLIC (decl) = 1;
2447 DECL_EXTERNAL (decl) = 1;
2452 /* Determine whether or not we want to specifically import or export CTYPE,
2453 using various heuristics. */
2456 import_export_class (ctype)
2459 /* -1 for imported, 1 for exported. */
2460 int import_export = 0;
2462 /* It only makes sense to call this function at EOF. The reason is
2463 that this function looks at whether or not the first non-inline
2464 non-abstract virtual member function has been defined in this
2465 translation unit. But, we can't possibly know that until we've
2466 seen the entire translation unit. */
2467 my_friendly_assert (at_eof, 20000226);
2469 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
2472 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2473 we will have CLASSTYPE_INTERFACE_ONLY set but not
2474 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2475 heuristic because someone will supply a #pragma implementation
2476 elsewhere, and deducing it here would produce a conflict. */
2477 if (CLASSTYPE_INTERFACE_ONLY (ctype))
2480 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2481 /* FIXME this should really use some sort of target-independent macro. */
2482 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
2484 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
2488 /* If we got -fno-implicit-templates, we import template classes that
2489 weren't explicitly instantiated. */
2490 if (import_export == 0
2491 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
2492 && ! flag_implicit_templates)
2495 /* Base our import/export status on that of the first non-inline,
2496 non-pure virtual function, if any. */
2497 if (import_export == 0
2498 && TYPE_POLYMORPHIC_P (ctype)
2499 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
2501 tree method = key_method (ctype);
2503 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
2506 #ifdef MULTIPLE_SYMBOL_SPACES
2507 if (import_export == -1)
2513 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
2514 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype) = (import_export > 0);
2515 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
2519 /* We need to describe to the assembler the relationship between
2520 a vtable and the vtable of the parent class. */
2523 output_vtable_inherit (vars)
2529 op[0] = XEXP (DECL_RTL (vars), 0); /* strip the mem ref */
2531 parent = binfo_for_vtable (vars);
2533 if (parent == TYPE_BINFO (DECL_CONTEXT (vars)))
2537 parent = TYPE_BINFO_VTABLE (BINFO_TYPE (parent));
2538 op[1] = XEXP (DECL_RTL (parent), 0); /* strip the mem ref */
2541 my_friendly_abort (980826);
2543 output_asm_insn (".vtable_inherit %c0, %c1", op);
2547 finish_vtable_vardecl (t, data)
2549 void *data ATTRIBUTE_UNUSED;
2552 tree ctype = DECL_CONTEXT (vars);
2553 import_export_class (ctype);
2554 import_export_vtable (vars, ctype, 1);
2556 if (! DECL_EXTERNAL (vars)
2557 && DECL_NEEDED_P (vars)
2558 && ! TREE_ASM_WRITTEN (vars))
2560 if (TREE_TYPE (vars) == void_type_node)
2561 /* It is a dummy vtable made by get_vtable_decl. Ignore it. */
2565 mark_vtable_entries (vars);
2566 if (TREE_TYPE (DECL_INITIAL (vars)) == 0)
2567 store_init_value (vars, DECL_INITIAL (vars));
2569 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
2571 /* Mark the VAR_DECL node representing the vtable itself as a
2572 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2573 It is rather important that such things be ignored because
2574 any effort to actually generate DWARF for them will run
2575 into trouble when/if we encounter code like:
2578 struct S { virtual void member (); };
2580 because the artificial declaration of the vtable itself (as
2581 manufactured by the g++ front end) will say that the vtable
2582 is a static member of `S' but only *after* the debug output
2583 for the definition of `S' has already been output. This causes
2584 grief because the DWARF entry for the definition of the vtable
2585 will try to refer back to an earlier *declaration* of the
2586 vtable as a static member of `S' and there won't be one.
2587 We might be able to arrange to have the "vtable static member"
2588 attached to the member list for `S' before the debug info for
2589 `S' get written (which would solve the problem) but that would
2590 require more intrusive changes to the g++ front end. */
2592 DECL_IGNORED_P (vars) = 1;
2595 /* Always make vtables weak. */
2597 comdat_linkage (vars);
2599 rest_of_decl_compilation (vars, NULL_PTR, 1, 1);
2602 output_vtable_inherit (vars);
2604 /* Because we're only doing syntax-checking, we'll never end up
2605 actually marking the variable as written. */
2606 if (flag_syntax_only)
2607 TREE_ASM_WRITTEN (vars) = 1;
2609 /* Since we're writing out the vtable here, also write the debug
2611 note_debug_info_needed (ctype);
2616 /* If the references to this class' vtables were optimized away, still
2617 emit the appropriate debugging information. See dfs_debug_mark. */
2618 if (DECL_COMDAT (vars)
2619 && CLASSTYPE_DEBUG_REQUESTED (ctype))
2620 note_debug_info_needed (ctype);
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);