1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-98, 1999 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Process declarations and symbol lookup for C front end.
24 Also constructs types; the standard scalar types at initialization,
25 and structure, union, array and enum types when they are declared. */
27 /* ??? not all decl nodes are given the most useful possible
28 line numbers. For example, the CONST_DECLs for enum values. */
44 #include "dwarf2out.h"
46 #include "splay-tree.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 /* A label indicating where we should generate the next
58 initialization with this priority. */
59 rtx initialization_sequence
;
60 /* A label indicating where we should generate the next destruction
61 with this priority. */
62 rtx destruction_sequence
;
63 /* Non-zero if there have been any initializations at this priority
64 throughout the translation unit. */
65 int initializations_p
;
66 /* Non-zero if there have been any destructions at this priority
67 throughout the translation unit. */
71 static tree get_sentry
PROTO((tree
));
72 static void mark_vtable_entries
PROTO((tree
));
73 static void grok_function_init
PROTO((tree
, tree
));
74 static int finish_vtable_vardecl
PROTO((tree
*, void *));
75 static int prune_vtable_vardecl
PROTO((tree
*, void *));
76 static int finish_sigtable_vardecl
PROTO((tree
*, void *));
77 static int is_namespace_ancestor
PROTO((tree
, tree
));
78 static void add_using_namespace
PROTO((tree
, tree
, int));
79 static tree ambiguous_decl
PROTO((tree
, tree
, tree
,int));
80 static tree build_anon_union_vars
PROTO((tree
, tree
*, int, int));
81 static int acceptable_java_type
PROTO((tree
));
82 static void output_vtable_inherit
PROTO((tree
));
83 static void start_objects
PROTO((int, int));
84 static void finish_objects
PROTO((int, int));
85 static tree merge_functions
PROTO((tree
, tree
));
86 static tree decl_namespace
PROTO((tree
));
87 static tree validate_nonmember_using_decl
PROTO((tree
, tree
*, tree
*));
88 static void do_nonmember_using_decl
PROTO((tree
, tree
, tree
, tree
,
90 static void start_static_storage_duration_function
PROTO((void));
91 static int generate_inits_for_priority
PROTO((splay_tree_node
, void *));
92 static void finish_static_storage_duration_function
PROTO((void));
93 static priority_info get_priority_info
PROTO((int));
94 static void do_static_initialization
PROTO((tree
, tree
, tree
, int));
95 static void do_static_destruction
PROTO((tree
, tree
, int));
96 static void do_static_initialization_and_destruction
PROTO((tree
, tree
));
97 static void generate_ctor_or_dtor_function
PROTO((int, int));
98 static int generate_ctor_and_dtor_functions_for_priority
99 PROTO((splay_tree_node
, void *));
100 extern int current_class_depth
;
102 /* A list of virtual function tables we must make sure to write out. */
103 tree pending_vtables
;
105 /* A list of static class variables. This is needed, because a
106 static class variable can be declared inside the class without
107 an initializer, and then initialized, staticly, outside the class. */
108 static varray_type pending_statics
;
109 static size_t pending_statics_used
;
111 /* A list of functions which were declared inline, but which we
112 may need to emit outline anyway. */
113 static varray_type saved_inlines
;
114 static size_t saved_inlines_used
;
116 /* Used to help generate temporary names which are unique within
117 a function. Reset to 0 by start_function. */
119 int temp_name_counter
;
121 /* Same, but not reset. Local temp variables and global temp variables
122 can have the same name. */
123 static int global_temp_name_counter
;
125 /* Flag used when debugging spew.c */
127 extern int spew_debug
;
129 /* Nonzero if we're done parsing and into end-of-file activities. */
133 /* Functions called along with real static constructors and destructors. */
135 tree static_ctors
, static_dtors
;
137 /* The current open namespace, and ::. */
139 tree current_namespace
;
140 tree global_namespace
;
142 /* The stack for namespaces of current declarations. */
144 static tree decl_namespace_list
;
147 /* C (and C++) language-specific option variables. */
149 /* Nonzero means allow type mismatches in conditional expressions;
150 just make their values `void'. */
152 int flag_cond_mismatch
;
154 /* Nonzero means give `double' the same size as `float'. */
156 int flag_short_double
;
158 /* Nonzero means don't recognize the keyword `asm'. */
162 /* Nonzero means don't recognize any extension keywords. */
164 int flag_no_gnu_keywords
;
166 /* Nonzero means don't recognize the non-ANSI builtin functions. */
170 /* Nonzero means don't recognize the non-ANSI builtin functions.
173 int flag_no_nonansi_builtin
;
175 /* Nonzero means do some things the same way PCC does. Only provided so
176 the compiler will link. */
178 int flag_traditional
;
180 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
182 int flag_signed_bitfields
= 1;
184 /* Nonzero means enable obscure ANSI features and disable GNU extensions
185 that might cause ANSI-compliant code to be miscompiled. */
189 /* Nonzero means do emit exported implementations of functions even if
190 they can be inlined. */
192 int flag_implement_inlines
= 1;
194 /* Nonzero means do emit exported implementations of templates, instead of
195 multiple static copies in each file that needs a definition. */
197 int flag_external_templates
;
199 /* Nonzero means that the decision to emit or not emit the implementation of a
200 template depends on where the template is instantiated, rather than where
203 int flag_alt_external_templates
;
205 /* Nonzero means that implicit instantiations will be emitted if needed. */
207 int flag_implicit_templates
= 1;
209 /* Nonzero means that implicit instantiations of inline templates will be
210 emitted if needed, even if instantiations of non-inline templates
213 int flag_implicit_inline_templates
= 1;
215 /* Nonzero means warn about implicit declarations. */
217 int warn_implicit
= 1;
219 /* Nonzero means warn about usage of long long when `-pedantic'. */
221 int warn_long_long
= 1;
223 /* Nonzero means warn when all ctors or dtors are private, and the class
226 int warn_ctor_dtor_privacy
= 1;
228 /* True if we want to implement vtables using "thunks".
229 The default is off. */
231 #ifndef DEFAULT_VTABLE_THUNKS
232 #define DEFAULT_VTABLE_THUNKS 0
234 int flag_vtable_thunks
= DEFAULT_VTABLE_THUNKS
;
236 /* True if we want to deal with repository information. */
238 int flag_use_repository
;
240 /* Nonzero if we want to issue diagnostics that the standard says are not
243 int flag_optional_diags
= 1;
245 /* Nonzero means give string constants the type `const char *', as mandated
248 int flag_const_strings
= 1;
250 /* If non-NULL, dump the tree structure for the entire translation
251 unit to this file. */
253 char *flag_dump_translation_unit
= 0;
255 /* Nonzero means warn about deprecated conversion from string constant to
258 int warn_write_strings
;
260 /* Nonzero means warn about pointer casts that can drop a type qualifier
261 from the pointer target type. */
265 /* Nonzero means warn about sizeof(function) or addition/subtraction
266 of function pointers. */
268 int warn_pointer_arith
= 1;
270 /* Nonzero means warn for any function def without prototype decl. */
272 int warn_missing_prototypes
;
274 /* Nonzero means warn about multiple (redundant) decls for the same single
275 variable or function. */
277 int warn_redundant_decls
;
279 /* Warn if initializer is not completely bracketed. */
281 int warn_missing_braces
;
283 /* Warn about comparison of signed and unsigned values. */
285 int warn_sign_compare
;
287 /* Warn about *printf or *scanf format/argument anomalies. */
291 /* Warn about a subscript that has type char. */
293 int warn_char_subscripts
;
295 /* Warn if a type conversion is done that might have confusing results. */
299 /* Warn if adding () is suggested. */
301 int warn_parentheses
;
303 /* Non-zero means warn in function declared in derived class has the
304 same name as a virtual in the base class, but fails to match the
305 type signature of any virtual function in the base class. */
306 int warn_overloaded_virtual
;
308 /* Non-zero means warn when declaring a class that has a non virtual
309 destructor, when it really ought to have a virtual one. */
312 /* Non-zero means warn when a function is declared extern and later inline. */
313 int warn_extern_inline
;
315 /* Non-zero means warn when the compiler will reorder code. */
318 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
321 /* Non-zero means warn when we convert a pointer to member function
322 into a pointer to (void or function). */
323 int warn_pmf2ptr
= 1;
325 /* Nonzero means warn about violation of some Effective C++ style rules. */
329 /* Nonzero means warn where overload resolution chooses a promotion from
330 unsigned to signed over a conversion to an unsigned of the same size. */
334 /* Nonzero means warn when an old-style cast is used. */
336 int warn_old_style_cast
;
338 /* Warn about #pragma directives that are not recognised. */
340 int warn_unknown_pragmas
; /* Tri state variable. */
342 /* Nonzero means warn about use of multicharacter literals. */
344 int warn_multichar
= 1;
346 /* Nonzero means warn when non-templatized friend functions are
347 declared within a template */
349 int warn_nontemplate_friend
= 1;
351 /* Nonzero means complain about deprecated features. */
353 int warn_deprecated
= 1;
355 /* Nonzero means `$' can be in an identifier. */
357 #ifndef DOLLARS_IN_IDENTIFIERS
358 #define DOLLARS_IN_IDENTIFIERS 1
360 int dollars_in_ident
= DOLLARS_IN_IDENTIFIERS
;
362 /* Nonzero for -fno-strict-prototype switch: do not consider empty
363 argument prototype to mean function takes no arguments. */
365 int flag_strict_prototype
= 2;
366 int strict_prototype
= 1;
367 int strict_prototypes_lang_c
, strict_prototypes_lang_cplusplus
= 1;
369 /* Nonzero means that labels can be used as first-class objects */
373 /* Non-zero means to collect statistics which might be expensive
374 and to print them when we are done. */
375 int flag_detailed_statistics
;
377 /* C++ specific flags. */
378 /* Zero means that `this' is a *const. This gives nice behavior in the
379 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
380 -2 means we're constructing an object and it has fixed type. */
382 int flag_this_is_variable
;
384 /* Nonzero means we should attempt to elide constructors when possible. */
386 int flag_elide_constructors
= 1;
388 /* Nonzero means recognize and handle signature language constructs. */
390 int flag_handle_signatures
;
392 /* Nonzero means that member functions defined in class scope are
393 inline by default. */
395 int flag_default_inline
= 1;
397 /* Controls whether compiler generates 'type descriptor' that give
398 run-time type information. */
401 /* Nonzero if we wish to output cross-referencing information
402 for the GNU class browser. */
403 extern int flag_gnu_xref
;
405 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
408 int flag_huge_objects
;
410 /* Nonzero if we want to conserve space in the .o files. We do this
411 by putting uninitialized data and runtime initialized data into
412 .common instead of .data at the expense of not flagging multiple
415 int flag_conserve_space
;
417 /* Nonzero if we want to obey access control semantics. */
419 int flag_access_control
= 1;
421 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
423 int flag_operator_names
;
425 /* Nonzero if we want to check the return value of new and avoid calling
426 constructors if it is a null pointer. */
430 /* Nonzero if we want the new ANSI rules for pushing a new scope for `for'
431 initialization variables.
432 0: Old rules, set by -fno-for-scope.
433 2: New ANSI rules, set by -ffor-scope.
434 1: Try to implement new ANSI rules, but with backup compatibility
435 (and warnings). This is the default, for now. */
437 int flag_new_for_scope
= 1;
439 /* Nonzero if we want to emit defined symbols with common-like linkage as
440 weak symbols where possible, in order to conform to C++ semantics.
441 Otherwise, emit them as local symbols. */
445 /* Nonzero to enable experimental ABI changes. */
449 /* Nonzero to not ignore namespace std. */
453 /* Maximum template instantiation depth. Must be at least 17 for ANSI
456 int max_tinst_depth
= 17;
458 /* The name-mangling scheme to use. Must be 1 or greater to support
459 template functions with identical types, but different template
461 int name_mangling_version
= 2;
463 /* Nonzero means that guiding declarations are allowed. */
464 int flag_guiding_decls
;
466 /* Nonzero if squashed mangling is to be performed.
467 This uses the B and K codes to reference previously seen class types
468 and class qualifiers. */
469 int flag_do_squangling
;
471 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
475 /* Nonzero means make the default pedwarns warnings instead of errors.
476 The value of this flag is ignored if -pedantic is specified. */
480 /* Table of language-dependent -f options.
481 STRING is the option name. VARIABLE is the address of the variable.
482 ON_VALUE is the value to store in VARIABLE
483 if `-fSTRING' is seen as an option.
484 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
486 static struct { const char *string
; int *variable
; int on_value
;}
490 {"signed-char", &flag_signed_char
, 1},
491 {"unsigned-char", &flag_signed_char
, 0},
492 {"signed-bitfields", &flag_signed_bitfields
, 1},
493 {"unsigned-bitfields", &flag_signed_bitfields
, 0},
494 {"short-enums", &flag_short_enums
, 1},
495 {"short-double", &flag_short_double
, 1},
496 {"cond-mismatch", &flag_cond_mismatch
, 1},
497 {"asm", &flag_no_asm
, 0},
498 {"builtin", &flag_no_builtin
, 0},
500 /* C++-only options. */
501 {"access-control", &flag_access_control
, 1},
502 {"check-new", &flag_check_new
, 1},
503 {"conserve-space", &flag_conserve_space
, 1},
504 {"const-strings", &flag_const_strings
, 1},
505 {"default-inline", &flag_default_inline
, 1},
506 {"dollars-in-identifiers", &dollars_in_ident
, 1},
507 {"elide-constructors", &flag_elide_constructors
, 1},
508 {"external-templates", &flag_external_templates
, 1},
509 {"for-scope", &flag_new_for_scope
, 2},
510 {"gnu-keywords", &flag_no_gnu_keywords
, 0},
511 {"handle-exceptions", &flag_exceptions
, 1},
512 {"handle-signatures", &flag_handle_signatures
, 1},
513 {"honor-std", &flag_honor_std
, 1},
514 {"huge-objects", &flag_huge_objects
, 1},
515 {"implement-inlines", &flag_implement_inlines
, 1},
516 {"implicit-inline-templates", &flag_implicit_inline_templates
, 1},
517 {"implicit-templates", &flag_implicit_templates
, 1},
518 {"labels-ok", &flag_labels_ok
, 1},
519 {"nonansi-builtins", &flag_no_nonansi_builtin
, 0},
520 {"operator-names", &flag_operator_names
, 1},
521 {"optional-diags", &flag_optional_diags
, 1},
522 {"permissive", &flag_permissive
, 1},
523 {"repo", &flag_use_repository
, 1},
524 {"rtti", &flag_rtti
, 1},
525 {"squangle", &flag_do_squangling
, 1},
526 {"stats", &flag_detailed_statistics
, 1},
527 {"strict-prototype", &flag_strict_prototype
, 1},
528 {"this-is-variable", &flag_this_is_variable
, 1},
529 {"vtable-gc", &flag_vtable_gc
, 1},
530 {"vtable-thunks", &flag_vtable_thunks
, 1},
531 {"weak", &flag_weak
, 1},
532 {"xref", &flag_gnu_xref
, 1}
535 /* Decode the string P as a language-specific option.
536 Return the number of strings consumed for a valid option.
537 Otherwise return 0. */
540 lang_decode_option (argc
, argv
)
549 int strings_processed
;
552 strings_processed
= cpp_handle_option (&parse_in
, argc
, argv
);
554 strings_processed
= 0;
555 #endif /* ! USE_CPPLIB */
557 if (!strcmp (p
, "-ftraditional") || !strcmp (p
, "-traditional"))
559 else if (p
[0] == '-' && p
[1] == 'f')
561 /* Some kind of -f option.
562 P's value is the option sans `-f'.
563 Search for it in the table of options. */
568 /* Try special -f options. */
570 if (!strcmp (p
, "handle-exceptions")
571 || !strcmp (p
, "no-handle-exceptions"))
572 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
574 if (!strcmp (p
, "memoize-lookups")
575 || !strcmp (p
, "no-memoize-lookups")
576 || !strcmp (p
, "save-memoized")
577 || !strcmp (p
, "no-save-memoized")
578 || !strcmp (p
, "no-all-virtual")
579 || !strcmp (p
, "no-enum-int-equiv")
580 || !strcmp (p
, "nonnull-objects")
581 || !strcmp (p
, "ansi-overloading"))
586 else if (!strcmp (p
, "all-virtual")
587 || !strcmp (p
, "enum-int-equiv")
588 || !strcmp (p
, "no-nonnull-objects")
589 || !strcmp (p
, "no-ansi-overloading"))
591 warning ("-f%s is no longer supported", p
);
594 else if (! strcmp (p
, "alt-external-templates"))
596 flag_external_templates
= 1;
597 flag_alt_external_templates
= 1;
599 cp_deprecated ("-falt-external-templates");
601 else if (! strcmp (p
, "no-alt-external-templates"))
603 flag_alt_external_templates
= 0;
606 else if (!strcmp (p
, "repo"))
608 flag_use_repository
= 1;
609 flag_implicit_templates
= 0;
612 else if (!strcmp (p
, "guiding-decls"))
614 flag_guiding_decls
= 1;
615 name_mangling_version
= 0;
618 else if (!strcmp (p
, "no-guiding-decls"))
620 flag_guiding_decls
= 0;
623 else if (!strcmp (p
, "this-is-variable"))
625 flag_this_is_variable
= 1;
627 cp_deprecated ("-fthis-is-variable");
629 else if (!strcmp (p
, "external-templates"))
631 flag_external_templates
= 1;
633 cp_deprecated ("-fexternal-templates");
635 else if (!strcmp (p
, "new-abi"))
638 flag_do_squangling
= 1;
640 flag_vtable_thunks
= 1;
642 else if (!strcmp (p
, "no-new-abi"))
645 flag_do_squangling
= 0;
648 else if (!strncmp (p
, "template-depth-", 15))
651 read_integral_parameter (p
+ 15, p
- 2, max_tinst_depth
);
653 else if (!strncmp (p
, "name-mangling-version-", 22))
655 name_mangling_version
=
656 read_integral_parameter (p
+ 22, p
- 2, name_mangling_version
);
658 else if (!strncmp (p
, "dump-translation-unit-", 22))
661 error ("no file specified with -fdump-translation-unit");
663 flag_dump_translation_unit
= p
+ 22;
666 !found
&& j
< sizeof (lang_f_options
) / sizeof (lang_f_options
[0]);
669 if (!strcmp (p
, lang_f_options
[j
].string
))
671 *lang_f_options
[j
].variable
= lang_f_options
[j
].on_value
;
672 /* A goto here would be cleaner,
673 but breaks the vax pcc. */
676 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-'
677 && ! strcmp (p
+3, lang_f_options
[j
].string
))
679 *lang_f_options
[j
].variable
= ! lang_f_options
[j
].on_value
;
685 else if (p
[0] == '-' && p
[1] == 'W')
689 /* The -W options control the warning behavior of the compiler. */
692 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-')
695 if (!strcmp (p
, "implicit"))
696 warn_implicit
= setting
;
697 else if (!strcmp (p
, "long-long"))
698 warn_long_long
= setting
;
699 else if (!strcmp (p
, "return-type"))
700 warn_return_type
= setting
;
701 else if (!strcmp (p
, "ctor-dtor-privacy"))
702 warn_ctor_dtor_privacy
= setting
;
703 else if (!strcmp (p
, "write-strings"))
704 warn_write_strings
= setting
;
705 else if (!strcmp (p
, "cast-qual"))
706 warn_cast_qual
= setting
;
707 else if (!strcmp (p
, "char-subscripts"))
708 warn_char_subscripts
= setting
;
709 else if (!strcmp (p
, "pointer-arith"))
710 warn_pointer_arith
= setting
;
711 else if (!strcmp (p
, "missing-prototypes"))
712 warn_missing_prototypes
= setting
;
713 else if (!strcmp (p
, "redundant-decls"))
714 warn_redundant_decls
= setting
;
715 else if (!strcmp (p
, "missing-braces"))
716 warn_missing_braces
= setting
;
717 else if (!strcmp (p
, "sign-compare"))
718 warn_sign_compare
= setting
;
719 else if (!strcmp (p
, "format"))
720 warn_format
= setting
;
721 else if (!strcmp (p
, "conversion"))
722 warn_conversion
= setting
;
723 else if (!strcmp (p
, "parentheses"))
724 warn_parentheses
= setting
;
725 else if (!strcmp (p
, "non-virtual-dtor"))
726 warn_nonvdtor
= setting
;
727 else if (!strcmp (p
, "extern-inline"))
728 warn_extern_inline
= setting
;
729 else if (!strcmp (p
, "reorder"))
730 warn_reorder
= setting
;
731 else if (!strcmp (p
, "synth"))
732 warn_synth
= setting
;
733 else if (!strcmp (p
, "pmf-conversions"))
734 warn_pmf2ptr
= setting
;
735 else if (!strcmp (p
, "effc++"))
737 else if (!strcmp (p
, "sign-promo"))
738 warn_sign_promo
= setting
;
739 else if (!strcmp (p
, "old-style-cast"))
740 warn_old_style_cast
= setting
;
741 else if (!strcmp (p
, "overloaded-virtual"))
742 warn_overloaded_virtual
= setting
;
743 else if (!strcmp (p
, "multichar"))
744 warn_multichar
= setting
;
745 else if (!strcmp (p
, "unknown-pragmas"))
746 /* Set to greater than 1, so that even unknown pragmas in
747 system headers will be warned about. */
748 warn_unknown_pragmas
= setting
* 2;
749 else if (!strcmp (p
, "non-template-friend"))
750 warn_nontemplate_friend
= setting
;
751 else if (!strcmp (p
, "deprecated"))
752 warn_deprecated
= setting
;
753 else if (!strcmp (p
, "comment"))
754 ; /* cpp handles this one. */
755 else if (!strcmp (p
, "comments"))
756 ; /* cpp handles this one. */
757 else if (!strcmp (p
, "trigraphs"))
758 ; /* cpp handles this one. */
759 else if (!strcmp (p
, "import"))
760 ; /* cpp handles this one. */
761 else if (!strcmp (p
, "all"))
763 warn_return_type
= setting
;
764 warn_unused
= setting
;
765 warn_implicit
= setting
;
766 warn_switch
= setting
;
767 warn_format
= setting
;
768 warn_parentheses
= setting
;
769 warn_missing_braces
= setting
;
770 warn_sign_compare
= setting
;
771 warn_multichar
= setting
;
772 /* We save the value of warn_uninitialized, since if they put
773 -Wuninitialized on the command line, we need to generate a
774 warning about not using it without also specifying -O. */
775 if (warn_uninitialized
!= 1)
776 warn_uninitialized
= (setting
? 2 : 0);
777 /* Only warn about unknown pragmas that are not in system
779 warn_unknown_pragmas
= 1;
781 /* C++-specific warnings. */
782 warn_ctor_dtor_privacy
= setting
;
783 warn_nonvdtor
= setting
;
784 warn_reorder
= setting
;
785 warn_nontemplate_friend
= setting
;
787 else return strings_processed
;
789 else if (!strcmp (p
, "-ansi"))
790 flag_no_nonansi_builtin
= 1, flag_ansi
= 1,
791 flag_no_gnu_keywords
= 1, flag_operator_names
= 1;
793 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
794 it's probably safe to assume no sane person would ever want to use this
795 under normal circumstances. */
796 else if (!strcmp (p
, "-spew-debug"))
800 return strings_processed
;
805 /* Incorporate `const' and `volatile' qualifiers for member functions.
806 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
807 QUALS is a list of qualifiers. */
810 grok_method_quals (ctype
, function
, quals
)
811 tree ctype
, function
, quals
;
813 tree fntype
= TREE_TYPE (function
);
814 tree raises
= TYPE_RAISES_EXCEPTIONS (fntype
);
815 int type_quals
= TYPE_UNQUALIFIED
;
816 int dup_quals
= TYPE_UNQUALIFIED
;
820 int tq
= cp_type_qual_from_rid (TREE_VALUE (quals
));
826 quals
= TREE_CHAIN (quals
);
830 if (dup_quals
!= TYPE_UNQUALIFIED
)
831 cp_error ("duplicate type qualifiers in %s declaration",
832 TREE_CODE (function
) == FUNCTION_DECL
833 ? "member function" : "type");
835 ctype
= cp_build_qualified_type (ctype
, type_quals
);
836 fntype
= build_cplus_method_type (ctype
, TREE_TYPE (fntype
),
837 (TREE_CODE (fntype
) == METHOD_TYPE
838 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype
))
839 : TYPE_ARG_TYPES (fntype
)));
841 fntype
= build_exception_variant (fntype
, raises
);
843 TREE_TYPE (function
) = fntype
;
847 /* Warn when -fexternal-templates is used and #pragma
848 interface/implementation is not used all the times it should be,
852 warn_if_unknown_interface (decl
)
855 static int already_warned
= 0;
856 if (already_warned
++)
859 if (flag_alt_external_templates
)
861 struct tinst_level
*til
= tinst_for_decl ();
863 char *sf
= input_filename
;
868 input_filename
= til
->file
;
870 cp_warning ("template `%#D' instantiated in file without #pragma interface",
876 cp_warning_at ("template `%#D' defined in file without #pragma interface",
880 /* A subroutine of the parser, to handle a component list. */
883 grok_x_components (specs
)
886 struct pending_inline
**p
;
889 specs
= strip_attrs (specs
);
891 check_tag_decl (specs
);
892 t
= groktypename (build_decl_list (specs
, NULL_TREE
));
894 /* The only case where we need to do anything additional here is an
895 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
896 if (t
== NULL_TREE
|| !ANON_AGGR_TYPE_P (t
))
899 fixup_anonymous_aggr (t
);
900 finish_member_declaration (build_lang_field_decl (FIELD_DECL
,
904 /* Ignore any inline function definitions in the anonymous union
905 since an anonymous union may not have function members. */
906 p
= &pending_inlines
;
907 for (; *p
; *p
= (*p
)->next
)
908 if (DECL_CONTEXT ((*p
)->fndecl
) != t
)
912 /* Constructors for types with virtual baseclasses need an "in-charge" flag
913 saying whether this constructor is responsible for initialization of
914 virtual baseclasses or not. All destructors also need this "in-charge"
915 flag, which additionally determines whether or not the destructor should
916 free the memory for the object.
918 This function adds the "in-charge" flag to member function FN if
919 appropriate. It is called from grokclassfn and tsubst.
920 FN must be either a constructor or destructor. */
923 maybe_retrofit_in_chrg (fn
)
926 tree basetype
, arg_types
, parms
, parm
, fntype
;
928 if (DECL_CONSTRUCTOR_P (fn
)
929 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CLASS_CONTEXT (fn
))
930 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn
))
932 else if (! DECL_CONSTRUCTOR_P (fn
)
933 && TREE_CHAIN (DECL_ARGUMENTS (fn
)) == NULL_TREE
)
938 if (DECL_CONSTRUCTOR_P (fn
))
939 DECL_CONSTRUCTOR_FOR_VBASE_P (fn
) = 1;
941 /* First add it to DECL_ARGUMENTS... */
942 parm
= build_decl (PARM_DECL
, in_charge_identifier
, integer_type_node
);
943 /* Mark the artificial `__in_chrg' parameter as "artificial". */
944 SET_DECL_ARTIFICIAL (parm
);
945 DECL_ARG_TYPE (parm
) = integer_type_node
;
946 TREE_READONLY (parm
) = 1;
947 parms
= DECL_ARGUMENTS (fn
);
948 TREE_CHAIN (parm
) = TREE_CHAIN (parms
);
949 TREE_CHAIN (parms
) = parm
;
951 /* ...and then to TYPE_ARG_TYPES. */
952 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
953 basetype
= TREE_TYPE (TREE_VALUE (arg_types
));
954 arg_types
= hash_tree_chain (integer_type_node
, TREE_CHAIN (arg_types
));
955 fntype
= build_cplus_method_type (basetype
, TREE_TYPE (TREE_TYPE (fn
)),
957 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)))
958 fntype
= build_exception_variant (fntype
,
959 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)));
960 TREE_TYPE (fn
) = fntype
;
963 /* Classes overload their constituent function names automatically.
964 When a function name is declared in a record structure,
965 its name is changed to it overloaded name. Since names for
966 constructors and destructors can conflict, we place a leading
969 CNAME is the name of the class we are grokking for.
971 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
973 FLAGS contains bits saying what's special about today's
974 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
976 If FUNCTION is a destructor, then we must add the `auto-delete' field
977 as a second parameter. There is some hair associated with the fact
978 that we must "declare" this variable in the manner consistent with the
979 way the rest of the arguments were declared.
981 QUALS are the qualifiers for the this pointer. */
984 grokclassfn (ctype
, function
, flags
, quals
)
985 tree ctype
, function
;
986 enum overload_flags flags
;
989 tree fn_name
= DECL_NAME (function
);
994 if (fn_name
== NULL_TREE
)
996 error ("name missing for member function");
997 fn_name
= get_identifier ("<anonymous>");
998 DECL_NAME (function
) = fn_name
;
1002 qualtype
= grok_method_quals (ctype
, function
, quals
);
1006 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1007 if (TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1009 /* Must add the class instance variable up front. */
1010 /* Right now we just make this a pointer. But later
1011 we may wish to make it special. */
1012 tree type
= TREE_VALUE (arg_types
);
1015 if ((flag_this_is_variable
> 0)
1016 && (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
)))
1019 parm
= build_decl (PARM_DECL
, this_identifier
, type
);
1020 /* Mark the artificial `this' parameter as "artificial". */
1021 SET_DECL_ARTIFICIAL (parm
);
1022 DECL_ARG_TYPE (parm
) = type
;
1023 /* We can make this a register, so long as we don't
1024 accidentally complain if someone tries to take its address. */
1025 DECL_REGISTER (parm
) = 1;
1027 TREE_READONLY (parm
) = 1;
1028 TREE_CHAIN (parm
) = last_function_parms
;
1029 last_function_parms
= parm
;
1032 DECL_ARGUMENTS (function
) = last_function_parms
;
1033 /* First approximations. */
1034 DECL_CONTEXT (function
) = ctype
;
1035 DECL_CLASS_CONTEXT (function
) = ctype
;
1037 if (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
))
1039 maybe_retrofit_in_chrg (function
);
1040 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1043 if (flags
== DTOR_FLAG
)
1045 DECL_ASSEMBLER_NAME (function
) = build_destructor_name (ctype
);
1046 TYPE_HAS_DESTRUCTOR (ctype
) = 1;
1049 set_mangled_name_for_decl (function
);
1052 /* Work on the expr used by alignof (this is only called by the parser). */
1061 if (processing_template_decl
)
1062 return build_min (ALIGNOF_EXPR
, sizetype
, expr
);
1064 if (TREE_CODE (expr
) == COMPONENT_REF
1065 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
1066 error ("`__alignof__' applied to a bit-field");
1068 if (TREE_CODE (expr
) == INDIRECT_REF
)
1070 best
= t
= TREE_OPERAND (expr
, 0);
1071 bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1073 while (TREE_CODE (t
) == NOP_EXPR
1074 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
1077 t
= TREE_OPERAND (t
, 0);
1078 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1079 if (thisalign
> bestalign
)
1080 best
= t
, bestalign
= thisalign
;
1082 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
1086 /* ANSI says arrays and fns are converted inside comma.
1087 But we can't convert them in build_compound_expr
1088 because that would break commas in lvalues.
1089 So do the conversion here if operand was a comma. */
1090 if (TREE_CODE (expr
) == COMPOUND_EXPR
1091 && (TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
1092 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
))
1093 expr
= default_conversion (expr
);
1094 return c_alignof (TREE_TYPE (expr
));
1098 /* Create an ARRAY_REF, checking for the user doing things backwards
1102 grok_array_decl (array_expr
, index_exp
)
1103 tree array_expr
, index_exp
;
1105 tree type
= TREE_TYPE (array_expr
);
1106 tree p1
, p2
, i1
, i2
;
1108 if (type
== error_mark_node
|| index_exp
== error_mark_node
)
1109 return error_mark_node
;
1110 if (processing_template_decl
)
1111 return build_min (ARRAY_REF
, type
? TREE_TYPE (type
) : NULL_TREE
,
1112 array_expr
, index_exp
);
1114 if (type
== NULL_TREE
)
1116 /* Something has gone very wrong. Assume we are mistakenly reducing
1117 an expression instead of a declaration. */
1118 error ("parser may be lost: is there a '{' missing somewhere?");
1122 if (TREE_CODE (type
) == OFFSET_TYPE
1123 || TREE_CODE (type
) == REFERENCE_TYPE
)
1124 type
= TREE_TYPE (type
);
1126 /* If they have an `operator[]', use that. */
1127 if (IS_AGGR_TYPE (type
) || IS_AGGR_TYPE (TREE_TYPE (index_exp
)))
1128 return build_opfncall (ARRAY_REF
, LOOKUP_NORMAL
,
1129 array_expr
, index_exp
, NULL_TREE
);
1131 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1132 is a little-known fact that, if `a' is an array and `i' is an
1133 int, you can write `i[a]', which means the same thing as `a[i]'. */
1135 if (TREE_CODE (type
) == ARRAY_TYPE
)
1138 p1
= build_expr_type_conversion (WANT_POINTER
, array_expr
, 0);
1140 if (TREE_CODE (TREE_TYPE (index_exp
)) == ARRAY_TYPE
)
1143 p2
= build_expr_type_conversion (WANT_POINTER
, index_exp
, 0);
1145 i1
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, array_expr
, 0);
1146 i2
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, index_exp
, 0);
1148 if ((p1
&& i2
) && (i1
&& p2
))
1149 error ("ambiguous conversion for array subscript");
1152 array_expr
= p1
, index_exp
= i2
;
1154 array_expr
= p2
, index_exp
= i1
;
1157 cp_error ("invalid types `%T[%T]' for array subscript",
1158 type
, TREE_TYPE (index_exp
));
1159 return error_mark_node
;
1162 if (array_expr
== error_mark_node
|| index_exp
== error_mark_node
)
1163 error ("ambiguous conversion for array subscript");
1165 return build_array_ref (array_expr
, index_exp
);
1168 /* Given the cast expression EXP, checking out its validity. Either return
1169 an error_mark_node if there was an unavoidable error, return a cast to
1170 void for trying to delete a pointer w/ the value 0, or return the
1171 call to delete. If DOING_VEC is 1, we handle things differently
1172 for doing an array delete. If DOING_VEC is 2, they gave us the
1173 array size as an argument to delete.
1174 Implements ARM $5.3.4. This is called from the parser. */
1177 delete_sanity (exp
, size
, doing_vec
, use_global_delete
)
1179 int doing_vec
, use_global_delete
;
1182 /* For a regular vector delete (aka, no size argument) we will pass
1183 this down as a NULL_TREE into build_vec_delete. */
1184 tree maxindex
= NULL_TREE
;
1186 if (exp
== error_mark_node
)
1189 if (processing_template_decl
)
1191 t
= build_min (DELETE_EXPR
, void_type_node
, exp
, size
);
1192 DELETE_EXPR_USE_GLOBAL (t
) = use_global_delete
;
1193 DELETE_EXPR_USE_VEC (t
) = doing_vec
;
1197 if (TREE_CODE (exp
) == OFFSET_REF
)
1198 exp
= resolve_offset_ref (exp
);
1199 exp
= convert_from_reference (exp
);
1200 t
= stabilize_reference (exp
);
1201 t
= build_expr_type_conversion (WANT_POINTER
, t
, 1);
1203 if (t
== NULL_TREE
|| t
== error_mark_node
)
1205 cp_error ("type `%#T' argument given to `delete', expected pointer",
1207 return error_mark_node
;
1212 maxindex
= build_binary_op (MINUS_EXPR
, size
, integer_one_node
);
1213 pedwarn ("anachronistic use of array size in vector delete");
1216 type
= TREE_TYPE (t
);
1218 /* As of Valley Forge, you can delete a pointer to const. */
1220 /* You can't delete functions. */
1221 if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
1223 error ("cannot delete a function");
1224 return error_mark_node
;
1227 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1228 if (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
)
1229 cp_warning ("`%T' is not a pointer-to-object type", type
);
1231 /* An array can't have been allocated by new, so complain. */
1232 if (TREE_CODE (t
) == ADDR_EXPR
1233 && TREE_CODE (TREE_OPERAND (t
, 0)) == VAR_DECL
1234 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == ARRAY_TYPE
)
1235 cp_warning ("deleting array `%#D'", TREE_OPERAND (t
, 0));
1237 /* Deleting a pointer with the value zero is valid and has no effect. */
1238 if (integer_zerop (t
))
1239 return build1 (NOP_EXPR
, void_type_node
, t
);
1242 return build_vec_delete (t
, maxindex
, integer_one_node
,
1243 integer_zero_node
, use_global_delete
);
1246 if (IS_AGGR_TYPE (TREE_TYPE (type
))
1247 && TYPE_GETS_REG_DELETE (TREE_TYPE (type
)))
1249 /* Only do access checking here; we'll be calling op delete
1250 from the destructor. */
1251 tree tmp
= build_op_delete_call (DELETE_EXPR
, t
, size_zero_node
,
1252 LOOKUP_NORMAL
, NULL_TREE
);
1253 if (tmp
== error_mark_node
)
1254 return error_mark_node
;
1257 return build_delete (type
, t
, integer_three_node
,
1258 LOOKUP_NORMAL
, use_global_delete
);
1262 /* Report an error if the indicated template declaration is not the
1263 sort of thing that should be a member template. */
1266 check_member_template (tmpl
)
1271 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
1272 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1274 if (TREE_CODE (decl
) == FUNCTION_DECL
1275 || (TREE_CODE (decl
) == TYPE_DECL
1276 && IS_AGGR_TYPE (TREE_TYPE (decl
))))
1278 if (current_function_decl
)
1279 /* 14.5.2.2 [temp.mem]
1281 A local class shall not have member templates. */
1282 cp_error ("declaration of member template `%#D' in local class",
1285 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
1287 /* 14.5.2.3 [temp.mem]
1289 A member function template shall not be virtual. */
1291 ("invalid use of `virtual' in template declaration of `%#D'",
1293 DECL_VIRTUAL_P (decl
) = 0;
1296 /* The debug-information generating code doesn't know what to do
1297 with member templates. */
1298 DECL_IGNORED_P (tmpl
) = 1;
1301 cp_error ("template declaration of `%#D'", decl
);
1304 /* Return true iff TYPE is a valid Java parameter or return type. */
1307 acceptable_java_type (type
)
1310 if (TREE_CODE (type
) == VOID_TYPE
|| TYPE_FOR_JAVA (type
))
1312 if (TREE_CODE (type
) == POINTER_TYPE
)
1314 type
= TREE_TYPE (type
);
1315 if (TREE_CODE (type
) == RECORD_TYPE
)
1318 if (! TYPE_FOR_JAVA (type
))
1320 if (! CLASSTYPE_TEMPLATE_INFO (type
))
1322 args
= CLASSTYPE_TI_ARGS (type
);
1323 i
= TREE_VEC_LENGTH (args
);
1326 type
= TREE_VEC_ELT (args
, i
);
1327 if (TREE_CODE (type
) == POINTER_TYPE
)
1328 type
= TREE_TYPE (type
);
1329 if (! TYPE_FOR_JAVA (type
))
1338 /* For a METHOD in a Java class CTYPE, return 1 if
1339 the parameter and return types are valid Java types.
1340 Otherwise, print appropriate error messages, and return 0. */
1343 check_java_method (method
)
1347 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (method
));
1348 tree ret_type
= TREE_TYPE (TREE_TYPE (method
));
1349 if (! acceptable_java_type (ret_type
))
1351 cp_error ("Java method '%D' has non-Java return type `%T'",
1355 for (; arg_types
!= NULL_TREE
; arg_types
= TREE_CHAIN (arg_types
))
1357 tree type
= TREE_VALUE (arg_types
);
1358 if (! acceptable_java_type (type
))
1360 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1365 return jerr
? 0 : 1;
1368 /* Sanity check: report error if this function FUNCTION is not
1369 really a member of the class (CTYPE) it is supposed to belong to.
1370 CNAME is the same here as it is for grokclassfn above. */
1373 check_classfn (ctype
, function
)
1374 tree ctype
, function
;
1376 tree fn_name
= DECL_NAME (function
);
1377 tree fndecl
, fndecls
;
1378 tree method_vec
= CLASSTYPE_METHOD_VEC (complete_type (ctype
));
1382 if (DECL_USE_TEMPLATE (function
)
1383 && is_member_template (DECL_TI_TEMPLATE (function
)))
1384 /* Since this is a specialization of a member template,
1385 we're not going to find the declaration in the class.
1388 struct S { template <typename T> void f(T); };
1389 template <> void S::f(int);
1391 we're not going to find `S::f(int)', but there's no
1392 reason we should, either. We let our callers know we didn't
1393 find the method, but we don't complain. */
1396 if (method_vec
!= 0)
1398 methods
= &TREE_VEC_ELT (method_vec
, 0);
1399 end
= TREE_VEC_END (method_vec
);
1401 /* First suss out ctors and dtors. */
1402 if (*methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1403 && DECL_CONSTRUCTOR_P (function
))
1405 if (*++methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1406 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
)))
1409 while (++methods
!= end
&& *methods
)
1412 if (fn_name
== DECL_NAME (OVL_CURRENT (*methods
)))
1415 for (fndecls
= *methods
; fndecls
!= NULL_TREE
;
1416 fndecls
= OVL_NEXT (fndecls
))
1418 fndecl
= OVL_CURRENT (fndecls
);
1419 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1420 for a for member function of a template class, is
1421 not mangled, so the check below does not work
1422 correctly in that case. Since mangled destructor
1423 names do not include the type of the arguments,
1424 we can't use this short-cut for them, either.
1425 (It's not legal to declare arguments for a
1426 destructor, but some people try.) */
1427 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
))
1428 && (DECL_ASSEMBLER_NAME (function
)
1429 != DECL_NAME (function
))
1430 && (DECL_ASSEMBLER_NAME (fndecl
)
1431 != DECL_NAME (fndecl
))
1432 && (DECL_ASSEMBLER_NAME (function
)
1433 == DECL_ASSEMBLER_NAME (fndecl
)))
1436 /* We cannot simply call decls_match because this
1437 doesn't work for static member functions that are
1438 pretending to be methods, and because the name
1439 may have been changed by asm("new_name"). */
1440 if (DECL_NAME (function
) == DECL_NAME (fndecl
))
1442 tree p1
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1443 tree p2
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1445 /* Get rid of the this parameter on functions that become
1447 if (DECL_STATIC_FUNCTION_P (fndecl
)
1448 && TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1449 p1
= TREE_CHAIN (p1
);
1451 if (same_type_p (TREE_TYPE (TREE_TYPE (function
)),
1452 TREE_TYPE (TREE_TYPE (fndecl
)))
1453 && compparms (p1
, p2
)
1454 && (DECL_TEMPLATE_SPECIALIZATION (function
)
1455 == DECL_TEMPLATE_SPECIALIZATION (fndecl
))
1456 && (!DECL_TEMPLATE_SPECIALIZATION (function
)
1457 || (DECL_TI_TEMPLATE (function
)
1458 == DECL_TI_TEMPLATE (fndecl
))))
1467 if (methods
!= end
&& *methods
)
1469 tree fndecl
= *methods
;
1470 cp_error ("prototype for `%#D' does not match any in class `%T'",
1472 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl
) ? "s are" : " is",
1473 OVL_CURRENT (fndecl
));
1474 while (fndecl
= OVL_NEXT (fndecl
), fndecl
)
1475 cp_error_at (" %#D", OVL_CURRENT(fndecl
));
1480 if (TYPE_SIZE (ctype
) == 0)
1481 incomplete_type_error (function
, ctype
);
1483 cp_error ("no `%#D' member function declared in class `%T'",
1487 /* If we did not find the method in the class, add it to avoid
1488 spurious errors (unless the CTYPE is not yet defined, in which
1489 case we'll only confuse ourselves when the function is declared
1490 properly within the class. */
1491 if (TYPE_SIZE (ctype
))
1492 add_method (ctype
, methods
, function
);
1496 /* We have just processed the DECL, which is a static data member.
1497 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1498 present, is the assembly-language name for the data member.
1499 NEED_POP and FLAGS are as for cp_finish_decl. */
1502 finish_static_data_member_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
1509 const char *asmspec
= 0;
1512 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1514 my_friendly_assert (TREE_PUBLIC (decl
), 0);
1516 /* We cannot call pushdecl here, because that would fill in the
1517 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1518 the right thing, namely, to put this decl out straight away. */
1519 /* current_class_type can be NULL_TREE in case of error. */
1520 if (!asmspec
&& current_class_type
)
1522 DECL_INITIAL (decl
) = error_mark_node
;
1523 DECL_ASSEMBLER_NAME (decl
)
1524 = build_static_name (current_class_type
, DECL_NAME (decl
));
1526 if (! processing_template_decl
)
1528 if (!pending_statics
)
1529 VARRAY_TREE_INIT (pending_statics
, 32, "pending_statics");
1531 if (pending_statics_used
== pending_statics
->num_elements
)
1532 VARRAY_GROW (pending_statics
,
1533 2 * pending_statics
->num_elements
);
1534 VARRAY_TREE (pending_statics
, pending_statics_used
) = decl
;
1535 ++pending_statics_used
;
1538 /* Static consts need not be initialized in the class definition. */
1539 if (init
!= NULL_TREE
&& TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
1541 static int explanation
= 0;
1543 error ("initializer invalid for static member with constructor");
1544 if (explanation
++ == 0)
1545 error ("(you really want to initialize it separately)");
1548 /* Force the compiler to know when an uninitialized static const
1549 member is being used. */
1550 if (CP_TYPE_CONST_P (TREE_TYPE (decl
)) && init
== 0)
1551 TREE_USED (decl
) = 1;
1552 DECL_INITIAL (decl
) = init
;
1553 DECL_IN_AGGR_P (decl
) = 1;
1554 DECL_CONTEXT (decl
) = current_class_type
;
1555 DECL_CLASS_CONTEXT (decl
) = current_class_type
;
1557 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
);
1560 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1561 of a structure component, returning a FIELD_DECL node.
1562 QUALS is a list of type qualifiers for this decl (such as for declaring
1563 const member functions).
1565 This is done during the parsing of the struct declaration.
1566 The FIELD_DECL nodes are chained together and the lot of them
1567 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1571 If class A defines that certain functions in class B are friends, then
1572 the way I have set things up, it is B who is interested in permission
1573 granted by A. However, it is in A's context that these declarations
1574 are parsed. By returning a void_type_node, class A does not attempt
1575 to incorporate the declarations of the friends within its structure.
1577 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1578 CHANGES TO CODE IN `start_method'. */
1581 grokfield (declarator
, declspecs
, init
, asmspec_tree
, attrlist
)
1582 tree declarator
, declspecs
, init
, asmspec_tree
, attrlist
;
1584 register tree value
;
1585 const char *asmspec
= 0;
1586 int flags
= LOOKUP_ONLYCONVERTING
;
1588 /* Convert () initializers to = initializers. */
1589 if (init
== NULL_TREE
&& declarator
!= NULL_TREE
1590 && TREE_CODE (declarator
) == CALL_EXPR
1591 && TREE_OPERAND (declarator
, 0)
1592 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) == IDENTIFIER_NODE
1593 || TREE_CODE (TREE_OPERAND (declarator
, 0)) == SCOPE_REF
)
1594 && parmlist_is_exprlist (TREE_OPERAND (declarator
, 1)))
1596 init
= TREE_OPERAND (declarator
, 1);
1597 declarator
= TREE_OPERAND (declarator
, 0);
1601 if (declspecs
== NULL_TREE
1602 && TREE_CODE (declarator
) == SCOPE_REF
1603 && TREE_CODE (TREE_OPERAND (declarator
, 1)) == IDENTIFIER_NODE
)
1605 /* Access declaration */
1606 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator
, 0))))
1608 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
1609 pop_nested_class ();
1610 return do_class_using_decl (declarator
);
1614 && TREE_CODE (init
) == TREE_LIST
1615 && TREE_VALUE (init
) == error_mark_node
1616 && TREE_CHAIN (init
) == NULL_TREE
)
1619 value
= grokdeclarator (declarator
, declspecs
, FIELD
, init
!= 0, attrlist
);
1620 if (! value
|| value
== error_mark_node
)
1621 /* friend or constructor went bad. */
1624 /* Pass friendly classes back. */
1625 if (TREE_CODE (value
) == VOID_TYPE
)
1626 return void_type_node
;
1628 if (DECL_NAME (value
) != NULL_TREE
1629 && IDENTIFIER_POINTER (DECL_NAME (value
))[0] == '_'
1630 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value
)), "_vptr"))
1631 cp_error ("member `%D' conflicts with virtual function table field name",
1634 /* Stash away type declarations. */
1635 if (TREE_CODE (value
) == TYPE_DECL
)
1637 DECL_NONLOCAL (value
) = 1;
1638 DECL_CONTEXT (value
) = current_class_type
;
1639 DECL_CLASS_CONTEXT (value
) = current_class_type
;
1641 /* Now that we've updated the context, we need to remangle the
1642 name for this TYPE_DECL. */
1643 DECL_ASSEMBLER_NAME (value
) = DECL_NAME (value
);
1644 if (!uses_template_parms (value
))
1645 DECL_ASSEMBLER_NAME (value
) =
1646 get_identifier (build_overload_name (TREE_TYPE (value
), 1, 1));
1651 if (IS_SIGNATURE (current_class_type
)
1652 && TREE_CODE (value
) != FUNCTION_DECL
)
1654 error ("field declaration not allowed in signature");
1655 return void_type_node
;
1658 if (DECL_IN_AGGR_P (value
))
1660 cp_error ("`%D' is already defined in `%T'", value
,
1661 DECL_CONTEXT (value
));
1662 return void_type_node
;
1666 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1670 if (IS_SIGNATURE (current_class_type
)
1671 && TREE_CODE (value
) == FUNCTION_DECL
)
1673 error ("function declarations cannot have initializers in signature");
1676 else if (TREE_CODE (value
) == FUNCTION_DECL
)
1678 grok_function_init (value
, init
);
1681 else if (pedantic
&& TREE_CODE (value
) != VAR_DECL
)
1682 /* Already complained in grokdeclarator. */
1686 /* We allow initializers to become parameters to base
1688 if (TREE_CODE (init
) == TREE_LIST
)
1690 if (TREE_CHAIN (init
) == NULL_TREE
)
1691 init
= TREE_VALUE (init
);
1693 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1696 if (TREE_CODE (init
) == CONST_DECL
)
1697 init
= DECL_INITIAL (init
);
1698 else if (TREE_READONLY_DECL_P (init
))
1699 init
= decl_constant_value (init
);
1700 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1701 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1702 my_friendly_assert (TREE_PERMANENT (init
), 192);
1703 if (init
== error_mark_node
)
1704 /* We must make this look different than `error_mark_node'
1705 because `decl_const_value' would mis-interpret it
1706 as only meaning that this VAR_DECL is defined. */
1707 init
= build1 (NOP_EXPR
, TREE_TYPE (value
), init
);
1708 else if (processing_template_decl
)
1710 else if (! TREE_CONSTANT (init
))
1712 /* We can allow references to things that are effectively
1713 static, since references are initialized with the address. */
1714 if (TREE_CODE (TREE_TYPE (value
)) != REFERENCE_TYPE
1715 || (TREE_STATIC (init
) == 0
1716 && (TREE_CODE_CLASS (TREE_CODE (init
)) != 'd'
1717 || DECL_EXTERNAL (init
) == 0)))
1719 error ("field initializer is not constant");
1720 init
= error_mark_node
;
1726 /* The corresponding pop_obstacks is in cp_finish_decl. */
1727 push_obstacks_nochange ();
1729 if (processing_template_decl
&& ! current_function_decl
1730 && (TREE_CODE (value
) == VAR_DECL
|| TREE_CODE (value
) == FUNCTION_DECL
))
1731 value
= push_template_decl (value
);
1734 cplus_decl_attributes (value
, TREE_PURPOSE (attrlist
),
1735 TREE_VALUE (attrlist
));
1737 if (TREE_CODE (value
) == VAR_DECL
)
1739 finish_static_data_member_decl (value
, init
, asmspec_tree
,
1740 /*need_pop=*/1, flags
);
1743 if (TREE_CODE (value
) == FIELD_DECL
)
1747 /* This must override the asm specifier which was placed
1748 by grokclassfn. Lay this out fresh. */
1749 DECL_RTL (value
) = NULL_RTX
;
1750 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1752 if (DECL_INITIAL (value
) == error_mark_node
)
1753 init
= error_mark_node
;
1754 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1755 DECL_INITIAL (value
) = init
;
1756 DECL_IN_AGGR_P (value
) = 1;
1759 if (TREE_CODE (value
) == FUNCTION_DECL
)
1763 /* This must override the asm specifier which was placed
1764 by grokclassfn. Lay this out fresh. */
1765 DECL_RTL (value
) = NULL_RTX
;
1766 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1768 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1770 /* Pass friends back this way. */
1771 if (DECL_FRIEND_P (value
))
1772 return void_type_node
;
1774 #if 0 /* Just because a fn is declared doesn't mean we'll try to define it. */
1775 if (current_function_decl
&& ! IS_SIGNATURE (current_class_type
))
1776 cp_error ("method `%#D' of local class must be defined in class body",
1780 DECL_IN_AGGR_P (value
) = 1;
1783 my_friendly_abort (21);
1788 /* Like `grokfield', but for bitfields.
1789 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1792 grokbitfield (declarator
, declspecs
, width
)
1793 tree declarator
, declspecs
, width
;
1795 register tree value
= grokdeclarator (declarator
, declspecs
, BITFIELD
,
1798 if (! value
) return NULL_TREE
; /* friends went bad. */
1800 /* Pass friendly classes back. */
1801 if (TREE_CODE (value
) == VOID_TYPE
)
1802 return void_type_node
;
1804 if (TREE_CODE (value
) == TYPE_DECL
)
1806 cp_error ("cannot declare `%D' to be a bitfield type", value
);
1810 /* Usually, finish_struct_1 catches bitifields with invalid types.
1811 But, in the case of bitfields with function type, we confuse
1812 ourselves into thinking they are member functions, so we must
1814 if (TREE_CODE (value
) == FUNCTION_DECL
)
1816 cp_error ("cannot declare bitfield `%D' with funcion type",
1821 if (IS_SIGNATURE (current_class_type
))
1823 error ("field declaration not allowed in signature");
1824 return void_type_node
;
1827 if (DECL_IN_AGGR_P (value
))
1829 cp_error ("`%D' is already defined in the class %T", value
,
1830 DECL_CONTEXT (value
));
1831 return void_type_node
;
1834 GNU_xref_member (current_class_name
, value
);
1836 if (TREE_STATIC (value
))
1838 cp_error ("static member `%D' cannot be a bitfield", value
);
1841 cp_finish_decl (value
, NULL_TREE
, NULL_TREE
, 0, 0);
1843 if (width
!= error_mark_node
)
1845 constant_expression_warning (width
);
1846 DECL_INITIAL (value
) = width
;
1847 SET_DECL_C_BIT_FIELD (value
);
1850 DECL_IN_AGGR_P (value
) = 1;
1855 grokoptypename (declspecs
, declarator
)
1856 tree declspecs
, declarator
;
1858 tree t
= grokdeclarator (declarator
, declspecs
, TYPENAME
, 0, NULL_TREE
);
1859 return build_typename_overload (t
);
1862 /* When a function is declared with an initializer,
1863 do the right thing. Currently, there are two possibilities:
1868 // initialization possibility #1.
1869 virtual void f () = 0;
1891 // initialization possibility #2
1898 copy_assignment_arg_p (parmtype
, virtualp
)
1900 int virtualp ATTRIBUTE_UNUSED
;
1902 if (current_class_type
== NULL_TREE
)
1905 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
1906 parmtype
= TREE_TYPE (parmtype
);
1908 if ((TYPE_MAIN_VARIANT (parmtype
) == current_class_type
)
1910 /* Non-standard hack to support old Booch components. */
1911 || (! virtualp
&& DERIVED_FROM_P (parmtype
, current_class_type
))
1920 grok_function_init (decl
, init
)
1924 /* An initializer for a function tells how this function should
1926 tree type
= TREE_TYPE (decl
);
1928 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1929 cp_error ("initializer specified for non-member function `%D'", decl
);
1931 /* We'll check for this in finish_struct_1. */
1932 else if (DECL_VINDEX (decl
) == NULL_TREE
)
1933 cp_error ("initializer specified for non-virtual method `%D'", decl
);
1935 else if (integer_zerop (init
))
1938 /* Mark this function as being "defined". */
1939 DECL_INITIAL (decl
) = error_mark_node
;
1940 /* pure virtual destructors must be defined. */
1941 /* pure virtual needs to be defined (as abort) only when put in
1942 vtbl. For wellformed call, it should be itself. pr4737 */
1943 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl
)))
1945 extern tree abort_fndecl
;
1946 /* Give this node rtl from `abort'. */
1947 DECL_RTL (decl
) = DECL_RTL (abort_fndecl
);
1950 DECL_ABSTRACT_VIRTUAL_P (decl
) = 1;
1951 if (DECL_NAME (decl
) == ansi_opname
[(int) MODIFY_EXPR
])
1954 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
))));
1956 if (copy_assignment_arg_p (parmtype
, 1))
1957 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type
) = 1;
1961 cp_error ("invalid initializer for virtual method `%D'", decl
);
1965 cplus_decl_attributes (decl
, attributes
, prefix_attributes
)
1966 tree decl
, attributes
, prefix_attributes
;
1968 if (decl
== NULL_TREE
|| decl
== void_type_node
)
1971 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
1972 decl
= DECL_TEMPLATE_RESULT (decl
);
1974 decl_attributes (decl
, attributes
, prefix_attributes
);
1976 if (TREE_CODE (decl
) == TYPE_DECL
)
1977 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl
), TREE_TYPE (decl
));
1980 /* CONSTRUCTOR_NAME:
1981 Return the name for the constructor (or destructor) for the
1982 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1983 IDENTIFIER_NODE. When given a template, this routine doesn't
1984 lose the specialization. */
1987 constructor_name_full (thing
)
1990 if (TREE_CODE (thing
) == TEMPLATE_TYPE_PARM
1991 || TREE_CODE (thing
) == TEMPLATE_TEMPLATE_PARM
1992 || TREE_CODE (thing
) == TYPENAME_TYPE
)
1993 thing
= TYPE_NAME (thing
);
1994 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing
)))
1996 if (TYPE_WAS_ANONYMOUS (thing
) && TYPE_HAS_CONSTRUCTOR (thing
))
1997 thing
= DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing
), 0)));
1999 thing
= TYPE_NAME (thing
);
2001 if (TREE_CODE (thing
) == TYPE_DECL
2002 || (TREE_CODE (thing
) == TEMPLATE_DECL
2003 && TREE_CODE (DECL_TEMPLATE_RESULT (thing
)) == TYPE_DECL
))
2004 thing
= DECL_NAME (thing
);
2005 my_friendly_assert (TREE_CODE (thing
) == IDENTIFIER_NODE
, 197);
2009 /* CONSTRUCTOR_NAME:
2010 Return the name for the constructor (or destructor) for the
2011 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
2012 IDENTIFIER_NODE. When given a template, return the plain
2013 unspecialized name. */
2016 constructor_name (thing
)
2020 thing
= constructor_name_full (thing
);
2021 t
= IDENTIFIER_TEMPLATE (thing
);
2027 /* Cache the value of this class's main virtual function table pointer
2028 in a register variable. This will save one indirection if a
2029 more than one virtual function call is made this function. */
2034 extern tree base_init_expr
;
2036 if (base_init_expr
== 0
2037 && DECL_CONSTRUCTOR_P (current_function_decl
))
2039 if (processing_template_decl
)
2040 add_tree (build_min_nt
2042 current_member_init_list
, current_base_init_list
));
2044 emit_base_init (current_class_type
, 0);
2048 /* Record the existence of an addressable inline function. */
2051 mark_inline_for_output (decl
)
2054 decl
= DECL_MAIN_VARIANT (decl
);
2055 if (DECL_SAVED_INLINE (decl
))
2057 my_friendly_assert (TREE_PERMANENT (decl
), 363);
2058 DECL_SAVED_INLINE (decl
) = 1;
2060 VARRAY_TREE_INIT (saved_inlines
, 32, "saved_inlines");
2062 if (saved_inlines_used
== saved_inlines
->num_elements
)
2063 VARRAY_GROW (saved_inlines
,
2064 2 * saved_inlines
->num_elements
);
2065 VARRAY_TREE (saved_inlines
, saved_inlines_used
) = decl
;
2066 ++saved_inlines_used
;
2072 temp_name_counter
= 0;
2075 /* Hand off a unique name which can be used for variable we don't really
2076 want to know about anyway, for example, the anonymous variables which
2077 are needed to make references work. Declare this thing so we can use it.
2078 The variable created will be of type TYPE.
2080 STATICP is nonzero if this variable should be static. */
2083 get_temp_name (type
, staticp
)
2087 char buf
[sizeof (AUTO_TEMP_FORMAT
) + 20];
2089 int toplev
= toplevel_bindings_p ();
2091 push_obstacks_nochange ();
2092 if (toplev
|| staticp
)
2094 end_temporary_allocation ();
2095 sprintf (buf
, AUTO_TEMP_FORMAT
, global_temp_name_counter
++);
2096 decl
= pushdecl_top_level (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2100 sprintf (buf
, AUTO_TEMP_FORMAT
, temp_name_counter
++);
2101 decl
= pushdecl (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2103 TREE_USED (decl
) = 1;
2104 TREE_STATIC (decl
) = staticp
;
2105 DECL_ARTIFICIAL (decl
) = 1;
2107 /* If this is a local variable, then lay out its rtl now.
2108 Otherwise, callers of this function are responsible for dealing
2109 with this variable's rtl. */
2113 expand_decl_init (decl
);
2120 /* Get a variable which we can use for multiple assignments.
2121 It is not entered into current_binding_level, because
2122 that breaks things when it comes time to do final cleanups
2123 (which take place "outside" the binding contour of the function). */
2126 get_temp_regvar (type
, init
)
2131 decl
= build_decl (VAR_DECL
, NULL_TREE
, type
);
2132 TREE_USED (decl
) = 1;
2133 DECL_REGISTER (decl
) = 1;
2134 DECL_ARTIFICIAL (decl
) = 1;
2136 DECL_RTL (decl
) = assign_temp (type
, 2, 0, 1);
2137 /* We can expand these without fear, since they cannot need
2138 constructors or destructors. */
2139 expand_expr (build_modify_expr (decl
, INIT_EXPR
, init
),
2140 NULL_RTX
, VOIDmode
, 0);
2145 /* Hunts through the global anonymous union ANON_DECL, building
2146 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2147 returns a VAR_DECL whose size is the same as the size of the
2148 ANON_DECL, if one is available. */
2151 build_anon_union_vars (anon_decl
, elems
, static_p
, external_p
)
2157 tree type
= TREE_TYPE (anon_decl
);
2158 tree main_decl
= NULL_TREE
;
2161 /* Rather than write the code to handle the non-union case,
2162 just give an error. */
2163 if (TREE_CODE (type
) != UNION_TYPE
)
2164 error ("anonymous struct not inside named type");
2166 for (field
= TYPE_FIELDS (type
);
2168 field
= TREE_CHAIN (field
))
2172 if (DECL_ARTIFICIAL (field
))
2174 if (TREE_CODE (field
) != FIELD_DECL
)
2176 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2181 if (TREE_PRIVATE (field
))
2182 cp_pedwarn_at ("private member `%#D' in anonymous union", field
);
2183 else if (TREE_PROTECTED (field
))
2184 cp_pedwarn_at ("protected member `%#D' in anonymous union", field
);
2186 if (DECL_NAME (field
) == NULL_TREE
2187 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2189 decl
= build_anon_union_vars (field
, elems
, static_p
, external_p
);
2193 else if (DECL_NAME (field
) == NULL_TREE
)
2197 decl
= build_decl (VAR_DECL
, DECL_NAME (field
), TREE_TYPE (field
));
2198 /* tell `pushdecl' that this is not tentative. */
2199 DECL_INITIAL (decl
) = error_mark_node
;
2200 TREE_PUBLIC (decl
) = 0;
2201 TREE_STATIC (decl
) = static_p
;
2202 DECL_EXTERNAL (decl
) = external_p
;
2203 decl
= pushdecl (decl
);
2204 DECL_INITIAL (decl
) = NULL_TREE
;
2207 /* Only write out one anon union element--choose the one that
2208 can hold them all. */
2209 if (main_decl
== NULL_TREE
2210 && simple_cst_equal (DECL_SIZE (decl
),
2211 DECL_SIZE (anon_decl
)) == 1)
2214 /* ??? This causes there to be no debug info written out
2216 TREE_ASM_WRITTEN (decl
) = 1;
2218 if (DECL_NAME (field
) == NULL_TREE
2219 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2220 /* The remainder of the processing was already done in the
2224 /* If there's a cleanup to do, it belongs in the
2225 TREE_PURPOSE of the following TREE_LIST. */
2226 *elems
= scratch_tree_cons (NULL_TREE
, decl
, *elems
);
2227 TREE_TYPE (*elems
) = type
;
2233 /* Finish off the processing of a UNION_TYPE structure.
2234 If there are static members, then all members are
2235 static, and must be laid out together. If the
2236 union is an anonymous union, we arrange for that
2237 as well. PUBLIC_P is nonzero if this union is
2238 not declared static. */
2241 finish_anon_union (anon_union_decl
)
2242 tree anon_union_decl
;
2244 tree type
= TREE_TYPE (anon_union_decl
);
2245 tree elems
= NULL_TREE
;
2247 int public_p
= TREE_PUBLIC (anon_union_decl
);
2248 int static_p
= TREE_STATIC (anon_union_decl
);
2249 int external_p
= DECL_EXTERNAL (anon_union_decl
);
2251 if (TYPE_FIELDS (type
) == NULL_TREE
)
2256 error ("global anonymous unions must be declared static");
2260 main_decl
= build_anon_union_vars (anon_union_decl
, &elems
,
2261 static_p
, external_p
);
2263 if (main_decl
== NULL_TREE
)
2265 warning ("anonymous union with no members");
2271 make_decl_rtl (main_decl
, 0, toplevel_bindings_p ());
2272 DECL_RTL (anon_union_decl
) = DECL_RTL (main_decl
);
2275 /* The following call assumes that there are never any cleanups
2276 for anonymous unions--a reasonable assumption. */
2277 expand_anon_union_decl (anon_union_decl
, NULL_TREE
, elems
);
2280 /* Finish processing a builtin type TYPE. It's name is NAME,
2281 its fields are in the array FIELDS. LEN is the number of elements
2282 in FIELDS minus one, or put another way, it is the maximum subscript
2285 It is given the same alignment as ALIGN_TYPE. */
2288 finish_builtin_type (type
, name
, fields
, len
, align_type
)
2297 TYPE_FIELDS (type
) = fields
[0];
2298 for (i
= 0; i
< len
; i
++)
2300 layout_type (TREE_TYPE (fields
[i
]));
2301 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2302 TREE_CHAIN (fields
[i
]) = fields
[i
+1];
2304 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2305 DECL_CLASS_CONTEXT (fields
[i
]) = type
;
2306 TYPE_ALIGN (type
) = TYPE_ALIGN (align_type
);
2308 #if 0 /* not yet, should get fixed properly later */
2309 TYPE_NAME (type
) = make_type_decl (get_identifier (name
), type
);
2311 TYPE_NAME (type
) = build_decl (TYPE_DECL
, get_identifier (name
), type
);
2313 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2314 layout_decl (TYPE_NAME (type
), 0);
2317 /* Auxiliary functions to make type signatures for
2318 `operator new' and `operator delete' correspond to
2319 what compiler will be expecting. */
2322 coerce_new_type (type
)
2327 if (TREE_CODE (type
) == METHOD_TYPE
)
2328 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (TYPE_ARG_TYPES (type
)));
2329 if (! same_type_p (TREE_TYPE (type
), ptr_type_node
))
2330 e1
= 1, error ("`operator new' must return type `void *'");
2332 /* Technically the type must be `size_t', but we may not know
2334 if (TYPE_ARG_TYPES (type
) == NULL_TREE
)
2335 e1
= 1, error ("`operator new' takes type `size_t' parameter");
2336 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type
)), sizetype
))
2337 e2
= 1, error ("`operator new' takes type `size_t' as first parameter");
2339 type
= build_function_type (ptr_type_node
, tree_cons (NULL_TREE
, sizetype
, TREE_CHAIN (TYPE_ARG_TYPES (type
))));
2341 type
= build_function_type (ptr_type_node
, TYPE_ARG_TYPES (type
));
2346 coerce_delete_type (type
)
2353 tree arg_types
= TYPE_ARG_TYPES (type
);
2355 if (TREE_CODE (type
) == METHOD_TYPE
)
2357 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (arg_types
));
2358 arg_types
= TREE_CHAIN (arg_types
);
2361 if (TREE_TYPE (type
) != void_type_node
)
2362 e1
= 1, error ("`operator delete' must return type `void'");
2364 if (arg_types
== NULL_TREE
2365 || ! same_type_p (TREE_VALUE (arg_types
), ptr_type_node
))
2366 e2
= 1, error ("`operator delete' takes type `void *' as first parameter");
2370 && TREE_CHAIN (arg_types
)
2371 && TREE_CHAIN (arg_types
) != void_list_node
)
2373 /* Again, technically this argument must be `size_t', but again
2374 we may not know what that is. */
2375 tree t2
= TREE_VALUE (TREE_CHAIN (arg_types
));
2376 if (! same_type_p (t2
, sizetype
))
2377 e3
= 1, error ("second argument to `operator delete' must be of type `size_t'");
2378 else if (TREE_CHAIN (TREE_CHAIN (arg_types
)) != void_list_node
)
2381 if (TREE_CHAIN (TREE_CHAIN (arg_types
)))
2382 error ("too many arguments in declaration of `operator delete'");
2384 error ("`...' invalid in specification of `operator delete'");
2389 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2390 build_tree_list (NULL_TREE
, sizetype
));
2393 if (arg_types
== NULL_TREE
)
2394 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
2396 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, TREE_CHAIN (arg_types
));
2402 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2403 arg_types
? TREE_CHAIN (arg_types
): NULL_TREE
);
2405 type
= build_function_type (void_type_node
, arg_types
);
2411 mark_vtable_entries (decl
)
2414 tree entries
= CONSTRUCTOR_ELTS (DECL_INITIAL (decl
));
2416 for (; entries
; entries
= TREE_CHAIN (entries
))
2421 fnaddr
= (flag_vtable_thunks
? TREE_VALUE (entries
)
2422 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries
)));
2424 if (TREE_CODE (fnaddr
) == NOP_EXPR
)
2428 fn
= TREE_OPERAND (fnaddr
, 0);
2429 TREE_ADDRESSABLE (fn
) = 1;
2430 if (TREE_CODE (fn
) == THUNK_DECL
&& DECL_EXTERNAL (fn
))
2432 DECL_EXTERNAL (fn
) = 0;
2439 /* Set DECL up to have the closest approximation of "initialized common"
2440 linkage available. */
2443 comdat_linkage (decl
)
2447 make_decl_one_only (decl
);
2448 else if (TREE_CODE (decl
) == FUNCTION_DECL
|| DECL_VIRTUAL_P (decl
))
2449 /* We can just emit functions and vtables statically; it doesn't really
2450 matter if we have multiple copies. */
2451 TREE_PUBLIC (decl
) = 0;
2454 /* Static data member template instantiations, however, cannot
2455 have multiple copies. */
2456 if (DECL_INITIAL (decl
) == 0
2457 || DECL_INITIAL (decl
) == error_mark_node
)
2458 DECL_COMMON (decl
) = 1;
2459 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
2461 DECL_COMMON (decl
) = 1;
2462 DECL_INITIAL (decl
) = error_mark_node
;
2466 /* We can't do anything useful; leave vars for explicit
2468 DECL_EXTERNAL (decl
) = 1;
2469 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2473 if (DECL_LANG_SPECIFIC (decl
))
2474 DECL_COMDAT (decl
) = 1;
2477 /* For win32 we also want to put explicit instantiations in
2478 linkonce sections, so that they will be merged with implicit
2479 instantiations; otherwise we get duplicate symbol errors. */
2482 maybe_make_one_only (decl
)
2485 /* This is not necessary on targets that support weak symbols, because
2486 the implicit instantiations will defer to the explicit one. */
2487 if (! supports_one_only () || SUPPORTS_WEAK
)
2490 /* We can't set DECL_COMDAT on functions, or finish_file will think
2491 we can get away with not emitting them if they aren't used. We need
2492 to for variables so that cp_finish_decl will update their linkage,
2493 because their DECL_INITIAL may not have been set properly yet. */
2495 make_decl_one_only (decl
);
2497 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_LANG_SPECIFIC (decl
))
2498 DECL_COMDAT (decl
) = 1;
2501 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2502 based on TYPE and other static flags.
2504 Note that anything public is tagged TREE_PUBLIC, whether
2505 it's public in this file or in another one. */
2508 import_export_vtable (decl
, type
, final
)
2512 if (DECL_INTERFACE_KNOWN (decl
))
2515 if (TYPE_FOR_JAVA (type
))
2517 TREE_PUBLIC (decl
) = 1;
2518 DECL_EXTERNAL (decl
) = 1;
2519 DECL_INTERFACE_KNOWN (decl
) = 1;
2521 else if (CLASSTYPE_INTERFACE_KNOWN (type
))
2523 TREE_PUBLIC (decl
) = 1;
2524 DECL_EXTERNAL (decl
) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type
);
2525 DECL_INTERFACE_KNOWN (decl
) = 1;
2529 /* We can only wait to decide if we have real non-inline virtual
2530 functions in our class, or if we come from a template. */
2532 int found
= CLASSTYPE_TEMPLATE_INSTANTIATION (type
);
2534 if (! found
&& ! final
)
2537 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
2538 method
= TREE_CHAIN (method
))
2539 if (DECL_VINDEX (method
) != NULL_TREE
2540 && ! DECL_THIS_INLINE (method
)
2541 && ! DECL_ABSTRACT_VIRTUAL_P (method
))
2548 if (final
|| ! found
)
2550 comdat_linkage (decl
);
2551 DECL_EXTERNAL (decl
) = 0;
2555 TREE_PUBLIC (decl
) = 1;
2556 DECL_EXTERNAL (decl
) = 1;
2561 /* Determine whether or not we want to specifically import or export CTYPE,
2562 using various heuristics. */
2565 import_export_class (ctype
)
2568 /* -1 for imported, 1 for exported. */
2569 int import_export
= 0;
2571 if (CLASSTYPE_INTERFACE_KNOWN (ctype
))
2574 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2575 we will have CLASSTYPE_INTERFACE_ONLY set but not
2576 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2577 heuristic because someone will supply a #pragma implementation
2578 elsewhere, and deducing it here would produce a conflict. */
2579 if (CLASSTYPE_INTERFACE_ONLY (ctype
))
2582 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2583 /* FIXME this should really use some sort of target-independent macro. */
2584 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype
)))
2586 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype
)))
2590 /* If we got -fno-implicit-templates, we import template classes that
2591 weren't explicitly instantiated. */
2592 if (import_export
== 0
2593 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype
)
2594 && ! flag_implicit_templates
)
2597 /* Base our import/export status on that of the first non-inline,
2598 non-abstract virtual function, if any. */
2599 if (import_export
== 0
2600 && TYPE_VIRTUAL_P (ctype
)
2601 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2604 for (method
= TYPE_METHODS (ctype
); method
!= NULL_TREE
;
2605 method
= TREE_CHAIN (method
))
2607 if (DECL_VINDEX (method
) != NULL_TREE
2608 && !DECL_THIS_INLINE (method
)
2609 && !DECL_ABSTRACT_VIRTUAL_P (method
))
2611 import_export
= (DECL_REALLY_EXTERN (method
) ? -1 : 1);
2617 #ifdef MULTIPLE_SYMBOL_SPACES
2618 if (import_export
== -1)
2624 SET_CLASSTYPE_INTERFACE_KNOWN (ctype
);
2625 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype
) = (import_export
> 0);
2626 CLASSTYPE_INTERFACE_ONLY (ctype
) = (import_export
< 0);
2630 /* We need to describe to the assembler the relationship between
2631 a vtable and the vtable of the parent class. */
2634 output_vtable_inherit (vars
)
2640 op
[0] = XEXP (DECL_RTL (vars
), 0); /* strip the mem ref */
2642 parent
= binfo_for_vtable (vars
);
2644 if (parent
== TYPE_BINFO (DECL_CONTEXT (vars
)))
2648 parent
= TYPE_BINFO_VTABLE (BINFO_TYPE (parent
));
2649 op
[1] = XEXP (DECL_RTL (parent
), 0); /* strip the mem ref */
2652 my_friendly_abort (980826);
2654 output_asm_insn (".vtable_inherit %c0, %c1", op
);
2658 finish_vtable_vardecl (t
, data
)
2660 void *data ATTRIBUTE_UNUSED
;
2663 tree ctype
= DECL_CONTEXT (vars
);
2664 import_export_class (ctype
);
2665 import_export_vtable (vars
, ctype
, 1);
2667 if (! DECL_EXTERNAL (vars
)
2668 && (DECL_INTERFACE_KNOWN (vars
)
2669 || TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (vars
))
2670 || (hack_decl_function_context (vars
) && TREE_USED (vars
)))
2671 && ! TREE_ASM_WRITTEN (vars
))
2674 mark_vtable_entries (vars
);
2675 if (TREE_TYPE (DECL_INITIAL (vars
)) == 0)
2676 store_init_value (vars
, DECL_INITIAL (vars
));
2678 if (write_symbols
== DWARF_DEBUG
|| write_symbols
== DWARF2_DEBUG
)
2680 /* Mark the VAR_DECL node representing the vtable itself as a
2681 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2682 It is rather important that such things be ignored because
2683 any effort to actually generate DWARF for them will run
2684 into trouble when/if we encounter code like:
2687 struct S { virtual void member (); };
2689 because the artificial declaration of the vtable itself (as
2690 manufactured by the g++ front end) will say that the vtable
2691 is a static member of `S' but only *after* the debug output
2692 for the definition of `S' has already been output. This causes
2693 grief because the DWARF entry for the definition of the vtable
2694 will try to refer back to an earlier *declaration* of the
2695 vtable as a static member of `S' and there won't be one.
2696 We might be able to arrange to have the "vtable static member"
2697 attached to the member list for `S' before the debug info for
2698 `S' get written (which would solve the problem) but that would
2699 require more intrusive changes to the g++ front end. */
2701 DECL_IGNORED_P (vars
) = 1;
2704 /* Always make vtables weak. */
2706 comdat_linkage (vars
);
2708 rest_of_decl_compilation (vars
, NULL_PTR
, 1, 1);
2711 output_vtable_inherit (vars
);
2715 else if (! TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (vars
)))
2716 /* We don't know what to do with this one yet. */
2719 *t
= TREE_CHAIN (vars
);
2724 prune_vtable_vardecl (t
, data
)
2726 void *data ATTRIBUTE_UNUSED
;
2728 *t
= TREE_CHAIN (*t
);
2733 finish_sigtable_vardecl (t
, data
)
2735 void *data ATTRIBUTE_UNUSED
;
2737 /* We don't need to mark sigtable entries as addressable here as is done
2738 for vtables. Since sigtables, unlike vtables, are always written out,
2739 that was already done in build_signature_table_constructor. */
2741 rest_of_decl_compilation (*t
, NULL_PTR
, 1, 1);
2742 *t
= TREE_CHAIN (*t
);
2746 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2747 inline function or template instantiation at end-of-file. */
2750 import_export_decl (decl
)
2753 if (DECL_INTERFACE_KNOWN (decl
))
2756 if (DECL_TEMPLATE_INSTANTIATION (decl
)
2757 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2759 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2760 if ((DECL_IMPLICIT_INSTANTIATION (decl
)
2761 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2762 && (flag_implicit_templates
2763 || (flag_implicit_inline_templates
&& DECL_THIS_INLINE (decl
))))
2765 if (!TREE_PUBLIC (decl
))
2766 /* Templates are allowed to have internal linkage. See
2770 comdat_linkage (decl
);
2773 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2775 else if (DECL_FUNCTION_MEMBER_P (decl
))
2777 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2778 import_export_class (ctype
);
2779 if (CLASSTYPE_INTERFACE_KNOWN (ctype
)
2780 && (! DECL_ARTIFICIAL (decl
) || DECL_VINDEX (decl
)))
2782 DECL_NOT_REALLY_EXTERN (decl
)
2783 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2784 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2785 && !DECL_VINDEX (decl
)));
2787 /* Always make artificials weak. */
2788 if (DECL_ARTIFICIAL (decl
) && flag_weak
)
2789 comdat_linkage (decl
);
2791 maybe_make_one_only (decl
);
2794 comdat_linkage (decl
);
2796 else if (DECL_TINFO_FN_P (decl
))
2798 tree ctype
= TREE_TYPE (DECL_NAME (decl
));
2800 if (IS_AGGR_TYPE (ctype
))
2801 import_export_class (ctype
);
2803 if (IS_AGGR_TYPE (ctype
) && CLASSTYPE_INTERFACE_KNOWN (ctype
)
2804 && TYPE_VIRTUAL_P (ctype
)
2805 /* If the type is a cv-qualified variant of a type, then we
2806 must emit the tinfo function in this translation unit
2807 since it will not be emitted when the vtable for the type
2808 is output (which is when the unqualified version is
2810 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2812 DECL_NOT_REALLY_EXTERN (decl
)
2813 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2814 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2815 && !DECL_VINDEX (decl
)));
2817 /* Always make artificials weak. */
2819 comdat_linkage (decl
);
2821 else if (TYPE_BUILT_IN (ctype
)
2822 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2823 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2825 comdat_linkage (decl
);
2828 comdat_linkage (decl
);
2830 DECL_INTERFACE_KNOWN (decl
) = 1;
2834 build_cleanup (decl
)
2838 tree type
= TREE_TYPE (decl
);
2840 if (TREE_CODE (type
) == ARRAY_TYPE
)
2844 mark_addressable (decl
);
2845 temp
= build1 (ADDR_EXPR
, build_pointer_type (type
), decl
);
2847 temp
= build_delete (TREE_TYPE (temp
), temp
,
2849 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
2853 extern int parse_time
, varconst_time
;
2859 tree sname
= get_id_2 ("__sn", base
);
2860 /* For struct X foo __attribute__((weak)), there is a counter
2861 __snfoo. Since base is already an assembler name, sname should
2862 be globally unique */
2863 tree sentry
= IDENTIFIER_GLOBAL_VALUE (sname
);
2866 push_obstacks_nochange ();
2867 end_temporary_allocation ();
2868 sentry
= build_decl (VAR_DECL
, sname
, integer_type_node
);
2869 TREE_PUBLIC (sentry
) = 1;
2870 DECL_ARTIFICIAL (sentry
) = 1;
2871 TREE_STATIC (sentry
) = 1;
2872 TREE_USED (sentry
) = 1;
2873 DECL_COMMON (sentry
) = 1;
2874 pushdecl_top_level (sentry
);
2875 cp_finish_decl (sentry
, NULL_TREE
, NULL_TREE
, 0, 0);
2881 /* Start the process of running a particular set of global constructors
2882 or destructors. Subroutine of do_[cd]tors. */
2885 start_objects (method_type
, initp
)
2886 int method_type
, initp
;
2891 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2893 if (initp
!= DEFAULT_INIT_PRIORITY
)
2903 sprintf (type
, "%c%c%.5u", method_type
, joiner
, initp
);
2906 sprintf (type
, "%c", method_type
);
2908 fnname
= get_file_function_name_long (type
);
2910 start_function (void_list_node
,
2911 make_call_declarator (fnname
, void_list_node
, NULL_TREE
,
2915 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2916 /* It can be a static function as long as collect2 does not have
2917 to scan the object file to find its ctor/dtor routine. */
2918 TREE_PUBLIC (current_function_decl
) = 0;
2921 store_parm_decls ();
2925 expand_start_bindings (0);
2927 /* We cannot allow these functions to be elided, even if they do not
2928 have external linkage. And, there's no point in deferring
2929 copmilation of thes functions; they're all going to have to be
2931 current_function_cannot_inline
2932 = "static constructors and destructors cannot be inlined";
2935 /* Finish the process of running a particular set of global constructors
2936 or destructors. Subroutine of do_[cd]tors. */
2939 finish_objects (method_type
, initp
)
2940 int method_type
, initp
;
2942 char *fnname
= XSTR (XEXP (DECL_RTL (current_function_decl
), 0), 0);
2945 expand_end_bindings (getdecls (), 1, 0);
2948 finish_function (lineno
, 0, 0);
2950 if (initp
== DEFAULT_INIT_PRIORITY
)
2952 if (method_type
== 'I')
2953 assemble_constructor (fnname
);
2955 assemble_destructor (fnname
);
2958 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2959 /* If we're using init priority we can't use assemble_*tor, but on ELF
2960 targets we can stick the references into named sections for GNU ld
2965 sprintf (buf
, ".%ctors.%.5u", method_type
== 'I' ? 'c' : 'd',
2966 /* invert the numbering so the linker puts us in the proper
2967 order; constructors are run from right to left, and the
2968 linker sorts in increasing order. */
2969 MAX_INIT_PRIORITY
- initp
);
2970 named_section (NULL_TREE
, buf
, 0);
2971 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, fnname
),
2972 POINTER_SIZE
/ BITS_PER_UNIT
, 1);
2977 /* The names of the parameters to the function created to handle
2978 initializations and destructions for objects with static storage
2980 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2981 #define PRIORITY_IDENTIFIER "__priority"
2983 /* The name of the function we create to handle initializations and
2984 destructions for objects with static storage duration. */
2985 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2987 /* The declaration for the __INITIALIZE_P argument. */
2988 static tree initialize_p_decl
;
2990 /* The declaration for the __PRIORITY argument. */
2991 static tree priority_decl
;
2993 /* The declaration for the static storage duration function. */
2994 static tree ssdf_decl
;
2996 /* All the static storage duration functions created in this
2997 translation unit. */
2998 static varray_type ssdf_decls
;
2999 static size_t ssdf_decls_used
;
3001 /* A map from priority levels to information about that priority
3002 level. There may be many such levels, so efficient lookup is
3004 static splay_tree priority_info_map
;
3006 /* Begins the generation of the function that will handle all
3007 initialization and destruction of objects with static storage
3008 duration. The function generated takes two parameters of type
3009 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
3010 non-zero, it performs initializations. Otherwise, it performs
3011 destructions. It only performs those initializations or
3012 destructions with the indicated __PRIORITY. The generated function
3015 It is assumed that this function will only be called once per
3016 translation unit. */
3019 start_static_storage_duration_function ()
3021 static unsigned ssdf_number
;
3025 char id
[sizeof (SSDF_IDENTIFIER
) + 1 /* '\0' */ + 32];
3027 /* Create the identifier for this function. It will be of the form
3028 SSDF_IDENTIFIER_<number>. */
3029 sprintf (id
, "%s_%u", SSDF_IDENTIFIER
, ssdf_number
++);
3030 if (ssdf_number
== 0)
3032 /* Overflow occurred. That means there are at least 4 billion
3033 initialization functions. */
3034 sorry ("too many initialization functions required");
3035 my_friendly_abort (19990430);
3038 /* Create the parameters. */
3039 parm_types
= void_list_node
;
3040 parm_types
= perm_tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
3041 parm_types
= perm_tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
3042 type
= build_function_type (void_type_node
, parm_types
);
3044 /* Create the FUNCTION_DECL itself. */
3045 ssdf_decl
= build_lang_decl (FUNCTION_DECL
,
3046 get_identifier (id
),
3048 TREE_PUBLIC (ssdf_decl
) = 0;
3049 DECL_ARTIFICIAL (ssdf_decl
) = 1;
3051 /* Put this function in the list of functions to be called from the
3052 static constructors and destructors. */
3055 VARRAY_TREE_INIT (ssdf_decls
, 32, "ssdf_decls");
3057 /* Take this opportunity to initialize the map from priority
3058 numbers to information about that priority level. */
3059 priority_info_map
= splay_tree_new (splay_tree_compare_ints
,
3060 /*delete_key_fn=*/0,
3061 /*delete_value_fn=*/
3062 (splay_tree_delete_value_fn
) &free
);
3064 /* We always need to generate functions for the
3065 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
3066 priorities later, we'll be sure to find the
3067 DEFAULT_INIT_PRIORITY. */
3068 get_priority_info (DEFAULT_INIT_PRIORITY
);
3071 if (ssdf_decls_used
== ssdf_decls
->num_elements
)
3072 VARRAY_GROW (ssdf_decls
, 2 * ssdf_decls_used
);
3073 VARRAY_TREE (ssdf_decls
, ssdf_decls_used
) = ssdf_decl
;
3076 /* Create the argument list. */
3077 initialize_p_decl
= build_decl (PARM_DECL
,
3078 get_identifier (INITIALIZE_P_IDENTIFIER
),
3080 DECL_CONTEXT (initialize_p_decl
) = ssdf_decl
;
3081 DECL_ARG_TYPE (initialize_p_decl
) = integer_type_node
;
3082 TREE_USED (initialize_p_decl
) = 1;
3083 priority_decl
= build_decl (PARM_DECL
, get_identifier (PRIORITY_IDENTIFIER
),
3085 DECL_CONTEXT (priority_decl
) = ssdf_decl
;
3086 DECL_ARG_TYPE (priority_decl
) = integer_type_node
;
3087 TREE_USED (priority_decl
) = 1;
3089 TREE_CHAIN (initialize_p_decl
) = priority_decl
;
3090 DECL_ARGUMENTS (ssdf_decl
) = initialize_p_decl
;
3092 /* Start the function itself. This is equivalent to declarating the
3095 static void __ssdf (int __initialize_p, init __priority_p);
3097 It is static because we only need to call this function from the
3098 various constructor and destructor functions for this module. */
3099 start_function (/*specs=*/NULL_TREE
,
3101 /*attrs=*/NULL_TREE
,
3102 /*pre_parsed_p=*/1);
3104 /* Set up the scope of the outermost block in the function. */
3105 store_parm_decls ();
3109 expand_start_bindings (0);
3111 /* This function must not be deferred because we are depending on
3112 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3113 current_function_cannot_inline
3114 = "static storage duration functions cannot be inlined";
3117 /* Generate the initialization code for the priority indicated in N. */
3120 generate_inits_for_priority (n
, data
)
3122 void *data ATTRIBUTE_UNUSED
;
3124 int priority
= (int) n
->key
;
3125 priority_info pi
= (priority_info
) n
->value
;
3127 /* For each priority N which has been used generate code which looks
3130 if (__priority == N) {
3137 We use the sequences we've accumulated to fill in the `...'s. */
3138 expand_start_cond (build_binary_op (EQ_EXPR
,
3140 build_int_2 (priority
, 0)),
3143 /* Do the initializations. */
3144 expand_start_cond (build_binary_op (NE_EXPR
,
3148 if (pi
->initialization_sequence
)
3152 push_to_sequence (pi
->initialization_sequence
);
3153 insns
= gen_sequence ();
3157 pi
->initialization_sequence
= NULL_RTX
;
3158 pi
->initializations_p
= 1;
3161 /* Do the destructions. */
3162 expand_start_else ();
3163 if (pi
->destruction_sequence
)
3167 push_to_sequence (pi
->destruction_sequence
);
3168 insns
= gen_sequence ();
3172 pi
->destruction_sequence
= NULL_RTX
;
3173 pi
->destructions_p
= 1;
3176 /* Close out the conditionals. */
3180 /* Don't stop iterating. */
3184 /* Finish the generation of the function which performs initialization
3185 and destruction of objects with static storage duration. After
3186 this point, no more such objects can be created. */
3189 finish_static_storage_duration_function ()
3191 splay_tree_foreach (priority_info_map
,
3192 generate_inits_for_priority
,
3195 /* Close out the function. */
3196 expand_end_bindings (getdecls (), 1, 0);
3199 finish_function (lineno
, 0, 0);
3202 /* Return the information about the indicated PRIORITY level. If no
3203 code to handle this level has yet been generated, generate the
3204 appropriate prologue. */
3206 static priority_info
3207 get_priority_info (priority
)
3213 n
= splay_tree_lookup (priority_info_map
,
3214 (splay_tree_key
) priority
);
3217 /* Create a new priority information structure, and insert it
3219 pi
= (priority_info
) xmalloc (sizeof (struct priority_info_s
));
3220 pi
->initialization_sequence
= NULL_RTX
;
3221 pi
->destruction_sequence
= NULL_RTX
;
3222 pi
->initializations_p
= 0;
3223 pi
->destructions_p
= 0;
3224 splay_tree_insert (priority_info_map
,
3225 (splay_tree_key
) priority
,
3226 (splay_tree_value
) pi
);
3229 pi
= (priority_info
) n
->value
;
3234 /* Generate code to do the static initialization of DECL. The
3235 initialization is INIT. If DECL may be initialized more than once
3236 in different object files, SENTRY is the guard variable to
3237 check. PRIORITY is the priority for the initialization. */
3240 do_static_initialization (decl
, init
, sentry
, priority
)
3248 /* Get the priority information for this PRIORITY, */
3249 pi
= get_priority_info (priority
);
3250 if (!pi
->initialization_sequence
)
3253 push_to_sequence (pi
->initialization_sequence
);
3255 /* Tell the debugger that we are at the location of the static
3256 variable in question. */
3257 emit_note (input_filename
, lineno
);
3259 /* If there's a SENTRY, we only do the initialization if it is
3260 zero, i.e., if we are the first to initialize it. */
3262 expand_start_cond (build_binary_op (EQ_EXPR
,
3263 build_unary_op (PREINCREMENT_EXPR
,
3269 /* Prepare a binding level for temporaries created during the
3271 expand_start_target_temps ();
3273 if (IS_AGGR_TYPE (TREE_TYPE (decl
))
3274 || TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
3275 expand_aggr_init (decl
, init
, 0);
3276 else if (TREE_CODE (init
) == TREE_VEC
)
3277 expand_expr (expand_vec_init (decl
, TREE_VEC_ELT (init
, 0),
3278 TREE_VEC_ELT (init
, 1),
3279 TREE_VEC_ELT (init
, 2), 0),
3280 const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3282 expand_assignment (decl
, init
, 0, 0);
3284 /* The expression might have involved increments and decrements. */
3287 /* Cleanup any temporaries needed for the initial value. */
3288 expand_end_target_temps ();
3290 /* Cleanup any deferred pops from function calls. This would be done
3291 by expand_end_cond, but we also need it when !SENTRY, since we are
3292 constructing these sequences by parts. */
3293 do_pending_stack_adjust ();
3295 /* Close the conditional opened above. */
3299 /* Save the sequence for later use. */
3300 pi
->initialization_sequence
= get_insns ();
3304 /* Generate code to do the static destruction of DECL. If DECL may be
3305 initialized more than once in different object files, SENTRY is the
3306 guard variable to check. PRIORITY is the priority for the
3310 do_static_destruction (decl
, sentry
, priority
)
3318 /* If we don't need a destructor, there's nothing to do. */
3319 if (!TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
3322 /* Get the priority information for this PRIORITY, */
3323 pi
= get_priority_info (priority
);
3324 if (!pi
->destruction_sequence
)
3327 push_to_sequence (pi
->destruction_sequence
);
3329 /* Start a new sequence to handle just this destruction. */
3332 /* Tell the debugger that we are at the location of the static
3333 variable in question. */
3334 emit_note (input_filename
, lineno
);
3336 /* If there's a SENTRY, we only do the destruction if it is one,
3337 i.e., if we are the last to destroy it. */
3339 expand_start_cond (build_binary_op (EQ_EXPR
,
3340 build_unary_op (PREDECREMENT_EXPR
,
3346 /* Actually to the destruction. */
3347 expand_expr_stmt (build_cleanup (decl
));
3349 /* Cleanup any deferred pops from function calls. This would be done
3350 by expand_end_cond, but we also need it when !SENTRY, since we are
3351 constructing these sequences by parts. */
3352 do_pending_stack_adjust ();
3354 /* Close the conditional opened above. */
3358 /* Insert the NEW_INSNS before the current insns. (Destructions are
3359 run in reverse order of initializations.) */
3360 new_insns
= gen_sequence ();
3362 if (pi
->destruction_sequence
)
3363 emit_insn_before (new_insns
, pi
->destruction_sequence
);
3365 emit_insn (new_insns
);
3367 /* Save the sequence for later use. */
3368 pi
->destruction_sequence
= get_insns ();
3372 /* Add code to the static storage duration function that will handle
3373 DECL (a static variable that needs initializing and/or destruction)
3374 with the indicated PRIORITY. If DECL needs initializing, INIT is
3378 do_static_initialization_and_destruction (decl
, init
)
3382 tree sentry
= NULL_TREE
;
3385 /* Deal gracefully with error. */
3386 if (decl
== error_mark_node
)
3389 /* The only things that can be initialized are variables. */
3390 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 19990420);
3392 /* If this object is not defined, we don't need to do anything
3394 if (DECL_EXTERNAL (decl
))
3397 /* Also, if the initializer already contains errors, we can bail out
3399 if (init
&& TREE_CODE (init
) == TREE_LIST
3400 && value_member (error_mark_node
, init
))
3403 /* Trick the compiler into thinking we are at the file and line
3404 where DECL was declared so that error-messages make sense, and so
3405 that the debugger will show somewhat sensible file and line
3407 input_filename
= DECL_SOURCE_FILE (decl
);
3408 lineno
= DECL_SOURCE_LINE (decl
);
3414 Access control for implicit calls to the constructors,
3415 the conversion functions, or the destructor called to
3416 create and destroy a static data member is performed as
3417 if these calls appeared in the scope of the member's
3420 we pretend we are in a static member function of the class of
3421 which the DECL is a member. */
3422 if (member_p (decl
))
3424 DECL_CLASS_CONTEXT (current_function_decl
) = DECL_CONTEXT (decl
);
3425 DECL_STATIC_FUNCTION_P (current_function_decl
) = 1;
3428 /* We need a sentry if this is an object with external linkage that
3429 might be initialized in more than one place. */
3430 if (TREE_PUBLIC (decl
) && (DECL_COMMON (decl
)
3431 || DECL_ONE_ONLY (decl
)
3432 || DECL_WEAK (decl
)))
3433 sentry
= get_sentry (DECL_ASSEMBLER_NAME (decl
));
3435 /* Generate the code to actually do the intialization and
3437 priority
= DECL_INIT_PRIORITY (decl
);
3439 priority
= DEFAULT_INIT_PRIORITY
;
3440 do_static_initialization (decl
, init
, sentry
, priority
);
3441 do_static_destruction (decl
, sentry
, priority
);
3443 /* Now that we're done with DECL we don't need to pretend to be a
3444 member of its class any longer. */
3445 DECL_CLASS_CONTEXT (current_function_decl
) = NULL_TREE
;
3446 DECL_STATIC_FUNCTION_P (current_function_decl
) = 0;
3449 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3450 (otherwise) that will initialize all gobal objects with static
3451 storage duration having the indicated PRIORITY. */
3454 generate_ctor_or_dtor_function (constructor_p
, priority
)
3462 /* We use `I' to indicate initialization and `D' to indicate
3469 /* Begin the function. */
3470 start_objects (function_key
, priority
);
3472 /* Call the static storage duration function with appropriate
3474 for (i
= 0; i
< ssdf_decls_used
; ++i
)
3476 arguments
= tree_cons (NULL_TREE
, build_int_2 (priority
, 0),
3478 arguments
= tree_cons (NULL_TREE
, build_int_2 (constructor_p
, 0),
3480 expand_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls
, i
),
3484 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3485 calls to any functions marked with attributes indicating that
3486 they should be called at initialization- or destruction-time. */
3487 if (priority
== DEFAULT_INIT_PRIORITY
)
3491 for (fns
= constructor_p
? static_ctors
: static_dtors
;
3493 fns
= TREE_CHAIN (fns
))
3494 expand_expr_stmt (build_function_call (TREE_VALUE (fns
), NULL_TREE
));
3497 /* Close out the function. */
3498 finish_objects (function_key
, priority
);
3501 /* Generate constructor and destructor functions for the priority
3505 generate_ctor_and_dtor_functions_for_priority (n
, data
)
3507 void *data ATTRIBUTE_UNUSED
;
3509 int priority
= (int) n
->key
;
3510 priority_info pi
= (priority_info
) n
->value
;
3512 /* Generate the functions themselves, but only if they are really
3514 if (pi
->initializations_p
3515 || (priority
== DEFAULT_INIT_PRIORITY
&& static_ctors
))
3516 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3518 if (pi
->destructions_p
3519 || (priority
== DEFAULT_INIT_PRIORITY
&& static_dtors
))
3520 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3523 /* Keep iterating. */
3527 /* This routine is called from the last rule in yyparse ().
3528 Its job is to create all the code needed to initialize and
3529 destroy the global aggregates. We do the destruction
3530 first, since that way we only need to reverse the decls once. */
3536 int start_time
, this_time
;
3543 /* Bad parse errors. Just forget about it. */
3544 if (! global_bindings_p () || current_class_type
|| decl_namespace_list
)
3547 start_time
= get_run_time ();
3549 /* Otherwise, GDB can get confused, because in only knows
3550 about source for LINENO-1 lines. */
3553 interface_unknown
= 1;
3556 /* We now have to write out all the stuff we put off writing out.
3559 o Template specializations that we have not yet instantiated,
3560 but which are needed.
3561 o Initialization and destruction for non-local objects with
3562 static storage duration. (Local objects with static storage
3563 duration are initialized when their scope is first entered,
3564 and are cleaned up via atexit.)
3565 o Virtual function tables.
3567 All of these may cause others to be needed. For example,
3568 instantiating one function may cause another to be needed, and
3569 generating the intiailzer for an object may cause templates to be
3570 instantiated, etc., etc. */
3572 this_time
= get_run_time ();
3573 parse_time
-= this_time
- start_time
;
3574 varconst_time
+= this_time
- start_time
;
3575 start_time
= get_run_time ();
3576 permanent_allocation (1);
3580 /* Non-zero if we need a static storage duration function on
3581 this iteration through the loop. */
3582 int need_ssdf_p
= 0;
3586 /* If there are templates that we've put off instantiating, do
3588 instantiate_pending_templates ();
3590 /* Write out signature-tables and virtual tables as required.
3591 Note that writing out the virtual table for a template class
3592 may cause the instantiation of members of that class. */
3593 if (flag_handle_signatures
3594 && walk_globals (sigtable_decl_p
,
3595 finish_sigtable_vardecl
,
3598 if (walk_globals (vtable_decl_p
,
3599 finish_vtable_vardecl
,
3603 /* The list of objects with static storage duration is built up
3604 in reverse order, so we reverse it here. We also clear
3605 STATIC_AGGREGATES so that any new aggregates added during the
3606 initialization of these will be initialized in the correct
3607 order when we next come around the loop. */
3608 vars
= nreverse (static_aggregates
);
3609 static_aggregates
= NULL_TREE
;
3612 if (! TREE_ASM_WRITTEN (TREE_VALUE (vars
)))
3613 rest_of_decl_compilation (TREE_VALUE (vars
), 0, 1, 1);
3616 /* We need to start a new initialization function each
3617 time through the loop. That's because we need to
3618 know which vtables have been referenced, and
3619 TREE_SYMBOL_REFERENCED isn't computed until a
3620 function is finished, and written out. That's a
3621 deficiency in the back-end. When this is fixed,
3622 these initialization functions could all become
3623 inline, with resulting performance improvements. */
3624 start_static_storage_duration_function ();
3628 do_static_initialization_and_destruction (TREE_VALUE (vars
),
3629 TREE_PURPOSE (vars
));
3631 vars
= TREE_CHAIN (vars
);
3634 /* Finish up the static storage duration function for this
3637 finish_static_storage_duration_function ();
3639 /* Go through the various inline functions, and see if any need
3641 for (i
= 0; i
< saved_inlines_used
; ++i
)
3643 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3644 import_export_decl (decl
);
3645 if (DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
3647 && (! DECL_REALLY_EXTERN (decl
) || DECL_INLINE (decl
)))
3649 /* Even though we're already at the top-level, we push
3650 there again. That way, when we pop back a few lines
3651 hence, all of our state is restored. Otherwise,
3652 finish_function doesn't clean things up, and we end
3653 up with CURRENT_FUNCTION_DECL set. */
3654 push_to_top_level ();
3655 if (DECL_TINFO_FN_P (decl
))
3656 synthesize_tinfo_fn (decl
);
3658 synthesize_method (decl
);
3659 pop_from_top_level ();
3664 /* Mark all functions that might deal with exception-handling as
3666 mark_all_runtime_matches ();
3668 /* We lie to the back-end, pretending that some functions are
3669 not defined when they really are. This keeps these functions
3670 from being put out unncessarily. But, we must stop lying
3671 when the functions are referenced, or if they are not comdat
3672 since they need to be put out now. */
3673 for (i
= 0; i
< saved_inlines_used
; ++i
)
3675 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3677 if (DECL_NOT_REALLY_EXTERN (decl
)
3678 && DECL_INITIAL (decl
)
3679 && (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl
))
3680 || !DECL_COMDAT (decl
)))
3681 DECL_EXTERNAL (decl
) = 0;
3684 if (saved_inlines_used
3685 && wrapup_global_declarations (&VARRAY_TREE (saved_inlines
, 0),
3686 saved_inlines_used
))
3688 if (walk_namespaces (wrapup_globals_for_namespace
, /*data=*/0))
3691 /* Static data members are just like namespace-scope globals. */
3692 for (i
= 0; i
< pending_statics_used
; ++i
)
3694 tree decl
= VARRAY_TREE (pending_statics
, i
);
3695 if (TREE_ASM_WRITTEN (decl
))
3697 import_export_decl (decl
);
3698 if (DECL_NOT_REALLY_EXTERN (decl
) && ! DECL_IN_AGGR_P (decl
))
3699 DECL_EXTERNAL (decl
) = 0;
3702 && wrapup_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3703 pending_statics_used
))
3708 /* We give C linkage to static constructors and destructors. */
3709 push_lang_context (lang_name_c
);
3711 /* Generate initialization and destruction functions for all
3712 priorities for which they are required. */
3713 if (priority_info_map
)
3714 splay_tree_foreach (priority_info_map
,
3715 generate_ctor_and_dtor_functions_for_priority
,
3718 /* We're done with the splay-tree now. */
3719 if (priority_info_map
)
3720 splay_tree_delete (priority_info_map
);
3722 /* We're done with static constructors, so we can go back to "C++"
3724 pop_lang_context ();
3726 /* Now delete from the chain of variables all virtual function tables.
3727 We output them all ourselves, because each will be treated
3729 walk_globals (vtable_decl_p
, prune_vtable_vardecl
, /*data=*/0);
3731 /* Now, issue warnings about static, but not defined, functions,
3733 walk_namespaces (wrapup_globals_for_namespace
, /*data=*/&reconsider
);
3737 /* The entire file is now complete. If requested, dump everything
3739 if (flag_dump_translation_unit
)
3740 dump_node_to_file (global_namespace
, flag_dump_translation_unit
);
3742 this_time
= get_run_time ();
3743 parse_time
-= this_time
- start_time
;
3744 varconst_time
+= this_time
- start_time
;
3746 if (flag_detailed_statistics
)
3748 dump_tree_statistics ();
3749 dump_time_statistics ();
3753 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3754 expr. Since it was parsed like a type, we need to wade through and fix
3755 that. Unfortunately, since operator() is left-associative, we can't use
3756 tail recursion. In the above example, TYPE is `A', and DECL is
3759 Maybe this shouldn't be recursive, but how often will it actually be
3763 reparse_absdcl_as_expr (type
, decl
)
3766 /* do build_functional_cast (type, NULL_TREE) at bottom */
3767 if (TREE_OPERAND (decl
, 0) == NULL_TREE
)
3768 return build_functional_cast (type
, NULL_TREE
);
3771 decl
= reparse_absdcl_as_expr (type
, TREE_OPERAND (decl
, 0));
3773 decl
= build_x_function_call (decl
, NULL_TREE
, current_class_ref
);
3775 if (TREE_CODE (decl
) == CALL_EXPR
3776 && (! TREE_TYPE (decl
)
3777 || TREE_CODE (TREE_TYPE (decl
)) != VOID_TYPE
))
3778 decl
= require_complete_type (decl
);
3783 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3784 out to be an expr. Since it was parsed like a type, we need to wade
3785 through and fix that. Since casts are right-associative, we are
3786 reversing the order, so we don't have to recurse.
3788 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3792 reparse_absdcl_as_casts (decl
, expr
)
3797 if (TREE_CODE (expr
) == CONSTRUCTOR
3798 && TREE_TYPE (expr
) == 0)
3800 type
= groktypename (TREE_VALUE (TREE_OPERAND (decl
, 1)));
3801 decl
= TREE_OPERAND (decl
, 0);
3803 if (IS_SIGNATURE (type
))
3805 error ("cast specifies signature type");
3806 return error_mark_node
;
3809 expr
= digest_init (type
, expr
, (tree
*) 0);
3810 if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_SIZE (type
) == 0)
3812 int failure
= complete_array_type (type
, expr
, 1);
3814 my_friendly_abort (78);
3820 type
= groktypename (TREE_VALUE (TREE_OPERAND (decl
, 1)));
3821 decl
= TREE_OPERAND (decl
, 0);
3822 expr
= build_c_cast (type
, expr
);
3825 if (warn_old_style_cast
&& ! in_system_header
3826 && current_lang_name
!= lang_name_c
)
3827 warning ("use of old-style cast");
3832 /* Given plain tree nodes for an expression, build up the full semantics. */
3835 build_expr_from_tree (t
)
3838 if (t
== NULL_TREE
|| t
== error_mark_node
)
3841 switch (TREE_CODE (t
))
3843 case IDENTIFIER_NODE
:
3844 return do_identifier (t
, 0, NULL_TREE
);
3847 if (LOOKUP_EXPR_GLOBAL (t
))
3848 return do_scoped_id (TREE_OPERAND (t
, 0), 0);
3850 return do_identifier (TREE_OPERAND (t
, 0), 0, NULL_TREE
);
3852 case TEMPLATE_ID_EXPR
:
3853 return (lookup_template_function
3854 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3855 build_expr_from_tree (TREE_OPERAND (t
, 1))));
3858 return build_x_indirect_ref
3859 (build_expr_from_tree (TREE_OPERAND (t
, 0)), "unary *");
3862 return build_functional_cast
3863 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3865 case REINTERPRET_CAST_EXPR
:
3866 return build_reinterpret_cast
3867 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3869 case CONST_CAST_EXPR
:
3870 return build_const_cast
3871 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3873 case DYNAMIC_CAST_EXPR
:
3874 return build_dynamic_cast
3875 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3877 case STATIC_CAST_EXPR
:
3878 return build_static_cast
3879 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3881 case PREDECREMENT_EXPR
:
3882 case PREINCREMENT_EXPR
:
3883 case POSTDECREMENT_EXPR
:
3884 case POSTINCREMENT_EXPR
:
3888 case TRUTH_NOT_EXPR
:
3890 case CONVERT_EXPR
: /* Unary + */
3893 return build_x_unary_op (TREE_CODE (t
),
3894 build_expr_from_tree (TREE_OPERAND (t
, 0)));
3899 case TRUNC_DIV_EXPR
:
3901 case FLOOR_DIV_EXPR
:
3902 case ROUND_DIV_EXPR
:
3903 case EXACT_DIV_EXPR
:
3905 case BIT_ANDTC_EXPR
:
3908 case TRUNC_MOD_EXPR
:
3909 case FLOOR_MOD_EXPR
:
3910 case TRUTH_ANDIF_EXPR
:
3911 case TRUTH_ORIF_EXPR
:
3912 case TRUTH_AND_EXPR
:
3927 return build_x_binary_op
3929 build_expr_from_tree (TREE_OPERAND (t
, 0)),
3930 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3933 return build_m_component_ref
3934 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3935 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3938 return build_offset_ref (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
3941 if (TREE_OPERAND (t
, 0) == NULL_TREE
)
3943 return build_parse_node (ARRAY_REF
, NULL_TREE
,
3944 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3945 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3946 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3951 tree r
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3952 if (TREE_CODE_CLASS (TREE_CODE (r
)) != 't')
3954 return TREE_CODE (t
) == SIZEOF_EXPR
? c_sizeof (r
) : c_alignof (r
);
3958 return build_x_modify_expr
3959 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3960 TREE_CODE (TREE_OPERAND (t
, 1)),
3961 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3964 return build_x_arrow
3965 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3969 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3970 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3971 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3972 NEW_EXPR_USE_GLOBAL (t
));
3975 return delete_sanity
3976 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3977 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3978 DELETE_EXPR_USE_VEC (t
), DELETE_EXPR_USE_GLOBAL (t
));
3981 if (TREE_OPERAND (t
, 1) == NULL_TREE
)
3982 return build_x_compound_expr
3983 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3985 my_friendly_abort (42);
3987 case METHOD_CALL_EXPR
:
3988 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3990 tree ref
= TREE_OPERAND (t
, 0);
3991 return build_scoped_method_call
3992 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3993 build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3994 TREE_OPERAND (ref
, 1),
3995 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3999 tree fn
= TREE_OPERAND (t
, 0);
4001 /* We can get a TEMPLATE_ID_EXPR here on code like:
4005 so we must resolve that. However, we can also get things
4006 like a BIT_NOT_EXPR here, when referring to a destructor,
4007 and things like that are not correctly resolved by
4008 build_expr_from_tree. So, just use build_expr_from_tree
4009 when we really need it. */
4010 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
4011 fn
= lookup_template_function
4012 (TREE_OPERAND (fn
, 0),
4013 build_expr_from_tree (TREE_OPERAND (fn
, 1)));
4015 return build_method_call
4016 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
4018 build_expr_from_tree (TREE_OPERAND (t
, 2)),
4019 NULL_TREE
, LOOKUP_NORMAL
);
4023 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
4025 tree ref
= TREE_OPERAND (t
, 0);
4026 return build_member_call
4027 (build_expr_from_tree (TREE_OPERAND (ref
, 0)),
4028 TREE_OPERAND (ref
, 1),
4029 build_expr_from_tree (TREE_OPERAND (t
, 1)));
4033 tree name
= TREE_OPERAND (t
, 0);
4035 tree args
= build_expr_from_tree (TREE_OPERAND (t
, 1));
4036 if (args
!= NULL_TREE
&& TREE_CODE (name
) == LOOKUP_EXPR
4037 && !LOOKUP_EXPR_GLOBAL (name
)
4038 && TREE_CODE ((id
= TREE_OPERAND (name
, 0))) == IDENTIFIER_NODE
4039 && (!current_class_type
4040 || !lookup_member (current_class_type
, id
, 0, 0)))
4042 /* Do Koenig lookup if there are no class members. */
4043 name
= do_identifier (id
, 0, args
);
4045 else if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
4046 || ! really_overloaded_fn (name
))
4047 name
= build_expr_from_tree (name
);
4048 return build_x_function_call (name
, args
, current_class_ref
);
4052 return build_x_conditional_expr
4053 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4054 build_expr_from_tree (TREE_OPERAND (t
, 1)),
4055 build_expr_from_tree (TREE_OPERAND (t
, 2)));
4059 tree purpose
, value
, chain
;
4061 if (t
== void_list_node
)
4064 purpose
= TREE_PURPOSE (t
);
4066 purpose
= build_expr_from_tree (purpose
);
4067 value
= TREE_VALUE (t
);
4069 value
= build_expr_from_tree (value
);
4070 chain
= TREE_CHAIN (t
);
4071 if (chain
&& chain
!= void_type_node
)
4072 chain
= build_expr_from_tree (chain
);
4073 return expr_tree_cons (purpose
, value
, chain
);
4078 tree object
= build_expr_from_tree (TREE_OPERAND (t
, 0));
4079 tree field
= TREE_OPERAND (t
, 1);
4081 /* We use a COMPONENT_REF to indicate things of the form `x.b'
4082 and `x.A::b'. We must distinguish between those cases
4084 if (TREE_CODE (field
) == SCOPE_REF
)
4085 return build_object_ref (object
,
4086 TREE_OPERAND (field
, 0),
4087 TREE_OPERAND (field
, 1));
4089 return build_x_component_ref (object
, field
,
4094 return build_throw (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4100 /* digest_init will do the wrong thing if we let it. */
4101 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
4104 r
= build_nt (CONSTRUCTOR
, NULL_TREE
,
4105 build_expr_from_tree (CONSTRUCTOR_ELTS (t
)));
4106 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
4109 return digest_init (TREE_TYPE (t
), r
, 0);
4114 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t
, 0))) == 't')
4115 return get_typeid (TREE_OPERAND (t
, 0));
4116 return build_x_typeid (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4119 return convert_from_reference (t
);
4126 /* This is something of the form `int (*a)++' that has turned out to be an
4127 expr. It was only converted into parse nodes, so we need to go through
4128 and build up the semantics. Most of the work is done by
4129 build_expr_from_tree, above.
4131 In the above example, TYPE is `int' and DECL is `*a'. */
4134 reparse_decl_as_expr (type
, decl
)
4137 decl
= build_expr_from_tree (decl
);
4139 return build_functional_cast (type
, build_expr_list (NULL_TREE
, decl
));
4144 /* This is something of the form `int (*a)' that has turned out to be a
4145 decl. It was only converted into parse nodes, so we need to do the
4146 checking that make_{pointer,reference}_declarator do. */
4149 finish_decl_parsing (decl
)
4152 extern int current_class_depth
;
4154 switch (TREE_CODE (decl
))
4156 case IDENTIFIER_NODE
:
4159 return make_pointer_declarator
4160 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4162 return make_reference_declarator
4163 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4165 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4168 push_nested_class (TREE_TYPE (TREE_OPERAND (decl
, 0)), 3);
4169 TREE_COMPLEXITY (decl
) = current_class_depth
;
4172 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4175 /* For attribute handling. */
4176 TREE_VALUE (decl
) = finish_decl_parsing (TREE_VALUE (decl
));
4179 my_friendly_abort (5);
4185 check_cp_case_value (value
)
4188 if (value
== NULL_TREE
)
4191 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4192 STRIP_TYPE_NOPS (value
);
4194 if (TREE_READONLY_DECL_P (value
))
4196 value
= decl_constant_value (value
);
4197 STRIP_TYPE_NOPS (value
);
4199 value
= fold (value
);
4201 if (TREE_CODE (value
) != INTEGER_CST
4202 && value
!= error_mark_node
)
4204 cp_error ("case label `%E' does not reduce to an integer constant",
4206 value
= error_mark_node
;
4209 /* Promote char or short to int. */
4210 value
= default_conversion (value
);
4212 constant_expression_warning (value
);
4217 /* Return 1 if root encloses child. */
4220 is_namespace_ancestor (root
, child
)
4225 if (root
== global_namespace
)
4227 if (child
== global_namespace
)
4229 return is_namespace_ancestor (root
, CP_DECL_CONTEXT (child
));
4233 /* Return the namespace that is the common ancestor
4234 of two given namespaces. */
4237 namespace_ancestor (ns1
, ns2
)
4240 if (is_namespace_ancestor (ns1
, ns2
))
4242 return namespace_ancestor (CP_DECL_CONTEXT (ns1
), ns2
);
4245 /* Insert used into the using list of user. Set indirect_flag if this
4246 directive is not directly from the source. Also find the common
4247 ancestor and let our users know about the new namespace */
4249 add_using_namespace (user
, used
, indirect
)
4255 /* Using oneself is a no-op. */
4258 my_friendly_assert (TREE_CODE (user
) == NAMESPACE_DECL
, 380);
4259 my_friendly_assert (TREE_CODE (used
) == NAMESPACE_DECL
, 380);
4260 /* Check if we already have this. */
4261 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
4265 /* Promote to direct usage. */
4266 TREE_INDIRECT_USING (t
) = 0;
4270 /* Add used to the user's using list. */
4271 DECL_NAMESPACE_USING (user
)
4272 = perm_tree_cons (used
, namespace_ancestor (user
, used
),
4273 DECL_NAMESPACE_USING (user
));
4275 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
4277 /* Add user to the used's users list. */
4278 DECL_NAMESPACE_USERS (used
)
4279 = perm_tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
4281 /* Recursively add all namespaces used. */
4282 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
4283 /* indirect usage */
4284 add_using_namespace (user
, TREE_PURPOSE (t
), 1);
4286 /* Tell everyone using us about the new used namespaces. */
4287 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
4288 add_using_namespace (TREE_PURPOSE (t
), used
, 1);
4291 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4292 duplicates. The first list becomes the tail of the result.
4294 The algorithm is O(n^2). We could get this down to O(n log n) by
4295 doing a sort on the addresses of the functions, if that becomes
4299 merge_functions (s1
, s2
)
4303 for (; s2
; s2
= OVL_NEXT (s2
))
4305 tree fn
= OVL_CURRENT (s2
);
4306 if (! ovl_member (fn
, s1
))
4307 s1
= build_overload (fn
, s1
);
4312 /* This should return an error not all definitions define functions.
4313 It is not an error if we find two functions with exactly the
4314 same signature, only if these are selected in overload resolution.
4315 old is the current set of bindings, new the freshly-found binding.
4316 XXX Do we want to give *all* candidates in case of ambiguity?
4317 XXX In what way should I treat extern declarations?
4318 XXX I don't want to repeat the entire duplicate_decls here */
4321 ambiguous_decl (name
, old
, new, flags
)
4328 my_friendly_assert (old
!= NULL_TREE
, 393);
4329 /* Copy the value. */
4330 val
= BINDING_VALUE (new);
4332 switch (TREE_CODE (val
))
4335 /* If we expect types or namespaces, and not templates,
4336 or this is not a template class. */
4337 if (LOOKUP_QUALIFIERS_ONLY (flags
)
4338 && !DECL_CLASS_TEMPLATE_P (val
))
4342 if (LOOKUP_NAMESPACES_ONLY (flags
))
4345 case NAMESPACE_DECL
:
4346 if (LOOKUP_TYPES_ONLY (flags
))
4350 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4354 if (!BINDING_VALUE (old
))
4355 BINDING_VALUE (old
) = val
;
4356 else if (val
&& val
!= BINDING_VALUE (old
))
4358 if (is_overloaded_fn (BINDING_VALUE (old
))
4359 && is_overloaded_fn (val
))
4361 BINDING_VALUE (old
) = merge_functions (BINDING_VALUE (old
),
4366 /* Some declarations are functions, some are not. */
4367 if (flags
& LOOKUP_COMPLAIN
)
4369 /* If we've already given this error for this lookup,
4370 BINDING_VALUE (old) is error_mark_node, so let's not
4371 repeat ourselves. */
4372 if (BINDING_VALUE (old
) != error_mark_node
)
4374 cp_error ("use of `%D' is ambiguous", name
);
4375 cp_error_at (" first declared as `%#D' here",
4376 BINDING_VALUE (old
));
4378 cp_error_at (" also declared as `%#D' here", val
);
4380 return error_mark_node
;
4383 /* ... and copy the type. */
4384 type
= BINDING_TYPE (new);
4385 if (LOOKUP_NAMESPACES_ONLY (flags
))
4387 if (!BINDING_TYPE (old
))
4388 BINDING_TYPE (old
) = type
;
4389 else if (type
&& BINDING_TYPE (old
) != type
)
4391 if (flags
& LOOKUP_COMPLAIN
)
4393 cp_error ("`%D' denotes an ambiguous type",name
);
4394 cp_error_at (" first type here", BINDING_TYPE (old
));
4395 cp_error_at (" other type here", type
);
4401 /* Add the bindings of name in used namespaces to val.
4402 The using list is defined by usings, and the lookup goes to scope.
4403 Returns zero on errors. */
4406 lookup_using_namespace (name
, val
, usings
, scope
, flags
)
4407 tree name
, val
, usings
, scope
;
4412 /* Iterate over all used namespaces in current, searching for using
4413 directives of scope. */
4414 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4415 if (TREE_VALUE (iter
) == scope
)
4417 val1
= binding_for_name (name
, TREE_PURPOSE (iter
));
4418 /* Resolve ambiguities. */
4419 val
= ambiguous_decl (name
, val
, val1
, flags
);
4421 return val
!= error_mark_node
;
4425 Accepts the NAME to lookup and its qualifying SCOPE.
4426 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4430 qualified_lookup_using_namespace (name
, scope
, result
, flags
)
4436 /* Maintain a list of namespaces visited... */
4437 tree seen
= NULL_TREE
;
4438 /* ... and a list of namespace yet to see. */
4439 tree todo
= NULL_TREE
;
4441 while (scope
&& (result
!= error_mark_node
))
4443 seen
= temp_tree_cons (scope
, NULL_TREE
, seen
);
4444 result
= ambiguous_decl (name
, result
,
4445 binding_for_name (name
, scope
), flags
);
4446 if (!BINDING_VALUE (result
) && !BINDING_TYPE (result
))
4447 /* Consider using directives. */
4448 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4449 usings
= TREE_CHAIN (usings
))
4450 /* If this was a real directive, and we have not seen it. */
4451 if (!TREE_INDIRECT_USING (usings
)
4452 && !purpose_member (TREE_PURPOSE (usings
), seen
))
4453 todo
= temp_tree_cons (TREE_PURPOSE (usings
), NULL_TREE
, todo
);
4456 scope
= TREE_PURPOSE (todo
);
4457 todo
= TREE_CHAIN (todo
);
4460 scope
= NULL_TREE
; /* If there never was a todo list. */
4462 return result
!= error_mark_node
;
4465 /* [namespace.memdef]/2 */
4467 /* Set the context of a declaration to scope. Complain if we are not
4471 set_decl_namespace (decl
, scope
, friendp
)
4477 if (scope
== std_node
)
4478 scope
= global_namespace
;
4479 /* Get rid of namespace aliases. */
4480 scope
= ORIGINAL_NAMESPACE (scope
);
4482 /* It is ok for friends to be qualified in parallel space. */
4483 if (!friendp
&& !is_namespace_ancestor (current_namespace
, scope
))
4484 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4486 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
4487 if (scope
!= current_namespace
)
4489 /* See whether this has been declared in the namespace. */
4490 old
= namespace_binding (DECL_NAME (decl
), scope
);
4492 /* No old declaration at all. */
4494 if (!is_overloaded_fn (decl
))
4495 /* Don't compare non-function decls with decls_match here,
4496 since it can't check for the correct constness at this
4497 point. pushdecl will find those errors later. */
4499 /* Since decl is a function, old should contain a function decl. */
4500 if (!is_overloaded_fn (old
))
4502 for (; old
; old
= OVL_NEXT (old
))
4503 if (decls_match (decl
, OVL_CURRENT (old
)))
4509 cp_error ("`%D' should have been declared inside `%D'",
4513 /* Compute the namespace where a declaration is defined. */
4516 decl_namespace (decl
)
4519 while (DECL_CONTEXT (decl
))
4521 decl
= DECL_CONTEXT (decl
);
4522 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4524 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 't')
4525 decl
= TYPE_STUB_DECL (decl
);
4526 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 390);
4529 return global_namespace
;
4532 /* Return the namespace where the current declaration is declared. */
4535 current_decl_namespace ()
4538 /* If we have been pushed into a different namespace, use it. */
4539 if (decl_namespace_list
)
4540 return TREE_PURPOSE (decl_namespace_list
);
4542 if (current_class_type
)
4543 result
= decl_namespace (TYPE_STUB_DECL (current_class_type
));
4544 else if (current_function_decl
)
4545 result
= decl_namespace (current_function_decl
);
4547 result
= current_namespace
;
4551 /* Temporarily set the namespace for the current declaration. */
4554 push_decl_namespace (decl
)
4557 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
4558 decl
= decl_namespace (decl
);
4559 decl_namespace_list
= tree_cons (decl
, NULL_TREE
, decl_namespace_list
);
4563 pop_decl_namespace ()
4565 decl_namespace_list
= TREE_CHAIN (decl_namespace_list
);
4568 /* Enter a class or namespace scope. */
4574 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4575 push_decl_namespace (t
);
4580 /* Leave scope pushed by push_scope. */
4586 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4587 pop_decl_namespace ();
4592 /* [basic.lookup.koenig] */
4593 /* A non-zero return value in the functions below indicates an error.
4594 All nodes allocated in the procedure are on the scratch obstack. */
4604 static int arg_assoc
PROTO((struct arg_lookup
*, tree
));
4605 static int arg_assoc_args
PROTO((struct arg_lookup
*, tree
));
4606 static int arg_assoc_type
PROTO((struct arg_lookup
*, tree
));
4607 static int add_function
PROTO((struct arg_lookup
*, tree
));
4608 static int arg_assoc_namespace
PROTO((struct arg_lookup
*, tree
));
4609 static int arg_assoc_class
PROTO((struct arg_lookup
*, tree
));
4611 /* Add a function to the lookup structure.
4612 Returns 1 on error. */
4615 add_function (k
, fn
)
4616 struct arg_lookup
*k
;
4619 if (ovl_member (fn
, k
->functions
))
4621 /* We must find only functions, or exactly one non-function. */
4622 if (k
->functions
&& is_overloaded_fn (k
->functions
)
4623 && is_overloaded_fn (fn
))
4624 k
->functions
= build_overload (fn
, k
->functions
);
4628 tree f1
= OVL_CURRENT (k
->functions
);
4630 if (is_overloaded_fn (f1
))
4632 fn
= f1
; f1
= f2
; f2
= fn
;
4634 cp_error_at ("`%D' is not a function,", f1
);
4635 cp_error_at (" conflict with `%D'", f2
);
4636 cp_error (" in call to `%D'", k
->name
);
4644 /* Add functions of a namespace to the lookup structure.
4645 Returns 1 on error. */
4648 arg_assoc_namespace (k
, scope
)
4649 struct arg_lookup
*k
;
4654 if (purpose_member (scope
, k
->namespaces
))
4656 k
->namespaces
= tree_cons (scope
, NULL_TREE
, k
->namespaces
);
4658 value
= namespace_binding (k
->name
, scope
);
4662 for (; value
; value
= OVL_NEXT (value
))
4663 if (add_function (k
, OVL_CURRENT (value
)))
4669 /* Adds everything associated with class to the lookup structure.
4670 Returns 1 on error. */
4673 arg_assoc_class (k
, type
)
4674 struct arg_lookup
* k
;
4677 tree list
, friends
, context
;
4680 if (purpose_member (type
, k
->classes
))
4682 k
->classes
= tree_cons (type
, NULL_TREE
, k
->classes
);
4684 context
= decl_namespace (TYPE_MAIN_DECL (type
));
4685 if (arg_assoc_namespace (k
, context
))
4688 /* Process baseclasses. */
4689 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (type
); i
++)
4690 if (arg_assoc_class (k
, TYPE_BINFO_BASETYPE (type
, i
)))
4693 /* Process friends. */
4694 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
4695 list
= TREE_CHAIN (list
))
4696 if (k
->name
== TREE_PURPOSE (list
))
4697 for (friends
= TREE_VALUE (list
); friends
;
4698 friends
= TREE_CHAIN (friends
))
4699 /* Only interested in global functions with potentially hidden
4700 (i.e. unqualified) declarations. */
4701 if (TREE_PURPOSE (list
) == error_mark_node
&& TREE_VALUE (list
)
4702 && decl_namespace (TREE_VALUE (list
)) == context
)
4703 if (add_function (k
, TREE_VALUE (list
)))
4706 /* Process template arguments. */
4707 if (CLASSTYPE_TEMPLATE_INFO (type
))
4709 list
= innermost_args (CLASSTYPE_TI_ARGS (type
));
4710 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
4711 arg_assoc (k
, TREE_VEC_ELT (list
, i
));
4717 /* Adds everything associated with a given type.
4718 Returns 1 on error. */
4721 arg_assoc_type (k
, type
)
4722 struct arg_lookup
*k
;
4725 switch (TREE_CODE (type
))
4735 if (TYPE_PTRMEMFUNC_P (type
))
4736 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
4737 return arg_assoc_class (k
, type
);
4739 case REFERENCE_TYPE
:
4741 return arg_assoc_type (k
, TREE_TYPE (type
));
4744 return arg_assoc_namespace (k
, decl_namespace (TYPE_MAIN_DECL (type
)));
4746 /* Pointer to member: associate class type and value type. */
4747 if (arg_assoc_type (k
, TYPE_OFFSET_BASETYPE (type
)))
4749 return arg_assoc_type (k
, TREE_TYPE (type
));
4751 /* The basetype is referenced in the first arg type, so just
4754 /* Associate the parameter types. */
4755 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
4757 /* Associate the return type. */
4758 return arg_assoc_type (k
, TREE_TYPE (type
));
4759 case TEMPLATE_TYPE_PARM
:
4760 case TEMPLATE_TEMPLATE_PARM
:
4763 if (type
== unknown_type_node
)
4765 /* else fall through */
4767 my_friendly_abort (390);
4772 /* Adds everything associated with arguments. Returns 1 on error. */
4775 arg_assoc_args (k
, args
)
4776 struct arg_lookup
* k
;
4779 for (; args
; args
= TREE_CHAIN (args
))
4780 if (arg_assoc (k
, TREE_VALUE (args
)))
4785 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4789 struct arg_lookup
* k
;
4792 if (n
== error_mark_node
)
4795 if (TREE_CODE_CLASS (TREE_CODE (n
)) == 't')
4796 return arg_assoc_type (k
, n
);
4798 if (! type_unknown_p (n
))
4799 return arg_assoc_type (k
, TREE_TYPE (n
));
4801 if (TREE_CODE (n
) == ADDR_EXPR
)
4802 n
= TREE_OPERAND (n
, 0);
4803 if (TREE_CODE (n
) == COMPONENT_REF
)
4804 n
= TREE_OPERAND (n
, 1);
4805 if (TREE_CODE (n
) == OFFSET_REF
)
4806 n
= TREE_OPERAND (n
, 1);
4807 while (TREE_CODE (n
) == TREE_LIST
)
4810 if (TREE_CODE (n
) == FUNCTION_DECL
)
4811 return arg_assoc_type (k
, TREE_TYPE (n
));
4812 if (TREE_CODE (n
) == TEMPLATE_ID_EXPR
)
4814 /* [basic.lookup.koenig]
4816 If T is a template-id, its associated namespaces and classes
4817 are the namespace in which the template is defined; for
4818 member templates, the member template's class; the namespaces
4819 and classes associated with the types of the template
4820 arguments provided for template type parameters (excluding
4821 template template parameters); the namespaces in which any
4822 template template arguments are defined; and the classes in
4823 which any member templates used as template template
4824 arguments are defined. [Note: non-type template arguments do
4825 not contribute to the set of associated namespaces. ] */
4826 tree
template = TREE_OPERAND (n
, 0);
4827 tree args
= TREE_OPERAND (n
, 1);
4831 /* First, the template. There may actually be more than one if
4832 this is an overloaded function template. But, in that case,
4833 we only need the first; all the functions will be in the same
4835 template = OVL_CURRENT (template);
4837 ctx
= CP_DECL_CONTEXT (template);
4839 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4841 if (arg_assoc_namespace (k
, ctx
) == 1)
4844 /* It must be a member template. */
4845 else if (arg_assoc_class (k
, ctx
) == 1)
4848 /* Now the arguments. */
4849 for (arg
= args
; arg
!= NULL_TREE
; arg
= TREE_CHAIN (arg
))
4851 tree t
= TREE_VALUE (arg
);
4853 if (TREE_CODE (t
) == TEMPLATE_DECL
)
4855 ctx
= CP_DECL_CONTEXT (t
);
4856 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4858 if (arg_assoc_namespace (k
, ctx
) == 1)
4861 else if (arg_assoc_class (k
, ctx
) == 1)
4864 else if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
4865 && arg_assoc_type (k
, t
) == 1)
4871 my_friendly_assert (TREE_CODE (n
) == OVERLOAD
, 980715);
4873 for (; n
; n
= OVL_CHAIN (n
))
4874 if (arg_assoc_type (k
, TREE_TYPE (OVL_FUNCTION (n
))))
4881 /* Performs Koenig lookup depending on arguments, where fns
4882 are the functions found in normal lookup. */
4885 lookup_arg_dependent (name
, fns
, args
)
4890 struct arg_lookup k
;
4893 k
.namespaces
= NULL_TREE
;
4894 k
.classes
= NULL_TREE
;
4896 push_scratch_obstack ();
4897 arg_assoc_args (&k
, args
);
4902 /* Process a namespace-alias declaration. */
4905 do_namespace_alias (alias
, namespace)
4906 tree alias
, namespace;
4908 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
4910 /* The parser did not find it, so it's not there. */
4911 cp_error ("unknown namespace `%D'", namespace);
4915 namespace = ORIGINAL_NAMESPACE (namespace);
4917 /* Build the alias. */
4918 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
4919 DECL_NAMESPACE_ALIAS (alias
) = namespace;
4923 /* Check a non-member using-declaration. Return the name and scope
4924 being used, and the USING_DECL, or NULL_TREE on failure. */
4927 validate_nonmember_using_decl (decl
, scope
, name
)
4932 if (TREE_CODE (decl
) == SCOPE_REF
4933 && TREE_OPERAND (decl
, 0) == std_node
)
4935 if (namespace_bindings_p ()
4936 && current_namespace
== global_namespace
)
4937 /* There's no need for a using declaration at all, here,
4938 since `std' is the same as `::'. We can't just pass this
4939 on because we'll complain later about declaring something
4940 in the same scope as a using declaration with the same
4941 name. We return NULL_TREE which indicates to the caller
4942 that there's no need to do any further processing. */
4945 *scope
= global_namespace
;
4946 *name
= TREE_OPERAND (decl
, 1);
4948 else if (TREE_CODE (decl
) == SCOPE_REF
)
4950 *scope
= TREE_OPERAND (decl
, 0);
4951 *name
= TREE_OPERAND (decl
, 1);
4953 /* [namespace.udecl]
4955 A using-declaration for a class member shall be a
4956 member-declaration. */
4957 if (TREE_CODE (*scope
) != NAMESPACE_DECL
)
4959 if (TYPE_P (*scope
))
4960 cp_error ("`%T' is not a namespace", *scope
);
4962 cp_error ("`%D' is not a namespace", *scope
);
4966 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
4967 || TREE_CODE (decl
) == TYPE_DECL
4968 || TREE_CODE (decl
) == TEMPLATE_DECL
)
4970 *scope
= global_namespace
;
4974 my_friendly_abort (382);
4975 if (TREE_CODE_CLASS (TREE_CODE (*name
)) == 'd')
4976 *name
= DECL_NAME (*name
);
4977 /* Make a USING_DECL. */
4978 return push_using_decl (*scope
, *name
);
4981 /* Process local and global using-declarations. */
4984 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, newval
, newtype
)
4986 tree oldval
, oldtype
;
4987 tree
*newval
, *newtype
;
4990 struct tree_binding _decls
;
4992 *newval
= *newtype
= NULL_TREE
;
4993 decls
= binding_init (&_decls
);
4994 if (!qualified_lookup_using_namespace (name
, scope
, decls
, 0))
4998 if (!BINDING_VALUE (decls
) && !BINDING_TYPE (decls
))
5000 cp_error ("`%D' not declared", name
);
5004 /* Check for using functions. */
5005 if (BINDING_VALUE (decls
) && is_overloaded_fn (BINDING_VALUE (decls
)))
5009 if (oldval
&& !is_overloaded_fn (oldval
))
5011 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls
)), oldval
);
5016 for (tmp
= BINDING_VALUE (decls
); tmp
; tmp
= OVL_NEXT (tmp
))
5018 tree new_fn
= OVL_CURRENT (tmp
);
5020 /* [namespace.udecl]
5022 If a function declaration in namespace scope or block
5023 scope has the same name and the same parameter types as a
5024 function introduced by a using declaration the program is
5026 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
5028 tree old_fn
= OVL_CURRENT (tmp1
);
5030 if (!OVL_USED (tmp1
)
5031 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn
)),
5032 TYPE_ARG_TYPES (TREE_TYPE (old_fn
))))
5034 /* There was already a non-using declaration in
5035 this scope with the same parameter types. */
5036 cp_error ("`%D' is already declared in this scope",
5040 else if (duplicate_decls (new_fn
, old_fn
))
5041 /* We're re-using something we already used
5042 before. We don't need to add it again. */
5046 /* If we broke out of the loop, there's no reason to add
5047 this function to the using declarations for this
5052 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
5053 if (TREE_CODE (*newval
) != OVERLOAD
)
5054 *newval
= ovl_cons (*newval
, NULL_TREE
);
5055 OVL_USED (*newval
) = 1;
5060 *newval
= BINDING_VALUE (decls
);
5062 duplicate_decls (*newval
, oldval
);
5065 *newtype
= BINDING_TYPE (decls
);
5066 if (oldtype
&& *newtype
&& oldtype
!= *newtype
)
5068 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5074 /* Process a using-declaration not appearing in class or local scope. */
5077 do_toplevel_using_decl (decl
)
5080 tree scope
, name
, binding
;
5081 tree oldval
, oldtype
, newval
, newtype
;
5083 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5084 if (decl
== NULL_TREE
)
5087 binding
= binding_for_name (name
, current_namespace
);
5089 oldval
= BINDING_VALUE (binding
);
5090 oldtype
= BINDING_TYPE (binding
);
5092 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5094 /* Copy declarations found. */
5096 BINDING_VALUE (binding
) = newval
;
5098 BINDING_TYPE (binding
) = newtype
;
5102 /* Process a using-declaration at function scope. */
5105 do_local_using_decl (decl
)
5109 tree oldval
, oldtype
, newval
, newtype
;
5111 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5112 if (decl
== NULL_TREE
)
5115 oldval
= lookup_name_current_level (name
);
5116 oldtype
= lookup_type_current_level (name
);
5118 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5122 if (is_overloaded_fn (newval
))
5126 /* We only need to push declarations for those functions
5127 that were not already bound in the current level.
5128 The old value might be NULL_TREE, it might be a single
5129 function, or an OVERLOAD. */
5130 if (oldval
&& TREE_CODE (oldval
) == OVERLOAD
)
5131 term
= OVL_FUNCTION (oldval
);
5134 for (fn
= newval
; fn
&& OVL_CURRENT (fn
) != term
;
5136 push_overloaded_decl (OVL_CURRENT (fn
),
5137 PUSH_LOCAL
| PUSH_USING
);
5140 push_local_binding (name
, newval
, PUSH_USING
);
5143 set_identifier_type_value (name
, newtype
);
5147 do_class_using_decl (decl
)
5152 if (TREE_CODE (decl
) != SCOPE_REF
5153 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl
, 0))) != 't')
5155 cp_error ("using-declaration for non-member at class scope");
5158 name
= TREE_OPERAND (decl
, 1);
5159 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
5161 cp_error ("using-declaration for destructor");
5164 if (TREE_CODE (name
) == TYPE_DECL
)
5165 name
= DECL_NAME (name
);
5167 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 980716);
5169 value
= build_lang_field_decl (USING_DECL
, name
, void_type_node
);
5170 DECL_INITIAL (value
) = TREE_OPERAND (decl
, 0);
5174 /* Process a using-directive. */
5177 do_using_directive (namespace)
5180 if (namespace == std_node
)
5182 /* using namespace A::B::C; */
5183 if (TREE_CODE (namespace) == SCOPE_REF
)
5184 namespace = TREE_OPERAND (namespace, 1);
5185 if (TREE_CODE (namespace) == IDENTIFIER_NODE
)
5187 /* Lookup in lexer did not find a namespace. */
5188 cp_error ("namespace `%T' undeclared", namespace);
5191 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
5193 cp_error ("`%T' is not a namespace", namespace);
5196 namespace = ORIGINAL_NAMESPACE (namespace);
5197 if (!toplevel_bindings_p ())
5198 push_using_directive (namespace);
5201 add_using_namespace (current_namespace
, namespace, 0);
5205 check_default_args (x
)
5208 tree arg
= TYPE_ARG_TYPES (TREE_TYPE (x
));
5209 int saw_def
= 0, i
= 0 - (TREE_CODE (TREE_TYPE (x
)) == METHOD_TYPE
);
5210 for (; arg
&& arg
!= void_list_node
; arg
= TREE_CHAIN (arg
), ++i
)
5212 if (TREE_PURPOSE (arg
))
5216 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5227 TREE_USED (decl
) = 1;
5228 if (processing_template_decl
)
5230 assemble_external (decl
);
5232 /* Is it a synthesized method that needs to be synthesized? */
5233 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CLASS_CONTEXT (decl
)
5234 && DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
5235 /* Kludge: don't synthesize for default args. */
5236 && current_function_decl
)
5237 synthesize_method (decl
);
5239 /* If this is a function or variable that is an instance of some
5240 template, we now know that we will need to actually do the
5241 instantiation. A TEMPLATE_DECL may also have DECL_TEMPLATE_INFO,
5242 if it's a partial instantiation, but there's no need to
5243 instantiate such a thing. We check that DECL is not an explicit
5244 instantiation because that is not checked in instantiate_decl. */
5245 if (TREE_CODE (decl
) != TEMPLATE_DECL
5246 && DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
5247 && !DECL_EXPLICIT_INSTANTIATION (decl
))
5248 instantiate_decl (decl
);
5251 /* Helper function for named_class_head_sans_basetype nonterminal. We
5252 have just seen something of the form `AGGR SCOPE::ID'. Return a
5253 TYPE_DECL for the type declared by ID in SCOPE. */
5256 handle_class_head (aggr
, scope
, id
)
5257 tree aggr
, scope
, id
;
5261 if (TREE_CODE (id
) == TYPE_DECL
)
5263 else if (DECL_CLASS_TEMPLATE_P (id
))
5264 decl
= DECL_TEMPLATE_RESULT (id
);
5269 cp_error ("`%T' does not have a nested type named `%D'", scope
, id
);
5270 return error_mark_node
;
5273 cp_error ("no file-scope type named `%D'", id
);
5275 decl
= TYPE_MAIN_DECL (xref_tag (aggr
, make_anon_name (), 1));
5278 /* This syntax is only allowed when we're defining a type, so we
5280 push_scope (CP_DECL_CONTEXT (decl
));
5282 /* If we see something like:
5284 template <typename T> struct S::I ....
5286 we must create a TEMPLATE_DECL for the nested type. */
5287 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5288 decl
= push_template_decl (decl
);