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"
51 extern cpp_reader parse_in
;
54 /* This structure contains information about the initializations
55 and/or destructions required for a particular priority level. */
56 typedef struct priority_info_s
{
57 /* Non-zero if there have been any initializations at this priority
58 throughout the translation unit. */
59 int initializations_p
;
60 /* Non-zero if there have been any destructions at this priority
61 throughout the translation unit. */
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
));
96 static int compare_options
PARAMS ((const PTR
, const PTR
));
97 static tree get_guard_bits
PARAMS ((tree
));
99 extern int current_class_depth
;
101 /* A list of virtual function tables we must make sure to write out. */
102 tree pending_vtables
;
104 /* A list of static class variables. This is needed, because a
105 static class variable can be declared inside the class without
106 an initializer, and then initialized, staticly, outside the class. */
107 static varray_type pending_statics
;
108 #define pending_statics_used \
109 (pending_statics ? pending_statics->elements_used : 0)
111 /* A list of functions which were declared inline, but which we
112 may need to emit outline anyway. */
113 static varray_type deferred_fns
;
114 #define deferred_fns_used \
115 (deferred_fns ? deferred_fns->elements_used : 0)
117 /* Same, but not reset. Local temp variables and global temp variables
118 can have the same name. */
119 static int global_temp_name_counter
;
121 /* Flag used when debugging spew.c */
123 extern int spew_debug
;
125 /* Nonzero if we're done parsing and into end-of-file activities. */
129 /* Functions called along with real static constructors and destructors. */
131 tree static_ctors
, static_dtors
;
133 /* The :: namespace. */
135 tree global_namespace
;
137 /* The stack for namespaces of current declarations. */
139 static tree decl_namespace_list
;
142 /* C (and C++) language-specific option variables. */
144 /* Nonzero means allow type mismatches in conditional expressions;
145 just make their values `void'. */
147 int flag_cond_mismatch
;
149 /* Nonzero means give `double' the same size as `float'. */
151 int flag_short_double
;
153 /* Nonzero means don't recognize the keyword `asm'. */
157 /* Nonzero means don't recognize any extension keywords. */
159 int flag_no_gnu_keywords
;
161 /* Nonzero means don't recognize the non-ANSI builtin functions. */
165 /* Nonzero means don't recognize the non-ANSI builtin functions.
168 int flag_no_nonansi_builtin
;
170 /* Nonzero means do some things the same way PCC does. Only provided so
171 the compiler will link. */
173 int flag_traditional
;
175 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
177 int flag_signed_bitfields
= 1;
179 /* Nonzero means enable obscure standard features and disable GNU
180 extensions that might cause standard-compliant code to be
185 /* Nonzero means do emit exported implementations of functions even if
186 they can be inlined. */
188 int flag_implement_inlines
= 1;
190 /* Nonzero means do emit exported implementations of templates, instead of
191 multiple static copies in each file that needs a definition. */
193 int flag_external_templates
;
195 /* Nonzero means that the decision to emit or not emit the implementation of a
196 template depends on where the template is instantiated, rather than where
199 int flag_alt_external_templates
;
201 /* Nonzero means that implicit instantiations will be emitted if needed. */
203 int flag_implicit_templates
= 1;
205 /* Nonzero means that implicit instantiations of inline templates will be
206 emitted if needed, even if instantiations of non-inline templates
209 int flag_implicit_inline_templates
= 1;
211 /* Nonzero means warn about implicit declarations. */
213 int warn_implicit
= 1;
215 /* Nonzero means warn about usage of long long when `-pedantic'. */
217 int warn_long_long
= 1;
219 /* Nonzero means warn when all ctors or dtors are private, and the class
222 int warn_ctor_dtor_privacy
= 1;
224 /* True if we want to implement vtables using "thunks".
225 The default is off. */
227 #ifndef DEFAULT_VTABLE_THUNKS
228 #define DEFAULT_VTABLE_THUNKS 0
230 int flag_vtable_thunks
= DEFAULT_VTABLE_THUNKS
;
232 /* Nonzero means generate separate instantiation control files and juggle
233 them at link time. */
235 int flag_use_repository
;
237 /* Nonzero if we want to issue diagnostics that the standard says are not
240 int flag_optional_diags
= 1;
242 /* Nonzero means give string constants the type `const char *', as mandated
245 int flag_const_strings
= 1;
247 /* If non-NULL, dump the tree structure for the entire translation
248 unit to this file. */
250 const char *flag_dump_translation_unit
= 0;
252 /* Nonzero means warn about deprecated conversion from string constant to
255 int warn_write_strings
;
257 /* Nonzero means warn about pointer casts that can drop a type qualifier
258 from the pointer target type. */
262 /* Nonzero means warn about sizeof(function) or addition/subtraction
263 of function pointers. */
265 int warn_pointer_arith
= 1;
267 /* Nonzero means warn for any function def without prototype decl. */
269 int warn_missing_prototypes
;
271 /* Nonzero means warn about multiple (redundant) decls for the same single
272 variable or function. */
274 int warn_redundant_decls
;
276 /* Warn if initializer is not completely bracketed. */
278 int warn_missing_braces
;
280 /* Warn about comparison of signed and unsigned values. */
282 int warn_sign_compare
;
284 /* Warn about testing equality of floating point numbers. */
286 int warn_float_equal
= 0;
288 /* Warn about *printf or *scanf format/argument anomalies. */
292 /* Warn about a subscript that has type char. */
294 int warn_char_subscripts
;
296 /* Warn if a type conversion is done that might have confusing results. */
300 /* Warn if adding () is suggested. */
302 int warn_parentheses
;
304 /* Non-zero means warn in function declared in derived class has the
305 same name as a virtual in the base class, but fails to match the
306 type signature of any virtual function in the base class. */
307 int warn_overloaded_virtual
;
309 /* Non-zero means warn when declaring a class that has a non virtual
310 destructor, when it really ought to have a virtual one. */
313 /* Non-zero means warn when a function is declared extern and later inline. */
314 int warn_extern_inline
;
316 /* Non-zero means warn when the compiler will reorder code. */
319 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
322 /* Non-zero means warn when we convert a pointer to member function
323 into a pointer to (void or function). */
324 int warn_pmf2ptr
= 1;
326 /* Nonzero means warn about violation of some Effective C++ style rules. */
330 /* Nonzero means warn where overload resolution chooses a promotion from
331 unsigned to signed over a conversion to an unsigned of the same size. */
335 /* Nonzero means warn when an old-style cast is used. */
337 int warn_old_style_cast
;
339 /* Warn about #pragma directives that are not recognised. */
341 int warn_unknown_pragmas
; /* Tri state variable. */
343 /* Nonzero means warn about use of multicharacter literals. */
345 int warn_multichar
= 1;
347 /* Nonzero means warn when non-templatized friend functions are
348 declared within a template */
350 int warn_nontemplate_friend
= 1;
352 /* Nonzero means complain about deprecated features. */
354 int warn_deprecated
= 1;
356 /* Nonzero means `$' can be in an identifier. */
358 #ifndef DOLLARS_IN_IDENTIFIERS
359 #define DOLLARS_IN_IDENTIFIERS 1
361 int dollars_in_ident
= DOLLARS_IN_IDENTIFIERS
;
363 /* Nonzero means that labels can be used as first-class objects */
367 /* Nonzero means allow Microsoft extensions without a pedwarn. */
369 int flag_ms_extensions
;
371 /* Non-zero means to collect statistics which might be expensive
372 and to print them when we are done. */
373 int flag_detailed_statistics
;
375 /* C++ specific flags. */
376 /* Zero means that `this' is a *const. This gives nice behavior in the
377 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
378 -2 means we're constructing an object and it has fixed type. */
380 int flag_this_is_variable
;
382 /* Nonzero means we should attempt to elide constructors when possible. */
384 int flag_elide_constructors
= 1;
386 /* Nonzero means that member functions defined in class scope are
387 inline by default. */
389 int flag_default_inline
= 1;
391 /* Controls whether compiler generates 'type descriptor' that give
392 run-time type information. */
395 /* Nonzero if we wish to output cross-referencing information
396 for the GNU class browser. */
397 extern int flag_gnu_xref
;
399 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
402 int flag_huge_objects
;
404 /* Nonzero if we want to conserve space in the .o files. We do this
405 by putting uninitialized data and runtime initialized data into
406 .common instead of .data at the expense of not flagging multiple
409 int flag_conserve_space
;
411 /* Nonzero if we want to obey access control semantics. */
413 int flag_access_control
= 1;
415 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
417 int flag_operator_names
= 1;
419 /* Nonzero if we want to check the return value of new and avoid calling
420 constructors if it is a null pointer. */
424 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
425 initialization variables.
426 0: Old rules, set by -fno-for-scope.
427 2: New ISO rules, set by -ffor-scope.
428 1: Try to implement new ISO rules, but with backup compatibility
429 (and warnings). This is the default, for now. */
431 int flag_new_for_scope
= 1;
433 /* Nonzero if we want to emit defined symbols with common-like linkage as
434 weak symbols where possible, in order to conform to C++ semantics.
435 Otherwise, emit them as local symbols. */
439 /* Nonzero to enable experimental ABI changes. */
443 /* Nonzero to use __cxa_atexit, rather than atexit, to register
444 destructors for local statics and global objects. */
446 int flag_use_cxa_atexit
;
448 /* Nonzero to not ignore namespace std. */
450 int flag_honor_std
= ENABLE_STD_NAMESPACE
;
452 /* Nonzero if we should expand functions calls inline at the tree
453 level, rather than at the RTL level. */
455 int flag_inline_trees
= 0;
457 /* Maximum template instantiation depth. Must be at least 17 for ISO
460 int max_tinst_depth
= 17;
462 /* The name-mangling scheme to use. Must be 1 or greater to support
463 template functions with identical types, but different template
465 int name_mangling_version
= 2;
467 /* Nonzero if wchar_t should be `unsigned short' instead of whatever it
468 would normally be, for use with WINE. */
469 int flag_short_wchar
;
471 /* Nonzero if squashed mangling is to be performed.
472 This uses the B and K codes to reference previously seen class types
473 and class qualifiers. */
474 int flag_do_squangling
;
476 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
480 /* Nonzero means make the default pedwarns warnings instead of errors.
481 The value of this flag is ignored if -pedantic is specified. */
485 /* Nonzero means to implement standard semantics for exception
486 specifications, calling unexpected if an exception is thrown that
487 doesn't match the specification. Zero means to treat them as
488 assertions and optimize accordingly, but not check them. */
490 int flag_enforce_eh_specs
= 1;
492 /* If this variable is defined to a non-NULL value, it will be called
493 after the file has been completely parsed. */
495 void (*back_end_hook
) PARAMS ((tree
));
497 /* The variant of the C language being processed. */
499 c_language_kind c_language
= clk_cplusplus
;
501 /* Table of language-dependent -f options.
502 STRING is the option name. VARIABLE is the address of the variable.
503 ON_VALUE is the value to store in VARIABLE
504 if `-fSTRING' is seen as an option.
505 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
507 static struct { const char *string
; int *variable
; int on_value
;}
511 {"signed-char", &flag_signed_char
, 1},
512 {"unsigned-char", &flag_signed_char
, 0},
513 {"signed-bitfields", &flag_signed_bitfields
, 1},
514 {"unsigned-bitfields", &flag_signed_bitfields
, 0},
515 {"short-enums", &flag_short_enums
, 1},
516 {"short-double", &flag_short_double
, 1},
517 {"short-wchar", &flag_short_wchar
, 1},
518 {"cond-mismatch", &flag_cond_mismatch
, 1},
519 {"asm", &flag_no_asm
, 0},
520 {"builtin", &flag_no_builtin
, 0},
522 /* C++-only options. */
523 {"access-control", &flag_access_control
, 1},
524 {"check-new", &flag_check_new
, 1},
525 {"conserve-space", &flag_conserve_space
, 1},
526 {"const-strings", &flag_const_strings
, 1},
527 {"default-inline", &flag_default_inline
, 1},
528 {"dollars-in-identifiers", &dollars_in_ident
, 1},
529 {"elide-constructors", &flag_elide_constructors
, 1},
530 {"enforce-eh-specs", &flag_enforce_eh_specs
, 1},
531 {"external-templates", &flag_external_templates
, 1},
532 {"for-scope", &flag_new_for_scope
, 2},
533 {"gnu-keywords", &flag_no_gnu_keywords
, 0},
534 {"handle-exceptions", &flag_exceptions
, 1},
535 {"honor-std", &flag_honor_std
, 1},
536 {"huge-objects", &flag_huge_objects
, 1},
537 {"implement-inlines", &flag_implement_inlines
, 1},
538 {"implicit-inline-templates", &flag_implicit_inline_templates
, 1},
539 {"implicit-templates", &flag_implicit_templates
, 1},
540 {"labels-ok", &flag_labels_ok
, 1},
541 {"ms-extensions", &flag_ms_extensions
, 1},
542 {"nonansi-builtins", &flag_no_nonansi_builtin
, 0},
543 {"operator-names", &flag_operator_names
, 1},
544 {"optional-diags", &flag_optional_diags
, 1},
545 {"permissive", &flag_permissive
, 1},
546 {"repo", &flag_use_repository
, 1},
547 {"rtti", &flag_rtti
, 1},
548 {"squangle", &flag_do_squangling
, 1},
549 {"stats", &flag_detailed_statistics
, 1},
550 {"use-cxa-atexit", &flag_use_cxa_atexit
, 1},
551 {"vtable-gc", &flag_vtable_gc
, 1},
552 {"vtable-thunks", &flag_vtable_thunks
, 1},
553 {"weak", &flag_weak
, 1},
554 {"xref", &flag_gnu_xref
, 1}
557 /* The list of `-f' options that we no longer support. The `-f'
558 prefix is not given in this table. The `-fno-' variants are not
559 listed here. This table must be kept in alphabetical order. */
560 static const char * const unsupported_options
[] = {
569 /* Compare two option strings, pointed two by P1 and P2, for use with
573 compare_options (p1
, p2
)
577 return strcmp (*((const char *const *) p1
), *((const char *const *) p2
));
580 /* Decode the string P as a language-specific option.
581 Return the number of strings consumed for a valid option.
582 Otherwise return 0. Should not complain if it does not
583 recognise the option. */
586 lang_decode_option (argc
, argv
)
594 int strings_processed
;
595 const char *p
= argv
[0];
597 strings_processed
= cpp_handle_option (&parse_in
, argc
, argv
);
599 strings_processed
= 0;
600 #endif /* ! USE_CPPLIB */
602 if (!strcmp (p
, "-ftraditional") || !strcmp (p
, "-traditional"))
604 else if (p
[0] == '-' && p
[1] == 'f')
606 /* Some kind of -f option.
607 P's value is the option sans `-f'.
608 Search for it in the table of options. */
609 const char *option_value
= NULL
;
610 const char *positive_option
;
614 /* Try special -f options. */
616 /* See if this is one of the options no longer supported. We
617 used to support these options, so we continue to accept them,
619 if (strncmp (p
, "no-", strlen ("no-")) == 0)
620 positive_option
= p
+ strlen ("no-");
624 /* If the option is present, issue a warning. Indicate to our
625 caller that the option was processed successfully. */
626 if (bsearch (&positive_option
,
628 (sizeof (unsupported_options
)
629 / sizeof (unsupported_options
[0])),
630 sizeof (unsupported_options
[0]),
633 warning ("-f%s is no longer supported", p
);
637 if (!strcmp (p
, "handle-exceptions")
638 || !strcmp (p
, "no-handle-exceptions"))
639 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
640 else if (! strcmp (p
, "alt-external-templates"))
642 flag_external_templates
= 1;
643 flag_alt_external_templates
= 1;
644 cp_deprecated ("-falt-external-templates");
646 else if (! strcmp (p
, "no-alt-external-templates"))
647 flag_alt_external_templates
= 0;
648 else if (!strcmp (p
, "repo"))
650 flag_use_repository
= 1;
651 flag_implicit_templates
= 0;
653 else if (!strcmp (p
, "external-templates"))
655 flag_external_templates
= 1;
656 cp_deprecated ("-fexternal-templates");
658 else if (!strcmp (p
, "new-abi"))
661 flag_do_squangling
= 1;
662 flag_vtable_thunks
= 1;
664 else if (!strcmp (p
, "no-new-abi"))
667 flag_do_squangling
= 0;
669 else if ((option_value
670 = skip_leading_substring (p
, "template-depth-")))
672 = read_integral_parameter (option_value
, p
- 2, max_tinst_depth
);
673 else if ((option_value
674 = skip_leading_substring (p
, "name-mangling-version-")))
675 name_mangling_version
676 = read_integral_parameter (option_value
, p
- 2, name_mangling_version
);
677 else if ((option_value
678 = skip_leading_substring (p
, "dump-translation-unit-")))
681 error ("no file specified with -fdump-translation-unit");
683 flag_dump_translation_unit
= option_value
;
690 !found
&& j
< (sizeof (lang_f_options
)
691 / sizeof (lang_f_options
[0]));
694 if (!strcmp (p
, lang_f_options
[j
].string
))
696 *lang_f_options
[j
].variable
= lang_f_options
[j
].on_value
;
697 /* A goto here would be cleaner,
698 but breaks the vax pcc. */
701 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-'
702 && ! strcmp (p
+3, lang_f_options
[j
].string
))
704 *lang_f_options
[j
].variable
= ! lang_f_options
[j
].on_value
;
712 else if (p
[0] == '-' && p
[1] == 'W')
716 /* The -W options control the warning behavior of the compiler. */
719 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-')
722 if (!strcmp (p
, "implicit"))
723 warn_implicit
= setting
;
724 else if (!strcmp (p
, "long-long"))
725 warn_long_long
= setting
;
726 else if (!strcmp (p
, "return-type"))
727 warn_return_type
= setting
;
728 else if (!strcmp (p
, "ctor-dtor-privacy"))
729 warn_ctor_dtor_privacy
= setting
;
730 else if (!strcmp (p
, "write-strings"))
731 warn_write_strings
= setting
;
732 else if (!strcmp (p
, "cast-qual"))
733 warn_cast_qual
= setting
;
734 else if (!strcmp (p
, "char-subscripts"))
735 warn_char_subscripts
= setting
;
736 else if (!strcmp (p
, "pointer-arith"))
737 warn_pointer_arith
= setting
;
738 else if (!strcmp (p
, "missing-prototypes"))
739 warn_missing_prototypes
= setting
;
740 else if (!strcmp (p
, "strict-prototypes"))
743 warning ("-Wno-strict-prototypes is not supported in C++");
745 else if (!strcmp (p
, "redundant-decls"))
746 warn_redundant_decls
= setting
;
747 else if (!strcmp (p
, "missing-braces"))
748 warn_missing_braces
= setting
;
749 else if (!strcmp (p
, "sign-compare"))
750 warn_sign_compare
= setting
;
751 else if (!strcmp (p
, "float-equal"))
752 warn_float_equal
= setting
;
753 else if (!strcmp (p
, "format"))
754 warn_format
= setting
;
755 else if (!strcmp (p
, "conversion"))
756 warn_conversion
= setting
;
757 else if (!strcmp (p
, "parentheses"))
758 warn_parentheses
= setting
;
759 else if (!strcmp (p
, "non-virtual-dtor"))
760 warn_nonvdtor
= setting
;
761 else if (!strcmp (p
, "extern-inline"))
762 warn_extern_inline
= setting
;
763 else if (!strcmp (p
, "reorder"))
764 warn_reorder
= setting
;
765 else if (!strcmp (p
, "synth"))
766 warn_synth
= setting
;
767 else if (!strcmp (p
, "pmf-conversions"))
768 warn_pmf2ptr
= setting
;
769 else if (!strcmp (p
, "effc++"))
771 else if (!strcmp (p
, "sign-promo"))
772 warn_sign_promo
= setting
;
773 else if (!strcmp (p
, "old-style-cast"))
774 warn_old_style_cast
= setting
;
775 else if (!strcmp (p
, "overloaded-virtual"))
776 warn_overloaded_virtual
= setting
;
777 else if (!strcmp (p
, "multichar"))
778 warn_multichar
= setting
;
779 else if (!strcmp (p
, "unknown-pragmas"))
780 /* Set to greater than 1, so that even unknown pragmas in
781 system headers will be warned about. */
782 warn_unknown_pragmas
= setting
* 2;
783 else if (!strcmp (p
, "non-template-friend"))
784 warn_nontemplate_friend
= setting
;
785 else if (!strcmp (p
, "deprecated"))
786 warn_deprecated
= setting
;
787 else if (!strcmp (p
, "comment"))
788 ; /* cpp handles this one. */
789 else if (!strcmp (p
, "comments"))
790 ; /* cpp handles this one. */
791 else if (!strcmp (p
, "trigraphs"))
792 ; /* cpp handles this one. */
793 else if (!strcmp (p
, "import"))
794 ; /* cpp handles this one. */
795 else if (!strcmp (p
, "all"))
797 warn_return_type
= setting
;
798 set_Wunused (setting
);
799 warn_implicit
= setting
;
800 warn_switch
= setting
;
801 warn_format
= setting
;
802 warn_parentheses
= setting
;
803 warn_missing_braces
= setting
;
804 warn_sign_compare
= setting
;
805 warn_multichar
= setting
;
806 /* We save the value of warn_uninitialized, since if they put
807 -Wuninitialized on the command line, we need to generate a
808 warning about not using it without also specifying -O. */
809 if (warn_uninitialized
!= 1)
810 warn_uninitialized
= (setting
? 2 : 0);
811 /* Only warn about unknown pragmas that are not in system
813 warn_unknown_pragmas
= 1;
815 /* C++-specific warnings. */
816 warn_ctor_dtor_privacy
= setting
;
817 warn_nonvdtor
= setting
;
818 warn_reorder
= setting
;
819 warn_nontemplate_friend
= setting
;
821 else return strings_processed
;
823 else if (!strcmp (p
, "-ansi"))
824 flag_no_nonansi_builtin
= 1, flag_ansi
= 1,
825 flag_no_gnu_keywords
= 1;
827 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
828 it's probably safe to assume no sane person would ever want to use this
829 under normal circumstances. */
830 else if (!strcmp (p
, "-spew-debug"))
834 return strings_processed
;
839 /* Incorporate `const' and `volatile' qualifiers for member functions.
840 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
841 QUALS is a list of qualifiers. Returns any explicit
842 top-level qualifiers of the method's this pointer, anything other than
843 TYPE_UNQUALIFIED will be an extension. */
846 grok_method_quals (ctype
, function
, quals
)
847 tree ctype
, function
, quals
;
849 tree fntype
= TREE_TYPE (function
);
850 tree raises
= TYPE_RAISES_EXCEPTIONS (fntype
);
851 int type_quals
= TYPE_UNQUALIFIED
;
852 int dup_quals
= TYPE_UNQUALIFIED
;
853 int this_quals
= TYPE_UNQUALIFIED
;
857 int tq
= cp_type_qual_from_rid (TREE_VALUE (quals
));
859 if ((type_quals
| this_quals
) & tq
)
861 else if (tq
& TYPE_QUAL_RESTRICT
)
865 quals
= TREE_CHAIN (quals
);
869 if (dup_quals
!= TYPE_UNQUALIFIED
)
870 cp_error ("duplicate type qualifiers in %s declaration",
871 TREE_CODE (function
) == FUNCTION_DECL
872 ? "member function" : "type");
874 ctype
= cp_build_qualified_type (ctype
, type_quals
);
875 fntype
= build_cplus_method_type (ctype
, TREE_TYPE (fntype
),
876 (TREE_CODE (fntype
) == METHOD_TYPE
877 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype
))
878 : TYPE_ARG_TYPES (fntype
)));
880 fntype
= build_exception_variant (fntype
, raises
);
882 TREE_TYPE (function
) = fntype
;
886 /* Warn when -fexternal-templates is used and #pragma
887 interface/implementation is not used all the times it should be,
891 warn_if_unknown_interface (decl
)
894 static int already_warned
= 0;
895 if (already_warned
++)
898 if (flag_alt_external_templates
)
900 tree til
= tinst_for_decl ();
902 const char *sf
= input_filename
;
906 lineno
= TINST_LINE (til
);
907 input_filename
= TINST_FILE (til
);
909 cp_warning ("template `%#D' instantiated in file without #pragma interface",
915 cp_warning_at ("template `%#D' defined in file without #pragma interface",
919 /* A subroutine of the parser, to handle a component list. */
922 grok_x_components (specs
)
925 struct pending_inline
**p
;
928 specs
= strip_attrs (specs
);
930 check_tag_decl (specs
);
931 t
= groktypename (build_decl_list (specs
, NULL_TREE
));
933 /* The only case where we need to do anything additional here is an
934 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
935 if (t
== NULL_TREE
|| !ANON_AGGR_TYPE_P (t
))
938 fixup_anonymous_aggr (t
);
939 finish_member_declaration (build_decl (FIELD_DECL
, NULL_TREE
, t
));
941 /* Ignore any inline function definitions in the anonymous union
942 since an anonymous union may not have function members. */
943 p
= &pending_inlines
;
944 for (; *p
; *p
= (*p
)->next
)
945 if (DECL_CONTEXT ((*p
)->fndecl
) != t
)
949 /* Returns a PARM_DECL for a parameter of the indicated TYPE, with the
953 build_artificial_parm (name
, type
)
959 parm
= build_decl (PARM_DECL
, name
, type
);
960 DECL_ARTIFICIAL (parm
) = 1;
961 DECL_ARG_TYPE (parm
) = type
;
965 /* Constructors for types with virtual baseclasses need an "in-charge" flag
966 saying whether this constructor is responsible for initialization of
967 virtual baseclasses or not. All destructors also need this "in-charge"
968 flag, which additionally determines whether or not the destructor should
969 free the memory for the object.
971 This function adds the "in-charge" flag to member function FN if
972 appropriate. It is called from grokclassfn and tsubst.
973 FN must be either a constructor or destructor. */
976 maybe_retrofit_in_chrg (fn
)
979 tree basetype
, arg_types
, parms
, parm
, fntype
;
981 /* If we've already add the in-charge parameter don't do it again. */
982 if (DECL_HAS_IN_CHARGE_PARM_P (fn
))
985 /* When processing templates we can't know, in general, whether or
986 not we're going to have virtual baseclasses. */
987 if (uses_template_parms (fn
))
990 /* We don't need an in-charge parameter for constructors that don't
991 have virtual bases. */
992 if (DECL_CONSTRUCTOR_P (fn
)
993 && !TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn
)))
996 /* First add it to DECL_ARGUMENTS... */
997 parm
= build_artificial_parm (in_charge_identifier
, integer_type_node
);
998 TREE_READONLY (parm
) = 1;
999 parms
= DECL_ARGUMENTS (fn
);
1000 TREE_CHAIN (parm
) = TREE_CHAIN (parms
);
1001 TREE_CHAIN (parms
) = parm
;
1003 /* ...and then to TYPE_ARG_TYPES. */
1004 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1005 basetype
= TREE_TYPE (TREE_VALUE (arg_types
));
1006 arg_types
= hash_tree_chain (integer_type_node
, TREE_CHAIN (arg_types
));
1007 fntype
= build_cplus_method_type (basetype
, TREE_TYPE (TREE_TYPE (fn
)),
1009 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)))
1010 fntype
= build_exception_variant (fntype
,
1011 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)));
1012 TREE_TYPE (fn
) = fntype
;
1014 /* Now we've got the in-charge parameter. */
1015 DECL_HAS_IN_CHARGE_PARM_P (fn
) = 1;
1017 /* If this is a subobject constructor or destructor, our caller will
1018 pass us a pointer to our VTT. */
1019 if (flag_new_abi
&& TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn
)))
1021 DECL_VTT_PARM (fn
) = build_artificial_parm (vtt_parm_identifier
,
1023 DECL_CONTEXT (DECL_VTT_PARM (fn
)) = fn
;
1024 DECL_USE_VTT_PARM (fn
) = build_artificial_parm (NULL_TREE
,
1026 DECL_CONTEXT (DECL_USE_VTT_PARM (fn
)) = fn
;
1030 /* Classes overload their constituent function names automatically.
1031 When a function name is declared in a record structure,
1032 its name is changed to it overloaded name. Since names for
1033 constructors and destructors can conflict, we place a leading
1034 '$' for destructors.
1036 CNAME is the name of the class we are grokking for.
1038 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
1040 FLAGS contains bits saying what's special about today's
1041 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
1043 If FUNCTION is a destructor, then we must add the `auto-delete' field
1044 as a second parameter. There is some hair associated with the fact
1045 that we must "declare" this variable in the manner consistent with the
1046 way the rest of the arguments were declared.
1048 QUALS are the qualifiers for the this pointer. */
1051 grokclassfn (ctype
, function
, flags
, quals
)
1052 tree ctype
, function
;
1053 enum overload_flags flags
;
1056 tree fn_name
= DECL_NAME (function
);
1057 int this_quals
= TYPE_UNQUALIFIED
;
1059 /* Even within an `extern "C"' block, members get C++ linkage. See
1060 [dcl.link] for details. */
1061 DECL_LANGUAGE (function
) = lang_cplusplus
;
1063 if (fn_name
== NULL_TREE
)
1065 error ("name missing for member function");
1066 fn_name
= get_identifier ("<anonymous>");
1067 DECL_NAME (function
) = fn_name
;
1071 this_quals
= grok_method_quals (ctype
, function
, quals
);
1073 if (TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1075 /* Must add the class instance variable up front. */
1076 /* Right now we just make this a pointer. But later
1077 we may wish to make it special. */
1078 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function
)));
1082 /* The `this' parameter is implicitly `const'; it cannot be
1084 this_quals
|= TYPE_QUAL_CONST
;
1085 qual_type
= cp_build_qualified_type (type
, this_quals
);
1086 parm
= build_artificial_parm (this_identifier
, qual_type
);
1087 c_apply_type_quals_to_decl (this_quals
, parm
);
1089 /* We can make this a register, so long as we don't
1090 accidentally complain if someone tries to take its address. */
1091 DECL_REGISTER (parm
) = 1;
1092 TREE_CHAIN (parm
) = last_function_parms
;
1093 last_function_parms
= parm
;
1096 DECL_ARGUMENTS (function
) = last_function_parms
;
1097 DECL_CONTEXT (function
) = ctype
;
1099 if (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
))
1100 maybe_retrofit_in_chrg (function
);
1102 if (flags
== DTOR_FLAG
)
1104 DECL_DESTRUCTOR_P (function
) = 1;
1107 set_mangled_name_for_decl (function
);
1109 DECL_ASSEMBLER_NAME (function
) = build_destructor_name (ctype
);
1111 TYPE_HAS_DESTRUCTOR (ctype
) = 1;
1114 set_mangled_name_for_decl (function
);
1117 /* Work on the expr used by alignof (this is only called by the parser). */
1126 if (processing_template_decl
)
1127 return build_min (ALIGNOF_EXPR
, sizetype
, expr
);
1129 if (TREE_CODE (expr
) == COMPONENT_REF
1130 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
1131 error ("`__alignof__' applied to a bit-field");
1133 if (TREE_CODE (expr
) == INDIRECT_REF
)
1135 best
= t
= TREE_OPERAND (expr
, 0);
1136 bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1138 while (TREE_CODE (t
) == NOP_EXPR
1139 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
1142 t
= TREE_OPERAND (t
, 0);
1143 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1144 if (thisalign
> bestalign
)
1145 best
= t
, bestalign
= thisalign
;
1147 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
1150 return c_alignof (TREE_TYPE (expr
));
1153 /* Create an ARRAY_REF, checking for the user doing things backwards
1157 grok_array_decl (array_expr
, index_exp
)
1158 tree array_expr
, index_exp
;
1160 tree type
= TREE_TYPE (array_expr
);
1161 tree p1
, p2
, i1
, i2
;
1163 if (type
== error_mark_node
|| index_exp
== error_mark_node
)
1164 return error_mark_node
;
1165 if (processing_template_decl
)
1166 return build_min (ARRAY_REF
, type
? TREE_TYPE (type
) : NULL_TREE
,
1167 array_expr
, index_exp
);
1169 if (type
== NULL_TREE
)
1171 /* Something has gone very wrong. Assume we are mistakenly reducing
1172 an expression instead of a declaration. */
1173 error ("parser may be lost: is there a '{' missing somewhere?");
1177 if (TREE_CODE (type
) == OFFSET_TYPE
1178 || TREE_CODE (type
) == REFERENCE_TYPE
)
1179 type
= TREE_TYPE (type
);
1181 /* If they have an `operator[]', use that. */
1182 if (IS_AGGR_TYPE (type
) || IS_AGGR_TYPE (TREE_TYPE (index_exp
)))
1183 return build_opfncall (ARRAY_REF
, LOOKUP_NORMAL
,
1184 array_expr
, index_exp
, NULL_TREE
);
1186 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1187 is a little-known fact that, if `a' is an array and `i' is an
1188 int, you can write `i[a]', which means the same thing as `a[i]'. */
1190 if (TREE_CODE (type
) == ARRAY_TYPE
)
1193 p1
= build_expr_type_conversion (WANT_POINTER
, array_expr
, 0);
1195 if (TREE_CODE (TREE_TYPE (index_exp
)) == ARRAY_TYPE
)
1198 p2
= build_expr_type_conversion (WANT_POINTER
, index_exp
, 0);
1200 i1
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, array_expr
, 0);
1201 i2
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, index_exp
, 0);
1203 if ((p1
&& i2
) && (i1
&& p2
))
1204 error ("ambiguous conversion for array subscript");
1207 array_expr
= p1
, index_exp
= i2
;
1209 array_expr
= p2
, index_exp
= i1
;
1212 cp_error ("invalid types `%T[%T]' for array subscript",
1213 type
, TREE_TYPE (index_exp
));
1214 return error_mark_node
;
1217 if (array_expr
== error_mark_node
|| index_exp
== error_mark_node
)
1218 error ("ambiguous conversion for array subscript");
1220 return build_array_ref (array_expr
, index_exp
);
1223 /* Given the cast expression EXP, checking out its validity. Either return
1224 an error_mark_node if there was an unavoidable error, return a cast to
1225 void for trying to delete a pointer w/ the value 0, or return the
1226 call to delete. If DOING_VEC is 1, we handle things differently
1227 for doing an array delete. If DOING_VEC is 2, they gave us the
1228 array size as an argument to delete.
1229 Implements ARM $5.3.4. This is called from the parser. */
1232 delete_sanity (exp
, size
, doing_vec
, use_global_delete
)
1234 int doing_vec
, use_global_delete
;
1237 /* For a regular vector delete (aka, no size argument) we will pass
1238 this down as a NULL_TREE into build_vec_delete. */
1239 tree maxindex
= NULL_TREE
;
1241 if (exp
== error_mark_node
)
1244 if (processing_template_decl
)
1246 t
= build_min (DELETE_EXPR
, void_type_node
, exp
, size
);
1247 DELETE_EXPR_USE_GLOBAL (t
) = use_global_delete
;
1248 DELETE_EXPR_USE_VEC (t
) = doing_vec
;
1252 if (TREE_CODE (exp
) == OFFSET_REF
)
1253 exp
= resolve_offset_ref (exp
);
1254 exp
= convert_from_reference (exp
);
1255 t
= stabilize_reference (exp
);
1256 t
= build_expr_type_conversion (WANT_POINTER
, t
, 1);
1258 if (t
== NULL_TREE
|| t
== error_mark_node
)
1260 cp_error ("type `%#T' argument given to `delete', expected pointer",
1262 return error_mark_node
;
1267 maxindex
= cp_build_binary_op (MINUS_EXPR
, size
, integer_one_node
);
1268 pedwarn ("anachronistic use of array size in vector delete");
1271 type
= TREE_TYPE (t
);
1273 /* As of Valley Forge, you can delete a pointer to const. */
1275 /* You can't delete functions. */
1276 if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
1278 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
1279 return error_mark_node
;
1282 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1283 if (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
)
1285 cp_warning ("deleting `%T' is undefined", type
);
1289 /* An array can't have been allocated by new, so complain. */
1290 if (TREE_CODE (t
) == ADDR_EXPR
1291 && TREE_CODE (TREE_OPERAND (t
, 0)) == VAR_DECL
1292 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == ARRAY_TYPE
)
1293 cp_warning ("deleting array `%#D'", TREE_OPERAND (t
, 0));
1295 /* Deleting a pointer with the value zero is valid and has no effect. */
1296 if (integer_zerop (t
))
1297 return build1 (NOP_EXPR
, void_type_node
, t
);
1300 return build_vec_delete (t
, maxindex
, sfk_deleting_destructor
,
1304 if (IS_AGGR_TYPE (TREE_TYPE (type
))
1305 && TYPE_GETS_REG_DELETE (TREE_TYPE (type
)))
1307 /* Only do access checking here; we'll be calling op delete
1308 from the destructor. */
1309 tree tmp
= build_op_delete_call (DELETE_EXPR
, t
, size_zero_node
,
1310 LOOKUP_NORMAL
, NULL_TREE
);
1311 if (tmp
== error_mark_node
)
1312 return error_mark_node
;
1315 return build_delete (type
, t
, sfk_deleting_destructor
,
1316 LOOKUP_NORMAL
, use_global_delete
);
1320 /* Report an error if the indicated template declaration is not the
1321 sort of thing that should be a member template. */
1324 check_member_template (tmpl
)
1329 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
1330 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1332 if (TREE_CODE (decl
) == FUNCTION_DECL
1333 || (TREE_CODE (decl
) == TYPE_DECL
1334 && IS_AGGR_TYPE (TREE_TYPE (decl
))))
1336 if (current_function_decl
)
1337 /* 14.5.2.2 [temp.mem]
1339 A local class shall not have member templates. */
1340 cp_error ("invalid declaration of member template `%#D' in local class",
1343 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
1345 /* 14.5.2.3 [temp.mem]
1347 A member function template shall not be virtual. */
1349 ("invalid use of `virtual' in template declaration of `%#D'",
1351 DECL_VIRTUAL_P (decl
) = 0;
1354 /* The debug-information generating code doesn't know what to do
1355 with member templates. */
1356 DECL_IGNORED_P (tmpl
) = 1;
1359 cp_error ("template declaration of `%#D'", decl
);
1362 /* Return true iff TYPE is a valid Java parameter or return type. */
1365 acceptable_java_type (type
)
1368 if (TREE_CODE (type
) == VOID_TYPE
|| TYPE_FOR_JAVA (type
))
1370 if (TREE_CODE (type
) == POINTER_TYPE
)
1372 type
= TREE_TYPE (type
);
1373 if (TREE_CODE (type
) == RECORD_TYPE
)
1376 if (! TYPE_FOR_JAVA (type
))
1378 if (! CLASSTYPE_TEMPLATE_INFO (type
))
1380 args
= CLASSTYPE_TI_ARGS (type
);
1381 i
= TREE_VEC_LENGTH (args
);
1384 type
= TREE_VEC_ELT (args
, i
);
1385 if (TREE_CODE (type
) == POINTER_TYPE
)
1386 type
= TREE_TYPE (type
);
1387 if (! TYPE_FOR_JAVA (type
))
1396 /* For a METHOD in a Java class CTYPE, return 1 if
1397 the parameter and return types are valid Java types.
1398 Otherwise, print appropriate error messages, and return 0. */
1401 check_java_method (method
)
1405 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (method
));
1406 tree ret_type
= TREE_TYPE (TREE_TYPE (method
));
1407 if (! acceptable_java_type (ret_type
))
1409 cp_error ("Java method '%D' has non-Java return type `%T'",
1413 for (; arg_types
!= NULL_TREE
; arg_types
= TREE_CHAIN (arg_types
))
1415 tree type
= TREE_VALUE (arg_types
);
1416 if (! acceptable_java_type (type
))
1418 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1423 return jerr
? 0 : 1;
1426 /* Sanity check: report error if this function FUNCTION is not
1427 really a member of the class (CTYPE) it is supposed to belong to.
1428 CNAME is the same here as it is for grokclassfn above. */
1431 check_classfn (ctype
, function
)
1432 tree ctype
, function
;
1434 tree fn_name
= DECL_NAME (function
);
1435 tree fndecl
, fndecls
;
1436 tree method_vec
= CLASSTYPE_METHOD_VEC (complete_type (ctype
));
1440 if (DECL_USE_TEMPLATE (function
)
1441 && !(TREE_CODE (function
) == TEMPLATE_DECL
1442 && DECL_TEMPLATE_SPECIALIZATION (function
))
1443 && is_member_template (DECL_TI_TEMPLATE (function
)))
1444 /* Since this is a specialization of a member template,
1445 we're not going to find the declaration in the class.
1448 struct S { template <typename T> void f(T); };
1449 template <> void S::f(int);
1451 we're not going to find `S::f(int)', but there's no
1452 reason we should, either. We let our callers know we didn't
1453 find the method, but we don't complain. */
1456 if (method_vec
!= 0)
1458 methods
= &TREE_VEC_ELT (method_vec
, 0);
1459 end
= TREE_VEC_END (method_vec
);
1461 /* First suss out ctors and dtors. */
1462 if (*methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1463 && DECL_CONSTRUCTOR_P (function
))
1465 if (*++methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1466 && DECL_DESTRUCTOR_P (function
))
1469 while (++methods
!= end
&& *methods
)
1472 if (fn_name
== DECL_NAME (OVL_CURRENT (*methods
)))
1475 for (fndecls
= *methods
; fndecls
!= NULL_TREE
;
1476 fndecls
= OVL_NEXT (fndecls
))
1478 fndecl
= OVL_CURRENT (fndecls
);
1479 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1480 for a for member function of a template class, is
1481 not mangled, so the check below does not work
1482 correctly in that case. Since mangled destructor
1483 names do not include the type of the arguments,
1484 we can't use this short-cut for them, either.
1485 (It's not legal to declare arguments for a
1486 destructor, but some people try.) */
1487 if (!DECL_DESTRUCTOR_P (function
)
1488 && (DECL_ASSEMBLER_NAME (function
)
1489 != DECL_NAME (function
))
1490 && (DECL_ASSEMBLER_NAME (fndecl
)
1491 != DECL_NAME (fndecl
))
1492 && (DECL_ASSEMBLER_NAME (function
)
1493 == DECL_ASSEMBLER_NAME (fndecl
)))
1496 /* We cannot simply call decls_match because this
1497 doesn't work for static member functions that are
1498 pretending to be methods, and because the name
1499 may have been changed by asm("new_name"). */
1500 if (DECL_NAME (function
) == DECL_NAME (fndecl
))
1502 tree p1
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1503 tree p2
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1505 /* Get rid of the this parameter on functions that become
1507 if (DECL_STATIC_FUNCTION_P (fndecl
)
1508 && TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1509 p1
= TREE_CHAIN (p1
);
1511 if (same_type_p (TREE_TYPE (TREE_TYPE (function
)),
1512 TREE_TYPE (TREE_TYPE (fndecl
)))
1513 && compparms (p1
, p2
)
1514 && (DECL_TEMPLATE_SPECIALIZATION (function
)
1515 == DECL_TEMPLATE_SPECIALIZATION (fndecl
))
1516 && (!DECL_TEMPLATE_SPECIALIZATION (function
)
1517 || (DECL_TI_TEMPLATE (function
)
1518 == DECL_TI_TEMPLATE (fndecl
))))
1527 if (methods
!= end
&& *methods
)
1529 tree fndecl
= *methods
;
1530 cp_error ("prototype for `%#D' does not match any in class `%T'",
1532 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl
) ? "s are" : " is",
1533 OVL_CURRENT (fndecl
));
1534 while (fndecl
= OVL_NEXT (fndecl
), fndecl
)
1535 cp_error_at (" %#D", OVL_CURRENT(fndecl
));
1540 if (!COMPLETE_TYPE_P (ctype
))
1541 incomplete_type_error (function
, ctype
);
1543 cp_error ("no `%#D' member function declared in class `%T'",
1547 /* If we did not find the method in the class, add it to avoid
1548 spurious errors (unless the CTYPE is not yet defined, in which
1549 case we'll only confuse ourselves when the function is declared
1550 properly within the class. */
1551 if (COMPLETE_TYPE_P (ctype
))
1552 add_method (ctype
, methods
, function
);
1556 /* We have just processed the DECL, which is a static data member.
1557 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1558 present, is the assembly-language name for the data member.
1559 FLAGS is as for cp_finish_decl. */
1562 finish_static_data_member_decl (decl
, init
, asmspec_tree
, flags
)
1568 const char *asmspec
= 0;
1571 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1573 my_friendly_assert (TREE_PUBLIC (decl
), 0);
1575 DECL_CONTEXT (decl
) = current_class_type
;
1577 /* We cannot call pushdecl here, because that would fill in the
1578 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1579 the right thing, namely, to put this decl out straight away. */
1580 /* current_class_type can be NULL_TREE in case of error. */
1581 if (!asmspec
&& current_class_type
)
1583 DECL_INITIAL (decl
) = error_mark_node
;
1585 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
1587 DECL_ASSEMBLER_NAME (decl
)
1588 = build_static_name (current_class_type
, DECL_NAME (decl
));
1590 if (! processing_template_decl
)
1592 if (!pending_statics
)
1593 VARRAY_TREE_INIT (pending_statics
, 32, "pending_statics");
1594 VARRAY_PUSH_TREE (pending_statics
, decl
);
1597 /* Static consts need not be initialized in the class definition. */
1598 if (init
!= NULL_TREE
&& TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
1600 static int explanation
= 0;
1602 error ("initializer invalid for static member with constructor");
1603 if (explanation
++ == 0)
1604 error ("(you really want to initialize it separately)");
1607 /* Force the compiler to know when an uninitialized static const
1608 member is being used. */
1609 if (CP_TYPE_CONST_P (TREE_TYPE (decl
)) && init
== 0)
1610 TREE_USED (decl
) = 1;
1611 DECL_INITIAL (decl
) = init
;
1612 DECL_IN_AGGR_P (decl
) = 1;
1614 cp_finish_decl (decl
, init
, asmspec_tree
, flags
);
1617 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1618 of a structure component, returning a FIELD_DECL node.
1619 QUALS is a list of type qualifiers for this decl (such as for declaring
1620 const member functions).
1622 This is done during the parsing of the struct declaration.
1623 The FIELD_DECL nodes are chained together and the lot of them
1624 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1628 If class A defines that certain functions in class B are friends, then
1629 the way I have set things up, it is B who is interested in permission
1630 granted by A. However, it is in A's context that these declarations
1631 are parsed. By returning a void_type_node, class A does not attempt
1632 to incorporate the declarations of the friends within its structure.
1634 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1635 CHANGES TO CODE IN `start_method'. */
1638 grokfield (declarator
, declspecs
, init
, asmspec_tree
, attrlist
)
1639 tree declarator
, declspecs
, init
, asmspec_tree
, attrlist
;
1641 register tree value
;
1642 const char *asmspec
= 0;
1643 int flags
= LOOKUP_ONLYCONVERTING
;
1645 /* Convert () initializers to = initializers. */
1646 if (init
== NULL_TREE
&& declarator
!= NULL_TREE
1647 && TREE_CODE (declarator
) == CALL_EXPR
1648 && TREE_OPERAND (declarator
, 0)
1649 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) == IDENTIFIER_NODE
1650 || TREE_CODE (TREE_OPERAND (declarator
, 0)) == SCOPE_REF
)
1651 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator
)))
1653 /* It's invalid to try to initialize a data member using a
1654 functional notation, e.g.:
1660 Explain that to the user. */
1661 static int explained_p
;
1663 cp_error ("invalid data member initiailization");
1666 cp_error ("use `=' to initialize static data members");
1670 declarator
= TREE_OPERAND (declarator
, 0);
1674 if (declspecs
== NULL_TREE
1675 && TREE_CODE (declarator
) == SCOPE_REF
1676 && TREE_CODE (TREE_OPERAND (declarator
, 1)) == IDENTIFIER_NODE
)
1678 /* Access declaration */
1679 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator
, 0))))
1681 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
1682 pop_nested_class ();
1683 return do_class_using_decl (declarator
);
1687 && TREE_CODE (init
) == TREE_LIST
1688 && TREE_VALUE (init
) == error_mark_node
1689 && TREE_CHAIN (init
) == NULL_TREE
)
1692 value
= grokdeclarator (declarator
, declspecs
, FIELD
, init
!= 0, attrlist
);
1693 if (! value
|| value
== error_mark_node
)
1694 /* friend or constructor went bad. */
1696 if (TREE_TYPE (value
) == error_mark_node
)
1697 return error_mark_node
;
1699 /* Pass friendly classes back. */
1700 if (TREE_CODE (value
) == VOID_TYPE
)
1701 return void_type_node
;
1703 if (DECL_NAME (value
) != NULL_TREE
1704 && IDENTIFIER_POINTER (DECL_NAME (value
))[0] == '_'
1705 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value
)), "_vptr"))
1706 cp_error ("member `%D' conflicts with virtual function table field name",
1709 /* Stash away type declarations. */
1710 if (TREE_CODE (value
) == TYPE_DECL
)
1712 DECL_NONLOCAL (value
) = 1;
1713 DECL_CONTEXT (value
) = current_class_type
;
1715 /* Now that we've updated the context, we need to remangle the
1716 name for this TYPE_DECL. */
1717 DECL_ASSEMBLER_NAME (value
) = DECL_NAME (value
);
1718 if (!uses_template_parms (value
))
1721 DECL_ASSEMBLER_NAME (value
) = mangle_type (TREE_TYPE (value
));
1723 DECL_ASSEMBLER_NAME (value
) =
1724 get_identifier (build_overload_name (TREE_TYPE (value
), 1, 1));
1727 if (processing_template_decl
)
1728 value
= push_template_decl (value
);
1733 if (DECL_IN_AGGR_P (value
))
1735 cp_error ("`%D' is already defined in `%T'", value
,
1736 DECL_CONTEXT (value
));
1737 return void_type_node
;
1741 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1745 if (TREE_CODE (value
) == FUNCTION_DECL
)
1747 grok_function_init (value
, init
);
1750 else if (pedantic
&& TREE_CODE (value
) != VAR_DECL
)
1751 /* Already complained in grokdeclarator. */
1755 /* We allow initializers to become parameters to base
1757 if (TREE_CODE (init
) == TREE_LIST
)
1759 if (TREE_CHAIN (init
) == NULL_TREE
)
1760 init
= TREE_VALUE (init
);
1762 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1765 if (TREE_CODE (init
) == CONST_DECL
)
1766 init
= DECL_INITIAL (init
);
1767 else if (TREE_READONLY_DECL_P (init
))
1768 init
= decl_constant_value (init
);
1769 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1770 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1771 if (init
== error_mark_node
)
1772 /* We must make this look different than `error_mark_node'
1773 because `decl_const_value' would mis-interpret it
1774 as only meaning that this VAR_DECL is defined. */
1775 init
= build1 (NOP_EXPR
, TREE_TYPE (value
), init
);
1776 else if (processing_template_decl
)
1778 else if (! TREE_CONSTANT (init
))
1780 /* We can allow references to things that are effectively
1781 static, since references are initialized with the address. */
1782 if (TREE_CODE (TREE_TYPE (value
)) != REFERENCE_TYPE
1783 || (TREE_STATIC (init
) == 0
1784 && (!DECL_P (init
) || DECL_EXTERNAL (init
) == 0)))
1786 error ("field initializer is not constant");
1787 init
= error_mark_node
;
1793 if (processing_template_decl
&& ! current_function_decl
1794 && (TREE_CODE (value
) == VAR_DECL
|| TREE_CODE (value
) == FUNCTION_DECL
))
1795 value
= push_template_decl (value
);
1798 cplus_decl_attributes (value
, TREE_PURPOSE (attrlist
),
1799 TREE_VALUE (attrlist
));
1801 if (TREE_CODE (value
) == VAR_DECL
)
1803 finish_static_data_member_decl (value
, init
, asmspec_tree
,
1807 if (TREE_CODE (value
) == FIELD_DECL
)
1811 /* This must override the asm specifier which was placed
1812 by grokclassfn. Lay this out fresh. */
1813 DECL_RTL (value
) = NULL_RTX
;
1814 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1816 if (DECL_INITIAL (value
) == error_mark_node
)
1817 init
= error_mark_node
;
1818 cp_finish_decl (value
, init
, asmspec_tree
, flags
);
1819 DECL_INITIAL (value
) = init
;
1820 DECL_IN_AGGR_P (value
) = 1;
1823 if (TREE_CODE (value
) == FUNCTION_DECL
)
1827 /* This must override the asm specifier which was placed
1828 by grokclassfn. Lay this out fresh. */
1829 DECL_RTL (value
) = NULL_RTX
;
1830 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1832 cp_finish_decl (value
, init
, asmspec_tree
, flags
);
1834 /* Pass friends back this way. */
1835 if (DECL_FRIEND_P (value
))
1836 return void_type_node
;
1838 DECL_IN_AGGR_P (value
) = 1;
1841 my_friendly_abort (21);
1846 /* Like `grokfield', but for bitfields.
1847 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1850 grokbitfield (declarator
, declspecs
, width
)
1851 tree declarator
, declspecs
, width
;
1853 register tree value
= grokdeclarator (declarator
, declspecs
, BITFIELD
,
1856 if (! value
) return NULL_TREE
; /* friends went bad. */
1858 /* Pass friendly classes back. */
1859 if (TREE_CODE (value
) == VOID_TYPE
)
1860 return void_type_node
;
1862 if (TREE_CODE (value
) == TYPE_DECL
)
1864 cp_error ("cannot declare `%D' to be a bitfield type", value
);
1868 /* Usually, finish_struct_1 catches bitifields with invalid types.
1869 But, in the case of bitfields with function type, we confuse
1870 ourselves into thinking they are member functions, so we must
1872 if (TREE_CODE (value
) == FUNCTION_DECL
)
1874 cp_error ("cannot declare bitfield `%D' with funcion type",
1879 if (DECL_IN_AGGR_P (value
))
1881 cp_error ("`%D' is already defined in the class %T", value
,
1882 DECL_CONTEXT (value
));
1883 return void_type_node
;
1886 GNU_xref_member (current_class_name
, value
);
1888 if (TREE_STATIC (value
))
1890 cp_error ("static member `%D' cannot be a bitfield", value
);
1893 cp_finish_decl (value
, NULL_TREE
, NULL_TREE
, 0);
1895 if (width
!= error_mark_node
)
1897 constant_expression_warning (width
);
1898 DECL_INITIAL (value
) = width
;
1899 SET_DECL_C_BIT_FIELD (value
);
1902 DECL_IN_AGGR_P (value
) = 1;
1907 grokoptypename (declspecs
, declarator
)
1908 tree declspecs
, declarator
;
1910 tree t
= grokdeclarator (declarator
, declspecs
, TYPENAME
, 0, NULL_TREE
);
1912 return mangle_conv_op_name_for_type (t
);
1914 return build_typename_overload (t
);
1917 /* When a function is declared with an initializer,
1918 do the right thing. Currently, there are two possibilities:
1923 // initialization possibility #1.
1924 virtual void f () = 0;
1946 // initialization possibility #2
1953 copy_assignment_arg_p (parmtype
, virtualp
)
1955 int virtualp ATTRIBUTE_UNUSED
;
1957 if (current_class_type
== NULL_TREE
)
1960 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
1961 parmtype
= TREE_TYPE (parmtype
);
1963 if ((TYPE_MAIN_VARIANT (parmtype
) == current_class_type
)
1965 /* Non-standard hack to support old Booch components. */
1966 || (! virtualp
&& DERIVED_FROM_P (parmtype
, current_class_type
))
1975 grok_function_init (decl
, init
)
1979 /* An initializer for a function tells how this function should
1981 tree type
= TREE_TYPE (decl
);
1983 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1984 cp_error ("initializer specified for non-member function `%D'", decl
);
1986 /* We'll check for this in finish_struct_1. */
1987 else if (DECL_VINDEX (decl
) == NULL_TREE
)
1988 cp_error ("initializer specified for non-virtual member function `%D'", decl
);
1990 else if (integer_zerop (init
))
1993 /* Mark this function as being "defined". */
1994 DECL_INITIAL (decl
) = error_mark_node
;
1995 /* pure virtual destructors must be defined. */
1996 /* pure virtual needs to be defined (as abort) only when put in
1997 vtbl. For wellformed call, it should be itself. pr4737 */
1998 if (!DECL_DESTRUCTOR_P (decl
)))
2000 /* Give this node rtl from `abort'. */
2001 DECL_RTL (decl
) = DECL_RTL (abort_fndecl
);
2004 DECL_PURE_VIRTUAL_P (decl
) = 1;
2005 if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
2008 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
))));
2010 if (copy_assignment_arg_p (parmtype
, 1))
2011 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type
) = 1;
2015 cp_error ("invalid initializer for virtual method `%D'", decl
);
2019 cplus_decl_attributes (decl
, attributes
, prefix_attributes
)
2020 tree decl
, attributes
, prefix_attributes
;
2022 if (decl
== NULL_TREE
|| decl
== void_type_node
)
2025 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2026 decl
= DECL_TEMPLATE_RESULT (decl
);
2028 decl_attributes (decl
, attributes
, prefix_attributes
);
2030 if (TREE_CODE (decl
) == TYPE_DECL
)
2031 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl
), TREE_TYPE (decl
));
2034 /* CONSTRUCTOR_NAME:
2035 Return the name for the constructor (or destructor) for the
2036 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
2037 IDENTIFIER_NODE. When given a template, this routine doesn't
2038 lose the specialization. */
2041 constructor_name_full (thing
)
2044 if (TREE_CODE (thing
) == TEMPLATE_TYPE_PARM
2045 || TREE_CODE (thing
) == TEMPLATE_TEMPLATE_PARM
2046 || TREE_CODE (thing
) == TYPENAME_TYPE
)
2047 thing
= TYPE_NAME (thing
);
2048 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing
)))
2050 if (TYPE_WAS_ANONYMOUS (thing
) && TYPE_HAS_CONSTRUCTOR (thing
))
2051 thing
= DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing
), 0)));
2053 thing
= TYPE_NAME (thing
);
2055 if (TREE_CODE (thing
) == TYPE_DECL
2056 || (TREE_CODE (thing
) == TEMPLATE_DECL
2057 && TREE_CODE (DECL_TEMPLATE_RESULT (thing
)) == TYPE_DECL
))
2058 thing
= DECL_NAME (thing
);
2059 my_friendly_assert (TREE_CODE (thing
) == IDENTIFIER_NODE
, 197);
2063 /* CONSTRUCTOR_NAME:
2064 Return the name for the constructor (or destructor) for the
2065 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
2066 IDENTIFIER_NODE. When given a template, return the plain
2067 unspecialized name. */
2070 constructor_name (thing
)
2074 thing
= constructor_name_full (thing
);
2075 t
= IDENTIFIER_TEMPLATE (thing
);
2081 /* Defer the compilation of the FN until the end of compilation. */
2087 if (DECL_DEFERRED_FN (fn
))
2089 DECL_DEFERRED_FN (fn
) = 1;
2091 VARRAY_TREE_INIT (deferred_fns
, 32, "deferred_fns");
2093 VARRAY_PUSH_TREE (deferred_fns
, fn
);
2096 /* Hand off a unique name which can be used for variable we don't really
2097 want to know about anyway, for example, the anonymous variables which
2098 are needed to make references work. Declare this thing so we can use it.
2099 The variable created will be of type TYPE, and will have internal
2103 get_temp_name (type
)
2106 char buf
[sizeof (AUTO_TEMP_FORMAT
) + 20];
2108 int toplev
= toplevel_bindings_p ();
2110 sprintf (buf
, AUTO_TEMP_FORMAT
, global_temp_name_counter
++);
2111 decl
= build_decl (VAR_DECL
, get_identifier (buf
), type
);
2112 DECL_ARTIFICIAL (decl
) = 1;
2113 TREE_USED (decl
) = 1;
2114 TREE_STATIC (decl
) = 1;
2116 decl
= pushdecl_top_level (decl
);
2118 /* If this is a local variable, then lay out its rtl now.
2119 Otherwise, callers of this function are responsible for dealing
2120 with this variable's rtl. */
2124 my_friendly_assert (DECL_INITIAL (decl
) == NULL_TREE
,
2131 /* Hunts through the global anonymous union ANON_DECL, building
2132 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2133 returns a VAR_DECL whose size is the same as the size of the
2134 ANON_DECL, if one is available. */
2137 build_anon_union_vars (anon_decl
, elems
, static_p
, external_p
)
2143 tree type
= TREE_TYPE (anon_decl
);
2144 tree main_decl
= NULL_TREE
;
2147 /* Rather than write the code to handle the non-union case,
2148 just give an error. */
2149 if (TREE_CODE (type
) != UNION_TYPE
)
2150 error ("anonymous struct not inside named type");
2152 for (field
= TYPE_FIELDS (type
);
2154 field
= TREE_CHAIN (field
))
2158 if (DECL_ARTIFICIAL (field
))
2160 if (TREE_CODE (field
) != FIELD_DECL
)
2162 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2167 if (TREE_PRIVATE (field
))
2168 cp_pedwarn_at ("private member `%#D' in anonymous union", field
);
2169 else if (TREE_PROTECTED (field
))
2170 cp_pedwarn_at ("protected member `%#D' in anonymous union", field
);
2172 if (DECL_NAME (field
) == NULL_TREE
2173 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2175 decl
= build_anon_union_vars (field
, elems
, static_p
, external_p
);
2179 else if (DECL_NAME (field
) == NULL_TREE
)
2183 decl
= build_decl (VAR_DECL
, DECL_NAME (field
), TREE_TYPE (field
));
2184 /* tell `pushdecl' that this is not tentative. */
2185 DECL_INITIAL (decl
) = error_mark_node
;
2186 TREE_PUBLIC (decl
) = 0;
2187 TREE_STATIC (decl
) = static_p
;
2188 DECL_EXTERNAL (decl
) = external_p
;
2189 decl
= pushdecl (decl
);
2190 DECL_INITIAL (decl
) = NULL_TREE
;
2193 /* Only write out one anon union element--choose the one that
2194 can hold them all. */
2195 if (main_decl
== NULL_TREE
2196 && simple_cst_equal (DECL_SIZE (decl
),
2197 DECL_SIZE (anon_decl
)) == 1)
2200 /* ??? This causes there to be no debug info written out
2202 TREE_ASM_WRITTEN (decl
) = 1;
2204 if (DECL_NAME (field
) == NULL_TREE
2205 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2206 /* The remainder of the processing was already done in the
2210 /* If there's a cleanup to do, it belongs in the
2211 TREE_PURPOSE of the following TREE_LIST. */
2212 *elems
= tree_cons (NULL_TREE
, decl
, *elems
);
2213 TREE_TYPE (*elems
) = type
;
2219 /* Finish off the processing of a UNION_TYPE structure.
2220 If there are static members, then all members are
2221 static, and must be laid out together. If the
2222 union is an anonymous union, we arrange for that
2223 as well. PUBLIC_P is nonzero if this union is
2224 not declared static. */
2227 finish_anon_union (anon_union_decl
)
2228 tree anon_union_decl
;
2230 tree type
= TREE_TYPE (anon_union_decl
);
2232 int public_p
= TREE_PUBLIC (anon_union_decl
);
2233 int static_p
= TREE_STATIC (anon_union_decl
);
2234 int external_p
= DECL_EXTERNAL (anon_union_decl
);
2236 if (TYPE_FIELDS (type
) == NULL_TREE
)
2241 error ("namespace-scope anonymous aggregates must be static");
2245 main_decl
= build_anon_union_vars (anon_union_decl
,
2246 &DECL_ANON_UNION_ELEMS (anon_union_decl
),
2247 static_p
, external_p
);
2249 if (main_decl
== NULL_TREE
)
2251 warning ("anonymous aggregate with no members");
2257 make_decl_rtl (main_decl
, 0, toplevel_bindings_p ());
2258 DECL_RTL (anon_union_decl
) = DECL_RTL (main_decl
);
2259 expand_anon_union_decl (anon_union_decl
,
2261 DECL_ANON_UNION_ELEMS (anon_union_decl
));
2264 add_decl_stmt (anon_union_decl
);
2267 /* Finish processing a builtin type TYPE. It's name is NAME,
2268 its fields are in the array FIELDS. LEN is the number of elements
2269 in FIELDS minus one, or put another way, it is the maximum subscript
2272 It is given the same alignment as ALIGN_TYPE. */
2275 finish_builtin_type (type
, name
, fields
, len
, align_type
)
2284 TYPE_FIELDS (type
) = fields
[0];
2285 for (i
= 0; i
< len
; i
++)
2287 layout_type (TREE_TYPE (fields
[i
]));
2288 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2289 TREE_CHAIN (fields
[i
]) = fields
[i
+1];
2291 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2292 TYPE_ALIGN (type
) = TYPE_ALIGN (align_type
);
2293 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (align_type
);
2295 #if 0 /* not yet, should get fixed properly later */
2296 TYPE_NAME (type
) = make_type_decl (get_identifier (name
), type
);
2298 TYPE_NAME (type
) = build_decl (TYPE_DECL
, get_identifier (name
), type
);
2300 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2301 layout_decl (TYPE_NAME (type
), 0);
2304 /* Auxiliary functions to make type signatures for
2305 `operator new' and `operator delete' correspond to
2306 what compiler will be expecting. */
2309 coerce_new_type (type
)
2314 if (TREE_CODE (type
) == METHOD_TYPE
)
2315 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (TYPE_ARG_TYPES (type
)));
2316 if (! same_type_p (TREE_TYPE (type
), ptr_type_node
))
2317 e1
= 1, error ("`operator new' must return type `void *'");
2319 /* Technically the type must be `size_t', but we may not know
2321 if (TYPE_ARG_TYPES (type
) == NULL_TREE
)
2322 e1
= 1, error ("`operator new' takes type `size_t' parameter");
2323 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type
)), sizetype
))
2324 e2
= 1, error ("`operator new' takes type `size_t' as first parameter");
2326 type
= build_function_type (ptr_type_node
, tree_cons (NULL_TREE
, sizetype
, TREE_CHAIN (TYPE_ARG_TYPES (type
))));
2328 type
= build_function_type (ptr_type_node
, TYPE_ARG_TYPES (type
));
2333 coerce_delete_type (type
)
2340 tree arg_types
= TYPE_ARG_TYPES (type
);
2342 if (TREE_CODE (type
) == METHOD_TYPE
)
2344 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (arg_types
));
2345 arg_types
= TREE_CHAIN (arg_types
);
2348 if (TREE_TYPE (type
) != void_type_node
)
2349 e1
= 1, error ("`operator delete' must return type `void'");
2351 if (arg_types
== NULL_TREE
2352 || ! same_type_p (TREE_VALUE (arg_types
), ptr_type_node
))
2353 e2
= 1, error ("`operator delete' takes type `void *' as first parameter");
2357 && TREE_CHAIN (arg_types
)
2358 && TREE_CHAIN (arg_types
) != void_list_node
)
2360 /* Again, technically this argument must be `size_t', but again
2361 we may not know what that is. */
2362 tree t2
= TREE_VALUE (TREE_CHAIN (arg_types
));
2363 if (! same_type_p (t2
, sizetype
))
2364 e3
= 1, error ("second argument to `operator delete' must be of type `size_t'");
2365 else if (TREE_CHAIN (TREE_CHAIN (arg_types
)) != void_list_node
)
2368 if (TREE_CHAIN (TREE_CHAIN (arg_types
)))
2369 error ("too many arguments in declaration of `operator delete'");
2371 error ("`...' invalid in specification of `operator delete'");
2376 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2377 build_tree_list (NULL_TREE
, sizetype
));
2380 if (arg_types
== NULL_TREE
)
2381 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
2383 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, TREE_CHAIN (arg_types
));
2389 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2390 arg_types
? TREE_CHAIN (arg_types
): NULL_TREE
);
2392 type
= build_function_type (void_type_node
, arg_types
);
2398 mark_vtable_entries (decl
)
2401 tree entries
= CONSTRUCTOR_ELTS (DECL_INITIAL (decl
));
2403 for (; entries
; entries
= TREE_CHAIN (entries
))
2408 fnaddr
= (flag_vtable_thunks
? TREE_VALUE (entries
)
2409 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries
)));
2411 if (TREE_CODE (fnaddr
) != ADDR_EXPR
)
2412 /* This entry is an offset: a virtual base class offset, a
2413 virtual call offset, and RTTI offset, etc. */
2416 fn
= TREE_OPERAND (fnaddr
, 0);
2417 TREE_ADDRESSABLE (fn
) = 1;
2418 /* When we don't have vcall offsets, we output thunks whenever
2419 we output the vtables that contain them. With vcall offsets,
2420 we know all the thunks we'll need when we emit a virtual
2421 function, so we emit the thunks there instead. */
2422 if (DECL_THUNK_P (fn
))
2423 use_thunk (fn
, THUNK_GENERATE_WITH_VTABLE_P (fn
));
2428 /* Set DECL up to have the closest approximation of "initialized common"
2429 linkage available. */
2432 comdat_linkage (decl
)
2436 make_decl_one_only (decl
);
2437 else if (TREE_CODE (decl
) == FUNCTION_DECL
|| DECL_VIRTUAL_P (decl
))
2438 /* We can just emit functions and vtables statically; it doesn't really
2439 matter if we have multiple copies. */
2440 TREE_PUBLIC (decl
) = 0;
2443 /* Static data member template instantiations, however, cannot
2444 have multiple copies. */
2445 if (DECL_INITIAL (decl
) == 0
2446 || DECL_INITIAL (decl
) == error_mark_node
)
2447 DECL_COMMON (decl
) = 1;
2448 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
2450 DECL_COMMON (decl
) = 1;
2451 DECL_INITIAL (decl
) = error_mark_node
;
2455 /* We can't do anything useful; leave vars for explicit
2457 DECL_EXTERNAL (decl
) = 1;
2458 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2462 if (DECL_LANG_SPECIFIC (decl
))
2463 DECL_COMDAT (decl
) = 1;
2466 /* For win32 we also want to put explicit instantiations in
2467 linkonce sections, so that they will be merged with implicit
2468 instantiations; otherwise we get duplicate symbol errors. */
2471 maybe_make_one_only (decl
)
2474 /* We used to say that this was not necessary on targets that support weak
2475 symbols, because the implicit instantiations will defer to the explicit
2476 one. However, that's not actually the case in SVR4; a strong definition
2477 after a weak one is an error. Also, not making explicit
2478 instantiations one_only means that we can end up with two copies of
2479 some template instantiations. */
2480 if (! supports_one_only ())
2483 /* We can't set DECL_COMDAT on functions, or finish_file will think
2484 we can get away with not emitting them if they aren't used. We need
2485 to for variables so that cp_finish_decl will update their linkage,
2486 because their DECL_INITIAL may not have been set properly yet. */
2488 make_decl_one_only (decl
);
2490 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_LANG_SPECIFIC (decl
))
2491 DECL_COMDAT (decl
) = 1;
2494 /* Returns the virtual function with which the vtable for TYPE is
2495 emitted, or NULL_TREE if that heuristic is not applicable to TYPE. */
2503 if (TYPE_FOR_JAVA (type
)
2504 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
2505 || CLASSTYPE_INTERFACE_KNOWN (type
))
2508 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
2509 method
= TREE_CHAIN (method
))
2510 if (DECL_VINDEX (method
) != NULL_TREE
2511 && ! DECL_THIS_INLINE (method
)
2512 && ! DECL_PURE_VIRTUAL_P (method
))
2518 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2519 based on TYPE and other static flags.
2521 Note that anything public is tagged TREE_PUBLIC, whether
2522 it's public in this file or in another one. */
2525 import_export_vtable (decl
, type
, final
)
2529 if (DECL_INTERFACE_KNOWN (decl
))
2532 if (TYPE_FOR_JAVA (type
))
2534 TREE_PUBLIC (decl
) = 1;
2535 DECL_EXTERNAL (decl
) = 1;
2536 DECL_INTERFACE_KNOWN (decl
) = 1;
2538 else if (CLASSTYPE_INTERFACE_KNOWN (type
))
2540 TREE_PUBLIC (decl
) = 1;
2541 DECL_EXTERNAL (decl
) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type
);
2542 DECL_INTERFACE_KNOWN (decl
) = 1;
2546 /* We can only wait to decide if we have real non-inline virtual
2547 functions in our class, or if we come from a template. */
2549 int found
= (CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
2550 || key_method (type
));
2552 if (final
|| ! found
)
2554 comdat_linkage (decl
);
2555 DECL_EXTERNAL (decl
) = 0;
2559 TREE_PUBLIC (decl
) = 1;
2560 DECL_EXTERNAL (decl
) = 1;
2565 /* Determine whether or not we want to specifically import or export CTYPE,
2566 using various heuristics. */
2569 import_export_class (ctype
)
2572 /* -1 for imported, 1 for exported. */
2573 int import_export
= 0;
2575 /* It only makes sense to call this function at EOF. The reason is
2576 that this function looks at whether or not the first non-inline
2577 non-abstract virtual member function has been defined in this
2578 translation unit. But, we can't possibly know that until we've
2579 seen the entire translation unit. */
2580 my_friendly_assert (at_eof
, 20000226);
2582 if (CLASSTYPE_INTERFACE_KNOWN (ctype
))
2585 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2586 we will have CLASSTYPE_INTERFACE_ONLY set but not
2587 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2588 heuristic because someone will supply a #pragma implementation
2589 elsewhere, and deducing it here would produce a conflict. */
2590 if (CLASSTYPE_INTERFACE_ONLY (ctype
))
2593 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2594 /* FIXME this should really use some sort of target-independent macro. */
2595 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype
)))
2597 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype
)))
2601 /* If we got -fno-implicit-templates, we import template classes that
2602 weren't explicitly instantiated. */
2603 if (import_export
== 0
2604 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype
)
2605 && ! flag_implicit_templates
)
2608 /* Base our import/export status on that of the first non-inline,
2609 non-pure virtual function, if any. */
2610 if (import_export
== 0
2611 && TYPE_POLYMORPHIC_P (ctype
))
2613 tree method
= key_method (ctype
);
2615 import_export
= (DECL_REALLY_EXTERN (method
) ? -1 : 1);
2618 #ifdef MULTIPLE_SYMBOL_SPACES
2619 if (import_export
== -1)
2625 SET_CLASSTYPE_INTERFACE_KNOWN (ctype
);
2626 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype
) = (import_export
> 0);
2627 CLASSTYPE_INTERFACE_ONLY (ctype
) = (import_export
< 0);
2631 /* We need to describe to the assembler the relationship between
2632 a vtable and the vtable of the parent class. */
2635 output_vtable_inherit (vars
)
2641 op
[0] = XEXP (DECL_RTL (vars
), 0); /* strip the mem ref */
2643 parent
= binfo_for_vtable (vars
);
2645 if (parent
== TYPE_BINFO (DECL_CONTEXT (vars
)))
2649 parent
= get_vtbl_decl_for_binfo (TYPE_BINFO (BINFO_TYPE (parent
)));
2650 op
[1] = XEXP (DECL_RTL (parent
), 0); /* strip the mem ref */
2653 my_friendly_abort (980826);
2655 output_asm_insn (".vtable_inherit %c0, %c1", op
);
2659 finish_vtable_vardecl (t
, data
)
2661 void *data ATTRIBUTE_UNUSED
;
2664 tree ctype
= DECL_CONTEXT (vars
);
2665 import_export_class (ctype
);
2666 import_export_vtable (vars
, ctype
, 1);
2668 if (! DECL_EXTERNAL (vars
)
2669 && DECL_NEEDED_P (vars
)
2670 && ! TREE_ASM_WRITTEN (vars
))
2672 if (TREE_TYPE (vars
) == void_type_node
)
2673 /* It is a dummy vtable made by get_vtable_decl. Ignore it. */
2677 mark_vtable_entries (vars
);
2678 if (TREE_TYPE (DECL_INITIAL (vars
)) == 0)
2679 store_init_value (vars
, DECL_INITIAL (vars
));
2681 if (write_symbols
== DWARF_DEBUG
|| write_symbols
== DWARF2_DEBUG
)
2683 /* Mark the VAR_DECL node representing the vtable itself as a
2684 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2685 It is rather important that such things be ignored because
2686 any effort to actually generate DWARF for them will run
2687 into trouble when/if we encounter code like:
2690 struct S { virtual void member (); };
2692 because the artificial declaration of the vtable itself (as
2693 manufactured by the g++ front end) will say that the vtable
2694 is a static member of `S' but only *after* the debug output
2695 for the definition of `S' has already been output. This causes
2696 grief because the DWARF entry for the definition of the vtable
2697 will try to refer back to an earlier *declaration* of the
2698 vtable as a static member of `S' and there won't be one.
2699 We might be able to arrange to have the "vtable static member"
2700 attached to the member list for `S' before the debug info for
2701 `S' get written (which would solve the problem) but that would
2702 require more intrusive changes to the g++ front end. */
2704 DECL_IGNORED_P (vars
) = 1;
2707 /* Always make vtables weak. */
2709 comdat_linkage (vars
);
2711 rest_of_decl_compilation (vars
, NULL_PTR
, 1, 1);
2714 output_vtable_inherit (vars
);
2716 /* Because we're only doing syntax-checking, we'll never end up
2717 actually marking the variable as written. */
2718 if (flag_syntax_only
)
2719 TREE_ASM_WRITTEN (vars
) = 1;
2721 /* Since we're writing out the vtable here, also write the debug
2723 note_debug_info_needed (ctype
);
2728 /* If the references to this class' vtables were optimized away, still
2729 emit the appropriate debugging information. See dfs_debug_mark. */
2730 if (DECL_COMDAT (vars
)
2731 && CLASSTYPE_DEBUG_REQUESTED (ctype
))
2732 note_debug_info_needed (ctype
);
2738 prune_vtable_vardecl (t
, data
)
2740 void *data ATTRIBUTE_UNUSED
;
2742 *t
= TREE_CHAIN (*t
);
2746 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2747 inline function or template instantiation at end-of-file. */
2750 import_export_decl (decl
)
2753 if (DECL_INTERFACE_KNOWN (decl
))
2756 if (DECL_TEMPLATE_INSTANTIATION (decl
)
2757 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2759 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2760 if ((DECL_IMPLICIT_INSTANTIATION (decl
)
2761 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2762 && (flag_implicit_templates
2763 || (flag_implicit_inline_templates
&& DECL_THIS_INLINE (decl
))))
2765 if (!TREE_PUBLIC (decl
))
2766 /* Templates are allowed to have internal linkage. See
2770 comdat_linkage (decl
);
2773 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2775 else if (DECL_FUNCTION_MEMBER_P (decl
))
2777 tree ctype
= DECL_CONTEXT (decl
);
2778 import_export_class (ctype
);
2779 if (CLASSTYPE_INTERFACE_KNOWN (ctype
)
2781 ? (! DECL_THIS_INLINE (decl
))
2782 : (! DECL_ARTIFICIAL (decl
) || DECL_VINDEX (decl
))))
2784 DECL_NOT_REALLY_EXTERN (decl
)
2785 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2786 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2787 && !DECL_VINDEX (decl
)));
2789 /* Always make artificials weak. */
2790 if (DECL_ARTIFICIAL (decl
) && flag_weak
)
2791 comdat_linkage (decl
);
2793 maybe_make_one_only (decl
);
2796 comdat_linkage (decl
);
2798 else if (DECL_TINFO_FN_P (decl
))
2800 tree ctype
= TREE_TYPE (DECL_NAME (decl
));
2802 if (IS_AGGR_TYPE (ctype
))
2803 import_export_class (ctype
);
2805 if (IS_AGGR_TYPE (ctype
) && CLASSTYPE_INTERFACE_KNOWN (ctype
)
2806 && TYPE_POLYMORPHIC_P (ctype
)
2807 /* If -fno-rtti, we're not necessarily emitting this stuff with
2808 the class, so go ahead and emit it now. This can happen
2809 when a class is used in exception handling. */
2811 /* If the type is a cv-qualified variant of a type, then we
2812 must emit the tinfo function in this translation unit
2813 since it will not be emitted when the vtable for the type
2814 is output (which is when the unqualified version is
2816 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2818 DECL_NOT_REALLY_EXTERN (decl
)
2819 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2820 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2821 && !DECL_VINDEX (decl
)));
2823 /* Always make artificials weak. */
2825 comdat_linkage (decl
);
2827 else if (TYPE_BUILT_IN (ctype
)
2828 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2829 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2831 comdat_linkage (decl
);
2834 comdat_linkage (decl
);
2836 DECL_INTERFACE_KNOWN (decl
) = 1;
2840 build_cleanup (decl
)
2844 tree type
= TREE_TYPE (decl
);
2846 if (TREE_CODE (type
) == ARRAY_TYPE
)
2850 mark_addressable (decl
);
2851 temp
= build1 (ADDR_EXPR
, build_pointer_type (type
), decl
);
2853 temp
= build_delete (TREE_TYPE (temp
), temp
,
2854 sfk_complete_destructor
,
2855 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
2859 /* Returns the initialization guard variable for the variable DECL,
2860 which has static storage duration. */
2869 /* For a local variable, under the old ABI, we do not try to get a
2870 unique mangled name for the DECL. */
2871 if (!flag_new_abi
&& !DECL_NAMESPACE_SCOPE_P (decl
))
2873 guard
= get_temp_name (integer_type_node
);
2874 cp_finish_decl (guard
, NULL_TREE
, NULL_TREE
, 0);
2879 /* For struct X foo __attribute__((weak)), there is a counter
2880 __snfoo. Since base is already an assembler name, sname should
2881 be globally unique */
2882 sname
= get_id_2 ("__sn", DECL_ASSEMBLER_NAME (decl
));
2884 sname
= mangle_guard_variable (decl
);
2886 guard
= IDENTIFIER_GLOBAL_VALUE (sname
);
2891 /* Under the new ABI, we use a type that is big enough to
2892 contain a mutex as well as an integer counter. */
2894 guard_type
= long_long_integer_type_node
;
2896 guard_type
= integer_type_node
;
2898 guard
= build_decl (VAR_DECL
, sname
, guard_type
);
2899 TREE_PUBLIC (guard
) = 1;
2900 DECL_ARTIFICIAL (guard
) = 1;
2901 TREE_STATIC (guard
) = 1;
2902 TREE_USED (guard
) = 1;
2903 DECL_COMMON (guard
) = 1;
2904 pushdecl_top_level (guard
);
2905 cp_finish_decl (guard
, NULL_TREE
, NULL_TREE
, 0);
2910 /* Return those bits of the GUARD variable that should be set when the
2911 guarded entity is actually initialized. */
2914 get_guard_bits (guard
)
2920 /* Under the new ABI, we only set the first byte of the guard,
2921 in order to leave room for a mutex in the high-order bits. */
2922 guard
= build1 (ADDR_EXPR
,
2923 build_pointer_type (TREE_TYPE (guard
)),
2925 guard
= build1 (NOP_EXPR
,
2926 build_pointer_type (char_type_node
),
2928 guard
= build1 (INDIRECT_REF
, char_type_node
, guard
);
2933 /* Return an expression which determines whether or not the GUARD
2934 variable has already been initialized. */
2937 get_guard_cond (guard
)
2942 /* Check to see if the GUARD is zero. */
2943 guard
= get_guard_bits (guard
);
2944 guard_value
= integer_zero_node
;
2945 if (!same_type_p (TREE_TYPE (guard_value
), TREE_TYPE (guard
)))
2946 guard_value
= convert (TREE_TYPE (guard
), guard_value
);
2947 return cp_build_binary_op (EQ_EXPR
, guard
, guard_value
);
2950 /* Return an expression which sets the GUARD variable, indicating that
2951 the variable being guarded has been initialized. */
2959 /* Set the GUARD to one. */
2960 guard
= get_guard_bits (guard
);
2961 guard_init
= integer_one_node
;
2962 if (!same_type_p (TREE_TYPE (guard_init
), TREE_TYPE (guard
)))
2963 guard_init
= convert (TREE_TYPE (guard
), guard_init
);
2964 return build_modify_expr (guard
, NOP_EXPR
, guard_init
);
2967 /* Start the process of running a particular set of global constructors
2968 or destructors. Subroutine of do_[cd]tors. */
2971 start_objects (method_type
, initp
)
2972 int method_type
, initp
;
2978 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2980 if (initp
!= DEFAULT_INIT_PRIORITY
)
2990 sprintf (type
, "%c%c%.5u", method_type
, joiner
, initp
);
2993 sprintf (type
, "%c", method_type
);
2995 fnname
= get_file_function_name_long (type
);
2997 start_function (void_list_node
,
2998 make_call_declarator (fnname
, void_list_node
, NULL_TREE
,
3000 NULL_TREE
, SF_DEFAULT
);
3002 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
3003 /* It can be a static function as long as collect2 does not have
3004 to scan the object file to find its ctor/dtor routine. */
3005 TREE_PUBLIC (current_function_decl
) = 0;
3008 /* Mark this declaration as used to avoid spurious warnings. */
3009 TREE_USED (current_function_decl
) = 1;
3011 /* Mark this function as a global constructor or destructor. */
3012 if (method_type
== 'I')
3013 DECL_GLOBAL_CTOR_P (current_function_decl
) = 1;
3015 DECL_GLOBAL_DTOR_P (current_function_decl
) = 1;
3016 GLOBAL_INIT_PRIORITY (current_function_decl
) = initp
;
3018 body
= begin_compound_stmt (/*has_no_scope=*/0);
3020 /* We cannot allow these functions to be elided, even if they do not
3021 have external linkage. And, there's no point in deferring
3022 copmilation of thes functions; they're all going to have to be
3024 current_function_cannot_inline
3025 = "static constructors and destructors cannot be inlined";
3030 /* Finish the process of running a particular set of global constructors
3031 or destructors. Subroutine of do_[cd]tors. */
3034 finish_objects (method_type
, initp
, body
)
3035 int method_type
, initp
;
3042 finish_compound_stmt(/*has_no_scope=*/0, body
);
3043 fn
= finish_function (0);
3046 /* When only doing semantic analysis, and no RTL generation, we
3047 can't call functions that directly emit assembly code; there is
3048 no assembly file in which to put the code. */
3049 if (flag_syntax_only
)
3052 fnname
= XSTR (XEXP (DECL_RTL (fn
), 0), 0);
3053 if (initp
== DEFAULT_INIT_PRIORITY
)
3055 if (method_type
== 'I')
3056 assemble_constructor (fnname
);
3058 assemble_destructor (fnname
);
3060 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
3061 /* If we're using init priority we can't use assemble_*tor, but on ELF
3062 targets we can stick the references into named sections for GNU ld
3067 sprintf (buf
, ".%ctors.%.5u", method_type
== 'I' ? 'c' : 'd',
3068 /* invert the numbering so the linker puts us in the proper
3069 order; constructors are run from right to left, and the
3070 linker sorts in increasing order. */
3071 MAX_INIT_PRIORITY
- initp
);
3072 named_section (NULL_TREE
, buf
, 0);
3073 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, fnname
),
3074 POINTER_SIZE
/ BITS_PER_UNIT
, 1);
3079 /* The names of the parameters to the function created to handle
3080 initializations and destructions for objects with static storage
3082 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
3083 #define PRIORITY_IDENTIFIER "__priority"
3085 /* The name of the function we create to handle initializations and
3086 destructions for objects with static storage duration. */
3087 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
3089 /* The declaration for the __INITIALIZE_P argument. */
3090 static tree initialize_p_decl
;
3092 /* The declaration for the __PRIORITY argument. */
3093 static tree priority_decl
;
3095 /* The declaration for the static storage duration function. */
3096 static tree ssdf_decl
;
3098 /* All the static storage duration functions created in this
3099 translation unit. */
3100 static varray_type ssdf_decls
;
3102 /* A map from priority levels to information about that priority
3103 level. There may be many such levels, so efficient lookup is
3105 static splay_tree priority_info_map
;
3107 /* Begins the generation of the function that will handle all
3108 initialization and destruction of objects with static storage
3109 duration. The function generated takes two parameters of type
3110 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
3111 non-zero, it performs initializations. Otherwise, it performs
3112 destructions. It only performs those initializations or
3113 destructions with the indicated __PRIORITY. The generated function
3116 It is assumed that this function will only be called once per
3117 translation unit. */
3120 start_static_storage_duration_function ()
3122 static unsigned ssdf_number
;
3127 char id
[sizeof (SSDF_IDENTIFIER
) + 1 /* '\0' */ + 32];
3129 /* Create the identifier for this function. It will be of the form
3130 SSDF_IDENTIFIER_<number>. */
3131 sprintf (id
, "%s_%u", SSDF_IDENTIFIER
, ssdf_number
++);
3132 if (ssdf_number
== 0)
3134 /* Overflow occurred. That means there are at least 4 billion
3135 initialization functions. */
3136 sorry ("too many initialization functions required");
3137 my_friendly_abort (19990430);
3140 /* Create the parameters. */
3141 parm_types
= void_list_node
;
3142 parm_types
= tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
3143 parm_types
= tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
3144 type
= build_function_type (void_type_node
, parm_types
);
3146 /* Create the FUNCTION_DECL itself. */
3147 ssdf_decl
= build_lang_decl (FUNCTION_DECL
,
3148 get_identifier (id
),
3150 TREE_PUBLIC (ssdf_decl
) = 0;
3151 DECL_ARTIFICIAL (ssdf_decl
) = 1;
3153 /* Put this function in the list of functions to be called from the
3154 static constructors and destructors. */
3157 VARRAY_TREE_INIT (ssdf_decls
, 32, "ssdf_decls");
3159 /* Take this opportunity to initialize the map from priority
3160 numbers to information about that priority level. */
3161 priority_info_map
= splay_tree_new (splay_tree_compare_ints
,
3162 /*delete_key_fn=*/0,
3163 /*delete_value_fn=*/
3164 (splay_tree_delete_value_fn
) &free
);
3166 /* We always need to generate functions for the
3167 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
3168 priorities later, we'll be sure to find the
3169 DEFAULT_INIT_PRIORITY. */
3170 get_priority_info (DEFAULT_INIT_PRIORITY
);
3173 VARRAY_PUSH_TREE (ssdf_decls
, ssdf_decl
);
3175 /* Create the argument list. */
3176 initialize_p_decl
= build_decl (PARM_DECL
,
3177 get_identifier (INITIALIZE_P_IDENTIFIER
),
3179 DECL_CONTEXT (initialize_p_decl
) = ssdf_decl
;
3180 DECL_ARG_TYPE (initialize_p_decl
) = integer_type_node
;
3181 TREE_USED (initialize_p_decl
) = 1;
3182 priority_decl
= build_decl (PARM_DECL
, get_identifier (PRIORITY_IDENTIFIER
),
3184 DECL_CONTEXT (priority_decl
) = ssdf_decl
;
3185 DECL_ARG_TYPE (priority_decl
) = integer_type_node
;
3186 TREE_USED (priority_decl
) = 1;
3188 TREE_CHAIN (initialize_p_decl
) = priority_decl
;
3189 DECL_ARGUMENTS (ssdf_decl
) = initialize_p_decl
;
3191 /* Put the function in the global scope. */
3192 pushdecl (ssdf_decl
);
3194 /* Start the function itself. This is equivalent to declarating the
3197 static void __ssdf (int __initialize_p, init __priority_p);
3199 It is static because we only need to call this function from the
3200 various constructor and destructor functions for this module. */
3201 start_function (/*specs=*/NULL_TREE
,
3203 /*attrs=*/NULL_TREE
,
3206 /* Set up the scope of the outermost block in the function. */
3207 body
= begin_compound_stmt (/*has_no_scope=*/0);
3209 /* This function must not be deferred because we are depending on
3210 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3211 current_function_cannot_inline
3212 = "static storage duration functions cannot be inlined";
3217 /* Finish the generation of the function which performs initialization
3218 and destruction of objects with static storage duration. After
3219 this point, no more such objects can be created. */
3222 finish_static_storage_duration_function (body
)
3225 /* Close out the function. */
3226 finish_compound_stmt (/*has_no_scope=*/0, body
);
3227 expand_body (finish_function (0));
3230 /* Return the information about the indicated PRIORITY level. If no
3231 code to handle this level has yet been generated, generate the
3232 appropriate prologue. */
3234 static priority_info
3235 get_priority_info (priority
)
3241 n
= splay_tree_lookup (priority_info_map
,
3242 (splay_tree_key
) priority
);
3245 /* Create a new priority information structure, and insert it
3247 pi
= (priority_info
) xmalloc (sizeof (struct priority_info_s
));
3248 pi
->initializations_p
= 0;
3249 pi
->destructions_p
= 0;
3250 splay_tree_insert (priority_info_map
,
3251 (splay_tree_key
) priority
,
3252 (splay_tree_value
) pi
);
3255 pi
= (priority_info
) n
->value
;
3260 /* Set up to handle the initialization or destruction of DECL. If
3261 INITP is non-zero, we are initializing the variable. Otherwise, we
3262 are destroying it. */
3265 start_static_initialization_or_destruction (decl
, initp
)
3269 tree guard_if_stmt
= NULL_TREE
;
3276 /* Figure out the priority for this declaration. */
3277 priority
= DECL_INIT_PRIORITY (decl
);
3279 priority
= DEFAULT_INIT_PRIORITY
;
3281 /* Remember that we had an initialization or finalization at this
3283 pi
= get_priority_info (priority
);
3285 pi
->initializations_p
= 1;
3287 pi
->destructions_p
= 1;
3289 /* Trick the compiler into thinking we are at the file and line
3290 where DECL was declared so that error-messages make sense, and so
3291 that the debugger will show somewhat sensible file and line
3293 input_filename
= DECL_SOURCE_FILE (decl
);
3294 lineno
= DECL_SOURCE_LINE (decl
);
3300 Access control for implicit calls to the constructors,
3301 the conversion functions, or the destructor called to
3302 create and destroy a static data member is performed as
3303 if these calls appeared in the scope of the member's
3306 we pretend we are in a static member function of the class of
3307 which the DECL is a member. */
3308 if (member_p (decl
))
3310 DECL_CONTEXT (current_function_decl
) = DECL_CONTEXT (decl
);
3311 DECL_STATIC_FUNCTION_P (current_function_decl
) = 1;
3314 /* Conditionalize this initialization on being in the right priority
3315 and being initializing/finalizing appropriately. */
3316 guard_if_stmt
= begin_if_stmt ();
3317 cond
= cp_build_binary_op (EQ_EXPR
,
3319 build_int_2 (priority
, 0));
3320 init_cond
= initp
? integer_one_node
: integer_zero_node
;
3321 init_cond
= cp_build_binary_op (EQ_EXPR
,
3324 cond
= cp_build_binary_op (TRUTH_ANDIF_EXPR
, cond
, init_cond
);
3326 /* Assume we don't need a guard. */
3328 /* We need a guard if this is an object with external linkage that
3329 might be initialized in more than one place. (For example, a
3330 static data member of a template, when the data member requires
3332 if (TREE_PUBLIC (decl
) && (DECL_COMMON (decl
)
3333 || DECL_ONE_ONLY (decl
)
3334 || DECL_WEAK (decl
)))
3338 guard
= get_guard (decl
);
3340 /* When using __cxa_atexit, we just check the GUARD as we would
3341 for a local static. */
3342 if (flag_use_cxa_atexit
)
3344 /* When using __cxa_atexit, we never try to destroy
3345 anything from a static destructor. */
3346 my_friendly_assert (initp
, 20000629);
3347 guard_cond
= get_guard_cond (guard
);
3349 /* Under the old ABI, e do initializations only if the GUARD is
3350 zero, i.e., if we are the first to initialize the variable.
3351 We do destructions only if the GUARD is one, i.e., if we are
3352 the last to destroy the variable. */
3355 = cp_build_binary_op (EQ_EXPR
,
3356 build_unary_op (PREINCREMENT_EXPR
,
3362 = cp_build_binary_op (EQ_EXPR
,
3363 build_unary_op (PREDECREMENT_EXPR
,
3368 cond
= cp_build_binary_op (TRUTH_ANDIF_EXPR
, cond
, guard_cond
);
3371 finish_if_stmt_cond (cond
, guard_if_stmt
);
3373 /* Under the new ABI, we have not already set the GUARD, so we must
3375 if (guard
&& initp
&& flag_new_abi
)
3376 finish_expr_stmt (set_guard (guard
));
3378 return guard_if_stmt
;
3381 /* We've just finished generating code to do an initialization or
3382 finalization. GUARD_IF_STMT is the if-statement we used to guard
3383 the initialization. */
3386 finish_static_initialization_or_destruction (guard_if_stmt
)
3389 finish_then_clause (guard_if_stmt
);
3392 /* Now that we're done with DECL we don't need to pretend to be a
3393 member of its class any longer. */
3394 DECL_CONTEXT (current_function_decl
) = NULL_TREE
;
3395 DECL_STATIC_FUNCTION_P (current_function_decl
) = 0;
3398 /* Generate code to do the static initialization of DECL. The
3399 initialization is INIT. If DECL may be initialized more than once
3400 in different object files, GUARD is the guard variable to
3401 check. PRIORITY is the priority for the initialization. */
3404 do_static_initialization (decl
, init
)
3411 /* Set up for the initialization. */
3413 = start_static_initialization_or_destruction (decl
,
3416 /* Do the initialization itself. */
3417 if (IS_AGGR_TYPE (TREE_TYPE (decl
))
3418 || TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
3419 expr
= build_aggr_init (decl
, init
, 0);
3420 else if (TREE_CODE (init
) == TREE_VEC
)
3421 expr
= build_vec_init (decl
, TREE_VEC_ELT (init
, 0),
3422 TREE_VEC_ELT (init
, 1),
3423 TREE_VEC_ELT (init
, 2), 0);
3426 expr
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
3427 TREE_SIDE_EFFECTS (expr
) = 1;
3429 finish_expr_stmt (expr
);
3431 /* If we're using __cxa_atexit, register a a function that calls the
3432 destructor for the object. */
3433 if (flag_use_cxa_atexit
)
3434 register_dtor_fn (decl
);
3437 finish_static_initialization_or_destruction (guard_if_stmt
);
3440 /* Generate code to do the static destruction of DECL. If DECL may be
3441 initialized more than once in different object files, GUARD is the
3442 guard variable to check. PRIORITY is the priority for the
3446 do_static_destruction (decl
)
3451 /* If we're using __cxa_atexit, then destructors are registered
3452 immediately after objects are initialized. */
3453 my_friendly_assert (!flag_use_cxa_atexit
, 20000121);
3455 /* If we don't need a destructor, there's nothing to do. */
3456 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
3459 /* Actually do the destruction. */
3460 guard_if_stmt
= start_static_initialization_or_destruction (decl
,
3462 finish_expr_stmt (build_cleanup (decl
));
3463 finish_static_initialization_or_destruction (guard_if_stmt
);
3466 /* VARS is a list of variables with static storage duration which may
3467 need initialization and/or finalization. Remove those variables
3468 that don't really need to be initialized or finalized, and return
3469 the resulting list. The order in which the variables appear in
3470 VARS is in reverse order of the order in which they should actually
3471 be initialized. The list we return is in the unreversed order;
3472 i.e., the first variable should be initialized first. */
3475 prune_vars_needing_no_initialization (vars
)
3481 for (var
= vars
, result
= NULL_TREE
;
3483 var
= TREE_CHAIN (var
))
3485 tree decl
= TREE_VALUE (var
);
3486 tree init
= TREE_PURPOSE (var
);
3488 /* Deal gracefully with error. */
3489 if (decl
== error_mark_node
)
3492 /* The only things that can be initialized are variables. */
3493 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 19990420);
3495 /* If this object is not defined, we don't need to do anything
3497 if (DECL_EXTERNAL (decl
))
3500 /* Also, if the initializer already contains errors, we can bail
3502 if (init
&& TREE_CODE (init
) == TREE_LIST
3503 && value_member (error_mark_node
, init
))
3506 /* This variable is going to need initialization and/or
3507 finalization, so we add it to the list. */
3508 result
= tree_cons (init
, decl
, result
);
3514 /* Make sure we have told the back end about all the variables in
3518 write_out_vars (vars
)
3523 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3524 if (! TREE_ASM_WRITTEN (TREE_VALUE (v
)))
3525 rest_of_decl_compilation (TREE_VALUE (v
), 0, 1, 1);
3528 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3529 (otherwise) that will initialize all gobal objects with static
3530 storage duration having the indicated PRIORITY. */
3533 generate_ctor_or_dtor_function (constructor_p
, priority
)
3542 /* We use `I' to indicate initialization and `D' to indicate
3549 /* Begin the function. */
3550 body
= start_objects (function_key
, priority
);
3552 /* Call the static storage duration function with appropriate
3554 for (i
= 0; i
< ssdf_decls
->elements_used
; ++i
)
3556 arguments
= tree_cons (NULL_TREE
, build_int_2 (priority
, 0),
3558 arguments
= tree_cons (NULL_TREE
, build_int_2 (constructor_p
, 0),
3560 finish_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls
, i
),
3564 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3565 calls to any functions marked with attributes indicating that
3566 they should be called at initialization- or destruction-time. */
3567 if (priority
== DEFAULT_INIT_PRIORITY
)
3571 for (fns
= constructor_p
? static_ctors
: static_dtors
;
3573 fns
= TREE_CHAIN (fns
))
3574 finish_expr_stmt (build_function_call (TREE_VALUE (fns
), NULL_TREE
));
3577 /* Close out the function. */
3578 finish_objects (function_key
, priority
, body
);
3581 /* Generate constructor and destructor functions for the priority
3585 generate_ctor_and_dtor_functions_for_priority (n
, data
)
3587 void *data ATTRIBUTE_UNUSED
;
3589 int priority
= (int) n
->key
;
3590 priority_info pi
= (priority_info
) n
->value
;
3592 /* Generate the functions themselves, but only if they are really
3594 if (pi
->initializations_p
3595 || (priority
== DEFAULT_INIT_PRIORITY
&& static_ctors
))
3596 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3598 if (pi
->destructions_p
3599 || (priority
== DEFAULT_INIT_PRIORITY
&& static_dtors
))
3600 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3603 /* Keep iterating. */
3607 /* This routine is called from the last rule in yyparse ().
3608 Its job is to create all the code needed to initialize and
3609 destroy the global aggregates. We do the destruction
3610 first, since that way we only need to reverse the decls once. */
3621 /* Bad parse errors. Just forget about it. */
3622 if (! global_bindings_p () || current_class_type
|| decl_namespace_list
)
3625 /* Otherwise, GDB can get confused, because in only knows
3626 about source for LINENO-1 lines. */
3629 interface_unknown
= 1;
3632 /* We now have to write out all the stuff we put off writing out.
3635 o Template specializations that we have not yet instantiated,
3636 but which are needed.
3637 o Initialization and destruction for non-local objects with
3638 static storage duration. (Local objects with static storage
3639 duration are initialized when their scope is first entered,
3640 and are cleaned up via atexit.)
3641 o Virtual function tables.
3643 All of these may cause others to be needed. For example,
3644 instantiating one function may cause another to be needed, and
3645 generating the intiailzer for an object may cause templates to be
3646 instantiated, etc., etc. */
3648 timevar_push (TV_VARCONST
);
3650 if (new_abi_rtti_p ())
3651 emit_support_tinfos ();
3657 /* If there are templates that we've put off instantiating, do
3659 instantiate_pending_templates ();
3661 /* Write out virtual tables as required. Note that writing out
3662 the virtual table for a template class may cause the
3663 instantiation of members of that class. */
3664 if (walk_globals (vtable_decl_p
,
3665 finish_vtable_vardecl
,
3669 /* Write out needed type info variables. Writing out one variable
3670 might cause others to be needed. */
3671 if (new_abi_rtti_p ()
3672 && walk_globals (tinfo_decl_p
, emit_tinfo_decl
, /*data=*/0))
3675 /* The list of objects with static storage duration is built up
3676 in reverse order. We clear STATIC_AGGREGATES so that any new
3677 aggregates added during the initialization of these will be
3678 initialized in the correct order when we next come around the
3680 vars
= prune_vars_needing_no_initialization (static_aggregates
);
3681 static_aggregates
= NULL_TREE
;
3687 /* We need to start a new initialization function each time
3688 through the loop. That's because we need to know which
3689 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3690 isn't computed until a function is finished, and written
3691 out. That's a deficiency in the back-end. When this is
3692 fixed, these initialization functions could all become
3693 inline, with resulting performance improvements. */
3694 tree ssdf_body
= start_static_storage_duration_function ();
3696 /* Make sure the back end knows about all the variables. */
3697 write_out_vars (vars
);
3699 /* First generate code to do all the initializations. */
3700 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3701 do_static_initialization (TREE_VALUE (v
),
3704 /* Then, generate code to do all the destructions. Do these
3705 in reverse order so that the most recently constructed
3706 variable is the first destroyed. If we're using
3707 __cxa_atexit, then we don't need to do this; functions
3708 were registered at initialization time to destroy the
3710 if (!flag_use_cxa_atexit
)
3712 vars
= nreverse (vars
);
3713 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3714 do_static_destruction (TREE_VALUE (v
));
3719 /* Finish up the static storage duration function for this
3721 finish_static_storage_duration_function (ssdf_body
);
3723 /* All those initializations and finalizations might cause
3724 us to need more inline functions, more template
3725 instantiations, etc. */
3729 /* Go through the various inline functions, and see if any need
3731 for (i
= 0; i
< deferred_fns_used
; ++i
)
3733 tree decl
= VARRAY_TREE (deferred_fns
, i
);
3734 import_export_decl (decl
);
3735 if (DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
3737 && (! DECL_REALLY_EXTERN (decl
) || DECL_INLINE (decl
)))
3739 /* Even though we're already at the top-level, we push
3740 there again. That way, when we pop back a few lines
3741 hence, all of our state is restored. Otherwise,
3742 finish_function doesn't clean things up, and we end
3743 up with CURRENT_FUNCTION_DECL set. */
3744 push_to_top_level ();
3745 if (DECL_TINFO_FN_P (decl
))
3746 synthesize_tinfo_fn (decl
);
3748 synthesize_method (decl
);
3749 pop_from_top_level ();
3754 /* Mark all functions that might deal with exception-handling as
3756 mark_all_runtime_matches ();
3758 /* We lie to the back-end, pretending that some functions are
3759 not defined when they really are. This keeps these functions
3760 from being put out unnecessarily. But, we must stop lying
3761 when the functions are referenced, or if they are not comdat
3762 since they need to be put out now. */
3763 for (i
= 0; i
< deferred_fns_used
; ++i
)
3765 tree decl
= VARRAY_TREE (deferred_fns
, i
);
3767 if (DECL_NOT_REALLY_EXTERN (decl
)
3768 && DECL_INITIAL (decl
)
3769 && DECL_NEEDED_P (decl
))
3770 DECL_EXTERNAL (decl
) = 0;
3772 /* If we're going to need to write this function out, and
3773 there's already a body for it, create RTL for it now.
3774 (There might be no body if this is a method we haven't
3775 gotten around to synthesizing yet.) */
3776 if (!DECL_EXTERNAL (decl
)
3777 && DECL_NEEDED_P (decl
)
3778 && DECL_SAVED_TREE (decl
)
3779 && !DECL_SAVED_INSNS (decl
)
3780 && !TREE_ASM_WRITTEN (decl
))
3782 int saved_not_really_extern
;
3784 /* When we call finish_function in expand_body, it will
3785 try to reset DECL_NOT_REALLY_EXTERN so we save and
3787 saved_not_really_extern
= DECL_NOT_REALLY_EXTERN (decl
);
3788 /* Generate RTL for this function now that we know we
3791 /* Undo the damage done by finish_function. */
3792 DECL_EXTERNAL (decl
) = 0;
3793 DECL_NOT_REALLY_EXTERN (decl
) = saved_not_really_extern
;
3794 /* If we're compiling -fsyntax-only pretend that this
3795 function has been written out so that we don't try to
3797 if (flag_syntax_only
)
3798 TREE_ASM_WRITTEN (decl
) = 1;
3803 if (deferred_fns_used
3804 && wrapup_global_declarations (&VARRAY_TREE (deferred_fns
, 0),
3807 if (walk_namespaces (wrapup_globals_for_namespace
, /*data=*/0))
3810 /* Static data members are just like namespace-scope globals. */
3811 for (i
= 0; i
< pending_statics_used
; ++i
)
3813 tree decl
= VARRAY_TREE (pending_statics
, i
);
3814 if (TREE_ASM_WRITTEN (decl
))
3816 import_export_decl (decl
);
3817 if (DECL_NOT_REALLY_EXTERN (decl
) && ! DECL_IN_AGGR_P (decl
))
3818 DECL_EXTERNAL (decl
) = 0;
3821 && wrapup_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3822 pending_statics_used
))
3827 /* We give C linkage to static constructors and destructors. */
3828 push_lang_context (lang_name_c
);
3830 /* Generate initialization and destruction functions for all
3831 priorities for which they are required. */
3832 if (priority_info_map
)
3833 splay_tree_foreach (priority_info_map
,
3834 generate_ctor_and_dtor_functions_for_priority
,
3837 /* We're done with the splay-tree now. */
3838 if (priority_info_map
)
3839 splay_tree_delete (priority_info_map
);
3841 /* We're done with static constructors, so we can go back to "C++"
3843 pop_lang_context ();
3845 /* Now delete from the chain of variables all virtual function tables.
3846 We output them all ourselves, because each will be treated
3847 specially. We don't do this if we're just doing semantic
3848 analysis, and not code-generation. */
3849 if (!flag_syntax_only
)
3850 walk_globals (vtable_decl_p
, prune_vtable_vardecl
, /*data=*/0);
3852 /* Now, issue warnings about static, but not defined, functions,
3853 etc., and emit debugging information. */
3854 walk_namespaces (wrapup_globals_for_namespace
, /*data=*/&reconsider
);
3855 if (pending_statics
)
3856 check_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3857 pending_statics_used
);
3861 /* The entire file is now complete. If requested, dump everything
3863 if (flag_dump_translation_unit
)
3864 dump_node_to_file (global_namespace
, flag_dump_translation_unit
);
3866 /* If there's some tool that wants to examine the entire translation
3867 unit, let it do so now. */
3869 (*back_end_hook
) (global_namespace
);
3871 timevar_pop (TV_VARCONST
);
3873 if (flag_detailed_statistics
)
3875 dump_tree_statistics ();
3876 dump_time_statistics ();
3880 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3881 expr. Since it was parsed like a type, we need to wade through and fix
3882 that. Unfortunately, since operator() is left-associative, we can't use
3883 tail recursion. In the above example, TYPE is `A', and DECL is
3886 Maybe this shouldn't be recursive, but how often will it actually be
3890 reparse_absdcl_as_expr (type
, decl
)
3893 /* do build_functional_cast (type, NULL_TREE) at bottom */
3894 if (TREE_OPERAND (decl
, 0) == NULL_TREE
)
3895 return build_functional_cast (type
, NULL_TREE
);
3898 decl
= reparse_absdcl_as_expr (type
, TREE_OPERAND (decl
, 0));
3900 decl
= build_x_function_call (decl
, NULL_TREE
, current_class_ref
);
3902 if (TREE_CODE (decl
) == CALL_EXPR
3903 && (! TREE_TYPE (decl
)
3904 || TREE_CODE (TREE_TYPE (decl
)) != VOID_TYPE
))
3905 decl
= require_complete_type (decl
);
3910 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3911 out to be an expr. Since it was parsed like a type, we need to wade
3912 through and fix that. Since casts are right-associative, we are
3913 reversing the order, so we don't have to recurse.
3915 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3919 reparse_absdcl_as_casts (decl
, expr
)
3924 if (TREE_CODE (expr
) == CONSTRUCTOR
3925 && TREE_TYPE (expr
) == 0)
3927 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3928 decl
= TREE_OPERAND (decl
, 0);
3930 expr
= digest_init (type
, expr
, (tree
*) 0);
3931 if (TREE_CODE (type
) == ARRAY_TYPE
&& !COMPLETE_TYPE_P (type
))
3933 int failure
= complete_array_type (type
, expr
, 1);
3935 my_friendly_abort (78);
3941 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3942 decl
= TREE_OPERAND (decl
, 0);
3943 expr
= build_c_cast (type
, expr
);
3946 if (warn_old_style_cast
&& ! in_system_header
3947 && current_lang_name
!= lang_name_c
)
3948 warning ("use of old-style cast");
3953 /* Given plain tree nodes for an expression, build up the full semantics. */
3956 build_expr_from_tree (t
)
3959 if (t
== NULL_TREE
|| t
== error_mark_node
)
3962 switch (TREE_CODE (t
))
3964 case IDENTIFIER_NODE
:
3965 return do_identifier (t
, 0, NULL_TREE
);
3968 if (LOOKUP_EXPR_GLOBAL (t
))
3969 return do_scoped_id (TREE_OPERAND (t
, 0), 0);
3971 return do_identifier (TREE_OPERAND (t
, 0), 0, NULL_TREE
);
3973 case TEMPLATE_ID_EXPR
:
3974 return (lookup_template_function
3975 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3976 build_expr_from_tree (TREE_OPERAND (t
, 1))));
3979 return build_x_indirect_ref
3980 (build_expr_from_tree (TREE_OPERAND (t
, 0)), "unary *");
3983 return build_functional_cast
3984 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3986 case REINTERPRET_CAST_EXPR
:
3987 return build_reinterpret_cast
3988 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3990 case CONST_CAST_EXPR
:
3991 return build_const_cast
3992 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3994 case DYNAMIC_CAST_EXPR
:
3995 return build_dynamic_cast
3996 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3998 case STATIC_CAST_EXPR
:
3999 return build_static_cast
4000 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
4002 case PREDECREMENT_EXPR
:
4003 case PREINCREMENT_EXPR
:
4004 case POSTDECREMENT_EXPR
:
4005 case POSTINCREMENT_EXPR
:
4009 case TRUTH_NOT_EXPR
:
4011 case CONVERT_EXPR
: /* Unary + */
4016 return build_x_unary_op (TREE_CODE (t
),
4017 build_expr_from_tree (TREE_OPERAND (t
, 0)));
4022 case TRUNC_DIV_EXPR
:
4024 case FLOOR_DIV_EXPR
:
4025 case ROUND_DIV_EXPR
:
4026 case EXACT_DIV_EXPR
:
4028 case BIT_ANDTC_EXPR
:
4031 case TRUNC_MOD_EXPR
:
4032 case FLOOR_MOD_EXPR
:
4033 case TRUTH_ANDIF_EXPR
:
4034 case TRUTH_ORIF_EXPR
:
4035 case TRUTH_AND_EXPR
:
4050 return build_x_binary_op
4052 build_expr_from_tree (TREE_OPERAND (t
, 0)),
4053 build_expr_from_tree (TREE_OPERAND (t
, 1)));
4056 return build_m_component_ref
4057 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4058 build_expr_from_tree (TREE_OPERAND (t
, 1)));
4061 return build_offset_ref (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
4064 if (TREE_OPERAND (t
, 0) == NULL_TREE
)
4066 return build_parse_node (ARRAY_REF
, NULL_TREE
,
4067 build_expr_from_tree (TREE_OPERAND (t
, 1)));
4068 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4069 build_expr_from_tree (TREE_OPERAND (t
, 1)));
4074 tree r
= build_expr_from_tree (TREE_OPERAND (t
, 0));
4077 return TREE_CODE (t
) == SIZEOF_EXPR
? c_sizeof (r
) : c_alignof (r
);
4081 return build_x_modify_expr
4082 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4083 TREE_CODE (TREE_OPERAND (t
, 1)),
4084 build_expr_from_tree (TREE_OPERAND (t
, 2)));
4087 return build_x_arrow
4088 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4092 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4093 build_expr_from_tree (TREE_OPERAND (t
, 1)),
4094 build_expr_from_tree (TREE_OPERAND (t
, 2)),
4095 NEW_EXPR_USE_GLOBAL (t
));
4098 return delete_sanity
4099 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4100 build_expr_from_tree (TREE_OPERAND (t
, 1)),
4101 DELETE_EXPR_USE_VEC (t
), DELETE_EXPR_USE_GLOBAL (t
));
4104 if (TREE_OPERAND (t
, 1) == NULL_TREE
)
4105 return build_x_compound_expr
4106 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4108 my_friendly_abort (42);
4110 case METHOD_CALL_EXPR
:
4111 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
4113 tree ref
= TREE_OPERAND (t
, 0);
4114 return build_scoped_method_call
4115 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
4116 build_expr_from_tree (TREE_OPERAND (ref
, 0)),
4117 TREE_OPERAND (ref
, 1),
4118 build_expr_from_tree (TREE_OPERAND (t
, 2)));
4122 tree fn
= TREE_OPERAND (t
, 0);
4124 /* We can get a TEMPLATE_ID_EXPR here on code like:
4128 so we must resolve that. However, we can also get things
4129 like a BIT_NOT_EXPR here, when referring to a destructor,
4130 and things like that are not correctly resolved by
4131 build_expr_from_tree. So, just use build_expr_from_tree
4132 when we really need it. */
4133 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4134 fn
= lookup_template_function
4135 (TREE_OPERAND (fn
, 0),
4136 build_expr_from_tree (TREE_OPERAND (fn
, 1)));
4138 return build_method_call
4139 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
4141 build_expr_from_tree (TREE_OPERAND (t
, 2)),
4142 NULL_TREE
, LOOKUP_NORMAL
);
4146 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
4148 tree ref
= TREE_OPERAND (t
, 0);
4149 return build_member_call
4150 (build_expr_from_tree (TREE_OPERAND (ref
, 0)),
4151 TREE_OPERAND (ref
, 1),
4152 build_expr_from_tree (TREE_OPERAND (t
, 1)));
4156 tree name
= TREE_OPERAND (t
, 0);
4158 tree args
= build_expr_from_tree (TREE_OPERAND (t
, 1));
4159 if (args
!= NULL_TREE
&& TREE_CODE (name
) == LOOKUP_EXPR
4160 && !LOOKUP_EXPR_GLOBAL (name
)
4161 && TREE_CODE ((id
= TREE_OPERAND (name
, 0))) == IDENTIFIER_NODE
4162 && (!current_class_type
4163 || !lookup_member (current_class_type
, id
, 0, 0)))
4165 /* Do Koenig lookup if there are no class members. */
4166 name
= do_identifier (id
, 0, args
);
4168 else if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
4169 || ! really_overloaded_fn (name
))
4170 name
= build_expr_from_tree (name
);
4171 return build_x_function_call (name
, args
, current_class_ref
);
4175 return build_x_conditional_expr
4176 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4177 build_expr_from_tree (TREE_OPERAND (t
, 1)),
4178 build_expr_from_tree (TREE_OPERAND (t
, 2)));
4180 case PSEUDO_DTOR_EXPR
:
4181 return (finish_pseudo_destructor_call_expr
4182 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4183 build_expr_from_tree (TREE_OPERAND (t
, 1)),
4184 build_expr_from_tree (TREE_OPERAND (t
, 2))));
4188 tree purpose
, value
, chain
;
4190 if (t
== void_list_node
)
4193 purpose
= TREE_PURPOSE (t
);
4195 purpose
= build_expr_from_tree (purpose
);
4196 value
= TREE_VALUE (t
);
4198 value
= build_expr_from_tree (value
);
4199 chain
= TREE_CHAIN (t
);
4200 if (chain
&& chain
!= void_type_node
)
4201 chain
= build_expr_from_tree (chain
);
4202 return tree_cons (purpose
, value
, chain
);
4207 tree object
= build_expr_from_tree (TREE_OPERAND (t
, 0));
4208 tree field
= TREE_OPERAND (t
, 1);
4210 /* We use a COMPONENT_REF to indicate things of the form `x.b'
4211 and `x.A::b'. We must distinguish between those cases
4213 if (TREE_CODE (field
) == SCOPE_REF
)
4214 return build_object_ref (object
,
4215 TREE_OPERAND (field
, 0),
4216 TREE_OPERAND (field
, 1));
4218 return build_x_component_ref (object
, field
,
4223 return build_throw (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4229 /* digest_init will do the wrong thing if we let it. */
4230 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
4233 r
= build_nt (CONSTRUCTOR
, NULL_TREE
,
4234 build_expr_from_tree (CONSTRUCTOR_ELTS (t
)));
4235 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
4238 return digest_init (TREE_TYPE (t
), r
, 0);
4243 if (TYPE_P (TREE_OPERAND (t
, 0)))
4244 return get_typeid (TREE_OPERAND (t
, 0));
4245 return build_typeid (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4248 return convert_from_reference (t
);
4251 return build_va_arg (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4259 /* This is something of the form `int (*a)++' that has turned out to be an
4260 expr. It was only converted into parse nodes, so we need to go through
4261 and build up the semantics. Most of the work is done by
4262 build_expr_from_tree, above.
4264 In the above example, TYPE is `int' and DECL is `*a'. */
4267 reparse_decl_as_expr (type
, decl
)
4270 decl
= build_expr_from_tree (decl
);
4272 return build_functional_cast (type
, build_tree_list (NULL_TREE
, decl
));
4277 /* This is something of the form `int (*a)' that has turned out to be a
4278 decl. It was only converted into parse nodes, so we need to do the
4279 checking that make_{pointer,reference}_declarator do. */
4282 finish_decl_parsing (decl
)
4285 extern int current_class_depth
;
4287 switch (TREE_CODE (decl
))
4289 case IDENTIFIER_NODE
:
4292 return make_pointer_declarator
4293 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4295 return make_reference_declarator
4296 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4298 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4301 push_nested_class (TREE_TYPE (TREE_OPERAND (decl
, 0)), 3);
4302 TREE_COMPLEXITY (decl
) = current_class_depth
;
4305 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4308 /* For attribute handling. */
4309 TREE_VALUE (decl
) = finish_decl_parsing (TREE_VALUE (decl
));
4311 case TEMPLATE_ID_EXPR
:
4314 my_friendly_abort (5);
4320 check_cp_case_value (value
)
4323 if (value
== NULL_TREE
)
4326 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4327 STRIP_TYPE_NOPS (value
);
4328 value
= decl_constant_value (value
);
4329 STRIP_TYPE_NOPS (value
);
4330 value
= fold (value
);
4332 if (TREE_CODE (value
) != INTEGER_CST
4333 && value
!= error_mark_node
)
4335 cp_error ("case label `%E' does not reduce to an integer constant",
4337 value
= error_mark_node
;
4340 /* Promote char or short to int. */
4341 value
= default_conversion (value
);
4343 constant_expression_warning (value
);
4348 /* Return 1 if root encloses child. */
4351 is_namespace_ancestor (root
, child
)
4356 if (root
== global_namespace
)
4358 if (child
== global_namespace
)
4360 return is_namespace_ancestor (root
, CP_DECL_CONTEXT (child
));
4364 /* Return the namespace that is the common ancestor
4365 of two given namespaces. */
4368 namespace_ancestor (ns1
, ns2
)
4371 if (is_namespace_ancestor (ns1
, ns2
))
4373 return namespace_ancestor (CP_DECL_CONTEXT (ns1
), ns2
);
4376 /* Insert used into the using list of user. Set indirect_flag if this
4377 directive is not directly from the source. Also find the common
4378 ancestor and let our users know about the new namespace */
4380 add_using_namespace (user
, used
, indirect
)
4386 /* Using oneself is a no-op. */
4389 my_friendly_assert (TREE_CODE (user
) == NAMESPACE_DECL
, 380);
4390 my_friendly_assert (TREE_CODE (used
) == NAMESPACE_DECL
, 380);
4391 /* Check if we already have this. */
4392 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
4396 /* Promote to direct usage. */
4397 TREE_INDIRECT_USING (t
) = 0;
4401 /* Add used to the user's using list. */
4402 DECL_NAMESPACE_USING (user
)
4403 = tree_cons (used
, namespace_ancestor (user
, used
),
4404 DECL_NAMESPACE_USING (user
));
4406 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
4408 /* Add user to the used's users list. */
4409 DECL_NAMESPACE_USERS (used
)
4410 = tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
4412 /* Recursively add all namespaces used. */
4413 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
4414 /* indirect usage */
4415 add_using_namespace (user
, TREE_PURPOSE (t
), 1);
4417 /* Tell everyone using us about the new used namespaces. */
4418 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
4419 add_using_namespace (TREE_PURPOSE (t
), used
, 1);
4422 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4423 duplicates. The first list becomes the tail of the result.
4425 The algorithm is O(n^2). We could get this down to O(n log n) by
4426 doing a sort on the addresses of the functions, if that becomes
4430 merge_functions (s1
, s2
)
4434 for (; s2
; s2
= OVL_NEXT (s2
))
4436 tree fn
= OVL_CURRENT (s2
);
4437 if (! ovl_member (fn
, s1
))
4438 s1
= build_overload (fn
, s1
);
4443 /* This should return an error not all definitions define functions.
4444 It is not an error if we find two functions with exactly the
4445 same signature, only if these are selected in overload resolution.
4446 old is the current set of bindings, new the freshly-found binding.
4447 XXX Do we want to give *all* candidates in case of ambiguity?
4448 XXX In what way should I treat extern declarations?
4449 XXX I don't want to repeat the entire duplicate_decls here */
4452 ambiguous_decl (name
, old
, new, flags
)
4459 my_friendly_assert (old
!= NULL_TREE
, 393);
4460 /* Copy the value. */
4461 val
= BINDING_VALUE (new);
4463 switch (TREE_CODE (val
))
4466 /* If we expect types or namespaces, and not templates,
4467 or this is not a template class. */
4468 if (LOOKUP_QUALIFIERS_ONLY (flags
)
4469 && !DECL_CLASS_TEMPLATE_P (val
))
4473 if (LOOKUP_NAMESPACES_ONLY (flags
))
4476 case NAMESPACE_DECL
:
4477 if (LOOKUP_TYPES_ONLY (flags
))
4481 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4485 if (!BINDING_VALUE (old
))
4486 BINDING_VALUE (old
) = val
;
4487 else if (val
&& val
!= BINDING_VALUE (old
))
4489 if (is_overloaded_fn (BINDING_VALUE (old
))
4490 && is_overloaded_fn (val
))
4492 BINDING_VALUE (old
) = merge_functions (BINDING_VALUE (old
),
4497 /* Some declarations are functions, some are not. */
4498 if (flags
& LOOKUP_COMPLAIN
)
4500 /* If we've already given this error for this lookup,
4501 BINDING_VALUE (old) is error_mark_node, so let's not
4502 repeat ourselves. */
4503 if (BINDING_VALUE (old
) != error_mark_node
)
4505 cp_error ("use of `%D' is ambiguous", name
);
4506 cp_error_at (" first declared as `%#D' here",
4507 BINDING_VALUE (old
));
4509 cp_error_at (" also declared as `%#D' here", val
);
4511 BINDING_VALUE (old
) = error_mark_node
;
4514 /* ... and copy the type. */
4515 type
= BINDING_TYPE (new);
4516 if (LOOKUP_NAMESPACES_ONLY (flags
))
4518 if (!BINDING_TYPE (old
))
4519 BINDING_TYPE (old
) = type
;
4520 else if (type
&& BINDING_TYPE (old
) != type
)
4522 if (flags
& LOOKUP_COMPLAIN
)
4524 cp_error ("`%D' denotes an ambiguous type",name
);
4525 cp_error_at (" first type here", BINDING_TYPE (old
));
4526 cp_error_at (" other type here", type
);
4532 /* Subroutine of unualified_namespace_lookup:
4533 Add the bindings of NAME in used namespaces to VAL.
4534 We are currently looking for names in namespace SCOPE, so we
4535 look through USINGS for using-directives of namespaces
4536 which have SCOPE as a common ancestor with the current scope.
4537 Returns zero on errors. */
4540 lookup_using_namespace (name
, val
, usings
, scope
, flags
, spacesp
)
4541 tree name
, val
, usings
, scope
;
4547 /* Iterate over all used namespaces in current, searching for using
4548 directives of scope. */
4549 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4550 if (TREE_VALUE (iter
) == scope
)
4553 *spacesp
= tree_cons (TREE_PURPOSE (iter
), NULL_TREE
,
4555 val1
= binding_for_name (name
, TREE_PURPOSE (iter
));
4556 /* Resolve ambiguities. */
4557 val
= ambiguous_decl (name
, val
, val1
, flags
);
4559 return BINDING_VALUE (val
) != error_mark_node
;
4563 Accepts the NAME to lookup and its qualifying SCOPE.
4564 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4568 qualified_lookup_using_namespace (name
, scope
, result
, flags
)
4574 /* Maintain a list of namespaces visited... */
4575 tree seen
= NULL_TREE
;
4576 /* ... and a list of namespace yet to see. */
4577 tree todo
= NULL_TREE
;
4579 /* Look through namespace aliases. */
4580 scope
= ORIGINAL_NAMESPACE (scope
);
4581 while (scope
&& (result
!= error_mark_node
))
4583 seen
= tree_cons (scope
, NULL_TREE
, seen
);
4584 result
= ambiguous_decl (name
, result
,
4585 binding_for_name (name
, scope
), flags
);
4586 if (!BINDING_VALUE (result
) && !BINDING_TYPE (result
))
4587 /* Consider using directives. */
4588 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4589 usings
= TREE_CHAIN (usings
))
4590 /* If this was a real directive, and we have not seen it. */
4591 if (!TREE_INDIRECT_USING (usings
)
4592 && !purpose_member (TREE_PURPOSE (usings
), seen
))
4593 todo
= tree_cons (TREE_PURPOSE (usings
), NULL_TREE
, todo
);
4596 scope
= TREE_PURPOSE (todo
);
4597 todo
= TREE_CHAIN (todo
);
4600 scope
= NULL_TREE
; /* If there never was a todo list. */
4602 return result
!= error_mark_node
;
4605 /* [namespace.memdef]/2 */
4607 /* Set the context of a declaration to scope. Complain if we are not
4611 set_decl_namespace (decl
, scope
, friendp
)
4617 if (scope
== std_node
)
4618 scope
= global_namespace
;
4619 /* Get rid of namespace aliases. */
4620 scope
= ORIGINAL_NAMESPACE (scope
);
4622 /* It is ok for friends to be qualified in parallel space. */
4623 if (!friendp
&& !is_namespace_ancestor (current_namespace
, scope
))
4624 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4626 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
4627 if (scope
!= current_namespace
)
4629 /* See whether this has been declared in the namespace. */
4630 old
= namespace_binding (DECL_NAME (decl
), scope
);
4632 /* No old declaration at all. */
4634 if (!is_overloaded_fn (decl
))
4635 /* Don't compare non-function decls with decls_match here,
4636 since it can't check for the correct constness at this
4637 point. pushdecl will find those errors later. */
4639 /* Since decl is a function, old should contain a function decl. */
4640 if (!is_overloaded_fn (old
))
4642 if (processing_template_decl
|| processing_specialization
)
4643 /* We have not yet called push_template_decl to turn the
4644 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4645 won't match. But, we'll check later, when we construct the
4648 for (; old
; old
= OVL_NEXT (old
))
4649 if (decls_match (decl
, OVL_CURRENT (old
)))
4655 cp_error ("`%D' should have been declared inside `%D'",
4659 /* Compute the namespace where a declaration is defined. */
4662 decl_namespace (decl
)
4666 decl
= TYPE_STUB_DECL (decl
);
4667 while (DECL_CONTEXT (decl
))
4669 decl
= DECL_CONTEXT (decl
);
4670 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4673 decl
= TYPE_STUB_DECL (decl
);
4674 my_friendly_assert (DECL_P (decl
), 390);
4677 return global_namespace
;
4680 /* Return the namespace where the current declaration is declared. */
4683 current_decl_namespace ()
4686 /* If we have been pushed into a different namespace, use it. */
4687 if (decl_namespace_list
)
4688 return TREE_PURPOSE (decl_namespace_list
);
4690 if (current_class_type
)
4691 result
= decl_namespace (TYPE_STUB_DECL (current_class_type
));
4692 else if (current_function_decl
)
4693 result
= decl_namespace (current_function_decl
);
4695 result
= current_namespace
;
4699 /* Temporarily set the namespace for the current declaration. */
4702 push_decl_namespace (decl
)
4705 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
4706 decl
= decl_namespace (decl
);
4707 decl_namespace_list
= tree_cons (ORIGINAL_NAMESPACE (decl
),
4708 NULL_TREE
, decl_namespace_list
);
4712 pop_decl_namespace ()
4714 decl_namespace_list
= TREE_CHAIN (decl_namespace_list
);
4717 /* Enter a class or namespace scope. */
4723 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4724 push_decl_namespace (t
);
4729 /* Leave scope pushed by push_scope. */
4735 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4736 pop_decl_namespace ();
4741 /* [basic.lookup.koenig] */
4742 /* A non-zero return value in the functions below indicates an error.
4743 All nodes allocated in the procedure are on the scratch obstack. */
4753 static int arg_assoc
PARAMS ((struct arg_lookup
*, tree
));
4754 static int arg_assoc_args
PARAMS ((struct arg_lookup
*, tree
));
4755 static int arg_assoc_type
PARAMS ((struct arg_lookup
*, tree
));
4756 static int add_function
PARAMS ((struct arg_lookup
*, tree
));
4757 static int arg_assoc_namespace
PARAMS ((struct arg_lookup
*, tree
));
4758 static int arg_assoc_class
PARAMS ((struct arg_lookup
*, tree
));
4759 static int arg_assoc_template_arg
PARAMS ((struct arg_lookup
*, tree
));
4761 /* Add a function to the lookup structure.
4762 Returns 1 on error. */
4765 add_function (k
, fn
)
4766 struct arg_lookup
*k
;
4769 /* We used to check here to see if the function was already in the list,
4770 but that's O(n^2), which is just too expensive for function lookup.
4771 Now we deal with the occasional duplicate in joust. In doing this, we
4772 assume that the number of duplicates will be small compared to the
4773 total number of functions being compared, which should usually be the
4776 /* We must find only functions, or exactly one non-function. */
4777 if (k
->functions
&& is_overloaded_fn (k
->functions
)
4778 && is_overloaded_fn (fn
))
4779 k
->functions
= build_overload (fn
, k
->functions
);
4780 else if (k
->functions
)
4782 tree f1
= OVL_CURRENT (k
->functions
);
4784 if (is_overloaded_fn (f1
))
4786 fn
= f1
; f1
= f2
; f2
= fn
;
4788 cp_error_at ("`%D' is not a function,", f1
);
4789 cp_error_at (" conflict with `%D'", f2
);
4790 cp_error (" in call to `%D'", k
->name
);
4798 /* Add functions of a namespace to the lookup structure.
4799 Returns 1 on error. */
4802 arg_assoc_namespace (k
, scope
)
4803 struct arg_lookup
*k
;
4808 if (purpose_member (scope
, k
->namespaces
))
4810 k
->namespaces
= tree_cons (scope
, NULL_TREE
, k
->namespaces
);
4812 value
= namespace_binding (k
->name
, scope
);
4816 for (; value
; value
= OVL_NEXT (value
))
4817 if (add_function (k
, OVL_CURRENT (value
)))
4823 /* Adds everything associated with a template argument to the lookup
4824 structure. Returns 1 on error. */
4827 arg_assoc_template_arg (k
, arg
)
4828 struct arg_lookup
* k
;
4831 /* [basic.lookup.koenig]
4833 If T is a template-id, its associated namespaces and classes are
4834 ... the namespaces and classes associated with the types of the
4835 template arguments provided for template type parameters
4836 (excluding template template parameters); the namespaces in which
4837 any template template arguments are defined; and the classes in
4838 which any member templates used as template template arguments
4839 are defined. [Note: non-type template arguments do not
4840 contribute to the set of associated namespaces. ] */
4842 /* Consider first template template arguments. */
4843 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
4845 tree ctx
= CP_DECL_CONTEXT (arg
);
4847 /* It's not a member template. */
4848 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4849 return arg_assoc_namespace (k
, ctx
);
4850 /* Otherwise, it must be member template. */
4852 return arg_assoc_class (k
, ctx
);
4854 /* It's not a template template argument, but it is a type template
4856 else if (TYPE_P (arg
))
4857 return arg_assoc_type (k
, arg
);
4858 /* It's a non-type template argument. */
4863 /* Adds everything associated with class to the lookup structure.
4864 Returns 1 on error. */
4867 arg_assoc_class (k
, type
)
4868 struct arg_lookup
* k
;
4871 tree list
, friends
, context
;
4874 /* Backend build structures, such as __builtin_va_list, aren't
4875 affected by all this. */
4876 if (!CLASS_TYPE_P (type
))
4879 if (purpose_member (type
, k
->classes
))
4881 k
->classes
= tree_cons (type
, NULL_TREE
, k
->classes
);
4883 context
= decl_namespace (TYPE_MAIN_DECL (type
));
4884 if (arg_assoc_namespace (k
, context
))
4887 /* Process baseclasses. */
4888 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (type
); i
++)
4889 if (arg_assoc_class (k
, TYPE_BINFO_BASETYPE (type
, i
)))
4892 /* Process friends. */
4893 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
4894 list
= TREE_CHAIN (list
))
4895 if (k
->name
== TREE_PURPOSE (list
))
4896 for (friends
= TREE_VALUE (list
); friends
;
4897 friends
= TREE_CHAIN (friends
))
4898 /* Only interested in global functions with potentially hidden
4899 (i.e. unqualified) declarations. */
4900 if (TREE_PURPOSE (list
) == error_mark_node
&& TREE_VALUE (list
)
4901 && decl_namespace (TREE_VALUE (list
)) == context
)
4902 if (add_function (k
, TREE_VALUE (list
)))
4905 /* Process template arguments. */
4906 if (CLASSTYPE_TEMPLATE_INFO (type
))
4908 list
= INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
4909 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
4910 arg_assoc_template_arg (k
, TREE_VEC_ELT (list
, i
));
4916 /* Adds everything associated with a given type.
4917 Returns 1 on error. */
4920 arg_assoc_type (k
, type
)
4921 struct arg_lookup
*k
;
4924 switch (TREE_CODE (type
))
4934 if (TYPE_PTRMEMFUNC_P (type
))
4935 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
4936 return arg_assoc_class (k
, type
);
4938 case REFERENCE_TYPE
:
4940 return arg_assoc_type (k
, TREE_TYPE (type
));
4943 return arg_assoc_namespace (k
, decl_namespace (TYPE_MAIN_DECL (type
)));
4945 /* Pointer to member: associate class type and value type. */
4946 if (arg_assoc_type (k
, TYPE_OFFSET_BASETYPE (type
)))
4948 return arg_assoc_type (k
, TREE_TYPE (type
));
4950 /* The basetype is referenced in the first arg type, so just
4953 /* Associate the parameter types. */
4954 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
4956 /* Associate the return type. */
4957 return arg_assoc_type (k
, TREE_TYPE (type
));
4958 case TEMPLATE_TYPE_PARM
:
4959 case TEMPLATE_TEMPLATE_PARM
:
4962 if (type
== unknown_type_node
)
4964 /* else fall through */
4966 my_friendly_abort (390);
4971 /* Adds everything associated with arguments. Returns 1 on error. */
4974 arg_assoc_args (k
, args
)
4975 struct arg_lookup
* k
;
4978 for (; args
; args
= TREE_CHAIN (args
))
4979 if (arg_assoc (k
, TREE_VALUE (args
)))
4984 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4988 struct arg_lookup
* k
;
4991 if (n
== error_mark_node
)
4995 return arg_assoc_type (k
, n
);
4997 if (! type_unknown_p (n
))
4998 return arg_assoc_type (k
, TREE_TYPE (n
));
5000 if (TREE_CODE (n
) == ADDR_EXPR
)
5001 n
= TREE_OPERAND (n
, 0);
5002 if (TREE_CODE (n
) == COMPONENT_REF
)
5003 n
= TREE_OPERAND (n
, 1);
5004 if (TREE_CODE (n
) == OFFSET_REF
)
5005 n
= TREE_OPERAND (n
, 1);
5006 while (TREE_CODE (n
) == TREE_LIST
)
5009 if (TREE_CODE (n
) == FUNCTION_DECL
)
5010 return arg_assoc_type (k
, TREE_TYPE (n
));
5011 if (TREE_CODE (n
) == TEMPLATE_ID_EXPR
)
5013 /* [basic.lookup.koenig]
5015 If T is a template-id, its associated namespaces and classes
5016 are the namespace in which the template is defined; for
5017 member templates, the member template's class... */
5018 tree
template = TREE_OPERAND (n
, 0);
5019 tree args
= TREE_OPERAND (n
, 1);
5023 /* First, the template. There may actually be more than one if
5024 this is an overloaded function template. But, in that case,
5025 we only need the first; all the functions will be in the same
5027 template = OVL_CURRENT (template);
5029 ctx
= CP_DECL_CONTEXT (template);
5031 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
5033 if (arg_assoc_namespace (k
, ctx
) == 1)
5036 /* It must be a member template. */
5037 else if (arg_assoc_class (k
, ctx
) == 1)
5040 /* Now the arguments. */
5041 for (arg
= args
; arg
!= NULL_TREE
; arg
= TREE_CHAIN (arg
))
5042 if (arg_assoc_template_arg (k
, TREE_VALUE (arg
)) == 1)
5047 my_friendly_assert (TREE_CODE (n
) == OVERLOAD
, 980715);
5049 for (; n
; n
= OVL_CHAIN (n
))
5050 if (arg_assoc_type (k
, TREE_TYPE (OVL_FUNCTION (n
))))
5057 /* Performs Koenig lookup depending on arguments, where fns
5058 are the functions found in normal lookup. */
5061 lookup_arg_dependent (name
, fns
, args
)
5066 struct arg_lookup k
;
5067 tree fn
= NULL_TREE
;
5071 k
.classes
= NULL_TREE
;
5073 /* Note that we've already looked at some namespaces during normal
5074 unqualified lookup, unless we found a decl in function scope. */
5076 fn
= OVL_CURRENT (fns
);
5077 if (fn
&& TREE_CODE (fn
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (fn
))
5078 k
.namespaces
= NULL_TREE
;
5080 unqualified_namespace_lookup (name
, 0, &k
.namespaces
);
5082 arg_assoc_args (&k
, args
);
5086 /* Process a namespace-alias declaration. */
5089 do_namespace_alias (alias
, namespace)
5090 tree alias
, namespace;
5092 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
5094 /* The parser did not find it, so it's not there. */
5095 cp_error ("unknown namespace `%D'", namespace);
5099 namespace = ORIGINAL_NAMESPACE (namespace);
5101 /* Build the alias. */
5102 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
5103 DECL_NAMESPACE_ALIAS (alias
) = namespace;
5107 /* Check a non-member using-declaration. Return the name and scope
5108 being used, and the USING_DECL, or NULL_TREE on failure. */
5111 validate_nonmember_using_decl (decl
, scope
, name
)
5116 if (TREE_CODE (decl
) == SCOPE_REF
5117 && TREE_OPERAND (decl
, 0) == std_node
)
5119 if (namespace_bindings_p ()
5120 && current_namespace
== global_namespace
)
5121 /* There's no need for a using declaration at all, here,
5122 since `std' is the same as `::'. We can't just pass this
5123 on because we'll complain later about declaring something
5124 in the same scope as a using declaration with the same
5125 name. We return NULL_TREE which indicates to the caller
5126 that there's no need to do any further processing. */
5129 *scope
= global_namespace
;
5130 *name
= TREE_OPERAND (decl
, 1);
5132 else if (TREE_CODE (decl
) == SCOPE_REF
)
5134 *scope
= TREE_OPERAND (decl
, 0);
5135 *name
= TREE_OPERAND (decl
, 1);
5137 /* [namespace.udecl]
5139 A using-declaration for a class member shall be a
5140 member-declaration. */
5141 if (TREE_CODE (*scope
) != NAMESPACE_DECL
)
5143 if (TYPE_P (*scope
))
5144 cp_error ("`%T' is not a namespace", *scope
);
5146 cp_error ("`%D' is not a namespace", *scope
);
5150 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
5151 || TREE_CODE (decl
) == TYPE_DECL
5152 || TREE_CODE (decl
) == TEMPLATE_DECL
)
5154 *scope
= global_namespace
;
5158 my_friendly_abort (382);
5160 *name
= DECL_NAME (*name
);
5161 /* Make a USING_DECL. */
5162 return push_using_decl (*scope
, *name
);
5165 /* Process local and global using-declarations. */
5168 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, newval
, newtype
)
5170 tree oldval
, oldtype
;
5171 tree
*newval
, *newtype
;
5175 *newval
= *newtype
= NULL_TREE
;
5176 decls
= make_node (CPLUS_BINDING
);
5177 if (!qualified_lookup_using_namespace (name
, scope
, decls
, 0))
5181 if (!BINDING_VALUE (decls
) && !BINDING_TYPE (decls
))
5183 cp_error ("`%D' not declared", name
);
5187 /* Check for using functions. */
5188 if (BINDING_VALUE (decls
) && is_overloaded_fn (BINDING_VALUE (decls
)))
5192 if (oldval
&& !is_overloaded_fn (oldval
))
5194 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls
)), oldval
);
5199 for (tmp
= BINDING_VALUE (decls
); tmp
; tmp
= OVL_NEXT (tmp
))
5201 tree new_fn
= OVL_CURRENT (tmp
);
5203 /* [namespace.udecl]
5205 If a function declaration in namespace scope or block
5206 scope has the same name and the same parameter types as a
5207 function introduced by a using declaration the program is
5209 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
5211 tree old_fn
= OVL_CURRENT (tmp1
);
5213 if (!OVL_USED (tmp1
)
5214 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn
)),
5215 TYPE_ARG_TYPES (TREE_TYPE (old_fn
))))
5217 /* There was already a non-using declaration in
5218 this scope with the same parameter types. */
5219 cp_error ("`%D' is already declared in this scope",
5223 else if (duplicate_decls (new_fn
, old_fn
))
5224 /* We're re-using something we already used
5225 before. We don't need to add it again. */
5229 /* If we broke out of the loop, there's no reason to add
5230 this function to the using declarations for this
5235 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
5236 if (TREE_CODE (*newval
) != OVERLOAD
)
5237 *newval
= ovl_cons (*newval
, NULL_TREE
);
5238 OVL_USED (*newval
) = 1;
5243 *newval
= BINDING_VALUE (decls
);
5245 duplicate_decls (*newval
, oldval
);
5248 *newtype
= BINDING_TYPE (decls
);
5249 if (oldtype
&& *newtype
&& oldtype
!= *newtype
)
5251 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5257 /* Process a using-declaration not appearing in class or local scope. */
5260 do_toplevel_using_decl (decl
)
5263 tree scope
, name
, binding
;
5264 tree oldval
, oldtype
, newval
, newtype
;
5266 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5267 if (decl
== NULL_TREE
)
5270 binding
= binding_for_name (name
, current_namespace
);
5272 oldval
= BINDING_VALUE (binding
);
5273 oldtype
= BINDING_TYPE (binding
);
5275 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5277 /* Copy declarations found. */
5279 BINDING_VALUE (binding
) = newval
;
5281 BINDING_TYPE (binding
) = newtype
;
5285 /* Process a using-declaration at function scope. */
5288 do_local_using_decl (decl
)
5292 tree oldval
, oldtype
, newval
, newtype
;
5294 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5295 if (decl
== NULL_TREE
)
5298 oldval
= lookup_name_current_level (name
);
5299 oldtype
= lookup_type_current_level (name
);
5301 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5305 if (is_overloaded_fn (newval
))
5309 /* We only need to push declarations for those functions
5310 that were not already bound in the current level.
5311 The old value might be NULL_TREE, it might be a single
5312 function, or an OVERLOAD. */
5313 if (oldval
&& TREE_CODE (oldval
) == OVERLOAD
)
5314 term
= OVL_FUNCTION (oldval
);
5317 for (fn
= newval
; fn
&& OVL_CURRENT (fn
) != term
;
5319 push_overloaded_decl (OVL_CURRENT (fn
),
5320 PUSH_LOCAL
| PUSH_USING
);
5323 push_local_binding (name
, newval
, PUSH_USING
);
5326 set_identifier_type_value (name
, newtype
);
5330 do_class_using_decl (decl
)
5335 if (TREE_CODE (decl
) != SCOPE_REF
5336 || !TYPE_P (TREE_OPERAND (decl
, 0)))
5338 cp_error ("using-declaration for non-member at class scope");
5341 name
= TREE_OPERAND (decl
, 1);
5342 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
5344 cp_error ("using-declaration for destructor");
5347 if (TREE_CODE (name
) == TYPE_DECL
)
5348 name
= DECL_NAME (name
);
5350 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 980716);
5352 value
= build_lang_decl (USING_DECL
, name
, void_type_node
);
5353 DECL_INITIAL (value
) = TREE_OPERAND (decl
, 0);
5357 /* Process a using-directive. */
5360 do_using_directive (namespace)
5363 if (namespace == std_node
)
5365 /* using namespace A::B::C; */
5366 if (TREE_CODE (namespace) == SCOPE_REF
)
5367 namespace = TREE_OPERAND (namespace, 1);
5368 if (TREE_CODE (namespace) == IDENTIFIER_NODE
)
5370 /* Lookup in lexer did not find a namespace. */
5371 cp_error ("namespace `%T' undeclared", namespace);
5374 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
5376 cp_error ("`%T' is not a namespace", namespace);
5379 namespace = ORIGINAL_NAMESPACE (namespace);
5380 if (!toplevel_bindings_p ())
5381 push_using_directive (namespace);
5384 add_using_namespace (current_namespace
, namespace, 0);
5388 check_default_args (x
)
5391 tree arg
= TYPE_ARG_TYPES (TREE_TYPE (x
));
5392 int saw_def
= 0, i
= 0 - (TREE_CODE (TREE_TYPE (x
)) == METHOD_TYPE
);
5393 for (; arg
&& arg
!= void_list_node
; arg
= TREE_CHAIN (arg
), ++i
)
5395 if (TREE_PURPOSE (arg
))
5399 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5410 TREE_USED (decl
) = 1;
5411 if (processing_template_decl
)
5413 assemble_external (decl
);
5415 /* Is it a synthesized method that needs to be synthesized? */
5416 if (TREE_CODE (decl
) == FUNCTION_DECL
5417 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
)
5418 && DECL_ARTIFICIAL (decl
)
5419 && ! DECL_INITIAL (decl
)
5420 /* Kludge: don't synthesize for default args. */
5421 && current_function_decl
)
5423 synthesize_method (decl
);
5424 /* If we've already synthesized the method we don't need to
5425 instantiate it, so we can return right away. */
5429 /* If this is a function or variable that is an instance of some
5430 template, we now know that we will need to actually do the
5431 instantiation. We check that DECL is not an explicit
5432 instantiation because that is not checked in instantiate_decl. */
5433 if ((DECL_NON_THUNK_FUNCTION_P (decl
) || TREE_CODE (decl
) == VAR_DECL
)
5434 && DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
5435 && (!DECL_EXPLICIT_INSTANTIATION (decl
)
5436 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INLINE (decl
))))
5437 instantiate_decl (decl
, /*defer_ok=*/1);
5440 /* Helper function for named_class_head_sans_basetype nonterminal. We
5441 have just seen something of the form `AGGR SCOPE::ID'. Return a
5442 TYPE_DECL for the type declared by ID in SCOPE. */
5445 handle_class_head (aggr
, scope
, id
)
5446 tree aggr
, scope
, id
;
5450 if (TREE_CODE (id
) == TYPE_DECL
)
5451 /* We must bash typedefs back to the main decl of the type. Otherwise
5452 we become confused about scopes. */
5453 decl
= TYPE_MAIN_DECL (TREE_TYPE (id
));
5454 else if (DECL_CLASS_TEMPLATE_P (id
))
5455 decl
= DECL_TEMPLATE_RESULT (id
);
5458 tree current
= current_scope();
5460 if (current
== NULL_TREE
)
5461 current
= current_namespace
;
5462 if (scope
== std_node
)
5463 scope
= global_namespace
;
5464 if (scope
== NULL_TREE
)
5465 scope
= global_namespace
;
5466 if (scope
== current
)
5468 /* We've been given AGGR SCOPE::ID, when we're already inside SCOPE.
5469 Be nice about it. */
5471 cp_pedwarn ("extra qualification `%T::' on member `%D' ignored",
5472 FROB_CONTEXT (scope
), id
);
5474 else if (scope
!= global_namespace
)
5475 cp_error ("`%T' does not have a nested type named `%D'", scope
, id
);
5477 cp_error ("no file-scope type named `%D'", id
);
5479 /* Inject it at the current scope. */
5480 decl
= TYPE_MAIN_DECL (xref_tag (aggr
, id
, 1));
5483 /* Enter the SCOPE. If this turns out not to be a definition, the
5484 parser must leave the scope. */
5485 push_scope (CP_DECL_CONTEXT (decl
));
5487 /* If we see something like:
5489 template <typename T> struct S::I ....
5491 we must create a TEMPLATE_DECL for the nested type. */
5492 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5493 decl
= push_template_decl (decl
);
5498 /* Initialize decl2.c. */
5503 ggc_add_tree_root (&decl_namespace_list
, 1);
5504 ggc_add_tree_varray_root (&deferred_fns
, 1);
5505 ggc_add_tree_varray_root (&pending_statics
, 1);
5506 ggc_add_tree_varray_root (&ssdf_decls
, 1);
5507 ggc_add_tree_root (&ssdf_decl
, 1);
5508 ggc_add_tree_root (&priority_decl
, 1);
5509 ggc_add_tree_root (&initialize_p_decl
, 1);
5510 ggc_add_tree_root (&pending_vtables
, 1);