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 is_namespace_ancestor
PROTO((tree
, tree
));
77 static void add_using_namespace
PROTO((tree
, tree
, int));
78 static tree ambiguous_decl
PROTO((tree
, tree
, tree
,int));
79 static tree build_anon_union_vars
PROTO((tree
, tree
*, int, int));
80 static int acceptable_java_type
PROTO((tree
));
81 static void output_vtable_inherit
PROTO((tree
));
82 static void start_objects
PROTO((int, int));
83 static void finish_objects
PROTO((int, int));
84 static tree merge_functions
PROTO((tree
, tree
));
85 static tree decl_namespace
PROTO((tree
));
86 static tree validate_nonmember_using_decl
PROTO((tree
, tree
*, tree
*));
87 static void do_nonmember_using_decl
PROTO((tree
, tree
, tree
, tree
,
89 static void start_static_storage_duration_function
PROTO((void));
90 static int generate_inits_for_priority
PROTO((splay_tree_node
, void *));
91 static void finish_static_storage_duration_function
PROTO((void));
92 static priority_info get_priority_info
PROTO((int));
93 static void do_static_initialization
PROTO((tree
, tree
, tree
, int));
94 static void do_static_destruction
PROTO((tree
, tree
, int));
95 static void do_static_initialization_and_destruction
PROTO((tree
, tree
));
96 static void generate_ctor_or_dtor_function
PROTO((int, int));
97 static int generate_ctor_and_dtor_functions_for_priority
98 PROTO((splay_tree_node
, void *));
99 extern int current_class_depth
;
101 /* A list of virtual function tables we must make sure to write out. */
102 tree pending_vtables
;
104 /* A list of static class variables. This is needed, because a
105 static class variable can be declared inside the class without
106 an initializer, and then initialized, staticly, outside the class. */
107 static varray_type pending_statics
;
108 static size_t pending_statics_used
;
110 /* A list of functions which were declared inline, but which we
111 may need to emit outline anyway. */
112 static varray_type saved_inlines
;
113 static size_t saved_inlines_used
;
115 /* Same, but not reset. Local temp variables and global temp variables
116 can have the same name. */
117 static int global_temp_name_counter
;
119 /* Flag used when debugging spew.c */
121 extern int spew_debug
;
123 /* Nonzero if we're done parsing and into end-of-file activities. */
127 /* Functions called along with real static constructors and destructors. */
129 tree static_ctors
, static_dtors
;
131 /* The current open namespace, and ::. */
133 tree current_namespace
;
134 tree global_namespace
;
136 /* The stack for namespaces of current declarations. */
138 static tree decl_namespace_list
;
141 /* C (and C++) language-specific option variables. */
143 /* Nonzero means allow type mismatches in conditional expressions;
144 just make their values `void'. */
146 int flag_cond_mismatch
;
148 /* Nonzero means give `double' the same size as `float'. */
150 int flag_short_double
;
152 /* Nonzero means don't recognize the keyword `asm'. */
156 /* Nonzero means don't recognize any extension keywords. */
158 int flag_no_gnu_keywords
;
160 /* Nonzero means don't recognize the non-ANSI builtin functions. */
164 /* Nonzero means don't recognize the non-ANSI builtin functions.
167 int flag_no_nonansi_builtin
;
169 /* Nonzero means do some things the same way PCC does. Only provided so
170 the compiler will link. */
172 int flag_traditional
;
174 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
176 int flag_signed_bitfields
= 1;
178 /* Nonzero means enable obscure ANSI features and disable GNU extensions
179 that might cause ANSI-compliant code to be miscompiled. */
183 /* Nonzero means do emit exported implementations of functions even if
184 they can be inlined. */
186 int flag_implement_inlines
= 1;
188 /* Nonzero means do emit exported implementations of templates, instead of
189 multiple static copies in each file that needs a definition. */
191 int flag_external_templates
;
193 /* Nonzero means that the decision to emit or not emit the implementation of a
194 template depends on where the template is instantiated, rather than where
197 int flag_alt_external_templates
;
199 /* Nonzero means that implicit instantiations will be emitted if needed. */
201 int flag_implicit_templates
= 1;
203 /* Nonzero means that implicit instantiations of inline templates will be
204 emitted if needed, even if instantiations of non-inline templates
207 int flag_implicit_inline_templates
= 1;
209 /* Nonzero means warn about implicit declarations. */
211 int warn_implicit
= 1;
213 /* Nonzero means warn about usage of long long when `-pedantic'. */
215 int warn_long_long
= 1;
217 /* Nonzero means warn when all ctors or dtors are private, and the class
220 int warn_ctor_dtor_privacy
= 1;
222 /* True if we want to implement vtables using "thunks".
223 The default is off. */
225 #ifndef DEFAULT_VTABLE_THUNKS
226 #define DEFAULT_VTABLE_THUNKS 0
228 int flag_vtable_thunks
= DEFAULT_VTABLE_THUNKS
;
230 /* Nonzero means generate separate instantiation control files and juggle
231 them at link time. */
233 int flag_use_repository
;
235 /* Nonzero if we want to issue diagnostics that the standard says are not
238 int flag_optional_diags
= 1;
240 /* Nonzero means give string constants the type `const char *', as mandated
243 int flag_const_strings
= 1;
245 /* If non-NULL, dump the tree structure for the entire translation
246 unit to this file. */
248 char *flag_dump_translation_unit
= 0;
250 /* Nonzero means warn about deprecated conversion from string constant to
253 int warn_write_strings
;
255 /* Nonzero means warn about pointer casts that can drop a type qualifier
256 from the pointer target type. */
260 /* Nonzero means warn about sizeof(function) or addition/subtraction
261 of function pointers. */
263 int warn_pointer_arith
= 1;
265 /* Nonzero means warn for any function def without prototype decl. */
267 int warn_missing_prototypes
;
269 /* Nonzero means warn about multiple (redundant) decls for the same single
270 variable or function. */
272 int warn_redundant_decls
;
274 /* Warn if initializer is not completely bracketed. */
276 int warn_missing_braces
;
278 /* Warn about comparison of signed and unsigned values. */
280 int warn_sign_compare
;
282 /* Warn about *printf or *scanf format/argument anomalies. */
286 /* Warn about a subscript that has type char. */
288 int warn_char_subscripts
;
290 /* Warn if a type conversion is done that might have confusing results. */
294 /* Warn if adding () is suggested. */
296 int warn_parentheses
;
298 /* Non-zero means warn in function declared in derived class has the
299 same name as a virtual in the base class, but fails to match the
300 type signature of any virtual function in the base class. */
301 int warn_overloaded_virtual
;
303 /* Non-zero means warn when declaring a class that has a non virtual
304 destructor, when it really ought to have a virtual one. */
307 /* Non-zero means warn when a function is declared extern and later inline. */
308 int warn_extern_inline
;
310 /* Non-zero means warn when the compiler will reorder code. */
313 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
316 /* Non-zero means warn when we convert a pointer to member function
317 into a pointer to (void or function). */
318 int warn_pmf2ptr
= 1;
320 /* Nonzero means warn about violation of some Effective C++ style rules. */
324 /* Nonzero means warn where overload resolution chooses a promotion from
325 unsigned to signed over a conversion to an unsigned of the same size. */
329 /* Nonzero means warn when an old-style cast is used. */
331 int warn_old_style_cast
;
333 /* Warn about #pragma directives that are not recognised. */
335 int warn_unknown_pragmas
; /* Tri state variable. */
337 /* Nonzero means warn about use of multicharacter literals. */
339 int warn_multichar
= 1;
341 /* Nonzero means warn when non-templatized friend functions are
342 declared within a template */
344 int warn_nontemplate_friend
= 1;
346 /* Nonzero means complain about deprecated features. */
348 int warn_deprecated
= 1;
350 /* Nonzero means `$' can be in an identifier. */
352 #ifndef DOLLARS_IN_IDENTIFIERS
353 #define DOLLARS_IN_IDENTIFIERS 1
355 int dollars_in_ident
= DOLLARS_IN_IDENTIFIERS
;
357 /* Nonzero for -fno-strict-prototype switch: do not consider empty
358 argument prototype to mean function takes no arguments. */
360 int flag_strict_prototype
= 2;
361 int strict_prototype
= 1;
362 int strict_prototypes_lang_c
, strict_prototypes_lang_cplusplus
= 1;
364 /* Nonzero means that labels can be used as first-class objects */
368 /* Nonzero means allow Microsoft extensions without a pedwarn. */
370 int flag_ms_extensions
;
372 /* Non-zero means to collect statistics which might be expensive
373 and to print them when we are done. */
374 int flag_detailed_statistics
;
376 /* C++ specific flags. */
377 /* Zero means that `this' is a *const. This gives nice behavior in the
378 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
379 -2 means we're constructing an object and it has fixed type. */
381 int flag_this_is_variable
;
383 /* Nonzero means we should attempt to elide constructors when possible. */
385 int flag_elide_constructors
= 1;
387 /* Nonzero means that member functions defined in class scope are
388 inline by default. */
390 int flag_default_inline
= 1;
392 /* Controls whether compiler generates 'type descriptor' that give
393 run-time type information. */
396 /* Nonzero if we wish to output cross-referencing information
397 for the GNU class browser. */
398 extern int flag_gnu_xref
;
400 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
403 int flag_huge_objects
;
405 /* Nonzero if we want to conserve space in the .o files. We do this
406 by putting uninitialized data and runtime initialized data into
407 .common instead of .data at the expense of not flagging multiple
410 int flag_conserve_space
;
412 /* Nonzero if we want to obey access control semantics. */
414 int flag_access_control
= 1;
416 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
418 int flag_operator_names
;
420 /* Nonzero if we want to check the return value of new and avoid calling
421 constructors if it is a null pointer. */
425 /* Nonzero if we want the new ANSI rules for pushing a new scope for `for'
426 initialization variables.
427 0: Old rules, set by -fno-for-scope.
428 2: New ANSI rules, set by -ffor-scope.
429 1: Try to implement new ANSI rules, but with backup compatibility
430 (and warnings). This is the default, for now. */
432 int flag_new_for_scope
= 1;
434 /* Nonzero if we want to emit defined symbols with common-like linkage as
435 weak symbols where possible, in order to conform to C++ semantics.
436 Otherwise, emit them as local symbols. */
440 /* Nonzero to enable experimental ABI changes. */
444 /* Nonzero to not ignore namespace std. */
448 /* Maximum template instantiation depth. Must be at least 17 for ANSI
451 int max_tinst_depth
= 17;
453 /* The name-mangling scheme to use. Must be 1 or greater to support
454 template functions with identical types, but different template
456 int name_mangling_version
= 2;
458 /* Nonzero means that guiding declarations are allowed. */
459 int flag_guiding_decls
;
461 /* Nonzero if squashed mangling is to be performed.
462 This uses the B and K codes to reference previously seen class types
463 and class qualifiers. */
464 int flag_do_squangling
;
466 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
470 /* Nonzero means make the default pedwarns warnings instead of errors.
471 The value of this flag is ignored if -pedantic is specified. */
475 /* If this variable is defined to a non-NULL value, it will be called
476 after the file has been completely parsed. */
478 void (*back_end_hook
) PROTO((tree
));
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 {"honor-std", &flag_honor_std
, 1},
513 {"huge-objects", &flag_huge_objects
, 1},
514 {"implement-inlines", &flag_implement_inlines
, 1},
515 {"implicit-inline-templates", &flag_implicit_inline_templates
, 1},
516 {"implicit-templates", &flag_implicit_templates
, 1},
517 {"labels-ok", &flag_labels_ok
, 1},
518 {"ms-extensions", &flag_ms_extensions
, 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_decl (FIELD_DECL
, NULL_TREE
, t
));
902 /* Ignore any inline function definitions in the anonymous union
903 since an anonymous union may not have function members. */
904 p
= &pending_inlines
;
905 for (; *p
; *p
= (*p
)->next
)
906 if (DECL_CONTEXT ((*p
)->fndecl
) != t
)
910 /* Constructors for types with virtual baseclasses need an "in-charge" flag
911 saying whether this constructor is responsible for initialization of
912 virtual baseclasses or not. All destructors also need this "in-charge"
913 flag, which additionally determines whether or not the destructor should
914 free the memory for the object.
916 This function adds the "in-charge" flag to member function FN if
917 appropriate. It is called from grokclassfn and tsubst.
918 FN must be either a constructor or destructor. */
921 maybe_retrofit_in_chrg (fn
)
924 tree basetype
, arg_types
, parms
, parm
, fntype
;
926 if (DECL_CONSTRUCTOR_P (fn
)
927 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CLASS_CONTEXT (fn
))
928 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn
))
930 else if (! DECL_CONSTRUCTOR_P (fn
)
931 && TREE_CHAIN (DECL_ARGUMENTS (fn
)) == NULL_TREE
)
936 if (DECL_CONSTRUCTOR_P (fn
))
937 DECL_CONSTRUCTOR_FOR_VBASE_P (fn
) = 1;
939 /* First add it to DECL_ARGUMENTS... */
940 parm
= build_decl (PARM_DECL
, in_charge_identifier
, integer_type_node
);
941 /* Mark the artificial `__in_chrg' parameter as "artificial". */
942 SET_DECL_ARTIFICIAL (parm
);
943 DECL_ARG_TYPE (parm
) = integer_type_node
;
944 TREE_READONLY (parm
) = 1;
945 parms
= DECL_ARGUMENTS (fn
);
946 TREE_CHAIN (parm
) = TREE_CHAIN (parms
);
947 TREE_CHAIN (parms
) = parm
;
949 /* ...and then to TYPE_ARG_TYPES. */
950 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
951 basetype
= TREE_TYPE (TREE_VALUE (arg_types
));
952 arg_types
= hash_tree_chain (integer_type_node
, TREE_CHAIN (arg_types
));
953 fntype
= build_cplus_method_type (basetype
, TREE_TYPE (TREE_TYPE (fn
)),
955 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)))
956 fntype
= build_exception_variant (fntype
,
957 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)));
958 TREE_TYPE (fn
) = fntype
;
961 /* Classes overload their constituent function names automatically.
962 When a function name is declared in a record structure,
963 its name is changed to it overloaded name. Since names for
964 constructors and destructors can conflict, we place a leading
967 CNAME is the name of the class we are grokking for.
969 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
971 FLAGS contains bits saying what's special about today's
972 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
974 If FUNCTION is a destructor, then we must add the `auto-delete' field
975 as a second parameter. There is some hair associated with the fact
976 that we must "declare" this variable in the manner consistent with the
977 way the rest of the arguments were declared.
979 QUALS are the qualifiers for the this pointer. */
982 grokclassfn (ctype
, function
, flags
, quals
)
983 tree ctype
, function
;
984 enum overload_flags flags
;
987 tree fn_name
= DECL_NAME (function
);
992 if (fn_name
== NULL_TREE
)
994 error ("name missing for member function");
995 fn_name
= get_identifier ("<anonymous>");
996 DECL_NAME (function
) = fn_name
;
1000 qualtype
= grok_method_quals (ctype
, function
, quals
);
1004 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1005 if (TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1007 /* Must add the class instance variable up front. */
1008 /* Right now we just make this a pointer. But later
1009 we may wish to make it special. */
1010 tree type
= TREE_VALUE (arg_types
);
1013 if ((flag_this_is_variable
> 0)
1014 && (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
)))
1017 parm
= build_decl (PARM_DECL
, this_identifier
, type
);
1018 /* Mark the artificial `this' parameter as "artificial". */
1019 SET_DECL_ARTIFICIAL (parm
);
1020 DECL_ARG_TYPE (parm
) = type
;
1021 /* We can make this a register, so long as we don't
1022 accidentally complain if someone tries to take its address. */
1023 DECL_REGISTER (parm
) = 1;
1025 TREE_READONLY (parm
) = 1;
1026 TREE_CHAIN (parm
) = last_function_parms
;
1027 last_function_parms
= parm
;
1030 DECL_ARGUMENTS (function
) = last_function_parms
;
1031 /* First approximations. */
1032 DECL_CONTEXT (function
) = ctype
;
1033 DECL_CLASS_CONTEXT (function
) = ctype
;
1035 if (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
))
1037 maybe_retrofit_in_chrg (function
);
1038 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1041 if (flags
== DTOR_FLAG
)
1043 DECL_ASSEMBLER_NAME (function
) = build_destructor_name (ctype
);
1044 TYPE_HAS_DESTRUCTOR (ctype
) = 1;
1047 set_mangled_name_for_decl (function
);
1050 /* Work on the expr used by alignof (this is only called by the parser). */
1059 if (processing_template_decl
)
1060 return build_min (ALIGNOF_EXPR
, sizetype
, expr
);
1062 if (TREE_CODE (expr
) == COMPONENT_REF
1063 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
1064 error ("`__alignof__' applied to a bit-field");
1066 if (TREE_CODE (expr
) == INDIRECT_REF
)
1068 best
= t
= TREE_OPERAND (expr
, 0);
1069 bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1071 while (TREE_CODE (t
) == NOP_EXPR
1072 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
1075 t
= TREE_OPERAND (t
, 0);
1076 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1077 if (thisalign
> bestalign
)
1078 best
= t
, bestalign
= thisalign
;
1080 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
1084 /* ANSI says arrays and fns are converted inside comma.
1085 But we can't convert them in build_compound_expr
1086 because that would break commas in lvalues.
1087 So do the conversion here if operand was a comma. */
1088 if (TREE_CODE (expr
) == COMPOUND_EXPR
1089 && (TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
1090 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
))
1091 expr
= default_conversion (expr
);
1092 return c_alignof (TREE_TYPE (expr
));
1096 /* Create an ARRAY_REF, checking for the user doing things backwards
1100 grok_array_decl (array_expr
, index_exp
)
1101 tree array_expr
, index_exp
;
1103 tree type
= TREE_TYPE (array_expr
);
1104 tree p1
, p2
, i1
, i2
;
1106 if (type
== error_mark_node
|| index_exp
== error_mark_node
)
1107 return error_mark_node
;
1108 if (processing_template_decl
)
1109 return build_min (ARRAY_REF
, type
? TREE_TYPE (type
) : NULL_TREE
,
1110 array_expr
, index_exp
);
1112 if (type
== NULL_TREE
)
1114 /* Something has gone very wrong. Assume we are mistakenly reducing
1115 an expression instead of a declaration. */
1116 error ("parser may be lost: is there a '{' missing somewhere?");
1120 if (TREE_CODE (type
) == OFFSET_TYPE
1121 || TREE_CODE (type
) == REFERENCE_TYPE
)
1122 type
= TREE_TYPE (type
);
1124 /* If they have an `operator[]', use that. */
1125 if (IS_AGGR_TYPE (type
) || IS_AGGR_TYPE (TREE_TYPE (index_exp
)))
1126 return build_opfncall (ARRAY_REF
, LOOKUP_NORMAL
,
1127 array_expr
, index_exp
, NULL_TREE
);
1129 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1130 is a little-known fact that, if `a' is an array and `i' is an
1131 int, you can write `i[a]', which means the same thing as `a[i]'. */
1133 if (TREE_CODE (type
) == ARRAY_TYPE
)
1136 p1
= build_expr_type_conversion (WANT_POINTER
, array_expr
, 0);
1138 if (TREE_CODE (TREE_TYPE (index_exp
)) == ARRAY_TYPE
)
1141 p2
= build_expr_type_conversion (WANT_POINTER
, index_exp
, 0);
1143 i1
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, array_expr
, 0);
1144 i2
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, index_exp
, 0);
1146 if ((p1
&& i2
) && (i1
&& p2
))
1147 error ("ambiguous conversion for array subscript");
1150 array_expr
= p1
, index_exp
= i2
;
1152 array_expr
= p2
, index_exp
= i1
;
1155 cp_error ("invalid types `%T[%T]' for array subscript",
1156 type
, TREE_TYPE (index_exp
));
1157 return error_mark_node
;
1160 if (array_expr
== error_mark_node
|| index_exp
== error_mark_node
)
1161 error ("ambiguous conversion for array subscript");
1163 return build_array_ref (array_expr
, index_exp
);
1166 /* Given the cast expression EXP, checking out its validity. Either return
1167 an error_mark_node if there was an unavoidable error, return a cast to
1168 void for trying to delete a pointer w/ the value 0, or return the
1169 call to delete. If DOING_VEC is 1, we handle things differently
1170 for doing an array delete. If DOING_VEC is 2, they gave us the
1171 array size as an argument to delete.
1172 Implements ARM $5.3.4. This is called from the parser. */
1175 delete_sanity (exp
, size
, doing_vec
, use_global_delete
)
1177 int doing_vec
, use_global_delete
;
1180 /* For a regular vector delete (aka, no size argument) we will pass
1181 this down as a NULL_TREE into build_vec_delete. */
1182 tree maxindex
= NULL_TREE
;
1184 if (exp
== error_mark_node
)
1187 if (processing_template_decl
)
1189 t
= build_min (DELETE_EXPR
, void_type_node
, exp
, size
);
1190 DELETE_EXPR_USE_GLOBAL (t
) = use_global_delete
;
1191 DELETE_EXPR_USE_VEC (t
) = doing_vec
;
1195 if (TREE_CODE (exp
) == OFFSET_REF
)
1196 exp
= resolve_offset_ref (exp
);
1197 exp
= convert_from_reference (exp
);
1198 t
= stabilize_reference (exp
);
1199 t
= build_expr_type_conversion (WANT_POINTER
, t
, 1);
1201 if (t
== NULL_TREE
|| t
== error_mark_node
)
1203 cp_error ("type `%#T' argument given to `delete', expected pointer",
1205 return error_mark_node
;
1210 maxindex
= build_binary_op (MINUS_EXPR
, size
, integer_one_node
);
1211 pedwarn ("anachronistic use of array size in vector delete");
1214 type
= TREE_TYPE (t
);
1216 /* As of Valley Forge, you can delete a pointer to const. */
1218 /* You can't delete functions. */
1219 if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
1221 error ("cannot delete a function");
1222 return error_mark_node
;
1225 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1226 if (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
)
1227 cp_warning ("`%T' is not a pointer-to-object type", type
);
1229 /* An array can't have been allocated by new, so complain. */
1230 if (TREE_CODE (t
) == ADDR_EXPR
1231 && TREE_CODE (TREE_OPERAND (t
, 0)) == VAR_DECL
1232 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == ARRAY_TYPE
)
1233 cp_warning ("deleting array `%#D'", TREE_OPERAND (t
, 0));
1235 /* Deleting a pointer with the value zero is valid and has no effect. */
1236 if (integer_zerop (t
))
1237 return build1 (NOP_EXPR
, void_type_node
, t
);
1240 return build_vec_delete (t
, maxindex
, integer_one_node
,
1241 integer_zero_node
, use_global_delete
);
1244 if (IS_AGGR_TYPE (TREE_TYPE (type
))
1245 && TYPE_GETS_REG_DELETE (TREE_TYPE (type
)))
1247 /* Only do access checking here; we'll be calling op delete
1248 from the destructor. */
1249 tree tmp
= build_op_delete_call (DELETE_EXPR
, t
, size_zero_node
,
1250 LOOKUP_NORMAL
, NULL_TREE
);
1251 if (tmp
== error_mark_node
)
1252 return error_mark_node
;
1255 return build_delete (type
, t
, integer_three_node
,
1256 LOOKUP_NORMAL
, use_global_delete
);
1260 /* Report an error if the indicated template declaration is not the
1261 sort of thing that should be a member template. */
1264 check_member_template (tmpl
)
1269 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
1270 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1272 if (TREE_CODE (decl
) == FUNCTION_DECL
1273 || (TREE_CODE (decl
) == TYPE_DECL
1274 && IS_AGGR_TYPE (TREE_TYPE (decl
))))
1276 if (current_function_decl
)
1277 /* 14.5.2.2 [temp.mem]
1279 A local class shall not have member templates. */
1280 cp_error ("declaration of member template `%#D' in local class",
1283 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
1285 /* 14.5.2.3 [temp.mem]
1287 A member function template shall not be virtual. */
1289 ("invalid use of `virtual' in template declaration of `%#D'",
1291 DECL_VIRTUAL_P (decl
) = 0;
1294 /* The debug-information generating code doesn't know what to do
1295 with member templates. */
1296 DECL_IGNORED_P (tmpl
) = 1;
1299 cp_error ("template declaration of `%#D'", decl
);
1302 /* Return true iff TYPE is a valid Java parameter or return type. */
1305 acceptable_java_type (type
)
1308 if (TREE_CODE (type
) == VOID_TYPE
|| TYPE_FOR_JAVA (type
))
1310 if (TREE_CODE (type
) == POINTER_TYPE
)
1312 type
= TREE_TYPE (type
);
1313 if (TREE_CODE (type
) == RECORD_TYPE
)
1316 if (! TYPE_FOR_JAVA (type
))
1318 if (! CLASSTYPE_TEMPLATE_INFO (type
))
1320 args
= CLASSTYPE_TI_ARGS (type
);
1321 i
= TREE_VEC_LENGTH (args
);
1324 type
= TREE_VEC_ELT (args
, i
);
1325 if (TREE_CODE (type
) == POINTER_TYPE
)
1326 type
= TREE_TYPE (type
);
1327 if (! TYPE_FOR_JAVA (type
))
1336 /* For a METHOD in a Java class CTYPE, return 1 if
1337 the parameter and return types are valid Java types.
1338 Otherwise, print appropriate error messages, and return 0. */
1341 check_java_method (method
)
1345 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (method
));
1346 tree ret_type
= TREE_TYPE (TREE_TYPE (method
));
1347 if (! acceptable_java_type (ret_type
))
1349 cp_error ("Java method '%D' has non-Java return type `%T'",
1353 for (; arg_types
!= NULL_TREE
; arg_types
= TREE_CHAIN (arg_types
))
1355 tree type
= TREE_VALUE (arg_types
);
1356 if (! acceptable_java_type (type
))
1358 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1363 return jerr
? 0 : 1;
1366 /* Sanity check: report error if this function FUNCTION is not
1367 really a member of the class (CTYPE) it is supposed to belong to.
1368 CNAME is the same here as it is for grokclassfn above. */
1371 check_classfn (ctype
, function
)
1372 tree ctype
, function
;
1374 tree fn_name
= DECL_NAME (function
);
1375 tree fndecl
, fndecls
;
1376 tree method_vec
= CLASSTYPE_METHOD_VEC (complete_type (ctype
));
1380 if (DECL_USE_TEMPLATE (function
)
1381 && is_member_template (DECL_TI_TEMPLATE (function
)))
1382 /* Since this is a specialization of a member template,
1383 we're not going to find the declaration in the class.
1386 struct S { template <typename T> void f(T); };
1387 template <> void S::f(int);
1389 we're not going to find `S::f(int)', but there's no
1390 reason we should, either. We let our callers know we didn't
1391 find the method, but we don't complain. */
1394 if (method_vec
!= 0)
1396 methods
= &TREE_VEC_ELT (method_vec
, 0);
1397 end
= TREE_VEC_END (method_vec
);
1399 /* First suss out ctors and dtors. */
1400 if (*methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1401 && DECL_CONSTRUCTOR_P (function
))
1403 if (*++methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1404 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
)))
1407 while (++methods
!= end
&& *methods
)
1410 if (fn_name
== DECL_NAME (OVL_CURRENT (*methods
)))
1413 for (fndecls
= *methods
; fndecls
!= NULL_TREE
;
1414 fndecls
= OVL_NEXT (fndecls
))
1416 fndecl
= OVL_CURRENT (fndecls
);
1417 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1418 for a for member function of a template class, is
1419 not mangled, so the check below does not work
1420 correctly in that case. Since mangled destructor
1421 names do not include the type of the arguments,
1422 we can't use this short-cut for them, either.
1423 (It's not legal to declare arguments for a
1424 destructor, but some people try.) */
1425 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
))
1426 && (DECL_ASSEMBLER_NAME (function
)
1427 != DECL_NAME (function
))
1428 && (DECL_ASSEMBLER_NAME (fndecl
)
1429 != DECL_NAME (fndecl
))
1430 && (DECL_ASSEMBLER_NAME (function
)
1431 == DECL_ASSEMBLER_NAME (fndecl
)))
1434 /* We cannot simply call decls_match because this
1435 doesn't work for static member functions that are
1436 pretending to be methods, and because the name
1437 may have been changed by asm("new_name"). */
1438 if (DECL_NAME (function
) == DECL_NAME (fndecl
))
1440 tree p1
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1441 tree p2
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1443 /* Get rid of the this parameter on functions that become
1445 if (DECL_STATIC_FUNCTION_P (fndecl
)
1446 && TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1447 p1
= TREE_CHAIN (p1
);
1449 if (same_type_p (TREE_TYPE (TREE_TYPE (function
)),
1450 TREE_TYPE (TREE_TYPE (fndecl
)))
1451 && compparms (p1
, p2
)
1452 && (DECL_TEMPLATE_SPECIALIZATION (function
)
1453 == DECL_TEMPLATE_SPECIALIZATION (fndecl
))
1454 && (!DECL_TEMPLATE_SPECIALIZATION (function
)
1455 || (DECL_TI_TEMPLATE (function
)
1456 == DECL_TI_TEMPLATE (fndecl
))))
1465 if (methods
!= end
&& *methods
)
1467 tree fndecl
= *methods
;
1468 cp_error ("prototype for `%#D' does not match any in class `%T'",
1470 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl
) ? "s are" : " is",
1471 OVL_CURRENT (fndecl
));
1472 while (fndecl
= OVL_NEXT (fndecl
), fndecl
)
1473 cp_error_at (" %#D", OVL_CURRENT(fndecl
));
1478 if (TYPE_SIZE (ctype
) == 0)
1479 incomplete_type_error (function
, ctype
);
1481 cp_error ("no `%#D' member function declared in class `%T'",
1485 /* If we did not find the method in the class, add it to avoid
1486 spurious errors (unless the CTYPE is not yet defined, in which
1487 case we'll only confuse ourselves when the function is declared
1488 properly within the class. */
1489 if (TYPE_SIZE (ctype
))
1490 add_method (ctype
, methods
, function
);
1494 /* We have just processed the DECL, which is a static data member.
1495 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1496 present, is the assembly-language name for the data member.
1497 NEED_POP and FLAGS are as for cp_finish_decl. */
1500 finish_static_data_member_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
1507 const char *asmspec
= 0;
1510 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1512 my_friendly_assert (TREE_PUBLIC (decl
), 0);
1514 /* We cannot call pushdecl here, because that would fill in the
1515 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1516 the right thing, namely, to put this decl out straight away. */
1517 /* current_class_type can be NULL_TREE in case of error. */
1518 if (!asmspec
&& current_class_type
)
1520 DECL_INITIAL (decl
) = error_mark_node
;
1521 DECL_ASSEMBLER_NAME (decl
)
1522 = build_static_name (current_class_type
, DECL_NAME (decl
));
1524 if (! processing_template_decl
)
1526 if (!pending_statics
)
1527 VARRAY_TREE_INIT (pending_statics
, 32, "pending_statics");
1529 if (pending_statics_used
== pending_statics
->num_elements
)
1530 VARRAY_GROW (pending_statics
,
1531 2 * pending_statics
->num_elements
);
1532 VARRAY_TREE (pending_statics
, pending_statics_used
) = decl
;
1533 ++pending_statics_used
;
1536 /* Static consts need not be initialized in the class definition. */
1537 if (init
!= NULL_TREE
&& TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
1539 static int explanation
= 0;
1541 error ("initializer invalid for static member with constructor");
1542 if (explanation
++ == 0)
1543 error ("(you really want to initialize it separately)");
1546 /* Force the compiler to know when an uninitialized static const
1547 member is being used. */
1548 if (CP_TYPE_CONST_P (TREE_TYPE (decl
)) && init
== 0)
1549 TREE_USED (decl
) = 1;
1550 DECL_INITIAL (decl
) = init
;
1551 DECL_IN_AGGR_P (decl
) = 1;
1552 DECL_CONTEXT (decl
) = current_class_type
;
1553 DECL_CLASS_CONTEXT (decl
) = current_class_type
;
1555 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
);
1558 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1559 of a structure component, returning a FIELD_DECL node.
1560 QUALS is a list of type qualifiers for this decl (such as for declaring
1561 const member functions).
1563 This is done during the parsing of the struct declaration.
1564 The FIELD_DECL nodes are chained together and the lot of them
1565 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1569 If class A defines that certain functions in class B are friends, then
1570 the way I have set things up, it is B who is interested in permission
1571 granted by A. However, it is in A's context that these declarations
1572 are parsed. By returning a void_type_node, class A does not attempt
1573 to incorporate the declarations of the friends within its structure.
1575 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1576 CHANGES TO CODE IN `start_method'. */
1579 grokfield (declarator
, declspecs
, init
, asmspec_tree
, attrlist
)
1580 tree declarator
, declspecs
, init
, asmspec_tree
, attrlist
;
1582 register tree value
;
1583 const char *asmspec
= 0;
1584 int flags
= LOOKUP_ONLYCONVERTING
;
1586 /* Convert () initializers to = initializers. */
1587 if (init
== NULL_TREE
&& declarator
!= NULL_TREE
1588 && TREE_CODE (declarator
) == CALL_EXPR
1589 && TREE_OPERAND (declarator
, 0)
1590 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) == IDENTIFIER_NODE
1591 || TREE_CODE (TREE_OPERAND (declarator
, 0)) == SCOPE_REF
)
1592 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator
)))
1594 init
= TREE_OPERAND (declarator
, 1);
1595 declarator
= TREE_OPERAND (declarator
, 0);
1599 if (declspecs
== NULL_TREE
1600 && TREE_CODE (declarator
) == SCOPE_REF
1601 && TREE_CODE (TREE_OPERAND (declarator
, 1)) == IDENTIFIER_NODE
)
1603 /* Access declaration */
1604 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator
, 0))))
1606 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
1607 pop_nested_class ();
1608 return do_class_using_decl (declarator
);
1612 && TREE_CODE (init
) == TREE_LIST
1613 && TREE_VALUE (init
) == error_mark_node
1614 && TREE_CHAIN (init
) == NULL_TREE
)
1617 value
= grokdeclarator (declarator
, declspecs
, FIELD
, init
!= 0, attrlist
);
1618 if (! value
|| value
== error_mark_node
)
1619 /* friend or constructor went bad. */
1622 /* Pass friendly classes back. */
1623 if (TREE_CODE (value
) == VOID_TYPE
)
1624 return void_type_node
;
1626 if (DECL_NAME (value
) != NULL_TREE
1627 && IDENTIFIER_POINTER (DECL_NAME (value
))[0] == '_'
1628 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value
)), "_vptr"))
1629 cp_error ("member `%D' conflicts with virtual function table field name",
1632 /* Stash away type declarations. */
1633 if (TREE_CODE (value
) == TYPE_DECL
)
1635 DECL_NONLOCAL (value
) = 1;
1636 DECL_CONTEXT (value
) = current_class_type
;
1637 DECL_CLASS_CONTEXT (value
) = current_class_type
;
1639 /* Now that we've updated the context, we need to remangle the
1640 name for this TYPE_DECL. */
1641 DECL_ASSEMBLER_NAME (value
) = DECL_NAME (value
);
1642 if (!uses_template_parms (value
))
1643 DECL_ASSEMBLER_NAME (value
) =
1644 get_identifier (build_overload_name (TREE_TYPE (value
), 1, 1));
1646 if (processing_template_decl
)
1647 value
= push_template_decl (value
);
1652 if (DECL_IN_AGGR_P (value
))
1654 cp_error ("`%D' is already defined in `%T'", value
,
1655 DECL_CONTEXT (value
));
1656 return void_type_node
;
1660 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1664 if (TREE_CODE (value
) == FUNCTION_DECL
)
1666 grok_function_init (value
, init
);
1669 else if (pedantic
&& TREE_CODE (value
) != VAR_DECL
)
1670 /* Already complained in grokdeclarator. */
1674 /* We allow initializers to become parameters to base
1676 if (TREE_CODE (init
) == TREE_LIST
)
1678 if (TREE_CHAIN (init
) == NULL_TREE
)
1679 init
= TREE_VALUE (init
);
1681 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1684 if (TREE_CODE (init
) == CONST_DECL
)
1685 init
= DECL_INITIAL (init
);
1686 else if (TREE_READONLY_DECL_P (init
))
1687 init
= decl_constant_value (init
);
1688 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1689 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1690 my_friendly_assert (TREE_PERMANENT (init
), 192);
1691 if (init
== error_mark_node
)
1692 /* We must make this look different than `error_mark_node'
1693 because `decl_const_value' would mis-interpret it
1694 as only meaning that this VAR_DECL is defined. */
1695 init
= build1 (NOP_EXPR
, TREE_TYPE (value
), init
);
1696 else if (processing_template_decl
)
1698 else if (! TREE_CONSTANT (init
))
1700 /* We can allow references to things that are effectively
1701 static, since references are initialized with the address. */
1702 if (TREE_CODE (TREE_TYPE (value
)) != REFERENCE_TYPE
1703 || (TREE_STATIC (init
) == 0
1704 && (TREE_CODE_CLASS (TREE_CODE (init
)) != 'd'
1705 || DECL_EXTERNAL (init
) == 0)))
1707 error ("field initializer is not constant");
1708 init
= error_mark_node
;
1714 /* The corresponding pop_obstacks is in cp_finish_decl. */
1715 push_obstacks_nochange ();
1717 if (processing_template_decl
&& ! current_function_decl
1718 && (TREE_CODE (value
) == VAR_DECL
|| TREE_CODE (value
) == FUNCTION_DECL
))
1719 value
= push_template_decl (value
);
1722 cplus_decl_attributes (value
, TREE_PURPOSE (attrlist
),
1723 TREE_VALUE (attrlist
));
1725 if (TREE_CODE (value
) == VAR_DECL
)
1727 finish_static_data_member_decl (value
, init
, asmspec_tree
,
1728 /*need_pop=*/1, flags
);
1731 if (TREE_CODE (value
) == FIELD_DECL
)
1735 /* This must override the asm specifier which was placed
1736 by grokclassfn. Lay this out fresh. */
1737 DECL_RTL (value
) = NULL_RTX
;
1738 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1740 if (DECL_INITIAL (value
) == error_mark_node
)
1741 init
= error_mark_node
;
1742 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1743 DECL_INITIAL (value
) = init
;
1744 DECL_IN_AGGR_P (value
) = 1;
1747 if (TREE_CODE (value
) == FUNCTION_DECL
)
1751 /* This must override the asm specifier which was placed
1752 by grokclassfn. Lay this out fresh. */
1753 DECL_RTL (value
) = NULL_RTX
;
1754 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1756 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1758 /* Pass friends back this way. */
1759 if (DECL_FRIEND_P (value
))
1760 return void_type_node
;
1762 DECL_IN_AGGR_P (value
) = 1;
1765 my_friendly_abort (21);
1770 /* Like `grokfield', but for bitfields.
1771 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1774 grokbitfield (declarator
, declspecs
, width
)
1775 tree declarator
, declspecs
, width
;
1777 register tree value
= grokdeclarator (declarator
, declspecs
, BITFIELD
,
1780 if (! value
) return NULL_TREE
; /* friends went bad. */
1782 /* Pass friendly classes back. */
1783 if (TREE_CODE (value
) == VOID_TYPE
)
1784 return void_type_node
;
1786 if (TREE_CODE (value
) == TYPE_DECL
)
1788 cp_error ("cannot declare `%D' to be a bitfield type", value
);
1792 /* Usually, finish_struct_1 catches bitifields with invalid types.
1793 But, in the case of bitfields with function type, we confuse
1794 ourselves into thinking they are member functions, so we must
1796 if (TREE_CODE (value
) == FUNCTION_DECL
)
1798 cp_error ("cannot declare bitfield `%D' with funcion type",
1803 if (DECL_IN_AGGR_P (value
))
1805 cp_error ("`%D' is already defined in the class %T", value
,
1806 DECL_CONTEXT (value
));
1807 return void_type_node
;
1810 GNU_xref_member (current_class_name
, value
);
1812 if (TREE_STATIC (value
))
1814 cp_error ("static member `%D' cannot be a bitfield", value
);
1817 cp_finish_decl (value
, NULL_TREE
, NULL_TREE
, 0, 0);
1819 if (width
!= error_mark_node
)
1821 constant_expression_warning (width
);
1822 DECL_INITIAL (value
) = width
;
1823 SET_DECL_C_BIT_FIELD (value
);
1826 DECL_IN_AGGR_P (value
) = 1;
1831 grokoptypename (declspecs
, declarator
)
1832 tree declspecs
, declarator
;
1834 tree t
= grokdeclarator (declarator
, declspecs
, TYPENAME
, 0, NULL_TREE
);
1835 return build_typename_overload (t
);
1838 /* When a function is declared with an initializer,
1839 do the right thing. Currently, there are two possibilities:
1844 // initialization possibility #1.
1845 virtual void f () = 0;
1867 // initialization possibility #2
1874 copy_assignment_arg_p (parmtype
, virtualp
)
1876 int virtualp ATTRIBUTE_UNUSED
;
1878 if (current_class_type
== NULL_TREE
)
1881 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
1882 parmtype
= TREE_TYPE (parmtype
);
1884 if ((TYPE_MAIN_VARIANT (parmtype
) == current_class_type
)
1886 /* Non-standard hack to support old Booch components. */
1887 || (! virtualp
&& DERIVED_FROM_P (parmtype
, current_class_type
))
1896 grok_function_init (decl
, init
)
1900 /* An initializer for a function tells how this function should
1902 tree type
= TREE_TYPE (decl
);
1904 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1905 cp_error ("initializer specified for non-member function `%D'", decl
);
1907 /* We'll check for this in finish_struct_1. */
1908 else if (DECL_VINDEX (decl
) == NULL_TREE
)
1909 cp_error ("initializer specified for non-virtual method `%D'", decl
);
1911 else if (integer_zerop (init
))
1914 /* Mark this function as being "defined". */
1915 DECL_INITIAL (decl
) = error_mark_node
;
1916 /* pure virtual destructors must be defined. */
1917 /* pure virtual needs to be defined (as abort) only when put in
1918 vtbl. For wellformed call, it should be itself. pr4737 */
1919 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl
)))
1921 extern tree abort_fndecl
;
1922 /* Give this node rtl from `abort'. */
1923 DECL_RTL (decl
) = DECL_RTL (abort_fndecl
);
1926 DECL_ABSTRACT_VIRTUAL_P (decl
) = 1;
1927 if (DECL_NAME (decl
) == ansi_opname
[(int) MODIFY_EXPR
])
1930 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
))));
1932 if (copy_assignment_arg_p (parmtype
, 1))
1933 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type
) = 1;
1937 cp_error ("invalid initializer for virtual method `%D'", decl
);
1941 cplus_decl_attributes (decl
, attributes
, prefix_attributes
)
1942 tree decl
, attributes
, prefix_attributes
;
1944 if (decl
== NULL_TREE
|| decl
== void_type_node
)
1947 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
1948 decl
= DECL_TEMPLATE_RESULT (decl
);
1950 decl_attributes (decl
, attributes
, prefix_attributes
);
1952 if (TREE_CODE (decl
) == TYPE_DECL
)
1953 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl
), TREE_TYPE (decl
));
1956 /* CONSTRUCTOR_NAME:
1957 Return the name for the constructor (or destructor) for the
1958 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1959 IDENTIFIER_NODE. When given a template, this routine doesn't
1960 lose the specialization. */
1963 constructor_name_full (thing
)
1966 if (TREE_CODE (thing
) == TEMPLATE_TYPE_PARM
1967 || TREE_CODE (thing
) == TEMPLATE_TEMPLATE_PARM
1968 || TREE_CODE (thing
) == TYPENAME_TYPE
)
1969 thing
= TYPE_NAME (thing
);
1970 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing
)))
1972 if (TYPE_WAS_ANONYMOUS (thing
) && TYPE_HAS_CONSTRUCTOR (thing
))
1973 thing
= DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing
), 0)));
1975 thing
= TYPE_NAME (thing
);
1977 if (TREE_CODE (thing
) == TYPE_DECL
1978 || (TREE_CODE (thing
) == TEMPLATE_DECL
1979 && TREE_CODE (DECL_TEMPLATE_RESULT (thing
)) == TYPE_DECL
))
1980 thing
= DECL_NAME (thing
);
1981 my_friendly_assert (TREE_CODE (thing
) == IDENTIFIER_NODE
, 197);
1985 /* CONSTRUCTOR_NAME:
1986 Return the name for the constructor (or destructor) for the
1987 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1988 IDENTIFIER_NODE. When given a template, return the plain
1989 unspecialized name. */
1992 constructor_name (thing
)
1996 thing
= constructor_name_full (thing
);
1997 t
= IDENTIFIER_TEMPLATE (thing
);
2003 /* Record the existence of an addressable inline function. */
2006 mark_inline_for_output (decl
)
2009 decl
= DECL_MAIN_VARIANT (decl
);
2010 if (DECL_SAVED_INLINE (decl
))
2012 my_friendly_assert (TREE_PERMANENT (decl
), 363);
2013 DECL_SAVED_INLINE (decl
) = 1;
2015 VARRAY_TREE_INIT (saved_inlines
, 32, "saved_inlines");
2017 if (saved_inlines_used
== saved_inlines
->num_elements
)
2018 VARRAY_GROW (saved_inlines
,
2019 2 * saved_inlines
->num_elements
);
2020 VARRAY_TREE (saved_inlines
, saved_inlines_used
) = decl
;
2021 ++saved_inlines_used
;
2027 temp_name_counter
= 0;
2030 /* Hand off a unique name which can be used for variable we don't really
2031 want to know about anyway, for example, the anonymous variables which
2032 are needed to make references work. Declare this thing so we can use it.
2033 The variable created will be of type TYPE.
2035 STATICP is nonzero if this variable should be static. */
2038 get_temp_name (type
, staticp
)
2042 char buf
[sizeof (AUTO_TEMP_FORMAT
) + 20];
2044 int toplev
= toplevel_bindings_p ();
2046 push_obstacks_nochange ();
2047 if (toplev
|| staticp
)
2049 end_temporary_allocation ();
2050 sprintf (buf
, AUTO_TEMP_FORMAT
, global_temp_name_counter
++);
2051 decl
= pushdecl_top_level (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2055 sprintf (buf
, AUTO_TEMP_FORMAT
, temp_name_counter
++);
2056 decl
= pushdecl (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2058 TREE_USED (decl
) = 1;
2059 TREE_STATIC (decl
) = staticp
;
2060 DECL_ARTIFICIAL (decl
) = 1;
2062 /* If this is a local variable, then lay out its rtl now.
2063 Otherwise, callers of this function are responsible for dealing
2064 with this variable's rtl. */
2068 my_friendly_assert (DECL_INITIAL (decl
) == NULL_TREE
,
2076 /* Hunts through the global anonymous union ANON_DECL, building
2077 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2078 returns a VAR_DECL whose size is the same as the size of the
2079 ANON_DECL, if one is available. */
2082 build_anon_union_vars (anon_decl
, elems
, static_p
, external_p
)
2088 tree type
= TREE_TYPE (anon_decl
);
2089 tree main_decl
= NULL_TREE
;
2092 /* Rather than write the code to handle the non-union case,
2093 just give an error. */
2094 if (TREE_CODE (type
) != UNION_TYPE
)
2095 error ("anonymous struct not inside named type");
2097 for (field
= TYPE_FIELDS (type
);
2099 field
= TREE_CHAIN (field
))
2103 if (DECL_ARTIFICIAL (field
))
2105 if (TREE_CODE (field
) != FIELD_DECL
)
2107 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2112 if (TREE_PRIVATE (field
))
2113 cp_pedwarn_at ("private member `%#D' in anonymous union", field
);
2114 else if (TREE_PROTECTED (field
))
2115 cp_pedwarn_at ("protected member `%#D' in anonymous union", field
);
2117 if (DECL_NAME (field
) == NULL_TREE
2118 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2120 decl
= build_anon_union_vars (field
, elems
, static_p
, external_p
);
2124 else if (DECL_NAME (field
) == NULL_TREE
)
2128 decl
= build_decl (VAR_DECL
, DECL_NAME (field
), TREE_TYPE (field
));
2129 /* tell `pushdecl' that this is not tentative. */
2130 DECL_INITIAL (decl
) = error_mark_node
;
2131 TREE_PUBLIC (decl
) = 0;
2132 TREE_STATIC (decl
) = static_p
;
2133 DECL_EXTERNAL (decl
) = external_p
;
2134 decl
= pushdecl (decl
);
2135 DECL_INITIAL (decl
) = NULL_TREE
;
2138 /* Only write out one anon union element--choose the one that
2139 can hold them all. */
2140 if (main_decl
== NULL_TREE
2141 && simple_cst_equal (DECL_SIZE (decl
),
2142 DECL_SIZE (anon_decl
)) == 1)
2145 /* ??? This causes there to be no debug info written out
2147 TREE_ASM_WRITTEN (decl
) = 1;
2149 if (DECL_NAME (field
) == NULL_TREE
2150 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2151 /* The remainder of the processing was already done in the
2155 /* If there's a cleanup to do, it belongs in the
2156 TREE_PURPOSE of the following TREE_LIST. */
2157 *elems
= scratch_tree_cons (NULL_TREE
, decl
, *elems
);
2158 TREE_TYPE (*elems
) = type
;
2164 /* Finish off the processing of a UNION_TYPE structure.
2165 If there are static members, then all members are
2166 static, and must be laid out together. If the
2167 union is an anonymous union, we arrange for that
2168 as well. PUBLIC_P is nonzero if this union is
2169 not declared static. */
2172 finish_anon_union (anon_union_decl
)
2173 tree anon_union_decl
;
2175 tree type
= TREE_TYPE (anon_union_decl
);
2176 tree elems
= NULL_TREE
;
2178 int public_p
= TREE_PUBLIC (anon_union_decl
);
2179 int static_p
= TREE_STATIC (anon_union_decl
);
2180 int external_p
= DECL_EXTERNAL (anon_union_decl
);
2182 if (TYPE_FIELDS (type
) == NULL_TREE
)
2187 error ("global anonymous unions must be declared static");
2191 main_decl
= build_anon_union_vars (anon_union_decl
, &elems
,
2192 static_p
, external_p
);
2194 if (main_decl
== NULL_TREE
)
2196 warning ("anonymous union with no members");
2202 make_decl_rtl (main_decl
, 0, toplevel_bindings_p ());
2203 DECL_RTL (anon_union_decl
) = DECL_RTL (main_decl
);
2206 /* The following call assumes that there are never any cleanups
2207 for anonymous unions--a reasonable assumption. */
2208 expand_anon_union_decl (anon_union_decl
, NULL_TREE
, elems
);
2211 /* Finish processing a builtin type TYPE. It's name is NAME,
2212 its fields are in the array FIELDS. LEN is the number of elements
2213 in FIELDS minus one, or put another way, it is the maximum subscript
2216 It is given the same alignment as ALIGN_TYPE. */
2219 finish_builtin_type (type
, name
, fields
, len
, align_type
)
2228 TYPE_FIELDS (type
) = fields
[0];
2229 for (i
= 0; i
< len
; i
++)
2231 layout_type (TREE_TYPE (fields
[i
]));
2232 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2233 TREE_CHAIN (fields
[i
]) = fields
[i
+1];
2235 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2236 DECL_CLASS_CONTEXT (fields
[i
]) = type
;
2237 TYPE_ALIGN (type
) = TYPE_ALIGN (align_type
);
2239 #if 0 /* not yet, should get fixed properly later */
2240 TYPE_NAME (type
) = make_type_decl (get_identifier (name
), type
);
2242 TYPE_NAME (type
) = build_decl (TYPE_DECL
, get_identifier (name
), type
);
2244 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2245 layout_decl (TYPE_NAME (type
), 0);
2248 /* Auxiliary functions to make type signatures for
2249 `operator new' and `operator delete' correspond to
2250 what compiler will be expecting. */
2253 coerce_new_type (type
)
2258 if (TREE_CODE (type
) == METHOD_TYPE
)
2259 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (TYPE_ARG_TYPES (type
)));
2260 if (! same_type_p (TREE_TYPE (type
), ptr_type_node
))
2261 e1
= 1, error ("`operator new' must return type `void *'");
2263 /* Technically the type must be `size_t', but we may not know
2265 if (TYPE_ARG_TYPES (type
) == NULL_TREE
)
2266 e1
= 1, error ("`operator new' takes type `size_t' parameter");
2267 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type
)), sizetype
))
2268 e2
= 1, error ("`operator new' takes type `size_t' as first parameter");
2270 type
= build_function_type (ptr_type_node
, tree_cons (NULL_TREE
, sizetype
, TREE_CHAIN (TYPE_ARG_TYPES (type
))));
2272 type
= build_function_type (ptr_type_node
, TYPE_ARG_TYPES (type
));
2277 coerce_delete_type (type
)
2284 tree arg_types
= TYPE_ARG_TYPES (type
);
2286 if (TREE_CODE (type
) == METHOD_TYPE
)
2288 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (arg_types
));
2289 arg_types
= TREE_CHAIN (arg_types
);
2292 if (TREE_TYPE (type
) != void_type_node
)
2293 e1
= 1, error ("`operator delete' must return type `void'");
2295 if (arg_types
== NULL_TREE
2296 || ! same_type_p (TREE_VALUE (arg_types
), ptr_type_node
))
2297 e2
= 1, error ("`operator delete' takes type `void *' as first parameter");
2301 && TREE_CHAIN (arg_types
)
2302 && TREE_CHAIN (arg_types
) != void_list_node
)
2304 /* Again, technically this argument must be `size_t', but again
2305 we may not know what that is. */
2306 tree t2
= TREE_VALUE (TREE_CHAIN (arg_types
));
2307 if (! same_type_p (t2
, sizetype
))
2308 e3
= 1, error ("second argument to `operator delete' must be of type `size_t'");
2309 else if (TREE_CHAIN (TREE_CHAIN (arg_types
)) != void_list_node
)
2312 if (TREE_CHAIN (TREE_CHAIN (arg_types
)))
2313 error ("too many arguments in declaration of `operator delete'");
2315 error ("`...' invalid in specification of `operator delete'");
2320 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2321 build_tree_list (NULL_TREE
, sizetype
));
2324 if (arg_types
== NULL_TREE
)
2325 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
2327 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, TREE_CHAIN (arg_types
));
2333 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2334 arg_types
? TREE_CHAIN (arg_types
): NULL_TREE
);
2336 type
= build_function_type (void_type_node
, arg_types
);
2342 mark_vtable_entries (decl
)
2345 tree entries
= CONSTRUCTOR_ELTS (DECL_INITIAL (decl
));
2347 for (; entries
; entries
= TREE_CHAIN (entries
))
2352 fnaddr
= (flag_vtable_thunks
? TREE_VALUE (entries
)
2353 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries
)));
2355 if (TREE_CODE (fnaddr
) == NOP_EXPR
)
2359 fn
= TREE_OPERAND (fnaddr
, 0);
2360 TREE_ADDRESSABLE (fn
) = 1;
2361 if (TREE_CODE (fn
) == THUNK_DECL
&& DECL_EXTERNAL (fn
))
2363 DECL_EXTERNAL (fn
) = 0;
2370 /* Set DECL up to have the closest approximation of "initialized common"
2371 linkage available. */
2374 comdat_linkage (decl
)
2378 make_decl_one_only (decl
);
2379 else if (TREE_CODE (decl
) == FUNCTION_DECL
|| DECL_VIRTUAL_P (decl
))
2380 /* We can just emit functions and vtables statically; it doesn't really
2381 matter if we have multiple copies. */
2382 TREE_PUBLIC (decl
) = 0;
2385 /* Static data member template instantiations, however, cannot
2386 have multiple copies. */
2387 if (DECL_INITIAL (decl
) == 0
2388 || DECL_INITIAL (decl
) == error_mark_node
)
2389 DECL_COMMON (decl
) = 1;
2390 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
2392 DECL_COMMON (decl
) = 1;
2393 DECL_INITIAL (decl
) = error_mark_node
;
2397 /* We can't do anything useful; leave vars for explicit
2399 DECL_EXTERNAL (decl
) = 1;
2400 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2404 if (DECL_LANG_SPECIFIC (decl
))
2405 DECL_COMDAT (decl
) = 1;
2408 /* For win32 we also want to put explicit instantiations in
2409 linkonce sections, so that they will be merged with implicit
2410 instantiations; otherwise we get duplicate symbol errors. */
2413 maybe_make_one_only (decl
)
2416 /* This is not necessary on targets that support weak symbols, because
2417 the implicit instantiations will defer to the explicit one. */
2418 if (! supports_one_only () || SUPPORTS_WEAK
)
2421 /* We can't set DECL_COMDAT on functions, or finish_file will think
2422 we can get away with not emitting them if they aren't used. We need
2423 to for variables so that cp_finish_decl will update their linkage,
2424 because their DECL_INITIAL may not have been set properly yet. */
2426 make_decl_one_only (decl
);
2428 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_LANG_SPECIFIC (decl
))
2429 DECL_COMDAT (decl
) = 1;
2432 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2433 based on TYPE and other static flags.
2435 Note that anything public is tagged TREE_PUBLIC, whether
2436 it's public in this file or in another one. */
2439 import_export_vtable (decl
, type
, final
)
2443 if (DECL_INTERFACE_KNOWN (decl
))
2446 if (TYPE_FOR_JAVA (type
))
2448 TREE_PUBLIC (decl
) = 1;
2449 DECL_EXTERNAL (decl
) = 1;
2450 DECL_INTERFACE_KNOWN (decl
) = 1;
2452 else if (CLASSTYPE_INTERFACE_KNOWN (type
))
2454 TREE_PUBLIC (decl
) = 1;
2455 DECL_EXTERNAL (decl
) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type
);
2456 DECL_INTERFACE_KNOWN (decl
) = 1;
2460 /* We can only wait to decide if we have real non-inline virtual
2461 functions in our class, or if we come from a template. */
2463 int found
= CLASSTYPE_TEMPLATE_INSTANTIATION (type
);
2465 if (! found
&& ! final
)
2468 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
2469 method
= TREE_CHAIN (method
))
2470 if (DECL_VINDEX (method
) != NULL_TREE
2471 && ! DECL_THIS_INLINE (method
)
2472 && ! DECL_ABSTRACT_VIRTUAL_P (method
))
2479 if (final
|| ! found
)
2481 comdat_linkage (decl
);
2482 DECL_EXTERNAL (decl
) = 0;
2486 TREE_PUBLIC (decl
) = 1;
2487 DECL_EXTERNAL (decl
) = 1;
2492 /* Determine whether or not we want to specifically import or export CTYPE,
2493 using various heuristics. */
2496 import_export_class (ctype
)
2499 /* -1 for imported, 1 for exported. */
2500 int import_export
= 0;
2502 if (CLASSTYPE_INTERFACE_KNOWN (ctype
))
2505 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2506 we will have CLASSTYPE_INTERFACE_ONLY set but not
2507 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2508 heuristic because someone will supply a #pragma implementation
2509 elsewhere, and deducing it here would produce a conflict. */
2510 if (CLASSTYPE_INTERFACE_ONLY (ctype
))
2513 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2514 /* FIXME this should really use some sort of target-independent macro. */
2515 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype
)))
2517 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype
)))
2521 /* If we got -fno-implicit-templates, we import template classes that
2522 weren't explicitly instantiated. */
2523 if (import_export
== 0
2524 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype
)
2525 && ! flag_implicit_templates
)
2528 /* Base our import/export status on that of the first non-inline,
2529 non-abstract virtual function, if any. */
2530 if (import_export
== 0
2531 && TYPE_VIRTUAL_P (ctype
)
2532 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2535 for (method
= TYPE_METHODS (ctype
); method
!= NULL_TREE
;
2536 method
= TREE_CHAIN (method
))
2538 if (DECL_VINDEX (method
) != NULL_TREE
2539 && !DECL_THIS_INLINE (method
)
2540 && !DECL_ABSTRACT_VIRTUAL_P (method
))
2542 import_export
= (DECL_REALLY_EXTERN (method
) ? -1 : 1);
2548 #ifdef MULTIPLE_SYMBOL_SPACES
2549 if (import_export
== -1)
2555 SET_CLASSTYPE_INTERFACE_KNOWN (ctype
);
2556 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype
) = (import_export
> 0);
2557 CLASSTYPE_INTERFACE_ONLY (ctype
) = (import_export
< 0);
2561 /* We need to describe to the assembler the relationship between
2562 a vtable and the vtable of the parent class. */
2565 output_vtable_inherit (vars
)
2571 op
[0] = XEXP (DECL_RTL (vars
), 0); /* strip the mem ref */
2573 parent
= binfo_for_vtable (vars
);
2575 if (parent
== TYPE_BINFO (DECL_CONTEXT (vars
)))
2579 parent
= TYPE_BINFO_VTABLE (BINFO_TYPE (parent
));
2580 op
[1] = XEXP (DECL_RTL (parent
), 0); /* strip the mem ref */
2583 my_friendly_abort (980826);
2585 output_asm_insn (".vtable_inherit %c0, %c1", op
);
2589 finish_vtable_vardecl (t
, data
)
2591 void *data ATTRIBUTE_UNUSED
;
2594 tree ctype
= DECL_CONTEXT (vars
);
2595 import_export_class (ctype
);
2596 import_export_vtable (vars
, ctype
, 1);
2598 if (! DECL_EXTERNAL (vars
)
2599 && (DECL_INTERFACE_KNOWN (vars
)
2600 || TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (vars
))
2601 || (hack_decl_function_context (vars
) && TREE_USED (vars
)))
2602 && ! TREE_ASM_WRITTEN (vars
))
2605 mark_vtable_entries (vars
);
2606 if (TREE_TYPE (DECL_INITIAL (vars
)) == 0)
2607 store_init_value (vars
, DECL_INITIAL (vars
));
2609 if (write_symbols
== DWARF_DEBUG
|| write_symbols
== DWARF2_DEBUG
)
2611 /* Mark the VAR_DECL node representing the vtable itself as a
2612 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2613 It is rather important that such things be ignored because
2614 any effort to actually generate DWARF for them will run
2615 into trouble when/if we encounter code like:
2618 struct S { virtual void member (); };
2620 because the artificial declaration of the vtable itself (as
2621 manufactured by the g++ front end) will say that the vtable
2622 is a static member of `S' but only *after* the debug output
2623 for the definition of `S' has already been output. This causes
2624 grief because the DWARF entry for the definition of the vtable
2625 will try to refer back to an earlier *declaration* of the
2626 vtable as a static member of `S' and there won't be one.
2627 We might be able to arrange to have the "vtable static member"
2628 attached to the member list for `S' before the debug info for
2629 `S' get written (which would solve the problem) but that would
2630 require more intrusive changes to the g++ front end. */
2632 DECL_IGNORED_P (vars
) = 1;
2635 /* Always make vtables weak. */
2637 comdat_linkage (vars
);
2639 rest_of_decl_compilation (vars
, NULL_PTR
, 1, 1);
2642 output_vtable_inherit (vars
);
2646 else if (! TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (vars
)))
2647 /* We don't know what to do with this one yet. */
2650 *t
= TREE_CHAIN (vars
);
2655 prune_vtable_vardecl (t
, data
)
2657 void *data ATTRIBUTE_UNUSED
;
2659 *t
= TREE_CHAIN (*t
);
2663 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2664 inline function or template instantiation at end-of-file. */
2667 import_export_decl (decl
)
2670 if (DECL_INTERFACE_KNOWN (decl
))
2673 if (DECL_TEMPLATE_INSTANTIATION (decl
)
2674 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2676 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2677 if ((DECL_IMPLICIT_INSTANTIATION (decl
)
2678 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2679 && (flag_implicit_templates
2680 || (flag_implicit_inline_templates
&& DECL_THIS_INLINE (decl
))))
2682 if (!TREE_PUBLIC (decl
))
2683 /* Templates are allowed to have internal linkage. See
2687 comdat_linkage (decl
);
2690 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2692 else if (DECL_FUNCTION_MEMBER_P (decl
))
2694 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2695 import_export_class (ctype
);
2696 if (CLASSTYPE_INTERFACE_KNOWN (ctype
)
2698 ? (! DECL_THIS_INLINE (decl
))
2699 : (! DECL_ARTIFICIAL (decl
) || DECL_VINDEX (decl
))))
2701 DECL_NOT_REALLY_EXTERN (decl
)
2702 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2703 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2704 && !DECL_VINDEX (decl
)));
2706 /* Always make artificials weak. */
2707 if (DECL_ARTIFICIAL (decl
) && flag_weak
)
2708 comdat_linkage (decl
);
2710 maybe_make_one_only (decl
);
2713 comdat_linkage (decl
);
2715 else if (DECL_TINFO_FN_P (decl
))
2717 tree ctype
= TREE_TYPE (DECL_NAME (decl
));
2719 if (IS_AGGR_TYPE (ctype
))
2720 import_export_class (ctype
);
2722 if (IS_AGGR_TYPE (ctype
) && CLASSTYPE_INTERFACE_KNOWN (ctype
)
2723 && TYPE_VIRTUAL_P (ctype
)
2724 /* If the type is a cv-qualified variant of a type, then we
2725 must emit the tinfo function in this translation unit
2726 since it will not be emitted when the vtable for the type
2727 is output (which is when the unqualified version is
2729 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2731 DECL_NOT_REALLY_EXTERN (decl
)
2732 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2733 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2734 && !DECL_VINDEX (decl
)));
2736 /* Always make artificials weak. */
2738 comdat_linkage (decl
);
2740 else if (TYPE_BUILT_IN (ctype
)
2741 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2742 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2744 comdat_linkage (decl
);
2747 comdat_linkage (decl
);
2749 DECL_INTERFACE_KNOWN (decl
) = 1;
2753 build_cleanup (decl
)
2757 tree type
= TREE_TYPE (decl
);
2759 if (TREE_CODE (type
) == ARRAY_TYPE
)
2763 mark_addressable (decl
);
2764 temp
= build1 (ADDR_EXPR
, build_pointer_type (type
), decl
);
2766 temp
= build_delete (TREE_TYPE (temp
), temp
,
2768 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
2772 extern int parse_time
, varconst_time
;
2778 tree sname
= get_id_2 ("__sn", base
);
2779 /* For struct X foo __attribute__((weak)), there is a counter
2780 __snfoo. Since base is already an assembler name, sname should
2781 be globally unique */
2782 tree sentry
= IDENTIFIER_GLOBAL_VALUE (sname
);
2785 push_permanent_obstack ();
2786 sentry
= build_decl (VAR_DECL
, sname
, integer_type_node
);
2787 TREE_PUBLIC (sentry
) = 1;
2788 DECL_ARTIFICIAL (sentry
) = 1;
2789 TREE_STATIC (sentry
) = 1;
2790 TREE_USED (sentry
) = 1;
2791 DECL_COMMON (sentry
) = 1;
2792 pushdecl_top_level (sentry
);
2793 cp_finish_decl (sentry
, NULL_TREE
, NULL_TREE
, 0, 0);
2799 /* Start the process of running a particular set of global constructors
2800 or destructors. Subroutine of do_[cd]tors. */
2803 start_objects (method_type
, initp
)
2804 int method_type
, initp
;
2809 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2811 if (initp
!= DEFAULT_INIT_PRIORITY
)
2821 sprintf (type
, "%c%c%.5u", method_type
, joiner
, initp
);
2824 sprintf (type
, "%c", method_type
);
2826 fnname
= get_file_function_name_long (type
);
2828 start_function (void_list_node
,
2829 make_call_declarator (fnname
, void_list_node
, NULL_TREE
,
2833 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2834 /* It can be a static function as long as collect2 does not have
2835 to scan the object file to find its ctor/dtor routine. */
2836 TREE_PUBLIC (current_function_decl
) = 0;
2839 store_parm_decls ();
2843 expand_start_bindings (0);
2845 /* We cannot allow these functions to be elided, even if they do not
2846 have external linkage. And, there's no point in deferring
2847 copmilation of thes functions; they're all going to have to be
2849 current_function_cannot_inline
2850 = "static constructors and destructors cannot be inlined";
2853 /* Finish the process of running a particular set of global constructors
2854 or destructors. Subroutine of do_[cd]tors. */
2857 finish_objects (method_type
, initp
)
2858 int method_type
, initp
;
2860 char *fnname
= XSTR (XEXP (DECL_RTL (current_function_decl
), 0), 0);
2863 expand_end_bindings (getdecls (), 1, 0);
2866 finish_function (lineno
, 0, 0);
2868 if (initp
== DEFAULT_INIT_PRIORITY
)
2870 if (method_type
== 'I')
2871 assemble_constructor (fnname
);
2873 assemble_destructor (fnname
);
2876 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2877 /* If we're using init priority we can't use assemble_*tor, but on ELF
2878 targets we can stick the references into named sections for GNU ld
2883 sprintf (buf
, ".%ctors.%.5u", method_type
== 'I' ? 'c' : 'd',
2884 /* invert the numbering so the linker puts us in the proper
2885 order; constructors are run from right to left, and the
2886 linker sorts in increasing order. */
2887 MAX_INIT_PRIORITY
- initp
);
2888 named_section (NULL_TREE
, buf
, 0);
2889 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, fnname
),
2890 POINTER_SIZE
/ BITS_PER_UNIT
, 1);
2895 /* The names of the parameters to the function created to handle
2896 initializations and destructions for objects with static storage
2898 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2899 #define PRIORITY_IDENTIFIER "__priority"
2901 /* The name of the function we create to handle initializations and
2902 destructions for objects with static storage duration. */
2903 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2905 /* The declaration for the __INITIALIZE_P argument. */
2906 static tree initialize_p_decl
;
2908 /* The declaration for the __PRIORITY argument. */
2909 static tree priority_decl
;
2911 /* The declaration for the static storage duration function. */
2912 static tree ssdf_decl
;
2914 /* All the static storage duration functions created in this
2915 translation unit. */
2916 static varray_type ssdf_decls
;
2917 static size_t ssdf_decls_used
;
2919 /* A map from priority levels to information about that priority
2920 level. There may be many such levels, so efficient lookup is
2922 static splay_tree priority_info_map
;
2924 /* Begins the generation of the function that will handle all
2925 initialization and destruction of objects with static storage
2926 duration. The function generated takes two parameters of type
2927 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2928 non-zero, it performs initializations. Otherwise, it performs
2929 destructions. It only performs those initializations or
2930 destructions with the indicated __PRIORITY. The generated function
2933 It is assumed that this function will only be called once per
2934 translation unit. */
2937 start_static_storage_duration_function ()
2939 static unsigned ssdf_number
;
2943 char id
[sizeof (SSDF_IDENTIFIER
) + 1 /* '\0' */ + 32];
2945 /* Create the identifier for this function. It will be of the form
2946 SSDF_IDENTIFIER_<number>. */
2947 sprintf (id
, "%s_%u", SSDF_IDENTIFIER
, ssdf_number
++);
2948 if (ssdf_number
== 0)
2950 /* Overflow occurred. That means there are at least 4 billion
2951 initialization functions. */
2952 sorry ("too many initialization functions required");
2953 my_friendly_abort (19990430);
2956 /* Create the parameters. */
2957 parm_types
= void_list_node
;
2958 parm_types
= perm_tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
2959 parm_types
= perm_tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
2960 type
= build_function_type (void_type_node
, parm_types
);
2962 /* Create the FUNCTION_DECL itself. */
2963 ssdf_decl
= build_lang_decl (FUNCTION_DECL
,
2964 get_identifier (id
),
2966 TREE_PUBLIC (ssdf_decl
) = 0;
2967 DECL_ARTIFICIAL (ssdf_decl
) = 1;
2969 /* Put this function in the list of functions to be called from the
2970 static constructors and destructors. */
2973 VARRAY_TREE_INIT (ssdf_decls
, 32, "ssdf_decls");
2975 /* Take this opportunity to initialize the map from priority
2976 numbers to information about that priority level. */
2977 priority_info_map
= splay_tree_new (splay_tree_compare_ints
,
2978 /*delete_key_fn=*/0,
2979 /*delete_value_fn=*/
2980 (splay_tree_delete_value_fn
) &free
);
2982 /* We always need to generate functions for the
2983 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2984 priorities later, we'll be sure to find the
2985 DEFAULT_INIT_PRIORITY. */
2986 get_priority_info (DEFAULT_INIT_PRIORITY
);
2989 if (ssdf_decls_used
== ssdf_decls
->num_elements
)
2990 VARRAY_GROW (ssdf_decls
, 2 * ssdf_decls_used
);
2991 VARRAY_TREE (ssdf_decls
, ssdf_decls_used
) = ssdf_decl
;
2994 /* Create the argument list. */
2995 initialize_p_decl
= build_decl (PARM_DECL
,
2996 get_identifier (INITIALIZE_P_IDENTIFIER
),
2998 DECL_CONTEXT (initialize_p_decl
) = ssdf_decl
;
2999 DECL_ARG_TYPE (initialize_p_decl
) = integer_type_node
;
3000 TREE_USED (initialize_p_decl
) = 1;
3001 priority_decl
= build_decl (PARM_DECL
, get_identifier (PRIORITY_IDENTIFIER
),
3003 DECL_CONTEXT (priority_decl
) = ssdf_decl
;
3004 DECL_ARG_TYPE (priority_decl
) = integer_type_node
;
3005 TREE_USED (priority_decl
) = 1;
3007 TREE_CHAIN (initialize_p_decl
) = priority_decl
;
3008 DECL_ARGUMENTS (ssdf_decl
) = initialize_p_decl
;
3010 /* Start the function itself. This is equivalent to declarating the
3013 static void __ssdf (int __initialize_p, init __priority_p);
3015 It is static because we only need to call this function from the
3016 various constructor and destructor functions for this module. */
3017 start_function (/*specs=*/NULL_TREE
,
3019 /*attrs=*/NULL_TREE
,
3020 /*pre_parsed_p=*/1);
3022 /* Set up the scope of the outermost block in the function. */
3023 store_parm_decls ();
3027 expand_start_bindings (0);
3029 /* This function must not be deferred because we are depending on
3030 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3031 current_function_cannot_inline
3032 = "static storage duration functions cannot be inlined";
3035 /* Generate the initialization code for the priority indicated in N. */
3038 generate_inits_for_priority (n
, data
)
3040 void *data ATTRIBUTE_UNUSED
;
3042 int priority
= (int) n
->key
;
3043 priority_info pi
= (priority_info
) n
->value
;
3045 /* For each priority N which has been used generate code which looks
3048 if (__priority == N) {
3055 We use the sequences we've accumulated to fill in the `...'s. */
3056 expand_start_cond (build_binary_op (EQ_EXPR
,
3058 build_int_2 (priority
, 0)),
3061 /* Do the initializations. */
3062 expand_start_cond (build_binary_op (NE_EXPR
,
3066 if (pi
->initialization_sequence
)
3070 push_to_sequence (pi
->initialization_sequence
);
3071 insns
= gen_sequence ();
3075 pi
->initialization_sequence
= NULL_RTX
;
3076 pi
->initializations_p
= 1;
3079 /* Do the destructions. */
3080 expand_start_else ();
3081 if (pi
->destruction_sequence
)
3085 push_to_sequence (pi
->destruction_sequence
);
3086 insns
= gen_sequence ();
3090 pi
->destruction_sequence
= NULL_RTX
;
3091 pi
->destructions_p
= 1;
3094 /* Close out the conditionals. */
3098 /* Don't stop iterating. */
3102 /* Finish the generation of the function which performs initialization
3103 and destruction of objects with static storage duration. After
3104 this point, no more such objects can be created. */
3107 finish_static_storage_duration_function ()
3109 splay_tree_foreach (priority_info_map
,
3110 generate_inits_for_priority
,
3113 /* Close out the function. */
3114 expand_end_bindings (getdecls (), 1, 0);
3117 finish_function (lineno
, 0, 0);
3120 /* Return the information about the indicated PRIORITY level. If no
3121 code to handle this level has yet been generated, generate the
3122 appropriate prologue. */
3124 static priority_info
3125 get_priority_info (priority
)
3131 n
= splay_tree_lookup (priority_info_map
,
3132 (splay_tree_key
) priority
);
3135 /* Create a new priority information structure, and insert it
3137 pi
= (priority_info
) xmalloc (sizeof (struct priority_info_s
));
3138 pi
->initialization_sequence
= NULL_RTX
;
3139 pi
->destruction_sequence
= NULL_RTX
;
3140 pi
->initializations_p
= 0;
3141 pi
->destructions_p
= 0;
3142 splay_tree_insert (priority_info_map
,
3143 (splay_tree_key
) priority
,
3144 (splay_tree_value
) pi
);
3147 pi
= (priority_info
) n
->value
;
3152 /* Generate code to do the static initialization of DECL. The
3153 initialization is INIT. If DECL may be initialized more than once
3154 in different object files, SENTRY is the guard variable to
3155 check. PRIORITY is the priority for the initialization. */
3158 do_static_initialization (decl
, init
, sentry
, priority
)
3166 /* Get the priority information for this PRIORITY, */
3167 pi
= get_priority_info (priority
);
3168 if (!pi
->initialization_sequence
)
3171 push_to_sequence (pi
->initialization_sequence
);
3173 /* Tell the debugger that we are at the location of the static
3174 variable in question. */
3175 emit_note (input_filename
, lineno
);
3177 /* If there's a SENTRY, we only do the initialization if it is
3178 zero, i.e., if we are the first to initialize it. */
3180 expand_start_cond (build_binary_op (EQ_EXPR
,
3181 build_unary_op (PREINCREMENT_EXPR
,
3187 /* Prepare a binding level for temporaries created during the
3189 expand_start_target_temps ();
3191 if (IS_AGGR_TYPE (TREE_TYPE (decl
))
3192 || TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
3193 expand_expr (build_aggr_init (decl
, init
, 0),
3194 const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3195 else if (TREE_CODE (init
) == TREE_VEC
)
3196 expand_expr (build_vec_init (decl
, TREE_VEC_ELT (init
, 0),
3197 TREE_VEC_ELT (init
, 1),
3198 TREE_VEC_ELT (init
, 2), 0),
3199 const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3201 expand_assignment (decl
, init
, 0, 0);
3203 /* The expression might have involved increments and decrements. */
3206 /* Cleanup any temporaries needed for the initial value. */
3207 expand_end_target_temps ();
3209 /* Cleanup any deferred pops from function calls. This would be done
3210 by expand_end_cond, but we also need it when !SENTRY, since we are
3211 constructing these sequences by parts. */
3212 do_pending_stack_adjust ();
3214 /* Close the conditional opened above. */
3218 /* Save the sequence for later use. */
3219 pi
->initialization_sequence
= get_insns ();
3223 /* Generate code to do the static destruction of DECL. If DECL may be
3224 initialized more than once in different object files, SENTRY is the
3225 guard variable to check. PRIORITY is the priority for the
3229 do_static_destruction (decl
, sentry
, priority
)
3237 /* If we don't need a destructor, there's nothing to do. */
3238 if (!TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
3241 /* Get the priority information for this PRIORITY, */
3242 pi
= get_priority_info (priority
);
3243 if (!pi
->destruction_sequence
)
3246 push_to_sequence (pi
->destruction_sequence
);
3248 /* Start a new sequence to handle just this destruction. */
3251 /* Tell the debugger that we are at the location of the static
3252 variable in question. */
3253 emit_note (input_filename
, lineno
);
3255 /* If there's a SENTRY, we only do the destruction if it is one,
3256 i.e., if we are the last to destroy it. */
3258 expand_start_cond (build_binary_op (EQ_EXPR
,
3259 build_unary_op (PREDECREMENT_EXPR
,
3265 /* Actually do the destruction. */
3266 expand_expr_stmt (build_cleanup (decl
));
3268 /* Cleanup any deferred pops from function calls. This would be done
3269 by expand_end_cond, but we also need it when !SENTRY, since we are
3270 constructing these sequences by parts. */
3271 do_pending_stack_adjust ();
3273 /* Close the conditional opened above. */
3277 /* Insert the NEW_INSNS before the current insns. (Destructions are
3278 run in reverse order of initializations.) */
3279 new_insns
= gen_sequence ();
3281 if (pi
->destruction_sequence
)
3282 emit_insn_before (new_insns
, pi
->destruction_sequence
);
3284 emit_insn (new_insns
);
3286 /* Save the sequence for later use. */
3287 pi
->destruction_sequence
= get_insns ();
3291 /* Add code to the static storage duration function that will handle
3292 DECL (a static variable that needs initializing and/or destruction)
3293 with the indicated PRIORITY. If DECL needs initializing, INIT is
3297 do_static_initialization_and_destruction (decl
, init
)
3301 tree sentry
= NULL_TREE
;
3304 /* Deal gracefully with error. */
3305 if (decl
== error_mark_node
)
3308 /* The only things that can be initialized are variables. */
3309 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 19990420);
3311 /* If this object is not defined, we don't need to do anything
3313 if (DECL_EXTERNAL (decl
))
3316 /* Also, if the initializer already contains errors, we can bail out
3318 if (init
&& TREE_CODE (init
) == TREE_LIST
3319 && value_member (error_mark_node
, init
))
3322 /* Trick the compiler into thinking we are at the file and line
3323 where DECL was declared so that error-messages make sense, and so
3324 that the debugger will show somewhat sensible file and line
3326 input_filename
= DECL_SOURCE_FILE (decl
);
3327 lineno
= DECL_SOURCE_LINE (decl
);
3333 Access control for implicit calls to the constructors,
3334 the conversion functions, or the destructor called to
3335 create and destroy a static data member is performed as
3336 if these calls appeared in the scope of the member's
3339 we pretend we are in a static member function of the class of
3340 which the DECL is a member. */
3341 if (member_p (decl
))
3343 DECL_CLASS_CONTEXT (current_function_decl
) = DECL_CONTEXT (decl
);
3344 DECL_STATIC_FUNCTION_P (current_function_decl
) = 1;
3347 /* We need a sentry if this is an object with external linkage that
3348 might be initialized in more than one place. */
3349 if (TREE_PUBLIC (decl
) && (DECL_COMMON (decl
)
3350 || DECL_ONE_ONLY (decl
)
3351 || DECL_WEAK (decl
)))
3352 sentry
= get_sentry (DECL_ASSEMBLER_NAME (decl
));
3354 /* Generate the code to actually do the intialization and
3356 priority
= DECL_INIT_PRIORITY (decl
);
3358 priority
= DEFAULT_INIT_PRIORITY
;
3359 do_static_initialization (decl
, init
, sentry
, priority
);
3360 do_static_destruction (decl
, sentry
, priority
);
3362 /* Now that we're done with DECL we don't need to pretend to be a
3363 member of its class any longer. */
3364 DECL_CLASS_CONTEXT (current_function_decl
) = NULL_TREE
;
3365 DECL_STATIC_FUNCTION_P (current_function_decl
) = 0;
3368 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3369 (otherwise) that will initialize all gobal objects with static
3370 storage duration having the indicated PRIORITY. */
3373 generate_ctor_or_dtor_function (constructor_p
, priority
)
3381 /* We use `I' to indicate initialization and `D' to indicate
3388 /* Begin the function. */
3389 start_objects (function_key
, priority
);
3391 /* Call the static storage duration function with appropriate
3393 for (i
= 0; i
< ssdf_decls_used
; ++i
)
3395 arguments
= tree_cons (NULL_TREE
, build_int_2 (priority
, 0),
3397 arguments
= tree_cons (NULL_TREE
, build_int_2 (constructor_p
, 0),
3399 expand_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls
, i
),
3403 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3404 calls to any functions marked with attributes indicating that
3405 they should be called at initialization- or destruction-time. */
3406 if (priority
== DEFAULT_INIT_PRIORITY
)
3410 for (fns
= constructor_p
? static_ctors
: static_dtors
;
3412 fns
= TREE_CHAIN (fns
))
3413 expand_expr_stmt (build_function_call (TREE_VALUE (fns
), NULL_TREE
));
3416 /* Close out the function. */
3417 finish_objects (function_key
, priority
);
3420 /* Generate constructor and destructor functions for the priority
3424 generate_ctor_and_dtor_functions_for_priority (n
, data
)
3426 void *data ATTRIBUTE_UNUSED
;
3428 int priority
= (int) n
->key
;
3429 priority_info pi
= (priority_info
) n
->value
;
3431 /* Generate the functions themselves, but only if they are really
3433 if (pi
->initializations_p
3434 || (priority
== DEFAULT_INIT_PRIORITY
&& static_ctors
))
3435 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3437 if (pi
->destructions_p
3438 || (priority
== DEFAULT_INIT_PRIORITY
&& static_dtors
))
3439 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3442 /* Keep iterating. */
3446 /* This routine is called from the last rule in yyparse ().
3447 Its job is to create all the code needed to initialize and
3448 destroy the global aggregates. We do the destruction
3449 first, since that way we only need to reverse the decls once. */
3455 int start_time
, this_time
;
3462 /* Bad parse errors. Just forget about it. */
3463 if (! global_bindings_p () || current_class_type
|| decl_namespace_list
)
3466 start_time
= get_run_time ();
3468 /* Otherwise, GDB can get confused, because in only knows
3469 about source for LINENO-1 lines. */
3472 interface_unknown
= 1;
3475 /* We now have to write out all the stuff we put off writing out.
3478 o Template specializations that we have not yet instantiated,
3479 but which are needed.
3480 o Initialization and destruction for non-local objects with
3481 static storage duration. (Local objects with static storage
3482 duration are initialized when their scope is first entered,
3483 and are cleaned up via atexit.)
3484 o Virtual function tables.
3486 All of these may cause others to be needed. For example,
3487 instantiating one function may cause another to be needed, and
3488 generating the intiailzer for an object may cause templates to be
3489 instantiated, etc., etc. */
3491 this_time
= get_run_time ();
3492 parse_time
-= this_time
- start_time
;
3493 varconst_time
+= this_time
- start_time
;
3494 start_time
= get_run_time ();
3495 permanent_allocation (1);
3499 /* Non-zero if we need a static storage duration function on
3500 this iteration through the loop. */
3501 int need_ssdf_p
= 0;
3505 /* If there are templates that we've put off instantiating, do
3507 instantiate_pending_templates ();
3509 /* Write out virtual tables as required. Note that writing out
3510 the virtual table for a template class may cause the
3511 instantiation of members of that class. */
3512 if (walk_globals (vtable_decl_p
,
3513 finish_vtable_vardecl
,
3517 /* The list of objects with static storage duration is built up
3518 in reverse order, so we reverse it here. We also clear
3519 STATIC_AGGREGATES so that any new aggregates added during the
3520 initialization of these will be initialized in the correct
3521 order when we next come around the loop. */
3522 vars
= nreverse (static_aggregates
);
3523 static_aggregates
= NULL_TREE
;
3526 if (! TREE_ASM_WRITTEN (TREE_VALUE (vars
)))
3527 rest_of_decl_compilation (TREE_VALUE (vars
), 0, 1, 1);
3530 /* We need to start a new initialization function each
3531 time through the loop. That's because we need to
3532 know which vtables have been referenced, and
3533 TREE_SYMBOL_REFERENCED isn't computed until a
3534 function is finished, and written out. That's a
3535 deficiency in the back-end. When this is fixed,
3536 these initialization functions could all become
3537 inline, with resulting performance improvements. */
3538 start_static_storage_duration_function ();
3542 do_static_initialization_and_destruction (TREE_VALUE (vars
),
3543 TREE_PURPOSE (vars
));
3545 vars
= TREE_CHAIN (vars
);
3548 /* Finish up the static storage duration function for this
3551 finish_static_storage_duration_function ();
3553 /* Go through the various inline functions, and see if any need
3555 for (i
= 0; i
< saved_inlines_used
; ++i
)
3557 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3558 import_export_decl (decl
);
3559 if (DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
3561 && (! DECL_REALLY_EXTERN (decl
) || DECL_INLINE (decl
)))
3563 /* Even though we're already at the top-level, we push
3564 there again. That way, when we pop back a few lines
3565 hence, all of our state is restored. Otherwise,
3566 finish_function doesn't clean things up, and we end
3567 up with CURRENT_FUNCTION_DECL set. */
3568 push_to_top_level ();
3569 if (DECL_TINFO_FN_P (decl
))
3570 synthesize_tinfo_fn (decl
);
3572 synthesize_method (decl
);
3573 pop_from_top_level ();
3578 /* Mark all functions that might deal with exception-handling as
3580 mark_all_runtime_matches ();
3582 /* We lie to the back-end, pretending that some functions are
3583 not defined when they really are. This keeps these functions
3584 from being put out unncessarily. But, we must stop lying
3585 when the functions are referenced, or if they are not comdat
3586 since they need to be put out now. */
3587 for (i
= 0; i
< saved_inlines_used
; ++i
)
3589 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3591 if (DECL_NOT_REALLY_EXTERN (decl
)
3592 && DECL_INITIAL (decl
)
3593 && (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl
))
3594 || !DECL_COMDAT (decl
)))
3595 DECL_EXTERNAL (decl
) = 0;
3598 if (saved_inlines_used
3599 && wrapup_global_declarations (&VARRAY_TREE (saved_inlines
, 0),
3600 saved_inlines_used
))
3602 if (walk_namespaces (wrapup_globals_for_namespace
, /*data=*/0))
3605 /* Static data members are just like namespace-scope globals. */
3606 for (i
= 0; i
< pending_statics_used
; ++i
)
3608 tree decl
= VARRAY_TREE (pending_statics
, i
);
3609 if (TREE_ASM_WRITTEN (decl
))
3611 import_export_decl (decl
);
3612 if (DECL_NOT_REALLY_EXTERN (decl
) && ! DECL_IN_AGGR_P (decl
))
3613 DECL_EXTERNAL (decl
) = 0;
3616 && wrapup_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3617 pending_statics_used
))
3622 /* We give C linkage to static constructors and destructors. */
3623 push_lang_context (lang_name_c
);
3625 /* Generate initialization and destruction functions for all
3626 priorities for which they are required. */
3627 if (priority_info_map
)
3628 splay_tree_foreach (priority_info_map
,
3629 generate_ctor_and_dtor_functions_for_priority
,
3632 /* We're done with the splay-tree now. */
3633 if (priority_info_map
)
3634 splay_tree_delete (priority_info_map
);
3636 /* We're done with static constructors, so we can go back to "C++"
3638 pop_lang_context ();
3640 /* Now delete from the chain of variables all virtual function tables.
3641 We output them all ourselves, because each will be treated
3643 walk_globals (vtable_decl_p
, prune_vtable_vardecl
, /*data=*/0);
3645 /* Now, issue warnings about static, but not defined, functions,
3647 walk_namespaces (wrapup_globals_for_namespace
, /*data=*/&reconsider
);
3651 /* The entire file is now complete. If requested, dump everything
3653 if (flag_dump_translation_unit
)
3654 dump_node_to_file (global_namespace
, flag_dump_translation_unit
);
3656 /* If there's some tool that wants to examine the entire translation
3657 unit, let it do so now. */
3659 (*back_end_hook
) (global_namespace
);
3661 this_time
= get_run_time ();
3662 parse_time
-= this_time
- start_time
;
3663 varconst_time
+= this_time
- start_time
;
3665 if (flag_detailed_statistics
)
3667 dump_tree_statistics ();
3668 dump_time_statistics ();
3672 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3673 expr. Since it was parsed like a type, we need to wade through and fix
3674 that. Unfortunately, since operator() is left-associative, we can't use
3675 tail recursion. In the above example, TYPE is `A', and DECL is
3678 Maybe this shouldn't be recursive, but how often will it actually be
3682 reparse_absdcl_as_expr (type
, decl
)
3685 /* do build_functional_cast (type, NULL_TREE) at bottom */
3686 if (TREE_OPERAND (decl
, 0) == NULL_TREE
)
3687 return build_functional_cast (type
, NULL_TREE
);
3690 decl
= reparse_absdcl_as_expr (type
, TREE_OPERAND (decl
, 0));
3692 decl
= build_x_function_call (decl
, NULL_TREE
, current_class_ref
);
3694 if (TREE_CODE (decl
) == CALL_EXPR
3695 && (! TREE_TYPE (decl
)
3696 || TREE_CODE (TREE_TYPE (decl
)) != VOID_TYPE
))
3697 decl
= require_complete_type (decl
);
3702 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3703 out to be an expr. Since it was parsed like a type, we need to wade
3704 through and fix that. Since casts are right-associative, we are
3705 reversing the order, so we don't have to recurse.
3707 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3711 reparse_absdcl_as_casts (decl
, expr
)
3716 if (TREE_CODE (expr
) == CONSTRUCTOR
3717 && TREE_TYPE (expr
) == 0)
3719 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3720 decl
= TREE_OPERAND (decl
, 0);
3722 expr
= digest_init (type
, expr
, (tree
*) 0);
3723 if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_SIZE (type
) == 0)
3725 int failure
= complete_array_type (type
, expr
, 1);
3727 my_friendly_abort (78);
3733 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3734 decl
= TREE_OPERAND (decl
, 0);
3735 expr
= build_c_cast (type
, expr
);
3738 if (warn_old_style_cast
&& ! in_system_header
3739 && current_lang_name
!= lang_name_c
)
3740 warning ("use of old-style cast");
3745 /* Given plain tree nodes for an expression, build up the full semantics. */
3748 build_expr_from_tree (t
)
3751 if (t
== NULL_TREE
|| t
== error_mark_node
)
3754 switch (TREE_CODE (t
))
3756 case IDENTIFIER_NODE
:
3757 return do_identifier (t
, 0, NULL_TREE
);
3760 if (LOOKUP_EXPR_GLOBAL (t
))
3761 return do_scoped_id (TREE_OPERAND (t
, 0), 0);
3763 return do_identifier (TREE_OPERAND (t
, 0), 0, NULL_TREE
);
3765 case TEMPLATE_ID_EXPR
:
3766 return (lookup_template_function
3767 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3768 build_expr_from_tree (TREE_OPERAND (t
, 1))));
3771 return build_x_indirect_ref
3772 (build_expr_from_tree (TREE_OPERAND (t
, 0)), "unary *");
3775 return build_functional_cast
3776 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3778 case REINTERPRET_CAST_EXPR
:
3779 return build_reinterpret_cast
3780 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3782 case CONST_CAST_EXPR
:
3783 return build_const_cast
3784 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3786 case DYNAMIC_CAST_EXPR
:
3787 return build_dynamic_cast
3788 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3790 case STATIC_CAST_EXPR
:
3791 return build_static_cast
3792 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3794 case PREDECREMENT_EXPR
:
3795 case PREINCREMENT_EXPR
:
3796 case POSTDECREMENT_EXPR
:
3797 case POSTINCREMENT_EXPR
:
3801 case TRUTH_NOT_EXPR
:
3803 case CONVERT_EXPR
: /* Unary + */
3806 return build_x_unary_op (TREE_CODE (t
),
3807 build_expr_from_tree (TREE_OPERAND (t
, 0)));
3812 case TRUNC_DIV_EXPR
:
3814 case FLOOR_DIV_EXPR
:
3815 case ROUND_DIV_EXPR
:
3816 case EXACT_DIV_EXPR
:
3818 case BIT_ANDTC_EXPR
:
3821 case TRUNC_MOD_EXPR
:
3822 case FLOOR_MOD_EXPR
:
3823 case TRUTH_ANDIF_EXPR
:
3824 case TRUTH_ORIF_EXPR
:
3825 case TRUTH_AND_EXPR
:
3840 return build_x_binary_op
3842 build_expr_from_tree (TREE_OPERAND (t
, 0)),
3843 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3846 return build_m_component_ref
3847 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3848 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3851 return build_offset_ref (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
3854 if (TREE_OPERAND (t
, 0) == NULL_TREE
)
3856 return build_parse_node (ARRAY_REF
, NULL_TREE
,
3857 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3858 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3859 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3864 tree r
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3865 if (TREE_CODE_CLASS (TREE_CODE (r
)) != 't')
3867 return TREE_CODE (t
) == SIZEOF_EXPR
? c_sizeof (r
) : c_alignof (r
);
3871 return build_x_modify_expr
3872 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3873 TREE_CODE (TREE_OPERAND (t
, 1)),
3874 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3877 return build_x_arrow
3878 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3882 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3883 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3884 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3885 NEW_EXPR_USE_GLOBAL (t
));
3888 return delete_sanity
3889 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3890 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3891 DELETE_EXPR_USE_VEC (t
), DELETE_EXPR_USE_GLOBAL (t
));
3894 if (TREE_OPERAND (t
, 1) == NULL_TREE
)
3895 return build_x_compound_expr
3896 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3898 my_friendly_abort (42);
3900 case METHOD_CALL_EXPR
:
3901 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3903 tree ref
= TREE_OPERAND (t
, 0);
3904 return build_scoped_method_call
3905 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3906 build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3907 TREE_OPERAND (ref
, 1),
3908 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3912 tree fn
= TREE_OPERAND (t
, 0);
3914 /* We can get a TEMPLATE_ID_EXPR here on code like:
3918 so we must resolve that. However, we can also get things
3919 like a BIT_NOT_EXPR here, when referring to a destructor,
3920 and things like that are not correctly resolved by
3921 build_expr_from_tree. So, just use build_expr_from_tree
3922 when we really need it. */
3923 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3924 fn
= lookup_template_function
3925 (TREE_OPERAND (fn
, 0),
3926 build_expr_from_tree (TREE_OPERAND (fn
, 1)));
3928 return build_method_call
3929 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3931 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3932 NULL_TREE
, LOOKUP_NORMAL
);
3936 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3938 tree ref
= TREE_OPERAND (t
, 0);
3939 return build_member_call
3940 (build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3941 TREE_OPERAND (ref
, 1),
3942 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3946 tree name
= TREE_OPERAND (t
, 0);
3948 tree args
= build_expr_from_tree (TREE_OPERAND (t
, 1));
3949 if (args
!= NULL_TREE
&& TREE_CODE (name
) == LOOKUP_EXPR
3950 && !LOOKUP_EXPR_GLOBAL (name
)
3951 && TREE_CODE ((id
= TREE_OPERAND (name
, 0))) == IDENTIFIER_NODE
3952 && (!current_class_type
3953 || !lookup_member (current_class_type
, id
, 0, 0)))
3955 /* Do Koenig lookup if there are no class members. */
3956 name
= do_identifier (id
, 0, args
);
3958 else if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
3959 || ! really_overloaded_fn (name
))
3960 name
= build_expr_from_tree (name
);
3961 return build_x_function_call (name
, args
, current_class_ref
);
3965 return build_x_conditional_expr
3966 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3967 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3968 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3970 case PSEUDO_DTOR_EXPR
:
3971 return (finish_pseudo_destructor_call_expr
3972 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3973 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3974 build_expr_from_tree (TREE_OPERAND (t
, 2))));
3978 tree purpose
, value
, chain
;
3980 if (t
== void_list_node
)
3983 purpose
= TREE_PURPOSE (t
);
3985 purpose
= build_expr_from_tree (purpose
);
3986 value
= TREE_VALUE (t
);
3988 value
= build_expr_from_tree (value
);
3989 chain
= TREE_CHAIN (t
);
3990 if (chain
&& chain
!= void_type_node
)
3991 chain
= build_expr_from_tree (chain
);
3992 return expr_tree_cons (purpose
, value
, chain
);
3997 tree object
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3998 tree field
= TREE_OPERAND (t
, 1);
4000 /* We use a COMPONENT_REF to indicate things of the form `x.b'
4001 and `x.A::b'. We must distinguish between those cases
4003 if (TREE_CODE (field
) == SCOPE_REF
)
4004 return build_object_ref (object
,
4005 TREE_OPERAND (field
, 0),
4006 TREE_OPERAND (field
, 1));
4008 return build_x_component_ref (object
, field
,
4013 return build_throw (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4019 /* digest_init will do the wrong thing if we let it. */
4020 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
4023 r
= build_nt (CONSTRUCTOR
, NULL_TREE
,
4024 build_expr_from_tree (CONSTRUCTOR_ELTS (t
)));
4025 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
4028 return digest_init (TREE_TYPE (t
), r
, 0);
4033 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t
, 0))) == 't')
4034 return get_typeid (TREE_OPERAND (t
, 0));
4035 return build_x_typeid (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4038 return convert_from_reference (t
);
4045 /* This is something of the form `int (*a)++' that has turned out to be an
4046 expr. It was only converted into parse nodes, so we need to go through
4047 and build up the semantics. Most of the work is done by
4048 build_expr_from_tree, above.
4050 In the above example, TYPE is `int' and DECL is `*a'. */
4053 reparse_decl_as_expr (type
, decl
)
4056 decl
= build_expr_from_tree (decl
);
4058 return build_functional_cast (type
, build_expr_list (NULL_TREE
, decl
));
4063 /* This is something of the form `int (*a)' that has turned out to be a
4064 decl. It was only converted into parse nodes, so we need to do the
4065 checking that make_{pointer,reference}_declarator do. */
4068 finish_decl_parsing (decl
)
4071 extern int current_class_depth
;
4073 switch (TREE_CODE (decl
))
4075 case IDENTIFIER_NODE
:
4078 return make_pointer_declarator
4079 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4081 return make_reference_declarator
4082 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4084 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4087 push_nested_class (TREE_TYPE (TREE_OPERAND (decl
, 0)), 3);
4088 TREE_COMPLEXITY (decl
) = current_class_depth
;
4091 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4094 /* For attribute handling. */
4095 TREE_VALUE (decl
) = finish_decl_parsing (TREE_VALUE (decl
));
4098 my_friendly_abort (5);
4104 check_cp_case_value (value
)
4107 if (value
== NULL_TREE
)
4110 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4111 STRIP_TYPE_NOPS (value
);
4113 if (TREE_READONLY_DECL_P (value
))
4115 value
= decl_constant_value (value
);
4116 STRIP_TYPE_NOPS (value
);
4118 value
= fold (value
);
4120 if (TREE_CODE (value
) != INTEGER_CST
4121 && value
!= error_mark_node
)
4123 cp_error ("case label `%E' does not reduce to an integer constant",
4125 value
= error_mark_node
;
4128 /* Promote char or short to int. */
4129 value
= default_conversion (value
);
4131 constant_expression_warning (value
);
4136 /* Return 1 if root encloses child. */
4139 is_namespace_ancestor (root
, child
)
4144 if (root
== global_namespace
)
4146 if (child
== global_namespace
)
4148 return is_namespace_ancestor (root
, CP_DECL_CONTEXT (child
));
4152 /* Return the namespace that is the common ancestor
4153 of two given namespaces. */
4156 namespace_ancestor (ns1
, ns2
)
4159 if (is_namespace_ancestor (ns1
, ns2
))
4161 return namespace_ancestor (CP_DECL_CONTEXT (ns1
), ns2
);
4164 /* Insert used into the using list of user. Set indirect_flag if this
4165 directive is not directly from the source. Also find the common
4166 ancestor and let our users know about the new namespace */
4168 add_using_namespace (user
, used
, indirect
)
4174 /* Using oneself is a no-op. */
4177 my_friendly_assert (TREE_CODE (user
) == NAMESPACE_DECL
, 380);
4178 my_friendly_assert (TREE_CODE (used
) == NAMESPACE_DECL
, 380);
4179 /* Check if we already have this. */
4180 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
4184 /* Promote to direct usage. */
4185 TREE_INDIRECT_USING (t
) = 0;
4189 /* Add used to the user's using list. */
4190 DECL_NAMESPACE_USING (user
)
4191 = perm_tree_cons (used
, namespace_ancestor (user
, used
),
4192 DECL_NAMESPACE_USING (user
));
4194 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
4196 /* Add user to the used's users list. */
4197 DECL_NAMESPACE_USERS (used
)
4198 = perm_tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
4200 /* Recursively add all namespaces used. */
4201 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
4202 /* indirect usage */
4203 add_using_namespace (user
, TREE_PURPOSE (t
), 1);
4205 /* Tell everyone using us about the new used namespaces. */
4206 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
4207 add_using_namespace (TREE_PURPOSE (t
), used
, 1);
4210 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4211 duplicates. The first list becomes the tail of the result.
4213 The algorithm is O(n^2). We could get this down to O(n log n) by
4214 doing a sort on the addresses of the functions, if that becomes
4218 merge_functions (s1
, s2
)
4222 for (; s2
; s2
= OVL_NEXT (s2
))
4224 tree fn
= OVL_CURRENT (s2
);
4225 if (! ovl_member (fn
, s1
))
4226 s1
= build_overload (fn
, s1
);
4231 /* This should return an error not all definitions define functions.
4232 It is not an error if we find two functions with exactly the
4233 same signature, only if these are selected in overload resolution.
4234 old is the current set of bindings, new the freshly-found binding.
4235 XXX Do we want to give *all* candidates in case of ambiguity?
4236 XXX In what way should I treat extern declarations?
4237 XXX I don't want to repeat the entire duplicate_decls here */
4240 ambiguous_decl (name
, old
, new, flags
)
4247 my_friendly_assert (old
!= NULL_TREE
, 393);
4248 /* Copy the value. */
4249 val
= BINDING_VALUE (new);
4251 switch (TREE_CODE (val
))
4254 /* If we expect types or namespaces, and not templates,
4255 or this is not a template class. */
4256 if (LOOKUP_QUALIFIERS_ONLY (flags
)
4257 && !DECL_CLASS_TEMPLATE_P (val
))
4261 if (LOOKUP_NAMESPACES_ONLY (flags
))
4264 case NAMESPACE_DECL
:
4265 if (LOOKUP_TYPES_ONLY (flags
))
4269 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4273 if (!BINDING_VALUE (old
))
4274 BINDING_VALUE (old
) = val
;
4275 else if (val
&& val
!= BINDING_VALUE (old
))
4277 if (is_overloaded_fn (BINDING_VALUE (old
))
4278 && is_overloaded_fn (val
))
4280 BINDING_VALUE (old
) = merge_functions (BINDING_VALUE (old
),
4285 /* Some declarations are functions, some are not. */
4286 if (flags
& LOOKUP_COMPLAIN
)
4288 /* If we've already given this error for this lookup,
4289 BINDING_VALUE (old) is error_mark_node, so let's not
4290 repeat ourselves. */
4291 if (BINDING_VALUE (old
) != error_mark_node
)
4293 cp_error ("use of `%D' is ambiguous", name
);
4294 cp_error_at (" first declared as `%#D' here",
4295 BINDING_VALUE (old
));
4297 cp_error_at (" also declared as `%#D' here", val
);
4299 return error_mark_node
;
4302 /* ... and copy the type. */
4303 type
= BINDING_TYPE (new);
4304 if (LOOKUP_NAMESPACES_ONLY (flags
))
4306 if (!BINDING_TYPE (old
))
4307 BINDING_TYPE (old
) = type
;
4308 else if (type
&& BINDING_TYPE (old
) != type
)
4310 if (flags
& LOOKUP_COMPLAIN
)
4312 cp_error ("`%D' denotes an ambiguous type",name
);
4313 cp_error_at (" first type here", BINDING_TYPE (old
));
4314 cp_error_at (" other type here", type
);
4320 /* Subroutine of unualified_namespace_lookup:
4321 Add the bindings of NAME in used namespaces to VAL.
4322 We are currently looking for names in namespace SCOPE, so we
4323 look through USINGS for using-directives of namespaces
4324 which have SCOPE as a common ancestor with the current scope.
4325 Returns zero on errors. */
4328 lookup_using_namespace (name
, val
, usings
, scope
, flags
, spacesp
)
4329 tree name
, val
, usings
, scope
;
4335 /* Iterate over all used namespaces in current, searching for using
4336 directives of scope. */
4337 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4338 if (TREE_VALUE (iter
) == scope
)
4341 *spacesp
= scratch_tree_cons (TREE_PURPOSE (iter
), NULL_TREE
,
4343 val1
= binding_for_name (name
, TREE_PURPOSE (iter
));
4344 /* Resolve ambiguities. */
4345 val
= ambiguous_decl (name
, val
, val1
, flags
);
4347 return val
!= error_mark_node
;
4351 Accepts the NAME to lookup and its qualifying SCOPE.
4352 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4356 qualified_lookup_using_namespace (name
, scope
, result
, flags
)
4362 /* Maintain a list of namespaces visited... */
4363 tree seen
= NULL_TREE
;
4364 /* ... and a list of namespace yet to see. */
4365 tree todo
= NULL_TREE
;
4367 while (scope
&& (result
!= error_mark_node
))
4369 seen
= temp_tree_cons (scope
, NULL_TREE
, seen
);
4370 result
= ambiguous_decl (name
, result
,
4371 binding_for_name (name
, scope
), flags
);
4372 if (!BINDING_VALUE (result
) && !BINDING_TYPE (result
))
4373 /* Consider using directives. */
4374 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4375 usings
= TREE_CHAIN (usings
))
4376 /* If this was a real directive, and we have not seen it. */
4377 if (!TREE_INDIRECT_USING (usings
)
4378 && !purpose_member (TREE_PURPOSE (usings
), seen
))
4379 todo
= temp_tree_cons (TREE_PURPOSE (usings
), NULL_TREE
, todo
);
4382 scope
= TREE_PURPOSE (todo
);
4383 todo
= TREE_CHAIN (todo
);
4386 scope
= NULL_TREE
; /* If there never was a todo list. */
4388 return result
!= error_mark_node
;
4391 /* [namespace.memdef]/2 */
4393 /* Set the context of a declaration to scope. Complain if we are not
4397 set_decl_namespace (decl
, scope
, friendp
)
4403 if (scope
== std_node
)
4404 scope
= global_namespace
;
4405 /* Get rid of namespace aliases. */
4406 scope
= ORIGINAL_NAMESPACE (scope
);
4408 /* It is ok for friends to be qualified in parallel space. */
4409 if (!friendp
&& !is_namespace_ancestor (current_namespace
, scope
))
4410 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4412 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
4413 if (scope
!= current_namespace
)
4415 /* See whether this has been declared in the namespace. */
4416 old
= namespace_binding (DECL_NAME (decl
), scope
);
4418 /* No old declaration at all. */
4420 if (!is_overloaded_fn (decl
))
4421 /* Don't compare non-function decls with decls_match here,
4422 since it can't check for the correct constness at this
4423 point. pushdecl will find those errors later. */
4425 /* Since decl is a function, old should contain a function decl. */
4426 if (!is_overloaded_fn (old
))
4428 if (processing_template_decl
|| processing_specialization
)
4429 /* We have not yet called push_template_decl to turn the
4430 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4431 won't match. But, we'll check later, when we construct the
4434 for (; old
; old
= OVL_NEXT (old
))
4435 if (decls_match (decl
, OVL_CURRENT (old
)))
4441 cp_error ("`%D' should have been declared inside `%D'",
4445 /* Compute the namespace where a declaration is defined. */
4448 decl_namespace (decl
)
4451 while (DECL_CONTEXT (decl
))
4453 decl
= DECL_CONTEXT (decl
);
4454 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4456 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 't')
4457 decl
= TYPE_STUB_DECL (decl
);
4458 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 390);
4461 return global_namespace
;
4464 /* Return the namespace where the current declaration is declared. */
4467 current_decl_namespace ()
4470 /* If we have been pushed into a different namespace, use it. */
4471 if (decl_namespace_list
)
4472 return TREE_PURPOSE (decl_namespace_list
);
4474 if (current_class_type
)
4475 result
= decl_namespace (TYPE_STUB_DECL (current_class_type
));
4476 else if (current_function_decl
)
4477 result
= decl_namespace (current_function_decl
);
4479 result
= current_namespace
;
4483 /* Temporarily set the namespace for the current declaration. */
4486 push_decl_namespace (decl
)
4489 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
4490 decl
= decl_namespace (decl
);
4491 decl_namespace_list
= tree_cons (decl
, NULL_TREE
, decl_namespace_list
);
4495 pop_decl_namespace ()
4497 decl_namespace_list
= TREE_CHAIN (decl_namespace_list
);
4500 /* Enter a class or namespace scope. */
4506 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4507 push_decl_namespace (t
);
4512 /* Leave scope pushed by push_scope. */
4518 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4519 pop_decl_namespace ();
4524 /* [basic.lookup.koenig] */
4525 /* A non-zero return value in the functions below indicates an error.
4526 All nodes allocated in the procedure are on the scratch obstack. */
4536 static int arg_assoc
PROTO((struct arg_lookup
*, tree
));
4537 static int arg_assoc_args
PROTO((struct arg_lookup
*, tree
));
4538 static int arg_assoc_type
PROTO((struct arg_lookup
*, tree
));
4539 static int add_function
PROTO((struct arg_lookup
*, tree
));
4540 static int arg_assoc_namespace
PROTO((struct arg_lookup
*, tree
));
4541 static int arg_assoc_class
PROTO((struct arg_lookup
*, tree
));
4542 static int arg_assoc_template_arg
PROTO((struct arg_lookup
*, tree
));
4544 /* Add a function to the lookup structure.
4545 Returns 1 on error. */
4548 add_function (k
, fn
)
4549 struct arg_lookup
*k
;
4552 /* We used to check here to see if the function was already in the list,
4553 but that's O(n^2), which is just too expensive for function lookup.
4554 Now we deal with the occasional duplicate in joust. In doing this, we
4555 assume that the number of duplicates will be small compared to the
4556 total number of functions being compared, which should usually be the
4559 /* We must find only functions, or exactly one non-function. */
4560 if (k
->functions
&& is_overloaded_fn (k
->functions
)
4561 && is_overloaded_fn (fn
))
4562 k
->functions
= build_overload (fn
, k
->functions
);
4563 else if (k
->functions
)
4565 tree f1
= OVL_CURRENT (k
->functions
);
4567 if (is_overloaded_fn (f1
))
4569 fn
= f1
; f1
= f2
; f2
= fn
;
4571 cp_error_at ("`%D' is not a function,", f1
);
4572 cp_error_at (" conflict with `%D'", f2
);
4573 cp_error (" in call to `%D'", k
->name
);
4581 /* Add functions of a namespace to the lookup structure.
4582 Returns 1 on error. */
4585 arg_assoc_namespace (k
, scope
)
4586 struct arg_lookup
*k
;
4591 if (purpose_member (scope
, k
->namespaces
))
4593 k
->namespaces
= tree_cons (scope
, NULL_TREE
, k
->namespaces
);
4595 value
= namespace_binding (k
->name
, scope
);
4599 for (; value
; value
= OVL_NEXT (value
))
4600 if (add_function (k
, OVL_CURRENT (value
)))
4606 /* Adds everything associated with a template argument to the lookup
4607 structure. Returns 1 on error. */
4610 arg_assoc_template_arg (k
, arg
)
4611 struct arg_lookup
* k
;
4614 /* [basic.lookup.koenig]
4616 If T is a template-id, its associated namespaces and classes are
4617 ... the namespaces and classes associated with the types of the
4618 template arguments provided for template type parameters
4619 (excluding template template parameters); the namespaces in which
4620 any template template arguments are defined; and the classes in
4621 which any member templates used as template template arguments
4622 are defined. [Note: non-type template arguments do not
4623 contribute to the set of associated namespaces. ] */
4625 /* Consider first template template arguments. */
4626 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
4628 tree ctx
= CP_DECL_CONTEXT (arg
);
4630 /* It's not a member template. */
4631 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4632 return arg_assoc_namespace (k
, ctx
);
4633 /* Otherwise, it must be member template. */
4635 return arg_assoc_class (k
, ctx
);
4637 /* It's not a template template argument, but it is a type template
4639 else if (TREE_CODE_CLASS (TREE_CODE (arg
)) == 't')
4640 return arg_assoc_type (k
, arg
);
4641 /* It's a non-type template argument. */
4646 /* Adds everything associated with class to the lookup structure.
4647 Returns 1 on error. */
4650 arg_assoc_class (k
, type
)
4651 struct arg_lookup
* k
;
4654 tree list
, friends
, context
;
4657 /* Backend build structures, such as __builtin_va_list, aren't
4658 affected by all this. */
4659 if (!CLASS_TYPE_P (type
))
4662 if (purpose_member (type
, k
->classes
))
4664 k
->classes
= tree_cons (type
, NULL_TREE
, k
->classes
);
4666 context
= decl_namespace (TYPE_MAIN_DECL (type
));
4667 if (arg_assoc_namespace (k
, context
))
4670 /* Process baseclasses. */
4671 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (type
); i
++)
4672 if (arg_assoc_class (k
, TYPE_BINFO_BASETYPE (type
, i
)))
4675 /* Process friends. */
4676 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
4677 list
= TREE_CHAIN (list
))
4678 if (k
->name
== TREE_PURPOSE (list
))
4679 for (friends
= TREE_VALUE (list
); friends
;
4680 friends
= TREE_CHAIN (friends
))
4681 /* Only interested in global functions with potentially hidden
4682 (i.e. unqualified) declarations. */
4683 if (TREE_PURPOSE (list
) == error_mark_node
&& TREE_VALUE (list
)
4684 && decl_namespace (TREE_VALUE (list
)) == context
)
4685 if (add_function (k
, TREE_VALUE (list
)))
4688 /* Process template arguments. */
4689 if (CLASSTYPE_TEMPLATE_INFO (type
))
4691 list
= innermost_args (CLASSTYPE_TI_ARGS (type
));
4692 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
4693 arg_assoc_template_arg (k
, TREE_VEC_ELT (list
, i
));
4699 /* Adds everything associated with a given type.
4700 Returns 1 on error. */
4703 arg_assoc_type (k
, type
)
4704 struct arg_lookup
*k
;
4707 switch (TREE_CODE (type
))
4717 if (TYPE_PTRMEMFUNC_P (type
))
4718 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
4719 return arg_assoc_class (k
, type
);
4721 case REFERENCE_TYPE
:
4723 return arg_assoc_type (k
, TREE_TYPE (type
));
4726 return arg_assoc_namespace (k
, decl_namespace (TYPE_MAIN_DECL (type
)));
4728 /* Pointer to member: associate class type and value type. */
4729 if (arg_assoc_type (k
, TYPE_OFFSET_BASETYPE (type
)))
4731 return arg_assoc_type (k
, TREE_TYPE (type
));
4733 /* The basetype is referenced in the first arg type, so just
4736 /* Associate the parameter types. */
4737 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
4739 /* Associate the return type. */
4740 return arg_assoc_type (k
, TREE_TYPE (type
));
4741 case TEMPLATE_TYPE_PARM
:
4742 case TEMPLATE_TEMPLATE_PARM
:
4745 if (type
== unknown_type_node
)
4747 /* else fall through */
4749 my_friendly_abort (390);
4754 /* Adds everything associated with arguments. Returns 1 on error. */
4757 arg_assoc_args (k
, args
)
4758 struct arg_lookup
* k
;
4761 for (; args
; args
= TREE_CHAIN (args
))
4762 if (arg_assoc (k
, TREE_VALUE (args
)))
4767 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4771 struct arg_lookup
* k
;
4774 if (n
== error_mark_node
)
4777 if (TREE_CODE_CLASS (TREE_CODE (n
)) == 't')
4778 return arg_assoc_type (k
, n
);
4780 if (! type_unknown_p (n
))
4781 return arg_assoc_type (k
, TREE_TYPE (n
));
4783 if (TREE_CODE (n
) == ADDR_EXPR
)
4784 n
= TREE_OPERAND (n
, 0);
4785 if (TREE_CODE (n
) == COMPONENT_REF
)
4786 n
= TREE_OPERAND (n
, 1);
4787 if (TREE_CODE (n
) == OFFSET_REF
)
4788 n
= TREE_OPERAND (n
, 1);
4789 while (TREE_CODE (n
) == TREE_LIST
)
4792 if (TREE_CODE (n
) == FUNCTION_DECL
)
4793 return arg_assoc_type (k
, TREE_TYPE (n
));
4794 if (TREE_CODE (n
) == TEMPLATE_ID_EXPR
)
4796 /* [basic.lookup.koenig]
4798 If T is a template-id, its associated namespaces and classes
4799 are the namespace in which the template is defined; for
4800 member templates, the member template's class... */
4801 tree
template = TREE_OPERAND (n
, 0);
4802 tree args
= TREE_OPERAND (n
, 1);
4806 /* First, the template. There may actually be more than one if
4807 this is an overloaded function template. But, in that case,
4808 we only need the first; all the functions will be in the same
4810 template = OVL_CURRENT (template);
4812 ctx
= CP_DECL_CONTEXT (template);
4814 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4816 if (arg_assoc_namespace (k
, ctx
) == 1)
4819 /* It must be a member template. */
4820 else if (arg_assoc_class (k
, ctx
) == 1)
4823 /* Now the arguments. */
4824 for (arg
= args
; arg
!= NULL_TREE
; arg
= TREE_CHAIN (arg
))
4825 if (arg_assoc_template_arg (k
, TREE_VALUE (arg
)) == 1)
4830 my_friendly_assert (TREE_CODE (n
) == OVERLOAD
, 980715);
4832 for (; n
; n
= OVL_CHAIN (n
))
4833 if (arg_assoc_type (k
, TREE_TYPE (OVL_FUNCTION (n
))))
4840 /* Performs Koenig lookup depending on arguments, where fns
4841 are the functions found in normal lookup. */
4844 lookup_arg_dependent (name
, fns
, args
)
4849 struct arg_lookup k
;
4853 k
.classes
= NULL_TREE
;
4855 /* Note that we've already looked at some namespaces during normal
4856 unqualified lookup, unless we found a decl in function scope. */
4857 if (fns
&& ! TREE_PERMANENT (OVL_CURRENT (fns
)))
4858 k
.namespaces
= NULL_TREE
;
4860 unqualified_namespace_lookup (name
, 0, &k
.namespaces
);
4862 push_scratch_obstack ();
4863 arg_assoc_args (&k
, args
);
4868 /* Process a namespace-alias declaration. */
4871 do_namespace_alias (alias
, namespace)
4872 tree alias
, namespace;
4874 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
4876 /* The parser did not find it, so it's not there. */
4877 cp_error ("unknown namespace `%D'", namespace);
4881 namespace = ORIGINAL_NAMESPACE (namespace);
4883 /* Build the alias. */
4884 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
4885 DECL_NAMESPACE_ALIAS (alias
) = namespace;
4889 /* Check a non-member using-declaration. Return the name and scope
4890 being used, and the USING_DECL, or NULL_TREE on failure. */
4893 validate_nonmember_using_decl (decl
, scope
, name
)
4898 if (TREE_CODE (decl
) == SCOPE_REF
4899 && TREE_OPERAND (decl
, 0) == std_node
)
4901 if (namespace_bindings_p ()
4902 && current_namespace
== global_namespace
)
4903 /* There's no need for a using declaration at all, here,
4904 since `std' is the same as `::'. We can't just pass this
4905 on because we'll complain later about declaring something
4906 in the same scope as a using declaration with the same
4907 name. We return NULL_TREE which indicates to the caller
4908 that there's no need to do any further processing. */
4911 *scope
= global_namespace
;
4912 *name
= TREE_OPERAND (decl
, 1);
4914 else if (TREE_CODE (decl
) == SCOPE_REF
)
4916 *scope
= TREE_OPERAND (decl
, 0);
4917 *name
= TREE_OPERAND (decl
, 1);
4919 /* [namespace.udecl]
4921 A using-declaration for a class member shall be a
4922 member-declaration. */
4923 if (TREE_CODE (*scope
) != NAMESPACE_DECL
)
4925 if (TYPE_P (*scope
))
4926 cp_error ("`%T' is not a namespace", *scope
);
4928 cp_error ("`%D' is not a namespace", *scope
);
4932 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
4933 || TREE_CODE (decl
) == TYPE_DECL
4934 || TREE_CODE (decl
) == TEMPLATE_DECL
)
4936 *scope
= global_namespace
;
4940 my_friendly_abort (382);
4941 if (TREE_CODE_CLASS (TREE_CODE (*name
)) == 'd')
4942 *name
= DECL_NAME (*name
);
4943 /* Make a USING_DECL. */
4944 return push_using_decl (*scope
, *name
);
4947 /* Process local and global using-declarations. */
4950 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, newval
, newtype
)
4952 tree oldval
, oldtype
;
4953 tree
*newval
, *newtype
;
4956 struct tree_binding _decls
;
4958 *newval
= *newtype
= NULL_TREE
;
4959 decls
= binding_init (&_decls
);
4960 if (!qualified_lookup_using_namespace (name
, scope
, decls
, 0))
4964 if (!BINDING_VALUE (decls
) && !BINDING_TYPE (decls
))
4966 cp_error ("`%D' not declared", name
);
4970 /* Check for using functions. */
4971 if (BINDING_VALUE (decls
) && is_overloaded_fn (BINDING_VALUE (decls
)))
4975 if (oldval
&& !is_overloaded_fn (oldval
))
4977 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls
)), oldval
);
4982 for (tmp
= BINDING_VALUE (decls
); tmp
; tmp
= OVL_NEXT (tmp
))
4984 tree new_fn
= OVL_CURRENT (tmp
);
4986 /* [namespace.udecl]
4988 If a function declaration in namespace scope or block
4989 scope has the same name and the same parameter types as a
4990 function introduced by a using declaration the program is
4992 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
4994 tree old_fn
= OVL_CURRENT (tmp1
);
4996 if (!OVL_USED (tmp1
)
4997 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn
)),
4998 TYPE_ARG_TYPES (TREE_TYPE (old_fn
))))
5000 /* There was already a non-using declaration in
5001 this scope with the same parameter types. */
5002 cp_error ("`%D' is already declared in this scope",
5006 else if (duplicate_decls (new_fn
, old_fn
))
5007 /* We're re-using something we already used
5008 before. We don't need to add it again. */
5012 /* If we broke out of the loop, there's no reason to add
5013 this function to the using declarations for this
5018 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
5019 if (TREE_CODE (*newval
) != OVERLOAD
)
5020 *newval
= ovl_cons (*newval
, NULL_TREE
);
5021 OVL_USED (*newval
) = 1;
5026 *newval
= BINDING_VALUE (decls
);
5028 duplicate_decls (*newval
, oldval
);
5031 *newtype
= BINDING_TYPE (decls
);
5032 if (oldtype
&& *newtype
&& oldtype
!= *newtype
)
5034 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5040 /* Process a using-declaration not appearing in class or local scope. */
5043 do_toplevel_using_decl (decl
)
5046 tree scope
, name
, binding
;
5047 tree oldval
, oldtype
, newval
, newtype
;
5049 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5050 if (decl
== NULL_TREE
)
5053 binding
= binding_for_name (name
, current_namespace
);
5055 oldval
= BINDING_VALUE (binding
);
5056 oldtype
= BINDING_TYPE (binding
);
5058 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5060 /* Copy declarations found. */
5062 BINDING_VALUE (binding
) = newval
;
5064 BINDING_TYPE (binding
) = newtype
;
5068 /* Process a using-declaration at function scope. */
5071 do_local_using_decl (decl
)
5075 tree oldval
, oldtype
, newval
, newtype
;
5077 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5078 if (decl
== NULL_TREE
)
5081 oldval
= lookup_name_current_level (name
);
5082 oldtype
= lookup_type_current_level (name
);
5084 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5088 if (is_overloaded_fn (newval
))
5092 /* We only need to push declarations for those functions
5093 that were not already bound in the current level.
5094 The old value might be NULL_TREE, it might be a single
5095 function, or an OVERLOAD. */
5096 if (oldval
&& TREE_CODE (oldval
) == OVERLOAD
)
5097 term
= OVL_FUNCTION (oldval
);
5100 for (fn
= newval
; fn
&& OVL_CURRENT (fn
) != term
;
5102 push_overloaded_decl (OVL_CURRENT (fn
),
5103 PUSH_LOCAL
| PUSH_USING
);
5106 push_local_binding (name
, newval
, PUSH_USING
);
5109 set_identifier_type_value (name
, newtype
);
5113 do_class_using_decl (decl
)
5118 if (TREE_CODE (decl
) != SCOPE_REF
5119 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl
, 0))) != 't')
5121 cp_error ("using-declaration for non-member at class scope");
5124 name
= TREE_OPERAND (decl
, 1);
5125 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
5127 cp_error ("using-declaration for destructor");
5130 if (TREE_CODE (name
) == TYPE_DECL
)
5131 name
= DECL_NAME (name
);
5133 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 980716);
5135 value
= build_lang_decl (USING_DECL
, name
, void_type_node
);
5136 DECL_INITIAL (value
) = TREE_OPERAND (decl
, 0);
5140 /* Process a using-directive. */
5143 do_using_directive (namespace)
5146 if (namespace == std_node
)
5148 /* using namespace A::B::C; */
5149 if (TREE_CODE (namespace) == SCOPE_REF
)
5150 namespace = TREE_OPERAND (namespace, 1);
5151 if (TREE_CODE (namespace) == IDENTIFIER_NODE
)
5153 /* Lookup in lexer did not find a namespace. */
5154 cp_error ("namespace `%T' undeclared", namespace);
5157 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
5159 cp_error ("`%T' is not a namespace", namespace);
5162 namespace = ORIGINAL_NAMESPACE (namespace);
5163 if (!toplevel_bindings_p ())
5164 push_using_directive (namespace);
5167 add_using_namespace (current_namespace
, namespace, 0);
5171 check_default_args (x
)
5174 tree arg
= TYPE_ARG_TYPES (TREE_TYPE (x
));
5175 int saw_def
= 0, i
= 0 - (TREE_CODE (TREE_TYPE (x
)) == METHOD_TYPE
);
5176 for (; arg
&& arg
!= void_list_node
; arg
= TREE_CHAIN (arg
), ++i
)
5178 if (TREE_PURPOSE (arg
))
5182 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5193 TREE_USED (decl
) = 1;
5194 if (processing_template_decl
)
5196 assemble_external (decl
);
5198 /* Is it a synthesized method that needs to be synthesized? */
5199 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CLASS_CONTEXT (decl
)
5200 && DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
5201 /* Kludge: don't synthesize for default args. */
5202 && current_function_decl
)
5203 synthesize_method (decl
);
5205 /* If this is a function or variable that is an instance of some
5206 template, we now know that we will need to actually do the
5207 instantiation. A TEMPLATE_DECL may also have DECL_TEMPLATE_INFO,
5208 if it's a partial instantiation, but there's no need to
5209 instantiate such a thing. We check that DECL is not an explicit
5210 instantiation because that is not checked in instantiate_decl. */
5211 if (TREE_CODE (decl
) != TEMPLATE_DECL
5212 && DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
5213 && !DECL_EXPLICIT_INSTANTIATION (decl
))
5214 instantiate_decl (decl
);
5217 /* Helper function for named_class_head_sans_basetype nonterminal. We
5218 have just seen something of the form `AGGR SCOPE::ID'. Return a
5219 TYPE_DECL for the type declared by ID in SCOPE. */
5222 handle_class_head (aggr
, scope
, id
)
5223 tree aggr
, scope
, id
;
5227 if (TREE_CODE (id
) == TYPE_DECL
)
5229 else if (DECL_CLASS_TEMPLATE_P (id
))
5230 decl
= DECL_TEMPLATE_RESULT (id
);
5233 tree current
= current_scope();
5235 if (current
== NULL_TREE
)
5236 current
= current_namespace
;
5237 if (scope
== std_node
)
5238 scope
= global_namespace
;
5239 if (scope
== NULL_TREE
)
5240 scope
= global_namespace
;
5241 if (scope
== current
)
5243 /* We've been given AGGR SCOPE::ID, when we're already inside SCOPE.
5244 Be nice about it. */
5246 cp_pedwarn ("extra qualification `%T::' on member `%D' ignored",
5247 FROB_CONTEXT (scope
), id
);
5249 else if (scope
!= global_namespace
)
5250 cp_error ("`%T' does not have a nested type named `%D'", scope
, id
);
5252 cp_error ("no file-scope type named `%D'", id
);
5254 /* Inject it at the current scope. */
5255 decl
= TYPE_MAIN_DECL (xref_tag (aggr
, id
, 1));
5258 /* Enter the SCOPE. If this turns out not to be a definition, the
5259 parser must leave the scope. */
5260 push_scope (CP_DECL_CONTEXT (decl
));
5262 /* If we see something like:
5264 template <typename T> struct S::I ....
5266 we must create a TEMPLATE_DECL for the nested type. */
5267 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5268 decl
= push_template_decl (decl
);