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
;
64 static tree get_sentry
PROTO((tree
));
65 static void mark_vtable_entries
PROTO((tree
));
66 static void grok_function_init
PROTO((tree
, tree
));
67 static int finish_vtable_vardecl
PROTO((tree
*, void *));
68 static int prune_vtable_vardecl
PROTO((tree
*, void *));
69 static int finish_sigtable_vardecl
PROTO((tree
*, void *));
70 static int is_namespace_ancestor
PROTO((tree
, tree
));
71 static void add_using_namespace
PROTO((tree
, tree
, int));
72 static tree ambiguous_decl
PROTO((tree
, tree
, tree
,int));
73 static tree build_anon_union_vars
PROTO((tree
, tree
*, int, int));
74 static int acceptable_java_type
PROTO((tree
));
75 static void output_vtable_inherit
PROTO((tree
));
76 static void start_objects
PROTO((int, int));
77 static void finish_objects
PROTO((int, int));
78 static tree merge_functions
PROTO((tree
, tree
));
79 static tree decl_namespace
PROTO((tree
));
80 static tree validate_nonmember_using_decl
PROTO((tree
, tree
*, tree
*));
81 static void do_nonmember_using_decl
PROTO((tree
, tree
, tree
, tree
,
83 static void start_static_storage_duration_function
PROTO((void));
84 static int generate_inits_for_priority
PROTO((splay_tree_node
, void *));
85 static void finish_static_storage_duration_function
PROTO((void));
86 static priority_info get_priority_info
PROTO((int));
87 static void do_static_initialization
PROTO((tree
, tree
, tree
, int));
88 static void do_static_destruction
PROTO((tree
, tree
, int));
89 static void do_static_initialization_and_destruction
PROTO((tree
, tree
));
90 static void generate_ctor_or_dtor_function
PROTO((int, int));
91 static int generate_ctor_and_dtor_functions_for_priority
92 PROTO((splay_tree_node
, void *));
93 extern int current_class_depth
;
95 /* A list of virtual function tables we must make sure to write out. */
98 /* A list of static class variables. This is needed, because a
99 static class variable can be declared inside the class without
100 an initializer, and then initialized, staticly, outside the class. */
101 static varray_type pending_statics
;
102 static size_t pending_statics_used
;
104 /* A list of functions which were declared inline, but which we
105 may need to emit outline anyway. */
106 static varray_type saved_inlines
;
107 static size_t saved_inlines_used
;
109 /* Used to help generate temporary names which are unique within
110 a function. Reset to 0 by start_function. */
112 int temp_name_counter
;
114 /* Same, but not reset. Local temp variables and global temp variables
115 can have the same name. */
116 static int global_temp_name_counter
;
118 /* Flag used when debugging spew.c */
120 extern int spew_debug
;
122 /* Nonzero if we're done parsing and into end-of-file activities. */
126 /* Functions called along with real static constructors and destructors. */
128 tree static_ctors
, static_dtors
;
130 /* The current open namespace, and ::. */
132 tree current_namespace
;
133 tree global_namespace
;
135 /* The stack for namespaces of current declarations. */
137 static tree decl_namespace_list
;
140 /* C (and C++) language-specific option variables. */
142 /* Nonzero means allow type mismatches in conditional expressions;
143 just make their values `void'. */
145 int flag_cond_mismatch
;
147 /* Nonzero means give `double' the same size as `float'. */
149 int flag_short_double
;
151 /* Nonzero means don't recognize the keyword `asm'. */
155 /* Nonzero means don't recognize any extension keywords. */
157 int flag_no_gnu_keywords
;
159 /* Nonzero means don't recognize the non-ANSI builtin functions. */
163 /* Nonzero means don't recognize the non-ANSI builtin functions.
166 int flag_no_nonansi_builtin
;
168 /* Nonzero means do some things the same way PCC does. Only provided so
169 the compiler will link. */
171 int flag_traditional
;
173 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
175 int flag_signed_bitfields
= 1;
177 /* Nonzero means enable obscure ANSI features and disable GNU extensions
178 that might cause ANSI-compliant code to be miscompiled. */
182 /* Nonzero means do emit exported implementations of functions even if
183 they can be inlined. */
185 int flag_implement_inlines
= 1;
187 /* Nonzero means do emit exported implementations of templates, instead of
188 multiple static copies in each file that needs a definition. */
190 int flag_external_templates
;
192 /* Nonzero means that the decision to emit or not emit the implementation of a
193 template depends on where the template is instantiated, rather than where
196 int flag_alt_external_templates
;
198 /* Nonzero means that implicit instantiations will be emitted if needed. */
200 int flag_implicit_templates
= 1;
202 /* Nonzero means that implicit instantiations of inline templates will be
203 emitted if needed, even if instantiations of non-inline templates
206 int flag_implicit_inline_templates
= 1;
208 /* Nonzero means warn about implicit declarations. */
210 int warn_implicit
= 1;
212 /* Nonzero means warn about usage of long long when `-pedantic'. */
214 int warn_long_long
= 1;
216 /* Nonzero means warn when all ctors or dtors are private, and the class
219 int warn_ctor_dtor_privacy
= 1;
221 /* True if we want to implement vtables using "thunks".
222 The default is off. */
224 #ifndef DEFAULT_VTABLE_THUNKS
225 #define DEFAULT_VTABLE_THUNKS 0
227 int flag_vtable_thunks
= DEFAULT_VTABLE_THUNKS
;
229 /* True if we want to deal with repository information. */
231 int flag_use_repository
;
233 /* Nonzero if we want to issue diagnostics that the standard says are not
236 int flag_optional_diags
= 1;
238 /* Nonzero means give string constants the type `const char *', as mandated
241 int flag_const_strings
= 1;
243 /* Nonzero means warn about deprecated conversion from string constant to
246 int warn_write_strings
;
248 /* Nonzero means warn about pointer casts that can drop a type qualifier
249 from the pointer target type. */
253 /* Nonzero means warn about sizeof(function) or addition/subtraction
254 of function pointers. */
256 int warn_pointer_arith
= 1;
258 /* Nonzero means warn for any function def without prototype decl. */
260 int warn_missing_prototypes
;
262 /* Nonzero means warn about multiple (redundant) decls for the same single
263 variable or function. */
265 int warn_redundant_decls
;
267 /* Warn if initializer is not completely bracketed. */
269 int warn_missing_braces
;
271 /* Warn about comparison of signed and unsigned values. */
273 int warn_sign_compare
;
275 /* Warn about *printf or *scanf format/argument anomalies. */
279 /* Warn about a subscript that has type char. */
281 int warn_char_subscripts
;
283 /* Warn if a type conversion is done that might have confusing results. */
287 /* Warn if adding () is suggested. */
289 int warn_parentheses
;
291 /* Non-zero means warn in function declared in derived class has the
292 same name as a virtual in the base class, but fails to match the
293 type signature of any virtual function in the base class. */
294 int warn_overloaded_virtual
;
296 /* Non-zero means warn when declaring a class that has a non virtual
297 destructor, when it really ought to have a virtual one. */
300 /* Non-zero means warn when a function is declared extern and later inline. */
301 int warn_extern_inline
;
303 /* Non-zero means warn when the compiler will reorder code. */
306 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
309 /* Non-zero means warn when we convert a pointer to member function
310 into a pointer to (void or function). */
311 int warn_pmf2ptr
= 1;
313 /* Nonzero means warn about violation of some Effective C++ style rules. */
317 /* Nonzero means warn where overload resolution chooses a promotion from
318 unsigned to signed over a conversion to an unsigned of the same size. */
322 /* Nonzero means warn when an old-style cast is used. */
324 int warn_old_style_cast
;
326 /* Warn about #pragma directives that are not recognised. */
328 int warn_unknown_pragmas
; /* Tri state variable. */
330 /* Nonzero means warn about use of multicharacter literals. */
332 int warn_multichar
= 1;
334 /* Nonzero means warn when non-templatized friend functions are
335 declared within a template */
337 int warn_nontemplate_friend
= 1;
339 /* Nonzero means complain about deprecated features. */
341 int warn_deprecated
= 1;
343 /* Nonzero means `$' can be in an identifier. */
345 #ifndef DOLLARS_IN_IDENTIFIERS
346 #define DOLLARS_IN_IDENTIFIERS 1
348 int dollars_in_ident
= DOLLARS_IN_IDENTIFIERS
;
350 /* Nonzero for -fno-strict-prototype switch: do not consider empty
351 argument prototype to mean function takes no arguments. */
353 int flag_strict_prototype
= 2;
354 int strict_prototype
= 1;
355 int strict_prototypes_lang_c
, strict_prototypes_lang_cplusplus
= 1;
357 /* Nonzero means that labels can be used as first-class objects */
361 /* Non-zero means to collect statistics which might be expensive
362 and to print them when we are done. */
363 int flag_detailed_statistics
;
365 /* C++ specific flags. */
366 /* Zero means that `this' is a *const. This gives nice behavior in the
367 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
368 -2 means we're constructing an object and it has fixed type. */
370 int flag_this_is_variable
;
372 /* 3 means write out only virtuals function tables `defined'
373 in this implementation file.
374 0 means write out virtual function tables and give them
375 (C) static access (default). */
379 /* Nonzero means we should attempt to elide constructors when possible. */
381 int flag_elide_constructors
= 1;
383 /* Nonzero means recognize and handle signature language constructs. */
385 int flag_handle_signatures
;
387 /* Nonzero means that member functions defined in class scope are
388 inline by default. */
390 int flag_default_inline
= 1;
392 /* Controls whether compiler generates 'type descriptor' that give
393 run-time type information. */
396 /* Nonzero if we wish to output cross-referencing information
397 for the GNU class browser. */
398 extern int flag_gnu_xref
;
400 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
403 int flag_huge_objects
;
405 /* Nonzero if we want to conserve space in the .o files. We do this
406 by putting uninitialized data and runtime initialized data into
407 .common instead of .data at the expense of not flagging multiple
410 int flag_conserve_space
;
412 /* Nonzero if we want to obey access control semantics. */
414 int flag_access_control
= 1;
416 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
418 int flag_operator_names
;
420 /* Nonzero if we want to check the return value of new and avoid calling
421 constructors if it is a null pointer. */
425 /* Nonzero if we want the new ANSI rules for pushing a new scope for `for'
426 initialization variables.
427 0: Old rules, set by -fno-for-scope.
428 2: New ANSI rules, set by -ffor-scope.
429 1: Try to implement new ANSI rules, but with backup compatibility
430 (and warnings). This is the default, for now. */
432 int flag_new_for_scope
= 1;
434 /* Nonzero if we want to emit defined symbols with common-like linkage as
435 weak symbols where possible, in order to conform to C++ semantics.
436 Otherwise, emit them as local symbols. */
440 /* Nonzero to enable experimental ABI changes. */
444 /* Nonzero to not ignore namespace std. */
448 /* Maximum template instantiation depth. Must be at least 17 for ANSI
451 int max_tinst_depth
= 17;
453 /* The name-mangling scheme to use. Must be 1 or greater to support
454 template functions with identical types, but different template
456 int name_mangling_version
= 2;
458 /* Nonzero means that guiding declarations are allowed. */
459 int flag_guiding_decls
;
461 /* Nonzero if squashed mangling is to be performed.
462 This uses the B and K codes to reference previously seen class types
463 and class qualifiers. */
464 int flag_do_squangling
;
466 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
470 /* Nonzero means make the default pedwarns warnings instead of errors.
471 The value of this flag is ignored if -pedantic is specified. */
475 /* Table of language-dependent -f options.
476 STRING is the option name. VARIABLE is the address of the variable.
477 ON_VALUE is the value to store in VARIABLE
478 if `-fSTRING' is seen as an option.
479 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
481 static struct { const char *string
; int *variable
; int on_value
;}
485 {"signed-char", &flag_signed_char
, 1},
486 {"unsigned-char", &flag_signed_char
, 0},
487 {"signed-bitfields", &flag_signed_bitfields
, 1},
488 {"unsigned-bitfields", &flag_signed_bitfields
, 0},
489 {"short-enums", &flag_short_enums
, 1},
490 {"short-double", &flag_short_double
, 1},
491 {"cond-mismatch", &flag_cond_mismatch
, 1},
492 {"asm", &flag_no_asm
, 0},
493 {"builtin", &flag_no_builtin
, 0},
495 /* C++-only options. */
496 {"access-control", &flag_access_control
, 1},
497 {"check-new", &flag_check_new
, 1},
498 {"conserve-space", &flag_conserve_space
, 1},
499 {"const-strings", &flag_const_strings
, 1},
500 {"default-inline", &flag_default_inline
, 1},
501 {"dollars-in-identifiers", &dollars_in_ident
, 1},
502 {"elide-constructors", &flag_elide_constructors
, 1},
503 {"external-templates", &flag_external_templates
, 1},
504 {"for-scope", &flag_new_for_scope
, 2},
505 {"gnu-keywords", &flag_no_gnu_keywords
, 0},
506 {"handle-exceptions", &flag_exceptions
, 1},
507 {"handle-signatures", &flag_handle_signatures
, 1},
508 {"honor-std", &flag_honor_std
, 1},
509 {"huge-objects", &flag_huge_objects
, 1},
510 {"implement-inlines", &flag_implement_inlines
, 1},
511 {"implicit-inline-templates", &flag_implicit_inline_templates
, 1},
512 {"implicit-templates", &flag_implicit_templates
, 1},
513 {"labels-ok", &flag_labels_ok
, 1},
514 {"nonansi-builtins", &flag_no_nonansi_builtin
, 0},
515 {"operator-names", &flag_operator_names
, 1},
516 {"optional-diags", &flag_optional_diags
, 1},
517 {"permissive", &flag_permissive
, 1},
518 {"repo", &flag_use_repository
, 1},
519 {"rtti", &flag_rtti
, 1},
520 {"squangle", &flag_do_squangling
, 1},
521 {"stats", &flag_detailed_statistics
, 1},
522 {"strict-prototype", &flag_strict_prototype
, 1},
523 {"this-is-variable", &flag_this_is_variable
, 1},
524 {"vtable-gc", &flag_vtable_gc
, 1},
525 {"vtable-thunks", &flag_vtable_thunks
, 1},
526 {"weak", &flag_weak
, 1},
527 {"xref", &flag_gnu_xref
, 1}
530 /* Decode the string P as a language-specific option.
531 Return the number of strings consumed for a valid option.
532 Otherwise return 0. */
535 lang_decode_option (argc
, argv
)
544 int strings_processed
;
547 strings_processed
= cpp_handle_option (&parse_in
, argc
, argv
);
549 strings_processed
= 0;
550 #endif /* ! USE_CPPLIB */
552 if (!strcmp (p
, "-ftraditional") || !strcmp (p
, "-traditional"))
554 else if (p
[0] == '-' && p
[1] == 'f')
556 /* Some kind of -f option.
557 P's value is the option sans `-f'.
558 Search for it in the table of options. */
563 /* Try special -f options. */
565 if (!strcmp (p
, "handle-exceptions")
566 || !strcmp (p
, "no-handle-exceptions"))
567 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
569 if (!strcmp (p
, "memoize-lookups")
570 || !strcmp (p
, "no-memoize-lookups")
571 || !strcmp (p
, "save-memoized")
572 || !strcmp (p
, "no-save-memoized")
573 || !strcmp (p
, "no-all-virtual")
574 || !strcmp (p
, "no-enum-int-equiv")
575 || !strcmp (p
, "nonnull-objects")
576 || !strcmp (p
, "ansi-overloading"))
581 else if (!strcmp (p
, "all-virtual")
582 || !strcmp (p
, "enum-int-equiv")
583 || !strcmp (p
, "no-nonnull-objects")
584 || !strcmp (p
, "no-ansi-overloading"))
586 warning ("-f%s is no longer supported", p
);
589 else if (! strcmp (p
, "alt-external-templates"))
591 flag_external_templates
= 1;
592 flag_alt_external_templates
= 1;
594 cp_deprecated ("-falt-external-templates");
596 else if (! strcmp (p
, "no-alt-external-templates"))
598 flag_alt_external_templates
= 0;
601 else if (!strcmp (p
, "repo"))
603 flag_use_repository
= 1;
604 flag_implicit_templates
= 0;
607 else if (!strcmp (p
, "guiding-decls"))
609 flag_guiding_decls
= 1;
610 name_mangling_version
= 0;
613 else if (!strcmp (p
, "no-guiding-decls"))
615 flag_guiding_decls
= 0;
618 else if (!strcmp (p
, "this-is-variable"))
620 flag_this_is_variable
= 1;
622 cp_deprecated ("-fthis-is-variable");
624 else if (!strcmp (p
, "external-templates"))
626 flag_external_templates
= 1;
628 cp_deprecated ("-fexternal-templates");
630 else if (!strcmp (p
, "new-abi"))
633 flag_do_squangling
= 1;
635 flag_vtable_thunks
= 1;
637 else if (!strcmp (p
, "no-new-abi"))
640 flag_do_squangling
= 0;
643 else if (!strncmp (p
, "template-depth-", 15))
646 read_integral_parameter (p
+ 15, p
- 2, max_tinst_depth
);
648 else if (!strncmp (p
, "name-mangling-version-", 22))
650 name_mangling_version
=
651 read_integral_parameter (p
+ 22, p
- 2, name_mangling_version
);
654 !found
&& j
< sizeof (lang_f_options
) / sizeof (lang_f_options
[0]);
657 if (!strcmp (p
, lang_f_options
[j
].string
))
659 *lang_f_options
[j
].variable
= lang_f_options
[j
].on_value
;
660 /* A goto here would be cleaner,
661 but breaks the vax pcc. */
664 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-'
665 && ! strcmp (p
+3, lang_f_options
[j
].string
))
667 *lang_f_options
[j
].variable
= ! lang_f_options
[j
].on_value
;
673 else if (p
[0] == '-' && p
[1] == 'W')
677 /* The -W options control the warning behavior of the compiler. */
680 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-')
683 if (!strcmp (p
, "implicit"))
684 warn_implicit
= setting
;
685 else if (!strcmp (p
, "long-long"))
686 warn_long_long
= setting
;
687 else if (!strcmp (p
, "return-type"))
688 warn_return_type
= setting
;
689 else if (!strcmp (p
, "ctor-dtor-privacy"))
690 warn_ctor_dtor_privacy
= setting
;
691 else if (!strcmp (p
, "write-strings"))
692 warn_write_strings
= setting
;
693 else if (!strcmp (p
, "cast-qual"))
694 warn_cast_qual
= setting
;
695 else if (!strcmp (p
, "char-subscripts"))
696 warn_char_subscripts
= setting
;
697 else if (!strcmp (p
, "pointer-arith"))
698 warn_pointer_arith
= setting
;
699 else if (!strcmp (p
, "missing-prototypes"))
700 warn_missing_prototypes
= setting
;
701 else if (!strcmp (p
, "redundant-decls"))
702 warn_redundant_decls
= setting
;
703 else if (!strcmp (p
, "missing-braces"))
704 warn_missing_braces
= setting
;
705 else if (!strcmp (p
, "sign-compare"))
706 warn_sign_compare
= setting
;
707 else if (!strcmp (p
, "format"))
708 warn_format
= setting
;
709 else if (!strcmp (p
, "conversion"))
710 warn_conversion
= setting
;
711 else if (!strcmp (p
, "parentheses"))
712 warn_parentheses
= setting
;
713 else if (!strcmp (p
, "non-virtual-dtor"))
714 warn_nonvdtor
= setting
;
715 else if (!strcmp (p
, "extern-inline"))
716 warn_extern_inline
= setting
;
717 else if (!strcmp (p
, "reorder"))
718 warn_reorder
= setting
;
719 else if (!strcmp (p
, "synth"))
720 warn_synth
= setting
;
721 else if (!strcmp (p
, "pmf-conversions"))
722 warn_pmf2ptr
= setting
;
723 else if (!strcmp (p
, "effc++"))
725 else if (!strcmp (p
, "sign-promo"))
726 warn_sign_promo
= setting
;
727 else if (!strcmp (p
, "old-style-cast"))
728 warn_old_style_cast
= setting
;
729 else if (!strcmp (p
, "overloaded-virtual"))
730 warn_overloaded_virtual
= setting
;
731 else if (!strcmp (p
, "multichar"))
732 warn_multichar
= setting
;
733 else if (!strcmp (p
, "unknown-pragmas"))
734 /* Set to greater than 1, so that even unknown pragmas in
735 system headers will be warned about. */
736 warn_unknown_pragmas
= setting
* 2;
737 else if (!strcmp (p
, "non-template-friend"))
738 warn_nontemplate_friend
= setting
;
739 else if (!strcmp (p
, "deprecated"))
740 warn_deprecated
= setting
;
741 else if (!strcmp (p
, "comment"))
742 ; /* cpp handles this one. */
743 else if (!strcmp (p
, "comments"))
744 ; /* cpp handles this one. */
745 else if (!strcmp (p
, "trigraphs"))
746 ; /* cpp handles this one. */
747 else if (!strcmp (p
, "import"))
748 ; /* cpp handles this one. */
749 else if (!strcmp (p
, "all"))
751 warn_return_type
= setting
;
752 warn_unused
= setting
;
753 warn_implicit
= setting
;
754 warn_switch
= setting
;
755 warn_format
= setting
;
756 warn_parentheses
= setting
;
757 warn_missing_braces
= setting
;
758 warn_sign_compare
= setting
;
759 warn_multichar
= setting
;
760 /* We save the value of warn_uninitialized, since if they put
761 -Wuninitialized on the command line, we need to generate a
762 warning about not using it without also specifying -O. */
763 if (warn_uninitialized
!= 1)
764 warn_uninitialized
= (setting
? 2 : 0);
765 /* Only warn about unknown pragmas that are not in system
767 warn_unknown_pragmas
= 1;
769 /* C++-specific warnings. */
770 warn_ctor_dtor_privacy
= setting
;
771 warn_nonvdtor
= setting
;
772 warn_reorder
= setting
;
773 warn_nontemplate_friend
= setting
;
775 else return strings_processed
;
777 else if (!strcmp (p
, "-ansi"))
778 flag_no_nonansi_builtin
= 1, flag_ansi
= 1,
779 flag_no_gnu_keywords
= 1, flag_operator_names
= 1;
781 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
782 it's probably safe to assume no sane person would ever want to use this
783 under normal circumstances. */
784 else if (!strcmp (p
, "-spew-debug"))
788 return strings_processed
;
793 /* Incorporate `const' and `volatile' qualifiers for member functions.
794 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
795 QUALS is a list of qualifiers. */
798 grok_method_quals (ctype
, function
, quals
)
799 tree ctype
, function
, quals
;
801 tree fntype
= TREE_TYPE (function
);
802 tree raises
= TYPE_RAISES_EXCEPTIONS (fntype
);
803 int type_quals
= TYPE_UNQUALIFIED
;
804 int dup_quals
= TYPE_UNQUALIFIED
;
808 int tq
= cp_type_qual_from_rid (TREE_VALUE (quals
));
814 quals
= TREE_CHAIN (quals
);
818 if (dup_quals
!= TYPE_UNQUALIFIED
)
819 cp_error ("duplicate type qualifiers in %s declaration",
820 TREE_CODE (function
) == FUNCTION_DECL
821 ? "member function" : "type");
823 ctype
= cp_build_qualified_type (ctype
, type_quals
);
824 fntype
= build_cplus_method_type (ctype
, TREE_TYPE (fntype
),
825 (TREE_CODE (fntype
) == METHOD_TYPE
826 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype
))
827 : TYPE_ARG_TYPES (fntype
)));
829 fntype
= build_exception_variant (fntype
, raises
);
831 TREE_TYPE (function
) = fntype
;
835 /* Warn when -fexternal-templates is used and #pragma
836 interface/implementation is not used all the times it should be,
840 warn_if_unknown_interface (decl
)
843 static int already_warned
= 0;
844 if (already_warned
++)
847 if (flag_alt_external_templates
)
849 struct tinst_level
*til
= tinst_for_decl ();
851 char *sf
= input_filename
;
856 input_filename
= til
->file
;
858 cp_warning ("template `%#D' instantiated in file without #pragma interface",
864 cp_warning_at ("template `%#D' defined in file without #pragma interface",
868 /* A subroutine of the parser, to handle a component list. */
871 grok_x_components (specs
)
874 struct pending_inline
**p
;
877 specs
= strip_attrs (specs
);
879 check_tag_decl (specs
);
880 t
= groktypename (build_decl_list (specs
, NULL_TREE
));
882 /* The only case where we need to do anything additional here is an
883 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
884 if (t
== NULL_TREE
|| !ANON_UNION_TYPE_P (t
))
887 fixup_anonymous_union (t
);
888 finish_member_declaration (build_lang_field_decl (FIELD_DECL
,
892 /* Ignore any inline function definitions in the anonymous union
893 since an anonymous union may not have function members. */
894 p
= &pending_inlines
;
895 for (; *p
; *p
= (*p
)->next
)
896 if (DECL_CONTEXT ((*p
)->fndecl
) != t
)
900 /* Constructors for types with virtual baseclasses need an "in-charge" flag
901 saying whether this constructor is responsible for initialization of
902 virtual baseclasses or not. All destructors also need this "in-charge"
903 flag, which additionally determines whether or not the destructor should
904 free the memory for the object.
906 This function adds the "in-charge" flag to member function FN if
907 appropriate. It is called from grokclassfn and tsubst.
908 FN must be either a constructor or destructor. */
911 maybe_retrofit_in_chrg (fn
)
914 tree basetype
, arg_types
, parms
, parm
, fntype
;
916 if (DECL_CONSTRUCTOR_P (fn
)
917 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CLASS_CONTEXT (fn
))
918 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn
))
920 else if (! DECL_CONSTRUCTOR_P (fn
)
921 && TREE_CHAIN (DECL_ARGUMENTS (fn
)) == NULL_TREE
)
926 if (DECL_CONSTRUCTOR_P (fn
))
927 DECL_CONSTRUCTOR_FOR_VBASE_P (fn
) = 1;
929 /* First add it to DECL_ARGUMENTS... */
930 parm
= build_decl (PARM_DECL
, in_charge_identifier
, integer_type_node
);
931 /* Mark the artificial `__in_chrg' parameter as "artificial". */
932 SET_DECL_ARTIFICIAL (parm
);
933 DECL_ARG_TYPE (parm
) = integer_type_node
;
934 TREE_READONLY (parm
) = 1;
935 parms
= DECL_ARGUMENTS (fn
);
936 TREE_CHAIN (parm
) = TREE_CHAIN (parms
);
937 TREE_CHAIN (parms
) = parm
;
939 /* ...and then to TYPE_ARG_TYPES. */
940 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
941 basetype
= TREE_TYPE (TREE_VALUE (arg_types
));
942 arg_types
= hash_tree_chain (integer_type_node
, TREE_CHAIN (arg_types
));
943 fntype
= build_cplus_method_type (basetype
, TREE_TYPE (TREE_TYPE (fn
)),
945 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)))
946 fntype
= build_exception_variant (fntype
,
947 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)));
948 TREE_TYPE (fn
) = fntype
;
951 /* Classes overload their constituent function names automatically.
952 When a function name is declared in a record structure,
953 its name is changed to it overloaded name. Since names for
954 constructors and destructors can conflict, we place a leading
957 CNAME is the name of the class we are grokking for.
959 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
961 FLAGS contains bits saying what's special about today's
962 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
964 If FUNCTION is a destructor, then we must add the `auto-delete' field
965 as a second parameter. There is some hair associated with the fact
966 that we must "declare" this variable in the manner consistent with the
967 way the rest of the arguments were declared.
969 QUALS are the qualifiers for the this pointer. */
972 grokclassfn (ctype
, function
, flags
, quals
)
973 tree ctype
, function
;
974 enum overload_flags flags
;
977 tree fn_name
= DECL_NAME (function
);
982 if (fn_name
== NULL_TREE
)
984 error ("name missing for member function");
985 fn_name
= get_identifier ("<anonymous>");
986 DECL_NAME (function
) = fn_name
;
990 qualtype
= grok_method_quals (ctype
, function
, quals
);
994 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
995 if (TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
997 /* Must add the class instance variable up front. */
998 /* Right now we just make this a pointer. But later
999 we may wish to make it special. */
1000 tree type
= TREE_VALUE (arg_types
);
1003 if ((flag_this_is_variable
> 0)
1004 && (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
)))
1007 parm
= build_decl (PARM_DECL
, this_identifier
, type
);
1008 /* Mark the artificial `this' parameter as "artificial". */
1009 SET_DECL_ARTIFICIAL (parm
);
1010 DECL_ARG_TYPE (parm
) = type
;
1011 /* We can make this a register, so long as we don't
1012 accidentally complain if someone tries to take its address. */
1013 DECL_REGISTER (parm
) = 1;
1015 TREE_READONLY (parm
) = 1;
1016 TREE_CHAIN (parm
) = last_function_parms
;
1017 last_function_parms
= parm
;
1020 DECL_ARGUMENTS (function
) = last_function_parms
;
1021 /* First approximations. */
1022 DECL_CONTEXT (function
) = ctype
;
1023 DECL_CLASS_CONTEXT (function
) = ctype
;
1025 if (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
))
1027 maybe_retrofit_in_chrg (function
);
1028 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1031 if (flags
== DTOR_FLAG
)
1033 DECL_ASSEMBLER_NAME (function
) = build_destructor_name (ctype
);
1034 TYPE_HAS_DESTRUCTOR (ctype
) = 1;
1037 set_mangled_name_for_decl (function
);
1040 /* Work on the expr used by alignof (this is only called by the parser). */
1049 if (processing_template_decl
)
1050 return build_min (ALIGNOF_EXPR
, sizetype
, expr
);
1052 if (TREE_CODE (expr
) == COMPONENT_REF
1053 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
1054 error ("`__alignof__' applied to a bit-field");
1056 if (TREE_CODE (expr
) == INDIRECT_REF
)
1058 best
= t
= TREE_OPERAND (expr
, 0);
1059 bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1061 while (TREE_CODE (t
) == NOP_EXPR
1062 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
1065 t
= TREE_OPERAND (t
, 0);
1066 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1067 if (thisalign
> bestalign
)
1068 best
= t
, bestalign
= thisalign
;
1070 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
1074 /* ANSI says arrays and fns are converted inside comma.
1075 But we can't convert them in build_compound_expr
1076 because that would break commas in lvalues.
1077 So do the conversion here if operand was a comma. */
1078 if (TREE_CODE (expr
) == COMPOUND_EXPR
1079 && (TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
1080 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
))
1081 expr
= default_conversion (expr
);
1082 return c_alignof (TREE_TYPE (expr
));
1086 /* Create an ARRAY_REF, checking for the user doing things backwards
1090 grok_array_decl (array_expr
, index_exp
)
1091 tree array_expr
, index_exp
;
1093 tree type
= TREE_TYPE (array_expr
);
1094 tree p1
, p2
, i1
, i2
;
1096 if (type
== error_mark_node
|| index_exp
== error_mark_node
)
1097 return error_mark_node
;
1098 if (processing_template_decl
)
1099 return build_min (ARRAY_REF
, type
? TREE_TYPE (type
) : NULL_TREE
,
1100 array_expr
, index_exp
);
1102 if (type
== NULL_TREE
)
1104 /* Something has gone very wrong. Assume we are mistakenly reducing
1105 an expression instead of a declaration. */
1106 error ("parser may be lost: is there a '{' missing somewhere?");
1110 if (TREE_CODE (type
) == OFFSET_TYPE
1111 || TREE_CODE (type
) == REFERENCE_TYPE
)
1112 type
= TREE_TYPE (type
);
1114 /* If they have an `operator[]', use that. */
1115 if (IS_AGGR_TYPE (type
) || IS_AGGR_TYPE (TREE_TYPE (index_exp
)))
1116 return build_opfncall (ARRAY_REF
, LOOKUP_NORMAL
,
1117 array_expr
, index_exp
, NULL_TREE
);
1119 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1120 is a little-known fact that, if `a' is an array and `i' is an
1121 int, you can write `i[a]', which means the same thing as `a[i]'. */
1123 if (TREE_CODE (type
) == ARRAY_TYPE
)
1126 p1
= build_expr_type_conversion (WANT_POINTER
, array_expr
, 0);
1128 if (TREE_CODE (TREE_TYPE (index_exp
)) == ARRAY_TYPE
)
1131 p2
= build_expr_type_conversion (WANT_POINTER
, index_exp
, 0);
1133 i1
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, array_expr
, 0);
1134 i2
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, index_exp
, 0);
1136 if ((p1
&& i2
) && (i1
&& p2
))
1137 error ("ambiguous conversion for array subscript");
1140 array_expr
= p1
, index_exp
= i2
;
1142 array_expr
= p2
, index_exp
= i1
;
1145 cp_error ("invalid types `%T[%T]' for array subscript",
1146 type
, TREE_TYPE (index_exp
));
1147 return error_mark_node
;
1150 if (array_expr
== error_mark_node
|| index_exp
== error_mark_node
)
1151 error ("ambiguous conversion for array subscript");
1153 return build_array_ref (array_expr
, index_exp
);
1156 /* Given the cast expression EXP, checking out its validity. Either return
1157 an error_mark_node if there was an unavoidable error, return a cast to
1158 void for trying to delete a pointer w/ the value 0, or return the
1159 call to delete. If DOING_VEC is 1, we handle things differently
1160 for doing an array delete. If DOING_VEC is 2, they gave us the
1161 array size as an argument to delete.
1162 Implements ARM $5.3.4. This is called from the parser. */
1165 delete_sanity (exp
, size
, doing_vec
, use_global_delete
)
1167 int doing_vec
, use_global_delete
;
1170 /* For a regular vector delete (aka, no size argument) we will pass
1171 this down as a NULL_TREE into build_vec_delete. */
1172 tree maxindex
= NULL_TREE
;
1174 if (exp
== error_mark_node
)
1177 if (processing_template_decl
)
1179 t
= build_min (DELETE_EXPR
, void_type_node
, exp
, size
);
1180 DELETE_EXPR_USE_GLOBAL (t
) = use_global_delete
;
1181 DELETE_EXPR_USE_VEC (t
) = doing_vec
;
1185 if (TREE_CODE (exp
) == OFFSET_REF
)
1186 exp
= resolve_offset_ref (exp
);
1187 exp
= convert_from_reference (exp
);
1188 t
= stabilize_reference (exp
);
1189 t
= build_expr_type_conversion (WANT_POINTER
, t
, 1);
1191 if (t
== NULL_TREE
|| t
== error_mark_node
)
1193 cp_error ("type `%#T' argument given to `delete', expected pointer",
1195 return error_mark_node
;
1200 maxindex
= build_binary_op (MINUS_EXPR
, size
, integer_one_node
);
1201 pedwarn ("anachronistic use of array size in vector delete");
1204 type
= TREE_TYPE (t
);
1206 /* As of Valley Forge, you can delete a pointer to const. */
1208 /* You can't delete functions. */
1209 if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
1211 error ("cannot delete a function");
1212 return error_mark_node
;
1215 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1216 if (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
)
1217 cp_warning ("`%T' is not a pointer-to-object type", type
);
1219 /* An array can't have been allocated by new, so complain. */
1220 if (TREE_CODE (t
) == ADDR_EXPR
1221 && TREE_CODE (TREE_OPERAND (t
, 0)) == VAR_DECL
1222 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == ARRAY_TYPE
)
1223 cp_warning ("deleting array `%#D'", TREE_OPERAND (t
, 0));
1225 /* Deleting a pointer with the value zero is valid and has no effect. */
1226 if (integer_zerop (t
))
1227 return build1 (NOP_EXPR
, void_type_node
, t
);
1230 return build_vec_delete (t
, maxindex
, integer_one_node
,
1231 integer_zero_node
, use_global_delete
);
1234 if (IS_AGGR_TYPE (TREE_TYPE (type
))
1235 && TYPE_GETS_REG_DELETE (TREE_TYPE (type
)))
1237 /* Only do access checking here; we'll be calling op delete
1238 from the destructor. */
1239 tree tmp
= build_op_delete_call (DELETE_EXPR
, t
, size_zero_node
,
1240 LOOKUP_NORMAL
, NULL_TREE
);
1241 if (tmp
== error_mark_node
)
1242 return error_mark_node
;
1245 return build_delete (type
, t
, integer_three_node
,
1246 LOOKUP_NORMAL
, use_global_delete
);
1250 /* Report an error if the indicated template declaration is not the
1251 sort of thing that should be a member template. */
1254 check_member_template (tmpl
)
1259 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
1260 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1262 if (TREE_CODE (decl
) == FUNCTION_DECL
1263 || (TREE_CODE (decl
) == TYPE_DECL
1264 && IS_AGGR_TYPE (TREE_TYPE (decl
))))
1266 if (current_function_decl
)
1267 /* 14.5.2.2 [temp.mem]
1269 A local class shall not have member templates. */
1270 cp_error ("declaration of member template `%#D' in local class",
1273 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
1275 /* 14.5.2.3 [temp.mem]
1277 A member function template shall not be virtual. */
1279 ("invalid use of `virtual' in template declaration of `%#D'",
1281 DECL_VIRTUAL_P (decl
) = 0;
1284 /* The debug-information generating code doesn't know what to do
1285 with member templates. */
1286 DECL_IGNORED_P (tmpl
) = 1;
1289 cp_error ("template declaration of `%#D'", decl
);
1292 /* Return true iff TYPE is a valid Java parameter or return type. */
1295 acceptable_java_type (type
)
1298 if (TREE_CODE (type
) == VOID_TYPE
|| TYPE_FOR_JAVA (type
))
1300 if (TREE_CODE (type
) == POINTER_TYPE
)
1302 type
= TREE_TYPE (type
);
1303 if (TREE_CODE (type
) == RECORD_TYPE
)
1306 if (! TYPE_FOR_JAVA (type
))
1308 if (! CLASSTYPE_TEMPLATE_INFO (type
))
1310 args
= CLASSTYPE_TI_ARGS (type
);
1311 i
= TREE_VEC_LENGTH (args
);
1314 type
= TREE_VEC_ELT (args
, i
);
1315 if (TREE_CODE (type
) == POINTER_TYPE
)
1316 type
= TREE_TYPE (type
);
1317 if (! TYPE_FOR_JAVA (type
))
1326 /* For a METHOD in a Java class CTYPE, return 1 if
1327 the parameter and return types are valid Java types.
1328 Otherwise, print appropriate error messages, and return 0. */
1331 check_java_method (method
)
1335 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (method
));
1336 tree ret_type
= TREE_TYPE (TREE_TYPE (method
));
1337 if (! acceptable_java_type (ret_type
))
1339 cp_error ("Java method '%D' has non-Java return type `%T'",
1343 for (; arg_types
!= NULL_TREE
; arg_types
= TREE_CHAIN (arg_types
))
1345 tree type
= TREE_VALUE (arg_types
);
1346 if (! acceptable_java_type (type
))
1348 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1353 return jerr
? 0 : 1;
1356 /* Sanity check: report error if this function FUNCTION is not
1357 really a member of the class (CTYPE) it is supposed to belong to.
1358 CNAME is the same here as it is for grokclassfn above. */
1361 check_classfn (ctype
, function
)
1362 tree ctype
, function
;
1364 tree fn_name
= DECL_NAME (function
);
1365 tree fndecl
, fndecls
;
1366 tree method_vec
= CLASSTYPE_METHOD_VEC (complete_type (ctype
));
1370 if (DECL_USE_TEMPLATE (function
)
1371 && is_member_template (DECL_TI_TEMPLATE (function
)))
1372 /* Since this is a specialization of a member template,
1373 we're not going to find the declaration in the class.
1376 struct S { template <typename T> void f(T); };
1377 template <> void S::f(int);
1379 we're not going to find `S::f(int)', but there's no
1380 reason we should, either. We let our callers know we didn't
1381 find the method, but we don't complain. */
1384 if (method_vec
!= 0)
1386 methods
= &TREE_VEC_ELT (method_vec
, 0);
1387 end
= TREE_VEC_END (method_vec
);
1389 /* First suss out ctors and dtors. */
1390 if (*methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1391 && DECL_CONSTRUCTOR_P (function
))
1393 if (*++methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1394 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
)))
1397 while (++methods
!= end
&& *methods
)
1400 if (fn_name
== DECL_NAME (OVL_CURRENT (*methods
)))
1403 for (fndecls
= *methods
; fndecls
!= NULL_TREE
;
1404 fndecls
= OVL_NEXT (fndecls
))
1406 fndecl
= OVL_CURRENT (fndecls
);
1407 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1408 for a for member function of a template class, is
1409 not mangled, so the check below does not work
1410 correctly in that case. Since mangled destructor
1411 names do not include the type of the arguments,
1412 we can't use this short-cut for them, either.
1413 (It's not legal to declare arguments for a
1414 destructor, but some people try.) */
1415 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
))
1416 && (DECL_ASSEMBLER_NAME (function
)
1417 != DECL_NAME (function
))
1418 && (DECL_ASSEMBLER_NAME (fndecl
)
1419 != DECL_NAME (fndecl
))
1420 && (DECL_ASSEMBLER_NAME (function
)
1421 == DECL_ASSEMBLER_NAME (fndecl
)))
1424 /* We cannot simply call decls_match because this
1425 doesn't work for static member functions that are
1426 pretending to be methods, and because the name
1427 may have been changed by asm("new_name"). */
1428 if (DECL_NAME (function
) == DECL_NAME (fndecl
))
1430 tree p1
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1431 tree p2
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1433 /* Get rid of the this parameter on functions that become
1435 if (DECL_STATIC_FUNCTION_P (fndecl
)
1436 && TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1437 p1
= TREE_CHAIN (p1
);
1439 if (same_type_p (TREE_TYPE (TREE_TYPE (function
)),
1440 TREE_TYPE (TREE_TYPE (fndecl
)))
1441 && compparms (p1
, p2
)
1442 && (DECL_TEMPLATE_SPECIALIZATION (function
)
1443 == DECL_TEMPLATE_SPECIALIZATION (fndecl
))
1444 && (!DECL_TEMPLATE_SPECIALIZATION (function
)
1445 || (DECL_TI_TEMPLATE (function
)
1446 == DECL_TI_TEMPLATE (fndecl
))))
1455 if (methods
!= end
&& *methods
)
1457 tree fndecl
= *methods
;
1458 cp_error ("prototype for `%#D' does not match any in class `%T'",
1460 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl
) ? "s are" : " is",
1461 OVL_CURRENT (fndecl
));
1462 while (fndecl
= OVL_NEXT (fndecl
), fndecl
)
1463 cp_error_at (" %#D", OVL_CURRENT(fndecl
));
1468 if (TYPE_SIZE (ctype
) == 0)
1469 incomplete_type_error (function
, ctype
);
1471 cp_error ("no `%#D' member function declared in class `%T'",
1475 /* If we did not find the method in the class, add it to avoid
1476 spurious errors (unless the CTYPE is not yet defined, in which
1477 case we'll only confuse ourselves when the function is declared
1478 properly within the class. */
1479 if (TYPE_SIZE (ctype
))
1480 add_method (ctype
, methods
, function
);
1484 /* We have just processed the DECL, which is a static data member.
1485 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1486 present, is the assembly-language name for the data member.
1487 NEED_POP and FLAGS are as for cp_finish_decl. */
1490 finish_static_data_member_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
1500 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1502 my_friendly_assert (TREE_PUBLIC (decl
), 0);
1504 /* We cannot call pushdecl here, because that would fill in the
1505 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1506 the right thing, namely, to put this decl out straight away. */
1507 /* current_class_type can be NULL_TREE in case of error. */
1508 if (!asmspec
&& current_class_type
)
1510 DECL_INITIAL (decl
) = error_mark_node
;
1511 DECL_ASSEMBLER_NAME (decl
)
1512 = build_static_name (current_class_type
, DECL_NAME (decl
));
1514 if (! processing_template_decl
)
1516 if (!pending_statics
)
1517 VARRAY_TREE_INIT (pending_statics
, 32, "pending_statics");
1519 if (pending_statics_used
== pending_statics
->num_elements
)
1520 VARRAY_GROW (pending_statics
,
1521 2 * pending_statics
->num_elements
);
1522 VARRAY_TREE (pending_statics
, pending_statics_used
) = decl
;
1523 ++pending_statics_used
;
1526 /* Static consts need not be initialized in the class definition. */
1527 if (init
!= NULL_TREE
&& TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
1529 static int explanation
= 0;
1531 error ("initializer invalid for static member with constructor");
1532 if (explanation
++ == 0)
1533 error ("(you really want to initialize it separately)");
1536 /* Force the compiler to know when an uninitialized static const
1537 member is being used. */
1538 if (CP_TYPE_CONST_P (TREE_TYPE (decl
)) && init
== 0)
1539 TREE_USED (decl
) = 1;
1540 DECL_INITIAL (decl
) = init
;
1541 DECL_IN_AGGR_P (decl
) = 1;
1542 DECL_CONTEXT (decl
) = current_class_type
;
1543 DECL_CLASS_CONTEXT (decl
) = current_class_type
;
1545 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
);
1548 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1549 of a structure component, returning a FIELD_DECL node.
1550 QUALS is a list of type qualifiers for this decl (such as for declaring
1551 const member functions).
1553 This is done during the parsing of the struct declaration.
1554 The FIELD_DECL nodes are chained together and the lot of them
1555 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1559 If class A defines that certain functions in class B are friends, then
1560 the way I have set things up, it is B who is interested in permission
1561 granted by A. However, it is in A's context that these declarations
1562 are parsed. By returning a void_type_node, class A does not attempt
1563 to incorporate the declarations of the friends within its structure.
1565 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1566 CHANGES TO CODE IN `start_method'. */
1569 grokfield (declarator
, declspecs
, init
, asmspec_tree
, attrlist
)
1570 tree declarator
, declspecs
, init
, asmspec_tree
, attrlist
;
1572 register tree value
;
1574 int flags
= LOOKUP_ONLYCONVERTING
;
1576 /* Convert () initializers to = initializers. */
1577 if (init
== NULL_TREE
&& declarator
!= NULL_TREE
1578 && TREE_CODE (declarator
) == CALL_EXPR
1579 && TREE_OPERAND (declarator
, 0)
1580 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) == IDENTIFIER_NODE
1581 || TREE_CODE (TREE_OPERAND (declarator
, 0)) == SCOPE_REF
)
1582 && parmlist_is_exprlist (TREE_OPERAND (declarator
, 1)))
1584 init
= TREE_OPERAND (declarator
, 1);
1585 declarator
= TREE_OPERAND (declarator
, 0);
1589 if (declspecs
== NULL_TREE
1590 && TREE_CODE (declarator
) == SCOPE_REF
1591 && TREE_CODE (TREE_OPERAND (declarator
, 1)) == IDENTIFIER_NODE
)
1593 /* Access declaration */
1594 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator
, 0))))
1596 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
1597 pop_nested_class ();
1598 return do_class_using_decl (declarator
);
1602 && TREE_CODE (init
) == TREE_LIST
1603 && TREE_VALUE (init
) == error_mark_node
1604 && TREE_CHAIN (init
) == NULL_TREE
)
1607 value
= grokdeclarator (declarator
, declspecs
, FIELD
, init
!= 0, attrlist
);
1608 if (! value
|| value
== error_mark_node
)
1609 /* friend or constructor went bad. */
1612 /* Pass friendly classes back. */
1613 if (TREE_CODE (value
) == VOID_TYPE
)
1614 return void_type_node
;
1616 if (DECL_NAME (value
) != NULL_TREE
1617 && IDENTIFIER_POINTER (DECL_NAME (value
))[0] == '_'
1618 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value
)), "_vptr"))
1619 cp_error ("member `%D' conflicts with virtual function table field name",
1622 /* Stash away type declarations. */
1623 if (TREE_CODE (value
) == TYPE_DECL
)
1625 DECL_NONLOCAL (value
) = 1;
1626 DECL_CONTEXT (value
) = current_class_type
;
1627 DECL_CLASS_CONTEXT (value
) = current_class_type
;
1629 /* Now that we've updated the context, we need to remangle the
1630 name for this TYPE_DECL. */
1631 DECL_ASSEMBLER_NAME (value
) = DECL_NAME (value
);
1632 if (!uses_template_parms (value
))
1633 DECL_ASSEMBLER_NAME (value
) =
1634 get_identifier (build_overload_name (TREE_TYPE (value
), 1, 1));
1639 if (IS_SIGNATURE (current_class_type
)
1640 && TREE_CODE (value
) != FUNCTION_DECL
)
1642 error ("field declaration not allowed in signature");
1643 return void_type_node
;
1646 if (DECL_IN_AGGR_P (value
))
1648 cp_error ("`%D' is already defined in `%T'", value
,
1649 DECL_CONTEXT (value
));
1650 return void_type_node
;
1654 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1658 if (IS_SIGNATURE (current_class_type
)
1659 && TREE_CODE (value
) == FUNCTION_DECL
)
1661 error ("function declarations cannot have initializers in signature");
1664 else if (TREE_CODE (value
) == FUNCTION_DECL
)
1666 grok_function_init (value
, init
);
1669 else if (pedantic
&& TREE_CODE (value
) != VAR_DECL
)
1670 /* Already complained in grokdeclarator. */
1674 /* We allow initializers to become parameters to base
1676 if (TREE_CODE (init
) == TREE_LIST
)
1678 if (TREE_CHAIN (init
) == NULL_TREE
)
1679 init
= TREE_VALUE (init
);
1681 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1684 if (TREE_CODE (init
) == CONST_DECL
)
1685 init
= DECL_INITIAL (init
);
1686 else if (TREE_READONLY_DECL_P (init
))
1687 init
= decl_constant_value (init
);
1688 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1689 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1690 my_friendly_assert (TREE_PERMANENT (init
), 192);
1691 if (init
== error_mark_node
)
1692 /* We must make this look different than `error_mark_node'
1693 because `decl_const_value' would mis-interpret it
1694 as only meaning that this VAR_DECL is defined. */
1695 init
= build1 (NOP_EXPR
, TREE_TYPE (value
), init
);
1696 else if (processing_template_decl
)
1698 else if (! TREE_CONSTANT (init
))
1700 /* We can allow references to things that are effectively
1701 static, since references are initialized with the address. */
1702 if (TREE_CODE (TREE_TYPE (value
)) != REFERENCE_TYPE
1703 || (TREE_STATIC (init
) == 0
1704 && (TREE_CODE_CLASS (TREE_CODE (init
)) != 'd'
1705 || DECL_EXTERNAL (init
) == 0)))
1707 error ("field initializer is not constant");
1708 init
= error_mark_node
;
1714 /* The corresponding pop_obstacks is in cp_finish_decl. */
1715 push_obstacks_nochange ();
1717 if (processing_template_decl
&& ! current_function_decl
1718 && (TREE_CODE (value
) == VAR_DECL
|| TREE_CODE (value
) == FUNCTION_DECL
))
1719 value
= push_template_decl (value
);
1722 cplus_decl_attributes (value
, TREE_PURPOSE (attrlist
),
1723 TREE_VALUE (attrlist
));
1725 if (TREE_CODE (value
) == VAR_DECL
)
1727 finish_static_data_member_decl (value
, init
, asmspec_tree
,
1728 /*need_pop=*/1, flags
);
1731 if (TREE_CODE (value
) == FIELD_DECL
)
1735 /* This must override the asm specifier which was placed
1736 by grokclassfn. Lay this out fresh. */
1737 DECL_RTL (value
) = NULL_RTX
;
1738 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1740 if (DECL_INITIAL (value
) == error_mark_node
)
1741 init
= error_mark_node
;
1742 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1743 DECL_INITIAL (value
) = init
;
1744 DECL_IN_AGGR_P (value
) = 1;
1747 if (TREE_CODE (value
) == FUNCTION_DECL
)
1751 /* This must override the asm specifier which was placed
1752 by grokclassfn. Lay this out fresh. */
1753 DECL_RTL (value
) = NULL_RTX
;
1754 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1756 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1758 /* Pass friends back this way. */
1759 if (DECL_FRIEND_P (value
))
1760 return void_type_node
;
1762 #if 0 /* Just because a fn is declared doesn't mean we'll try to define it. */
1763 if (current_function_decl
&& ! IS_SIGNATURE (current_class_type
))
1764 cp_error ("method `%#D' of local class must be defined in class body",
1768 DECL_IN_AGGR_P (value
) = 1;
1771 my_friendly_abort (21);
1776 /* Like `grokfield', but for bitfields.
1777 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1780 grokbitfield (declarator
, declspecs
, width
)
1781 tree declarator
, declspecs
, width
;
1783 register tree value
= grokdeclarator (declarator
, declspecs
, BITFIELD
,
1786 if (! value
) return NULL_TREE
; /* friends went bad. */
1788 /* Pass friendly classes back. */
1789 if (TREE_CODE (value
) == VOID_TYPE
)
1790 return void_type_node
;
1792 if (TREE_CODE (value
) == TYPE_DECL
)
1794 cp_error ("cannot declare `%D' to be a bitfield type", value
);
1798 /* Usually, finish_struct_1 catches bitifields with invalid types.
1799 But, in the case of bitfields with function type, we confuse
1800 ourselves into thinking they are member functions, so we must
1802 if (TREE_CODE (value
) == FUNCTION_DECL
)
1804 cp_error ("cannot declare bitfield `%D' with funcion type",
1809 if (IS_SIGNATURE (current_class_type
))
1811 error ("field declaration not allowed in signature");
1812 return void_type_node
;
1815 if (DECL_IN_AGGR_P (value
))
1817 cp_error ("`%D' is already defined in the class %T", value
,
1818 DECL_CONTEXT (value
));
1819 return void_type_node
;
1822 GNU_xref_member (current_class_name
, value
);
1824 if (TREE_STATIC (value
))
1826 cp_error ("static member `%D' cannot be a bitfield", value
);
1829 cp_finish_decl (value
, NULL_TREE
, NULL_TREE
, 0, 0);
1831 if (width
!= error_mark_node
)
1833 constant_expression_warning (width
);
1834 DECL_INITIAL (value
) = width
;
1835 SET_DECL_C_BIT_FIELD (value
);
1838 DECL_IN_AGGR_P (value
) = 1;
1843 grokoptypename (declspecs
, declarator
)
1844 tree declspecs
, declarator
;
1846 tree t
= grokdeclarator (declarator
, declspecs
, TYPENAME
, 0, NULL_TREE
);
1847 return build_typename_overload (t
);
1850 /* When a function is declared with an initializer,
1851 do the right thing. Currently, there are two possibilities:
1856 // initialization possibility #1.
1857 virtual void f () = 0;
1879 // initialization possibility #2
1886 copy_assignment_arg_p (parmtype
, virtualp
)
1888 int virtualp ATTRIBUTE_UNUSED
;
1890 if (current_class_type
== NULL_TREE
)
1893 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
1894 parmtype
= TREE_TYPE (parmtype
);
1896 if ((TYPE_MAIN_VARIANT (parmtype
) == current_class_type
)
1898 /* Non-standard hack to support old Booch components. */
1899 || (! virtualp
&& DERIVED_FROM_P (parmtype
, current_class_type
))
1908 grok_function_init (decl
, init
)
1912 /* An initializer for a function tells how this function should
1914 tree type
= TREE_TYPE (decl
);
1916 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1917 cp_error ("initializer specified for non-member function `%D'", decl
);
1919 /* We'll check for this in finish_struct_1. */
1920 else if (DECL_VINDEX (decl
) == NULL_TREE
)
1921 cp_error ("initializer specified for non-virtual method `%D'", decl
);
1923 else if (integer_zerop (init
))
1926 /* Mark this function as being "defined". */
1927 DECL_INITIAL (decl
) = error_mark_node
;
1928 /* pure virtual destructors must be defined. */
1929 /* pure virtual needs to be defined (as abort) only when put in
1930 vtbl. For wellformed call, it should be itself. pr4737 */
1931 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl
)))
1933 extern tree abort_fndecl
;
1934 /* Give this node rtl from `abort'. */
1935 DECL_RTL (decl
) = DECL_RTL (abort_fndecl
);
1938 DECL_ABSTRACT_VIRTUAL_P (decl
) = 1;
1939 if (DECL_NAME (decl
) == ansi_opname
[(int) MODIFY_EXPR
])
1942 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
))));
1944 if (copy_assignment_arg_p (parmtype
, 1))
1945 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type
) = 1;
1949 cp_error ("invalid initializer for virtual method `%D'", decl
);
1953 cplus_decl_attributes (decl
, attributes
, prefix_attributes
)
1954 tree decl
, attributes
, prefix_attributes
;
1956 if (decl
== NULL_TREE
|| decl
== void_type_node
)
1959 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
1960 decl
= DECL_TEMPLATE_RESULT (decl
);
1962 decl_attributes (decl
, attributes
, prefix_attributes
);
1964 if (TREE_CODE (decl
) == TYPE_DECL
)
1965 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl
), TREE_TYPE (decl
));
1968 /* CONSTRUCTOR_NAME:
1969 Return the name for the constructor (or destructor) for the
1970 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1971 IDENTIFIER_NODE. When given a template, this routine doesn't
1972 lose the specialization. */
1975 constructor_name_full (thing
)
1978 if (TREE_CODE (thing
) == TEMPLATE_TYPE_PARM
1979 || TREE_CODE (thing
) == TEMPLATE_TEMPLATE_PARM
1980 || TREE_CODE (thing
) == TYPENAME_TYPE
)
1981 thing
= TYPE_NAME (thing
);
1982 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing
)))
1984 if (TYPE_WAS_ANONYMOUS (thing
) && TYPE_HAS_CONSTRUCTOR (thing
))
1985 thing
= DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing
), 0)));
1987 thing
= TYPE_NAME (thing
);
1989 if (TREE_CODE (thing
) == TYPE_DECL
1990 || (TREE_CODE (thing
) == TEMPLATE_DECL
1991 && TREE_CODE (DECL_TEMPLATE_RESULT (thing
)) == TYPE_DECL
))
1992 thing
= DECL_NAME (thing
);
1993 my_friendly_assert (TREE_CODE (thing
) == IDENTIFIER_NODE
, 197);
1997 /* CONSTRUCTOR_NAME:
1998 Return the name for the constructor (or destructor) for the
1999 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
2000 IDENTIFIER_NODE. When given a template, return the plain
2001 unspecialized name. */
2004 constructor_name (thing
)
2008 thing
= constructor_name_full (thing
);
2009 t
= IDENTIFIER_TEMPLATE (thing
);
2015 /* Cache the value of this class's main virtual function table pointer
2016 in a register variable. This will save one indirection if a
2017 more than one virtual function call is made this function. */
2022 extern tree base_init_expr
;
2024 if (base_init_expr
== 0
2025 && DECL_CONSTRUCTOR_P (current_function_decl
))
2027 if (processing_template_decl
)
2028 add_tree (build_min_nt
2030 current_member_init_list
, current_base_init_list
));
2032 emit_base_init (current_class_type
, 0);
2036 /* Record the existence of an addressable inline function. */
2039 mark_inline_for_output (decl
)
2042 decl
= DECL_MAIN_VARIANT (decl
);
2043 if (DECL_SAVED_INLINE (decl
))
2045 my_friendly_assert (TREE_PERMANENT (decl
), 363);
2046 DECL_SAVED_INLINE (decl
) = 1;
2048 VARRAY_TREE_INIT (saved_inlines
, 32, "saved_inlines");
2050 if (saved_inlines_used
== saved_inlines
->num_elements
)
2051 VARRAY_GROW (saved_inlines
,
2052 2 * saved_inlines
->num_elements
);
2053 VARRAY_TREE (saved_inlines
, saved_inlines_used
) = decl
;
2054 ++saved_inlines_used
;
2060 temp_name_counter
= 0;
2063 /* Hand off a unique name which can be used for variable we don't really
2064 want to know about anyway, for example, the anonymous variables which
2065 are needed to make references work. Declare this thing so we can use it.
2066 The variable created will be of type TYPE.
2068 STATICP is nonzero if this variable should be static. */
2071 get_temp_name (type
, staticp
)
2075 char buf
[sizeof (AUTO_TEMP_FORMAT
) + 20];
2077 int toplev
= toplevel_bindings_p ();
2079 push_obstacks_nochange ();
2080 if (toplev
|| staticp
)
2082 end_temporary_allocation ();
2083 sprintf (buf
, AUTO_TEMP_FORMAT
, global_temp_name_counter
++);
2084 decl
= pushdecl_top_level (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2088 sprintf (buf
, AUTO_TEMP_FORMAT
, temp_name_counter
++);
2089 decl
= pushdecl (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2091 TREE_USED (decl
) = 1;
2092 TREE_STATIC (decl
) = staticp
;
2093 DECL_ARTIFICIAL (decl
) = 1;
2095 /* If this is a local variable, then lay out its rtl now.
2096 Otherwise, callers of this function are responsible for dealing
2097 with this variable's rtl. */
2101 expand_decl_init (decl
);
2108 /* Get a variable which we can use for multiple assignments.
2109 It is not entered into current_binding_level, because
2110 that breaks things when it comes time to do final cleanups
2111 (which take place "outside" the binding contour of the function). */
2114 get_temp_regvar (type
, init
)
2119 decl
= build_decl (VAR_DECL
, NULL_TREE
, type
);
2120 TREE_USED (decl
) = 1;
2121 DECL_REGISTER (decl
) = 1;
2122 DECL_ARTIFICIAL (decl
) = 1;
2124 DECL_RTL (decl
) = assign_temp (type
, 2, 0, 1);
2125 /* We can expand these without fear, since they cannot need
2126 constructors or destructors. */
2127 expand_expr (build_modify_expr (decl
, INIT_EXPR
, init
),
2128 NULL_RTX
, VOIDmode
, 0);
2133 /* Hunts through the global anonymous union ANON_DECL, building
2134 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2135 returns a VAR_DECL whose size is the same as the size of the
2136 ANON_DECL, if one is available. */
2139 build_anon_union_vars (anon_decl
, elems
, static_p
, external_p
)
2145 tree type
= TREE_TYPE (anon_decl
);
2146 tree main_decl
= NULL_TREE
;
2149 for (field
= TYPE_FIELDS (type
);
2151 field
= TREE_CHAIN (field
))
2155 if (DECL_ARTIFICIAL (field
))
2157 if (TREE_CODE (field
) != FIELD_DECL
)
2159 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2164 if (TREE_PRIVATE (field
))
2165 cp_pedwarn_at ("private member `%#D' in anonymous union", field
);
2166 else if (TREE_PROTECTED (field
))
2167 cp_pedwarn_at ("protected member `%#D' in anonymous union", field
);
2169 if (DECL_NAME (field
) == NULL_TREE
2170 && TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
2172 decl
= build_anon_union_vars (field
, elems
, static_p
, external_p
);
2176 else if (DECL_NAME (field
) == NULL_TREE
)
2180 decl
= build_decl (VAR_DECL
, DECL_NAME (field
), TREE_TYPE (field
));
2181 /* tell `pushdecl' that this is not tentative. */
2182 DECL_INITIAL (decl
) = error_mark_node
;
2183 TREE_PUBLIC (decl
) = 0;
2184 TREE_STATIC (decl
) = static_p
;
2185 DECL_EXTERNAL (decl
) = external_p
;
2186 decl
= pushdecl (decl
);
2187 DECL_INITIAL (decl
) = NULL_TREE
;
2190 /* Only write out one anon union element--choose the one that
2191 can hold them all. */
2192 if (main_decl
== NULL_TREE
2193 && simple_cst_equal (DECL_SIZE (decl
),
2194 DECL_SIZE (anon_decl
)) == 1)
2197 /* ??? This causes there to be no debug info written out
2199 TREE_ASM_WRITTEN (decl
) = 1;
2201 if (DECL_NAME (field
) == NULL_TREE
2202 && TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
2203 /* The remainder of the processing was already done in the
2207 /* If there's a cleanup to do, it belongs in the
2208 TREE_PURPOSE of the following TREE_LIST. */
2209 *elems
= scratch_tree_cons (NULL_TREE
, decl
, *elems
);
2210 TREE_TYPE (*elems
) = type
;
2216 /* Finish off the processing of a UNION_TYPE structure.
2217 If there are static members, then all members are
2218 static, and must be laid out together. If the
2219 union is an anonymous union, we arrange for that
2220 as well. PUBLIC_P is nonzero if this union is
2221 not declared static. */
2224 finish_anon_union (anon_union_decl
)
2225 tree anon_union_decl
;
2227 tree type
= TREE_TYPE (anon_union_decl
);
2228 tree elems
= NULL_TREE
;
2230 int public_p
= TREE_PUBLIC (anon_union_decl
);
2231 int static_p
= TREE_STATIC (anon_union_decl
);
2232 int external_p
= DECL_EXTERNAL (anon_union_decl
);
2234 if (TYPE_FIELDS (type
) == NULL_TREE
)
2239 error ("global anonymous unions must be declared static");
2243 main_decl
= build_anon_union_vars (anon_union_decl
, &elems
,
2244 static_p
, external_p
);
2246 if (main_decl
== NULL_TREE
)
2248 warning ("anonymous union with no members");
2254 make_decl_rtl (main_decl
, 0, toplevel_bindings_p ());
2255 DECL_RTL (anon_union_decl
) = DECL_RTL (main_decl
);
2258 /* The following call assumes that there are never any cleanups
2259 for anonymous unions--a reasonable assumption. */
2260 expand_anon_union_decl (anon_union_decl
, NULL_TREE
, elems
);
2263 /* Finish processing a builtin type TYPE. It's name is NAME,
2264 its fields are in the array FIELDS. LEN is the number of elements
2265 in FIELDS minus one, or put another way, it is the maximum subscript
2268 It is given the same alignment as ALIGN_TYPE. */
2271 finish_builtin_type (type
, name
, fields
, len
, align_type
)
2280 TYPE_FIELDS (type
) = fields
[0];
2281 for (i
= 0; i
< len
; i
++)
2283 layout_type (TREE_TYPE (fields
[i
]));
2284 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2285 TREE_CHAIN (fields
[i
]) = fields
[i
+1];
2287 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2288 DECL_CLASS_CONTEXT (fields
[i
]) = type
;
2289 TYPE_ALIGN (type
) = TYPE_ALIGN (align_type
);
2291 #if 0 /* not yet, should get fixed properly later */
2292 TYPE_NAME (type
) = make_type_decl (get_identifier (name
), type
);
2294 TYPE_NAME (type
) = build_decl (TYPE_DECL
, get_identifier (name
), type
);
2296 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2297 layout_decl (TYPE_NAME (type
), 0);
2300 /* Auxiliary functions to make type signatures for
2301 `operator new' and `operator delete' correspond to
2302 what compiler will be expecting. */
2305 coerce_new_type (type
)
2310 if (TREE_CODE (type
) == METHOD_TYPE
)
2311 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (TYPE_ARG_TYPES (type
)));
2312 if (! same_type_p (TREE_TYPE (type
), ptr_type_node
))
2313 e1
= 1, error ("`operator new' must return type `void *'");
2315 /* Technically the type must be `size_t', but we may not know
2317 if (TYPE_ARG_TYPES (type
) == NULL_TREE
)
2318 e1
= 1, error ("`operator new' takes type `size_t' parameter");
2319 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type
)), sizetype
))
2320 e2
= 1, error ("`operator new' takes type `size_t' as first parameter");
2322 type
= build_function_type (ptr_type_node
, tree_cons (NULL_TREE
, sizetype
, TREE_CHAIN (TYPE_ARG_TYPES (type
))));
2324 type
= build_function_type (ptr_type_node
, TYPE_ARG_TYPES (type
));
2329 coerce_delete_type (type
)
2336 tree arg_types
= TYPE_ARG_TYPES (type
);
2338 if (TREE_CODE (type
) == METHOD_TYPE
)
2340 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (arg_types
));
2341 arg_types
= TREE_CHAIN (arg_types
);
2344 if (TREE_TYPE (type
) != void_type_node
)
2345 e1
= 1, error ("`operator delete' must return type `void'");
2347 if (arg_types
== NULL_TREE
2348 || ! same_type_p (TREE_VALUE (arg_types
), ptr_type_node
))
2349 e2
= 1, error ("`operator delete' takes type `void *' as first parameter");
2353 && TREE_CHAIN (arg_types
)
2354 && TREE_CHAIN (arg_types
) != void_list_node
)
2356 /* Again, technically this argument must be `size_t', but again
2357 we may not know what that is. */
2358 tree t2
= TREE_VALUE (TREE_CHAIN (arg_types
));
2359 if (! same_type_p (t2
, sizetype
))
2360 e3
= 1, error ("second argument to `operator delete' must be of type `size_t'");
2361 else if (TREE_CHAIN (TREE_CHAIN (arg_types
)) != void_list_node
)
2364 if (TREE_CHAIN (TREE_CHAIN (arg_types
)))
2365 error ("too many arguments in declaration of `operator delete'");
2367 error ("`...' invalid in specification of `operator delete'");
2372 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2373 build_tree_list (NULL_TREE
, sizetype
));
2376 if (arg_types
== NULL_TREE
)
2377 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
2379 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, TREE_CHAIN (arg_types
));
2385 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2386 arg_types
? TREE_CHAIN (arg_types
): NULL_TREE
);
2388 type
= build_function_type (void_type_node
, arg_types
);
2393 extern tree abort_fndecl
;
2396 mark_vtable_entries (decl
)
2399 tree entries
= CONSTRUCTOR_ELTS (DECL_INITIAL (decl
));
2401 for (; entries
; entries
= TREE_CHAIN (entries
))
2406 if (TREE_CODE (TREE_VALUE (entries
)) == NOP_EXPR
)
2410 fnaddr
= (flag_vtable_thunks
? TREE_VALUE (entries
)
2411 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries
)));
2412 fn
= TREE_OPERAND (fnaddr
, 0);
2413 TREE_ADDRESSABLE (fn
) = 1;
2414 if (DECL_LANG_SPECIFIC (fn
) && DECL_ABSTRACT_VIRTUAL_P (fn
))
2416 TREE_OPERAND (fnaddr
, 0) = fn
= copy_node (fn
);
2417 DECL_RTL (fn
) = DECL_RTL (abort_fndecl
);
2418 mark_used (abort_fndecl
);
2420 if (TREE_CODE (fn
) == THUNK_DECL
&& DECL_EXTERNAL (fn
))
2422 DECL_EXTERNAL (fn
) = 0;
2429 /* Set DECL up to have the closest approximation of "initialized common"
2430 linkage available. */
2433 comdat_linkage (decl
)
2437 make_decl_one_only (decl
);
2438 else if (TREE_CODE (decl
) == FUNCTION_DECL
|| DECL_VIRTUAL_P (decl
))
2439 /* We can just emit functions and vtables statically; it doesn't really
2440 matter if we have multiple copies. */
2441 TREE_PUBLIC (decl
) = 0;
2444 /* Static data member template instantiations, however, cannot
2445 have multiple copies. */
2446 if (DECL_INITIAL (decl
) == 0
2447 || DECL_INITIAL (decl
) == error_mark_node
)
2448 DECL_COMMON (decl
) = 1;
2449 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
2451 DECL_COMMON (decl
) = 1;
2452 DECL_INITIAL (decl
) = error_mark_node
;
2456 /* We can't do anything useful; leave vars for explicit
2458 DECL_EXTERNAL (decl
) = 1;
2459 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2463 if (DECL_LANG_SPECIFIC (decl
))
2464 DECL_COMDAT (decl
) = 1;
2467 /* For win32 we also want to put explicit instantiations in
2468 linkonce sections, so that they will be merged with implicit
2469 instantiations; otherwise we get duplicate symbol errors. */
2472 maybe_make_one_only (decl
)
2475 /* This is not necessary on targets that support weak symbols, because
2476 the implicit instantiations will defer to the explicit one. */
2477 if (! supports_one_only () || SUPPORTS_WEAK
)
2480 /* We can't set DECL_COMDAT on functions, or finish_file will think
2481 we can get away with not emitting them if they aren't used. We need
2482 to for variables so that cp_finish_decl will update their linkage,
2483 because their DECL_INITIAL may not have been set properly yet. */
2485 make_decl_one_only (decl
);
2487 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_LANG_SPECIFIC (decl
))
2488 DECL_COMDAT (decl
) = 1;
2491 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2492 based on TYPE and other static flags.
2494 Note that anything public is tagged TREE_PUBLIC, whether
2495 it's public in this file or in another one. */
2498 import_export_vtable (decl
, type
, final
)
2502 if (DECL_INTERFACE_KNOWN (decl
))
2505 if (TYPE_FOR_JAVA (type
))
2507 TREE_PUBLIC (decl
) = 1;
2508 DECL_EXTERNAL (decl
) = 1;
2509 DECL_INTERFACE_KNOWN (decl
) = 1;
2511 else if (CLASSTYPE_INTERFACE_KNOWN (type
))
2513 TREE_PUBLIC (decl
) = 1;
2514 DECL_EXTERNAL (decl
) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type
);
2515 DECL_INTERFACE_KNOWN (decl
) = 1;
2519 /* We can only wait to decide if we have real non-inline virtual
2520 functions in our class, or if we come from a template. */
2522 int found
= CLASSTYPE_TEMPLATE_INSTANTIATION (type
);
2524 if (! found
&& ! final
)
2527 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
2528 method
= TREE_CHAIN (method
))
2529 if (DECL_VINDEX (method
) != NULL_TREE
2530 && ! DECL_THIS_INLINE (method
)
2531 && ! DECL_ABSTRACT_VIRTUAL_P (method
))
2538 if (final
|| ! found
)
2540 comdat_linkage (decl
);
2541 DECL_EXTERNAL (decl
) = 0;
2545 TREE_PUBLIC (decl
) = 1;
2546 DECL_EXTERNAL (decl
) = 1;
2551 /* Determine whether or not we want to specifically import or export CTYPE,
2552 using various heuristics. */
2555 import_export_class (ctype
)
2558 /* -1 for imported, 1 for exported. */
2559 int import_export
= 0;
2561 if (CLASSTYPE_INTERFACE_KNOWN (ctype
))
2564 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2565 we will have CLASSTYPE_INTERFACE_ONLY set but not
2566 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2567 heuristic because someone will supply a #pragma implementation
2568 elsewhere, and deducing it here would produce a conflict. */
2569 if (CLASSTYPE_INTERFACE_ONLY (ctype
))
2572 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2573 /* FIXME this should really use some sort of target-independent macro. */
2574 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype
)))
2576 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype
)))
2580 /* If we got -fno-implicit-templates, we import template classes that
2581 weren't explicitly instantiated. */
2582 if (import_export
== 0
2583 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype
)
2584 && ! flag_implicit_templates
)
2587 /* Base our import/export status on that of the first non-inline,
2588 non-abstract virtual function, if any. */
2589 if (import_export
== 0
2590 && TYPE_VIRTUAL_P (ctype
)
2591 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2594 for (method
= TYPE_METHODS (ctype
); method
!= NULL_TREE
;
2595 method
= TREE_CHAIN (method
))
2597 if (DECL_VINDEX (method
) != NULL_TREE
2598 && !DECL_THIS_INLINE (method
)
2599 && !DECL_ABSTRACT_VIRTUAL_P (method
))
2601 import_export
= (DECL_REALLY_EXTERN (method
) ? -1 : 1);
2607 #ifdef MULTIPLE_SYMBOL_SPACES
2608 if (import_export
== -1)
2614 SET_CLASSTYPE_INTERFACE_KNOWN (ctype
);
2615 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype
) = (import_export
> 0);
2616 CLASSTYPE_INTERFACE_ONLY (ctype
) = (import_export
< 0);
2620 /* We need to describe to the assembler the relationship between
2621 a vtable and the vtable of the parent class. */
2624 output_vtable_inherit (vars
)
2630 op
[0] = XEXP (DECL_RTL (vars
), 0); /* strip the mem ref */
2632 parent
= binfo_for_vtable (vars
);
2634 if (parent
== TYPE_BINFO (DECL_CONTEXT (vars
)))
2638 parent
= TYPE_BINFO_VTABLE (BINFO_TYPE (parent
));
2639 op
[1] = XEXP (DECL_RTL (parent
), 0); /* strip the mem ref */
2642 my_friendly_abort (980826);
2644 output_asm_insn (".vtable_inherit %c0, %c1", op
);
2648 finish_vtable_vardecl (t
, data
)
2650 void *data ATTRIBUTE_UNUSED
;
2653 tree ctype
= DECL_CONTEXT (vars
);
2654 import_export_class (ctype
);
2655 import_export_vtable (vars
, ctype
, 1);
2657 if (! DECL_EXTERNAL (vars
)
2658 && (DECL_INTERFACE_KNOWN (vars
) || TREE_USED (vars
))
2659 && ! TREE_ASM_WRITTEN (vars
))
2662 mark_vtable_entries (vars
);
2663 if (TREE_TYPE (DECL_INITIAL (vars
)) == 0)
2664 store_init_value (vars
, DECL_INITIAL (vars
));
2666 if (write_symbols
== DWARF_DEBUG
|| write_symbols
== DWARF2_DEBUG
)
2668 /* Mark the VAR_DECL node representing the vtable itself as a
2669 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2670 It is rather important that such things be ignored because
2671 any effort to actually generate DWARF for them will run
2672 into trouble when/if we encounter code like:
2675 struct S { virtual void member (); };
2677 because the artificial declaration of the vtable itself (as
2678 manufactured by the g++ front end) will say that the vtable
2679 is a static member of `S' but only *after* the debug output
2680 for the definition of `S' has already been output. This causes
2681 grief because the DWARF entry for the definition of the vtable
2682 will try to refer back to an earlier *declaration* of the
2683 vtable as a static member of `S' and there won't be one.
2684 We might be able to arrange to have the "vtable static member"
2685 attached to the member list for `S' before the debug info for
2686 `S' get written (which would solve the problem) but that would
2687 require more intrusive changes to the g++ front end. */
2689 DECL_IGNORED_P (vars
) = 1;
2692 /* Always make vtables weak. */
2694 comdat_linkage (vars
);
2696 rest_of_decl_compilation (vars
, NULL_PTR
, 1, 1);
2699 output_vtable_inherit (vars
);
2703 else if (! TREE_USED (vars
))
2704 /* We don't know what to do with this one yet. */
2707 *t
= TREE_CHAIN (vars
);
2712 prune_vtable_vardecl (t
, data
)
2714 void *data ATTRIBUTE_UNUSED
;
2716 *t
= TREE_CHAIN (*t
);
2721 finish_sigtable_vardecl (t
, data
)
2723 void *data ATTRIBUTE_UNUSED
;
2725 /* We don't need to mark sigtable entries as addressable here as is done
2726 for vtables. Since sigtables, unlike vtables, are always written out,
2727 that was already done in build_signature_table_constructor. */
2729 rest_of_decl_compilation (*t
, NULL_PTR
, 1, 1);
2730 *t
= TREE_CHAIN (*t
);
2734 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2735 inline function or template instantiation at end-of-file. */
2738 import_export_decl (decl
)
2741 if (DECL_INTERFACE_KNOWN (decl
))
2744 if (DECL_TEMPLATE_INSTANTIATION (decl
)
2745 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2747 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2748 if ((DECL_IMPLICIT_INSTANTIATION (decl
)
2749 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2750 && (flag_implicit_templates
2751 || (flag_implicit_inline_templates
&& DECL_THIS_INLINE (decl
))))
2753 if (!TREE_PUBLIC (decl
))
2754 /* Templates are allowed to have internal linkage. See
2758 comdat_linkage (decl
);
2761 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2763 else if (DECL_FUNCTION_MEMBER_P (decl
))
2765 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2766 import_export_class (ctype
);
2767 if (CLASSTYPE_INTERFACE_KNOWN (ctype
)
2768 && (! DECL_ARTIFICIAL (decl
) || DECL_VINDEX (decl
)))
2770 DECL_NOT_REALLY_EXTERN (decl
)
2771 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2772 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2773 && !DECL_VINDEX (decl
)));
2775 /* Always make artificials weak. */
2776 if (DECL_ARTIFICIAL (decl
) && flag_weak
)
2777 comdat_linkage (decl
);
2779 maybe_make_one_only (decl
);
2782 comdat_linkage (decl
);
2784 else if (DECL_TINFO_FN_P (decl
))
2786 tree ctype
= TREE_TYPE (DECL_NAME (decl
));
2788 if (IS_AGGR_TYPE (ctype
))
2789 import_export_class (ctype
);
2791 if (IS_AGGR_TYPE (ctype
) && CLASSTYPE_INTERFACE_KNOWN (ctype
)
2792 && TYPE_VIRTUAL_P (ctype
)
2793 /* If the type is a cv-qualified variant of a type, then we
2794 must emit the tinfo function in this translation unit
2795 since it will not be emitted when the vtable for the type
2796 is output (which is when the unqualified version is
2798 && ctype
== TYPE_MAIN_VARIANT (ctype
))
2800 DECL_NOT_REALLY_EXTERN (decl
)
2801 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2802 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2803 && !DECL_VINDEX (decl
)));
2805 /* Always make artificials weak. */
2807 comdat_linkage (decl
);
2809 else if (TYPE_BUILT_IN (ctype
) && 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);
2915 /* Finish the process of running a particular set of global constructors
2916 or destructors. Subroutine of do_[cd]tors. */
2919 finish_objects (method_type
, initp
)
2920 int method_type
, initp
;
2922 char *fnname
= XSTR (XEXP (DECL_RTL (current_function_decl
), 0), 0);
2925 expand_end_bindings (getdecls (), 1, 0);
2928 finish_function (lineno
, 0, 0);
2930 if (initp
== DEFAULT_INIT_PRIORITY
)
2932 if (method_type
== 'I')
2933 assemble_constructor (fnname
);
2935 assemble_destructor (fnname
);
2938 #ifdef ASM_OUTPUT_SECTION_NAME
2939 /* If we're using init priority we can't use assemble_*tor, but on ELF
2940 targets we can stick the references into named sections for GNU ld
2945 sprintf (buf
, ".%ctors.%.5u", method_type
== 'I' ? 'c' : 'd',
2946 /* invert the numbering so the linker puts us in the proper
2947 order; constructors are run from right to left, and the
2948 linker sorts in increasing order. */
2949 MAX_INIT_PRIORITY
- initp
);
2950 named_section (NULL_TREE
, buf
, 0);
2951 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, fnname
),
2952 POINTER_SIZE
/ BITS_PER_UNIT
, 1);
2957 /* The names of the parameters to the function created to handle
2958 initializations and destructions for objects with static storage
2960 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2961 #define PRIORITY_IDENTIFIER "__priority"
2963 /* The name of the function we create to handle initializations and
2964 destructions for objects with static storage duration. */
2965 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2967 /* The declaration for the __INITIALIZE_P argument. */
2968 static tree initialize_p_decl
;
2970 /* The declaration for the __PRIORITY argument. */
2971 static tree priority_decl
;
2973 /* The declaration for the static storage duration function. */
2974 static tree ssdf_decl
;
2976 /* A map from priority levels to information about that priority
2977 level. There may be many such levels, so efficient lookup is
2979 static splay_tree priority_info_map
;
2981 /* Begins the generation of the function that will handle all
2982 initialization and destruction of objects with static storage
2983 duration. The function generated takes two parameters of type
2984 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2985 non-zero, it performs initializations. Otherwise, it performs
2986 destructions. It only performs those initializations or
2987 destructions with the indicated __PRIORITY. The generated function
2990 It is assumed that this function will only be called once per
2991 translation unit. */
2994 start_static_storage_duration_function ()
2999 /* Create the parameters. */
3000 parm_types
= void_list_node
;
3001 parm_types
= perm_tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
3002 parm_types
= perm_tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
3003 type
= build_function_type (void_type_node
, parm_types
);
3005 /* Create the FUNCTION_DECL itself. */
3006 ssdf_decl
= build_lang_decl (FUNCTION_DECL
,
3007 get_identifier (SSDF_IDENTIFIER
),
3009 TREE_PUBLIC (ssdf_decl
) = 0;
3010 DECL_ARTIFICIAL (ssdf_decl
) = 1;
3011 DECL_INLINE (ssdf_decl
) = 1;
3013 /* Create the argument list. */
3014 initialize_p_decl
= build_decl (PARM_DECL
,
3015 get_identifier (INITIALIZE_P_IDENTIFIER
),
3017 DECL_CONTEXT (initialize_p_decl
) = ssdf_decl
;
3018 DECL_ARG_TYPE (initialize_p_decl
) = integer_type_node
;
3019 TREE_USED (initialize_p_decl
) = 1;
3020 priority_decl
= build_decl (PARM_DECL
, get_identifier (PRIORITY_IDENTIFIER
),
3022 DECL_CONTEXT (priority_decl
) = ssdf_decl
;
3023 DECL_ARG_TYPE (priority_decl
) = integer_type_node
;
3024 TREE_USED (priority_decl
) = 1;
3026 TREE_CHAIN (initialize_p_decl
) = priority_decl
;
3027 DECL_ARGUMENTS (ssdf_decl
) = initialize_p_decl
;
3029 /* Start the function itself. This is equivalent to declarating the
3032 static inline void __ssdf (int __initialize_p, init __priority_p);
3034 It is static because we only need to call this function from the
3035 various constructor and destructor functions for this module. */
3036 start_function (/*specs=*/NULL_TREE
,
3038 /*attrs=*/NULL_TREE
,
3039 /*pre_parsed_p=*/1);
3041 /* Set up the scope of the outermost block in the function. */
3042 store_parm_decls ();
3046 expand_start_bindings (0);
3048 /* Initialize the map from priority numbers to information about
3049 that priority level. */
3050 priority_info_map
= splay_tree_new (splay_tree_compare_ints
,
3051 /*delete_key_fn=*/0,
3052 /*delete_value_fn=*/
3053 (splay_tree_delete_value_fn
) &free
);
3056 /* Generate the initialization code for the priority indicated in N. */
3059 generate_inits_for_priority (n
, data
)
3061 void *data ATTRIBUTE_UNUSED
;
3063 int priority
= (int) n
->key
;
3064 priority_info pi
= (priority_info
) n
->value
;
3066 /* For each priority N which has been used generate code which looks
3069 if (__priority == N) {
3076 We use the sequences we've accumulated to fill in the `...'s. */
3077 expand_start_cond (build_binary_op (EQ_EXPR
,
3079 build_int_2 (priority
, 0)),
3082 /* Do the initializations. */
3083 expand_start_cond (build_binary_op (NE_EXPR
,
3087 if (pi
->initialization_sequence
)
3091 push_to_sequence (pi
->initialization_sequence
);
3092 insns
= gen_sequence ();
3098 /* Do the destructions. */
3099 expand_start_else ();
3100 if (pi
->destruction_sequence
)
3104 push_to_sequence (pi
->destruction_sequence
);
3105 insns
= gen_sequence ();
3111 /* Close out the conditionals. */
3115 /* Don't stop iterating. */
3119 /* Finish the generation of the function which performs initialization
3120 and destruction of objects with static storage duration. After
3121 this point, no more such objects can be created. */
3124 finish_static_storage_duration_function ()
3126 splay_tree_foreach (priority_info_map
,
3127 generate_inits_for_priority
,
3130 /* Close out the function. */
3131 expand_end_bindings (getdecls (), 1, 0);
3134 finish_function (lineno
, 0, 0);
3137 /* Return the information about the indicated PRIORITY level. If no
3138 code to handle this level has yet been generated, generate the
3139 appropriate prologue. */
3141 static priority_info
3142 get_priority_info (priority
)
3148 n
= splay_tree_lookup (priority_info_map
,
3149 (splay_tree_key
) priority
);
3152 /* Create a new priority information structure, and insert it
3154 pi
= (priority_info
) xmalloc (sizeof (struct priority_info_s
));
3155 pi
->initialization_sequence
= NULL_RTX
;
3156 pi
->destruction_sequence
= NULL_RTX
;
3157 splay_tree_insert (priority_info_map
,
3158 (splay_tree_key
) priority
,
3159 (splay_tree_value
) pi
);
3162 pi
= (priority_info
) n
->value
;
3167 /* Generate code to do the static initialization of DECL. The
3168 initialization is INIT. If DECL may be initialized more than once
3169 in different object files, SENTRY is the guard variable to
3170 check. PRIORITY is the priority for the initialization. */
3173 do_static_initialization (decl
, init
, sentry
, priority
)
3181 /* Get the priority information for this PRIORITY, */
3182 pi
= get_priority_info (priority
);
3183 if (!pi
->initialization_sequence
)
3186 push_to_sequence (pi
->initialization_sequence
);
3188 /* Tell the debugger that we are at the location of the static
3189 variable in question. */
3190 emit_note (input_filename
, lineno
);
3192 /* If there's a SENTRY, we only do the initialization if it is
3193 zero, i.e., if we are the first to initialize it. */
3195 expand_start_cond (build_binary_op (EQ_EXPR
,
3196 build_unary_op (PREINCREMENT_EXPR
,
3202 /* Prepare a binding level for temporaries created during the
3204 expand_start_target_temps ();
3206 if (IS_AGGR_TYPE (TREE_TYPE (decl
))
3207 || TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
3208 expand_aggr_init (decl
, init
, 0);
3209 else if (TREE_CODE (init
) == TREE_VEC
)
3210 expand_expr (expand_vec_init (decl
, TREE_VEC_ELT (init
, 0),
3211 TREE_VEC_ELT (init
, 1),
3212 TREE_VEC_ELT (init
, 2), 0),
3213 const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3215 expand_assignment (decl
, init
, 0, 0);
3217 /* The expression might have involved increments and decrements. */
3220 /* Cleanup any temporaries needed for the initial value. */
3221 expand_end_target_temps ();
3223 /* Close the conditional opened above. */
3227 /* Save the sequence for later use. */
3228 pi
->initialization_sequence
= get_insns ();
3232 /* Generate code to do the static destruction of DECL. If DECL may be
3233 initialized more than once in different object files, SENTRY is the
3234 guard variable to check. PRIORITY is the priority for the
3238 do_static_destruction (decl
, sentry
, priority
)
3246 /* FIXME: We need destructions to be run in reverse order! */
3248 /* If we don't need a destructor, there's nothing to do. */
3249 if (!TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
3252 /* Get the priority information for this PRIORITY, */
3253 pi
= get_priority_info (priority
);
3254 if (!pi
->destruction_sequence
)
3257 push_to_sequence (pi
->destruction_sequence
);
3259 /* Start a new sequence to handle just this destruction. */
3262 /* Tell the debugger that we are at the location of the static
3263 variable in question. */
3264 emit_note (input_filename
, lineno
);
3266 /* If there's a SENTRY, we only do the initialization if it is
3267 one, i.e., if we are the last to initialize it. */
3269 expand_start_cond (build_binary_op (EQ_EXPR
,
3270 build_unary_op (PREDECREMENT_EXPR
,
3276 /* Actually to the destruction. */
3277 expand_expr_stmt (build_cleanup (decl
));
3279 /* Close the conditional opened above. */
3283 /* Insert the NEW_INSNS before the current insns. (Destructions are
3284 run in reverse order of initializations.) */
3285 new_insns
= gen_sequence ();
3287 if (pi
->destruction_sequence
)
3288 emit_insn_before (new_insns
, pi
->destruction_sequence
);
3290 emit_insn (new_insns
);
3292 /* Save the sequence for later use. */
3293 pi
->destruction_sequence
= get_insns ();
3297 /* Add code to the static storage duration function that will handle
3298 DECL (a static variable that needs initializing and/or destruction)
3299 with the indicated PRIORITY. If DECL needs initializing, INIT is
3303 do_static_initialization_and_destruction (decl
, init
)
3307 tree sentry
= NULL_TREE
;
3310 /* Deal gracefully with error. */
3311 if (decl
== error_mark_node
)
3314 /* The only things that can be initialized are variables. */
3315 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 19990420);
3317 /* If this object is not defined, we don't need to do anything
3319 if (DECL_EXTERNAL (decl
))
3322 /* Also, if the initializer already contains errors, we can bail out
3324 if (init
&& TREE_CODE (init
) == TREE_LIST
3325 && value_member (error_mark_node
, init
))
3328 /* Trick the compiler into thinking we are at the file and line
3329 where DECL was declared so that error-messages make sense, and so
3330 that the debugger will show somewhat sensible file and line
3332 input_filename
= DECL_SOURCE_FILE (decl
);
3333 lineno
= DECL_SOURCE_LINE (decl
);
3339 Access control for implicit calls to the constructors,
3340 the conversion functions, or the destructor called to
3341 create and destroy a static data member is performed as
3342 if these calls appeared in the scope of the member's
3345 we pretend we are in a static member function of the class of
3346 which the DECL is a member. */
3347 if (member_p (decl
))
3349 DECL_CLASS_CONTEXT (current_function_decl
) = DECL_CONTEXT (decl
);
3350 DECL_STATIC_FUNCTION_P (current_function_decl
) = 1;
3353 /* We need a sentry if this is an object with external linkage that
3354 might be initialized in more than one place. */
3355 if (TREE_PUBLIC (decl
) && (DECL_COMMON (decl
)
3356 || DECL_ONE_ONLY (decl
)
3357 || DECL_WEAK (decl
)))
3358 sentry
= get_sentry (DECL_ASSEMBLER_NAME (decl
));
3360 /* Generate the code to actually do the intialization and
3362 priority
= DECL_INIT_PRIORITY (decl
);
3364 priority
= DEFAULT_INIT_PRIORITY
;
3365 do_static_initialization (decl
, init
, sentry
, priority
);
3366 do_static_destruction (decl
, sentry
, priority
);
3368 /* Now that we're done with DECL we don't need to pretend to be a
3369 member of its class any longer. */
3370 DECL_CLASS_CONTEXT (current_function_decl
) = NULL_TREE
;
3371 DECL_STATIC_FUNCTION_P (current_function_decl
) = 0;
3374 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3375 (otherwise) that will initialize all gobal objects with static
3376 storage duration having the indicated PRIORITY. */
3379 generate_ctor_or_dtor_function (constructor_p
, priority
)
3386 /* We use `I' to indicate initialization and `D' to indicate
3393 /* Begin the function. */
3394 start_objects (function_key
, priority
);
3396 /* Call the static storage duration function with appropriate
3398 arguments
= tree_cons (NULL_TREE
, build_int_2 (priority
, 0),
3400 arguments
= tree_cons (NULL_TREE
, build_int_2 (constructor_p
, 0),
3402 expand_expr_stmt (build_function_call (ssdf_decl
, arguments
));
3404 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3405 calls to any functions marked with attributes indicating that
3406 they should be called at initialization- or destruction-time. */
3407 if (priority
== DEFAULT_INIT_PRIORITY
)
3411 for (fns
= constructor_p
? static_ctors
: static_dtors
;
3413 fns
= TREE_CHAIN (fns
))
3414 expand_expr_stmt (build_function_call (TREE_VALUE (fns
), NULL_TREE
));
3417 /* Close out the function. */
3418 finish_objects (function_key
, priority
);
3421 /* Generate constructor and destructor functions for the priority
3422 indicated by N. DATA is really an `int*', and it set to `1' if we
3423 process the DEFAULT_INIT_PRIORITY. */
3426 generate_ctor_and_dtor_functions_for_priority (n
, data
)
3430 int priority
= (int) n
->key
;
3431 priority_info pi
= (priority_info
) n
->value
;
3432 int *did_default_priority_p
= (int*) data
;
3434 if (priority
== DEFAULT_INIT_PRIORITY
)
3435 *did_default_priority_p
= 1;
3437 /* Generate the functions themselves, but only if they are really
3439 if (pi
->initialization_sequence
3440 || (priority
== DEFAULT_INIT_PRIORITY
&& static_ctors
))
3441 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3443 if (pi
->destruction_sequence
3444 || (priority
== DEFAULT_INIT_PRIORITY
&& static_dtors
))
3445 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3448 /* Keep iterating. */
3452 /* This routine is called from the last rule in yyparse ().
3453 Its job is to create all the code needed to initialize and
3454 destroy the global aggregates. We do the destruction
3455 first, since that way we only need to reverse the decls once. */
3461 int start_time
, this_time
;
3462 int did_default_priority_p
= 0;
3469 /* Bad parse errors. Just forget about it. */
3470 if (! global_bindings_p () || current_class_type
|| decl_namespace_list
)
3473 start_time
= get_run_time ();
3475 /* Otherwise, GDB can get confused, because in only knows
3476 about source for LINENO-1 lines. */
3479 interface_unknown
= 1;
3482 /* We now have to write out all the stuff we put off writing out.
3485 o Template specializations that we have not yet instantiated,
3486 but which are needed.
3487 o Initialization and destruction for non-local objects with
3488 static storage duration. (Local objects with static storage
3489 duration are initialized when their scope is first entered,
3490 and are cleaned up via atexit.)
3491 o Virtual function tables.
3493 All of these may cause others to be needed. For example,
3494 instantiating one function may cause another to be needed, and
3495 generating the intiailzer for an object may cause templates to be
3496 instantiated, etc., etc. */
3498 this_time
= get_run_time ();
3499 parse_time
-= this_time
- start_time
;
3500 varconst_time
+= this_time
- start_time
;
3501 start_time
= get_run_time ();
3502 permanent_allocation (1);
3504 /* Create the function that will contain all initializations and
3505 destructions for objects with static storage duration. We cannot
3506 conclude that because a symbol is not TREE_SYMBOL_REFERENCED the
3507 corresponding entity is not used until we call finish_function
3508 for the static storage duration function. We give C linkage to
3509 static constructors and destructors. */
3510 push_lang_context (lang_name_c
);
3511 start_static_storage_duration_function ();
3512 push_to_top_level ();
3518 /* If there are templates that we've put off instantiating, do
3520 instantiate_pending_templates ();
3522 /* Write out signature-tables and virtual tables as required.
3523 Note that writing out the virtual table for a template class
3524 may cause the instantiation of members of that class. */
3525 if (flag_handle_signatures
3526 && walk_globals (sigtable_decl_p
,
3527 finish_sigtable_vardecl
,
3530 if (walk_globals (vtable_decl_p
,
3531 finish_vtable_vardecl
,
3535 /* Come back to the static storage duration function; we're
3536 about to emit instructions there for static initializations
3538 pop_from_top_level ();
3539 /* The list of objects with static storage duration is built up
3540 in reverse order, so we reverse it here. We also clear
3541 STATIC_AGGREGATES so that any new aggregates added during the
3542 initialization of these will be initialized in the correct
3543 order when we next come around the loop. */
3544 vars
= nreverse (static_aggregates
);
3545 static_aggregates
= NULL_TREE
;
3548 if (! TREE_ASM_WRITTEN (TREE_VALUE (vars
)))
3549 rest_of_decl_compilation (TREE_VALUE (vars
), 0, 1, 1);
3550 do_static_initialization_and_destruction (TREE_VALUE (vars
),
3551 TREE_PURPOSE (vars
));
3553 vars
= TREE_CHAIN (vars
);
3555 push_to_top_level ();
3557 /* Go through the various inline functions, and see if any need
3559 for (i
= 0; i
< saved_inlines_used
; ++i
)
3561 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3562 import_export_decl (decl
);
3563 if (DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
3565 && (! DECL_REALLY_EXTERN (decl
) || DECL_INLINE (decl
)))
3567 /* Even though we're already at the top-level, we push
3568 there again. That way, when we pop back a few lines
3569 hence, all of our state is restored. Otherwise,
3570 finish_function doesn't clean things up, and we end
3571 up with CURRENT_FUNCTION_DECL set. */
3572 push_to_top_level ();
3573 if (DECL_TINFO_FN_P (decl
))
3574 synthesize_tinfo_fn (decl
);
3576 synthesize_method (decl
);
3577 pop_from_top_level ();
3584 /* Finish up the static storage duration function, now that we now
3585 there can be no more things in need of initialization or
3587 pop_from_top_level ();
3588 finish_static_storage_duration_function ();
3590 /* Generate initialization and destruction functions for all
3591 priorities for which they are required. */
3592 if (priority_info_map
)
3593 splay_tree_foreach (priority_info_map
,
3594 generate_ctor_and_dtor_functions_for_priority
,
3595 &did_default_priority_p
);
3597 if (!did_default_priority_p
)
3599 /* Even if there were no explicit initializations or
3600 destructions required, we may still have to handle the
3601 default priority if there functions declared as constructors
3602 or destructors via attributes. */
3604 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3605 DEFAULT_INIT_PRIORITY
);
3607 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3608 DEFAULT_INIT_PRIORITY
);
3611 /* We're done with the splay-tree now. */
3612 if (priority_info_map
)
3613 splay_tree_delete (priority_info_map
);
3615 /* We're done with static constructors, so we can go back to "C++"
3617 pop_lang_context ();
3619 /* Mark all functions that might deal with exception-handling as
3621 mark_all_runtime_matches ();
3623 /* Now delete from the chain of variables all virtual function tables.
3624 We output them all ourselves, because each will be treated
3626 walk_globals (vtable_decl_p
, prune_vtable_vardecl
, /*data=*/0);
3628 /* We'll let wrapup_global_declarations handle the inline functions,
3629 but it will be fooled by DECL_NOT_REALL_EXTERN funtions, so we
3630 fix them up here. */
3631 for (i
= 0; i
< saved_inlines_used
; ++i
)
3633 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3635 if (DECL_NOT_REALLY_EXTERN (decl
) && !DECL_COMDAT (decl
)
3636 && DECL_INITIAL (decl
))
3637 DECL_EXTERNAL (decl
) = 0;
3640 /* We haven't handled non-local objects that don't need dynamic
3641 initialization. Do that now. */
3646 /* Above, we hung back on weak functions; they will be defined
3647 where they are needed. But, here we loop again, so that we
3648 output the things that *are* needed. */
3649 for (i
= 0; i
< saved_inlines_used
; ++i
)
3651 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3653 if (DECL_NOT_REALLY_EXTERN (decl
)
3654 && DECL_INITIAL (decl
)
3655 && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl
)))
3656 DECL_EXTERNAL (decl
) = 0;
3659 if (saved_inlines_used
3660 && wrapup_global_declarations (&VARRAY_TREE (saved_inlines
, 0),
3661 saved_inlines_used
))
3664 if (walk_namespaces (wrapup_globals_for_namespace
, /*data=*/0))
3667 /* Static data members are just like namespace-scope globals. */
3668 for (i
= 0; i
< pending_statics_used
; ++i
)
3670 tree decl
= VARRAY_TREE (pending_statics
, i
);
3671 if (TREE_ASM_WRITTEN (decl
))
3673 import_export_decl (decl
);
3674 if (DECL_NOT_REALLY_EXTERN (decl
) && ! DECL_IN_AGGR_P (decl
))
3675 DECL_EXTERNAL (decl
) = 0;
3678 && wrapup_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3679 pending_statics_used
))
3684 /* Now, issue warnings about static, but not defined, functions,
3686 walk_namespaces (wrapup_globals_for_namespace
, /*data=*/&reconsider
);
3690 this_time
= get_run_time ();
3691 parse_time
-= this_time
- start_time
;
3692 varconst_time
+= this_time
- start_time
;
3694 if (flag_detailed_statistics
)
3696 dump_tree_statistics ();
3697 dump_time_statistics ();
3701 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3702 expr. Since it was parsed like a type, we need to wade through and fix
3703 that. Unfortunately, since operator() is left-associative, we can't use
3704 tail recursion. In the above example, TYPE is `A', and DECL is
3707 Maybe this shouldn't be recursive, but how often will it actually be
3711 reparse_absdcl_as_expr (type
, decl
)
3714 /* do build_functional_cast (type, NULL_TREE) at bottom */
3715 if (TREE_OPERAND (decl
, 0) == NULL_TREE
)
3716 return build_functional_cast (type
, NULL_TREE
);
3719 decl
= reparse_absdcl_as_expr (type
, TREE_OPERAND (decl
, 0));
3721 decl
= build_x_function_call (decl
, NULL_TREE
, current_class_ref
);
3723 if (TREE_CODE (decl
) == CALL_EXPR
3724 && (! TREE_TYPE (decl
)
3725 || TREE_CODE (TREE_TYPE (decl
)) != VOID_TYPE
))
3726 decl
= require_complete_type (decl
);
3731 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3732 out to be an expr. Since it was parsed like a type, we need to wade
3733 through and fix that. Since casts are right-associative, we are
3734 reversing the order, so we don't have to recurse.
3736 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3740 reparse_absdcl_as_casts (decl
, expr
)
3745 if (TREE_CODE (expr
) == CONSTRUCTOR
3746 && TREE_TYPE (expr
) == 0)
3748 type
= groktypename (TREE_VALUE (TREE_OPERAND (decl
, 1)));
3749 decl
= TREE_OPERAND (decl
, 0);
3751 if (IS_SIGNATURE (type
))
3753 error ("cast specifies signature type");
3754 return error_mark_node
;
3757 expr
= digest_init (type
, expr
, (tree
*) 0);
3758 if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_SIZE (type
) == 0)
3760 int failure
= complete_array_type (type
, expr
, 1);
3762 my_friendly_abort (78);
3768 type
= groktypename (TREE_VALUE (TREE_OPERAND (decl
, 1)));
3769 decl
= TREE_OPERAND (decl
, 0);
3770 expr
= build_c_cast (type
, expr
);
3773 if (warn_old_style_cast
)
3774 warning ("use of old-style cast");
3779 /* Given plain tree nodes for an expression, build up the full semantics. */
3782 build_expr_from_tree (t
)
3785 if (t
== NULL_TREE
|| t
== error_mark_node
)
3788 switch (TREE_CODE (t
))
3790 case IDENTIFIER_NODE
:
3791 return do_identifier (t
, 0, NULL_TREE
);
3794 if (LOOKUP_EXPR_GLOBAL (t
))
3795 return do_scoped_id (TREE_OPERAND (t
, 0), 0);
3797 return do_identifier (TREE_OPERAND (t
, 0), 0, NULL_TREE
);
3799 case TEMPLATE_ID_EXPR
:
3800 return (lookup_template_function
3801 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3802 build_expr_from_tree (TREE_OPERAND (t
, 1))));
3805 return build_x_indirect_ref
3806 (build_expr_from_tree (TREE_OPERAND (t
, 0)), "unary *");
3809 return build_functional_cast
3810 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3812 case REINTERPRET_CAST_EXPR
:
3813 return build_reinterpret_cast
3814 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3816 case CONST_CAST_EXPR
:
3817 return build_const_cast
3818 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3820 case DYNAMIC_CAST_EXPR
:
3821 return build_dynamic_cast
3822 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3824 case STATIC_CAST_EXPR
:
3825 return build_static_cast
3826 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3828 case PREDECREMENT_EXPR
:
3829 case PREINCREMENT_EXPR
:
3830 case POSTDECREMENT_EXPR
:
3831 case POSTINCREMENT_EXPR
:
3835 case TRUTH_NOT_EXPR
:
3837 case CONVERT_EXPR
: /* Unary + */
3840 return build_x_unary_op (TREE_CODE (t
),
3841 build_expr_from_tree (TREE_OPERAND (t
, 0)));
3846 case TRUNC_DIV_EXPR
:
3848 case FLOOR_DIV_EXPR
:
3849 case ROUND_DIV_EXPR
:
3850 case EXACT_DIV_EXPR
:
3852 case BIT_ANDTC_EXPR
:
3855 case TRUNC_MOD_EXPR
:
3856 case FLOOR_MOD_EXPR
:
3857 case TRUTH_ANDIF_EXPR
:
3858 case TRUTH_ORIF_EXPR
:
3859 case TRUTH_AND_EXPR
:
3874 return build_x_binary_op
3876 build_expr_from_tree (TREE_OPERAND (t
, 0)),
3877 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3880 return build_m_component_ref
3881 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3882 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3885 return build_offset_ref (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
3888 if (TREE_OPERAND (t
, 0) == NULL_TREE
)
3890 return build_parse_node (ARRAY_REF
, NULL_TREE
,
3891 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3892 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3893 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3898 tree r
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3899 if (TREE_CODE_CLASS (TREE_CODE (r
)) != 't')
3901 return TREE_CODE (t
) == SIZEOF_EXPR
? c_sizeof (r
) : c_alignof (r
);
3905 return build_x_modify_expr
3906 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3907 TREE_CODE (TREE_OPERAND (t
, 1)),
3908 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3911 return build_x_arrow
3912 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3916 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3917 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3918 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3919 NEW_EXPR_USE_GLOBAL (t
));
3922 return delete_sanity
3923 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3924 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3925 DELETE_EXPR_USE_VEC (t
), DELETE_EXPR_USE_GLOBAL (t
));
3928 if (TREE_OPERAND (t
, 1) == NULL_TREE
)
3929 return build_x_compound_expr
3930 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3932 my_friendly_abort (42);
3934 case METHOD_CALL_EXPR
:
3935 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3937 tree ref
= TREE_OPERAND (t
, 0);
3938 return build_scoped_method_call
3939 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3940 build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3941 TREE_OPERAND (ref
, 1),
3942 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3946 tree fn
= TREE_OPERAND (t
, 0);
3948 /* We can get a TEMPLATE_ID_EXPR here on code like:
3952 so we must resolve that. However, we can also get things
3953 like a BIT_NOT_EXPR here, when referring to a destructor,
3954 and things like that are not correctly resolved by
3955 build_expr_from_tree. So, just use build_expr_from_tree
3956 when we really need it. */
3957 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3958 fn
= build_expr_from_tree (fn
);
3960 return build_method_call
3961 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3963 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3964 NULL_TREE
, LOOKUP_NORMAL
);
3968 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3970 tree ref
= TREE_OPERAND (t
, 0);
3971 return build_member_call
3972 (build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3973 TREE_OPERAND (ref
, 1),
3974 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3978 tree name
= TREE_OPERAND (t
, 0);
3980 tree args
= build_expr_from_tree (TREE_OPERAND (t
, 1));
3981 if (args
!= NULL_TREE
&& TREE_CODE (name
) == LOOKUP_EXPR
3982 && !LOOKUP_EXPR_GLOBAL (name
)
3983 && TREE_CODE ((id
= TREE_OPERAND (name
, 0))) == IDENTIFIER_NODE
3984 && (!current_class_type
3985 || !lookup_member (current_class_type
, id
, 0, 0)))
3987 /* Do Koenig lookup if there are no class members. */
3988 name
= do_identifier (id
, 0, args
);
3990 else if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
3991 || ! really_overloaded_fn (name
))
3992 name
= build_expr_from_tree (name
);
3993 return build_x_function_call (name
, args
, current_class_ref
);
3997 return build_x_conditional_expr
3998 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3999 build_expr_from_tree (TREE_OPERAND (t
, 1)),
4000 build_expr_from_tree (TREE_OPERAND (t
, 2)));
4004 tree purpose
, value
, chain
;
4006 if (t
== void_list_node
)
4009 purpose
= TREE_PURPOSE (t
);
4011 purpose
= build_expr_from_tree (purpose
);
4012 value
= TREE_VALUE (t
);
4014 value
= build_expr_from_tree (value
);
4015 chain
= TREE_CHAIN (t
);
4016 if (chain
&& chain
!= void_type_node
)
4017 chain
= build_expr_from_tree (chain
);
4018 return expr_tree_cons (purpose
, value
, chain
);
4022 return build_x_component_ref
4023 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4024 TREE_OPERAND (t
, 1), NULL_TREE
, 1);
4027 return build_throw (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4033 /* digest_init will do the wrong thing if we let it. */
4034 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
4037 r
= build_nt (CONSTRUCTOR
, NULL_TREE
,
4038 build_expr_from_tree (CONSTRUCTOR_ELTS (t
)));
4039 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
4042 return digest_init (TREE_TYPE (t
), r
, 0);
4047 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t
, 0))) == 't')
4048 return get_typeid (TREE_OPERAND (t
, 0));
4049 return build_x_typeid (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4052 return convert_from_reference (t
);
4059 /* This is something of the form `int (*a)++' that has turned out to be an
4060 expr. It was only converted into parse nodes, so we need to go through
4061 and build up the semantics. Most of the work is done by
4062 build_expr_from_tree, above.
4064 In the above example, TYPE is `int' and DECL is `*a'. */
4067 reparse_decl_as_expr (type
, decl
)
4070 decl
= build_expr_from_tree (decl
);
4072 return build_functional_cast (type
, build_expr_list (NULL_TREE
, decl
));
4077 /* This is something of the form `int (*a)' that has turned out to be a
4078 decl. It was only converted into parse nodes, so we need to do the
4079 checking that make_{pointer,reference}_declarator do. */
4082 finish_decl_parsing (decl
)
4085 extern int current_class_depth
;
4087 switch (TREE_CODE (decl
))
4089 case IDENTIFIER_NODE
:
4092 return make_pointer_declarator
4093 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4095 return make_reference_declarator
4096 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4098 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4101 push_nested_class (TREE_TYPE (TREE_OPERAND (decl
, 0)), 3);
4102 TREE_COMPLEXITY (decl
) = current_class_depth
;
4105 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4108 /* For attribute handling. */
4109 TREE_VALUE (decl
) = finish_decl_parsing (TREE_VALUE (decl
));
4112 my_friendly_abort (5);
4118 check_cp_case_value (value
)
4121 if (value
== NULL_TREE
)
4124 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4125 STRIP_TYPE_NOPS (value
);
4127 if (TREE_READONLY_DECL_P (value
))
4129 value
= decl_constant_value (value
);
4130 STRIP_TYPE_NOPS (value
);
4132 value
= fold (value
);
4134 if (TREE_CODE (value
) != INTEGER_CST
4135 && value
!= error_mark_node
)
4137 cp_error ("case label `%E' does not reduce to an integer constant",
4139 value
= error_mark_node
;
4142 /* Promote char or short to int. */
4143 value
= default_conversion (value
);
4145 constant_expression_warning (value
);
4150 /* Return 1 if root encloses child. */
4153 is_namespace_ancestor (root
, child
)
4158 if (root
== global_namespace
)
4160 if (child
== global_namespace
)
4162 return is_namespace_ancestor (root
, CP_DECL_CONTEXT (child
));
4166 /* Return the namespace that is the common ancestor
4167 of two given namespaces. */
4170 namespace_ancestor (ns1
, ns2
)
4173 if (is_namespace_ancestor (ns1
, ns2
))
4175 return namespace_ancestor (CP_DECL_CONTEXT (ns1
), ns2
);
4178 /* Insert used into the using list of user. Set indirect_flag if this
4179 directive is not directly from the source. Also find the common
4180 ancestor and let our users know about the new namespace */
4182 add_using_namespace (user
, used
, indirect
)
4188 /* Using oneself is a no-op. */
4191 my_friendly_assert (TREE_CODE (user
) == NAMESPACE_DECL
, 380);
4192 my_friendly_assert (TREE_CODE (used
) == NAMESPACE_DECL
, 380);
4193 /* Check if we already have this. */
4194 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
4198 /* Promote to direct usage. */
4199 TREE_INDIRECT_USING (t
) = 0;
4203 /* Add used to the user's using list. */
4204 DECL_NAMESPACE_USING (user
)
4205 = perm_tree_cons (used
, namespace_ancestor (user
, used
),
4206 DECL_NAMESPACE_USING (user
));
4208 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
4210 /* Add user to the used's users list. */
4211 DECL_NAMESPACE_USERS (used
)
4212 = perm_tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
4214 /* Recursively add all namespaces used. */
4215 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
4216 /* indirect usage */
4217 add_using_namespace (user
, TREE_PURPOSE (t
), 1);
4219 /* Tell everyone using us about the new used namespaces. */
4220 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
4221 add_using_namespace (TREE_PURPOSE (t
), used
, 1);
4224 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4225 duplicates. The first list becomes the tail of the result.
4227 The algorithm is O(n^2). We could get this down to O(n log n) by
4228 doing a sort on the addresses of the functions, if that becomes
4232 merge_functions (s1
, s2
)
4236 for (; s2
; s2
= OVL_NEXT (s2
))
4238 tree fn
= OVL_CURRENT (s2
);
4239 if (! ovl_member (fn
, s1
))
4240 s1
= build_overload (fn
, s1
);
4245 /* This should return an error not all definitions define functions.
4246 It is not an error if we find two functions with exactly the
4247 same signature, only if these are selected in overload resolution.
4248 old is the current set of bindings, new the freshly-found binding.
4249 XXX Do we want to give *all* candidates in case of ambiguity?
4250 XXX In what way should I treat extern declarations?
4251 XXX I don't want to repeat the entire duplicate_decls here */
4254 ambiguous_decl (name
, old
, new, flags
)
4261 my_friendly_assert (old
!= NULL_TREE
, 393);
4262 /* Copy the value. */
4263 val
= BINDING_VALUE (new);
4265 switch (TREE_CODE (val
))
4268 /* If we expect types or namespaces, and not templates,
4269 or this is not a template class. */
4270 if (LOOKUP_QUALIFIERS_ONLY (flags
)
4271 && !DECL_CLASS_TEMPLATE_P (val
))
4275 if (LOOKUP_NAMESPACES_ONLY (flags
))
4278 case NAMESPACE_DECL
:
4279 if (LOOKUP_TYPES_ONLY (flags
))
4283 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4287 if (!BINDING_VALUE (old
))
4288 BINDING_VALUE (old
) = val
;
4289 else if (val
&& val
!= BINDING_VALUE (old
))
4291 if (is_overloaded_fn (BINDING_VALUE (old
))
4292 && is_overloaded_fn (val
))
4294 BINDING_VALUE (old
) = merge_functions (BINDING_VALUE (old
),
4299 /* Some declarations are functions, some are not. */
4300 if (flags
& LOOKUP_COMPLAIN
)
4302 /* If we've already given this error for this lookup,
4303 BINDING_VALUE (old) is error_mark_node, so let's not
4304 repeat ourselves. */
4305 if (BINDING_VALUE (old
) != error_mark_node
)
4307 cp_error ("use of `%D' is ambiguous", name
);
4308 cp_error_at (" first declared as `%#D' here",
4309 BINDING_VALUE (old
));
4311 cp_error_at (" also declared as `%#D' here", val
);
4313 return error_mark_node
;
4316 /* ... and copy the type. */
4317 type
= BINDING_TYPE (new);
4318 if (LOOKUP_NAMESPACES_ONLY (flags
))
4320 if (!BINDING_TYPE (old
))
4321 BINDING_TYPE (old
) = type
;
4322 else if (type
&& BINDING_TYPE (old
) != type
)
4324 if (flags
& LOOKUP_COMPLAIN
)
4326 cp_error ("`%D' denotes an ambiguous type",name
);
4327 cp_error_at (" first type here", BINDING_TYPE (old
));
4328 cp_error_at (" other type here", type
);
4334 /* Add the bindings of name in used namespaces to val.
4335 The using list is defined by usings, and the lookup goes to scope.
4336 Returns zero on errors. */
4339 lookup_using_namespace (name
, val
, usings
, scope
, flags
)
4340 tree name
, val
, usings
, scope
;
4345 /* Iterate over all used namespaces in current, searching for using
4346 directives of scope. */
4347 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4348 if (TREE_VALUE (iter
) == scope
)
4350 val1
= binding_for_name (name
, TREE_PURPOSE (iter
));
4351 /* Resolve ambiguities. */
4352 val
= ambiguous_decl (name
, val
, val1
, flags
);
4354 return val
!= error_mark_node
;
4358 Excepts the name to lookup and its qualifying scope.
4359 Returns the name/type pair found into the CPLUS_BINDING result,
4363 qualified_lookup_using_namespace (name
, scope
, result
, flags
)
4369 /* Maintain a list of namespaces visited... */
4370 tree seen
= NULL_TREE
;
4371 /* ... and a list of namespace yet to see. */
4372 tree todo
= NULL_TREE
;
4374 while (scope
&& (result
!= error_mark_node
))
4376 seen
= temp_tree_cons (scope
, NULL_TREE
, seen
);
4377 result
= ambiguous_decl (name
, result
,
4378 binding_for_name (name
, scope
), flags
);
4379 if (!BINDING_VALUE (result
) && !BINDING_TYPE (result
))
4380 /* Consider using directives. */
4381 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4382 usings
= TREE_CHAIN (usings
))
4383 /* If this was a real directive, and we have not seen it. */
4384 if (!TREE_INDIRECT_USING (usings
)
4385 && !purpose_member (TREE_PURPOSE (usings
), seen
))
4386 todo
= temp_tree_cons (TREE_PURPOSE (usings
), NULL_TREE
, todo
);
4389 scope
= TREE_PURPOSE (todo
);
4390 todo
= TREE_CHAIN (todo
);
4393 scope
= NULL_TREE
; /* If there never was a todo list. */
4395 return result
!= error_mark_node
;
4398 /* [namespace.memdef]/2 */
4400 /* Set the context of a declaration to scope. Complain if we are not
4404 set_decl_namespace (decl
, scope
, friendp
)
4410 if (scope
== std_node
)
4411 scope
= global_namespace
;
4412 /* Get rid of namespace aliases. */
4413 scope
= ORIGINAL_NAMESPACE (scope
);
4415 /* It is ok for friends to be qualified in parallel space. */
4416 if (!friendp
&& !is_namespace_ancestor (current_namespace
, scope
))
4417 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4419 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
4420 if (scope
!= current_namespace
)
4422 /* See whether this has been declared in the namespace. */
4423 old
= namespace_binding (DECL_NAME (decl
), scope
);
4425 /* No old declaration at all. */
4427 if (!is_overloaded_fn (decl
))
4428 /* Don't compare non-function decls with decls_match here,
4429 since it can't check for the correct constness at this
4430 point. pushdecl will find those errors later. */
4432 /* Since decl is a function, old should contain a function decl. */
4433 if (!is_overloaded_fn (old
))
4435 for (; old
; old
= OVL_NEXT (old
))
4436 if (decls_match (decl
, OVL_CURRENT (old
)))
4442 cp_error ("`%D' should have been declared inside `%D'",
4446 /* Compute the namespace where a declaration is defined. */
4449 decl_namespace (decl
)
4452 while (DECL_CONTEXT (decl
))
4454 decl
= DECL_CONTEXT (decl
);
4455 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4457 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 't')
4458 decl
= TYPE_STUB_DECL (decl
);
4459 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 390);
4462 return global_namespace
;
4465 /* Return the namespace where the current declaration is declared. */
4468 current_decl_namespace ()
4471 /* If we have been pushed into a different namespace, use it. */
4472 if (decl_namespace_list
)
4473 return TREE_PURPOSE (decl_namespace_list
);
4475 if (current_class_type
)
4476 result
= decl_namespace (TYPE_STUB_DECL (current_class_type
));
4477 else if (current_function_decl
)
4478 result
= decl_namespace (current_function_decl
);
4480 result
= current_namespace
;
4484 /* Temporarily set the namespace for the current declaration. */
4487 push_decl_namespace (decl
)
4490 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
4491 decl
= decl_namespace (decl
);
4492 decl_namespace_list
= tree_cons (decl
, NULL_TREE
, decl_namespace_list
);
4496 pop_decl_namespace ()
4498 decl_namespace_list
= TREE_CHAIN (decl_namespace_list
);
4501 /* Enter a class or namespace scope. */
4507 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4508 push_decl_namespace (t
);
4513 /* Leave scope pushed by push_scope. */
4519 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4520 pop_decl_namespace ();
4525 /* [basic.lookup.koenig] */
4526 /* A non-zero return value in the functions below indicates an error.
4527 All nodes allocated in the procedure are on the scratch obstack. */
4537 static int arg_assoc
PROTO((struct arg_lookup
*, tree
));
4538 static int arg_assoc_args
PROTO((struct arg_lookup
*, tree
));
4539 static int arg_assoc_type
PROTO((struct arg_lookup
*, tree
));
4540 static int add_function
PROTO((struct arg_lookup
*, tree
));
4541 static int arg_assoc_namespace
PROTO((struct arg_lookup
*, tree
));
4542 static int arg_assoc_class
PROTO((struct arg_lookup
*, tree
));
4544 /* Add a function to the lookup structure.
4545 Returns 1 on error. */
4548 add_function (k
, fn
)
4549 struct arg_lookup
*k
;
4552 if (ovl_member (fn
, k
->functions
))
4554 /* We must find only functions, or exactly one non-function. */
4555 if (k
->functions
&& is_overloaded_fn (k
->functions
)
4556 && is_overloaded_fn (fn
))
4557 k
->functions
= build_overload (fn
, k
->functions
);
4561 tree f1
= OVL_CURRENT (k
->functions
);
4563 if (is_overloaded_fn (f1
))
4565 fn
= f1
; f1
= f2
; f2
= fn
;
4567 cp_error_at ("`%D' is not a function,", f1
);
4568 cp_error_at (" conflict with `%D'", f2
);
4569 cp_error (" in call to `%D'", k
->name
);
4577 /* Add functions of a namespace to the lookup structure.
4578 Returns 1 on error. */
4581 arg_assoc_namespace (k
, scope
)
4582 struct arg_lookup
*k
;
4587 if (purpose_member (scope
, k
->namespaces
))
4589 k
->namespaces
= tree_cons (scope
, NULL_TREE
, k
->namespaces
);
4591 value
= namespace_binding (k
->name
, scope
);
4595 for (; value
; value
= OVL_NEXT (value
))
4596 if (add_function (k
, OVL_CURRENT (value
)))
4602 /* Adds everything associated with class to the lookup structure.
4603 Returns 1 on error. */
4606 arg_assoc_class (k
, type
)
4607 struct arg_lookup
* k
;
4610 tree list
, friends
, context
;
4613 if (purpose_member (type
, k
->classes
))
4615 k
->classes
= tree_cons (type
, NULL_TREE
, k
->classes
);
4617 context
= decl_namespace (TYPE_MAIN_DECL (type
));
4618 if (arg_assoc_namespace (k
, context
))
4621 /* Process baseclasses. */
4622 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (type
); i
++)
4623 if (arg_assoc_class (k
, TYPE_BINFO_BASETYPE (type
, i
)))
4626 /* Process friends. */
4627 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
4628 list
= TREE_CHAIN (list
))
4629 if (k
->name
== TREE_PURPOSE (list
))
4630 for (friends
= TREE_VALUE (list
); friends
;
4631 friends
= TREE_CHAIN (friends
))
4632 /* Only interested in global functions with potentially hidden
4633 (i.e. unqualified) declarations. */
4634 if (TREE_PURPOSE (list
) == error_mark_node
&& TREE_VALUE (list
)
4635 && decl_namespace (TREE_VALUE (list
)) == context
)
4636 if (add_function (k
, TREE_VALUE (list
)))
4639 /* Process template arguments. */
4640 if (CLASSTYPE_TEMPLATE_INFO (type
))
4642 list
= innermost_args (CLASSTYPE_TI_ARGS (type
));
4643 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
4644 arg_assoc (k
, TREE_VEC_ELT (list
, i
));
4650 /* Adds everything associated with a given type.
4651 Returns 1 on error. */
4654 arg_assoc_type (k
, type
)
4655 struct arg_lookup
*k
;
4658 switch (TREE_CODE (type
))
4668 if (TYPE_PTRMEMFUNC_P (type
))
4669 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
4670 return arg_assoc_class (k
, type
);
4672 case REFERENCE_TYPE
:
4674 return arg_assoc_type (k
, TREE_TYPE (type
));
4677 return arg_assoc_namespace (k
, decl_namespace (TYPE_MAIN_DECL (type
)));
4679 /* Pointer to member: associate class type and value type. */
4680 if (arg_assoc_type (k
, TYPE_OFFSET_BASETYPE (type
)))
4682 return arg_assoc_type (k
, TREE_TYPE (type
));
4684 /* The basetype is referenced in the first arg type, so just
4687 /* Associate the parameter types. */
4688 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
4690 /* Associate the return type. */
4691 return arg_assoc_type (k
, TREE_TYPE (type
));
4692 case TEMPLATE_TYPE_PARM
:
4693 case TEMPLATE_TEMPLATE_PARM
:
4696 if (type
== unknown_type_node
)
4698 /* else fall through */
4700 my_friendly_abort (390);
4705 /* Adds everything associated with arguments. Returns 1 on error. */
4708 arg_assoc_args (k
, args
)
4709 struct arg_lookup
* k
;
4712 for (; args
; args
= TREE_CHAIN (args
))
4713 if (arg_assoc (k
, TREE_VALUE (args
)))
4718 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4722 struct arg_lookup
* k
;
4725 if (n
== error_mark_node
)
4728 if (TREE_CODE_CLASS (TREE_CODE (n
)) == 't')
4729 return arg_assoc_type (k
, n
);
4731 if (! type_unknown_p (n
))
4732 return arg_assoc_type (k
, TREE_TYPE (n
));
4734 if (TREE_CODE (n
) == ADDR_EXPR
)
4735 n
= TREE_OPERAND (n
, 0);
4736 if (TREE_CODE (n
) == COMPONENT_REF
)
4737 n
= TREE_OPERAND (n
, 1);
4738 while (TREE_CODE (n
) == TREE_LIST
)
4741 if (TREE_CODE (n
) == FUNCTION_DECL
)
4742 return arg_assoc_type (k
, TREE_TYPE (n
));
4743 if (TREE_CODE (n
) == TEMPLATE_ID_EXPR
)
4745 /* [basic.lookup.koenig]
4747 If T is a template-id, its associated namespaces and classes
4748 are the namespace in which the template is defined; for
4749 member templates, the member template's class; the namespaces
4750 and classes associated with the types of the template
4751 arguments provided for template type parameters (excluding
4752 template template parameters); the namespaces in which any
4753 template template arguments are defined; and the classes in
4754 which any member templates used as template template
4755 arguments are defined. [Note: non-type template arguments do
4756 not contribute to the set of associated namespaces. ] */
4757 tree
template = TREE_OPERAND (n
, 0);
4758 tree args
= TREE_OPERAND (n
, 1);
4762 /* First, the template. There may actually be more than one if
4763 this is an overloaded function template. But, in that case,
4764 we only need the first; all the functions will be in the same
4766 template = OVL_CURRENT (template);
4768 ctx
= CP_DECL_CONTEXT (template);
4770 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4772 if (arg_assoc_namespace (k
, ctx
) == 1)
4775 /* It must be a member template. */
4776 else if (arg_assoc_class (k
, ctx
) == 1)
4779 /* Now the arguments. */
4780 for (arg
= args
; arg
!= NULL_TREE
; arg
= TREE_CHAIN (arg
))
4782 tree t
= TREE_VALUE (arg
);
4784 if (TREE_CODE (t
) == TEMPLATE_DECL
)
4786 ctx
= CP_DECL_CONTEXT (t
);
4787 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4789 if (arg_assoc_namespace (k
, ctx
) == 1)
4792 else if (arg_assoc_class (k
, ctx
) == 1)
4795 else if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
4796 && arg_assoc_type (k
, t
) == 1)
4802 my_friendly_assert (TREE_CODE (n
) == OVERLOAD
, 980715);
4804 for (; n
; n
= OVL_CHAIN (n
))
4805 if (arg_assoc_type (k
, TREE_TYPE (OVL_FUNCTION (n
))))
4812 /* Performs Koenig lookup depending on arguments, where fns
4813 are the functions found in normal lookup. */
4816 lookup_arg_dependent (name
, fns
, args
)
4821 struct arg_lookup k
;
4824 k
.namespaces
= NULL_TREE
;
4825 k
.classes
= NULL_TREE
;
4827 push_scratch_obstack ();
4828 arg_assoc_args (&k
, args
);
4833 /* Process a namespace-alias declaration. */
4836 do_namespace_alias (alias
, namespace)
4837 tree alias
, namespace;
4839 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
4841 /* The parser did not find it, so it's not there. */
4842 cp_error ("unknown namespace `%D'", namespace);
4846 namespace = ORIGINAL_NAMESPACE (namespace);
4848 /* Build the alias. */
4849 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
4850 DECL_NAMESPACE_ALIAS (alias
) = namespace;
4854 /* Check a non-member using-declaration. Return the name and scope
4855 being used, and the USING_DECL, or NULL_TREE on failure. */
4858 validate_nonmember_using_decl (decl
, scope
, name
)
4863 if (TREE_CODE (decl
) == SCOPE_REF
4864 && TREE_OPERAND (decl
, 0) == std_node
)
4866 if (namespace_bindings_p ()
4867 && current_namespace
== global_namespace
)
4868 /* There's no need for a using declaration at all, here,
4869 since `std' is the same as `::'. We can't just pass this
4870 on because we'll complain later about declaring something
4871 in the same scope as a using declaration with the same
4872 name. We return NULL_TREE which indicates to the caller
4873 that there's no need to do any further processing. */
4876 *scope
= global_namespace
;
4877 *name
= TREE_OPERAND (decl
, 1);
4879 else if (TREE_CODE (decl
) == SCOPE_REF
)
4881 *scope
= TREE_OPERAND (decl
, 0);
4882 *name
= TREE_OPERAND (decl
, 1);
4884 /* [namespace.udecl]
4886 A using-declaration for a class member shall be a
4887 member-declaration. */
4888 if (TREE_CODE (*scope
) != NAMESPACE_DECL
)
4890 if (TYPE_P (*scope
))
4891 cp_error ("`%T' is not a namespace", *scope
);
4893 cp_error ("`%D' is not a namespace", *scope
);
4897 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
4898 || TREE_CODE (decl
) == TYPE_DECL
4899 || TREE_CODE (decl
) == TEMPLATE_DECL
)
4901 *scope
= global_namespace
;
4905 my_friendly_abort (382);
4906 if (TREE_CODE_CLASS (TREE_CODE (*name
)) == 'd')
4907 *name
= DECL_NAME (*name
);
4908 /* Make a USING_DECL. */
4909 return push_using_decl (*scope
, *name
);
4912 /* Process local and global using-declarations. */
4915 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, newval
, newtype
)
4917 tree oldval
, oldtype
;
4918 tree
*newval
, *newtype
;
4921 struct tree_binding _decls
;
4923 *newval
= *newtype
= NULL_TREE
;
4924 decls
= binding_init (&_decls
);
4925 if (!qualified_lookup_using_namespace (name
, scope
, decls
, 0))
4929 if (!BINDING_VALUE (decls
) && !BINDING_TYPE (decls
))
4931 cp_error ("`%D' not declared", name
);
4935 /* Check for using functions. */
4936 if (BINDING_VALUE (decls
) && is_overloaded_fn (BINDING_VALUE (decls
)))
4940 if (oldval
&& !is_overloaded_fn (oldval
))
4942 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls
)), oldval
);
4947 for (tmp
= BINDING_VALUE (decls
); tmp
; tmp
= OVL_NEXT (tmp
))
4949 tree new_fn
= OVL_CURRENT (tmp
);
4951 /* [namespace.udecl]
4953 If a function declaration in namespace scope or block
4954 scope has the same name and the same parameter types as a
4955 function introduced by a using declaration the program is
4957 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
4959 tree old_fn
= OVL_CURRENT (tmp1
);
4961 if (!OVL_USED (tmp1
)
4962 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn
)),
4963 TYPE_ARG_TYPES (TREE_TYPE (old_fn
))))
4965 /* There was already a non-using declaration in
4966 this scope with the same parameter types. */
4967 cp_error ("`%D' is already declared in this scope",
4971 else if (duplicate_decls (new_fn
, old_fn
))
4972 /* We're re-using something we already used
4973 before. We don't need to add it again. */
4977 /* If we broke out of the loop, there's no reason to add
4978 this function to the using declarations for this
4983 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
4984 if (TREE_CODE (*newval
) != OVERLOAD
)
4985 *newval
= ovl_cons (*newval
, NULL_TREE
);
4986 OVL_USED (*newval
) = 1;
4991 *newval
= BINDING_VALUE (decls
);
4993 duplicate_decls (*newval
, oldval
);
4996 *newtype
= BINDING_TYPE (decls
);
4997 if (oldtype
&& *newtype
&& oldtype
!= *newtype
)
4999 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5005 /* Process a using-declaration not appearing in class or local scope. */
5008 do_toplevel_using_decl (decl
)
5011 tree scope
, name
, binding
;
5012 tree oldval
, oldtype
, newval
, newtype
;
5014 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5015 if (decl
== NULL_TREE
)
5018 binding
= binding_for_name (name
, current_namespace
);
5020 oldval
= BINDING_VALUE (binding
);
5021 oldtype
= BINDING_TYPE (binding
);
5023 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5025 /* Copy declarations found. */
5027 BINDING_VALUE (binding
) = newval
;
5029 BINDING_TYPE (binding
) = newtype
;
5033 /* Process a using-declaration at function scope. */
5036 do_local_using_decl (decl
)
5040 tree oldval
, oldtype
, newval
, newtype
;
5042 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5043 if (decl
== NULL_TREE
)
5046 oldval
= lookup_name_current_level (name
);
5047 oldtype
= lookup_type_current_level (name
);
5049 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5053 if (is_overloaded_fn (newval
))
5057 /* We only need to push declarations for those functions
5058 that were not already bound in the current level.
5059 The old value might be NULL_TREE, it might be a single
5060 function, or an OVERLOAD. */
5061 if (oldval
&& TREE_CODE (oldval
) == OVERLOAD
)
5062 term
= OVL_FUNCTION (oldval
);
5065 for (fn
= newval
; fn
&& OVL_CURRENT (fn
) != term
;
5067 push_overloaded_decl (OVL_CURRENT (fn
),
5068 PUSH_LOCAL
| PUSH_USING
);
5071 push_local_binding (name
, newval
, PUSH_USING
);
5074 set_identifier_type_value (name
, newtype
);
5078 do_class_using_decl (decl
)
5083 if (TREE_CODE (decl
) != SCOPE_REF
5084 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl
, 0))) != 't')
5086 cp_error ("using-declaration for non-member at class scope");
5089 name
= TREE_OPERAND (decl
, 1);
5090 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
5092 cp_error ("using-declaration for destructor");
5095 if (TREE_CODE (name
) == TYPE_DECL
)
5096 name
= DECL_NAME (name
);
5098 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 980716);
5100 value
= build_lang_field_decl (USING_DECL
, name
, void_type_node
);
5101 DECL_INITIAL (value
) = TREE_OPERAND (decl
, 0);
5105 /* Process a using-directive. */
5108 do_using_directive (namespace)
5111 if (namespace == std_node
)
5113 /* using namespace A::B::C; */
5114 if (TREE_CODE (namespace) == SCOPE_REF
)
5115 namespace = TREE_OPERAND (namespace, 1);
5116 if (TREE_CODE (namespace) == IDENTIFIER_NODE
)
5118 /* Lookup in lexer did not find a namespace. */
5119 cp_error ("namespace `%T' undeclared", namespace);
5122 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
5124 cp_error ("`%T' is not a namespace", namespace);
5127 namespace = ORIGINAL_NAMESPACE (namespace);
5128 if (!toplevel_bindings_p ())
5129 push_using_directive (namespace);
5132 add_using_namespace (current_namespace
, namespace, 0);
5136 check_default_args (x
)
5139 tree arg
= TYPE_ARG_TYPES (TREE_TYPE (x
));
5140 int saw_def
= 0, i
= 0 - (TREE_CODE (TREE_TYPE (x
)) == METHOD_TYPE
);
5141 for (; arg
&& arg
!= void_list_node
; arg
= TREE_CHAIN (arg
), ++i
)
5143 if (TREE_PURPOSE (arg
))
5147 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5158 TREE_USED (decl
) = 1;
5159 if (processing_template_decl
)
5161 assemble_external (decl
);
5163 /* Is it a synthesized method that needs to be synthesized? */
5164 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CLASS_CONTEXT (decl
)
5165 && DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
5166 /* Kludge: don't synthesize for default args. */
5167 && current_function_decl
)
5168 synthesize_method (decl
);
5170 /* If this is a function or variable that is an instance of some
5171 template, we now know that we will need to actually do the
5172 instantiation. A TEMPLATE_DECL may also have DECL_TEMPLATE_INFO,
5173 if it's a partial instantiation, but there's no need to
5174 instantiate such a thing. We check that DECL is not an explicit
5175 instantiation because that is not checked in instantiate_decl. */
5176 if (TREE_CODE (decl
) != TEMPLATE_DECL
5177 && DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
5178 && !DECL_EXPLICIT_INSTANTIATION (decl
))
5179 instantiate_decl (decl
);
5182 /* Helper function for named_class_head_sans_basetype nonterminal. We
5183 have just seen something of the form `AGGR SCOPE::ID'. Return a
5184 TYPE_DECL for the type declared by ID in SCOPE. */
5187 handle_class_head (aggr
, scope
, id
)
5188 tree aggr
, scope
, id
;
5192 if (TREE_CODE (id
) == TYPE_DECL
)
5194 else if (DECL_CLASS_TEMPLATE_P (id
))
5195 decl
= DECL_TEMPLATE_RESULT (id
);
5199 cp_error ("`%T' does not have a nested type named `%D'", scope
, id
);
5201 cp_error ("no file-scope type named `%D'", id
);
5203 decl
= TYPE_MAIN_DECL (xref_tag (aggr
, make_anon_name (), 1));
5206 /* This syntax is only allowed when we're defining a type, so we
5208 push_scope (CP_DECL_CONTEXT (decl
));
5210 /* If we see something like:
5212 template <typename T> struct S::I ....
5214 we must create a TEMPLATE_DECL for the nested type. */
5215 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5216 decl
= push_template_decl (decl
);