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. */
43 #include "dwarf2out.h"
45 #include "splay-tree.h"
50 extern cpp_reader parse_in
;
53 /* This structure contains information about the initializations
54 and/or destructions required for a particular priority level. */
55 typedef struct priority_info_s
{
56 /* A label indicating where we should generate the next
57 initialization with this priority. */
58 rtx initialization_sequence
;
59 /* A label indicating where we should generate the next destruction
60 with this priority. */
61 rtx destruction_sequence
;
62 /* Non-zero if there have been any initializations at this priority
63 throughout the translation unit. */
64 int initializations_p
;
65 /* Non-zero if there have been any destructions at this priority
66 throughout the translation unit. */
70 static tree get_sentry
PROTO((tree
));
71 static void mark_vtable_entries
PROTO((tree
));
72 static void grok_function_init
PROTO((tree
, tree
));
73 static int finish_vtable_vardecl
PROTO((tree
*, void *));
74 static int prune_vtable_vardecl
PROTO((tree
*, void *));
75 static int finish_sigtable_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 /* Used to help generate temporary names which are unique within
116 a function. Reset to 0 by start_function. */
118 int temp_name_counter
;
120 /* Same, but not reset. Local temp variables and global temp variables
121 can have the same name. */
122 static int global_temp_name_counter
;
124 /* Flag used when debugging spew.c */
126 extern int spew_debug
;
128 /* Nonzero if we're done parsing and into end-of-file activities. */
132 /* Functions called along with real static constructors and destructors. */
134 tree static_ctors
, static_dtors
;
136 /* The current open namespace, and ::. */
138 tree current_namespace
;
139 tree global_namespace
;
141 /* The stack for namespaces of current declarations. */
143 static tree decl_namespace_list
;
146 /* C (and C++) language-specific option variables. */
148 /* Nonzero means allow type mismatches in conditional expressions;
149 just make their values `void'. */
151 int flag_cond_mismatch
;
153 /* Nonzero means give `double' the same size as `float'. */
155 int flag_short_double
;
157 /* Nonzero means don't recognize the keyword `asm'. */
161 /* Nonzero means don't recognize any extension keywords. */
163 int flag_no_gnu_keywords
;
165 /* Nonzero means don't recognize the non-ANSI builtin functions. */
169 /* Nonzero means don't recognize the non-ANSI builtin functions.
172 int flag_no_nonansi_builtin
;
174 /* Nonzero means do some things the same way PCC does. Only provided so
175 the compiler will link. */
177 int flag_traditional
;
179 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
181 int flag_signed_bitfields
= 1;
183 /* Nonzero means enable obscure ANSI features and disable GNU extensions
184 that might cause ANSI-compliant code to be miscompiled. */
188 /* Nonzero means do emit exported implementations of functions even if
189 they can be inlined. */
191 int flag_implement_inlines
= 1;
193 /* Nonzero means do emit exported implementations of templates, instead of
194 multiple static copies in each file that needs a definition. */
196 int flag_external_templates
;
198 /* Nonzero means that the decision to emit or not emit the implementation of a
199 template depends on where the template is instantiated, rather than where
202 int flag_alt_external_templates
;
204 /* Nonzero means that implicit instantiations will be emitted if needed. */
206 int flag_implicit_templates
= 1;
208 /* Nonzero means that implicit instantiations of inline templates will be
209 emitted if needed, even if instantiations of non-inline templates
212 int flag_implicit_inline_templates
= 1;
214 /* Nonzero means warn about implicit declarations. */
216 int warn_implicit
= 1;
218 /* Nonzero means warn about usage of long long when `-pedantic'. */
220 int warn_long_long
= 1;
222 /* Nonzero means warn when all ctors or dtors are private, and the class
225 int warn_ctor_dtor_privacy
= 1;
227 /* True if we want to implement vtables using "thunks".
228 The default is off. */
230 #ifndef DEFAULT_VTABLE_THUNKS
231 #define DEFAULT_VTABLE_THUNKS 0
233 int flag_vtable_thunks
= DEFAULT_VTABLE_THUNKS
;
235 /* True if we want to deal with repository information. */
237 int flag_use_repository
;
239 /* Nonzero if we want to issue diagnostics that the standard says are not
242 int flag_optional_diags
= 1;
244 /* Nonzero means give string constants the type `const char *', as mandated
247 int flag_const_strings
= 1;
249 /* Nonzero means warn about deprecated conversion from string constant to
252 int warn_write_strings
;
254 /* Nonzero means warn about pointer casts that can drop a type qualifier
255 from the pointer target type. */
259 /* Nonzero means warn about sizeof(function) or addition/subtraction
260 of function pointers. */
262 int warn_pointer_arith
= 1;
264 /* Nonzero means warn for any function def without prototype decl. */
266 int warn_missing_prototypes
;
268 /* Nonzero means warn about multiple (redundant) decls for the same single
269 variable or function. */
271 int warn_redundant_decls
;
273 /* Warn if initializer is not completely bracketed. */
275 int warn_missing_braces
;
277 /* Warn about comparison of signed and unsigned values. */
279 int warn_sign_compare
;
281 /* Warn about *printf or *scanf format/argument anomalies. */
285 /* Warn about a subscript that has type char. */
287 int warn_char_subscripts
;
289 /* Warn if a type conversion is done that might have confusing results. */
293 /* Warn if adding () is suggested. */
295 int warn_parentheses
;
297 /* Non-zero means warn in function declared in derived class has the
298 same name as a virtual in the base class, but fails to match the
299 type signature of any virtual function in the base class. */
300 int warn_overloaded_virtual
;
302 /* Non-zero means warn when declaring a class that has a non virtual
303 destructor, when it really ought to have a virtual one. */
306 /* Non-zero means warn when a function is declared extern and later inline. */
307 int warn_extern_inline
;
309 /* Non-zero means warn when the compiler will reorder code. */
312 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
315 /* Non-zero means warn when we convert a pointer to member function
316 into a pointer to (void or function). */
317 int warn_pmf2ptr
= 1;
319 /* Nonzero means warn about violation of some Effective C++ style rules. */
323 /* Nonzero means warn where overload resolution chooses a promotion from
324 unsigned to signed over a conversion to an unsigned of the same size. */
328 /* Nonzero means warn when an old-style cast is used. */
330 int warn_old_style_cast
;
332 /* Warn about #pragma directives that are not recognised. */
334 int warn_unknown_pragmas
; /* Tri state variable. */
336 /* Nonzero means warn about use of multicharacter literals. */
338 int warn_multichar
= 1;
340 /* Nonzero means warn when non-templatized friend functions are
341 declared within a template */
343 int warn_nontemplate_friend
= 1;
345 /* Nonzero means complain about deprecated features. */
347 int warn_deprecated
= 1;
349 /* Nonzero means `$' can be in an identifier. */
351 #ifndef DOLLARS_IN_IDENTIFIERS
352 #define DOLLARS_IN_IDENTIFIERS 1
354 int dollars_in_ident
= DOLLARS_IN_IDENTIFIERS
;
356 /* Nonzero for -fno-strict-prototype switch: do not consider empty
357 argument prototype to mean function takes no arguments. */
359 int flag_strict_prototype
= 2;
360 int strict_prototype
= 1;
361 int strict_prototypes_lang_c
, strict_prototypes_lang_cplusplus
= 1;
363 /* Nonzero means that labels can be used as first-class objects */
367 /* Non-zero means to collect statistics which might be expensive
368 and to print them when we are done. */
369 int flag_detailed_statistics
;
371 /* C++ specific flags. */
372 /* Zero means that `this' is a *const. This gives nice behavior in the
373 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
374 -2 means we're constructing an object and it has fixed type. */
376 int flag_this_is_variable
;
378 /* Nonzero means we should attempt to elide constructors when possible. */
380 int flag_elide_constructors
= 1;
382 /* Nonzero means recognize and handle signature language constructs. */
384 int flag_handle_signatures
;
386 /* Nonzero means that member functions defined in class scope are
387 inline by default. */
389 int flag_default_inline
= 1;
391 /* Controls whether compiler generates 'type descriptor' that give
392 run-time type information. */
395 /* Nonzero if we wish to output cross-referencing information
396 for the GNU class browser. */
397 extern int flag_gnu_xref
;
399 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
402 int flag_huge_objects
;
404 /* Nonzero if we want to conserve space in the .o files. We do this
405 by putting uninitialized data and runtime initialized data into
406 .common instead of .data at the expense of not flagging multiple
409 int flag_conserve_space
;
411 /* Nonzero if we want to obey access control semantics. */
413 int flag_access_control
= 1;
415 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
417 int flag_operator_names
;
419 /* Nonzero if we want to check the return value of new and avoid calling
420 constructors if it is a null pointer. */
424 /* Nonzero if we want the new ANSI rules for pushing a new scope for `for'
425 initialization variables.
426 0: Old rules, set by -fno-for-scope.
427 2: New ANSI rules, set by -ffor-scope.
428 1: Try to implement new ANSI rules, but with backup compatibility
429 (and warnings). This is the default, for now. */
431 int flag_new_for_scope
= 1;
433 /* Nonzero if we want to emit defined symbols with common-like linkage as
434 weak symbols where possible, in order to conform to C++ semantics.
435 Otherwise, emit them as local symbols. */
439 /* Nonzero to enable experimental ABI changes. */
443 /* Nonzero to not ignore namespace std. */
447 /* Maximum template instantiation depth. Must be at least 17 for ANSI
450 int max_tinst_depth
= 17;
452 /* The name-mangling scheme to use. Must be 1 or greater to support
453 template functions with identical types, but different template
455 int name_mangling_version
= 2;
457 /* Nonzero means that guiding declarations are allowed. */
458 int flag_guiding_decls
;
460 /* Nonzero if squashed mangling is to be performed.
461 This uses the B and K codes to reference previously seen class types
462 and class qualifiers. */
463 int flag_do_squangling
;
465 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
469 /* Nonzero means make the default pedwarns warnings instead of errors.
470 The value of this flag is ignored if -pedantic is specified. */
474 /* Table of language-dependent -f options.
475 STRING is the option name. VARIABLE is the address of the variable.
476 ON_VALUE is the value to store in VARIABLE
477 if `-fSTRING' is seen as an option.
478 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
480 static struct { const char *string
; int *variable
; int on_value
;}
484 {"signed-char", &flag_signed_char
, 1},
485 {"unsigned-char", &flag_signed_char
, 0},
486 {"signed-bitfields", &flag_signed_bitfields
, 1},
487 {"unsigned-bitfields", &flag_signed_bitfields
, 0},
488 {"short-enums", &flag_short_enums
, 1},
489 {"short-double", &flag_short_double
, 1},
490 {"cond-mismatch", &flag_cond_mismatch
, 1},
491 {"asm", &flag_no_asm
, 0},
492 {"builtin", &flag_no_builtin
, 0},
494 /* C++-only options. */
495 {"access-control", &flag_access_control
, 1},
496 {"check-new", &flag_check_new
, 1},
497 {"conserve-space", &flag_conserve_space
, 1},
498 {"const-strings", &flag_const_strings
, 1},
499 {"default-inline", &flag_default_inline
, 1},
500 {"dollars-in-identifiers", &dollars_in_ident
, 1},
501 {"elide-constructors", &flag_elide_constructors
, 1},
502 {"external-templates", &flag_external_templates
, 1},
503 {"for-scope", &flag_new_for_scope
, 2},
504 {"gnu-keywords", &flag_no_gnu_keywords
, 0},
505 {"handle-exceptions", &flag_exceptions
, 1},
506 {"handle-signatures", &flag_handle_signatures
, 1},
507 {"honor-std", &flag_honor_std
, 1},
508 {"huge-objects", &flag_huge_objects
, 1},
509 {"implement-inlines", &flag_implement_inlines
, 1},
510 {"implicit-inline-templates", &flag_implicit_inline_templates
, 1},
511 {"implicit-templates", &flag_implicit_templates
, 1},
512 {"labels-ok", &flag_labels_ok
, 1},
513 {"nonansi-builtins", &flag_no_nonansi_builtin
, 0},
514 {"operator-names", &flag_operator_names
, 1},
515 {"optional-diags", &flag_optional_diags
, 1},
516 {"permissive", &flag_permissive
, 1},
517 {"repo", &flag_use_repository
, 1},
518 {"rtti", &flag_rtti
, 1},
519 {"squangle", &flag_do_squangling
, 1},
520 {"stats", &flag_detailed_statistics
, 1},
521 {"strict-prototype", &flag_strict_prototype
, 1},
522 {"this-is-variable", &flag_this_is_variable
, 1},
523 {"vtable-gc", &flag_vtable_gc
, 1},
524 {"vtable-thunks", &flag_vtable_thunks
, 1},
525 {"weak", &flag_weak
, 1},
526 {"xref", &flag_gnu_xref
, 1}
529 /* Decode the string P as a language-specific option.
530 Return the number of strings consumed for a valid option.
531 Otherwise return 0. */
534 lang_decode_option (argc
, argv
)
543 int strings_processed
;
546 strings_processed
= cpp_handle_option (&parse_in
, argc
, argv
);
548 strings_processed
= 0;
549 #endif /* ! USE_CPPLIB */
551 if (!strcmp (p
, "-ftraditional") || !strcmp (p
, "-traditional"))
553 else if (p
[0] == '-' && p
[1] == 'f')
555 /* Some kind of -f option.
556 P's value is the option sans `-f'.
557 Search for it in the table of options. */
562 /* Try special -f options. */
564 if (!strcmp (p
, "handle-exceptions")
565 || !strcmp (p
, "no-handle-exceptions"))
566 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
568 if (!strcmp (p
, "memoize-lookups")
569 || !strcmp (p
, "no-memoize-lookups")
570 || !strcmp (p
, "save-memoized")
571 || !strcmp (p
, "no-save-memoized")
572 || !strcmp (p
, "no-all-virtual")
573 || !strcmp (p
, "no-enum-int-equiv")
574 || !strcmp (p
, "nonnull-objects")
575 || !strcmp (p
, "ansi-overloading"))
580 else if (!strcmp (p
, "all-virtual")
581 || !strcmp (p
, "enum-int-equiv")
582 || !strcmp (p
, "no-nonnull-objects")
583 || !strcmp (p
, "no-ansi-overloading"))
585 warning ("-f%s is no longer supported", p
);
588 else if (! strcmp (p
, "alt-external-templates"))
590 flag_external_templates
= 1;
591 flag_alt_external_templates
= 1;
593 cp_deprecated ("-falt-external-templates");
595 else if (! strcmp (p
, "no-alt-external-templates"))
597 flag_alt_external_templates
= 0;
600 else if (!strcmp (p
, "repo"))
602 flag_use_repository
= 1;
603 flag_implicit_templates
= 0;
606 else if (!strcmp (p
, "guiding-decls"))
608 flag_guiding_decls
= 1;
609 name_mangling_version
= 0;
612 else if (!strcmp (p
, "no-guiding-decls"))
614 flag_guiding_decls
= 0;
617 else if (!strcmp (p
, "this-is-variable"))
619 flag_this_is_variable
= 1;
621 cp_deprecated ("-fthis-is-variable");
623 else if (!strcmp (p
, "external-templates"))
625 flag_external_templates
= 1;
627 cp_deprecated ("-fexternal-templates");
629 else if (!strcmp (p
, "new-abi"))
632 flag_do_squangling
= 1;
634 flag_vtable_thunks
= 1;
636 else if (!strcmp (p
, "no-new-abi"))
639 flag_do_squangling
= 0;
642 else if (!strncmp (p
, "template-depth-", 15))
645 read_integral_parameter (p
+ 15, p
- 2, max_tinst_depth
);
647 else if (!strncmp (p
, "name-mangling-version-", 22))
649 name_mangling_version
=
650 read_integral_parameter (p
+ 22, p
- 2, name_mangling_version
);
653 !found
&& j
< sizeof (lang_f_options
) / sizeof (lang_f_options
[0]);
656 if (!strcmp (p
, lang_f_options
[j
].string
))
658 *lang_f_options
[j
].variable
= lang_f_options
[j
].on_value
;
659 /* A goto here would be cleaner,
660 but breaks the vax pcc. */
663 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-'
664 && ! strcmp (p
+3, lang_f_options
[j
].string
))
666 *lang_f_options
[j
].variable
= ! lang_f_options
[j
].on_value
;
672 else if (p
[0] == '-' && p
[1] == 'W')
676 /* The -W options control the warning behavior of the compiler. */
679 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-')
682 if (!strcmp (p
, "implicit"))
683 warn_implicit
= setting
;
684 else if (!strcmp (p
, "long-long"))
685 warn_long_long
= setting
;
686 else if (!strcmp (p
, "return-type"))
687 warn_return_type
= setting
;
688 else if (!strcmp (p
, "ctor-dtor-privacy"))
689 warn_ctor_dtor_privacy
= setting
;
690 else if (!strcmp (p
, "write-strings"))
691 warn_write_strings
= setting
;
692 else if (!strcmp (p
, "cast-qual"))
693 warn_cast_qual
= setting
;
694 else if (!strcmp (p
, "char-subscripts"))
695 warn_char_subscripts
= setting
;
696 else if (!strcmp (p
, "pointer-arith"))
697 warn_pointer_arith
= setting
;
698 else if (!strcmp (p
, "missing-prototypes"))
699 warn_missing_prototypes
= setting
;
700 else if (!strcmp (p
, "redundant-decls"))
701 warn_redundant_decls
= setting
;
702 else if (!strcmp (p
, "missing-braces"))
703 warn_missing_braces
= setting
;
704 else if (!strcmp (p
, "sign-compare"))
705 warn_sign_compare
= setting
;
706 else if (!strcmp (p
, "format"))
707 warn_format
= setting
;
708 else if (!strcmp (p
, "conversion"))
709 warn_conversion
= setting
;
710 else if (!strcmp (p
, "parentheses"))
711 warn_parentheses
= setting
;
712 else if (!strcmp (p
, "non-virtual-dtor"))
713 warn_nonvdtor
= setting
;
714 else if (!strcmp (p
, "extern-inline"))
715 warn_extern_inline
= setting
;
716 else if (!strcmp (p
, "reorder"))
717 warn_reorder
= setting
;
718 else if (!strcmp (p
, "synth"))
719 warn_synth
= setting
;
720 else if (!strcmp (p
, "pmf-conversions"))
721 warn_pmf2ptr
= setting
;
722 else if (!strcmp (p
, "effc++"))
724 else if (!strcmp (p
, "sign-promo"))
725 warn_sign_promo
= setting
;
726 else if (!strcmp (p
, "old-style-cast"))
727 warn_old_style_cast
= setting
;
728 else if (!strcmp (p
, "overloaded-virtual"))
729 warn_overloaded_virtual
= setting
;
730 else if (!strcmp (p
, "multichar"))
731 warn_multichar
= setting
;
732 else if (!strcmp (p
, "unknown-pragmas"))
733 /* Set to greater than 1, so that even unknown pragmas in
734 system headers will be warned about. */
735 warn_unknown_pragmas
= setting
* 2;
736 else if (!strcmp (p
, "non-template-friend"))
737 warn_nontemplate_friend
= setting
;
738 else if (!strcmp (p
, "deprecated"))
739 warn_deprecated
= setting
;
740 else if (!strcmp (p
, "comment"))
741 ; /* cpp handles this one. */
742 else if (!strcmp (p
, "comments"))
743 ; /* cpp handles this one. */
744 else if (!strcmp (p
, "trigraphs"))
745 ; /* cpp handles this one. */
746 else if (!strcmp (p
, "import"))
747 ; /* cpp handles this one. */
748 else if (!strcmp (p
, "all"))
750 warn_return_type
= setting
;
751 warn_unused
= setting
;
752 warn_implicit
= setting
;
753 warn_switch
= setting
;
754 warn_format
= setting
;
755 warn_parentheses
= setting
;
756 warn_missing_braces
= setting
;
757 warn_sign_compare
= setting
;
758 warn_multichar
= setting
;
759 /* We save the value of warn_uninitialized, since if they put
760 -Wuninitialized on the command line, we need to generate a
761 warning about not using it without also specifying -O. */
762 if (warn_uninitialized
!= 1)
763 warn_uninitialized
= (setting
? 2 : 0);
764 /* Only warn about unknown pragmas that are not in system
766 warn_unknown_pragmas
= 1;
768 /* C++-specific warnings. */
769 warn_ctor_dtor_privacy
= setting
;
770 warn_nonvdtor
= setting
;
771 warn_reorder
= setting
;
772 warn_nontemplate_friend
= setting
;
774 else return strings_processed
;
776 else if (!strcmp (p
, "-ansi"))
777 flag_no_nonansi_builtin
= 1, flag_ansi
= 1,
778 flag_no_gnu_keywords
= 1, flag_operator_names
= 1;
780 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
781 it's probably safe to assume no sane person would ever want to use this
782 under normal circumstances. */
783 else if (!strcmp (p
, "-spew-debug"))
787 return strings_processed
;
792 /* Incorporate `const' and `volatile' qualifiers for member functions.
793 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
794 QUALS is a list of qualifiers. */
797 grok_method_quals (ctype
, function
, quals
)
798 tree ctype
, function
, quals
;
800 tree fntype
= TREE_TYPE (function
);
801 tree raises
= TYPE_RAISES_EXCEPTIONS (fntype
);
802 int type_quals
= TYPE_UNQUALIFIED
;
803 int dup_quals
= TYPE_UNQUALIFIED
;
807 int tq
= cp_type_qual_from_rid (TREE_VALUE (quals
));
813 quals
= TREE_CHAIN (quals
);
817 if (dup_quals
!= TYPE_UNQUALIFIED
)
818 cp_error ("duplicate type qualifiers in %s declaration",
819 TREE_CODE (function
) == FUNCTION_DECL
820 ? "member function" : "type");
822 ctype
= cp_build_qualified_type (ctype
, type_quals
);
823 fntype
= build_cplus_method_type (ctype
, TREE_TYPE (fntype
),
824 (TREE_CODE (fntype
) == METHOD_TYPE
825 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype
))
826 : TYPE_ARG_TYPES (fntype
)));
828 fntype
= build_exception_variant (fntype
, raises
);
830 TREE_TYPE (function
) = fntype
;
834 /* Warn when -fexternal-templates is used and #pragma
835 interface/implementation is not used all the times it should be,
839 warn_if_unknown_interface (decl
)
842 static int already_warned
= 0;
843 if (already_warned
++)
846 if (flag_alt_external_templates
)
848 struct tinst_level
*til
= tinst_for_decl ();
850 char *sf
= input_filename
;
855 input_filename
= til
->file
;
857 cp_warning ("template `%#D' instantiated in file without #pragma interface",
863 cp_warning_at ("template `%#D' defined in file without #pragma interface",
867 /* A subroutine of the parser, to handle a component list. */
870 grok_x_components (specs
)
873 struct pending_inline
**p
;
876 specs
= strip_attrs (specs
);
878 check_tag_decl (specs
);
879 t
= groktypename (build_decl_list (specs
, NULL_TREE
));
881 /* The only case where we need to do anything additional here is an
882 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
883 if (t
== NULL_TREE
|| !ANON_AGGR_TYPE_P (t
))
886 fixup_anonymous_aggr (t
);
887 finish_member_declaration (build_lang_field_decl (FIELD_DECL
,
891 /* Ignore any inline function definitions in the anonymous union
892 since an anonymous union may not have function members. */
893 p
= &pending_inlines
;
894 for (; *p
; *p
= (*p
)->next
)
895 if (DECL_CONTEXT ((*p
)->fndecl
) != t
)
899 /* Constructors for types with virtual baseclasses need an "in-charge" flag
900 saying whether this constructor is responsible for initialization of
901 virtual baseclasses or not. All destructors also need this "in-charge"
902 flag, which additionally determines whether or not the destructor should
903 free the memory for the object.
905 This function adds the "in-charge" flag to member function FN if
906 appropriate. It is called from grokclassfn and tsubst.
907 FN must be either a constructor or destructor. */
910 maybe_retrofit_in_chrg (fn
)
913 tree basetype
, arg_types
, parms
, parm
, fntype
;
915 if (DECL_CONSTRUCTOR_P (fn
)
916 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CLASS_CONTEXT (fn
))
917 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn
))
919 else if (! DECL_CONSTRUCTOR_P (fn
)
920 && TREE_CHAIN (DECL_ARGUMENTS (fn
)) == NULL_TREE
)
925 if (DECL_CONSTRUCTOR_P (fn
))
926 DECL_CONSTRUCTOR_FOR_VBASE_P (fn
) = 1;
928 /* First add it to DECL_ARGUMENTS... */
929 parm
= build_decl (PARM_DECL
, in_charge_identifier
, integer_type_node
);
930 /* Mark the artificial `__in_chrg' parameter as "artificial". */
931 SET_DECL_ARTIFICIAL (parm
);
932 DECL_ARG_TYPE (parm
) = integer_type_node
;
933 TREE_READONLY (parm
) = 1;
934 parms
= DECL_ARGUMENTS (fn
);
935 TREE_CHAIN (parm
) = TREE_CHAIN (parms
);
936 TREE_CHAIN (parms
) = parm
;
938 /* ...and then to TYPE_ARG_TYPES. */
939 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
940 basetype
= TREE_TYPE (TREE_VALUE (arg_types
));
941 arg_types
= hash_tree_chain (integer_type_node
, TREE_CHAIN (arg_types
));
942 fntype
= build_cplus_method_type (basetype
, TREE_TYPE (TREE_TYPE (fn
)),
944 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)))
945 fntype
= build_exception_variant (fntype
,
946 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)));
947 TREE_TYPE (fn
) = fntype
;
950 /* Classes overload their constituent function names automatically.
951 When a function name is declared in a record structure,
952 its name is changed to it overloaded name. Since names for
953 constructors and destructors can conflict, we place a leading
956 CNAME is the name of the class we are grokking for.
958 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
960 FLAGS contains bits saying what's special about today's
961 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
963 If FUNCTION is a destructor, then we must add the `auto-delete' field
964 as a second parameter. There is some hair associated with the fact
965 that we must "declare" this variable in the manner consistent with the
966 way the rest of the arguments were declared.
968 QUALS are the qualifiers for the this pointer. */
971 grokclassfn (ctype
, function
, flags
, quals
)
972 tree ctype
, function
;
973 enum overload_flags flags
;
976 tree fn_name
= DECL_NAME (function
);
981 if (fn_name
== NULL_TREE
)
983 error ("name missing for member function");
984 fn_name
= get_identifier ("<anonymous>");
985 DECL_NAME (function
) = fn_name
;
989 qualtype
= grok_method_quals (ctype
, function
, quals
);
993 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
994 if (TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
996 /* Must add the class instance variable up front. */
997 /* Right now we just make this a pointer. But later
998 we may wish to make it special. */
999 tree type
= TREE_VALUE (arg_types
);
1002 if ((flag_this_is_variable
> 0)
1003 && (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
)))
1006 parm
= build_decl (PARM_DECL
, this_identifier
, type
);
1007 /* Mark the artificial `this' parameter as "artificial". */
1008 SET_DECL_ARTIFICIAL (parm
);
1009 DECL_ARG_TYPE (parm
) = type
;
1010 /* We can make this a register, so long as we don't
1011 accidentally complain if someone tries to take its address. */
1012 DECL_REGISTER (parm
) = 1;
1014 TREE_READONLY (parm
) = 1;
1015 TREE_CHAIN (parm
) = last_function_parms
;
1016 last_function_parms
= parm
;
1019 DECL_ARGUMENTS (function
) = last_function_parms
;
1020 /* First approximations. */
1021 DECL_CONTEXT (function
) = ctype
;
1022 DECL_CLASS_CONTEXT (function
) = ctype
;
1024 if (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
))
1026 maybe_retrofit_in_chrg (function
);
1027 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1030 if (flags
== DTOR_FLAG
)
1032 DECL_ASSEMBLER_NAME (function
) = build_destructor_name (ctype
);
1033 TYPE_HAS_DESTRUCTOR (ctype
) = 1;
1036 set_mangled_name_for_decl (function
);
1039 /* Work on the expr used by alignof (this is only called by the parser). */
1048 if (processing_template_decl
)
1049 return build_min (ALIGNOF_EXPR
, sizetype
, expr
);
1051 if (TREE_CODE (expr
) == COMPONENT_REF
1052 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
1053 error ("`__alignof__' applied to a bit-field");
1055 if (TREE_CODE (expr
) == INDIRECT_REF
)
1057 best
= t
= TREE_OPERAND (expr
, 0);
1058 bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1060 while (TREE_CODE (t
) == NOP_EXPR
1061 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
1064 t
= TREE_OPERAND (t
, 0);
1065 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1066 if (thisalign
> bestalign
)
1067 best
= t
, bestalign
= thisalign
;
1069 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
1073 /* ANSI says arrays and fns are converted inside comma.
1074 But we can't convert them in build_compound_expr
1075 because that would break commas in lvalues.
1076 So do the conversion here if operand was a comma. */
1077 if (TREE_CODE (expr
) == COMPOUND_EXPR
1078 && (TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
1079 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
))
1080 expr
= default_conversion (expr
);
1081 return c_alignof (TREE_TYPE (expr
));
1085 /* Create an ARRAY_REF, checking for the user doing things backwards
1089 grok_array_decl (array_expr
, index_exp
)
1090 tree array_expr
, index_exp
;
1092 tree type
= TREE_TYPE (array_expr
);
1093 tree p1
, p2
, i1
, i2
;
1095 if (type
== error_mark_node
|| index_exp
== error_mark_node
)
1096 return error_mark_node
;
1097 if (processing_template_decl
)
1098 return build_min (ARRAY_REF
, type
? TREE_TYPE (type
) : NULL_TREE
,
1099 array_expr
, index_exp
);
1101 if (type
== NULL_TREE
)
1103 /* Something has gone very wrong. Assume we are mistakenly reducing
1104 an expression instead of a declaration. */
1105 error ("parser may be lost: is there a '{' missing somewhere?");
1109 if (TREE_CODE (type
) == OFFSET_TYPE
1110 || TREE_CODE (type
) == REFERENCE_TYPE
)
1111 type
= TREE_TYPE (type
);
1113 /* If they have an `operator[]', use that. */
1114 if (IS_AGGR_TYPE (type
) || IS_AGGR_TYPE (TREE_TYPE (index_exp
)))
1115 return build_opfncall (ARRAY_REF
, LOOKUP_NORMAL
,
1116 array_expr
, index_exp
, NULL_TREE
);
1118 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1119 is a little-known fact that, if `a' is an array and `i' is an
1120 int, you can write `i[a]', which means the same thing as `a[i]'. */
1122 if (TREE_CODE (type
) == ARRAY_TYPE
)
1125 p1
= build_expr_type_conversion (WANT_POINTER
, array_expr
, 0);
1127 if (TREE_CODE (TREE_TYPE (index_exp
)) == ARRAY_TYPE
)
1130 p2
= build_expr_type_conversion (WANT_POINTER
, index_exp
, 0);
1132 i1
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, array_expr
, 0);
1133 i2
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, index_exp
, 0);
1135 if ((p1
&& i2
) && (i1
&& p2
))
1136 error ("ambiguous conversion for array subscript");
1139 array_expr
= p1
, index_exp
= i2
;
1141 array_expr
= p2
, index_exp
= i1
;
1144 cp_error ("invalid types `%T[%T]' for array subscript",
1145 type
, TREE_TYPE (index_exp
));
1146 return error_mark_node
;
1149 if (array_expr
== error_mark_node
|| index_exp
== error_mark_node
)
1150 error ("ambiguous conversion for array subscript");
1152 return build_array_ref (array_expr
, index_exp
);
1155 /* Given the cast expression EXP, checking out its validity. Either return
1156 an error_mark_node if there was an unavoidable error, return a cast to
1157 void for trying to delete a pointer w/ the value 0, or return the
1158 call to delete. If DOING_VEC is 1, we handle things differently
1159 for doing an array delete. If DOING_VEC is 2, they gave us the
1160 array size as an argument to delete.
1161 Implements ARM $5.3.4. This is called from the parser. */
1164 delete_sanity (exp
, size
, doing_vec
, use_global_delete
)
1166 int doing_vec
, use_global_delete
;
1169 /* For a regular vector delete (aka, no size argument) we will pass
1170 this down as a NULL_TREE into build_vec_delete. */
1171 tree maxindex
= NULL_TREE
;
1173 if (exp
== error_mark_node
)
1176 if (processing_template_decl
)
1178 t
= build_min (DELETE_EXPR
, void_type_node
, exp
, size
);
1179 DELETE_EXPR_USE_GLOBAL (t
) = use_global_delete
;
1180 DELETE_EXPR_USE_VEC (t
) = doing_vec
;
1184 if (TREE_CODE (exp
) == OFFSET_REF
)
1185 exp
= resolve_offset_ref (exp
);
1186 exp
= convert_from_reference (exp
);
1187 t
= stabilize_reference (exp
);
1188 t
= build_expr_type_conversion (WANT_POINTER
, t
, 1);
1190 if (t
== NULL_TREE
|| t
== error_mark_node
)
1192 cp_error ("type `%#T' argument given to `delete', expected pointer",
1194 return error_mark_node
;
1199 maxindex
= build_binary_op (MINUS_EXPR
, size
, integer_one_node
);
1200 pedwarn ("anachronistic use of array size in vector delete");
1203 type
= TREE_TYPE (t
);
1205 /* As of Valley Forge, you can delete a pointer to const. */
1207 /* You can't delete functions. */
1208 if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
1210 error ("cannot delete a function");
1211 return error_mark_node
;
1214 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1215 if (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
)
1216 cp_warning ("`%T' is not a pointer-to-object type", type
);
1218 /* An array can't have been allocated by new, so complain. */
1219 if (TREE_CODE (t
) == ADDR_EXPR
1220 && TREE_CODE (TREE_OPERAND (t
, 0)) == VAR_DECL
1221 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == ARRAY_TYPE
)
1222 cp_warning ("deleting array `%#D'", TREE_OPERAND (t
, 0));
1224 /* Deleting a pointer with the value zero is valid and has no effect. */
1225 if (integer_zerop (t
))
1226 return build1 (NOP_EXPR
, void_type_node
, t
);
1229 return build_vec_delete (t
, maxindex
, integer_one_node
,
1230 integer_zero_node
, use_global_delete
);
1233 if (IS_AGGR_TYPE (TREE_TYPE (type
))
1234 && TYPE_GETS_REG_DELETE (TREE_TYPE (type
)))
1236 /* Only do access checking here; we'll be calling op delete
1237 from the destructor. */
1238 tree tmp
= build_op_delete_call (DELETE_EXPR
, t
, size_zero_node
,
1239 LOOKUP_NORMAL
, NULL_TREE
);
1240 if (tmp
== error_mark_node
)
1241 return error_mark_node
;
1244 return build_delete (type
, t
, integer_three_node
,
1245 LOOKUP_NORMAL
, use_global_delete
);
1249 /* Report an error if the indicated template declaration is not the
1250 sort of thing that should be a member template. */
1253 check_member_template (tmpl
)
1258 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
1259 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1261 if (TREE_CODE (decl
) == FUNCTION_DECL
1262 || (TREE_CODE (decl
) == TYPE_DECL
1263 && IS_AGGR_TYPE (TREE_TYPE (decl
))))
1265 if (current_function_decl
)
1266 /* 14.5.2.2 [temp.mem]
1268 A local class shall not have member templates. */
1269 cp_error ("declaration of member template `%#D' in local class",
1272 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
1274 /* 14.5.2.3 [temp.mem]
1276 A member function template shall not be virtual. */
1278 ("invalid use of `virtual' in template declaration of `%#D'",
1280 DECL_VIRTUAL_P (decl
) = 0;
1283 /* The debug-information generating code doesn't know what to do
1284 with member templates. */
1285 DECL_IGNORED_P (tmpl
) = 1;
1288 cp_error ("template declaration of `%#D'", decl
);
1291 /* Return true iff TYPE is a valid Java parameter or return type. */
1294 acceptable_java_type (type
)
1297 if (TREE_CODE (type
) == VOID_TYPE
|| TYPE_FOR_JAVA (type
))
1299 if (TREE_CODE (type
) == POINTER_TYPE
)
1301 type
= TREE_TYPE (type
);
1302 if (TREE_CODE (type
) == RECORD_TYPE
)
1305 if (! TYPE_FOR_JAVA (type
))
1307 if (! CLASSTYPE_TEMPLATE_INFO (type
))
1309 args
= CLASSTYPE_TI_ARGS (type
);
1310 i
= TREE_VEC_LENGTH (args
);
1313 type
= TREE_VEC_ELT (args
, i
);
1314 if (TREE_CODE (type
) == POINTER_TYPE
)
1315 type
= TREE_TYPE (type
);
1316 if (! TYPE_FOR_JAVA (type
))
1325 /* For a METHOD in a Java class CTYPE, return 1 if
1326 the parameter and return types are valid Java types.
1327 Otherwise, print appropriate error messages, and return 0. */
1330 check_java_method (method
)
1334 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (method
));
1335 tree ret_type
= TREE_TYPE (TREE_TYPE (method
));
1336 if (! acceptable_java_type (ret_type
))
1338 cp_error ("Java method '%D' has non-Java return type `%T'",
1342 for (; arg_types
!= NULL_TREE
; arg_types
= TREE_CHAIN (arg_types
))
1344 tree type
= TREE_VALUE (arg_types
);
1345 if (! acceptable_java_type (type
))
1347 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1352 return jerr
? 0 : 1;
1355 /* Sanity check: report error if this function FUNCTION is not
1356 really a member of the class (CTYPE) it is supposed to belong to.
1357 CNAME is the same here as it is for grokclassfn above. */
1360 check_classfn (ctype
, function
)
1361 tree ctype
, function
;
1363 tree fn_name
= DECL_NAME (function
);
1364 tree fndecl
, fndecls
;
1365 tree method_vec
= CLASSTYPE_METHOD_VEC (complete_type (ctype
));
1369 if (DECL_USE_TEMPLATE (function
)
1370 && is_member_template (DECL_TI_TEMPLATE (function
)))
1371 /* Since this is a specialization of a member template,
1372 we're not going to find the declaration in the class.
1375 struct S { template <typename T> void f(T); };
1376 template <> void S::f(int);
1378 we're not going to find `S::f(int)', but there's no
1379 reason we should, either. We let our callers know we didn't
1380 find the method, but we don't complain. */
1383 if (method_vec
!= 0)
1385 methods
= &TREE_VEC_ELT (method_vec
, 0);
1386 end
= TREE_VEC_END (method_vec
);
1388 /* First suss out ctors and dtors. */
1389 if (*methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1390 && DECL_CONSTRUCTOR_P (function
))
1392 if (*++methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1393 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
)))
1396 while (++methods
!= end
&& *methods
)
1399 if (fn_name
== DECL_NAME (OVL_CURRENT (*methods
)))
1402 for (fndecls
= *methods
; fndecls
!= NULL_TREE
;
1403 fndecls
= OVL_NEXT (fndecls
))
1405 fndecl
= OVL_CURRENT (fndecls
);
1406 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1407 for a for member function of a template class, is
1408 not mangled, so the check below does not work
1409 correctly in that case. Since mangled destructor
1410 names do not include the type of the arguments,
1411 we can't use this short-cut for them, either.
1412 (It's not legal to declare arguments for a
1413 destructor, but some people try.) */
1414 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
))
1415 && (DECL_ASSEMBLER_NAME (function
)
1416 != DECL_NAME (function
))
1417 && (DECL_ASSEMBLER_NAME (fndecl
)
1418 != DECL_NAME (fndecl
))
1419 && (DECL_ASSEMBLER_NAME (function
)
1420 == DECL_ASSEMBLER_NAME (fndecl
)))
1423 /* We cannot simply call decls_match because this
1424 doesn't work for static member functions that are
1425 pretending to be methods, and because the name
1426 may have been changed by asm("new_name"). */
1427 if (DECL_NAME (function
) == DECL_NAME (fndecl
))
1429 tree p1
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1430 tree p2
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1432 /* Get rid of the this parameter on functions that become
1434 if (DECL_STATIC_FUNCTION_P (fndecl
)
1435 && TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1436 p1
= TREE_CHAIN (p1
);
1438 if (same_type_p (TREE_TYPE (TREE_TYPE (function
)),
1439 TREE_TYPE (TREE_TYPE (fndecl
)))
1440 && compparms (p1
, p2
)
1441 && (DECL_TEMPLATE_SPECIALIZATION (function
)
1442 == DECL_TEMPLATE_SPECIALIZATION (fndecl
))
1443 && (!DECL_TEMPLATE_SPECIALIZATION (function
)
1444 || (DECL_TI_TEMPLATE (function
)
1445 == DECL_TI_TEMPLATE (fndecl
))))
1454 if (methods
!= end
&& *methods
)
1456 tree fndecl
= *methods
;
1457 cp_error ("prototype for `%#D' does not match any in class `%T'",
1459 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl
) ? "s are" : " is",
1460 OVL_CURRENT (fndecl
));
1461 while (fndecl
= OVL_NEXT (fndecl
), fndecl
)
1462 cp_error_at (" %#D", OVL_CURRENT(fndecl
));
1467 if (TYPE_SIZE (ctype
) == 0)
1468 incomplete_type_error (function
, ctype
);
1470 cp_error ("no `%#D' member function declared in class `%T'",
1474 /* If we did not find the method in the class, add it to avoid
1475 spurious errors (unless the CTYPE is not yet defined, in which
1476 case we'll only confuse ourselves when the function is declared
1477 properly within the class. */
1478 if (TYPE_SIZE (ctype
))
1479 add_method (ctype
, methods
, function
);
1483 /* We have just processed the DECL, which is a static data member.
1484 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1485 present, is the assembly-language name for the data member.
1486 NEED_POP and FLAGS are as for cp_finish_decl. */
1489 finish_static_data_member_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
1499 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1501 my_friendly_assert (TREE_PUBLIC (decl
), 0);
1503 /* We cannot call pushdecl here, because that would fill in the
1504 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1505 the right thing, namely, to put this decl out straight away. */
1506 /* current_class_type can be NULL_TREE in case of error. */
1507 if (!asmspec
&& current_class_type
)
1509 DECL_INITIAL (decl
) = error_mark_node
;
1510 DECL_ASSEMBLER_NAME (decl
)
1511 = build_static_name (current_class_type
, DECL_NAME (decl
));
1513 if (! processing_template_decl
)
1515 if (!pending_statics
)
1516 VARRAY_TREE_INIT (pending_statics
, 32, "pending_statics");
1518 if (pending_statics_used
== pending_statics
->num_elements
)
1519 VARRAY_GROW (pending_statics
,
1520 2 * pending_statics
->num_elements
);
1521 VARRAY_TREE (pending_statics
, pending_statics_used
) = decl
;
1522 ++pending_statics_used
;
1525 /* Static consts need not be initialized in the class definition. */
1526 if (init
!= NULL_TREE
&& TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
1528 static int explanation
= 0;
1530 error ("initializer invalid for static member with constructor");
1531 if (explanation
++ == 0)
1532 error ("(you really want to initialize it separately)");
1535 /* Force the compiler to know when an uninitialized static const
1536 member is being used. */
1537 if (CP_TYPE_CONST_P (TREE_TYPE (decl
)) && init
== 0)
1538 TREE_USED (decl
) = 1;
1539 DECL_INITIAL (decl
) = init
;
1540 DECL_IN_AGGR_P (decl
) = 1;
1541 DECL_CONTEXT (decl
) = current_class_type
;
1542 DECL_CLASS_CONTEXT (decl
) = current_class_type
;
1544 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
);
1547 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1548 of a structure component, returning a FIELD_DECL node.
1549 QUALS is a list of type qualifiers for this decl (such as for declaring
1550 const member functions).
1552 This is done during the parsing of the struct declaration.
1553 The FIELD_DECL nodes are chained together and the lot of them
1554 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1558 If class A defines that certain functions in class B are friends, then
1559 the way I have set things up, it is B who is interested in permission
1560 granted by A. However, it is in A's context that these declarations
1561 are parsed. By returning a void_type_node, class A does not attempt
1562 to incorporate the declarations of the friends within its structure.
1564 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1565 CHANGES TO CODE IN `start_method'. */
1568 grokfield (declarator
, declspecs
, init
, asmspec_tree
, attrlist
)
1569 tree declarator
, declspecs
, init
, asmspec_tree
, attrlist
;
1571 register tree value
;
1573 int flags
= LOOKUP_ONLYCONVERTING
;
1575 /* Convert () initializers to = initializers. */
1576 if (init
== NULL_TREE
&& declarator
!= NULL_TREE
1577 && TREE_CODE (declarator
) == CALL_EXPR
1578 && TREE_OPERAND (declarator
, 0)
1579 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) == IDENTIFIER_NODE
1580 || TREE_CODE (TREE_OPERAND (declarator
, 0)) == SCOPE_REF
)
1581 && parmlist_is_exprlist (TREE_OPERAND (declarator
, 1)))
1583 init
= TREE_OPERAND (declarator
, 1);
1584 declarator
= TREE_OPERAND (declarator
, 0);
1588 if (declspecs
== NULL_TREE
1589 && TREE_CODE (declarator
) == SCOPE_REF
1590 && TREE_CODE (TREE_OPERAND (declarator
, 1)) == IDENTIFIER_NODE
)
1592 /* Access declaration */
1593 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator
, 0))))
1595 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
1596 pop_nested_class ();
1597 return do_class_using_decl (declarator
);
1601 && TREE_CODE (init
) == TREE_LIST
1602 && TREE_VALUE (init
) == error_mark_node
1603 && TREE_CHAIN (init
) == NULL_TREE
)
1606 value
= grokdeclarator (declarator
, declspecs
, FIELD
, init
!= 0, attrlist
);
1607 if (! value
|| value
== error_mark_node
)
1608 /* friend or constructor went bad. */
1611 /* Pass friendly classes back. */
1612 if (TREE_CODE (value
) == VOID_TYPE
)
1613 return void_type_node
;
1615 if (DECL_NAME (value
) != NULL_TREE
1616 && IDENTIFIER_POINTER (DECL_NAME (value
))[0] == '_'
1617 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value
)), "_vptr"))
1618 cp_error ("member `%D' conflicts with virtual function table field name",
1621 /* Stash away type declarations. */
1622 if (TREE_CODE (value
) == TYPE_DECL
)
1624 DECL_NONLOCAL (value
) = 1;
1625 DECL_CONTEXT (value
) = current_class_type
;
1626 DECL_CLASS_CONTEXT (value
) = current_class_type
;
1628 /* Now that we've updated the context, we need to remangle the
1629 name for this TYPE_DECL. */
1630 DECL_ASSEMBLER_NAME (value
) = DECL_NAME (value
);
1631 if (!uses_template_parms (value
))
1632 DECL_ASSEMBLER_NAME (value
) =
1633 get_identifier (build_overload_name (TREE_TYPE (value
), 1, 1));
1638 if (IS_SIGNATURE (current_class_type
)
1639 && TREE_CODE (value
) != FUNCTION_DECL
)
1641 error ("field declaration not allowed in signature");
1642 return void_type_node
;
1645 if (DECL_IN_AGGR_P (value
))
1647 cp_error ("`%D' is already defined in `%T'", value
,
1648 DECL_CONTEXT (value
));
1649 return void_type_node
;
1653 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1657 if (IS_SIGNATURE (current_class_type
)
1658 && TREE_CODE (value
) == FUNCTION_DECL
)
1660 error ("function declarations cannot have initializers in signature");
1663 else if (TREE_CODE (value
) == FUNCTION_DECL
)
1665 grok_function_init (value
, init
);
1668 else if (pedantic
&& TREE_CODE (value
) != VAR_DECL
)
1669 /* Already complained in grokdeclarator. */
1673 /* We allow initializers to become parameters to base
1675 if (TREE_CODE (init
) == TREE_LIST
)
1677 if (TREE_CHAIN (init
) == NULL_TREE
)
1678 init
= TREE_VALUE (init
);
1680 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1683 if (TREE_CODE (init
) == CONST_DECL
)
1684 init
= DECL_INITIAL (init
);
1685 else if (TREE_READONLY_DECL_P (init
))
1686 init
= decl_constant_value (init
);
1687 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1688 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1689 my_friendly_assert (TREE_PERMANENT (init
), 192);
1690 if (init
== error_mark_node
)
1691 /* We must make this look different than `error_mark_node'
1692 because `decl_const_value' would mis-interpret it
1693 as only meaning that this VAR_DECL is defined. */
1694 init
= build1 (NOP_EXPR
, TREE_TYPE (value
), init
);
1695 else if (processing_template_decl
)
1697 else if (! TREE_CONSTANT (init
))
1699 /* We can allow references to things that are effectively
1700 static, since references are initialized with the address. */
1701 if (TREE_CODE (TREE_TYPE (value
)) != REFERENCE_TYPE
1702 || (TREE_STATIC (init
) == 0
1703 && (TREE_CODE_CLASS (TREE_CODE (init
)) != 'd'
1704 || DECL_EXTERNAL (init
) == 0)))
1706 error ("field initializer is not constant");
1707 init
= error_mark_node
;
1713 /* The corresponding pop_obstacks is in cp_finish_decl. */
1714 push_obstacks_nochange ();
1716 if (processing_template_decl
&& ! current_function_decl
1717 && (TREE_CODE (value
) == VAR_DECL
|| TREE_CODE (value
) == FUNCTION_DECL
))
1718 value
= push_template_decl (value
);
1721 cplus_decl_attributes (value
, TREE_PURPOSE (attrlist
),
1722 TREE_VALUE (attrlist
));
1724 if (TREE_CODE (value
) == VAR_DECL
)
1726 finish_static_data_member_decl (value
, init
, asmspec_tree
,
1727 /*need_pop=*/1, flags
);
1730 if (TREE_CODE (value
) == FIELD_DECL
)
1734 /* This must override the asm specifier which was placed
1735 by grokclassfn. Lay this out fresh. */
1736 DECL_RTL (value
) = NULL_RTX
;
1737 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1739 if (DECL_INITIAL (value
) == error_mark_node
)
1740 init
= error_mark_node
;
1741 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1742 DECL_INITIAL (value
) = init
;
1743 DECL_IN_AGGR_P (value
) = 1;
1746 if (TREE_CODE (value
) == FUNCTION_DECL
)
1750 /* This must override the asm specifier which was placed
1751 by grokclassfn. Lay this out fresh. */
1752 DECL_RTL (value
) = NULL_RTX
;
1753 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1755 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1757 /* Pass friends back this way. */
1758 if (DECL_FRIEND_P (value
))
1759 return void_type_node
;
1761 #if 0 /* Just because a fn is declared doesn't mean we'll try to define it. */
1762 if (current_function_decl
&& ! IS_SIGNATURE (current_class_type
))
1763 cp_error ("method `%#D' of local class must be defined in class body",
1767 DECL_IN_AGGR_P (value
) = 1;
1770 my_friendly_abort (21);
1775 /* Like `grokfield', but for bitfields.
1776 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1779 grokbitfield (declarator
, declspecs
, width
)
1780 tree declarator
, declspecs
, width
;
1782 register tree value
= grokdeclarator (declarator
, declspecs
, BITFIELD
,
1785 if (! value
) return NULL_TREE
; /* friends went bad. */
1787 /* Pass friendly classes back. */
1788 if (TREE_CODE (value
) == VOID_TYPE
)
1789 return void_type_node
;
1791 if (TREE_CODE (value
) == TYPE_DECL
)
1793 cp_error ("cannot declare `%D' to be a bitfield type", value
);
1797 /* Usually, finish_struct_1 catches bitifields with invalid types.
1798 But, in the case of bitfields with function type, we confuse
1799 ourselves into thinking they are member functions, so we must
1801 if (TREE_CODE (value
) == FUNCTION_DECL
)
1803 cp_error ("cannot declare bitfield `%D' with funcion type",
1808 if (IS_SIGNATURE (current_class_type
))
1810 error ("field declaration not allowed in signature");
1811 return void_type_node
;
1814 if (DECL_IN_AGGR_P (value
))
1816 cp_error ("`%D' is already defined in the class %T", value
,
1817 DECL_CONTEXT (value
));
1818 return void_type_node
;
1821 GNU_xref_member (current_class_name
, value
);
1823 if (TREE_STATIC (value
))
1825 cp_error ("static member `%D' cannot be a bitfield", value
);
1828 cp_finish_decl (value
, NULL_TREE
, NULL_TREE
, 0, 0);
1830 if (width
!= error_mark_node
)
1832 constant_expression_warning (width
);
1833 DECL_INITIAL (value
) = width
;
1834 SET_DECL_C_BIT_FIELD (value
);
1837 DECL_IN_AGGR_P (value
) = 1;
1842 grokoptypename (declspecs
, declarator
)
1843 tree declspecs
, declarator
;
1845 tree t
= grokdeclarator (declarator
, declspecs
, TYPENAME
, 0, NULL_TREE
);
1846 return build_typename_overload (t
);
1849 /* When a function is declared with an initializer,
1850 do the right thing. Currently, there are two possibilities:
1855 // initialization possibility #1.
1856 virtual void f () = 0;
1878 // initialization possibility #2
1885 copy_assignment_arg_p (parmtype
, virtualp
)
1887 int virtualp ATTRIBUTE_UNUSED
;
1889 if (current_class_type
== NULL_TREE
)
1892 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
1893 parmtype
= TREE_TYPE (parmtype
);
1895 if ((TYPE_MAIN_VARIANT (parmtype
) == current_class_type
)
1897 /* Non-standard hack to support old Booch components. */
1898 || (! virtualp
&& DERIVED_FROM_P (parmtype
, current_class_type
))
1907 grok_function_init (decl
, init
)
1911 /* An initializer for a function tells how this function should
1913 tree type
= TREE_TYPE (decl
);
1915 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1916 cp_error ("initializer specified for non-member function `%D'", decl
);
1918 /* We'll check for this in finish_struct_1. */
1919 else if (DECL_VINDEX (decl
) == NULL_TREE
)
1920 cp_error ("initializer specified for non-virtual method `%D'", decl
);
1922 else if (integer_zerop (init
))
1925 /* Mark this function as being "defined". */
1926 DECL_INITIAL (decl
) = error_mark_node
;
1927 /* pure virtual destructors must be defined. */
1928 /* pure virtual needs to be defined (as abort) only when put in
1929 vtbl. For wellformed call, it should be itself. pr4737 */
1930 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl
)))
1932 extern tree abort_fndecl
;
1933 /* Give this node rtl from `abort'. */
1934 DECL_RTL (decl
) = DECL_RTL (abort_fndecl
);
1937 DECL_ABSTRACT_VIRTUAL_P (decl
) = 1;
1938 if (DECL_NAME (decl
) == ansi_opname
[(int) MODIFY_EXPR
])
1941 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
))));
1943 if (copy_assignment_arg_p (parmtype
, 1))
1944 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type
) = 1;
1948 cp_error ("invalid initializer for virtual method `%D'", decl
);
1952 cplus_decl_attributes (decl
, attributes
, prefix_attributes
)
1953 tree decl
, attributes
, prefix_attributes
;
1955 if (decl
== NULL_TREE
|| decl
== void_type_node
)
1958 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
1959 decl
= DECL_TEMPLATE_RESULT (decl
);
1961 decl_attributes (decl
, attributes
, prefix_attributes
);
1963 if (TREE_CODE (decl
) == TYPE_DECL
)
1964 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl
), TREE_TYPE (decl
));
1967 /* CONSTRUCTOR_NAME:
1968 Return the name for the constructor (or destructor) for the
1969 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1970 IDENTIFIER_NODE. When given a template, this routine doesn't
1971 lose the specialization. */
1974 constructor_name_full (thing
)
1977 if (TREE_CODE (thing
) == TEMPLATE_TYPE_PARM
1978 || TREE_CODE (thing
) == TEMPLATE_TEMPLATE_PARM
1979 || TREE_CODE (thing
) == TYPENAME_TYPE
)
1980 thing
= TYPE_NAME (thing
);
1981 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing
)))
1983 if (TYPE_WAS_ANONYMOUS (thing
) && TYPE_HAS_CONSTRUCTOR (thing
))
1984 thing
= DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing
), 0)));
1986 thing
= TYPE_NAME (thing
);
1988 if (TREE_CODE (thing
) == TYPE_DECL
1989 || (TREE_CODE (thing
) == TEMPLATE_DECL
1990 && TREE_CODE (DECL_TEMPLATE_RESULT (thing
)) == TYPE_DECL
))
1991 thing
= DECL_NAME (thing
);
1992 my_friendly_assert (TREE_CODE (thing
) == IDENTIFIER_NODE
, 197);
1996 /* CONSTRUCTOR_NAME:
1997 Return the name for the constructor (or destructor) for the
1998 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1999 IDENTIFIER_NODE. When given a template, return the plain
2000 unspecialized name. */
2003 constructor_name (thing
)
2007 thing
= constructor_name_full (thing
);
2008 t
= IDENTIFIER_TEMPLATE (thing
);
2014 /* Cache the value of this class's main virtual function table pointer
2015 in a register variable. This will save one indirection if a
2016 more than one virtual function call is made this function. */
2021 extern tree base_init_expr
;
2023 if (base_init_expr
== 0
2024 && DECL_CONSTRUCTOR_P (current_function_decl
))
2026 if (processing_template_decl
)
2027 add_tree (build_min_nt
2029 current_member_init_list
, current_base_init_list
));
2031 emit_base_init (current_class_type
, 0);
2035 /* Record the existence of an addressable inline function. */
2038 mark_inline_for_output (decl
)
2041 decl
= DECL_MAIN_VARIANT (decl
);
2042 if (DECL_SAVED_INLINE (decl
))
2044 my_friendly_assert (TREE_PERMANENT (decl
), 363);
2045 DECL_SAVED_INLINE (decl
) = 1;
2047 VARRAY_TREE_INIT (saved_inlines
, 32, "saved_inlines");
2049 if (saved_inlines_used
== saved_inlines
->num_elements
)
2050 VARRAY_GROW (saved_inlines
,
2051 2 * saved_inlines
->num_elements
);
2052 VARRAY_TREE (saved_inlines
, saved_inlines_used
) = decl
;
2053 ++saved_inlines_used
;
2059 temp_name_counter
= 0;
2062 /* Hand off a unique name which can be used for variable we don't really
2063 want to know about anyway, for example, the anonymous variables which
2064 are needed to make references work. Declare this thing so we can use it.
2065 The variable created will be of type TYPE.
2067 STATICP is nonzero if this variable should be static. */
2070 get_temp_name (type
, staticp
)
2074 char buf
[sizeof (AUTO_TEMP_FORMAT
) + 20];
2076 int toplev
= toplevel_bindings_p ();
2078 push_obstacks_nochange ();
2079 if (toplev
|| staticp
)
2081 end_temporary_allocation ();
2082 sprintf (buf
, AUTO_TEMP_FORMAT
, global_temp_name_counter
++);
2083 decl
= pushdecl_top_level (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2087 sprintf (buf
, AUTO_TEMP_FORMAT
, temp_name_counter
++);
2088 decl
= pushdecl (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2090 TREE_USED (decl
) = 1;
2091 TREE_STATIC (decl
) = staticp
;
2092 DECL_ARTIFICIAL (decl
) = 1;
2094 /* If this is a local variable, then lay out its rtl now.
2095 Otherwise, callers of this function are responsible for dealing
2096 with this variable's rtl. */
2100 expand_decl_init (decl
);
2107 /* Get a variable which we can use for multiple assignments.
2108 It is not entered into current_binding_level, because
2109 that breaks things when it comes time to do final cleanups
2110 (which take place "outside" the binding contour of the function). */
2113 get_temp_regvar (type
, init
)
2118 decl
= build_decl (VAR_DECL
, NULL_TREE
, type
);
2119 TREE_USED (decl
) = 1;
2120 DECL_REGISTER (decl
) = 1;
2121 DECL_ARTIFICIAL (decl
) = 1;
2123 DECL_RTL (decl
) = assign_temp (type
, 2, 0, 1);
2124 /* We can expand these without fear, since they cannot need
2125 constructors or destructors. */
2126 expand_expr (build_modify_expr (decl
, INIT_EXPR
, init
),
2127 NULL_RTX
, VOIDmode
, 0);
2132 /* Hunts through the global anonymous union ANON_DECL, building
2133 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2134 returns a VAR_DECL whose size is the same as the size of the
2135 ANON_DECL, if one is available. */
2138 build_anon_union_vars (anon_decl
, elems
, static_p
, external_p
)
2144 tree type
= TREE_TYPE (anon_decl
);
2145 tree main_decl
= NULL_TREE
;
2148 /* Rather than write the code to handle the non-union case,
2149 just give an error. */
2150 if (TREE_CODE (type
) != UNION_TYPE
)
2151 error ("anonymous struct not inside named type");
2153 for (field
= TYPE_FIELDS (type
);
2155 field
= TREE_CHAIN (field
))
2159 if (DECL_ARTIFICIAL (field
))
2161 if (TREE_CODE (field
) != FIELD_DECL
)
2163 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2168 if (TREE_PRIVATE (field
))
2169 cp_pedwarn_at ("private member `%#D' in anonymous union", field
);
2170 else if (TREE_PROTECTED (field
))
2171 cp_pedwarn_at ("protected member `%#D' in anonymous union", field
);
2173 if (DECL_NAME (field
) == NULL_TREE
2174 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2176 decl
= build_anon_union_vars (field
, elems
, static_p
, external_p
);
2180 else if (DECL_NAME (field
) == NULL_TREE
)
2184 decl
= build_decl (VAR_DECL
, DECL_NAME (field
), TREE_TYPE (field
));
2185 /* tell `pushdecl' that this is not tentative. */
2186 DECL_INITIAL (decl
) = error_mark_node
;
2187 TREE_PUBLIC (decl
) = 0;
2188 TREE_STATIC (decl
) = static_p
;
2189 DECL_EXTERNAL (decl
) = external_p
;
2190 decl
= pushdecl (decl
);
2191 DECL_INITIAL (decl
) = NULL_TREE
;
2194 /* Only write out one anon union element--choose the one that
2195 can hold them all. */
2196 if (main_decl
== NULL_TREE
2197 && simple_cst_equal (DECL_SIZE (decl
),
2198 DECL_SIZE (anon_decl
)) == 1)
2201 /* ??? This causes there to be no debug info written out
2203 TREE_ASM_WRITTEN (decl
) = 1;
2205 if (DECL_NAME (field
) == NULL_TREE
2206 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2207 /* The remainder of the processing was already done in the
2211 /* If there's a cleanup to do, it belongs in the
2212 TREE_PURPOSE of the following TREE_LIST. */
2213 *elems
= scratch_tree_cons (NULL_TREE
, decl
, *elems
);
2214 TREE_TYPE (*elems
) = type
;
2220 /* Finish off the processing of a UNION_TYPE structure.
2221 If there are static members, then all members are
2222 static, and must be laid out together. If the
2223 union is an anonymous union, we arrange for that
2224 as well. PUBLIC_P is nonzero if this union is
2225 not declared static. */
2228 finish_anon_union (anon_union_decl
)
2229 tree anon_union_decl
;
2231 tree type
= TREE_TYPE (anon_union_decl
);
2232 tree elems
= NULL_TREE
;
2234 int public_p
= TREE_PUBLIC (anon_union_decl
);
2235 int static_p
= TREE_STATIC (anon_union_decl
);
2236 int external_p
= DECL_EXTERNAL (anon_union_decl
);
2238 if (TYPE_FIELDS (type
) == NULL_TREE
)
2243 error ("global anonymous unions must be declared static");
2247 main_decl
= build_anon_union_vars (anon_union_decl
, &elems
,
2248 static_p
, external_p
);
2250 if (main_decl
== NULL_TREE
)
2252 warning ("anonymous union with no members");
2258 make_decl_rtl (main_decl
, 0, toplevel_bindings_p ());
2259 DECL_RTL (anon_union_decl
) = DECL_RTL (main_decl
);
2262 /* The following call assumes that there are never any cleanups
2263 for anonymous unions--a reasonable assumption. */
2264 expand_anon_union_decl (anon_union_decl
, NULL_TREE
, elems
);
2267 /* Finish processing a builtin type TYPE. It's name is NAME,
2268 its fields are in the array FIELDS. LEN is the number of elements
2269 in FIELDS minus one, or put another way, it is the maximum subscript
2272 It is given the same alignment as ALIGN_TYPE. */
2275 finish_builtin_type (type
, name
, fields
, len
, align_type
)
2284 TYPE_FIELDS (type
) = fields
[0];
2285 for (i
= 0; i
< len
; i
++)
2287 layout_type (TREE_TYPE (fields
[i
]));
2288 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2289 TREE_CHAIN (fields
[i
]) = fields
[i
+1];
2291 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2292 DECL_CLASS_CONTEXT (fields
[i
]) = type
;
2293 TYPE_ALIGN (type
) = TYPE_ALIGN (align_type
);
2295 #if 0 /* not yet, should get fixed properly later */
2296 TYPE_NAME (type
) = make_type_decl (get_identifier (name
), type
);
2298 TYPE_NAME (type
) = build_decl (TYPE_DECL
, get_identifier (name
), type
);
2300 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2301 layout_decl (TYPE_NAME (type
), 0);
2304 /* Auxiliary functions to make type signatures for
2305 `operator new' and `operator delete' correspond to
2306 what compiler will be expecting. */
2309 coerce_new_type (type
)
2314 if (TREE_CODE (type
) == METHOD_TYPE
)
2315 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (TYPE_ARG_TYPES (type
)));
2316 if (! same_type_p (TREE_TYPE (type
), ptr_type_node
))
2317 e1
= 1, error ("`operator new' must return type `void *'");
2319 /* Technically the type must be `size_t', but we may not know
2321 if (TYPE_ARG_TYPES (type
) == NULL_TREE
)
2322 e1
= 1, error ("`operator new' takes type `size_t' parameter");
2323 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type
)), sizetype
))
2324 e2
= 1, error ("`operator new' takes type `size_t' as first parameter");
2326 type
= build_function_type (ptr_type_node
, tree_cons (NULL_TREE
, sizetype
, TREE_CHAIN (TYPE_ARG_TYPES (type
))));
2328 type
= build_function_type (ptr_type_node
, TYPE_ARG_TYPES (type
));
2333 coerce_delete_type (type
)
2340 tree arg_types
= TYPE_ARG_TYPES (type
);
2342 if (TREE_CODE (type
) == METHOD_TYPE
)
2344 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (arg_types
));
2345 arg_types
= TREE_CHAIN (arg_types
);
2348 if (TREE_TYPE (type
) != void_type_node
)
2349 e1
= 1, error ("`operator delete' must return type `void'");
2351 if (arg_types
== NULL_TREE
2352 || ! same_type_p (TREE_VALUE (arg_types
), ptr_type_node
))
2353 e2
= 1, error ("`operator delete' takes type `void *' as first parameter");
2357 && TREE_CHAIN (arg_types
)
2358 && TREE_CHAIN (arg_types
) != void_list_node
)
2360 /* Again, technically this argument must be `size_t', but again
2361 we may not know what that is. */
2362 tree t2
= TREE_VALUE (TREE_CHAIN (arg_types
));
2363 if (! same_type_p (t2
, sizetype
))
2364 e3
= 1, error ("second argument to `operator delete' must be of type `size_t'");
2365 else if (TREE_CHAIN (TREE_CHAIN (arg_types
)) != void_list_node
)
2368 if (TREE_CHAIN (TREE_CHAIN (arg_types
)))
2369 error ("too many arguments in declaration of `operator delete'");
2371 error ("`...' invalid in specification of `operator delete'");
2376 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2377 build_tree_list (NULL_TREE
, sizetype
));
2380 if (arg_types
== NULL_TREE
)
2381 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
2383 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, TREE_CHAIN (arg_types
));
2389 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2390 arg_types
? TREE_CHAIN (arg_types
): NULL_TREE
);
2392 type
= build_function_type (void_type_node
, arg_types
);
2398 mark_vtable_entries (decl
)
2401 tree entries
= CONSTRUCTOR_ELTS (DECL_INITIAL (decl
));
2403 for (; entries
; entries
= TREE_CHAIN (entries
))
2408 fnaddr
= (flag_vtable_thunks
? TREE_VALUE (entries
)
2409 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries
)));
2411 if (TREE_CODE (fnaddr
) == NOP_EXPR
)
2415 fn
= TREE_OPERAND (fnaddr
, 0);
2416 TREE_ADDRESSABLE (fn
) = 1;
2417 if (TREE_CODE (fn
) == THUNK_DECL
&& DECL_EXTERNAL (fn
))
2419 DECL_EXTERNAL (fn
) = 0;
2426 /* Set DECL up to have the closest approximation of "initialized common"
2427 linkage available. */
2430 comdat_linkage (decl
)
2434 make_decl_one_only (decl
);
2435 else if (TREE_CODE (decl
) == FUNCTION_DECL
|| DECL_VIRTUAL_P (decl
))
2436 /* We can just emit functions and vtables statically; it doesn't really
2437 matter if we have multiple copies. */
2438 TREE_PUBLIC (decl
) = 0;
2441 /* Static data member template instantiations, however, cannot
2442 have multiple copies. */
2443 if (DECL_INITIAL (decl
) == 0
2444 || DECL_INITIAL (decl
) == error_mark_node
)
2445 DECL_COMMON (decl
) = 1;
2446 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
2448 DECL_COMMON (decl
) = 1;
2449 DECL_INITIAL (decl
) = error_mark_node
;
2453 /* We can't do anything useful; leave vars for explicit
2455 DECL_EXTERNAL (decl
) = 1;
2456 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2460 if (DECL_LANG_SPECIFIC (decl
))
2461 DECL_COMDAT (decl
) = 1;
2464 /* For win32 we also want to put explicit instantiations in
2465 linkonce sections, so that they will be merged with implicit
2466 instantiations; otherwise we get duplicate symbol errors. */
2469 maybe_make_one_only (decl
)
2472 /* This is not necessary on targets that support weak symbols, because
2473 the implicit instantiations will defer to the explicit one. */
2474 if (! supports_one_only () || SUPPORTS_WEAK
)
2477 /* We can't set DECL_COMDAT on functions, or finish_file will think
2478 we can get away with not emitting them if they aren't used. We need
2479 to for variables so that cp_finish_decl will update their linkage,
2480 because their DECL_INITIAL may not have been set properly yet. */
2482 make_decl_one_only (decl
);
2484 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_LANG_SPECIFIC (decl
))
2485 DECL_COMDAT (decl
) = 1;
2488 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2489 based on TYPE and other static flags.
2491 Note that anything public is tagged TREE_PUBLIC, whether
2492 it's public in this file or in another one. */
2495 import_export_vtable (decl
, type
, final
)
2499 if (DECL_INTERFACE_KNOWN (decl
))
2502 if (TYPE_FOR_JAVA (type
))
2504 TREE_PUBLIC (decl
) = 1;
2505 DECL_EXTERNAL (decl
) = 1;
2506 DECL_INTERFACE_KNOWN (decl
) = 1;
2508 else if (CLASSTYPE_INTERFACE_KNOWN (type
))
2510 TREE_PUBLIC (decl
) = 1;
2511 DECL_EXTERNAL (decl
) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type
);
2512 DECL_INTERFACE_KNOWN (decl
) = 1;
2516 /* We can only wait to decide if we have real non-inline virtual
2517 functions in our class, or if we come from a template. */
2519 int found
= CLASSTYPE_TEMPLATE_INSTANTIATION (type
);
2521 if (! found
&& ! final
)
2524 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
2525 method
= TREE_CHAIN (method
))
2526 if (DECL_VINDEX (method
) != NULL_TREE
2527 && ! DECL_THIS_INLINE (method
)
2528 && ! DECL_ABSTRACT_VIRTUAL_P (method
))
2535 if (final
|| ! found
)
2537 comdat_linkage (decl
);
2538 DECL_EXTERNAL (decl
) = 0;
2542 TREE_PUBLIC (decl
) = 1;
2543 DECL_EXTERNAL (decl
) = 1;
2548 /* Determine whether or not we want to specifically import or export CTYPE,
2549 using various heuristics. */
2552 import_export_class (ctype
)
2555 /* -1 for imported, 1 for exported. */
2556 int import_export
= 0;
2558 if (CLASSTYPE_INTERFACE_KNOWN (ctype
))
2561 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2562 we will have CLASSTYPE_INTERFACE_ONLY set but not
2563 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2564 heuristic because someone will supply a #pragma implementation
2565 elsewhere, and deducing it here would produce a conflict. */
2566 if (CLASSTYPE_INTERFACE_ONLY (ctype
))
2569 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2570 /* FIXME this should really use some sort of target-independent macro. */
2571 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype
)))
2573 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype
)))
2577 /* If we got -fno-implicit-templates, we import template classes that
2578 weren't explicitly instantiated. */
2579 if (import_export
== 0
2580 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype
)
2581 && ! flag_implicit_templates
)
2584 /* Base our import/export status on that of the first non-inline,
2585 non-abstract virtual function, if any. */
2586 if (import_export
== 0
2587 && TYPE_VIRTUAL_P (ctype
)
2588 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2591 for (method
= TYPE_METHODS (ctype
); method
!= NULL_TREE
;
2592 method
= TREE_CHAIN (method
))
2594 if (DECL_VINDEX (method
) != NULL_TREE
2595 && !DECL_THIS_INLINE (method
)
2596 && !DECL_ABSTRACT_VIRTUAL_P (method
))
2598 import_export
= (DECL_REALLY_EXTERN (method
) ? -1 : 1);
2604 #ifdef MULTIPLE_SYMBOL_SPACES
2605 if (import_export
== -1)
2611 SET_CLASSTYPE_INTERFACE_KNOWN (ctype
);
2612 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype
) = (import_export
> 0);
2613 CLASSTYPE_INTERFACE_ONLY (ctype
) = (import_export
< 0);
2617 /* We need to describe to the assembler the relationship between
2618 a vtable and the vtable of the parent class. */
2621 output_vtable_inherit (vars
)
2627 op
[0] = XEXP (DECL_RTL (vars
), 0); /* strip the mem ref */
2629 parent
= binfo_for_vtable (vars
);
2631 if (parent
== TYPE_BINFO (DECL_CONTEXT (vars
)))
2635 parent
= TYPE_BINFO_VTABLE (BINFO_TYPE (parent
));
2636 op
[1] = XEXP (DECL_RTL (parent
), 0); /* strip the mem ref */
2639 my_friendly_abort (980826);
2641 output_asm_insn (".vtable_inherit %c0, %c1", op
);
2645 finish_vtable_vardecl (t
, data
)
2647 void *data ATTRIBUTE_UNUSED
;
2650 tree ctype
= DECL_CONTEXT (vars
);
2651 import_export_class (ctype
);
2652 import_export_vtable (vars
, ctype
, 1);
2654 if (! DECL_EXTERNAL (vars
)
2655 && (DECL_INTERFACE_KNOWN (vars
)
2656 || TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (vars
))
2657 || (hack_decl_function_context (vars
) && TREE_USED (vars
)))
2658 && ! TREE_ASM_WRITTEN (vars
))
2661 mark_vtable_entries (vars
);
2662 if (TREE_TYPE (DECL_INITIAL (vars
)) == 0)
2663 store_init_value (vars
, DECL_INITIAL (vars
));
2665 if (write_symbols
== DWARF_DEBUG
|| write_symbols
== DWARF2_DEBUG
)
2667 /* Mark the VAR_DECL node representing the vtable itself as a
2668 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2669 It is rather important that such things be ignored because
2670 any effort to actually generate DWARF for them will run
2671 into trouble when/if we encounter code like:
2674 struct S { virtual void member (); };
2676 because the artificial declaration of the vtable itself (as
2677 manufactured by the g++ front end) will say that the vtable
2678 is a static member of `S' but only *after* the debug output
2679 for the definition of `S' has already been output. This causes
2680 grief because the DWARF entry for the definition of the vtable
2681 will try to refer back to an earlier *declaration* of the
2682 vtable as a static member of `S' and there won't be one.
2683 We might be able to arrange to have the "vtable static member"
2684 attached to the member list for `S' before the debug info for
2685 `S' get written (which would solve the problem) but that would
2686 require more intrusive changes to the g++ front end. */
2688 DECL_IGNORED_P (vars
) = 1;
2691 /* Always make vtables weak. */
2693 comdat_linkage (vars
);
2695 rest_of_decl_compilation (vars
, NULL_PTR
, 1, 1);
2698 output_vtable_inherit (vars
);
2702 else if (! TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (vars
)))
2703 /* We don't know what to do with this one yet. */
2706 *t
= TREE_CHAIN (vars
);
2711 prune_vtable_vardecl (t
, data
)
2713 void *data ATTRIBUTE_UNUSED
;
2715 *t
= TREE_CHAIN (*t
);
2720 finish_sigtable_vardecl (t
, data
)
2722 void *data ATTRIBUTE_UNUSED
;
2724 /* We don't need to mark sigtable entries as addressable here as is done
2725 for vtables. Since sigtables, unlike vtables, are always written out,
2726 that was already done in build_signature_table_constructor. */
2728 rest_of_decl_compilation (*t
, NULL_PTR
, 1, 1);
2729 *t
= TREE_CHAIN (*t
);
2733 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2734 inline function or template instantiation at end-of-file. */
2737 import_export_decl (decl
)
2740 if (DECL_INTERFACE_KNOWN (decl
))
2743 if (DECL_TEMPLATE_INSTANTIATION (decl
)
2744 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2746 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2747 if ((DECL_IMPLICIT_INSTANTIATION (decl
)
2748 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2749 && (flag_implicit_templates
2750 || (flag_implicit_inline_templates
&& DECL_THIS_INLINE (decl
))))
2752 if (!TREE_PUBLIC (decl
))
2753 /* Templates are allowed to have internal linkage. See
2757 comdat_linkage (decl
);
2760 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2762 else if (DECL_FUNCTION_MEMBER_P (decl
))
2764 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2765 import_export_class (ctype
);
2766 if (CLASSTYPE_INTERFACE_KNOWN (ctype
)
2767 && (! DECL_ARTIFICIAL (decl
) || DECL_VINDEX (decl
)))
2769 DECL_NOT_REALLY_EXTERN (decl
)
2770 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2771 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2772 && !DECL_VINDEX (decl
)));
2774 /* Always make artificials weak. */
2775 if (DECL_ARTIFICIAL (decl
) && flag_weak
)
2776 comdat_linkage (decl
);
2778 maybe_make_one_only (decl
);
2781 comdat_linkage (decl
);
2783 else if (DECL_TINFO_FN_P (decl
))
2785 tree ctype
= TREE_TYPE (DECL_NAME (decl
));
2787 if (IS_AGGR_TYPE (ctype
))
2788 import_export_class (ctype
);
2790 if (IS_AGGR_TYPE (ctype
) && CLASSTYPE_INTERFACE_KNOWN (ctype
)
2791 && TYPE_VIRTUAL_P (ctype
)
2792 /* If the type is a cv-qualified variant of a type, then we
2793 must emit the tinfo function in this translation unit
2794 since it will not be emitted when the vtable for the type
2795 is output (which is when the unqualified version is
2797 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2799 DECL_NOT_REALLY_EXTERN (decl
)
2800 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2801 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2802 && !DECL_VINDEX (decl
)));
2804 /* Always make artificials weak. */
2806 comdat_linkage (decl
);
2808 else if (TYPE_BUILT_IN (ctype
)
2809 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2810 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2812 comdat_linkage (decl
);
2815 comdat_linkage (decl
);
2817 DECL_INTERFACE_KNOWN (decl
) = 1;
2821 build_cleanup (decl
)
2825 tree type
= TREE_TYPE (decl
);
2827 if (TREE_CODE (type
) == ARRAY_TYPE
)
2831 mark_addressable (decl
);
2832 temp
= build1 (ADDR_EXPR
, build_pointer_type (type
), decl
);
2834 temp
= build_delete (TREE_TYPE (temp
), temp
,
2836 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
2840 extern int parse_time
, varconst_time
;
2846 tree sname
= get_id_2 ("__sn", base
);
2847 /* For struct X foo __attribute__((weak)), there is a counter
2848 __snfoo. Since base is already an assembler name, sname should
2849 be globally unique */
2850 tree sentry
= IDENTIFIER_GLOBAL_VALUE (sname
);
2853 push_obstacks_nochange ();
2854 end_temporary_allocation ();
2855 sentry
= build_decl (VAR_DECL
, sname
, integer_type_node
);
2856 TREE_PUBLIC (sentry
) = 1;
2857 DECL_ARTIFICIAL (sentry
) = 1;
2858 TREE_STATIC (sentry
) = 1;
2859 TREE_USED (sentry
) = 1;
2860 DECL_COMMON (sentry
) = 1;
2861 pushdecl_top_level (sentry
);
2862 cp_finish_decl (sentry
, NULL_TREE
, NULL_TREE
, 0, 0);
2868 /* Start the process of running a particular set of global constructors
2869 or destructors. Subroutine of do_[cd]tors. */
2872 start_objects (method_type
, initp
)
2873 int method_type
, initp
;
2878 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2880 if (initp
!= DEFAULT_INIT_PRIORITY
)
2890 sprintf (type
, "%c%c%.5u", method_type
, joiner
, initp
);
2893 sprintf (type
, "%c", method_type
);
2895 fnname
= get_file_function_name_long (type
);
2897 start_function (void_list_node
,
2898 make_call_declarator (fnname
, void_list_node
, NULL_TREE
,
2902 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2903 /* It can be a static function as long as collect2 does not have
2904 to scan the object file to find its ctor/dtor routine. */
2905 TREE_PUBLIC (current_function_decl
) = 0;
2908 store_parm_decls ();
2912 expand_start_bindings (0);
2914 /* We cannot allow these functions to be elided, even if they do not
2915 have external linkage. And, there's no point in deferring
2916 copmilation of thes functions; they're all going to have to be
2918 current_function_cannot_inline
2919 = "static constructors and destructors cannot be inlined";
2922 /* Finish the process of running a particular set of global constructors
2923 or destructors. Subroutine of do_[cd]tors. */
2926 finish_objects (method_type
, initp
)
2927 int method_type
, initp
;
2929 char *fnname
= XSTR (XEXP (DECL_RTL (current_function_decl
), 0), 0);
2932 expand_end_bindings (getdecls (), 1, 0);
2935 finish_function (lineno
, 0, 0);
2937 if (initp
== DEFAULT_INIT_PRIORITY
)
2939 if (method_type
== 'I')
2940 assemble_constructor (fnname
);
2942 assemble_destructor (fnname
);
2945 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2946 /* If we're using init priority we can't use assemble_*tor, but on ELF
2947 targets we can stick the references into named sections for GNU ld
2952 sprintf (buf
, ".%ctors.%.5u", method_type
== 'I' ? 'c' : 'd',
2953 /* invert the numbering so the linker puts us in the proper
2954 order; constructors are run from right to left, and the
2955 linker sorts in increasing order. */
2956 MAX_INIT_PRIORITY
- initp
);
2957 named_section (NULL_TREE
, buf
, 0);
2958 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, fnname
),
2959 POINTER_SIZE
/ BITS_PER_UNIT
, 1);
2964 /* The names of the parameters to the function created to handle
2965 initializations and destructions for objects with static storage
2967 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2968 #define PRIORITY_IDENTIFIER "__priority"
2970 /* The name of the function we create to handle initializations and
2971 destructions for objects with static storage duration. */
2972 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2974 /* The declaration for the __INITIALIZE_P argument. */
2975 static tree initialize_p_decl
;
2977 /* The declaration for the __PRIORITY argument. */
2978 static tree priority_decl
;
2980 /* The declaration for the static storage duration function. */
2981 static tree ssdf_decl
;
2983 /* All the static storage duration functions created in this
2984 translation unit. */
2985 static varray_type ssdf_decls
;
2986 static size_t ssdf_decls_used
;
2988 /* A map from priority levels to information about that priority
2989 level. There may be many such levels, so efficient lookup is
2991 static splay_tree priority_info_map
;
2993 /* Begins the generation of the function that will handle all
2994 initialization and destruction of objects with static storage
2995 duration. The function generated takes two parameters of type
2996 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2997 non-zero, it performs initializations. Otherwise, it performs
2998 destructions. It only performs those initializations or
2999 destructions with the indicated __PRIORITY. The generated function
3002 It is assumed that this function will only be called once per
3003 translation unit. */
3006 start_static_storage_duration_function ()
3008 static unsigned ssdf_number
;
3012 char id
[sizeof (SSDF_IDENTIFIER
) + 1 /* '\0' */ + 32];
3014 /* Create the identifier for this function. It will be of the form
3015 SSDF_IDENTIFIER_<number>. */
3016 sprintf (id
, "%s_%u", SSDF_IDENTIFIER
, ssdf_number
++);
3017 if (ssdf_number
== 0)
3019 /* Overflow occurred. That means there are at least 4 billion
3020 initialization functions. */
3021 sorry ("too many initialization functions required");
3022 my_friendly_abort (19990430);
3025 /* Create the parameters. */
3026 parm_types
= void_list_node
;
3027 parm_types
= perm_tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
3028 parm_types
= perm_tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
3029 type
= build_function_type (void_type_node
, parm_types
);
3031 /* Create the FUNCTION_DECL itself. */
3032 ssdf_decl
= build_lang_decl (FUNCTION_DECL
,
3033 get_identifier (id
),
3035 TREE_PUBLIC (ssdf_decl
) = 0;
3036 DECL_ARTIFICIAL (ssdf_decl
) = 1;
3038 /* Put this function in the list of functions to be called from the
3039 static constructors and destructors. */
3042 VARRAY_TREE_INIT (ssdf_decls
, 32, "ssdf_decls");
3044 /* Take this opportunity to initialize the map from priority
3045 numbers to information about that priority level. */
3046 priority_info_map
= splay_tree_new (splay_tree_compare_ints
,
3047 /*delete_key_fn=*/0,
3048 /*delete_value_fn=*/
3049 (splay_tree_delete_value_fn
) &free
);
3051 /* We always need to generate functions for the
3052 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
3053 priorities later, we'll be sure to find the
3054 DEFAULT_INIT_PRIORITY. */
3055 get_priority_info (DEFAULT_INIT_PRIORITY
);
3058 if (ssdf_decls_used
== ssdf_decls
->num_elements
)
3059 VARRAY_GROW (ssdf_decls
, 2 * ssdf_decls_used
);
3060 VARRAY_TREE (ssdf_decls
, ssdf_decls_used
) = ssdf_decl
;
3063 /* Create the argument list. */
3064 initialize_p_decl
= build_decl (PARM_DECL
,
3065 get_identifier (INITIALIZE_P_IDENTIFIER
),
3067 DECL_CONTEXT (initialize_p_decl
) = ssdf_decl
;
3068 DECL_ARG_TYPE (initialize_p_decl
) = integer_type_node
;
3069 TREE_USED (initialize_p_decl
) = 1;
3070 priority_decl
= build_decl (PARM_DECL
, get_identifier (PRIORITY_IDENTIFIER
),
3072 DECL_CONTEXT (priority_decl
) = ssdf_decl
;
3073 DECL_ARG_TYPE (priority_decl
) = integer_type_node
;
3074 TREE_USED (priority_decl
) = 1;
3076 TREE_CHAIN (initialize_p_decl
) = priority_decl
;
3077 DECL_ARGUMENTS (ssdf_decl
) = initialize_p_decl
;
3079 /* Start the function itself. This is equivalent to declarating the
3082 static void __ssdf (int __initialize_p, init __priority_p);
3084 It is static because we only need to call this function from the
3085 various constructor and destructor functions for this module. */
3086 start_function (/*specs=*/NULL_TREE
,
3088 /*attrs=*/NULL_TREE
,
3089 /*pre_parsed_p=*/1);
3091 /* Set up the scope of the outermost block in the function. */
3092 store_parm_decls ();
3096 expand_start_bindings (0);
3098 /* This function must not be deferred because we are depending on
3099 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3100 current_function_cannot_inline
3101 = "static storage duration functions cannot be inlined";
3104 /* Generate the initialization code for the priority indicated in N. */
3107 generate_inits_for_priority (n
, data
)
3109 void *data ATTRIBUTE_UNUSED
;
3111 int priority
= (int) n
->key
;
3112 priority_info pi
= (priority_info
) n
->value
;
3114 /* For each priority N which has been used generate code which looks
3117 if (__priority == N) {
3124 We use the sequences we've accumulated to fill in the `...'s. */
3125 expand_start_cond (build_binary_op (EQ_EXPR
,
3127 build_int_2 (priority
, 0)),
3130 /* Do the initializations. */
3131 expand_start_cond (build_binary_op (NE_EXPR
,
3135 if (pi
->initialization_sequence
)
3139 push_to_sequence (pi
->initialization_sequence
);
3140 insns
= gen_sequence ();
3144 pi
->initialization_sequence
= NULL_RTX
;
3145 pi
->initializations_p
= 1;
3148 /* Do the destructions. */
3149 expand_start_else ();
3150 if (pi
->destruction_sequence
)
3154 push_to_sequence (pi
->destruction_sequence
);
3155 insns
= gen_sequence ();
3159 pi
->destruction_sequence
= NULL_RTX
;
3160 pi
->destructions_p
= 1;
3163 /* Close out the conditionals. */
3167 /* Don't stop iterating. */
3171 /* Finish the generation of the function which performs initialization
3172 and destruction of objects with static storage duration. After
3173 this point, no more such objects can be created. */
3176 finish_static_storage_duration_function ()
3178 splay_tree_foreach (priority_info_map
,
3179 generate_inits_for_priority
,
3182 /* Close out the function. */
3183 expand_end_bindings (getdecls (), 1, 0);
3186 finish_function (lineno
, 0, 0);
3189 /* Return the information about the indicated PRIORITY level. If no
3190 code to handle this level has yet been generated, generate the
3191 appropriate prologue. */
3193 static priority_info
3194 get_priority_info (priority
)
3200 n
= splay_tree_lookup (priority_info_map
,
3201 (splay_tree_key
) priority
);
3204 /* Create a new priority information structure, and insert it
3206 pi
= (priority_info
) xmalloc (sizeof (struct priority_info_s
));
3207 pi
->initialization_sequence
= NULL_RTX
;
3208 pi
->destruction_sequence
= NULL_RTX
;
3209 pi
->initializations_p
= 0;
3210 pi
->destructions_p
= 0;
3211 splay_tree_insert (priority_info_map
,
3212 (splay_tree_key
) priority
,
3213 (splay_tree_value
) pi
);
3216 pi
= (priority_info
) n
->value
;
3221 /* Generate code to do the static initialization of DECL. The
3222 initialization is INIT. If DECL may be initialized more than once
3223 in different object files, SENTRY is the guard variable to
3224 check. PRIORITY is the priority for the initialization. */
3227 do_static_initialization (decl
, init
, sentry
, priority
)
3235 /* Get the priority information for this PRIORITY, */
3236 pi
= get_priority_info (priority
);
3237 if (!pi
->initialization_sequence
)
3240 push_to_sequence (pi
->initialization_sequence
);
3242 /* Tell the debugger that we are at the location of the static
3243 variable in question. */
3244 emit_note (input_filename
, lineno
);
3246 /* If there's a SENTRY, we only do the initialization if it is
3247 zero, i.e., if we are the first to initialize it. */
3249 expand_start_cond (build_binary_op (EQ_EXPR
,
3250 build_unary_op (PREINCREMENT_EXPR
,
3256 /* Prepare a binding level for temporaries created during the
3258 expand_start_target_temps ();
3260 if (IS_AGGR_TYPE (TREE_TYPE (decl
))
3261 || TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
3262 expand_aggr_init (decl
, init
, 0);
3263 else if (TREE_CODE (init
) == TREE_VEC
)
3264 expand_expr (expand_vec_init (decl
, TREE_VEC_ELT (init
, 0),
3265 TREE_VEC_ELT (init
, 1),
3266 TREE_VEC_ELT (init
, 2), 0),
3267 const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3269 expand_assignment (decl
, init
, 0, 0);
3271 /* The expression might have involved increments and decrements. */
3274 /* Cleanup any temporaries needed for the initial value. */
3275 expand_end_target_temps ();
3277 /* Cleanup any deferred pops from function calls. This would be done
3278 by expand_end_cond, but we also need it when !SENTRY, since we are
3279 constructing these sequences by parts. */
3280 do_pending_stack_adjust ();
3282 /* Close the conditional opened above. */
3286 /* Save the sequence for later use. */
3287 pi
->initialization_sequence
= get_insns ();
3291 /* Generate code to do the static destruction of DECL. If DECL may be
3292 initialized more than once in different object files, SENTRY is the
3293 guard variable to check. PRIORITY is the priority for the
3297 do_static_destruction (decl
, sentry
, priority
)
3305 /* If we don't need a destructor, there's nothing to do. */
3306 if (!TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
3309 /* Get the priority information for this PRIORITY, */
3310 pi
= get_priority_info (priority
);
3311 if (!pi
->destruction_sequence
)
3314 push_to_sequence (pi
->destruction_sequence
);
3316 /* Start a new sequence to handle just this destruction. */
3319 /* Tell the debugger that we are at the location of the static
3320 variable in question. */
3321 emit_note (input_filename
, lineno
);
3323 /* If there's a SENTRY, we only do the destruction if it is one,
3324 i.e., if we are the last to destroy it. */
3326 expand_start_cond (build_binary_op (EQ_EXPR
,
3327 build_unary_op (PREDECREMENT_EXPR
,
3333 /* Actually to the destruction. */
3334 expand_expr_stmt (build_cleanup (decl
));
3336 /* Cleanup any deferred pops from function calls. This would be done
3337 by expand_end_cond, but we also need it when !SENTRY, since we are
3338 constructing these sequences by parts. */
3339 do_pending_stack_adjust ();
3341 /* Close the conditional opened above. */
3345 /* Insert the NEW_INSNS before the current insns. (Destructions are
3346 run in reverse order of initializations.) */
3347 new_insns
= gen_sequence ();
3349 if (pi
->destruction_sequence
)
3350 emit_insn_before (new_insns
, pi
->destruction_sequence
);
3352 emit_insn (new_insns
);
3354 /* Save the sequence for later use. */
3355 pi
->destruction_sequence
= get_insns ();
3359 /* Add code to the static storage duration function that will handle
3360 DECL (a static variable that needs initializing and/or destruction)
3361 with the indicated PRIORITY. If DECL needs initializing, INIT is
3365 do_static_initialization_and_destruction (decl
, init
)
3369 tree sentry
= NULL_TREE
;
3372 /* Deal gracefully with error. */
3373 if (decl
== error_mark_node
)
3376 /* The only things that can be initialized are variables. */
3377 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 19990420);
3379 /* If this object is not defined, we don't need to do anything
3381 if (DECL_EXTERNAL (decl
))
3384 /* Also, if the initializer already contains errors, we can bail out
3386 if (init
&& TREE_CODE (init
) == TREE_LIST
3387 && value_member (error_mark_node
, init
))
3390 /* Trick the compiler into thinking we are at the file and line
3391 where DECL was declared so that error-messages make sense, and so
3392 that the debugger will show somewhat sensible file and line
3394 input_filename
= DECL_SOURCE_FILE (decl
);
3395 lineno
= DECL_SOURCE_LINE (decl
);
3401 Access control for implicit calls to the constructors,
3402 the conversion functions, or the destructor called to
3403 create and destroy a static data member is performed as
3404 if these calls appeared in the scope of the member's
3407 we pretend we are in a static member function of the class of
3408 which the DECL is a member. */
3409 if (member_p (decl
))
3411 DECL_CLASS_CONTEXT (current_function_decl
) = DECL_CONTEXT (decl
);
3412 DECL_STATIC_FUNCTION_P (current_function_decl
) = 1;
3415 /* We need a sentry if this is an object with external linkage that
3416 might be initialized in more than one place. */
3417 if (TREE_PUBLIC (decl
) && (DECL_COMMON (decl
)
3418 || DECL_ONE_ONLY (decl
)
3419 || DECL_WEAK (decl
)))
3420 sentry
= get_sentry (DECL_ASSEMBLER_NAME (decl
));
3422 /* Generate the code to actually do the intialization and
3424 priority
= DECL_INIT_PRIORITY (decl
);
3426 priority
= DEFAULT_INIT_PRIORITY
;
3427 do_static_initialization (decl
, init
, sentry
, priority
);
3428 do_static_destruction (decl
, sentry
, priority
);
3430 /* Now that we're done with DECL we don't need to pretend to be a
3431 member of its class any longer. */
3432 DECL_CLASS_CONTEXT (current_function_decl
) = NULL_TREE
;
3433 DECL_STATIC_FUNCTION_P (current_function_decl
) = 0;
3436 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3437 (otherwise) that will initialize all gobal objects with static
3438 storage duration having the indicated PRIORITY. */
3441 generate_ctor_or_dtor_function (constructor_p
, priority
)
3449 /* We use `I' to indicate initialization and `D' to indicate
3456 /* Begin the function. */
3457 start_objects (function_key
, priority
);
3459 /* Call the static storage duration function with appropriate
3461 for (i
= 0; i
< ssdf_decls_used
; ++i
)
3463 arguments
= tree_cons (NULL_TREE
, build_int_2 (priority
, 0),
3465 arguments
= tree_cons (NULL_TREE
, build_int_2 (constructor_p
, 0),
3467 expand_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls
, i
),
3471 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3472 calls to any functions marked with attributes indicating that
3473 they should be called at initialization- or destruction-time. */
3474 if (priority
== DEFAULT_INIT_PRIORITY
)
3478 for (fns
= constructor_p
? static_ctors
: static_dtors
;
3480 fns
= TREE_CHAIN (fns
))
3481 expand_expr_stmt (build_function_call (TREE_VALUE (fns
), NULL_TREE
));
3484 /* Close out the function. */
3485 finish_objects (function_key
, priority
);
3488 /* Generate constructor and destructor functions for the priority
3492 generate_ctor_and_dtor_functions_for_priority (n
, data
)
3494 void *data ATTRIBUTE_UNUSED
;
3496 int priority
= (int) n
->key
;
3497 priority_info pi
= (priority_info
) n
->value
;
3499 /* Generate the functions themselves, but only if they are really
3501 if (pi
->initializations_p
3502 || (priority
== DEFAULT_INIT_PRIORITY
&& static_ctors
))
3503 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3505 if (pi
->destructions_p
3506 || (priority
== DEFAULT_INIT_PRIORITY
&& static_dtors
))
3507 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3510 /* Keep iterating. */
3514 /* This routine is called from the last rule in yyparse ().
3515 Its job is to create all the code needed to initialize and
3516 destroy the global aggregates. We do the destruction
3517 first, since that way we only need to reverse the decls once. */
3523 int start_time
, this_time
;
3530 /* Bad parse errors. Just forget about it. */
3531 if (! global_bindings_p () || current_class_type
|| decl_namespace_list
)
3534 start_time
= get_run_time ();
3536 /* Otherwise, GDB can get confused, because in only knows
3537 about source for LINENO-1 lines. */
3540 interface_unknown
= 1;
3543 /* We now have to write out all the stuff we put off writing out.
3546 o Template specializations that we have not yet instantiated,
3547 but which are needed.
3548 o Initialization and destruction for non-local objects with
3549 static storage duration. (Local objects with static storage
3550 duration are initialized when their scope is first entered,
3551 and are cleaned up via atexit.)
3552 o Virtual function tables.
3554 All of these may cause others to be needed. For example,
3555 instantiating one function may cause another to be needed, and
3556 generating the intiailzer for an object may cause templates to be
3557 instantiated, etc., etc. */
3559 this_time
= get_run_time ();
3560 parse_time
-= this_time
- start_time
;
3561 varconst_time
+= this_time
- start_time
;
3562 start_time
= get_run_time ();
3563 permanent_allocation (1);
3567 /* Non-zero if we need a static storage duration function on
3568 this iteration through the loop. */
3569 int need_ssdf_p
= 0;
3573 /* If there are templates that we've put off instantiating, do
3575 instantiate_pending_templates ();
3577 /* Write out signature-tables and virtual tables as required.
3578 Note that writing out the virtual table for a template class
3579 may cause the instantiation of members of that class. */
3580 if (flag_handle_signatures
3581 && walk_globals (sigtable_decl_p
,
3582 finish_sigtable_vardecl
,
3585 if (walk_globals (vtable_decl_p
,
3586 finish_vtable_vardecl
,
3590 /* The list of objects with static storage duration is built up
3591 in reverse order, so we reverse it here. We also clear
3592 STATIC_AGGREGATES so that any new aggregates added during the
3593 initialization of these will be initialized in the correct
3594 order when we next come around the loop. */
3595 vars
= nreverse (static_aggregates
);
3596 static_aggregates
= NULL_TREE
;
3599 if (! TREE_ASM_WRITTEN (TREE_VALUE (vars
)))
3600 rest_of_decl_compilation (TREE_VALUE (vars
), 0, 1, 1);
3603 /* We need to start a new initialization function each
3604 time through the loop. That's because we need to
3605 know which vtables have been referenced, and
3606 TREE_SYMBOL_REFERENCED isn't computed until a
3607 function is finished, and written out. That's a
3608 deficiency in the back-end. When this is fixed,
3609 these initialization functions could all become
3610 inline, with resulting performance improvements. */
3611 start_static_storage_duration_function ();
3615 do_static_initialization_and_destruction (TREE_VALUE (vars
),
3616 TREE_PURPOSE (vars
));
3618 vars
= TREE_CHAIN (vars
);
3621 /* Finish up the static storage duration function for this
3624 finish_static_storage_duration_function ();
3626 /* Go through the various inline functions, and see if any need
3628 for (i
= 0; i
< saved_inlines_used
; ++i
)
3630 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3631 import_export_decl (decl
);
3632 if (DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
3634 && (! DECL_REALLY_EXTERN (decl
) || DECL_INLINE (decl
)))
3636 /* Even though we're already at the top-level, we push
3637 there again. That way, when we pop back a few lines
3638 hence, all of our state is restored. Otherwise,
3639 finish_function doesn't clean things up, and we end
3640 up with CURRENT_FUNCTION_DECL set. */
3641 push_to_top_level ();
3642 if (DECL_TINFO_FN_P (decl
))
3643 synthesize_tinfo_fn (decl
);
3645 synthesize_method (decl
);
3646 pop_from_top_level ();
3651 /* Mark all functions that might deal with exception-handling as
3653 mark_all_runtime_matches ();
3655 /* We lie to the back-end, pretending that some functions are
3656 not defined when they really are. This keeps these functions
3657 from being put out unncessarily. But, we must stop lying
3658 when the functions are referenced, or if they are not comdat
3659 since they need to be put out now. */
3660 for (i
= 0; i
< saved_inlines_used
; ++i
)
3662 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3664 if (DECL_NOT_REALLY_EXTERN (decl
)
3665 && DECL_INITIAL (decl
)
3666 && (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl
))
3667 || !DECL_COMDAT (decl
)))
3668 DECL_EXTERNAL (decl
) = 0;
3671 if (saved_inlines_used
3672 && wrapup_global_declarations (&VARRAY_TREE (saved_inlines
, 0),
3673 saved_inlines_used
))
3675 if (walk_namespaces (wrapup_globals_for_namespace
, /*data=*/0))
3678 /* Static data members are just like namespace-scope globals. */
3679 for (i
= 0; i
< pending_statics_used
; ++i
)
3681 tree decl
= VARRAY_TREE (pending_statics
, i
);
3682 if (TREE_ASM_WRITTEN (decl
))
3684 import_export_decl (decl
);
3685 if (DECL_NOT_REALLY_EXTERN (decl
) && ! DECL_IN_AGGR_P (decl
))
3686 DECL_EXTERNAL (decl
) = 0;
3689 && wrapup_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3690 pending_statics_used
))
3695 /* We give C linkage to static constructors and destructors. */
3696 push_lang_context (lang_name_c
);
3698 /* Generate initialization and destruction functions for all
3699 priorities for which they are required. */
3700 if (priority_info_map
)
3701 splay_tree_foreach (priority_info_map
,
3702 generate_ctor_and_dtor_functions_for_priority
,
3705 /* We're done with the splay-tree now. */
3706 if (priority_info_map
)
3707 splay_tree_delete (priority_info_map
);
3709 /* We're done with static constructors, so we can go back to "C++"
3711 pop_lang_context ();
3713 /* Now delete from the chain of variables all virtual function tables.
3714 We output them all ourselves, because each will be treated
3716 walk_globals (vtable_decl_p
, prune_vtable_vardecl
, /*data=*/0);
3718 /* Now, issue warnings about static, but not defined, functions,
3720 walk_namespaces (wrapup_globals_for_namespace
, /*data=*/&reconsider
);
3724 this_time
= get_run_time ();
3725 parse_time
-= this_time
- start_time
;
3726 varconst_time
+= this_time
- start_time
;
3728 if (flag_detailed_statistics
)
3730 dump_tree_statistics ();
3731 dump_time_statistics ();
3735 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3736 expr. Since it was parsed like a type, we need to wade through and fix
3737 that. Unfortunately, since operator() is left-associative, we can't use
3738 tail recursion. In the above example, TYPE is `A', and DECL is
3741 Maybe this shouldn't be recursive, but how often will it actually be
3745 reparse_absdcl_as_expr (type
, decl
)
3748 /* do build_functional_cast (type, NULL_TREE) at bottom */
3749 if (TREE_OPERAND (decl
, 0) == NULL_TREE
)
3750 return build_functional_cast (type
, NULL_TREE
);
3753 decl
= reparse_absdcl_as_expr (type
, TREE_OPERAND (decl
, 0));
3755 decl
= build_x_function_call (decl
, NULL_TREE
, current_class_ref
);
3757 if (TREE_CODE (decl
) == CALL_EXPR
3758 && (! TREE_TYPE (decl
)
3759 || TREE_CODE (TREE_TYPE (decl
)) != VOID_TYPE
))
3760 decl
= require_complete_type (decl
);
3765 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3766 out to be an expr. Since it was parsed like a type, we need to wade
3767 through and fix that. Since casts are right-associative, we are
3768 reversing the order, so we don't have to recurse.
3770 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3774 reparse_absdcl_as_casts (decl
, expr
)
3779 if (TREE_CODE (expr
) == CONSTRUCTOR
3780 && TREE_TYPE (expr
) == 0)
3782 type
= groktypename (TREE_VALUE (TREE_OPERAND (decl
, 1)));
3783 decl
= TREE_OPERAND (decl
, 0);
3785 if (IS_SIGNATURE (type
))
3787 error ("cast specifies signature type");
3788 return error_mark_node
;
3791 expr
= digest_init (type
, expr
, (tree
*) 0);
3792 if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_SIZE (type
) == 0)
3794 int failure
= complete_array_type (type
, expr
, 1);
3796 my_friendly_abort (78);
3802 type
= groktypename (TREE_VALUE (TREE_OPERAND (decl
, 1)));
3803 decl
= TREE_OPERAND (decl
, 0);
3804 expr
= build_c_cast (type
, expr
);
3807 if (warn_old_style_cast
&& ! in_system_header
3808 && current_lang_name
!= lang_name_c
)
3809 warning ("use of old-style cast");
3814 /* Given plain tree nodes for an expression, build up the full semantics. */
3817 build_expr_from_tree (t
)
3820 if (t
== NULL_TREE
|| t
== error_mark_node
)
3823 switch (TREE_CODE (t
))
3825 case IDENTIFIER_NODE
:
3826 return do_identifier (t
, 0, NULL_TREE
);
3829 if (LOOKUP_EXPR_GLOBAL (t
))
3830 return do_scoped_id (TREE_OPERAND (t
, 0), 0);
3832 return do_identifier (TREE_OPERAND (t
, 0), 0, NULL_TREE
);
3834 case TEMPLATE_ID_EXPR
:
3835 return (lookup_template_function
3836 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3837 build_expr_from_tree (TREE_OPERAND (t
, 1))));
3840 return build_x_indirect_ref
3841 (build_expr_from_tree (TREE_OPERAND (t
, 0)), "unary *");
3844 return build_functional_cast
3845 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3847 case REINTERPRET_CAST_EXPR
:
3848 return build_reinterpret_cast
3849 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3851 case CONST_CAST_EXPR
:
3852 return build_const_cast
3853 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3855 case DYNAMIC_CAST_EXPR
:
3856 return build_dynamic_cast
3857 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3859 case STATIC_CAST_EXPR
:
3860 return build_static_cast
3861 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3863 case PREDECREMENT_EXPR
:
3864 case PREINCREMENT_EXPR
:
3865 case POSTDECREMENT_EXPR
:
3866 case POSTINCREMENT_EXPR
:
3870 case TRUTH_NOT_EXPR
:
3872 case CONVERT_EXPR
: /* Unary + */
3875 return build_x_unary_op (TREE_CODE (t
),
3876 build_expr_from_tree (TREE_OPERAND (t
, 0)));
3881 case TRUNC_DIV_EXPR
:
3883 case FLOOR_DIV_EXPR
:
3884 case ROUND_DIV_EXPR
:
3885 case EXACT_DIV_EXPR
:
3887 case BIT_ANDTC_EXPR
:
3890 case TRUNC_MOD_EXPR
:
3891 case FLOOR_MOD_EXPR
:
3892 case TRUTH_ANDIF_EXPR
:
3893 case TRUTH_ORIF_EXPR
:
3894 case TRUTH_AND_EXPR
:
3909 return build_x_binary_op
3911 build_expr_from_tree (TREE_OPERAND (t
, 0)),
3912 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3915 return build_m_component_ref
3916 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3917 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3920 return build_offset_ref (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
3923 if (TREE_OPERAND (t
, 0) == NULL_TREE
)
3925 return build_parse_node (ARRAY_REF
, NULL_TREE
,
3926 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3927 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3928 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3933 tree r
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3934 if (TREE_CODE_CLASS (TREE_CODE (r
)) != 't')
3936 return TREE_CODE (t
) == SIZEOF_EXPR
? c_sizeof (r
) : c_alignof (r
);
3940 return build_x_modify_expr
3941 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3942 TREE_CODE (TREE_OPERAND (t
, 1)),
3943 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3946 return build_x_arrow
3947 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3951 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3952 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3953 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3954 NEW_EXPR_USE_GLOBAL (t
));
3957 return delete_sanity
3958 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3959 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3960 DELETE_EXPR_USE_VEC (t
), DELETE_EXPR_USE_GLOBAL (t
));
3963 if (TREE_OPERAND (t
, 1) == NULL_TREE
)
3964 return build_x_compound_expr
3965 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3967 my_friendly_abort (42);
3969 case METHOD_CALL_EXPR
:
3970 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3972 tree ref
= TREE_OPERAND (t
, 0);
3973 return build_scoped_method_call
3974 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3975 build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3976 TREE_OPERAND (ref
, 1),
3977 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3981 tree fn
= TREE_OPERAND (t
, 0);
3983 /* We can get a TEMPLATE_ID_EXPR here on code like:
3987 so we must resolve that. However, we can also get things
3988 like a BIT_NOT_EXPR here, when referring to a destructor,
3989 and things like that are not correctly resolved by
3990 build_expr_from_tree. So, just use build_expr_from_tree
3991 when we really need it. */
3992 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3993 fn
= build_expr_from_tree (fn
);
3995 return build_method_call
3996 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3998 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3999 NULL_TREE
, LOOKUP_NORMAL
);
4003 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
4005 tree ref
= TREE_OPERAND (t
, 0);
4006 return build_member_call
4007 (build_expr_from_tree (TREE_OPERAND (ref
, 0)),
4008 TREE_OPERAND (ref
, 1),
4009 build_expr_from_tree (TREE_OPERAND (t
, 1)));
4013 tree name
= TREE_OPERAND (t
, 0);
4015 tree args
= build_expr_from_tree (TREE_OPERAND (t
, 1));
4016 if (args
!= NULL_TREE
&& TREE_CODE (name
) == LOOKUP_EXPR
4017 && !LOOKUP_EXPR_GLOBAL (name
)
4018 && TREE_CODE ((id
= TREE_OPERAND (name
, 0))) == IDENTIFIER_NODE
4019 && (!current_class_type
4020 || !lookup_member (current_class_type
, id
, 0, 0)))
4022 /* Do Koenig lookup if there are no class members. */
4023 name
= do_identifier (id
, 0, args
);
4025 else if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
4026 || ! really_overloaded_fn (name
))
4027 name
= build_expr_from_tree (name
);
4028 return build_x_function_call (name
, args
, current_class_ref
);
4032 return build_x_conditional_expr
4033 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4034 build_expr_from_tree (TREE_OPERAND (t
, 1)),
4035 build_expr_from_tree (TREE_OPERAND (t
, 2)));
4039 tree purpose
, value
, chain
;
4041 if (t
== void_list_node
)
4044 purpose
= TREE_PURPOSE (t
);
4046 purpose
= build_expr_from_tree (purpose
);
4047 value
= TREE_VALUE (t
);
4049 value
= build_expr_from_tree (value
);
4050 chain
= TREE_CHAIN (t
);
4051 if (chain
&& chain
!= void_type_node
)
4052 chain
= build_expr_from_tree (chain
);
4053 return expr_tree_cons (purpose
, value
, chain
);
4058 tree object
= build_expr_from_tree (TREE_OPERAND (t
, 0));
4059 tree field
= TREE_OPERAND (t
, 1);
4061 /* We use a COMPONENT_REF to indicate things of the form `x.b'
4062 and `x.A::b'. We must distinguish between those cases
4064 if (TREE_CODE (field
) == SCOPE_REF
)
4065 return build_object_ref (object
,
4066 TREE_OPERAND (field
, 0),
4067 TREE_OPERAND (field
, 1));
4069 return build_x_component_ref (object
, field
,
4074 return build_throw (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4080 /* digest_init will do the wrong thing if we let it. */
4081 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
4084 r
= build_nt (CONSTRUCTOR
, NULL_TREE
,
4085 build_expr_from_tree (CONSTRUCTOR_ELTS (t
)));
4086 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
4089 return digest_init (TREE_TYPE (t
), r
, 0);
4094 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t
, 0))) == 't')
4095 return get_typeid (TREE_OPERAND (t
, 0));
4096 return build_x_typeid (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4099 return convert_from_reference (t
);
4106 /* This is something of the form `int (*a)++' that has turned out to be an
4107 expr. It was only converted into parse nodes, so we need to go through
4108 and build up the semantics. Most of the work is done by
4109 build_expr_from_tree, above.
4111 In the above example, TYPE is `int' and DECL is `*a'. */
4114 reparse_decl_as_expr (type
, decl
)
4117 decl
= build_expr_from_tree (decl
);
4119 return build_functional_cast (type
, build_expr_list (NULL_TREE
, decl
));
4124 /* This is something of the form `int (*a)' that has turned out to be a
4125 decl. It was only converted into parse nodes, so we need to do the
4126 checking that make_{pointer,reference}_declarator do. */
4129 finish_decl_parsing (decl
)
4132 extern int current_class_depth
;
4134 switch (TREE_CODE (decl
))
4136 case IDENTIFIER_NODE
:
4139 return make_pointer_declarator
4140 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4142 return make_reference_declarator
4143 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4145 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4148 push_nested_class (TREE_TYPE (TREE_OPERAND (decl
, 0)), 3);
4149 TREE_COMPLEXITY (decl
) = current_class_depth
;
4152 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4155 /* For attribute handling. */
4156 TREE_VALUE (decl
) = finish_decl_parsing (TREE_VALUE (decl
));
4159 my_friendly_abort (5);
4165 check_cp_case_value (value
)
4168 if (value
== NULL_TREE
)
4171 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4172 STRIP_TYPE_NOPS (value
);
4174 if (TREE_READONLY_DECL_P (value
))
4176 value
= decl_constant_value (value
);
4177 STRIP_TYPE_NOPS (value
);
4179 value
= fold (value
);
4181 if (TREE_CODE (value
) != INTEGER_CST
4182 && value
!= error_mark_node
)
4184 cp_error ("case label `%E' does not reduce to an integer constant",
4186 value
= error_mark_node
;
4189 /* Promote char or short to int. */
4190 value
= default_conversion (value
);
4192 constant_expression_warning (value
);
4197 /* Return 1 if root encloses child. */
4200 is_namespace_ancestor (root
, child
)
4205 if (root
== global_namespace
)
4207 if (child
== global_namespace
)
4209 return is_namespace_ancestor (root
, CP_DECL_CONTEXT (child
));
4213 /* Return the namespace that is the common ancestor
4214 of two given namespaces. */
4217 namespace_ancestor (ns1
, ns2
)
4220 if (is_namespace_ancestor (ns1
, ns2
))
4222 return namespace_ancestor (CP_DECL_CONTEXT (ns1
), ns2
);
4225 /* Insert used into the using list of user. Set indirect_flag if this
4226 directive is not directly from the source. Also find the common
4227 ancestor and let our users know about the new namespace */
4229 add_using_namespace (user
, used
, indirect
)
4235 /* Using oneself is a no-op. */
4238 my_friendly_assert (TREE_CODE (user
) == NAMESPACE_DECL
, 380);
4239 my_friendly_assert (TREE_CODE (used
) == NAMESPACE_DECL
, 380);
4240 /* Check if we already have this. */
4241 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
4245 /* Promote to direct usage. */
4246 TREE_INDIRECT_USING (t
) = 0;
4250 /* Add used to the user's using list. */
4251 DECL_NAMESPACE_USING (user
)
4252 = perm_tree_cons (used
, namespace_ancestor (user
, used
),
4253 DECL_NAMESPACE_USING (user
));
4255 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
4257 /* Add user to the used's users list. */
4258 DECL_NAMESPACE_USERS (used
)
4259 = perm_tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
4261 /* Recursively add all namespaces used. */
4262 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
4263 /* indirect usage */
4264 add_using_namespace (user
, TREE_PURPOSE (t
), 1);
4266 /* Tell everyone using us about the new used namespaces. */
4267 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
4268 add_using_namespace (TREE_PURPOSE (t
), used
, 1);
4271 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4272 duplicates. The first list becomes the tail of the result.
4274 The algorithm is O(n^2). We could get this down to O(n log n) by
4275 doing a sort on the addresses of the functions, if that becomes
4279 merge_functions (s1
, s2
)
4283 for (; s2
; s2
= OVL_NEXT (s2
))
4285 tree fn
= OVL_CURRENT (s2
);
4286 if (! ovl_member (fn
, s1
))
4287 s1
= build_overload (fn
, s1
);
4292 /* This should return an error not all definitions define functions.
4293 It is not an error if we find two functions with exactly the
4294 same signature, only if these are selected in overload resolution.
4295 old is the current set of bindings, new the freshly-found binding.
4296 XXX Do we want to give *all* candidates in case of ambiguity?
4297 XXX In what way should I treat extern declarations?
4298 XXX I don't want to repeat the entire duplicate_decls here */
4301 ambiguous_decl (name
, old
, new, flags
)
4308 my_friendly_assert (old
!= NULL_TREE
, 393);
4309 /* Copy the value. */
4310 val
= BINDING_VALUE (new);
4312 switch (TREE_CODE (val
))
4315 /* If we expect types or namespaces, and not templates,
4316 or this is not a template class. */
4317 if (LOOKUP_QUALIFIERS_ONLY (flags
)
4318 && !DECL_CLASS_TEMPLATE_P (val
))
4322 if (LOOKUP_NAMESPACES_ONLY (flags
))
4325 case NAMESPACE_DECL
:
4326 if (LOOKUP_TYPES_ONLY (flags
))
4330 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4334 if (!BINDING_VALUE (old
))
4335 BINDING_VALUE (old
) = val
;
4336 else if (val
&& val
!= BINDING_VALUE (old
))
4338 if (is_overloaded_fn (BINDING_VALUE (old
))
4339 && is_overloaded_fn (val
))
4341 BINDING_VALUE (old
) = merge_functions (BINDING_VALUE (old
),
4346 /* Some declarations are functions, some are not. */
4347 if (flags
& LOOKUP_COMPLAIN
)
4349 /* If we've already given this error for this lookup,
4350 BINDING_VALUE (old) is error_mark_node, so let's not
4351 repeat ourselves. */
4352 if (BINDING_VALUE (old
) != error_mark_node
)
4354 cp_error ("use of `%D' is ambiguous", name
);
4355 cp_error_at (" first declared as `%#D' here",
4356 BINDING_VALUE (old
));
4358 cp_error_at (" also declared as `%#D' here", val
);
4360 return error_mark_node
;
4363 /* ... and copy the type. */
4364 type
= BINDING_TYPE (new);
4365 if (LOOKUP_NAMESPACES_ONLY (flags
))
4367 if (!BINDING_TYPE (old
))
4368 BINDING_TYPE (old
) = type
;
4369 else if (type
&& BINDING_TYPE (old
) != type
)
4371 if (flags
& LOOKUP_COMPLAIN
)
4373 cp_error ("`%D' denotes an ambiguous type",name
);
4374 cp_error_at (" first type here", BINDING_TYPE (old
));
4375 cp_error_at (" other type here", type
);
4381 /* Add the bindings of name in used namespaces to val.
4382 The using list is defined by usings, and the lookup goes to scope.
4383 Returns zero on errors. */
4386 lookup_using_namespace (name
, val
, usings
, scope
, flags
)
4387 tree name
, val
, usings
, scope
;
4392 /* Iterate over all used namespaces in current, searching for using
4393 directives of scope. */
4394 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4395 if (TREE_VALUE (iter
) == scope
)
4397 val1
= binding_for_name (name
, TREE_PURPOSE (iter
));
4398 /* Resolve ambiguities. */
4399 val
= ambiguous_decl (name
, val
, val1
, flags
);
4401 return val
!= error_mark_node
;
4405 Excepts the name to lookup and its qualifying scope.
4406 Returns the name/type pair found into the CPLUS_BINDING result,
4410 qualified_lookup_using_namespace (name
, scope
, result
, flags
)
4416 /* Maintain a list of namespaces visited... */
4417 tree seen
= NULL_TREE
;
4418 /* ... and a list of namespace yet to see. */
4419 tree todo
= NULL_TREE
;
4421 while (scope
&& (result
!= error_mark_node
))
4423 seen
= temp_tree_cons (scope
, NULL_TREE
, seen
);
4424 result
= ambiguous_decl (name
, result
,
4425 binding_for_name (name
, scope
), flags
);
4426 if (!BINDING_VALUE (result
) && !BINDING_TYPE (result
))
4427 /* Consider using directives. */
4428 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4429 usings
= TREE_CHAIN (usings
))
4430 /* If this was a real directive, and we have not seen it. */
4431 if (!TREE_INDIRECT_USING (usings
)
4432 && !purpose_member (TREE_PURPOSE (usings
), seen
))
4433 todo
= temp_tree_cons (TREE_PURPOSE (usings
), NULL_TREE
, todo
);
4436 scope
= TREE_PURPOSE (todo
);
4437 todo
= TREE_CHAIN (todo
);
4440 scope
= NULL_TREE
; /* If there never was a todo list. */
4442 return result
!= error_mark_node
;
4445 /* [namespace.memdef]/2 */
4447 /* Set the context of a declaration to scope. Complain if we are not
4451 set_decl_namespace (decl
, scope
, friendp
)
4457 if (scope
== std_node
)
4458 scope
= global_namespace
;
4459 /* Get rid of namespace aliases. */
4460 scope
= ORIGINAL_NAMESPACE (scope
);
4462 /* It is ok for friends to be qualified in parallel space. */
4463 if (!friendp
&& !is_namespace_ancestor (current_namespace
, scope
))
4464 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4466 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
4467 if (scope
!= current_namespace
)
4469 /* See whether this has been declared in the namespace. */
4470 old
= namespace_binding (DECL_NAME (decl
), scope
);
4472 /* No old declaration at all. */
4474 if (!is_overloaded_fn (decl
))
4475 /* Don't compare non-function decls with decls_match here,
4476 since it can't check for the correct constness at this
4477 point. pushdecl will find those errors later. */
4479 /* Since decl is a function, old should contain a function decl. */
4480 if (!is_overloaded_fn (old
))
4482 for (; old
; old
= OVL_NEXT (old
))
4483 if (decls_match (decl
, OVL_CURRENT (old
)))
4489 cp_error ("`%D' should have been declared inside `%D'",
4493 /* Compute the namespace where a declaration is defined. */
4496 decl_namespace (decl
)
4499 while (DECL_CONTEXT (decl
))
4501 decl
= DECL_CONTEXT (decl
);
4502 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4504 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 't')
4505 decl
= TYPE_STUB_DECL (decl
);
4506 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 390);
4509 return global_namespace
;
4512 /* Return the namespace where the current declaration is declared. */
4515 current_decl_namespace ()
4518 /* If we have been pushed into a different namespace, use it. */
4519 if (decl_namespace_list
)
4520 return TREE_PURPOSE (decl_namespace_list
);
4522 if (current_class_type
)
4523 result
= decl_namespace (TYPE_STUB_DECL (current_class_type
));
4524 else if (current_function_decl
)
4525 result
= decl_namespace (current_function_decl
);
4527 result
= current_namespace
;
4531 /* Temporarily set the namespace for the current declaration. */
4534 push_decl_namespace (decl
)
4537 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
4538 decl
= decl_namespace (decl
);
4539 decl_namespace_list
= tree_cons (decl
, NULL_TREE
, decl_namespace_list
);
4543 pop_decl_namespace ()
4545 decl_namespace_list
= TREE_CHAIN (decl_namespace_list
);
4548 /* Enter a class or namespace scope. */
4554 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4555 push_decl_namespace (t
);
4560 /* Leave scope pushed by push_scope. */
4566 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4567 pop_decl_namespace ();
4572 /* [basic.lookup.koenig] */
4573 /* A non-zero return value in the functions below indicates an error.
4574 All nodes allocated in the procedure are on the scratch obstack. */
4584 static int arg_assoc
PROTO((struct arg_lookup
*, tree
));
4585 static int arg_assoc_args
PROTO((struct arg_lookup
*, tree
));
4586 static int arg_assoc_type
PROTO((struct arg_lookup
*, tree
));
4587 static int add_function
PROTO((struct arg_lookup
*, tree
));
4588 static int arg_assoc_namespace
PROTO((struct arg_lookup
*, tree
));
4589 static int arg_assoc_class
PROTO((struct arg_lookup
*, tree
));
4591 /* Add a function to the lookup structure.
4592 Returns 1 on error. */
4595 add_function (k
, fn
)
4596 struct arg_lookup
*k
;
4599 if (ovl_member (fn
, k
->functions
))
4601 /* We must find only functions, or exactly one non-function. */
4602 if (k
->functions
&& is_overloaded_fn (k
->functions
)
4603 && is_overloaded_fn (fn
))
4604 k
->functions
= build_overload (fn
, k
->functions
);
4608 tree f1
= OVL_CURRENT (k
->functions
);
4610 if (is_overloaded_fn (f1
))
4612 fn
= f1
; f1
= f2
; f2
= fn
;
4614 cp_error_at ("`%D' is not a function,", f1
);
4615 cp_error_at (" conflict with `%D'", f2
);
4616 cp_error (" in call to `%D'", k
->name
);
4624 /* Add functions of a namespace to the lookup structure.
4625 Returns 1 on error. */
4628 arg_assoc_namespace (k
, scope
)
4629 struct arg_lookup
*k
;
4634 if (purpose_member (scope
, k
->namespaces
))
4636 k
->namespaces
= tree_cons (scope
, NULL_TREE
, k
->namespaces
);
4638 value
= namespace_binding (k
->name
, scope
);
4642 for (; value
; value
= OVL_NEXT (value
))
4643 if (add_function (k
, OVL_CURRENT (value
)))
4649 /* Adds everything associated with class to the lookup structure.
4650 Returns 1 on error. */
4653 arg_assoc_class (k
, type
)
4654 struct arg_lookup
* k
;
4657 tree list
, friends
, context
;
4660 if (purpose_member (type
, k
->classes
))
4662 k
->classes
= tree_cons (type
, NULL_TREE
, k
->classes
);
4664 context
= decl_namespace (TYPE_MAIN_DECL (type
));
4665 if (arg_assoc_namespace (k
, context
))
4668 /* Process baseclasses. */
4669 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (type
); i
++)
4670 if (arg_assoc_class (k
, TYPE_BINFO_BASETYPE (type
, i
)))
4673 /* Process friends. */
4674 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
4675 list
= TREE_CHAIN (list
))
4676 if (k
->name
== TREE_PURPOSE (list
))
4677 for (friends
= TREE_VALUE (list
); friends
;
4678 friends
= TREE_CHAIN (friends
))
4679 /* Only interested in global functions with potentially hidden
4680 (i.e. unqualified) declarations. */
4681 if (TREE_PURPOSE (list
) == error_mark_node
&& TREE_VALUE (list
)
4682 && decl_namespace (TREE_VALUE (list
)) == context
)
4683 if (add_function (k
, TREE_VALUE (list
)))
4686 /* Process template arguments. */
4687 if (CLASSTYPE_TEMPLATE_INFO (type
))
4689 list
= innermost_args (CLASSTYPE_TI_ARGS (type
));
4690 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
4691 arg_assoc (k
, TREE_VEC_ELT (list
, i
));
4697 /* Adds everything associated with a given type.
4698 Returns 1 on error. */
4701 arg_assoc_type (k
, type
)
4702 struct arg_lookup
*k
;
4705 switch (TREE_CODE (type
))
4715 if (TYPE_PTRMEMFUNC_P (type
))
4716 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
4717 return arg_assoc_class (k
, type
);
4719 case REFERENCE_TYPE
:
4721 return arg_assoc_type (k
, TREE_TYPE (type
));
4724 return arg_assoc_namespace (k
, decl_namespace (TYPE_MAIN_DECL (type
)));
4726 /* Pointer to member: associate class type and value type. */
4727 if (arg_assoc_type (k
, TYPE_OFFSET_BASETYPE (type
)))
4729 return arg_assoc_type (k
, TREE_TYPE (type
));
4731 /* The basetype is referenced in the first arg type, so just
4734 /* Associate the parameter types. */
4735 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
4737 /* Associate the return type. */
4738 return arg_assoc_type (k
, TREE_TYPE (type
));
4739 case TEMPLATE_TYPE_PARM
:
4740 case TEMPLATE_TEMPLATE_PARM
:
4743 if (type
== unknown_type_node
)
4745 /* else fall through */
4747 my_friendly_abort (390);
4752 /* Adds everything associated with arguments. Returns 1 on error. */
4755 arg_assoc_args (k
, args
)
4756 struct arg_lookup
* k
;
4759 for (; args
; args
= TREE_CHAIN (args
))
4760 if (arg_assoc (k
, TREE_VALUE (args
)))
4765 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4769 struct arg_lookup
* k
;
4772 if (n
== error_mark_node
)
4775 if (TREE_CODE_CLASS (TREE_CODE (n
)) == 't')
4776 return arg_assoc_type (k
, n
);
4778 if (! type_unknown_p (n
))
4779 return arg_assoc_type (k
, TREE_TYPE (n
));
4781 if (TREE_CODE (n
) == ADDR_EXPR
)
4782 n
= TREE_OPERAND (n
, 0);
4783 if (TREE_CODE (n
) == COMPONENT_REF
)
4784 n
= TREE_OPERAND (n
, 1);
4785 if (TREE_CODE (n
) == OFFSET_REF
)
4786 n
= TREE_OPERAND (n
, 1);
4787 while (TREE_CODE (n
) == TREE_LIST
)
4790 if (TREE_CODE (n
) == FUNCTION_DECL
)
4791 return arg_assoc_type (k
, TREE_TYPE (n
));
4792 if (TREE_CODE (n
) == TEMPLATE_ID_EXPR
)
4794 /* [basic.lookup.koenig]
4796 If T is a template-id, its associated namespaces and classes
4797 are the namespace in which the template is defined; for
4798 member templates, the member template's class; the namespaces
4799 and classes associated with the types of the template
4800 arguments provided for template type parameters (excluding
4801 template template parameters); the namespaces in which any
4802 template template arguments are defined; and the classes in
4803 which any member templates used as template template
4804 arguments are defined. [Note: non-type template arguments do
4805 not contribute to the set of associated namespaces. ] */
4806 tree
template = TREE_OPERAND (n
, 0);
4807 tree args
= TREE_OPERAND (n
, 1);
4811 /* First, the template. There may actually be more than one if
4812 this is an overloaded function template. But, in that case,
4813 we only need the first; all the functions will be in the same
4815 template = OVL_CURRENT (template);
4817 ctx
= CP_DECL_CONTEXT (template);
4819 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4821 if (arg_assoc_namespace (k
, ctx
) == 1)
4824 /* It must be a member template. */
4825 else if (arg_assoc_class (k
, ctx
) == 1)
4828 /* Now the arguments. */
4829 for (arg
= args
; arg
!= NULL_TREE
; arg
= TREE_CHAIN (arg
))
4831 tree t
= TREE_VALUE (arg
);
4833 if (TREE_CODE (t
) == TEMPLATE_DECL
)
4835 ctx
= CP_DECL_CONTEXT (t
);
4836 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4838 if (arg_assoc_namespace (k
, ctx
) == 1)
4841 else if (arg_assoc_class (k
, ctx
) == 1)
4844 else if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
4845 && arg_assoc_type (k
, t
) == 1)
4851 my_friendly_assert (TREE_CODE (n
) == OVERLOAD
, 980715);
4853 for (; n
; n
= OVL_CHAIN (n
))
4854 if (arg_assoc_type (k
, TREE_TYPE (OVL_FUNCTION (n
))))
4861 /* Performs Koenig lookup depending on arguments, where fns
4862 are the functions found in normal lookup. */
4865 lookup_arg_dependent (name
, fns
, args
)
4870 struct arg_lookup k
;
4873 k
.namespaces
= NULL_TREE
;
4874 k
.classes
= NULL_TREE
;
4876 push_scratch_obstack ();
4877 arg_assoc_args (&k
, args
);
4882 /* Process a namespace-alias declaration. */
4885 do_namespace_alias (alias
, namespace)
4886 tree alias
, namespace;
4888 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
4890 /* The parser did not find it, so it's not there. */
4891 cp_error ("unknown namespace `%D'", namespace);
4895 namespace = ORIGINAL_NAMESPACE (namespace);
4897 /* Build the alias. */
4898 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
4899 DECL_NAMESPACE_ALIAS (alias
) = namespace;
4903 /* Check a non-member using-declaration. Return the name and scope
4904 being used, and the USING_DECL, or NULL_TREE on failure. */
4907 validate_nonmember_using_decl (decl
, scope
, name
)
4912 if (TREE_CODE (decl
) == SCOPE_REF
4913 && TREE_OPERAND (decl
, 0) == std_node
)
4915 if (namespace_bindings_p ()
4916 && current_namespace
== global_namespace
)
4917 /* There's no need for a using declaration at all, here,
4918 since `std' is the same as `::'. We can't just pass this
4919 on because we'll complain later about declaring something
4920 in the same scope as a using declaration with the same
4921 name. We return NULL_TREE which indicates to the caller
4922 that there's no need to do any further processing. */
4925 *scope
= global_namespace
;
4926 *name
= TREE_OPERAND (decl
, 1);
4928 else if (TREE_CODE (decl
) == SCOPE_REF
)
4930 *scope
= TREE_OPERAND (decl
, 0);
4931 *name
= TREE_OPERAND (decl
, 1);
4933 /* [namespace.udecl]
4935 A using-declaration for a class member shall be a
4936 member-declaration. */
4937 if (TREE_CODE (*scope
) != NAMESPACE_DECL
)
4939 if (TYPE_P (*scope
))
4940 cp_error ("`%T' is not a namespace", *scope
);
4942 cp_error ("`%D' is not a namespace", *scope
);
4946 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
4947 || TREE_CODE (decl
) == TYPE_DECL
4948 || TREE_CODE (decl
) == TEMPLATE_DECL
)
4950 *scope
= global_namespace
;
4954 my_friendly_abort (382);
4955 if (TREE_CODE_CLASS (TREE_CODE (*name
)) == 'd')
4956 *name
= DECL_NAME (*name
);
4957 /* Make a USING_DECL. */
4958 return push_using_decl (*scope
, *name
);
4961 /* Process local and global using-declarations. */
4964 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, newval
, newtype
)
4966 tree oldval
, oldtype
;
4967 tree
*newval
, *newtype
;
4970 struct tree_binding _decls
;
4972 *newval
= *newtype
= NULL_TREE
;
4973 decls
= binding_init (&_decls
);
4974 if (!qualified_lookup_using_namespace (name
, scope
, decls
, 0))
4978 if (!BINDING_VALUE (decls
) && !BINDING_TYPE (decls
))
4980 cp_error ("`%D' not declared", name
);
4984 /* Check for using functions. */
4985 if (BINDING_VALUE (decls
) && is_overloaded_fn (BINDING_VALUE (decls
)))
4989 if (oldval
&& !is_overloaded_fn (oldval
))
4991 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls
)), oldval
);
4996 for (tmp
= BINDING_VALUE (decls
); tmp
; tmp
= OVL_NEXT (tmp
))
4998 tree new_fn
= OVL_CURRENT (tmp
);
5000 /* [namespace.udecl]
5002 If a function declaration in namespace scope or block
5003 scope has the same name and the same parameter types as a
5004 function introduced by a using declaration the program is
5006 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
5008 tree old_fn
= OVL_CURRENT (tmp1
);
5010 if (!OVL_USED (tmp1
)
5011 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn
)),
5012 TYPE_ARG_TYPES (TREE_TYPE (old_fn
))))
5014 /* There was already a non-using declaration in
5015 this scope with the same parameter types. */
5016 cp_error ("`%D' is already declared in this scope",
5020 else if (duplicate_decls (new_fn
, old_fn
))
5021 /* We're re-using something we already used
5022 before. We don't need to add it again. */
5026 /* If we broke out of the loop, there's no reason to add
5027 this function to the using declarations for this
5032 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
5033 if (TREE_CODE (*newval
) != OVERLOAD
)
5034 *newval
= ovl_cons (*newval
, NULL_TREE
);
5035 OVL_USED (*newval
) = 1;
5040 *newval
= BINDING_VALUE (decls
);
5042 duplicate_decls (*newval
, oldval
);
5045 *newtype
= BINDING_TYPE (decls
);
5046 if (oldtype
&& *newtype
&& oldtype
!= *newtype
)
5048 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5054 /* Process a using-declaration not appearing in class or local scope. */
5057 do_toplevel_using_decl (decl
)
5060 tree scope
, name
, binding
;
5061 tree oldval
, oldtype
, newval
, newtype
;
5063 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5064 if (decl
== NULL_TREE
)
5067 binding
= binding_for_name (name
, current_namespace
);
5069 oldval
= BINDING_VALUE (binding
);
5070 oldtype
= BINDING_TYPE (binding
);
5072 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5074 /* Copy declarations found. */
5076 BINDING_VALUE (binding
) = newval
;
5078 BINDING_TYPE (binding
) = newtype
;
5082 /* Process a using-declaration at function scope. */
5085 do_local_using_decl (decl
)
5089 tree oldval
, oldtype
, newval
, newtype
;
5091 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5092 if (decl
== NULL_TREE
)
5095 oldval
= lookup_name_current_level (name
);
5096 oldtype
= lookup_type_current_level (name
);
5098 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5102 if (is_overloaded_fn (newval
))
5106 /* We only need to push declarations for those functions
5107 that were not already bound in the current level.
5108 The old value might be NULL_TREE, it might be a single
5109 function, or an OVERLOAD. */
5110 if (oldval
&& TREE_CODE (oldval
) == OVERLOAD
)
5111 term
= OVL_FUNCTION (oldval
);
5114 for (fn
= newval
; fn
&& OVL_CURRENT (fn
) != term
;
5116 push_overloaded_decl (OVL_CURRENT (fn
),
5117 PUSH_LOCAL
| PUSH_USING
);
5120 push_local_binding (name
, newval
, PUSH_USING
);
5123 set_identifier_type_value (name
, newtype
);
5127 do_class_using_decl (decl
)
5132 if (TREE_CODE (decl
) != SCOPE_REF
5133 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl
, 0))) != 't')
5135 cp_error ("using-declaration for non-member at class scope");
5138 name
= TREE_OPERAND (decl
, 1);
5139 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
5141 cp_error ("using-declaration for destructor");
5144 if (TREE_CODE (name
) == TYPE_DECL
)
5145 name
= DECL_NAME (name
);
5147 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 980716);
5149 value
= build_lang_field_decl (USING_DECL
, name
, void_type_node
);
5150 DECL_INITIAL (value
) = TREE_OPERAND (decl
, 0);
5154 /* Process a using-directive. */
5157 do_using_directive (namespace)
5160 if (namespace == std_node
)
5162 /* using namespace A::B::C; */
5163 if (TREE_CODE (namespace) == SCOPE_REF
)
5164 namespace = TREE_OPERAND (namespace, 1);
5165 if (TREE_CODE (namespace) == IDENTIFIER_NODE
)
5167 /* Lookup in lexer did not find a namespace. */
5168 cp_error ("namespace `%T' undeclared", namespace);
5171 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
5173 cp_error ("`%T' is not a namespace", namespace);
5176 namespace = ORIGINAL_NAMESPACE (namespace);
5177 if (!toplevel_bindings_p ())
5178 push_using_directive (namespace);
5181 add_using_namespace (current_namespace
, namespace, 0);
5185 check_default_args (x
)
5188 tree arg
= TYPE_ARG_TYPES (TREE_TYPE (x
));
5189 int saw_def
= 0, i
= 0 - (TREE_CODE (TREE_TYPE (x
)) == METHOD_TYPE
);
5190 for (; arg
&& arg
!= void_list_node
; arg
= TREE_CHAIN (arg
), ++i
)
5192 if (TREE_PURPOSE (arg
))
5196 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5207 TREE_USED (decl
) = 1;
5208 if (processing_template_decl
)
5210 assemble_external (decl
);
5212 /* Is it a synthesized method that needs to be synthesized? */
5213 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CLASS_CONTEXT (decl
)
5214 && DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
5215 /* Kludge: don't synthesize for default args. */
5216 && current_function_decl
)
5217 synthesize_method (decl
);
5219 /* If this is a function or variable that is an instance of some
5220 template, we now know that we will need to actually do the
5221 instantiation. A TEMPLATE_DECL may also have DECL_TEMPLATE_INFO,
5222 if it's a partial instantiation, but there's no need to
5223 instantiate such a thing. We check that DECL is not an explicit
5224 instantiation because that is not checked in instantiate_decl. */
5225 if (TREE_CODE (decl
) != TEMPLATE_DECL
5226 && DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
5227 && !DECL_EXPLICIT_INSTANTIATION (decl
))
5228 instantiate_decl (decl
);
5231 /* Helper function for named_class_head_sans_basetype nonterminal. We
5232 have just seen something of the form `AGGR SCOPE::ID'. Return a
5233 TYPE_DECL for the type declared by ID in SCOPE. */
5236 handle_class_head (aggr
, scope
, id
)
5237 tree aggr
, scope
, id
;
5241 if (TREE_CODE (id
) == TYPE_DECL
)
5243 else if (DECL_CLASS_TEMPLATE_P (id
))
5244 decl
= DECL_TEMPLATE_RESULT (id
);
5249 cp_error ("`%T' does not have a nested type named `%D'", scope
, id
);
5250 return error_mark_node
;
5253 cp_error ("no file-scope type named `%D'", id
);
5255 decl
= TYPE_MAIN_DECL (xref_tag (aggr
, make_anon_name (), 1));
5258 /* This syntax is only allowed when we're defining a type, so we
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
);