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 /* Nonzero means to implement standard semantics for exception
494 specifications, calling unexpected if an exception is thrown that
495 doesn't match the specification. Zero means to treat them as
496 assertions and optimize accordingly, but not check them. */
498 int flag_enforce_eh_specs = 1;
500 /* If this variable is defined to a non-NULL value, it will be called
501 after the file has been completely parsed. */
503 void (*back_end_hook) PARAMS ((tree));
505 /* Table of language-dependent -f options.
506 STRING is the option name. VARIABLE is the address of the variable.
507 ON_VALUE is the value to store in VARIABLE
508 if `-fSTRING' is seen as an option.
509 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
511 static struct { const char *string; int *variable; int on_value;}
515 {"signed-char", &flag_signed_char, 1},
516 {"unsigned-char", &flag_signed_char, 0},
517 {"signed-bitfields", &flag_signed_bitfields, 1},
518 {"unsigned-bitfields", &flag_signed_bitfields, 0},
519 {"short-enums", &flag_short_enums, 1},
520 {"short-double", &flag_short_double, 1},
521 {"short-wchar", &flag_short_wchar, 1},
522 {"cond-mismatch", &flag_cond_mismatch, 1},
523 {"asm", &flag_no_asm, 0},
524 {"builtin", &flag_no_builtin, 0},
526 /* C++-only options. */
527 {"access-control", &flag_access_control, 1},
528 {"check-new", &flag_check_new, 1},
529 {"conserve-space", &flag_conserve_space, 1},
530 {"const-strings", &flag_const_strings, 1},
531 {"default-inline", &flag_default_inline, 1},
532 {"dollars-in-identifiers", &dollars_in_ident, 1},
533 {"elide-constructors", &flag_elide_constructors, 1},
534 {"enforce-eh-specs", &flag_enforce_eh_specs, 1},
535 {"external-templates", &flag_external_templates, 1},
536 {"for-scope", &flag_new_for_scope, 2},
537 {"gnu-keywords", &flag_no_gnu_keywords, 0},
538 {"handle-exceptions", &flag_exceptions, 1},
539 {"honor-std", &flag_honor_std, 1},
540 {"huge-objects", &flag_huge_objects, 1},
541 {"implement-inlines", &flag_implement_inlines, 1},
542 {"implicit-inline-templates", &flag_implicit_inline_templates, 1},
543 {"implicit-templates", &flag_implicit_templates, 1},
544 {"labels-ok", &flag_labels_ok, 1},
545 {"ms-extensions", &flag_ms_extensions, 1},
546 {"nonansi-builtins", &flag_no_nonansi_builtin, 0},
547 {"operator-names", &flag_operator_names, 1},
548 {"optional-diags", &flag_optional_diags, 1},
549 {"permissive", &flag_permissive, 1},
550 {"repo", &flag_use_repository, 1},
551 {"rtti", &flag_rtti, 1},
552 {"squangle", &flag_do_squangling, 1},
553 {"stats", &flag_detailed_statistics, 1},
554 {"strict-prototype", &flag_strict_prototype, 1},
555 {"use-cxa-atexit", &flag_use_cxa_atexit, 1},
556 {"vtable-gc", &flag_vtable_gc, 1},
557 {"vtable-thunks", &flag_vtable_thunks, 1},
558 {"weak", &flag_weak, 1},
559 {"xref", &flag_gnu_xref, 1}
562 /* Decode the string P as a language-specific option.
563 Return the number of strings consumed for a valid option.
564 Otherwise return 0. Should not complain if it does not
565 recognise the option. */
568 lang_decode_option (argc, argv)
577 int strings_processed;
580 strings_processed = cpp_handle_option (&parse_in, argc, argv);
582 strings_processed = 0;
583 #endif /* ! USE_CPPLIB */
585 if (!strcmp (p, "-ftraditional") || !strcmp (p, "-traditional"))
587 else if (p[0] == '-' && p[1] == 'f')
589 /* Some kind of -f option.
590 P's value is the option sans `-f'.
591 Search for it in the table of options. */
595 /* Try special -f options. */
597 if (!strcmp (p, "handle-exceptions")
598 || !strcmp (p, "no-handle-exceptions"))
599 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
600 else if (!strcmp (p, "all-virtual")
601 || !strcmp (p, "enum-int-equiv")
602 || !strcmp (p, "no-nonnull-objects")
603 || !strcmp (p, "this-is-variable"))
604 warning ("-f%s is no longer supported", p);
605 else if (! strcmp (p, "alt-external-templates"))
607 flag_external_templates = 1;
608 flag_alt_external_templates = 1;
609 cp_deprecated ("-falt-external-templates");
611 else if (! strcmp (p, "no-alt-external-templates"))
612 flag_alt_external_templates = 0;
613 else if (!strcmp (p, "repo"))
615 flag_use_repository = 1;
616 flag_implicit_templates = 0;
618 else if (!strcmp (p, "guiding-decls"))
620 flag_guiding_decls = 1;
621 name_mangling_version = 0;
623 else if (!strcmp (p, "no-guiding-decls"))
624 flag_guiding_decls = 0;
625 else if (!strcmp (p, "external-templates"))
627 flag_external_templates = 1;
628 cp_deprecated ("-fexternal-templates");
630 else if (!strcmp (p, "new-abi"))
633 flag_do_squangling = 1;
634 flag_vtable_thunks = 1;
636 else if (!strcmp (p, "no-new-abi"))
639 flag_do_squangling = 0;
641 else if (!strncmp (p, "template-depth-", 15))
643 = read_integral_parameter (p + 15, p - 2, max_tinst_depth);
644 else if (!strncmp (p, "name-mangling-version-", 22))
645 name_mangling_version
646 = read_integral_parameter (p + 22, p - 2, name_mangling_version);
647 else if (!strncmp (p, "message-length=", 15))
649 (read_integral_parameter (p + 15, p - 2,
650 /* default line-wrap length */ 72));
651 else if (!strncmp (p, "dump-translation-unit-", 22))
654 error ("no file specified with -fdump-translation-unit");
656 flag_dump_translation_unit = p + 22;
663 !found && j < (sizeof (lang_f_options)
664 / sizeof (lang_f_options[0]));
667 if (!strcmp (p, lang_f_options[j].string))
669 *lang_f_options[j].variable = lang_f_options[j].on_value;
670 /* A goto here would be cleaner,
671 but breaks the vax pcc. */
674 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-'
675 && ! strcmp (p+3, lang_f_options[j].string))
677 *lang_f_options[j].variable = ! lang_f_options[j].on_value;
685 else if (p[0] == '-' && p[1] == 'W')
689 /* The -W options control the warning behavior of the compiler. */
692 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-')
695 if (!strcmp (p, "implicit"))
696 warn_implicit = setting;
697 else if (!strcmp (p, "long-long"))
698 warn_long_long = setting;
699 else if (!strcmp (p, "return-type"))
700 warn_return_type = setting;
701 else if (!strcmp (p, "ctor-dtor-privacy"))
702 warn_ctor_dtor_privacy = setting;
703 else if (!strcmp (p, "write-strings"))
704 warn_write_strings = setting;
705 else if (!strcmp (p, "cast-qual"))
706 warn_cast_qual = setting;
707 else if (!strcmp (p, "char-subscripts"))
708 warn_char_subscripts = setting;
709 else if (!strcmp (p, "pointer-arith"))
710 warn_pointer_arith = setting;
711 else if (!strcmp (p, "missing-prototypes"))
712 warn_missing_prototypes = setting;
713 else if (!strcmp (p, "redundant-decls"))
714 warn_redundant_decls = setting;
715 else if (!strcmp (p, "missing-braces"))
716 warn_missing_braces = setting;
717 else if (!strcmp (p, "sign-compare"))
718 warn_sign_compare = setting;
719 else if (!strcmp (p, "float-equal"))
720 warn_float_equal = setting;
721 else if (!strcmp (p, "format"))
722 warn_format = setting;
723 else if (!strcmp (p, "conversion"))
724 warn_conversion = setting;
725 else if (!strcmp (p, "parentheses"))
726 warn_parentheses = setting;
727 else if (!strcmp (p, "non-virtual-dtor"))
728 warn_nonvdtor = setting;
729 else if (!strcmp (p, "extern-inline"))
730 warn_extern_inline = setting;
731 else if (!strcmp (p, "reorder"))
732 warn_reorder = setting;
733 else if (!strcmp (p, "synth"))
734 warn_synth = setting;
735 else if (!strcmp (p, "pmf-conversions"))
736 warn_pmf2ptr = setting;
737 else if (!strcmp (p, "effc++"))
739 else if (!strcmp (p, "sign-promo"))
740 warn_sign_promo = setting;
741 else if (!strcmp (p, "old-style-cast"))
742 warn_old_style_cast = setting;
743 else if (!strcmp (p, "overloaded-virtual"))
744 warn_overloaded_virtual = setting;
745 else if (!strcmp (p, "multichar"))
746 warn_multichar = setting;
747 else if (!strcmp (p, "unknown-pragmas"))
748 /* Set to greater than 1, so that even unknown pragmas in
749 system headers will be warned about. */
750 warn_unknown_pragmas = setting * 2;
751 else if (!strcmp (p, "non-template-friend"))
752 warn_nontemplate_friend = setting;
753 else if (!strcmp (p, "deprecated"))
754 warn_deprecated = setting;
755 else if (!strcmp (p, "comment"))
756 ; /* cpp handles this one. */
757 else if (!strcmp (p, "comments"))
758 ; /* cpp handles this one. */
759 else if (!strcmp (p, "trigraphs"))
760 ; /* cpp handles this one. */
761 else if (!strcmp (p, "import"))
762 ; /* cpp handles this one. */
763 else if (!strcmp (p, "all"))
765 warn_return_type = setting;
766 warn_unused = setting;
767 warn_implicit = setting;
768 warn_switch = setting;
769 warn_format = setting;
770 warn_parentheses = setting;
771 warn_missing_braces = setting;
772 warn_sign_compare = setting;
773 warn_multichar = setting;
774 /* We save the value of warn_uninitialized, since if they put
775 -Wuninitialized on the command line, we need to generate a
776 warning about not using it without also specifying -O. */
777 if (warn_uninitialized != 1)
778 warn_uninitialized = (setting ? 2 : 0);
779 /* Only warn about unknown pragmas that are not in system
781 warn_unknown_pragmas = 1;
783 /* C++-specific warnings. */
784 warn_ctor_dtor_privacy = setting;
785 warn_nonvdtor = setting;
786 warn_reorder = setting;
787 warn_nontemplate_friend = setting;
789 else return strings_processed;
791 else if (!strcmp (p, "-ansi"))
792 flag_no_nonansi_builtin = 1, flag_ansi = 1,
793 flag_no_gnu_keywords = 1, flag_operator_names = 1;
795 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
796 it's probably safe to assume no sane person would ever want to use this
797 under normal circumstances. */
798 else if (!strcmp (p, "-spew-debug"))
802 return strings_processed;
807 /* Incorporate `const' and `volatile' qualifiers for member functions.
808 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
809 QUALS is a list of qualifiers. Returns any explicit
810 top-level qualifiers of the method's this pointer, anything other than
811 TYPE_UNQUALIFIED will be an extension. */
814 grok_method_quals (ctype, function, quals)
815 tree ctype, function, quals;
817 tree fntype = TREE_TYPE (function);
818 tree raises = TYPE_RAISES_EXCEPTIONS (fntype);
819 int type_quals = TYPE_UNQUALIFIED;
820 int dup_quals = TYPE_UNQUALIFIED;
821 int this_quals = TYPE_UNQUALIFIED;
825 int tq = cp_type_qual_from_rid (TREE_VALUE (quals));
827 if ((type_quals | this_quals) & tq)
829 else if (tq & TYPE_QUAL_RESTRICT)
833 quals = TREE_CHAIN (quals);
837 if (dup_quals != TYPE_UNQUALIFIED)
838 cp_error ("duplicate type qualifiers in %s declaration",
839 TREE_CODE (function) == FUNCTION_DECL
840 ? "member function" : "type");
842 ctype = cp_build_qualified_type (ctype, type_quals);
843 fntype = build_cplus_method_type (ctype, TREE_TYPE (fntype),
844 (TREE_CODE (fntype) == METHOD_TYPE
845 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
846 : TYPE_ARG_TYPES (fntype)));
848 fntype = build_exception_variant (fntype, raises);
850 TREE_TYPE (function) = fntype;
854 /* Warn when -fexternal-templates is used and #pragma
855 interface/implementation is not used all the times it should be,
859 warn_if_unknown_interface (decl)
862 static int already_warned = 0;
863 if (already_warned++)
866 if (flag_alt_external_templates)
868 struct tinst_level *til = tinst_for_decl ();
870 char *sf = input_filename;
875 input_filename = til->file;
877 cp_warning ("template `%#D' instantiated in file without #pragma interface",
883 cp_warning_at ("template `%#D' defined in file without #pragma interface",
887 /* A subroutine of the parser, to handle a component list. */
890 grok_x_components (specs)
893 struct pending_inline **p;
896 specs = strip_attrs (specs);
898 check_tag_decl (specs);
899 t = groktypename (build_decl_list (specs, NULL_TREE));
901 /* The only case where we need to do anything additional here is an
902 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
903 if (t == NULL_TREE || !ANON_AGGR_TYPE_P (t))
906 fixup_anonymous_aggr (t);
907 finish_member_declaration (build_lang_decl (FIELD_DECL, NULL_TREE, t));
909 /* Ignore any inline function definitions in the anonymous union
910 since an anonymous union may not have function members. */
911 p = &pending_inlines;
912 for (; *p; *p = (*p)->next)
913 if (DECL_CONTEXT ((*p)->fndecl) != t)
917 /* Constructors for types with virtual baseclasses need an "in-charge" flag
918 saying whether this constructor is responsible for initialization of
919 virtual baseclasses or not. All destructors also need this "in-charge"
920 flag, which additionally determines whether or not the destructor should
921 free the memory for the object.
923 This function adds the "in-charge" flag to member function FN if
924 appropriate. It is called from grokclassfn and tsubst.
925 FN must be either a constructor or destructor. */
928 maybe_retrofit_in_chrg (fn)
931 tree basetype, arg_types, parms, parm, fntype;
933 if (DECL_CONSTRUCTOR_P (fn)
934 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn))
935 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn))
937 else if (! DECL_CONSTRUCTOR_P (fn)
938 && TREE_CHAIN (DECL_ARGUMENTS (fn)) == NULL_TREE)
943 if (DECL_CONSTRUCTOR_P (fn))
944 DECL_CONSTRUCTOR_FOR_VBASE_P (fn) = 1;
946 /* First add it to DECL_ARGUMENTS... */
947 parm = build_decl (PARM_DECL, in_charge_identifier, integer_type_node);
948 /* Mark the artificial `__in_chrg' parameter as "artificial". */
949 SET_DECL_ARTIFICIAL (parm);
950 DECL_ARG_TYPE (parm) = integer_type_node;
951 TREE_READONLY (parm) = 1;
952 parms = DECL_ARGUMENTS (fn);
953 TREE_CHAIN (parm) = TREE_CHAIN (parms);
954 TREE_CHAIN (parms) = parm;
956 /* ...and then to TYPE_ARG_TYPES. */
957 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
958 basetype = TREE_TYPE (TREE_VALUE (arg_types));
959 arg_types = hash_tree_chain (integer_type_node, TREE_CHAIN (arg_types));
960 fntype = build_cplus_method_type (basetype, TREE_TYPE (TREE_TYPE (fn)),
962 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
963 fntype = build_exception_variant (fntype,
964 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
965 TREE_TYPE (fn) = fntype;
968 /* Classes overload their constituent function names automatically.
969 When a function name is declared in a record structure,
970 its name is changed to it overloaded name. Since names for
971 constructors and destructors can conflict, we place a leading
974 CNAME is the name of the class we are grokking for.
976 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
978 FLAGS contains bits saying what's special about today's
979 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
981 If FUNCTION is a destructor, then we must add the `auto-delete' field
982 as a second parameter. There is some hair associated with the fact
983 that we must "declare" this variable in the manner consistent with the
984 way the rest of the arguments were declared.
986 QUALS are the qualifiers for the this pointer. */
989 grokclassfn (ctype, function, flags, quals)
990 tree ctype, function;
991 enum overload_flags flags;
994 tree fn_name = DECL_NAME (function);
995 int this_quals = TYPE_UNQUALIFIED;
997 if (fn_name == NULL_TREE)
999 error ("name missing for member function");
1000 fn_name = get_identifier ("<anonymous>");
1001 DECL_NAME (function) = fn_name;
1005 this_quals = grok_method_quals (ctype, function, quals);
1007 if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1009 /* Must add the class instance variable up front. */
1010 /* Right now we just make this a pointer. But later
1011 we may wish to make it special. */
1012 tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function)));
1014 tree parm = build_decl (PARM_DECL, this_identifier,
1015 cp_build_qualified_type (type, this_quals | TYPE_QUAL_CONST));
1016 /* Mark the artificial `this' parameter as "artificial". */
1017 SET_DECL_ARTIFICIAL (parm);
1018 DECL_ARG_TYPE (parm) = type;
1019 /* We can make this a register, so long as we don't
1020 accidentally complain if someone tries to take its address. */
1021 DECL_REGISTER (parm) = 1;
1022 TREE_CHAIN (parm) = last_function_parms;
1023 last_function_parms = parm;
1026 DECL_ARGUMENTS (function) = last_function_parms;
1027 DECL_CONTEXT (function) = ctype;
1029 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
1030 maybe_retrofit_in_chrg (function);
1032 if (flags == DTOR_FLAG)
1034 DECL_ASSEMBLER_NAME (function) = build_destructor_name (ctype);
1035 TYPE_HAS_DESTRUCTOR (ctype) = 1;
1038 set_mangled_name_for_decl (function);
1041 /* Work on the expr used by alignof (this is only called by the parser). */
1050 if (processing_template_decl)
1051 return build_min (ALIGNOF_EXPR, sizetype, expr);
1053 if (TREE_CODE (expr) == COMPONENT_REF
1054 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
1055 error ("`__alignof__' applied to a bit-field");
1057 if (TREE_CODE (expr) == INDIRECT_REF)
1059 best = t = TREE_OPERAND (expr, 0);
1060 bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1062 while (TREE_CODE (t) == NOP_EXPR
1063 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
1066 t = TREE_OPERAND (t, 0);
1067 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1068 if (thisalign > bestalign)
1069 best = t, bestalign = thisalign;
1071 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
1074 return c_alignof (TREE_TYPE (expr));
1077 /* Create an ARRAY_REF, checking for the user doing things backwards
1081 grok_array_decl (array_expr, index_exp)
1082 tree array_expr, index_exp;
1084 tree type = TREE_TYPE (array_expr);
1085 tree p1, p2, i1, i2;
1087 if (type == error_mark_node || index_exp == error_mark_node)
1088 return error_mark_node;
1089 if (processing_template_decl)
1090 return build_min (ARRAY_REF, type ? TREE_TYPE (type) : NULL_TREE,
1091 array_expr, index_exp);
1093 if (type == NULL_TREE)
1095 /* Something has gone very wrong. Assume we are mistakenly reducing
1096 an expression instead of a declaration. */
1097 error ("parser may be lost: is there a '{' missing somewhere?");
1101 if (TREE_CODE (type) == OFFSET_TYPE
1102 || TREE_CODE (type) == REFERENCE_TYPE)
1103 type = TREE_TYPE (type);
1105 /* If they have an `operator[]', use that. */
1106 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
1107 return build_opfncall (ARRAY_REF, LOOKUP_NORMAL,
1108 array_expr, index_exp, NULL_TREE);
1110 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1111 is a little-known fact that, if `a' is an array and `i' is an
1112 int, you can write `i[a]', which means the same thing as `a[i]'. */
1114 if (TREE_CODE (type) == ARRAY_TYPE)
1117 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, 0);
1119 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
1122 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, 0);
1124 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr, 0);
1125 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp, 0);
1127 if ((p1 && i2) && (i1 && p2))
1128 error ("ambiguous conversion for array subscript");
1131 array_expr = p1, index_exp = i2;
1133 array_expr = p2, index_exp = i1;
1136 cp_error ("invalid types `%T[%T]' for array subscript",
1137 type, TREE_TYPE (index_exp));
1138 return error_mark_node;
1141 if (array_expr == error_mark_node || index_exp == error_mark_node)
1142 error ("ambiguous conversion for array subscript");
1144 return build_array_ref (array_expr, index_exp);
1147 /* Given the cast expression EXP, checking out its validity. Either return
1148 an error_mark_node if there was an unavoidable error, return a cast to
1149 void for trying to delete a pointer w/ the value 0, or return the
1150 call to delete. If DOING_VEC is 1, we handle things differently
1151 for doing an array delete. If DOING_VEC is 2, they gave us the
1152 array size as an argument to delete.
1153 Implements ARM $5.3.4. This is called from the parser. */
1156 delete_sanity (exp, size, doing_vec, use_global_delete)
1158 int doing_vec, use_global_delete;
1161 /* For a regular vector delete (aka, no size argument) we will pass
1162 this down as a NULL_TREE into build_vec_delete. */
1163 tree maxindex = NULL_TREE;
1165 if (exp == error_mark_node)
1168 if (processing_template_decl)
1170 t = build_min (DELETE_EXPR, void_type_node, exp, size);
1171 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
1172 DELETE_EXPR_USE_VEC (t) = doing_vec;
1176 if (TREE_CODE (exp) == OFFSET_REF)
1177 exp = resolve_offset_ref (exp);
1178 exp = convert_from_reference (exp);
1179 t = stabilize_reference (exp);
1180 t = build_expr_type_conversion (WANT_POINTER, t, 1);
1182 if (t == NULL_TREE || t == error_mark_node)
1184 cp_error ("type `%#T' argument given to `delete', expected pointer",
1186 return error_mark_node;
1191 maxindex = build_binary_op (MINUS_EXPR, size, integer_one_node);
1192 pedwarn ("anachronistic use of array size in vector delete");
1195 type = TREE_TYPE (t);
1197 /* As of Valley Forge, you can delete a pointer to const. */
1199 /* You can't delete functions. */
1200 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
1202 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
1203 return error_mark_node;
1206 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1207 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
1208 cp_warning ("`%T' is not a pointer-to-object type", type);
1210 /* An array can't have been allocated by new, so complain. */
1211 if (TREE_CODE (t) == ADDR_EXPR
1212 && TREE_CODE (TREE_OPERAND (t, 0)) == VAR_DECL
1213 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == ARRAY_TYPE)
1214 cp_warning ("deleting array `%#D'", TREE_OPERAND (t, 0));
1216 /* Deleting a pointer with the value zero is valid and has no effect. */
1217 if (integer_zerop (t))
1218 return build1 (NOP_EXPR, void_type_node, t);
1221 return build_vec_delete (t, maxindex, integer_one_node, use_global_delete);
1224 if (IS_AGGR_TYPE (TREE_TYPE (type))
1225 && TYPE_GETS_REG_DELETE (TREE_TYPE (type)))
1227 /* Only do access checking here; we'll be calling op delete
1228 from the destructor. */
1229 tree tmp = build_op_delete_call (DELETE_EXPR, t, size_zero_node,
1230 LOOKUP_NORMAL, NULL_TREE);
1231 if (tmp == error_mark_node)
1232 return error_mark_node;
1235 return build_delete (type, t, integer_three_node,
1236 LOOKUP_NORMAL, use_global_delete);
1240 /* Report an error if the indicated template declaration is not the
1241 sort of thing that should be a member template. */
1244 check_member_template (tmpl)
1249 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
1250 decl = DECL_TEMPLATE_RESULT (tmpl);
1252 if (TREE_CODE (decl) == FUNCTION_DECL
1253 || (TREE_CODE (decl) == TYPE_DECL
1254 && IS_AGGR_TYPE (TREE_TYPE (decl))))
1256 if (current_function_decl)
1257 /* 14.5.2.2 [temp.mem]
1259 A local class shall not have member templates. */
1260 cp_error ("invalid declaration of member template `%#D' in local class",
1263 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
1265 /* 14.5.2.3 [temp.mem]
1267 A member function template shall not be virtual. */
1269 ("invalid use of `virtual' in template declaration of `%#D'",
1271 DECL_VIRTUAL_P (decl) = 0;
1274 /* The debug-information generating code doesn't know what to do
1275 with member templates. */
1276 DECL_IGNORED_P (tmpl) = 1;
1279 cp_error ("template declaration of `%#D'", decl);
1282 /* Return true iff TYPE is a valid Java parameter or return type. */
1285 acceptable_java_type (type)
1288 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
1290 if (TREE_CODE (type) == POINTER_TYPE)
1292 type = TREE_TYPE (type);
1293 if (TREE_CODE (type) == RECORD_TYPE)
1296 if (! TYPE_FOR_JAVA (type))
1298 if (! CLASSTYPE_TEMPLATE_INFO (type))
1300 args = CLASSTYPE_TI_ARGS (type);
1301 i = TREE_VEC_LENGTH (args);
1304 type = TREE_VEC_ELT (args, i);
1305 if (TREE_CODE (type) == POINTER_TYPE)
1306 type = TREE_TYPE (type);
1307 if (! TYPE_FOR_JAVA (type))
1316 /* For a METHOD in a Java class CTYPE, return 1 if
1317 the parameter and return types are valid Java types.
1318 Otherwise, print appropriate error messages, and return 0. */
1321 check_java_method (method)
1325 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
1326 tree ret_type = TREE_TYPE (TREE_TYPE (method));
1327 if (! acceptable_java_type (ret_type))
1329 cp_error ("Java method '%D' has non-Java return type `%T'",
1333 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
1335 tree type = TREE_VALUE (arg_types);
1336 if (! acceptable_java_type (type))
1338 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1343 return jerr ? 0 : 1;
1346 /* Sanity check: report error if this function FUNCTION is not
1347 really a member of the class (CTYPE) it is supposed to belong to.
1348 CNAME is the same here as it is for grokclassfn above. */
1351 check_classfn (ctype, function)
1352 tree ctype, function;
1354 tree fn_name = DECL_NAME (function);
1355 tree fndecl, fndecls;
1356 tree method_vec = CLASSTYPE_METHOD_VEC (complete_type (ctype));
1360 if (DECL_USE_TEMPLATE (function)
1361 && !(TREE_CODE (function) == TEMPLATE_DECL
1362 && DECL_TEMPLATE_SPECIALIZATION (function))
1363 && is_member_template (DECL_TI_TEMPLATE (function)))
1364 /* Since this is a specialization of a member template,
1365 we're not going to find the declaration in the class.
1368 struct S { template <typename T> void f(T); };
1369 template <> void S::f(int);
1371 we're not going to find `S::f(int)', but there's no
1372 reason we should, either. We let our callers know we didn't
1373 find the method, but we don't complain. */
1376 if (method_vec != 0)
1378 methods = &TREE_VEC_ELT (method_vec, 0);
1379 end = TREE_VEC_END (method_vec);
1381 /* First suss out ctors and dtors. */
1382 if (*methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1383 && DECL_CONSTRUCTOR_P (function))
1385 if (*++methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1386 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function)))
1389 while (++methods != end && *methods)
1392 if (fn_name == DECL_NAME (OVL_CURRENT (*methods)))
1395 for (fndecls = *methods; fndecls != NULL_TREE;
1396 fndecls = OVL_NEXT (fndecls))
1398 fndecl = OVL_CURRENT (fndecls);
1399 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1400 for a for member function of a template class, is
1401 not mangled, so the check below does not work
1402 correctly in that case. Since mangled destructor
1403 names do not include the type of the arguments,
1404 we can't use this short-cut for them, either.
1405 (It's not legal to declare arguments for a
1406 destructor, but some people try.) */
1407 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function))
1408 && (DECL_ASSEMBLER_NAME (function)
1409 != DECL_NAME (function))
1410 && (DECL_ASSEMBLER_NAME (fndecl)
1411 != DECL_NAME (fndecl))
1412 && (DECL_ASSEMBLER_NAME (function)
1413 == DECL_ASSEMBLER_NAME (fndecl)))
1416 /* We cannot simply call decls_match because this
1417 doesn't work for static member functions that are
1418 pretending to be methods, and because the name
1419 may have been changed by asm("new_name"). */
1420 if (DECL_NAME (function) == DECL_NAME (fndecl))
1422 tree p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
1423 tree p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1425 /* Get rid of the this parameter on functions that become
1427 if (DECL_STATIC_FUNCTION_P (fndecl)
1428 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1429 p1 = TREE_CHAIN (p1);
1431 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
1432 TREE_TYPE (TREE_TYPE (fndecl)))
1433 && compparms (p1, p2)
1434 && (DECL_TEMPLATE_SPECIALIZATION (function)
1435 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
1436 && (!DECL_TEMPLATE_SPECIALIZATION (function)
1437 || (DECL_TI_TEMPLATE (function)
1438 == DECL_TI_TEMPLATE (fndecl))))
1447 if (methods != end && *methods)
1449 tree fndecl = *methods;
1450 cp_error ("prototype for `%#D' does not match any in class `%T'",
1452 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl) ? "s are" : " is",
1453 OVL_CURRENT (fndecl));
1454 while (fndecl = OVL_NEXT (fndecl), fndecl)
1455 cp_error_at (" %#D", OVL_CURRENT(fndecl));
1460 if (TYPE_SIZE (ctype) == 0)
1461 incomplete_type_error (function, ctype);
1463 cp_error ("no `%#D' member function declared in class `%T'",
1467 /* If we did not find the method in the class, add it to avoid
1468 spurious errors (unless the CTYPE is not yet defined, in which
1469 case we'll only confuse ourselves when the function is declared
1470 properly within the class. */
1471 if (TYPE_SIZE (ctype))
1472 add_method (ctype, methods, function);
1476 /* We have just processed the DECL, which is a static data member.
1477 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1478 present, is the assembly-language name for the data member.
1479 FLAGS is as for cp_finish_decl. */
1482 finish_static_data_member_decl (decl, init, asmspec_tree, flags)
1488 const char *asmspec = 0;
1491 asmspec = TREE_STRING_POINTER (asmspec_tree);
1493 my_friendly_assert (TREE_PUBLIC (decl), 0);
1495 /* We cannot call pushdecl here, because that would fill in the
1496 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1497 the right thing, namely, to put this decl out straight away. */
1498 /* current_class_type can be NULL_TREE in case of error. */
1499 if (!asmspec && current_class_type)
1501 DECL_INITIAL (decl) = error_mark_node;
1502 DECL_ASSEMBLER_NAME (decl)
1503 = build_static_name (current_class_type, DECL_NAME (decl));
1505 if (! processing_template_decl)
1507 if (!pending_statics)
1508 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
1509 VARRAY_PUSH_TREE (pending_statics, decl);
1512 /* Static consts need not be initialized in the class definition. */
1513 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
1515 static int explanation = 0;
1517 error ("initializer invalid for static member with constructor");
1518 if (explanation++ == 0)
1519 error ("(you really want to initialize it separately)");
1522 /* Force the compiler to know when an uninitialized static const
1523 member is being used. */
1524 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
1525 TREE_USED (decl) = 1;
1526 DECL_INITIAL (decl) = init;
1527 DECL_IN_AGGR_P (decl) = 1;
1528 DECL_CONTEXT (decl) = current_class_type;
1530 cp_finish_decl (decl, init, asmspec_tree, flags);
1533 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1534 of a structure component, returning a FIELD_DECL node.
1535 QUALS is a list of type qualifiers for this decl (such as for declaring
1536 const member functions).
1538 This is done during the parsing of the struct declaration.
1539 The FIELD_DECL nodes are chained together and the lot of them
1540 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1544 If class A defines that certain functions in class B are friends, then
1545 the way I have set things up, it is B who is interested in permission
1546 granted by A. However, it is in A's context that these declarations
1547 are parsed. By returning a void_type_node, class A does not attempt
1548 to incorporate the declarations of the friends within its structure.
1550 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1551 CHANGES TO CODE IN `start_method'. */
1554 grokfield (declarator, declspecs, init, asmspec_tree, attrlist)
1555 tree declarator, declspecs, init, asmspec_tree, attrlist;
1557 register tree value;
1558 const char *asmspec = 0;
1559 int flags = LOOKUP_ONLYCONVERTING;
1561 /* Convert () initializers to = initializers. */
1562 if (init == NULL_TREE && declarator != NULL_TREE
1563 && TREE_CODE (declarator) == CALL_EXPR
1564 && TREE_OPERAND (declarator, 0)
1565 && (TREE_CODE (TREE_OPERAND (declarator, 0)) == IDENTIFIER_NODE
1566 || TREE_CODE (TREE_OPERAND (declarator, 0)) == SCOPE_REF)
1567 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator)))
1569 init = TREE_OPERAND (declarator, 1);
1570 declarator = TREE_OPERAND (declarator, 0);
1574 if (declspecs == NULL_TREE
1575 && TREE_CODE (declarator) == SCOPE_REF
1576 && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
1578 /* Access declaration */
1579 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
1581 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
1582 pop_nested_class ();
1583 return do_class_using_decl (declarator);
1587 && TREE_CODE (init) == TREE_LIST
1588 && TREE_VALUE (init) == error_mark_node
1589 && TREE_CHAIN (init) == NULL_TREE)
1592 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, attrlist);
1593 if (! value || value == error_mark_node)
1594 /* friend or constructor went bad. */
1597 /* Pass friendly classes back. */
1598 if (TREE_CODE (value) == VOID_TYPE)
1599 return void_type_node;
1601 if (DECL_NAME (value) != NULL_TREE
1602 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
1603 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
1604 cp_error ("member `%D' conflicts with virtual function table field name",
1607 /* Stash away type declarations. */
1608 if (TREE_CODE (value) == TYPE_DECL)
1610 DECL_NONLOCAL (value) = 1;
1611 DECL_CONTEXT (value) = current_class_type;
1613 /* Now that we've updated the context, we need to remangle the
1614 name for this TYPE_DECL. */
1615 DECL_ASSEMBLER_NAME (value) = DECL_NAME (value);
1616 if (!uses_template_parms (value))
1617 DECL_ASSEMBLER_NAME (value) =
1618 get_identifier (build_overload_name (TREE_TYPE (value), 1, 1));
1620 if (processing_template_decl)
1621 value = push_template_decl (value);
1626 if (DECL_IN_AGGR_P (value))
1628 cp_error ("`%D' is already defined in `%T'", value,
1629 DECL_CONTEXT (value));
1630 return void_type_node;
1634 asmspec = TREE_STRING_POINTER (asmspec_tree);
1638 if (TREE_CODE (value) == FUNCTION_DECL)
1640 grok_function_init (value, init);
1643 else if (pedantic && TREE_CODE (value) != VAR_DECL)
1644 /* Already complained in grokdeclarator. */
1648 /* We allow initializers to become parameters to base
1650 if (TREE_CODE (init) == TREE_LIST)
1652 if (TREE_CHAIN (init) == NULL_TREE)
1653 init = TREE_VALUE (init);
1655 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1658 if (TREE_CODE (init) == CONST_DECL)
1659 init = DECL_INITIAL (init);
1660 else if (TREE_READONLY_DECL_P (init))
1661 init = decl_constant_value (init);
1662 else if (TREE_CODE (init) == CONSTRUCTOR)
1663 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1664 if (init == error_mark_node)
1665 /* We must make this look different than `error_mark_node'
1666 because `decl_const_value' would mis-interpret it
1667 as only meaning that this VAR_DECL is defined. */
1668 init = build1 (NOP_EXPR, TREE_TYPE (value), init);
1669 else if (processing_template_decl)
1671 else if (! TREE_CONSTANT (init))
1673 /* We can allow references to things that are effectively
1674 static, since references are initialized with the address. */
1675 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
1676 || (TREE_STATIC (init) == 0
1677 && (TREE_CODE_CLASS (TREE_CODE (init)) != 'd'
1678 || DECL_EXTERNAL (init) == 0)))
1680 error ("field initializer is not constant");
1681 init = error_mark_node;
1687 if (processing_template_decl && ! current_function_decl
1688 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
1689 value = push_template_decl (value);
1692 cplus_decl_attributes (value, TREE_PURPOSE (attrlist),
1693 TREE_VALUE (attrlist));
1695 if (TREE_CODE (value) == VAR_DECL)
1697 finish_static_data_member_decl (value, init, asmspec_tree,
1701 if (TREE_CODE (value) == FIELD_DECL)
1705 /* This must override the asm specifier which was placed
1706 by grokclassfn. Lay this out fresh. */
1707 DECL_RTL (value) = NULL_RTX;
1708 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1710 if (DECL_INITIAL (value) == error_mark_node)
1711 init = error_mark_node;
1712 cp_finish_decl (value, init, asmspec_tree, flags);
1713 DECL_INITIAL (value) = init;
1714 DECL_IN_AGGR_P (value) = 1;
1717 if (TREE_CODE (value) == FUNCTION_DECL)
1721 /* This must override the asm specifier which was placed
1722 by grokclassfn. Lay this out fresh. */
1723 DECL_RTL (value) = NULL_RTX;
1724 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1726 cp_finish_decl (value, init, asmspec_tree, flags);
1728 /* Pass friends back this way. */
1729 if (DECL_FRIEND_P (value))
1730 return void_type_node;
1732 DECL_IN_AGGR_P (value) = 1;
1735 my_friendly_abort (21);
1740 /* Like `grokfield', but for bitfields.
1741 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1744 grokbitfield (declarator, declspecs, width)
1745 tree declarator, declspecs, width;
1747 register tree value = grokdeclarator (declarator, declspecs, BITFIELD,
1750 if (! value) return NULL_TREE; /* friends went bad. */
1752 /* Pass friendly classes back. */
1753 if (TREE_CODE (value) == VOID_TYPE)
1754 return void_type_node;
1756 if (TREE_CODE (value) == TYPE_DECL)
1758 cp_error ("cannot declare `%D' to be a bitfield type", value);
1762 /* Usually, finish_struct_1 catches bitifields with invalid types.
1763 But, in the case of bitfields with function type, we confuse
1764 ourselves into thinking they are member functions, so we must
1766 if (TREE_CODE (value) == FUNCTION_DECL)
1768 cp_error ("cannot declare bitfield `%D' with funcion type",
1773 if (DECL_IN_AGGR_P (value))
1775 cp_error ("`%D' is already defined in the class %T", value,
1776 DECL_CONTEXT (value));
1777 return void_type_node;
1780 GNU_xref_member (current_class_name, value);
1782 if (TREE_STATIC (value))
1784 cp_error ("static member `%D' cannot be a bitfield", value);
1787 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1789 if (width != error_mark_node)
1791 constant_expression_warning (width);
1792 DECL_INITIAL (value) = width;
1793 SET_DECL_C_BIT_FIELD (value);
1796 DECL_IN_AGGR_P (value) = 1;
1801 grokoptypename (declspecs, declarator)
1802 tree declspecs, declarator;
1804 tree t = grokdeclarator (declarator, declspecs, TYPENAME, 0, NULL_TREE);
1805 return build_typename_overload (t);
1808 /* When a function is declared with an initializer,
1809 do the right thing. Currently, there are two possibilities:
1814 // initialization possibility #1.
1815 virtual void f () = 0;
1837 // initialization possibility #2
1844 copy_assignment_arg_p (parmtype, virtualp)
1846 int virtualp ATTRIBUTE_UNUSED;
1848 if (current_class_type == NULL_TREE)
1851 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
1852 parmtype = TREE_TYPE (parmtype);
1854 if ((TYPE_MAIN_VARIANT (parmtype) == current_class_type)
1856 /* Non-standard hack to support old Booch components. */
1857 || (! virtualp && DERIVED_FROM_P (parmtype, current_class_type))
1866 grok_function_init (decl, init)
1870 /* An initializer for a function tells how this function should
1872 tree type = TREE_TYPE (decl);
1874 if (TREE_CODE (type) == FUNCTION_TYPE)
1875 cp_error ("initializer specified for non-member function `%D'", decl);
1877 /* We'll check for this in finish_struct_1. */
1878 else if (DECL_VINDEX (decl) == NULL_TREE)
1879 cp_error ("initializer specified for non-virtual member function `%D'", decl);
1881 else if (integer_zerop (init))
1884 /* Mark this function as being "defined". */
1885 DECL_INITIAL (decl) = error_mark_node;
1886 /* pure virtual destructors must be defined. */
1887 /* pure virtual needs to be defined (as abort) only when put in
1888 vtbl. For wellformed call, it should be itself. pr4737 */
1889 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl)))
1891 /* Give this node rtl from `abort'. */
1892 DECL_RTL (decl) = DECL_RTL (abort_fndecl);
1895 DECL_PURE_VIRTUAL_P (decl) = 1;
1896 if (DECL_NAME (decl) == ansi_opname [(int) MODIFY_EXPR])
1899 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl))));
1901 if (copy_assignment_arg_p (parmtype, 1))
1902 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type) = 1;
1906 cp_error ("invalid initializer for virtual method `%D'", decl);
1910 cplus_decl_attributes (decl, attributes, prefix_attributes)
1911 tree decl, attributes, prefix_attributes;
1913 if (decl == NULL_TREE || decl == void_type_node)
1916 if (TREE_CODE (decl) == TEMPLATE_DECL)
1917 decl = DECL_TEMPLATE_RESULT (decl);
1919 decl_attributes (decl, attributes, prefix_attributes);
1921 if (TREE_CODE (decl) == TYPE_DECL)
1922 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl), TREE_TYPE (decl));
1925 /* CONSTRUCTOR_NAME:
1926 Return the name for the constructor (or destructor) for the
1927 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1928 IDENTIFIER_NODE. When given a template, this routine doesn't
1929 lose the specialization. */
1932 constructor_name_full (thing)
1935 if (TREE_CODE (thing) == TEMPLATE_TYPE_PARM
1936 || TREE_CODE (thing) == TEMPLATE_TEMPLATE_PARM
1937 || TREE_CODE (thing) == TYPENAME_TYPE)
1938 thing = TYPE_NAME (thing);
1939 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing)))
1941 if (TYPE_WAS_ANONYMOUS (thing) && TYPE_HAS_CONSTRUCTOR (thing))
1942 thing = DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing), 0)));
1944 thing = TYPE_NAME (thing);
1946 if (TREE_CODE (thing) == TYPE_DECL
1947 || (TREE_CODE (thing) == TEMPLATE_DECL
1948 && TREE_CODE (DECL_TEMPLATE_RESULT (thing)) == TYPE_DECL))
1949 thing = DECL_NAME (thing);
1950 my_friendly_assert (TREE_CODE (thing) == IDENTIFIER_NODE, 197);
1954 /* CONSTRUCTOR_NAME:
1955 Return the name for the constructor (or destructor) for the
1956 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1957 IDENTIFIER_NODE. When given a template, return the plain
1958 unspecialized name. */
1961 constructor_name (thing)
1965 thing = constructor_name_full (thing);
1966 t = IDENTIFIER_TEMPLATE (thing);
1972 /* Record the existence of an addressable inline function. */
1975 mark_inline_for_output (decl)
1978 decl = DECL_MAIN_VARIANT (decl);
1979 if (DECL_SAVED_INLINE (decl))
1981 DECL_SAVED_INLINE (decl) = 1;
1983 VARRAY_TREE_INIT (saved_inlines, 32, "saved_inlines");
1985 VARRAY_PUSH_TREE (saved_inlines, decl);
1988 /* Hand off a unique name which can be used for variable we don't really
1989 want to know about anyway, for example, the anonymous variables which
1990 are needed to make references work. Declare this thing so we can use it.
1991 The variable created will be of type TYPE.
1993 STATICP is nonzero if this variable should be static. */
1996 get_temp_name (type, staticp)
2000 char buf[sizeof (AUTO_TEMP_FORMAT) + 20];
2002 int toplev = toplevel_bindings_p ();
2004 if (toplev || staticp)
2006 sprintf (buf, AUTO_TEMP_FORMAT, global_temp_name_counter++);
2007 decl = pushdecl_top_level (build_decl (VAR_DECL, get_identifier (buf), type));
2011 sprintf (buf, AUTO_TEMP_FORMAT, temp_name_counter++);
2012 decl = pushdecl (build_decl (VAR_DECL, get_identifier (buf), type));
2014 TREE_USED (decl) = 1;
2015 TREE_STATIC (decl) = staticp;
2016 DECL_ARTIFICIAL (decl) = 1;
2018 /* If this is a local variable, then lay out its rtl now.
2019 Otherwise, callers of this function are responsible for dealing
2020 with this variable's rtl. */
2024 my_friendly_assert (DECL_INITIAL (decl) == NULL_TREE,
2031 /* Hunts through the global anonymous union ANON_DECL, building
2032 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2033 returns a VAR_DECL whose size is the same as the size of the
2034 ANON_DECL, if one is available. */
2037 build_anon_union_vars (anon_decl, elems, static_p, external_p)
2043 tree type = TREE_TYPE (anon_decl);
2044 tree main_decl = NULL_TREE;
2047 /* Rather than write the code to handle the non-union case,
2048 just give an error. */
2049 if (TREE_CODE (type) != UNION_TYPE)
2050 error ("anonymous struct not inside named type");
2052 for (field = TYPE_FIELDS (type);
2054 field = TREE_CHAIN (field))
2058 if (DECL_ARTIFICIAL (field))
2060 if (TREE_CODE (field) != FIELD_DECL)
2062 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2067 if (TREE_PRIVATE (field))
2068 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
2069 else if (TREE_PROTECTED (field))
2070 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
2072 if (DECL_NAME (field) == NULL_TREE
2073 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2075 decl = build_anon_union_vars (field, elems, static_p, external_p);
2079 else if (DECL_NAME (field) == NULL_TREE)
2083 decl = build_decl (VAR_DECL, DECL_NAME (field), TREE_TYPE (field));
2084 /* tell `pushdecl' that this is not tentative. */
2085 DECL_INITIAL (decl) = error_mark_node;
2086 TREE_PUBLIC (decl) = 0;
2087 TREE_STATIC (decl) = static_p;
2088 DECL_EXTERNAL (decl) = external_p;
2089 decl = pushdecl (decl);
2090 DECL_INITIAL (decl) = NULL_TREE;
2093 /* Only write out one anon union element--choose the one that
2094 can hold them all. */
2095 if (main_decl == NULL_TREE
2096 && simple_cst_equal (DECL_SIZE (decl),
2097 DECL_SIZE (anon_decl)) == 1)
2100 /* ??? This causes there to be no debug info written out
2102 TREE_ASM_WRITTEN (decl) = 1;
2104 if (DECL_NAME (field) == NULL_TREE
2105 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2106 /* The remainder of the processing was already done in the
2110 /* If there's a cleanup to do, it belongs in the
2111 TREE_PURPOSE of the following TREE_LIST. */
2112 *elems = tree_cons (NULL_TREE, decl, *elems);
2113 TREE_TYPE (*elems) = type;
2119 /* Finish off the processing of a UNION_TYPE structure.
2120 If there are static members, then all members are
2121 static, and must be laid out together. If the
2122 union is an anonymous union, we arrange for that
2123 as well. PUBLIC_P is nonzero if this union is
2124 not declared static. */
2127 finish_anon_union (anon_union_decl)
2128 tree anon_union_decl;
2130 tree type = TREE_TYPE (anon_union_decl);
2132 int public_p = TREE_PUBLIC (anon_union_decl);
2133 int static_p = TREE_STATIC (anon_union_decl);
2134 int external_p = DECL_EXTERNAL (anon_union_decl);
2136 if (TYPE_FIELDS (type) == NULL_TREE)
2141 error ("global anonymous unions must be declared static");
2145 main_decl = build_anon_union_vars (anon_union_decl,
2146 &DECL_ANON_UNION_ELEMS (anon_union_decl),
2147 static_p, external_p);
2149 if (main_decl == NULL_TREE)
2151 warning ("anonymous union with no members");
2157 make_decl_rtl (main_decl, 0, toplevel_bindings_p ());
2158 DECL_RTL (anon_union_decl) = DECL_RTL (main_decl);
2159 expand_anon_union_decl (anon_union_decl,
2161 DECL_ANON_UNION_ELEMS (anon_union_decl));
2164 add_decl_stmt (anon_union_decl);
2167 /* Finish processing a builtin type TYPE. It's name is NAME,
2168 its fields are in the array FIELDS. LEN is the number of elements
2169 in FIELDS minus one, or put another way, it is the maximum subscript
2172 It is given the same alignment as ALIGN_TYPE. */
2175 finish_builtin_type (type, name, fields, len, align_type)
2184 TYPE_FIELDS (type) = fields[0];
2185 for (i = 0; i < len; i++)
2187 layout_type (TREE_TYPE (fields[i]));
2188 DECL_FIELD_CONTEXT (fields[i]) = type;
2189 TREE_CHAIN (fields[i]) = fields[i+1];
2191 DECL_FIELD_CONTEXT (fields[i]) = type;
2192 TYPE_ALIGN (type) = TYPE_ALIGN (align_type);
2194 #if 0 /* not yet, should get fixed properly later */
2195 TYPE_NAME (type) = make_type_decl (get_identifier (name), type);
2197 TYPE_NAME (type) = build_decl (TYPE_DECL, get_identifier (name), type);
2199 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2200 layout_decl (TYPE_NAME (type), 0);
2203 /* Auxiliary functions to make type signatures for
2204 `operator new' and `operator delete' correspond to
2205 what compiler will be expecting. */
2208 coerce_new_type (type)
2213 if (TREE_CODE (type) == METHOD_TYPE)
2214 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (TYPE_ARG_TYPES (type)));
2215 if (! same_type_p (TREE_TYPE (type), ptr_type_node))
2216 e1 = 1, error ("`operator new' must return type `void *'");
2218 /* Technically the type must be `size_t', but we may not know
2220 if (TYPE_ARG_TYPES (type) == NULL_TREE)
2221 e1 = 1, error ("`operator new' takes type `size_t' parameter");
2222 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type)), sizetype))
2223 e2 = 1, error ("`operator new' takes type `size_t' as first parameter");
2225 type = build_function_type (ptr_type_node, tree_cons (NULL_TREE, sizetype, TREE_CHAIN (TYPE_ARG_TYPES (type))));
2227 type = build_function_type (ptr_type_node, TYPE_ARG_TYPES (type));
2232 coerce_delete_type (type)
2239 tree arg_types = TYPE_ARG_TYPES (type);
2241 if (TREE_CODE (type) == METHOD_TYPE)
2243 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (arg_types));
2244 arg_types = TREE_CHAIN (arg_types);
2247 if (TREE_TYPE (type) != void_type_node)
2248 e1 = 1, error ("`operator delete' must return type `void'");
2250 if (arg_types == NULL_TREE
2251 || ! same_type_p (TREE_VALUE (arg_types), ptr_type_node))
2252 e2 = 1, error ("`operator delete' takes type `void *' as first parameter");
2256 && TREE_CHAIN (arg_types)
2257 && TREE_CHAIN (arg_types) != void_list_node)
2259 /* Again, technically this argument must be `size_t', but again
2260 we may not know what that is. */
2261 tree t2 = TREE_VALUE (TREE_CHAIN (arg_types));
2262 if (! same_type_p (t2, sizetype))
2263 e3 = 1, error ("second argument to `operator delete' must be of type `size_t'");
2264 else if (TREE_CHAIN (TREE_CHAIN (arg_types)) != void_list_node)
2267 if (TREE_CHAIN (TREE_CHAIN (arg_types)))
2268 error ("too many arguments in declaration of `operator delete'");
2270 error ("`...' invalid in specification of `operator delete'");
2275 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2276 build_tree_list (NULL_TREE, sizetype));
2279 if (arg_types == NULL_TREE)
2280 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
2282 arg_types = tree_cons (NULL_TREE, ptr_type_node, TREE_CHAIN (arg_types));
2288 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2289 arg_types ? TREE_CHAIN (arg_types): NULL_TREE);
2291 type = build_function_type (void_type_node, arg_types);
2297 mark_vtable_entries (decl)
2300 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
2302 for (; entries; entries = TREE_CHAIN (entries))
2307 fnaddr = (flag_vtable_thunks ? TREE_VALUE (entries)
2308 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries)));
2310 if (TREE_CODE (fnaddr) != ADDR_EXPR)
2311 /* This entry is an offset: a virtual base class offset, a
2312 virtual call offset, and RTTI offset, etc. */
2315 fn = TREE_OPERAND (fnaddr, 0);
2316 TREE_ADDRESSABLE (fn) = 1;
2317 if (TREE_CODE (fn) == THUNK_DECL && DECL_EXTERNAL (fn))
2319 DECL_EXTERNAL (fn) = 0;
2326 /* Set DECL up to have the closest approximation of "initialized common"
2327 linkage available. */
2330 comdat_linkage (decl)
2334 make_decl_one_only (decl);
2335 else if (TREE_CODE (decl) == FUNCTION_DECL || DECL_VIRTUAL_P (decl))
2336 /* We can just emit functions and vtables statically; it doesn't really
2337 matter if we have multiple copies. */
2338 TREE_PUBLIC (decl) = 0;
2341 /* Static data member template instantiations, however, cannot
2342 have multiple copies. */
2343 if (DECL_INITIAL (decl) == 0
2344 || DECL_INITIAL (decl) == error_mark_node)
2345 DECL_COMMON (decl) = 1;
2346 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
2348 DECL_COMMON (decl) = 1;
2349 DECL_INITIAL (decl) = error_mark_node;
2353 /* We can't do anything useful; leave vars for explicit
2355 DECL_EXTERNAL (decl) = 1;
2356 DECL_NOT_REALLY_EXTERN (decl) = 0;
2360 if (DECL_LANG_SPECIFIC (decl))
2361 DECL_COMDAT (decl) = 1;
2364 /* For win32 we also want to put explicit instantiations in
2365 linkonce sections, so that they will be merged with implicit
2366 instantiations; otherwise we get duplicate symbol errors. */
2369 maybe_make_one_only (decl)
2372 /* We used to say that this was not necessary on targets that support weak
2373 symbols, because the implicit instantiations will defer to the explicit
2374 one. However, that's not actually the case in SVR4; a strong definition
2375 after a weak one is an error. Also, not making explicit
2376 instantiations one_only means that we can end up with two copies of
2377 some template instantiations. */
2378 if (! supports_one_only ())
2381 /* We can't set DECL_COMDAT on functions, or finish_file will think
2382 we can get away with not emitting them if they aren't used. We need
2383 to for variables so that cp_finish_decl will update their linkage,
2384 because their DECL_INITIAL may not have been set properly yet. */
2386 make_decl_one_only (decl);
2388 if (TREE_CODE (decl) == VAR_DECL && DECL_LANG_SPECIFIC (decl))
2389 DECL_COMDAT (decl) = 1;
2392 /* Returns the virtual function with which the vtable for TYPE is
2393 emitted, or NULL_TREE if that heuristic is not applicable to TYPE. */
2401 if (TYPE_FOR_JAVA (type)
2402 || CLASSTYPE_INTERFACE_KNOWN (type))
2405 for (method = TYPE_METHODS (type); method != NULL_TREE;
2406 method = TREE_CHAIN (method))
2407 if (DECL_VINDEX (method) != NULL_TREE
2408 && ! DECL_THIS_INLINE (method)
2409 && ! DECL_PURE_VIRTUAL_P (method))
2415 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2416 based on TYPE and other static flags.
2418 Note that anything public is tagged TREE_PUBLIC, whether
2419 it's public in this file or in another one. */
2422 import_export_vtable (decl, type, final)
2426 if (DECL_INTERFACE_KNOWN (decl))
2429 if (TYPE_FOR_JAVA (type))
2431 TREE_PUBLIC (decl) = 1;
2432 DECL_EXTERNAL (decl) = 1;
2433 DECL_INTERFACE_KNOWN (decl) = 1;
2435 else if (CLASSTYPE_INTERFACE_KNOWN (type))
2437 TREE_PUBLIC (decl) = 1;
2438 DECL_EXTERNAL (decl) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type);
2439 DECL_INTERFACE_KNOWN (decl) = 1;
2443 /* We can only wait to decide if we have real non-inline virtual
2444 functions in our class, or if we come from a template. */
2446 int found = (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
2447 || key_method (type));
2449 if (final || ! found)
2451 comdat_linkage (decl);
2452 DECL_EXTERNAL (decl) = 0;
2456 TREE_PUBLIC (decl) = 1;
2457 DECL_EXTERNAL (decl) = 1;
2462 /* Determine whether or not we want to specifically import or export CTYPE,
2463 using various heuristics. */
2466 import_export_class (ctype)
2469 /* -1 for imported, 1 for exported. */
2470 int import_export = 0;
2472 /* It only makes sense to call this function at EOF. The reason is
2473 that this function looks at whether or not the first non-inline
2474 non-abstract virtual member function has been defined in this
2475 translation unit. But, we can't possibly know that until we've
2476 seen the entire translation unit. */
2477 my_friendly_assert (at_eof, 20000226);
2479 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
2482 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2483 we will have CLASSTYPE_INTERFACE_ONLY set but not
2484 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2485 heuristic because someone will supply a #pragma implementation
2486 elsewhere, and deducing it here would produce a conflict. */
2487 if (CLASSTYPE_INTERFACE_ONLY (ctype))
2490 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2491 /* FIXME this should really use some sort of target-independent macro. */
2492 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
2494 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
2498 /* If we got -fno-implicit-templates, we import template classes that
2499 weren't explicitly instantiated. */
2500 if (import_export == 0
2501 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
2502 && ! flag_implicit_templates)
2505 /* Base our import/export status on that of the first non-inline,
2506 non-pure virtual function, if any. */
2507 if (import_export == 0
2508 && TYPE_POLYMORPHIC_P (ctype)
2509 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
2511 tree method = key_method (ctype);
2513 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
2516 #ifdef MULTIPLE_SYMBOL_SPACES
2517 if (import_export == -1)
2523 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
2524 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype) = (import_export > 0);
2525 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
2529 /* We need to describe to the assembler the relationship between
2530 a vtable and the vtable of the parent class. */
2533 output_vtable_inherit (vars)
2539 op[0] = XEXP (DECL_RTL (vars), 0); /* strip the mem ref */
2541 parent = binfo_for_vtable (vars);
2543 if (parent == TYPE_BINFO (DECL_CONTEXT (vars)))
2547 parent = TYPE_BINFO_VTABLE (BINFO_TYPE (parent));
2548 op[1] = XEXP (DECL_RTL (parent), 0); /* strip the mem ref */
2551 my_friendly_abort (980826);
2553 output_asm_insn (".vtable_inherit %c0, %c1", op);
2557 finish_vtable_vardecl (t, data)
2559 void *data ATTRIBUTE_UNUSED;
2562 tree ctype = DECL_CONTEXT (vars);
2563 import_export_class (ctype);
2564 import_export_vtable (vars, ctype, 1);
2566 if (! DECL_EXTERNAL (vars)
2567 && DECL_NEEDED_P (vars)
2568 && ! TREE_ASM_WRITTEN (vars))
2570 if (TREE_TYPE (vars) == void_type_node)
2571 /* It is a dummy vtable made by get_vtable_decl. Ignore it. */
2575 mark_vtable_entries (vars);
2576 if (TREE_TYPE (DECL_INITIAL (vars)) == 0)
2577 store_init_value (vars, DECL_INITIAL (vars));
2579 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
2581 /* Mark the VAR_DECL node representing the vtable itself as a
2582 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2583 It is rather important that such things be ignored because
2584 any effort to actually generate DWARF for them will run
2585 into trouble when/if we encounter code like:
2588 struct S { virtual void member (); };
2590 because the artificial declaration of the vtable itself (as
2591 manufactured by the g++ front end) will say that the vtable
2592 is a static member of `S' but only *after* the debug output
2593 for the definition of `S' has already been output. This causes
2594 grief because the DWARF entry for the definition of the vtable
2595 will try to refer back to an earlier *declaration* of the
2596 vtable as a static member of `S' and there won't be one.
2597 We might be able to arrange to have the "vtable static member"
2598 attached to the member list for `S' before the debug info for
2599 `S' get written (which would solve the problem) but that would
2600 require more intrusive changes to the g++ front end. */
2602 DECL_IGNORED_P (vars) = 1;
2605 /* Always make vtables weak. */
2607 comdat_linkage (vars);
2609 rest_of_decl_compilation (vars, NULL_PTR, 1, 1);
2612 output_vtable_inherit (vars);
2614 /* Because we're only doing syntax-checking, we'll never end up
2615 actually marking the variable as written. */
2616 if (flag_syntax_only)
2617 TREE_ASM_WRITTEN (vars) = 1;
2619 /* Since we're writing out the vtable here, also write the debug
2621 note_debug_info_needed (ctype);
2626 /* If the references to this class' vtables were optimized away, still
2627 emit the appropriate debugging information. See dfs_debug_mark. */
2628 if (DECL_COMDAT (vars)
2629 && CLASSTYPE_DEBUG_REQUESTED (ctype))
2630 note_debug_info_needed (ctype);
2636 prune_vtable_vardecl (t, data)
2638 void *data ATTRIBUTE_UNUSED;
2640 *t = TREE_CHAIN (*t);
2644 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2645 inline function or template instantiation at end-of-file. */
2648 import_export_decl (decl)
2651 if (DECL_INTERFACE_KNOWN (decl))
2654 if (DECL_TEMPLATE_INSTANTIATION (decl)
2655 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2657 DECL_NOT_REALLY_EXTERN (decl) = 1;
2658 if ((DECL_IMPLICIT_INSTANTIATION (decl)
2659 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2660 && (flag_implicit_templates
2661 || (flag_implicit_inline_templates && DECL_THIS_INLINE (decl))))
2663 if (!TREE_PUBLIC (decl))
2664 /* Templates are allowed to have internal linkage. See
2668 comdat_linkage (decl);
2671 DECL_NOT_REALLY_EXTERN (decl) = 0;
2673 else if (DECL_FUNCTION_MEMBER_P (decl))
2675 tree ctype = DECL_CONTEXT (decl);
2676 import_export_class (ctype);
2677 if (CLASSTYPE_INTERFACE_KNOWN (ctype)
2679 ? (! DECL_THIS_INLINE (decl))
2680 : (! DECL_ARTIFICIAL (decl) || DECL_VINDEX (decl))))
2682 DECL_NOT_REALLY_EXTERN (decl)
2683 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2684 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2685 && !DECL_VINDEX (decl)));
2687 /* Always make artificials weak. */
2688 if (DECL_ARTIFICIAL (decl) && flag_weak)
2689 comdat_linkage (decl);
2691 maybe_make_one_only (decl);
2694 comdat_linkage (decl);
2696 else if (DECL_TINFO_FN_P (decl))
2698 tree ctype = TREE_TYPE (DECL_NAME (decl));
2700 if (IS_AGGR_TYPE (ctype))
2701 import_export_class (ctype);
2703 if (IS_AGGR_TYPE (ctype) && CLASSTYPE_INTERFACE_KNOWN (ctype)
2704 && TYPE_POLYMORPHIC_P (ctype)
2705 /* If -fno-rtti, we're not necessarily emitting this stuff with
2706 the class, so go ahead and emit it now. This can happen
2707 when a class is used in exception handling. */
2709 /* If the type is a cv-qualified variant of a type, then we
2710 must emit the tinfo function in this translation unit
2711 since it will not be emitted when the vtable for the type
2712 is output (which is when the unqualified version is
2714 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2716 DECL_NOT_REALLY_EXTERN (decl)
2717 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2718 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2719 && !DECL_VINDEX (decl)));
2721 /* Always make artificials weak. */
2723 comdat_linkage (decl);
2725 else if (TYPE_BUILT_IN (ctype)
2726 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2727 DECL_NOT_REALLY_EXTERN (decl) = 0;
2729 comdat_linkage (decl);
2732 comdat_linkage (decl);
2734 DECL_INTERFACE_KNOWN (decl) = 1;
2738 build_cleanup (decl)
2742 tree type = TREE_TYPE (decl);
2744 if (TREE_CODE (type) == ARRAY_TYPE)
2748 mark_addressable (decl);
2749 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
2751 temp = build_delete (TREE_TYPE (temp), temp,
2753 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
2757 extern int parse_time, varconst_time;
2763 tree sname = get_id_2 ("__sn", base);
2764 /* For struct X foo __attribute__((weak)), there is a counter
2765 __snfoo. Since base is already an assembler name, sname should
2766 be globally unique */
2767 tree sentry = IDENTIFIER_GLOBAL_VALUE (sname);
2770 sentry = build_decl (VAR_DECL, sname, integer_type_node);
2771 TREE_PUBLIC (sentry) = 1;
2772 DECL_ARTIFICIAL (sentry) = 1;
2773 TREE_STATIC (sentry) = 1;
2774 TREE_USED (sentry) = 1;
2775 DECL_COMMON (sentry) = 1;
2776 pushdecl_top_level (sentry);
2777 cp_finish_decl (sentry, NULL_TREE, NULL_TREE, 0);
2782 /* Start the process of running a particular set of global constructors
2783 or destructors. Subroutine of do_[cd]tors. */
2786 start_objects (method_type, initp)
2787 int method_type, initp;
2793 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2795 if (initp != DEFAULT_INIT_PRIORITY)
2805 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
2808 sprintf (type, "%c", method_type);
2810 fnname = get_file_function_name_long (type);
2812 start_function (void_list_node,
2813 make_call_declarator (fnname, void_list_node, NULL_TREE,
2815 NULL_TREE, SF_DEFAULT);
2817 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2818 /* It can be a static function as long as collect2 does not have
2819 to scan the object file to find its ctor/dtor routine. */
2820 TREE_PUBLIC (current_function_decl) = 0;
2823 /* Mark this declaration as used to avoid spurious warnings. */
2824 TREE_USED (current_function_decl) = 1;
2826 /* Mark this function as a global constructor or destructor. */
2827 if (method_type == 'I')
2828 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
2830 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
2831 GLOBAL_INIT_PRIORITY (current_function_decl) = initp;
2833 body = begin_compound_stmt (/*has_no_scope=*/0);
2835 /* We cannot allow these functions to be elided, even if they do not
2836 have external linkage. And, there's no point in deferring
2837 copmilation of thes functions; they're all going to have to be
2839 current_function_cannot_inline
2840 = "static constructors and destructors cannot be inlined";
2845 /* Finish the process of running a particular set of global constructors
2846 or destructors. Subroutine of do_[cd]tors. */
2849 finish_objects (method_type, initp, body)
2850 int method_type, initp;
2857 finish_compound_stmt(/*has_no_scope=*/0, body);
2858 fn = finish_function (lineno, 0);
2861 /* When only doing semantic analysis, and no RTL generation, we
2862 can't call functions that directly emit assembly code; there is
2863 no assembly file in which to put the code. */
2864 if (flag_syntax_only)
2867 fnname = XSTR (XEXP (DECL_RTL (fn), 0), 0);
2868 if (initp == DEFAULT_INIT_PRIORITY)
2870 if (method_type == 'I')
2871 assemble_constructor (fnname);
2873 assemble_destructor (fnname);
2875 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2876 /* If we're using init priority we can't use assemble_*tor, but on ELF
2877 targets we can stick the references into named sections for GNU ld
2882 sprintf (buf, ".%ctors.%.5u", method_type == 'I' ? 'c' : 'd',
2883 /* invert the numbering so the linker puts us in the proper
2884 order; constructors are run from right to left, and the
2885 linker sorts in increasing order. */
2886 MAX_INIT_PRIORITY - initp);
2887 named_section (NULL_TREE, buf, 0);
2888 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, fnname),
2889 POINTER_SIZE / BITS_PER_UNIT, 1);
2894 /* The names of the parameters to the function created to handle
2895 initializations and destructions for objects with static storage
2897 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2898 #define PRIORITY_IDENTIFIER "__priority"
2900 /* The name of the function we create to handle initializations and
2901 destructions for objects with static storage duration. */
2902 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2904 /* The declaration for the __INITIALIZE_P argument. */
2905 static tree initialize_p_decl;
2907 /* The declaration for the __PRIORITY argument. */
2908 static tree priority_decl;
2910 /* The declaration for the static storage duration function. */
2911 static tree ssdf_decl;
2913 /* All the static storage duration functions created in this
2914 translation unit. */
2915 static varray_type ssdf_decls;
2917 /* A map from priority levels to information about that priority
2918 level. There may be many such levels, so efficient lookup is
2920 static splay_tree priority_info_map;
2922 /* Begins the generation of the function that will handle all
2923 initialization and destruction of objects with static storage
2924 duration. The function generated takes two parameters of type
2925 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2926 non-zero, it performs initializations. Otherwise, it performs
2927 destructions. It only performs those initializations or
2928 destructions with the indicated __PRIORITY. The generated function
2931 It is assumed that this function will only be called once per
2932 translation unit. */
2935 start_static_storage_duration_function ()
2937 static unsigned ssdf_number;
2942 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2944 /* Create the identifier for this function. It will be of the form
2945 SSDF_IDENTIFIER_<number>. */
2946 sprintf (id, "%s_%u", SSDF_IDENTIFIER, ssdf_number++);
2947 if (ssdf_number == 0)
2949 /* Overflow occurred. That means there are at least 4 billion
2950 initialization functions. */
2951 sorry ("too many initialization functions required");
2952 my_friendly_abort (19990430);
2955 /* Create the parameters. */
2956 parm_types = void_list_node;
2957 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2958 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2959 type = build_function_type (void_type_node, parm_types);
2961 /* Create the FUNCTION_DECL itself. */
2962 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2963 get_identifier (id),
2965 TREE_PUBLIC (ssdf_decl) = 0;
2966 DECL_ARTIFICIAL (ssdf_decl) = 1;
2968 /* Put this function in the list of functions to be called from the
2969 static constructors and destructors. */
2972 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2974 /* Take this opportunity to initialize the map from priority
2975 numbers to information about that priority level. */
2976 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2977 /*delete_key_fn=*/0,
2978 /*delete_value_fn=*/
2979 (splay_tree_delete_value_fn) &free);
2981 /* We always need to generate functions for the
2982 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2983 priorities later, we'll be sure to find the
2984 DEFAULT_INIT_PRIORITY. */
2985 get_priority_info (DEFAULT_INIT_PRIORITY);
2988 VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl);
2990 /* Create the argument list. */
2991 initialize_p_decl = build_decl (PARM_DECL,
2992 get_identifier (INITIALIZE_P_IDENTIFIER),
2994 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2995 DECL_ARG_TYPE (initialize_p_decl) = integer_type_node;
2996 TREE_USED (initialize_p_decl) = 1;
2997 priority_decl = build_decl (PARM_DECL, get_identifier (PRIORITY_IDENTIFIER),
2999 DECL_CONTEXT (priority_decl) = ssdf_decl;
3000 DECL_ARG_TYPE (priority_decl) = integer_type_node;
3001 TREE_USED (priority_decl) = 1;
3003 TREE_CHAIN (initialize_p_decl) = priority_decl;
3004 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
3006 /* Put the function in the global scope. */
3007 pushdecl (ssdf_decl);
3009 /* Start the function itself. This is equivalent to declarating the
3012 static void __ssdf (int __initialize_p, init __priority_p);
3014 It is static because we only need to call this function from the
3015 various constructor and destructor functions for this module. */
3016 start_function (/*specs=*/NULL_TREE,
3018 /*attrs=*/NULL_TREE,
3021 /* Set up the scope of the outermost block in the function. */
3022 body = begin_compound_stmt (/*has_no_scope=*/0);
3024 /* This function must not be deferred because we are depending on
3025 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3026 current_function_cannot_inline
3027 = "static storage duration functions cannot be inlined";
3032 /* Finish the generation of the function which performs initialization
3033 and destruction of objects with static storage duration. After
3034 this point, no more such objects can be created. */
3037 finish_static_storage_duration_function (body)
3040 /* Close out the function. */
3041 finish_compound_stmt (/*has_no_scope=*/0, body);
3042 expand_body (finish_function (lineno, 0));
3045 /* Return the information about the indicated PRIORITY level. If no
3046 code to handle this level has yet been generated, generate the
3047 appropriate prologue. */
3049 static priority_info
3050 get_priority_info (priority)
3056 n = splay_tree_lookup (priority_info_map,
3057 (splay_tree_key) priority);
3060 /* Create a new priority information structure, and insert it
3062 pi = (priority_info) xmalloc (sizeof (struct priority_info_s));
3063 pi->initializations_p = 0;
3064 pi->destructions_p = 0;
3065 splay_tree_insert (priority_info_map,
3066 (splay_tree_key) priority,
3067 (splay_tree_value) pi);
3070 pi = (priority_info) n->value;
3075 /* Set up to handle the initialization or destruction of DECL. If
3076 INITP is non-zero, we are initializing the variable. Otherwise, we
3077 are destroying it. */
3080 start_static_initialization_or_destruction (decl, initp)
3084 tree sentry_if_stmt = NULL_TREE;
3090 /* Figure out the priority for this declaration. */
3091 priority = DECL_INIT_PRIORITY (decl);
3093 priority = DEFAULT_INIT_PRIORITY;
3095 /* Remember that we had an initialization or finalization at this
3097 pi = get_priority_info (priority);
3099 pi->initializations_p = 1;
3101 pi->destructions_p = 1;
3103 /* Trick the compiler into thinking we are at the file and line
3104 where DECL was declared so that error-messages make sense, and so
3105 that the debugger will show somewhat sensible file and line
3107 input_filename = DECL_SOURCE_FILE (decl);
3108 lineno = DECL_SOURCE_LINE (decl);
3114 Access control for implicit calls to the constructors,
3115 the conversion functions, or the destructor called to
3116 create and destroy a static data member is performed as
3117 if these calls appeared in the scope of the member's
3120 we pretend we are in a static member function of the class of
3121 which the DECL is a member. */
3122 if (member_p (decl))
3124 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
3125 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
3128 /* Conditionalize this initialization on being in the right priority
3129 and being initializing/finalizing appropriately. */
3130 sentry_if_stmt = begin_if_stmt ();
3131 cond = build_binary_op (EQ_EXPR,
3133 build_int_2 (priority, 0));
3134 init_cond = initp ? integer_one_node : integer_zero_node;
3135 init_cond = build_binary_op (EQ_EXPR,
3138 cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
3140 /* We need a sentry if this is an object with external linkage that
3141 might be initialized in more than one place. */
3142 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
3143 || DECL_ONE_ONLY (decl)
3144 || DECL_WEAK (decl)))
3149 sentry = get_sentry (DECL_ASSEMBLER_NAME (decl));
3151 /* We do initializations only if the SENTRY is zero, i.e., if we
3152 are the first to initialize the variable. We do destructions
3153 only if the SENTRY is one, i.e., if we are the last to
3154 destroy the variable. */
3156 sentry_cond = build_binary_op (EQ_EXPR,
3157 build_unary_op (PREINCREMENT_EXPR,
3162 sentry_cond = build_binary_op (EQ_EXPR,
3163 build_unary_op (PREDECREMENT_EXPR,
3168 cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, sentry_cond);
3171 finish_if_stmt_cond (cond, sentry_if_stmt);
3173 return sentry_if_stmt;
3176 /* We've just finished generating code to do an initialization or
3177 finalization. SENTRY_IF_STMT is the if-statement we used to guard
3178 the initialization. */
3181 finish_static_initialization_or_destruction (sentry_if_stmt)
3182 tree sentry_if_stmt;
3184 finish_then_clause (sentry_if_stmt);
3187 /* Now that we're done with DECL we don't need to pretend to be a
3188 member of its class any longer. */
3189 DECL_CONTEXT (current_function_decl) = NULL_TREE;
3190 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
3193 /* Generate code to do the static initialization of DECL. The
3194 initialization is INIT. If DECL may be initialized more than once
3195 in different object files, SENTRY is the guard variable to
3196 check. PRIORITY is the priority for the initialization. */
3199 do_static_initialization (decl, init)
3204 tree sentry_if_stmt;
3206 /* Set up for the initialization. */
3208 = start_static_initialization_or_destruction (decl,
3211 /* Do the initialization itself. */
3212 if (IS_AGGR_TYPE (TREE_TYPE (decl))
3213 || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
3214 expr = build_aggr_init (decl, init, 0);
3215 else if (TREE_CODE (init) == TREE_VEC)
3216 expr = build_vec_init (decl, TREE_VEC_ELT (init, 0),
3217 TREE_VEC_ELT (init, 1),
3218 TREE_VEC_ELT (init, 2), 0);
3221 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
3222 TREE_SIDE_EFFECTS (expr) = 1;
3224 finish_expr_stmt (expr);
3226 /* If we're using __cxa_atexit, register a a function that calls the
3227 destructor for the object. */
3228 if (flag_use_cxa_atexit)
3229 register_dtor_fn (decl);
3232 finish_static_initialization_or_destruction (sentry_if_stmt);
3235 /* Generate code to do the static destruction of DECL. If DECL may be
3236 initialized more than once in different object files, SENTRY is the
3237 guard variable to check. PRIORITY is the priority for the
3241 do_static_destruction (decl)
3244 tree sentry_if_stmt;
3246 /* If we're using __cxa_atexit, then destructors are registered
3247 immediately after objects are initialized. */
3248 my_friendly_assert (!flag_use_cxa_atexit, 20000121);
3250 /* If we don't need a destructor, there's nothing to do. */
3251 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
3254 /* Actually do the destruction. */
3255 sentry_if_stmt = start_static_initialization_or_destruction (decl,
3257 finish_expr_stmt (build_cleanup (decl));
3258 finish_static_initialization_or_destruction (sentry_if_stmt);
3261 /* VARS is a list of variables with static storage duration which may
3262 need initialization and/or finalization. Remove those variables
3263 that don't really need to be initialized or finalized, and return
3264 the resulting list. The order in which the variables appear in
3265 VARS is in reverse order of the order in which they should actually
3266 be initialized. The list we return is in the unreversed order;
3267 i.e., the first variable should be initialized first. */
3270 prune_vars_needing_no_initialization (vars)
3276 for (var = vars, result = NULL_TREE;
3278 var = TREE_CHAIN (var))
3280 tree decl = TREE_VALUE (var);
3281 tree init = TREE_PURPOSE (var);
3283 /* Deal gracefully with error. */
3284 if (decl == error_mark_node)
3287 /* The only things that can be initialized are variables. */
3288 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
3290 /* If this object is not defined, we don't need to do anything
3292 if (DECL_EXTERNAL (decl))
3295 /* Also, if the initializer already contains errors, we can bail
3297 if (init && TREE_CODE (init) == TREE_LIST
3298 && value_member (error_mark_node, init))
3301 /* This variable is going to need initialization and/or
3302 finalization, so we add it to the list. */
3303 result = tree_cons (init, decl, result);
3309 /* Make sure we have told the back end about all the variables in
3313 write_out_vars (vars)
3318 for (v = vars; v; v = TREE_CHAIN (v))
3319 if (! TREE_ASM_WRITTEN (TREE_VALUE (v)))
3320 rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1);
3323 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3324 (otherwise) that will initialize all gobal objects with static
3325 storage duration having the indicated PRIORITY. */
3328 generate_ctor_or_dtor_function (constructor_p, priority)
3337 /* We use `I' to indicate initialization and `D' to indicate
3344 /* Begin the function. */
3345 body = start_objects (function_key, priority);
3347 /* Call the static storage duration function with appropriate
3349 for (i = 0; i < ssdf_decls->elements_used; ++i)
3351 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
3353 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
3355 finish_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls, i),
3359 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3360 calls to any functions marked with attributes indicating that
3361 they should be called at initialization- or destruction-time. */
3362 if (priority == DEFAULT_INIT_PRIORITY)
3366 for (fns = constructor_p ? static_ctors : static_dtors;
3368 fns = TREE_CHAIN (fns))
3369 finish_expr_stmt (build_function_call (TREE_VALUE (fns), NULL_TREE));
3372 /* Close out the function. */
3373 finish_objects (function_key, priority, body);
3376 /* Generate constructor and destructor functions for the priority
3380 generate_ctor_and_dtor_functions_for_priority (n, data)
3382 void *data ATTRIBUTE_UNUSED;
3384 int priority = (int) n->key;
3385 priority_info pi = (priority_info) n->value;
3387 /* Generate the functions themselves, but only if they are really
3389 if (pi->initializations_p
3390 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
3391 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3393 if (pi->destructions_p
3394 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
3395 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3398 /* Keep iterating. */
3402 /* This routine is called from the last rule in yyparse ().
3403 Its job is to create all the code needed to initialize and
3404 destroy the global aggregates. We do the destruction
3405 first, since that way we only need to reverse the decls once. */
3411 int start_time, this_time;
3418 /* Bad parse errors. Just forget about it. */
3419 if (! global_bindings_p () || current_class_type || decl_namespace_list)
3422 start_time = get_run_time ();
3424 /* Otherwise, GDB can get confused, because in only knows
3425 about source for LINENO-1 lines. */
3428 interface_unknown = 1;
3431 /* We now have to write out all the stuff we put off writing out.
3434 o Template specializations that we have not yet instantiated,
3435 but which are needed.
3436 o Initialization and destruction for non-local objects with
3437 static storage duration. (Local objects with static storage
3438 duration are initialized when their scope is first entered,
3439 and are cleaned up via atexit.)
3440 o Virtual function tables.
3442 All of these may cause others to be needed. For example,
3443 instantiating one function may cause another to be needed, and
3444 generating the intiailzer for an object may cause templates to be
3445 instantiated, etc., etc. */
3447 this_time = get_run_time ();
3448 parse_time -= this_time - start_time;
3449 varconst_time += this_time - start_time;
3450 start_time = get_run_time ();
3452 if (new_abi_rtti_p ())
3453 emit_support_tinfos ();
3459 /* If there are templates that we've put off instantiating, do
3461 instantiate_pending_templates ();
3463 /* Write out virtual tables as required. Note that writing out
3464 the virtual table for a template class may cause the
3465 instantiation of members of that class. */
3466 if (walk_globals (vtable_decl_p,
3467 finish_vtable_vardecl,
3471 /* Write out needed type info variables. Writing out one variable
3472 might cause others to be needed. */
3473 if (new_abi_rtti_p ()
3474 && walk_globals (tinfo_decl_p, emit_tinfo_decl, /*data=*/0))
3477 /* The list of objects with static storage duration is built up
3478 in reverse order. We clear STATIC_AGGREGATES so that any new
3479 aggregates added during the initialization of these will be
3480 initialized in the correct order when we next come around the
3482 vars = prune_vars_needing_no_initialization (static_aggregates);
3483 static_aggregates = NULL_TREE;
3489 /* We need to start a new initialization function each time
3490 through the loop. That's because we need to know which
3491 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3492 isn't computed until a function is finished, and written
3493 out. That's a deficiency in the back-end. When this is
3494 fixed, these initialization functions could all become
3495 inline, with resulting performance improvements. */
3496 tree ssdf_body = start_static_storage_duration_function ();
3498 /* Make sure the back end knows about all the variables. */
3499 write_out_vars (vars);
3501 /* First generate code to do all the initializations. */
3502 for (v = vars; v; v = TREE_CHAIN (v))
3503 do_static_initialization (TREE_VALUE (v),
3506 /* Then, generate code to do all the destructions. Do these
3507 in reverse order so that the most recently constructed
3508 variable is the first destroyed. If we're using
3509 __cxa_atexit, then we don't need to do this; functions
3510 we're registered at initialization time to destroy the
3512 if (!flag_use_cxa_atexit)
3514 vars = nreverse (vars);
3515 for (v = vars; v; v = TREE_CHAIN (v))
3516 do_static_destruction (TREE_VALUE (v));
3521 /* Finish up the static storage duration function for this
3523 finish_static_storage_duration_function (ssdf_body);
3525 /* All those initializations and finalizations might cause
3526 us to need more inline functions, more template
3527 instantiations, etc. */
3531 /* Go through the various inline functions, and see if any need
3533 for (i = 0; i < saved_inlines_used; ++i)
3535 tree decl = VARRAY_TREE (saved_inlines, i);
3536 import_export_decl (decl);
3537 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
3539 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
3541 /* Even though we're already at the top-level, we push
3542 there again. That way, when we pop back a few lines
3543 hence, all of our state is restored. Otherwise,
3544 finish_function doesn't clean things up, and we end
3545 up with CURRENT_FUNCTION_DECL set. */
3546 push_to_top_level ();
3547 if (DECL_TINFO_FN_P (decl))
3548 synthesize_tinfo_fn (decl);
3550 synthesize_method (decl);
3551 pop_from_top_level ();
3556 /* Mark all functions that might deal with exception-handling as
3558 mark_all_runtime_matches ();
3560 /* We lie to the back-end, pretending that some functions are
3561 not defined when they really are. This keeps these functions
3562 from being put out unncessarily. But, we must stop lying
3563 when the functions are referenced, or if they are not comdat
3564 since they need to be put out now. */
3565 for (i = 0; i < saved_inlines_used; ++i)
3567 tree decl = VARRAY_TREE (saved_inlines, i);
3569 if (DECL_NOT_REALLY_EXTERN (decl)
3570 && DECL_INITIAL (decl)
3571 && DECL_NEEDED_P (decl))
3572 DECL_EXTERNAL (decl) = 0;
3574 /* If we're going to need to write this function out, and
3575 there's already a body for it, create RTL for it now.
3576 (There might be no body if this is a method we haven't
3577 gotten around to synthesizing yet.) */
3578 if (!DECL_EXTERNAL (decl)
3579 && DECL_NEEDED_P (decl)
3580 && DECL_SAVED_TREE (decl)
3581 && !DECL_SAVED_INSNS (decl)
3582 && !TREE_ASM_WRITTEN (decl))
3584 int saved_not_really_extern;
3586 /* When we call finish_function in expand_body, it will
3587 try to reset DECL_NOT_REALLY_EXTERN so we save and
3589 saved_not_really_extern = DECL_NOT_REALLY_EXTERN (decl);
3590 /* Generate RTL for this function now that we know we
3593 /* Undo the damage done by finish_function. */
3594 DECL_EXTERNAL (decl) = 0;
3595 DECL_NOT_REALLY_EXTERN (decl) = saved_not_really_extern;
3596 /* If we're compiling -fsyntax-only pretend that this
3597 function has been written out so that we don't try to
3599 if (flag_syntax_only)
3600 TREE_ASM_WRITTEN (decl) = 1;
3605 if (saved_inlines_used
3606 && wrapup_global_declarations (&VARRAY_TREE (saved_inlines, 0),
3607 saved_inlines_used))
3609 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
3612 /* Static data members are just like namespace-scope globals. */
3613 for (i = 0; i < pending_statics_used; ++i)
3615 tree decl = VARRAY_TREE (pending_statics, i);
3616 if (TREE_ASM_WRITTEN (decl))
3618 import_export_decl (decl);
3619 if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
3620 DECL_EXTERNAL (decl) = 0;
3623 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
3624 pending_statics_used))
3629 /* We give C linkage to static constructors and destructors. */
3630 push_lang_context (lang_name_c);
3632 /* Generate initialization and destruction functions for all
3633 priorities for which they are required. */
3634 if (priority_info_map)
3635 splay_tree_foreach (priority_info_map,
3636 generate_ctor_and_dtor_functions_for_priority,
3639 /* We're done with the splay-tree now. */
3640 if (priority_info_map)
3641 splay_tree_delete (priority_info_map);
3643 /* We're done with static constructors, so we can go back to "C++"
3645 pop_lang_context ();
3647 /* Now delete from the chain of variables all virtual function tables.
3648 We output them all ourselves, because each will be treated
3649 specially. We don't do this if we're just doing semantic
3650 analysis, and not code-generation. */
3651 if (!flag_syntax_only)
3652 walk_globals (vtable_decl_p, prune_vtable_vardecl, /*data=*/0);
3654 /* Now, issue warnings about static, but not defined, functions,
3655 etc., and emit debugging information. */
3656 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
3657 if (pending_statics)
3658 check_global_declarations (&VARRAY_TREE (pending_statics, 0),
3659 pending_statics_used);
3663 /* The entire file is now complete. If requested, dump everything
3665 if (flag_dump_translation_unit)
3666 dump_node_to_file (global_namespace, flag_dump_translation_unit);
3668 /* If there's some tool that wants to examine the entire translation
3669 unit, let it do so now. */
3671 (*back_end_hook) (global_namespace);
3673 this_time = get_run_time ();
3674 parse_time -= this_time - start_time;
3675 varconst_time += this_time - start_time;
3677 if (flag_detailed_statistics)
3679 dump_tree_statistics ();
3680 dump_time_statistics ();
3684 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3685 expr. Since it was parsed like a type, we need to wade through and fix
3686 that. Unfortunately, since operator() is left-associative, we can't use
3687 tail recursion. In the above example, TYPE is `A', and DECL is
3690 Maybe this shouldn't be recursive, but how often will it actually be
3694 reparse_absdcl_as_expr (type, decl)
3697 /* do build_functional_cast (type, NULL_TREE) at bottom */
3698 if (TREE_OPERAND (decl, 0) == NULL_TREE)
3699 return build_functional_cast (type, NULL_TREE);
3702 decl = reparse_absdcl_as_expr (type, TREE_OPERAND (decl, 0));
3704 decl = build_x_function_call (decl, NULL_TREE, current_class_ref);
3706 if (TREE_CODE (decl) == CALL_EXPR
3707 && (! TREE_TYPE (decl)
3708 || TREE_CODE (TREE_TYPE (decl)) != VOID_TYPE))
3709 decl = require_complete_type (decl);
3714 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3715 out to be an expr. Since it was parsed like a type, we need to wade
3716 through and fix that. Since casts are right-associative, we are
3717 reversing the order, so we don't have to recurse.
3719 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3723 reparse_absdcl_as_casts (decl, expr)
3728 if (TREE_CODE (expr) == CONSTRUCTOR
3729 && TREE_TYPE (expr) == 0)
3731 type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl)));
3732 decl = TREE_OPERAND (decl, 0);
3734 expr = digest_init (type, expr, (tree *) 0);
3735 if (TREE_CODE (type) == ARRAY_TYPE && TYPE_SIZE (type) == 0)
3737 int failure = complete_array_type (type, expr, 1);
3739 my_friendly_abort (78);
3745 type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl)));
3746 decl = TREE_OPERAND (decl, 0);
3747 expr = build_c_cast (type, expr);
3750 if (warn_old_style_cast && ! in_system_header
3751 && current_lang_name != lang_name_c)
3752 warning ("use of old-style cast");
3757 /* Given plain tree nodes for an expression, build up the full semantics. */
3760 build_expr_from_tree (t)
3763 if (t == NULL_TREE || t == error_mark_node)
3766 switch (TREE_CODE (t))
3768 case IDENTIFIER_NODE:
3769 return do_identifier (t, 0, NULL_TREE);
3772 if (LOOKUP_EXPR_GLOBAL (t))
3773 return do_scoped_id (TREE_OPERAND (t, 0), 0);
3775 return do_identifier (TREE_OPERAND (t, 0), 0, NULL_TREE);
3777 case TEMPLATE_ID_EXPR:
3778 return (lookup_template_function
3779 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3780 build_expr_from_tree (TREE_OPERAND (t, 1))));
3783 return build_x_indirect_ref
3784 (build_expr_from_tree (TREE_OPERAND (t, 0)), "unary *");
3787 return build_functional_cast
3788 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3790 case REINTERPRET_CAST_EXPR:
3791 return build_reinterpret_cast
3792 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3794 case CONST_CAST_EXPR:
3795 return build_const_cast
3796 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3798 case DYNAMIC_CAST_EXPR:
3799 return build_dynamic_cast
3800 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3802 case STATIC_CAST_EXPR:
3803 return build_static_cast
3804 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3806 case PREDECREMENT_EXPR:
3807 case PREINCREMENT_EXPR:
3808 case POSTDECREMENT_EXPR:
3809 case POSTINCREMENT_EXPR:
3813 case TRUTH_NOT_EXPR:
3815 case CONVERT_EXPR: /* Unary + */
3820 return build_x_unary_op (TREE_CODE (t),
3821 build_expr_from_tree (TREE_OPERAND (t, 0)));
3826 case TRUNC_DIV_EXPR:
3828 case FLOOR_DIV_EXPR:
3829 case ROUND_DIV_EXPR:
3830 case EXACT_DIV_EXPR:
3832 case BIT_ANDTC_EXPR:
3835 case TRUNC_MOD_EXPR:
3836 case FLOOR_MOD_EXPR:
3837 case TRUTH_ANDIF_EXPR:
3838 case TRUTH_ORIF_EXPR:
3839 case TRUTH_AND_EXPR:
3854 return build_x_binary_op
3856 build_expr_from_tree (TREE_OPERAND (t, 0)),
3857 build_expr_from_tree (TREE_OPERAND (t, 1)));
3860 return build_m_component_ref
3861 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3862 build_expr_from_tree (TREE_OPERAND (t, 1)));
3865 return build_offset_ref (TREE_OPERAND (t, 0), TREE_OPERAND (t, 1));
3868 if (TREE_OPERAND (t, 0) == NULL_TREE)
3870 return build_parse_node (ARRAY_REF, NULL_TREE,
3871 build_expr_from_tree (TREE_OPERAND (t, 1)));
3872 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t, 0)),
3873 build_expr_from_tree (TREE_OPERAND (t, 1)));
3878 tree r = build_expr_from_tree (TREE_OPERAND (t, 0));
3879 if (TREE_CODE_CLASS (TREE_CODE (r)) != 't')
3881 return TREE_CODE (t) == SIZEOF_EXPR ? c_sizeof (r) : c_alignof (r);
3885 return build_x_modify_expr
3886 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3887 TREE_CODE (TREE_OPERAND (t, 1)),
3888 build_expr_from_tree (TREE_OPERAND (t, 2)));
3891 return build_x_arrow
3892 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3896 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3897 build_expr_from_tree (TREE_OPERAND (t, 1)),
3898 build_expr_from_tree (TREE_OPERAND (t, 2)),
3899 NEW_EXPR_USE_GLOBAL (t));
3902 return delete_sanity
3903 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3904 build_expr_from_tree (TREE_OPERAND (t, 1)),
3905 DELETE_EXPR_USE_VEC (t), DELETE_EXPR_USE_GLOBAL (t));
3908 if (TREE_OPERAND (t, 1) == NULL_TREE)
3909 return build_x_compound_expr
3910 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3912 my_friendly_abort (42);
3914 case METHOD_CALL_EXPR:
3915 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
3917 tree ref = TREE_OPERAND (t, 0);
3918 return build_scoped_method_call
3919 (build_expr_from_tree (TREE_OPERAND (t, 1)),
3920 build_expr_from_tree (TREE_OPERAND (ref, 0)),
3921 TREE_OPERAND (ref, 1),
3922 build_expr_from_tree (TREE_OPERAND (t, 2)));
3926 tree fn = TREE_OPERAND (t, 0);
3928 /* We can get a TEMPLATE_ID_EXPR here on code like:
3932 so we must resolve that. However, we can also get things
3933 like a BIT_NOT_EXPR here, when referring to a destructor,
3934 and things like that are not correctly resolved by
3935 build_expr_from_tree. So, just use build_expr_from_tree
3936 when we really need it. */
3937 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3938 fn = lookup_template_function
3939 (TREE_OPERAND (fn, 0),
3940 build_expr_from_tree (TREE_OPERAND (fn, 1)));
3942 return build_method_call
3943 (build_expr_from_tree (TREE_OPERAND (t, 1)),
3945 build_expr_from_tree (TREE_OPERAND (t, 2)),
3946 NULL_TREE, LOOKUP_NORMAL);
3950 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
3952 tree ref = TREE_OPERAND (t, 0);
3953 return build_member_call
3954 (build_expr_from_tree (TREE_OPERAND (ref, 0)),
3955 TREE_OPERAND (ref, 1),
3956 build_expr_from_tree (TREE_OPERAND (t, 1)));
3960 tree name = TREE_OPERAND (t, 0);
3962 tree args = build_expr_from_tree (TREE_OPERAND (t, 1));
3963 if (args != NULL_TREE && TREE_CODE (name) == LOOKUP_EXPR
3964 && !LOOKUP_EXPR_GLOBAL (name)
3965 && TREE_CODE ((id = TREE_OPERAND (name, 0))) == IDENTIFIER_NODE
3966 && (!current_class_type
3967 || !lookup_member (current_class_type, id, 0, 0)))
3969 /* Do Koenig lookup if there are no class members. */
3970 name = do_identifier (id, 0, args);
3972 else if (TREE_CODE (name) == TEMPLATE_ID_EXPR
3973 || ! really_overloaded_fn (name))
3974 name = build_expr_from_tree (name);
3975 return build_x_function_call (name, args, current_class_ref);
3979 return build_x_conditional_expr
3980 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3981 build_expr_from_tree (TREE_OPERAND (t, 1)),
3982 build_expr_from_tree (TREE_OPERAND (t, 2)));
3984 case PSEUDO_DTOR_EXPR:
3985 return (finish_pseudo_destructor_call_expr
3986 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3987 build_expr_from_tree (TREE_OPERAND (t, 1)),
3988 build_expr_from_tree (TREE_OPERAND (t, 2))));
3992 tree purpose, value, chain;
3994 if (t == void_list_node)
3997 purpose = TREE_PURPOSE (t);
3999 purpose = build_expr_from_tree (purpose);
4000 value = TREE_VALUE (t);
4002 value = build_expr_from_tree (value);
4003 chain = TREE_CHAIN (t);
4004 if (chain && chain != void_type_node)
4005 chain = build_expr_from_tree (chain);
4006 return tree_cons (purpose, value, chain);
4011 tree object = build_expr_from_tree (TREE_OPERAND (t, 0));
4012 tree field = TREE_OPERAND (t, 1);
4014 /* We use a COMPONENT_REF to indicate things of the form `x.b'
4015 and `x.A::b'. We must distinguish between those cases
4017 if (TREE_CODE (field) == SCOPE_REF)
4018 return build_object_ref (object,
4019 TREE_OPERAND (field, 0),
4020 TREE_OPERAND (field, 1));
4022 return build_x_component_ref (object, field,
4027 return build_throw (build_expr_from_tree (TREE_OPERAND (t, 0)));
4033 /* digest_init will do the wrong thing if we let it. */
4034 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
4037 r = build_nt (CONSTRUCTOR, NULL_TREE,
4038 build_expr_from_tree (CONSTRUCTOR_ELTS (t)));
4039 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
4042 return digest_init (TREE_TYPE (t), r, 0);
4047 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t, 0))) == 't')
4048 return get_typeid (TREE_OPERAND (t, 0));
4049 return build_typeid (build_expr_from_tree (TREE_OPERAND (t, 0)));
4052 return convert_from_reference (t);
4055 return build_va_arg (build_expr_from_tree (TREE_OPERAND (t, 0)),
4063 /* This is something of the form `int (*a)++' that has turned out to be an
4064 expr. It was only converted into parse nodes, so we need to go through
4065 and build up the semantics. Most of the work is done by
4066 build_expr_from_tree, above.
4068 In the above example, TYPE is `int' and DECL is `*a'. */
4071 reparse_decl_as_expr (type, decl)
4074 decl = build_expr_from_tree (decl);
4076 return build_functional_cast (type, build_tree_list (NULL_TREE, decl));
4081 /* This is something of the form `int (*a)' that has turned out to be a
4082 decl. It was only converted into parse nodes, so we need to do the
4083 checking that make_{pointer,reference}_declarator do. */
4086 finish_decl_parsing (decl)
4089 extern int current_class_depth;
4091 switch (TREE_CODE (decl))
4093 case IDENTIFIER_NODE:
4096 return make_pointer_declarator
4097 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4099 return make_reference_declarator
4100 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4102 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4105 push_nested_class (TREE_TYPE (TREE_OPERAND (decl, 0)), 3);
4106 TREE_COMPLEXITY (decl) = current_class_depth;
4109 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4112 /* For attribute handling. */
4113 TREE_VALUE (decl) = finish_decl_parsing (TREE_VALUE (decl));
4116 my_friendly_abort (5);
4122 check_cp_case_value (value)
4125 if (value == NULL_TREE)
4128 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4129 STRIP_TYPE_NOPS (value);
4131 if (TREE_READONLY_DECL_P (value))
4133 value = decl_constant_value (value);
4134 STRIP_TYPE_NOPS (value);
4136 value = fold (value);
4138 if (TREE_CODE (value) != INTEGER_CST
4139 && value != error_mark_node)
4141 cp_error ("case label `%E' does not reduce to an integer constant",
4143 value = error_mark_node;
4146 /* Promote char or short to int. */
4147 value = default_conversion (value);
4149 constant_expression_warning (value);
4154 /* Return 1 if root encloses child. */
4157 is_namespace_ancestor (root, child)
4162 if (root == global_namespace)
4164 if (child == global_namespace)
4166 return is_namespace_ancestor (root, CP_DECL_CONTEXT (child));
4170 /* Return the namespace that is the common ancestor
4171 of two given namespaces. */
4174 namespace_ancestor (ns1, ns2)
4177 if (is_namespace_ancestor (ns1, ns2))
4179 return namespace_ancestor (CP_DECL_CONTEXT (ns1), ns2);
4182 /* Insert used into the using list of user. Set indirect_flag if this
4183 directive is not directly from the source. Also find the common
4184 ancestor and let our users know about the new namespace */
4186 add_using_namespace (user, used, indirect)
4192 /* Using oneself is a no-op. */
4195 my_friendly_assert (TREE_CODE (user) == NAMESPACE_DECL, 380);
4196 my_friendly_assert (TREE_CODE (used) == NAMESPACE_DECL, 380);
4197 /* Check if we already have this. */
4198 t = purpose_member (used, DECL_NAMESPACE_USING (user));
4202 /* Promote to direct usage. */
4203 TREE_INDIRECT_USING (t) = 0;
4207 /* Add used to the user's using list. */
4208 DECL_NAMESPACE_USING (user)
4209 = tree_cons (used, namespace_ancestor (user, used),
4210 DECL_NAMESPACE_USING (user));
4212 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect;
4214 /* Add user to the used's users list. */
4215 DECL_NAMESPACE_USERS (used)
4216 = tree_cons (user, 0, DECL_NAMESPACE_USERS (used));
4218 /* Recursively add all namespaces used. */
4219 for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t))
4220 /* indirect usage */
4221 add_using_namespace (user, TREE_PURPOSE (t), 1);
4223 /* Tell everyone using us about the new used namespaces. */
4224 for (t = DECL_NAMESPACE_USERS (user); t; t = TREE_CHAIN (t))
4225 add_using_namespace (TREE_PURPOSE (t), used, 1);
4228 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4229 duplicates. The first list becomes the tail of the result.
4231 The algorithm is O(n^2). We could get this down to O(n log n) by
4232 doing a sort on the addresses of the functions, if that becomes
4236 merge_functions (s1, s2)
4240 for (; s2; s2 = OVL_NEXT (s2))
4242 tree fn = OVL_CURRENT (s2);
4243 if (! ovl_member (fn, s1))
4244 s1 = build_overload (fn, s1);
4249 /* This should return an error not all definitions define functions.
4250 It is not an error if we find two functions with exactly the
4251 same signature, only if these are selected in overload resolution.
4252 old is the current set of bindings, new the freshly-found binding.
4253 XXX Do we want to give *all* candidates in case of ambiguity?
4254 XXX In what way should I treat extern declarations?
4255 XXX I don't want to repeat the entire duplicate_decls here */
4258 ambiguous_decl (name, old, new, flags)
4265 my_friendly_assert (old != NULL_TREE, 393);
4266 /* Copy the value. */
4267 val = BINDING_VALUE (new);
4269 switch (TREE_CODE (val))
4272 /* If we expect types or namespaces, and not templates,
4273 or this is not a template class. */
4274 if (LOOKUP_QUALIFIERS_ONLY (flags)
4275 && !DECL_CLASS_TEMPLATE_P (val))
4279 if (LOOKUP_NAMESPACES_ONLY (flags))
4282 case NAMESPACE_DECL:
4283 if (LOOKUP_TYPES_ONLY (flags))
4287 if (LOOKUP_QUALIFIERS_ONLY (flags))
4291 if (!BINDING_VALUE (old))
4292 BINDING_VALUE (old) = val;
4293 else if (val && val != BINDING_VALUE (old))
4295 if (is_overloaded_fn (BINDING_VALUE (old))
4296 && is_overloaded_fn (val))
4298 BINDING_VALUE (old) = merge_functions (BINDING_VALUE (old),
4303 /* Some declarations are functions, some are not. */
4304 if (flags & LOOKUP_COMPLAIN)
4306 /* If we've already given this error for this lookup,
4307 BINDING_VALUE (old) is error_mark_node, so let's not
4308 repeat ourselves. */
4309 if (BINDING_VALUE (old) != error_mark_node)
4311 cp_error ("use of `%D' is ambiguous", name);
4312 cp_error_at (" first declared as `%#D' here",
4313 BINDING_VALUE (old));
4315 cp_error_at (" also declared as `%#D' here", val);
4317 BINDING_VALUE (old) = error_mark_node;
4320 /* ... and copy the type. */
4321 type = BINDING_TYPE (new);
4322 if (LOOKUP_NAMESPACES_ONLY (flags))
4324 if (!BINDING_TYPE (old))
4325 BINDING_TYPE (old) = type;
4326 else if (type && BINDING_TYPE (old) != type)
4328 if (flags & LOOKUP_COMPLAIN)
4330 cp_error ("`%D' denotes an ambiguous type",name);
4331 cp_error_at (" first type here", BINDING_TYPE (old));
4332 cp_error_at (" other type here", type);
4338 /* Subroutine of unualified_namespace_lookup:
4339 Add the bindings of NAME in used namespaces to VAL.
4340 We are currently looking for names in namespace SCOPE, so we
4341 look through USINGS for using-directives of namespaces
4342 which have SCOPE as a common ancestor with the current scope.
4343 Returns zero on errors. */
4346 lookup_using_namespace (name, val, usings, scope, flags, spacesp)
4347 tree name, val, usings, scope;
4353 /* Iterate over all used namespaces in current, searching for using
4354 directives of scope. */
4355 for (iter = usings; iter; iter = TREE_CHAIN (iter))
4356 if (TREE_VALUE (iter) == scope)
4359 *spacesp = tree_cons (TREE_PURPOSE (iter), NULL_TREE,
4361 val1 = binding_for_name (name, TREE_PURPOSE (iter));
4362 /* Resolve ambiguities. */
4363 val = ambiguous_decl (name, val, val1, flags);
4365 return BINDING_VALUE (val) != error_mark_node;
4369 Accepts the NAME to lookup and its qualifying SCOPE.
4370 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4374 qualified_lookup_using_namespace (name, scope, result, flags)
4380 /* Maintain a list of namespaces visited... */
4381 tree seen = NULL_TREE;
4382 /* ... and a list of namespace yet to see. */
4383 tree todo = NULL_TREE;
4385 while (scope && (result != error_mark_node))
4387 seen = tree_cons (scope, NULL_TREE, seen);
4388 result = ambiguous_decl (name, result,
4389 binding_for_name (name, scope), flags);
4390 if (!BINDING_VALUE (result) && !BINDING_TYPE (result))
4391 /* Consider using directives. */
4392 for (usings = DECL_NAMESPACE_USING (scope); usings;
4393 usings = TREE_CHAIN (usings))
4394 /* If this was a real directive, and we have not seen it. */
4395 if (!TREE_INDIRECT_USING (usings)
4396 && !purpose_member (TREE_PURPOSE (usings), seen))
4397 todo = tree_cons (TREE_PURPOSE (usings), NULL_TREE, todo);
4400 scope = TREE_PURPOSE (todo);
4401 todo = TREE_CHAIN (todo);
4404 scope = NULL_TREE; /* If there never was a todo list. */
4406 return result != error_mark_node;
4409 /* [namespace.memdef]/2 */
4411 /* Set the context of a declaration to scope. Complain if we are not
4415 set_decl_namespace (decl, scope, friendp)
4421 if (scope == std_node)
4422 scope = global_namespace;
4423 /* Get rid of namespace aliases. */
4424 scope = ORIGINAL_NAMESPACE (scope);
4426 /* It is ok for friends to be qualified in parallel space. */
4427 if (!friendp && !is_namespace_ancestor (current_namespace, scope))
4428 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4430 DECL_CONTEXT (decl) = FROB_CONTEXT (scope);
4431 if (scope != current_namespace)
4433 /* See whether this has been declared in the namespace. */
4434 old = namespace_binding (DECL_NAME (decl), scope);
4436 /* No old declaration at all. */
4438 if (!is_overloaded_fn (decl))
4439 /* Don't compare non-function decls with decls_match here,
4440 since it can't check for the correct constness at this
4441 point. pushdecl will find those errors later. */
4443 /* Since decl is a function, old should contain a function decl. */
4444 if (!is_overloaded_fn (old))
4446 if (processing_template_decl || processing_specialization)
4447 /* We have not yet called push_template_decl to turn the
4448 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4449 won't match. But, we'll check later, when we construct the
4452 for (; old; old = OVL_NEXT (old))
4453 if (decls_match (decl, OVL_CURRENT (old)))
4459 cp_error ("`%D' should have been declared inside `%D'",
4463 /* Compute the namespace where a declaration is defined. */
4466 decl_namespace (decl)
4469 while (DECL_CONTEXT (decl))
4471 decl = DECL_CONTEXT (decl);
4472 if (TREE_CODE (decl) == NAMESPACE_DECL)
4474 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 't')
4475 decl = TYPE_STUB_DECL (decl);
4476 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd', 390);
4479 return global_namespace;
4482 /* Return the namespace where the current declaration is declared. */
4485 current_decl_namespace ()
4488 /* If we have been pushed into a different namespace, use it. */
4489 if (decl_namespace_list)
4490 return TREE_PURPOSE (decl_namespace_list);
4492 if (current_class_type)
4493 result = decl_namespace (TYPE_STUB_DECL (current_class_type));
4494 else if (current_function_decl)
4495 result = decl_namespace (current_function_decl);
4497 result = current_namespace;
4501 /* Temporarily set the namespace for the current declaration. */
4504 push_decl_namespace (decl)
4507 if (TREE_CODE (decl) != NAMESPACE_DECL)
4508 decl = decl_namespace (decl);
4509 decl_namespace_list = tree_cons (decl, NULL_TREE, decl_namespace_list);
4513 pop_decl_namespace ()
4515 decl_namespace_list = TREE_CHAIN (decl_namespace_list);
4518 /* Enter a class or namespace scope. */
4524 if (TREE_CODE (t) == NAMESPACE_DECL)
4525 push_decl_namespace (t);
4530 /* Leave scope pushed by push_scope. */
4536 if (TREE_CODE (t) == NAMESPACE_DECL)
4537 pop_decl_namespace ();
4542 /* [basic.lookup.koenig] */
4543 /* A non-zero return value in the functions below indicates an error.
4544 All nodes allocated in the procedure are on the scratch obstack. */
4554 static int arg_assoc PARAMS ((struct arg_lookup*, tree));
4555 static int arg_assoc_args PARAMS ((struct arg_lookup*, tree));
4556 static int arg_assoc_type PARAMS ((struct arg_lookup*, tree));
4557 static int add_function PARAMS ((struct arg_lookup *, tree));
4558 static int arg_assoc_namespace PARAMS ((struct arg_lookup *, tree));
4559 static int arg_assoc_class PARAMS ((struct arg_lookup *, tree));
4560 static int arg_assoc_template_arg PARAMS ((struct arg_lookup*, tree));
4562 /* Add a function to the lookup structure.
4563 Returns 1 on error. */
4566 add_function (k, fn)
4567 struct arg_lookup *k;
4570 /* We used to check here to see if the function was already in the list,
4571 but that's O(n^2), which is just too expensive for function lookup.
4572 Now we deal with the occasional duplicate in joust. In doing this, we
4573 assume that the number of duplicates will be small compared to the
4574 total number of functions being compared, which should usually be the
4577 /* We must find only functions, or exactly one non-function. */
4578 if (k->functions && is_overloaded_fn (k->functions)
4579 && is_overloaded_fn (fn))
4580 k->functions = build_overload (fn, k->functions);
4581 else if (k->functions)
4583 tree f1 = OVL_CURRENT (k->functions);
4585 if (is_overloaded_fn (f1))
4587 fn = f1; f1 = f2; f2 = fn;
4589 cp_error_at ("`%D' is not a function,", f1);
4590 cp_error_at (" conflict with `%D'", f2);
4591 cp_error (" in call to `%D'", k->name);
4599 /* Add functions of a namespace to the lookup structure.
4600 Returns 1 on error. */
4603 arg_assoc_namespace (k, scope)
4604 struct arg_lookup *k;
4609 if (purpose_member (scope, k->namespaces))
4611 k->namespaces = tree_cons (scope, NULL_TREE, k->namespaces);
4613 value = namespace_binding (k->name, scope);
4617 for (; value; value = OVL_NEXT (value))
4618 if (add_function (k, OVL_CURRENT (value)))
4624 /* Adds everything associated with a template argument to the lookup
4625 structure. Returns 1 on error. */
4628 arg_assoc_template_arg (k, arg)
4629 struct arg_lookup* k;
4632 /* [basic.lookup.koenig]
4634 If T is a template-id, its associated namespaces and classes are
4635 ... the namespaces and classes associated with the types of the
4636 template arguments provided for template type parameters
4637 (excluding template template parameters); the namespaces in which
4638 any template template arguments are defined; and the classes in
4639 which any member templates used as template template arguments
4640 are defined. [Note: non-type template arguments do not
4641 contribute to the set of associated namespaces. ] */
4643 /* Consider first template template arguments. */
4644 if (TREE_CODE (arg) == TEMPLATE_DECL)
4646 tree ctx = CP_DECL_CONTEXT (arg);
4648 /* It's not a member template. */
4649 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4650 return arg_assoc_namespace (k, ctx);
4651 /* Otherwise, it must be member template. */
4653 return arg_assoc_class (k, ctx);
4655 /* It's not a template template argument, but it is a type template
4657 else if (TREE_CODE_CLASS (TREE_CODE (arg)) == 't')
4658 return arg_assoc_type (k, arg);
4659 /* It's a non-type template argument. */
4664 /* Adds everything associated with class to the lookup structure.
4665 Returns 1 on error. */
4668 arg_assoc_class (k, type)
4669 struct arg_lookup* k;
4672 tree list, friends, context;
4675 /* Backend build structures, such as __builtin_va_list, aren't
4676 affected by all this. */
4677 if (!CLASS_TYPE_P (type))
4680 if (purpose_member (type, k->classes))
4682 k->classes = tree_cons (type, NULL_TREE, k->classes);
4684 context = decl_namespace (TYPE_MAIN_DECL (type));
4685 if (arg_assoc_namespace (k, context))
4688 /* Process baseclasses. */
4689 for (i = 0; i < CLASSTYPE_N_BASECLASSES (type); i++)
4690 if (arg_assoc_class (k, TYPE_BINFO_BASETYPE (type, i)))
4693 /* Process friends. */
4694 for (list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list;
4695 list = TREE_CHAIN (list))
4696 if (k->name == TREE_PURPOSE (list))
4697 for (friends = TREE_VALUE (list); friends;
4698 friends = TREE_CHAIN (friends))
4699 /* Only interested in global functions with potentially hidden
4700 (i.e. unqualified) declarations. */
4701 if (TREE_PURPOSE (list) == error_mark_node && TREE_VALUE (list)
4702 && decl_namespace (TREE_VALUE (list)) == context)
4703 if (add_function (k, TREE_VALUE (list)))
4706 /* Process template arguments. */
4707 if (CLASSTYPE_TEMPLATE_INFO (type))
4709 list = innermost_args (CLASSTYPE_TI_ARGS (type));
4710 for (i = 0; i < TREE_VEC_LENGTH (list); ++i)
4711 arg_assoc_template_arg (k, TREE_VEC_ELT (list, i));
4717 /* Adds everything associated with a given type.
4718 Returns 1 on error. */
4721 arg_assoc_type (k, type)
4722 struct arg_lookup *k;
4725 switch (TREE_CODE (type))
4735 if (TYPE_PTRMEMFUNC_P (type))
4736 return arg_assoc_type (k, TYPE_PTRMEMFUNC_FN_TYPE (type));
4737 return arg_assoc_class (k, type);
4739 case REFERENCE_TYPE:
4741 return arg_assoc_type (k, TREE_TYPE (type));
4744 return arg_assoc_namespace (k, decl_namespace (TYPE_MAIN_DECL (type)));
4746 /* Pointer to member: associate class type and value type. */
4747 if (arg_assoc_type (k, TYPE_OFFSET_BASETYPE (type)))
4749 return arg_assoc_type (k, TREE_TYPE (type));
4751 /* The basetype is referenced in the first arg type, so just
4754 /* Associate the parameter types. */
4755 if (arg_assoc_args (k, TYPE_ARG_TYPES (type)))
4757 /* Associate the return type. */
4758 return arg_assoc_type (k, TREE_TYPE (type));
4759 case TEMPLATE_TYPE_PARM:
4760 case TEMPLATE_TEMPLATE_PARM:
4763 if (type == unknown_type_node)
4765 /* else fall through */
4767 my_friendly_abort (390);
4772 /* Adds everything associated with arguments. Returns 1 on error. */
4775 arg_assoc_args (k, args)
4776 struct arg_lookup* k;
4779 for (; args; args = TREE_CHAIN (args))
4780 if (arg_assoc (k, TREE_VALUE (args)))
4785 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4789 struct arg_lookup* k;
4792 if (n == error_mark_node)
4795 if (TREE_CODE_CLASS (TREE_CODE (n)) == 't')
4796 return arg_assoc_type (k, n);
4798 if (! type_unknown_p (n))
4799 return arg_assoc_type (k, TREE_TYPE (n));
4801 if (TREE_CODE (n) == ADDR_EXPR)
4802 n = TREE_OPERAND (n, 0);
4803 if (TREE_CODE (n) == COMPONENT_REF)
4804 n = TREE_OPERAND (n, 1);
4805 if (TREE_CODE (n) == OFFSET_REF)
4806 n = TREE_OPERAND (n, 1);
4807 while (TREE_CODE (n) == TREE_LIST)
4810 if (TREE_CODE (n) == FUNCTION_DECL)
4811 return arg_assoc_type (k, TREE_TYPE (n));
4812 if (TREE_CODE (n) == TEMPLATE_ID_EXPR)
4814 /* [basic.lookup.koenig]
4816 If T is a template-id, its associated namespaces and classes
4817 are the namespace in which the template is defined; for
4818 member templates, the member template's class... */
4819 tree template = TREE_OPERAND (n, 0);
4820 tree args = TREE_OPERAND (n, 1);
4824 /* First, the template. There may actually be more than one if
4825 this is an overloaded function template. But, in that case,
4826 we only need the first; all the functions will be in the same
4828 template = OVL_CURRENT (template);
4830 ctx = CP_DECL_CONTEXT (template);
4832 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4834 if (arg_assoc_namespace (k, ctx) == 1)
4837 /* It must be a member template. */
4838 else if (arg_assoc_class (k, ctx) == 1)
4841 /* Now the arguments. */
4842 for (arg = args; arg != NULL_TREE; arg = TREE_CHAIN (arg))
4843 if (arg_assoc_template_arg (k, TREE_VALUE (arg)) == 1)
4848 my_friendly_assert (TREE_CODE (n) == OVERLOAD, 980715);
4850 for (; n; n = OVL_CHAIN (n))
4851 if (arg_assoc_type (k, TREE_TYPE (OVL_FUNCTION (n))))
4858 /* Performs Koenig lookup depending on arguments, where fns
4859 are the functions found in normal lookup. */
4862 lookup_arg_dependent (name, fns, args)
4867 struct arg_lookup k;
4868 tree fn = NULL_TREE;
4872 k.classes = NULL_TREE;
4874 /* Note that we've already looked at some namespaces during normal
4875 unqualified lookup, unless we found a decl in function scope. */
4877 fn = OVL_CURRENT (fns);
4878 if (fn && TREE_CODE (fn) == FUNCTION_DECL && DECL_LOCAL_FUNCTION_P (fn))
4879 k.namespaces = NULL_TREE;
4881 unqualified_namespace_lookup (name, 0, &k.namespaces);
4883 arg_assoc_args (&k, args);
4887 /* Process a namespace-alias declaration. */
4890 do_namespace_alias (alias, namespace)
4891 tree alias, namespace;
4893 if (TREE_CODE (namespace) != NAMESPACE_DECL)
4895 /* The parser did not find it, so it's not there. */
4896 cp_error ("unknown namespace `%D'", namespace);
4900 namespace = ORIGINAL_NAMESPACE (namespace);
4902 /* Build the alias. */
4903 alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node);
4904 DECL_NAMESPACE_ALIAS (alias) = namespace;
4908 /* Check a non-member using-declaration. Return the name and scope
4909 being used, and the USING_DECL, or NULL_TREE on failure. */
4912 validate_nonmember_using_decl (decl, scope, name)
4917 if (TREE_CODE (decl) == SCOPE_REF
4918 && TREE_OPERAND (decl, 0) == std_node)
4920 if (namespace_bindings_p ()
4921 && current_namespace == global_namespace)
4922 /* There's no need for a using declaration at all, here,
4923 since `std' is the same as `::'. We can't just pass this
4924 on because we'll complain later about declaring something
4925 in the same scope as a using declaration with the same
4926 name. We return NULL_TREE which indicates to the caller
4927 that there's no need to do any further processing. */
4930 *scope = global_namespace;
4931 *name = TREE_OPERAND (decl, 1);
4933 else if (TREE_CODE (decl) == SCOPE_REF)
4935 *scope = TREE_OPERAND (decl, 0);
4936 *name = TREE_OPERAND (decl, 1);
4938 /* [namespace.udecl]
4940 A using-declaration for a class member shall be a
4941 member-declaration. */
4942 if (TREE_CODE (*scope) != NAMESPACE_DECL)
4944 if (TYPE_P (*scope))
4945 cp_error ("`%T' is not a namespace", *scope);
4947 cp_error ("`%D' is not a namespace", *scope);
4951 else if (TREE_CODE (decl) == IDENTIFIER_NODE
4952 || TREE_CODE (decl) == TYPE_DECL
4953 || TREE_CODE (decl) == TEMPLATE_DECL)
4955 *scope = global_namespace;
4959 my_friendly_abort (382);
4960 if (TREE_CODE_CLASS (TREE_CODE (*name)) == 'd')
4961 *name = DECL_NAME (*name);
4962 /* Make a USING_DECL. */
4963 return push_using_decl (*scope, *name);
4966 /* Process local and global using-declarations. */
4969 do_nonmember_using_decl (scope, name, oldval, oldtype, newval, newtype)
4971 tree oldval, oldtype;
4972 tree *newval, *newtype;
4976 *newval = *newtype = NULL_TREE;
4977 decls = make_node (CPLUS_BINDING);
4978 if (!qualified_lookup_using_namespace (name, scope, decls, 0))
4982 if (!BINDING_VALUE (decls) && !BINDING_TYPE (decls))
4984 cp_error ("`%D' not declared", name);
4988 /* Check for using functions. */
4989 if (BINDING_VALUE (decls) && is_overloaded_fn (BINDING_VALUE (decls)))
4993 if (oldval && !is_overloaded_fn (oldval))
4995 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls)), oldval);
5000 for (tmp = BINDING_VALUE (decls); tmp; tmp = OVL_NEXT (tmp))
5002 tree new_fn = OVL_CURRENT (tmp);
5004 /* [namespace.udecl]
5006 If a function declaration in namespace scope or block
5007 scope has the same name and the same parameter types as a
5008 function introduced by a using declaration the program is
5010 for (tmp1 = oldval; tmp1; tmp1 = OVL_NEXT (tmp1))
5012 tree old_fn = OVL_CURRENT (tmp1);
5014 if (!OVL_USED (tmp1)
5015 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn)),
5016 TYPE_ARG_TYPES (TREE_TYPE (old_fn))))
5018 /* There was already a non-using declaration in
5019 this scope with the same parameter types. */
5020 cp_error ("`%D' is already declared in this scope",
5024 else if (duplicate_decls (new_fn, old_fn))
5025 /* We're re-using something we already used
5026 before. We don't need to add it again. */
5030 /* If we broke out of the loop, there's no reason to add
5031 this function to the using declarations for this
5036 *newval = build_overload (OVL_CURRENT (tmp), *newval);
5037 if (TREE_CODE (*newval) != OVERLOAD)
5038 *newval = ovl_cons (*newval, NULL_TREE);
5039 OVL_USED (*newval) = 1;
5044 *newval = BINDING_VALUE (decls);
5046 duplicate_decls (*newval, oldval);
5049 *newtype = BINDING_TYPE (decls);
5050 if (oldtype && *newtype && oldtype != *newtype)
5052 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5058 /* Process a using-declaration not appearing in class or local scope. */
5061 do_toplevel_using_decl (decl)
5064 tree scope, name, binding;
5065 tree oldval, oldtype, newval, newtype;
5067 decl = validate_nonmember_using_decl (decl, &scope, &name);
5068 if (decl == NULL_TREE)
5071 binding = binding_for_name (name, current_namespace);
5073 oldval = BINDING_VALUE (binding);
5074 oldtype = BINDING_TYPE (binding);
5076 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5078 /* Copy declarations found. */
5080 BINDING_VALUE (binding) = newval;
5082 BINDING_TYPE (binding) = newtype;
5086 /* Process a using-declaration at function scope. */
5089 do_local_using_decl (decl)
5093 tree oldval, oldtype, newval, newtype;
5095 decl = validate_nonmember_using_decl (decl, &scope, &name);
5096 if (decl == NULL_TREE)
5099 oldval = lookup_name_current_level (name);
5100 oldtype = lookup_type_current_level (name);
5102 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5106 if (is_overloaded_fn (newval))
5110 /* We only need to push declarations for those functions
5111 that were not already bound in the current level.
5112 The old value might be NULL_TREE, it might be a single
5113 function, or an OVERLOAD. */
5114 if (oldval && TREE_CODE (oldval) == OVERLOAD)
5115 term = OVL_FUNCTION (oldval);
5118 for (fn = newval; fn && OVL_CURRENT (fn) != term;
5120 push_overloaded_decl (OVL_CURRENT (fn),
5121 PUSH_LOCAL | PUSH_USING);
5124 push_local_binding (name, newval, PUSH_USING);
5127 set_identifier_type_value (name, newtype);
5131 do_class_using_decl (decl)
5136 if (TREE_CODE (decl) != SCOPE_REF
5137 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl, 0))) != 't')
5139 cp_error ("using-declaration for non-member at class scope");
5142 name = TREE_OPERAND (decl, 1);
5143 if (TREE_CODE (name) == BIT_NOT_EXPR)
5145 cp_error ("using-declaration for destructor");
5148 if (TREE_CODE (name) == TYPE_DECL)
5149 name = DECL_NAME (name);
5151 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 980716);
5153 value = build_lang_decl (USING_DECL, name, void_type_node);
5154 DECL_INITIAL (value) = TREE_OPERAND (decl, 0);
5158 /* Process a using-directive. */
5161 do_using_directive (namespace)
5164 if (namespace == std_node)
5166 /* using namespace A::B::C; */
5167 if (TREE_CODE (namespace) == SCOPE_REF)
5168 namespace = TREE_OPERAND (namespace, 1);
5169 if (TREE_CODE (namespace) == IDENTIFIER_NODE)
5171 /* Lookup in lexer did not find a namespace. */
5172 cp_error ("namespace `%T' undeclared", namespace);
5175 if (TREE_CODE (namespace) != NAMESPACE_DECL)
5177 cp_error ("`%T' is not a namespace", namespace);
5180 namespace = ORIGINAL_NAMESPACE (namespace);
5181 if (!toplevel_bindings_p ())
5182 push_using_directive (namespace);
5185 add_using_namespace (current_namespace, namespace, 0);
5189 check_default_args (x)
5192 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
5193 int saw_def = 0, i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
5194 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
5196 if (TREE_PURPOSE (arg))
5200 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5211 TREE_USED (decl) = 1;
5212 if (processing_template_decl)
5214 assemble_external (decl);
5216 /* Is it a synthesized method that needs to be synthesized? */
5217 if (TREE_CODE (decl) == FUNCTION_DECL
5218 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
5219 && DECL_ARTIFICIAL (decl)
5220 && ! DECL_INITIAL (decl)
5221 /* Kludge: don't synthesize for default args. */
5222 && current_function_decl)
5223 synthesize_method (decl);
5225 /* If this is a function or variable that is an instance of some
5226 template, we now know that we will need to actually do the
5227 instantiation. We check that DECL is not an explicit
5228 instantiation because that is not checked in instantiate_decl. */
5229 if ((TREE_CODE (decl) == FUNCTION_DECL || TREE_CODE (decl) == VAR_DECL)
5230 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
5231 && (!DECL_EXPLICIT_INSTANTIATION (decl)
5232 || (TREE_CODE (decl) == FUNCTION_DECL && DECL_INLINE (decl))))
5233 instantiate_decl (decl);
5236 /* Helper function for named_class_head_sans_basetype nonterminal. We
5237 have just seen something of the form `AGGR SCOPE::ID'. Return a
5238 TYPE_DECL for the type declared by ID in SCOPE. */
5241 handle_class_head (aggr, scope, id)
5242 tree aggr, scope, id;
5246 if (TREE_CODE (id) == TYPE_DECL)
5248 else if (DECL_CLASS_TEMPLATE_P (id))
5249 decl = DECL_TEMPLATE_RESULT (id);
5252 tree current = current_scope();
5254 if (current == NULL_TREE)
5255 current = current_namespace;
5256 if (scope == std_node)
5257 scope = global_namespace;
5258 if (scope == NULL_TREE)
5259 scope = global_namespace;
5260 if (scope == current)
5262 /* We've been given AGGR SCOPE::ID, when we're already inside SCOPE.
5263 Be nice about it. */
5265 cp_pedwarn ("extra qualification `%T::' on member `%D' ignored",
5266 FROB_CONTEXT (scope), id);
5268 else if (scope != global_namespace)
5269 cp_error ("`%T' does not have a nested type named `%D'", scope, id);
5271 cp_error ("no file-scope type named `%D'", id);
5273 /* Inject it at the current scope. */
5274 decl = TYPE_MAIN_DECL (xref_tag (aggr, id, 1));
5277 /* Enter the SCOPE. If this turns out not to be a definition, the
5278 parser must leave the scope. */
5279 push_scope (CP_DECL_CONTEXT (decl));
5281 /* If we see something like:
5283 template <typename T> struct S::I ....
5285 we must create a TEMPLATE_DECL for the nested type. */
5286 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5287 decl = push_template_decl (decl);
5292 /* Initialize decl2.c. */
5297 ggc_add_tree_root (&decl_namespace_list, 1);
5298 ggc_add_tree_varray_root (&saved_inlines, 1);
5299 ggc_add_tree_varray_root (&pending_statics, 1);
5300 ggc_add_tree_varray_root (&ssdf_decls, 1);
5301 ggc_add_tree_root (&ssdf_decl, 1);
5302 ggc_add_tree_root (&priority_decl, 1);
5303 ggc_add_tree_root (&initialize_p_decl, 1);
5304 ggc_add_tree_root (&pending_vtables, 1);