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 tree get_sentry
PARAMS ((tree
));
66 static void mark_vtable_entries
PARAMS ((tree
));
67 static void grok_function_init
PARAMS ((tree
, tree
));
68 static int finish_vtable_vardecl
PARAMS ((tree
*, void *));
69 static int prune_vtable_vardecl
PARAMS ((tree
*, void *));
70 static int is_namespace_ancestor
PARAMS ((tree
, tree
));
71 static void add_using_namespace
PARAMS ((tree
, tree
, int));
72 static tree ambiguous_decl
PARAMS ((tree
, tree
, tree
,int));
73 static tree build_anon_union_vars
PARAMS ((tree
, tree
*, int, int));
74 static int acceptable_java_type
PARAMS ((tree
));
75 static void output_vtable_inherit
PARAMS ((tree
));
76 static tree start_objects
PARAMS ((int, int));
77 static void finish_objects
PARAMS ((int, int, tree
));
78 static tree merge_functions
PARAMS ((tree
, tree
));
79 static tree decl_namespace
PARAMS ((tree
));
80 static tree validate_nonmember_using_decl
PARAMS ((tree
, tree
*, tree
*));
81 static void do_nonmember_using_decl
PARAMS ((tree
, tree
, tree
, tree
,
83 static tree start_static_storage_duration_function
PARAMS ((void));
84 static void finish_static_storage_duration_function
PARAMS ((tree
));
85 static priority_info get_priority_info
PARAMS ((int));
86 static void do_static_initialization
PARAMS ((tree
, tree
));
87 static void do_static_destruction
PARAMS ((tree
));
88 static tree start_static_initialization_or_destruction
PARAMS ((tree
, int));
89 static void finish_static_initialization_or_destruction
PARAMS ((tree
));
90 static void generate_ctor_or_dtor_function
PARAMS ((int, int));
91 static int generate_ctor_and_dtor_functions_for_priority
92 PARAMS ((splay_tree_node
, void *));
93 static tree prune_vars_needing_no_initialization
PARAMS ((tree
));
94 static void write_out_vars
PARAMS ((tree
));
95 static void import_export_class
PARAMS ((tree
));
96 static tree key_method
PARAMS ((tree
));
97 static int compare_options
PARAMS ((const PTR
, const PTR
));
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 for -fno-strict-prototype switch: do not consider empty
364 argument prototype to mean function takes no arguments. */
366 int flag_strict_prototype
= 2;
367 int strict_prototype
= 1;
368 int strict_prototypes_lang_c
, strict_prototypes_lang_cplusplus
= 1;
370 /* Nonzero means that labels can be used as first-class objects */
374 /* Nonzero means allow Microsoft extensions without a pedwarn. */
376 int flag_ms_extensions
;
378 /* Non-zero means to collect statistics which might be expensive
379 and to print them when we are done. */
380 int flag_detailed_statistics
;
382 /* C++ specific flags. */
383 /* Zero means that `this' is a *const. This gives nice behavior in the
384 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
385 -2 means we're constructing an object and it has fixed type. */
387 int flag_this_is_variable
;
389 /* Nonzero means we should attempt to elide constructors when possible. */
391 int flag_elide_constructors
= 1;
393 /* Nonzero means that member functions defined in class scope are
394 inline by default. */
396 int flag_default_inline
= 1;
398 /* Controls whether compiler generates 'type descriptor' that give
399 run-time type information. */
402 /* Nonzero if we wish to output cross-referencing information
403 for the GNU class browser. */
404 extern int flag_gnu_xref
;
406 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
409 int flag_huge_objects
;
411 /* Nonzero if we want to conserve space in the .o files. We do this
412 by putting uninitialized data and runtime initialized data into
413 .common instead of .data at the expense of not flagging multiple
416 int flag_conserve_space
;
418 /* Nonzero if we want to obey access control semantics. */
420 int flag_access_control
= 1;
422 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
424 int flag_operator_names
= 1;
426 /* Nonzero if we want to check the return value of new and avoid calling
427 constructors if it is a null pointer. */
431 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
432 initialization variables.
433 0: Old rules, set by -fno-for-scope.
434 2: New ISO rules, set by -ffor-scope.
435 1: Try to implement new ISO rules, but with backup compatibility
436 (and warnings). This is the default, for now. */
438 int flag_new_for_scope
= 1;
440 /* Nonzero if we want to emit defined symbols with common-like linkage as
441 weak symbols where possible, in order to conform to C++ semantics.
442 Otherwise, emit them as local symbols. */
446 /* Nonzero to enable experimental ABI changes. */
450 /* Nonzero to use __cxa_atexit, rather than atexit, to register
451 destructors for local statics and global objects. */
453 int flag_use_cxa_atexit
;
455 /* Nonzero to not ignore namespace std. */
457 int flag_honor_std
= ENABLE_STD_NAMESPACE
;
459 /* Nonzero if we should expand functions calls inline at the tree
460 level, rather than at the RTL level. */
462 int flag_inline_trees
= 0;
464 /* Maximum template instantiation depth. Must be at least 17 for ISO
467 int max_tinst_depth
= 17;
469 /* The name-mangling scheme to use. Must be 1 or greater to support
470 template functions with identical types, but different template
472 int name_mangling_version
= 2;
474 /* Nonzero if wchar_t should be `unsigned short' instead of whatever it
475 would normally be, for use with WINE. */
476 int flag_short_wchar
;
478 /* Nonzero if squashed mangling is to be performed.
479 This uses the B and K codes to reference previously seen class types
480 and class qualifiers. */
481 int flag_do_squangling
;
483 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
487 /* Nonzero means make the default pedwarns warnings instead of errors.
488 The value of this flag is ignored if -pedantic is specified. */
492 /* Nonzero means to implement standard semantics for exception
493 specifications, calling unexpected if an exception is thrown that
494 doesn't match the specification. Zero means to treat them as
495 assertions and optimize accordingly, but not check them. */
497 int flag_enforce_eh_specs
= 1;
499 /* If this variable is defined to a non-NULL value, it will be called
500 after the file has been completely parsed. */
502 void (*back_end_hook
) PARAMS ((tree
));
504 /* Table of language-dependent -f options.
505 STRING is the option name. VARIABLE is the address of the variable.
506 ON_VALUE is the value to store in VARIABLE
507 if `-fSTRING' is seen as an option.
508 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
510 static struct { const char *string
; int *variable
; int on_value
;}
514 {"signed-char", &flag_signed_char
, 1},
515 {"unsigned-char", &flag_signed_char
, 0},
516 {"signed-bitfields", &flag_signed_bitfields
, 1},
517 {"unsigned-bitfields", &flag_signed_bitfields
, 0},
518 {"short-enums", &flag_short_enums
, 1},
519 {"short-double", &flag_short_double
, 1},
520 {"short-wchar", &flag_short_wchar
, 1},
521 {"cond-mismatch", &flag_cond_mismatch
, 1},
522 {"asm", &flag_no_asm
, 0},
523 {"builtin", &flag_no_builtin
, 0},
525 /* C++-only options. */
526 {"access-control", &flag_access_control
, 1},
527 {"check-new", &flag_check_new
, 1},
528 {"conserve-space", &flag_conserve_space
, 1},
529 {"const-strings", &flag_const_strings
, 1},
530 {"default-inline", &flag_default_inline
, 1},
531 {"dollars-in-identifiers", &dollars_in_ident
, 1},
532 {"elide-constructors", &flag_elide_constructors
, 1},
533 {"enforce-eh-specs", &flag_enforce_eh_specs
, 1},
534 {"external-templates", &flag_external_templates
, 1},
535 {"for-scope", &flag_new_for_scope
, 2},
536 {"gnu-keywords", &flag_no_gnu_keywords
, 0},
537 {"handle-exceptions", &flag_exceptions
, 1},
538 {"honor-std", &flag_honor_std
, 1},
539 {"huge-objects", &flag_huge_objects
, 1},
540 {"implement-inlines", &flag_implement_inlines
, 1},
541 {"implicit-inline-templates", &flag_implicit_inline_templates
, 1},
542 {"implicit-templates", &flag_implicit_templates
, 1},
543 {"labels-ok", &flag_labels_ok
, 1},
544 {"ms-extensions", &flag_ms_extensions
, 1},
545 {"nonansi-builtins", &flag_no_nonansi_builtin
, 0},
546 {"operator-names", &flag_operator_names
, 1},
547 {"optional-diags", &flag_optional_diags
, 1},
548 {"permissive", &flag_permissive
, 1},
549 {"repo", &flag_use_repository
, 1},
550 {"rtti", &flag_rtti
, 1},
551 {"squangle", &flag_do_squangling
, 1},
552 {"stats", &flag_detailed_statistics
, 1},
553 {"strict-prototype", &flag_strict_prototype
, 1},
554 {"use-cxa-atexit", &flag_use_cxa_atexit
, 1},
555 {"vtable-gc", &flag_vtable_gc
, 1},
556 {"vtable-thunks", &flag_vtable_thunks
, 1},
557 {"weak", &flag_weak
, 1},
558 {"xref", &flag_gnu_xref
, 1}
561 /* The list of `-f' options that we no longer support. The `-f'
562 prefix is not given in this table. The `-fno-' variants are not
563 listed here. This table must be kept in alphabetical order. */
564 static const char * const unsupported_options
[] = {
572 /* Compare two option strings, pointed two by P1 and P2, for use with
576 compare_options (p1
, p2
)
580 return strcmp (*((char **) p1
), *((char **) p2
));
583 /* Decode the string P as a language-specific option.
584 Return the number of strings consumed for a valid option.
585 Otherwise return 0. Should not complain if it does not
586 recognise the option. */
589 lang_decode_option (argc
, argv
)
597 int strings_processed
;
598 const char *p
= argv
[0];
600 strings_processed
= cpp_handle_option (&parse_in
, argc
, argv
);
602 strings_processed
= 0;
603 #endif /* ! USE_CPPLIB */
605 if (!strcmp (p
, "-ftraditional") || !strcmp (p
, "-traditional"))
607 else if (p
[0] == '-' && p
[1] == 'f')
609 /* Some kind of -f option.
610 P's value is the option sans `-f'.
611 Search for it in the table of options. */
612 const char *option_value
= NULL
;
613 const char *positive_option
;
617 /* Try special -f options. */
619 /* See if this is one of the options no longer supported. We
620 used to support these options, so we continue to accept them,
622 if (strncmp (p
, "no-", strlen ("no-")) == 0)
623 positive_option
= p
+ strlen ("no-");
627 /* If the option is present, issue a warning. Indicate to our
628 caller that the option was processed successfully. */
629 if (bsearch (&positive_option
,
631 (sizeof (unsupported_options
)
632 / sizeof (unsupported_options
[0])),
633 sizeof (unsupported_options
[0]),
636 warning ("-f%s is no longer supported", p
);
640 if (!strcmp (p
, "handle-exceptions")
641 || !strcmp (p
, "no-handle-exceptions"))
642 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
643 else if (! strcmp (p
, "alt-external-templates"))
645 flag_external_templates
= 1;
646 flag_alt_external_templates
= 1;
647 cp_deprecated ("-falt-external-templates");
649 else if (! strcmp (p
, "no-alt-external-templates"))
650 flag_alt_external_templates
= 0;
651 else if (!strcmp (p
, "repo"))
653 flag_use_repository
= 1;
654 flag_implicit_templates
= 0;
656 else if (!strcmp (p
, "external-templates"))
658 flag_external_templates
= 1;
659 cp_deprecated ("-fexternal-templates");
661 else if (!strcmp (p
, "new-abi"))
664 flag_do_squangling
= 1;
665 flag_vtable_thunks
= 1;
667 else if (!strcmp (p
, "no-new-abi"))
670 flag_do_squangling
= 0;
672 else if ((option_value
673 = skip_leading_substring (p
, "template-depth-")))
675 = read_integral_parameter (option_value
, p
- 2, max_tinst_depth
);
676 else if ((option_value
677 = skip_leading_substring (p
, "name-mangling-version-")))
678 name_mangling_version
679 = read_integral_parameter (option_value
, p
- 2, name_mangling_version
);
680 else if ((option_value
681 = skip_leading_substring (p
, "dump-translation-unit-")))
684 error ("no file specified with -fdump-translation-unit");
686 flag_dump_translation_unit
= option_value
;
693 !found
&& j
< (sizeof (lang_f_options
)
694 / sizeof (lang_f_options
[0]));
697 if (!strcmp (p
, lang_f_options
[j
].string
))
699 *lang_f_options
[j
].variable
= lang_f_options
[j
].on_value
;
700 /* A goto here would be cleaner,
701 but breaks the vax pcc. */
704 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-'
705 && ! strcmp (p
+3, lang_f_options
[j
].string
))
707 *lang_f_options
[j
].variable
= ! lang_f_options
[j
].on_value
;
715 else if (p
[0] == '-' && p
[1] == 'W')
719 /* The -W options control the warning behavior of the compiler. */
722 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-')
725 if (!strcmp (p
, "implicit"))
726 warn_implicit
= setting
;
727 else if (!strcmp (p
, "long-long"))
728 warn_long_long
= setting
;
729 else if (!strcmp (p
, "return-type"))
730 warn_return_type
= setting
;
731 else if (!strcmp (p
, "ctor-dtor-privacy"))
732 warn_ctor_dtor_privacy
= setting
;
733 else if (!strcmp (p
, "write-strings"))
734 warn_write_strings
= setting
;
735 else if (!strcmp (p
, "cast-qual"))
736 warn_cast_qual
= setting
;
737 else if (!strcmp (p
, "char-subscripts"))
738 warn_char_subscripts
= setting
;
739 else if (!strcmp (p
, "pointer-arith"))
740 warn_pointer_arith
= setting
;
741 else if (!strcmp (p
, "missing-prototypes"))
742 warn_missing_prototypes
= setting
;
743 else if (!strcmp (p
, "redundant-decls"))
744 warn_redundant_decls
= setting
;
745 else if (!strcmp (p
, "missing-braces"))
746 warn_missing_braces
= setting
;
747 else if (!strcmp (p
, "sign-compare"))
748 warn_sign_compare
= setting
;
749 else if (!strcmp (p
, "float-equal"))
750 warn_float_equal
= setting
;
751 else if (!strcmp (p
, "format"))
752 warn_format
= setting
;
753 else if (!strcmp (p
, "conversion"))
754 warn_conversion
= setting
;
755 else if (!strcmp (p
, "parentheses"))
756 warn_parentheses
= setting
;
757 else if (!strcmp (p
, "non-virtual-dtor"))
758 warn_nonvdtor
= setting
;
759 else if (!strcmp (p
, "extern-inline"))
760 warn_extern_inline
= setting
;
761 else if (!strcmp (p
, "reorder"))
762 warn_reorder
= setting
;
763 else if (!strcmp (p
, "synth"))
764 warn_synth
= setting
;
765 else if (!strcmp (p
, "pmf-conversions"))
766 warn_pmf2ptr
= setting
;
767 else if (!strcmp (p
, "effc++"))
769 else if (!strcmp (p
, "sign-promo"))
770 warn_sign_promo
= setting
;
771 else if (!strcmp (p
, "old-style-cast"))
772 warn_old_style_cast
= setting
;
773 else if (!strcmp (p
, "overloaded-virtual"))
774 warn_overloaded_virtual
= setting
;
775 else if (!strcmp (p
, "multichar"))
776 warn_multichar
= setting
;
777 else if (!strcmp (p
, "unknown-pragmas"))
778 /* Set to greater than 1, so that even unknown pragmas in
779 system headers will be warned about. */
780 warn_unknown_pragmas
= setting
* 2;
781 else if (!strcmp (p
, "non-template-friend"))
782 warn_nontemplate_friend
= setting
;
783 else if (!strcmp (p
, "deprecated"))
784 warn_deprecated
= setting
;
785 else if (!strcmp (p
, "comment"))
786 ; /* cpp handles this one. */
787 else if (!strcmp (p
, "comments"))
788 ; /* cpp handles this one. */
789 else if (!strcmp (p
, "trigraphs"))
790 ; /* cpp handles this one. */
791 else if (!strcmp (p
, "import"))
792 ; /* cpp handles this one. */
793 else if (!strcmp (p
, "all"))
795 warn_return_type
= setting
;
796 set_Wunused (setting
);
797 warn_implicit
= setting
;
798 warn_switch
= setting
;
799 warn_format
= setting
;
800 warn_parentheses
= setting
;
801 warn_missing_braces
= setting
;
802 warn_sign_compare
= setting
;
803 warn_multichar
= setting
;
804 /* We save the value of warn_uninitialized, since if they put
805 -Wuninitialized on the command line, we need to generate a
806 warning about not using it without also specifying -O. */
807 if (warn_uninitialized
!= 1)
808 warn_uninitialized
= (setting
? 2 : 0);
809 /* Only warn about unknown pragmas that are not in system
811 warn_unknown_pragmas
= 1;
813 /* C++-specific warnings. */
814 warn_ctor_dtor_privacy
= setting
;
815 warn_nonvdtor
= setting
;
816 warn_reorder
= setting
;
817 warn_nontemplate_friend
= setting
;
819 else return strings_processed
;
821 else if (!strcmp (p
, "-ansi"))
822 flag_no_nonansi_builtin
= 1, flag_ansi
= 1,
823 flag_no_gnu_keywords
= 1;
825 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
826 it's probably safe to assume no sane person would ever want to use this
827 under normal circumstances. */
828 else if (!strcmp (p
, "-spew-debug"))
832 return strings_processed
;
837 /* Incorporate `const' and `volatile' qualifiers for member functions.
838 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
839 QUALS is a list of qualifiers. Returns any explicit
840 top-level qualifiers of the method's this pointer, anything other than
841 TYPE_UNQUALIFIED will be an extension. */
844 grok_method_quals (ctype
, function
, quals
)
845 tree ctype
, function
, quals
;
847 tree fntype
= TREE_TYPE (function
);
848 tree raises
= TYPE_RAISES_EXCEPTIONS (fntype
);
849 int type_quals
= TYPE_UNQUALIFIED
;
850 int dup_quals
= TYPE_UNQUALIFIED
;
851 int this_quals
= TYPE_UNQUALIFIED
;
855 int tq
= cp_type_qual_from_rid (TREE_VALUE (quals
));
857 if ((type_quals
| this_quals
) & tq
)
859 else if (tq
& TYPE_QUAL_RESTRICT
)
863 quals
= TREE_CHAIN (quals
);
867 if (dup_quals
!= TYPE_UNQUALIFIED
)
868 cp_error ("duplicate type qualifiers in %s declaration",
869 TREE_CODE (function
) == FUNCTION_DECL
870 ? "member function" : "type");
872 ctype
= cp_build_qualified_type (ctype
, type_quals
);
873 fntype
= build_cplus_method_type (ctype
, TREE_TYPE (fntype
),
874 (TREE_CODE (fntype
) == METHOD_TYPE
875 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype
))
876 : TYPE_ARG_TYPES (fntype
)));
878 fntype
= build_exception_variant (fntype
, raises
);
880 TREE_TYPE (function
) = fntype
;
884 /* Warn when -fexternal-templates is used and #pragma
885 interface/implementation is not used all the times it should be,
889 warn_if_unknown_interface (decl
)
892 static int already_warned
= 0;
893 if (already_warned
++)
896 if (flag_alt_external_templates
)
898 tree til
= tinst_for_decl ();
900 const char *sf
= input_filename
;
904 lineno
= TINST_LINE (til
);
905 input_filename
= TINST_FILE (til
);
907 cp_warning ("template `%#D' instantiated in file without #pragma interface",
913 cp_warning_at ("template `%#D' defined in file without #pragma interface",
917 /* A subroutine of the parser, to handle a component list. */
920 grok_x_components (specs
)
923 struct pending_inline
**p
;
926 specs
= strip_attrs (specs
);
928 check_tag_decl (specs
);
929 t
= groktypename (build_decl_list (specs
, NULL_TREE
));
931 /* The only case where we need to do anything additional here is an
932 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
933 if (t
== NULL_TREE
|| !ANON_AGGR_TYPE_P (t
))
936 fixup_anonymous_aggr (t
);
937 finish_member_declaration (build_decl (FIELD_DECL
, NULL_TREE
, t
));
939 /* Ignore any inline function definitions in the anonymous union
940 since an anonymous union may not have function members. */
941 p
= &pending_inlines
;
942 for (; *p
; *p
= (*p
)->next
)
943 if (DECL_CONTEXT ((*p
)->fndecl
) != t
)
947 /* Returns a PARM_DECL for a parameter of the indicated TYPE, with the
951 build_artificial_parm (name
, type
)
957 parm
= build_decl (PARM_DECL
, name
, type
);
958 SET_DECL_ARTIFICIAL (parm
);
959 DECL_ARG_TYPE (parm
) = type
;
963 /* Constructors for types with virtual baseclasses need an "in-charge" flag
964 saying whether this constructor is responsible for initialization of
965 virtual baseclasses or not. All destructors also need this "in-charge"
966 flag, which additionally determines whether or not the destructor should
967 free the memory for the object.
969 This function adds the "in-charge" flag to member function FN if
970 appropriate. It is called from grokclassfn and tsubst.
971 FN must be either a constructor or destructor. */
974 maybe_retrofit_in_chrg (fn
)
977 tree basetype
, arg_types
, parms
, parm
, fntype
;
979 /* If we've already add the in-charge parameter don't do it again. */
980 if (DECL_HAS_IN_CHARGE_PARM_P (fn
))
983 /* When processing templates we can't know, in general, whether or
984 not we're going to have virtual baseclasses. */
985 if (uses_template_parms (fn
))
988 /* We don't need an in-charge parameter for constructors that don't
989 have virtual bases. */
990 if (DECL_CONSTRUCTOR_P (fn
)
991 && !TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn
)))
994 /* First add it to DECL_ARGUMENTS... */
995 parm
= build_artificial_parm (in_charge_identifier
, integer_type_node
);
996 TREE_READONLY (parm
) = 1;
997 parms
= DECL_ARGUMENTS (fn
);
998 TREE_CHAIN (parm
) = TREE_CHAIN (parms
);
999 TREE_CHAIN (parms
) = parm
;
1001 /* ...and then to TYPE_ARG_TYPES. */
1002 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
1003 basetype
= TREE_TYPE (TREE_VALUE (arg_types
));
1004 arg_types
= hash_tree_chain (integer_type_node
, TREE_CHAIN (arg_types
));
1005 fntype
= build_cplus_method_type (basetype
, TREE_TYPE (TREE_TYPE (fn
)),
1007 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)))
1008 fntype
= build_exception_variant (fntype
,
1009 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)));
1010 TREE_TYPE (fn
) = fntype
;
1012 /* Now we've got the in-charge parameter. */
1013 DECL_HAS_IN_CHARGE_PARM_P (fn
) = 1;
1015 /* If this is a subobject constructor or destructor, our caller will
1016 pass us a pointer to our VTT. */
1017 if (flag_new_abi
&& TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn
)))
1019 DECL_VTT_PARM (fn
) = build_artificial_parm (vtt_parm_identifier
,
1021 DECL_CONTEXT (DECL_VTT_PARM (fn
)) = fn
;
1022 DECL_USE_VTT_PARM (fn
) = build_artificial_parm (NULL_TREE
,
1024 DECL_CONTEXT (DECL_USE_VTT_PARM (fn
)) = fn
;
1028 /* Classes overload their constituent function names automatically.
1029 When a function name is declared in a record structure,
1030 its name is changed to it overloaded name. Since names for
1031 constructors and destructors can conflict, we place a leading
1032 '$' for destructors.
1034 CNAME is the name of the class we are grokking for.
1036 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
1038 FLAGS contains bits saying what's special about today's
1039 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
1041 If FUNCTION is a destructor, then we must add the `auto-delete' field
1042 as a second parameter. There is some hair associated with the fact
1043 that we must "declare" this variable in the manner consistent with the
1044 way the rest of the arguments were declared.
1046 QUALS are the qualifiers for the this pointer. */
1049 grokclassfn (ctype
, function
, flags
, quals
)
1050 tree ctype
, function
;
1051 enum overload_flags flags
;
1054 tree fn_name
= DECL_NAME (function
);
1055 int this_quals
= TYPE_UNQUALIFIED
;
1057 /* Even within an `extern "C"' block, members get C++ linkage. See
1058 [dcl.link] for details. */
1059 DECL_LANGUAGE (function
) = lang_cplusplus
;
1061 if (fn_name
== NULL_TREE
)
1063 error ("name missing for member function");
1064 fn_name
= get_identifier ("<anonymous>");
1065 DECL_NAME (function
) = fn_name
;
1069 this_quals
= grok_method_quals (ctype
, function
, quals
);
1071 if (TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1073 /* Must add the class instance variable up front. */
1074 /* Right now we just make this a pointer. But later
1075 we may wish to make it special. */
1076 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function
)));
1080 /* The `this' parameter is implicitly `const'; it cannot be
1082 this_quals
|= TYPE_QUAL_CONST
;
1083 qual_type
= cp_build_qualified_type (type
, this_quals
);
1084 parm
= build_artificial_parm (this_identifier
, qual_type
);
1085 c_apply_type_quals_to_decl (this_quals
, parm
);
1087 /* We can make this a register, so long as we don't
1088 accidentally complain if someone tries to take its address. */
1089 DECL_REGISTER (parm
) = 1;
1090 TREE_CHAIN (parm
) = last_function_parms
;
1091 last_function_parms
= parm
;
1094 DECL_ARGUMENTS (function
) = last_function_parms
;
1095 DECL_CONTEXT (function
) = ctype
;
1097 if (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
))
1098 maybe_retrofit_in_chrg (function
);
1100 if (flags
== DTOR_FLAG
)
1102 DECL_DESTRUCTOR_P (function
) = 1;
1105 set_mangled_name_for_decl (function
);
1107 DECL_ASSEMBLER_NAME (function
) = build_destructor_name (ctype
);
1109 TYPE_HAS_DESTRUCTOR (ctype
) = 1;
1112 set_mangled_name_for_decl (function
);
1115 /* Work on the expr used by alignof (this is only called by the parser). */
1124 if (processing_template_decl
)
1125 return build_min (ALIGNOF_EXPR
, sizetype
, expr
);
1127 if (TREE_CODE (expr
) == COMPONENT_REF
1128 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
1129 error ("`__alignof__' applied to a bit-field");
1131 if (TREE_CODE (expr
) == INDIRECT_REF
)
1133 best
= t
= TREE_OPERAND (expr
, 0);
1134 bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1136 while (TREE_CODE (t
) == NOP_EXPR
1137 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
1140 t
= TREE_OPERAND (t
, 0);
1141 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1142 if (thisalign
> bestalign
)
1143 best
= t
, bestalign
= thisalign
;
1145 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
1148 return c_alignof (TREE_TYPE (expr
));
1151 /* Create an ARRAY_REF, checking for the user doing things backwards
1155 grok_array_decl (array_expr
, index_exp
)
1156 tree array_expr
, index_exp
;
1158 tree type
= TREE_TYPE (array_expr
);
1159 tree p1
, p2
, i1
, i2
;
1161 if (type
== error_mark_node
|| index_exp
== error_mark_node
)
1162 return error_mark_node
;
1163 if (processing_template_decl
)
1164 return build_min (ARRAY_REF
, type
? TREE_TYPE (type
) : NULL_TREE
,
1165 array_expr
, index_exp
);
1167 if (type
== NULL_TREE
)
1169 /* Something has gone very wrong. Assume we are mistakenly reducing
1170 an expression instead of a declaration. */
1171 error ("parser may be lost: is there a '{' missing somewhere?");
1175 if (TREE_CODE (type
) == OFFSET_TYPE
1176 || TREE_CODE (type
) == REFERENCE_TYPE
)
1177 type
= TREE_TYPE (type
);
1179 /* If they have an `operator[]', use that. */
1180 if (IS_AGGR_TYPE (type
) || IS_AGGR_TYPE (TREE_TYPE (index_exp
)))
1181 return build_opfncall (ARRAY_REF
, LOOKUP_NORMAL
,
1182 array_expr
, index_exp
, NULL_TREE
);
1184 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1185 is a little-known fact that, if `a' is an array and `i' is an
1186 int, you can write `i[a]', which means the same thing as `a[i]'. */
1188 if (TREE_CODE (type
) == ARRAY_TYPE
)
1191 p1
= build_expr_type_conversion (WANT_POINTER
, array_expr
, 0);
1193 if (TREE_CODE (TREE_TYPE (index_exp
)) == ARRAY_TYPE
)
1196 p2
= build_expr_type_conversion (WANT_POINTER
, index_exp
, 0);
1198 i1
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, array_expr
, 0);
1199 i2
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, index_exp
, 0);
1201 if ((p1
&& i2
) && (i1
&& p2
))
1202 error ("ambiguous conversion for array subscript");
1205 array_expr
= p1
, index_exp
= i2
;
1207 array_expr
= p2
, index_exp
= i1
;
1210 cp_error ("invalid types `%T[%T]' for array subscript",
1211 type
, TREE_TYPE (index_exp
));
1212 return error_mark_node
;
1215 if (array_expr
== error_mark_node
|| index_exp
== error_mark_node
)
1216 error ("ambiguous conversion for array subscript");
1218 return build_array_ref (array_expr
, index_exp
);
1221 /* Given the cast expression EXP, checking out its validity. Either return
1222 an error_mark_node if there was an unavoidable error, return a cast to
1223 void for trying to delete a pointer w/ the value 0, or return the
1224 call to delete. If DOING_VEC is 1, we handle things differently
1225 for doing an array delete. If DOING_VEC is 2, they gave us the
1226 array size as an argument to delete.
1227 Implements ARM $5.3.4. This is called from the parser. */
1230 delete_sanity (exp
, size
, doing_vec
, use_global_delete
)
1232 int doing_vec
, use_global_delete
;
1235 /* For a regular vector delete (aka, no size argument) we will pass
1236 this down as a NULL_TREE into build_vec_delete. */
1237 tree maxindex
= NULL_TREE
;
1239 if (exp
== error_mark_node
)
1242 if (processing_template_decl
)
1244 t
= build_min (DELETE_EXPR
, void_type_node
, exp
, size
);
1245 DELETE_EXPR_USE_GLOBAL (t
) = use_global_delete
;
1246 DELETE_EXPR_USE_VEC (t
) = doing_vec
;
1250 if (TREE_CODE (exp
) == OFFSET_REF
)
1251 exp
= resolve_offset_ref (exp
);
1252 exp
= convert_from_reference (exp
);
1253 t
= stabilize_reference (exp
);
1254 t
= build_expr_type_conversion (WANT_POINTER
, t
, 1);
1256 if (t
== NULL_TREE
|| t
== error_mark_node
)
1258 cp_error ("type `%#T' argument given to `delete', expected pointer",
1260 return error_mark_node
;
1265 maxindex
= build_binary_op (MINUS_EXPR
, size
, integer_one_node
);
1266 pedwarn ("anachronistic use of array size in vector delete");
1269 type
= TREE_TYPE (t
);
1271 /* As of Valley Forge, you can delete a pointer to const. */
1273 /* You can't delete functions. */
1274 if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
1276 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
1277 return error_mark_node
;
1280 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1281 if (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
)
1282 cp_warning ("`%T' is not a pointer-to-object type", type
);
1284 /* An array can't have been allocated by new, so complain. */
1285 if (TREE_CODE (t
) == ADDR_EXPR
1286 && TREE_CODE (TREE_OPERAND (t
, 0)) == VAR_DECL
1287 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == ARRAY_TYPE
)
1288 cp_warning ("deleting array `%#D'", TREE_OPERAND (t
, 0));
1290 /* Deleting a pointer with the value zero is valid and has no effect. */
1291 if (integer_zerop (t
))
1292 return build1 (NOP_EXPR
, void_type_node
, t
);
1295 return build_vec_delete (t
, maxindex
, sfk_deleting_destructor
,
1299 if (IS_AGGR_TYPE (TREE_TYPE (type
))
1300 && TYPE_GETS_REG_DELETE (TREE_TYPE (type
)))
1302 /* Only do access checking here; we'll be calling op delete
1303 from the destructor. */
1304 tree tmp
= build_op_delete_call (DELETE_EXPR
, t
, size_zero_node
,
1305 LOOKUP_NORMAL
, NULL_TREE
);
1306 if (tmp
== error_mark_node
)
1307 return error_mark_node
;
1310 return build_delete (type
, t
, sfk_deleting_destructor
,
1311 LOOKUP_NORMAL
, use_global_delete
);
1315 /* Report an error if the indicated template declaration is not the
1316 sort of thing that should be a member template. */
1319 check_member_template (tmpl
)
1324 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
1325 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1327 if (TREE_CODE (decl
) == FUNCTION_DECL
1328 || (TREE_CODE (decl
) == TYPE_DECL
1329 && IS_AGGR_TYPE (TREE_TYPE (decl
))))
1331 if (current_function_decl
)
1332 /* 14.5.2.2 [temp.mem]
1334 A local class shall not have member templates. */
1335 cp_error ("invalid declaration of member template `%#D' in local class",
1338 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
1340 /* 14.5.2.3 [temp.mem]
1342 A member function template shall not be virtual. */
1344 ("invalid use of `virtual' in template declaration of `%#D'",
1346 DECL_VIRTUAL_P (decl
) = 0;
1349 /* The debug-information generating code doesn't know what to do
1350 with member templates. */
1351 DECL_IGNORED_P (tmpl
) = 1;
1354 cp_error ("template declaration of `%#D'", decl
);
1357 /* Return true iff TYPE is a valid Java parameter or return type. */
1360 acceptable_java_type (type
)
1363 if (TREE_CODE (type
) == VOID_TYPE
|| TYPE_FOR_JAVA (type
))
1365 if (TREE_CODE (type
) == POINTER_TYPE
)
1367 type
= TREE_TYPE (type
);
1368 if (TREE_CODE (type
) == RECORD_TYPE
)
1371 if (! TYPE_FOR_JAVA (type
))
1373 if (! CLASSTYPE_TEMPLATE_INFO (type
))
1375 args
= CLASSTYPE_TI_ARGS (type
);
1376 i
= TREE_VEC_LENGTH (args
);
1379 type
= TREE_VEC_ELT (args
, i
);
1380 if (TREE_CODE (type
) == POINTER_TYPE
)
1381 type
= TREE_TYPE (type
);
1382 if (! TYPE_FOR_JAVA (type
))
1391 /* For a METHOD in a Java class CTYPE, return 1 if
1392 the parameter and return types are valid Java types.
1393 Otherwise, print appropriate error messages, and return 0. */
1396 check_java_method (method
)
1400 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (method
));
1401 tree ret_type
= TREE_TYPE (TREE_TYPE (method
));
1402 if (! acceptable_java_type (ret_type
))
1404 cp_error ("Java method '%D' has non-Java return type `%T'",
1408 for (; arg_types
!= NULL_TREE
; arg_types
= TREE_CHAIN (arg_types
))
1410 tree type
= TREE_VALUE (arg_types
);
1411 if (! acceptable_java_type (type
))
1413 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1418 return jerr
? 0 : 1;
1421 /* Sanity check: report error if this function FUNCTION is not
1422 really a member of the class (CTYPE) it is supposed to belong to.
1423 CNAME is the same here as it is for grokclassfn above. */
1426 check_classfn (ctype
, function
)
1427 tree ctype
, function
;
1429 tree fn_name
= DECL_NAME (function
);
1430 tree fndecl
, fndecls
;
1431 tree method_vec
= CLASSTYPE_METHOD_VEC (complete_type (ctype
));
1435 if (DECL_USE_TEMPLATE (function
)
1436 && !(TREE_CODE (function
) == TEMPLATE_DECL
1437 && DECL_TEMPLATE_SPECIALIZATION (function
))
1438 && is_member_template (DECL_TI_TEMPLATE (function
)))
1439 /* Since this is a specialization of a member template,
1440 we're not going to find the declaration in the class.
1443 struct S { template <typename T> void f(T); };
1444 template <> void S::f(int);
1446 we're not going to find `S::f(int)', but there's no
1447 reason we should, either. We let our callers know we didn't
1448 find the method, but we don't complain. */
1451 if (method_vec
!= 0)
1453 methods
= &TREE_VEC_ELT (method_vec
, 0);
1454 end
= TREE_VEC_END (method_vec
);
1456 /* First suss out ctors and dtors. */
1457 if (*methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1458 && DECL_CONSTRUCTOR_P (function
))
1460 if (*++methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1461 && DECL_DESTRUCTOR_P (function
))
1464 while (++methods
!= end
&& *methods
)
1467 if (fn_name
== DECL_NAME (OVL_CURRENT (*methods
)))
1470 for (fndecls
= *methods
; fndecls
!= NULL_TREE
;
1471 fndecls
= OVL_NEXT (fndecls
))
1473 fndecl
= OVL_CURRENT (fndecls
);
1474 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1475 for a for member function of a template class, is
1476 not mangled, so the check below does not work
1477 correctly in that case. Since mangled destructor
1478 names do not include the type of the arguments,
1479 we can't use this short-cut for them, either.
1480 (It's not legal to declare arguments for a
1481 destructor, but some people try.) */
1482 if (!DECL_DESTRUCTOR_P (function
)
1483 && (DECL_ASSEMBLER_NAME (function
)
1484 != DECL_NAME (function
))
1485 && (DECL_ASSEMBLER_NAME (fndecl
)
1486 != DECL_NAME (fndecl
))
1487 && (DECL_ASSEMBLER_NAME (function
)
1488 == DECL_ASSEMBLER_NAME (fndecl
)))
1491 /* We cannot simply call decls_match because this
1492 doesn't work for static member functions that are
1493 pretending to be methods, and because the name
1494 may have been changed by asm("new_name"). */
1495 if (DECL_NAME (function
) == DECL_NAME (fndecl
))
1497 tree p1
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1498 tree p2
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1500 /* Get rid of the this parameter on functions that become
1502 if (DECL_STATIC_FUNCTION_P (fndecl
)
1503 && TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1504 p1
= TREE_CHAIN (p1
);
1506 if (same_type_p (TREE_TYPE (TREE_TYPE (function
)),
1507 TREE_TYPE (TREE_TYPE (fndecl
)))
1508 && compparms (p1
, p2
)
1509 && (DECL_TEMPLATE_SPECIALIZATION (function
)
1510 == DECL_TEMPLATE_SPECIALIZATION (fndecl
))
1511 && (!DECL_TEMPLATE_SPECIALIZATION (function
)
1512 || (DECL_TI_TEMPLATE (function
)
1513 == DECL_TI_TEMPLATE (fndecl
))))
1522 if (methods
!= end
&& *methods
)
1524 tree fndecl
= *methods
;
1525 cp_error ("prototype for `%#D' does not match any in class `%T'",
1527 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl
) ? "s are" : " is",
1528 OVL_CURRENT (fndecl
));
1529 while (fndecl
= OVL_NEXT (fndecl
), fndecl
)
1530 cp_error_at (" %#D", OVL_CURRENT(fndecl
));
1535 if (!COMPLETE_TYPE_P (ctype
))
1536 incomplete_type_error (function
, ctype
);
1538 cp_error ("no `%#D' member function declared in class `%T'",
1542 /* If we did not find the method in the class, add it to avoid
1543 spurious errors (unless the CTYPE is not yet defined, in which
1544 case we'll only confuse ourselves when the function is declared
1545 properly within the class. */
1546 if (COMPLETE_TYPE_P (ctype
))
1547 add_method (ctype
, methods
, function
);
1551 /* We have just processed the DECL, which is a static data member.
1552 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1553 present, is the assembly-language name for the data member.
1554 FLAGS is as for cp_finish_decl. */
1557 finish_static_data_member_decl (decl
, init
, asmspec_tree
, flags
)
1563 const char *asmspec
= 0;
1566 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1568 my_friendly_assert (TREE_PUBLIC (decl
), 0);
1570 DECL_CONTEXT (decl
) = current_class_type
;
1572 /* We cannot call pushdecl here, because that would fill in the
1573 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1574 the right thing, namely, to put this decl out straight away. */
1575 /* current_class_type can be NULL_TREE in case of error. */
1576 if (!asmspec
&& current_class_type
)
1578 DECL_INITIAL (decl
) = error_mark_node
;
1580 DECL_ASSEMBLER_NAME (decl
) = mangle_decl (decl
);
1582 DECL_ASSEMBLER_NAME (decl
)
1583 = build_static_name (current_class_type
, DECL_NAME (decl
));
1585 if (! processing_template_decl
)
1587 if (!pending_statics
)
1588 VARRAY_TREE_INIT (pending_statics
, 32, "pending_statics");
1589 VARRAY_PUSH_TREE (pending_statics
, decl
);
1592 /* Static consts need not be initialized in the class definition. */
1593 if (init
!= NULL_TREE
&& TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
1595 static int explanation
= 0;
1597 error ("initializer invalid for static member with constructor");
1598 if (explanation
++ == 0)
1599 error ("(you really want to initialize it separately)");
1602 /* Force the compiler to know when an uninitialized static const
1603 member is being used. */
1604 if (CP_TYPE_CONST_P (TREE_TYPE (decl
)) && init
== 0)
1605 TREE_USED (decl
) = 1;
1606 DECL_INITIAL (decl
) = init
;
1607 DECL_IN_AGGR_P (decl
) = 1;
1609 cp_finish_decl (decl
, init
, asmspec_tree
, flags
);
1612 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1613 of a structure component, returning a FIELD_DECL node.
1614 QUALS is a list of type qualifiers for this decl (such as for declaring
1615 const member functions).
1617 This is done during the parsing of the struct declaration.
1618 The FIELD_DECL nodes are chained together and the lot of them
1619 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1623 If class A defines that certain functions in class B are friends, then
1624 the way I have set things up, it is B who is interested in permission
1625 granted by A. However, it is in A's context that these declarations
1626 are parsed. By returning a void_type_node, class A does not attempt
1627 to incorporate the declarations of the friends within its structure.
1629 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1630 CHANGES TO CODE IN `start_method'. */
1633 grokfield (declarator
, declspecs
, init
, asmspec_tree
, attrlist
)
1634 tree declarator
, declspecs
, init
, asmspec_tree
, attrlist
;
1636 register tree value
;
1637 const char *asmspec
= 0;
1638 int flags
= LOOKUP_ONLYCONVERTING
;
1640 /* Convert () initializers to = initializers. */
1641 if (init
== NULL_TREE
&& declarator
!= NULL_TREE
1642 && TREE_CODE (declarator
) == CALL_EXPR
1643 && TREE_OPERAND (declarator
, 0)
1644 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) == IDENTIFIER_NODE
1645 || TREE_CODE (TREE_OPERAND (declarator
, 0)) == SCOPE_REF
)
1646 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator
)))
1648 /* It's invalid to try to initialize a data member using a
1649 functional notation, e.g.:
1655 Explain that to the user. */
1656 static int explained_p
;
1658 cp_error ("invalid data member initiailization");
1661 cp_error ("use `=' to initialize static data members");
1665 declarator
= TREE_OPERAND (declarator
, 0);
1669 if (declspecs
== NULL_TREE
1670 && TREE_CODE (declarator
) == SCOPE_REF
1671 && TREE_CODE (TREE_OPERAND (declarator
, 1)) == IDENTIFIER_NODE
)
1673 /* Access declaration */
1674 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator
, 0))))
1676 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
1677 pop_nested_class ();
1678 return do_class_using_decl (declarator
);
1682 && TREE_CODE (init
) == TREE_LIST
1683 && TREE_VALUE (init
) == error_mark_node
1684 && TREE_CHAIN (init
) == NULL_TREE
)
1687 value
= grokdeclarator (declarator
, declspecs
, FIELD
, init
!= 0, attrlist
);
1688 if (! value
|| value
== error_mark_node
)
1689 /* friend or constructor went bad. */
1691 if (TREE_TYPE (value
) == error_mark_node
)
1692 return error_mark_node
;
1694 /* Pass friendly classes back. */
1695 if (TREE_CODE (value
) == VOID_TYPE
)
1696 return void_type_node
;
1698 if (DECL_NAME (value
) != NULL_TREE
1699 && IDENTIFIER_POINTER (DECL_NAME (value
))[0] == '_'
1700 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value
)), "_vptr"))
1701 cp_error ("member `%D' conflicts with virtual function table field name",
1704 /* Stash away type declarations. */
1705 if (TREE_CODE (value
) == TYPE_DECL
)
1707 DECL_NONLOCAL (value
) = 1;
1708 DECL_CONTEXT (value
) = current_class_type
;
1710 /* Now that we've updated the context, we need to remangle the
1711 name for this TYPE_DECL. */
1712 DECL_ASSEMBLER_NAME (value
) = DECL_NAME (value
);
1713 if (!uses_template_parms (value
))
1716 DECL_ASSEMBLER_NAME (value
) = mangle_type (TREE_TYPE (value
));
1718 DECL_ASSEMBLER_NAME (value
) =
1719 get_identifier (build_overload_name (TREE_TYPE (value
), 1, 1));
1722 if (processing_template_decl
)
1723 value
= push_template_decl (value
);
1728 if (DECL_IN_AGGR_P (value
))
1730 cp_error ("`%D' is already defined in `%T'", value
,
1731 DECL_CONTEXT (value
));
1732 return void_type_node
;
1736 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1740 if (TREE_CODE (value
) == FUNCTION_DECL
)
1742 grok_function_init (value
, init
);
1745 else if (pedantic
&& TREE_CODE (value
) != VAR_DECL
)
1746 /* Already complained in grokdeclarator. */
1750 /* We allow initializers to become parameters to base
1752 if (TREE_CODE (init
) == TREE_LIST
)
1754 if (TREE_CHAIN (init
) == NULL_TREE
)
1755 init
= TREE_VALUE (init
);
1757 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1760 if (TREE_CODE (init
) == CONST_DECL
)
1761 init
= DECL_INITIAL (init
);
1762 else if (TREE_READONLY_DECL_P (init
))
1763 init
= decl_constant_value (init
);
1764 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1765 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1766 if (init
== error_mark_node
)
1767 /* We must make this look different than `error_mark_node'
1768 because `decl_const_value' would mis-interpret it
1769 as only meaning that this VAR_DECL is defined. */
1770 init
= build1 (NOP_EXPR
, TREE_TYPE (value
), init
);
1771 else if (processing_template_decl
)
1773 else if (! TREE_CONSTANT (init
))
1775 /* We can allow references to things that are effectively
1776 static, since references are initialized with the address. */
1777 if (TREE_CODE (TREE_TYPE (value
)) != REFERENCE_TYPE
1778 || (TREE_STATIC (init
) == 0
1779 && (!DECL_P (init
) || DECL_EXTERNAL (init
) == 0)))
1781 error ("field initializer is not constant");
1782 init
= error_mark_node
;
1788 if (processing_template_decl
&& ! current_function_decl
1789 && (TREE_CODE (value
) == VAR_DECL
|| TREE_CODE (value
) == FUNCTION_DECL
))
1790 value
= push_template_decl (value
);
1793 cplus_decl_attributes (value
, TREE_PURPOSE (attrlist
),
1794 TREE_VALUE (attrlist
));
1796 if (TREE_CODE (value
) == VAR_DECL
)
1798 finish_static_data_member_decl (value
, init
, asmspec_tree
,
1802 if (TREE_CODE (value
) == FIELD_DECL
)
1806 /* This must override the asm specifier which was placed
1807 by grokclassfn. Lay this out fresh. */
1808 DECL_RTL (value
) = NULL_RTX
;
1809 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1811 if (DECL_INITIAL (value
) == error_mark_node
)
1812 init
= error_mark_node
;
1813 cp_finish_decl (value
, init
, asmspec_tree
, flags
);
1814 DECL_INITIAL (value
) = init
;
1815 DECL_IN_AGGR_P (value
) = 1;
1818 if (TREE_CODE (value
) == FUNCTION_DECL
)
1822 /* This must override the asm specifier which was placed
1823 by grokclassfn. Lay this out fresh. */
1824 DECL_RTL (value
) = NULL_RTX
;
1825 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1827 cp_finish_decl (value
, init
, asmspec_tree
, flags
);
1829 /* Pass friends back this way. */
1830 if (DECL_FRIEND_P (value
))
1831 return void_type_node
;
1833 DECL_IN_AGGR_P (value
) = 1;
1836 my_friendly_abort (21);
1841 /* Like `grokfield', but for bitfields.
1842 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1845 grokbitfield (declarator
, declspecs
, width
)
1846 tree declarator
, declspecs
, width
;
1848 register tree value
= grokdeclarator (declarator
, declspecs
, BITFIELD
,
1851 if (! value
) return NULL_TREE
; /* friends went bad. */
1853 /* Pass friendly classes back. */
1854 if (TREE_CODE (value
) == VOID_TYPE
)
1855 return void_type_node
;
1857 if (TREE_CODE (value
) == TYPE_DECL
)
1859 cp_error ("cannot declare `%D' to be a bitfield type", value
);
1863 /* Usually, finish_struct_1 catches bitifields with invalid types.
1864 But, in the case of bitfields with function type, we confuse
1865 ourselves into thinking they are member functions, so we must
1867 if (TREE_CODE (value
) == FUNCTION_DECL
)
1869 cp_error ("cannot declare bitfield `%D' with funcion type",
1874 if (DECL_IN_AGGR_P (value
))
1876 cp_error ("`%D' is already defined in the class %T", value
,
1877 DECL_CONTEXT (value
));
1878 return void_type_node
;
1881 GNU_xref_member (current_class_name
, value
);
1883 if (TREE_STATIC (value
))
1885 cp_error ("static member `%D' cannot be a bitfield", value
);
1888 cp_finish_decl (value
, NULL_TREE
, NULL_TREE
, 0);
1890 if (width
!= error_mark_node
)
1892 constant_expression_warning (width
);
1893 DECL_INITIAL (value
) = width
;
1894 SET_DECL_C_BIT_FIELD (value
);
1897 DECL_IN_AGGR_P (value
) = 1;
1902 grokoptypename (declspecs
, declarator
)
1903 tree declspecs
, declarator
;
1905 tree t
= grokdeclarator (declarator
, declspecs
, TYPENAME
, 0, NULL_TREE
);
1907 return mangle_conv_op_name_for_type (t
);
1909 return build_typename_overload (t
);
1912 /* When a function is declared with an initializer,
1913 do the right thing. Currently, there are two possibilities:
1918 // initialization possibility #1.
1919 virtual void f () = 0;
1941 // initialization possibility #2
1948 copy_assignment_arg_p (parmtype
, virtualp
)
1950 int virtualp ATTRIBUTE_UNUSED
;
1952 if (current_class_type
== NULL_TREE
)
1955 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
1956 parmtype
= TREE_TYPE (parmtype
);
1958 if ((TYPE_MAIN_VARIANT (parmtype
) == current_class_type
)
1960 /* Non-standard hack to support old Booch components. */
1961 || (! virtualp
&& DERIVED_FROM_P (parmtype
, current_class_type
))
1970 grok_function_init (decl
, init
)
1974 /* An initializer for a function tells how this function should
1976 tree type
= TREE_TYPE (decl
);
1978 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1979 cp_error ("initializer specified for non-member function `%D'", decl
);
1981 /* We'll check for this in finish_struct_1. */
1982 else if (DECL_VINDEX (decl
) == NULL_TREE
)
1983 cp_error ("initializer specified for non-virtual member function `%D'", decl
);
1985 else if (integer_zerop (init
))
1988 /* Mark this function as being "defined". */
1989 DECL_INITIAL (decl
) = error_mark_node
;
1990 /* pure virtual destructors must be defined. */
1991 /* pure virtual needs to be defined (as abort) only when put in
1992 vtbl. For wellformed call, it should be itself. pr4737 */
1993 if (!DECL_DESTRUCTOR_P (decl
)))
1995 /* Give this node rtl from `abort'. */
1996 DECL_RTL (decl
) = DECL_RTL (abort_fndecl
);
1999 DECL_PURE_VIRTUAL_P (decl
) = 1;
2000 if (DECL_OVERLOADED_OPERATOR_P (decl
) == NOP_EXPR
)
2003 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
))));
2005 if (copy_assignment_arg_p (parmtype
, 1))
2006 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type
) = 1;
2010 cp_error ("invalid initializer for virtual method `%D'", decl
);
2014 cplus_decl_attributes (decl
, attributes
, prefix_attributes
)
2015 tree decl
, attributes
, prefix_attributes
;
2017 if (decl
== NULL_TREE
|| decl
== void_type_node
)
2020 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2021 decl
= DECL_TEMPLATE_RESULT (decl
);
2023 decl_attributes (decl
, attributes
, prefix_attributes
);
2025 if (TREE_CODE (decl
) == TYPE_DECL
)
2026 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl
), TREE_TYPE (decl
));
2029 /* CONSTRUCTOR_NAME:
2030 Return the name for the constructor (or destructor) for the
2031 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
2032 IDENTIFIER_NODE. When given a template, this routine doesn't
2033 lose the specialization. */
2036 constructor_name_full (thing
)
2039 if (TREE_CODE (thing
) == TEMPLATE_TYPE_PARM
2040 || TREE_CODE (thing
) == TEMPLATE_TEMPLATE_PARM
2041 || TREE_CODE (thing
) == TYPENAME_TYPE
)
2042 thing
= TYPE_NAME (thing
);
2043 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing
)))
2045 if (TYPE_WAS_ANONYMOUS (thing
) && TYPE_HAS_CONSTRUCTOR (thing
))
2046 thing
= DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing
), 0)));
2048 thing
= TYPE_NAME (thing
);
2050 if (TREE_CODE (thing
) == TYPE_DECL
2051 || (TREE_CODE (thing
) == TEMPLATE_DECL
2052 && TREE_CODE (DECL_TEMPLATE_RESULT (thing
)) == TYPE_DECL
))
2053 thing
= DECL_NAME (thing
);
2054 my_friendly_assert (TREE_CODE (thing
) == IDENTIFIER_NODE
, 197);
2058 /* CONSTRUCTOR_NAME:
2059 Return the name for the constructor (or destructor) for the
2060 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
2061 IDENTIFIER_NODE. When given a template, return the plain
2062 unspecialized name. */
2065 constructor_name (thing
)
2069 thing
= constructor_name_full (thing
);
2070 t
= IDENTIFIER_TEMPLATE (thing
);
2076 /* Defer the compilation of the FN until the end of compilation. */
2082 if (DECL_DEFERRED_FN (fn
))
2084 DECL_DEFERRED_FN (fn
) = 1;
2086 VARRAY_TREE_INIT (deferred_fns
, 32, "deferred_fns");
2088 VARRAY_PUSH_TREE (deferred_fns
, fn
);
2091 /* Hand off a unique name which can be used for variable we don't really
2092 want to know about anyway, for example, the anonymous variables which
2093 are needed to make references work. Declare this thing so we can use it.
2094 The variable created will be of type TYPE.
2096 STATICP is nonzero if this variable should be static. */
2099 get_temp_name (type
, staticp
)
2103 char buf
[sizeof (AUTO_TEMP_FORMAT
) + 20];
2105 int toplev
= toplevel_bindings_p ();
2107 if (toplev
|| staticp
)
2109 sprintf (buf
, AUTO_TEMP_FORMAT
, global_temp_name_counter
++);
2110 decl
= pushdecl_top_level (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2114 sprintf (buf
, AUTO_TEMP_FORMAT
, temp_name_counter
++);
2115 decl
= pushdecl (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2117 TREE_USED (decl
) = 1;
2118 TREE_STATIC (decl
) = staticp
;
2119 DECL_ARTIFICIAL (decl
) = 1;
2121 /* If this is a local variable, then lay out its rtl now.
2122 Otherwise, callers of this function are responsible for dealing
2123 with this variable's rtl. */
2127 my_friendly_assert (DECL_INITIAL (decl
) == NULL_TREE
,
2134 /* Hunts through the global anonymous union ANON_DECL, building
2135 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2136 returns a VAR_DECL whose size is the same as the size of the
2137 ANON_DECL, if one is available. */
2140 build_anon_union_vars (anon_decl
, elems
, static_p
, external_p
)
2146 tree type
= TREE_TYPE (anon_decl
);
2147 tree main_decl
= NULL_TREE
;
2150 /* Rather than write the code to handle the non-union case,
2151 just give an error. */
2152 if (TREE_CODE (type
) != UNION_TYPE
)
2153 error ("anonymous struct not inside named type");
2155 for (field
= TYPE_FIELDS (type
);
2157 field
= TREE_CHAIN (field
))
2161 if (DECL_ARTIFICIAL (field
))
2163 if (TREE_CODE (field
) != FIELD_DECL
)
2165 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2170 if (TREE_PRIVATE (field
))
2171 cp_pedwarn_at ("private member `%#D' in anonymous union", field
);
2172 else if (TREE_PROTECTED (field
))
2173 cp_pedwarn_at ("protected member `%#D' in anonymous union", field
);
2175 if (DECL_NAME (field
) == NULL_TREE
2176 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2178 decl
= build_anon_union_vars (field
, elems
, static_p
, external_p
);
2182 else if (DECL_NAME (field
) == NULL_TREE
)
2186 decl
= build_decl (VAR_DECL
, DECL_NAME (field
), TREE_TYPE (field
));
2187 /* tell `pushdecl' that this is not tentative. */
2188 DECL_INITIAL (decl
) = error_mark_node
;
2189 TREE_PUBLIC (decl
) = 0;
2190 TREE_STATIC (decl
) = static_p
;
2191 DECL_EXTERNAL (decl
) = external_p
;
2192 decl
= pushdecl (decl
);
2193 DECL_INITIAL (decl
) = NULL_TREE
;
2196 /* Only write out one anon union element--choose the one that
2197 can hold them all. */
2198 if (main_decl
== NULL_TREE
2199 && simple_cst_equal (DECL_SIZE (decl
),
2200 DECL_SIZE (anon_decl
)) == 1)
2203 /* ??? This causes there to be no debug info written out
2205 TREE_ASM_WRITTEN (decl
) = 1;
2207 if (DECL_NAME (field
) == NULL_TREE
2208 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2209 /* The remainder of the processing was already done in the
2213 /* If there's a cleanup to do, it belongs in the
2214 TREE_PURPOSE of the following TREE_LIST. */
2215 *elems
= tree_cons (NULL_TREE
, decl
, *elems
);
2216 TREE_TYPE (*elems
) = type
;
2222 /* Finish off the processing of a UNION_TYPE structure.
2223 If there are static members, then all members are
2224 static, and must be laid out together. If the
2225 union is an anonymous union, we arrange for that
2226 as well. PUBLIC_P is nonzero if this union is
2227 not declared static. */
2230 finish_anon_union (anon_union_decl
)
2231 tree anon_union_decl
;
2233 tree type
= TREE_TYPE (anon_union_decl
);
2235 int public_p
= TREE_PUBLIC (anon_union_decl
);
2236 int static_p
= TREE_STATIC (anon_union_decl
);
2237 int external_p
= DECL_EXTERNAL (anon_union_decl
);
2239 if (TYPE_FIELDS (type
) == NULL_TREE
)
2244 error ("namespace-scope anonymous aggregates must be static");
2248 main_decl
= build_anon_union_vars (anon_union_decl
,
2249 &DECL_ANON_UNION_ELEMS (anon_union_decl
),
2250 static_p
, external_p
);
2252 if (main_decl
== NULL_TREE
)
2254 warning ("anonymous aggregate with no members");
2260 make_decl_rtl (main_decl
, 0, toplevel_bindings_p ());
2261 DECL_RTL (anon_union_decl
) = DECL_RTL (main_decl
);
2262 expand_anon_union_decl (anon_union_decl
,
2264 DECL_ANON_UNION_ELEMS (anon_union_decl
));
2267 add_decl_stmt (anon_union_decl
);
2270 /* Finish processing a builtin type TYPE. It's name is NAME,
2271 its fields are in the array FIELDS. LEN is the number of elements
2272 in FIELDS minus one, or put another way, it is the maximum subscript
2275 It is given the same alignment as ALIGN_TYPE. */
2278 finish_builtin_type (type
, name
, fields
, len
, align_type
)
2287 TYPE_FIELDS (type
) = fields
[0];
2288 for (i
= 0; i
< len
; i
++)
2290 layout_type (TREE_TYPE (fields
[i
]));
2291 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2292 TREE_CHAIN (fields
[i
]) = fields
[i
+1];
2294 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2295 TYPE_ALIGN (type
) = TYPE_ALIGN (align_type
);
2297 #if 0 /* not yet, should get fixed properly later */
2298 TYPE_NAME (type
) = make_type_decl (get_identifier (name
), type
);
2300 TYPE_NAME (type
) = build_decl (TYPE_DECL
, get_identifier (name
), type
);
2302 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2303 layout_decl (TYPE_NAME (type
), 0);
2306 /* Auxiliary functions to make type signatures for
2307 `operator new' and `operator delete' correspond to
2308 what compiler will be expecting. */
2311 coerce_new_type (type
)
2316 if (TREE_CODE (type
) == METHOD_TYPE
)
2317 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (TYPE_ARG_TYPES (type
)));
2318 if (! same_type_p (TREE_TYPE (type
), ptr_type_node
))
2319 e1
= 1, error ("`operator new' must return type `void *'");
2321 /* Technically the type must be `size_t', but we may not know
2323 if (TYPE_ARG_TYPES (type
) == NULL_TREE
)
2324 e1
= 1, error ("`operator new' takes type `size_t' parameter");
2325 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type
)), sizetype
))
2326 e2
= 1, error ("`operator new' takes type `size_t' as first parameter");
2328 type
= build_function_type (ptr_type_node
, tree_cons (NULL_TREE
, sizetype
, TREE_CHAIN (TYPE_ARG_TYPES (type
))));
2330 type
= build_function_type (ptr_type_node
, TYPE_ARG_TYPES (type
));
2335 coerce_delete_type (type
)
2342 tree arg_types
= TYPE_ARG_TYPES (type
);
2344 if (TREE_CODE (type
) == METHOD_TYPE
)
2346 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (arg_types
));
2347 arg_types
= TREE_CHAIN (arg_types
);
2350 if (TREE_TYPE (type
) != void_type_node
)
2351 e1
= 1, error ("`operator delete' must return type `void'");
2353 if (arg_types
== NULL_TREE
2354 || ! same_type_p (TREE_VALUE (arg_types
), ptr_type_node
))
2355 e2
= 1, error ("`operator delete' takes type `void *' as first parameter");
2359 && TREE_CHAIN (arg_types
)
2360 && TREE_CHAIN (arg_types
) != void_list_node
)
2362 /* Again, technically this argument must be `size_t', but again
2363 we may not know what that is. */
2364 tree t2
= TREE_VALUE (TREE_CHAIN (arg_types
));
2365 if (! same_type_p (t2
, sizetype
))
2366 e3
= 1, error ("second argument to `operator delete' must be of type `size_t'");
2367 else if (TREE_CHAIN (TREE_CHAIN (arg_types
)) != void_list_node
)
2370 if (TREE_CHAIN (TREE_CHAIN (arg_types
)))
2371 error ("too many arguments in declaration of `operator delete'");
2373 error ("`...' invalid in specification of `operator delete'");
2378 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2379 build_tree_list (NULL_TREE
, sizetype
));
2382 if (arg_types
== NULL_TREE
)
2383 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
2385 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, TREE_CHAIN (arg_types
));
2391 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2392 arg_types
? TREE_CHAIN (arg_types
): NULL_TREE
);
2394 type
= build_function_type (void_type_node
, arg_types
);
2400 mark_vtable_entries (decl
)
2403 tree entries
= CONSTRUCTOR_ELTS (DECL_INITIAL (decl
));
2405 for (; entries
; entries
= TREE_CHAIN (entries
))
2410 fnaddr
= (flag_vtable_thunks
? TREE_VALUE (entries
)
2411 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries
)));
2413 if (TREE_CODE (fnaddr
) != ADDR_EXPR
)
2414 /* This entry is an offset: a virtual base class offset, a
2415 virtual call offset, and RTTI offset, etc. */
2418 fn
= TREE_OPERAND (fnaddr
, 0);
2419 TREE_ADDRESSABLE (fn
) = 1;
2420 if (DECL_THUNK_P (fn
) && DECL_EXTERNAL (fn
))
2422 DECL_EXTERNAL (fn
) = 0;
2429 /* Set DECL up to have the closest approximation of "initialized common"
2430 linkage available. */
2433 comdat_linkage (decl
)
2437 make_decl_one_only (decl
);
2438 else if (TREE_CODE (decl
) == FUNCTION_DECL
|| DECL_VIRTUAL_P (decl
))
2439 /* We can just emit functions and vtables statically; it doesn't really
2440 matter if we have multiple copies. */
2441 TREE_PUBLIC (decl
) = 0;
2444 /* Static data member template instantiations, however, cannot
2445 have multiple copies. */
2446 if (DECL_INITIAL (decl
) == 0
2447 || DECL_INITIAL (decl
) == error_mark_node
)
2448 DECL_COMMON (decl
) = 1;
2449 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
2451 DECL_COMMON (decl
) = 1;
2452 DECL_INITIAL (decl
) = error_mark_node
;
2456 /* We can't do anything useful; leave vars for explicit
2458 DECL_EXTERNAL (decl
) = 1;
2459 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2463 if (DECL_LANG_SPECIFIC (decl
))
2464 DECL_COMDAT (decl
) = 1;
2467 /* For win32 we also want to put explicit instantiations in
2468 linkonce sections, so that they will be merged with implicit
2469 instantiations; otherwise we get duplicate symbol errors. */
2472 maybe_make_one_only (decl
)
2475 /* We used to say that this was not necessary on targets that support weak
2476 symbols, because the implicit instantiations will defer to the explicit
2477 one. However, that's not actually the case in SVR4; a strong definition
2478 after a weak one is an error. Also, not making explicit
2479 instantiations one_only means that we can end up with two copies of
2480 some template instantiations. */
2481 if (! supports_one_only ())
2484 /* We can't set DECL_COMDAT on functions, or finish_file will think
2485 we can get away with not emitting them if they aren't used. We need
2486 to for variables so that cp_finish_decl will update their linkage,
2487 because their DECL_INITIAL may not have been set properly yet. */
2489 make_decl_one_only (decl
);
2491 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_LANG_SPECIFIC (decl
))
2492 DECL_COMDAT (decl
) = 1;
2495 /* Returns the virtual function with which the vtable for TYPE is
2496 emitted, or NULL_TREE if that heuristic is not applicable to TYPE. */
2504 if (TYPE_FOR_JAVA (type
)
2505 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
2506 || CLASSTYPE_INTERFACE_KNOWN (type
))
2509 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
2510 method
= TREE_CHAIN (method
))
2511 if (DECL_VINDEX (method
) != NULL_TREE
2512 && ! DECL_THIS_INLINE (method
)
2513 && ! DECL_PURE_VIRTUAL_P (method
))
2519 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2520 based on TYPE and other static flags.
2522 Note that anything public is tagged TREE_PUBLIC, whether
2523 it's public in this file or in another one. */
2526 import_export_vtable (decl
, type
, final
)
2530 if (DECL_INTERFACE_KNOWN (decl
))
2533 if (TYPE_FOR_JAVA (type
))
2535 TREE_PUBLIC (decl
) = 1;
2536 DECL_EXTERNAL (decl
) = 1;
2537 DECL_INTERFACE_KNOWN (decl
) = 1;
2539 else if (CLASSTYPE_INTERFACE_KNOWN (type
))
2541 TREE_PUBLIC (decl
) = 1;
2542 DECL_EXTERNAL (decl
) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type
);
2543 DECL_INTERFACE_KNOWN (decl
) = 1;
2547 /* We can only wait to decide if we have real non-inline virtual
2548 functions in our class, or if we come from a template. */
2550 int found
= (CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
2551 || key_method (type
));
2553 if (final
|| ! found
)
2555 comdat_linkage (decl
);
2556 DECL_EXTERNAL (decl
) = 0;
2560 TREE_PUBLIC (decl
) = 1;
2561 DECL_EXTERNAL (decl
) = 1;
2566 /* Determine whether or not we want to specifically import or export CTYPE,
2567 using various heuristics. */
2570 import_export_class (ctype
)
2573 /* -1 for imported, 1 for exported. */
2574 int import_export
= 0;
2576 /* It only makes sense to call this function at EOF. The reason is
2577 that this function looks at whether or not the first non-inline
2578 non-abstract virtual member function has been defined in this
2579 translation unit. But, we can't possibly know that until we've
2580 seen the entire translation unit. */
2581 my_friendly_assert (at_eof
, 20000226);
2583 if (CLASSTYPE_INTERFACE_KNOWN (ctype
))
2586 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2587 we will have CLASSTYPE_INTERFACE_ONLY set but not
2588 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2589 heuristic because someone will supply a #pragma implementation
2590 elsewhere, and deducing it here would produce a conflict. */
2591 if (CLASSTYPE_INTERFACE_ONLY (ctype
))
2594 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2595 /* FIXME this should really use some sort of target-independent macro. */
2596 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype
)))
2598 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype
)))
2602 /* If we got -fno-implicit-templates, we import template classes that
2603 weren't explicitly instantiated. */
2604 if (import_export
== 0
2605 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype
)
2606 && ! flag_implicit_templates
)
2609 /* Base our import/export status on that of the first non-inline,
2610 non-pure virtual function, if any. */
2611 if (import_export
== 0
2612 && TYPE_POLYMORPHIC_P (ctype
))
2614 tree method
= key_method (ctype
);
2616 import_export
= (DECL_REALLY_EXTERN (method
) ? -1 : 1);
2619 #ifdef MULTIPLE_SYMBOL_SPACES
2620 if (import_export
== -1)
2626 SET_CLASSTYPE_INTERFACE_KNOWN (ctype
);
2627 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype
) = (import_export
> 0);
2628 CLASSTYPE_INTERFACE_ONLY (ctype
) = (import_export
< 0);
2632 /* We need to describe to the assembler the relationship between
2633 a vtable and the vtable of the parent class. */
2636 output_vtable_inherit (vars
)
2642 op
[0] = XEXP (DECL_RTL (vars
), 0); /* strip the mem ref */
2644 parent
= binfo_for_vtable (vars
);
2646 if (parent
== TYPE_BINFO (DECL_CONTEXT (vars
)))
2650 parent
= get_vtbl_decl_for_binfo (TYPE_BINFO (BINFO_TYPE (parent
)));
2651 op
[1] = XEXP (DECL_RTL (parent
), 0); /* strip the mem ref */
2654 my_friendly_abort (980826);
2656 output_asm_insn (".vtable_inherit %c0, %c1", op
);
2660 finish_vtable_vardecl (t
, data
)
2662 void *data ATTRIBUTE_UNUSED
;
2665 tree ctype
= DECL_CONTEXT (vars
);
2666 import_export_class (ctype
);
2667 import_export_vtable (vars
, ctype
, 1);
2669 if (! DECL_EXTERNAL (vars
)
2670 && DECL_NEEDED_P (vars
)
2671 && ! TREE_ASM_WRITTEN (vars
))
2673 if (TREE_TYPE (vars
) == void_type_node
)
2674 /* It is a dummy vtable made by get_vtable_decl. Ignore it. */
2678 mark_vtable_entries (vars
);
2679 if (TREE_TYPE (DECL_INITIAL (vars
)) == 0)
2680 store_init_value (vars
, DECL_INITIAL (vars
));
2682 if (write_symbols
== DWARF_DEBUG
|| write_symbols
== DWARF2_DEBUG
)
2684 /* Mark the VAR_DECL node representing the vtable itself as a
2685 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2686 It is rather important that such things be ignored because
2687 any effort to actually generate DWARF for them will run
2688 into trouble when/if we encounter code like:
2691 struct S { virtual void member (); };
2693 because the artificial declaration of the vtable itself (as
2694 manufactured by the g++ front end) will say that the vtable
2695 is a static member of `S' but only *after* the debug output
2696 for the definition of `S' has already been output. This causes
2697 grief because the DWARF entry for the definition of the vtable
2698 will try to refer back to an earlier *declaration* of the
2699 vtable as a static member of `S' and there won't be one.
2700 We might be able to arrange to have the "vtable static member"
2701 attached to the member list for `S' before the debug info for
2702 `S' get written (which would solve the problem) but that would
2703 require more intrusive changes to the g++ front end. */
2705 DECL_IGNORED_P (vars
) = 1;
2708 /* Always make vtables weak. */
2710 comdat_linkage (vars
);
2712 rest_of_decl_compilation (vars
, NULL_PTR
, 1, 1);
2715 output_vtable_inherit (vars
);
2717 /* Because we're only doing syntax-checking, we'll never end up
2718 actually marking the variable as written. */
2719 if (flag_syntax_only
)
2720 TREE_ASM_WRITTEN (vars
) = 1;
2722 /* Since we're writing out the vtable here, also write the debug
2724 note_debug_info_needed (ctype
);
2729 /* If the references to this class' vtables were optimized away, still
2730 emit the appropriate debugging information. See dfs_debug_mark. */
2731 if (DECL_COMDAT (vars
)
2732 && CLASSTYPE_DEBUG_REQUESTED (ctype
))
2733 note_debug_info_needed (ctype
);
2739 prune_vtable_vardecl (t
, data
)
2741 void *data ATTRIBUTE_UNUSED
;
2743 *t
= TREE_CHAIN (*t
);
2747 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2748 inline function or template instantiation at end-of-file. */
2751 import_export_decl (decl
)
2754 if (DECL_INTERFACE_KNOWN (decl
))
2757 if (DECL_TEMPLATE_INSTANTIATION (decl
)
2758 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2760 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2761 if ((DECL_IMPLICIT_INSTANTIATION (decl
)
2762 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2763 && (flag_implicit_templates
2764 || (flag_implicit_inline_templates
&& DECL_THIS_INLINE (decl
))))
2766 if (!TREE_PUBLIC (decl
))
2767 /* Templates are allowed to have internal linkage. See
2771 comdat_linkage (decl
);
2774 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2776 else if (DECL_FUNCTION_MEMBER_P (decl
))
2778 tree ctype
= DECL_CONTEXT (decl
);
2779 import_export_class (ctype
);
2780 if (CLASSTYPE_INTERFACE_KNOWN (ctype
)
2782 ? (! DECL_THIS_INLINE (decl
))
2783 : (! DECL_ARTIFICIAL (decl
) || DECL_VINDEX (decl
))))
2785 DECL_NOT_REALLY_EXTERN (decl
)
2786 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2787 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2788 && !DECL_VINDEX (decl
)));
2790 /* Always make artificials weak. */
2791 if (DECL_ARTIFICIAL (decl
) && flag_weak
)
2792 comdat_linkage (decl
);
2794 maybe_make_one_only (decl
);
2797 comdat_linkage (decl
);
2799 else if (DECL_TINFO_FN_P (decl
))
2801 tree ctype
= TREE_TYPE (DECL_NAME (decl
));
2803 if (IS_AGGR_TYPE (ctype
))
2804 import_export_class (ctype
);
2806 if (IS_AGGR_TYPE (ctype
) && CLASSTYPE_INTERFACE_KNOWN (ctype
)
2807 && TYPE_POLYMORPHIC_P (ctype
)
2808 /* If -fno-rtti, we're not necessarily emitting this stuff with
2809 the class, so go ahead and emit it now. This can happen
2810 when a class is used in exception handling. */
2812 /* If the type is a cv-qualified variant of a type, then we
2813 must emit the tinfo function in this translation unit
2814 since it will not be emitted when the vtable for the type
2815 is output (which is when the unqualified version is
2817 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2819 DECL_NOT_REALLY_EXTERN (decl
)
2820 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2821 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2822 && !DECL_VINDEX (decl
)));
2824 /* Always make artificials weak. */
2826 comdat_linkage (decl
);
2828 else if (TYPE_BUILT_IN (ctype
)
2829 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2830 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2832 comdat_linkage (decl
);
2835 comdat_linkage (decl
);
2837 DECL_INTERFACE_KNOWN (decl
) = 1;
2841 build_cleanup (decl
)
2845 tree type
= TREE_TYPE (decl
);
2847 if (TREE_CODE (type
) == ARRAY_TYPE
)
2851 mark_addressable (decl
);
2852 temp
= build1 (ADDR_EXPR
, build_pointer_type (type
), decl
);
2854 temp
= build_delete (TREE_TYPE (temp
), temp
,
2855 sfk_complete_destructor
,
2856 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
2860 /* Returns the initialization guard variable for the non-local
2871 sname
= get_id_2 ("__sn", DECL_ASSEMBLER_NAME (decl
));
2873 sname
= mangle_guard_variable (decl
);
2875 /* For struct X foo __attribute__((weak)), there is a counter
2876 __snfoo. Since base is already an assembler name, sname should
2877 be globally unique */
2878 sentry
= IDENTIFIER_GLOBAL_VALUE (sname
);
2881 sentry
= build_decl (VAR_DECL
, sname
, integer_type_node
);
2882 TREE_PUBLIC (sentry
) = 1;
2883 DECL_ARTIFICIAL (sentry
) = 1;
2884 TREE_STATIC (sentry
) = 1;
2885 TREE_USED (sentry
) = 1;
2886 DECL_COMMON (sentry
) = 1;
2887 pushdecl_top_level (sentry
);
2888 cp_finish_decl (sentry
, NULL_TREE
, NULL_TREE
, 0);
2893 /* Start the process of running a particular set of global constructors
2894 or destructors. Subroutine of do_[cd]tors. */
2897 start_objects (method_type
, initp
)
2898 int method_type
, initp
;
2904 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2906 if (initp
!= DEFAULT_INIT_PRIORITY
)
2916 sprintf (type
, "%c%c%.5u", method_type
, joiner
, initp
);
2919 sprintf (type
, "%c", method_type
);
2921 fnname
= get_file_function_name_long (type
);
2923 start_function (void_list_node
,
2924 make_call_declarator (fnname
, void_list_node
, NULL_TREE
,
2926 NULL_TREE
, SF_DEFAULT
);
2928 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2929 /* It can be a static function as long as collect2 does not have
2930 to scan the object file to find its ctor/dtor routine. */
2931 TREE_PUBLIC (current_function_decl
) = 0;
2934 /* Mark this declaration as used to avoid spurious warnings. */
2935 TREE_USED (current_function_decl
) = 1;
2937 /* Mark this function as a global constructor or destructor. */
2938 if (method_type
== 'I')
2939 DECL_GLOBAL_CTOR_P (current_function_decl
) = 1;
2941 DECL_GLOBAL_DTOR_P (current_function_decl
) = 1;
2942 GLOBAL_INIT_PRIORITY (current_function_decl
) = initp
;
2944 body
= begin_compound_stmt (/*has_no_scope=*/0);
2946 /* We cannot allow these functions to be elided, even if they do not
2947 have external linkage. And, there's no point in deferring
2948 copmilation of thes functions; they're all going to have to be
2950 current_function_cannot_inline
2951 = "static constructors and destructors cannot be inlined";
2956 /* Finish the process of running a particular set of global constructors
2957 or destructors. Subroutine of do_[cd]tors. */
2960 finish_objects (method_type
, initp
, body
)
2961 int method_type
, initp
;
2968 finish_compound_stmt(/*has_no_scope=*/0, body
);
2969 fn
= finish_function (0);
2972 /* When only doing semantic analysis, and no RTL generation, we
2973 can't call functions that directly emit assembly code; there is
2974 no assembly file in which to put the code. */
2975 if (flag_syntax_only
)
2978 fnname
= XSTR (XEXP (DECL_RTL (fn
), 0), 0);
2979 if (initp
== DEFAULT_INIT_PRIORITY
)
2981 if (method_type
== 'I')
2982 assemble_constructor (fnname
);
2984 assemble_destructor (fnname
);
2986 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2987 /* If we're using init priority we can't use assemble_*tor, but on ELF
2988 targets we can stick the references into named sections for GNU ld
2993 sprintf (buf
, ".%ctors.%.5u", method_type
== 'I' ? 'c' : 'd',
2994 /* invert the numbering so the linker puts us in the proper
2995 order; constructors are run from right to left, and the
2996 linker sorts in increasing order. */
2997 MAX_INIT_PRIORITY
- initp
);
2998 named_section (NULL_TREE
, buf
, 0);
2999 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, fnname
),
3000 POINTER_SIZE
/ BITS_PER_UNIT
, 1);
3005 /* The names of the parameters to the function created to handle
3006 initializations and destructions for objects with static storage
3008 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
3009 #define PRIORITY_IDENTIFIER "__priority"
3011 /* The name of the function we create to handle initializations and
3012 destructions for objects with static storage duration. */
3013 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
3015 /* The declaration for the __INITIALIZE_P argument. */
3016 static tree initialize_p_decl
;
3018 /* The declaration for the __PRIORITY argument. */
3019 static tree priority_decl
;
3021 /* The declaration for the static storage duration function. */
3022 static tree ssdf_decl
;
3024 /* All the static storage duration functions created in this
3025 translation unit. */
3026 static varray_type ssdf_decls
;
3028 /* A map from priority levels to information about that priority
3029 level. There may be many such levels, so efficient lookup is
3031 static splay_tree priority_info_map
;
3033 /* Begins the generation of the function that will handle all
3034 initialization and destruction of objects with static storage
3035 duration. The function generated takes two parameters of type
3036 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
3037 non-zero, it performs initializations. Otherwise, it performs
3038 destructions. It only performs those initializations or
3039 destructions with the indicated __PRIORITY. The generated function
3042 It is assumed that this function will only be called once per
3043 translation unit. */
3046 start_static_storage_duration_function ()
3048 static unsigned ssdf_number
;
3053 char id
[sizeof (SSDF_IDENTIFIER
) + 1 /* '\0' */ + 32];
3055 /* Create the identifier for this function. It will be of the form
3056 SSDF_IDENTIFIER_<number>. */
3057 sprintf (id
, "%s_%u", SSDF_IDENTIFIER
, ssdf_number
++);
3058 if (ssdf_number
== 0)
3060 /* Overflow occurred. That means there are at least 4 billion
3061 initialization functions. */
3062 sorry ("too many initialization functions required");
3063 my_friendly_abort (19990430);
3066 /* Create the parameters. */
3067 parm_types
= void_list_node
;
3068 parm_types
= tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
3069 parm_types
= tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
3070 type
= build_function_type (void_type_node
, parm_types
);
3072 /* Create the FUNCTION_DECL itself. */
3073 ssdf_decl
= build_lang_decl (FUNCTION_DECL
,
3074 get_identifier (id
),
3076 TREE_PUBLIC (ssdf_decl
) = 0;
3077 DECL_ARTIFICIAL (ssdf_decl
) = 1;
3079 /* Put this function in the list of functions to be called from the
3080 static constructors and destructors. */
3083 VARRAY_TREE_INIT (ssdf_decls
, 32, "ssdf_decls");
3085 /* Take this opportunity to initialize the map from priority
3086 numbers to information about that priority level. */
3087 priority_info_map
= splay_tree_new (splay_tree_compare_ints
,
3088 /*delete_key_fn=*/0,
3089 /*delete_value_fn=*/
3090 (splay_tree_delete_value_fn
) &free
);
3092 /* We always need to generate functions for the
3093 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
3094 priorities later, we'll be sure to find the
3095 DEFAULT_INIT_PRIORITY. */
3096 get_priority_info (DEFAULT_INIT_PRIORITY
);
3099 VARRAY_PUSH_TREE (ssdf_decls
, ssdf_decl
);
3101 /* Create the argument list. */
3102 initialize_p_decl
= build_decl (PARM_DECL
,
3103 get_identifier (INITIALIZE_P_IDENTIFIER
),
3105 DECL_CONTEXT (initialize_p_decl
) = ssdf_decl
;
3106 DECL_ARG_TYPE (initialize_p_decl
) = integer_type_node
;
3107 TREE_USED (initialize_p_decl
) = 1;
3108 priority_decl
= build_decl (PARM_DECL
, get_identifier (PRIORITY_IDENTIFIER
),
3110 DECL_CONTEXT (priority_decl
) = ssdf_decl
;
3111 DECL_ARG_TYPE (priority_decl
) = integer_type_node
;
3112 TREE_USED (priority_decl
) = 1;
3114 TREE_CHAIN (initialize_p_decl
) = priority_decl
;
3115 DECL_ARGUMENTS (ssdf_decl
) = initialize_p_decl
;
3117 /* Put the function in the global scope. */
3118 pushdecl (ssdf_decl
);
3120 /* Start the function itself. This is equivalent to declarating the
3123 static void __ssdf (int __initialize_p, init __priority_p);
3125 It is static because we only need to call this function from the
3126 various constructor and destructor functions for this module. */
3127 start_function (/*specs=*/NULL_TREE
,
3129 /*attrs=*/NULL_TREE
,
3132 /* Set up the scope of the outermost block in the function. */
3133 body
= begin_compound_stmt (/*has_no_scope=*/0);
3135 /* This function must not be deferred because we are depending on
3136 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3137 current_function_cannot_inline
3138 = "static storage duration functions cannot be inlined";
3143 /* Finish the generation of the function which performs initialization
3144 and destruction of objects with static storage duration. After
3145 this point, no more such objects can be created. */
3148 finish_static_storage_duration_function (body
)
3151 /* Close out the function. */
3152 finish_compound_stmt (/*has_no_scope=*/0, body
);
3153 expand_body (finish_function (0));
3156 /* Return the information about the indicated PRIORITY level. If no
3157 code to handle this level has yet been generated, generate the
3158 appropriate prologue. */
3160 static priority_info
3161 get_priority_info (priority
)
3167 n
= splay_tree_lookup (priority_info_map
,
3168 (splay_tree_key
) priority
);
3171 /* Create a new priority information structure, and insert it
3173 pi
= (priority_info
) xmalloc (sizeof (struct priority_info_s
));
3174 pi
->initializations_p
= 0;
3175 pi
->destructions_p
= 0;
3176 splay_tree_insert (priority_info_map
,
3177 (splay_tree_key
) priority
,
3178 (splay_tree_value
) pi
);
3181 pi
= (priority_info
) n
->value
;
3186 /* Set up to handle the initialization or destruction of DECL. If
3187 INITP is non-zero, we are initializing the variable. Otherwise, we
3188 are destroying it. */
3191 start_static_initialization_or_destruction (decl
, initp
)
3195 tree sentry_if_stmt
= NULL_TREE
;
3201 /* Figure out the priority for this declaration. */
3202 priority
= DECL_INIT_PRIORITY (decl
);
3204 priority
= DEFAULT_INIT_PRIORITY
;
3206 /* Remember that we had an initialization or finalization at this
3208 pi
= get_priority_info (priority
);
3210 pi
->initializations_p
= 1;
3212 pi
->destructions_p
= 1;
3214 /* Trick the compiler into thinking we are at the file and line
3215 where DECL was declared so that error-messages make sense, and so
3216 that the debugger will show somewhat sensible file and line
3218 input_filename
= DECL_SOURCE_FILE (decl
);
3219 lineno
= DECL_SOURCE_LINE (decl
);
3225 Access control for implicit calls to the constructors,
3226 the conversion functions, or the destructor called to
3227 create and destroy a static data member is performed as
3228 if these calls appeared in the scope of the member's
3231 we pretend we are in a static member function of the class of
3232 which the DECL is a member. */
3233 if (member_p (decl
))
3235 DECL_CONTEXT (current_function_decl
) = DECL_CONTEXT (decl
);
3236 DECL_STATIC_FUNCTION_P (current_function_decl
) = 1;
3239 /* Conditionalize this initialization on being in the right priority
3240 and being initializing/finalizing appropriately. */
3241 sentry_if_stmt
= begin_if_stmt ();
3242 cond
= build_binary_op (EQ_EXPR
,
3244 build_int_2 (priority
, 0));
3245 init_cond
= initp
? integer_one_node
: integer_zero_node
;
3246 init_cond
= build_binary_op (EQ_EXPR
,
3249 cond
= build_binary_op (TRUTH_ANDIF_EXPR
, cond
, init_cond
);
3251 /* We need a sentry if this is an object with external linkage that
3252 might be initialized in more than one place. (For example, a
3253 static data member of a template, when the data member requires
3255 if (TREE_PUBLIC (decl
) && (DECL_COMMON (decl
)
3256 || DECL_ONE_ONLY (decl
)
3257 || DECL_WEAK (decl
)))
3262 sentry
= get_sentry (decl
);
3264 /* We do initializations only if the SENTRY is zero, i.e., if we
3265 are the first to initialize the variable. We do destructions
3266 only if the SENTRY is one, i.e., if we are the last to
3267 destroy the variable. */
3269 sentry_cond
= build_binary_op (EQ_EXPR
,
3270 build_unary_op (PREINCREMENT_EXPR
,
3275 sentry_cond
= build_binary_op (EQ_EXPR
,
3276 build_unary_op (PREDECREMENT_EXPR
,
3281 cond
= build_binary_op (TRUTH_ANDIF_EXPR
, cond
, sentry_cond
);
3284 finish_if_stmt_cond (cond
, sentry_if_stmt
);
3286 return sentry_if_stmt
;
3289 /* We've just finished generating code to do an initialization or
3290 finalization. SENTRY_IF_STMT is the if-statement we used to guard
3291 the initialization. */
3294 finish_static_initialization_or_destruction (sentry_if_stmt
)
3295 tree sentry_if_stmt
;
3297 finish_then_clause (sentry_if_stmt
);
3300 /* Now that we're done with DECL we don't need to pretend to be a
3301 member of its class any longer. */
3302 DECL_CONTEXT (current_function_decl
) = NULL_TREE
;
3303 DECL_STATIC_FUNCTION_P (current_function_decl
) = 0;
3306 /* Generate code to do the static initialization of DECL. The
3307 initialization is INIT. If DECL may be initialized more than once
3308 in different object files, SENTRY is the guard variable to
3309 check. PRIORITY is the priority for the initialization. */
3312 do_static_initialization (decl
, init
)
3317 tree sentry_if_stmt
;
3319 /* Set up for the initialization. */
3321 = start_static_initialization_or_destruction (decl
,
3324 /* Do the initialization itself. */
3325 if (IS_AGGR_TYPE (TREE_TYPE (decl
))
3326 || TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
3327 expr
= build_aggr_init (decl
, init
, 0);
3328 else if (TREE_CODE (init
) == TREE_VEC
)
3329 expr
= build_vec_init (decl
, TREE_VEC_ELT (init
, 0),
3330 TREE_VEC_ELT (init
, 1),
3331 TREE_VEC_ELT (init
, 2), 0);
3334 expr
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
3335 TREE_SIDE_EFFECTS (expr
) = 1;
3337 finish_expr_stmt (expr
);
3339 /* If we're using __cxa_atexit, register a a function that calls the
3340 destructor for the object. */
3341 if (flag_use_cxa_atexit
)
3342 register_dtor_fn (decl
);
3345 finish_static_initialization_or_destruction (sentry_if_stmt
);
3348 /* Generate code to do the static destruction of DECL. If DECL may be
3349 initialized more than once in different object files, SENTRY is the
3350 guard variable to check. PRIORITY is the priority for the
3354 do_static_destruction (decl
)
3357 tree sentry_if_stmt
;
3359 /* If we're using __cxa_atexit, then destructors are registered
3360 immediately after objects are initialized. */
3361 my_friendly_assert (!flag_use_cxa_atexit
, 20000121);
3363 /* If we don't need a destructor, there's nothing to do. */
3364 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
3367 /* Actually do the destruction. */
3368 sentry_if_stmt
= start_static_initialization_or_destruction (decl
,
3370 finish_expr_stmt (build_cleanup (decl
));
3371 finish_static_initialization_or_destruction (sentry_if_stmt
);
3374 /* VARS is a list of variables with static storage duration which may
3375 need initialization and/or finalization. Remove those variables
3376 that don't really need to be initialized or finalized, and return
3377 the resulting list. The order in which the variables appear in
3378 VARS is in reverse order of the order in which they should actually
3379 be initialized. The list we return is in the unreversed order;
3380 i.e., the first variable should be initialized first. */
3383 prune_vars_needing_no_initialization (vars
)
3389 for (var
= vars
, result
= NULL_TREE
;
3391 var
= TREE_CHAIN (var
))
3393 tree decl
= TREE_VALUE (var
);
3394 tree init
= TREE_PURPOSE (var
);
3396 /* Deal gracefully with error. */
3397 if (decl
== error_mark_node
)
3400 /* The only things that can be initialized are variables. */
3401 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 19990420);
3403 /* If this object is not defined, we don't need to do anything
3405 if (DECL_EXTERNAL (decl
))
3408 /* Also, if the initializer already contains errors, we can bail
3410 if (init
&& TREE_CODE (init
) == TREE_LIST
3411 && value_member (error_mark_node
, init
))
3414 /* This variable is going to need initialization and/or
3415 finalization, so we add it to the list. */
3416 result
= tree_cons (init
, decl
, result
);
3422 /* Make sure we have told the back end about all the variables in
3426 write_out_vars (vars
)
3431 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3432 if (! TREE_ASM_WRITTEN (TREE_VALUE (v
)))
3433 rest_of_decl_compilation (TREE_VALUE (v
), 0, 1, 1);
3436 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3437 (otherwise) that will initialize all gobal objects with static
3438 storage duration having the indicated PRIORITY. */
3441 generate_ctor_or_dtor_function (constructor_p
, priority
)
3450 /* We use `I' to indicate initialization and `D' to indicate
3457 /* Begin the function. */
3458 body
= start_objects (function_key
, priority
);
3460 /* Call the static storage duration function with appropriate
3462 for (i
= 0; i
< ssdf_decls
->elements_used
; ++i
)
3464 arguments
= tree_cons (NULL_TREE
, build_int_2 (priority
, 0),
3466 arguments
= tree_cons (NULL_TREE
, build_int_2 (constructor_p
, 0),
3468 finish_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls
, i
),
3472 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3473 calls to any functions marked with attributes indicating that
3474 they should be called at initialization- or destruction-time. */
3475 if (priority
== DEFAULT_INIT_PRIORITY
)
3479 for (fns
= constructor_p
? static_ctors
: static_dtors
;
3481 fns
= TREE_CHAIN (fns
))
3482 finish_expr_stmt (build_function_call (TREE_VALUE (fns
), NULL_TREE
));
3485 /* Close out the function. */
3486 finish_objects (function_key
, priority
, body
);
3489 /* Generate constructor and destructor functions for the priority
3493 generate_ctor_and_dtor_functions_for_priority (n
, data
)
3495 void *data ATTRIBUTE_UNUSED
;
3497 int priority
= (int) n
->key
;
3498 priority_info pi
= (priority_info
) n
->value
;
3500 /* Generate the functions themselves, but only if they are really
3502 if (pi
->initializations_p
3503 || (priority
== DEFAULT_INIT_PRIORITY
&& static_ctors
))
3504 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3506 if (pi
->destructions_p
3507 || (priority
== DEFAULT_INIT_PRIORITY
&& static_dtors
))
3508 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3511 /* Keep iterating. */
3515 /* This routine is called from the last rule in yyparse ().
3516 Its job is to create all the code needed to initialize and
3517 destroy the global aggregates. We do the destruction
3518 first, since that way we only need to reverse the decls once. */
3529 /* Bad parse errors. Just forget about it. */
3530 if (! global_bindings_p () || current_class_type
|| decl_namespace_list
)
3533 /* Otherwise, GDB can get confused, because in only knows
3534 about source for LINENO-1 lines. */
3537 interface_unknown
= 1;
3540 /* We now have to write out all the stuff we put off writing out.
3543 o Template specializations that we have not yet instantiated,
3544 but which are needed.
3545 o Initialization and destruction for non-local objects with
3546 static storage duration. (Local objects with static storage
3547 duration are initialized when their scope is first entered,
3548 and are cleaned up via atexit.)
3549 o Virtual function tables.
3551 All of these may cause others to be needed. For example,
3552 instantiating one function may cause another to be needed, and
3553 generating the intiailzer for an object may cause templates to be
3554 instantiated, etc., etc. */
3556 timevar_push (TV_VARCONST
);
3558 if (new_abi_rtti_p ())
3559 emit_support_tinfos ();
3565 /* If there are templates that we've put off instantiating, do
3567 instantiate_pending_templates ();
3569 /* Write out virtual tables as required. Note that writing out
3570 the virtual table for a template class may cause the
3571 instantiation of members of that class. */
3572 if (walk_globals (vtable_decl_p
,
3573 finish_vtable_vardecl
,
3577 /* Write out needed type info variables. Writing out one variable
3578 might cause others to be needed. */
3579 if (new_abi_rtti_p ()
3580 && walk_globals (tinfo_decl_p
, emit_tinfo_decl
, /*data=*/0))
3583 /* The list of objects with static storage duration is built up
3584 in reverse order. We clear STATIC_AGGREGATES so that any new
3585 aggregates added during the initialization of these will be
3586 initialized in the correct order when we next come around the
3588 vars
= prune_vars_needing_no_initialization (static_aggregates
);
3589 static_aggregates
= NULL_TREE
;
3595 /* We need to start a new initialization function each time
3596 through the loop. That's because we need to know which
3597 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3598 isn't computed until a function is finished, and written
3599 out. That's a deficiency in the back-end. When this is
3600 fixed, these initialization functions could all become
3601 inline, with resulting performance improvements. */
3602 tree ssdf_body
= start_static_storage_duration_function ();
3604 /* Make sure the back end knows about all the variables. */
3605 write_out_vars (vars
);
3607 /* First generate code to do all the initializations. */
3608 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3609 do_static_initialization (TREE_VALUE (v
),
3612 /* Then, generate code to do all the destructions. Do these
3613 in reverse order so that the most recently constructed
3614 variable is the first destroyed. If we're using
3615 __cxa_atexit, then we don't need to do this; functions
3616 were registered at initialization time to destroy the
3618 if (!flag_use_cxa_atexit
)
3620 vars
= nreverse (vars
);
3621 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3622 do_static_destruction (TREE_VALUE (v
));
3627 /* Finish up the static storage duration function for this
3629 finish_static_storage_duration_function (ssdf_body
);
3631 /* All those initializations and finalizations might cause
3632 us to need more inline functions, more template
3633 instantiations, etc. */
3637 /* Go through the various inline functions, and see if any need
3639 for (i
= 0; i
< deferred_fns_used
; ++i
)
3641 tree decl
= VARRAY_TREE (deferred_fns
, i
);
3642 import_export_decl (decl
);
3643 if (DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
3645 && (! DECL_REALLY_EXTERN (decl
) || DECL_INLINE (decl
)))
3647 /* Even though we're already at the top-level, we push
3648 there again. That way, when we pop back a few lines
3649 hence, all of our state is restored. Otherwise,
3650 finish_function doesn't clean things up, and we end
3651 up with CURRENT_FUNCTION_DECL set. */
3652 push_to_top_level ();
3653 if (DECL_TINFO_FN_P (decl
))
3654 synthesize_tinfo_fn (decl
);
3656 synthesize_method (decl
);
3657 pop_from_top_level ();
3662 /* Mark all functions that might deal with exception-handling as
3664 mark_all_runtime_matches ();
3666 /* We lie to the back-end, pretending that some functions are
3667 not defined when they really are. This keeps these functions
3668 from being put out unnecessarily. But, we must stop lying
3669 when the functions are referenced, or if they are not comdat
3670 since they need to be put out now. */
3671 for (i
= 0; i
< deferred_fns_used
; ++i
)
3673 tree decl
= VARRAY_TREE (deferred_fns
, i
);
3675 if (DECL_NOT_REALLY_EXTERN (decl
)
3676 && DECL_INITIAL (decl
)
3677 && DECL_NEEDED_P (decl
))
3678 DECL_EXTERNAL (decl
) = 0;
3680 /* If we're going to need to write this function out, and
3681 there's already a body for it, create RTL for it now.
3682 (There might be no body if this is a method we haven't
3683 gotten around to synthesizing yet.) */
3684 if (!DECL_EXTERNAL (decl
)
3685 && DECL_NEEDED_P (decl
)
3686 && DECL_SAVED_TREE (decl
)
3687 && !DECL_SAVED_INSNS (decl
)
3688 && !TREE_ASM_WRITTEN (decl
))
3690 int saved_not_really_extern
;
3692 /* When we call finish_function in expand_body, it will
3693 try to reset DECL_NOT_REALLY_EXTERN so we save and
3695 saved_not_really_extern
= DECL_NOT_REALLY_EXTERN (decl
);
3696 /* Generate RTL for this function now that we know we
3699 /* Undo the damage done by finish_function. */
3700 DECL_EXTERNAL (decl
) = 0;
3701 DECL_NOT_REALLY_EXTERN (decl
) = saved_not_really_extern
;
3702 /* If we're compiling -fsyntax-only pretend that this
3703 function has been written out so that we don't try to
3705 if (flag_syntax_only
)
3706 TREE_ASM_WRITTEN (decl
) = 1;
3711 if (deferred_fns_used
3712 && wrapup_global_declarations (&VARRAY_TREE (deferred_fns
, 0),
3715 if (walk_namespaces (wrapup_globals_for_namespace
, /*data=*/0))
3718 /* Static data members are just like namespace-scope globals. */
3719 for (i
= 0; i
< pending_statics_used
; ++i
)
3721 tree decl
= VARRAY_TREE (pending_statics
, i
);
3722 if (TREE_ASM_WRITTEN (decl
))
3724 import_export_decl (decl
);
3725 if (DECL_NOT_REALLY_EXTERN (decl
) && ! DECL_IN_AGGR_P (decl
))
3726 DECL_EXTERNAL (decl
) = 0;
3729 && wrapup_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3730 pending_statics_used
))
3735 /* We give C linkage to static constructors and destructors. */
3736 push_lang_context (lang_name_c
);
3738 /* Generate initialization and destruction functions for all
3739 priorities for which they are required. */
3740 if (priority_info_map
)
3741 splay_tree_foreach (priority_info_map
,
3742 generate_ctor_and_dtor_functions_for_priority
,
3745 /* We're done with the splay-tree now. */
3746 if (priority_info_map
)
3747 splay_tree_delete (priority_info_map
);
3749 /* We're done with static constructors, so we can go back to "C++"
3751 pop_lang_context ();
3753 /* Now delete from the chain of variables all virtual function tables.
3754 We output them all ourselves, because each will be treated
3755 specially. We don't do this if we're just doing semantic
3756 analysis, and not code-generation. */
3757 if (!flag_syntax_only
)
3758 walk_globals (vtable_decl_p
, prune_vtable_vardecl
, /*data=*/0);
3760 /* Now, issue warnings about static, but not defined, functions,
3761 etc., and emit debugging information. */
3762 walk_namespaces (wrapup_globals_for_namespace
, /*data=*/&reconsider
);
3763 if (pending_statics
)
3764 check_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3765 pending_statics_used
);
3769 /* The entire file is now complete. If requested, dump everything
3771 if (flag_dump_translation_unit
)
3772 dump_node_to_file (global_namespace
, flag_dump_translation_unit
);
3774 /* If there's some tool that wants to examine the entire translation
3775 unit, let it do so now. */
3777 (*back_end_hook
) (global_namespace
);
3779 timevar_pop (TV_VARCONST
);
3781 if (flag_detailed_statistics
)
3783 dump_tree_statistics ();
3784 dump_time_statistics ();
3788 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3789 expr. Since it was parsed like a type, we need to wade through and fix
3790 that. Unfortunately, since operator() is left-associative, we can't use
3791 tail recursion. In the above example, TYPE is `A', and DECL is
3794 Maybe this shouldn't be recursive, but how often will it actually be
3798 reparse_absdcl_as_expr (type
, decl
)
3801 /* do build_functional_cast (type, NULL_TREE) at bottom */
3802 if (TREE_OPERAND (decl
, 0) == NULL_TREE
)
3803 return build_functional_cast (type
, NULL_TREE
);
3806 decl
= reparse_absdcl_as_expr (type
, TREE_OPERAND (decl
, 0));
3808 decl
= build_x_function_call (decl
, NULL_TREE
, current_class_ref
);
3810 if (TREE_CODE (decl
) == CALL_EXPR
3811 && (! TREE_TYPE (decl
)
3812 || TREE_CODE (TREE_TYPE (decl
)) != VOID_TYPE
))
3813 decl
= require_complete_type (decl
);
3818 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3819 out to be an expr. Since it was parsed like a type, we need to wade
3820 through and fix that. Since casts are right-associative, we are
3821 reversing the order, so we don't have to recurse.
3823 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3827 reparse_absdcl_as_casts (decl
, expr
)
3832 if (TREE_CODE (expr
) == CONSTRUCTOR
3833 && TREE_TYPE (expr
) == 0)
3835 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3836 decl
= TREE_OPERAND (decl
, 0);
3838 expr
= digest_init (type
, expr
, (tree
*) 0);
3839 if (TREE_CODE (type
) == ARRAY_TYPE
&& !COMPLETE_TYPE_P (type
))
3841 int failure
= complete_array_type (type
, expr
, 1);
3843 my_friendly_abort (78);
3849 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3850 decl
= TREE_OPERAND (decl
, 0);
3851 expr
= build_c_cast (type
, expr
);
3854 if (warn_old_style_cast
&& ! in_system_header
3855 && current_lang_name
!= lang_name_c
)
3856 warning ("use of old-style cast");
3861 /* Given plain tree nodes for an expression, build up the full semantics. */
3864 build_expr_from_tree (t
)
3867 if (t
== NULL_TREE
|| t
== error_mark_node
)
3870 switch (TREE_CODE (t
))
3872 case IDENTIFIER_NODE
:
3873 return do_identifier (t
, 0, NULL_TREE
);
3876 if (LOOKUP_EXPR_GLOBAL (t
))
3877 return do_scoped_id (TREE_OPERAND (t
, 0), 0);
3879 return do_identifier (TREE_OPERAND (t
, 0), 0, NULL_TREE
);
3881 case TEMPLATE_ID_EXPR
:
3882 return (lookup_template_function
3883 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3884 build_expr_from_tree (TREE_OPERAND (t
, 1))));
3887 return build_x_indirect_ref
3888 (build_expr_from_tree (TREE_OPERAND (t
, 0)), "unary *");
3891 return build_functional_cast
3892 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3894 case REINTERPRET_CAST_EXPR
:
3895 return build_reinterpret_cast
3896 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3898 case CONST_CAST_EXPR
:
3899 return build_const_cast
3900 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3902 case DYNAMIC_CAST_EXPR
:
3903 return build_dynamic_cast
3904 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3906 case STATIC_CAST_EXPR
:
3907 return build_static_cast
3908 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3910 case PREDECREMENT_EXPR
:
3911 case PREINCREMENT_EXPR
:
3912 case POSTDECREMENT_EXPR
:
3913 case POSTINCREMENT_EXPR
:
3917 case TRUTH_NOT_EXPR
:
3919 case CONVERT_EXPR
: /* Unary + */
3924 return build_x_unary_op (TREE_CODE (t
),
3925 build_expr_from_tree (TREE_OPERAND (t
, 0)));
3930 case TRUNC_DIV_EXPR
:
3932 case FLOOR_DIV_EXPR
:
3933 case ROUND_DIV_EXPR
:
3934 case EXACT_DIV_EXPR
:
3936 case BIT_ANDTC_EXPR
:
3939 case TRUNC_MOD_EXPR
:
3940 case FLOOR_MOD_EXPR
:
3941 case TRUTH_ANDIF_EXPR
:
3942 case TRUTH_ORIF_EXPR
:
3943 case TRUTH_AND_EXPR
:
3958 return build_x_binary_op
3960 build_expr_from_tree (TREE_OPERAND (t
, 0)),
3961 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3964 return build_m_component_ref
3965 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3966 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3969 return build_offset_ref (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
3972 if (TREE_OPERAND (t
, 0) == NULL_TREE
)
3974 return build_parse_node (ARRAY_REF
, NULL_TREE
,
3975 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3976 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3977 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3982 tree r
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3985 return TREE_CODE (t
) == SIZEOF_EXPR
? c_sizeof (r
) : c_alignof (r
);
3989 return build_x_modify_expr
3990 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3991 TREE_CODE (TREE_OPERAND (t
, 1)),
3992 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3995 return build_x_arrow
3996 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4000 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4001 build_expr_from_tree (TREE_OPERAND (t
, 1)),
4002 build_expr_from_tree (TREE_OPERAND (t
, 2)),
4003 NEW_EXPR_USE_GLOBAL (t
));
4006 return delete_sanity
4007 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4008 build_expr_from_tree (TREE_OPERAND (t
, 1)),
4009 DELETE_EXPR_USE_VEC (t
), DELETE_EXPR_USE_GLOBAL (t
));
4012 if (TREE_OPERAND (t
, 1) == NULL_TREE
)
4013 return build_x_compound_expr
4014 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4016 my_friendly_abort (42);
4018 case METHOD_CALL_EXPR
:
4019 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
4021 tree ref
= TREE_OPERAND (t
, 0);
4022 return build_scoped_method_call
4023 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
4024 build_expr_from_tree (TREE_OPERAND (ref
, 0)),
4025 TREE_OPERAND (ref
, 1),
4026 build_expr_from_tree (TREE_OPERAND (t
, 2)));
4030 tree fn
= TREE_OPERAND (t
, 0);
4032 /* We can get a TEMPLATE_ID_EXPR here on code like:
4036 so we must resolve that. However, we can also get things
4037 like a BIT_NOT_EXPR here, when referring to a destructor,
4038 and things like that are not correctly resolved by
4039 build_expr_from_tree. So, just use build_expr_from_tree
4040 when we really need it. */
4041 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4042 fn
= lookup_template_function
4043 (TREE_OPERAND (fn
, 0),
4044 build_expr_from_tree (TREE_OPERAND (fn
, 1)));
4046 return build_method_call
4047 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
4049 build_expr_from_tree (TREE_OPERAND (t
, 2)),
4050 NULL_TREE
, LOOKUP_NORMAL
);
4054 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
4056 tree ref
= TREE_OPERAND (t
, 0);
4057 return build_member_call
4058 (build_expr_from_tree (TREE_OPERAND (ref
, 0)),
4059 TREE_OPERAND (ref
, 1),
4060 build_expr_from_tree (TREE_OPERAND (t
, 1)));
4064 tree name
= TREE_OPERAND (t
, 0);
4066 tree args
= build_expr_from_tree (TREE_OPERAND (t
, 1));
4067 if (args
!= NULL_TREE
&& TREE_CODE (name
) == LOOKUP_EXPR
4068 && !LOOKUP_EXPR_GLOBAL (name
)
4069 && TREE_CODE ((id
= TREE_OPERAND (name
, 0))) == IDENTIFIER_NODE
4070 && (!current_class_type
4071 || !lookup_member (current_class_type
, id
, 0, 0)))
4073 /* Do Koenig lookup if there are no class members. */
4074 name
= do_identifier (id
, 0, args
);
4076 else if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
4077 || ! really_overloaded_fn (name
))
4078 name
= build_expr_from_tree (name
);
4079 return build_x_function_call (name
, args
, current_class_ref
);
4083 return build_x_conditional_expr
4084 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4085 build_expr_from_tree (TREE_OPERAND (t
, 1)),
4086 build_expr_from_tree (TREE_OPERAND (t
, 2)));
4088 case PSEUDO_DTOR_EXPR
:
4089 return (finish_pseudo_destructor_call_expr
4090 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4091 build_expr_from_tree (TREE_OPERAND (t
, 1)),
4092 build_expr_from_tree (TREE_OPERAND (t
, 2))));
4096 tree purpose
, value
, chain
;
4098 if (t
== void_list_node
)
4101 purpose
= TREE_PURPOSE (t
);
4103 purpose
= build_expr_from_tree (purpose
);
4104 value
= TREE_VALUE (t
);
4106 value
= build_expr_from_tree (value
);
4107 chain
= TREE_CHAIN (t
);
4108 if (chain
&& chain
!= void_type_node
)
4109 chain
= build_expr_from_tree (chain
);
4110 return tree_cons (purpose
, value
, chain
);
4115 tree object
= build_expr_from_tree (TREE_OPERAND (t
, 0));
4116 tree field
= TREE_OPERAND (t
, 1);
4118 /* We use a COMPONENT_REF to indicate things of the form `x.b'
4119 and `x.A::b'. We must distinguish between those cases
4121 if (TREE_CODE (field
) == SCOPE_REF
)
4122 return build_object_ref (object
,
4123 TREE_OPERAND (field
, 0),
4124 TREE_OPERAND (field
, 1));
4126 return build_x_component_ref (object
, field
,
4131 return build_throw (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4137 /* digest_init will do the wrong thing if we let it. */
4138 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
4141 r
= build_nt (CONSTRUCTOR
, NULL_TREE
,
4142 build_expr_from_tree (CONSTRUCTOR_ELTS (t
)));
4143 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
4146 return digest_init (TREE_TYPE (t
), r
, 0);
4151 if (TYPE_P (TREE_OPERAND (t
, 0)))
4152 return get_typeid (TREE_OPERAND (t
, 0));
4153 return build_typeid (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4156 return convert_from_reference (t
);
4159 return build_va_arg (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4167 /* This is something of the form `int (*a)++' that has turned out to be an
4168 expr. It was only converted into parse nodes, so we need to go through
4169 and build up the semantics. Most of the work is done by
4170 build_expr_from_tree, above.
4172 In the above example, TYPE is `int' and DECL is `*a'. */
4175 reparse_decl_as_expr (type
, decl
)
4178 decl
= build_expr_from_tree (decl
);
4180 return build_functional_cast (type
, build_tree_list (NULL_TREE
, decl
));
4185 /* This is something of the form `int (*a)' that has turned out to be a
4186 decl. It was only converted into parse nodes, so we need to do the
4187 checking that make_{pointer,reference}_declarator do. */
4190 finish_decl_parsing (decl
)
4193 extern int current_class_depth
;
4195 switch (TREE_CODE (decl
))
4197 case IDENTIFIER_NODE
:
4200 return make_pointer_declarator
4201 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4203 return make_reference_declarator
4204 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4206 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4209 push_nested_class (TREE_TYPE (TREE_OPERAND (decl
, 0)), 3);
4210 TREE_COMPLEXITY (decl
) = current_class_depth
;
4213 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4216 /* For attribute handling. */
4217 TREE_VALUE (decl
) = finish_decl_parsing (TREE_VALUE (decl
));
4220 my_friendly_abort (5);
4226 check_cp_case_value (value
)
4229 if (value
== NULL_TREE
)
4232 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4233 STRIP_TYPE_NOPS (value
);
4234 value
= decl_constant_value (value
);
4235 STRIP_TYPE_NOPS (value
);
4236 value
= fold (value
);
4238 if (TREE_CODE (value
) != INTEGER_CST
4239 && value
!= error_mark_node
)
4241 cp_error ("case label `%E' does not reduce to an integer constant",
4243 value
= error_mark_node
;
4246 /* Promote char or short to int. */
4247 value
= default_conversion (value
);
4249 constant_expression_warning (value
);
4254 /* Return 1 if root encloses child. */
4257 is_namespace_ancestor (root
, child
)
4262 if (root
== global_namespace
)
4264 if (child
== global_namespace
)
4266 return is_namespace_ancestor (root
, CP_DECL_CONTEXT (child
));
4270 /* Return the namespace that is the common ancestor
4271 of two given namespaces. */
4274 namespace_ancestor (ns1
, ns2
)
4277 if (is_namespace_ancestor (ns1
, ns2
))
4279 return namespace_ancestor (CP_DECL_CONTEXT (ns1
), ns2
);
4282 /* Insert used into the using list of user. Set indirect_flag if this
4283 directive is not directly from the source. Also find the common
4284 ancestor and let our users know about the new namespace */
4286 add_using_namespace (user
, used
, indirect
)
4292 /* Using oneself is a no-op. */
4295 my_friendly_assert (TREE_CODE (user
) == NAMESPACE_DECL
, 380);
4296 my_friendly_assert (TREE_CODE (used
) == NAMESPACE_DECL
, 380);
4297 /* Check if we already have this. */
4298 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
4302 /* Promote to direct usage. */
4303 TREE_INDIRECT_USING (t
) = 0;
4307 /* Add used to the user's using list. */
4308 DECL_NAMESPACE_USING (user
)
4309 = tree_cons (used
, namespace_ancestor (user
, used
),
4310 DECL_NAMESPACE_USING (user
));
4312 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
4314 /* Add user to the used's users list. */
4315 DECL_NAMESPACE_USERS (used
)
4316 = tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
4318 /* Recursively add all namespaces used. */
4319 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
4320 /* indirect usage */
4321 add_using_namespace (user
, TREE_PURPOSE (t
), 1);
4323 /* Tell everyone using us about the new used namespaces. */
4324 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
4325 add_using_namespace (TREE_PURPOSE (t
), used
, 1);
4328 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4329 duplicates. The first list becomes the tail of the result.
4331 The algorithm is O(n^2). We could get this down to O(n log n) by
4332 doing a sort on the addresses of the functions, if that becomes
4336 merge_functions (s1
, s2
)
4340 for (; s2
; s2
= OVL_NEXT (s2
))
4342 tree fn
= OVL_CURRENT (s2
);
4343 if (! ovl_member (fn
, s1
))
4344 s1
= build_overload (fn
, s1
);
4349 /* This should return an error not all definitions define functions.
4350 It is not an error if we find two functions with exactly the
4351 same signature, only if these are selected in overload resolution.
4352 old is the current set of bindings, new the freshly-found binding.
4353 XXX Do we want to give *all* candidates in case of ambiguity?
4354 XXX In what way should I treat extern declarations?
4355 XXX I don't want to repeat the entire duplicate_decls here */
4358 ambiguous_decl (name
, old
, new, flags
)
4365 my_friendly_assert (old
!= NULL_TREE
, 393);
4366 /* Copy the value. */
4367 val
= BINDING_VALUE (new);
4369 switch (TREE_CODE (val
))
4372 /* If we expect types or namespaces, and not templates,
4373 or this is not a template class. */
4374 if (LOOKUP_QUALIFIERS_ONLY (flags
)
4375 && !DECL_CLASS_TEMPLATE_P (val
))
4379 if (LOOKUP_NAMESPACES_ONLY (flags
))
4382 case NAMESPACE_DECL
:
4383 if (LOOKUP_TYPES_ONLY (flags
))
4387 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4391 if (!BINDING_VALUE (old
))
4392 BINDING_VALUE (old
) = val
;
4393 else if (val
&& val
!= BINDING_VALUE (old
))
4395 if (is_overloaded_fn (BINDING_VALUE (old
))
4396 && is_overloaded_fn (val
))
4398 BINDING_VALUE (old
) = merge_functions (BINDING_VALUE (old
),
4403 /* Some declarations are functions, some are not. */
4404 if (flags
& LOOKUP_COMPLAIN
)
4406 /* If we've already given this error for this lookup,
4407 BINDING_VALUE (old) is error_mark_node, so let's not
4408 repeat ourselves. */
4409 if (BINDING_VALUE (old
) != error_mark_node
)
4411 cp_error ("use of `%D' is ambiguous", name
);
4412 cp_error_at (" first declared as `%#D' here",
4413 BINDING_VALUE (old
));
4415 cp_error_at (" also declared as `%#D' here", val
);
4417 BINDING_VALUE (old
) = error_mark_node
;
4420 /* ... and copy the type. */
4421 type
= BINDING_TYPE (new);
4422 if (LOOKUP_NAMESPACES_ONLY (flags
))
4424 if (!BINDING_TYPE (old
))
4425 BINDING_TYPE (old
) = type
;
4426 else if (type
&& BINDING_TYPE (old
) != type
)
4428 if (flags
& LOOKUP_COMPLAIN
)
4430 cp_error ("`%D' denotes an ambiguous type",name
);
4431 cp_error_at (" first type here", BINDING_TYPE (old
));
4432 cp_error_at (" other type here", type
);
4438 /* Subroutine of unualified_namespace_lookup:
4439 Add the bindings of NAME in used namespaces to VAL.
4440 We are currently looking for names in namespace SCOPE, so we
4441 look through USINGS for using-directives of namespaces
4442 which have SCOPE as a common ancestor with the current scope.
4443 Returns zero on errors. */
4446 lookup_using_namespace (name
, val
, usings
, scope
, flags
, spacesp
)
4447 tree name
, val
, usings
, scope
;
4453 /* Iterate over all used namespaces in current, searching for using
4454 directives of scope. */
4455 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4456 if (TREE_VALUE (iter
) == scope
)
4459 *spacesp
= tree_cons (TREE_PURPOSE (iter
), NULL_TREE
,
4461 val1
= binding_for_name (name
, TREE_PURPOSE (iter
));
4462 /* Resolve ambiguities. */
4463 val
= ambiguous_decl (name
, val
, val1
, flags
);
4465 return BINDING_VALUE (val
) != error_mark_node
;
4469 Accepts the NAME to lookup and its qualifying SCOPE.
4470 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4474 qualified_lookup_using_namespace (name
, scope
, result
, flags
)
4480 /* Maintain a list of namespaces visited... */
4481 tree seen
= NULL_TREE
;
4482 /* ... and a list of namespace yet to see. */
4483 tree todo
= NULL_TREE
;
4485 /* Look through namespace aliases. */
4486 scope
= ORIGINAL_NAMESPACE (scope
);
4487 while (scope
&& (result
!= error_mark_node
))
4489 seen
= tree_cons (scope
, NULL_TREE
, seen
);
4490 result
= ambiguous_decl (name
, result
,
4491 binding_for_name (name
, scope
), flags
);
4492 if (!BINDING_VALUE (result
) && !BINDING_TYPE (result
))
4493 /* Consider using directives. */
4494 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4495 usings
= TREE_CHAIN (usings
))
4496 /* If this was a real directive, and we have not seen it. */
4497 if (!TREE_INDIRECT_USING (usings
)
4498 && !purpose_member (TREE_PURPOSE (usings
), seen
))
4499 todo
= tree_cons (TREE_PURPOSE (usings
), NULL_TREE
, todo
);
4502 scope
= TREE_PURPOSE (todo
);
4503 todo
= TREE_CHAIN (todo
);
4506 scope
= NULL_TREE
; /* If there never was a todo list. */
4508 return result
!= error_mark_node
;
4511 /* [namespace.memdef]/2 */
4513 /* Set the context of a declaration to scope. Complain if we are not
4517 set_decl_namespace (decl
, scope
, friendp
)
4523 if (scope
== std_node
)
4524 scope
= global_namespace
;
4525 /* Get rid of namespace aliases. */
4526 scope
= ORIGINAL_NAMESPACE (scope
);
4528 /* It is ok for friends to be qualified in parallel space. */
4529 if (!friendp
&& !is_namespace_ancestor (current_namespace
, scope
))
4530 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4532 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
4533 if (scope
!= current_namespace
)
4535 /* See whether this has been declared in the namespace. */
4536 old
= namespace_binding (DECL_NAME (decl
), scope
);
4538 /* No old declaration at all. */
4540 if (!is_overloaded_fn (decl
))
4541 /* Don't compare non-function decls with decls_match here,
4542 since it can't check for the correct constness at this
4543 point. pushdecl will find those errors later. */
4545 /* Since decl is a function, old should contain a function decl. */
4546 if (!is_overloaded_fn (old
))
4548 if (processing_template_decl
|| processing_specialization
)
4549 /* We have not yet called push_template_decl to turn the
4550 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4551 won't match. But, we'll check later, when we construct the
4554 for (; old
; old
= OVL_NEXT (old
))
4555 if (decls_match (decl
, OVL_CURRENT (old
)))
4561 cp_error ("`%D' should have been declared inside `%D'",
4565 /* Compute the namespace where a declaration is defined. */
4568 decl_namespace (decl
)
4572 decl
= TYPE_STUB_DECL (decl
);
4573 while (DECL_CONTEXT (decl
))
4575 decl
= DECL_CONTEXT (decl
);
4576 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4579 decl
= TYPE_STUB_DECL (decl
);
4580 my_friendly_assert (DECL_P (decl
), 390);
4583 return global_namespace
;
4586 /* Return the namespace where the current declaration is declared. */
4589 current_decl_namespace ()
4592 /* If we have been pushed into a different namespace, use it. */
4593 if (decl_namespace_list
)
4594 return TREE_PURPOSE (decl_namespace_list
);
4596 if (current_class_type
)
4597 result
= decl_namespace (TYPE_STUB_DECL (current_class_type
));
4598 else if (current_function_decl
)
4599 result
= decl_namespace (current_function_decl
);
4601 result
= current_namespace
;
4605 /* Temporarily set the namespace for the current declaration. */
4608 push_decl_namespace (decl
)
4611 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
4612 decl
= decl_namespace (decl
);
4613 decl_namespace_list
= tree_cons (decl
, NULL_TREE
, decl_namespace_list
);
4617 pop_decl_namespace ()
4619 decl_namespace_list
= TREE_CHAIN (decl_namespace_list
);
4622 /* Enter a class or namespace scope. */
4628 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4629 push_decl_namespace (t
);
4634 /* Leave scope pushed by push_scope. */
4640 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4641 pop_decl_namespace ();
4646 /* [basic.lookup.koenig] */
4647 /* A non-zero return value in the functions below indicates an error.
4648 All nodes allocated in the procedure are on the scratch obstack. */
4658 static int arg_assoc
PARAMS ((struct arg_lookup
*, tree
));
4659 static int arg_assoc_args
PARAMS ((struct arg_lookup
*, tree
));
4660 static int arg_assoc_type
PARAMS ((struct arg_lookup
*, tree
));
4661 static int add_function
PARAMS ((struct arg_lookup
*, tree
));
4662 static int arg_assoc_namespace
PARAMS ((struct arg_lookup
*, tree
));
4663 static int arg_assoc_class
PARAMS ((struct arg_lookup
*, tree
));
4664 static int arg_assoc_template_arg
PARAMS ((struct arg_lookup
*, tree
));
4666 /* Add a function to the lookup structure.
4667 Returns 1 on error. */
4670 add_function (k
, fn
)
4671 struct arg_lookup
*k
;
4674 /* We used to check here to see if the function was already in the list,
4675 but that's O(n^2), which is just too expensive for function lookup.
4676 Now we deal with the occasional duplicate in joust. In doing this, we
4677 assume that the number of duplicates will be small compared to the
4678 total number of functions being compared, which should usually be the
4681 /* We must find only functions, or exactly one non-function. */
4682 if (k
->functions
&& is_overloaded_fn (k
->functions
)
4683 && is_overloaded_fn (fn
))
4684 k
->functions
= build_overload (fn
, k
->functions
);
4685 else if (k
->functions
)
4687 tree f1
= OVL_CURRENT (k
->functions
);
4689 if (is_overloaded_fn (f1
))
4691 fn
= f1
; f1
= f2
; f2
= fn
;
4693 cp_error_at ("`%D' is not a function,", f1
);
4694 cp_error_at (" conflict with `%D'", f2
);
4695 cp_error (" in call to `%D'", k
->name
);
4703 /* Add functions of a namespace to the lookup structure.
4704 Returns 1 on error. */
4707 arg_assoc_namespace (k
, scope
)
4708 struct arg_lookup
*k
;
4713 if (purpose_member (scope
, k
->namespaces
))
4715 k
->namespaces
= tree_cons (scope
, NULL_TREE
, k
->namespaces
);
4717 value
= namespace_binding (k
->name
, scope
);
4721 for (; value
; value
= OVL_NEXT (value
))
4722 if (add_function (k
, OVL_CURRENT (value
)))
4728 /* Adds everything associated with a template argument to the lookup
4729 structure. Returns 1 on error. */
4732 arg_assoc_template_arg (k
, arg
)
4733 struct arg_lookup
* k
;
4736 /* [basic.lookup.koenig]
4738 If T is a template-id, its associated namespaces and classes are
4739 ... the namespaces and classes associated with the types of the
4740 template arguments provided for template type parameters
4741 (excluding template template parameters); the namespaces in which
4742 any template template arguments are defined; and the classes in
4743 which any member templates used as template template arguments
4744 are defined. [Note: non-type template arguments do not
4745 contribute to the set of associated namespaces. ] */
4747 /* Consider first template template arguments. */
4748 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
4750 tree ctx
= CP_DECL_CONTEXT (arg
);
4752 /* It's not a member template. */
4753 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4754 return arg_assoc_namespace (k
, ctx
);
4755 /* Otherwise, it must be member template. */
4757 return arg_assoc_class (k
, ctx
);
4759 /* It's not a template template argument, but it is a type template
4761 else if (TYPE_P (arg
))
4762 return arg_assoc_type (k
, arg
);
4763 /* It's a non-type template argument. */
4768 /* Adds everything associated with class to the lookup structure.
4769 Returns 1 on error. */
4772 arg_assoc_class (k
, type
)
4773 struct arg_lookup
* k
;
4776 tree list
, friends
, context
;
4779 /* Backend build structures, such as __builtin_va_list, aren't
4780 affected by all this. */
4781 if (!CLASS_TYPE_P (type
))
4784 if (purpose_member (type
, k
->classes
))
4786 k
->classes
= tree_cons (type
, NULL_TREE
, k
->classes
);
4788 context
= decl_namespace (TYPE_MAIN_DECL (type
));
4789 if (arg_assoc_namespace (k
, context
))
4792 /* Process baseclasses. */
4793 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (type
); i
++)
4794 if (arg_assoc_class (k
, TYPE_BINFO_BASETYPE (type
, i
)))
4797 /* Process friends. */
4798 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
4799 list
= TREE_CHAIN (list
))
4800 if (k
->name
== TREE_PURPOSE (list
))
4801 for (friends
= TREE_VALUE (list
); friends
;
4802 friends
= TREE_CHAIN (friends
))
4803 /* Only interested in global functions with potentially hidden
4804 (i.e. unqualified) declarations. */
4805 if (TREE_PURPOSE (list
) == error_mark_node
&& TREE_VALUE (list
)
4806 && decl_namespace (TREE_VALUE (list
)) == context
)
4807 if (add_function (k
, TREE_VALUE (list
)))
4810 /* Process template arguments. */
4811 if (CLASSTYPE_TEMPLATE_INFO (type
))
4813 list
= INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
4814 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
4815 arg_assoc_template_arg (k
, TREE_VEC_ELT (list
, i
));
4821 /* Adds everything associated with a given type.
4822 Returns 1 on error. */
4825 arg_assoc_type (k
, type
)
4826 struct arg_lookup
*k
;
4829 switch (TREE_CODE (type
))
4839 if (TYPE_PTRMEMFUNC_P (type
))
4840 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
4841 return arg_assoc_class (k
, type
);
4843 case REFERENCE_TYPE
:
4845 return arg_assoc_type (k
, TREE_TYPE (type
));
4848 return arg_assoc_namespace (k
, decl_namespace (TYPE_MAIN_DECL (type
)));
4850 /* Pointer to member: associate class type and value type. */
4851 if (arg_assoc_type (k
, TYPE_OFFSET_BASETYPE (type
)))
4853 return arg_assoc_type (k
, TREE_TYPE (type
));
4855 /* The basetype is referenced in the first arg type, so just
4858 /* Associate the parameter types. */
4859 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
4861 /* Associate the return type. */
4862 return arg_assoc_type (k
, TREE_TYPE (type
));
4863 case TEMPLATE_TYPE_PARM
:
4864 case TEMPLATE_TEMPLATE_PARM
:
4867 if (type
== unknown_type_node
)
4869 /* else fall through */
4871 my_friendly_abort (390);
4876 /* Adds everything associated with arguments. Returns 1 on error. */
4879 arg_assoc_args (k
, args
)
4880 struct arg_lookup
* k
;
4883 for (; args
; args
= TREE_CHAIN (args
))
4884 if (arg_assoc (k
, TREE_VALUE (args
)))
4889 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4893 struct arg_lookup
* k
;
4896 if (n
== error_mark_node
)
4900 return arg_assoc_type (k
, n
);
4902 if (! type_unknown_p (n
))
4903 return arg_assoc_type (k
, TREE_TYPE (n
));
4905 if (TREE_CODE (n
) == ADDR_EXPR
)
4906 n
= TREE_OPERAND (n
, 0);
4907 if (TREE_CODE (n
) == COMPONENT_REF
)
4908 n
= TREE_OPERAND (n
, 1);
4909 if (TREE_CODE (n
) == OFFSET_REF
)
4910 n
= TREE_OPERAND (n
, 1);
4911 while (TREE_CODE (n
) == TREE_LIST
)
4914 if (TREE_CODE (n
) == FUNCTION_DECL
)
4915 return arg_assoc_type (k
, TREE_TYPE (n
));
4916 if (TREE_CODE (n
) == TEMPLATE_ID_EXPR
)
4918 /* [basic.lookup.koenig]
4920 If T is a template-id, its associated namespaces and classes
4921 are the namespace in which the template is defined; for
4922 member templates, the member template's class... */
4923 tree
template = TREE_OPERAND (n
, 0);
4924 tree args
= TREE_OPERAND (n
, 1);
4928 /* First, the template. There may actually be more than one if
4929 this is an overloaded function template. But, in that case,
4930 we only need the first; all the functions will be in the same
4932 template = OVL_CURRENT (template);
4934 ctx
= CP_DECL_CONTEXT (template);
4936 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4938 if (arg_assoc_namespace (k
, ctx
) == 1)
4941 /* It must be a member template. */
4942 else if (arg_assoc_class (k
, ctx
) == 1)
4945 /* Now the arguments. */
4946 for (arg
= args
; arg
!= NULL_TREE
; arg
= TREE_CHAIN (arg
))
4947 if (arg_assoc_template_arg (k
, TREE_VALUE (arg
)) == 1)
4952 my_friendly_assert (TREE_CODE (n
) == OVERLOAD
, 980715);
4954 for (; n
; n
= OVL_CHAIN (n
))
4955 if (arg_assoc_type (k
, TREE_TYPE (OVL_FUNCTION (n
))))
4962 /* Performs Koenig lookup depending on arguments, where fns
4963 are the functions found in normal lookup. */
4966 lookup_arg_dependent (name
, fns
, args
)
4971 struct arg_lookup k
;
4972 tree fn
= NULL_TREE
;
4976 k
.classes
= NULL_TREE
;
4978 /* Note that we've already looked at some namespaces during normal
4979 unqualified lookup, unless we found a decl in function scope. */
4981 fn
= OVL_CURRENT (fns
);
4982 if (fn
&& TREE_CODE (fn
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (fn
))
4983 k
.namespaces
= NULL_TREE
;
4985 unqualified_namespace_lookup (name
, 0, &k
.namespaces
);
4987 arg_assoc_args (&k
, args
);
4991 /* Process a namespace-alias declaration. */
4994 do_namespace_alias (alias
, namespace)
4995 tree alias
, namespace;
4997 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
4999 /* The parser did not find it, so it's not there. */
5000 cp_error ("unknown namespace `%D'", namespace);
5004 namespace = ORIGINAL_NAMESPACE (namespace);
5006 /* Build the alias. */
5007 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
5008 DECL_NAMESPACE_ALIAS (alias
) = namespace;
5012 /* Check a non-member using-declaration. Return the name and scope
5013 being used, and the USING_DECL, or NULL_TREE on failure. */
5016 validate_nonmember_using_decl (decl
, scope
, name
)
5021 if (TREE_CODE (decl
) == SCOPE_REF
5022 && TREE_OPERAND (decl
, 0) == std_node
)
5024 if (namespace_bindings_p ()
5025 && current_namespace
== global_namespace
)
5026 /* There's no need for a using declaration at all, here,
5027 since `std' is the same as `::'. We can't just pass this
5028 on because we'll complain later about declaring something
5029 in the same scope as a using declaration with the same
5030 name. We return NULL_TREE which indicates to the caller
5031 that there's no need to do any further processing. */
5034 *scope
= global_namespace
;
5035 *name
= TREE_OPERAND (decl
, 1);
5037 else if (TREE_CODE (decl
) == SCOPE_REF
)
5039 *scope
= TREE_OPERAND (decl
, 0);
5040 *name
= TREE_OPERAND (decl
, 1);
5042 /* [namespace.udecl]
5044 A using-declaration for a class member shall be a
5045 member-declaration. */
5046 if (TREE_CODE (*scope
) != NAMESPACE_DECL
)
5048 if (TYPE_P (*scope
))
5049 cp_error ("`%T' is not a namespace", *scope
);
5051 cp_error ("`%D' is not a namespace", *scope
);
5055 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
5056 || TREE_CODE (decl
) == TYPE_DECL
5057 || TREE_CODE (decl
) == TEMPLATE_DECL
)
5059 *scope
= global_namespace
;
5063 my_friendly_abort (382);
5065 *name
= DECL_NAME (*name
);
5066 /* Make a USING_DECL. */
5067 return push_using_decl (*scope
, *name
);
5070 /* Process local and global using-declarations. */
5073 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, newval
, newtype
)
5075 tree oldval
, oldtype
;
5076 tree
*newval
, *newtype
;
5080 *newval
= *newtype
= NULL_TREE
;
5081 decls
= make_node (CPLUS_BINDING
);
5082 if (!qualified_lookup_using_namespace (name
, scope
, decls
, 0))
5086 if (!BINDING_VALUE (decls
) && !BINDING_TYPE (decls
))
5088 cp_error ("`%D' not declared", name
);
5092 /* Check for using functions. */
5093 if (BINDING_VALUE (decls
) && is_overloaded_fn (BINDING_VALUE (decls
)))
5097 if (oldval
&& !is_overloaded_fn (oldval
))
5099 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls
)), oldval
);
5104 for (tmp
= BINDING_VALUE (decls
); tmp
; tmp
= OVL_NEXT (tmp
))
5106 tree new_fn
= OVL_CURRENT (tmp
);
5108 /* [namespace.udecl]
5110 If a function declaration in namespace scope or block
5111 scope has the same name and the same parameter types as a
5112 function introduced by a using declaration the program is
5114 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
5116 tree old_fn
= OVL_CURRENT (tmp1
);
5118 if (!OVL_USED (tmp1
)
5119 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn
)),
5120 TYPE_ARG_TYPES (TREE_TYPE (old_fn
))))
5122 /* There was already a non-using declaration in
5123 this scope with the same parameter types. */
5124 cp_error ("`%D' is already declared in this scope",
5128 else if (duplicate_decls (new_fn
, old_fn
))
5129 /* We're re-using something we already used
5130 before. We don't need to add it again. */
5134 /* If we broke out of the loop, there's no reason to add
5135 this function to the using declarations for this
5140 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
5141 if (TREE_CODE (*newval
) != OVERLOAD
)
5142 *newval
= ovl_cons (*newval
, NULL_TREE
);
5143 OVL_USED (*newval
) = 1;
5148 *newval
= BINDING_VALUE (decls
);
5150 duplicate_decls (*newval
, oldval
);
5153 *newtype
= BINDING_TYPE (decls
);
5154 if (oldtype
&& *newtype
&& oldtype
!= *newtype
)
5156 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5162 /* Process a using-declaration not appearing in class or local scope. */
5165 do_toplevel_using_decl (decl
)
5168 tree scope
, name
, binding
;
5169 tree oldval
, oldtype
, newval
, newtype
;
5171 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5172 if (decl
== NULL_TREE
)
5175 binding
= binding_for_name (name
, current_namespace
);
5177 oldval
= BINDING_VALUE (binding
);
5178 oldtype
= BINDING_TYPE (binding
);
5180 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5182 /* Copy declarations found. */
5184 BINDING_VALUE (binding
) = newval
;
5186 BINDING_TYPE (binding
) = newtype
;
5190 /* Process a using-declaration at function scope. */
5193 do_local_using_decl (decl
)
5197 tree oldval
, oldtype
, newval
, newtype
;
5199 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5200 if (decl
== NULL_TREE
)
5203 oldval
= lookup_name_current_level (name
);
5204 oldtype
= lookup_type_current_level (name
);
5206 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5210 if (is_overloaded_fn (newval
))
5214 /* We only need to push declarations for those functions
5215 that were not already bound in the current level.
5216 The old value might be NULL_TREE, it might be a single
5217 function, or an OVERLOAD. */
5218 if (oldval
&& TREE_CODE (oldval
) == OVERLOAD
)
5219 term
= OVL_FUNCTION (oldval
);
5222 for (fn
= newval
; fn
&& OVL_CURRENT (fn
) != term
;
5224 push_overloaded_decl (OVL_CURRENT (fn
),
5225 PUSH_LOCAL
| PUSH_USING
);
5228 push_local_binding (name
, newval
, PUSH_USING
);
5231 set_identifier_type_value (name
, newtype
);
5235 do_class_using_decl (decl
)
5240 if (TREE_CODE (decl
) != SCOPE_REF
5241 || !TYPE_P (TREE_OPERAND (decl
, 0)))
5243 cp_error ("using-declaration for non-member at class scope");
5246 name
= TREE_OPERAND (decl
, 1);
5247 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
5249 cp_error ("using-declaration for destructor");
5252 if (TREE_CODE (name
) == TYPE_DECL
)
5253 name
= DECL_NAME (name
);
5255 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 980716);
5257 value
= build_lang_decl (USING_DECL
, name
, void_type_node
);
5258 DECL_INITIAL (value
) = TREE_OPERAND (decl
, 0);
5262 /* Process a using-directive. */
5265 do_using_directive (namespace)
5268 if (namespace == std_node
)
5270 /* using namespace A::B::C; */
5271 if (TREE_CODE (namespace) == SCOPE_REF
)
5272 namespace = TREE_OPERAND (namespace, 1);
5273 if (TREE_CODE (namespace) == IDENTIFIER_NODE
)
5275 /* Lookup in lexer did not find a namespace. */
5276 cp_error ("namespace `%T' undeclared", namespace);
5279 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
5281 cp_error ("`%T' is not a namespace", namespace);
5284 namespace = ORIGINAL_NAMESPACE (namespace);
5285 if (!toplevel_bindings_p ())
5286 push_using_directive (namespace);
5289 add_using_namespace (current_namespace
, namespace, 0);
5293 check_default_args (x
)
5296 tree arg
= TYPE_ARG_TYPES (TREE_TYPE (x
));
5297 int saw_def
= 0, i
= 0 - (TREE_CODE (TREE_TYPE (x
)) == METHOD_TYPE
);
5298 for (; arg
&& arg
!= void_list_node
; arg
= TREE_CHAIN (arg
), ++i
)
5300 if (TREE_PURPOSE (arg
))
5304 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5315 TREE_USED (decl
) = 1;
5316 if (processing_template_decl
)
5318 assemble_external (decl
);
5320 /* Is it a synthesized method that needs to be synthesized? */
5321 if (TREE_CODE (decl
) == FUNCTION_DECL
5322 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
)
5323 && DECL_ARTIFICIAL (decl
)
5324 && ! DECL_INITIAL (decl
)
5325 /* Kludge: don't synthesize for default args. */
5326 && current_function_decl
)
5328 synthesize_method (decl
);
5329 /* If we've already synthesized the method we don't need to
5330 instantiate it, so we can return right away. */
5334 /* If this is a function or variable that is an instance of some
5335 template, we now know that we will need to actually do the
5336 instantiation. We check that DECL is not an explicit
5337 instantiation because that is not checked in instantiate_decl. */
5338 if ((DECL_NON_THUNK_FUNCTION_P (decl
) || TREE_CODE (decl
) == VAR_DECL
)
5339 && DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
5340 && (!DECL_EXPLICIT_INSTANTIATION (decl
)
5341 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INLINE (decl
))))
5342 instantiate_decl (decl
, /*defer_ok=*/1);
5345 /* Helper function for named_class_head_sans_basetype nonterminal. We
5346 have just seen something of the form `AGGR SCOPE::ID'. Return a
5347 TYPE_DECL for the type declared by ID in SCOPE. */
5350 handle_class_head (aggr
, scope
, id
)
5351 tree aggr
, scope
, id
;
5355 if (TREE_CODE (id
) == TYPE_DECL
)
5357 else if (DECL_CLASS_TEMPLATE_P (id
))
5358 decl
= DECL_TEMPLATE_RESULT (id
);
5361 tree current
= current_scope();
5363 if (current
== NULL_TREE
)
5364 current
= current_namespace
;
5365 if (scope
== std_node
)
5366 scope
= global_namespace
;
5367 if (scope
== NULL_TREE
)
5368 scope
= global_namespace
;
5369 if (scope
== current
)
5371 /* We've been given AGGR SCOPE::ID, when we're already inside SCOPE.
5372 Be nice about it. */
5374 cp_pedwarn ("extra qualification `%T::' on member `%D' ignored",
5375 FROB_CONTEXT (scope
), id
);
5377 else if (scope
!= global_namespace
)
5378 cp_error ("`%T' does not have a nested type named `%D'", scope
, id
);
5380 cp_error ("no file-scope type named `%D'", id
);
5382 /* Inject it at the current scope. */
5383 decl
= TYPE_MAIN_DECL (xref_tag (aggr
, id
, 1));
5386 /* Enter the SCOPE. If this turns out not to be a definition, the
5387 parser must leave the scope. */
5388 push_scope (CP_DECL_CONTEXT (decl
));
5390 /* If we see something like:
5392 template <typename T> struct S::I ....
5394 we must create a TEMPLATE_DECL for the nested type. */
5395 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5396 decl
= push_template_decl (decl
);
5401 /* Initialize decl2.c. */
5406 ggc_add_tree_root (&decl_namespace_list
, 1);
5407 ggc_add_tree_varray_root (&deferred_fns
, 1);
5408 ggc_add_tree_varray_root (&pending_statics
, 1);
5409 ggc_add_tree_varray_root (&ssdf_decls
, 1);
5410 ggc_add_tree_root (&ssdf_decl
, 1);
5411 ggc_add_tree_root (&priority_decl
, 1);
5412 ggc_add_tree_root (&initialize_p_decl
, 1);
5413 ggc_add_tree_root (&pending_vtables
, 1);